ppxscal/embedding_network huggingface dataset:
Market-mechanisms to reduce pollution
Authors: Esfir Freitsis, Sarit Kraus
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

There are situations in which plants located in the same geographical area need to reduce air pollution by a given percentage for a short time period because of external factors. The default solution currently being implemented is simply the reduction of emission by each plant by the appropriate required percentage. However, the cost to the different plants for the reduction of a given pollutant may be different, and therefore there are allocations that are more profitable to all the plants than the default one. In such environments, each plant has incomplete information about the other plants' utility functions. We propose three market mechanisms to allocate the pollution permits. Simulation results show that one of the greedy market mechanisms that we propose leads to allocations that yield the plants an average utility that is very close to the optimal.
The character, value, and management of personal paper archives
Authors: Steve Whittaker, Julia Hirschberg
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2001)

We explored general issues concerning personal information management by investigating the characteristics of office workers' paper-based information, in an industrial research environment. we examined the reasons people collect paper, types of data they collect, problems encountered in handling paper, and strategies used for processing it. We tested three specific hypotheses in the course of an office move. The greater availability of public digital data along with changes in people's jobs or interests should lead to wholescale discarding of paper data, while preparing for the move. Instead we found workers kept large, highly valued papar archives. We also expected that the major part of people's personal archives would be unique documents. However, only 49% of people's archives were unique documents, the remainder being copies of publicly available data and unread information, and we explore reasons for this. We examined the effects of paper-processing strategies on archive structure. We discovered different paper-processing strategies (filing and piling)that were relatively independent of job type. We predicated that filers' attempted to evaluate and catergorize incoming documents would produce smaller archives that were accessed frequently. Contrary to our predictions, filers amassed more information, and accessed it less frequently than pilers. We argue that filers may engage in premature filing: to clear their workspace, they archives information that later turns out to be of low value. Given the effort involved in organzing data, they are also loath to discard filed information, even when its value is uncertain. We discuss the implications of this research for digital personal information management.
Omnistereo: Panoramic Stereo Imaging
Authors: Shmuel Peleg, Moshe Ben-Ezra, Yael Pritch
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

An Omnistereo panorama consists of a pair of panoramic images, where one panorama is for the left eye and another panorama is for the right eye. The panoramic stereo pair provides a stereo sensation up to a full 360 degrees. Omnistereo panoramas cannot be photographed by two omnidirectional cameras from two viewpoints, but can be constructed by mosaicing together images from a rotating stereo pair. A more convenient approach to generate omnistereo panoramas is by mosaicing images from a single rotating camera. This approach also enables the control of stereo disparity, giving larger baselines for faraway scenes, and a smaller baseline for closer scenes. Capturing panoramic omnistereo images with a rotating camera makes it impossible to capture dynamic scenes at video rates and limits omnistereo imaging to stationary scenes. We, therefore, present two possibilities for capturing omnistereo panoramas using optics without any moving parts. A special mirror is introduced such that viewing the scene through this mirror creates the same rays as those used with the rotating cameras. A lens for omnistereo panorama is also introduced. The designs of the mirror and of the lens are based on curves whose caustic is a circle. Omnistereo panoramas can also be rendered by computer graphics methods to represent virtual environments.
Generation of interconnect topologies for communication synthesis
Authors: M. Gasteier, M. Münch, M. Glesner
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

One of the key problems in hardware/software co-design is communication synthesis which determines the amount and type of interconnect between the hardware components of a digital system. To do so, communication synthesis derives a communication topology to determine which components are to be connected to a common communication channel in the final hardware implementation. In this paper, we present a novel approach to cluster processes to share a communication channel. An iterative graph-based clustering algorithm is driven by a heterogeneous cost function which takes into account bit widths, the probability of access collisions on the channels, cost for arbitration logic as well as the availability of interface resources on the hardware components to trade-off cost against performance in a most optimum fashion. The key aspects of the approach are demonstrated on a small example.
A Framework for the Design and Implementation of FFT Permutation Algorithms
Authors: Jaime Seguel, Dorothy Bollman, John Feo
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

