ppxscal/embedding_network huggingface dataset:
Web-based Traffic Management for Customer Network Management
Authors: Hyun-Chul Kang, Jae-Wook Lee, Gil-Haeng Lee
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)

Virtual private network are defined as network partitions of shared public network resources between multiple customers to form a private network that appears private to the users but is still part of the larger public networks. We suggest architecture of an integrated CNM system that is operated on the web-based traffic management technology. The CNM system provides the customer with a web-interface to view their entire VPN networks.
Collaborative scientific inquiry in a simulated laboratory
Authors: Anandi Nagarajan, Cindy E. Hmelo, Roger S. Day
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Designing clinical trials is a complex, ill-structured task. Medical students are equipped neither with relevant experience nor appropriate schemas to effectively design these experiments. Providing novice learners with real-world experiences are not always feasible due to safety, time, and cost. However, simulated experimental design environments can make these experiences possible. Computer models can promote new ways of thinking, facilitate multiple representation of problems, model the inquiry process, and provide explicit external representations. The Oncology Thinking Cap is one such modeling environment that provides students with experiences in designing and simulated clinical trials. In this paper, we present a case study of a group of fourth year medical students working collaboratively at designing Phase II clinical trials to test a cancer drug, Pittamycin. The trials were designed with a special interface that served to promote task-centered discussion and the construction of a shared problem space. The students became aware of the factors involved at this complex task and used the feedback to revise their understanding.
Folding
Authors: Jaroslav Nešetřil, Patrice Ossona de Mendez
Venue: Journal of Combinatorial Theory Series B (2006)

We define folding of a directed graph as a coloring (or a homomorphism) which is injective on all the down sets of a given depth. While in general foldings are as complicated as homomorphisms for some classes they present useful tool to study colorings and homomorphisms. Our main result yields for any proper minor closed class κ a folding (of any prescribed depth) using a fixed number of colors. This in turn yields (for any κ) the existence of a Kk-free graph which bounds (in the homomorphism order) all Kk-free graphs belonging to κ. This has been conjectured in [J. Nešetřil, Aspects of structural combinatorics, Taiwanese J. Math. 3 (4) (1999) 381-424] and elsewhere and solved for k = 3 in [J. Nešetřil, P. Ossona de Mendez, Colorings and homomorphisms of minor closed classes, in: J. Pach, et al. (Eds.), J. Goodman and R. Pollack Festschrift, Springer, Berlin, 2003, pp. 651-664]. Particularly, we prove (without using 4CT) the existence of a graph H which satisfies χ(H) ≤ 5, ω(H) ≤ 4 and such that any planar graph G is homomorphic to H. This is sandwiched between 4CT and 5CT for planar graphs and the general case has beating to Hadwiger conjecture.
Multiple channels of electronic communication for building a distributed learning community
Authors: Anne Rose, Robert B. Allen, Kathleen Fulton
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

