ppxscal/embedding_network huggingface dataset:
Resource allocation games with changing resource capacities
Authors: Aram Galstyan, Shashikiran Kolar, Kristina Lerman
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we study a class of resource allocation games which are inspired by the El Farol Bar problem. We consider a system of competitive agents that have to choose between several resources characterized by their time dependent capacities. The agents using a particular resource are rewarded if their number does not exceed the resource capacity, and punished otherwise. Agents use a set of strategies to decide what resource to choose, and use a simple reinforcement learning scheme to update the accuracy of strategies. A strategy in our model is simply a lookup table that suggests to an agent what resource to choose based on the actions of its neighbors at the previous time step. In other words, the agents form a social network whose connectivity controls the average number of neighbors with whom each agent interacts. This statement of the adaptive resource allocation problem allows us to fully parameterize it by a small set of numbers. We study the behavior of the system via numeric simulations of 100 to 5000 agents using one to ten resources. Our results indicate that for a certain range of parameters the system as a whole adapts effectively to the changing capacity levels and results in very little under- or over-utilization of the resources.
System Sensitive Runtime Management of Adaptive Applications
Authors: Shweta Sinha, Manish Parashar
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

This paper presents the design and evaluation of a system sensitive partitioning and load balancing framework for distributed adaptive grid hierarchies that underlie parallel adaptive mesh-refinement (AMR) techniques for the solution of partial-differential equations. The framework uses system capabilities and current system state to select and tune appropriate distribution parameters (e.g. partitioning granularity, load per processor) to maximize overall application performance.
Design maintenance: unexpected architectural interactions (experience report)
Authors: I. Carmichael, V. Tzerpos, R. C. Holt
Venue: Proceedings of the International Conference on Software Maintenance (1995)

There have been many systems developed that attempt to recover design and structure from code. We present our experience with using one such tool, SoFi, to extract design structure from a large industrial system written in C. We compare the extracted structure to that which was intended by the designers of the system. We observe and categorize, for our system, the reasons why these two views differ. We observe that seemingly minor decisions in implementation, can have a large impact an the extracted design, and draw some conclusions about the practicality of trying to recover "intended designs" from source code.
Creating Telecommunication Services based on Object-Oriented Frameworks and SDL
Authors: Richard Sinnott, Mario Kolberg
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

This paper describes the tools and techniques being applied in the TINA Open Service Creation Architecture (TOSCA) project to develop object-oriented models of distributed telecommunication services in SDL. The paper also describes the way in which Tree and Tabular Combined Notation (TTCN) test cases are derived from these models and subsequently executed against the CORBA-based implementations of these services through a TTCN/CORBA gateway.
Formal Modeling and Analysis of Atomic Commitment Protocols
Authors: Dmitri Chkliaev, Peter van der Stok, Jozef Hooman
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The formal specification and mechanical verification of an atomic commitment protocol (ACP) for distributed real-time and fault-tolerant databases is presented. As an example, the non-blocking ACP of Babaoglu and Toueg are analyzed. An error in their termination protocol for recovered participants has been detected. We propose a new termination protocol, which has been proved correct formally. To stay close to the original formulation of the protocol, timed state machines are used to specify the processes, whereas the communication mechanism between processes is defined using assertions. Formal verification has been performed incrementally, adding recovery from crashes only after having proved the basic protocol. Important to deal with the complexity of this fault-tolerant protocol was the use of the verification system PVS.
Recommender systems: a market-based design
Authors: Yan Zheng Wei, Luc Moreau, Nicholas R. Jennings
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Recommender systems have been widely advocated as a way of coping with the problem of information overload for knowledge workers. Given this, multiple recommendation methods have been developed. However, it has been shown that no one technique is best for all users in all situations. Thus we believe that effective recommender systems should incorporate a wide variety of such techniques and that some form of overarching framework should be put in place to coordinate the various recommendations so that only the best of them (from whatever source) are presented to the user. To this end, we show that a marketplace, in which the various recommendation methods compete to offer their recommendations to the user, can be used in this role. Specifically, this paper presents the principled design of such a marketplace; detailing the auction protocol and reward mechanism and analyzing the rational bidding strategies of the individual recommendation agents.
{\bf (Revision of CS-1993-22.)} A Notation for Lambda Terms I: A Generalization of Environments
Authors: Gopalan Nadathur, Sue D Wilson
Venue:  (1994)

