On Decomposition Theorems for Hardy Spaces on Domains in ℂn and Applications

Hardy spaces of analytic functions are studied both on strongly pseudoconvex domains in ℂⁿ and on domains of finite type in ℂ². Duality theorems, atomic decompositions, and factorization of functions are treated. Mapping properties of certain Hankel operators are studied.     

Molecular deposition film of porphyrin and phthalocyanine bearing oppositely charged substituents

Ｔｈｅｆｏｒｍａｔｉｏｎｏｆａｎｅｗｔｙｐｅｏｆｓｅｌｆ＿ａｓｓｅｍｂｌｅｄｍｕｌｔｉｌａｙｅｒｆｉｌｍｓ,ｍｏｌｅｃｕｌａｒｄｅｐｏｓｉｔｉｏｎ(ＭＤ)ｆｉｌｍｓ[1,2],ｉｓａｆａｓｔｄｅｖｅｌｏｐｉｎｇａｒｅａｏｆｔｈｉｎｆｉｌｍｒｅｓｅａｒｃｈ.Ｔｈｉｓｎｅｗｍｅｔｈｏｄｏｆｆｉｌｍｐｒｅｐａｒａｔｉｏｎｉｓｂａｓｅｄｏｎｉｏｎｉｃａｔｔｒａｃｔｉｏｎｂｅｔｗｅｅｎｏｐｐｏｓｉｔｅｃｈａｒｇｅｄｃｈｒｏｍｏｐｈｏｒｅｓ.ＩｎｃｏｍｐａｒｉｓｏｎｗｉｔｈｔｈｅｃｌａｓｓｉｃＬａｎｇｍｕｉｒ＿Ｂｌｏ…     

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.     

High-precision Monte Carlo test of the conformai-invariance predictions for two-dimensional mutually avoiding walks

Let _l be the critical exponent associated with the probability thatl independentN-step ordinary random walks, starting at nearby points, are mutually avoiding. Using Monte Carlo methods combined with a maximum-likelihood data analysis, we find that in two dimensions ₂=0.6240±0.0005±0.0011 and ₃=1.4575±0.0030±0.0052, where the first error bar represents systematic error due to corrections to scaling (subjective 95% confidence limits) and the second error bar represents statistical error (classical 95% confidence limits). These results are in good agreement with the conformal-invariance predictions ₂=5/8 and ₃=35/24.     

Picosecond four-wave mixing reflectivity of GaAs at 1.06 μm

The picosecond degenerate four-wave mixing reflectivity of semi-insulating gallium arsenide at 1.06 m is calculated in this paper. The dependence of the reflectivity on the pump and signal fluences is measured. Reflectivities of more than one are possible. The Fourier components of the excited-carrier densities are calculated as a function of the pump fluence. The wavefront-correction property of this reflectivity is demonstrated with a lens group in the signal beam.     

On the Role of Mixed Strategies in Elementary Decision Analysis and Related Decision-Support-System Treatments

We first demonstrate that mixed strategies are relevant in decision analysis for a maximin decision-maker quite apart from any game-theory considerations. This rectifies the apparent misconception that results from MS/OR textbooks which discuss mixed strategies only in the game-theory setting. Next we show an example of an implementable mixed strategy, by which we mean a mixed decision strategy which does not require randomization for its implementation. This application is to portfolio construction.