ppxscal/embedding_network huggingface dataset:
Teachers, Computers, and Curriculum: MicroComputers in the Classroom, 3rd edition
Authors: Paul G. Geisert, Mynga K. Futrell
Venue:  (1999)

:Here is a book that pointedly focuses on what teachers need to consider in their classroom decision-making. Its main emphasis is on classroom and curricular integration, not on the panoply of available technology. It addresses the needs and concerns of preservice and inservice teachers of different experiential backgrounds, from computer novice through long-time proficient users. The book is up-to-date, with coverage of the Internet and World Wide Web and classroom networks, and the latest on multimedia applications. Just as importantly, this book reflects the shift of emphasis in how schools are putting technology to use with K-12 youngsters toward genuine fusion of computer use with instructional processes in diverse areas. The new tripartite structure of the book covers: 1) the information on the integration of technology into the curriculum (in its 10 chapters); 2) supportive computer literacy and technology information (within the six primer sections interspersed throughout the text); and 3) computer and pedagogical resources at chapters' ends. Thus, the book emphasizes methods of classroom and curricular integration while simultaneously reviewing the necessary information and issues to consider when deciding on computers for one's classroom. Additionally, the authors address significant concerns, including quality of software, gender equity, and copyright issues. For pre-service and in-service teachers who need recommendations for quality software for use in K-12 educational settings.
Random Forests
Authors: Leo Breiman
Venue: Machine Learning (2001)

Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the forest becomes large. The generalization error of a forest of tree classifiers depends on the strength of the individual trees in the forest and the correlation between them. Using a random selection of features to split each node yields error rates that compare favorably to Adaboost (Y. Freund R. Schapire, Machine Learning: Proceedings of the Thirteenth International conference, &ast;&ast;&ast;, 148&ndash;156), but are more robust with respect to noise. Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the splitting. Internal estimates are also used to measure variable importance. These ideas are also applicable to regression.
Parallel subgraph matching on a hierarchical interconnection network
Authors: Stuart Campbell, Mohan Kumar, Horst Bunke
Venue: Hardware implementation of intelligent systems (2001)

The identification of subgraph isomorphisms is a well-known problem that occurs in many application areas. An important variant of the problem occurs when there are model graphs and a single input graph, and we wish to search for subgraph isomorphisms from any of the model graphs to the input graph. This chapter discusses the Parallel Netwprk (PN) algorithm; a parallel, deterministic algorithm for finding subgraph isomorphisms from a database of attributed model graphs to an attributed, directed input graph. The algorithm decomposes the model graphs and forms the resultant subgraphs into a number of search networks. Subgraphs common to any number of model graphs are represented only once. This approach allows rapid, parallel detection of matches of common subgraphs onto the input graph. In parallel, all mappings found for each model graph are searched to detect complete, consistent mappings, which define subgraph isomorphisms. When used on a hierarchical interconnection network, the algorithm allows local communication to be used to advantage, reducing communication overheads and improving performance.
Upgrading and Repairing Your PC Answers!: Certified Tech Support
Authors: Dave Johnson, David Kosorok, Todd Stauffer
Venue:  (1998)

