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.

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.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

EEG seizure in bilateral ECT is different between low and high stimulus doses

Melancholic depressive patients referred for ECT were randomized to receive either low dose (n = 20) or high dose (n = 20) stimulus applied bifrontotemporally. The two stimulus groups were comparable on the clinical variables. The EEG seizure was recorded on two channels (right and left frontal), digitized, coded and analyzed offline without knowledge of ECT parameters. EEG seizure was of comparable duration in the two stimulus (high dose and low dose) groups. A new composite measure, Strength-Symmetry-Index (SSI), based on strength and symmetry of seizure EEG was computed using fractal geometry. The SSI of the early-seizure was higher in the high dose than in the low dose ECT group. In a stepwise, logistic regression model, this variable contributed to 65% with correct classification of high dose and low dose ECT seizures.

Intercellular Communication in the Multicellular Stage of Dictyostelium-Discoideum

The aim of the present study was to draw inferences regarding the properties of single cells responsible for co-operative behaviour in the slug of the soil amoeba Dictyostelium discoideum. The slug is an integrated multicellular mass formed by the aggregation of starved cells. The amoebae comprising the slug differentiate according to their spatial locations relative to one another, implying that, as in the case of other regulative embryos, they must be in mutual communication. We have previously shown that one manifestation of this communication is the time taken for the anteriormost fragment of the slug, the tip, to regenerate from slugs which have been rendered tipless by amputation. We present results of tip-regeneration experiments performed on genetically mosaic slugs. By comparing the mosaics with their component pure genotypes, we were able to discriminate between a set of otherwise equally plausible modes of intercellular signalling. Neither a'pacemaker' model, in which the overall rate of tip regeneration is determined by the cell with the highest frequency of autonomous oscillation, nor an 'independent-particle' model, in which the rate of regeneration is the arithmetical average of independent cell-dependent rates, is in quantitative accord with our findings. Our results are best explained by a form of signalling which operates by means of cell-to-cell relay. Therefore intercellular communication Seems to be essential for tip regeneration.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.

Priority-oriented reservation multiple access scheme for data communication through satellites

A multi-access scheme is proposed for handling priority-based messages in data communication systems through satellites. The different schemes by which time slots are alloted by the satellite are based on a ‘priority index’. The performance characteristics of the system using these schemes under different traffic conditions are discussed.

Two Tools for Interprocess Communication in Distributed Data-Flow Systems

Abstract is not available.

Effect of vitamin A deprivation on the cholesterol side-chain cleavage enzyme activity of testes and ovaries of rats (Short Communication)

The cholesterol side-chain cleavage enzyme activity is decreased considerably at the mild stage of vitamin A deficiency in rat testes and ovaries and the decrease in activity becomes more pronounced with progress of deficiency. Supplementation of the deficient rats with retinyl acetate, but not retinoic acid, restores the enzyme activity to normal values. The cholesterol side-chain cleavage enzyme of adrenals is not affected by any of the above treatments.

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.

Technological-forecasting and research inputs in area of birth-control technology

Technological forecasting, defined as quantified probabilistic prediction of timings and degree of change in the technological parameters, capabilities desirability or needs at different times in the future, is applied to birth control technology (BCT) as a means of revealing the paths of most promising research through identifying the necessary points for breakthroughs. The present status of BCT in the areas of pills and the IUD, male contraceptives, immumological approaches, post-coital pills, abortion, sterilization, luteolytic agents, laser technologies, and control of the sex of the child, are each summarized and evaluated in turn. Fine mapping is done to identify the most potentially promising areas of BCT. These include efforts to make oral contraception easier, improvement of the design of the IUD, clinical evaluation of the male contraceptive danazol, the effecting of biochemical changes in the seminal fluid, and researching of immunological approaches and the effects of other new drugs such as prostaglandins. The areas that require immediate and large research inputs are oral contraception and the IUD. On the basis of population and technological forecasts, it is deduced that research efforts could most effectively aid countries like India through the immediate production of an oral contraceptive pill or IUD with long-lasting effects. Development of a pill for males or an immunization against pre gnancy would also have a significant impact. However, the major impediment to birth control programs to date is attitudes, which must be changed through education.

Clinical and immunological studies on persons exposed toParthenium hysterophorus L

Studies on 300 persons subjected by occupational hazard to the allergenic weed, Parthenium hysterophorus L. for periods ranging from 3 to 12 months revealed that 4% of them developed contact dermatitis of the exposed parts of the body, while 56% of them got sensitized to the weed without apparently exhibiting any dermatitis. None of them suffered from allergic manifestations like rhinitis or bronchial asthma during the period of study which extended for 2 years.

Cochannel Interference in Partially Coherent Communication

Effects of cochannel interference and synchronization error of the carrier phase on the probability of error in binary communications are considered. Several bounds on the probability of error are proposed. The bounds are easy to compute and do not require complete statistical characterization of the errors. They turn out to be simple linear combinations of error probabilities with no cochannel interferences and no phase errors. Several illustrative examples are given which show that the bounds can be tight.

Ligand dependent intra and inter subunit communication in human tryptophanyl tRNA synthetase as deduced from the dynamics of structure networks

Homodimeric protein tryptophanyl tRNA synthetase (TrpRS) has a Rossmann fold domain and belongs to the 1c subclass of aminoacyl tRNA synthetases. This enzyme performs the function of acylating the cognate tRNA. This process involves a number of molecules (2 protein subunits, 2 tRNAs and 2 activated Trps) and thus it is difficult to follow the complex steps in this process. Structures of human TrpRS complexed with certain ligands are available. Based on structural and biochemical data, mechanism of activation of Trp has been speculated. However, no structure has yet been solved in the presence of both the tRNA(Trp) and the activated Trp (TrpAMP). In this study, we have modeled the structure of human TrpRS bound to the activated ligand and the cognate tRNA. In addition, we have performed molecular dynamics (MD) simulations on these models as well as other complexes to capture the dynamical process of ligand induced conformational changes. We have analyzed both the local and global changes in the protein conformation from the protein structure network (PSN) of MD snapshots, by a method which was recently developed in our laboratory in the context of the functionally monomeric protein, methionyl tRNA synthetase. From these investigations, we obtain important information such as the ligand induced correlation between different residues of this protein, asymmetric binding of the ligands to the two subunits of the protein as seen in the crystal structure analysis, and the path of communication between the anticodon region and the aminoacylation site. Here we are able to elucidate the role of dimer interface at a level of detail, which has not been captured so far.

A glimpse into the clinical proteome of human malaria parasites Plasmodium falciparum and Plasmodium vivax

Malaria causes a worldwide annual mortality of about a million people.Rapidly evolving drug-resistant species of the parasite have created a pressing need for the identification of new drug targets and vaccine candidates. By developing fractionation protocols to enrich parasites from low-parasitemia patient samples, we have carried out the first ever proteomics analysis of clinical isolates of early stages of Plasmodium falciparum (Pf) and P. vivax. Patient-derived malarial parasites were directly processed and analyzed using shotgun proteomics approach using high-sensitivity MS for protein identification. Our study revealed about 100 parasite-coded gene products that included many known drug targets such as Pf hypoxanthine guanine phosphoribosyl transferase, Pf L-lactate dehydrogenase, and Plasmepsins. In addition,our study reports the expression of several parasite proteins in clinical ring stages that have never been reported in the ring stages of the laboratory-cultivated parasite strain. This proof-of-principle study represents a noteworthy step forward in our understanding of pathways elaborated by the parasite within the malaria patient and will pave the way towards identification of new drug and vaccine targets that can aid malaria therapy.