780 resultados para Bound Algorithm
Resumo:
The Tiete River and its tributary Pinheiros River receive a highly complex organic and inorganic pollutants load from sanitary sewage and industrial sources, as well as agricultural and agroindustrial activities. The aim of the present study was to evaluate the embryotoxic and teratogenic effects of sediments from selected locations in the Tiete River Basin by means of the sediment contact embryo toxicity assay with Danio rerio, in order to provide a comprehensive and realistic insight into the bioavailable hazard potential of these sediment samples. Lethal and sub-lethal effects were recorded, and high embryo toxicity could be found in the samples not only in the vicinity of the megacity Sao Paulo (Billings reservoir and Pinheiros River samples), but also downstream (in the reservoirs Barra Bonita, Promissao and Tres Irmaos). Results confirm that most toxicity is due to the discharges of the metropolitan area of Sao Paulo. However, they also indicate additional sources of pollutants along the river course, probably from industrial, agricultural and agroindustrial residues, which contribute to the degradation of each area. The sediment contact fish embryo test showed to be powerful tool to detect embryo toxicity in sediments, not only by being a sensitive method, but also for taking into account bioavailability. This test provides an ecological highly realistic and relevant exposure scenario, and should therefore be added in ecotoxicological sediment quality assessments. (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
A numerical algorithm for fully dynamical lubrication problems based on the Elrod-Adams formulation of the Reynolds equation with mass-conserving boundary conditions is described. A simple but effective relaxation scheme is used to update the solution maintaining the complementarity conditions on the variables that represent the pressure and fluid fraction. The equations of motion are discretized in time using Newmark`s scheme, and the dynamical variables are updated within the same relaxation process just mentioned. The good behavior of the proposed algorithm is illustrated in two examples: an oscillatory squeeze flow (for which the exact solution is available) and a dynamically loaded journal bearing. This article is accompanied by the ready-to-compile source code with the implementation of the proposed algorithm. [DOI: 10.1115/1.3142903]
Resumo:
The amount of textual information digitally stored is growing every day. However, our capability of processing and analyzing that information is not growing at the same pace. To overcome this limitation, it is important to develop semiautomatic processes to extract relevant knowledge from textual information, such as the text mining process. One of the main and most expensive stages of the text mining process is the text pre-processing stage, where the unstructured text should be transformed to structured format such as an attribute-value table. The stemming process, i.e. linguistics normalization, is usually used to find the attributes of this table. However, the stemming process is strongly dependent on the language in which the original textual information is given. Furthermore, for most languages, the stemming algorithms proposed in the literature are computationally expensive. In this work, several improvements of the well know Porter stemming algorithm for the Portuguese language, which explore the characteristics of this language, are proposed. Experimental results show that the proposed algorithm executes in far less time without affecting the quality of the generated stems.
Resumo:
Conventional procedures employed in the modeling of viscoelastic properties of polymer rely on the determination of the polymer`s discrete relaxation spectrum from experimentally obtained data. In the past decades, several analytical regression techniques have been proposed to determine an explicit equation which describes the measured spectra. With a diverse approach, the procedure herein introduced constitutes a simulation-based computational optimization technique based on non-deterministic search method arisen from the field of evolutionary computation. Instead of comparing numerical results, this purpose of this paper is to highlight some Subtle differences between both strategies and focus on what properties of the exploited technique emerge as new possibilities for the field, In oder to illustrate this, essayed cases show how the employed technique can outperform conventional approaches in terms of fitting quality. Moreover, in some instances, it produces equivalent results With much fewer fitting parameters, which is convenient for computational simulation applications. I-lie problem formulation and the rationale of the highlighted method are herein discussed and constitute the main intended contribution. (C) 2009 Wiley Periodicals, Inc. J Appl Polym Sci 113: 122-135, 2009
Resumo:
In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.
Resumo:
Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.
Resumo:
At very high energies we expect that the hadronic cross sections satisfy the Froissart bound, which is a well-established property of the strong interactions. In this energy regime we also expect the formation of the Color Glass Condensate, characterized by gluon saturation and a typical momentum scale: the saturation scale Q(s). In this paper we show that if a saturation window exists between the nonperturbative and perturbative regimes of Quantum Chromodynamics (QCD), the total cross sections satisfy the Froissart bound. Furthermore, we show that our approach allows us to described the high energy experimental data on pp/p (p) over bar total cross sections.
Resumo:
Results of systematic tunable-frequency ESR studies of the spin dynamics in NiCl2-4SC(NH2)(2) (known as DTN), a gapped S = 1 chain system with easy-plane anisotropy dominating over the exchange coupling (large-D chain), are presented. We have obtained direct evidence for two-magnon bound states, predicted for S = 1 large-D spin chains in the fully spin-polarized (FSP) phase. The frequency-field dependence of the corresponding excitations was calculated using the set of parameters obtained earlier [S.A. Zvyagin, et al., Phys. Rev. Lett. 98 (2007) 047205]. Very good agreement between the calculations and the experiment was obtained. It is argued that the observation of transitions from the ground to two-magnon bound states might indicate a more complex picture of magnetic interactions in DTN, involving a finite in-plane anisotropy. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
We show that halo effects enhance fusion cross sections of weakly bound systems, comparing with the situation when there is no-halo. We introduce dimensionless fusion functions and energy variable quantity to investigate systematical trends in the fusion cross sections of weakly bound nuclei at near-barrier energies. We observe very clearly complete fusion suppression at energies above the barrier due to dynamic effects of the breakup on fusion. We explain this suppression in terms of the repulsive polarization potential produced by the breakup.
Resumo:
An experimental overview of reactions induced by the stable, but weakly-bound nuclei (6)Li, (7)Li and (9)Be, and by the exotic, halo nuclei (6)He, (8)B, (11)Be and (17)F On medium-mass targets, such as (58)Ni, (59)Co or (64)Zn, is presented. Existing data on elastic scattering, total reaction cross sections, fusion, breakup and transfer channels are discussed in the framework of a CDCC approach taking into account the breakup degree of freedom.
Reaction mechanisms for weakly-bound, stable nuclei and unstable, halo nuclei on medium-mass targets
Resumo:
An experimental overview of reactions induced by the stable, but weakly-bound nuclei (6)Li, (7)Li and (9)Be, and by the exotic, halo nuclei (6)He, (8)B, (11)Be and (17)F on medium-mass targets, such as (58)Ni, (59)Co or (64)Zn, is presented. Existing data on elastic scattering, total reaction cross sections, fusion processes, breakup and transfer channels are discussed in the framework of a CDCC approach taking into account the breakup degree of freedom.
Resumo:
We use a new technique to investigate the systematic behavior of near barrier complete fusion, total fusion and total reaction cross sections of weakly bound systems. A dimensionless fusion excitation function is used as a benchmark to which renormalized fusion data are compared and dynamic breakup effects can be disentangled from static effects. The same reduction procedure is used to study the effect of the direct reaction mechanisms on the total reaction cross section.