A notation for lambda terms is described that is useful in contexts where the intensions of these terms need to be manipulated. This notation uses the scheme of de Bruijn for eliminating variable names, thus obviating $\alpha$-conversion in comparing terms. This notation also provides for a class of terms that can encode other terms together with substitutions to be performed on them. The notion of an environment is used to realize this `delaying'' of substitutions. The precise mechanism employed here is, however, more complex than the usual environment mechanism because it has to support the ability to examine subterms embedded under abstractions. The representation presented permits a $\beta$-contraction to be realized via an atomic step that generates a substitution and associated steps that percolate this substitution over the structure of a term. The operations on terms that are described also include ones for combining substitutions so that they might be performed simultaneously. Our notation eventually provides a basis for efficient realizations of $\beta$-reduction and also serves as a means for interleaving steps inherent in this operation with steps in other operations such as higher-order unification. The various manipulations on terms in our notation are described through a system of rewrite rules. The correspondence of this rewrite system to the usual notion of $\beta$-reduction is exhibited and is used in establishing confluence and other properties pertaining to it. The notation presented here is similar in spirit to other recent proposals deriving from the Categorical Combinators of Curien, and the relationship to these is discussed. Refinements to our notation and rewrite system and their use in describing manipulations on lambda terms are considered in detail in a companion paper.
Planning Under Time Constraints in Stochastic Domains
Authors: Thomas Dean, Leslie P Kaelbling, Jak Kirman, Ann Nicholson
Venue:  (1993)

We provide a method, based on the theory of Markov decision processes, for efficient planning in stochastic domains. Goals are encoded as reward functions, expressing the desirability of each world state; the planner must find a policy (mapping from states to actions) that maximizes future rewards. Standard goals of achievement, as well as goals of maintenance and prioritized combinations of goals, can be specified in this way. An optimal policy can be found using existing methods, but these methods require time at best polynomial in the number of states in the domain, where the number of states is exponential in the number of propositions (or state variables). By using information about the starting state, the reward function, and the transition probabilities of the domain, we restrict the planner''s attention to a set of world states that are likely to be encountered in satisfying the goal. Using this restricted set of states, the planner can generate more or less complete plans depending on the time it has available. Our approach employs several iterative refinement routines for solving different aspects of the decision making problem. We describe the meta-level control problem of {\em deliberation scheduling}, allocating computational resources to these routines. We provide different models corresponding to optimization problems that capture the different circumstances and computational strategies for decision making under time constraints. We consider {\em precursor} models in which all decision making is performed prior to execution and {\em recurrent} models in which decision making is performed in parallel with execution, accounting for the states observed during execution and anticipating future states. We describe experimental results for both the precursor and recurrent problems that demonstrate planning times that grow slowly as a function of domain size.
A Web-Based Management System for Distance Learning
Authors: Li Li, Guixing Luan, Ping Wang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In this paper, a web-based distance education system is described. It consists of two parts: a courseware making tool and a distance learning management system. By using the courseware making tool, teachers can make web-based multimedia courseware flexibly. Students learn the courseware through the learning management system. Moreover, the learning management system provides several tools, such as information searching tool,individual noting tool and interactive tool. This let students study efficiently.
Bubblesort star graphs: a new interconnection network
Authors: Zi-Tsan Chou, Chiun-Chieh Hsu, Jang-Ping Sheu
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, we propose and analyze a new interconnection network called bubblesort star graph, which is the merger of the bubblesort graph and the star graph. We present the deadlock-free wormhole routing algorithm for the proposed network. We also develop the method to embed a mesh into a bubblesort star graph with dilation two and expansion one. Besides, we use the recursive scheme to embed the multiple disjoint copies of the hypercube into a bubblesort star graph with all faults recovery capacity as well as constant expansion and dilation one or two. This reflects the fact that the embeddability of the bubblesort star graph is much better than that of the star graph.
Truth of duration calculus formulae in timed frames
Authors: C. A. Middelburg
Venue:  (1998)

Duration calculus is a logical formalism designed for expressing and refining real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed frames. We elaborate this topic from different angles and show that they agree with each other. The resulting interpretation is expected to make it generally easier to establish semantic links between duration calculus and formalisms aimed at programming. Such semantic links are prerequisites for a solid underpinning of approaches to system development that cover requirement capture through coding using both duration calculus and some formalism(s) aimed at programming.
Techniques for Achieving High Performance Web Servers
Authors: Sucheta Nadimpalli, Shikharesh Majumdar
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

With increasing bandwidth available to the client and the number of users growing at an exponential rate the Web server can become a performance bottleneck. This paper considers the parallelization of requests to Web pages each of which is composed of a number of embedded objects. The performances of systems in which the embedded objects are distributed across multiple backend servers are analyzed. Parallelization of Web requests gives rise to a significant improvement in performance. Replication of servers is observed to be beneficial especially when the embedded objects in a Web page are not evenly distributed across servers. Load balancing policies used by the dispatcher of Web page requests are investigated. A simple round robin policy for backend server selection gives a better performance compared to the default random policy used by the Apache server.
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Venue: Joint International Conference on Measurement and Modeling of Computer Systems (2009)

It is our great pleasure to welcome you to SIGMETRICS/Performance 2009. SIGMETRICS is the flagship conference of the ACM special interest group for the computer systems performance evaluation community. Performance is the flagship conference of the IFIP working group on performance modeling and analysis. Every three years, the two conferences are held jointly, and this is the eleventh joint conference. This year, we will continue with several of the innovations introduced at last year's SIGMETRICS program. The main conference will again be a full three days, featuring 27 papers, 21 posters, and three invited talks from computer science luminaries, both academic and industrial. We will also reprise the demo competition and student thesis panel that were so well received last year. We are introducing an industrial information seminar, to provide an opportunity for students and academics to hear from representatives in industrial research about performance-related projects and their impact on deployed products and services. Supplementing the main conference are four interesting workshops, ranging from the venerable to the avant-garde. The workshop on MAthematical performance Modeling and Analysis (MAMA) continues its eleventh year as a forum for talks on early research in the more mathematical areas of computer performance analysis. The workshop on Hot Topics in Metrics (HotMetrics), which had a stellar inauguration last year, will reprise its role in helping to identify "big" and "hard" problems in performance evaluation and to develop innovative approaches to solving them. We also introduce two new workshops this year: GreenMetrics will explore how improvements to or new uses of Information and Communication Technology (ICT) can contribute towards efforts to minimize global climate change, a problem of increasing importance in modern society. The Learning for Networking workshop will investigate the use of machine learning techniques to tackle the increasingly complex architecture and control features in telecommunications and computer networks. This year also features a splendid series of tutorials, on topics ranging from social networks to data-center networks, from data-flow programming to packet-flow configuration, and from internet measurement to internet service construction.
Design of high peformance arithmetic encode for CABAC in H.264/AVC
Authors: Yoonsup Kim, Jeonhak Moon, Wonjoon Choi, Seongsoo Lee, Seok Lee, Dockha Woo
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

CABAC is one of the entropy coding technologies applied to a main profile of H.264/AVC. The subject of concern for performance enhancements of CABAC improves irregular renormalization and bit output of arithmetic coder. This paper proposes an efficient arithmetic encoder for CABAC. To obtain CABAC encoder with high throughput, it adopted a pipeline structure for arithmetic encoder. As a result, at every clock cycle, the input symbol is encoded regardless of the iteration of the renormalization process and so the performance has improved. The proposed architecture was modeled VerilogHDL and was verified through simulations.
Optimal network design and storage management in petroleum distribution network under uncertainty
Authors: Mehdi Ghatee, S. Mehdi Hashemi
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper studies the status of storage tanks in petroleum distribution network under uncertainty. It is difficult to describe the topology of this network precisely. As an instance, the capacity of pipelines and tanks due to corrosion cannot be presented as real numbers. Also production of oil fields, demand of costumers and food of refineries in a long-term programming are given under uncertainty. The contribution of this paper is to capture with the corresponding granular information applying fuzzy concepts. For this mission, an off-line basic framework is proposed in order to find the least daily-transportation-cost of crude oil flows through a capacitated network. To transform this management problem into a traditional minimal cost flow problem (MCFP), a T-floors network is provided which simulates the oil transportation in T days. The dummy links adjoining two consecutive floors are embedded as storage depots and their flows are corresponded to maintained flow. To exhibit with imprecision concerning this dynamic network, a fuzzifier can be applied which obtains a fuzzy number reflecting system description. Then a fully fuzzified MCFP is solved applying a ranking function understood by authors in previous works. We illustrate the performance of the proposed scheme on a simplified pilot of Iranian petroleum industry network. Furthermore, we offer a modified version of successive shortest path algorithm which is able to find the optimal place and the optimal capacity of storage tanks when they are required through the long-term programming period.
Advancement through interactive radio
Authors: S. Revi Sterling, John O'Brien, John K. Bennett
Venue: Information Systems Frontiers (2009)

This paper describes the rationale, design and implementation of a system for increasing the status women in developing communities. AIR (Advancement through Interactive Radio) gives female community radio listeners a voice with which to respond to programming and to create programming content. We first describe the cost of excluding women from Information and Communication Technologies (ICT) for development, and explore how community radio represents an opportunity for inclusion. We draw upon feasibility studies and site visits in Southeast Kenya to support the introduction of a mechanism that enables women to "talk back" to the community radio station. Using the principles of Participatory Action Research (PAR), we argue that women will be more likely to benefit from technology-mediated opportunities for development if they themselves produce information that contributes to their advancement, rather than simply consuming information provided by others. Finally, we describe the design and implementation of simple communications device that supports this model for use in communities that are, and will remain for some time, off the electrical and cellular grid. This hand-held device enables women to record voice feedback and news for community radio. This feedback is then routed asynchronously back to the radio station through a probabilistic, delay-tolerant network, where the feedback can inform subsequent broadcasts and facilitate additional discussion. We conclude with a technical summary of the AIR prototype.
Off-topic detection in conversational telephone speech
Authors: Robin Stewart, Andrea Danyluk, Yang Liu
Venue: Proceedings of the HLT-NAACL 2006 Workshop on Analyzing Conversations in Text and Speech (2006)

In a context where information retrieval is extended to spoken "documents" including conversations, it will be important to provide users with the ability to seek informational content, rather than socially motivated small talk that appears in many conversational sources. In this paper we present a preliminary study aimed at automatically identifying "irrelevance" in the domain of telephone conversations. We apply a standard machine learning algorithm to build a classifier that detects off-topic sections with better-than-chance accuracy and that begins to provide insight into the relative importance of features for identifying utterances as on topic or not.
A Robust Bayesian Two-Sample Test for Detecting Intervals of Differential Gene Expression in Microarray Time Series
Authors: Oliver Stegle, Katherine Denby, David L. Wild, Zoubin Ghahramani, Karsten M. Borgwardt
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

Understanding the regulatory mechanisms that are responsible for an organism's response to environmental changes is an important question in molecular biology. A first and important step towards this goal is to detect genes whose expression levels are affected by altered external conditions. A range of methods to test for differential gene expression, both in static as well as in time-course experiments, have been proposed. While these tests answer the question whether a gene is differentially expressed, they do not explicitly address the question when a gene is differentially expressed, although this information may provide insights into the course and causal structure of regulatory programs. In this article, we propose a two-sample test for identifying intervals of differential gene expression in microarray time series. Our approach is based on Gaussian process regression, can deal with arbitrary numbers of replicates and is robust with respect to outliers. We apply our algorithm to study the response of Arabidopsis thaliana genes to an infection by a fungal pathogen using a microarray time series dataset covering 30,336 gene probes at 24 time points. In classification experiments our test compares favorably with existing methods and provides additional insights into time-dependent differential expression.
An integrated approach to database visualization
Authors: Dennis P. Groth, Edward L. Robertson
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

We present an architecture that enables information visualization activities within a database environment. Our approach presents an abstraction of this transformation process, which we call mapping. The implementation of the mapping process is controlled by the end-user through a Map, which can be used to add order and scale to data.