bluuebunny/crossref_metadata_2025 huggingface dataset:
Use of computers in treating nonnumerical mathematics and group theoretical problems in physics
Authors: Flodmark Stig , Blokker Esko
Published: January 2007

We give a short discussion of the use of group theory in physics, with references in order to introduce mathematicians to this subject; further, a simplified explanation of symmetry adaptation of wave functions. The main part of the paper forms a survey of algebraic and group theoretical programs used by or useful to physicists.
Relativistic applications of symbolic mathematical computation
Authors: Howard James C.
Published: January 2007

The formulation of problems in relativistic mechanics requires a vast amount of tedious algebraic manipulation and symbolic differentiation. Such problems are well suited to symbolic mathematical computation, using one of the computer languages designed for this purpose. A method is described whereby a digital computer can be used to derive the field equations and the equations of the geodesics that describe the trajectories of bodies in space. The effectiveness of the method is demonstrated by using it to derive the field equations and the equations of the trajectory of a body which is moving in a spherically symmetric static field. It should be understood, however, that the method is not restricted to the study of gravitational models of this type. Indeed, the full advantage of the method will only be realized in applications to more complex cosmological situations.
Fortran implementation of the Kay context-free parser
Authors: Friedman Joyce
Published: January 2007

A parsing program for context-free grammars based on an algorithm due to Martin Kay has been combined with a phrase-structure grammar preprocessor. The result is an efficient context-free parsing package. Implementation is in FORTRAN G under MTS.The paper contains first a user's guide to the programs. Then the parsing strategy as well as the functions of the major subroutines are described.
A user's examination of the formula manipulation language - SYMBAL
Authors: Neidleman L. D.
Published: January 2007

The highlights of the SYMBAL system and language are reviewed in this paper. The main strengths and weaknesses of SYMBAL are discussed. Three examples are included to illustrate the language. Several recommendations are made for improving the language.
Rationally simplifying non-rational expressions
Authors: Fateman Richard J.
Published: January 2007

Rational simplification programs can be generalized to simplify larger classes of expressions. This paper describes some of the additional capabilities of MACSYMA's [6] rational simplification programs. In section 2 we describe the results of a test of these features.
An improved non-modular polynomial GCD algorithm
Authors: Hearn Anthony C.
Published: January 2007

An improved non-modular algorithm for the calculation of the greatest common divisor of two multivariate polynomials is presented.
The introduction of a paging technique into the symmetric list processor, SLIP
Authors: Sage F. H. , Smith D. V.
Published: January 2007

When the computing community turned its attention back to the problem of "pure" symbol manipulation, a large and ever-growing family of "list-processing" ("LP") computer languages resulted. SLIP, which is one of these, was primarily written in FORTRAN, making it easy to use, understand and debug. The widespread use of SLIP, however, has been severely hampered by the restriction of available space in the system. Guided by the desire for more available space, we imposed upon our study the conditions that as few changes as possible should be made to the SLIP system, and additions to the system should be automatic functions of the system and not of the user. This report shows how a paging technique incorporated into the SLIP system accomplished our goal.
SIGMOBILE FY'05 annual report
Authors: Johnson David B.
Published: January 2007

Every year, as ACM's fiscal year ends annually on June 30, each SIG Chair is required to submit a report to ACM's SIG Governing Board that summarizes the highlights of the SIG's activities over the previous year. This article reproduces SIGMOBILE's Annual Report for the year July 1, 2004, through June 30, 2005. It has been an exciting, productive, and successful year for SIGMOBILE, and we hope you share in our excitement as we move forward to many more successes in the future.
On non-numeric architecture
Authors: Lipovski G. Jack , Su Stanley Y. W.
Published: January 2007

In this informal paper, we present what we believe is one of the major problems in computer science of the 70's and several approaches to the solution of this problem that are being studied by our group and by others. (A formal paper that includes a detailed bibliography on this topic is in preparation. Therefore, we are writing this paper in an informal style without references). A very large part of the computational load throughout the world is essentially business computation. Perhaps it is the majority of computation. Business computation is heavily oriented to data base management and information retrieval. We will refer to this type of computation as non-numeric processing. The main primitive operation here is the search. However, we are using standard von Neumann computers whose main primitive operation is addition. What is good for numeric problems like inverting large matrices is not necessarily good for non-numeric problems like searching large data bases. The hardware limitations of conventional von Neumann computers tend to straightjacket our approach to non-numeric processing.
On the encipherment of search trees and random access files
Authors: Bayer R. , Metzger J. K. , Germany München W.
Published: January 2007

