To determine the relative position of any two surfaces in a system, one approach is to use operations (Minkowski sum and intersection) on sets of constraints. These constraints are made compliant with half-spaces of n  where each set of half-spaces defines an operand polyhedron. These operands are generally unbounded due to the inclusion of degrees of invariance for surfaces and degrees of fre...

Five taxa viz, Agaricus altipes, A. cupreobrunneus, A. placomyces, A. porphyrocephalus, and A. urinascens var. urinascens are reported as new records for Iran. Details of taxonomical important features are also presented herewith. New localities in the west and north-west of the country are reported as habitats of Agaricus speciesin Iran.  

Quantum addition circuits are considered being of two types: (1) Toffoli-adder which use only classical reversible gates (controlled-not and Toffoli), (2) QFT-adder based on the quantum Fourier transformation. We present a systematic translation QFT circuit into Toffoli-based adder. This result shows that has fundamentally same fault-tolerance cost (e.g., T count) as most cost-efficient Toffoli...

We propose a unified approach to addition of some physical quantities (among which resistors and capacitors are the most well-known) that are usually encountered in introductory physics such that the formulæ required to solve problems are always simply additive. This approach has the advantage of being consistent with the intuition of students. To demonstrate the effectiveness of our approach, ...

It is shown that there exists an absolute constant H such that for every h > H, every prime p, and every set A ⊆ Zp such that 10 ≤ |A| ≤ p(lnh)/(9h) and |hA| ≤ h3/2|A|/(8(lnh)1/2), the set A is contained in an arithmetic progression modulo p of cardinality max1≤j≤h−1 |hA|−Pj(|A|) h−j + 1, where Pj(n) = (j+1)j 2 n − j + 1. This result can be viewed as a generalization of Freiman’s “2.4-theorem”.

This paper describes a fully static Complementary Metal-Oxide Semiconductor (CMOS) implementation of a Ling type adder. The implementation described herein saves up to one gate delay and always reduces the number of serial transistors in the worst-case (critical) path over the conventional carry look-ahead (CLA) approach with a negligible increase in hardware.