ppxscal/embedding_network huggingface dataset:
Live documents with contextual, data-driven information components
Authors: Anke Weber, Holger M. Kienle, Hausi A. Müller
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

We introduce the notion of a live document and we describe our concept of live documents with contextual, data driven information components. The dynamic and interactive features of live documents provide a consistent data source for multimedia presentations targeted to various audiences and multiple platforms. Therefore, they contribute to the solution of key challenges in single sourcing and repurposing. We motivate the use of live documents with sample scenarios from the field of systems documentation. We further discuss how live documents can benefit from an interdisciplinary research approach across the fields of technical communications, systems documentation, and software engineering. Finally, cit_af ref_bf(Greenberg, Saul 2001 ref_num129)ref_we describe our experiences with prototype implementations of live documents based on Scalable Vector Graphics (SVG) and Microsoft Office Automation, respectively.
Software Visualization
Authors: John T. Stasko, Marc H. Brown, Blaine A. Price
Venue:  (1997)

:In the past decade, high-quality interfaces have become standard in a growing number of areas such as games and CD-ROM-based encyclopedias. Yet the overwhelming majority of programmers edit their code using a single font within a single window and view code execution via the hand insertion of print statements. Software Visualization (SV) redresses this imbalance by using typography, graphics, and animation techniques to show program code, data, and control flow. This book describes the history of SV, techniques and frameworks for its construction, its use in education and program debugging, and recent attempts to evaluate its effectiveness. In making programming a multimedia experience, SV leaves programmers and computer science researchers free to explore more interesting issues and to tackle more challenging problems.
HTML
Authors: Elizabeth Eisner Reding, Sasha Vodnik
Venue:  (1998)

:Part of the Illustrated Series, this text offers a quick, visual way to build HTML skills. Covers introductory through advanced skills.
The iMAC Book
Authors: Don Rittner
Venue:  (1999)

:Contains an entire troubleshooting and technical support sectiona must-have since the product comes with no documentation! Teaches how to operate the new iMac to its fullest capacity. Reveals how the iMac also functions as a PC and can run not only the Mac OS but also is capable of running Windows 95/98, Linux, and DOS. Details how to handle and configure hardware such as hubs, keyboards, printers, and more. Covers how the iMac works with third-party programs such as QuarkXPress, Illustrator, Quicken, Photoshop, Painter, and others. Covers games and entertainment, upgrading, reviews of the latest software and freeware, getting on the Internet in a snap, and much more in an easy-to-read style. Foreword written by Guy Kawasaki, Mac guru and Director of Product Development, Apple. The iMac Book creates instant buyer recognition through its appealing translucent blue cover, which parallels the iMac's innovative design.
Kepler equation and accelerated Newton method
Authors: M. Palacios
Venue: Journal of Computational and Applied Mathematics (2002)

We study the efficiency of the accelerated Newton method (Garlach, SIAM Rev. 36 (1994) 272-276) for several orders of convergence versus Danby's method for the resolution of Kepler's equation; we find that the cited method of order three is competitive with Danby's method and the classical Newton's method. We also generalize the accelerated Newton method for the resolution of system of algebraic equations, obtaining a formula of order three and a proof of its convergence; its application to several examples shows that its efficiency is greater than Newton's method.
A scalable approach to the design of SW architectures with dynamically created/destroyed components
Authors: Pietro Abate, Marco Bernardo
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

The architecture of component based software systems is classified as being static or dynamic, depending on whether the component number and the component connections are fixed a priori or can change at run time. Most work in the field of formal method based architectural description languages has focused on static architectures, as well as dynamic architectures where the architectural specification does not scale with respect to the components that can be created or destroyed at run time. In this paper we start from PADL, a graphical, hierarchical, process algebra based language for the description of static software architectures. We then enrich its syntax and semantics in order to provide scalable specifications of software architectures where some components are dynamically created and destroyed. We show that the construction of the new language allows the architectural checks developed for PADL to be reused for the detection of architectural mismatches in the description of dynamic software architectures.
Reducing power with dynamic critical path information
Authors: John S. Seng, Eric S. Tune, Dean M. Tullsen
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

Recent research has shown that dynamic information regarding instruction criticality can be used to increase microprocessor performance. Critical path information can also be used in processors to achieve a better balance of power and performance. This paper uses the output of a dynamic critical path predictor to decrease the power consumption of key portions of the processor without incurring a corresponding decrease in performance. The optimizations include effective use of functional units with different power and latency characteristics and decreased issue logic power.
SQL Server 7 Data Warehousing, 1st edition
Authors: Michael J. Corey, Michael Abbey, Larry Barnes, Ian Abramson, Benjamin Taub, Rajan Venkitachalam
Venue:  (1999)

