Stability analysis of aperiodic messages scheduled in the dynamic segment of flex ray protocol

In a cyber physical system like vehicles number of signals to be communicated in a network system has an increasing trend. More and more mechanical and hydraulic parts are replaced by electronic control units and infotainment and multimedia applications has increased in vehicles. Safety critical hard real time messages and aperiodic messages communicated between electronic control units have been increased in recent times. Flexray is a high bandwidth protocol consisting of static segment for supporting hard real time messages and a dynamic segment for transmitting soft and non real time messages. In this paper, a method to obtain the stability region for the random arrival of messages in each electronic control units which is scheduled in the dynamic segment of Flexray protocol is presented. Number of mini slots available in the dynamic segment of Flexray restricts the arrival rate of tasks to the micro controllers or the number of micro controllers connected to the Flexray bus. Stability region of mathematical model of the system is compared with the Flexray protocol simulation results.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

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.

Dual Power Multiple Access with Multipacket Reception using Local CSI

Contention-based multiple access is a crucial component of many wireless systems. Multiple-packet reception (MPR) schemes that use interference cancellation techniques to receive and decode multiple packets that arrive simultaneously are known to be very efficient. However, the MPR schemes proposed in the literature require complex receivers capable of performing advanced signal processing over significant amounts of soft undecodable information received over multiple contention steps. In this paper, we show that local channel knowledge and elementary received signal strength measurements, which are available to many receivers today, can actively facilitate multipacket reception and even simplify the interference canceling receiver¿s design. We introduce two variants of a simple algorithm called Dual Power Multiple Access (DPMA) that use local channel knowledge to limit the receive power levels to two values that facilitate successive interference cancellation. The resulting receiver structure is markedly simpler, as it needs to process only the immediate received signal without having to store and process signals received previously. Remarkably, using a set of three feedback messages, the first variant, DPMA-Lite, achieves a stable throughput of 0.6865 packets per slot. Using four possible feedback messages, the second variant, Turbo-DPMA, achieves a stable throughput of 0.793 packets per slot, which is better than all contention algorithms known to date.

Graphical simulation of Petri Nets

An interactive graphics package for modeling with Petri Nets has been implemented. It uses the VT-11 graphics terminal supported on the PDP-11/35 computer to draw, execute, analyze, edit and redraw a Petri Net. Each of the above mentioned tasks can be performed by selecting appropriate items from a menu displayed on the screen. Petri Nets with a reasonably large number of nodes can be created and analyzed using this package. The number of nodes supported may be increased by making simple changes in the program. Being interactive, the program seeks information from the user after displaying appropriate messages on the terminal. After completing the Petri Net, it may be executed step by step and the changes in the number of tokens may be observed on the screen, at each place. Some properties of Petri Nets like safety, boundedness, conservation and redundancy can be checked using this package. This package can be used very effectively for modeling asynchronous (concurrent) systems with Petri Nets and simulating the model by “graphical execution.”

Specific polyadenylation and purification of total messenger RNA from Escherichia coli

Obtaining pure mRNA preparations from prokaryotes has been difficult, if not impossible, for want of a poly(A) tail on these messages, We have used poly(A) polymerase from yeast to effect specific polyadenylation of Escherichia coli polysomal mRNA in the presence of magnesium and manganese, The polyadenylated total mRNA, which could be subsequently purified by binding to and elution from oligo(dT) beads, had a size range of 0.4-4.0 kb. We have used hybridization to a specific plasmid-encoded gene to further confirm that the polyadenylated species represented mRNA, Withdrawal of Mg2+ from the polyadenylation reaction rRNA despite the presence of Mn2+, indicating the vital role of Mg2+ in maintaining the native structure of polysomes, Complete dissociation of polysomes into ribosomal subunits resulted in quantitative polyadenylation of both 16S and 23S rRNA species, Chromosomal lacZ gene-derived messages were quantitatively recovered in the oligo(dT)-bound fraction, as demonstrated by RT-PCR analysis, Potential advantages that accrue from the availability of pure total mRNA from prokaryotes is discussed.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

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.

An efficient and scalable checkpointing and recovery algorithm for distributed systems

In this paper, we describe an efficient coordinated-checkpointing and recovery algorithm which can work even when the channels are assumed to be non-FIFO, and messages may be lost. Nodes are assumed to be autonomous, and they do not block while taking checkpoints. Based on the local conditions, any process can request the previous coordinator for the 'permission' to initiate a new checkpoint. Allowing multiple initiators of checkpoints avoids the bottleneck associated with a single initiator, but the algorithm permits only a single instance of checkpointing process at any given time, thus reducing much of the overhead associated with multiple initiators of distributed algorithms.

Reducing the babel in plant volatile communication: using the forest to see the trees

