ppxscal/embedding_network huggingface dataset:
Facial Expression Morphing and Animation with Local Warping Methods
Authors: Daw-Tung Lin, Han Huang
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, we applied local warping techniques to construct a frame work of image-based morphing for facial expressions animation with low complexity. From the experience we obtained in various spatial transformations, the local warping methods are more adequate for facial expressions morphing. We utilized two transformations that can deal with local deformations: piecewise polynomial transformation and radial basis function transformation. The simulation results are satisfactory. The facial warping techniques could be applied to various applications, such as face recognition, authentication, dynamic imagery, speech (action) semantic animation, multimedia and virtual reality construction, low-bandwidth video conference image transmission, and intelligent man-machine interface.
Note: Pages 1 thru 501 will be found in volume 1. managing reliable software
Authors: Michael G. Walker
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Engineering reliable software is possible. It is a problem of managing organizational structures. A theory is proposed which organizes the software development process. The theory predicts the effectiveness of several techniques and explains their disparate contributions to productivity. This prediction is compared with empirical studies of these techniques and the theory appears corroborated.
Conformant arrays and strong typing
Authors: David V. Moffat
Venue: Proceedings of the ACM '81 conference (1981)

Many persons have criticized&mdash;or defended&mdash; Pascal [1] for its lack of conformant arrays [2,3]. A conformant array is a formal parameter array whose bounds will conform to those of an actual parameter array. (The element types of both must be the same.) The lack of this feature is due to a desire for efficient compilation and execution. It is enforced by Pascal's convention that the index or bounds specification of an array is an integral part of the type of the array. For example, in: TYPE LIST&equil;ARRAY[1..10] OF REAL; LOST&equil;ARRAY[1..5] OF REAL; VAR LI: LIST; LO: LOST; LA: ARRAY[1. 10 ] OF REAL; FUNCTION SUM(A: LIST): REAL; it can be seen that the array bounds are nowhere specified in the parameter declaration; they are buried within the type definition. Thus, the call SUM(LI) is syntactically correct, but SUM(LO) is not, because the type of LO does not match the formal parameter. The call SUM(LA) is not correct, because LA has an anonymous (unnamed) type that matches (by convention) no other types. There is no way to generalize the SUM procedure to accept various arrays of reals.
A software methodology for building interactive tools
Authors: Robert W. Lingard
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The methodology proposed is intended to aid in the development of cooperative interactive tools (i.e., those which are natural, helpful, and consistent). Cooperative tools must incorporate knowledge of their own capabilities, limitations, and requirements. This required knowledge of tool functionality is provided by programming the tool in the process script formalism. The process script formalism is a specialized procedural/declarative language for writing tools. The key aspect of the process script specification of a tool is that, besides being executable, process scripts can be analyzed and understood for the purpose of cooperative interaction with the end user. This paper describes the process script formalism and explains its role in the development of a cooperative interactive system.
Simulating a central securities market
Authors: Lauren C. Bruzzone, John M. Dutton
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

On June 4, 1975, the Securities Act Amendment was passed into law mandating the future of securities trading: there would be one central market for the trade of all stocks and bonds - a single national market system. Although numerous proposals on the criteria for participation, the rules of trading and other similar problems were put forth, little effort was directed towards systematically evaluating the results of suggested alternatives. TRADE4 is an initial attempt at providing a framework for such an analysis: it is a model of a trading system. With the joint cooperation of the IBM New York Securities Branch Office and the New York Stock Exchange, the model was developed in the form of a computer program written in APL/SV (an interactive language supported by IBM).
Modular arithmetic and finite field theory: A tutorial
Authors: E. Horowitz
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The paradigm of algorithm analysis has achieved major pre-eminence in the field of symbolic and algebraic manipulation in the last few years. A major factor in its success has been the use of modular arithmetic. Application of this technique has proved effective in reducing computing times for algorithms covering a wide variety of symbolic mathematical problems. This paper is intended to review the basic theory underlying modular arithmetic. In addition, attention will be paid to certain practical problems which arise in the construction of a modular arithmetic system. A second area of importance in symbol manipulation is the theory of finite fields. A recent algorithm for polynomial factorization over a finite field has led to faster algorithms for factorization over the field of rationals. Moreover, the work in modular arithmetic often consists of manipulating elements in a finite field. Hence, this paper will outline some of the major theorems for finite fields, hoping to provide a basis from which an easier grasp of these new algorithms can be made.
GIS and file management
Authors: J. H. Bryant, Parlan Semple,  Jr.
Venue: Proceedings of the 1966 21st national conference (1966)

