ppxscal/embedding_network huggingface dataset:
A competitive scheduling problem and its relevance to UMTS channel assignment
Venue: Networks (2004)

This article investigates a two-user competitive scheduling problem. The problem arises in a Universal Mobile Telecommunication System &lpar;UMTS&rpar; developed within the European IST project FUTURE: given two mobile terminals, one wants to maximize the on-time data packets transmitted to one user, while guaranteeing a certain amount of on-time data packets to the other. We show that the problem is NP-hard, despite peculiar properties of data and solutions. We propose a fast lagrangian heuristic able to cope with a severe real-time requirement, and compare it to a greedy-like heuristic on a set of practical instances. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 132&ndash;141 2004
Modeling Beliefs and Solution Strategies in a Distributed Learning System
Authors: Rose Joshua, David H. Scuse
Venue: The Journal of Supercomputing (2005)

We present algorithms guiding the identification of student solution strategies in the Domain-Independent Adaptive Tutoring System (DIATS). The DIATS is a distributed computer-assisted instruction system with a prototype in the domain of psychiatric mental disorders. Problems are solved using differential diagnosis decision trees from the DMS-IV-TR. Student solution strategy identification is performed by the Response Analysis Unit of the modeler. The Domain-Independent Adaptive Tutoring System (DIATS) has a distributed architecture that combines shared-data and client-server styles.
Routing Jobs to Servers with Deterministic Service Times
Authors: Dinard van der Laan
Venue: Mathematics of Operations Research (2005)

In this paper we consider the problem of routing deterministic arriving jobs to parallel servers with deterministic (distinct) service times, where we assume that the arrival rate of the jobs is equal to the total service capacity of the servers. Our goal is to find routing policies that minimize the long-run average waiting time of the arriving jobs. We give lower and upper bounds for the minimal long-run average waiting time, and we present results on the structure of optimal policies. We derive mathematical programming problems that can be solved to obtain optimal routing policies, and for a single queue we have results on routing according to a regular sequence to that queue. Finally, we discuss several algorithms to obtain within reasonable time good but generally not optimal deterministic routing policies.
Language Systems, Inc.: description of the DBG system as used for MUC-3
Authors: Christine A. Montgomery, Bonnie Glover Stalls, Robert S. Belvin, Robert E. Stumberger
Venue: Proceedings of the 3rd conference on Message understanding (1991)

LSI's Data Base Generation (DBG) approach to natural language understanding is characterized by three main features: First, the DBG system is comprehensive. It performs full-scale lexical, syntactic, semantic, and discourse analyses of the entire message text being processed and produces a complete knowledge representation of the text. Second, the DBG system is modular and flexible. The modular and transparent system architecture ensures easy extension, maintenance, and upgrading of the system. And, third, the DBG system is generic but at the same time domain-sensitive. It applies domain modeling to text interpretation, which enables the extension of the system to any number of new domains. In addition, it provides a powerful capability for handling unknown data in familiar domains. DBG's development has been based on analysis of large volumes of message traffic (thousands of Air Force and Army messages) in five domains, as described below. The system can currently process a large number of messages in each of these domains and has been formally tested on previously unseen messages in three of these, with competitive tests against humans performing the same task in two domains. The functional flow of the DBG system is shown in Figure 1 (actually Figure 1 of our site report [Language Systems Inc: MUC-3 Test Results and Analysis] in this proceedings).
Overlap and channel errors in adaptive vector quantization for image coding
Authors: Francesco Rizzo, James A. Storer, Bruno Carpentieri
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Adaptive vector quantization (AVQ) is a flexible adaptive single pass image compression method, with fast decompression time, for which practical compression achieved compares favorably with existing methods such as the JPEG standard and traditional trained VQ. In this paper we analyze its asymptotic performance for the lossless case and present variations to limit the effect of transmission errors on the decoding image.
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
Authors: Utku Irmak, Torsten Suel
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the internet over much slower dialup or wireless links. To address this issue, a number of techniques for optimized delivery of web and multimedia content over slow links have been proposed, including protocol optimizations, caching, compression, and multimedia transcoding, and several large ISPs have recently begun to widely promote dialup acceleration services based on such techniques. A recent paper by Rhea, Liang, and Brewer proposed an elegant technique called value-based caching that caches substrings of files, rather than entire files, and thus avoids repeated transmission of substrings common to several pages or page versions.We propose and study a hierarchical substring caching technique that provides significant savings over this basic approach. We describe several additional techniques for minimizing overheads and perform an evaluation on a large set of real web access traces that we collected. In the second part of our work, we compare our approach to a widely studied alternative approach based on delta compression, and show how to integrate the two for best overall performance. The studied techniques are typically employed in a client-proxy environment, with each proxy serving a large number of clients, and an important aspect is how to conserve resources on the proxy while exploiting the significant memory and CPU power available on current clients.
A fast numerical method for time-resolved photon diffusion in general stratified turbid media
Authors: Alex H. Barnett
Venue: Journal of Computational Physics (2004)

