ppxscal/embedding_network huggingface dataset:
A vector-pipeline DSP for low-rate videophones
Authors: Kazutoshi Kobayashi, Makoto Eguchi, Takuya Iwahashi, Takehide Shibayama, Xiang Li, Kousuke Takai, Hidetoshi Onodera
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

We propose a vector-pipeline processor VP-DSP for low-rate videophones, which can encode and decode 10 frames/sec. of QCIF through a 29.2kbps low-rate line. We have already fabricated a VP-DSP LSI by a 0.35 um CMOS process. The area of the VP-DSP core is 4.2mm. It works properly at 25MHz/1.6V with the power dissipation of 49mW. Its peak performance is up to 400MOPS, 8.2GOPS/W.
Improving automatic Chinese text categorization by error correction
Authors: Jhy-Jong Tsay, Jing-Doo Wang
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In this paper we use the miss-classified news in training data as a feedback to improve the classification accuracy. We isolate the miss-classified news from the news of original classes to form new subclasses, and modify Rocchio linear classifier by using the subclasses to form new prototype vectors such that there are more than one centroid to represent each class. We have two methods, error threshold and entropy threshold, to evaluate whether the isolation of miss-classified news is worthy or not. Experimental result shows that our approaches improves Rocchio's micro-level accuracy and achieves similar performance as kNN, but with less classification time. On the other hand, with the entropy of miss- classified news, we can figure out the ambiguity between classes and sketch the diagram of the relationship between classes as a suggestion to reorganize the structure of classes for news in the future.
Computer matching: should it be banned?
Authors: Gene Dallaire
Venue: Communications of the ACM (1984)

Since discovering the technique of computer matching several years ago, government managers have been invoking this computer tool in the attempt to root out waste and fraud in their programs. Is computer matching an indispensable tool for government administrators? Or a trampling on individual rights? In the following articles, two experts debate the pros and cons.
The greedy path-merging algorithm for sequence assembly
Authors: Daniel H. Huson, Knut Reinert, Eugene Myers
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Two different approaches to determining the human genome are currently being pursued: one is the &ldquo;clone-by-clone&rdquo; approach, employed by the publicly-funded. Human Genome Project, and the other is the &ldquo;whole genome shotgun&rdquo; approach, favored by researchers at Celera Genomics. An interim strategy employed at Celera, called hierarchical assembly, makes use of preliminary data produced by both approaches. This paper introduces the Bactig Ordering Problem, which is a key problem that arises in this context, and presents an efficient heuristic called the greedy path-merginq algorithm that performs well on real data.
The implementation and performance of compressed databases
Authors: Till Westmann, Donald Kossmann, Sven Helmer, Guido Moerkotte
Venue: ACM SIGMOD Record (2000)

In this paper, we show how compression can be integrated into a relational database system. Specifically, we describe how the storage manager, the query execution engine, and the query optimizer of a database system can be extended to deal with compressed data. Our main result is that compression can significantly improve the response time of queries if very light-weight compression techniques are used. We will present such light-weight compression techniques and give the results of running the TPC-D benchmark on a so compressed database and a non-compressed database using the AODB database system, an experimental database system that was developed at the Universities of Mannheim and Passau. Our benchmark results demonstrate that compression indeed offers high performance gains (up to 50%) for IO-intensive queries and moderate gains for CPU-intensive queries. Compression can, however, also increase the running time of certain update operations. In all, we recommend to extend today's database systems with light-weight compression techniques and to make extensive use of this feature.
Do we really teach abstraction?
Authors: Paolo Bucci, Timothy J. Long, Bruce W. Weide
Venue: ACM SIGCSE Bulletin (2001)

Abstraction is one of the cornerstones of software development and is recognized as a fundamental and essential principle to be taught as early as CS1/CS2. Abstraction supposedly can enhance students' ability to reason and think. Yet we often hear complaints about the inability of CS undergraduates to do that. Do we supply students with the tools they need to reach their potential to think carefully and to reason rigorously about software behavior? Typically we do not, but as educators there are techniques we can use to help our students develop such skills starting in CS1/CS2.
A western view of computer history
Authors: Richard E. Sprague
Venue: Communications of the ACM (1972)

