ppxscal/embedding_network huggingface dataset:
Algorithms for nonlinear problems which use discrete approximations to derivatives
Authors: J. E. Dennis,  Jr.
Venue: Proceedings of the 1971 26th annual conference (1971)

The most desirable algorithms for nonlinear programming problems call for obtaining the gradient of the objective and the Jacobian of the constraint function. The analytic form is often impossible and almost always impractical to obtain. The usual expedient is to use difference quotients to approximate the partial derivatives. This paper is concerned with the theoretical and practical ramifications of such modifications to basic algorithms. Among the methods surveyed are steepest descent, Stewart's modification of the Davidon-Fletcher-Powell method, the Levenberg-Marquardt method, Newton's method, and the nonlinear reduced gradient method. Numerical results are included in the presentation.
A special purpose LSI processor using the DDA algorithm for image transformation
Authors: Katsura Kawakami, Shigeo Shimazaki
Venue: ACM SIGARCH Computer Architecture News (1984)

A new special purpose processor, named MN8614, has been developed for the high speed execution of binary image transformations. The processor carrys out the processing based on a new extension of the DDA algorithm to reduce the number of multiplications required for image processing. In addition, a machine instruction set has been developed which makes optimal use of the new method. The processor is fabricated on a single LSI chip with 16-bit data paths. Although the basic chip design is the same as that used in the construction of a general purpose microprocessor, the processing speed of MN8614 proves to be more than 30 times faster.
Observations on the development of an operating system
Authors: Hugh C. Lauer
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

The development of Pilot, an operating system for a personal computer, is reviewed, including a brief history and some of the problems and lessons encountered during this development. As part of understanding how Pilot and other operating systems come about, an hypothesis is presented that systems can be classified into five kinds according to the style and direction of their development, independent of their structure. A further hypothesis is presented that systems such as Pilot, and many others in widespread use, take about five to seven years to reach maturity, independent of the quality and quantity of the talent applied to their development. The pressures, constraints, and problems of producing Pilot are discussed in the context of these hypotheses.
Design and verification of communication procedures: A bottom-up approach
Authors: P. Azema, J. M. Ayache, B. Berthomieu
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

The verification of functional specifications is performed by means of a formal model, based upon Petri nets. A so-called "reduction" operation is introduced to handle the concept of abstraction. A bottom-up approach is developped in the case of communication between two processors. The definition of software modules is emphasized.
An interactive graphical logic design simulation system
Authors: W. B. Barker
Venue: Proceedings of the 8th Design Automation Workshop (1971)

This paper describes a computer system to assist the logic hardware designer. It is interactive and graphical; it has been human engineered to be convenient for the designer. An elementary system has been implemented; plans for future expansions are described.
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition&mdash;(Extended Abstract)
Authors: Sheila A. Greibach
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Every deterministic context-free language can be accepted by a deterministic finite delay pda with jumps. Increasing the number of types or occurrences of jumps increases the family of languages accepted with finite delay. Hence the family of deterministic context-free language is a principal AFDL; there is a context-free language Lo such that every context-free language is an inverse gsm image of Lo or Lo - {e}. A similar result holds for quasirealtime Turing machine languages. Several languages are given such that deterministic and nondeterministic polynomial time acceptance are equivalent if and only if any one of them is deterministic polynomial time acceptable.
The best of the best and the worst of the worst
Authors: David M. Clayton, Irene Svagan
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

As User Services groups and Computer Centers evolve, suggestions are made and procedures and policies developed. A number of these are of a necessary nature, mandated by existing or developing conditions, and neither fabulous nor infamous. But from time to time, an idea or policy comes along which distinguishes itself from the commonplace. These ideas stand out. Toward this end, we sent questionnaires to a number of institutions, asking them to share what they considered to be the BEST of their best ideas, and the WORST of their worst ideas. We had intended these suggestions to help representatives of newly organized User Services groups, but as we reviewed the submissions, it seemed that they had a more general appeal. They are presented here, for the most part unedited and uneditorialized. Some are system specific but most ideas can be abstracted to other systems.
An inter-organisational comparison of programming productivity
Authors: D. R. Jeffery, M. J. Lawrence
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The factors which influence program size and program development time have been investigated across three dissimilar organisations. Data on a total of 93 COBOL programs has been collected and analysed. Eighteen variables covering the characteristics of the program, programmer and programming environment were recorded. Program size and program development time were found to have a strong program characteristic and organisation dependency. Programmer characteristics did not appear to play a role in influencing program size or program development time. The best determinant of program development time was found to be procedure division lines of code, which gave a simple regression R2 in excess of .79 for the two organisations using well formulated programming standards. Productivity measures based on lines of code per hour are shown to be misleading in inter-organisational comparisons.
A probabilistic analysis of multidimensional bin packing problems
Authors: Richard M. Karp, Michael Luby, A. Marchetti-Spaccamela
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

