ppxscal/embedding_network huggingface dataset:
Microsoft Works for Teachers, 1st edition
Authors: Pamela R. Toliver
Venue:  (1996)

:Pack more punch in your lesson plans, average grades in a flash, and create works of art as you explore the modules of Microsoft Works. Microsoft ® Works For Teachers helps you use your skills with the word processor, spreadsheet, and database features. Whether you're using Works 3.0 or Works 4.0 for Windows 95, you'll discover ways to enhance your documents and pick up ideas for putting your students to work! Inside, find guidance on becoming a "techno-teacher" in no time: Unravel the magic of creating documents by using Works' Wizards Create a lesson plan template that you can use over and over again Merge names from your database with letters from the word processor Use art to dress up your text Chart data from your spreadsheet and use it in a report Create a portfolio of student work and add it to your database Add sticky-type notes to your documents Explore templates developed by other teachers -- and use them in your classroom Use your computer to place a phone call
Mastering PhotoShop 5.5 for the Web, 1st edition
Authors: Matt Straznitskas
Venue:  (1999)

:With in-depth looks at the works of ten Web gurus and real-world tips on working as a Web designer, this book addresses the unique issues designers face when manipulating images for the Web; digitizing images into the computer; creating paths, masks, and layers; using filters; creating dynamic fonts and type with shadows, bevels, and embossing; imaging mapping; batch processing; and animation. 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
EMERALDS: A Small-Memory Real-Time Microkernel
Authors: Khawar M. Zuberi, Kang G. Shin
Venue: IEEE Transactions on Software Engineering (2001)

EMERALDS (Extensible Microkernel for Embedded, ReAL-time, Distributed Systems) is a real-time microkernel designed for small-memory embedded applications. These applications must run on slow (15-25MHz) processors with just 32-128 kbytes of memory, either to keep production costs down in mass produced systems or to keep weight and power consumption low. To be feasible for such applications, the OS must not only be small in size (less than 20 kbytes), but also have low overhead kernel services. Unlike commercial embedded OSs which rely on carefully optimized code to achieve efficiency, EMERALDS takes the approach of redesigning the basic OS services of task scheduling, synchronization, communication, and system call mechanism by using characteristics found in small-memory embedded systems, such as small code size and a priori knowledge of task execution and communication patterns. With these new schemes, the overheads of various OS services are reduced 20-40 percent without compromising any OS functionality.
Identity criteria and sortal concepts
Authors: Massimiliano Carrara, Pierdaniele Giaretta
Venue: Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001 (2001)

In this paper we focus on a specific aspect of the notion of conceptualisation, i.e. on the issue of the specification of a certain kind of concept: sortal concept. Our starting point is the intuitive idea that a sortal concept cannot be specified in isolation from a general notion of entity. We think that this idea has some bearing on the way in which identity criteria should be conceived, since they are usually taken as a fundamental tool for the specification of a sortal concept. The first goal of our paper is to discuss and point out some difficulties concerning the relation between sortals and identity criteria. In general, we think that the specification of a sortal presupposes - in Russellian terms - a range of significance on which the concept is defined. It follows that the sortal cannot be stated without a specification of its range of significance. This means that identity criteria for a sortal K providing conditions of identity only for objects falling under K are not enough to specify K. Independently of this point, we are quite skeptical about the possibility of achieving a formal satisfactory definition of sortal. We will try to show that even Guarino and Welty's last proposal [4] does not succeed. Our second goal concerns which concepts are to be taken as sortals. By thinking that identity criteria are necessary and sufficient conditions for identity, Guarino and Welty cannot accept that, say, a is S1 and a is S2, in the case that S1 and S2 are associated with incompatible criteria. So they are lead to postulate, for example, that not a but b is S2 and a is constituted by b. We defend the thesis that it is possible to take some concepts - in our case S2 - as endowed only with necessary conditions for identity. We will argue for some specific choices.
Active Server Page how-to: The Definitive Active Server Pages Problem-Solver
Authors: Nathan Wallace
Venue:  (1997)

