1,621 Matching Results

Search Results

Advanced search parameters have been applied.

Search of the VAXintosh customizing VMS V4. 0 for DCL windows

Description: This paper will describe methods of implementing such windows for: (1) DCL and MAIL; (2) Command Procedures; and (3) the VMS V4.0 editors EDT, LSE and TPU. While VMS and a number of utilities have the SPAWN command available to the user, the window interface to be described has been found in practice to be simpler to use because: (1) windows are consistently invoked with a single key command; and (2) confusion is minimized because one always knows if one is in a window.
Date: January 1, 1985
Creator: Downward, J.G.
Partner: UNT Libraries Government Documents Department

A tight and explicit representation of Q in sparse QR factorization

Description: In QR factorization of a sparse m{times}n matrix A (m {ge} n) the orthogonal factor Q is often stored implicitly as a lower trapezoidal matrix H known as the Householder matrix. This paper presents a simple characterization of the row structure of Q, which could be used as the basis for a sparse data structure that can store Q explicitly. The new characterization is a simple extension of a well known row-oriented characterization of the structure of H. Hare, Johnson, Olesky, and van den Driessche have recently provided a complete sparsity analysis of the QR factorization. Let U be the matrix consisting of the first n columns of Q. Using results from, we show that the data structures for H and U resulting from our characterizations are tight when A is a strong Hall matrix. We also show that H and the lower trapezoidal part of U have the same sparsity characterization when A is strong Hall. We then show that this characterization can be extended to any weak Hall matrix that has been permuted into block upper triangular form. Finally, we show that permuting to block triangular form never increases the fill incurred during the factorization.
Date: May 1, 1992
Creator: Ng, E.G. & Peyton, B.W.
Partner: UNT Libraries Government Documents Department

Confidence intervals for the odds ratio in case-control studies: the state of the art

Description: Many approximate procedures are available for setting confidence limits around the odds ratio in a four-fold table. A number of them are analyzed according to three criteria: close agreement between the actual and the nominal confidence levels; exact agreement with a hypothesis test for or against significance; and relative simplicity in calculation. The procedure due to Cornfield comes closer to satisfying all three criteria than any of the others examined. Formulas are provided for an iterative solution to Cornfield's equations.
Date: April 1, 1978
Creator: Fleiss, J.L.
Partner: UNT Libraries Government Documents Department

Axymptotic normality of X/sup 2/ in mxn tables with n large and small cell expectations

Description: Asymptotic normality for chi/sup 2/ used as a test for homogeneity is established under nonstandard conditions. The case of an mxn table with m fixed and the total number of observations proportional to n is studied for n large. Results are obtained under very mild assumptions on the marginal totals.
Date: January 1, 1977
Creator: Cuzick, J.
Partner: UNT Libraries Government Documents Department

Teaching old Fortran programmers new tricks

Description: For a number of valid reasons, Fortran remains in widespread use. It can be difficult to get long-time Fortran programmers to accept the use of new software tools that are increasingly required to lower software costs. In order to gain acceptance for a new software tool, it is necessary for it to be easy to learn and use, as well as to provide new benefits. In the process of introducing the use of the Ratfor preprocessor for Fortran, a number of useful guidelines were defined for gaining the acceptance of any new software tool in an existing environment.
Date: January 1, 1980
Creator: Wampler, B. E.
Partner: UNT Libraries Government Documents Department

Visual tools and languages: Directions for the '90s

Description: We identify and discuss three domains where we believe that innovative application of visual programming languages is likely to make a significant impact in the near term: concurrent computing, computer-based assistance for people with disabilities, and the multimedia/multimodal environments of tomorrow in which it will be possible to hear and physically interact with information as well as see it. 33 refs., 3 figs.
Date: January 1, 1991
Creator: Glinert, E.P. (Rensselaer Polytechnic Inst., Troy, NY (United States). Dept. of Computer Science); Blattner, M.M. (Lawrence Livermore National Lab., CA (United States)) & Frerking, C.J. (California Univ., Davis, CA (United States))
Partner: UNT Libraries Government Documents Department

A sendmail. cf scheme for a large network

Description: Like most large networked sites our users depend heavily on the electronic mail system for both internal and off-site communications. Unfortunately the sendmail.cf file, which is used to control the behavior of the sendmail program, is somewhat cryptic and difficult to decipher for the neophyte. So, on one hand you have a highly visible, frequently used utility, and on the other hand a not-so-easily acquired system administration forte. Here is the sendmail topology of our site, what premises we based it on, and the parts of the sendmail.cf files which support the topology.
Date: August 14, 1991
Creator: Darmohray, T.M.
Partner: UNT Libraries Government Documents Department

