ppxscal/embedding_network huggingface dataset:
Agent System Development Method Based on Agent Patterns
Authors: Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper proposes a method of agent system development based on agent patterns that represent typical and recurring structures and behaviors of agents. The agent patterns are classified according to their appropriate architectural levels and the degree of their dependence on specific agent platforms. Our method enables developers to design agent systems efficiently since they can construct complicated system architectures and behaviors by dividing the design process into two architectural levels and applying the appropriate agent patterns. In addition, the higher level designs are independent of specific agent platforms and can be therefore easily reused.
Security Server Incorporating Relay Servers for Distributed Processing Environments
Authors: Miyuki Imada, Ichizou Kogiku
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

A method is proposed that use a security server to assure more secure communication without degrading the performance on the Distributed Object-oriented Network Architecture in the Distributed Processing Environment (DONA-DPE). Security in communications is enhanced when the number of communication exchanges is minimized. To accomplish this, in the proposed model the security server incorporates within itself relay servers such as search engines. The model's effectiveness is discussed using sample applications: a search of its performance is discussed.
The epistemics of encryption
Authors: Annette M. Bleeker, D. J Eijck
Venue:  (2000)

Message passing by means of public key encryption is described in terms of doxastic dynamic logic. A secret message from $a$ to $b$ can have as effect that $b$ learns something new from $a$, but it can also cause a change in the real world, when the contents of the message forces $b$ to cease trusting $a$. As a tool for analysing secret message passing (and much else besides) we develop a framework that allows changes of states conditioned by beliefs about those states.
Towards automation of checklist-based code-reviews
Authors: F. Belli, R. Crisan
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Different types of code-reviews (Fagan-style code-inspections, Parnas-like active design reviews and walkthroughs) have been found to be very useful in improving the quality of software. In many cases reviewers use checklists to guide their analysis during review sessions. However, valuable, checklist-based code-reviews have the principal shortcoming of their high costs due to lack of supporting tools enabling at least partial automation of typical multiple appearing rules. This paper describes an approach towards semi-automation of some steps of individual review processes based on checklists. The method proposed is interactive, i.e. reviewers will be enabled to actualize, extend, and check the consistency and redundancy of their checklists. The basic idea underlying the approach is the usage of a rule-based system, adapting concepts of the compiler theory and knowledge engineering, for acquisition and representation of knowledge about the program. Redundant and conflicting knowledge about the program under study is recognized and solved by means of an embedded truth maintenance system. As a result of fault diagnosis, rules for fault classification are used. Software reliability models are applied to validate the results of each review session. The approach has shown promising preliminary results in analyses of conventional C-programs developed in the automotive industry.
Early termination over small fields
Authors: Wayne Eberly
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Krylov-based algorithms have recently been used (alone, or in combination with other methods) in order to solve systems of linear equations that arise during integer factorization and discrete logarithm computations. Since these include systems over small finite fields, the behaviour of these algorithms in this setting is of interest.Unfortunately, the application of these methods is complicated by the possibility of several kinds of breakdown. Orthogonal vectors can arise when a variant of the Lanczos algorithm is used to generate a basis, and zero-discrepancies can arise during the computation of minimal polynomials of linearly recurrent sequences when Wiedemann's algorithm is applied.Several years ago, Austin Lobo reported experimental evidence that zero-discrepancies are extremely unlikely when a randomized version of Wiedemann's algorithm is applied to solve systems over large fields. With high probability, results are correct if a computation is terminated as soon as such a sequence is detected. "Early termination" has consequently been included in recent implementations.In this paper, we analyze the probability of long sequences of zero-discrepancies during computations of minimal polynomials of the linearly recurrent sequences that arise when simple Krylov-based algorithms are used to solve systems over very small finite fields. Variations of these algorithms that incorporate early termination are briefly presented and analyzed in the small field case.
Evaluating the Effectiveness of a Software Fault-Tolerance Technique on RISC- and CISC-Based Architectures
Authors: M. Rebaudengo, M. Sonza Reorda, M. Violante, P. Cheynet, B. Nicolescu, R. Velazco
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper deals with a method able to provide a mi-coprocessor-based system with safety capabilities by modifying the source code of the executed application, only. The method exploits a set of transformations, which can automatically be applied, thus greatly reducing the cost of designing a safe system, and increasing the confidence in its correctness. Fault Injection experiments have been performed on a sample application using two different systems based on CISC and RISC processors. Results demonstrate that the method effectiveness is rather independent on the adopted platform.
Resolving Ambiguity in Nonmonotonic Reasoning
Authors: Lynn A Stein
Venue:  (1991)

