931 resultados para upper bound
Resumo:
An explicit formula is obtained for the coefficients of the cyclotomic polynomial Fn(x), where n is the product of two distinct odd primes. A recursion formula and a lower bound and an improvement of Bang’s upper bound for the coefficients of Fn(x) are also obtained, where n is the product of three distinct primes. The cyclotomic coefficients are also studied when n is the product of four distinct odd primes. A recursion formula and upper bounds for its coefficients are obtained. The last chapter includes a different approach to the cyclotomic coefficients. A connection is obtained between a certain partition function and the cyclotomic coefficients when n is the product of an arbitrary number of distinct odd primes. Finally, an upper bound for the coefficients is derived when n is the product of an arbitrary number of distinct and odd primes.
Resumo:
A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.
Resumo:
The natural mortality rate (M) of fish varies with size and age, although it is often assumed to be constant in stock assessments. Misspecification of M may bias important assessment quantities. We simulated fishery data, using an age-based population model, and then conducted stock assessments on the simulated data. Results were compared to known values. Misspecification of M had a negligible effect on the estimation of relative stock depletion; however, misspecification of M had a large effect on the estimation of parameters describing the stock recruitment relationship, age-specific selectivity, and catchability. If high M occurs in juvenile and old fish, but is misspecified in the assessment model, virgin biomass and catchability are often poorly estimated. In addition, stock recruitment relationships are often very difficult to estimate, and steepness values are commonly estimated at the upper bound (1.0) and overfishing limits tend to be biased low. Natural mortality can be estimated in assessment models if M is constant across ages or if selectivity is asymptotic. However if M is higher in old fish and selectivity is dome-shaped, M and the selectivity cannot both be adequately estimated because of strong interactions between M and selectivity.
Resumo:
This paper is aimed at designing a robust vaccination strategy capable of eradicating an infectious disease from a population regardless of the potential uncertainty in the parameters defining the disease. For this purpose, a control theoretic approach based on a sliding-mode control law is used. Initially, the controller is designed assuming certain knowledge of an upper-bound of the uncertainty signal. Afterwards, this condition is removed while an adaptive sliding control system is designed. The closed-loop properties are proved mathematically in the nonadaptive and adaptive cases. Furthermore, the usual sign function appearing in the sliding-mode control is substituted by the saturation function in order to prevent chattering. In addition, the properties achieved by the closed-loop system under this variation are also stated and proved analytically. The closed-loop system is able to attain the control objective regardless of the parametric uncertainties of the model and the lack of a priori knowledge on the system.
Resumo:
Nesta Dissertação propõe-se a aplicação de algoritmos genéticos para a síntese de filtros para modular sinais de controladores a estrutura variável e modo deslizante. A modulação do sinal de controle reduz a amplitude do sinal de saída e, consequentemente, pode reduzir o consumo de energia para realizar o controle e o chattering. Esses filtros também são aplicados em sistemas que possuem incertezas paramétricas nos quais nem todas as variáveis de estado são medidas. Nesses sistemas, as incertezas nos parâmetros podem impedir que seus estados sejam estimados com precisão por observadores. A síntese desses filtros necessita da obtenção da envoltória, que é o valor máximo da norma de cada resposta impulsiva admissível no sistema. Após este passo, é sintetizado um filtro que seja um majorante para a envoltória. Neste estudo, três métodos de busca da envoltória por algoritmos genéticos foram criados. Um dos métodos é o preferido, pois apresentou os melhores resultados e o menor tempo computacional.
Resumo:
Este trabalho apresenta uma estimativa a priori para o limite superior da distribuição de temperatura considerando um problema em regime permanente em um corpo com uma condutividade térmica dependente da temperatura. A discussão é realizada supondo que as condições de contorno são lineares (lei de Newton do resfriamento) e que a condutividade térmica é constante por partes (quando considerada como uma função da temperatura). Estas estimativas consistem em uma ferramenta poderosa que pode prescindir da necessidade de uma simulação numérica cara de um problema de transferência de calor não linear, sempre que for suficiente conhecer o valor mais alto de temperatura. Nestes casos, a metodologia proposta neste trabalho é mais eficaz do que as aproximações usuais que assumem tanto a condutividade térmica quanto as fontes de calor como constantes.
Resumo:
Let A and B be nonsingular M-matrices. A lower bound on the minimum eigenvalue q(B circle A(-1)) for the Hadamard product of A(-1) and B, and a lower bound on the minimum eigenvalue q(A star B) for the Fan product of A and B are given. In addition, an upper bound on the spectral radius rho(A circle B) of nonnegative matrices A and B is also obtained. These bounds improve several existing results in some cases and the estimating formulas are easier to calculate for they are only depending on the entries of matrices A and B. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper bound. However, approximating the optimal value function by an upper bound is computationally expensive and therefore tightness is often sacrificed to improve efficiency (e.g., sawtooth approximation). In this paper, we describe a new approach to efficiently compute tighter bounds by i) conducting a prioritized breadth first search over the reachable beliefs, ii) propagating upper bound improvements with an augmented POMDP and iii) using exact linear programming (instead of the sawtooth approximation) for upper bound interpolation. As a result, we can represent the bounds more compactly and significantly reduce the gap between upper and lower bounds on several benchmark problems. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
Resumo:
We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset. © 2012 IEEE.
Resumo:
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.
Resumo:
Foundations of subsea infrastructure in deep water subjected to asymmetric environmental loads have underscored the importance of combined torsional and horizontal loading effects on the bearing capacity of rectangular shallow foundations. The purpose of this study is to investigate the undrained sliding and torsional bearing capacity of rectangular and square shallow foundations together with the interaction response under combined loading using three-dimensional finite element (3D-FE) analysis. Upper bound plastic limit analysis is employed to establish a reference value for horizontal and torsional bearing capacity, and an interaction relationship for the combined loading condition. Satisfactory agreement of plastic limit analysis (PLA) and 3D-FE results for ultimate capacity and interaction curves ensures that simple PLA solution could be used to evaluate the bearing capacity problem of foundation under combined sliding and torsion.
Resumo:
It is well known that the power absorbed by a linear oscillator when excited by white noise base acceleration depends only on the mass of the oscillator and the spectral density of the base motion. This places an upper bound on the energy that can be harvested from a linear oscillator under broadband excitation, regardless of the stiffness of the system or the damping factor. It is shown here that the same result applies to any multi-degree-of-freedom nonlinear system that is subjected to white noise base acceleration: for a given spectral density of base motion the total power absorbed is proportional to the total mass of the system. The only restriction to this result is that the internal forces are assumed to be a function of the instantaneous value of the state vector. The result is derived analytically by several different approaches, and numerical results are presented for an example two-degree-of-freedom-system with various combinations of linear and nonlinear damping and stiffness. © 2013 The Author.
Optimal displacement mechanisms beneath shallow foundations on linear-elastic perfectly plastic soil
Resumo:
An energy method for a linear-elastic perfectly plastic method utilising the von Mises yield criterion with associated flow developed in 2013 by McMahon and co-workers is used to compare the ellipsoidal cavity-expansion mechanism, from the same work, and the displacement fields of other research by Levin, in 1995, and Osman and Bolton, in 2005, which utilise the Hill and Prandtl mechanisms respectively. The energy method was also used with a mechanism produced by performing a linear-elastic finite-element analysis in Abaqus. At small values of settlement and soil rigidity the elastic mechanism provides the lowest upper-bound solution, and matches well with finite-element analysis results published in the literature. At typical footing working loads and settlements the cavity-expansion mechanism produces a more optimal solution than the displacement fields within the Hill and Prandtl mechanisms, and also matches well with the published finite-element analysis results in this range. Beyond these loads, at greater footing settlements, or soil rigidity, the Prandtl mechanism is shown to be the most appropriate.
Resumo:
A method is proposed for on-line reconfiguration of the terminal constraint used to provide theoretical nominal stability guarantees in linear model predictive control (MPC). By parameterising the terminal constraint, its complete reconstruction is avoided when input constraints are modified to accommodate faults. To enlarge the region of feasibility of the terminal control law for a certain class of input faults with redundantly actuated plants, the linear terminal controller is defined in terms of virtual commands. A suitable terminal cost weighting for the reconfigurable MPC is obtained by means of an upper bound on the cost for all feasible realisations of the virtual commands from the terminal controller. Conditions are proposed that guarantee feasibility recovery for a defined subset of faults. The proposed method is demonstrated by means of a numerical example. © 2013 Elsevier B.V. All rights reserved.
Resumo:
The adaptation of robots to changing tasks has been explored in modular self-reconfigurable robot research, where the robot structure is altered by adapting the connectivity of its constituent modules. As these modules are generally complex and large, an upper bound is imposed on the resolution of the built structures. Inspired by growth of plants or animals, robotic body extension (RBE) based on hot melt adhesives allows a robot to additively fabricate and assemble tools, and integrate them into its own body. This enables the robot to achieve tasks which it could not achieve otherwise. The RBE tools are constructed from hot melt adhesives and therefore generally small and only passive. In this paper, we seek to show physical extension of a robotic system in the order of magnitude of the robot, with actuation of integrated body parts, while maintaining the ability of RBE to construct parts with high resolution. Therefore, we present an enhancement of RBE based on hot melt adhesives with modular units, combining the flexibility of RBE with the advantages of simple modular units. We explain the concept of this new approach and demonstrate with two simple unit types, one fully passive and the other containing a single motor, how the physical range of a robot arm can be extended and additional actuation can be added to the robot body. © 2012 IEEE.