932 resultados para Markov chains. Convergence. Evolutionary Strategy. Large Deviations


Relevância:

40.00% 40.00%

Publicador:

Resumo:

A pesquisa aqui apresentada é uma análise detalhada de estratégias de compra associados à Responsabilidade Social Corporativa das empresas multinacionais e visa identificar os elementos que influenciam na escolha de fornecedores locais e os benefícios que tais estratégias podem trazer a estas empresas. A globalização e a pressão por melhores produtos e menores custos levam empresas a repensarem suas decisões de sourcing. Selecionar competências, recursos e ainda escolher onde comprar ou terceirizar, tornou-se uma decisão estratégica fundamental, e muitas multinacionais optam por usar fornecedores locais como um diferencial e uma plataforma de criação de valor para a empresa e para a sociedade. Enquanto esta abordagem reforça a posição de mercado e garante matérias-primas de qualidade a preços justos, o relacionamento com estes fornecedores traz desenvolvimento econômico e social para as comunidades subdesenvolvidas. Estudos sobre fornecedores locais geralmente focam em vantagens competitivas para as empresas, e na adaptação de cadeias de valor para atender estratégias globais de negócios, no entanto, a difusão do conhecimento sobre a criação de valor compartilhado é ainda limitada. Assim, o objetivo desta pesquisa foi identificar os aspectos de estratégia corporativa, gestão de fornecedores e colaboração que influenciam na criação de valor compartilhado. Dois estudos de casos foram expostos em uma pesquisa qualitativa exploratória com o propósito de avaliar iniciativas que tiveram como base o relacionamento com os fornecedores locais. A análise foi separada em três etapas com o objetivo de identificar (1) influências nas decisões de seleção de fornecedores, (2) aspectos que levam ao sucesso da gestão de fornecedores, e (3) o valor gerado como resultado destas decisões. Conceitos teóricos da CSR, SCM, colaboração e criação de valor compartilhado foram utilizados para apoiar os resultados e as principais conclusões. O resultado da pesquisa revelou que a idéia de co-criação de valor faz parte da cultura da empresa e pode ser considerado um dos motivos pelos quais multinacionais decidem usar fornecedores locais. Contudo, mesmo integrados na estratégia, não garantem criação efetiva de valor compartilhado e diversos componentes em uma estratégia de compras que representam responsabilidade social corporativa devem ser ajustados para motivar mudanças significativas. Ainda, vale lembrar que os elementos de colaboração, tais como a transparência e independência são vitais para melhorar o compromisso entre a multinacional e os negócios locais e criar valor compartilhado.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The problems of combinatory optimization have involved a large number of researchers in search of approximative solutions for them, since it is generally accepted that they are unsolvable in polynomial time. Initially, these solutions were focused on heuristics. Currently, metaheuristics are used more for this task, especially those based on evolutionary algorithms. The two main contributions of this work are: the creation of what is called an -Operon- heuristic, for the construction of the information chains necessary for the implementation of transgenetic (evolutionary) algorithms, mainly using statistical methodology - the Cluster Analysis and the Principal Component Analysis; and the utilization of statistical analyses that are adequate for the evaluation of the performance of the algorithms that are developed to solve these problems. The aim of the Operon is to construct good quality dynamic information chains to promote an -intelligent- search in the space of solutions. The Traveling Salesman Problem (TSP) is intended for applications based on a transgenetic algorithmic known as ProtoG. A strategy is also proposed for the renovation of part of the chromosome population indicated by adopting a minimum limit in the coefficient of variation of the adequation function of the individuals, with calculations based on the population. Statistical methodology is used for the evaluation of the performance of four algorithms, as follows: the proposed ProtoG, two memetic algorithms and a Simulated Annealing algorithm. Three performance analyses of these algorithms are proposed. The first is accomplished through the Logistic Regression, based on the probability of finding an optimal solution for a TSP instance by the algorithm being tested. The second is accomplished through Survival Analysis, based on a probability of the time observed for its execution until an optimal solution is achieved. The third is accomplished by means of a non-parametric Analysis of Variance, considering the Percent Error of the Solution (PES) obtained by the percentage in which the solution found exceeds the best solution available in the literature. Six experiments have been conducted applied to sixty-one instances of Euclidean TSP with sizes of up to 1,655 cities. The first two experiments deal with the adjustments of four parameters used in the ProtoG algorithm in an attempt to improve its performance. The last four have been undertaken to evaluate the performance of the ProtoG in comparison to the three algorithms adopted. For these sixty-one instances, it has been concluded on the grounds of statistical tests that there is evidence that the ProtoG performs better than these three algorithms in fifty instances. In addition, for the thirty-six instances considered in the last three trials in which the performance of the algorithms was evaluated through PES, it was observed that the PES average obtained with the ProtoG was less than 1% in almost half of these instances, having reached the greatest average for one instance of 1,173 cities, with an PES average equal to 3.52%. Therefore, the ProtoG can be considered a competitive algorithm for solving the TSP, since it is not rare in the literature find PESs averages greater than 10% to be reported for instances of this size.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