We address problems of conflicting evidence --- ambiguity --- in nonmonotonic reasoning. In particular, we provide a unified framework for studying such ambiguity and for identifying principles that may aid in resolving it. This framework clarifies the issues that underlie particular ambiguity problems. It unifies existing approaches by providing a common description language. And it suggests new solutions by shifting the focus to underlying principles, rather than particular procedures. We analyze three specific examples of ambiguity --- in inheritance, temporal reasoning, and counterfactual reasoning --- in terms of this unified framework, and provide systems for reasoning about these ambiguities based on the principles of specificity, causation, and similarity of worlds.
TWDM Multihop Lightwave Networks Based on Rotator Digraphs
Authors: Peng-Jun Wan
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Time and Wavelength Division Multiplexed (TWDM) is one of the most promising ways to exploit the enormous bandwidth in a single-mode optical fiber. In this paper, we focus on constructing scalable TWDM networks based on rotator digraphs.To make the network be more economically and technically feasible and to improve the network performance, each station is equipped with multiple fixed transmitters and multiple fixed receivers. For such network architecture, we present the optimal wavelength assignment and transmission schedule. We also study cost performance relation and provide a scheme to to support large network size with multiple passive star couplers.
Aggregations of Elementary Transformations
Authors: Xiaobai Sun
Venue:  (1996)

The techniques of aggregating transformations have been used in the development of blocked algorithms, in particular, the compact representations of aggregated Householder transformation have been wellknown. We show in this paper that the aggregation techniques can be integrated in a framework for aggregating general elementary transformations. The framework consists of three basic compact forms, as extensions of the three compact forms for aggregated Householder transformations, and two componentwise representations of the compact forms. The componentwise representations, introduced in this paper, are a central link to various computational procedures (known and new) for the compact forms, and provide a stepping stone for numerical analysis of blocked algorithms. We show also the connection between the computation of the compact forms and the inverse of general nonsingular triangular matrices.
Randomly roving agents for intrusion detection
Authors: Ira S. Moskowitz, Myong H. Kang, LiWu Chang, Garth E. Longdon
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

Agent based intrusion detection systems (IDS) have advantages such as scalability, reconfigurability, and survivability. In this paper, we introduce a mobile-agent based IDS, called ABIDE (Agent Based Intrusion Detection Environment). ABIDE is comprised of various types of agents, all of which are mobile, lightweight, and specialized. The most common form of agent is the DMA (Data Mining Agent), which randomly moves around the network and collects information. The DMA then relays the information it has gathered to a DFA (Data Fusion Agent) which assesses the likelihood of intrusion. As we show in this paper, there is a quantifiable relationship between the number of DMA and the probability of detecting an intrusion. We study this relationship and its implications.
Novel Resonant-Tunneling Multiple-Threshold Logic Circuit Based on Switching Sequence Detection
Authors: Takao Waho, Kazufumi Hattori, Kouji Honda
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We present a novel multiple-threshold circuit using resonant-tunneling diodes (RTDs). The logic operation is based on detecting a switching sequence in the RTD circuit. This scheme enables us to increase the number of threshold voltages by more than a factor of two compared with previous RTD-based MVL circuits. SPICE simulation shows that the circuit can operate at a clock frequency as high as 10 GHz. A 4-bit flash analog-to-digital converter, which uses the present circuit in its front-end, is also discussed.
A New Concept of Compliance for Software Engineering Standards
Authors: James W. Moore
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Half a decade of intensive planning efforts have positioned us so that we now can clearly see a substantially different role for software engineering standards at the end of another half-decade. This position paper will outline some of those differences. Finally, it will suggest that a new form of compliance with software engineering standards will result.
Direct interaction with large-scale display systems using infrared laser tracking devices
Authors: Kelvin Cheng, Kevin Pulo
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

