Hierarchical Control of an Ammonia Reactor

An approach is presented for hierarchical control of an ammonia reactor, which is a key unit process in a nitrogen fertilizer complex. The aim of the control system is to ensure safe operation of the reactor around the optimal operating point in the face of process variable disturbances and parameter variations. The four different layers perform the functions of regulation, optimization, adaptation, and self-organization. The simulation for this proposed application is conducted on an AD511 hybrid computer in which the AD5 analog processor is used to represent the process and the PDP-11/ 35 digital computer is used for the implementation of control laws. Simulation results relating to the different layers have been presented.

Task assignment in a multiprocessor system

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.

A channel-aware, fast sub-channel to user assignment algorithm in OFDMA systems

Channel-aware assignment of sub-channels to users in the downlink of an OFDMA system demands extensive feedback of channel state information (CSI) to the base station. Since the feedback bandwidth is often very scarce, schemes that limit feedback are necessary. We develop a novel, low feedback splitting-based algorithm for assigning each sub-channel to its best user, i.e., the user with the highest gain for that sub-channel among all users. The key idea behind the algorithm is that, at any time, each user contends for the sub-channel on which it has the largest channel gain among the unallocated sub-channels. Unlike other existing schemes, the algorithm explicitly handles multiple access control aspects associated with the feedback of CSI. A tractable asymptotic analysis of a system with a large number of users helps design the algorithm. It yields 50% to 65% throughput gains compared to an asymptotically optimal one-bit feedback scheme, when the number of users is as small as 10 or as large as 1000. The algorithm is fast and distributed, and scales with the number of users.

Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes

We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures.

Assignment of fundamental vibrations of. ,N'-dimethylthiourea,

The infrared spectra of symmetric N,N′-dimethylthiourea (s-DMTU) and its N-deuterated (s-DMTU-d2) species have been measured. The fundamental frequencies have been assigned by comparison with the assignments in structurally related molecules and the infrared band shifts on N-deuteration, S-methylation, available Raman data and with the aid of theoretical band assignments from normal coordinate treatments for s-DMTU-d0 and -d2. A force field is derived for s-DMTU by transferring the force constants chiefly from N-methylthiourea and the subsequent refinement of the force constants by a least squares procedure.

Asymptotic behavior of a hierarchical system of learning automata

Learning automata arranged in a two-level hierarchy are considered. The automata operate in a stationary random environment and update their action probabilities according to the linear-reward- -penalty algorithm at each level. Unlike some hierarchical systems previously proposed, no information transfer exists from one level to another, and yet the hierarchy possesses good convergence properties. Using weak-convergence concepts it is shown that for large time and small values of parameters in the algorithm, the evolution of the optimal path probability can be represented by a diffusion whose parameters can be computed explicitly.

Fast Public Key Cryptosystem Based On Matrix Rings

A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.

A high yield synthesis of (±)-5,8-dimethoxy-2-α-hydroxyethyl-3,4-dihydronaphthalene, a key intermediate in anthracyclinone synthesis

The dimethoxytetralol gives on Vilsmeier reaction the dihydronaphthaldehyde (yield,92%), which on Grignard reaction with MeMgI affords the title compound (yield,�100%), the reactions constituting a high yield synthesis of this important anthracyclinone intermediate.

A hierarchical system of learning automata that can learn die globally optimal path

Systems of learning automata have been studied by various researchers to evolve useful strategies for decision making under uncertainity. Considered in this paper are a class of hierarchical systems of learning automata where the system gets responses from its environment at each level of the hierarchy. A classification of such sequential learning tasks based on the complexity of the learning problem is presented. It is shown that none of the existing algorithms can perform in the most general type of hierarchical problem. An algorithm for learning the globally optimal path in this general setting is presented, and its convergence is established. This algorithm needs information transfer from the lower levels to the higher levels. Using the methodology of estimator algorithms, this model can be generalized to accommodate other kinds of hierarchical learning tasks.

Bottleneck assignment problems under categorization

This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong to m distinct categories (m < n). Solving these special problems through the available branch and bound algorithms will result in a heavy computational burden. Sequentially identifying nonopitmal variables, this paper provides more efficient methods for those cases. Propositions leading to the algorithms have been established. Numerical examples illustrate the respective algorithms.

A Hierarchical System of Learning Automata

