890 resultados para Branch and Bound algorithm
Resumo:
This article presents a quantitative and objective approach to cat ganglion cell characterization and classification. The combination of several biologically relevant features such as diameter, eccentricity, fractal dimension, influence histogram, influence area, convex hull area, and convex hull diameter are derived from geometrical transforms and then processed by three different clustering methods (Ward's hierarchical scheme, K-means and genetic algorithm), whose results are then combined by a voting strategy. These experiments indicate the superiority of some features and also suggest some possible biological implications.
Resumo:
The ramification and the distribution of the phrenic nerves right and left had been studied in 30 muscles diaphragms of unknown breed adult domestic cats, 7 males and 23 females, and were fixed in 10% buffered formalin solution. After fixation and dissection, it was observed that the phrenic nerves ramified for the respective carnous parts of the muscle diaphragm, pars lumbalis, costalis and sternalis, and had finished in higher frequency in dorsolateral trunk and ventral branch (63.33%). We observed the following arrangements: dorsal, ventral and lateral branches (25.0%); dorsal branch and ventrolateral trunk (6.66%); dorsolateral and ventrolateral trunks (3.33%); dorsolateral trunk, lateral and ventral branches (1.66%). The phrenic nerves had distributed symmetrically in 11 samples (36.66%), only showing the termination in dorsolateral trunk and ventral branch. The dorsal branches supplied pars lumbalis (73.33% to right and 56.66% to the left) and pars costalis (13.33% to right and 10.0% to the left). The right dorsal branch supplied the crus mediale dexter of the right pillar (100.0%) and the left dorsal branch supplied the crus mediale sinister of the right pillar and the left pillar (100.0%). The lateral branches supply pars lumbalis (23.33% to right and 33.33% to the left), pars costalis (96.66% to right and 100.0% to the left) and pars sternalis (3.33% only to the right). The ventral branches supplied the ventral region of pars costalis (46.66 % to right and 43.33% to the left) and pars sternalis (96.66% to right and 100.0% to the left). Four female animals (13.33%) had shown fibers crossing proceeding from the left ventral branch for right antimere had been that in one of these samples (3.33%) occurred connection between the left ventral branch and the right.
Resumo:
In the spatial electric load forecasting, the future land use determination is one of the most important tasks, and one of the most difficult, because of the stochastic nature of the city growth. This paper proposes a fast and efficient algorithm to find out the future land use for the vacant land in the utility service area, using ideas from knowledge extraction and evolutionary algorithms. The methodology was implemented into a full simulation software for spatial electric load forecasting, showing a high rate of success when the results are compared to information gathered from specialists. The importance of this methodology lies in the reduced set of data needed to perform the task and the simplicity for implementation, which is a great plus for most of the electric utilities without specialized tools for this planning activity. © 2008 IEEE.
Resumo:
A target tracking algorithm able to identify the position and to pursuit moving targets in video digital sequences is proposed in this paper. The proposed approach aims to track moving targets inside the vision field of a digital camera. The position and trajectory of the target are identified by using a neural network presenting competitive learning technique. The winning neuron is trained to approximate to the target and, then, pursuit it. A digital camera provides a sequence of images and the algorithm process those frames in real time tracking the moving target. The algorithm is performed both with black and white and multi-colored images to simulate real world situations. Results show the effectiveness of the proposed algorithm, since the neurons tracked the moving targets even if there is no pre-processing image analysis. Single and multiple moving targets are followed in real time.
Resumo:
In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.
Resumo:
In the present paper a study is made in order to find an algorithm that can calculate coplanar orbital maneuvers for an artificial satellite. The idea is to find a method that is fast enough to be combined with onboard orbit determination using GPS data collected from a receiver that is located in the satellite. After a search in the literature, three algorithms are selected to be tested. Preliminary studies show that one of them (the so called Minimum Delta-V Lambert Problem) has several advantages over the two others, both in terms of accuracy and time required for processing. So, this algorithm is implemented and tested numerically combined with the orbit determination procedure. Some adjustments are performed in this algorithm in the present paper to allow its use in real-time onboard applications. Considering the whole maneuver, first of all a simplified and compact algorithm is used to estimate in real-time and onboard the artificial satellite orbit using the GPS measurements. By using the estimated orbit as the initial one and the information of the final desired orbit (from the specification of the mission) as the final one, a coplanar bi-impulsive maneuver is calculated. This maneuver searches for the minimum fuel consumption. Two kinds of maneuvers are performed, one varying only the semi major axis and the other varying the semi major axis and the eccentricity of the orbit, simultaneously. The possibilities of restrictions in the locations to apply the impulses are included, as well as the possibility to control the relation between the processing time and the solution accuracy. Those are the two main reasons to recommend this method for use in the proposed application.
Resumo:
Pós-graduação em Ciências Cartográficas - FCT
Resumo:
Pós-graduação em Ciências Sociais - FFC
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Pós-graduação em Agronomia (Energia na Agricultura) - FCA
Resumo:
Includes bibliography
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)