We propose an algebraic framework for the design and implementation of a large class of data-sorting procedures, including all index-digit permutations used in FFTs. We discuss both old and new algorithms in terms of this framework. We show that the algebraic formulation of the new algorithms can be easily encoded using a functional programming language, and that the resulting code introduces no inefficiencies. We present performance results for implementations of three new algorithms for mixed-radix digit-reversal on a Cray C-90 and on a Sun Sparc 5.
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Authors: Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

We describe new graph bipartization algorithms for lay-out modification and phase assignment of bright-field alternating phase-shifting masks (AltPSM) [25]. The problem of layout modification for phase-assignability reduces to the problem of making a certain layout-derived graph bipartite (i.e., 2-colorable). Previous work [3] solves bipartization optimally for the dark field alternating PSMregime. Only one degree of freedom is allowed (and relevant) for such a bipartization: edge deletion, which corresponds to increasing the spacing between features in order to remove phase conflict. Unfortunately, dark-field PSM is used only for contact layers, due to limitations of negative photoresists. Poly and metal layers are actually created using positive photoresists and bright-field masks. In this paper, we define a new graph bipartization formulation that pertains to the more technologically relevant bright-field regime. Previous work [3] does not apply to this regime. This formulation allows two degrees of freedom for layout perturbation: (i) increasing the spacing between features, and (ii) increasing the width of critical features. Each of these corresponds to node deletion in a new layout-derived graph that we define, called the feature graph. Graph bipartization by node deletion asks for a minimum weight node set A such that deletion of A makes the graph bipartite. Unlike bipartization by edge deletion, this problem is NP-hard. We investigate several practical heuristics for the node deletion bipartization of planar graphs, including one that has 9/4 approximation ratio. Computational experience with industrial VLSI layout benchmarks shows promising results.
Interpreter based assignments for a standard programming languages course
Authors: John Barr, Laurie Smith King
Venue: Journal of Computing Sciences in Colleges (2001)

This tutorial will demonstrate how to use MuLE (MUltiple Language Environment) based projects in a programming languages design and implementation course. MuLE is a software tool (consisting primarily of four languages from different paradigms) developed to support combining the comparative and interpretive approaches to teaching the programming languages course. MuLE projects vary from small labs to programming a component within a larger existing program to programming in the large.
Performance and interoperability issues in incorporating cluster management systems within a wide-area network-computing environment
Authors: Sumalatha Adabala, Nirav H. Kapadia, José A. B. Fortes
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper describes the performance and interoperability issues that arise in the process of integrating cluster management systems into a wide-area network-computing environment, and provides solutions in the context of the Purdue University Network Computing Hubs (PUNCH). The described solution provides users with a single point of access to resources spread across administrative domains, and an intelligent translation process makes it possible for users to submit jobs to different types of cluster management systems in a transparent manner. The approach does not require any modifications to the cluster management software. However, call-back and caching capabilities that would improve performance and make such systems more interoperable with wide-area computing systems are discussed.
A comparison of heaps and the TL structure for the simulation event set
Authors: W. R. Franta, Kurt Maly
Venue: Communications of the ACM (1978)

Following publication of our paper [2], questions arose with respect to the superiority of the TL structure over heaps,1 particularly in the face of the remarks of Gonnet [3], concerning the use of heaps for the physical realization of the simulation event set. Gonnet's communication was in response to the Vaucher and Duval paper [5], and suggested the heap to be a more efficient structure than any proposed in [5]. As regards a comparison of heaps and the TL structure we can make the following remarks:
PCA versus LDA
Authors: Aleix M. Martínez, Avinash C. Kak
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

In the context of the appearance-based paradigm for object recognition, it is generally believed that algorithms based on LDA (Linear Discriminant Analysis) are superior to those based on PCA (Principal Components Analysis). In this communication, we show that this is not always the case. We present our case first by using intuitively plausible arguments and, then, by showing actual results on a face database. Our overall conclusion is that when the training data set is small, PCA can outperform LDA and, also, that PCA is less sensitive to different training data sets.
Singleton Bounds for Codes over Finite Rings
Authors: Keisuke Shiromoto
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

