Tensor products of Leavitt path algebras

Vegeu el resum a l'inici del document del fitxer adjunt.

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Integral inequalities for algebraic and trigonometric polynomials

Vegeu el resum a l'inici del document del fitxer adjunt.

Continuous-time formulation of reaction-diffusion processes on heterogeneous metapopulations

We present the derivation of the continuous-time equations governing the limit dynamics of discrete-time reaction-diffusion processes defined on heterogeneous metapopulations. We show that, when a rigorous time limit is performed, the lack of an epidemic threshold in the spread of infections is not limited to metapopulations with a scale-free architecture, as it has been predicted from dynamical equations in which reaction and diffusion occur sequentially in time

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.

X-chromosome tiling path array detection of copy number variants in patients with chromosome X-linked mental retardation

Background: Aproximately 5–10% of cases of mental retardation in males are due to copy number variations (CNV) on the X chromosome. Novel technologies, such as array comparative genomic hybridization (aCGH), may help to uncover cryptic rearrangements in X-linked mental retardation (XLMR) patients. We have constructed an X-chromosome tiling path array using bacterial artificial chromosomes (BACs) and validated it using samples with cytogenetically defined copy number changes. We have studied 54 patients with idiopathic mental retardation and 20 controls subjects. Results: Known genomic aberrations were reliably detected on the array and eight novel submicroscopic imbalances, likely causative for the mental retardation (MR) phenotype, were detected. Putatively pathogenic rearrangements included three deletions and five duplications (ranging between 82 kb to one Mb), all but two affecting genes previously known to be responsible for XLMR. Additionally, we describe different CNV regions with significant different frequencies in XLMR and control subjects (44% vs. 20%). Conclusion:This tiling path array of the human X chromosome has proven successful for the detection and characterization of known rearrangements and novel CNVs in XLMR patients.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

The algebraic equality of two asymptotic tests for the hypothesis that a normal distribution has a specified correlation matrix

It is proved the algebraic equality between Jennrich's (1970) asymptotic$X^2$ test for equality of correlation matrices, and a Wald test statisticderived from Neudecker and Wesselman's (1990) expression of theasymptoticvariance matrix of the sample correlation matrix.

Unified formalism for non-autonomous mechanical systems

We present a unified geometric framework for describing both the Lagrangian and Hamiltonian formalisms of regular and non-regular time-dependent mechanical systems, which is based on the approach of Skinner and Rusk (1983). The dynamical equations of motion and their compatibility and consistency are carefully studied, making clear that all the characteristics of the Lagrangian and the Hamiltonian formalisms are recovered in this formulation. As an example, it is studied a semidiscretization of the nonlinear wave equation proving the applicability of the proposed formalism.

Macaulay style formulas for sparse resultants

We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous polynomials.

The Brauer group and the second Abel-Jacobi map for 0-cycles on algebraic varieties

This paper focuses on the connection between the Brauer group and the 0-cycles of an algebraic variety. We give an alternative construction of the second l-adic Abel-Jacobi map for such cycles, linked to the algebraic geometry of Severi-Brauer varieties on X. This allows us then to relate this Abel-Jacobi map to the standard pairing between 0-cycles and Brauer groups (see [M], [L]), completing results from [M] in this direction. Second, for surfaces, it allows us to present this map according to the more geometrical approach devised by M. Green in the framework of (arithmetic) mixed Hodge structures (see [G]). Needless to say, this paper owes much to the work of U. Jannsen and, especially, to his recently published older letter [J4] to B. Gross.

A note on quadrics through an algebraic curve

In this note we describe the intersection of all quadric hypersur- faces containing a given linearly normal smooth projective curve of genus n and degree 2n + 1

The induced generalized OWA operator

[spa] Se presenta el operador OWA generalizado inducido (IGOWA). Es un nuevo operador de agregación que generaliza al operador OWA a través de utilizar las principales características de dos operadores muy conocidos como son el operador OWA generalizado y el operador OWA inducido. Entonces, este operador utiliza medias generalizadas y variables de ordenación inducidas en el proceso de reordenación. Con esta formulación, se obtiene una amplia gama de operadores de agregación que incluye a todos los casos particulares de los operadores IOWA y GOWA, y otros casos particulares. A continuación, se realiza una generalización mayor al operador IGOWA a través de utilizar medias cuasi-aritméticas. Finalmente, también se desarrolla un ejemplo numérico del nuevo modelo en un problema de toma de decisiones financieras.

The induced generalized OWA operator

[spa] Se presenta el operador OWA generalizado inducido (IGOWA). Es un nuevo operador de agregación que generaliza al operador OWA a través de utilizar las principales características de dos operadores muy conocidos como son el operador OWA generalizado y el operador OWA inducido. Entonces, este operador utiliza medias generalizadas y variables de ordenación inducidas en el proceso de reordenación. Con esta formulación, se obtiene una amplia gama de operadores de agregación que incluye a todos los casos particulares de los operadores IOWA y GOWA, y otros casos particulares. A continuación, se realiza una generalización mayor al operador IGOWA a través de utilizar medias cuasi-aritméticas. Finalmente, también se desarrolla un ejemplo numérico del nuevo modelo en un problema de toma de decisiones financieras.

Dielectric formulation for Many-Particle Systems with General Interactions

An extension of the self-consistent field approach formulation by Cohen in the preceding paper is proposed in order to include the most general kind of two-body interactions, i.e., interactions depending on position, momenta, spin, isotopic spin, etc. The dielectric function is replaced by a dielectric matrix. The evaluation of the energies involves the computation of a matrix inversion and trace.