ppxscal/embedding_network huggingface dataset:
Adobe Photoshop 5 Certified Expert Exam Guide, 1st edition
Authors: Dan Margulis, Michael Lennox, Elizabeth Bulger
Venue:  (1999)

:Adobe Photoshop 5 Certified Exam Guide prepares Photoshop users to take and pass the Adobe Certification Exam (ACE). As the undisputed leader in the design software industry, Adobe's Certification is the most valued yardstick available to employers seeking to verify skills. Adobe Photoshop 5 Certified Expert Exam Guide offers a step-by-step study program that closely follows the objectives of the Certification Exam as defined by Adobe Systems. Each aspect of the book is devoted to preparing you for the test and helping you understand concepts and principles covered in the ACE.
Power conservation strategy for mobile computers using load sharing
Authors: Mazliza Othman, Stephen Hailes
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

Power management is an important aspect of mobile computing. Previous works on power conservation have concentrated on the hardware approach. In this paper, we propose a different approach of power conservation strategy for mobile computers which is based on the concept of load sharing. User jobs are transferred from a mobile host to a fixed host to reduce power consumption by the CPU. Simulation results show that under suitable conditions, transferring job can extend battery lifetime by up to 20%. Transferring jobs to a fixed host does not only extend battery lifetime but also gives users access to faster machines, hence improving job response time.
A heuristic to accelerate in-situ permutation algorithms
Authors: J&#x00F6;rg Keller
Venue: Information Processing Letters (2002)

In-situ permutation algorithms permute an array of n items without using a second array. Little space is needed when one proceeds permuting along a cycle. Thus, those algorithms first search for one element called the leader on each cycle of the permutation. Then they move the items cycle by cycle. A great fraction of the runtime is spent with testing whether elements are leaders. We present a simple-to-implement heuristic to accelerate the search for leaders and present performance gains for randomly chosen permutations on three algorithms.
The Formula Isomorphism Problem
Authors: Manindra Agrawal, Thomas Thierauf
Venue: SIAM Journal on Computing (2000)

We investigate the computational complexity of the formula isomorphism problem (FI): on input of two boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. FI is contained in ${\Sigma_{2}{\bf P}}$, the second level of the polynomial hierarchy.Our main result is a one-round interactive proof for the complementary formula nonisomorphism problem (FNI), where the verifier has access to an NP-oracle. To obtain this, we use a result from learning theory by Bshouty et al. that boolean formulas can be learned probabilistically with equivalence queries and access to an NP-oracle. As a consequence, FI cannot be ${\Sigma_{2}{\bf P}}$-complete unless the polynomial hierarchy collapses.Further properties of FI are shown: FI has and- and or-functions, the counting version, #FI, can be computed in polynomial time relative to FI, and FI is self-reducible.
Internet Explorer 4.0 with Cdrom
Authors: Kenrick Rawlings, David Gulbransen
Venue:  (1998)

:The MCSE Training Guide series provides an efficient way of preparing for MCSE exams. The chapters are directly organized around the exam topics and objectives. Each chapter begins with a pre-chapter quiz that allows the readers to assess their knowledge of the objectives covered in the chapter. Each chapter ends with a set of review questions that enables readers to assess their knowledge again after reading the material. Each chapter also provides hands-on learning opportunities through a set of exercisesSuccessfully pass the new IE4 exam on your way to obtaining your MCP, MCSE, or MCSE+ Internet certification!The ONLY study materials you will need to pass Exam 70-79, Implementing and Supporting Microsoft Internet Explorer 4.0.Study test questions and practice taking the exam with the exclusive TestPrep test engine on the CD-ROM.
How to Do Everything with Your Visor
Authors: Dave Johnson, Rick Broida
Venue:  (2000)

