ppxscal/embedding_network huggingface dataset:
Effects of annotations on student readers and writers
Authors: Joanna L. Wolfe
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Recent research on annotations has focused on how readers annotate texts, ignoring the question of how reading annotations might affect subsequent readers of a text. This paper reports on a study of persuasive essays written by 123 undergraduates receiving primary source materials annotated in various ways. Findings indicate that annotations improve Findings indicate that annotations improve recall of emphasized items, influence how specific arguments in the source materials are perceived, decrease students' tendencies to unnecessarily summarize. Of particular interest is that students' perceptions of the annotator appeared to greatly influence how they responded to the annotated material. Using this study as a basis, I discuss implications for the design and implementation of digitally annotated materials.
Dynamic typing for distributed programming in polymorphic languages
Authors: Dominic Duggan
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1999)

While static typing is widely accepted as being necessary for secure program execution, dynamic typing is also viewed as being essential in some applications, particularly for distributed programming environments. Dynamics have been proposed as a language construct for dynamic typing, based on experience with languages such as CLU, Cedar/Mesa, and Modula-3. However proposals for incorporating dynamic typing into languages with parametric polymorphism have serious shortcomings. A new approach is presented to extending polymorphic lnanguages with dynamic typing. At the heart of the approach is the use of dynamic type dispatch, where polymorphic functions may analyze the structure of their type arguments. This approach solves several open problems with the traditional approach to adding dynamic typing to polymorphic languages. An explicity typed language XMLdyn is presented; this language uses refinement kinds to ensure that dynamic type dispatch does not fail at run-time. Safe dynamics are a new form of dynamics that use refinement kinds to statically check the use of run-time dynamic typing. Run-time errors are isolated to a separate construct for performing run-time type checks
Partial BIST insertion to eliminate data correlation
Authors: Qiushuang Zhang, Ian Harris
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

A new partial BIST insertion approach based on eliminating data correlation to improve pseudo-random testability is presented. Data correlation causes the circuit to be in a subset of the states more or less frequently, which leads to low fault coverage in pseudo-random test. One important cause of correlation is reconvergent fanout. Incorporating BIST test flip-flops into reconvergent paths will break correlation, however, breaking all reconvergent fanout is unnecessary since some reconvergent fanout results in negligible correlation. We introduce a metric to determine the degree of correlation caused by a set of reconvergent fanout paths. We use this metric to identify problematic reconvergent fanout which must be broken through partial BIST insertion. We provide an algorithm to break high correlation reconvergent paths. Our algorithm provides high fault coverage while selecting fewer BIST flip-flops than required using loop breaking techniques. Experimental results produced using our algorithm rank on average among the top 11.6% of all possible solutions with the same number of flip-flops.
Teaching Macroeconomics with GAMS
Authors: P. Ruben Mercado, David A. Kendrick, Hans Amman
Venue: Computational Economics (1998)

Our general goal in this paper is to show how to implement in GAMS standard deterministic nonlinear macro models, and stochastic linear macro models with rational expectations. We will also present basic concepts on solution methods and policy analysis for these kinds of models. As a practical illustration, we will use some well known teaching and experimental models in the macroeconomic literature.
Contig selection in physical mapping
Authors: Steffan Heber, Jens Stoye, Jörg Hoheisel, Martin Vingron
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

In physical mapping one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. This is a preparatory step for efficient sequencing. Our approach to physical mapping divides the problem into smaller and easier subproblems by partitioning the probe set into independent parts (contigs). The focus is on the selection of probe sets which can be grouped together into contigs. We introduce a new distance function between probes, the averaged rank distance (ARD). The ARD measures the reliability of certain probe configurations in physical maps which are generated by bootstrap resampling of the raw data. This mimics an independent experiment repetition in silico. The ARD measures the distances of probes within a contig and smoothes the distances of probes in different contigs. It shows distinct jumps at contig borders. This makes it appropriate for contig selection by clustering. We designed a physical mapping algorithm that makes use of these observations and seems to be particularly well suited to the delineation of reliable contigs. We evaluated our method on data sets from two physical mapping projects. In comparison to a physical map of Pasteurella haemolytica that was computed using simulated annealing, the newly computed map is considerably cleaner. On data from Xylella fastidiosa the contigs produced by the new method could be compared to a map produced by a group of experts and the two maps largely agree in the definition of the contigs. The results of our method have already proven helpful for the design of experiments aiming at further improving the quality of a map.
The Maximum Partition Matching Problem with Applications
Authors: Chi-Chang Chen, Jianer Chen
Venue: SIAM Journal on Computing (1999)

