ppxscal/embedding_network huggingface dataset:
Graphical Fisheye Views of Graphs
Authors: Manojit Sarkar, Marc H. Brown
Venue:  (1991)

A {\em fisheye lens} is a very wide-angle lens that shows places nearby in detail while also showing remote regions in progressively less detail. This paper describes a system for viewing and browsing planar graphs using a software analog of a fisheye lens. We first show how to implement such a view using solely geometric transformations. We then describe a more general transformation that allows hierarchical, structural information about the graph to modify the views. Our general transformation is a fundamental extension to the early efforts in fisheye views.
Design and Implementation of SRMS in Kurt Linux
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland \cite{ll:sched} for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given task and across multiple tasks for a given period of time. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. SRMS feasibility test ensures that it is possible for a given periodic task set to share a given resource without violating any of the statistical QoS constraints imposed on each task in the set. The SRMS scheduling algorithm consists of two parts: a job admission controller and a scheduler. The SRMS scheduler is a simple, preemptive, fixed-priority scheduler. The SRMS job admission controller manages the QoS delivered to the various tasks through admit/reject and priority assignment decisions. In particular, it ensures the important property of task isolation, whereby tasks do not infringe on each other. In this paper we present the design and implementation of SRMS within the KURT Linux Operating System. KURT Linux supports conventional tasks as well as real-time tasks. It provides a mechanism for transitioning from normal Linux scheduling to a mixed scheduling of conventional and real-time tasks, and to a focused mode where only real-time tasks are scheduled. We overview the technical issues that we had to overcome in order to integrate SRMS into KURT Linux and present the API we have developed for scheduling periodic real-time tasks using SRMS.
Protocol Portability through Module Encapsulation
Authors: Bobby Krupczak, Ken Calvert, Mostafa Ammar
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Because protocol software is difficult and expensive to implement and test, it is often ported between systems instead of rewritten from scratch. Unfortunately, porting protocol software can be as difficult as from-scratch development, due to inherent differences in subsystem design. Thus, protocol subsystems can have a profound effect on the portability of a protocol implementation. We propose an approach permitting the incorporation of new protocols into a subsystem other than their ``native'' one without the drawbacks or expense of porting and original development. Our approach is based on protocol module encapsulation, which allows unmodified protocol code developed for one protocol subsystem to be used within another. We relate our experiences designing, implementing, and measuring the performance of our protocol encapsulation modules, using an AppleTalk protocol stack as a baseline.
The Architecture and Performance of Security Protocols in the Ensemble Group Communication System
Authors: Ohad Rodeh, Kenneth Birman, Danny Dolev
Venue:  (2000)

Ensemble is a Group Communication System built at Cornell and the Hebrew universities. It allows processes to create process groups within which scalable reliable fifo-ordered multicast and point-to-point communication are supported. The system also supports other communication properties, such as causal and total multicast ordering, flow control, etc. This paper describes the security protocols and infrastructure of Ensemble. Applications using Ensemble with the extensions described here benefit from strong security properties. Under the assumption that trusted processes will not be corrupted, all communication is secured from tampering by outsiders. Our work extends previous work performed in the Horus system (Ensemble''s predecessor) by adding support for multiple partitions, efficient rekeying, and application defined security policies. Unlike Horus, which used its own security infrastructure with non-standard key distribution and timing services, Ensemble''s security mechanism is based on off-the shelf authentication systems, such as PGP and Kerberos. We extend previous results on group rekeying, with a novel protocol that makes use of diamond-like data structures. Our Diamond protocol allows the removal of untrusted members within milliseconds.
Multi-channel copy networks: architecture, performance model, fairness, and cell sequencing
Authors: P. S. Min, H. Saidi, A. Chandra, M. V. Hegde
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper develops a copy network architecture that can maintain the cell sequence integration multichannel ATM switching. The architecture is internally nonblocking. Assuming that cells appear with fanout request values that are distributed independently from cell to cell, we also formulate a method of analyzing the performance of the copy network. We conduct a numerical study for the proposed architecture using this method, and the effects of key network and traffic variables are quantified under arbitrary types of fanout distribution.
Multiservice call blocking approximations for virtual path based ATM networks with CBR and VBR traffic
Authors: R. Siebenhaar
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The exact calculation of call blocking probabilities for multiservice ATM networks with alternate or adaptive routing for virtual channels (VC) is hardly possible. Therefore the paper presents and investigates the equivalent single path model as an approximation to omit the VC routing algorithm in the calculation. The model can be applied to ATM networks with several direct virtual path connections between each node pair. Further different methods to calculate the multiservice call blocking probabilities are reviewed and compared. A new approximate method is presented for networks, where the trunk reservation fairness mechanism is applied. This method is accurate, fast and may also be used for noninteger capacities and bandwidth requirements, which is important for statistical multiplexing of variable bitrate traffic.
Benchmarks for Interconnect Parasitic Resistance and Capacitance
Authors: Nagaraj NS, Tom Bonifield, Abha Singh, Frank Cano, Usha Narasimha, Mak Kulkarni, Poras Balsara, Cyrus Cantrell
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Interconnect parasitics are dominating circuit performance,signal integrity and reliability in IC design. Copper/low-kprocess effects are becoming increasingly important toaccurately model interconnect parasitics. Even if theinterconnect process profile is accurately represented,approximations in parasitic extraction could cause largeerrors. Typically, researchers and designers have been usingpre-defined set of structures to validate the accuracy ofinterconnect models and parasitic extraction tools. Unlikeindustry benchmarks on circuits such as MCNC benchmarks,no benchmarks exist for interconnect parasitics. This paperdiscusses the issues in accurate interconnect modeling for130nm and below copper/ultra low-k technologies. A set ofbenchmark structures that could be used to validate accuracyand compare parasitic extraction tools is proposed. Siliconresults from 130nm technology are presented to illustrate theusefulness of these benchmarks. Results of application of thesebenchmarks to compare parasitic extraction tools arepresented to demonstrate systematic validation of resistanceand capacitance extraction.
Implementation of the SMART Information Retrieval System
Authors: Chris Buckley
Venue:  (1985)

