nils-herrmann/clean_scirepeval huggingface dataset:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

Given an undirected graph with edge costs and a subset ofk=3 nodes calledterminals, a multiway, ork-way, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to find a minimum-cost multiway cut. This problem is Max-SNP hard. Recently, Calinescu et al. (Calinescu, G., H. Karloff, Y. Rabani. 2000. An improved approximation algorithm for Multiway Cut.J. Comput. System Sci.60(3) 564--574) gave a novel geometric relaxation of the problem and a rounding scheme that produced a (3/2-1/ k)-approximation algorithm.In this paper, we study their geometric relaxation. In particular, we study the worst-case ratio between the value of the relaxation and the value of the minimum multicut (the so-called integrality gap of the relaxation). Fork=3, we show the integrality gap is 12/11, giving tight upper and lower bounds. That is, we exhibit a family of graphs with integrality gaps arbitrarily close to 12/11 and give an algorithm that finds a cut of value 12/11 times the relaxation value. Our lower bound shows that this is the best possible performance guarantee for any algorithm based purely on the value of the relaxation. Our upper bound meets the lower bound and improves the factor of 7/6 shown by Calinescu et al.For allk, we show that there exists a rounding scheme with performance ratio equal to the integrality gap, and we give explicit constructions of polynomial-time rounding schemes that lead to improved upper bounds. Fork=4 and 5, our best upper bounds are based on computer-constructed rounding schemes (with computer proofs of correctness). For generalk we give an algorithm with performance ratio 1.3438-e k .Our results were discovered with the help of computational experiments that we also describe here.
2 Definitions and the VCG Mechanism

Motivated by the increasing need to price networks, we study the prices resulting from of a variant of the VCG mechanism, specifically defined for networks [11]. This VCG mechanism is the unique efficient and strategyproof mechanism, however it is not budget-balanced and in fact it is known to result in arbitrarily bad overpayments for some graphs [1, 8]. In contrast, we study more common types of graphs and show that the VCG overpayment is not too high, so it is still an attractive pricing candidate. We prove that the average overpayment in ErdősRenyi random graphs with unit costs is p/(2 − p) for any n, when the average degree is higher than a given threshold. Our simulations show that the overpayment is greater than p/(2 − p) below this threshold, hence, together with the constant upper bound from Mihail et al. , the overpayment is constant regardless of graph size. We then find empirically that the complete graph with random edge costs has worse overpayments, higher than Θ((log n)). Again from simulations, we see that the power-law graph with unit costs has overpayments that decrease with graph size and finally, the power-law graph with uniformly random costs has a small constant overpayment.
Wrapper Induction for End-User Semantic Content Development

The transition from existing World Wide Web content to the Semantic Web relies on the labeling and classification of existing information before it is useful to end-users and their agents. This paper presents a wrapper induction system designed to allow end-users to create, modify, and utilize semantic patterns on unlabeled World Wide Web documents. These patterns allow users to overlay documents with RDF classes and properties, and then to interact with this labeled content within a larger Semantic Web application, such as Haystack.
Toward a Random Operation of Networks

Wire bonding is eliminated in the assembly of microelectronic devices, by a process involving the direct bonding of circuit electrodes to an unsupported metallic sheet-frame member having a plurality of inwardly extending leads. A single-step vibratory pressure welding technique is employed for the simultaneous bonding of all leads to a semiconductor integrated circuit chip. Lateral confinement of the leads during the bonding steps causes a buckling action to introduce a small but critical loop in each lead to ensure clearance between the lead fingers and the perimeter of the semiconductor chip, whereby electrical shorting is avoided. The loop also provides a structural flexibility in the leads, which tends to protect the bonding sites from excessive stresses. Subsequently, the first frame member including the bonded circuit is attached, preferably by resistance welding, to a second lead frame member of heavier gage and increased dimensions, suitable for connection with external circuitry. Excess portions of the first frame member are then removed, providing a completed assembly for packaging; e.g., plastic encapsulation or hermetic sealing, as in a ceramic-glass flat package.
Using urls and table layout for web classification tasks

