ppxscal/embedding_network huggingface dataset:
Multi-Feature Indexing for Music Data
Authors: Yu-lung Lo, Shiou-Jiuan Chen
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The Management of large collections of music data in a multimedia database has received much attention in the past few years. In the most of current works, the researchers extract the features, such as melodies, rhythms and chords, from the music data and develop indices that will help to retrieve the relevant music quickly and improve the query accuracy. Several reports have pointed out that these features of music can be transformed and represented in the forms of music feature strings. However, these approaches lack of scalability while increasing the music data. Recently, we proposed an approach to transform the music data into a numeric forms and developed an index structure base on R-tree for effective retrieval. This numeric index approach performed more efficiently than existing string index approaches for music database retrieval. In this paper, we will extend our study to develop a multi-feature numeric index structure for music data. Our experimental results show that the new proposed structure outperforms existing multi-feature string index approaches.
MESSIDOR system
Authors: Catherine Moulinoux, Jean-Claude Faure, Witold Litwin
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

MESSIDOR is an interactive information retrieval system. It differs from current systems in that it allows the simultaneous search of several bibliographic databases. The databases may be on different sites and may use different query languages (MISTRAL, QUEST,...). These local languages are invisible to the users of MESSIDOR. They are all translated to a single language. We describe MESSIDOR's goals, system architecture, user language and some details of the implementation. The system is implemented on a MICRAL 80-30 microcomputer.
A Document Image Retrieval Method Tolerating Recognition and Segmentation Errors of OCR Using Shape-Feature and Multiple Candidates
Authors: T. Kameshiro, T. Hirano, Y. Okada, F. Yoda
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

There are proposed document image retrieval methods that are robust to character recognition errors. Some of them tolerate recognition errors by having multiple candidates for a character image, but they are intolerant of segmentation errors of characters. In addition, these methods cannot retrieve documents that do not contain the correct character code. In this paper, we propose a method that overcomes these problems. This method uses multiple candidates and "shape-feature" which describes the outline of the character shape for uncertain characters. Documents are retrieved using both "shape-feature" and multiple candidate techniques. Our experi-mental results reveal that the method has high recall rate compared with that of conventional methods.
Teaching debugging
Authors: Robert F. Mathis
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

A course in debugging techniques is motivated and described. A course outline, reading list, and projects list are included. Certain debugging aids are described. Debugging techniques for elementary algorithms are illustrated. Particular attention is paid to ways to teach debugging and algorithm structure.
Recursive microprogramming in a syntax recognizer
Authors: Yaohan Chu
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper describes the microprogrammed architecture of a top-down syntax recognizer using the recursive descent technique for illustrating recursive microprogramming. The recognizer is implemented by a microprogram. The micro-instructions have a vertical format. Recursive microprogramming is described in implementing the recognizer. The microprogram is first described without and then with considerations of timing and synchronization. In a direct-execution high-level language processor, recognition of the hlgh-level language syntax is an important function. The use of the recursive descent technique for syntax recognition gives an orderly structure of the recognition algorithm. For the purpose of illustrating recursive microprogramming, this paper presents the hardware architecture of a vertically microprogrammed processor where recursive micro-subroutines together with a read-write control memory are used.
Database systems (ACM 82 Panel Session): User interfaces
Venue: Proceedings of the ACM '82 conference (1982)

We want to look at general ideas governing user inter- faces to database systems as well as specific interfaces. The session starts with the more general presentations and ends with the more specific. These short presentations (approximately 10-15 minutes each) will be followed by questions from the audience.
Application of Deformable Template Matching to Symbol Recognition in Hand-written Architectural Drawings
Authors: Ernest Valveny, Enric Martí
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

We propose to use deformable template matching as a new approach to recognize characters and lineal symbols in hand-written line drawings, instead of traditional methods based on vectorization and feature extraction. Bayesian formulation of the deformable template matching allows combining fidelity to the ideal shape of the symbol with maximum flexibility to get the best fit to the input image. Lineal nature of symbols can be exploited to define a suitable representation of models and the set of deformations to be applied to them. Matching, however, is done over the original binary image to avoid losing relevant features during vectorization. We have applied this method to hand-written architectural drawings and experimental results demonstrate that symbols with high distortions from ideal shape can be accurately identified.
Behavioral-level test development
Authors: William A. Johnson
Venue: Proceedings of the 16th Design Automation Conference (1979)

