Examen neurológico

Se realizó un capítulo sobre la descripción del examen neurológico como herramienta principal en el abordaje del paciente con patología neurológica.

Implementação de um CRM analítico na Fundação INATEL

As soluções informáticas de Customer Relationship Management (CRM) e os sistemas de suporte à informação, designados por Business Intelligence (BI), permitem a recolha de dados e a sua transformação em informação e em conhecimento, vital para diferenciação das organizações num Mundo globalizado e em constante mudança. A construção de um Data Warehouse corporativo é fundamental para as organizações que utilizam vários sistemas operacionais de modo a ser possível a agregação da informação. A Fundação INATEL – uma fundação privada de interesse público, 100% estatal – é um exemplo deste tipo de organização. Com uma base de dados de clientes superior a 250.000, atuando em áreas tão diferentes como sejam o Turismo, a Cultura e o Desporto, sustentado em mais de 25 sistemas informáticos autónomos. A base de estudo deste trabalho é a procura de identificação dos benefícios da implementação de um CRM Analítico na Fundação INATEL. Apresentando-se assim uma metodologia para a respetiva implementação e sugestão de um modelo de dados para a obtenção de uma visão única do cliente, acessível a toda a organização, de modo a garantir a total satisfação e consequente fidelização à marca INATEL. A disponibilização desta informação irá proporcionar um posicionamento privilegiado da Fundação INATEL e terá um papel fundamental na sua sustentabilidade económica.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.