When the food supply flnishes, or when the larvae of blowflies complete their development and migrate prior to the total removal of the larval substrate, they disperse to find adequate places for pupation, a process known as post-feeding larval dispersal. Based on experimental data of the Initial and final configuration of the dispersion, the reproduction of such spatio-temporal behavior is achieved here by means of the evolutionary search for cellular automata with a distinct transition rule associated with each cell, also known as a nonuniform cellular automata, and with two states per cell in the lattice. Two-dimensional regular lattices and multivalued states will be considered and a practical question is the necessity of discovering a proper set of transition rules. Given that the number of rules is related to the number of cells in the lattice, the search space is very large and an evolution strategy is then considered to optimize the parameters of the transition rules, with two transition rules per cell. As the parameters to be optimized admit a physical interpretation, the obtained computational model can be analyzed to raise some hypothetical explanation of the observed spatiotemporal behavior. © 2006 IEEE.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The research on multiple classifiers systems includes the creation of an ensemble of classifiers and the proper combination of the decisions. In order to combine the decisions given by classifiers, methods related to fixed rules and decision templates are often used. Therefore, the influence and relationship between classifier decisions are often not considered in the combination schemes. In this paper we propose a framework to combine classifiers using a decision graph under a random field model and a game strategy approach to obtain the final decision. The results of combining Optimum-Path Forest (OPF) classifiers using the proposed model are reported, obtaining good performance in experiments using simulated and real data sets. The results encourage the combination of OPF ensembles and the framework to design multiple classifier systems. © 2011 Springer-Verlag.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Includes bibliography.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Objective. Evaluate feasibility and safety of a novel technique for uterine morcellation in patients scheduled for laparoscopic treatment of gynecologic malignances. Background. The laparoscopic management of uterine malignancies is progressively gaining importance and popularity over laparotomy. Nevertheless, minimal invasive surgery is of limited use when patients have enlarged uterus or narrow vagina. In these cases, conventional uterus morcellation could be a solution but should not be recommended due to risks of tumor dissemination. Methods. Prospective pilot study of women with endometrial cancer in which uterus removal was a realistic concern due to both organ size and proportionality. Brief technique description: after completion of total laparoscopic hysterectomy and bilateral anexectomy, a nylon with polyurethane Lapsac (R) is vaginally inserted into the abdomen; the specimen is placed inside the pouch that will be closed and rotated 180 degrees toward the vaginal vault and, posteriorly, pushed into the vaginal canal; in the transvaginal phase, the surgeon pulls the edges of the bag up to vaginal introitus and all vaginal walls will be covered; inside the pouch, the operator performs a uterus bisection-morcellation. Results. In our series of 8 cases, we achieved successful completion in all patients, without conversion to laparotomy. Average operative time, blood loss and length of hospitalization were favorable. One patient presented with a vesicovaginal fistula. Conclusion. The vaginal morcellation following oncologic principles is a feasible method that permits a rapid uterine extraction and may avoid a number of unnecessary laparotomies. Further studies are needed to confirm the oncological safety of the technique. (C) 2012 Elsevier Inc. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Network reconfiguration for service restoration (SR) in distribution systems is a complex optimization problem. For large-scale distribution systems, it is computationally hard to find adequate SR plans in real time since the problem is combinatorial and non-linear, involving several constraints and objectives. Two Multi-Objective Evolutionary Algorithms that use Node-Depth Encoding (NDE) have proved able to efficiently generate adequate SR plans for large distribution systems: (i) one of them is the hybridization of the Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) with NDE, named NSGA-N; (ii) the other is a Multi-Objective Evolutionary Algorithm based on subpopulation tables that uses NDE, named MEAN. Further challenges are faced now, i.e. the design of SR plans for larger systems as good as those for relatively smaller ones and for multiple faults as good as those for one fault (single fault). In order to tackle both challenges, this paper proposes a method that results from the combination of NSGA-N, MEAN and a new heuristic. Such a heuristic focuses on the application of NDE operators to alarming network zones according to technical constraints. The method generates similar quality SR plans in distribution systems of significantly different sizes (from 3860 to 30,880 buses). Moreover, the number of switching operations required to implement the SR plans generated by the proposed method increases in a moderate way with the number of faults.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