The Maryland Electronic Learning Community (MELC) is part of the Baltimore Learning Community, a Challenge Grant project funded by the U.S. Department of Education. Created as a partnership between the Baltimore City Public Schools, the University of Maryland, and corporate and public sponsors, MELC was designed to investigate how an electronic learning community could be created around the development and use of a multimedia digital library for teacher-generated lesson plans and activities. In addition to audio, video, image, text, and web resources available in the library, multiple communications technologies (i.e., a community web site, email, a threaded discussion board, and distance learning laboratories) have supported collaboration and interaction among the teacher and university participants. In this paper we present a preliminary analysis of the impact of these technologies on teacher interaction and technology use. We find a substantial level of teacher communication and collaboration across media and we look for evidence that the multiple channels of interaction facilitate teacher&iacute;s professional development and increasing comfort with technology.
Probabilistic-Based Energy Aware Routing for Network Lifetime and Source Level Fairness in Wireless Sensor Networks
Authors: Na Wang, Chorng Hwa Chang
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Wireless sensor networks are often used to sample the state of physical phenomena in space. Sensor nodes, which usually have limited energy, collect data locally and forward them to a sink node. Thus there are two operating domains pertinent to the performance of such networks: (1) in time, which is the network longevity or lifetime, and (2) in space, which is the network coverage or source level fairness, i.e., the effective rate at which the state of the phenomena observed is reported at the sink. In this design paper we propose a simple, localized, probabilistic-based protocol that addresses performance issues in both domains. Our protocol addresses the time domain by exploring multiple paths for data delivery so that energy consumption can be uniformly distributed throughout the network, and addresses the spatial domain by dropping packets selectively in congested nodes, so that data flows from all sources will have their share of bandwidth to reach the sink.
Effect of deceptive referrals on system stability
Authors: Ikpeme Erete, Teddy Candale, Sandip Sen
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We study the problem of agents attempting to find quality service providers in a distributed environment. While referrals from other agents can be used to locate high-quality providers, referrers may be malicious and provide incorrect referrals to reduce traffic to their preferred service providers. Whereas apparently it would seem that such deceptive referrals can disrupt system stability, we observe that homogeneous groups of deceptive referrals converge faster to stable agent distributions over service providers compared to homogeneous groups of truthful referrers. We conjecture that deceptive referrers can unwittingly reduce the entropy, a measure of volatility, of the system as the recipient of a bad referral may not be inclined to move even if it is not satisfied with its current service providers. Additionally, we observe that mixed groups of truthful and deceptive referrers converge faster to stable distributions compared to homogeneous group of truthful referrers. These results highlight the unexpected positive effect of deceptive agents in stabilizing a population.
Using Styles to Improve the Architectural Views Design
Authors: Rogelio Limon Cordero, Isidro Ramos Salavert
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Software architecture has become more important in software engineering because it allows earlier decision making in systems design by defining the structures that will compose it. Each structure is in itself an architectural view that allows the isolation, analysis and modeling of different aspects of the system. The design of each view is based on the identification and specification of its elements and the relationships between them. This paper proposes a way to make a better architectural design through the management of the relationships present in a view type, using their styles as bases for the architectural structure, which leads to a more precise analysis in the design of architectural views.
A Distributed Workflow Management System for Automated Medical Image Analysis and Logistics
Authors: J. G. Snel, S. D. Olabarriaga, J. Alkemade, H. Gratama van Andel, A. J. Nederveen, C. B. Majoie, G. J. den Heeten, M. van Straten, R. G. Belleman
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Advances in medical image analysis have increased the need to integrate and deploy image analysis software in daily clinical routine and in epidemiological studies. We developed a Distributed Workflow Management System (DWMS) that supports a wide portfolio of image analyses in different CT and MRI application domains. The DWMS supports software components for image import/export, caching, processing and notification that are distributed on a heterogeneous grid of commodity computers. Communication between the components is performed by exchanging SOAP messages on request of standard compliant Web services. The workflows are executed fully automatically upon receipt of the medical images. After processing, the results are routed to a workstation for review and further analysis or to an image archive (PACS). A web-based monitor shows the status of running, pending and terminated workflows. The DWMS improves the interoperability between image acquisition devices, clinicians and researchers by making image analysis applications available in a transparent way, which accelerates the uptake of new research techniques. Through distributed computing, the workload is balanced and results can be obtained quicker. As the availability is guaranteed at a 24/7-hour basis, the system provides a reliable and completely automated solution for demanding image analysis tasks in a multi-vendor environment.
Almost periodic Verblunsky coefficients and reproducing kernels on Riemann surfaces
Authors: F. Peherstorfer, P. Yuditskii
Venue: Journal of Approximation Theory (2006)