:*Handheld computer sales are growing at 30% annual rate. Market projections are for 32. 5 million units by 2003 *The only book to treat the Handspring Visor as the primary subject *Foreword by respected guru Jeff Hawkins,inventor of both the PalmPilot and the Visor *Covers the expansion slot for wireless communication,MP2 playback,global positioning and digital photography Get the most out of your new Visor or Visor Deluxe with this comprehensive,solutions-packed guidebook. Easy to follow and loaded with practical information,this resource will help you master built-in applications and become familiar with third-party tools,enhancing your Visor experience. Learn to use all the new featuresincluding the Springboard slot,which expands functionality to include wireless communication,MP3 playback,digital photography,and more. Ideal for both beginners and experienced handheld users,this reference covers everything from basic set-up to advanced development tools that will allow you to create your own applications. Written by the authors of the best-selling title,How to Do Everything with Your Palm Handheld,this book offers you complete coverage of this popular handheld device! Inside,learn to: *Set up and configure your Visor or Visor Deluxe *Share data between your Palm Desktop and Windows/Macintosh applications *Prepare your Visor for travel *Surf the Web,manage multiple mailboxes,send and receive faxes,and print documents *Install and play interactive games *View photos,download music,and install reference and e-book modules *Troubleshoot common problems *Manage multiple Visors and multiple computers
A Guide to LATEX: Document Preparation for Beginners and Advanced Users, 3rd edition
Authors: Helmut Kopka, Patrick W. Daly
Venue:  (1999)

:Document Preparation For Beginners And Advanced Users. If you are a user with little or no experience of computers or text formatting and you wont to muster LATEX to produce documents of high quality, then this book is essential reading. Fully revised to cover the most up-to-date versions of LATEX this accessible and practical tutorial contains all of the information you will need to get up and running with LATEX, and is an essential reference tool to users at all levels. This book will enable you to: Master the basics of LATEX and explore more advanced topics including user-defined extensions Get up to speed with the latest LATEX extensions for adaptations to other languages Explore numerous practical examples and pick up handy tips for avoiding common problems Benefit from detailed appendices including the Command Summary and Summary Tables New to this Edition Completely updated to cover the latest releases and upgrades of LATEX Covers new features including graphics importation and PostScript font installation Section on LATEX and the World Wide Web Section on LATEX on Windows & Windows NT Section on installations for 32 bit PC
Shape retaining chain linked model for real-time volume haptic rendering
Authors: Jinah Park, Sang-Youn Kim, Seung-Woo Son, Dong-Soo Kwon
Venue: Proceedings of the 2002 IEEE symposium on Volume visualization and graphics (2002)

Haptic rendering is the process of computing and generating forces in response to user interactions with virtual objects. While we speak of real-time volume rendering for visualization, we are still very much limited to surface models for manipulation due to overwhelming computational requirements for volumetric models. In this paper, we propose a new volumetric deformable model that is suitable for volume haptic interactions. The volume elements of our proposed model are linked to their nearest neighbors and their displacements are transformed into potential energy of the virtual object. The original 3D ChainMail algorithm does not account the fact that the residual energy left in the object after some interactions becomes a critical problem in haptic rendering. We present the shape-retaining chain linked model, which allows for fast and realistic deformation of elastic objects. Furthermore, we incorporate force-voltage analogy (duality) concepts into the proposed shape-retaining chain linked representation in order to develop a fast volumetric haptic model that is suitable for real-time applications. We experimented with homogenous and non-homogenous virtual objects of size 75&times;75&times;75 volume elements, and we were able to verify real-time and realistic haptic interaction with a 3DOF PHANToM&trade; haptic device.
Vbscript Pocket Reference
Authors: Matt Childs, Ron Petrusha, Paul Lomax
Venue:  (2001)

