873 resultados para vision-based performance analysis


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Considering the transition from industrial society to information society, we realize that the digital training that is addressed is currently insufficient to navigate within a digitized reality. As proposed to minimize this problem, this paper assesses, validates and develops the software RoboEduc to work with educational robotics with the main differential programming of robotic devices in levels, considering the specifics of reality training . One of the emphases of this work isthe presentation of materials and procedures involving the development, analysis and evolution of this software. For validation of usability tests were performed, based on analysis of these tests was developed version 4.0 of RoboEduc

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A challenge that remains in the robotics field is how to make a robot to react in real time to visual stimulus. Traditional computer vision algorithms used to overcome this problem are still very expensive taking too long when using common computer processors. Very simple algorithms like image filtering or even mathematical morphology operations may take too long. Researchers have implemented image processing algorithms in high parallelism hardware devices in order to cut down the time spent in the algorithms processing, with good results. By using hardware implemented image processing techniques and a platform oriented system that uses the Nios II Processor we propose an approach that uses the hardware processing and event based programming to simplify the vision based systems while at the same time accelerating some parts of the used algorithms

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This work presents a scalable and efficient parallel implementation of the Standard Simplex algorithm in the multicore architecture to solve large scale linear programming problems. We present a general scheme explaining how each step of the standard Simplex algorithm was parallelized, indicating some important points of the parallel implementation. Performance analysis were conducted by comparing the sequential time using the Simplex tableau and the Simplex of the CPLEXR IBM. The experiments were executed on a shared memory machine with 24 cores. The scalability analysis was performed with problems of different dimensions, finding evidence that our parallel standard Simplex algorithm has a better parallel efficiency for problems with more variables than constraints. In comparison with CPLEXR , the proposed parallel algorithm achieved a efficiency of up to 16 times better

Relevância:

100.00% 100.00%

Publicador:

Resumo:

