Control and comparison of the antioxidant capacity of beers

The purpose of the present work is to determine the antioxidant capacity (AC) of 27 commercial beers. The AC indicates the degree of protection of a certain organism against oxidative damage provoked by reactive oxygen and nitrogen species. Assays were carried out by the following methods: (i) total radical trapping antioxidant parameter (TRAP); (ii) trolox equivalent antioxidant capacity (TEAC); (iii) trolox equivalent antioxidant capacity (DPPH); (iv) ferric-ion reducing antioxidant parameter (FRAP); (v) cupric reducing antioxidant capacity (CUPRAC); (vi) oxygen radical absorbance capacity (ORAC). Ascorbic acid (AA), gallic acid (GA) and trolox (TR) were used as standards. All beers showed antioxidant power, but a wide range of ACs was observed. The effect of several factors upon these differences was studied. Statistical differences were found between ACs of beers of different colours. ORAC method provided always higher experimental ACs, of significant statistical differences to other assays.

Comparison of allocation approaches in soybean biodiesel life cycle assessment

This work shows the influence of using different allocation approaches when modelling the inventory analysis in a soybean biodiesel life cycle assessment (LCA). Results obtained using mass, energy and economic based allocations are compared, focusing on the following aspects: normalised potential environmental impact (PEI) categories, total PEI and relative contributions to the total PEI from each life cycle stage and environmental impact category. Similar results are obtained either using economic and energy based allocations. However, different results are obtained when mass based allocation is used when compared with the other two. This study also illustrates that using different allocation approaches in biodiesel LCA may influence the final conclusions, especially in comparative assertions, emphasising the need to perform a sensitivity analysis in the LCA interpretation step.

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.

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

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 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

A distributed algorithm for hexagonal topology formation in wireless sensor networks

Hexagonal wireless sensor network refers to a network topology where a subset of nodes have six peer neighbors. These nodes form a backbone for multi-hop communications. In a previous work, we proposed the use of hexagonal topology in wireless sensor networks and discussed its properties in relation to real-time (bounded latency) multi-hop communications in large-scale deployments. In that work, we did not consider the problem of hexagonal topology formation in practice - which is the subject of this research. In this paper, we present a decentralized algorithm that forms the hexagonal topology backbone in an arbitrary but sufficiently dense network deployment. We implemented a prototype of our algorithm in NesC for TinyOS based platforms. We present data from field tests of our implementation, collected using a deployment of fifty wireless sensor nodes.

Scheduling arbitrary-deadline sporadic task systems on multiprocessors

A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.

Image quality and dose analysis in PA chest x-ray: comparison between AEC and manual mode acquisition using the 10 kVp rule

Purpose: To compare image quality and effective dose when the 10 kVp rule is applied with manual and AEC mode in PA chest X-ray. Methods and Materials: A total of 68 images (with and without lesions) were acquired of an anthropomorphic chest phantom in a Wolverson Arcoma X-ray unit. The images were evaluated against a reference image using image quality criteria and the 2 alternative forced choice (2 AFC) method by five radiographers. The effective dose was calculated using PCXMC software using the exposure parameters and DAP. The exposure index (lgM) was recorded. Results: Exposure time decreases considerably when applying the 10 kVp rule in manual mode (50%-28%) compared to AEC mode (36%-23%). Statistical differences for effective dose between several AEC modes were found (p=0.002). The effective dose is lower when using only the right AEC ionization chamber. Considering image quality, there are no statistical differences (p=0.348) between the different AEC modes for images with no lesions. Using a higher kVp value the lgM values will also increase. The lgM values showed significant statistical differences (p=0.000). The image quality scores did not present statistically significant differences (p=0.043) for the images with lesions when comparing manual with AEC modes. Conclusion: In general, the dose is lower in the manual mode. By using the right AEC ionising chamber the effective dose will be the lowest in comparison to other ionising chambers. The use of the 10 kVp rule did not affect the detectability of the lesions.

Unstabilized rammed Earth: characterization of material collected from old constructions in South Portugal and comparison to normative requirements

Unstabilized rammed earth is a recyclable, economical, and eco-friendly building material, used in the past and still applied today. Traditionally, its use was based on a long empirical knowledge of the local materials. Because this knowledge was mostly lost or is no longer sufficient, in many countries normative documents have been produced to allow the assessment of rammed earth soils. With the aim of contributing for a refining of these normative requirements, this article presents a research work that included: (i) collection of Unstabilized rammed earth samples from six constructions in Portugal; (ii) a literature survey of normative and complementary documents to identify the most mentioned key-properties, the test procedures and the corresponding threshold limits; and (iii) a discussion of the test procedures and of the thresholds limits in the light of the experimental results. The analyzed properties are the particle size distribution, maximum particle size, plasticity, compaction, linear shrinkage, organic content, and salt content. The work highlights the advantages of taking into account the characteristics of existing constructions as a basis for the establishment and further refining of consistent threshold values. In particular, it shows that it is essential to adjust the requirements to the specificities of local materials.

Coding mode decision algorithm for binary descriptor coding

In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.

Self-reported diabetes in older people: comparison of prevalences and control measures

OBJECTIVE The objective of this study was to analyze the prevalence of diabetes in older people and the adopted control measures.METHODS Data regarding older diabetic individuals who participated in the Health Surveys conducted in the Municipality of Sao Paulo, SP, ISA-Capital, in 2003 and 2008, which were cross-sectional studies, were analyzed. Prevalences and confidence intervals were compared between 2003 and 2008, according to sociodemographic variables. The combination of the databases was performed when the confidence intervals overlapped. The Chi-square (level of significance of 5%) and the Pearson’s Chi-square (Rao-Scott) tests were performed. The variables without overlap between the confidence intervals were not tested.RESULTS The age of the older adults was 60-69 years. The majority were women, Caucasian, with an income of between > 0.5 and 2.5 times the minimum salary and low levels of schooling. The prevalence of diabetes was 17.6% (95%CI 14.9;20.6) in 2003 and 20.1% (95%CI 17.3;23.1) in 2008, which indicates a growth over this period (p at the limit of significance). The most prevalent measure adopted by the older adults to control diabetes was hypoglycemic agents, followed by diet. Physical activity was not frequent, despite the significant differences observed between 2003 and 2008 results. The use of public health services to control diabetes was significantly higher in older individuals with lower income and lower levels of education.CONCLUSIONS Diabetes is a complex and challenging disease for patients and the health systems. Measures that encourage health promotion practices are necessary because they presented a smaller proportion than the use of hypoglycemic agents. Public health policies should be implemented, and aimed mainly at older individuals with low income and schooling levels. These changes are essential to improve the health condition of older diabetic patients.

Performance comparison of a VDFLL versus VDLL and scalar GNSS receiver architectures in Harsh scenarios

We analyze the advantages and drawbacks of a vector delay/frequency-locked loop (VDFLL) architecture regarding the conventional scalar and the vector delay-locked loop (VDLL) architectures for GNSS receivers in harsh scenarios that include ionospheric scintillation, multipath, and high dynamics motion. The VDFLL is constituted by a bank of code and frequency discriminators feeding a central extended Kaiman filter (EKF) that estimates the receiver's position, velocity, and clock bias. Both code and frequency loops are closed vectorially through the EKF. The VDLL closes the code loop vectorially and the phase loops through individual PLLs while the scalar receiver closes both loops by means of individual independent PLLs and DLLs.

Assessment of climate change statistical downscaling methods: Application and comparison of two statistical methods to a single site in Lisbon

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia do Ambiente