Comparison of body fat content and distribution of familial amyloidotic polyneuropathy patients versus healthy subjects

The deposition of amyloid fibers at the peripheral nervous system can induce motor neuropathy in Familial Amiloidotic Polyneuropethy (FAP) patients. This produces progressive reductions in functional capacity. The only treatment for FAP is a liver transplant, followed by aggressive medication that can affect patients' metabolism. To our knowledge, there are no data on body fat distribution or comparison between healthy and FAP subjects, which may be important for clinical assessment and management of this disease. PURPOSE: To analyze body fat content and distribution between FAP patients and healthy subjects. METHODS: Body fat content and distribution were measured through Double Energy X-ray Densitometry (DXA) in two groups. Group 1 consisted of 43 Familial Amyloidotic Polyneuropathy patients (19 males, 32 + 8 Yrs, and 24 females, 37 + 5 yrs), who had liver transplant less than 2 months before. Group 2 consisted of 18 healthy subjects of similar age (8 males, 36 + 7 yrs, and 10 females, 39 + 5 yrs). RESULTS: Healthy subjects showed higher values than FAP patients for: BMI (24,2+2,3kg/m2 vs 22,3+3,8 kg/m2 respectively, p<0,05), % trunk BF (26,21+8,34kg vs 20,78+9,05kg respectively, p<0,05), % visceral BF (24,43+7,97% vs 19,21+9,30% respectively, p<0,05), % abdominal BF (26,63+8,51% vs 20,63+10,35% respectively, p<0,05) abdominal subcutaneous BF (0,533+0,421kg vs 0,353+0,257kg respectively, p=0,05), abdominal BF/BF ratio (0,09+0,02 vs 0,08+0,02 respectively, p<0,05) and abdominal BF/trunk BF ratio (0,19+0,03 vs 0,17+0,03 respectively, p<0,05). CONCLUSIONS: These results showed that FAP patients soon after liver transplantation exhibited a healthier body fat profile compared to controls. However, fat content and distribution varied widely in FAP subjects, suggesting an individualized approach for assessment and intervention rather than general guidelines. Future research is needed to investigate the long term consequences on body fat following liver transplant in this population.

Mercurio y salud en la odontología

El mercurio es un metal pesado ampliamente utilizado por el hombre. Se considera muy tóxico por generar afecciones sobre el sistema nervioso central, perturbaciones en el comportamiento y trastornos renales, inmunes y sexuales, entre otros. Desde hace más de un siglo, el mercurio es utilizado en la práctica odontológica por su capacidad de unir metales (amalgamar), su bajo costo y su rápida fijación en la reparación de piezas dentales. Actualmente, existe una gran controversia acerca de la seguridad del uso de las amalgamas dentales y se ha demostrado el riesgo ocupacional al que están expuestos dentistas y asistentes dentales. El objetivo del trabajo es revisar aspectos relacionados con la toxicidad del mercurio metálico tanto para el personal involucrado en la práctica odontológica como para los pacientes con amalgamas. De igual modo, se presentan las rutas de exposición a este metal en la odontología, los riesgos ocupacionales a los cuales están expuestos los odontólogos y asistentes dentales y las medidas para prevenir la intoxicación por mercurio. Se realizó la búsqueda bibliográfica sobretudo en las bases de datos Biological Abstracts y Science Citation Index para el período comprendido entre los años 1990 y 2000.

Agent-based simulation of electronic marketplaces with decision support

This paper presents a Multi-Agent Market simulator designed for analyzing agent market strategies based on a complete understanding of buyer and seller behaviors, preference models and pricing algorithms, considering user risk preferences and game theory for scenario analysis. The system includes agents that are capable of improving their performance with their own experience, by adapting to the market conditions, and capable of considering other agents reactions.

A multi-agent system for the support of producer coalition formation in electricity markets

All over the world Distributed Generation is seen as a valuable help to get cleaner and more efficient electricity. To get negotiation power and advantages of scale economy, distributed producers can be aggregated giving place to a new concept: the Virtual Power Producer. Virtual Power Producers are multitechnology and multi-site heterogeneous entities. Virtual Power Producers should adopt organization and management methodologies so that they can make Distributed Generation a really profitable activity, able to participate in the market. In this paper we address the development of a multi-agent market simulator – MASCEM – able to study alternative coalitions of distributed producers in order to identify promising Virtual Power Producers in an electricity market.

Self-managing agents for dynamic scheduling in manufacturing

The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using cooperative negotiation. Scheduling resolution requires the intervention of highly skilled human problem-solvers. This is a very hard and challenging domain because current systems are becoming more and more complex, distributed, interconnected and subject to rapidly changing. A natural Autonomic Computing (AC) evolution in relation to Current Computing is to provide systems with Self-Managing ability with a minimum human interference.

Ethical dilemmas in scientific publication: pitfalls and solutions for editors