:Design, build, and manage multidimensional data warehouses with SQL Server 7 - Microsoft's new scalable database management system. Businesses today need advanced data delivery systems to analyze complex information and make sound business decisions. This book provides strategic analyses of the latest data warehousing technologies and explains in detail how to implement them - from data mining to RAID to OLAP. Written by renowned relational database solutions experts, SQL Server 7 Data Warehousing is your authoritative guide to every aspect of this explosive technology.
Architectural Drawing and Light Construction, 4th edition
Authors: Edward John Muller, James G. Fausett
Venue:  (1992)

:Using clear, concise explanations and numerous illustrations, this book introduces the basics of architectural design and practice along with construction documentation and practice. This book provides the most current information on architecture and construction including modern residential planning, environmental considerations, computer-aided design and drafting, building codes, and lettering. For architects and other construction professionals who want a thorough treatment of the basics of architecture.
Web Site Graphics: Flash Animation and Dhtml
Authors: Rick Karl Danielson
Venue:  (2000)

:Focuses on an important and fresh area of interest for Web site designers and an important facet of graphic design on-line. Offers inspiration as well as informative text on the design process and tools used to achieve the final design.
Design features of a real-time electrocardiographic monitoring system
Authors: David Vereeke, L. Julian Haywood, Steven Saltzberg, George Harvey
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Design features of a real-time electrocardiogram monitor are described. The developmental steps of the system are traced, a description of the eight-patient monitoring algorithm is given including the design of analog preprocessing equipment and examples of typical clinical results. The system incorporates a minicomputer with 16,000 words of memory, and is applicable wherever continuous surveillance of electrocardiographic signals is desirable. The monitor was designed at the Los Angeles County--University of Southern California Medical Center and has been operational there for approximately one year.
Guide to UNIX Using Linux, 1st edition
Authors: Jack Dent, Tony Gaddis
Venue:  (1999)

:This title provides hands-on steps for using and programming in Linux, including marginal tips where System V differs from Linux. It's a useful, practical guide to learning Unix on a Linux platform.
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
Authors: Mario Bravetti, Roberto Gorrieri
Venue: ACM Transactions on Computational Logic (TOCL) (2002)

Due to the complex nature of bisimulation equivalences that express some form of history dependence, it turned out to be problematic to decide them over nontrivial classes of recursive systems. Moreover, to the best of our knowledge, the problem of axiomatizing them over such classes of systems has never been solved. In this article, we face this problem in the case of weak ST bisimulation, an equivalence that expresses the execution of an action as the combination of the two interdependent events of action start and action termination and that supports the operation of action refinement. We first consider a basic process algebra with CSP multiway synchronization and recursion and we show that a simple technique based on static names is sufficient to decide weak ST bisimulation over processes that are finite state according to the standard interleaving semantics. Then we introduce a different technique based on dynamic names and on the new idea of compositional level-wise renaming of actions (which produces semantic models via SOS such that weak ST bisimulation can be established through standard weak bisimulation) and we show that it can be applied to decide and axiomatize weak ST bisimulation over the same class of processes. Finally, we introduce a third technique based on pointers, updated according to a pseudo-stack discipline, which preserves the possibility of deciding and axiomatizing weak ST bisimulation also when an action refinement operator is considered.
Nonlinear Problems in Machine Design, 1st edition
Authors: Eliahu Zahavi, David Barlam
Venue:  (2000)

:"Modern machine design challenges engineers with a myriad of nonlinear problems, among them fatigue, friction, plasticity, and excessive deformation. Today's advanced numerical computer programs brings optimal solutions to these complex problems within reach, but not without a trained and experienced overseer." "Nonlinear Problems in Machine Design provides that training and experience. It acquaints readers with the modern analytical methods of machine design and enables them to use those methods in daily applications. The authors first build the theoretical foundation, then focus on the application of the finite element method to machine design problems. They offer practical examples with solutions generated using both the ANSYS and MSC.NASTRAN finite element programs, demonstrating the reliability of the results and offering readers experience with the two most widely used programs in industry." "Developed through the authors' extensive knowledge of engineering theory and their experience in verifying the accuracy and applicability of computer generated solutions, this book helps ensure foolproof results when designing machine parts. Nonlinear Problems in Machine Design is unique in its focus, will prove equally valuable to students and practitioners, and appears destined to become a standard in its field."--BOOK JACKET.
Implementing a Multi-Model Estimation Method
Authors: T. Vieville, D. Lingrand, F. Gaspard
Venue: International Journal of Computer Vision (2001)

