ppxscal/embedding_network huggingface dataset:
A new approach to unsupervised text summarization
Authors: Tadashi Nomoto, Yuji Matsumoto
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

The paper presents a novel approach to unsupervised text summarization. The novelty lies in exploiting the diversity of concepts in text for summarization, which has not received much attention in the summarization literature. A diversity-based approach here is a principled generalization of Maximal Marginal Relevance criterion by Carbonell and Goldstein \cite{carbonell-goldstein98}.We propose, in addition, aninformation-centricapproach to evaluation, where the quality of summaries is judged not in terms of how well they match human-created summaries but in terms of how well they represent their source documents in IR tasks such document retrieval and text categorization.To find the effectiveness of our approach under the proposed evaluation scheme, we set out to examine how a system with the diversity functionality performs against one without, using the BMIR-J2 corpus, a test data developed by a Japanese research consortium. The results demonstrate a clear superiority of a diversity based approach to a non-diversity based approach.
Using information scent to model user information needs and actions and the Web
Authors: Ed H. Chi, Peter Pirolli, Kim Chen, James Pitkow
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

On the Web, users typically forage for information by navigating from page to page along Web links. Their surfing patterns or actions are guided by their information needs. Researchers need tools to explore the complex interactions between user needs, user actions, and the structures and contents of the Web. In this paper, we describe two computational methods for understanding the relationship between user needs and user actions. First, for a particular pattern of surfing, we seek to infer the associated information need. Second, given an information need, and some pages as starting pints, we attempt to predict the expected surfing patterns. The algorithms use a concept called &ldquo;information scent&rdquo;, which is the subjective sense of value and cost of accessing a page based on perceptual cues. We present an empirical evaluation of these two algorithms, and show their effectiveness.
A computer system for transformational grammar
Authors: Joyce Friedman
Venue: Communications of the ACM (1969)

A comprehensive system for transformational grammar has been designed and implemented on the IBM 360/67 computer. The system deals with the transformational model of syntax, along the lines of Chomsky's Aspects of the Theory of Syntax. The major innovations include a full, formal description of the syntax of a transformational grammar, a directed random phrase structure generator, a lexical insertion algorithm, an extended definition of analysis, and a simple problem-oriented programming language in which the algorithm for application of transformations can be expressed. In this paper we present the system as a whole, first discussing the general attitudes underlying the development of the system, then outlining the system and discussing its more important special features. References are given to papers which consider some particular aspect of the system in detail.
Digital family portraits: supporting peace of mind for extended family members
Authors: Elizabeth D. Mynatt, Jim Rowan, Sarah Craighill, Annie Jacobs
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

A growing social problem in the U.S., and elsewhere, is supporting older adults who want to continue living independently, as opposed to moving to an institutional care setting. One key part of this complex problem is providing awareness of senior adults day-to-day activities, promoting peace of mind for extended family members. In this paper, we introduce the concept of a digital family portrait that provides qualitative visualizations of a family members daily life. Leveraging a familiar household object, the picture frame, our design populates the frame with iconic imagery summarizing 28 days. In a final implementation, the digital family portrait would gather information from sensors in the home.
R-Rio (poster session): reflective-reconfigurable interconnectable objects
Authors: Alexandre Sztajnberg, Orlando Loques
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Separation of concerns is a key goal in achieving software reusability. Meta-Level Programming approaches pave the way to separation of concerns by handling functional and non-functional aspects in different levels, but provide little help for software composition, verification and evolution activities. Approaches based on Software Architecture Description Languages can overcome these deficiencies and additionally may discipline, and make explicit, the deployment of meta-level programming. R-RIO combines both approaches providing a useful framework to develop, implement and maintain applications.
Teacing breadth-first depth-first
Authors: Thomas P. Murtagh
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

