ppxscal/embedding_network huggingface dataset:
An interactive comic book presentation for exploring video
Authors: John Boreczky, Andreas Girgensohn, Gene Golovchinsky, Shingo Uchihashi
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

This paper presents a method for generating compact pictorial summarizations of video. We developed a novel approach for selecting still images from a video suitable for summarizing the video and for providing entry points into it. Images are laid out in a compact, visually pleasing display reminiscent of a comic book or Japanese manga. Users can explore the video by interacting with the presented summary. Links from each keyframe start video playback and/or present additional detail. Captions can be added to presentation frames to include commentary or descriptions such as the minutes of a recorded meeting. We conducted a study to compare variants of our summarization technique. The study participants judged the manga summary to be significantly better than the other two conditions with respect to their suitability for summaries and navigation, and their visual appeal.
The Convergence of Numerical Transfer Schemes in Diffusive Regimes I: Discrete-Ordinate Method
Authors: François Golse, Shi Jin, C. David Levermore
Venue: SIAM Journal on Numerical Analysis (1999)

In highly diffusive regimes, the transfer equation with anisotropic boundary conditions has an asymptotic behavior as the mean free path $\epsilon$ tends to zero that is governed by a diffusion equation and boundary conditions obtained through a matched asymptotic boundary layer analysis. A numerical scheme for solving this problem has an $\epsilon^{-1}$ contribution to the truncation error that generally gives rise to a nonuniform consistency with the transfer equation for small $\epsilon$, thus degrading its performance in diffusive regimes. In this paper we show that whenever the discrete-ordinate method has the correct diffusion limit, both in the interior and at the boundaries, its solutions converge to the solution of the transport equation uniformly in $\epsilon$. Our proof of the convergence is based on an asymptotic diffusion expansion and requires error estimates on a matched boundary layer approximation to the solution of the discrete-ordinate method.
The expressibility of languages and relations by word equations
Authors: Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski
Venue: Journal of the ACM (JACM) (2000)

Classically, several properties and relations of words, such as &ldquo;being a power of the same word&rdquo; can be expressed by using word equations. This paper is devoted to a general study of the expressive power of word equations. As main results we prove theorems which allow us to show that certain properties of words are not expressible as components of solutions of word equations. In particular, &ldquo;the primitiveness&rdquo; and &ldquo;the equal length&rdquo; are such properties, as well as being &ldquo;any word over a proper subalphabet&rdquo;.
Recognition without Correspondence using MultidimensionalReceptive Field Histograms
Authors: Bernt Schiele, James L. Crowley
Venue: International Journal of Computer Vision (2000)

The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such as Gaussian derivatives or Gabor filters. This article presents a technique where appearances of objects are represented by the joint statistics of such local neighborhood operators. As such, this represents a new class of appearance based techniques for computer vision. Based on joint statistics, the paper develops techniques for the identification of multiple objects at arbitrary positions and orientations in a cluttered scene. Experiments show that these techniques can identify over 100 objects in the presence of major occlusions. Most remarkably, the techniques have low complexity and therefore run in real-time.
A Probabilistic Decision Model for Entity Matching in Heterogeneous Databases
Authors: Debabrata Dey, Sumit Sarkar, Prabuddha De
Venue: Management Science (1998)

In recent years, there has been a proliferation of database systems in all types of organizations. In many cases, these databases are developed in different departments and maintained autonomously. Much is to be gained, however, if databases across departments, divisions, or even organizations can be related to one another. One main problem of relating data stored in different databases is the differences in their representation of real-world entities, such as the use of different identifiers or primary keys. We present a decision theoretic model for matching entities across different databases. The decision to match two entities from two different databases inherently involves some uncertainty since an exact match may not be found because of errors in data collection, data entry, and data representation. We model this uncertainty using probability theory and propose an integer programming formulation that minimizes the total cost associated with the entity matching decision. The model has been implemented and validated on real-world data.
Extracting structured motifs using a suffix tree&mdash;algorithms and application to promoter consensus identification
Authors: Laurent Marsan, Marie-France Sagot
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

This paper introduces two exact algorithms for extracting conserved structured motifs from a set of DNA sequences. Structured motifs are composed of p &gne; 2 parts separated by constrained spacers These algorithms use a suffix tree for fulfilling this task. They are efficient enough to be able to extract site consensus, such as promoter sequences, from a whole collection of non coding sequences extracted from a genome. In particular, their time complexity scales linearly with N2n where n is the average length of the sequences and N their number. An application with interesting results to the identification of promoter consensus sequences in bacterial genomes is shown.
Solvability in Asynchronous Environments II: Finite Interactive Tasks
Authors: Benny Chor, Lee-Bath Nelson
Venue: SIAM Journal on Computing (1999)

