An algorithm for automatic checking of exercises in a dynamic geometry system: iGeom

One of the key issues in e-learning environments is the possibility of creating and evaluating exercises. However, the lack of tools supporting the authoring and automatic checking of exercises for specifics topics (e.g., geometry) drastically reduces advantages in the use of e-learning environments on a larger scale, as usually happens in Brazil. This paper describes an algorithm, and a tool based on it, designed for the authoring and automatic checking of geometry exercises. The algorithm dynamically compares the distances between the geometric objects of the student`s solution and the template`s solution, provided by the author of the exercise. Each solution is a geometric construction which is considered a function receiving geometric objects (input) and returning other geometric objects (output). Thus, for a given problem, if we know one function (construction) that solves the problem, we can compare it to any other function to check whether they are equivalent or not. Two functions are equivalent if, and only if, they have the same output when the same input is applied. If the student`s solution is equivalent to the template`s solution, then we consider the student`s solution as a correct solution. Our software utility provides both authoring and checking tools to work directly on the Internet, together with learning management systems. These tools are implemented using the dynamic geometry software, iGeom, which has been used in a geometry course since 2004 and has a successful track record in the classroom. Empowered with these new features, iGeom simplifies teachers` tasks, solves non-trivial problems in student solutions and helps to increase student motivation by providing feedback in real time. (c) 2008 Elsevier Ltd. All rights reserved.

Estimating HIV-1 incidence using the serologic testing algorithm for recent HIV infections at HIV counseling and testing centers in the city of São Paulo, Brazil

The network of HIV counseling and testing centers in São Paulo, Brazil is a major source of data used to build epidemiological profiles of the client population. We examined HIV-1 incidence from November 2000 to April 2001, comparing epidemiological and socio-behavioral data of recently-infected individuals with those with long-standing infection. A less sensitive ELISA was employed to identify recent infection. The overall incidence of HIV-1 infection was 0.53/100/year (95% CI: 0.31-0.85/100/year): 0.77/100/year for males (95% CI: 0.42-1.27/100/year) and 0.22/100/ year (95% CI: 0.05-0.59/100/year) for females. Overall HIV-1 prevalence was 3.2% (95% CI: 2.8-3.7%), being 4.0% among males (95% CI: 3.3-4.7%) and 2.1% among females (95% CI: 1.6-2.8%). Recent infections accounted for 15% of the total (95% CI: 10.2-20.8%). Recent infection correlated with being younger and male (p = 0.019). Therefore, recent infection was more common among younger males and older females.

Elevated Risk for HIV-1 Infection in Adolescents and Young Adults in São Paulo, Brazil

Background. Recent studies have sought to describe HIV infection and transmission characteristics around the world. Identification of early HIV-1 infection is essential to proper surveillance and description of regional transmission trends. In this study we compare people recently infected (RI) with HIV-1, as defined by Serologic Testing Algorithm for Recent HIV Seroconversion (STARHS), to those with chronic infection. Methodology/Principal Findings Subjects were identified from 2002-2004 at four testing sites in São Paulo. Of 485 HIV-1-positive subjects, 57 (12%) were defined as RI. Of the participants, 165 (34.0%) were aware of their serostatus at the time of HIV-1 testing. This proportion was statistically larger (p<0.001) among the individuals without recent infection (n = 158, 95.8%) compared to 7 individuals (4.2%) with recently acquired HIV-1 infection. In the univariate analysis, RI was more frequent in <25 and >59 years-old age strata (p<0.001). The majority of study participants were male (78.4%), 25 to 45 years-old (65.8%), white (63.2%), single (61.7%), with family income of four or more times the minimum wage (41.0%), but with an equally distributed educational level. Of those individuals infected with HIV-1, the predominant route of infection was sexual contact (89.4%), with both hetero (47.5%) and homosexual (34.5%) exposure. Regarding sexual activity in these individuals, 43.9% reported possible HIV-1 exposure through a seropositive partner, and 49.4% reported multiple partners, with 47% having 2 to 10 partners and 37.4% 11 or more; 53.4% of infected individuals reported condom use sometimes; 34.2% reported non-injecting, recreational drug use and 23.6% were reactive for syphilis by VDRL. Subjects younger than 25 years of age were most vulnerable according to the multivariate analysis. ) Conclusions/Significance In this study, we evaluated RI individuals and discovered that HIV-1 has been spreading among younger individuals in São Paulo and preventive approaches should, therefore, target this age stratum

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

