130 research outputs found
Identification of Continuous-Time Systems with Time Delays by Global Optimization Algorithms and Ant Colony Optimization
Optimization of Iris Codes for Improved Recognition
The texture of the iris is commonly represented as an iris code in iris recognition systems. While several approaches have been presented for generating iris codes, relatively few comparison techniques have been proposed. In this paper, we take advantage of the availability of several frames from an iris video to create a single optimized iris code. This is achieved by performing both row-wise and column-wise optimization of iris codes. Inconsistent bits are accurately detected and masked in the final iris code. Our experiments demonstrate that by exploiting variations within the com-parison scores of different rows and columns of N frames, we are able to derive the number of consistent bits in the fi-nal iris code thereby resulting in significant improvement in recognition performance. We compare our algorithm with well-known methods, namely, Fragile bit masking, Signal fusion and, two Score Fusion techniques. Experimental re-sults on a dataset of 986 iris videos show that the proposed method is encouraging and comparable to the best algo-rithms in the current literature. To our knowledge, this is the first work that makes use of the best rows and columns from different frames in an iris video to improve performance. 1
Exploiting user provided information in dynamic consolidation of virtual machines to minimize energy consumption of cloud data centers
Dynamic consolidation of Virtual Machines (VMs) can effectively enhance the resource utilization and energy-efficiency of the Cloud Data Centers (CDC). Existing research on Cloud resource reservation and scheduling signify that Cloud Service Users (CSUs) can play a crucial role in improving the resource utilization by providing valuable information to Cloud service providers. However, utilization of CSUs' provided information in minimization of energy consumption of CDC is a novel research direction. The challenges herein are twofold. First, finding the right benign information to be received from a CSU which can complement the energy-efficiency of CDC. Second, smart application of such information to significantly reduce the energy consumption of CDC. To address those research challenges, we have proposed a novel heuristic Dynamic VM Consolidation algorithm, RTDVMC, which minimizes the energy consumption of CDC through exploiting CSU provided information. Our research exemplifies the fact that if VMs are dynamically consolidated based on the time when a VM can be removed from CDC-a useful information to be received from respective CSU, then more physical machines can be turned into sleep state, yielding lower energy consumption. We have simulated the performance of RTDVMC with real Cloud workload traces originated from more than 800 PlanetLab VMs. The empirical figures affirm the superiority of RTDVMC over existing prominent Static and Adaptive Threshold based DVMC algorithms
Stability Analysis of the Bat Algorithm Described as a Stochastic Discrete-Time State-Space System
The main problem with the soft-computing algorithms is a determination of their parameters. The tuning rules are very general and need experiments during a trial and error method. The equations describing the bat algorithm have the form of difference equations, and the algorithm can be treated as a stochastic discrete-time system. The behaviour of this system depends on its dynamic and preservation stability conditions. The paper presents the stability analysis of the bat algorithm described as a stochastic discrete-time state-space system. The observability and controllability analyses were made in order to verify the correctness of the model describing the dynamic of BA. Sufficient conditions for stability are derived based on the Lyapunov stability theory. They indicate the recommended areas of the location of the parameters. The analysis of the position of eigenvalues of the state matrix shows how the different values of parameters affect the behaviour of the algorithm. They indicate the recommended area of the location of the parameters. Simulation results confirm the theory-based analysis
- …
