In addition to its critical role in purine metabolism, xanthine oxidoreductase (XOR) has been implicated in the development of tissue oxidative damage in a wide variety of respiratory and cardiovascular disorders such as acute lung injury, ischemia-reperfusion injury, atherosclerosis, heart failure, and arterial hypertension. Although much remains to be clarified about the regulation and signal...

In this paper, we study the behavior of the XOR count distributions under different bases of finite field. XOR count of a field element is a simplified metric to estimate the hardware implementation cost to compute the finite field multiplication of an element. It is an important criterion in the design of lightweight cryptographic primitives, typically to estimate the efficiency of the diffusi...

An XOR function is a function of the form g(x, y) = f(x ⊕ y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f . We also show that, when f is monotone, g’s quantum and classical complexities are quadratically related, and that ...

As technology has scaled down, the implications of leakage current and power analysis for memory design have increased. To minimize the short channel effect Double-gate FinFET can be used in place of conventional MOSFET circuits due to the self-alignment of the two gates. Design for XOR and XNOR circuits is suggested to improve the speed and power. These circuits act as basic building blocks fo...

This paper concerns with the construction of codes over GF (2) which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR of packets with equal lengths, and is based on highly symmetrical and balanced designs. For certain setups and parameters, our approach offers additional plausible security properties: an adversary needs to eavesdrop ...

A fundamental lemma of Yao states that computational weakunpredictability of Boolean predicates is amplified when the results of several independent instances are XOR together. We survey two known proofs of Yao’s Lemma and present a third alternative proof. The third proof proceeds by first proving that a function constructed by concatenating the values of the original function on several indep...

The paper proposes a novel design of two transistor (2T) XOR gate and its application to design an 8 bit x 8 bit multiplier. The design explores the essence of suitably biasing the MOS transistor and engineering the threshold voltage of the MOS transistor through appropriate biasing and device geometry. Using the 2T XOR gates, a full adder has been realised. Detailed simulations have been carri...

The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of this paper is to extend the XOR Lemma to more general cases where a mapping may not be necessarily regular. The extended XOR Lemma has applications in the design of substitution boxes or S-boxes u...

Although interactions between superoxide (O(2)(.-)) and nitric oxide underlie many physiologic and pathophysiologic processes, regulation of this crosstalk at the enzymatic level is poorly understood. Here, we demonstrate that xanthine oxidoreductase (XOR), a prototypic superoxide O(2)(.-) -producing enzyme, and neuronal nitric oxide synthase (NOS1) coimmunoprecipitate and colocalize in the sar...