ppxscal/embedding_network huggingface dataset:
SPIN vs. VIS: A Case Study on the Formal Verification of the ATMR Protocol
Authors: Hong Peng, Sofiène Tahar, Ferhat Khendek
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

Nowadays, there exists a wide variety of verification tools. Some, like SPIN, are designed and mainly used for the verification of interleaving software systems, such as communications protocols. Others, like VIS, are designed and used for synchronous hardware systems verification. In this paper, we compare and contrast SPIN and VIS. In particular, we devote a special attention to the efficiency of these tools for the verification of communications protocols that can be implemented in either software or hardware. As a basis of our comparison, we formally describe and verify the ATMR (Asynchronous Transfer Mode Ring) medium access protocol using SPIN and its hardware implementation using VIS. We believe that this study is of particular interest as more and more protocols, like the ATM protocol stack, are implemented in hardware to match the high-speed requirements. However, this is not a formal comparison of SPIN and VIS.
United Snakes
Authors: Jianming Liang, Tim McInerne, Demetri Terzopoulos
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a portable, reusable, software package called "United Snakes". The package unites the most popular snake variants, including finite difference, B-spline, and Hermite polynomial snakes within the mathematical framework of a general finite element formulation with a choice of shape functions. The package furthermore incorporates a recently proposed snake-like technique known as "livewire". We integrate snakes and livewire by introducing an effective method for imposing hard constraints on snakes. Our experiments demonstrate that snakes and livewire have complementary strengths and that their union offers a more powerful tool for interactive image analysis, especially for medical imaging applications. United Snakes is implemented in Java as a JavaBean so that it can easily be integrated in end-user application systems.
A Jigsaw Query Processing Technique for Web GIS
Authors: Sung-Hee Kim, Chi-Young Yoo, Hae-Young Bae, Young-Geol Lee, Jong-Hoon Kim, Jae-Dong Lee, Jae-Hong Kim
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

As computing environments for Internet has been expanding, researches on Internet GIS (Geographic Information System) have been actively made. The omnipresence and easiness of Web make the research being focused on Web GIS. Web GIS is classified into Server-side Web GIS and Client-side Web GIS. This classification is based on the query processing location, the server or the client, respectively.The former can easily be implemented but raise the overload of the server since every request must be returned to the server and processed in server. The latter lessens the overload of the server, but raises some problems. Firstly, if client is not very powerful, large and complex datasets can be hard to be processed on the client. Secondly, the large amounts of data as well as applets or controls cause delays since they must be transferred from server to client.To solve these problems, this paper proposes a Jigsaw query processing technique that processes user queries dynamically. The proposed technique classifies the query into client class query, server class query or client-server class query. Client class query is processed in client itself. Server class query is transferred to the server and processed in the server and the result returns into the client. Client-server class query is processed as follows. The data required to process query is transferred from the server into the client. Next, the client processes the query with its original data and the transferred data. The proposed technique uses some meta data on client-stored data (such as spatial data, spatial index, and so on) and the communication speed between the client and the server to classify the class of the query, and uses tile-divided data structure for efficient spatial data transmission.For an evaluation, the detailed experiments such as map browsing, layer controlling, point query, and region query are conducted comparing the proposed technique with two other existent methods. Based on the result of experiments, the proposed technique can give the user fast response and increase system performance.
Key Exchange Using Keyless Cryptography
Authors: Bowen Alpern, Fred B. Schneider
Venue:  (1982)

Protocols to generate and distribute secret keys in a computer network are described. They are based on keyless cryptography, a new cryptographic technique where information is hidden by keeping only the originator of a message, and not its contents, secret.
Error Rate Estimation for a Flight Application Using the CEU Fault Injection Approach
Authors: F. Kaddour, S. Rezgui, R. Velazco, S. Rodriguez, J. R. De Mingo
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper aims at validating the efficiency of a fault injection approach to predict error rate on applications devoted to operate in radiation environment. Soft error injection experiments and radiation ground testing were performed on software modules using a digital board built on a digital signal processor which is included in a satellite instrument. The analysis of experimental results put in evidence the potentialities offered by the used methodology to predict the errorrate of complex applications.
An algebraic memory model
Authors: J. P. Moskowitz, C. Jousselin
Venue: ACM SIGARCH Computer Architecture News (1989)

