An Incompressible Fluid in a Weakly Deformable Shell. Part I: Analysis of the Model

We consider the flow of a viscous incompressible fluid in a pipe when the boundary is a deformable shell of Naghdi type. We prove that the corresponding system of partial differential equations has a solution when the deformation of the shell is smooth and small enough. We propose an algorithm that uncouples the unknowns and prove its convergence.     

Nonlinear analysis of laser droplet generation by means of 0–1 test for chaos

We apply the recently improved version of the 0–1 test for chaos to real experimental time series of laser droplet generation process. In particular two marginal regimes of dripping are considered: spontaneous and forced dripping. The outcomes of the test reveal that both spontaneous and forced dripping time series can be characterized as chaotic, which coincides with the previous analysis based on nonlinear time series analysis.     

广义单纯形—中心设计I_(λ-)最优观测频数的一般解析表达式

本文引进发生函数矩阵与同构向量两个概念,利用它们讨论了与Scheffè单纯形—中心设计有关的0-1矩阵的一些性质。在I_(λ-)最优观测配置的分块算法的基础上,本文给出了q分量n阶广义单纯形—中心设计I_(λ-)最优观测频数的一般解析表达式。     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.     

基于数学形态学的表面原子熔融相的 STM图像识别算法

高温扫描隧道显微镜(HT-STM)可以实时原位地捕捉到表面原子的熔化相变过程.在这一原位变温实验中,快速可靠地识别出每帧STM图像中的熔融相十分关键.传统的手工统计方法存在效率低下、随意性大等问题.我们发展出一套基于数学形态学的算法,来自动快速地识别.与人工方法相比,该算法消除了人为主观误差,使确定的边界更加准确、光滑,处理效率提高了266倍.     

Lower Bounds for the Height and Size of the Ideal Class Group in CM-Fields

 We prove that, under the assumption of the Generalized Riemann Hypothesis, the exponent of the ideal class group of a CM-field goes to infinity with its absolute discriminant. This gives a positive answer to a question raised by Louboutin and Okazaki [4]. Received September 10, 2001; in revised form April 5, 2002     

OSCILLATORY SINGULAR INTEGRALS WITH VARIABLE ROUGH KERNEL,Ⅱ

Let n≥2. In this paper, the author establishes the L^2 (R^n)-boundedness of some oscillatory singular integrals with variable rough kernels by means of some estimates on hypergeometric functions and congqucnt hypergeometric funtions.