Many U.S. histories of the digital computer field have tended to be impersonal, with heavy emphasis on eastern universities and commercial developments. This article records the events of the early years in a personal way. The people, organizations, technologies, and computers of the 1945-55 period in the western part of the United States are described as they happened.
On finding minimum routes in a network with turn penalties
Authors: Tom Caldwell
Venue: Communications of the ACM (1961)

In some highway engineering work it is necessary to find a route between two points in a city's street and freeway network such that a function of time and distance is minimized. Such a route is called a &ldquo;best&rdquo; route, and finding such a route is not a difficult task. The Moore Algorithm1 accomplishes this quite nicely, and using that algorithm and a procedure developed by Hoffman and Pavley2 (programmed by them for the IBM 650) it is even possible to find the &ldquo;Nth best path.&rdquo;
Monitors: an operating system structuring concept
Authors: C. A. R. Hoare
Venue: Communications of the ACM (1974)

This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule. Illustrative examples include a single resource scheduler, a bounded buffer, an alarm clock, a buffer pool, a disk head optimizer, and a version of the problem of readers and writers.
A Web-based browsing and spatial analysis system for regional natural resource analysis and mapping
Authors: Ranga Raju Vatsavai, Thomas E. Burk, B. Tyler Wilson, Shashi Shekhar
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

Proper use and monitoring of our land and environmental resources for quality of life and sustainable growth considerations require that timely and accurate data on land cover and land use be regularly available. Remote sensing is an appropriate tool and NOAA's 1-km AVHRR time series imagery has proven to be an invaluable input for regional level natural resource mapping and monitoring. Many previous efforts addressing the use of satellite-derived data for land cover and land use classification have resulted in the development of useful products. However, they have seldom been widely applied due to the lack of an efficient and easy-to-use delivery mechanism. The World Wide Web has become popular as a vehicle for information distribution and client/server applications. Web GIS is rapidly evolving and adapting to advances in Internet technologies. Web GISes are predominantly designed under a &ldquo;thin-client / fat-server&rdquo; paradigm. This approach has several disadvantages. For example, as the number of users increases, the load on the server increases and system performance decreases. Recently the focus has been shifted towards client-side Web GIS. In this paper we present a balanced client/server Web-based spatial analysis system and evaluate its performance in a regional natural resource mapping and analysis application which utilizes biweekly AVHRR imagery and several other raster and vector geospatial datasets. We also evaluate alternative approaches and assess the pros and cons of our design and implementation.
Dealing with interoperability for agent-based services
Authors: Patricia Charlton, David Bonnefoy, Nicolas Lhuillier
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Interoperability problems occur when developing agent systems with a strong notion of autonomy while interacting with other agents. The agent platform has become the intelligent distributed operating system for agent applications and therefore the support of much of the interoperability between agents will be through the platforms themselves. With the possibility of inter- platform interoperability comes support for open services that goes beyond current open agent architectures. This paper looks at the design issues of interoperability that need to be addressed on both the communication and application levels. It identifies solutions to some of these issues and defines a set of components, which are implemented and tested as a toolkit, in order to support Open Agent Service Architecture development and deployment.
The Capacitated K-Center Problem
Authors: Samir Khuller, Yoram J. Sussmann
Venue: SIAM Journal on Discrete Mathematics (2000)

The capacitated K-center problem is a basic facility location problem, where we are asked to locate K facilities in a graph and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation algorithms for two different versions of this problem that achieve approximation factors of 5 and 6. We also study some generalizations of this problem.
Scheduling Classes on a College Campus
Authors: Perry Fizzano, Steven Swanson
Venue: Computational Optimization and Applications (2000)

We consider the problem of scheduling a set of classes to classrooms with the objective of minimizing the number of classrooms used. The major constraint that we must obey is that no two classes can be assigned to the same classroom at the same time on the same day of the week. We present an algorithm that produces a nearly optimal schedule for an arbitrary set of classes. The algorithm's first stage produces a packing of classes using a combination of a greedy algorithm and a non-bipartite matching and the second stage consists of a bipartite matching.First we show that for one variant of the problem our algorithm produces schedules that require a number of classrooms that is always within a small additive constant of optimal. Then we show that for an interesting variant of the problem the same algorithm produces schedules that require a small constant factor more classrooms than optimal. Finally, we report on experimental results of our algorithm using actual data and also show how to create schedules with other desirable characteristics.
An international common project: implementation phase
Authors: Shiva Azadegan, Chao Lu
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

