ppxscal/embedding_network huggingface dataset:
An Algorithm for Distributed Hierarchical Diagnosis of Dynamic Fault and Repair Events
Authors: Elias Procopio Duarte,  Jr., Alessandro Brawerman, Luiz Carlos P. Albini
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The components of a fault-tolerant distributed system must be capable to accurately determine which components of the system are faulty and which are fault-free. In this paper, we present a new distributed algorithm for event diagnosis in fully connected networks. An event is defined as a faulty node becoming fault-free, or the opposite. Previous hierarchical algorithms consider a static fault situation, in which an event can only occur after the previous event has been fully diagnosed. The new algorithm is capable of achieving the diagnosis of dynamic events as long as nodes stay in a given state for a period long enough for all testers to detect that state. Each node running the algorithm keeps a timestamp for the state of each other node in the system. This timestamp is implemented as a counter, which is incremented every time a node changes its state. In this way, each tester may get information about a given node in the system from more than one tested node without causing any inconsistencies, i.e. without taking an older state for a newer one. Nodes run a hierarchical testing strategy, which is a hypercube when all nodes are fault-free. When a fault-free node is tested, the tester gets diagnostic information about N/2 nodes, for a system of N nodes. In spite of the overhead of keeping and transferring timestamps, the new algorithm significantly reduces the average latency when compared to other similar approaches, presenting a new option for practical diagnosis implementation.
Oz Scheduler: A Workbench for Scheduling Problems
Authors: Joerg Wuertz
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper describes the Oz Scheduler, a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different popagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for scheduling are incorporated. Resulting from the selections made, a constraint problem is generated dynamically. For this problem, the solution, statistics and the search can be inspected by several graphical tools. The functionality can be extended by sending messages to the Scheduler. The functionality and the implementation of the Oz Scheduler are discussed. The overall performance of the Scheduler for standard benchmarks is comparable to state-of-the-art special-purpose systems for scheduling. The implementation is based on the concurrent constraint language Oz.
On the Burstiness of the TCP Congestion-Control Mechanism in a Distributed Computing System
Authors: Wu-chun Feng, Peerapol Tinnakornsrisuphap, Ian Philp
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Several studies in network traffic characterization have concluded that network traffic is self-similar and therefore not readily amenable to statistical multiplexing in a distributed computing system. This paper examines the effects of the TCP protocol stack on network traffic via an experimental study on the different implementations of TCP. We show that even when aggregate application traffic smooths out as more applications' traffic are multiplexed, TCP introduces burstiness into the aggregate traffic load, reducing network performance when statistical multiplexing is used within the network gateways.
A Call Handling Capacity of Base Station Controller Group for Mobile Originated Calls in the CDMA Mobile System
Authors: H. Um, B. Ryu, J. Ahn
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In this paper, we first describe the architecture of base station (BS) in the CDMA mobile system (CMS) and then model one base station controller group (BSCG) as a queuing network. By using an analytic method for the given queuing network model, we evaluate the mean waiting time at each transmission node in the packet networks between traffic channel element (TCE) in the base station transceiver subsystem (BTS) and selector in the base station controller (BSC). As the transmission technology for the traffic data from TCE to BSC during the call conversation time, we consider two kinds of transmission schemes such as the frame non-staggering scheme and the frame staggering scheme. Then, we evaluate the delay time of traffic data from the TCE to the selector and the quality degradation probability by simulation. Based on these results, we present the call handling capacity of one BSC group for mobile originated calls in the CMS(CDMA Mobile System).
Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis
Authors: Ozalp Babaoglu
Venue:  (1986)

Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency.
The Expected Lifetime of "Single-Address-Space" Operating Systems
Authors: David Kotz, Preston Crow
Venue:  (1993)

Trends toward shared-memory programming paradigms, large (64-bit) address spaces, and memory-mapped files have led some to propose the use of a single virtual-address space, shared by all processes and processors. Typical proposals require the single address space to contain all process-private data, shared data, and stored files. To simplify management of an address space where stale pointers make it difficult to re-use addresses, some have claimed that a 64-bit address space is sufficiently large that there is no need to ever re-use addresses. Unfortunately, there has been no data to either support or refute these claims, or to aid in the design of appropriate address-space management policies. In this paper, we present the results of extensive kernel-level tracing of the workstations in our department, and discuss the implications for single-address-space operating systems. We found that single-address-space systems will not outgrow the available address space, but only if reasonable space-allocation policies are used, and only if the system can adapt as larger address spaces become available.
Equivalent conditions for laws of large numbers for T-related L-R fuzzy numbers
Authors: Dug Hun Hong, Chul H. Ahn
Venue: Fuzzy Sets and Systems (2003)

