A fundamental research question in regional economic development, is why some regions are able to diversify into new products and industries, while others continue to face challenges in diversification? This doctorate research explores the different pathways to diversification. It follows the three-stage modular structure of DBA for Cranfield School of Management. This thesis consists of a systematic literature review, a single qualitative case study on UAE, and a research synthesis of published cases on Singapore, Norway and UAE. The linking document provides a summary of the three projects and consolidates findings and contributions into a path creation model that provides new understanding on the pathways to regional diversifications. This research integrates existing theoretical foundations of evolutionary economic geography, institutional economic geography, path dependence, industry relatedness, economic complexity, and path creation into a unified conceptual path creation model. It generates propositions, builds a framework and develops a matrix for path creation that integrate context, actors, factors, mechanisms and outcomes shaping regional diversification. It finds that in the context of path dependence and existing conditions of a region, economic actors undertake strategic measures to influence the institutional capabilities to accumulate knowledge and trigger indigenous creation, anchoring, branching, and clustering diversification mechanisms to create complex varieties of related and unrelated diversification outcomes. The institutional collaboration capabilities are found to be instrumental in accumulating knowledge and determining the relatedness and complexity of diversification outcomes. This research further provides a set of integrated platform strategies to guide policy-makers on setting up the pathways to regional diversification.

A análise de caminhos de transferência de energia (TPA na sigla em inglês para Transfer Path Analysis) corresponde a um grupo de métodos numérico/experimental para análise e solução de problemas vibro-acústicos de sistemas lineares invariantes no tempo, sendo seu principal campo de aplicação a indústria automotiva. A TPA é uma técnica que identifica as principais fontes de vibração e ruído, e os caminhos estruturais e acústicos pelos quais são transmitidas para determinados locais de interesse. Conhecendo as fontes de ruído e vibração e os caminhos de propagação é possível propor modificações eficientes em minimizar o ruído/vibração nas regiões de interesse, ou atribuir características desejáveis para tais componentes, envolvendo técnicas de controle passivo e ativo. Este trabalho apresenta um estudo numérico e experimental das técnicas de TPA, utilizando métodos diretos e inversos de determinação de forças operacionais. Estes estudos foram realizados em um mockup de um veículo, com o objetivo de determinar o caminho de maior contribuição para o ruído no interior do protótipo, e a partir deste resultado, propor um sistema de controle ativo para minimizar este ruído interno. / The Transfer Path Analysis (TPA) is a group of numerical/experimental tools for the analysis and troubleshooting of noise and vibration problems in linear time invariant vibroacoustic systems, being the automotive sector its major user. TPA consists of a numerical/experimental analysis that allows the identification of the main noise and vibration sources and the structural/acoustic transfer paths to the Target points. Based on the sources and paths, it is possible to propose modifications that efficiently minimize noise and vibration at the target positions. By means of active control it is possible to modify noise and vibration in order to change, rather than minimize noise and vibration, achieving certain design targets. This work presents a numerical and experimental study of TPA techniques, using direct and inverse operational loads determination methods. These studies were performed on a vehicle mockup, in order to determine the path of greatest contribution to the noise inside the prototype, and from this result, propose an active control system to minimize this internal noise.

Made available in DSpace on 2016-04-04T18:31:34Z (GMT). No. of bitstreams: 1 Carlos Alberto Tercariol Bergonso.pdf: 948199 bytes, checksum: 9baee66f05960fc08d06f925a9ea859a (MD5) Previous issue date: 2012-12-07 / The present dissertation proposes a 802.11 network evaluation sequence which can be adopted, independently of the equipment used at the network. The log-distance path loss model is used for the environment characterization (by the model ? parameter) where the network is evaluated. The specific objectives of each evaluation stage are presented and contextualized. The full proposal has initial steps related to the information determination which will be used as references of equipment location and data, and of network performance. Those reference data will be later compared to the handled data obtained from measurements related to the physical and MAC (Medium Access Control) layer performance and behavior, as well as to the transport layer. By the end, one stage to consolidate the measured data is necessary in order to determine a single final result, weigh up according to the specific objectives of the network and/or equipment evaluation. However, the work focus is at the equipment data obtaining stage and at the lower layers (physical and MAC) performance/behavior determination, so that evaluation methods are developed for those two stages. It is demonstrated that the effective transmission physical layer data rates vary much more than what is expected due to the interpretation of the data provided by equipment manufactors. And that better performance could be obtained from complex networks, which made use of multiple access points, installed at unfavorable propagation environments, depending upon the network project. / A presente disserta??o prop?e uma sequ?ncia de avalia??o para redes 802.11 que pode ser adotada, independentemente de quais s?o os equipamentos utilizados na rede. O modelo de log-distance path loss ? utilizado para caracteriza??o do ambiente (pelo par?metro ? do modelo) em que a rede ? avaliada. Os objetivos espec?ficos de cada uma das etapas de avalia??o s?o apresentadas e contextualizadas. A proposta, em sua totalidade, apresenta etapas iniciais relacionadas ? determina??o de informa??es que ser?o usadas como refer?ncias de localidade e desempenho de rede, e de dados dos equipamentos. Esses dados de refer?ncia ser?o posteriormente comparados com os dados coletados e tratados de medi??es realizadas em rela??o ao desempenho e comportamento das camadas f?sicas e MAC (Medium Access Control) e da camada de transporte. Por fim, uma etapa de consolida??o dos resultados das medi??es ? necess?ria para se obter um resultado final ?nico, composto de forma a ponderar de acordo com o(s) objetivo(s) espec?fico(s) de avalia??o da rede e/ou equipamento. O foco dessa disserta??o, contudo, est? na obten??o de dados dos equipamentos, de desempenho e comportamento das camadas inferiores (f?sica e MAC), de forma que para essas etapas, m?todos de avalia??o s?o desenvolvidos. ? demonstrado que as taxas de transmiss?o de dados efetivamente praticadas na camada f?sica variam muito mais que o esperado em fun??o da interpreta??o dos dados fornecidos pelos fabricantes de equipamentos. E que, dependendo do projeto da rede, pode-se obter melhores desempenhos em ambientes de propaga??o desfavor?vel que utilizam m?ltiplos pontos de acesso.

