Relevant bibliographies by topics / Procedural programming / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Procedural programming.

Dissertations / Theses on the topic 'Procedural programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Procedural 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

Sutyanyong, Nattavut. "Procedural abstraction in a relational database programming language." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=55531.

Full text
Abstract:
This thesis introduces the notion of procedural abstraction in a relational database system. Procedures are treated as special forms of relations, and called computations.
Like relations, a computation is defined over a set of attributes. Subset of attributes can be defined as input attributes and the remaining attributes are output. Beyond the notion of procedures that a procedure can have only one set of input and output parameters, computations are symmetric: a computation may have a number of different subsets of input attributes.
Computations can be recursive and called by other computations.
States are introduced so that computations can remember values from previous evaluation and use them in next invocations. Stateful computations may be instantiated to have new sets of states.
This thesis contains the design and implementation of a parser for compiling computations as well as operations to evaluate them. All operations are coincident with relational algebra, a set of operations for manipulating relations.
APA, Harvard, Vancouver, ISO, and other styles
2

Harman, Mark. "Functional models of procedural programs." Thesis, London Metropolitan University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315232.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Moens, Theodore Warren Bernelot. "Approaches to procedural adequacy in logic programming using connection graphs." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26499.

Full text
Abstract:
Kowalski's connection graph method provides a representation for logic programs which allows for the incorporation of better procedural control techniques than standard logic programming languages. A proposed search strategy for visual recognition which combines top-down and bottom-up techniques has been incorporated in a connection graph implementation. The connection graph representation also allows for the natural incorporation of constraint satisfaction techniques in logic programming. Kowalski's approach to incorporating constraint satisfaction techniques in connection graphs is examined in detail. It is shown that his approach is not efficient enough to be used as a general preprocessing algorithm but that a modified version may be of use. Increased control of search and the incorporation of consistency techniques increase the procedural adequacy of logic programs for representing knowledge without compromising the descriptive capacity of the form.
Science, Faculty of
Computer Science, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Dianhuan. "Logic programs as declarative and procedural bias in inductive logic programming." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24553.

Full text
Abstract:
Machine Learning is necessary for the development of Artificial Intelligence, as pointed out by Turing in his 1950 article ``Computing Machinery and Intelligence''. It is in the same article that Turing suggested the use of computational logic and background knowledge for learning. This thesis follows a logic-based machine learning approach called Inductive Logic Programming (ILP), which is advantageous over other machine learning approaches in terms of relational learning and utilising background knowledge. ILP uses logic programs as a uniform representation for hypothesis, background knowledge and examples, but its declarative bias is usually encoded using metalogical statements. This thesis advocates the use of logic programs to represent declarative and procedural bias, which results in a framework of single-language representation. We show in this thesis that using a logic program called the top theory as declarative bias leads to a sound and complete multi-clause learning system MC-TopLog. It overcomes the entailment-incompleteness of Progol, thus outperforms Progol in terms of predictive accuracies on learning grammars and strategies for playing Nim game. MC-TopLog has been applied to two real-world applications funded by Syngenta, which is an agriculture company. A higher-order extension on top theories results in meta-interpreters, which allow the introduction of new predicate symbols. Thus the resulting ILP system Metagol can do predicate invention, which is an intrinsically higher-order logic operation. Metagol also leverages the procedural semantic of Prolog to encode procedural bias, so that it can outperform both its ASP version and ILP systems without an equivalent procedural bias in terms of efficiency and accuracy. This is demonstrated by the experiments on learning Regular, Context-free and Natural grammars. Metagol is also applied to non-grammar learning tasks involving recursion and predicate invention, such as learning a definition of staircases and robot strategy learning. Both MC-TopLog and Metagol are based on a 'top'-directed framework, which is different from other multi-clause learning systems based on Inverse Entailment, such as CF-Induction, XHAIL and IMPARO. Compared to another 'top'-directed multi-clause learning system TAL, Metagol allows the explicit form of higher-order assumption to be encoded in the form of meta-rules.
APA, Harvard, Vancouver, ISO, and other styles
5

Humphrey, Matthew Cameron. "Comparison of an object-oriented programming language to a procedural programming language for effectiveness in program maintenance." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/45161.

Full text
Abstract:

New software tools and methodologies make claims that managers often believe intuitively without evidence. Many unsupported claims have been made about object-oriented programming. However, without rigorous scientific evidence, it is impossible to accept these claims as valid. Although experimentation has been done in the past, most of the research is very recent and the most relevant research has serious drawbacks. This study attempts to empirically verify the claim that object-oriented languages produce programs that are more easily maintained than those programmed with procedural languages. Measurements of subjects performing maintenance tasks onto two identical programs, one object-oriented and the other procedure-oriented show the object-oriented version to be more maintainable.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles
6

Lundberg, Mattis, and Pontus Österdahl. "Java programming paradigm comprehensibility: Proceduralversus Reactive." Thesis, Mittuniversitetet, Institutionen för data- och systemvetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-43168.

Full text
Abstract:
Software developers spend more time on reading than writingcode. Comprehensible code therefore has the potential tosignificantly improve software development andmaintenance by lowering the time needed for understandingexisting code. Previous research suggest that the choice ofProgramming paradigm may affect code comprehension. Thepresent study evaluates if a positive effect of ReactiveProgramming on comprehension can be attested incomparison to Procedural Programming. We let human testsubjects solve bugs in code-snippets of commonfunctionalities implemented either according to ReactiveProgramming or Procedural Programming in the Javalanguage and RxJava, its ReactiveX implementation. Thecomprehensibility of the code is measured by the test subjects’time consumption, with lower values indicating highercomprehensibility and higher values lowercomprehensibility.Within this study we also study the effect of prior knowledgeof reactive programming, and background in programming,on the results, by having test subjects from two groups: (1)software students with experience in Reactive Programming,and (2) experienced software developers and engineers withless experience in Reactive Programming.All tests took part in a tool of our design, the CodeComparator.Our results show that reactive puzzles are solved faster,suggesting higher comprehensibility, although highdispersion in solvability time, especially for the proceduralsolutions, make it difficult to assess the validity of this timedifference. The positive effect is notable in the student groupwhereas we cannot conclude if the other group solves reactiveor procedural puzzles faster
APA, Harvard, Vancouver, ISO, and other styles
7

Araújo, Cristiano Werner. "Bug prediction in procedural software systems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/170023.

Full text
Abstract:
Informação relacionada a concertos de bugs tem sido explorada na construção de preditores de bugs cuja função é o suporte para a verificação de sistemas de software identificando quais elementos, como arquivos, são mais propensos a bugs. Uma grande variedade de métricas estáticas de código e métricas de mudança já foi utilizada para construir tais preditores. Dos muitos preditores de bugs propostos, a grande maioria foca em sistemas orientados à objeto. Apesar de orientação a objetos ser o paradigma de escolha para a maioria das aplicações, o paradigma procedural ainda é usado em várias — muitas vezes cruciais — aplicações, como sistemas operacionais e sistemas embarcados. Portanto, eles também merecem atenção. Essa dissertação extende o trabalho na área de predição de bugs ao avaliar e aprimorar preditores de bugs para sistemas procedurais de software. Nós proporcionamos três principais contribuições: (i) comparação das abordagens existentes de predição de bugs no contexto de sistemas procedurais, (ii) proposta de uso dos atributos de qualidade de software como atributos de predição no contexto estudado e (iii) avaliação dos atributos propostos em conjunto com a melhor abordagem encontrada em (i). Nosso trabalho provê, portanto, fundamentos para melhorar a performance de preditores de bugs no contexto de sistemas procedurais.
Information regarding bug fixes has been explored to build bug predictors, which provide support for the verification of software systems, by identifying fault-prone elements, such as files. A wide range of static and change metrics have been used as features to build such predictors. Many bug predictors have been proposed, and their main target is objectoriented systems. Although object-orientation is currently the choice for most of the software applications, the procedural paradigm is still being used in many—sometimes crucial—applications, such as operating systems and embedded systems. Consequently, they also deserve attention. This dissertation extends work on bug prediction by evaluating and tailoring bug predictors to procedural software systems. We provide three key contributions: (i) comparison of bug prediction approaches in context of procedural software systems, (ii) proposal of the use of software quality features as prediction features in the studied context, and (iii) evaluation of the proposed features in association with the best approach found in (i). Our work thus provides foundations for improving the bug prediction performance in the context of procedural software systems.
APA, Harvard, Vancouver, ISO, and other styles
8

