568,995 research outputs found
An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization
This work studies the behavior of three elitist multi- and many-objective
evolutionary algorithms generating a high-resolution approximation of the
Pareto optimal set. Several search-assessment indicators are defined to trace
the dynamics of survival selection and measure the ability to simultaneously
keep optimal solutions and discover new ones under different population sizes,
set as a fraction of the size of the Pareto optimal set.Comment: apperas in Parallel Problem Solving from Nature - PPSN XIII,
Ljubljana : Slovenia (2014
Efficient parallel computation on multiprocessors with optical interconnection networks
This dissertation studies optical interconnection networks, their architecture, address schemes, and computation and communication capabilities. We focus on a simple but powerful optical interconnection network model - the Linear Array with Reconfigurable pipelined Bus System (LARPBS). We extend the LARPBS model to a simplified higher dimensional LAPRBS and provide a set of basic computation operations. We then study the following two groups of parallel computation problems on both one dimensional LARPBS\u27s as well as multi-dimensional LARPBS\u27s: parallel comparison problems, including sorting, merging, and selection; Boolean matrix multiplication, transitive closure and their applications to connected component problems. We implement an optimal sorting algorithm on an n-processor LARPBS. With this optimal sorting algorithm at disposal, we study the sorting problem for higher dimensional LARPBS\u27s and obtain the following results: • An optimal basic Columnsort algorithm on a 2D LARPBS. • Two optimal two-way merge sort algorithms on a 2D LARPBS. • An optimal multi-way merge sorting algorithm on a 2D LARPBS. • An optimal generalized column sort algorithm on a 2D LARPBS. • An optimal generalized column sort algorithm on a 3D LARPBS. • An optimal 5-phase sorting algorithm on a 3D LARPBS. Results for selection problems are as follows: • A constant time maximum-finding algorithm on an LARPBS. • An optimal maximum-finding algorithm on an LARPBS. • An O((log log n)2) time parallel selection algorithm on an LARPBS. • An O(k(log log n)2) time parallel multi-selection algorithm on an LARPBS. While studying the computation and communication properties of the LARPBS model, we find Boolean matrix multiplication and its applications to the graph are another set of problem that can be solved efficiently on the LARPBS. Following is a list of results we have obtained in this area. • A constant time Boolean matrix multiplication algorithm. • An O(log n)-time transitive closure algorithm. • An O(log n)-time connected components algorithm. • An O(log n)-time strongly connected components algorithm. The results provided in this dissertation show the strong computation and communication power of optical interconnection networks
Adaptive optimal operation of a parallel robotic liquid handling station
Results are presented from the optimal operation of a fully automated robotic liquid handling station where parallel experiments are performed for calibrating a kinetic fermentation model. To increase the robustness against uncertainties and/or wrong assumptions about the parameter values, an iterative calibration and experiment design approach is adopted. Its implementation yields a stepwise reduction of parameter uncertainties together with an adaptive redesign of reactor feeding strategies whenever new measurement information is available. The case study considers the adaptive optimal design of 4 parallel fed-batch strategies implemented in 8 mini-bioreactors. Details are given on the size and complexity of the problem and the challenges related to calibration of over-parameterized models and scarce and non-informative measurement data. It is shown how methods for parameter identifiability analysis and numerical regularization can be used for monitoring the progress of the experimental campaigns in terms of generated information regarding parameters and selection of the best fitting parameter subset.BMBF, 02PJ1150, Verbundprojekt: Plattformtechnologien fĂĽr automatisierte Bioprozessentwicklung (AutoBio); Teilprojekt: Automatisierte Bioprozessentwicklung am Beispiel von neuen Nukleosidphosphorylase
The Necessity of Relay Selection
We determine necessary conditions on the structure of symbol error rate (SER)
optimal quantizers for limited feedback beamforming in wireless networks with
one transmitter-receiver pair and R parallel amplify-and-forward relays. We
call a quantizer codebook "small" if its cardinality is less than R, and
"large" otherwise. A "d-codebook" depends on the power constraints and can be
optimized accordingly, while an "i-codebook" remains fixed. It was previously
shown that any i-codebook that contains the single-relay selection (SRS)
codebook achieves the full-diversity order, R. We prove the following:
Every full-diversity i-codebook contains the SRS codebook, and thus is
necessarily large. In general, as the power constraints grow to infinity, the
limit of an optimal large d-codebook contains an SRS codebook, provided that it
exists. For small codebooks, the maximal diversity is equal to the codebook
cardinality. Every diversity-optimal small i-codebook is an orthogonal
multiple-relay selection (OMRS) codebook. Moreover, the limit of an optimal
small d-codebook is an OMRS codebook.
We observe that SRS is nothing but a special case of OMRS for codebooks with
cardinality equal to R. As a result, we call OMRS as "the universal necessary
condition" for codebook optimality. Finally, we confirm our analytical findings
through simulations.Comment: 29 pages, 4 figure
- …