ppxscal/embedding_network huggingface dataset:
A pseudo random coordinated scheduling algorithm for Bluetooth scatternets
Authors: András Rácz, György Miklós, Ferenc Kubinszky, Andrés Valkó
Venue: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking computing (2001)

The emergence of Bluetooth as a default radio interface allows handheld devices to be rapidly interconnected into ad hoc networks. Bluetooth allows large numbers of piconets to form a scatternet using designated nodes that participate in multiple piconets. A unit that participates in multiple piconets can serve as a bridge and forwards traffic between neighbouring piconets. Since a Bluetooth unit can transmit or receive in only one piconet at a time, a bridging unit has to share its time among the different piconets. To schedule communication with bridging nodes one must take into account their availability in the different piconets, which represents a difficult, scatternet wide coordination problem and can be an important performance bottleneck in buillding scatternets. In this paper we propose the Pseudo-Random Coordinated Scatternet Scheduling (PCSS) algorithm to perform the scheduling of both intra- and inter-piconet communication. In this algorithm Bluetooth nodes assign meeting points with their peers such that the sequence of meeting points follows a pseudo random process that is different for each pair of nodes. The uniqueness of the pseudo random sequence guarantees that the meeting points with different peers the node will collide only occasionally. This removes the need for explicit information exchange between peer devices, which is a major advantage of the algorithm. The lack of explicit signaling between Bluetooth nodes makes it easy to deploy the PCSS algorithm in Bluetooth devices, while conformance to the current Bluetooth specification is also maintained. To assess the performance of the algorithm we define two reference case schedulers and perform simulations in a number of scenarios where we compare the performance of PCSS to the performance of the reference schedulers
Mathematics and hybrid modeling: mathematics for simulation
Authors: Shane G. Henderson
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

I survey several mathematical techniques and results that are useful in the context of stochastic simulation. The concepts are introduced through the study of a simple model of ambulance operation to ensure clarity, concreteness and cohesion.
Quicken 98 6 in 1
Authors: Stephen J. O'Brien
Venue:  (1997)

:Save time and get productive with this comprehensive guide to the fundamentals of Quicken 98. Using short, easy-to-understand tutorials, cautions, and definition notes, you'll master all the tips, techniques, and procedures needed to save time, money, and frustration. Learn how use Quicken 98's accessories, manage your budgets, plan for college, organize your taxes, and much more. Using a friendly, task-oriented, easy-to-understand approach, Quicken 98 6-in-1 has all the information you need to enhance your skills and improve your productivity.
Multi-client LAN/WAN performance analysis of Ninf: a high-performance global computing system
Authors: Atsuko Takefusa, Satoshi Matsuoka, Hirotaka Ogawa, Hidemoto Nakada, Hiromitsu Takagi, Mitsuhisa Sato, Satoshi Sekiguchi, Umpei Nagashima
Venue: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) (1997)

Rapid increase in speed and availability of network of supercomputers is making high-performance global computing possible, including our Ninf system. However, critical issues regarding system performance characteristics in global computing have been little investigated, especially under multi-client, multi-site WAN settings. In order to investigate the feasibility of Ninf and similar systems, we conducted benchmarks under various LAN and WAN environments, and observed the following results: 1) Given sufficient communication bandwidth, Ninf performance quickly overtakes client local performance, 2) current supercomputers are sufficient platforms for supporting Ninf and similar systems in terms of performance and OS fault resiliency, 3) for a vector-parallel machine (Cray J90), employing optimized data-parallel library is a better choice compared to conventional task-parallel execution employed for non-numerical data servers, 4) computationally intensive tasks such as EP can readily be supported under the current Ninf infrastructure, and 5) for communication-intensive applications such as Linpack, server CPU utilization dominates LAN performance, while communication bandwidth dominates WAN performance, and furthermore, aggregate bandwidth could be sustained for multiple clients located at different Internet sites; as a result, distribution of multiple tasks to computing servers on different networks would be essential for achieving higher client-observed performance. Our results are not necessarily restricted to the Ninf system, but rather, would be applicable to other similar global computing systems.
Implementing a product line-based architecture in Ada
Authors: Joel Sherrill, Jennifer Averett, Glenn Humphrey
Venue: Proceedings of the 2001 annual ACM SIGAda international conference on Ada (2001)

This paper describes a software component model that encourages reuse in application families by recognizing and leveraging similarities between products within a product family, as well as among product families themselves. By applying a product-oriented view, developers gain insight into the capabilities of the organization's products and can leverage that insight to incorporate common software components across the entire enterprise. This component model is being applied to an existing family of similar embedded systems whose application software is written in Ada. Features of this language will be examined in the context of how they facilitate construction of reusable product line-based components.
On the orthographic dimension of definable sets
Authors: Stavros Cosmadakis, Gabriel Kuper, Leonid Libkin
Venue: Information Processing Letters (2001)

