ppxscal/embedding_network huggingface dataset:
A Primal-Dual Variant of the IRI-IMAI Algorithm for Linear Programming
Authors: Reha H. Tütüncü
Venue: Mathematics of Operations Research (2000)

A local acceleration method for primal-dual potential-reduction algorithms is introduced. The method developed here uses modified Newton search directions to minimize the Tanabe-Todd-Ye (TTY) potential function, and can be regarded as a primal-dual variant of the Iri-Imai algorithm based on the multiplicative analogue of Karmarkar's potential function. When iterates are close to an optimal solution, the TTY potential function has negative curvature along the generated search directions. Therefore, large reductions in the potential function can be obtained, guaranteeing polynomial and quadratic convergence to nondegenerate solutions.
Detection of combined occurrences
Authors: Albert L. Zobrist, Frederick R. Carlson,  Jr.
Venue: Communications of the ACM (1977)

In this paper it is supposed that the variables x1, &hellip; , xn each have finite range with the variable xi taking on pi possible values and that the values of the variables are changing with time. It is supposed further that it is desired to detect occurrences in which some subset of the variables achieve particular values. Finally, it is supposed that the problem involves the detection of a large number of combined occurrences for a large number of changes of values of variables. Two efficient solutions for this problem are described. Both methods have the unusual property of being faster for systems where the sum p1 + &hellip; + pn is larger. The first solution is error-free and suitable for most cases. The second solution is slightly more elegant and allows negation as well as conjunction, but is subject to the possibility of errors. An error analysis is given for the second method and an empirical study is reported.
Learning Patterns of Activity Using Real-Time Tracking
Authors: Chris Stauffer, W. Eric L. Grimson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Our goal is to develop a visual monitoring system that passively observes moving objects in a site and learns patterns of activity from those observations. For extended sites, the system will require multiple cameras. Thus, key elements of the system are motion tracking, camera coordination, activity classification, and event detection. In this paper, we focus on motion tracking and show how one can use observed motion to learn patterns of activity in a site. Motion segmentation is based on an adaptive background subtraction method that models each pixel as a mixture of Gaussians and uses an on-line approximation to update the model. The Gaussian distributions are then evaluated to determine which are most likely to result from a background process. This yields a stable, real-time outdoor tracker that reliably deals with lighting changes, repetitive motions from clutter, and long-term scene changes. While a tracking system is unaware of the identity of any object it tracks, the identity remains the same for the entire tracking sequence. Our system leverages this information by accumulating joint co-occurrences of the representations within a sequence. These joint co-occurrence statistics are then used to create a hierarchical binary-tree classification of the representations. This method is useful for classifying sequences, as well as individual instances of activities in a site.
Information technology and the emergence of a worker-centered organization
Authors: Patricia A. Carlson
Venue: ACM Journal of Computer Documentation (JCD) (2000)

Barbara Mirel's narrative highlights the interplay of profit, power, and personalities in a software engineering project. My response's purpose is to widen the perspective on the story. More specifically, I contend that information technology (IT) enables positive change in today s workplace. Rather than being techno-centric, the re-visions currently being brought about by IT will place the knowledge worker of the 21st century at the center of design and engineering considerations. I support my claim by identifying four trends in organizational management that will afford human factors and usability engineering a better seat at the table in the not too distant future. They are (1) requirements for next-generation IT applications, (2) improved understanding of culture and context in the workplace, (3) recognition of knowledge management and human capital, and (4)fostering strategic leadership beyond resource management.
Trace-driven system-level power evaluation of system-on-a-chip peripheral cores
Authors: Tony D. Givargis, Frank Vahid, Jörg Henkel
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Our earlier work for fast evaluation of power consumption of general cores in a system-on-a-chip described techniques that involved isolating high-level instructions of a core, measuring gate-level power consumption per instruction, and then annotating a system-level simulation model with the obtained data. In this work, we describe a method for speeding up the evaluation further, through the use of instruction traces and trace simulators for every core, not just microprocessor cores. Our method shows noticeable speedups at an acceptable loss of accuracy. We show that reducing trace sizes can speed up the method even further. The speedups allow for more extensive system-level power exploration and hence better optimization.
An optimum fitting algorithm for generation of reduced-order models
Authors: M. M. Gourary, S. G. Rusakov, S. L. Ulyanov, M. M. Zharov, B. J. Mulvaney
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

