Justification of Averaging Method for Multifrequency Impulsive Systems

We prove new theorems on the justification of the averaging method for multifrequency oscillation systems with pulse influence at fixed times.     

On Necessary and Sufficient Conditions for the Asymptotic Stability of Impulsive Systems

We prove that the sufficient conditions for the asymptotic stability of impulsive systems obtained by Gurgula and Perestyuk are also necessary conditions.     

L2 -cohomology of manifolds with flat ends

Geometric and Functional Analysis - We give a topological interpretation of the spaces of L2 -harmonic forms on manifolds with flat ends. We also prove a Chern-Gauss-Bonnet formula for the L2...     

Crack path instabilities in DCDC experiments in the low speed regime

We studied the low speed fracture regime (10⁻⁴-10⁻⁹ m s⁻¹) in different glassy materials (soda-lime glass, glass ceramics) with variable but controlled length scale of heterogeneity. The chosen mechanical system enabled us to work in pure mode I (tensile) and at a fixed load on double cleavage drilled compression specimen. The internal residual stresses of studied samples were carefully relaxed by appropriate thermal treatment. By means of optical and atomic force microscopy techniques fracture surfaces have been examined. We have shown for the first time that the crack front line underwent an out-of-plane oscillating behavior as a result of a reproducible sequence of instabilities. The wavelength of such a phenomenon is in the micrometer range and its amplitude in the nanometer range. These features were observed for different glassy materials providing that a typical length scale characterizing internal heterogeneities was lower than a threshold limit estimated to few nanometers. This effect is the first clear experimental evidence of crack path instabilities in the low speed regime in a uniaxial loading experiment. This phenomenon has been interpreted by referring to the stability criterion for a straight crack propagation as presented by Adda-Bedia et al. [Phys. Rev. Lett. 76 (1996) 1497].     

A study of the atmospheric lead pollution in Seville, Spain. Influence of meteorology and traffic, and relationship with other traffic-generated pollutants

A study of the atmospheric pollution by suspended particulate lead in the city of Seville, Spain, was carried out during the period between March 1983 and February 1984. The results obtained from seven sampling stations allowed us to study the site to site variations; there are two locations with average annual concentrations higher than 2 micrograms X m-3. In one station, the meteorological and traffic effects and relationship with other traffic-related pollutants, were investigated. The regression analyses performed on the average monthly data have shown an inverse correlation with wind speed and temperature and a direct correlation with carbon monoxide and smoke concentrations, but no significant correlation was found with the lead deposition levels.     

Elastoplastic torsion theory for whisker crystals

Translated from Zhurnal Prikladnoi Mekhaniki i Tekhnicheskoi Fiziki, No. 2, pp. 127–134, March–April, 1991.     

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.