887 resultados para nonlinear optimization problems


Relevância:

80.00% 80.00%

Publicador:

Resumo:

Past studies use deterministic models to evaluate optimal cache configuration or to explore its design space. However, with the increasing number of components present on a chip multiprocessor (CMP), deterministic approaches do not scale well. Hence, we apply probabilistic genetic algorithms (GA) to determine a near-optimal cache configuration for a sixteen tiled CMP. We propose and implement a faster trace based approach to estimate fitness of a chromosome. It shows up-to 218x simulation speedup over the cycle-accurate architectural simulation. Our methodology can be applied to solve other cache optimization problems such as design space exploration of cache and its partitioning among applications/ virtual machines.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

By applying the lower bound theorem of limit analysis in conjunction with finite elements and nonlinear optimization, the bearing capacity factor N has been computed for a rough strip footing by incorporating pseudostatic horizontal seismic body forces. As compared with different existing approaches, the present analysis is more rigorous, because it does not require an assumption of either the failure mechanism or the variation of the ratio of the shear to the normal stress along the footing-soil interface. The magnitude of N decreases considerably with an increase in the horizontal seismic acceleration coefficient (kh). With an increase in kh, a continuous spread in the extent of the plastic zone toward the direction of the horizontal seismic body force is noted. The results obtained from this paper have been found to compare well with the solutions reported in the literature. (C) 2013 American Society of Civil Engineers.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

By incorporating the variation of peak soil friction angle (phi) with mean principal stress (sigma(m)), the effect of pipe diameter (D) on the vertical uplift resistance of a long horizontal pipeline embedded in sand has been investigated. The analysis has been performed by using the lower bound finite-element limit analysis in combination with nonlinear optimization. Three well-defined phi versus sigma(m) curves reported from literature for different sands have been used. It is observed that for a given embedment ratio, with an increase in pipe diameter, the magnitude of the uplift factor (F-gamma) reduces quite significantly, which indicates the importance of considering scale effects while designing buried pipe lines. The scale effects have been found to become even more substantial with an increase in the embedment ratio. The analysis compares well with various theoretical results reported from literature. On the other hand, as compared to available centrifuge test results, the present analysis has been found to provide quite a higher magnitude of the uplift resistance when the theoretical prediction is based on peak soil friction angle. However, if the theoretical analysis is performed by using the friction angle that accounts for the progressive shear failure, the difference between the theoretical and centrifuge test results decreases quite significantly.(C) 2013 American Society of Civil Engineers.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The vertical uplift resistance of long pipes buried in sands and subjected to pseudostatic seismic forces has been computed by using the lower-bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization. The soil mass is assumed to follow the Mohr-Coulomb failure criterion and an associated flow rule. The failure load is expressed in the form of a nondimensional uplift factor F-gamma. The variation of F-gamma is plotted as a function of the embedment ratio of the pipe, horizontal seismic acceleration coefficient (k(h)), and soil friction angle (phi). The magnitude of F-gamma is found to decrease continuously with an increase in the horizontal seismic acceleration coefficient. The reduction in the uplift resistance becomes quite significant, especially for greater values of embedment ratios and lower values of friction angle. The predicted uplift resistance was found to compare well with the existing results reported from the literature. (C) 2014 American Society of Civil Engineers.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The uplift resistance of pipelines buried in sands, in the presence of inclined groundwater flow, considering both upward and downward flow directions, has been determined by using the lower bound finite elements limit analysis in conjunction with nonlinear optimization. A correction factor (f (gamma) ), which needs to be multiplied with the uplift factor (F (gamma) ), has been computed to account for groundwater seepage. The variation of f (gamma) has been obtained as a function of i(gamma (w) /gamma (sub) ) for different horizontal inclinations (theta) of groundwater flow; where i = absolute magnitude of hydraulic gradient along the direction of flow, gamma (w) is the unit weight of water and gamma (sub) is the submerged unit weight of soil mass. For a given magnitude of i, there exists a certain critical value of theta for which the magnitude of f (gamma) becomes the minimum. An example has also been presented to illustrate the application of the results obtained for designing pipelines in presence of groundwater seepage.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Understanding the growth behavior of microorganisms using modeling and optimization techniques is an active area of research in the fields of biochemical engineering and systems biology. In this paper, we propose a general modeling framework, based on Monad model, to model the growth of microorganisms. Utilizing the general framework, we formulate an optimal control problem with the objective of maximizing a long-term cellular goal and solve it analytically under various constraints for the growth of microorganisms in a two substrate batch environment. We investigate the relation between long term and short term cellular goals and show that the objective of maximizing cellular concentration at a fixed final time is equivalent to maximization of instantaneous growth rate. We then establish the mathematical connection between the generalized framework and optimal and cybernetic modeling frameworks and derive generalized governing dynamic equations for optimal and cybernetic models. We finally illustrate the influence of various constraints in the cybernetic modeling framework on the optimal growth behavior of microorganisms by solving several dynamic optimization problems using genetic algorithms. (C) 2014 Published by Elsevier Inc.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

