ppxscal/embedding_network huggingface dataset:
An efficient signature scheme based on quadratic equations
Authors: H. Ong, C. P. Schnorr, A. Shamir
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Electronic messages, documents and checks must be authenticated by digital signatures which are not forgeable even by their recipients. The RSA system can generate and verify such signatures, but each message requires hundreds of high precision modular multiplications which can be implemented efficiently only on special purpose hardware. In this paper we propose a new signature scheme which can be easily implemented in software on microprocessors: signature generation requires one modular multiplication and one modular division, signature verification requires three modular multiplications, and the key size is comparable to that of the RSA system. The new scheme is based on the quadratic equation m &equil; s21 + ks22 (mod n), where m is the message, s1 and s2 are the signature, and k and n are the publicly known key. While we cannot prove that the security of the scheme is equivalent to factoring, all the known methods for solving this quadratic equation for arbitrary k require the extraction of square roots modulo n or the solution of similar problems which are at least as hard as factoring. A novel property of the new scheme is that legitimate users can choose k in such a way that they can sign messages even without knowing the factorization of n, and thus everyone can use the same modulus if no one knows its factorization.
Bringing in the expert: Private consultant penetration into local governments
Authors: Christopher J. Gintz, William H. Hiller
Venue: Proceedings of the sixteenth annual SIGCPR conference (1979)

Few small, local governmental organizations have the expertise or resources to perform the complex tasks necessary for the solution of many problems facing city and county government data processing managers today. For many reasons, such as disparity in wages, narrow chances for advancement, or boredom associated with continual routine tasks, local governments have not been able to consistently attract top computer professionals. When the inevitable technical challenge and the limited personnel resources cross, local government data processing managers are confronted with limited options. They may - Delegate the responsibility for the development of complex systems to subordinates and let them try to figure out a way to do the job. - Allocate the best resources available at the expense of other needed tasks. - Recruit special employees to work on these systems alienating employees who have been on the job for some time. - Request that a committee study the situation. - Hire a private consultant to study the situation, develop a plan of attack, and execute it. Although other options are open, these represent some common routes that local government data processing managers have taken. Each contributes unique and peculiar managerial problems for the civil servant responsible for getting the job done. The first four courses obviously create morale, operational, and logistical problems. The last alternative method is seen to be the best course under the circumstances. We will explore the pros and cons of this argument.
A text management innovation
Authors: R. Daniel Robinson
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

BRS/SEARCH is the result of the &ldquo;office automation movement&rdquo; where storage and, more importantly, retrieval of textual information has become a major issue. All areas of business use or generate unique information, varying in style and structure depending on it's nature. A method is needed to electronically store and access this information without restricting the data to a given structure. This would allow the data to be stored in its natural format and open up numerous types of online access to information which to date has only been partially accessible, or inaccessible online.
The language problem for small systems (Panel Session)
Authors: Eric Mackie, Mark Jacobson, E. Yoes, Edward Desautels, Jacob Slonim, Michael W. Farrell, Paul S. Fisher
Venue: ACM SIGMINI Newsletter (1978)

A survey of minicomputer data base management systems was conducted to determine the current state of the industry. The results of the survey are highlighted in this paper to provide a broad view of the features of commercially available mini-data base systems. Among the topics presented are hardware requirements, software implementation, data independence, binding, integrity, privacy controls, installation base, availability, and user considerations. In addition, the relationship between the growth of the minicomputer market and mini-DBMS market in the second half of the 70's is emphasized.
A time sharing terminal adapted for use by blind programmers
Authors: Kevin Fjelsted
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

A major problem that confronts a blind person who wishes to interact with a computer is how to obtain the computer output. The two primary methods used in obtaining computer output are hard copy (or CRT), or batch input and high speed line printer output. These methods are very well suited for a person who can see well enough to read the material that is presented, but one gets into problems as soon as there is a visual impairment.
Reflections on teaching computer ethics
Authors: Robert M. Aiken
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready form was not delivered in time. Copies of the paper should be available upon request at the presentation.)
A general-purpose software measurement tool
Authors: Domenico Ferrari, Mark Liu
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

