Large time behavior of the solutions to the Boltzmann equation with specular reflective boundary condition

In this paper a half space problem for the one-dimensional Boltzmann equation with specular reflective boundary condition is investigated. It is shown that the solution of the Boltzmann equation time-asymptotically converges to a global Maxwellian under some initial conditions. Furthermore, a time-decay rate is also obtained.     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

多时滞随机神经网络的稳定性

通过构建李雅普偌夫函数的方法和利用半鞅收敛定理对一类随机时滞神经网络的全局指数稳定进行了分析,提出了易于判定随机时滞神经网络几乎必然指数稳定性新的代数判据,推广了[1]中的主要结论.     

Precise measurement of magnetic moment of short-lived β-emitting nuclei12B ( I π=1+, T 1/2=20.18 ms)

The spin polarized β-emitting nuclei¹²B (I ^π=1⁺,T _1/2=20.18 ms) were produced by the nuclear reaction¹¹B(d, p)¹²B and by the selection technique of the incident deuteron energy and the¹²B recoil angle following the nuclear reaction. The nuclear magnetic moment of the short-lived nuclei¹²B was measured by β-NMR with the β-NMR and β-NQR setup established for the first time in China. The nuclear magnetic moment of¹²B was determined to be μ=0.99993±0.00048 nm org=0.99993±0.00048 after the precise correction of the Knight shift.     

面积比较与上调和函数及其应用

本文研究了无穷远处具非负截曲率的完备非紧流形的几何和解析性质,并将 它应用于调和映照.     

A New Cytotoxic Acetogenin from the Seeds of Annona squamosa

A New Annonaceous acetogenin,squamostolide(1),was isolated from the seeds of Annona squamosa.Its structure was elucidated based on spectroscopic methods and comparison with known compounds.It is the first example of Annonaceous acetogenin with each of the two ends of the aliphatic chain bearing a γ-lactone.Thenew compound exhibited cytotoxic activity in vitro against bel-7402 and CNE2 human tumor cell lines.     

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.