ppxscal/embedding_network huggingface dataset:
A statistical learning learning model of text classification for support vector machines
Authors: Thorsten Joachims
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

This paper develops a theoretical learning model of text classification for Support Vector Machines (SVMs). It connects the statistical properties of text-classification tasks with the generalization performance of a SVM in a quantitative way. Unlike conventional approaches to learning text classifiers, which rely primarily on empirical evidence, this model explains why and when SVMs perform well for text classification. In particular, it addresses the following questions: Why can support vector machines handle the large feature spaces in text classification effectively? How is this related to the statistical properties of text? What are sufficient conditions for applying SVMs to text-classification problems successfully?
Improved algorithms for fault tolerant facility location
Authors: Sudipto Guha, Adam Meyerson, Kamesh Munagala
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider a generalization of the classical facility location problem, where we require the solution to be fault-tolerant. Every demand point j is served by rj facilities instead of just one. The facilities other than the closest one are &ldquo;backup&rdquo; facilities for that demand, and will be used only if the closer facility (or the link to it) fails. Hence, for any demand, we assign non-increasing weights to the routing costs to farther facilities. The cost of assignment for demand j is the weighted linear combination of the assignment costs to its rj closest open facilities. We wish to minimize the sum of the cost of opening the facilities and the assignment cost of each demand j. We obtain a factor 4 approximation to this problem through the application of various rounding techniques to the linear relaxation of an integer program formulation. We further improve this result to 3.16 using randomization and to 2.47 using greedy local-search type techniques.
A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
Authors: Joshua Levin
Venue: Communications of the ACM (1976)

An algorithm for drawing pictures of three-dimensional objects, with surfaces made up of patches of quadric surfaces, is described. The emphasis of this algorithm is on calculating the intersections of quadric surfaces. A parameterization scheme is used. Each quadric surface intersection curve (QSIC) is represented as a set of coefficients and parameter limits. Each value of the parameter represents at most two points, and these may easily be distinguished. This scheme can find the coordinates of points of even quartic (fourth-order) intersection curves, using equations of no more than second order. Methods of parameterization for each type of QSIC are discussed, as well as surface bounding and hidden surface removal.
Smart distance and WWWaware: a multi-agent approach
Authors: Yiming Ye, Stephen Boies, Paul Huang, John Tsotsos
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We propose the concept of a smart distance and the concept of an awareness network in a distributed collaborative environment. We illustrate the architecture of an Agent Mediated Collaborative system, the Agent- Buddy system, that can create a sense of group presence and at the same time preserve the privacy of each user. Virtual springs systems are used to model the awareness degrees among team members. Each agent makes decisions by considering multiple factors. The goal of the multiagent team is to minimize the global awareness frustrations with respect to different kinds of tasks. Empirical studies have been conducted to analyze the influence of individual behavior on global performance for various situations.
Computing and data grids for science and engineering
Authors: William E. Johnston, Dennis Gannon, Bill Nitzberg, Leigh Ann Tanner, Bill Thigpen
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We use the term "Grid" to refer to a software system that provides uniform and location independent access to geographically and organizationally dispersed, heterogeneous resources which are persistent and supported. While, in general, Grids will provide the infrastructure to support a wide range of services in the scientific environment (e.g. collaboration and remote instrument control) in this paper we focus on services for high performance computing and data handling. We describe the services and architecture of NASA's Information Power Grid ("IPG")-an early example of a large-scale Grid-and some of the issues that have come up in its implementation.
Andamooka: Open Support for Open Content
Authors: David Sweet
Venue: Linux Journal (2001)

Open-source software development provides an inspirational model for books.
Solvability by radicals from an algorithmic point of view
Authors: G. Hanrot, F. Morain
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to find suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extensions of prime degree and then work out the radicals, using the work of Girstmair. We give numerical examples of Abelian and non-Abelian solvable equations and apply the general framework to the construction of Hilbert Class fields of imaginary quadratic fields.
Nonhomogeneous Markov Decision Processes with Borel State Space--The Average Criterion with Nonuniformly Bounded Rewards
Authors: Xianping Guo, Jianyong Liu, Ke Liu
Venue: Mathematics of Operations Research (2000)

