Synchronization through system interconnections

An interconnection strategy with built-in adaptive controllersis presented which achieves synchronization of scalar linearsystems: the closed-loop network forces all outputs to followthe same signal asymptotically while maintaining the open-loopcharacteristics. In the design of the output feedback controllers,no knowledge of system parameters is assumed, but each systemmust have the same poles and be high-gain-stable. The proofof the main theorem relies critically on derived systems-theoreticresults and the special system topology as a network of interconnectedsystems. The topology is explained by first solving the simplerproblem of signal synchronization.     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.     

Modeling hyperelastic behavior of rubber: A novel invariant‐based and a review of constitutive models

A constitutive phenomenological model completing the Gent‐Thomas concept is carried out to formulate laws governing the hyperelastic behavior of incompressible rubber materials. It is shown that the phenomenological Gent‐Thomas model (1958) and the constrained chain model (1992) give similar precise results at small to moderate deformation. On the other hand, comparisons of the outcome of the proposed model with that of the molecular model from the combined concepts of Flory‐Erman and Boyce‐Arruda (2000), and with those of the phenomenological models of Ogden (1982), Yeoh‐Fleming (1997), Pucci‐Saccomandi (2002) and Beda (2005) are made. Residual inconveniences raised by attractive continuum models in rubber elasticity literature have been successfully overcome. Results from both the statistical and phenomenological mechanics concepts are compared with the data of some useful classical materials (rubbers of Treloar, Rivlin‐Saunders, Pak‐Flory and Yeoh‐Fleming). The results permit one to see salient equivalence of the two theories for a more reliable prediction of stress‐stretch response for all states of any mode of deformation. A complete and exhaustive analysis of the Mooney plot that combines small and very large extension‐compression has been quite essential in assessing the validity of models. A method of identification of material parameters is presented and data of the simple tension suffice for the determination of the parameter values. It is shown that the ordinary identification procedures, such as the usual least squares, a very much used numerical method in materials investigation, can be unsuitable in some cases of hyperelastic modeling. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1713–1732, 2007     

An implicit characteristic-flux-averaging method for the euler equations for real gases

A formulation of an implicit characteristic-flux-averaging method for the unsteady Euler equations with real gas effects is presented. Incorporation of a real gas into a general equation of state is achieved by considering the pressure as a function of density and specific internal energy. The Ricmann solver as well as the flux-split algorithm are modified by introducing the pressure derivatives with respect to density and internal energy. Expressions for calculating the values of the flow variables for a real gas at the cell faces are derived. The Jacobian matrices and the eigenvectors are defined for a general equation of state. The solution of the system of equations is obtained by using a mesh-sequencing method for acceleration of the convergence. Finally, a test case for a simple form of equation of state displays the differences from the corresponding solution for an ideal gas.     

Research problems

This section appears from time to time. Contributions are invited, and should be submitted to R. C. Thompson, Mathematics Department, University of California, Santa Barbara, CA 93106.     

New Heat-Resistant Polyimidates Derived from Bisphenols and Mono- and Dicarboxylic Acid Imidoyl Chlorides

New polyimidates were prepared from bisphenols and mono- and dicarboxylic acid imidoyl chlorides. The structures of the polymers were determined, and their physicochemical, chemical, and thermal properties were studied. The possibility of preparing film and compression materials with good mechanical characteristics from these polymers was examined.     

Monomial ideals

In this paper, we study the numeric characteristics (the Hilbert function and graded Betti numbers) of monomial ideals in the polynomial ring and in the exterior algebra. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 30, Algebra, 2005.