Boundary-Value Problem of Drainage in a Fresh Groundwater Fringe above Saline Groundwater

A multiparameter boundary-value problem of fresh infiltration water seepage in a drained fringe above quiescent saline water is solved in the direct statement and studied in detail.     

多元K-拟全纯函数及其正规定则

研究函数族的正规性定则是复变函数论中的一个重要且有意义的工作．引进多元K-拟全纯函数的定义，并给出了多元K-拟全纯函数族的一个正规定则．     

A coincidence transmission electron microscope with digital waveform measuring system for analytical microscopy

We have been developing a new analytical transmission electron microscope (TEM), called a coincidence TEM, which in principle enables elemental mapping images to be observed at a high signal‐to‐noise (S/N) ratio under very low dose radiation conditions. In this paper, we report the development of a coincidence TEM with a digital waveform measuring system for obtaining a coincidence elemental mapping image. In this system, analog signals detected by a Si(Li) detector and a multianode, position‐sensitive photomultiplier (PSPM) are continuously converted into 12‐bit digital waveform data at a rate of 100 MHz, and transferred to a PC. From the transferred digital waveform data, information on X‐ray photon energy, electron incident position, and detection times of both X rays and electrons are calculated by digital waveform measurement, which lead to the observation of a successful coincidence elemental mapping image. Copyright © 2005 John Wiley & Sons, Ltd.     

On error operators related to the arbitrary functions principle

The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the “arbitrary functions principle” (Poincaré, Hopf). We give extensions of this property to Rd and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics.     

Cavity search: An algorithm for the isolation and display of cavity-like binding regions

Summary A set of algorithms designed to enhance the display of protein binding cavities is presented. These algorithms, collectively entitled CAVITY SEARCH, allow the user to isolate and fully define the extent of a particular cavity. Solid modeling techniques are employed to produce a detailed cast of the active site region, which can then be color-coded to show electrostatic and steric interactions between the protein cavity and a bound ligand.     

Synthesis of stable azomethine ylides by the rearrangement of 1,3-dipolar cycloadducts of 3,4-dihydroisoquinoline-2-oxides with DMAD

1-Aryl-6,7-dimethoxy-1,2,3,4-tetrahydroisoquinolines were prepared according to a one-pot procedure involving the reaction of 2-(3,4-dimethoxyphenyl)-ethylamine with aromatic aldehydes in TFA at reflux. The tetrahydroisoquinolines were treated with H₂O₂-WO₄²⁻ in methanol at room temperature to give the corresponding 3,4-dihydroisoquinoline-2-oxides. Treatment of these cyclic nitrones with DMAD in toluene at room temperature gave the corresponding isoxazolo[3,2-a]isoquinolines. These compounds were heated in toluene at reflux to give the corresponding ylides in high yields (Method A). The effect of the substituents on the rate of the rearrangement of such compounds prompted us to discuss a new mechanism involving consecutive C-C bond heterolysis and 1,3-sigmatropic shift. A one-pot reaction involving the treatment of the nitrones with equimolar amounts of DMAD in refluxing toluene also gave the ylides (Method B). The structures of the prepared compounds were elucidated by spectral means and elemental analyses.     

高效液相色谱分离与质谱稳定同位素稀释法联合测定地质样品中钐及钕

本文报道了用高效液相色谱分离,制取高纯度的Sm及Nd。再与质谱稳定同位素稀释法联合测定几种岩石矿物中的Sm与Nd。     

Isolation, Mapping, DNA Sequence and RFLPs Studies of Random Single-Copy DNA Segments on Human X Chromosome

Using the total human/mouse DNA as the probe, screening has been carried out three times with in situ plaque hybridization to obtain the single-copy DNA sequence from the human X chromosome genomic library. The effective rate of screening is 1. 45%. DNAs from clones containing single-copy inserts have been analyzed by a panel of hybrid cells with or without human X chromosome. Three segments, designated by DXFD52,73,75, are mapped to the X chromosome. DXFD52 has been precisely localized on Xq12-q13 with in situ chromosomal hybridization. DXFD52 has been partially sequenced. The results indicate that DXFD52 is a new isolated single-copy segment on the X chromosome. Great progress in the RFLPs study with DXFD52 has been achieved in the population of Chongqing, Sichuan Province. The results show that the DXFD52 can be used to detect the RFLP with Hind Ⅲ, Bgl Ⅱ, and Hinf Ⅰ. DXFD52 will be a potential "landmark" for the construction of the complete linkage map of human genome and the analysis of genomic s     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.