ppxscal/embedding_network huggingface dataset:
Detection and resolution of inconsistencies among distributed replicates of files
Authors: Pearl Brereton
Venue: ACM SIGOPS Operating Systems Review (1983)

If file replication is used as a means of improving file availability problems of mutual consistency arise when the network which connects copies is subject to partitioning. A method of detecting inconsistencies is presented and the problems associated with automatic resolution of conflicts are outlined.
Modeling superposition of ON-OFF correlated traffic sources in multimedia applications
Authors: A. La Corte, A. Lombardo, G. Schembra
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

In this paper a multimedia source is modeled as an arrival process defined as the superposition of heterogeneous correlated arrival processes, each of which models one monomedia source. To this purpose each monomedia source is modeled as an ON-OFF process where the transition rates are functions of the states of the other monomedia sources. Auto- and cross-correlation functions are derived for each monomedia source. The analytical model is used to develop results for single media performance in a multimedia multiplexer structure.
Structured use of external knowledge for event-based open domain question answering
Authors: Hui Yang, Tat-Seng Chua, Shuguang Wang, Chun-Keat Koh
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcome this problem, our earlier work integrates external knowledge extracted from the Web and WordNet to perform Event-based QA on the TREC-11 task. This paper extends our approach to perform event-based QA by uncovering the structure within the external knowledge. The knowledge structure loosely models different facets of QA events, and is used in conjunction with successive constraint relaxation algorithm to achieve effective QA. Our results obtained on TREC-11 QA corpus indicate that the new approach is more effective and able to attain a confidence-weighted score of above 80%.
Indefinite Stochastic Linear Quadratic Control with Markovian Jumps in Infinite Time Horizon
Authors: Xun Li, Xun Yu Zhou, Mustapha Ait Rami
Venue: Journal of Global Optimization (2003)

This paper studies a stochastic linear quadratic (LQ) control problem in the infinite time horizon with Markovian jumps in parameter values. In contrast to the deterministic case, the cost weighting matrices of the state and control are allowed to be indinifite here. When the generator matrix of the jump process &ndash; which is assumed to be a Markov chain &ndash; is known and time-invariant, the well-posedness of the indefinite stochastic LQ problem is shown to be equivalent to the solvability of a system of coupled generalized algebraic Riccati equations (CGAREs) that involves equality and inequality constraints. To analyze the CGAREs, linear matrix inequalities (LMIs) are utilized, and the equivalence between the feasibility of the LMIs and the solvability of the CGAREs is established. Finally, an LMI-based algorithm is devised to slove the CGAREs via a semidefinite programming, and numerical results are presented to illustrate the proposed algorithm.
Mobile IP Registration Protocol: A Security Attack and New Secure Minimal Public-Key Based Authentication
Authors: Sufatrio, Kwok Yan Lam
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The ubiquity of the Internet and explosive growth in wireless networking in recent years increasingly urge the demand to support mobility within the Internet, which is what Mobile IP aims to provide. This paper is concerned with the security aspect of the registration protocol in Mobile IP. In this paper, we show that despite the use of authenticated registration messages and replay protection, the current registration protocol suffers from a possible replay attack. The paper also analyzes a proposed extension of Mobile IP that aims to provide public-key based authentication. We show some drawbacks in its protocol design and then propose our own new secure authentication protocol that employs only minimal use of public key cryptography. Despite its practicality, our new protocol provides a scalable solution for authentication and non-repudiation, while sets only minimal computing and administration cost on the Mobile Node.
The Effects of Integration on R D Incentives in Systems Markets
Authors: Jay Pil Choi, Gwanghoon Lee, Christodoulos Stefanadis
Venue: Netnomics (2003)