Submitted by Maicon Juliano Schmidt (maicons) on 2015-04-06T13:55:27Z No. of bitstreams: 1 Talita Raquel de Oliveira.pdf: 620682 bytes, checksum: 0741bd806408a24616d66577c7e8a535 (MD5) / Made available in DSpace on 2015-04-06T13:55:27Z (GMT). No. of bitstreams: 1 Talita Raquel de Oliveira.pdf: 620682 bytes, checksum: 0741bd806408a24616d66577c7e8a535 (MD5) Previous issue date: 2013-01-31 / Nenhuma / Esta pesquisa teve como objetivo identificar e analisar, com base na Dependência de Trajetória e Criação de Trajetória, os eventos críticos ocorridos e as perspectivas futuras que influenciam nas escolhas estratégicas na organização não governamental Parceiros Voluntários. Como principais referências teóricas relativas à Dependência de Trajetória foram resgatados trabalhos de Barney (1991; 1995) e outros autores da VBR, como Teece; Pisano e Shuen (1997), Becker e Ruas (2005), Mahoney (2000) e Balestro et al. (2004), David (2000), Licha (2004), Pierson (2004), Sydow; Schreyogg e Koch (2009). E para a Criação de Trajetória os principais foram Arthur (1989) e Schienstock (2011), Garud e Karnoe (2001), Pham (2007), Henfridsson; Yoo e Svahn (2009) e Garud; Kumaraswamy e Karnoe (2010). A pesquisa ocorreu por meio de um estudo de caso, realizou entrevistas semiestruturadas com os principais atores da organização e utilizou a Análise de Conteúdo por meio do software Nvivo10. Observou-se que as escolhas estratégicas realmente são influenciadas pela trajetória da organização, porém há uma variação de intensidade em cada projeto e parceria analisada, pois não ficaram necessariamente restritas ao que já tinha sido realizado no passado. Neste contexto, as estratégias emergentes ilustram muito bem esta questão, pois a organização recebe muitas solicitações referentes à Responsabilidade Social e todas são avaliadas, de forma que a inovação não fica prejudicada. Observou-se que a organização cria suas próprias metodologias, projetos e parcerias e introduz novos elementos na estrutura existente, confirmando a existência da complementaridade entre os constructos de Dependência e Criação de Trajetória através de eventos críticos como o Projeto Tribos nas Trilhas da Cidadania, Projeto Transparência, a área de "Formação", o auxílio às OSCs na área de gestão e legislação. E entre suas perspectivas futuras estão a expansão de atuação para outros estados brasileiros e países, o atendimento a Micro e Pequenas Empresas e a abertura para estudantes pesquisarem a organização. / The purpose of this study was, based on Path Dependence and Path Creation, to identify and analyze the critical events that have occurred and future prospects that influence the strategic choices for the non-governmental organization, Parceiros Voluntários (Voluntary Partners). As main theoretical references regarding Path Dependence, works by Barney (1991; 1995) and other authors of the VBR, such as Teece; Pisano and Shuen (1997), Becker and Ruas (2005), Mahoney (2000) and Balestro et al. (2004), David (2000), Licha (2004), Pierson (2004), Sydow; Schreyogg and Koch (2009) were used. The main references for Path Creation were . Arthur (1989) e Schienstock (2011), Garud and Karnoe (2001), Pham (2007), Henfridsson; Yoo and Svahn (2009) and Garud; Kumaraswamy and Karnoe (2010). The work was done using a case study, semistructured interview with the principal actors of the organization, and Analysis of Content which was done using Nvivo10 software. It was noted that the strategic choices were really influenced by the trajectory of the organization, but there was a variation of intensity in each project and partnership analyzed, since they were not necessarily restricted to what had already been done in the past. In this context, the emerging strategies clearly illustrate this issue, since the organization receives many requests concerning Social Responsibility, and they are all assessed so that innovation is not hindered. It was observed that the organization creates its own methodologies, projects and partnerships, and introduces new elements into the existing structure, confirming that there is complementarity between the constructs of Dependence and Path Creation through critical events such as Project Tribes on the Trails of Citizenship, Project Transparency, the field of “Training”, the help to CSOs (Civil Society Organizations) in the field of management and legislation. And among its future perspectives are extending action to other Brazilian states and other countries, working with Micro and Small Businesses, and an opening for students to do research on the organization.