This paper gives probabilistic analyses of two kinds of multidimensional bin packing problems: vector packing and rectangle packing. In the vector packing problem each of the d dimensions can be interpreted as a resource. A given object i consumes aij units of the jth resource, and the objects packed in any given bin may not collectively consume more than one unit of any resource. Subject to this constraint, the objects are to be packed into a minimum number of bins. The rectangle packing problem is more geometric in character. The ith object is a d-dimensional box whose jth side is of length aij, and the goal is to pack the objects into a minimum number of cubical boxes of side 1. We study these problems on the assumption that the aij are drawn independently from the uniform distribution over [0,1]. We study a vector packing heuristic called VPACK that tries to place two objects in each bin and a rectangle packing heuristic called RPACK that tries to pack one object into each of the 2d corners of each bin. We show that each of these heuristics tends to produce packings in which very little of the capacity of the bins is wasted. In the case of rectangle packing, we show that the results can be extended to a wide class of distributions of the piece sizes.
Application of cognitive dissonance in the teaching of FORTRAN IV in an unstructured setting
Authors: James F. Kearney, John Nodine
Venue: Proceedings of the ACM annual conference (1973)

An experiment in the teaching of FORTRAN IV using cognitive dissonance in an unstructured setting was conducted at Montgomery College. &ldquo;Classical&rdquo; instruction, in the form of lecture sessions proceeding in an orderly manner from simple to more difficult algorithms, was compared to the &ldquo;experimental&rdquo; method, in which students were given sample programs and ordered to create solutions to assignments using the sample programs as models, with no formal lectures in FORTRAN. The students in the experimental group thus became very familiar with their course materials, and their need for instructional assistance fell off rapidly. Statistical results showed that the groups acquired equal grasp of the fundamentals of FORTRAN, but the experimental group indicated a greater depth in the subject. We have shown that the teacher can be more helpful to his students by creating challenging and instructive assignments which encourage them to expand their knowledge of the time-saving features of FORTRAN language, rather than by, in effect, holding them back with a structured technique.
Object indexing using an iconic sparse distributed memory
Authors: R. P. N. Rao, D. H. Ballard
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A general-purpose object indexing technique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces to achieve high-precision recognition. An object is represented by a set of high-dimensional iconic feature vectors comprised of the responses of derivatives of Gaussian filters at a range of orientations and scales. Since these filters can be shown to form the eigenvectors of arbitrary images containing both natural and man-made structures, they are well-suited for indexing in disparate domains. The indexing algorithm uses an active vision system in conjunction with a modified form of Kanerva's (1988, 1993) sparse distributed memory which facilitates interpolation between views and provides a convenient platform for learning the association between an object's appearance and its identity. The robustness of the indexing method was experimentally confirmed by subjecting the method to a range of viewing conditions and the accuracy was verified using a well-known model database containing a number of complex 3D objects under varying pose.
A perspective on software development
Authors: Bill Hetzel
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This paper retraces an evolution of thought on the key problems in producing software. The author's perspective is traced through an early emphasis on development tools and methodology to an emphasis on specifications and requirements to a broader emphasis on overall manageability. The evolving thought process is projected ahead and illustrated by some current efforts and activities. The paper concludes with a discussion of the approaches to further enhancing the development process and the author's view on which areas should be given the main attention.
There's no such thing as a systems analyst
Authors: Edrice Addleman
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