MacHaffie, Scott Andrew. "Difficulties Experienced Procedural Programmers Encounter When Transferring to an Object-oriented Programming Paradigm." PDXScholar, 1993. https://pdxscholar.library.pdx.edu/open_access_etds/4621.

Full text
Abstract:
Experienced procedural programmers seem to have difficulty when transferring from a procedural language to an object-oriented language. The problem is how to assist the experienced procedural programmers to make this shift. The long term goal of this research is to identify areas where programmers have problems and to develop an automated system to help them overcome these difficulties. This study examines the class designs produced by procedural programmers and the effect of specifications and domain knowledge on class designs. Two types of specifications were used: those written from a procedural point of view which emphasized the functions and those written from an object-oriented view which highlights the domain entities. In addition, the problem specifications were selected from three different domains in order to assess the effect of domain familiarity. Data was collected using paper and pencil designs and through verbal protocols. The class designs were analyzed to see if the different types produced could be classified and to determine the effect of specification type and domain knowledge.
APA, Harvard, Vancouver, ISO, and other styles
9

Vasilopoulos, Ioannis Vasileiou. "The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students." Thesis, Teesside University, 2014. http://hdl.handle.net/10149/347149.

Full text
Abstract:
This thesis reports a research project that aims to improve the teaching and learning of introductory programming from a pedagogical and psychological viewpoint. Towards this aim, seven principles for designing educational programming tools for novices were identified by reviewing literature regarding novices’ difficulties and using a theoretical framework defined by the psychological theories of Constructivism and Cognitive Load Theory. This set of design principles was not only theoretically identified, but its pedagogical impact was also empirically tested. For this reason, Koios, a new programming tool, was designed and developed as a manifestation of the combined set of principles. Empirical studies were conducted by a way of a quasi-experimental design in two different Greek secondary-education institutions. The independent variable was compliance with the set of the seven principles. Students’ level of programming skills (procedural knowledge) was the dependent variable, while the quality of their mental models in the domain of introductory programming (declarative knowledge) was the potential mediator. The effect of compliance with the set of principles on students’ programming skills and mental-model quality was explored via Koios’ evaluation. Declarative- and procedural-knowledge measurements, as well as a practical test, were used to collect data, which were analysed using ANOVA and hierarchical multiple regression. The major conclusions drawn from this study are:(a) compliance with the set of design principles does not affect the development of novices’ procedural and declarative programming knowledge, (b) a programming tool that highly complies with this set facilitates novices in the application of their procedural programming knowledge during program creation and (c) programming tools, declarative and procedural knowledge are independent components in learning to program. However, it was also concluded that the two knowledge types and a programming tool that highly complies with the set contribute significantly to novices’ programming performance. This study contributes to knowledge by theoretically identifying and empirically testing a set of design principles for educational programming software, and by producing and scientifically evaluating a programming tool as an embodiment of this set. Through this evaluation, the suggestion of Koios as a practically useful programming tool for novices seems to be well supported.
APA, Harvard, Vancouver, ISO, and other styles
10

Doran, Jonathon. "Procedural Generation of Content for Online Role Playing Games." Thesis, University of North Texas, 2014. https://digital.library.unt.edu/ark:/67531/metadc700051/.

Full text
Abstract:
Video game players demand a volume of content far in excess of the ability of game designers to create it. For example, a single quest might take a week to develop and test, which means that companies such as Blizzard are spending millions of dollars each month on new content for their games. As a result, both players and developers are frustrated with the inability to meet the demand for new content. By generating content on-demand, it is possible to create custom content for each player based on player preferences. It is also possible to make use of the current world state during generation, something which cannot be done with current techniques. Using developers to create rules and assets for a content generator instead of creating content directly will lower development costs as well as reduce the development time for new game content to seconds rather than days. This work is part of the field of computational creativity, and involves the use of computers to create aesthetically pleasing game content, such as terrain, characters, and quests. I demonstrate agent-based terrain generation, and economic modeling of game spaces. I also demonstrate the autonomous generation of quests for online role playing games, and the ability to play these quests using an emulated Everquest server.
APA, Harvard, Vancouver, ISO, and other styles
11

Roden, Timothy E. "Procedural content creation and technologies for 3D graphics applications and games." Thesis, University of North Texas, 2005. https://digital.library.unt.edu/ark:/67531/metadc4726/.

Full text
Abstract:
The recent transformation of consumer graphics (CG) cards into powerful 3D rendering processors is due in large measure to the success of game developers in delivering mass market entertainment software that feature highly immersive and captivating virtual environments. Despite this success, 3D CG application development is becoming increasingly handicapped by the inability of traditional content creation methods to keep up with the demand for content. The term content is used here to refer to any data operated on by application code that is meant for viewing, including 3D models, textures, animation sequences and maps or other data-intensive descriptions of virtual environments. Traditionally, content has been handcrafted by humans. A serious problem facing the interactive graphics software development community is how to increase the rate at which content can be produced to keep up with the increasingly rapid pace at which software for interactive applications can now be developed. Research addressing this problem centers around procedural content creation systems. By moving away from purely human content creation toward systems in which humans play a substantially less time-intensive but no less creative part in the process, procedural content creation opens new doors. From a qualitative standpoint, these types of systems will not rely less on human intervention but rather more since they will depend heavily on direction from a human in order to synthesize the desired content. This research draws heavily from the entertainment software domain but the research is broadly relevant to 3D graphics applications in general.
APA, Harvard, Vancouver, ISO, and other styles
12

Angster, Scott Reed. "An object-oriented, knowledge-based, non-procedural approach to multi-disciplinary, parametric, conceptual design." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-12052009-020120/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Olkerud, Marcus, and Martin Virke. "Processuell generering av oändliga spelvärldar : Praktiska problem och optimering." Thesis, Södertörns högskola, Institutionen för naturvetenskap, miljö och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-22949.

Full text
Abstract:
Enligt oss så är det största problemet med att processuellt generera en pseudo-oändlig spelvärld i realtid är att få genereringen att ske så sömlöst som möjligt samtidigt som världen upplevs som konsekvent. För att finna lösningar på detta problem så analyserar vi andra studier och spel som utnyttjar processuell generering. Vi använder sedan de metoder och tekniker vi funnit för skapandet av en egen applikation för att få en djupare förståelse för hur dessa fungerar i praktiken och hur mycket varje metod påverkar prestandan. I vår slutsats beskriver vi de problem vi fann, deras orsak och ger förslag på lösningar. På grund av studiens tekniska karaktär så riktar den sig främst till programmerare. Vi hoppas att med denna studie kunna komplettera andra studier inom detta, enligt oss, relativt outforskade område.
According to us, the biggest problem with procedurally generating a pseudo-infinite game world in real-time is to have it generate as seamlessly as possible and keeping the world consistent at the same time. In order to come up with solutions to this problem we analyzed other studies and games which utilize procedural generation. We then used the methods we found in order to create our own application to further understand how they work in practice and how much each method affexts the performance of said application. In our conclusion we describe the problems that arose as well as explain what caused them, as well as present possible solutions to them. Due to the technical nature of this study it is mainly aimed at programmers. We hope that this study can complement other studies within what we think is a relatively unexplored subject.
APA, Harvard, Vancouver, ISO, and other styles
14

Gustafsson, Andreas, and Jesper Vallett. "Context-Aware Procedural Content Generation with Player Modelling in Mobile Action Role Playing Game." Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20530.