To better prepare students to work in globally distributed organizations, to develop effective communication skills to deal with the communication barriers that are inherent in such settings and to provide students with the opportunity to be involved in a complete software development cycle of a "real-world" project, from design to integration and testing, we have developed a course based on an "International Common Project" (ICP) model [3] of the US-EC (European Community) Consortium "Towards a Common Computer Science Curriculum and Mutual Degree Recognition" [1]. The course is scheduled for the Spring Semester, 2001, and Towson University, Maryland, USA and Evry University, France, will participate in this project.
Study of shot length and motion as contributing factors to movie tempo (poster session)
Authors: Brett Adams, Chitra Dorai, Svetha Venkatesh
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This work seeks to lay the framework of film grammar over the video to be analysed. We use the shot attributes of motion and shot length to produce a novel continuous measure of one of the aesthetic elements of films, namely the movie tempo. We refer to our previous work detailing the study of this construct and its automatic derivation, and also demonstrating its usefulness as an expressive element and as a sound basis for higher semantic descriptions such as dramatic events and story elements. Initial assessment of tempo was performed in our study on the basis that the relative importance of both shot length and motion in formulating the tempo function was the same. In this paper, we analyze their relative contributions to tempo, and demonstrate how these two factors can be manipulated to influence audience perception of movie time.
Design and Implementation of the ROL Deductive Object-Oriented Database System
Authors: Mengchi Liu
Venue: Journal of Intelligent Information Systems (2000)

ROL is a deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language for defining, manipulating and querying databases, which integrates important features of both deductive databases and object-oriented databases. It supports object identity, complex objects, classes, class hierarchies, multiple inheritance with overriding and blocking, and schema definition. It also supports structured values such as functor objects and sets, treating them as first class citizens, and providing powerful mechanisms for representing both partial and complete information about sets. This paper describes its design and implementation. An important novel feature of the implementation is that it combines top-down and bottom-up evaluation strategies and automatically selects a strategy based on the nature of the query and data in the database.
Microprocessor and microcomputer interfacing an excellent elective course for CS majors
Authors: Mohamad H. Ahmadian
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

This paper introduces a microprocessor and microcomputer interfacing course that may be included in the elective portion of a CS degree-plan. This course can be taught in either the computer science or electronics department. Upon successful completion of this course, students should have a clear understanding of microprocessors and interfacing concepts. Prior to studying the materials in this course, students should have completed a one-semester course in the general study of microprocessors, or a one-semester course in procedural programming using a structured language like C.
Computer networks in higher education: socio-economic-political factors
Authors: Jack A. Chambers, Ray V. Poore
Venue: Communications of the ACM (1975)

This study presents the results of a nationwide survey of computer networks in higher education conducted during 1971-73. Five major and 18 minor networks were identified. The five major networks included: the ARPA Net, the California State College network, the University of Iowa/Iowa State University network, the Michigan Educational Research Information Triad, Inc., and the Triangle Universities Computation Center network in North Carolina. In-depth studies were conducted of the latter two nets. Based on the experiences of these operating networks, a number of factors are identified for consideration in developing networks. Finally, recommendations are advanced regarding the development of networks in higher education in the future.
Fast parallel sorting algorithms
Authors: D. S. Hirschberg
Venue: Communications of the ACM (1978)

A parallel bucket-sort algorithm is presented that requires time O(log n) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort n numbers in time O(k log n) using n1+1/k processors, for k an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.
Computers and society: a proposed course for computer scientists
Authors: E. Horowitz, H. L. Morgan, A. C. Shaw
Venue: Communications of the ACM (1972)

