ppxscal/embedding_network huggingface dataset:
Prentice Hall's Mous Test Preparation Guide for Excel 2000, 1st edition
Authors: Emily Ketcham, Carolyn Monroe
Venue:  (2001)

: Based on the MOUS exam itself (and certified by Microsoft), the streamlined PH MOUS Test Preparation Guide for Excel 2000 book/software package coaches users through successful completion of the MOUS certification exam--from Core to Expert skill levels. Dynamically interactive--enhanced by the unparalleled MOUS PinPoint 2000 software--it takes users step-by-step to guaranteed success. Each chapter focuses on specific learning objectives (based on the Core and Expert MOUS objectives), discusses specific skills necessary to complete the MOUS certification exam, and walks readers through condensed step-by-step mini-tutorials for a specific skill set. Readers then use the interactive program on the MOUS PinPoint interactive CD-ROM (included in every copy of the book) to see the material demonstrated, to complete in-text projects, and to practice for the MOUS exams. Getting Started with Excel. Edit Worksheet Contents. Modify Worksheet Structure. Use Complex Formulas. Manage Pages and Printing. Format Worksheets. Use Functions. Use Financial Functions. Create Charts. Use Excel with the Web. Handle Multiple Worksheets. Import and Export. Manage Data and Lists. Use Analysis Tools. Work with Templates. Create Macros and Customize Excel. Collaborate with Workgroups. For those preparing for the MOUS certification exam for Excel 2000.
Computing Concepts, 2nd edition
Authors: Tim Duffy, Traci Berchelmann
Venue:  (1994)

:Computing Concepts introduces you to what computers are, what they can do and how they impact our lives.
Why bother?: ethical computers - that's why!
Authors: Richard Lucas
Venue: Selected papers from the second Australian Institute conference on Computer ethics (2000)

This paper discusses the possibility and implication of ethical computers. A survey of past views is given. Various concepts considered important conceptions of ethics is discussed. The notion of agency and its importance to morality is covered. The consequences of their being ethical computers is examined. A Universal Declaration of Computer Rights is proposed and discussed. Thinking and feeling are not enough to make a computer ethical. Perhaps there are non-human ethics.
Mastering AutoDESK Architectural Desktop with Cdrom, 1st edition
Authors: Paul F. Aubin
Venue:  (2001)

:Discover the "whys" and "hows" of creating a complete set of professional-quality construction documents using features and functions contained in the newest release of Autodesk Architectural Desktop (ADT)! Written by a professional Autodesk Training Center (ATC) manager and successful national ADT applications engineer, Mastering Autodesk Architectural Desktop 3 focuses squarely on the rationale and practicality of the ADT process. Unlike other books that confront novices with a never-ending stream of seemingly discrete and unrelated commands, this book propels its readers to new skills using detailed examples and exercises that showcase the "why" as well as the "how" of using Autodesk Architectural Desktop to complete residential and commercial building design projects. The book begins by acquainting readers with the user interface and familiarizing them with the conceptual underpinnings of Autodesk Architectural Desktop software operations. Subsequent chapters enable readers to delve directly into the process of using their software to set up residential and commercial building projects, produce sections and elevations, generate schedules, design layouts, work with details, plot construction documents, and more! As a result, readers gain a first-hand understanding of the value of Autodesk Architectural Desktop as a professional design tool as well as practical knowledge of what can be and what ought to be modified. Prior experience using AutoCAD is assumed. However, no prior experience with Autodesk Architectural Desktop is required making this book perfect for today's professional architects, interior designers, facilities planners, and students.
Economics of Dynamic Pricing in a Reputation Brokered Agent Mediated Marketplace
Venue: Electronic Commerce Research (2001)

We present a framework to study the microeconomic effects in a reputation brokered Agent mediated Knowledge Marketplace, when we introduce dynamic pricing algorithms. We study the market with computer simulations of multiagent interactions. In this marketplace, the seller reputations are updated in a collaborative fashion based on the performance of the user in the delegated tasks. To the best of our knowledge this is the first agent mediated marketplace where the agents use dynamic pricing based on &ldquo;dynamically&rdquo; updated reputations. The framework can be used to investigate the different equilibria reached, based on the level of intelligence of the selling agents, the level of price-importance elasticity of the buying agents, and the level of unemployment in the marketplace. Preliminary experiments addressing these issues are presented.
U.S. Government on the Web: Getting the Information You Need
Authors: Peter Hernon, Robert E. Dugan, John A. Shuler
Venue:  (1999)

:There's a wealth of government information available on the Internet, most of it useful and much of it free! Now you can find and use the information your tax dollars pay for. Prepared by one of the country's foremost experts on U.S. government information and his colleagues, this timely guide organizes nearly 1,000 federal government Web sites and shows you how to find the information you need quickly and easily.. "More than a directory, this authoritative guide gives you a clear understanding of U.S. government agencies and the publications available.
MCSE 2000 JumpStart: Computer and Network Basics
Authors: Lisa Donald, Dan Newland
Venue:  (2000)

