ppxscal/embedding_network huggingface dataset:
Troubleshooting the PC: With A+ Preparation, 2nd edition
Authors: Patrick E. Regan
Venue:  (2002)

:This book provides real-world coverage of PC troubleshooting and coverage of the topics required to pass the A+ PC technician exam. It shows readers how to become successful PC technicians by offering comprehensive coverage of both old and new technology and plenty of real-world applications. Chapter topics include A PC overview, basic electronics, the disassembly and assembly of the PC, microprocessors, RAM, motherboards, the expansion slots and cards, the case and power supply, the hard drive, the floppy drive and other removable media, the compact disk drive, the disk structure, tape drives and data protection, the video system, input devices, sound cards, serial ports and modems, parallel ports and printers, MS-DOS, Windows 3.XX, Windows 9X, Windows NT, family operating systems, and computers connected to a network. For future PC techniciansespecially those preparing for the A+ Certification exam.
From ternary relationship to relational tables: a case against common beliefs
Authors: Rafael Camps Paré
Venue: ACM SIGMOD Record (2002)

The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, without adding other restrictions than candidate keys and elementary inclusion dependencies.
Designing and deploying an information awareness interface
Authors: J. J. Cadiz, Gina Venolia, Gavin Jancke, Anoop Gupta
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

The concept of awareness has received increasing attention over the past several CSCW conferences. Although many awareness interfaces have been designed and studied, most have been limited deployments of research prototypes. In this paper we describe Sideshow, a peripheral awareness interface that was rapidly adopted by thousands of people in our company. Sideshow provides regularly updated peripheral awareness of a broad range of information from virtually any accessible web site or database. We discuss Sideshow's design and the experience of refining and redesigning the interface based on feedback from a rapidly expanding user community.
Verification of attribute grammar
Authors: Takuya Katayama, Yutaka Hoshino
Venue: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1981)

Verification of attribute grammar is discussed. As is widely recognized, attribute grammar of Knuth [8] is a very convenient device to describe semantics of programming languages, especially in automating compiler construction. Many efforts have been made to obtain efficient evaluators for attribute grammar [1,3,4,5,7,10] so that efficient compilers may be produced from the semantic specifications written in the attribute grammar.There is another important problem about the semantic specifications. This is how to verify the correctness of the specification and is essential in ascertaining the correctness of produced compilers. In contrast with the evaluation problem, this has not been studied well and only a few partial results have been reported up to now [2,9].In this paper we propose a verification procedure for proving the correctness of attribute grammar, which is applicable to the wide class of attribute grammars called absolutely noncircular ones [7]. Our method can be extended to accept any noncircular attribute grammar since it is shown that any noncircular attribute grammar is transformed into an equivalent absolutely noncircular one [5].Our verification procedure utilizes dependency relations among attributes and verification is performed by induction based on this order relation, according to which attributes are evaluated. This procedure consists of (1) assigning assertions to relevant pairs of a nonterminal symbol and a parallelly evaluable subset of its attributes, (2) generating a set of verification conditions for each production rule with the aid of dependency graph of the rule and (3) proving the verification conditions. Of course, verification is performed production-rule-wise.Our method can accept attribute grammars which contain both synthesized and inherited attributes and handle them in a well-formed way. This contrasts to the previous works where only the synthesized case is considered [2] or there seems no general and formal descriptions about how to verify general attribute grammars [9].In this paper we first give necessary definitions and notations for attribute grammar and then propose a verification procedure to prove its correctness. After giving some examples of verification, we establish consistency and completeness of our procedure.
The bug that destroyed a rocket
Authors: Mordechai Ben-Ari
Venue: ACM SIGCSE Bulletin (2001)

In the 2000 December issue of inroads, Michael Williams suggested that the failure of the Ariane 5 rocket launch could be used as a case study in teaching programming concepts. Here is an article I wrote several years ago in which I present the story of the Ariane 5 in terms used to teach introductory computer science.
A Practical Guide to the MPI Clean-up: Step one in Creating Your Enterprise MPI, 1st edition
Authors: Maida Reavis Herbst, June Muniz
Venue:  (1998)