Full text
Abstract:
This paper aimed to discover how player satisfaction is affected by context-aware elements based on physical, real-world factors in an action role-playing game. The possibility of utilizing player modelling to counteract the reduction in player empowerment in a game heavily influenced by external factors was also explored. This was accomplished by creating an ARPG heavily integrated with various weather, and daytime, context data obtained from web-based APIs. Followed by conducting qualitative tests with help of eleven participants during a time period of a week. The evaluated results were presented in a manner of relevance for both context-driven applications as a whole, and for further exploration within game developments utilization of state of the art technology.
APA, Harvard, Vancouver, ISO, and other styles
15

Ahlert, Hubert. "Um modelo não procedural de especificação e implementação voltado a sistemas transacionais em banco de dados." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1994. http://hdl.handle.net/10183/9006.

Full text
Abstract:
Esta tese de doutorado apresenta um modelo de especificação, textual e grafico, para sistemas transacionais em banco de dados (ER/T+) e, também, um modelo de implementação desta especificação. Sugere uma técnica de proceduralização de especificações declarativas, usando um grafo de dependencia de fluxos de dados para estabelecer a relação de precedecia entre os fluxos do diagrama da linguagem gráfica de especificação. Apresenta, também, os mecanismos de execução da linguagem de especificação proposta e as regras de mapeamento da linguagem de especificação, em seus aspectos estruturais (dados) e comportamentais (transações), para correspondentes construções na linguagem de implementação (C e SQL). Adicionalmente, são discutidos aspectos de otimização de consultas no âmbito da linguagem de especificação de transações e, também, aspectos de aninhamento de consultas para combinar diversos fluxos do diagrama ER/T+ em expressões complexas de consultas SQL.
This Ph.D thesis presents a graphic and textual specification model for database transactions systems (ER/T+) and, also, an implementation model for this specification. Suggest a proceduralization technique for declarative specifications using a data flow dependency graph to establish a precedence relation between the diagram flows of the graphics specification language. Furthermore it presents the execution mechanism of the proposal specification language and the behavioral and structural rules for mapping the specification language into corresponding implementation language (C and SQL) constructions. Additionaly, are discussed query optimization aspects for transaction specification language and aspects of nested queries to combine various ER/T+ diagram flows into complex SQL query expressions
APA, Harvard, Vancouver, ISO, and other styles
16

Raymond, Pascal. "Compilation efficace d'un langage déclaratif synchrone : le générateur de code Lustre-V3." Phd thesis, Grenoble INPG, 1991. http://tel.archives-ouvertes.fr/tel-00198546.

Full text
Abstract:
Ce travail porte sur la production de code séquentiel à partir du langage flot de données synchrone Lustre. La difficulté essentielle provient de l'aspect déclaratif du langage. En effet, il n'y a pas d'instruction de contrôle dans le langage Lustre ; toute la structure de contrôle du code objet doit donc être synthétisée par le compilateur. Cette synthèse consiste à construire un automate fini en simulant exhaustivement le comportement des variables booléennes du programme. Le code produit est particulièrement rapide ; en effet, la plupart des calculs booléens sont effectués une fois pour toute dès la compilation. En contrepartie, l'aspect exhaustif de cette démarche provoque parfois une véritable explosion de la taille du code. Ce problème peut être dû à la complexité intrinsèque du programme source ; il faut dans ce cas chercher un compromis entre rapidité et taille mémoire. Mais l'explosion peut être causée par la méthode de construction, qui produit très souvent des automates non minimaux ; nous avons donc étudié et développé un algorithme original qui construit à coup sûr des automates minimaux. Cet algorithme fait appel à de nombreuses manipulations symboliques de fonctions booléennes, que nous avons pu implémenter efficacement grâce à une représentation basée sur les graphes binaires de décision.
APA, Harvard, Vancouver, ISO, and other styles
17

Lui, Rebecca. "Implementation of procedures in a database programming language." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27373.

Full text
Abstract:
This thesis documents the design and implementation of procedures in a database programming language. The purpose of this thesis is to integrate procedure facilities into an existing relational database system.
A relation is defined over a set of attributes. Given the values of a subset of attributes as input, a selection operation looks up the relation and outputs the values of the remaining attributes. Our proposed procedure construct supports this concept: a procedure is defined over a set of parameters, and the procedure can be invoked with different subsets of input parameters. This is accomplished by allowing procedures to have a sequence of blocks within the procedure body. Each block abstracts a sequence of actions which requires a subset of parameters as input. Users can select different blocks to be activated by supplying different subsets of input parameters. While a relation can be selected with any subset of input attributes, a procedure can only be invoked with defined subsets of parameters.
Our proposed procedures also support the usual properties of procedural abstraction: encapsulation and parameterization. A procedure declaration defines the procedure name, formal parameters, and the body. Procedure invocation is through the use of a stand-alone procedure call statement which specifies the procedure name and a list of actual parameters. Before a procedure is activated, the formal parameters within the procedure body are replaced by the corresponding actual parameters. Moreover, a procedure can be printed, shown, deleted, called by itself or other procedures, and passed as a parameter.
APA, Harvard, Vancouver, ISO, and other styles
18

Lui, Rebecca. "Implementation of procedures in a database programming language." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0007/MQ29748.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Mehrotra, Anuj. "A geometric programming based procedure to design bridge superstructures." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/44081.

Full text
Abstract:
The routine procedure for designing bridge superstructures relies heavily on the past experience of the designer and is extremely time consuming and costly to try out alternative designs. Typically, a designer is more concerned about satisfying the design requirements laid down by the American Association of State Highway and Transportation Officials (AASHTO) than in coming up with the best possible design from the economic point of view. Thus, application of suitable mathematical programming techniques to determine optimal designs can result in tremendous savings. In this thesis, a procedure based on Generalized Geometric Programming (GGP) is developed to optimally design and select bridge superstructures. The bridge superstructure design problems are formulated as GGP problems incorporating all the design considerations as specified by AASHTO and the Virginia Department of Transportation (VDOT). A primal based algorithm is used in which, the resulting optimization problems are transformed to the solution of a series of Linear Programming problems that are easy to solve. A computer implementation of the algorithm is also developed. The software is extremely versatile and user friendly. It provides several options to help determine the optimal solution under varying design conditions, and is implemented on several representative problems provided by VDOT. Comparison of the resulting optimal with the existing designs promises huge savings in terms of both cost and effort. The methodology that is developed can be used to solve other Engineering Designs Problems as well.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
20

Ah-Kee, Jean Alain. "Operation decomposition proof obligations for blocks and procedures." Thesis, University of Manchester, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.330292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Johnston, Brendan Ashley. "Characterizing Virtual Prototype Constructability Programming for the Pictographic Instruction of Procedure." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/29295.

Full text
Abstract:
The modern design-construction boundary is facing an unprecedented moment of evaluation. Global applications of building information modeling, including virtual prototyping, factory-based component procurement and industrialized site production are only a few of the forces that threaten to engulf the established façades of architecture, engineering and construction practice. Those professional identities that are unable or unwilling to reach deeply into this oncoming torrent of interoperability, integrated delivery, and infinite domains will be lost. It is even possible that the language of building culture will be washed away forever. Preparations should be made. This research proposes to strengthen available built-project communications. It does so by examining the natural architectonic relationships which exists at the most primitive level of production â about the assembly task. A work and its procedures are investigated through the programming interface of a Virtual Prototype (VP) modeling system. With visualized constructability as its goal, this study highlights the character of VP programming as it translates between design and production information with digital specificity. The results of that investigation fashion a test of a new production communications language with the potential to enrich and refresh the insulate expressions and hollow specification of traditional design communications.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
22

Booth, Alan Edward. "A methodology for the development of embedded knowledge-based procedures." Thesis, University of East Anglia, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Wu, Cheng-min, of Western Sydney Nepean University, and School of Computing and Information Technology. "Implementing a prioritized logic programming system : thesis." THESIS_XXX_CIT_Wu_C.xml, 2000. http://handle.uws.edu.au:8081/1959.7/188.

