3197098
A Multi-Objective Hw-sw Co-Synthesis Algorithm Based on Quantum-Inspired Evolutionary Algorithm
Hardware–Software (HW–SW) co-synthesis is one of the key steps in modern embedded system design. Generally, HW–SW co-synthesis is to optimally allocate processors, assign tasks to processors, and schedule the processing of tasks to achieve a good balance among performance, cost, power consumption, etc. Hence, it is a typical multi-objective optimization problem. In this paper, a new multi-objective HW–SW co-synthesis algorithm based on the quantum-inspired evolutionary algorithm (MQEAC) is proposed. MQEAC utilizes multiple quantum probability amplitude vectors to model the promising areas of solution space. Meanwhile, this paper presents a new crossover operator to accelerate the convergence to the Pareto front and introduces a PE slot-filling strategy to improve the efficiency of scheduling. Experimental results show that the proposed algorithm can solve the typical multi-objective co-synthesis problems effectively and efficiently.
29843270
A Self-adaptive Mixed Distribution Based Uni-variate Estimation of Distribution Algorithm for Large Scale Global Optimization
Large scale global optimization (LSGO), which is highly needed for many scientific and engineering applications, is a very important and very difficult task in optimization domain. Various algorithms have been proposed to tackle this challenging problem, but the use of estimation of distribution algorithms (EDAs) to it is rare. This chapter aims at investigating the behavior and performances of uni-variate EDAs mixed with different kernel probability densities via fitness landscape analysis. Based on the analysis, a self-adaptive uni-variate EDA with mixed kernels (MUEDA) is proposed. To assess the effectiveness and efficiency of MUEDA, function optimization tasks with dimension scaling from 30 to 1500 are adopted. Compared to the recently published LSGO algorithms, MUEDA shows excellent convergence speed, final solution quality and dimensional scalability.
26519336
Iris Recognition Algorithm Using Modified Log-Gabor Filters
In this paper, we presented an iris recognition algorithm based on modified Log-Gabor filters. The algorithm is similar as the method proposed by Daugman in general procedure while modified Log-Gabor filters are adopted to extract the iris phase information instead of complex Gabor filters used in Daugman's method. The advantage of Log-Gabor filters over complex Gabor filters is the former are strictly bandpass filters and the latter are not. The property of strictly bandpass makes the Log-Gabor filters more suitable to extract the iris phase features regardless of the background brightness. The comparison experiments between complex Gabor filters based methods and the proposed method are also presented in this paper
13209883
An Approach for Dynamic Hardware /Software Partitioning Based on DPBIL
HW/SW partitioning is one of the key steps in high-level modeling of embedded system co-design. In some kinds of data-dependence applications, the partitioning environment is dynamic. An approach based on a kind of evolutionary algorithm called DPBIL is proposed for dynamic HW/SW partitioning problem. DPBIL is inspired by Dualism or complementarity in the nature and operates on a pair of dual probability vectors to adapt itself to the dynamic environment. We systematically constructed the system model, defined the dynamic environment and conducted experimental analysis via comparison with the existing method. To enhance the exploration performance of DPBIL, a threshold constraint mechanism is introduced. Experimental results indicated that our approach is feasible and efficient for dynamic HW/SW partitioning, and has much better performance than traditional ones.
7440868
Hybrid quantum probabilistic coding genetic algorithm for large scale hardware-software co-synthesis of embedded systems
Hardware-software co-synthesis is a key step of future design of embedded systems. It involves three interdependent subproblems: allocation of resources, assignment of tasks to resources, and scheduling the execution of tasks. Both assignment and scheduling are known to be NP-complete. So it is a really hard and challenging task to optimization algorithms. Both heuristic and evolutionary algorithms are commonly used in real world. Heuristic algorithms converge rapidly but often be trapped in local minima and evolutionary algorithms own high exploration capacity but become time-consuming when handling large-scale systems. In this paper, a new hybrid evolutionary algorithm, called Hybrid Quantum probabilistic coding Genetic Algorithm, is proposed to implement the co-synthesis of large scale multiprocessor embedded systems, in which a heuristic algorithm is combined with the Quantum probabilistic coding Genetic Algorithm to enhance the performance on the hard task. The experimental results show that HQGA has better performance than both HA and QGA on large scale HW/SW co-synthesis problems.
6506776
A set theoretical method for video synopsis
A synopsis video presents a condensed video activities occurring during different periods, based on moving objects extracted in the spatial-temporal domain. How to place different object tubes with least collision in limited video length is crucial to synopsis performance but has not been thoroughly studied in previous work.
 In this paper, we address an important problem in video synopsis, that of object start-time programming. We formulate the problem in terms of set theory. An objective is derived to maximize visual information in video synopsis. After relaxing the problem to obtain a continuous one, the problem can be efficiently solved via mean-shift. The resulting algorithm can converge to the local optimum within a few iterations.