We introduce the Singleton bounds for codes over a finite commutative quasi-Frobenius ring.
Exploiting a Chinese-English bilingual wordlist for English-Chinese cross language information retrieval
Authors: K. L. Kwok
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We investigated using the LDC English/Chinese bilingual wordlists for English-Chinese cross language retrieval. It is shown that the Chinese-to-English wordlist can be considered as both a phrase and word dictionary, and is preferable to the English-to-Chinese version in terms of phrase translations and word translation selection. Additional techniques such as target corpus frequency-based term selection and weighting were employed. Experiments show that over 70% of monolingual effectiveness is achievable for the TREC Chinese corpus and retrieval environment with short queries of a few English words.
FPGA implementation of a novel, fast motion estimation algorithm for real-time video compression
Authors: S. Ramachandran, S. Srinivasan
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

A novel block matching algorithm for motion estimation in a video frame sequence, well suited for a high performance FPGA implementation is presented in this paper. The algorithm is up to 40% faster when compared to one of the fastest existing algorithms, viz., one-at-a-time step search algorithm without compromising either in the image quality or in the compression effected. The speed advantage is preserved even in the event of a sudden scene change in a video sequence. The proposed algorithm is also capable of dynamically detecting the direction of motion of image blocks. The FPGA implementation of the algorithm is capable of processing color pictures of sizes up to 1024x768 pixels at the real time video rate of 25 frames/second and conforms to MPEG-2 standards.
An Optimization Problem in Statistical Databases
Authors: Ljiljana Brankovic, Peter Horak, Mirka Miller
Venue: SIAM Journal on Discrete Mathematics (2000)

Let D={a1, . . ., an} be a set of real numbers, and let $S\subset \{1,\ldots,n\}$. For an interval $I\subset \{1,\ldots,n\}$ we set SUM(I)=\sum_{i\in I}a_i$. In this paper we solve the following problem which has been asked in connection with security of statistical databases: Find a largest family B of subintervals of {1,. . .,n} so that knowing the value of SUM(I) for all $I\in {\bf B}$ does not enable one to calculate any element $a_i\in D$, where $i\in S$.
Example based generation of custom data analysis appliances
Authors: Mark Derthick, Steven F. Roth
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Custom interfaces, which we call appliances, allow users to efficiently carry out specialized tasks. Without one, a user is often required to perform repetitive mechanical steps using general purpose interfaces, which we call tools. Much research has attempted to enable non-programmers to create appliances for themselves. >We present a system in which a user can choose an example of the task behavior to be automated from a visualization of his past operations. The example is transformed into a visual language, using two simple rules to generalize from the single example to a class of tasks. The user can then edit this representation directly, or continue to refine the example using selective undo and redo. The visual representation can be transformed into an esthetically pleasing appliance by deleting irrelevant components, and rearranging, resizing, and relabeling other components. Restricting the domain to data analysis tasks enables a well-matched visual query language to be used. Appliance interactions are automatically provided by the underlying interactive visualization system in which the appliance is embedded. An observational study suggests that this system represents a useful point on the ease-of-use vs. expressive power tradeoff appropriate for data analysis, and that the ability to choose and modify examples after the fact is helpful.
First-Order Tree-Type Dependence between Variables and Classification Performance
Authors: Sarunas Raudys, Ausra Saudargiene
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Structuralization of the covariance matrix reduces the number of parameters to be estimated from the training data and does not affect an increase in the generalization error asymptotically as both the number of dimensions and training sample size grow. A method to benefit from approximately correct assumptions about the first order tree dependence between components of the feature vector is proposed. We use a structured estimate of the covariance matrix to decorrelate and scale the data and to train a single-layer perceptron in the transformed feature space. We show that training the perceptron can reduce negative effects of inexact a priori information. Experiments performed with 13 artificial and 10 real world data sets show that the first-order tree-type dependence model is the most preferable one out of two dozen of the covariance matrix structures investigated.
Model-based estimation of buffer overflow probabilities from measurements
Authors: Ioannis Ch. Paschalidis, Spyridon Vassilaras
Venue: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2001)

