ppxscal/embedding_network huggingface dataset:
Efficient Collision Detection for Curved Solid Objects
Authors: Elmar Schömer, Joachim Reichel, Thomas Warken
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

The design-for-assembly technique requires realistic physically based simulation algorithms and in particular eﬃcient geometric collision detection routines. Instead of approximating mechanical parts by large polygonal models, we work with the much smaller original CAD-data directly, thus avoiding precision and tolerance problems. We present a generic algorithm, which can decide whether two solids intersect or not. We identify classes of objects for which this algorithm can be eﬃciently specialized, and describe in detail how this specialization is done. These classes are objects that are bounded by quadric surface patches and conic arcs, objects that are bounded by natural quadric patches, torus patches, line segments and circular arcs, and objects that are bounded by quadric surface patches, segments of quadric intersection curves and segments of cubic spline curves. We show that all necessary geometric predicates can be evaluated by ﬁnding the roots of univariate polynomials of degree at most 4 for the ﬁrst two classes, and at most 8 for the third class. In order to speed up the intersection tests we use bounding volume hierarchies. With the help of numerical optimization techniques we succeed in calculating smallest enclosing spheres and bounding boxes for a given set of surface patches fulﬁlling the properties mentioned above.
3d Studio Max R3 in Depth with CD-ROM
Authors: Rob Polevoi, Jon A. Bell
Venue:  (1999)

:Discusses the latest techniques for the most popular 3D animation and modeling software in the digital design industry. Shows the reader how to render an object for the modeling process, and create 3D animations and visual effects. Highlights the uses of MAX as a character animation tool. Provides users with a comprehensive reference for creating effects for film, movies, and games. Guides readers through comprehensible lessons that build their special-effects skills for moviemaking in a simple manner. This is different from competitors' books, which are notoriously difficult to understand. Discusses how to use affordable PCs to create the kinds of animations and special effects that traditionally required costly graphics workstations and supercomputers. Unlike competitors' books that are complex and offer no color, 3D Studio MAX R3 In Depth is easy to use and understand, and includes a stellar 32-page Color Studio that showcases the sophisticated results that readers can create through the projects in the book. Contains all of the significant MAX and image files used for demonstration in the book so that readers can experiment directly with the concepts presented. Offers a collection of powerful MAX scripts to both teach the methods and value of this technology and to provide a set of helpful tools. Samples of rendered and animated objects and third-party and custom MAX plug-ins.
On the order of a generalized hexagon admitting an ovoid or spread
Authors: Alan Offer
Venue: Journal of Combinatorial Theory Series A (2002)

It is shown that a finite generalized hexagon of order (s, t) can have an ovoid or a spread only if s = t.
Visual representations for recursive algorithms
Authors: Linda Stern, Lee Naish
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

We have developed a framework for pedagogically-oriented animations, designed to help students learn new algorithms. Recursive sorting and searching algorithms pose a particular challenge, as it can be difficult to find visual representations that help students develop a mental model of how the recursion proceeds. Relatively complex representations, such as thumbnail sketches or explicitly showing the function stack along with the data structure are appropriate for some algorithms, while simpler representations suffice for others. We have found it useful to classify recursive algorithms according to the way they navigate through a data structure and manipulate data items within it, sometimes with further subdivision according to the kind of recursion. Within each category there are common strategies for visual representation. While there may be no single, general way to represent recursive algorithms, classification is a useful guide to picking an appropriate strategy when animating recursive algorithms.
3d Modeling in AutoCAD: Creating and Using 3d Models in AutoCAD 2000 with Cdrom
Authors: John E. Wilson
Venue:  (1998)

:This book will systematically lead readers through all of AutoCAD Release 14's 3D features to become fluent in creating 3D models. The book fully details each command, explains the underlying concepts, and provides numerous examples and exercises to show how the commands can be used to make practical 3D models. The author guides readers step-by-step through 3D mastery: beginning towork in 3D space; creating surface models and solid models; making 2D multiview, dimensioned drawings from 3D models; and making photorealistic images from AutoCAD 3D models.
Corel WordPerfect 8 for Windows for Dummies, 1st edition
Authors: Margaret Levine Young
Venue:  (1997)

:WordPerfect 8 For Windows For Dummies is the ideal reference for new WordPerfect users, those who are upgrading from previous versions of WordPerfect, or anyone who is switching from another word processing program. This handy guide leads you through all your everyday needs and steers you away from the technical stuff you don't really need to know. Inside, find helpful advice on how to Create beautifully formatted documents by using WordPerfect formatting features Master the Toolbar and Ruler to gain total control over WordPerfect Find out about WordPerfect codes and how to keep them under control Use graphics, columns, borders, and backgrounds to jazz up your documents Solve your printing problems with the troubleshooting "Big Trouble" chapter Correct your typing and spelling mistakes "automagically" by using the QuickCorrect and Spell-As-You-Go features Plus, Margy, Dave, and Jordan's Top Ten Lists of WordPerfect tips
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
Authors: Timothy M. Chan
Venue: SIAM Journal on Computing (2000)

