ppxscal/embedding_network huggingface dataset:
RHCE Red Hat Certified Engineer Linux Study Guide (Exam RH302), Third Edition, 3 edition
Authors: Michael Jang
Venue:  (2002)

:The only classroom-based training and self-assessment system! Osborne's RHCE Red Hat Certified Engineer Linux Study Guide, Third Edition provides 100% complete coverage of all objectives for exam RH302. Based on 300,000+ hours of IT training experience, the book contains hundreds of practice exam questions and hands-on exercises. The CD-ROM features full practice exam software with interactive tutorials and lab simulations, plus an adaptive test engine.The Only Certification Study System Based on 300,000+ Hours of IT Training Experience100% Complete CoverageAll official test objectives for exam RH302 are covered in detail Hands-on ExercisesStep-by-step instruction modeled after classroom labs Exam WatchWarnings based on thorough post-exam research identifying the most troublesome exam topics and how to answer them correctly Three Types of Practice QuestionsKnowledge, scenario, and lab-based questions, all with in-depth answers Full coverage of the topics you need to review, including how to:Select an installation class and determine required disk space Add, delete, and modify user accounts Configure the filesystem Configure masquerading and firewalls with iptables Perform the following administrative tasks: creating quotas, setting up cron jobs, and editing configuration files Handle kernel recompilation and installation Configure and troubleshoot the X Window System Implement network services, including Apache, Samba, NFS, and DNS Configure NIS (Network Information System) clients Implement the Red Hat User Private Group scheme Boot into and use the rescue environment for system recovery Included on the CD-ROM:CD Training (Linux compatible)Practice ExamPaper & pencil test features three-part multiple choice, debugging, and installation exam Electronic bookSearchable version of the Study Guide Master ExamExam SimulationExclusive RH302 certification exam simulation with questions found only on the CD-ROM (Windows compatible) Detailed AnswersExplain why the corre options are right and why the incorrect options are wrong Score ReportProvides overall assessment of performance and indicates subject areas requiring further study PLUS:(with free on-line registration)MasterExamAdditional RHCE certification exam simulation download
On the Intersection of Maximal Partial Clones and the Join of Minimal Partial Clones
Authors: L. Haddad, H. Machida, I. G. Rosenberg
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Let A be a non-singleton finite set and M be a family of maximal partial clones with trivial intersection over A. What is the smallest possible cardinality of M? Dually, if F is a family of minimal partial clones whose join is the set of all partial functions on A, then what is the smallest possible cardinality of F? The purpose of this note is to present results relate d to these two problems and established in [10].
Maintaining Strong Cache Consistency in the World-Wide Web
Authors: C. Liu, P. Cao
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

As the Web continues to explode in size, caching becomes increasingly important. With caching comes the problem of cache consistency. Conventional wisdom holds that strong cache consistency is too expensive for the Web, and weak consistency methods such as Time-To-Live (TTL) are most appropriate. The article compares three consistency approaches: adaptive TTL, polling-every-time, and invalidation, using prototype implementation and trace replay in a simulated environment. Our results show that invalidation generates less or a comparable amount of network traffic and server workload than adaptive TTL and has a slightly lower average client response time, while polling-every-time generates more network traffic and longer client response times. We show that, contrary to popular belief, strong cache consistency can be maintained for the Web with little or no extra cost than the current weak consistency approaches, and it should be maintained using an invalidation based protocol.
Biological reef survey using spot satellite data classification by cellular automata method - Bay of Mont Saint-Michel (France)
Authors: Yvette Marchand, Renaud Cazoulat
Venue: Computers Geosciences (2003)

