Japanese encephalitis virus infection of mouse cell lines: ability to prime mice for generation of virus specific cytotoxic T lymphocytes and differences in CTL recognisable viral determinants

Ten different mouse cell lines were examined for Japanese encephalitis virus (JEV) infection in vitro and then tested for their ability to generate virus specific cytotoxic T lymphocytes (CTL). Among all cell lines examined, Neuro La (a neuroblastoma) was readily infected with JEV as examined by immunofluorescence and viral replication. Among other cells, P388D1, RAW 264.7 (Macrophage origin), Sp2/0 (B-cell Hybridoma), YAC-1 (T-cell lymphoma), and L929 (Fibroblast) were semipermissive to JEV infection. The cytopathic effects caused by progressive JEV infection varied from cell line to cell line. In the case of YAC-1 cells long-term viral antigen expression was observed without significant alterations in cell viability. Intermediate degrees of cytopathicity are seen in RAW 264.7 and L929 cells while infection of PS, Neuro 2a, P388D1 and Sp2/0 caused major viability losses. All infected cell lines were able to prime adult BALB/c (H-2(d)) mice for the generation of secondary JEV specific CTL. In contrast to YAC-1, the permissive neuroblastoma cell line Neuro 2a (H-2K(k)D(d)) was found to be least efficient in its ability to stimulate anti-viral CTL generation. Cold target competition studies demonstrated that both Neuro 2a and YAC-1 (H-2K(k)D(d)) cells expressed similar viral determinants that are recognised by CTL, suggesting that the reason for the lower ability of Neuro 2a to stimulate anti-viral CTL was not due to lack of viral CTL determinants. These findings demonstrate that a variety of mouse cell lines can be infected with Japanese encephalitis virus, and that these infected cells could be utilised to generate virus specific CTL in BALB/c mice.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.

Non-viral ex vivo hepatic gene transfer by in situ lipofection of liver and intraperitoneal transplantation of hepatocytes

Perfusion of liver with plasmid DNA-lipofectin complexes via the portal vein results in efficient accumulation of the vector in hepatocytes. Such hepatocytes, when administered intraperitoneally into a hepatectomized rat, repopulate the liver and express the transgene efficiently. This procedure obviates the need for large-scale hepatocyte culture for ex vivo gene transfer. Further, intraperitoneal transplantation is a simple and cost-effective strategy of introducing genetically modified hepatocytes into liver. Thus, in situ lipofection of liver and intraperitoneal transfer of hepatocytes can be developed into a novel method of non-viral ex vivo gene transfer technique that has applications in the treatment of metabolic disorders of liver and hepatic gene therapy.

Studies on age-hardening characteristics of ceramic particle/matrix interfaces in Al-Cu-SiCp composites using ultra low-load-dynamic microhardness measurements

Ultra low-load-dynamic microhardness testing facilitates the hardness measurements in a very low volume of the material and thus is suited for characterization of the interfaces in MMC's. This paper details the studies on age-hardening behavior of the interfaces in Al-Cu-5SiC(p) composites characterized using this technique. Results of hardness studies have been further substantiated by TEM observations. In the solution-treated condition, hardness is maximum at the particle/matrix interface and decreases with increasing distance from the interface. This could be attributed to the presence of maximum dislocation density at the interface which decreases with increasing distance from the interface. In the case of composites subjected to high temperature aging, hardening at the interface is found to be faster than the bulk matrix and the aging kinetics becomes progressively slower with increasing distance from the interface. This is attributed to the dislocation density gradient at the interface, leading to enhanced nucleation and growth of precipitates at the interface compared to the bulk matrix. TEM observations reveal that the sizes of the precipitates decrease with increasing distance from the interface and thus confirms the retardation in aging kinetics with increasing distance from the interface.

Modelling electricity demand with representative load curves

Models for electricity planning require inclusion of demand. Depending on the type of planning, the demand is usually represented as an annual demand for electricity (GWh), a peak demand (MW) or in the form of annual load-duration curves. The demand for electricity varies with the seasons, economic activities, etc. Existing schemes do not capture the dynamics of demand variations that are important for planning. For this purpose, we introduce the concept of representative load curves (RLCs). Advantages of RLCs are demonstrated in a case study for the state of Karnataka in India. Multiple discriminant analysis is used to cluster the 365 daily load curves for 1993-94 into nine RLCs. Further analyses of these RLCs help to identify important factors, namely, seasonal, industrial, agricultural, and residential (water heating and air-cooling) demand variations besides rationing by the utility. (C) 1999 Elsevier Science Ltd. All rights reserved.