:Considering pursuing MCSE certification but don't know where to start? Use MCSE 2000 JumpStart to get up to speed on what you need to know [i]before[/i] you take the MCSE preparation courses. This book covers MCSE course prerequisites, providing a thorough grounding in computer and network basics. You'll learn what the components of computers are, which components affect which aspects of the computer's performance, and how networks harness the power of multiple PCs and peripherals. You'll also learn the basics of working with Windows 2000 networks. Great for both classroom use and self-study.
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)
Authors: Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Tom Leighton, Lisa Zhang
Venue: SIAM Journal on Computing (2000)

A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time traffic such as voice and video. The most critical performance parameter to bound is the delay experienced by a packet as it travels from its source to its destination.We study dynamic routing in a connection-oriented packet-switching network. We consider a network with arbitrary topology on which a set of sessions is defined. For each session i, packets are injected at a rate ri to follow a predetermined path of length di. Due to limited bandwidth, only one packet at a time may advance on an edge (link). Session paths may overlap subject to the constraint that the total rate of sessions using any particular edge is at most $1-\varepsilon$ for any constant $\varepsilon \in (0,1)$.We address the problem of scheduling the sessions at each switch, so as to minimize worst-case packet delay and queue buildup at the switches. We show the existence of a periodic schedule that achieves a delay bound of O(1/ri+di) with only constant-size queues at the switches. This bound is asymptotically optimal for periodic schedules.A consequence of this result is an asymptotically optimal schedule for the static routing problem, wherein all packets are present at the outset. We obtain a delay bound of O(ci + di) for packets on path Pi, where di is the number of edges in Pi and ci is the maximum congestion along edges in Pi. This improves upon the previous known bound of O(c + d), where d = maxi di and c = maxi ci.We also present a simple distributed algorithm that, with high probability, delivers every session-i packet to its destination within O(1/ri+di\log(m/rmin)) steps of its injection, where r min is the minimum session rate and m is the number of edges in the network. Our results can be generalized to (leaky-bucket constrained) bursty traffic, where session i tolerates a burst size of bi. In this case, our delay bounds become O(bi/ri + di) and O(bi/ri+di\log(m/rmin)), respectively.
Information visualisation using composable layouts and visual sets
Authors: Tim Pattison, Rudi Vernik, Matthew Phillips
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph. An attributed graph can be used to model a wide range of different types of information, including system descriptions and database content. We propose the novel Composable Layouts and Visual Sets (CLOVIS) class of views, and describe supporting software component infrastructure, including a user interface for creating and interacting with CLOVIS views. A framework for composing graph vertex layouts is presented, including the division of responsibilities between the layout strategies being composed and the mechanism for coordinating their execution. Three broad classes of layout strategy are identified, and opportunities for novel hybrid layouts highlighted. The definition of sets of graph elements and the allocation or overlaying of distinctive visual attributes to members of the set are combined under the notion of a visual set. A visual querying mechanism for the allocation of graph elements to visual sets and for the clustering of graph vertices in preparation for layout composition is described. The versatility of the CLOVIS view family is demonstrated through its application to a variety of problem domains, and future research directions are identified.
PhotoShop 5 for Windows and MacIntosh, 1st edition
Authors: Elaine Weinmann, Peter Lourekas
Venue:  (2000)

:Using this guide, beginners don't need to wander through menus or read a great deal of text. Extensive pictures and captions reassure readers that they are in the correct dialog box, pop-up menu, or entry field to do what they need. Used as a standard textbook in countless classrooms, and as a table-top reference by freelance computer artists everywhere, it's the book that explains Photoshop techniques clearly and quickly. Includes new and revised material on using Photoshop effectively for Web images as well as in multimedia productions. Also covers most of the higher-end changes in this version, including: improved color management, the new History palette, 16-bit channel support, layer effects, History brush, Magnetic Lasso and Magnetic Pen tools, Postscript type layers, and the expanded Actions palette.
MCSE Windows NT Server 4.0 in the Enterprise Study Guide (Exam 70-68)
Authors: Syngress Media Inc., Global Knowledge Network Staff
Venue:  (1998)

