Critical behavior of the susceptible-infected-recovered model on a square lattice

By means of numerical simulations and epidemic analysis, the transition point of the stochastic asynchronous susceptible-infected-recovered model on a square lattice is found to be c(0)=0.176 500 5(10), where c is the probability a chosen infected site spontaneously recovers rather than tries to infect one neighbor. This point corresponds to an infection/recovery rate of lambda(c)=(1-c(0))/c(0)=4.665 71(3) and a net transmissibility of (1-c(0))/(1+3c(0))=0.538 410(2), which falls between the rigorous bounds of the site and bond thresholds. The critical behavior of the model is consistent with the two-dimensional percolation universality class, but local growth probabilities differ from those of dynamic percolation cluster growth, as is demonstrated explicitly.

Statistics of opinion domains of the majority-vote model on a square lattice

The existence of juxtaposed regions of distinct cultures in spite of the fact that people's beliefs have a tendency to become more similar to each other's as the individuals interact repeatedly is a puzzling phenomenon in the social sciences. Here we study an extreme version of the frequency-dependent bias model of social influence in which an individual adopts the opinion shared by the majority of the members of its extended neighborhood, which includes the individual itself. This is a variant of the majority-vote model in which the individual retains its opinion in case there is a tie among the neighbors' opinions. We assume that the individuals are fixed in the sites of a square lattice of linear size L and that they interact with their nearest neighbors only. Within a mean-field framework, we derive the equations of motion for the density of individuals adopting a particular opinion in the single-site and pair approximations. Although the single-site approximation predicts a single opinion domain that takes over the entire lattice, the pair approximation yields a qualitatively correct picture with the coexistence of different opinion domains and a strong dependence on the initial conditions. Extensive Monte Carlo simulations indicate the existence of a rich distribution of opinion domains or clusters, the number of which grows with L(2) whereas the size of the largest cluster grows with ln L(2). The analysis of the sizes of the opinion domains shows that they obey a power-law distribution for not too large sizes but that they are exponentially distributed in the limit of very large clusters. In addition, similarly to other well-known social influence model-Axelrod's model-we found that these opinion domains are unstable to the effect of a thermal-like noise.

Can we make a Bohmian electron reach the speed of light, at least for one instant?

In Bohmian mechanics, a version of quantum mechanics that ascribes world lines to electrons, we can meaningfully ask about an electron's instantaneous speed relative to a given inertial frame. Interestingly, according to the relativistic version of Bohmian mechanics using the Dirac equation, a massive particle's speed is less than or equal to the speed of light, but not necessarily less. That is, there are situations in which the particle actually reaches the speed of light-a very nonclassical behavior. That leads us to the question of whether such situations can be arranged experimentally. We prove a theorem, Theorem 5, implying that for generic initial wave functions the probability that the particle ever reaches the speed of light, even if at only one point in time, is zero. We conclude that the answer to the question is no. Since a trajectory reaches the speed of light whenever the quantum probability current (psi) over bar gamma(mu)psi is a lightlike 4-vector, our analysis concerns the current vector field of a generic wave function and may thus be of interest also independently of Bohmian mechanics. The fact that the current is never spacelike has been used to argue against the possibility of faster-than-light tunneling through a barrier, a somewhat similar question. Theorem 5, as well as a more general version provided by Theorem 6, are also interesting in their own right. They concern a certain property of a function psi : R(4) -> C(4) that is crucial to the question of reaching the speed of light, namely being transverse to a certain submanifold of C(4) along a given compact subset of space-time. While it follows from the known transversality theorem of differential topology that this property is generic among smooth functions psi : R(4) -> C(4), Theorem 5 asserts that it is also generic among smooth solutions of the Dirac equation. (C) 2010 American Institute of Physics. [doi:10.1063/1.3520529]

COUNTABLE GROUPS OF ISOMETRIES ON BANACH SPACES