17891437
Call admission control for voice/data integrated cellular networks: performance analysis and comparative study
In this paper, we propose a new call admission control scheme called dual threshold bandwidth reservation, or DTBR scheme. The main novelty is that it builds upon a complete sharing approach, in which the channels in each cell are shared among the different traffic types and multiple thresholds are used to meet the specific quality-of-service (QoS) requirements. We present a detailed comparative study based on mathematical and simulation models, and quantitatively demonstrate that the DTBR is capable of providing the QoS guarantee for each type of traffic, while at the same time leading to much better channel efficiency. We further show that the DTBR scheme with elastic data service can offer both service guarantee and service differentiation for voice and data services, and enhance the bandwidth utilization.
20301405
Unequal-arm Adaptive Rood Pattern Search with Early Terminations For Fast Block-matching Motion Estimation on H.264
Based on a rood-shaped pattern of the motion-vector displacement distribution inherently resulted from block-matching motion estimation, a series of adaptive rood pattern search (ARPS) algorithms have been introduced. Among them, the unequal-arm ARPS has achieved superior performance on many accounts while maintaining a fairly close rate-distortion performance compared with that of the full search. In this paper, an enhanced version of the unequal-arm ARPS is introduced by incorporating early terminations at both the initial search and the refined local search stages. Its performance was compared with that of the UMHexagonS fast block-matching motion estimation algorithm based on the JM-9.3 software encoder. The experimental results show that the unequal-arm ARPS with early terminations has yielded significant search efficiency gain while consistently maintaining a fairly close rate-distortion performance compared with that of the UMHexagonS. Furthermore, the proposed algorithm is fairly simple on implementation
13969356
Risk Informed Computer Economics
Grid computing continues to hold promise for the high-availability of a wide range of computational systems and techniques. It is suggested that Grids will attain greater acceptance by a larger audience of commercial end-users if binding Service Level Agreements (SLAs) are provided. We discuss Grid commoditization, the use of Grid technologies for financial risk analysis, and the potential formulation of the Grid Economy. Our aim is to predict availability and capability for risk analysis in and of Grids. The considerations involved may be more widely applicable to the configuration and management of related architectures including those of P2P systems and Clouds. In this paper, we explore and evaluate some of the factors involved in the automatic construction of SLAs for the Grid Economy.
6449965
Development of a snake-like robot adapting to the ground
Biological snakes' diverse locomotion modes and physiology make them supremely adapted for the ground. This paper discusses the biological snakes' locomotion mode on the diverse ground, and describes the development of a snake-like robot with the adaptability for the ground. The method to realize some locomotion modes is given. The method for detecting the characteristic of ground is proposed and identified in test.
12108467
Tracking Anomalous Behaviors of Name Servers by Mining DNS Traffic
This paper seeks to quantitatively understand the nature of the current threat towards the common name servers. A new tracking technique based on statistical model is proposed to locate the anomalous name servers by analyzing the real-world DNS traffic. After summarizing the attacks towards DNS, the detection method based on associative feature analysis is presented. Experiments are conducted which highlighting both the payload anomaly and the data flow anomaly, and the experimental results reveal the efficiency of our method in detecting the anomalous behaviors of name servers.