ppxscal/embedding_network huggingface dataset:
Synergistic integration of agent technologies for military simulation
Authors: Sean Owens, Paul Scerri, Robin Glinton, Bin Yu, Katia Sycara
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

To perform large-scale coordination in real-world environments requires that many individually complex technologies come together to form integrated solutions. We present an application where several key technologies are integrated into a unified system via a multiagent infrastructure. We show how the synergistic behavior among heterogeneous technologies results in a significant improvement over the performance of the individual technologies acting alone. Critical extensions were required to the language describing required behavior to allow the pieces to work together. Initial experimental results show system performance on a task of coordinating a military convoy in an adversarial environment was significantly improved when all technologies worked together. However, experiments with a human user in the loop showed that significant advances must still be made before such systems can be fielded in the real-world.
Graphic designers who program as informal computer science learners
Authors: Brian Dorn, Mark Guzdial
Venue: Proceedings of the second international workshop on Computing education research (2006)

We introduce end-user programmers as a group of persons engaged in informal Computer Science education. Results of a small-scale survey for a previously unstudied population of end-users, users of graphics manipulation software, are presented. We find that graphic designers are taking part in significant programming activities, despite little to no formal training in programming. We discuss what draws them to programming, what they know about Computer Science, and where they seek help. We also consider ways in which we might further support the Computer Science learning that takes place in end-user settings.
The right to information: setup of mobile terminals and services
Authors: Matthias Schneider-Hufschmidt, David Williams, Martin Böcker, Margareta Flygt, Pekka Ketola, Bruno von Niman, Michael Tate
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

The Technical Committee Human Factors (TC HF) of the European Telecommunication Standards Institute (ETSI, www.etsi.org) has initiated the development of guidelines for the design of setup procedures, applicable to mobile terminals and e-services.This work is performed under the policy framework defined by the e-Europe 2005 action plan, by and in close collaboration between major industry players and ETSI.The goal of this activity is the development of design guidelines for user interface and service developers based on specific use cases which help to understand the difficulties users are experiencing when configuring their devices or accessing the services.The result of this work will be presented at the conference and the resulting ETSI Guide will be available free of charge.
An Exploration on Mobile Social Networking: Dodgeball as a Case in Point
Authors: Nina D. Ziv, Bala Mulloth
Venue: Proceedings of the International Conference on Mobile Business (2006)

With the evolution of the mobile platform and the rapid adoption of mobile devices such as cell phones and other handheld devices, social networks, which began as web-based applications, have migrated onto the mobile platform. This paper focuses on the development of these networks and how users of these networks have become a prime source of innovation on the mobile platform. Mobile social networks are the impetus for the creation of an entirely new sub-industry in the wireless sector, thus representing a new aspect of wireless innovation, and increasingly are providing a platform for content and technological innovation in the business environment. The paper discusses the implications of mobile social networks for the wireless sector, content providers, technology companies, and the users of the mobile platform. A case study on Dodgeball, a New York City based mobile social networking company, is presented to exemplify usercentric innovation on the mobile platform.
Clinical trial factors in a pain transition state model
Authors: Meyer Katzper
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper presents a pain state transition model which accounts for constraints used in clinical trials. The pain transition state model is an approach for summarizing, presenting and modeling pain state transitions in a population. Data used are from the ibuprofen arm of a number of clinical trials measuring dental extraction pain. The data determine the state transition coefficients of the model. The pain process in the presence of an analgesic is thus fully characterized.
Analysis and optimal control of a discrete-time queueing system under the (m,N)-policy
Authors: Alfredo G. Hernández-Díaz, Pilar Moreno
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