We propose new features and algorithms for automating Web-page classification tasks such as content recommendation and ad blocking. We show that the automated classification of Web pages can be much improved if, instead of looking at their textual content, we consider each links's URL and the visual placement of those links on a referring page. These features are unusual: rather than being scalar measurements like word counts they are tree structured---describing the position of the item in a tree. We develop a model and algorithm for machine learning using such tree-structured features. We apply our methods in automated tools for recognizing and blocking Web advertisements and for recommending "interesting" news stories to a reader. Experiments show that our algorithms are both faster and more accurate than those based on the text content of Web documents.
Haystack: a user interface for creating, browsing, and organizing arbitrary semistructured information

Much past HCI research has examined the usability concerns of information management software for specific domains such as object-oriented software design, e-mail, and the Web. We believe that many of the results uncovered by these studies are applicable across multiple domains but that more broadly-scoped experiments require a system that can integrate multiple data sources. Haystack is a general-purpose information management environment designed to attack this very problem. Haystack's user interface, which incorporates capabilities from previous research such as context-specific visualization paradigms and attribute-based categorization, is built upon a highly expressive semistructured data model and data integration capabilities. In our demonstration we show how combination of a direct-manipulation-based UI paradigm and an expressive, federated data model can begin to address many of the information management problems plaguing general desktop computing today and can serve as a basis for further, yet unexplored, crossover information interaction experiments.
The Message without the Medium: Unifying Modern Mes- saging Paradigms through the Semantic Web

its inception, the Internet has been a hotbed of successful communications channels, starting off with e-mail, Internet Relay Chat and Usenet newsgroups and more recently adding weblogs, instant messaging, and news feeds. These systems have been de- veloped quite independently over the past half cent ury and con- tinue to be extended with new functionality that ad dresses the broadening needs of their users and supports the fu ll range of semantic expression. Stepping back, however, we observe that having a variety of messaging frameworks creates si gnificant problems for users when attempting to manage and collate mes- sages on a single topic or context that may be disc ussed via multi- ple media. We posit that no message should be const rained in this way by its medium. As it is, messaging applications are slowly converging in their functionalities. We show that a unified ap- proach to messaging can be achieved in a single ste p through appropriate use of the RDF, a Semantic Web technology, as a data model. We further exploit this data model to develo p appropriate user interface elements that allow aggregation of m essages across protocols, and discuss the benefits that arise from such a scenario.
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems

Combinatorial optimization is often used to "plan ahead," purchasing and allocating resources for demands that are not precisely known at the time of solution. This advance planning may be done because resources become very expensive to purchase or difficult to allocate at the last minute when the demands are known. In this work we study the tradeoffs involved in making some purchase/allocation decisions early to reduce cost while deferring others at greater expense to take advantage of additional, late-arriving information. We consider a number of combinatorial optimization problems in which the problem instance is uncertain---modeled by a probability distribution---and in which solution elements can be purchased cheaply now or at greater expense after the distribution is sampled. We show how to approximately optimize the choice of what to purchase in advance and what to defer.
What Would It Mean to Blog on the Semantic Web?

The phenomenon known as Web logging ("blogging") has helped realize an initial goal of the Web: to turn Web content consumers (i.e., end users) into Web content producers. As the Semantic Web unfolds, we feel there are two questions worth posing: (1) do blog entries have semantic structure that can be usefully captured and exploited? (2) is blogging a natural way to encourage growth of the Semantic Web? We explore empirical evidence for answering these questions in the affirmative and propose means to bring blogging into the mainstream of the Semantic Web, including ontologies that extend the RSS 1.0 specification and an XSL transform for handling RSS 0.9x/2.0 files. To demonstrate the validity of our approach we have constructed a semantic blogging environment based on Haystack. We argue that with tools such as Haystack, semantic blogging will be an important paradigm by which metadata authoring will occur in the future.
Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks

In most of the P2P systems developed so far, all nodes play essentially the same role. In some applications, however, different machine capabilities or owner preferences may mean that only a subset of nodes in the system should participate in offering a particular service. Arranging for each service to be supported by a different peer to peer network is, we argue here, a wasteful solution. 
 
Instead, we propose a version of the Chord peer-to-peer protocol that allows any subset of nodes in the network to jointly offer a service without forming their own Chord ring. Our variant supports the same efficient join/leave/insert/delete operations that the subgroup would get if they did form their own separate peer to peer network, but requires significantly less resources than the separate network would. 
 
For each subgroup of k machines, our protocol uses O(k) additional storage in the primal Chord ring. The insertion or deletion of a node in the subgroup and the lookup of the next node of a subgroup all require O(log n) hops.
Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems

Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord’s logarithmic query time and near-optimal data migration cost. 
 
Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items “randomly” into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three). 
 
Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized – for example, if we wish to support range-searches on “ordered” keys. We give a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed.” As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data.
Haystack: a platform for creating, organizing and visualizing semistructured information

1. OVERVIEW In this demonstration we present Haystack, an environment that allows users to easily manage their documents, e-mail, appointments, tasks, and other information . Haystack uses a semistructured data model to describe the connections between different documents in a user’s corpus as well as the metadata concerning each document. This amalgamation provides users with a unified framework for managing all of their information, e.g., documents, e-mails, etc., through a single interface. Furthermore, Haystack’s user interface exposes general tools for navigating the various kinds of information found in users’ corpora.
Sticky notes for the semantic web

Computer-based annotation is increasing in popularity as a mechanism for revising documents and sharing comments over the Internet. One reason behind this surge is that viewpoints, summaries, and notes written by others are often helpful to readers. In particular, these types of annotations can help users locate or recall relevant documents. We believe that this model can be applied to the problem of retrieval on the Semantic Web. In this paper, we propose a generalized annotation environment that supports richer forms of description such as natural language. We discuss how RDF can be used to model annotations and the connections between annotations and the documents they describe. Furthermore, we explore the idea of a question answering interface that allows retrieval based both on the text of the annotations and the annotations associated metadata. Finally, we speculate on how these features could be pervasively integrated into an information management environment, making Semantic Web annotation a first class player in terms of document management and retrieval
On the Feasibility of Peer-to-Peer Web Indexing and Search

This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an overlay network (as in Gnutella), and intersection of index lists stored in a distributed hash table. We present a simple feasibility analysis based on the resource constraints and search workload. Our study suggests that the peer-to-peer network does not have enough capacity to make naive use of either of search techniques attractive for Web search. The paper presents a number of existing and novel optimizations for P2P search based on distributed hash tables, estimates their effects on performance, and concludes that in combination these optimizations would bring the problem to within an order of magnitude of feasibility. The paper suggests a number of compromises that might achieve the last order of magnitude.
A Unified Abstraction for Messaging on the Semantic Web

Since its inception, the Internet has been a hotbed of several successful communications channels, starting off with e-mail, Internet Relay Chat and Usenet newsgroups and more recently adding Web annotation, instant messaging, and news feeds. However, these channels were developed fairly independently, and in many cases their respective functionalities have grown to overlap significantly. For instance, users of these systems have separate identifiers for e-mail, chat, and instant messaging, and clients for these systems all have their own implementations of threaded message views. We believe these problems stem from a lack of a common user interface and data model. In this paper we use basic concepts from the Semantic Web and RDF to unify and model these seemingly disparate messaging paradigms. We also demonstrate a generalized user interface for messaging that uses the data model we have developed. From this process we realize a number of synergies that result from the reduction of overlap and the finer-grained control users are given over message composition, transmission, storage and retrieval.
Assisted Browsing for Semistructured Data

The development of the RDF[2] standard highlights the fact that a great deal of useful information is in the form of semistructured data—objects connected by relations fitting no rigorous schema. To make use of this information it is important to be able to search and browse semistructured data repositories. In this paper, we present a framework, system, and user interface supporting navigation in such repositories. The system is general purpose, involving no hard-coded assumptions about the structure of the repository. The focus is on providing users with helpful “next steps” leading them to the information they are seeking.
Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding

We examine the issue of separation and code design for network data transmission environments. We demonstrate that source-channel sep-aration holds for several canonical network channel models when the whole network operates over a common finite field. Our approach uses linear codes. This simple, unifying framework allows us to re-establish with economy the optimality of linear codes for single transmitter channels and for Slepian-Wolf source coding. It also enables us to establish the optimality of linear codes for multiple access channels and for erasure broadcast channels. Moreover, we show that source-channel separation holds for these networks. This robustness of separation we show to be strongly predicated on the fact that noise and inputs are independent. The linearity of source, channel, and network coding blurs the delineation between these codes, and thus we explore joint linear de-sign. Finally, we illustrate the fact that design for individual network modules may yield poor results when such modules are concatenated, demonstrating that end-to-end coding is necessary. Thus, we argue, it is the lack of decomposability into canonical network modules, rather than the lack of separation between source and channel coding, that presents major challenges for coding in networks.
The role of context in question answering systems

Despite recent advances in natural language question an-swering technology, the problem of designing effective user interfaces has been largely unexplored. We conducted a user study to investigate the problem and discovered that overall, users prefer a paragraph-sized chunk of text over just an exact phrase as the answer to their questions. Fur-thermore, users generally prefer answers embedded in con-text, regardless of the perceived reliability of the source documents. When users research a topic, increasing the amount of text returned to users significantly decreases the number of queries that they pose to the system, suggesting that users utilize supporting text to answer related ques-tions. We believe that these results can serve to guide future developments in question answering user interfaces.
On Randomized Network Coding

We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in , which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of receivers and random coding output links, that decreases exponentially with code length. The proof was based on a result in  relating algebraic network coding to network flows. In this paper, we generalize these results to networks with cycles and delay. We also show, for any given acyclic network, a tighter bound in terms of the probability of connection feasibility in a related network problem with unreliable links. From this we obtain a success probability bound for randomized network coding in link-redundant networks with unreliable links, in terms of link failure probability and amount of redundancy.
What Makes a Good Answer? The Role of Context in Question Answering

Question answering systems have proven to be helpful to users because they can provide succinct answers that do not require users to wade through a large number of documents. However, despite recent advances in the underlying question answering technology, the problem of designing effective interfaces has been largely unexplored. We conducted a user study to investigate this area and discovered that, overall, users prefer paragraph-sized chunks of text over just an exact phrase as the answer to their questions. Furthermore, users generally prefer answers embedded in context, regardless of the perceived reliability of the source documents. When researching a topic, increasing the amount of text returned to users significantly decreases the number of queries that they pose to the system, suggesting that users utilize supporting text to answer related questions. We believe that these results can serve to guide future developments in question answering interfaces.
RDF Authoring Environments for End Users

The Semantic Web enables powerful agent-facilitated negotiation and retrieval functionality by enabling the transfer of machine-readable metadata across the Internet. This next generation Web presupposes the mass availability of metadata such as clothing measurements, busy/free time calendar indications, and dietary restrictions, meaning that users will need to provide more information to their systems to reap the aforementioned benefits. Current tools for capturing ontology-encoded metadata from users are ill-suited for this task, requiring knowledge of ontologies or the ability to navigate generalized abstract directed graphs. In this paper we present user interface paradigms based on the idea that an object can be represented on the screen by an extensible family of views. We present several strategies for allowing users to create RDF metadata by manipulating views, including a drag and drop form-based property editor and a viewbased graph editor. Users benefit from being able to interact with objects by means of views suited to the context at hand, such as photograph representations or human-readable summary descriptions, rather than text fields with plaintext strings or URIs. Finally, we discuss a strategy for enabling advanced users to construct ontologies and customized views and to distribute them to users unfamiliar with modeling knowledge, ultimately giving end users intuitive interfaces for entering metadata.