The paper presents a new approach to the problem of automatic order reducing of rational transfer function (TF). The approach is directed to obtain low-order models under criterion of minimal integral square error. The developed computational scheme allows to determine reduced model of the minimal order with the given error tolerance.
Testing SRAM-Based Content Addressable Memories
Authors: J. Zhao, S. Irrinki, M. Puri, F. Lombardi
Venue: IEEE Transactions on Computers (2000)

This paper presents an extensive model and algorithms for detecting faults in SRAM-based dual-port and uni-port CAMs (Content Addressable Memories). This model is based on analyzing the functionalities of a cell of an SRAM-based CAM and dividing it into two parts (storage and comparison parts). It is shown that faults can affect one or both parts. While storage faults can be detected using a traditional test algorithm (such as the March C), faults affecting the comparison part of the cell require a substantially different approach. A complete characterization of these faults is presented; by analyzing the structure of the cell in the dual and uni-port configurations, physical faults (such as stuck-at, stuck-open, stuck-on, bridge) in lines and transistors can be mapped to three functional fault sets by the execution of the comparison operation. Two new detection algorithms (directly compatible with the word-oriented March C algorithm, as widely used in existing commercial tools) are proposed; 100 percent coverage is achieved. The first algorithm (Concurrent Detection Algorithm or CDA) employs concurrent operations for testing a dual-port CAM; the second algorithm (Non Concurrent Detection Algorithm or NCDA) uses nonconcurrent operations and can be used for testing dual-port as well as uni-port CAMs. CDA requires eight passes and ($10N+2L$) tests, where $N$ is the number of words of the CAM and $L$ is the width of a word. NCDA requires eight passes, too, but ($12N+2L$) tests. The number of tests required by CDA (and NCDA, too) is significantly less than required by existing algorithms.
CyberCode: designing augmented reality environments with visual tags
Authors: Jun Rekimoto, Yuji Ayatsuka
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

The CyberCode is a visual tagging system based on a 2D-barcode technology and provides several features not provided by other tagging systems. CyberCode tags can be recognized by the low-cost CMOS or CCD cameras found in more and more mobile devices, and it can also be used to determine the 3D position of the tagged object as well as its ID number. This paper describes examples of augmented reality applications based on CyberCode, and discusses some key characteristics of tagging technologies that must be taken into account when designing augmented reality environments.
PACS and multimodality in medical imaging
Authors: Y. D'Asseler, M. Koole, K. Van Laere, S. Vandenberghe, L. Bouwens, R. Van de Walle, C. Van de Wiele, I. Lemahieu, R. A. Dierckx
Venue: Technology and Health Care (2000)

A PACS (Picture Archiving and Communication System) is a system that is able to store, exchange, display and manipulate images and associated diagnoses from any modality within a hospital in a timely and cost-effective way. Several developments, such as the DICOM standard, fast and convenient networking, and new storage solutions for large amounts of data, make the setup of such a PACS system possible. As the information acquired with various imaging modalities is then available and often complementary, it is desirable for the clinician to have a point-by-point spatial co-registration of images from different modalities in order to enable a synergistic use of the multimodality imaging of a patient for increased diagnostic accuracy. Various types of algorithms are available for the matching of medical images from the same or from different modalities. Co-registration algorithms based on voxel properties consist of a similarity or dissimilarity measure and an iterative or non-iterative method minimizing the dissimilarity or maximizing the similarity between the two images by a transformation of one image relative to the other.
The Purdue University network-computing hubs: running unmodified simulation tools via the WWW
Authors: Nirav H. Kapadia, José A. B. Fortes, Mark S. Lundstrom
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

