The scale-invariance of spatial patterning in a developing system

Regulating systems, that is, those which exhibit scale-invariant patterns in the adult, are supposed, to do so on account of interactions between cells during development. The nature of these interactions has to be such that the system of positional information (ldquomaprdquo) in the embryo also regulates. To our knowledge, this supposition regarding a regulating map has not been subjected to a direct test in any embryonic system. Here we do so by means of a simple and novel criterion and use it to examine tip regeneration in the mulicellular stage (slug) ofDictyostelium discoideum. When anterior, tip-containing fragments of slugs are amputated, a new tip spontaneously regenerates at the cut surface of the (remaining) posterior fragment. The time needed for regeneration to occur depends on the relative size of the amputated fragment but is independent of the total size of the slug. We conclude from this finding that there is at least one system underlying positional information in the slug which regulates.

The determination of spatial pattern in Dictyostelium discoideum

Free-living amoebae of the cellular slime mould Dictyostelium discoideum aggregate when starved and give rise to a long and thin multicellular structure, the slug. The slug resembles a metazoan embryo, and as with other embryos it is possible to specify a fate map. In the case of Dictyostelium discoideum the map is especially simple: cells in the anterior fifth of the slug die and form a stalk while the majority of those in the posterior differentiate into spores. The genesis of this anterior-posterior distinction is the subject of our review. In particular, we ask: what are the relative roles of individual pre-aggregative predispositions and post-aggregative position in determining cell fate? We review the literature on the subject and conclude that both factors are important. Variations in nutritional status, or in cell cycle phase at starvation, can bias the probability that an amoeba differentiates into a stalk cell or a spore. On the other hand, isolates, or slug fragments, consisting of only prestalk cells or only prespore cells can regulate so as to result in a normal range of both cell types. We identify three levels of control, each being responsible for guiding patterning in normal development: (i) 'coin tossing', whereby a cell autonomously exhibits a preference for developing along either the stalk or the spore pathway with relative probabilities that can be influenced by the environment; (ii) 'chemical kinetics', whereby prestalk and prespore cells originate from undifferentiated amoebae on a probabilistic basis but, having originated, interact (e.g. via positive and negative feedbacks), and the interaction influences the possibility of conversion of one cell type into the other, and (iii) 'positional information', in which the spatial distribution of morphogens in the slug influences the pathway of differentiation. In the case of possibilities (i) and (ii), sorting out of like cell types leads to the final spatial pattern. In the case of possibility (iii), the pattern arises in situ.

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

Positional dependence of material flow in friction stir welding: analysis of joint line remnant and its relevance to dissimilar metal welding

Understanding material flow in friction stir welding is important for production of sound dissimilar metal welding that control the intermixing of two alloys being welded and consequent formation of new constituents which influences the weld properties. In the present experimental investigation material flow patterns are visualised using dissimilar and similar aluminium alloys using a simple innovative ,experiment. The experimental results reveal that only a portion of material transported from the leading edge undergoes chaotic flow and the remaining is deposited systematically in the trailing edge of the weld. Using this information it is shown that the formation of a friction stir welding defect, joint line remnant, does not occur only when the weld interface is on the advancing side. The material flow visualisation study has been utilised to analyse the mechanism of weld formation and its usefulness in improving fatigue properties and for dissimilar metal welds.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Broadcast Control Mechanism for Positional Consensus in Multiagent Systems

In this paper, a strategy for controlling a group of agents to achieve positional consensus is presented. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming (LP) formulation that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command that helps the agents to come close to each other even for a large number of agents, which was not possible with an existing strategy in the literature, is introduced. The method is extended to achieve positional consensus at a prespecified location. The effectiveness of the approach is illustrated through simulation results. A comparison between the LP approach and the existing second-order cone programming-based approach is also presented. The algorithm was successfully implemented on a robotic platform with three robots.

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.

G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.

Information theory and one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. It is suggested, for the probability distribution of the transfer matrix of the conductor, the distribution of maximum information-entropy, constrained by the following physical requirements: 1) flux conservation, 2) time-reversal invariance and 3) scaling, with the length of the conductor, of the two lowest cumulants of ζ, where = sh2ζ. The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

ADAMIS: a database for medical information systems

This paper describes the design and implementation of ADAMIS (‘A database for medical information systems’). ADAMIS is a relational database management system for a general hospital environment. Apart from the usual database (DB) facilities of data definition and data manipulation, ADAMIS supports a query language called the ‘simplified medical query language’ (SMQL) which is completely end-user oriented and highly non-procedural. Other features of ADAMIS include provision of facilities for statistics collection and report generation. ADAMIS also provides adequate security and integrity features and has been designed mainly for use on interactive terminals.

Information theory and resistance fluctuations in one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. For the probability distribution of the transfer matrix R of the conductor we propose a distribution of maximum information entropy, constrained by the following physical requirements: (1) flux conservation, (2) time-reversal invariance, and (3) scaling with the length of the conductor of the two lowest cumulants of ω, where R=exp(iω→⋅Jbhat). The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

Interval Data Classification under Partial Information: A Chance-Constraint Approach

This paper presents a Chance-constraint Programming approach for constructing maximum-margin classifiers which are robust to interval-valued uncertainty in training examples. The methodology ensures that uncertain examples are classified correctly with high probability by employing chance-constraints. The main contribution of the paper is to pose the resultant optimization problem as a Second Order Cone Program by using large deviation inequalities, due to Bernstein. Apart from support and mean of the uncertain examples these Bernstein based relaxations make no further assumptions on the underlying uncertainty. Classifiers built using the proposed approach are less conservative, yield higher margins and hence are expected to generalize better than existing methods. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle interval-valued uncertainty than state-of-the-art.

Positional Preferences of Polypurine/Polypyrimidine Tracts in Saccharomyces cerevisiae Genome: Implications for cis Regulation of Gene Expression

The complete genome of the baker's yeast S. cerevisiae was analyzed for the presence of polypurine/polypyrimidine (poly[pu/py]) repeats and their occurrences were classified on the basis of their location within and outside open reading frames (ORFs). The analysis reveals that such sequence motifs are present abundantly both in coding as well as noncoding regions. Clear positional preferences are seen when these tracts occur in noncoding regions. These motifs appear to occur predominantly at a unit nucleosomal length both upstream and downstream of ORFs. Moreover, there is a biased distribution of polypurines in the coding strands when these motifs occur within open reading frames. The significance of the biased distribution is discussed with reference to the occurrence of these motifs in other known mRNA sequences and expressed sequence tags. A model for cis regulation of gene expression is proposed based on the ability of these motifs to form an intermolecular triple helix structure when present within the coding region and/or to modulate nucleosome positioning via enhanced histone affinity when present outside coding regions.

Information Ambiguity

We propose a quantity called information ambiguity that plays the same role in the worst-case information-theoretic nalyses as the well-known notion of information entropy performs in the corresponding average-case analyses. We prove various properties of information ambiguity and illustrate its usefulness in performing the worst-case analysis of a variant of distributed source coding problem.