In recent years, interest in the area of custom computing machines (CCMs) has been on a steady increase. Much of the activity surrounding CCMs has centered around Field-Programmable Gate Array (FPGA) technology and rapid prototyping applications. While higher performance has been a concern in some applications, the solutions are limited by the relatively small FPGA bandwidth, density and throughput. This leads to area, speed, power, and application-specific constraints. In recent months, an integrated circuit known as the VT Colt has been developed to address some high performance digital signal processing (DSP) problems that conventional processors, CCMs, and ASICs cannot do under the space and power constraints. The Colt chip takes a data-flow approach to processing and is highly reconfigurable to suit the many computationally demanding tasks that new DSP applications present. A significant portion of the development of the Colt chip is architectural justification, functional verification, and configurability. This thesis explores verification of the Colt chip at various levels of development including mapping arithmetic computations and DSP algorithms that the Colt architecture was designed to solve. / Master of Science

Dans un contexte de personnalisation de masse, la configuration concourante du produit et de son processus d’obtention constituent un défi industriel important : de nombreuses options ou alternatives, de nombreux liens ou contraintes et un besoin d’optimisation des choix réalisés doivent être pris en compte. Ce problème est intitulé O-CPPC (Optimization of Concurrent Product and Process Configuration). Nous considérons ce problème comme un CSP (Constraints Satisfaction Problem) et l’optimisons avec des algorithmes évolutionnaires. Un état de l’art fait apparaître : i) que la plupart des travaux de recherche sont illustrés sur des exemples spécifiques à un cas industriel ou académique et peu représentatifs de la diversité existante ; ii) un besoin d’amélioration des performances d’optimisation afin de gagner en interactivité et faire face à des problèmes de taille plus conséquente. En réponse au premier point, ces travaux de thèse proposent les briques d’un modèle générique du problème O-CPPC. Ces briques permettent d’architecturer le produit et son processus d’obtention. Ce modèle générique est utilisé pour générer un benchmark réaliste pour évaluer les algorithmes d’optimisation. Ce benchmark est ensuite utilisé pour analyser la performance de l’approche évolutionnaire CFB-EA. L’une des forces de cette approche est de proposer rapidement un front de Pareto proche de l’optimum. Pour répondre au second point, une amélioration de cette méthode est proposée puis évaluée. L’idée est, à partir d’un premier front de Pareto approximatif déterminé très rapidement, de demander à l’utilisateur de choisir une zone d’intérêt et de restreindre la recherche de solutions uniquement sur cette zone. Cette amélioration entraine des gains de temps de calcul importants. / In a context of mass customization, the concurrent configuration of the product and its production process constitute an important industrial challenge: Numerous options or alternatives, numerous links or constraints and a need to optimize the choices made. This problem is called O-CPPC (Optimization of Concurrent Product and Process Configuration). We consider this problem as a CSP (Constraints Satisfaction Problem) and optimize it with evolutionary algorithms. A state of the art shows that: i) most studies are illustrated with examples specific to an industrial or academic case and not representative of the existing diversity; ii) a need to improve optimization performance in order to gain interactivity and face larger problems. In response to the first point, this thesis proposes a generic model of the O-CPPC problem. This generic model is used to generate a realistic benchmark for evaluating optimization algorithms. This benchmark is then used to analyze the performance of the CFB-EA evolutionary approach. One of the strengths of this approach is to quickly propose a Pareto front near the optimum. To answer the second point, an improvement of this method is proposed and evaluated. The idea is, from a first approximate Pareto front, to ask the user to choose an area of interest and to restrict the search for solutions only on this area. This improvement results in significant computing time savings.

Made available in DSpace on 2014-10-09T12:30:26Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:00:36Z (GMT). No. of bitstreams: 1 00956.pdf: 10327962 bytes, checksum: 71ac2457f781bcc0e415fc355cccc8fe (MD5) / Tese (Doutoramento) / IPEN/T / Massachusetts Institute of Technology - Cambridge, Mass - MIT

Made available in DSpace on 2014-10-09T12:30:26Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:00:36Z (GMT). No. of bitstreams: 1 00956.pdf: 10327962 bytes, checksum: 71ac2457f781bcc0e415fc355cccc8fe (MD5) / Tese (Doutoramento) / IPEN/T / Massachusetts Institute of Technology - Cambridge, Mass - MIT

Theoretical part of this diploma thesis describe Kaizen method and parts of this method, which was developed in Japan after the Second World War. One part of this method is the 3MU concept, that includes definition of absences which influence all companies. One concept of the 3MU is “Muda”, who indicate waste. Practical part is interesting in wastes in sphere of productivity at one of the production department of the Bosch Diesel Ltd. in Jihlava. Individual operations of this department are considered in light of possibility introduction of more-machine operation and the checking of necessity of some machines. As a result is time data evaluation by REFA method and check of possibility introduction of more-machine operation with modification of working processes, calculation of industrial production capacity of some machines and the definition of buffer stocks. This modification of working processes, number of machines and the definition of buffer stocks needs change of layout of production department. At the conclusion there are calculated final costs and savings for implementation of this project.

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California / Network-based telemetry systems are often made up of many components from multiple vendors. The complexity involved in coordinating the design, integration, configuration, and operation of these systems has required instrumentation engineers to become experts in the tools and hardware from various vendors. Interoperation between the various tools and systems is very limited. One approach toward a more efficient method of managing these systems is to define a common language for describing the goals of the test, the measurements to be acquired, and the equipment that is available to compose a system. Through an open working group process, the iNET program is defining an eXtensible Markup Language (XML)-based language for describing instrumentation and telemetry systems. The language is designed with multiple aspects that allow filtered views into the instrumentation system, making the creation of the various parts of the documents more straight-forward and understandable to the type of user providing the information. This paper will describe the iNET metadata project, the model-driven approach that is being pursued, and the current state of the iNET metadata language.

