A parallel-serial binary arbitration scheme for collision-free multi-access techniques

Multi-access techniques are widely used in computer networking and distributed multiprocessor systems. On-the-fly arbitration schemes permit one of the many contenders to access the medium without collisions. Serial arbitration is cost effective but is slow and hence unsuitable for high-speed multiprocessor environments supporting very high data transfer rates. A fully parallel arbitration scheme takes less time but is not practically realisable for large numbers of contenders. In this paper, a generalised parallel-serial scheme is proposed which significantly reduces the arbitration time and is practically realisable.

Parallel packing of alpha-helices in crystals of the zervamicin IIA analog Boc-Trp-Ile-Ala-Aib-Ile-Val-Aib-Leu-Aib-Pro-OMe.2H2O.

An apolar synthetic analog of the first 10 residues at the NH2-terminal end of zervamicin IIA crystallizes in the triclinic space group P1 with cell dimensions a = 10.206 +/- 0.002 A, b = 12.244 +/- 0.002 A, c = 15.049 +/- 0.002 A, alpha = 93.94 +/- 0.01 degrees, beta = 95.10 +/- 0.01 degrees, gamma = 104.56 +/- 0.01 degrees, Z = 1, C60H97N11O13 X 2H2O. Despite the relatively few alpha-aminoisobutyric acid residues, the peptide maintains a helical form. The first intrahelical hydrogen bond is of the 3(10) type between N(3) and O(0), followed by five alpha-helix-type hydrogen bonds. Solution 1H NMR studies in chloroform also favor a helical conformation, with seven solvent-shielded NH groups. Continuous columns are formed by head-to-tail hydrogen bonds between the helical molecules along the helix axis. The absence of polar side chains precludes any lateral hydrogen bonds. Since the peptide crystallizes with one molecule in a triclinic space group, aggregation of the helical columns must necessarily be parallel rather than antiparallel. The packing of the columns is rather inefficient, as indicated by very few good van der Waals' contacts and the occurrence of voids between the molecules.

BSDD-2.0: Biomolecules Segment Display Device - An updated web accessible computing resource

The existing internet computing resource, Biomolecules Segment Display Device (BSDD), has been updated with several additional useful features. An advanced option is provided to superpose the structural motifs obtained from a search on the Protein Data Bank (PDB) in order to see if the three-dimensional structures adopted by identical or similar sequence motifs are the same. Furthermore, the options to display structural aspects like inter- and intra-molecular interactions, ion-pairs, disulphide bonds, etc. have been provided.The updated resource is interfaced with an up-to-date copy of the public domain PDB as well as 25 and 90% non-redundant protein structures. Further, users can upload the three-dimensional atomic coordinates (PDB format) from the client machine. A free molecular graphics program, JMol, is interfaced with it to display the three-dimensional structures.

Phased-Mission Analysis for Evaluating the Effectiveness of Aerospace Computing-Systems

Effectiveness evaluation of aerospace fault-tolerant computing systems used in a phased-mission environment is rather tricky and difficult because of the interaction of its several degraded performance levels with the multiple objectives of the mission and the use environment. Part I uses an approach based on multiobjective phased-mission analysis to evaluate the effectiveness of a distributed avionics architecture used in a transport aircraft. Part II views the computing system as a multistate s-coherent structure. Lower bounds on the probabilities of accomplishing various levels of performance are evaluated.

Note on the stability of parallel magnetic fields

The stability characteristics of parallel magnetic fields when fluid motions are present along the lines of force is studied. The stability criterion for both symmetric (m=0) and asymmetric (m=1) modes are discussed and the results obtained by Trehan and Singh (1978) are amended in the present study. The results obtained for the cylindrical geometry are shown to play an important role forka<4, wherek is the wave number,a is the radius of the cylinder, compared to the results obtained by Geronicolas (1977) for the slab geometry.

Natural frequencies of rectangular orthotropic plates with a pair of parallel edges simply supported

