ppxscal/embedding_network huggingface dataset:
Class-based grouping in perspective images
Authors: A. Zisserman, J. Mundy, D. Forsyth, J. Liu, N. Pillow, C. Rothwell, S. Utcke
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

In any object recognition system a major and primary task is to associate those image features, within an image of a complex scene, that arise from an individual object. The key idea here is that a geometric class defined in 3D induces relationships in the image which must hold between points on the image outline (the perspective projection of the object). The resulting image constraints enable both identification and grouping of image features belonging to objects of that class. The classes include surfaces of revolution, canal surfaces (pipes) and polyhedra. Recognition proceeds by first recognising an object as belonging to one of the classes (for example a surface of revolution) and subsequently identifying the object (for example as a particular vase). This differs from conventional object recognition systems where recognition is generally targetted at particular objects. These classes also support the computation of 3D invariant descriptions including symmetry axes, canonical coordinate frames and projective signatures. The constraints and grouping methods are viewpoint invariant, and proceed with no information on object pose. We demonstrate the effectiveness of this class-based grouping on real, cluttered scenes using grouping algorithms developed for rotationally symmetric surfaces, canal-surfaces and polyhedra.
Inventory and distribution models
Authors: David R. Anderson, Brian D. Sellers, Lynn E. Bussey, M. Palmer Terrell, Donald A. Heimburger, Kailash M. Bafna, Roland Young
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Inventory control is one of the &ldquo;classical&rdquo; problems areas for quantitative analysis. Inventory and distribution systems have been subjected to analysis using simulation since the advent of medium size computers. In this session the emphasis is on production inventories and their interaction with production efficiency and warehouse operations.
REPLICAS - a new continuous system simulation language
Authors: Peter McLaughlin
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

A new continuous system simulation language - REPLICAS, The Rational, Efficient Programming Language for the Implementation of Computerized Analysis and Simulation - is proposed for general engineering, scientific and econometric applications. The use of Gear's integration method coupled with a non-linear quasi-Newton solver relying on Broyden's method results in a reliable and efficient simulation system invoked by a language which requires only that the user define a mathematical model in terms of first-order, ordinary differential equations. Extensions to Gear's method accommodate discontinuities, extreme stiffness and steady-state within a single evaluation procedure.
How discreet is the discrete log?
Authors: Douglas L. Long, Avi Wigderson
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Blum and Micali [4] showed how to hide one bit using the discrete logarithm function. In this paper we show how to hide c&bull;loglog p bits for any constant c, where p is the modulus.
A language and system for symbolic algebra on a digital computer
Authors: W. S. Brown
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

This paper describes the ALPAK system and the ALTRAN language for symbolic algebra on a digital computer. The ALPAK system is specifically designed for the efficient handling of large scale algebraic computations, and has been applied to a wide variety of practical problems. The ALTRAN language is a dialect of FORTRAN for describing algebraic manipulations. Although ALTRAN is still being developed, a useful subset has been implemented. A programming system called OEDIPUS, which serves as a foundation for the second and newest version of ALPAK, is briefly described. The past investment in, present availability of, and future plans for ALPAK and ALTRAN are outlined.
CRISP: An interactive student registration system
Authors: B. A. Galler, R. Wagman, J. Bravatto, G. Lift, G. Kern, V. Berstis, E. Munn
Venue: Proceedings of the ACM annual conference (1973)

A class project, even for an advanced class in systems programming, is usually simplified to make it possible to achieve success. A conflicting goal is to produce a realistic enough system to warrant production use, so as to provide the class with sufficient motivation and the right kind of system experience. The problem is compounded when the resulting system is to be a component in an on-going information-processing system and must be compatible with it - with existing documents and procedures, with unstated assumptions about the data and about the current algorithms used to process the data, and with the social and institutional traditions that surround it. This paper reports on one successful class project of this kind.
Practical experiences from signal probability simulation of digital designs
Authors: Bengt Magnhagen
Venue: Proceedings of the 14th Design Automation Conference (1977)

