ppxscal/embedding_network huggingface dataset:
Enhancing component specification by behavior description: the SOFA experience
Authors: Frantisek Plasil
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

This paper aims at sharing with the reader the experience with behavior protocols - the component behavior description introduced in our SOFA component model and emphasize the key research challenges we have faced in this respect during its 6 years existence and development. In particular, this includes the issue of finding the "right" semantics of fulfilling the behavior contract in terms of both horizontal (client-service) and vertical (nesting) cooperation of components. The contribution of the paper is that it brings our findings published "incrementally" under one umbrella and articulates verbally what was elsewhere captured in an exact, formal way.
Predictive Coding for Efficient Host-Device Communication in a Pneumatic Force-Feedback Display
Authors: Christoph W. Borst
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We investigate predictive coding for reducing the amount of data communicated between a haptic controller and a host. This allows increased update rate, which potentially improves quality even if coding is lossy. A low-order predictive coding is investigated for a pneumatic force display. Due to human and device characteristics, some compression is possible without loss, although the technique is lossy in general. Lossy uniform and nonuniform quantizers are also investigated. An experiment was conducted to determine how much data reduction is possible before compression artifacts become detectable to users.
MNP: Multihop Network Reprogramming Service for Sensor Networks
Authors: Sandeep S. Kulkarni, Limin Wang
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogramming service designed for Mica-2/XSM motes. One of the problems in reprogramming is the issue of message collision. To reduce the problem of collision and hidden terminal problem, we propose a sender selection algorithm that attempts to guarantee that in a neighborhood there is at most one source transmitting the program at a time. Further, our sender selection is greedy in that it tries to select the sender that is expected to have the most impact. We also use pipelining to enable fast data propagation. MNP is energy efficient because it reduces the active radio time of a sensor node by putting the node into "sleep" state when its neighbors are transmitting a segment that is not of interest. Finally, we argue that it is possible to tune our service according to the remaining battery level of a sensor, i.e., it can be tuned so that the probability that a sensor is given the responsibility of transmitting the code is proportional to its remaining battery life.
Ensuring stable performance for systems that degrade
Authors: Alberto Avritzer, Andre Bondi, Elaine J. Weyuker
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

A new approach that is useful in identifying and eliminating performance degradation occurring in aging software is proposed. A customer-affecting metric is used to initiate the restoration of such a system to full capacity. A case study is described in which, by simulating an industrial software system, we are able to show that by monitoring a customer-affecting metric and frequently comparing its degradation to the performance objective, we can ensure system stability at a very low cost.
Productivity in High Performance Computing
Authors: David J. Kuck
Venue: International Journal of High Performance Computing Applications (2004)

HPC (high performance computing) has been a popular acronym for decades, and has been applied to many types of architectures, software and applications. The "P" has recently been overloaded to mean both performance and productivity. We present a survey of today's performance and productivity situation relative to the constituent HPC hardware and software components, and provide some analysis of current controversies and open issues. Since "HPC" will continue to be applied to whatever is happening at the leading edge of computer architecture, system and development software, and algorithms and applications, there is no hope or need to define or clean up terminology (this paper uses HPC to denote hiperc and hiproc, with context determining meaning). Instead, it is important to clarify the whys and wherefores of the state of the art, in order to focus on new work that will maximize future benefits. This paper gives a broad discussion of HPC productivity in terms of effective architectures, run-time system software, and applications development tools. There are costs and trade-offs associated with each of these, and in fact multiple marketplaces consume these products. The range of demands placed on HPC, by owners and users of systems ranging from public research laboratories to private scientific and engineering companies, enrich the topic with many competing technologies and approaches. Rather than expecting to eliminate each other in the short run, these HPC competitors should be learning from one another in order to stay in the race. It seems clear that the dynamics between "commodity" and "custom" building blocks will remain at the center of HPC debates for some time, and indeed these competing forces form the engine of improvement for overall HPC cost/effectiveness.
DESIGNING GRAPHICAL USER INTERFACES USING TAE PLUS
Authors: Martha R. Szczur
Venue: ACM SIGCHI Bulletin (1991)

The Transportable Applications Environment (TAE) Plus is a general purpose user interface development and management system. TAE Plus was designed for user interface (UI) designers who are not programmers and it provides an intuitive development environment for (1) interactively constructing the visual layout of an application screen, (2) rehearsing the UI, (3) generating the application source code to manage the UI, and (4) providing run-time services to manage the UI during application execution. Refer to Figure 1.
Admissibility of unstable second-order digital filters with two's complement arithmetic: Letters to the Editor
Authors: Bingo Wing-Kuen Ling, Charlotte Yuk-Fan Ho, Peter Kwong-Shun Tam
Venue: International Journal of Circuit Theory and Applications (2004)