Let ${\cal S} = {C1, C2, . . . , Ck}$ be a collection of pairwise disjoint subsets of U = { 1, 2, . . . , n} such that $\bigcup_{i = 1}^k Ci = U. A partition matching of $\cal S$ consists of two subsets {a1, . . . , am} and {b1, . . ., bm} of U together with a sequence of distinct partitions of $\cal S$: $({\cal A}_1, {\cal B}_1), \ldots, ({\cal A}_m, {\cal B}_m)$ such that ai is contained in a subset in the collection ${\cal A}_i$ and bi is contained in a subset in the collection ${\cal B}_i$ for all i = 1, . . . , m. An efficient algorithm is developed that constructs a maximum partition matching for a given collection $\cal S$. The algorithm can be used to construct optimal parallel routing between two nodes in interconnection networks.
On Computing the Nucleolus of a Balanced Connected Game
Authors: Tamas Solymosi, Harry Aarts, Theo Driessen
Venue: Mathematics of Operations Research (1998)

The question of "fairly" allocating costs or cost-savings among the participants of a joint enterprise is frequently answered by finding the nucleolus of a related cooperative game. In connection with various routing, sequencing and scheduling situations, connected games often arise. Their common feature is that all the essential coalitions (whose breaking up into subcoalitions is disadvantageous for its members) are connected with respect to a fixed order of the players (any player between two members of a coalition is also a member of the coalition). In the literature, several special classes of connected games are discussed that are shown to be balanced. In this paper, an algorithm is presented that computes the nucleolus of a general n-person balanced connected game. The input is the array of the explicitly given values of the n(n + 1)/2 connected coalitions. The algorithm generates a sequence of at most n(n - 1)/2 payoff vectors starting from a special vertex of the nonempty core and ending in the nucleolus. By exploiting the special structure of connected games, the initial as well as the subsequent payoff vectors are obtained by evaluating some simple recursive formulas. It is shown that the algorithm requires at most O(n4) time and O(n2) space. A 5-person illustrative example is also given.
WSQ/DSQ: a practical approach for combined querying of databases and the Web
Authors: Roy Goldman, Jennifer Widom
Venue: ACM SIGMOD Record (2000)

We present WSQ/DSQ (pronounced &ldquo;wisk-disk&rdquo;), a new approach for combining the query facilities of traditional databases with existing search engines on the Web. WSQ, for Web-Supported (Database) Queries, leverages results from Web searches to enhance SQL queries over a relational database. DSQ, for Database-Supported (Web) Queries, uses information stored in the database to enhance and explain Web searches. This paper focuses primarily on WSQ, describing a simple, low-overhead way to support WSQ in a relational DBMS, and demonstrating the utility of WSQ with a number of interesting queries and results. The queries supported by WSQ are enabled by two virtual tables, whose tuples represent Web search results generated dynamically during query execution. WSQ query execution may involve many high-latency calls to one or more search engines, during which the query processor is idle. We present a lightweight technique called asynchronous iteration that can be integrated easily into a standard sequential query processor to enable concurrency between query processing and multiple Web search requests. Asynchronous iteration has broader applications than WSQ alone, and it opens up many interesting query optimization issues. We have developed a prototype implementation of WSQ by extending a DBMS with virtual tables and asynchronous iteration; performance results are reported.
Geodesic Active Contours and Level Sets for the Detection and Tracking of Moving Objects
Authors: Nikos Paragios, Rachid Deriche
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper presents a new variational framework for detecting and tracking multiple moving objects in image sequences. Motion detection is performed using a statistical framework for which the observed interframe difference density function is approximated using a mixture model. This model is composed of two components, namely, the static (background) and the mobile (moving objects) one. Both components are zero-mean and obey Laplacian or Gaussian law. This statistical framework is used to provide the motion detection boundaries. Additionally, the original frame is used to provide the moving object boundaries. Then, the detection and the tracking problem are addressed in a common framework that employs a geodesic active contour objective function. This function is minimized using a gradient descent method, where a flow deforms the initial curve towards the minimum of the objective function, under the influence of internal and external image dependent forces. Using the level set formulation scheme, complex curves can be detected and tracked while topological changes for the evolving curves are naturally managed. To reduce the computational cost required by a direct implementation of the level set formulation scheme, a new approach named Hermes is proposed. Hermes exploits aspects from the well-known front propagation algorithms (Narrow Band, Fast Marching) and compares favorably to them. Very promising experimental results are provided using real video sequences.
New Firm Survival: Institutional Explanations for New Franchisor Mortality
Authors: Scott Shane, Maw-Der Foo
Venue: Management Science (1999)

