Enviaments recents

  • A note on a family of non-gravitational central force potentials in dimension one 

    Alvarez-Ramírez, M.; Corbera Subirana, Montserrat; Cors Iglesias, Josep Maria; García, A. (Elsevier, 2017-12-01)
    Article
    Accés restringit per política de l'editorial
    In this work, we study a one-parameter family of differential equations and the different scenarios that arise with the change of parameter. We remark that these are not bifurcations in the usual sense but a wider phenomenon ...
  • Non-commutative integrable systems on bsymplectic manifolds 

    Miranda Galcerán, Eva; Kiesenhoferb, Anna (2016)
    Article
    Accés obert
    In this paper we study noncommutative integrable systems on b-Poisson manifolds. One important source of examples (and motivation) of such systems comes from considering noncommutative systems on manifolds with boundary ...
  • On the phase-lag with equation with spatial dependent lags 

    Liu, Zhuangyi; Quintanilla de Latorre, Ramón; Wang, Yang (2017-11-01)
    Article
    Accés restringit per política de l'editorial
    In this paper we investigate several qualitative properties of the solutions of the dual-phase-lag heat equation and the three-phase-lag heat equation. In the first case we assume that the parameter tTtT depends on the ...
  • Explicit inverse of a tridiagonal (p,r)-Toeplitz matrix 

    Encinas Bachiller, Andrés Marcos; Jiménez Jiménez, M. Jose (Elsevier, 2017-06-12)
    Article
    Accés restringit per política de l'editorial
    We have named tridiagonal (p,r)–Toeplitz matrix to those tridiagonal matrices in which each diagonal is a quasi–periodic sequence, d(p+j)=rd(j), so with period p¿N but multiplied by a real number r. We present here the ...
  • Equilibrium measures on finite networks. Effective resistance and hitting time 

    Carmona Mejías, Ángeles; Bendito Pérez, Enrique; Encinas Bachiller, Andrés Marcos (2001)
    Article
    Accés obert
    We aim here at showing how the equilibrium measures for a finite network can be used to obtain simple expressions for both Green and Poisson kernels and hence we can deduce nice expressions of the hitting time and the ...
  • Dirichlet-to-Robin matrix on networks 

    Arauz Lombardia, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Accés obert
    In this work, we de ne the Dirichlet{to{Robin matrix associated with a Schr odinger type matrix on general networks, and we prove that it satis es the alternating property which is essential to characterize those matrices ...
  • Recovering the conductances on grids 

    Arauz Lombardia, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Accés restringit per política de l'editorial
    In this work, we present an algorithm to the recovery of the conductance of a 2– dimensional grid. The algorithm is based in the solution of some overdetermined partial boundary value problems defined on the grid.
  • On the optimization of bipartite secret sharing schemes 

    Farràs Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor (2012-05-01)
    Article
    Accés obert
    Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ...
  • Ideal hierarchical secret sharing schemes 

    Farràs Ventura, Oriol; Padró Laimon, Carles (2012-01-24)
    Article
    Accés obert
    Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention since the invention of secret sharing until nowadays. Several constructions of ideal ...
  • Finding lower bounds on the complexity of secret sharing schemes by linear programming 

    Padró Laimon, Carles; Vázquez González, Leonor; Yang, An (2013-05-01)
    Article
    Accés obert
    Optimizing the maximum, or average, length of the shares in relation to the length of the secret for every given access structure is a difficult and long-standing open problem in cryptology. Most of the known lower bounds ...

Mostra'n més