Given n points in three dimensions, we show how to answer halfspace range reporting queries in O(log n+k) expected time for an output size k. Our data structure can be preprocessed in optimal O(n log n) expected time. We apply this result to obtain the first optimal randomized algorithm for the construction of the $(\le k)$-level in an arrangement of n planes in three dimensions. The algorithm runs in O(n log n+nk2) expected time. Our techniques are based on random sampling. Applications in two dimensions include an improved data structure for "k nearest neighbors" queries and an algorithm that constructs the order-k Voronoi diagram in O(n log n+nk log k) expected time.
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
Authors: Bernhard Beckermann, George Labahn
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton--Padé, Hermite--Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given problem. Solutions for all (possibly singular) subproblems along offdiagonal paths in a solution table are also computed by stepping around singular blocks on a path corresponding to "closest" regular interpolation problems.The algorithms are suitable for computation in exact arithmetic domains where growth of coefficients in intermediate computations is a central concern. This coefficient growth is avoided by using fraction-free methods. At the same time, the methods are fast in the sense that they are at least an order of magnitude faster than existing fraction-free methods for the corresponding problems. The methods make use of linear systems having a special striped Krylov structure.
Special Edition Using MS-DOS 6.22, 2nd edition
Authors: Allen L. Wyatt, Allen L. Wyatt,  Sr.
Venue:  (1999)

:Special Edition Using MS-DOS 6.22, Second Edition, offers coverage in the following areas: 1) Using DOS commands in a Windows 95/98 environment. There are many tasks that can be done faster and better in DOS than Windows if the user knows how. 2) Bonus coverage of popular non-Microsoft versions of DOS including Caldera's DR-DOS. 3) Coverage of essential third party DOS utilities and add-ons. 4) Exclusive Y2K coverage. See what hardware and software solutions exist to prevent Y2K DOS headaches. 5) DOS is still important for many popular games. See how to best configure a Windows 95 or Windows 98 machine to dual boot to DOS for maximum performance. And much more!
Agent-supported portals and knowledge management in complex R&D projects
Authors: Jean-Paul A. Barth&#x00E8;s Cesar A. Tacla
Venue: Computers in Industry (2002)

This paper is concerned with organizing knowledge management in complex R&D projects where time is the prime factor. We argue that specific portals developed using groupware technology and products should be augmented by agents in order to increase the overall system reactivity and achieve the global objective, namely to save time. We describe a portal we have developed using a groupware approach, we give the structure of a system of cognitive agents, and discuss our current attempt to bring the two technologies together.
Oracle Performance Tuning 101
Authors: Gaja Krishna Vaidyanatha, John A. Kostelac
Venue:  (2001)

:Your Oracle career starts here! Ideal for those new to Oracle technology,this officially authorized guide teaches new DBAs the essentials of keeping an Oracle database running at top performance. You'll get coverage of application,instance,database,I/O,OS,and contention tuning. Learn to optimize and fine-tune your Oracle system's overall performance Implement tuning solutions using the proven methodology found inside Oracle Performance Tuning 101 gives you step-by-step practical advice for removing bottlenecks,minimizing downtime,and increasing overall system performance. You'll also get tips for identifying Oracle's current bottlenecks,prioritizing and performing tuning operations,writing optimal SQL,interpreting statistics,and much more. Written in a clear and engaging style,this book explains how to manage the tuning efforts of various components of your entire system in a methodical fashion,eliminating all guesswork. Understand the key components of a tuning methodology Set performance objectives,establish goals,and cease efforts when goals are met Learn how to generate well-written SQL commands&shy;&shy;and know how to recognize poorly written SQL Tune and manage various components of the Oracle Instance Use meaningful Oracle initialization parameter settings Implement proactive management of space in the Oracle database Understand I/O tuning with extensive coverage on implementing RAID on Oracle Get details on operating system tuning for Solaris,HP-UX,AIX,and Windows NT Every chapter includes one or more myths and folklores about the topic,examples,and an "In a Nutshell" sectionall geared to reinforce theknowledge you've acquired.
PERL ! I Didn't Know You Could Do That...
Authors: Martin C. Brown
Venue:  (2000)