We consider a systems market where two complementary components must be used in combination to provide valuable services. The market for the first component is monopolized whereas the market for the second is potentially served by multiple firms. We show that integration of the monopolist into the competitive complementary market may distort incentives for R D, reducing total economic welfare.
A selection-mutation model for q-learning in multi-agent systems
Authors: Karl Tuyls, Katja Verbeeck, Tom Lenaerts
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The feedback an agent experiences in a MAS, is usually influenced by the other agents present in the system. Multi agent environments are therefore non-stationary and convergence and optimality guarantees of RL algorithms are lost. To better understand the dynamics of traditional RL algorithms we analyze the learning process in terms of evolutionary dynamics. More specifically we show how the Replicator Dynamics (RD) can be used as a model for Q-learning in games. The dynamical equations of Q-learning are derived and illustrated by some well chosen experiments. Both reveal an interesting connection between the exploitation-exploration scheme from RL and the selection-mutation mechanisms from evolutionary game theory.
Discovery of infrastructure in multi-agent systems
Authors: Brent K. Langley, Massimo Paolucci, Katia Sycara
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents are expected to use the MAS infrastructure in their interaction, but no work has been done on how agents learn of the sorrounding infrastructure. In this paper, we describe a discovery mechanism, that allows agents to rapidly track the changes in the infrastructure of their local networks in order to maintain a consistently high level of interoperation with other agents. In addition, we show how the discovery protocols can be extended over the Internet through a Peer-to-Peer connectivity model based on the Gnutella architecture to create Agent-to-Agent (A2A) communities.
Cuypers: a semi-automatic hypermedia generation system
Authors: J. R. Ossenbruggen, F. J. Cornelissen, J. P.T.M. Geurts, L. W. Rutledge, Lynda Hardman
Venue:  (2000)

The report describes the architecture of \emph{Cuypers}, a system supporting second and third generation Web-based multimedia. First generation Web-content encodes information in handwritten (HTML) Web pages. Second generation Web content generates HTML pages on demand, e.g. by filling in templates with content retrieved dynamically from a database or transformation of structured documents using style sheets (e.g. XSLT). Third generation Web pages will make use of rich markup (e.g. XML) along with metadata (e.g. RDF) schemes to make the content not only machine readable but also machine processable --- a necessary pre-requisite to the \emph{Semantic Web}. While text-based content on the Web is already rapidly approaching the third generation, multimedia content is still trying to catch up with second generation techniques. Multimedia document processing has a number of fundamentally different requirements from text which make it more difficult to incorporate within the document processing chain. In particular, multimedia transformation uses different document and presentation abstractions, its formatting rules cannot be based on text-flow, it requires feedback from the formatting back-end and is hard to describe in the functional style of current style languages. We state the requirements for second generation processing of multimedia and describe how these have been incorporated in our prototype multimedia document transformation environment, \emph{Cuypers}. The system overcomes a number of the restrictions of the text-flow based tool sets by integrating a number of conceptually distinct processing steps in a single runtime execution environment. We describe the need for these different processing steps and describe them in turn (semantic structure, communicative device, qualitative constraints, quantitative constraints, final form presentation), and illustrate our approach by means of an example. We conclude by discussing the models and techniques required for the creation of third generation multimedia content.
RICA: A Receiver-Initiated Approach for Channel-Adaptive On-Demand Routing in Ad Hoc Mobile Computing Networks
Authors: Xiao-Hui Lin, Yu-Kwong Kwok, Vincent K. N. Lau
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

To support truly peer-to-peer applications in ad hoc wireless mobile computing networks, a judicious and efficient ad hoc routing protocol is needed. Much research has been done ondesigning ad hoc routing protocols and some well known protocols are also being implemented in practical situations. However, one major drawback in existing state-of-the-art protocols, such as the AODV (ad hoc on demand distance vector) routing protocol, is that the time-varying nature of the wireless channels among the mobile terminals is ignored, let alone exploited. This can be a severe design shortcoming because the varying channel quality can lead to very poor overall route quality, in turn result in low data throughput. In this paper, by using a previously proposed adaptive channel coding and modulation scheme which allows amobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated, we devise a new receiver-initiated algorithm for ad hoc routing that dynamically changes the routes according to the channel conditions. Extensive simulation results indicate that our proposed protocol are more efficient in that shorter delays and higher rates are achieved.
On the Construction of Multiple-Valued Decision Diagrams
Authors: D. Michael Miller, Rolf Drechsler
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-valued decisions diagrams (MDD). Efficiency is achieved through the use of a simple computed table. We compare the use of recursive MIN and MAX as primitive operations in multiple-valued decision diagram construction to the MV-CASE primitive which is a generalization of the if-then-else (ITE) commonly used in binary DD packages. We also consider the use of cyclic negations and complements as MDD edge operations showing that for certain types of functions this approach can lead to significant reduction in MDD node count. They can also reduce the number of primitives that need to be explicitly implemented. Experimental results showing the efficiency of the proposed approaches are given. The direct implementation of MDDs is briefly compared to representing MDDs using a BDD package.
Simulating turn-taking behaviours with coupled dynamical recognizers
Authors: Hiroyuki Iizuka, Takashi Ikegami
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A coupled dynamical recognizer is proposed as a model for simulating turn-taking behaviour. An agent is modelled as a mobile robot with two wheels. A recurrent neural network is used to produce the motor outputs. By controlling this, agents compete to take turns on a two dimensional arena.There are two novel aspects to the present study. First, a dynamical recognizer is not only used for producing motor outputs but also to predict the other agent's behaviour. Second, unlike a mere chasing game, turn-taking behaviour is established only when each agent automatically switches from chaser to evader and vice versa.By using the genetic algorithm technique, we show that turn-taking behaviour is developed between two agents. It is worth noting that turn-taking is established only when an agent fails to predict the other agent's behaviour. In other words, the simultaneous generation of stable (predictable) and unstable (unpredictable) dynamics is inevitable to lead to successive turn-taking behaviour. A relationship between joint attention and prediction will be discussed from this and other related works.
Distributed Diners: From UNITY Specification to CC++ Implementation
Authors: Ulla Binau
Venue:  (1993)

