Exploració per títol
Ara es mostren els items 32153-32172 de 245706
-
Bounding the distance of a controllable system to an uncontrollable one
(1998)
Article
Accés obertLet $(A,B)$ be a pair of matrices representing a time-invariant linear system $\dot x(t)=Ax(t)+Bu(t)$ under block-similarity equivalence. In this paper we measure the distance between a controllable pair of matrices ... -
Bounding the expected length of longest common subsequences and forests
(1998-09-01)
Report de recerca
Accés obertWe present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly ... -
Bounding the expected length of longest common subsequences and forests
(1996-05)
Report de recerca
Accés obertSubsumed by LSI-98-50-R -
Bounding the gap between a free group (outer) automorphism and its inverse
(2016-09-01)
Article
Accés obertFor any finitely generated group GG , two complexity functions aGaG and ßGßG are defined to measure the maximal possible gap between the norm of an automorphism (respectively, outer automorphism) of GG and the norm ... -
Bounding the output error in a buck power converter using perturbation theory
(Hindawi, 2008-07)
Article
Accés obertWe show the main results obtained when applying the average theory to Zero Average Dynamic control technique in a buck power converter with pulse-width modulation (PWM). In particular, we have obtained the bound values for ... -
Bounding the volume of facet-empty lattice tetrahedra
(2005)
Article
Accés obert -
Bounds and adaptivity for 3D limit analysis
(2009-06-08T10:28:14Z)
Text en actes de congrés
Accés obertIn the present paper we compute upper and lower bounds for limit analysis in two and three dimensions. From the solution of the discretised upper and lower bound problems, and from the optimum displacement rate and stress ... -
Bounds for quantities of interest and adaptivity in the element-free Galerkin method
(Wiley and Sons, 2008-07)
Article
Accés obertA novel approach to implicit residual-type error estimation in mesh-free methods and an adaptive refinement strategy are presented. This allows computing upper and lower bounds of the error in energy norm with the ultimate ... -
Bounds for the Nakamura number
(Springer, 2019-04)
Article
Accés obertThe Nakamura number is an appropriate invariant of a simple game to study the existence of social equilibria and the possibility of cycles. For symmetric (quota) games its number can be obtained by an easy formula. For ... -
Bounds for value at risk : the approach based on copulas with homogeneous tails
(Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2008)
Article
Accés obertThe theory of copulas provides a useful tool for modeling dependence in risk management. In insurance and nance, as well as in other applications, dependence of extreme events is particularly important, hence there is ... -
Bounds of functional outputs for parabolic problems. Part I: Exact bounds of the discontinuous Galerkin time discretization
(2008-03)
Article
Accés obertClassical implicit residual type error estimators require using an underlying spatial finer mesh to compute bounds for some quantity of interest. Consequently, the bounds obtained are only guaranteed asymptotically that ... -
Bounds of functional outputs for parabolic problems. Part II: Bounds of the exact solution
(2008-03)
Article
Accés obertThe paper introduces a methodology to compute upper and lower bounds for linear-functional outputs of the exact solutions of parabolic problems. In this second part, the bounds account for the error both in space and time. ... -
Bounds of the sum of edge lengths in linear arrangements of trees
(Institute of Physics (IOP), 2021-02-11)
Article
Accés obertA fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate ... -
Bounds of Zeros from beginning to Cauchy
(2023-07-16)
Article
Accés restringit per política de l'editorial -
Bounds on the bisection width for random d-regular graphs
(2004-04)
Report de recerca
Accés obertIn this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the ... -
Bounds on the capacity and power of quantum batteries
(American Physical Society, 2020-05-01)
Article
Accés obertQuantum batteries, composed of quantum cells, are expected to outperform their classical analogs. The origin of such advantages lies in the role of quantum correlations, which may arise during the charging and ... -
Bounds on the coefficients of tension and flow polynomials
(2011-05)
Article
Accés restringit per política de l'editorialThe goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we use the fact that these polynomials can be realized as Ehrhart polynomials of ... -
Bounds on the first non-null eigenvalue for self-adjoint boundary value problems on networks
(2006-09)
Article
Accés obertWe aim here at obtaining bounds on the first non-null eigenvalue for self-adjoint boundary value problems on a weighted network by means of equilibrium measures, that includes the study of Dirichlet, Neumann and Mixed ... -
Bounds on the k-restricted arc connectivity of some bipartite tournaments
(2018-08-15)
Article
Accés obertFor k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such that contains at least k non-trivial strong components. The k-restricted arc connectivity of a digraph D was defined by ... -
Bounds on the max and min bisection of random cubic and 4-regular graphs
(2002-12)
Report de recerca
Accés obertIn this paper we present simple randomized algorithms to bisect cubic and 4-regular graphs. These algorithms produce bisections of size asymptotically at most 0.17404n for typical random cubic n-vertex graphs, and ...