CODAP-1/reference manual.

On cover: Control data, 1604/1604-A computer.

Technical profile of seven data element dictionary/directory systems /

Includes bibliographical references (p. 33-38).

Technical documentation for FIXDIME 3.

Mode of access: Internet.

Visual field and structural alterations in age-related macular degeneration

The thesis investigated progression of the central 10�� visual field with structural changes at the macula in a cross-section of patients with varying degrees of agerelated macular degeneration (AMD). The relationships between structure and function were investigated for both standard and short-wavelength automated perimetry (SWAP). Factors known to influence the measure of visual field progression were considered, including the accuracy of the refractive correction on SWAP thresholds and the learning effect. Techniques of assessing the structure to function relationships between fundus images and the visual field were developed with computer programming and evaluated for repeatability. Drusen quantification of fundus photographs and retro-mode scanning laser ophthalmoscopic images was performed. Visual field progression was related to structural changes derived from both manual and automated methods. Principal Findings: ��� Visual field sensitivity declined with advancing stage of AMD. SWAP showed greater sensitivity to progressive changes than standard perimetry. ��� Defects were confined to the central 5��. SWAP defects occurred at similar locations but were deeper and wider than corresponding standard perimetry defects. ��� The central field became less uniform as severity of AMD increased. SWAP visual field indices of focal loss were of more importance when detecting early change in AMD, than indices of diffuse loss. ��� The decline in visual field sensitivity over stage of severity of AMD was not uniform, whereas a linear relationship was found between the automated measure of drusen area and visual field parameters. ��� Perimetry exhibited a stronger relationship with drusen area than other measures of visual function. ��� Overcorrection of the refraction for the working distance in SWAP should be avoided in subjects with insufficient accommodative facility. ��� The perimetric learning effect in the 10�� field did not differ significantly between normal subjects and AMD patients. ��� Subretinal deposits appeared more numerous in retro-mode imaging than in fundus photography.

An automated tool for semantic accessing to formal software models

Many software engineers have found that it is difficult to understand, incorporate and use different formal models consistently in the process of software developments, especially for large and complex software systems. This is mainly due to the complex mathematical nature of the formal methods and the lack of tool support. It is highly desirable to have software models and their related software artefacts systematically connected and used collaboratively, rather than in isolation. The success of the Semantic Web, as the next generation of Web technology, can have profound impact on the environment for formal software development. It allows both the software engineers and machines to understand the content of formal models and supports more effective software design in terms of understanding, sharing and reusing in a distributed manner. To realise the full potential of the Semantic Web in formal software development, effectively creating proper semantic metadata for formal software models and their related software artefacts is crucial. This paper proposed a framework that allows users to interconnect the knowledge about formal software models and other related documents using the semantic technology. We first propose a methodology with tool support is proposed to automatically derive ontological metadata from formal software models and semantically describe them. We then develop a Semantic Web environment for representing and sharing formal Z/OZ models. A method with prototype tool is presented to enhance semantic query to software models and other artefacts. �� 2014.

A Proposed Framework for Simulation Based Learning of Inheritance

Different types of serious games have been used in elucidating computer science areas such as computer games, mobile games, Lego-based games, virtual worlds and webbased games. Different evaluation techniques have been conducted like questionnaires, interviews, discussions and tests. Simulation have been widely used in computer science as a motivational and interactive learning tool. This paper aims to evaluate the possibility of successful implementation of simulation in computer programming modules. A framework is proposed to measure the impact of serious games on enhancing students understanding of key computer science concepts. Experiments will be held on the EEECS of Queen���s University Belfast students to test the framework and attain results.

O ensino e aprendizagem da programa����o de computadores no ensino a dist��ncia : uma proposta de instancia����o do modelo pedag��gico virtual da Universidade Aberta

