53,722 research outputs found
Computational Universality and 1/f Noise in Elementary Cellular Automata
It is speculated that there is a relationship between 1/f noise and
computational universality in cellular automata. We use genetic algorithms to
search for one-dimensional and two-state, five-neighbor cellular automata which
have 1/f-type spectrum. A power spectrum is calculated from the evolution
starting from a random initial configuration. The fitness is estimated from the
power spectrum in consideration of the similarity to 1/f-type spectrum. The
result shows that the rule with the highest average fitness has a propagating
structure like other computationally universal cellular automata, although
computational universality of the rule has not been proved yet
The Commonality of Earthquake and Wind Analysis
Earthquakes and wind loadings constitute dynamic effects that often must be considered in the design of buildings and structures. The primary purpose of this research
study was to investigate the common features of general dynamic analysis procedures
employed for evaluating the effects of wind and earthquake excitation. Another major
goal was to investigate and develop a basis for generating response spectra for wind
loading, which in turn would permit the use of modal analysis techniques for wind
analysis in a manner similar to that employed for earthquake engineering. In order to
generate wind response spectra, the wind loading is divided into two parts, a mean
load treated as a static component and a fluctuating load treated as a dynamic component.
The spectral representation of the wind loading constitutes a simple procedure
for estimating the forces associated with the dynamic component of the gusting wind.
Several illustrative examples are presented demonstrating the commonality.National Science Foundation Grants ENV 75-08456 and ENV 77-0719
Bit rates in audio source coding
The goal is to introduce and solve the audio coding optimization problem. Psychoacoustic results such as masking and excitation pattern models are combined with results from rate distortion theory to formulate the audio coding optimization problem. The solution of the audio optimization problem is a masked error spectrum, prescribing how quantization noise must be distributed over the audio spectrum to obtain a minimal bit rate and an inaudible coding errors. This result cannot only be used to estimate performance bounds, but can also be directly applied in audio coding systems. Subband coding applications to magnetic recording and transmission are discussed in some detail. Performance bounds for this type of subband coding system are derived
Analytical computation of the epidemic threshold on temporal networks
The time variation of contacts in a networked system may fundamentally alter
the properties of spreading processes and affect the condition for large-scale
propagation, as encoded in the epidemic threshold. Despite the great interest
in the problem for the physics, applied mathematics, computer science and
epidemiology communities, a full theoretical understanding is still missing and
currently limited to the cases where the time-scale separation holds between
spreading and network dynamics or to specific temporal network models. We
consider a Markov chain description of the Susceptible-Infectious-Susceptible
process on an arbitrary temporal network. By adopting a multilayer perspective,
we develop a general analytical derivation of the epidemic threshold in terms
of the spectral radius of a matrix that encodes both network structure and
disease dynamics. The accuracy of the approach is confirmed on a set of
temporal models and empirical networks and against numerical results. In
addition, we explore how the threshold changes when varying the overall time of
observation of the temporal network, so as to provide insights on the optimal
time window for data collection of empirical temporal networked systems. Our
framework is both of fundamental and practical interest, as it offers novel
understanding of the interplay between temporal networks and spreading
dynamics.Comment: 22 pages, 6 figure
Algorithmic and Statistical Perspectives on Large-Scale Data Analysis
In recent years, ideas from statistics and scientific computing have begun to
interact in increasingly sophisticated and fruitful ways with ideas from
computer science and the theory of algorithms to aid in the development of
improved worst-case algorithms that are useful for large-scale scientific and
Internet data analysis problems. In this chapter, I will describe two recent
examples---one having to do with selecting good columns or features from a (DNA
Single Nucleotide Polymorphism) data matrix, and the other having to do with
selecting good clusters or communities from a data graph (representing a social
or information network)---that drew on ideas from both areas and that may serve
as a model for exploiting complementary algorithmic and statistical
perspectives in order to solve applied large-scale data analysis problems.Comment: 33 pages. To appear in Uwe Naumann and Olaf Schenk, editors,
"Combinatorial Scientific Computing," Chapman and Hall/CRC Press, 201
- …