A software measurement tool designed for the users of PRIME, an interactive system being developed, is presented. The tool, called SMT, allows its user to instrument a program, modify a pre-existing instrumentation and specify how the collected data are to be reduced by typing in a few simple commands. The user can also write his own measurement routines, which specify the actions to be taken at event detection time, and submit them to the SMT; after checking their correctness, the SMT deals with them as with its built-in, standard measurement routines. The design goals of a general-purpose tool like the SMT are discussed, and the prototype version of the tool, which has been implemented, is described from the two distinct viewpoints of a user and of a measurement-tool designer. An example of the application of the prototype to a measurement problem is illustrated, the reasons why not all of the design goals have been achieved in the implementation of the prototype are reviewed, and some of the foreseeable extensions of the SMT are described.
Critical path scheduling of task systems with resource and processor constraints (Extended Abstract)
Authors: Errol L. Lloyd
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Minimum execution time scheduling of unit execution time (UET) task systems with resources has been the subject of several papers over the past few years. Because such scheduling problems are, in general, NP-hard, a variety of heuristic methods for producing schedules have been studied, among them, critical path scheduling. The strongest results to date have been for systems where there is no processor constraint. These results may be utilized for systems with a processor constraint by treating the processors as an additional resource. Unfortunately, in those cases where the number of processors is close to the number of resources, this results in an upper bound which is somewhat misleading. In this paper we investigate the performance of critical path scheduling for UET task systems with resources and a fixed number of processors. An upper bound for the worst case performance of critical path scheduling is given. This bound depends both on the number of processors and on the number of different resources. Moreover, we show that this is the best possible (asymptotic) upper bound.
Small Business&mdash;A Gold Mine For D.P. Educators
Authors: Thomas H. Athey
Venue: Proceedings of the 1978 annual conference (1978)

The California State Polytechnic University (Cal Poly) is the scene for a very innovative project in the educational field of data processing. Dr. Reed Powell, former Dean of the School of Business Administration at Cal Poly, set in motion a mechanism for combining the needs and interests of small businessmen, the university, students, and the U. S. Small Business Administration. A forum was established through the Small Business Development Center (SBDC) sponsored by the Small Business Administration. The focus of the SBDC is to help small businesses through the talent and interests of the faculty and students of the university.
Team programming in the small technical company
Authors: Thomas Plum
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

This is a report on six months' experience with a team programming approach to the internal DP projects at YOURDON inc. The major benefits we sought from the team approach were reliability of the product and continuity of development and maintenance with a peripatetic staff. Our concrete goal was that our products should be maintainable by anyone on the technical staff, even if the original programmer was off teaching courses in Australia (a not-uncommon situation). Our major focus was on the internal procedures and group dynamics of the Technical Services Department, since the organizational structure (as is often the case) was shaped by more fundamental priorities. We have so far achieved our major goals and adaptively modified our procedures in the process.
CGALA-a multi technology Gate Array Layout system
Authors: L. F. Todd, J. M. Hansen, S. V. Pantulu, J. L. Barron, D. J. Gilbert, R. J. Anderson, A. K. Biyani
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes the Computerized Gate Array Layout system (CGAL), a general purpose tool developed at Sperry Univac to provide efficient and reliable automated layouts for a variety of master slice arrays. The system contains algorithms for the construction of initial placement, placement improvement, global routing, channel routing and planar routing. The system also provides for user interaction through a design language and graphical output. A wide range of device types encompassing significantly different cell topologies and complexity are presently in production use. Some of the problems encountered are discussed and results are presented for different technologies.
Ans MUMPS in a multi-lingual operating system
Authors: Hollis V. Arban
Venue: Proceedings of the ACM 1980 annual conference (1980)

