ppxscal/embedding_network huggingface dataset:
Computers in Chemistry
Authors: Peter J. Biggs
Venue:  (2000)

:Computers have become an integral part of chemistry. Virtually all modern scientific instrumentation contains some form of computer and, indeed, the operation of many instruments has become so complex that it is impossible without some degree of computer control. It is vital for the modern student of chemistry to have at least a basis knowledge of computers, and the deeper that knowledge is, the better use will be made of the techniques available." "Computers in Chemistry provides an overview of computers and their use in chemistry, giving the student an insight into both the workings of a computer and the ways in which computer facilities can be effectively applied in the study of chemistry today. 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
Multiple perspectives for collaborative navigation in CVE
Authors: Huahai Yang
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

Drawn from empirical studies on spatial cognition, this work explores ways of dynamically integrating others' perspectives and incorporating different views into a single interface for a 3D CVE user. It also designs an empirical study to test the effectiveness of different perspective displays on collaborative navigation performance.
Divergence in testing and readiness semantics
Authors: Michele Boreale, Rocco De Nicola, Rosario Pugliese
Venue: Theoretical Computer Science (2001)

Many variants of must-testing semantics have been put forward that are equally sensitive to deadlock, but differ for the stress they put on divergence, i.e. on the possibility for systems of getting involved in infinite internal computations. Safe-testing is one such variant, that naturally pops up when studying the behavioural pre-congruences induced by certain basic observables. Here, we study the relationship between safe-testing and Olderog's readiness semantics, a semantics induced by a natural process logic. We show that safe-testing is finer than readiness, and coincides with a refinement of readiness obtained by tuning Olderog's definition. For both safe-testing and the original readiness semantics we propose simple complete axiomatizations, which permit a fuller appreciation of their similarities and differences. Copyright 2001 Elsevier Science B.V.
Principles of Software Engineering Management, 2nd edition
Authors: Tom Gilb
Venue:  (1996)

:This book is designed to help software engineers and project managers to understand and solve the problems involved in developing complex software systems. It provides practical guidelines and tools for managing the technical and organizational aspects of software engineering projects.
Process support for distributed team-based software development workshop
Authors: Pierre F. Tiako, Tim Lindquist, Volker Gruhn
Venue: ACM SIGSOFT Software Engineering Notes (2001)

This report summarizes the 2nd International Workshop on Process Support for Distributed Team-based Software Development held at the Sheraton World Resort of Orlando, Florida, on July 25, 2000 in conjunction with the Information Systems, Analysis and Synthesis (ISAS2000) International Conference. An overall twenty people attended the workshop consisting of seven technical presentations in two plenary sessions. In the following, we outline the presentations and subsequent discussions, which included modeling and distributing process component, evolution and change, web-based framework, consistency management, and reuse and interoperability.The hardcopy of the papers selected for PDTSD'00 are published by the International Institute of Informatics and Systemics as a part of the "Industrial Systems" volume of ISAS 2000, ISBN 980-07-6695-2.
Piecewise Linear Skeletonization Using Principal Curves
Authors: Balázs Kégl, Adam Krzyżak
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We propose an algorithm to find piecewise linear skeletons of handwritten characters by using principal curves. The development of the method was inspired by the apparent similarity between the definition of principal curves (smooth curves which pass through the "middle" of a cloud of points) and the medial axis (smooth curves that go equidistantly from the contours of a character image). The central fitting-and-smoothing step of the algorithm is an extension of the polygonal line algorithm which approximates principal curves of data sets by piecewise linear curves. The polygonal line algorithm is extended to find principal graphs and complemented with two steps specific to the task of skeletonization: an initialization method to capture the approximate topology of the character, and a collection of restructuring operations to improve the structural quality of the skeleton produced by the initialization method. An advantage of our approach over existing methods is that we optimize the skeleton graph by minimizing an intuitive and explicit objective function that captures the two competing criteria of smoothing the skeleton and fitting it closely to the pixels of the character image. We tested the algorithm on isolated handwritten digits and images of continuous handwriting. The results indicate that the proposed algorithm finds a smooth medial axis of the great majority of a wide variety of character templates and substantially improves the pixelwise skeleton obtained by traditional thinning methods.
Rapid association rule mining
Authors: Amitabha Das, Wee-Keong Ng, Yew-Kwong Woon
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

