ppxscal/embedding_network huggingface dataset:
The NP-completeness of (1,r)-subcolorability of cubic graphs
Authors: Ho&#x00E0;ng-Oanh Le Van Bang Le
Venue: Information Processing Letters (2002)

A partition of the vertices of a graph G into k pairwise disjoint sets V1, ..., Vk is called an (r1, ..., rk)-subcoloring if the subgraph Gi of G induced by Vi, 1 ≤ i ≤ k consists of disjoint complete subgraphs, each of which has cardinality no more than ri. Due to Erdös and Albertson et al., independently, every cubic (i.e., 3-regular) graph has a (2, 2)-subcoloring. Albertson et al. then asked for cubic graphs having (1,2)-subcolorings. We point out in this paper that this question is algorithmically difficult by showing that recognizing (1, 2)-subcolorable cubic graphs is NP-complete, even when restricted to triangle-free planar graphs.
Gex 3; Deep Cover Gecko: Prima's Unauthorized Strategy Guide
Authors: Michael Brown, Mario De Govia, Don Tica, Mel Odom, Kip Ward
Venue:  (1999)

:Gex makes a triumphant return in "Gex 3: Deep Cover Gecko." As an international secret agent for hire, Gex's next mission is to find the beautiful Agent Xtra who has been kidnapped by Gex's arch nemesis, Rez. Full of even more tongue-in-cheek references to pop culture, television, and movies, GEX 3 artfully combines humor, stunning 3D graphics, and all-new gameplay mechanics.
Hierarchical VP restoration management system for a reliable ATM backbone network
Authors: Won-Kyu Hong, Choong-Seon Hong
Venue: International Journal of Network Management (2002)

This paper proposes a distributed ATM VP PVC restoration framework with the dynamic rerouting schemes in a hierarchical transport network. The rerouting algorithm aims to provide rapid ATM VP PVC restoration in the case of fault or performance degradation in terms of maximization of network resource utilization and satisfaction of the end user's QoS requirement.
Friday, April 19th Morning Keynote
Authors: Jackie Speier
Venue: Proceedings of the 12th annual conference on Computers, freedom and privacy (2002)

Jackie Speier (D-San Mateo/San Francisco) was elected to the 8th Senate District on November 3, 1998 with 79.2% of the vote. The district includes the western half of San Francisco and northern San Mateo County. Speier first served in the State Legislature as a member of the State Assembly, 1986-1996, where two Republican governors signed 181 of her bills into law. The San Jose Mercury News reported in 1996, that "no one comes close to Speier's remarkable record of getting substantive legislation signed into law." Her legislative success rate was rated "Ruthian" by the Los Angeles Times. As chair of the Assembly's Consumer Protection Committee for five years, she wrote pro-consumer laws to protect Californians from misleading internet transactions, travel fraud, telemarketing scams, unfair funeral and cremation practices, illegal stock transactions, inaccurate credit reports, gender discrimination in pricing of services, and the resale of lemon vehicles.
Array Algebra Expansion of Matrix and Tensor Calculus: Part 2
Authors: Urho A. Rauhala
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

Part 1 of this paper summarized some extended matrix and tensor operators of the multilinear array algebra and loop inverse estimation. It also introduced the compact shorthand tensor notations of array polynomials for expressing the Taylor expansion of a nonlinear function and its least squares normal equation. These matrix-like operators will be further expanded using the nonlinear tensor transforms of Blaha's Q-surface technique. They enable an analytical derivation of the direct (one hyper iteration) solution of nonlinear systems. New operators are found such as the nonlinear counterpart of the Lm- or general pseudoinverse and neural net operators. The increased pull-in range and rate of convergence of the new technique are applied in some standard examples of nonlinear equations. Some applications of the nonlinear array algebra involving literally billions of parameters are discussed, including the automated stereo mensuration of three-dimensional digital imaging and mapping systems.
The Computer Age
Authors: Barrons Educational Series, Chris Oxlade, Marlene Targ Brill
Venue:  (2000)