Memory in the von Neumann computer is usually viewed as a linear array. We prove that this view does not follow from the consecutive nature of this memory, but from the group structure of the law performed in the address arithmetic unit. By changing that law, we can get a memory with a non commutative access. As an example we describe the metacyclic memory.
Improving the Orthogonal Range Search k -Windows Algorithm
Authors: P. Alevizos, B. Boutsinas, D. Tasoulis, M. N. Vrahatis
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Clustering, that is the partitioning of a set of patterns into disjoint and homogeneous meaningful groups (clusters), is a fundamental process in the practice of science. k -windows is an efficient clustering algorithm that reduces the number of patterns that need to be examined for similarity, using a windowing technique. It exploits well known spatial data structures, namely the range tree, that allows fast range searches. From a theoretical standpoint, the k -windows algorithm is characterized by lower time complexity compared to other well-known clustering algorithms. Moreover, it achieves high quality clustering results. However, it appears that it cannot be directly applicable in high-dimensional settings due to the superlinear space requirements for the range tree. In this paper, an improvement of the k -windows algorithm, aiming at resolving this defficiency, is presented. The improvement is based on an alternative solution to the orthogonal range search problem.
A New Definition of the Subtype Relation
Authors: Barbara Liskov, Jeannette M. Wing
Venue:  (1993)

The use of hierarchy is an important component of object-oriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of how subtypes and supertypes are related. This paper presents a new definition of the subtype relation that ensures that any property proved about supertype objects also holds for subtype objects. It also discusses the ramifications of the definition on the design of type families.
Assessment and Optimization of System Architectures - Experience from Industrial Applications at Siemens
Authors: Michael Gloger, Stefan Jockusch, Norbert Weber
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Durable, robust architectures are of crucial importance for the competitiveness of companies like Siemens. The System Architecture Analysis (SAA) method enables the development of system architectures with a long lifetime. SAA pursues a comprehensive approach to optimize architectures which takes into account market strategy as well as technological aspects. Since 1993, SAA has been used to support definition and optimization of software and system architectures world-wide in Siemens+ computer system and industrial process groups.
Practical Mod_PERL
Authors: Stas Bekman, Eric Cholet
Venue:  (2003)

mod_perl embeds the popular programming language Perl in the Apache web server, giving rise to a fast and powerful web programming environment. Written for Perl web developers and web administrators, Practical mod_perl is an extensive guide to the nuts and bolts of the powerful and popular combination of Apache and mod_perl. From writing and debugging scripts to keeping your server running without failures, the techniques in this book will help you squeeze every ounce of power out of your server. True to its title, this is the practical guide to mod_perl.
Decision-theoretic active sensing for autonomous agents
Authors: AnYuan Guo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Classification is a sub-task common to many problems faced by autonomous agents. Traditional treatment of classification in the Machine Learning literature assumes that a feature vector is given as input. This ignores the essential role of an autonomous agent as a proactive information gatherer. In this paper, we present a framework for making optimal sensing and information gathering decisions with respect to classification goals by formulating the problem as a partially observable Markov decision process and solving for the optimal policy. We demonstrate the utility of this approach on a simulated meteorite collection task faced by an autonomous rover.
Implementation of an Unrestricted File Organization for Micro-PL/CS
Authors: James E. Archer,  Jr.
Venue:  (1979)

Micro PL/CS is a version of PL/CS developed for a single-user, interactive environment. A file system extension makes PL/CS self-sufficient for standalone file processing and secondary storage management. The basis of the file system extension is the Unrestricted File Organization which provides a free mixture of sequential, indexed and random file operations. The structure, operation, and system-interfaced procedures of the UFO are presented and explained. The Micro-PL/CS file extension implementation is then sketched in terms of the UFO primitives.
Quasiparallelism in finite planar spaces
Authors: Sveva Freni
Venue: Discrete Mathematics (2003)

