Quality Assurance (QA) for medical linear accelerators (linac) is the primary concern in external beam radiation therapy. In this research, we have developed a MATLAB-based software named Quality Assurance for Linacs (QALMA), which is unique, due to cost-effectiveness, user friendly interface, and customizability. It includes five modules to perform different QA tests: Star Shot analysis, Picket Fence test, Winston-Lutz test, MLC log file analysis, and verification of light & radiation field coincidence. We also pay attention to quality assurance of 6DOF treatment couch that plays a very important role in radiation therapy. We developed an Arduino based 3D printed 6DOF robotic phantom to check the accuracy of the treatment couch. This robotic phantom was experimentally validated under clinical standards, and customizable upon requirements of the quality assurance Task. The current features of this robotic phantom open development opportunities beyond the specific couch application, such as organs motion simulation. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

The Altair 680b Cross-Assembler is a program written in the Nova Assembly Language. It can be used to assemble Altair 680b assembly language programs. The object code can be punched on paper-tape for execution on the Altair 680b microcomputer. This report describes the design and working of the Cross-Assembler. A program listing and a few sample runs are also included. / Thesis / Master of Science (MSc)

No description available.

<p>Very often, grammars constructed for computer languages are not in a concise form for simple parsing. For example some symbols may be unreachable or useless. If a simple precedence grammar is required, artificial symbols may have to be introduced to remove conflicts. This report describes exploratory steps taken towards the development of an Algol program to automatically manipulate grammars. Procedures are described which read and set up a grammar in a list structure form suitable for analysis and manipulation. The procedures manipulate the grammar to remove useless and unreachable symbols, and precedence conflicts, and they analyse the grammar for recursion, precedence etc.</p> / Master of Science (MS)

A digital library database is a heterogeneous collection of documents. Documents may become available in different formats (e.g., ASCII, SGML, typesetter languages) and they may have to be translated to a standard document representation scheme used by the digital library. This work focuses on the design of a framework that can be used to convert text documents in any format to equivalent documents in different formats and, in particular, to SGML (Standard Generalized Markup Language). In addition, the framework must be able to extract information about the analyzed documents, store that information in a permanent database, and construct hypertext links between documents and the information contained in that database and between the document themselves. For example, information about the author of a document could be extracted and stored in the database. A link can then be established between the document and the information about its author and from there to other documents by the same author. These tasks must be performed without any human intervention, even at the risk of making a small number of mistakes. To accomplish these goals we developed a language called DELTO (Description Language for Textual Objects) that can be used to describe a document format. Given a description for a particular format, our system is able to extract information from documents in that format, to store part of that information in a permanent database, and to use that information in constructing an abstract representation of those documents that can be used to generate equivalent documents in different formats. The system originated from this work is used for constructing the database of Envision, a Virginia Tech digital library research project. / Master of Science

This thesis is concerned by programming language Python and its suitability of his assignment to the tuition. The work is divided into three dominant parts. The first part describes programming language Python, its elementary characteristics and features. The purpose is to introduce its properties to the reader so that he could estimate if there is point in the deeper concern. There are elements of object-oriented programming in description, too. The second part analyses programming language Python on the basis of ten criteria which are defined considering applicability of the language in preliminary courses of programming. The purpose is to review if the Python is appropriate in these courses. The third part considers the possibilities of the Python tuition at the University of Economics in Prague. The main contribution of the thesis is to give opinion on the fundamental description of the language, to define framework and to pass judgment on the potential chance of use in preliminary courses of programming.

Source transformation systems are special-purpose programming languages, or in some cases suites of languages, that are designed for the analysis and transformation of computer languages. They enable rapid prototyping of programming languages, source code renovation, language-to-language translation, design recovery, and other custom analysis techniques. With the emergence of these systems a serious problem is evident: expressing a parser for common computer languages is sometimes very difficult. Source transformation systems employ generalized parsing algorithms, and while these are well suited for the kind of agile parsing techniques in use by transformation practitioners, they are not well suited for parsing languages that are context-dependent. Traditional deterministic parser generators do not stumble in this area, but they sacrifice the generalized parsing abilities that transformation systems depend on. When it is hard to get the input into the system as a correct and accurate parse tree the utility of the unified transformation environment is degraded and more ad hoc approaches become attractive for processing input. This thesis is about the design of a new computer language transformation system with a focus on enhancing the parsing system to support generalized context-dependent parsing. We argue for the use of backtracking LR as the generalized parsing algorithm. We present an enhancement to backtracking LR that allows us to control the parsing of an ambiguous grammar by ordering the productions of the grammar definitions. We add a grammar-dependent lexical solution and integrate it with our ordered choice parsing strategy. We design a transformation language that is closer to general-purpose programming languages, yet enables common transformation techniques. We add semantic actions to our backtracking LR parsing engine and encourage the modification of global state in support of context-dependent parsing. We introduce semantic undo actions for reverting changes to global state during backtracking, thereby enabling generalized context-dependent parsing. Finally, we free the user from having to write undo actions by employing automatic reverse execution. The resulting system allows a wider variety of computer languages to be analyzed. By focusing on improving parsing abilities and moving to a transformation language that resembles general-purpose languages, we aim to extend the transformation paradigm to allow greater use by practitioners who face an immediate need to parse, analyze and transform computer languages. / Thesis (Ph.D, Computing) -- Queen's University, 2008-12-15 21:01:24.236

