Researches of DC—Problem Under the Model S in which the Numbers of Defective Coins are not Fixed

In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results.     

Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

A co‐ordinate system independent streamwise upwind method for fluid flow computation

A new co‐ordinate invariant streamwise upwind formulation for convection dominated flows is developed. The eddy diffusivity/viscosity is added directly to the equations in order to remove the oscillations in the solution. The equations then can be solved by any high‐order scheme and the solution retains the accuracy of the high‐order scheme. The accuracy and reduced lateral thickness growth rate are demonstrated with several numerical examples, including pure convective flows and lid‐driven cavity flow. The lateral spreading due to the numerical diffusion is controlled by the anisotropic tensor. Copyright © 2004 John Wiley & Sons, Ltd.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

Point-to-Periodic and Periodic-to-Periodic Connections

In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn in 1994, “On well-posed problems for connecting orbits in dynamical systems”, where a numerical technique is also proposed. Our algorithms consist of splitting the computation of the connection from that of the periodic orbit(s). To set up appropriate boundary conditions, we follow the algorithmic approach used by Demmel, Dieci, and Friedman, for the case of connecting orbits between equilibria, and we construct and exploit the smooth block Schur decomposition of the monodromy matrices associated to the periodic orbits. Numerical examples illustrate the performance of the algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

The PDE-preserving operators on nuclearly entire functions of bounded type

The PDE-preserving operators O on the space of nuclearly entire functions of bounded type H_Nb(E) on a Banach space E are characterized. An operator is PDE-preserving when it preserves homogenous solutions to homogeneous convolution equations. We establish a one to one correspondence between O and a set Σ of sequences of entire functionals, i.e. exponential type functions. In this way, algebraic structures on Σ, such as ring structures, can be carried over to O and vice versa. In particular, it follows that O is a non-commutative ring (algebra) with unity with respect to composition and the convolution operators form a commutative subring (subalgebra). We discuss range and kernel properties, for the operators in O, and characterize the projectors (onto polynomial spaces) in O by determining the corresponding elements in Σ. This revised version was published online in June 2006 with corrections to the Cover Date.     

A fourth‐order compact finite difference scheme for the steady stream function–vorticity formulation of the Navier–Stokes/Boussinesq equations

A fourth‐order compact finite difference scheme on the nine‐point 2D stencil is formulated for solving the steady‐state Navier–Stokes/Boussinesq equations for two‐dimensional, incompressible fluid flow and heat transfer using the stream function–vorticity formulation. The main feature of the new fourth‐order compact scheme is that it allows point‐successive overrelaxation (SOR) or point‐successive underrelaxation iteration for all Rayleigh numbers Ra of physical interest and all Prandtl numbers Pr attempted. Numerical solutions are obtained for the model problem of natural convection in a square cavity with benchmark solutions and compared with some of the accurate results available in the literature. Copyright © 2003 John Wiley & Sons, Ltd.     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”     

无界区域R1上推广的B-BBM方程的整体吸引子

本文研究了无界区域R^1上推广的B—BBM方程的长时间动力学行为，证明了该方程整体吸引子的存在性．