We consider the problem of estimating buffer overflow probabilities when the statistics of the input traffic are not known and have to be estimated from measurements. We start by investigating the use of Markov-modulated processes in modeling the input traffic and propose a method for selecting an optimal model based on Akaike's Information Criterion. We then consider a queue fed by such a Markov-modulated input process and use large deviations asymptotics to obtain the buffer overflow probability. The expression for this probability is affected by estimation errors in the parameters of the input model. We analyze the effect of these errors and propose a new, more robust, estimator which is less likely to underestimate the overflow probability than the estimator obtained by certainty equivalence. As such, it is appropriate in situations where the overflow probability is associated with Quality of Service (QoS) and we need to provide firm QoS guarantees. Nevertheless, as the number of observations increases, the proposed estimator converges with probability 1 to the appropriate target, and thus, does not lead to resource underutilization in this limit.
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
Authors: Tarek F. Abdelzaher, Ella M. Atkins, Kang G. Shin
Venue: IEEE Transactions on Computers (2000)

Real-time middleware services must guarantee predictable performance under specified load and failure conditions, and ensure graceful degradation when these conditions are violated. Guaranteed predictable performance typically entails reservation of resources and use of admission control. Graceful degradation, on the other hand, requires dynamic reallocation of resources to maximize the application-perceived system utility while coping with unanticipated overload and failures. We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both of the above requirements. QoS negotiation is shown to 1) outperform ¿binary¿ admission control schemes (either guaranteeing the required QoS or rejecting the service request), 2) achieve higher application-perceived system utility, and 3) deal with violations of the load and failure hypotheses. We incorporated the proposed QoS-negotiation model into an example real-time middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. In order to guarantee timeliness QoS, the resource pool is encapsulated with its own schedulability analysis, admission control, and load-sharing support. This support differs from others in that it adheres to the proposed QoS-negotiation model. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RTPOOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.
Why I do declare!: declarative programming in the undergraduate curriculum
Authors: Samuel A. Rebelsky, Peter B. Henderson, Amruth N. Kumar, F. N. (Fred) Springsteel
Venue: ACM SIGCSE Bulletin (2001)

Many curricular guidelines, such as the Recommended Curriculum for Computer Science at Liberal Arts Colleges [4], suggest that students be exposed to many different programming paradigms (e.g., imperative, functional, object-oriented, declarative) in the undergraduate curriculum. Some institutions believe that students should have early exposure to many paradigms, often as early as the first two courses.Many institutions emphasize object-oriented programming early in the curriculum. Some also include functional programming. Imperative topics are often covered in courses that emphasize object-oriented or functional issues. Where does declarative programming fit? Sometimes not until an upper-level language paradigms course or artificial intelligence course. Sometimes it never fits, at least not explicitly.
Bayesian Graph Edit Distance
Authors: Richard Myers, Richard C. Wilson, Edwin R. Hancock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that recently reported by Wilson and Hancock. The use of edit-distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem. This demonstrates experimentally that the gain in efficiency is not at the expense of quality of match.
Getting graphics in gear: graphics and dynamics in driving simulation
Authors: Rod Deyo, John A. Briggs, Pete Doenges
Venue: Proceedings of the 15th annual conference on Computer graphics and interactive techniques (1988)

Man-in-the-loop simulation uses a person in the control loop to provide feedback to the system operations. Proper operator cueing must be provided to ensure a realistic response. Real-time computer graphics and dynamics both play dominant roles in providing these necessary cues. Dynamics simulation of modern vehicles requires a multi-body non-linear approach for acceptable fidelity of motion. A vehicle can be modeled as a set of linked rigid bodies, whose connections are described by a graph. Real-time constraints on the computation of non-linear dynamics equations require the development of naturally parallel recursive algorithms, whose organization closely follows the system graph. Significant speed-up can be accomplished using these parallel algorithms.
An architecture for more realistic conversational systems
Authors: James Allen, George Ferguson, Amanda Stent
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

In this paper, we describe an architecture for conversational systems that enables human-like performance along several important dimensions. First, interpretation is incremental, multi-level, and involves both general and task- and domain-specific knowledge. Second, generation is also incremental, proceeds in parallel with interpretation, and accounts for phenomena such as turn-taking, grounding and interruptions. Finally, the overall behavior of the system in the task at hand is determined by the (incremental) results of interpretation, the persistent goals and obligations of the system, and exogenous events of which it becomes aware. As a practical matter, the architecture supports a separation of responsibilities that enhances portability to new tasks and domains.