A Novel Algorithm for Efficient Channel Estimation using MMSE-Kalman Estimator and Median Filtering

Wireless communication is a emerging field of evolution in modern era of technology, and every day it is giving new technology to facilitate human being. The new facilities always need a QoS i.e. directly user satisfaction. For satisfaction of wireless users is to give efficient and reliable technology, so that sharing of information is made easier. In the same context the channel of wireless communication system need extra attention for efficient delivery of information from one place to another wirelessly. In this paper we are trying to estimate the channel using MMSE-Kalman Estimator in OFDM system with median filtering to enhance the performance of the system. The proposed methodology is implemented and figure of merits are calculated as BER and MSE, and we have found that the use of median filter with MMSE-Kalman estimator is good. Keyword MMSE, Kalman Estimator, Median Filter, BER and MSE

ODSRP-LET: On-Demand Secure Routing Protocol based on Link Expiration Time

Context Aware Dynamic Traffic Signal Optimization

Conventional urban traffic control systems have been based on historicaltraffic data. Later advancements made use of detectors, which enabled thegathering of real time traffic data, in order to reorganize and calibratetraffic signalization programs. Further evolvement provided the ability toforecast traffic conditions, in order to develop traffic signalization programsand strategies precomputed and applied at the most appropriate time frame forthe optimal control of the current traffic conditions. We, propose the nextgeneration of traffic control systems based on principles of ArtificialIntelligence and Context Awareness. Most of the existing algorithms use averagewaiting time or length of the queue to assess an algorithms performance.However, a low average waiting time may come at the cost of delaying othervehicles indefinitely. In our algorithm, besides the vehicle queue, we usefairness also as an important performance metric to assess an algorithmsperformance.

Implementation of E-Demand Draft

demand draft is an online Demand Draft generating application. E-demand draft is an application which will help us to generate a demand draft online by the user itself. Thus this application will reduce the work of the banks and will help the customer to get a new facility at their place as result both can reduce their time of work. For each sub-task some classical and updated methods in literatures are analyzed. Based on the study, an combined solution for implementation of E-demand draft developed for demonstration. Demonstration program is coded in .NET. For the program, some optimization at coding level and existing system level are proposed to improve the performance of online Demand Draft system. This system is shown by generating Demand Draft sitting at home and taking print out of the generated Demand Draft on stamped sheet provided by the bank.

Determining the Adulteration of Diesel by an Optical Method

Optimization of Fragment based Mining through Genetic Algorithm

approach stated in this paper mainly focuses on generating optimized rules in fragment based association mining using genetic algorithm. we call this approach as Genetic based Fragment Rule Mining. we designed a novel method for generation of optimized rule. In which a Fragment mining is used to generate the rules on which we use the optimization mechanism. This deals mainly with reducing the time and space complexity required in processing the data using fragment mining & generate strong rules using genetic algorithm. The results reported in this paper are very promising since the discovered rules are of optimized rules. KeywordsRule, Fragment Mining ,Stock Data , Genetic Algorithm.

An Efficient Technique for Data Hiding with use of QR Codes-Overcoming the Pros and Cons of Cryptography and Steganography to Keep the Hidden Data Secretive

Improving Security of Vigenère Cipher by Double Columnar Transposition

Protecting data from malicious attacks during storage and transmission is the reason for using encryption. Encryption can be achieved by two methods – Transposition and Substitution. Transposition refers to changing the order of characters in a given text. On the other hand, substitution is the process of replacing each character of the plaintext with some other character. Using a combination of transposition and substitution for encryption leads to greater security when compared to using either of them separately. Vigenere Cipher is a poly-alphabetic cipher. It is based on the substitution technique which uses multiple substitution alphabets. In this paper, we introduce double columnar transposition on Vigenere Cipher to enhance its security making cryptanalysis difficult.

A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations

The Diophantine equations define an algebraic curve or an algebraic surface and ask about lattice points on it. A Diophantine equation may either possess no non trivial solution or finite number of solutions or infinite number of solutions. Therefore, computing lattice points is difficult in general for Diophantine equations of order greater than one. This ambiguity regarding the solutions of a Diophantine equation is another source for trapdoor functions in Public key cryptography. In this paper we analyze the potentiality of Diophantine equations in the key exchange cryptosystem and propose a method for recovering a key in the key exchange cryptosystem by Diophantine equations.

Nature-Inspired Algorithms: State-of-Art, Problems and Prospects