A non-autonomous strongly damped wave equation: Existence and continuity of the pullback attractor

In this paper we consider the strongly damped wave equation with time-dependent terms u(tt) - Delta u - gamma(t)Delta u(t) + beta(epsilon)(t)u(t) = f(u), in a bounded domain Omega subset of R(n), under some restrictions on beta(epsilon)(t), gamma(t) and growth restrictions on the nonlinear term f. The function beta(epsilon)(t) depends on a parameter epsilon, beta(epsilon)(t) -> 0. We will prove, under suitable assumptions, local and global well-posedness (using the uniform sectorial operators theory), the existence and regularity of pullback attractors {A(epsilon)(t) : t is an element of R}, uniform bounds for these pullback attractors, characterization of these pullback attractors and their upper and lower semicontinuity at epsilon = 0. (C) 2010 Elsevier Ltd. All rights reserved.

Finite-dimensional global attractors in Banach spaces

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls of smaller radius. As an application of the abstract theory we show that the global attractors of a very broad class of parabolic partial differential equations (semilinear equations in Banach spaces) are finite-dimensional. (C) 2010 Elsevier Inc. All rights reserved.

On the continuity of pullback attractors for evolution processes

In this paper we give general results on the continuity of pullback attractors for nonlinear evolution processes. We then revisit results of [D. Li, P.E. Kloeden, Equi-attraction and the continuous dependence of pullback attractors on parameters, Stoch. Dyn. 4 (3) (2004) 373-384] which show that, under certain conditions, continuity is equivalent to uniformity of attraction over a range of parameters (""equi-attraction""): we are able to simplify their proofs and weaken the conditions required for this equivalence to hold. Generalizing a classical autonomous result [A.V. Babin, M.I. Vishik, Attractors of Evolution Equations, North Holland, Amsterdam, 1992] we give bounds on the rate of convergence of attractors when the family is uniformly exponentially attracting. To apply these results in a more concrete situation we show that a non-autonomous regular perturbation of a gradient-like system produces a family of pullback attractors that are uniformly exponentially attracting: these attractors are therefore continuous, and we can give an explicit bound on the distance between members of this family. (C) 2009 Elsevier Ltd. All rights reserved.

Dynamics of the viscous Cahn-Hilliard equation

We study generalized viscous Cahn-Hilliard problems with nonlinearities satisfying critical growth conditions in W-0(1,p)(Omega), where Omega is a bounded smooth domain in R-n, n >= 3. In the critical growth case, we prove that the problems are locally well posed and obtain a bootstrapping procedure showing that the solutions are classical. For p = 2 and almost critical dissipative nonlinearities we prove global well posedness, existence of global attractors in H-0(1)(Omega) and, uniformly with respect to the viscosity parameter, L-infinity(Omega) bounds for the attractors. Finally, we obtain a result on continuity of regular attractors which shows that, if n = 3, 4, the attractor of the Cahn-Hilliard problem coincides (in a sense to be specified) with the attractor for the corresponding semilinear heat equation. (C) 2008 Elsevier Inc. All rights reserved.

Regularity of solutions on the global attractor for a semilinear damped wave equation

We consider attractors A(eta), eta epsilon [0, 1], corresponding to a singularly perturbed damped wave equation u(tt) + 2 eta A(1/2)u(t) + au(t) + Au = f (u) in H-0(1)(Omega) x L-2 (Omega), where Omega is a bounded smooth domain in R-3. For dissipative nonlinearity f epsilon C-2(R, R) satisfying vertical bar f ``(s)vertical bar <= c(1 + vertical bar s vertical bar) with some c > 0, we prove that the family of attractors {A(eta), eta >= 0} is upper semicontinuous at eta = 0 in H1+s (Omega) x H-s (Omega) for any s epsilon (0, 1). For dissipative f epsilon C-3 (R, R) satisfying lim(vertical bar s vertical bar) (->) (infinity) f ``(s)/s = 0 we prove that the attractor A(0) for the damped wave equation u(tt) + au(t) + Au = f (u) (case eta = 0) is bounded in H-4(Omega) x H-3(Omega) and thus is compact in the Holder spaces C2+mu ((Omega) over bar) x C1+mu((Omega) over bar) for every mu epsilon (0, 1/2). As a consequence of the uniform bounds we obtain that the family of attractors {A(eta), eta epsilon [0, 1]} is upper and lower semicontinuous in C2+mu ((Omega) over bar) x C1+mu ((Omega) over bar) for every mu epsilon (0, 1/2). (c) 2007 Elsevier Inc. All rights reserved.

On the variations of the Betti numbers of regular levels of Morse flows