A aplicação de técnicas baseadas em amostragem em algoritmos que envolvem o planejamento de trajetórias de robôs tem se tornado cada vez mais difundida. Deste grupo, um dos algoritmos mais utilizados é chamado Rapidly-exploring Random Tree (RRT), que se baseia na amostragem incremental para calcular de forma eficiente os planos de trajetória do robô evitando colisões com obstáculos. Vários esforços tem sido realizados a fim de reduzir o custo computacional do algoritmo RRT, visando aplicações que necessitem de respostas mais rápidas do algoritmo, como, por exemplo, em ambientes dinâmicos. Um dos dilemas relacionados ao RRT está na etapa de geração de primitivas de movimento. Se várias primitivas são geradas, permitindo o robô executar vários movimentos básicos diferentes, um grande custo computacional é gasto. Por outro lado, quando poucas primitivas são geradas e, consequentemente, poucos movimentos básicos são permitidos, o robô pode não ser capaz de encontrar uma solução para o problema, mesmo que esta exista. Motivados por este problema, um método de geração de primitivas de movimento foi proposto. Tal método é comparado com os métodos tradicional e aleatório de geração de primitivas, considerando não apenas o custo computacional de cada um, mas também a qualidade da solução obtida. O método proposto é aplicado ao algoritmo RRT, que depois é aplicado em um caso de estudo em um ambiente dinâmico. No estudo de caso, o algoritmo RRT otimizado é avaliado em termos de seus custos computacionais durante planejamentos e replanejamento de trajetória. As simulações são realizadas em dois simuladores: um desenvolvido em linguagem Python e outro em Matlab. / The application of sample-based techniques in path-planning algorithms has become year-by-year more widespread. In this group, one of the most widely used algorithms is the Rapidly-exploring Random Tree (RRT), which is based on an incremental sampling of configurations to efficiently compute the robot\'s path while avoiding obstacles. Many efforts have been made to reduce RRT computational costs, targeting, in particular, applications in which quick responses are required, e.g., in dynamic environments. One of the dilemmas posed by the RRT arises from its motion primitives generation. If many primitives are generated to enable the robot to perform a broad range of basic movements, a signicant computational cost is required. On the other hand, when only a few primitives are generated, thus, enabling a limited number of basic movements, the robot may be unable to find a solution to the problem, even if one exists. To address this quandary, an optimized method for primitive generation is proposed. This method is compared with the traditional and random primitive generation methods, considering not only computational cost, but also the quality of local and global solutions that may be attained. The optimized method is applied to the RRT algorithm, which is then used in a case study in dynamic environments. In the study, the modied RRT is evaluated in terms of the computational costs of its planning and replanning. The simulations were developed to access the effectiveness and efficiency of the proposed algorithm.