:Intensify your Web site with the amazing tips and tricks found in this book. Learn how to create dazzling Web sites that will have em' in awe of your skill. The ready-to-use code found on the accompanying CD makes your transcendence to greatness even easier. Get the most out of Perl with tricks on data and text manipulation, CGI, networking, and more. Go Bananas with Perl Before you know it, you'll be setting up cookies, sending binary files from Perl, communicating with AppleScript, reading and writing Tar Archives, and even more. Combine the Perl utilities with the code found on the CD and you'll quickly be able to create stunning Web pages. Work Smarter and Have More Fun Than a Barrel of Monkeys! Put Perl and its many applications to work. Read and write audio files Generate RTF files Use Apache Authentication Run a Socket-Based Server Write POD documentation Monitor uptime Talk with Microsoft Word and Excel And More!
Inside MS-DOS 6.22: With Disk, 3rd edition
Authors: Mark Minasi
Venue:  (1994)

:This is the perfect tutorial for advanced-level users who want to optimize their DOS system to make their computers run faster, more efficiently, and with fewer problems.Provides extensive coverage of DriveSpace, Microsoft's new disk compression utilityIncludes a discussion of MS-DOS 6.22 Step-Up upgrade and a complete DOS command referenceDisk contains a pop-up directory finder, smart disk-copy program, an updated virus detection program and associated database, as well as utilities
XHTML Essentials
Authors: Michael Sauers, Mike Fitzgerald
Venue:  (2001)

:With Web access becoming available through TV, handheld devices, and even phones, developers need to create sites that can be viewed from different environments, not just from the desktop. Introducing XHTML, the next generation HTML, this practical guide jumpstarts Web developers on the technology that ensures that their Web pages stay true-to-form on any available platform. Using extensive code and real-world examples, XML expert Michael Sauers teaches readers how to apply XHTML quickly and effectively without having to become XML programmers first. Readers will learn how to migrate legacy HTML documents to XHTML and create documents and applications for a variety of platforms. Like the other books in the series, an appendix listing will feature where to find updated information, a source code index, and other handy features.
When is Individual Testing Optimal for Nonadaptive Group Testing?
Authors: S. H. Huang, F. K. Hwang
Venue: SIAM Journal on Discrete Mathematics (2001)

The combinatorial group testing problem is, assuming the existence of up to d defectives among n items, to identify the defectives by as few tests as possible. In this paper, we study the problem for what values of n, given d, individual testing is optimal in nonadaptive group testing. Let N(d) denote the largest n for fixed d for which individual testing is optimal. We will show that N(d)=(d+1)2 under a prevalent constraint in practical nonadaptive algorithms and prove that N(d)=(d+1)2 for d=1, 2, 3, 4 without any constraint.
On-Line Resume and Job Search, 1st edition
Authors: Karl Barksdale, Michael Rutter
Venue:  (1999)

:On-Line Resumes and Job Search teaches time-proven strategies for successful job finding using the Internet. These include everything from assessing one's abilities in a personal inventory to evaluating job descriptions to creating professional resumes to preparing for a job interview.
Microsoft Access 97: Introductory Concepts and Techniques, 10th edition
Authors: Gary B. Shelly, Phillip J. Pratt, Thomas J. Cashman
Venue:  (1997)

:Part of the highly successful Shelly Cashman Series, this text offers a clear screen-by-screen, step-by-step approach to learning basic Access 97 skills.
Using Microsoft Works 4.0 for Windows 95, 1st edition
Authors: Glenn T. Smith, Richard T. Christoph
Venue:  (1998)

:All books in this series offer consistent presentationcommon design, pedagogy, and writing style. Concepts as well as key-strokes are stressed. Hands-on exercises in every lesson provide just the right amount of practice time. MOUS Certification throughout the expert level for all individual applications and Office 2000. Three levels of chapter-ending exercises, multiple choice, practice, and case studies. For anyone interested in becoming more proficient in Microsoft Office 2000.
Solaris 8: The Complete Reference
Authors: Sriranga Veeraraghavan, Paul A. Watters
Venue:  (2001)

From the Book:It's been an incredible journey for Sun Microsystems and its flagship operating system, Solaris. Sun released the first version of Solaris, based on a port of System V, release 4, in the early '90s and has built it into a truly world-class application platform, scaling from PCs to clusters of 64-way E10000s. Solaris was the first true assault on the "glass-house" mainframe world of proprietary architectures and astronomical prices. Every version has offered incremental improvements that keep Sun one step ahead of the competition-things like 64-bit processing, the journaling file system, great Java support, and network integration that is built in from the ground up. And this is where this book comes in. Solaris 8: The Complete Reference guides you through the rich functionality of Solaris with real-world examples and techniques for getting the most out of your Solaris machines. There's enough here to satisfy everyone, from the Solaris experts needing a reference to beginners looking for a guide to tackling this powerful, complex operating system. Spanning all the core areas of Solaris, Solaris 8: The Complete Reference is an indispensable tool for both administrators and users. -Garrett SuhmEditor, Inside Solaris
Numerical database management system: a model
Authors: Ola-Olu A. Daini
Venue: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (1982)