The securing of information in indexed, random access files by means of privacy transformations must be considered as a problem distinct from that for sequential files. Not only must processing overhead due to encrypting be considered, but also must threats to encipherment arising from updating and the file structure itself be countered. A general encipherment scheme is proposed for files maintained in a paged structure on secondary storage. This is then applied to the encipherment of indexes organized as B-trees, a particular type of multiway search tree. Threats to the encipherment of B-trees, especially relating to updating, are examined, and counter-measures proposed for each. In addition, the effect of encipherment on file access and update, on paging mechanisms, and on files related to the enciphered index are discussed. Many of the concepts presented here may be readily transferred to other forms of multiway index trees and to binary search trees.
Optimal allocation of resources in distributed information networks
Authors: Mahmoud Samy , Riordon J. S.
Published: January 2007

The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two aspects of the design are tightly coupled through an average message delay constraint. The objective is to allocate copies of information files to network nodes and capacities to network links so that a minimum cost is achieved subject to network delay and file availability constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall into a class of non-linear integer programming problems. Deterministic techniques for solving this class of problems are computationally cumbersome even for small sized problems. A new heuristic algorithm is developed, based on a decomposition technique which greatly reduces the computational complexity of the problem. Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements. Moreover, it is shown that this algorithm is capable of solving realistic network problems whose solution using deterministic techniques is computationally intractable.
The design of a rotating associative array memory for a relational data base management application
Authors: Lin C. S. , Smith Diane C. P.
Published: January 2007

There are significant advantages to tailoring hardware storage devices to support high level data models in very large data bases. A storage device that can assume some of the data selection functions traditionally performed by the CPU can substantially reduce the amount of data to be transferred to the CPU. This reduction together with increased concurrency of CPU and device operation result in increased data rates and lower response times. By designing the device to support one specific data model, greater efficiency can be achieved than in devices designed to be a compromise in their support of several different models. The number and complexity of the functions performed by the device can be drastically reduced, along with its development and production costs. In this paper we describe the design and usage of an associative array memory using a rotating storage device which is tailored to support the relational model of E.F. Codd.
A study of machine architectures for specialized information retrieval computers
Authors: Hurley B. J. , Lawrie D. H.
Published: January 2007

This paper is the result of an effort to support and supplement the development of a specialized information retrieval computer, EUREKA, presently being built at the University of Illinois, Urbana. We begin by defining a basic machine architecture from which many text retrieval systems can be configured. This architecture includes two features that are designed to increase the efficiency and performance of these systems. First, a special processor is used to merge and coordinate postings lists obtained from an inverted file. Second, there are facilities for parallel data transfer which will allow the postings lists to be moved rapidly through the memory hierarchy. Our next step is to identify the design variables that exist within this basic architecture. These are the parameters that can be varied to configure specific retrieval machines. Finally, simulation results are, studied to evaluate the effect the design variables have on each other as well as on the architecture as a whole. From these results we will develop an understanding of how to construct a retrieval machine using information on the various speeds and capacities of its components.
An architecture for the efficient combining of linearly ordered lists
Authors: Hollaar Lee A.
Published: January 2007

Many applications require the combining of two or more linearly ordered lists according to a given set of rules. Probably the best example of this is the combining of index lists in an inverted file information retrieval system according to a Boolean expression specified by the system user. If the user specifies the AND of two terms, the intersection of the two lists associated with the terms if formed; if OR, the union is formed; and if he specifies A AND NOT B the result will be those entries in list A which are not also in list B.
A multiple associative memory organization for pipelining a directory to a very large data base
Authors: Berra P. Bruce , Singhania Ashok K.
Published: January 2007

The limitation of the existing class of sequential computers in the management of large data bases is well known. This has led to investigations of Associative/Parallel devices, working alone or in conjunction with sequential devices, as possible tools for Data Base Management (DBM). Associative Memories have been shown to be an attractive tool for DBM when the data base is sufficiently small; however, their usefulness in the management of large data bases has not yet been established.The research that we are presently undertaking addresses itself to data retrieval and update in an environment of a large, general data base with substantial activity. A hierarchical directory to the data base is utilized that permits both single and multiple-attribute retrievals. A series of Associative Memories is used to pipeline the searches at various levels of the directory. The performance of this system is being compared with both sequential and other organizations utilizing Associative Memories. The criteria for comparison are retrieval and update performance, storage utilization and flexibility.
Performance evaluation of a relational associative processor
Authors: Czkarahan E. A. , Schuster S. A. , Sevcik K. C.
Published: January 2007