:Active Server Pages How-To will help you discover detailed, well-documented source code and accompanying explanations of core Active Platform technology elements; learn comprehensive Active Platform solutions for creating and integrating all five major Active Platform technology elements, including ActiveX controls, Active Server Pages and Components, Active data objects, ISAPI extensions and filters, and OLE DB; and examine 100 cutting-edge solutions for the Internet/Intranet using the Microsoft Active Platform.
Real-World Programming With Visual Basic 4, 2nd edition
Authors: Anthony T. Mann
Venue:  (1995)

:Readers can build on their programming knowledge and learn how to program for the real world with this newly revised and updated guide to the latest version of Visual Basic.Focuses on everyday programming problems and their solutionsCovers debugging, graphics, printing, MAPI, MDI, and moreCD-ROM includes all the source code from the book and programming utilities
Information delivery in support of learning reusable software components on demand
Authors: Yunwen Ye, Gerhard Fischer
Venue: Proceedings of the 7th international conference on Intelligent user interfaces (2002)

An inherent dilemma exists in the design of high-functionality applications (such as repositories of reusable software components). In order to be useful, high-functionality applications have to provide a large number of features, creating huge learning problems for users. We address this dilemma by developing intelligent interfaces that support learning on demand by enabling users to learn new features when they are needed during work. We support learning on demand with information delivery by identifying learning opportunities of which users might not be aware. The challenging issues in implementing information delivery are discussed and techniques to address them are illustrated with the CodeBroker system. CodeBroker supports Java programmers in learning reusable software components in the context of their normal development environments and practice by proactively delivering task-relevant and personalized information. Evaluations of the system have shown its effectiveness in supporting learning on demand.
The Glauber dynamics on colourings of a graph with high girth and maximum degree
Authors: Michael Molloy
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

(MATH) We prove that the Glauber dynamics on the C-colourings of a graph G on n vertices with girth g and maximum degree $\D$ mixes rapidly if (i) $C=q\D$ and $q>q^*$ where $q^*=1.4890... $ is the root of $(1-\rme^{-1/q})^2+q\rme^{-1/q}=1$; and (ii) $\D\geq D\log n$ and $g\geq D\log\D$ for some constant $D=D(q)$. This improves the corresponding result with $q\geq1.763\D$ obtained by Dyer and Frieze [FOCS01] for the same class of graphs.
Learn Visual dBASE Programming: A Hands-on Guide to Object-Oriented Database Programming/Book and Disk
Authors: Martin L. Rinehart
Venue:  (1995)

:database technologies--object-oriented programming and Windows programming--so that you can fully exploit Visual dBASE's major new capabilities. dBASE guru Martin Rinehart shows you how to develop professional-quality Windows applications. He focuses particularly on event-driven Windows programming methods and on creating reusable object classes for current and future projects. Learn Visual dBASE Programming features hundreds of authoritative tips that will enable you to maximize the strengths of this powerful new product. Discover how to develop from scratch important Windows classes not included in Visual dBASE, including: speedbars calendars classes simulating multiple-inheritance outline browsers. Learn Visual dBASE Programming's companion disk contains Windows classes that include trees, outlines, calendars, and critical path planning. During the course of this book you'll learn how to build professional-quality objects using the techniques you've mastered.
Monotonic reductions, representative equivalence, and compilation of intractable problems
Authors: Paolo Liberatore
Venue: Journal of the ACM (JACM) (2001)

The idea of preprocessing part of the input of a problem in order to improve efficiency has been employed by several researchers in several areas of computer science. In this article, we show sufficient conditions to prove that an intractable problem cannot be efficiently solved even allowing an exponentially long preprocessing phase. The generality of such conditions is shown by applying them to various problems coming from different fields. While the results may seem to discourage the use of compilation, we present some evidence that such negative results are useful in practice.
Teach Yourself . . . OS/2 2.0
Authors: CORPORATE MIS Press Staff
Venue:  (1993)

