Factores psicossociais preditivos de ajustamento à vida de pessoas com doenças crónicas

Doenças crónicas são de longa duração, de progressão lenta e induzem alterações na vida das pessoas, que são confrontadas com um conjunto de fatores que exercem um impacto negativo na sua qualidade de vida (QdV). A QdV é um conceito envolvendo componentes essenciais da qualidade humana: físicas, psicológicas, sociais, culturais e espirituais. Após o diagnóstico e com a doença estabilizada, os doentes procuram novas formas de lidar com esta. Este estudo teve como objetivo identificar fatores psicossociais preditivos (otimismo, afeto positivo e negativo, adesão aos tratamentos, suporte social e espiritualidade) da QdV (bem-estar geral, saúde física, saúde mental) e bem-estar subjetivo (BES) em pessoas com doenças crónicas. Amostra constituída por 774 indivíduos [30% diabetes, 27,1% cancro, 17,2% diabetes, 12% epilepsia, 11,5% esclerose múltipla e 2,2% miastenia, 70,5% do sexo feminino, idade M(DP)=42,9(11,6), educação M(DP)=9,6(4,7), anos diagnóstico M(DP)=12,8(9,7), classificação da doença M(DP)=6,6 (2,8)], recrutados nos hospitais centrais portugueses. Aplicando Modelos de Equações Estruturais e ajustando para variáveis sociodemográficas e clínicas, verificou-se que, pessoas mais otimistas, mais ativas e com uma melhor adesão aos tratamentos apresentam um melhor bem-estar geral, uma melhor saúde mental e um melhor bem-estar subjetivo; uma melhor adesão aos tratamentos contribui para uma melhor saúde física; melhor suporte social reflete-se numa melhor saúde mental; pessoas com mais espiritualidade apresentam uma melhor saúde física e uma melhor saúde mental. Estas conclusões contribuem para a definição de uma terapia que pode ajudar a uma melhor adaptação dos protocolos de tratamento para atender às necessidades dos doentes.

Práticas de literacia e avaliação da competência da escrita

O desfasamento entre a escola e os diferentes contextos sociais em que se insere, a dificuldade em dar resposta às solicitações e desafios que as suas comunidades lhe colocam, a deficiente preparação de muitos dos alunos para um uso competente e crítico da linguagem oral e escrita, constituem três críticas sérias ao papel atual da escola. O projeto que estamos a dinamizar com uma turma do ensino secundário procura contrariar este rumo da educação, demonstrando que é possível construir e valorizar as competências de literacia que não se circunscrevem à própria vida escolar, através de atividades de aprendizagem efetiva da escrita, numa relação interdisciplinar com outras áreas de conhecimento. Ele surge nos antípodas do ensino tradicional, onde a produção escrita é imposta aos alunos, tendo quase sempre o professor como único destinatário, valorizando-se aspetos de natureza formal e superficial em detrimento de outros que são fundamentais em termos de eficácia discursiva, fazendo dela depender, quase exclusivamente, a avaliação do aluno, muitas vezes assente numa mera reprodução de conhecimento.Assim, e com recurso à metodologia do trabalho de projeto, concebemos um roteiro paisagístico, ainda em fase de realização, acerca de uma quinta de D. Antónia (Ferreirinha), destinado aos seus turistas, que tem obrigado a uma participação no quadro mais alargado da escola enquanto comunidade e nas comunidades em que os seus membros se inserem, fazendo com que os alunos interajam com os contextos culturais, históricos, económicos, sociais e institucionais onde atuam, estudam e vivem: o Douro. Nesta comunicação, procuramos divulgar estas práticas e discutir a sua viabilidade, evidenciando o modo como os alunos constroem o seu saber sobre a língua e de que modo a avaliação é um processo indispensável quer nas diferentes etapas de elaboração de um projeto, quer no domínio da competência de escrita.

Dependent component analysis: a hyperspectral unmixing algorithm

Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest. This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical properties of hyperspectral data. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. The performance of the method is illustrated using simulated and real data.

Vertex component analysis: a fast algorithm to extract endmembers spectra from hyperspectral data

Chapter in Book Proceedings with Peer Review First Iberian Conference, IbPRIA 2003, Puerto de Andratx, Mallorca, Spain, JUne 4-6, 2003. Proceedings

Vertex component analysis: a fast algorithm to unmix hyperspectral data

