ppxscal/embedding_network huggingface dataset:
Point placement on the line by distance data
Authors: Peter Damaschke
Venue: Discrete Applied Mathematics (2003)

Given partial distance information in a set of n points on the real line, we want to figure out the positions of these points, subject to translation and reflection. This type of problem is motivated by DNA mapping. We show the following results: If we can ask arbitrary distance queries for pairs of points then 2n - 3 adaptive queries will be optimal. (In contrast, all (n/2) queries must be asked in the nonadaptive case.) Surprisingly, if the learner knows in advance that the n points have distinct locations, 8/5n nonadaptive queries, or alternatively 3/2n queries in 2 rounds will be sufficient. This might be further improved, as we only have the lower bounds 4/3n and n, respectively. The subject is related to some rigidity concept for graphs. In another version of the problem, the graph of distance measures is already given, that means, we cannot choose our distance queries at our own discretion. Here, we give a simple efficient algorithm which produces a representation of all linear layouts if the given graph is chordal.
Modifications of Uncertain Data: A Bayesian Framework for Belief Revision
Authors: Debabrata Dey, Sumit Sarkar
Venue: Information Systems Research (2000)

The inherent uncertainty pervasive over the real world often forces business decisions to be made using uncertain data. The conventional relational model does not have the ability to handle uncertain data. In recent years, several approaches have been proposed in the literature for representing uncertain data by extending the relational model, primarily using probability theory. The aspect of database modification, however, has not been addressed in prior research. It is clear that any modification of existing probabilistic data, based on new information, amounts to the revision of one's belief about real-world objects. In this paper, we examine the aspect of belief revision and develop a generalized algorithm that can be used for the modification of existing data in a probabilistic relational database. The belief revision scheme is shown to beclosed,consistent, andcomplete.
Simplicity Without Reduction: Thinking Upstream Towards the Sustainable Society
Authors: Göran Broman, John Holmberg, Karl-Henrik Robegrave;rt
Venue: Interfaces (2000)

The natural-step framework is used by over 100 organizations, including many global corporations in Europe and the United States, to provide strategic direction for their sustainability initiatives. The framework is built on the concept of simplicity without reduction. Out of respect for complexity, we designed it to provide a compass, a guide for strategic direction. The framework consists of a backcasting planning process for sustainable development based on four principles (system conditions) for sustainability. The framework does not prescribe detailed actions. Once an organization understands the framework, it identifies and specifies the detailed means by which to achieve the strategy, because it knows its business best. The steps in the planning process are understanding and discussing the system conditions for sustainability, describing and discussing how the company relates to the system conditions in today's situation, creating a vision of how the company will fulfill its customers' needs in the future while complying with the system conditions, and specifying a program of actions that will take the company from today's situation to the future vision.
How to quickly find a witness
Authors: Daniel Kifer, Johannes Gehrke, Cristian Bucila, Walker White
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so they are not very compatible with other constraints. In this paper we present a more unified view of mining constrained itemsets such that most existing algorithms can be easily extended to handle constraints for which they were not designed a-priori. We apply this technique to mining itemsets with restrictions on their variance --- a problem that has been open for several years in the data mining community.
Node-Capacitated Ring Routing
Authors: AndrÁs Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh
Venue: Mathematics of Operations Research (2002)

We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas' lemma provides a characterization for general undirected graphs, asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distance functions arising from nonnegative node weights. For rings, this (straightforward) result will be improved in two ways. We prove that, independent of the integrality of node capacities, it suffices to require the distance inequality only for distances arising from (0-1-2)-valued node weights, a requirement that will be called the double-cut condition. Moreover, for integer-valued node capacities, the double-cut condition implies the existence of a half-integral multicommodity flow. In this case there is even an integer-valued multicommodity flow that violates each node capacity by at most one.Our approach gives rise to a combinatorial, strongly polynomial algorithm to compute either a violating double-cut or a node-capacitated multicommodity flow. A relation of the problem to its edge-capacitated counterpart will also be explained.
The discrete mathematics enhancement project
Authors: James W. McGuffee
Venue: Journal of Computing Sciences in Colleges (2002)

The discrete mathematics enhancement project was a project undertaken by two computer science faculty and one mathematics faculty member in the summer of 2001. The goals of the project were to increase student retention in the discrete mathematics course and to provide students with opportunities to explore the relationship between computer science and topics covered in the discrete mathematics course. The results of the project are a set of ten learning exercises and various programming and interactive resources. This paper describes the reasons for undertaking this project, the results of the project, and future directions for this project.
Data Mining and Knowledge Discovery in Databases: Implications for Scientific Databases
Authors: Usama M. Fayyad
Venue: Proceedings of the Ninth International Conference on Scientific and Statistical Database Management (1997)

