86 Matching Results

Search Results

Advanced search parameters have been applied.

Calculation of wing spars

Description: The author presents a comparison and combination of the numerical and geometrical determinations of the maximum M, when calculating the maximum bay moment.
Date: August 1921
Creator: Müller-Breslau, H.
Partner: UNT Libraries Government Documents Department

Sequencing as a factor associated with students' ability to learn programming

Description: The problem of this study concerns the performance of students in computer programming following exposure to a computer-aided instruction (CAI) drill in sequencing and practice exercises. The purpose of this study was to determine whether or not student success rates improve in computer programming after completing CAI sequencing drills and practice exercises.
Date: August 1991
Creator: Honarvar, Hassanali
Partner: UNT Libraries

Defensive Programming

Description: This research explores the concepts of defensive programming as currently defined in the literature. Then these concepts are extended and more explicitly defined. The relationship between defensive programming, as presented in this research, and current programming practices is discussed and several benefits are observed. Defensive programming appears to benefit the entire software life cycle. Four identifiable phases of the software development process are defined, and the relationship between these four phases and defensive programming is shown. In this research, defensive programming is defined as writing programs in such a way that during execution the program itself produces communication allowing the programmer and the user to observe its dynamic states accurately and critically. To accomplish this end, the use of defensive programming snap shots is presented as a software development tool.
Date: May 1980
Creator: Bailey, L. Mark
Partner: UNT Libraries

Research in Mathematics and Computer Science at Argonne, April 1, 1984-March 31, 1985

Description: This report reviews the research activities in the Mathematics and Computer Science Division at Argonne National Laboratory for the period April 1, 1984, through March 31, 1985. The body of the report discusses various projects carried out in four major areas of research: applied analysis, computational mathematics, software engineering, and advanced computing. Information on section staff, visitors, workshops, and seminars is found in the appendices.
Date: 1985
Creator: Pieper, Gail W. & Messina, P. C.
Partner: UNT Libraries Government Documents Department

Applied Mathematical Sciences Research at Argonne, October 1, 1978-March 31, 1980

Description: This report reviews the research activities of the Applied Mathematical Sciences Section for the period October 1, 1978, through March 31, 1980. The body of the report discusses various projects carried out in four major areas of research: applied analysis, computational mathematics, software engineering, and software clinics. Information on section staff, visitors, workshops, and seminars is found in the appendices.
Date: 1980?
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department

Applied Mathematical Sciences Research at Argonne, April 1, 1981-March 31, 1982

Description: This report reviews the research activities in Applied Mathematical Sciences at Argonne National Laboratory for the period April 1, 1981, through March 31, 1982. The body of the report discusses various projects carried out in three major areas of research: applied analysis, computational mathematics, and software engineering. Information on section staff, visitors, workshops, and seminars is found in the appendices.
Date: 1982?
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department

Applied Mathematical Sciences Research at Argonne, April 1, 1982-March 31, 1983

Description: This report reviews the research activities in Applied Mathematical Sciences at Argonne National Laboratory for the period April 1, 1982, through March 31, 1983. The body of the report discusses various projects carried out in three major areas of research: applied analysis, computational mathematics, and software engineering. Information on section staff, visitors, workshops, and seminars is found in the appendices.
Date: 1983?
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department

Applied Mathematical Sciences Research at Argonne April 1, 1980-March 31, 1981

Description: This report reviews the research activities of the Applied Mathematical Sciences Section for the period April 1, 1980, through March 31, 1981. The body of the report discusses various projects carried out in three major areas of research: applied analysis, computational mathematics, and software engineering. Information on section staff, visitors, workshops, and seminars is found in the appendices.
Date: 1981?
Creator: Pieper, Gail W.
Partner: UNT Libraries Government Documents Department

A Methodology for Algorithm Development Through Schema Transformations