Association rule mining is a well-researched area where many algorithms have been proposed to improve the speed of mining. In this paper, we propose an innovative algorithm called Rapid Association Rule Mining (RARM) to once again break this speed barrier. It uses a versatile tree structure known as the Support-Ordered Trie Itemset (SOTrieIT) structure to hold pre-processed transactional data. This allows RARM to generate large 1-itemsets and 2-itemsets quickly without scanning the database and without candidate 2-itemset generation. It achieves significant speed-ups because the main bottleneck in association rule mining using the Apriori property is the generation of candidate 2-itemsets. RARM has been compared with the classical mining algorithm Apriori and it is found that it outperforms Apriori by up to two orders of magnitude (100 times), much more than what recent mining algorithms are able to achieve.
The Wireless Data Handbook, 4th edition
Authors: James F. DeRose
Venue:  (1999)

:This new edition of a highly successful book is completely updated and revised to reflect the latest developments involving the transmission of digital information over wireless networks. Written by an industry expert with over 32 years in the field, the Wireless Data Handbook offers a broad, unbiased treatment--unencumbered by various corporate interests--covering both the technical and business aspects of wireless technologies. 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
Core Swing: Advanced Programming with Cdrom, 1st edition
Authors: Kim Topley
Venue:  (1999)

:The experienced developer's guide to the Swing classes! Core Swing helps you deliver the sophisticated Java GUI applications your users demand—with Java Swing techniques that start where other books leave off! Building on his bestseller Core Java Foundation Classes, Kim Topley takes on the toughest Swing issues raised by programmers throughout the Java community and addresses crucial topics first-generation Swing books completely missed. With Core Swing, you'll discover how to exploit the Swing tree and table controls to the fullest, customize and create your own text fields with features that sophisticated users expect, build your own editors and file viewers, and much more. There is complete and in-depth coverage of Swing's HTML support, a topic barely addressed in other Swing books. You'll also find detailed coverage of undo/redo and drag-and-drop, with lengthy, fully documented code examples, in the book and on the accompanying CD-ROM. Every Core Series book: DEMONSTRATES how to write commercial quality code FEATURES dozens of nontrivial programs and examples—no toy code! FOCUSES on the features and functions most important to real developers PROVIDES objective, unbiased coverage of cutting-edge technologies—no hype! Core Swing: Advanced Programming delivers: State-of-the-art insights into the Swing classes that other books can't touch Practical techniques for building the Swing components you really need Fast-track techniques for making the most of text controls, editors, tables, and drag-and-drop Hundreds of professional-level code examples CD-ROM The accompanying CD-ROM includes all of the book's detailed code examples a bonus chapter taken from Kim Topley's first book, Core Java Foundation Classes, and trial versions of SwingBuilder from SwingSoft and Netbeans.
Getting more out of Donath's hierarchical model for interconnect prediction
Authors: J Dambre, P. Verplaetse, D. Stroobandt, J. Van Campenhout
Venue: Proceedings of the 2002 international workshop on System-level interconnect prediction (2002)

Though it has become one of the most popular techniques for a priori wirelength estimation, Donath's method is heavily constrained by the underlying circuit and architecture models. In this paper, we propose analytical and numerical extensions to this model to overcome some of these constraints. It turns out that, with our extensions, Donath's model correlates very well with experimental data. This makes it particularly well suited for, among others, the parametric exploration of placement options.
Support for multitasking and background awareness using interactive peripheral displays
Authors: Blair MacIntyre, Elizabeth D. Mynatt, Stephen Voida, Klaus M. Hansen, Joe Tullio, Gregory M. Corso
Venue: Proceedings of the 14th annual ACM symposium on User interface software and technology (2001)

In this paper, we describe Kimura, an augmented office environment to support common multitasking practices. Previous systems, such as Rooms, limit users by constraining the interaction to the desktop monitor. In Kimura, we leverage interactive projected peripheral displays to support the perusal, manipulation and awareness of background activities. Furthermore, each activity is represented by a montage comprised of images from current and past interaction on the desktop. These montages help remind the user of past actions, and serve as a springboard for ambient context-aware reminders and notifications.
Video Demystified: A Handbook for the Digital Engineer
Authors: Keith Jack
Venue:  (1993)

:Covers the essentials of video technology with an emphasis on implementing video on computer systems for such applications as multimedia and video teleconferencing.
3d Photorealism Toolkit
Authors: Bill Fleming
Venue:  (1998)

:Cash in on the booming market for 3D photorealism with the 3D Photorealism Toolkit, written by the head of a successful West Coast 3D photorealistic modeling studio. You'll quickly master all the modeling, surfacing, staging, and lighting techniques needed to create images and scenes that look realistic enough to fool the most discriminating eye. With the help of dozens of examples executed in LightWave, 3D Studio Max, Form Z, Electricimage, Alias, Softimage, Strata and more, Bill Fleming shows you how to: add realistic imperfections, bevels, seams, nuts, bolts, and wear and tear to models; create a wide variety of material textures, including woods, metals, glass, plastics, paper, fabrics, skin, and more; enliven surfaces with color, luminosity, diffusion, secularity, glossiness, reflection, transparency, and bump; use camera position and focus to create the right mood; and create lighting effects for every occasion.
CorelDRAW for Linux F/X and Design with Cdrom
Authors: Shane Hunt
Venue:  (2000)

