Volume 4, Issue 4, April 2012

Tags

,

Fat-Pyramid-NOC and Fat-Stack-NOC: New Frameworks Network-On-Chip Architectures
Reza Kourdy and Mohammad Reza Nouri rad

Network-on-Chip (NoC) has emerged as a very promising paradigm for designing scalable communication architecture for Systems on Chips (SoCs). This paper proposes a general framework for the design and simulation of networkon- chip-based pyramid architectures such as Fat-Pyramid-NOC and Fat-Stack-NOC. Several parameters in the design space are investigated, namely, network topology, parallelism degree, and the Scalability. Emulation is necessary to evaluate and validate the performance of the NoC system.

Keywords: Network-on-Chip (NoC), Systems on Chip (SoC), Field-Programmable Gate Array (FPGA), processing element (PE).

Download Full-Text

 

MT-NOC: A New Heterogeneous Topology For Network-on-Chip
Reza Kourdy and Mohammad Reza Nouri rad

The Network-on-Chip (NoC) interconnect network of future multi-processor system-on-a-chip (MPSoC) needs to be efficient in terms of energy and delay.Most network-on-chip (NoC) architectures are based on a mesh-based interconnection structure. In this paper, we present a new NoC architecture, which relies on source synchronous data transfer. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: Mesh of Tree(MT), Network on chip (NoC), MPSOC, System-On-Chip (SoC)

Download Full-Text

 

TCP and UDP Performance comparison In Network on Chip
Mohammad Reza Nouri Rad and Reza Kourdy

This paper was focused on study Transport Control Protocol (TCP) and User Datagram Protocol (UDP) performance in network on chip (NoC). We investigate the performance of TCP and UDP in term of bandwidth usage for increases throughput in network on chip (NoC), using simulation tool NS-2. Also two types of traffic (FTP and CBR) used during the simulation course in Mesh NoC architecture, and we used TCP’s types (New Reno, and Vegas) which we used in our experiments.

Keywords: Network-on-Chip, UDP, TCP New Reno, TCP Vegas

Download Full-Text

 

A Compact Priority based Architecture Designed and Simulated for Data Sharing based on Reconfigurable Computing
Bhavya Alankar and B K Kanaujia

Reconfigurable Computing devices are coming very strongly in the digital hardware systems due to the availability of ready to use resources, parallel logic operations and reconfigurable designs. The usage of Reconfigurable systems in real time do-main is also a very fruitful proposition as the FPGA devices are coming with processing cores for Real Time data processing. This paper mainly focuses on the application of Reconfigurable Computing systems in the data sharing domain and in order to depict this application we have designed and simulated a priority based data sharing architecture through which we can interface two Proces-sors, which in turn can intercommunicate with each other. The main advantage of this architecture is that it is highly compact, easy to use and designed using a modular approach so that it could be easily implemented on Reconfigurable hardware. All the different modules along with the complete architecture is simulated using modelsim 6.0 and synthesized using Xilinx 7.1(iSE).

Keywords: Reconfigurable Computing, FPGA, Master-Slave processor

Download Full-Text

 

Selector: A tool for dynamic service selection and management
Alti Adel, Boukerram Abdallah and RoosePhilippe

This paper presents the tool SELETOR which has been developed for services selection. This paper proposes also a new web management system that allows for considering quality and context-awareness while discovering and selecting web service. The main idea of the proposed web service oriented architecture consists in the ontology Context-aware Quality Semantic Web Service called (CxQWS). At the first step, services are defined as a set of semantic metadata, reflecting service requirements and QoS parameters. At the second step, services with a semantic contextual metadata are elaborated. Such a procedure ensures that the selection decisions should be based on the semantic quality representation of the created services. The tourism services in a mobile environment have a critical role in creating tourist satisfaction. They are neither a uniform group, nor able to give consistently high service quality. Indeed they have significantly different platforms and a variety of heterogeneous service providers which make the management of service qualities complex. This complexity is clearly noticeable when a given service is provided by two or more providers, within the same area of the mobile clients; a decision should be made to select the most appropriate service based on contextual description with the best QoS.

Keywords: context-aware, selection of services, quality of service, context matching

Download Full-Text

 

Understand Knowledge Workers in Using KMS for Knowledge Sharing
Setiawan Assegaff, Ab Razak Che Hussin and Halina Mohamed Dahlan

This study contributes to enrich our understanding of knowledge workers’ behavior in continuing knowledge sharing through Knowledge Management System (KMS). We extended Xu and Quaddus post-adoption model by proposing a new perspective on how to understand knowledge workers’ behavior by considering different belief and expectation of them. Existing KMS adoption have not thoroughly explored the different belief and expectation of knowledge workers in knowledge sharing (KS). Most of previous model provides limited information in understanding of how the knowledge worker sharing their knowledge through KMS. This study will provide a model to understand knowledge workers’ behavior in sharing their knowledge through KMS.

Keywords: Knowledge Management, Knowledge Management System, Knowledge Worker, KMS Adoption

Download Full-Text

 

Quadratic programming and Genetic algorithms for solving the Binary Constraint Satisfaction Problems
Mohamed Ettaouil, Khalid Haddouch and Chakir Loqman

In this paper, we propose a new approach to solve the binary CSP problem using two methods, a quadratic programming (QP) and genetic algorithms (GA). This approach is divided into two steps: The first step involves filtering and modeling the constraint satisfaction problem as 0-1 quadratic programming subject to linear constraints. The second step concerns applying the genetic algorithms to solve the QP problem. Therefore, the proposed algorithm based on the genetic algorithms and the model of CSP problem is well detailed. We show that the process of resolution is explained by an example of application. Finally, some computational experiments solving the CSP problem are shown.

Keywords: Constraint satisfaction problem; Consisstancy techniques, Quadratic 0-1 programming; Genetic algorithms

Download Full-Text

 

HyperX-NOC: Multipath optimized networkon- chip topology
Reza Kourdy and Mohammad Reza Nouri rad

In recent years, researchers have proposed a wide variety of topologies for data-center networks, all with the goal of providing high bisection bandwidth at low cost. In this paper we focus on HyperX topology because it is considered attractive for high bisection bandwidth data-center networks.For large-scale networks, high-radix switches reduce hop and switch count, which decreases latency and power. Silicon nanophotonic technology provides a long-term solution to this problem. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: HyperX, Network on chip (NoC), Multi-Processor-System-On-Chip (MpSoC)

Download Full-Text

 

RTCC-Pyramid-NOC: Scalable, Regular and symmetric Network-on-chip topology
Reza Kourdy and Mohammad Reza Nouri rad

Network-on-Chip (NoC) has been proposed as an attractive alternative to traditional dedicated wires to achieve high performance and modularity. Network Topology is one of the most important concerns in NoC architecture design. The choice of network topology is important in designing a high-performance NoC. In this paper, we survey the simulation of the RTCCPyramid to be used as the Scalable and Regular topology in NoC. The Recursive Transpose-Connected Cycles (RTCC) is a new modular topology for interconnection networks. The RTCC has a recursive definition quite similar to that of fractal graphs having interesting topological characteristics, making it suitable for utilization as the base topology of large-scale multicomputer interconnection networks. The RTCC is superior to conventional topologies such as the mesh and k-ary n-cube.

Keywords: RTCC-Pyramid, Network-on-Chip(NoC), Recursive Transpose-Connected Cycles(RTCC), System-on- Chip(SoC), WK-Recursive

Download Full-Text

 

Torus-pyramid-NOC: Regular Topology of Grid-Pyramid For Network-On-Chip
Reza Kourdy and Mohammad Reza Nouri rad

The choice of network topology is important in designing an Efficient NoC. Different NoC topologies can dramatically affect the network characteristics, such as fault-tolerant, wire length, hop count and communication load. These characteristics in turn determine the efficiency of NoC architectures. The Torus-pyramid-NOC is a generalized pyramid network based on a general Grid structure. Such pyramid networks form a wide class of interconnection networks that possess rich topological properties. In this paper, we simulate a general class of pyramid networks that are based on grid connections between the nodes in each level and is suitable for multiprocessor networks such as NOCs.

Keywords: RTCC-Pyramid, Network-on-Chip (NoC), Recursive Transpose-Connected Cycles (RTCC), System-on-Chip (SoC), WK-Recursive

Download Full-Text

 

Layer 3 Fault Recovery Mechanism in MPLS Network-on-Chip
Mohammad Reza Nouri Rad and Reza Kourdy

In MPLS-NoC data transmission occurs on label switching path (LSPs). LSPs established either before data transmission that called control driven, or on detection of a certain flow of data that called data driven. In this paper we compare the performance of heterogeneous Network on Chip (NoC) architectures in the sense of on chip network design methodology, with Layer 3 packet forwarding. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: Network-on-Chip, MPLS, Layyer 3 packet forwarding, control driven, data driven

Download Full-Text

 

Communication Load of TCP with Delayed ACK and UDP In Network on Chip
Mohammad Reza Nouri Rad and Reza Kourdy

TCP might underutilize the link and degrade the reliability. TCP uses the acknowledgments (ACKs) to adjust the sending rate. In this paper relies on the fact that TCP uses ACKs to determine its traffic sending to the network. In this paper we analyze and compare the bandwidth utilized of UDP with TCP/IP protocols, namely: Fack, Reno, and Sack with ACKs and Delay ACKs, that adept in network on chip (NoC). We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of UDP protocol in bandwidth usage of proposed architecture.

Keywords: Network-on-Chip, UDP, TCP protocols, Delay ACKs

Download Full-Text

 

Still Image Compression Technique Using Edge Based In Painting and Wavelet Transform
A. Benjamin Joseph and R. Baskaran

Edges constitute the high frequency components of an image. This work proposes a novel approach for still image compression using edge based in painting technique and wavelet transform to preserve the high frequency components. The main objective of the proposed work is to elevate the PSNR without compromising the compression ratio. Edge based in painting technique is used to enhance the PSNR. In painting technique used in the proposed work traces the high frequency information which is lost during transmission using edge information transmitted. At the encoder the image is decomposed using wavelet transform, which reduces the blocking artifacts and then coded using EZW coder. Edge information is extracted using canny edge detector which outperforms the traditional detectors and then coded using entropy coding. At the decoder using edge based in painting technique, the image is reconstructed with less mean square error. The results show that proposed compression technique outperforms the existing technique in terms of PSNR and compression ratio.

Keywords: Image Compression, Wavelet Transform, Edges, Feature Extraction, Image InPainting, Entropy Encoding, EZW Coding

Download Full-Text

 

A Performance Study of Applying CUDA-Enabled GPU in Polar Hough Transform for Lines
Ghaith Makey, Kanj Al-Shufi and Mustafa Sayem El-Daher

With the advent of modern GPGPUs which can be used efficiently in general purpose applications, the use of multithreaded cores and high memory bandwidths of CUDA-enabled GPGPUs in digital image processing and features extraction has been raised to a new level. This paper uses NVIDIA’s CUDA language to calculate polar Hough transform for lines which is an important method for image features extraction; a performance study of this implementation and a comparison with CPU sequential computations is included. This study has been processed on GPGPU which is inexpensive and available for all the research laboratories in the developing countries.

Keywords: Image feature extraction, Parallel computing, Graphics processors, Performance Analysis

Download Full-Text

 

Development of a GIS-Based Monitoring System for Road Network
Souad El houssaini and Abdelmajid Badri

This paper presents an integrated framework of Geographic Information System (GIS) and a Relational Database Management System (RDBMS) equipped with interactive communication capabilities. The model integrates the design of the database and the management of implementation of the monitoring system which includes the operations of query and analysis using the web and desktop applications. This study aims to apply techniques of analysis of the road network in a GIS to collect geographic data on the monitoring station and the roads. The information on road infrastructure is not only useful for locating monitoring stations, but it is also important to guide a station to follow the shortest path to achieve the objectives of management and routing. Optimal routes based on the minimum cost are identified using Dijkstra’s algorithm. Graphical User Interfaces (GUI) were developed to visualize the information collected on the model entities, and also to provide synthesis operations based on graphs using data tables and objects in the map. The proposed system should be an effective and intelligent tool for a rapid intervention and to improve the monitoring of the road network which can eventually be extended to a national infrastructure of GIS. Simulated test cases have been carried out for network of Mohammedia City in Morocco.

Keywords: GIS, Location, Routing, Road network, Monitoring, Dijkstra’s algorithm

Download Full-Text

 

Class of Service (CoS) Translations in Butterfly MPLS Network-on-Chip
Mohammad Reza Nouri Rad and Reza Kourdy

This paper presents some experiences with Class of Service (CoS) translation 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 Butterfly NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of the proposed architecture, which can support classes of services with simplicity of internetwork connection of Butterfly architecture.

Keywords: Network-on-Chip, MultiProtocol Label Switching, Quality-of-Service , claccess of services

Download Full-Text

 

Reducing Denial-of-Service Attack in Reconfigurable Network-on-Chip
Mohammad Reza Nouri Rad and Reza Kourdy

Denial-of-Service (DoS) vulnerability on a different topology, such as embedded mesh, or network-on-chip in future many core processors, would be worth researching. Due to distributed arbitration nature of mesh architecture, the bandwidth of the mesh NoC would be more vulnerable to the attack. Network-on-chip, where a large number of buffers are used in cores and routers, is also more susceptible to DoS attacks. In this paper, we illustrate our solution for helping detect attacks aiming at retrieving sensitive information from the system or at causing Denial-of-Service (DoS) with pre processor elements in network interface of NoC.

Keywords: Network-on-Chip, Denial-of-Service, Security, Reconfigurable

Download Full-Text

 

Pyramid-NOC: A Heterogeneous and Scalable Network-on-Chip Architecture
Reza Kourdy and Mohammad Reza Nouri rad

Most network-on-chip (NoC) architectures are based on a mesh-based interconnection structure. In this paper, we present a new NoC architecture, which relies on source synchronous data transfer. We consider variations in Pyramid architectures that can lead to higher performance or greater cost-effectiveness in certain applications. For large-scale networks, our topology reduces hop and switch count, which decreases latency and power. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: Pyramid, Network on chip (NoC), System-On-Chip (SoC), Chip-level multiprocessors (CMPs), quality-ofservice( QOS)

Download Full-Text

 

Simulation of Secure Sum Protocols
Apeksha Garg, Harshit Lahoti, Jyotsana Choubey and Rashid Sheikh

Secure multiparty computation (SMC) is a subfield of cryptography. The goal of SMC is to enable parties to jointly compute a function of their inputs while keeping these inputs private. It allows parties to know the result of cooperative computation while preserving privacy of individual data. Secure sum computation is an important application of SMC. In all the proposed protocols parties are allowed to compute the sum while keeping their individual data secret with increased computation complexity for hacking individual data. The Secure Sum Protocols are simulated using .NET Framework 4.0 using c#. We get communication and computation complexities. We show the comparative probabilities of data leakage for these protocols. In this paper, we have simulated secure sum protocols proposed by Sheikh et al. and Clifton et al.

Keywords: Computation Complexity, Privacy, Secure Multiparty Computation, Simulation

Download Full-Text

 

Paradigm for Image Encryption Using Visual Cryptography
A. Deva Prasad and Deepesh Kumar Srivastava

Visual cryptography technique allows the visual information to be encrypted in such a way that their decryption can be performed by human visual system. This technique used to encrypt an image into shares such that stacking a sufficient number of shares reveals the secret images. In visual cryptography there are different technique like sub pixel, error diffusion, Boolean operation etc. Here we are proposing a new enhancement to the existing techniques where the image encryption of color images is carried out in a step-by-step process of converting color image into bitmap and vice-versa. In this research compilation, we propose a new way of performing color visual cryptography using wavelet technique. Wavelet technique is used to convert the Color Image to Gray Image. Here user can give desired image as input to encrypt and transfer those generated shares to intended receiver, where decryption doesn’t need any computation process.

Keywords: Image Encryption, Visual Cryptography, Error diffusion, Digital halftoning, Wavelets

Download Full-Text

 

Power Aware Simulation Framework for Spice Compatible Battery Model of Wireless Sensor Networks
Salah-ddine Krit, Jalal Laassiri and Said El Hajji

This paper targets heterogeneous low power communication circuits and Systems that will be used in the future generations’hand- held devices (PDA’s, mobile phones). Those platforms will probably contain a few studies have emerged and considerable amount of on-chip memories. An optimized communication architecture will be required to interconnect them efficiently. Many communication architectures have been proposed in the literature: shared buses, bridged buses, segmented buses and more recently, Networks-on-Chip. Being battery-powered devices, the energy consumption of the platform is a critical issue. However, with the exception of buses, power consumption has been mostly neglected in interconnection networks. Only very recently have a few studies emerged in that domain. The Power Aware Wireless Sensors (PAWiS) simulation framework becomes an essential tool to evaluate design models of Wireless Sensor Networks (WSNs) including Soft-Ware (SW) and Hard-Ware (HW) platforms. PAWiS is an OMNeT++ based discrete event simulator written in C++. It captures the node internals (modules) as well as the node surroundings (network, environment) and provides specific features critical to WSNs like capturing power consumption at various levels of granularity, support for mobility, and environmental dynamics as well as  the simulation of timing effects. The design of integrated low-power wireless sensor nodes involves the convergence of many technologies and disciplines. Submicron complementary metal oxide semiconductor (CMOS) devices, micro-electro-mechanical system filters, on and off chip electromagnetic elements, sensors and dc-dc converters are some of the technologies that will enable pervasive systems such as wireless sensor networks. High system complexity requires the use of many simulation environments during design: algorithm simulators, behavioural and transistorlevel circuit simulators, electromagnetic (EM) simulators and network simulators. It is shown that highly integrated, selfcontained systems require multiple-domain simulations to uncover complex interactions between domains. In this paper we present a flexible and extensible simulation framework to estimate power consumption of sensor network applications for arbitrary HW platforms. Specific examples of block and system level design methodologies used in low-power wireless systems are presented here.

Keywords: Power Aware Wireless Sensors, Wireless Sensor Networks, Soft-Ware, Hard-Ware, power consumption, low-power wireless systems

Download Full-Text

 

Identifying Crop Type And Classifying It Using Local Binary Pattern variance
Ashwin A. Shinde and Maneesh Shrivastava

Manual survey of crop estimation takes a lot of time and are often misprice and unreliable. Crop monitoring using remote sensing (RS) enables timely, economical, reliable, and the most important comprehensive and accurate crop Identification. The aim of this research is to evaluate crop discrimination using satellite image data by following remote sensing approach. This paper illustrates the use of Local Binary Pattern Variance on satellite images to classify the land in to crop land and non-crop land and to classify different crops. The input image is enhanced first then Local Binary Pattern Variance is used to extract features from the crop images specifically extracting green colors. After identifying the LBPV pattern of each pixel (i,j) in the given image the whole texture image is represented by building a histogram showing intensity values for uniform and non uniform patterns. A texture image database of different crops is created. The texture features of the input image are then compared with texture features obtained from the image database of different crops and the different types of crops are identified.

Keywords: Remote Sensing, Image Enhancing, LBPV, Histogram, Crop Identification, Crop Classification

Download Full-Text

 

TCP Versus UDP Performance In Term Of Bandwidth Usage In Network on Chip
Mohammad Reza Nouri Rad and Reza Kourdy

In this paper we analyze and compare the UDP and different congestion control and avoidance mechanisms which proposed for TCP/IP protocols, namely: Fack, Reno, and Sack, that adept in network on chip (NoC). We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of UDP protocol in bandwidth usage of proposed architecture.

Keywords: Network-on-Chip, UDP, TCP Fack, TCP Reno, TCP Sack

Download Full-Text

 

Modular Simulation of NOC-WK-recursive: New On-Chip Interconnect Architecture
Reza Kourdy and Mohammad Reza Nouri rad

Network on Chip (NoC) has been proposed as a new paradigm for designing System on Chip which supports high degree of scalability and reusability. NoC, specific parameters such as hardware architecture, topology, switching methods have a huge impact on performance and the cost of the NoCs. Since the ability of the network to be efficiently, disseminate information depends largely on the topology, we especially focus on simulation of the wk-recursive topology for NoC in different Sizes and dimensions for NoC. We simulate this topology for general-purpose parallel processing applications. This paper shows that a novel network called the NOC-WK-recursive is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers. The NOC-WK-recursive resembles the fat-tree and the fat-pyramid in hardware structure, but it has its unique strengths.

Keywords: Network on Chip (NoC), NOC-WK-recursive, hyper-mesh, hyper-tree, Fat-tree, Fat-pyramid, Fat-stack, augmented fat-stack (AFS)

Download Full-Text

 

A New Power Efficient SEU-Tolerant Latch Design for Walking Robots
Erfan AghaKArim Alamdar, Reza Kourdy and Mohammad Reza Nouri rad

The novel lath is convenient for those walking robots in which the power consumption is critical .The continuous decrease in CMOS technology feature size increases the susceptibility of such circuits to single event upsets (SEU) caused by the impact of particle strikes on system flip flops. This paper presents a novel SEU-tolerant latch in which redundant feedback lines are used to mask the effects of SEUs. The power dissipating, area, reliability, and propagation delay of the proposed SEU-tolerant latch are analyzed by SPICE simulator. The simulation results show that this latch consumes about 25% less power and occupy 29% less area than a TMR -latch. However, the reliability and the propagation delay of the proposed latch are still the same as the TMR-latch .The paper also compares the reliability of the new latch with that of the three documented SEU latches.

Keywords: SEU, Reliability, Fault tolerance, Latency

Download Full-Text

 

Green Home – Day Dream or a Reality
Asima Nisar

Green behavior into homes comprises of environmental sustainability, energy conservation, efficient residential resource consumption management, etc. This technical note provides an overview of the Green Home concept, Green Building essentials with its Environmental, Economic, Social benefits and lastly the Greening requirements.

Keywords: Green Home, Green Building, Eco-friendly Material

Download Full-Text

 

An Encryption Key Scheme for Security Issues In Authentication Address of Networks
V. Upendran and R. Dhanapal

Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.

Keywords: Ad hoc networks, Spanning tree, Neighborhood key, Message specific key

Download Full-Text

 

A New Cache Replacement Policy Based on Neighbor nodes’ condition in Mobile Environments
A. Sohail Ghasemi and A. M. Rahmani

In mobile environment, often users disconnect with network because limitation in battery power of mobile devices. In addition wireless lines bandwidth are rather less than wired lines and unstable wireless channel cause network congestion and lost the packets. Therefore data cache has use by the side of host mobile has used to reduce the competition wireless bandwidth and query as far as possible had answered local and as a result query latency increase to the least. Since cache memory is limited and it is impossible to caching all the data items, so data caching is limited. If limited disk memory is full and confront by new request that there wasn’t in cache, should unessential data remove from cache and replace the wanted data. This way of choosing data for remove is called replacement policy. this research by study different cache management methods in mobile computing and by finding decreases of method previous replacement, accessed to optimized methods in replacement cache and a new Cache Replacement policy Based on Neighbor nodes’ Condition in mobile environments is presented in that data cache of neighbor node is as a effective criterion in replacement and to inside data of determined cache that also in neighbor node cache is exist, allocate a priority for removing from cache. At the end by simulate the proposed model, this result is obtain that neighbor hit rate of proposed algorithm rather to classic algorithm is increased until response time query is reduced.

Keywords: Mobile Computing, Mobile Database, Data Management, Cache replacement, location-dependent information and neighbor node

Download Full-Text

 

Bandwidth Reservation in MPLS Network-on-Chip
Mohammad Reza Nouri Rad and Reza Kourdy

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 compare the performance of heterogeneous Network on Chip (NoC) architectures in the sense of on chip network design methodology, with IP and MPLS bandwidth reservation. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: Network-on-Chip, MultiProtocol Label Switching, Quality-of-Service , bandwidth reservation

Download Full-Text

 

Formal requirement and architecture specifications of a multi-agent robotic system
Nadeem Akhtar, Yann Le Guyadec and Flavio Oquendo

One of the most challenging tasks in specification engineering for a multi-agent robotic system is to formally specify and architect the system, especially as a multi-agent robotic system is concurrent having concurrent processing, and often having dynamic environment. The formal requirement and architecture specifications along with step-wise refinement from abstract to concrete concepts play major role in formalizing the system. This paper proposes the formal requirement and architecture specifications aspects of an approach that supports analysis with respect to functional as well as non-functional properties by step-wise refinement from abstract to concrete specifications and formal architecture definition. These formal specifications have been exemplified by a case study. As formal specification techniques are getting more mature, our capability to build a correct complex multi-agent robotic system also grows quickly.

Keywords: Formal architecture, Multi-agent robotic system, ADL (Architecture Description Language)

Download Full-Text

 

A Steganalytic Based on DCT and Markov and Spatial Domain for JPEG Images
Bouguerne Imen and Tlili Yamina

Steganography is a science of hiding messages into multimedia documents. A message can be hidden in a document only if the content of a document has high redundancy. Although the embedded message changes the characteristics and nature of the document, it is required that these changes are difficult to be identified by an unsuspecting user. On the other hand, steganalysis develops theories, methods and techniques that can be used to detect hidden messages in multimedia documents. The documents without any hidden messages are called cover documents and the documents with hidden messages are named stego documents. In past several years so many feature sets for steganalysis were proposed to detect stego images, these features based on different ideas and were considered to be effective for most steganography schemes. In  this paper, a universal steganalysis scheme for JPEG images based upon hybrid transform features is presented. We first analyzed two different transform domains (Discrete Cosine Transform and contourlet transform (CT)). Then a combination of these two feature sets is constructed and employed for steganalysis. However a systematically comparison of these features have not been made in previous papers. In order to get a view of performance of current features in state of art, we designed several experiment to make a evaluation of them. Experiment result and conclusions draw from it were proposed in this paper.

Keywords: Steganography, feature, stego, steganalysis

Download Full-Text

Volume 4, Issue 3, March 2012

Tags

,

User Modeling in Web Transactional Tasks: Visual and Behavioral patterns
Mashael Al-Saleh and Areej Al-Wabil

Constructing a model of how humans interact with the web is essential for informing the design and evaluation of interactive elements on the web. Most of the constructed frameworks and models have focused on navigational and informational tasks. The main contribution of this paper is the construction of a model of user interaction in transactional tasks which can be the basis of design guidelines for web forms in order to optimize the design of interfaces. The model was examined and tested in an exploratory eye tracking study. Evidence suggests that the model is effective in representing human behavior patterns in interacting with transactional tasks on the web.

Keywords: Eye tracking, user modeling, transactional task, visual attention

Download Full-Text

 

The Moral Hazard Model: The Discrete and the Continuous Cases
Colomeischi Tudor

This paper emphasizes a review of the main results concerning the optimal contracts of the moral hazard model. The moral hazard model was described in the discrete case, for the variant of two levels of effort, as well as the variant with many levels of effort. The continuous case of the moral hazard model was also taken into consideration, in the situation of information symmetry, as well as for the asymmetric information variant.

Keywords: moral hazard model, asymmetric information, Principal-Agent model, optimal contracts, effort level

Download Full-Text

 

Sequences Constraints for Physical Mapping Problem
Hamza Zidoum

The physical mapping is a crucial tool in the analysis of the genomic sequences. Algorithms for the mapping process are based on NP-complete combinatorial optimizations. PQ-trees have been extensively used to manipulate the hybridization matrix. This paper presents an extension of PQ-trees. A PQR-tree is a suitable data structure for testing the Consecutive Ones Property (COP), besides it can handle partial orders information on probes. Moreover, we embed PQR-trees in the more general  framework of Constraint Programming (CP). We introduce Sequences and present the filtering algorithms for checking sequence constraints consistency. A PQR-tree is a canonical form that characterizes a family of sequential arrangements of a given set. The relations we are dealing with are classical sets relations besides sequencing relations such as group, potential, metric and range constraints. The filtering algorithm is based on incremental consistency techniques used to reduce PQR-trees, hence pruning the inconsistencies before the labeling phase. We claim that the sequence structure introduces a flexibility criterion on CP which renders it a suitable tool for solving NP-complete combinatorial problems related to sequencing as in physical mapping problems.

Keywords: Constraint Programming, Filtering algorithms, Physical Mapping, Consecutive One Property

Download Full-Text

 

An Effective Comparison of Graph Mining Algorithms and Techniques
B. Venkateshwar Reddy, S. Kalyani and B. Jyothi

Many graph mining algorithms have been proposed in recent past researches, all these algorithms rely on a Very different approach so it’s really hard to say that which one is the most efficient and optimal if talk in the sense of Performance. Graph mining has become an increasingly important research topic in modeling complicated structures, such as bioinformatics, protein-protein interaction Network (PPI), circuits, images, social networks, the web, XML documents, web crawl, and workflows. This paper investigates on comparison of graph mining algorithms and techniques for finding the Information.

Keywords: Sub graphs, Graph mining

Download Full-Text

 

MDSR: An Approach to Secure DSR Routing Protocol
Abu Sayed Chowdhury and Suraiya Akhter

A mobile ad hoc network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless links. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Such networks may operate by themselves or may be connected to the larger Internet. MANETs are a kind of wireless ad hoc networks that usually has a routable networking environment on top of a Link Layer ad hoc network. However, MANET properties present major vulnerabilities in security. Mobile ad hoc the open and dynamic operational environment of MANET makes it very vulnerable to attacks. One common type of attacks at MANET targets at the underlying routing protocols. Because every network node in a MANET can be a router for data transmission, malicious nodes have opportunities to modify or discard routing information or even to advertise fake routes in an attempt to attract user data to go through themselves. Some new routing protocols have been proposed to address the issue of securing routing information. However, there are still limitations in existing protocols. In this paper, we present an approach named Modified Dynamic Source Routing (MDSR) to secure particularly a MANET routing protocol- Dynamic Source Routing (DSR). Computer simulation was conducted and simulation results demonstrate that our proposed MDSR significantly outperforms the existing secure protocols such as SDSR and ARIADNE.

Keywords: Dynamic Source Routing, Merkle Signature, Mobile Ad hoc Network, and Security Threats

Download Full-Text

 

Off-Line Arabic Handwriting Character Recognition Using Word Segmentation
Manal A. Abdullah, Lulwah M. Al-Harigy and Hanadi H. Al-Fraidi

The ultimate aim of handwriting recognition is to make computers able to read and/or authenticate human written texts, with a performance comparable to or even better than that of humans. Reading means that the computer is given a piece of handwriting and it provides the electronic transcription of that (e.g. in ASCII format). Two types of handwriting: on-line and off-line. The most important purpose of off-line handwriting recognition is in protection systems and authentication. Arabic Handwriting scripts are much more complicated in comparison to Latin scripts. This paper introduces a simple and novel methodology to authenticate Arabic handwriting characters. Reaching our aim, we built our own character database. The research methodology depends on two stages: The first is character extraction where preprocessing the word and then apply segmentation process to obtain the character. The second is the character recognition by matching the characters comprising the word with the letters in the database. Our results ensure character recognition with 81%. We eliminate FAR by using similarity percent between 45-55%. Our research is coded using MATLAB.

Keywords: Arabic character recognition, handwriting recognition, OCR, off-line handwriting recognition, pattern recognition

Download Full-Text

 

IEEE 802.22 Standard Approved for White Space Development
Hsien-Tang Ko, Chien-Hsun Lee and Nan-Shiun Chu

The 802.22 Wireless Regional Area Networks (WRAN) standard was formally approved on July 22, 2011. The new standard will operate in the UHF and VHF spectrum used for broadcasting, and will support single-channel 22 Mbps broadband wireless access with a theoretical range of up to 100 km. The 802.22 technology will be particularly suitable for areas with low population density and avoid the interference with terrestrial TV broadcast signals. To optimize spectrum utilization, the UK and US have been actively examining ways of exploiting the unused “White Space” in the TV spectrum. The passing of the 802.22 standard is expected to accelerate the development of “White Space” applications such as remote area communications, IoT communications, and emergency disaster communications.

Keywords: 802.22, WRAN, White Space, Cognitive Radio

Download Full-Text

 

Eye Tracking System with Blink Detection
Sidra Naveed, Bushra Sikander and Malik Sikander Hayat Khiyal

This paper presents an efficient eye tracking system having a feature of eye blink detection for controlling an interface that provides an alternate way of communication for the people who are suffering from some kind of severe physical disabilities. The proposed system uses pupil portion for tracking the movement of eyes .The idea of this technique is to track eye movements by detecting and locating the center portion of pupil and then uses this information to move the mouse cursor accordingly for driving the interface. The system has shown successful results on the recorded cam videos as expected and accurately detects eye blinks whether voluntary and involuntary. The system is totally non-intrusive as it only uses a video cam for recording a video, so it is more users friendly and easier to configure. The experimental results have proved that the proposed system is better in its performance and efficiency than the current systems in practice.

Keywords: Eye tracking, Pupil detection, Blink detection, mouse movement

Download Full-Text

 

Representing and Organizing Contextual Data in Context Aware Environments
U. Mahmud, U. Farooq, M. Y. Javed and N. A. Malik

Context aware systems visualize smart service adaptations in pervasive computing environments. The context aware process starts by gathering the contextual data through sensors present in the environment. The contextual data is represented as an ontology using a platform independent language like Web Ontology Language (OWL). This activity is carried out in a Context Gathering and Representation Module (CGRM) that is part of our context aware system. To provide more power to the ontological representation, allied components should be provided with this module. These components include freshness and confidence calculators. This paper presents a context representation module with freshness and confidence modules.

Keywords: Contextual Data, Knowledge Modeling, Ontology Design, Pervasive Computing

Download Full-Text

 

Exploring Statistical Aspects using Arena for Simulation Results of WRONs by OWns
Asima Nisar

Arena contains a set of built-in functions for generating random variates from the commonly used probability distributions. These distributions appear on drop-down menus in many Arena modules where they’re likely to be used. They also match the distributions in the Arena Input Analyzer (except for the Johnson Distribution). Simulation refers to a broad collection of methods and applications to mimic the behavior of real systems, usually on a computer with appropriate software and Arena is  the Best choice for this. SIMAN simulation language underlies Arena. These days simulation is more popular and powerful than ever since computers and software are better than ever [4]. Arena is used to interprete simulation results statistically, obtained by using OWns regarding Optical WDM networks.

Keywords: OWns (Optical WDM network simulator), CBR (Constant Bit Rate), RWA (Routing and Wavelength Assignment), WDM (Wavelength Division Multiplexing), WRONs (Wavelength Routed Optical Networks)

Download Full-Text

 

Optical WDM network simulator: OWns – An Overview
Asima Nisar

OWns (Optical WDM network simulator) is a powerful tool to simulate Optical Networks with WDM technology. This special patch is compatible with NS – 2; the Discrete-Event simulator. It needs to modify OWns regarding architectural issues for extensilibity, easy manipulation, platform independence for enhancement in its components and functionalities. Proper publicity is a must to convince researchers for its use.

Keywords: OWns (Optical WDM network simulator), OWAN (Optical Wide Area Networks), WDM (Wavelength Division Multiplexing), WRONs (Wavelength Routed Optical Networks)

Download Full-Text

 

Learning Management Systems from Popularity to Decline: Success, Failure and the Future Use
Abdulsalam K. Alhazmi and Azizah AbdulRahman

Learning Management Systems (LMS) is the most web-based system that has been widely used in higher educational institutions throughout the previous period because of its diverse features in managing course contents and facilitating teaching and learning process. The widely increasing use of the system creates opportunities for the researchers to study different aspects of LMS development and use. In spite of the features LMS supports, there are also problems associated with the system design and implementation. Relaying on the results of various studies in this field and from the experience in the academic field using the system for a long time, this paper arises to summarize the success aspects of the system and its failure. Furthermore, based on the structure and the beneficial aspects of the system, the paper gives suggestions regarding the future use of these systems in higher educational institutions.

Keywords: Accreditation, Instructional Design, Learning Management System (LMS)/Course Management System (CMS), Learning Outcomes, Pedagogical

Download Full-Text

 

Ants’ colony algorithm Establish the best learning path to form an integrated content from a multi-presentation pedagogical objective in an ILE
A. Naji and M. Ramdani

We will present in this paper an approach that allows for an integrated content of a learning objective in a computer environment for human learning (ILE). In the latter, the same course can have several presentations. A first step is to create an interface that helps the author to upload her/his course according to a predefined structure. In the second step, the students’ collective work allows us to select the best concepts from the various presentations of an educational objective. These concepts will form an educational objective consists of an integrated content. To achieve this, we base our approach on the ants’ colony algorithm.

Keywords: ILE, integrated pedagogical content, multi-presentations, pedagogical objective, Concept, evaluation, content adap-tation, best pedagogical path

Download Full-Text

 

New methods of research on Riccati equations for loopless maps
Liyan Pan and Yanpei Liu

In this paper, enumerative equations of rooted loopless maps on the surfaces for given number of root-vertex degree and edges are provided, including orientable, nonorientable and total of genus all. These differential equations are all Riccati type. No feasible and convenient way has been in sight for extracting an explicit solution to solve the functional equations up to now. As to general maps on the surfaces, compact expression with the edge number for one vertex map has been obtained by our early document. Based on this, the corresponding calculative functions of rooted loopless maps with two parameters are extracted directly and the number can be derived by simple recursive formulae. Meanwhile, some preceding recursive results are indicated in the appendice.

Keywords: Loopless map; Enumerative equation; Calculative function; Riccati type

Download Full-Text

 

A Comprehensive Study of Rough Sets and Rough Fuzzy Sets on Two Universes
M. E. Abd El-Monsef, A. M. Kozae, A. S. Salama and R. M. Aqeel

In rough set theory, the lower and upper approximation operators can be constructed via a variety of approaches. Various generalizations of rough approximation operators have been made over the years. This paper presents a framework for the study of rough sets and rough fuzzy sets on two universes of discourse. By means of a binary relation between two universes of discourse, a class of revised rough sets and revised rough fuzzy sets based on two universes have been proposed. Some properties of the new model are revealed. We believe that this model will be more natural in the sense that rough sets (resp. rough fuzzy sets) are approximated by sets (resp. fuzzy sets) on the same universe. Moreover, some results, examples and counter examples are provided.

Keywords: approximation operator; generalized rough set; generalized rough fuzzy set; inverse serial relation; revised rough set; revised rough fuzzy set; strong inverse serial relation

Download Full-Text

 

Model Selection Criterions as Data Mining Algorithms’ Selector The Selection of Data Mining Algorithms through Model Selection Criterions 
Dost Muhammad Khan and Nawaz Mohamudally

The selection criterion plays a vital role in the selection of right model for right dataset. It is a gauge to determine whether the dataset is under-fitted or over-fitted. If the dataset is either over-fitted or under-fitted, both are the errors in the dataset and lead to produce the vague or ambiguous knowledge from the dataset and hence need to be addressed properly. The data is used either to predict future behavior or to describe patterns in an understandable form within discovered process. The major issue is that how to avoid from these problems. There are different approaches to avoid the problem of over and underfitting, namely, model selection, Jittering, Weight Decay, Early Stopping and Bayesian estimation. We talk about only the model selection criterions in this paper. Furthermore, we focus on how the value of model selection criterion is used to map with the appropriate data mining algorithm for the dataset.

Keywords: AIC, BIC, Overfitting, Underfitting, Model Selection

Download Full-Text

 

The Prospects of ERP Systems on Quality of Education and Research in Higher Education and Research Institutions of Pakistan
Najia Saher, Dost Muhammad Khan, Faisal Shahzad and Nawaz Mohamudally

It has been challenging for the educational and research institutions like universities and colleges to succeed in their core missions. The universities are facing the reduction in funds from traditional sources which has trimmed their revenues. The competition for private funding including grants, endowments and alumni donations is growing. The escalating student populations are creating physical space and service challenges. The Government regulations create pressure on the institutions to operate with a high degree of transparency, which intensifies the need to report, document and track financial, demographic, and educational information. These myriad of challenges can be addressed by better utilizing the current technology. The higher education and research institutions should be powered with IT that aligns with their requirements, supports for change and improve in the human resource management system. The institutions need to operate more efficiently and integrate processes, from business services to academic affairs and student care, while collaborating externally with government agencies and other service providers. The most of the teaching institutions in Pakistan are still using fragmented, nonintegrated and disjointed business systems, which are resultantly inefficient, outdated, and expensive. These systems are not helpful at all in decision making. The implementation of ERP system is, therefore, the best solution to envelop these bottlenecks. This paper is a case study which shows the effects of using ERP systems as an innovative learning and networked curriculum in a public sector university of Pakistan. This case study aims at emphasizing the importance of data integration and migration explaining in detail the architecture of ERP. The Campus Management Solution (CMS) is the name given to the ERP implementation in The Islamia University of Bahawalpur, Pakistan (IUB). This case study thoroughly examines the core concepts of implementing ERP along with its consequences.