NOT SUPPLIED
Tractability issues in extraposition grammar
Authors: Annius V. Groenink
Venue:  (1996)

Extraposition Grammar (XG) was introduced in [Per81] as a grammar formalism whose increase in recognizing power over context free grammars is limited to mechanisms for adequate description of structural phenomena occurring in natural language. This paper proposes versions of XG whose fixed recognition problems are in deterministic polynomial and exponential time; furthermore it is shown that the unrestricted XG defined in the original work [Per81] describe any recursively enumerable language.
Enhancement of Robustness of Image Watermarks Image Watermark into Colored Image, Based on WT and DCT
Authors: Jung S. Cho, Seung W. Shin, Won H. Lee, Jong W. Kim, Jong U. Choi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This research is concerned with the watermarking technique which embeds image data invisibly into colored image based on Wavelet Transform (WT) and Discrete Cosine Transform (DCT) so that the watermark data be not impaired in compression, filtering, cropping, rescaling, re-sampling, and other digital manipulations.The suggested method comprises the steps of transforming the target image using WT, transforming a image watermark using DCT, integrating the wavelet transformed digital image with the DCT-transformed watermark image to embed the fingerprint into the intellectual property, and generating the watermarked image using inverse wavelet transform.In the experiments, it was found that the suggested method is highly effective against impairment of the watermark that would otherwise be caused by the image processing operations, such as compression, filtering, re-sampling, rotation, and cropping
Why Multicast Protocols (Don''t) Scale: An Analysis of Multipoint Algorithms for Scalable Group Communication
Authors: Eve M. Schooler
Venue:  (2000)

With the exponential growth of the Internet, there is a critical need to design efficient, scalable and robust protocols to support the network infrastructure. A new class of protocols has emerged to address these challenges, and these protocols rely on a few key techniques, or micro-algorithms, to achieve scalability. By scalability, we mean the ability of groups of communicating processes to grow very large in size. We study the behavior of several of these fundamental techniques that appear in many deployed and emerging Internet standards: Suppression, Announce-Listen, and Leader Election. These algorithms are based on the principle of efficient multipoint communication, often in combination with periodic messaging. We assume a loosely-coupled communication model, where acknowledged messaging among groups of processes is not required. Thus, processes infer information from the periodic receipt or loss of messages from other processes. We present an analysis, validated by simulation, of the performance tradeoffs of each of these techniques. Toward this end, we derive a series of performance metrics that help us to evaluate these algorithms under lossy conditions: expected response time, network usage, memory overhead, consistency attainable, and convergence time. In addition, we study the impact of both correlated and uncorrelated loss on groups of communicating processes. As a result, this thesis provides insights into the scalability of multicast protocols that rely upon these techniques. We provide a systematic framework for calibrating as well as predicting protocol behavior over a range of operating conditions. In the process, we establish a general methodology for the analysis of these and other scalability techniques. Finally, we explore a theory of composition; if we understand the behavior of these micro-algorithms, then we can bound analytically the performance of the more complex algorithms that rely upon them.
Silicon Models of Early Audition
Authors: John Lazzaro
Venue:  (1990)

