Computer-aided analysis of the structure of kinematic chains

Using the link-link incidence matrix to represent a simple-jointed kinematic chain algebraic procedures have been developed to determine its structural characteristics such as the type of freedom of the chain, the number of distinct mechanisms and driving mechanisms that can be derived from the chain. A computer program incorporating these graph theory based procedures has been applied successfully for the structural analysis of several typical chains.

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification. Conclusion: A statistically robust and computationally efficient LP-based method for estimating the topology of a large sparse undirected graph from high-dimensional data yields representations of genetic networks that are biologically plausible and useful abstractions of the structures of real genetic networks. Analysis of the statistical and topological properties of learned LP-SLGNs may have practical value; for example, genes with high random walk betweenness, a measure of the centrality of a node in a graph, are good candidates for intervention studies and hence integrated computational – experimental investigations designed to infer more realistic and sophisticated probabilistic directed graphical model representations of genetic networks. The LP-based solutions of the sparse linear regression problem described here may provide a method for learning the structure of transcription factor networks from transcript profiling and transcription factor binding motif data.

Computerized synthesis of the structure of geared kinematic chains

The paper presents for the first time a fully computerized method for structural synthesis of geared kinematic chains which can be used to derive epicyclic gear drives. The method has been formulated on the basis of representing these chains by their graphs, the graphs being in turn represented algebraically by their vertex-vertex incidence matrices. It has thus been possible to make advantageous use of concepts and results from graph theory to develop a method amenable for implementation on a digital computer. The computerized method has been applied to the structural synthesis of single-freedom geared kinematic chains with up to four gear pairs, and the results obtained thereform are presented and discussed.

Complex carbohydrates: 2. The modes of binding of complex carbohydrates to concanavalin A - a computer modelling approach

The probable modes of binding of some complex carbohydrates, which have the trimannosidic core structure (Man3GlcNAc2), to concanavalin A (Con A) have been determined using a computer modelling technique. These studies show that Con a can bind to the terminal mannose residues of the trimannosidic core structure and to the internal mannosyl as well as to the terminal N-acetylglucosamine residues of the N-acetylglucosamine substituted trimannosidic core structure. The oligosaccharide with terminal mannose residues can bind in its minimum energy conformers, whereas the oligosaccharide with internal mannosyl and terminal N-acetylglucosamine residues can bind only in higher energy conformers. In addition the former oligosaccharide forms more hydrogen bonds with Con A than the latter. These results suggest that, for these oligosaccharides, the terminal mannose residue has a much higher probability of reaching the binding site than either the internal mannosyl or the terminal N-acetylglucosamine residues. The substitution of a bisecting N-acetylglucosamine residue on these oligosaccharides, affects significantly the accessibility of the residues which bind to Con A and thereby reduces their binding affinity. It thus seems that the binding affinity of an oligosaccharide to Con A depends not only on the number of sugar residues which possess free 3-, 4- and 6-hydroxyl groups but also on the accessibility of these sugar residues to Con A. This study also reveals that the sugar binding site of Con A is small and that the interactions between Con A and carbohydrates are extended slightly beyond the single sugar residue that is placed in the binding site.

Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer

Data flow computers are high-speed machines in which an instruction is executed as soon as all its operands are available. This paper describes the EXtended MANchester (EXMAN) data flow computer which incorporates three major extensions to the basic Manchester machine. As extensions we provide a multiple matching units scheme, an efficient, implementation of array data structure, and a facility to concurrently execute reentrant routines. A simulator for the EXMAN computer has been coded in the discrete event simulation language, SIMULA 67, on the DEC 1090 system. Performance analysis studies have been conducted on the simulated EXMAN computer to study the effectiveness of the proposed extensions. The performance experiments have been carried out using three sample problems: matrix multiplication, Bresenham's line drawing algorithm, and the polygon scan-conversion algorithm.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Primary structure of a Thomsen-Friedenreich-antigen-specific lectin, jacalin [Artocarpus integrifolia (jack fruit) agglutinin]. Evidence for the presence of an internal repeat

Jacalin [Artocarpus integrifolia (jack fruit) agglutinin] is made up of two types of chains, heavy and light, with M(r) values of 16,200 +/- 1200 and 2090 +/- 300 respectively (on the basis of gel-permeation chromatography under denaturing conditions). Its complete amino acid sequence was determined by manual degradation using a 4-dimethylaminoazobenzene 4'-isothiocyanate double-coupling method. Peptide fragments for sequence analysis were obtained by chemical cleavages of the heavy chain with CNBr, hydroxylamine hydrochloride and iodosobenzoic acid and enzymic cleavage with Staphylococcus aureus proteinase. The peptides were purified by a combination gel-permeation and reverse-phase chromatography. The light chains, being only 20 residues long, could be sequenced without fragmentation. Amino acid analyses and carboxypeptidase-Y-digestion C-terminal analyses of the subunits provided supportive evidence for their sequence. Computer-assisted alignment of the jacalin heavy-chain sequence failed to show sequence similarity to that of any lectin for which the complete sequence is known. Analyses of the sequence showed the presence of an internal repeat spanning residues 7-64 and 76-130. The internal repeat was found to be statistically significant.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

A hybrid computer for X-ray crystallography