A reef called "Les Hermelles" occurs in the intertidal zone of the Bay of Mont Saint-Michel (Normandy, France). The reef is composed of the sea-worm Sabellaria alveolata and thus, is one of the northernmost biological reefs in the world. To map Les Hermelles in the field is difficult because of its great distance from the coastline and its brief exposure to the air. Consequently, the last map dates back to 1980. In 1984, mussel farms were developed around the reef. Since then, they are often regarded as the factor responsible for the perceived decline of the reef. The main goal of the study was to assess the possibility of mapping Les Hermelles using satellite imagery and if so, to give a rough idea about its recent evolution since the 1980 map. A multi-spectral SPOT image satellite was used for the tests. Areas of reef, sand, silt, mud and sea-water show similar spectral signatures. Moreover, these environments are often mixed within a single pixel. Consequently visual interpretation and the usual classification approaches failed, showing interclass confusion. A new classification based on cellular automata appears to be promising. Applied to the example of Les Hermelles, this method was successful and showed a certain stability of the reef dynamic tendencies since 1980. Although the preliminary results have to be securely based on field data acquired close to the satellite-image date, they already confirm the key role that sandbars play in the reef dynamics whereas the role of the mussel farms remains unclear if not null. The classification by cellular automata presents the advantage that no supervision is required, and that spectral and geographical information are both used together.
A distributed connection manager interface for web services on IBM SP systems
Authors: Yew-Huey Liu, P. Dantzig, C. E. Wu, L. M. Ni
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In essence, the World Wide Web is a worldwide string of computer databases using a common information retrieval architecture. With the increasing popularity of the World Wide Web, more and more functions have been added to retrieve not only documents written in HTML (Hypertext Markup Language), but also those in other forms through the Common Gateway Interface (CGI), by constructing HTML documents dynamically. Dynamic construction of HTML documents for handling information such as digital libraries is slow and requires much more computer power. A significant performance bottleneck is the initialization and setup phase for a CGI process to gain access to the system containing the data. In this paper we describe the design and implementation of a Connection Manager Interface on IBM SP systems. The Connection Manager provides cliette processes to serve CGI requests and eliminates such bottlenecks. An IBM SP system is used for this emerging area to show that our design and implementation is flexible enough to take advantage of the High-Performance Switch in an IBM SP system. We trace and monitor this scalable Web services using UTE (Unified Trace Environment) tools, and present its performance analysis and visualization.
Value constraints in the CLP scheme
Authors: Maarten H. Emden
Venue:  (1996)

This paper addresses the question of how to incorporate constraint propagation into logic programming. A likely candidate is the CLP scheme, which allows one to exploit algorithmic opportunities while staying within logic programming semantics. CLP($\cal R$) is an example: it combines logic programming with the algorithms for solving linear equalities and inequalities. In this paper we describe two contrasting constraint store management strategies within the CLP scheme. One leads to CLP($\cal R$), while the other, which we call value constraints, supports consistency methods such as arc consistency and interval constraints. In value constraints, the infer step of the CLP scheme is the application of a consistency operator acting on the active constraints. We show how the continued application of the infer step can be optimized and that such optimization is equivalent to the Waltz algorithm for constraint propagation. Using the Lassez-Maher fixpoint theory of chaotic iterations, we show that the Waltz algorithm does not necessarily converge to a fixpoint, but that it does so in the finitary case.
Averaging procedures in defuzzification processes
Authors: Eugene Roventa, Tiberiu Spircu
Venue: Fuzzy Sets and Systems (2003)

Defuzzification is the ultimate step in approximate reasoning, consisting in the replacement of a fuzzy set with a suitable crisp value. This process is decomposed in two steps: first, replacing a fuzzy set by a crisp set, then replacing the obtained crisp set by a single value. We investigate the natural conditions the first replacement--called averaging procedure--should satisfy. Some interesting examples are given. The compatibility of averaging procedures with algebraic and order structures is studied. The algebraic structure of the set of averaging procedures is investigated.
Fractal traffic: measurements, modelling and performance evaluation
Authors: R. G. Addie, M. Zukerman, T. Neame
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Observations of both Ethernet traffic and variable bit rate (VBR) video traffic have demonstrated that these traffics exhibit "self-similarity" and/or infinite asymptotic index of dispersion for counts (IDC). We report here on measurements of traffic in a commercial public broadband network where similar characteristics have been observed. For the purpose of analysis and dimensioning of the central links of an ATM network we analyse in this paper the performance of a single server queue fed by Gaussian traffic with infinite IDC. The analysis lends to an approximation for the performance of a queue in which the arriving traffic is "fractal" Gaussian and consequently where there does not exist a dominant negative-exponential tail. The term "fractal" is used here in the sense that the autocovariance of the traffic exhibits self-similarity, that is to say, where the autocovariance of an aggregate of the traffic is the same, or asymptotically the same for large time lags, as the original traffic. We are not concerned with proving or exploiting this self-similarity property as such, but only with performance analysis techniques which are effective for such processes. In order to be able to test the performance analysis formulae, we show that traffic with the same autocovariance as measured in a real network over a wide range of lags (sufficiently wide a range for the traffic to be equivalent from the point of view of queueing performance) can be generated as a mixture of two Gaussian AR(1) processes. In this way we demonstrate that the analytic performance formulae are accurate.
Large-Scale Software Architecture: A Practical Guide using UML
Authors: Jeff Garland, Richard Anthony
Venue:  (2002)

