Computer program performs rectangular fitting stress analysis

Computer program simulates specific bulkhead fittings by subjecting the desired geometry configuration to a membrane force, an external force, an external moment, an external tank pressure, or any combination of the above. This program generates a general model of bulkhead fittings for the Saturn booster

Influence of electromagnetic interferences on the gravimetric sensitivity of surface acoustic waveguides

Surface acoustic waveguides are increasing in interest for (bio)chemical detection. The surface mass modification leads to measurable changes in the propagation properties of the waveguide. Among a wide variety of waveguides, Love mode has been investigated because of its high gravimetric sensitivity. The acoustic signal launched and detected in the waveguide by electrical transducers is accompanied by an electromagnetic wave; the interaction of the two signals, easily enhanced by the open structure of the sensor, creates interference patterns in the transfer function of the sensor. The influence of these interferences on the gravimetric sensitivity is presented, whereby the structure of the entire sensor is modelled. We show that electromagnetic interferences generate an error in the experimental value of the sensitivity. This error is different for the open and the closed loop configurations of the sensor. The theoretical approach is completed by the experimentation of an actual Love mode sensor operated under liquid in open loop configuration. The experiment indicates that the interaction depends on the frequency and the mass modifications.Comment: 28 pages, 8 figure

On the transcendence degree of the differential field generated by Siegel modular forms

It is a classical fact that the elliptic modular functions satisfies an algebraic differential equation of order 3, and none of lower order. We show how this generalizes to Siegel modular functions of arbitrary degree. The key idea is that the partial differential equations they satisfy are governed by Gauss--Manin connections, whose monodromy groups are well-known. Modular theta functions provide a concrete interpretation of our result, and we study their differential properties in detail in the case of degree 2.Comment: 21 pages, AmSTeX, uses picture.sty for 1 LaTeX picture; submitted for publicatio

Shear thickening of cornstarch suspensions as a re-entrant jamming transition

We study the rheology of cornstarch suspensions, a dense system of non-Brownian particles that exhibits shear thickening, i.e. a viscosity that increases with increasing shear rate. Using MRI velocimetry we show that the suspension has a yield stress. From classical rheology it follows that as a function of the applied stress the suspension is first solid (yield stress), then liquid and then solid again when it shear thickens. The onset shear rate for thickening is found to depend on the measurement geometry: the smaller the gap of the shear cell, the lower the shear rate at which thickening occurs. Shear thickening can then be interpreted as the consequence of the Reynolds dilatancy: the system under flow wants to dilate but instead undergoes a jamming transition because it is confined, as confirmed by measurement of the dilation of the suspension as a function of the shear rate

Flow of wet granular materials

The transition from frictional to lubricated flow of a dense suspension of non-Brownian particles is studied. The pertinent parameter characterizing this transition is the Leighton number $Le = \frac{\eta_s \dot{\gamma}}{\sigma}$, which represents the ratio of lubrication to frictional forces. The Leighton number $Le$ defines a critical shear rate below which no steady flow without localization exists. In the frictional regime the shear flow is localized. The lubricated regime is not simply viscous: the ratio of shear to normal stresses remains constant, as in the frictional regime; moreover the velocity profile has a single universal form in both frictional and lubricated regimes. Finally, a discrepancy between local and global measurements of viscosity is identified, which suggests inhomogeneity of the material under flow.Comment: Accepted for publication by Physical Review Letters (december 2004

Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

Qualitative Analysis of Partially-observable Markov Decision Processes

We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability~1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDP s with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDP s with parity objectives and its subclasses

Generalized Lenard Chains, Separation of Variables and Superintegrability

We show that the notion of generalized Lenard chains naturally allows formulation of the theory of multi-separable and superintegrable systems in the context of bi-Hamiltonian geometry. We prove that the existence of generalized Lenard chains generated by a Hamiltonian function defined on a four-dimensional \omega N manifold guarantees the separation of variables. As an application, we construct such chains for the H\'enon-Heiles systems and for the classical Smorodinsky-Winternitz systems. New bi-Hamiltonian structures for the Kepler potential are found.Comment: 14 pages Revte

Randomness for Free

We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games