This thesis is concerned with problems of using computers to interpret scenes from television camera pictures. In particular, it tackles the problem of interpreting the picture in terms of lines and curves, rather like an artist's line drawing. This is very time consuming if done by a single, serial processor. However, if many processors were used simultaneously it could be done much more rapidly. In this thesis the task of line and curve extraction is expressed in terms of constraints, in a form that is susceptible to parallel computation. Iterative algorithms to perform this task have been designed and tested. They are proved to be convergent and to achieve the computation specified. Some previous work on the design of properly convergent, parallel algorithms has drawn on the mathematics of optimisation by relaxation. This thesis develops the use of these techniques for applying "continuity constraints" in line and curve description. First, the constraints are imposed "almost everywhere" on the grey-tone picture data, in two dimensions. Some "discontinuities" - places where the constraints are not satisfied - remain, and they form the lines and curves required for picture interpretation Secondly, a similar process is applied along each line or curve to segment it. Discontinuities in the angle of the tangent along the line or curve mark the positions of vertices. In each case the process is executed in parallel throughout the picture. It is shown that the specification of such a process as an optimisation problem is non-convex and this means that an optimal solution cannot necessarily be found in a reasonable time A method is developed for efficiently achieving a good sub-optimal solution. A parallel array processor is a large array of processor cells which can act simultaneously, throughout a picture. A software emulator of such a processor array was coded in C and a POP-2 based high level language, PARAPIC, to drive it was written and used to validate the parallel algorithms developed in the thesis It is argued that the scope, in a vision system, of parallel methods such as those exploited in this work is extensive. The implications for the design of hardware to perform low-level vision are discussed and it is suggested that a machine consisting of fewer, more powerful cells than in a parallel array processor would execute the parallel algorithms more efficiently.

Orientadores: Inacio Maria Dal Fabbro, Felix Emilio Prado Cornejo / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Agricola / Made available in DSpace on 2018-08-11T01:54:38Z (GMT). No. of bitstreams: 1 Park_KilJinBrandini_D.pdf: 3843275 bytes, checksum: b9dd211aeec2333282ec447a3dec8ec6 (MD5) Previous issue date: 2008 / Resumo: O Brasil produz uma enorme diversidade de produtos agrícolas em seu território e é grande produtor e exportador destes produtos. Por outro lado, a adoção de barreiras fitossanitárias, por parte dos países do hemisfério norte dificulta que o Brasil exporte uma maior quantidade e diversidade de matérias primas in natura. Paralelamente, as perdas póscolheita preocupam produtores, industriais e organismos governamentais. Além de minimizar o impacto de tais problemas, a secagem resulta em um produto final de maior valor agregado.Porém, as complexidades dos fenômenos físicos e químicos envolvidos neste processo, aliadas às caracteristicas de comercialização de equipamentos de secagem onde a venda é, muitas vezes, de secadores customizados, se traduzem em muito tempo gasto no estudo do processo e custos finais elevados. Dessa forma, ferramentas que auxiliem na tarefa de estudar, modelar e simular os processos envolvidos na secagem tornam-se importantíssimas. Pode-se subdividir o processo de secagem em grandes áreas: Propriedades do Ar, Caracterização do produto a ser seco, seleção e dimensionamento dos equipamentos envolvidos e cálculo de custo.No caso do ar, é fundamental o entendimento das relações termodinâmicas relativas à essa mistura.Por sua vez, o estudo dos produtos pode ser dividido em estudos das isotermas e as equações empíricas mais usuais na literatura, além das equações de transferência de calor e de massa, representantes das cinéticas de secagem.Finalmente, com relação ao equipamento, a definição do problema inicial e suas variáveis permite determinar o melhor modelo de secador. E o conjunto de informações geradas pelo conhecimento do ar, da matéria-prima e do equipamento permite o dimensionamento do mesmo. Assim, este trabalho apresenta o levantamento, modelamento e simulação dos fenômenos envolvidos no processo de secagem e a conseqüente implementação destes modelos em um aplicativo que permita a simulação dos processos envolvidos / Abstract: Brazil generates a fair amount of agricultural products inside its borders. On the other hand, the adoption of plant health commercial barrier by the north hemisphere countries holds Brazil from selling more untreated products. Besides, post-harvest loss is a source of great concern among farmers, industries and governmental entities. In that context, drying not only minimizes those problems but also generates product with higher aggregated value. But the complexity of the physical and chemical phenomena involved in this process, alongside the characteristics of the selling of drying equipment, where the sell is, mostly, of customized equipment, generate a fair amount of cost both in time and money. Because of that, tools capable of helping on the analysis, modeling and simulation of those phenomena are very important. One can split the drying process in great areas: Air property, Product Property, Selection and dimensioning of dryers, and coast analysis. In respect to the air, the knowledge of thermodinamical relations is essential. The study of products can be divided into isotherms and the most used equations of literature, and heat and mass transfer equations, base of the drying kinetics curves. Finally, the definition of the initial problem and its variables allow to better choose the model of dryer to be applied. And the set of characteristics of air, product and equipment allow the dimensioning of them. This work presents the research of models and simulations of the phenomena involved in drying process and the implementation of a software application that allows the simulation of those process / Doutorado / Tecnologia Pós-Colheita / Doutor em Engenharia Agrícola

This Master thesis describes the configuration of operating systems and their capabilities. It introduces differences between configuration of different operating systems according to their specialization, and it introduces advanced configuration of operating systems with third-party applications. The practical part of the thesis is a design of a new computer language aimed at describing a configuration of an operating system and its services. Such a description is used to automatically configure system services by translating it to a sequence of configuration commands. An advantage of the language is its readability by a human, but its similarity with natural languages introduces a certain level of ambiguity. The proposed method of automatic generation of commands deals with the ambiguity by searching and selecting as least as possible destructive commands.