The objective of this paper is to describe an application program that is being developed for use as a data base management system. The program is identified by the acronym, GIS for Generalized Information System. The word &ldquo;system&rdquo; appears in its title because the program is designed to perform a set of data base functions that are closely interrelated and are self-contained within defined boundaries. It is not, however, an independent or &ldquo;stand-alone&rdquo; system in that it is designed to function within the framework of a larger system, the Operating System/360, in certain planned System/360 configurations. The other two words appear in its title because the system is directed toward providing the functions common to most information files and because the program components, until executed, are independent of, but adaptable to, an array of information processing tasks and operating environments. The system's major functions are those related to (1) data file design and creation, (2) file maintenance, (3) selective retrieval and processing, (4) document reference and full text indexing, and (5) control of task processing. To elaborate on the functions just enumerated, and to place them in a perspective, this paper presents an overall view of GIS: its rationale and the concept of its operation. That presentation is followed by a discussion of the system's scope within the context of some typical file management tasks. The illustrative examples are not expected to be accurate in every detail, but only to be representative of the method used to perform productive tasks with the system.
X.75 internetworking of Datapac and Telenet
Authors: Mehmet S. Unsoy, Theresa A. Shanahan
Venue: Proceedings of the seventh symposium on Data communications (1981)

In 1980, agreement was reached by CCITT defining a standard for the interconnection of public data networks. As a result, networks have been able to proceed with the establishment of international services using CCITT Recommendation X.75. This paper discusses the methodology used and the operating experience gained by the introduction of an X.75 interface between the GTE Telenet and Datapac public packet switching networks.
External control variance reduction for nonstationary simulation
Authors: Michael R. Taaffe, Sheryl A. Horn
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A statistically efficient method for performing simulation experimentation of nonstationary queueing models is outlined. The method utilizes a nonstationary queueing approximation as an external control variate system. A simple nonstationary tandem queueing model serves as an example of this variance reduction method.
Head and stem extraction from printed music scores using a neural network approach
Authors: H. Miyao, Y. Nakano
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In an automatic music score recognition system, it is very important to extract heads and stems of notes, since these symbols are most ubiquitous in a score and musically important. The purpose of our system is to present an accurate and high-speed extraction of note heads (except the whole notes) and stems according to the following procedure. (1) We extract all regions which are considered as candidates of stems or heads. (2) To identify heads from the candidates, we use a three-layer neural network. (3) The weights for the network are learned by the back propagation method. In the learning, the network learns the spatial constraints between heads and surroundings rather than the shapes of heads. (4) After the learning process is completed we use this network to identify a number of test head candidates (5) The stem candidates touching the detected heads are extracted as true stems. As an experimental result, we obtained high recognition rates of 99.0% and 99.2% for stems and note heads, respectively. It took between 40 to 100 seconds to process a printed piano score on A4 sheet using a workstation. Therefore, our system can analyze it at least 10 times as fast as manual methods.
Database administration as a team function: An analysis from survey data
Authors: Jean-Paul De Blasis
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

This paper reports some results from a survey of about thirty practicing database administration teams in U.S. organizations of varying sizes and commitment to database technology. It stresses how the various recommendations regarding DBA implementation are reflected in reality and analyses from survey data a number of significant parameters characterizing the DBA teams interviewed: their organizational status, the reporting levels of the DBA teams within the DP organization, the size and structure of the teams, the scope of their responsibilities, the distribution of their time and efforts in the various functional areas, their skills, education, training and career-path, the economics of the DBA groups, the tools and techniques employed in their functions, the current state of the DBA teams in their organizations, and the projections on their future as provided by the teams themselves.
Static and dynamic topological re-configurability in multi-microcomputer systems
Authors: Y. Hoffner
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