In this paper, we give some necessary and sufficient conditions for laws of large numbers for sequence of mutually T-related L-R fuzzy numbers when T is an continuous Archimedean t-norm and diameter of support of the fuzzy numbers is not uniformly bounded. We also consider some necessary and sufficient conditions for laws of large numbers for L-R fuzzy random numbers, and generalize earlier results of Fullér (Fuzzy Sets and Systems 45 (1992) 299-303), Triesch (Fuzzy Sets and Systems 58 (1993) 339-342) and Hong and Lee (Fuzzy Sets and Systems 121 (2001) 537-543).
Formal versus semiformal proof in teaching predicate logic
Authors: David Gries
Venue:  (1996)

This space is left deliberately non-blank 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
Software Process Reuse in an Industrial Setting
Authors: Craig Hollenbach, William Frakes
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

This paper describes a method for creating reusable processes and our experience using them in an industrial environment. A notation and process for creating and tailoring reusable processes is described and applied to the building of a 120 process library at PRC Inc. Initial data collected on use of the library indicates large potential payoffs from process reuse such as a 10 to 1 improvement in the time to develop a project specific process.
Free BSD Unleashed, 2nd Edition, 2 edition
Authors: Adrian R. Tiemann, Michael Urban
Venue:  (2002)

:FreeBSD is a freely available Unix system based on the BSD distribution from the University of California at Berkeley. It is an open source project developed by volunteers all over the world.FreeBSD is extremely robust and powers some of the largest Internet sites in the world, including Yahoo! and the Internet Movie Database. It has also been used for other high-end applications, such as special effects rendering in movies. The special effects in The Matrix were rendered on a cluster of FreeBSD systems.FreeBSD Unleashed, 2/e teaches the reader everything he or she needs to know in order to use FreeBSD to its full potential. It shows individuals how to put to use the same FreeBSD power that many high-profile Internet sites depend on to work. Whether someone needs and enterprise class server, a small business server, or a dependable workstation, this book provides a powerful solution to the reader's needs.
A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors
Authors: Voon-Yee Vee, Wen-Jing Hsu
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

An efficient dynamic storage allocator is important for time-critical parallel programs. In this paper, we present a fast and simple parallel allocator for fixed size block on shared-memory multiprocessors. We show both theoretically and empirically that the allocator incurs very low lock contention. The allocator is tested with parallel simulation applications with frequent allocation and release requests. The results confirm that our allocator is highly efficient and is scalable to more processors.
PC-Based Instrumentation and Control
Authors: Michael H. Tooley
Venue:  (2002)

:Mike Tooley is now widely acknowledged as one of the leading authors of technical books for students. In this completely rewritten book, he explains, using real, working, proven circuit examples, how to select and configure a control system based on readily available software and hardware.
Monitoring reachability in the global multicast infrastructure
Authors: K. Sarac, K. C. Almeroth
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

The multicast infrastructure has transitioned to a topology that now supports hierarchical routing. Instead of a flat virtual topology originally called the Multicast Backbone (MBone) there now exists a hierarchy where routing information is exchanged between autonomous systems (ASes). In today's multicast infrastructure reachability problems are common. Unlike in the MBone, the possibility of limited connectivity between domains is now possible. We present a system called sdr-monitor. This tool collects session directory information from numerous places around the world and presents an application layer view of reachability. Using data collected over the last year, we present an analysis of long term reachability characteristics for the global multicast infrastructure. Our findings are that overall reachability is generally quite poor. However, having identified some of the reasons, we believe there is not a fundamental infrastructure problem, but rather protocol bugs and a lack of management tools.
A complete transformational toolkit for compilers
Authors: Jan A. Bergstra, T. B. Dinesh, J. Field, Jan Heering
Venue:  (1996)

In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program slicing, symbolic evaluation, conditional constant propagation, and dependence analysis. PIM consists of the untyped lambda calculus extended with an algebraic rewriting system that characterizes the behavior of lazy stores and generalized conditionals. A major question left open in the earlier paper was whether there existed a complete equational axiomatization of PIM''s semantics. In this paper, we answer this question in the affirmative for PIM''s core algebraic component, PIMt, under the assumption of certain reasonable restrictions on term formation. We systematically derive the complete PIM logic as the culmination of a sequence of increasingly powerful equational systems starting from a straightforward "interpreter" for closed PIM terms.
NFS/M: An Open Platform Mobile File System
Authors: John C. S. Lui, Oldfield K. Y. So, T. S. Tam
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

