IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Comparação do cálculo de dose com os algoritmos Analytical Anisotropic Algorithm e Pencil Beam Convolution na patologia de pulmão

Mestrado em Radioterapia.

Association of FTO and PPARG polymorphisms with obesity in Portuguese women

Purpose: We evaluated the association between risk of obesity in the Portuguese population and two obesity-related single-nucleotide gene polymorphisms: fat-mass and obesity-associated (FTO) rs9939609 and peroxisome proliferator-activated receptor gamma (PPARG) rs1801282. Patients and methods: A total of 194 Portuguese premenopausal female Caucasians aged between 18 and 50 years (95 with body mass index [BMI] ≥30 g/m2, 99 controls with BMI 18.5–24.9 kg/m2) participated in this study. The association of the single-nucleotide polymorphisms with obesity was determined by odds ratio calculation with 95% confidence intervals. Results: Significant differences in allelic expression of FTO rs9939609 (P<0.05) were found between control and case groups, indicating a 2.5-higher risk for obesity in the presence of both risk alleles when comparing the control group with the entire obese group. A fourfold-higher risk was found for subjects with class III obesity compared to those with classes I and II. No significant differences in BMI were found between the control and case groups for PPARG rs1801282 (P>0.05). Conclusion: For the first time, a study involving an adult Portuguese population shows that individuals harboring both risk alleles in the FTO gene locus are at higher risk for obesity, which is in agreement to what has been reported for other European populations.

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

Mestrado em Radioterapia

Fatty liver characterization and classification by ultrasound

Steatosis, also known as fatty liver, corresponds to an abnormal retention of lipids within the hepatic cells and reflects an impairment of the normal processes of synthesis and elimination of fat. Several causes may lead to this condition, namely obesity, diabetes, or alcoholism. In this paper an automatic classification algorithm is proposed for the diagnosis of the liver steatosis from ultrasound images. The features are selected in order to catch the same characteristics used by the physicians in the diagnosis of the disease based on visual inspection of the ultrasound images. The algorithm, designed in a Bayesian framework, computes two images: i) a despeckled one, containing the anatomic and echogenic information of the liver, and ii) an image containing only the speckle used to compute the textural features. These images are computed from the estimated RF signal generated by the ultrasound probe where the dynamic range compression performed by the equipment is taken into account. A Bayes classifier, trained with data manually classified by expert clinicians and used as ground truth, reaches an overall accuracy of 95% and a 100% of sensitivity. The main novelties of the method are the estimations of the RF and speckle images which make it possible to accurately compute textural features of the liver parenchyma relevant for the diagnosis.

Haptoglobin, acid phosphatase and demographic factors: obesity risk

The aim of this work is to study the risk of obesity posed by two genetic factors: haptoglobin phenotype and acid phosphatase phenotype, one enzymatic activity: acid phosphatase activity (ACP1), age and gender. Haptoglobin (Hp) is a protein of the immune system, and three phenotypes of Hp are found in humans: Hp1-1, Hp2-1, and Hp2-2. This protein is associated with a susceptibility to common pathological conditions, such as obesity. ACP1 is an intracellular enzyme The phenotypes of ACP1 (AA, AB, AC, BB, BC, CC) are also considered. We took a sample of 127 subjects with complete data from 714 registers. Since we intend to identify risk factors for obesity, an ordinal regression model is adjusted, using the Body Mass Index, BMI, to define weight categories. Haptoglobin phenotype, enzymatic activity of ACP1, acid phosphatase phenotype, age and gender are considered as regressor variables. We found three factors associated with an increased risk of obesity: phenotype Hp2-1 of haptoglobin (estimated odds ratio OR 11.54), phenotype AA of acid phosphatase (OR 33.788) and age (OR 1.39). The interaction between phenotype Hp2-1 and phenotype AC is associated with a decreased risk of obesity (OR 0.032); The interaction between phenotype AA and ACP1 activity is associated with a decreased risk of obesity (OR 0.954).

Q192R polymorphism of the paraoxonase-1 gene as a risk factor for obesity in Portuguese women

Introduction - Obesity became a major public health problem as a result of its increasing prevalence worldwide. Paraoxonase-1 (PON1) is an esterase able to protect membranes and lipoproteins from oxidative modifications. At the PON1 gene, several polymorphisms in the promoter and coding regions have been identified. The aims of this study were i) to assess PON1 L55M and Q192R polymorphisms as a risk factor for obesity in women; ii) to compare PON1 activity according to the expression of each allele in L55M and Q192R polymorphisms; iii) to compare PON1 activity between obese and normal-weight women. Materials and methods - We studied 75 healthy (35.9±8.2 years) and 81 obese women (34.3±8.2 years). Inclusion criteria for obese subjects were body mass index ≥30 kg/m2 and absence of inflammatory/neoplasic conditions or kidney/hepatic dysfunction. The two PON1 polymorphisms were assessed by real-time PCR with TaqMan probes. PON1 enzymatic activity was assessed by spectrophotometric methods, using paraoxon as a substrate. Results - No significant differences were found for PON1 activity between normal and obese women. Nevertheless, PON1 activity was greater (P<0.01) for the RR genotype (in Q192R polymorphism) and for the LL genotype (in L55M polymorphism). The frequency of allele R of Q192R polymorphism was significantly higher in obese women (P<0.05) and was associated with an increased risk of obesity (odds ratio=2.0 – 95% confidence interval (1.04; 3.87)). Conclusion - 55M and Q192R polymorphisms influence PON1 activity. The allele R of the Q192R polymorphism is associated with an increased risk for development of obesity among Portuguese Caucasian premenopausal women.

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

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.

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.

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.