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.

A strategy-proof and budget-balanced mechanism for carbon footprint reduction by global companies

The problem addressed in this paper is concerned with an important issue faced by any green aware global company to keep its emissions within a prescribed cap. The specific problem is to allocate carbon reductions to its different divisions and supply chain partners in achieving a required target of reductions in its carbon reduction program. The problem becomes a challenging one since the divisions and supply chain partners, being autonomous, may exhibit strategic behavior. We use a standard mechanism design approach to solve this problem. While designing a mechanism for the emission reduction allocation problem, the key properties that need to be satisfied are dominant strategy incentive compatibility (DSIC) (also called strategy-proofness), strict budget balance (SBB), and allocative efficiency (AE). Mechanism design theory has shown that it is not possible to achieve the above three properties simultaneously. In the literature, a mechanism that satisfies DSIC and AE has recently been proposed in this context, keeping the budget imbalance minimal. Motivated by the observation that SBB is an important requirement, in this paper, we propose a mechanism that satisfies DSIC and SBB with slight compromise in allocative efficiency. Our experimentation with a stylized case study shows that the proposed mechanism performs satisfactorily and provides an attractive alternative mechanism for carbon footprint reduction by global companies.

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.

Al3+-Ion-Triggered Conformational Isomerization of a Rhodamine B Derivative Evidenced by a Fluorescence Signal - A Crystallographic Proof

A newly designed rhodamine B anisaldehyde hydrazone exhibits Al3+-ion-induced cis (L) to trans (L) conformational isomerization with respect to the xanthene moiety through a rotation about a N-N bond; the isomerization is indicated by a detectable naked-eye color change and a turn-on red fluorescence in 4-(2-hydroxyethyl)-1-piperazineethanesulfonic acid (HEPES) buffer (EtOH/Water 1:9 v/v; pH 7.4) at 25 degrees C. In support of this observation, detailed spectroscopic and physicochemical studies along with density function theory (DFT) calculations have been performed. This cis-to-trans conformational isomerization is due to Al3+ ion coordination, which induces this visual color change and the turn-on fluorescence response. To strengthen our knowledge of the conformational isomerization, detailed structural characterizations of the cis and trans isomers in the solid state were performed by single-crystal X-ray diffraction. To the best of our knowledge, this is the first structural report of both cis and trans conformational isomers for this family of compounds. Moreover, this noncytotoxic probe could be used to image the accumulation of Al3+ ions in HeLa and MCF-7 cell lines.

Alternate Proof for Steady-State Equivalent Circuit of a Doubly Fed Induction Machine

This letter presents an alternate proof for the steady-state equivalent circuit of a doubly fed induction machine operating at supersynchronous speeds. The spatial orientation of rotating magnetic fields is used to validate the conjugation of rotor side quantities arising in supersynchronous mode. The equivalent circuit is further validated using dynamic simulations of a stand-alone machine.

Processing and compressive strength of Al-Li-SiCp composites fabricated by a compound billet technique

Al-Li-SiCp composites were fabricated by a simple and cost effective stir casting technique. A compound billet technique has been developed to overcome the problems encountered during hot extrusion of these composites. After successful fabrication hardness measurement and room temperature compressive test were carried out on 8090 Al and its composites reinforced with 8, 12 and 18vol.% SiC particles in as extruded and peak aged conditions. The addition of SiC increases the hardness. 0.2% proof stress and compressive strength of Al-Li-8%SiC and Al-Li-12%SiC composites are higher than the unreinforced alloy. in case of the Al-Li-18%SiC composite, the 0.2% proof stress and compressive strength were higher than the unreinforced alloy but lower than those of Al-Li-8%SiC and Al-Li-12%SiC composites. This is attributed to clustering of particles and poor interfacial bonding.

Bounds on isoperimetric values of trees

Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v) is an element of E : u is an element of S and v is an element of V - S} be the edge boundary of S. Given an integer i, 1 <= i <= vertical bar V vertical bar, let the edge isoperimetric value of G at i be defined as b(e)(i, G) = min(S subset of V:vertical bar S vertical bar=i)vertical bar delta(S, G)vertical bar. The edge isoperimetric peak of G is defined as b(e)(G) = max(1 <= j <=vertical bar V vertical bar)b(e)(j, G). Let b(v)(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi: 10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees. The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as T-d(2)), c(1)d <= b(e) (T-d(2)) <= d and c(2)d <= b(v)(T-d(2)) <= d where c(1), c(2) are constants. For a complete t-ary tree of depth d (denoted as T-d(t)) and d >= c log t where c is a constant, we show that c(1)root td <= b(e)(T-d(t)) <= td and c(2)d/root t <= b(v) (T-d(t)) <= d where c(1), c(2) are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T = (V, E, r) be a finite, connected and rooted tree - the root being the vertex r. Define a weight function w : V -> N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index eta(T) be defined as the number of distinct weights in the tree, i.e eta(T) vertical bar{w(u) : u is an element of V}vertical bar. For a positive integer k, let l(k) = vertical bar{i is an element of N : 1 <= i <= vertical bar V vertical bar, b(e)(i, G) <= k}vertical bar. We show that l(k) <= 2(2 eta+k k)

Asymptotic behaviour of point processes with Markov-dependent intervals

This splitting techniques for MARKOV chains developed by NUMMELIN (1978a) and ATHREYA and NEY (1978b) are used to derive an imbedded renewal process in WOLD's point process with MARKOV-correlated intervals. This leads to a simple proof of renewal theorems for such processes. In particular, a key renewal theorem is proved, from which analogues to both BLACKWELL's and BREIMAN's forms of the renewal theorem can be deduced.

Spray erosion studies on pressed soil blocks

Erosion resistance of pressed soil blocks used for wall construction is discussed. The spray erosion test using a standardized shower spray is discussed. Spray erosion behaviour of pressed soil blocks made out of five different soils is presented. Results of laboratory and field tests are compared. Effect of clay content of the soil and density of the pressed soil block on erosion are discussed. Also the effect of water-proof coatings on erosion of soil blocks is presented. Erosion resistance of soil blocks stabilized with organic (jaggery syrup and starch) or inorganic binders is also discussed.

Optimal Parameter Trajectory Estimation in Parameterized SDEs: An Algorithmic Procedure

We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.