A group G is representable in a Banach space X if G is isomorphic to the group of isometrics on X in some equivalent norm. We prove that a countable group G is representable in a separable real Banach space X in several general cases, including when G similar or equal to {-1,1} x H, H finite and dim X >= vertical bar H vertical bar or when G contains a normal subgroup with two elements and X is of the form c(0)(Y) or l(p)(Y), 1 <= p < +infinity. This is a consequence of a result inspired by methods of S. Bellenot (1986) and stating that under rather general conditions on a separable real Banach space X and a countable bounded group G of isomorphisms on X containing -Id, there exists an equivalent norm on X for which G is equal to the group of isometrics on X. We also extend methods of K. Jarosz (1988) to prove that any complex Banach space of dimension at least 2 may be renormed with an equivalent complex norm to admit only trivial real isometries, and that any complexification of a Banach space may be renormed with an equivalent complex norm to admit only trivial and conjugation real isometrics. It follows that every real Banach space of dimension at least 4 and with a complex structure may be renormed to admit exactly two complex structures up to isometry, and that every real Cartesian square may be renormed to admit a unique complex structure up to isometry.

Intercepting moving targets: does memory from practice in a specific condition of target displacement affect movement timing?

This investigation aimed at assessing the extent to which memory from practice in a specific condition of target displacement modulates temporal errors and movement timing of interceptive movements. We compared two groups practicing with certainty of future target velocity either in unchanged target velocity or in target velocity decrease. Following practice, both experimental groups were probed in the situations of unchanged target velocity and target velocity decrease either under the context of certainty or uncertainty about target velocity. Results from practice showed similar improvement of temporal accuracy between groups, revealing that target velocity decrease did not disturb temporal movement organization when fully predictable. Analysis of temporal errors in the probing trials indicated that both groups had higher timing accuracy in velocity decrease in comparison with unchanged velocity. Effect of practice was detected by increased temporal accuracy of the velocity decrease group in situations of decreased velocity; a trend consistent with the expected effect of practice was observed for temporal errors in the unchanged velocity group and in movement initiation at a descriptive level. An additional point of theoretical interest was the fast adaptation in both groups to a target velocity pattern different from that practiced. These points are discussed under the perspective of integration of vision and motor control by means of an internal forward model of external motion.

Use of peripheral vision in the interception of moving targets

Use of peripheral vision to organize and reorganize an interceptive action was investigated in young adults. Temporal errors and kinematic variables were evaluated in the interception of a virtual moving target, in situations in which its initial velocity was kept unchanged or was unexpectedly decreased. Observation of target approach was made through continuous visual pursuit (focal vision) or keeping visual focus at the origin of the trajectory or at the contact spot (peripheral vision). Results showed that visual focus at the contact spot led to temporal errors similar to focal vision, although showing a distinct kinematic profile, while focus at the origin led to an impoverished performance

Normal Versus Pathological Voice Signals Using Wavelet Analysis and Least Squares Support-Vector Machines

State of Sao Paulo Research Foundation (FAPESP)

CONCENTRATION FIELDS NEAR AIR-WATER INTERFACES DURING INTERFACIAL MASS TRANSPORT: OXYGEN TRANSPORT AND RANDOM SQUARE WAVE ANALYSIS

Mass transfer across a gas-liquid interface was studied theoretically and experimentally, using transfer of oxygen into water as the gas-liquid system. The experimental results support the conclusions of a theoretical description of the concentration field that uses random square waves approximations. The effect of diffusion over the concentration records was quantified. It is shown that the peak of the normalized rills concentration fluctuation profiles must be lower than 0.5, and that the position of the peak of the rms value is an adequate measure of the thickness of the diffusive layer. The position of the peak is the boundary between the regions more subject to molecular diffusion or to turbulent transport of dissolved mass.

Comparison between DC(+) and Square Wave AC SAW Current Outputs to Weld AISI 304 for Low-Temperature Applications

