Robust experimental study of avalanche precursory events based on reproducible cycles of grain packing destabilizations

Quasi-periodic collective displacements of grains at the free surface of a tilted grain packing constitute precursors of granular avalanches. Laboratory experiments are commonly performed by slowly tilting the packing from 0° to the maximal stability angle θA. In these conditions, the number of precursors is too small to assess reproducible and robust statistical analyses of the precursor activity. To go beyond this limitation, we have developed a specific experimental protocol consisting of tilting the packing with successive oscillation cycles. We use a high-resolution optical camera and process the images of the packing free surface to identify precursory events during many consecutive cycles of a single packing. We observe the same behavior for all half-cycles, forth and back: appearance of the first precursors after the same variation of inclination, exponential evolution of the weak surface activity for the first precursors and linear growth of stronger surface activity for the following ones. The experimental protocol provides both reproducible precursor measurements based on large sample statistical inferences and a quasi-stationary state after one full-cycle. This approach is very promising for highlighting the effects of external parameters, including humidity and packing geometry.

Classical and Quantum Integrability: A Formulation That Admits Quantum Chaos

The concept of integrability of a quantum system is developed and studied. By formulating the concepts of quantum degree of freedom and quantum phase space, a realization of the dynamics is achieved. For a quantum system with a dynamical group G in one of its unitary irreducible representative carrier spaces, the quantum phase space is a finite topological space. It is isomorphic to a coset space G/R by means of the unitary exponential mapping, where R is the maximal stability subgroup of a fixed state in the carrier space. This approach has the distinct advantage of exhibiting consistency between classical and quantum integrability. The formalism will be illustrated by studying several quantum systems in detail after this development.

Stability of the Bipartite Matching Model

We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles. There are finite sets C and S of customer and server classes, respectively. Time is discrete and at each time step one customer and one server arrive in the system according to a joint probability measure μ on C× S, independently of the past. Also, at each time step, pairs of matched customers and servers, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph (C, S, E⊂ C × S). A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete-time Markov chain. We study its stability under various admissible matching policies, including ML (match the longest), MS (match the shortest), FIFO (match the oldest), RANDOM (match uniformly), and PRIORITY. There exist natural necessary conditions for stability (independent of the matching policy) defining the maximal possible stability region. For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite graph. For the MS and PRIORITY policies, we exhibit a bipartite graph with a non-maximal stability region.

Stability of the Bipartite Matching Model

We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles. There are finite sets C and S of customer and server classes, respectively. Time is discrete and at each time step one customer and one server arrive in the system according to a joint probability measure μ on C× S, independently of the past. Also, at each time step, pairs of matched customers and servers, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph (C, S, E⊂ C × S). A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete-time Markov chain. We study its stability under various admissible matching policies, including ML (match the longest), MS (match the shortest), FIFO (match the oldest), RANDOM (match uniformly), and PRIORITY. There exist natural necessary conditions for stability (independent of the matching policy) defining the maximal possible stability region. For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite graph. For the MS and PRIORITY policies, we exhibit a bipartite graph with a non-maximal stability region.

Preparation of Physical and Chemical and Thermodynamic Properties of Aluminum Alloys-Cerium

Chemical compositions, microstructure and hardness of alloys and Al - Ce intermetallic compounds have been studied. The method of calorimetry solution determined the enthalpy of dissolution. Enthalpy of formation of intermetallic compounds In thermo chemical cycle has been calculated. It was revealed the regularity of their changes depending on the composition. Melting temperature of intermetallic compounds of the system has been specified by Semi empirical method. It has defined the specified set pattern in the changes on melting temperature and enthalpy of formation of IM on the concentration of Maximal stability in the composition of Al2Se.

The Boundary Crossing Theorem and the Maximal Stability Interval

The boundary crossing theorem and the zero exclusion principle are very useful tools in the study of the stability of family of polynomials. Although both of these theorem seem intuitively obvious, they can be used for proving important results. In this paper, we give generalizations of these two theorems and we apply such generalizations for finding the maximal stability interval.

Host Insect Inhibitor-of-Apoptosis SfIAP Functionally Replaces Baculovirus IAP but Is Differentially Regulated by Its N-Terminal Leader

ABSTRACT The inhibitor-of-apoptosis (IAP) proteins encoded by baculoviruses bear a striking resemblance to the cellular IAP homologs of their invertebrate hosts. By virtue of the acquired selective advantage of blocking virus-induced apoptosis, baculoviruses may have captured cellular IAP genes that subsequently evolved for virus-specific objectives. To compare viral and host IAPs, we defined antiapoptotic properties of SfIAP, the principal cellular IAP of the lepidopteran host Spodoptera frugiperda. We report here that SfIAP prevented virus-induced apoptosis as well as viral Op-IAP3 (which is encoded by the Orgyia pseudotsugata nucleopolyhedrovirus) when overexpressed from the baculovirus genome. Like Op-IAP3, SfIAP blocked apoptosis at a step prior to caspase activation. Both of the baculovirus IAP repeats (BIRs) were required for SfIAP function. Moreover, deletion of the C-terminal RING motif generated a loss-of-function SfIAP that interacted and dominantly interfered with wild-type SfIAP. Like Op-IAP3, wild-type SfIAP formed intracellular homodimers, suggesting that oligomerization is a functional requirement for both cellular and viral IAPs. SfIAP possesses a ∼100-residue N-terminal leader domain, which is absent among all viral IAPs. Remarkably, deletion of the leader yielded a fully functional SfIAP with dramatically increased protein stability. Thus, the SfIAP leader contains an instability motif that may confer regulatory options for cellular IAPs that baculovirus IAPs have evolved to bypass for maximal stability and antiapoptotic potency. Our findings that SfIAP and viral IAPs have common motifs, share multiple biochemical properties including oligomerization, and act at the same step to block apoptosis support the hypothesis that baculoviral IAPs were derived by acquisition of host insect IAPs.