3,359 research outputs found
Identification of Nonlinear Normal Modes of Engineering Structures under Broadband Forcing
The objective of the present paper is to develop a two-step methodology
integrating system identification and numerical continuation for the
experimental extraction of nonlinear normal modes (NNMs) under broadband
forcing. The first step processes acquired input and output data to derive an
experimental state-space model of the structure. The second step converts this
state-space model into a model in modal space from which NNMs are computed
using shooting and pseudo-arclength continuation. The method is demonstrated
using noisy synthetic data simulated on a cantilever beam with a
hardening-softening nonlinearity at its free end.Comment: Journal pape
On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution
Technology trends are making the cost of data movement increasingly dominant,
both in terms of energy and time, over the cost of performing arithmetic
operations in computer systems. The fundamental ratio of aggregate data
movement bandwidth to the total computational power (also referred to the
machine balance parameter) in parallel computer systems is decreasing. It is
there- fore of considerable importance to characterize the inherent data
movement requirements of parallel algorithms, so that the minimal architectural
balance parameters required to support it on future systems can be well
understood. In this paper, we develop an extension of the well-known red-blue
pebble game to develop lower bounds on the data movement complexity for the
parallel execution of computational directed acyclic graphs (CDAGs) on parallel
systems. We model multi-node multi-core parallel systems, with the total
physical memory distributed across the nodes (that are connected through some
interconnection network) and in a multi-level shared cache hierarchy for
processors within a node. We also develop new techniques for lower bound
characterization of non-homogeneous CDAGs. We demonstrate the use of the
methodology by analyzing the CDAGs of several numerical algorithms, to develop
lower bounds on data movement for their parallel execution
Efficient numerical calculation of drift and diffusion coefficients in the diffusion approximation of kinetic equations
In this paper we study the diffusion approximation of a swarming model given
by a system of interacting Langevin equations with nonlinear friction. The
diffusion approximation requires the calculation of the drift and diffusion
coefficients that are given as averages of solutions to appropriate Poisson
equations. We present a new numerical method for computing these coefficients
that is based on the calculation of the eigenvalues and eigenfunctions of a
Schr\"odinger operator. These theoretical results are supported by numerical
simulations showcasing the efficiency of the method
Designing Fictional Spaces: Questionable Architecture that Supports Sustainable Design
This thesis presents the modeling of spaces described in short stories that are difficult to visualize. The three stories are Kafka\u27s “The Burrow,” Borges’s “The Library of Babel” and Barthelme\u27s “The Balloon.” Three-dimensional models were created based on the details provided by the authors in each story. Several 2-D images are then generated from these models to match specific scenes. This consideration of these works of fiction provokes the asking of several questions about the science, mathematics and engineering that underpins the stories. In all cases, questions about sustainability arise.
This manuscript is divided into three parts to correspond to each story. Each part includes the following: a story background, a literary/historical analysis of the story, the modeling process, model images, and then questions about the science, mathematics and engineering that arise from the fiction
Adaptive networks: coevolution of disease and topology
Adaptive networks have been recently introduced in the context of disease
propagation on complex networks. They account for the mutual interaction
between the network topology and the states of the nodes. Until now, existing
models have been analyzed using low-complexity analytic formalisms, revealing
nevertheless some novel dynamical features. However, current methods have
failed to reproduce with accuracy the simultaneous time evolution of the
disease and the underlying network topology. In the framework of the adaptive
SIS model of Gross et al. [Phys. Rev. Lett. 96, 208701 (2006)], we introduce an
improved compartmental formalism able to handle this coevolutionary task
successfully. With this approach, we analyze the interplay and outcomes of both
dynamical elements, process and structure, on adaptive networks featuring
different degree distributions at the initial stage.Comment: 11 pages, 8 figures, 1 appendix. To be published in Physical Review
Exact solution of bond percolation on small arbitrary graphs
We introduce a set of iterative equations that exactly solves the size
distribution of components on small arbitrary graphs after the random removal
of edges. We also demonstrate how these equations can be used to predict the
distribution of the node partitions (i.e., the constrained distribution of the
size of each component) in undirected graphs. Besides opening the way to the
theoretical prediction of percolation on arbitrary graphs of large but finite
size, we show how our results find application in graph theory, epidemiology,
percolation and fragmentation theory.Comment: 5 pages and 3 figure
Modeling the dynamical interaction between epidemics on overlay networks
Epidemics seldom occur as isolated phenomena. Typically, two or more viral
agents spread within the same host population and may interact dynamically with
each other. We present a general model where two viral agents interact via an
immunity mechanism as they propagate simultaneously on two networks connecting
the same set of nodes. Exploiting a correspondence between the propagation
dynamics and a dynamical process performing progressive network generation, we
develop an analytic approach that accurately captures the dynamical interaction
between epidemics on overlay networks. The formalism allows for overlay
networks with arbitrary joint degree distribution and overlap. To illustrate
the versatility of our approach, we consider a hypothetical delayed
intervention scenario in which an immunizing agent is disseminated in a host
population to hinder the propagation of an undesirable agent (e.g. the spread
of preventive information in the context of an emerging infectious disease).Comment: Accepted for publication in Phys. Rev. E. 15 pages, 7 figure
Measurements and understanding of radon adsorption in nanoporous materials
International audienceFor many experiments working at low energy and very low counting rate in particle and astroparticle physics, the background from the Radon decay chain is one of the strongest constraints. Most of the time, activated charcoal filters are used to dynamically capture the radon from the air or from the gas of the detectors. In general case activated charcoal is a good adsorptive material. It has large effective surface and broad porosity, going from macro to nanopores. However, the big constraints from futures experiments need ad hoc radon capture filters. The optimal adsorption depends on various parameters such as the correct pore size and shape, the temperature, the microscopic structure of the adsorbent or the competition between radon and carrier gas. In this context, we have developed at Centre de Physique des Particules de Marseille (CPPM), a test bench to study the radon capture in various porous materials1. Several very interesting results have been already obtained with non-standard, commercially and research adsorbents like some Carbon Molecular Sieves (CMS), organic molecular cage (CC3)2, or carbon aerogels.In this talk we present a global quantitative and qualitative study of radon adsorption in porous materials. This work is the results of the analysis of more than 30 porous materials in the framework of the collaboration between particle physicist and chemist from several universities
- …