Keywords: ERP, SAP, Client-Server architecture, HEC, IUB

Download Full-Text

 

The Human Resource Development (HRD) at the Higher Education and Research Institutions of Pakistan: The IUB Case Study
Dost Muhammad Khan, Najia Saher, Faisal Shahzad and Nawaz Mohamudally

Each of the past three centuries has been dominated by a single technology. The 18th century is the time for the great mechanical systems accompanying the industrial revolution. The 19th century was the age of steam engine. In the 20th century the key technology is information gathering, processing and then distribution. Among the development we have seen the installation of the worldwide telephone networks, the invention of the radio and the television, the birth of unprecedented growth of computer industry and launching of the information satellite. Due to the rapid technology progress these areas are rapidly converging and the difference between collecting, transporting, storing and perceiving in function are quickly disappearing. Although the computer industry in young as compared to other industries like automobiles and air transportation, but the computer has spectacular progress in short time. Knowledge is a power; but the Knowledge of computer and IT is powerful. It is embarrassing all fields of knowledge. Now every discipline is leaned on computer. Even doctors, engineers, historians and politicians all are compelled to learn the computer. In this paper we discuss the IT HRD in the higher education and research institutions of Pakistan, a case study of IUB.

Keywords: HRD, IUB, ITHRD

Download Full-Text

Volume 4, Issue 2, February 2012

Tags

,

Performance Evaluation of Route Cost for Wireless Sensor Networks with a Mobile Sink
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)

Download Full-Text

 

Multidimensional Index Structure for Spatial Database Management Systems
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

Download Full-Text

 

Combined use of ARM and graph clustering methods to find association in urban routes
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

Download Full-Text

 

Parallelization of Particle Swarm Optimization using Message Passing Interfaces Applied to Jamming Resource Allocation Problems
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

Download Full-Text

 

A New Approach for Anomaly Intrusion Detection by MLP and CNN Neural Networks
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

Download Full-Text

 

Compare Performance of Bruijn and Mesh Architectures in Network-On-Chip
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

Download Full-Text

 

Evaluating and Mitigating the Effects of Selfish MAC Layer Misbehavior in MANETs
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

Download Full-Text

 

Quartile Clustering: A quartile based technique for Generating Meaningful Clusters
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

Download Full-Text

 

Simulation the Generalized de Bruijn as Fault Tolerant topology for network on chip
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

Download Full-Text

 

A Neural Network Scheme for Anomaly Based Intrusion Detection System in Mobile Ad hoc Networks
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

Download Full-Text

 

An Intelligent Technique for Video Authentication
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

Download Full-Text

 

Influencing Factors on Classification of Photographic and Computer Generated Images
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

Download Full-Text

 

Exploiting Particle Swarm Optimization in Multiple Faults Fuzzy Detection
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

Download Full-Text

 

Intrusion Detection System Via Evolutionary Memetic Algorithm
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

Download Full-Text

 

A Model for Object Oriented Software Quality (MOOSQUA)
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

Download Full-Text

 

Path Planning Algorithm for Extinguishing Forest Fires
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

Download Full-Text

 

A Multifactor Authentication Security Protocol to Prevent Risks posed by Phishing, For Internet Based Online Payment System
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

Download Full-Text

 

Performance Comparison of 2D and 3D Torus Network-on-Chip Architectures
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

Download Full-Text

 

High Performance Network-on-Chip Through MPLS
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

Download Full-Text

 

A survey of IEEE-488 Bus Standard
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

Download Full-Text

 

KDD for Business Intelligence
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

Download Full-Text

 

An Improved Heuristic Algorithm to Minimize Complete Test Set of K-CNOT Circuits for Single and Multiple Stuck-at Fault Model
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

Download Full-Text

 

Quick Response code –A Survey
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

Download Full-Text

 

Developing Integrated Astronomy News Information System based on Curatorial Knowledge and Content Management
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

Download Full-Text

 

A Novel Design of Reversible Universal Shift Register with Reduced Delay and Quantum Cost
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

Download Full-Text

 

Disaster management in Hospital: sizing critical resources
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





Volume 4, Issue 1, January 2012

Tags

,

Co-creation of Value Practices in Government Agency
Imran A. Adeleke and Azizah AbdulRahman

This paper describes the co-creation of value practices employ by government agencies to interact, share service experience and understand the customer problem and requirement at any point in time. There is an increasing research on co-creation of value in marketing but few researchers discussed the concept in public sector. For government to provide quality service for citizens, to sustain continuous improvement and service innovation there is need for government to interact more with the citizen, sharing their knowledge and service experience for more improvement and mutual value. In this study, DART building block of value co-creation (Dialogue, Access, Risk management and Transparency) was used to identify the major practices of value co-creation of the government with citizen. The results provide extensive information on the value co-creation practices mechanism adopted by the agencies to interact with customer and share their service experience on one hand and also serves as a source of awareness to the community of service user for ease of communication and experience co-creation.

Keywords: Co-creation of value; experience sharing; stakeholder; DART model

Download Full-Text

 

Neural Approach for Determining Mental Health Problems
Jabar H.Yousif and Mabruk A. Fekihal

Mental illness is to become one of the main problems in our society. World Health Organization predicted that depression will be the main cause of the world’s leading disability by 2020. This paper aims to implement a soft computing technique to determine mental health problems. A multilayered perceptron designed and implemented to classify transcribed speech samples and determine a mental health problem. The NeuroSolution package is used to adopt the neural network phase. The Error backpropagation learning techniques is implemented to see how effective they would be at correctly predicting the classification of text. The proposed classification system is used to determine if a text or speech sample was generated by a person has a mental health problem such as schizophrenia or mania. Classifications such as schizophrenia are very broad; therefore, the approach introduced here arrives at practical and task-relevant diagnostic categories by use of clustering techniques. The results demonstrate high accuracy (99%).

Keywords: Mental Illness, Text clustering, Text Classification, Soft Computing, Neural Networks

Download Full-Text

 

Determinationof Optimized Data Fusion Algorithms for Radars Network by Ordered Weighted Averaging
Ali Naseri and Omid Azmoon

Decision making is a fundamental aim of radars network and it is depends on data fusion algorithm. Probability of detection is an important parameter, because of uncertainty, for data fusion algorithm and it is depends on radar gating and swerling of targets. In this paper data of 2-cell and 4-cell network are fused by custom algorithms in radars network, Averaging, Bayesian and Dempster-Shafer. Results of simulations are compared by convergence, precision, influence of fluctuations, time of running and complexity of implementation and are evaluated by fuzzy logic operator, OWA. Simulations are declare Dempster-Shafer algorithm is optimized for 2-cell network, and if radars outputs are mass function, centralized topology by Dempster-Shafer algorithm will be optimized in 4-cell network, else if radars outputs are probability, because of inverse Pignistic transform in input and Pignistic transform in output of every cells, centralized topology by Bayesian algorithm will be optimized.

Keywords: Averaging, Bayesian, Data Fusion,Dempster-Shafer, OWA, RadarsNetwork

Download Full-Text

 

A Game Theoretic Approach for Analyzing the LEACH Protocol with Multi Layer Clustering and Energy Efficient Methods
Mehdi EffatParvar, Hamidreza Navidi and MohammadReza EffatParvar

Game theory has been used for decades in fields of science such as economics and biology, but recently it was used to model routing and packet forwarding in wireless ad-hoc and sensor networks. Game Theory provides a mathematical tool for the analysis of interactions between the agents with conflicting interests, hence it is well suitable tool to model some problems in communication systems, especially, to wireless sensor networks (WSNs) where the prime goal is to minimize energy consumption than high throughput and low delay. Clustering algorithm provides network scalability and energy efficient communications by reducing transmission overhead and enhancing transmission reliability. It can localize the route set up within the cluster and thus reduce the size of the routing table stored at the individual sensor node. In this paper we use the Multi layer clustering and energy aware approaches base on LEACH protocol, and then we analyze the LEACH protocol behavior.  The analysis is based on a non-cooperative game approach where each cluster heads behave selfishly in order to conserve its energy and thus maximize its lifespan. We prove that the Nash equilibrium of the game is the best strategy for each cluster heads, and it causes to increase the expected payoffs the nodes. We show these analysis and its results by our simulations, and we use this analysis to formulate a clustering mechanism that can be applied to sensor networks in practice.

Keywords: Clustering, Game Theory, Nash Equilibrium, Wireless Sensor Networks

Download Full-Text

 

Intelligence in Cathodic Protection of Gas Supply Networks of Golestan Province Using Algorithm of Voltage Difference of Injection Point and Measurement Value
Mohammad Okhli, Ahmad Faraahi, Seyed Ali Razavi Ebrahimi, Mehdi Ziari and Rahmat Mohammadshafie

One of the most important parts of maintenance and repairs to preserve steel gas protection networks is cathodic protection part. It was observed Working on data bank of this part in three main areas of Golestan Province in 100 stations having 3600 measurement points that 80% of this data are in 0.5 to 0.9 scopes. In this paper, in addition to offering an applicable algorithm, the graphs of recorded measurements history along with voltage difference of injection have been drawn. Through comparison of reading a sample station having 70 points in two different dates and in one date, vulnerable areas and points of gas protection networks have been introduced and using intelligence and intellect in future analyses has been dealt with.

Keywords: algorithm, cathodic protection, voltage difference, intelligence

Download Full-Text

 

ASR Context-Sensitive Error Correction Based on Microsoft N-Gram Dataset
Youssef Bassil and Paul Semaan

At the present time, computers are employed to solve complex tasks and problems ranging from simple calculations to intensive digital image processing and intricate algorithmic optimization problems to computationally-demanding weather forecasting problems. ASR short for Automatic Speech Recognition is yet another type of computational problem whose purpose is to recognize human spoken speech and convert it into text that can be processed by a computer. Despite that ASR has many versatile and pervasive real-world applications,it is still relatively erroneous and not perfectly solved as it is prone to produce spelling errors in the recognized text, especially if the ASR system is operating in a noisy environment, its vocabulary size is limited, and its input speech is of bad or low quality. This paper proposes a post-editing ASR error correction method based on MicrosoftN-Gram dataset for detecting and correcting spelling errors generated by ASR systems. The proposed method comprises an error detection algorithm for detecting word errors; a candidate corrections generation algorithm for generating correction suggestions for the detected word errors; and a context-sensitive error correction algorithm for selecting the best candidate for correction. The virtue of using the Microsoft N-Gram dataset is that it contains real-world data and word sequences extracted from the web which canmimica comprehensive dictionary of words having a large and all-inclusive vocabulary. Experiments conducted on numerous speeches, performed by different speakers, showed a remarkable reduction in ASR errors. Future research can improve upon the proposed algorithm so much so that it can be parallelized to take advantage of multiprocessor and distributed systems.

Keywords: Artificial Intelligence, Natural Language Processing, Speech Recognition and Synthesis, Error Correction

Download Full-Text

 

Impact of Relay Positions on MAC Performance of Multihop Cellular Networks
Varsha Sharma and R.C. Jain

When relaying functionality is included in cellular networks, the resulting system is called Multihop Cellular Network (MCN). MCNs were proposed to combine the advantages of conventional cellular networks (CCNs) and multihop ad-hoc networks. Medium access control (MAC) in MCNs is different from that in CCNs and Ad-hoc networks. In this paper we present an overview of relaying in MCNs, and propose a reservation based MAC procedure for MCNs with fixed relays. We have analyzed the performance of MCNs using the proposed MAC by varying the position and number of relay nodes in the cell.

Keywords: Conventional Cellular Network, Multihop Cellular Network, MAC, Relaying

Download Full-Text

 

Analysis of AODV, DSR and DYMO Protocols for Wireless Sensor Network
M. M. Chandane, S. G. Bhirud and S.V. Bonde

Wireless Sensor Networks (WSN) are large collection of resource constrained, battery operated tiny sensor nodes. These nodes are densely deployed over a distributed environment and are specifically designed to gather and disseminate the sensed phenomena either through single hop or multi-hop communication. Energy consumption is a major challenge in wireless sensor networks therefore this work provides the feasibility study of AODV, DSR and DYMO routing protocols for WSN using IEEE 802.15.4 star topology. Qualnet 4.5 is used for detailed simulation based performance analysis with reference to throughput, total energy consumption, average end-to-end delay, jitter and duty cycle. Performance of all three routing protocol is analyzed for 802.15.4. Result shows that AODV performs better than DSR and DYMO for scalability, varying traffic loads in star topology with beacon enabled mode.

Keywords: Wireless Sensor Networks, IEEE 802.15.4, ZigBee, QualNet4.5, Ad-Hoc network, Routing Protocol, Quality of Service

Download Full-Text

 

Performance Analysis of AODV+ Over Mac Layer Based on Throughput
Rahul Malhotra, Sangeeta Monga and Kamaljeet Kaur

The AODV is an adhoc on demand distance vector routing protocol; this protocol is a reactive protocol means the source node sends the data to the destination node. It maintains routes of each node and reduces overhead. The scenario that designed in this paper, the source node sends the data to the destination node with communicating with host. When the destination node had not on its network, then a gateway communicated with other gateway that is technique by nodes communicating over nodes in the Internet. The scenario designed in this dissertation has wired cum wireless network by using network simulator (NS2) in 802.11 and using various scripts to calculate the performance on the MAC Layer.

Keywords: AODV; NS2; MANET

Download Full-Text

 

Increase of Privacy Coefficient in Classification based on Wavelet Transformation
M. Aamoot, S. Karbasi and A. Faraahi

In data mining, maintaining individual’s privacy is one of the complicated issues, which must be noticed in data distribution to conduct analysis. Thus, the main subject is the method of data values preservation while preserving existing data patterns in data sets. In other words, data owners must be able to guarantee the reliability of results obtained from data mining in addition to preserving individual’s privacy. In this research, data transformation method was proposed by implementing the haar wavelet transformation, which preserves the features required for the K-Nearest Neighbor classification algorithm in addition to hiding private data. The results obtained from conduction of the above method indicated that the proposed method not only enhanced the privacy coefficient but also maintained classification patterns at an appropriate level.

Keywords: Classification, Data Mining, Privacy Preserving, Wavelet Transform

Download Full-Text

 

Collaborative Web Surfing
Akhtar Ali Jalbani, Aneela Yasmin, Gordhan Das Menghwar and Mukhtiar Memon

Recent advances in the area of group communication, based on the computer mediated communication increased, due to the adoption of results in the paradigm shift of previous research towards group communication. This research uses social software into existing design patterns for group communication. The adoption of group communication towards social groups  leads to more user oriented and human centric designs and combination leads to the new potential emerging from incoperating new functionalities into collaborative environment. Tools originated from social softwares are still standalone but their influence on collaborative environment can not be avoided. However these social software and existing collaborative software does not provide collaborative way to search on the Internet. In this research we focused on the collaborative enviornement used for web surfing. A conceptual quality model is also proposed to evelaute the quality impact of collaborative web surfing.

Keywords: collaborative surfing, searching together, model for collaborative web surfing, Collaborative concepts

Download Full-Text

 

Simulation Symmetric N-dimensional Cube Network-on-Chip Architecture by Using Ns-2
Reza Kourdy and Mohammad Reza Nouri Rad

The symmetric recursive structure of the network-on-chip architecture has played an important role in developing parallel processing and is still popular and influential. The symmetric recursive structure of the hypercube support various elegant and efficient parallel algorithms that often serve as starting points for developing, or benchmarks for evaluating, algorithms on other architectures. This paper describes the design and simulation N-dimensional network-on-chip by recursive structure. We use network simulator NS-2 modeling and simulating NoC at high-level chip design and the different dimensions 2 to 6 (2D to 6D) has simulated.

Keywords: Network-on-Chip (NoC), network simulator NS-2, cube-connected cycles (CCC), recursive structure, hypercube

Download Full-Text

 

Performance Comparison of 3D-Mesh and 3D-Torus Network-on-Chip
Mohammad Reza Nouri Rad and Reza Kourdy

The widely used NoC topologies are Mesh and Torus architecture. We analyses performance of three-dimensional Mesh and Torus based NoC with 64 resources and switches in presence of permanent faults With IP routing. We also carry out the high-level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: NoC (Network on chip), performance, 3D-mesh, 3D-torus

Download Full-Text

 

Compare Performance of 2D and 3D Mesh Architectures in Network-On-Chip
Reza Kourdy and Mohammad Reza Nouri Rad

The 3Dimensional Network on chip (NoCs) architectures is capable of achieving higher throughput, lower latency, and lower energy dissipation at the cost of small silicon area overhead. In this paper, we survey the 2d-mesh and 3d-mesh of NOCs to showing their intrinsic advantages related to each other. These topologies compared with average of propagation delay, average of hop count and impact of fault in bandwidth utilization.

Keywords: 3D-NoC (Three-dimensional Network on chip), 3D-IC (Three-dimensional integrated- circuit), MPSoC (Multiprocessor Systems-on-Chip), IP (intellectual property)

Download Full-Text

 

A Novel Approach for Increasing Robustness and Security of LSB-Based Digital Audio Watermarking
Zahra Movahhedinia and Kamal Jamshidi

The authenticity or ownership verification may be provisioned by digital watermarking which can be performed by proper methods of steganography. In this paper we develop a robust Least Significant Bit (LSB) based audio watermarking algorithm that uses a chained hash table (CHT) to attain the time complexity O(n), where n is the number of samples in the cover data. To promote the robustness of our approach, the covert bits are embedded in the tenth LSB layer of thestego signal using the regions where the energyof the audio signal is high. To lessen the computational complexity, an optimized jumping window technique is employed. The robustness and imperceptibility of the proposed method is investigated and shown that while simple and fast, it is more robust and secure than the standard LSB method.

Keywords: Data Hiding, Audio Steganography, Digital Watermarking, LSB method

Download Full-Text

 

Analysis of Gene Microarray Data using Association Rule Mining
Jitendra Agrawal and Ramesh C. Jain

With the developing of new technologies and revolutionary changes in biomedicine and biotechnologies, there was an explosive growth of biological data during the last few years. Due to the huge amount of data, most of recent studies are focused on the analysis and the extraction of useful and interesting information from microarray data. Microarray technology is a powerful tool to analyze thousands of gene expression values in the field of biomedical research, providing researchers with a means of looking at how genes are expressed under certain conditions such as drug treatment or disease. The association rule could be one of data mining technique to extract biological information and lead us to discover interactions that exist between different genes. This paper describes a work done in the bioinformatics sector to understand association based on the correlations in Gene Probes according to the expression levels which has actually been executed successfully.

Keywords: Association Rule Mining, Gene expression, Micro array data

Download Full-Text

 

Tools for Creating TCL Script in Network Simulator 2 (NS-2)
Mohammad Reza Nouri Rad and Reza Kourdy

Network researchers have used the Ns-2 network simulator for a long-time for implementing and analysing novel ideas and new approaches emerging in computer networks. Simulations in NS-2 through TCL scripts performed. Through these scripts, all aspects of the simulation have defined. One of the problems in Ns-2 is creating TCL script to simulate desired specification of the network. Before TCL script generator built, the only way to use ns-2 was to write TCL code to describe nodes, links and other network objects. This paper presents an application programs for simulate networks like network on chip and scenarios to supporting Quality of Service, create TCL script comfortable and extracting desired result from output files.

Keywords: TCL script generator, Network Simulator 2 (Ns-2), nostrum mesh topology, Trace

Download Full-Text

 

Impact of Educational Background on Information Communication Technology (ICT) Awareness of Students & Scholars in Kashmir (India)
Rafi Ahmad Khan and Showkat Hussain Gani

There is a lack of information on the actual use of Information and Communications Technology usually called ICT for academic and research purposes by the students and scholars in Kashmir (India). This study explored the level of usage, utilization of Information and Communication Technologies (ICT) and the impact of educational background on ICT awareness of students and scholars. The population of the study consisted of 500 scholars and students with differing educational levels. The study investigated such things as ownership of a computer, type of personal computer owned, knowhow of operating computers, ownership of email account and packages in personal computer and mobile handsets used. The study reveals that there is correlation between the educational status of the respondents and their awareness and use of ICT. This paper recommends that regular ICT education should be a made a compulsory part of curriculum in college and university education.

Keywords: Scholars, Students, Education, Information, Communication Technology, Skill

Download Full-Text

 

A Model Of Exponential Relationship To Estimate Leakage With Verilog Codes
M. Mohammadian , N. Mozayani and A. F. Nejad

