ppxscal/embedding_network huggingface dataset:
Video scouting demonstration: smart content selection and recording
Authors: Nevenka Dimitrova, Lalitha Agnihotri, Radu Jasinschi, John Zimmerman, George Marmaropoulos, Thomas McGee, Serhan Dagtas
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Smart video content selection and recording is the best selling feature of the current personal TV receivers like TiVo. These devices operate at the TV program level in that they use electronic program guides and user's program personal preferences to help consumers record and watch programs that match their interests. In this Video Scouting demonstration, we present a system that allows for the filtering and retrieving of TV sub-programs based on user's content preferences. The filtering process is realized via real-time video, audio, and transcript analysis. The demonstrator personalizes the TV experience in the areas of celebrity and financial information. The technology can translate into differentiating storage and set-top box product features for finding your favorite actors, most interesting personalized financial news of the day, commercial compaction and enhancement, and content augmentation with other sources of information such as Web pages and encyclopedia. The demonstrator also reflects our active involvement in the MPEG-7 standard (Content Description Interface).
Probabilistic noninterference in a concurrent language
Authors: Dennis Volpano, Geoffrey Smith
Venue: Journal of Computer Security (1999)

In previous work (Smith and Volpano, Proceedings 25th Symposium on Principles of Programming Languages, San Diego, CA, 1998, pp. 355-364), we give a type system that guarantees that well-typed multi-threaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, however, then well-typed programs may have probabilistic timing channels. We describe how they can be eliminated without making the type system more restrictive. We show that well-typed concurrent programs are probabilistically noninterfering if every total command with a guard containing high variables executes atomically. The proof uses the notion of a probabilistic state of a computation from Kozens work in the denotational semantics of probabilistic programs (Kozen, Journal of Computer and System Sciences 22 (1981), 328-350).^{2}
Processes (panel session): the roles of ceremony and adaptation
Authors: Brian Henderson-Sellers, Norm Kerth, Alistair Cockburn, Don Firesmith, Steve Mellor
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

As industry begins to invest in OO/CBD (Component-Based Development) processes and the OMG considers whether/how to standardize on process, many issues arise. Those to be debated include process framework versus process; high ceremony versus low ceremony; the need for flexibility and tailorability; and the role of automation.
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems
Authors: Philippas Tsigas, Yi Zhang
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this paper. The algorithm is very simple, fast and scales very well in both symmetric and non-symmetric multiprocessor shared memory systems. Experiments on a 64-node SUN Enterprise 10000 &mdash; a symmetric multiprocessorsystem &mdash; and on a 64-node SGI Origin 2000 &mdash; a cache coherent non uniform memory access multiprocessorsystem &mdash; indicate that our algorithm considerably outperforms the best of the known alternatives in both multiprocessors in any level of multiprogramming. This work introduces two new, simple algorithmic mechanisms. The first lowers the contention to key variables used by the concurrent enqueue and/or dequeue operations which consequently results in the good performance of the algorithm, the second deals with the pointer recycling problem, an inconsistency problem that all non-blocking algorithms based on the compare-and-swap synchronisation primitive have to address. In our construction we selected to use compare-and-swap since compare-and-swap is an atomic primitive that scales well under contention and either is supported by modern multiprocessors or can be implemented efficiently on them.
Remote office work: changing work patterns in space and time
Authors: Margrethe H. Olson
Venue: Communications of the ACM (1983)