This paper analyzes a discrete-time single-server queue under bilevel threshold control and early setup. The joint generating function of the server state and the number of customers in the system together with the main performance measures are derived. We also study the length of the different busy periods of the server as well as the number of customers served during a busy period. We establish a cost model and find the optimal solution using a tabu search algorithm due the difficulty to prove the convexity of the cost function. Finally, we show some numerical examples to see the influence of the setup time distribution and the sensibility of the different costs.
Fuzzy Capacitated Location-allocation Problem with Minimum Risk Criteria
Authors: Yan-Kui Liu, Xiao-Liang Zhu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Based on credibility theory, a new class of twostage minimum risk location-allocation model is first proposed. Then we deal with the approximation of the location and allocation problem After that, a hybrid algorithm, which integrates the approximation approach, neural network and simulated annealing, is designed to solve the proposed location-allocation problem, and a numerical example is provided to test the effectiveness of the hybrid algorithm.
Mining Spatial Co-orientation Patterns for Analyzing Portfolios of Spatial Cognitive Development
Authors: Ling-Yin Wei, Man-Kwan Shan
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Spatial cognition concerns how human interpret spatial complexity. Cognitive maps are mostly used to test the spatial cognition. Analyzing cognitive maps drawn by students is helpful for teachers to understand students' spatial cognitive ability and to draft geography teaching plans. Cognitive maps constitute the portfolios of spatial cognitive development. With the advance of e-learning technology, we can analyze portfolios of spatial cognitive development by spatial data mining of cognitive images. In this paper, we investigate the spatial co-orientation patterns for analyzing portfolios of spatial cognitive development. Spatial co-orientation patterns refer to objects that frequently occur with the same spatial orientation, e.g. left, right, below, etc., among images. We propose BFS-based approach for mining co-orientation patterns and utilize this as a tool for analyzing portfolios spatial cognitive development of students.
Ranking Web Search Results from Personalized Perspective
Authors: Wen-Chih Peng, Yu-Chin Lin
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In this paper, we exploit the technique of data mining to mine frequent access patterns from user browsing behavior. In light of frequent access patterns, we develop a solution procedure to automatically extract user interests. Furthermore, in accordance with user interests mined and feedbacks of users, we propose a new algorithm with the idea of dynamically adjusting the ranking scores of Web pages. Specifically, algorithm PPR (standing for Personalized PageRank), is divided into four phases. The first phase assigns the initial weights based on user interests. In the second phase, the virtual links and hubs are created according to user interests. By observing user click streams, our proposed algorithm will incrementally reflect user favors for the personalized ranking in the third phase. To improve the accuracy of ranking, collaborative filtering is taken into consideration when the new query is submitted. By conducting simulation experiments, we have shown that algorithm PPR is not only very effective but also very adaptive in providing personalized ranking to users.
New Validation Method for Establishing Correspondence Between Pairs of X-Ray Mammograms
Authors: John H. Hipwell, Christine Tanner, William R. Crum, David J. Hawkes
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Establishing spatial correspondence between features visible in x-ray mammograms obtained at different times has great potential to aid assessment of change in the breast indicative of malignant changes and facilitate their quantification. The literature contains numerous non-rigid registration algorithms developed for this purpose, but quantitative estimation of registration accuracy is limited. In this paper we describe a novel validation method which simulates plausible mammographic compressions of the breast using an MRI derived finite element model. By projecting the resulting known 3D displacements into 2D and simulating x-ray mammograms from these same compressed MR volumes, we can generate convincing images with known 2D displacements with which to validate a registration algorithm. We illustrate this approach by computing the accuracy for a non-rigid registration algorithm applied to mammographic test images generated from three patient MR datasets.
SWARMS: A New Tool for Domain Exploration in Semantic Web
Authors: Bangyong Liang, Jie Tang, Juanzi Li, Kehong Wang
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

