ppxscal/embedding_network huggingface dataset:
A digitally programmable delay element: design and analysis
Authors: Mohammad Maymandi-Nejad, Manoj Sachdev
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Variable delay elements are often used to manipulate the rising or falling edges of the clock or any other signal in integrated circuits (ICs). Delay elements are also used in delay locked loops (DLLs). Although, a few types of digitally controlled delay elements have been proposed, an analytical expression for the delay of these circuits has not been reported. In this paper, we propose a new delay element architecture and develop an analytical equation for the output voltage and an empirical relation for the delay of the circuit. The proposed circuit exhibits improved delay characteristics over previously reported digitally controlled delay elements.
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Authors: Fangyan Rao, Long Zhang, Xiu Lan Yu, Ying Li, Ying Chen
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how to utilize these spatial information to get insight into business data from the geo-spatial point of view is becoming an important issue of data warehouse and OLAP. However, traditional data warehouse and OLAP tools can not fully exploit spatial data in coordinates because multi-dimensional spatial data does not have implicit or explicit concept hierarchy to compute pre-aggregation and materialization in data warehouse. In this paper we extend the traditional set-grouping hierarchy into multi-dimensional data space and propose to use spatial index tree as the hierarchy on spatial dimension. With spatial hierarchy, spatial data warehouse can be built accordingly. Our approach preserve the star schema in data warehouse while building the hierarchy on spatial dimension, and can be easily integrated into existing data warehouse and OLAP systems. To process spatial OLAP query in spatial data warehouse, we propose an OLAP-favored search method which can utilize the pre-aggregation result in spatial data warehouse to improve the performance of spatial OLAP queries. For generality, the algorithm is developed based on Generalized Index Searching Tree(GiST). To improve the performance of OLAP-favored search, we further introduce a heuristic search method which can provide an approximate answer to spatial OLAP query. Experiment result shows the efficiency of our method.
From genre analysis to the design of meetingware
Authors: Pedro Antunes, Carlos J. Costa
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Genre analysis is an approach to study organizational structures, focusing on communication patterns, which can be applied to the specific context of meetings. This research investigates the impact of genre analysis on the design of meetingware. The paper describes how genre analysis was used to develop meetingware for several organizations and meeting genres. The paper covers the whole design process, from genre elicitation to validation. The obtained results indicate that genre analysis impacts meetingware design in five major dimensions: organizational integration, situated nature, meeting lifecycle view, focus on communication patterns, and preservation of the meeting context.
A Fast Impulsive Contact Suite for Rigid Body Simulation
Authors: Harald Schmidl, Victor J. Milenkovic
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--A suite of algorithms is presented for contact resolution in rigid body simulation under the Coulomb friction model: Given a set of rigid bodies with many contacts among them, resolve dynamic contacts (collisions) and static (persistent) contacts. The suite consists of four algorithms: 1) partial sequential collision resolution, 2) final resolution of collisions through the solution of a single convex QP (positive semidefinite quadratic program), 3) resolution of static contacts through the solution of a single convex QP, 4) freezing of "stationary¿ bodies. This suite can generate realistic-looking results for simple examples yet, for the first time, can also tractably resolve contacts for a simulation as large as 1,000 cubes in an "hourglass.¿ Freezing speeds up this simulation by more than 25 times. Thanks to excellent commercial QP technology, the contact resolution suite is simple to implement and can be "plugged into¿ any simulation algorithm to provide fast and realistic-looking animations of rigid bodies.
Using design patterns to build dynamically extensible collaborative virtual environments
Authors: Thomas Alexandre
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Although in the past decade a lot of research efforts have been concentrated into building multi-user virtual worlds such as 3D collaborative virtual environments (CVE) and gaming platforms [1], the proprietary nature of such systems and their associated complexity has often resulted in large monolithic applications that are difficult to maintain and extend. At the same time, the openness and scalability of the web let us imagine what could be the next step in the evolution of information sharing and more intuitive collaboration - a web in 3 dimensions to model the world we live in, that would enhance the notion of websites, web pages and hyperlinks navigation with more natural interfaces made of buildings, rooms and people.Undoubtfully, creating such interactive worlds depends on resolving a number of software engineering challenges, most of them resulting from the conflicting requirements of speed vs reliability, scalability vs bandwidth usage, replication vs consistency or flexibility vs tight-coupling.In the next sections we propose a framework to build dynamically extensible networked environments based on existing and well documented design patterns [2] that will help developers creating virtual world applications in java by easily assembling components and behaviors in a reusable manner. This paper also discusses the foundation for an implementation in java of such a framework based on principles of the OMG's emerging Model Driven Architecture (MDA) [3].
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
Authors: Biplab Sikdar, Shivkumar Kalyanaraman, Kenneth S. Vastola
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.
Tracking point of view in narrative
Authors: Janyce M. Wiebe
Venue: Computational Linguistics (1994)