We give an explicit parametrization of a set of almost periodic CMV matrices whose spectrum (is equal to the absolute continuous spectrum and) is a homogenous set E lying on the unit circle, for instance a Cantor set of positive Lebesgue measure. First to every operator of this set we associate a function from a certain subclass of the Schur functions. Then it is shown that such a function can be represented by reproducing kernels of appropriated Hardy spaces and, consequently, it gives rise to a CMV matrix of the set under consideration. If E is a finite system of arcs our results become basically the results of Geronimo and Johnson.
Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification
Authors: Nikil Wale, George Karypis
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In recent years the development of computational techniques that build models to correctly assign chemical compounds to various classes or to retrieve potential drug-like compounds has been an active area of research. Many of the best-performing techniques for these tasks utilize a descriptor-based representation of the compound that captures various aspects of the underlying molecular graph's topology. In this paper we compare different set of descriptors that are currently used for chemical compound classification. In this process, we also introduce four different descriptors derived from all connected fragments present in the molecular graphs. In addition, we introduce an extension to existing vector-based kernel functions to take into account the length of the fragments present in the descriptors. We experimentally evaluate the performance of the previously introduced and the new descriptors in the context of SVM-based classification and ranked-retrieval on 28 classification and retrieval problems derived from 18 datasets. Our experiments show that for both these tasks, the new descriptors consistently and statistically outperform previously developed schemes based on the widely used fingerprint- and Maccs keys-based descriptors, as well as recently introduced descriptors obtained by mining and analyzing the structure of the molecular graphs.
A BPEL4WS-based Composite Service Modeling Solution in Manufacturing Grid
Authors: Lei Duan, Shi-jun Liu, Chang-he Tu, Xiang-xu Meng
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In Manufacturing Grid, a lot of applications and resources in manufacturing enterprises are encapsulated as web services and a cooperative work environment is provided. Applying web service composition and workflow technologies, services are integrated into a composite service to represent a cooperative business process. Therefore the enterprise cooperation can be implemented by executing and monitoring the composite service. According to the characteristics of Manufacturing, this paper presents a composite service modeling solution based on BPEL4WS and discusses how this solution support BPEL4WS during the whole modeling process. The solution includes dynamic service discovery and service selection to support a flexible binding with the partners' services. This paper also describes how to execute and monitor the composite service.
Research on Evaluation & Coordination Control of Water Use System by Municipal Water User Groups
Authors: Liu Jianlin, Ma Bin, Shen Bing, Kong Ke, Yue Xinli
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Water use system by municipal water user group is characterized by its own laws. Water-saving research and practice by municipal water user group can effectively solve the problem of shortage of water resources so as to promote the construction of watersaving society. This paper can use the coordination control theory and method to coordinate the dynamic relationship of water use system among the municipal water user groups and analyzes the evolutionary trends and coordination nature. Also, with the water user groups of Xi'an Institution of Higher learning as the example, this paper deals with the features of water use compound systems in the institutions of higher learning of different types, whose conclusion can provide the benefit reference for water-saving management in the institutions of higher learning.
Implementation of a Molecular Simulator Based on a MultiAgent System
Authors: Fabio Avellaneda, Cesar Bustacara, Juan Pablo Garzon, Enrique Gonzalez
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This work aims to demonstrate how the requirement of modeling complex systems as the biological ones and the advances in MultiAgent Systems are combined to give a simple, scalable, robust and reliable simulation system. The mobility feature of the BESA agent framework and an interaction biological model are the basis for the construction of a molecular simulation application. The main bioinformatics application's requirements, such as the big number of interacting entities, the high calculations volume, its parallel and distributed processing nature and the need of solution's scalability, are outstanding. A good biological and agent design complemented with the locality model and the profit of agent's mobility makes this kind of applications feasible.
Approximate dynamic programming in multi-skill call centers
Authors: Ger Koole, Auke Pot
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We consider a multi-skill call center consisting of specialists and fully cross-trained agents. All traffic is inbound and there is a waiting queue for each skill type. Our objective is to obtain good call routing policies. In this paper we use the so-called policy iteration (PI) method. It is applied in the context of approximate dynamic programming (ADP). The standard PI method requires the exact value function, which is well known from dynamic programming. We remark that standard methods to obtain the value function suffer from the curse of dimensionality, i.e., the number of states grows exponentially with the size of the call center. Therefore, we replace the real value function by an approximation and we use techniques from ADP. The value function is approximated by simulating the system. We apply this method to our call routing problem, yielding very good results.
Facing the Strain
Authors: George Neville-Neil
Venue: Queue (2006)

Dear KV, I've been working on a software team that produces an end-user application on several different operating system platforms. I started out as the build engineer, setting up the build system, then the nightly test scripts, and now I work on several of the components themselves, as well as maintaining the build system. The biggest problem Ive seen in building software is the lack of API stability. It's OK when new APIs are added--you can ignore those if you like--and when APIs are removed I know, because the build breaks. The biggest problem is when someone changes an API, as this isn't discovered until some test script--or worse, a user--executes the code and it blows up. How do you deal with constantly changing APIs?
Simpler Analysis of Serial Transactions Using Reverse Transactions
Authors: Karim TRAORE, Emmanuel GROLLEAU, Francis Cottet
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

We present in this article a method of validation for "serial transaction". The serial transaction model has been proposed in order to validate a concrete real-time application. This model is typically a task reading serial information (RS232, CAN,): several instances are identical and read an unitary part of a serial packet, these tasks have the same WCET, offset shifting, priority and relative deadline. In addition, the last task of a transaction has to deal with the whole packet, and is typically longer, but has a longer relative deadline, and a lower priority. The method of validation that we present here uses the concept of reverse transaction deduced from the serial transaction to analyse.
Performance analysis through synthetic trace generation
Authors: L. Eeckhout
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

