Rayleigh Waves Generated by a Thermal Source: A Three-Dimensional Transient Thermoelasticity Solution

A three-dimensional transient thermoelastic solution is obtained for Rayleigh-type disturbances propagating on the surface of a half-space. These surface waves are generated by either a buried or surface thermal source, which has the form of a concentrated heat flux applied impulsively. In an effort to model this problem as realistically as possible, the half-space material is taken to respond according to Biot’s fully coupled thermoelasticity. The problem has relevance to situations involving heat generation due to: (i) laser action (impulsive electromagnetic radiation) on a surface target, (ii) underground nuclear activity, and (iii) friction developed during underground fault motions related to seismic activity. The problem was attacked with unilateral and double bilateral Laplace transforms, which suppress, respectively, the time variable and two of the space variables. The Rayleigh wave contribution is obtained as a closed-form expression by utilizing asymptotics, complex-variable theory and certain results for Bessel functions. The dependence of the normal displacement associated with the Rayleigh wave upon the distance from the source epicenter and the distance from the wavefront is also determined

A smartphone-based Teleradiology system

The development of a teleradiology application for remote monitoring and processing of patient image data using 2nd generation mobile devices with enhanced network services, is of extreme interest, especially when the final means of display is a smartphone, a very light and compact handheld device. In the following paper the development of applications, that are responsible for remote monitoring and processing of medical images, is investigated

Linear Growth through 12 Years is Weakly but Consistently Associated with Language and Math Achievement Scores at Age 12 Years in 4 Low- or Middle-Income Countries.

BackgroundWhether linear growth through age 12 y is associated with language and math achievement at age 12 y remains unclear.ObjectiveOur objective was to investigate associations of linear growth through age 12 y with reading skill, receptive vocabulary, and mathematics performance at age 12 y in 4 low- or middle-income countries (LMICs).MethodsWe analyzed data from the Young Lives Younger Cohort study in Ethiopia (n = 1275), India (n = 1350), Peru (n = 1402), and Vietnam (n = 1594). Age 1, 5, 8, and 12 y height-for-age z scores (HAZ) were calculated. Language and math achievement at age 12 y was assessed with the use of country-specific adaptations of the Peabody Picture Vocabulary Test, the Early Grades Reading Assessment, and a mathematics test; all test scores were standardized by age within country. We used path analysis to examine associations of HAZ with achievement scores. Twelve models were examined at each age (3 tests across 4 countries).ResultsMean HAZ in each country was <-1.00 at all ages. Overall, linear growth through age 12 y was associated with 0.4-3.4% of the variance in achievement scores. HAZ at 1 y was positively and significantly associated with the test score in 11 of the 12 models. This association was significantly mediated through HAZ at 5, 8, and 12 y in 9 of the models. HAZ at 5, 8, and 12 y was positively and significantly associated with test scores in 8, 8, and 6 models, respectively. These associations were mediated through HAZ at older ages in 6 of the HAZ at 5-y models and in 6 of the HAZ at 8-y models.ConclusionChild relative linear growth between ages 1 and 12 y was weakly but consistently associated with language and math achievement at age 12 y in 4 LMICs

Transient crack propagation in asymmetric cruciform paths

The problem of two cracks emanating from the same origin and propagating asymmetrically at different velocities in an elastic and isotropic solid is treated in this paper. An unbounded and otherwise undisturbed medium and a constant anti-plane loading at infinity were assumed. Techniques of self-similar elastodynamics were utilized in conjunction with analytic-function theory. Since a closed-form solution of such a problem is impossible we relied in the last steps of the procedure upon numerical analysis.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41718/1/707_2005_Article_BF01190888.pd

Cross-linking of Nitrogenase Components: Structure and Activity of the Covalent Complex

The nitrogenase complex from Azotobacter vinelandii is composed of the MoFe protein (Av1), an α_2β_2 tetramer, and the Fe protein (Av2), a γ_2 dimer. During turnover of the enzyme, electrons are transferred from Av2 to Av1 in parallel with the hydrolysis of MgATP. Using the cross-linking reagent, 1-ethyl-3-(3-dimethylaminopropyl)carbodiimide, we have identified some of the properties of the complex between the two components. The cross-linking reaction was highly specific yielding a single apparent M_r = 97,000 protein. The amount of cross-linked product was essentially independent of whether MgATP or MgADP were in the reaction. Also, the amount was maximum at high ratios of Av2 to Av1. The M_r = 97,000 protein was characterized by amino acid analysis and Edman degradation and was found to be consistent with a 1:1 complex of an Av2 γ subunit and an Av1 β subunit (the amino terminal serine subunit). The complex was no longer active in the nitrogenase reaction which supports, but does not prove, the requirement for dissociation of the complex after each electron transferred. Nitrogenase activity and cross-linking were inhibited in an identical way by NaCl, which suggests that electrostatic forces are critical to the formation of the electron transfer complex

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple $O(m n)$-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time $O(n^2)$. For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an $O(m^2 / \log{n})$-time algorithm for 2-edge strongly connected components, and thus improve over the $O(m n)$ running time also when $m = O(n)$. Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of $O(n^2 \log^2 n)$ for edges and $O(n^3)$ for vertices