:Answers "What do I do now?" when things go wrongonly Q&A format troubleshooting book. Authors are professional PC troubleshooters and together have years of hands-on enduser experience. Includes hard disk and memory upgrades,solving DMA and IRQ conflicts,software utilities and more. A Whole Book of answers for Less Than the Price of One Support Call! Q: My local PC shop charges a bundle just to look at my computer. Isn't there a more cost-effective way to maintain my PC? A: Routine maintenance,hardware upgrades,and performance tuning is easier than you think. In your hands is the logical solution. For less than the price of one technical support call,you get hundreds of answers to today's top PC upgrade and repair questions straight from the cohosts of the popular syndicated radio talk show,"The Computer Guys. " You'll also find dozens of tips and tricks derived from the authors' combined 15-plus years of hands-on experience! From hard disk and memory upgrades through solving DMA and IRQ conflicts-and everything in between-Upgrading & Repairing Your Pc Answers! Certified Tech Support has all the real-world shortcuts,workarounds,and solutions you need. Learn to&#58 Solve problems in seconds! At your fingertips are over 400 answers based on actual tech support calls arranged topically for fast,easy access. Find answers to questions on motherboards,processor swaps,memory upgrades,software utilities,and plenty more! Accomplish critical tasks using dozens of timesaving sidebars,figures,tables,tips,margin notes,and cautions. Preview chapters at-a-glance- find what you need in a hurry. Go straight to the anser you need. An exceptionallycomprehensive,cross-referenced index points your way. Whether you're upgrading and repairing by choice or by necessity,you'll want to keep this unique guide by your side througout the job!
The World Wide Web Featuring Microsoft Internet Explorer 5: Illustrated Introductory, 1st edition
Authors: Donald I. Barker, Chia-Ling H. Barker
Venue:  (1998)

:With this book, students learn how to browse the World Wide Web using Internet Explorer 5 and how to use FrontPage Express to create, format, and add graphics to a web page, and to create a form. In addition, the book contains valuable appendices on Outlook Express, Net Meeting, and Webcasting.
Java 2 Certification Virtual Test Center
Authors: Sybex Inc., Sybex
Venue:  (2001)

:The Java 2 Certification Virtual Test Center from Sybex is the most efficient and cost-effective way to practice for the Sun Microsystems Java Programmer's Exam. The testing engine contains over 500 sample questionseach with answers and explanationsand can be customized to meet your exact exam-simulation needs. With this extensive, hands-on preparation under your belt, you'll go into the exam with complete confidence. Tools That Strengthen Your Knowledge, Boost Your Confidence, and Help You Pass the Test! Choose the Approach That's Right for You Take tests in practice or timed mode. Test yourself according to objective area. Generate random sets of questions. Check your answers and get complete explanations. Practice with Hundreds of Challenging Questions Just as on the Actual Exam. Get Answers and Complete Explanations In practice mode, you can check your answers and review explanations as you go. You can also record online notes. Measure Your Knowledge Built-in scoring and assessment tools help you identifyand eliminateyour weak spots. On the CD The Best Way to Practice for the Java 2 Programmer's Exam Hundreds of Challenging Questions CustomizableTake Fixed-Length, Objectives-Based, or Random Tests Includes Detailed Scoring and Tracking Tools System Requirements: PC-Windows Pentium 120 (166 or higher recommended) 32MB RAM 4x speed CD-ROM drive 800x600 resolution, high-color mode Windows 95, Windows 98, Windows NT 4.0 (SP 4 or higher), Windows 2000 Windows-compatible soundcard PC-Unix (Linux) Pentium 166 or faster microprocessor recommended (Pentium 120 minimum) 64MB RAM 4x speed CD-ROM drive 800x600 resolution, high-color mode Red Hat Linux 6.2 or higher, or Solaris 8 Operation Environment or higher Unix-compatible sound card
Post-Industrial Lives: Roles and Relationships in the 21st Century, 1st edition
Authors: Jerald Hage, Charles H. Powers
Venue:  (1992)

:The shift from an industrial to a post-industrial society has been documented extensively, as has its impact on the macro-level institutions of society -- government, the workplace, and the economy. But how has post-industrial life impacted the individual and relationships between individuals? Hage and Powers examine this intriguing question by linking global changes in work patterns, information flow and knowledge to the practice of everyday life. They conclude that the complexities of society require a different kind of people, those with complex selves and creative minds, capable of confronting the challenges of the forthcoming century. Creativity, flexibility, and emotional astuteness will be the buzzwords of the future, as well as personality traits that will enable people to successfully adapt to the ever-changing swirl of workplace, familial, personal, and leisure roles. Based on the tenets of social theory, the authors present a window into the future and a plan for personal and interpersonal action. Their insights will shed light for social psychologists, social theorists, futurologists, organizational theorists, network analysts, and communication researchers.
An Efficient IDCT Processor Design for HDTV Applications
Authors: Jiun-In Guo, Jui-Cheng Yen
Venue: Journal of VLSI Signal Processing Systems (2002)

