89 resultados para conjugated gradient descent algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Tropical forests have been subject to intense hunting of medium and large frugivores that are important in dispersing large-seeded species. It has been hypothesized that in areas with extinction or low abundance of medium and large-bodied animals the density of small rodents may increase. Therefore, this increment in the density of small rodents may compensate for the absence or low abundance of medium and large frugivores on seed removal and seed dispersal. Here, we fill up this gap in the literature by determining if seed removal, seed dispersal, and seed predation by small rodents (spiny rats, Trinomys inheringi and squirrels, Sciurus ingrami) are maintained in defaunated areas. We accessed seed removal, seed dispersal, seed predation, and seedling recruitment of an endemic Atlantic rainforest palm, Astrocaryum aculeatissimum, in a gradient of abundance of agoutis. We found that seed removal, scatter hoarding, and seed predation increase with the abundance of agoutis. In contrast, the proportion of dispersed but non-cached seeds decreased with the abundance of agoutis. We did not find any effect of the abundance of agoutis on seed dispersal distance, but we did find a positive trend on the density of seedlings. We concluded that small rodents do not compensate the low abundance of agoutis on seed removal, scatter hoarding, and seed predation of this palm tree. Moreover, areas in which agoutis are already extinct did not present any seed removal or scatter hoarding, not even by small rodents. This study emphasizes both the importance of agoutis in dispersing seeds of A. aculeatissimum and the collapse in seed dispersal of this palm in areas where agoutis are already extinct.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1. Litter decomposition recycles nutrients and causes large fluxes of carbon dioxide into the atmosphere. It is typically assumed that climate, litter quality and decomposer communities determine litter decay rates, yet few comparative studies have examined their relative contributions in tropical forests. 2. We used a short-term litterbag experiment to quantify the effects of litter quality, placement and mesofaunal exclusion on decomposition in 23 tropical forests in 14 countries. Annual precipitation varied among sites (760-5797 mm). At each site, two standard substrates (Raphia farinifera and Laurus nobilis) were decomposed in fine- and coarse-mesh litterbags both above and below ground for approximately 1 year. 3. Decomposition was rapid, with >95% mass loss within a year at most sites. Litter quality, placement and mesofaunal exclusion all independently affected decomposition, but the magnitude depended upon site. Both the average decomposition rate at each site and the ratio of above- to below-ground decay increased linearly with annual precipitation, explaining 60-65% of among-site variation. Excluding mesofauna had the largest impact on decomposition, reducing decomposition rates by half on average, but the magnitude of decrease was largely independent of climate. This suggests that the decomposer community might play an important role in explaining patterns of decomposition among sites. Which litter type decomposed fastest varied by site, but was not related to climate. 4. Synthesis. A key goal of ecology is to identify general patterns across ecological communities, as well as relevant site-specific details to understand local dynamics. Our pan-tropical study shows that certain aspects of decomposition, including average decomposition rates and the ratio of above- to below-ground decomposition are highly correlated with a simple climatic index: mean annual precipitation. However, we found no relationship between precipitation and effects of mesofaunal exclusion or litter type, suggesting that site-specific details may also be required to understand how these factors affect decomposition at local scales.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The increase in biodiversity from high to low latitudes is a widely recognized biogeographical pattern. According to the latitudinal gradient hypothesis (LGH), this pattern was shaped by differential effects of Late Quaternary climatic changes across a latitudinal gradient. Here, we evaluate the effects of climatic changes across a tropical latitudinal gradient and its implications to diversification of an Atlantic Forest (AF) endemic passerine. We studied the intraspecific diversification and historical demography of Sclerurus scansor, based on mitochondrial (ND2, ND3 and cytb) and nuclear (FIB7) gene sequences. Phylogenetic analyses recovered three well-supported clades associated with distinct latitudinal zones. Coalescent-based methods were applied to estimate divergence times and changes in effective population sizes. Estimates of divergence times indicate that intraspecific diversification took place during Middle-Late Pleistocene. Distinct demographic scenarios were identified, with the southern lineage exhibiting a clear signature of demographic expansion, while the central one remained more stable. The northern lineage, contrasting with LGH predictions, exhibited a clear sign of a recent bottleneck. Our results suggest that different AF regions reacted distinctly, even in opposite ways, under the same climatic period, producing simultaneously favourable scenarios for isolation and contact among populations.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we consider a dissipative damped wave equation with nonautonomous damping of the form u(tt) + beta(t)u(t) - Delta u + f(u) (1) in a bounded smooth domain Omega subset of R(n) with Dirichlet boundary conditions, where f is a dissipative smooth nonlinearity and the damping beta : R -> (0, infinity) is a suitable function. We prove, if (1) has finitely many equilibria, that all global bounded solutions of (1) are backwards and forwards asymptotic to equilibria. Thus, we give a class of examples of nonautonomous evolution processes for which the structure of the pullback attractors is well understood. That complements the results of [Carvalho & Langa, 2009] on characterization of attractors, where it was shown that a small nonautonomous perturbation of an autonomous gradient-like evolution process is also gradient-like. Note that the evolution process associated to (1) is not a small nonautonomous perturbation of any autonomous gradient-like evolution processes. Moreover, we are also able to prove that the pullback attractor for (1) is also a forwards attractor and that the rate of attraction is exponential.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this article we introduce the concept of a gradient-like nonlinear semigroup as an intermediate concept between a gradient nonlinear semigroup (those possessing a Lyapunov function, see [J.K. Hale, Asymptotic Behavior of Dissipative Systems, Math. Surveys Monogr., vol. 25, Amer. Math. Soc., 1989]) and a nonlinear semigroup possessing a gradient-like attractor. We prove that a perturbation of a gradient-like nonlinear semigroup remains a gradient-like nonlinear semigroup. Moreover, for non-autonomous dynamical systems we introduce the concept of a gradient-like evolution process and prove that a non-autonomous perturbation of a gradient-like nonlinear semigroup is a gradient-like evolution process. For gradient-like nonlinear semigroups and evolution processes, we prove continuity, characterization and (pullback and forwards) exponential attraction of their attractors under perturbation extending the results of [A.N. Carvalho, J.A. Langa, J.C. Robinson, A. Suarez, Characterization of non-autonomous attractors of a perturbed gradient system, J. Differential Equations 236 (2007) 570-603] on characterization and of [A.V. Babin, M.I. Vishik, Attractors in Evolutionary Equations, Stud. Math. Appl.. vol. 25, North-Holland, Amsterdam, 1992] on exponential attraction. (C) 2009 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we prove that gradient-like semigroups (in the sense of Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) are gradient semigroups (possess a Lyapunov function). This is primarily done to provide conditions under which gradient semigroups, in a general metric space, are stable under perturbation exploiting the known fact (see Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) that gradient-like semigroups are stable under perturbation. The results presented here were motivated by the work carried out in Conley (1978 Isolated Invariant Sets and the Morse Index (CBMS Regional Conference Series in Mathematics vol 38) (RI: American Mathematical Society Providence)) for groups in compact metric spaces (see also Rybakowski (1987 The Homotopy Index and Partial Differential Equations (Universitext) (Berlin: Springer)) for the Morse decomposition of an invariant set for a semigroup on a compact metric space).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new approach for solving the optimal power flow (OPF) problem is established by combining the reduced gradient method and the augmented Lagrangian method with barriers and exploring specific characteristics of the relations between the variables of the OPF problem. Computer simulations on IEEE 14-bus and IEEE 30-bus test systems illustrate the method. (c) 2007 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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]

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigated the seasonal patterns of water vapor and sensible heat flux along a tropical biome gradient from forest to savanna. We analyzed data from a network of flux towers in Brazil that were operated within the Large-Scale Biosphere-Atmosphere Experiment in Amazonia (LBA). These tower sites included tropical humid and semideciduous forest, transitional forest, floodplain (with physiognomies of cerrado), and cerrado sensu stricto. The mean annual sensible heat flux at all sites ranged from 20 to 38 Wm(-2), and was generally reduced in the wet season and increased in the late dry season, coincident with seasonal variations of net radiation and soil moisture. The sites were easily divisible into two functional groups based on the seasonality of evaporation: tropical forest and savanna. At sites with an annual precipitation above 1900 mm and a dry season length less than 4 months (Manaus, Santarem and Rondonia), evaporation rates increased in the dry season, coincident with increased radiation. Evaporation rates were as high as 4.0 mm d(-1) in these evergreen or semidecidous forests. In contrast, ecosystems with precipitation less than 1700 mm and a longer dry season (Mato Grosso, Tocantins and Sao Paulo) showed clear evidence of reduced evaporation in the dry season. Evaporation rates were as low as 2.5 mm d(-1) in the transitional forests and 1 mm d(-1) in the cerrado. The controls on evapotranspiration seasonality changed along the biome gradient, with evaporative demand (especially net radiation) playing a more important role in the wetter forests, and soil moisture playing a more important role in the drier savannah sites.