Remote work refers to organizational work that is performed outside of the normal organizational confines of space and time. The term telecommuting refers to the substitution of communications capabilities for travel to a central work location. Office automation technology permits many office workers to be potential telecommuters in that their work can be performed remotely with computer and communications support. This paper examines some behavioral, organizational, and social issues surrounding remote work, particularly work at home. An exploratory study was conducted of 32 organizational employees who were working at home. Important characteristics of jobs that can be performed at home were: minimum physical requirements, individual control over work pace, defined deliverables, a need for concentration, and a relatively low need for communication. The individuals who worked at home successfully were found to be highly self-motivated and self-disciplined and to have skills which provided them with bargaining power. They also made the arrangement either because of family requirements or because they preferred few social contacts beyond family.
Real-Time Transport of MPEG Video with a Statistically Guaranteed Loss Ratio in ATM Networks
Authors: Seok-Kyu Kweon, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Unlike deterministic real-time communication in which excessive resources may be required for ¿absolute¿ performance guarantees, statistical real-time communication seeks to achieve both probabilistic performance guarantees and efficient resource sharing. This paper presents a framework for statistical real-time communication in ATM networks, providing delay-guaranteed transport of MPEG-coded video traffic with a statistically-guaranteed cell-loss ratio. Delay-guaranteed communication is achieved with a modified version of Traffic-Controlled Rate-Monotonic Priority Scheduling (TCRM). A set of statistical real-time channels that share similar traffic characteristics are multiplexed into a common macrochannel. Those statistical real-time channels which are multiplexed together share the resources of a macrochannel, and individual statistical real-time channels are given timeliness and probabilistic cell-loss guarantees. A macrochannel is serviced by the modified TCRM which improves link utilization and makes channel management simpler. Based on the analysis of an $M/D/1/N$ queueing system, we propose a procedure for determining the transmission capacity of a macrochannel necessary to statistically guarantee a cell-loss ratio bound. Our extensive trace-driven simulation has shown the superiority of the proposed framework to the other approaches. The overall cell-loss ratios for multihop statistical real-time channels are shown to be smaller than the predetermined bounds, thus verifying our analytical results.
Monotone paths in line arrangement
Authors: Radovs Radoicić, Géza Tóth
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We show that for any $n$ there is an arrangement of $n$ lines which co ntain an $x$-monotone path of length $\Omega(n^{7/4})$.
FLASH vs. (simulated) FLASH: closing the simulation loop
Authors: Jeff Gibson, Robert Kunz, David Ofelt, Mark Horowitz, John Hennessy, Mark Heinrich
Venue: ACM SIGPLAN Notices (2000)

Simulation is the primary method for evaluating computer systems during all phases of the design process. One significant problem with simulation is that it rarely models the system exactly, and quantifying the resulting simulator error can be difficult. More importantly, architects often assume without proof that although their simulator may make inaccurate absolute performance predictions, it will still accurately predict architectural trends.This paper studies the source and magnitude of error in a range of architectural simulators by comparing the simulated execution time of several applications and microbenchmarks to their execution time on the actual hardware being modeled. The existence of a hardware gold standard allows us to find, quantify, and fix simulator inaccuracies. We then use the simulators to predict architectural trends and analyze the sensitivity of the results to the simulator configuration. We find that most of our simulators predict trends accurately, as long as they model all of the important performance effects for the application in question. Unfortunately, it is difficult to know what these effects are without having a hardware reference, as they can be quite subtle. This calls into question the value, for architectural studies, of highly detailed simulators whose characteristics are not carefully validated against a real hardware design.
Dynamic partitioning for array languages
Authors: J. Richard Phillips, H. C. Adams
Venue: Communications of the ACM (1972)

The classical process of partitioning an array into subarrays is extended to a more useful array language operation. Various modes of partitioning are defined for different types of arrays, so that subarrays may vary over the original array in a nearly arbitrary manner. These definitions are motivated with several realistic examples to illustrate the value of partitioning for array languages. Of general interest is the data structure for partitioning. This consists of dynamic tree structures which are used to derive and maintain the array control information. These are described in sufficient detail to be of value in the design of other array languages. The description presented in this paper is implemented in a new array language, OL/2, currently under development at the University of Illinois.
Spline function methods for nonlinear boundary-value problems
Authors: James L. Blue
Venue: Communications of the ACM (1969)

The solution of the nonlinear differential equation Y&Prime; = F(x, Y, Y&prime;) with two-point boundary conditions is approximated by a quintic or cubic spline function y(x). The method is well suited to nonuniform mesh size and dynamic mesh size allocation. For uniform mesh size h, the error in the quintic spline y(x) is O(h4), with typical error one-third that from Numerov's method. Requiring the differential equation to be satisfied at the mesh points results in a set of difference equations, which are block tridiagonal and so are easily solved by relaxation or other standard methods.
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data
Authors: Christian Böhm, Bernhard Braunmüller, Florian Krebs, Hans-Peter Kriegel
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The similarity join combines two point sets of a multidimensional vector space such that the result contains all point pairs where the distance does not exceed a parameter &egr;. In this paper, we propose the Epsilon Grid Order, a new algorithm for determining the similarity join of very large data sets. Our solution is based on a particular sort order of the data points, which is obtained by laying an equi-distant grid with cell length &egr; over the data space and comparing the grid cells lexicographically. A typical problem of grid-based approaches such as MSJ or the &egr;-kdB-tree is that large portions of the data sets must be held simultaneously in main memory. Therefore, these approaches do not scale to large data sets. Our technique avoids this problem by an external sorting algorithm and a particular scheduling strategy during the join phase. In the experimental evaluation, a substantial improvement over competitive techniques is shown.
Virtual reality as telemedicine tool: technology, ergonomics and actual applications
Authors: Giuseppe Riva, Lucio Gamberini
Venue: Technology and Health Care (2000)

