ppxscal/embedding_network huggingface dataset:
Introduccion a Los Metadatos: Caminos a la Informacion Digital
Authors: Tony Gill, Murtha Baca, Anne Gilliland-Swetland
Venue:  (1999)

:Now available in Spanish, this book describes the increasing significance of the concept of metadata since the emergence of the World Wide Web as a major research tool across all fields of study. This book defines this little-understood concept, explains its importance and potential uses in the networked environment, and describes existing metadata standards in the field of cultural heritage information.
Shadowing for Nonautonomous Parabolic Problems with Applications to Long-Time Error Bounds
Authors: Alexander Ostermann, Cesar Palencia
Venue: SIAM Journal on Numerical Analysis (2000)

Shadowing results for time discretizations of nonautonomous parabolic evolution equations z'(t) = A(t) z(t) + f(t) are given. The analysis is performed in an abstract Banach space setting of uniformly sectorial operators A(t). Under natural assumptions on the operators A(t), it is shown that the backward Euler discretization of a smooth solution, obtained with constant stepsize h, is Ch-shadowed by a true solution of the system and, vice versa, every smooth trajectory is Ch-shadowed by a suitable backward Euler discretization. This validates numerical computations over long time intervals. It is further explained how these results extend to higher order Runge--Kutta methods.
Algorithm 818: A reference model implementation of the sparse BLAS in fortran 95
Authors: Iain S. Duff, Christof Vömel
Venue: ACM Transactions on Mathematical Software (TOMS) (2002)

The Basic Linear Algebra Subprograms for sparse matrices (Sparse BLAS) as defined by the BLAS Technical Forum are a set of routines providing basic operations for sparse matrices and vectors. A principal goal of the Sparse BLAS standard is to aid in the development of iterative solvers for large sparse linear systems by specifying on the one hand interfaces for a high-level description of vector and matrix operations for the algorithm developer and on the other hand leaving enough freedom for vendors to provide the most efficient implementation of the underlying algorithms for their specific architectures.The Sparse BLAS standard defines interfaces and bindings for the three target languages: C, Fortran 77 and Fortran 95. We describe here our Fortran 95 implementation intended as a reference model for the Sparse BLAS. We identify the underlying complex issues of the representation and the handling of sparse matrices and give suggestions to other implementors of how to address them.
The Big Book of Best Current Practices Rfcs, 1st edition
Authors: Pete Loshin
Venue:  (2000)

:Do you ever wonder how things get done while the Internet Engineering Task Force (IETF) is developing Internet standards? Ever need to know what the "right thing to do" is with regard to your Domain Name Service (DNS)? The right way to set up an Autonomous System (AS) for Internet routing?The IETF decided that the Internet community should have access to that kind of information, and more, in a set of documents called the Best Current Practices (BCP) series. Published simultaneously in the Requests for Comments (RFCs) series, each BCP goes beyond the basic protocol specifications to explain how, not just what, to do over the Internet. This book collects and organizes these essential documents in a single printed volume, adding an introduction and extensive index. This means you no longer have to search through RFC archives in hopes of finding the answer to your questions - all BCPs are compiled here, with an extensive index that makes it simple to locate precisely the answer you need. Features: Address Allocation for Private Internets (BCP 5) Guidelines for creation, selection, and registration of an Autonomous System (AS) (BCP 6) The Internet Standards Process - Revision 3 (BCP 9) Selection and Operation of Secondary DNS Servers (BCP 16) Use of DNS Aliases for Network Services (BCP 17) IETF Working Group Guidelines and Procedures (BCP 25) Anti-Spam Recommendations for SMTP MTAs (BCP 30) Expectations for Computer Security Incident Response (BCP 21) And much more. If you buy only one reference on the way the Internet works from an implementation and organizational perspective, this is the one to choose. Written by members of the Internet Engineering Task Force (IETF), this compilation is complete and authoritative. Pete Loshin started using the Internet in 1988 and has written a dozen books about the Internet, electronic commerce, and TCP/IP. Formerly an editor at BYTE Magazine, he has written articles for Data Communications, Information Security, PC World, PC Magazine, Communication News, PC Week, Telecommunications, and other well-known trade publications.
Playstation RPG Secrets Unauthorized
Authors: Prima Publishing, Chris Jensen
Venue:  (1997)

:Conquer five RPGs with just one book! With this guide master five of the Playstation role-playing games: Final Fantasy VII, Wild Arms, Suikoden, Beyond the Beyond, and Vandal Hearts. You'll get walkthroughs, maps, and expert strategy along with everything you'll need to win!
Creating Business Advantage in the Information Age, 1st edition
Authors: F. Warren McFarlan, Robert D. Austin
Venue:  (2001)

