ppxscal/embedding_network huggingface dataset:
Analyzing skill-based routing call centers using discrete-event simulation and design experiment
Authors: Thomas A. Mazzuchi, Rodney B. Wallace
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Call center customer service representatives (CSRs) or agents tend to have different skills. Some CSRs can handle one type of call, while other CSRs can handle other types of calls. Advances in automatic call distributors (ACDs) have made it possible to have skill-based routing (SBR) which is the protocol for online routing of incoming calls to the appropriate CSRs. At present, very little is known about SBR. We develop a discrete-event simulation model to analyze the performance of a Mn/Mn/C/K SBR environment in which incoming calls are handled in priority order and in a non-preemptive manner. We use the design of experiment framework to conduct our analysis. We show empirically that the scenario in which agents have 2 skills is almost as efficient as the scenario where agents have all skills (resource pooling). Also, we discover that no interaction exists between call rate factors when resource pooling exists.
A Discovery Service for Very Large, Dynamic Grids
Authors: Jaka Mocnik, Marko Novak, Gregor Pipan, Piotr Karwaczynski
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Discovery of service providers that are useful to service requesters is a common problem in service oriented systems, such as grids and ever more the whole World Wide Web itself. Current solutions do not address this problem adequately in very large, highly dynamic systems. Being usually designed for systems with predominantly static and relatively small set of information on existing service providers, they can not cope with large numbers of advertised services, service providers arbitrarily joining and leaving the system, and the constantly changing properties of the advertised services. This paper presents an architecture and a proof-ofconcept implementation of a discovery service for large, highly dynamic service oriented systems, based on the peerto- peer paradigm. Our discovery service on one hand allows for dynamic publication of service advertisements by very large numbers of service providers that arbitrarily join and leave the system. On the other hand it provides means for service requesters to dependably discover service providers that fullfil complex conditions specified by the requester. Also, the system allows the requester to dynamically establish a contract with the discovered service provider that describes the conditions under which the service will be provided to the requester.
A new methodology for applying simulation driven metaheuristics to the balancing of security inspection lines
Authors: Stefano Saetta, Lorenzo Tiacci
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In the paper author show a new approach to the line balancing of security inspection lines. In this approach there is a particular combination of simulation of metaheuristics and modeling and simulation. Simulation is used directly during the metaheuristics process for evaluating the objective function. In this manner it is possible to obtain more effective objective function This process can be quite fast in many situations where simulation calculation can be done very effectively. In particular simulation is used for the computation of the objective function. In particular in the paper a tabu search based algorithm is considered. The application concern a problem of line balancing. Same algorithm is applied to a conventional objective function in order to show benefits of the new approach.
Dryverl: a flexible Erlang/C binding compiler
Authors: Romain Lenglet, Shigeru Chiba
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Erlang (2006)

This article introduces Dryverl, an Erlang/C binding code generator. Dryverl aims at becoming the most abstract, open and efficient tool for implementing any Erlang/C bindings, as either C port drivers, C port programs, or C nodes. The most original feature of Dryverl is to provide users with open Erlang/C bindings, similar to distributed bindings in open distributed processing systems, to allow specifying programmatically the data transformations that must often be performed in Erlang/C bindings. Implementation details are hidden to developers, and implementation differences between port drivers, port programs, and nodes are abstracted by Dryverl, and Dryverl aims at generating the most efficient implementations possible for every target mechanism.
A Robust Abstraction for First-Person Video Streaming: Techniques, Applications, and Experiments
Authors: Neil J. McCurdy, William G. Griswold, Leslie A. Lenert
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The emergence of personal mobile computing and ubiquitous wireless networks enables powerful field applications of video streaming, such as vision-enabled command centers for hazardous materials response. However, experience has repeatedly demonstrated both the fragility of the wireless networks and the insatiable demand for higher resolution and more video streams. In the wild, even the best streaming video mechanisms result in low-resolution, low-frame-rate video, in part because the motion of first-person mobile video (e.g., via a head-mounted camera) decimates temporal (inter-frame) compression. We introduce a visualization technique for displaying low-bit-rate first-person video that maintains the benefits of high resolution, while minimizing the problems typically associated with low frame rates. This technique has the unexpected benefit of eliminating the "Blaire Witch Project" effect -- the nausea-inducing jumpiness typical of first-person video. We explore the features and benefits of the technique through both a field study involving hazardous waste disposal and a lab study of side-by-side comparisons with alternate methods. The technique was praised as a possible command center tool, and some of the participants in the lab study preferred our low-bitrate encoding technique to the full-frame, high resolution video that was used as a control.
Modular verification of a non-blocking stack
Authors: Matthew Parkinson, Richard Bornat, Peter O'Hearn
Venue: ACM SIGPLAN Notices (2007)

