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).

Assessment and control of nanoparticles exposure in welding operations by use of a control banding tool

This paper describes the use of a Control Banding Tool to assess and further control of exposure of nanoparticles emitted during welding operations. The tool was applied to Metal Active Gas (MAG) arc welding of mild and stainless steel, providing semi-quantitative data on the process, so that protection measures could be derived, e.g. exhaust gas ventilation by hoods, local ventilation devices and containment measures. This tool is quite useful to compare and evaluate the characteristics of arc welding procedures so that more eco-friendly processes could be preferred over the more potentially noxious ones.

Complete synchronization and delayed synchronization in couplings

We consider a general coupling of two identical chaotic dynamical systems, and we obtain the conditions for synchronization. We consider two types of synchronization: complete synchronization and delayed synchronization. Then, we consider four different couplings having different behaviors regarding their ability to synchronize either completely or with delay: Symmetric Linear Coupled System, Commanded Linear Coupled System, Commanded Coupled System with delay and symmetric coupled system with delay. The values of the coupling strength for which a coupling synchronizes define its Window of synchronization. We obtain analytically the Windows of complete synchronization, and we apply it for the considered couplings that admit complete synchronization. We also obtain analytically the Window of chaotic delayed synchronization for the only considered coupling that admits a chaotic delayed synchronization, the commanded coupled system with delay. At last, we use four different free chaotic dynamics (based in tent map, logistic map, three-piecewise linear map and cubic-like map) in order to observe numerically the analytically predicted windows.

Complete synchronization and delayed synchronization in couplings

We consider a general coupling of two identical chaotic dynamical systems, and we obtain the conditions for synchronization. We consider two types of synchronization: complete synchronization and delayed synchronization. Then, we consider four different couplings having different behaviors regarding their ability to synchronize either completely or with delay: Symmetric Linear Coupled System, Commanded Linear Coupled System, Commanded Coupled System with delay and symmetric coupled system with delay. The values of the coupling strength for which a coupling synchronizes define its Window of synchronization. We obtain analytically the Windows of complete synchronization, and we apply it for the considered couplings that admit complete synchronization. We also obtain analytically the Window of chaotic delayed synchronization for the only considered coupling that admits a chaotic delayed synchronization, the commanded coupled system with delay. At last, we use four different free chaotic dynamics (based in tent map, logistic map, three-piecewise linear map and cubic-like map) in order to observe numerically the analytically predicted windows.

Diffuse liver disease classification from ultrasound surface characterization, clinical and laboratorial data

In this work liver contour is semi-automatically segmented and quantified in order to help the identification and diagnosis of diffuse liver disease. The features extracted from the liver contour are jointly used with clinical and laboratorial data in the staging process. The classification results of a support vector machine, a Bayesian and a k-nearest neighbor classifier are compared. A population of 88 patients at five different stages of diffuse liver disease and a leave-one-out cross-validation strategy are used in the classification process. The best results are obtained using the k-nearest neighbor classifier, with an overall accuracy of 80.68%. The good performance of the proposed method shows a reliable indicator that can improve the information in the staging of diffuse liver disease.

The complete sequence of a 9000 bp fragment of the right arm of Saccharomyces cerevisiae chromosome VII contains four previously unknown open reading frames

We report the sequence of a 9000 bp fragment from the right arm of Saccharomyces cerevisiae chromosome VII. Analysis of the sequence revealed four complete previously unknown open reading frames, which were named G7587, G7589, G7591 and G7594 following standard rules for provisional nomenclature. Outstanding features of some of these proteins were the homology of the putative protein coded by G7589 with proteins involved in transcription regulation and the transmembrane domains predicted in the putative protein coded by G7591.

Efficient feature selection filters for high-dimensional data

Feature selection is a central problem in machine learning and pattern recognition. On large datasets (in terms of dimension and/or number of instances), using search-based or wrapper techniques can be cornputationally prohibitive. Moreover, many filter methods based on relevance/redundancy assessment also take a prohibitively long time on high-dimensional. datasets. In this paper, we propose efficient unsupervised and supervised feature selection/ranking filters for high-dimensional datasets. These methods use low-complexity relevance and redundancy criteria, applicable to supervised, semi-supervised, and unsupervised learning, being able to act as pre-processors for computationally intensive methods to focus their attention on smaller subsets of promising features. The experimental results, with up to 10(5) features, show the time efficiency of our methods, with lower generalization error than state-of-the-art techniques, while being dramatically simpler and faster.

O papel do educador na promoção do envolvimento parental: uma reflexão

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Synchronization in Von Bertalanffy’s models

Many data have been useful to describe the growth of marine mammals, invertebrates and reptiles, seabirds, sea turtles and fishes, using the logistic, the Gom-pertz and von Bertalanffy's growth models. A generalized family of von Bertalanffy's maps, which is proportional to the right hand side of von Bertalanffy's growth equation, is studied and its dynamical approach is proposed. The system complexity is measured using Lyapunov exponents, which depend on two biological parameters: von Bertalanffy's growth rate constant and the asymptotic weight. Applications of synchronization in real world is of current interest. The behavior of birds ocks, schools of fish and other animals is an important phenomenon characterized by synchronized motion of individuals. In this work, we consider networks having in each node a von Bertalanffy's model and we study the synchronization interval of these networks, as a function of those two biological parameters. Numerical simulation are also presented to support our approaches.

Parallel sparse unmixing of hyperspectral data

In this paper, a new parallel method for sparse spectral unmixing of remotely sensed hyperspectral data on commodity graphics processing units (GPUs) is presented. A semi-supervised approach is adopted, which relies on the increasing availability of spectral libraries of materials measured on the ground instead of resorting to endmember extraction methods. This method is based on the spectral unmixing by splitting and augmented Lagrangian (SUNSAL) that estimates the material's abundance fractions. The parallel method is performed in a pixel-by-pixel fashion and its implementation properly exploits the GPU architecture at low level, thus taking full advantage of the computational power of GPUs. Experimental results obtained for simulated and real hyperspectral datasets reveal significant speedup factors, up to 1 64 times, with regards to optimized serial implementation.