A relational associative processor called RAP has been designed to provide hardware support for the use and manipulation of a relational data base. In this paper, we describe the relational operations provided by the RAP hardware, and devise a representative approach to providing the same relational operations with conventional software and hardware. Analytic models are constructed for both RAP and the conventional system. All simplifying assumptions are made to favor the conventional system. The execution times of several of the operations are shown to be improved with RAP by several orders of magnitude.
Implementation of a context-addressed pipeline
3
SIMD architecture
Authors: Ackerman S. J. , Eman A. , Lipovski G. J. , Su S. W.
Published: January 2007

The context-addressed SIMD architecture is being examined as a means to provide suitable processing capabilities for non-numeric applications. This paper considers techniques which are being applied to realize this architecture in a segment sequential fashion.A fixed head disc provides a large amount of sequential storage already segmented into tracks. Economical bit-serial microprocessors are employed one per track to process the instructions and data sequentially as the disc rotates. A microprocessor and its track are here called a cell. A chain of cells can search a file consisting of fixed length words organized into variable length records in one revolution or cycle of the disc. Intercell communication in the chain as a pipeline allows files and records which overlap segment boundaries to be processed as an intact file or record, with all segments processed in parallel. Transfers of words and bits in pipeline fashion between cells allows the file to change size dynamically without regard for its cellular segmentation, as words may be either inserted or deleted within a record.Instruction execution in this architecture is also pipelined. The next instruction is preprocessed in one cycle along with its operand while the current instruction is executing, and the previous one is finishing up its operation or post-processing. This instruction pipelining is performed in order to minimize the execution time for a sequential instruction by overlapping the instruction fetch and execute of two consecutive cycles. The segment sequential organization also demands that the instruction execution continue into the next cycle in order to process the elements of a record that may overlap segments. Again by overlapping this instruction clean-up with the next instruction's execution, we may minimize the instruction execution time.A hardware realization of this pipeline of cells which pipelines its instruction execution becomes another pipeline. Each bit serial microprocessor is in fact a pipeline of modules each performing some phase of instruction execution or segment support such as garbage word deletion or new data insertion. The segment sequential architecture lends itself very nicely to this pipeline
3
approach.Although they provide a powerful architecture, these three pipeline constructs also develope new problems in their control and timing. Such problems include that the words which are pipelined between cells are not processed twice, missed entirely, or only partially processed by the instruction pipeline. A solution to these and to other problems related to this architecture are presented in this paper.
Software aspect of the CASSM system
Authors: Emam Ahmed , Su Stanley Y. W. , Lipovski G. J.
Published: January 2007

This paper deals with the software aspect of the CASSM system. A high level language for large data base management, CASDAL, a compiler for that language, and a cross assembler, CASSMBLR, designed and implemented for the CASSM system are described.
Stemming as a system design consideration
Authors: Tars Arvo
Published: January 2007

A good deal of work has been done over the years trying to demonstrate the feasibility or superiority of automatic indexing techniques. (1--8) Most of these techniques are designed for natural language systems, i. e., systems which have an uncontrolled vocabulary. While they incorporate many desirable features, they also have some disadvantages.
Review of "Applied Data Management by Charles T. Meadow"; 1976, John Wiley and Sons
Authors: Wood Daniel K.
Published: January 2007

This book belongs to the Information Sciences Series published by John Wiley and Sons which is designed to cover the various aspects of communicating, utilizing, and storing digital and graphic information. The book deals with concepts of managing the data, rather than techniques for application in data management.
Modern on-line systems
Authors: Jones Karen Sparck
Published: January 2007

Automatic information retrieval, that is document retrieval, was an early concern in computing. It might, however, be thought that since modern on-line systems have more than achieved the technological aims of the original workers in the field, there is no further need for research. I shall argue that this is not the case.
Review of "Data base management systems, by Alfonso F. Cardenas", Allyn and Bacon, Inc., 1979.
Authors: Murphy Rochester
Published: January 2007

The author has been unquestionably successful in accomplishing his objectives, the most outstanding of which is an "illustrative...critical, and quantative" presentation of representative samples (chapters 5 through 9) of the network, hierarchic, inverted tree, and relational approaches to generalized data base management system (GDBMS). The common example carried through these chapters was a well chosen and effective vehicle for showing the commonalities, differences, strengths, and weaknesses of the approaches. The fundamentals of file organization and data base concepts (chapters 2 and 3), built upon some of the author's previously published work, preceed a short economic and architectual tabulation of marketed systems (chapter 4). The presentation of the last generalized data base management approach, IBM's experimental System R, is followed by a one chapter treatment of supporting concepts, functional dependencies, and normalization.
Information retrieval specialist group research colloquium
Authors: Croft W. Bruce
Published: January 2007