Hoje em dia o ensino e aprendizagem a dist��ncia online de n��vel universit��rio ��, em grande medida, baseado em estrat��gias de aprendizagem colaborativa, onde, al��m de aprender sozinho, os estudantes tamb��m participam de a����es colaborativas dentro de uma classe virtual. O n��vel de intera����o do estudante online representa um fator fundamental para o sucesso do processo de ensino-aprendizagem pois �� a base da partilha de informa����o e constru����o do conhecimento entre estudantes e professores, enquanto todas as a����es e atividades integram um modelo pedag��gico comum. Existem muitas diferen��as e desafios nas ��reas de ensino em termos de instancia����o do modelo pedag��gico e ado����o das estrat��gias de ensino-aprendizagem, como por exemplo, entre as ��reas das ci��ncias sociais e das engenharias. Uma ��rea que atrai especial aten����o como um todo �� a das ci��ncias da computa����o (CS), e de forma espec��fica, a da programa����o de computadores. A programa����o de computadores exige, em primeiro lugar, o desenvolvimento de um bom racioc��nio l��gico e uma estrat��gia de resolu����o segundo uma abordagem ���dividir para conquistar���, onde os principais problemas s��o divididos em problemas menores que s��o resolvidos individualmente. A programa����o exige tamb��m uma combina����o entre o trabalho individual e em grupo, com elevados n��veis de revis��o e depura����o do c��digo fonte em desenvolvimento. O ensino online de programa����o de computadores �� constitu��do por estes aspectos, exigindo um elevado grau de intera����o entre estudantes e entre estudantes e professor. Neste cap��tulo, vamos discutir e apresentar a nossa experi��ncia no ensino online da programa����o de computadores com base no modelo pedag��gico virtual da Universidade Aberta, e propor a sua instancia����o e extens��o espec��fica para incluir novas estrat��gias de aprendizagem colaborativa e uma abordagem construtivista para o processo global de aprendizagem.

Some aspects of grading Java code submissions in MOOCs

Recently, massive open online courses (MOOCs) have been offering a new online approach in the field of distance learning and online education. A typical MOOC course consists of video lectures, reading material and easily accessible tests for students. For a computer programming course, it is important to provide interactive, dynamic, online coding exercises and more complex programming assignments for learners. It is expedient for the students to receive prompt feedback on their coding submissions. Although MOOC automated programme evaluation subsystem is capable of assessing source programme files that are in learning management systems, in MOOC systems there is a grader that is responsible for evaluating students��� assignments with the result that course staff would be required to assess thousands of programmes submitted by the participants of the course without the benefit of an automatic grader. This paper presents a new concept for grading programming submissions of students and improved techniques based on the Java unit testing framework that enables automatic grading of code chunks. Some examples are also given such as the creation of unique exercises by dynamically generating the parameters of the assignment in a MOOC programming course combined with the kind of coding style recognition to teach coding standards.

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved since the advent of the first interpreters. However, higher inference speeds are still required in order to meet the demands of applications such as those contemplated for next generation computer systems. The execution of logic programs in parallel is currently considered a promising strategy for attaining such inference speeds. Logic Programming in turn appears as a suitable programming paradigm for parallel architectures because of the many opportunities for parallel execution present in the implementation of logic programs. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an "Abstract Machine" level suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and therefore the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-Parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set. This design is based on extending to a parallel environment the techniques introduced by the Warren Abstract Machine, which have already made very fast and space efficient sequential systems a reality. Therefore, the model herein presented is capable of retaining sequential execution speed similar to that of high performance sequential systems, while extracting additional gains in speed by efficiently implementing parallel execution. These claims are supported by simulations of the Abstract Machine on sample programs.

A model for linear programming optimization of I/O-bound programs /

"June, 1969."

Proposal of a High-Level Language for Writing Self Modifying Programs

This paper proposes a simple high-level programming language, endowed with resources that help encoding self-modifying programs. With this purpose, a conventional imperative language syntax (not explicitly stated in this paper) is incremented with special commands and statements forming an adaptive layer specially designed with focus on the dynamical changes to be applied to the code at run-time. The resulting language allows programmers to easily specify dynamic changes to their own program`s code. Such a language succeeds to allow programmers to effortless describe the dynamic logic of their adaptive applications. In this paper, we describe the most important aspects of the design and implementation of such a language. A small example is finally presented for illustration purposes.

Rough Notes on Programming AVR Microcontrollers in C

These notes follow on from the material that you studied in CSSE1000 Introduction to Computer Systems. There you studied details of logic gates, binary numbers and instruction set architectures using the Atmel AVR microcontroller family as an example. In your present course (METR2800 Team Project I), you need to get on to designing and building an application which will include such a microcontroller. These notes focus on programming an AVR microcontroller in C and provide a number of example programs to illustrate the use of some of the AVR peripheral devices.

Formal methods within a totally functional approach to programming

Taking functional programming to its extremities in search of simplicity still requires integration with other development (e.g. formal) methods. Induction is the key to deriving and verifying functional programs, but can be simplified through packaging proofs with functions, particularly folds, on data (structures). Totally Functional Programming avoids the complexities of interpretation by directly representing data (structures) as platonic combinators - the functions characteristic to the data. The link between the two simplifications is that platonic combinators are a kind of partially-applied fold, which means that platonic combinators inherit fold-theoretic properties, but with some apparent simplifications due to the platonic combinator representation. However, despite observable behaviour within functional programming that suggests that TFP is widely-applicable, significant work remains before TFP as such could be widely adopted.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.