Existing large scale display systems generally adopt an indirect approach to user interaction. This is due to the use of standard desktop-oriented devices, such as a mouse on a desk, to control the large wall-sized display. By using an infrared laser pointer and an infrared tracking device, a more direct interaction with the large display can be achieved, thereby reducing the cognitive load of the user and improving their mobility. The challenge in designing such systems is to allow users to interact with objects on the display naturally and easily. Our system addresses this with hotspots, regions surrounding objects of interest, and gestures, movements made with the laser pointer which triggers an action, similar to those found in modern web browsers (e.g. Mozilla and Opera). Finally, these concepts are demonstrated by an add-in module for Microsoft® PowerPoint® using the NaturalPointTM Smart-NavTM tracking device.
Performance comparison of a class of slotted ring networks
Authors: Cheoul-Shin Kang, Byung-Seok Park, Ill-Keun Rhee
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Much has been previously written about the performance of slotted ring networks. However, the results are not appropriate to apply for the new generation slotted rings, like counter-rotating multichannel slotted rings. In this paper, a novel technique for quantitative measurement of average transfer delay of a class of slotted rings is presented. The approach is expanded to compare the average transfer delay of various slotted rings including counter-rotating multichannel slotted ring networks. An extensive simulation study has been carried out to verify the derived analytical results. The analytical results show an excellent agreement with simulation results over a broad range of parameters. The average transfer delay of the counter-rotating slotted ring network is about half that of the conventional multichannel slotted rings. Spatial reuse using the counter-rotating channel configuration also increases the effective ring throughput significantly, compared to conventional simple multichannel ring networks. The results show that the major part of the cell transfer delay comes from the propagation delay from a source to a destination. It is also observed that the network throughput depends upon the aggregated transmission capacity of the network.
Application-Level Document Caching in the Internet
Authors: Azer Bestavros, Robert Carter, Mark Crovella, Carlos Cunha, Abdelsalam Heddaya, Sulaiman Mirdad
Venue:  (1995)

Abstract With the increasing demand for document transfer services such as the World Wide Web comes a need for better resource management to reduce the latency of documents in these systems. To address this need, we report on the potential for document caching at the application level in document transfer services. We collected traces of over 250 executions of Mosaic, reflecting actual user requests for WWW documents. Using those traces, we study the tradeoffs between caching at three levels in the system, and the potential for use of application-level information in the caching system. Our traces show that while a high hit rate in terms of URLs is achievable, a much lower hit rate is possible in terms of bytes, because most profitably-cached documents are small. We considered the performance of caching when applied at the level of individual user sessions, at the level of individual hosts, and at the level of a collection of hosts on a single LAN. We show that the performance gain achievable by caching at the session level (which is straightforward to implement) is nearly all of that achievable at the LAN level (where caching is more difficult to implement). However, when resource requirements are considered, LAN level caching becomes much more desirable, since it can achieve a given level of caching performance using a much smaller amount of cache space. Finally, we consider the use of organizational boundary information as an example of the potential for use of application-level information in caching. We show that while it is desirable to cache local documents at the LAN level, the opposite is true at the session level, where remote documents are more profitably cached.
On the proper treatment of context in NL
Authors: D. J Eijck
Venue:  (2000)