This paper deals with nonhomogeneous Markov decision processes with Borel state space and nonuniformly bounded rewards under the average criterion. First, under the minorant-type assumption we prove the existence of an appropriate solution to the optimality equations. Second, from the optimality equations we also establish the existence of e(=0)-optimal Markov policies under the additional conditions. Third, some sufficient conditions for the validity of the assumptions in this paper and several examples such as inventory/production systems are provided. Finally, as an application of the optimality equations, a rolling horizon algorithm is given.
Correction: practical implementations of non-blocking synchronization primitives
Authors: Mark Moir
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

I describe a problem with an algorithm in my previous paper &ldquo;Practical Implementations of Synchronization Primitives&rdquo;, and its correction.
Aurora: a conceptual model for Web-content adaptation to support the universal usability of Web-based services
Authors: Anita W. Huang, Neel Sundaresan
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Users of the World Wide Web (Web) have a diverse set of needs, abilities, and goals. To achieve universal usability, the Web today calls for the development of new systems that enable the same content to be adapted for display according to these various needs. This paper presents Aurora, an extensible transcoding system that targets and adapts content in existing Web pages to help the broadest population of users, particularly in the disabled community, to obtain various Web-based services, such as auction, search engine, travel, etc. The system adapts Web content based on semantic rather than syntactic constructs&mdash;facilitating navigation by streamlining the Web interface according abstract user goals. In addition, it provides the capability to adapt this content to meet the specific needs of any number of user groups. This paper puts forth a conceptual abstraction, called the transaction model, for conceptually classifying Web data to meet these goals. It discusses how Aurora uses this model, through an XML-based framework, to semantically transcode existing Web content. The result is an alternative, adaptable Web interface that better supports universal usability.
Middleware for dependable network services in partitionable distributed systems
Authors: Alberto Montresor, Renzo Davoli, Özalp Babaoğlu
Venue: ACM SIGOPS Operating Systems Review (2001)

We describe the design and implementation of Jgroup: a middleware system that integrates group technology with distributed objects and is based on Java RMI. Jgroup supports a programming paradigm called object groups and enables development of dependable network services based on replication. Among the novel features of Jgroup is a uniform object-oriented interface for programming both services and their clients. The fact that Jgroup exposes network effects, including partitions, to applications makes it particularly suitable for developing highly-available services in partitionable distributed systems.
Performance-driven multi-level clustering with application to hierarchical FPGA mapping
Authors: Jason Cong, Michail Romesis
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven multi-level clustering problem is NP-hard (in contrast to the fact that single-level performance-driven clustering can be solved in polynomial time optimally). Then, we present an efficient heuristic for two-level clustering for delay minimization. It can also provide area-delay trade-off by controlling the amount of node duplication. The algorithm is applied to Altera's latest APEX FPGA architecture which has a two-level hierarchy. Experimental results with combinational circuits show that with our performance-driven two-level clustering solution we can improve the circuit performance produced by the Quartus Design System from Altera by an average of 15% for APEX devices measured in terms of delay after final layout. To our knowledge this is the first in-depth study for the performance-driven multi-level circuit clustering problem.
&ldquo;Interactive rooms&mdash;augmented reality in an architectural perspective&rdquo;
Authors: Peter G. Krogh
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

This paper will discus aspects of applying augmented reality technologies in architecture through experiments conducted in full-scale, and seen through the concept of atmosphere in architecture. Working with augmented reality in an architectural perspective brings a set of new artistic effects that will change the perception of the architectural space. The theories and experiments described in this paper take their departure in working interdisciplinary with full-scale models taking in considerations of both enhanced digital functions and as well as architectural working methods.
Applications of differential equations in general problem solving
Authors: R. W. Klopfenstein
Venue: Communications of the ACM (1965)

A large class of problems leading to digital computer processing can be formulated in terms of the numerical solution of systems of ordinary differential equations. Powerful methods are in existence for the solution of such systems. A good general purpose routine for the solution of such systems furnishes a powerful tool for processing many problems. This is true from the point of view of ease of programming, ease of debugging, and minimization of computer time. A number of examples are discussed in detail.
The structure of modular program
Authors: Joshua Turner
Venue: Communications of the ACM (1980)