Epidemic K-Means clustering

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. This work proposes a fully decentralised algorithm (Epidemic K-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art distributed K-Means algorithms based on sampling methods. The experimental analysis confirms that the proposed algorithm is a practical and accurate distributed K-Means implementation for networked systems of very large and extreme scale.

PDM 2006: Proceedings of the International Workshop on Data Mining

Recently major processor manufacturers have announced a dramatic shift in their paradigm to increase computing power over the coming years. Instead of focusing on faster clock speeds and more powerful single core CPUs, the trend clearly goes towards multi core systems. This will also result in a paradigm shift for the development of algorithms for computationally expensive tasks, such as data mining applications. Obviously, work on parallel algorithms is not new per se but concentrated efforts in the many application domains are still missing. Multi-core systems, but also clusters of workstations and even large-scale distributed computing infrastructures provide new opportunities and pose new challenges for the design of parallel and distributed algorithms. Since data mining and machine learning systems rely on high performance computing systems, research on the corresponding algorithms must be on the forefront of parallel algorithm research in order to keep pushing data mining and machine learning applications to be more powerful and, especially for the former, interactive. To bring together researchers and practitioners working in this exciting field, a workshop on parallel data mining was organized as part of PKDD/ECML 2006 (Berlin, Germany). The six contributions selected for the program describe various aspects of data mining and machine learning approaches featuring low to high degrees of parallelism: The first contribution focuses the classic problem of distributed association rule mining and focuses on communication efficiency to improve the state of the art. After this a parallelization technique for speeding up decision tree construction by means of thread-level parallelism for shared memory systems is presented. The next paper discusses the design of a parallel approach for dis- tributed memory systems of the frequent subgraphs mining problem. This approach is based on a hierarchical communication topology to solve issues related to multi-domain computational envi- ronments. The forth paper describes the combined use and the customization of software packages to facilitate a top down parallelism in the tuning of Support Vector Machines (SVM) and the next contribution presents an interesting idea concerning parallel training of Conditional Random Fields (CRFs) and motivates their use in labeling sequential data. The last contribution finally focuses on very efficient feature selection. It describes a parallel algorithm for feature selection from random subsets. Selecting the papers included in this volume would not have been possible without the help of an international Program Committee that has provided detailed reviews for each paper. We would like to also thank Matthew Otey who helped with publicity for the workshop.

Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.

On-line Gaussian mixture density estimator for adaptive minimum bit-error-rate beamforming receivers

We develop an on-line Gaussian mixture density estimator (OGMDE) in the complex-valued domain to facilitate adaptive minimum bit-error-rate (MBER) beamforming receiver for multiple antenna based space-division multiple access systems. Specifically, the novel OGMDE is proposed to adaptively model the probability density function of the beamformer’s output by tracking the incoming data sample by sample. With the aid of the proposed OGMDE, our adaptive beamformer is capable of updating the beamformer’s weights sample by sample to directly minimize the achievable bit error rate (BER). We show that this OGMDE based MBER beamformer outperforms the existing on-line MBER beamformer, known as the least BER beamformer, in terms of both the convergence speed and the achievable BER.

L3 acquisition: a focus on cognitive approaches

Interest in third language (L3) acquisition has increased exponentially in recent years, due to its potential to inform long-lasting debates in theoretical linguistics, language acquisition and psycholinguistics. Researchers investigating child and adult L3 acquisition have, from the very beginning, considered the many different cognitive factors that constrain and condition the initial state and development of newly acquired languages, and their models have duly evolved to incorporate insights from the most recent findings in psycholinguistics, neurolinguistics and cognitive psychology. The articles in this Special Issue of Bilingualism: Language and Cognition, in dealing with issues such as age of acquisition, attrition, relearning, cognitive economy or the reliance on different memory systems –to name a few–, provide an accurate portrayal of current inquiry in the field, and are a particularly fine example of how instrumental research in language acquisition and other cognitive domains can be to one another.

Multilayer optimization in radio resource allocation for the packet transmission in wireless networks

In the last decade mobile wireless communications have witnessed an explosive growth in the user’s penetration rate and their widespread deployment around the globe. It is expected that this tendency will continue to increase with the convergence of fixed Internet wired networks with mobile ones and with the evolution to the full IP architecture paradigm. Therefore mobile wireless communications will be of paramount importance on the development of the information society of the near future. In particular a research topic of particular relevance in telecommunications nowadays is related to the design and implementation of mobile communication systems of 4th generation. 4G networks will be characterized by the support of multiple radio access technologies in a core network fully compliant with the Internet Protocol (all IP paradigm). Such networks will sustain the stringent quality of service (QoS) requirements and the expected high data rates from the type of multimedia applications to be available in the near future. The approach followed in the design and implementation of the mobile wireless networks of current generation (2G and 3G) has been the stratification of the architecture into a communication protocol model composed by a set of layers, in which each one encompasses some set of functionalities. In such protocol layered model, communications is only allowed between adjacent layers and through specific interface service points. This modular concept eases the implementation of new functionalities as the behaviour of each layer in the protocol stack is not affected by the others. However, the fact that lower layers in the protocol stack model do not utilize information available from upper layers, and vice versa, downgrades the performance achieved. This is particularly relevant if multiple antenna systems, in a MIMO (Multiple Input Multiple Output) configuration, are implemented. MIMO schemes introduce another degree of freedom for radio resource allocation: the space domain. Contrary to the time and frequency domains, radio resources mapped into the spatial domain cannot be assumed as completely orthogonal, due to the amount of interference resulting from users transmitting in the same frequency sub-channel and/or time slots but in different spatial beams. Therefore, the availability of information regarding the state of radio resources, from lower to upper layers, is of fundamental importance in the prosecution of the levels of QoS expected from those multimedia applications. In order to match applications requirements and the constraints of the mobile radio channel, in the last few years researches have proposed a new paradigm for the layered architecture for communications: the cross-layer design framework. In a general way, the cross-layer design paradigm refers to a protocol design in which the dependence between protocol layers is actively exploited, by breaking out the stringent rules which restrict the communication only between adjacent layers in the original reference model, and allowing direct interaction among different layers of the stack. An efficient management of the set of available radio resources demand for the implementation of efficient and low complexity packet schedulers which prioritize user’s transmissions according to inputs provided from lower as well as upper layers in the protocol stack, fully compliant with the cross-layer design paradigm. Specifically, efficiently designed packet schedulers for 4G networks should result in the maximization of the capacity available, through the consideration of the limitations imposed by the mobile radio channel and comply with the set of QoS requirements from the application layer. IEEE 802.16e standard, also named as Mobile WiMAX, seems to comply with the specifications of 4G mobile networks. The scalable architecture, low cost implementation and high data throughput, enable efficient data multiplexing and low data latency, which are attributes essential to enable broadband data services. Also, the connection oriented approach of Its medium access layer is fully compliant with the quality of service demands from such applications. Therefore, Mobile WiMAX seems to be a promising 4G mobile wireless networks candidate. In this thesis it is proposed the investigation, design and implementation of packet scheduling algorithms for the efficient management of the set of available radio resources, in time, frequency and spatial domains of the Mobile WiMAX networks. The proposed algorithms combine input metrics from physical layer and QoS requirements from upper layers, according to the crosslayer design paradigm. Proposed schedulers are evaluated by means of system level simulations, conducted in a system level simulation platform implementing the physical and medium access control layers of the IEEE802.16e standard.

Effect of electroless nickel interlayer on the fatigue strength of chromium electroplated AISI 4340 steel

Deposition of wear-resistant hard chromium plating leads to a decrease in the fatigue strength of the base material. Despite the effective protection against wear and corrosion, fatigue life and environmental requirements result in pressure to identify alternatives or to improve conventional chromium electroplating mechanical characteristics. An interesting, environmentally safer and cleaner alternative for the replacement of hard chronic plating is tungsten carbide thermal spray coating, applied by high velocity oxyfuel (HVOF) process.To improve the fatigue strength of aeronautical steel chromium electroplated, shot peening is a successfully used method. Multiple lacer systems of coatings are considered to have larger resistance to crack propagation in comparison with simple layer.The aim of this study was to analyze the effect of nickel underplate on the fatigue strength of hard chromium plated AISI 4340 steel in two mechanical conditions: HRc 39 and HRc 52.Rotating bending fatigue tests results indicate that the clectroless nickel plating underlayer is responsible for the increase in fatigue strength of AISI 4340 steel chromium electroplated. This behavior may be attributed to the largest toughness/ductility and compressive residual stresses which, probably, arrested or delayed the inicrocrack propagation from the hard chromium external layer. The compressive residual stress field (CRSF) induced by the electroplating process was determined by X-ray diffraction method. The evolution of fatigue strength compressive residual stress field CRSF and crack sources are discussed and analyzed by SEM. (c) 2006 Elsevier Ltd. All rights reserved.

Investigação do funcionamento cognitivo de pacientes pediátricos diagnosticados com leucemia linfóide aguda - LLA

The present work investigated the cognitive operation of children diagnosed with acute lymphoblastic leukaemia (ALL), accompanied at pediatric oncologic institutions at the city of Natal/RN. Had participated in this study twenty children, of both sexes, between six and twelve years old, with the ALL diagnostic, who were in treatment (n=10) and out of treatment for at least one year (n=10) and were submitted exclusively to chemotherapy as CNS prophylaxis. The utilized protocol of neuropsychological evaluation covered the following cognitive abilities: intellective capability, attentional and memory systems, and executive functions. Data was analyzed through descriptive and inferential measures, with the support of the Mann-Whitney U Test and T-test, considering the influence of the variables sex, age at diagnostic and the past time since the beginning of the treatment over children s performance. The intellective capability evaluation showed low score to the out-of-treatment groups, female and children under five years old to the diagnostic. In concern of attentional systems, groups showed the expected performance. In a relevant way, in the evaluation of executive functions, were found reduced scores within all groups, especially inside the in-treatment group. Memory evaluation pointed to reduced performance in items concerning to learning evolution and spontaneous evocation after interference to the several groups. It can be concluded, reffer to the occurrence of transitory and permanent impact associated to the intrusion of chemotherapic components during the maturational course of the CNS. It s expected that the present investigation and the development of similar studies enable major comprehension about the mode, extension and repercussion of these damages subsidizing the development of strategies which may minimize them and provide better xxiii life quality to this clinical subgroup

Proposta de questionário para caracterização da prevalência de sintomas digestivos nas doenças difusas do tecido conjuntivo

RACIONAL: As doenças difusas do tecido conjuntivo afetam vários sistemas orgânicos, inclusive o digestório. Neste, as lesões variam em intensidade e freqüência na dependência da doença envolvida. A descrição das diferentes manifestações digestivas tem sido pouco freqüente, pouco detalhada e, não raro, baseada em experiências individuais e levantamentos retrospectivos. Tais formas de registro de dados produzem resultados muitas vezes conflitantes entre as diferentes casuísticas. OBJETIVO: Estabelecer de forma mais consistente, por intermédio de entrevista e questionário predefinido de sintomas, o conjunto e freqüência dos sintomas digestivos observados na esclerose sistêmica progressiva, artrite reumatóide, polimiosite/dermatomiosite, doença mista do tecido conjuntivo e lúpus eritematoso sistêmico. PACIENTES E MÉTODO: Estudaram-se 99 pacientes, 90% mulheres, com idade média de 45 anos. do total, 35 tinham artrite reumatóide, 26 esclerose sistêmica progressiva, 21 lúpus eritematoso sistêmico, 12 dermatomiosite/polimiosite e 5 doença mista do tecido conjuntivo. Todos foram submetidos, por investigador treinado, a entrevista e preenchimento de um questionário de sintomas digestivos, composto de 17 itens, previamente definidos. RESULTADOS: O estudo revelou elevada prevalência de sintomas gastrointestinais nas cinco doenças investigadas, muitas vezes afetando mais de 50% dos casos. Chamou a atenção a presença significativa de sintomas negligenciados pela literatura como a incontinência fecal. Discordante de trabalhos anteriores, os pacientes desta série com artrite reumatóide apresentaram variadas queixas digestivas, surpreendendo o achado de disfagia em 1/3 deles. CONCLUSÕES: As doenças difusas do tecido conjuntivo são causas de freqüentes e numerosos sintomas digestivos. O uso de questionários predefinidos mostrou-se instrumento válido na identificação de substancial número de sintomas, alguns deles ainda não referidos pela literatura. Por fim, foi constatada escassez de trabalhos passados e atuais relativos às manifestações gastrointestinais das doenças difusas do tecido conjuntivo, o que prejudicou análises comparativas mais amplas.

A novel ZZ/ZW sex chromosome system for the genus Leporinus (Pisces, Anostomidae, Characiformes)

A wide range of sex chromosome mechanisms, including simple and multiple chromosome systems is characteristic of fishes. The Leporinus genus represent a good model to study sex chromosome mechanisms, because an unambiguous ZZ/ZW sex chromosome system was previously described for seven species, while the remaining studied species of the genus do not show differentiated sex chromosomes. The occurrence of sex chromosomes in Leporinus trifasciatus and Leporinus sp2 from the Araguaia river, Amazon basin, Brazil, was here investigated. ZZ/ ZW sex chromosomes were detected for both species. The Z and W chromosome morphology of L. trifasciatus is the same as described for other species of the genus Leporinus. However, the Z and W chromosomes of L. sp2 were quite different in their morphology and banding pattern suggesting that the ZW system of this species have originated independently from the ZW system previously described for other Leporinus.

Aspartic acid racemization dating of Holocene brachiopods and bivalves from the southern Brazilian shelf, South Atlantic

The extent of racemization of aspartic acid (Asp) has been used to estimate the ages of 9 shells of the epifaunal calcitic brachiopod Bouchardia rosea and 9 shells of the infaunal aragonitic bivalve Semele casali. Both taxa were collected concurrently from the same sites at depths of 10 m and 30 m off the coast of Brazil. Asp D/L values show an excellent correlation with radiocarbon age at both sites and for both taxa (r(Site)(2) (9) (B. rosea) = 0.97 r(Site)(2) (1) (B.) (rosea) = 0.997, r(Site)(2) (9) (S.) (casali) = 0.9998, r(2) (Site) (1) (S.casali) = 0.93). The Asp ratios plotted against reservoir-corrected AMS radiocarbon ages over the time span of multiple millennia can thus be used to develop reliable and precise geochronologies not only for aragonitic mollusks (widely used for dating previously), but also for calcitic brachiopods. At each collection site, Bouchardia specimens display consistently higher D/L values than specimens of Semele. Thermal differences between sites are also notable and in agreement with theoretical expectations, as extents of racemization for both taxa are greater at the warmer, shallower site than at the cooler, deeper one. In late Holocene marine settings, concurrent time series of aragonitic and calcitic shells can be assembled using Asp racemization dating, and parallel multi-centennial to multi-millennial records can be developed simultaneously for multiple biomineral systems. (c) 2006 University of Washington. All rights reserved.

A Markov random field model for combining optimum-path forest classifiers using decision graphs and game strategy approach

The research on multiple classifiers systems includes the creation of an ensemble of classifiers and the proper combination of the decisions. In order to combine the decisions given by classifiers, methods related to fixed rules and decision templates are often used. Therefore, the influence and relationship between classifier decisions are often not considered in the combination schemes. In this paper we propose a framework to combine classifiers using a decision graph under a random field model and a game strategy approach to obtain the final decision. The results of combining Optimum-Path Forest (OPF) classifiers using the proposed model are reported, obtaining good performance in experiments using simulated and real data sets. The results encourage the combination of OPF ensembles and the framework to design multiple classifier systems. © 2011 Springer-Verlag.