This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algorithm, which provides a shared stack. The inter-thread interference, which is essential to the algorithm, is confined in the proof and the specification to the modular operations, which perform push and pop on the stack. This is achieved by the mechanisms of separation logic. The effect is that inter-thread interference does not pollute specification or verification of clients of the stack.
Spectral RTL Test Generation for Gate-Level Stuck-at Faults
Authors: Nitin Yogi, Vishwani D. Agrawal
Venue: Proceedings of the 15th Asian Test Symposium (2006)

We model RTL faults as stuck-at faults on primary inputs, primary outputs, andip- ops. Tests for these faults are analyzed using Hadamard matrices for Walsh functions and random noise level at each primary input. This information then helps generate vector sequences. At the gate-level, a fault simulator and an integer lin- ear program (ILP) compact the test sequences. We give results for four ITC'99 and four ISCAS'89 bench- mark circuits, and an experimental processor. The RTL spectral vectors performed equally well on mul- tiple gate-level implementations. Compared to a gate- level ATPG, RTL vectors produced similar or higher coverage in shorter CPU times.
A Cluster Based Topology Control Algorithm for Wireless Ad-Hoc Networks
Authors: Ali Sarrafi, Mohammad Hamed Firooz, Hassan Barjini
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

This paper proposes a topology control algorithm for Ad-Hoc networks which have a large scale structure and widely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing.
Using multiagent teams to improve the training of incident commanders
Authors: Nathan Schurr, Pratik Patil, Fred Pighin, Milind Tambe
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The DEFACTO system is a multiagent based tool for training incident commanders for large scale disasters. In this paper, we highlight some of the lessons that we have learned from our interaction with the Los Angeles Fire Department (LAFD) and how they have affected the way that we continued the design of our training system. These lessons were gleaned from LAFD feedback and initial training exercises and they include: system design, visualization, improving trainee situational awareness, adjusting training level of difficulty and situation scale. We have taken these lessons and used them to improve the DEFACTO system's training capabilities. We have conducted initial training exercises to illustrate the utility of the system in terms of providing useful feedback to the trainee.
The Art of Gemotion in Space
Authors: Yoichiro Kawaguchi
Venue: Proceedings of the conference on Information Visualization (2006)

Gemotion explores the potential innovation in the convergence of the media content industry and traditional culture that may become more commonplace in the future. Here, I will discuss a few examples of such collaborative efforts. Above all, I would like to take this opportunity to look at the issue of how the five senses - particularly, sight, sound and touch - which form the key elements of virtual reality, relate to traditional performing arts. From there, I hope to shed light on the signs emerging on the horizon of future media content.
AtomServ Architecture: Towards Internet-scaled Service Publish, Subscription, and Discovery
Authors: Chen Wu, Elizabeth Chang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

With the surge of SOA-based infrastructure and applications, increasingly end users and smallmedium- enterprises directly participate in the service publish and discovery across the Internet. The recent shutdown of public UDDI exposes critical problems of existing Internet-based service discovery. Hence, public service discovery becomes a central SOA issue. In this paper, we present a light weight service discovery architecture built upon widely-adopted WWW technologies and proven software architectural styles. Firstly, it provides a handy discovery facility for personal web services providers and consumers, who would not be expected to able to use complex UDDI specifications with dedicated endpoint computing capability. Secondly, it widens the adoption of service discovery by allowing simple and uniform web user interfaces (e.g. Internet Explorer7.0 and Firefox1.1) to subscribe and access frequently changing business services. This undoubtedly lowers the entry barrier for end users to play the role of service providers or consumers in a sheer Service-Oriented Environment across the Internet.
New quantum algorithms and quantum lower bounds
Authors: Andrew C. Yao
Venue:  (2006)

