A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection

In [8], we recently presented two computationally efficient algorithms named B-RED and P-RED for random early detection. In this letter, we present the mathematical proof of convergence of these algorithms under general conditions to local minima.

A Circuit-Based Proof of Toda′s Theorem

We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).

A compact proof of Fisher�s Fundamental Theorem for multiple loci

A systematic method is formulated to carry out theoretical analysis in a multilocus multiallele genetic system. As a special application, the Fundamental Theorem of Natural Selection is proved (in the continuous time model) for a multilocus multiallele system if all pairwise linkage disequilibria are zero.

Proof of a conjecture of Frankl and Furedi

We give a simple linear algebraic proof of the following conjecture of Frankl and Furedi [7, 9, 13]. (Frankl-Furedi Conjecture) if F is a hypergraph on X = {1, 2, 3,..., n} such that 1 less than or equal to /E boolean AND F/ less than or equal to k For All E, F is an element of F, E not equal F, then /F/ less than or equal to (i=0)Sigma(k) ((i) (n-1)). We generalise a method of Palisse and our proof-technique can be viewed as a variant of the technique used by Tverberg to prove a result of Graham and Pollak [10, 11, 14]. Our proof-technique is easily described. First, we derive an identity satisfied by a hypergraph F using its intersection properties. From this identity, we obtain a set of homogeneous linear equations. We then show that this defines the zero subspace of R-/F/. Finally, the desired bound on /F/ is obtained from the bound on the number of linearly independent equations. This proof-technique can also be used to prove a more general theorem (Theorem 2). We conclude by indicating how this technique can be generalised to uniform hypergraphs by proving the uniform Ray-Chaudhuri-Wilson theorem. (C) 1997 Academic Press.

On the proof of the Poincare´ conjecture

In 2002, Perelman proved the Poincare conjecture, building on the work of Richard Hamilton on the Ricci flow. In this article, we sketch some of the arguments and attempt to place them in a broader dynamical context.

Iron-carbon hybrid capacitor: A proof-of-concept study

In the present study, cost-intensive Ni electrode is replaced by high surface-area activated carbon (AC) cathode and the possibility of the Fe anode, used in Ni-Fe battery, to function as Fe-C hybrid capacitor has been examined. The electrochemical properties of Fe-C hybrid capacitor assembly are studied using cyclic voltammetry (CV) and galvanostatic charge-discharge cycles. Over 100 galvanostatic charge-discharge cycles for Fe-C hybrid capacitor are carried out and a maximum capacitance of 24 F g(-1) is observed.

A bio-attuned ratiometric hydrogen sulfate ion selective receptor in aqueous solvent: structural proof of the H-bonded adduct

A new cell permeable quinazoline based receptor (1) selectively senses HSO4- ions of nanomolar region in 0.1 M HEPES buffer (ethanol-water: 1/5, v/v) at biological pH over other competitive ions through the proton transfer followed by hydrogen bond formation and subsequent anion coordination to yield the LHSO4]-LH+center dot 3H(2)O (2) ensemble, which has been crystallographically characterised to ensure the structure property relationship. This non-cytotoxic HSO4- ion selective biomarker has great potential to recognize the intercellular distribution of HSO4- ions in HeLa cells under fluorescence microscope.

Understanding the Knowledge Needs of Designers During Design Process in Industry

Product success is substantially influenced by satisfaction of knowledge needs of designers, and many tools and methods have been proposed to support these needs. However, adoption of these methods in industry is minimal. This may be due to an inadequate understanding of the knowledge needs of designers in industry. This research attempts to develop a better understanding of these needs by undertaking descriptive studies in an industry. We propose a taxonomy of knowledge, and evaluate this by analyzing the questions asked by the designers involved in the study during their interactions. Using the taxonomy, we converted the questions asked into a generic form. The generic questions provide an understanding about what knowledge must be captured during design, and what its structure should be.