This paper argues that current approaches to teaching the introductory course for the CS major fail to provide students with an accurate sense of the nature of our field. We propose that an introductory course focused on a single sub-field of our discipline could better prepare potential majors by using that sub-field as a vehicle to present an overview of the techniques and principles fundamental to computer science. We discuss our experience with such a course based on the field of computer networks.
A multi-agent system for automated genomic annotation
Authors: Keith Decker, Xiaojing Zheng, Carl Schmidt
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Massive amounts of raw data are currently being generated by biologists while sequencing organisms. Outside of the largest, high-profile projects such as the Human Genome Project, most of this raw data must be analyzed through the piecemeal application of various computer programs and searches of various public web databases. Due to the inexperience and lack of training, both the raw data and any valuable derived knowledge will remain generally unavailable except in published textual forms. Multi-agent information gathering systems have a lot to contribute to these efforts, even at the current state of the art. We have used DECAF, a multi-agent system toolkit based on RETSINA and TAEMS, to construct a prototype multi-agent system for automated annotation and database storage of sequencing data for herpesviruses. The resulting system eliminates tedious and always out-of-date hand analyses, makes the data and annotations available for other researchers (or agent systems), and provides a level of query processing beyond even some high-profile web sites.
The design, implementation, and evaluation of a working set dispatcher
Authors: Juan Rodriguez-Rosell, Jean-Pierre Dupuy
Venue: Communications of the ACM (1973)

The behavior of a computer system is largely dependent upon the algorithms employed to allocate the system resources to the processes competing for them. Recent research in time-sharing paging systems has developed the working set model for program behavior, and a resource allocation strategy based on this model has been proposed. Two implementations along these principles have been reported, but it seems that in neither case have further results been announced. This report discusses the design and implementation of a dispatcher based on the working set principle, presents data to permit analysis of its behavior, and indicates future directions of research on methods of controlling a computer system.
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
Authors: Chih-wen Hsueh, Kwei-Jay Lin
Venue: IEEE Transactions on Computers (2001)

Real-time distributed applications have timing constraints on tasks running on several processors. To design real-time systems with end-to-end performance requirements, we need to have algorithms to schedule and to coordinate tasks on different processor nodes. In this paper, an end-to-end scheduling approach based on the pinwheel scheduling model is presented for distributed real-time systems. We show how tasks on different nodes may be transformed to have periods consisting of only harmonic numbers. With harmonic periods, we can use a polynomial-time algorithm to find the start and finish times of each task on each node. Phase alignment algorithms are then applied to adjust the phases between schedules of neighboring nodes so that the overall end-to-end delay is minimized. Using the distributed pinwheel model, schedules on different nodes are synchronized to lessen the delays. For many real-time systems, this approach provides a predictable performance and a short end-to-end delay.
A software design method for real-time systems
Authors: H. Gomaa
Venue: Communications of the ACM (1984)

DARTS&mdash;a design method for real-time systems&mdash;leads to a highly structured modular system with well-defined interfaces and reduced coupling between tasks.
Making Inodes Behave
Authors: Clay Claiborne,  Jr.
Venue: Linux Journal (2001)

Claiborne describes the difficulties he encountered while building Linux systems for General Dynamics.
Finding topic words for hierarchical summarization
Authors: Dawn Lawrie, W. Bruce Croft, Arnold Rosenberg
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Hierarchies have long been used for organization, summarization, and access to information. In this paper we define summarization in terms of a probabilistic language model and use the definition to explore a new technique for automatically generating topic hierarchies by applying a graph-theoretic algorithm, which is an approximation of the Dominating Set Problem. The algorithm efficiently chooses terms according to a language model. We compare the new technique to previous methods proposed for constructing topic hierarchies including subsumption and lexical hierarchies, as well as the top TF.IDF terms. Our results show that the new technique consistently performs as well as or better than these other techniques. They also show the usefulness of hierarchies compared with a list of terms.
Guarded commands, nondeterminacy and formal derivation of programs
Authors: Edsger W. Dijkstra
Venue: Communications of the ACM (1975)

So-called &ldquo;guarded commands&rdquo; are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.
Key-frame extraction and shot retrieval using nearest feature line (NFL)
Authors: Li Zhao, Wei Qi, Stan Z. Li, Shi-Qiang Yang, H. J. Zhang
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Query by key frame or video example is a convenient and often effective way to search in video database. This paper proposes a new approach to support such searches. The main contribution of the proposed approach is the consideration of both feature extraction and distance computation as a whole process. With a video shot represented by key-frames corresponding to feature points in a feature space, a new metric is defined to measure the distance between a query image and a shot based on the concept of Nearest Feature Line (NFL). We propose to use the &ldquo;breakpoints&rdquo; of feature trajectory of a video shot as the key frames and use the lines passing through these points to represent the shot. When combined with the NFL method, it helps to achieve a better performance, as evidenced by experiments.
Publish/Subscribe in a mobile enviroment
Authors: Yongqiang Huang, Hector Garcia-Molina
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

