Performance analysis of information dissemination by flooding

Performance properties are established for the dissemination by flooding of a database that is initially distributed among the nodes of a communications network. An example of this general process is the dissemination of network status information as a component of the adaptive routing mechanism in a network like Arpanet. Bounds are given on the progress of the dissemination process at a sequence of times before the completion of the process, whereas earlier results only bounded the time until completion. The present bounds further extended earlier analysis by treating the diameter explicitly as a parameter. Specialized versions of the bounds are given for k-connected networks. The bounds yield a recognition property whereby a node can recognize that it has received the entire database without having a priori knowledge of the size of the database. An earlier assumption about a fixed time for correct message transmission over any edge is relaxed to assume only an upper bound on these transmission times     

Three-Phase Induction Generator for Single-Phase Line

Hydroelectric generators of less than 20 kilowatts can be in remote areas served only by a single-phase line. For high efficiency and low cost, a three-phase induction generator should be used. This three-phase generator can operate with balanced voltages and currents when the ``phase-splitting' circuit uses two capacitors connetted to two different single-phase voltage sources.     

Inference of message sequence charts

Software designers draw message sequence charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? If so, can we automatically synthesize concurrent state machines realizing the given MSCs? If, on the other hand, other unspecified and possibly unwanted scenarios are "implied" by their MSCs, can the software designer be automatically warned and provided the implied MSCs? In this paper, we provide a framework in which all these questions are answered positively. We first describe the formal framework within which one can derive implied MSCs and then provide polynomial-time algorithms for implication, realizability, and synthesis.     

An example of a GAS system which can be destabilized by an integrable perturbation

A construction of a globally asymptotically stable time-invariant system which can be destabilized by some integrable perturbation is given. Besides its intrinsic interest, this serves to provide counterexamples to an open question regarding Lyapunov functions.     

Electromagnetic signatures as a tool for connectionless test

When we test boards, we usually think in terms of traditional electrical test (in-circuit, flying probe) and nonelectrical test (optical, x-ray). This Orebro University article develops an alternative, connectionless technique based on scanning the electromagnetic field generated by active on-board devices. Could this make it into industry as an additional diagnostic tool?.     

Phylogenetic scanning: a computer-assisted algorithm for mapping gene conversions and other recombinational events

An algorithm, 'phylogenetic scanning', is described for mapping gene conversion events where comparative DNA sequence data are available from different species. In this algorithm, sets of hypothetical phylogenetic trees are constructed that describe possible sequence relationships due to gene conversions in different species lineages; these trees are then evaluated by the principle of parsimony at intervals in the sequence alignment. When used to map gene conversion events that occurred between the pair of gamma-globin genes of higher primates, the algorithm gives results nearly identical to those obtained using a tedious manual approach. Suggestions are also provided for adaptation of this procedure to the analysis of other recombination events.     

Quality-Assurance Technology in Japan

A survey of the state of SQA in Japan finds that the situation is much like, but slightly different than, that in the US.     

The Metaflow architecture

The Metaflow architecture, a unified approach to maximizing the performance of superscalar microprocessors, is introduced. The Metaflow architecture exploits inherent instruction-level parallelism in conventional sequential programs by hardware means, without relying on optimizing compilers. It is based on a unified structure, the DRIS (deferred-scheduling, register-renaming instruction shelf), that manages out-of-order execution and most of the attendant problems. Coupling the DRIS with a speculative-execution mechanism that avoids conditional branch stalls results in performance limited only be inherent instruction-level parallelism and available execution resources. Although presented in the context of superscalar machines, the technique is equally applicable to a superpipelined implementation. Lightning, the first implementation of the Metaflow architecture, which executes the Sparc RISC instruction set is described