The second research colloquium organized for the informal presentation of research ideas in Information Retrieval was held at the University of Aston, Birmingham on 2-3 April 1979. Many of the talks were on aspects of bibliographic information retrieval systems but a large proportion were about data base management systems. Considering that the last colloquium contained virtually no mention of this topic, it was not surprising that this provoked quite a lively discussion about the relationship between the two types of systems. The main conclusions of this discussion were thata) A data base management system (DBMS) was a convenient tool with which a bibliographic information retrieval system could be implemented, butb) By considering the problems inherent with bibliographic data (large term vocabulary, non-exact matching), facilities may be provided on a DBMS to make this implementation more efficient.
Review of "Information Retrieval: Computational and Theoretical Aspects, by H. S. Heaps", Academic Press Inc.
Authors: Wiersba Richard K.
Published: January 2007

The author of this book has done an excellent job of achieving at least one portion of his two-fold purpose: "...to introduce the computer science student to some of the basic problems of information retrieval and to describe the techniques required to develop suitable computer programs, ... (and) ... to describe the general structure of the relevant computer programs so that basic design considerations may be understood by information officers and librarians will find this text palatable."
NTIS newsletter
Authors: Groman Robert C.
Published: January 2007

The Winter 1980 issue of the FORUM (Volume XIV, No. 3) requested that readers let me know of their experiences with the National Technical Information Service (NTIS) newsletter service. If you subscribe to any one or more of their 26 subject area newsletters please let me know1. The newsletter name2. The length of time received (months)3. Whether you have found it useful (on a scale from 1 - very useful to 4 - not useful)4. Any other commentsThese responses will be summarized and reported in this column.
Review of "Industrial Information Systems: A Manual for Higher Managements and Their Information Officer/Librarian Associates by E. B. & R. L. Jackson"; Academic Press for Dowden, Hutchison & Ross, 1978, Stroudsburg, PA
Authors: Krishnayya J. G.
Published: January 2007

This book is written primarily as a guide to industrial higher management and to Information Officers in large industrial corporations. It is also intended to be used as a graduate text in courses in Information Systems/Services and in industrial special librarianship. It largely succeeds in these objectives but may not be of much utility to persons working in a library or below the corporate level or in a smaller corporation.
Review of "The Implementation of Complex Information Systems, 1979, by Andrew E. Wessel", John Wiley & Sons, New York
Authors: Krishnayya J. G.
Published: January 2007

This book is one of the Information Sciences series published by John Wiley and is meant for "Users, Managers, and Technologists." The objective is to give a set of guidelines for implementing "complex" information systems. Complex information systems are defined as those "functioning within a multipurpose, multiuser environment - whether they are relatively simple data banks, more involved accounting or banking/credit systems, documentation systems, or middle or higher level management decision systems." Though the definition includes "management decision systems," the book focuses upon information storage and retrieval systems. Four of the five case studies presented are on the computerization of documentation systems. No mention has been made of simulation, modelling, optimization packages, etc., which are essential components of any information support system for managerial decision making, nor is the general problem of management information system design covered.
MEDUS/A
Authors: King Chester , Goldstein Larry , Stocker Gail
Published: January 2007

MEDUS/A was designed by members of the Health Systems Project at the Harvard School of Public Health. As a general-purpose DBMS, it enables clinical and public health researchers and their staff to define a database and enter, query, and retrieve their data for analysis without a programmer. The system has simultaneously supported a variety of projects in the Harvard Medical Area since 1976 and is ready for release outside of Harvard in a new version written in Standard MUMPS. Though designed for medicine, the system is sufficiently general for other fields.
Automatic indexing
Authors: Borko Harold
Published: January 2007

SIGIR, from its very onset in the early 1960's, has been concerned with the development of automatic information retrieval systems and with improving the effectiveness of automatic indexing. Automatic indexing is a subsystem, or component, of an automatic information retrieval system. The term "automatic" implies that the process is to be accomplished by a set of computer programs rather than by the intellectual effort of skilled people. The essential questions that need to be answered are how automatic indexing can:• Adequately represent the subject content of a document;• Improve recall by increasing the number of relevant documents retrieved;• Improve precision by decreasing the number of non-relevant documents retrieved.In this tutorial, I will review the basic and improved procedures that have been devised to respond to each of these questions. Finally, after we have reviewed developments in automatic indexing, we will consider the more radical questions of:• Whether we can rely exclusively on automatic indexing to achieve adequate retrieval effectiveness in online interactive document retrieval systems, and• Whether the traditional recall and precision ratios are the best criteria for evaluating the effectiveness of online retrieval systems.
Complete statistical indexing of text by overlapping word fragments
Authors: Mah Clinton P. , D'Amore Raymond J.
Published: January 2007