A hybrid computer for structure factor calculations in X-ray crystallography is described. The computer can calculate three-dimensional structure factors of up to 24 atoms in a single run and can generate the scatter functions of well over 100 atoms using Vand et al., or Forsyth and Wells approximations. The computer is essentially a digital computer with analog function generators, thus combining to advantage the economic data storage of digital systems and simple computing circuitry of analog systems. The digital part serially selects the data, computes and feeds the arguments into specially developed high precision digital-analog function generators, the outputs of which being d.c. voltages, are further processed by analog circuits and finally the sequential adder, which employs a novel digital voltmeter circuit, converts them back into digital form and accumulates them in a dekatron counter which displays the final result. The computer is also capable of carrying out 1-, 2-, or 3-dimensional Fourier summation, although in this case, the lack of sufficient storage space for the large number of coefficients involved, is a serious limitation at present.

Computer simulation of protein—carbohydrate complexes: application to arabinose-binding protein and pea lectin

The CCEM method (Contact Criteria and Energy Minimisation) has been developed and applied to study protein-carbohydrate interactions. The method uses available X-ray data even on the native protein at low resolution (above 2.4 Å) to generate realistic models of a variety of proteins with various ligands.The two examples discussed in this paper are arabinose-binding protein (ABP) and pea lectin. The X-ray crystal structure data reported on ABP-β-l-arabinose complex at 2.8, 2.4 and 1.7 Å resolution differ drastically in predicting the nature of the interactions between the protein and ligand. It is shown that, using the data at 2.4 Å resolution, the CCEM method generates complexes which are as good as the higher (1.7 Å) resolution data. The CCEM method predicts some of the important hydrogen bonds between the ligand and the protein which are missing in the interpretation of the X-ray data at 2.4 Å resolution. The theoretically predicted hydrogen bonds are in good agreement with those reported at 1.7 Å resolution. Pea lectin has been solved only in the native form at 3 Å resolution. Application of the CCEM method also enables us to generate complexes of pea lectin with methyl-α-d-glucopyranoside and methyl-2,3-dimethyl-α-d-glucopyranoside which explain well the available experimental data in solution.

Computer estimation of the Cd---Hg---Te phase diagram

The compounds CdHgTe and its constituent binaries CdTe, HgTe, and CdHg are semiconductors which are used in thermal, infrared, nuclear, thermoelectric and other photo sensitive devices. The compound CdHgTe has a Sphaleritic structure of possible type A1IIB1IIC6VI. The TERCP program of Kaufman is used to estimate the stable regions of the ternary phase diagram using available thermodynamic data. It was found that there was little variation in stochiometry with temperature. The compositions were calculated for temperatures ranging from 325K to 100K and the compositional limits were Cd13−20Hg12−01Te75−79, Hg varying most. By comparison with a similar compound, Cd In2Te4 of forbidden band width. 88 to .90 e.V., similar properties are postulated for Cd1Hg1Te6 with applications in the infra red region of the spectrum at 300K where this composition is given by TERCP at the limit of stability.

Computer modelling studies on the mechanism of action of ribonuclease T1

The mechanism of action of ribonuclease (RNase) T1 is still a matter of considerable debate as the results of x-ray, 2-D nmr and site-directed mutagenesis studies disagree regarding the role of the catalytically important residues. Hence computer modelling studies were carried out by energy minimisation of the complexes of RNase T1 and some of its mutants (His40Ala, His40Lys, and Glu58Ala) with the substrate guanyl cytosine (GpC), and of native RNase T1 with the reaction intermediate guanosine 2',3'-cyclic phosphate (G greater than p). The puckering of the guanosine ribose moiety in the minimum energy conformer of the RNase T1-GpC (substrate) complex was found to be O4'-endo and not C3'-endo as in the RNase T1-3'-guanylic acid (inhibitor/product) complex. A possible scheme for the mechanism of action of RNase T1 has been proposed on the basis of the arrangement of the catalytically important amino acid residues His40, Glu58, Arg77, and His92 around the guanosine ribose and the phosphate moiety in the RNase T1-GpC and RNase T1-G greater than p complexes. In this scheme, Glu58 serves as the general base group and His92 as the general acid group in the transphosphorylation step. His40 may be essential for stabilising the negatively charged phosphate moiety in the enzyme-transition state complex.

A homotopy approach for stabilizing single-input systems with control structure constraints

A linear state feedback gain vector used in the control of a single input dynamical system may be constrained because of the way feedback is realized. Some examples of feedback realizations which impose constraints on the gain vector are: static output feedback, constant gain feedback for several operating points of a system, and two-controller feedback. We consider a general class of problems of stabilization of single input dynamical systems with such structural constraints and give a numerical method to solve them. Each of these problems is cast into a problem of solving a system of equalities and inequalities. In this formulation, the coefficients of the quadratic and linear factors of the closed-loop characteristic polynomial are the variables. To solve the system of equalities and inequalities, a continuous realization of the gradient projection method and a barrier method are used under the homotopy framework. Our method is illustrated with an example for each class of control structure constraint.

Computer modelling studies of ribonuclease A-pyrimidine nucleotide complexes

Different modes of binding of pyrimidine monophosphates 2'-UMP, 3'-UMP, 2'-CMP and 3'-CMP to ribonuclease (RNase) A are studied by energy minimization in torsion angle and subsequently in Cartesian coordinate space. The results are analysed in the light of primary binding sites. The hydrogen bonding pattern brings out roles for amino acids such as Asn44 and Ser123 apart from the well known active site residues viz., His12,Lys41,Thr45 and His119. Amino acid segments 43-45 and 119-121 seem to be guiding the ligand binding by forming a pocket. Many of the active site charged residues display considerable movement upon nucleotide binding.