:The only book on this award-winning graphics program for the Linux platform. Incorporates CorelDRAW#s bundled application PhotoPaint&Acirc;&reg; by including tutorials that show how you can take CorelDRAW&Acirc;&reg; graphics into PhotoPaint for further manipulation. Appendices include helpful resources like working with images from other Linux sources, such as GIMP, lots of Linux graphics resources, and primary differences for those converting from Windows environment. Chock full of "Linuxy" projects that use the penguin as the sole model for these high-tech projects.
Parallel Programming and Java: Wotug 20, 1st edition
Authors: Andre E. Bakkers
Venue:  (1997)

:This book marks the transition from the traditional occam/transputer era to the implementation of CSP principles to object oriented languages, such as Java, C++ or occam, and other processors. An area that has totally evolved from ideas developed within the WoTUG community is the interprocessor communication. Here as well sound ideas from the transputer era are being elevated to other processor environments. The book is also an indication to the compiler writers who are concerned with the implementation of multi-threading and CSP principles into contemporary languages. In this they can see for themselves how parallel programming has come to age! 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
Computer Graphics and Geometric Modeling for Engineers, 1st edition
Authors: Vera B. Anand
Venue:  (1993)

:This book is also available through the Introductory Engineering Custom Publishing System. If you are interested in creating a course-pack that includes chapters from this book, you can get further information by calling 212-850-6272 or sending email inquiries to engineerjwiley.com. Uses an engineering perspective to computer graphics. Covers geometric modeling principles to promote the mastery of both theory and application of computer graphics. Features outstanding coverage of curves and surfaces and data structures. Contains flow charts, CAD database descriptions and engineering application problems to facilitate understanding. Numerous photographs illustrate engineering-oriented computer graphics.
C++ for Dummies: 4th Edition, 4th edition
Authors: Stephen Davis
Venue:  (2000)

:You will be able to conquer C++ with confidence using this completely revised and updated guide. This edition features expanded coverage of beginning programming in C++, with step-by-step instructions on non-object-oriented and object-oriented programming. The CD-ROM contains the C++ GNU compiler, sample code, and more.
Eshopper: America's Print Directory to Shopping the Internet
Authors: Richard J. Cowley
Venue:  (1999)

:A Consumer's Guide to Shopping the Internet is the only book of its kind: It is the source for comparison shopping over the internet. We feature easy access to hundreds of stores people want to shop, without the hassle of search engine and online directory fatigue. Shoppers can readily find famous labels, name brands, unique & unusual products, hard to find items at a variety of stores; including Designer Boutiques, Outlets, Department Stores, Online Malls, Specialty Shops, and more. Twenty-eight shopping categories include Apparel & Personal Care for Men, Women & Children, House & Home, Sporting Goods, Toys & Games, Food & Gourmet, Gifts & Gifts Ideas, Books, Music & Discounts, Weekly Specials, Closeouts, Overstocks, and we tell the shopper consumer plan a shopping excursion before logging on to the In 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
Scalable flow control for multicast ABR services in ATM networks
Authors: Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Kandlur
Venue: IEEE/ACM Transactions on Networking (TON) (2002)

We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal second-order rate control algorithm, called the &alpha;-control, designed to deal with the variation in RM-cell round-trip time (RTT) resulting from dynamic drift of the bottleneck in a multicast tree. Applying two-dimensional rate control, the proposed scheme makes the rate process converge to the available bandwidth of the connection's most congested rink sensed by the traffic source. It also confines the buffer occupancy to a target regime bounded by a finite buffer capacity as the system enters the equilibrium state. It works well irrespective of the topology of the multicast tree. Using the fluid analysis, we model the proposed scheme and analyze the system dynamics for multicast ABR traffic. We study the convergence properties and derive the optimal-control conditions for the &alpha;-control. The analytical results show that the scheme is stable and efficient in the sense that both the source rate and bottleneck queue length rapidly converge to a small neighborhood of the designated operating point. We present simulation results which verify the analytical observations. The simulation experiments also demonstrate the superiority of the proposed scheme to the other schemes in dealing with RM-cell RTT and link-bandwidth variations, achieving fairness in both buffer and bandwidth occupancies, and enhancing average throughput.
A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids
Authors: Yi-Jen Chiang, Ricardo Farias, Cláudio T. Silva, Bin Wei
Venue: Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics (2001)

