Real-World Extensions To Scheduling Algorithms Based On Lagrangian Relaxation

Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology to handle multiple classes of jobs, taking into account setup times and setup costs, The proposed methodology uses Lagrangian relaxation and simulated annealing in a hybrid framework, In the second part of the paper, we consider a Lagrangian relaxation based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing system with centralized material handling.

Real-time simulation of electrical machines on FPGA platform

This paper presents real-time simulation models of electrical machines on FPGA platform. Implementation of the real-time numerical integration methods with digital logic elements is discussed. Several numerical integrations are presented. A real-time simulation of DC machine is carried out on this FPGA platform and important transient results are presented. These results are compared to simulation results obtained through a commercial off-line simulation software.

Inhibition of 3-hydroxy-3-methylglutaryl coenzyme a reductase by cytosolic proteins - real or artifact

The inhibitory effect of FeSO4-dependent cytosolic protein on microsomal HMGCoA reductase is on the enzyme activity and not an artifact of loss of the product, mevalonate, through phosphorylation, unlike that of ATP.Mg effect.

Performance modelling of a fault-tolerant real-time multiprocessor using stochastic Petri nets

The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault- tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.

Superfluid vacuum carrying real Einstein-de Broglie waves

An earlier superfluid aether model pairing fermionic and antifermionic fields is invoked to explain Rauch's time dependent neutron interference results which now suggest that microobjects are waves and particles simultaneously. The covariant superfluid provides a medium which carries real Einstein-de Broglie “pilot” waves. Further consequences are discussed.

Real-fluid effects in flow cavitation

The possible role of reaj fluid effects in two aspects of flow cavitation namely inception and separation is discussed. This is primarily qualitative in the case of inception whereas some quantitative results are presented in the case of separation. Existing evidence clearly indicates that in particular viscous effects can play a significant role in determining the conditions for cavitation inception and in determining the location of cavitation separation from smooth bodies.

Rapid in situ processing for real-time holographic interferometry

Experiments are described which show that a monobath can be used for rapid in situ processing in a liquid gate for real-time holographic interferometry. This also permits utilization of a very simple solution handling system. Changes in emulsion thickness are reduced to an acceptable level and problems of matching refractive indices are eliminated by exposing and viewing the holograms in water. Excellent null patterns are obtained and real-time holographic interferometry can be carried out over long periods of time.

The real area of contact and compliance of rough cylinders in compression

Bearing area analysis has been used to study the real area of contact and compliance of rough turned steel cylinders in compression. Calculations show that the elastic real area of contact is very small compared to the plastic real area of contact, and that local compliance due to flattening of asperity tips is a small proportion of the total compliance obtained from experiments. The fact that increased load brings more and more new asperities under load rather than enlarging the contact spots leads to a rather simple load-compliance relation for a rough cylinder, viz., W' = Nh · K1δn, where W0 = K1δn defines the load-compliance relation of the individual asperities, and Nh represents the number of asperities bearing the load.

real area of contact and compliance of rough cylinders in compression

Bearing area analysis has been used to study the real area of contact and compliance of rough turned steel cylinders in compression. Calculations show that the elastic real area of contact is very small compared to the plastic real area of contact, and that local compliance due to flattening of asperity tips is a small proportion of the total compliance obtained from experiments. The fact that increased load brings more and more new asperities under load rather than enlarging the contact spots leads to a rather simple load-compliance relation for a rough cylinder, viz., W' = Nh · K1δn, where W0 = K1δn defines the load-compliance relation of the individual asperities, and Nh represents the number of asperities bearing the load.

A real-time algorithm for simulation of flexible objects and hyper-redundant manipulators

Flexible objects such as a rope or snake move in a way such that their axial length remains almost constant. To simulate the motion of such an object, one strategy is to discretize the object into large number of small rigid links connected by joints. However, the resulting discretised system is highly redundant and the joint rotations for a desired Cartesian motion of any point on the object cannot be solved uniquely. In this paper, we revisit an algorithm, based on the classical tractrix curve, to resolve the redundancy in such hyper-redundant systems. For a desired motion of the `head' of a link, the `tail' is moved along a tractrix, and recursively all links of the discretised objects are moved along different tractrix curves. The algorithm is illustrated by simulations of a moving snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator. The simulations show that the tractrix based algorithm leads to a more `natural' motion since the motion is distributed uniformly along the entire object with the displacements diminishing from the `head' to the `tail'.

Conflict-Tolerant Real-Time Features

This paper addresses the problem of detecting and resolving conflicts due to timing constraints imposed by features in real-time systems. We consider systems composed of a base system with multiple features or controllers, each of which independently advise the system on how to react to input events so as to conform to their individual specifications. We propose a methodology for developing such systems in a modular manner based on the notion of conflict tolerant features that are designed to continue offering advice even when their advice has been overridden in the past. We give a simple priority based scheme for composing such features. This guarantees the maximal use of each feature. We provide a formal framework for specifying such features, and a compositional technique for verifying systems developed in this framework.

Real Theta Characteristics And Automorphisms Of A Real Curve

Let X be a geometrically irreductble smooth projective cruve defined over R. of genus at least 2. that admits a nontrivial automorphism, sigma. Assume that X does not have any real points. Let tau be the antiholomorphic involution of the complexification lambda(C) of X. We show that if the action of sigma on the set S(X) of all real theta characteristics of X is trivial. then the order of sigma is even, say 2k and the automorphism tau o (sigma) over cap (lambda) of X-C has a fixed point, where (sigma) over cap is the automorphism of X x C-R defined by sigma We then show that there exists X with a real point and admitting a nontrivial automorphism sigma, such that the action of sigma on S(X) is trivial, while X/ not equal P-R(1) We also give an example of X with no real points and admitting a nontrivial automorphisim sigma such that the automorphism tau o (sigma) over cap (lambda) has a fixed point, the action of sigma on S(X) is trivial, and X/ not equal P-R(1)

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different source- destination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.