Full text
Abstract:
Rule based knowledge representation and reasoning often face a problem of conflict with rules. One common way of solving conflicts is to introduce priorities associate with rules. The thesis describes the underlying algorithm to implement prioritized logic programs (PLPs) proposed by Zhang and Foo in 1997. PLPs are proposed as an extension of Gelfond and Lifschitz's extended logic programs by introducing preferences associatied with rules to the program, where answer sets provide a semantics of PLPs. Major algorithms are presented in detail, and how answer sets can be derived from the algorithm demonstrated. Under this implementation, a PLP is computed efficiently based on previous Niemela and Simons' method of computing stable models of logic programs. Finally, world wide web interface has been employed and embedded to the system to provide great accessibility to the public.
Master of Science (Hons) (Computing)
APA, Harvard, Vancouver, ISO, and other styles
24

Lee, Moon Gul. "New fictitious play procedure for solving Blotto games." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FLee%5Moon.pdf.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, Dec. 2004.
Thesis Advisor(s): James N. Eagle, W. Matthew Carlyle. Includes bibliographical references (p. 35). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
25

Le, Canh. "Novel numerical procedures for limit analysis of structures : mesh-free methods and mathematical programming." Thesis, University of Sheffield, 2010. http://etheses.whiterose.ac.uk/856/.

Full text
Abstract:
Current research in the field of limit analysis is focussing on the development of numerical tools which are sufficiently efficient and robust to be used in engineering practice. This places demands on the numerical discretisation strategy adopted as well as on the mathematical programming tools applied, which are the key ingredients of a typical computational limit analysis procedure. In this research, the Element-Free Galerkin (EFG) discretisation strategy is used to approximate the displacement and moment fields in plate and slab problems, and second-order cone programming (SOCP) is used to solve the resulting discretised formulations. A numerical procedure using the EFG method and second-order cone programming for the kinematic limit analysis problem was developed first. The moving least squares technique was used in combination with a stabilised conforming nodal integration scheme, both to keep the size of the optimisation problem small and to provide stable and accurate solutions. The formulation was expressed as a problem of minimizing a sum of Euclidean norms, which was then transformed into a form suitable for solution using SOCP. To improve the accuracy of solutions and to speed-up the computational process, an efficient h-adaptive EFG scheme was also developed. The naturally conforming property of meshfree approximations (with no nodal connectivity required) facilitates the implementation of h-adaptivity. The error in the computed displacement field was estimated accurately using the Taylor expansion technique. A stabilised conforming nodal integration scheme was also extended to error estimators, leading to an efficient and truly meshfree adaptive method. To obtain an indication of bounds on the solutions obtained, an equilibrium formulation was also developed. Pure moment fields were approximated using a moving least squares technique. The collocation method was used to enforce the strong form of the equilibrium equations and a stabilised conforming nodal integration scheme was introduced to eliminate numerical instability problems. The von Mises and Nielsen yield criteria were then enforced by introducing second-order cone constraints.
APA, Harvard, Vancouver, ISO, and other styles
26

Solak, Senay. "Efficient Solution Procedures for Multistage Stochastic Formulations of Two Problem Classes." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19812.

Full text
Abstract:
We consider two classes of stochastic programming models which are motivated by two applications related to the field of aviation. The first problem we consider is the network capacity planning problem, which arises in capacity planning of systems with network structures, such as transportation terminals, roadways and telecommunication networks. We study this problem in the context of airport terminal capacity planning. In this problem, the objective is to determine the optimal design and expansion capacities for different areas of the terminal in the presence of uncertainty in future demand levels and expansion costs, such that overall passenger delay is minimized. We model this problem as a nonlinear multistage stochastic integer program with a multicommodity network flow structure. The formulation requires the use of time functions for maximum delays in passageways and processing stations, for which we derive approximations that account for the transient behavior of flow. The deterministic equivalent of the developed model is solved via a branch and bound procedure, in which a bounding heuristic is used at the nodes of the branch and bound tree to obtain integer solutions. In the second study, we consider the project portfolio optimization problem. This problem falls in the class of stochastic programs in which times of uncertainty realizations are dependent on the decisions made. The project portfolio optimization problem deals with the selection of research and development (R&D) projects and determination of optimal resource allocations for the current planning period such that the expected total discounted return or a function of this expectation for all projects over an infinite time horizon is maximized, given the uncertainties and resource limitations over a planning horizon. Accounting for endogeneity in some parameters, we propose efficient modeling and solution approaches for the resulting multistage stochastic integer programming model. We first develop a formulation that is amenable to scenario decomposition, and is applicable to the general class of stochastic problems with endogenous uncertainty. We then demonstrate the use of the sample average approximation method in solving large scale problems of this class, where the sample problems are solved through Lagrangian relaxation and lower bounding heuristics.
APA, Harvard, Vancouver, ISO, and other styles
27

Shenai, Vinod Dattaram. "A Mathematical Programming Based Procedure for the Scheduling of Lots in a Wafer Fab." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/34966.

Full text
Abstract:
The semiconductor industry provides a host of very challenging problems in production planning and scheduling because of the unique features of the wafer fab. This research addresses the need to develop an approach, which can be used to generate optimal or near-optimal solutions to the scheduling problem of a wafer fab, by using Mathematical Programming for a general case of a wafer fab.

The problem is approached in two steps. First, the number of lots of different products to be released into the system during each planning period is determined, such that the total tardiness of the product orders is minimized over the planning horizon. Second, the schedule of these lots is determined so that the cycle time of each lot released into the system is minimized. Thus, the performance measures based both on due dates and cycle time are considered.

The lot release, tardiness problem is formulated as an integer linear program, and a 3-phase procedure, which utilizes a variation of the Wilkerson-Irwin algorithm, is developed. The performance of this 3-phase procedure is further improved by using insights from classical scheduling theory. The scheduling problem is formulated as a 0-1 integer linear program. An algorithm is developed for tightening the LP relaxation of this 0-1 integer linear programming model (of the scheduling problem) leading to a better performance of the branch and bound procedure used for its solution. Lagrangian relaxation is applied on a carefully chosen set of constraints in the scheduling problem, and a Lagrangian heuristic is developed for scheduling the jobs in each period of the planning horizon. Several useful insights are developed throughout to further improve the performance of the proposed algorithm.

Experiments are conducted for both the tardiness and the scheduling problems. Five experiments are conducted for the tardiness problem. Each experiment has a different combination of number of products, machines, and work orders in a small sized wafer fab (2 to 6 products, 8 to 10 station families, 15 to 30 workstations, 9 to19 work orders, and 100 to 250 lots per work order). The solutions obtained by the 3-phase procedure are compared to the optimal solutions of the corresponding tardiness problems, and the tardiness per work order for the 3-phase procedure is 0% to 25% greater than the optimal solution. But the time required to obtain the optimal solution is 22 to 1074 times greater than the time required to obtain the solution through the 3-phase procedure. Thus, the 3-phase procedure can generate almost optimal solutions and requires much smaller computation time than that required by the optimal solution.

Four experiments are conducted to test the performance of the scheduling problem. Each experiment has a different combination of number of products, machines, routes, bottleneck stations, processing times, and product mix entering the system each day in a small sized wafer fab (2 products, 8 station families, 18 workstations, and 8 to 10 lots released per day into the system). The solution quality of the schedule generated by the Lagrangian heuristic is compared to the solution provided by the standard dispatching rules available in practice. In each experiment, the cycle time of a product for each dispatching rule is divided by the best cycle time for that product over all the dispatching rules in that experiment. This ratio for the Lagrangian heuristic in each experiment and over all the experiments varies from 100% to 104%. For the standard dispatching rules, this ratio ranges from 100% to 120% in each experiment and also over all the experiments. The average of the ratio over all the experiments is the least for the Lagrangian heuristic. This indicates that for the experiments conducted, the Lagrangian heuristic consistently provides a solution that is, or is close to, the best solution and, hence, quite competitive when compared to the standard dispatching rules.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles
28