Choosing the right program structures can lead to better programs, says Joshua Turner. He advocates modular design to make large programs more manageable. Turner reviews the possible structural relationships between the modules of a program and generates a tentative morphology of program structure types. He concludes that, with some exceptions, the hypothetical pure tree structure is the best choice for most data processing applications.
Sneaking in extra material (panel session)
Authors: Daniel Joyce
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Did you ever wish you could sneak some extra material into a course but it just doesn't fit with the syllabus and there's not enough time to add another unit to an already crowded calendar? In this Tips and Techniques I described how I snuck some computing history into an introductory programming course.
BLUE: an alternative approach to active queue management
Authors: Wu-Chang Feng, Dilip Kandlur, Debanjan Saha, Kang G. Shin
Venue: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video (2001)

This paper exposes an inherent weakness in current active queue manage ment techniques such asRedin that they rely on queue lengths to indicate the severity of congestion. In light of this observation, a fundamentally different active queue management algorithm calledBlueis proposed.Blueuses packet loss and link utilization to manage congestion. Using simulation and controlled experiments,Blueis shown to significantly outperformRedin providing lower packet loss rates and smaller queuing delays to networked applications such as interactive audio and video.
Intelligent agents for an artificial market system
Authors: Nikos Karacapilidis, Pavlos Moraïtis
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper describes an agent- based artificial market system whose underlying interaction protocols provide advanced features. Using the system, actors (i. e., customers and merchants) can delegate a variety of tasks to personal intelligent agents that act as their artificial employees. Contrary to other approaches, where a new agent is launched when their associated actors intend to perform a buying or selling transaction and &ldquo;lives&rdquo; only while this transaction is processed, our approach builds on a personalization of agents that permanently &ldquo;live&rdquo; in the market representing their actors' interests. Beyond just requesting and proposing an offer, agents in our system maintain a profile of their owners, which is updated upon the actor- agent interaction type. Furthermore, they can proactively ask their owners permission to initiate a transaction (e. g., when a new product, which match ones profile, appears in the market). The system is also enabled with a highly interactive multiple criteria decision making tool that can handle ill- structured information during a purchase transaction, and perform a progressive synthesis and comparative evaluation of the existing proposals.
Lamport on mutual exclusion: 27 years of planting seeds
Authors: James H. Anderson
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Mutual exclusion is a topic that Leslie Lamport has returned to many times throughout his career. This article, which is being written in celebration of Lamport's sixtieth birthday, is an attempt to survey some of his many contributions to research on this topic.
Acquiring a Complete 3D Model from Specular Motion under the Illumination of Circular-Shaped Light Sources
Authors: Jiang Yu Zheng, Akio Murata
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

In this work, we recover 3D models of objects with specular surfaces. An object is rotated and its continuous images are taken. Circular-shaped light sources that generate conic rays are used to illuminate the rotating object in such a way that highlighted stripes can be observed on most of the specular surfaces. Surface shapes can be computed from the motions of highlights in the continuous images; either specular motion stereo or single specular trace mode can be used. When the lights are properly set, each point on the object can be highlighted during the rotation. The shape for each rotation plane is measured independently using its corresponding epipolar plane image. A 3D shape model is subsequently reconstructed by combining shapes at different rotation planes. Computing a shape is simple and requires only the motion of highlight on each rotation plane. The novelty of this paper is the complete modeling of a general type of specular objects that has not been accomplished before.
Incorporation of units into programming languages
Authors: Michael Karr, David B. Loveman,  III
Venue: Communications of the ACM (1978)

The issues of how a programming language might aid in keeping track of physical units (feet, sec, etc.) are discussed. A method is given for the introduction of relationships among units (a watt is volts*amps, a yard is three feet) and subsequent automatic conversion based upon these relationships. Various proposals for syntax are considered.
Signature schemes based on the strong RSA assumption
Authors: Ronald Cramer, Victor Shoup
Venue: ACM Transactions on Information and System Security (TISSEC) (2000)