O objetivo deste trabalho foi estimar o número mínimo de colheitas em experimento com a cultura do pepino. Foram analisados dados de um experimento onde avaliaram-se 14 híbridos de pepino japonês, no delineamento em blocos ao acaso, com quatro repetições e cinco plantas por parcela, conduzidas sob ambiente protegido. Foram efetuadas 32 colheitas, três colheitas por semana, por um período de 72 dias e estimados os coeficientes de repetibilidade, com base na análise de componentes principais para os caracteres produção de frutos por planta, em massa e número, total e comercial. Os resultados permitiram concluir que menos de nove colheitas foram suficientes para analisar as diferenças de produtividade entre os diferentes híbridos, com 95% de certeza de serem eleitos os mais produtivos.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This thesis has as its object the Markers Organization Standard Narrative Discourse (MON), from its occurrence in oral and written corpora of different realizations of narrative discourse, considering its locus of occurrence in the narrative and discursive functioning. The research is guided by the Functional Linguistic Usage-Based, approach to which the organization of language is directly linked to the user experience, so that grammar is shaped by discourse. We examined only the narrative portions of Experience Reports, Tales and Legends in the oral and written, as follows: 3 inquiries Corpus Reports Remaining Quilombo (RN); 11 Corpus Legends legends of the Amazon, 14 Tales of Corpus Tales Brazilians and 21 Reports of experiences of Corpus and Discourse Grammar, with about 10,000 words in each corpus. A total of 22 markers were identified, which were: (1) classified according to the locus of occurrence in the narrative structure, as Labov (1972), (2) associated, according to the type of pattern that occur in narrative discourse, (3) described from the discursive function they perform. The research has relevance to the extent it is based speech analysis and offers proposals for productive teaching of mother tongue in which students and teachers can, grounded in language studies, consider living language, as an object of study, based on the National Curriculum Guidelines (OCN) and making use of New Technologies of Information and Communication (NTIC)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper aims to present, using a set of guidelines, how to apply the conservative distributed simulation paradigm (CMB protocol) to develop efficient applications. Using these guidelines, even a user with little experience on distributed simulation and computer architecture can have good performance on distributed simulations using conservative synchronization protocols for parallel processes.The set of guidelines is focus on a specific application domain, the performance evaluation of computer systems, considering models with coarse granularity and few logical processes and running over two platforms: parallel (high performance communication environment) and distributed (low performance communication environment).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this work a study of social networks based on analysis of family names is presented. A basic approach to the mathematical formalism of graphs is developed and then main theoretical models for complex networks are presented aiming to support the analysis of surnames networks models. These, in turn, are worked so as to be drawn leading quantities, such as aggregation coefficient, minimum average path length and connectivity distribution. Based on these quantities, it can be stated that surnames networks are an example of complex network, showing important features such as preferential attachment and small-world character

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The aim of the present study was to examine the impact of polymorphisms in prostate-specific antigen (PSA) and androgen-related genes (AR, CYP17, and CYP19) on prostate cancer (PCa) risk in selected high-risk patients who underwent prostate biopsy. Blood samples and prostate tissues were obtained for DNA analysis. Single-nucleotide polymorphisms in the 50-untranslated regions (UTRs) of the PSA (substitution A > G at position -158) and CYP17 (substitution T > C at 50-UTR) genes were detected by polymerase chain reaction (PCR)-restriction fragment length polymorphism assays. The CAG and TTTA repeats in the AR and CYP19 genes, respectively, were genotyped by PCR-based GeneScan analysis. Patients with the GG genotype of the PSA gene had a higher risk of PCa than those with the AG or AA genotype (OR = 3.79, p = 0.00138). The AA genotype was associated with lower PSA levels (6.44 +/- 1.64 ng/mL) compared with genotypes having at least one G allele (10.44 +/- 10.06 ng/mL) (p = 0.0687, 95% CI - 0.3146 to 8.315, unpaired t-test). The multivariate analysis confirmed the association between PSA levels and PSA genotypes (AA vs. AG+GG; chi(2) = 0.0482) and CYP19 (short alleles homozygous vs. at least one long allele; chi(2) = 0.0110) genotypes. Genetic instability at the AR locus leading to somatic mosaicism was detected in one PCa patient by comparing the length of AR CAG repeats in matched peripheral blood and prostate biopsy cores. Taken together, these findings suggest that the PSA genotype should be a clinically relevant biomarker to predict the PCa risk.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Background: Uterine leiomyomas are common, benign, smooth muscle tumors representing a significant public health problem. The aim of this study was to investigate CYP17A1, CYP19, and androgen (AR) polymorphisms, their relative risks for uterine leiomyomas and possible associations with clinical parameters.Methods: Uterine leiomyoma tissues and blood samples were obtained from 87 patients, as were peripheral blood samples from 68 control women. Clinical data were recorded in both groups. The CYP17A1 (rs743572) polymorphism was analyzed by PCR-RFLP, and the CYP19 [TTTA](n) repeat and AR [CAG](n) repeat were analyzed using PCR-based GeneScan analysis. AR loss of heterozygosity (LOH) and microsatellite instability were also evaluated, while samples exhibiting LOH were analyzed for X inactivation.Results: Clinical parameters related to disease development did not differ between cases and controls. CYP17A1 *A2/*A2 genotype was prevalent in non-white women. CYP17A1, CYP19, and AR genotypes and alleles did not differ between groups. However, alleles presenting [TTTA](7) repeats in intron 4 of CYP19 were more frequent in the control group (p=0.0550). Shorter and longer [CAG]n repeat alleles of AR were exclusive to the leiomyoma group. The LOH assay showed allele losses at AR locus in four informative tumors and X chromosome inactivation analysis revealed that these tumors retained the active allele.Conclusions: The overall lack of association between uterine leiomyomas with polymorphisms involved in steroidogenesis or steroid metabolism is consistent with the hypothesis that these polymorphisms do not substantially contribute to the development of these tumors.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We describe and compare diets of 3 species of vampyrine bats based on analysis of food remains found in gastrointestinal tracts of preserved museum specimens. We also examined possible ontogenetic, intersexual, geographic, and seasonal variations in feeding habits of each species. Trachops cirrhosus fed mainly on insects (79% of prey items), whereas Chrotopterus auritus and Vampyrum spectrum primarily ate small vertebrates (61-73% of prey items for both species). Vertebrate prey most frequently eaten by C. auritus were murid rodents whereas V. spectrum consumed primarily passerine birds. The frequency of occurrence of food items did not differ significantly with age or sex, at least for T. cirrhosus and C. auritus. Significant seasonal variations in diet were observed only for C. auritus, which consumed more insects during the wet season. Our findings confirm the importance of insects in the diet of T. cirrhosus and present new information on a diversified diet for V. spectrum and opportunistic feeding for C. auritus.