This paper is concerned with 'domain exploration'. By domain exploration, we mean searching for data on a specific domain which has been modeled by ontology. We have found that exploration needs on a domain can be categorized into data search and navigation, through an analysis of survey results. In our approach, the domain data is organized as instances of domain concepts. The instances are indexed and data search is conducted by index-based search which is also known the keyword based search. In data navigation, users can select an instance in the result of the index based search to display in visualization view. In visualization view, we use graph to visualize the instance and its context. By instance's context, we mean that other instances which has relations between the selected one. Users can click a node in the graph to navigate to its visualization view. In visualization view, we provide constraint-based search, users can input properties' values to search for instances that has the input value in the certain properties. Other than index-based search, we provide association search for any two instances. By association of two instances, we mean that the possible direct relations and indirect relations between the two instances. In this paper, we will describe SWARMS' architecture, component technologies and its performance in FOAF domain, because FOAF(Friend-Of-A-Friend) [1] domain's data size is largest among the three domains. The FOAF domain contains more than 90,000 persons and more than 100,000 publications of the people in the domain.
FastFlow: A Framework for Accurate Characterization of Network Traffic
Authors: Sumantra R. Kundu, Bodhisatwa Chakravarty, Kalyan Basu, Sajal K. Das
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

This paper proposes a new measurement architecture and associated traffic estimation algorithm called FastFlow that uses the heavy-tailed nature of Internet traffic in order to distinguish packets belonging to short lived flows (SLFs) and long lived flows (LLFs). While complete information is stored for SLFs, only partial information related to LLFs is collected using systematic sampling. The absence of data points in LLFs is approximated using a likelihood function defined over the coupon collector problem and the distribution of underlying traffic estimated using the non-parametric Parzen window technique. We validate the performance of our approach using traffic traces collected from our lab and observe that the estimated statistics match the observed traces with high accuracy.
An Integration of Ontology-based and Policy-based Network Management for Automation
Authors: Debao Xiao, Hui Xu
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

As the Internet continues to grow, the tasks of network management are becoming more and more difficult. Over the past few years, much effort has been given to implement the automation of network management. Ontology seems to be a promising technology for that purpose. However, only ontology alone may not easily achieve the goal of automatic network management. Thus under this background, policies may be added to enhance ontology-based network management. This paper just aims in the integration of ontology-based and policy-based approaches to automate network management. A common model for this integrated automatic network management is then proposed in the paper. To check the feasibility of this model, the paper provides a possible scenario.
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
Authors: Weifa Liang, Xiaoxing Guo
Venue: IEEE Transactions on Mobile Computing (2006)

In this paper, we present new algorithms for online multicast routing in ad hoc networks where nodes are energy-constrained. The objective is to maximize the total amount of multicast message data routed successfully over the network without any knowledge of future multicast request arrivals and generation rates. Specifically, we first propose an online algorithm for the problem based on an exponential function of energy utilization at each node. The competitive ratio of the proposed algorithm is analyzed if admission control of multicast requests is permitted. We then provide another online algorithm for the problem, which is based on minimizing transmission energy consumption for each multicast request and guaranteeing that the local network lifetime is no less than \gamma times of the optimum, where \gamma is constant with 0
Improving spatial reuse through tuning transmit power, carrier sense threshold, and data rate in multihop wireless networks
Authors: Tae-Suk Kim, Hyuk Lim, Jennifer C. Hou
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

