ppxscal/embedding_network huggingface dataset:
Modeling Molecular Computing Systems by an Artificial Chemistry---Its Expressive Power and Application
Authors: Kazuto Tominaga, Tooru Watanabe, Keiji Kobayashi, Masaki Nakamura, Koji Kishi, Mitsuyoshi Kazuno
Venue: Artificial Life (2007)

Artificial chemistries are mainly used to construct virtual systems that are expected to show behavior similar to living systems. In this study, we explore possibilities of applying an artificial chemistry to modeling natural biochemical systems---or, to be specific, molecular computing systems---and show that it may be a useful modeling tool for molecular computation. We previously proposed an artificial chemistry based on string pattern matching and recombination. This article first demonstrates that this artificial chemistry is computationally universal if it has only rules that have one reactant or two reactants. We think this is a good property of an artificial chemistry that models molecular computing, because natural elementary chemical reactions, on which molecular computing is based, are mostly unimolecular or bimolecular. Then we give two illustrative example models for DNA computing in our artificial chemistry: one is for the type of computation called the Adleman-Lipton paradigm, and the other is for a DNA implementation of a finite automaton. Through the construction of these models we observe preferred properties of the artificial chemistry for modeling molecular computing, such as having no spatial structure and being flexible in choosing levels of abstraction.
Assurance Based Development of Critical Systems
Authors: Patrick J. Graydon, John C. Knight, Elisabeth A. Strunk
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Assurance Based Development (ABD) is the synergistic construction of a critical computing system and an assurance case that sets out the dependability claims for the system and argues that the available evidence justifies those claims. Co-developing the system and its assurance case helps software developers to make technology choices that address the specific dependability goal of each component. This approach gives developers: (1) confidence that the technologies selected will support the system's dependability goal and (2) flexibility to deploy expensive technology, such as formal verification, only on components whose assurance needs demand it. ABD simplifies the detection-- and thereby avoidance--of potential assurance difficulties as they arise, rather than after development is complete. In this paper, we present ABD together with a case study of its use.
A New Tag Scheme and Its Tree Representation for a Shuffle-Exchange Network
Authors: Tse-yun Feng, Yanggon Kim
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper introduces a new tag scheme having a flexibility and a bidirectionality for an N × N k-stage shuffle-exchange network where k \ge log_2 N. Based on the interstage correlations for a path, the EB-tag generating rules are presented. In addition, an elegant and simple graphical representation called a N-leaf Dual Complete Binary tree (N-leaf DCB-tree) for a given permutation is proposed and its characteristics are discussed. Then the universal necessary condition for a conflict-free connection pattern is given. Due to this condition, the conflict-free routing problem can be transformed to the perfect assignment problem.
OS verification: now!
Authors: Harvey Tuch, Gerwin Klein, Gernot Heiser
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Hard, machine-supported formal verification of software is at a turning point. Recent years have seen theorem proving tools maturing with a number of successful, real-life applications. At the same time, small high-performance OS kernels, which can drastically reduce the size of the trusted computing base, have become more popular. We argue that the combination of those two trends makes it feasible, and desirable, to formally verify production-quality operating systems -- now.
A wavelet transform method for coding film-grain noise corrupted images
Authors: R. Oktem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We propose an algorithm for compressing images corrupted by film-grain type noise. The algorithm nonlinearly modifies the transform coefficients of noisy data for reducing the impact of noise on compression. Although any orthogonal transform is suitable for the application, the orthogonal wavelet transform is preferred for simplicity in calculating the filter coefficients and for obtaining better compression performance. The algorithm is tested on different images at different noise variances and the results are compared to spatial filtering before compression. Our method outperforms spatial prefiltering in terms of PSNR values and it is easier to implement.
Tractability and learnability arising from algebras with few subpowers
Authors: Pawel Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

A k-edge operation \varphi on a finite set A is a k + 1-ary operation that satisfies the identities\begin{gathered} \varphi (x,x,y,...,y) \approx \varphi (x,y,x,y,...,y) \approx y, \hfill \\ \varphi (y,y,y,x,y,...,y) \approx \varphi (y,y,y,y,x,y,...,y) \approx ... \hfill \\ ... \approx \varphi (y,y,y,...,y,x) \approx y. \hfill \\\end{gathered} We prove that any constraint language .. that, for some k \ge 1, has a k-edge operation as a polymorphism is globally tractable. We also show that the set of relations definable over .. using quantified generalized formulas is polynomially exactly learnable using improper equivalence queries. Special instances of k-edge operations are Mal'cev and near-unanimity operations and so this class of constraint languages includes many well known examples.
Automatic, run-time and dynamic adaptation of distributed applications executing in virtual environments
Authors: Peter A. Dinda
Venue:  (2006)

