23,060 research outputs found
Traffic Optimization to Control Epidemic Outbreaks in Metapopulation Models
We propose a novel framework to study viral spreading processes in
metapopulation models. Large subpopulations (i.e., cities) are connected via
metalinks (i.e., roads) according to a metagraph structure (i.e., the traffic
infrastructure). The problem of containing the propagation of an epidemic
outbreak in a metapopulation model by controlling the traffic between
subpopulations is considered. Controlling the spread of an epidemic outbreak
can be written as a spectral condition involving the eigenvalues of a matrix
that depends on the network structure and the parameters of the model. Based on
this spectral condition, we propose a convex optimization framework to find
cost-optimal approaches to traffic control in epidemic outbreaks
Interactive Chemical Reactivity Exploration
Elucidating chemical reactivity in complex molecular assemblies of a few
hundred atoms is, despite the remarkable progress in quantum chemistry, still a
major challenge. Black-box search methods to find intermediates and
transition-state structures might fail in such situations because of the
high-dimensionality of the potential energy surface. Here, we propose the
concept of interactive chemical reactivity exploration to effectively introduce
the chemist's intuition into the search process. We employ a haptic pointer
device with force-feedback to allow the operator the direct manipulation of
structures in three dimensions along with simultaneous perception of the
quantum mechanical response upon structure modification as forces. We elaborate
on the details of how such an interactive exploration should proceed and which
technical difficulties need to be overcome. All reactivity-exploration concepts
developed for this purpose have been implemented in the Samson programming
environment.Comment: 36 pages, 14 figure
Recommended from our members
Export diversification and resource-based industrialization: the case of natural gas
For resource-rich economies, primary commodity specialization has often been considered to be detrimental to growth. Accordingly, export diversification policies centered on resource-based industries have long been advocated as effective ways to moderate the large variability of export revenues. This paper discusses the applicability of a mean-variance portfolio approach to design these strategies and proposes some modifications aimed at capturing the key features of resource processing industries (presence of scale economies and investment lumpiness). These modifications help make the approach more plausible for use in resource-rich countries. An application to the case of natural gas is then discussed using data obtained from Monte Carlo simulations of a calibrated empirical model. Lastly, the proposed framework is put to work to evaluate the performances of the diversification strategies implemented in a set of nine gas-rich economies. These results are then used to formulate some policy recommendations
GCC-Plugin for Automated Accelerator Generation and Integration on Hybrid FPGA-SoCs
In recent years, architectures combining a reconfigurable fabric and a
general purpose processor on a single chip became increasingly popular. Such
hybrid architectures allow extending embedded software with application
specific hardware accelerators to improve performance and/or energy efficiency.
Aiding system designers and programmers at handling the complexity of the
required process of hardware/software (HW/SW) partitioning is an important
issue. Current methods are often restricted, either to bare-metal systems, to
subsets of mainstream programming languages, or require special coding
guidelines, e.g., via annotations. These restrictions still represent a high
entry barrier for the wider community of programmers that new hybrid
architectures are intended for. In this paper we revisit HW/SW partitioning and
present a seamless programming flow for unrestricted, legacy C code. It
consists of a retargetable GCC plugin that automatically identifies code
sections for hardware acceleration and generates code accordingly. The proposed
workflow was evaluated on the Xilinx Zynq platform using unmodified code from
an embedded benchmark suite.Comment: Presented at Second International Workshop on FPGAs for Software
Programmers (FSP 2015) (arXiv:1508.06320
Data Cache-Energy and Throughput Models: Design Exploration for Embedded Processors
Most modern 16-bit and 32-bit embedded processors contain cache memories to further increase instruction throughput of the device. Embedded processors that contain cache memories open an opportunity for the low-power research community to model the impact of cache energy consumption and throughput gains. For optimal cache memory configuration mathematical models have been proposed in the past. Most of these models are complex enough to be adapted for modern applications like run-time cache reconfiguration. This paper improves and validates previously proposed energy and throughput models for a data cache, which could be used for overhead analysis for various cache types with relatively small amount of inputs. These models analyze the energy and throughput of a data cache on an application basis, thus providing the hardware and software designer with the feedback vital to tune the cache or application for a given energy budget. The models are suitable for use at design time in the cache optimization process for embedded processors considering time and energy overhead or could be employed at runtime for reconfigurable architectures
OneMax in Black-Box Models with Several Restrictions
Black-box complexity studies lower bounds for the efficiency of
general-purpose black-box optimization algorithms such as evolutionary
algorithms and other search heuristics. Different models exist, each one being
designed to analyze a different aspect of typical heuristics such as the memory
size or the variation operators in use. While most of the previous works focus
on one particular such aspect, we consider in this work how the combination of
several algorithmic restrictions influence the black-box complexity. Our
testbed are so-called OneMax functions, a classical set of test functions that
is intimately related to classic coin-weighing problems and to the board game
Mastermind.
We analyze in particular the combined memory-restricted ranking-based
black-box complexity of OneMax for different memory sizes. While its isolated
memory-restricted as well as its ranking-based black-box complexity for bit
strings of length is only of order , the combined model does not
allow for algorithms being faster than linear in , as can be seen by
standard information-theoretic considerations. We show that this linear bound
is indeed asymptotically tight. Similar results are obtained for other memory-
and offspring-sizes. Our results also apply to the (Monte Carlo) complexity of
OneMax in the recently introduced elitist model, in which only the best-so-far
solution can be kept in the memory. Finally, we also provide improved lower
bounds for the complexity of OneMax in the regarded models.
Our result enlivens the quest for natural evolutionary algorithms optimizing
OneMax in iterations.Comment: This is the full version of a paper accepted to GECCO 201
Imposing Economic Constraints in Nonparametric Regression: Survey, Implementation and Extension
Economic conditions such as convexity, homogeneity, homotheticity, and monotonicity are all important assumptions or consequences of assumptions of economic functionals to be estimated. Recent research has seen a renewed interest in imposing constraints in nonparametric regression. We survey the available methods in the literature, discuss the challenges that present themselves when empirically implementing these methods and extend an existing method to handle general nonlinear constraints. A heuristic discussion on the empirical implementation for methods that use sequential quadratic programming is provided for the reader and simulated and empirical evidence on the distinction between constrained and unconstrained nonparametric regression surfaces is covered.identification, concavity, Hessian, constraint weighted bootstrapping, earnings function
- …