Leakage current is becoming a very important factor today in determining the feasibility of designs. One of the problems that always exists in design is to find the leak using software tools. It is important to know the amount of leakage of your design components in advance, so that necessary changes can be made to the plan. Nevertheless the fundamental problem remains with implementation of the plan for the synthesis of the leak with simulation tools. In the method presented in this paper, using mathematical relationship and knowing the number of gates, we’ll calculate the amount of leakage of the circuit within a very short time with less than 10% error and without utilizing any specialized software. And at last we present a small algorithm that work by our purpose.

Keywords: potency of leakage, current of leakage, calculation error, exponential formula ,verilog codes

Download Full-Text

 

Optimization of Fabric Construction on the Language of a Network of Heterogeneous Information
Nasser Modiri and Hamdoollah Ghamgin

Nowadays, XML is one of the most important models for storing and communicating data. The flexibility of XML leads to be used commonly. The size of XML documents is increasing day to day. In order to manage these documents, an expressive system is needed because traditional file systems can’t manage such a huge volume of data. So, a lot of efforts have been done in this regard.On the one hand, by prevalent use of XML databases, it is needed to promote queries, and that is why most of the researchers concern to improve this aspect of XML. On the other hand, since XML structure is completely different from traditional relational databases, most methods are not efficient and have not been accepted as a standard for XML users, so the researchers have motivated more than the past.On the other aspect, hence XML has flexible structure, it could attract web designers to develop their web pages as XML format, and nowadays, too many XML web pages can be seen, so users expect to receive their query indexs as they could in the past, but there is less coherence among web page information than a unit database. As a index, in addition to accelerating queries, the coherence among indexs must be regarded in this case. Unfortunately, there are a lot of deficiencies among proposed methods. Each method just concerns few aspects of the problems, and it is used for specific queries, therefore; it’s not efficient for all kinds of queries, and no method has ever been proposed as a standard like SQL in relational database, and it could be said that XML has not reached to its own maturity, and it is hoped that the thesis could open a path even for the future. In this article we search the method that be profit for a big nods of queries the method compared with the other similar methods placed on achieving the numbers of fewer nods and in less time to reach the answer. The method had bin ability of modulate with similar methods index and be able to use it to accelerate the queries. Were looking for a method that can jump from node tobe useless and less than in similar fashion to produce an intermediate data. The method using a pattern matching method. Directly and blindly not processing nods in the documents.

Keywords: Pattern matching ,guide index table, Query optimization

Download Full-Text

Volume 3, Issue 12, December 2011

Tags

,

Characterization of Atmospheric Turbulence Measured on Terrestrial Link
Peng Liu, Kazuhiko Wakamori and Mitsuji Matsumoto

Free-space optical communication (FSO) can provide very high speed communication services. But it is deeply influenced by the atmospheric turbulence on terrestrial links. Research on atmospheric turbulence is important for FSO design. The refractive-index structure constant is used to measure atmospheric turbulence. We measure the employing FSO through a 1km  atmospheric turbulence link. In this paper, the experimental data of atmospheric turbulence is analyzed. The theory of atmospheric turbulence is reviewed, and the relation of the with the FSO receiving power considering aperture averaging is derived. From the experimental data, we found that the atmospheric turbulence changed with time and weather conditions. The results seen in from the experiment data are very important for design optimization of free space optics system performance in actual operational environments.

Keywords: Free space optics (FSO), Characterization of atmospheric turbulence, Atmospheric turbulence, Scintillation, Refractive-index structure constant

Download Full-Text

 

Conserving Energy in Real Time Parallel Disk Systems
Mais Nijim

In this paper, we propose an adaptive energy conservation algorithm (DCAPS) with guaranteed performance levels for parallel disk systems under varying workload conditions. The novel framework uses data partitioning to achieve highest degree of data parallelism, estimates the expected response times for parallel disk systems, and uses adaptive voltage scaling to determine the optimal value of the power supply levels for each disk while guaranteeing the a-priori performance levels, i.e., the desired response times, for disk requests. The experimental results have illustrated that the proposed DCAPS algorithm significantly reduces the energy consumption level of parallel disk systems in dynamic environments over traditional disk systems without the DCAPS strategy.

Keywords: Data partitioning, Dynamic voltage scaling, Parallel disk systems, Response time

Download Full-Text

 

Personality Dimensions and Temperaments of Engineering Professors and Students – A Survey
Arif Raza, Zaka-ul-Mustafa and Luiz Fernando Capretz

This research work aims to study personality profiles and temperaments of Pakistani software engineering professors and students. In this survey we have collected personality profiles of 18 professors and 92 software engineering students. According to the Myers-Briggs Type Indicator (MBTI) instrument, the most prominent personality type among professors as well as among students is a combination of Introversion, Sensing, Thinking, and Judging (ISTJ). The study shows ITs (Introverts and Thinking) and IJs (Introverts and Judging) are the leading temperaments among the professors. About the students’ data, the results of the study indicate SJs (Sensing and Judging) and ISs (Introverts and Sensing) as the dominant temperaments.

Keywords: Human Factors in Software Design, Process metrics, Software Engineering Process, Statistical methods

Download Full-Text

 

From Mainframe to Cloud Computing: A Study of Programming Paradigms with the Evolution of Client-Server Architecture
Dost Muhammad Khan and Nawaz Mohamudally

The rapid growth of distributed computing architectures creates new approaches and opportunities for the software engineers to develop new programming and structured information processing within an organization. New computing architectures provide the technologies that enable organizations to reengineer their business processes and the dominant of these new architectures for information processing is client-server architectures. The client-server systems have evolved in conjunction with advances in desk-top computing, new storage technologies, improved network communications, and enhanced database  technology. New development in client-server is allowing developing on-line business systems with all the possible implementations that was dream of a few years ago. The wide spread of networks, and in particular, of networks connected to each other, as the Internet, has imposed new needs that required new paradigms and new technologies. There are several network technologies available which support user-level communication between processing a shared-memory. The client-server architectures are commonly used in distributed environment due to optimization, modularly, no wastage of resources, reliability, availability and provides graphical user interface aid. This paper presents a study of the programming paradigms with the evolution of client-server architecture from mainframe to cloud computing.

Keywords: Agent-Oriented Programming, Object-Oriented Programming, Lightweight Programming

Download Full-Text

 

An Energy Efficient Cooperative Clustering Protocol for Heterogeneous Wireless Sensor Networks
Md. Abdullah-al Mamun, Naoshi Nakaya, Yuji koi and Yukari Hagihara

Topology control in a sensor network balances load on sensor nodes, and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we developed a low complexity cooperative diversity clustering protocol for heterogeneous wireless sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes termed as node heterogeneity. This heterogeneity may result from initial setting or uneven power draining during network operation. In contrast to these approaches, we propose a heterogeneous-aware cooperative clustered (HACC) scheme for wireless sensor networks based on weighted election probabilities of each node to become a cluster head according to its residual energy. We then propose a simple modification in the clustering algorithm to exploit virtual MIMO based cooperative transmission. In place of selecting a single cluster head at network layer, we offered multiple cluster heads in each cluster to obtain a full diversity gain over long distance communication without sacrificing transmission data rate. Thus we established virtual MIMO based cooperative transmission in ad-hoc sensor networks. We treated the cooperative cluster head selection method as a Facility Location Problem (FLP) to gain better energy utilization. Analysis and simulation results show that cooperative HACC can save a huge amount of energy over the existing clustering protocols, and increase the network lifetime in terms of both 50% node to die and first node to die. Moreover, this proposal can achieve higher order diversity gain with improved spectral efficiency when the distance to Base Station is over a given threshold.

Keywords: Wireless Sensor Network (WSN), topology control, Base Station (BS), Cluster Head (CH), Cooperative Cluster Head (CCH), Facility Location Problem (FLP)

Download Full-Text

 

SSMR: A scalable Multipath Routing Protocol for Mobile Ad Hoc Networks
MohammadHasan Farzin, Sam Jabbehdari and Alireza Bagheri

Mobile Ad Hoc networks (MANET) are networks which are formed by mobile nodes and do not rely on any predefined and fixed infrastructure. Due to high mobility of this kind of network, network connectivity graph changes continuously, and consequently some paths fail. Such path failure has a significant effect on quality of service. One method to increase reliability is to use multiple support paths so that in case any path fails, other paths can be used. One of such protocols is SMR, which increases reliability by creating several disjoint link between the source node and the destination node. However, since this protocol is based on the source routing protocol DSR, as the size of the network increases, its efficiency decreases. In this paper, a mechanism is proposed to reduce overhead and maintain efficiency of this protocol when the size of the network increases.

Keywords: Reactive Routing, Multipath, SMR

Download Full-Text

 

Attitude of the economic agent towards risk. Means of measurement
Colomeischi T.

This paper emphasizes an analysis concerning attitude towards risk of the economic agents in uncertainty conditions. The paper begins with a general presentation of various approaches over concepts of certainty, uncertainty and risk. Later on, an analysis about the economic agent’s attitude towards risk is carried out, thus defining the aversion, neutrality and predilection towards risk of the individuals by means of the utility functions. The main characteristics that measure attitude towards risk of the economic agents are explained in the third paragraph: the certainty equivalent, the risk premium (prize), the coefficient of absolute risk aversion, the coefficient of relative risk aversion and the Arrow-Pratt risk premium.

Keywords: uncertainty, risk, utility function, lottery, risk aversion

Download Full-Text

 

Modeling of Two-dimensional Warranty Policy using Artificial Neural Network (ANN) Approach
Hairudin A. Majid, Jun C. Ang and Azurah A. Samah

Modeling of two-dimensional warranty policy is an important but difficult task due to the uncertainty and instability of data collection. Moreover, conventional numerical methods of modeling a two-dimensional warranty policy involves complex distribution function and cost analysis. Therefore, this paper attempts to present an Artificial Intelligence (AI) technique, which is the Artificial Neural Network (ANN) approach in order to improve the flexibility and effectiveness of the conventional method. The proposed ANN is trained with historical data using multi-layer perceptron (MLP), feed forward back-propagation (BP) learning algorithm. The Logarithmic (logsig) and Hyperbolic Tangent (tansig) sigmoid functions are chosen as transfer function. Four popular training functions are adopted to obtain the best BP algorithm, that are, Levenberg-Marquardt (trainlm), Gradient Descent (traingd), Gradient Descent with momentum (traingdm), and Gradient descent with momentum and adaptive learning (traingdx) back propagation algorithm. This ANN model demonstrated a good statistical performance with the mean square error (MSE) values in this four training function, especially traingd. Finally, the adopted sensitivity analysis has revealed that the proposed model had successfully implemented.

Keywords: Artificial Intelligence, Artificial Neural Network, Two-dimensional Warranty

Download Full-Text

 

Implementation and Evaluation of a Software Prototype for Real-Time Steganography in VoIP Call
Abdulaleem Z. Al-Othmani, Azizah A. Manaf and Akram M. Zeki

Steganography is an effective way of hiding secret data, by this means of protecting the data from unauthorized or unwanted viewing. In fact, along with encryption, steganography is one of the fundamental ways by which data can be kept confidential. One of the new and promising communication medium that can be used as a host for steganography is Voice over Internet Protocol. VoIP is a form of communication that allows people to make phone calls over an internet connection instead of typical analogue telephone lines. VoIP characteristics, such as, real-time transmission, bi-directional nature and vast amount of data make it very appropriate medium to hide secret data. This article concerns available steganographic techniques that can be used for creating covert channels for VoIP streams. Based on that, the proposed prototype is configured to apply some of these techniques in lab environment. The main contribution of this study is designing, implementing and testing a prototype of real time VoIP steganography.

Keywords: Signal processing, VoIP, Steganography, real-time communication, LSB

Download Full-Text

 

Nonlinear Robust Regressions Based on ?-Regression Quantile, Least Median of Squares and Least Trimmed Squares Using Genetic Algorithms
Antoni Wibowo and Mohamad Ishak Desa

Kernel principal component regression (KPCR) can be effectively used for nonlinear system by mapping an original input space into a higher-dimensional feature space. However, KPCR can be inappropriate to be used when our data contain outliers. Under this circumstance, we propose several nonlinear robust techniques using the hybridization of KPCA, ?-regression quantile, Least Median of Squares (LMS), Least Trimmed Squares (LTS), and genetic algorithms for handling the effects of outliers on regression models. KPCA is performed to construct nonlinearity while ?-regression quantile, LMS and LTS are used to perform robustness of regressions. The genetic algorithms are used to estimate the regression coefficients of ?-regression quantile, LMS and LTS methods. The performances of the proposed methods are compared to KPCR and give better results than KPCR.

Keywords: Kernel principal component analysis, robust, nonlinear robust regression, ?-regression quantile, LTS, LMS, genetic algorithms

Download Full-Text

 

Pedesterian and Vehicle Tracking with Adaptive Background Subtraction and Adaptive Object Matching By Using Simple Object Features
Özlem Morkaya and Serdar Koruko?lu

This study focuses on systems that are tracking and classifying humans and vehicles in the case of occlusion with the use of adaptive background subtraction and adaptive object matching. Our system uses adaptive background subtraction to tackle with once moving then stopped objects, added to background; and once stable then moving objects, considered as foreground. Noise components in frames result of background subtraction are cleared via morphological operations. Adaptive object matching uses one-to-one or one- to-many matching options consecutively in the case of normal or occlusion states. Addition to this, adaptive matching provides a clear solution for the problem of object matching before and after occlusion. Nearest neighboring and size ratio features are basically used as matching criteria. Finally, tracked objects are classified as pedestrian or vehicle with regard to their object features.

Keywords: Image Processing and Computer Vision, Motion, Scene Analysis, Segmentation, Tracking

Download Full-Text

 

An Integration of K-means and Decision Tree (ID3) towards a more Efficient Data Mining Algorithm
Dost Muhammad Khan and Nawaz Mohamudally

K-means clustering data mining algorithm is commonly used to find clusters in huge datasets, due to its simplicity of implementation and fast execution. After applying K-means clustering algorithm on a dataset, it is difficult for one to interpret and extract the required results from these clusters, unless an appropriate data mining tool or algorithm is used. Decision tree (ID3) is the best choice, used for the interpretation of the clusters of K-means algorithm because it is a user friendly, faster to generate and simpler to explain “understandable” decision rules, compared to the other commonly used data mining algorithms. In this research paper, we integrate K-means clustering algorithm with Decision tree (ID3) algorithm to come up with a more efficient data mining algorithm using intelligent agent, called Learning Intelligent Agent (LIAgent), which is capable to perform classification, clustering and interpretation tasks on the datasets.

Keywords: LIAgent, Data Mining Algorithms, Dataset, Clusters, Partitioned Clustered Dataset, Visualization

Download Full-Text

 

Improvement the NoC Performance and Fault tolerant by Dividing bandwidth In Mesh and Fat-Tree topologies
Reza Kourdy and Mohammad Reza Nouri Rad

We propose a dividing routing algorithm which can increase fault-Tolerant and Communication load that is suitable for multimedia applications in network on chip. We compare the performance of Fat-Tree, 2d-Mesh architectures in the sense of on chip network design methodology. Dividing bandwidth in source or all switches was in order to provide additional bandwidth for application that needs more bandwidth than one link supported bandwidth. We also compare the effect of link delay in convergence of two portion divided traffics, in source switch in Mesh and Fat Tree topologies. We also carry out the high level simulation of on chip network using NS-2 to verify the analytical analysis.

Keywords: Dividing Bandwidth, Communication Load, Fault-Tolerance, Network-on-Chip, Traffics Convergence

Download Full-Text

 

A Method for Routing Packets Across Multiple Paths for increase communication load in 2D and 3D Network on Chip Architectures
Mohammad Reza Nouri Rad and Reza Kourdy

Combination of Multi-path routing with equal hop count can increase Communication load of the cores in network on chip. We used an Arbiter that forwarding data packet to destination node in round-robin Manner, so that we can use the more than one link bandwidth to increasing the communication load of the cores. The equal hop count for each portion of flows caused to we have no packet reordering in destination node. We compare the performance of two and three dimensional Mesh and Torus architectures using Multi-path routing in the sense of on chip network design methodology. The simulations of each of the architectures are done with IP and Multi-path routing, two-dimensional and three-dimensional topologies. We also carry out the high level simulation of on chip network using NS2 to verify the analytical analysis.

Keywords: Network-on-Chip, increase communication load, Bandwidth utilization, 2D and 3D Mesh and torus, Multipath Routing

Download Full-Text

 

A Survey on Decision based Software Architecture Design approaches
G. Zayaraz, C. Dhaya and V. Vijayalakshmi

Research on software architecture suggests that it is no longer perceived as interaction among components and connectors only, but rather as a set of architectural decisions. Architectural Knowledge is defined as the representation of the software architecture along with architectural decisions and their rationale, external influence and the development environment. Although the importance of architectural knowledge has been recognized for a considerable period of time, there is still no systematic process emphasizing the design decisions in the software architecture. Several decision-based architectural design techniques have been suggested, to provide real-world support to design reasoning and justification. This paper is a survey about the well-known existing architectural decision-based approaches for different architecture knowledge management strategies. The comparison framework is used to evaluate the level of support provided by the various approaches. Further the major differences and missing desired features in these methods are highlighted.

Keywords: Software architecture, Architectural Knowledge (AK), Design decision, Design rationale, Decision Constraint Graph, Bayesian Belief Network

Download Full-Text

 

Channel Estimation using Least Mean Square (LMS) Algorithm for LTE-Advanced
Saqib Saleem and Qamar-ul-Islam

For IMT-Advanced’s high data rate requirement for the internet and multimedia services, 3GPP has proposed evolved version of LTE, known as LTE-Advanced. To achieve the targets for next generation mobile communications systems, the following systems enhancements are proposed in Rel-10: Carrier Aggregation, Co-ordinated Multipoint Transmission and Reception (CoMP), Relaying Capability, Advanced MIMO techniques and Heterogeneous Networks. In order to achieve high spectral efficiency and high cell edge throughput, Channel State Information (CSI) is desired to be known as the both ends of transceiver. Channel can be estimated in time-domain and frequency-domain. For multi-antenna transmission systems under high mobility conditions when channel is fast fading frequency selective, channel needs to be estimated at each instance. Under these situations, adaptive algorithms can be used to have knowledge of channel. In this paper, the behavior of Least Mean Square (LMS) algorithm is determined and the evaluation parameters used are number of channel taps and CIR samples of the channel. Monte-Carlo Simulations are carried for the performance and complexity comparison of LMS-based channel estimation for MIMO-OFDM system.

Keywords: MIMO-OFDM, LMS, CIR Samples, Channel Taps, LTE, IMT-Advanced

Download Full-Text

 

A Novel Secure Smart Student Card Model Case Study: Guilan University
Sara Salehi Mahboob, Seyed Mohammad Asadinejad and Reza Ebrahimi Atani

Today, with the development of information technology, new technologies like (Radio Frequency Identification) (RFID) are be-coming popular and more useable in different tasks, using this technology has provided fastness and comfort in giring services to universities and Educational in is titues.Abilities of this stuff have resulted a card that contains Educational documents, Electronic identification card, self service cord, library card, Dormitory card. In fact we will have different required cards, of one student in one smart card. This card improves speed and reduces human resources reguirement. So it results, less errors, less price, and also comfortin giving services to university. In this paper, the efficiency of the smart card as a “case study” has been tested in Guilan University.

Keywords: E-Payment, Smart Cards, RFID, RBAC, Guilan University

Download Full-Text

 

The Use of ANN for Cracks Predictions in Curvilinear Beams Based on their Natural Frequencies and Frequency Response Functions
R. A. Saeed and L. E. George

This paper presents the results of using different arrangements of feed forward neural network (ANN) for crack prediction in curvilinear beams. The prediction process is based on the feeding the vibration characteristic as input data. The adopted vibration characteristics include: Natural Frequencies (?n) and Frequency Response Functions (FRFs). The introduced ANNs were used to estimate the size of the crack and its location. The finite element method (FEM) has been applied to compute the vibration characteristics for intact and damaged beams. To avoid the establishment of large ANN arrangements the data reduction techniques were utilized to reduce the input set of computed natural frequencies (?n) and Frequency Response functions (FRFs). The analysis results revealed that the reduced arrangements of ANN can give a satisfactory prediction results; this reflects encouraging sign about the use of ANN for damage identification.

Keywords: Crack identification, Artificial Neural Network, Data reduction techniques, Vibration analysis

Download Full-Text

 

