1000 resultados para Algoritmos quase-analíticos


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Multiobjective Spanning Tree Problem is NP-hard and models applications in several areas. This research presents an experimental analysis of different strategies used in the literature to develop exact algorithms to solve the problem. Initially, the algorithms are classified according to the approaches used to solve the problem. Features of two or more approaches can be found in some of those algorithms. The approaches investigated here are: the two-stage method, branch-and-bound, k-best and the preference-based approach. The main contribution of this research lies in the fact that no research was presented to date reporting a systematic experimental analysis of exact algorithms for the Multiobjective Spanning Tree Problem. Therefore, this work can be a basis for other research that deal with the same problem. The computational experiments compare the performance of algorithms regarding processing time, efficiency based on the number of objectives and number of solutions found in a controlled time interval. The analysis of the algorithms was performed for known instances of the problem, as well as instances obtained from a generator commonly used in the literature

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N  M matrix that satisfies line and column constraints. A Nonogram is encoded by a vector whose elements specify the number of pixels in each row and column of a figure without specifying their coordinates. This work presents exact and heuristic approaches to solve Nonograms. The depth first search was one of the chosen exact approaches because it is a typical example of brute search algorithm that is easy to implement. Another implemented exact approach was based on the Las Vegas algorithm, so that we intend to investigate whether the randomness introduce by the Las Vegas-based algorithm would be an advantage over the depth first search. The Nonogram is also transformed into a Constraint Satisfaction Problem. Three heuristics approaches are proposed: a Tabu Search and two memetic algorithms. A new function to calculate the objective function is proposed. The approaches are applied on 234 instances, the size of the instances ranging from 5 x 5 to 100 x 100 size, and including logical and random Nonograms

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Scientific Algorithms are a new metaheuristics inspired in the scientific research process. The new method introduces the idea of theme to search the solution space of hard problems. The inspiration for this class of algorithms comes from the act of researching that comprises thinking, knowledge sharing and disclosing new ideas. The ideas of the new method are illustrated in the Traveling Salesman Problem. A computational experiment applies the proposed approach to a new variant of the Traveling Salesman Problem named Car Renter Salesman Problem. The results are compared to state-of-the-art algorithms for the latter problem

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Symbolic Data Analysis (SDA) main aims to provide tools for reducing large databases to extract knowledge and provide techniques to describe the unit of such data in complex units, as such, interval or histogram. The objective of this work is to extend classical clustering methods for symbolic interval data based on interval-based distance. The main advantage of using an interval-based distance for interval-based data lies on the fact that it preserves the underlying imprecision on intervals which is usually lost when real-valued distances are applied. This work includes an approach allow existing indices to be adapted to interval context. The proposed methods with interval-based distances are compared with distances punctual existing literature through experiments with simulated data and real data interval

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Este trabalho apresenta um algoritmo transgenético híbrido para a solução de um Problema de Configuração de uma Rede de Distribuição de Gás Natural. O problema da configuração dessas redes requer a definição de um traçado por onde os dutos devem ser colocados para atender aos clientes. É estudada neste trabalho uma maneira de conectar os clientes em uma rede com arquitetura em forma de árvore. O objetivo é minimizar o custo de construção da rede, mesmo que para isso alguns clientes que não proporcionam lucros deixem de ser atendidos. Esse problema pode ser formulado computacionalmente através do Problema de Steiner com Prêmios. Este é um problema de otimização combinatória da classe dos NPÁrduos. Este trabalho apresenta um algoritmo heurístico para a solução do problema. A abordagem utilizada é chamada de Algoritmos Transgenéticos, que se enquadram na categoria dos algoritmos evolucionários. Para a geração de soluções inicias é utilizado um algoritmo primaldual, e pathrelinking é usado como intensificador

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The use of Multiple Input Multiple Output (MIMO) systems has permitted the recent evolution of wireless communication standards. The Spatial Multiplexing MIMO technique, in particular, provides a linear gain at the transmission capacity with the minimum between the numbers of transmit and receive antennas. To obtain a near capacity performance in SM-MIMO systems a soft decision Maximum A Posteriori Probability MIMO detector is necessary. However, such detector is too complex for practical solutions. Hence, the goal of a MIMO detector algorithm aimed for implementation is to get a good approximation of the ideal detector while keeping an acceptable complexity. Moreover, the algorithm needs to be mapped to a VLSI architecture with small area and high data rate. Since Spatial Multiplexing is a recent technique, it is argued that there is still much room for development of related algorithms and architectures. Therefore, this thesis focused on the study of sub optimum algorithms and VLSI architectures for broadband MIMO detector with soft decision. As a result, novel algorithms have been developed starting from proposals of optimizations for already established algorithms. Based on these results, new MIMO detector architectures with configurable modulation and competitive area, performance and data rate parameters are here proposed. The developed algorithms have been extensively simulated and the architectures were synthesized so that the results can serve as a reference for other works in the area

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