:OS/2 2.1 is better than ever! Award-winning author Judi Fernandez gives you complete coverage with this comprehensive tutorial for the powerful OS/2 operating system. Written for first-time users, teach yourself... OS/2 2.1 takes you step-by-step through OS/2's features. You'll learn how to start up OS/2, manipulate the objects on your desktop, and perform everyday tasks, such as formatting disks and deleting files - all with just a few clicks of the mouse. You'll also learn how to use some of OS/2's handy "applets" such as the Daily Planner, Calculator, Database, and Spreadsheet. Although the book assumes no previous knowledge, it is designed to help make full use of OS/2's processing power and memory capacity. As you progress, you will find you are able to tailor many of OS/2's features to meet your own personal needs. Fernandez concentrates on the most common tasks and frequently used features so that in no time at all, you'll be controlling OS/2 with ease and confidence. 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
Parallel Processing of Adaptive Meshes with Load Balancing
Authors: Sajal K. Das, Daniel J. Harvey, Rupak Biswas
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often also dynamic in nature in that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of unstructured grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing interprocessor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view of system loads across processors. In this paper, we propose a novel and general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication topology and compare its performance with a successful global load balancing environment, called PLUM, specifically created to handle adaptive unstructured applications. Our experimental results on an IBM SP2 demonstrate that the SBN-based load balancer achieves lower redistribution costs than that under PLUM by overlapping processing and data migration.
Bootstrapping for example-based data extraction
Authors: Paulo B. Golgher, Altigran S. da Silva, Alberto H. F. Laender, Berthier Ribeiro-Neto
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

The effortless generation of wrappers for Web data sources is a crucial task if proper access to the huge amount of semi-structured data on the Web is to be granted. In particular, the development of strategies for wrapper generation based on user-given examples is currently one of the most promising research directions in Web data extraction. In this paper we show how to use a pre-existing data repository to automatically generate examples and allow full automated example-based data extraction. To demonstrate the feasibility of our approach we provide a number of results obtained from experiments we carried out and discuss how our ideas can be used to improve extraction rates and for providing resilience and adaptiveness for example-based generated wrappers.
Handbook of Business Data Communications: A Managerial Perpective
Authors: Hossein Bidgoli
Venue:  (2000)

:Do you need a one-volume lesson about business applications of the Internet and other computer-based hardware and software? This book provides comprehensive coverage of four major areas:
Light widgets: interacting in every-day spaces
Authors: Jerry Alan Fails, Dan Olsen Jr.
Venue: Proceedings of the 7th international conference on Intelligent user interfaces (2002)

This paper describes a system for ubiquitous interaction that does not require users to carry any physical devices. In this system, the environment is instrumented with camera/processor combinations that watch users while protecting their privacy. Any visible surface can be turned into an interactive widget triggered by skin-colored objects. Light widgets are tied to the XWeb cross-modal interaction platform to empower them with interactive feedback.
Speculative Versioning Cache
Authors: T. N. Vijaykumar, Sridhar Gopal, James E. Smith, Gurindar Sohi
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively executed before the addresses of all preceding loads and stores are known. Furthermore, multiple speculative stores to a memory location create multiple speculative versions of the location. Program order among the speculative versions must be tracked to maintain sequential semantics. A previously proposed approach, the Address Resolution Buffer (ARB) uses a centralized buffer to support speculative versions. Our proposal, called the Speculative Versioning Cache (SVC), uses distributed caches to eliminate the latency and bandwidth problems of the ARB. The SVC conceptually unifies cache coherence and speculative versioning by using an organization similar to snooping bus-based coherent caches. Our evaluation for the Multiscalar architecture shows that hit latency is an important factor affecting performance and private cache solutions trade-off hit rate for hit latency.
Microsoft First Generation: The Success Secrets of the Visionaries Who Launched a Technology Empire, 1st edition
Authors: Cheryl D. Tsang
Venue:  (1999)