Improving Data Quality in completeness using hybrid Algorithm AR-Modified kNN
A. Nourzad, S. Karbasi and A. Faraahi

Data quality is a major issue; however, it is neglected or less considered in data mining and knowledge discovery in databases(KDD). Data completeness and missing value are one of the most important factors in data quality. Many techniques and methods have so far been proposed to its better management and missing data values imputation; but the main disadvantage of such techniques are their dependence on just one technique and not combining several techniques. And this is the reason for their less accuracy on predicting and determining the missing data values. In this paper, to increase the accuracy of missing values imputation, hybrid approach of Association Rule mining technique is applied by using partial matching concept and modified k-nearest neighbor technique (AR-modified kNN). Experimental results on the real data set suggest that accuracy and performance of given hybrid imputation approach is more effective as compared to approaches which rely on just one technique.

Keywords: completeness, data mining, data quality, missing data

Download Full-Text

 

Minimization of Waiting Time in Traffic Signals on Indian roads based on Wireless Sensor Network
Amnesh Goel, Sukanya Ray and Nidhi Chandra

The rapid growth of vehicles is leading to huge traffic and increasing traffic congestion, to solve this chaotic traffic congestion a wireless sensor based traffic signal solution is proposed in this paper. The primary motive of this paper is to minimize the waiting time for vehicles at traffic signal and optimization control of duration of a green traffic light timing based on the volume of the vehicles passing through that junction in a given period of time. In this paper Wireless Sensor Network (WSN) is used to make traffic signal fully adaptive to the traffic movement at a junction and thus maximize the volume of traffic flow through that signal and utilization green time effectively.

Keywords: WSN, Traffic signal, congestion, Adaptive

Download Full-Text

 

Automobile Surveillance System
Ammara Zulfiqar, Asim Munir, Memoona Khanam and Malik Sikandar Hayat Khiyal

The ASS (Automobile Surveillance System) is directed to provide with a security which is hard to be counterfeited. ASS uses image processing technology to authenticate vehicles by their license plate and organization’s logo printed on sticker. The system is intended to help in the recognition of number plates of vehicles and sticker matching. This system is based on image processing techniques. The proposed system helps in the functions like detection of the number plates of the vehicles along with the sticker (attached to inner surface of windscreen), processing both of them individually and using processed data for further processes like storing, validating (Database matching) and permitting vehicle to pass or rebuff vehicle. It also helps in the reduction of space consumption, by conducting the graphic images of the vehicles which can be further stored in the database in text format reducing size of data to be stored. The system is implemented in Matlab involving Ms-Access as backend.

Keywords: Digital image processing, License plate recognition, Logo matching, Optical character Recognition (OCR), Template matching, Validation

Download Full-Text

 

A Macro Mobility Scheme using Post Handover Techniques for optimization of Handover and Roaming
Debabala Swain, Siba Prasada Panigrahi and Prasanta Kumar Patra

Even though the PMIP provides mobility solutions, there are many issues of user identity, mobility context of users from a home network to the visiting network, the assignment of home address to a user terminal in a visiting network, identification of the user terminal’s mobility, and identification of MPA and HA. In this paper, we propose a new mechanism with proxy mobile IPv4, as a mobility solution in networks. In this mechanism during mobile node access authentication, MPA exchanges registration messages with the HA (Home Agent) to set up a suitable routing and tunnelling for packets from/to the MN. In this method, the authentication request of the mobile node is passed through the NAS or AP of visiting network, this is then passed to the AAA (Authentication Authorization and Accounting) server, and the authentication server checks the realm and does start authentication procedure at the time of initialling authorizing module of the mobile terminal. It also initiates the mobility extension module, where the AAA server initiates MPA of the access network, which also informs the AAA server of the home network with information on the mobility extensions and request of the mobility parameters of the user terminal. The home AAA server interacts with the HA and collects mobile node parameters, as well as sending back details as a reply request to the visiting AAA server. After the mobility context transfer, the MPA conducts a mobility registration to the HA for that particular mobile node. Later in this paper, we will provide sequence of message exchanges during a mobility session of a  user mobile node during handover.

Keywords: Handover, Roaming, Mobility Management

Download Full-Text

 

Recognition of Handwritten Script
Aroosh Zahra , Memoona Khanam , Asim Munir and Malik Sikander Hayat Khiyal

In modern and scientific world, handwritten text recognition becomes very popular because it helps to solve complex problems to ease the tasks and also saves the time. This research paper presents a system which takes the scanned image of human handwriting script and preprocess it and segment the image into individual lines then to words and then to isolated characters eventually and then recognize these characters and display the output as the automated text on screen. The proposed techniques for segmentation of lines and words is horizontal and vertical projections while for character segmentation, a new approach is implemented in which segmented column vectors are find using foreground pixel sum and then by using these column vectors, segmentation for characters is done and object properties of area and boundaries is used  to make the segmentation more fine and accurate. After segmentation, pattern correlation technique is applied to recognize the characters.

Keywords: Foreground pixel sum, Horizontal projection, Object Properties, Recognition of Handwritten script, Segmentation of Handwritten script, Template Correlation Technique, Vertical Projection

Download Full-Text

 

Comparison of AdHoc Routing Protocols on the Basis of Goodput and Routing Load
Rahul Malhotra, Sangeeta Monga and Gurmeet Kaur

During the last few years, continuous progresses in wireless communications have opened new research ?elds in computer networking, aimed at extending data networks connectivity to environments where wired solutions are impracticable. The research in wireless Adhoc networks, that provides a communication between different Adhoc or Temporary nodes. This paper compares the two protocols Adhoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance Vector (DSDV) both having nonuniform routing protocols that manage mobile nodes and different routing functions. Further, these protocols implemented in network simulator (NS2) that supports Mobile adhoc networks. The protocol works on MAC layer and properly transmitted the packet to the upper layer called Network Layer over 802.11 networks. In the implementation of these protocols using at both end i.e. sender side and receiver side uses TCP Reno protocol because the packet loss should be minimum. To minimize the delay and bandwidth therefore using RTS-CTS signal in the implementation so that no hidden nodes access the bandwidth. In this work, each mobile node works as a specialized router and obtained routing information when needed. It provides a loop free route while repairing links when it was broken.

Keywords: AODV, DSDV, NS2

Download Full-Text

 

New Technique To Solve Nonogram Puzzle Problem With Quake Algorithm
Khalaf Khatatneh

Nonograms are logic puzzles in which squares in a grid are colored or left blank according to numbers given at the side of the grid where the cell is filled (black) or empty (white) which in that case called space. Once completed, the puzzle reveals a hidden picture. Nonograms may be black and white or colored, in which case the number clues are also colored to show the color of the squares. Nonograms can be of any size or shape ,also there is a different kind of nongram-called triddlers- in which cells are triangles. in this kind of puzzles we have three sets of clues instead only of two. and it vary in difficulty of the levels. The general Nonogram problem is NP-hard.

Keywords: N-Puzzle, shortest path problem ,Dijkstra algorithm, Automata with Multiplicities

Download Full-Text

 

Correlation identification by Normalizing the Sequential Frequent Pattern set with  the Specification of Constraints and Preferences
Janga Vijay Kumar and Vanam Sravan Kumar

Sequential Frequent pattern(Frequent patterns can be extended to the correlation between items) mining is an important data mining problem with broad applications which involves identifying sequentially frequently co-occurring set of items in a given transactional Or relational databases. Although there are many in-depth studies on efficient sequential frequent pattern mining algorithms still they leads to generate large set of sequential frequent patterns which seems to be vulnerable and inappropriate or irrelevant. Hence such set can be reducible by considering the preferences and constraints associated with each pattern to be mined, further it can be extended to mine the Correlations between the sets of Items. In this paper, we propose set of constraints and preferences needs to be specified with an Item set in addition to specifying Item set parameters like support and confidence. A user can simply specify a preference of set of items and constraints associated with each item identifies whether an Item can be included in the frequent set or NOT. We need to formulate the preferences for mining.

Keywords: Data mining, sequential Frequent-pattern mining, constraints, preferences, Normalization

Download Full-Text

Volume 3, Issue 11, November 2011

Tags

,

A Processor Mapping Strategy for Processor Utilization in a Heterogeneous Distributed System
Hidehiro Kanemitsu, Gilhyon Lee, Hidenori Nakazato, Takashige Hoshiai and Yoshiyori Urano

In a distributed system where processors are connected over the network, how to minimize the schedule length is one of major objectives in the field of task scheduling. Conventional task clustering heuristics and processor assignment methods for heterogeneous distributed systems are used to generate the assignment unit for the given set of processors. Such approaches try to use all processors for minimizing the schedule length. However, there is no way to know automatically how many processors are needed to minimize the schedule length. Thus, there is no criterion for maximizing the degree of contribution toward reduction of the schedule length per a processor. In this paper, we propose a method for processor mapping for processor utilization. Our proposal imposes the lower bound for every assignment unit size for limiting the number of required processors. Under the constraint, the processor assignment is performed to minimize the schedule length. In the mapping, the  processor, by which the indicative value for the schedule length can be minimized, is selected for the assignment. Experimental results by simulations show that our proposal has advantages of processor utilization over conventional approaches.

Keywords: Processor Mapping, Task Scheduling, Processor Utilization, Hegerogeneouse Distributed Systems

Download Full-Text

 

Detection of Learner’s Affective State Based on Mouse Movements
Georgios Tsoulouhas, Dimitrios Georgiou and Alexandros Karakos

In this paper we introduce a new method of detection of the emotional state of a student who attends a lesson online. To be more specific we are occupied with the detection of boredom which can be caused by the presentation of a course through a distance learning environment. The detection method is based on information obtained from the movements of the user’s computer mouse. We suggest some metrics which are derived from this information and may be related to the emotional state of the user. Based on these metrics we use data mining methods to classify the results. In order to test the efficiency of the method we carried out an experiment with 136 students in a particular course which consisted of 7 different learning objects. The students were called to attend the lesson and to express periodically their emotional condition (if they feel bored or not) for each learning object separately. The collected data after being processed were applied to the known classification algorithm C4.5 which classifies the values of the metrics according to the user’s emotional state.

Keywords: Distance learning, Mining methods and algorithms, Adaptive hypermedia

Download Full-Text

 

Deployment of Software Metrics Measurements Techniques within Software Development Process
Zahra Gholami, Nasser Modiri and Sam Jabbehdari

Software quality is an important criterion in producing softwares which increases productivity and results in powerful and invincible softwares. We can say that quality assurance is the main principle and plan in software production. Solution which is suggested for quality assurance and improvement of software is measurement. The result of measurement process is to acquire a set of metrics. Software metrics are continuous usage of techniques based on measurement in software development process and products in order to provide timely and significant management information, with using these techniques in improvement of process and its products. Therefore we need derivation of respective metrics in order to achieve our goal. Considering the importance of software metrics, utilization of international standard software life cycle process model (ISO/IEC 12207) and measurement process of Plan/Do/Check/Act in order to monitor software production cycle is presented in this paper.

Keywords: Software Metrics, Measurement, Software Development Process, ISO/IEC 12207

Download Full-Text

 

Global and configurable model for crowd behavioral simulation
Hakim Soussi, Joël Savelli and Marc Neveu

Our purpose in this paper is to describe a generic simple and flexible behavior oriented model that may be used to build various crowd behavioral simulations. We deal here with how behavioral structure of animation is dynamically built, that is how every agent of the scene will adopt a specific behavior (instead of others) in a given situation. We introduce here the conceptual basis of the model that consists in the notions of context and character attribute. By using these tools, a user may define an application and interact with the crowd in an efficient way. We propose a mechanism to select agent behaviors by taking into account their “personality” and the current set of contexts they are submitted to. We also propose a mechanism which allows to define propagating contexts and to propagate them via the agents according to the personality of each one (i.e., according to its personality, the agent can or cannot propagate this context to other agents). To show the efficiency of our model, we separate all possible crowds into three categories and show how to describe them with the elements of the model. We also focus on the realism of crowds. We distinguish macroscopic realism, which comes from the emergent properties and behavior of the crowd, and microscopic realism which depends on the behaviors of a few agents. We show here how macroscopic and microscopic realism may be controlled by using our model.

Keywords: Behavioral animation, crowd, context, character attributes

Download Full-Text

 

Behavioral animation, crowd, context, character attributes
K. Vijayalakshmi, R. Dhanapal and B. Balaji Selva Ganesh

The paper highlights the Critical factors for the Customer preferences in the business markets using the Data mining. The customer purchase patterns approach, using the association rules mining technique, is an effective way of extracting the rules from the raw data and inferring the buying patterns among them. The success of proper implementation of these techniques in the business firms is mixed. This is due to the fact that trends and taste of the customers are highly unpredictable. Hence this implementation requires planning regarding the factors which need to be considered before going for the new innovative ideas. These factors may vary from firm to firm but the general factor for effective implementation of the customer preference is essential. This factor termed as Critical factors of Customer preferences (CFCP) decides the failure or success of the implementation. Marketing efforts usually focus on minimizing churn because the cost of bringing a customer back is usually much greater than the cost of retaining the customer in the first place. The paper highlights those key essential factors which need to be considered before automating the process of searching the mountain of customer’s related data using Data mining to find patterns or a model that helps the business people to predict the behaviors of the customer to achieve their long term goals, vision & mission.

Keywords: Customer preference, Data mining, Churn, Association rule mining, Patterns

Download Full-Text

 

Finite Volume Model to Study Calcium Diffusion in Neuron Involving JRYR, JSERCA and JLEAK
Amrita Tripathi and Neeru Adlakha

Calcium dynamics is the highly responsible for intracellular electrical (action potential) and chemical (neurotransmitter) signaling in neuron cell. The Mathematical modeling of calcium dynamics in a neuron leads to the reaction diffusion equation which involves the parameters like diffusion coefficient, free calcium, bound calcium, buffers and bound buffer. Here the parameters like receptors, serca and leak are also incorporated in the model. Appropriate boundary conditions have been framed based on biophysical conditions of the problem. The finite volume method has been employed to obtain the solution. The computer program has been developed using MATLAB 7.11 for the entire problem to compute Ca2+ profiles and study the relationships among various parameters.

Keywords: reaction diffusion equation; JRYR; JSERCA; JLEAK; excess buffer; finite volume method

Download Full-Text

 

A Hybrid Ranking Method For Constructing Negative Datasets of Protein-Protein Interactions
Jumail Taliba, Razib M. Othman, Umi K. Hassan and Rosfuzah Roslan

Lack of availability of negative examples in the study of computational Protein-Protein Interaction (PPI) prediction is a crucial problem. This leads to computational methods for creating such examples. Most of these methods rely on the fact that proteins not sharing common information tend not to be interacting. While using this fact as the basis for the selection method for non-PPI pairs may yield a negative dataset with high prediction accuracy, it does come with more bias as it is too selective. Other methods simply use random selection as an alternative for fair selection. However, these approaches do not guarantee the prediction accuracy. A method for constructing non-PPI datasets named AIDNIP is proposed. It is a hybrid of the above approaches. Thus, it can reduce biases of selection, while maintaining prediction accuracies. When compared to the existing methods using a Support Vector Machine-based PPI predictor, the proposed method performs better in several metrics investigated in this study. The Perl code and data used in this study are publically available at https://sites.google.com/a/fsksm.utm.my/aidnip.

Keywords: Non-Interacting Protein Pairs, Negative Datasets, Protein-Protein Interactions Prediction

Download Full-Text

 

Kernel Based Nonlinear Weighted Least Squares Regression
Antoni Wibowo and Mohamad Ishak Desa

In this paper, we consider a regression model with heteroscedastic errors in which the prediction of ordinary least squares (OLS) based regressions can be inappropriate. Weighted least squares (WLS) is widely used to handle in the heteroscedastic model by transforming an original model into a new model that satisfies homoscedasticity assumption. However, WLS yields a linear prediction and has no guarantee to avoid the negative effect of multicollinearity. Under this circumstance, we propose a method to overcome these difficulties using the hybridization of WLS regression with kernel method. We use WLS to handle the  heteroscedastic errors and use kernel method to perform a nonlinear model and to eliminate the negative effect of multicollinearity in this regression model. Then, we compare the performance of the proposed method with the WLS regression and it gives better results than WLS regression.

Keywords: Kernel principal component regression, kernel trick, multicollinearity, heteroscedastic, nonlinear regression, weighted least squares

Download Full-Text

 

Ranking Discovered Rules from Data Mining by MADM Method
Peyman Gholami, Mohamad Sepehri Rad, Azade Bazle and Nezam Faghih

Data mining techniques, extracting patterns from large databases have become widespread in business. Using these techniques, various rules may be obtained and only a small number of these rules may be selected for implementation due, at least in part, to limitations of budget and resources. Evaluating and ranking the interestingness or usefulness of association rules is important in data mining. This paper proposes entropy, an applicable and useful weighting technique of multiple attribute decision making (MADM) method. Then, utilizing this model, a popular method, technique for order preference by similarity to ideal solution (TOPSIS) method, for prioritizing association rules by considering multiple criteria is proposed. As an advantage, the proposed method is computationally more efficient than previous works. Using an example of market basket analysis, applicability of our method for measuring the ranking of association rules with multiple criteria is illustrated.

Keywords: component ; data mining; association rule; MADM; entropy; ranking; TOPSIS

Download Full-Text

 

Accident Detection by Wireless Sensor Network and Sending Rescue Message with GPS
Sukanya Ray, Amnesh Goel and Nidhi Chandra

In the last decade the number of deaths and fatal injuries from traffic accidents has been increasing rapidly but driving remains an essential requirement so, one of the urgent needs of the Vehicular Ad-Hoc Network (VANET) is to provide immediate medication and necessary help after an accident occurs so that the lives can be saved. This paper aims to suggest an Intelligent Transportation System (ITS) for four wheelers by using Wireless Sensor Network (WSN) and sending rescue messages to emergency contacts, which is saved before hand by the driver and to nearby police stations and hospitals so that necessary help can be provided within time.

Keywords: WSN, Four wheeler ITS, SMS, GPS, VANET

Download Full-Text

 

Finite Volume Model to Study the Effect of ER flux on Cytosolic Calcium Distribution in Astrocytes
Brajesh Kumar Jha, Neeru Adlakha and M. N. Mehta

Most of the intra-cellular events involved in the initiation and propagation phases of this process has now been identified astrocytes. The control of the spread of intracellular calcium signaling has been demonstrated to occur at several levels including IP3 receptors, intracellular Ca2+ stores like endoplasmic reticulum (ER) . In normal and pathological situations that affect one or several of these steps can be predicted to influence on astrocytic calcium waves. In view of above a mathematical  model is developed to study interdependence of all the important parameters like diffusion coefficient and influx over [Ca2+] profile. Model incorporates the ER fluxes. Finite volume method is employed to solve the problem. A program has been developed using in MATLAB 7.5 for the entire problem and simulated on an AMD-Turion 32-bite machine to compute the numerical results. In view of above a mathematical model is developed to study calcium transport between cytosol and ER.

Keywords: Ca2+ profile, ER flux, Astrocytes, FVM

Download Full-Text

 

The fuzzy cooperative genetic algorithm (FCoGA): The optimisation of a fuzzy model through incorporation of a cooperative coevolutionary method
Arfian M. Ismail, Hishammuddin Asmuni and Razib M. Othman

Genetic Algorithms (GA) have been widely used to represent parameters in a fuzzy system. However, when a fuzzy system is applied to a complex problem, GA tends to lose their effectiveness because of the representation complexity of the solution. In this paper, an improved method of fuzzy modelling called as Fuzzy Cooperative Genetic Algorithm (FCoGA) is introduced. Cooperative Coevolution (CC) is applied to the GA by subdividing the chromosome into three sub-chromosomes known as species, and thus reducing the representation complexity of the solution. Furthermore, two-level evaluations in the FCoGA, at the species level and cooperative chromosome level, are introduced to improve the performance. To measure the performance of FCoGA, two benchmark datasets namely Wisconsin Breast Cancer Diagnosis (WBCD) and Pima Indian Diabetes (PID) datasets have been used. The experimental results show that FCoGA slightly improves the accuracy rate and maintains comparable effectiveness with other existing study solutions.

Keywords: Cooperative coevolutionary algorithm, Genetic algorithm, Cooperative chromosome, Fuzzy modelling

Download Full-Text

 

A Vertical Format to Mine Regular Patterns in Incremental Transactional Databases
G. Vijay Kumar, M. Sreedevi and NVS Pavan Kumar