With the advancement of wireless network and mobile computing, there is an increasing need to build a mobile file system that can perform efficiently and correctly for accessing online information. Previous system research on mobile file system is based on some experimental platforms. In this paper, we describe the design and implementation of a mobile file system on an open platform, the Linux kernel, and at the same time, our mobile file system is compatible to the popular NFS 2.0 protocol. In this paper, we formally define the file semantics of our mobile file system, which we called the NFS/M. We also specify the conditions of object conflict as well as our conflict resolution algorithms. The NFS/M file system supports client side caching, data prefetching, file system service during the disconnected mode, data reintegration and conflict resolution on various objects (either files or directories). Since the NFS/M is based on an open platform, it serves as a basic building block for developing future mobile computing applications.
The High Cost of Opens in the UNIX Environment
Authors: Rick Floyd, Carla Ellis
Venue:  (1987)

Hierarchically structured file systems modeled after the UNIX file system are rapidly becoming a de facto standard. Understanding and improving the behavior of such file systems has been hampered by a lack of information on the ways in which they are used. In this paper we present a brief description of data on file and directory reference patterns collected from a 4.2BSD UNIX system. We then use these data to investigate the importance of the name lookup overhead involved in opening and using files. We find that, in the absence of caching, name resolution accounts for the majority of the cost of accessing files. Simulations show that whole directory caching is an effective strategy for decreasing this overhead.
Bit-Serial Test Pattern Generation by an Accumulator Behaving as a Non-Linear Feedback Shift Register
Authors: G. Dimitrakopoulos, D. Nikolos, D. Bakalis
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Arithmetic function modules which are available in many circuits can be utilized to generate test patterns and compact test responses. Recently, it was shown that an adder or an accumulator cannot be used as a bit serial test pattern generator due to the poor random properties of the generated sequences. Thus, accumulator-multiplier or adder-multiplier structures have been proposed. In this paper we show that an accumulator behaving, in testmode, as a Non-Linear Feedback Shift Register (NLFSR) can be used efficiently for bit serial test pattern generation. A hardware as well as a software implementation of the proposed scheme is given. The efficiency of the proposed scheme is verified by comparing it against LFSR and other arithmetic function based bit serial test pattern generators.
Neural networks forecasting of endplate steel connections capacity
Authors: L. R. O. de Lima, P. C. G. da S. Vellasco, S. A. L. de Andrade, M. M. B. R. Vellasco
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper proposes the use of artificial neural networks to predict the flexural resistance and initial stiffness of beam-to-column end plate connections. In this work, the Back Propagation supervised learning algorithm has been used. The results of 26 experimental tests (21 for training and 5 for testing) were used, producing satisfactory results. The mean errors obtained were 8.5% and 26% for the prediction of the flexural resistance and the initial stiffness of beam-to-column connections, respectively.
Computing Watermarks from Images Using Quadtrees
Authors: Chin-Chen Chang, Hsien-Chu Wu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Digital watermarking techniques can protect image intellectual property rights efficiently. A new digital watermarking technique is presented in this paper, which can meet all the requirements of the image watermarking. This methodology uses a quadtree to record the information of a protected host image and the related watermark. The quadtree can help the processing of watermark casting and watermark verification successfully. Besides that, from the experimental results, we show that the proposed scheme can robustly recover recognizable watermarks from variety of attacked host images.
Automating Performance Optimization for Script Word Recognition Systems
Authors: Michael Schuessler
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper, we present a system for automating parameter optimization of pattern recognition systems and demonstrate its capabilities on two script word recognition systems. This system, called Optimization Manager, has been specially developed to fit the requirements of optimization in the pattern recognition field, where computation ¿ and engineering ¿ costs for system evaluation are very high. Our experiments show that automatic parameter optimization not only performs the task as well as experienced engineers, thereby relieving them from routine work, but ultimately outperforms hand-tuning also in terms of systemperformance. 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
Priors on network structures. Biasing the search for Bayesian networks
Authors: J. R Castelo Valdueza, Arno P.J.M. Siebes
Venue:  (1998)