No description available.

This thesis aims to make advances in the accurate simulation of the ows in and around clustered module plug nozzles. The resulting simulations presented in this thesis are, as far as can be ascertained from available data, the most detailed to date in Europe. A comparison is made with results from other sources for clarication of this point. In the process of producing these solutions, two ow solvers have been developed. NSAXIMB is a general 2D multi-block ow solver,developed by the author, for the axisymmetric, Reynolds averaged Navier-Stokes equations. It was developed to allow simulation of axisymmetic plug nozzle congurations and the investigation of the effects of turbulence modelling on such ows. MERLIN is a general 3D, implicit, multi-block ow solver again for the RANS equations. MERLIN was developed by the Centre for Computational uid Dynamic at Craneld. Signicant input from this work has included a large portion of the structure of the mean ow solver and the extension of the advanced two equation turbulence modelling, incorporated in NSAX- IMB, to three dimensions. Of the turbulence models investigated the zonal models of Menter prove to be most effective in reproducing experimental results. These models out perform a more advanced non-linear eddy viscosity formulation, based on the work of Abid. In an effort to improve solution accuracy, grid adaptation software, based on node redistribution techniques has been developed for use in conjunction with the 3D ow solver. This work is demonstrated in conjunction with a basic test case before application to the clustered module plug nozzle conguration. Results for the complex block topology adopted in the 3D test case are shown to cause the adaptation process to fail. Further, it is shown that such a process may not be generalised for arbitrary topologies.

The facility layout design problem is concerned with determining the arrangement and configuration of facilities, which optimizes a prescribed objective such as profit, cost, or distance, and which satisfies various prescribed constraints pertaining to available resources. In industry, facility layout design problems arise in manufacturing, in warehousing, and in various assignment type situations. The solution of these problems impacts on the viability of the industry. For example, material-handling costs which can comprise between 30 and 75% of the total manufacturing costs, can be reduced by using the optimization methods associated with the facility layout design. In the service industries, facility layout design problems arise in the location of emergency facilities (such as ambulance, fire stations) and in the allocation of space. The solution of these location problems impacts on the well being of the community. Mathematically, the facility layout problem has been modelled as: a quadratic assignment problem, a quadratic set covering problem, a linear integer programming problem, a mixed integer programming problem, and a graph theoretic problem. The problem has been shown to be NP-complete. This computational difficulty has led researchers to consider suboptimal solutions generated by heuristic approaches. There are a number of heuristic procedures that have been proposed for solving the facility layout design problem, including Simulated Annealing, Tabu Search, Expert Systems, and Graph Theoretic Algorithms. The most successful heuristic approaches are based on graph theoretic concepts. In this thesis we focus our study on constructive graph theoretic based heuristics for determining an optimal arrangement and configuration of facilities with the objective of maximizing the total benefit. / We are particularly interested in constructive heuristics, which can produce a maximum-weighted planar graph as a final solution. Our contribution is the development, implementation, and testing of three new algorithms. Computational results, based on 4200 randomly (uniform and normal distribution) generated problems, demonstrate the value of our methods. We also present the performance of each algorithm when various initial solutions are applied. Chapter 1 provides the background of the facility layout design, including the notation, terminology and general concepts as well as a summary of the thesis. Chapter 2 provides a comprehensive survey of the facility layout design problem. This includes models and methods of solution based on exact algorithms (including the branch and bound method and the cutting plane method), as well as heuristic algorithms. We detail the main constructive graph theoretic based heuristics in the literature: the Deltahedron Method, the Green-Al Hakim Algorithm, the Leung’s Constructive Heuristic, the Kim-Kim Algorithm, the Wheel Expansion Method, TESSA and the String Processing Algorithm. We also briefly discuss the non-graph theoretic heuristics including simulated annealing, tabu search, and expert systems. In Chapter 3 we present three new graph theoretic based heuristics. These heuristics are constructive and the solution is built up, starting with an initial layout of four facilities, by an insertion process. Our algorithms have two important features. Firstly, they allow for previously chosen edges to be removed at each insertion step. Secondly, they do not restrict the type of maximal planar graph produced. Computational results and a comparative analysis of the main graph theoretic based heuristics are provided. The analysis is based on 4200 randomly generated test problems (from uniform and normal distribution). / The test problems consist of 30 data sets with the number of facilities ranging from 5 to 100 in increments of 5. Chapter 4 is devoted to the performance of graph theoretic based heuristics when different types of initial solutions are applied. Examples show that the final solution is sensitive to the initial solution. Computational results indicate that for most algorithms, the best type of initial solution is the selection of four facilities which yield the best objective function value contribution. However, this does not always coincide with that proposed in the original description of the algorithms. We conclude this thesis by discussing some future research that can be carried out on the facility layout design problem, particularly in graph theoretic based heuristics.

Thesis--Ph. D., University of Hong Kong, 1986.