I have often wondered why the people of the world do not have one common language. Yet my international traveling experiences have shown me that I must accept a multi-lingual world and adjuster to it. Likewise, the computer industry has its reasons, deeply imbedded in the process of evolution, for being multi-lingual. As we move into the decade of the 80's, computer users are not going to find selection of software and hardware any easier than in the 70's. The trade-offs between developing your own custom software and adapting to available products may be even more complex. One thing is certain as we enter the 80's: the decrease in cost of hardware, such as micro systems and user terminals, is rapidly bringing computer power to the home and office for more routine use. As equipment becomes more commonly used, user interface software must adjust to meet the needs of: (a) less sophisticated computer users, and (b) sophisticated users who continually seek more power and versatility at their finger tips. It is into this environment that MUMPS takes its place, as though timely created for a key role as an interface language between the user and his machine.
The automation of data processing, analysis, and reporting in a large survey time-series database.
Authors: Christopher J. Gordon, Michael B. Zartman
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The May 1981 Survey will mark the 152nd Survey of Consumer Attitudes. Initiated in 1946, the purpose of the surveys is to measure changes in consumer attitudes and expectations, to understand why these changes occur, and to evaluate how they relate to consumer decisions to save, to borrow, or to make discretionary purchases under changing conditions.Each survey contains approximately 40 core questions, each of which probes a different aspect of consumer confidence. Open-ended questions are asked concerning evaluations of expectations about personal finances, employment, price changes, and the national business situation. Additional questions probe for the respondents appraisal of present market conditions for houses, and other durables. Demographic data obtained in these surveys include income, age, sex, race, education, and occupation, among others. While many questions designed to measure change in attitudes and behavior are repeated in identical form in each survey, special questionnaire supplements are added to most surveys by outside sponsors on a time share basis. Supplements to the ongoing surveys give sponsors prompt turnaround to survey materials while taking advantage of shared field expenses. When the research task is first undertaken, a maximum amount of time and effort can be spent in developing these survey materials, not in establishing and setting in motion standard sampling and interviewing procedures, questionnaire and code development for standard demographic items, and so forth.Although each survey task is unique in its time requirements, shared time participation on the ongoing Surveys of Consumer Attitudes is an effective and flexible approach for meeting many research needs. Current procedures include production of a fully documented computer data file available for analytic use within 48 hours of the close of interviewing. Within one week of the close of the survey, a report containing tabulations and charts of questions asked is sent to the sponsors.
XRAY: Instrumentation for multiple computers
Authors: Russ Blake
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

XRAY presents a global view of the performance of hardware and software components on multiple, distributed computers. The set of components chosen for measurement can be changed at any time throughout a network of systems, and can be selected to minimize data collection time and measurement space. In the course of normal activities the operating system executes firmware which increments counters for the measured components. Periodically, the counters are recorded in an ordinary file by a process in each processor. An analysis program permits browsing through components and plotting counters in real time. Analysis focuses on detecting the distributed sources of excessive activity.
Application of a water system computer model in the City of Scottsdale Arizona
Authors: Geza E. Kmetty, Meredith Flinn
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Development, implementation and application of a computer model to simulate an urban water system are discussed. Particular emphasis is placed upon actual use of the model by municipal water supply management. Applications described include system improvements, growth planning and fire protection capability assessment.
Domain knowledge and the design process
Authors: John McDermott
Venue: Proceedings of the 18th Design Automation Conference (1981)

During the past 10 or 12 years, Artificial Intelligence researchers have explored techniques for bringing large amounts of domain knowledge to bear in solving ill-structured problems. Several programs that make use of these knowledge-based techniques are currently being developed to assist in various design tasks. This paper introduces one technique&mdash;rule-based programming&mdash;and illustrates its use with two programs, R1 and XSEL, which are used by Digital Equipment Corporation in the design of computer system configurations.
Invited papers&mdash;3: Observations on time-shared systems
Authors: J. I. Schwartz
Venue: Proceedings of the 1965 20th national conference (1965)

The purposes and achievements of the early time-sharing systems are not necessarily the limit to the purposes and potentials of these kinds of systems in the future. However, the experience so far is certainly pertinent and the associated merits and problems are worth describing. The purpose of this paper, then, is to discuss a number of phenomena observed after several years interest in the field. The emphasis is on matters that concern people who are interested in the concept, understand the state of the current systems, but are somewhat uncertain about the consequences of time-sharing. A number of questions that arise frequently will be discussed, and comments will be made on the merits and deficiencies of various kinds of time-shared and non-time-shared systems.
The TV Turtle a Logo graphics system for raster displays
Authors: Henry Lieberman
Venue: ACM SIGGRAPH Computer Graphics (1976)