By using the lower-bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization, bearing-capacity factors, N-c and N-gamma q, with an inclusion of pseudostatic horizontal seismic body forces, have been determined for a shallow embedded horizontal strip footing placed on sloping ground surface. The variation of N-c and N-gamma q with changes in slope angle (beta) for different values of seismic acceleration coefficient (k(h)) has been obtained. The analysis reveals that irrespective of ground inclination and the embedment depth of the footing, the factors N-c and N-gamma q decrease quite considerably with an increase in k(h). As compared with N-c, the factor N-gamma q is affected more extensively with changes in k(h) and beta. Unlike most of the results reported in literature for the seismic case, the present computational results take into account the shear resistance of soil mass above the footing level. An increase in the depth of the embedment leads to an increase in the magnitudes of both N-c and N-gamma q. (C) 2014 American Society of Civil Engineers.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The inversion of canopy reflectance models is widely used for the retrieval of vegetation properties from remote sensing. This study evaluates the retrieval of soybean biophysical variables of leaf area index, leaf chlorophyll content, canopy chlorophyll content, and equivalent leaf water thickness from proximal reflectance data integrated broadbands corresponding to moderate resolution imaging spectroradiometer, thematic mapper, and linear imaging self scanning sensors through inversion of the canopy radiative transfer model, PROSAIL. Three different inversion approaches namely the look-up table, genetic algorithm, and artificial neural network were used and performances were evaluated. Application of the genetic algorithm for crop parameter retrieval is a new attempt among the variety of optimization problems in remote sensing which have been successfully demonstrated in the present study. Its performance was as good as that of the look-up table approach and the artificial neural network was a poor performer. The general order of estimation accuracy for para-meters irrespective of inversion approaches was leaf area index > canopy chlorophyll content > leaf chlorophyll content > equivalent leaf water thickness. Performance of inversion was comparable for broadband reflectances of all three sensors in the optical region with insignificant differences in estimation accuracy among them.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The ultimate bearing capacity of a circular footing, placed over rock mass, is evaluated by using the lower bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization. The generalized Hoek-Brown (HB) failure criterion, but by keeping a constant value of the exponent, alpha = 0.5, was used. The failure criterion was smoothened both in the meridian and pi planes. The nonlinear optimization was carried out by employing an interior point method based on the logarithmic barrier function. The results for the obtained bearing capacity were presented in a non-dimensional form for different values of GSI, m(i), sigma(ci)/(gamma b) and q/sigma(ci). Failure patterns were also examined for a few cases. For validating the results, computations were also performed for a strip footing as well. The results obtained from the analysis compare well with the data reported in literature. Since the equilibrium conditions are precisely satisfied only at the centroids of the elements, not everywhere in the domain, the obtained lower bound solution will be approximate not true. (C) 2015 Elsevier Ltd. All rights reserved.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper presents a lower bound limit analysis approach for solving an axisymmetric stability problem by using the Drucker-Prager (D-P) yield cone in conjunction with finite elements and nonlinear optimization. In principal stress space, the tip of the yield cone has been smoothened by applying the hyperbolic approximation. The nonlinear optimization has been performed by employing an interior point method based on the logarithmic barrier function. A new proposal has also been given to simulate the D-P yield cone with the Mohr-Coulomb hexagonal yield pyramid. For the sake of illustration, bearing capacity factors N-c, N-q and N-gamma have been computed, as a function of phi, both for smooth and rough circular foundations. The results obtained from the analysis compare quite well with the solutions reported from literature.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The vertical uplift resistance of interfering pipelines buried in sands has been computed using the lower-bound limit analysis in conjunction with finite elements and nonlinear optimization. The soil mass is assumed to follow the Mohr-Coulomb failure criterion and an associated flow rule. It is specified that all the pipes fail simultaneously at the same magnitude of the failure load. For different clear spacing (S) between the pipes, the magnitude of the efficiency factor (xi(gamma)) is determined. Because of pipes' interference, with a reduction in the spacing between the pipelines, the magnitude of xi(gamma) is found to decrease continuously. The results were found to compare quite well with the available data from literature for horizontal strip anchors. (C) 2015 American Society of Civil Engineers.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind. (C) 2016 Elsevier B.V. All rights reserved.