Object plays a very important role in comparing software entities. But the role of object when it comes to simulation field is still undefined. Several standards have been created with the purpose to provide a design solution for the project of Simulators. The design solution reported in this paper aggregates the principles of both software and simulator architectures. The objective is to invert the top-down strategy of model-driven development with the Simulation Model Portability (SMP) standard into a bottom-up development process of a SMP framework. The paper also provides solution for two development lines of two different frameworks: the first is the SMP framework that changes according to the design models, and the second is an framework designed ton support the development of reusable behavior implementations.
Keywords- simulation mode portability (SMP); simulators; object oriented methodology; man-Machine Interface; model-Driven Architecture

In this paper, we propose a new hybrid routing protocol for MANET called Location Aided Hybrid Routing Protocol for MANET (LAHRP). The proposed routing algorithm not only aims to optimize bandwidth usage of MANETs by reducing the routing overload but also extend battery life of the mobile devices by reducing the required number of operations for route determination. Although in the LAHRP, some features of both table- driven and on-demand algorithms were used to achieve these goals at some stages, LAHRP algorithm is a completely different approach in terms of position information usage and GPS. Simulation results are used to draw conclusions regarding to the proposed routing algorithm and compared it with the standard DSR protocol. Conducted experiments showed that our proposed algorithm exhibits superior performance with respect to reactive DSR routing algorithm in terms of normalized routing load, packet delivery ratio and end-to-end packet delay.
Keywords: MANET, DSR, Routing load, Packet delivery ratio, New routing protocol for MANET.

Clustering is a web mining technique, which is a demanding field of research in which its latent applications create their own special requirements. Clustering is a method of grouping similar data into data sets, called clusters. Cluster analysis is a primary technique in conventional data analysis and many clustering methods have been recognized which requires number of clusters to be precise in advance and is dependent on initial starting points. In this paper, we present a new algorithm to discover data clusters for numerical and nominal data. Apriori algorithm generates large number of candidate set that is not efficient for both data.
Keywords- Web Mining, Clustering, Decision Tree, Apriori algorithm

Most of the embedded systems have real-time requirements about the use of Real-Time Operating Systems able of satisfying the embedded system requirements. So, in embedded application where the real-time operating systems are noted are been called as the Real Time Embedded Operating Systems (REOS). Main features of that of real-time systems would be discussed with this paper. To get a big picture we basically take a look at many structures and standards of REOS. Then, issues and techniques for different key topics which are been scheduling, synchronization, and memory management are been discussed. In this paper we are presenting the new way to tackle the problem with the resource reservation abstraction and an appropriate model for schedulability analysis. In this work, the architecture for a runtime CPU scheduler customization framework for the Linux kernel that take into account different applications requirements is presented.
Index Terms— Runtime Scheduling Policies; CPU scheduler customization;

Spatiotemporal applications are widely used in the research area. The Spatiotemporal access methods are secret into four categories. The BBx-index Structure algorithm is fourth category of Spatiotemporal access method. The new algorithm is proposed for past, present and future detection of moving objects. In this proposed algorithm contains tree construction, object insertion, updation and migration. Multidimensional object data is converted to single dimensional data using Hilbert curve. This paper precisely focuses on to reduce the migration process done by the existing BBx index method and minimized time complexity. The speed detection is also one of the important parts in the future detection which can be achieved by calculating the object transfer speed.
Keywords: BBx index, Moving Objects and Hilbert Curve

Wireless designers constantly seek to improve the spectrum efficiency/capacity, coverage of wireless networks, and link reliability. Space-time wireless technology that uses multiple antennas along with appropriate signalling and receiver techniques offers a powerful tool for improving wireless performance Space-time block codes were designed to achieve the maximum diversity order for the given number of transmit and receive antennas subject to the constraint of having a simple linear decoding algorithm. This has made space-time block codes a very poplar scheme and most widely used. In this work we discuss coded modulation schemes designed for multiple antennas wireless channels without information of the channel at the transmitter. We focus on orthogonal space-time block codes and explain the benefits and limitations
Keywords Multiple Input Multiple Output (MIMO),Orthoganal Space Time Block Coding, Multipath fading,) Orthogonal Frequency Division Multiplexing (OFDM)