In this paper, we have extended the existing results on the admissible set of periodic symbolic sequences of a second-order digital filter with marginally stable system matrix to the unstable case. Based on this result, the initial conditions can be computed using the symbolic sequences. The truncation error of the representation of an initial condition due to the use of a finite number of symbols is studied. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The method of lines for the numerical solution of partial differential equations (abstract)
Authors: Niel K. Madsen
Venue: ACM SIGNUM Newsletter (1975)

The numerical solution of time dependent nonlinear partial differential equations is a complicated and nontrivial process. Generally speaking, the solution of slightly different types of partial differential equations has required the development of separate and different computer programs. This situation for partial differential equations is in direct contrast to that for ordinary differential equations. Recently, sophisticated and reliable computer programs for the automatic solution of nonlinear systems of ordinary differential equations have become available. The use of the <u>method of lines</u> approach for solving partial differential equations is an attempt to take advantage of these recent significant developments for ordinary differential equations. In this presentation we will compare the advantages and disadvantages of this approach. We will describe how the method of lines approach for solving PDE's allows one to be able to develope very general purpose computer software for solving broad classes of problems. The structure and use of this software will be described. Finally, numerical results obtained with this general purpose software will be presented and discussed.
An Efficient Algorithm Based on Simulated Annealing for Multicast Routing with Delay and Delay Variation Constraints
Authors: Kun Zhang, Heng Wang, Feng-Yu Liu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

As a NP-complete problem, multicast routing with delay and delay variation constraints is a research difficulty in multicast communications. In this paper, we propose an efficient multicast routing algorithm based on simulated annealing named SADDVMA to construct delay and delay variation constrained Steiner tree. The proposed algorithm uses a procedure called Paths Switching to construct neighbors in feasible region, which greatly reduces the search area and computing time. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms. Further, it performs excellent performance of delay and delay variation, high success ratio, rapid convergence and better real-time property.
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Venue: International Symposium on Mobile Ad Hoc Networking Computing (2005)

It is a pleasure to welcome all the participants to the Sixth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2005. This is the second time that the symposium is being held on a university campus, which besides the pastoral experience also provides more for the money. An innovation for this year was to feature two parallel tracks for the contributed sessions, which allowed us to increase the papers presented from twenty-four last year to forty this year. It also allowed us to have a two-hour Panel Discussion on a topic of much current importance, "'Openness' and the Public Airwaves," organized by Sascha Meinrath, with Panelists Victor Bahl, Kenneth Carter, Mark Cooper, Ben Scott and Matt Westervelt, as well as a Keynote Talk, "Toward the Sensor Network Macroscope," by David Culler.
Tai Chi synthesizer: a motion synthesis framework based on key-postures and motion instructions: Research Articles
Authors: Shih-Pin Chao, Chih-Yi Chiu, Shi-Nine Yang, Tsang-Gang Lin
Venue: Computer Animation and Virtual Worlds (2004)