The purpose of this paper is to describe a course concerned with both the effects of computers on society and the responsibilities of computer scientists to society. The impact of computers is divided into five components: political, economic, cultural, social, and moral; the main part of the paper defines each component and presents examples of the relevant issues. In the remaining portions the possible formats for such a course are discussed, a topic by topic outline is given, and a selected set of references is listed. It is hoped that the proposal will make it easier to initiate courses on this subject.
The minimization of spatially-multiplexed character sets
Authors: James F. Gimpel
Venue: Communications of the ACM (1974)

The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques are developed, and the problem is shown to reduce to a covering problem.
Automatic error recovery for LR parsers
Authors: M. Dennis Mickunas, John A. Modry
Venue: Communications of the ACM (1978)

In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser. The approach, which is patterned after that of Levy and Graham and Rhodes, appears to provide error recovery which is both simple and powerful.
On Interpolation and Automatization for Frege Systems
Authors: Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Venue: SIAM Journal on Computing (2000)

The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this paper, we show that this method cannot be used to obtain lower bounds for Frege systems, or even for TC0-Frege systems. More specifically, we show that unless factoring (of Blum integers) is feasible, neither Frege nor TC0-Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial-sized TC0-Frege.As a corollary, we obtain that TC0-Frege, as well as any proof system that polynomially simulates it, is not automatizable (under the assumption that factoring of Blum integers is hard). We also show under the same hardness assumption that the k-provability problem for Frege systems is hard.
The state of the art in distributed query processing
Authors: Donald Kossmann
Venue: ACM Computing Surveys (CSUR) (2000)

Distributed data processing is becoming a reality. Businesses want to do it for many reasons, and they often must do it in order to stay competitive. While much of the infrastructure for distributed data processing is already there (e.g., modern network technology), a number of issues make distributed data processing still a complex undertaking: (1) distributed systems can become very large, involving thousands of heterogeneous sites including PCs and mainframe server machines; (2) the state of a distributed system changes rapidly because the load of sites varies over time and new sites are added to the system; (3) legacy systems need to be integrated&mdash;such legacy systems usually have not been designed for distributed data processing and now need to interact with other (modern) systems in a distributed environment. This paper presents the state of the art of query processing for distributed database and information systems. The paper presents the &ldquo;textbook&rdquo; architecture for distributed query processing and a series of techniques that are particularly useful for distributed database systems. These techniques include special join techniques, techniques to exploit intraquery paralleli sm, techniques to reduce communication costs, and techniques to exploit caching and replication of data. Furthermore, the paper discusses different kinds of distributed systems such as client-server, middleware (multitier), and heterogeneous database systems, and shows how query processing works in these systems.
Distributed BIST Architecture to Combat Delay Faults
Authors: Jacob Savir
Venue: Journal of Electronic Testing: Theory and Applications (2000)

To successfully combat delay faults there is an urgent need for a proper design for testability (DFT). The foundation of any DFT methodology rests on its scan design. This paper describes three versions of a new design of a shift register latch that lend themselves to distributed self-test and delay test. The advantages of this new SRL is faster application of test vectors, higher DC and AC fault coverages, with low performance impact. Adoption of this new DFT methodology brings us closer to the ideal target of one test-per-clock as opposed to one test-per-scan. Operation, cost, and other attributes are studied in detail. Results of adopting one of these SRLs are reported on ten pilot chips.
Rectilinear block packing using O-tree representation
Authors: Yingxin Pang, Chung-Kuan Cheng, Koen Lampaert, Weize Xie
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

In this paper we extend the O-tree approach to handle rectilinear blocks. First we explore the properties of L-shaped blocks, then decompose rectilinear blocks into a set of sub-L-shaped-blocks. The properties of L-shaped blocks can be applied to general rectiðlinear blocks. In order to explore the optimal search thoroughly, we generate four direction O-trees. A heuristic optimization algorithm based on the four direction O-trees produces very good experiment results.
A location-aware graphical BBS for mobile environments
Authors: Germano Leichsenring, Kazutoshi Sumiya, Kuniaki Uehara
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

We propose a graphical BBS which can handle the user's current location. In the system, a BBS room is related to a real object. Each BBS comment has a valid time and an influence area decided automatically. The user's location then influences the system based on the user's movements to display comments on the user's screen. The influence area changes according to external events such as emergencies to express the importance and area of effect of the comment at the present time. Furthermore, we discuss the implement issues of the prototype system.