Editors of scientific journals need to be conversant with the mechanisms by which scientific misconduct is amplified by publication practices. This paper provides definitions, ways to document the extent of the problem, and examples of editorial attempts to counter fraud. Fabrication, falsification, duplication, ghost authorship, gift authorship, lack of ethics approval, non-disclosure, 'salami' publication, conflicts of interest, auto-citation, duplicate submission, duplicate publications, and plagiarism are common problems. Editorial misconduct includes failure to observe due process, undue delay in reaching decisions and communicating these to authors, inappropriate review procedures, and confounding a journal's content with its advertising or promotional potential. Editors also can be admonished by their peers for failure to investigate suspected misconduct, failure to retract when indicated, and failure to abide voluntarily by the six main sources of relevant international guidelines on research, its reporting and editorial practice. Editors are in a good position to promulgate reasonable standards of practice, and can start by using consensus guidelines on publication ethics to state explicitly how their journals function. Reviewers, editors, authors and readers all then have a better chance to understand, and abide by, the rules of publishing.

Investigando o passado para planear o futuro: uma análise bibliométrica das publicações dos Açores em revistas do SCI entre 1974-2012

Jornadas "Ciência nos Açores – que futuro? Tema Ciências Naturais e Ambiente", Ponta Delgada, 7-8 de Junho de 2013.

Programming atomic multicasts in CAN

In Distributed Computer-Controlled Systems (DCCS), a special emphasis must be given to the communication infrastructure, which must provide timely and reliable communication services. CAN networks are usually suitable to support small-scale DCCS. However, they are known to present some reliability problems, which can lead to an unreliable behaviour of the supported applications. In this paper, an atomic multicast protocol for CAN networks is proposed. This protocol explores the CAN synchronous properties, providing a timely and reliable service to the supported applications. The implementation of such protocol in Ada, on top of the Ada version of Real-Time Linux is presented, which is used to demonstrate the advantages and disadvantages of the platform to support reliable communications in DCCS.

Replica management in real-time Ada 95 applications

In this paper, we present some of the fault tolerance management mechanisms being implemented in the Multi-μ architecture, namely its support for replica non-determinism. In this architecture, fault tolerance is achieved by node active replication, with software based replica management and fault tolerance transparent algorithms. A software layer implemented between the application and the real-time kernel, the Fault Tolerance Manager (FTManager), is the responsible for the transparent incorporation of the fault tolerance mechanisms The active replication model can be implemented either imposing replica determinism or keeping replica consistency at critical points, by means of interactive agreement mechanisms. One of the Multi-μ architecture goals is to identify such critical points, relieving the underlying system from performing the interactive agreement in every Ada dispatching point.

Multi-μ: an Ada 95 based architecture for fault tolerance support of real-time systems

This paper presents an architecture (Multi-μ) being implemented to study and develop software based fault tolerant mechanisms for Real-Time Systems, using the Ada language (Ada 95) and Commercial Off-The-Shelf (COTS) components. Several issues regarding fault tolerance are presented and mechanisms to achieve fault tolerance by software active replication in Ada 95 are discussed. The Multi-μ architecture, based on a specifically proposed Fault Tolerance Manager (FTManager), is then described. Finally, some considerations are made about the work being done and essential future developments.

Radio link quality estimation in wireless sensor networks: a survey

Radio link quality estimation in Wireless Sensor Networks (WSNs) has a fundamental impact on the network performance and also affects the design of higher-layer protocols. Therefore, for about a decade, it has been attracting a vast array of research works. Reported works on link quality estimation are typically based on different assumptions, consider different scenarios, and provide radically different (and sometimes contradictory) results. This article provides a comprehensive survey on related literature, covering the characteristics of low-power links, the fundamental concepts of link quality estimation in WSNs, a taxonomy of existing link quality estimators, and their performance analysis. To the best of our knowledge, this is the first survey tackling in detail link quality estimation in WSNs. We believe our efforts will serve as a reference to orient researchers and system designers in this area.

The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Composition is a practice of key importance in software engineering. When real-time applications are composed it is necessary that their timing properties (such as meeting the deadlines) are guaranteed. The composition is performed by establishing an interface between the application and the physical platform. Such an interface does typically contain information about the amount of computing capacity needed by the application. In multiprocessor platforms, the interface should also present information about the degree of parallelism. Recently there have been quite a few interface proposals. However, they are either too complex to be handled or too pessimistic.In this paper we propose the Generalized Multiprocessor Periodic Resource model (GMPR) that is strictly superior to the MPR model without requiring a too detailed description. We describe a method to generate the interface from the application specification. All these methods have been implemented in Matlab routines that are publicly available.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Towards network-on-chip agreement protocols

Demands for functionality enhancements, cost reductions and power savings clearly suggest the introduction of multiand many-core platforms in real-time embedded systems. However, when compared to uni-core platforms, the manycores experience additional problems, namely the lack of scalable coherence mechanisms and the necessity to perform migrations. These problems have to be addressed before such systems can be considered for integration into the realtime embedded domain. We have devised several agreement protocols which solve some of the aforementioned issues. The protocols allow the applications to plan and organise their future executions both temporally and spatially (i.e. when and where the next job will be executed). Decisions can be driven by several factors, e.g. load balancing, energy savings and thermal issues. All presented protocols are analytically described, with the particular emphasis on their respective real-time behaviours and worst-case performance. The underlying assumptions are based on the multi-kernel model and the message-passing paradigm, which constitutes the communication between the interacting instances.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.