By using overlapping word fragments to index text, we can combine the best features of the keyword and the full text approaches to document retrieval so as to facilitate searches on any content word. The characteristics of a retrieval system based on word fragment indexing can be precisely predicted from a multinomial model of text. Controlled experiments with two different text collections indicate that such a system can be highly effective under quite general conditions.
"Do we need an information policy?"
Authors: Brown George
Published: January 2007

It's a real pleasure to have the opportunity to speak at this important conference. The research and the ideas you are discussing this week will have a profound influence on our society during the coming decades. The societal and economic changes, both now and in the future, brought about by information systems and computers are attracting the attention of the media, the general public, and even the Congress. As you may know, "High Technology" is one of the most frequently heard buzzwords around Washington these days. If you could retrieve, from a data base of this year's congressional speeches, those speeches containing the key words "High Tech," I'd bet you'd find at least one speech by each member of Congress. In my own case, you'd probably get a list of every speech I made.
Online access AIDS for documentation
Authors: Girill T. R.
Published: January 2007

Computer documentation poses three information management problems, access problems that readers face when they try to find answers to questions using the documentation. All three problems arise from a mismatch between what readers want or expect and what document authors provide in (1) vocabulary, (2) text structure, and (3) text scope.
Some characteristics of future information systems
Authors: Salton G.
Published: January 2007

The existing information systems are characterized by sophisticated hardware designs and relatively unforgiving software support. One may expect that future information systems will provide a unified approach to several different types of information processing tasks, as well as more user-friendly processing environments. Some of the requirements of future information systems are described in this note and various advances in retrieval system design are examined, including automatic indexing, automatic query formulation, and extended Boolean query processing.
Selected IR-related dissertation abstracts
Authors: Humphrey Susanne M.
Published: January 2007

The following are citations selected by title and abstract as being related to Information Retrieval (IR), resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Cryogenic programming
Authors: Kalan James E.
Published: January 2007

The past twenty years has witnessed an incredible growth in computer computing capability. Indeed, the million-fold increase in multiplication speeds alone have made possible the efficient solution to seemingly impossible problems. A quite theoretical question is that of determining the limit, if one exists, of possible hardware performance. A realistic response is how to extend it.
Microcode support software for the Modular Computer System
Authors: Tracz William J.
Published: January 2007

This paper describes the microprogramming support software tools used to implement and verify microprograms for the Modular Computer System (MCS) at IBM-Owego, NY. The concept of emulating various existing machine language instruction sets to form a "multinative architecture" is the cornerstone of the MCS. Powerful, reliable, and economical microprogramming tools had to be developed to facilitate the large microprogramming effort involved in emulating multiple architectures on the MCS. This paper discusses the software technology behind the microprogramming support software tools (Assembler, Linkage Editor, Computer Logic Diagram Generator, and Simulator) developed for the MCS and analyzes their performance and results.
Characterisation of microinstructions as destructible flows in controlled graphs
Authors: Akonteh Ayola N.
Published: January 2007

The flow of control signals in digital computers is modelled as destructible flows in controlled graphs where each vertex i ε V(G) represents some module of a system z
n
. By establishing a flow path from vertex i to vertex j an edge x ε E(G) is created which represents a microinstruction. For all sets of vertices V(G) exist a connectivity matrix C on which a set of microinstructions μ I(z
n
) can be defined. The model can be used to answer several computer design questions including cost-effective control paths, control functions extensions and coding and in digital systems design optimization.
Towards better instruction sets
Authors: Flynn Michael J.
Published: January 2007

An effectively designed instruction set is the result of many considerations. These include not only obvious measures such as code size, performance and implementation cost, but also issues such as compatibility and especially design complexity.In an effort to reduce the design complexity, flexible or universal base designs have been used to realize various instruction sets or source problem requirements.Using either a dedicated or universal host, language oriented DEL architectures may offer some significant performance advantages over more traditional architectures.
Local and global microcode compaction using reduction operators
Authors: Henry Steven G. , Mueller Robert A. , Andrews Michael
Published: January 2007