In real life, transactional databases grow incrementally. The occurrence behaviour of patterns may change significantly when the database is updated. Each time when a small set of transactions added into the database, it is undesirable to mine regular patterns from scratch. So Mining Regular Patterns in incremental transactional databases is an important problem in data mining. Although some efforts done in finding regular patterns in incremental transactional databases, no such method has been proposed yet by using vertical format with one database scan. Therefore, in this paper we proposed a new method called IncVDRP method to generate complete set of regular patterns in incremental transactional databases for a user given regularity threshold. Our experimental result shows our results are quite promising.

Keywords: Incremental transactional database, Regular patterns, regularity threshold, Vertical format

Download Full-Text

 

ENFD: An Expert System tool for Fault Detection on Computer Network
Effat mirzaei and Chitra Dadkhah

One of the important tasks of computer network administrator is diagnostic faults occurred in computer networks. Design an automated system is necessary because the absence of computer network manager in the organization and detect the faults quickly. So this paper aims to design an ENFD system (Expert Network Fault Detection) based on expert knowledge for detecting the hardware and software problems in computer networks. The knowledge of ENFD system has been classified in four categories (client, server, network hardware and firewall) based on expert opinion and has been represented with If-then method, which is compatible with the problem nature, in knowledge base of system. The ENFD system will suggest an appropriate solution for solving the detected problem. The ENFD system is independent on the topology of computer networks and it is easily usable for users who have not a lot of information on computer networks. In the absent of specialists when problems is occur, computer network management could consult the ENFD system for solving the problem. The ENFD system is capable to explain the cause of the problems has occurred for increasing the accurate of its inference. The ENFD system designed and tested with prolog programming language.

Keywords: expert system, computer network, fault detection, decision tree

Download Full-Text

 

S.pombe Protein-Protein Interaction Prediction by using Topological Ontology of S.cerevisiae Protein Network
Praveen Kumar Singh and Madhvi Shakya

Traditionally, protein interactions have been studied individually by genetic, biochemical and biophysical techniques. Availability of genomic information and protein interaction maps has created an opportunity to improve computational methods. Proposed method is novel approach of graph comparison method used to find protein interaction networks of Schizosaccharomyces pombe from that of Saccharomyces cerevisiae. Topological properties of a protein network can be described through topological ontology by using ontological entities – nodes (proteins) and edge (interaction). Unknown protein interaction of S. pombe is predicted by topological similarity search in two steps. First is the identification of similar nodes (orthologous proteins) through BLAST. Second similarity search is done by ontological instances which measure functional similarity based on the binary interactions and groupwise similarity search. Proposed method predicts potential protein interaction by topological similarity, which solves the problem of understanding the biological behavior of protein interaction network within different organism.

Keywords: Binary interaction, Functional conservation, Orthologous groups, Topological similarity

Download Full-Text

 

SOAR Agents
S. Srinivasan, Nitin Bansal, Vivek Jaglan and Sujit Kumar Singh

This paper intends to investigate Soar architecture to work on the full range of tasks like an intelligent agent from a highly routine to difficult and unexpected problems . Also to understand how Soar agent uses appropriate forms of knowledge such as procedural , declarative and episodic also to apply all possible methods by interacting with outside world and at the same time how Soar agent acquires knowledge by performing such tasks . Our intention is to find out all the capabilities that Soar agent possesses . The world is very complex place for general intelligent agents to act . The aim of our work is to study various environments under which the Soar agent performs . Also our focus is to study Memory ,knowledge and knowledge representation that are handled by Soar agent . Ultimately various parameters are considered for evaluating soar agent . The design of Soar can be seen as an investigation of all such capabilities , environments , knowledge and knowledge representations.

Keywords: BDI, subgoal and chunking

Download Full-Text

 

Visual Reading Patterns on Arabic Interfaces: Insights from Eye Tracking
Remya P. George, Rasiya Anwar and Sunitha Jeyasekhar

This paper describes visual reading patterns of Arabic script exhibited by web users in their interaction with Arabic interfaces. Eye gaze of participants has been extracted from experiments which investigated different contexts. Patterns on electronic newspapers, eLearning Module, forums and search engines are examined and implications for design are discussed. We have found differences in the reading patterns exhibited by the readers compared to the studies in English interfaces because of variations in the direction of Arabic scripts as well as cultural factors.

Keywords: Arabic Interfaces, Eye Tracking, Visual Reading Patterns

Download Full-Text

 

Virtualization Technology in Green IT with Cloud Computing Infrastructure
Afshin Rezakhani Roozbahani, Nasser Modiri and Ali Mohammadi

The importance of IT is increased in ten years. One of the most important scopes in IT is virtualization. This technology helps to creating Green IT. In this paper we get help from cloud computing infrastructure to ready collaborative platform in Internet with placing servers that play the role of virtual machines servers. With this, Green IT can implement in high level and the management of virtualization is increased. With this approach, the concept of Green IT developed faster than before and created a new platform to better implementation of virtualization.
Keywords: BDI, subgoal and chunking

Download Full-Text

Volume 3, Issue 10, October 2011

Tags

,

Towards Mobile Supported Academic Information System
Simon S. Msanjila and Lupyana Muhiche

Access to information in timely, completeness and quality manner is very challenging in developing countries such as Tanzania. Students in particular, require receiving accurate and timely progressive information regarding their studies in order to make informed decision regarding their academic progress. Traditional practice for delivering academic information such as examinations results in universities in Tanzania is through paper announcement on the notice boards. The practice obliges students to travel to universities to see their results or provide their confidential information such as examination numbers to other people so that they can read and inform them about their results. This paper presents a Mobile Academic Information System (MAIS) aimed at automating management of student’s academic records with a possibility of remote access.

Keywords: Mobile systems, information system, academic records management, MAIS system, remote information access

Download Full-Text

 

COSMPC-COSMOS based Middleware for Pervasive Computing
R. Nagaraja and G. T. Raju

Ubiquitous computing environments are characterized by a high number of mobile devices, wireless networks and usage models. Distributed applications for such environments must continuously manage their execution context in order to detect the conditions under which some adaptation actions are required. This execution context contains various categories of observable entities, such as network interface, operating system resources or user preferences. Mobile devices like PDAs or mobile phones have become widespread. Similarly network functionality like GSM, Bluetooth or WLAN has become a standard. Nevertheless, not many applications take mobility into account. An application and its communication component are tightly coupled and the application assumes that network behavior does not change. Here in this paper we propose a new lightweight middleware architecture based on Service Component Architecture (SCA) and COntext entitieS coMpositiOn and Sharing (COSMOS) consisting of a small foot-print core layer and a modularized pluggable infrastructure. The SCA eases the reconfiguration of the components at runtime to support different communication mechanisms and service discovery protocols. Besides, using SCA, new functionalities can be added to the middleware platform that can be provided by remote applications (SCA or not). The architecture presented in this paper is suitable for mobile devices and extensible to make use of abstractions to conquer heterogeneity in mobile devices.

Keywords: CDC Connected Device Configuration, CLDC Connected Limited Device Configuration, COSMOS COntext entitieS coMpositiOn and Sharing, SCA Service Component Architecture, Fractal, Composite, Factory Method, Singleton, Flyweight

Download Full-Text

 

Analysis and Clustering of Movie Genres
Hasan Bulut and Serdar Korukoglu

Most of the movies blend a genre with other genres; that is movie directors combine elements from different genres with each other. A movie may blend the love-oriented plot of the romance genre with Western or Science Fiction. Hence a movie may belong to several genres. A movie is also related with some keywords to describe the contents of the movie. These keywords are usually used during search to bring a movie according to user’s interest. In this paper, we establish genre keyword sets from movie keywords and use these keyword sets to analyze the proximity of genres with each other. In this study, we use movie data from The Internet Movie Database (IMDB). Genres are classified using hierarchical clustering algorithm and principal component factor analysis (PCFA). The study shows us which genres are mostly used together in a movie. We show that results of the two analyses support each other.

Keywords: Hierarchical clustering, Internet Movie Database, movie genres, principal component factor analysis

Download Full-Text

 

Exploring textural analysis for historical documents characterization
Anis Kricha and Najoua Essoukri Ben Amara

In this paper we propose a new approach to characterize images from historical documents based on textual analysis. Our contribution fits in the whole context of historical document digitalization delivered from the National Library of Tunisia. It mainly explores the correlation between different bands of decomposition in the wavelet transform. However, the choice of a set of non-redundant and relevant primitives remains delicate. The features chosen in our approach stem from a study based on both the reliefF algorithm, which eliminates irrelevant features, and factor analysis, which excludes the redundant features.  The whole system is evaluated on a set of historical documents to separate text and graphics of historical documents and to separate different types of alphabet (Arabic, Latin and Hebrew).

Keywords: Correlation, wavelet transform, ReliefF, factor analysis, historical documents

Download Full-Text

 

Dynamic Spectrum Management Techniques Using Cognitive Radio: Issues and Proposed System
Dipak P.Patil and Vijay M.Wadhai

This article addresses various issues related to the dynamic spectrum management and also presents the proposed system for design of efficient and flexible spectrum acess and utilization of available spectrum amongst secondary (unlicensed) users.Because of the static spectrum allocation policy,the most of the available spectrum remains underutilized,hence efforts are required to switch from the current static spectrum management policy to a dynamic one.The cognitive radio technique is acknowledged as the most efficient method to improve the spectrum utilization, by utilizing the available spectrum effectively  amongst the secondary users in an opportunistic manner in wireless communication networks. In this article the various issues related to the dynamic spectrum management are discussed for efficient spectrum use. Open research issues from spectrum management perspective like spectrum sensing, spectrum sharing, spectrum scheduling, mobility and Qos are also outlined. We propose the system model for design of efficient and flexible spectrum access and utilization of available spectrum amongst secondary (unlicensed) users. The proposed system presented, describes the way for improving the performance of the wireless networks by means of developing the efficient and fast algorithms to manage the spectrum dynamically.

Keywords: Cognitive Radio, Dynamic Spectrum Acess, Spectrum allocation, Spectrum management

Download Full-Text

 

Hardware-Accelerated Raycasting: Towards an Effective Brain MRI Visualization
A.M. Adeshina, R. Hashim, N.E.A. Khalid and Siti Z.Z. Abidin

The rapid development in information technology has immensely contributed to the use of modern approaches for visualizing volumetric data. Consequently, medical volume visualization is increasingly attracting attension towards achieving an effective visualization algorithm for medical diagnosis and pre-treatment planning. Previously, research has been addressing implemention of algorithm that can visualize 2-D images into 3-D. Meanwhile, achieving such a rendering algorithm at an interactive speed and of good robustness to handle mass data still remains a challenging issue. However, in medical diagnosis, finding the exact location of brain tumor or diseases is an important step of surgery / disease management. This paper proposes a GPU-based raycasting algorithm for accurate allocation and localization of human brain abnormalities using magnetic resonance (MRI) images of normal and abnormal patients.

Keywords: Brain tumor, graphic processing units, magnetic resonance imaging, volume visualization

Download Full-Text

 

Square Topology for NoCs
M. Ghorbanian, R. Sabbaghi-Nadooshan and H. Doroud

In this paper different topologies are studied and their functions in networks are described. Ultimately, some novel topology are introduced and compared with existing ones in regard of factors such as power and delay. This paper proposes square topology as an efficient topology for Network-on-Chips (NoCs). Although the proposed topology imposes the cost near to that of the mesh topology, the proposed topology 1) provides lower diameter for NoC, 2) offers better performance under uniform and hotspot traffic pattern. Results of comparisons show that proposed topology perform better than Mesh and Spidergon topology.

Keywords: Square, Topology, NoCs, Performance evaluation, Power consumption

Download Full-Text

 

Specifying Time-Based Users’ Requirements in Service Oriented Systems
Seyyed Hossein Seyyedi Arani and Mostafa Ghobaei Arani

In service oriented system, services can be called by application programs and other services. Using the system, organizations implements inter-organizational workflow by composing their services dynamically. For this purpose, the necessary requirement is the existence of formally defined standard methods for specification of these compositions in an abstract way. Additionally, for many of these compositions, time constraint is a determinant of requirement satisfaction. In this paper, we first specify common types of elaborate and time-based users’ requirements in service oriented systems, and then using an three-step approach, suggest a specific composition of services for each type of requirement. In the first step of the approach, an operator is introduced for informal stating a composite service. In the second step, the composition is formally specified using a model based on Transition Timed Petri-Nets, and in the third step, the model is defined formally.

Keywords: Petri-Nets, Requirement specification, Service oriented architecture (SOA), Web service

Download Full-Text

 

A Survey on Large Scale Schema and Ontology Matching Techniques
K. Saruladha, G. Aghila and B. Sathiya

With the fast growth and the increasing usage of the large variety of data like XML schemas, ontologies. In many domains, the heterogeneity among the data increases enormously. Hence solving such heterogeneity needs matching techniques. In areas like E-business, web and life sciences the size of XML schema and ontology is large. But most of the existing matching techniques address only small match tasks. So, we present an overview of recently proposed matching techniques like early pruning of the search space, divide and conquer strategies, parallel matching and some renowned ontology matching tools which achieve high match efficiency or/and high quality for large-scale matching. In addition to this the pros and cons of various matching techniques is summarized.

Keywords: Similarity Measure, Schema Matching, Ontology Matching, Ontology Alignment

Download Full-Text

 

A comparison of mel-frequency cepstral coefficient (MFCC) calculation techniques
Amelia C. Kelly and Christer Gobl

Unit selection speech synthesis involves concatenating segments of speech contained in a large database in such a way as to create novel utterances. The sequence of speech segments is chosen using a cost function. In particular the join cost determines how well consecutive speech segments fit together by extracting acoustic parameters from frames of speech on either side of a potential join point and calculating the distance between them. The mel-frequency cepstral coefficient (MFCC) is a popular numerical representation of acoustic signals and is widely used in the fields of speech synthesis and recognition. In this paper we investigate some of the parameters that affect the calculation of the MFCC, particularly (i) the window length used to examine the speech segments, (ii) the time-frequency pre-processing performed on the signal, and (iii) the shape of the filters used in the mel filter bank. We show with experimental results that the choices of (i) – (iii) have a direct impact on the MFCC values calculated, and hence the ability of the distance measure to predict discontinuity, which has a significant impact on the ability of the synthesiser to produce quality speech output. In addition, while previous research tended to focus on sonorant sounds such as vowels, diphthongs and nasals, the speech data used in this study has been classified into the following three groups according to their acoustic characteristics – 1. Vowels (non-turbulent, periodic), 2. Voiced fricatives (turbulent, periodic sounds), 3. Voiceless fricatives (turbulent, non-periodic sounds). The choice of (i) is shown to significantly affect the calculation of MFCC values differently for each sound group. One possible application of these findings is altering the cost function in unit selection speech synthesis so that it accounts for the type of sound being joined.

Keywords: Feature extraction, signal analysis, mel-frequency cepstral coefficients (MFCC), speech synthesis

Download Full-Text

Volume 3, Issue 9, September 2011

Tags

,

Privacy and Security in Distributed Systems Using Three-Factor Authentication
A. Rengarajan, C. Jayakumar and R. Sugumar

As part of the security within distributed systems, various services and resources need protection from unauthorized use. Remote authentication is the most commonly used method to determine the identity of a remote client. This paper investigates a systematic approach for authenticating clients by three factors, namely password, smart card, and biometrics. A generic and secure framework is proposed to upgrade two-factor authentication to three-factor authentication. The conversion not only significantly improves the information assurance at low cost but also protects client privacy in distributed systems. In addition, our framework retains several practice-friendly properties of the underlying two-factor authentication, which we believe is of independent interest.
Download Full-Text

 

Hamiltonian Paths in K-alphabet Grid Graphs
Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri

Given a graph G, the Hamiltonian path problem is the problem of deciding whether a graph G contains a simple path that visits each vertex of G exactly once. This problem is a NP-complete problem for general grid graphs. In this paper, we provide the necessary and sufficient condition for the Hamiltonian path problem on special class of grid graphs, namely on a K-alphabet grid graphs.
Download Full-Text

 

Intelligent Agent Oriented Traffic Control Architecture
Sadia Afsar, Abdul Mateen and Fahim Arif

Computers has been evolved from the single user, static and dumb system to open, distributed dynamic and intelligent system. The evolved systems are working in distributed fashion, share information with other systems and improve their behavior through previous experience or statistics. The agent-based systems date back to the 90’s and is increasingly becoming an interesting and important area of research. Many computer researchers and programmers believe that agent oriented has provided the new and most important direction in software engineering and all other related fields. Our research proposed an intelligent vehicle traffic management system that uses autonomous agents. The proposed system uses the knowledge about the flow of previous signal to predict the incoming flow of current signal as well as the knowledge about the rescue vehicles. The architecture involves the video analysis and exploration using machine learning techniques to estimate and guess the flow of the vehicle traffic.
Download Full-Text

 

Design and Implementation of Echo State Network for Intrusion Detection
S. Saravanakumar, Jaya Kumar and S. Purushothaman

The complexity and number of attacks on computer systems are increasing day-by-day. Intrusion detection is a process of monitoring the various computer networks and systems for violations of security and this can be automatically done with the help of an intrusion detection system. An Intrusion Detection System (IDS) is a critical component for secure information management. IDS play a major role in detecting and disrupting various attacks before cooperating with the software. This work presents the investigations carried out on Echo State Network (ESN) structures for intrusion detection. New algorithms have been presented which have faster convergence and better performance in IDS from a set of available information in the database. This paper has been implemented with the KDD dataset to experiment the performance of ESN in classifying the Local Area Network (LAN) intrusion packets.
Download Full-Text

 

A Hybrid Despeckling Model for Medical Ultrasound Images
R.Vanithamani, G.Umamaheswari, A.AjayKrishnan, C.Ilaiyarasan, K. Iswariya and C.G.Kritika

A hybrid despecklingmodelbased on wavelet shrinkage and bilateral filter isdesigned and tested for ultrasound images. The different wavelet thresholding techniques along with bilateral filter before decomposition and after reconstruction using wavelets are compared against NeighShrinkSURE technique with and without bilateral filter.The performance of the proposed method is assessed using standard performance metrics like Signal to Noise Ratio (SNR), Edge Preservation Index (EPI) and Mean Square Error(MSE). The results demonstrate that the use of bilateral filter in combination with NeighShrinkSUREthresholding technique yields an increase in the Signal to Noise Ratio(SNR), Edge Preservation Index (EPI) anda decrease in the Mean Square Error (MSE) when compared to other methods.
Download Full-Text

 

Reusability metrics – An Evolution based Study on Object Oriented System, Component based System and Service Oriented System
G. Shanmugasundaram, V. Prasanna Venkatesan and C. Punitha Devi

Reusability is the key paradigm for increasing software quality in the software development. Reusability was the core concept of object oriented systems which there on evolved into component based systems and service oriented systems. The aim of this paper is to study the reuse metrics of these three systems and to propose a model to bring out the relationship. A template has been designed to study and record how the metrics are categorised and it forms the base for the evolution based  model. The outcome of the study was brought out by an evolutionary based model which states the maturity level of reuse metrics and identifies the gaps to measure complete reusability for service oriented systems.
Download Full-Text

 

Performance Comparison of Daubechies Wavelet Family for Bangla Vowel Synthesis
Shahina Haque and Tomio Takara

Bangla phoneme synthesis using conventional methods is primarily based on inspection of Fourier Transform (FT) which has resolution problem. In order to produce better accuracy, we attempted Wavelet Transform (WT) with Daubechies wavelet family for analyzing and synthesizing the seven Bangla vowels. The performance of the synthesized speech signal is measured by four methods. It is observed from our study that Daubechies12(db12) wavelet at decomposition level 5, stores more than 97% of the energy in the first few approximation coefficient with highest SNR, PSNR and reproduces the signal with lowest NRMSE.
Download Full-Text

 

A Hybrid method for Iris Segmentation
Muaadh Sh. Azzubeiry and Dzulkifli Bin Mohammed