We generalize results in Cruz and de Rezende (1999) [7] by completely describing how the Beth numbers of the boundary of an orientable manifold vary after attaching a handle, when the homology coefficients are in Z, Q, R or Z/pZ with p prime. First we apply this result to the Conley index theory of Lyapunov graphs. Next we consider the Ogasa invariant associated with handle decompositions of manifolds. We make use of the above results in order to obtain upper bounds for the Ogasa invariant of product manifolds. (C) 2011 Elsevier B.V. All rights reserved.

Scrutinizing the ZW(+)W(-) vertex at the Large Hadron Collider at 7 TeV

We analyze the potential of the CERN Large Hadron Collider running at 7 TeV to search for deviations from the Standard Model predictions for the triple gauge boson coupling ZW(+)W(-) assuming an integrated luminosity of 1 fb(-1). We show that the study of W(+)W(-) and W(+/-)Z productions, followed by the leptonic decay of the weak gauge bosons can improve the present sensitivity on the anomalous couplings Delta g(1)(Z), Delta kappa(Z), lambda(Z), g(4)(Z), and (lambda) over bar (Z) at the 2 sigma level. (C) 2010 Elsevier B.V. All rights reserved.

Renormalization of the S parameter in holographic models of electroweak symmetry breaking

We show that the S parameter is not finite in theories of electroweak symmetry breaking in a slice of anti-de Sitter five-dimensional space, with the light fermions localized in the ultraviolet. We compute the one-loop contributions to S from the Higgs sector and show that they are logarithmically dependent on the cutoff of the theory. We discuss the renormalization of S, as well as the implications for bounds from electroweak precision measurements on these models. We argue that, although in principle the choice of renormalization condition could eliminate the S parameter constraint, a more consistent condition would still result in a large and positive S. On the other hand, we show that the dependence on the Higgs mass in S can be entirely eliminated by the renormalization procedure, making it impossible in these theories to extract a Higgs mass bound from electroweak precision constraints.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

Complexity and anisotropy in host morphology make populations less susceptible to epidemic outbreaks

One of the challenges in epidemiology is to account for the complex morphological structure of hosts such as plant roots, crop fields, farms, cells, animal habitats and social networks, when the transmission of infection occurs between contiguous hosts. Morphological complexity brings an inherent heterogeneity in populations and affects the dynamics of pathogen spread in such systems. We have analysed the influence of realistically complex host morphology on the threshold for invasion and epidemic outbreak in an SIR (susceptible-infected-recovered) epidemiological model. We show that disorder expressed in the host morphology and anisotropy reduces the probability of epidemic outbreak and thus makes the system more resistant to epidemic outbreaks. We obtain general analytical estimates for minimally safe bounds for an invasion threshold and then illustrate their validity by considering an example of host data for branching hosts (salamander retinal ganglion cells). Several spatial arrangements of hosts with different degrees of heterogeneity have been considered in order to separately analyse the role of shape complexity and anisotropy in the host population. The estimates for invasion threshold are linked to morphological characteristics of the hosts that can be used for determining the threshold for invasion in practical applications.

Empirical analysis of the Lieb-Oxford bound in ions and molecules

Universal properties of the Coulomb interaction energy apply to all many-electron systems. Bounds on the exchange-correlation energy, in particular, are important for the construction of improved density functionals. Here we investigate one such universal property-the Lieb-Oxford lower bound-for ionic and molecular systems. In recent work [J Chem Phys 127, 054106 (2007)], we observed that for atoms and electron liquids this bound may be substantially tightened. Calculations for a few ions and molecules suggested the same tendency, but were not conclusive due to the small number of systems considered. Here we extend that analysis to many different families of ions and molecules, and find that for these, too, the bound can be empirically tightened by a similar margin as for atoms and electron liquids. Tightening the Lieb-Oxford bound will have consequences for the performance of various approximate exchange-correlation functionals. (C) 2008 Wiley Periodicals Inc.

Search for first harmonic modulation in the right ascension distribution of cosmic rays detected at the Pierre Auger Observatory

We present the results of searches for dipolar-type anisotropies in different energy ranges above 2.5 x 10(17) eV with the surface detector array of the Pierre Auger Observatory, reporting on both the phase and the amplitude measurements of the first harmonic modulation in the right-ascension distribution. Upper limits on the amplitudes are obtained, which provide the most stringent bounds at present, being below 2% at 99% C.L. for EeV energies. We also compare our results to those of previous experiments as well as with some theoretical expectations. (C) 2011 Elsevier B.V. All rights reserved.

Three-dimensional packings with rotations

We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal packings where 90 degrees rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 2.64, and 4.89, respectively. These algorithms are for the more general case in which the bounded dimensions of the bin given in the input are not necessarily equal (that is, we consider bins for which the length. the width and the height are not necessarily equal). Moreover, we show that these problems-in the general version-are as hard to approximate as the corresponding oriented version. (C) 2009 Elsevier Ltd. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.