Da, Costa S. C. "The prediction of risk of welding defects at the procedure stage using computer knowledge based systems." Thesis, Cranfield University, 1992. http://dspace.lib.cranfield.ac.uk/handle/1826/4446.

Full text
Abstract:
The purpose of this research was to develop a methodology to evaluate the likelihood of defective welds as a procedure proposal is entered into a computerised database system. The approach developed was assessed for hydrogen induced cold cracking (HICC) since this defect is a major problem in welding technology. An expert system was used to implement the methodology. The information for the expert system knowledge base was partly gathered from previous work in this area. The technique necessary to analyze and incorporate knowledge was organized in a structured form including the major area to be attacked. The final system was implemented using an expert system shell. The global task of analyzing a welding procedure was broken-down into three different stages. A welding procedure specification comprised the first stage. In the second stage, an interface between the expert system software and a database was implemented. Having proved the feasibility and advantages of integrating the expert system shell with a relational database the remainder of the work was devoted to the development of a strategy for operating the expert system and in particular dealing with uncertainty. Detailed validation of the knowledge base and the system as a whole were confined to a single defect type in the belief that the modularity of the system would allow extension to other defect types and the strategies developed in the present work should it be applicable. Results have shown that the system performs well in the specified area. Validation trials using simulated welding conditions generated by the expert system have shown a very good correlation with practical results for different classes of steels. The integration between approved welding procedure records and procedure qualification records could be the basis for a complete welding database management. Practical application of this system could be extended for educational purpose and training facilities.
APA, Harvard, Vancouver, ISO, and other styles
29

Bliss, Michael A. "Procedures to Perform Dam Rehabilitation Analysis in Aging Dams." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/33157.

Full text
Abstract:
There are hundreds of existing dams within the State of Virginia, and even thousands more specifically within the United States. A large portion of these dams do not meet the current safety standard of passing the Probable Maximum Flood. Likewise, many of the dams have reached or surpassed the original design lives, and are in need of rehabilitation. A standard protocol will assist dam owners in completing a dam rehabilitation analysis. The protocol provides the methods to complete the hydrologic, hydraulic, and economic analysis. Additionally, alternative augmentation techniques are discussed including the integration of GIS applications and linear programming optimization techniques. The standard protocol and alternative techniques are applied to a case study. The case study includes a set of flood control dams located in the headwaters of the South River watershed in Augusta County, VA. The downstream impacts of the flood control dams on the city of Waynesboro are demonstrated through the hydrologic and hydraulic analysis.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
30

Boberg, Jessika. "A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling." Thesis, Linköpings universitet, Optimeringslära, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143274.

Full text
Abstract:
This thesis compares different mixed integer programming (MIP) formulations for sequencing of tasks in the context of avionics scheduling. Sequencing is a key concern in many discrete optimisation problems, and there are numerous ways of accomplishing sequencing with different MIP formulations. A scheduling tool for avionic systems has previously been developed in a collaboration between Saab and Linköping University. This tool includes a MIP formulation of the scheduling problem where one of the model components has the purpose to sequence tasks. In this thesis, this sequencing component is replaced with other MIP formulations in order to study whether the computational performance of the scheduling tool can be improved. Different scheduling instances and objective functions have been used when performing the tests aiming to evaluate the performances, with the computational times of the entire avionic scheduling model determining the success of the different MIP formulations for sequencing. The results show that the choice of MIP formulation makes a considerable impact on the computational performance and that a significant improvement can be achieved by choosing the most suitable one.
APA, Harvard, Vancouver, ISO, and other styles
31

Helgesen, Henrik. "A robust Multi-Loop tuning Procedure based at Succsessive Semidefinite Programming, that achieves optimal Performance and Failure Tolerance." Thesis, Norwegian University of Science and Technology, Department of Engineering Cybernetics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8884.

Full text
Abstract:

The desired properties of a multi-loop PID tuning procedure is to find some parameters that makes the plant robust, meet some desired performance requirements and guarantee failure tolerance. A detailed literature survey of the different multi-loop PID tuning procedures are presented. Properties of the Independent design methods, Detuning methods, Sequential closing methods, Iterative or trial and error methods, Optimization methods and Relay feedback approaches are described in detail and discussed. Most of the tuning procedures result in a too conservative design without integrity. It is shown how the integrity property may be achieved with a multi-loop Hinf optimal tuning method. How to deffine and solve such a Hinf optimal problem is presented. The desired properties of the multi-loop PID tuning procedure is obtained with this method. The method aim for its object to solve a Hinf optimization problem with Linear Matrix Inequality (LMI) constraints. The optimization problem is non-convex, so a Successive Semidefnite Programming (SSP) algorithm is used to find local solutions to the problem. Several initial points must be examen to aim for a global solution. The SSP algorithm is implemented in MATLAB, and applied at a distillation column example. The implemented algorithm does not converge to a solution. Hence no simulation results that back up the theoretical work is presented.

APA, Harvard, Vancouver, ISO, and other styles
32

Jones, Asia Roche'. "Practices and Procedures that Influence African-American Males to Drop Out from Public School." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/26761.

Full text
Abstract:
The African-American male national on-time graduation rate data are evidence that systemic changes must occur to address the academic failure they experience. A significant gap in achievement exists when compared to the on-time graduation rate of their White male peers. It is possible that some students do not graduate on-time due to retention that may occur after they have entered the ninth grade. The African-American male students in this study failed to graduate on-time because they did not persist to successfully complete their twelfth grade year; instead, they dropped out. While factors associated with societal issues and familial dynamics contribute to this problem, factors associated with public school practices and procedures are the focus of this study. The educational records of 125 African-American male high school dropouts were analyzed to identify school factors that may explain why they did not persist to graduate. These students dropped out from an urban school division in Virginia during the 2009 and 2010 school years.  A mixed methods approach was used to answer the research questions posed in this study. The conceptual framework, a road map for the study, proposes discipline sanctions, curriculum programming, instructional experiences and school relationships as factors for review. Quantitative research methods were used to analyze longitudinal data and qualitative methods were used to analyze survey data on student perception of teacher relationships. Findings from the study will enable school principals, counselors and teachers to make informed instructional decisions that may prevent African-American males from dropping out of one urban school division in Virginia. While not generalizable to all school settings, strategies associated with discipline sanctions, curriculum programming, instructional experiences and school relationships are provided.
Ed. D.
APA, Harvard, Vancouver, ISO, and other styles
33

Tollefson, Eric Sander. "Optimal randomized and non-randomized procedures for multinomial selection problems." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43629.

Full text
Abstract:
Multinomial selection problem procedures are ranking and selection techniques that aim to select the best (most probable) alternative based upon a sequence of multinomial observations. The classical formulation of the procedure design problem is to find a decision rule for terminating sampling. The decision rule should minimize the expected number of observations taken while achieving a specified indifference zone requirement on the prior probability of making a correct selection when the alternative configurations are in a particular subset of the probability space called the preference zone. We study the constrained version of the design problem in which there is a given maximum number of allowed observations. Numerous procedures have been proposed over the past 50 years, all of them suboptimal. In this thesis, we find via linear programming the optimal selection procedure for any given probability configuration. The optimal procedure turns out to be necessarily randomized in many cases. We also find via mixed integer programming the optimal non-randomized procedure. We demonstrate the performance of the methodology on a number of examples. We then reformulate the mathematical programs to make them more efficient to implement, thereby significantly expanding the range of computationally feasible problems. We prove that there exists an optimal policy which has at most one randomized decision point and we develop a procedure for finding such a policy. We also extend our formulation to replicate existing procedures. Next, we show that there is very little difference between the relative performances of the optimal randomized and non-randomized procedures. Additionally, we compare existing procedures using the optimal procedure as a benchmark, and produce updated tables for a number of those procedures. Then, we develop a methodology that guarantees the optimal randomized and non-randomized procedures for a broad class of variable observation cost functions -- the first of its kind. We examine procedure performance under a variety of cost functions, demonstrating that incorrect assumptions regarding marginal observation costs may lead to increased total costs. Finally, we investigate and challenge key assumptions concerning the indifference zone parameter and the conditional probability of correct selection, revealing some interesting implications.
APA, Harvard, Vancouver, ISO, and other styles
34