A publish/subscribe system dynamically routes and delivers events from sources to interested users, and is an extremely useful communication service when it is not clear in advance who needs what information. In this paper we discuss how a publish/subscribe system can be extended to operate in a mobile environment, where events can be generated by moving sensors or users, and subscribers can request delivery at handheld and/or mobile devices. We describe how the publish/subscribe system itself can be distributed across multiple (possibly mobile) computers to distribute load, and how the system can be replicated to cope with failures, message loss, and disconnections.
Intelligent information dissemination services in hybrid satellite-wireless networks
Authors: Eddie C. Shek, Son K. Dao, Yongguang Zhang, Darrel J. Van Buer, Giovanni Giuffrida
Venue: Mobile Networks and Applications (2000)

The need for rapid deployment and user mobility suggest the use of a hybrid satellite&dash;wireless network infrastructure for important situation awareness and emergency response applications. An Intelligent Information Dissemination Service &lpar;IIDS&rpar; has been developed to support the dissemination and maintenance of extended situation awareness throughout such a network information infrastructure in a seamless manner. One of the goals of IIDS is to transparently handle the mismatches in characteristics of satellite and terrestrial wireless networks, allow effective utilization of available bandwidth, and support timely delivery of highly relevant information. IIDS achieves the above by implementing user profile aggregation that incrementally aggregates users into communities sharing common interests to enable multicast&dash;based information dissemination. Based on the user grouping, semantic profile matching customizes information streams based on matching user group interest profiles. By taking into account expected changes in user profiles, profile&dash;oriented data dissemination achieves predictive push and caching that anticipates future user needs and minimizes latency of data request by making data available before they are explicitly requested. Finally, bandwidth&dash;aware filtering adapts information streams to resource bandwidth availability to gracefully hide the bandwidth mismatch between the satellite and wireless links in the hybrid network infrastructure. The IIDS software has been deployed on the Digital Wireless Battlefield Network &lpar;DWBN&rpar; that integrates commercial off&dash;the&dash;shelf satellite and wireless products into a heterogeneous satellite&sol;wireless hybrid network for supporting wireless mobile multimedia services.
Efficient Detection of Vacuity in Temporal Model Checking
Authors: Ilan Beer, Shoham Ben-David, Cindy Eisner, Yoav Rodeh
Venue: Formal Methods in System Design (2001)

The ability to generate a counter-example is an important feature of model checking tools, because a counter-example provides information to the user in the case that the formula being checked is found to be non-valid. In this paper, we turn our attention to providing similar feedback to the user in the case that the formula is found to be valid, because valid formulas can hide real problems in the model. For instance, propositional logic formulas containing implications can suffer from antecedent failure, in which the formula is trivially valid because the pre-condition of the implication is not satisfiable. We call this vacuity, and extend the definition to cover other kinds of trivial validity. For non-vacuously valid formulas, we define an interesting witness as a non-trivial example of the validity of the formula. We formalize the notions of vacuity and interesting witness, and show how to detect vacuity and generate interesting witnesses in temporal model checking. Finally, we provide a practical solution for a useful subset of ACTL formulas.
Use of the concept of transparency in the design of hierarchically structured systems
Authors: D. L. Parnas, D. P. Siewiorek
Venue: Communications of the ACM (1975)

This paper deals with the design of hierarchically structured programming systems. It develops a method for evaluating the cost of requiring programmers to work with an abstraction of a real machine. A number of examples from hardware and software are given as illustrations of the method.
Unitary operators for fast latent semantic indexing (FLSI)
Authors: Eduard Hoenkamp
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Latent Semantic Indexing (LSI) dramatically reduces the dimension of the document space by mapping it into a space spanned by conceptual indices. Empirically, the number of concepts that can represent the documents are far fewer than the great variety of words in the textual representation. Although this almost obviates the problem of lexical matching, the mapping incurs a high computational cost compared to document parsing, indexing, query matching, and updating. This paper shows how LSI is based on a unitary transformation, for which there are computationally more attractive alternatives. This is exemplified by the Haar transform, which is memory efficient, and can be computed in linear to sublinear time. The principle advantages of LSI are thus preserved while the computational costs are drastically reduced.
Implementing atomic objects in a dynamic environment
Authors: Nancy Lynch
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