Welded equipment for cryogenic applications is utilized in chemical, petrochemical, and metallurgical industries. One material suitable for cryogenic application is austenitic stainless steel, which usually doesn`t present ductile/brittle transition temperature, except in the weld metal, where the presence of ferrite and micro inclusions can promote a brittle failure, either by ferrite cleavage or dimple nucleation and growth, respectively. A 25-mm- (1-in.-) thick AISI 304 stainless steel base metal was welded with the SAW process using a 308L solid wire and two kinds of fluxes and constant voltage power sources with two types of electrical outputs: direct current electrode positive and balanced square wave alternating current. The welded joints were analyzed by chemical composition, microstructure characterization, room temperature mechanical properties, and CVN impact test at -100 degrees C (-73 degrees F). Results showed that an increase of chromium and nickel content was observed in all weld beads compared to base metal. The chromium and nickel equivalents ratio for the weld beads were always higher for welding with square wave AC for the two types of fluxes than for direct current. The modification in the Cr(eq)/Ni(eq) ratio changes the delta ferrite morphology and, consequently, modifies the weld bead toughness at lower temperatures. The oxygen content can also affect the toughness in the weld bead. The highest absorbed energy in a CVN impact test was obtained for the welding condition with square wave AC electrical output and neutral flux, followed by DC(+) electrical output and neutral flux, and square wave AC electrical output and alloyed flux.

An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming.

Transient and Steady-State Analysis of the Affine Combination of Two Adaptive Filters

In this paper, we propose an approach to the transient and steady-state analysis of the affine combination of one fast and one slow adaptive filters. The theoretical models are based on expressions for the excess mean-square error (EMSE) and cross-EMSE of the component filters, which allows their application to different combinations of algorithms, such as least mean-squares (LMS), normalized LMS (NLMS), and constant modulus algorithm (CMA), considering white or colored inputs and stationary or nonstationary environments. Since the desired universal behavior of the combination depends on the correct estimation of the mixing parameter at every instant, its adaptation is also taken into account in the transient analysis. Furthermore, we propose normalized algorithms for the adaptation of the mixing parameter that exhibit good performance. Good agreement between analysis and simulation results is always observed.

Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton`s method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.

Stochastic stability analysis for the constant-modulus algorithm

We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of the CM cost function. Our model highlights the influence, of the signal constellation used in the transmission system: for smaller variation in the modulus of the transmitted symbols, the algorithm will be more robust, and the steady-state misadjustment will be smaller. The theoretical results are validated through several simulations, for long and short filters and channels.

Improving the tracking capability of adaptive filters via convex combination

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filter, the issue is not so clear-cut: there are environments for which each family presents better performance. Given this, we propose the use of a convex combination of algorithms of different families to obtain an algorithm with superior tracking capability. We show the potential of this combination and provide a unified theoretical model for the steady-state excess mean-square error for convex combinations of gradient- and Hessian-based algorithms, assuming a random-walk model for the parameter variations. The proposed model is valid for algorithms of the same or different families, and for supervised (LMS and RLS) or blind (CMA and SWA) algorithms.

Linear minimum mean square filter for discrete-time linear systems with Markov jumps and multiplicative noises

In this paper we obtain the linear minimum mean square estimator (LMMSE) for discrete-time linear systems subject to state and measurement multiplicative noises and Markov jumps on the parameters. It is assumed that the Markov chain is not available. By using geometric arguments we obtain a Kalman type filter conveniently implementable in a recurrence form. The stationary case is also studied and a proof for the convergence of the error covariance matrix of the LMMSE to a stationary value under the assumption of mean square stability of the system and ergodicity of the associated Markov chain is obtained. It is shown that there exists a unique positive semi-definite solution for the stationary Riccati-like filter equation and, moreover, this solution is the limit of the error covariance matrix of the LMMSE. The advantage of this scheme is that it is very easy to implement and all calculations can be performed offline. (c) 2011 Elsevier Ltd. All rights reserved.