Until recently, most computer graphics systems have been oriented toward the display of line drawings, continually refreshing the screen from a display list of vectors. Developments such as plasma panel displays and rapidly declining memory prices have now made feasible raster graphics systems, which instead associate some memory with each point on the screen, and display points according to the contents of the memory. This paper discusses the advantages and limitations of such systems. Raster systems permit operations which are not feasible on vector displays, such as reading directly from the screen as well as writing it, and manipulating two dimensional areas as well as vectors. Conceptual differences between programming for raster and vector systems are illustrated with a description of the author's TV Turtle, a graphics system for raster scan video display terminals. This system is imbedded in Logo, a Lisp-like interactive programming language designed for use by kids, and is based on Logo's turtle geometry approach to graphics. Logo provides powerful ideas for using graphics which are easy for kids to learn, yet generalize naturally when advanced capabilities such as primitives for animation and color are added to the system.
Recognition of License Plate Images: Issues and Perspectives
Authors: M. Shridhar, J. W. V. Miller, G. Houle, Leendert Bijnagte
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Recognition of license plate images is the topic of this paper. The major issue in this problem is the accurate extraction of the license plate string from varying backgrounds. The images are also characterized by non-uniform illumination. Recognition of the string is fairly straightforward, if the extraction process has been correctly designed.The authors discuss three different approaches to extraction and their study revealed that fusion of gray scale morphology and homomorphic processing yielded accurate extraction of the string. Recognition studies with 700 images captured during day and night times indicated that an overall acceptance rate of 80% or higher with less than 1% confusion is achievable. Results obtained from a more exhaustive study that is currently in progress will be presented at the conference.
Keynote Address-Artificial Intelligence and simulation
Authors: Robert E. Shannon
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Artificial Intelligence is the latest buzzword and one of the hottest topics in the scientific community today. Some experts are proclaiming that Artificial Intelligence (AI) has already emerged as one of the most significant technologies of this century. Proponents are declaring that it will completely revolutionize management and the way we use computers. If these claims are even half true, then AI is bound to have a profound effect upon the art and science of simulation. The purpose of this paper is to provide a current overview of this rapidly evolving field, examine the potential of AI in simulation and the inevitability of it. We propose to explore the probable impact as well as forecast the directions it is likely to take.
A Markovian random field approach to information retrieval
Authors: D. Bouchaffra, J. G. Meunier
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A Markovian random field approach is proposed for automatic information retrieval in full text documents. We draw up an analogy between a flow of queries/document images connections and statistical mechanics systems. The Markovian flow process machine (MFP) models the interaction between queries and document images as a dynamical system. The MFP machine searches to fit the user's queries by changing the set of descriptors contained in the document images. There is hence a constant transformation of the informational states of the fund. For each state, a certain degradation of the system is considered. We use simulated annealing algorithm to isolate low energy states: this corresponds to the best "matching" in some sense between queries and images.
Optimization of error recovery in syntax-directed Parsing algorithms
Authors: Jacques E. LaFrance
Venue: ACM SIGPLAN Notices (1970)

The syntactic error recovery of automatically generated recognizers is considered with two related systems for automatically generating syntactic error recovery presented, one for a Floyd production language recognizer, the other for a recursive descent recognizer. The two systems have been implemented for a small language consisting of a subset of ALGOL. When compared with each other and with a commercial ALGOL compiler, the results indicate that automatically generated syntactic error recovery can exceed the performance of reasonable hand-coded error recovery.
Decoupled access/execute computer architectures
Authors: James E. Smith
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

An architecture for improving computer performance is presented and discussed. The main feature of the architecture is a high degree of decoupling between operand access and execution. This results in an implementation which has two separate instruction streams that communicate via queues. A similar architecture has been previously proposed for array processors, but in that context the software is called on to do most of the coordination and synchronization between the instruction streams. This paper emphasizes implementation features that remove this burden from the programmer. Performance comparisons with a conventional scalar architecture are given, and these show that considerable performance gains are possible. Single instruction stream versions, both physical and conceptual, are discussed with the primary goal of minimizing the differences with conventional architectures. This would allow known compilation and programming techniques to be used. Finally, the problem of deadlock in such a system is discussed, and one possible solution is given.