:Health care organizations today must have a master patient index (MPI) that is free of duplicate records. In order to achieve a clean MPI, A Practical Guide to the MPI Cleanup: Step One in Creating Your Enterprise MPI is the key. A clean MPI: increases the efficiency and accuracy of patient registrations reduces errors improves patient care by ensuring accurate, up-to-date patient information supports compliance with the standards of accreditors organizations and regulators, such as the JCAHO and the Medicare Conditions of Participation lays the groundwork for an enterprise MPI A Practical Guide to the MPI Cleanup explains the essentials of an MPI cleanup and provides detailed, step-by-step instructions for planning and carrying out MPI cleanup efforts. The areas covered include: how to assess the error rate in an MPI what resources are needed to carry out the MPI cleanup who should be involved in the MPI cleanup how the MPI cleanup affects other areas of an organization how to maintain the integrity of a clean MPI how to prepare for an enterprise MPI how to write requests for proposal when contracting with a vendor for the MPI cleanup
Remote access to large spatial databases
Authors: Egemen Tanin, František Brabec, Hanan Samet
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of online spatial data is a challenging task. We propose two efficient approaches to remote access to large spatial data. First, we introduce a client-server architecture where the work is distributed between the server and the individual clients for spatial query evaluation, data visualization, and data management. We enable the minimization of the requirements for system resources on the client side while maximizing system responsiveness as well as the number of connections one server can handle concurrently. Second, for prolonged periods of access to large online data, we introduce APPOINT (an Approach for Peer-to-Peer Offloading the INTernet). This is a centralized peer-to-peer approach that helps Internet users transfer large volumes of online data efficiently. In APPOINT, active clients of the client-server architecture act on the server's behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions.
Law of Electronic Commerce, 3rd edition
Authors: Benjamin Wright, Jane Kaufman Winn
Venue:  (1998)

:The volume of trade done through electronic media continues to skyrocket, and the law evolves at a staggering rate. To keep pace with all the new cases, statutes, proposals, commentaries, and model laws, there is no better resource than the new edition of THE LAW OF ELECTRONIC COMMERCE  your guide to the implications of communications technology for commercial law and transactions. You'll find indepth, uptotheminute analysis and coverage of: Security, including digital signatures, encryption, and biometrics Internet commerce issues including domain name conflicts and shrinkwrap agreements Traditional contract principles in the electronic environment, including the statute of frauds and the battle of the forms Electronic records in litigation, including authentication, the best evidence rule, and special hearsay problems Recordkeeping, including state and federal laws in areas such as taxation, banking, securities, and health care Liability of service providers, confidentiality and control of data, and state and federal regulation of electronic marketsAnd many more.
Internet Directory for Dummies with Cdrom, 3rd edition
Authors: Brad Hill
Venue:  (1999)

:With concise reviews and an easy-to-read design, Internet Directory For Dummies takes the hassle out of Web surfing by listing the best sites on the World Wide Web. Net-savvy author Brad Hill shows you the best sites for news, sports, entertainment, shopping, and much more. And to make your Web browsing even easier, the bonus CD contains the URLs for every Web site reviewed in this book, so you're only a double-click away from the best info on the Net! Inside, find helpful advice that lets you Search for cool Web sites with the informative Micons (mini icons) Discover funny and unusual corners of the Web Find Internet resources that are fun and safe for the whole family Discover the best places to go for information on sports Access information on your favorite hobbies and pastimes Get up-to-the-minute news and weather from around the world
Network game traffic modelling
Authors: Johannes Färber
Venue: Proceedings of the 1st workshop on Network and system support for games (2002)

A significant share of today's Internet traffic is generated by network gaming. This kind of traffic is interesting in regard to it's market potential as well as to it's real time requirements on the network. For the consideration of game traffic in network dimensioning, traffic models are required that allow to generate a characteristic load for analytical or simulative performance evaluation of networks. In this paper we evaluate the fast action multiplayer game ,,Counter Strike" from a 36 hour LAN party measurement and present traffic models for client and server. The paper concludes with remarks on the use of game traffic models in simulations and on QoS metrics for an adequate evaluation of simulation results.
Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
Authors: Martin H. Gutknecht, Zdenvek Strakos
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

It has been widely observed that Krylov space solvers based on two three-term recurrences can give significantly less accurate residuals than mathematically equivalent solvers implemented with three two-term recurrences. In this paper we attempt to clarify and justify this difference theoretically by analyzing the gaps between recursively and explicitly computed residuals.It is shown that, in contrast with the two-term recurrences analyzed by Sleijpen, van der Vorst, and Fokkema [ Numer. Algorithms, 7 (1994), pp. 75--109] and Greenbaum [SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535--551], in the two three-term recurrences the contributions of the local roundoff errors to the analyzed gaps may be dramatically amplified while propagating through the algorithm. This result explains, for example, the well-known behavior of three-term-based versions of the biconjugate gradient method, where large gaps between recursively and explicitly computed residuals are not uncommon. For the conjugate gradient method, however, such a devastating behavior---although possible---is not observed frequently in practical computations, and the difference between two-term and three-term implementations is usually moderate or small. This can also be explained by our results.
Dynamics of Link Failure Events in Network Markets
Authors: Giorgos Cheliotis, Chris Kenyon
Venue: Netnomics (2002)