Data Mining and knowledge Discovery in Databases (KDD) promise to play an important role in the way people interact with databases, especially scientific databases where analysis and exploration operations are essential. This is an extended abstract for an invited talk in the conference. In the talk, we define the basic notions in data mining and KDD, define the goals, present motivation, and give a high-level definition of the KDD Process and how it relates to Data Mining. We then focus on data mining methods. Basic coverage of a sampling of methods will be provided to illustrate the methods and how they are used.We cover a case study of a successful application in science data analysis: the classification of cataloging of a major astronomy sky survey covering 2 billion objects in the northern sky. The system can outperform human as well as classical computational analysis tools in astronomy on the task of recognizing faint stars and galaxies. We also cover the problem of scaling a clustering problem to a large catalog database of billions of objects.
Computing approximate tree edit distance using relaxation labeling
Authors: Andrea Torsello, Edwin R. Hancock
Venue: Pattern Recognition Letters (2003)

This paper presents a new method for computing the tree edit distance problem with uniform edit cost. We commence by showing that any tree obtained with a sequence of cut operations is a subtree of the transitive closure of the original tree, we show that the necessary condition for any subtree to be a solution can be reduced to a clique problem in a derived structure. Using this idea we transform the problem of computing tree edit distance into a series of maximum weight clique problems. We, then use relaxation labeling to find an approximation to the tree edit distance.
Analysis of the Effects of Uncertainty, Risk-Pooling, and Subcontracting Mechanisms on Project Performance
Authors: Genaro Gutierrez, Anand Paul
Venue: Operations Research (2000)

The problem of designing a contract mechanism to allocate the component subprojects of a large project to a pool of contractors has important implications for project success. Our research analytically addresses issues involved in diversifying risk for the project owner by partitioning the project and assigning the subprojects to multiple contractors whose performance characteristics are imperfectly known. We begin by giving a precise analytical treatment of the effect of activity variance on expected project duration, characterizing the cases when an increase in activity variance pushes up the expected project duration. In the case of a homogeneous project consisting of serial subprojects, we show that disaggregating the project and assigning the subprojects to the contractors on a piecemeal basis reduces variance of project duration while leaving the mean unchanged. On the other hand, in the case of a homogeneous project consisting of parallel subprojects, aggregating the subprojects and assigning the aggregated project to one of the contractors reduces mean project duration.
Giggle: a framework for constructing scalable replica location services
Authors: Ann Chervenak, Ewa Deelman, Ian Foster, Leanne Guy, Wolfgang Hoschek, Adriana Iamnitchi, Carl Kesselman, Peter Kunszt, Matei Ripeanu, Bob Schwartzkopf, Heinz Stockinger, Kurt Stockinger, Brian Tierney
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

In wide area computing systems, it is often desirable to create remote read-only copies (replicas) of files. Replication can be used to reduce access latency, improve data locality, and/or increase robustness, scalability and performance for distributed applications. We define a replica location service (RLS) as a system that maintains and provides access to information about the physical locations of copies. An RLS typically functions as one component of a data grid architecture. This paper makes the following contributions. First, we characterize RLS requirements. Next, we describe a parameterized architectural framework, which we name Giggle (for GIGa-scale Global Location Engine), within which a wide range of RLSs can be defined. We define several concrete instantiations of this framework with different performance characteristics. Finally, we present initial performance results for an RLS prototype, demonstrating that RLS systems can be constructed that meet performance goals.
On extensions of pseudo-valuations on Hilbert algebras
Authors: Dumitru Buşneag
Venue: Discrete Mathematics (2003)

