Yarmuhammat Nizamudun, Naoshi Nakaya, Yukari Hagihara and Yuji Koui
Recently Wireless Sensor Network (WSN) technology has been developing remarkably and it’s expected to be applied to many applications such as plant management, crime prevention, disaster prevention, medical treatment, traffic systems, and so on. In this article, we propose a Mobile Sink node control method for Wireless Sensor Networks. These WNS Networks are composed from two types of sensor node, one a “fixed node” which is immovable, and the other one a “mobile sink node” which is movable. The fixed nodes will form the clusters, and then the Mobile Sink node by using the Nearest Addition Method of TSP (Traveling Salesman Problem) which moves around the cluster center, decides the best rotation of the communication among the clusters, following which it decides the best fixed node to make the shortest distance of communication. The chosen best fixed node will transfer its data to the Mobile Sink node when it reaches them. Moreover the mobile Sink node is also capable to sense the possibility of communication of more than a few clusters in between, from then it would identify the best path for collecting the data. This method has proved its efficiency from the results of simulation and experiments that we have conducted and it would evaluate the performance of route cost for a mobile sink node.
Keywords: Wireless Sensor Network (WSN), route cost, mobile sink node, cluster, Traveling Salesman Problem (TSP)
Mabruk Fekihal, Ibrahim Jaluta and Izzeldin Osman
Many spatial databases management systems use R-tree or one of its variants as an index for efficient access of spatial objects in the database. However, update operations on R-tree index structure such as page split, object insertion, and object deletion are not efficient. Page-split in R-tree and its variants is a very expensive operation, searching for an object or deleting an object may follow several paths from the root page to the target leaf page. Moreover, recovery algorithms for R-tree and its variants can be quite complex. In this paper, we present a new Multidimensional index structure, RB+-tree, that performs search, insert, and delete operations efficiently as in B±tree. In our RB+-tree algorithms only one path is followed when executing search, insert, or delete operations. The RB+-tree structure-modification operations such as page split or merge are done in a simple way as in B+-tree. The performance of the range searching (window queries) in our RB+-tree index may not match that of the R-tree or its variants, because sophisticated split algorithms were used in R-tree and its variants to minimize the overlap.
Keywords: multidimensional index, R-tree, spatial database
V. Dehghan, Sh. Khadivi and A. Farahi
Finding meaningful association from basket data is one of the oldest problems in data mining. The solution is analyzing and mining relational rules. In this paper we are going to prepare a proper approach to find traffic influence in routes, as association rules, this approach contains data mining techniques and clustering methods. First, by different clustering methods, rotes are grouped into homogeneous clusters and then extract the rules from each of detected clusters. This approach reduced the needs for searching in massive data list and caused producing interesting rules with low cost time. Finally the best clustering method will proposed with respect to the results of produced association rules.
Keywords: Association Rules, Community Detection, Data Mining, Graph Clustering, Transaction Data, Traffic
Yee Ming Chen and Jhang-Guo Chen
Time requirements for the solving of complex large-scale engineering problems can be substantially reduced by using parallel computation. Motivated by a computationally demanding weapon-target allocation (WTA) problem, we in-troduce a parallel implementation of a stochastic population based global optimizer, the particle swarm algorithm(PSO) as a means of obtaining increased computational throughput. The parallelization has been carried out on one of the simplest and flexible optimization algorithms, namely the PSO with digital pheromones algorithm. PSO is a stochastic population global optimizer and the initial population may be provided with random values and later convergence may be achieved. The use of message passing interfaces (MPI) for the parallelization of the synchronous version of PSO is proposed. In this approach, initial population has been divided between the processors chosen at run time. The parallelization of the Particle Swarm Optimization (PSO) with digital pheromones algorithm is detailed and its performance and characteristics demonstrated for the jamming resource allocation problem as example.
Keywords: Particle swarm algorithm, Message passing interfaces, Optimal allocation
Mohammad Nabizadeh Gangaraj, Sam Jabbehdari and Ahmad Khadem-Zadeh
By increasing information exchange and developing computer networks, diversity of attack is grown. Most of attacks are mixture of a series of events and abnormal happenings that are mainly called time-delayed attacks. They are not effectively recognized by current intrusion detection systems. We suggest using MLP neural network and CNN for detection of time delay attacks. MLP neural network noticeably can detect real-time attack and CNN neural network can assist to MLP for detection of time delay attacks. Our suggested method by using KDD Cup99 data set results in increasing detection of Probe attacks and denial of service (DoS) without increasing of false alarm rate.
Keywords: MLP, CNN, Anomaly, Detection Rate and False Alarm Rate
Mohammad Reza Nouri Rad and Reza Kourdy
Various network topologies such as meshes and bruijn used for Network on Chip (NoCs). In particular, much attention has focused on mesh-based topologies that was a project studies and develops a Network-on-Chip (NoCs). In this paper, we consider four parameters, such as their relatively short hop-count that enables lower latency and effect on the time of transfer data between cores, impact of fault and bandwidth utilization for evaluation of mesh and bruijn architectures. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.
Keywords: Network on chip (NoC), Bruijn,mesh, MPSoC (Multiprocessor Systems-on-Chip), performance
Sam Jabbehdari, Anahita Sanandaji and Nasser Modiri
In mobile ad hoc networks, the IEEE 802.11 CSMA/CA is widely deployed as the primary MAC layer protocol to schedule the access to the wireless medium. This protocol was designed with the assumption that nodes would never deviate from the protocol. However, nodes may purposefully show misbehavior at MAC layer in order to obtain more bandwidth, conserver its resources, degrade the network performance or disrupt the services of the network. In this paper, we introduce several types of MAC layer misbehaviors, and evaluate their impact on performance of other well-behaved nodes using extensive simulations. To mitigate the negative effects of misbehaving nodes we introduce a novel scheme, which is a combination of detection and reaction mechanisms. Our scheme is robust against colluding nodes and provides an effective mechanism to react against misbehaved nodes. Employing a misbehavior scenario in a simulated network, we study the efficiency of our scheme. Particularly, we demonstrate that by implementing our solution, all nodes are able to gain a fair share of throughput in network.
Keywords: MANET, DSR, MAC layer misbehavior, Selfish misbehavior, Detection and reaction schemes
S. Goswami and A. Chakrabarti
Clustering is one of the main tasks in exploratory data analysis and descriptive statistics where the main objective is partitioning observations in groups. Clustering has a broad range of application in varied domains like climate, business, information retrieval, biology, psychology, to name a few. A variety of methods and algorithms have been developed for clustering tasks in the last few decades. We observe that most of these algorithms define a cluster in terms of value of the attributes, density, distance etc. However these definitions fail to attach a clear meaning/semantics to the generated clusters. We argue that clusters having understandable and distinct semantics defined in terms of quartiles/halves are more appealing to business analysts than the clusters defined by data boundaries or prototypes. On the same premise, we propose our new algorithm named as quartile clustering technique. Through a series of experiments we establish efficacy of this algorithm. We demonstrate that the quartile clustering technique adds clear meaning to each of the clusters compared to K-means. We use DB Index to measure goodness of the clusters and show our method is comparable to EM (Expectation Maximization), PAM (Partition around Medoid) and K Means. We have explored its capability in detecting outlier and the benefit of added semantics. We discuss some of the limitations in its present form and also provide a rough direction in addressing the issue of merging the generated clusters.
Keywords: Data Mining, Clustering Algorithm, Semantics, Quartiles, Outlier
Reza Kourdy and Mohammad Reza Nouri Rad
Networks on chips (NoCs) have introduced as a remedy for the growing problems of current interconnection VLSI chips. Being a relatively new domain in research, simulation tools for NoCs are scarce. To fill the gap, we use network simulator NS-2 for simulating the Generalized de Bruijn as Fault Tolerant topology in NoCs, especially at high-level chip design. The huge library of network elements with its flexibility to accommodate customized designs like (ASIC), caused to network simulator 2 (NS-2) becomes available choice for NoCs. We propose a flexible simulation of the Generalized de Bruijn for network-on-chip which can be use to simulate various parameters of performance and quality of service.
Keywords: NoC (Network on chip), Quality-of-services (QOS), de Bruijn, Fault Tolerant topology, NS2
Sam Jabbehdari, Samira Hosseini Talari and Nasser Modiri
In mobile ad hoc networks (MANET), wireless nodes can freely and dynamically self-organize into temporary ‘‘ad-hoc’’ network topologies with no need to pre-existing fixed infrastructure. As mobile ad hoc networks have far more vulnerabilities than the traditional wired networks, security is much more difficult to maintain in the MANET. Malicious nodes and attackers can abuse the vulnerabilities to conduct a lot of passive and active attacks in different layers of the network. In preventive security mechanisms, the conventional approaches such as secure routing, authentication and encryption are used to provide first line of defense but they can no longer protect the network from evolving threats. Therefore, intrusion detection and protection systems (IPS) appear as a second line of defense to safeguard the MANET from threats. In this paper, we propose an anomaly based intrusion detection system (IDS) using a neural network scheme to reach near zero false positive and false negative ratios. To that end, we simulated a mobile ad hoc network and implemented the anomaly based IDS to detect one of the most damaging attacks, the DoS attack over MANET. By analyzing intrusion detection results, we reached the zero false detection ratios and high detection rate.
Keywords: Attack, Intrusion Detection System, MANET, Neural Network, Security
Saurabh Upadhyay and Sanjay Kumar Singh
Video authentication has gained much attention in recent years. However many existed authentication techniques have their own advantages and obvious drawbacks; we propose a novel authentication technique which uses an intelligent approach for video authentication. Our methodology is a learning based methodology which uses SVM (support vector machine) for learning and classification purpose and a video database as sample data. The proposed algorithm does not require the computation and storage of any digital signature or embedding of any watermark. Therefore it works for raw videos (videos captured in any situation), and useful for real life application of authentication. It covers all kinds of tampering attacks of spatial and temporal tampering. It uses a database of more than 1200 tampered and non-tampered videos and gives excellent results with 94.57% classification accuracy.
Keywords: Authentication, Fragile watermarking, Digital signature, Intelligent techniques
Ahmed Talib, Massudi Mahmuddin, Husniza Husni and Loay E. George
Classification of images into photographic (PG) and computer graphic (CG) images is useful in many applications such as web searching, image indexing and video classification. Distinguishing between PG and CG is still a challenging task, in spite of many studies that have been conducted. Their attained accuracy remained behind the acceptable level, ranging from 70% to 90%. Those studies claim that their systems produce good results but actually this occurs in a limited domain (for specific datasets). This paper presents components of classification system and techniques used in these components extensively, and highlight the important factors that influence each component. Moreover, effectiveness of these factors on three terms of performance (speed, accuracy and diversity) is discussed. This study guides the researchers to contribute and improves the results in this field by providing them the influencing and important factors.
Keywords: Image Classification; Computer Generated Images; Influencing Factors; Machine Learning
Imtiez Fliss and Moncef Tagina
In this paper an on-line multiple faults detection approach is first of all proposed. For efficiency, an optimal design of membership functions is required. Thus, the proposed approach is improved using Particle Swarm Optimization (PSO) technique. The inputs of the proposed approaches are residuals representing the numerical evaluation of Analytical Redundancy Relations. These residuals are generated due to the use of bond graph modeling. The results of the fuzzy detection modules are displayed as a colored causal graph. A comparison between the results obtained by using PSO and those given by the use of Genetic Algorithms (GA) is finally made. The experiments focus on a simulation of the three-tank hydraulic system, a benchmark in the diagnosis domain.
Keywords: multiple faults detection, fuzzy logic reasoning, Particle Swarm Optimization, Genetic Algorithms
Elaheh Jahani and Reza Azmi
One of the efforts has been made to accomplish preserve network security is intrusion detection systems(IDS). In this paper, an evolutionary memetic algorithm, which uses a local search is proposed for generating rules. In local search two approaches are used for selecting offspring. The evolutionary memetic algorithm is used variable-length chromosome with a mask for each feature. In addition, confidence value is defined for each feature which uses in changing mask in micro-mutation stage, will causes decrease false positive rate. Empirical results clearly shows that the detection rate is improved compared with traditional intrusion detection approach, and normal, known intrusion and unknown intrusion are distinguished with high accuracy.
Keywords: Intrusion Detection Systems, Computational Intelligence, Memetic Algorithm
Sanjay Kumar Dubey, Abhishek Jain and Ajay Rana
Object oriented approach is the underlying principle in the current scenario for a quality software development. Object oriented technology present the real domain picture of the software system and helps in aggregation of discrete objects. Incorporating object oriented methodology improves the quality of the software system. Hence, quality evaluation of software system is necessary before its implementation. In order to evaluate quality of software system various models have been proposed by researchers and practitioners. This paper surveys various quality models and found that there is no dedicated model for object oriented system. Therefore, present paper proposes a Model for Object Oriented Software QUAlity (MOOSQUA). Analytical Hierarchy Process ( AHP) technique is used to evaluate the quality of proposed model in a single score. This proposed model may be beneficial in the terms of selection of better quality software system.
Keywords: Object Oriented, Quality, Model, Analytical Hierarchy Process
M. P. Sivaram Kumar and S. Rajasekaran
One of the major impacts of climatic changes is due to destroying of forest. Destroying of forest takes place in many ways but the majority of the forest is destroyed due to wild forest fires. In this paper we have presented a path planning algorithm for extinguishing fires which uses Wireless Sensor and Actor Networks (WSANs) for detecting fires. Since most of the works on forest fires are based on Wireless Sensor Networks (WSNs) and a collection of work has been done on coverage, message transmission, deployment of nodes, battery power depletion of sensor nodes in WSNs we focused our work in path planning approach of the Actor to move to the target area where the fire has occurred and extinguish it. An incremental approach is presented in order to determine the successive moves of the Actor to extinguish fire in an environment with and without obstacles. This is done by comparing the moves determined with target location readings obtained using sensors until the Actor reaches the target area to extinguish fires.
Keywords: Forest Fires, Wireless Sensor and Actor Networks, Path Planning
Manish Shrivastava
Security is a major issue in internet based online payment system. There are various internet threats which affect the security system of internet and increase risk for electronic transaction. The current authentication technique for payment system is not very secure to protect user from identity theft, as a result any attacker gain the access on confidential information of user like credit card number or account password and make illegal transfer of fund which will charged to the valid user. A single factor authentication increases risks posed by phishing, identify theft, fraud and loss of customer confidential information. So financial institution should implement an effective authentication to reduce fraud and make stronger security for applications. Strong customer authentication is necessary to enforce security and assist financial institutions to detect and decrease user identity thefts.
Keywords: Authentication, Phishing, Theft, Security
Reza Kourdy and Mohammad Reza Nouri Rad
Using the Torus topology in the two and three-dimensional NoCs (3D NOCs) is attractive solution for system performance improvement by reducing the interconnect length, hop count, etc. The 3D-Torus NOC has a high reliability in the presence of permanent faults and fast communication. We also carry out the high-level simulation of on chip network using NS2 to verify the analytical analysis.
Keywords: NoC (Network on chip), embedded applications, fault-tolerant, torus, NS2
Mohammad Reza Nouri Rad and Reza Kourdy
In this paper, we discuss types of services for supporting Quality of services (QoS) in networks-on-Chip. Multi Protocol Label Switching(MPLS) provides the flexibility of being able to Forwarding Equivalence Classes and the ability to create a forwarding hierarchy via label stacking. All of these techniques facilitate the operation of Quality of Service. Through MPLS-TE (Traffics Engineering) functions such as network resources optimization, strict Quality of Service voice data delivery, and fast recovery on link or node failures can ensured. We simulate Ring NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of the proposed architecture, which can support types of services with simplicity of internetwork connection of Ring architecture.
Keywords: Network-on-Chip, MultiProtocol Label Switching, Quality-of-Service , Re-routing mechanism
Maria Mehmood, Shehryar Humayun and Faran Mahmood
The General Purpose Interface Bus (GPIB) or originally, Hewlett-Packard Interface bus (HP-IB) was developed in late 1960’s as a reliable communication bus for automated test equipment. This document presents a comprehensive literature survey of GPIB bus standard (IEEE standard 488) gathered from many published and unpublished documents. The operational and functional mechanism of data and commands transfer between two or more GPIB compatible devices is described. Based on the general operation of the bus standard, the pros and cons of using GPIB in different instruments, and its application to enhance system performance are discussed. The survey concludes by highlighting the use and prominence of this standard in today’s industry.
Keywords: Architecture, Buses, Data Communication, Network Protocols
Rafi Ahmad Khan and S.M. K. Quadri
Emergence of knowledge based economy has posed serious challenges to companies. Intelligent organizations recognize that knowledge is an intellectual asset that grow over time and when harnessed effectively, can sustain competition and innovation. Organizations can use IT for leveraging the entire organization’s intellectual resources for great financial impact. Business Intelligence (BI) along with KDD (Knowledge Discovery in Databases) plays a pivotal role in leveraging the intellectual assets of companies by creating, storing and sharing that knowledge for effective decision making. Companies are now realizing the potential payoffs of KDD applications along with BI. Consequently, BI is spreading its wings to cover small, medium and large companies. This paper explores the concepts of BI, KDD, process of knowledge discovery, key levers of knowledge strategy and benefits of BI.
Keywords: Business Intelligence, BI, Knowledge, Knowledge Discovery in Databases, KDD, Data Mining, Tacit Knowledge, Explicit Knowledge, OLAP
Muhammad Ibrahim and Ahsan Raja Chowdhury
We consider the problem of testing reversible circuits for a particular fault model: Stuck-at (SA) Fault Model. We propose a heuristic algorithm that produces the Complete Test Set (CTS) of a reversible circuit for Single Stuck-at Fault (SSF) and Multiple-Stuck-at Fault (MSF) models. Though our algorithm works only for an important subclass of reversible circuits – the circuits consisting of k-CNOT gates (k = 2), any n-wire circuit having 0-CNOT or 1-CNOT gates can be converted into a (n + 2) wire circuit having only k-CNOT gates with k = 2 at some additional hardware cost. The problem of generating optimum CTS is NP-hard, so the CTS generated by our algorithm is not necessarily optimal, but minimizing the size of the complete test set is our key concern. We analyze time and space complexity of our algorithm to show that it is computationally feasible. We discuss the criteria for which our algorithm returns maximum and minimum CTS, i.e., n and 2 for an n-wire circuit respectively. Finally we provide experimental results after running our algorithm on some benchmarks circuits and compare it with existing methods to show how it outperforms almost all of the existing algorithms in terms of number of test vectors in CTS but is outperformed by some of the existing ones in terms of hardware cost.
Keywords: Automatic Test Pattern Generation, Complete Test Set, Design for Test, Multiple Stuck at Fault, Single Stuck at Fault
S. Hemalatha, P. C. Senthil Mahesh and Paul Rodrigues
QR code is an abbreviation of Quick Response code is widely used in a around the world to keep information about all kind of product industry .These usage starts from automotive industry to all other commercial products because of its two big advantages are fast accessing of data and provide large storage area .In this papers we pointed out the survey of QR codes and finally concluded with the possible attacks in QR code.
Keywords: QR code
Y. Chen, M. Urata, K. Mouri and T. Yasuda
This research presents the growing interest of developing more effective techniques for automatic news collection and knowledge edit of astronomy news. We are devoted to the development of such an information management system for Japanese astronomy news, termed “Astronomy News Explorer” (ANE). Curators usually wonder if the research institution’s news can be gathered efficiently, and how past news can be obtained more conveniently. The point is how to immediately use associated news, an easy editing and browsing tool is getting necessary. Therefore, the ANE is designed to help in refining raw data and encourages re-use of contents by a curatorial content management system (CCMS) to structure news management activities for science museum curators. In addition, we purpose features of news management and package can enable one to acquaint different viewpoints with a better teaching material overview of astronomy curators by re-construction of news. The aim is to contribute to widening knowledge of astronomy expertise, supporting news manageing as a platform for making information accessible given their knowledge sharing on the internet, so that they can also harvest new research achievements and interchange the astronomical teaching experience with other curators more convenient.
Keywords: Information Visualization, Content Management System (CMS), Time and Space, Data Management, Astronomy Curator
D. Krishnaveni and M. Geetha Priya
Reversible logic gates provide power optimization which can be used in low power CMOS design, optical computing, quantum computing and nanotechnology. This paper proposes a new 3 * 3 reversible SRK gate that works as a reversible 2:1 Multiplexer and has a reduced quantum cost. A novel design of Reversible Universal Shift Register using SRK gates with reduced delay and quantum cost is proposed. Reduction of delay, which is a major factor contributing to the improvement of efficiency of the circuit is adequately taken care in all the components of the proposed design. Thus, this paper provides a threshold to build more complex sequential systems using reversible logic.
Keywords: Low power CMOS; quantum computing; Reversible logic gates; Universal Shift Register; quantum cost, Sequential circuits
I. Nouaouri, J-Ch. Nicolas, and D. Jolly
Disaster like terrorist attack, earthquake, and hurricane, often cause a high degree of damage. Hundreds of people may be affected. In such situations, hospitals must be able to receive all injured persons for medical and surgical treatments. Therefore, the involved health care facilities have to be well sized to prevent hospitals from becoming overwhelmed. In this paper, we deal with the preparation phase of the disaster management plan. We focus on the sizing activity of emergency resources and more precisely operating rooms and associated medical staffs. Therefore, we propose two integer linear programming models. The first model provides the optimal number of operating rooms which allows the treatment of all the victims. Taking into account this optimal number, the second model enables to determine the latest ready dates of surgical staffs. The obtained results show that a substantial aid is proposed by using these models as decision tools for disaster management in hospital.
Keywords: Integer programming, Disaster preparedness, Sizing, critical resources