A formula &psgr; (x1,...,xn) conforms to a partition P of {x 1, ...,xn} if is equivalent to a Boolean combination of formulae that do not have free variables from more than one block of P. We show that if &psgr; conforms to two partitions P1 and P1 and P2, it also conforms to their greatest lower bound in the partition lattice. As a corollary, we obtain that the concept of orthographic dimension of a constraint-definable set, introduced in the field of constraint databases, is well-defined. 2001 Elsevier Science B.V. All rights reserved.
Learn Internet Publishing with Microsoft Publisher 97: A Complete Microsoft Publisher 97 Tutorial Including Details on Web Page Creation, Posting, and Maintenance
Authors: Russell A. Stultz
Venue:  (1997)

:ants, this book takes readers from a limited understanding of common Windows applications to a full understanding of desktop publishing with Publisher 97. Hands-on learning activities and fast publishing projects guide readers through an array of Publisher features.
Yahoo! for Dummies, 1st edition
Authors: Brad Hill
Venue:  (1999)

:Much more than just a search engine, Yahoo! offers many of the services Internet users regularly seek including shopping, auctions, travel planning, chat, and communities. Online guru Brad Hill helps readers get the most out of Yahoo!
Building efficient and effective metasearch engines
Authors: Weiyi Meng, Clement Yu, King-Lup Liu
Venue: ACM Computing Surveys (CSUR) (2002)

Frequently a user's information needs are stored in the databases of multiple search engines. It is inconvenient and inefficient for an ordinary user to invoke multiple search engines and identify useful documents from the returned results. To support unified access to multiple search engines, a metasearch engine can be constructed. When a metasearch engine receives a query from a user, it invokes the underlying search engines to retrieve useful information for the user. Metasearch engines have other benefits as a search tool such as increasing the search coverage of the Web and improving the scalability of the search. In this article, we survey techniques that have been proposed to tackle several underlying challenges for building a good metasearch engine. Among the main challenges, the database selection problem is to identify search engines that are likely to return useful documents to a given query. The document selection problem is to determine what documents to retrieve from each identified search engine. The result merging problem is to combine the documents returned from multiple search engines. We will also point out some problems that need to be further researched.
A parallel rendezvous algorithm for interpolation between multiple grids
Authors: Steve Plimpton, Bruce Hendrickson, James Stewart
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

A number of computational procedures employ multiple grids on which solutions are computed. For example, in multi-physics simulations a primary grid may be used to compute mechanical deformation of an object while a secondary grid is used for thermal conduction calculations. When modeling coupled thermo-mechanical effects, solution data must be interpolated back and forth between the grids each timestep. On a parallel machine, this grid transfer operation can be challenging if the two grids are decomposed to processors differently for reasons of computational efficiency. If the grids move or adapt separately, the complexity of the operation is compounded. In this paper we describe a grid transfer algorithm suitable for massively parallel codes which use multiple grids. It uses a rendezvous technique wherein a third decomposition is used to search for elements in one grid that contain nodal points of the other. This has the advantage of enabling the grid transfer to be load-balanced separately from the remainder of the computations. The algorithm has been implemented as an object-oriented tool for the multi-physics code SIERRA, currently under development at Sandia. Performance and scalability results for the grid transfer operation running on the Intel/Sandia TFLOPS supercomputer are presented.
News 3x/400's Power Tools for the as/400, 2nd edition
Authors: Dan Riehl
Venue:  (1995)

:Power Tools for the AS/400, Volume I provides you with a collection of the best AS/400 tools, tips, and techniques published in NEWS 3X/400 from 1988 through 1991. With this latest printing, the code that appears on the included diskette has been modified further to take advantage of the enhanced native facilities available on the AS/400 operating under V2R3 (these code updates do not appear in the text of the book).Easy-to-use, this volume provides you with a wealth of time-saving and productivity-enhancing tools. Discover the best way to maximize these tools in your day-to-day operations.
Quicken 2001 For Dummies
Authors: Stephen L. Nelson
Venue:  (2000)