Advance development in security technology has caused many major corporations and governments to start employing modern techniques in identifying the identity of the individuals. Among the common biometric identification methods are facial recognition, fingerprint recognition, speaker verification and so on, presenting a new solution for applications that require a high degree of security. Among these biometric methods, iris recognition becomes an important topic in pattern recognition and it depends on the iris which is located in a place that is still stable through human life. Furthermore, the probability to find two identical irises approaching to zero value is quite easy. The identification system consists of several stages, and segmentation is the most crucial step. The current segmentation methods still have its limitation in localizing the iris due to the circular shape consideration of the pupil. In this paper an enhanced hybrid method, which can guarantee the accuracy of the iris identification system is proposed. The proposed method takes into account the elliptical shape of the pupil and iris. Moreover, Eyelid detection is another step that has been proposed in this paper as a part of segmentation stage. The dataset which is used is CASIA v3 including the three subsets: Interval, Lamp and Twin. The performance measurement of the proposed method is done by determining the number of success images. The results of the study are very promising with an accuracy of 99.1% as compared to the related existing methods.
Download Full-Text

 

Performance Analysis of Routing and Wavelength Assignment Algorithms for Hybrid Multicast Networks
D. V. Pradeep Sankar and K. Muneeswaran

Most of the existing Routing and Wavelength Assignment algorithms consider only the routing and available wavelengths for unicast traffic, but those works not considering the multicast traffic that may be important constraint in many real-time multicast applications. In this paper, we consider the problem of routing connections with differentiated time constraints in wavelength-division multiplexing mesh networks. For this purpose, we propose the modified greedy techniques to reduce the call blocking. Experiments have been conducted using our Multicast Routing and Wavelength Assignment algorithm by constructing multiple spanning trees using Mayeda and Seshu algorithm and the call blocking probabilities for various network structures are reported. The performance results of the proposed method shows promising outcome of our algorithm.
Download Full-Text

 

A Partitioning-based method according to budget distribution for task scheduling in Computational Grids
Mostafa Ghobaei Arani, Sam Jabbehdari and Nasser Modiri

The goal of computational grids is to aggregate heterogeneous distributed resources for solving large-scale problems in science, engineering and commerce. Unfortunately dynamism and heterogeneity of grid resources and also various demands for applications on grids cause the complexity of grid scheduling. So for having access to high performance in grid systems, It is necessary to get effective scheduling for resources. Most Quality of Service (QoS) constraint based workflow scheduling algorithms are based on either budget or deadline constraints. In this paper, we solve the problem of budget constraint-based scheduling through dividing total problem on several partitions and budget distribution on each of them. After budget distribution, we can find a local optimal schedule for each partition based on its sub-budget. We evaluate proposed algorithm compared with Back-tracking and BTO scheduling algorithms in the fields of time and cost execution. Simulation experimental results shows that proposed algorithm provide better performance in low-level budgets.
Download Full-Text

 

A Hybrid Model Based on Feature Extraction for Network Intrusion Detection
Saeed Khazaee and Mohammad Saniee Abadeh

Intrusion Detection is one of the most important ways to increase computer network security. In this paper, we intend to explore the feasibility of applying feature extraction methods to the misuse detection task. The feature extraction stage is performed by several classifiers which we call FE-Clasifiers. In this study, instead of the usual five classes, to improvement of recognition accuracy, some subclasses are intended. So, here we have 11 classes not 5 classes. Evaluation of the proposed method is performed by KDDCup99 data set. Our experimental results indicate that intrusion detection system with feature extraction method has better performance than that without feature extraction method in classification rate, detection rate and false alarm rate.
Download Full-Text

 

Early Usability Model for Object-Oriented System
Sanjay Kumar Dubey, Arashdeep Kaur and Ajay Rana

Usability is an important quality factor which is included in most of the quality models due to its consequences. The requirement of quality software causes the development of new techniques which can be used in developing model for predicting usability of software systems. One such technique is clustering. In this paper various metrics dataset are being used to assess the usability, namely, CM1, PC1 and JM1 taken from a public NASA data set. The metric sets include requirement time metrics and module metrics. These metrics are then combined using inner join method. This paper assess the usability of software system to be developed, at early stages of software life cycle using software fault data available from already developed similar kind of projects. Hence, examines the relationship between usability and software fault using K-Means clustering.
Download Full-Text

 

Implementation of Decision Support System for Outdoor Sports Using Machine Learning Techniques
Noreen Akram, Asim Munir, Memoona Khanam and Malik Sikander Hayat Khiyal

This paper presents a Decision Support System for Outdoor Sports. Outdoor Sports are greatly affected by the weather condition so basically the support provided by the system proposed is the decision whether to carry out the game or not based on the weather and field conditions. The weather attributes taken into consideration are Outlook, Temperature, Humidity, and Wind. The Field values taken are hard surface, Grass and Clay. The game considered is Tennis. The system is implemented using Machine Learning technique Decision Tree Learning, The algorithm selected is ID3 algorithm. The tool used is MATLAB for the frontend and MS Access for the backend. The algorithm generate decision tree. Rules are formulated from the decision tree. The system makes decision based on these rules. The system is tested using 25 sample records. The average accuracy of the system comes out to be 84%. This system can be extended for other games.
Download Full-Text

 

A Survey of University Courses Timetable Scheduling Problem
Addin Osman, Adlan Balola, Anwar Ali Yahya and Yahya Ali Abdelrahman

This paper presents the mathematical definition of university courses timetable scheduling problem. The paper only shows the courses timetable. The genetic algorithm has been defined and its implementation for solving university courses timetable scheduling problem has been presented. A summary of some works related to the implementation of genetic algorithms in university courses timetable scheduling problems are presented.
Download Full-Text

Volume 3, Issue 8, August 2011

Tags

,

Evaluation of an Anthropomorphic User Interface in a Travel Reservation Context and Affordances
Pietro Murano, Anthony Gee, Patrik O’Brian Holt

This paper describes an experiment and its results concerning research that has been going on for a number of years in the area of anthropomorphic user interface feedback. The main aims of the research have been to examine the effectiveness and user satisfaction of anthropomorphic feedback in various domains. The results are of use to all interactive systems designers, particularly when dealing with issues of user interface feedback design. There is currently some disagreement amongst computer scientists concerning the suitability of such types of feedback. This research is working to resolve this disagreement. The experiment detailed, concerns the specific software domain of Online Factual Delivery in the specific context of online hotel bookings. Anthropomorphic feedback was compared against an equivalent non-anthropomorphic feedback. Statistically significant results were obtained suggesting that the non-anthropomorphic feedback was more effective. The results for user satisfaction were however less clear. The results obtained are compared with previous research. This suggests that the observed results could be due to the issue of differing domains yielding different results. However the results may also be due to the affordances at the interface being more facilitated in the non-anthropomorphic feedback.
Download Full-Text

 

MusicPedia: Retrieving and Merging- Interlinking Music Metadata
Pipina T. Nikolaidou, Stavros N. Shaeles, Alexandros S. Karakos

The rapid change of computers from isolated machines to networks and the need of people to exchange information lead us to the World Wide Web (WWW). Nowadays a lot of people are spending lot of hours in WWW searching information for every aspect of life. This increase of information in WWW, increase also the difficulty to find and access the information required. In response to this problem is Semantic Web, which is the field of web data from which actual meaning can be derived through analysis and machine learning. It is based on machine – comprehensible information enriched with metadata and uses the Xml  technology. While music is one of the most famous domains on web searches, music metadata would play a determinative role on music web searches. Music industry was traditionally known for its poor market research and analysis, but Semantic Web will improve its knowledge base. A very important issue on this domain is the fact that a music metadata standard does not exist and this leads to many significant problems, unresolved until today. We propose an approach to retrieve and merge dynamically music metadata from different databases in order to have more accurate and completed results. The retrieved metadata are written in Xml, which is a format widely used on Semantic Web. This paper describes a Semantic Web – based application so as to retrieve and merge online music information from three different music metadata databases.
Download Full-Text

 

Using Clustering and DEA for evaluation and ranking university majors
Peyman Gholami, Azadeh Bazleh, Mahdis Salehi

Although all university majors are prominent, and the necessity of their presence is of no question, they might not have the same priority basis considering different resources and strategies that could be spotted for a country. Their priorities likely change as the time goes by; that is, different majors are desirable at different time. If the government is informed of which majors could tackle today existing problems of world and its country, it surely more esteems those majors. This paper considers the problem of clustering and ranking university majors in Iran. To do so, a model is presented to clarify the procedure. Eight different criteria are determined, and 177 existing university majors are compared on these criteria. First, by k-means algorithm, university majors are clustered based on similarities and differences. Then, by DEA algorithm, we rank central point of each one clusters for evaluation and calculate the efficiency each clusters groups.
Download Full-Text

 

A Secret Key Cryptographic Algorithm
Sheetal Saigal, Saloni, Surbhi Akshat Sharma

Cryptography is the field concerned with linguistic and mathematical techniques for securing information, particularly in communications. Historically, cryptography was concerned only with encryption, i.e., means of transforming information from its normal, comprehensible form into an incomprehensible state, making it unreadable without the key. Encryption was used initially to ensure secrecy in critical information sharing, such as those of spies, defense communications, and diplomats. The field of cryptography has expanded its horizons: modern cryptography provides tools and tricks for more than just keeping secrets and has a variety of new and important applications, for example, authentication, digital signatures, electronic voting and digital cash. Cryptography is now an interdisciplinary subject, collating from several fields. Older forms of cryptography were majorly concerned with patterns in language and diagrams. Now, the emphasis has moved, and cryptography makes extensive use of mathematics, particularly discrete mathematics, and topics from number theory, information theory, computational complexity, statistics and combinatorics. The paper discusses about the history, means and the innovations in cryptography, we will be discussing about the various symmetric key algorithms in detail and also propose a new secret key algorithm for a considerably secret code and the key for the transmission of the messages and information.
Download Full-Text

 

Audio Steganography Using Mod 4 Method (M4M)
Souvik Bhattacharyya, Arko Kundu, Kaushik Chakraborty, Gautam Sanyal

Steganography is an emerging area which is used for secured data transmission over any public media. Considerable amount of work has been carried out by different researchers on steganography. In this work the authors propose a novel steganographic method for hiding information in an audio file. The proposed approach is developed based on M16M [10] approach on image steganography whih works on wav and mp3 format of audio files. The proposed approach works by selecting the embedding positions using some mathematical function and maps each two bit of the secret message in each of the selected positions in a specified manner. A pseudo random number generator is used here to locate the embedding positions of the message bits randomly. This solution is independent of the nature of the data to be hidden and produces a stego audio with minimum degradation.
Download Full-Text

 

CCAMS: A Tool for Co-Curricular Activities Management
Muhammad Farhan, Kaleem Razzaq Malik, Amjad Farooq

Learning management systems are widely used and also available in open source repositories for the curricular activities management. In this paper we will explore some learning management systems to check the support of co-curricular activities management. Students learn with the co-curricular activities along with curricular activities. We have implemented a web based system for this purpose and will present its 3-tier structure and some code snippets explaining the basic features of the system. In this paper we will try to show its importance with respect to current trend of learning and management through World Wide Web.
Download Full-Text

 

A Survey of Routing Metrics in Cluster-Based Routing Protocols for Wireless Mesh Networks
Adebanjo Adekiigbe, Kamalrulnizam Abu Bakar, Simeon Olumide Ogunnusi

Routing metrics that will strike a balanced tradeoff between low computational overheads and high throughput, low delay, load balancing and low interference still remain a greater challenge to researchers in wireless networks. This paper considered various routing metrics that were used in routing protocols of wireless mesh networks (WMNs) and identified the effect of each of these routing metrics on the performance of the protocols to deliver high throughput. The paper show case the performance comparism of cluster based routing protocols to expose the need for more robust network routing metrics to satisfy the requirement of WMNs for a highly scalable network without scarifying the quality of service (QoS) in the network.
Download Full-Text

 

Prototype of Haptic Device, Pen Tablet Collaborative Work System
Manabu Ishihara

A number of penmanship instruction systems, and other such systems, using interactive haptic devices connected to networks have been devised, and various experiments have been conducted on their use. Haptic devices utilize reactions to opposing forces (or actions by another party), and thus can be used to create systems that enhance perceptions of realism by providing sensations that convince the user that a helping hand is being provided. However, because fully haptic systems are expensive, in this paper, we report on a prototype system created using a haptic device and pen tablet, as well as a basic penmanship learning system that we created and tested.
Download Full-Text

 

Metrics for Measuring Attributes of Virtual Semantic Social Network Members
Imran Mir, Amjad Farooq, Amna Khan, Rizwan Mir

Semantic Social Networks provide virtual semantic community to people for maintaining relations and interactions. It bridges the gap which has been created by our fast paced life where we don’t find time to visit our friends and family frequently. Virtual Semantic Social Networks (VSSN) keep people close with their loved ones while updating them with latest stories of the members of their social circles. Members of these networks can be facilitated with friendship, dating, chatting, emailing, stuff sharing and gaming futures. Each member of the network adhere some attributes in terms of likings, disliking and interests. These attributes of VSSN members can be measured using metrics. Moreover metrics can help in figuring out the need of new features in a particular domain and they can also guide in eliminating the existing rustic features from network. In this paper we propose mathematical metrics for measuring some attributes of a VSSN members.
Download Full-Text

 

Simulation Analysis of DSR and TORA: On Demand Wireless Adhoc Routing Protocols
Rahul Malhotra, Gurpreet Singh

Communication has become a lifeline of the fastest moving world. The technology has spread its wings to reduce the need of complex cabling techniques to the emergence of wireless technology. This change has led to the need of secure and reliable communication medium without use of wired infrastructure and emergence of wireless ad-hoc networks. Wireless adhoc networks are a collection of mobile and semi-mobile nodes without an existing infrastructure, forming a temporary network. All the nodes in the network use a wireless Interface and communicate with each other through radio frequency or infrared. An ad-hoc network is a local area network built spontaneously when the devices connect. Dynamic Source Routing protocol is a self-organizing and self-configuring routing protocol and works on the principle of Route Discovery and Route Maintenance. Temporally Ordered Routing Algorithm is a distributed routing algorithm based on the concept of link reversal. TORA is implemented where nodes are continuously moving from one place to another. This paper focuses to compare the performances of on-demand routing protocols, DSR and TORA for wireless adhoc networks. The implementation of a network using network simulator OPNET has been done for 50 network nodes and the performance of these two network protocols for traffic sent and received, end to end delay during data communication and download and upload response time have been analyzed. The Dynamic source routing protocol is able to forward 95% of the traffic received. On the other hand, Temporally Ordered Routing Algorithm protocol forwards only 39% of the traffic received. The results from the simulation show that dynamic source routing protocol has given comparatively better performance than Temporally Ordered Routing Algorithm protocol.
Download Full-Text

 

Efficient Sorting for Repeated Data
Bhavesh Patel, Nishant Doshi

In repeated data, there are some values which come often or say more than once. Therefore, it may happen that during sorting we may get the already sorted part to sort. The known algorithms like quick sort, merge sort which doing O(nlogn) time for n data items, will not taken care of such thing. Therefore, resulting the sorting time is required more in repeated data. In this paper we had consider only repeated data and try to modify the quick sort to get better efficiency compare to previously proposed sorting algorithms. The proposed algorithms were implemented in C language.
Download Full-Text

 

An Efficient Blocking algorithm for Privacy Preserving Data Mining
R. Sugumar, C. Jayakumar, A. Rengarajan

Managing Huge volume of personal data and sharing of these data is proved to be beneficial for data mining application. Privacy-preserving data mining (PPDM) is one of the newest trends in privacy and security research. In many cases, users are unwilling to provide personal information unless the privacy of sensitive information is guaranteed. Privacy preserving data mining has become an important problem in recent years, because of the large amount of consumer data tracked by automated systems on the internet. In this paper, We design a blocking algorithm to provide better privacy than K-Anonymity method. In the Blocking based algorithms the idea is to substitute the value of an item supporting the rule we want to hide with a meaningless symbol.
Download Full-Text

 

Polarization Mode Dispersion (PMD), its limits, compensation and effect on optical fiber networks
R. L. Sharma, Ranjit Singh, Vinod Kumar

This paper deals with the polarization mode dispersion (PMD), its limits, which an optical fiber can tolerate, the compensation and the overall effect on optical fiber on high-speed optical networks. The polarization mode dispersion causes pulses broadening. Excessive broadening will cause bits to spread in such a manner that they overlap adjacent bits. The receiver may have difficulty in identifying the correct bits and interpreting adjacent bits, increasing bit error rate. The PMD is a difficult parameter to measure as it changes with time and depends upon environmental conditions. The statistical nature of the PMD has been discussed. Its effect on optical fiber and consequently on the optical networks has been analyzed and discussed.
Download Full-Text

 

An Efficient Approach of Fast External Sorting Algorithm in Data Warehouse
Abhishek Purohit, Naveen Hemrajani, Savita Shiwani, Ruchi Dave

Sorting of bulk data in warehouse is possible through external sorting and the effective performance of the external sorting is analyzed in terms of both time and I/O complexities.The proposed method is a hybrid technique that uses quick sort and In place merging in two distinct phases. Both the time and I/O complexities of the proposed algorithm are analyzed here. The proposed algorithm uses special in-place merging technique, which creates no extra backup file for manipulating huge records. For this, the algorithm saves huge disk space, which is needed to hold the large file. This also reduces time complexity and makes the algorithm faster.
Download Full-Text

 

Design and Synthesis of High Performance Adder Circuits
Pankaj Sharma, Rahul Malhotra, Mandeep Kaur

Data path units can’t build without using Adders but drawback of the existing adder architectures is the propagation delay. This propagation delay is due to the carry chain/path from the input to the output. In this paper our main focus is to follow the modularity in the design and focus on optimizing the depth of the addition operation by using different adder architectures. A comparison of the area and delay of the different adder architectures is carried out.
Download Full-Text

 

A Novel Phonetic Name Matching Technique
Junaid Tariq, Noman Ajmal, Azam Khan

Name is an attribute that is used to search a record almost in every application that keeps records, because name is a must attribute of every object. The practical experiences show that name undergoes lots of changes by time, which makes such searches complex. This paper covers various problems related to name, and shortcomings of existing techniques. It also provides a survey on different phonetic name matching techniques. Phonetic name matching techniques are faster than pattern matching techniques, but phonetic techniques don’t support features of pattern matching. At the end, we have presented a name matching techniques which uses phonetic approach to achieve the features of pattern matching. The proposed technique is flexible, as it handles the changes made to name over time, and also handles ‘single character error’ efficiently
Download Full-Text

 

Ranking of Web Search Through The Power Method
Hasan Tahir, Muhammad Tahir

A search engine is a coherent search entity which is designed to facilitate internet users in searching for their required information. The web is expanding at a phenomenal rate, and a typical search engine is required to process every user query and provide results which are accurate, consistent, filtered and ranked according to importance. Besides this a search engine is also required to process a user query quickly. Therefore the importance of a search algorithm that meets all the above goals cannot be negated. This paper presents the power method which forms the basis of most web search algorithms. The power method is an efficient algorithm that attempts to rank sites based on their importance. The algorithm is based on the use of adjacency matrix to identify dominant eigenvalues and dominant eigenvectors.
Download Full-Text

Volume 3, Issue 7, July 2011

Tags

,

Design and Implementation of an Optimized Security Protocol for Wireless Sensor Networks [ Full-Text ]
Hasan Tahir, Muhammad Younus Javed and Ruhma Tahir

Wireless Sensor Networks have been designed for a broad range of domains. Each domain has its own attributes and characteristics. Many of the domains in which wireless sensor networks will be deployed are extremely hostile and the sensors themselves are prone to attack. Extensive research has been conducted in the field of security but when it comes to wireless sensor networks all conventional security mechanisms fail because conventional mechanisms have not been designed for resource constrained environments. In this paper the design and implementation of a security protocol for wireless sensor networks has been presented that provides high levels of security while consuming very little resources. The new protocol referred to as Optimized Security Protocol (OSP) has been designed specifically for wireless sensor networks and provides confidentiality, authentication and integrity in a single suite. OSP has been implemented using TinyOS and TinyViz which are specially designed for simulating the complex environment of wireless sensor networks.

——————————————————————————————————————————————————————————————————–

The Impact of Queue on Opportunistic based Cognitive Radio Networks [ Full-Text ]
Samira Homayouni and Seyed Ali Ghorashi

In cognitive radio systems which include primary and secondary networks, dynamic spectrum sharing methods are implemented in order to provide more spectrum access opportunities for secondary users without interference to the primary ones. In this paper, we investigate the impact of queuing secondary users on the cognitive radio system performance. Resource sharing process in the considered system is modeled by a two-dimensional Markov chain and performance metrics such as blocking and dropping probabilities, mean waiting time and channel utilization for different populations of secondary users are computed and compared. Both analytical and simulation results show that in the presence of queue, the dropping probability of secondary users decreases intensively with the cost of increasing secondary users’ blocking probabilities and mean waiting time.