Resource conflicts may typically be described as the dining philosophers problem (or diners for short). In this report we derive a distributed message-passing solution to the diners problem from the shared memory solution presented in [CM88, Ch.12 Dining Philosophers]. We define an isomorphism between variables in the shared memory state and variables in the distributed state. This allows us to translate the shared memory UNITY specification to a distributed UNITY specification without affecting the validity of the original refinement proof. It turns out that the translated progress properties cannot be fulfilled by the solution scheme we have in mind. However, we show that weaker properties may be used instead, still without affecting the correctness of the original proof. The derivation of a UNITY program from the translated properties is not quite obvious. Hence we introduce an extra refinement step prior to deriving our distributed UNITY implementation. Finally the distributed UNITY implementation is translated to Compositional C++, (CC++) a parallel extension of C and C++. Note: The reader is assumed to be familiar with UNITY [CM88] and C, C++ or CC++ [KR88, Str91, CK92].
First Harmonic (2f) Characterisation of Resonant Frequency and Q-Factor of Micromechanical Transducers
Authors: V. J. Logeeswaran, F. E. H. Tay, M. L. Chan, F. S. Chau, Y. C. Liang
Venue: Analog Integrated Circuits and Signal Processing (2003)

In this paper, the response to the first harmonic component (2f) of the electrostatic force in single terminal driven electrostatic comb-drive and parallel-plate drive was used as a signal to extract device parameters, namely, the Q-factor and resonant frequency instead of the fundamental (1f) resonance response. It is shown that the difficulty in motional measurement due to electrical cross-talk (parasitics) using 1f measurement can be overcome with a higher signal-to-noise ratio of the 2f signal. Both atmospheric (low-Q) and reduced pressure environment were investigated using off-chip electronics and lock-in amplifier. The measurements were done on the electrostatic comb-drive and capacitive parallel plate sensing plates that form the two core modules of a yaw rate sensor (dual-axis resonator). The effects of AC and DC bias voltages on the measured response have been investigated. Experimental amplitude and phase response data have been analysed using the Lorentzian curve-fit, Resonance Curve Area (RCA) method, the half-power bandwidth method (3 dB) and the Nyquist plot for data fitting and determination of the Q-factor and resonance frequency.
DartFlow: A Workflow Management System on the Web using Transportable Agents
Authors: Ting Cai, Peter A. Gloor, Saurab Nog
Venue:  (1996)

Workflow management systems help streamline business processes and increase productivity. This paper describes the design and implementation of the DartFlow workflow management system. DartFlow uses Web-browser embedded Java applets as its front end and transportable agents as the backbone. While Java applets provide a safe and platform independent GUI, the use of transportable agents makes DartFlow highly flexible and scalable. This paper describes the design and implementation of DartFlow, as well as a workflow application that exploits DartFlow''s agent-based design.
Generalized FFTS - A Survey of Some Recent Results
Authors: David K. Maslen, Daniel N. Rockmore
Venue:  (1996)

In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting the classical FFT can be viewed as a family of efficient algorithms for computing the Fourier transform of either a function defined on a finite abelian group, or a bandlimited function on a compact abelian group. We discuss generalizations of the FFT to arbitrary finite groups and compact Lie groups.
Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects
Authors: Peter G. Bishop, Robin E. Bloomfield
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