The problem of compacting microcode has received considerable attention, but there remains much room for improvement. The major obstacle is the NP-completeness of the associated optimization problem and the coupling between code generation and compaction. Reduction operators are one form of heuristic technique that have been used effectively in scene analysis. By abstracting the microcode compaction problem as a constraint satisfaction problem, we can utilize some developed heuristic techniques. This approach is demonstrated along with experimental results obtained from a computer implementation. A comparison is made with several existing methods.
A design approach for a microprogrammed control unit with built in self test
Authors: Duran Jordi , Mangir Tulin E.
Published: January 2007

We present an architecture for concurrent testing of a microprogrammed control unit. This approach is compared with other control unit testing strategies. The advantages of this approach are: a) it allows testing of the control unit independent of the operational section, b) minimizes the hardcore, c) it is easily incorporated in microprogrammed control units, d) since it is concurrent, probability of detecting intertermittent errors is high, e) it is incorporated into the specification and therefore amenable for VLSI implementations.
Modifications to the VAX-11/780 microarchitecture to support IEEE floating point arithmetic
Authors: Aspinwall David B. , Patt Yale N.
Published: January 2007

The VAX-11/780 was designed specifically to implement the VAX architecture. As such, it does not support the IEEE standard for floating point arithmetic. A project was undertaken to provide this support by modifying the 11/780 microarchitecture. Our objective was to produce a microengine that would efficiently execute a modified VAX instruction set, in particular, one that executes VAX floating point instructions consistent with the IEEE standard. We made minimal changes to the 11/780 hardware, relying primarily on changes to the microcode. This paper describes the work of this project.
Microprogrammed associative instructions
Authors: Albert B. , Bode A.
Published: January 2007

The microprogrammed implementation of associative instructions on conventional microprogrammable computers with address-based memory-access is introduced as "vertical processing". The implementation on the processors of the EGPA-multiprocessor project is reported as well as runtime comparisons of the microprograms with equivalent HLL-programs. The contribution of the factors vertical migration and associativity to the observed overall speedup is described. Finally, a detailed analysis of the underlying microarchitecture and the handcoded microprograms is given in view of local and global compaction techniques.
Automatic address assignment of horizontal microprograms
Authors: Takahashi Etsuo , Takahashi Kazutoshi , Bito Tatsushige , Sasaki Tohru , Kitano Kazuyoshi
Published: January 2007

This paper presents a machine-independent address assignment program and its algorithm
7
for horizontal microprograms. An address assignment operation is performed on a symbolic microprogram called a "standard sequence microprogram." Microprograms which need address assignment are translated to this standard sequence microprogram.The introduction of the standard sequence microprogram has made the address assignment tool applicable to various kinds of horizontal microprograms.
On automated design of compacted microprograms
Authors: Dembinski P.
Published: January 2007

A method of automated design of horizontal microprograms from their vertical specifications is proposed. It may be considered complementary to the known microprogram compaction algorithms in that it mainly deals with branching and looping structure of the source microprogram and not with its straight line segments. The method is based on systematic performance of a local microprogram transformation dynamically adjusted to the hardware derived constraints formulated separately.
Architecture quality
Authors: Kavi Krishna M. , Krishnamohan K.
Published: January 2007

During the past few years, researchers in Computer Architecture have seen a number of new, so called "non- von Neumann" innovations. Some of these innovations are finding their way into commercial computers, while others are relegated to the back waters of research logs. There are several reasons for the reluctance of manufacturers in implementing new ideas. One of the important reasons cited by the panel at NCC 81 [1] is the lack of quantitative data substantiating the benefits of the innovations. As one of the panelists remarked, "we need an order of magnitude improvements, hopefully in base 10", before new architectures can find their way into commercial computers.
Applying pipelining techniques to microprocessors
Authors: Slager Jim , Louie Glen , Gindraux Loys , Rash Bill
Published: January 2007

Pipelining techniques are used in the Intel iAPX 286. High performance with full protection using normal speed memories require pipelining techniques. Pipelining gets the most done in each processor clock cycle. The internal pipelining is then exported to the memory bus to allow usage of slow memory devices.
Step-27 development station
Authors: Wilburn D. L. , Mick John
Published: January 2007

Step Engineering of Sunnyvale, California, has recently introduced the Step-27, a new Development Station that addresses the problems of the advanced microcoder. It offers the following features unavailable in other machines:• Internal RAM with ten-nanosecond access time; the fastest Writable Control Store (WCS) available,• In-line assembler/disassembler,• Real-time emulation of 29116 and 2910,• Sixteen-level state machine, and• Array sizes up to 512 bits wide by 65K deep in either single or multiple array configurations.
Experience with access functions in an experimental compiler
Authors: Ris Frederic N.
Published: January 2007