Description: A programming methodology based on schema transformations is presented. Such an approach is a logical outcome of recent developments in program manipulating systems. Concurrent development of algorithms and their proofs of correctness is a significant feature of the proposed methodology. As the development process begins with an abstract schema, it is often possible to derive several related end algorithms in a single development process. This has implications in both the economics of software development and the understanding and teaching of algorithms. The initial schematic specification (a skeleton algorithm schema), the intermediate and final algorithm schemata are all expressed in Darlington's first-order recursion equation language exploiting set-theoretic constructs. A set of transformation rules together with a set of reduction rules for set expressions is then used to successively transform the schematic specification into different algorithm schemata. Most of the transformations are applications of a small number of common rewriting rules.
Date: July 1982
Creator: Muralidharan, M. N.
Partner: UNT Libraries Government Documents Department

Validation of a Selection Battery for Computer Programmers

Description: Subjects were 38 computer programers employed in a national food-retailing corporation. A job analysis provided a basis for criteria development and served to guide the selection of predictors. Ratings of each programmer's job performance by his immediate supervisor, and scores on such tests as the Computer Programer Aptitude Battery (CPAB), clerical tests, and supervisory judgment test were obtained. Relationships between tests and criteria were examined to find the best test combination for predicting programming performance. Statistical treatment of data included a principal components analysis of the criteria and a multiple linear regression analysis. A weighted combination of the CPAB Reasoning, a test of clerical ability, and supervisory judgment test was found to be highly correlated with performance (R = .60).
Date: August 1979
Creator: Tuseth, Michael
Partner: UNT Libraries

Generating Machine Code for High-Level Programming Languages

Description: The purpose of this research was to investigate the generation of machine code from high-level programming language. The following steps were undertaken: 1) Choose a high-level programming language as the source language and a computer as the target computer. 2) Examine all stages during the compiling of a high-level programming language and all data sets involved in the compilation. 3) Discover the mechanism for generating machine code and the mechanism to generate more efficient machine code from the language. 3) Construct an algorithm for generating machine code for the target computer. The results suggest that compiler is best implemented in a high-level programming language, and that SCANNER and PARSER should be independent of target representations, if possible.
Date: December 1976
Creator: Chao, Chia-Huei
Partner: UNT Libraries

Macro Control Structures for Structured Programming in ALC

Description: This thesis describes a set of computer program control structures which permits the application of certain structured programming techniques to the IBM/360 assembly language (ALC). The control structures are implemented by programmerdefined instructions known as macros. A history of computer software is presented, providing a basis for the emergence of structured programming. A survey of the major concepts of structured programming with special attention to control structures and their significance to structured programming follows. The macros developed in this study include DO, ENDDO, LEAVE, CASE, and ENDCASE. They provide a looping control structure, a loop-escape construct, and a selective control structure. Examples of usage are given.
Date: December 1975
Creator: Connally, Kim G.
Partner: UNT Libraries

An Empirical Investigation of the Impact of Cognitive Complexity and Experience of Programmers, and Program Complexity on Program Comprehension and Modification

Description: The psychological characteristics of programmers are believed to be important determinants of programming productivity. However, little evidence is available to support this contention. This investigation, motivated by the lack of such evidence, was concerned with determining the influence of the programmer's cognitive complexity (differentiation and integration) and experience on comprehending and modifying programs of different levels of complexity. Data were collected from ninty-three graduate and undergraduate students in a classroom experimental setting. In the first phase of the experiment, a background questionnaire was administered in order to collect experience and other demographic information. Also, a domain-specific Role Construct Repertory (REP) Test was administered to collect cognitive complexity information. In the second phase, the subjects were randomly assigned to either the program comprehension group or to the program modification group. Both groups used two COBOL programs of differing levels of complexity to do comprehension and modification exercises. Three sets of hypotheses were tested. The first set of hypotheses was designed to evaluate the direction and strength of the relationship between cognitive complexity and program comprehension and modification. The second set of hypotheses was designed to evaluate the combined influence of cognitive complexity and program complexity on the comprehension and modification of the programs. The third set of hypotheses was designed to evaluate the moderating effect of experience on the relationship of cognitive complexity to program comprehension and modification. Cognitive integration was found to have a significant and positive nonlinear relationship only with the relatively complex program modification scores. The subjects who were ranked high in cognitive integration performed better than those ranked low in modifying the relatively complex program; but they performed the same in modifying the relatively simple program. Cognitive differentiation was found to have no significant relationship with either comprehension scores or modification scores. Experience of the subjects did ...
Date: May 1986
Creator: Khalil, Omar Elnadi M.
Partner: UNT Libraries