Propagated transitions, represented by probability functions, are very useful for digital design verification of race conditions. The existing simulation system DIGSIM already has features implemented to handle these probabilities. This paper gives some application examples to illustrate the technique. The system has been transfered from UNIVAC 1108 to a DEC-10, and that experience is described. Four years' use of the algorithms has shown good agreement between theory and practice.
Integrated program measurement and documentation tools
Authors: Anne Schroeder
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper describes an attempt to integrate the collection and the efficient utilisation of measurements in the development and the use of programs. The work presented consists in three parts: - the design of both static and dynamic measurement tools, - examples of data processing on measurements collected on a sample of Pascal programs, - the design of a quantitative documentation of a program, which is automatically built as measurements are collected. The first and third steps have been developed inside an existing programming environment, Mentor, and we shall discuss the advantages we found in integrating the tools in such an environment.
A design model for teleprocessing systems
Authors: R. C. Raymond, D. J. McKee
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

The model, in the form of a computer program and associated data bases, is capable of determining the cost of a teleprocessing system designed to meet specified load requirements. In the current version, the system may serve up to 120 cities, of which to 20 may be outside of the continental United States. Central switching and data processing may be provided in up to 20 computing centers located at arbitrarily chosen cities of the system. The model terminal equipment to be deployed in each city central-station equipment for each computing center. Data communication is provided optionally by means of leased circuits configured in either ring or tree networks, direct-distance-dialing services, WATS-like services, o r packet-switched services. The model is suitable for exploration of system costs design features as functions of deployment, center locations, types and amounts of work processed common-carrier tariffs, redundancy requirements, and other variables.
The purpose of concurrent Pascal
Authors: Per Brinch Hansen
Venue: Proceedings of the international conference on Reliable software (1975)