In Busneag (Math. Japonica 44(2) (1996) 285) I defined a pseudo-valuation on a Hilbert algebra (A,→,1) (cf. (J. Math. 2 (1985) 29; Collection de Logique Math. 21 (1966)) as a real-valued function v on A satisfying v(1) = 0 and v(x → y) ≥ v(y) - v(x) for every x,y ∈ A (v is called a valuation if x = 1 whenever v(x)= 0). In Busneag (Math. Japonica 44(2) (1996) 285) it is proved that every pseudo-valuation (valuation) v induces a pseudo-metric (metric) on A defined by dv(x, y) = v(x → y) + v(y → x) for every x, y ∈ A, under which → is uniformly continuous in both variables. The aim of this paper is to provide several theorems on extensions of pseudo-valuations (valuations).
A Dynamic Programming Based Pruning Method for Decision Trees
Authors: Xiao-Bai Li, James Sweigart, James Teng, Joan Donohue, Lori Thombs
Venue: INFORMS Journal on Computing (2001)

This paper concerns a decision-tree pruning method, a key issue in the development of decision trees. We propose a new method that applies the classical optimization technique, dynamic programming, to a decision-tree pruning procedure. We show that the proposed method generates a sequence of pruned trees that are optimal with respect to tree size. The dynamic-programming-based pruning (DPP) algorithm is then compared with cost-complexity pruning (CCP) in an experimental study. The results of our study indicate that DPP performs better than CCP in terms of classification accuracy.
Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
Authors: A. Campillo, J. I. Farrán
Venue: Mathematics of Computation (2002)

In this paper, we consider some practical applications of the symbolic Hamburger-Noether expressions for plane curves, which are introduced as a symbolic version of the so-called Hamburger-Noether expansions. More precisely, we give and develop in symbolic terms algorithms to compute the resolution tree of a plane curve (and the adjunction divisor, in particular), rational parametrizations for the branches of such a curve, special adjoints with assigned conditions (connected with different problems, like the so-called Brill-Noether algorithm), and the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. Some other computational problems related to algebraic curves over perfect fields can be treated symbolically by means of such expressions, but we deal just with those connected with the effective construction and decoding of algebraic geometry codes.
Freight Handling Personnel Scheduling at Air Cargo Terminals
Authors: Yves Nobert, Jacques Roy
Venue: Transportation Science (1998)

More than ever before, the airline industry must manage its operations very carefully if it is to adapt to the changes in its environment. One important planning problem is the scheduling of freight handling employees at air cargo terminals. Indeed, this area is particularly critical for achieving cost reductions while maintaining customer service levels. This paper presents a new model and an appropriate solution approach for the work-scheduling problem. In particular, a demand leveling procedure is introduced to take advantage of the flexibility that is often encountered in such problems. Experimental results obtained with actual data from a major airline are also presented.
A case for virtual distributed objects
Authors: Randall L. Hyde, Brett D. Fleisch
Venue: Virtual shared memory for distributed architectures (2001)

There are two emerging trends in distributed computing. The first trend is evolving because programming high performance client-server applications is a challenge. Client-server architectures must be designed from the ground up for good performance. Increasingly, we are seeing client-server models evolving away from traditional client-server structures into new structures such as three-tier systems and distributed object systems. Consequently, as the typical architecture used for distributed systems evolves to increase performance, we must also recognize that the complexity of developing software for cost-effective distributed systems increases as we distribute functionality. Error handling must be more robust and messaging more efficient as we move away from centralized server models. As the pressure to decentralize for better performance rises, the increasing number of decentralized servers increases management/administrative complexity.The second converging trend associated with the transition from client/server to peer-to-peer distributed objects is the rapid advance in techniques to support Distributed Shared Memory (DSM). DSM provides an illusion of shared memory for a set of loosely coupled systems. Targeted to the scientific computing community for large-scale scientific computations, DSM has been primarily used to support scientific applications. Whereas originally DSM was envisioned as a means to support an entire paged virtual address space for all machines on the network, current trends suggest sharing smaller entities targeted towards object-oriented systems will become more important over the next decade.In this paper we argue that combining DSM and Remote Method Invocation (RMI) will become the predominant paradigm for distributed computing in the next century augmenting tools such as CORBA, Network OLE/DCOM, and Java RMI. Merging the features of distributed object systems with DSM produces Virtual Distributed Objects (VDOs). VDOs allow systems designers to design high-performance lower-maintenance software. We describe why distributed objects, supported with VDOs using DSM and RMI, could potentially supplant strict client-server structures whose scalability and extensibility are inherently limited.
BAS: a perceptual shape descriptor based on the beam angle statistics
Authors: Nafiz Arica, Fatos T. Yarman Vural
Venue: Pattern Recognition Letters (2003)

The proposed shape descriptor is based on the beams originated from a boundary point, which are defined as lines connecting that point with the rest of the points on the boundary. At each point, the angle between a pair of beams is calculated to extract the topological structure of the boundary. Then, a shape descriptor is defined by using the third-order statistics of all the beam angles in a set of neighborhood systems. It is shown that beam angle statistics (BAS) is invariant to translation, rotation, scale and is insensitive to distortions. Experiments are done on the dataset of MPEG 7 Core Experiments Shape-1. It is observed that BAS outperforms the MPEG 7 shape descriptors.
An Investigation of Prediction Models for Project Management
Authors: Daniel Rodríguez, Rachel Harrison, Manoranjan Satpathy, José Javier Dolado
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

It has been claimed that dynamic prediction models can be used to help project managers make more accurate estimates than static prediction models. However, such a claim needs to be validated so that project managers can use dynamic models with confidence. In this paper, we discuss an experiment we conducted in an academic environment that compared a dynamic model using BBNs with a static model involving the COCOMO and Akiyama models.The results from this experiment in fact validate the above claim. However, we suggest replication of this experiment in order to increase confidence to our results.
Nature Reserve Site Selection to Maximize Expected Species Covered
Authors: Jeffrey D. Camm, Susan K. Norman, Stephen Polasky, Andrew R. Solow
Venue: Operations Research (2002)

We analyze the problem of maximizing the expected number of species in a nature reserve network, subject to a constraint on the number of sites in the network, given probabilistic information about species occurrences. The problem is a nonlinear binary integer program that is NP-hard. We develop a linear integer programming approximation that may be solved with standard integer programming software. We compare the approximation with two other approaches, an expected greedy approach and a probability hurdle approach, using probabilistic data on occurrences of terrestrial vertebrates in the state of Oregon. Results of the approximation and an exact algorithm are compared by using samples from the North American Breeding Bird Survey.
Collaborative Decision Making: A Connectionist Paradigm for Dialectical Support
Authors: T. S. Raghu, R. Ramesh, Ai-Mei Chang, Andrew B. Whinston
Venue: Information Systems Research (2001)

The facilitation and analytical support of argumentation-based collaborative decision making is the focus of this research. We model collaborative decision making as an argumentation process. We develop a connectionist modeling framework, a network representation formalism for argument structures, connectionist network mechanisms, and their models of computations to extract the behavior of argument structures. We use two examples from the case study literature to illustrate the concepts. Several interesting properties of the connectionist network models are observed from our computational results. We find that although the length of the computation is affected by parametric values, the final activation levels of the units are largely unaffected. We observe that the initial activation levels of the defeasible units seem to have no effect on their final activation levels. The proposed modeling approach generates valuable insights into the characteristics of specific argumentative discussions. While the intention of this work is not to introduce the connectionist paradigm as a means to bring arguments to a closure (resolution), we show that certain resolution mechanisms can be easily implemented under the connectionist framework.
DELI: a new run-time control point
Authors: Giuseppe Desoli, Nikolay Mateev, Evelyn Duesterwald, Paolo Faraboschi, Joseph A. Fisher
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

The Dynamic Execution Layer Interface (DELl) offers the following unique capability: it provides fine-grain control over the execution of programs, by allowing its clients to observe and optionally manipulate every single instruction---at run time---just before it runs. DELl accomplishes this by opening up an interface to the layer between the execution of software and hardware. To avoid the slowdown, DELl caches a private copy of the executed code and always runs out of its own private cache.In addition to giving powerful control to clients, DELl opens up caching and linking to ordinary emulators and just-in-time compilers, which then get the reuse benefits of the same mechanism. For example, emulators themselves can also use other clients, to mix emulation with already existing services, native code, and other emulators.This paper describes the basic aspects of DELl, including the underlying caching and linking mechanism, the Hardware Abstraction Mechanism (HAM), the Binary-Level Translation (BLT) infrastructure, and the Application Programming interface (API) exposed to the clients. We also cover some of the services that clients could offer through the DELl, such as ISA emulation, software patching, and sandboxing. Finally, we consider a case study of emulation in detail: the emulation of a PocketPC system on the Lx/ST210 embedded VLIW processor. In this case, DELl enables us to achieve near-native performance, and to mix-and-match native and emulated code.
Supervisory Span, Relational Coordination and Flight Departure Performance: A Reassessment of Postbureaucracy Theory
Authors: Jody Hoffer Gittell
Venue: Organization Science (2001)

There is a rich debate in organizational theory about the contribution of supervisors to group process and performance, and about the span of control needed to make that contribution. In this paper, I summarize the debate and develop competing hypotheses. These competing hypotheses are tested using multisite survey and archival measures, and interpreted using qualitative data from the same study. I find that small supervisory spans improve performance through their positive effects on group process. In particular, supervisors with smaller spans achieved higher levels of relational coordination among their direct reports. Qualitative data suggest that supervisors with smaller spans achieved these results through working with, and providing intensive coaching and feedback to their direct reports.