Improvised Round Robin (CPU) Scheduling Algorithm
Generation of String Test Input from Web using Regular Expression
To generate realistic test data is a challenging for software testers. Realistic test data generation for certain input type is hard to automate and therefore laborious. So in this paper, string inputs will be used from the internet by performing web queries based on the key identifiers appearing in the source code of the program under test. The resultant URLs will be generated, tokenised and the collected regular expressions are matched with the text and get valid string values. General Terms Software testing, Web query, Web pages
Performance Evaluation of Min-Min and Max-Min Algorithms for Job Scheduling in Federated Cloud
Cloud computing is a large-scale, economic driven, distributed computing paradigm where abstracted, virtualized, managed computing power, scalable, storage, platforms and services are delivered on demand to customers over internet. It refers to applications delivered as services through the internet and hardware and systems software at data centres providing such services. As Cloud computing is a major platform, it is important to understand its implications on customers’ applications or Cloud deployed systems. Hence, simulation tools are critical not only to evaluate Cloud’s performance but also to further develop Cloud computing. This study investigates the performance of min-min and minmax scheduling algorithms using CloudSim software.
Realization of Combinational Multiplier using Quantum Cellular Automata
Vehicles Anti-collision System
Quantitative Analysis on Robustness of FLD and PCA-based Face Recognition Algorithms
Principal Component Analysis (PCA) has emerged as a more efficient approach for extracting features for many pattern classification problems. It has been the standard approach to reduce the high-dimensional original pattern vector space into low-dimensional feature vector space, that removes some of the noisy directions. PCA is an unsupervised technique which does not include label information of the data. In addition to PCA, another method Fisher Linear Discriminant (FLD) analysis has been widely used. In this paper, we report experimental results to quantify the robustness of PCA and FLD methods for face recognition. The experimentation was performed based on different levels of additive noise and rotations in handling face recognition problem. FLD outperforms the traditional PCA on the basis of robustness.
Millimeter-Wave Mobile Communications Microstrip Antenna for 5G - A Future Antenna
In the present scenario, cellular service provider facing bandwidth shortage in conventional cellular system, and delivering high quality, low latency video and multimedia applications using 3G system which is on ground .The 4 Generation cellular networks are expected to be implemented in next few years. Here, we present the motivational approach for millimeter wave mobile communication antenna for nextgeneration microand Pico-cellular wireless Networks (5 generation). The Millimeter Wave mobile communication works on 28 GHz and 38GHz frequency by employing steerable directional antennas (high dimensional antenna array) at base stations and mobile devices [1]. This paper describes a future antenna for 5G mobile communication. This antenna consists of two rectangular patch elements using a single layer RT/Duroid 5880 substrate with transformer coupled impedance matching network, which provides high gain of 9.0583dB and efficiency 83.308%. This antenna has good performance in terms of antenna gain, directivity, return losses, VSWR, Characteristics impedance, Band width and efficiency at the centre frequency 38GHz.
An Efficient Clusterhead Election Algorithm for Mobile Ad-Hoc Network
Mobile ad hoc network, abbreviated as MANET, is flexible, self-configuring, wireless ad-hoc network. MANET do not require pre-existing or pre-defined infrastructure, instead it configures and creates a network dynamically. All available nodes (devices) in MANET act as routers and are allowed to move freely in any direction, even in and out of network. Communication in a network with such high levels of nodal mobility is complex and challenging. The paper proposes an efficient weighted cluster election algorithm (WCA) by leveraging most connected, least utilized node for cluster head election. A comparative study of the traditional weighted cluster algorithm (WCA) and the proposed weighted cluster algorithm (WCA) simulation results shown significant improvement in performance, scalability, stability and efficiency of the network.