This paper proposes a method of constructing multi-microcomputer systems which allows both static and dynamic topological re-configurability. The method uses a time-multiplexed shared bus which avoids bus contention altogether. Two systems are presented. In the dynamic, any number of micro-computers can be connected to the bus; the shared memory can be configured by software at run-time to allow the communication between any CEs, enabling interconnection topologies to develop dynamically. In the static, only two micro-computers are allowed to share a common memory, thus limiting topology modifications to physical changes of the connections between microcomputers.
Impact of satellite technology on transport flow control
Authors: Richard L. Tenney, Gilbert Falk, Douglas H. Hunt
Venue: Proceedings of the seventh symposium on Data communications (1981)

We present a framework for considering the impact of satellite communications on high level computer communication protocols. Within that framework, we present a model for analyzing these effects, and using that model, we derive some bounds on the amount of data that may be transferred over a communication channel which contains a satellite link. As our example, we use the flow control mechanism of an early version of a planned NBS transport protocol.
Document Image Layout Comparison and Classification
Authors: Jianying Hu, Ramanujan Kashi, Gordon Wilfong
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes features and methods for document image comparison and classification at the spatial layout level. The methods are useful for visual similarity based document retrieval as well as fast algorithms for initial document type classification without OCR. A novel feature set called interval encoding is introduced to capture elements of spatial layout. This feature set encodes region layout information in fixed-length vectors which can be used for fast page layout comparison.The paper describes experiments and results to rank-order a set of document pages in terms of their layout similarity to a test document. We also demonstrate the usefulness of the features derived from interval encoding in a hidden Markov model based page layout classification system that is trainable and extendible.
On the effectiveness of set associative page mapping and its application to main memory management
Authors: Alan Jay Smith
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Set associative page mapping algorithms have become widespread for the operation of cache memories for reasons of cost and efficiency. In this paper we show how to calculate analytically the effectiveness of set associative paging relative to full associative (unconstrained mapping) paging. For two miss ratio models, Saltzer's linear model and a mixed geometric model, we are able to obtain simple, closed form expressions for the relative LRU fault rates. Trace driven simulations are used to verify the accuracy of our results. We suggest that as electronically accessed third level memories, such as electron beam memories, magnetic bubbles or charge coupled devices become available, algorithms currently used only for cache paging will be applied to main memory, for the same reasons of efficiency, implementation ease and cost.
Data abstractions for data bases
Authors: Michael Hammer
Venue: ACM SIGMOD Record (1976)

The concept of abstract data types has emerged from programming language research as a device to encourage and facilitate structured and modular programming [1]. It separates the abstraction of a data object from its implementation. The user of an abstract data type only concerns himself with the behavioral semantics of the type: what meaningful operations can be applied to objects of the type; the internal representation and structure of the type is unknown to him. In this way, irrelevent detail is suppressed and meaningfulness of programs enhanced. What application does this concept have to the area of data bases? There are some obvious similarities between the principle of abstraction and the concept of data independence of data bases [2]. Data independence means that application programs that utilize a data base do not need to know either the physical or the structural organization of the data base, but can relate to it purely on a logical plane. As with data abstractions, the goal is clarity and modifiability of programs, resulting from concentration on semantics rather than representation.
Chrysler message switching today and tomorrow
Authors: Lloyd R. Isaacs, Donald C. Buzzelli
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The Chrysler corporate Teletype network was established primarily to provide increased capability for written communications between corporate locations. This system utilizes Model 28 Teletype equipment with associated 81D1 selection equipment as remote terminals and a General Electric Datanet 30 as the central computer switcher.
Simulating a &ldquo;management game&rdquo; with programmed decisions
Authors: J. A. Bubenko,  Jr.
Venue: Proceedings of the second conference on Applications of simulations (1968)

This game differs from many other management games in that respect that the participants do not make their decisions &ldquo;manually&rdquo; during the game. Instead the model consists of a control module, a market model and an arbitrary number of information compatible and functionally similar firm models, each with an independent and individual decision structure. Each participating group is responsible for the design of its own control algorithms which during the simulation have to allocate the firm s resources and decide its price for the following period. The decisions can be based on global market information and on an arbitrary amount of local information that each firm is free to gather, analyze and use for its forecasting etc. The primary purposes of the above system of models is to provide an experimental tool for studies of automatic control problems concerning complex business-like systems.
Computational processor demands of Algol-60 programs
Authors: Robert E. Brundage, Alan P. Batson
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