Solutions of the exact characteristic equations for the title problem derived earlier by an extension of Bolotin's asymptotic method are considered. These solutions, which correspond to flexural modes with frequency factor, R, greater than unity, are expressed in convenient forms for all combinations of clamped, simply supported and free conditions at the remaining pair of parallel edges. As in the case of uniform beams, the eigenvalues in the CC case are found to be equal to those of elastic modes in the FF case provided that the Kirchoff's shear condition at a free edge is replaced by the condition. The flexural modes with frequency factor less than unity are also investigated in detail by introducing a suitable modification in the procedure. When Poisson's ratios are not zero, it is shown that the frequency factor corresponding to the first symmetric mode in the free-free case is less than unity for all values of side ratio and rigidity ratios. In the case of one edge clamped and the other free it is found that modes with frequency factor less than unity exist for certain dimensions of the plate—a fact hitherto unrecognized in the literature.

Novel Biginelli dihydropyrimidines with potential anticancer activity: A parallel synthesis and CoMSIA study

Novel Biginelli dihydropyrimidines of biological interest were prepared using p-toluene sulphonic acid as an efficient catalyst. All the thirty-two synthesised dihydropyrimidines were evaluated for their in vitro antioxidant activity using DPPH method. Only, compounds 28 and 29 exhibited reasonably good antioxidant activity. Furthermore, the synthesised Biginelli compounds were subjected for their in vitro anticancer activity against MCF-7 human breast cancer cells. The title compounds were tested at the concentration of 10 μg. Compounds exhibited activity ranging from weak to moderate and, from moderate to high in terms of percentage cytotoxicity. Among them, compounds 10 and 11 exhibited significant anticancer activity. In order to elucidate the three-dimensional structure–activity relationships (3D QSAR) towards their anticancer activity, we subjected them for comparative molecular similarity indices analysis (CoMSIA). Illustration regarding their synthesis, analysis, antioxidant activity, anticancer activity and 3D QSAR study is described.

Ant colony optimization for reporting cell planning in mobile computing using selective paging strategy

Location management problem that arise in mobile computing networks is addressed. One method used in location management is to designate sonic of the cells in the network as "reporting cells". The other cells in the network are "non-reporting cells". Finding an optimal set of reporting cells (or reporting cell configuration) for a given network. is a difficult combinatorial optimization problem. In fact this is shown to be an NP-complete problem. in an earlier study. In this paper, we use the selective paging strategy and use an ant colony optimization method to obtain the best/optimal set of reporting cells for a given a network.

Optimal iterative schemes for computing the Moore-Penrose matrix inverse

Among the iterative schemes for computing the Moore — Penrose inverse of a woll-conditioned matrix, only those which have an order of convergence three or two are computationally efficient. A Fortran programme for these schemes is provided.

Self-image (autoidolon) techniques for the realisation of optical computing type operations

Abstract is not available.

Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses

A rank-augmnented LU-algorithm is suggested for computing a generalized inverse of a matrix. Initially suitable diagonal corrections are introduced in (the symmetrized form of) the given matrix to facilitate decomposition; a backward-correction scheme then yields a desired generalized inverse.

Observation of a mixed antiparallel and parallel beta-sheet motif in the crystal structure of Boc-Ala-Ile-Aib-OMe

A diastereomeric mixture of the tripeptide Boc-Ala-Ile-Aib-OMe crystallized in the space group P1 from CH3OH/H2O. The unit cell parameters are a = 10.593(2) A, b = 14.377(3) A, c = 17.872(4) A, alpha = 104.41(2) degrees, beta = 90.55(2) degrees, gamma = 106.91(2) degrees, V = 2512.4 A3, Z = 4. X-Ray crystallographic studies show the presence of four molecules in the asymmetric unit consisting of two pairs of diastereomeric peptides, Boc-L-Ala-L-Ile-Aib-OMe and Boc-L-Ala-D-Ile-Aib-OMe. The four molecules in the asymmetric unit form a rarely found mixed antiparallel and parallel beta-sheet hydrogen bond motif. The Ala and (L,D)-Ile residues in all the four molecules adopt the extended conformations, while the phi, psi values of the Aib residues are in the right-handed helical region. In one of the molecules the Ile sidechain adopts the unusual gauche conformation about the C beta-C gamma bond.

Redefine: Runtime Reconfigurable Polymorphic ASIC