In this paper, we present a unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of large unstructured grids on distributed-memory parallel machines. We parallelize the out-of-core isosurface extraction algorithm of [9] and the out-of-core ZSweep technique [17] for direct volume rendering, using the meta-cell technique as a unified underlying building block.Our one-time preprocessing first partitions the dataset into meta-cells that are stored in disk. From the meta-cells, we build a BBIO tree in disk, which can be used to speed up isosurface extraction, and a bounding-box file in disk, which is used for direct volume rendering. At run-time, we use a simple self-scheduling scheme [39] to achieve load balancing among the processors.We perform several experiments on a sixteen-node cluster of PCs connected by a gigabit ethernet, using datasets as large as 6.6 million cells. For the larger datasets, we have found that both our isosurface extraction and direct volume rendering approaches are perfectly scalable up to sixteen nodes.
A new refinement method for registration of range images based on segmented data
Authors: B. Kverh, A. Leonardis
Venue: Computing (2002)

We present a new method for registration of range images, which is based on the results we obtain from the segmentation process. We need two range images segmented into regions, each of them modeled by a parametric model and the approximation of the transformation between the two range images. Then two sets of corresponding points, one from each range image, are chosen and the transformation between them is computed to further refine the initial approximation of the transformation. The novelty is how we obtain the a corresponding points for the original sets of points from the range image. Namely, to obtain them we project set of points from the first range image onto geometric parametric models taht were recovered in the second range image and viceversa. This way we obtain two sets of corresponding points. Then we compute the transformation between the two sets. Few iterations are required to improve the initial approximation of the transformation. The results have shown a significant improvement in precision of the registration in comparison with traditional approches.
In-car cell phone use: mitigating risk by signaling remote callers
Authors: Punitha Manalavan, Asad Samar, Mike Schneider, Sara Kiesler, Dan Siewiorek
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

Research has linked in-car cell phone use with automobile accidents. We explore a signaling method that could mitigate that risk. We show in a first experiment how remote cell phone callers were induced to speak less during critical driving periods, and, in a second experiment, how driving performance in a simulator improved when callers reduced conversation levels during critical driving periods.
Identifying non-actionable association rules
Authors: Bing Liu, Wynne Hsu, Yiming Ma
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action still presents a major problem. A main obstacle is that many data mining algorithms often produce too many rules. Existing research has shown that most of the discovered rules are actually redundant or insignificant. Pruning techniques have been developed to remove those spurious and/or insignificant rules. In this paper, we argue that being a significant rule (or a non-redundant rule), however, does not mean that it is a potentially useful rule for action. Many significant rules (unpruned rules) are in fact not actionable. This paper studies this issue and presents an efficient algorithm to identify these non-actionable rules. Experiment results on many real-life datasets show that the number of non-actionable rules is typically quite large. The proposed technique thus enables the user to focus on fewer rules and to be assured that the remaining rules are non-redundant and potentially useful for action.
Leakage control with efficient use of transistor stacks in single threshold CMOS
Authors: Mark C. Johnson, Dinesh Somasekhar, Lih-Yih Chiou, Kaushik Roy
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

The state dependence of leakage can be exploited to obtain modest leakage savings in complementary metal-oxide-semiconductor (CMOS) circuits. However, one can modify circuits considering state dependence and achieve larger savings. We identify a low-leakage state and insert leakage-control transistors only where needed. Leakage levels are on the order of 35% to 90% lower than those obtained by state dependence alone. Using a modified standard-cell-design flow, area overhead for combinational logic was found to be on the order of 18%. The proposed technique minimizes performance impact, does not require multiple-threshold voltages, and supports a standard-cell design flow.
A new lower bound for the list update problem in the partial cost model
Authors: Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Venue: Theoretical Computer Science (2001)

The optimal competitive ratio for a randomized online list update algorithm is known to be at least 1.5 and at most 1.6, but the remaining gap is not yet closed. We present a new lower bound of 1.50084 for the partial cost model. The construction is based on game trees with incomplete information, which seem to be generally useful for the competitive analysis of online algorithms. 2001 Elsevier Science B.V.
Microsoft Windows Server for Dummies Quick Reference, 1st edition
Authors: Sue Plumley
Venue:  (1999)

:When business networks around the world start upgrading or migrating to Windows 2000, administrators are going to need quick answers. And that's just what they get in this latest addition to the For Dummies Quick Reference series, which comes packed with succinct explanations of everything from Active Directory to IntelliMirror.