Efficient forward models of photon migration in complex geometries are important for noninvasive imaging of tissue in vivo with diffuse optical tomography (DOT). In particular, solving the inverse problem requires multiple solutions of the forward model and is therefore computationally intensive. We present a numerical algorithm for the rapid solution of the time-dependent diffusion equation in a semi-infinite inhomogeneous medium whose scattering and absorption coefficients are arbitrary functions of depth, given a point source impulsive excitation. Such stratified media are biomedically important. A transverse modal representation leads to a series of one-dimensional diffusion problems which are solved via finite-difference methods. A novel time-stepping scheme allows effort to scale independently of total time (for fixed system size). Tayloring to the DOT application gives run times of order 0.1 s. We study convergence, computational effort, and validate against known solutions in the case of 2-layer media. The method will be useful for other forward and inverse diffusion problems, such as heat conduction and conductivity measurement.
Competitor See, Competitor Do: Incumbent Entry in New Market Niches
Authors: Marion Debruyne, David J. Reibstein
Venue: Marketing Science (2005)

The ability to keep up with changing technology is critical for a company's long-term survival. However, companies have to balance the risk of rushing into new areas and potentially cannibalizing their existing business against the risk of missing the emerging market. This paper investigates when incumbents enter into new market niches created by technological innovation. We argue that market conditions and company-specific characteristics do not suffice to explain incumbents' entry timing, but that entry is a contagious process. Our results demonstrate that incumbents are more likely to respond to innovations in their industry when their counterparts do so. In particular, we show that incumbents are affected by the entry of firms that are similar in size and resources. When a highly similar company enters the new market, it raises the probability that the company enters itself beyond levels based solely on the attractiveness of the market.
Ant: The Definitive Guide
Authors: Steve Holzner, Daniel Nehren, Ben Galbraith
Venue:  (2005)

As the most widely used tool for cross-platform development, Ant has undergone a number of important changes in its functionality and use since its launch. Ant: The Definitive Guide, 2nd Edition has been reworked to reflect these changes for Java developers everywhere. Topics covered include everything from downloading and installing, to using Ant to build Web applications, to using Ant to test code.
Demo: ontology-based context-aware delivery of extended points of interest
Authors: Alessandra Agostini, Claudio Bettini, Daniele Riboni
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Context-awareness in mobile and ubiquitous computing requires the acquisition, representation and processing of context information which is not limited to the device features, network status, or user location but includes semantically rich data like user preferences and user current activity.
Costs of Environmental Fluctuations and Benefits of Dynamic Decentralized Foraging Decisions in Honey Bees
Authors: Thomas Schmickl, Karl Crailsheim
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Honey bees show the impressive ability to choose collectively (through swarm intelligence) between nectar sources of different quality by selecting the energetically optimal one. We here present results from a multi-agent simulation of a cohort of foraging bees. The model, which is built on proximate individual mechanisms, leads to interesting results on the (global) colony level. The simulation allows us to investigate collective foraging decisions in a variety of experimental setups that can be reproduced experimentally with real bees. Because our model allows us to project the daily net honey gain of the simulated honey bee colony, it enables us to explore the economic results of foraging decisions, even in a fluctuating environment. We used the model to investigate the dynamics and efficiency of a bee colony's decentralized decision system in terms of minimizing the potential cost of lost nectar income due to changes in food quality in a fluctuating environment.
Website Visitor Classification Using Machine Learning
Authors: P. Defibaugh-Chavez, S. Mukkamala, A. H. Sung
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Classifying website visitors allows organizations to present customized content and effectively allocate resources. Traditional methods of visitor classification involve tracking individual users over many sessions via a unique identifier such as the IP address or a cookie. These methods are either too general or strip the visitor of a level of privacy. In this paper we use machine learning techniques to classify visitors of a data-centric website using a minimal amount of information and without a unique identifier. We are able to group visitors into groups without extended user tracking.
A space of layout styles for hierarchical graph models of software systems
Authors: Andreas Noack, Claus Lewerentz
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Hierarchical graphs are widely used as models of the structure of software systems. A central problem in the visualization of hierarchical graphs is the computation of layouts, i.e. of positions of the nodes in two- or three-dimensional space. We derive requirements for graph layouts from various software analysis questions, and classify the required layouts along three dimensions: layouts with meaningful distances between single nodes vs. layouts with meaningful distances between groups of nodes, layouts reflecting adjacency vs. layouts reflecting hierarchy, and layouts that faithfully reflect the size of subgraphs vs. layouts where certain subgraphs are magnified. We present a fairly simple and theoretically validated energy model for computing such layouts.
Dynamic virtual environment to test teleoperated systems with time delay communications
Authors: J. M. Sabater, J. M. Azorín, O. Reinoso, R. P. Ñeco, N. M. García
Venue: Journal of Robotic Systems (2005)

