Genetic diversity and proviral DNA load in different neural compartments of HIV-1 subtype C infection

In India, the low prevalence of HIV-associated dementia (HAD) in the Human immunodeficiency virus type 1 (HIV-1) subtype C infection is quite paradoxical given the high-rate of macrophage infiltration into the brain. Whether the direct viral burden in individual brain compartments could be associated with the variability of the neurologic manifestations is controversial. To understand this paradox, we examined the proviral DNA load in nine different brain regions and three different peripheral tissues derived from ten human subjects at autopsy. Using a highly sensitive TaqMan probe-based real-time PCR, we determined the proviral load in multiple samples processed in parallel from each site. Unlike previously published reports, the present analysis identified uniform proviral distribution among the brain compartments examined without preferential accumulation of the DNA in any one of them. The overall viral DNA burden in the brain tissues was very low, approximately 1 viral integration per 1000 cells or less. In a subset of the tissue samples tested, the HIV DNA mostly existed in a free unintegrated form. The V3-V5 envelope sequences, demonstrated a brain-specific compartmentalization in four of the ten subjects and a phylogenetic overlap between the neural and non-neural compartments in three other subjects. The envelope sequences phylogenetically belonged to subtype C and the majority of them were R5 tropic. To the best of our knowledge, the present study represents the first analysis of the proviral burden in subtype C postmortem human brain tissues. Future studies should determine the presence of the viral antigens, the viral transcripts, and the proviral DNA, in parallel, in different brain compartments to shed more light on the significance of the viral burden on neurologic consequences of HIV infection.

Conservative Design Optimization of Laminated Composite Structures Using Genetic Algorithms and Multiple Failure Criteria

This article analyzes the effect of devising a new failure envelope by the combination of the most commonly used failure criteria for the composite laminates, on the design of composite structures. The failure criteria considered for the study are maximum stress and Tsai-Wu criteria. In addition to these popular phenomenological-based failure criteria, a micromechanics-based failure criterion called failure mechanism-based failure criterion is also considered. The failure envelopes obtained by these failure criteria are superimposed over one another and a new failure envelope is constructed based on the lowest absolute values of the strengths predicted by these failure criteria. Thus, the new failure envelope so obtained is named as most conservative failure envelope. A minimum weight design of composite laminates is performed using genetic algorithms. In addition to this, the effect of stacking sequence on the minimum weight of the laminate is also studied. Results are compared for the different failure envelopes and the conservative design is evaluated, with respect to the designs obtained by using only one failure criteria. The design approach is recommended for structures where composites are the key load-carrying members such as helicopter rotor blades.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Role of melt convection on optimization of PCM-based heat sink under cyclic heat load

In this article, we study the thermal performance of phase-change material (PCM)-based heat sinks under cyclic heat load and subjected to melt convection. Plate fin type heat sinks made of aluminum and filled with PCM are considered in this study. The heat sink is heated from the bottom. For a prescribed value of heat flux, design of such a heat sink can be optimized with respect to its geometry, with the objective of minimizing the temperature rise during heating and ensuring complete solidification of PCM at the end of the cooling period for a given cycle. For given length and base plate thickness of a heat sink, a genetic algorithm (GA)-based optimization is carried out with respect to geometrical variables such as fin thickness, fin height, and the number of fins. The thermal performance of the heat sink for a given set of parameters is evaluated using an enthalpy-based heat transfer model, which provides the necessary data for the optimization algorithm. The effect of melt convection is studied by taking two cases, one without melt convection (conduction regime) and the other with convection. The results show that melt convection alters the results of geometrical optimization.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.

Numerical prediction of load-displacement behaviors of adhesively bonded joints at different extension rates and temperatures

The present work focuses on simulation of nonlinear mechanical behaviors of adhesively bonded DLS (double lap shear) joints for variable extension rates and temperatures using the implicit ABAQUS solver. Load-displacement curves of DLS joints at nine combinations of extension rates and environmental temperatures are initially obtained by conducting tensile tests in a UTM. The joint specimens are made from dual phase (DP) steel coupons bonded with a rubber-toughened adhesive. It is shown that the shell-solid model of a DLS joint, in which substrates are modeled with shell elements and adhesive with solid elements, can effectively predict the mechanical behavior of the joint. Exponent Drucker-Prager or Von Mises yield criterion together with nonlinear isotropic hardening is used for the simulation of DLS joint tests. It has been found that at a low temperature (-20 degrees C), both Von Mises and exponent Drucker-Prager criteria give close prediction of experimental load-extension curves. However. at a high temperature (82 degrees C), Von Mises condition tends to yield a perceptibly softer joint behavior, while the corresponding response obtained using exponent Drucker-Prager criterion is much closer to the experimental load-displacement curve.

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.

Load-Commutated SCR Current-Source-Inverter-Fed Induction Motor Drive With Sinusoidal Motor Voltage and Current