:Get Certified with the Global Knowledge Network Advantage! GlobalKnowledge Network Study Guides\\N are designed with one goal in mind: to help you pass a specific MCSE exam. No fluff or false promises Just the most focused and authoritative material available,based on thousands of hours of research and classroom experience - plus more practice exam questions than any other available study guide. Because Global Knowledge Network trains more than 150,000 network professionals each year,they can highlight specific areas in the exam that are to match the most recent changes in Microsoft's exam objectives. Curriculum-based,classroom-proven,and exam-tested - the Global Knowledge Network Advantage puts you on the fast track to your valuable MCSE credentials. The closest you can get to actually being in the classroom! EXAM WATCH - Warnings based on thorough post-exam research identifying the most troublesome exam questions - and how to answer them correctly! FROM THE CLASSROOM - Discussions of important issues direct from the classrooms of Global Knowledge Network's award-winning instructors CERTIFICATION Exercises - Step-by-step exercises that focus on specific skills most likely to be on the exam. TWO-MINUTE DRILL -Quick and concise checklists that summarize a chapter's main points - perfect for last-minute review! CHAPTER Self Tests - Reinforce your learning experience with chapter=specific questions similar to those found on the exam. HOW TO TAKE THE EXAM - Key pointers on how to maximize yourchances for success on exam day. FREE MEMBERSHIP to GLOBAL KNOWLEDGE NETWORK's ACCESS GLOBAL WEB SITE - Get MCSE exam updates,assessment tools and tips for success Chances for success onexam day. FREE MEMBERSHIP to GLOBAL KNOWLEDGE NETWORK's ACCESS GLOBAL WEB SITE - Get MCSE exam updates,assessment tools and tips for success
A note on planar 5-list colouring: non-extendability at distance 4
Authors: Zs. Tuza, M. Voigt
Venue: Discrete Mathematics (2002)

An L-list colouring of a graph G is a proper vertex colouring in which every vertex υ gets a colour from a prescribed list L(υ) of allowed colours.Albertson has posed the following problem: Suppose G is a planar graph and each vertex of G has been assigned a list of five colours. Let W ⊑ V(G) such that the distance between any two vertices of W is at least d (=4). Can any list colouring of W be extended to a list colouring of G?We give a construction satisfying the assumptions for d = 4 where the required extension is not possible. As an even stronger property, in our example one can assign lists L(υ) to the vertices of G with |L(υ)| = 3 for υ ∈ W and |L(υ)| = 5 otherwise, such that an L-list colouring is not possible. The existence of such graphs is in sharp contrast with Thomassen's theorem stating that a list colouring is always possible if the vertices of 3-element lists belong to the same face of G (and the other lists have 5 colours each).
A Methodology for Architecture-Level Reliability Risk Analysis
Authors: Sherif M. Yacoub, Hany H. Ammar
Venue: IEEE Transactions on Software Engineering (2002)

Risk assessment is an essential process of every software risk management plan. Several risk assessment techniques are based on the subjective judgement of domain experts. Subjective risk assessment techniques are human intensive and error-prone. Risk assessment should be based on product attributes that we can quantitatively measure using product metrics. This paper presents a methodology for reliability risk assessment at the early stages of the development lifecycle, namely, the architecture level. We describe a heuristic risk assessment methodology that is based on dynamic metrics. The methodology uses dynamic complexity and dynamic coupling metrics to define complexity factors for the architecture elements (components and connectors). Severity analysis is performed using Failure Mode and Effect Analysis (FMEA) as applied to architecture models. We combine severity and complexity factors to develop heuristic risk factors for the architecture components and connectors. Based on analysis scenarios, we develop a risk assessment model that represents components, connectors, component risk factors, connector risk factors, and probabilities of component interactions. We also develop a risk analysis algorithm that aggregates risk factors of components and connectors to the architectural level. Using the risk aggregation and the risk analysis model, we show how to analyze the overall risk factor of the architecture as the function of the risk factors of its constituting components and connectors. A case study of a pacemaker architecture is used to illustrate the application of the methodology. The methodology is used to identify critical components and connectors and to investigate the sensitivity of the architecture risk factor to changes in the heuristic risk factors of the architecture elements.
Buying Online for Dummies, 1st edition
Authors: Joseph W. Lowery, Tim Gallan
Venue:  (1998)

:Tired of shopping around? Ready to slap down some CyberCash and walk off with the goods? Let Buying Online For Dummies show you how to find the best virtual stores and make informed, safe, and successful Internet purchases. Complete with a CD containing the software you need to connect to an Internet Service Provider, this is your fun and easy guide to joining the online buying revolution! Inside, find helpful advice on how to: Set up an Internet connection optimized for online shopping Search the Internet for just the right product -- at just the right price Make secure transactions and follow up on problem orders Find out the difference between buying directly on the Internet and buying from online services, such as AOL Peruse the enclosed directory of significant safe sites full of cool stuff Buy and sell items through online classifieds Explore alternative purchasing options, such as CyberCash accounts
Unifying object-oriented programming with typed functional programming
Authors: Hongwei Xi
Venue: Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (2002)