:"Whether you're developing code for Active Server Pages, client-side scripts for Internet Explorer, code for Outlook forms, or scripts for Windows Script Host, VBScript Pocket Reference, will be your constant companion. Based on the bestselling VBScript Pocket Reference, this book details every VBScript language element - every statement, function, and object - both in VBScript itself and in the Microsoft Scripting Runtime Library. Elements are arranged alphabetically by topic, so that you can, for instance, easily find details about that string-handling function you can't quite remember. There is also an alphabetical list of elements and a section listing VBScript operators and VBScript intrinsic constants." "Regardless of how much experience you have programming with VBScript, this is the book you'll pick up time and time again as your standard quick-reference guide to the VBScript language. It is an indispensable reference for anyone writing scripts with VBScript."--BOOK JACKET.
Wwf No Mercy
Authors: Prima Temp Authors, Eric Lionel Pratte, Fujiko Pratte
Venue:  (2000)

:What do you get when you cross 80 of the hottest names in the WORLD WRESTLING FEDERATION including newcomers, all new game modes, brand spanking new WWF show venues, more weapons, expanded game play, and a NINTENDO 64 or GAME BOY COLOR? What you get is NO MERCY; only the next in line of THQs awesome WWF games. Oh, and of course, WWF: NO MERCY--PRIMAS OFFICIAL STRATEGY GUIDE. PRIMA will cover you in the ring and out with stats and bios on all your favorite superstars, info on all new weapons available in the game, tips and tricks for the hottest new venues and exclusive insider info you wont want to miss. In a game that shows no mercy, youll be begging for us in your corner . . .
XL: a platform for web services
Authors: Daniela Florescu, Andreas Grünhagen, Donald Kossmann, Steffen Rost
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

We present a platform for Web services. Web services are implemented in a special XML programming language called XL [1, 2]. A Web service receives an XML message as input and returns an XML message as output. The platform supports a number of features that are particularly useful to implement Web services; e.g., logging, timetables, conversations, workflow management, automatic transactions, security. Our platform is going to be compliant with all W3C standards and emerging proposals. The programming language is very abstract and can be optimized automatically (like SQL). Furthermore, the platform allows to integrate Web services that are written in XL and other programming languages.
Microsoft Internet Information Server Training Kit with Cdrom
Authors: Microsoft Corporation
Venue:  (1998)

:Microsoft Internet Information Server Training Kit contains everything that support professionals and Webmasters need for teaching themselves to launch an Internet or intranet site using Microsoft Internet Information Server 4.0 and Microsoft Proxy Server 2.0. Experience Level: Advanced
Labeling Products of Complete Graphs with a Condition at Distance Two
Authors: John P. Georges, David W. Mauro, Melanie I. Stein
Venue: SIAM Journal on Discrete Mathematics (2001)

For integers $j \geq k$, an L(j,k)-labeling of a graph G is an integer labeling of the vertices in V(G) such that adjacent vertices receive integers which differ by at least j, and vertices which are distance two apart receive labels which differ by at least k. We determine $\lambda^j_k(K_n \times K_m)$ for all j,k,m,n, and $\lambda^{2}_1(K^q_{p^r})$ for $3 \leq q
Introducing FORTRAN 95: With Coverage of ISO TR 15580 and TR 15581
Authors: Ian D. Chivers, Jane Sleighthome
Venue:  (2000)

:Introducing Fortran 95 contains: examples highlighting the language features; details of a variety of internet-based sources which will prove invaluable for those seeking further information and support; and key features of the latest version of Fortran, including ISO Technical Reports TR 15580 and TR 15581 which will become a formal part of the next standard." "This comprehensive introduction will be essential to the complete beginner who wants to learn the fundamentals of programming using a modern, powerful, expressive and safe language; and to those wanting to update their programming skills by making the move from earlier versions of Fortran.
Mastering Delphi 4
Authors: Marco Cantu
Venue:  (1998)

:Introducing programmers to all of Delphi 4's new features and techniques, this reference explores secrets of the environment, the programming language, the custom components, and Windows 95 programming in general.
Pivots and structured play: stimulating creative user input in concept development
Authors: Tore Urnes, Åsmund Weltzien, Anne Zanussi, Solveig Engbakk, Julie Kleppen Rafn
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

