Dissertations / Theses: 'Structured programming'

1

Brandis, Marc Brandis Marc Michael. "Optimizing compilers for structured programming languages /." [S.l.] : [s.n.], 1995. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yang, Jin. "Co-ordination based structured parallel programming." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

梁秉雄 and Ping-hung Karl Richard Leung. "Towards a semantics bridge between structured specifications and logicspecifications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B31210454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Leung, Ping-hung Karl Richard. "Towards a semantics bridge between structured specifications and logic specifications /." [Hong Kong : University of Hong Kong], 1992. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13212771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Greggains, A. "A structured computing environment." Thesis, University of Cambridge, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304375.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Huxford, David C. Jr. "Selection of programming languages for structural engineering." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45671.

Full text

Abstract:

This thesis presents the concepts of structured programming and illustrates how they can be used to develop efficient and reliable programs and aid in language selection. Topics are presented and used to compare several languages with each other rather than with some abstract ideal. Structured design is a set of concepts that aids the decomposition of a problem using basic block structures into manageable subproblems. Decomposition is a process whereby the large problem is decomposed into components that can be easily understood. This process is continued until the smallest component can be represented by a unit of code performing a single action. By means of the four basic building blocks the atom, concatenation, selection, and repetition one can produce a correct well structured program. In addition, the top-down approach and/or the bottom up approach can assist in producing a structured program that is easy to design, code, debug, modify, and maintain. These approaches minimize the number of bugs and the time spent in the debugging process. Various testing techniques supporting the structured programming process are presented to aid in determining a program's correctness. The languages must support structured programming. Microsoft FORTRAN, Microsoft QuickBASIC, Turbo Pascal, and Microsoft C are analyzed and compared on the basis of syntactic style, semantic structure, data types and manipulation, application facilities, and application requirements. Example programs are presented to reinforce these concepts. Frame programs are developed in these languages and are used to assist in the language evaluation.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

7

Trick, Michael Alan. "Networks with additional structured constraints." Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/23371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Romero, M. B. A. "Graphical creation of structured programs." Thesis, University of Sussex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Blank, Richard P. "A structured programming approach for complex AUV mission control." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA274783.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wu, Jing 1964. "A parallel flow analysis method on structured programming languages." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23951.

Full text

Abstract:

Ideally, compilers should produce object code that is at least as efficient as hand-written code. The key step toward this goal is developing techniques by which a compiler can derive the information that can help in optimization. This is the concern of flow analysis. Recently, with the emergence of parallel computer systems, both parallelization of the compiler and production of code for parallel processors have become crucial issues for compiler development (1,2,3).
This thesis presents new methods of compiler flow analysis for modern computer languages running on a uniprocessor or multiprocessor. These methods allow flow analysis information to be extracted directly from a high-level representation of the source programs, even in parallel. To achieve this goal, we develop and utilize the Extended Abstract Syntax Tree (EAST), and the Symbol Table Data Relational Tree (STDRT) representations, to perform our flow analysis based on these structures. By these approaches, the compiler is able to keep the most useful information and apply this information during various optimization stages. We also introduce several scheduling algorithms for parallelizing the flow analysis phase. An experimental compiler and its results support the usefulness of these methods.

APA, Harvard, Vancouver, ISO, and other styles

11

Edwards, Helen M. "Interfacing structured systems analysis and design and programming methods." Thesis, University of Sunderland, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278933.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Qiang, Feng. "Parallel problem generation for structured problems in mathematical programming." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11688.

Full text

Abstract:

The aim of this research is to investigate parallel problem generation for structured optimization problems. The result of this research has produced a novel parallel model generator tool, namely the Parallel Structured Model Generator (PSMG). PSMG adopts the model syntax from SML to attain backward compatibility for the models already written in SML [1]. Unlike the proof-of-concept implementation for SML in [2], PSMG does not depend on AMPL [3]. In this thesis, we firstly explain what a structured problem is using concrete real-world problems modelled in SML. Presenting those example models allows us to exhibit PSMG’s modelling syntax and techniques in detail. PSMG provides an easy to use framework for modelling large scale nested structured problems including multi-stage stochastic problems. PSMG can be used for modelling linear programming (LP), quadratic programming (QP), and nonlinear programming (NLP) problems. The second part of this thesis describes considerable thoughts on logical calling sequence and dependencies in parallel operation and algorithms in PSMG. We explain the design concept for PSMG’s solver interface. The interface follows a solver driven work assignment approach that allows the solver to decide how to distribute problem parts to processors in order to obtain better data locality and load balancing for solving problems in parallel. PSMG adopts a delayed constraint expansion design. This allows the memory allocation for computed entities to only happen on a process when it is necessary. The computed entities can be the set expansions of the indexing expressions associated with the variable, parameter and constraint declarations, or temporary values used for set and parameter constructions. We also illustrate algorithms that are important for delivering efficient implementation of PSMG, such as routines for partitioning constraints according to blocks and automatic differentiation algorithms for evaluating Jacobian and Hessian matrices and their corresponding sparsity partterns. Furthermore, PSMG implements a generic solver interface which can be linked with different structure exploiting optimization solvers such as decomposition or interior point based solvers. The work required for linking with PSMG’s solver interface is also discussed. Finally, we evaluate PSMG’s run-time performance and memory usage by generating structured problems with various sizes. The results from both serial and parallel executions are discussed. The benchmark results show that PSMG achieve good parallel efficiency on up to 96 processes. PSMG distributes memory usage among parallel processors which enables the generation of problems that are too large to be processed on a single node due to memory restriction.

APA, Harvard, Vancouver, ISO, and other styles

13

Norman, Michael John. "SSDE : structured software development environment." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/15899.

Full text

Abstract:

Bibliography: pages 219-230.
Software engineers have identified many problem areas regarding the development of software. There is a need for improving system and program quality at design level, ensuring that design costs remain within the budget, and increasing the productivity of designers. Structured Software Development Environment (SSDE) provides the system designer with an interactive menu-driven environment, and a framework within which he can conveniently express and manipulate his proposed solution. This representation is in terms of both a conceptual model and a detailed software logic definition. Thus SSDE provides tools for both high-level (or logical) and low-level (or physical) design. It allows a user to follow his own preferred methodology rather than restricting him to one specific strategy. SSDE builds and maintains databases that record all design decisions. It provides the system designer with a mechanism whereby systems can easily be modified and new systems can evolve from similar existing systems. There are several auxiliary facilities as productivity aids. SSDE generates PASCAL code for low-level design constructs, ·full documentation of both the high- and low-level designs for inclusion in the project file, as well as a skeleton manual. The system was evaluated by a number of independent users. This exercise clearly demonstrated its success as an aid in expressing, understanding, manipulating and solving software development problems.