:From balancing a checkbook to preparing our taxes, Quicken 2001 For Dummies enables you to get the most out of this powerful financial software. The book highlights the latest updates to Quicken while still covering al the basics. Absolute beginners to Quicken can refer to sections on installing the program and establishing basic accounts. Experienced Quicken users can refer to the book when calculating interest rates or preparing financial security for the future. The book also provides hassle-free instruction on the latest features for tracking loans, mortgages, and investments such as stocks and mutual funds. Special tips are included on bookkeeping without fear, surviving an audit, and banking online. 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
Reconstruction of Linearly Parameterized Models from Single Images with a Camera of Unknown Focal Length
Authors: David Jelinek, Camillo J. Taylor
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper deals with the problem of recovering the dimensions of an object and its pose from a single image acquired with a camera of unknown focal length. It is assumed that the object in question can be modeled as a polyhedron where the coordinates of the vertices can be expressed as a linear function of a dimension vector, $\lambda$. The reconstruction program takes as input, a set of correspondences between features in the model and features in the image. From this information, the program determines an appropriate projection model for the camera (scaled orthographic or perspective), the dimensions of the object, its pose relative to the camera and, in the case of perspective projection, the focal length of the camera. This paper describes how the reconstruction problem can be framed as an optimization over a compact set with low dimension¿no more than four. This optimization problem can be solved efficiently by coupling standard nonlinear optimization techniques with a multistart method which generates multiple starting points for the optimizer by sampling the parameter space uniformly. The result is an efficient, reliable solution system that does not require initial estimates for any of the parameters being estimated.
Teen use of messaging media
Authors: Diane J. Schiano, Coreena P. Chen, Ellen Isaacs, Jeremy Ginsberg, Unnur Gretarsdottir, Megan Huddleston
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

Teenagers compromise a large proportion of our population, and their technology use is a bellwether of future trends. Today's teens are coming of age with the rapid development of advanced communication and media tools. This paper describes a study exploring teen communication media usage patterns and their design implications.
QuarkXPress 3.3 Training
Authors: Quay2 Multimedia
Venue:  (1995)

:Each CD provides three to six hours of narrated instruction, divided into modules lasting one to seven minutes. The modules range from basic operations to advanced case studies. Using Training on CD is easy: You can instantly jump into, out of, forward, or backward in any module. As you complete the modules, the program keeps track of your progress. In addition, each Training on CD provides a command reference and a hyperlinked index, allowing you to jump from an index directly into a demonstration of the topic. QuarkxPress topics covered include: basic operations, text control, text boxes, page control, master pages, pictures, style sheets, chain and edit text, color, item control, library, rules and tabs, hypenation and justification, typography, and printing. Other topics include: keyboard shortcuts, the Tool Box, shortcuts, document examples, and demonstrations of 31 XTensions.
HTML 4 Unleashed, 1st edition
Authors: Rick Darnell
Venue:  (1997)

:A comprehensive guide and reference to the foundation language of the World Wide Web, HTML 4 Unleashed provides an exhaustive resource devoted to the language of Web development. The Web's explosive growth continues to provide us with an expanding market of Web authors ranging from casual home hobbyists to the professional Web developer. HTML 4 Unleashed will provide these readers the information they need to grow with an ever-changing technology.Covers all the latest proprietary extensions, including Microsoft's Active HTML and Netscape's JavaScript StylesheetsIncludes information on integrating HTML with other technologies like Java and ActiveXDetails new HTML technologies like the experimental "Cougar" specification, Cascading Style Sheets and Extensible Markup Language (XML)
Impact of link failures on VoIP performance
Authors: Catherine Boutremans, Gianluca Iannaccone, Christophe Diot
Venue: Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video (2002)

We use active and passive traffic measurements to identify the issues involved in the deployment of a voice service over a tier-1 IP backbone network. Our findings indicate that no specific handling of voice packets (i.e. QoS differentiation) is needed in the current backbone but new protocols and mechanisms need to be introduced to provide a better protection against link failures. We discover that link failures may be followed by long periods of routing instability, during which packets can be dropped because forwarded along invalid paths. We also identify the need for a new family of quality of service mechanisms based on fast protection of traffic and high availability of the service rather than performance in terms of delay and loss.
Swat 3: Close Quarters Battle
Authors: Eric Lionel Pratte
Venue:  (1999)

:SWAT 3 offers real-time police action, and Prima's Official Strategy Guide will help players succeed as the leaders of the team. The guide provides, strategies for missions, hints on commanding, and information on special weapons. This unique game is packed with realistic combat scenarios pulled straight from the headlines, and Prima's Official Strategy Guide will guide players through them.
Compiler optimization on instruction scheduling for low power
Authors: Chingren Lee, Jenq Kuen Lee, TingTing Hwang, Shi-Chun Tsai
Venue: Proceedings of the 13th international symposium on System synthesis (2000)