Design methods based on participatory design need to stimulate creativity in potential users. We propose the pivot method to address this need during the concept development stage of the broader interactive system development process. Pivots are symbolic, yet physical, representations that allow a person to move back and forth between a figured (imagined) world and the real world. This movement generates experiences that can be exchanged and that stimulate creativity. We offer insights into the theoretical foundations of pivots and the pivot method. We also report on our experience from employing the pivot method during the development of a "universal remote controller" concept for a smart home.
Stack and Queue Layouts of Posets
Authors: Lenwood S. Heath, Sriram V. Pemmaraju
Venue: SIAM Journal on Discrete Mathematics (1997)

The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph. A lower bound of $\Omega(\sqrt n)$ is shown for the queuenumber of the class of n-element planar posets. The queuenumber of a planar poset is shown to be within a small constant factor of its width. The stacknumber of n-element posets with planar covering graphs is shown to be $\Theta(n)$. These results exhibit sharp differences between the stacknumber and queuenumber of posets as well as between the stacknumber (queuenumber) of a poset and the stacknumber (queuenumber) of its covering graph.
JOPI: a Java object-passing interface
Authors: Nader Mohamed, Jameela Al-Jaroodi, Hong Jiang, David Swanson
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

Recently there has been an increasing interest in developing parallel programming capabilities in Java to harness the vast resources available in clusters, grids and heterogeneous networked systems. In this paper, we introduce a Java object-passing interface (JOPI) library. JOPI provides Java programmers with the necessary functionality to write object-passing parallel programs in distributed heterogeneous systems. JOPI provides an MPI-like interface that can be used to exchange objects among processes. In addition to the well-known benefits of the object-oriented development model, using objects to exchange information in JOPI is advantageous because it facilitates passing complex structures and enables the programmer to isolate the problem space from the parallelization problem. The run-time environment for JOPI is portable, efficient and provides the necessary functionality to deploy and execute parallel Java programs. Experiments were conducted on a cluster system and a collection of heterogeneous platforms to measure JOPI's performance and compare it with MPI. The results show good performance gains using JOPI.
The Topological Asymptotic Expansion for the Dirichlet Problem
Authors: Ph. Guillaume, K. Sid Idris
Venue: SIAM Journal on Control and Optimization (2002)

The topological sensitivity analysis provides an asymptotic expansion of a shape function when creating a small hole inside a domain. This expansion yields a descent direction which can be used for shape optimization if one wishes to keep a classical domain throughout the optimization process. In this paper, such an expansion is obtained for the Poisson equation for a large class of cost functions and arbitrarily shaped holes. In the three-dimensional case, this expansion depends on the shape of the hole but not on its orientation if the cost function involves only the solution u to the underlying partial differential equation, whereas it may also depend on its orientation if the cost function involves the gradient $\nabla u$. In contrast, the asymptotic expansion is independent of the shape in the two-dimensional case. A numerical example illustrates the use of the asymptotic expansion, which yields a minimizing sequence of classical domains in a case where no classical solution exists.
A 2-Approximation Algorithm for the Directed Multiway Cut Problem
Venue: SIAM Journal on Computing (2002)

A directed multiway cut separates a set of terminals T={s1, . . . , sk} in a directed capacitated graph G=(V,E). Finding a minimum directed multiway cut is an NP-hard problem. We give a polynomial-time algorithm that achieves an approximation factor of 2 for this problem. This improves the result of Garg, Vazirani, and Yannakakis [Proceedings of the 21st International Colloquium on Automata, Languages, and Programming, Jerusalem, Israel, 1994, pp. 487--498], who gave an algorithm that achieves an approximation factor of 2 log k. Our approximation algorithm uses a novel technique for relaxing a multiway flow function in order to find a directed multiway cut. It also implies that the integrality gap of the linear program for the directed multiway cut problem is at most 2.
CCNP Cisco LAN Switch Configuration Study Guide, Exam 640-404, 1st edition
Authors: Syngress Media Inc.
Venue:  (1999)

