Tensionless Contact Of A Finite Beam Resting On Reissner Foundation

A more generalized model of a beam resting on a tensionless Reissner foundation is presented. Compared with the Winkler foundation model, the Reissner foundation model is a much improved one. In the Winkler foundation model, there is no shear stress inside the foundation layer and the foundation is assumed to consist of closely spaced, independent springs. The presence of shear stress inside Reissner foundation makes the springs no longer independent and the foundation to deform as a whole. Mathematically, the governing equation of a beam on Reissner foundation is sixth order differential equation compared with fourth order of Winkler one. Because of this order change of the governing equation, new boundary conditions are needed and related discussion is presented. The presence of the shear stress inside the tensionless Reissner foundation together with the unknown feature of contact area/length makes the problem much more difficult than that of Winkler foundation. In the model presented here, the effects of beam dimension, gap distance, loading asymmetry and foundation shear stress on the contact length are all incorporated and studied. As the beam length increases, the results of a finite beam with zero gap distance converge asymptotically to those obtained by the previous model for an infinitely long beam. (C) 2008 Elsevier Ltd. All rights reserved.

Analysis and application of ellipticity of stability equations on fluid mechanics

By using characteristic analysis of the linear and nonlinear parabolic stability equations (PSE), PSE of primitive disturbance variables are proved to be parabolic intotal. By using sub-characteristic analysis of PSE, the linear PSE are proved to be elliptical and hyperbolic-parabolic for velocity U, in subsonic and supersonic, respectively; the nonlinear PSE are proved to be elliptical and hyperbolic-parabolic for relocity U + u in subsonic and supersonic, respectively. The methods are gained that the remained ellipticity is removed from the PSE by characteristic and sub-characteristic theories, the results for the linear PSE are consistent with the known results, and the influence of the Mach number is also given out. At the same time, the methods of removing the remained ellipticity are further obtained from the nonlinear PSE.

Synchronization of modified Chua's circuit with x vertical bar x vertical bar function

This paper considers the chaos synchronization of the modified Chua's circuit with x vertical bar x vertical bar function. We firstly show that a couple of the modified Chua systems with different parameters and initial conditions can be synchronized using active control when the values of parameters both in drive system and response system are known aforehand. Furthermore, based on Lyapunov stability theory we propose an adaptive active control approach to make the states of two identical Chua systems with unknown constant parameters asymptotically synchronized. Moreover the designed controller is independent of those unknown parameters. Numerical simulations are given to validate the proposed synchronization approach.

Discussion on the geometric structure of strange attractor

We discuss the transversal heteroclinic cycle formed by hyperbolic periodic pointes of diffeomorphism on the differential manifold. We point out that every possible kind of transversal heteroclinic cycle has the Smalehorse property and the unstable manifolds of hyperbolic periodic points have the closure relation mutually. Therefore the strange attractor may be the closure of unstable manifolds of a countable number of hyperbolic periodic points. The Henon mapping is used as an example to show that the conclusion is reasonable.

The geometric structure and dynamic properties of lauwerier attractor

 Introduction The strange chaotic attractor (ACS) is an important subject in the nonlinear field. On the basis of the theory of transversal heteroclinic cycles, it is suggested that the strange attractor is the closure of the unstable manifolds of countable infinite hyperbolic periodic points. From this point of view some nonlinear phenomena are explained reasonably. 更多还原

Inhomogeneous behavior of antiplane shear crack in softening material with local unloading

Examined in this work is the anti-plane stress and strain near a crack in a material that softens beyond the elastic peak and unloads on a linear path through the initial state. The discontinuity in the constitutive relation is carried into the analysis such that one portion of the local solution is elliptic in character and the other hyperbolic. Material elements in one region may cross over to another as the loading is increased. Local unloading can thus prevail. Presented are the inhomogeneous character of the asymptotic stress and strain in the elliptic and hyperbolic region, in addition to the region in which the material elements had experienced unloading. No one single stress or strain coefficient would be adequate for describing crack instability.

The wave model of mesothermal plasma near wakes and Korteweg-de Vries equation

