4 resultados para MINIMIZING EARLINESS
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
The clustering problem consists in finding patterns in a data set in order to divide it into clusters with high within-cluster similarity. This paper presents the study of a problem, here called MMD problem, which aims at finding a clustering with a predefined number of clusters that minimizes the largest within-cluster distance (diameter) among all clusters. There are two main objectives in this paper: to propose heuristics for the MMD and to evaluate the suitability of the best proposed heuristic results according to the real classification of some data sets. Regarding the first objective, the results obtained in the experiments indicate a good performance of the best proposed heuristic that outperformed the Complete Linkage algorithm (the most used method from the literature for this problem). Nevertheless, regarding the suitability of the results according to the real classification of the data sets, the proposed heuristic achieved better quality results than C-Means algorithm, but worse than Complete Linkage.
Resumo:
Phosphorus is an essential element for plants and animals, playing a fundamental role in the production of biochemical energy. Despite its relevance, phosphorus is not commonly determined by instrumental neutron activation analysis (INAA), because (32)P does not emit gamma-rays in its decay. There are alternative methods for the determination of phosphorus by INAA, such as the use of beta counting or the measurement of bremsstrahlung originated from the high energy beta particle from (32)P. Here the determination of phosphorus in plant materials by measuring the bremsstrahlung production was further investigated, to optimize an analytical protocol for minimizing interferences and overcoming the poor specificity. Eight certified reference materials of plant matrices with phosphorus ranging between 171 and 5,180 mg kg(-1) were irradiated at a thermal neutron flux of 9.5 x 10(12) cm(-2) s(-1) and measured with a HPGe detector at decay times varying from 7 to 60 days. Phosphorus solutions added to a certified reference material at three levels were used for calibration. Counts accumulated in the baseline at four different regions of the gamma-ray spectra were tested for the determination of phosphorus, with better results for the 100 keV region. The Compton scattering contribution in the selected range was discounted using an experimental peak-to-Compton factor and the net areas of all peaks in the spectra with energies higher than 218 keV, i.e. Compton edge above 100 keV. Amongst the interferences investigated, the production of (32)P from sulfur, and the contribution of Compton scattering should be considered for producing good results.
Resumo:
This article describes a real-world production planning and scheduling problem occurring at an integrated pulp and paper mill (P&P) which manufactures paper for cardboard out of produced pulp. During the cooking of wood chips in the digester, two by-products are produced: the pulp itself (virgin fibers) and the waste stream known as black liquor. The former is then mixed with recycled fibers and processed in a paper machine. Here, due to significant sequence-dependent setups in paper type changeovers, sizing and sequencing of lots have to be made simultaneously in order to efficiently use capacity. The latter is converted into electrical energy using a set of evaporators, recovery boilers and counter-pressure turbines. The planning challenge is then to synchronize the material flow as it moves through the pulp and paper mills, and energy plant, maximizing customer demand (as backlogging is allowed), and minimizing operation costs. Due to the intensive capital feature of P&P, the output of the digester must be maximized. As the production bottleneck is not fixed, to tackle this problem we propose a new model that integrates the critical production units associated to the pulp and paper mills, and energy plant for the first time. Simple stochastic mixed integer programming based local search heuristics are developed to obtain good feasible solutions for the problem. The benefits of integrating the three stages are discussed. The proposed approaches are tested on real-world data. Our work may help P&P companies to increase their competitiveness and reactiveness in dealing with demand pattern oscillations. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
The rapid industrial development and disorganized population growth in huge cities bring about various urban problems due to intense use of physical space on and below the surface. Subsurface problems in metropolitan areas are caused by subway line construction, which often follows the routes of utility networks, such as electric and telephone cables, water and gas pipes, storm sewers, etc. Usually, the main problems are related to damage or destruction of preexisting utilities, often putting human lives at risk. With the purpose of minimizing risks. GPR-profiling with 200 MHz antennae was done at two sites, both located in downtown Sao Paulo, Brazil. The objectives of this work were to map utilities or existing infrastructure in the subsurface in order to orient the construction of the Line 4 (yellow) subway tunnel in Sao Paulo. GPR profiles can detect water pipes, utility networks in the subsurface, and concrete foundation columns or pilings in subsoil up to 2 m depth. In addition. the GPR profiles also provided details of the target shapes in the subsurface. GPR interpretations combined with lithological information from boreholes and trenches opened in the study areas were extremely important in mapping of the correct spatial distribution of buried utilities at these two sites in Sao Paulo. This information improves and updates maps of utility placement, serves as a basis for planning of the geotechnical excavation of the Line 4 (yellow) subway tunnel in Sao Paulo, helps minimize problems related to destruction of preexisting utilities in the subsoil, and avoids risk of dangerous accidents. (C) 2012 Elsevier B.V. All rights reserved.