Profile-Based Load Scheduling in Wireless Energy Harvesting Sensors for Data Rate Maximization

In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

Scheduling expression trees for delayed-load architectures

In this paper we consider the problem of scheduling expression trees on delayed-load architectures. The problem tackled here takes root from the one considered in [Proceedings of the ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation, 1991. p. 256] in which the leaves of the expression trees all refer to memory locations. A generalization of this involves the situation in which the trees may contain register variables, with the registers being used only at the leaves. Solutions to this generalization are given in [ACM Trans. Prog. Lang. Syst. 17 (1995) 740, Microproc. Microprog. 40 (1994) 577]. This paper considers the most general case in which the registers are reusable. This problem is tackled in [Comput. Lang, 21 (1995) 49] which gives an approximate solution to the problem under certain assumptions about the contiguity of the evaluation order: Here we propose an optimal solution (which may involve even a non-contiguous evaluation of the tree). The schedule generated by the algorithm given in this paper is optimal in the sense that it is an interlock-free schedule which uses the minimum number of registers required. An extension to the algorithm incorporates spilling. The problem as stated in this paper is an instruction scheduling problem. However, the problem could also be rephrased as an operations research problem with a difference in terminology. (C) 2002 Elsevier Science B.V. All rights reserved.

Nonlinear Finite-Element Modeling of Batter Piles under Lateral Load

In this paper, a finite-element model is developed in which the nonlinear soil behavior is represented by a hyperbolic relation for static load condition and modified hyperbolic relation, which includes both degradation and gap for a cyclic load condition. Although batter piles are subjected to lateral load, the soil resistance is also governed by axial load, which is incorporated by considering the P-Δ moment and geometric stiffness matrix. By adopting the developed numerical model, static and cyclic load analyses are performed adopting an incremental-iterative procedure where the pile is idealized as beam elements and the soil as elastoplastic spring elements. The proposed numerical model is validated with published laboratory and field pile test results under both static and cyclic load conditions. This paper highlights the importance of the degradation factor and its influence on the soil resistance-displacement (p-y) curve, number of cycles of loading, and cyclic load response.

Starting scheme for load commutated inverter-fed wound field synchronous machine using an auxiliary low-power voltage source inverter

Conventional thyristor-based load commutated inverter (LCI)-fed wound field synchronous machine operates only above a minimum speed that is necessary to develop enough back emf to ensure commutation. The drive is started and brought up to a speed of around 10-15% by a complex `dc link current pulsing' technique. During this process, the drive have problems such as pulsating torque, insufficient average starting torque, longer starting time, etc. In this regard a simple starting and low-speed operation scheme, by employing an auxiliary low-power voltage source inverter (VSI) between the LCI and the machine terminals, is presented in this study. The drive is started and brought up to a low speed of around 15% using the VSI alone with field oriented control. The complete control is then smoothly and dynamically transferred to the conventional LCI control. After the control transfer, the VSI is turned off and physically disconnected from the main circuit. The advantages of this scheme are smooth starting, complete control of torque and flux at starting and low speeds, less starting time, stable operation, etc. The voltage rating of the required VSI is very low of the order of 10-15%, whereas the current rating is dependent on the starting torque requirement of the load. The experimental results from a 15.8 hp LCI-fed wound field synchronous machine are given to demonstrate the scheme.

Reliability-based load and resistance factors for soil-nail walls

Existing soil nailing design methodologies are essentially based on limit equilibrium principles that together with a lumped factor of safety or a set of partial factors on the material parameters and loads account for uncertainties in design input parameter values. Recent trends in the development of design procedures for earth retaining structures are towards load and resistance factor design (LRFD). In the present study, a methodology for the use of LRFD in the context of soil-nail walls is proposed and a procedure to determine reliability-based load and resistance factors is illustrated for important strength limit states with reference to a 10 m high soil-nail wall. The need for separate partial factors for each limit state is highlighted, and the proposed factors are compared with those existing in the literature.