Dissertations / Theses on the topic 'Meta-programming'
To see the other types of publications on this topic, follow the link: Meta-programming.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Meta-programming.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Eshghi, Kave. "Meta-language in logic programming." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38302.
Full text
2
Mabrouk, Emad Hamdy Ahmed. "Meta-Heuristics Programming and Its Applications." 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142132.
Full text
3
Lynagh, Ian. "Soft types for template meta-programming." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.442604.
Full text
4
Bowers, Antony Francis. "Effective meta-programming in declarative languages." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263891.
Full text
5
Carpenter, Steven M. "Visual meta-programming language graphical user interface for generative programming." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FCarpenter.pdf.
Full textAbstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2002.Thesis advisor(s): Mikhail Auguston, Richard Riehle. Includes bibliographical references (p. 89). Also available online.
6
Pasalic, Emir. "The role of type equality in meta-programming /." Full text open access at:, 2004. http://content.ohsu.edu/u?/etd,216.
Full text
7
Lu, Anthony (Anthony S. ). "Venture : an extensible platform for probabilistic meta-programming." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/113160.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 63-64).
This thesis describes Venture, an extensible platform for probabilistic meta-programming. In Venture, probabilistic generative models, probability density functions, and probabilistic inference algorithms are all first-class objects. Any Venture program that makes random choices can be treated as a probabilistic model defined over the space of possible executions of the program. Such probabilistic model programs can also be run while recording the random choices that they make. Modeling and inference in Venture involves two additional classes of probabilistic programs. The first, probability density meta-programs partially describe the input-output behavior of probabilistic model programs. The second, stochastic inference meta-programs identify probable executions of model programs given stochastic constraints, and typically use density meta-programs as guides. Unlike other probabilistic programming platforms, Venture allows model programs, density meta-programs, and inference meta-programs to be written as user-space code in a single probabilistic programming language. Venture is essentially a Lisp-like higher-order language augmented with two novel abstractions: (i) probabilistic execution traces, a first-class object that represents the sequence of random choices that a probabilistic program makes, and (ii) stochastic procedures, which encapsulate the probabilistic programs and meta-programs needed to allow simple probability distributions, user-space VentureScript programs, and foreign probabilistic programs to be treated uniformly as components of probabilistic computations. Venture also provides runtime support for stochastic regeneration of execution trace fragments that makes use of the programs and meta-programs of all stochastic procedures invoked during the execution of the original traced program. This thesis describes a new prototype implementation of Venture incorporating these ideas and illustrates the flexibility of Venture by giving concise user-space implementations of primitives and inference strategies that have been built in to Church as well as other probabilistic languages.
by Anthony Lu.
M. Eng.
8
Yalcinalp, L. Umit. "Meta-programming for knowledge-based systems in Prolog." Case Western Reserve University School of Graduate Studies / OhioLINK, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=case1055947333.
Full text
9
Doan, Thu Trang. "Meta-APL : a general language for agent programming." Thesis, University of Nottingham, 2014. http://eprints.nottingham.ac.uk/29286/.
Full textAbstract:
A key advantage of BDI-based agent programming is that agents can deliberate about which course of action to adopt to achieve a goal or respond to an event. However while state-of-the-art BDI-based agent programming languages provide flexible support for expressing plans, they are typically limited to a single, hard-coded, deliberation strategy(perhaps with some parameterisation) for all task environments. In this thesis, we describe a novel agent programming language, meta-APL, that allows both agent programs and the agent’s deliberation strategy to be encoded in the same programming language. Key steps in the execution cycle of meta-APL are reflected in the state of the agent and can be queried and updated by meta-APL rules, allowing a wide range of BDI deliberation strategies to be programmed. We give the syntax and the operational semantics of meta-APL, focussing on the connections between the agent’s state and its implementation. Finally, to illustrate the flexibility of meta-APL, we show how Jason and 3APL programs and deliberation strategy can be translated into meta-APL to give equivalent behaviour under weak bisimulation equivalence.
10
Pettersson, Emil. "Meta-Interpretive Learning Versus Inductive Metalogic Programming : A Comparative Analysis in Inductive Logic Programming." Thesis, Uppsala universitet, Institutionen för informatik och media, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-393291.
Full textAbstract:
Artificial intelligence and machine learning are fields of research that have become very popular and are getting more attention in the media as our computational power increases and the theories and latest developments of these fields can be put into practice in the real world. The field of machine learning consists of different paradigms, two of which are the symbolic and connectionist paradigms. In 1991 it was pointed out by Minsky that we could benefit from sharing ideas between the paradigms instead of competing for dominance in the field. That is why this thesis is investigating two approaches to inductive logic programming, where the main research goals are to, first: find similarities or differences between the approaches and potential areas where cross-pollination could be beneficial, and secondly: investigate their relative performance to each other based on the results published in the research. The approaches investigated are Meta-Interpretive Learning and Inductive Metalogic Programming, which belong to the symbolic paradigm of machine learning. The research is conducted through a comparative study based on published research papers. The conclusion to the study suggests that at least two aspects of the approaches could potentially be shared between them, namely the reversible aspect of the meta-interpreter and restricting the hypothesis space using the Herbrand base. However, the findings regarding performance were deemed incompatible, in terms of a fair one to one comparison. The results of the study are mainly specific, but could be interpreted as motivation for similar collaboration efforts between different paradigms.
11
Ulker, Ozgur. "Office space allocation by using mathematical programming and meta-heuristics." Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/13604/.
Full textAbstract:
Office Space Allocation (OSA) is the task of efficient usage of spatial resources of an organisation. A common goal in a typical OSA problem is to minimise the wastage of space either by limiting the overuse or underuse of the facilities. The problem also contains a myriad of hard and soft constraints based on the preferences of respective organisations. In this thesis, the OSA variant usually encountered in academic institutions is investigated. Previous research in this area is rather sparse. This thesis provides a definition, extension, and literature review for the problem as well as a new parametrised data instance generator. In this thesis, two main algorithmic approaches for tackling the OSA are proposed: The first one is integer linear programming. Based on the definition of several constraints and some additional variables, two different mathematical models are proposed. These two models are not strictly alternatives to each other. While one of them provides more performance for the types of instances it is applicable, it lacks generality. The other approach provides less performance; however, it is easier to apply this model to different OSA problems. The second algorithmic approach is based on metaheuristics. A three step process in heuristic development is followed. In the first step, general local search techniques (descent methods, threshold acceptance, simulated annealing, great deluge) traverse within the neighbourhood via random relocation and swap moves. The second step of heuristic development aims to investigate large sections of the whole neighbourhood greedily via very fast cost calculation, cost update, and search for best move procedures within an evolutionary local search framework. The final step involves refinements and hybridisation of best performing (in terms of solution quality) mathematical programming and meta-heuristic techniques developed in prior steps. This thesis aims to be one of the pioneering works in the research area of OSA. The major contributions are: the analysis of the problem, a new parametrised data instance generator, mathematical programming models, and meta-heuristic approaches in order to extend the state-of-the art in this area.
12
Stefik, Melissa Ann. "Enabling experimentation of aspect-oriented programming languages through a meta-weaver framework." Online access for everyone, 2008. http://www.dissertations.wsu.edu/Thesis/Spring2008/m_stefik_042208.pdf.
Full text
13
Singleton, Paul. "Applications of meta-programming to the construction of software products from generic configurations." Thesis, Keele University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314663.
Full text
14
Lin, Fuyau. "An integration of logic and functional programming paradigms: Type theory and meta-narrowing." Case Western Reserve University School of Graduate Studies / OhioLINK, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=case1055357832.
Full text
15
Sepasi, Maryam. "Model Driven Rule Engine Using Meta Programming : A Case Study from Ericsson Company." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-174834.
Full textAbstract:
Det växande önskemålet att använda ny teknik, leder till en ökning av att använda mer komplexa programvarudomäner. Dessutom kan det orsaka ett antal utmaningar, som kan lösas genom att förändra sättet som system är utformade på. Företag har tillämpat instruktioner och standarder inom sina organisationer för att minska problemen och öka samstämmigheten mellan sina program och att återanvända komponenter i olika system. Generiska eller specifika metoder kan användas för att implementera sådana system. Eftersom en specifik metod ger en bättre lösning med större fördelar och användbarhet i vissa domäner så följde denna studie denna metod. Denna studie presenterar resultatet av en explorativ fallstudie vid telekombolaget Ericsson där de utmaningar som definierar ett yttre och inre domänspecifikt språk utreddes. Möjligheterna att övergå från en manuellt byggd konfiguration för en radiobasstation till en mer automatiserad och pålitlig systemkonfiguration undersöktes. Dessutom presenteras resultatet av att utveckla ett internt och externt domänspecifikt språk baserade på företagets krav. Fördelar, tillkortakommanden, exempel på domänspecifikt språk och implementationstekniker diskuteras i rapporten. Resultatet av detta examensarbete kommer att användas som en konfigurationsdel som ingår i ett större internt verktyg inom företaget. Detta tillhandahåller en effektiv metod för att hantera komplicerade system på ett enkelt sätt.The growing request of using new technologies, leads to an increased usage of more complex software domains. In addition, it may cause number of challenges, which can be resolved by changing the way systems are designed. Companies have applied instructions and standards within their organizations to reduce the problems and increase the consistency between their software applications and reusing components in different systems. A generic or specific approach can be used to implement such systems. As a specific approach delivers a better solution with significant advantages and ease of use for particular application domains, this study followed this methodology. This study presents the result of an exploratory case study at the Ericsson telecom company where the challenges of defining an external and internal Domain Specific Language were investigated. The possibilities of how to transfer from a manually built Radio Base Station configuration towards a more automated and reliable system configuration was investigated. Moreover, the results of developing an internal and external DSL based on the company’s requirements are presented. Benefits, shortcomings, example DSLs, and implementation techniques are discussed in this report. The outcome of this thesis work will be used as a configuration part that is included in a larger in-house tool within the company. This provides an effective method to handle complicated system in a simple manner.
16
Harmelen, Frank van. "On the efficiency of meta-level inference." Thesis, University of Edinburgh, 1989. http://hdl.handle.net/1842/6597.
Full textAbstract:
In this thesis we will be concerned with a particular type of architecture for reasoning systems, known as meta-level architectures. After presenting the arguments for such architectures (chapter 1), we discuss a number of systems in the literature that provide an explicit meta-level architecture (chapter 2), and these systems are compared on the basis of a number of distinguishing characteristics. This leads to a classification of meta-level architectures (chapter 3). Within this classification we compare the different types of architectures, and argue that one of these types, called bilingual meta-level inference systems, has a number of advantages over the other types. We study the general structure of bilingual meta-level inference architectures (chapter 4), and we discuss the details of a system that we implemented which has this architecture (chapter 5). One of the problems that this type of system suffers from is the overhead that is incurred by the meta-level effort. We give a theoretical model of this problem, and we perform measurements which show that this problem is indeed a significant one (chapter 6). Chapter 7 discusses partial evaluation, the main technique available in the literature to reduce the meta-level overhead. This technique, although useful, suffers from a number of serious problems. We propose two further techniques, partial reflection and many-sorted logic (chapters 8 and 9), which can be used to reduce the problem of meta-level overhead without suffering from these problems.
17
Neverov, Gregory Michael. "Design and implementation of a multi-stage, object-oriented programming language." Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/16559/1/Gregory_Michael_Neverov_Thesis.pdf.
Full textAbstract:
Multi-stage programming is a valuable technique for improving the performance of computer programs through run-time optimization. Current implementations of multi-stage programming do not support run-time type introspection, which is a significant feature of modern object-oriented platforms such as Java and C#. This is unfortunate because many programs that use type introspection in these languages could be improved with multi-staging programming.
The aim of this research is to investigate the interaction between multi-stage programming and object-oriented type introspection. This is done by the invention of a new programming language that is a multi-stage extension to C#. The language is capable of expressing traditional multi-stage programs as well as a new style of multi-stage programs that incorporate type introspection, most notably polytypic algorithms such as object serialization. A compiler for the language is implemented and freely available. The language is significant because it is the first object-oriented, multi-stage language; the first attempt to combine type introspection with multi-stage programming; and the first exploration of polytypic programming in a multi-stage context.
18
Neverov, Gregory Michael. "Design and implementation of a multi-stage, object-oriented programming language." Queensland University of Technology, 2007. http://eprints.qut.edu.au/16559/.
Full textAbstract:
Multi-stage programming is a valuable technique for improving the performance of computer programs through run-time optimization. Current implementations of multi-stage programming do not support run-time type introspection, which is a significant feature of modern object-oriented platforms such as Java and C#. This is unfortunate because many programs that use type introspection in these languages could be improved with multi-staging programming. The aim of this research is to investigate the interaction between multi-stage programming and object-oriented type introspection. This is done by the invention of a new programming language that is a multi-stage extension to C#. The language is capable of expressing traditional multi-stage programs as well as a new style of multi-stage programs that incorporate type introspection, most notably polytypic algorithms such as object serialization. A compiler for the language is implemented and freely available. The language is significant because it is the first object-oriented, multi-stage language; the first attempt to combine type introspection with multi-stage programming; and the first exploration of polytypic programming in a multi-stage context.
19
Seefried, Sean Computer Science & Engineering Faculty of Engineering UNSW. "Language extension via dynamically extensible compilers." Awarded by:University of New South Wales. Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/29524.
Full textAbstract:
This dissertation provides the motivation for and evidence in favour of an approach to language extension via dynamic loading of plug-ins. There is a growing realisation that language features are often a superior choice to software libraries for implementing applications. Among the benefits are increased usability, safety and efficiency. Unfortunately, designing and implementing new languages is difficult and time consuming. Thus, reuse of language infrastructure is an attractive implementation avenue. The central question then becomes, what is the best method to extend languages? Much research has focussed on methods of extension based on using features of the language itself such as macros or reflection. This dissertation focuses on a complementary solution: plug-in compilers. In this approach languages are extended at run-time via dynamic extensions to compilers, called plug-ins. Plug-ins can be used to extend the expressiveness, safety and efficiency of languages. However, a plug-in compiler provides other benefits. Plug-in compilers encourage modularity, lower the barrier of entry to development, and facilitate the distribution and use of experimental language extensions. This dissertation describes how plug-in support is added, to both the front and back-end of a compiler, and demonstrates their application through a pair of case studies.
20
Gao, Xiang. "Using methods of optimization programming and meta-analysis to evaluate current Unite [sic] States nutritional recommendations /." Thesis, Connect to Dissertations & Theses @ Tufts University, 2005.
Find full textAbstract:
Thesis (Ph.D.)--Tufts University, 2005.Adviser: Katherine L. Tucker. Submitted to the School of Nutrition Science and Policy. Includes bibliographical references. Access restricted to members of the Tufts University community. Also available via the World Wide Web;
21
Peldžius, Stasys. "Universalus pertvarkų įrankis." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089.
Full textAbstract:
Vykstant nuolatiniam programų sistemų atnaujinimui, nuolatos reikia prižiūrėti, kad jos būtų kokybiškai projektuojamos ir programuojamos. Tačiau neišvengiamai atsiranda nekokybiško išeities teksto, arba atsiranda projektavimo trūkumų. Todėl yra svarbu mokėti ieškoti tokias problemas, ir jas ištaisyti. Šio darbo tikslas yra sukurti automatinio – universalaus įrankio modelį, kuris savarankiškai aptiktų pertvarkas, bei būtų nepriklausomas nuo konkrečios programavimo kalbos. Šiam tikslui pasiekti yra nagrinėjami mokslininkų siūlomi automatiškai aptinkantys pertvarkas metodai. Taip pat yra nagrinėjamos tokio įrankio realizavimo galimybės, pateikti realizaciniai sprendimai ir pavyzdžiai. Taip pat tikslas yra sukurti praktiškai naudingas automatines pertvarkas, kurios būtų realizuotos pasiūlytu įrankiu, ir pademonstruotas jų veikimas. Šis įrankis naudoja loginį programavimą, kurio faktais yra aprašomos pertvarkomos programos, o taisyklėmis – pačios pertvarkų programos. Sėkmingai sukurti automatiniai pertvarkų radimo pavyzdžiai, leidžia daryti išvadą, kad šiame darbe rastas būdas automatiškai aptikti nekokybišką išeities tekstą, bei realizuoti tokias pertvarkas nepriklausomai nuo programavimo kalbos.In the continual evolution of software systems, should be continuous to ensure that they are high quality designed and programmed. But inevitably the defective code, that call “bad small” or the design deficiencies. It is therefore important to be able to find such problems, and to correct them. The aim of this thesis is to create automatic - universal refactoring tool, which is detected in self-refactoring, and is independent of specific programming languages. To achieve this objective are scientists considered the proposed automatic detection of refactoring methods. It is also considered the possibility of the realization of such a tool, to provide examples and realizable solutions. It also aims to create a practical benefit of the automatic adjustments to the proposed tool is to be realized, and a demonstration of their operation. This tool uses a logic programming, which is a factual description of the conversion, and the rules - the refactoring of the program. The successful creation of automatic detection for refactoring, it can be concluded that this work is found way to automatically detect poor quality of source code, and the realization of the restructuring, regardless of programming language.
22
Masliah, Ian. "Méthodes de génération automatique de code appliquées à l’algèbre linéaire numérique dans le calcul haute performance." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS285/document.
Full textAbstract:
Les architectures parallèles sont aujourd'hui présentes dans tous les systèmes informatiques, allant des smartphones aux supercalculateurs en passant par les ordinateurs de bureau. Programmer efficacement ces architectures en fonction des applications requiert un effort pluridisciplinaire portant sur les langages dédiés (Domain Specific Languages - DSL), les techniques de génération de code et d'optimisation, et les algorithmes numériques propres aux applications. Dans cette thèse, nous présentons une méthode de programmation haut niveau prenant en compte les caractéristiques des architectures hétérogènes et les propriétés existantes des matrices pour produire un solveur générique d'algèbre linéaire dense. Notre modèle de programmation supporte les transferts explicites et implicites entre un processeur (CPU) et un processeur graphique qui peut être généraliste (GPU) ou intégré (IGP). Dans la mesure où les GPU sont devenus un outil important pour le calcul haute performance, il est essentiel d'intégrer leur usage dans les plateformes de calcul. Une architecture récente telle que l'IGP requiert des connaissances supplémentaires pour pouvoir être programmée efficacement. Notre méthodologie a pour but de simplifier le développement sur ces architectures parallèles en utilisant des outils de programmation haut niveau. À titre d'exemple, nous avons développé un solveur de moindres carrés en précision mixte basé sur les équations semi-normales qui n'existait pas dans les bibliothèques actuelles. Nous avons par la suite étendu nos travaux à un modèle de programmation multi-étape ("multi-stage") pour résoudre les problèmes d'interopérabilité entre les modèles de programmation CPU et GPU. Nous utilisons cette technique pour générer automatiquement du code pour accélérateur à partir d'un code effectuant des opérations point par point ou utilisant des squelettes algorithmiques. L'approche multi-étape nous assure que le typage du code généré est valide. Nous avons ensuite montré que notre méthode est applicable à d'autres architectures et algorithmes. Les routines développées ont été intégrées dans une bibliothèque de calcul appelée NT2.Enfin, nous montrons comment la programmation haut niveau peut être appliquée à des calculs groupés et des contractions de tenseurs. Tout d'abord, nous expliquons comment concevoir un modèle de container en utilisant des techniques de programmation basées sur le C++ moderne (C++-14). Ensuite, nous avons implémenté un produit de matrices optimisé pour des matrices de petites tailles en utilisant des instructions SIMD. Pour ce faire, nous avons pris en compte les multiples problèmes liés au calcul groupé ainsi que les problèmes de localité mémoire et de vectorisation. En combinant la programmation haut niveau avec des techniques avancées de programmation parallèle, nous montrons qu'il est possible d'obtenir de meilleures performances que celles des bibliothèques numériques actuellesParallelism in today's computer architectures is ubiquitous whether it be in supercomputers, workstations or on portable devices such as smartphones. Exploiting efficiently these systems for a specific application requires a multidisciplinary effort that concerns Domain Specific Languages (DSL), code generation and optimization techniques and application-specific numerical algorithms. In this PhD thesis, we present a method of high level programming that takes into account the features of heterogenous architectures and the properties of matrices to build a generic dense linear algebra solver. Our programming model supports both implicit or explicit data transfers to and from General-Purpose Graphics Processing Units (GPGPU) and Integrated Graphic Processors (IGPs). As GPUs have become an asset in high performance computing, incorporating their use in general solvers is an important issue. Recent architectures such as IGPs also require further knowledge to program them efficiently. Our methodology aims at simplifying the development on parallel architectures through the use of high level programming techniques. As an example, we developed a least-squares solver based on semi-normal equations in mixed precision that cannot be found in current libraries. This solver achieves similar performance as other mixed-precision algorithms. We extend our approach to a new multistage programming model that alleviates the interoperability problems between the CPU and GPU programming models. Our multistage approach is used to automatically generate GPU code for CPU-based element-wise expressions and parallel skeletons while allowing for type-safe program generation. We illustrate that this work can be applied to recent architectures and algorithms. The resulting code has been incorporated into a C++ library called NT2. Finally, we investigate how to apply high level programming techniques to batched computations and tensor contractions. We start by explaining how to design a simple data container using modern C++14 programming techniques. Then, we study the issues around batched computations, memory locality and code vectorization to implement a highly optimized matrix-matrix product for small sizes using SIMD instructions. By combining a high level programming approach and advanced parallel programming techniques, we show that we can outperform state of the art numerical libraries
23
Chanias, Angelos. "The effects of exercise programming on health-related physical fitness of individuals with an intellectual disability : a meta-analysis of studies." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ29535.pdf.
Full text
24
Huang, Shan Shan. "Structural abstraction." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29632.
Full textAbstract:
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.Committee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugaber. Part of the SMARTech Electronic Thesis and Dissertation Collection.
25
Kunigami, Guilherme 1986. "Mapas de símbolos proporcionais." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275731.
Full textAbstract:
Orientador: Pedro Jussieu de Rezende, Cid Carvalho de SouzaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-19T04:48:53Z (GMT). No. of bitstreams: 1 Kunigami_Guilherme_M.pdf: 3383647 bytes, checksum: 88687783446ea3564995daf2b1ecfd79 (MD5) Previous issue date: 2011
Resumo: Nesta dissertação, realizamos um estudo extensivo de uma classe de problemas envolvendo mapas de símbolos proporcionais, através de programação linear inteira. Mapas de símbolos proporcionais são uma ferramenta cartográfica para a representação de eventos associados 'a intensidade e localização geográfica. Exemplos clássicos desses tipos de mapas são ocorrências de terremotos e populações de cidades. Devido 'a proximidade e ao tamanho dos símbolos, podem haver sobreposições entre eles. Na ocorrência dessas sobreposições, a decisão sobre quais símbolos ficarão por cima de outros, pode afetar a visibilidade dos símbolos em um desenho. Os problemas envolvendo mapas de símbolos proporcionais dos quais tratamos são restritos ao uso de círculos opacos como símbolos e consistem em decidir a ordem em que estes serão dispostos em vista das sobreposições, de forma a maximizar métricas associadas à qualidade visual desses mapas. Tratam-se, portanto, de problemas de otimização combinatória. Em nosso trabalho, apresentamos modelos de programação linear inteira para resolução de dois desses problemas, um deles foi provado pertencer à classe NP-difícil e o outro tem complexidade ainda não conhecida. Obtivemos resultados teóricos de combinatória poliédrica acerca dos modelos, o que resultou em diversas desigualdades definidoras de facetas que foram incorporadas aos modelos. Desenvolvemos ainda técnicas de pré-processamento que decompuseram as instâncias de entrada em um grande número de componentes de menor tamanho. Essas técnicas permitiram resolver de maneira ótima, pela primeira vez, diversas instâncias criadas a partir de dados reais. Ademais, descrevemos um trabalho que aborda um desses problemas através de uma heurística GRASP, ao qual também contribuímos
Abstract: In this dissertation, we present an extensive study of a class of problems involving proportional symbol maps, through integer linear programming. Proportional symbol maps are a cartographic tool to represent events associated to specified values and geographical coordinates. Classic examples of these maps include representation of earthquakes and city populations. Due to the size and proximity of the symbols, there may be overlap among them. In such case, deciding which symbols will be placed above others may result in maps with different visibility information. The problems dealing with proportional symbol maps we address restrict symbols to be opaque disks and consist of deciding the order of their placement in view of overlaps, so as to maximize metrics related to the visual quality of such maps. Therefore, these amount essentially to combinatorial optimization problems. In our work, we designed integer linear programming models to solve two of these problems, one proven to be NP-hard and the other of complexity yet unknown. We obtained theoretical results concerning these models, through polyhedral combinatorics, which allowed us to include several facet defining inequalities into these models. We also developed preprocessing techniques that successfully broke down the input instances into a large number of smaller components. These techniques lead, for the first time, to optimal solutions of several test instances created from real-world data. Furthermore, we describe work on a heuristic approach to one of these problems using GRASP, to which we also contributed
Mestrado
Ciência da Computação
Mestre em Ciência da Computação
26
Silva, Odilon Novaes. "Novas estratégias de implementação da meta-heurística VNS aplicada na otimização de grade horária /." Ilha Solteira, 2019. http://hdl.handle.net/11449/181984.
Full textAbstract:
Orientador: Rubén Augusto Romero LázaroResumo: Neste projeto de pesquisa, é abordado o problema otimização de grade horária. O tipo de problema de grade horária abordado é aquele que tem o enunciado e a estrutura de dados apresentado no site da Competição Internacional de Otimização do Problema de Grade Horária. Esse problema pode ser modelado como sendo um problema de Programação Linear Binária de grande porte. Entretanto, os solvers comerciais disponíveis, como o CPLEX, não tem a capacidade de encontrar as soluções ótimas das 20 instâncias mostradas no site da Competição Internacional de Otimização do Problema de Grade Horária. Neste trabalho foi desenvolvido um algoritmo VNS especializado para resolver o problema de otimização de grade horária. A parcela inovadora da proposta está relacionado com o uso da lógica de partição para encontrar a melhor solução vizinha da solução corrente de forma eficiente e para uma estrutura de vizinhança complexa e formada por muitos elementos. Dessa forma, a proposta de otimização se tornou muito eficiente na resolução das 20 instâncias cujos dados se encontram no site da Competição Internacional de Otimização do Problema de Grade Horária.
Abstract: In this research project, we address the optimization timetabling problem. The type of timetabling problem addressed is one that has the statement and data structure displayed on the site of the International Competition of Optimization of the Timetabling Problem. This problem can be modeled as a large Binary Linear Programming Problem. However, the commercial solvers available, such as CPLEX, do not have the ability to nd the optimal solutions from the 20 instances shown on the site of the International Competition of Optimization of the timetabling Problem. In this work a specialized VNS algorithm was developed to solve the optimization of Timetabling Problem . The innovative part of the proposal is related to the use of partition logic to nd the best neighborhood solution of the current solution e ciently and to a structure of complex neighborhood formed by many elements. In this way, the optimization proposal became very e cient in the resolution of the 20 instances whose data were found on the website of the International Competition for Optimization of the Timetabling Problem.
Doutor
27
MIRANDA, Pericles Barbosa Cunha de. "Uma hiper-heurística híbrida para a otimização de algorítmos." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/18703.
Full textAbstract:
Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2017-05-04T18:13:43Z
No. of bitstreams: 2
license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5)
Teste - Péricles Miranda.pdf: 1959669 bytes, checksum: 8b0b1e3f94dd3295bce6153865564a12 (MD5)Made available in DSpace on 2017-05-04T18:13:43Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Teste - Péricles Miranda.pdf: 1959669 bytes, checksum: 8b0b1e3f94dd3295bce6153865564a12 (MD5) Previous issue date: 2016-08-22
A escolha de algoritmos ou heurísticas para a resolução de um dado problema é uma tarefa desafiadora devido à variedade de possíveis escolhas de variações/configurações de algoritmos e a falta de auxílio em como escolhê-las ou combiná-las. Por exemplo, o desempenho de algoritmo de otimização depende da escolha dos seus operadores de busca e do ajuste adequado de seus hiper-parâmetros, cada um deles com muitas possibilidades de opções a serem escolhidas. Por este motivo, existe um interesse de pesquisa crescente na automatização da otimização de algoritmos de modo a tornar esta tarefa mais independente da interação humana. Diferentes abordagens têm lidado com a tarefa de ajuste de algoritmos como sendo outro problema de (meta)otimização. Estas abordagens são comumente chamadas de hiper-heurísticas, onde cada solução do espaço de busca, neste caso, é um possível algoritmo avaliado em um dado problema. Inicialmente, hiper-heurísticas foram aplicadas na seleção de valores de hiper-parâmetros em um espaço de busca pré-definido e limitado. No entanto, recentemente, hiper-heurísticas têm sido desenvolvidas para gerar algoritmos a partir de componentes e funções especificados. Hiperheurísticas de geração são consideradas mais flexíveis que as de seleção devido à sua capacidade de criar algoritmos novos e personalizados para um dado problema. As hiper-heurísticas têm sido largamente utilizadas na otimização de meta-heurísticas. No entanto, o processo de busca torna-se bastante custoso, pois a avaliação das soluções trata-se da execução do algoritmo no problema de entrada. Neste trabalho, uma nova hiper-heurística foi desenvolvida para a otimização de algoritmos considerando um dado problema. Esta solução visa prover algoritmos otimizados que sejam adequados para o problema dado e reduzir o custo computacional do processo de geração significativamente quando comparado ao de outras hiper-heurísticas. A hiper-heurística proposta combina uma abordagem de seleção de algoritmos com uma hiper-heurística de geração. A hiperheurística de geração é responsável por criar uma base de conhecimento, que contém algoritmos que foram gerados para um conjunto de problemas. Uma vez que esta base de conhecimento esteja disponível, ela é usada como fonte de algoritmos a serem recomendados pela abordagem de seleção de algoritmos. A ideia é reusar algoritmos previamente construídos pela hiper-heurística de geração em problemas similares. Vale salientar que a criação de hiper-heurísticas visando reduzir o custo de geração de algoritmos sem comprometer a qualidade destes algoritmos não foi estudada na literatura. Além disso, hiper-heurísticas híbridas que combinam de abordagens de seleção de algoritmos e hiper-heurísticas de geração para a otimização de algoritmos, proposta nesta tese, é novidade. Para avaliar o algoritmo proposto, foi considerada como estudo de caso a otimização do algoritmo baseado em enxames (PSO). Nos experimentos realizados, foram considerados 32 problemas de otimização. O algoritmo proposto foi avaliado quanto à sua capacidade de recomendar bons algoritmos para problemas de entrada, se estes algoritmos atingem resultados competitivos frente à literatura. Além disso, o sistema foi avaliado quanto à sua precisão na recomendação, ou seja, se o algoritmo recomendado seria, de fato, o melhor a ser selecionado. Os resultados mostraram que a hiper-heurística proposta é capaz de recomendar algoritmos úteis para os problemas de entrada e de forma eficiente. Adicionalmente, os algoritmos recomendados atingiram resultados competitivos quando comparados com algoritmos estado da arte e a recomendação dos algoritmos atingiu um alto percentual de precisão.
Designing an algorithm or heuristic to solve a given problem is a challenging task due to the variety of possible design choices and the lack of clear guidelines on how to choose and/or combine them. For instance, the performance of an optimization algorithm depends on the designofitssearchoperatorsaswellasanadequatesettingofspecifichyper-parameters,eachof them with many possible options to choose from. Because of that, there is a growing research interest in automating the design of algorithms by exploring mainly optimization and machine learningapproaches,aimingtomakethealgorithmdesignprocessmoreindependentfromhuman interaction. Different approaches have dealt with the task of optimizing algorithms as another (meta)optimization problem. These approaches are commonly called hyper-heuristics, where each solution of the search space is a possible algorithm. Initially, hyper-heuristics were applied for the selection of parameters in a predefined and limited search space. Nonetheless, recently, generation hyper-heuristics have been developed to generate algorithms from a set of specified components and functions. Generation hyper-heuristics are considered more flexible than the selection ones due to its capacity to create new and customized algorithms for a given problem. Hyper-heuristics have been widely used for the optimization of meta-heuristics. However, the search process becomes expensive because the evaluation of each solution depends on the execution of an algorithm in a problem. In this work, a novel hyper-heuristic was developed to optimize algorithms considering a given problem. The proposed approach aims to provide optimizedalgorithmsfortheinputproblemandreducethecomputationalcostoftheoptimization process significantly when compared to other hyper-heuristics. The proposed hyper-heuristics combines an automated algorithm selection method with a generation hyper-heuristic. The generation hyper-heuristic is responsible for the creation of the knowledge base, which contains previously built algorithms for a set of problems. Once the knowledge base is available, it is used as a source of algorithms to be recommended by the automated algorithm selection method. The idea is to reuse the algorithms already built by the generation hyper-heuristic on similar problems. It is worth mentioning that the creation of hyper-heuristics aiming to reduce the cost of the algorithm generation without harming the quality of these algorithms were not studied yet. Besides, hybrid hyper-heuristics which combine an algorithm selection approach with a generation hyper-heuristic for the algorithm optimization, proposed in this thesis, are a novelty. To evaluate the proposed algorithm, it was considered as case study the optimization of the Particle Swarm Optimization algorithm (PSO). In our experiments, we considered 32 optimizationproblems.Theproposedsystemwasevaluatedregardingitscapacitytorecommend adequate algorithms for an input problem, the quality of the recommended algorithms, and, finally, regarding its accuracy to recommend algorithms. The results showed that the proposed system recommends useful algorithms for the input problem. Besides, the algorithms achieved competitive results when compared to state-of-the-art algorithms, and also, the system presented a high percentage of accuracy in the recommendation.
28
Inhasz, Rafael. "Programação genética: operadores de crossover, blocos construtivos e emergência semântica." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-14042010-212445/.
Full textAbstract:
Os algoritmos evolutivos são métodos heurísticos utilizados para a solução de problemas de otimização e que possuem mecanismos de busca inspirados nos conceitos da Teoria de Evolução das Espécies. Entre os algoritmos evolutivos mais populares, estão os Algoritmos Genéticos (GA) e a Programação Genética (GP). Essas duas técnicas possuem como ponto em comum o uso pesado do operador de recombinação, ou \"crossover\" - mecanismo pelo qual novas soluções são geradas a partir da combinação entre soluções existentes. O que as diferencia é a flexibilidade - enquanto que nos algoritmos genéticos as soluções são representadas por códigos binários, na programação genética essa representação é feita por algoritmos que podem assumir qualquer forma ou extensão. A preferência pelo operador de crossover não é simplesmente uma característica em comum das duas técnicas supracitadas, mas um poderoso diferencial. Na medida em que os indivíduos (as soluções) são selecionados de acordo com a respectiva qualidade, o uso do operador crossover tende a aumentar mais rapidamente a qualidade média da população se as partes boas de cada solução combinada (os \"building blocks\") forem preservadas. Holland [1975] prova matematicamente que sob determinadas condições esse efeito ocorrerá em algoritmos genéticos, em um resultado que ficou conhecido como \"Schema Theorem of GAs\". Entretanto, a implementação prática de GA (e, em especial, de GP) geralmente não ocorre segundo as condições supostas neste teorema. Diversos estudos têm mostrado que a extensão variável das estruturas utilizadas em GP dão um caráter de mutação ao operador de crossover, na medida em que a seleção aleatória dos pontos de combinação pode levar à destruição dos building blocks. Este trabalho propõe um novo operador de crossover, baseado em uma técnica de meta-controle que orienta a seleção dos pontos para a recombinação das soluções, respeitando o histórico de recombinação de cada ponto e a compatibilidade semântica entre as \"partes\" de cada solução que são \"trocadas\" neste processo. O método proposto é comparado ao crossover tradicional em um estudo empírico ligado à área Financeira, no qual o problema apresentado consiste em replicar a carteira de um fundo de investimentos setorial. Os resultados mostram que o método proposto possui performance claramente superior ao crossover tradicional, além de proporcionar a emergência de semântica entre as soluções ótimas.Evolutionary algorithms are heuristic methods used to find solutions to optimization problems. These methods use stochastic search mechanisms inspired by Natural Selection Theory. Genetic Algorithms and Genetic Programming are two of the most popular evolutionary algorithms. These techniques make intensive use of crossover operators, a mechanism responsible for generating new individuals recombining parts of existing solutions. The choice of crossover operator to be used is very important for the algorithms´ performance. If individuals are selected according to the fitness, the use of crossover operator helps to quickly increase the average quality of the population. In GA we also observe the emergence of \"building blocks\", that is, encapsulated parts of good solutions that are often preserved during the recombination process. Holland [1975] proves that, under some conditions, this phenomenon will occur in GAs. This result is known as Schema Theorem of GAs. However, practical implementations of these algorithms may be far away from the conditions stated in Holland´s theorem. In these non-ideal conditions, several factor may contribute to higher rates of destructive crossover (building blocks destruction). This work proposes a new crossover operator, based on a meta-control technique that drives selection of crossover points according to recombination history and semantic compatibility between the code blocks to be switched. The proposed method is compared to common crossover in a case study concerning the replication of an investment fund. Our results show that the proposed method has better performance than the common crossover. Meta-control techniques also facilitate the emergence of building blocks that, in turn, give raise to emergent semantics that can be used to give meaning or interpretations to an optimal solution and its components.
29
Saldamli, Levon. "PDEModelica - Towards a High-Level Language for Modeling with Partial Differential Equations." Licentiate thesis, Linköping University, Linköping University, PELAB - Programming Environment Laboratory, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5732.
Full textAbstract:
This thesis describes initial language extensions to the Modelica language to define a more general language called PDEModelica, with built-in support for modeling with partial differential equations (PDEs). Modelica® is a standardized modeling language for objectoriented, equation-based modeling. It also supports component-based modeling where existing components with modified parameters can be combined into new models. The aim of the language presented in this thesis is to maintain the advantages of Modelica and also add partial differential equation support.
Partial differential equations can be defined using a coefficient-based approach, where a predefined PDE is modified by changing its coefficient values. Language operators to directly express PDEs in the language are also discussed. Furthermore, domain geometry description is handled and language extensions to describe geometries are presented. Boundary conditions, required for a complete PDE problem definition, are also handled.
A prototype implementation is described as well. The prototype includes a translator written in the relational meta-language, RML, and interfaces to external software such as mesh generators and PDE solvers, which are needed to solve PDE problems. Finally, a few examples modeled with PDEModelica and solved using the prototype are presented.
Report code: LiU-Tek-Lic-2002:63.
30
Prastowo, Tadeus. "Toward C++ as a Platform for Language-Oriented Programming: On the Embedding of a Model-Based Real-Time Language." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/256168.
Full textAbstract:
Cyber-physical systems are dynamic physical systems that are controlled by computers for their safe and sound operations (e.g., cars, satellites, robots, elevators, and many others). Consequently, the programs running cyber-physical systems have real-time requirements, which require the programs to compute not only correctly but also timely because dynamic physical systems need to move to correct positions within certain duration to ensure safe and sound operations. To satisfy real-time requirements in better ways, many real-time languages have been proposed in the literature. Nevertheless, the general-purpose non-real-time languages C and C++ have remained the de facto languages to program cyber-physical systems, including Mars rovers and F-35 jet fighters. Given this reality, the better ways to satisfy real-time requirements have been the use of model-based tools (e.g., MATLAB/Simulink) that allow cyber-physical systems to be designed by modeling and simulating them and the resulting models to be translated automatically to C programs. Model-based tools, however, leave the resulting C programs for manual integration with other C/C++ programs, such as legacy/third-party device drivers and libraries. Since manual integration could slip in some inconsistencies, which proved fatal in the maiden flight of Ariane-5 rocket, this work shows how the standard features of C++, which support active libraries, can be used to embed a model-based real-time language, called Tice, as a C++ active library that can be used to declaratively express models of real-time systems that are processable by off-the-shelf standard C++ compilers (e.g., GCC and Clang) that automatically not only translate the models into C/C++ programs but also check both the validity of the models and the consistency of the models with other C/C++ programs. Furthermore, being compilable by off-the-shelf standard C++ compilers also sets Tice apart from other real-time languages already proposed in the literature because the other languages require either their own special compilers/interpreters or non-standard C/C++ compilers. Consequently, while Tice itself either uses no C++ features that are unsuitable for cyber-physical systems (e.g., exception) or uses some in judicious manner (e.g., template instantiations to generate programs), Tice prevents no usage that is permitted by standard C++ compilers. Beside that, as C++ active libraries are indeed ordinary C++ libraries, C++ active libraries are seamlessly composable as ordinary C++ libraries, and therefore, as models play an increasingly important role in software engineering, this work shows the potential of C++ as a platform for language-oriented programming where different languages that express different kinds of models and are embedded as C++ active libraries could be composed seamlessly.
31
Home, Ortiz Juan Manuel. "Análise comparativa de um modelo de programação convexa e meta-heurística para o planejamento de redes de distribuição de energia elétrica com fontes de geração distribuída renováveis e não renováveis /." Ilha Solteira, 2019. http://hdl.handle.net/11449/180928.
Full textAbstract:
Orientador: José Roberto Sanches MantovaniResumo: Neste trabalho propõem-se formulações matemáticas e metodologias para resolver o problema de planejamento da expansão e operação de sistemas de distribuição de energia elétrica de longo prazo com instalação de geração distribuída despachável, renovável e dispositivos armazenadores de energia, considerando as incertezas nos parâmetros e variáveis envolvidas no comportamento do sistema. No modelo de otimização desenvolvido considera- se uma formulação com espaço de busca convexo como um problema de programação cônica inteira de segunda ordem. Como primeira metodologia de solução para o modelo matemático proposto, usam-se solvers de otimização comerciais através de linguagem de programação matemática. Em segundo lugar é proposta a técnica de otimização meta-heurística VND combinada com um solver de otimização para resolver o modelo de otimização desenvolvido. Os algoritmos e modelos matemáticos de otimização usados para resolver o planejamento de sistemas de distribuição são implementados em AMPL e testados em sistemas presentes na literatura. Finalmente são comparadas as metodologias segundo a solução obtida e desempenho em tempo computacional.
Abstract: This work proposes mathematical formulations and methodologies to solve the long-term electric power distribution system operation and expansion planning with distributed renewable energy sources and energy storage devices, considering the uncertainties in the involved parameters and variables in the system behavior. In the developed optimization model, a convex formulation is considered as integer second-order conic programming problem. The first solution methodology for the proposed mathematical model, the commercial optimization solvers that uses mathematical modelling language is used. In the second way, the VND meta-heuristic optimization technique is proposed combined with the optimization solver to analyze the obtained solutions of the search through optimal neighborhoods. The mathematical optimization model and the proposed algorithm used to solver the planning of distribution systems are implemented in AMPL and tested in literature’s systems. Finally, the methodologies according to the obtained solution and computational time performance are compared.
Doutor
32
Paçacı, Görkem. "Representation of Compositional Relational Programs." Doctoral thesis, Uppsala universitet, Informationssystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-317084.
Full textAbstract:
Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. A promising method of Inductive Synthesis, CombInduce, which is particularly suitable for synthesizing recursive programs, is a candidate for improvements in usability as the target language Combilog is not user-friendly. The method requires the target language to be strictly compositional, hence devoid of variables, yet have the expressiveness of definite clause programs. This sets up a challenging problem for establishing a user-friendly but equally expressive target language. Alternatives to Combilog, such as Quine's Predicate-functor Logic and Schönfinkel and Curry's Combinatory Logic also do not offer a practical notation: finding a more usable representation is imperative. This thesis presents two distinct approaches towards more convenient representations which still maintain compositionality. The first is Visual Combilog (VC), a system for visualizing Combilog programs. In this approach Combilog remains as the target language for synthesis, but programs can be read and modified by interacting with the equivalent diagrams instead. VC is implemented as a split-view editor that maintains the equivalent Combilog and VC representations on-the-fly, automatically transforming them as necessary. The second approach is Combilog with Name Projection (CNP), a textual iteration of Combilog that replaces numeric argument positions with argument names. The result is a language where argument names make the notation more readable, yet compositionality is preserved by avoiding variables. Compositionality is demonstrated by implementing CombInduce with CNP as the target language, revealing that programs with the same level of recursive complexity can be synthesized in CNP equally well, and establishing the underlying method of synthesis can also work with CNP. Our evaluations of the user-friendliness of both representations are supported by a range of methods from Information Visualization, Cognitive Modelling, and Human-Computer Interaction. The increased usability of both representations are confirmed by empirical user studies: an often neglected aspect of language design.
33
Branchini, Rodrigo Moretti 1975. "Fleet deployment optimization in liner shipping = Otimização do dimensionamento e roteamento de navios de linha regular com viagens fretadas." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261180.
Full textAbstract:
Orientador: Vinícius Amaral ArmentanoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-22T22:56:34Z (GMT). No. of bitstreams: 1 Branchini_RodrigoMoretti_D.pdf: 2921053 bytes, checksum: 29694a6f4803c5c222c97cbe95a2b199 (MD5) Previous issue date: 2013
Resumo: Este trabalho aborda um problema de planejamento tático em empresas de transporte marítimo de carga que coletam e entregam as demandas contratadas por seus clientes. As viagens associadas a estas demandas são obrigatórias, mas a empresa pode também atender a demandas spot associadas com viagens opcionais para aumentar seu lucro durante um horizonte de tempo de médio prazo. O problema de otimização é formulado como um modelo de programação inteira mista que é definido em um grafo orientado em que nós representam viagens obrigatórias e opcionais. As decisões do modelo são determinar o número e tipo de navios que compõem a frota, designar um navio a um conjunto de viagens obrigatórias e opcionais, definir as rotas de cada navio e estipular os tempos de início de atendimento nos portos para cada viagem. Um algoritmo de busca tabu com uma lista de candidatos e um conjunto de soluções de elite são propostos para resolver instâncias do problema. Os resultados computacionais da busca tabu são comparados com as soluções ótimas e sub-ótimas encontradas pelo CPLEX para o modelo de programação inteira mista
Abstract: We address a tactical planning problem faced by many liner shipping companies that have committed contractual voyages while trying to serve optional spot voyages to increase its revenue over the medium-term horizon. The optimization problem is formulated as a mixed integer programming model that is defined on a directed graph whose nodes represent contractual and spot voyages. The decisions include the number and type of vessels deployed the assignment of vessels to contractual and spot voyages and the determination of vessel routes and schedules in order to maximize the profit. A tabu search algorithm with a candidate list and a pool of elite and diverse solutions is proposed in order to solve a set of benchmark instances of the problem. The results obtained by tabu search are compared to optimal and suboptimal solutions yielded by the CPLEX solver to the mixed integer programming formulation of the problem
Doutorado
Automação
Doutor em Engenharia Elétrica
34
Luche, José Roberto Dale. "Modelos e algoritmos para a otimização do planejamento da produção de grãos eletrofundidos." Universidade Federal de São Carlos, 2011. https://repositorio.ufscar.br/handle/ufscar/3396.
Full textAbstract:
Made available in DSpace on 2016-06-02T19:50:15Z (GMT). No. of bitstreams: 1
4224.pdf: 4088163 bytes, checksum: f36f82cf58386b4174743eccaa446df4 (MD5)
Previous issue date: 2011-02-12The number of successful applications that use optimization models has followed the evolution of the computers, as much in hardware, with more powerful machines, as in software, with more intelligent algorithms. Due to importance of the modeling as a decision support tool, much effort has been made to mathematically describe systems of interest and devise techniques for solving such models. This work presents a detailed description of the operations involved in production planning and control of the electrofused grain industry and proposes the use of exact and heuristic methods to support decisions in such activities, particularly in production scheduling. Several visits were made to companies in this sector and a case study was carried out one of these companies in order to formulate alternatives to increase productivity and improve customer service. Optimizing the production scheduling of electrofused grains is not a simple task mainly because of the scale of the equipment setup times, the diversity of the products, and the narrow orders due dates. Based on the case study, mixed linear programming models that combine known models of process selection and single-stage lot sizing were developed, and a constructive heuristic, local search variants, and a GRASP algorithm were proposed to solve one of the models. Computational results with a real instance and randomly generated instance sets show that the exact methods as well as the heuristics can produce as good or better production scheduling than the ones currently employed by the studied company
O número de aplicações bem sucedidas que utilizam modelos de otimização têm acompanhado a evolução dos computadores, tanto em hardware, com máquinas mais poderosas, como em software, com algoritmos mais inteligentes. Devido à importância da modelagem como ferramenta de apoio à tomada de decisão, muitos trabalhos que exploram formas de representação de problemas e técnicas de solução de modelos vêm sendo desenvolvidos. Este trabalho apresenta uma descrição detalhada das operações envolvidas no planejamento e controle da produção na indústria de grãos eletrofundidos e propõe o uso de modelos e métodos exatos e heurísticos para apoio à tomada de decisões nesta atividade, em particular, na programação da produção. Várias visitas foram realizadas a empresas do setor, e em uma dessas empresas foi empreendido um estudo de caso com o objetivo de formular alternativas para aumento da produtividade e a melhoria do nível de serviço aos clientes. Otimizar a programação da produção de grãos eletrofundidos não é uma tarefa simples, principalmente devido à grandeza dos tempos de preparação dos equipamentos, à diversidade de produtos e às limitações dos prazos de entrega da carteira de pedidos. Com base no estudo de caso, modelos de programação linear inteira mista que combinam modelos clássicos de seleção de processos e dimensionamento de lotes monoestágio foram desenvolvidos, e uma heurística construtiva, duas variantes de busca local, e um algoritmo GRASP foram propostos para resolver um dos modelos. Resultados computacionais com uma instância real e conjuntos de instâncias geradas aleatoriamente indicam que tanto os métodos exatos como heurísticos propostos são capazes de gerar programações da produção tão boas ou melhores do que as atualmente empregadas pela empresa estudada
35
Luscombe, Ruth. "A dynamic real time scheduling methodology for the emergency department." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/86505/1/Ruth_Luscombe_Thesis.pdf.
Full textAbstract:
This project constructs a scheduling solution for the Emergency Department. The schedules are generated in real-time to adapt to new patient arrivals and changing conditions.
An integrated scheduling formulation assigns patients to beds and treatment tasks to resources. The schedule efficiency is assessed using waiting time and total care time experienced by patients. The solution algorithm incorporates dispatch rules, meta-heuristics and a new extended disjunctive graph formulation which provide high quality solutions in a fast time-frame for real time decision support. This algorithm can be implemented in an electronic patient management system to improve patient flow in the Emergency Department.
36
Aroui, Karim. "Séquencement d’une ligne de montage multi-modèles : application à l’industrie du véhicule industriel." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAI029/document.
Full textAbstract:
Dans cette thèse, nous considérons le problème du séquencement sur une ligne de montage multi-modèles de véhicules industriels. Pour équilibrer au mieux la charge dynamique des opérateurs, la minimisation de la somme des retards à l’issue de chaque véhicule est proposée.Deux approches peuvent être utilisées pour optimiser le lissage de charge dans un problème de séquencement : l’utilisation directe des temps opératoires ou le respect de règles. La plupart des travaux appliqués à l’industrie automobile utilisent l’approche de respect de règles. Une originalité de ce travail est d’utiliser l’approche de la prise en compte directe des temps opératoires.L’étude de la littérature de ce problème a dévoilé deux lacunes dans les travaux précédents : l’essentiel des travaux modélisent un seul type d’opérateurs d’une part, et proposent des heuristiques ou des métaheuristiques pour résoudre ces problèmes, d’autre part. L’originalité de ce travail est de tester des méthodes exactes pour des instances industrielles et de modéliser le fonctionnement de trois différents types d’opérateurs spécifiques au cas industriel.Deux méthodes exactes sont développées : la programmation linéaire mixte et la programmation dynamique. Une étude expérimentale des facteurs de complexité sur des instances académiques des deux modèles est développée. Les modèles sont aussi testés sur des instances du cas d’étude.Par ailleurs, le problème est traité par deux méthodes approchées : une heuristique basée sur la programmation dynamique d’une part, et des métaheuristiques (algorithme génétique, recuit simulé et un couplage des deux) d’autre part. Les deux approches sont testées sur des instances académiques et des instances du cas d’étude.Ce travail a permis d’apporter une solution intéressante d’un point de vue industriel puisqu’il prend en compte les caractéristiques de la ligne de montage (opérateurs spécifiques) et améliore significativement la qualité du séquencement en un temps de calcul raisonnableIn this thesis, the problem of sequencing mixed model assembly lines (MMAL) is considered. Our goal is to determine the sequence of products to minimize the work overload. This problem is known as the mixed model assembly line sequencing problem with work overload minimization (MMSP-W). This work is based on an industrial case study of a truck assembly line.Two approaches can be used to minimize the work overload: the use of task operation times or the respect of sequencing rules. Most of the earlier works applied in car industry use the latter approach. The originality of this work is to employ the task operation times for the generation of the product sequence in a MMAL.The literature review has highlighted two main gaps in previous works: most of the papers consider a single type of operators, and propose heuristics or metaheuristics to solve the problem. The originality of this work is to test exact methods for industrial case instances and to model three different types of operators.Two exact methods are developed: the mixed integer linear programming and dynamic programming. The models are tested on industrial case study instances. An experimental study is developed for both approaches in order to understand the complexity factors.Moreover, the problem is treated by two approximate methods: a heuristic based on dynamic programming and metaheuristics (genetic algorithm, simulated annealing and a hybrid method based on both genetic algorithm and simulated annealing). All approaches are tested on academic instances and on real data from the industrial case study
37
Chazara, Philippe. "Outils d'élaboration de stratégie de recyclage basée sur la gestion des connaissances : application au domaine du génie des procédés." Thesis, Toulouse, INPT, 2015. http://www.theses.fr/2015INPT0141/document.
Full textAbstract:
Dans ce travail, une étude est réalisée sur le développement d'une méthodologie permettant la génération et l'évaluation de nouvelles trajectoires de valorisation pour des déchets. Ainsi, pour répondre à cette problématique, trois sous problèmes ont été identifiés. Le premier concerne un cadre de modélisation permettant la représentation structurée et homogène de chaque trajectoire, ainsi que les indicateurs choisis pour l'évaluation de ces dernières, permettant une sélection ultérieure. Le deuxième se concentre sur le développement d'une méthodologie puis la réalisation d'un outil permettant la génération de nouvelles trajectoires en s'appuyant sur d'autres connues. Enfin, le dernier sous problème concerne le développement d'un second outil développé pour modéliser et estimer les trajectoires générées. La partie de création d'un cadre de modélisation cherche à concevoir des structures globales qui permettent la catégorisation des opérations unitaires sous plusieurs niveaux. Trois niveaux de décomposition ont été identifiés. La Configuration générique de plus haut niveau, qui décrit la trajectoire sous de grandes étapes de modélisation. Le second niveau, Traitement générique propose des ensembles de structures génériques de traitement qui apparaissent régulièrement dans les trajectoires de valorisation. Enfin, le plus bas niveau se focalise sur la modélisation des opérations unitaires. Un second cadre a été créé, plus conceptuel et comportant deux éléments : les blocs et les systèmes. Ces cadres sont ensuite accompagnés par un ensemble d'indicateurs choisis à cet effet. Dans une volonté d'approche de développement durable, un indicateur est sélectionné pour chacune de des composantes : économique, environnemental et social. Dans notre étude, l'impact social se limite à l'estimation du nombre d'emplois créés. Afin de calculer cet indicateur, une nouvelle approche se basant sur les résultats économiques d'une entreprise a été proposée et validée.L'outil de génération de nouvelles trajectoires s'appuie sur l'utilisation de la connaissance en utilisant un système de raisonnement à partir de cas (RàPC). Pour être adapté à notre problématique, la mise en œuvre de ce dernier a impliqué la levée de plusieurs points délicats. Tout d'abord, la structuration des données et plus largement la génération de cas sources sont réalisées par un système basé sur des réseaux sémantiques et l'utilisation de mécanismes d'inférences. Le développement d'une nouvelle méthode de mesure de similarité est réalisé en introduisant la notion de définition commune qui permet de lier les états, qui sont des descriptions de situations, à des états représentant des définitions générales d'un ensemble d'états. Ces définitions communes permettent la création d'ensembles d'états sous différents niveaux d'abstraction et de conceptualisation. Enfin, un processus de décompositions des trajectoires est réalisé afin de résoudre un problème grâce à la résolution de ses sous-problèmes associés. Cette décomposition facilite l'adaptation des trajectoires et l'estimation des résultats des transformations. Basé sur cette méthode, un outil a été développé en programmation logique, sous Prolog. La modélisation et l'évaluation des voies de valorisation se fait grâce à la création d'outil spécifique. Cet outil utilise la méta-programmation permettant la réalisation dynamique de modèle de structure. Le comportement de ces structures est régi par la définition de contraintes sur les différents flux circulants dans l'ensemble de la trajectoire. Lors de la modélisation de la trajectoire, ces contraintes sont converties par un parser permettant la réalisation d'un modèle de programmation par contraintes cohérent. Ce dernier peut ensuite être résolu grâce à des solveurs via une interface développée et intégrée au système. De même, plusieurs greffons ont été réalisés pour analyser et évaluer les trajectoires à l'aide des critères retenusIn this work, a study is realised about the creation of a new methodology allowing the generation and the assessment of new waste recovery processes. Three elements are proposed for that. The first one is the creation of a modelling framework permitting a structured and homogeneous representation of each recovery process and the criteria used to asses them. The second one is a system and a tool generating new recovery processes from others known. Finally, the last element is another tool to model, to estimate and to asses the generated processes. The creation of a modelling framework tries to create some categories of elements allowing the structuring of unit operations under different levels of description. Three levels have been identified. In the higher level, the Generic operation which describes global structure of operations. The second one is Generic treatment which is an intermediate level between the two others. It proposes here too categories of operations but more detailed than the higher level. The last one is the Unit operation. A second framework has been created. It is more conceptual and it has two components : blocs and systems. These frameworks are used with a set of selected indicators. In a desire of integrating our work in a sustainable development approach, an indicator has been chosen for each of its components: economical, environmental and social. In our study, the social impact is limited to the number of created jobs. To estimate this indicator, we proposed a new method based on economical values of a company. The tool for the generation of new waste recovery processes used the methodology of case-based reasoning CBR which is based on the knowledge management. Some difficult points are treated here to adapt the CBR to our problem. The structuring of knowledge and generally the source case generation is realised by a system based on connections between data and the use of inference mechanisms. The development of a new method for the similarity measure is designed with the introduction of common definition concept which allows linking states, simply put description of objects, to other states under different levels of conceptualizations and abstractions. This point permits creating many levels of description. Finally, recovery process is decomposed from a main problem to some sub-problems. This decomposition is a part of the adaptation mechanism of the selected source case. The realisation of this system is under logic programming with Prolog. This last one permits the use of rules allowing inferences and the backtracking system allowing the exploration to the different possible solution. The modelling and assessment of recovery processes are done by a tool programmed in Python. It uses the meta-programming to dynamically create model of operations or systems. Constraint rules define the behaviour of these models allowing controlling the flux circulating in each one. In the evaluation step, a parser is used to convert theses rules into a homogeneous system of constraint programming. This system can be solved by the use of solvers with an interface developed for that and added to the tool. Therefore, it is possible for the user to add solvers but also to add plug-ins. This plug-ins can make the assessment of the activity allowing to have different kinds of evaluation for the same criteria. Three plug-ins are developed, one for each selected criterion. These two methods are tested to permit the evaluation of the proposed model and to check the behaviour of them and their limits . For these tests, a case-base on waste has been created Finally, for the modelling and assessment tool, a study case about the recovery process of used tyres in new raw material is done
38
Salimi-Khorshidi, Gholamreza. "Statistical models for neuroimaging meta-analytic inference." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:40a10327-7f36-42e7-8120-ae04bd8be1d4.
Full textAbstract:
A statistical meta-analysis combines the results of several studies that address a set of related research hypotheses, thus increasing the power and reliability of the inference. Meta-analytic methods are over 50 years old and play an important role in science; pooling evidence from many trials to provide answers that any one trial would have insufficient samples to address. On the other hand, the number of neuroimaging studies is growing dramatically, with many of these publications containing conflicting results, or being based on only a small number of subjects. Hence there has been increasing interest in using meta-analysis methods to find consistent results for a specific functional task, or for predicting the results of a study that has not been performed directly. Current state of neuroimaging meta-analysis is limited to coordinate-based meta-analysis (CBMA), i.e., using only the coordinates of activation peaks that are reported by a group of studies, in order to "localize" the brain regions that respond to a certain type of stimulus. This class of meta-analysis suffers from a series of problems and hence cannot result in as accurate results as desired. In this research, we describe the problems that existing CBMA methods are suffering from and introduce a hierarchical mixed-effects image-based metaanalysis (IBMA) solution that incorporates the sufficient statistics (i.e., voxel-wise effect size and its associated uncertainty) from each study. In order to improve the statistical-inference stage of our proposed IBMA method, we introduce a nonparametric technique that is capable of adjusting such an inference for spatial nonstationarity. Given that in common practice, neuroimaging studies rarely provide the full image data, in an attempt to improve the existing CBMA techniques we introduce a fully automatic model-based approach that employs Gaussian-process regression (GPR) for estimating the meta-analytic statistic image from its corresponding sparse and noisy observations (i.e., the collected foci). To conclude, we introduce a new way to approach neuroimaging meta-analysis that enables the analysis to result in information such as “functional connectivity” and networks of the brain regions’ interactions, rather than just localizing the functions.
39
Dornelles, Arton Pereira. "A matheuristic approach for solving the high school timetabling problem." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/140451.
Full textAbstract:
A geração de quadros de horários escolares é um problema clássico de otimização que tem sido largamente estudado devido a sua importâncias prática e teórica. O problema consiste em alocar um conjunto de aulas entre professor-turma em períodos de tempo pré-determinados, satisfazendo diferentes tipos de requisitos. Devido a natureza combinatória do problema, a resolução de instâncias médias e grandes torna-se uma tarefa desafiadora. Quando recursos são escassos, mesmo uma solução factível pode ser difícil de ser encontrada. Várias técnicas tem sido propostas na literatura científica para resolver o problema de geração de quadros de horários escolares, no entanto, métodos robustos ainda não existem. Visto que o uso de métodos exatos, como por exemplo, técnicas de programação matemática, não podem ser utilizados na prática, para resolver instâncias grandes da realidade, meta-heurísticas e meta-heurísticas híbridas são usadas com frequência como abordagens de resolução. Nesta pequisa, são desenvolvidas técnicas que combinam programação matemática e heurísticas, denominadas mateheurísticas, para resolver de maneira eficiente e robusta algumas variações de problemas de geração de quadros de horários escolares. Embora neste trabalho sejam abordados problemas encontrados no contexto de instituições brasileiras, os métodos propostos também podem ser aplicados em problemas similares oriundo de outros países.The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial nature of this problem, solving medium and large instances of timetabling to optimality is a challenging task. When resources are tight, it is often difficult to find even a feasible solution. Several techniques have been developed in the scientific literature to tackle the high school timetabling problem, however, robust solvers do not exist yet. Since the use of exact methods, such as mathematical programming techniques, is considered impracticable to solve large real world instances, metaheuristics and hybrid metaheuristics are the most used solution approaches. In this research we develop techniques that combine mathematical programming and heuristics, so-called matheuristics, to solve efficiently and in a robust way some variants of the high school timetabling problem. Although we pay special attention to problems arising in Brazilian institutions, the proposed methods can also be applied to problems from different countries.
40
Reis, Jorge Von Atzingen dos. "Meta-heurísticas baseadas em busca em vizinhança variável aplicadas a problemas de operação de transportes." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-22092014-150121/.
Full textAbstract:
Esta pesquisa trata da aplicação de meta-heurísticas baseadas em busca em vizinhança variável em problemas de operação de transportes. Desta forma, buscou-se encontrar problemas complexos durante a operação de sistemas de transportes, nas grandes cidades, que possam ser resolvidos com a aplicação de meta-heurística baseada em busca em vizinhança variável. Este trabalho aborda dois diferentes problemas de planejamento e operação de transportes. O primeiro problema abordado neste trabalho é o Problema de Programação da Tabela de Horários, de Veículos e de Tripulantes de Ônibus, no qual as viagens que comporão a tabela de horários, os veículos que executarão as viagens e as tripulações que operarão os veículos são alocadas simultaneamente e de maneira integrada. O segundo problema a ser abordado é o problema de distribuição física, o qual envolve o agrupamento e a alocação de entregas a uma frota de veículos visando minimizar o frete total. Uma abordagem para a modelagem matemática deste problema é modelar como um problema de bin-packing, com bins de tamanho variável unidimensional (do inglês Variable Sized Bin-Packing Problem - VSBPP), ou seja, uma generalização do tradicional problema de bin-packing no qual bins (veículos) de diferentes capacidades e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), de modo que o custo total dos bins (veículos) utilizados seja mínimo. A outra abordagem proposta para o problema de distribuição física é modelar o problema como um problema de bin-packing, com bins de tamanho variável bidimensional (do inglês Bidimensional Variable Sized Bin-Packing Problem BiD-VSBPP). Assim sendo, trata-se de uma expansão do problema de bin-packing com bins de tamanho variável unidimensional (VSBPP), no qual bins (veículos) de diferentes capacidades (capacidade volumétrica e capacidade de carga) e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), os quais possuem as dimensões peso e volume, de modo que o custo total dos bins (veículos) utilizados seja mínimo. Durante a realização deste trabalho, foi desenvolvido um programa computacional em C++, o qual implementa a meta-heurística Busca em Vizinhança Variável (VNS) e duas meta-heurísticas baseadas em VNS. São apresentados resultados de experimentos computacionais com dados reais e dados benchmarking. Os resultados obtidos comprovam a eficácia das meta-heurísticas propostas.This work approaches variable neighborhood search meta-heuristic applicate on transport operation problems. This way, we sought find complex transport operation problems in large cities that can be solved with the variable neighborhood search meta-heuristic application. This work approaches two different transport planning and operation problems. The first problem approached in this paper is the Bus Timetable Vehicle Crew Scheduling Problem, in which timetabling, bus and crew schedules are simultaneously determined in an integrated approach. The second problem to be approached is the physical distribution problem which comprises grouping and assigning deliveries to a heterogeneous fleet of vehicles aiming to minimize the total freight cost. The problem can be mathematical modeled as one-dimensional Variable Sized Bin-Packing Problem (VSBPP), a generalization of the traditional bin-packing problem, in which bins (vehicles) with different sizes and costs are available for the assignment of the objects (deliveries) such that the total cost of the used bins (vehicles) is minimized. Another proposed approach to the problem of physical distribution is model as two dimensional Variable Sized Bin-Packing Problem (BiD-VSBPP). Therefore, it is an expansion of the bin-packing problem with bins variable-length-dimensional (VSBPP), in which bins (vehicle) of different capacity (capacity and load carrying capacity) and costs are available for allocation a set of objects (loads), which have the dimensions weight and volume, so that minimized the total cost of bins (vehicle). In this work, was developed a C++ software implemented, which was implemented a meta-heuristic Variable Neighborhood Search (VNS) and two others meta-heuristics based on VNS. Computational results for real-world problems and benchmarking problems are presented, showing the effectiveness of these proposed meta-heuristics.
41
Stratton, David. "A program visualisation meta language." Thesis, University of Ballarat, 2003. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63588.
Full textAbstract:
The principle motivation of this work is to define an open PV architecture that will enable a variety of visualisation schemes to interoperate and that will encourage the generation of PV systems and research into their efficacy. Ultimately this may lead to more effective pedagogy in the field of computer programming and hence remove a barrier to students entering the profession.Doctorate of Philosophy
42
Saidani, Tarik. "Optimisation multi-niveau d’une application de traitement d’images sur machines parallèles." Thesis, Paris 11, 2012. http://www.theses.fr/2012PA112268/document.
Full textAbstract:
Cette thèse vise à définir une méthodologie de mise en œuvre d’applications performantes sur les processeurs embarqués du futur. Ces architectures nécessitent notamment d’exploiter au mieux les différents niveaux de parallélisme (grain fin, gros grain) et de gérer les communications et les accès à la mémoire. Pour étudier cette méthodologie, nous avons utilisé un processeur cible représentatif de ces architectures émergentes, le processeur CELL. Le détecteurde points d’intérêt de Harris est un exemple de traitement régulier nécessitant des unités de calcul intensif. En étudiant plusieurs schémas de mise en oeuvre sur le processeur CELL, nous avons ainsi pu mettre en évidence des méthodes d’optimisation des calculs en adaptant les programmes aux unités spécifiques de traitement SIMD du processeur CELL. L’utilisation efficace de la mémoire nécessite par ailleurs, à la fois une bonne exploitation des transferts et un arrangement optimal des données en mémoire. Nous avons développé un outil d’abstraction permettant de simplifier et d’automatiser les transferts et la synchronisation, CELL MPI. Cette expertise nous a permis de développer une méthodologie permettant de simplifier la mise en oeuvre parallèle optimisée de ces algorithmes. Nous avons ainsi conçu un outil de programmation parallèle à base de squelettes algorithmiques : SKELL BE. Ce modèle de programmation propose une solution originale de génération d’applications à base de métaprogrammation. Il permet, de manière automatisée, d’obtenir de très bonnes performances et de permettre une utilisation efficace de l’architecture, comme le montre la comparaison pour un ensemble de programmes test avec plusieurs autres outils dédiés à ce processeurThis thesis aims to define a design methodology for high performance applications on future embedded processors. These architectures require an efficient usage of their different level of parallelism (fine-grain, coarse-grain), and a good handling of the inter-processor communications and memory accesses. In order to study this methodology, we have used a target processor which represents this type of emerging architectures, the Cell BE processor.We have also chosen a low level image processing application, the Harris points of interest detector, which is representative of a typical low level image processing application that is highly parallel. We have studied several parallelisation schemes of this application and we could establish different optimisation techniques by adapting the software to the specific SIMD units of the Cell processor. We have also developped a library named CELL MPI that allows efficient communication and synchronisation over the processing elements, using a simplified and implicit programming interface. This work allowed us to develop a methodology that simplifies the design of a parallel algorithm on the Cell processor.We have designed a parallel programming tool named SKELL BE which is based on algorithmic skeletons. This programming model providesan original solution of a meta-programming based code generator. Using SKELL BE, we can obtain very high performances applications that uses the Cell architecture efficiently when compared to other tools that exist on the market
43
Tian, Zhong Huan. "Gender based meta-heuristic optimization algorithms." Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691331.
Full text
44
Azevedo, Regina Maria. ""Programação neurolinguística: transformação e persuasão no metamodelo"." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/27/27142/tde-01122006-173633/.
Full textAbstract:
Neste estudo apresentamos as origens da Programação Neurolingüística (PNL), seus principais fundamentos, pressupostos teóricos e objetivos; analisamos o metamodelo, sua relação com a linguagem e sua exploração por meio do processo de modelagem, a partir do enfoque presente na obra A estrutura da magia I: um livro sobre linguagem e terapia, de Richard Bandler e John Grinder, idealizadores da PNL. Examinamos as transformações obtidas mediante o processo de derivação, com base na Gramática Gerativo-Transformacional de Noam Chomsky, objetivando verificar sua relação com o metamodelo. Explorando o discurso do Sujeito submetido ao processo de modelagem, verificamos em que medida os novos conteúdos semânticos revelados pelas transformações poderiam influenciá-lo, a ponto de mudar sua visão de mundo. Para esta análise, investigamos ainda as teorias clássicas da Argumentação, em especial os conceitos de convicção e persuasão, constatando que a modelagem oferece ao Sujeito recursos para ampliar seu repertório lingüístico, apreender novos significados a partir de seus próprios enunciados e, por meio da deliberação consigo mesmo, convencer-se e persuadir-se.This study aims at presenting the origins of the Neuro-Linguistic Programming (NLP), its main ideas, theoretical presuppositions and goals. Furthermore, it will be analyzed the meta-model, its relationship with language and its exploitation through the modeling process, all based on the book The structure of magic I: a book about language and therapy, by Richard Bandler and John Grinder, the founders of NLP. Moreover, it will be examined the transformations obtained from the derivation process, based on Noam Chomsky´s Transformational-generative grammar, with the goal of verifying its relationship with the meta-model. When exploiting the subject´s discourse submitted for the process of modeling, it will be verified in which way the new semantic contents revealed by the transformations could influence that subject and made him alter his vision of the world. For this analysis, it will be investigated also the classic theories of Argumentation, especially the conviction and persuasion concepts. It will also be verified that the process of modeling can offer resources to the subject, for him to enhance his linguistic vocabulary, to learn new meanings from his own sentences and to be able to persuade and convince himself through deliberating with his inner self.
45
Behrooz, A. "Meta description of experimental identification of medical knowledge." Thesis, Brunel University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373085.
Full text
46
Pell, Barney Darryl. "Strategy generation and evaluation for meta-game playing." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308363.
Full text
47
Waldring, Ségio Jim. "Standard network diagramming language and corresponding meta-model." Click here to access thesis, 2009. http://www.georgiasouthern.edu/etd/archive/spring2008/segio_j_waldring/waldring_segio_j_200901_msm.pdf.
Full textAbstract:
Thesis (M.S.)--Georgia Southern University, 2009."A thesis submitted to the Graduate Faculty of Georgia Southern University in partial fulfillment of the requirements for the degree Master of Science." Directed by Vladan Jovanovic. ETD. Includes bibliographical references (p. 31-34) and appendix.
48
Ferdjoukh, Adel. "Une approche déclarative pour la génération de modèles." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT325/document.
Full textAbstract:
Disposer de données dans le but de valider ou tester une approche ou un concept est d'une importance primordiale dans beaucoup de domaines différents. Malheureusement, ces données ne sont pas toujours disponibles, sont coûteuses à obtenir, ou bien ne répondent pas à certaines exigences de qualité ce qui les rend inutiles dans certains cas de figure.Un générateur automatique de données est un bon moyen pour obtenir facilement et rapidement des données valides, de différentes tailles, pertinentes et diversifiées. Dans cette thèse, nous proposons une nouvelle approche complète, dirigée par les modèles et basée sur la programmation par contraintes pour la génération de donnéesOwning data is useful in many different fields. Data can be used to test and to validate approaches, algorithms and concepts. Unfortunately, data is rarely available, is cost to obtain, or is not adapted to most of cases due to a lack of quality.An automated data generator is a good way to generate quickly and easily data that are valid, in different sizes, likelihood and diverse.In this thesis, we propose a novel and complete model driven approach, based on constraint programming for automated data generation
49
Fleming, Robert Renka Robert Joseph. "General purpose programming on modern graphics hardware." [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-6112.
Full text
50
Meuth, Ryan James. "Meta-learning computational intelligence architectures." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Meuth_09007dcc80722172.pdf.
Full textAbstract:
Thesis (Ph. D.)--Missouri University of Science and Technology, 2009.Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed January 5, 2010) Includes bibliographical references (p. 152-159).