This paper proposes a high performance and low cost inverse discrete cosine transform (IDCT) processor for high definition Television (HDTV) applications by using cyclic convolution and hardwired multipliers. By properly arranging the input sequence, we formulate the one-dimensional (1-D) IDCT into cyclic convolution that is regular and suitable for VLSI implementation. The hardwired multiplier that implements multiplication with IDCT coefficients are first scaled and optimized by using the common sub-expression techniques. Based on these techniques, the data-path in the proposed two-dimensional (2-D) IDCT design costs 7504 gates plus 1024 bits of memory with 100 M pixels/sec throughput according to the cost estimation based on the cell library of COMPASS 0.6 &mu;m SPDM CMOS technology. Also, we have verified that the precision analysis of the proposed 2-D 8 &times; 8 IDCT meets the demands of IEEE Std. 1180-1990. Due to the good performance in the computing speed as well as the hardware cost, the proposed design is compact and suitable for HDTV applications. This design methodology can be applied to forward DCT as well as other transforms like discrete sine transform (DST), discrete Fourier transform (DFT), and discrete Hartley transform (DHT).
Digit-Serial Complex-Number Multipliers on FPGAs
Authors: T. Sansaloni, J. Valls, K. K. Parhi
Venue: Journal of VLSI Signal Processing Systems (2002)

This paper presents an optimized implementation on FPGA of digit-serial Complex-Number Multipliers (CMs) using Booth recoding techniques and tree adders based on Carry Save (CS) and Ripple Carry Adders (RCA). This kind of Complex-Number multipliers can be pipelined at the same level independent of the digit-size. Variable and fixed coefficient CMs have been considered. In the first case an efficient mapping of the modified Booth recoding and the partial product generation is presented which results in a logic depth reduction. The combination of 5&colon;3 and 4&colon;3 converters in the CS structure and the utilization of RCA trees lead to a minimum area requirement. In the case of fixed coefficient CMs, partial products generator is based on look-up tables and multi-bit Booth recoding is used to reduce the area and increase the performance of the circuit. The study reveals that efficient mapping of the 5-bit Booth recoding to generate the partial products is the optimum multibit recoding when Xilinx FPGA devices are used.
Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods
Authors: G. W. Stewart
Venue: SIAM Journal on Scientific Computing (2002)

In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon [Linear Algebra Appl., 61 (1984), pp. 101--132] shows that the Rayleigh quotient---i.e., the tridiagonal matrix produced by the Lanczos recursion---contains fully accurate approximations to the Ritz values in spite of the lack of orthogonality. Unfortunately, the same lack of orthogonality can cause the Ritz vectors to fail to converge. It also makes the classical estimate for the residual norm misleadingly small. In this paper we show how to adjust the Rayleigh quotient to overcome this problem.
Topic-oriented collaborative crawling
Authors: Chiasen Chung, Charles L. A. Clarke
Venue: Proceedings of the eleventh international conference on Information and knowledge management (2002)

A major concern in the implementation of a distributed Web crawler is the choice of a strategy for partitioning the Web among the nodes in the system. Our goal in selecting this strategy is to minimize the overlap between the activities of individual nodes. We propose a topic-oriented approach, in which the Web is partitioned into general subject areas with a crawler assigned to each. We examine design alternatives for a topic-oriented distributed crawler, including the creation of a Web page classifier for use in this context. The approach is compared experimentally with a hash-based partitioning, in which crawler assignments are determined by hash functions computed over URLs and page contents. The experimental evaluation demonstrates the feasibility of the approach, addressing issues of communication overhead, duplicate content detection, and page quality assessment.
Cybercrime: Security and Surveillance in the Information Age
Authors: Douglas Thomas, Brian Loader
Venue:  (2000)