The importance of spatial reuse in wireless ad-hoc networks has been long recognized as a key to improving the network capacity. One can increase the level of spatial reuse by either reducing the transmit power or increasing the carrier sense threshold (thereby reducing the carrier sense range). On the other hand, as the transmit power decreases or the carrier sense threshold increases, the SINR decreases as a result of the smaller received signal or the increased interference level. Consequently, the data rate sustained by each transmission may decrease. This leads naturally to the following questions:(1)How can the trade-off between the increased level of spatial reuse and the decreased data rate each node can sustain be quantified? In other words,is there an optimal range of transmit power/carrier sense threshold in which the network capacity is maximized? (2)What is the relation between the transmit power and the carrier sense threshold.In this paper, we study both problems, and show that (i)in the case that the achievable channel rate follows the Shannon capacity, spatial reuse depends only on the ratio of the transmit power to the carrier sense threshold; and (ii) in the case that only a set of discrete data rates are available, tuning the transmit power offers several advantages that tuning the carrier sense threshold cannot, provided that there is a sufficient number of power levels available. Based on the findings, we then propose a decentralized power and rate control algorithm to enable each node to adjust, based on its signal interference level, its transmit power and data rate. The transmit power is so determined that the transmitter can sustain a high data rate, while keeping the adverse interference effect on the other neighboring concurrent transmissions minimal. Simulation results have shown that, as compared to existing carrier sense threshold tuning algorithms, the proposed power and rate control algorithm yields higher network capacity.
Feature-based generators for time series data
Authors: Jorge R. Ramos, Vernon Rego
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A variety of interesting domains, such as financial markets, weather systems, herding phenomena, etc., are characterized by highly complex time series datasets which defy simple description and prediction. The generation of input data for simulators operating in these domains is challenging because process description usually involves high-dimensional joint distributions that are either too complex or simply unavailable. In such applications, a standard approach is to drive simulators with (historical) trace-data, along with facilities for real-time interaction and synchronization. But, limited input data, or conversely, abundant but low-fidelity random data, limits the usefulness and quality of the results. With a view to generating high-fidelity, random input for such applications, we propose a methodology which uses the original data, as a template, to generate candidate datasets, to finally accept only those datasets which resemble the template, based upon parameterized features. We demonstrate the methodology with some early experimental results.
Give It Your Best Shot: Favorite Lectures from Agile Teachers
Authors: Joseph Chao, Gary Pollice
Venue: Proceedings of the conference on AGILE 2006 (2006)

College instructors are incorporating agile methods into their courses throughout the curriculum. Industrial trainers are focusing on effective ways of introducing agile techniques to their clients. We now have a significant amount of experience from which to draw upon for adding agile to our courses. This panel brings together four experienced teachers of agile methods to present their most effective techniques for teaching one or more agile practices to their class members. Each panelist will present a 10-15 minute mini-lecture and explain why they find it to be their most effective. After the presentations there will be a half hour question-and-answer period with time for discussions with the panelists. Audience members will be encouraged to discuss their experiences with the type of teaching presented by the panelists, and share their own favorite techniques.
An Event Notification Service based on XML Messaging on Different Transport Technologies
Authors: Ravinder Thirumala, Usha Rani, Timothy A. Gonsalves
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

With the size and increasing complexity of telecom networks, there is a need to interconnect management systems at different levels. This requires information flow across many applications in a domain independent way. XML is a widely deployed standard which is being used for integration of Network Management System(NMS) with other applications. We examine the performance of different transport mechanisms, JMS, CORBA, HTTP and RMI for an XML message based event Notification Service. To improve the performance of XML message based event notifications, event grouping is examined and is found to perform well.
The Bootstrapping Service
Authors: Mark Jelasity, Alberto Montresor, Ozalp Babaoglu
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

We outline a lightweight architecture to support novel application scenarios for P2P systems. These scenarios include merging and splitting of large networks, or multiplexing relatively short-lived applications over a pool of shared resources. In such scenarios, the architecture needs to be quickly and efficiently (re)generated frequently, often from scratch. We propose the bootstrapping service abstraction as a solution to this problem. We present an instance of the service that can jumpstart any prefix-table based routing substrate quickly, cheaply and reliably from scratch. We experimentally analyze the proposed bootstrapping service, demonstrating its scalability and robustness.
Model Checking Data-Dependent Real-Time Properties of the European Train Control System
Authors: Johannes Faber, Roland Meyer
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

The behavior of embedded hardware and software systems is determined by at least three dimensions: control flow, data aspects, and real-time requirements. To specify the different dimensions of a system with the best-suited techniques, the formal language CSP-OZ-DC [1] integrates Communicating Sequential Processes (CSP) [2], Object-Z (OZ) [3], and Duration Calculus (DC) [4] into a declarative formalism equipped with a unified and compositional semantics. In this paper, we provide evidence that CSP-OZ-DC is a convenient language for modeling systems of industrial relevance. To this end, we examine the emergency message handling in the European Train Control System (ETCS) [5] as a case study with uninterpreted constants and infinite data domains. We automatically verify that our model ensures real-time safety properties, which crucially depend on the system's data handling.