:Ace the CCNP CLSC exam!Covering all official CCNP CLSC test objectives,CCNP Cisco LAN Switch Configuration Study Guide (Exam 640-404) draws on Cisco Systems Distinguished Training Partner Global Knowledge's100,000+ hours of training experience to deliver the ultimate CLSC study partner. Prepared by actual CCIEs and complete with Certification Exercises modeled after classroom labs,Exam Watch warnings that alert you to trick questions,experienced How to Take the Exam pointers,and more u this unmatched tool shows you how to: *Segment your Lan physically to reduce the number of nodes competing for bandwidth *Assign clients to VLANs,track them between switches,and integrate them with traditional backbone networks *Integrate a Catalyst 5000 series switch to maximize topology while minimizing congestion *Navigate the Catalyst Network Management Processor (NMP) Image Command Line Interface *Configure a set of Catalysts to implement a highly redundant network with multiple virtual LANs *Much more! Don't Let the Real Test Be Your First Test! Prepare to pass the CCNP Cisco LAN Switch Configuration exam - while gaining practical knowledge of Cisco technology for on-the-job success - using this comprehensive,100% curriculum-based training system. Built on the proven training methodology of Cisco Distinguished Training Partner Global Knowledge,this study guide/CD-ROM package uses expert teaching techniques from the company that trains more than 200,000 It professionals each year. The CCNP Cisco LAN Switch COnfiguration Study Guide covers the topics you need to review for exam 640-404,including how to: Segment your LAN physically to reduce the number of nodescompeting for available bandwidth; Assign clients to VLANs,track them between switches,and integrate them with traditional backbone networks; Place the Catalyst 5000 series switch in your network to maximize topology while minimizing bottlenecks and congestion; Navigate the Catalyst Network Management Processor (NMP) Image Command Line Interface; Configure a set of Catalysts to implement a highly redundant network with multiple virtual LANSs. Use the four embedded RMON groups in their Ethernet ports to aid in network management; Implement and troubleshoot the FDDI card in both trunked and non-trunked environments; Implement ClearChannel architecture in the 1900 series and 2920 Catalyst switches. 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
Edge-Connectivity Augmentation with Partition Constraints
Authors: JOrgen Bang-Jensen, Harold N. Gabow, Tibor Jordán
Venue: SIAM Journal on Discrete Mathematics (1999)

In the well-solved edge-connectivity augmentation problem we must find a minimum cardinality set F of edges to add to a given undirected graph to make it k-edge-connected. This paper solves the generalization where every edge of F must go between two different sets of a given partition of the vertex set. A special case of this partition-constrained problem, previously unsolved, is increasing the edge-connectivity of a bipartite graph to k while preserving bipartiteness. Based on this special case we present an application of our results in statics. Our solution to the general partition-constrained problem gives a min-max formula for |F| which includes as a special case the original min-max formula of Cai and Sun [Networks, 19 (1989), pp. 151--172] for the problem without partition constraints.When k is even the min-max formula for the partition-constrained problem is a natural generalization of the unconstrained version. However, this generalization fails when k is odd. We show that at most one more edge is needed when k is odd and we characterize the graphs that require such an extra edge.We give a strongly polynomial algorithm that solves our problem in time O(n(m + nlog n)log n). Here n and m denote the number of vertices and distinct edges of the given graph, respectively. This bound is identical to the best-known time bound for the problem without partition constraints. Our algorithm is based on the splitting off technique of Lovász, like several known efficient algorithms for the unconstrained problem. However, unlike previous splitting algorithms, when k is odd our algorithm must handle obstacles that prevent all edges from being split off. Our algorithm is of interest even when specialized to the unconstrained problem, because it produces an asymptotically optimum number of distinct splits.