Human spontaneous motions such as walking and runing are seldom described in detail. However, some well designed motions such as conditioning and rehabilitation exercises are usually described in detail and edited into exercise manuals for training purpose. This paper presents a novel framework for synthesizing new motions based on given motion manuals and corresponding motion capture examples. First, using text analysis method, a set of basic motion texts is extracted from exercise manuals and converted into text normal form. Then we introduce an annotation method to build the mapping table between basic motion texts and their corresponding motion clips in the given examples. To facilitate the search for proper motion clips, a multi-dimensional index structure based on posture parameters is proposed. Then a new motion with given textual description can be synthesized by converting the description sentences into a sequence of text normal forms and then concatenating the corresponding motion clips to form the desired motion. Moreover, to realize the smooth concatenation, we show that it can be achieved by finding an appropriate path in the proposed multi-dimensional index space. Several experimental examples are given to demonstrate the proposed method is effective in synthesizing desired motions according to given descriptions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
DATE: a dialogue act tagging scheme for evaluation of spoken dialogue systems
Authors: Marilyn Walker, Rebecca Passonneau
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes a dialogue act tagging scheme developed for the purpose of providing finer-grained quantitative dialogue metrics for comparing and evaluating DARPA COMMUNICATOR spoken dialogue systems. We show that these dialogue act metrics can be used to quantify the amount of effort spent in a dialogue maintaining the channel of communication or, establishing the frame for communication, as opposed to actually carrying out the travel planning task that the system is designed to support. We show that the use of these metrics results in a 7% improvement in the fit in models of user satisfaction. We suggest that dialogue act metrics can ultimately support more focused qualitative analysis of the role of various dialogue strategy parameters, e.g. initiative, across dialogue systems, thus clarifying what development paths might be feasible for enhancing user satisfaction in future versions of these systems.
End user programming and context responsiveness in handheld prompting systems for persons with cognitive disabilities and caregivers
Authors: Stefan Carmien
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Providing instructions via handheld prompters holds much promise for supporting independence for persons with cognitive disabilities. Because users of these tools are paired - caregivers who make scripts and a person with cognitive disabilities who uses them - designing such a system presents unique meta-design problems. The problems of changing content and configuration on a handheld computer, as needs and abilities change of the users with cognitive disabilities, produce a critical need for end-user programming tools. This paper describes the design and testing of the MAPS (Memory Aiding Prompting System) system, consisting of a handheld prompter and a multimedia editing tool for script creation, storage, and modification. The unique meta-design challenges of supporting end-user programming of context-responsive systems, and its broader implications, are presented.
A task-independent control method for spoken dialogs
Authors: Tomoki Oku, Takuya Nishimoto, Masahiro Araki, Yasuhisa Niimi
Venue: Systems and Computers in Japan (2004)

In this paper the authors propose a task-independent control method for spoken dialogs. This is an expansion of the frame-driven dialog control method used in text-based dialog systems, which employs knowledge specific for a task using a database and frames. The frame consists of a set of related topics that can be treated in specific tasks, the priority ranking, and the behavior of the system when each topic is completed. When there is a hierarchical relationship among topics, this is described as a hierarchical relationship among frames. The dialog history is represented by the topic frame using a tree structure that can provide dynamic links (this is called a dynamic topic tree). System-initiative and user-initiative dialog can be accomplished by searching the dynamic topic tree using two types of approaches. The authors created a spoken dialog system for four typical tasks and performed spoken dialog experiments in order to evaluate the system. The results showed that all subjects were able to complete the tasks. This demonstrates that the authors' method is valid as a way to create a practical task-independent spoken dialog system. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 87&ndash;95, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10589
A Sexual Elitist Genetic Algorithm for Providing QoS in Distributed Virtual Environment Systems
Authors: S. Rueda, P. Morillo, J. M. Orduna, J. Duato
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Architectures based on networked servers have become a de-facto standard for Distributed Virtual Environment (DVE) systems. These systems allow a large number of remote users to share a single 3D virtual scene. In order to provide quality of service in a DVE system, clients should be assigned to servers taking into account system throughput and system latency. This highly complex problem is known as the quality of service (QoS) problem. This paper proposes an elitist sexual genetic algorithm for solving the QoS problem in Distributed Virtual Environment systems. Performance evaluation results show that, due to its ability of both finding good search paths and keeping diversity escaping from local minima, this nature inspired technique can provide significantly better solutions than other heuristic methods with shorter execution times. Therefore, the proposed implementation of GA search method can improve the QoS offered by DVE systems.
Modeling plasma etching process using a radial basis function network
Authors: Byungwhan Kim, Kyungyoung Park
Venue: Microelectronic Engineering (2005)

A new model of plasma etch process is constructed by using a radial basis function network (RBFN). This technique was applied to an etching of silicon carbide films in a NF"3 inductively coupled plasma. Experimental data to train RBFN were systematically collected by a 2^4 full factorial experiment. Appropriateness of prediction models was tested with test data consisted of 16 experiments not pertaining to the training data. Prediction performance was optimized with variations in three training factors, the number of pattern units, width of radial basis function, and initial weight distribution between the pattern and output layers. The etch responses to model are an etch rate and a surface roughness measured by atomic force microscopy. Optimized models had the root mean-squared errors of 26.1 nm/min and 0.103 nm for the etch rate and surface roughness, respectively. Compared to statistical regression models, RBFN models demonstrated an improvement of more than 20%. For the etch rate, the improvement was considerably increased to more than 40%. It is therefore expected that RBFN can be effectively used to construct prediction models of plasma processes.
Evaluation of Cache-based Superscalar and Cacheless Vector Architectures for Scientific Computations
Authors: Leonid Oliker, Andrew Canning, Jonathan Carter, John Shalf, David Skinner, Ethier Ethier, Rupak Biswas, Jahed Djomehri, Rob Van der Wijngaart
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