Numerical databases arise in many scientific applications to keep track of large sparse and dense matrices. Unlike the many matrix data storage techniques available for incore manipulation, very large matrices are currently limited to a few compact storage schemes on secondary devices, due to the complex underlying data management facilities. This paper presents a model of an approach to numerical database management system that provides generalized facility for promoting physical data independence by relieving users from the need for knowledge of the physical data organization on the secondary devices.Each of the storage techniques for dense and sparse matrices is described by a physical schema and the tools for any numerical database description, mapping to storage and data access are provided by data language facilities. The feasibility of the model with regard to our prototype implementation of a generalized numerical database translator is also discussed.
Programming Active Server Pages, 1st edition
Authors: Scot Hillier, Dan Mezick
Venue:  (1997)

:Discover how Active Server Pages combines Dynamic HTML code, scripts, and ActiveX server components to create powerful Web-based business solutions. And acquire the background knowledge you need to create Web sites that draw on the full set of features supported by Active Server Pages, as implemented in Microsoft Internet Information Server 4.0, Microsoft Internet Explorer 4.0, and Microsoft Transaction Server. Programming Active Server Pages covers Active Server Pages from client and server perspectives, including Active Server Pages objects and ActiveX Data Objects. The book also explores the interplay between Dynamic HTML and scripting with Visual Basic, Scripting Edition, or JavaScript.
Implementing database operations using SIMD instructions
Authors: Jingren Zhou, Kenneth A. Ross
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Modern CPUs have instructions that allow basic operations to be performed on several data elements in parallel. These instructions are called SIMD instructions, since they apply a single instruction to multiple data elements. SIMD technology was initially built into commodity processors in order to accelerate the performance of multimedia applications. SIMD instructions provide new opportunities for database engine design and implementation. We study various kinds of operations in a database context, and show how the inner loop of the operations can be accelerated using SIMD instructions. The use of SIMD instructions has two immediate performance benefits: It allows a degree of parallelism, so that many operands can be processed at once. It also often leads to the elimination of conditional branch instructions, reducing branch mispredictions.We consider the most important database operations, including sequential scans, aggregation, index operations, and joins. We present techniques for implementing these using SIMD instructions. We show that there are significant benefits in redesigning traditional query processing algorithms so that they can make better use of SIMD technology. Our study shows that using a SIMD parallelism of four, the CPU time for the new algorithms is from 10% to more than four times less than for the traditional algorithms. Superlinear speedups are obtained as a result of the elimination of branch misprediction effects.
A compact B-tree
Authors: Peter Bumbulis, Ivan T. Bowman
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

In this paper we describe a Patricia tree-based B-tree variant suitable for OLTP. In this variant, each page of the B-tree contains a local Patricia tree instead of the usual sorted array of keys. It has been implemented in iAnywhere ASA Version 8.0. Preliminary experience has shown that these indexes can provide significant space and performance benefits over existing ASA indexes.
XAL: an algebra for XML query optimization
Authors: Flavius Frasincar, Geert-Jan Houben, Cristian Pau
Venue: Proceedings of the 13th Australasian database conference - Volume 5 (2002)

This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the notion of collection, a concept similar to the mathematician's monad or functional programmer's comprehension. The operators are classified in three clusters: extraction operators retrieve the needed information from XML documents, meta-operators control the evaluation of expressions, and construction operators build new XML documents from the extracted data. The resulting algebra has optimization laws similar to the known laws for transforming relational queries. As a consequence, we propose a heuristic optimization algorithm similar to its relational algebra counterpart.
Windows XP from a to Z: A Quick Reference of More than 300 Microsoft Tasks, Terms, and Tricks
Authors: Pat Coleman
Venue:  (2001)

:Providing more than 300 entries, this latest From A to Z reference shows short step-by-step descriptions and easy-to-understand definitions of all the common Windows XP terms. A handy listing of entries, this book organizes its Windows XP data alphabetically by task. With this logical organization of information, even new Windows XP users can get answers quickly and easily. Important topics covered are Windows tools that are useful to the beginner and the advanced user, such as finding files, using applets for business tasks, making network connections, and performing system maintenance.Pat Coleman is the author of Effective Executives Guide to Project 2000 and MBAs Guide to the Internet. She lives in Houston, Texas.