A learning automaton operating in a random environment updates its action probabilities on the basis of the reactions of the environment, so that asymptotically it chooses the optimal action. When the number of actions is large the automaton becomes slow because there are too many updatings to be made at each instant. A hierarchical system of such automata with assured c-optimality is suggested to overcome that problem.The learning algorithm for the hierarchical system turns out to be a simple modification of the absolutely expedient algorithm known in the literature. The parameters of the algorithm at each level in the hierarchy depend only on the parameters and the action probabilities of the previous level. It follows that to minimize the number of updatings per cycle each automaton in the hierarchy need have only two or three actions.

Infrared spectra of 1.3-dithiole-2-thione and its selenium analogues ând frequency assignment and molecular force constants

Infrared spectra of 1,3-dithiole-2-thione (DTT) and its four selenium analogues have been studied in the region 4000 to 20 cm�1. Assignment of all the fundamental frequencies was made by noting the band shifts on progressive selenation. Normal coordinate analysis procedures have been applied for both in-plane and out-of-plane vibrations to help the assignments. The Urey�Bradley force function supplemented with valence force constants for the out-of-plane vibrations was employed for coordinate calculations. A correlation of the infrared assignments of DTT with its different selenium analogues is accomplished. Further, the infrared assignments are compared with those of trithiocarbonate ion and its selenium analogues and other structurally related heterocyclic molecules.

CSSI-PRO: a method for secondary structure type editing, assignment and estimation in proteins using linear combination of backbone chemical shifts

Estimation of secondary structure in polypeptides is important for studying their structure, folding and dynamics. In NMR spectroscopy, such information is generally obtained after sequence specific resonance assignments are completed. We present here a new methodology for assignment of secondary structure type to spin systems in proteins directly from NMR spectra, without prior knowledge of resonance assignments. The methodology, named Combination of Shifts for Secondary Structure Identification in Proteins (CSSI-PRO), involves detection of specific linear combination of backbone H-1(alpha) and C-13' chemical shifts in a two-dimensional (2D) NMR experiment based on G-matrix Fourier transform (GFT) NMR spectroscopy. Such linear combinations of shifts facilitate editing of residues belonging to alpha-helical/beta-strand regions into distinct spectral regions nearly independent of the amino acid type, thereby allowing the estimation of overall secondary structure content of the protein. Comparison of the predicted secondary structure content with those estimated based on their respective 3D structures and/or the method of Chemical Shift Index for 237 proteins gives a correlation of more than 90% and an overall rmsd of 7.0%, which is comparable to other biophysical techniques used for structural characterization of proteins. Taken together, this methodology has a wide range of applications in NMR spectroscopy such as rapid protein structure determination, monitoring conformational changes in protein-folding/ligand-binding studies and automated resonance assignment.

A chitotetrose specific lectin from Luffa acutangula :Physico-chemical properties and the assignment of orientation of sugars in the lectin binding site

A chitooligosaccharide specific lectin (Luffa acutangula agglutinin) has been purified from the exudate of ridge gourd fruits by affinity chromatography on soybean agglutininglycopeptides coupled to Sepharose-6B. The affinity purified lectin was found homogeneous by polyacrylamide gel electrophoresis, in sodium dodecyl sulphate-polyacrylamide gels, by gel filtration on Sephadex G-100 and by sedimentation velocity experiments. The relative molecular weight of this lectin is determined to be 48,000 ± 1,000 by gel chromatography and sedimentation equilibrium experiments. The sedimentation coefficient (S20, w) was obtained to be 4·06 S. The Stokes’ radius of the protein was found to be 2·9 nm by gel filtration. In sodium dodecyl sulphate-polyacrylamide gel electrophoresis the lectin gave a molecular weight of 24,000 in the presence as well as absence of 2-mercaptoethanol. The subunits in this dimeric lectin are therefore held by non-covalent interactions alone. The lectin is not a glycoprotein and circular dichroism spectral studies indicate that this lectin has 31% α-helix and no ß-sheet. The lectin is found to bind specifically to chitooligosaccharides and the affinity of the lectin increases with increasing oligosaccharide chain length as monitored by near ultra-violetcircular dichroism and intrinsic fluorescence titration. The values of ΔG, ΔΗ and ΔS for the binding process showed a pronounced dependence on the size of the oligosaccharide. The values for both ΔΗ and ΔS show a significant increase with increase in the oligosaccharide chain length showing that the binding of higher oligomers is progressively more favoured thermodynamically than chitobiose itself. The thermodynamic data is consistent with an extended binding site in the lectin which accommodates a tetrasaccharide. Based on the thermodynamic data, blue shifts and fluorescence enhancement, spatial orientation of chitooligosaccharides in the combining site of the lectin is assigned.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.