Riemannian Submersions with Discrete Spectrum

We prove some estimates on the spectrum of the Laplacian of the total space of a Riemannian submersion in terms of the spectrum of the Laplacian of the base and the geometry of the fibers. When the fibers of the submersions are compact and minimal, we prove that the spectrum of the Laplacian of the total space is discrete if and only if the spectrum of the Laplacian of the base is discrete. When the fibers are not minimal, we prove a discreteness criterion for the total space in terms of the relative growth of the mean curvature of the fibers and the mean curvature of the geodesic spheres in the base. We discuss in particular the case of warped products.

Two structurally discrete GH7-cellobiohydrolases compete for the same cellulosic substrate fiber

Background: Cellulose consisting of arrays of linear beta-1,4 linked glucans, is the most abundant carbon-containing polymer present in biomass. Recalcitrance of crystalline cellulose towards enzymatic degradation is widely reported and is the result of intra-and inter-molecular hydrogen bonds within and among the linear glucans. Cellobiohydrolases are enzymes that attack crystalline cellulose. Here we report on two forms of glycosyl hydrolase family 7 cellobiohydrolases common to all Aspergillii that attack Avicel, cotton cellulose and other forms of crystalline cellulose. Results: Cellobiohydrolases Cbh1 and CelD have similar catalytic domains but only Cbh1 contains a carbohydrate-binding domain (CBD) that binds to cellulose. Structural superpositioning of Cbh1 and CelD on the Talaromyces emersonii Cel7A 3-dimensional structure, identifies the typical tunnel-like catalytic active site while Cbh1 shows an additional loop that partially obstructs the substrate-fitting channel. CelD does not have a CBD and shows a four amino acid residue deletion on the tunnel-obstructing loop providing a continuous opening in the absence of a CBD. Cbh1 and CelD are catalytically functional and while specific activity against Avicel is 7.7 and 0.5 U. mg prot-1, respectively specific activity on pNPC is virtually identical. Cbh1 is slightly more stable to thermal inactivation compared to CelD and is much less sensitive to glucose inhibition suggesting that an open tunnel configuration, or absence of a CBD, alters the way the catalytic domain interacts with the substrate. Cbh1 and CelD enzyme mixtures on crystalline cellulosic substrates show a strong combinatorial effort response for mixtures where Cbh1 is present in 2: 1 or 4: 1 molar excess. When CelD was overrepresented the combinatorial effort could only be partially overcome. CelD appears to bind and hydrolyze only loose cellulosic chains while Cbh1 is capable of opening new cellulosic substrate molecules away from the cellulosic fiber. Conclusion: Cellobiohydrolases both with and without a CBD occur in most fungal genomes where both enzymes are secreted, and likely participate in cellulose degradation. The fact that only Cbh1 binds to the substrate and in combination with CelD exhibits strong synergy only when Cbh1 is present in excess, suggests that Cbh1 unties enough chains from cellulose fibers, thus enabling processive access of CelD.

STABLE PIECEWISE POLYNOMIAL VECTOR FIELDS

Let N = {y > 0} and S = {y < 0} be the semi-planes of R-2 having as common boundary the line D = {y = 0}. Let X and Y be polynomial vector fields defined in N and S, respectively, leading to a discontinuous piecewise polynomial vector field Z = (X, Y). This work pursues the stability and the transition analysis of solutions of Z between N and S, started by Filippov (1988) and Kozlova (1984) and reformulated by Sotomayor-Teixeira (1995) in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields Z(epsilon), defined by averaging X and Y. This family approaches Z when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002) providing conditions on (X, Y) for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on R-2. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

How far is C-0(Gamma, X) with Gamma discrete from C-0(K, X) spaces?

For a locally compact Hausdorff space K and a Banach space X we denote by C-0(K, X) the space of X-valued continuous functions on K which vanish at infinity, provided with the supremum norm. Let n be a positive integer, Gamma an infinite set with the discrete topology, and X a Banach space having non-trivial cotype. We first prove that if the nth derived set of K is not empty, then the Banach-Mazur distance between C-0(Gamma, X) and C-0(K, X) is greater than or equal to 2n + 1. We also show that the Banach-Mazur distance between C-0(N, X) and C([1, omega(n)k], X) is exactly 2n + 1, for any positive integers n and k. These results extend and provide a vector-valued version of some 1970 Cambern theorems, concerning the cases where n = 1 and X is the scalar field.

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

The aim of solving the Optimal Power Flow problem is to determine the optimal state of an electric power transmission system, that is, the voltage magnitude and phase angles and the tap ratios of the transformers that optimize the performance of a given system, while satisfying its physical and operating constraints. The Optimal Power Flow problem is modeled as a large-scale mixed-discrete nonlinear programming problem. This paper proposes a method for handling the discrete variables of the Optimal Power Flow problem. A penalty function is presented. Due to the inclusion of the penalty function into the objective function, a sequence of nonlinear programming problems with only continuous variables is obtained and the solutions of these problems converge to a solution of the mixed problem. The obtained nonlinear programming problems are solved by a Primal-Dual Logarithmic-Barrier Method. Numerical tests using the IEEE 14, 30, 118 and 300-Bus test systems indicate that the method is efficient. (C) 2012 Elsevier B.V. All rights reserved.