:Software architecture is critical to the success of software development projects. Unfortunately, many projects are unsuccessful in their attempts to leverage architecture-based development, especially large-scale projects. Lost in a myriad of possible UML diagrams, project teams often resort to ineffective ad-hoc techniques.The purpose of this book is to enable software architects, their managers, and other development team members to become more effective in directing the course of large-scale software development projects. Written by two experienced architects that have worked in the trenches on many projects, this book provides practical advice for all software teams about developing and capturing critical software architectural concerns.Leveraging the recent IEEE standard on software architecture and using UML compatible with versions 1.4 and 2.0 this book describes a series of viewpoints for capturing the software architecture and related concerns. These viewpoints convey essential information to users, stakeholders and other members of the development team.Large-Scale Software Architecture covers:a series of UML based viewpoints for capturing software architecture and related concernsuseful techniques for development of software architecturesthe roles and responsibilities of the software architect and the architecture teamtraps and pitfalls of architecture developmentutilization of reusable and off-the-shelf software frameworks and componentsWhether managing, designing, developing or architecting large and complex systems, you will better understand how the software architecture can be captured and represented using this book.
Structural and Behavioral Modeling with Monadic Logics
Authors: Abdelwaheb Ayari, David Basin, Stefan Friedrich
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Logic offers the possibility of modeling and reasoning about hardware and software. But which logic? We propose monadic logics of strings and trees as good candidates for many kinds of discrete systems. These logics are natural, decidable, yet substantially more expressive, extensions of Boolean logic. We motivate their applicability through examples.
MOUS: Office XP Study Guide
Authors: Gini Courter, Annette Marquis
Venue:  (2002)

:Here's the book you need to prepare for the seven MOUS exams employers are demanding the mostWord 2002 Core, Word 2002 Expert, Excel 2002 Core, Excel 2002 Expert, PowerPoint 2002 Core, Outlook 2002 Core, Access 2002 Core In-depth coverage of official exam objectives Clear explanations of complex Office tasks Practical examples and detailed instructions Authoritative coverage of all exam objectives, including: Word Core and Expert Inserting and Modifying Text Creating and Modifying Paragraphs and Tables Formatting and Managing Documents Creating and Modifying Graphics Using Mail Merge Excel Core and Expert Working with Cells and Cell Data Managing and Modifying Workbooks Creating and Revising Formulas Importing and Exporting Data Analyzing and Summarizing Data PowerPoint Core Creating and Modifying a Presentation Inserting and Modifying Text and Visual Elements Working with Data from Other Sources Managing and Delivering Presentations Workgroup Collaboration Access Core Creating and Using Databases and Tables Creating and Modifying Queries Creating and Modifying Forms Defining Relationships Producing Reports Outlook Core Creating and Viewing Messages Scheduling Managing Messages Creating and Managing Contacts, Tasks, and Notes About the Authors Gini Courter and Annette Marquis are co-owners of TRIAD Consulting, LLC, a firm specializing in computer applications training and database development, including customized solutions using Microsoft Outlook and Microsoft Exchange Server. Courter and Marquis are the authors of numerous books, including Mastering Microsoft Office 2000 Premium Edition and Mastering Microsoft Outlook 2000, both from Sybex.
New Techniques for Replay Debugging
Authors: Daniel B. Price
Venue:  (1998)

Many systems have implemented replay of parallel or sequential processes, but none have provided a robust set of debugger tools that take advantage of this power. This paper develops new ideas about how software instruction counters can be used by programmers to facilitate debugging applications under replay. This paper is the discussion of the author''s project for Honors in the degree of Bachelor of Science under the direction of Professor Robert H.B. Netzer. 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
Phase Transitions in the Multicomponent Widom--Rowlinson Modeland in Hard Cubes on the BCC--Lattice
Authors: P. Nielaba, J. L. Lebowitz
Venue:  (1997)

