Impact of heterogeneous link qualities and network connectivity on binary consensus

In this paper we consider a network that is trying to reach consensus over the occurrence of an event while communicating over Additive White Gaussian Noise (AWGN) channels. We characterize the impact of different link qualities and network connectivity on consensus performance by analyzing both the asymptotic and transient behaviors. More specifically, we derive a tight approximation for the second largest eigenvalue of the probability transition matrix. We furthermore characterize the dynamics of each individual node. © 2009 AACC.

Model reductions for inference: generality of pairwise, binary, and planar factor graphs.

We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.

Analysis of expression of the binary toxin genes from Bacillus sphaericus in Anabaena and the potential in mosquito control

Anabaena strains expressing the binary toxin genes of Bacillus sphaericus produce high larvicidal activity with living cells. Western blot analysis showed that the 51-kDa and 42-kDa toxin proteins were stable in Anabaena. When a DNA fragment upstream of the 51-kDa protein gene was deleted, the toxicity was reduced by over a hundred-fold, whereas deletions at the coding regions showed that the cooperation of the two proteins expressed in Anabaena is essential for the larvicidal activity. Outdoor tests showed that the genetically altered Anabaena could keep containers with natural water from being inhabited by Culex larvae for over 2 months.

Compact Reconfigurable Binary-Decision-Diagram Logic Circuit on a GaAs Nanowire Network

We describe a reconfigurable binary-decision-diagram logic circuit based on Shannon's expansion of Boolean logic function and its graphical representation on a semiconductor nanowire network. The circuit is reconfigured by using programmable switches that electrically connect and disconnect a small number of branches. This circuit has a compact structure with a small number of devices compared with the conventional look-up table architecture. A variable Boolean logic circuit was fabricated on an etched GaAs nanowire network having hexagonal topology with Schottky wrap gates and SiN-based programmable switches, and its correct logic operation together with dynamic reconfiguration was demonstrated.

Compact non-binary fast adders using single-electron devices

This paper proposes compact adders that are based on non-binary redundant number systems and single-electron (SE) devices. The adders use the number of single electrons to represent discrete multiple-valued logic state and manipulate single electrons to perform arithmetic operations. These adders have fast speed and are referred as fast adders. We develop a family of SE transfer circuits based on MOSFET-based SE turnstile. The fast adder circuit can be easily designed by directly mapping the graphical counter tree diagram (CTD) representation of the addition algorithm to SE devices and circuits. We propose two design approaches to implement fast adders using SE transfer circuits the threshold approach and the periodic approach. The periodic approach uses the voltage-controlled single-electron transfer characteristics to efficiently achieve periodic arithmetic functions. We use HSPICE simulator to verify fast adders operations. The speeds of the proposed adders are fast. The numbers of transistors of the adders are much smaller than conventional approaches. The power dissipations are much lower than CMOS and multiple-valued current-mode fast adders. (C) 2009 Elsevier Ltd. All rights reserved.

incomplete exponential sums over galois rings with applications to some binary sequences derived from z(2l)

IEEE Computer Society