3 resultados para Boyd-Lawton theorem

em Universidade do Minho


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Este estudo procurou investigar as relações existentes entre morbilidade psicológica, stress familiar e qualidade de vida (QV) da pessoa idosa. A amostra foi constituída por 126 idosos. Os instrumentos utilizados foram: The Lawton Instrumental Activities of Daily Living (IADL), Quality of Life (WHOQOL-Bref), Geriatric Anxiety Inventory (GSI), Geriatric Depression Scale (GDS); e Index of Family Relations (IFR). Os resultados revelaram a importância da idade, estado civil, escolaridade e número de patologias assim como o género na capacidade funcional, morbilidade, stress familiar e QV. Ao nível dos preditores, a depressão foi a variável que mais contribuiu para a QV. Não foram encontradas variáveis moderadoras no modelo. A discussão e implicações dos resultados são abordadas bem como a intervenção psicológica nesta população.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

How much can be said about the location of the eigenvalues of a symmetric tridiagonal matrix just by looking at its diagonal entries? We use classical results on the eigenvalues of symmetric matrices to show that the diagonal entries are bounds for some of the eigenvalues regardless of the size of the off-diagonal entries. Numerical examples are given to illustrate that our arithmetic-free technique delivers useful information on the location of the eigenvalues.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.