On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

COMPLEX GEODESICS, THEIR BOUNDARY REGULARITY, AND A HARDY-LITTLEWOOD-TYPE LEMMA

We begin by giving an example of a smoothly bounded convex domain that has complex geodesics that do not extend continuously up to partial derivative D. This example suggests that continuity at the boundary of the complex geodesics of a convex domain Omega (sic) C-n, n >= 2, is affected by the extent to which partial derivative Omega curves or bends at each boundary point. We provide a sufficient condition to this effect (on C-1-smoothly bounded convex domains), which admits domains having boundary points at which the boundary is infinitely flat. Along the way, we establish a Hardy-Littlewood-type lemma that might be of independent interest.

Trehalose Toxicity in Cuscuta refexal Correlation With low Trehalase Activity

A toxic effect of a,a-trehalose in an angiospermic plant, Cuscuta reflexa (dodder), Is described. This disaccharide and Its analogs, 2-aminotrehalose and 4-aminotbhakose, induced a raid blackening of the terminal region of the vine which is Involved in elongation growth. From the results of in vitro growth of several angkiopermic plants and determination of trehalase activity in them, it is concluded that the toxic effect of trehalose in Cucaa is because of the very low trehalas activity In the vine. As a result, trehalose accumulates In the vine and interferes with some process closely associated with growth. The growth potential of Lemma (a duckweed) in a medium containing trehalose as the carbon source was ihreversibly lost upon addition of trealosamine, an Inhibitor of trehalase activity. It is concluded that, if allowed to accumulate within the tissue, trehalose may be potentiaMly toxic or inhibitory to higher plants in generaL The presence of trhalase actvity in plants, where Its substrate has not been found to occur, is envisged to relieve the plant from the toxic effects of trehalose which it may encounter in soil or during association with fungi or insects.

A simplified approach to a three-part Wiener-Hopf problem arising in diffraction theory

A direct and simple approach, utilizing Watson's lemma, is presented for obtaining an approximate solution of a three-part Wiener-Hopf problem associated with the problem of diffraction of a plane wave by a soft strip.

On the L2 stability of linear multidimensional time varying systems

This paper analyzes the L2 stability of solutions of systems with time-varying coefficients of the form [A + C(t)]x′ = [B + D(t)]x + u, where A, B, C, D are matrices. Following proof of a lemma, the main result is derived, according to which the system is L2 stable if the eigenvalues of the coefficient matrices are related in a simple way. A corollary of the theorem dealing with small periodic perturbations of constant coefficient systems is then proved. The paper concludes with two illustrative examples, both of which deal with the attitude dynamics of a rigid, axisymmetric, spinning satellite in an eccentric orbit, subject to gravity gradient torques.

Bounded-input/bounded-output stability of linear multidimensional time- varying systems

The present study of the stability of systems governed by a linear multidimensional time-varying equation, which are encountered in spacecraft dynamics, economics, demographics, and biological systems, gives attention the lemma dealing with L(inf) stability of an integral equation that results from the differential equation of the system under consideration. Using the proof of this lemma, the main result on L(inf) stability is derived according; a corollary of the theorem deals with constant coefficient systems perturbed by small periodic terms. (O.C.)

Capillary-gravity waves against a corrugated vertical cliff

An analysis involving a transformation of the velocity potential and a Fourier Sine Transform technique is described to study the effect of surface tension on incoming surface waves against a vertical cliff with a periodic wall perturbation. Known results are recovered as particular cases of the general problem considered. An analytical expression is derived for the surface elevation, at far distances from the shore-line, by using Watson's lemma and a representative table of numerical values of the coefficients of the resulting asymptotic expansion is also presented.

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).

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Information and Efficiency in the Nervous System-A Synthesis

In systems biology, questions concerning the molecular and cellular makeup of an organism are of utmost importance, especially when trying to understand how unreliable components-like genetic circuits, biochemical cascades, and ion channels, among others-enable reliable and adaptive behaviour. The repertoire and speed of biological computations are limited by thermodynamic or metabolic constraints: an example can be found in neurons, where fluctuations in biophysical states limit the information they can encode-with almost 20-60% of the total energy allocated for the brain used for signalling purposes, either via action potentials or by synaptic transmission. Here, we consider the imperatives for neurons to optimise computational and metabolic efficiency, wherein benefits and costs trade-off against each other in the context of self-organised and adaptive behaviour. In particular, we try to link information theoretic (variational) and thermodynamic (Helmholtz) free-energy formulations of neuronal processing and show how they are related in a fundamental way through a complexity minimisation lemma.

