ppxscal/embedding_network huggingface dataset:
End-User Specification of Quality of Service Applying the Model-Driven Approach
Authors: David Durand, Christophe Loge
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The need for Quality of Service support is significant in industrial and multimedia applications. However, it is often hard for software designers to deal with the low-level resources involved in the realization of QoS management. A wide range of technologies, programming languages and operating systems coexist, so it increases the difficulty for designers to build portable applications. Middleware architectures provide an abstract layer between applications and systems. They hide the technology heterogeneity and ease communications between distributed components. Following the Model Driven Architecture approach, but also using off-the-shelf libraries, the development process leading from the design to the implementation can be automated to take into account QoS requirements and to transpose them to a final piece of software. In this paper, we present a solution to model user-oriented QoS description, and the transformation steps that translate this information to low-level characteristics.
An End Host Multicast Protocol for Peer-to-Peer Networks
Authors: Wanqing Tu, Weijia Jia
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper presents a novel end host multicast protocol (DSM) on top of the mesh overlays for P2P networks. Unlike the previous schemes, the major feature ofDSM is that it does not need a multicast tree for routing the multicast messages. DSM can implement the scalable and efFcient multicast communications in a fully distributed way and consists of the following algorithms: I . cluster formation that forms the group into clusters and each cluster consists of a small number of members; 2. cluster core selection that selects a core for each cluster who has the minimum sum of overlay hops to all other cluster members; 3. multicast routing that includes the balanced RA routing approach which enables a cluster core to construct the connections with other cores dynamically by using the rectangle area and the balanced forwardjlooding scheme in each cluster which evenly distributes the data traf- Jic and link stress among the links in the multicast system. Simulation results show that DSM is fully distributed, scalable and efjicient as compared with some well-known end host multicast system.
An Industry View on Service-Oriented Architecture and Web Services
Authors: Jen-Yao Chung
Venue: Proceedings of the IEEE International Workshop (2005)

Web services are autonomous software systems identifiable by URIs that can be advertised, located, and accessed through standard-based XML messages (e.g. SOAP, WSDL, and UDDI) and transmitted via Internet protocols. Web services encapsulate application functionalities and information resources, and make them available through programmatic interfaces, as opposed to the typical interfaces provided by traditional Web applications specifically for manual interactions [1]. Web Services integration enables a dynamic ebusiness model that fosters collaboration with heterogeneous business services and opens the doors for new business opportunities. A service-oriented architecture (SOA) is an application framework that takes everyday business applications and breaks them down into individual business functions and processes, called services [2]. With the widely acceptance and adoption of SOA that wraps software resources over the network as services and provides a standard-based IT infrastructure, we anticipate and envision more opportunities for the software industry to adopt a Service business model. In this talk, we will discuss dynamic Web services integration and show various patterns when implementing on demand integrations. We will present guidelines for applying the SOA approach to several industrial business scenarios and for selecting Web services technologies. We will conclude with our view about the trends and directions of Web Services and SOA in the on demand world.
Scheduling divisible loads in multiple rounds
Authors: Yang Yang
Venue:  (2005)

This dissertation studies the class of Divisible Load (DL) applications, which comprises many important applications in science and engineering. A key issue for achieving high performance for these application is: how to schedule them effectively onto distributed computing platforms? This work focuses on solving the Divisible Load Scheduling (DLS) problem, and makes the following contributions. We propose new and more realistic platform models than those used in previous DLS work. We present the first proof that the DLS problem is NP-Complete. We develop novel multi-round DLS algorithms that are more widely applicable than previously proposed algorithms and that, as shown in simulation, are more effective. We address the issue of performance prediction errors, which are expected in real-world settings, and present a novel DLS algorithm that is robust to such errors. Finally, we report on our practical implementation of a DL scheduler, APSTDV, that can be used for scheduling and deploying real applications on real distributed platforms. We demonstrate the ease-of-use and performance of APSTDV via a number of experiments and case-studies.
GroupAdaBoost for Selecting Important Genes
Authors: Takashi Takenouchi, Masaru Ushijima, Shinto Eguchi
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