APA, Harvard, Vancouver, ISO, and other styles

14

Barenblat, Benjamin Ezra. "Memory-safe microcontroller applications with the Bedrock structured programming system." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100294.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
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 71-72).
Microcontrollers - low-power, real-mode CPUS - drive digital electronics all over the world, making their safety and reliability critical. However, microcontrollers generally lack the memory protection common in desktop processors, so memory safety must come through other means. One such mechanism is Bedrock, a library for the Coq proof assistant that applies separation logic to a small c-like language, allowing programmers to prove memory-related properties about their code. I used Bedrock to build a security peripheral out of a Cortex-m3 microcontroller; my peripheral provides both AES encryption and append-only logging to a host system, and I showed the software it runs is memory-safe. Working with Bedrock was challenging but rewarding, and it provides a glimpse into a future where system programmers can prove code correct as a matter of course.
by Benjamin Ezra Barenblat.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

15

Ng, Kee Siong. "Learning comprehensible theories from structured data /." View thesis entry in Australian Digital Theses Program, 2005. http://thesis.anu.edu.au/public/adt-ANU20051031.105726/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Fink, Stephen J. "A programming model for block-structured scientific calculations on SMP clusters /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1998. http://wwwlib.umi.com/cr/ucsd/fullcit?p9835374.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Heerjee, K. B. "An interactive, graphical, program design and development environment." Thesis, University of Abertay Dundee, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382796.

Full text

Abstract:

New software development methodologies are being produced with increasing frequency. The latest techniques claim to produce software of unprecedented reliability and productivity, yet are seldom substantiated by empirical evidence. Researchers in the field of human-computer interactions have long held the view that well designed interactive systems increase performance levels over conventional techniques. Intuitively this seems logical, but very little work has been done to substantiate this claim empirically. This thesis aims to show that well designed structured programming environments provide productivity gains and increase performance levels over conventional techniques. An Animated Programming Environment (APE), has been developed which is an interactive, graphical, program design and development system that embodies structured programming and top-down design. The system supports the development of programs for a variety of block structured languages whilst working conceptually at the level of Jackson diagrams. Formal methods were applied to validate and verify the APE system. The immediate benefits are an increased understanding of the system and the detection of some errors in the implementation. By interrogating the implementation and documentation, axiomatic specifications were written and a prototype of the APE system developed in Standard ML. The principal benefit of constructing a formal model is the development of a framework to aid communication between personnel involved with system maintenance. The model can also be used to investigate future changes, and since this framework provides relevant abstraction of user and system behaviour it should facilitate improved documentation and user learning. Evaluation of the system was carried out during the design and implementation stages of the development life-cycle. The evaluation was based on responses to a questionnaire and a comparison with conventional means of generating code. The questionnaire evaluation elicited users' general impressions about the system and its interface, and their detailed views on more specific aspects of the system. The comparative evaluation showed no difference in the median quality of the solution to a programming problem, but a significantly reduced time and variance in quality compared to conventional methods.

APA, Harvard, Vancouver, ISO, and other styles

18

Messina, Emily Suzanne. "Examining the Effects of Structured and Non-Structured Therapeutic Activity Programming in a Forensic Mental Health Treatment Facility." Diss., Temple University Libraries, 2011. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/149937.

Full text

Abstract:

Public Health
Ph.D.
Examining the Effects of Structured and Non-Structured Therapeutic Activity Programming in a Forensic Mental Health Treatment Facility: North Florida Evaluation and Treatment Center (NFETC) is an evaluation and treatment center for individuals with mental illnesses who are involved in the criminal justice system. NFETC offers services to adult males who are either incompetent to proceed to trial or have been judged to be not guilty by reason of insanity. In 2005, DCF implemented a system of structured programming in their state forensic psychiatric hospitals. Resident programming went from a referral based activity program (approximately 6 hours per week for each resident) to a structured activity program (approximately 24 hours per week for each resident). In the previous system, a resident's involvement in the referral based activity program was initiated by the residents' counselor and based on the resident's interests. In the current structured TAP program, all residents now average 24 hours per week of activity involvement. Resident attendance is mandatory for those well enough to attend programming. Despite the importance decreasing length of stay (LOS) has on state legal and criminal systems, little research exists on the role recently implemented structured programming plays in resident LOS. This study contains Retrospective Quantitative analyses on the relationships between facility programming and resident demographics, criminal charges, mental health diagnoses, LOS, and attendance and participation rates; as well as Qualitative analyses on program offerings and staff impressions of the current structured programming at NFETC. The results suggest that, despite many differences between the samples of residents receiving the two programs, there is a therapeutic value to the activity programs offered regardless of the program setting. With consideration of staff perspectives and quantitative findings, the current program can be restructured to provide additional benefit. The benefits of activity programming in general were evident in the results of the analyses run separately for each program. Within the Referral based programming, residents with lower participation levels had an increased LOS. Within the structured TAP programming, residents with lower participation levels had an increased LOS and residents with high participation levels had a decreased LOS. These results indicate that involvement in therapeutic activities, regardless of programming format, may be beneficial in decreasing LOS. The Qualitative staff interview component of the current research provided additional insight into issues related to the prior and current program offerings at NFETC, much of which were supported by the Quantitative data. Qualitative findings included staff impressions of both programs as well as issues regarding LOS, value of therapeutic activities, accessibility, attendance, resident choice, internal motivation, safety, program content, and resident participation. The issues, if addressed, have the potential to streamline the program at NFETC into a more effective and useful therapeutic element. These Quantitative and Qualitative findings should serve as suggestions for a program revamping at NFETC.
Temple University--Theses

APA, Harvard, Vancouver, ISO, and other styles

19

Cole, Murray Irwin. "Algorithmic skeletons : a structured approach to the management of parallel computation." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/11997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Taylor, Catherine Dawn. "A structured compiler design and its applicability to software reuse." Thesis, Lancaster University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Raj, Himanshu. "Integrated alerting for structured and free-text data in TriggerMan." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000346.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains viii, 60 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