This dissertation describes silicon integrated circuits that model known and proposed physiological structures in the early auditory system. Specifically, it describes silicon models of auditory-nerve response, of auditory localization in the barn owl, and of pitch perception. The integrated circuits model the structure as well as the function of the physiology; all subcircuits in the chips have anatomical correlates. The chips, two of which contain over 100,000 transistors, compute all outputs in real time, using analog, continuous-time processing. In most respects, chip responses approximate physiological or psychophysical response of the modeled biological systems. The dissertation also describes a novel nonlinear-inhibition circuit, which is a key component of two of the silicon models.
Character Recognition of Arabic and Latin Scripts
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The goal to produce effective Optical Character Recognition (OCR) methods has lead to the development of a number of algorithms. The purpose of these is to take the hand-written or printed text and to translate it into a corresponding digital form. The multitude requirements and developments are well represented in the literature (see for example Abuhaiba [1 J and Suen [2 J).The primary objective of this paper is to provide an insight into a robust system which has been successfully developed and employed to recognize Latin and Arabic characters and whose workings has been described by the authors in a sister publication [3 J .The focus here is to discuss the main components used in the multi-stage system, paying particular attention to the nonnalization process used for orientation and size for a given bitmapped character. The effectiveness of the approach is demonstrated through its workings for the Arabic and Latin case, for both characters and numbers.
CMMI Distilled: A Practical Introduction to Integrated Process Improvement, 2 edition
Authors: Ahern, Richard Turner, Aaron Clouse
Venue:  (2003)

Capability Maturity Model IntegrationSM (CMMI) has rapidly become a preferred means of improving organizational processes in industry and government. Building on a decade of work with process improvement models, including the Capability Maturity Model® (CMM®) for Software and the Systems Engineering Capability Model, a team of over two hundred engineering and process improvement experts worked for three years to create this broader, more agile instrument for guiding, integrating, and appraising improvement activities. CMMI provides a single, integrated framework for improving processes throughout an organization, enhancing the quality and efficiency of the organization as a whole.The CMMI Product Suite is rich in detail and guidance, but correspondingly large and somewhat complex. The sheer volume of information it presents can seem overwhelming. CMMI Distilled reduced that complexity with a fresh and approachable introduction to the key elements of CMMI and integrated process improvement.This new edition of CMMI Distilled, updated for CMMI version 1.1, includes more material in layman's language to meet a wider variety of reader's needs, but has not lost any of the technical content that made the first edition so successful. Written for those new to model-based process improvement, it also offers insights that can help even battle-scarred process improvement veterans and experienced systems, software and quality engineers perform better. CMMI® Distilled, Second Edition is especially appropriate for executives and managers who need to understand why process improvement is valuable, why CMMI is a tool of choice, and how to maximize the return on their efforts and investments.The three authors have been involved with CMMI since its inception, and they bring a wealth of their own experience and knowledge to this book. They highlight the pitfalls and short cuts that are all too often learned by costly experience. Above all, they provide a context for understanding why CMMI is the fastest growing process improvement framework in the world. 0321186133B06272003
A Protocol for Supporting the ABT/DT Capability
Authors: Pierre Cregut, Fabrice Guillemin, Barbara Heyd
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

With the ATM Block Transfer with Delayed Transmission \mbox{(ABT/DT)} capability, the amount of bandwidth allocated to the different cell flows of a connection (namely the CLP=0+1 and possibly the OAM cell flows) is constant over an ATM block and then referred to as block cell rate (BCR). Successive BCR values are dynamically negotiated between the user and the network via the exchange of Resource Management cells. The BCR negotiation for a given ATM block may be initiated either by the source or the destination. As a basic principle, before transmitting an ATM block, the source should receive an explicit authorization from the network. This paper gives the existence proof of a protocol for supporting the ABT/DT capability as specified in the May 1996 version of ITU-T Recommendation I.371.
Linux Apache Web Server Administration (Craig Hunt Linux Library), 2 edition
Authors: Charles Aulds
Venue:  (2002)

:Linux Apache Web Server Administration is the most complete, most advanced guide to the Apache Web server you'll find anywhere. Written by a leading Apache expert -- and now updated to cover Apache 2.0 -- this book teaches you, step-by-step, all the standard and advanced techniques you need to know to administer Apache on a Linux box. Hundreds of clear, consistent examples illustrate these techniques in detail -- so you stay on track and accomplish all your goals.
Automated generation of category-specific thesauri for interactivequery expansion
Authors: Giuseppe Attardi, Sergio Di Marco, Fabrizio Sebastiani
Venue:  (1998)

The categorisation of documents into subject-specific categories is a useful enhancement for large document collections addressed by information retrieval systems, as a user can first browse a category tree in search of the category that best matches her interests, and then issue a query for more specific documents "from within the category". This approach combines two modalities in information seeking that are most popular in Web-based search engines, i.e. category-based site browsing (as exemplified by e.g. YAHOO) and keyword-based document querying (as exemplified by e.g. ALTAVISTA). Appropriate query expansion tools need to be provided, though, in order to allow the user to incrementally refine her query through further retrieval passes, thus allowing the system to produce a series of subsequent document rankings that hopefully converge to the user''s expected ranking. In this work we propose that automatically generated, category-specific "associative" thesauri be used for such purpose. We discuss a method for their generation, and discuss how the thesaurus specific to a given category may usefully be endowed with "gateways" to the thesauri specific to its parent and children categories. TEL:: +39.050.593407 EMAIL:: fabrizio@iei.pi.cnr.it
Automata, power series, and coinduction: taking input derivatives seriously (extended abstract)
Authors: J. J.M.M. Rutten
Venue:  (1999)

Formal power series, which are functions from the set of words over an alphabet $A$ to a semiring $k$, are viewed coalgebraically. In summary, this amounts to supplying the set of all power series with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions of operators on power series take the shape of what we have called behavioural differential equations, after Brzozowski''s notion of input derivative, and include many classical differential equations for analytic functions. The use of behavioural differential equations leads, amongst others, to easy definitions of and proofs about both existing and new operators on power series, as well as to the construction of finite (syntactic) nondeterministic automata, implementing them.
On automorphisms of Cayley-digraphs of abelian groups
Authors: István Kovács
Venue: Discrete Mathematics (2003)

The automorphisms of the Cayley-digraph Γ are considered, where Γ is defined according to some abelian group G. Using Fourier transformation defined over G, we derive an equation relating automorphisms of Γ and characters of G. Then our result is used to estimate the number of simple eigenvalues that Γ can have, when it admits a non-regular automorphism group. As another application of our method, a short proof is also shown for a classical theorem of W. Burnside on transitive permutation groups of prime degree.
The State Machine Approach: A Tutorial
Authors: Fred B. Schneider
Venue:  (1986)

The state machine approach is a general method for achieving fault tolerance and implementing decentralized control in distributed systems. This paper reviews the approach and identifies abstractions needed for coordinating ensembles of state machines. Implementations of these abstractions for two different failure models -Byzantine and fail-stop-are discussed. The state machine approach is illustrated by programming several examples. Optimization and system reconfiguration techniques are explained.
Understanding COBOL systems using inferred types
Authors: Arie Deursen, Leon M.F. Moonen
Venue:  (1999)

In a typical COBOL program, the data division consists of 50\% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations contained therein, showing how variables are related based on their actual usage. The most problematic aspect of type inference is \emph{pollution}, the phenomenon that types become too large, and contain variables that intuitively should not belong to the same type. The aim of the paper is to provide empirical evidence for the hypothesis that the use of \emph{subtyping} is an effective way for dealing with pollution. The main results include a tool set to carry out type inference experiments, a suite of metrics characterizing type inference outcomes, and the conclusion that only one instance of pollution was found in the case study conducted.
Defining Liveness
Authors: Bowen Alpern, Fred B. Schneider
Venue:  (1984)

A formal definition for liveness properties is proposed. It is argued that this definition captures the intuition that liveness properties stipulate that ``something good'''' eventually happens during execution. A topological characterization of safety and liveness is given. Every property is shown to be the intersection of a safety property and a liveness property.
ClusterProbe: An Open, Flexible and Scalable Cluster Monitoring Tool
Authors: Zhengyu Liang, Yundong Sun, Cho-Li Wang
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this paper, we describe the ClusterProbe, an open, flexible, scalable, and Java-based tool for monitoring large clusters of workstations. The tool provides an open environment by developing a multiple-protocol communication interface that can be connected to various types of external accesses from the clients. The design of ClusterProbe allows it to scale up to commodious capacity with its cascading hierarchical architecture. In addition, ClusterProbe is flexible that the monitoring tool can be easily extended to adapt to the resource changes by using the Java-RMI mechanism. Several useful services are implemented based on ClusterProbe, including the visualization of cluster resources information in various forms and cluster fault management. The tool has been used to assist the execution of a cluster-based search engine and a distributed N-body application. All experiments demonstrate high efficiency and good performance improvement.