This paper proposes GroupAdaBoost as a variant of AdaBoost for statistical pattern recognition. The objective of the proposed algorithm is to solve the "p ≫ n" problem arisen in bioinformatics. Typically, p is the number of investigated genes and n is number of individuals in a microarray experiment for observing gene expressions in a problem to extract any specific pattern of gene expressions related to a disease status. The ordinary method for predicting the genetic causes of diseases is apt to over-learn from any particular training dataset because of facing "p ≫ n" problem. We observed that GroupAdaBoost gave a robust performance for cases of the excess number of genes. In several real datasets, which are publicly available from web-pages, we compared the analysis of results among the proposed method and others, and a small scale of simulation study to confirm the validity of the proposed method.
A stochastic CAI model for assisting in the design of football strategy
Authors: Ralph B. Bisland,  Jr.
Venue: ACM SIGSIM Simulation Digest (1978)

This article describes a FORTRAN based interactive stochastic simulation model intended to assist collegiate football strategists in the design and evaluation of various offensive strategies. The model does exist and has been partially validated.
User-perceived quality of service in wireless data networks
Authors: J. Saliba, A. Beresford, Milosh Ivanovich, Paul Fitzpatrick
Venue: Personal and Ubiquitous Computing (2005)

For so long, the term quality of service (QoS) has been a pursuit area for network engineers trying to dimension wireless networks to run in the most efficient way possible. Of late, there has been a trend reversal, looking at the user perceptions of the network performance to decide where dimensioning can have the greatest impact. This paper demonstrates the importance of defining the concept of user-perceived QoS and linking this to specific wireless data network parameters for some anticipated valuable applications. It has been shown that a quantitative rating can be obtained for a variety of important factors in the assessment of service quality, and mapped to specific values of multiple network parameters. We found QoS to be application-specific, where various applications require different levels of network performance to satisfy users. The role of physical location was also examined, investigating the influence of being indoors versus outdoors on the user perception of QoS.
Data Dependence Based Testability Transformation in Automated Test Generation
Authors: Bogdan Korel, Mark Harman, S. Chung, P. Apirukvorapinit, R. Gupta, Q. Zhang
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Source-code based test data generation is a process of finding program input on which a selected element, e.g., a target statement, is executed. There exist many test generation methods that automatically find a solution to the test generation problem. The existing methods work well for many programs. However, they may fail or are inefficient for programs with complex logic and intricate relationships between program elements. In this paper we present a testability transformation that transforms programs so that the chances of finding a solution are increased when the existing methods fail using only the original program. In our approach data dependence analysis is used to identify statements in the program that affect computation of the fitness function associated with the target statement. The transformed program contains only these statements, and it is used to explore different ways the fitness may be computed. These explorations are inexpensive when using the transformed program as compared to explorations using the original program. As a result, executions in the transformed program that lead to the evaluation of the fitness function to the target value are identified. The identified executions are then used to guide the search in the original program to find an input on which the target statement is executed. In this paper, the approach is evaluated using a case study which demonstrates the potential for this testability transformation to improve the efficacy of the test generation.
Designing and Deploying a Rural Ad-Hoc Community Mesh Network Testbed
Authors: Wayne Allen, Art Martin, Anand Rangarajan
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Rural communities suffer from a lack of infrastructure for inexpensive high-speed access to the Internet. One approach to providing high-speed access in these environments is to share a small number of more expensive high-speed connections across the community. A wireless mesh network can provide a low-cost backbone to enable this sharing. Existing solutions to building community mesh networks use proprietary technology or typically require rooftop or other outdoor antenna deployment. We examine the feasibility of constructing a community mesh network in a rural neighborhood at Dartmouth College using off-the-shelf hardware and software components and without using an outdoor antenna. We identify several challenges to construction of such networks including network density, hardware limitations, and US electrical code. In this paper, we outline some of the key challenges we faced during our deployment and suggest solutions.
VRM: A Failure-Aware Grid Resource Management System
Authors: Lars-Olof Burchard, Cesar A. F. De Rose, Hans-Ulrich Heiss, Barry Linnert, Jorg Schneider
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

For resource management in Grid environments, advance reservations turned out to be very useful and hence are supported by a variety of Grid toolkits. However, failure recovery for such systems has not yet received the attention it deserves. In this paper, we address the problem of remapping reservations to other resources, when the originally selected resource fails. Instead of dealing with jobs already running, which usually means checkpointing and migration, our focus is on jobs that are scheduled on the failed resource for a specific future period of time but not started yet. The most critical factor when solving this problem is the estimation of the downtime. We avoid the drawbacks of under- or overestimating the downtime by a dynamic load-based approach that is evaluated by extensive simulations in a Grid environment and shows superior performance compared to estimationbased approaches.
Supporting the creation of Mood Boards: Industrial Design in Mixed Reality
Authors: Andres Lucero, Jean-Bernard Martens
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