In the last decade we have seen tremendous increases in computer and network speeds and performance, resulting in the emergence of wide-area distributed computing. However, its potential has not been realized, primarily due to lack of security and isolation, provisioning issues and challenges involved in developing distributed applications.We present the design, implementation and evaluation of a virtual distributed execution environment consisting of operating system level virtual machines connected by virtual networks. Such environments make possible low-level, application-, developer-, and user-independent adaptation mechanisms such as virtual machine migration, overlay topology configuration and routing, network and CPU reservations. This dissertation argues that automatic, run-time and dynamic adaptation in these environments is the key to addressing issues in traditional distributed computing. In particular, it presents the answer to the question, is there a single adaptation scheme that exploits these mechanisms and is effective for a range of distributed applications.I formalized the adaptation problem and characterized its complexity and hardness of approximation. We found the problem to be NP-hard and hard to approximate. In response to these results, I designed and implemented fifteen variations of greedy adaptation schemes that heuristically attempt to optimize objective functions. I designed these adaptation schemes using insights gained while studying three classes of distributed applications and evaluated them in the context of a different set of seven application classes. I found that a single adaptation scheme that does a variation of load balancing to determine migration of virtual machines and attempts to optimize a function that is a combination of latency and bandwidth for pairs of communicating virtual machines to be effective for 70% of application classes studied. I present two taxonomies for distributed applications based on their resource demands and their suitability to automatic adaptation driven by my suggested adaptation scheme.This work fills an important gap in distributed systems research by providing an automatic, run-time and dynamic adaptation scheme that leverages the powerful paradigm of virtualization and is effective for a range of unmodified distributed applications running on unmodified operating systems without requiring any developer interaction.
Negotiating contracts in multiagent societies
Authors: Sandip Sen
Venue:  (2006)

In agent-based applications in electronic commerce and other information systems, agents, representing real-life negotiating parties, negotiate resources and services with other agents or humans. Self-interested software agents, often with conflicting preferences, can negotiate mutually acceptable agreements. In this dissertation, we focus on the following major aspects of such automated negotiations: negotiation frameworks, negotiation strategies, effects of social context and agent attitudes on negotiation outcomes. Additionally, we discuss an agent architecture for effectively using arguments for negotiation and study an automated supply chain as an example application of automated contracting. The primary contributions of this dissertation are the following: (i) the development of efficient frameworks for multi-issue negotiation with divisible and indivisible issues, (ii) the design of a negotiation strategy that models opponent's preferences in repeated negotiations to improve individual utility of the agent, (iii) the analysis of the performance of multiple negotiation strategies under different negotiation environments and their evolution in a society of adaptive agents, and, (iv) the development of an architecture and a decision theoretic framework for argumentation-based negotiations. We have also designed an efficient scheduling and pricing strategy for a supplier in a dynamic electronic supply chain, an application of automated contracting, where contracts are awarded via an auction-based negotiation protocol.
The Effect of Sound on Haptic Perception
Authors: Seung-Chan Kim, Ki-Uk Kyung, Dong-Soo Kwon
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Research on the intermodality relationship of auditory and tactile perceptions was conducted. An experiment is performed with 78(26 auditory cues × 3 tactile cues) stimuli combinations. The result of this experiment showed that the sound intensity level definitely affects perceived sensation in three ways: 1) The perceived roughness and ruggedness sensation is more innervated when the specific frequency is enhanced, e.g. approximately 30Hz~300Hz for ruggedness and 30Hz~600Hz for roughness sensation; 2) Conversely, the perceived density is reciprocally affected by an intensity adjustment of the sound; 3) A frequency adjustment of the sound can elicit a perceived roughness if even no stimuli are conveyed to subjects. In general, the importance of congruency between modalities was observed.
Structured Data Access Mechanisms for a Decoupled Computer Architecture
Authors: Ali Berrached, Paul T. Hulina, Lee D. Coraor
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Decoupled computer architectures attempt to achieve superscalar performance by exploiting the fine-grain parallelism between the data access and data execute tasks of a computer program. In this paper, we examine the major bottlenecks in the performance of decoupled architectures. These consist of the load unbalance between the access and execute processors, the limited access processor's instruction issue rate, and the memory bandwidth. We introduce a decoupled architecture that (1) eliminates the access processor's instruction issue bottleneck by reducing the number of data access instructions, and (2) reduces the effects of the memory bandwidth by allowing better data prefetching. The architecture employs special data access mechanisms that take advantage of the regularity of structure data's storage.
Interactive Visual Analysis of a Timing Chain Drive Using Segmented Curve View and other Coordinated Views
Authors: Zoltan Konyha, Kresimir Matkovic, Denis Gracanin, Mario Duras
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