The effectiveness of educational practice in diabetic foot: a view from Brazil

Background: The aim of the present study was to evaluate the prevention and self-inspection behavior of diabetic subjects with foot at ulcer risk, no previous episode, who participated in the routine visits and standardized education provided by the service and who received prescribed footwear. This evaluation was carried out using a questionnaire scoring from 0-10 (high scores reflect worse practice compliance). Results: 60 patients were studied (30 of each sex); mean age was 62 years, mean duration of the disease was 17 years. As for compliance, 90% showed a total score <= 5, only 8.7% regularly wore the footwear supplied; self foot inspection 65%, 28,3% with additional familiar inspection; creaming 77%; proper washing and drying 88%; proper cutting of toe nails 83%; no cuticle cutting 83%; routine shoe inspection 77%; no use of pumice stones or similar abrasive 70%; no barefoot walking 95%. Conclusion: the planned and multidisciplinary educational approach enabled high compliance of the ulcer prevention care needed in diabetic patients at risk for complications. In contrast, compliance observed for the use of footwear provided was extremely low, demonstrating that the issue of its acceptability should be further and carefully addressed. In countries of such vast dimensions as Brazil multidisciplinary educational approaches can and should be performed by the services providing care for patients with foot at risk for complications according to the reality of local scenarios. Furthermore, every educational program should assess the learning, results obtained and efficacy in the target population by use of an adequate evaluation system.

Elevated Risk for HIV-1 Infection in Adolescents and Young Adults in Sao Paulo, Brazil

Background. Recent studies have sought to describe HIV infection and transmission characteristics around the world. Identification of early HIV-1 infection is essential to proper surveillance and description of regional transmission trends. In this study we compare people recently infected (RI) with HIV-1, as defined by Serologic Testing Algorithm for Recent HIV Seroconversion (STARHS), to those with chronic infection. Methodology/Principal Findings. Subjects were identified from 2002-2004 at four testing sites in Sao Paulo. Of 485 HIV-1-positive subjects, 57 (12%) were defined as RI. Of the participants, 165 (34.0%) were aware of their serostatus at the time of HIV-1 testing. This proportion was statistically larger (p<0.001) among the individuals without recent infection (n = 158, 95.8%) compared to 7 individuals (4.2%) with recently acquired HIV-1 infection. In the univariate analysis, RI was more frequent in,25 and >59 years-old age strata (p < 0.001). The majority of study participants were male (78.4%), 25 to 45 years-old (65.8%), white (63.2%), single (61.7%), with family income of four or more times the minimum wage (41.0%), but with an equally distributed educational level. Of those individuals infected with HIV-1, the predominant route of infection was sexual contact (89.4%), with both hetero (47.5%) and homosexual (34.5%) exposure. Regarding sexual activity in these individuals, 43.9% reported possible HIV-1 exposure through a seropositive partner, and 49.4% reported multiple partners, with 47% having 2 to 10 partners and 37.4% 11 or more; 53.4% of infected individuals reported condom use sometimes; 34.2% reported non-injecting, recreational drug use and 23.6% were reactive for syphilis by VDRL. Subjects younger than 25 years of age were most vulnerable according to the multivariate analysis. Conclusions/Significance. In this study, we evaluated RI individuals and discovered that HIV-1 has been spreading among younger individuals in Sao Paulo and preventive approaches should, therefore, target this age stratum.

Continental passive microwave-based rainfall estimation algorithm: Application to the Amazon Basin

This paper presents a new statistical algorithm to estimate rainfall over the Amazon Basin region using the Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI). The algorithm relies on empirical relationships derived for different raining-type systems between coincident measurements of surface rainfall rate and 85-GHz polarization-corrected brightness temperature as observed by the precipitation radar (PR) and TMI on board the TRMM satellite. The scheme includes rain/no-rain area delineation (screening) and system-type classification routines for rain retrieval. The algorithm is validated against independent measurements of the TRMM-PR and S-band dual-polarization Doppler radar (S-Pol) surface rainfall data for two different periods. Moreover, the performance of this rainfall estimation technique is evaluated against well-known methods, namely, the TRMM-2A12 [ the Goddard profiling algorithm (GPROF)], the Goddard scattering algorithm (GSCAT), and the National Environmental Satellite, Data, and Information Service (NESDIS) algorithms. The proposed algorithm shows a normalized bias of approximately 23% for both PR and S-Pol ground truth datasets and a mean error of 0.244 mm h(-1) ( PR) and -0.157 mm h(-1)(S-Pol). For rain volume estimates using PR as reference, a correlation coefficient of 0.939 and a normalized bias of 0.039 were found. With respect to rainfall distributions and rain area comparisons, the results showed that the formulation proposed is efficient and compatible with the physics and dynamics of the observed systems over the area of interest. The performance of the other algorithms showed that GSCAT presented low normalized bias for rain areas and rain volume [0.346 ( PR) and 0.361 (S-Pol)], and GPROF showed rainfall distribution similar to that of the PR and S-Pol but with a bimodal distribution. Last, the five algorithms were evaluated during the TRMM-Large-Scale Biosphere-Atmosphere Experiment in Amazonia (LBA) 1999 field campaign to verify the precipitation characteristics observed during the easterly and westerly Amazon wind flow regimes. The proposed algorithm presented a cumulative rainfall distribution similar to the observations during the easterly regime, but it underestimated for the westerly period for rainfall rates above 5 mm h(-1). NESDIS(1) overestimated for both wind regimes but presented the best westerly representation. NESDIS(2), GSCAT, and GPROF underestimated in both regimes, but GPROF was closer to the observations during the easterly flow.

Fast ray-tracing algorithm for circumstellar structures (FRACS) II. Disc parameters of the B[e] supergiant CPD-57 degrees 2874 from VLTI/MIDI data

Context. B[e] supergiants are luminous, massive post-main sequence stars exhibiting non-spherical winds, forbidden lines, and hot dust in a disc-like structure. The physical properties of their rich and complex circumstellar environment (CSE) are not well understood, partly because these CSE cannot be easily resolved at the large distances found for B[e] supergiants (typically greater than or similar to 1 kpc). Aims. From mid-IR spectro-interferometric observations obtained with VLTI/MIDI we seek to resolve and study the CSE of the Galactic B[e] supergiant CPD-57 degrees 2874. Methods. For a physical interpretation of the observables (visibilities and spectrum) we use our ray-tracing radiative transfer code (FRACS), which is optimised for thermal spectro-interferometric observations. Results. Thanks to the short computing time required by FRACS (<10 s per monochromatic model), best-fit parameters and uncertainties for several physical quantities of CPD-57 degrees 2874 were obtained, such as inner dust radius, relative flux contribution of the central source and of the dusty CSE, dust temperature profile, and disc inclination. Conclusions. The analysis of VLTI/MIDI data with FRACS allowed one of the first direct determinations of physical parameters of the dusty CSE of a B[e] supergiant based on interferometric data and using a full model-fitting approach. In a larger context, the study of B[e] supergiants is important for a deeper understanding of the complex structure and evolution of hot, massive stars.

The accuracy of the Clock Drawing Test compared to that of standard screening tests for Alzheimer`s disease: results from a study of Brazilian elderly with heterogeneous educational backgrounds

Background: Although the Clock Drawing Test (CDT) is the second most used test in the world for the screening of dementia, there is still debate over its sensitivity specificity, application and interpretation in dementia diagnosis. This study has three main aims: to evaluate the sensitivity and specificity of the CDT in a sample composed of older adults with Alzheimer`s disease (AD) and normal controls; to compare CDT accuracy to the that of the Mini-mental State Examination (MMSE) and the Cambridge Cognitive Examination (CAMCOG), and to test whether the association of the MMSE with the CDT leads to higher or comparable accuracy as that reported for the CAMCOG. Methods: Cross-sectional assessment was carried out for 121 AD and 99 elderly controls with heterogeneous educational levels from a geriatric outpatient clinic who completed the Cambridge Examination for Mental Disorder of the Elderly (CAMDEX). The CDT was evaluated according to the Shulman, Mendez and Sunderland scales. Results: The CDT showed high sensitivity and specificity. There were significant correlations between the CDT and the MMSE (0.700-0.730; p < 0.001) and between the CDT and the CAMCOG (0.753-0.779; p < 0.001). The combination of the CDT with the MMSE improved sensitivity and specificity (SE = 89.2-90%; SP = 71.7-79.8%). Subgroup analysis indicated that for elderly people with lower education, sensitivity and specificity were both adequate and high. Conclusions: The CDT is a robust screening test when compared with the MMSE or the CAMCOG, independent of the scale used for its interpretation. The combination with the MMSE improves its performance significantly, becoming equivalent to the CAMCOG.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

An algorithm for computerized automatic tuning of power system stabilizers

The main objective of this paper is to relieve the power system engineers from the burden of the complex and time-consuming process of power system stabilizer (PSS) tuning. To achieve this goal, the paper proposes an automatic process for computerized tuning of PSSs, which is based on an iterative process that uses a linear matrix inequality (LMI) solver to find the PSS parameters. It is shown in the paper that PSS tuning can be written as a search problem over a non-convex feasible set. The proposed algorithm solves this feasibility problem using an iterative LMI approach and a suitable initial condition, corresponding to a PSS designed for nominal operating conditions only (which is a quite simple task, since the required phase compensation is uniquely defined). Some knowledge about the PSS tuning is also incorporated in the algorithm through the specification of bounds defining the allowable PSS parameters. The application of the proposed algorithm to a benchmark test system and the nonlinear simulation of the resulting closed-loop models demonstrate the efficiency of this algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

A novel multiobjective optimization algorithm based on bacterial chemotaxis

In this article a novel algorithm based on the chemotaxis process of Echerichia coil is developed to solve multiobjective optimization problems. The algorithm uses fast nondominated sorting procedure, communication between the colony members and a simple chemotactical strategy to change the bacterial positions in order to explore the search space to find several optimal solutions. The proposed algorithm is validated using 11 benchmark problems and implementing three different performance measures to compare its performance with the NSGA-II genetic algorithm and with the particle swarm-based algorithm NSPSO. (C) 2009 Elsevier Ltd. All rights reserved.

A Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard`s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. (C) 2007 Elsevier Ltd. All rights reserved.

A hybrid Particle Swarm Optimization - Simplex algorithm (PSOS) for structural damage identification

This study proposes a new PSOS-model based damage identification procedure using frequency domain data. The formulation of the objective function for the minimization problem is based on the Frequency Response Functions (FRFs) of the system. A novel strategy for the control of the Particle Swarm Optimization (PSO) parameters based on the Nelder-Mead algorithm (Simplex method) is presented; consequently, the convergence of the PSOS becomes independent of the heuristic constants and its stability and confidence are enhanced. The formulated hybrid method performs better in different benchmark functions than the Simulated Annealing (SA) and the basic PSO (PSO(b)). Two damage identification problems, taking into consideration the effects of noisy and incomplete data, were studied: first, a 10-bar truss and second, a cracked free-free beam, both modeled with finite elements. In these cases, the damage location and extent were successfully determined. Finally, a non-linear oscillator (Duffing oscillator) was identified by PSOS providing good results. (C) 2009 Elsevier Ltd. All rights reserved

Adaptive Approach for a Maximum Entropy Algorithm in Ecological Niche Modeling

This paper presents an Adaptive Maximum Entropy (AME) approach for modeling biological species. The Maximum Entropy algorithm (MaxEnt) is one of the most used methods in modeling biological species geographical distribution. The approach presented here is an alternative to the classical algorithm. Instead of using the same set features in the training, the AME approach tries to insert or to remove a single feature at each iteration. The aim is to reach the convergence faster without affect the performance of the generated models. The preliminary experiments were well performed. They showed an increasing on performance both in accuracy and in execution time. Comparisons with other algorithms are beyond the scope of this paper. Some important researches are proposed as future works.