:Computers first appeared as cumbersome electronic machines during World War II, as an aid to directing accurate artillery fire. With miniaturization of electronic circuitry and components in the 1970s, the computer began assuming the forms we know today-becoming essential to our lives, solving problems, and providing information, communication, and entertainment. This illustrated volume presents the computer's fascinating history. Barron's ticktock books provide information on a wide range of subjects for young adult readers in illustrated, attractive magazine-style layouts. (Ages 10 and older)
Collective Intelligence: Mankind's Emerging World in Cyberspace
Authors: Pierre Levy
Venue:  (1999)

:The number of travelers along the information superhighway is increasing at a rate of ten percent a month. How will this communications revolution affect our culture and society? Though awed by their potential, we've feared computers as agents of the further alienation of modern man: they take away our jobs, minimize direct human contact, even shake our faith in the unique power of the human brain. Pierre Levy believes, however, that rather than creating a society where machines rule man, the technology of cyberspace will have a humanizing influence on us, and foster the emergence of a "collective intelligence" - a meeting of minds on the Internet - that will validate the contributions of the individual.
Bounding the Hausdorff distance between implicitly defined and/or parametric curves
Authors: Bert Jüttler
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

This paper is devoted to computational techniques for generating upper bounds on the Hausdorff distance between two planar curves. The results are suitable for pairs of implicitly defined and/or parametric curves. The bounds are computed directly from the control points resp. spline coefficients of the curves. They improve an earlier result of Sederberg. Potential applications include error bounds for the approximate implicitization of spline curves, for the approximate parameterization of (piecewise) algebraic curves, and for algebraic curve fitting.
Refined Description of the C[] Language
Authors: A. Ya. Kalinov, A. L. Lastovetsky, I. N. Ledovskih, M. A. Posypkin
Venue: Programming and Computing Software (2002)

In the paper, an accurate and detailed description of the programming language C&lsqb;&rsqb; is given. Unlike previous publications on the language, this paper gives a formal definition of a vector, which is used for the description of the semantics of basic constructs. The language updates that appeared after the first publication are discussed. Other vector programming languages are surveyed and compared with C&lsqb;&rsqb;.
Data Refinement: Model-Oriented Proof Methods and Their Comparison
Authors: W. DeRoever, Kai Engelhardt
Venue:  (1999)

:This is a comprehensive and systematic account of the important and highly applicable method of data refinement, which is one of the most powerful formal methods for system development. The authors concentrate on principles and begin with an explanation of the fundamental notions behind data refinement and simulation. Accessibility and comprehension are emphasised in order to guide newcomers to the area. The remaining chapters are comparitive in nature, looking at a variety of formal methods and how they may be best applied.The book is self-contained, going from advanced undergraduate level but taking the reader to the state-of-the-art in methods for proving simulation.
A Study of General Dynamic Network Programs with Arc Time-Delays
Authors: Malcolm C. Pullan
Venue: SIAM Journal on Optimization (1997)

Dynamic network flow problems in which there is a delay on the flows in the arcs have been in existence since the early days of modern optimization. However, most previous work in this area has only considered models which are discrete in the time variable. In this paper we present a continuous-time model for a very broad class of dynamic network problems with arc time-delays. The model is a direct extension of the separated continuous linear program (SCLP) to include time-delays and is called the separated continuous linear program with time-delays (SCLPTD). By suitable transformations we are able to rewrite SCLPTD in a manner which is very close to SCLP itself. This then allows us to use all the recent theory and algorithms for SCLP to derive similar results for SCLPTD. In particular, the theory we present includes a characterization of the extreme-point solutions, an existence theorem for piecewise analytic optimal extreme-point solutions, and a strong duality theorem. We also present a class of convergent algorithms for the solution of SCLPTD in certain instances.
Cabling: The Complete Guide to Network Wiring, 2nd edition
Authors: David Groth, David McBee, David Barnett
Venue:  (2001)