We present a computational model and simulation results on the dynamics of local link failures in markets with network structure. Bandwidth markets are inherently networked, so we focus on telecommunications here. The objective of this paper is to test whether or not network failures will have serious economic consequences. We measure economic consequences by looking at changes in expected bandwidth prices, changes in value-at-risk (VAR) and in conditional-value-at-risk (CVAR). Bandwidth markets may be particularly sensitive to network failures because bandwidth is a non-storable commodity. On the other hand alternative paths with equivalent quality of service (QoS) are perfect substitutes so this may limit sensitivity. Non-storability has contributed to enormous volatility in deregulated electricity prices and observations of enormous price spikes. Bandwidth is a true network commodity in that links in the network itself are the traded commodities. Thus a local failure can affect alternative equivalent paths and this can have a knock-on effect in turn. We used a spot market model incorporating non-storability and alternative path selection on price grounds and limited by QoS-equivalence. Spike models are incorporated based on empirical data. We found that for a realistic large-scale market topology if there are, say, four failures per link per year, half of which are long enough to affect the market, then: expected link prices are increased 12%; VAR is increased by 30%; and CVAR by 40%. This is even with a spike size (&times;3) that is modest compared to observations in electricity markets (&times;10&ndash;&times;100). For market participants with capacity positions in such a market these consequences are likely to be serious. Thus if failures occur at this rate their consequence must be included in planning. Furthermore, whilst at low failure intensities the network acts as a dampening factor, at higher intensities it acts as an amplifier and thus cannot be neglected. We believe this amplification to be an emergent phenomenon of any market with network structure, although clearly more important for markets with no storage.
Sending objects across platforms: herewith are some very handy classes for moving your objects around a network
Authors: Fabio Lopiano
Venue: C/C++ Users Journal (2001)

The number of applications written for communicating across multiple computing platforms and environments on a network continues to grow. A common problem in developing client/server, e-commerce, distributed, and other networked applications is the conversion of data from host to network format and vice versa. The non-standard (but commonly available) functions ntoh and hton help to deal with this marshalling problem. Unfortunately, these functions can be tedious to invoke for every data member of every object (and its subobjects) that need to be transmitted or received.This article demonstrates a technique to bridge the host/network/host chasm, which uses hton and ntoh in a more elegant way. It also shows how this technique can be extended to develop a framework for the rapid implementation of complex communication protocols.
Multiresolution green's function methods for interactive simulation of large-scale elastostatic objects
Authors: Doug L. James, Dinesh K. Pai
Venue: ACM Transactions on Graphics (TOG) (2003)

We present a framework for low-latency interactive simulation of linear elastostatic models, and other systems arising from linear elliptic partial differential equations, which makes it feasible to interactively simulate large-scale physical models. The deformation of the models is described using precomputed Green's functions (GFs), and runtime boundary value problems (BVPs) are solved using existing Capacitance Matrix Algorithms (CMAs). Multiresolution techniques are introduced to control the amount of information input and output from the solver thus making it practical to simulate and store very large models. A key component is the efficient compressed representation of the precomputed GFs using second-generation wavelets on surfaces. This aids in reducing the large memory requirement of storing the dense GF matrix, and the fast inverse wavelet transform allows for fast summation methods to be used at run-time for response synthesis. Resulting GF compression factors are directly related to interactive simulation speedup, and examples are provided with hundredfold improvements at modest error levels. We also introduce a multiresolution constraint satisfaction technique formulated as a hierarchical CMA, so named because of its use of hierarchical GFs describing the response due to hierarchical basis constraints. This direct solution approach is suitable for hard real-time simulation since it provides a mechanism for gracefully degrading to coarser resolution constraint approximations. The GFs' multiresolution displacement fields also allow for run-time adaptive multiresolution rendering.
On the Distance between Two Ellipsoids
Authors: Anhua Lin, Shih-Ping Han
Venue: SIAM Journal on Optimization (2002)

We study the fundamental geometric problem of finding the distance between two ellipsoids. An algorithm is proposed for computing the distance and locating the two closest points. The algorithm is based on a local approximation of the two ellipsoids by balls. It is simple, geometric in nature, and has excellent convergence properties.
A Necessary and Sufficient Condition for Bounded-Input Bounded-State Stability of Nonlinear Systems
Authors: Andrea Bacciotti, Luisa Mazzi
Venue: SIAM Journal on Control and Optimization (2000)