:Harvard Business School Cases are world renowned for their extensive and thorough exploration of strategic issues. We are offering a selection of recent HBS cases with four module introductions as a stand-alone product for the first time to offer greater flexibility for packaging with other MH/Irwin products. This book is written for students and managers who desire an overview of e-business and contemporary information systems technology (IT) management. It explains the relevant issues of effective management of information services activities and highlights the areas of greatest potential application of the technology. No assumptions are made concerning the reader's experience with IT,but it is assumed that the reader has some course work or work experience. This text is comprised of an extensive collection of Harvard Business cases devoted to Information Technology and E-Business.
Design by Numbers
Authors: John Maeda
Venue:  (2001)

:Most art and technology projects pair artists with engineers or scientists: the artist has the conception, and the technical person provides the know-how. John Maeda is an artist and a computer scientist, and he views the computer not as a substitute for brush and paint but as an artistic medium in its own right. Design By Numbers is a reader-friendly tutorial on both the philosophy and nuts-and-bolts techniques of programming for designers and artists. Practicing what he preaches, Maeda composed Design By Numbers using a computational process he developed specifically for the book. He introduces a programming language and development environment, available on the Web, which can be freely downloaded or run directly with any JAVA-enabled Web browser. Appropriately, the new language is called DBN (for "design by numbers"). Designed for "visual" people -- artists, designers, anyone who likes to pick up a pencil and doodle -- DBN has very few commands and consists of elements resembling those of many other languages, such as LISP, LOGO, C/JAVA, and BASIC.
Integrating non-blocking synchronisation in parallel applications: performance advantages and methodologies
Authors: Philippas Tsigas, Yi Zhang
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

In this paper we investigate how performance and speedup of applications would be affected by using non-blocking rather than blocking synchronisation in parallel systems. The results obtained show that for many applications, non-blocking synchronisation lead to significant speedups for a fairly large number of processors, while it never slows the applications down. As part of this investigation this paper also provides a set of efficient and simple translations that show how typical blocking operations found in parallel applications, such as simple locks, queues and lock trees can be translated into non-blocking equivalents that use hardware primitives common in modern multiprocessor systems. With these translations this paper clearly demonstrates that it is easy for the application designer/programmer to replace the blocking operations commonly found on with non-blocking equivalents ones. For the empirical results a set of representative applications running on a large-scale ccNUMA machine were used.
Sams Teach Yourself Microsoft Office 2000 in 21 Days, 1st edition
Authors: Laurie Ulrich, Don Essig, Renee Wilmeth
Venue:  (1999)

:In just 21 days, you'll have all the skills you need to work confidently and efficiently on all your projects within Office 2000. With this complete, project-based tutorial, you'll master the basics and then move on to the more advanced features and concepts and make Word, Excel, PowerPoint, Access, Outlook, Publisher, and even FrontPage work together to create the results you need: Understand the fundamentals of the application suite found in the offices of over 90% of the Fortune 500 Master the new, improved, and advanced features of Office 2000 to get your jobs done quickly and creatively CD-ROM includes a completed version of each day's project for you to use in evaluating your own work and progress, extra sound and graphic files to enhance your work, and third-party programs to make your Office 2000 experience even more productive
From program languages to software languages
Authors: P. Pepper, M. Cebulla, K. Didrich, W. Grieskamp
Venue: Journal of Systems and Software (2002)

In modern Software Engineering it is no longer sufficient to consider "programming" as the task of writing implementations in more or less suited programming languages and adding a more or less accurate documentation. Rather, the amalgamation of various aspects and views into a heterogeneous assembly of coordinated products is required. In this paper we present a vision of such a scenario. This vision is based on experiences with both academic style foundational research and industry-oriented applied research projects.
Oracle Sql*Loader: The Definitive Guide
Authors: Jonathan Gennick, Sanjay Mishra
Venue:  (2001)