This paper describes the Web interface management infrastructure of a functioning network-computing system (PUNCH) that allows users to run unmodified simulation packages at geographically dispersed sites. The system currently contains more than fifty university and commercial simulation tools, and has been used to carry out more than two hundred thousand simulations via the World Wide Web. Dynamically-constructed virtual URLs allow the Web interface management infrastructure to support the semantics associated with an interface to computing services without requiring any changes to Web browsers or WWW protocols. Virtual URLs also facilitate customizable control of access to networked resources. Simulation tools with text-based interfaces are supported via dynamically-generated, virtual interfaces, whereas tools with graphical interfaces are supported by leveraging available remote display-management technologies. Virtual interface generation and interactivity emulation are handled by a programmable state machine in conjunction with a mechanism to embed variables and ovjects within standard HTML.
A reliable multicast webcast protocol for multimedia collaboration and caching
Authors: L. Kristin Wright, Steven McCanne, Jay Lepreau
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Large-scale, multi-point, multimedia conferencing applications designed to facilitate long-distance collaboration are enjoying growing popularity. Usually composed of real-time audio, video and shared-drawing applications, these collaborative environments help render the geographical location of collaborators irrelevant. To complement these existing collaborative applications, it would be useful to have the ability to distribute documents synchronously over the World Wide Web (WWW). One model for synchronized information dissemination within the Web is webcasting in which data are simultaneously distributed to multiple destinations. The WWW's traditional unicast client/server communication model suffers, however, when applied to webcasting; solutions which require many clients to simultaneously fetch data from the origin server using the client/server model will likely cause server and link overload. A number of webcasting solutions have been proposed. Many have limited scalability because they are based on unicast while others use multicast for more scalable data delivery but require server modification or have rigid architectures. We believe that successful webcasting solutions will provide scalable, reliable delivery yet still be compatible with the existing Web infrastructure. In this paper we describe a webcast design that improves upon previous designs by leveraging application level framing (ALF) design methodology. We build upon the Scalable Reliable Multicast (SRM) framework, which is based upon ALF, to create a custom protocol to meet webcast's scalability needs. We employ the protocol in an architecture consisting of two reusable components: a webcache component and a browser control component. We have implemented our design using the MASH multimedia application toolkit and a SRM protocol module called libsrm. We present the results of a simple performance evaluation and report on lessons learned while using MASH and libsrm.
External memory BFS on undirected graphs with bounded degree
Authors: Ulrich Meyer
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We give the first external memory algorithm for breadth-first search (BFS) which achieves &Ogr;(n) I/Os on arbitrary undirected graphs with n nodes and maximum node degree d. Let M and B < d denote the main memory size and block size, respectively. Using Sort(x) = &THgr;(x&divide;B &middot; log M/B x&divide;B), our algorithm needs &Ogr;(n&divide;&ggr;&middot;logdB + Sort(n &middot; B&ggr;)) I/Os and &Ogr;(n &middot; B&ggr;) external space for an arbitrary parameter 0 < &ggr; &lne; &frac12;. The result carries over to BFS, depth-first search (DFS) and single source shortest paths (SSSP) on undirected planar graphs with arbitrary node degrees.
Objects at their best: introductory applet programming and the Java AWT
Authors: David Arnow, Gerald Weiss
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

This workshop will introduce the Java Abstract Window Toolkit. We will provide a simple framework for applet development that encompasses placement of components, display of graphical elements, and event handling. We will also introduce the Model-View-Control paradigm and apply it to the applet context, thereby bringing an important tool from object-oriented methodology to this area and laying the foundation for a study of the newer Java Swing package. Participants should be familiar with the Java programming language, though presumaly not the AWT. In addition, some familiarity with object-oriented language concepts including classes, methods, messages, inheritance, interfaces, and polymorphism (method overriding) is required.
A polynomial time optimal algorithm for simultaneous buffer and wire sizing
Authors: C. C. N. Chu, D. F. Wong
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

An interconnect joining a source and a sink is divided into fixed-length uniform-width wire segments, and some adjacent segments have buffers in between. The problem we considered is to simultaneously size the buffers and the segments so that the Elmore delay from the source to the sink is minimized. Previously, no polynomial time algorithm for the problem has been reported in literature. In this paper, we present a polynomial time algorithm \mathit{SBWS}\ for the simultaneous buffer and wire sizing problem. \mathit{SBWS}\ is an iterative algorithm with guaranteed convergence to the optimal solution. It runs in quadratic time and uses constant memory for computation. Also, experimental results show that \mathit{SBWS}\ is extremely efficient in practice. For example, for an interconnect of 10000 segments and buffers, the CPU time is only 0.127 second.
A computer technique for displaying n-dimensional hyperobjects
Authors: A. Michael Noll
Venue: Communications of the ACM (1967)

A digital computer and automatic plotter have been used to generate three-dimensional stereoscopic movies of the three-dimensional parallel and perspective projections of four-dimensional hyperobjects rotating in four-dimensional space. The observed projections and their motions were a direct extension of three-dimensional experience, but no profound "feeling" or insight into the fourth spatial dimension was obtained. The technique can be generalized to n-dimensions and applied to any n-dimensional hyperobject or hypersurface.
Data access performance in a large and dynamic pharmaceutical drug candidate database
Authors: Zina Ben-Miled, Yang Liu, Michael Bem, Robert Jones, Robert Oppelt, Samuel Milosevich, Dave Powers, Omran Bukhres
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

