The proceedings contain 3 papers. The topics discussed include: a new generation of task-parallel algorithms for matrix inversion in many-threaded CPUs;CompactNet: platform-aware automatic optimization for convolution...
ISBN:
(纸本)9781450383486
The proceedings contain 3 papers. The topics discussed include: a new generation of task-parallel algorithms for matrix inversion in many-threaded CPUs;CompactNet: platform-aware automatic optimization for convolutional neural networks;and porting and evaluation of a distributed task-driven stencil-based application.
This paper suggests a solution for the image segmentation (IS) problem with the multilevel thresholding based on one of the latest hybrid swarm computation optimizationalgorithms, particle swarms, and gravitational s...
详细信息
The proceedings contain 634 papers. The topics discussed include: a gait recognition method based on KFDA and SVM;a general QoS-aware service composition model for ubiquitous computing;a hybrid approach of path planni...
ISBN:
(纸本)9781424438945
The proceedings contain 634 papers. The topics discussed include: a gait recognition method based on KFDA and SVM;a general QoS-aware service composition model for ubiquitous computing;a hybrid approach of path planning for mobile robots based on the combination of ACO and APF algorithms;a hybrid genetic algorithm with hyper-mutation and elitist strategies for automated analog circuit design;a hybrid particle swarm optimization algorithm for multimodal function optimization;an algorithm of coalition structure generation with given required bound based on cardinality structure;an adaptive weighted support vector machine;an adaptive repulsive particle swarm optimization for make span and maximum lateness minimization in the permutation flowshop scheduling problem;and an adaptive clonal selection algorithm and its applications.
We propose a novel algorithmic framework for the asynchronous and distributed optimization of multi-agent systems. We consider the constrained minimization of a nonconvex and nonsmooth partially separable sum-utility ...
详细信息
ISBN:
(纸本)9781538612514
We propose a novel algorithmic framework for the asynchronous and distributed optimization of multi-agent systems. We consider the constrained minimization of a nonconvex and nonsmooth partially separable sum-utility function, i.e., the cost function of each agent depends on the optimization variables of that agent and of its neighbors. This partitioned setting arises in several applications of practical interest. The proposed algorithmic framework is distributed and asynchronous: i) agents update their variables at arbitrary times, without any coordination with the others;and ii) agents may use outdated information from their neighbors. Convergence to stationary solutions is proved, and theoretical complexity results are provided, showing nearly ideal linear speedup with respect to the number of agents, when the delays are not too large.
Since multi-core processors have become a primary trend in processor development, new scheduling algorithms are needed to minimize power consumption while achieving the desired timeliness guarantees for multi-core (an...
详细信息
ISBN:
(纸本)9780769545028
Since multi-core processors have become a primary trend in processor development, new scheduling algorithms are needed to minimize power consumption while achieving the desired timeliness guarantees for multi-core (and many-core) real-time embedded systems. Although various power/energy-efficient scheduling algorithms have recently been proposed, existing studies may have degraded run-time performance in terms of power/energy efficiency and real-time guarantees when applied to real-time embedded systems with uncertain execution times. In this paper, we propose a novel online solution that integrates core-level feedback control with processor-level optimization to minimize both the dynamic and leakage power consumption of a multi-core real-time embedded system. Our solution monitors the utilization of each CPU core in the system and dynamically responds to unpredictable execution time variations by conducting per-core voltage and frequency scaling. We then perform task consolidation on a longer timescale and shut down unused cores for maximized power savings. Both empirical results on a hardware multi-core testbed with well-known benchmarks and simulation results in many-core systems show that our solution provides the desired real-time guarantees while achieving more power savings than three state-of-the-art algorithms.
The present paper describes initial aspects of a framework for realization of n-D signal processing tasks under rigorous budgetary demands, as usually found in industrial applications. Besides design on the basis of a...
详细信息
ISBN:
(纸本)3981029984
The present paper describes initial aspects of a framework for realization of n-D signal processing tasks under rigorous budgetary demands, as usually found in industrial applications. Besides design on the basis of adequate guidelines, development of algorithms with respect to a dedicated hardware platform is an important means of optimization. An exemplary realization of a hand detection device is presented, which incorporates several efficient algorithms that are limited in accuracy but in combination lead to a robust hand detection algorithm. These basic processing blocks are mainly based on FPGA realizations of well known FIR filter structures in combination with convolution-like operations based on Boolean logic instead of complex arithmetic. One example for this class of algorithms is binary morphology, which can be realized in low-cost FPGAs for high data throughput of several Gpixel per second and with large operator masks, e.g. with 25x25 pixels in size.
To find MST (Minimum Spanning Trees) in complete graph is a classical problem in operation research having network design as an important application. It is possible to solve MST problem efficiently, but its Biobjecti...
详细信息
Location prediction has gained enormously in importance in the recent years. For this reason, there exists a great variety of research work carried out at both the academia and the industry. At the same time, there is...
详细信息
ISBN:
(纸本)9783030202576;9783030202569
Location prediction has gained enormously in importance in the recent years. For this reason, there exists a great variety of research work carried out at both the academia and the industry. At the same time, there is an increasing trend towards utilizing additional semantic information aiming at building more accurate algorithms. Existing location prediction approaches rely mostly on data-driven models, such as Hidden Markov Chains, Bayes Networks and Artificial Neural Networks (ANN), with the latter achieving usually the best results. Most ANN-based solutions apply Grid Parameter Search and Stochastic Gradient Descent for training their models, that is, for identifying the optimal structure and weights of the network. In this work, motivated by the promising results of genetic algorithms in optimizing neural networks in temporal sequence learning areas, such as the gene and the stock price index prediction, we propose and evaluate their use in optimizing our ANN-based semantic location prediction model. It can be shown that evolutionary algorithms can lead to a significant improvement with respect to its predictive performance, as well as to the time needed for the model's optimization.
The matching design problem of the ship-engine-propeller is a non-linear constrained multi-objective optimization problem which is performed based on multiple objectives,such as system efficiency and the life cycle co...
详细信息
暂无评论