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.

Rapid transfection assay for screening mutagens and carcinogens

Testing for mutagenicity and carcinogenicity has become an integral part of the toxicological evaluation of drugs and chemicals. Standard carcinogenicity tests in vivo require both large numbers of animals and prolonged experiments. To circumvent these problems, several rapid tests have been developed for preliminary screening of mutagens and carcinogens in vitro. Ames and his associates, the first to develop a mutation test, used mutant strains of Salmonella typhimurium [1]. Mutation tests with Escherichia coli, Bacillus subtilis, Neurospora crassa and Saccharomyces cerevisiae, and DNA-repair tests with E. coli and B. subtilis, have been developed. Cytogenetic assays, in vivo as well as in vitro, in both plant and animal systems, are also used to detect potential mutagens and carcinogens. Transfection is inhibited by base mutation, cleavage of DNA, loss of cohesive ends, interaction with histones, spermidine, nalidixic acid, etc. [3]. The efficiency of transfection is affected by temperature, DNA structure and the condition of the competence of the recipient cells [3]. Transfection assays with phages MS: RNA and ~i, x 174-DNA have been reported [15]. A fast and easy transfection assay using colitis bacteriophage DNA is reported in this communication.

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.

Enhancing sensor network lifetime using interactive communication

We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message interactive communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.

Role of information and communication in redefining unmanned aerial vehicle autonomous control levels

Autonomous mission control, unlike automatic mission control which is generally pre-programmed to execute an intended mission, is guided by the philosophy of carrying out a complete mission on its own through online sensing, information processing, and control reconfiguration. A crucial cornerstone of this philosophy is the capability of intelligence and of information sharing between unmanned aerial vehicles (UAVs) or with a central controller through secured communication links. Though several mission control algorithms, for single and multiple UAVs, have been discussed in the literature, they lack a clear definition of the various autonomous mission control levels. In the conventional system, the ground pilot issues the flight and mission control command to a UAV through a command data link and the UAV transmits intelligence information, back to the ground pilot through a communication link. Thus, the success of the mission depends entirely on the information flow through a secured communication link between ground pilot and the UAV In the past, mission success depended on the continuous interaction of ground pilot with a single UAV, while present day applications are attempting to define mission success through efficient interaction of ground pilot with multiple UAVs. However, the current trend in UAV applications is expected to lead to a futuristic scenario where mission success would depend only on interaction among UAV groups with no interaction with any ground entity. However, to reach this capability level, it is necessary to first understand the various levels of autonomy and the crucial role that information and communication plays in making these autonomy levels possible. This article presents a detailed framework of UAV autonomous mission control levels in the context of information flow and communication between UAVs and UAV groups for each level of autonomy.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Preliminary X-ray crystallographic analysis of 2-methylcitrate synthase from Salmonella typhimurium

Analysis of the genomic sequences of Escherichia coli and Salmonella typhimurium has revealed the presence of several homologues of the well studied citrate synthase (CS). One of these homologues has been shown to code for 2-methylcitrate synthase (2-MCS) activity. 2-MCS catalyzes one of the steps in the 2-methylcitric acid cycle found in these organisms for the degradation of propionate to pyruvate and succinate. In the present work, the gene coding for 2-MCS from S. typhimurium (StPrpC) was cloned in pRSET-C vector and overexpressed in E. coli. The protein was purified to homogeneity using Ni-NTA affinity chromatography. The purified protein was crystallized using the microbatch-under-oil method. The StPrpC crystals diffracted X-rays to 2.4 A resolution and belonged to the triclinic space group P1, with unit-cell parameters a = 92.068, b = 118.159, c = 120.659 A, alpha = 60.84, beta = 67.77, gamma = 81.92 degrees. Computation of rotation functions using the X-ray diffraction data shows that the protein is likely to be a decamer of identical subunits, unlike CSs, which are dimers or hexamers.

Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decoding

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasistatic, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.

Crystallization and Preliminary X-ray Studies of the Basic Lectin from Winged Bean (Psophocarpus tetragonolobus)

The basic lectin from winged bean (Psophocarpus tetragonolobus) could be crystallized using polyethyleneglycol (PEG) 4000 (I), PEG 8000 (II) and 2-methylpentane-2,4-diol (MPD) (III) as precipitants. Crystal forms I and II grew in the presence of methyl-α-Image -galactopyranoside or N -acetylgalactosamine while III grew in the absence of sugar. The three forms have the same space group (P21212) and similar unit cell dimensions with two dimeric molecules in the asymmetric unit. The unit cell dimensions are a = 156·8 Å, b = 89·0 Å, c = 73·3 Å for I, a = 155·5 Å, b = 92·3 Å, c = 72·5 Å for II and a = 148·3 Å, b = 90·7 Å, c = 73·8 Å for III. The crystals, particularly those grown using PEG 8000, are suitable for high resolution X-ray analysis, which is in progress.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

A preliminary survey of dermatomycoses in Bangalore

Clinical and mycological investigations were made on 225 cases of suspected dermatomycoses. Of these, 102 were microscopically positive. But only 63 were culturally positive, and these are analysed here with regard to clinical patterns and aetiological species, age, sex and occupational incidence and susceptibility to griseofulvin in vitro. As in most other parts of India, Trichophyton rubrum was the dominant species. A high proportion of Epidermophyton floccosum was an unusual feature seen. Of the clinical types, tinea cruris was the most common. The isolates were sensitive to griseofulvin at low concentrations of 1 to 5 μg per ml of agar medium, E. floccosum being the most sensitive.