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.

     

Measurement of the Seperation between Atoms beyond Diffraction Limit

We propose a scheme to obtain the distance of two identical atoms placed inside the standing wave field by monitoring the collective resonance fluorescence spectrum emitted by the two particles. We find three different parameter ranges, depending on the distance of the atoms as compared to the transition wavelength. For large interparticle distances, dipole-dipole coupling is negligible, and the main system evolution arises from the interaction with the standing wave field. In the small-distance limit, the dynamics is dominated by the dipole-dipole interaction. Finally, in the intermediate region, a rich interplay of the various couplings arises, which however is lifted for strong driving laser fields. The present measurement procedure allows us to distinguish the three cases. In each of the cases, we show how to determine the distance of the two particles and their respective positions relative to the nodes of the standing wave field with fractional-wavelength precision.     

Attractors and Dimensions for Discretizations of a Dissipative Zakharov Equations

Abstract In this paper, a dissipative Zakharov equations are discretized by difference method.We make priorestimates for the algebric system of equations. It is proved that for each mesh size,there exist attractors forthe discretized system.The bounds of the Hausdorff dimensions of the discrete attractors are obtained,and thevarious bounds are dependent of the mesh sizes.     

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).     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

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.     

Time-domain numerical computation of noise reduction by diffraction and finite impedance of barriers

A new time-domain numerical method is presented for the estimation of noise reduction by the diffraction and finite impedance of barriers. High order finite difference schemes conventionally used for computational aeroacoustics, and time-domain impedance boundary conditions are utilized for the development of the time-domain method. Compared with other methods, this method can be applied more easily to the problems related to nonlinear noise propagation such as impulsive noise and broadband noise. Linearized Euler equations in Cartesian co-ordinates are considered and solved numerically. Straight and T-shaped barriers with and without surface admittance are calculated. In order to assess the accuracy of this time-domain method, comparison with the results of SYSNOISE software (Ver. 5.3) are made. There are very good agreements between the results of the present time-domain numerical method and the boundary element method of the SYSNOISE software.     

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.