[EN] In this paper we show that a classic optical flow technique by Nagel and Enkelmann can be regarded as an early anisotropic diffusion method with a diffusion tensor. We introduce three improvements into the model formulation that avoid inconsistencies caused by centering the brightness term and the smoothness term in different images use a linear scale-space focusing strategy from coarse to fine scales for avoiding convergence to physically irrelevant local minima, and create an energy functional that is invariant under linear brightness changes.  Applying a gradient descent method to the resulting energy functional leads to a system of diffusion-reaction equations. We prove that this system has a unique solution under realistic assumptions on the initial data, and we present an efficient linear implicit numerical scheme in detail. Our method creates flow fields with 100% density over the entire image domain, it is robust under a large range of parameter variations, and it can recover displacement fields that are far beyond the typical one-pixel limits which are characteristic for many differential methods for determining optical flow. We show that it performs better than the classic optical flow methods with 100%  density that are evaluated by Barron et al. (1994). Our software is available from the Internet.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

One of the quickest plant movements ever known is made by the ´explosive´ style in Marantaceae in the service of secondary pollen presentation – herewith showing a striking apomorphy to the sister Cannaceae that might be of high evolutionary consequence. Though known already since the beginning of the 19th century the underlying mechanism of the movement has hitherto not been clarified. The present study reports about the biomechanics of the style-staminode complex and the hydraulic principles of the movement. For the first time it is shown by experiment that in Maranta noctiflora through longitudinal growth of the maturing style in the ´straitjacket´ of the hooded staminode both the hold of the style prior to its release and its tensioning for the movement are brought about. The longer the style grows in relation to the enclosing hooded staminode the more does its capacity for curling up for pollen transfer increase. Hereby I distinguish between the ´basic tension´ that a growing style builds up anyway, even when the hooded staminode is removed beforehand, and the ´induced tension´ which comes about only under the pressure of a ´too short´ hooded staminode and which enables the movement. The results of these investigations are discussed in view of previous interpretations ranging from possible biomechanical to electrophysiological mechanisms. To understand furthermore by which means the style gives way to the strong bending movement without suffering outwardly visible damage I examined its anatomical structure in several genera for its mechanical and hydraulic properties and for the determination of the entire curvature after release. The actual bending part contains tubulate cells whose walls are extraordinarily porous and large longitudinal intercellular spaces. SEM indicates the starting points of cell-wall loosening in primary walls and lysis of middle lamellae - probably through an intense pectinase activity in the maturing style. Fluorescence pictures of macerated and living style-tissue confirm cell-wall perforations that do apparently connect neighbouring cells, which leads to an extremely permeable parenchyma. The ´water-body´ can be shifted from central to dorsal cell layers to support the bending. The geometrical form of the curvature is determined by the vascular bundles. I conclude that the style in Marantaceae contains no ´antagonistic´ motile tissues as in Mimosa or Dionaea. Instead, through self-maceration it develops to a ´hydraulic tissue´ which carries out an irreversible movement through a sudden reshaping. To ascertain the evolutionary consequence of this apomorphic pollination mechanism the diversity and systematic value of hooded staminodes are examined. For this hooded staminodes of 24 genera are sorted according to a minimalistic selection of shape characters and eight morphological types are abstracted from the resulting groups. These types are mapped onto an already available maximally parsimonious tree comprising five major clades. An amazing correspondence is found between the morphological types and the clades; several sister-relationships are confirmed and in cases of uncertain position possible evolutionary pathways, such as convergence, dispersal or re-migration, are discussed, as well as the great evolutionary tendencies for the entire family in which – at least as regards the shape of hooded staminodes – there is obviously a tendency from complicated to strongly simplified forms. It suggests itself that such simplifying derivations may very likely have taken place as adaptations to pollinating animals about which at present too little is known. The value of morphological characters in relation to modern phylogenetic analysis is discussed and conditions for the selection of morphological characters valuable for a systematic grouping are proposed. Altogether, in view of the evolutionary success of Marantaceae compared with Cannaceae the movement mechanism of the style-staminode complex can safely be considered a key innovation within the order Zingiberales.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Computing the weighted geometric mean of large sparse matrices is an operation that tends to become rapidly intractable, when the size of the matrices involved grows. However, if we are not interested in the computation of the matrix function itself, but just in that of its product times a vector, the problem turns simpler and there is a chance to solve it even when the matrix mean would actually be impossible to compute. Our interest is motivated by the fact that this calculation has some practical applications, related to the preconditioning of some operators arising in domain decomposition of elliptic problems. In this thesis, we explore how such a computation can be efficiently performed. First, we exploit the properties of the weighted geometric mean and find several equivalent ways to express it through real powers of a matrix. Hence, we focus our attention on matrix powers and examine how well-known techniques can be adapted to the solution of the problem at hand. In particular, we consider two broad families of approaches for the computation of f(A) v, namely quadrature formulae and Krylov subspace methods, and generalize them to the pencil case f(A\B) v. Finally, we provide an extensive experimental evaluation of the proposed algorithms and also try to assess how convergence speed and execution time are influenced by some characteristics of the input matrices. Our results suggest that a few elements have some bearing on the performance and that, although there is no best choice in general, knowing the conditioning and the sparsity of the arguments beforehand can considerably help in choosing the best strategy to tackle the problem.