Emerging embedded applications are based on evolving standards (e.g., MPEG2/4, H.264/265, IEEE802.11a/b/g/n). Since most of these applications run on handheld devices, there is an increasing need for a single chip solution that can dynamically interoperate between different standards and their derivatives. In order to achieve high resource utilization and low power dissipation, we propose REDEFINE, a polymorphic ASIC in which specialized hardware units are replaced with basic hardware units that can create the same functionality by runtime re-composition. It is a ``future-proof'' custom hardware solution for multiple applications and their derivatives in a domain. In this article, we describe a compiler framework and supporting hardware comprising compute, storage, and communication resources. Applications described in high-level language (e.g., C) are compiled into application substructures. For each application substructure, a set of compute elements on the hardware are interconnected during runtime to form a pattern that closely matches the communication pattern of that particular application. The advantage is that the bounded CEs are neither processor cores nor logic elements as in FPGAs. Hence, REDEFINE offers the power and performance advantage of an ASIC and the hardware reconfigurability and programmability of that of an FPGA/instruction set processor. In addition, the hardware supports custom instruction pipelining. Existing instruction-set extensible processors determine a sequence of instructions that repeatedly occur within the application to create custom instructions at design time to speed up the execution of this sequence. We extend this scheme further, where a kernel is compiled into custom instructions that bear strong producer-consumer relationship (and not limited to frequently occurring sequences of instructions). Custom instructions, realized as hardware compositions effected at runtime, allow several instances of the same to be active in parallel. A key distinguishing factor in majority of the emerging embedded applications is stream processing. To reduce the overheads of data transfer between custom instructions, direct communication paths are employed among custom instructions. In this article, we present the overview of the hardware-aware compiler framework, which determines the NoC-aware schedule of transports of the data exchanged between the custom instructions on the interconnect. The results for the FFT kernel indicate a 25% reduction in the number of loads/stores, and throughput improves by log(n) for n-point FFT when compared to sequential implementation. Overall, REDEFINE offers flexibility and a runtime reconfigurability at the expense of 1.16x in power and 8x in area when compared to an ASIC. REDEFINE implementation consumes 0.1x the power of an FPGA implementation. In addition, the configuration overhead of the FPGA implementation is 1,000x more than that of REDEFINE.

Computing magnetic anisotropy constants of single molecule magnets

We present here a theoretical approach to compute the molecular magnetic anisotropy parameters, D (M) and E (M) for single molecule magnets in any given spin eigenstate of exchange spin Hamiltonian. We first describe a hybrid constant M (S) valence bond (VB) technique of solving spin Hamiltonians employing full spatial and spin symmetry adaptation and we illustrate this technique by solving the exchange Hamiltonian of the Cu6Fe8 system. Treating the anisotropy Hamiltonian as perturbation, we compute the D (M)and E(M) values for various eigenstates of the exchange Hamiltonian. Since, the dipolar contribution to the magnetic anisotropy is negligibly small, we calculate the molecular anisotropy from the single-ion anisotropies of the metal centers. We have studied the variation of D (M) and E(M) by rotating the single-ion anisotropies in the case of Mn12Ac and Fe-8 SMMs in ground and few low-lying excited states of the exchange Hamiltonian. In both the systems, we find that the molecular anisotropy changes drastically when the single-ion anisotropies are rotated. While in Mn12Ac SMM D (M) values depend strongly on the spin of the eigenstate, it is almost independent of the spin of the eigenstate in Fe-8 SMM. We also find that the D (M)value is almost insensitive to the orientation of the anisotropy of the core Mn(IV) ions. The dependence of D (M) on the energy gap between the ground and the excited states in both the systems has also been studied by using different sets of exchange constants.

Grids with multiple batch systems for performance enhancement of multi-component and parameter sweep parallel applications

In this work, we evaluate the benefits of using Grids with multiple batch systems to improve the performance of multi-component and parameter sweep parallel applications by reduction in queue waiting times. Using different job traces of different loads, job distributions and queue waiting times corresponding to three different queuing policies(FCFS, conservative and EASY backfilling), we conducted a large number of experiments using simulators of two important classes of applications. The first simulator models Community Climate System Model (CCSM), a prominent multi-component application and the second simulator models parameter sweep applications. We compare the performance of the applications when executed on multiple batch systems and on a single batch system for different system and application configurations. We show that there are a large number of configurations for which application execution using multiple batch systems can give improved performance over execution on a single system.