Third-person fictional narrative text is composed not only of passages that objectively narrate events, but also of passages that present characters' thoughts, perceptions, and inner states. Such passages take a character's psychological point of view. A language understander must determine the current psychological point of view in order to distinguish the beliefs of the characters from the facts of the story, to correctly attribute beliefs and other attitudes to their sources, and to understand the discourse relations among sentences. Tracking the psychological point of view is not a trivial problem, because many sentences are not explicitly marked for point of view, and whether the point of view of a sentence is objective or that of a character (and if the latter, which character it is) often depends on the context in which the sentence appears. Tracking the psychological point of view is the problem addressed in this work. The approach is to seek, by extensive examinations of naturally occurring narrative, regularities in the ways that authors manipulate point of view, and to develop an algorithm that tracks point of view on the basis of the regularities found. This paper presents this algorithm, gives demonstrations of an implemented system, and describes the results of some preliminary empirical studies, which lend support to the algorithm.
MedISeek: a web based diffusion system for medical visual information
Authors: Silvio Antonio Carro, Jacob Scharcanski, José Valdeni de Lima
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

This paper presents a new metadata model to describe and retrieve medical visual information, such as images and their diagnoses, using the Web. The classes of this model allow to describe medical images of different modalities, including their properties, components and relationships. This model supports the international classification of diseases and related health problems (i.e. ICD-10)[1], and it has been used as a base for the implementation of the MedISeek (Medical Image Seek) prototype. This system allows authorized users to describe, store and retrieve medical images and their associated diagnostic information on the web for fast information exchange. Thus, this paper proposes a persistent structure for relational databases to storage and retrieve medical visual information based on the proposed the metadata model. A description of the prototype structure also is provided.
Vision in context: using special purpose routines to achieve more general purpose vision
Authors: Kristian J. Hammond
Venue:  (2003)

Recently researchers have used task driven computer vision routines to solve specific problems. These routines have been successful by relying on specific traits of the task they solve and the environment in which they operate. One disadvantage of this method is that the specific constraints on which the routines rely may not hold in a given situation, or may even cease to hold in situations where they held before due to changes in the world. We believe that reasoning about those constraints explicitly and selecting appropriate special purpose routines for specific situations allows us to create a general purpose computer vision system both robust and broad in task coverage. This dissertation presents our work testing this hypothesis. The Intelligent Classroom is our primary testbed for utilizing vision in different contexts. The Classroom is an automated lecture facility that acts as its own audio/visual technician. The Classroom environment is a good choice for this research because it provides interesting computer vision tasks by interacting with a human user, and it also has structure which provides constraints for reasoning about that computer vision. In addition, we present a framework for low level computer vision, and two additional systems which utilize that framework to solve similar problems in different domains. The main contributions of the work described here are: (1) The Intelligent Classroom, a system which is able to use computer vision to produce a video of a lecture, as well as reason about how to sense for different user interaction tasks. (2) Our vision system, Gargoyle, which provides a framework for constructing vision routines on the fly, which is required to allow reasoning systems to manage the vision routines. It also provides a modular interface for designing and reusing parts of vision routines. (3) An implementation of existing vision routines in a robotic system, CHIP, utilizing this framework. This demonstrates the capability of the framework to implement proven systems. (4) The Interactive Image Mosaic, a system which demonstrates the ease of reuse by being built quickly using a number of the Classroom's Gargoyle routines.
An investigation of best practices for interactive content controls
Authors: James L. Mohler, Nishant Kothary, Ronald Glotzbach
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