Ivinger, Oskar. "Multipla definitioner av procedurer – feltolerans genom redundans på procedurnivå i ett programspråk." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5057.

Full text
Abstract:
Sammanfattning Fel i programvara (buggar) kostar ofantliga summor varje år. I detta arbete presenteras en metod där programexekveringsmiljön utan vare sig programmerarens eller användarens inblandning utförligt kan rapportera och dölja effekterna av en avsevärd andel buggar. Genom att kompilatorn eller tolken tillåter att en och samma procedur implementeras hur många gånger som helst införs ett helt automatiskt stöd för N-Version Programming (NVP) omedelbart i programspråket. Tekniken gör programvaran feltolerant och blir ett komplement till kostsam och ofta bristfällig testning. En tolk utvecklades för ett programspråk som tillåter multipla definitioner av procedurer. Därmed har det inbyggt stöd för feltolerans genom redundans på procedurnivå. Ett experiment genomfördes där nio programmerare oberoende av varandra implementerade 12 utförligt specificerade procedurer. De olika bidragen klistrades in i ett och samma program. Nio av 12 feltoleranta sammansatta procedurer fungerade perfekt. I många fall även när en majoritet av de ingående bidragen drogs med allvarliga fel. Sammanställningen genomfördes både före och efter programmerarnas egen testning och felrättning. Testningen visade sig vara en faktor med liten inverkan på helheten även om många enskilda uppdaterade bidrag fungerade avsevärt bättre än förut. I något fall lyckades metoden påvisa tvetydigheter i specifikationen när olika versioner producerade olika men formellt korrekta resultat.
Södra Stenbocksgatan 120 252 44 HELSINGBORG 042 14 67 06
APA, Harvard, Vancouver, ISO, and other styles
35

Stahr, Michael C. "DESIGN AND IMPLEMENTATION OF AN EMPLOYEE JOB SCHEDULING AND PROGRESSION TRACKING SYSTEM." Miami University / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=miami1038847285.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Paget, Jane Kathryn. "Do levels of self-monitoring, self-efficacy, and anxiety moderate the relationship between perception of dimensions and performance in assessment centers?" CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Kubášek, Pavel. "Technologie výroby zápustky." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2013. http://www.nusl.cz/ntk/nusl-230790.

Full text
Abstract:
The aim of the master´s thesis is to adjust the technology of machining of a die on the CNC lathe so that the total time for the production of a die could be reduced significantly and in this way also the production costs. The analyse of the technology of the machining of the inner part of the die is carried out and a change in the machining of this part is suggested. The new technology is elaborated in two variants when the CAD/CAM system is used for the creation of a programme in a variant and the machining cycles in the other. The technical and economical evaluation is performed at the end of the thesis.
APA, Harvard, Vancouver, ISO, and other styles
38

Engman, Jimmy. "Model Predictive Control for Series-Parallel Plug-In Hybrid Electrical Vehicle." Thesis, Linköpings universitet, Fordonssystem, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69608.

Full text
Abstract:
The automotive industry is required to deal with increasingly stringent legislationfor greenhouse gases. Hybrid Electric Vehicles, HEV, are gaining acceptance as thefuture path of lower emissions and fuel consumption. The increased complexityof multiple prime movers demand more advanced control systems, where futuredriving conditions also becomes interesting. For a plug-in Hybrid Electric Vehicle,PIHEV, it is important to utilize the comparatively inexpensive electric energybefore the driving cycle is complete, this for minimize the cost of the driving cycle,since the battery in a PIHEV can be charged from the grid. A strategy with lengthinformation of the driving cycle from a global positioning system, GPS, couldreduce the cost of driving. This by starting to blend the electric energy with fuelearlier, a strategy called blended driving accomplish this by distribute the electricenergy, that is charged externally, with fuel over the driving cycle, and also ensurethat the battery’s minimum level reaches before the driving cycle is finished. Astrategy called Charge Depleting Charge Sustaining, CDCS, does not need lengthinformation. This strategy first depletes the battery to a minimum State of Charge,SOC, and after this engages the engine to maintain the SOC at this level. In thisthesis, a variable SOC reference is developed, which is dependent on knowledgeabout the cycle’s length and the current length the vehicle has driven in the cycle.With assistance of a variable SOC reference, is a blended strategy realized. Thisis used to minimize the cost of a driving cycle. A comparison between the blendedstrategy and the CDCS strategy was done, where the CDCS strategy uses a fixedSOC reference. During simulation is the usage of fuel minimized; and the blendedstrategy decreases the cost of the driving missions compared to the CDCS strategy.To solve the energy management problem is a model predictive control used. Thedesigned control system follows the driving cycles, is charge sustaining and solvesthe energy management problem during simulation. The system also handlesmoderate model errors.
Fordonsindustrin måste hantera allt strängare lagkrav mot utsläpp av emissioneroch växthusgaser. Hybridfordon har börjat betraktas som den framtida vägenför att ytterligare minska utsläpp och användning av fossila bränslen. Den ökadekomplexiteten från flera olika motorer kräver mera avancerade styrsystem. Begränsningarfrån motorernas energikällor gör att framtida förhållanden är viktigaatt estimera. För plug-in hybridfordon, PIHEV, är det viktigt att använda denvvijämförelsevis billiga elektriska energin innan fordonet har nått fram till slutdestinationen.Batteriets nuvarande energimängd mäts i dess State of Charge, SOC.Genom att utnyttja information om hur långt det är till slutdestinationen från ettGlobal Positioning System, GPS, blandar styrsystemet den elektriska energin medbränsle från början, detta kallas för blandad körning. En strategi som inte hartillgång till hur långt fordonet ska köras kallas Charge Depleting Charge Sustaining,CDCS. Denna strategi använder först energin från batteriet, för att sedanbörja använda förbränningsmotorn när SOC:s miniminivå har nåtts. Strategin attanvända GPS informationen är jämförd med en strategi som inte har tillgång tillinformation om körcykelns längd. Blandad körning använder en variabel SOC referens,till skillnad från CDCS strategin som använder sig av en konstant referenspå SOC:s miniminivå. Den variabla SOC referensen beror på hur långt fordonethar kört av den totala körsträckan, med hjälp av denna realiseras en blandad körning.Från simuleringarna visade det sig att blandad körning gav minskad kostnadför de simulerade körcyklerna jämfört med en CDCS strategi. En modellbaseradprediktionsreglering används för att lösa energifördelningsproblemet. Styrsystemetföljer körcykler och löser energifördelningsproblemet för de olika drivkällorna undersimuleringarna. Styrsystemet hanterar även måttliga modellfel.
APA, Harvard, Vancouver, ISO, and other styles
39

Pereira, Augusto Cesar. "Procedimento de equilíbrio de mercados de energia e reserva com restrições de segurança em sistemas hidrotérmicos." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152363.