:SQL*Loader is a ubiquitous tool in the Oracle world. It has been shipped with Oracle since at least Version 6 and continues to be supported and enhanced with each new version of Oracle, including Oracle8 and Oracle8i. The job of SQL*Loader is to load data from flat files into an Oracle database. It's optimized for loading large volumes of data, and is flexible enough to handle virtually any input format. Almost every Oracle user has to use SQL*Loader at one time or another, and DBAs are frequently called upon to load data for the users in their organization. Despite SQL*Loader's wide availability and usage, few DBAs and developers know how to get the most out of it. Oracle SQL*Loader: The Definitive Guide has everything you need to know to put SQL*Loader to its best use: an introduction to SQL*Loader, a reference to all of its syntax options, and most importantly, step-by-step instructions for all the SQL*Loader tasks you'd want to performand maybe some you didn't realize you COULD perform. You'll learn how to construct the necessary control files and load from different types of files containing different types of data (e.g., fixed-width data, delimited data, and data of various datatypes). You'll also learn how to validate data, load it selectively, transform it as it is loaded, and recover after failure. This book explains how to optimize SQL*Loader performance by adjusting the transaction size and using the new direct path option. It also covers the newest SQL*Loader featuresthe loading of large object (LOB) columns and the new object types (nested tables, varying arrays, and object tables). Oracle SQL*Loader: The DefinitiveGuide is an indispensable resource for anyone who is new to SQL*Loader; a task-oriented learning tool for those who are already using it; and a quick reference for every user. If you want to take best advantage of an essential Oracle tool, you need this book.
Network Security Essentials: Applications and Standards, 2nd edition
Authors: William Stallings
Venue:  (2002)

From the Book:PREFACE: Preface In this age of electronic connectivity, of viruses and hackers, of electronic eavesdropping and electronic fraud, network security has assumed increasing importance. Two trends have come together to make the topic of this book of vital interest. First, the explosive growth in computer systems and their interconnections via networks has increased the dependence of both organizations and individuals on the information stored and communicated using these systems. This, in turn, has led to a heightened awareness of the need to protect data and resources from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network-based attacks. Second, the disciplines of cryptography and network security have matured, leading to the development of practical, readily available applications to enforce network security. Objectives It is the purpose of this book to provide a practical survey of network security applications and standards. The emphasis is on applications that are widely used on the Internet and for corporate networks, and on standards, especially Internet standards, that have been widely deployed. Intended Audience The book is intended for both an academic and a professional audience. As a textbook, it is intended as a one-semester undergraduate course on network security for computer science, computer engineering, and electrical engineering majors. The book also serves as a basic reference volume and is suitable for self-study. Plan of the Book The book is organized in three parts: I. Cryptography: A concise survey of the cryptographic algorithms and protocols i reportunderlyingnetwork security applications, including encryption, hash functions, digital signatures, and key exchange. i See Appen~ II. Network Security Applications: Covers important network security tools and applications, including Kerberos, X.509v3 certificates, PGP, S/MIME, IP Secu- rity, SSL/TLS, SET, and SNMPv3. III. System Security: Looks at system-level security issues, including the threat of and countermeasures for intruders and viruses, and the use of firewalls and trusted systems. This book i A more detailed, chapter-by-chapter summary appears at the end of Chapter ~ (CNS2e). 1. In addition, the book includes an extensive glossary, a list of frequently used detailed anInternet Services for Instructors and Students There is a Web page for this book that provides support for students and instruc tors. The page includes links to relevant sites, transparency masters of figures in the book in PDF (Adobe Acrobat) format, and sign-up information for the book's Internet mailing list. The Web page is at ...
Primitivity of permutation groups, coherent algebras and matrices
Authors: Gareth A. Jones, Mikhail Klin, Yossi Moshe
Venue: Journal of Combinatorial Theory Series A (2002)

A coherent algebra is F-primitive if each of its non-identity basis matrices is primitive in the sense of Frobenius. We investigate the relationship between the primitivity of a permutation group, the primitivity of its centralizer algebra, and F-primitivity. The results obtained are applied to give new proofs of primitivity criteria for the exponentiations of permutation groups and of coherent algebras.
Analysis of integration models for service composition
Authors: David Liu, Kincho H. Law, Gio Wiederhold
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

This paper studies service integration infrastructures that support the execution of megaservices --- large-scale applications that are composed of autonomous service modules. Integration infrastructures are classified according to their control-flow and data-flow structures. We analyze the effects of data-flows on the performances of the centralized and distributed data-flow models. A mathematical model is built to compare the performances of megaservices. Particularly, aggregated cost and response time metrics are defined and evaluated. We arrive at the conclusion that the distributed data-flow model is in general superior in performance. We also identify the key system parameters as well as system bottlenecks. The analysis provides recommendations for a few techniques to build high-performance and scalable service integration infrastructures based on the distribution of data-flows.
Sams Teach Yourself Mysql in 21 Days with Cdrom, 1st edition
Authors: Mark Maslakowski, Tony Butcher
Venue:  (2000)

:Sams Teach Yourself MySQL in 21 Days teaches you to design and implement your own open source database. Topics include: Designing and Creating your First Database, Normalizing your Data, Adding Tables, Columns, and Indexes, MySQL Data Types, Importing and Exporting Data, Locks and Keys, Building a MyODBC Interface, Building a Perl Interface, Letting MySQL Do the Work - Intrinsic Functions, MySQL Database Security, How MySQL Compares, Administering MySQL, Optimizing MySQL, and Troubleshooting MySQL.
Final Fantasy VII: Official Strategy Guide
Authors: David Cassady, Brady Games
Venue:  (1998)

