Specification methods for material-handling control algorithms in flexible manufacturing systems

Good methods are needed to specify, test, and debug material-handling control logic. This article surveys a number of representative methods for defining and describing control algorithms for programmable material-handling equipment used in flexible manufacturing systems. The methods are evaluated with regard to their suitability for communication between people and as bases for interfaces to automatic program generators. It is concluded that no single method is entirely satisfactory. Three methods (position diagrams, function block diagrams, and operation networks) have potential to be combined into an effective hybrid approach that minimizes the need for the user to switch between various conceptual models.     

Suggestions for the quantitative X-ray microanalysis of thin sections of frozen-dried and embedded biological tissues

When a microregion in a thin section of frozen-dried and embedded tissue is analysed by the conventional electron-probe X-ray continuum-normalization method, the measured quantity is in mmol of element per kg of embedded specimen. As each microregion contains an unknown amount of embedding medium, this quantity generally lies indeterminately somewhere within the wide range between mmol of element per kg of hydrated tissue and mmol of element per kg of dehydrated tissue. However, if a ‘tag’ element is incorporated in the embedding medium, the contribution of the medium to the local continuum count in each probed field should be measurable, and the X-ray data may then unambiguously yield mmol of element per kg of dehydrated tissue. This result should not be affected by shrinkage on freeze-drying or by incomplete replacement of water by embedding medium. The same X-ray data can additionally provide estimates of mmol of element per unit volume, mmol of element per kg of hydrated tissue and local dry-mass fraction. However, these estimates are subject to errors due to tissue shrinkage, incomplete replacement of water and beam damage.     

Specific interactions in blends containing Chitosan and functionalized polymers. Molecular dynamics simulations

Chitosan (CS)/poly(vinyl alcohol) (PVA) and Chitosan/poly(2-hydroxyethyl methacrylate) (P2HEM) blends have been studied through molecular dynamic simulations. In a previous work it was found miscibility between these polymers and it was attributed to hydrogen bonding formation. However, the experimental information obtained was not enough to know which of the interacting groups of Chitosan, i.e. -CH₂OH or -NH₂, are responsible of the interaction. Therefore, we have performed molecular dynamics simulation runs of 1 ns in order to calculate radial distribution functions (RDF) for the groups tentatively involved in the interaction. The results are correlated with our previous experimental data. This way, we have obtained a more precise conclusive information about the interactions involved as function of the blends composition. For low compositions of PVA and P2HEM the interaction is predominantly with the hydroxymethyl groups of CS while as the composition of PVA and P2HEM increases, the interaction with the amine groups increases.     

Representation of shift-invariant operators onL 2 byH ∞ transfer functions: An elementary proof,a generalization toL p,and a counterexample forL ∞

We give an elementary proof of the well-known fact that shift-invariant operators onL ²[0, ∞) are represented by transfer functions which are bounded and analytic on the right open half-plane. We prove a generalization to Banach space-valuedL ^p -functions, where 1≤p<∞. We show that the result no longer holds forp=∞. This research was supported partially by the Weizmann Fellowship, and partially by the Air Force Office of Scientific Research under Contract F49620-86-C-0111.     

关于Smarandache可乘函数的均值研究

本文的主要目的是利用初等方法研究Smarandache可乘函数在简单数集中的均值性质,并给出一个有趣的渐近公式。     

Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.     

Measuring consistency in TTL-based caches

We propose a general modeling framework to evaluate the performance of cache consistency algorithms. In addition to the usual hit rate, we introduce the hit^* rate as a consistency measure, which captures the fraction of non-stale downloads from the cache. We apply these ideas to the analysis of the fixed TTL consistency algorithm in the presence of network delays. The hit and hit^* rates are evaluated when requests and updates are modeled by renewal processes. Classical results on the renewal function lead to various bounds.     

A new stereological principle for test lines in three-dimensional space

A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples.     

Cycle detection using a stack

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.