Diversity in Functional Organization of Class I and Class II Biotin Protein Ligase

The cell envelope of Mycobacterium tuberculosis (M. tuberculosis) is composed of a variety of lipids including mycolic acids, sulpholipids, lipoarabinomannans, etc., which impart rigidity crucial for its survival and pathogenesis. Acyl CoA carboxylase (ACC) provides malonyl-CoA and methylmalonyl-CoA, committed precursors for fatty acid and essential for mycolic acid synthesis respectively. Biotin Protein Ligase (BPL/BirA) activates apo-biotin carboxyl carrier protein (BCCP) by biotinylating it to an active holo-BCCP. A minimal peptide (Schatz), an efficient substrate for Escherichia coli BirA, failed to serve as substrate for M. tuberculosis Biotin Protein Ligase (MtBPL). MtBPL specifically biotinylates homologous BCCP domain, MtBCCP87, but not EcBCCP87. This is a unique feature of MtBPL as EcBirA lacks such a stringent substrate specificity. This feature is also reflected in the lack of self/promiscuous biotinylation by MtBPL. The N-terminus/HTH domain of EcBirA has the selfbiotinable lysine residue that is inhibited in the presence of Schatz peptide, a peptide designed to act as a universal acceptor for EcBirA. This suggests that when biotin is limiting, EcBirA preferentially catalyzes, biotinylation of BCCP over selfbiotinylation. R118G mutant of EcBirA showed enhanced self and promiscuous biotinylation but its homologue, R69A MtBPL did not exhibit these properties. The catalytic domain of MtBPL was characterized further by limited proteolysis. Holo-MtBPL is protected from proteolysis by biotinyl-59 AMP, an intermediate of MtBPL catalyzed reaction. In contrast, apo-MtBPL is completely digested by trypsin within 20 min of co-incubation. Substrate selectivity and inability to promote self biotinylation are exquisite features of MtBPL and are a consequence of the unique molecular mechanism of an enzyme adapted for the high turnover of fatty acid biosynthesis.

Automatic verification of distributed logic specifications

Formal specification is vital to the development of distributed real-time systems as these systems are inherently complex and safety-critical. It is widely acknowledged that formal specification and automatic analysis of specifications can significantly increase system reliability. Although a number of specification techniques for real-time systems have been reported in the literature, most of these formalisms do not adequately address to the constraints that the aspects of 'distribution' and 'real-time' impose on specifications. Further, an automatic verification tool is necessary to reduce human errors in the reasoning process. In this regard, this paper is an attempt towards the development of a novel executable specification language for distributed real-time systems. First, we give a precise characterization of the syntax and semantics of DL. Subsequently, we discuss the problems of model checking, automatic verification of satisfiability of DL specifications, and testing conformance of event traces with DL specifications. Effective solutions to these problems are presented as extensions to the classical first-order tableau algorithm. The use of the proposed framework is illustrated by specifying a sample problem.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Electrooxidation of methanol in sulfuric-acid electrolyte on platized-carbon electrodes with several functional-group characteristics

The effect of acid/base functional-groups associated with platinized-carbon electrodes on their catalytic activity toward electro-oxidation of methanol in sulfuric acid electrolyte at 60-degrees-C is studied. Platinized-carbon electrodes with sm amounts of functional groups exhibit higher catalytic activity compared to those with large concentrations of acidic/basic surface functionalities. The overpotential for methanol oxidation is minimum on electrodes of platinized carbons with pHzpc values between 6 and 7. An x-ray photoelectron spectroscopic study of various platinized carbons suggests that the acid/base surface functional-groups produce ample amounts of surface Pt-oxides and a consequent decrease in activity toward methanol oxidation.

Generating synchronizable test sequences based on finite-statemachine with distributed ports

In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature for testing distributed systems based on the Open Distributing Processing (ODP) Basic Reference Model (BRM), which is a generalized version of ISO distributed test architecture. We study in this paper the issue of test selection with respect to such an test architecture. In particular, we consider communication systems that can be modeled by finite state machines with several distributed interfaces, called ports. A test generation method is developed for generating test sequences for such finite state machines, which is based on the idea of synchronizable test sequences. Starting from the initial effort by Sarikaya, a certain amount of work has been done for generating test sequences for finite state machines with respect to the ISO distributed test architecture, all based on the idea of modifying existing test generation methods to generate synchronizable test sequences. However, none studies the fault coverage provided by their methods. We investigate the issue of fault coverage and point out a fact that the methods given in the literature for the distributed test architecture cannot ensure the same fault coverage as the corresponding original testing methods. We also study the limitation of fault detectability in the distributed test architecture.

Managing interprocessor delays in distributed recursive algorithms

For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.

Ionic conductivity, mechanical strength and Li-ion battery performance of mono-functional and bi-functional (''Janus'') ``soggy sand'' electrolytes

Influence of dispersion of uniformly sized mono-functional and bi-functional (''Janus'') particles on ionic conductivity of novel ``soggy sand'' electrolytes and its implications on mechanical strength and lithium-ion battery performance are discussed here.

Optimal management of beaver population using a reduced-order distributed parameter model and single network adaptive critics