This contribution presents an experimental design that seeks to answer the question of which type of interactive control works best for interactive, map-based content on the Web. The study used a matched pair's t-test and found a significant difference between a joystick/trackball-oriented interactive control versus two different control mechanisms that were based on multi-directional buttons. While the content of the study focused on map-based content, the findings have applicability to other content forms. Additionally, the quantitative approach used in this study provides a framework for work in the fields of usability and interface design as it relates to computer graphics.
A hierarchical approach to timing verification in CMOS VLSI design
Authors: H. G. Yang, D. M. Holburn
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a novel hierarchical approach to timing verification. Four types of relationship existing among signal paths are distinguished, based on a classification of the degree of interdependency in the circuit. In this way, irrelevant path delays can be excluded through consideration of the interaction between critical paths and others. Furthermore, under suitable conditions, bounded delay values for large hierarchical systems can be deduced using bounded delays determined for their constituent cells. Finally, we discuss the impact on design strategy of the hierarchical delay model presented in this paper.
RFID: is this game of tag fair play?
Authors: Meg McGinity
Venue: Communications of the ACM (2004)

Tracking the circuitous tradeoffs of potential consumer benefit versus marketer intrusiveness.
Differentiated surveillance for sensor networks
Authors: Ting Yan, Tian He, John A. Stankovic
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

For many sensor network applications such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while at the same time minimizing energy consumption and extending system lifetime by leveraging the redundant deployment of sensor nodes. It is also preferable for the sensor network to provide differentiated surveillance service for various target areas with different degrees of security requirements. In this paper, we propose a differentiated surveillance service for sensor networks based on an adaptable energy-efficient sensing coverage protocol. In the protocol, each node is able to dynamically decide a schedule for itself to guarantee a certain degree of coverage (DOC) with average energy consumption inversely proportional to the node density. Several optimizations and extensions are proposed to provide even better performance. Simulation shows that our protocol accomplishes differentiated surveillance with low energy consumption. It outperforms other state-of-the-art schemes by as much as 50% reduction in energy consumption and as much as 130% increase in the half-life of the network.
Multidimensional Linear Feedback Control Systems and Interpolation Problems for Multivariable Holomorphic Functions
Authors: Joseph A. Ball, Tanit Malakorn
Venue: Multidimensional Systems and Signal Processing (2004)

This paper examines the connections between feedback stabilization and H &infin; control, model matching problems and multivariable Nevanlinna-Pick interpolation problems for multidimensional or n-D linear systems.
Adaptive medial-axis approximation for sphere-tree construction
Authors: Gareth Bradshaw, Carol O'Sullivan
Venue: ACM Transactions on Graphics (TOG) (2004)

Hierarchical object representations play an important role in performing efficient collision handling. Many different geometric primitives have been used to construct these representations, which allow areas of interaction to be localized quickly. For time-critical algorithms, there are distinct advantages to using hierarchies of spheres, known as sphere-trees, for object representation. This article presents a novel algorithm for the construction of sphere-trees. The algorithm presented approximates objects, both convex and non-convex, with a higher degree of fit than existing algorithms. In the lower levels of the representations, there is almost an order of magnitude decrease in the number of spheres required to represent the objects to a given accuracy.
New Stability Results for Adversarial Queuing
Authors: Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
Venue: SIAM Journal on Computing (2004)

