Isolation and Characterization of Proteins Interacting with Activin Type Ⅱ Receptors

Introduction Activinisamemberofthetransforminggrowth factor(TGF)βsuperfamilyofextracellularsignaling proteins.Themembersofthisfamilyplayacriticalrole duringembryogenesisandinmaintainingtissuehomeo stasisinadultlife[1—3].DeregulatedTGFfamilysigna lingisi…     

Well-posed absorbing layer for hyperbolic problems

Summary. The perfectly matched layer (PML) is an efficient tool to simulate propagation phenomena in free space on unbounded domain. In this paper we consider a new type of absorbing layer for Maxwell's equations and the linearized Euler equations which is also valid for several classes of first order hyperbolic systems. The definition of this layer appears as a slight modification of the PML technique. We show that the associated Cauchy problem is well-posed in suitable spaces. This theory is finally illustrated by some numerical results. It must be underlined that the discretization of this layer leads to a new discretization of the classical PML formulation. Received May 5, 2000 / Published online November 15, 2001     

Holographic interferometry as electrochemical emission spectroscopy of a carbon steel in 5–20 ppm TROS C-70 inhibited seawater

In the present investigation, holographic interferometry was utilized for the first time to determine the rate change of the number of the fringe evolutions during the corrosion test of a carbon steel in blank seawater and seawater with different concentrations of a corrosion inhibitor. In other words, the anodic dissolution behaviors (corrosion) of the carbon steel were determined simultaneously by holographic interferometry, as an electromagnetic method, and by the electrochemical impedance (EI) spectroscopy, as an electronic method. So, the abrupt rate change of the number of the fringe evolutions during corrosion tests, EI spectroscopy, of the carbon steel is called electrochemical emission spectroscopy. The corrosion process of the steel samples was carried out in blank seawater and seawater with different concentrations, 5–20 ppm, of TROS C-70 corrosion inhibitor using the EI spectroscopy method, at room temperature. The electrochemical-emission spectra of the carbon steel in different solutions represent a detailed picture of the rate change of the anodic dissolution of the steel throughout the corrosion processes. Furthermore, the optical interferometry data of the carbon steel were compared to the data, which was obtained from the EI. spectroscopy. Consequently, holographic interferometry is found very useful for monitoring the anodic dissolution behaviors of metals, in which the number of the fringe evolutions of the steel samples can be determined in situ.     

Time-resolved fluorescence spectra of a bichromophoric molecule, 2-methyl-1,2,3,4-tetrahydroisoquinoline in various media

Time-resolved fluorescence spectra of a title molecule (with benzene and aliphatic amine parts) in various media, after excitation by several lasers were observed to complement the previous work by conventional spectroscopy [N. Kanamaru, J. Tanaka, J. Phys. Chem. 95 (1991) 6441]. Though complex with many new features, the results were roughly consistent with the previous ones. The significant conclusions are as follows: (1) The emission to be ascribed to the amine (N) part, with more than one component (of nN and aN types) is observed not only for the acetonitrile solution (as previously reported) but also for all the other media. (2) Contrary to the case of a nonpolar hexane solution, both of N fluorescences in the other media reveal unusually long-lived decay components. This can be interpreted by assuming the so-called charge-transfer-to-solvent (CTTS) state that is nonfluorescent and lies just below the fluorescent state. (3) This observation in the protic media can also be taken as another evidence of the peculiar hydrogen bonding between this amine and the protic solvent molecules [N. Kanamaru, J. Tanaka, J. Phys. Chem. 95 (1991) 6441]. (4) Thus, the unexpectedly large quantum yields of N fluorescences in the polar media are now interpreted as arising due to the slow S₁^N→(CTTS)→S₀ internal conversions.     

Structural and lithium intercalation studies of Mn(0.5−x)CaxTi2(PO4)3 phases (0≤x≤0.50)

Materials from the Mn_(0.5−x)Ca_xTi₂(PO₄)₃ (0≤x≤0.50) solid solution were obtained by solid-state reaction in air at 1000 °C. Selected compositions were investigated by powder X-ray diffraction analysis, ³¹P nuclear magnetic resonance (NMR) spectroscopy and electrochemical lithium intercalation. The structure of all samples determined by Rietveld analysis is of the Nasicon type with the R space group. Mn²⁺/Ca²⁺ ions occupy only the M1 sites in the Ti₂(PO₄)₃ framework. The divalent cations are ordered in one of two M1 sites, except for the Mn_0.50Ti₂(PO₄)₃ phase, where a small departure from the ideal order is observed by XRD and ³¹P MAS NMR. The electrochemical behaviour of Mn_0.50Ti₂(PO₄)₃ and Mn_(0.5−x)Ca_xTi₂(PO₄)₃ phases was characterised in Li cells. Two Li ions can be inserted without altering the Ti₂(PO₄)₃ framework. In the 0≤y≤2 range, the OCV curves of Li//Li_yMn_0.50Ti₂(PO₄)₃ cells show two main potential plateaus at 2.90 and 2.50–2.30 V. Comparison between the OCV curves of Li//Li_(1+y)Ti₂(PO₄)₃ and Li//Li_yMn_0.50Ti₂(PO₄)₃ shows that the intercalation occurs first in the unoccupied M1 site of Mn_0.50Ti₂(PO₄)₃ at 2.90 V and then, for compositions y>0.50, at the M2 site (2.50–2.30 V voltage range). The effect of calcium substitution in Mn_0.50Ti₂(PO₄)₃ on the lithium intercalation is also discussed from a structural and kinetic viewpoint. In all systems, the lithium intercalation is associated with a redistribution of the divalent cation over all M1 sites. In the case of Mn_0.50Ti₂(PO₄)₃, the stability of Mn²⁺ either in an octahedral or tetrahedral environment facilitates cationic migration.     

Error estimate for a stabilised domain decomposition method with nonmatching grids

Summary. In this paper, we analyse a stabilisation technique for the so-called three-field formulation for nonoverlapping domain decomposition methods. The stabilisation is based on boundary bubble functions in each subdomain which are then eliminated by static condensation. The discretisation grids in the subdomains can be chosen independently as well as the grid for the final interface problem. We present the analysis of the method and we construct a set of bubble functions which guarantees the optimal rate of convergence. Received May 12, 1998 / Revised version received November 21, 2000 / Published online June 7, 2001     

广义凸集的支撑函数

本文讨论了笔者在[1]中提出的伪凸集,拟凸集的支撑函数与障碍锥的性质,并通过这些性质得出了二个闭性准则。     

On the augmented system approach to sparse least-squares problems

Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam     

Limits of parallelism in explicit ODE methods

Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois.     

中心—焦点区分问题的I l'yashenko算法

对二维平面系统的二维系统的中心焦点区分问题 ,I l'yashenko曾建议一个算法 ,本文给出此法的详细证明 .据此 ,我们讨论了区分问题在 Arnold意义下的代数可解性与不可解性