This paper presents a dynamic virtual environment tool for training operators and to prove different control schemes in telerobotic systems, and describes virtual reality environments used in teleoperated robotic systems. In the presented tool, the kinematic and dynamic model of the remote environment which is manipulating the operator is considered. The paper also describes how time delays in the communication channel can be easily added to the simulator, in order to analyze their effects in the teleoperated system. Finally, some experimental results achieved with this virtual teleoperated system are shown. With the presented dynamic simulator, different control schemes designed to overcome the time delay problem could be tested. &copy; 2005 Wiley Periodicals, Inc.
Removal of Interferential Curve from Text Image
Authors: Zhiguo Cheng, Yuncai v
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

A general algorithm for eliminating interferential curve in text image was proposed, which converted images into basic graph and super graph firstly, and then treated interferential curve as principal curve to detect principal curve in image. In the detection, improved shortest path algorithm and orientation offset algorithm were used, and finally, the detected curve was removed from original image. Experiments conducted with a variety of text images showed that this algorithm is effective for removing interferential curve in text image.
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Venue: PPPJ; Vol. 91 (2004)

It gives me great pleasure to welcome you to Las Vegas, Nevada for the 3rd International Conference on Principles and Practice of Programming in Java.Forty one papers were submitted and a total of twenty four (58%) have been selected for presentation and inclusion in this proceedings.A wide range of topics is covered in the papers, all the way from Java Bytecode Sequences through to Web Applications.
Slack borrowing in flip-flop based sequential circuits
Authors: Amit Jain, David Blaauw
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, we have modelled the flip-flop clock to output delay dependency on the data arrival time and introduced this phenomenon in timing analysis. Traditionally, finding the minimum clock period of a flip-flop based sequential design was based on the assumption that the setup-time and clock to output delay of a flip-flop are constant and hence each stage of the pipeline can be analyzed independently. However, it is well known that the delay of a flip-flop depends on the data arrival time at its input and hence there exists an interdependence among different pipeline stages. The problem of finding the minimum clock period of such a coupled system is a non-trivial problem. In this paper, we formu-late the problem of finding the minimum clock period of a flip-flop based sequential circuit accounting for these dependencies. We show that the problem is a non-linear convex optimization problem. We propose three different solution approaches and compare their results on ISCAS '89 sequential benchmark circuits. Modeling these data arrival time dependencies we have seen a consistent decrement of approximately 50-60ps compared to the traditional approach using constant setup-time and flip-flop delays. We also show how the analysis can be extended to account for hold time constraints for short paths in the circuit.
Fast and simple distributed consensus
Authors: James E. Burns, Gil Neiger
Venue: Distributed Computing (1994)

The problem of fault-tolerant agreement is fundamental to distributed computing. When agreement is to be reached in spite of arbitrary behavior by faulty processors, this problem is called Distributed Consensus. By requiring that the number of faulty processors be O(√n), where n is the number of processors in the system, we are able to derive two new protocols for Distributed Consensus. Both are simple and use messages that are only one bit in length, and both provide for early stopping: the fewer failures there are, the fewer rounds of communication are required. One protocol is optimal with respect to the number of rounds of communication required, and the other is asymptotically optimal with respect to the total number of message bits exchanged.
Tangible Augmented Interfaces for Structural Molecular Biology
Authors: Alexandre Gillet, Michel Sanner, Daniel Stoffler, Arthur Olson
Venue: IEEE Computer Graphics and Applications (2005)