Prior SIGPR conferences have focused on training, the characteristics of workers in the field, and the social impact of computers and computer people. These issues are important, of course. But the very title of this conference, &ldquo;The Systems Analyst in Perspective,&rdquo; implies that something more is needed now. I suggest to you that there is no such thing as a systems analyst. Systems analysts do not exist. It is impossible. When I recently tried to explain to a vice president what a programmer/analyst does, he was particularly interested in the &ldquo;analyst&rdquo; part. After my feeble explanation, he said, &ldquo;Oh, well, then, I could call myself a vice-president/analyst.&rdquo; And of course he is right. Anyone who does a good job could be called an analyst, because the main characteristic of a good analyst of any kind is that he looks at what he is doing in the framework of the entire organization. (Isn't it?) I decided to begin with some definitions, so I looked up the two words &ldquo;system&rdquo; and &ldquo;analyst&rdquo; in my unabridged dictionary to give me a starting point.
Engines build process abstractions
Authors: Christopher T. Haynes, Daniel P. Friedman
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

Engines are a new programming language abstraction for timed preemption. In conjunction with first class continuations, engines allow the language to be extended with a time-sharing implementation of process abstraction facilities. To illustrate engine programming techniques, we implement a round-robin process scheduler. The importance of simple but powerful primitives such as engines is discussed.
A simulation of operations of a quick-service steak house restaurant
Authors: Haluk Bekiroglu, Turan Gonen
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Operations of a steak-house restaurant in St. Ann, Missouri is simulated using GPSS(General Purpose Simulation System). Objective is to eliminate the long waiting lines. Two models are developed to simulate the actual situation and the proposed change to the restaurant. It is found that the change in facilities greatly improved the efficiency of the restaurant and increased profits by eliminating the problem of loss of customers over waiting time.
Micros vs. mainframes (Panel)
Venue: Proceedings of the 16th conference on Winter simulation (1984)

With the advent of powerful, inexpensive microcomputers, the possibility of performing simulations on equipment other than mainframes has become a reality. Is this reality at this point more than just a matter of demonstration of small models or an educational tool? Have the mainframe and supermini monoliths lost their place in the simulation community to micros just as so many business applications have been downloaded to small systems? Or have we seen equipment and software so far which is not yet capable of taking on the simulation tasks have traditionally been done by large-scale systems?
A new approach to object recognition in textured images
Authors: J. You, H. A. Cohen, E. Pissaloux
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

This paper describes an approach to object recognition in textured images. The method is based on image matching via the distance transform. The proposed matching scheme is an extension and combination of the conventional methods used in image processing. Interesting points are detected to replace edge pixels as image feature pixels in the distance transform for the matching measurement. A mask based stochastic method is introduced to extract texture features. The detection of interesting points for matching is then performed on the texture feature image, named the texture energy image. A dynamic thresholding procedure is further applied to guide the matching. Our experimental results demonstrate that the combination of texture feature extraction and interesting points detection provides a better solution to the search for the best matching between two textured images. In addition, such an algorithm is simple to implement and quite insensitive to noise and other disturbances.
Array processing extensions to FORTRAN
Authors: Richard A. Hendrickson
Venue: Proceedings of the 1979 annual conference (1979)

For well over a year, X3J3, the FORTRAN Standardization Subcommittee of the American National Standards Institute has been considering potential changes to FORTRAN-77. A subgroup with about six members has been meeting and considering additions to FORTRAN for array processing. This paper summarizes the state of their deliberations in August of 1979; it is a partial list of features being discussed and is not the complete and final list of features that will appear in FORTRAN-?. This paper covers the major functional topics; the syntax used in the examples is intended to be illustrative only. The subgroup has not generally discussed exact syntax forms at the present time. Array processing is certainly not new; it is a cornerstone of APL. IBM has for several years had an experimental language, VECTRAN, a FORTRAN based vector and array processing language. The Department of Energy is considering a set of array processing extensions (among many others) to FORTRAN-77. Several manufacturers have added array processing extensions to their versions of FORTRAN, generally to take advantage of unique features of the new vector type supercomputers.
Programmed word length computer
Authors: A. L. Lucke
Venue: Proceedings of the 1967 22nd national conference (1967)

The concept of a programmable word length computer has evolved through an attempt to minimize wasted storage in any fixed word length computer. Whether the computer contains six bits per word or 72 bits per word, storage is inevitably wasted when it is necessary to use a full word for a simple on-off switch, or to have 12-digit capacity used for 2-digit significance. Programmers have long recognized this. Thus, word packing and unpacking soon becomes a part of every programmer's repertoire. The first section of this treatise is primarily concerned with data storage, instruction format, storage and register organization, arithmetic operations, input/output processes, and some special considerations. The second section is concerned with software support, and operational recommendations.
Documentation retrieval in a University Computer Center environment
Authors: Amanda D. Poor, Paul S. Licker
Venue: Proceedings of the 1969 24th national conference (1969)

The User Service Documentation Traffic Organizer (USDOCTOR) was developed to assist users of the University of Pennsylvania Computer Center (UPCC) to obtain documentation quickly and in a standard format. The traditional methods of distribution&mdash;stacking manuals and write-ups and handing them out on request&mdash;became less effective as the community of users grew to include persons at remote sites as much as 20 miles away and the volume of paper began to tax the available storage space and copying machines. With USDOCTOR, the user may request documents, memos, and abstracts of either by running a high priority job in a multiprogrammed batch processing environment. His output includes the requested information as well as reference to manuals and personnel for further information. The system provides facilities for updating and maintenance as well as retrieval.
Natural Language Processing in the undergraduate curriculum
Authors: Mary Dee Harris Fosberg
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The course, Natural Language Processing, is an upper-level course for computer science majors. The pre-requisites include Survey of Programming Languages and Data Structures, so most students have at least 21 hours of Computer Science. Because the course is only offered every two years, many students will have taken more than 21 hours. The course is organized into four primary sections: text processing, sentence generation, sentence analysis, and case studies.
User documentation for Design Automation at TI
Authors: Diana Mae Sims, James S. Crabbe
Venue: Proceedings of the 18th Design Automation Conference (1981)

The use of documentation is design automation is extensive. The &ldquoDADGUIDE&rdquo; Documentation System at Texas Instruments' Design Automation Department accomplishes many documentation tasks by means of a set of procedures, local and central computers, word processing programs with macro capabilities, and physical text formatters. The documentation output is resident on a data set at the central computing facility. When users request documents through submission of batch jobs, they execute a document printing program which outputs user manuals at any terminal in line printer, microfiche, or LASER copy. Control over the style and content of such user documentation is achieved by restrictions on characters and symbols, macro commands which force numbered divisions and subdivisions, procedures for revision of documents, check programs verifying output of the DADGUIDE processors, and requirements for approval of the documentation. In these ways, the DADGUIDE system is automating the management of user documentation and helping to extend the use of computer-aided tools company-wide.
Checking for spelling and typographical errors in computer-based text
Authors: Thomas N. Turba
Venue: ACM SIGPLAN Notices (1981)

This paper addresses the problems and techniques of checking for spelling and typographical errors in computer-based text. To some extent, the paper is a combination of a report of work done by the author and a survey of other work which, although not all used by the author, is of equal value and interest. Some of the material presented is related to other aspects of text processing such as data compaction and the efficient searching of very large dictionaries.
The training of teachers in the use of computers in the classroom
Authors: Pamela R. E. McGinley
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

The ever increasing use of computers for school administrative and instructional programs poses a continuing challenge for educators. School personnel and students need an intelligent understanding of the computer and its advantages in order to best utilize its potential. Recognition of this need has brought about various agencies and commercial groups offering courses that give the administrators and teachers this knowledge. The main differences of the approach presented here vs. the usual university course is that it might be best taught by a team of outside consultants with expertise. Besides their specialized training, it often works out to be the least costly in the long run.
A two level microprogram simulator
Authors: R. Petzold, L. Richter, H. P. Röhrs
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper reports our current progress at the Department of Informatik of the University at Dortmund in investigating problems of dynamic microprogramming. In order to get a suitable tool quickly we decided to develop a corresponding simulator. The design criteria of a simulator for a two level QM-1-like microstructure are briefly described. Of primary interest are the methods for the serialization of time parallel events. Two different procedures are described. By means of the features of the used simulation language APL SV it was possible to achieve as well a flexible and easily extentable microprogramming structure as a convenient accessible model for problems of dynamic microprogramming at all. An example of a microprogrammed complete priority interrupt handling feature is appended.
Information systems approach to discrete event simulation
Authors: Michael L. Schneider
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

When discrete-event simulations require large amounts of information for the simulation or its analysis, existing techniques are difficult. This paper describes a technique based upon a layering of interfaces from the classes of servers, through the queues to the items. Queue restructuring is easier and descriptive languages become possible.