Advancements in mixed-reality (MR) systems have concentrated on the technology required for implementation, providing proof-of-concepts by means of technology-tailored usage scenarios. These systems have been tested mainly on well-contained tasks and applications specifically developed for these platforms. The potential impact of such techniques on actual work practices hence remains largely unexplored. We plan to investigate this practical relevance in more detail for industrial designers. Specific activities have been identified during a full ethnographic study conducted by means of Cultural Probes and Workshops with representative participants. For one such activity, creating mood boards, a new MR interaction concept will be designed and evaluated. We will continue to use participatory design techniques to involve industrial designers at different stages of the design cycle.
Monte carlo solution of scattering equations for computer graphics
Authors: Patrick M. Hanrahan
Venue:  (2005)

We present a mathematical framework for solving rendering problems in computer graphics that is based on scattering as its basic theoretical foundation, rather than the usual approach of simulating light transport and equilibrium. This framework can lead to more efficient solution methods than those based on previous methods as well as a number of new theoretical tools for solving rendering problems. We demonstrate the applicability of this approach to accurately and efficiently rendering subsurface scattering from geometric objects. We first introduce a non-linear integral scattering equation that describes scattering from complex objects directly in terms of the composition of their lower-level scattering properties. This equation was first derived to solve scattering problems in astrophysics and has gone on to revolutionize approaches to transport problems in a number of fields. We derive this equation in a sufficiently general setting to be able to apply it to a variety of problems in graphics, which typically has problems with higher-dimensionality, more complexity, and less regularity than those in other fields. Methods to solve this equation have a divide-and-conquer flavor to them, in contrast to previous iterative methods based on the equation of transfer (i.e. the rendering equation). We apply Monte Carlo techniques to solve this scattering equation efficiently; to our knowledge, this is the first application of Monte Carlo to solving it in any field. We next introduce Preisendorfer's Interaction Principle, which subsumes both scattering and light transport based approaches to transfer problems. It leads to a derivation of a set of adding equations that describe scattering from multiple objects in terms of how they scatter light individually. We show how Monte Carlo techniques can be applied to solve these adding equations and apply them to the problem of rendering subsurface scattering.
A Multi-Agent based Fault Tolerance System for Distributed Multimedia Object Oriented Environment: MAFTS
Authors: Eung-Nam KO
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper presents the design and implementation of the MAFTS(A Multi-Agent based Fault-Tolerance System), which is running on distributed multimedia object oriented environment. DOORAE(Distributed Object Oriented collaboRAtion Environment) is a good example of the foundation technology for a computerbased multimedia collaborative work that allows development of required application by combining many agents composed of units of functional module when user wishes to develop a new application field. MAFTS has been designed and implemented in DOORAE environment. It is a multi-agent system that is implemented with object oriented concept. The main idea is to detect an error by usingpolling method. This system detects an error by polling periodically processes with relation to sessions. And, it is to classzfL the type of errors automatically by using learning rules. The characteristic of this system is to use the same method to get back again it as it creates a session. (Key words: MAFTS, Fault-Tolerance System, DOORAE, multimedia collaborative work, multiagent, polling, learning rules.) ...
New approaches for deniable authentication
Authors: Mario Di Raimondo, Rosario Gennaro
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Deniable Authentication protocols allow a Sender to authenticate a message for a Receiver, in a way that the Receiver cannot convince a third party that such authentication (or any authentication) ever took place.We present two new approaches to the problem of deniable authentication. The novelty of our schemes is that they do not require the use of CCA-secure encryption (all previous known solutions did), thus showing a different generic approach to the problem of deniable authentication. This new approach is practically relevant as it leads to more efficient protocols and security reductions.In the process we point out a subtle definitional issue for deniability. In particular we propose the notion of forward deniability, which requires that the authentications remain deniable even if the Sender wants to later prove that she authenticated a message. We show that forward deniability is not implied by the original notion of deniability, by showing some deniable protocols which are not forward deniable. Our new proposals are forward deniable.
Detecting LSB Steganography Based on Dynamic Masks
Authors: Xiangyang Luo, Bin Liu, Fenlin Liu
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper presents a dynamic regular groups steganalysis (DRS) algorithm to detect LSB steganography. This algorithm dynamically selects an appropriate mask for each image to reduce the initial bias, and estimates the LSB embedding message ratio by constructing equations with the statistics of regular groups in image. Experimental results show that this algorithm is more accurate and has a lower missing rate and false alarm rate than the conventional RS method and some other powerful steganalysis approaches present recently.
Collaborative Problem Solving Environment "Desk Side Laboratory"
Authors: Taiyo Maeda, Yoshimasa Kadooka, Yoshio Tago
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Desk Side Laboratory (DSLab), which allows scientists and engineers in geographically different locations to do state-of-the-art research and development through internet on their web browsers, has been developed only using commodity products. It has an easy-to-use user interface. It has been found that, when applied to an optimization design of mobile communication system, DSLab is very useful to determine optimization parameters in real time and can yield the results with high reliability in a short time. It has been expected that DSLab is useful for an interdisciplinary approach of state-of-the-art research and development.
Face-to-Face Media Sharing Using Wireless Mobile Devices
Authors: Trevor Pering, David H. Nguyen, John Light, Roy Want
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Advanced personal wireless mobile devices, such as today's emerging smart-phones, are capable computers that have the potential to enable individuals to share personal content, such as photographs, music, and video. Face-to-face sharing can be a satisfying and even emotional experience, yet it is not well supported by existing digital technologies, which typically isolate media into separate collections or require that they be manually combined into a single collection on a single machine. Federating wireless mobile devices with fixed infrastructure, such as a digital home entertainment center, provides a lightweight, unified, and intuitive way to share media among friends and family. This paper looks at both technological and social issues that surround sharing media using federated devices, considering the relevant emerging technologies, media types, and usage contexts.
On the Stability of Rational, Heterogeneous Interdomain Route Selection
Authors: Hao Wang, Haiyong Xie, Yang Richard Yang, Avi Silberschatz, Li Erran Li, Yanbin Liu
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