The growing gap between sustained and peak performance for scientific applications is a well-known problem in high end computing. The recent development of parallel vector systems offers the potential to bridge this gap for many computational science codes and deliver a substantial increase in comput-ing capabilities. This paper examines the intranode performance of the NEC SX-6 vector processor and the cache-based IBM Power3/4 superscalar architectures across a number of scientific computing areas. First, we present the performance of a microbenchmark suite that examines low-level machine characteristics. Next, we study the behavior of the NAS Parallel Benchmarks. Finally, we evaluate the performance of several scientific computing codes. Results demonstrate that the SX-6 achieves high performance on a large fraction of our applications and often significantly outperforms the cache-based architectures. However, certain applications are not easily amenable to vectorization and would require extensive algorithm and implementation reengineering to utilize the SX-6 effectively.
Ensuring required failure atomicity of composite Web services
Authors: Sami Bhiri, Olivier Perrin, Claude Godart
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The recent evolution of Internet, driven by the Web services technology, is extending the role of the Web from a support of information interaction to a middleware for B2B interactions.Indeed, the Web services technology allows enterprises to outsource parts of their business processes using Web services. And it also provides the opportunity to dynamically offer new value-added services through the composition of pre-existing Web services.In spite of the growing interest in Web services, current technologies are found lacking efficient transactional support for composite Web services (CSs).In this paper, we propose a transactional approach to ensure the failure atomicity, of a CS, required by partners. We use the Accepted Termination States (ATS) property as a mean to express the required failure atomicity.Partners specify their CS, mainly its control flow, and the required ATS. Then, we use a set of transactional rules to assist designers to compose a valid CS with regards to the specified ATS.
PRISM: A Preventive and Risk-Reducing Integrated Security Management Model Using Security Label
Authors: D. S. Kim, Y. J. Jung, T. M. Chung
Venue: The Journal of Supercomputing (2005)

An automated security management integrating various security systems is strongly required because cyber attacks are evolving day after day. Moreover, the attacks are become more complex and intelligent than past. Several integrated security management (ISM) models are supposed and implemented to meet the requirements. However, the current ISM is passive and behaves in a post-event manner. To reduce costs and resources for managing security and to remove the possibility of an intruder succeeding in attacks, the preventive security management technology is strongly required. This paper proposes the PRISM model that is based on tracing important assets in a managed network and performs preventive security management before security incidents occur. Additionally, PRISM model employs security labels to deploy differentiated security measure. The PRISM will provide concrete and effective security management to the organization's network.
Reasonable breadth-biased: A algorithms
Authors: Raymond D. Gumb
Venue: Issue 78 (October 1981) (1981)

A+ algorithms are A algorithms (as studied by Nilsson) satisfying two additional constraints which magnify the breadth aspect of a graph search. Use of A+ algorithms is perhaps most plausible when it is desirable to generate alternative goal nodes on optimal paths. There are two principal results for A+ algorithms. First, if A1 and A2 are A+ algorithms and A2 is as well informed as A1 then A2 expands no more nodes than A1 does. Second, if an A+ algorithm is modified so as to return a set of optimal paths and the monotone condition is satisfied, the A+ algorithm returns a set of solutions consisting of an optimal path to each goal node on an optimal path.
Fradkov theorem-based design of the control of nonlinear systems with functional and parametric uncertainties
Authors: A. A. Bobtsov, N. A. Nikolaev
Venue: Automation and Remote Control (2005)

Consideration was given to the control by measurements of the output of nonlinear systems with unknown functional and parametric uncertainties. On the basis of the A.L. Fradkov theorem on passification of linear systems, an approach to the design of the control law that stabilizes the system output was proposed. The theoretical results were illustrated by an example and the results of computer modeling.
A design notation for mobile collaborative mixed systems
Authors: Philippe Renevier, Laurence Nigay
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Real needs of mobile users working in groups can be addressed by Mobile Collaborative Mixed Systems. But the design of such systems is a complex task due to the variety of design parameters. For example the characterization of the usage context is difficult because of the mobility of the users as well as the different types of collaboration amongst them. In this paper we present a characterization space and a notation as useful tools for the design of Mobile Collaborative Mixed Systems. Our two contributions are placed within a scenario based design process.