The characteristics of computational processor requirements of a sample of Algol-60 programs have been measured. Distributions are presented for intervals of processor activity as defined by input-output requests and segment allocation requests occurring within the Johnston contour model and within a stack model in which array allocations are treated separately. The results provide new empirical data concerning the behavior of this class of programs. Some implications of the empirical results which may influence computer system design and performance are presented and discussed.
The use of APL as an executable formal language in economics demonstrated by an example
Authors: Wolfgang H. Janko
Venue: ACM SIGAPL APL Quote Quad (1981)

Quantitative models in economics have gained a high degree of both mathematical and notational complexity which often hides the underlying fruitful and essential ideas. The use of complex notations delays the rapid spread of new ideas. Using an example, we show that the use of APL in the presentation of the ideas of the model and in the proof of the related theorems leads to directly executable steps in the formal proofs, and hence to a better understanding of the ideas behind them. This not only results in a more thorough understanding of the model, but also in an essentially correct algorithm. We thus avoid the need for a separate formulation of the formal model in an algorithmic language.
Error recovery for Simple LR(k) parsers
Authors: Frederick C. Druseikis, G. David Ripley
Venue: Proceedings of the 1976 annual conference (1976)

A procedure is described for augmenting a Simple LR(k) parser with new states which enable the extended parser to continue parsing the input after an error is detected. Examples of the error recovery technique are given.
Interactive image understanding
Authors: Andrew J. Hanson
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Cooperation between a human expert and an image processing system can give much better results than either the human or computer working alone. The computer must display geometrical information that exploits the perceptual characteristics of the human user, while the human must convey to the computer system ideas that can result in practical computation. We discuss new image understanding systems with human interfaces that support a powerful dialog about image features and characteristics.
Computer methods of network analysis
Authors: Franklin H. Branin,  Jr.
Venue: Proceedings of the 4th Design Automation Conference (1967)

This is a tutorial paper which highlights the influence of the computer not only on the modus operandi of circuit design but also on network theory itself. It reviews the topological properties of linear graphs and describes a matrix-topological formulation of the network problem. In addition to the classical mesh, node, and outset methods, a mixed method of analysis is described which is applicable to d-c, a-c, and transient problems. Numerical methods of solving linear and non-linear d-c network problems are discussed and a new approach to a-c analysis, using the mixed method and a numerical solution of the matrix eigenvalue problem, is described. The extension of this method to the transient analysis of linear networks is also explained. Finally, the problem of instability in the numerical integration of differential equations is discussed and several means of solving the problem are outlined.
Computer Impact on Society perspective on a new NSF initiative
Authors: Peter G. Lykos, M. Granger Morgan, Fred W. Weingarten
Venue: Proceedings of the ACM annual conference (1973)

A longstanding interest in the Office of Computing Activities, National Science Foundation, in the impact of computers on society has, over the past two years, evolved rapidly into a new administrative unit, the Computer Impact on Society Section in OCA. This nebulous area has already been given form through a set of funded grant proposals. Some expected future directions of growth for the program are discussed.
Performance prototyping of data management applications
Authors: James F. Spitzer
Venue: Proceedings of the 1976 annual conference (1976)

This paper describes the construction of a performance model or prototype of a proposed data base management system (DBMS) application by the application of certain techniques from the performance measurement and data base management disciplines. Performance measurement is conducted by using a &ldquo;drive&rdquo; workload that initiates the &ldquo;real&rdquo; workload with reasonable fidelity. The &ldquo;drive&rdquo; workload is constructed in terms of data base variable primitives, which are &ldquo;inverted&rdquo; to performance variable primitives in order to construct a resource-based drive workload. The application of this drive workload to a simulation model is illustrated, showing the use of the methodology to &ldquo;tune&rdquo; important DBMS, Operating System and application program parameters.
Progress report: Brown university instructional computing laboratory
Authors: Marc H. Brown, Robert Sedgewick
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

An instructional computing laboratory, consisting of about 60 high-performance, graphics-based personal workstations connected by a high-bandwidth, resource-sharing local area network, has recently become operational at Brown University. This hardware, coupled with an innovative courseware/software environment, is being used in the classroom in an attempt to radically improve the state of the art of computer science pedagogy. This paper describes the current state of the project. The hardware and courseware/software environments are described and their use illustrated with detailed descriptions, including sample screen images. Some comments are included on our initial reactions to our experience to date with the environment and on our future plans.