In this paper we study quasiparallelism relation in finite planar spaces. Moreover, 3-dimensional punctured projective spaces and 3-dimensional projective spaces from which a line has been deleted are characterized.
The Design and Engineering of a Custom Integrated Circuit for Primitive Classification
Authors: Hanlon M Tate
Venue:  (1986)

The computational resources available to researchers and designers have grown at a phenomenal rate over the past several decades. There is tremendous interest in applying this power to a wide array of problems. As a result, many types of problems have been mapped onto traditional VonNeumann-type computers. Often, an important problem will be mapped onto a computer in this way, and it will be discovered that this mapping will not afford the user the leverage he requires. Many time this is either because the problem has been mapped poorly, or the problem would require computational resources well out of reach of today''s technology. Artificial intelligence problems which require astronomical computational resources to solve are an example of this. Often, however, a problem has great potential for computerized solution within the constraints of today''s technology, but will not map efficiently onto traditional architectures. Real time digital signal processing applications fall into this category. These problems prove difficult to solve on traditional machines, but are easily handled by special purpose architectures. Curve-Solid Classification (CSC) of Constructive Solid Geometry (CSG) presents just such a problem. This technique, also known as raycasting, allows complex three dimensional objects to be modeled. The classification of a geometric object involves computing the intersection of a family of curves with the object. Much information about the object is gained during the classification process. Volume, moments, frontal area, and shading information are some of the many characteristics which are easily computed once an object has been classified. Algorithms have been in existence for years for the solution of the raycasting problem. Yet, most raycasting problems of even moderate size require too much CPU power to permit these techniques to be widely used. A special purpose raycasting architecture has been proposed by Kedem [5] which can provide tremendous speedup over raycasting algorithms for general purpose computers. This architecture is designed to take advantage of VLSI technology to achieve an extremely high degree of parallelism. The general Curve-Solid Classification problem has been restricted enough to allow implementation with extremely regular VLSI structures. Yet, the design is still flexible enough to handle a wide variety of problems. The architecture calls for two types of VLSI processors. This paper describes the design of one of these. 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
Safety Subsystem of Intelligent Software Complex for Distance Learning
Authors: Dmitry Popov, Alexander Khadzhinov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Models and methods of information security for intelligent software complex are developed in this work. The problems of Distance Learning System safety are considered. Decisions of security support of educational materials and tests storage are offered.
Assistant Agents for creation and management of distributed applications
Authors: Madeleine Girard
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The synthesis of distributed software involves problems of selection and assembly of several software components located on different remote sites and machines as well as problems bound to communication mechanisms. Generally, each software component is defined with its own description language. Henceforth communication between two components often requires additional data transformation operations to allow direct data exchange between them. In the same way, the user has to create their various communication channels. We propose a new software development toolkit called ADAM, which manages these operations in a manner transparent to the user. It offers the possibility to choose between various software components with their own characteristics (localization, machine performances ...). ADAM tries to find a software component chain in response of a user request. The use of the corresponding distributed application by the user allows ADAM to learn more about its world representation: an exploration of its environment enables it to learn characteristics about new machines and remote sites, and thus to adapt its world representation to sudden environment modifications. ADAM uses coordination between Software Agents to manage various data exchanges between software components as well as created distributed applications in case of failure, and to test the machines and remote. 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
QDT (Quickdraw Terminal) Libraries
Authors: Mark Sherman, Ann Marks
Venue:  (1986)

This Unix tar-tape contains the C libraries used on Unix and the PL/1 Libraries used on DCTS for communicating with QDT. (No longer available.)
Timing Properties of the Timed Token MAC Protocol
Authors: Sijing Zhang, Alan Burns
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We investigate the inherent timing properties of the timed token medium access control (MAC) protocol that are necessary for guaranteeing synchronous message deadlines in a timed token ring network such as the Fibre Distributed Data Interface (FDDI) network. As a result, the best-so-far result of the upper bound on the time possibly elapsed between any number of successive token arrivals at a particular node was derived. This result, which is particularly important for studies on real-time communications in any timed token ring network, has recently published in [see below] with no proof given due to space limitation. In this paper, we complement our early work by presenting a concise formal proof of this upper bound. The paper cited in "Abstract": S.Zhang and A.Burns, "An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol", IEEE/ACM Transactions on Networking, Vol.3, No.6, pp 729-741, December, 1995.
Effective Learning in Noisy Environment Using Neural Network Ensemble
Authors: Pitoyo Hartono, Shuji Hashimoto
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