The main purpose of this work is to prove a converse theorem for bounded-input bounded-state stability of nonlinear systems in the framework of Liapunov's second method. The construction gives rise to an upper semicontinuous time-dependent Liapunov function. In certain cases, the monotonicity conditions can be checked by means of contingent directional derivatives.
Mastering NetWare 5.1
Authors: James E. Gaskin
Venue:  (2000)

:Here's the industry's most comprehensive guide to NetWare 5.1 networks. In practical, readable discussions, NetWare expert James Gaskin shows you how to integrate NetWare 5.1 into an existing NetWare environment, how to build a NetWare network from scratch, and how to use NetWare 5.1's new features for application serving and e-commerce. You'll learn how to handle network planning, installation, and migration; integrate NetWare with NT and Unix; manage internetworking protocols; and install and expand NDS. Gaskin shows you how to make the most of NetWare's powerful features, including the migration gateway that allows for seamless IP/IPX coexistence, the ConsoleOne Java interface, Novell Storage Services, and Novell Distributed Print Services. This book includes hundreds of illustrations, tips, and an essential troubleshooting guide.
Winners, Losers & Microsoft; Competition and Antitrust in High Technology, 1st edition
Authors: Stanley J. Liebowitz, Stephen E. Margolis
Venue:  (1999)

From the Book:In what for many readers will be the most exciting portion of the book, the authors go on to examine histories of alleged market failures, starting with QWERTY. Were producers and consumers actually locked into inferior market solutions? And if not, what devices were employed to escape the supposed trap? I will say no more on this topic here, so as not to take the edge off the authors' accounts of the creativity and ingenuity displayed by both suppliers and consumers in the competitive battle for critical mass. ....The fascinating history and analysis in Winners, Losers and Microsoft can guide us toward a better understanding of the newer forms of competition that have been mainly responsible for the success of the modern American economy in recent decades. Jack Hirshleifer, Professor of Economics; University of California, Los Angeles
Manual of Online Search Strategies, 2nd Ed., 2nd edition
Authors: Chris J. Armstrong, Andy Large
Venue:  (1992)

:One of the most dramatic changes which have occurred since the first edition appeared in 1988 is the emergence of CD-ROM as a major publishing medium for databases. Therefore, due attention is now paid to the problems of searching databases on CD-ROM as well as online. Other changes have inevitably affected some chapters of the book more than others. In a few instances, indeed, they have prompted structural changes in the new edition. Two chapters found in the first edition are no longer included in this volume. Full-text journals are now encountered in growing numbers in many subject fields and are best dealt with in subject-based chapters rather than separately as in the first edition. At the same time, interactive electronic journals such as BLEND have not yet emerged from the research environment into the commercial world. Likewise, a special chapter on office and home use now seems superfluous with growing end-user searching in many fields. An appendix of databases and the hosts on which they could be found has been scrapped for the more useful tables covering the same information within individual chapters. Overlap between the biological sciences and health sciences prompted a merger of these two fields in the second edition under the title 'The biosciences'. Like the first, this second edition is not intended as an introductory textbook to command-driven, Boolean searching. It is targeted at online searchers who already have some knowledge of command languages and may be proficient searchers on databases in one or two subject areas, but when required to venture into new and less familiar territory still need guidance. It is also offered to end users who possess the subject expertise but lack information retrieval know-how. The Manual is offered as a guide to database selection and a navigational aid through the twists and turns of the retrieval maze; at least some of the dead ends and backtracking may thereby be avoided. This volume, written by experts i
Towards flexible credential verification in mobile ad-hoc networks
Authors: Sye Loong Keoh, Emil Lupu
Venue: Proceedings of the second ACM international workshop on Principles of mobile computing (2002)

Ad-hoc networks facilitate interconnectivity between mobile devices without the support of a network infrastructure. In this paper we propose a flexible credential verification mechanism, which improves the likelihood that participants in an ad-hoc network can verify each other's credentials despite the lack of access to certification and attribute authorities. Users maintain Credential Assertion Statements (CASs), which are formed through extraction of X.509 and attribute certificates into an interoperable XML form. Trusted entities that can verify the credentials listed in the CAS can then issue signed Assertion Signature Statements (ASSs) to other participants in the ad-hoc network. In addition, each user maintains a key ring, which comprises the list of public-keys trusted to sign credential assertion statements. All public-keys in the ring are assigned a trustworthiness level. When a user presents his/her CAS together with matching ASSs to a verifier, the verifier checks the signatures in the ASSs against its key ring to determine whether credentials in the CAS are authentic and acceptable. Transitivity of trust is generally not allowed, but there are exceptional cases in which it is permitted.