We present a multistage model for allocation of financial resources to bond indices in different currencies. The model was tested on historical data of interest and exchange rates. We compare a two-stage and a three-s...
详细信息
We present a multistage model for allocation of financial resources to bond indices in different currencies. The model was tested on historical data of interest and exchange rates. We compare a two-stage and a three-stage stochastic programming model from a financial performance point of view. For solving two-stage and three-stage stochastic programs the interior point method (IPM) in the frame of the primal-dual path following formulation is used. An application of the Birge and Qi factorization to the IPM allows decomposition of large linear system to smaller blocks allowing thus to solve it in parallel. The parallel code is written in the Fortran programming language, using the message passing interface (MPI) for communication. Parallel and financial performance is illustrated on experiments executed on the IBM 1350 Linux cluster. (C) 2008 Elsevier B.V. All rights reserved.
Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). Traditional...
详细信息
ISBN:
(纸本)9781424418442
Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. Moreover, with QoS metrics consideration, the problem of computing optimal constrained multicast tree is known as NP-complete. In this paper, we propose a new QoS-aware Multicast Overlay Spanning Tree (QMOST) protocol to support multiple-metric routing criteria in mobile ad hoc networks. It computes low cost trees with multiple-metric bounded paths in polynomial time using an efficient source-based optimization heuristic. Unlike common multicast protocols where data packets are transmitted in a broadcast mode, in QMOST data packets are encapsulated in unicast packets before being forwarded to the overlay tunnels. Multicasting is achieved when each node forwards multicast packets to its successors in the overlay tree. QMOST must be used in conjunction with a unicast QoS link state protocol (QOLSR) and can be integrated in a QoS model. This later offers the needed service guarantee using distributed admission control to check if the multicast QoS flows are admissible, resource reservation mechanism and congestion control. Simulation results show that our QMOST protocol achieves better performance than the QOLSR protocol.
The proceedings contain 24 papers. The topics discussed include: CUDA-lite: reducing GPU programming complexity;MCUDA: an efficient implementation of CUDA kernels for multi-core CPUs;on the scalability of an automatic...
ISBN:
(纸本)3540897399
The proceedings contain 24 papers. The topics discussed include: CUDA-lite: reducing GPU programming complexity;MCUDA: an efficient implementation of CUDA kernels for multi-core CPUs;on the scalability of an automatically parallelized irregular application, statistically analyzing execution variance for soft real-time applications, minimum lock assignment: a method for exploiting concurrency among critical sections;set-congruence dynamic analysis for thread-level speculation (TLS);thread safety through partition and effect agreements;a fully parallel LISP2 compactor with preservation of the sliding properties;design for interoperability in STAPL: pMatrices and linear algebra algorithms;implementation of sensitivity analysis for automatic parallelization;just-in-time locality and percolation for optimizing irregular applications on a manycore architecture;and exploring the optimization space of dense linear algebra kernels.
This book constitutes the joint refereed proceedings of the 11th internationalworkshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2008 and the 12th internationalworkshop on Randomiza...
详细信息
ISBN:
(数字)9783540853633
ISBN:
(纸本)9783540853626
This book constitutes the joint refereed proceedings of the 11th internationalworkshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2008 and the 12th internationalworkshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.
This paper considers the problem of supporting and efficiently implementing fault-tolerance for tightly-coupled and pipelined applications, especially streaming applications, in a grid environment. We provide an alter...
详细信息
ISBN:
(纸本)9781424416936
This paper considers the problem of supporting and efficiently implementing fault-tolerance for tightly-coupled and pipelined applications, especially streaming applications, in a grid environment. We provide an alternative to basic checkpointing and use the notion of Light-weight Summary Structure(LSS) to enable efficient failure-recovery. The idea behind LSS is that at certain points during the execution of a processing stage, the state of the program can be summarized by a small amount of memory. This allows us to store copies of LSS for enabling failure-recovery, which causes low overhead fault-tolerance. Our work can be viewed as an optimization and adaptation of the idea of application-level checkpointing to a different execution environment, and for a different class of applications. Our implementation and evaluation of LSS based failure-recovery has been in the context of the GATES (Grid-based AdapTive Execution on Streams) middleware. An observation we use for providing very low overhead support for fault-tolerance is that algorithms analyzing data streams are only allowed to take a single pass over data, which means they only perform approximate processing. Therefore, we believe that in supporting fault-tolerant execution for these applications, it is acceptable to not analyze a small number of packets of data during failure-recovery. We show how we perform failure-recovery and also demonstrate how we could use additional buffers to limit data loss during the recovery procedure. We also present an efficient algorithm for allocating a new computation resource for failure-recovery at runtime. We have extensively evaluated our implementation using three stream data processing applications, and shown that the use of LSS allows effective and low-overhead failure-recovery.
This work deals with optimization of the control of chaos by means of the evolutionary algorithms. The main aim of this work is to show that evolutionary algorithms are capable of optimization of chaos control leading...
详细信息
This work deals with optimization of the control of chaos by means of the evolutionary algorithms. The main aim of this work is to show that evolutionary algorithms are capable of optimization of chaos control leading to satisfactory results and mainly to compare their performance in this task. As a model of deterministic chaotic system, the one dimensional logistic equation was used. The evolutionary algorithms, SOMA (self-organizing migrating algorithm) and DE (differential evolution) were used in several versions. for each version, simulations were repeated 50 times to show and check robustness of the used method and constructed cost function. Within this work the results of optimized chaos control for both evolutionary algorithms are compared in statistical overview.
作者:
Václav SnášelPavel KrömerJan PlatošFEECS
Department of Computer Science VšB Technical University of Ostrava Ostrava Czech Republic FEECS
VÅ B - Technical University of Ostrava Ostrava-Poruba Czech Republic
Linear ordering problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP hard problem), rich collection of testing data and variety of real world applications. In this paper, we inve...
详细信息
Linear ordering problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP hard problem), rich collection of testing data and variety of real world applications. In this paper, we investigate the usage and performance of two variants of genetic algorithms - mutation only genetic algorithms and higher level chromosome genetic algorithms - on the linear ordering problem. Both methods are tested and evaluated on a collection of real world and artificial LOP instances.
Two new variants of particle swarm optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using beta distribution. AMPSO1 mutates the perso...
详细信息
Two new variants of particle swarm optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using beta distribution. AMPSO1 mutates the personal best position of the swarm and AMPSO2, mutates the global best swarm position. The performance of proposed algorithms is evaluated on twelve unconstrained test problems and three real life constrained problems taken from the field of electrical engineering. The numerical results show the competence of the proposed algorithms with respect some other contemporary techniques.
作者:
Václav SnášelJan PlatošPavel KrömerNabil OuddaneFEECS
Department of Computer Science VšB Technical University of Ostrava Ostrava Czech Republic FEECS
VÅ B - Technical University of Ostrava Ostrava-Poruba Czech Republic FEECS
Department of Telecommunications VšB Technical University of Ostrava Ostrava Czech Republic
Throughout the past decade, the discovery of turbo codes has been considered as one of the most successful researches whose impact significantly enhanced the quality of modern communication systems. To obtain an excel...
详细信息
Throughout the past decade, the discovery of turbo codes has been considered as one of the most successful researches whose impact significantly enhanced the quality of modern communication systems. To obtain an excellent performance, it is necessary to design robust turbo code interleaver. In the recent time, there were several attempts to apply genetic algorithms to improve the performance of turbo codes by optimization of the interleaver. This paper investigates the optimization of turbo code interleaver with free distance as a fitness function.
In this paper, the calculation of aircraft trimming process is presented in a sufficiently understandable way using a unique combination of global optimization theory and the direct hand-on computer simulation. The me...
In this paper, the calculation of aircraft trimming process is presented in a sufficiently understandable way using a unique combination of global optimization theory and the direct hand-on computer simulation. The methods of artificial intelligence and heuristic algorithms handling with the equations of airplane motion are presented in this paper. The main aim was to use them for trimming the flying aircraft to the steady state flight upon setting the flight conditions of various kinds. New approach of SOMA (self organizing migrating algorithm) has been used here to find the vehicle equilibrium state. The method can be practically utilized in construction of airplanes as well as the flight simulators design.
暂无评论