Why do some new firms succeed and others fail? Economists argue that new firms fail because entrepreneurs inefficiently manage production and organizational design (Williamson 1985). Sociologists (e.g., Granovetter 1985) have typically viewed this explanation as undersocialized, and argue that institutional legitimacy must also be considered to explain the survival of new firms. This paper examines the survival of 1292 new franchisors established in the United States from 1979-1996. The results show that institutional legitimacy adds to economic explanations for the survival of new franchisors and suggests the importance of a properly socialized explanation.
Storytelling with digital photographs
Authors: Marko Balabanović, Lonny L. Chu, Gregory J. Wolff
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Photographs play a central role in many types of informal storytelling. This paper describes an easy-to-use device that enables digital photos to be used in a manner similar to print photos for sharing personal stories. A portable form factor combined with a novel interface supports local sharing like a conventional photo album as well as recording of stories that can be sent to distant friends and relatives. User tests validate the design and reveal that people alternate between &ldquo;photo-driven&rdquo; and &ldquo;story-driven&rdquo; strategies when telling stories about their photos.
Minimizing Communication in the Bitonic Sort
Authors: Jae-Dong Lee, Kenneth E. Batcher
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

This paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general-purpose parallel architectures such as SIMD and/or MIMD computers. First, bitonic sorting algorithms for shared-memory SIMD and/or MIMD computers are developed. Shared-memory accesses through the interconnection network of shared memory SIMD and/or MIMD computers can be very time consuming. A scheme is introduced which reduces the number of such accesses. This scheme is based on the parity strategy which is the main idea of the paper. By reducing the communication through the network, a performance improvement is achieved. Second, a recirculating bitonic sorting network is presented, which is composed of one level of N/2 comparators plus an $\Omega$-network of $(\log N- 1)$ switch levels. This network reduces the cost complexity to $O(N \log N)$ compared with the $O(N \log^{2} N)$ of the original bitonic sorting network, while preserving the same time complexity. Finally, a simplified multistage bitonic sorting network, is presented. For simplifying the interlevel wiring, the parity strategy is used, so N/2 keys are wired straight through the network.
Risk-Sensitive Control of Discrete-Time Markov Processes with Infinite Horizon
Authors: G. B. Di Masi, L. Stettner
Venue: SIAM Journal on Control and Optimization (1999)

In this paper we study existence of solutions to the Bellman equation corresponding to risk-sensitive ergodic control of discrete-time Markov processes using three different approaches. Also, for particular classes of systems, asymptotics for vanishing risk factor is investigated, showing that in the limit the optimal value for an average cost per unit time is obtained.
Incomplete Cholesky Factorizations with Limited Memory
Authors: Chih-Jen Lin, Jorge J. Moré
Venue: SIAM Journal on Scientific Computing (1999)

We propose an incomplete Cholesky factorization for the solution of large-scale trust region subproblems and positive definite systems of linear equations. This factorization depends on a parameter p that specifies the amount of additional memory (in multiples of n, the dimension of the problem) that is available; there is no need to specify a drop tolerance. Our numerical results show that the number of conjugate gradient iterations and the computing time are reduced dramatically for small values of p. We also show that in contrast with drop tolerance strategies, the new approach is more stable in terms of number of iterations and memory requirements.
Combinatorics of Necklaces and &ldquo;Hermite Reciprocity&rdquo;
Authors: A. Elashvili, M. Jibladze, D. Pataraia
Venue: Journal of Algebraic Combinatorics: An International Journal (1999)

Combinatorial proof of an explicit formula for dimensions of spaces of semi-invariants of regular representations of finite cyclic groups is obtained. Using bicolored necklaces, a certain reciprocity law following from this formula is also derived combinatorially.
The Adaptive Computation of Far-Field Patterns by A Posteriori Error Estimation of Linear Functionals
Authors: Peter Monk, Endre Süli
Venue: SIAM Journal on Numerical Analysis (1998)

This paper is concerned with the derivation of a priori and a posteriori error bounds for a class of linear functionals arising in electromagnetics which represent the far-field pattern of the scattered electromagnetic field. The a posteriori error bound is implemented into an adaptive finite element algorithm, and a series of numerical experiments is presented.
The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems
Authors: Ken Darby-Dowman, Socorro Rangel
Venue: Computational Optimization and Applications (1998)

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.
The Simple Pendulum is not so Simple
Authors: Stuart S. Antman
Venue: SIAM Review (1998)