Identifying what problems can be solved in a given distributed system is a central question in distributed computing. In this series of works, we study this question in the context of asynchronous fault tolerant systems that can execute consensus. These systems can be those executing deterministic protocols with access to a consensus routine or those running randomized error-free protocols. A previous work handled the class of distributed decision tasks. In these tasks, each processor receives one local input and has to respond with one local output. In an interactive distributed task each of n processors receives a sequence of local inputs and has to respond on line with an output for every new input (before getting its next input). Different processors can be at different stages concurrently, so that additional inputs are received by fast processors while slow processors are still working on early inputs. An interactive task is called finite if the number of local inputs (and outputs) is finite. Interactive tasks can neither be described as a single huge decision task nor be decomposed into distinct, independent decision tasks. The main result of this work is an exact characterization of the finite interactive tasks which can be solved by t-resilient protocols in either of the above two models. The major tool we use in the characterization is a directed acyclic graph that is associated with an interactive task. Properties of this graph are used to determine the resiliency of the task and to devise a "generic" resilient algorithm which solves such tasks. This generic algorithm can be viewed as a repeated, deterministic reduction to a consensus subroutine. This implies that any finite interactive task is solvable by randomized error-free protocols iff it is solvable by deterministic protocols with access to consensus.
The p-Relative Distance is a Metric
Authors: Anders Barrlund
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The conjecture that the p-relative distance, $\varrho_p(\alpha,\tilde{\alpha})=|\alpha-\tilde{\alpha}| /{\sqrt[p]{|\alpha|^p+|\tilde{\alpha}|^p}}$, is a metric is proved.
Symphony: a case study in extending learner-centered design through process space analysis
Authors: Chris Quintana, Jim Eng, Andrew Carra, Hsin-Kai Wu, Elliot Soloway
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

We are exploring a new class of tools for learners: scaffolded integrated tool environments (or SITES), which address the needs of learners trying to engage in new, complex work processes. A crucial phase within a learner-centered design approach for SITE design involves analyzing the work process to identify areas where learners need support to engage in the process. Here we discuss the design of Symphony, a SITE for high-school science students. Specifically, we discuss how the process-space model helped us analyze the science inquiry process to help us identify a detailed set of learner needs, leading to a full set of process scaffolding strategies for Symphony.
A performance comparison of contemporary DRAM architectures
Authors: Vinodh Cuppu, Bruce Jacob, Brian Davis, Trevor Mudge
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

In response to the growing gap between memory access time and processor speed, DRAM manufacturers have created several new DRAM architectures. This paper presents a simulation-based performance study of a representative group, each evaluated in a small system organization. These small-system organizations correspond to workstation-class computers and use on the order of 10 DRAM chips. The study covers Fast Page Mode, Extended Data Out, Synchronous, Enhanced Synchronous, Synchronous Link, Rambus, and Direct Rambus designs. Our simulations reveal several things: (a) current advanced DRAM technologies are attacking the memory bandwidth problem but not the latency problem; (b) bus transmission speed will soon become a primary factor limiting memory-system performance; (c) the post-L2 address stream still contains significant locality, though it varies from application to application; and (d) as we move to wider buses, row access time becomes more prominent, making it important to investigate techniques to exploit the available locality to decrease access time.
The MLPQ/GIS constraint database system
Authors: Peter Revesz, Rui Chen, Pradip Kanjamala, Yiming Li, Yuguo Liu, Yonghui Wang
Venue: ACM SIGMOD Record (2000)

MLPQ/GIS [4,6] is a constraint database [5] system like CCUBE [1] and DEDALE [3] but with a special emphases on spatio-temporal data. Features include data entry tools (first four icons in Fig. 1), icon-based queries such as @@@@ Intersection, @@@@ Union, @@@@ Area, @@@@ Buffer, @@@@ Max and @@@@ Min, which optimize linear objective functions, and @@@@ for Datalog queries. For example, in Fig. 1 we loaded and displayed a constraint database that represents the midwest United States and loaded two contraint relations describing the movements of two persons. The query icon opened a dialog box into which we entered the query which finds (t, i) pairs such that the two people are in the same state i at the same time t.MLPQ/GIS can animate [2] spatio-temporal objects that are linear constraint relations over and t.Users can also display in discrete color zones (isometric maps) any spatially distributed variable z that is a linear function and For example, Fig. 2 shows the mean annual air temperature Nebraska. Animation and isometric map display can be combined.
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Authors: Yehuda Afek, Gideon Stupp, Dan Touitou
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

