On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors

The microcommands constituting the microprogram of the control memory of a microprogrammed processor can be partitioned into a number of disjoint sets. Some of these sets are then encoded to minimize the word width of the ROM storing the microprogram. A further reduction in the width of the ROM words can be achieved by a technique known as bit steering where one or more bits are shared by two or more sets of microcommands. These sets are called the steerable sets. This correspondence presents a simple method for the detection and encoding of steerable sets. It has been shown that the concurrency matrix of two steerable sets exhibits definite patterns of clusters which can be easily recognized. A relation "connection" has been defined which helps in the detection of three-set steerability. Once steerable sets are identified, their encoding becomes a straightforward procedure following the location of the identifying clusters on the concurrency matrix or matrices.

Fast FIR Algorithms for the Continuous Wavelet Transform From Constrained Least Squares

New algorithms for the continuous wavelet transform are developed that are easy to apply, each consisting of a single-pass finite impulse response (FIR) filter, and several times faster than the fastest existing algorithms. The single-pass filter, named WT-FIR-1, is made possible by applying constraint equations to least-squares estimation of filter coefficients, which removes the need for separate low-pass and high-pass filters. Non-dyadic two-scale relations are developed and it is shown that filters based on them can work more efficiently than dyadic ones. Example applications to the Mexican hat wavelet are presented.

Constrained linear minimax filter for systems with large plant uncertainties

This paper presents a method of designing a minimax filter in the presence of large plant uncertainties and constraints on the mean squared values of the estimates. The minimax filtering problem is reformulated in the framework of a deterministic optimal control problem and the method of solution employed, invokes the matrix Minimum Principle. The constrained linear filter and its relation to singular control problems has been illustrated. For the class of problems considered here it is shown that the filter can he constrained separately after carrying out the mini maximization. Numorieal examples are presented to illustrate the results.

Minimization of Incompletely Specified Sequential Machines

A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSMs) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover is further reduced by a consideration of the maximal compatibles (MC's) only; as a result the method converges to the solution faster than the existing procedures. "Rank" of a compatible is defined. It is shown that ordering the compatibles, in accordance with their rank, reduces the number of comparisons to be made in the search for exclusion of compatibles. The new method is simple, systematic, and programmable. It does not involve any heuristics or intuitive procedures. For small- and medium-sized machines, it canle used for hand computation as well. For one of the illustrative examples used in this paper, 30 out of 40 compatibles can be ignored in accordance with the proposed rules and the remaining 10 compatibles only need be considered for obtaining a minimal solution.

Studies on Rat Ovarian Receptors for Lutropin (Luteinizing Hormone): Applicability of radioimmunoassay to measure lutropin bound to receptors.

Measurement of receptor-bound unlabelled physiologically active lutropin (luteinizing hormone, LH) was possible by a modified radioimmunoassay. The conventional radioimmunoassayconducted at 4°C was inadequate, whereas the modified assay performed at 37'C could measure receptor-bound lutropin. The radioimmunoassay at 37'C takes only 36h for completion compared with 5-7 days at 4°C. The sensitivity and range of dose-response curves are, however, unaltered. The validity of the technique was established by a number of criteria.

Power Aware Real Time Scheduling in Constrained Devices

Real-time scheduling algorithms, such as Rate Monotonic and Earliest Deadline First, guarantee that calculations are performed within a pre-defined time. As many real-time systems operate on limited battery power, these algorithms have been enhanced with power-aware properties. In this thesis, 13 power-aware real-time scheduling algorithms for processor, device and system-level use are explored.

Traces of settlement in Bound Brook, N.J.

Digital image

Constrained linear filter and its relation to singular optimal control

This paper presents an analysis of an optimal linear filter in the presence of constraints on the moan squared values of the estimates from the viewpoint of singular optimal control. The singular arc has been shown to satisfy the generalized Legcndrc-Clebseh condition and Jacobson's condition. Both the cases of white measurement noise and coloured measurement noise are considered. The constrained estimate is shown to be a linear transformation of the unconstrained Kalman estimate.

Lower Bound Limit Analysis of Rectangular Slabs

A general method for the development of valid lower bound solutions to uniformly distributed and orthotropically reinforced rectangular concrete slabs obeying normal moment criterion is described. General expressions for moment field have been obtained for nine cases of slabs having all combinations of simply supported and clamped-edge conditions. The lower bound collapse loads have been compared with the upper bound values obtained by the yield line theory. The paper also focuses attention to the need for the development of valid upper bound solutions with the satisfaction of kinematical admissibility and the flow rules associated with the normal moment criterion.

A deadline-constrained 802.11 MAC Protocol with QoS differentiation for soft real-time control

As one of the most widely used wireless network technologies, IEEE 802.11 wireless local area networks (WLANs) have found a dramatically increasing number of applications in soft real-time networked control systems (NCSs). To fulfill the real-time requirements in such NCSs, most of the bandwidth of the wireless networks need to be allocated to high-priority data for periodic measurements and control with deadline requirements. However, existing QoS-enabled 802.11 medium access control (MAC) protocols do not consider the deadline requirements explicitly, leading to unpredictable deadline performance of NCS networks. Consequentially, the soft real-time requirements of the periodic traffic may not be satisfied, particularly under congested network conditions. This paper makes two main contributions to address this problem in wireless NCSs. Firstly, a deadline-constrained MAC protocol with QoS differentiation is presented for IEEE 802.11 soft real-time NCSs. It handles periodic traffic by developing two specific mechanisms: a contention-sensitive backoff mechanism, and an intra-traffic-class QoS differentiation mechanism. Secondly, a theoretical model is established to describe the deadline-constrained MAC protocol and evaluate its performance of throughput, delay and packet-loss ratio in wireless NCSs. Numerical studies are conducted to validate the accuracy of the theoretical model and to demonstrate the effectiveness of the new MAC protocol.

State Minimization of Incompletely Specified Sequential Machines

A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.

Conformational Choices for the Stereochemically Constrained gamma-Amino Acid Residue Gabapentin: Theoretical Studies and Correlation With Experimental Results

Gabapentin (1-aminomethylcyclohexaneacetic acid, Gpn) is an achiral, conformationally constrained gamma amino acid residue. A survey of available crystal structures of Gpn peptides reveals that the torsion angles about the C-gamma-C-beta (theta(1)) and C-beta-C-alpha(theta(2)) bonds are overwhelmingly limited to gauche, gauche (g(+)g(+)/g(-)g(-)) conformations. The Gpn residue forms C-7 and C-9 hydrogen bonds in which the donor and acceptor atoms come from the flanking peptide units. In combination with alpha amino acid residues alpha gamma and gamma alpha segments can adopt C-12 hydrogen bonded structures. The conformational choices available to the Gpn residue have been probed using energy calculations, adopting a grid search strategy. Ramachandran phi-psi maps have been constructed for fixed values of theta(1) and theta(2), corresponding to the gauche and trans conformations. The sterically allowed and energetically favorable regions of conformational space have been defined and experimental observations compared. C-7 and C-9 hydrogen bonded conformational families have been identified using a grid search approach in which theta(1) and theta(2) values are varied over a range of +/- 10 degrees about ideal values at 1 degrees intervals. The theoretical analysis together with experimental observations for 59 Gpn residues from 35 crystal structures permits definition of the limited range of conformational possibilities at this gamma amino acid residue. .