Model transformation is one of the main issues and key elements in Model Driven Architecture (MDA). Computation Independent Model (CIM) to Platform Independent Model (PIM) transformation is the first transformation in MDA and it is very important in designing high quality software. Several CIM to PIM transformation approaches have emerged, they have not been objectively analysed yet. In this paper, we provide a review of several CIM to PIM transformation approaches, and present a criteria-based evaluation. The results can be used for assessing and comparing CIM to PIM transformation approaches.
Keywords: MDA; CIM; PIM; Transformation; Evaluation Criteria.

A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either each of them obtains the other’s signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property— abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract signing protocol based on the RSA signature, and show that it is both secure and efficient. Keywords—Contract signing, cryptographic protocols, digital signatures, e-commerce, fair-exchange, RSA, security

Mobile ad hoc networks (MANETs) are autonomously self-organized networks without infrastructure support. In a mobile ad hoc network, nodes move arbitrarily; therefore the network may experience rapid and unpredictable topology changes. Because nodes in a MANET normally have limited transmission ranges, some nodes cannot communicate directly with each other. Hence, routing paths in mobile ad hoc networks potentially contain multiple hops, and every node in mobile ad hoc networks has the responsibility to act as a router. A new routing algorithm called position based hybrid routing algorithm (PBHRA) was developed to optimize bandwidth usage of ad hoc networks. The main goal of PBHRA is effective use of bandwidth by reducing the routing overload. Additionally, the other goals of the algorithm are to extend battery life and signal strength or power level of the mobile devices by reducing the required number of operations for route determination and to reduce the amount of memory used. Although in the PBHRA, some features of both table driven and on-demand algorithms were used to achieve these goals at some stages, PBHRA algorithm is a completely different approach in terms of position information usage and global positioning system (GPS).
Key words: Hybrid routing, Extended battery life, Signal strength, Power level, global positioning system.

Wireless sensor networks (WSN) can be used to monitor our environment, objects in that environment and interactions of objects with each other. Use of WSN for emergency applications includes fire detection system in forest, soil motion detection, monitoring historical and public places, volcano monitoring etc. In WSN errors or faults tends to occur frequently due to node mobility or energy shortage (battery limitation). Faults cannot be tolerated in WSN for emergency applications hence fault tolerance is an important issue in network design and thus networks have to be tolerant of error and fault. This paper deals with a Reliable Communication Protocol (RCP) that will be fault tolerant and minimize both signaling overhead and power consumption and also support auto-recovery from failure

In this paper, a method for gait recognition using DCT, Radon Transform (RT) and 2DPCA is proposed. DCT is used to extract the features of an image with reduced redundancy. RT is used to extract the features of the DCT transformed image, since RT provides information in polar coordinates. Then 2DPCA is applied on the DCT and Radon Transformed images to reduce the dimensionality. The obtained features are used to recognise the gait sequences by considering standard CBSR database. It is observed from the simulation results that the recognition rate is higher

Object detection is a fundamental problem in computer vision. For such applications as image indexing, simply knowing the presence or absence of an object is useful. Detection of faces, in particular, is a critical part of face recognition and, and critical for systems which interact with users visually. In this paper we are giving neural network based approach for face detection.
Key Word: Feature Based, YCbCr, Backpropogation

In current scenario of fast changing data content in most dynamic heterogeneous application, data format transformation and data updates needs to be handled in traditional data ware housing. Many researches have been made under active data warehousing which keep the latest updates of more dynamic large multi-format data warehouses. Previous work presented a mesh join operation algorithm a frequently encountered operation which join a fast stream of source updates with a disk-based relation under the constraint of limited memory. The access cost of two join inputs is done by relying on fast sequential scans of disk-based relation and shared I/O cost of accessing disk based relation across multiple tuples of source stream updates. Since the source streams receives. It develop a systematic cost enabled tuning of MESHJOIN for maximizing throughput under a specific memory budget, or minimizing memory consumption for a specific throughput. Since source streams have more number of relations in different directions, the previous work does not support multi-way joins. To overcome the issues obtained from the previous work, here we are going to present a new technique optimization scheme for multiple relations of joins being generated by streams from different direction in active data warehousing retrieval of data based on multiple queries. Here, multiple on-line aggregations play a major role in the efficient and more precise user query data extraction. It evolves an optimization technique to have a more cohesive multi-relation joins of the stream tuples. Experimental simulations are carried out to evaluate the performance of proposed optimization technique with both synthetic and real data sets in terms of Execution time, and operational overhead being used to get optimal threshold for multi-relational joins generation.
Keywords: Active Data Warehousing, Optimization scheme, Multi-join operation

In the field of business, the owner having some crucial data may need to share it with third-parties. These trusted third-parties may use this data for their own benefit causing reputational and monetary damage to the owner’s company. If some of the shared data is discovered at some illegal place, it is quite possible that one or more third party agent is responsible for such information leakage.The owner must identify the leakage at the earliest and possibly the source of leakage. This paper presents two methods to handle such information leakage namely watermarking and Identifying Guilty agent using probability.
Keywords- Watermarking, Fake records, Guilty agent, Leaked dataset, sensitive data, Probability of guilty agent ,Allocation strategies, data privacy, leakage model.

Future Intelligent Transportation Systems require fast and reliable communication between cars (vehicle-to-vehicle V2V) or between a car and a road side unit (vehicle-to-infrastructure). The fundamental component for the success of Vehicular Ad-hoc Networks (VANET) applications is routing. In this paper we propose a VANET routing protocol that is especially designed for city environments. This protocol is based on the localization of the node, the cost assigned to the section and score for each vehicle. We present in this paper a detailed description for the proposed protocol compared to GyTAR protocols. Knowing that the GyTAR protocol is performing than the GSR and LARprotocols as demonstrated in [1]
Keywords: VANET, routing, Dijkstra, urban environment, Delivery Ratio, end to end delay

Hindi parser is a tool which takes Hindi sentence and verifies whether or not given Hindi sentence is correct according to Hindi language grammar. Parsing is important for Natural Language Processing tools. Hindi parser uses the CKY (Coke- Kasami-Younger) parsing algorithm for Parsing of Hindi language. It parses whole sentence and generate a matrix.
Keywords: Parser, CKY, Compiler, Context free grammar

Education system in India has been changing widely in last 10 years due to the development of the technology. Smart class, E-learning, Video conferencing are some of them. The core idea of this paper is to implement some of the emerging technologies like mobile computing and near field communications and advances in behavioral science studies to make a better educational system. This paper will be implemented in application as two parts. A secure framework for implementing different educational service mobile applications like, mobile attendance, mobile curriculum, mobile marks register etc. The second part will leverage Near Field Communication technologies and gamification behavior approach to incorporate game mechanics into activity oriented learning systems. Gamification works by making technology more engaging, and by encouraging desired behaviors, taking advantage of humans' psychological predisposition to engage in gaming.
Keywords- Android; NFC; Mobile Computing; Andoid SDK; Education Tool.

The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods of computing voxels for 2-D images captured have proven to be a strong alternative to traditional correspondence-based methods due to their flexible visibility models. Whenever any 2-D image is used to reconstruct a volume based object (voxels), the edges in the images make color consistency check fail in order to determine which voxel should be carved and which should not. This inability to detect the color variance along the edges is faced by majority of the models proposed prior. Our approach comprises additional check by evaluating the edge pixels and avoiding carving of the voxel. Moreover performing visibility check through GVC-LDI ensures a better quality of reconstruction.
Keywords-reconstruction, voxels, consistency, GVC-LDI