The stationary two-dimensional (x, z) near wakes behind a flat-based projectile which moves at a constant mesothermal speed (V∞) along a z-axis in a rarefied, fully ionized, plasma is studied using the wave model previously proposed by one of the authors (VCL). One-fluid theory is used to depict the free expansion of ambient plasma into the vacuum produced behind a fast-moving projectile. This nonstationary, one-dimensional (x, t) flow which is approximated by the K-dV equation can be transformed, through substitution, t=z/V∞, into a stationary two-dimensional (x, z) near wake flow seen by an observer moving with the body velocity (V∞). The initial value problem of the K-dV equation in (x, t) variables is solved by a specially devised numerical method. Comparisons of the present numerical solution for the asymptotically small and large times with available analytical solutions are made and found in satisfactory agreements.

Influence of seagrass landscape structure on the juvenile blue crab habitat-survival function

Organismal survival in marine habitats is often positively correlated with habitat structural complexity at local (within-patch) spatial scales. Far less is known, however, about how marine habitat structure at the landscape scale influences predation and other ecological processes, and in particular, how these processes are dictated by the interactive effect of habitat structure at local and landscape scales. The relationship between survival and habitat structure can be modeled with the habitat-survival function (HSF), which often takes on linear, hyperbolic, or sigmoid forms. We used tethering experiments to determine how seagrass landscape structure influenced the HSF for juvenile blue crabs Callinectes sapidus Rathbun in Back Sound, North Carolina, USA. Crabs were tethered in artificial seagrass plots of 7 different shoot densities embedded within small (1 – 3 m2) or large (>100 m2) seagrass patches (October 1999), and within 10 × 10 m landscapes containing patchy (<50% cover) or continuous (>90% cover) seagrass (July 2000). Overall, crab survival was higher in small than in large patches, and was higher in patchy than in continuous seagrass. The HSF was hyperbolic in large patches and in continuous seagrass, indicating that at low levels of habitat structure, relatively small increases in structure resulted in substantial increases in juvenile blue crab survival. However, the HSF was linear in small seagrass patches in 1999 and was parabolic in patchy seagrass in 2000. A sigmoid HSF, in which a threshold level of seagrass structure is required for crab survival, was never observed. Patchy seagrass landscapes are valuable refuges for juvenile blue crabs, and the effects of seagrass structural complexity on crab survival can only be fully understood when habitat structure at larger scales is considered.

Asymptotic Hyperstability of a Class of Linear Systems under Impulsive Controls Subject to an Integral Popovian Constraint

This paper is focused on the study of the important property of the asymptotic hyperstability of a class of continuous-time dynamic systems. The presence of a parallel connection of a strictly stable subsystem to an asymptotically hyperstable one in the feed-forward loop is allowed while it has also admitted the generation of a finite or infinite number of impulsive control actions which can be combined with a general form of nonimpulsive controls. The asymptotic hyperstability property is guaranteed under a set of sufficiency-type conditions for the impulsive controls.

An observer-based vaccination control law for an SEIR epidemic model based on feedback linearization techniques for nonlinear systems

This paper presents a vaccination strategy for fighting against the propagation of epidemic diseases. The disease propagation is described by an SEIR (susceptible plus infected plus infectious plus removed populations) epidemic model. The model takes into account the total population amounts as a refrain for the illness transmission since its increase makes the contacts among susceptible and infected more difficult. The vaccination strategy is based on a continuous-time nonlinear control law synthesised via an exact feedback input-output linearization approach. An observer is incorporated into the control scheme to provide online estimates for the susceptible and infected populations in the case when their values are not available from online measurement but they are necessary to implement the control law. The vaccination control is generated based on the information provided by the observer. The control objective is to asymptotically eradicate the infection from the population so that the removed-by-immunity population asymptotically tracks the whole one without precise knowledge of the partial populations. The model positivity, the eradication of the infection under feedback vaccination laws and the stability properties as well as the asymptotic convergence of the estimation errors to zero as time tends to infinity are investigated.

Self-organized generation of transverse waves in diverging cylindrical detonations