Full text
Abstract:
Submitted by Augusto Cesar Pereira (augusto.pereira@feb.unesp.br) on 2017-12-20T09:42:45Z No. of bitstreams: 1 Dissertação_Augusto_Repositorio.pdf: 2651783 bytes, checksum: 084f19f166b7161411ec58baa4ecf206 (MD5)
Approved for entry into archive by Maria Marlene Zaniboni null (zaniboni@bauru.unesp.br) on 2017-12-20T10:54:46Z (GMT) No. of bitstreams: 1 pereira_ac_me_bauru.pdf: 2651783 bytes, checksum: 084f19f166b7161411ec58baa4ecf206 (MD5)
Made available in DSpace on 2017-12-20T10:54:46Z (GMT). No. of bitstreams: 1 pereira_ac_me_bauru.pdf: 2651783 bytes, checksum: 084f19f166b7161411ec58baa4ecf206 (MD5) Previous issue date: 2017-12-18
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Este trabalho propõe um modelo de Procedimento de Equilíbrio de Mercado com Restrições de Segurança Estocásticas (PEMRSE) que pode ser utilizado como um modelo de leilão de energia e reserva do dia seguinte por operadores de sistemas hidrotérmicos. O modelo de PEMRSE tem o objetivo de minimizar o custo esperado da operação, considerando os custos associados aos excedentes de geração e consumo, partidas, contratação de reservas e a penalização econômica associada aos cortes involuntários de carga. O PEMRSE considera vários aspectos que dificultam a resolução de problemas de leilão: i) representação detalhada dos sistemas de geração hidrelétrico e termelétrico; ii) perdas na transmissão; e iii) restrições de segurança pré e pós-contingência. São propostas técnicas de linearização que não demandam o uso de variáveis binárias para a função de produção hidráulica e para as funções de potência e engolimento máximo de geradores hidrelétricos. A estrutura estocástica permite cortes involuntários de carga, isto é, o operador pode optar por não contratar a totalidade das reservas necessárias para cobrir as falhas associadas às contingências, ponderando sua decisão pela probabilidade de ocorrência destas falhas e pelo valor da penalização econômica associada ao corte de carga. Propõe-se também uma técnica para a resolução de modelos de PEMRSE em tempos computacionais menores com relação à sua resolução direta. Simulações em um sistema-teste de três barras e no sistema IEEE de 24 barras evidenciam a eficiência do modelo, das técnicas de linearização e da técnica de resolução propostos. As simulações também mostram os impactos dos aspectos complicadores nos resultados do leilão e no tempo computacional de resolução. O modelo de PEMRSE proposto pode ser resolvido de maneira eficiente por meio de pacotes computacionais disponíveis comercialmente por meio da técnica de resolução proposta.
This work proposes a Market Clearing Procedure with Stochastic Security Constraints (MCPSSC) model that can be used as an energy and reserve day-ahead auction model by hydrothermal systems operators. The MCPSSC aims to minimize the expected cost of the operation, considering the costs associated with the generation and consumption surpluses, start-ups, contracting of reserves and the economic penalization associated with involuntary load shedding events. The MCPSSC model considers several aspects that complicate the resolution of auction problems: i) detailed representation of the hydrothermal generating systems; ii) transmission losses; and iii) pre- and post-contingency security constraints. We propose linearization techniques that does not require the use of binary variables for the hydro production function and for the maximum power output and maximum water discharge functions of hydro generators. The stochastic structure allows some load shedding, ie, the operator can choose not to contract the total reserve requirements to cover the failures associated with the contingencies, weighting its decision by the probability of occurrence of these failures and by the value of lost load. We also propose a technique for the resolution of MCPSSC models in lower computational times regarding its direct resolution. Simulations in a three-bus test system and in the IEEE 24-bus system show the efficiency of the model, the linearization techniques and the resolution technique proposed. The simulations also show the the impact of the complicating aspects in the auction outcomes and in the computational time. The proposed MCPSSC model can be efficiently solved by commercially available solvers by means of the proposed resolution technique.
APA, Harvard, Vancouver, ISO, and other styles
40

SOUZA, DAIANE C. B. de. "Desenvolvimento de método para caracterização de embalados de rejeitos radioativos." reponame:Repositório Institucional do IPEN, 2013. http://repositorio.ipen.br:8080/xmlui/handle/123456789/10540.

Full text
Abstract:
Made available in DSpace on 2014-10-09T12:41:39Z (GMT). No. of bitstreams: 0
Made available in DSpace on 2014-10-09T14:07:26Z (GMT). No. of bitstreams: 0
Dissertação (Mestrado)
IPEN/D
Instituto de Pesquisas Energeticas e Nucleares - IPEN-CNEN/SP
APA, Harvard, Vancouver, ISO, and other styles
41

Paris, Paulo Cesar Donizeti. "Simulador de arquitetura para processamento de imagens usando programação genética cartesiana." Universidade Federal de São Carlos, 2013. https://repositorio.ufscar.br/handle/ufscar/560.

Full text
Abstract:
Made available in DSpace on 2016-06-02T19:06:11Z (GMT). No. of bitstreams: 1 5870.pdf: 4537760 bytes, checksum: 7cb33109ce64766270c2f7d7c5f3dddb (MD5) Previous issue date: 2013-12-20
The tools offered by the area of Mathematical Morphology are very effective when applied to the analysis of binary images, which it is of great importance in areas such as: robotic vision, visual inspection, among others. Such tools, beside to Evolutionary Computation and based on genotype-phenotypes mappings allow computational tasks be performed automatically without explicit programming, which leads to the motivation, in the search of a way of reducing the degree of difficulty often found by human experts in performing tasks of selecting linear operators to be used in morphological filters. Moreover, if such tasks require fast processing on the images, it is necessary the use of architectures implemented in hardware, which it is not too trivial to be done. In this work, a hardware architecture simulator has been implemented for image processing, based on Cartesian Genetic Programming, which automatically builds filters for processing binary images, i.e., automatically build a sequence of logical and morphological operators that produces filters to obtain an approximate of the desired images. The results obtained from several experiments of transformation of these images are presented and comparatively analyzed in relation to previous results available in the literature. Based on these results, it will be possible to study the behavior of such architecture, through the variation of the parameters of the genetic procedure in the simulator environment. Thus, it will be possible to infer if the architecture is suitable or not for a desired application, so facilitating the process of design and implementation of it in hardware.
As ferramentas oferecidas pela área de Morfologia Matemática são muito eficientes quando aplicadas na análise de imagens binárias, o que é de grande importância em áreas como: visão robótica, inspeção visual, entre outras. Tais ferramentas aliadas à Computação Evolucionária e baseadas em mapeamentos genótipo-fenótipo permite que as tarefas computacionais possam ser executadas de forma automática, sem programações explicitas, o que leva a uma motivação na busca de uma forma de redução do grau de dificuldade, muitas vezes encontrado pelos especialistas na realização de tarefas de seleção de operadores de imagem para serem utilizados em tarefas de análise. Além disso, se tais tarefas necessitarem de processamentos rápidos sobre as imagens, faz-se necessário o uso de arquiteturas implementadas em hardware, o que também não é muito trivial de serem projetadas. Assim, neste trabalho, implementa-se um simulador de arquiteturas de hardware para processamento de imagens, com base na metodologia de Programação Genética Cartesiana, que gera automaticamente filtros para o processamento de imagens binárias, ou seja, constrói-se automaticamente uma sequência de operadores lógicos e morfológicos que produzem os filtros para as imagens desejadas. Os resultados obtidos a partir de diversos estudos de casos de transformação dessas imagens são apresentados e analisadoscomparativamente em relação aos resultados anteriores disponíveis na literatura. Com base nestes resultados, é possível estudar o comportamento de tal arquitetura, através da variação dos parâmetros do procedimento genético no ambiente do simulador. Assim, é possível inferir se a arquitetura modelada será ou não adequada à aplicação desejada, logo, facilitando-se o processo de projeto e implementação em hardware.
APA, Harvard, Vancouver, ISO, and other styles
42

Costa, Celso Maciel da. "Environnement d'exécution parallèle : conception et architecture." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1993. http://hdl.handle.net/10183/18239.

