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.

Investigation of Missile-Shaped Body with Forward-Facing Cavity at Mach 8

A blunt-nosed hypersonic missile mounted with a forward-facing cavity is a good alternative to reduce the stagnation heating rates. The effects of a forward-racing cavity on heat transfer and aerodynamic coefficients are addressed in this paper. Tests were carried out in hypersonic shock tunnel HST2, at a hypersonic Mach number of 8 using a 41 deg apex-angle blunt cone. The aerodynamic forces on the test model with and without a forward-facing cavity at various angles of attack are measured by using an internally mountable accelerometer force balance system. Heat flux measurements have been carried out on the test model with and without a forward-facing cavity of the entire surface at zero degree angle of attack with platinum sensors. A numerical simulation was also carried out using the computational fluid dynamics code (CFX-Ansys 5.7). An important result of this study is that the smaller cavity diameter has the highest lift-to-drag ratio, whereas the medium cavity has the highest heat flux reduction. Theshock structure around the test model has also been visualized using the Schlieren flow visualization technique. The visualized shock structure and the measured aerodynamic forces on the missile-shaped body with cavity configurations agree well with the axisymmetric numerical simulations.

Large carrier mobilities in octathio[8]circulene crystals: a theoretical study

The electron and hole mobilities of octathio[8]circulene (sulflower) crystal have been calculated using quantum chemical methods, with accurate determination of reorganization energies and the rate of charge transfer, the key parameters controlling the charge carriers conductance. We find this molecular crystal to be an excellent conductor with large mobilities for both the charge carriers. Moreover, the hole mobility is found to be slightly larger than the electron mobility. Such an ambipolar organic crystal with substantial carrier mobilities shows possibilities of sophisticated device fabrication in advanced electronics.

Optimal Parameter Trajectory Estimation in Parameterized SDEs: An Algorithmic Procedure

We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.

Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers

Sets of multivalued dependencies (MVDs) having conflict-free covers are important to the theory and design of relational databases [2,12,15,16]. Their desirable properties motivate the problem of testing a set M of MVDs for the existence of a confiict-free cover. In [8] Goodman and Tay have proposed an approach based on the possible equivalence of M to a single (acyclic) join dependency (JD). We remark that their characterization does not lend an insight into the nature of such sets of MVDs. Here, we use notions that are intrinsic to MVDs to develop a new characterization. Our approach proceeds in two stages. In the first stage, we use the notion of “split-free” sets of MVDs and obtain a characterization of sets M of MVDs having split-free covers. In the second, we use the notion of “intersection” of MVDs to arrive at a necessary and sufficient condition for a split-free set of MVDs to be conflict-free. Based on our characterizations, we also give polynomial-time algorithms for testing whether M has split-free and conflict-free covers. The highlight of our approach is the clear insight it provides into the nature of sets of MVDs having conflict-free covers. Less emphasis is given in this paper to the actual efficiency of the algorthms. Finally, as a bonus, we derive a desirable property of split-free sets of MVDs,thereby showing that they are interesting in their own right.

Structure of (6S,13bR)-1,2,3,5,6,13b-hexahydro-6-isopropyl-8H-pyrrolo[1',2':1,2]pyrazino[3,4,-b]quinazoline-5,8-dione

C17H19N302, monoclinic, P21, a = 5.382 (1), b = 17.534(4), c = 8.198(1)/L ,8 = 100.46(1) °, Z= 2, d,, = 1.323, dc= 1.299 Mg m-3, F(000) = 316, /~(Cu .Ka) = 0.618 mm -1. R = 0.052 for 1284 significant reflections. The proline-containing cispeptide unit which forms part of a six-membered ring deviates from perfect planarity. The torsion angle about the peptide bond is 3.0 (5) ° and the peptide bond length is 1.313 (5)A. The conformation of the proline ring is Cs-Cf~-endo. The crystal structure is stabilized by C-H... O interactions.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Structure of 2-(2,6-dimethoxyphenyl)-2,5- dimethylbicyclo[3.2.1]octane-6,8-dione