We use Monte Carlo techniques and analytical methods to study the phase diagram of the $M$--component Widom--Rowlinson model on the bcc--lattice: there are $M$ species all with the same fugacity $z$ and a nearest neighbor hard core exclusion between unlike particles. Simulations show that for $M \geq 3$ there is a ``crystal phase'''' for $z$ lying between $z_c(M)$ and $z_d(M)$ while for $z < z_d(M)$ there are $M$ demixed phases each consisting mostly of one species. For $M=2$ there is a direct second order transition from the gas phase to the demixed phase while for $M \geq 3$ the transition at $z_d(M)$ appears to be first order putting it in the Potts model universality class. For $M$ large, Pirogov-Sinai theory gives $z_d(M) \sim M-2+2/(3M^2) + ... $. In the crystal phase the particles preferentially occupy one of the sublattices, independent of species, i.e.\ spatial symmetry but not particle symmetry is broken. For $M \to \infty$ this transition approaches that of the one component hard cube gas with fugacity $y = zM$. We find by direct simulations of such a system a transition at $y_c \simeq 0.71$ which is consistent with the simulation $z_c(M)$ for large $M$. This transition appears to be always of the Ising type.
A User Interface for Distributed Multimedia Database Querying with Mediator Supported Refinement
Authors: Isabel F. Cruz, Kimberly M. James
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The Delaunay MM system supports an interactive, customizable interface for querying multimedia distributed databases, like Digital Libraries. Through this interface, users select virtual document styles that cater the display of query results to their needs, while also offering transparent pre- and post-query refinement and nested querying. Delaunay MM 's virtual documents preserve context by maintaining a single customizable interface for result viewing. The advanced transparent query features rely on mediation to provide adept access to information. In this paper, we present the framework for Delaunay MM , its architecture, the user interface, and results of the first usability study.
Broadcast Communication Delay Metric for the iPSC/2 and iPSC/860 Hypercubes
Authors: C. L. McCreary, M. E. McArdle, J. D. McCreary
Venue:  (1991)

When determining the granularity of a program to be executed in parallel, it is important to have valid information on the cost of communication for the system on which the program is to be run. Previous studies have measured the node-to-node communication performance on the Intel Hypercube systems. This work measures the performance of multicast communication on the Intel iPSC/2 and iPSC/860 hypercubes and derives equations modelling the cost of broadcast communication.
Building decision tree classifier on private data
Authors: Wenliang Du, Zhijun Zhan
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

This paper studies how to build a decision tree classifier under the following scenario: a database is vertically partitioned into two pieces, with one piece owned by Alice and the other piece owned by Bob. Alice and Bob want to build a decision tree classifier based on such a database, but due to the privacy constraints, neither of them wants to disclose their private pieces to the other party or to any third party.We present a protocol that allows Alice and Bob to conduct such a classifier building without having to compromise their privacy. Our protocol uses an untrusted third-party server, and is built upon a useful building block, the scalar product protocol. Our solution to the scalar product protocol is more efficient than any existing solutions.
Assessing Software Reliability Performance Under Highly Critical But Infrequent Event Occurrences
Authors: M. S. Alam, W. H. Chen, W. K. Ehrlich, M. E. Engel, D. A. Kropfl, P. Verma
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Operational testing is expensive and time consuming in applications with highly critical but infrequent event occurrences and procedures are needed for obtaining valid software reliability estimates. Two such procedures are accelerated stress testing and experimental design techniques. Examples of accelerated stress in software testing include: a higher request arrival rate, increasing data traffic "burstiness", and so on. Furthermore, when the software is tested by executing the system under emergency conditions or exception events, it is critical that experimental design techniques are used to obtain a balanced sequence of tests that accounts for "carry over" effects and other trends in failure performance. An application of software reliability testing of a telecommunication system Node Controller is used to describe the issues and our overall approach to software reliability assessment. The reliability projections based on our approach are compared to reliability estimates derived analytically and through simulation. Our results suggest that these statistical techniques are useful techniques for measuring reliability performance under critical events that have a low probability of occurrence.
The seven golden rules for producing language-independent standards
Authors: B. L. Meek
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Language independent standards have been subjected to hostile criticism in recent years, which makes it vital that the quality of the work is as high as possible. General principles of language independent standardization are presented, in the form of five rules applicable to all standardization leading to "seven golden rules" for language independent standardization specifically.
Planarity in ROMDDs of multiple-valued symmetric functions
Authors: J. T. Butler, J. L. Nowlin, T. Sasao
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We show that a multiple-valued symmetric function has a planar ROMDD (reduced ordered multiple-valued decision diagram) if and only if it is a pseudo-voting function. We show that the number of such functions is (r-1)(n+r, n+1) where r is the number of logic values and n is the number of variables. It follows from this that the fraction of symmetric multiple-valued functions that have planar ROMDDs approaches 0 as n approaches infinity. Further, we show that the worst case and average number of nodes in planar ROMDDs of symmetric functions is n/sup 2/(1/2-1/2r) and n/sup 2/(1/2-1/(r+1)), respectively, when n is large.
A Block or Factorization Scheme for Loosely Coupled Systems of Array Processors
Authors: Charles Van Loan
Venue:  (1986)

A statically scheduled parallel block QR factorization procedure is described. It is based on ``block'''' Givens rotations and is modeled after the Gentleman-Kung systolic QR procedure. Independent tasks are associated with each block column. ``Tallest possible'''' subproblems are always solved. The method has been implemented on the IBM Kingston LCAP-1 system which consists of ten FPS-164/MAX array processors that can communicate through a large shared bulk memory. The implementation revealed much about the tradeoff between block size and load balancing. Large blocks make load balancing more difficult but give better 164/MAX performance and less shared memory traffic. The results obtained indicate that our approach to parallelizing the QR factorization is competitive for very large problems, e.g. of the order 5000-by-1000.