This paper describes an access function subsystem embedded in portions of an experimental microcode compiler which was built and used during 1973--6 using the IBM PL/I optimizing compiler under VM/370 and CMS. The use of the access function subsystem in this context was itself an experiment, performed by a group for all of whom PL/I was a new language and VM/370 a new operating system. The implementation of the subsystem was done strictly within the confines of the PL/I language. The basic objectives were ease of use, provision of a focal point for global storage management, extensive run-time validity checking with appropriate diagnostics, and data protection. Beyond satisfying these objectives, the subsystem proved more valuable than anticipated due to positive contributions made to debugging code in the VM/370 interactive development environment.
Design of microprogrammed control for general purpose processors
Authors: Hoff George
Published: January 2007

This paper reviews some of the major concepts involved in the design of a microprogrammed control for a general purpose data processor. The areas discussed are timing, control store cycle design, bit dimension design and word dimension design. The design considerations are presented from the perspective of a system design engineer concerned with producing a viable product design. Although the concepts are presented in the context of a medium to large scale processor design; they are, for the most part, applicable to the design of any microprogrammed system.
A simple computer
Authors: McKeeman W. M.
Published: January 2007

The organization of a particular computer is described at a level of detail suitable for classroom presentation at an introductory level. The computer consists of several units which manipulate and store data, a bus structure connecting them, and a microprogramming mechanism to control their operation. Both instruction decoding and interpretation are determined by the microprogram. The microprogram for a single-address computer is given as an example; the student is asked to redo the microprogram to implement stack instructions or some other sequential instructions of his choice. An XPL program which (1) reads a microprogram, then (2) reads a program, then (3) executes the program with a run-time trace is presented in the appendices.
Classes of emulators
Authors: Flynn Michael J.
Published: January 2007

Comparison among various host machines when emulating a specific image machine or various image machines form an important basis for host machine performance evaluation. With the increasing availability of host machines which are not biased to particular image machines and the use of these machines in the emulation of a variety of images, subtle differences in the interpretation of a specific image may give rise to significant differences in performance of the emulation.
Microprogrammable microprocessor survey
Authors: Adams Phillip M.
Published: January 2007

The purpose of this document is to provide a general overview of most of the commercially available microprogrammable microprocessors and associated microprogram sequencers. This document attempts to provide both an architectural overview as well as a microprogramming overview. No attempt is made in this document to provide the basic concepts of microprogramming, microprogramming terminology, etc. Instead, it is assumed that the reader has read or has access to the large amount of literature dealing with the topic of microprogramming, in general.
Microprogrammable microprocessor survey
Authors: Adams Phillip M.
Published: January 2007

The Motorola M10800 LSI processor family consists of a sequencer, referred to as a Microprogram Control Function (MCF) - MC10801, and a processing element, referred to as a 4-bit ALU Slice - MC10800 (Not to be confused with the processor family number M10800). Undoubtedly, the most interesting feature of the M10800 processor family is the ECL technology used to produce it. The M10800 processor family is completely MECL 10,000 compatible and exhibits the ultra-high speed performance of ECL logic.
Computing uses in higher education
Authors: Moss James L.
Published: January 2007

The preceding article reports the results of a survey of university computer center directors conducted in the Spring of 1980. The results have been reported separately so that readers may review the data and make their own assessment of the implications for computing technology in higher education institutions in the future. That is what I have done, and this article reflects my opinions, based on the data, of the state of the art of the use of computer technology in universities at present, and some ideas of what can be expected in the future.
Evolution of data communications at the University of Missouri
Authors: Burton Coleman H.
Published: January 2007

The University of Missouri system is composed of four campuses, in Columbia, Kansas City, Rolla and St. Louis. The University has been in the data communications business since the fall of 1971, when a remote job entry connection was established between the St. Louis campus and a then large cpu in Columbia. A large central computer facility, consisting of an Amdahl 470 V/7 and an IBM 3031, now serves all four campuses of the University, other Missouri institutions of higher education, and several state and federal government agencies.
Ethical obligations of computing center personnel
Authors: Abshire Gary
Published: January 2007

Ethical issues often arise between computing center personnel and other university members concerning the appropriate use of computer resources, the safeguarding of information, the ownership of software, the giving of credit for computer-related work, and many other areas. These issues take the form of ethical obligations, which are the just and fair dealings that people have with other people, dealings that one feels bound to do, or to refrain from doing, because of the law, their own morality, or some other ethical reason.
Documentation for the non-scientist
Authors: Ide Nancy M.
Published: January 2007