:What began as a modest start-up partnership only twenty-five years ago has already surpassed all the giants of contemporary capitalism, including General Electric and IBM, and has achieved a value estimated at nearly $500 billion. How did Microsoft achieve all of this in so short a time? What was the true nature of the Microsoft environment in the beginning, and what are the secrets behind its triumph?Find the answers here. With Microsoft First Generation, Cheryl Tsang skillfully renders recent history in bold, colorful strokes, highlighting each of the specific business qualities and entrepreneurial traits that turned Microsoft's dreams into reality. Meet the early builders of Microsoft, and step inside the famous culture of loyalty, the storied "maniacal work ethic," and the hardcore world of reckless risk-taking that remains so integral to the computer giant's matchless and ongoing success.Here, up close and personal, Tsang introduces readers to twelve members of Microsoft's mythic first generation, each of whom has walked away from Microsoft as a multimillionaire. The collection spans a diverse collection of creative geniuses and business wizards, from Bob O'Rear, employee number seven, who joined the team in 1977 and wrote the original MS-DOS program on the first IBM PC; to bestselling author Russell Borland who, after innocently answering a help wanted ad for a technical copywriter in 1980, suddenly became the mouthpiece of an entire company, singlehandedly familiarizing the world with Microsoft products; to Trish Millines, who began as a software tester in 1988 and then blazed a trail and effected lasting change as a powerful advocate for ethnic diversity in thetechnological arena.Featuring candid appraisals of the idiosyncrasies of software culture, fascinating portraits of the enigmatic Bill Gates, and rare photographs of the company's early days, Microsoft First Generation uncovers a range of surprising success secrets-and reveals, once and for all, exactly what makes Microsoft tick. 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
A near optimal algorithm for generating broadcast programs on multiple channels
Authors: Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, an expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.
Coterie Join Operation and Tree Structured k-Coteries
Authors: Takashi Harada, Masafumi Yamashita
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-coterie with higher availability. By recursively applying the coterie join operation in such a way that the above conditions hold, we define nondominated k-coteries, called tree structured k-coteries, the availabilities of which are thus expected to be very high. This paper then proposes a new k-mutual exclusion algorithm that effectively uses a tree structured k-coterie, by extending Agrawal and El Abbadi's tree algorithm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by k\log(n/k) in the best case, where n is the number of processes in the system.
Usability engineering: scenario-based development of human-computer interaction
Authors: Mary Beth Rosson, John M. Carroll
Venue:  (2001)

Usability Engineering: Scenario-Based Development of Human-Computer Interaction is a radical departure from traditional books that emphasize theory and address experts. This book focuses on the realities of product development, showing how user interaction scenarios can make usability practices an integral part of interactive system development. As you'll learn, usability engineering is not the application of inflexible rules; it's a process of analysis, prototyping, and problem solving in which you evaluate tradeoffs, make reasoned decisions, and maximize the overall value of your product.
Business Data Communications and Networking, 3rd edition
Authors: Raymond R. Panko
Venue:  (2000)

:Constructed around a unique modular design (eight core chapters cover the central concepts of networking and eight advanced modules provide additional information), Business Data Communications and Networking, Second Edition introduces the student to the key topics and issues essential to networking professionals.
Guide to Word Pro 96 for Windows 3.1
Authors: Gerry M. Litton
Venue:  (1995)

:Harness the power and versatility of Lotus's Word Pro 96 to produce professional-quality documents in record time with the expert guidance of word processing wizard Gerry Litton. Whether you're new to word processing and Word Pro 96 or have years of experience with Ami Pro or other word processors, you'll find this book invaluable. Step-by-step instructions and comprehensive coverage of the full range of Word Pro's features make this the only Word Pro book you'll need. First-time users will quickly learn how to type new text, edit and move it around the screen, and print their first documents. Seasoned users will discover these high-end Word Pro features: The all-new InfoBox - customize all the document design elements; styles - change the layout and appearance of your document quickly and easily; SmartMasters - adapt these document templates to simplify document design and ensure consistency; frames - position text and graphics with this powerful page layout tool; Word Pro's graphic tools - create your own graphics or import others; master documents - organize large documents such as newsletters and books; team editing tools - increase your workgroup's productivity...and many more!
A distributed token-based algorithm for the dynamic resource allocation problem
Authors: A. Bouabdallah, C. Laforest
Venue: ACM SIGOPS Operating Systems Review (2000)

This paper presents a distributed algorithm for the general dynamic resource allocation problem. A process may request any subset of the system resources (that may be available in several instances) during a request session. We focus on the message complexity which measures the number of messages a process incurs when it requests resources. The proposed algorithm is tokens-based and uses between 0 and n + 3k messages, where k is the total number of resources and n the total number of processes. On average, O (log n) messages are used if k is constant. Our solution allows several processes to enter their critical section simultaneously with respect to the exclusive access to resources requirement.