Self-organized generation of transverse waves associated with the transverse wave instabilities at a diverging cylindrical detonation front was numerically studied by solving two-dimensional Euler equations implemented with an improved two-step chemical kinetic model. After solution validation, four mechanisms of the transverse wave generation were identified from numerical simulations, and referred to as the concave front focusing, the kinked front evolution, the wrinkled front evolution and the transverse wave merging, respectively. The propagation of the cylindrical detonation is maintained by the growth of the transverse waves that match the rate of increase in surface area of the detonation front to asymptotically approach a constant average number of transverse waves per unit length along the circumference of the detonation front. This cell bifurcation phenomenon of cellular detonations is discussed in detail to gain better understanding on detonation physics.

High Order Multi-Moment Constrained Finite Volume Method. Part I: Basic Formulation

A new high-order finite volume method based on local reconstruction is presented in this paper. The method, so-called the multi-moment constrained finite volume (MCV) method, uses the point values defined within single cell at equally spaced points as the model variables (or unknowns). The time evolution equations used to update the unknowns are derived from a set of constraint conditions imposed on multi kinds of moments, i.e. the cell-averaged value and the point-wise value of the state variable and its derivatives. The finite volume constraint on the cell-average guarantees the numerical conservativeness of the method. Most constraint conditions are imposed on the cell boundaries, where the numerical flux and its derivatives are solved as general Riemann problems. A multi-moment constrained Lagrange interpolation reconstruction for the demanded order of accuracy is constructed over single cell and converts the evolution equations of the moments to those of the unknowns. The presented method provides a general framework to construct efficient schemes of high orders. The basic formulations for hyperbolic conservation laws in 1- and 2D structured grids are detailed with the numerical results of widely used benchmark tests. (C) 2009 Elsevier Inc. All rights reserved.

Relating thermodynamics to information theory : the equality of free energy and mutual information

In this thesis we uncover a new relation which links thermodynamics and information theory. We consider time as a channel and the detailed state of a physical system as a message. As the system evolves with time, ever present noise insures that the "message" is corrupted. Thermodynamic free energy measures the approach of the system toward equilibrium. Information theoretical mutual information measures the loss of memory of initial state. We regard the free energy and the mutual information as operators which map probability distributions over state space to real numbers. In the limit of long times, we show how the free energy operator and the mutual information operator asymptotically attain a very simple relationship to one another. This relationship is founded on the common appearance of entropy in the two operators and on an identity between internal energy and conditional entropy. The use of conditional entropy is what distinguishes our approach from previous efforts to relate thermodynamics and information theory.

Some modified bifurcation problems with application to imperfection sensitivity in buckling

The branching theory of solutions of certain nonlinear elliptic partial differential equations is developed, when the nonlinear term is perturbed from unforced to forced. We find families of branching points and the associated nonisolated solutions which emanate from a bifurcation point of the unforced problem. Nontrivial solution branches are constructed which contain the nonisolated solutions, and the branching is exhibited. An iteration procedure is used to establish the existence of these solutions, and a formal perturbation theory is shown to give asymptotically valid results. The stability of the solutions is examined and certain solution branches are shown to consist of minimal positive solutions. Other solution branches which do not contain branching points are also found in a neighborhood of the bifurcation point.

The qualitative features of branching points and their associated nonisolated solutions are used to obtain useful information about buckling of columns and arches. Global stability characteristics for the buckled equilibrium states of imperfect columns and arches are discussed. Asymptotic expansions for the imperfection sensitive buckling load of a column on a nonlinearly elastic foundation are found and rigorously justified.

On erasure coding for distributed storage and streaming communications

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.

First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases. Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small. Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.

Second, we study how distributed storage allocations affect the recovery delay in a mobile setting. Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes: the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay. We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations. It turns out that the optimal allocations for the two problems can be quite different. In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.

Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link; the receiver must subsequently decode each message within a given delay from its creation time. For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns. For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases. We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability; the objective is to maximize the decoding probability for a given message size. We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small. In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.

Finally, we consider the joint problems of routing and caching for named data networking. We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions. In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.