Beavers are often found to be in conflict with human interests by creating nuisances like building dams on flowing water (leading to flooding), blocking irrigation canals, cutting down timbers, etc. At the same time they contribute to raising water tables, increased vegetation, etc. Consequently, maintaining an optimal beaver population is beneficial. Because of their diffusion externality (due to migratory nature), strategies based on lumped parameter models are often ineffective. Using a distributed parameter model for beaver population that accounts for their spatial and temporal behavior, an optimal control (trapping) strategy is presented in this paper that leads to a desired distribution of the animal density in a region in the long run. The optimal control solution presented, imbeds the solution for a large number of initial conditions (i.e., it has a feedback form), which is otherwise nontrivial to obtain. The solution obtained can be used in real-time by a nonexpert in control theory since it involves only using the neural networks trained offline. Proper orthogonal decomposition-based basis function design followed by their use in a Galerkin projection has been incorporated in the solution process as a model reduction technique. Optimal solutions are obtained through a "single network adaptive critic" (SNAC) neural-network architecture.

Reduced Order Suboptimal Control Design for a Class of Nonlinear Distributed Parameter Systems Using POD and /spl thetas/-D Techniques

A new computational tool is presented in this paper for suboptimal control design of a class of nonlinear distributed parameter systems. First proper orthogonal decomposition based problem-oriented basis functions are designed, which are then used in a Galerkin projection to come up with a low-order lumped parameter approximation. Next, a suboptimal controller is designed using the emerging /spl thetas/-D technique for lumped parameter systems. This time domain sub-optimal control solution is then mapped back to the distributed domain using the same basis functions, which essentially leads to a closed form solution for the controller in a state feedback form. Numerical results for a real-life nonlinear temperature control problem indicate that the proposed method holds promise as a good suboptimal control design technique for distributed parameter systems.

An optimal dynamic inversion approach for controlling a class of one-dimensional nonlinear distributed parameter systems

Combining the principles of dynamic inversion and optimization theory, a new approach is presented for stable control of a class of one-dimensional nonlinear distributed parameter systems, assuming the availability a continuous actuator in the spatial domain. Unlike the existing approximate-then-design and design-then-approximate techniques, here there is no need of any approximation either of the system dynamics or of the resulting controller. Rather, the control synthesis approach is fairly straight-forward and simple. The controller formulation has more elegance because we can prove the convergence of the controller to its steady state value. To demonstrate the potential of the proposed technique, a real-life temperature control problem for a heat transfer application is solved. It has been demonstrated that a desired temperature profile can be achieved starting from any arbitrary initial temperature profile.

Distributed computation of fixed points of infinity-nonexpansive maps

The distributed implementation of an algorithm for computing fixed points of an infinity-nonexpansive map is shown to converge to the set of fixed points under very general conditions.

Establishment of the functional importance of thiamin carrier protein in pregnant rats by using monoclonal antibodies

Monoclonal antibodies (mAbs) to chicken thiamin carrier protein (TCP) have been produced by hybridoma technology to identify the crucial epitopes involved in bioneutralization of the vitamin carrier. The monoclonality of these mAbs (A4C4, F3H6, H8H3, C8C1 and G7H10) was sought to be confirmed by sub-class isotyping; they all belong to IgG1, k type. The epitopes recognized by all the five mAbs are conserved in TCP from the chicken to the rat as assessed by liquid phase RIA and immunoprecipitation of I-125-labelled proteins from pregnant rat serum. Among these mAbs, passive immunization of pregnant rats with the mAb C8C1 only on three consecutive days (day 10, 11 and 12) resulted in embryonic resorption. These results demonstrate the importance of epitopic structure specified by the mAb C8C1 on TCP during pregnancy in rats.

Functional analysis of conserved motifs in EcoP15I DNA methyltransferase

EcoP15I DNA methyltransferase recognizes the sequence 5'-CAGCAG-3' and transfers a methyl group to N-6 of the second adenine residue in the recognition sequence. All N-6 adenine methyltransferases contain two highly conserved sequences, FxGxG (motif I), postulated to form part of the S-adenosyl-L-methionine binding site and (D/N/S)PP(Y/F) (motif IV) involved in catalysis. We have altered the second glycine residue in motif I to arginine and serine, and substituted tyrosine in motif IV with tryptophan in EcoP15I DNA methyltransferase, using site-directed mutagenesis. The mutant enzymes were overexpressed, purified and characterized by biochemical methods. The mutations in motif I completely abolished AdoMet binding but left target DNA recognition unaltered. Although the mutation in motif IV resulted in loss of enzyme activity, we observed enhanced crosslinking of S-adenosyl-L-methionine and DNA. This implies that DNA and AdoMet binding sites are close to motif IV. Taken together, these results reinforce the importance of motif I in AdoMet binding and motif IV in catalysis. Additionally, limited proteolysis and UV crosslinking experiments with EcoP15I DNA methyltransferase imply that DNA binds in a cleft formed by two domains in the protein. Methylation protection analysis provides evidence for the fact that EcoP15I DNA MTase makes contacts in the major groove of its substrate DNA. Interestingly, hypermethylation of the guanine residue next to the target adenine residue indicates that the protein probably flips out the target adenine residue. (C) 1996 Academic Press Limited