Smooth Solution of the Compressible Navier–Stokes Equations in an Unbounded Domain with Inflow Boundary Condition

The barotropic compressible Navier–Stokes equations in an unbounded domain are studied. We prove the unique existence of the solution (u, p) of the system (1.1) in the Sobolev spaceH^{k + 3} × H^{k + 2}provided that the derivatives of the data of the problem are sufficiently small, wherek ≥ 0 is any integer. The proof follows from an analysis of the linearized problem, the solvability of the continuity equation, and the Schauder fixed point theory. Similar smoothness results are obtained for a linearized form of (1.1).     

On a stochastic nonlinear equation in one-dimensional viscoelasticity

In this paper we discuss an initial-boundary value problem for a stochastic nonlinear equation arising in one-dimensional viscoelasticity. We propose to use a new direct method to obtain a solution. This method is expected to be applicable to a broad class of nonlinear stochastic partial differential equations.

     

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

Fuzzy convex sets in median algebras

The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Rapid DNA hybridization analysis using a PDMS microfluidic sensor and a molecular beacon.

A rapid DNA analysis has been developed based on a fluorescence intensity change of a molecular beacon in a PDMS microfluidic channel. Recently, we reported a new analytical method of DNA hybridization involving a PDMS microfluidic sensor using fluorescence energy transfer (FRET). However, there are some limitations in its application to real DNA samples because the target DNA must be labelled with a suitable fluorescent dye. To resolve this problem, we have developed a new DNA microfluidic sensor using a molecular beacon. By monitoring the change in the restored fluorescence intensity along the channel length, it is possible to rapidly detect any hybridization of the molecular beacon to the target DNA. In this case, the target DNA does not need to be labelled. Our experimental results demonstrate that this microfluidic sensor using a molecular beacon is a promising diagnostic tool for rapid DNA hybridization analysis.     

Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.     

A parallel cell‐based DSMC method on unstructured adaptive meshes

A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.