This talk will describe a new algorithm for implementing atomic objects in distributed settings where processes may fail (by stopping), and may also join and leave voluntarily. This strategy builds on Lamport's Paxos algorithm, and also on work by [Yeger-Lotem, Keidar, Dolev] and [De Prisco, Fekete, Lynch, Shvartsman] on view-oriented group communication. Lamport's Paxos algorithm (as described in his paper &ldquo;The Part-Time Parliament&rdquo;) implements atomic objects using repeated executions of a consensus protocol to maintain consistency of object replicas. The consensus executions are managed by a leader process, assisted by read and write quorums of processes. The algorithm has the nice feature that safety properties are guaranteed to hold even in the presence of timing or failure anomalies, and even if more than one process acts as a leader. On the other hand, termination and timing guarantees do depend on failure and timing assumptions. The basic Paxos algorithm is designed for use in a static group of processes, with fixed membership. A dynamic version of the algorithm is mentioned briefly, but not developed in detail. The basic idea of our new dynamic algorithm is to separate issues of system reconfiguration from issues of performing updates within each particular configuration. The reconfiguration aspects include electing a new leader when the old leader fails, changing the sets of read and write quorums, and changing the set of participants. We handle all of these using reconfiguration ideas from view-oriented group communication. Within each configuration, we use a simplified version of basic Paxos that uses a single leader. Based on joint work with Roberto De Prisco.
Text summarization via hidden Markov models
Authors: John M. Conroy, Dianne P. O'leary
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

A sentence extract summary of a document is a subset of the document's sentences that contains the main ideas in the document. We present an approach to generating such summaries, a hidden Markov model that judges the likelihood that each sentence should be contained in the summary. We compare the results of this method with summaries generated by humans, showing that we obtain significantly higher agreement than do earlier methods.
Two methods for word inversion on the IBM 709: method 1
Authors: Robert A. Price
Venue: Communications of the ACM (1960)

In some logical problems it is necessary or convenient to invert the bit structure of a word, i.e., replace bit i by bit n + 1 - i for i = 1, 2, &middot;&middot;&middot;, n, thus creating a mirror image. The method described here exploits the CAQ instruction of the IBM 709 (or 7090) to accomplish such an inversion rapidly (n = 36). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
String realizers of posets with applications to distributed computing
Authors: Vijay K. Garg, Chakarat Skawratananond
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

In this paper, we show the connection between vector clocks used in distributed computing and dimension theory of partially ordered sets. Based on this connection, we provide lower bounds on the number of coordinates for timestamping events in a distributed computation for capturing the happened- before relation. To this end, we introduce the notion of a string realizer and the string dimension of a poset. For distributed computing and other applications, the concept of string realizer is more natural than the chain realizer used in the classical dimension theory. We establish the relationship between the string dimension and the chain dimension of a poset. Using this relationship and Dilworth's theorem for the chain dimension of finite distributive lattices, we obtain the desired lower bound. The concept of strings also has applications in efficient encoding of partial orders because it requires fewer bits to encode a string realizer than a chain realizer.
Representation of many-sided polygons and polygonal lines for rapid processing
Authors: Warren Burton
Venue: Communications of the ACM (1977)

A representation for polygons and polygonal lines is described which allows sets of consecutive sides to be collectively examined. The set of sides are arranged in a binary tree hierarchy by inclusion. A fast algorithm for testing the inclusion of a point in a many-sided polygon is given. The speed of the algorithm is discussed for both ideal and practical examples. It is shown that the points of intersection of two polygonal lines can be located by what is essentially a binary tree search. The algorithm and a practical example are discussed. The representation overcomes many of the disadvantages associated with the various fixed-grid methods for representing curves and regions.
Usability analysis with Markov models
Authors: Harold Thimbleby, Paul Cairns, Matt Jones
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2001)

How hard to users to find interactive devices to use to achieve their goals, and how can we get this information early enough to influence design? We show that Markov modeling can obtain suitable measures, and we provide formulas that can be used for a large class of systems. We analyze and consider alternative designs for various real examples. We introduce a &ldquo;knowledege/usability graph,&rdquo; which shows the impact of even a smaller amount of knowledge for the user, and the extent to which designers' knowledge may bias their views of usability. Markov models can be built into design tools, and can therefore be made very convenient for designers to utilize. One would hope that in the future, design tools would include such mathematical analysis, and no new design skills would be required to evaluate devices. A particular concern of this paper is to make the approach accessible. Complete program code and all the underlying mathematics are provided in appendices to enable others to replicate and test all results shown.