Application of automated deduction to the search for single axioms for exponent groups

Description: We present new results in axiomatic group theory obtained by using automated deduction programs. The results include single axioms, some with the identity and others without, for groups of exponents 3, 4, 5 and 7, and a general form for single axioms for groups of odd exponent. The results were obtained by using the programs in three separate ways: as a symbolic calculator, to search for proofs,and to search for couterexamples. We also touch on relations between logic programming and automated reasoning.
Date: February 11, 1992
Creator: McCune, W. & Wos, L.
Partner: UNT Libraries Government Documents Department

Floating point hardware emulator for RSX-11D

Description: An RSX-11D task was written to simulate the FP-11 floating point hardware on systems that lack this hardware. The simulation is transparent to tasks using floating point instructions. All normal features of the hardware are simulated exactly, including its action on exception conditions. The emulator is a privileged task occupying about 2.7K words of memory. When it is loaded and run, it sets up a linkage to intercept the reserved instruction trap before it reaches the executive, and route it to a service routine that can decode and simulate the floating point instruction set. The results of a benchmark timing test are given, as are notes on converting the emulator to run under RSX-11M. 1 figure, 2 tables.
Date: January 1, 1977
Creator: Kellogg, M. & Long, M.
Partner: UNT Libraries Government Documents Department

Current status of link access control and encryption system

Description: The purpose of this project is to develop necessary technologies for the secure protection of data communication networks. Data encryption equipment, using the federal government's Data Encryption Standard (DES) algorithm, was designed and developed. This equipment is the Link Access Control and Encryption (Link ACE) system. It protects unclassified sensitive data transmissions over unprotected lines between central computers and remote terminals. Link ACE units have been installed and are operational in the Department of Energy's Central Personnel Clearance Index (CPCI) system.
Date: January 1, 1984
Creator: Springer, E.
Partner: UNT Libraries Government Documents Department

Lectures on probability and statistics. Revision

Description: These notes are based on a set of statistics lectures delivered at Imperial College to the first-year postgraduate students in High Energy Physics. They are designed for the professional experimental scientist. They begin with the fundamentals of probability theory, in which one makes statements about the set of possible outcomes of an experiment, based upon a complete a priori understanding of the experiment. For example, in a roll of a set of (fair) dice, one understands a priori that any given side of each die is equally likely to turn up. From that, we can calculate the probabilty of any specified outcome. They finish with the inverse problem, statistics. Here, one begins with a set of actual data (e.g., the outcomes of a number of rolls of the dice), and attempts to make inferences about the state of nature which gave those data (e.g., the likelihood of seeing any given side of any given die turn up). This is a much more difficult problem, of course, and one's solutions often turn out to be unsatisfactory in one respect or another. Hopefully, the reader will come away from these notes with a feel for some of the problems and uncertainties involved. Although there are standard approaches, most of the time there is no cut and dried ''best'' solution - ''best'' according to every criterion.
Date: June 1, 1985
Creator: Yost, G.P.
Partner: UNT Libraries Government Documents Department

Understanding large software systems with the utility XREG

Description: When a software system reaches a certain size, arteriosclerosis sets in. That is, the system becomes harder and harder to add new features and even more difficult to understand. Worse, the insertion of new features often introduces new programming errors as well as revealing ones already present but previously unmanifested. For Fortran programs, the 100,000 line size is critical. XREF fights hardening of the arteries by providing the user information on the organization, variable usage, and common block use within the software system. XREF is language independent. That is, it works, for example, with CAL, C, CIVIC, and CFT compiled subprograms. XREF performs its global symbol analysis from either the BUILD library file or the object (binary) file. Naturally more useful information is obtained when a symbol table is generated by the compiler. Specifically, eight global reports are produced. The most helpful report consists of a listing of all symbols contained in the BUILD library or binary file, the subprograms that use the symbol and the relocation basis (either local or common block name) of each symbol. Five secondary reports are provided for each subprogram. 3 refs.
Date: November 18, 1990
Creator: Rhoades, C.E. Jr.
Partner: UNT Libraries Government Documents Department

Editing graphs for maximum effect

Description: The paper contains over eighty rules for editing graphs, arranged under nine major headings in a logical sequence for editing all the graphs in a manuscript. It is excerpted from a monograph used at the Lawrence Livermore National Laboratory to train beginning technical editors in editing graphs; a corresponding Hypercard stack is also used in this training. 6 refs., 4 figs.
Date: January 8, 1991
Creator: Murphy, P.W. & Rhiner, R.W.
Partner: UNT Libraries Government Documents Department