Current source inverter (CSI) is an attractive solution in high-power drives. The conventional gate turn-off thyristor (GTO) based CSI-fed induction motor drives suffer from drawbacks such as low-frequency torque pulsation, harmonic heating, and unstable operation at low-speed ranges. These drawbacks can be overcome by connecting a current-controlled voltage source inverter (VSI) across the motor terminal replacing the bulky ac capacitors. The VSI provides the harmonic currents, which results in sinusoidal motor voltage and current even with the CSI switching at fundamental frequency. This paper proposes a CSI-fed induction motor drive scheme where GTOs are replaced by thyristors in the CSI without any external circuit to assist the turning off of the thyristors. Here, the current-controlled VSI, connected in shunt, is designed to supply the volt ampere reactive requirement of the induction motor, and the CSI is made to operate in leading power factor mode such that the thyristors in the CSI are autosequentially turned off. The resulting drive will be able to feed medium-voltage, high-power induction motors directly. A sensorless vector-controlled CSI drive based on the proposed configuration is developed. The experimental results from a 5 hp prototype are presented. Experimental results show that the proposed drive has stable operation throughout the operating range of speeds.

Some aspects of multilevel load-frequency control of a power system

The application of multilevel control strategies for load-frequency control of interconnected power systems is assuming importance. A large multiarea power system may be viewed as an interconnection of several lower-order subsystems, with possible change of interconnection pattern during operation. The solution of the control problem involves the design of a set of local optimal controllers for the individual areas, in a completely decentralised environment, plus a global controller to provide the corrective signal to account for interconnection effects. A global controller, based on the least-square-error principle suggested by Siljak and Sundareshan, has been applied for the LFC problem. A more recent work utilises certain possible beneficial aspects of interconnection to permit more desirable system performances. The paper reports the application of the latter strategy to LFC of a two-area power system. The power-system model studied includes the effects of excitation system and governor controls. A comparison of the two strategies is also made.

Optimal hydrothermal load flow: Formulation and a successive approximation solution for fixed head systems

This paper deals with the optimal load flow problem in a fixed-head hydrothermal electric power system. Equality constraints on the volume of water available for active power generation at the hydro plants as well as inequality constraints on the reactive power generation at the voltage controlled buses are imposed. Conditions for optimal load flow are derived and a successive approximation algorithm for solving the optimal generation schedule is developed. Computer implementation of the algorithm is discussed, and the results obtained from the computer solution of test systems are presented.

Timing the Emergence of Resistance to Anti-HIV Drugs with Large Genetic Barriers

New antiretroviral drugs that offer large genetic barriers to resistance, such as the recently approved inhibitors of HIV-1 protease, tipranavir and darunavir, present promising weapons to avert the failure of current therapies for HIV infection. Optimal treatment strategies with the new drugs, however, are yet to be established. A key limitation is the poor understanding of the process by which HIV surmounts large genetic barriers to resistance. Extant models of HIV dynamics are predicated on the predominance of deterministic forces underlying the emergence of resistant genomes. In contrast, stochastic forces may dominate, especially when the genetic barrier is large, and delay the emergence of resistant genomes. We develop a mathematical model of HIV dynamics under the influence of an antiretroviral drug to predict the waiting time for the emergence of genomes that carry the requisite mutations to overcome the genetic barrier of the drug. We apply our model to describe the development of resistance to tipranavir in in vitro serial passage experiments. Model predictions of the times of emergence of different mutant genomes with increasing resistance to tipranavir are in quantitative agreement with experiments, indicating that our model captures the dynamics of the development of resistance to antiretroviral drugs accurately. Further, model predictions provide insights into the influence of underlying evolutionary processes such as recombination on the development of resistance, and suggest guidelines for drug design: drugs that offer large genetic barriers to resistance with resistance sites tightly localized on the viral genome and exhibiting positive epistatic interactions maximally inhibit the emergence of resistant genomes.

Structural Basis of Drug Resistance by Genetic Variants of HIV Type 1 Clade C Protease from India

Using computer modeling of three-dimensional structures and structural information available on the crystal structures of HIV-1 protease, we investigated the structural effects of mutations, in treatment-naive and treatment-exposed individuals from India and postulated mechanisms of resistance in clade C variants. A large number of models (14) have been generated by computational mutation of the available crystal structures of drug bound proteases. Localized energy minimization was carried out in and around the sites of mutation in order to optimize the geometry of interactions present. Most of the mutations result in structural differences at the flap that favors the semiopen state of the enzyme. Some of the mutations were also found to confer resistance by affecting the geometry of the active site. The E35D mutation affects the flap structure in clade B strains and E35N and E35K mutation, seen in our modeled strains, have a more profound effect. Common polymorphisms at positions 36 and 63 in clade C also affected flap structure. Apart from a few other residues Gln-58, Asn-83, Asn-88, and Gln-92 and their interactions are important for the transition from the closed to the open state. Development of protease inhibitors by structure-based design requires investigation of mechanisms operative for clade C to improve the efficacy of therapy.

Lower-bound collapse load Of square footing

Based on a radial moment field and the square yield criterion, a lower-bound collapse load is developed for a square footing subjected to a generalized contact pressure distribution. The current lower-bound collapse load compares well with the available upper-bound solutions.