An argument is made that the economics of test development in the LSI-VLSI era require creation and use of test development software aids that operate from high-level behavioral circuit models. Behavioral models are defined to be abstract specifications of the circuit function. Problems with the use of current-day gate-level software aids are discussed. Suggestions are given for implementing behavioral-level test generation tools. Recent work in this area at Texas Instruments Incorporated (TI) is discussed.
Complexity measures for regular expressions
Authors: Andrzej Ehrenfeucht, Paul Zeiger
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Several measures of complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain standard sets (e.g. the set of all paths on a complete graph) are derived.
Robotics: The new automation tool
Authors: Harold R. Marcotte
Venue: Proceedings of the 19th Design Automation Conference (1982)

Industrial robots have seen limited use by industries for over a decade but until the auto industry introduced robotics for spot welding applications in the late 60s the robot was not considered seriously. Now they are readily accepted throughout industry. The reasons for their current popularity are the rapidly increasing costs of labor and the seemingly declining productivity of todays workers. In addition, robots today are credited for additional product and quality improvements not seriously considered in the past. Benefits similar to those that have long been attributes associated with hard automation. This paper looks at robotics from a users viewpoint and addresses some of the benefits and concerns attributable to their use. To this end, this paper will describe several applications that are currently used in production with results relative to production gains, side benefits and operator acceptance.
A computers and society course: Adapted for television
Authors: John F. Dalphin
Venue: ACM SIGCSE Bulletin (1976)

The experience of developing and presenting a television series in the area of computers and society is related. An existing seminar course with upper division students is used to provide recordable topic discussions and additional materials are developed around that nucleus.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The GPSS tutorial will present a basic set of GPSS &ldquo;building blocks,&rdquo; then illustrate their use in the context of a simple one-line, one-server queuing system. The statistical measures of system performance gathered automatically during a GPSS simulation will be reviewed.
Detecting bridging and stuck-at faults at input and output pins of standard digital components
Authors: Mark Karpovsky, Stephen Y.H. Su
Venue: Proceedings of the 17th Design Automation Conference (1980)

Due to the advances in the integrated circuit technology, there is an increasing importance in testing bridging (short circuit) failures in digital networks. Unfortunately, very little work has been done in this area. This paper presents the schemes for the detection of feedback bridgings between the inputs and outputs through the observation of oscillation and asynchronous behavior of sequential networks created by bridging faults. The lower and upper bounds on the number of tests for detecting all feedback bridging faults are given. Conditions for the undetectability of input bridgings are given and a method for testing input bridgings is presented. The results are generalized to detect bridging and stuck-at faults in the input and output lines of a multiple-output network. Finally, the complete test sets are given for detecting input, output and feedback bridgings as well as stuck-at faults at the input and output pins of the standard integrated circuit chips including shift registers, counters, decoders, multiplexers, adders/subtracters, multipliers, dividers and RAM.
The capital asset pricing simulator
Authors: David E. Besenfelder, Wayne H. Wagner
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The characteristics of the New York Stock Exchange closely resemble those necessary for an efficient market: large numbers of participants, rapid dissemination of information, low transaction costs and easy accessibility. These equilibriating conditions suggest that investors can accept existing security prices as usefully correct. Thus, investors should employ a portfolio strategy which controls the risk of the portfolio, eliminates unnecessary risks, and minimizes operating and transaction costs. The Capital Asset Pricing Simulator demonstrates how portfolios consistent with the above objectives would have performed over time and identifies possible sources of extra returns. The Simulator has supported the Capital Market Theory, assisted in the development of a realistic management strategy, and provided demonstrative materials for marketing and training. Furthermore, it has led to the offering of new investment management services.
The Berlin ALGOL 68 implementation
Authors: Wilfried Koch, Christoph Oeters
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

This paper is an introduction to the portable ALGOL 68 implementation currently developed at the Technical University of Berlin. An overview over the compiler and the other system components is given and the facilities for separate compilation and precompilation are described. Finally, the current state of the implementation is sketched.
Introduction to gpss
Authors: Thomas J. Schriber
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Summary information about key aspects of the simulation modeling language GPSS is provided.The class of problems to which GPSS applies especially well is described; commentary on the semantics and syntax the language is offered; the learning-oriented literature for GPSS is summarized; various GPSS implementations are commented on; the time-sharing networks offering GPSS are cited; and public courses on the language are listed. The GPSS tutorial itself will delve into the fundamental details of GPSS and present examples of simple GPSS models. Copies of the transparencies used for the tutorial will be distributed to those in attendance. (These transparency copies are excluded from reproduction here because of page-count limits.)
Overview to the Fifth Generation Computer System project
Authors: Tohru Moto-oka
Venue: ACM SIGARCH Computer Architecture News (1983)