In this paper we show how a user can influence recovery of Bayesian Networks from a database by specifying prior knowledge. The main novelty of our approach is that the user only has to provide partial prior knowledge, which is then completed to a full prior over all possible network structures. This partial prior knowledge is expressed among variables in an intuitive pairwise way, which embodies the uncertainty of the user about his/her own prior knowledge. Thus, the uncertainty of the model is updated in the normal Bayesian way.
Electronic-System Design in the Automobile Industry
Authors: Alberto Sangiovanni-Vincentelli
Venue: IEEE Micro (2003)

Electronic components are now essential to control a car's movements and chemical, mechanical, and electrical processes; to provide entertainment and communication; and to ensure safety. A new, platform-based methodology can revolutionize the way a car is designed.
Flash MX Learning Studio, 1 edition
Authors: Ethan Watrall, Norbert Herber
Venue:  (2002)

:Master Flash MX with Interactive Lessons and Hands-On Projects The Flash MX Learning Studio is an interactive hands-on guide to the tools and functionality of Macromedia's amazing vector-based web animation software. Content creation, real-world explanations, and powerful techniques are presented in comprehensive lessons filled with video introductions, narrated interactive presentations, and hands-on projects that make mastering Flash MX simple. Interactive Step-by-Step Lessons Learn at your own pace as your personal instructor guides you through step-by-step lessons with narration, text information, a clickable simulated Flash MX interface, and tons of tips and tricks. Real-World Hands-on Projects Interactive hands-on projects using the Flash MX Learning Studio's unique Show Me, Try Me, Test Me feature allows you to practice by clicking through a simulated Flash MX interface. Show Me Watch as your personal instructor leads you through an animated sequence of steps to help you master Flash MX techniques and learn the fundamentals of creating interactive web animations Try Me After watching and listening to the Show Me module, practice in a simulated Flash MX interface. Your instructor guides you through the proper steps by showing you where to click, what to select, and which keys to press. Test Me Now that you have watched the instructor and practiced the steps, it's your turn to show what you have learned. The Test Me module allows you to click through the simulated Flash MX interface, letting you know when you have chosen in the right and wrong steps. Windows System Requirements * Pentium 200 or higher recommended * 64MB RAM * 4x speed CD-ROM drive * 1024x768 screen resolution (or higher), hi-color mode * Windows compatible 16-bit sound card * Windows 95, Windows 98, Windows 2000, Windows ME, Windows NT4.0 + SP4, Windows XP Mac System Requirements * PowerPC G3 233 MHz or higher * 64 MB RAM * 4x speed CD-ROM drive * 1024x768 screen resolution (or higher), thousands of colors * Mac OS 8 or above Flash MX is not included. Flash MX is not required to use this training software. Meet the Instructor Your personal Flash MX technical trainer, Ethan Watrall, will talk you through each detailed lesson at your own pace. Ethan is an archaeologist by training. He is the author of numerous web-related books and he teaches web and interactive design at Ivy Tech State College in Bloomington and Columbus, Indiana.
A Prefetching Protocol Using Client Speculation for the WWW
Authors: Azer Bestavros, Carlos Cunha
Venue:  (1995)

Abstract In an earlier paper, the potential of speculation (server-initiated prefetching) in distributed information systems (such as the WWW) was investigated and shown to be effective in reducing service time and server load. This speculation was based on statistical information that the server maintains for each document it serves. In this paper we study the performance of a client-initiated prefetching protocol, whereby speculation is based on past user-specific access patterns. In this paper we present results of trace-driven simulation experiments we performed using extensive user traces.
Reducing the cost of regression testing by semantics guided test case selection
Authors: D. Binkley
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Software maintainers are faced with the task of regression testing: retesting a modified program on a (large) number of test cases. The cost of regression testing can be reduced if old test cases and old test results can be reused. Reuse avoids the costly construction of new test cases and the unproductive rerunning of existing test cases when it can be guaranteed that the modified and original programs will produce the same results. An algorithm that uses language semantics to provide such a guarantee is presented. This algorithm uses semantic (not syntactic) differences and similarities between the old and new programs. The algorithm is based on the notion of common execution patterns, which is the interprocedural extension of equivalent execution patterns. Program components with common execution patterns are computed using a new type of interprocedural slice called a calling context slice. Whereas an interprocedural slice includes the program components necessary to capture all possible executions of a statement, a calling context slice includes only those program components necessary to capture the execution of a statement in a particular calling context (i.e., a particular call to the procedure).