We have previously proposed a model of neural network ensemble composed of a number of Multi Layer Perceptrons (MLP). The ensemble is trained so that each member has a unique expertise. It is also provided with a mechanism to automatically select the most relevant member with respect to the given environment, enabling the ensemble to adapt effectively in changing environment. In this research, we trained the ensemble with noisy training data set, which is a training set that contains a particular percentage of contradictionary (false) data. Based on the members' expertise the ensemble has the ability to distinguish contradictionary data and treat such kind of data set as one unique environment that differs from the clean environment formed by correct data. In the training process the ensemble will automatically select one of its members to be trained in the clean environment and switch to another member whenever a contradictionary data is given, resulting that one of the ensemble member will be successfully adapting the clean environment.
MCSA Managing a Windows 2000 Network Environment Exam Cram 2 (Exam 70-218)
Authors: Kirk M. Hausman, Ed Tittel
Venue:  (2002)

:This exam measures the ability to administer, support, and troubleshoot information systems that incorporate Microsoft Windows 2000, including Windows Server 2003. This exam is a core requirement of Microsoft's new MCSA certification, which has already certified nearly 10,000 individuals in its first six months. Certcities.com ranked MCSA as the No.1 certification for 2002. This book is not intended to teach new material. Instead it assumes that you have a solid foundation of knowledge but can use a refresher on important concepts as well as a guide to exam topics and objectives. This book focuses exactly on what you need to pass the exam - it features test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else. The series is supported online at several Web sites: examcram.com, informit.com, and cramsession.com, and 24/7 technical support is available through KnowledgePool.com!The accompanying CD features PrepLogic Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.
Synthesizing Protocol Specifications from Service Specifications in Timed Extended Finite State Machines
Authors: Jun-Cheol Park, Raymond E. Miller
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We propose a specification model and present a method to algorithmically derive a protocol specification from a service specification based on the model. Unlike the previous models based on finite state machines, the proposed model can explicitly express concurrency, synchronization, and timing requirements such as delays and timeouts. We assume that there exists a reliable communication channel between any two protocol entities and the maximum delay for each channel is bounded by a positive constant. Because of the variable nature of the communication delays along with the time constraints associated with events, no protocol specification can fully simulate the service specification. The proposed method derives a protocol specification that is optimal in the sense that it provides the largest possible subset of the service specification under the communication delay constraints. We also give a method to derive a sub specification from a service specification and a maximum communication delay of each channel such that the sub specification, but no superset of it, can be simulated by the derived protocol specification.
Performance of the Horus Asynchronous Group Communication System under High Load
Authors: Takako M. Hickey, Robbert van Renesse
Venue:  (1996)

Horus is an asynchronous group communications system designed to support a variety of distributed and parallel applications. This paper reports the performance of continuous $n \times n$ multicasts for a Horus protocol stack that provides fully reliable communication over Ethernet supporting IP multicast. This communication pattern not only is highly demanding from the communications point of view, but also is common for an important class of distributed applications. Specific findings reported in this paper are: providing reliability is expensive under high loss; the cost of providing full reliability is modest compared to that of providing simple reliability; the lack of receivers'' resources contributes to high loss; the lack of synchronization among group members also contributes to high loss; and controlling the send rate based on receivers'' resource availability is a promising method for maintaining high throughput under high load.
Parallel Cholesky Factorization of Sparse Matrices
Authors: John R. Gilbert, Hjalmtyr Hafsteinsson
Venue:  (1987)

We describe a parallel algorithm for finding the Cholesky factorization of a sparse symmetric positive definite matrix A. The algorithm runs in $O(h \log n)$ time with $m\*$ processors, where $h$ is the height of A''s elimination tree. We then show how to speed up that algorithm, so that it runs in $O(\log n \log^{2}h)$ time with increased number of processors. Also, we present corresponding parallel algorithms for forward solve and back solve with the same time bounds and similar processor bounds.