An explosion in the amount of data generated through chemical and biological experimentation has been observed in recent years. This rapid proliferation of vast amounts of data has led to a set of cheminformatics and bioinformatics applications that manipulate dynamic, heterogeneous and massive data. An example of such applications in the pharmaceutical industry is the computational process involved in the early discovery of lead drug candidates for a given target disease. This computational process includes repeated sequential and random accesses to a drug candidate database. Using the above pharmaceutical application, an experimental study was conducted which shows that for optimal performance, the degree of parallelism exploited in the application should be adjusted according to the drug candidate database instance size and the machine size. Additionally, different degrees of parallelism should be used depending on whether the access to the drug candidate database is random or sequential.
Assigning chain-like tasks to a chain-like network
Authors: Gerhard J. Woeginger
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We investigate the allocation of a chain-like task system consisting of n tasks to a chain-like network of m computers so as to minimize the bottleneck processing cost. We present an &Ogr;(mn) time solution algorithm for this problem. This improves on a sequence of five slower algorithms by Bokhari [1988], Sheu Chiang [1990], Hsu [1993], and Young Chan [1993,1994].
Pre-layout prediction of interconnect manufacturability
Authors: Phillip Christie, José Pineda de Gyvez
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

Functional yield is a term used to describe the percentage of dies on a wafer that fail due to catastrophic defects. Within the interconnect these defects are usually caused by particle contamination and are divided into bridging defects, which join adjacent wires, and cuts, which result in broken wires. The probability of failure is therefore determined by the geometry of the routing channels and the distribution of defect sizes. Since the wire spacing and width are usually fixed, and the distribution of defects within a mature production facility is well known, the problem reduces to estimating individual wire lengths for cuts, and to estimating the overlapping distance that two wires share in neighboring sections of the routing grid for bridges. Since the probability of failure is determined by the behavior of the wires averaged over the entire interconnect, the application of System Level Interconnect Prediction (SLIP) techniques is particularly appropriate. This paper presents a method for utilizing previously developed techniques for wire length estimation and layer assignment and applies them to the problem of cut and bridge functional yield estimation.
Automated feedback on programs means students need less help from teachers
Authors: Elizabeth Odekirk-Hash, Joseph L. Zachary
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

Many educators believe that the most effective means of teaching is through one-on-one interactions with students. It is not surprising, then, that an effective way to teach programming is to give students immediate feedback on programs that they have just written. Unfortunately, such one-on-one teaching scenarios are becoming increasingly difficult to arrange. We built InSTEP, an online tutoring system for beginning C programmers, to see whether an automated system could provide effective immediate feedback to beginning programming students. In an introductory programming course, we compared two groups of students. One group solved six programming problems with feedback from InSTEP; the second group solved the same six problems without feedback from InSTEP; both groups had access to feedback from teaching assistants. While both groups of students took about the same amount of time to complete the problems and performed about the same on a subsequent test, the students who received feedback from InSTEP spent less than a third of the time asking the teaching assistants questions than did the others.
Algebra jam: supporting teamwork and managing roles in a collaborative learning environment
Authors: Mark K. Singley, Moninder Singh, Peter Fairweather, Robert Farrell, Steven Swerling
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

We are building a collaborative learning environement that supports teams of students as they collaborate synchronously and remotely to solve situated, multi-step problems involving algebraic modeling. Our system, named Algebra Jam, provides a set of tools to help students overcome two of the most serious impediments to successful collaboration: establishing common ground and maintaining group focus. These tools include tethered and untethered modes of operation including discrepancy notification, a goal-oriented team blackboard, object-oriented chat with collabicons, reification of problem solving roles, and the optional inclusion of a tutor agent as a virtual team participant. The tutor agent not only offers help and feedback on problem solving actions but also accumulates evidence about individual and group problem solving performance in a Bayesian inference network. The system is envisioned as a testbed for developing theories of teaming.
Unrecorded magnetic tape for information interchange (9 track&mdash;200 and 800 CPI, NRZI and 1600 CPI, P.E.)
Authors: M. Stuart Lynn
Venue: Communications of the ACM (1970)

This proposed American National Standard has been accepted for publication by American National Standards Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the largest public consensus, X3 authorized publication of this document to elicit comment and general public reaction, with the understanding that such a working document is an intermediate result in the standardization process and is subject to change, modification, or withdrawal in part or in whole. Comments should be directed to the X3 Secretary, Business Equipment Manufacturers Association, 1828 L Street, NW, Washington, DC 20036.&mdash;C.K.