ppxscal/embedding_network huggingface dataset:
Practical Usage of TSO REXX, 3rd edition
Authors: Anthony S. Rudd
Venue:  (2000)

:REXX is a general purpose language which is easy to learn. It contains an extensive library of powerful functions which greatly reduces the amount of coding necessary to write applications. The implementation of REXX in a wide range of environments simplifies the writing of applications to run under different hardware and opening systems, and its expansibility allows other components to make sure of REXX facilities and vice versa." "Practical Usage of TSO REXX provides a concise source of information for the development and implication of applications using the REXX language. The author adopts a practical approach, using lists and diagrams to illustrate relevant points.
Introduction to Computer Theory, 2nd edition
Authors: Daniel I. A. Cohen
Venue:  (1996)

:This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.
Model checking of hierarchical state machines
Authors: Rajeev Alur, Mihalis Yannakakis
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2001)

Model checking is emerging as a practical tool for detecting logical errors in early stages of system design. We investigate the model checking of sequential hierarchical (nested) systems, i.e., finite-state machines whose states themselves can be other machines. This nesting ability is common in various software design methodologies, and is available in several commercial modeling tools. The straightforward way to analyze a hierarchical machine is to flatten it (thus incurring an exponential blow up) and apply a model-checking tool on the resulting ordinary FSM. We show that this flattening can be avoided. We develop algorithms for verifying linear-time requirements whose complexity is polynomial in the size of the hierarchical machine. We also address the verification of branching time requirements and provide efficient algorithms and matching lower bounds.
Microsoft Windows Millennium Edition For Dummies Quick Reference
Authors: Greg Harvey
Venue:  (2000)

:Want to make the most of Windows Me Edition right away? Microsoft Windows Me Edition For Dummies Quick Reference will guide you smoothly through the latest revision to the operating system. Perfect for beginners and pros alike, this concise, easy-to-follow reference describe all the facets and new features of Windows Me Edition in a flash - from Internet Explorer X to the Active Desktop to the brand-new Movie Maker. Don't get lost in long-winded volumes, this time-saving sourcebook is all you need! Get the most out of the new features in Microsoft Windows Me Edition, including PC Health, AutoUpdate, Movie Maker, Internet Explorer X, and more! Microsoft Windows Me Edition For Dummies Quick Reference is written by best-selling ...For Dummies author Greg Harvey, with over a million and a half readers of the previous editions. The convenient comb binding makes this reference a must-have for all Windows Me Edition desktop users. Flip it open to the page you need and it stays there while you work (or play!). About the Author Greg Harvey (Point Reyes Station, CA) is the president of Mind Over Media Inc., and the author of several best-selling books in the ...For Dummies series. His recent books include Windows 98 For Dummies Quick Reference, Microsoft Excel 2000 For Dummies, and Internet Explorer 5 For Windows For Dummies Quick Reference.
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
Authors: Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shil
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

An edge is a bisector of a simple path if it contains the middle point of the path. Let T=(V, E) be a tree. Given a source vertex s \in V, the single-source tree bisector problem is to find, for every vertex v \in V, a bisector of the simple path from s to v. The all-pairs tree bisector problem is to find for, every pair of vertices u, v \in V, a bisector of the simple path from u to v. In this paper, it is first shown that solving the single-source tree bisector problem of a weighted tree has a time lower bound \Omega(n \log n) in the sequential case. Then, efficient parallel algorithms are proposed on the EREW PRAM for the single-source and all-pairs tree bisector problems. Two O(\log n) time single-source algorithms are proposed. One uses O(n) work and is for unweighted trees. The other uses O(n \log n) work and is for weighted trees. Previous algorithms for the single-source problem could achieve the same time O(\log n) and the same optimal work, O(n) for unweighted trees and O(n \log n) for weighted trees, on the CRCW PRAM. The contribution of our single-source algorithms is the improvement from CRCW to EREW. One all-pairs parallel algorithm is proposed. It requires O( \log n) time using O(n^2) work. All the proposed algorithms are cost-optimal. Efficient tree bisector algorithms have practical applications to several location problems on trees. Using the proposed algorithms, efficient parallel solutions for those problems are also presented.
Implementing Cdf Channels
Authors: Michele J. Petrovsky
Venue:  (1998)