This paper surveys the state of the art in telemedicine applications of virtual environments (VEs) and related technologies for health care. The possible use of VEs as telemedicine tool has attracted much interest in medicine. Actually this technology is commonly used in remote or augmented surgery, and surgical training, which are critically dependent upon eye-hand coordination. Recently, however, different researchers have tried to use VEs in anatomic learning and for the assessment and rehabilitation in neuro-psychology. To date, such applications have improved the quality of health care, and later they will lead to substantial cost savings. Tools that respond to the needs of present VE systems are being refined or developed. However, the possible use of VEs in telemedicine is not linked to the solution of technical problems only. In fact telemedicine is not simply a technology but a complex process whose successful exploitation needs significant attention to ergonomics, human factors and organizational changes in the structure of the relevant health service.
Automatic segmentation of text into structured records
Authors: Vinayak Borkar, Kaustubh Deshmukh, Sunita Sarawagi
Venue: ACM SIGMOD Record (2001)

In this paper we present a method for automatically segmenting unformatted text records into structured elements. Several useful data sources today are human-generated as continuous text whereas convenient usage requires the data to be organized as structured records. A prime motivation is the warehouse address cleaning problem of transforming dirty addresses stored in large corporate databases as a single text field into subfields like &ldquo;City&rdquo; and &ldquo;Street&rdquo;. Existing tools rely on hand-tuned, domain-specific rule-based systems. We describe a tool DATAMOLD that learns to automatically extract structure when seeded with a small number of training examples. The tool enhances on Hidden Markov Models (HMM) to build a powerful probabilistic model that corroborates multiple sources of information including, the sequence of elements, their length distribution, distinguishing words from the vocabulary and an optional external data dictionary. Experiments on real-life datasets yielded accuracy of 90% on Asian addresses and 99% on US addresses. In contrast, existing information extraction methods based on rule-learning techniques yielded considerably lower accuracy.
Algorithm 27: assignment
Authors: Roland Silver
Venue: Communications of the ACM (1960)

The assignment problem is formulated and briefly discussed. An efficient algorithm for its solution is presented in ALGOL code. An empirical relation between solution time and the size of the problem is given, based on extensive experiments carried out on a digit computer.
Computer science faculties: the current status of minorities and women
Authors: Sandra A. Mamrak, Richard G. Montanelli,  Jr.
Venue: Communications of the ACM (1978)

The results of a survey conducted in the fall of 1975 to determine the status of women and minority faculty members in academic computer science are presented. Faculty members were compared with respect to professional background, salaries, teaching load, publication records, and research grants. Analysis of the data indicated that the over-all verdict is one of general equality among women, minorities, and men.
An evaluation of statistical software in the social sciences
Authors: William D. Slysz
Venue: Communications of the ACM (1974)

Several hundred college and university computer installations now offer various types of statistical packages for general use. Among those most widely available are OSIRIS, SPSS, BMD, DATA-TEXT, and TSAR. In order to provide users with a basis for selection and use, tests were made for each of these systems, and the results are summarized as to cost and performance.
UML classes diagrams and agent-based systems
Authors: Bernhard Bauer
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper illustrates the next steps of AUML by presenting a (A) UML presentation of the internal behavior of an agent and relating it to be external behavior of an agent using and extending UML class diagrams engineering.
SURFing the home with your TV
Authors: Dimitrios Voutsas, Christine Halverson
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

SURF (Simple UI to Retrieve Favorites) is a system with which a user can interact, through a TV, both with electronic devices inside the house and with the World Wide Web (WWW). The user communicates with the TV by voice in two modes: reactive and proactive. We illustrate how, by speaking naturally, the user can check on locations in the home, or get information from appliances and specific information from the Internet, in a manner that does not interrupt the TV viewing experience.
Pass-algorithms: a user validation scheme based on knowledge of secret algorithms
Authors: James A. Haskett
Venue: Communications of the ACM (1984)