:"Cybercrime focuses on the growing concern about the use of electronic communication for criminal activities and the appropriateness of the countermeasures that are being adopted by law enforcement agencies, security services and legislators to address such anxieties. Fuelled by sensational media headlines and news coverage which has done much to encourage the belief that technologies like the Internet are likely to lead to a lawless electronic frontier, Cybercrime provides a more considered and balanced perspective on what is an important and contested arena for debate. It will provide an understanding of the basic issues relating to cybercrime and its impact on society." "This book will be essential reading for students of criminology, public administration, politics, sociology and social policy."--BOOK JACKET.
Unicenter Tng for Dummies with Cdrom
Authors: Sandy Sampson, Steve Pazol
Venue:  (2000)

:Unicenter TNG Framework 2.2 on CD-ROM Packed with real-world insights from Unicenter TNG customers Harness the power of enterprise systems management for your organization Unicenter TNG makes it easy to monitor and manage the diverse IT resources in your organization. Unfortunately, the learning curve is kind of steep  which is why you need this friendly guide. Writing with a dash of humor and plenty of real-world examples, Sandy Sampson demystifies enterprise systems management  and leads you step-by-step to a successful TNG implementation. all this on the bonus CD-ROM Unicenter TNG Framework 2.2 from Computer Associates, including: 2-D and 3-D managed resource views An anti-virus tool Calendars for defining date- and time-based policies PC running Windows NT 4.0 (Pentium 120 processor or higher), Solaris 2.5/2.51, or HP-UX 10.20 (required free nodes for Solaris and HP-UX: 15, 150); 64MB RAM; 220 MB disk space; 4x CD-ROM drive; TCP/IP Discover how to: Understand TNG architecture Plan your installation Roll out IT policies Leverage TNG interface capabilities Predict and manage system events Make the most of TNG options Get smart! Register to win cool prizes Browse exclusive articles and excerpts Get a free Dummies Daily e-mail newsletter Chat with authors and preview other books Talk to us, ask questions, get answers
A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
Authors: Stefania Bellavia, Benedetta Morini
Venue: SIAM Journal on Scientific Computing (2001)

Newton--Krylov methods are variants of inexact Newton methods where the approximate Newton direction is taken from a subspace of small dimension. Here we introduce a new hybrid Newton-GMRES method where a global strategy restricted to a low-dimensional subspace generated by GMRES is performed. The obtained process is consistent with preconditioning and with matrix-free implementation. Computational results indicate that our proposal enhances the classical backtracking inexact method.
Scheduling reductions on realistic machines
Authors: Gautam Gupta, Sanjay Rajopadhye, Patrice Quinton
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

Many computations can be modeled with systems of affine recurrence equations (SAREs) over polyhedral domains. We study the problem of scheduling individual computations of an SARE in the presence of reductions i.e., operations specifying the accumulation of a set of values to produce a single value. Reductions involve a commutative and associative operator and therefore, per se, do not impose any specific order. However, on realistic machines, operators have bounded fan-in and therefore an order of accumulation (serialization) is needed. Arbitrary serializations may adversely affect the running time of a program. We develop an algorithm to determine efficient serializations of all reductions. We illustrate our methods with two significant examples.
Adobe PhotoShop 3.0 Handbook, 3rd edition
Authors: David Biedney
Venue:  (1994)

:Covers Mac and the Windows versions of Adobe PhotoShop. Tips and tricks you will not find in the user's manual. Includes full color art, step-by-step techniques and more. Adobe PhotoShop has become the industry standard in image-manipul 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
On the SQAP-Polytope
Authors: Michael Jünger, Volker Kaibel
Venue: SIAM Journal on Optimization (2000)