Full text
Abstract:
L'objectif de cette thèse est l'étude d'un environnement d'exécution pour machines parallèles sans mémoire commune. Elle comprend la définition d'un modèle de programme parallèle, basé sur l'échange de message offrant une forme restreinte de mémoire partagée. La communication est indirecte, via des portes; les processus utilisent les barrières pour la synchronisation. Les entités du système. processus, portes et barrières, sont créées dynamiquement, et placées sur un processeur quelconque du réseau de processeurs de façon explicite. Nous proposons une implantation de ce modèle comme la mise en oeuvre systématique d'une architecture client/serveur. Cette implantation a été efféctuée sur une machine Supemode. La base est un Micro Noyau Parallèle, où le composant principal est un mécanisme d'appel de procédure à distance minimal.
This thesis describes an execution environment for parallel machines without shared memory. A parallel programming model based on message passing, with a special shared memory. In this model, process communication occurs indirectly, via ports, and the processes use barriers for synchronization. All the entities of the system, such as processes, ports and barriers, are created dynamically and loaded on any processor of the network of processors. The implementation architecture of our model is a systematic realization of the client/server model. An implementation is proposed in a Supernode parallel machine as a parallel micro kernel. The principal parallel micro kernel component is a minimal remote procedure call mechanism.
APA, Harvard, Vancouver, ISO, and other styles
43

Fan, Yang, Hidehiko Masuhara, Tomoyuki Aotani, Flemming Nielson, and Hanne Riis Nielson. "AspectKE*: Security aspects with program analysis for distributed systems." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4136/.

Full text
Abstract:
Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.
APA, Harvard, Vancouver, ISO, and other styles
44

Harrison, William. "Malleability, obliviousness and aspects for broadcast service attachment." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4138/.

Full text
Abstract:
An important characteristic of Service-Oriented Architectures is that clients do not depend on the service implementation's internal assignment of methods to objects. It is perhaps the most important technical characteristic that differentiates them from more common object-oriented solutions. This characteristic makes clients and services malleable, allowing them to be rearranged at run-time as circumstances change. That improvement in malleability is impaired by requiring clients to direct service requests to particular services. Ideally, the clients are totally oblivious to the service structure, as they are to aspect structure in aspect-oriented software. Removing knowledge of a method implementation's location, whether in object or service, requires re-defining the boundary line between programming language and middleware, making clearer specification of dependence on protocols, and bringing the transaction-like concept of failure scopes into language semantics as well. This paper explores consequences and advantages of a transition from object-request brokering to service-request brokering, including the potential to improve our ability to write more parallel software.
APA, Harvard, Vancouver, ISO, and other styles
45

Dujardin, Yann. "Régulation adaptative multi-objectif et multi-mode aux carrefours à feux." Phd thesis, Université Paris Dauphine - Paris IX, 2013. http://tel.archives-ouvertes.fr/tel-00904781.

Full text
Abstract:
Afin de répondre à la problématique de la régulation multi-objectif et multi-mode des carrefours à feux, nous proposons trois modèles de programmation linéaire mixte en nombres entiers constituant les moteurs d'un système de régulation pleinement adaptatif, ainsi que deux procédures interactives d'optimisation multi-objectif permettant d'adapter itérativement une "politique de régulation" à la situation de trafic. Les critères pris en compte, tous à minimiser, sont le temps d'attente et le nombre d'arrêts des véhicules particuliers, et un critère dédié aux transports en commun permettant de fixer un temps d'attente souhaité pour chaque bus. Des expérimentations ont montré qu'un des trois modèles, dit hybride, se démarque positivement des deux autres. Ce modèle a alors été mis en œuvre avec une des deux procédures interactives, permettant de contrôler un trafic simulé sur une période d'une heure dans différents scénarios types, et comparé à un système de régulation semi-adaptatif.
APA, Harvard, Vancouver, ISO, and other styles
46

Palix, Nicolas, Julia L. Lawall, Gaël Thomas, and Gilles Muller. "How Often do Experts Make Mistakes?" Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4132/.

Full text
Abstract:
Large open-source software projects involve developers with a wide variety of backgrounds and expertise. Such software projects furthermore include many internal APIs that developers must understand and use properly. According to the intended purpose of these APIs, they are more or less frequently used, and used by developers with more or less expertise. In this paper, we study the impact of usage patterns and developer expertise on the rate of defects occurring in the use of internal APIs. For this preliminary study, we focus on memory management APIs in the Linux kernel, as the use of these has been shown to be highly error prone in previous work. We study defect rates and developer expertise, to consider e.g., whether widely used APIs are more defect prone because they are used by less experienced developers, or whether defects in widely used APIs are more likely to be fixed.
APA, Harvard, Vancouver, ISO, and other styles
47

李毓仁. "A Network Reliability Evaluation System Using Procedural Programming Language." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/27410888737736368857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

"Graph Search as a Feature in Imperative/Procedural Programming Languages." Master's thesis, 2018. http://hdl.handle.net/2286/R.I.49188.

Full text
Abstract:
abstract: Graph theory is a critical component of computer science and software engineering, with algorithms concerning graph traversal and comprehension powering much of the largest problems in both industry and research. Engineers and researchers often have an accurate view of their target graph, however they struggle to implement a correct, and efficient, search over that graph. To facilitate rapid, correct, efficient, and intuitive development of graph based solutions we propose a new programming language construct - the search statement. Given a supra-root node, a procedure which determines the children of a given parent node, and optional definitions of the fail-fast acceptance or rejection of a solution, the search statement can conduct a search over any graph or network. Structurally, this statement is modelled after the common switch statement and is put into a largely imperative/procedural context to allow for immediate and intuitive development by most programmers. The Go programming language has been used as a foundation and proof-of-concept of the search statement. A Go compiler is provided which implements this construct.
Dissertation/Thesis
Masters Thesis Software Engineering 2018
APA, Harvard, Vancouver, ISO, and other styles
49

Pillay, Nelishia. "An investigation into the use of genetic programming for the induction of novice procedural programming solution algorithms in intelligent programming tutors." Thesis, 2004. http://hdl.handle.net/10413/2511.

Full text
Abstract:
Intelligent programming tutors have proven to be an economically viable and effective means of assisting novice programmers overcome learning difficulties. However, the large-scale use of intelligent programming tutors has been impeded by the high developmental costs associated with building intelligent programming tutors. The research presented in this thesis forms part of a larger initiative aimed at reducing these costs by building a generic architecture for the development of intelligent programming tutors. One of the facilities that must be provided by the generic architecture is the automatic generation of solutions to programming problems. The study presented in the thesis examines the use of genetic programming as means of inducing solution algorithms to novice programming problems. The scope of the thesis is limited to novice procedural programming paradigm problems requiring the use of arithmetic, string manipulation, conditional, iterative and recursive programming structures. The methodology employed in the study is proof-by-demonstration. A genetic programming system for the induction of novice procedural solution algorithms was implemented and tested on randomly chosen novice procedural programming problems. The study has identified the standard and advanced genetic programming features needed for the successful generation of novice procedural solution algorithms. The outcomes of this study include the derivation of an internal representation language for representing procedural solution algorithms and a high-level programming problem specification format for describing procedural problems, in the generic architecture. One of the limitations of genetic programming is its susceptibility to converge prematurely to local optima and not find a solution in some cases. The study has identified fitness function biases against certain structural components that are needed to find a solution, as an additional cause of premature convergence in this domain. It presents an iterative structure-based algorithm as a solution to this problem. This thesis has contributed to both the fields of genetic programming and intelligent programming tutors. While genetic programming has been successfully implemented in various domains, it is usually applied to a single problem within that domain. In this study the genetic programming system must be capable of solving a number of different programming problems in different application domains. In addition to this, the study has also identified a means of overcoming premature convergence caused by fitness function biases in a genetic programming system for the induction of novice procedural programming algorithms. Furthermore, although a number of studies have addressed the student modelling and pedagogical aspects of intelligent programming tutors, none have examined the automatic generation of problem solutions as a means of reducing developmental costs. Finally, this study has contributed to the ongoing research being conducted by the artificial intelligence in education community, to test the effectiveness of using machine learning techniques in the development of different aspects of intelligent tutoring systems.
Thesis (Ph.D.)-University of KwaZulu-Natal, 2004.
APA, Harvard, Vancouver, ISO, and other styles
50

"Effects of language features, templates, and procedural skills on problem solving in programming." Chinese University of Hong Kong, 1988. http://library.cuhk.edu.hk/record=b5885911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Procedural programming' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography