This memo specifies, for OSPF implementors and users, mechanisms describing how the protocol operates in ATM networks over PVC and SVC meshes with the presence of Proxy-PAR. These recommendations require no protocol changes and allow simpler, more efficient and costeffective network designs. It is recommended that OSPF implementations should be able to support logical interfaces, each consistin...

Ordinary differential equations are often used to model the dynamics and interactions in genetic networks. In one particularly simple class of models, the model genes control the production rates of products of other genes by a logical function, resulting in piecewise linear differential equations. In this article, we construct and analyze an electronic circuit that models this class of piecewi...

Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not g...

This memo specifies, for OSPF implementors and users, mechanisms describing how the protocol operates in ATM networks over PVC and SVC meshes with the presence of Proxy-PAR. These recommendations require no protocol changes and allow simpler, more efficient and costeffective network designs. It is recommended that OSPF implementations should be able to support logical interfaces, each consistin...

In comparison to the conventional complementary pull-up and pull-down logic structure, pass transistor (PTL) family reduces number of transistors required perform functions, thereby reducing both area power consumption. However, this requires inter-stage inverters ensure signal integrity in cascaded circuits, must be used provide each logical input its form. These signals increase device count ...

Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have been introduced to modelize some physical aspects of computation. Those notions are essential in complexity theory, but we claim that a deep mathematical theory is needed to make progress in this area. For that purpose, the recent developments of knot theory is a major s...

We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...

No silicon fabrication and characterization of circuits with topologies designed by evolution has been done before, leaving open questions about the feasibility of the evolutionary design approach, as well as on how highperformance, robust, or portable such designs could really be when implemented in hardware. This paper is the first to report on a silicon implementation of circuits evolved in ...

Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is...

Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an informationtheoretically-secure (ITS...