OBJETIVOS: recupera-se síntese dos principais aspectos das publicações referentes a projeto conduzido pela equipe, na década passada, com o objetivo de subsidiar a avaliação de política pública setorial de suplementação alimentar na infância. MÉTODOS: acompanharam-se trimestralmente, durante um ano, indicadores de crescimento e desenvolvimento em populações periféricas de dois a 72 meses de idade, em Sorocaba, São Paulo. Após realização do censo infantil de duas regiões da cidade, as crianças freqüentes a creches (em número de 164) foram comparadas às demais (280). O impacto nutricional foi quantificado através de análises univariadas (testes inferenciais Kappa e de Goodman) e multivariadas. Vieses e confundimento foram averiguados e controlados. RESULTADOS: observou-se, entre muitas outras informações obtidas, que o grupo assistido apresentou: 1) idade média superior; 2) menor taxa de aleitamento natural; 3) menores valores de peso/altura à admissão, com maiores ganhos durante a evolução; 4) essa melhora aumentou com a duração da exposição e foi maior entre os mais velhos. CONCLUSÕES: avalia-se que assistir apropriadamente pré-escolares constitui hoje, em nosso meio, relevante imperativo de ordem social.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fifteen soil samples and four extradants (DTPA, Na 2EDTA, HCl and Mehlich 1) were used to study soil extraction methods for available zinc. Each extradant was studied in three soil:solution ratios (1:2, 1:4 and 1:10) and in three extraction periods in the ratio most frequently used. The zinc extracted by DTPA, Na 2EDTA and HCl was not affected by use of soil:solution ratios 1:2 and 1:4, but the amount extracted increased with the 1:10 ratio. In this relation, the variation coefficients increased. With Mehlich, no definite tendency was observed. The increase of extraction period for DTPA extractant, in 1:2 ratio, had little effect on the amount of zinc extracted and on the precision. As to Na 2EDTA extractant in 1:10 ratio, with the increase of extraction time, both increased. As to HCl and Mehlich, both in 1:4 ratio, the increase in extraction period had no effect on the amount of zinc extracted and no definite effect on the precision. Thus, the use of 1:2 ratio for DTPA and Na 2EDTA and 1:4 ratio for acid extractants is recommended. Concerning the period of extraction, 120 min should be used with DTPA and Na 2EDTA, 15 min with HCl and 5 min with Mehlich.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objective. To assess factors determining growth in a group of children between 3 months and 6 years old enrolled in a public municipal (i.e., government-supported, not private) day-care center, in comparison to a group of children with similar characteristics but who were not enrolled in the center. Methods. A quasi-experimental study was designed to observe 444 children aged 3 to 72 months from a low-income neighborhood in the city of Sorocaba, in the state of São Paulo, Brazil. Two groups were studied: 164 children enrolled in a local municipal day-care center (intervention group) and 280 not receiving care at the center (nonintervention, comparison group) but instead being cared for at home. Both groups were seen four times over a period of 16 months. At each observation session, the children's weight and height were measured. Information was also collected on the mother's sociodemographic characteristics and the illnesses she had suffered as well as the child's weight and other health characteristics at birth, the child's illnesses in the 15 days before each observation, and any hospitalizations. Results. The children in both groups were from low-income families, with 65% of the families having an average monthly income below US$ 100; 80% of the mothers had received 8 years of schooling or less. Multivariate linear regression analysis showed that at the first observation (just before enrollment in the day-care center), birth weight was the only factor that explained the nutritional differences between the two groups. Subsequent analyses showed that being in day care was the factor that best explained the differences between the groups, especially in terms of the adequacy of weight for age, after controlling for birthweight, sex, age at the beginning of the study, and illnesses in the 15 days before an observation session. The nutritional impact of the intervention was significant as early as 3 months after being enrolled in day care. Conclusions. The nutritional benefits of the care provided at the center outweighed the negative effects sometimes seen in such centers, such as the greater morbidity that children in day-care centers often experience in comparison to children receiving care at home.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a new approach for solving constraint optimization problems (COP) based on the philosophy of lexicographical goal programming. A two-phase methodology for solving COP using a multi-objective strategy is used. In the first phase, the objective function is completely disregarded and the entire search effort is directed towards finding a single feasible solution. In the second phase, the problem is treated as a bi-objective optimization problem, turning the constraint optimization into a two-objective optimization. The two resulting objectives are the original objective function and the constraint violation degree. In the first phase a methodology based on progressive hardening of soft constraints is proposed in order to find feasible solutions. The performance of the proposed methodology was tested on 11 well-known benchmark functions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Incluye Bibliografía

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Darunavir is a protease inhibitor used in the treatment of HIV infection. It is a pillar of the drug cocktail for patients diagnosed with the virus. Quality control in the pharmaceutical industry, to verify the content of active substance and study the physicochemical characteristics of the drug, is essential to ensure final product quality. Until now, standardized methods for the analysis of darunavir have not been available in official compendia. This justifies new research, to develop and validate analytical methods, as well as physicochemical and pharmaceutical analysis for this drug, both as a raw material and a finished product. Thus, in this study, (a) the average weight of darunavir tablets and (b) the melting point of the pure drug were determined, and the following analytical techniques were performed: (c) thin-layer chromatography, (d) ultraviolet spectroscopy, (e) infrared spectroscopy and (f) high performance liquid chromatography. By developing the above techniques, it is possible to make a qualitative assessment of the quality of darunavir tablets.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Contiene un desglose de los programas de estudio del curso de posgrado en población para 1987, incluyendo bibliografía recomendada para cada uno de ellos.