22

Hill, David Steven. "A prototype for converting linear programming (LP) models to structured modeling graphs." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27228.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Semmens, Lesely T. "Methods integration : rigorous systems specification using structured analysis and formal notations." Thesis, Leeds Beckett University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Ayre, John. "Object-oriented development using the structured techniques : an entity-event approach." Thesis, University of Ulster, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Selig, Calvin Lee. "ADLIF-a structured design language for metric analysis." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45917.

Full text

Abstract:

Since the inception of software engineering, the major goal has been to control the development and maintenance of reliable software. To this end, many different design methodologies have been presented as a means to improve software quality through semantic clarity and syntactic accuracy during the specification and design phases of the software life cycle. On the other end of the life cycle, software quality metrics have been proposed to supply quantitative measures of the resultant software. This study is an attempt to unify the two concepts by providing a means to determine the quality of a design before its implementation.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

26

Antonucci, Franco. "Transforming data flow diagrams to software structure using the Yourdon-Constantine methodology." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9817.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Khammassi, Nader. "High-level structured programming models for explicit and automatic parallelization on multicore architectures." Thesis, Lorient, 2014. http://www.theses.fr/2014LORIS350/document.

Full text

Abstract:

La prolifération des architectures multi-coeurs est source d’unepression importante pour les developpeurs, qui doivent chercherà paralléliser leurs applications de manière à profiter au mieux deces plateformes. Malheureusement, les modèles de programmationde bas niveau amplifient les difficultés inhérentes à la conceptiond’applications complexes et parallèles. Il existe donc une attentepour des modèles de programmation de plus haut niveau, quipuissent simplifier la vie des programmeurs de manière significative,tout en proposant des abstractions suffisantes pour absorberl’hétérogénéité des architectures matérielles.Contrairement à une multitude de modèles de programmation parallèlequi introduisent de nouveaux langages, annotations ou étendentdes langages existants et requièrent donc des compilateurs spécialisés,nous exploitons ici le potentiel du language C++ standardet traditionnel. En particulier nous avons recours à ses capacitésen terme de meta-programmation, afin de fournir au programmeurune interface de programmation parallèle simple et directe. Cetteinterface autorise le programmeur à exprimer le parallélismede son application au prix d’une altération négligeable du codeséquentiel initial. Un runtime intelligent se charge d’extraire touteinformation relative aux dépendances de données entre tâches,ainsi que celles relatives à l’ordonnancement. Nous montronscomment ce runtime est à même d’exploiter ces informations dansle but de détecter et protéger les données partagées, puis réaliserun ordonnancement prenant en compte les particularités des caches.L’implémentation initiale de notre modèle de programmation est unelibrairie C++ pure appelée XPU. XPU est conÃ˘gue dans le but defaciliter l’explicitation, par le programmeur, du parallélisme applicatif.Une seconde réalisation appelée FATMA doit être considérée commeune extension d’XPU qui permet une détection automatique desdépendances dans une séquence de tâches : il s’agit donc de parallélisationautomatique, sans recours à quelque outil que se soit,excepté un compilateur C++ standard. Afin de démontrer le potentielde notre approche, nous utilisons ces deux outils –XPU et FATMA–pour paralléliser des problèmes populaires, ainsi que des applicationsindustrielles réelles. Nous montrons qu’en dépit de leur abstractionélevée, nos modèles de programmation présentent des performancescomparables à des modèles de programmation de basniveau,et offrent un meilleur compromis productivité-performance
The continuous proliferation of multicore architectures has placeddevelopers under great pressure to parallelize their applicationsaccordingly with what such platforms can offer. Unfortunately,traditional low-level programming models exacerbate the difficultiesof building large and complex parallel applications. High-level parallelprogramming models are in high-demand as they reduce the burdenson programmers significantly and provide enough abstraction toaccommodate hardware heterogeneity. In this thesis, we proposea flexible parallelization methodology, and we introduce a newtask-based parallel programming model designed to provide highproductivity and expressiveness without sacrificing performance.Our programming model aims to ease expression of both sequentialexecution and several types of parallelism including task, data andpipeline parallelism at different granularity levels to form a structuredhomogeneous programming model.Contrary to many parallel programming models which introducenew languages, compiler annotations or extend existing languagesand thus require specialized compilers, extra-hardware or virtualmachines..., we exploit the potential of the traditional standardC++ language and particularly its meta-programming capabilities toprovide a light-weight and smart parallel programming interface. Thisprogramming interface enable programmer to express parallelismat the cost of a little amount of extra-code while reuse its legacysequential code almost without any alteration. An intelligent run-timesystem is able to extract transparently many information on task-datadependencies and ordering. We show how the run-time system canexploit these valuable information to detect and protect shared dataautomatically and perform cache-aware scheduling.The initial implementation of our programming model is a pure C++library named "XPU" and is designed for explicit parallelism specification.A second implementation named "FATMA" extends XPU andexploits the transparent task dependencies extraction feature to provideautomatic parallelization of a given sequence of tasks withoutneed to any specific tool apart a standard C++ compiler. In order todemonstrate the potential of our approach, we use both of the explicitand automatic parallel programming models to parallelize popularproblems as well as real industrial applications. We show thatdespite its high abstraction, our programming models provide comparableperformances to lower-level programming models and offersa better productivity-performance tradeoff

APA, Harvard, Vancouver, ISO, and other styles

28

Dick, Grant, and n/a. "Spatially-structured niching methods for evolutionary algorithms." University of Otago. Department of Information Science, 2008. http://adt.otago.ac.nz./public/adt-NZDU20080902.161336.

Full text

Abstract:

Traditionally, an evolutionary algorithm (EA) operates on a single population with no restrictions on possible mating pairs. Interesting changes to the behaviour of EAs emerge when the structure of the population is altered so that mating between individuals is restricted. Variants of EAs that use such populations are grouped into the field of spatially-structured EAs (SSEAs). Previous research into the behaviour of SSEAs has primarily focused on the impact space has on the selection pressure in the system. Selection pressure is usually characterised by takeover times and the ratio between the neighbourhood size and the overall dimension of space. While this research has given indications into where and when the use of an SSEA might be suitable, it does not provide a complete coverage of system behaviour in SSEAs. This thesis presents new research into areas of SSEA behaviour that have been left either unexplored or briefly touched upon in current EA literature. The behaviour of genetic drift in finite panmictic populations is well understood. This thesis attempts to characterise the behaviour of genetic drift in spatially-structured populations. First, an empirical investigation into genetic drift in two commonly encountered topologies, rings and torii, is performed. An observation is made that genetic drift in these two configurations of space is independent of the genetic structure of individuals and additive of the equivalent-sized panmictic population. In addition, localised areas of homogeneity present themselves within the structure purely as a result of drifting. A model based on the theory of random walks to absorbing boundaries is presented which accurately characterises the time to fixation through random genetic drift in ring topologies. A large volume of research has gone into developing niching methods for solving multimodal problems. Previously, these techniques have used panmictic populations. This thesis introduces the concept of localised niching, where the typically global niching methods are applied to the overlapping demes of a spatially structured population. Two implementations, local sharing and local clearing are presented and are shown to be frequently faster and more robust to parameter settings, and applicable to more problems than their panmictic counterparts. Current SSEAs typically use a single fitness function across the entire population. In the context of multimodal problems, this means each location in space attempts to discover all the optima. A preferable situation would be to use the inherent spatial properties of an SSEA to localise optimisation of peaks. This thesis adapts concepts from multiobjective optimisation with environmental gradients and applies them to multimodal problems. In addition to adapting to the fitness landscape, individuals evolve towards their preferred environmental conditions. This has the effect of separating individuals into regions that concentrate on different optima with the global fitness function. The thesis also gives insights into the expected number of individuals occupying each optima in the problem. The SSEAs and related models developed in this thesis are of interest to both researchers and end-users of evolutionary computation. From the end-user�s perspective, the developed SSEAs require less a priori knowledge of a given problem domain in order to operate effectively, so they can be more readily applied to difficult, poorly-defined problems. Also, the theoretical findings of this thesis provides a more complete understanding of evolution within spatially-structured populations, which is of interest not only to evolutionary computation practitioners, but also to researchers in the fields of population genetics and ecology.

APA, Harvard, Vancouver, ISO, and other styles

29

Smith, Lucy Michelle. "Development of a structured design and programming methodology for expert system shells utilizing a visual programming language : application of structured methodology to the MK92 Maintenance Advisor Expert System, Performance module prototype." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA289897.

Full text

Abstract:

Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1994.
Thesis advisor(s): Magdi Kamel, Martin J. McCaffrey. "September 1994." Bibliography: p. 144-145. Also available online.

APA, Harvard, Vancouver, ISO, and other styles

30

Mauricio, Toro. "Structured Interactive Scores." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2012. http://tel.archives-ouvertes.fr/tel-00736021.

Full text

Abstract:

La plupart des sc\'narios multimédia interactifs sont bas\'{e}s sur des sp\'cifications informelles, il n'est donc pas possible de v\'{e}rifier formellement des propri\'t\'{e}s de ces syst\'mes. Nous pr\'{e}conisons la n\'cessit\'{e} d'un mod\'le g\'{e}n\'ral et formel. Partitions interactives est un formalisme pour d\'{e}crire des sc\'narios multim\'{e}dia interactifs. Nous proposons une nouvelle s\'mantique pour les partitions interactives bas\'{e}e sur les structures d'\'v\'{e}nements temporisés. Avec une telle s\'mantique, nous pouvons sp\'{e}cifier des propri\'t\'{e}s pour le syst\'me, en particulier, des propri\'{e}t\'s sur les traces, qui sont difficiles \'{a} pr\'ciser avec la programmation par contraintes. Nous pr\'{e}sentons \'galement une s\'{e}mantique op\'rationnelle des partitions interactives bas\'{e}e sur le calcul non-d\'terministe, temporis\'{e}, concurrent, par contraintes (ntcc) et nous rapportons la s\'mantique operationelle \'{a} la semantique en structures d'\'v\'{e}nements temporisés. Avec la s\'mantique op\'{e}rationnelle, nous pouvons d\'crire formellement le comportement d'un scenario dont les dur\'{e}es des objets temporels peuvent \^{e}tre des intervalles d'entiers arbitraires. La s\'mantique op\'{e}rationnelle est obtenue \' partir de la s\'{e}mantique en structures d'\'v\'{e}nements temporisés de la partition interactive. Pour fournir une telle traduction, nous avons d'abord d\'fini la forme normale d'une structure d'\'{e}v\'nements temporisés, dans laquel les \'{e}v\'nements li\'{e}s avec une dur\'e z\'{e}ro sont regroup\'s en un seul. Nous avons \'{e}galement d\'fini la notion de structures d'\'{e}v\'nements temporisés r\'{e}partissables, de telle sorte que son graphe de contraintes peut \^{e}tre exp\'di\'{e} en se fondant uniquement sur la propagation locale. Nous croyons que la s\'mantique op\'{e}rationnelle bas\'e sur ntcc offre certains avantages par rapport \'{a} la s\'mantique des partitions interactives bas\'{e}e sur des r\'seaux de Petri; par exemple, les dur\'{e}es des objets temporels peuvent \^{e}tre des intervalles d'entiers arbitraires, tandis que dans la plupart des mod\'les de partitions interactives, les intervalles ne peut \^tre utilis\'{e}s que pour repr\'senter les relations telles que l'\'{e}galit\' et les inégalités. Nos mod\'{e}les ntcc de partitions interactives sont ex\'cut\'{e}s en utilisant Ntccrt, un interpr\'te temps r\'{e}el pour ntcc. Nos mod\'les peuvent \'{e}galement \^{e}tre v\'rifi\'{e}s automatiquement en utilisant ntccMC, un verificateur pour ntcc, de temps born\', bas\'{e}e sur les automates finis, que nous introduisons dans cette th\'se. En utilisant ntccMC, nous pouvons v\'{e}rifier des propri\'t\'{e}s de logique de temps lin\'aire avec des contrantes (CLTL). Dans cette th\'{e}se, nous introduisons deux extensions du formalisme de partitions interactives: (1) l'une pour g\'rer le traitement audio en utilisant le langage de programmation fran\c cais Faust et (2) l'autre pour traiter des condition et des branchements, permettant de sp\'{e}cifier des choix et des boucles. Pour la premi\'re extension, nous pr\'{e}sentons une s\'mantique bas\'{e}e sur les structures d'\'v\'{e}nements temporisés et des id\'es sur la fa\c con de d\'{e}finir une s\'mantique op\'{e}rationnelle. Pour la deuxi\'me extension, nous pr\'{e}sentons une mise en \oe uvre et la comparaison des r\'sultats du jitter relative moyenne d'une impl\'{e}mentation d'un arp\'ge base sur l'algorithme de Karplus-Strong par rapport aux impl\'{e}mentations existants \'crits dans Pure Data. Nous d\'{e}finissons aussi un format de sauvegarde XML pour les partitions interactives et pour la extension avec branchement conditionnel. Un format de sauvegarde est crucial pour assurer la persistance des partitions.