Feasibility study of networks. Final report. [Feasibility of resource sharing via general-purpose computer networks]

Description: From July, 1974, to December, 1979, the Laboratory for Nuclear Service (LNS) conducted a study of the feasibility of resource sharing via general - purpose computer networks. Originally, the study focused on methods of implementing an ARPAnet connection for LNS in collaboration with the MIT Information Processing Center (IPC). When it appeared that the most feasible solution for LNS was to access the ARPANET via the MIT Multics system, the investigation expanded to a consideration of the implementation of computer resource sharing via networks. Experiments were performed at various ERDA installations on the ARPANET in using the networks for offloading large calcuations and obtaining access to unique hardware and software. Performance statistics were collected and cost comparisons, made. Both the benefits and barriers of networking were analyzed. The value of electronic mail, teleconferencing, and other forms of computer-aided communication was also investigated. The study demonstrated that resource sharing via networks can provide small computer installations access to computer facilities not available on site. However, it is not adequate substitute for an on-site computer. There must be enough computing power locally to service the average load. Certain types of computations are not effectively done on the network. Use of the network is most feasible for access to powerful processors and large memories or to unique hardware such as a vector processor. Certain barriers, both technical and nontechnical, must be overcome before computer resource sharing via networks will become widespread. Expanded use of current message and teleconferencing systems should be encouraged within the DOE community.
Date: December 15, 1979
Creator: Campbell, E. J. & Kannel, M. S.
Partner: UNT Libraries Government Documents Department

1979 SIGNUM meeting on numerical ordinary differential equations. [University Inn, Champaign, IL, April 3-5, 1979]

Description: This report gives a summary of the papers presented at the meeting. It consists of all working papers distributed at the conference and all working papers received too late for distribution. In addition, abstracts and/or summaries are included where practical for those talks and workshop sessions that did not generate papers. This document should be a useful reference to very current research in ODEs. These papers are preliminary versions of papers that will be submitted for publication. One paper in this volume has been cited in ERA, and can be located by reference to the entry CONF-790403-- in the Report Number Index.
Date: April 1, 1979
Creator: Skeel, R. D.
Partner: UNT Libraries Government Documents Department

Reasoning in incomplete domains

Description: Most real-world domains differ from the micro-worlds traditionally used in A.I. in that they have an incomplete factual data base which changes over time. Understanding in these domains can be thought of as the gneration of plausible infoerences which are able to use the facts available, and respond to changes in them. A traditional rule interpreter such as Planner can be extended to construct plausible inferences in these domains by allowing assumptions to be made in applying rules, resultsing in simplifications of rules which can be used in an incomplete data base; monitoring the antecedents and consequents of a rule so that inferences can be maintained over a changing data base.
Date: January 1, 1979
Creator: Rosenberg, S.
Partner: UNT Libraries Government Documents Department

Remote hard copy. Volume 1. Programming manual. [Data General NOVA 3/D minicomputer with Versatec 1110A plotter]

Description: The application of various graphics languages and special control cards to create and route graphics files to the remote hard copy plotters is presented. Discussion and examples are given for using GCS, DISSPLA, and VTSCORS on the SCOPE 3.3, SCOPE 2, and NOS operating systems.
Date: March 1, 1980
Creator: Simons, R.W.
Partner: UNT Libraries Government Documents Department

Speakeasy linkules: plug compatible software

Description: A universal computer language must be able to evolve to satisfy the needs of its current and future users. This paper describes such a language, called Speakeasy. The paper emphasizes those features of Speakeasy that relate to its naturalness and to its extensibility. Extensibility in the Speakeasy sense means the ability to bring diverse sets of routines under the umbrella of the system and thus make them available to users. Interfacing a routine through the construction of a linkable module, called a linkule, extends the capabilities of Speakeasy in a general and unrestricted way. The concept of the linkule is explained and illustrated by examples. In order to provide some background, a few illustrative examples of the Speakeasy language are given.
Date: January 1, 1977
Creator: Cohen, S.
Partner: UNT Libraries Government Documents Department

Automated reasoning and enumerative search, with applications to mathematics

Description: More and more mathematical problems are being solved with the aid of computers. In this paper, we examine the applications of reasoning and search programs to mathematics. It is also shown that the combination of these two techniques can solve mathematical problems more effectively.
Date: January 1, 1991
Creator: Zhang, Jian (Academia Sinica, Beijing, BJ (China)) & Wos, L. (Argonne National Lab., IL (United States))
Partner: UNT Libraries Government Documents Department