The last decade witnessed a great surge of fruitful studies in the new paradigm of quantum computing. Remarkable progress has been made in all the areas including quantum algorithms, quantum complexity theory, quantum error-correcting code, quantum information theory, quantum cryptography and physical implementations of quantum computers. However, quantum algorithm design, probably the most important task in quantum computing, did not make as much progress as people expected. This thesis aims at both designing new quantum algorithms and studying why efficient quantum algorithms are so hard to design by proving many lower bounds on quantum query complexity for various problems. We first review (and generalize) known techniques for designing quantum algorithms and for proving quantum lower bounds. Using these techniques, we then study the quantum query complexity for many problems, including some specific problems such as Graph Matching and other natural graph properties, the general tuple search, and local search. We also study the lowest possible quantum query complexity for a class of functions as a whole, such as graph properties, circular functions, and functions invariant of a transitive permutation group, where tight results are given in all these cases. Finally for the quantum lower bounds techniques themselves, we study the main two techniques and show that they are incomparable in power. For the most widely used one, which has a lot of parameters to choose, we show limitations for it in terms of certificate complexity. This implies that we cannot use the method to prove better lower bounds for almost all known open problems in this area.
An Effective Hybrid Classifier Based on Rough Sets and Neural Networks
Authors: Rujiang Bai, Xiaoyue Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Due to the exponential growth of documents on the Internet and the emergent need to organize them, the automated categorization of documents into predefined labels has received an ever-increased attention in the recent years. This paper describes a method developed for the automatic clustering of documents by using a hybrid classifier based on rough sets and neural networks, which we called as Rough-Ann,. First, the documents are denoted by vector space model and the feature vectors are reduced by using rough sets. Then using those feature vectors we reduced that are training set for artificial neural network and clustering the documents. The experimental results show that the algorithm Rough-Ann is effective for the documents classification, and has the better performance in classification precision, stability and fault-tolerance comparing with the traditional classification methods, Bayesian classifiers SVM and kNN, especially for the complex classification problems with many feature vectors.
A Study of Design Requirements for Mobile Learning Environments
Authors: David Parsons, Hokyoung Ryu, Mark Cranshaw
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper proposes a conceptual framework for mobile learning applications that provides systematic support for mobile learning experience design. It is based on a combination of a game metaphor and several studies of mobile learning contexts. An account of the Ambient Wood project is used to explore the relationship between the framework and mobile learning design requirements in practice.
Kernel Uncorrelated and Orthogonal Discriminant Analysis: A Unified Approach
Authors: Tao Xiong, Jieping Ye, Vladimir Cherkassky
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Several kernel algorithms have recently been proposed for nonlinear discriminant analysis. However, these methods mainly address the singularity problem in the high dimensional feature space. Less attention has been focused on the properties of the resulting discriminant vectors and feature vectors in the reduced dimensional space. In this paper, we present a new formulation for kernel discriminant analysis. The proposed formulation includes, as special cases, kernel uncorrelated discriminant analysis (KUDA) and kernel orthogonal discriminant analysis (KODA). The feature vectors of KUDA are uncorrelated, while the discriminant vectors of KODA are orthogonal to each other in the feature space. We present theoretical derivations of proposed KUDA and KODA algorithms. The experimental results show that both KUDA and KODA are very competitive in comparison with other nonlinear discriminant algorithms in terms of classification accuracy.
A Bayesian Network Approach to Detecting Privacy Intrusion
Authors: Xiangdong An, Dawn Jutla, Nick Cercone
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Personal information privacy could be compromised during information collection, transmission, and handling. In information handling, privacy could be violated by both the inside and the outside intruders. Though, within an organization, private data are generally protected by the organization's privacy policies and the corresponding platforms for privacy practices, private data could still be misused intentionally or unintentionally by individuals who have legitimate access to them in the organization. In this paper, we propose a Bayesian network-based method for insider privacy intrusion detection in database systems.
Data Integration using Semantic Technology: A use case
Authors: Jurgen Angele, Michael Gesmann
Venue: Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web (2006)

For the integration of data that resides in autonomous data sources Software AG uses ontologies. Data source ontologies describe the data sources themselves. Business ontologies provide an integrated view of the data. F-Logic rules are used to describe mappings between data objects in data source or business ontologies. Furthermore, F-Logic is used as the query language. F-Logic rules are perfectly suited to describe the mappings between objects and their properties. Some of these mapping rules can be generated automatically from the data sources meta data. Some patterns do frequently reoccur in userdefined mapping rules, for instance rules which establish inverse object relations or rules which create new object relations based on the objects' property values. Within our first project access to information is still typical data retrieval and not so much knowledge inference. Therefore, a lot of effort in this project concentrated on query functionality and even more on performance. But these are only first steps. To strengthen this development and to get more experience in this field Software AG recently joined several EU research projects which all have a focus on exploitation of semantic technology with concrete business cases.
Conference Reports
Authors: Mitra Subhasish, Ondrej Novak, Hana Kubatova, Bashir M. Al-Hashimi, Erik Jan Marinissen, C. P. Ravikumar
Venue: IEEE Design Test (2006)