The proper treatment of quantification in Natural Language proposed by Richard Montague some thirty years ago does not do proper justice to the fact that interpretation of texts both uses context and sets up new contexts. The dynamic turn in NL semantics is the attempt to model this basic fact, but the use of dynamically quantified variables introduces an undesirable element into this attempt. By extending a variable free `incremental dynamics'' with a flexible system of type scheme patterns and type scheme pattern matching, we arrive at a Montague style architecture for NL semantics that provides a proper treatment both of quantification and of context use and context change.
Exploiting Replication
Authors: Kenneth P. Birman, Thomas A. Joseph
Venue:  (1988)

NO AVAILABLE
Coding Scheme for Low Energy Consumption Fault-Tolerant Bus
Authors: D. Rossi, V. E. S. van Dijk, R. P. Kleihorst, A. H. Nieuwland, C. Metra
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We address the problem of devising the error correcting code which, if used to encode the information on a very deep submicron (VDSM) bus, allows us to achieve fault-tolerance with the minimal impact on bus power consumption and power-delay product. In particular, we first report the results of an analysis that we performed on power dissipation in VDSM fault-tolerant busses using Hamming single error correcting codes. We show that no power saving is possible by choosing between different optimal Hamming codes with the same redundancy. We then propose a new coding scheme which provides a reduction of the energy consumption and power-delay product of over the 11.5% and 45%, respectively, with respect to the optimal (7,4) Hamming code, for a 0:13\mu m CMOS technology bus.
Ranking Arithmetic Proofs by Implicit Ramification
Authors: Stephen J. Bellantoni
Venue:  (1996)

Proofs in an arithmetic system are ranked according to a ramification hierarchy based on occurrences of induction. It is shown that this ranking of proofs corresponds exactly to a natural ranking of the primitive recursive functions based on occurrences of recursion. A function is provably convergent using a rank $r$ proof, if and only if it is a rank $r$ function. The result is of interest to complexity theorists, since rank one corresponds to polynomial time. Remarkably, this characterization of polynomial-time provability admits induction over formulas having arbitrary quantifier complexity.
BRITE: A Flexible Generator of Internet Topologies
Authors: Alberto Medina, Ibrahim Matta, John Byers
Venue:  (2000)

Abstract BRITE is a parameterized topology generation tool, which can be used to flexibly control various parameters (such as connectivity and growth models) and study various properties of generated network topologies (such power laws, path length and clustering coefficient). BRITE can be used to study the relevance of possible causes for properties recently observed in Internet topologies. Different combinations of possible causes can be tested. In this version, we consider four of them: (1) preferential connectivity of a new node to existing nodes; (2) incremental growth of the network; (3) geographical distribution of nodes; and (4) locality of edge connections. We use BRITE in [BU-CS-TR-2000-0004] to study the origin of power laws and other metrics in Internet topologies. BRITE (Boston university Representative Internet Topology gEnerator) is available on the Web at http://www.cs.bu.edu/faculty/matta/Research/BRITE/
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits
Authors: Boros Endre, Ibaraki Toshihide, Makino Kazuhisa
Venue:  (1999)

In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes.
Suez: A Cluster-Based Scalable Real-Time Packet Router
Authors: Tzi-cker Chiueh, Prashant Pradhan
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Suez is a high-performance real-time packet router that supports fast best-effort packet routing and scalable QoS-guaranteed packet scheduling, and is built on a hardware platform consisting of a cluster of commodity PCs connected by a gigabit/sec system area network. The major goal of the Suez project is to demonstrate that the PC cluster architecture can be as cost-effective a platform for high-performance network packet routing as for parallel computing.Suez features a cache-conscious routing-table search algorithm that exploits CPU caching hardware for fast lookup by treating IP addresses directly as virtual addresses. To scale the number of real-time connections supportable with the link speed, Suez implements a fixed-granularity fluid fair queuing (FGFFQ) algorithm that eliminates the per-packet sorting over-head associated with conventional weighted fair queuing algorithms. This paper presents the architectural features of Suez, and reports the performance measurements of the Linux-based Suez prototype, which is built on four Pentium-II 400MHz machines and Myrinet.
Alma/Carne: implementation of a time-situated meta-reasoner
Authors: K. Purang
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Agents need to operate in dynamic situations where the information they have about the world is incomplete, uncertain and quite possibly false. Active logic has been designed with capabilities that enable these aspects of the world to be taken into account, notably time-situatedness, contradiction tolerance and meta-reasoning. This paper presents a general-purpose implementation of active logic, Alma/Carne that is meant to be a basis on which to build and experiment with such agents. We illustrate the use of Alma/Carne in the implementation of a non-monotonic reasoner that is computable and that has been successfully tested on a large number of examples from the literature.
On the Interval Routing of Chordal Rings
Authors: Bernard Mans
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The Shortest-Path Interval Routing Scheme is an efficient strategy to code distributed routing algorithms in a compact way. Characterising networks which admit shortest-path Strict Interval Routing Scheme using one interval per edge (1-SIRS) is known to be NP-complete. In this paper, we study 1-SIRS for a popular class of networks, known as Chordal Rings.We prove that for any chordal ring of degree 4 with a chord of length k (>3), there exists an infinite set of n such that the chordal ring _n (of size n) does not admit a 1-SIRS, regardless of the node-labeling. This gives a negative answer to an open-question from Gavoille and extends the characterisation of node-labelings which allow a shortest path 1-SIRS in chordal rings.Mainly, we study the natural cyclic node-labeling and derive an alternative node-labeling using isomorphic properties. First we show that there is an infinite class of chordal rings with chord k of even length that do not have a shortest-path 1-SIRS. Second, we show the limitation of the cyclic node-labeling and its alternative representation when k is odd. Finally, we conjecture that any chordal ring with shortest path 1-SIRS has a node-labeling isomorphic to a chordal ring with a cyclic node-labeling.
A Threads Tutorial - Fortran Version
Authors: Thomas W. Doeppner,  Jr.
Venue:  (1988)

Threads is a system for the efficient support of concurrency. It runs on either single-processor or multiprocessor computers and presents to the programmer the same ``view of the world'''' no matter how many processors are available for use. This view is that a number of concurrent {\em threads of control} are executing in a single shared address space and share a common view of which files are open. Thus threads may communicate very efficiently through this shared memory and all threads may participate in I/O on any file. In this paper we discuss the most important routines provided by the Threads system and give examples of their use.