Comparison of Time Series and Random-Vibration Theory Site-Response Methods

The random-vibration theory (RVT) approach to equivalent-linear site-response analysis is often used to simulate site amplification, particularly when large numbers of simulations are required for incorporation into probabilistic seismic-hazard analysis. The fact that RVT site-response analysis does not require the specification of input-time series makes it an attractive alternative to other site-response methods. However, some studies have indicated that the site amplification predicted by RVT site-response analysis systematically differs from that predicted by time-series approaches. This study confirms that RVT site-response analysis predicts site amplification at the natural site frequencies as much as 20%-50% larger than time-series analysis, with the largest overprediction occurring for sites with smaller natural frequencies and sites underlain by hard rock. The overprediction is caused by an increase in duration generated by the site response, which is not taken into account in the RVT calculation. Correcting for this change in duration brings the RVT results within 20% of the time-series results. A similar duration effect is observed for the RVT shear-strain calculation used to estimate the equivalent-linear strain-compatible soil properties. An alternative to applying a duration correction to improve the agreement between RVT and time-series analysis is the modeling of shear-wave velocity variability. It is shown that introducing shear-wave velocity variability through Monte Carlo simulation brings the RVT results consistently within +/- 20% of the time-series results.Nuclear Regulatory Commission NRC-04-07-122Civil, Architectural, and Environmental Engineerin

Permutation Classes of Polynomial Growth

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue of all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.Comment: 17 pages, 4 figure

Percolation Critical Exponents in Scale-Free Networks

We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with 2<a<3 possess only a percolative phase. Nevertheless, we show that in this case percolation critical exponents are well defined, near the limit of extreme dilution (where all sites are removed), and that also then the exponents bear a strong a-dependence. The regular mean-field values are recovered only for a>4.Comment: Latex, 4 page

Noncommutativity and Duality through the Symplectic Embedding Formalism

This work is devoted to review the gauge embedding of either commutative and noncommutative (NC) theories using the symplectic formalism framework. To sum up the main features of the method, during the process of embedding, the infinitesimal gauge generators of the gauge embedded theory are easily and directly chosen. Among other advantages, this enables a greater control over the final Lagrangian and brings some light on the so-called "arbitrariness problem". This alternative embedding formalism also presents a way to obtain a set of dynamically dual equivalent embedded Lagrangian densities which is obtained after a finite number of steps in the iterative symplectic process, oppositely to the result proposed using the BFFT formalism. On the other hand, we will see precisely that the symplectic embedding formalism can be seen as an alternative and an efficient procedure to the standard introduction of the Moyal product in order to produce in a natural way a NC theory. In order to construct a pedagogical explanation of the method to the nonspecialist we exemplify the formalism showing that the massive NC U(1) theory is embedded in a gauge theory using this alternative systematic path based on the symplectic framework. Further, as other applications of the method, we describe exactly how to obtain a Lagrangian description for the NC version of some systems reproducing well known theories. Naming some of them, we use the procedure in the Proca model, the irrotational fluid model and the noncommutative self-dual model in order to obtain dual equivalent actions for these theories. To illustrate the process of noncommutativity introduction we use the chiral oscillator and the nondegenerate mechanics

Halting viruses in scale-free networks

The vanishing epidemic threshold for viruses spreading on scale-free networks indicate that traditional methods, aiming to decrease a virus' spreading rate cannot succeed in eradicating an epidemic. We demonstrate that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate a virus. We find that the more biased a policy is towards the hubs, the more chance it has to bring the epidemic threshold above the virus' spreading rate. Furthermore, such biased policies are more cost effective, requiring less cures to eradicate the virus

Growth rates for subclasses of Av(321)

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does not change growth rates