bluuebunny/crossref_metadata_2025 huggingface dataset:
Factorization of Multivariate Polynomials over the integers
Authors: Claybrook Billy G.
Published: January 2007

For some time now I have been wondering how well the existing polynomial factorization algorithms perform on some of the more difficult multivariate polynomials. Below are ten (of the over 300) multivariate polynomials that the heuristic program (POLYFACT) with learning factored while I was working on my dissertation (a complete description of POLYFACT will soon appear in the journal Artificial Intelligence). Table I gives the factorization times for POLYFACT. When any programs factor some or all of the ten polynomials, I think it would be interesting to publish the times (along with the polynomial number(s) in the SIGSAM Bulletin. Please indicate the machine on which the factorization was done. I am submitting the ten polynomials in factored form in order to conserve space; they need to be expanded and simplified prior to factorization attempts.
On the separation of the roots of a polynomial (extended abstract)
Authors: Mignotte Maurice
Published: January 2007

In a recent paper COLLINS and HOROWITZ [1] considered the following problem: Let P be a polynomial with rational integer coefficients. If sep (P) is the minimum distance between distinct roots of P, find a good lower bound for sep (P). This question is important for the algorithms which calculate the roots of a polynomial (see [1] for a more detailed discussion).
A solution to SIGSAM problem #8
Authors: van Hulzen J. A.
Published: January 2007

In SIGSAM Problem # 8, [1], is asked for a part of the power series expansion of[EQUATION]The presented solution, based on special purpose differentiation algorithms [2], is constructed to give some insight in the structure of P
r
(n).
An algebraic simplification program in PL/I
Authors: Bahr Knut
Published: January 2007

One of the objectives of the project reported on was to explore the usability of PL/I for the purpose of writing a symbolic formula manipulation program in a higher level language. The first step along this line is writing an algebraic simplification program.
Optimal multiplication chains for computing a power of a symbolic polynomial
Authors: Gentleman W. Morven
Published: January 2007

This paper shows that in a certain model of symbolic manipulation of algebraic formulae, the simple method of computing a power of a symbolic polynomial by repeated multiplication by the original polynomial is, in essence, the optimal method.
A graphical approach to coset enumeration
Authors: Dimino Lucien A.
Published: January 2007

In 1936, J. A. Todd and H. S. M. Coxeter published a paper [13] in which they described a technique for enumerating the cosets of a finite group given only a presentation for the group and the generators of the sub-group written in terms of the generators of the group. This process has an interesting interpretation in terms of directed graphs which is described below.
Algebraic algorithm descriptions as programs
Authors: Loos Rüdiger
Published: January 2007

We propose methods for writing algebraic programs in an algebraic notation. We discuss the advantages of this approach and a specific example.
Power aware routing using power control in Ad Hoc networks
Authors: Jung Eun-Sun , Vaidya Nitin H.
Published: January 2007

A conventional routing protocol selects a path using the shortest number of hops as a routing metric. Is has been proposed that a different routing metric may be useful to achieve energy savings. One such power-aware routing metric is minimizing the aggregate transmission power on a path from a source to a destination. This metric has been used along with a simple power control protocol, which uses the maximum transmission power for RTS and CTS and the minimum necessary transmission power for DATA and ACK. Although this type of power control protocol does not provide spatial reuse it can conserve energy. We will refer to this kind of power control as the BASIC power control protocol. In this paper, we show that a power aware routing, minimizing the total transmission power, with BASIC power control does not save energy, which contradicts previous studies in the literature. The reason is simple and intuitive but it has been entirely overlooked. Using the power aware routing metric, the selected paths can be much longer than the shortest path. In other words, there can be more hops between a source and a destination. Since BASIC power control does not provide spatial reuse, nodes on a path have to share and compete for the channel bandwidth. Therefore, the throughput achieved between a source and a destination can be lower than that of IEEE 802.11 without power control Also, we found that the metric leads to lower data bits delivered per unit of transmission energy. We show that using the shortest number of hops in conjunction with BASIC power control conserves more energy than power aware routing with BASIC power control.
Restructuring for large data bases
Authors: Navathe Shamkant B. , Fry James P.
Published: January 2007

The development of a powerful restructuring function involves two important components - the unambiguous specification of the restructuring operations and the realization of these operations in a software system. We direct our efforts to the first component in the belief that a precise specification will provide a firm foundation for restructuring algorithms and implementations. This paper defines completely the semantics of the restructuring of tree structured data bases.The delineation of the restructuring function is accomplished by formulating three different levels of abstraction, with each level of abstraction representing successively more detailed semantics of the function.At the first level of abstraction, the schema modification, three types are identified: naming, combining and relating, and are further divided into eight schema operations. The second level of abstraction, the instance operations, constitutes the transformations on the data instances. They are divided into group operations such as replication, factoring, union and group relation operations such as collapsing, refinement, fusion etc. The final level, the item values operations, includes the actual item operations such as copy value, delete value, or create a null value.
File operations in a streaming processor
Authors: Jordan B. W. , King K. J. , Miller G. D.
Published: January 2007

There are several operations in non-numeric processing which can be classified as file operations. These operations include such things as sorting, searching, and table lookup. They are characterized by their repetitious, homogeneous treatment of fields within records within files. Present computer organizations generally require several instructions imbedded in a loop to process each source-operand pair. This paper outlines a computer organization (called a streaming processor) which operates on long data streams with considerably less instruction processing overhead: fetching and decoding. Thus a greater percentage of the storage bandwidth is used for data and consequently the streaming processor is more efficient for such file operations.
Architecture of a nonnumerical accumulator
Authors: Chu Yaohan
Published: January 2007

This paper presents the architecture of a nonnumerical accumulator which makes use of a specially organized associative memory. In contrast to a numerical accumulator, this nonnumerical accumulator is capable of matching, moving, inserting, deleting, altering, counting, and marking bits, characters, words, and sentences stored in the nonnumerical accumulator. In this paper, the configuration and instructions of the nonnumerical accumulator together with programming techniques for some applications are presented.
A specialized computer architecture for high-speed text searching
Authors: Roberts David C.
Published: January 2007

This paper describes a specialized parallel computer architecture that is proposed for high-speed searching of large text data bases. The proposed machine architecture is a parallel array of independent processors connected to a common bus. Each processor consists of a microprocessor, a high-speed block-access memory for storage of a part of the data base, read-only memory for control software, and random-access memory for storage of programs and working storage. The processors are connected by a common high-speed bus that is used for communication of data, programs, commands and results. The benefits claimed for this architecture are design simplicity, high speed for suitable applications, ease of software development, reliability and reasonable cost. This machine architecture is under consideration as a means for providing high-speed text searching capabilities.
Review of "Data Base Processing Fundamentals, Modeling, Applications by David Kroenke"; Science Research Associates, 1977
Authors: Noreault Terry
Published: January 2007

This book is an introductory text for data base management systems. The author's presentation starts with descriptions of the physical characteristics of secondary storage devices and ends with a discussion of the design and administration of data base systems. The book would probably be useful to those with some prior knowledge of data structures.
Abstracts
Authors: Schuster S. A. , Ozkarahan E. A. , Smith K. C.
Published: January 2007

The Relational Associative Processor (RAP) is an experimental "backend" cellular processor for implementing data base management systems. RAP is particularly well suited to supporting Codd's relational model of data. The capacity of a RAP device implemented with current IC and memory technology can be estimated to contain 10E8 to 10E9 bits of associatively processable data. Because many data bases are larger, a virtual memory environment for RAP has been proposed and its performance simulated. The environment incorporates conventional memories for bulk storage and a single RAP processor - both controlled by a general purpose front-end computer. The system requires that the entire relational data base be divided into pages of size equal to one RAP cell memory. A buffer memory is added to RAP to permit the overlap of paging with processing. It has been found that user environments containing small relations or queries exhibiting either long processing times relative to paging requirements or some "locality" (defined as the degree to which sequences of queries reference some relations more than others) can efficiently page data between large data bases and data base machines without significant losses in performance.
Review of "Computer-Aided Information Retrieval by Andrew E. Wessel"; Los Angeles, Melville Publishing Company, 1975
Authors: Smith Linda C.
Published: January 2007

The author defines the scope of his discussion in his statement: "The core notion in this book is that an inter-locked triad of user organization, thesauri builder and computer technologist is capable of achieving computer-aided information retrieval systems which make actual a great deal of the potential of automated search" (p. 169). Wessel offers theoretical and practical grounds for choosing a methodology centered on people supported by computers rather than a fully automated approach. In particular he advocates development and use of well structured thesauri stored in computers to assist in both indexing and search of documents.
Information retrieval activities at the School of Information Studies Syracuse University
Authors: McGill Michael
Published: January 2007

The School of Information Studies of Syracuse University was known as the School of Library Science until 1974. This name change signalled a shift in emphasis from the traditional study of the library and library activities to a concern with the needs, uses, acquisition, organization, storage and retrieval of information. It also indicated a shift toward a research environment. Since 1974 the School has moved from essentially no outside research income to a fairly stable base of approximately $500, 000 per year. Research activities now include topics such as the study of ranking algorithms in information retrieval systems; the development and study of a health information sharing project; a study of the user-search intermediary question negotiation process; and a study of the impact of the representation of documents in an information retrieval system.
Lexical relations
Authors: Fox Edward A.
Published: January 2007

One of the essential features of the "Meaning <=> Text" model (MTM) developed by I. A. Mel'chuk et. al. is the special lexicon or ECD ('explanatory and combinatory' dictionary). This component can be thought of as a collection independent thesaurus, and can be applied to improve the effectiveness of an information retrieval system.After outlining the MTM and related work, this paper briefly describes the SMART type of information retrieval system. Applicability of the above-mentioned lexicon to such a system is discussed. In particular, the list of lexical relations included in the ECD is expanded and organized to be more effective for retrieval, partially along the lines suggested by Evens and Smith.Finally, an experimental analysis of the utility of lexical relations in an information retrieval system is discussed. It is shown that lexical relations generally enhance system performance. When all lexical relations are considered in the comparison, the resulting performance is shown, by statistical methods, to make a significant improvement (up to 16.5% at a single recall level); when all lexical relations except for antonyms are considered, the improvement is even greater (up to 20.2% at a single recall level).
Experiments with automatic text filing and retrieval in the office environment
Authors: Croft W. Bruce
Published: January 2007

A series of experiments using statistical techniques for the filing and retrieval of business text are described. The text documents used in the experiments are a combination of memos, letters, reports and informal messages. The results show that these techniques are effective in the office environment and, using this as a basis, recommendations are made for the design of the text filing and retrieval component of an office information system.
Dissertation abstract
Authors: Groman R. C.
Published: January 2007

Information retrieval can be defined as the extraction of specific information out of a great number of stored information items. Information retrieval systems, used for the retrieval of documents, try to answer more or less precise questions about interesting topics with a number of suitable documents or references to documents. Such systems should contain 'knowledge' about the meaning of questions, about the content of the stored information and the particular user's needs for information.Knowledge-bases systems claim to be able to store knowledge an draw conclusions from it. The goal of this thesis is to investigate the use of knowledge-based methods and technologies for information retrieval. A knowledge-based information retrieval system should represent its Information Structures, as well as knowledge in a common knowledge representation formalism. The retrieval process of the system should employ the inferential methods of the used knowledge representation formalism.A subset of first order logic is chosen for this thesis to represent knowledge. Specially designed retrieval rules represent knowledge for the purpose of retrieval. Retrieval rules capture knowledge about the user's vocabulary, his working domain and his way to perform the retrieval of documents. The problem of recall and precision of the answers of an information retrieval system is approached by an explicit representation of control knowledge.A theoretical model of a knowledge-based information retrieval system developed in this thesis specifies the requirements and properties, of such a system. In particular a novel term-similarity function could be defined. Properties like completeness and termination could be derived and boundaries for the amount of overhead of false control strategies could be investigated.The proposed model is implemented in a prototype of a knowledge-based information retrieval system, called KIR. KIR is a single-user system for personal document- and knowledge retrieval running on computer workstations. It is implemented using Prolog and Modula-2.
Review of "Firmware, Microprogramming and Restructurable Hardware, by G. Chroust and J. R. Mühlbacher", North-Holland Publishing Company
Authors: Neuhauser Charles
Published: January 2007

This book relates the proceedings of the IFIP Working Conference on Firmware, Microprogramming and Restructurable Hardware held at Linz, Austria during April of 1980. This conference involved about 60 participants, primarily from Europe, but with a good representation of US and Canadian researchers. Although a few industrial organizations were represented nearly all the participants were from universities and other academic organizations.
HLLDA defies RISC
Authors: Hopkins William C.
Published: January 2007

High Level Language Directed Architectures (HLLDAs) are usually intended as ideal hosts for programs written in the supported languages. Patterson et al. [1] have claimed that, in general, a Complex Instruction Set Computer (CISC) is less efficient than a simpler computer with a sophisticated compiler. We claim in this note that HLLDAs should not all be lumped into this generalization, outline some HLLDA design criteria to avoid previously observed inefficiencies, and propose a unification strategy.
A concurrent microprogramming facility
Authors: Fedak John F.
Published: January 2007

Control-unit microcode is characterized by the control of multiple asynchronous devices. This paper describes the Concurrent Microprogramming Facility (CMF), a general-purpose microcode operating system that applies recent advances in programming technology to define a uniform method of expressing this inherent asynchrony. This method is shown to be the basis for the partition of the microcode function and to provide a framework for communication between programmers as well as programs. CMF provides an environment where microcode is viewed as disjoint asynchronous processes that communicate with each other and hardware adapters using a small set of primitives based on the concept of message passing. A uniform process interface both streamlines documentation and accommodates multiprocessor designs. A macro-based system definition facility drives the system and allows the structure of a large microprogram to be specified on a single page.
Toward type-oriented dynamic vertical migration
Authors: Winner Robert I. , Carter Edward M.
Published: January 2007

The study of structured programming has shown that through data abstraction, program reliability and maintainability can be improved. At the same time, vertical migration has been shown to be an effective way to improve the performance of programs. Contemporary techniques, however, tend to address the needs of only certain classes of programs and therefore may overlook or even preclude certain optimization opportunities. Dynamic microprogramming can overcome the problem of applicability of a particular vertical migration by allowing the migration to be tailored for each particular application. This paper describes a project which is exploring the interactions of these three concepts of dynamic microprogramming, vertical migration, and data abstraction and how they can be integrated to form a coherent facility which provides automated redefinition of computer architecture for each application model.
Axiomatic proof rules for a machine-specific microprogramming language
Authors: Wagner Alan , Dasgupta Subrata
Published: January 2007

In recent years, much effort has been devoted to the design and implementation of high level microprogramming languages. One of the goals for such languages is to facilitate the formal verification of microprograms using Hoare's inductive assertion method. Essential to the use of this method is an axiomatic definition of the microprogramming language.In this paper, we describe the axiomatization of the machine dependent microprogramming language S*(QM-1) [12]. This language is an instantiation of the machine independent language schema S* [3,4], for the Nanodata QM-1 "nanolevel" architecture. We show that, in spite of the complexity of the QM-1, with its variety of side-effects and special conditions, a small and uniform set of proof rules can be constructed.
MIXER
Authors: Shimizu Toru , Sakamura Ken
Published: January 2007

Microprogramming is an important technique to implement various functions on VLSI chips, and to adapt computers to application problems; but it is very difficult to generate an optimal and correct microcode, because each microarchitecture has its own peculiarities. This paper describes the effectiveness of an expert system based on a knowledge base for microprogramming. The purpose of the system is to give microprogrammers with a tool to develop microprograms without requiring that they have a deep knowledge of the microarchitecture, and to reduce microarchitecture learning time. The system is called MIXER. MIXER is a microprogram development system having as its knowledge base Texas Instruments' TI990 microarchitecture, and generates a TI990 microcode. This paper also describes the creation of a PASCAL-P machine emulator by applying MIXER.
LSI-CP
Authors: Zambotti Larry G. , Hardy Richard E.
Published: January 2007

A Large Scale Integrated Central Processor (LSI-CP),
see photo below
, under development at IBM'S Federal System Division will address Department of Defense (DOD) standard computers. In particular, it executes the instructions sets of the AN/AYK-14 and AN/UYK-44 standard processors and will emulate other existing operational DOD computers.
iAPX 286 microarchitecture to maximize performance
Authors: Slager J. , Louie G. , Gindraux L.
Published: January 2007

Designers of previous generations of microprocessors have relied heavily on ever higher clock frequencies in order to provide increased throughput. As successive generations of microprocessors become more and more optimized, it becomes necessary to increase the use of parallelism and pipelining in order to realize significant increases in throughput. The internal circuitry of the iAPX 286 is organized in such a way that throughput is significantly increased even though major functional enhancements, which would normally be expected to reduce throughput, are also implemented.
A source language performance monitoring facility for the B1800 Modula Interpreter
Authors: Hurst A. J.
Published: January 2007

This note describes the features of a monitoring facility (called a
software oscilloscope
) installed on the Burroughs B1800 Modula Interpreter developed at ANU for use with the
JAS
operating system project [Hurst 83]. It allows dynamic monitoring of program behaviour at the source level, and provides a ready means for the evaluation of real time program behaviour.
'Soft' computer speeds new system development
Authors: Aeberhard John
Published: January 2007

PARIS, May 18 - An American computer system that's claimed to fill a 'special need in the computer industry' for an off-the-shelf machine that can mimic any digital architecture has found its first customer in Europe. Thomson Csf has installed the system, a QM-1 from Nanodata Computer Corporation of Buffalo, New York, at its Central Research Laboratory at Corbeville, Orsay, south of here.
Motivation and framework for using genetic algorithms for microcode compaction
Authors: Beaty Steven , Whitley Darrell , Johnson Gearold
Published: January 2007

Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered pool of strings that represent regions in the search space. New strings are produced from existing strings using the genetic-based operators of recombination and mutation. Combining these operators with natural selection results in the efficient use of hyperplane information found in the problem to guide the search. The searches are not greatly influenced by local optima or non-continuous functions. Genetic algorithms have been successfully used in problems such as the traveling salesperson and scheduling job shops. Microcode compaction can be modeled as these same types of problems, which motivates the application of genetic algorithms in this domain.
A compiler for the generation of optimized microprograms
Authors: Blain G. , Perrone M. , Hong N. X.
Published: January 2007

The system described allows the generation of microprograms in several stages. After a translation of its description in an appropriate Language one obtains an image of the microprogrammable structure. The microprogram is then introduced in algorithmic form, in a high-level language. Its compilation, in conjunction with the image of the wired structured, produces a sequence of elementary operations on which is carried out an optimization leading to an image of the control memory.The structure of the system allows to share the generation of the microprograms among two categories of designers: harware specialists who describe the micromachine, and algorithm specialists who actually implement the microprograms. Microprogramming may thus be facilited.
Ten years and more of micro-programming
Authors: Wilkes M. V.
Published: January 2007

Micro-programming was not a bright idea that came in a flash, but a solution slowly arrived at to a consciously posed problem, namely, that of finding a systematic way of designing the control unit of an electronic digital computer. As such it had to meet criticisms of inefficiency in rather the same way that high-level languages did at a later date. In both instances, a shift in emphasis has since taken the edge off such criticisms, but at the time the whole argument turned on them. In the case of micro-programming, therefore, stress was originally put on ways of realising the concept that would lead to efficient operation. One thought in terms of a long micro-instruction word, with no decoding of fields, and of the entire micro-operation being encompassed in one pulse time. This is what is now referred to as pure horizontal micro-programming. It imposed no restriction on the number of register transfers that could take place simultaneously. The long word gave a very large number of possible micro-instructions of which relatively few were usable. In these circumstances it was more natural to think of constructing a micro-instruction to do a certain job than to think of choosing one from a micro-instruction set.
Design of a microprogram generator for the VARIAN V73
Authors: Persson Magnus
Published: January 2007

The design and implementation of a micro-program generator MICAS/MICSIM (assembler, linker and simulator) for the VARIAN V70 series of minicomputers is described. More detailed information is found in [1]. First some general concepts are discussed which have influenced the design of software systems. Then the features of microprogramming support software are discussed.
Metrics for Microprogrammed Instruction Sets
Authors: Frisina J. N.
Published: January 2007

Having selected a Microprogrammed Instruction Set (MIS), the need to have a method of evaluation immediately arises. There are seven methods generally used to measure the performance of the proposed architecture. These methods are: Timing, Mixes, Kernel Programs, Benchmark Programs, Synthetic Programs, Mathematical Models, and Simulation.
A case study of the migration of an algorithm across software-firmware boundaries
Authors: Davidson Scott
Published: January 2007

There are many ways to implement an algorithm using a digital system. We can implement an algorithm directly in software, firmware, hardware or a mix of these techniques. For example, a program can be written for a microcomputer that uses external hardware (e.g. a calculator chip) to do floating point arithmetic. Another example is a machine language program that is optimized by rewriting heavily used portions of the program in firmware. Thus we see that a user (a term we shall use throughout to mean the implementor of the algorithm) potentially has a wide range of implementation methods from which to choose.
A microprogrammed interrupt service routine using the ECLIPSE computer
Authors: Brown Gerry A.
Published: January 2007

In a real-time process control environment, it is common for a processor to spend a sizable amount of time servicing interrupts. It is reasonable, then, to search for methods to decrease this time. One such technique involves the implementation of the routine at the microprogram level.This paper relates to the comparison of a microprogrammed and machine-level programmed interrupt service routine. It is shown that a reduction in time spent in the routine is achievable using microprogramming.
Results from a university-wide local area network and word processing RFI
Authors: Tyler John M.
Published: January 2007

The faculty and administration of Louisiana State University recognized that word processing and text processors could facilitate and enhance our teaching, research, service, and administrative operations; however, we were concerned about the rapid proliferation of limited-function systems being purchased to meet critical present needs without a systematic plan for continued expansion. The unit cost for stand-alone word processors was usually rather high and the interactive or expansion capabilities were very limited; therefore, we sought to define a system or systems upon which we could base our developments in the areas of text processing utilizing current technology and which could expand with future developments.
Tips for novice typesetters or
Authors: Curley Ann Marie
Published: January 2007

Do-it-yourself typesetting is becoming a reality. The situation may not be exactly the same as the imaginary one described above---you may instead find yourself producing tapes to drive a phototypesetter, or even working with your own machine. No matter how you access the equipment, one problem remains the same: now that I have access to it, what do I do with it?
The care and feeding of the creative worker
Authors: Haws Donald R.
Published: January 2007

What do these diverse elements have to do with managing the creative worker? In the 40's and 50's Abraham Maslow developed the concept that man is a perpetually wanting being who is continually striving to find ways to satisfy needs. These needs are internal; motivation is internal. He developed a hierarchy, or pyramid of needs. He maintained that there are five basic sets of needs: physiological needs, safety, belongingness and love, esteem and self-actualization. As each need is met, man goes on to the next. Thus, needs are not static; once a need has been satisfied it can no longer serve as a motivation of behavior.
Stress and the manager-creative worker relationship
Authors: Stewart Douglas
Published: January 2007

The Margaret Burns and Donald Haws articles point out the three major areas of potential stress in the relationship between the manager and the creative worker. The first area, based on contemporary research into the apparent lateral specialization of the brain hemispheres, is concerned with the fact that most creative people tend to be right-brain dominant, whereas a manager is more likely to be left-brain dominant, creating conceptual and communication problems. The second area of potential on-the-job stress are differences in the primary ego-reinforcing positions of managers and their creative employees. The third area is that of the delegation of tasks.
The "gap" between top management and DP directors
Authors: Smith L. B.
Published: January 2007

The knowledge/understanding gap between top management and directors of computing is identified as a problem. This gap will disappear with time as computer-generation people take over top management in twenty-five years or so. If we are not to wait, top management must accept computing as a new and different field and be willing to learn and ask questions now. Computing directors must also accept the challenge and teach computing to their top management.
Word processing developments at Oberlin College
Authors: Bosela George M.
Published: January 2007

Word processing as an application of computing resources has been the object of great interest in recent years. Its effect on the processes of business and education have been the subject of speculation and prognostication in many forums. I intend to review in this presentation Oberlin College's attempts over the past few years to explore the current state of word processing, evaluate its feasibility for the College, and define possible alternatives to bring about its introduction.
Twelve ways to improve cooperation with the computer center
Authors: Hassler Ardoth A.
Published: January 2007

Cooperation between the Computer Center and faculty is necessary for the continuance of programs in Computer Science. Enumerated here are twelve ways that cooperation between the Computer Center and faculty can contribute to a computer science education from the perspective of Computer Center staff.
The computer as a construct of social reality
Authors: Brabant Sarah
Published: January 2007

The social impact of the digital computer has been recognized since the infancy of the industry. Early analyses were largely speculative and centered primarily on machine capabilities, potential benefits and potential harm, e.g., increased capacity for input, processing storage and output, efficiency, loss of privacy, dehumanization and creation or loss of jobs. With the tremendous growth of digital computers in the United States and the proliferation of applications, studies have become more specific and situational. Because most computer based systems are either employed or administered by organizations, the organizational setting has become the primary focus of interest (Kling 1980).
Changes, changes, changes
Authors: Yagi Stan
Published: January 2007

Queen's University at Kingston, Ontario, Canada is a full service university founded in 1841 with the granting of its charter by Queen Victoria. The major disciplines are:Faculty of Arts and ScienceFaculty of Applied ScienceFaculty of EducationFaculty of MedicineFaculty of LawSchool of BusinessSchool of Nursing
Morality in the computer classroom
Authors: Gilchrist Bruce
Published: January 2007

We can argue about matters such as the precise definition of computer abuse, the number of unreported and/or undetected computer abuses, and the validity of the frequently made statement that the average loss from a computer-related crime is $450,000, but we cannot ignore the basic issue that conditions are ripe for a surge in computer abuse.
Another look at motivating data processing professionals
Authors: Toledo Ramon A. Mata , Unger Elizabeth A.
Published: January 2007

Motivation is a crucial management issue. The productivity of the U.S. worker is still dropping in the 1980's. The industrial revolution (automation of labor intensive industries) maintained productivity and increased standards of living earlier in this century. The computer revolution has a similar potential for the U.S. and the world. Another look at motivation thus appears indicated. Analysis of the data processing professional's personality profile as developed by recent studies [COU78, COU80, FIT78, LED80] in light of established theories of behavior results in several suggestions for managing computer personnel.
Microcomputers as a university resource
Authors: Konstam Aaron H.
Published: January 2007

At the turn of the century electric motors were very expensive, so expensive in fact, that a commercial workshop with several machines could not afford to have a separate motor to drive each machine. Therefore, the power of a large central motor was distributed to several machines through a series of belts, shafts and pulleys. As motors became cheaper, this method of supplying mechanical power to machines was abandoned. Each machine was equipped with its own motor which acted as a dedicated supplier of mechanical power to that machine.
University computer usage growth
Authors: Bieman James M.
Published: January 2007

Terminals line the hallways of the dorms and the classroom buildings. All buildings except the administration building are filled with students waiting to get their allotted 14 minutes to use a terminal. For the past three years, the football stadium has been used to hold lectures for freshman Computer Science classes. Next year, the stadium will be too small for the number of students trying to take the course. There has been talk of using the local cable television system to conduct the computer courses. The last semester's registration resulted in a near riot as students fought to get into the required computer courses. The national guard will be put on alert before the next registration period.
A network design for University
Authors: Penrod James I. , Quan Peter P. , Smith Leland R.
Published: January 2007

Pepperdine University is a mid-sized private institution with an informal relationship with the Churches of Christ. It is made up of four schools and colleges. Seaver College and the School of Law are located on the 819 acre campus at Malibu overlooking the Pacific Ocean. The School of Business and Management and the Graduate School of Education and Psychology are headquartered at Pepperdine Plaza, a high-rise building in West Los Angeles. This facility features a fully equipped academic computing laboratory and two electronic classrooms in addition to the administrative offices and classrooms for adult education.
Microcomputers for academic and administrative use at the Rochester Institute of Technology
Authors: Wilkins S. , Weeks R.
Published: January 2007

The Rochester Institute of Technology (RIT) is a privately endowed, co-educational, non-sectarian major institution of higher education. RIT is composed of nine colleges: Applied Science and Technology, Business, Continuing Education, Engineering, Fine and Applied Arts, Liberal Arts, Graphics Arts and Photography, Science and the federally funded National Technical Institute for the Deaf.
"Networked" microcomputers
Authors: Halaris Antony , Sloan Lynda
Published: January 2007

Iona College is a medium-size liberal arts institution with a strong commitment to both administrative and academic computing. The College will be introducing a computer literacy requirement into its core curriculum for the 1983 academic year. In addition the College offers ten programs at the undergraduate or graduate level which lead to a degree in computing or information sciences.The College has a well-established and highly-developed central computing facility to support both the administrative and academic users. The central facilities were the primary delivery mechanism for providing end user computing prior to September 1982. In the 1982-83 academic year two experimental microcomputer laboratories were created to meet the needs of specific educational programs. The objective of the program was to evaluate the effectiveness of using microcomputers (stand-alone or networked to the central facilities) to support academic computing. The Computing Center objectives were to determine the user's reactions to the use of microcomputers for academic computing and the impact of microcomputer facilities on the Computing Center management.This paper will present the results of this experimental program. Emphasis will be placed on the challenges presented to the Computing Center management. The experimental microcomputer laboratories have clearly shown that administering a microcomputer environment presents issues and problems that will be new to the administrators of centralized facilities. Some of the issues this paper will present are equipment selection, support of different microcomputer systems, equipment maintenance, facilities maintenance, software management, control and circulation of copyrighted software, security considerations, controlled access and accounting of usage for microcomputer facilities, and determining the total cost of a microcomputer system.
Planning and funding academic computing
Authors: Sobolewski John S. , Hoskins Dick , Nguyen Tri
Published: January 2007

This paper is an initial analysis of data from a 1982 survey of four-year college and university computer centers in the United States. Information is presented on the level and distribution of funding for academic computing, the services and service levels that are typically provided, the way the costs of those services are recovered, and the computer planning process used by the institution. Significant differences in these areas between private and public institutions are noted. In the context of this paper, academic computing is defined as computing that relates directly to the instructional and research programs of an institution.
Facilities management of departmental computers
Authors: Badger George
Published: January 2007

In talking to the other panelists before the meeting. I realized that there is a terrific range in what we mean by facilities management and a terrific difference in the degree of formality with which the three of us have approached it, going from basically a handshake agreement to a contract. There is a real opportunity both for the Computer Center and for the campus in the area of facilities management.
Installing campus local area networks and private telephone systems
Authors: Carmody Steven , Sweeney Frederick L.
Published: January 2007

Sweeney: First, a little bit about the University of Chicago The University is located in Chicago, which should not be a surprise. It is on the south side of the city and has been there for 92 years. The campus occupies approximately one square mile and contains about 100 buildings. This telecommunications project started about five years ago and, when it started, the objective was to replace an expensive telephone system with a telephone system which was less expensive. It was strictly a voice-oriented objective, originally. Data transmission was growing in the form of dial-up through the use of modems and in the form of terminal clusters hard-wired to the main computer site at the Computation Center. There were also a few other computer sites of lesser capacity than the Computation Center.
Videotex
Authors: Smith Andrew M. , DeWitt Craig A.
Published: January 2007

A campus and state-wide videotex system has been developed and implemented at Clemson University. The Computer Center, through its Academic Computing Support group has provided the technical expertise to design and operate the database software used for the videotex system. This new role for User Services, a part of Academic Computing Support, helps to increase the efficiency of disseminating information by bringing the power of computers into play.
Public universities
Authors: Wolfe Barbara B.
Published: January 2007

This paper is based upon a panel discussion held at the twelfth Computing Center Management Symposium, March 27-29, 1985. The session chair was Barbara B. Wolfe, Assistant Vice President for Information Systems at the University of Minnesota; the panelists were Geraldine E. MacDonald, Director of the Computing Center at the State University of New York, Binghamton University Center; Penelope Crane, Manager of Academic Computing for the California State University system; and James L. Carmon, Assistant to the President for Computing for the University of Georgia system. As the session chair, Barbara B. Wolfe assumed responsibility for the compilation of this paper.
Instructional computing and local area networking
Authors: Gerber Homer C. , Pringle G. Hale
Published: January 2007

The personal computer, hereinafter called PC, has profoundly affected the university community. A growing number of faculty from many disciplines are focusing instructional efforts around PCs and, as a result, more and more students are called upon to do their classwork using them. They are also increasingly being used by faculty for research and record keeping, and by administrative and clerical staff for word processing, spreadsheets, database access, and communication just as in other governmental and private business organizations. The result is a wide, growing, and changing use of PCs in the university community.
Creating a multimedia classroom
Authors: Mathis Gregg , Clarke Patricia
Published: January 2007

By tradition, Carnegie Mellon University seeks innovative ways to integrate computing and advanced technology into research and education. This ambition extends to classroom design as well.
Teaching an old bard new tricks
Authors: Ridgway Lee
Published: January 2007

The Shakespeare Interactive Archive is the rather unassuming name of a multimedia project whose ambition is to be a model for the future in Shakespearian studies. Its creator, Peter Donaldson, Professor of Literature, envisions this computer-based project as a comprehensive, international archive that networks as many libraries and resources as possible. Textual, visual, and moving image files would all be linked.
World Wide Web
Authors: Fitzgerald Tim
Published: January 2007

With the term information superhighway being bandied about as the latest political buzzword and the newest computing cliche, people who search for information electronically have to wonder if the global network of networks known as the Internet is the realization of this newest technological legend or just a precursor better relegated to terminology like the
information bike path.
First-time users of Internet services like e-mail, Archie, Anonymous FTP and Gopher may marvel at the unprecedented access to global information but, in the end, may wonder, is this what all the fuss has been about? The true definition of this modern cultural icon may never become clear. Indeed, it may always remain just a broken pipe dream of an eager Madison Avenue publicist.
Usenet News for electronic information sharing
Authors: Leavell Glenn
Published: January 2007

UCNS is pleased to announce the availability of a new Usenet News server on campus, news.uga.edu. Usenet News is an electronic public forum in which you can participate in discussions and exchange information with millions of people around the world. This article will explain what Usenet News is, how it works, and how you can take advantage of this tremendous resource.
Scoring films on Cue and online
Authors: Zivkovic Brane , Frederickson David
Published: January 2007

Location:
Downtown Manhattan. Action: The composer is working on a film score in her home studio. (
Video and audio source:
Videotape of edited film, running at 30 frames per second.)
Computer security
Authors: Walsh R. Brian
Published: January 2007

The computing system at any University Computer Center is intended to be used in a manner that is supportive of its educational purposes and conducive to its educational environment. Constituents of the University are able to apply for the right to use the computing facilities and when that right is granted (e.g., when an account number is issued) it is granted with the understanding that the person's use of the computing system will correspond to the purpose(s) stated by the user in making their request.
Models and simulation in Finland
Authors: Highland Harold Joseph
Published: January 2007

During the 1970-1971 academic year Dr. Highland was Fulbright Professor of Computer Science and Operations Research at the Helsinki University of Technology at Otaniemi, Finland. In addition to lectures on modeling and simulation at this and other universities in Finland, Dr. Highland conducted seminars and lectured at both the University of Coimbra and University of Lisbon in Portugal; the University of Belgrade in Yugoslavia and the City University of London in England.
Issues surrounding intellectual property management in a computing center
Authors: Costello D. F.
Published: January 2007

Adapted from a talk given at the SIGUCC Management Symposium in St. Louis on March 30, 1979. Research for this paper was performed by the author as a collaborating researcher with the 'Ethical and Economic Issues Project' at the University of Southern California. The project is sponsored by the Carnegie Corporation in New York, but the ideas expressed in this paper are the author's.