A superset of the secondary passwords technique, pass-algorithms provide enormous flexibility and ease of implementation and represent an attractive alternative to more costly systems security features and equipment. The method validates users who demonstrate knowledge of a secret algorithm rather than a password.
Mediazine - a combination of television, radio, WWW, telecommunication and 3D computer sound and graphics
Authors: Norbert Schiffner, Hartmut Chodura
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

The Mediazine is a distributed interactive multimedia magazine for the Internet including text, applications, images, live audio, live-video, animations, 3D computer graphics. Users and Actors can interactively meet each other in a shared virtual environment that is distributed via computer network. The system uses high quality multimedia streams. For the playback of audio an own developed Spatial Audio Server is used. On one hand it provides output lor the communication system, an Internet-Telephone. On the other hand it manages sound of applications like TV and radio. Additionally spatialized binaural output is provided for the sound: In the virtual environment participants speech the can be located from where their avatars are placed. The participant's sound is coming from the place where the video is presented. The paper describes how the system is built. It focuses on the mechanism of controlling the amount and quality of multimedia information on behalf of the network and the receiver system. Furthermore, the paper discusses how agents can be integrated as components in the system that is organized as an object-oriented application framework. Authors can take advantage of this concept specifying the agent's behavior efficiently in a target domain specific way. Finally, a prototype implementation of the mediazine system is presented.
Programmers use slices when debugging
Authors: Mark Weiser
Venue: Communications of the ACM (1982)

Computer programmers break apart large programs into smaller coherent pieces. Each of these pieces: functions, subroutines, modules, or abstract datatypes, is usually a contiguous piece of program text. The experiment reported here shows that programmers also routinely break programs into one kind of coherent piece which is not coniguous. When debugging unfamiliar programs programmers use program pieces called slices which are sets of statements related by their flow of data. The statements in a slice are not necessarily textually contiguous, but may be scattered through a program.
On Optimal Replacement of Nonuniform Cache Objects
Authors: Saied Hosseini-Khayat
Venue: IEEE Transactions on Computers (2000)

This paper studies a generalized version of the well-known page replacement problem. It assumes that page sizes and page fault penalties are nonuniform. This problem arises in distributed information systems, in particular the World Wide Web. It is shown that finding an optimal solution of this problem is an NP-complete problem. A dynamic programming algorithm that finds an optimal solution is presented. Since this algorithm is inefficient, we explore modified algorithms that allow a trade-off between optimality and speed.
The new math of computer programming
Authors: Harlan D. Mills
Venue: Communications of the ACM (1975)

Structured programming has proved to be an important methodology for systematic program design and development. Structured programs are identified as compound function expressions in the algebra of functions. The algebraic properties of these function expressions permit the reformulation (expansion as well as reduction) of a nested subexpression independently of its environment, thus modeling what is known as stepwise program refinement as well as program execution. Finally, structured programming is characterized in terms of the selection and solution of certain elementary equations defined in the algebra of functions. These solutions can be given in general formulas, each involving a single parameter, which display the entire freedom available in creating correct structured programs.
The tangram framework (embedded tutorial): asynchronous circuits for low power
Authors: Joep Kessels, Ad Peeters
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Asynchronous CMOS circuits have the potential for very low power consumption, because they only dissipate when and where active. In addition they have favorable EMC properties, since they emit less energy, which in addition is evenly distributed over the spectrum. The Tangram framework supports the design of asynchronous circuits in a high-level programming language. Using this framework we have designed several chips, such as for instance for pagers and smart cards, which are clearly superior to synchronous designs.
Nonmetric Calibration of Wide-Angle Lenses and Polycameras
Authors: Rahul Swaminathan, Shree K. Nayar
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Images taken with wide-angle cameras tend to have severe distortions which pull points towards the optical center. This paper proposes a simple method for recovering the distortion parameters without the use of any calibration objects. Since distortions cause straight lines in the scene to appear as curves in the image, our algorithm seeks to find the distortion parameters that map the image curves to straight lines. The user selects a small set of points along the image curves. Recovery of the distortion parameters is formulated as the minimization of an objective function which is designed to explicitly account for noise in the selected image points. Experimental results are presented for synthetic data as well as real images. We also present the idea of a polycamera which is defined as a tightly packed camera cluster. Possible configurations are proposed to capture very large fields of view. Such camera clusters tend to have a nonsingle viewpoint. We therefore provide analysis of what we call the minimum working distance for such clusters. Finally, we present results for a polycamera consisting of four wide-angle sensors having a minimum working distance of about $4$m. On undistorting the acquired images using our proposed technique, we create real-time high resolution panoramas.