This is the first of three papers that describe a new programming language for structured programming of computer operating systems [1, 2, 3]. It extends the sequential programming language Pascal with concurrent programming tools called processes and monitors. These concepts are explained informally by means of pictures that illustrate a hierarchical design of a simple spooling system. The main contribution of Concurrent Pascal is to extend the monitor concept with an explicit hierarchy of access rights to shared data structures that can be stated in the program text and checked by a compiler. [1]Brinch Hansen, P. The purpose of Concurrent Pascal. Information Science, California Institute of Technology, November 1974. [2]Brinch Hansen, P. The use of Concurrent Pascal. Information Science, California Institute of Technology, November 1974. [3]Brinch Hansen, P. Job control in Concurrent Pascal. Information Science, California Institute of Technology. November 1974.
Continuous System Simulation Languages (CSSL's)
Authors: Ralph C. Huntsinger
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This tutorial introduces CSSL's (Continuous System Simulation Languages) by using examples from three of the popular commercial languages used in North America at the present time. The languages are CSSL-IV (1), DSL/VS (2) and ISIM (3). Continuous System Simulation Languages are user-oriented software systems. CSSL's are designed to assist engineers and scientists to mathematically model, analyze, and evaluate the dynamic behavior of physical phenomena. By providing a set of tools for computer-aided-analysis, they make it easy for the user to get his simulation on the computer quickly and to easily conduct experiments, collect data and present that data in useful form with minimal knowledge of the computer system itself.
A Full English Sentence Database for Off-Line Handwriting Recognition
Authors: U.-V. Marti, H. Bunke
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper we present a new database for off-line handwriting recognition, together with a few preprocessing and text segmentation procedures. The database is based on the Lancaster-Oslo/Bergen(LOB) corpus. This corpus is a collection of texts that were used to generate forms, which subsequently were filled out by persons with their handwriting. Up to now (December 1998) the database includes 556 forms produced by approximately 250 different writers. The database consists of full English sentences. It can serve as a basis for a variety of handwriting recognition tasks. The main focus, however, is on recognition techniques that use linguistic knowledge beyond the lexicon level. This knowledge can be automatically derived from the corpus or it can be supplied from external sources.
Using INS to model systems with active resources
Authors: Stephen D. Roberts, Mark Fox, James Schier
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Procedural modeling languages utilize transactions as their only active entity. These transactions can flow through a network simulating the logical and physical properties of a real world system. It is natural for the transactions to represent units of demand using a set of resources. However resources, especially within social systems, are not passive and play an active role in choosing transactions to service. To model those environments in a transaction-oriented language requires the simultaneous treatment of resources and demands as transactions and compels the modeler to explicitly consider their interface and synchronization. In INS the modeling of combined active transactions-active resources is facilitated by the introduction of a second active entity, namely resources whose role is different than but easily coordinated with transactions. The INS resource allocation processor permits the high level manipulation of these dual entities allowing the modeler to represent very complex systems easily.
Automatic program analysis and evaluation
Authors: Marvin V. Zelkowitz
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

There is currently considerable interest in the computing community in the evaluation of computer programming. However, in order to objectively evaluate such concepts, it is necessary to undertake a thorough evaluation of the programming process itself. Most previous studies of this type have analyzed, by hand usually, a few instances of programs. This has led to some general conjectures; however, the amount of information that must be processed precludes any large scale analysis. In order to avoid this problem, an automatic data collection facility has been implemented as part of a PL/1 compiler at the University of Maryland. This system automatically collects information on each program that has been compiled - at almost no additional cost to the user of the compiler. This paper will describe the system and will evaluate some of the characteristics of some of the 25,000 programs that have been run since July, 1975.
PLATO - PLA Translator/Optimizer - &ldquo;a ROM is a PLA in no uncertain terms.&rdquo;
Authors: Will Sherwood
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

PLATO (Programmed Logic Array Translator/Optimizer) is an extremely simple system that takes mnemonic definitions and equations, assembles and optimizes them, and produces formatted output files for various uses. It was designed with human engineering goals in mind to permit painless usage and to ease the burden on the designer by relieving him of clerical tasks. PLATO was written in APL-10 because of its powerful matrix and character manipulation operators, and quick development time. Even though APL is an interpretive language (i.e., it must parse and look up symbol table references for every statement executed), the overall compute time remains low&mdash;for a final set of 48 product terms, assembly time is less than 20 seconds and execution time for 3 optimization passes is 90 seconds. This is quite acceptable for an interactive design environment, where a bug that is found in simulations can be corrected in the equations, and simulations can be resumed before the end of a coffee break (a standard unit of time in interactive computing).
A successful automated IC design system
Authors: William V. Herrick, James R. Sims
Venue: Proceedings of the 13th Design Automation Conference (1976)

The operation of a design automation system for custom integrated circuits is described. The procedures are based upon standard cell libraries and a sophisticated automatic placement and routing program. The economic viability of automated layout techniques has been demonstrated by circuit layout, design verification and system integration of twenty five custom PMOS/LSI devices in 1975.
A high level multi-lingual multiprocessor KMP/II
Authors: Mario Tokoro, Kiichiro Tamaru, Masaaki Mizuno, Masao Hori
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

KMP/II is a multiprocessor system designed to work as a multi-lingual high level language computer in a distributed processing environment. The multiprocessor system is composed of up to 15 dynamically microprogrammable LSI processors. One processor executes OS functions. Another processor executes I/O functions. All the rest execute user programs as high level language job processors, emulating individual high level language. Allocation of high level language emulators to processors changes dynamically depending upon the load of user jobs in terms of the languages. Behaviour of processes of user jobs written in high level languages and system jobs are measured through monitoring typical minicomputers. Hardware characteristics of the system are also collected by measuring the prototype system. Simulations are done by a computer using the data obtained through the above measurements to determine the process scheduling and processor assignment algorithm and to prove the effectiveness of the design concept.
Microcomputers in medical diagnosis
Authors: Paul R. Fisher, David J. Kurlander
Venue: Proceedings of the ACM 1980 annual conference (1980)

A program for performing differential diagnosis on a microcomputer has been developed, utilizing a pattern recognition algorithm. The present configuration allows for input of 15 symptoms of 3 values (present, absent, or unknown), and compares the patient's symptom profile with 50 patterns which point to as many as 10 disease designations. The investigator may stipulate either a rigorous or permissive pattern matching, thus obtaining either a selective or exhaustive ranking of possible diagnoses. The program can record patient data, recall data given any one parameter, and can construct tables of incidence. This inexpensive system was designed for an office or community level practice, where the pattern arrays will be trained for its specific patient populations. Presently, data from the Georgetown University Student Health Service is being introduced as the program's first clinical trial.
Are colleges meeting industry needs in business data processing?
Authors: Morris Pollack
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

The purpose of this study was to analyze the educational requirements of the principal employers who actively recruit college educated programmers and systems analysts and the college course offerings in business and data processing to determine if the requirements of industry differ from the education being offered in the institutions of higher education.
Aspects of design, test and validation of the software for a computerized reactor protection system
Authors: U. Voges
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

In safety-oriented applications, the software has to fulfil certain stringent reliability requirements. In order to determine the reliability of the software, a variety of different methods can be used. The methods used for the reliability proof of a computerized reactor protection system are discussed in this paper. In addition to the constructive approach with structured programming, defensive programming and other guidelines also concerning the operating system, the analytical approach is taken. This includes the use of an automatic test system for statical and dynamical analysis of the software and automatic test data generation. Finally, a systemtest is conducted, where test data are produced according to the process and the results are compared with the results of a simulation model.
Strategy for shape-based image analysis
Authors: J. M. Reinhardt, W. E. Higgins
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Traditional image segmentation methods typically divide an image into separate regions based on the grayscale characteristics of the image. For most real-world image-segmentation problems, however, these methods tend to produce imperfectly shaped regions that require some degree of shape modification to yield acceptable results. Choosing an appropriate sequence of operators and associated operator parameters, though, is a tedious procedure and requires much image-processing expertise. We describe a strategy for easily selecting shape-based operations. Shape information on regions in an image is provided by the user in the form of easily-specified cues. The user is not required to be an image-processing expert to apply the strategy-he need only be able to specify the desired shape properties of the regions in the image.
Threshold functions and bounded deptii monotone circuits
Authors: Ravi B. Boppana
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We prove an exponential lower bound for the majority function on constant depth monotone circuits, solving an open problem of A. Yao's.. In particular, we prove that computing majority on depth d monotone circuits requires exp&Ohgr;(n1/(d-1)) size. Using this result we also get exponential lower bounds for other problems, such as connectivity and cliques.
Experience with application of modern software management controls
Authors: Donald L. Paster
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper presents the experience of the Software Development Laboratory of Raytheon Company, Submarine Signal Division, in applying modern software management control techniques to the development of software for real-time embedded computer systems. The paper initially describes the characteristics of the software projects during the period 1969-1979, and the ultimate use of the systems. The software is developed for embedded computers of many types and for systems requiring from one to eleven racks of electronics, and it is programmed in many languages. The systems are installed in submarines, surface ships, aircraft, shore-based facilities and weapons. The paper then summarizes development methodologies and follows with a detailed description of the software management and control techniques, which include: manpower forecasting; tailored status reports for financial, module, and cost-milestone-schedule; cost estimating; support librarian and configuration management; policies and procedures; training; and staffing and organization.
Semantic inference from fuzzy premises
Authors: L. A. Zadeh
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Much of human reasoning is based on inference processes which are approximate rather than precise in nature. Generally, such processes fall outside the scope of existing logical systems &mdash; systems in which the dependence of the truth-values of the consequents on those of the premises admits of precise characterization.
Tapping into tacit programming knowledge
Authors: Elliot Soloway, Kate Ehrlich, Jeffrey Bonar
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The Cognition and Programming Group at Yale University is engaged in two complementary efforts: 1. exploring the programming process empirically, paying special attention to the knowledge and strategies which expert and non-experts employ, and 2. building computer-based environments which aid novices learning to program. In this extended abstract we will focus on the empirical strand of our research program; in particular, we will describe an experimental technique we have just begun to use to more carefully study what it is that expert and novice programmers do&mdash;and don't&mdash;know. In [19, 20, 22, 18, 7] we describe additional empirical studies, while [21] describes MENO-II, our intelligent programming tutor for Pascal.
The optimal fixedpoint of recursive programs
Authors: Zohar Manna, Adi Shamir
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

In this paper a new fixedpoint approach towards the semantics of recursive programs is presented. The fixedpoint defined by a recursive program under this semantics contains, in some sense, the maximal amount of &ldquo;interesting&rdquo; information which can be extracted from the program. This optimal fixedpoint (which always uniquely exists) may be strictly more defined than the program's least fixedpoint. We consider both the theoretical and the computational aspects of the approach, as well as some techniques for proving properties of the optimal fixedpoint of a given recursive program.
How to color in a coloring book
Authors: Henry Lieberman
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Children's coloring books contain line drawings which a child can fill in with a crayon to produce colored pictures. Two dimensional colored areas can be produced on a raster display by an analogous method. After drawing a closed curve with line drawing commands, the graphics system can fill the area bordered by the curve. This paper presents an algorithm for filling in areas of any size or shape. The area may be filled with any color, texture, or &ldquo;wallpaper&rdquo; pattern. The algorithm is simple, flexible and efficient, optimized to take advantage of the the memory organization of most current raster graphics systems.