We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [J. ACM, 48 (2001), pp. 13--38]. We show that the scheduling protocol first-in-first-out (FIFO) can be unstable at any injection rate larger than 1/2 and that it is always stable if the injection rate is less than 1/d, where d is the length of the longest route used by any packet. We further show that every work-conserving (i.e., greedy) scheduling policy is stable if the injection rate is less than 1/(d+1).
Structured matrix perturbations for molecular conformations
Authors: Ioannis Z. Emiris, Theodore G. Nikitopoulos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Three-dimensional molecular structure is fundamental in drug design and discovery, docking, and chemical function identification. The input to our algorithm consists of a set of approximate interatomic distances or distances constrained in intervals of varying precision; some are specified by the covalent structure and others by NMR experiments and application of the triangle inequality. The output is a valid molecular conformation in a specified neighborhood of the input. We aspire that our approach helps in detecting outliers of the NMR experiments, and that it manages to handle partial inputs. Numerical linear algebra methods are employed for reasons of speed and accuracy. The main tools include, besides iterative local optimization, distance geometry and matrix perturbations for minimizing singular values of real symmetric matrices. Our algorithm is able to bound the number of degrees of freedom on the conformation manifold. A public domain MATLAB implementation is described; it can determine a conformation of a molecule with 20 backbone atoms in 3.79sec on a 500MHz PENTIUM-III.
Tree Structures for Mining Association Rules
Authors: Frans Coenen, Graham Goulbourne, Paul Leng
Venue: Data Mining and Knowledge Discovery (2004)

A well-known approach to Knowledge Discovery in Databases involves the identification of association rules linking database attributes. Extracting all possible association rules from a database, however, is a computationally intractable problem, because of the combinatorial explosion in the number of sets of attributes for which incidence-counts must be computed. Existing methods for dealing with this may involve multiple passes of the database, and tend still to cope badly with densely-packed database records. We describe here a class of methods we have introduced that begin by using a single database pass to perform a partial computation of the totals required, storing these in the form of a set enumeration tree, which is created in time linear to the size of the database. Algorithms for using this structure to complete the count summations are discussed, and a method is described, derived from the well-known Apriori algorithm. Results are presented demonstrating the performance advantage to be gained from the use of this approach. Finally, we discuss possible further applications of the method.
Learning and collaboration across generations in a community
Authors: Mary Beth Rosson, John M. Carroll
Venue: Communities and Technologies (2003)

We report on the activities and outcomes of two workshops in which middle school students and senior citizens explored, designed, and constructed visual simulations related to community issues. The workshops are part of a larger project, in which we are studying the effects of community-related programming projects and discussion on residents' computer literacy and community involvement. We describe the interactions among participants of varying age, and the simulations that they designed and built. We also discuss the influence of age on participants' reactions to the workshop activities, and consider what implications these findings have for our goal of building and maintaining a cross-generation learning community.
Model-based fault diagnosis of sequential circuits and its acceleration
Authors: Benjamin Rogel-Favila, Antony Wakeling, Peter Ying Kay Cheung
Venue: Proceedings of the conference on European design automation (1991)

This paper describes an algorithm for the location of faulty components in digital circuits using the model-based approach to circuit fault diagnosis. The model-based approach is first extended to apply to synchronous sequential circuits. Acceleration strategies that exploit domain knowledge particular to digital circuits are then proposed. The effect of these acceleration strategies is a drastic reduction in the execution time of the diagnosis procedure. The effectiveness and performance of the diagnosis algorithm are illustrated through an example for which encouraging results are obtained.
Scheduling groups of tasks with precedence constraints on three dedicated processors
Authors: Renata Mansini, M. Grazia Speranza, Zsolt Tuza
Venue: Discrete Applied Mathematics (2004)

We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a specified set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to find a nonpreemptive schedule which minimizes the maximum completion time (makespan). This scheduling problem is equivalent to the problem of finding an extension of the constraint graph (i.e. the graph which represents the conflicts between tasks and the precedence constraints) to a comparability graph with minimum (over all the extensions) maximum clique weight. The problem is NP-hard in the strong sense. A normal schedule is such that all the tasks requiring the same set of processors are scheduled consecutively. With a normal schedule the problem reduces to the quotient graph of the constraint graph. In this paper we obtain tight approximation results for the minimum makespan of a normal schedule through tight results on the minimum increase of the maximum clique weight when the (partially oriented) quotient graph is extended to a comparability graph.