In this paper we extend an earlier worst case boundreliability theory to derive a worst case reliabilityfunction R(t), which gives the worst case probability ofsurviving a further time t given an estimate of residualdefects in the software N and a prior test time T.The earlier theory and its extension are presented andthe paper also considers the case where there is a lowprobability of any defect existing in the program. For the"fractional defect" case, there can be a high probabilityof surviving any subsequent time t. The implications ofthe theory are discussed and compared with alternativereliability models.Keywords: reliability prediction, reliability testing, worstcase reliability bound, residual fault prediction.
Avoiding Conflicts Dynamically in Direct Mapped Caches with Minimal Hardware Support
Authors: Peter N. DeSantis
Venue:  (1998)

The memory system is often the weakest link in the performance of today''s computers. Cache design has received increasing attention in recent years as increases in CPU performance continues to outpace decreases in memory latency. Bershad et al. proposed a hardware modification called the Cache Miss Lookaside buffer which attempts to dynamically identify data which is conflicting in the cache and remap pages to avoid future conflicts. In a follow-up paper, Bershad et al. tried to modify this idea to work with standard hardware but had less success than with their dedicated hardware. In this thesis, we focus on a modification of these ideas, using less complicated hardware and focusing more on sampling policies. The hardware support is reduced to a buffer of recent cache misses and a cache miss counter. Because determination of remapping candidates is moved to software, sampling policies are studied to reduce overhead which will most likely fall on the OS. Our results show that sampling can be highly effective in identifying conflicts that should be remapped. Finally, we show that the theoretical performance of such a system can compare favorably with more costly higher associativity caches. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Implication of Embedded Linux in Japanese Embedded Industries
Authors: Tatsuo Nakajima
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

In this short article, we introduce Japan Embedded Linux Consortium. Then, we show the impact of ubiquitous computing researches to embedded system industries, and show a brief overview of our research activities.
A Deliberative and Reactive Diagnosis Agent based on Logic Programming
Authors: Michael Schroeder, Iara de Almeida Mora, Luis Moniz Pereirat
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We briefly overview the architecture of a diagnosis agent. We employ logic and logic programming to specify and implement the agent: the knowledge base uses extended logic programming to specify the agent's behavior and its knowledge about the system to be diagnosed. The inference machine which provides algorithms to compute diagnoses as well as the reactive layer that realizes a meta interpreter for the agent behavior are implemented in PVM-Prolog that enhances standard Prolog by message passing facilities.
ICECCS'97 Industrial Track process improvement experiments
Authors: J. Bacquet, F. Primatesta
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Today, approximately 70% of all software developed in Europe is produced in the non-IT sectors of the economy. This makes software a key topic for the whole European industry, with strategic significance for global competitiveness. Furthermore, as the information age develops, software is destined to become even more pervasive and transparent across industrial sectors and user segments. The growing dependence of modern industry upon software products has been accompanied by the acceptance of software development into the elite of strategic business management issues. The efficiency and the quality with which software is produced is having a greater and greater impact on the profitability of the companies and on their ability to meet customer needs. Industrial success is now increasingly linked to an organisation's ability to produce software efficiently with consistently high quality. It is within this context, that ESSI (European System and Software Initiative) is supporting a set of preparatory, support and transfer activities, applied to the software technology domain of ESPRIT. These activities are concerned with the adoption of best practice in organisations working in any economic sector (both IT and non-IT sectors), which have software development capabilities and which regard software as an important aspect of their business. Any organisation in any sector involved in writing software may benefit from the adoption of best practice.
New Logical and Complexity Results for Signed-SAT
Authors: Carlos Ansótegui, Felip Manyà
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We define Mv-formulas as the union of the subclassesof signed CNF formulas known as regular and monosignedCNF formulas, and then define resolution calculi that arerefutation complete for Mv-formulas and give new complexityresults for the Horn-SAT and 2-SAT problems. Ourgoal is to use Mv-formulas as a constraint programminglanguage between CSP and SAT, and solve computationallydifficult combinatorial problems with efficient satisfiabilitysolvers for Mv-formulas. The results presented in this paperprovide evidence that Mv-formulas are a problem modelinglanguage that offers a good compromise between complexityand expressive power.