Characterization of viral proteins ofOryctes baculovirus and comparison between two geographical isolates

BacilliformOryctes baculovirus particles have been visualized in electron micrographs of midgut sections from virus infectedOryctes rhinoceros beetles. Morphologically the Indian isolate (Oryctes baculovirus, KI) resembled the previously reportedOryctes baculovirus, isolate PV505. The constituent proteins of baculovirus KI have been analysed by sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) and by Western blots using polyclonal antibodies raised against the complete viral particles, as probes. A total of forty eight viral proteins have been identified. Fourteen viral proteins were located on the viral envelope. Among the proteins constituting the nucleocapsid, three were located internally within the capsid. A 23.5 kDa protein was tightly associated with viral DNA in the nucleocapsid core. Two envelope and seven capsid proteins stained positive for glycosylation. Comparison between the viral proteins of KI and PV505 revealed differences in SDS-PAGE profiles and glycosylation patterns. Immunoblotting of KI and PV505 proteins with anti KI antiserum demonstrated antigenic differences between the two viral isolates.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

Adaptive load control of the central processor in a distributed system with a star topology

The author presents adaptive control techniques for controlling the flow of real-time jobs from the peripheral processors (PPs) to the central processor (CP) of a distributed system with a star topology. He considers two classes of flow control mechanisms: (1) proportional control, where a certain proportion of the load offered to each PP is sent to the CP, and (2) threshold control, where there is a maximum rate at which each PP can send jobs to the CP. The problem is to obtain good algorithms for dynamically adjusting the control level at each PP in order to prevent overload of the CP, when the load offered by the PPs is unknown and varying. The author formulates the problem approximately as a standard system control problem in which the system has unknown parameters that are subject to change. Using well-known techniques (e.g., naive-feedback-controller and stochastic approximation techniques), he derives adaptive controls for the system control problem. He demonstrates the efficacy of these controls in the original problem by using the control algorithms in simulations of a queuing model of the CP and the load controls.

Analysis of a thick plate with a circular hole resting on a smooth rigid bed and subjected to axisymmetric normal load

A solution for the stresses and displacements in an radially infinite thick plate having a circular hole, one face of which resting on a smooth rigid bed and the other face subjected to axisymmetric normal loading is given. The solution is obtained in terms of Fourier-Bessel series and integral for the Love's stress function. Numerical results are presented for one particular ratio of thickness of plate to the hole radius and loading. It is also shown that the Poisson's ratio has a predominant effect on certain stresses and displacements. The solution would be useful in the stress analysis of bolted joints.Eine Lösung für die Spannungen und Verschiebungen in einer radial, unendlich ausgedehnten, dicken Platte mit einem kreisförmigen Loch, wobei eine Seite auf einer ebenen, starren Unterlage aufliegt, die andere Seite durch eine achsensymmetrische Vertikallast belastet ist, wird angegeben. Die Lösung wird in Form von Fourier-Bessel-Reihen und Integralen der Loveschen Spannungsfunktion angegeben. Numerische Ergebnisse werden für ein bestimmtes Verhältnis der Plattendicke zum Lochradius sowie zur Belastung angegeben. Es wird auch gezeigt, daß das Poisssonsche Verhältnis einen besonderen Einfluß auf bestimmte Spannungen und Verschiebungen hat. Die Lösung ist anwendbar für die Spannungsermittlung von Bolzenverbindungen.

Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

Characterization of the genome of Oryctes baculovirus, a viral biocide of the insect pest Oryctes rhinoceros

Oryctes baculovirus is a viral biocide exploited for the control of the insect pest Oryctes rhinoceros. We have recently established a physical map of the genome of the Indian isolate of Oryctes baculovirus (OBV-KI). Here we examine the genomic relatedness between OBV-KI and OBV-PV505, the type isolate (originally from the Philippines), by DNA reassociation kinetics and by the use of restriction endonucleases. On the basis of differences in restriction-enzyme profiles between the two genomes, and previously reported differences in protein profiles and antigenic makeup, we propose the taxonomic status of a variant of Oryctes baculovirus for the Indian isolate.

Interaction of Sesbania mosaic virus movement protein with the coat protein - implications for viral spread

Sesbania mosaic virus (SeMV) is a single-stranded positive-sense RNA plant virus belonging to the genus Sobemovirus. The movement protein (MP) encoded by SeMV ORF1 showed no significant sequence similarity with MPs of other genera, but showed 32% identity with the MP of Southern bean mosaic virus within the Sobemovirus genus. With a view to understanding the mechanism of cell-to-cell movement in sobemoviruses, the SeMV MP gene was cloned, over-expressed in Escherichia coli and purified. Interaction of the recombinant MP with the native virus (NV) was investigated by ELISA and pull-down assays. It was observed that SeMV MP interacted with NV in a concentration- and pH-dependent manner. Analysis of N- and C-terminal deletion mutants of the MP showed that SeMV MP interacts with the NV through the N- terminal 49 amino acid segment. Yeast two-hybrid assays confirmed the in vitro observations, and suggested that SeMV might belong to the class of viruses that require MP and NV/coat protein for cell-to-cell movement.

Prediction of load-deflection behaviour using fracture energy GF: A comparative study of two fracture models for concrete

Load-deflection curves for a notched beam under three-point load are determined using the Fictitious Crack Model (FCM) and Blunt Crack Model (BCM). Two values of fracture energy GF are used in this analysis: (i) GF obtained from the size effect law and (ii) GF obtained independently of the size effect. The predicted load-deflection diagrams are compared with the experimental ones obtained for the beams tested by Jenq and Shah. In addition, the values of maximum load (Pmax) obtained by the analyses are compared with the experimental ones for beams tested by Jenq and Shah and by Bažant and Pfeiffer. The results indicate that the descending portion of the load-deflection curve is very sensitive to the GF value used.

Load balancing algorithms for an extended hypercube

Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks

Effect of Short Duration of Load increment on the Compressibility of Soils

This study concerns the effect of duration of load increment (up to 24 h) on the consolidation properties of expansive black cotton soil (liquid limit = 81%) and nonexpansive kaolinite (liquid limit = 49%). It indicates that the amount and rate of compression are not noticeably affected by the duration of loading for a standard sample of 25 mm in height and 76.2 mm in diameter with double drainage. Hence, the compression index and coefficient of consolidation can be obtained with reasonable accuracy even if the duration of each load increment is as short as 4 h. The secondary compression coefficient (C-alpha epsilon) for kaolinite can be obtained for any pressure range with 1/2 h of loading, which, however, requires 4 h for black cotton soil. This is because primary consolidation is completed early in the case of kaolinite. The paper proves that the conventional consolidation test can be carried out with much shorter duration of loading (less than 4 h) than the standard specification of 24 h or more even for remolded fine-grained soils.

Scheduling expression trees with reusable registers on delayed-load architectures

In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.