In the past few years the number of computer users from the humanities and social sciences has increased markedly. Realizing the tremendous advantage that text processing programs and statistical packages afford in the pursuit of their work, the "non-scientists" (1) have begun to regard the computer as a necessary academic tool. As more and more members of the liberal arts community attempt to acquire computing skills, those of us charged with the task of providing instruction in the use of computer programs and systems must take into account the needs and, particularly, the perspective and intellectual habits of a fundamentally new breed of computer user.
Techniques for producing effective newsletters
Authors: Barden Leslie
Published: January 2007

This paper has two parts. The first discusses the procedure followed by the National Institutes of Health (NIH) in judging the 1981 SIGUCC newsletter contest. The second is a compilation of tips for producing better newsletters.
Managing creative people
Authors: Burns Margaret H.
Published: January 2007

Managing a staff of writers, artists, producers--you know, "creative types"--poses several anxieties for many managers. In analyzing why this is so, I looked at my own business experiences--as a manager who directs creative thinkers and doers, and as a creative person, myself. I will first describe certain qualities which challenge managerial skill and then I will describe management practices I have found effective in being managed (as a creative person).
The University of Oklahoma programmer trainee program
Authors: Hill Ann Dee
Published: January 2007

The University of Oklahoma Programmer Trainee Program was developed because of our inability to compete on the open market for a trained programming staff.
Computer utility environments and local networks
Authors: Gallizzi Edmund L.
Published: January 2007

Current activities in computer system development indicate a continued interest in and expansion of Computer Utility Environments (CUE) and local networks of the most cost effective computers that can be produced in the current technology, CUE's are characterized by the support of functions that are integrated into the user's work, as well as other, environments. This utility in the future will be as commonplace as the typewriter, photocopy machine, telephone, mail, etc. Office automation systems now in use are an example of a specific CUE. CUE's are a development of the ideas presented as early as 1965 by the groups that developed the Multics system. These groups were from MIT, Bell Telephone Laboratories, and General Electric (later Honeywell). In his book The Multics System, Elliott Organick explained the system objectives as "In a sentence, these objectives were and are to provide multiaccess computer use to a large community of individual problem solvers, teams of cooperating researchers, and/or (legitimately) competing entrepeneurs, by providing reliable processing power and storage that expands as required in which information private to its users can be shared in a controlled manner."
Computer center management symposium the impact of Reaganomics on the university and university computing
Authors: Buchholz James R.
Published: January 2007

First of all, I want to thank you for inviting me. I am pleased to be here and pleased that you've chosen to attend this session. During the next few minutes, let's think together about the economic environment facing higher education, the impact of federal economic policy and the challenges this may bring to us as we seek to provide leadership for this fascinating decade. How we see the challenge will have a significant impact not only on the individual institutions we serve but on higher education in general and it will also affect the satisfaction we receive from what we do.
Your comments are requested SIGUCCS futures study
Authors: Moss James L.
Published: January 2007

The ACM Special Interest Group in University and College Computing Services was established in 1963 under the name SIGUCC, University Computer Centers. As it approaches its twentieth anniversary, the SIGUCCS Board has appointed a Futures Study Group to make recommendations on future directions, interests, organizational structure, and affiliations. Members of the Futures Study Group, with mailing addresses, are listed following this article. The author was appointed to chair the study group and make a report at the next SIGUCCS Board meeting which will be held in Chicago in November 1982, in conjunction with the SIGUCCS User Services Conference.
Determining the staffing levels and commensurate technical skills required for a university computing center
Authors: Bock Peter , Young Julie
Published: January 2007

This paper presents the results of several years of management experience at the Computing Facility for the School of Engineering and Applied Science at the George Washington University in Washington, DC. It addresses the evolution of the management policies concerning the organization of the Facility staff, required staffing levels, technical skill requirements, and employee work loads and compensation.
Personnel scheduling
Authors: Schwarz Mary-Beth
Published: January 2007

In today's society one finds computers being quickly assimilated into every aspect of life. This rise in computer use is reflected in the growth of university computing facilities. User education and assistance as well as site surveillance and maintenance can no longer be provided by a small group of people. At the University of Delaware there are two main sites for the computing community. Consulting services are provided at two locations for more than one hundred and fifty hours each week. About the same number of hours per week are scheduled for site-related services. Employing students has been found essential in providing these services. However, since students' schedules vary greatly and change frequently, scheduling these services becomes a tedious and time-consuming task.