——————————————————————————————————————————————————————————————————–

A Novel Design Evaluation of Low-Voltage RF front-end with VCO in 0.18-µm CMOS [ Full-Text ]
M. Sumathi and S. Malarvizhi

A low-voltage direct-conversion receiver front-end for 2.4GHz radio applications is presented. It consists of a low-noise amplifier (LNA), a down-conversion mixer and a voltage-controlled oscillator (VCO). The proposed LNA uses modified cascode structure in differential topology and mixer utilizes folded switching technique for supply voltage reduction. The VCO uses novel cross –coupling topology with high Q inductor. The design theory and performance evaluation done in TSMC 0.18-µm CMOS technology scale. The RF front-end achieves a voltage conversion gain of 13 dB and a noise figure of 7.9 dB. The designed 3.5GHz VCO has a phase noise of -95.19 dBc/Hz at 1MHz offset.

——————————————————————————————————————————————————————————————————–

Stereo image Transference and Retrieval over SMS [ Full-Text ]
Muhammad Fahad Khan and Saira Beg

Paper presents the way of transferring stereo images using SMS over GSM network. Generally, Stereo image is composed of two stereoscopic images in such way that gives three dimensional affect when viewed. GSM have two short messaging services, which can transfer images and sounds etc. Such services are known as; MMS (Multimedia Messaging Service) and EMS (Extended Messaging Service).  EMS can send Predefined sounds, animation and images but have limitation that it does not support widely. MMS can send much higher contents than EMS but need 3G and other network capability in order to send large size data up to 1000 bytes. Other limitations are Portability, content adaption etc. Our major aim in this paper is to provide an alternative way of sending stereo images over SMS which is widely supported than EMS. We develop an application using J2ME Platform.

——————————————————————————————————————————————————————————————————–

Transaction Level Modeling of High Level DMA Controller [ Full-Text ]
R. Divya Praneetha, Y. Padma Sai and Paleti Lakshmi Kanth

Abstraction of the design is a powerful technique for the design and implementation of complex systems. It allows us to tackle complexity by first hiding unnecessary details and then working them out later. Hence, it is much essential to follow the design methodology that starts at a high-level of abstraction in the context of today’s increasingly complex system level design. Transaction level modeling is considered to be this new abstraction level. Transaction level modeling is a high-level approach of modeling digital systems where details of communication among modules are separated from the details of the implementation of the functional units or of the communication architecture. Direct Memory Access (DMA) is a feature of modern computers and micro processors that allows certain hardware subsystems within the computer to access system memory for reading and/or writing independently of the central processing unit. This paper discusses the modeling of DMA using TLM and compares the TLM modeling style of DMA with HDLs modeling.

——————————————————————————————————————————————————————————————————–

Survey on Autonomic Workload Management: Algorithms, Techniques and Models [ Full-Text ]
Basit Raza, Abdul Mateen, M M Awais and Muhammad Sher

In Database Management System (DBMS) and Data Warehouse (DW), workload is very important entity to be managed in a proper way and responsive way.  Earlier the DBMS and DW workload has been managed automatically but with growing size of data and increase in numbers of users to handle workload automatically become difficult or impossible. Workload management has become challenge for the database community and vendors. It is challenge to identify the queries, which create problem and/or resource contention queries. Further how we can know before executing queries and take decision about suspending or to kill the problematic queries. This paper provides the basis and achievements about autonomic computing in workload management. We surveyed the literature of workload management in DBMSs and DWs and categorized into self-* characteristics. These self-* characteristics include self-inspection, self-Optimization self-Configuration, self-organization, self-Prediction and self-Adaptation. The survey provides comparative analyses and highlights the short comings of the previous workload management techniques, algorithms and models. Finally the surveyed literature is categorized on the basis of workload type and autonomic perspective.

——————————————————————————————————————————————————————————————————–

Architecture and Design of Web Application Framework: A Preliminary Review [ Full-Text ]
Mohd Razak Samingan and Wan Mohd Nasir Wan Kadir

Among the earliest issues to be solved regarding to web application (WA) architecture and design is the performance problem and business logic complexities due to some limitations in conventional CGI architecture. These issues arise when WA began to be used to provide services with a very high number of accesses by users and solve more complex problems such as large scale e-learning system, online banking, one-stop online shopping center, etc. Most of the solutions are not considering the complexity that also brought along with the new proposed architecture as long as the aforementioned issues can be solved. As WA evolved and used to solve more complex problems, the next phases of WA architecture and design research have going towards for more simplified design, further exploiting database technology maturity, and search for suitable aided-tools to facilitate on some aspects of WA development process. The research direction has also move towards on proposal for better insights on WA design via motivation or enforcement of particular design pattern  and shows some awareness to the necessity for deep understanding on using technology appropriately as it was originally intended. Web application framework (WAF) that nowadays has been widely accepted for WA development has to be in tandem with the current research trends to provide better, profound and proven architecture-design inside the application.

——————————————————————————————————————————————————————————————————–

Simulation and Control of Distillation Process [ Full-Text ]
Asha Rani, Vijander Singh and J. R. P Gupta

The precise control of distillate quality is the objective of the present work and is achieved by controlling the temperature profile of the distillation process. The generic mathematical models of multicomponent distillation and reactive distillation processes are considered for simulation. The PID and fuzzy controllers are designed for both the processes. In case of multicomponent distillation process, the PID controller is designed with the help of Zeigler-Nichols tuning method and for reactive process the PID controller is designed using Tyreus-Luyben method. The PID controller is used to control the reboiler temperature of multicomponent distillation process. In case of reactive process the exothermic reaction takes place between the two feeds and the amount of heat generated depends upon the feed flow rate. Therefore the designed PID controller is used for controlling the feed flow rate which controls the temperature indirectly. The fuzzy controllers are designed for both the processes and are used for controlling the reboiler temperature and feed flow rate respectively. The results obtained from both the controllers are compared. It is observed from the results that the fuzzy controller performs better than the conventional PID controller.

——————————————————————————————————————————————————————————————————–

An Energy Efficient Multicast Routing Protocol Exploiting MGS Clustering Method in Mobile Ad-hoc Networks [ Full-Text ]
Md. Mosaddek Khan and Md. Mamun-or-Rashid

The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. In the routing approach it is difficult to find any proposal which can successfully mingle clustering, geographic information and multicasting technique. The task of improving the clustering techniques is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled routing protocol through which it is possible to use the surroundings defined above. It exploits multicast rather than using unicast and broadcast with some remarkable improvements. This approach also try to fix the existing typical problems reside in multicast approach. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. The clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. Finally we provide an efficient way of multicast forwarding by utilizing the geometric angular direction. We have evaluated our proposed routing (MGS-Route) in network simulator (ns-2.34) and it outperforms the existing proposals.

——————————————————————————————————————————————————————————————————–

Timing and Code Size Optimization on Achieving Full Parallelism in Uniform Nested Loops [ Full-Text ]
Y. Elloumi, M. Akil and M. H. Bedoui

Multidimensional Retiming is one of the most important optimization techniques to improve timing parameters of nested loops. It consists in exploring the iterative and recursive structures of loops to redistribute computation nodes on cycle periods, and thus to achieve full parallelism. However, this technique introduces a large overhead in a loop generation due to the loop transformation. The provided solutions are generally characterized by an important cycle number and a great code size. It represents the most limiting factors while implementing them in embedded systems. In this paper, we present a new Multidimensional Retiming technique, called “Optimal Multidimensional Retiming” (OMDR). It reveals the timing and data dependency characteristics of nodes, to minimize the overhead. The experimental results show that the average improvement on the execution time of the nested loops by our technique is 19.31% compared to the experiments provided by an existent Multidimensional Retiming Technique. The average code size is reduced by 43.53% compared to previous experiments.

——————————————————————————————————————————————————————————————————–

Dynamic Fuzzy Knowledge Representation via Adaptive Fuzzy Higher Order Petri Nets [ Full-Text ]
M. Amin and D. Shebl

Knowledge in expert system is vague and updated or  modified frequently, expert systems are fuzzy and dynamic systems. Suitable models for them should be adaptable, i.e., the models must have ability to adjust themselves according to the changes of the systems. However, fuzzy Petri nets (FPN’s) and fuzzy higher order Petri nets (FHOPN’s) as a modeling formalisms are not adaptable according to the changes of the weights. This is mainly due to the fixed weights. In this paper, we propose the formal description of adaptive fuzzy higher order Petri net (AFHOPN) that takes into account the changes of the weights of the arcs in the fuzzy reasoning process.  AFHOPN has the learning ability, but it does not need to transfer  into the neural networks. We show how AFHOPN can be used for representing the fuzzy rules of a dynamic rule-based system. Then, we develop a fuzzy reasoning algorithm and an algorithm  for updating the weights. Finally, we  give the algebraic forms of the state equation and the stability analysis of the proposed model.

——————————————————————————————————————————————————————————————————–

Object Oriented Caching Mechanism for Efficient Computing over Web [ Full-Text ]
Pushpa R. Suri and Harmunish Taneja

One of the major inventions of the 1990s is the World Wide Web (WWW). Since its advent in 1991, the Web has evolved as global interconnection of individual networks operated and used by both public and private sectors. Its origin can be traced back when Internet was the tool to interconnect laboratories busy in government research. WWW has been exponentially expanding reaching every remote corner of the earth. The web is not alone to expand; the rising load on the typical web server accompanies it. This rapid extension comes as a package of facilities and limitations. The major problem is of growing network traffic leading to congestion. It can be relaxed if requested documents are cached. From the user’s point of view, the response time for the query should be low as if independent of increased web content demands. Caching is the most ubiquitous mechanism in modern information computing over web for improving application performance and scalability. Conventional web based caching mechanism prove deficient when it comes to shared information access. Added functionality and flexibility are the major attractions of object oriented technology. Object oriented framework reduces the response time and complexity of computation. In this paper object oriented caching mechanism is proposed that promises flexibility and effectiveness in web.

——————————————————————————————————————————————————————————————————–

An Efficient Detection of Outliers and Hubs Using Minimum Spanning Tree [ Full-Text ]
T. Karthikeyan, S. John Peter and S. Chidambaranathan

In data mining detection of anomalous pattern in data is more interesting than detecting inliers. Minimum Spanning Tree based Clustering is an important task for the discovery of underlying structures in graph. Many algorithms find clusters by maximizing the number of intra-cluster edges. While such algorithms find useful and interesting structures, they tend to fail to identify and isolate two kinds of vertices that play special roles – vertices that bridge clusters (hubs) and vertices that are marginally connected to clusters (outliers). In this paper, we model hubs as high-degree nodes having high average weight value. Identifying hubs is useful for applications such as viral marketing and epidemiology since hubs are responsible for spreading ideas and disease. In contrast, outliers have little or no influence, and many may be isolated as noise in the data. In this paper we propose an efficient algorithm for detecting outliers and hubs in graph.

——————————————————————————————————————————————————————————————————–

Bangla Oral-Nasal Vowel Pairs: Acoustic Categorization and Comparative Study of Feature Extraction Methods [ Full-Text ]
Shahina Haque and Tomio Takara

Acoustic feature extraction of Bangla oral-nasal vowel pairs were done by pole-zero cepstral and all pole Linear Predictive Coding (LPC) method. It is observed that (1) Bangla nasal vowel space shrinks and shifts towards front with respect to it’s oral vowel space (2) For Bangla nasal vowels, cepstral method extracts more spectral details including  spectral zeros than the all pole LPC method. Comparative study shows that although both the method extracts similar speech parameters for each vowel but cepstral method is more appropriate than LPC method as far as the nasal vowels are concerned.

——————————————————————————————————————————————————————————————————–

A Multi-path Misbehaviour Aware Routing Scheme for Mobile Ad Hoc Networks [ Full-Text ]
Bhushan M. Manjre and Veena A. Gulhane

In a MANET, Node misbehavior is any such behavior that proves harmful to co-operative environment of MANET. Many schemes have been recently proposed for the detection and avoidance of misbehaving nodes, but still there are many issues like false detection due to network layer factors, packet dropping, and packet delaying which are yet to be addressed completely. To mitigate these problems, a novel multi-path routing protocol is proposed herewith that aims at finding reliable and secure routes for data communication before transmitting data packets over the same. Since routes are verified for security and reliability at the beginning of data transmission, hence probability of packet loss/delay misbehavior is minimized.It also implements behavior check mechanism over failure routes to point out the culprit node, checks whether it is misbehaving due to some network layer factors or it is intentionally programmed to do so. If it is intentionally misbehaving, then only it is avoided for future routes, otherwise not. Hence, false detection due to low energy and buffer overflow is avoided and the loyal node is given chance of reintroduction into the network again. Due to this, the network performance is optimized in terms of security and reliability. The proposed protocol, when compared with AOMDV protocol, shows improvement in terms of network throughput and reduction in end to end delay.

——————————————————————————————————————————————————————————————————–

A probing algorithm with Adaptive Workload Load Balancing capabilities for heterogeneous clusters
Full-Text ]

S. Kontogiannis and A. Karakos

This paper presents an adaptive load balancing algorithm, called AWLB for cluster based web systems. This algorithm maintains agents both at the web cluster and web servers in order to adapt its balancing decisions accordingly. AWLB algorithm also maintains its own protocol specification for signalling purposes among web switch and cluster nodes and also utilizes other protocols such as SNMP and ICMP for its balancing process. Performance gains are shown from tests of AWLB against known balancing Least Connections (LC) and Least Loaded (LL) algorithms used by web-farms. Finally, CPU performance tests at the web switch show both advantages and drawbacks of complicated but accurate adaptive decisions over less accurate but misbalancing policies.

——————————————————————————————————————————————————————————————————–

Mapping Approach of ITIL Service Management Processes to ISO/IEC 27001 Controls [ Full-Text ]
Razieh Sheikhpour and Nasser Modiri

Information security plays an important role in protecting the assets of an organization. A number of best practice frameworks exist to help organizations assess their security risks and implement appropriate security controls. Integration of security best practices like ISO/IEC 27001 into service management best practices processes like ITIL enables the organization to lower the overall cost of maintaining acceptable security levels, effectively manage risks and reduce overall risk levels. ITIL provides a framework of best practice guidances for information technology service management. ISO/IEC 27001 is a set of guidelines, which can be used by an organization to design, deploy and maintain information security management system. From an ITIL perspective, most of the security controls identified in ISO/IEC 27001 are already part of service management. This paper describes mapping of ITIL service management processes to controls of ISO/IEC 27001.

——————————————————————————————————————————————————————————————————–

Development of an Ontology to Assist the Modeling of an Accident Scenario: Application on Railroad Transport [ Full-Text ]
Ahmed Maalel, Habib Hadj Mabrouk, Lassad Mejri and Henda Hajjami Ben Ghezela

In a world where communication and information sharing are at the heart of our business, the terminology needs are most pressing. It has become imperative to identify the terms used and defined in a consensual and coherent way while preserving linguistic diversity.  To streamline and strengthen the process of acquisition, representation and exploitation of a scenario of train accidents, it is necessary to harmonize and standardize the terminology used by players in the security field. The research aims to significantly improve analytical activities and operations of the various safety studies, by tracking the error in system, hardware, software and human. This paper presents the contribution of ontology to modeling scenario for rail accidents through a knowledge model based on a generic ontology and domain ontology. After a detailed presentation of the state of the art material, this article presents the first results of the developed model.

——————————————————————————————————————————————————————————————————–

Home Automation Disaster Management System via SMS and GSM [ Full-Text ]
Nadia Shaheen, Aihab Khan, Malik Sikander Hayat Khiyal  and Qaiser Javed

The paper presents working of disaster management system and realizes the monitoring of home security systems such as fire, gas leakage, smoke, electric short circuit.The system is implemented connecting Global system for mobile communication (GSM) modem with personal computer (PC) through serial cable via Attention (AT) commands set. The proposed system is intended to measure or sense the threshold value of different parameters like pressure or temperature level and sends it to preconfigured cell number via GSM modem. The main purpose of the paper is to design a cost effective, cheap and secure system which sends an alert Short Message Service (SMS) when the value of pressure or temperature level exceeds the limit. Most commonly used tools such as cellular phones and wireless GSM modem have become very effective techniques and can be opted more efficiently for controlling the above mentioned situations remotely independent of geographical locations. The main focus is to send SMS to preconfigured cell number and triggering an alarm whenever an alarming situation is occurred.  The user can in turn respond to the event by sending command to overcome the situation. It is concluded that the proposed technique results in safer syatem and it strengthens the security concerns of home by proposing a cost effective solution.

——————————————————————————————————————————————————————————————————–

Impact of Facebook on Social Network Security [ Full-Text ]
Pradeep Kumar Puram and Aditya Krishna Haas Rayaprolu

Facebook has become an important part of the average netizen’s daily routine. In fact is is now deeply knit within the social fabric of our society. This applies to almost all the countries acorss the world, in which Facebook has made its presence felt. This paper attempts to examine some of the risks assoiciated with Facebook and how it impacts the concept of social network security. The paper gives an overview about the policies of Facebook and how they are affecting the usage of the website by millions of people around the world. The paper also attempts to take a glimpse into the future of the social  networking behemoth and how it would impact the social scene.

——————————————————————————————————————————————————————————————————–

Techno-Evaluation and Empirical Study of Virtual Private Networks Using Simulation [ Full-Text ]
Rahul Malhotra and Rajneesh Narula

A virtual-private network is a computer network is a computer network that uses public telecommunication infrastructure such as internet to provide secure internet access to remote offices or individual users. The aim of using virtual private networks is to avoid an expensive system of owned or leased lines. It encapsulates encrypted data transfer between two or more networked devices which are on same private network using ISDN/PSTN. Routing is the main technical issue performed by tunneling protocols. Virtual Private Networks are configured at routers and permit safe communication through an unsafe environment. Virtual Private Network creates a tunnel, a logical group of routers to provide a safe path to data to reach the destination. A tunnel provides private traffic to be sent through public path. IT Guru Network Planner OPNET accelerates Virtual Private Network deployments and ensures optimal performance of Virtual Private Network based applications.

——————————————————————————————————————————————————————————————————–

A Comparison of Lightweight Databases in Mobile Systems [ Full-Text ]
F. Tavakkoli, A. Andalib, A. Shahbahrami and R. Ebrahimi Atani

This paper tries to investigate some DBMS that are specially designed or optimized for mobile systems. This investigation emphasizes on some fundamental factors that in fact are the most significant features and parameters of DBMSs. First, it describes the necessity of applying LightWeight DBMS , which are briefly called LW in this paper. Then, it introduces each DBMS and explains its characteristics and finally, presents a general comparison by a table. It should be mentioned, that according to the variety of DBMSs and fast increased popularity and attraction of the Open Source, this paper studies in this scope in order to demonstrate a palpable comparison.

——————————————————————————————————————————————————————————————————–

Designing Passive Filters for Harmonic Reduction in a Noisy System Based on Wavelet Transform Compared to Traditional Method [ Full-Text ]
Hamid Rahimi Esfahani and Farshad Kiyoumarsi

In this paper, among different methods of signal processing, wavelet transform is chosen due to its advantages over other methods. To show wavelet transform capabilities, first an HVDC system which has noise on its output current is simulated. In the first step noise is removed by applying discrete wavelet transform. In the next steps, harmonic problem is resolved thorough appropriate passive filters. In this paper, we suppose that  not only low order harmonics exist in the output current, but also high order ones. The results indicate that we can obtain a good passive filter design for harmonic reduction by decomposing a signal into its harmonic components via applying discrete wavelet transform. For more confirmation of this method, the scalogram of wavelet coefficients is presented. At the end, to compare this method with traditional one, the figures of traditional method for passive filter designing is presented.

——————————————————————————————————————————————————————————————————–

A Novel Task Allocation Technique, Based on Developer’s Expertise [ Full-Text ]
Junaid Tariq and Saif-ur-Rehman Khan

No matter what type of product you are developing, it may be decomposed into many small manageable pieces know as tasks in computer science field. However the management of these large numbers of tasks is very critical and complex, which if not managed properly, will delay the overall project. Ultimately it may exceed the planned project cost. Similarly task allocation is another crucial challenge that may divert your project from success to failure if not handled carefully and wisely. In this paper, we present an efficient way to manage tasks and their allocation based on the available expertise known as task-to-developer (TTD) mapping. The case study result shows significant reduction in task management.