APA, Harvard, Vancouver, ISO, and other styles

31

Edler, Von Koch Tobias Joseph Kastulus. "Automated detection of structured coarse-grained parallelism in sequential legacy applications." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9976.

Full text

Abstract:

The efficient execution of sequential legacy applications on modern, parallel computer architectures is one of today’s most pressing problems. Automatic parallelization has been investigated as a potential solution for several decades but its success generally remains restricted to small niches of regular, array-based applications. This thesis investigates two techniques that have the potential to overcome these limitations. Beginning at the lowest level of abstraction, the binary executable, it presents a study of the limits of Dynamic Binary Parallelization (Dbp), a recently proposed technique that takes advantage of an underlying multicore host to transparently parallelize a sequential binary executable. While still in its infancy, Dbp has received broad interest within the research community. This thesis seeks to gain an understanding of the factors contributing to the limits of Dbp and the costs and overheads of its implementation. An extensive evaluation using a parameterizable Dbp system targeting a Cmp with light-weight architectural Tls support is presented. The results show that there is room for a significant reduction of up to 54% in the number of instructions on the critical paths of legacy Spec Cpu2006 benchmarks, but that it is much harder to translate these savings into actual performance improvements, with a realistic hardware-supported implementation achieving a speedup of 1.09 on average. While automatically parallelizing compilers have traditionally focused on data parallelism, additional parallelism exists in a plethora of other shapes such as task farms, divide & conquer, map/reduce and many more. These algorithmic skeletons, i.e. high-level abstractions for commonly used patterns of parallel computation, differ substantially from data parallel loops. Unfortunately, algorithmic skeletons are largely informal programming abstractions and are lacking a formal characterization in terms of established compiler concepts. This thesis develops compiler-friendly characterizations of popular algorithmic skeletons using a novel notion of commutativity based on liveness. A hybrid static/dynamic analysis framework for the context-sensitive detection of skeletons in legacy code that overcomes limitations of static analysis by complementing it with profiling information is described. A proof-of-concept implementation of this framework in the Llvm compiler infrastructure is evaluated against Spec Cpu2006 benchmarks for the detection of a typical skeleton. The results illustrate that skeletons are often context-sensitive in nature. Like the two approaches presented in this thesis, many dynamic parallelization techniques exploit the fact that some statically detected data and control flow dependences do not manifest themselves in every possible program execution (may-dependences) but occur only infrequently, e.g. for some corner cases, or not at all for any legal program input. While the effectiveness of dynamic parallelization techniques critically depends on the absence of such dependences, not much is known about their nature. This thesis presents an empirical analysis and characterization of the variability of both data dependences and control flow across program runs. The cBench benchmark suite is run with 100 randomly chosen input data sets to generate whole-program control and data flow graphs (Cdfgs) for each run, which are then compared to obtain a measure of the variance in the observed control and data flow. The results show that, on average, the cumulative profile information gathered with at least 55, and up to 100, different input data sets is needed to achieve full coverage of the data flow observed across all runs. For control flow, the figure stands at 46 and 100 data sets, respectively. This suggests that profile-guided parallelization needs to be applied with utmost care, as misclassification of sequential loops as parallel was observed even when up to 94 input data sets are used.

APA, Harvard, Vancouver, ISO, and other styles

32

Kang, Kyehong. "A structured reduced sequential quadratic programming and its application to a shape design problem." Diss., Virginia Tech, 1994. http://hdl.handle.net/10919/38565.

Full text

Abstract:

The objective of this work is to solve a model one dimensional duct design problem using a particular optimization method. The design problem is formulated as an equality constrained optimization, called All at once method, so that the analysis problem is not solved until the optimal design is reached. Furthermore, the block structure in the Jacobian of the linearized constraints is exploited by decomposing the variables into the design and flow parts. To achieve this, Sequential quadratic programming with BFGS update for the reduced Hessian of the Lagrangian function is used with Variable reduction method which preserves the structure of the Jacobian in representing the null space basis matrix. By updating the reduced Hessians only of which the dimension is the number of design variables, the storage requirement for Hessians is reduced by a large amount. In addition, the flow part of the Jacobian can be computed analytically. The algorithm with a line search globalization is described. A global and local analysis is provided with a modification of the paper by Byrd and Nocedal [Mathematical Programming 49(1991) pp 285-323] in which they analyzed the similar algorithm with the Orthogonal factorization method which assumes the orthogonality of the null space basis matrix. Numerical results are obtained and compared favorably with results from the Black box method - unconstrained optimization formulation.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

33

Ulular, Osman. "A primal-dual conjugate subgradient algorithm for large- scale/specially structured linear programming problems." Diss., Virginia Polytechnic Institute and State University, 1988. http://hdl.handle.net/10919/77750.

Full text

Abstract:

This dissertation deals with a primal-dual conjugate subgradient-based algorithm for solving large-scale and/or specially structured linear programming problems. The proposed algorithm coordinates a Lagrangian dual function and a primal penalty function which satisfies a flexible set of specified properties, in order to generate a sequence of primal and dual iterates which can be shown to converge to an optimal pair of primal and dual solutions. Besides producing both primal and dual solutions, this coordination of primal and dual functions serves to guide the crucial choice of step-sizes in the iterative algorithm, and also provides a natural stopping criterion based on the duality gap. The generic algorithm maintains a considerable degree of flexibility which permits one to exploit any special structures inherent in the problem. Moreover, the algorithm admits a rich variety of admissible penalty functions and dual formulations in designing a particular implementation scheme. Other algorithmic strategies that can be gainfully employed to improve the performance of the algorithm include space-dilation and box step techniques, pattern search strategies and suboptimization based on complementary slackness conditions. The algorithm is tested on three different transportation problems with additional constraints which are faced by the Freight Equipment Management Program of the Association of American Railroads. Problem 1 is a maximin problem in which ∫(x) = minimum {∫,(x), r=1, ... , R} is maximized subject to the transportation constraints and a total cost constraint, where ∫, (·) is a savings function for the r^th railroad, for r=1, ... , R. Problem 2 minimizes weighted absolute deviations of ∫, (x); r=1, ... , R from its mean value subject to the Problem 1 constraint set. Problem 3, on the other hand, minimizes total cost subject to the transportation constraints and the constraint which requires each ∫, (x), r=1, ... , R to be at least at some desired level. Both theoretical issues concerning convergence properties and rates, as well as algorithmic design and computational performance issues are investigated. The results indicate that the algorithm is a viable strategy for these problems. In particular, a new conjugate gradient strategy emerges as a byproduct of this algorithm, which is shown to dominate other available strategies on standard test problems from the literature.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

34

Eisenlohr, John Merrick. "Parallel ILU Preconditioning for Structured Grid Matrices." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429820221.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Baird, Michael H. "An initial development and demonstration of a sentence-structured computer language for control application." Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183127167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Bau, Alexander. "SAT Compilation for Constraints over Structured Finite Domains." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-221884.

Full text

Abstract:

A constraint is a formula in first-order logic expressing a relation between values of various domains. In order to solve a constraint, constructing a propositional encoding is a successfully applied technique that benefits from substantial progress made in the development of modern SAT solvers. However, propositional encodings are generally created by developing a problem-specific generator program or by crafting them manually, which often is a time-consuming and error-prone process especially for constraints over complex domains. Therefore, the present thesis introduces the constraint solver CO4 that automatically generates propositional encodings for constraints over structured finite domains written in a syntactical subset of the functional programming language Haskell. This subset of Haskell enables the specification of expressive and concise constraints by supporting user-defined algebraic data types, pattern matching, and polymorphic types, as well as higher-order and recursive functions. The constraint solver CO4 transforms a constraint written in this high-level language into a propositional formula. After an external SAT solver determined a satisfying assignment for the variables in the generated formula, a solution in the domain of discourse is derived. This approach is even applicable for finite restrictions of recursively defined algebraic data types. The present thesis describes all aspects of CO4 in detail: the language used for specifying constraints, the solving process and its correctness, as well as exemplary applications of CO4.

APA, Harvard, Vancouver, ISO, and other styles

37

Östlund, Johan. "Language Constructs for Safe Parallel Programming on Multi-Cores." Doctoral thesis, Uppsala universitet, Datalogi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-266795.

Full text

Abstract:

The last decade has seen the transition from single-core processors to multi-cores and many-cores. This move has by and large shifted the responsibility from chip manufacturers to programmers to keep up with ever-increasing expectations on performance. In the single-core era, improvements in hardware capacity could immediately be leveraged by an application: faster machine - faster program. In the age of the multi-cores, this is no longer the case. Programs must be written in specific ways to utilize available parallel hardware resources. Programming language support for concurrent and parallel programming is poor in most popular object-oriented programming languages. Shared memory, threads and locks is the most common concurrency model provided. Threads and locks are hard to understand, error-prone and inflexible; they break encapsulation - the very foundation of the object-oriented approach. This makes it hard to break large complex problems into smaller pieces which can be solved independently and composed to make a whole. Ubiquitous parallelism and object-orientation, seemingly, do not match. Actors, or active objects, have been proposed as a concurrency model better fit for object-oriented programming than threads and locks. Asynchronous message passing between actors each with a logical thread of control preserves encapsulation as objects themselves decide when messages are executed. Unfortunately most implementations of active objects do not prevent sharing of mutable objects across actors. Sharing, whether on purpose or by accident, exposes objects to multiple threads of control, destroying object encapsulation. In this thesis we show techniques for compiler-enforced isolation of active objects, while allowing sharing and zero-copy communication of mutable data in the cases where it is safe to do so. We also show how the same techniques that enforce isolation can be utilized internal to an active object to allow data race-free parallel message processing and data race-free structured parallel computations. This overcomes the coarse-grained nature of active object parallelism without compromising safety.
UPMARC

APA, Harvard, Vancouver, ISO, and other styles

38

Ryder, Karen M. "The Effects of Programming in a Structured Language on The Critical Thinking Skills of College Students." NSUWorks, 1995. http://nsuworks.nova.edu/gscis_etd/815.

Full text

Abstract:

This study was designed to determine if college students could significantly improve their critical thinking skills by completing a computer course in structured programming. Five sections of an introductory programming class formed the experimental group, while five sections of a computer literacy course formed the control group. Both groups took the Watson-Glaser Critical Thinking Appraisal, Form A, for their pre - test. Form B of the same test was their post-test. Possible correlates tested included gender, age group, class standing, and major area of study. Slippery Rock University students who were enrolled in the ten sections of either the introductory programming course (n = 71) or the computer literacy course (n = 122) in the spring semester of 1994 were tested at the beginning and end of the courses. Data were collected by means of a standardized test and a demographic survey. Hypotheses were tested at the .05 confidence level using a ~ test, an analysis of variance, or an analysis of covariance, whichever was applicable. Students in the programming course did significantly improve their critical thinking scores at the .10 confidence level, but not at the desired .05 confidence level. However, at the .05 confidence level, students in the programming course did increase their critical thinking scores significantly more than the students in the literacy course. The correlates tested - gender, age group, class standing, and major study area - were found to be not significantly related to critical thinking skills. These results spawned several curriculum recommendations. Suggestions for future studies included expanding the study group size, testing other programming languages, and encompassing several more semesters of time.

APA, Harvard, Vancouver, ISO, and other styles

39

McKenzie-Sherrod, Marsha. "Structured self-reflection in cultural competency programming for pre-health care professionals| An evaluation of curriculum effectiveness." Thesis, Union Institute and University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10294528.

Full text

Abstract:

In the United States, the patient population has substantially grown more ethnically diverse. Many of these patients present with ailments, such as heart disease, diabetes, and stroke, at a higher rate than their Anglo-European counterparts. Subsequent research has established a link between the health disparities of ethnically diverse communities and the lack of culturally competent physicians. Further investigation reveals cultural competency curriculum that omits the course element of self-reflection was less effective in achieving program objectives than those that provide an opportunity to explore one's own cultural background. This study proposes cultural competence curricula that include a structured self-reflective element, or opportunities to revisit past behaviors of one's self within the context of ethnic and cultural diversity, will assist undergraduate healthcare students develop their cultural skill through awareness of their own cultural values, biases, assumptions and belief systems, and how these aspects direct subsequent patient interactions. Pre- and post-course surveys and questionnaires were used to obtain data from 45 undergraduate respondents for this mixed methods study.

The results of this study, as analyzed by the Mann-Whitney U test, were unable to definitively prove that there is a statistically significant difference in the level of cultural competence between those who participate in training that includes a structured self-reflective component and those who do not. However, this research shows there is an observable movement away from 0 on the z-distribution curve, which is closer to the critical threshold, and an increase in the median IDI v3 scores on the cultural competence continuum by participants who enroll in an interpersonal communication course where structured self-reflective activities or opportunities to examine concepts of self are imbedded within the curriculum. Therefore, this study concludes the integration of structured self-reflective activities into intercultural curricula improve cultural competence acquisition. This improved cultural competence can be applied in the delivery of health care to ethnically diverse patient populations. Further investigation about the influences of power and privilege on personal identity, and the effects of time on cultural competence acquisition, will add to the breadth and depth of self-reflection, health care, and leadership studies.

Key words: structured self-reflection, health disparities, health care, leadership, leadership development, ethical leadership, relational leadership, authentic leadership, culture, cultural competence, pre-health care curriculum, education, social justice

APA, Harvard, Vancouver, ISO, and other styles

40

Mori, Tomoya. "Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wetton, Michael L. "A proposal for a development platform for microcontroller-based devices." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1995. https://ro.ecu.edu.au/theses/1170.

Full text

Abstract:

This thesis is concerned with designing, implementing and testing a miniaturised temperature data logging device. Investigations demonstrated that a microcontroller could provide a low-cost single-chip solution to this problem and after a detailed review of 8-bit microcontrollers, the MC68HCll was chosen for this task. This document also includes discussion on an environment that was developed for creating and testing MC68HC11 software and the use of Motorola's evaluation boards. To ensure that the device was designed to software engineering standards an investigation into software engineering analysis techniques took place. This resulted in the Jackson Structured Programming (JSP) methodology being adapted to produce a proposed development platform suitable for microcontroller-based design.

APA, Harvard, Vancouver, ISO, and other styles

42

Toro-Bermudez, Mauricio. "Structured interactive scores : from a structural description of a multimedia scenario to a real-time capable implementation with formal semantics." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14588/document.

Full text

Abstract:

La plupart des scénarios multimédia interactifs sont basés sur des spécifications informelles, il n'est donc pas possible de vérifier formellement des propriétés de ces systèmes. Nous préconisons la nécessité d'un modèle général et formel. Partitions interactives est un formalisme pour décrire des scénarios multimédia interactifs. Nous proposons une nouvelle sémantique pour les partitions interactives basée sur les structures d'événements temporisés. Avec une telle sémantique, nous pouvons spécifier des propriétés pour le système, en particulier, des propriétés sur les traces, qui sont difficiles à préciser avec la programmation par contraintes. Nous présentons également une sémantique opérationnelle des partitions interactives basée sur le calcul non-déterministe, temporisé, concurrent, par contraintes (ntcc) et nous rapportons la sémantique operationelle à la semantique en structures d'événements temporisés. Avec la sémantique opérationnelle, nous pouvons décrire formellement le comportement d'un scenario dont les durées des objets temporels peuvent être des intervalles d'entiers arbitraires. La sémantique opérationnelle est obtenue à partir de la sémantique en structures d'événements temporisés de la partition interactive. Pour fournir une telle traduction, nous avons d'abord défini la forme normale d'une structure d'événements temporisés, dans laquel les événements liés avec une durée zéro sont regroupés en un seul. Nous avons également défini la notion de structures d'événements temporisés répartissables, de telle sorte que son graphe de contraintes peut être expédié en se fondant uniquementsur la propagation locale. Nous croyons que la sémantique opérationnelle basée sur ntcc offre certains avantages par rapport à la sémantique des partitions interactives basée sur des réseaux de Petri; par exemple, les durées des objets temporels peuvent être des intervalles d'entiers arbitraires, tandis que dans la plupart des modèles de partitions interactives, les intervalles ne peut être utilisés que pour représenterles relations telles que l'égalité et les inégalités. Nos modèles ntcc de partitions interactives sont exécutés en utilisant Ntccrt, un interprète temps réel pour ntcc. Nos modèles peuvent également être vérifiés automatiquement en utilisant ntccMC, un vérificateur pour ntcc, de temps borné, basée sur les automates finis, que nous introduisons dans cette thèse. En utilisant ntccMC, nous pouvons vérifier des propriétés de logique de temps linéaire avec des contrantes (CLTL). Dans cette thèse, nous introduisons deux extensions du formalisme de partitions interactives:(1) l'une pour gérer le traitement audio en utilisant le langage de programmation français Faustet (2) l'autre pour traiter des condition et des branchements, permettant de spécifier des choix et des boucles. Pour la première extension, nous présentons une sémantique basée sur les structures d'événements temporisés et des idées sur la façon de définir une sémantique opérationnelle. Pour la deuxième extension, nous présentons une mise en oeuvre et la comparaison des résultats du jitter relative moyenne d'une implémentation d'un arpège base sur l'algorithme de Karplus-Strong par rapport aux implémentations existants écrits dans Pure Data. Nous définissons aussi un format de sauvegarde XML pour les partitions interactives et pour la extension avec branchement conditionnel. Un format de sauvegarde est crucial pour assurer la persistance des partitions
Technology has shaped the way on which we compose and produce music. Notably, the invention of microphones and computers pushed the development of new music styles in the 20th century. In fact, several artistic domains have been benefiting from such technology developments ; for instance, Experimental music, non-linear multimedia, Electroacoustic music, and interactive multimedia. In this dissertation, we focus on interactive multimedia.Interactive multimedia deals with the design of scenarios where multimedia content and interactive events are handled by computer programs. Examples of such scenarios are multimedia art installations, interactive museum exhibitions, some Electroacoustic music pieces, and some Experimental music pieces. Unfortunately, most interactive multimedia scenarios are based on informal specifications, thus it is not possible to formally verify properties of such systems. We advocate the need of a general and formal model. Interactive scores is a formalism to describe interactive multimedia scenarios. We propose new semantics for interactive scores based on timed eventstructures. With such a semantics, we can specify properties for the system, in particular, properties about traces, which are difficult to specify as constraints. In fact, constraints are an important part of the semantic model of interactive scores because the formalism is based on temporal constraints among the objects of the scenario. We also present an operational semantics of interactive scores based on the non-deterministic timed concurrent constraint (ntcc) calculus and we relate such a semantics to the timed event structures semantics. With the operational semantics, we formally describe the behavior of a score whose temporal object durations can be arbitrary integer intervals. The operational semantics is obtained from the timed event structures semantics of the score. To provide such a translation, we first define the normal form of a timed event structure in which events related with zero-duration delays are collapsed into a single one. We also define the notion of dispatchable timed event structures. Event structures such that its constraint graph can be dispatched by relying only on local propagation.We believe that operational semantics in ntcc offers some advantages over existing Petri nets semantics for interactive scores; for instance, the duration of the temporal objects can be arbitrary integer intervals, whereas inprevious models of interactive scores, such durations can only be intervals to represent equalities and inequalities. In this dissertation, we also introduce two extensions of the formalism of interactive scores : (1) one to handle audio processing using the Fast AUdio Stream (Faust) languageand (2) another one to handle conditional branching, allowing designers to specify choices and loops. For the first extension, we present a timed event structures semantics and ideas on how to define operational semantics. For the second extension, we present an implementation and results comparing the average relative jitter of an implementation ofan arpeggio based on Karplus-Strong with respect to existing implementations of Karplus written in Pure Data. We also define a XML file format for interactive scores and for the conditional branching extension. A file format is crucial to assure the persistence of the scores. Ntcc models of interactive scores are executed using Ntccrt, a real-time capable interpreter for ntcc. They can also be verified automatically using ntccMC, a bounded-time automata based model checker for ntcc which we introduce in this dissertation. Using ntccMC, we can verify properties expressed on constraint linear-time logic. Ntcc has been used in the past, not only for multimedia interaction models, but alsofor system biology, security protocols and robots

