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.     

Heat capacity of a five-coordinated iron(III) complex with spin S = 32, bromobis(N,N-diethyldithiocarbamato)iron(III), between 0.4 and 300 K

Heat capacity measurements have been made for six kinds of specimens prepared by different methods. Among them, Sample A exhibited a A-type ferromagnetic pahse transition at 1.347 K and a Schottky-type anomaly due to the zero-field splitting around 9K. The total entropy and enthalpy were (11.05 ± 0.04) J K^?1mol^?1 and (97.0 ± 0.4) J mol^?1, respectively. Sample B exhibited a Sehottky-type anomaly around 0.4 K due to the ferro-magnetic dimeric coupling with $\text{J}{}_{\mathrm{D}}\text{k}\text{= + 0.30}\text{K}$ as well as the Schottky-type anomaly at 9K. The total magnetic entropy and enthalpy were (11.45 ± 0.03) JK^?1 mol^?1 and (93.8 ± 0.8) J mol^?1, respectively. The remaining samples are simple mixtures of the λ-type modification and the dimeric modification. Irrespective of the magnetic behavior at low temperatures, all the samples showed a non-magnetic first-order phase transition around 270 K. The heat capacity and entropy of this phase transition have been accounted for in terms of the Frenkel theory of heterophase fluctuation. Construction of an adiabatic-type calorimeter workable between 1.5 and 393 K has been also presented.     

Computing simple circuits from a set of line segments

We address the problem of connecting line segments to form the boundary of a simple polygon—a simple circuit. However, not every set of segments can be so connected. We present anO(n logn)-time algorithm to determine whether a set of segments, constrained so that each segment has at least one endpoint on the boundary of the convex hull of the segments, admits a simple circuit. Furthermore, this technique can also be used to compute a simple circuit of minimum perimeter, or a simple circuit that bounds the minimum area, with no increase in computational complexity.     

On the dimension to represent a graph by a unit distance graph

It is proved that if a graphG has maximum degreed, then its vertices can be represented by distinct unit vectors inR ^2d so that two vectors are orthogonal if and only if the corresponding vertices are adjacent. As a corollary it follows that if a graph has maximum degreed, then it is isomorphic to a unit distance graph inR ^2d.     

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.     

A posteriori error estimates for optimal control problems governed by parabolic equations

Summary. In this paper, we derive a posteriori error estimates for the finite element approximation of quadratic optimal control problem governed by linear parabolic equation. We obtain a posteriori error estimates for both the state and the control approximation. Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive finite element approximation schemes for the control problem. Received July 7, 2000 / Revised version received January 22, 2001 / Published online January 30, 2002 RID="*" ID="*" Supported by EPSRC research grant GR/R31980