Primary result of ~(236)U measurement with accelerator mass spectrometry at CIAE

The rare isotope 236U has a half-life of 2.342(3)×107 years,and is produced principally by thermal neutron capture on 235U.The isotopic atom ratio of 236U/238U depends on the integral thermal neutron flux received by the material of interest.236U is potentially useful as a fingerprint for indicating the presence of neutron-irradiated uranium usually originating from nuclear activity.By extracting negative molecular ion UO- from the uranium oxide target,simulating the 236U16O- beam transport with 238U16O- an...     

Purely infinite corona algebras of simple C*-algebras

In this paper, we study the problem of when the corona algebra of a non-unital C*-algebra is purely infinite. A complete answer is obtained for stabilisations of simple and unital algebras that have enough comparison of positive elements. Our result relates the pure infiniteness condition (from its strongest to weakest forms) to the geometry of the tracial simplex of the algebra, and to the behaviour of corona projections, despite the fact that there is no real rank zero condition.     

“Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation

Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that problem Product Partition and several of its modifications are NP-complete in the strong sense. Our results imply the strong NP-hardness of a number of scheduling problems with start-time-dependent job processing times and a problem of designing a reliable system with a series–parallel structure. It should be noticed that the strong NP-hardness of the considered optimization problems does not preclude the existence of a fully polynomial time approximation scheme (FPTAS) for them. We present a simple FPTAS for one of these problems.     

三维Boussinesq方程组大解的全局L~2稳定性

对三维有界及无界区域上的Boussinesq方程的全局L~2稳定性进行了讨论.在解满足适当的条件下,证明了此解为稳定的,并得出此稳定性条件的等价性条件,最后得出了二维Boussinesq方程组在三维扰动下的解的全局存在性和稳定性.     

A Note on the w-Global Transform of Mori Domains

Let R be a domain and let R wg be the w-global transform of R.In this note it is shown that if R is a Mori domain,then the t-dimension formula t- dim(R wg ) = t- dim(R) - 1 holds.     

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

<正>Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.     

Good B-quasi-Ehresmann semigroups

A semigroup S with a sub-band B is called a good B-quasi-Ehresmann semigroup if it is a Bsemiabundant semigroup satisfying the congruence condition such that B((ab)+)abB((ab)*)aB(a*)B(b+)b for all a,b ∈S.We show that every good B-quasi-Ehresmann semigroup has a global representation and a standard representation.As a special case,the structure of good quasi-adequate semigroups is described.     

A modified tabu search algorithm for cost-based job shop problem

In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule.