Gross Motor Deficits in Children Prenatally Exposed to Alcohol: A Meta-analysis

BACKGROUND AND OBJECTIVES: Gross motor (GM) deficits are often reported in children with prenatal alcohol exposure (PAE), but their prevalence and the domains affected are not clear. The objective of this review was to characterize GM impairment in children with a diagnosis of fetal alcohol spectrum disorder (FASD) or moderate to heavy maternal alcohol intake.METHODS: A systematic review with meta-analysis was conducted. Medline, Embase, Allied and Complementary Medicine Database, Cumulative Index to Nursing and Allied Health Literature, PsycINFO, PEDro, and Google Scholar databases were searched. Published observational studies including children aged 0 to <= 18 years with (1) an FASD diagnosis or moderate to heavy PAE, or a mother with confirmed alcohol dependency or binge drinking during pregnancy, and (2) GM outcomes obtained by using a standardized assessment tool. Data were extracted regarding participants, exposure, diagnosis, and outcomes by using a standardized protocol. Methodological quality was evaluated by using Strengthening the Reporting of Observational Studies in Epidemiology guidelines.RESULTS: The search recovered 2881 articles of which 14 met the systematic review inclusion criteria. The subjects' mean age ranged from 3 days to 13 years. Study limitations included failure to report cutoffs for impairment, nonstandardized reporting of PAE, and small sample sizes. The meta-analysis pooled results (n = 10) revealed a significant association between a diagnosis of FASD or moderate to heavy PAE and GM impairment (odds ratio: 2.9; 95% confidence interval: 2.1-4.0). GM deficits were found in balance, coordination, and ball skills. There was insufficient data to determine prevalence.CONCLUSIONS: The significant results suggest evaluation of GM proficiency should be a standard component of multidisciplinary FASD diagnostic services.

Educação em tempo integral e programa mais educação: aproximações e distanciamentos das regiões brasileiras em relação à meta prevista no projeto de lei do novo Plano Nacional de Educação (PNE)

This work presents a framework for full-time education in Brazil, analyzing the levels of proximity and distance of the Brazilian regions in relation to achieving target paragraph 06 of the bill of the new National Education Plan, which establishes the offer of full-time education in at least fifty percent of public schools, and at least twenty-five percent of students in basic education. It aims to determine the contribution of the “Mais Educação” (More Education) Program of the federal government in fulfilling this goal.

Diagnóstico de distúrbios de tensão em sistemas de distribuição de energia elétrica usando um algoritmo imuno-neural

Pós-graduação em Engenharia Elétrica - FEIS

Software baseado em rede neural artificial desenvolvido por meio de algoritmo genético para a classificação morfológica de blastocistos bovinos

Pós-graduação em Biociências - FCLAS

A systematic review and meta-analysis of cohort studies of echocardiographic findings in OSA children after adenotonsilectomy

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Efficacy of antibiotic therapy for peritoneal dialysis-associated peritonitis: a proportional meta-analysis

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Um algoritmo de busca tabu para problemas de localização não capacitados

In this work, a tabu search algorithm for solving uncapacitated location problems is presented. The uncapacitated location problem is a classic problem of localization and occurs in many practical situations. The problem consists in determining in a network, at the minimum possible cost, the better localization, in a network, for the installation of facilities in order to attend the customers' associated demands, at the minimum possible cost. One admits that there exists a cost associated with the opening of a facility and a cost of attendance of each customer by any open facilities. In the particular case of the uncapacitated location problem there is no capacity limitation to attend the customers’ demands. There are some parameters in the algorithm that influence the solution’s quality. These parameters were tested and optimal values for them were obtained. The results show that the proposed algorithm is able to find the optimal solution for all small tested problems keeping the compromise between solution’s quality and computational time. However, to solve bigger problems, the structure of the algorithm must be changed in its structure. The implemented algorithm is integrated to a computational platform for solution of logistic problems

Algoritmo de resolução de EDO de primeira ordem com implementação em HTML

This work presents a theoretical study of ordinary differential equations of first order directed so as to provide basis for the development of an educational software that helps students and researchers confronted with this issue. The algorithm was developed in HTML language in to that the results provide a website that allows the audience to access the software anywhere which has internet connection

Implementação do algoritmo de Newman para identificação de comunidades em placas gráficas

Communities are present on physical, chemical and biological systems and their identification is fundamental for the comprehension of the behavior of these systems. Recently, available data related to complex networks have grown exponentially, demanding more computational power. The Graphical Processing Unit (GPU) is a cost effective alternative suitable for this purpose. We investigate the convenience of this for network science by proposing a GPU based implementation of Newman community detection algorithm. We showed that the processing time of matrix multiplications of GPUs grow slower than CPUs in relation to the matrix size. It was proven, thus, that GPU processing power is a viable solution for community dentification simulation that demand high computational power. Our implementation was tested on an integrated biological network for the bacterium Escherichia coli

Aplicação do algoritmo Rough Sets em um Data Warehouse

This Project aims to develop methods for data classification in a Data Warehouse for decision-making purposes. We also have as another goal the reduction of an attribute set in a Data Warehouse, in which a given reduced set is capable of keeping the same properties of the original one. Once we achieve a reduced set, we have a smaller computational cost of processing, we are able to identify non-relevant attributes to certain kinds of situations, and finally we are also able to recognize patterns in the database that will help us to take decisions. In order to achieve these main objectives, it will be implemented the Rough Sets algorithm. We chose PostgreSQL as our data base management system due to its efficiency, consolidation and finally, it’s an open-source system (free distribution)

A cidade de Rio Claro/SP está cumprindo sua meta na compra de alimentos de agricultura familiar para o PNAE?

Não disponível

Uma proposta de resolução para problemas de roteirização de veículos baseada no algoritmo genético

The vehicle routing problem is to nd a better route to meet a set of customers who are geographically dispersed using vehicles that are a central repository to which they return after serving customers. These customers have a demand that must be met. Such problems have a wide practical application among them we can mention: school transport, distribution of newspapers, garbage collection, among others. Because it is a classic problem as NP-hard, these problems have aroused interest in the search for viable methods of resolution. In this paper we use the Genetic Algorithm as a resolution

Novo algoritimo genético para problemas de cobertura de conjuntos

The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.

Busca quântica de dados XML usando algoritmo de Grover

This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical computers (C++) and quantum computers (QCL). The algorithms were submitted to simulations, which resulted in a comparative study of the operation of Grover’s algorithm on both systems, carrying out searches in a mass of data in XML format files. As a result, we see very similar numbers between classical and quantum systems, this creates an expectation that the search in real quantum computers is much more efficient.