A Qualitative Analysis of the Computer Programming Abilities and Thought Processes of Five-Year-Old Children

Description: The problem of this study was to describe and analyze the computer programming abilities and thought processes of five-year-old children using a conventional microcomputer and the Apple LOGO language. This dissertation reports on the behavior of five kindergarten children and the counts they made as they learned to program in LOGO on an Apple XI Plus microcomputer. The five participants were randomly selected from a group of ten five-year-olds who passed a screening test of numeral and capital letter recognition. The sample included three girls and two boys, all of whom were white. The students met individually with the researcher and the computer for about twenty minutes every day during a ten-week period.
Date: August 1984
Creator: Hines, Sandra N. (Sandra Ninemire)
Partner: UNT Libraries

Information Storage and Retrieval Systems

Description: This thesis describes the implementation of a general purpose personal information storage and retrieval system. Chapter one contains an introduction to information storage and retrieval. Chapter two contains a description of the features a useful personal information retrieval system should contain. This description forms the basis for the implementation of the personal information storage and retrieval system described in chapter three. The system is implemented in UCSD Pascal on an Apple II microcomputer.
Date: May 1983
Creator: Creech, Teresa Adams
Partner: UNT Libraries

An ITP Workbook

Description: This collection of exercises has been prepared to teach the use of the automated reasoning system ITP. Previous knowledge of automated reasoning is not presumed. The exercises are designed for use with the UNIX operating system.
Date: December 1986
Creator: Kalman, John A.
Partner: UNT Libraries Government Documents Department

An Algebraic Theory of Program Specification and Correctness Using Symmetry Operations

Description: This report applies some methods from the theory of group representation to the questions of program specification and knowledge about programs. The theory is that of a program as a transformation on a state space, and operators commuting with that transformation being symmetries of the program, means of specifying properties, and generators of program invariants. Because a program can simulate a system in the real world, there is a corresponding model of engineered artifacts, that is, manmade objects having a theory for their design.
Date: March 1987
Creator: Gabriel, John R.
Partner: UNT Libraries Government Documents Department

Comparison of the CRAY X-MP-4, Fujitsu VP-200, and Hitachi S-810/20 : an Argonne Perspective

Description: A set of programs, gathered from major Argonne computer users, was run on the current generation of supercomputers: the CRAY X-MP-4, Fujitsu VP-200, and Hitachi S-810/20. The results show that a single processor of a CRAY X-MP-4 is a consistently strong performer over a wide range of problems. The Fujitsu and Hitachi excel on highly vectorized programs and offer an attractive opportunity to sites with IBM-compatible computers.
Date: October 1985
Creator: Dongarra, J. J. & Hinds, Alan
Partner: UNT Libraries Government Documents Department

Tutorial on the Warren Abstract Machine for Computational Logic

Description: Tutorial description of the Warren machine with a basic introduction to the motivation of the machine and the instructions that define it. Discussion of the fairly limited extensions required to extend the machine for more general use outside of implementations of logic programming. Substantial speedups will occur due to improvements in the implementation of the basic algorithms.
Date: June 1985
Creator: Gabriel, John R.; Lindholm, Tim; Lusk, E. L. & Overbeek, R. A.
Partner: UNT Libraries Government Documents Department

A Tutorial on the Construction of High-Performance Resolution/Paramodulation Systems

Description: Over the past 25 years, researchers have written numerous deduction systems based on resolution and paramodulation. Of these systems, a very few have been capable of generating and maintaining a formula database "containing more than just a few thousand clauses. These few systems were used to explore mechanisms for rapidly extracting limited subsets of relevant" clauses. We have written this tutorial to reflect some of the best ideas that have emerged and to cast them in a form that makes them easily accessible to students wishing to write their own high-performance systems.
Date: September 1990
Creator: Butler, R. & Overbeek, R.
Partner: UNT Libraries Government Documents Department