A Note on the Legendre Series Solution of the Biharmonic Equation for Cylindrical Problems

The solution of cylindrical problems is addressed. A series solution is considered of the biharmonic equation, in which the series terms of the stress function Φ are expressions based upon Legendre polynomials and logarithmically singular functions. An explicit form of a polynomial supplementing each logarithmically singular part of the series solution is obtained.     

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.     

超声雾化法制取金属粉末方法研究

本文介绍了利用超声振动能量制取超细金属粉末的超声雾化方法，提出了超声制粉雾化室，等离子枪，阴极、阳极喷咀及换能器振动系统的最佳尺寸和工作参数，给出了实验结果及制得的粉末显微结构照片．实验结果表明，用本文所述方法制得的金属粉末组成为：－80目粉占84呢，－120目粉占63．7啪，而用PREP方法制得的粉末分别占19．5％和11．7％，由此看来，用本方法制取超细金属粉，在粒度组成方面优于PREP方法．文中还对粉末冷却速度做了估算，得到了粉末平均冷却速度大于1×10_5k/5     

集值严格集-压缩映象的一致极限的不动点指数及其应用

在本文中,我们研究了一类集值严格集-压缩映象的一致极限映象.建立了这类一致极限映象的不动点指数理论,证明了某些正不动点定理.我们的定理推广了Fitzpatrick和Petryshyn的某些最近结果.     

波动方程反演问题的一种新的逼近方法

本文给出了一种求解波动方程反演问题的“多目标函数法”.这种方法简单、有效,并具有明确的物理意义.对于三维问题的程序化它有很强的优越性.     

A Lot-sizing Model for Just-in-time Manufacturing

We consider the problem of determining lot sizes of multiple items that are manufactured by a single capacitated facility. The manufacturing facility may represent a bottleneck processing activity on the shop floor or a storeroom that provides components to the shop floor. Items flow from the facility to a downstream facility, where they are assembled according to a specified mix. Just-in-time (JIT) manufacturing requires a balanced flow of items, in the proper mix, between successive facilities. Our model determines lot sizes of the various items based on available capacity and four attributes of each item: demand rate, holding cost, set-up time and processing time. Holding costs for each item accrue until the appropriate mix of items is available for shipment downstream. We develop a lot-sizing heuristic that minimizes total holding cost per time unit over all items, subject to capacity availability and the required mix of items.     

Developing and Maintaining an Equity Index Fund

An index fund is a portfolio of shares designed to replicate the investment performance of a market index. The index represents the behaviour of the market as a whole. This paper describes the selection of an index fund which minimizes expected tracking error. Using a multivariate model of returns on shares, a development of a univariate model by Taylor, the selection problem is formulated as a quadratic programme. The effects of various constraints on tracking error are demonstrated. Several policies for the readjustment of a fund are examined in the context of the differing objectives of fund managers. As a general rule, regular readjustment is shown to be a more expensive policy than irregular updating.     

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.     

基于改进U-Net的量子点STM图像分割

为提升量子点图像分割精度,降低特征识别误差,提出一种基于改进U-Net的量子点图像分割方法.首先,在预处理阶段,设计了以色彩通道为权值的灰度化算法,以提升后续分割效果.其次,在STM图像分割部分,在原始U-Net结构上引入中间过渡层以均衡网络各层特征.而后,建立数据集,并通过实验对比不同分割算法的精确度、召回率、F-measure.最后,将分割算法应用于量子点的特征识别,并测试了不同分割方式对应用的影响.实验结果显示,改进灰度化方法保留细节信息丰富,明显提升了量子点分割精度;改进U-Net的平均精确率、召回率、F-measure相较原始网络分别提升了13.83%、2.16%、8.13%.同时,实验数据表明由于分割精度的提升,量子点数量、纵横比等特征参数的识别更加精确.