While plants of a single species emit a diversity of volatile organic compounds (VOCs) to attract or repel interacting organisms, these specific messages may be lost in the midst of the hundreds of VOCs produced by sympatric plants of different species, many of which may have no signal content. Receivers must be able to reduce the babel or noise in these VOCs in order to correctly identify the message. For chemical ecologists faced with vast amounts of data on volatile signatures of plants in different ecological contexts, it is imperative to employ accurate methods of classifying messages, so that suitable bioassays may then be designed to understand message content. We demonstrate the utility of `Random Forests' (RF), a machine-learning algorithm, for the task of classifying volatile signatures and choosing the minimum set of volatiles for accurate discrimination, using datam from sympatric Ficus species as a case study. We demonstrate the advantages of RF over conventional classification methods such as principal component analysis (PCA), as well as data-mining algorithms such as support vector machines (SVM), diagonal linear discriminant analysis (DLDA) and k-nearest neighbour (KNN) analysis. We show why a tree-building method such as RF, which is increasingly being used by the bioinformatics, food technology and medical community, is particularly advantageous for the study of plant communication using volatiles, dealing, as it must, with abundant noise.

How do heterogametic females survive without gene dosage compensation?

When the male is the heterogametic sex (XX♀-XY♂ or XX♀-XO♂), as inDrosophila, orthopteran insects, mammals andCaenorhabditis elegans, X-linked genes are subject to dosage compensation: the single X in the male is functionally equivalent to the two Xs in the female. However, when the female is heterogametic (ZZ♂-ZW♀), as in birds, butterflies and moths, Z-linked genes are apparently not dosage-compensated. This difference between X-linked and Z-linked genes raises fundamental questions about the role of dosage compensation. It is argued that (i) genes which require dosage compensation are primarily those that control morphogenesis and the prospective body plan; (ii) the products of these genes are required in disomic doses especially during oogenesis and early embryonic development; (iii) heterogametic females synthesize and store during oogenesis itself morphogenetically essential gene products - including those encoded by Z-linked genes — in large quantities; (iv) the abundance of these gene products in the egg and their persistence relatively late into embryogenesis enables heterogametic females to overcome the monosomic state of the Z chromosome in ZW embryos. Female heterogamety is predominant in birds, reptiles and amphibians, all of which have megalecithal eggs containing several thousand times more maternal RNA and other maternal messages than eggs of mammals,Caenorhabditis elegans, orDrosophila. This increase in egg size, yolk content and, concomitantly, the size of the maternal legacy to the embryo, may have facilitated female heterogamety and the absence of dosage compensation.

Role of oestradiol-17β in the regulation of synthesis and secretion of human chorionic gonadotrophin by first trimester human placenta

Inhibition of aromatase, a key enzyme in the biosynthesis of oestradiol-17 beta, by the addition of 1,4,6-androstatrien-3,17-dione resulted in a significant increase in the levels of immunoreactive human chorionic gonadotrophin (hCG) in the medium and tissue. This increase was partially reversed by the simultaneous addition of oestradiol-17 beta. These effects on the levels of immunoreactive hCG were also reflected by the increased levels of mRNA specific for the alpha and beta subunits of hCG following the addition of the aromatase inhibitor. However, addition of tamoxifen resulted in a drastic decrease in the levels of both the messages. Based on these results, it is suggested that the synthesis of hCG is negatively modulated by oestradiol-17 beta in the human placenta.

Queued Cooperative Wireless Networks With Rateless Codes

Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has recently attracted considerable interest. It provides a natural and efficient mechanism for accumulating mutual information from multiple transmitting relays. We develop an analysis of queued cooperative relay systems that combines the communication-theoretic transmission aspects of cooperative communication using rateless codes over Rayleigh fading channels with the queuing-theoretic aspects associated with buffering messages at the relays. Relay cooperation combined with queuing reduces the message transmission times and also helps distribute the traffic load in the network, which improves throughput significantly.

Isolation of transforming growth factor-beta 2 cDNA from a fish, Cyprinus carpio by RT-PCR

Transforming Growth Factors-beta (TGF-beta s) have been described in many vertebrate species of amphibians, aves and mammals. In this report we demonstrate the presence of TGF-beta 2 in pisces. TGF-beta 2 has been cloned from a fish, Cyrinus carpio, by RT-PCR using degenerate oligonucleotide primers. Sequence analysis of the amplified product and alignment of the deduced amino acid sequence with the human TGF-beta 2 amino acid sequence revealed 81% and 93% identity in the precursor and the mature regions, respectively. The northern blot analysis of fish heart RNA shows a major messenger RNA species of about 8.0 kb and two messages of very low abundance of about 5.0 kb and 4.0 kb. The identification of TGF-beta 2 isoform in Pisces and it's high degree of homology with the mammalian isoform suggests that among all TGF-beta isoforms, TGF-beta 2 is the most conserved during evolution. (C) 1997 Elsevier Science B.V.