APA, Harvard, Vancouver, ISO, and other styles

43

Hopkins, Laura C. "Examining the Potential Protective Effect of Structured Programming on Child Weight during the Summer Months through Intervention and Observational Research." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1510055469050897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Marchi, Francesca. "Sviluppo di applicazioni Web strutturate: DART e JavaScript a confronto." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3551/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Laddaga, Michele. "Evoluzione dei Modelli e delle Tecnologie per il Web: DART e HTML5 come caso di studio." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/4401/.

Full text

Abstract:

Nell’ultimo decenno si è assisitito ad una frenetica evoluzione delle tecnologie di connessione e trasferimento dati, dagli impianti di fibra ottica sempre più diffusi e performanti, alle varie tecnologie mobile UMTS e LTE. Tutto ciò ha permesso a sempre più persone di poter spendere una maggiore fetta del proprio tempo sulla rete sia per svago che per lavoro. Questo ha portato col tempo l’utente interattivo alla ricerca di servizi remoti che prima usufruiva in locale, sia per motivi di portabilità e di interconnessione, sia per una semplice questione di sincronizzazione fra i vari dispositivi posseduti. Il presente progetto di tesi si pone come obiettivo di indagare con occhio ingegneristico all’evoluzione della struttura del web fino ad identificare e analizzare l’attuale necessità di poter avere in rete tutti quei servizi anche completi e strutturalmente complessi che prima si aveva sul proprio desktop; tutto ciò attraverso l’esempio di un nuovo linguaggio di sviluppo per applicazioni web strutturate proposto da Google: DART. In questa analisi non si potrà prescindere dallo studio attento della tecnologia che sin dagli inizi della rete ha fatto da struttura al web ovvero l’Html e il suo ultimo standard Hmtl5. Nella prima parte verrà mostrata, attraverso un breve percorso, la nascita e lo sviluppo del web, sino ai giorni nostri. Si effettuerà quindi una panoramica, rivisitando tutti più importanti passi che hanno portato la rete internet ad essere ciò che oggi utilizziamo, ponendo una particolare attenzione alle attuali esigenze di progettazione della struttura dei servizi web. Nel secondo capitolo viene introdotta la tecnologia a base del web, l’Html; attraverso una breve analisi dell’evoluzione di quest’ultima si arriverà sino all’attuale HTML5 e alle funzionalità offerte nell’ottica della programmazione web strutturata. Nel terzo capitolo si analizzerà in maniera più approfondita la necessità di un web strutturato e le potenzialità del progetto Dart attraverso alcuni esempi esplicativi. Infine si trarranno alcune conclusioni sull’attuale situazione del web, sulla necessità di un web strutturato e sulla possibilità di riuscita del progetto Dart.

APA, Harvard, Vancouver, ISO, and other styles

47

Poernomo, Iman Hafiz 1976. "Variations on a theme of Curry and Howard : the Curry-Howard isomorphism and the proofs-as-programs paradigm adapted to imperative and structured program synthesis." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Alahakoon, Lakpriya Damminda 1968. "Data mining with structure adapting neural networks." Monash University, School of Computer Science and Software Engineering, 2000. http://arrow.monash.edu.au/hdl/1959.1/7987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Tatavalli, Mittadar Nirmal. "Design and implementation of a multi-block parallel algorithm for solving Navier-Stokes equations on structured grids." Thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-05022002-170458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Tang, Wei. "Internet-Scale Information Monitoring: A Continual Query Approach." Diss., Available online, Georgia Institute of Technology, 2003:, 2003. http://etd.gatech.edu/theses/available/etd-12042003-173321/unrestricted/tangwei200312.pdf.

Full text

Abstract:

Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2004.
Thomas E. Potok, Committee Member; Calton Pu, Committee Member; Edward Omiecinski, Committee Member; Leo Mark, Committee Member; Constantinos Dovrolis, Committee Member; Ling Liu, Committee Chair. Includes bibliography.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Structured programming'

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