As data transmission speeds over the Internet continue to increase, it is necessary to research and identify technologies that can take advantage of the increased speeds by enhancing the loading speed of web pages. One area of consideration is found in the type of framework that is utilized for a website. There are numerous frameworks that can be chosen from to be used to support a website, each with their distinctive advantages. There are many differing opinions that have been proffered on which framework should be used to fully realize the optimization of page load speed. This manuscript examines and implements testing methods for two popular frameworks, ASP.net and PHP, to make a final determination of which framework is most beneficial for webpage load speeds.
This paper presents a new improved particle swarm optimization (PSO) algorithm based technique for solving the unit commitment and economic dispatch problem. The economic dispatch problem is solved by various traditional and non traditional techniques. The proposed algorithm is much simpler and efficient than traditional methods and is used to solve sample systems consisting up to 10 units and the results obtained are compared with Genetic Algorithm method in terms of quality of solution and computational efficiency and the convergence performance is presented. Particle swarm optimization (PSO) is a population based stochastic optimization technique which can be applied for almost all non-linear complex optimization in power system. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zone, and non-smooth cost functions are considered using the proposed method in practical generator operation. It was inspired by the social behavior of organism such as bird flocking and fish schooling and it utilizes a population based search procedure. According to the research results, birds find food by flocking. This assumption is a basic concept of PSO. In PSO each solution is a particle in search space. Each particle adjusts its flying speed according to its own flying experience and its companion’s flying experience. All the particles have fitness values, which are evaluated by the fitness function to be optimized and have velocity, which direct the flying of particles. So initialized with a group of random particles search for optima by updating generations. Improved unit commitment schedules may save the electrical utilities of crores of rupees per year in production cost. To illustrate the proposed approach, 10-unit system is considered and results are compared with Genetic Algorithm.
The objective of the proposed system is designed to perform mobile banking in a secured way. To achieve this, the concept of Biometric person recognition method is introduced through the mobile devices. Biometrics can be categorized into two categories, they are Physiological and Behavioral. Physiological is based upon the direct measurements of a part of the human body and Behavioral is based on the action performed by the user. So, I decided to use the face recognition method, which is purely based on the physiological characteristic of the human body. The Face recognition technique implementation is done with the two existing algorithms (i.e) Viola Jones and Principle Component Analysis(PCA).The Viola Jones method is mainly used to check whether the image is present in the frame or not. The PCA method is based on Eigen values and Eigen vectors and performs distance calculation based on features of the face. With this proposed idea, secured access to restricted data/services during a standard Web Session is possible with the small handheld devices. For the image capturing and forwarding process the Android mobile is used.
In recent years, the use of sensors to measure the biometrics and movements of human body has resulted in the design of wireless body area networks (WBANs). These consist of small, intelligent devices attached on or implanted in the body .The development of such networks is imperative for modern telemedicine and m-health. However, security remains a formidable challenge yet to be dealt with. WBANs have the advantage of the possibility of using random biometric measurements that use an intrinsic characteristic of the human body as the authentication identity or the means of securing the distribution of cipher keys.In this paper, the authors will begin by surveying the most recent research directions in the field. Then, a distributed key management scheme, which makes use of key refreshment schedules, will be proposed to fairly and securely distibute key management responsibility among all nodes. Our scheme supports the use of biometric measurements to generate symmetric keys in WBANs scenario.
One of the problems faced frequently by users in Video-on-Demand (VoD) streaming, is a long waiting time for multimedia streaming. In Existing System, a network coding equivalent content distribution (NCECD) scheme [Yung-Cheng Kao, Chung-Nan Lee, Peng-Jung and Hui-Hsiang Kao,2012] is used to handle interactive video-on-demand (VoD) operations in peer-to-peer systems. Using NCECD, videos are divided into equal sized segments that are then further divided into blocks. These blocks are encoded into independent blocks that are distributed to different peers for local storage. By this, a new client only needs to connect to a sufficient number of parent peers and able to view the whole video, and rarely needs to find new parents when performing random access operations.The proposed work focuses on Fibonacci Based Content Distribution (FBCD) scheme to efficiently handle interactive VoD operations in distributed systems. In FBCD, videos are divided into n number of variable size chunks. The chunk size is progressively increased to reduce delay improve performance and reduce the loading time. Since the video data is divided into chunks and stored at peers’ local storage in a distributed manner, a peer can discover and access a neighbour quickly through the middleware. The streaming processes are handled by the middleware system. The middleware will monitor all the distribution server loads and client request. This may not allow direct communication between Client and Server and Server offline problem is also managed. The proposed scheme achieves low start-up and jump searching delays and requires fewer server resources.