It is shown that the equation of motion of a simple pendulum cannot be derived from Newton's laws of particle mechanics without hidden assumptions. The exposure of these assumptions leads to an interesting inverse problem.
Gradient Method with Retards and Generalizations
Authors: A. Friedlander, J. M. Martínez, B. Molina, M. Raydan
Venue: SIAM Journal on Numerical Analysis (1998)

A generalization of the steepest descent and other methods for solving a large scale symmetric positive definitive system Ax = b is presented. Given a positive integer m, the new iteration is given by $x_{k+1} = x_k - \lambda (x_{\nu(k)}) (A x_k - b)$, where $\lambda (x_{\nu(k)})$ is the steepest descent step at a previous iteration $\nu(k) \in \{k, k-1, \ldots,$ max$\{0,k-m\}\}$. The global convergence to the solution of the problem is established under a more general framework, and numerical experiments are performed that suggest that some strategies for the choice of $\nu(k)$ give rise to efficient methods for obtaining approximate solutions of the system.
Agents to assist in finding help
Authors: Adriana Vivacqua, Henry Lieberman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

When a novice needs help, often the best solution is to find a human expert who is capable of answering the novice's questions. But often, novices have difficulty characterizing their own questions and expertise and finding appropriate experts. Previous attempts to assist expertise location have provided matchmaking services, but leave the task of classifying knowledge and queries to be performed manually by the participants. We introduce Expert Finder, an agent that automatically classifies both novice and expert knowledge by autonomously analyzing documents created in the course of routine work. Expert Finder works in the domain of Java programming, where it relates a user's Java class usage to an independent domain model. User models are automatically generated that allow accurate matching of query to expert without either the novice or expert filling out skill questionnaires. Testing showed that automatically generated profiles matched well with experts' own evaluation of their skills, and we achieved a high rate of matching novice questions with appropriate experts.
A Numerical Study of the Axisymmetric Couette--Taylor Problem Using a Fast High-Resolution Second-Order Central Scheme
Authors: Raz Kupferman
Venue: SIAM Journal on Scientific Computing (1999)

We present a numerical study of the axisymmetric Couette--Taylor problem using a finite difference scheme. The scheme is based on a staggered version of a second-order central-differencing method combined with a discrete Hodge projection. The use of central-differencing operators obviates the need to trace the characteristic flow associated with the hyperbolic terms. The result is a simple and efficient scheme which is readily adaptable to other geometries and to more complicated flows. The scheme exhibits competitive performance in terms of accuracy, resolution, and robustness. The numerical results agree accurately with linear stability theory and with previous numerical studies.
Stereo Without Epipolar Lines: A Maximum-Flow Formulation
Authors: Sébastien Roy
Venue: International Journal of Computer Vision (1999)

This paper describes a new algorithm for solving the stereo correspondence problem with a global 2-d optimization by transforming it into a maximum-flow problem in a graph. This transformation effectively removes explicit use of epipolar geometry, thus allowing direct use of multiple cameras with arbitrary geometries. The maximum-flow, solved both efficiently and globally, yields a minimum-cut that corresponds to a disparity surface for the whole image at once. This global and efficient approach to stereo analysis allows the reconstruction to proceed in an arbitrary volume of space and provides a more accurate and coherent depth map than the traditional stereo algorithms. In particular, smoothness is applied uniformly instead of only along epipolar lines, while the global optimality of the depth surface is guaranteed. Results show improved depth estimation as well as better handling of depth discontinuities. While the worst case running time is O(n^1.5 d^1.5 log(nd)), the observed average running time is O(n^1.2 d^1.3) for an image size of n pixels and depth resolution d.
The Current Quality of Health Plan Report Cards
Authors: Julie Kroll Letwat
Venue: Journal of Medical Systems (1999)

In general, health plan report cards can provide valuable information to consumers, physicians, and health care purchasers regarding plan performance and quality to assist in the selection of a health plan. However, significant limitations of health plan report cards currently exist. It is only with further evolvement and refinement that health plan report cards can live up to their potential and become a distinctive and useful tool in evaluating and selecting among various health plans.
Algorithms for Model-Based Gaussian Hierarchical Clustering
Authors: Chris Fraley
Venue: SIAM Journal on Scientific Computing (1998)

Agglomerative hierarchical clustering methods based on Gaussian probability models have recently shown promise in a variety of applications. In this approach, a maximum-likelihood pair of clusters is chosen for merging at each stage. Unlike classical methods, model-based methods reduce to a recurrence relation only in the simplest case, which corresponds to the classical sum of squares method. We show how the structure of the Gaussian model can be exploited to yield efficient algorithms for agglomerative hierarchical clustering.