996 resultados para Puccini, Dario-Correspondència.
Resumo:
This study discusses the use of information technologies for knowledge management in networks of franchises in the Rio Grande do Norte/Brazil, whose management and operation are complex activities, characterized by the geographic spread of their network unities, creating barriers to communication and information sharing between franchisors, franchisees and final customers. In view of this, the following hypotheses were formulated: the knowledge management can be a positive alternative for improving communication between units; and information technology can eliminate many problems related mainly to capture and share knowledge. In general, it aims to investigate, in qualitative and quantitative aspects, how information technology can support knowledge management in networks of franchises. Specifically purposes to register the existence of managerial practices related to knowledge management in enterprises at the franchising sector; to verify whether they have the technological resources with the potential to facilitate the sharing of information; to identify what are the technologies of information and communication used in the organizational environment; and suggest measures that will facilitate the process of organizational learning, using information technology and communication as tools. It concludes that knowledge management becomes a positive alternative, especially in strengthening of bonds of communication and sharing of knowledge between the franchises. In this regard, information technology must provide all the services of the corporation to facilitate communication between franchisor and franchisee, through a single and integrated system. However, they still show unsuitable for more sophisticated technology platforms
Resumo:
The study examines the process of Knowledge Management and Technological Innovation in Small and Micro Enterprises (SME) in Rio Grande do Norte, Brazil, and proposes actions that can contribute to regional development and competitiveness of SME. Presents as technological innovation can help to make the SME entrepreneurial activities with innovative and competitive. Defines the phases and activities of the construction of knowledge in small organizations. Examines the process of Innovation, Research and Development (R & D) in SME. Identifies the use of knowledge management and technological innovation in management practices and social interaction to influence the competitiveness of SME. Covers the communities of practice as a diffuser of knowledge and learning. To obtain the data were used questionnaires with closed questions with multiple choice, direct observations and interviews with companies. The questionnaires and interviews covered the topics of Innovation, Knowledge Management and Competitive Intelligence on SME. The sample consisted of a total of 13 Small and Micro Enterprises Award winning MPE Brazil Competitiveness, sponsored by SEBRAE in the State of Rio Grande do Norte. The assessment questionnaires dealing with the Knowledge Management (KM Diagnostics - Model Bukowitz and Williams, 2002) and the process of Technological Innovation (Adaptation of ANPEI - National Association for Research, Development and Engineering of Innovative Companies). With the analysis, we concluded that the SME perceive knowledge management, but not formalized management practices so as to facilitate the dissemination of information. Soon, these companies need additional supports to direct them to the innovative activities that generate added value and competitiveness in the market
Resumo:
A presente dissertação representa uma contribuição na resolução dos problemas que se apresentam no setor das indústrias de cerâmica vermelha, apresentamos um modelo, baseado na estratégia do QFD (Desdobramento da Função Qualidade), na qual associa os requisitos dos consumidores na elaboração dos projetos do produto e dos processos de produção. A qualidade do produto é avaliada tanto no aspecto interno(especificações técnicas) quanto no aspecto externo (qualidades exigidas pelos clientes). A pesquisa mostra, além da realidade que vive o setor das indústrias de cerâmica, a importância e os atributos da qualidade definidos pelos consumidores relativo aos tijolos cerâmicos de vedação. O trabalho também mostra os resultados da aplicação do modelo numa das empresas do setor, através de desdobramentos da qualidade exigida, se estabelece a qualidade planejada, mostra ainda a posição da empresa em relação aos concorrentes em função do desempenho do produto. Procura-se ainda, através de sugestões de melhorias, atacar os problemas das falhas na qual geram o desperdício
Resumo:
This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorithm associated with the component optimizer Vocabulary Building. The resulting hybrid meta-heuristic was implemented in the programming language C + + and computational experiments generated good results in relation to meta-heuristic applied in isolation, proving the efficiency of the proposed method.
Resumo:
This paper presents metaheuristic strategies based on the framework of evolutionary algorithms (Genetic and Memetic) with the addition of Technical Vocabulary Building for solving the Problem of Optimizing the Use of Multiple Mobile Units Recovery of Oil (MRO units). Because it is an NP-hard problem, a mathematical model is formulated for the problem, allowing the construction of test instances that are used to validate the evolutionary metaheuristics developed
Resumo:
The objective in the facility location problem with limited distances is to minimize the sum of distance functions from the facility to the customers, but with a limit on each distance, after which the corresponding function becomes constant. The problem has applications in situations where the service provided by the facility is insensitive after a given threshold distance (eg. fire station location). In this work, we propose a global optimization algorithm for the case in which there are lower and upper limits on the numbers of customers that can be served
Resumo:
This work aims to "build" rostering urban bus crews to minimize the cost of overtime. For this purpose a mathematical model was developed based on case study in an urban transport company in the metropolitan region of Natal. This problem is usually known in the literature as the Crew Scheduling Problem (CSP) and classified as NP-hard. The mathematical programming takes into account constraints such as: completion of all trips, daily and maximum allowable range of home and / or food. We used the Xpress-MP software to implement and validate the proposed model. For the tested instances the application of the model allowed a reduction in overtime from 38% to 84%
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The Combinatorial Optimization is a basic area to companies who look for competitive advantages in the diverse productive sectors and the Assimetric Travelling Salesman Problem, which one classifies as one of the most important problems of this area, for being a problem of the NP-hard class and for possessing diverse practical applications, has increased interest of researchers in the development of metaheuristics each more efficient to assist in its resolution, as it is the case of Memetic Algorithms, which is a evolutionary algorithms that it is used of the genetic operation in combination with a local search procedure. This work explores the technique of Viral Infection in one Memetic Algorithms where the infection substitutes the mutation operator for obtaining a fast evolution or extinguishing of species (KANOH et al, 1996) providing a form of acceleration and improvement of the solution . For this it developed four variants of Viral Infection applied in the Memetic Algorithms for resolution of the Assimetric Travelling Salesman Problem where the agent and the virus pass for a symbiosis process which favored the attainment of a hybrid evolutionary algorithms and computational viable
Resumo:
Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don t guarantee the determination of the global optimum. Beyond the inherent difficulties related to the complexity that characterizes the optimization problems, the metaheuristics still face the dilemma of xploration/exploitation, which consists of choosing between a greedy search and a wider exploration of the solution space. A way to guide such algorithms during the searching of better solutions is supplying them with more knowledge of the problem through the use of a intelligent agent, able to recognize promising regions and also identify when they should diversify the direction of the search. This way, this work proposes the use of Reinforcement Learning technique - Q-learning Algorithm - as exploration/exploitation strategy for the metaheuristics GRASP (Greedy Randomized Adaptive Search Procedure) and Genetic Algorithm. The GRASP metaheuristic uses Q-learning instead of the traditional greedy-random algorithm in the construction phase. This replacement has the purpose of improving the quality of the initial solutions that are used in the local search phase of the GRASP, and also provides for the metaheuristic an adaptive memory mechanism that allows the reuse of good previous decisions and also avoids the repetition of bad decisions. In the Genetic Algorithm, the Q-learning algorithm was used to generate an initial population of high fitness, and after a determined number of generations, where the rate of diversity of the population is less than a certain limit L, it also was applied to supply one of the parents to be used in the genetic crossover operator. Another significant change in the hybrid genetic algorithm is the proposal of a mutually interactive cooperation process between the genetic operators and the Q-learning algorithm. In this interactive/cooperative process, the Q-learning algorithm receives an additional update in the matrix of Q-values based on the current best solution of the Genetic Algorithm. The computational experiments presented in this thesis compares the results obtained with the implementation of traditional versions of GRASP metaheuristic and Genetic Algorithm, with those obtained using the proposed hybrid methods. Both algorithms had been applied successfully to the symmetrical Traveling Salesman Problem, which was modeled as a Markov decision process
Resumo:
Este trabalho propõe um ambiente computacional aplicado ao ensino de sistemas de controle, denominado de ModSym. O software implementa uma interface gráfica para a modelagem de sistemas físicos lineares e mostra, passo a passo, o processamento necessário à obtenção de modelos matemáticos para esses sistemas. Um sistema físico pode ser representado, no software, de três formas diferentes. O sistema pode ser representado por um diagrama gráfico a partir de elementos dos domínios elétrico, mecânico translacional, mecânico rotacional e hidráulico. Pode também ser representado a partir de grafos de ligação ou de diagramas de fluxo de sinal. Uma vez representado o sistema, o ModSym possibilita o cálculo de funções de transferência do sistema na forma simbólica, utilizando a regra de Mason. O software calcula também funções de transferência na forma numérica e funções de sensibilidade paramétrica. O trabalho propõe ainda um algoritmo para obter o diagrama de fluxo de sinal de um sistema físico baseado no seu grafo de ligação. Este algoritmo e a metodologia de análise de sistemas conhecida por Network Method permitiram a utilização da regra de Mason no cálculo de funções de transferência dos sistemas modelados no software
Resumo:
In this work, the Markov chain will be the tool used in the modeling and analysis of convergence of the genetic algorithm, both the standard version as for the other versions that allows the genetic algorithm. In addition, we intend to compare the performance of the standard version with the fuzzy version, believing that this version gives the genetic algorithm a great ability to find a global optimum, own the global optimization algorithms. The choice of this algorithm is due to the fact that it has become, over the past thirty yares, one of the more importan tool used to find a solution of de optimization problem. This choice is due to its effectiveness in finding a good quality solution to the problem, considering that the knowledge of a good quality solution becomes acceptable given that there may not be another algorithm able to get the optimal solution for many of these problems. However, this algorithm can be set, taking into account, that it is not only dependent on how the problem is represented as but also some of the operators are defined, to the standard version of this, when the parameters are kept fixed, to their versions with variables parameters. Therefore to achieve good performance with the aforementioned algorithm is necessary that it has an adequate criterion in the choice of its parameters, especially the rate of mutation and crossover rate or even the size of the population. It is important to remember that those implementations in which parameters are kept fixed throughout the execution, the modeling algorithm by Markov chain results in a homogeneous chain and when it allows the variation of parameters during the execution, the Markov chain that models becomes be non - homogeneous. Therefore, in an attempt to improve the algorithm performance, few studies have tried to make the setting of the parameters through strategies that capture the intrinsic characteristics of the problem. These characteristics are extracted from the present state of execution, in order to identify and preserve a pattern related to a solution of good quality and at the same time that standard discarding of low quality. Strategies for feature extraction can either use precise techniques as fuzzy techniques, in the latter case being made through a fuzzy controller. A Markov chain is used for modeling and convergence analysis of the algorithm, both in its standard version as for the other. In order to evaluate the performance of a non-homogeneous algorithm tests will be applied to compare the standard fuzzy algorithm with the genetic algorithm, and the rate of change adjusted by a fuzzy controller. To do so, pick up optimization problems whose number of solutions varies exponentially with the number of variables
Resumo:
This work presents an wideband ring VCO for cognitive radio five-port based receivers. A three-stage differential topology using transmission gate was adopted in order to maintain wide and linear tuning range and a low phase-noise. Monte-Carlo analysis were performed for phase-shift response of individual stages, which is an important figure of merit in five-port works. It was observed a fairly linear correlation between control voltage and oscillation frequency in the range between 200 MHz and 1800 MHz. The VCO was preliminarily designed for IBM 130nm CMOS technology
Resumo:
Pesquisas visando a redução de perdas de grãos e sementes durante o armazenamento têm ocupado destaque em vários países. Dentro deste contexto, a avaliação da eficácia de um índice de qualidade de boa aplicabilidade, com metodologia simples e de resposta imediata visando tomadas rápidas de decisão é de suma importância. O presente trabalho, conduzido no Laboratório de Processamento de Produtos Agrícolas UNESP, Botucatu/SP teve como objetivos: (a) estabelecer correspondência entre o nível de ácidos graxos livres e as classes de vigor em sementes; (b) estabelecer correspondência entre o nível de ácidos graxos livres e a classificação comercial por tipos, em grãos de arroz (Oryza sativa L.). A correspondência entre o nível de ácidos livres e as classes de vigor em sementes foi avaliada utilizando-se sementes envelhecidas artificialmente, obtendo-se assim níveis diferenciados de vigor. A correspondência entre o nível de ácidos graxos livres e a classificação por tipos, em grãos de arroz, foi realizada utilizando-se amostras de arroz com as porcentagens máximas de grãos defeituosos permitidos pela legislação vigente. Utilizou-se a análise de variância de um delineamento inteiramente ao acaso e, para comparação entre médias, aplicou-se o teste de Tukey ao nível de 5% de probabilidade. Por meio dos resultados obtidos, observou-se que o teste de acidez graxa mostrou-se exeqüível para avaliar o vigor de sementes de arroz. Na pesquisa que buscava uma correspondência entre os valores de acidez graxa e classificação comercial, os dados revelaram a tendência do nível de ácidos graxos livres acompanhar a classificação comercial por tipos.
Resumo:
In Simultaneous Localization and Mapping (SLAM - Simultaneous Localization and Mapping), a robot placed in an unknown location in any environment must be able to create a perspective of this environment (a map) and is situated in the same simultaneously, using only information captured by the robot s sensors and control signals known. Recently, driven by the advance of computing power, work in this area have proposed to use video camera as a sensor and it came so Visual SLAM. This has several approaches and the vast majority of them work basically extracting features of the environment, calculating the necessary correspondence and through these estimate the required parameters. This work presented a monocular visual SLAM system that uses direct image registration to calculate the image reprojection error and optimization methods that minimize this error and thus obtain the parameters for the robot pose and map of the environment directly from the pixels of the images. Thus the steps of extracting and matching features are not needed, enabling our system works well in environments where traditional approaches have difficulty. Moreover, when addressing the problem of SLAM as proposed in this work we avoid a very common problem in traditional approaches, known as error propagation. Worrying about the high computational cost of this approach have been tested several types of optimization methods in order to find a good balance between good estimates and processing time. The results presented in this work show the success of this system in different environments