:The most comprehensive guide to network cabling! Designed for cable installers and contractors, network administrators, and PC and network technicians, this book provides all the information you need to know to work safely and effectively with cables in the workplace. Coverage spans cabling system design and installation, electrical and security issues, cabling components, and documenting and troubleshooting your system. Includes a 32-page color insert for quick identification of connectors and cables as well as vendor information and recommendations
Preconditioned iterative methods for the nine-point approximation to the convection---diffusion equation
Authors: M. Bhuruth, M. K. Jain, A. Gopaul
Venue: Journal of Computational and Applied Mathematics (2002)

Iterative methods preconditioned by incomplete factorizations and sparse approximate inverses are considered for solving linear systems arising from fourth-order finite difference schemes for convection-diffusion problems. Simple recurrences for implementing the ILU(0) factorization of the nine-point scheme are derived. Different sparsity patterns are considered for computing approximate inverses for the coefficient matrix and the quality of the preconditioner is studied in terms of plots of the field of values of the preconditioned matrices. In terms of algebraic properties of the preconditioned matrices, our experimental results show that incomplete factorizations give a preconditioner of better quality than approximate inverses. Comparison of the convergence rates of GMRES applied to the preconditioned linear systems is done with respect to the field of values, Ritz and harmonic Ritz values of the preconditioned matrices. Numerical results show that the GMRES residual norm decreases rapidly when the difference between the Ritz and harmonic Ritz values becomes small. We also describe the results of experiments when some well-known Krylov subspace methods are used to solve the linear system arising from the compact fourth-order discretizations.
Application and programming experience with the Ara mobile agent system
Authors: Holger Peine
Venue: Software&mdash;Practice Experience (2002)

We describe a mobile agent application for distributed searching of the global Usenet network, implemented on top of the Ara mobile agent system. After short overviews of Ara and the Usenet, the application is presented in detail, beginning with some critical thoughts on mobile agent applications in general. The function and performance of the search application is then described, demonstrating the advantage of using mobile agents over an equivalent stationary implementation of the same application under certain conditions, and also discussing the limits of such conditions. This is followed by descriptions of the language to express the search queries and of the search algorithms employed. The application presentation closes with a critical discussion. The paper then concludes with some observations about mobile agent programming in general.
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
Authors: Wu Li
Venue: SIAM Journal on Optimization (1997)

In this paper we study differentiable convex inequalities and prove that metric regularity and Abadie's constraint qualification (CQ) are equivalent for such inequalities. For convex quadratic inequalities, we show that metric regularity, the existence of a global error bound, and Abadie's CQ are mutually equivalent. As a consequence, we derive two new characterizations of weak sharp minima of a convex quadratic programming problem.
Physiological measures of presence in stressful virtual environments
Authors: Michael Meehan, Brent Insko, Mary Whitton, Frederick P. Brooks,  Jr.
Venue: ACM Transactions on Graphics (TOG) (2002)

A common measure of the quality or effectiveness of a virtual environment (VE) is the mount of presence it evokes in users. Presence is often defined as the sense of being there in a VE. There has been much debate about the best way to measure presence, and presence researchers need, and have sought, a measure that is reliable, valid, sensitive, and objective.We hypothesized that to the degree that a VE seems real, it would evoke physiological responses similar to those evoked by the corresponding real environment, and that greater presence would evoke a greater response. To examine this, we conducted three experiments, the results of which support the use of physiological reaction as a reliable, valid, sensitive, and objective presence measure. The experiments compared participants' physiological reactions to a non-threatening virtual room and their reactions to a stressful virtual height situation. We found that change in heart rate satisfied our requirements for a measure of presence, change in skin conductance did to a lesser extent, and that change in skin temperature did not. Moreover, the results showed that inclusion of a passive haptic element in the VE significantly increased presence and that for presence evoked: 30FPS > 20FPS > 15FPS.
Mous Essentials: Excel 2000, 1st edition
Authors: Marianne B. Fox, Lawrence C. Metzelaar
Venue:  (2000)