The recent discovery of instability caused by the interaction of local routing policies of multiple ASes has led to extensive research on the subject. However, previous studies analyze stability under a specific route selection algorithm. In this paper, instead of studying a specific route selection algorithm, we study a general class of route selection algorithms which we call rational route selection algorithms. We present a sufficient condition to guarantee routing convergence in a heterogeneous network where each AS runs any rational route selection algorithm. Applying our general results, we study the potential instability of a network where the preference of an AS depends on not only its egress routes to the destinations but also its inbound traffic patterns (i.e., the distribution of incoming traffic from its neighbors). We show that there exist networks which will have persistent route oscillations even when the ASes strictly follow the constraints imposed by business considerations, and adopt any rational route selection algorithms.
Four dynamics for bringing use back into software reuse
Authors: Kevin C. Desouza, Yukika Awazu, Amrit Tiwana
Venue: Communications of the ACM (2006)

Reuse is such a powerful tool---so why isn't it more popular?
Autonomic Microprocessor Execution via Self-Repairing Arrays
Authors: Fred A. Bower, Sule Ozev, Daniel J. Sorin
Venue: IEEE Transactions on Dependable and Secure Computing (2005)

To achieve high reliability despite hard faults that occur during operation and to achieve high yield despite defects introduced at fabrication, a microprocessor must be able to tolerate hard faults. In this paper, we present a framework for autonomic self-repair of the array structures in microprocessors (e.g., reorder buffer, instruction window, etc.). The framework consists of three aspects: 1) detecting/diagnosing the fault, 2) recovering from the resultant error, and 3) mapping out the faulty portion of the array. For each aspect, we present design options. Based on this framework, we develop two particular schemes for self-repairing array structures (SRAS). Simulation results show that one of our SRAS schemes adds some performance overhead in the fault-free case, but that both of them mask hard faults 1) with less hardware overhead cost than higher-level redundancy (e.g., IBM mainframes) and 2) without the per-error performance penalty of existing low-cost techniques that combine error detection with pipeline flushes for backward error recovery (BER). When hard faults are present in arrays, due to operational faults or fabrication defects, SRAS schemes outperform BER due to not having to frequently flush the pipeline.