The wide practice of object-oriented programming in current software construction is evident. Despite extensive studies on typing programming objects, it is still undeniably a challenging research task to design a type system for object-oriented programming that is both effective in capturing program errors and unobtrusive to program construction. In this paper, we present a novel approach to typing objects that makes use of a recently invented notion of guarded dependent datatypes. We show that our approach can address various difficult issues (e.g., handling "self" type, typing binary methods, etc.) in a simple and natural type-theoretical manner, remedying the deficiencies in many existing approaches to typing objects.
Roe linearization for the van der Waals gas
Authors: A. Guardone, L. Vigevano
Venue: Journal of Computational Physics (2002)

An extension of the Roe linearization method to nonideal gases is described and applied to the particular case of the van der Waals gas. A supplementary relation connecting the thermodynamic variables is introduced to decouple the evaluation of the intermediate velocity and total specific enthalpy from the determination of the intermediate density, needed in the Jacobian matrix of the linearization due to the general thermodynamic character of the gas. The density value is obtained by solving the supplementary equation, which involves the Roe average of velocity and enthalpy, and that in the case of the polytropic van der Waals gas is a third-order algebraic equation. Numerical results are shown including classical and nonclassical behaviour in one-dimensional shock tube problems.
Loops in combinator-based compilers
Authors: Mitchell Wand
Venue: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1983)

In our paper [Wand 82a], we introduced a paradigm for compilation based on combinators. A program from a source language is translated (via a semantic definition) to trees of combinators; the tree is simplified (via associative and distributive laws) to a linear, assembly-language-like format: the "compiler writer's virtual machine" operates by simulating a reduction sequence of the simplified tree. The correctness of these transformations follows from general results about the &lambda;-calculus. The code produced by such n generator is always tree-like. In this paper, the method is extended to produce target code with explicit loops. This is done by re-introducing variables into the terms of the target language in a restricted way, along with a structured binding operator.
Approximating Bandwidth by Mixing Layouts of Interval Graphs
Authors: D. Kratsch
Venue: SIAM Journal on Discrete Mathematics (2002)

We examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). We show that all of these graph classes admit efficient approximation algorithms which are based on exact or approximate bandwidth layouts of related interval graphs. Specifically, we obtain a bandwidth approximation algorithm for circular-arc graphs that executes in O(n log2 n) time and has performance ratio 2, which is the best possible performance ratio of any polynomial time bandwidth approximation algorithm for circular-arc graphs. For chordal graphs with at most k leaves in the clique tree, we obtain a performance ratio of 2k in O(k(n+m)) time, and our algorithm for k-polygon graphs has performance ratio 2k2 and runs in time O(n3).
A simple method & tool for web engineering
Authors: G. Griffiths, B. D. Hebbron, M. A. Lockyer, B. J. Oates
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

In this paper we propose a simple method for web engineering: The Simple Web Method (SWM, pronounced 'swim'). We also discuss tool support for Web Engineering and introduce our prototype WIPSE (Web Integrated Project Support Environment). Both are described in use and evaluated.
Quick Course in Microsoft Outlook 2000
Venue:  (2000)

:Microsoft Outlook 97 and 98 allow users to organize, find, and view information such as e-mail, personal calendar, group scheduling, and personal information and helps complete custom collaboration and information-sharing applications all in one place. Outlook 2000 builds upon this product vision, particularly in the areas of Internet standards support, ease of use and simplicity, and support of collaborative solutions. Outlook 2000 is a leading integrated e-mail and collaboration client for Internet-based messaging systems and it offers even more advanced functionality when used on a business intranet with Microsoft Exchange Server. The priority new features of Outlook 2000 are as follows: Hot New Features: Microsoft Office E-Mail. All Office 2000 applications integrate e-mail into their core functionality. Users can directly send any type of Office 2000 document as a message from within the application rather than as an attached file. All applications include a mail header toolbar to make this easy to accomplish. A totally different architectural approach provides a vast improvement from previous versions of WordMail. Outlook Today View. Combining e-mail messages, scheduled meetings, task lists, and a field to specify a contact search string, the Outlook Today view provides a snapshot of the essentials on a single screen. Preview Pane. In Outlook 2000, a preview window appears in the Inbox, allowing users to quickly view e-mail messages without opening the message. The AutoPreview view is now available for Calendar entries as well as e-mail messages. HTML Mail. Outlook 2000 fully supports sending and receiving e-mail in HTML. Users can edit fonts, HTML styles, and hyperlinks in WYSIWYG mode. HTML Mail can be anything from simple formatted text to a complete Web page, including images, and can be viewed offline if desired. In addition, Outlook 2000 manages multiple signatures for different occasions or different recipients in HTML, Rich Text Format (RTF), or plain text. Similarly, Outlook 2000 supports different HTML stationery with different fonts and backgrounds and provides the ability to set default and per-message stationery.