ppxscal/embedding_network huggingface dataset:
Value conflicts and social choice in electronic funds transfer system developments
Authors: Rob Kling
Venue: Communications of the ACM (1978)

During the last few years, computer-based systems which automate the transfer and recording of debits and credits have begun to be implemented on a large scale. These systems promise both financial benefits for the institutions that use them and potential conveniences to their customers. However, they also raise significant social, legal, and technical questions that must be resolved if full scale systems for Electronic Funds Transfer (EFT) are not to cause more problems for the larger public than they solve. This paper examines the incentives for EFT developments and the social problems they raise in the context of conflicts between five different value positions that are often implicit in analyses of proposed EFT arrangements. These conflicts reflect the relative importance of certain problems for specific groups. The value positions implicit in EFT proposals help to organize analyses of market arrangements, system reliability, and privacy of transactions. These topics are analyzed in this article and related to the value positions held by concerned parties. Last, the ways in which the public can learn about the social qualities of different EFT arrangements and the pace of EFT developments are both discussed in the context of social choice.
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
Authors: Harry B. Hunt,  III, Madhav V. Marathe, Richard E. Stearns
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We demonstrate how the concepts of algebraic representability and strongly-local reductions developed here and in [20] can be used to characterize the computational complexity/efficient approximability of a number of basic problems and their variants, on various abstract algebraic structures F. These problems include the following: Algebra: Determine the solvability, unique solvability, number of solutions, etc., of a system of equations on F. Determine the equivalence of two formulas or straight-line programs on F. Optimization: Let &isin; > 0. Determine the maximum number of simultaneously satisfiable equations in a system of equations on F; or approximate this number within a multiplicative factor or n&isin;. Determine the maximum value of an objective function subject to satisfiable algebraically-expressed constraints on F; or approximate this maximum value within a multiplicative factor of n&isin; Given a formula or straight-line program, find a minimum size equivalent formula or straight-line program; or find an equivalent formula or straight-line program of size &lne; f(minimum). Both finite and infinite algebraic structures are considered. These finite structures include all finite non-degenerate lattices and all finite rings or semi-rings with a nonzero element idempotent under multiplication (e.g. all non-degenerate finite unitary rings or semi-rings); and these infinite structures include the natural numbers, integers, real numbers, various algebras on these structures, all ordered rings, many cancellative semi-rings, and all infinite lattices with two elements a,b such that a is covered by b.
Towards a practical inclusive design approach
Authors: Simeon Keates, P. John Clarkson, Lee-Anne Harrison, Peter Robinson
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

It is known that many products are not accessible to large sections of the population. Designers instinctively design for able-bodied users and are either unaware of the needs of users with different capabilities, or do not know how to accommodate their needs into the design cycle. This aim of this paper is to present a methodological design approach for implementing inclusive design. A summary of the principal methods for designing for users with different capabilities is given along with a description of a model, the Inclusive Design Cube, that displays how the different approaches are complementary and can provide complete population coverage. A case study of the design of an information point for use in a post office, shall be used to highlight the use of the model.
Congress tackless computer abuse
Authors: Rosalie Steier
Venue: Communications of the ACM (1984)

Congress has been taking an active interest in protecting information stored in computers. Congressional investigations and media reports have highlighted the vulnerability of computer systems to abuse and mis-use. Recent accounts of &ldquo;system hackers&rdquo; describe young students and others who gain illegal access to systems, thereby obtaining information and services, as well as disrupting systems.
What could be more SLic?: projects for the programming languages course
Authors: L. A. Smith King, John Barr, Ben Coleman
Venue: ACM SIGCSE Bulletin (2001)