With the prevalence of structural and genomic data, molecular biology has become a human-guided,computer-assisted endeavor. The computer assists the essential human function in two ways: Forexploring scientific data, it searches for and tests scientific hypotheses. For collaborating between two or more scientists, it shares knowledge and expertise. As databases grow, as structure and process models become more complex, and as software methods become more diverse, access and manipulation of digital information is increasingly a critical issue for research and collaboration in molecular biology.
Symbolic bounds analysis of pointers, array indices, and accessed memory regions
Authors: Radu Rugina, Martin C. Rinard
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

This article presents a novel framework for the symbolic bounds analysis of pointers, array indices, and accessed memory regions. Our framework formulates each analysis problem as a system of inequality constraints between symbolic bound polynomials. It then reduces the constraint system to a linear program. The solution to the linear program provides symbolic lower and upper bounds for the values of pointer and array index variables and for the regions of memory that each statement and procedure accesses. This approach eliminates fundamental problems associated with applying standard fixed-point approaches to symbolic analysis problems. Experimental results from our implemented compiler show that the analysis can solve several important problems, including static race detection, automatic parallelization, static detection of array bounds violations, elimination of array bounds checks, and reduction of the number of bits used to store computed values.
STEP: Self-Tuning Energy-safe Predictors
Authors: James Larkby-Lahet, Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chrysanthis
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Data access prediction has been proposed as a mechanism to overcome latency lag, and more recently as a means of conserving energy in mobile systems. We present a fully adaptive predictor, that can optimize itself for any arbitrary workload, while simultaneously offering simple adjustment of goals between energy conservation and latency reduction. Our algorithm. STEP, achieves power savings on mobile computers by eliminating more data fetches, which would otherwise have caused excess energy to be consumed in accessing local storage devices or using the wireless interface to fetch remote data. We have demonstrated our algorithm to perform as well as some of the best access predictors, while incurring almost none of the associated increase in I/O workloads typical of their use. Our algorithm reduced average response times by approximately 50% compared to an LRU cache, while requiring less than half the I/O operations that traditional predictors would require to achieve the same performance, thereby incurring no energy penalty.
Projection-homeomorphic surfaces
Authors: F. Chazal, A. Lieutier, J. Rossignac
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Consider two (n - 1)-dimensional manifolds, S and S' in Rn. We say that they are projection-homeomorphic when the closest projection of each one onto the other is a homeomorphism. We give tight conditions under which S and S' are projection-homeomorphic. These conditions involve the local feature size for S and for S' and the Hausdorff distance between them. Our results hold for arbitrary n.
Block Preconditioners for LDG Discretizations of Linear Incompressible Flow Problems
Authors: Kanschat Guido
Venue: Journal of Scientific Computing (2005)

We present a block preconditioner for LDG discretizations of Stokes equations. The dependence of its performance on the discretization parameters is investigated. An extension to Oseen equations is shown, yielding efficient and robust solvers in a wide regime of Reynolds numbers.
A multi-agent infrastructure for developing personalized web-based systems
Authors: Liliana Ardissono, Anna Goy, Giovanna Petrone, Marino Segnan
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

Although personalization and ubiquity are key properties for on-line services, they challenge the development of these systems due to the complexity of the required architectures. In particular, the current infrastructures for the development of personalized, ubiquitous services are not flexible enough to accommodate the configuration requirements of the various application domains. To address such issues, highly configurable infrastructures are needed.In this article, we describe Seta2000, an infrastructure for the development of recommender systems that support personalized interactions with their users and are accessible from different types of devices (e.g., desktop computers and mobile phones). The Seta2000 infrastructure offers a built-in recommendation engine, based on a multi-agent architecture. Moreover, the infrastructure supports the integration of heterogeneous software and the development of agents that can be configured to offer specialized facilities within a recommender system, but also to dynamically enable and disable such facilities, depending on the requirements of the application domain. The Seta2000 infrastructure has been exploited to develop two prototypes: SeTA is an adaptive Web store personalizing the recommendation and presentation of products in the Web. INTRIGUE is a personalized, ubiquitous information system suggesting attractions to possibly heterogeneous tourist groups.