Computers which have high performances for non-numeric data processing should be developed in order to satisfy and expand new applications which will become predominant fields in information processing of the 1990s. Knowledge information processing forming the main part of applied artificial intelligence is expected to be one of the important fields in 1990s information processing and the dedicated computers for this have been selected as the main theme of the national project of the Fifth Generation computers. The key technologies for the Fifth Generation Computer System (FGCS) seem to be VLSI architecture, parallel processing such as data flow control, logic programming, knowledge base based on relational database, and applied artificial intelligence and pattern processing. Inference machines and relational algebra machines are typical of the core processors which constitute FGCS.
An algebraic front-end for the production and use of numeric programs
Authors: Douglas H. Lanam
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

We describe a programming environment which combines the Macsyma algebraic manipulation system with convenient and direct access to numeric Fortran run-time libraries. With this system it is also convenient to generate, compile, load, and invoke totally new Fortran programs which may have been produced by combining algebraically derived formulas and program &ldquo;templates&rdquo;. These facilities, available on VAX-11 computers, provide an environment for the generation and testing of advanced scientific software. Enhancements of Fortran for high-precision calculations, interval arithmetic, and other purposes are also supported.
Toward an electronic programmer's assistant
Authors: Jeffrey Kurn, Scott L. McGregor
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

The purpose of this paper is to describe how an &ldquo;Electronic Programmer's Assistant&rdquo; system might be developed initially using currently existing software. The Assistant would be an integrated software package incorporating modules for documentaion, automatic programming, and testing. Such an effort requires additional research and definition, and this paper will attempt to describe what existing tools such an effort might use, as well as a broad description of what such a system might offer. While such a system as could be developed in the short term will not solve the autoprogramming problem or the program proving problem, it will be a step in the direction of solutions to such problems. The more modest goals of the system described in this report is to improve the programmer/system designer's productivity in generating and verifying programs. The system described here is one which has roots in the growing sophistication of systems for automatic production of systems documentation. Some discussion of the evolution of preceeding systems that led to the concepts of the Electronic Programmer's Assistant are also discussed.
A comparison of file organization techniques
Authors: Ned Chapin
Venue: Proceedings of the 1969 24th national conference (1969)

This paper compares six general file organization techniques on four characteristics. Then drawing on the implications of a set-theoretic approach, it sketches a seventh technique offering apparently a superior combination of characteristics for data base organization. The six techniques compared are the positional (sequential, indexed sequential, and random), the complex ring, the hierarchial (including partitioned), the multiple double-linked (muble) chain, the attributed string, and the inverted list. The four characteristics are naturalness, access, maintenance, and support.
A survey of enhancements to the alpha-beta algorithm
Authors: T. A. Marsland, M. Campbell
Venue: Proceedings of the ACM '81 conference (1981)

Current game-playing programs have developed numerous move ordering and search reduction techniques in order to improve the effectiveness of the alpha-beta algorithm. A critical review of these search modifications is provided, and a recursive formula to estimate the search time is proposed, one which reflects the characteristics of the strongly ordered trees produced through use of improved search enhancements.
A prototype DBMS with a Turkish query Language
Authors: Kemal Koymen
Venue: Proceedings of the ACM '82 conference (1982)

This paper describes a prototype DBMS, called VERTUR, which supports relational data structures and can be used inter-actively through a query language. The query language referred to as TURDIL is based on Turkish Language and is defined by a regular grammar. VERTUR has a fully integrated data dictionary which contains definitions of relations and user-views based on relations, along with information on data-access privileges.
The CRITTER system: Automated critiquing of digital circuit designs
Authors: Van E. Kelly
Venue: Proceedings of the 21st Design Automation Conference (1984)