A timing chain drive transfers motion from the engine's crankshaft to the camshaft that operates the valves. The design process of timing chain drives involves computer simulation of many design variants in order to find an optimum. Most of the simulation results can be represented as families of function graphs (data series). Previously, the analysis of those results was based on static 2D diagrams and animated 3D visualizations. They were suitable for the detailed analysis of a few simulation variants, but not for the comparison of many cases. In this paper we propose a new approach to the analysis based on coordinated linked views and advanced brushing features. Our proposed method supports the interactive analysis of many design variants. We introduce a novel view, called segmented curve view, which can display distributions in families of function graphs. The segmented curve view combines individual function graphs where for a fixed value of the independent variable, a bar extends from minimum to maximum values across the family of function graphs. Each bar is divided into segments (bins) with a color that represents the number of function graphs with the value in that segment. In the case study, we demonstrate that the new view combined with "traditional" views provides a strong support for the interactive visual exploration and analysis of a real world timing chain design problem.
Integrated Management of Distributed Packet Filter Configurations in Carrier-Grade IP Networks
Authors: Birger Todtmann, Erwin P. Rathgeb
Venue: Proceedings of the Sixth International Conference on Networking (2007)

With the trend towards "Triple Play" and "Next Generation Network" technologies running on IP-based multi-service networks, operators have to maintain increasingly complex IP management architectures which need tight protection as their in-band signaling and control protocols are inherently susceptible to attacks from outsiders. Operators therefore need an efficient management of local security functions distributed among network components that enforce a coherent global network security policy. In this paper, a flexible and scalable approach for the management of distributed packet filters in IP-based multi-vendor networks is presented that allows the operator to incorporate filter capability restrictions within nodes and the trade-off between operational risk and attack risk into their management decisions.
Free Speech and Child Protection on the Web
Authors: Daniel J. Weitzner
Venue: IEEE Internet Computing (2007)

Since the Web first became widely used regulating its content according to a single substantive standard has been impossible. Instead, diversity and decentralization rule. To protect children or anyone else from content regarded as inappropriate or harmful, we must find user-centered alternatives that leverage the Web's decentralized social organization.
Running "Linux today"
Authors: Dave Whitinger
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Linux Today is a website whose function is to provide news and editorials to the Linux community in a timely fashion. The necessity to update the website hundreds of times per day, as well as handle the load of hundreds of thousands of hits per day, has introduced some interesting challenges to be overcome. This presentation will detail exactly how we've overcome these problems. The member of the audience should walk away with a clear understanding of one of the ways that one may run a highly trafficked and dynamic website.
Low bit rate high quality audio coding with combined harmonic and wavelet representations
Authors: K. N. Hamdy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We describe a novel high quality audio coding method using adaptive signal representation, based on sinusoidal and wavelet analysis of signals. First, we perform a harmonic analysis of the signal to remove strong periodic structures or tones from the signal. Then we carry out wavelet analysis that are useful in tracking the transients of the signal. These transients are then removed from the wavelet coefficients. The remaining coefficients have broadband noise-like structure. Since this method separates out tones (sinusoids), transients, and broadband noise, we may use tonal, noise, and temporal masking information to individually encode the tones and the wavelet coefficients. Our experiments suggest that this method yields a nominal bit rate of 1 bit/sample for high quality audio compression.
Autonomic Wireless Networks in Smart Environments
Authors: Antonio A. F. Loureiro, Linnyer B. Ruiz
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Autonomic Computing defines computational systems that are able to manage themselves with none or minimal human intervention. The concepts related to autonomic computing in computer networks leads to the development of a new concept: autonomic networks. This kind of network is able to perform self-management of its elements and data communication links. Smart environments represent the next evolutionary development step in building, utilities, industrial, home, shipboard, and transportation systems automation. In those scenarios, wireless transmission is complex and often problematic, where a number of conditions such as multipath interference, transmission collisions, and obstructions adversely impact the reliability, scalability and data throughput of high bandwidth communications. This tutorial will present a perspective on autonomic wireless networks to be employed in the scenarios described above. The goal is to present the main characteristics of protocols, applications and services for those scenarios and how autonomic wireless networks can help in the design process.
Improved topic-dependent language modeling using information retrieval techniques
Authors: M. Mahajan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