Most research in the area of microarchitectural performance analysis is done using trace-driven simulations. Although trace-driven simulations are fairly accurate, they are both time- and space-consuming which makes them sometimes impractical. Modeling the execution of a computer program by a statistical profile and generating a synthetic benchmark trace from this statistical profile can be used to accelerate the design process. Thanks to the statistical nature of this technique, performance characteristics quickly converge to a steady state solution during simulation, which makes this technique suitable for fast design space explorations. In this paper, it is shown how more detailed statistical profiles can be obtained and how the synthetic trace generation mechanism should be designed to generate syntactically correct benchmark traces. As a result, the performance predictions in this paper are far more accurate than those reported in previous research.
Imaging Facial Physiology for the Detection of Deceit
Authors: P. Tsiamyrtzis, J. Dowdall, D. Shastri, I. T. Pavlidis, M. G. Frank, P. Ekman
Venue: International Journal of Computer Vision (2007)

Previous work has demonstrated the correlation of increased blood perfusion in the orbital muscles and stress levels for human beings. It has also been suggested that this periorbital perfusion can be quantified through the processing of thermal video. The idea has been based on the fact that skin temperature is heavily modulated by superficial blood flow. Proof of this concept was established for two different types of stress inducing experiments: startle experiments and mock-crime polygraph interrogations. However, the polygraph interrogation scenarios were simplistic and highly constrained. In the present paper, we report results derived from a large and realistic mock-crime interrogation experiment. The interrogation is free flowing and no restrictions have been placed on the subjects. Additionally, we propose a new methodology to compute the mean periorbital temperature signal. The present approach addresses the deficiencies of the earlier methodology and is capable of coping with the challenges posed by the realistic setting. Specifically, it features a tandem CONDENSATION tracker to register the periorbital area in the context of a moving face. It operates on the raw temperature signal and tries to improve the information content by suppressing the noise level instead of amplifying the signal as a whole. Finally, a pattern recognition method classifies stressful (Deceptive) from non-stressful (Non-Deceptive) subjects based on a comparative measure between the entire interrogation signal (baseline) and a critical subsection of it (transient response). The successful classification rate is 87.2% for 39 subjects. This is on par with the success rate achieved by highly trained psycho-physiological experts and opens the way for automating lie detection in realistic settings.
Consecutive customer loss probabilities in M/G/1/n and GI/M(m)//n systems
Authors: António Pacheco, Helena Ribeiro
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

We address the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability. We derive efficient algorithms to compute k-CCL probabilities in M/G/1/n and GI/M(m)//n systems for busy periods starting with an arbitrary number of customers in the system that, essentially, reduce to solving either simple recursions or linear systems of equations.
MINIX 3: a highly reliable, self-repairing operating system
Authors: Jorrit N. Herder, Herbert Bos, Ben Gras, Philip Homburg, Andrew S. Tanenbaum
Venue: ACM SIGOPS Operating Systems Review (2006)

Different kinds of people use computers now than several decades ago, but operating systems have not fully kept pace with this change. It is true that we have point-and-click GUIs now instead of command line interfaces, but the expectation of the average user is different from what it used to be, because the user is different. Thirty or 40 years ago, when operating systems began to solidify into their current form, almost all computer users were programmers, scientists, engineers, or similar professionals doing heavy-duty computation, and they cared a great deal about speed. Few teenagers and even fewer grandmothers spent hours a day behind their terminal. Early users expected the computer to crash often; reboots came as naturally as waiting for the neighborhood TV repairman to come replace the picture tube on their home TVs. All that has changed and operating systems need to change with the times.
Toward a Concern-Oriented Analysis Method for Enterprise Information Systems
Authors: Crenguta Bogdan, Luca Dan Serbnati
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The paper introduces a method for identifying, classifying, and analyzing the concerns of the stakeholders of a business system (i.e. an enterprise). The method is useful when we are going to develop an information system (IS) in the context of a given business. Understanding and resolving these concerns allow us to more easily gather the requirements for the new IS. Understanding the concerns means to be able to describe them. Therefore, for each concern a high level specification should be elaborated. This specification describes the concern associated problem and the care of one or more stakeholders. Taxonomy of concerns emerging during a IS life cycle is proposed by introducing four perspectives on the system development: social, informational, functional, and technological. From each of these perspectives concerns emerge that have to be taken in consideration in order to develop a new system or modify an existing one.