:The authors follow the proven approach of Prentice Hall's Essentials series with an emphasis on step-by-step tutorials with large screen shots, outstanding student pedagogy and plenty of exercises. This text also includes a number of elements designed to help students study for the MOUS exams. As an additional test preparation tool, the series also includes live computer-based training and assessment with the MOUS Kelly PinPoint CD-ROM. Key Features ALL MOUS Essentials books are certified to the Expert Level by Microsoft as approved test preparation guides for the MOUS exam. A unique appendix entitled Preparing for MOUS Certification provides information on how to register, what is covered in the tests, how the tests work and levels of certification. Each Project opens with Required Activities for both levels of the exam objectives. These activities are indicated throughout the Projects by icons distinguishing core vs. expert objectives. Exam Notes and Inside Stuff sidebars provide students with extra tips and tricks on preparing for and taking the MOUS exams. MOUS PinPoint software provides computer-based training and assessment tools for students to complete the projects and practice for the MOUS exams. MOUS PinPoint includes Project Review Tests along with "Show Me" training for each Microsoft MOUS Exam Skill Set covered within the Project. In addition, each MOUS PinPoint has a capstone final exam that mirrors the actual MOUS exams.
A lower bound for the non-oriented two-dimensional bin packing problem
Authors: Mauro Dell'Amico, Silvano Martello
Venue: Discrete Applied Mathematics (2002)

Given a set of rectangular items, and an unlimited number of identical rectangular bins, we consider the problem of allocating, without overlapping, all the items to the minimum number of bins. We assume that the items may be rotated by 90&#x00B0;. The problem is strongly NP-hard, and has several industrial applications. No specific lower bound is known for it. We present a lower bound which explicitly takes into account the possible item rotation. The bound is embedded into an exact branch-and-bound algorithm. The average performance is evaluated through computational experiments.
TLB and snoop energy-reduction using virtual caches in low-power chip-multiprocessors
Authors: Magnus Ekman, Per Stenström, Fredrik Dahlgren
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

In our quest to bring down the power consumption in low-power chip-multiprocessors, we have found that TLB and snoop accesses account for about 40% of the energy wasted by all L1 data-cache accesses. We have investigated the prospects of using virtual caches to bring down the number of TLB accesses. A key observa¿tion is that while the energy wasted in the TLBs are cut, the energy associated with snoop accesses becomes higher. We then contrib¿ute with two techniques to reduce the number of snoop accesses and their energy cost. Virtual caches together with the proposed techniques are shown to reduce the energy wasted in the L1 caches and the TLBs by about 30%.
An efficient distributed method for allocating resources based on an unobstructed squeezing technique
Authors: Yutaka Wada Zixue Cheng
Venue: ACM SIGOPS Operating Systems Review (2002)

The distributed resource allocation problem is one of important problems in distributed environment. In some applications where a resource is required by many processes at a time, some kinds of resources, such as a memory, a disk, or a communication channel can be divided into many units, which can be allocated to more than one process in the same time according to their requested amounts for the resource. In this paper, in order to use such kind of resources efficiently, we propose a new method for allocating the resources, by employing a "unobstructed squeezing" technique. By this method, a process with lower priority may acquire requested units, before another process with higher priority, if this allocation to the latter will not be delayed. A simulation shows that the performance of our method will be about 30% better than the traditional method for h-out-of-k problem (without squeezing), when each resource has large number of units and the number of requests for the resource is large enough.
Advantage Series: Microsoft PowerPoint 2000 Complete Edition, 1st edition
Authors: Sarah Hutchinson-Clifford, Glen Coulthard
Venue:  (2000)

: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. This text contains intro level content plus 5 to 6 additional chapters of advanced-level content.
Visual Data Mining: Techniques and Tools for Data Visualization and Mining, 1st edition
Authors: Tom Soukup, Ian Davidson
Venue:  (2002)