Chromium isotope variations (delta Cr-53/52) in mantle-derived sources and their weathering products: Implications for environmental studies and the evolution of delta Cr-53/52 in the Earth's mantle over geologic time

Here we report chromium isotope compositions, expressed as delta Cr-53/ 52 in per mil (&) relative to NIST 979, measured in selected Cr-rich minerals and rocks formed by the primary magmatic as well as the secondary metamorphic and weathering processes. The main objectives of this study were: (i) to further constrain the isotope composition of the Earth's mantle Cr inventory and its possible variation during geological history, based on the analysis of globally distributed and stratigraphically constrained mantle-derived chromites; and (ii) to investigate the magnitude and systematics of Cr isotope fractionation during oxidative weathering and secondary alteration (i. e., hydration, serpentinization) of the magmatic Cr sources. Specifically, we analyzed delta Cr-53/ 52 in a set of globally distributed mantle-derived chromites (FeMgCr2O4, n = 30) collected from various locations in Europe, Asia, Africa and South America, and our results confirm that a chromite-hosted Earth's mantle Cr inventory is uniform at - 0.079 +/- 0.129& (2SD), which we named here as a ` canonical' mantle d 53/ 52 Cr signature. Furthermore our dataset of stratigraphically constrained chromites, whose crystallization ages cover most of the Earth's geological history, indicate that the bulk Cr isotope composition of the chromite-hosted mantle inventory has remained uniform, within about +/- 0.100&, since at least the Early Archean times (similar to 3500 million years ago, Ma). To investigate the systematics of Cr isotope fractionation associated with alteration processes we analyzed a number of secondary Cr-rich minerals and variably altered ultramafic rocks (i. e., serpentinized harzburgites, lherzolites) that revealed large positive delta Cr-53/ 52 anomalies that are systematically shifted to higher values with an increasing degree of alteration and serpentinization. The degree of aqueous alteration and serpentinization was quantified by the abundances of fluid-mobile (Rb, K) elements, and by the Loss On Ignition (LOI) parameter, which determines the amount of structurally bound water (OH/ H2O) present in secondary hydrated minerals like serpentine. Overall, we observed that altered ultramafic rocks that yielded the highest LOI values, and the lowest amounts of fluid mobile elements, also yielded the heaviest delta Cr-53/ 52 signatures. Therefore, we conclude that secondary alteration (i.e., hydration, serpentinization) of ultramafic rocks in near-surface oxidative environments tend to shift the bulk Cr isotope composition of the weathered products to isotopically heavier values, pointing to a dynamic redox cycling of Cr in the Earth's crustal and near-surface environments. Hence, if validated by future

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

The Tetrablock as a Spectral Set

The tetrablock, roughly speaking, is the set of all linear fractional maps that map the open unit disc to itself. A formal definition of this inhomogeneous domain is given below. This paper considers triples of commuting bounded operators (A,B,P) that have the tetrablock as a spectral set. Such a triple is named a tetrablock contraction. The motivation comes from the success of model theory in another inhomogeneous domain, namely, the symmetrized bidisc F. A pair of commuting bounded operators (S,P) with Gamma as a spectral set is called a Gamma-contraction, and always has a dilation. The two domains are related intricately as the Lemma 3.2 below shows. Given a triple (A, B, P) as above, we associate with it a pair (F-1, F-2), called its fundamental operators. We show that (A,B,P) dilates if the fundamental operators F-1 and F-2 satisfy certain commutativity conditions. Moreover, the dilation space is no bigger than the minimal isometric dilation space of the contraction P. Whether these commutativity conditions are necessary, too, is not known. what we have shown is that if there is a tetrablock isometric dilation on the minimal isometric dilation space of P. then those commutativity conditions necessarily get imposed on the fundamental operators. En route, we decipher the structure of a tetrablock unitary (this is the candidate as the dilation triple) and a tertrablock isometry (the restriction of a tetrablock unitary to a joint invariant sub-space). We derive new results about r-contractions and apply them to tetrablock contractions. The methods applied are motivated by 11]. Although the calculations are lengthy and more complicated, they beautifully reveal that the dilation depends on the mutual relationship of the two fundamental operators, so that certain conditions need to be satisfied. The question of whether all tetrablock contractions dilate or not is unresolved.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.