CRITTER is an exploratory prototype design aid, built using Artificial Intelligence (&ldquo;Expert Systems&rdquo;) technology, to aid in &ldquo;critiquing&rdquo; digital circuit designs, encompassing issues of functional correctness, operating speed, timing robustness, and circuit sensitivity to changes in device parameters. Its non-procedural representation for both real-time circuit behavior and circuit specifications has led to a streamlined circuit modeling formalism based on ordinary mathematical function composition. In its interactions with the user it strives to be as concise as possible, concentrating only on findings it judges to be unexpected or unusual. After successful tests with circuits of up to a dozen TTL SSI/MSI packages, CRITTER is being extended for use in an automated VLSI design environment.
An efficient algorithm for computing powers of triangular matrices
Authors: C. P. Huang
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

An efficient algorithm for the computation of powers of a square arbitrary lower triangular matrix is presented. A comparison of the algorithm with the standard matrix multiplication method in terms of maximum number of multiplications is included. A numerical example is used to show some of the computational details.
Features of an information system for Congress
Authors: Kenneth Janda
Venue: Proceedings of the 1966 21st national conference (1966)

Students of government generally agree that the legislative branches of modern governments have gradually lost power relative to the power of executive authorities. This phenomenon has been referred to variously as the &ldquo;parliamentary crisis,&rdquo;1 the &ldquo;atrophy of the legislature,&rdquo;2 and the &ldquo;decline of the legislature.&rdquo;3 Although some students hold that Congress constitutes an exception to this generalization, 4 most detect the same trend in the United States. Indeed this very symposium of recommendations for revitalizing Congress is an acknowledgment of it. Congress' loss of power is manifested in three important governmental functions traditionally reserved to the legislature: initiating legislation, evaluating legislative proposals, and overseeing the execution of legislation. In recent decades, Congress has abdicated to the President its initiative in preparing a legislative program, has faltered in thoroughly evaluating proposals submitted by the President, and has been unable to exercise effective direction and control over the administration of legislation in which Congress has aquiesced.
Automatic control of execution: An overview
Authors: Philip S. Abrams, John W. Myrna
Venue: ACM SIGAPL APL Quote Quad (1979)

Automatic Control of Execution or ACE is a family of APL system extensions designed to automate manual interactions with the APL system. Such extensions are required for building robust, automatic, and cost-effective production programs in APL. Based on an architecture derived from the concept of an &ldquo;automatic user,&rdquo;the ACE features provide an orthogonal but harmonious set of system primitives that satisfy this requirement. The ACE features are Detached Execution, Detached I/O, Exception Handling, Deferred Execution, and a System Communication Facility. Each is described in contrast with its manual counterpart.
IDBUG: A tool for program development
Authors: Frederick J. Drasch, Richard A. Bowen
Venue: ACM SIGSOFT Software Engineering Notes (1978)

The construction of a reliable computer program requires, in part, a means of verification of its component parts prior to their integration into the overall system. The verification process may consist of building a test harness to exercise or exhaustively test a procedure. This technique is known as dynamic testing. In practice, the application of dynamic testing requires the coding of a special harness for each procedure. This consumes valuable programming time, as much as 50% of the total effort (FAIR78). It is also restrictive because the test harness cannot be easily modified to test aspects of a program which it was not originally designed to test. We have built a facility called IDBUG that reduces the programming effort required to employ dynamic testing by automating the construction of the test harness. Additionally, it provides an interactive test environment which permits more flexible testing. This paper describes IDBUG and discusses our experience in its application to maintenance tasks in a commercial environment. Nyone of the ideas put forth here will be especially novel; dynamic testing as a software testing tool has been in use for some time. What we hope to do is illustrate the beneficial aspects of a particular application of dynamic testing. It is argued that testing should play a more limited role in assuring the reliability of software in light of techniques such as structured coding, top-down design, proof of correctness, etc. (McG075). While it is true that eventually the &ldquo;art of computer programming&rdquo; will become the &ldquo;science of producing correct programs&rdquo;, we believe that more emphasis must be placed on interim solutions to aid in the construction of reliable software. We present IDBUG as such a solution.
Syntax-directed editing of general data structures
Authors: Christopher W. Fraser
Venue: ACM SIGPLAN Notices (1981)

Program editors help users create syntactically correct programs. Though such editors normally edit parse trees, applying similar techniques to other tree structures that need editing helps both users and implementors. This paper describes an editor that accepts a grammar describing a hierarchical data structure and allows the user to enter and edit arbitrary trees having this structure. It displays the pros and cons of this approach using instances of this editor that edit formatted documents, simple line drawings, and stick figures for trees.