MATHEMATICAL MODELS AND POLYHEDRAL STUDIES FOR INTEGRAL SHEET METAL DESIGN

We deal with the optimization of the production of branched sheet metal products. New forming techniques for sheet metal give rise to a wide variety of possible profiles and possible ways of production. In particular, we show how the problem of producing a given profile geometry can be modeled as a discrete optimization problem. We provide a theoretical analysis of the model in order to improve its solution time. In this context we give the complete convex hull description of some substructures of the underlying polyhedron. Moreover, we introduce a new class of facet-defining inequalities that represent connectivity constraints for the profile and show how these inequalities can be separated in polynomial time. Finally, we present numerical results for various test instances, both real-world and academic examples.

Self-similarities of periodic structures for a discrete model of a two-gene system

We report self-similar properties of periodic structures remarkably organized in the two-parameter space for a two-gene system, described by two-dimensional symmetric map. The map consists of difference equations derived from the chemical reactions for gene expression and regulation. We characterize the system by using Lyapunov exponents and isoperiodic diagrams identifying periodic windows, denominated Arnold tongues and shrimp-shaped structures. Period-adding sequences are observed for both periodic windows. We also identify Fibonacci-type series and Golden ratio for Arnold tongues, and period multiple-of-three windows for shrimps. (C) 2012 Elsevier B.V. All rights reserved.

Optimal mean-variance control for discrete-time linear systems with Markovian jumps and multiplicative noises

In this paper, we consider the stochastic optimal control problem of discrete-time linear systems subject to Markov jumps and multiplicative noises under two criteria. The first one is an unconstrained mean-variance trade-off performance criterion along the time, and the second one is a minimum variance criterion along the time with constraints on the expected output. We present explicit conditions for the existence of an optimal control strategy for the problems, generalizing previous results in the literature. We conclude the paper by presenting a numerical example of a multi-period portfolio selection problem with regime switching in which it is desired to minimize the sum of the variances of the portfolio along the time under the restriction of keeping the expected value of the portfolio greater than some minimum values specified by the investor. (C) 2011 Elsevier Ltd. All rights reserved.

On the optical properties of copper nanocubes as a function of the edge length as modeled by the discrete dipole approximation

This Letter reports an investigation on the optical properties of copper nanocubes as a function of size as modeled by the discrete dipole approximation. In the far-field, our results showed that the extinction resonances shifted from 595 to 670 nm as the size increased from 20 to 100 nm. Also, the highest optical efficiencies for absorption and scattering were obtained for nanocubes that were 60 and 100 nm in size, respectively. In the near-field, the electric-field amplitudes were investigated considering 514, 633 and 785 nm as the excitation wavelengths. The E-fields increased with size, being the highest at 633 nm. (c) 2012 Elsevier B.V. All rights reserved.

Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields

We prove that any two Poisson dependent elements in a free Poisson algebra and a free Poisson field of characteristic zero are algebraically dependent, thus answering positively a question from Makar-Limanov and Umirbaev (2007) [8]. We apply this result to give a new proof of the tameness of automorphisms for free Poisson algebras of rank two (see Makar-Limanov and Umirbaev (2011) [9], Makar-Limanov et al. (2009) [10]). (C) 2011 Elsevier Inc. All rights reserved.

Neural coding tools, based on Information Theory, applied to discrete time series: from electrophysiology to neuroethology

This work is supported by Brazilian agencies Fapesp, CAPES and CNPq

Modeling random corrosion processes via polynomial chaos expansion

Polynomial Chaos Expansion (PCE) is widely recognized as a flexible tool to represent different types of random variables/processes. However, applications to real, experimental data are still limited. In this article, PCE is used to represent the random time-evolution of metal corrosion growth in marine environments. The PCE coefficients are determined in order to represent data of 45 corrosion coupons tested by Jeffrey and Melchers (2001) at Taylors Beach, Australia. Accuracy of the representation and possibilities for model extrapolation are considered in the study. Results show that reasonably accurate smooth representations of the corrosion process can be obtained. The representation is not better because a smooth model is used to represent non-smooth corrosion data. Random corrosion leads to time-variant reliability problems, due to resistance degradation over time. Time variant reliability problems are not trivial to solve, especially under random process loading. Two example problems are solved herein, showing how the developed PCE representations can be employed in reliability analysis of structures subject to marine corrosion. Monte Carlo Simulation is used to solve the resulting time-variant reliability problems. However, an accurate and more computationally efficient solution is also presented.

Weighted Fourier–Laplace transforms in reproducing kernel Hilbert spaces on the sphere

We study the action of a weighted Fourier–Laplace transform on the functions in the reproducing kernel Hilbert space (RKHS) associated with a positive definite kernel on the sphere. After defining a notion of smoothness implied by the transform, we show that smoothness of the kernel implies the same smoothness for the generating elements (spherical harmonics) in the Mercer expansion of the kernel. We prove a reproducing property for the weighted Fourier–Laplace transform of the functions in the RKHS and embed the RKHS into spaces of smooth functions. Some relevant properties of the embedding are considered, including compactness and boundedness. The approach taken in the paper includes two important notions of differentiability characterized by weighted Fourier–Laplace transforms: fractional derivatives and Laplace–Beltrami derivatives.