A aplicação de técnicas baseadas em amostragem em algoritmos que envolvem o planejamento de trajetórias de robôs tem se tornado cada vez mais difundida. Deste grupo, um dos algoritmos mais utilizados é chamado Rapidly-exploring Random Tree (RRT), que se baseia na amostragem incremental para calcular de forma eficiente os planos de trajetória do robô evitando colisões com obstáculos. Vários esforços tem sido realizados a fim de reduzir o custo computacional do algoritmo RRT, visando aplicações que necessitem de respostas mais rápidas do algoritmo, como, por exemplo, em ambientes dinâmicos. Um dos dilemas relacionados ao RRT está na etapa de geração de primitivas de movimento. Se várias primitivas são geradas, permitindo o robô executar vários movimentos básicos diferentes, um grande custo computacional é gasto. Por outro lado, quando poucas primitivas são geradas e, consequentemente, poucos movimentos básicos são permitidos, o robô pode não ser capaz de encontrar uma solução para o problema, mesmo que esta exista. Motivados por este problema, um método de geração de primitivas de movimento foi proposto. Tal método é comparado com os métodos tradicional e aleatório de geração de primitivas, considerando não apenas o custo computacional de cada um, mas também a qualidade da solução obtida. O método proposto é aplicado ao algoritmo RRT, que depois é aplicado em um caso de estudo em um ambiente dinâmico. No estudo de caso, o algoritmo RRT otimizado é avaliado em termos de seus custos computacionais durante planejamentos e replanejamento de trajetória. As simulações são realizadas em dois simuladores: um desenvolvido em linguagem Python e outro em Matlab. / The application of sample-based techniques in path-planning algorithms has become year-by-year more widespread. In this group, one of the most widely used algorithms is the Rapidly-exploring Random Tree (RRT), which is based on an incremental sampling of configurations to efficiently compute the robot\'s path while avoiding obstacles. Many efforts have been made to reduce RRT computational costs, targeting, in particular, applications in which quick responses are required, e.g., in dynamic environments. One of the dilemmas posed by the RRT arises from its motion primitives generation. If many primitives are generated to enable the robot to perform a broad range of basic movements, a signicant computational cost is required. On the other hand, when only a few primitives are generated, thus, enabling a limited number of basic movements, the robot may be unable to find a solution to the problem, even if one exists. To address this quandary, an optimized method for primitive generation is proposed. This method is compared with the traditional and random primitive generation methods, considering not only computational cost, but also the quality of local and global solutions that may be attained. The optimized method is applied to the RRT algorithm, which is then used in a case study in dynamic environments. In the study, the modied RRT is evaluated in terms of the computational costs of its planning and replanning. The simulations were developed to access the effectiveness and efficiency of the proposed algorithm.

O problema de dimensionamento de lotes, objeto desse estudo, considera um ambiente composto por múltiplas plantas independentes, múltiplos itens e múltiplos períodos. O ambiente de produção tem capacidade limitada e as plantas podem produzir os mesmos itens. Cada planta tem uma demanda própria e é permitida a transferência de lotes entre as plantas, o que envolve um certo custo. Este problema tem como caso particular o de dimensionamento de lotes com máquinas paralelas. O objetivo desta dissertação é propor uma heurística baseada na meta-heurística GRASP (Greedy Randomized Adaptive Search Procedures). Além disso, uma estratégia path relinking foi incorporada ao GRASP como uma fase de melhoria do algoritmo. Para verificar a eficiência da heurística proposta, os seus resultados são comparados aos da literatura tanto no caso de máquinas paralelas quanto no de múltiplas plantas. Como resultado, o problema de múltiplas plantas obteve melhores resultados quando comparado aos da heurística da literatura. Com relação ao problema de máquinas paralelas, a heurística proposta se mostrou competitiva / The lot sizing problem, which is the aim of this study, considers an environment consisting of multiple independent plants, multiple items and multiple periods. The production environment has limited capacity and the plants can produce the same items. Each plant has its own demand and the lot transfers between the plants are permitted, which involves a certain cost. This problem has as a particular case the parallel machines lot sizing problem. The objective of this dissertation is to propose a heuristic based on the GRASP (Greedy Randomized Adaptive Search Procedures). Furthermore, a path relinking phase is embedded in the GRASP to obtain better performance. To verify the efficiency of the proposed heuristic, its results were compared with the literature as for the multi-plant as for parallel machines problem. Computational tests showed that the proposed heuristic performed better than other literature heuristic concerning the multiplant problem. Concerning the parallel machines, the heuristic is competitive

No description available.

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

As the mobile electronic products development are more and more popular such as mobile phone, digital camera, PDA¡Ketc. Each of company releases variable kind of mobile products, and every portable machine has plenty of functions. A low power consumption design is a significant issue which academics and engineers concern. It would be a major progress if the approach which can drop off the power consumption successfully. The mobile electronic products have more application programs than before and the size of LCD increases continuously, so that the power consumption becomes large. Therefore, expanding the life of battery would be a significant issue. Besides, the process technology has improved day by day, and it would influence the supply voltage be declined. It represents the power management would influence the power consumption of circuit directly. Comparing to drop down the entire IC power consumption and not to influence the performance of IC, the thesis employs the algorithm that searches the Critical Path and embeds the Level Converter Logic into digital circuit. It can offer the proper supply voltage to circuits which do not want to bigger supply voltage for reduce power consumption. However, the process variation (Inter-Die or Intra-Die) may transform the original Critical Path, the Critical Path which searches through the static timing analysis would not correct. To conquer this problem, the thesis provides the statistical approach to analysis timing. It would search Path Sensitivity which is exactly equal to the probability that a path is critical. Finally, the logic gate which is designed by us would replace the UMC 90nm standard cell through Cell-Based.