C18H2204, orthorhombic, P212~21, a = 7.343 (4), b = 11.251 (4), c = 19.357 (4)A, Z = 4, Dr, ' = 1.20, D e = 1.254 g cm -3, F(000) = 648, p(MoKa) = 0.94 cm -~. X-ray intensity data were collected on a Nonius CAD-4 diffractometer and the structure was solved by direct methods. Full-matrix least-squares refinement gave R = 0.052 (R w = 0.045) for 1053 observed reflections. The stereochemical configuration at C(2) has been shown to be 2-exo-methyl-2-endo-(2,6-dimethoxyphenyl), i.e. (3) in contrast to the structure (2) assigned earlier based on its ~H NMR data.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Immunological studies on nucleic acids and their components.8.Antibodies specific to a deoxyribotrinucleotide sequence

Bovine serum albumin conjugates of two trinucleotides, dpTpTpA and dTpTpAp, were prepared by linking the trinucleotides through their end phosphates by the ‘carbodiimide method’. Antibodies were raised in rabbits by injecting the trinucleotide-bovine serum albumin conjugates. Analysis by double diffusion in agar gel, quantitative precipitin reaction and its inhibition by haptens showed clearly the presence of antibodies specific to the whole trinucleotide molecule. The titre of antibodies obtained by the trinucleotide-rabbit serum albumin conjugates with their respective antisera was approximately the same, indicating that linking the trinucleotide through either 5′ or 3′ phosphate does not have an appreciable effect on the titre of antibodies. The results also demonstrate that the nucleotide(s) away from the carrier protein is more immunodominant than the one linked directly to the protein.

An interactive graphics system for 2-D drawing and design

This paper is about a software system, GRASS-Graphic Software System for 2-D drawing and design—which has been implemented on a PDP-11/35 system with RSX-11M operating system. It is a low cost interactive graphics system for the design of two dimensional drawings and uses a minimum of hardware. It provides comprehensive facilities for creating, editing, storing and retrieving pictures. It has been implemented in the language Pascal and has the potential to be used as a powerful data-imputting tool for a design-automation system. The important features of the system are its low cost, software character generation and a user-trainable character recognizer, which has been included.

Computer simulation of polytypes

Polytypes have been simulated, treating them as analogues of a one-dimensional spin-half Ising chain with competing short-range and infinite-range interactions. Short-range interactions are treated as random variables to approximate conditions of growth from melt as well as from vapour. Besides ordered polytypes up to 12R, short stretches of long-period polytypes (up to 33R) have been observed. Such long-period sequences could be of significance in the context of Frank's theory of polytypism. The form of short-range interactions employed in the study has been justified by carrying out model potential calculations.

Chlorinated Hypoelectronic Dimetallaborane Clusters: Synthesis, Characterization, and Electronic Structures of (eta(5)-C5Me5W)(2)B5HnClm (n=7, m=2 and n=8, m=1)

Pyrolysis of (eta(5)-C5Me5WH3)B4H8, 1, in the presence of excess BHCl2 center dot SMe2 in toluene at 100 degrees C led to the isolation of (eta(5)-C5Me5W)(2)B5H9, 2, and B-Cl inserted (eta(5)-C5Me5W)(2)B5H8Cl, 3, and (eta(5)-C5Me5W)(2)B5H7Cl2, (four isomers). All the Chlorinated tungstaboranes were isolated as red and air and moisture sensitive solids. These new compounds have been characterized in solution by H-1, B-11, C-13 NMR, and the structural types were unequivocally established by crystallographic analysis of compounds 3, 4, and 7. Density functional theory (DFT) calculations were carded out on the model molecules of 3-7 to elucidate the actual electronic structures of these chlorinated species. On grounds of DFT calculations we demonstrated the role of transition metals, bridging hydrogens, and the effect of electrophilic substitution of hydrogens at B-H vertices of metallaborane structures.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.