Reports from Workshop on System Effects of Logic Soft Errors (SELSE II), IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop (DDECS 06), European Test Symposium (ETS 06), and International Test Conference (ITC 05).
Grouping with Asymmetric Affinities: A Game-Theoretic Perspective
Authors: Andrea Torsello, Samuel Rota Bulo, Marcello Pelillo
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Pairwise grouping and clustering approaches have traditionally worked under the assumption that the similarities or compatibilities between the elements to be grouped are symmetric. However, asymmetric compatibilities arise naturally in many areas of computer vision and pattern recognition. Hence, there is a need for a new generic approach to clustering and grouping that can deal with asymmetries in the compatibilities. In this paper, we present a generic framework for grouping and clustering derived from a game-theoretic formalization of the competition between the hypotheses of group membership, and apply it to perceptual grouping. In the proposed approach groups correspond to evolutionary stable strategies, a classic notion in evolutionary game theory. We also provide a combinatorial characterization of the stable strategies, and, hence, of the elements that belong to a group. Experiments show that our approach outperforms both state-of-the-art clustering-based perceptual grouping approacheswith symmetric compatibilities, and other approaches explicitly designed to make use of asymmetric compatibilities.
Communicating Culture
Authors: Toru Ishida
Venue: IEEE Intelligent Systems (2006)

Nowadays, there's a new breed of globalization-different from the one spreading Coca Cola and Pokémon around the world. In our "small world," just as information moves across the globe, so do people. We see people with different cultural backgrounds learning to understand and enjoy the regional cultures they encounter.Consider, for example, sumo-Japanese traditional wrestling. People who appreciate sumo's excitement of sumo have increased in number regardless of where they live. In this way, the Japanese don't have to preserve the sumo tradition alone anymore. Similarly, people with various cultural backgrounds can preserve other regional indigenous cultural traditions.In such situations, the languages spoken vary. Although promoting English as a common language has its own role, taking the effort to understand other languages greatly helps in understanding culture. But, hundreds of languages are spoken around the world. It's simply too much to tackle this challenge all by ourselves. Will machine translation be helpful in this effort?This article is part of a special issue on the Future of AI.
Efficient Component Based Software Engineering using the TCEM Methodology and the TCET Tool
Authors: Santokh Singh, Cheung Ling Kelly Yu
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Currently there are no comprehensive tools that can be used to harness the full potential of Component Based Software Engineering (CBSE). In this paper, we describe a novel component-based software development methodology, called the "Total Component Engineering Methodology" (TCEM) that we have conceived, formulated and tested that can be efficiently and effectively applied to every phase of the CBSE process. We also describe a novel and comprehensive visual tool called the "Total Component Engineering Tool" (TCET) which uses enhanced visual notations and features to efficiently support our new development methodology. This novel tool and methodology complement each other and can be used to produce high-quality component based software that is highly understandable, scalable, maintainable and reusable.
Automatic Interactive Calibration of Multi-Projector-Camera Systems
Authors: Andreas Griesser, Luc Van Gool
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a novel interactive Projector Calibration for arbitrary Multi-Projector-Camera environments. The method does not require any calibration rig and is not restricted to any special arrangement of the display devices. The cameras in the system need to be precalibrated so that a common world coordinate system can be defined. Each projector is sequentially activated and a series of self-identifying tags is generated. These tags are accurately and robustly detected and must be seen by a minimum subset of the cameras. This is achieved by freely moving a target object, i.e. a sheet of paper, onto which the tags are projected. Point correspondences for each tag in threespace are computed by minimizing the reprojection errors in the relevant images and eliminating potential outliers. If a tag has been seen a sufficient number of times, it is masked out in the display so that a visual feedback of the current detection state is given to the user. The resulting 3D-point cloud coupled with the known 2D tag-position in the projector frame serves as input for a nonlinear optimization of the projector's intrinsic and extrinsic parameters as well as distortion factors. We show that the overall procedure takes less than a minute and results in low reprojection errors.