Spelling suggestions: "subject:"programming""
1 |
Možnosti systému Sinumerik při programování obráběcích strojů / Sinumerik tools for NC programming of machinesLegutký, Lukáš January 2011 (has links)
The Master's thesis deals with the description of Sinumerik system possibilities when programming CNC machines. At the beginning the history of operative system Sinumerik evolution is discussed along with several programming methods ranging from the oldest to newest. Second part deals with the experimental part concept. This part is processed in Sinutrain Operate 2.6.1 with the program interface ShopTurn.
|
2 |
Rhinoscripting y Grasshopper a través de sus instructores: un estudio de patrones y usosHerrera Polo, Pablo C., Universidad Peruana de Ciencias Aplicadas (UPC) 25 February 2015 (has links)
SIGRADI 2010. XIV Congreso de la Sociedad Iberomaericana de Gráfica Digital, desarrollado los días 17, 18 y 19 de Noviembre del 2010. Bogotá, Colombia / It is common today the use a graphical user interface and techniques to automate a process through compute
-
rization. By contrast, when trying to learn computational approaches, we have not overcome the learning curve and many
of the workshops have not had the expected results to prolong their use. In this research we explore the trends in this
process, from those that generate the generic object to those that appropriate it by modification. The set of case studies
presents patterns and uses of those instructors who have come to be use algorithms intensively to solve a design problem
|
3 |
Parallel and Distributed Computation:Numerical MethodsBertsekas, Dimitri P., Tsitsiklis, John N. 21 November 2003 (has links)
No description available.
|
4 |
Stochastic Optimal Control: The Discrete-TIme CaseBertsekas, Dimitir P., Shreve, Steven 03 March 2004 (has links)
No description available.
|
5 |
Memory and parallelism optimization for embedded systems /Xue, Chun Jason. January 2007 (has links)
Thesis (Ph. D.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 168-174)
|
6 |
A dependently typed programming language with dynamic equalityLemay, Mark 11 July 2023 (has links)
Dependent types offer a uniform foundation for both proof systems and programming languages.
While the proof systems built with dependent types have become relatively popular, dependently typed programming languages are far from mainstream.
One key issue with existing dependently typed languages is the overly conservative definitional equality that programmers are forced to use.
When combined with a traditional typing workflow, these systems can be quite challenging and require a large amount of expertise to master.
This thesis explores an alternative workflow and a more liberal handling of equality.
Programmers are given warnings that contain the same information as the type errors that would be given by an existing system.
Programmers can run these programs optimistically, and they will behave appropriately unless a direct contradiction confirming the warning is found.
This is achieved by localizing equality constraints using a new form of elaboration based on bidirectional type inference.
These local checks, or casts, are given a runtime behavior (similar to those of contracts and monitors).
The elaborated terms have a weakened form of type soundness: they will not get stuck without an explicit counter example.
The language explored in this thesis will be a Calculus of Constructions like language with recursion, type-in-type, data types with dependent indexing and pattern matching.
Several meta-theoretic results will be presented.
The key result is that the core language, called the cast system, "will not get stuck without a counter example"; a result called cast soundness.
A proof of cast soundness is fully worked out for the fragment of the system without user defined data, and a Coq proof is available. Several other properties based on the gradual guarantees of gradual typing are also presented.
In the presence of user defined data and pattern matching these properties are conjectured to hold.
A prototype implementation of this work is available.
|
7 |
An heuristic approach for the improvement of aircraft departure scheduling at airportsTeixeira, Roberto de Barros January 1992 (has links)
This work considers the management in the short run of aircraft departures from their parking stands at major airports where traffic congestion is noticeable. At the ground level, congestion is patent when carefully designed departure time tables become unworkable, causing ever increasing delays which penalize heavily passengers, airlines and the airport surrounding community. The study is composed of two parts: First an overall analysis of the considered problem is performed to provide background knowledge and to display basic principles for the management of aircraft ground movements at modem airports. Physical components as well as current operational rules are discussed and their interdependence is revealed. A particular importance is given to new and foreseeable developments in communication and guidance technology which allow an improved prediction of runway occupancy times or gaps. Capacity issues are also discussed with respect to aircraft ground activities and the airfield capacity is analysed. This first part of the work ends with the description of levels of fuel consumption and of pollution emission by aircraft ground operations and thus shows the relevance of the problem considered in this study. The second part of this work is devoted to the design of a just-in-time clearance policy which should minimise environment, fuel and pollution levels and made possible a delay-free ground traffic for departing aircraft A mathematical formulation of the considered decision problem, characterized as a real time scheduling problem, is built up. Then possible solution strategies are appraised and an "ad hoc" heuristic solution algorithm is designed. This solution is first compared in theoretical terms with a First Come First Served policy showing that in an error-free situation the proposed solution cannot be worse than its competitor. Then a simulation study is performed which confirms in practical terms the above result The influence of the main design parameters of the solution algorithm on its performance are also examined giving some insights in relation to necessary communication and prediction aids. Finally, possible extensions of the proposed method and its integration in a global aircraft traffic management system are discussed.
|
8 |
Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing qualityAl Reeshi, Mohammad Ahmad January 2013 (has links)
This research deals with the optimization of metrology and calibration problems. The optimization involved here is the application scientifically sound operations research techniques to help in solving the problem intended optimally or semi-optimally with a practical time frame. The research starts by exploring the subject of measurement science known as metrology. This involves defining all the constituents of metrology facilities along with their various components. The definitions include the SI units’ history and structure as well as their characteristics. After that, a comprehensive description of most of the operations and parameters encountered in metrology is presented. This involves all sources of uncertainties in most of the parameters that affect the measurements. From the background presented and using all the information within it; an identification of the most important and critical general problems is attempted. In this treatment a number of potential optimization problems are identified along with their description, problem statement definition, impact on the system and possible treatment method. After that, a detailed treatment of the scheduling problem, the calibration interval determination problem and the average outgoing quality problem is presented. The scheduling problem is formulated and modelled as a mixed integer program then solved using LINGO program. A heuristic algorithm is then developed to solve the problem near optimally but in much quicker time, and solution is packaged in a computer program. The calibration interval problem treatment deals with the determination of the optimal CI. Four methods are developed to deal with different cases. The cases considered are the reliability target case, the CI with call cost and failure cost of both first failure and all failures and the case of large number of similar TMDEs. The average out going quality (AOQ) treatment involves the development two methods to assess the AOQ of a calibration facility that uses a certain multistage inspection policy. The two methods are mathematically derived and verified using a simulation model that compares them with an actual failure rate of a virtual calibration facility.
|
9 |
A Genetic Programming Approach to Solving Optimization Problems on Agent-Based ModelsGaruccio, Anthony 17 May 2016 (has links)
In this thesis, we present a novel approach to solving optimization problems that are defined on agent-based models (ABM). The approach utilizes concepts in genetic programming (GP) and is demonstrated here using an optimization problem on the Sugarscape ABM, a prototype ABM that includes spatial heterogeneity, accumulation of agent resources, and agents with different attributes. The optimization problem seeks a strategy for taxation of agent resources which maximizes total taxes collected while minimizing impact on the agents over a finite time. We demonstrate how our GP approach yields better taxation policies when compared to simple flat taxes and provide reasons why GP-generated taxes perform well. We also look at ways to improve the performance of the GP optimization method. / McAnulty College and Graduate School of Liberal Arts; / Computational Mathematics / MS; / Thesis;
|
10 |
Otimização da programação de operações dutoviárias: formulações eficientes e considerações hidraúlicas. / Optimization of pipeline scheduling operations: efficient formulations and hydraulic considerations.Rejowski Junior, Rubens 02 April 2007 (has links)
Sistemas de dutos correspondem atualmente ao modo mais eficaz para o transporte de grandes quantidades de fluidos líquidos e gasosos por longas distâncias. Dutos são utilizados pela Indústria Petrolífera para o transporte de petróleo e de seus produtos derivados. O presente trabalho aborda o scheduling de distribuição dutoviária de um sistema que opera com um duto que transporta produtos de uma refinaria para depósitos com localizações geográficas distintas através de modelos de programação matemática. O sistema é composto pela Refinaria do Planalto (REPLAN) da Petrobras localizada em Paulínia (SP). A ela é conectado um duto (OSBRA) que se estende por cerca de 1000 quilômetros. O maior detalhamento do modelo matemático para operações dutoviárias desenvolvido por Rejowski Jr. (Dissertação de Mestrado, EPUSP, São Paulo, 2001) se torna primordial nessa complexa operação logística. Um fator de extrema importância é a contaminação dos produtos dentro da linha dutoviária. Desta forma, são desenvolvidas restrições especiais que impõem paradas aos segmentos do duto somente quando os mesmos não possuem interfaces. Estas restrições fazem com que a formulação proposta encontre a solução ótima do problema proposto. O aprimoramento destas formulações se torna fundamental, pois os modelos gerados possuem um número elevado de decisões a serem otimizadas. Relações lógicas envolvendo o estoque inicial nos depósitos e na linha dutoviária e a demanda de cada um dos produtos são propostas. Estas relações melhoram o desempenho computacional para os modelos propostos em cenários de demandas altas. Posteriormente, as restrições especiais de contaminação dos produtos e as relativas ao atendimento das demandas nas bases de distribuição são relaxadas e transformadas em penalidades na função objetivo. Estas penalidades aumentam o esforço de resolução dos modelos e ao mesmo tempo possuem grande influência nos resultados operacionais do sistema. Outro fator de extrema importância para o scheduling de operações dutoviárias é a sua representação em tempo contínuo. Adicionalmente, esta representação faz com que a incorporação de restrições hidráulicas de maneira simplificada seja possibilitada. Desta forma, uma estratégia simplificada e eficaz para se determinar a vazão do duto, envolve incluir a curva de rendimento das estações de bombeamento. Esta formulação, que é modelada como um MINLP (Mixed Integer Non Linear Programming), é comparada com uma formulação MILP (Mixed Integer Linear Programming) em tempo discreto com vazões e rendimentos fixos proposta por Rejowski Jr. e Pinto (Computers and Chemical Engineering, 2004, v.28/8 p.1511-1528). Foi mostrado que a presente formulação forneceu soluções de melhor qualidade. A formulação MILP em tempo discreto é caracterizada como um caso particular da presente formulação proposta. A formulação MINLP sofre forte influência do número de intervalos de tempo que a compõem e este fator deve sempre ser considerado para que a melhor solução possa ser encontrada em tempo computacional factível. Esta formulação ainda é aplicada com sucesso a um caso sob diversas configurações de bombeamento com diferentes custos unitários e curvas de rendimento. Duas formulações que consideram a programação de operações de dutos com a incorporação dos aspectos hidráulicos calculados de maneira rigorosa são apresentadas. A primeira delas resulta em um modelo MINLP e considera variações na duração dos intervalos de tempo e na vazão operacional do sistema. Uma segunda formulação apresentada como um modelo MILP é desenvolvida. Resultados computacionais para ambos os modelos são apresentados, assim como as suas soluções geradas são discutidas. O impacto de variações no relevo do sistema dutoviário é analisado. Foram detectadas alterações na vazão de operação do sistema dutoviário, na escolha dos intervalos de tempo em que o sistema é ativado, no rendimento das estações de bombeamento e no tempo total de operação do sistema. Posteriormente, em um outro exemplo, é mostrado que variações no relevo também podem alterar a seqüência dos produtos alimentados pela refinaria ao duto. Finalmente, as formulações têm os seus resultados comparados aos de modelos com considerações hidráulicas simplificadas, cujos resultados podem levar a soluções subótimas e até mesmo inviáveis. / Pipeline systems correspond nowadays to the most efficient mode for the transportation of large amounts of liquid and vapor products for long distances. Pipelines are utilized by the Petroleum Industry to transport petroleum and its product derivatives. The present work addresses the scheduling of pipeline distribution of a system that operates with a pipeline that transports products from a refinery to depots at different geographical locations by mathematical programming models. The system is composed by the Planalto Refinery (REPLAN) from Petrobras. A pipeline (OSBRA) is connected to the refinery that extends for approximately 1000 kilometers. A higher level of detail in the mathematical model for pipeline operations developed by Rejowski Jr. (MS Dissertation, EPUSP São Paulo, 2001) becomes essential in this complex logistic operation. A factor of extreme importance is product contamination inside the pipeline. Therefore, special constraints are developed that impose the segments of the pipeline to operate continuously when they do not contain interfaces. These constraints help the proposed formulation to find the optimal solution of the problem. The improvement of logical formulations becomes paramount because the generated models encompass a large number of decisions to be optimized. Logical relations involving the initial inventory at the depots and at the pipeline, as well as the demands for each product are proposed. These relations improve the computational performance of the proposed models in scenarios of high-demand. Then, the special constraints and the demand satisfaction at the depots at the end of the operational horizon are relaxed and added as penalties in the objective function. These penalties increase the solution effort of the proposed models and at the same time have great influence on the operational results of the system. Another factor of extreme importance for the pipeline operation scheduling is its continuous time representation. Additionally, this representation enables the models to incorporate simplified hydraulic constraints. Therefore, a simplified and efficient strategy to determine the pipeline flow rate is to include the yield curves of the pumping stations. This formulation, that is modeled as an MINLP (Mixed Integer Non Linear Programming), is compared to an MILP (Mixed Integer Linear Programming) with discrete time and fixed flow and yield rates proposed by Rejowski Jr. and Pinto (Computers and Chemical Engineering, 2004, v.28/8 p.1511-1528). It is shown that the present formulation provides better quality results. The MILP formulation with discrete time is characterized as a particular case of the proposed formulation. The MINLP is greatly influenced by the number of time intervals that compose it and this factor has always to be considered so that the best solution can be found with feasible computational effort. This formulation is also applied to a case with several pumping station configurations with different unit costs and yield curves. Two formulations that consider the scheduling of pipeline operations with the incorporation of the hydraulic aspects calculated rigorously are presented. The first one results in an MINLP model and considers variations on the time interval durations and in the pipeline flow rate. A second MILP formulation is developed. Computational results for both models are shown as well as the generated solutions discussed. The impact of variations on the topographical profile of the pipeline system is analyzed in the obtained results by the models. Changes in the flow rate of the pipeline, in the decision of the time intervals that the system is activated, in the pumping station yields and in the time interval durations were detected. Then, in another example it is shown that the changes in the topographical profile can alter the sequence of products sent by the refinery to the pipeline. Finally, both formulations have their results compared to models with simplified hydraulic considerations, whose results can lead to suboptimal and even to infeasible solutions.
|
Page generated in 0.5237 seconds