:Data mining techniques offer marketing analysts a better understanding of customer buying habits. That data can then be used to develop new marketing campaigns and new products. New visual mining tools are becoming widely available, and can provide a quick and easily accessible way of retrieving information. These visual techniques also have the ability to make it possible for nontechnical business managers to understand their markets and make more savvy business decisions.
New Perspectives on Microsoft Excel 97 Comprehensive Enhanced, 1st edition
Authors: June Jamnich Parsons, Dan Oja, Carey, Roy Ageloff, Joan Carey, Patrick Carey
Venue:  (1998)

:As part of the New Perspectives series, this text offers a case-based, problem-solving approach for learning basic to more advanced features of Microsoft Excel 97.
Illustrator; A Hands-on Introduction, Version 5.5, 1st edition
Authors: Suzanne Sayegh Thomas, William V. Wojciechowski
Venue:  (1994)

:Here is a step-by-step introduction to the drawing, painting, and tracking functions of the newest version of Adobe Illustrator--5.5 for the Mac. The disk enclosed in the book provides images that allow the users to see the exercises in the book as they are worked through. Margin notes with tips and tricks provide shortcuts that give users a professional edge.
Electronic Health Records: Changing the Vision, 1st edition
Authors: Gretchen Murphy, Mary A. Hanken, Kathleen Waters
Venue:  (1999)

:This state-of-the-art text addresses all of the components required to build a successful electronic health records system and illustrates how the elements fit together. Over 40 experts offer practical experience in project and people management while covering legal perspectives, policy issues and standards. Includes free software that contains a computer-based patient record model, and explanations of the tools used to plan, manage, and analyze an EHR system.
Networking Essentials MCSE Study System with Cdrom, 1st edition
Authors: Jason Nash
Venue:  (2000)

:Exam 70-58 3 Steps to Success*Get Ready  Organize a plan of attack*Open the book for a thorough, proven course that will make you a networking expert*Pop in the IDG Books Testing Software CD-ROM for a diagnostic exam that not only identifies your weak spots, but refers you back to the specific sections in the book you need to review*Get Set  Practice, Practice, Practice*Use the tutorials, labs, summaries, examples, and self-assessments in the book to refine your knowledge of each topic*Set the exam simulations on IDG Books Testing Software to give you extra practice on topics that give you trouble  and even create electronic flash cards for intensive drills*Configure and troubleshoot large or small networks with the operating system simulations on the CD-ROM  and get the hands-on experience you need to succeed*Go  Watch your career take off!*Use IDG Books Testing software's amazingly realistic, fully adaptive test simulations to pinpoint exactly when you're ready to pass the exam*Keep the book at your desk for tested solutions to real-world problems  and use the operating system simulations to hone your network skillsAdvanced Test Preparation Software IDG Books Testing Software*Standard test simulations*Adaptive test simulations*Operating system simulations fully integrated with IDG Books Testing Software*Diagnostics, bookmarking, flash cards, and more*All simulations mapped back to topics in the bookFree 30-day evaluation copy
Fine-grain CAM-tag cache resizing using miss tags
Authors: Michael Zhang, Krste Asanović
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

A new dynamic cache resizing scheme for low-power CAM-tag caches is introduced. A control algorithm that is only activated on cache misses uses a duplicate set of tags, the miss tags, to minimize active cache size while sustaining close to the same hit rate as a full size cache. The cache partitioning mechanism saves both switching and leakage energy in unused partitions with little impact on cycle time. Simulation results show that the scheme saves 28--56% of data cache energy and 34--49% of instruction cache energy with minimal performance impact.
We neurotic amateurs: a commentary on Edmond H. Weiss's `Egoless Writing: Improving Quality by Replacing Artistic Impulse with Engineering Discipline'
Authors: Geoffrey Sauer
Venue: ACM Journal of Computer Documentation (JCD) (2002)

The assertion that technical communicators tend to be `amateurs'---that is, lovers of their work--- is a claim with little foundation. Arguments toward regimentation and systematization of documentation writing are not calls to professionalize a currently-immature field, but rather attempts to emulate the hierarchy we have seen implemented in microprocessor engineering in the 1970s, software development in the 1980s, and content management in the 1990s. Such `egoless' methods may offer advantages to employers, but should not necessarily be considered `progress.'