The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a technique for investigating the SQAP-polytope that is based on projecting the (low-dimensional) polytope into a lower dimensional vector-space, where the vertices have a "more convenient" coordinate structure. We exploit this technique in order to prove conjectures by Padberg and Rijal on the dimension of the SQAP-polytope as well as on its trivial facets.
Quick Course in Microsoft Excel 97, 1st edition
Authors: Joyce Cox, Polly Urban, Chistina Dudley
Venue:  (1997)

:Microsoft Excel is a spreadsheet, so it helps users perform calculations and make tables and charts. Microsoft Excel is sold separately or as a part of Microsoft Office.
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
Authors: J. Könemann, R. Ravi
Venue: SIAM Journal on Computing (2002)

In this paper, we present a new bicriteria approximation algorithm for the degree-bounded minimum spanning tree problem. In this problem, we are given an undirected graph, a nonnegative cost function on the edges, and a positive integer B*, and the goal is to find a minimum-cost spanning tree T with maximum degree at most B*. In an n-node graph, our algorithm finds a spanning tree with maximum degree O(B*+logn) and cost O(optB*), where optB* is the minimum cost of any spanning tree whose maximum degree is at most B*. Our algorithm uses ideas from Lagrangean duality. We show how a set of optimum Lagrangean multipliers yields bounds on both the degree and the cost of the computed solution.
Mr. Modem's Internet Guide for Seniors, 2nd edition
Authors: Richard A. Sherman
Venue:  (2000)

:An anxiety free, warm and friendly introduction to the Internet for adults, from first-time users to savvy surfers! You'll be amazed by all the Internet has to offer. Inside, you'll learn how to : Grasp what the Internet is all about Get connected to the Internet Send e-mail to your friends and family Search the World Wide Web for the information you need Meet people with similar interests in newsgroups and Internet chat rooms Become a savvy online shopper Check out Mr. Modem's Selected Web Sites for Seniors And much, much more!
Enterprise Java with UML
Authors: C. T. Arrington, Susan Cardinale, Hugo Scavino
Venue:  (2000)

:This book shows you how to harness the enormous power of enterprise Java technology using the Unified Modeling Language (UML). Writing for Java developers who are interested in modeling software before they build it, Arrington takes you step-by-step through the process of developing enterprise systems using J2EE and UML to devise elegant solutions, share ideas, and track decisions throughout the entire development cycle. Using a Timecard application, you'll start with Requirements Gathering and use case diagrams to understand the system from the user's perspective and create class diagrams, sequence diagrams, and collaboration diagrams to further analyze the problem. During the technology selection process, Arrington evaluates different Java technologies and takes a detailed look at the strengths and weaknesses of EJB, XML, Servlets, Swing, RMI, and JDBC to help you determine their suitability for your project. Next, you'll describe the system at a more granular architectural level with class and package diagrams. In the design stage, you'll apply all of the results from the previous steps to create an intricate model of the system's functionality and prepare a valuable foundation for implementation. The result is a single, coherent model that describes a software system from several perspectives.
Computer Math Problem Solving for Information Technology, 1st edition
Authors: Marc Marchant Reeder
Venue:  (2001)

:Centered on problem solving, this volume is designed to build the skills that are essential for a career in information technology. The reference provides a carefully selected set of mathematical tools and prepares readers for programming by providing a set of algorithmic tools and an understanding of basic programming concepts. The reference covers problem solving, exponents, number systems, units analysis, algebra, graphing, computer programming concepts, computer logic and structured program design. For Information Technology professionals. 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 Series: Microsoft Internet Explorer 5 Brief Edition, 1st edition
Authors: Sarah Hutchinson-Clifford, Glen Coulthard
Venue:  (1999)

:SERIES TAGLINE: The Advantage Series presents the Why,What and How of computer application skills to today's students. Each lab in this series is built upon an efficient learning model,which provides students and faculty with complete coverage and enhances critical thinking skills.