N-gram language models are frequently used by the speech recognition systems to constrain and guide the search. N-gram models use only the last N-1 words to predict the next word. Typical values of N that are used range from 2-4. N-gram language models thus lack the long-term context information. We show that the predictive power of the N-gram language models can be improved by using long-term context information about the topic of discussion. We use information retrieval techniques to generalize the available context information for topic-dependent language modeling. We demonstrate the effectiveness of this technique by performing experiments on the Wall Street Journal text corpus, which is a relatively difficult task for topic-dependent language modeling since the text is relatively homogeneous. The proposed method can reduce the perplexity of the baseline language model by 37%, indicating the predictive power of the topic-dependent language model.
Checkpoint and Recovery for Parallel Applications with Dynamic Number of Processes
Authors: Nam Thoai, Doan Viet Hung
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

This paper presents a checkpoint and recovery (C&R) protocol to support fault-tolerance for PVM (Parallel Virtual Machine). The protocol helps to mask fail-stop failures from an application. The Camp;R activities are transparent and do not require any change in the PVM library nor operating system. In PVM, an application can change the number of processes during execution. This paper focuses on solving problems raised by the dynamic spawn and the asynchronous exit of tasks in PVM. The proposed protocol is a non-blocking one, so it reduces side-effect of checkpoint activities of original programs.
Design and implementation of modular key management protocol and IP secure tunnel on AIX
Authors: Pau-Chen Cheng, Juan A. Garay, Amir Herzberg, Hugo Krawczyk
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

This paper presents the design principles, architecture, implementation and performance of our modular key management protocol (MKMP) and an IP secure tunnel protocol (IPST) which protects the secrecy and integrity of IP datagrams using cryptographic functions. To use the existing IP infrastructure, MKMP is built on top of UDP and the IPST protocol is built by encapsulating IP datagrams.
Hybrid global-local indexing for effcient peer-to-peer information retrieval
Authors: Chunqiang Tang, Sandhya Dwarkadas
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Content-based full-text search still remains a particularly challenging problem in peer-to-peer (P2P) systems. Traditionally, there have been two index partitioning structures--partitioning based on the document space or partitioning based on keywords. The former requires search of every node in the system to answer a query whereas the latter transmits a large amount of data when processing multi-term queries. In this paper, we propose eSearch--a P2P keyword search system based on a novel hybrid indexing structure. In eSearch, each node is responsible for certain terms. Given a document, eSearch uses a modern information retrieval algorithm to select a small number of top (important) terms in the document and publishes the complete term list for the document to nodes responsible for those top terms. This selective replication of term lists allows a multi-term query to proceed local to the nodes responsible for query terms. We also propose automatic query expansion to alleviate the degradation of quality of search results due to the selective replication, overlay source multicast to reduce the cost of disseminating term lists, and techniques to balance term list distribution across nodes. eSearch is scalable and efficient, and obtains search results as good as state-of-the-art centralized systems. Despite the use of replication, eSearch actually consumes less bandwidth than systems based on keyword partitioning when publishing metadata for a document. During a retrieval operation, it searches only a small number of nodes and typically transmits a small amount of data (3.3KB) that is independent of the size of the corpus and grows slowly (logarithmically) with the number of nodes in the system. eSearch's efficiency comes at a modest storage cost, 6.8 times that of systems based on keyword partitioning. This cost can be further reduced by adopting index compression or pruning techniques.
Improved knock detection by time variant filtered structure-borne sound
Authors: S. Carstens-Behrens
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In order to detect knock in spark plug engines generally structure-borne sound signals measured by acceleration sensors mounted on the engine housing are used. In test bed engines additional pressure sensors measuring the pressure inside the combustion chamber deliver a reference signal to adjust the parameters of knock detection based on the sound signal. We show by experimental results that the approximation of pressure signals by time variant filtering of structure-borne sound increases the performance of knock detection significantly. These results can be regarded as an upper boundary of what can be achieved by knock detectors with less computational load.