Given a set of mixed spectral (multispectral or hyperspectral) vectors, linear spectral mixture analysis, or linear unmixing, aims at estimating the number of reference substances, also called endmembers, their spectral signatures, and their abundance fractions. This paper presents a new method for unsupervised endmember extraction from hyperspectral data, termed vertex component analysis (VCA). The algorithm exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. In a series of experiments using simulated and real data, the VCA algorithm competes with state-of-the-art methods, with a computational complexity between one and two orders of magnitude lower than the best available method.

Comparison of the pencil beam convolution algorithm and the analytical anisotropic algorithm in breast tumors

The calculation of the dose is one of the key steps in radiotherapy planning1-5. This calculation should be as accurate as possible, and over the years it became feasible through the implementation of new algorithms to calculate the dose on the treatment planning systems applied in radiotherapy. When a breast tumour is irradiated, it is fundamental a precise dose distribution to ensure the planning target volume (PTV) coverage and prevent skin complications. Some investigations, using breast cases, showed that the pencil beam convolution algorithm (PBC) overestimates the dose in the PTV and in the proximal region of the ipsilateral lung. However, underestimates the dose in the distal region of the ipsilateral lung, when compared with analytical anisotropic algorithm (AAA). With this study we aim to compare the performance in breast tumors of the PBC and AAA algorithms.

A SON Enhanced Algorithm for Observed Time Differences Based Geolocation in Real 3G Networks

Conferência - 16th International Symposium on Wireless Personal Multimedia Communications (WPMC)- Jun 24-27, 2013

Detecção de sectores cruzados e optimização de cobertura em redes LTE

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações

Implementação em hardware reconfigurável de método de separação de dados hiperespetrais

Relatório do Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações

Analysing TDMA with slot skipping

We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented.

Timing analysis of a multiple logical ring wired/wireless PROFIBUS network

Recently, there have been a few research efforts towards extending the capabilities of fieldbus networks to encompass wireless support. In previous works we have proposed a hybrid wired/wireless PROFIBUS network solution where the interconnection between the heterogeneous communication media was accomplished through bridge-like interconnecting devices. The resulting networking architecture embraced a multiple logical ring (MLR) approach, thus with multiple independent tokens, to which a specific bridging protocol extension, the inter-domain protocol (IDP), was proposed. The IDP offers compatibility with standard PROFIBUS, and includes mechanisms to support inter-cell mobility of wireless nodes. We advance that work by proposing a worst-case response timing analysis of the IDP.

Comparação entre o pencil beam convolution algorithm e o analytical anisotropic algorithm em tumores de mama

Objectivo do estudo: comparar o desempenho dos algoritmos Pencil Beam Convolution (PBC) e do Analytical Anisotropic Algorithm (AAA) no planeamento do tratamento de tumores de mama com radioterapia conformacional a 3D.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

An Explicit GTS allocation algorithm for IEEE 802.15.4

The IEEE 802.15.4 standard provides appealing features to simultaneously support real-time and non realtime traffic, but it is only capable of supporting real-time communications from at most seven devices. Additionally, it cannot guarantee delay bounds lower than the superframe duration. Motivated by this problem, in this paper we propose an Explicit Guaranteed time slot Sharing and Allocation scheme (EGSA) for beacon-enabled IEEE 802.15.4 networks. This scheme is capable of providing tighter delay bounds for real-time communications by splitting the Contention Free access Period (CFP) into smaller mini time slots and by means of a new guaranteed bandwidth allocation scheme for a set of devices with periodic messages. At the same the novel bandwidth allocation scheme can maximize the duration of the CFP for non real-time communications. Performance analysis results show that the EGSA scheme works efficiently and outperforms competitor schemes both in terms of guaranteed delay and bandwidth utilization.

A multi-objective approach for the motion planning of redundant manipulators

Kinematic redundancy occurs when a manipulator possesses more degrees of freedom than those required to execute a given task. Several kinematic techniques for redundant manipulators control the gripper through the pseudo-inverse of the Jacobian, but lead to a kind of chaotic inner motion with unpredictable arm configurations. Such algorithms are not easy to adapt to optimization schemes and, moreover, often there are multiple optimization objectives that can conflict between them. Unlike single optimization, where one attempts to find the best solution, in multi-objective optimization there is no single solution that is optimum with respect to all indices. Therefore, trajectory planning of redundant robots remains an important area of research and more efficient optimization algorithms are needed. This paper presents a new technique to solve the inverse kinematics of redundant manipulators, using a multi-objective genetic algorithm. This scheme combines the closed-loop pseudo-inverse method with a multi-objective genetic algorithm to control the joint positions. Simulations for manipulators with three or four rotational joints, considering the optimization of two objectives in a workspace without and with obstacles are developed. The results reveal that it is possible to choose several solutions from the Pareto optimal front according to the importance of each individual objective.