:Written specifically for the web developer/programmer, Michele Jo Petrovsky's Implementing CDF Channels includes instructions for establishing traditional netcasting as the basis for CDF, and then demonstrates how CDF can take netcasting even further. You'll find step-by-step examples of CDF, plus instructions for successful implementation of CDF on your web site. Also included are a comprehensive glossary, useful quick references for Netcasting and CDF, as well as over 150 helpful illustrations.
Monotonicity testing over general poset domains
Authors: Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

The field of property testing studies algorithms that distinguish, using a small number of queries, between inputs which satisfy a given property, and those that are `far' from satisfying the property. Testing properties that are defined in terms of monotonicity has been extensively investigated, primarily in the context of the monotonicity of a sequence of integers, or the monotonicity of a function over the n-dimensional hypercube {1,&ldots;,m}n. These works resulted in monotonicity testers whose query complexity is at most polylogarithmic in the size of the domain.We show that in its most general setting, testing that Boolean functions are close to monotone is equivalent, with respect to the number of required queries, to several other testing problems in logic and graph theory. These problems include: testing that a Boolean assignment of variables is close to an assignment that satisfies a specific 2-CNF formula, testing that a set of vertices is close to one that is a vertex cover of a specific graph, and testing that a set of vertices is close to a clique.We then investigate the query complexity of monotonicity testing of both Boolean and integer functions over general partial orders. We give algorithms and lower bounds for the general problem, as well as for some interesting special cases. In proving a general lower bound, we construct graphs with combinatorial properties that may be of independent interest.
Shockware for MacIntosh
Authors: Hayden Development
Venue:  (1996)

:Put your Shockwave movies on the Web, fast! Get expert advice from top Shockwave creators, learn the newest Director techniques for Shockwave, use new Lingo and HTML commands to optimize performance on the Web, and explore sample Shockwave movies and more! 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
Imovie Fast and Easy
Authors: Kevin Harreld
Venue:  (2000)

:iMovie Fast & Easy is the missing manual for this digital editing software from Apple. This book provides screen-by-screen instruction on editing, polishing, and reorganizing movies. It also covers adding special effects like cross-dissolves and scrolling titles, as well as musical soundtracks and sound effects. iMovie Fast & Easy is perfect for beginners and those who want to get a jump-start using iMovie.
QuickBooks Pro 99 for Accounting, 1st edition
Authors: Glenn Owen
Venue:  (1999)

:This is the first book of its kind to provide a self-paced environment where students use a commercially available software product to analyze, interpret, and investigate accounting information to make business decisions. This textbook will help students learn fundamental accounting concepts and principles through the use of QuickBooks and the analysis of business events.
Automata and Languages, 1st edition
Authors: John M. Howie
Venue:  (1992)

:Theoretical models of simple computing machines, known as automata, play a central role in theoretical computer science. This textbook presents an introduction to the theory of automata and to their connections with the study of languages.
Sams Teach Yourself to Create a Home Page in 24 Hours
Authors: Rogers Cadenhead
Venue:  (1997)

:If you can use your computer to print a resume or send e-mail to a friend, you can create your own Web home page more easily than you think! This hands-on tutorial uses step-by-step instructions and fun real-world examples to make home page creation a breeze. In just 24 one-hour lessons, you will develop a solid understanding of Web page development - and you don't have to learn any HTML programming to do it. Using the Claris Home Page 2.0 Lite software included on this book's CD-ROM, you'll be creating a home page the same way a letter is prepared on a word processor.
Mousetracks: A Kid's Computer Idea Book
Authors: Peggy L. Steinhauser
Venue:  (1997)

:What parent doesn't want to get their money's worth out of that pricey new family computer system? Here are more than 70 ways: step-by-step activities that work with any graphics and word processing software, on any kind of computer. Popular themes like sports, tropical rainforests, outer space, and publishing make it easy for kids to explore a favorite interest, get a leg up on schoolwork, or just have fun. Thoroughly kid-tested at the author's after-school computer education center, this book fills the gap between homework and games. 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
Advantage Interactive Series: Microsoft Excel 97
Authors: Mind Q Publishing
Venue:  (1998)

:These interactive,multimedia CD-ROM's bring IRWIN's Advantage manuals for Office 97 applications to life through sight,sound,and motion! Use them with or without the corresponding lab manual. They utilize video clips,simulations,hands-on exercises,and quizzes. You will enjoy the opportunity to explore these tutorials and learn the software at your own pace. 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
Introduction to Digital Logic Design, 1st edition
Authors: John P. Hayes
Venue:  (1993)

:John P. Hayes, a well-known authority in the area of computer engineering, now brings his expertise to digital logic design. Intended as a mainstream introduction for the first course, Introduction to Digital Logic Design provides a presentation which is both scholarly and highly supportive of student learning. In addition, it presents the traditional core topics including sequential and combinational design and register level logic. This is the first introductory text that provides balanced coverage of concepts, techniques and practice. Also, the text includes excellent coverage of the most modern topics and technologies -- programmable logic devices (PLD's), the testability, and computer aided design (CAD). This text has an attractive, practical design that highlights a number of features that support student learning.
The active learning framework
Authors: Russell Maulitz, Debra McGrath
Venue: Proceedings of the 7th international conference on Intelligent user interfaces (2002)

The Active Learning Framework (ALF) creates a technologically and educationally sophisticated learning environment in which nurse practitioners, medical students and other health professional students can participate in virtual patient encounters anytime, anywhere. Learners are presented with web-based case studies and engage in open-ended, interactive learning activities that are orchestrated by intelligent agent technology. Formative evaluation is provided. ALF has been tested for usability and learner satisfaction by 13 medical students, with generally very positive results.
Newnes C Pocket Book
Authors: Connor Sexton
Venue:  (1993)

:As a qualification, knowledge of C is a common denominator in the modern software world: a starting point from which people move on to expertise in vendor specific environments. It is often a basic requirement expressed by employment advertisements. Once having learnt C, a lesser effort is required to adopt that knowledge to the requirements of particular vendors' systems. Let this succinct 'pure C' Pocket Book help you with the C programming language, rather than wading through a 700+ page tome on the subject. In this second edition of the Newnes C Pocket Book the example C code has been modernised and is made more consistent. Two new chapters and two new appendices have also been added which will be useful to novice and experienced C programmers alike. 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
Design of an efficient channel block retuning
Authors: Vincent Barbéra, Brigitte Jaumard
Venue: Mobile Networks and Applications (2001)

Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel retuning of an urban network has to be done in several steps. The objective is then to define the steps in such a way that the increase in the interference level is minimum, and do not let it go further than a given threshold of minimum quality for the cellular network. We propose a greedy heuristic and an ascent---descent method including a Tabu Search module to retune a network in a given number of steps. All constraints of the channel assignment problem are taken into account (co-channel, adjacent channel, minimum channel spacing on antennas) as well as retuning constraints such as the number of steps and limits on the maximum number of cells which can be retuned at each step. Co-channel and adjacent channel constraints are expressed through compatibility matrices produced with a discretization of the signal-to-interference ratio. Numerical results are presented on a Bell Mobilit&eacute; urban network of 359 cells.
Realizing the Concept: A History of the CBI Archives
Authors: Bruce H. Bruemmer, Elisabeth Kaplan
Venue: IEEE Annals of the History of Computing (2001)

In this essay, CBI's former and current archivists reflect on the history and evolution of the CBI archives. Bruce H. Bruemmer, CBI's first professional archivist, served in that capacity from 1984 to 1997. Elisabeth Kaplan was appointed CBI archivist in July 1999.
Rational Interpolation Examples in Performance Analysis
Authors: C. Liu, W.-B. Gong, C. M. Krishna
Venue: IEEE Transactions on Computers (2001)

The rational interpolation approach has been applied to performance analysis of computer systems in [3]. In this paper, we demonstrate the effectiveness of the rational interpolation technique in the analysis of randomized algorithms and the fault probability calculation for some real-time systems.
An CICS for the COBOL Programmer: An Introductory Course, 2nd edition
Authors: Doug Lowe
Venue:  (1992)

:More than 100,000 programmers have learned CICS from Doug Lowe's two-part series. As one trainer wrote about Doug, "His writing is concise, understanding of the less experienced reader without being condescending, and above all, it is written in clear, familiar terms that don't require constant translation of acronyms and programming terms. In this field of technical jargon, Doug Lowe is indeed a refreshing experience."
Phase-Locked Loops for Wireless Communications: Digital and Analog Implementation
Authors: Donald R. Stephens
Venue:  (1998)

:This is a contemporary reference work on phase-locked loops for wireless communications engineers. The coverage is comprehensive and includes summary chapters on the circuit theory needed to explain the theory and operation of phase-locked loops and the supporting mathematics necessary for analysis. These include concise discussions of Laplace Transformations, z-Transformations, root locus, Bode analysis, partial fraction expansion, and others.
Bibliographic Relationships in Music Catalogs
Authors: Sherry L. Vellucci
Venue:  (1997)

:An important function of any library catalog is to bring together bibliographic records for materials that are related to each other in some way. The achievement of this goal depends on identifying those relationships and then linking the catalog records for the related material. Music scores present an abundance of complex relationships because of the added dimensions created by performance, requiring library catalogs to link bibliographic records for scores, performance parts, sound recordings, video recordings, books, hyper-media computer programs, and other formats. In order to redesign library catalogs to take full advantage of today's sophisticated relational database structures, it is important to understand the exact nature of these relationships. This groundbreaking empirical study of music bibliographic relationships provides the fundamental information necessary to understand better the complexities of music cataloging and the impact of these complexities on the structure of the catalog. Vellucci's study identifies the characteristics of music scores found in a library collection, describes in detail the types of relationships that exist within the world of music materials, and discusses the various methods currently used to link related music materials in library catalogs. Essential for music libraries and collections.Author Biography: Sherry L.Vellucci is an Assistant Professor in the Division of Library & Information Science, St. John's University, New York, and is the former Director of Library & Media Services, Westminster Choir College, Princeton, N.J. She has served on the Board of Directors of the Music Library Association and the International Associationof Music LibrariesU.S. Branch. She also received the MLA Special Achievement Award for her research on bibliographic relationships in music catalogs. 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
REU PACI---undergraduate student research experiences
Authors: Roscoe Giles
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

The Education, Outreach, and Training Partnerships for Advanced Computational Infrastructure (EOT PACI) Program funded by the National Science Foundation, has launched a new Research Experiences for Undergraduates (REU) PACI Program. The REU PACI Program was awarded by the National Science Foundation in its Supplemental REU Program for the PACI programs: the National Computational Science Alliance (NCSA) and the National Partnership for Advanced Computational Infrastructure (NPACI). Through this program, undergraduate students will be working on projects which span research, development and education teams within the national PACI Program. The students will submit papers on their research experiences to the REU PACI Program Committee for selection of the panel at SC'98. Four of the best papers will be selected for discussion in this panel on how the PACI program has impacted the research opportunities for undergraduate students.The objective of the PACI REU program is to engage a diversified pool of talented undergraduate students in computational science research with PACI partners. A special emphasis of this program is to involve women, minorities and people with disabilities. Each student will be associated with a research group at one of the PACI institutions, which span the US. These research groups are involved in leading-edge research in fields of science (biology, chemical engineering, cosmology, etc.) and enabling technologies (visualization, next-generation networks, computer science, etc.) or education. Undergraduates at the various institutions will interact with the rest of the team members who are working on their project at other major institutions. Through the team interactions, students have a larger peer group of colleagues at the same stage of development and will experience modern interdisciplinary research directly. As one of the team-building experiences, many of these students are participating in Supercomputing '98. More information on the REU program can be found at: http://www.krellinst.org/neot/reu/.
Combinatorial auctions with decreasing marginal utilities
Authors: Benny Lehmann, Daniel Lehmann, Noam Nisan
Venue: Proceedings of the 3rd ACM conference on Electronic Commerce (2001)

In most of microeconomic theory, consumers are assumed to exhibit decreasing marginal utilities. This paper considers combinatorial auctions among such buyers. The valuations of such buyers are placed within a hierarchy of valuations that exhibit no complementarities, a hierarchy that includes also OR and XOR combinations of singleton valuations, and valuations satisfying the gross substitutes property. While we show that the allocation problem among valuations with decreasing marginal utilities is NP-hard, we present an efficient greedy 2-approximation algorithm for this case. No such approximation algorithm exists in a setting allowing for complementarities. Some results about strategic aspects of combinatorial auctions among players with decreasing marginal utilities are also presented.
Loop re-ordering and pre-fetching at run-time
Authors: Suvas Vajracharya, Dirk Grunwald
Venue: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) (1997)

The order in which loop iterations are executed can have a large impact on the number of cache misses that an applications takes. A new loop order that preserves the semantics of the old order but has a better cache data re-use, improves the performance of that application. Several compiler techniques exist to transform loops such that the order of iterations reduces cache misses. This paper introduces a run-time method to determine the order based on a dependence-driven execution. In a dependence-driven execution, an execution traverses the iteration space by following the dependence arcs between the iterations.