In this paper, we investigate the compiler transformation techniques to the problem of scheduling VLIW instructions aimed to reduce the power consumption on the instruction bus. It can be categorized into two types: horizontal and vertical scheduling. For the horizontal case, we propose a bipartite-matching scheme. We prove that our greedy algorithm always gives the optimal switching activities of the instruction bus. In the vertical case, we prove that the problem is NP-hard, and propose a heuristic algorithm. Experimental results show average 13% improvements with 4-way issue architecture and average 20% improvement with 8-way issue architecture for power consumptions of instruction bus as compared with conventional list scheduling for an extensive set of benchmarks.
Separation of concerns and operating systems for highly heterogeneous distributed computing
Authors: Yasuhiko Yokote, Gregor Kiczales, John Lamping
Venue: Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs (1994)

Highly heterogeneous distributed computing applications present a tremendous challenge for operating system implementors. These applications present an extremely wide range of demands and must run in an extremely wide range of environments. In order to recognize the wide range of environments, without losing the benefits of traditional modularity, we propose a separation of concerns approach to the design of operating systems for this domain. In this paper, we first discuss importance of separation of concerns particularly in highly heterogeneous distributed computing. The discussion is based on the issues we encounter when programming of distributed applications such as for networked copiers, settop boxes for cablenets, networked analyzers/oscilloscopes, or palmtop computers. We then propose a way to solve them without sacrifice of performance. This paper contributes to this workshop in the sense that it addresses frustrations of programmers, particularly of embedded systems, and demonstrates our technology to solve their frustration from an operating systems' perspective.
A practical structure for a very large time sequential data base
Authors: Thomas A. Ball, Eugene M. Strand, John A. Mantle
Venue: Proceedings of the 18th annual Southeast regional conference (1980)

This paper discusses the practical aspects of incorporating an indexed sequential file structure into a large time sequential data base, which includes the sequence of intervals between heartbeats measured from the electrocardiogram (ECG). First, the paper describes the time sequential data base. Secondly, the paper presents uses made of the time sequential file. Finally, the paper describes the indexed sequential data structure developed to support this application.
Upgrade Your Own PC, 2nd edition
Authors: Linda Rohrbough
Venue:  (1998)

:Don't you hate leaving your computer at the local retail shop, never knowing how long you'll be disconnected and subjecting your bank account to the exorbitant repair costs, labor mark-ups, and hidden service charges? Now you can take your technical maintenance matters into your own hands with Upgrade Your Own PC, Second Edition. Armed with Upgrade Your Own PC, Second Edition, you can quickly and easily boost performance, boost memory, incorporate multimedia applications, add video and audio functionality, utilize external drives, and even convert your old PC into a state-of-the-art power client. Acclaimed author Linda Rohrbough explains simple and advanced upgrade procedures in clear terminology and step-by-step instructions. Every chapter begins by listing the tools needed to execute the specific upgrades and Rohrbough concludes Upgrade Your Own PC, Second Edition with a detailed glossary and appendix listing contact information for the companies discussed in the book.
Developing Client/Server Systems with Oracle Developer/2000
Authors: Paul Hipsley
Venue:  (1996)

:Developing Client/Server Applications with Oracle Developer/2000 is your key to tapping the new, powerful features of the industry's only second-generation client/server development tool. Those features - including a common repository, flexible modeling and methodology support, unified client/server development environment, and portable open architecture - enable you to rapidly produce and develop client/server applications. With this book, you'll learn how to develop those applications from start to finish. It begins by showing you how to design a client/server application. Next you'll be building the database and exploiting the power of Developer/2000 by incorporating VBX controls, OLE 2 Objects, and using SQL and PL/SQL. Final chapters show you how to deploy and implement your finished client/server application.
Computer science: the science of and about information and computation
Authors: Ruzena Bajcsy, Craig Reynolds
Venue: Communications of the ACM (2002)

New computing paradigms present serious challenges for system architecture.
Of Two Minds
Authors: Michael Joyce
Venue:  (1994)

:A story is told about two elderly sisters who made a pact that the first to die would, as her death approached, begin talking to the other sister at her bedside. The dying sister was to tell everything she heard and saw, attempting to talk without ceasing up to and, if at all possible, past the point of death. The sisters did not dare to hope that they could penetrate the dark edge of existence. Rather, they wished to off the comfort of knowing they were not lost to each other at the end of time.
Mathematical Techniques in Multisensor Data Fusion
Authors: David Lee Hall
Venue:  (1992)

:This invaluable reference offers the most comprehensive introduction available to the concepts of multisensor data fusion. It introduces key algorithms, provides advice on their utilization, and raises issues associated with their implementation. With a diverse set of mathematical and heuristic techniques for combining data from multiple sources, the book shows how to implement a data fusion system, describes the process for algorithm selection, functional architectures and requirements for ancillary software, and illustrates man-machine interface requirements an database issues.