A study on the applications of the acoustic design sensitivity analysis of vibrating bodies

The determination of the sensitivity of the acoustical characteristics of vibrating systems with respect to the variation of the design parameters predicting these characteristics is a necessary and important step of the acoustic design and optimization process. Acoustic design sensitivity analysis includes the computation and evaluation of the sensitivity information required for this procedure. In this study, a boundary element code performing the sensitivity analysis of the acoustic pressure by using the matrix sensitivities with respect to different design variables has been developed. The effect of the precision of boundary element discretization on the acoustic pressure sensitivity is examined via this code. The formulation is applied to a multi-source system and the dimension sensitivity analysis of near field pressures of two-dilating-spherical source is performed. The last application is devoted to a real sound source: a washing machine sitting on the floor. Sensitivity of the field pressures to the machine’s dimensions (size), surface velocity and frequency is examined on the bases of the boundary element model of the machine and half-space condition. The impacts of these variables are compared; and a limiting speed for the machine responding both the acoustical and operational requirements is determined.     

Finite-Part Integrals and Modified Splines

We first state a uniform convergence theorem for finite-part integrals which are derivatives of weighted Cauchy principal value integrals. We then give a two-stage process to modify approximating splines and optimal nodal splines in such a way that the conditions of this theorem are satisfied. Consequently, these modified splines can be used in the numerical evaluation of these finite-part integrals.     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

Dimensional Properties of Fractional Brownian Motion

Let B^α = {B^α（t）,t E R^N} be an （N,d）-fractional Brownian motion with Hurst index α∈ （0, 1）. By applying the strong local nondeterminism of B^α, we prove certain forms of uniform Hausdorff dimension results for the images of B^α when N 〉 αd. Our results extend those of Kaufman for one-dimensional Brownian motion.     

Uniform random number generation

In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject.     

某类一阶非线性双曲型方程的Cauchy问题

本文考虑一类具实际物理背景的一阶非线性双曲型方程，证明了解的存在唯一及正则性。     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.     

The logarithmic norm. History and modern theory

In his 1958 thesis Stability and Error Bounds, Germund Dahlquist introduced the logarithmic norm in order to derive error bounds in initial value problems, using differential inequalities that distinguished between forward and reverse time integration. Originally defined for matrices, the logarithmic norm can be extended to bounded linear operators, but the extensions to nonlinear maps and unbounded operators have required a functional analytic redefinition of the concept.This compact survey is intended as an elementary, but broad and largely self-contained, introduction to the versatile and powerful modern theory. Its wealth of applications range from the stability theory of IVPs and BVPs, to the solvability of algebraic, nonlinear, operator, and functional equations. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65L05     

Multipliers of convergence in norm of series with respect to multiplicative systems

We prove analogs of the Telyakovskii-Pochuev criteria for multipliers of uniform convergence and of convergence in the integral metric for multiplicative systems with bounded generating sequence.     

On sequential procedures for the point estimation of the mean of a normal population

The sequential procedures developed by Starr (1966, Ann. Math. Statist., 37, 1173–1185) for estimating the mean of a normal population are further analyzed. Asymptotic properties of the regret and first two moments of the stopping rules are studied and second-order approximations are derived.