398 research outputs found
Steady-state stabilization due to random delays in maps with self-feedback loops and in globally delayed-coupled maps
We study the stability of the fixed-point solution of an array of mutually
coupled logistic maps, focusing on the influence of the delay times,
, of the interaction between the th and th maps. Two of us
recently reported [Phys. Rev. Lett. {\bf 94}, 134102 (2005)] that if
are random enough the array synchronizes in a spatially homogeneous
steady state. Here we study this behavior by comparing the dynamics of a map of
an array of delayed-coupled maps with the dynamics of a map with
self-feedback delayed loops. If is sufficiently large, the dynamics of a
map of the array is similar to the dynamics of a map with self-feedback loops
with the same delay times. Several delayed loops stabilize the fixed point,
when the delays are not the same; however, the distribution of delays plays a
key role: if the delays are all odd a periodic orbit (and not the fixed point)
is stabilized. We present a linear stability analysis and apply some
mathematical theorems that explain the numerical results.Comment: 14 pages, 13 figures, important changes (title changed, discussion,
figures, and references added
Study of multi black hole and ring singularity apparent horizons
We study critical black hole separations for the formation of a common
apparent horizon in systems of - black holes in a time symmetric
configuration. We study in detail the aligned equal mass cases for ,
and relate them to the unequal mass binary black hole case. We then study the
apparent horizon of the time symmetric initial geometry of a ring singularity
of different radii. The apparent horizon is used as indicative of the location
of the event horizon in an effort to predict a critical ring radius that would
generate an event horizon of toroidal topology. We found that a good estimate
for this ring critical radius is . We briefly discuss the
connection of this two cases through a discrete black hole 'necklace'
configuration.Comment: 31 pages, 21 figure
Adaptive online deployment for resource constrained mobile smart clients
Nowadays mobile devices are more and more used as a platform for applications. Contrary to prior generation handheld devices configured with a predefined set of applications, today leading edge devices provide a platform for flexible and customized application deployment. However, these applications have to deal with the limitations (e.g. CPU speed, memory) of these mobile devices and thus cannot handle complex tasks. In order to cope with the handheld limitations and the ever changing device context (e.g. network connections, remaining battery time, etc.) we present a middleware solution that dynamically offloads parts of the software to the most appropriate server. Without a priori knowledge of the application, the optimal deployment is calculated, that lowers the cpu usage at the mobile client, whilst keeping the used bandwidth minimal. The information needed to calculate this optimum is gathered on the fly from runtime information. Experimental results show that the proposed solution enables effective execution of complex applications in a constrained environment. Moreover, we demonstrate that the overhead from the middleware components is below 2%
Generalization of the interaction between the Haar approximation and polynomial operators to higher order methods
International audienceIn applications it is useful to compute the local average of a function f(u) of an input u from empirical statistics on u. A very simple relation exists when the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation
Spectrum of the Dirac Operator and Multigrid Algorithm with Dynamical Staggered Fermions
Complete spectra of the staggered Dirac operator \Dirac are determined in
quenched four-dimensional gauge fields, and also in the presence of
dynamical fermions.
Periodic as well as antiperiodic boundary conditions are used.
An attempt is made to relate the performance of multigrid (MG) and conjugate
gradient (CG) algorithms for propagators with the distribution of the
eigenvalues of~\Dirac.
The convergence of the CG algorithm is determined only by the condition
number~ and by the lattice size.
Since~'s do not vary significantly when quarks become dynamic,
CG convergence in unquenched fields can be predicted from quenched
simulations.
On the other hand, MG convergence is not affected by~ but depends on
the spectrum in a more subtle way.Comment: 19 pages, 8 figures, HUB-IEP-94/12 and KL-TH 19/94; comes as a
uuencoded tar-compressed .ps-fil
Almost-Tight Distributed Minimum Cut Algorithms
We study the problem of computing the minimum cut in a weighted distributed
message-passing networks (the CONGEST model). Let be the minimum cut,
be the number of nodes in the network, and be the network diameter. Our
algorithm can compute exactly in time. To the best of our knowledge, this is the first paper that
explicitly studies computing the exact minimum cut in the distributed setting.
Previously, non-trivial sublinear time algorithms for this problem are known
only for unweighted graphs when due to Pritchard and
Thurimella's -time and -time algorithms for
computing -edge-connected and -edge-connected components.
By using the edge sampling technique of Karger's, we can convert this
algorithm into a -approximation -time algorithm for any . This improves
over the previous -approximation -time algorithm and
-approximation -time algorithm of Ghaffari and Kuhn. Due to the lower
bound of by Das Sarma et al. which holds for any
approximation algorithm, this running time is tight up to a factor.
To get the stated running time, we developed an approximation algorithm which
combines the ideas of Thorup's algorithm and Matula's contraction algorithm. It
saves an factor as compared to applying Thorup's tree
packing theorem directly. Then, we combine Kutten and Peleg's tree partitioning
algorithm and Karger's dynamic programming to achieve an efficient distributed
algorithm that finds the minimum cut when we are given a spanning tree that
crosses the minimum cut exactly once
A Finite Element Computation of the Gravitational Radiation emitted by a Point-like object orbiting a Non-rotating Black Hole
The description of extreme-mass-ratio binary systems in the inspiral phase is
a challenging problem in gravitational wave physics with significant relevance
for the space interferometer LISA. The main difficulty lies in the evaluation
of the effects of the small body's gravitational field on itself. To that end,
an accurate computation of the perturbations produced by the small body with
respect the background geometry of the large object, a massive black hole, is
required. In this paper we present a new computational approach based on Finite
Element Methods to solve the master equations describing perturbations of
non-rotating black holes due to an orbiting point-like object. The numerical
computations are carried out in the time domain by using evolution algorithms
for wave-type equations. We show the accuracy of the method by comparing our
calculations with previous results in the literature. Finally, we discuss the
relevance of this method for achieving accurate descriptions of
extreme-mass-ratio binaries.Comment: RevTeX 4. 18 pages, 8 figure
Reproductive factors and risk of melanoma : a population-based cohort study
Background The association between reproductive factors and risk of cutaneous melanoma (CM) is unclear. We investigated this issue in the Norwegian Women and Cancer cohort study. Objectives To examine the association between the reproductive factors age at menarche, menstrual cycle length, parity, age at first and last birth, menopausal status, breastfeeding duration and length of ovulatory life, and CM risk, overall and by histological subtypes and anatomical site. Methods We followed 165 712 women aged 30-75 years at inclusion from 1991-2007 to the end of 2015. Multivariable Cox regression was used to estimate hazard ratios (HRs) with 95% confidence intervals (CIs). Results The mean age at cohort enrolment was 49 years. During a median follow-up of 18 years, 1347 cases of CM were identified. No reproductive factors were clearly associated with CM risk. When stratifying by histological subtype we observed significant heterogeneity (P = 0 center dot 01) in the effect of length of ovulatory life on the risk of superficial spreading melanoma (HR 1 center dot 02, 95% CI 1 center dot 01-1 center dot 04 per year increase) and nodular melanoma (HR 0 center dot 97, 95% CI 0 center dot 94-1 center dot 01 per year increase). When stratifying by anatomical site, menopausal status (HR 0 center dot 54, 95% CI 0 center dot 31-0 center dot 92, postmenopausal vs. premenopausal) and menstrual cycle length (HR 1 center dot 07, 95% CI 1 center dot 01-1 center dot 13, per day increase) were associated with CM of the trunk, and significant heterogeneity between anatomical sites was observed for menopausal status (P = 0 center dot 04). Conclusions In this large population-based Norwegian cohort study, we did not find convincing evidence of an association between reproductive factors and risk of CM.Peer reviewe
Stability Analysis of Superconducting Electroweak Vortices
We carry out a detailed stability analysis of the superconducting vortex
solutions in the Weinberg-Salam theory described in Nucl.Phys. B826 (2010) 174.
These vortices are characterized by constant electric current and electric
charge density , for they reduce to Z strings. We consider the
generic field fluctuations around the vortex and apply the functional Jacobi
criterion to detect the negative modes in the fluctuation operator spectrum. We
find such modes and determine their dispersion relation, they turn out to be of
two different types, according to their spatial behavior. There are
non-periodic in space negative modes, which can contribute to the instability
of infinitely long vortices, but they can be eliminated by imposing the
periodic boundary conditions along the vortex. There are also periodic negative
modes, but their wavelength is always larger than a certain minimal value, so
that they cannot be accommodated by the short vortex segments. However, even
for the latter there remains one negative mode responsible for the homogeneous
expansion instability. This mode may probably be eliminated when the vortex
segment is bent into a loop. This suggests that small vortex loops balanced
against contraction by the centrifugal force could perhaps be stable.Comment: 42 pages, 11 figure
The DEPOSIT computer code: calculations of electron-loss cross sections for complex ions colliding with neutral atoms
A description of the DEPOSIT computer code is presented. The code is intended
to calculate total and m-fold electron-loss cross sections (m is the number of
ionized electrons) and the energy T(b) deposited to the projectile (positive or
negative ion) during a collision with a neutral atom at low and intermediate
collision energies as a function of the impact parameter b. The deposited
energy is calculated as a 3D-integral over the projectile coordinate space in
the classical energy-deposition model. Examples of the calculated deposited
energies, ionization probabilities and electron-loss cross sections are given
as well as the description of the input and output data.Comment: 11 pages, 3 figure
- …