The last few years has seen renewed interest in teaching programming-in-the-large (PIL) and programming-in-context of a larger existing program (PIC) throughout the computer science curriculum. Although these skills have been a focus of software engineering courses and capstone projects, there is an emphasis to teach these skills in other courses across the curriculum. This paper addresses incorporation of PIL and PIC in the programming language course, and presents specific PIC and PIL projects using an interpreter for SLic, a simple logic (declarative) language. SLic itself is part of a family of interpreters in MuLE, a software environment designed to support interpreter-based projects in the programming languages course. MuLE is written in DrScheme (from Rice's PLT software project distributed under the GNU Library General Public License) and runs under Windows 95/98/NT/2000, MacOS, and Unix/X.
Experiments with some algorithms that find central solutions for pattern classification
Authors: James Slagle
Venue: Communications of the ACM (1979)

In two-class pattern recognition, it is a standard technique to have an algorithm finding hyperplanes which separates the two classes in a linearly separable training set. The traditional methods find a hyperplane which separates all points in one class from all points in the other, but such a hyperplane is not necessarily centered in the empty space between the two classes. Since a central hyperplane does not favor one class or the other, it should have a lower error rate in classifying new points and is therefore better than a noncentral hyperplane. Six algorithms for finding central hyperplanes are tested on three data sets. Although frequently used in practice, the modified relaxation algorithm is very poor. Three algorithms which are defined in the paper are found to be quite good.
A note on &ldquo;A modification of Nordsieck's method using an &lsquo;Off-Step&rsquo; point&rdquo;
Authors: John W. Blumberg, Clinton R. Foulk
Venue: Communications of the ACM (1971)

An examination was made of the experimental results presented by J.J. Kohfeld and G.T. Thompson [1] in their paper on a modification of Nordsieck's method for the numerical solution of ordinary differential equations, using a multiple precision arithmetic package [2] available on the IBM 7094 at The Ohio State University Computer Center. A comparison was made between the errors of the Nordsieck and the Gragg-Stetter-Nordsieck methods in which, after the starting procedure, the interval length &ldquo;h&rdquo; was held constant. Results relative to the five functions used by Kohfeld and Thompson are presented in Tables I and II (@ b means 10b).
Encoding Visual Information Using Anisotropic Transformations
Authors: Giuseppe Boccignone, Mario Ferraro, Terry Caelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

The evolution of information in images undergoing fine-to-coarse anisotropic transformations is analyzed by using an approach based on the theory of irreversible transformations. In particular, we show that, when an anisotropic diffusion model is used, local variation of entropy production over space and scale provides the basis for a general method to extract relevant image features.
Termination proofs for logic programs with tabling
Authors: Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

Tabled evaluation is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often considerably more efficient execution mechanism for logic programs. In particular, tabled execution terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the selection of tabled predicates meets certain natural criteria. Starting from these conditions, we develop modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way.
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
Authors: Robert B. K. Dewar, Arthur Grand, Ssu-Cheng Liu, Jacob T. Schwartz, Edmond Schonberg
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

&ldquo;Pure&rdquo; SETL is a language of very high level allowing algorithms to be programmed rapidly and succintly. SETL's representation sublanguage adds a system of declarations which allow the user of the language to control the data structures that will be used to implement an algorithm which has already been written in pure SETL, so as to improve its efficiency. Ideally no rewriting of the algorithm should be necessary. The facilities provided by the representation sublanguage and the run-time data structures that it can generate are described; based on this a heuristic which uses some of the methods of global program analysis and which should be capable of selecting an acceptably efficient representation automatically is given.
Cooperation is key: an interview with B. R. Inman
Authors: Rosalie Steier
Venue: Communications of the ACM (1983)

The most innovative and audacious among the U.S. responses to Japan's Fifth Generation Project is that of the Microelectronics and Computer Technology Corp. MCC is a consortium of thirteen companies formed to conduct long range research and development in advanced computers. The member companies are investing in MCC projects in return for a three-year lead in implementing the resulting technology. The President of MCC, retired Admiral B. R. Inman, must chart this new course for U.S. industrial research: a course of cooperation among competitors whose goal is to achieve U.S. supercomputer dominance in the 1990s marketplace.
Connections between accuracy and stability properties of linear multistep formulas
Authors: Werner Liniger
Venue: Communications of the ACM (1975)

This paper is concerned with stability and accuracy of families of linear k-step formulas depending on parameters, with particular emphasis on the numerical solution of stiff ordinary differential equations. An upper bound, p = k, is derived for the order of accuracy of A&infin;-stable formulas. Three criteria are given for A0-stability. It is shown that (1) for p = k, k arbitrary, A&infin;-stability implies certain necessary conditions for A0-stability and for strict stability (meaning that the extraneous roots of &rgr;(&zgr;) satisfy |&zgr;| < 1); (2) for p = k = 2, 3, 4, and 5, A&infin;-stability (for k = 5 together with another constraint) implies strict stability; and (3) for certain one-parameter classes of formulas with p = k = 3, 4, and/or 5, A&infin;-stability implies A0-stability.
An improved hash code for scatter storage
Authors: W. D. Maurer
Venue: Communications of the ACM (1983)

Introduced is a hash coding method based on fixed-point division rather than multiplication or logical operations. This new method allows the hash table to have almost any length. Also a new method of handling collisions is discussed. Known as quadratic search, this method is faster than random search and free from the &ldquo;clusters&rdquo; that build up with a linear search.
Dynamic programming: a method for taking advantage of technical terminology in Japanese documents
Authors: Eiko Yamamoto, Mikio Yamamoto Kyoji Umemura, Kenneth W. Church
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We introduce a new similarity measure based on dynamic programming, intended for technical terms such as machine translation system, which are quite common in technical writing. We compare our proposal with systems which use standard IDF cosine similarity, but on different vocabularies. The dynamic programming method is relatively strong when the query contains a single long technical term, and none of the words in the term are particularly good keywords.
Optimal planar point location
Authors: John Iacono
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time.
A Default Logic Based Framework for Context-Dependent Reasoning with Lexical Knowledge
Authors: Anthony Hunter
Venue: Journal of Intelligent Information Systems (2001)

Lexical knowledge is increasingly important in information systems&mdash;for example in indexing documents using keywords, or disambiguating words in a query to an information retrieval system, or a natural language interface. However, it is a difficult kind of knowledge to represent and reason with. Existing approaches to formalizing lexical knowledge have used languages with limited expressibility, such as those based on inheritance hierarchies, and in particular, they have not adequately addressed the context-dependent nature of lexical knowledge. Here we present a framework, based on default logic, called the dex framework, for capturing context-dependent reasoning with lexical knowledge. Default logic is a first-order logic offering a more expressive formalisation than inheritance hierarchies: (1) First-order formulae capturing lexical knowledge about words can be inferred&semi; (2) Preferences over formulae can be based on specificity, reasoning about exceptions, or explicit priorities&semi; (3) Information about contexts can be reasoned with as first-order formulae formulae&semi; and (4) Information about contexts can be derived as default inferences. In the dex framework, a word for which lexical knowledge is sought is called a query word. The context for a query word is derived from further words, such as words in the same sentence as the query word. These further words are used with a form of decision tree called a context classification tree to identify which contexts hold for the query word. We show how we can use these contexts in default logic to identify lexical knowledge about the query word such as synonyms, antonyms, specializations, meronyms, and more sophisticated first-order semantic knowledge. We also show how we can use a standard machine learning algorithm to generate context classification trees.
The Communication Bottleneck in Knitwear Design: Analysis and Computing Solutions
Authors: Claudia Eckert
Venue: Computer Supported Cooperative Work (2001)

Communication between different members of a design team often poses difficulties. This paper reports on the results of a detailed empirical study of communication in over twenty British, German and Italian knitwear companies. The knitwear design process is shared by the designers, who plan the visual and tactile appearance of the garments, and the technicians, who have to realise the garment on a knitting machine. They comprise a typical but small design team whose members have different backgrounds and expertise. Knitwear design allows a detailed analysis of the causes and effects of communication breakdown. Designers specify their designs inaccurately, incompletely and inconsistently&semi; technicians interpret these specifications according to their previous experience of similar designs, and produce garments very different from the designers' original intentions. Knitwear is inherently difficult to describe, as no simple and complete notation exists&semi; and the relationship between visual appearance and structure and technical properties of knitted fabric is subtle and complex. Designers and technicians have different cognitive approaches and are very different people. At the same time the interaction between designers and technicians is badly managed in many companies. This paper argues that improving the accuracy and reliability of designers' specifications would significantly enhance the design process. It concludes with a description of the architecture of an intelligent automatic design system that generates technically correct designs from the designers' customary notations.
Shape Recovery from Equal Thickness Contours
Authors: Ge Cong, Bahram Parvin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

A unique imaging modality based on Equal Thickness Contours (ETC) has introduced a new opportunity for 3D shape reconstruction from multiple views. These ETCs can be generated through an interference between transmitted and diffracted beams. We present a computational framework for representing each view of an object in terms of its object thickness and then integrating these representations into a 3D surface by algebraic reconstruction. In this framework, the object thickness is first derived from ideal contours and then extended to real data. For real data, the object thickness is inferred by grouping curve segments that correspond to points of second derivative maxima. At each step of the process, we use some form of regularization to ensure closeness to the original features as well as neighborhood continuity. We apply our approach to images of a submicron crystal structure obtained through a holographic process.
The EMOTE model for effort and shape
Authors: Diane Chi, Monica Costa, Liwei Zhao, Norman Badler
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Human movements include limb gestures and postural attitude. Although many computer animation researchers have studied these classes of movements, procedurally generated movements still lack naturalness. We argue that looking only at the psychological notion of gesture is insufficient to capture movement qualities needed by animated charactes. We advocate that the domain of movement observation science, specifically Laban Movement Analysis (LMA) and its Effort and Shape components, provides us with valuable parameters for the form and execution of qualitative aspects of movements. Inspired by some tenets shared among LMA proponents, we also point out that Effort and Shape phrasing across movements and the engagement of the whole body are essential aspects to be considered in the search for naturalness in procedurally generated gestures. Finally, we present EMOTE (Expressive MOTion Engine), a 3D character animation system that applies Effort and Shape qualities to independently defined underlying movements and thereby generates more natural synthetic gestures.
A Maximum-Likelihood Strategy for Directing Attention during Visual Search
Authors: Hemant D. Tagare, Kentaro Toyama, Jonathan G. Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A precise analysis of an entire image is computationally wasteful if one is interested in finding a target object located in a subregion of the image. A useful ¿attention strategy¿ can reduce the overall computation by carrying out fast but approximate image measurements and using their results to suggest a promising subregion. This paper proposes a maximum-likelihood attention mechanism that does this. The attention mechanism recognizes that objects are made of parts and that parts have different features. It works by proposing object part and image feature pairings which have the highest likelihood of coming from the target. The exact calculation of the likelihood as well as approximations are provided. The attention mechanism is adaptive, that is, its behavior adapts to the statistics of the image features. Experimental results suggest that, on average, the attention mechanism evaluates less than 2 percent of all part-feature pairs before selecting the actual object, showing a significant reduction in the complexity of visual search.
Observability of 3D Motion
Authors: Cornelia Fermüller, Yiannis Aloimonos
Venue: International Journal of Computer Vision (2000)

This paper examines the inherent difficulties in observing 3D rigid motion from image sequences. It does so without considering a particular estimator. Instead, it presents a statistical analysis of all the possible computational models which can be used for estimating 3D motion from an image sequence. These computational models are classified according to the mathematical constraints that they employ and the characteristics of the imaging sensor (restricted field of view and full field of view). Regarding the mathematical constraints, there exist two principles relating a sequence of images taken by a moving camera. One is the &ldquo;epipolar constraint,&rdquo; applied to motion fields, and the other the &ldquo;positive depth&rdquo; constraint, applied to normal flow fields. 3D motion estimation amounts to optimizing these constraints over the image. A statistical modeling of these constraints leads to functions which are studied with regard to their topographic structure, specifically as regards the errors in the 3D motion parameters at the places representing the minima of the functions. For conventional video cameras possessing a restricted field of view, the analysis shows that for algorithms in both classes which estimate all motion parameters simultaneously, the obtained solution has an error such that the projections of the translational and rotational errors on the image plane are perpendicular to each other. Furthermore, the estimated projection of the translation on the image lies on a line through the origin and the projection of the real translation. The situation is different for a camera with a full (360 degree) field of view (achieved by a panoramic sensor or by a system of conventional cameras). In this case, at the locations of the minima of the above two functions, either the translational or the rotational error becomes zero, while in the case of a restricted field of view both errors are non-zero. Although some ambiguities still remain in the full field of view case, the implication is that visual navigation tasks, such as visual servoing, involving 3D motion estimation are easier to solve by employing panoramic vision. Also, the analysis makes it possible to compare properties of algorithms that first estimate the translation and on the basis of the translational result estimate the rotation, algorithms that do the opposite, and algorithms that estimate all motion parameters simultaneously, thus providing a sound framework for the observability of 3D motion. Finally, the introduced framework points to new avenues for studying the stability of image-based servoing schemes.