:With the Official Final Fantasy VII Strategy Guide gamers have the opportunity to save their world from an evil corporation which is siphoning off energy from the planet. Complete walkthroughs and all the maps help players navigate the game. Character descriptions, complete lists of items, monsters and magic and the revelation of all the secrets help players defeat the evil corporation.Sony expects sales of 1,000,000 units for this titleSony has committed to a multi-million dollar marketing campaign, including TV and print advertising, which is more than they will spend on any othe title this yearStrategy guides for past Square Soft RPG titles have experienced 30% attach rates to software sales
Self-Stabilization by Counter Flushing
Authors: George Varghese
Venue: SIAM Journal on Computing (2000)

A useful way to design simple and robust protocols is to make them self-stabilizing. A protocol is said to be self-stabilizing if it begins to exhibit correct behavior even after starting in an arbitrary state. We describe a simple technique for self-stabilization called counter flushing. We show how counter flushing helps us to understand and improve some existing distributed algorithms for tasks such as mutual exclusion and request-response protocols. We also use counter flushing to create new self-stabilizing protocols for propagation of information with feedback and resets. The resulting protocols are simple, require few changes from the nonstabilizing equivalents, and have fast stabilization times.
Compression of inverted indexes For fast query evaluation
Authors: Falk Scholer, Hugh E. Williams, John Yiannis, Justin Zobel
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

Compression reduces both the size of indexes and the time needed to evaluate queries. In this paper, we revisit the compression of inverted lists of document postings that store the position and frequency of indexed terms, considering two approaches to improving retrieval efficiency: better implementation and better choice of integer compression schemes. First, we propose several simple optimisations to well-known integer compression schemes, and show experimentally that these lead to significant reductions in time. Second, we explore the impact of choice of compression scheme on retrieval efficiency.In experiments on large collections of data, we show two surprising results: use of simple byte-aligned codes halves the query evaluation time compared to the most compact Golomb-Rice bitwise compression schemes; and, even when an index fits entirely in memory, byte-aligned codes result in faster query evaluation than does an uncompressed index, emphasising that the cost of transferring data from memory to the CPU cache is less for an appropriately compressed index than for an uncompressed index. Moreover, byte-aligned schemes have only a modest space overhead: the most compact schemes result in indexes that are around 10% of the size of the collection, while a byte-aligned scheme is around 13%. We conclude that fast byte-aligned codes should be used to store integers in inverted lists.
Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
Authors: Misha E. Kilmer, Dianne P. O'Leary.
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Numerical solution of ill-posed problems is often accomplished by discretization (projection onto a finite dimensional subspace) followed by regularization. If the discrete problem has high dimension, though, typically we compute an approximate solution by projecting the discrete problem onto an even smaller dimensional space, via iterative methods based on Krylov subspaces. In this work we present a common framework for efficient algorithms that regularize after this second projection rather than before it. We show that determining regularization parameters based on the final projected problem rather than on the original discretization has firmer justification and often involves less computational expense. We prove some results on the approximate equivalence of this approach to other forms of regularization, and we present numerical examples.
A proposed undergraduate bioinformatics curriculum for computer scientists
Authors: Travis Doom, Michael Raymer, Dan Krane, Oscar Garcia
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Bioinformatics is a new and rapidly evolving discipline that has emerged from the fields of experimental molecular biology and biochemistry, and from the the artificial intelligence, database, and algorithms disciplines of computer science. Largely because of the inherently interdisciplinary nature of bioinformatics research, academia has been slow to respond to strong industry and government demands for trained scientists to develop and apply novel bioinformatics techniques to the rapidly-growing, freely-available repositories of genetic and proteomic data. While some institutions are responding to this demand by establishing graduate programs in bioinformatics, the entrance barriers for these programs are high, largely due to the significant amount of prerequisite knowledge in the disparate fields of biochemistry and computer science required to author sophisticated new approaches to the analysis of bioinformatics data. We present a proposal for an undergraduate-level bioinformatics curriculum in computer science that lowers these barriers.
Responsible web caching
Authors: Hal Berghel
Venue: Communications of the ACM (2002)

Putting the distribution control of the Web's intellectual content in the hands of those who created it.
A simple music system in APL
Authors: Stuart Smith
Venue: ACM SIGAPL APL Quote Quad (1978)

This paper describes a low-cost musical instruction system written entirely in APL. This system has facilities to enter, store, edit, and perform simple music compositions. The only special device required to implement the system is an inexpensive "music box" to provide musical (sound) output. Typical instructional uses of the system are shown.