We revisit the problem of parameter estimation in computer vision, reconsidering and implementing what may be called the Kanatani's estimation method, presented here as a simple optimisation problem, so (a) without any direct reference to a probabilistic framework but (b) considering (i) non-linear implicit measurement equations and parameter constraints, plus (ii) robust estimation in the presence of outliers and (iii) multi-model comparisons.Here, (A) a projection algorithm based on generalisations of square-root decompositions allows an efficient and numerically stable local resolution of a set of non-linear equations. On the other hand, (B) a robust estimation module of a hierarchy of non-linear models has been designed and validated.A step ahead, (C) the software architecture of the estimation module is discussed with the goal of being integrated in reactive software environments or within applications with time constraints, while an experimentation considering the parameterisation of retinal displacements between two views is proposed as an illustration of the estimation module.
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Authors: Masakazu Kojima, Levent Tunçel
Venue: SIAM Journal on Optimization (1999)

Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successive semidefinite programming (SDP) relaxations and the other on successive linear programming (LP) relaxations. Each of our methods generates a sequence of compact convex subsets Ck (k = 1, 2, . . .) of Rn such that (a) the convex hull of $F \subseteq C_{k+1} \subseteq C_k$ (monotonicity), (b) $\cap_{k=1}^{\infty} C_k = \text{the convex hull of F (asymptotic convergence). Our methods are extensions of the corresponding Lovász--Schrijver lift-and-project procedures with the use of SDP or LP relaxation applied to general quadratic optimization problems (QOPs) with infinitely many quadratic inequality constraints. Utilizing descriptions of sets based on cones of matrices and their duals, we establish the exact equivalence of the SDP relaxation and the semi-infinite convex QOP relaxation proposed originally by Fujie and Kojima. Using this equivalence, we investigate some fundamental features of the two methods including (a) and (b) above.
Java 3D API Jump-Start
Authors: Aaron E. Walsh, Doug Gehringer
Venue:  (2001)

From the Book:Welcome to Java 3D API Jump-Start. This book was designed to enable Java programmers to jump directly into the exciting and powerful world of 3D. Written by professional Java 3D developers, this book covers everything you need to know to get up and running with Sun Microsystems Java 3D application programming interface (API) in no time flat. About This Book Java 3D API Jump-Start was written for Java programmers by Java programmers. Assuming that you're already comfortable with the basics of Java development, this book walks you start-to-finish through the most important and useful aspects of programming with the Java 3D API. To this end, Java 3D API Jump-Start is organized into the following six chapters: Chapter 1, "Java 3D Overview" Chapter 2, "Scene Graph Basics" Chapter 3, "Creating and Loading Geometry" Chapter 4, "Appearances" Chapter 5, "Environment Nodes" Chapter 6, "Tools: Transforms, Viewing, and Picking"The first two chapters form an introduction to Java 3D. Chapter 1 gives examples of Java 3D applications and describes the basic features; Chapter 2 describes the basic structure of Java 3D programs. Chapter 3, 4 and 5 describe the three basic "building blocks" of Java 3D programs. Chapter 6 covers three tools that most Java 3D programs use.Upon completing each chapter, you'll have gained valuable knowledge and hands-on experience related to a specific area of Java 3D capabilities and features, enabling you to explore that topic in more detail on your own as you see fit. By the time you finish all six chapters you'll be experienced with the most important aspects of Java 3D necessary to create your very own interactive 3D applications.Web3D SeriesJava 3D Jump-Start is part of a new "Web3D" series of books produced by Prentice Hall, and dedicated to 3D and the Internet. To get your hands on additional resources related to Java 3D Jump-Start (such as the freely available Java 3D Explorer application used extensively throughout this book), or to learn more about related 3D technologies, visit the Web3DBooks.com Web site at web3dbooks.com/
Enterprise Java Developer's Guide
Authors: S. Naru Narayanan, Juhne Liu
Venue:  (1999)

:The tools covered in this book include Netscape Enterprise Server, LDAP Server, Access and Oracle databases, Java Web Server, and the Java Studio IDE. The book demonstrates Java-based email, messaging, database and servlet applications. The CD-ROM includes demos of applications, plus shareware utilities.
The Legend of Zelda: Oracle of Seasons & Oracle of Ages: Prima's Official Strategy Guide
Authors: Debra McBride, David Cassady
Venue:  (2001)

:Tips for Controlling Chaos using the Rod of SeasonsTime Travel tactics using the Harp of AgesHow to use the Innovative Link SystemStatistics on all of Link's Friends and EnemiesComprehensive maps outlining every searchable area
New Perspectives on Applications Development in Microsoft Access: Advanced
Authors: David Paradice, Dirk Baldwin
Venue:  (1998)

:This New Perspectives text offers a case-based, problem-solving approach for meaningful learning of the more advanced features of Microsoft Access.
Encoding domain knowledge for prositional planning
Authors: Henry Kautz, Bart Selman
Venue: Logic-based artificial intelligence (2000)

Propositional satisfiability checking is a powerful approach to domain-independent planning. In nearly all practical applications, however, there exists an abundance of domain-specific knowledge that can be used to improve the performance of a planning system. This knowledge is traditionally encoded as procedures or rules that are tied to the details of the planning engine. We present a way to encode domain knowledge in a purely declarative, algorithm independent manner. We demonstrate that the same heuristic knowledge can be used by completely different search engines, one systematic, the other using greedy local search. This approach enhances the power of planning as satisfiability : solution times for some problems are reduced from days to seconds.
Donkey Kong 64 Brady Games Official Strategy Guide
Authors: Brady Games, Tim Bogenn
Venue:  (1999)

:BradyGames-Donkey Kong 64: Official Strategy Guide Features. COMPLETE WALKTHROUGH - Every level, every character, every golden banana, and MORE! EXPERT BOSS STRATEGY - Defeat every boss, all the way up to K. Rool! DETAILED LEVEL MAPS - Pinpoint everything you need to find and collect! PLUS - Secrets, Bonus Features, Hidden Mini-Games, Exclusive Poster, and MORE!
Using the Internet, with CD-ROM (Special Edition), 2nd edition
Authors: Que Corporation, Mary Ann Pike
Venue:  (1995)

:This easy-to-use guide to the Internet teaches the fundamentals of understanding, accessing, and getting around the Internet. Tips, Cautions, Notes, and Troubleshooting Q&As are liberally used throughout the book to help readers learn quick ways to accomplish tasks or avoid pitfalls. Disk contains a set of tools for accessing the Internet.
Predicting category accesses for a user in a structured information space
Authors: Mao Chen, Andrea S. LaPaugh, Jaswinder Pal Singh
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

In a categorized information space, predicting users' information needs at the category level can facilitate personalization, caching and other topic-oriented services. This paper presents a two-phase model to predict the category of a user's next access based on previous accesses. Phase 1 generates a snapshot of a user's preferences among categories based on a temporal and frequency analysis of the user's access history. Phase 2 uses the computed preferences to make predictions at different category granularities. Several alternatives for each phase are evaluated, using the rating behaviors of on-line raters as the form of access considered. The results show that a method based on re-access pattern and frequency analysis of a user's whole history has the best prediction quality, even over a path-based method (Markov model) that uses the combined history of all users.
Net Enterprise Design with Visual Basic Net and SQL Server 2000
Authors: Jimmy Nilsson
Venue:  (2001)

:This book discusses factors and opinions developers should consider in order to create higher quality designs and applications. The author uses one large-scale business application throughout the book as the basis for all examples to clearly illustrate concepts being discussed.Coverage also includes:a variety of aspects about design in the world of .NET; explanations of the business and data access layers of application design; solutions for problems such as code structure, solid error trapping, and how to build in debugging support; discussion of how to design larger projects with more robust systems and reusable components; comparison of component solutions to stored procedure solutions.
The nth derivative
Authors: Mhenni Benghorbal, Robert M. Corless
Venue: ACM SIGSAM Bulletin (2002)

The following problem is one that many first year calculus students find quite difficult:Given a formula for a function f in a variable x, find a formula for its nth derivative.Example 1.1: [1, p. 229] Iff(x) = xm, (1)then its nth derivative isf(n) (x) = m-nxm-n, (2)wherem-n = m(m - 1) (m - 2) &sdot;&sdot;&sdot; (m - n + 1).The difficulties for students include, first, the discovery of a formula valid for all integers n and, second, the proof (for example, by induction) that the formula is correct. Can computer algebra systems do better?It is certain that Macsyma could (we remember commands for infinite Taylor series expansion of elementary functions, and that necessarily involves discovering a correct formula for the nth derivative of the input). Currently, Maple cannot---at least, not without help, just with one command, now that the Formal Power Series package in the share library is no longer supported.
Triggered message sequence charts
Authors: Bikram Sengupta, Rance Cleaveland
Venue: Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering (2002)

We propose an extension to Message Sequence Charts called Triggered Message Sequence Charts (TMSCs) that are intended to capture system specifications involving nondeterminism in the form of conditional scenarios. The visual syntax of TMSCs closely resembles that of MSCs; the semantics allows us to translate a TMSC specification into a framework that supports a notion of refinement based on Denicola's and Hennessy's must preorder. A simple but non-trivial example illustrates the utility of our extension to MSCs.
Adjoining independent computations
Authors: Laurent Hascoét, Stefka Fidanova, Christophe Held
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

The reverse or adjoint mode of automatic differentiation is software engineering technique that permits efficient computation of gradients. However, this technique requires a lot of temporary memory. In this chapter, we present a refinement that reduces memory consumption in the case of parallel loops, and we give a proof of its correctness based on properties of the data-dependence graph of adjoint programs and parallel loops. This technique is particularly suitable for assembly loops that dominate in mesh-based computations. Application is done on the kernel of a realistic Navier-Stokes solver.