We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called strong RSA assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption.
Distributed MST for constant diameter graphs
Authors: Zvi Lotker, Boaz Patt-Shamir, David Peleg
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most B bits for some parameter B. It is shown that the time required to compute an MST for graphs of diameter 4 or 3 can be as high as &OHgr;(3&radic;n/B) and &OHgr;(4&radic;n/2&radic;B), respectively. The lower bound holds even if the algorithm is allowed to be randomized. On the other hand, it is shown that O(log n) time units suffice to compute an MST deterministically for graphs with diameter 2, when B = O(log n). These results complement a previously known lower bound of &OHgr;(2&radic;n/B) for graphs of diameter &OHgr;(log n).
Extensible protected types: proposal status
Authors: A. J. Wellings, B. Johnson, B. Sanden, J. Kienzle, T. Wolf, S. Michell
Venue: Proceedings of the 10th international workshop on Real-time Ada workshop (2001)

At the last workshop, the issue of being able to extend protected types in the same manner as tagged types was discussed. The conclusion was that further consideration was needed before a definitive proposal could be made. This Position Paper summarises a full proposal and identifies the outstanding issues.
Molecular simulation of rheological properties using massively parallel supercomputers
Authors: R. K. Bhupathiraju, S. T. Cui, S. Gupta, H. D. Cochran, P. T. Cummings
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Advances in parallel supercomputing now make possible molecular-based engineering and science calculations that will soon revolutionize many technologies, such as those involving polymers and those involving aqueous electrolytes. We have developed a suite of message-passing codes for classical molecular simulation of such complex fluids and amorphous materials and have completed a number of demonstration calculations of problems of scientific and technological importance with each (described at the World Wide Web site http://flory.engr.utk.edu/ldrd). In this paper, we will focus on the molecular simulation of rheological properties, particularly viscosity, of simple and complex fluids using parallel implementations of non-equilibrium molecular dynamics. Such calculations represent significant challenges computationally because, in order to reduce the thermal noise in the calculated properties within acceptable limits, large systems and/or long simulated times are required.
Parametric Design Synthesis of Distributed Embedded Systems
Authors: Dong-In Kang, Richard Gerber, Manas Saksena
Venue: IEEE Transactions on Computers (2000)

This paper presents a design synthesis method for distributed embedded systems. In such systems, computations can flow through long pipelines of interacting software components, hosted on a variety of resources, each of which is managed by a local scheduler. Our method automatically calibrates the local resource schedulers to achieve the system's global end-to-end performance requirements. A system is modeled as a set of distributed task chains (or pipelines), where each task represents an activity requiring nonzero load from some CPU or network resource. Task load requirements can vary stochastically due to second-order effects like cache memory behavior, DMA interference, pipeline stalls, bus arbitration delays, transient head-of-line blocking, etc. We aggregate these effects¿along with a task's per-service load demand¿and model them via a single random variable, ranging over an arbitrary discrete probability distribution. Load models can be obtained via profiling tasks in isolation or simply by using an engineer's hypothesis about the system's projected behavior. The end-to-end performance requirements are posited in terms of throughput and delay constraints. Specifically, a pipeline's delay constraint is an upper bound on the total latency a computatation can accumulate, from input to output. The corresponding throughput constraint mandates the pipeline's minimum acceptable output rate¿counting only outputs which meet their delay constraints. Since per-component loads can be generally distributed, and since resources host stages from multiple pipelines, meeting all of the system's end-to-end constraints is a nontrivial problem. Our approach involves solving two subproblems in tandem: 1) finding an optimal proportion of load to allocate to each task and channel and 2) deriving the best combination of service intervals over which all load proportions can be guaranteed. The design algorithms use analytic approximations to quickly estimate output rates and propagation delays for candidate solutions. When all parameters are synthesized, the estimated end-to-end performance metrics are rechecked by simulation. The per-component load reservations can then be increased, with the synthesis algorithms rerun to improve performance. At that point, the system can be configured according to the synthesized scheduling parameters¿and then revalidated via on-line profiling. In this paper, we demonstrate our technique on an example system, and compare the estimated performance to its simulated on-line behavior.
Some comments on the use of ambiguous decision tables and their conversion to computer programs
Authors: P. J. H. King, R. G. Johnson
Venue: Communications of the ACM (1973)

This paper comments upon recently published work on decision table translation using methods similar to the rule-mask technique. The applicability of these methods under various possible conventions on overall table meaning is discussed, and it is argued that there is a place both for the multi-rule and the single-rule (or action set) convention in decision table usage.