Long-lived and adaptive to point contention implementations of snapshot and immediate snapshot objects in the read/write shared-memory model are presented. In [2] we presented adaptive algorithms for mutual exclusion, collect and snapshot. However, the collect and snapshot algorithms were adaptive only when the number of local primitive operations that a process performs are ignored, i.e., not counted. The number of primitive local steps (operations that do not access the shared memory) in the collect and snapshot operations presented in [2] is O(Nk3) and O(Nk4) respectively where N is the total number of processes in the system and k is the encountered contention. Here we developed new techniques that enabled us to achieve fully adaptive implementations in which the step complexity (combined local and shared) of any operation is bounded by a function of the number of processes that are concurrent with the operation, in particular, O(k4) for the snapshot implementation.
Is the new economy socially sustainable? (invited presentation) (abstract only)
Authors: Manuel Castells
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

At the turn of the millennium, the revolution in information technology has ushered in a new economy. This economy, originated in the United States, and more specifically in the American West Coast, is spreading throughout the world, in an uneven, yet dynamic pattern. It is essentially characterized by the key role of knowledge and information in spurring productivity and enhancing competitiveness; by its global reach; and by its networked form of business organization. Well managed, this new economy may yield an extraordinary harvest of human creativity and social well being. However, several major contradictions threaten the stability of this new economy: the volatility of global financial markets; the institutional rigidity of business, legislation, and governments in many countries; increasing social inequality and social exclusion throughout the world, limiting market expansion and triggering social tensions; and the growing opposition to globalization without representation on behalf of alternative values, and legitimate concerns on the environmental and social costs of this model of growth. Information technology offers great potential in helping to supersede these contradictions at the dawn of an emerging socio-economic system. But the speed of technological innovation requires the parallel development of institutional and cultural innovation, away from bureaucracy but closer to people, to ensure the sustainability of the new economy, and to spur the new wave of technological creativity.
Bottom-up computation of sparse and Iceberg CUBE
Authors: Kevin Beyer, Raghu Ramakrishnan
Venue: ACM SIGMOD Record (1999)

We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of Iceberg-CUBE can be used (1) to answer group-by queries with a clause such as HAVING COUNT(*) >= X, where X is greater than the threshold, (2) for mining multidimensional association rules, and (3) to complement existing strategies for identifying interesting subsets of the CUBE for precomputation. We present a new algorithm (BUC) for Iceberg-CUBE computation. BUC builds the CUBE bottom-up; i.e., it builds the CUBE by starting from a group-by on a single attribute, then a group-by on a pair of attributes, then a group-by on three attributes, and so on. This is the opposite of all techniques proposed earlier for computing the CUBE, and has an important practical advantage: BUC avoids computing the larger group-bys that do not meet minimum support. The pruning in BUC is similar to the pruning in the Apriori algorithm for association rules, except that BUC trades some pruning for locality of reference and reduced memory requirements. BUC uses the same pruning strategy when computing sparse, complete CUBEs. We present a thorough performance evaluation over a broad range of workloads. Our evaluation demonstrates that (in contrast to earlier assumptions) minimizing the aggregations or the number of sorts is not the most important aspect of the sparse CUBE problem. The pruning in BUC, combined with an efficient sort method, enables BUC to outperform all previous algorithms for sparse CUBEs, even for computing entire CUBEs, and to dramatically improve Iceberg-CUBE computation.
A formal method to prove ordering properties of multicast systems
Authors: C. Toinard, G. Florin, C. Carrez
Venue: ACM SIGOPS Operating Systems Review (1999)

We consider three kinds of ordering properties provided by a multicast system. The messages can be delivered to the different recipients according to a local order, a causal order or a total order. In this paper, a formal method is proposed to prove the total and causal order of multicast protocols. A generalized formal result for multicast protocols is obtained. Some addressing features for other formal results are considered. This study allows to prove that existing systems have the required property. The results can be used to define new solutions. Moreover, the method makes use of various ordering properties, well fitted to practical systems, to achieve a better understanding of the ordering processing.
Programming and enjoying music with your eyes closed
Authors: Steffen Pauws, Don Bouwhuis, Berry Eggen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Design and user evaluation of a multimodal interaction style for music programming is described. User requirements were instant usability and optional use of a visual display. The interaction style consists of a visual roller metaphor. User control of the rollers proceeds by manipulating a force feedback trackball. Tactual and auditory cues strengthen the roller impression and support use without a visual display. The evaluation investigated task performance and procedural learning when performing music programming tasks with and without a visual display. No procedural instructions were provided. Tasks could be completed successfully with and without a visual display, though programming without a display needed more time to complete. Prior experience with a visual display did not improve performance without a visual display. When working without a display, procedures have to be acquired and remembered explicitly, as more procedures were remembered after working without a visual display. It is demonstrated that multimodality provides new ways to interact with music.
Uniform A Priori Estimates for Singularly Perturbed Elliptic Equations in Multidimensions
Authors: W. Dörfler
Venue: SIAM Journal on Numerical Analysis (1999)

We consider a linear singularly perturbed elliptic equation on a bounded domain in $\mbox{\smallBbb R}^n$. This equation serves as a model for the interplay between the transport term and a relatively small viscosity term in some problems of mathematical physics. We establish a priori estimates that hold uniformly in the small parameter. From this one can prove an abstract a priori error estimate for the discretization with conforming finite elements. For globally directed transport fields we establish a new type of anisotropic a priori estimate for the solution. In the case of $\Omega=(0,1)^2$ we prove a priori estimates for certain higher order derivatives in isotropic as well as anisotropic norms. In a subsequent paper we will apply these results to show uniform convergence of an exponentially fitted method on rectangular grids.
Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
Authors: Kai Bittner
Venue: SIAM Journal on Scientific Computing (1999)

We consider Boolean sums of univariate interpolation operators which define multivariate jth order blending interpolation operators on sparse grids. Sample spaces are defined as range of the blending operators. Sample and wavelet spaces have significantly lower dimension and good approximation order for certain function spaces. Fast decomposition and reconstruction algorithms for bivariate spline wavelets, based on algorithms for univariate functions, are described. Operation counts for the algorithms are given and it is shown that the complexity depends linearly on the dimension of sample spaces.
Ordering, Anisotropy, and Factored Sparse Approximate Inverses
Authors: Robert Bridson, Wei-Pai Tang
Venue: SIAM Journal on Scientific Computing (1999)

We consider ordering techniques to improve the performance of factored sparse approximate inverse preconditioners, concentrating on the AINV technique of M. Benzi and M. T\r{u}ma. Several practical existing unweighted orderings are considered along with a new algorithm, minimum inverse penalty (MIP), that we propose. We show how good orderings such as these can improve the speed of preconditioner computation dramatically and also demonstrate a fast and fairly reliable way of testing how good an ordering is in this respect. Our test results also show that these orderings generally improve convergence of Krylov subspace solvers but may have difficulties particularly for anisotropic problems. We then argue that weighted orderings, which take into account the numerical values in the matrix, will be necessary for such systems. After developing a simple heuristic for dealing with anisotropy we propose several practical algorithms to implement it. While these show promise, we conclude a better heuristic is required for robustness.
Clock synchronization with faults and recoveries (extended abstract)
Authors: Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

We present a convergence-function based clock synchronization algorithm, which is simple, efficient and fault-tolerant. The algorithm is tolerant of failures and allows recoveries, as long as less than a third of the processors are faulty 'at the same time'. Arbitrary (Byzantine) faults are tolerated, without requiring awareness of failure or recovery. In contrast, previous clock synchronization algorithms limited the total number of faults throughout the execution, which is not realistic, or assumed fault detection. The use of our algorithm ensures secure and reliable time services, a requirement of many distributed systems and algorithms. In particular, secure time is a fundamental assumption of proactive secure mechanisms, which are also designed to allow recovery from (arbitrary) faults. Therefore, our work is crucial to realize these mechanisms securely.
Improving OLTP data quality using data warehouse mechanisms
Authors: Matthias Jarke, Christoph Quix, Guido Blees, Dirk Lehmann, Gunter Michalk, Stefan Stierl
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Research and products for the integration of heterogeneous legacy source databases in data warehousing have addressed numerous data quality problems in or between the sources. Such a solution is marketed by Team4 for the decision support of mobile sales representatives, using advanced view maintenance and replication management techniques in an environment based on relational data warehouse technology and Lotus Notes-based client systems. However, considering total information supply chain management, the capture of poor operational data, to be cleaned later in the data warehouse, appears sub-optimal. Based on the observation that decision support clients are often closely linked to operational data entry, we have addressed the problem of mapping the data warehouse data quality techniques back to data quality measures for improving OLTP data. The solution requires a warehouse-to-OLTP workflow which employs a combination of view maintenance and view update techniques.