ppxscal/embedding_network huggingface dataset:
An improved index function for (D)FCM predictors
Authors: Martin Burtscher
Venue: ACM SIGARCH Computer Architecture News (2002)

The most promising value predictors to date are the finite context method predictor and a recent improvement thereof, the differential finite context method predictor. Both predictors comprise two levels and the index into the second level is a function of the content of the first level. This index function is crucial for good performance. However, our research shows that the currently used select-fold-shift-xor function performs poorly on range-limited sequences of values. For example, it does not predict the results of byte loads well. The problem with the current function is that it often cannot reach the predictor's entire second-level table. We propose an improved index function that does not suffer from this shortcoming. On the 15 SPECcpu2000 C programs, our new index function improves the average load-value predictability by about 1% to 5% without increase in predictor size. On byte loads, the improvement is over 6% for 4096-entry predictors.
Marketing and E-Commerce: The Online Legal Enviroment, 1st edition
Authors: Roger LeRoy Miller, Gaylord A. Jentz
Venue:  (2001)

:Students examine the basic legal environment topics relating to marketing in this dynamic, new module. Content is drawn from the exciting new text, Law for E-Commerce, which helps students recognize the legal issues related to maintaining and conducting business on the World Wide Web.
Dreamweaver and Fireworks Bible with CD-Rom
Authors: Joseph W. Lowery, Robert Reinhardt, Jon Warren Lentz
Venue:  (2001)

:Dreamweaver gives you the tools to quickly build dynamic web sites, complete with elaborate interactive effects. Fireworks lets you construct stunning graphics with sophisticated JavaScript behaviors, optimized with ease. Together, Dreamweaver and Fireworks work to smooth your workflow and enhance production. Macromedia expert Joseph Lowery has created this "best of both worlds" book by pulling together the most compelling and immediately useful portions of his bestselling Dreamweaver 4 Bible and Fireworks 4 Bible. Inside, you'll find complete coverage of Dreamweaver 4 and Fireworks 4: Tweak HTML tags using the new code view feature with split-screen access Fine tune code using the new JavaScript debugger - or harness ready-made extensions Troubleshoot and maintain your site using the new Reports feature Enhance Fireworks images with sophisticated fills, filters, Xtras, layers, and Life Effects Build in interactivity using hotspots, slices, and JavaScript behaviors - no coding required Master GIF animation and create state-of-the-art banner ads Speed up graphics production by using round-trip feature between Dreamweaver and Fireworks Contains bonus CD-ROM
Getting to the airport: the oldest planning problem in AI
Authors: Vladimir Lifschitz, Norman McCain, Emilio Remolia, Armando Tacchella
Venue: Logic-based artificial intelligence (2000)

The problem discussed in this paper is described in a 1959 paper by John McCarthy as follows: Assume that I am seated at my desk at home and I wish to go to the airport. My car is at my home also. The solution of the problem is to walk to the car and drive the car and drive the car to the airport. In the spirit of what is now known as the logic approach to AI, McCarthy proposed to address this problem by first giving "a formal statement of the premises" that a reasoning program would use to draw the relevant conclusions. Our goal here is to take a careful look at this episode from the early history of AI and to identify some of the logical and algorithmic ideas related to the airport problem that have emerged over the years.
Race in Cyberspace
Authors: Beth E. Kolko, Gilbert B. Rodman, Lisa Nakamura
Venue:  (2000)

:Although much has been written about the impact of technology on our daily lives, little attention has been paid to the effects of cyberspace on racial politics and identity. This collection of twelve essays explores this surprisingly underexamined aspect of cyberculturestudies as it tackles a broad range of questions: the role played by language in the construction of racialized identities online; offline representations of cyberspace as a racially coded environment; and the impact technology and education has on racial inequities-in terms of access and representation on the web. Groundbreaking and timely, Race in Cyberspace brings to light the important yet vastly overlooked intersection of race and cyberspace. Contributors: David Crane, Jennifer Gonzalez, Beth E. Kolko, Joe Lockard, Tara McPherson, Lisa Nakamura, Jeffrey A. Ow, Gilbert B. Rodman, David Silver, Jonathan Sterne, Rajani Sudan, Mark Warschauer.
Formal program testing
Authors: Robert Cartwright
Venue: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1981)

This paper proposes a practical alternative to program verification -- called formal program testing -- with similar, but less ambitious goals. Like a program verifier, a formal testing system takes a program annotated with formal specifications as input, generates the corresponding verification conditions, and passes them through a simplifier. After the simplification step, however, a formal testing system simply evaluates the verification conditions on a representative set of test data instead of trying to prove them. Formal testing provides strong evidence that a program is correct, but does not guarantee it. The strength of the evidence depends on the adequacy of the test data.
Quick Course in Microsoft Word 97
Authors: Joyce Cox, Christina Dudley
Venue:  (2000)

:Microsoft Word is a word processing application that is also sold as part of Microsoft Office. Eighty-five percent of the product's sales are through Microsoft Office.
Accurate Computations on Inertial Manifolds
Authors: M. S. Jolly, R. Rosa, R. Temam
Venue: SIAM Journal on Scientific Computing (2000)

An algorithm is implemented for the computation of inertial manifolds to arbitrary accuracy. It is applied to the Kuramoto--Sivashinsky equation to recover the high wave number components of elements on the global attractor. The computational results demonstrate that this algorithm is significantly more accurate than previous methods, when compared after just a few iterations. An essential feature of the algorithm is that it does not require that the entire manifold be constructed. Hence the algorithm is particularly suited for computing trajectories on the manifold, and its computational complexity is independent of the dimension.
Official NetScape Dynamic HTML Developer's Guide with Cdrom, 1st edition
Authors: Gayle Kidder, Stuart Harris
Venue:  (1997)

:Shows how to use Dynamic HTML (DHTML) to deal with all types of Web design challenges, from artistic to contextual to practical. Describes a different aspect of DHTML (Dynamic Styles, Dynamic Page Layers, Dynamic Content, and Dynamic Databases). I Demonstrates how to use the latest HTML techniques for building intricate, interactive pages and delivering them intact to more viewers than ever. Written by bestselling authors who are award-winning HTML experts. Contains fully worked examples, developed in conjunction with the world-renowned team at Limitless Technical Dimensions in London, England, led by Frank Wales. Provides dynamic demo pages and templates. Includes sample scripts for animating pages. Contains shareware tools.
Duality in $\Har^\infty$ Cone Optimization
Authors: Andrey Ghulchak, Anders Rantzer
Venue: SIAM Journal on Control and Optimization (2002)

Positive real cones in the space $\Har^\infty$ appear naturally in many optimization problems of control theory and signal processing. Although such problems can be solved by finite-dimensional approximations (e.g., Ritz projection), all such approximations are conservative, providing one-sided bounds for the optimal value. In order to obtain both upper and lower bounds of the optimal value, a dual problem approach is developed in this paper. A finite-dimensional approximation of the dual problem gives the opposite bound for the optimal value. Thus, by combining the primal and dual problems, a suboptimal solution to the original problem can be found with any required accuracy.
Micro Saint: simulation interoperability with the Micro Saint simulation software and COM services
Authors: Daniel W. Schunk, Wendy K. Bloechle
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

In today's high tech world the need for interoperability among programs has never been more necessary. If a user were able to utilize different programs strengths in unison, then the ability for programs to work together would greatly expand current software's ability to analyze. In response to this request, COM Services was added to the most recent release of Micro Saint. This paper will feature an example of how to apply interoperability to the Micro Saint simulation software as well as present some examples of how to further utilize COM Services.
A note on elimination of simplest recursions
Authors: Andrei P. Nemytykh
Venue: Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (2002)

Automatic program transformation, such as specialization, often introduces intermediate recursions that compute partial functions on parameters that are directly defined by simple recursive definitions. Replacing these recursive definitions by one-step definitions not only simplifies the residual program, but also allows more useful information to be propagated to remaining parts of the program, for continuing specialization.We give an easily recognized characterization of a class of recursive definitions, called syntactical monomials, that can be transformed to one-step definitions. We show our transformation is meaningful for specialization of interpreters and self-application of specializers.
A proposal for using continuous attributes in classification trees
Authors: Sandro Morasca
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Classification trees have been successfully used in several application fields. However, continuous attributes cannot be used directly when building classification trees, but they must be first discretized with clustering techniques, which require some degree of subjectivity. We propose an approach to build classification trees that does not require the discretization of the continuous attributes. The approach is an extension of existing methods for building classification trees and is based on the information gain yielded by discrete and continuous attributes. Data from a software development case study are analyzed with both the proposed approach and C4.5 to show the approach's applicability and benefits over C4.5.
IBM Websphere Starter Kit (Book/CD-ROM Package)
Authors: Ron Ben-Natan, Ori Sasson
Venue:  (2000)

:A complete toolkit for building powerful e-commerce solutions from start to finish! Now you can develop a complete,interactive Web site easily using WebSphere,the most sophisticated IBM-based open platform technology available today. This book/CD-ROM package provides comprehensive coverage for developers building e-commerce Web sites and includes IBM WebSphere Application Server,Standard Edition,Evaluation Version for Windows NT. Written by two expert developers,this book delivers information on Web site creation and development,deployment of Web-based applications,and server debugging. This handy starter kit will show you how to: Install and start WebSphereTransform static Web pages into a dynamic,fully functional Web siteManage and share site files effectively using WebSphere Performance PackUse WebSphere Studio for both local and remote debuggingBuild XML-based applicationsUtilize EJB and CORBA for high-volume,transaction-heavy sites Included are step-by-step instructions for building applications with NetObjects and IBM San Francisco and extensive coverage of Java servlets,Enterprise JavaBeans,and VisualAge. This toolkit is the only reference developers need to build,manage,and deploy powerful IBM technology-based Web sites.
Learning Solidworks, 1st edition
Authors: Richard M. Lueptow, Michael Minbiole
Venue:  (2001)

:Learning SolidWorks is designed to get you up and running on this powerful , easy-to-use, solid-modeling package in no time. Basing its instruction on the design of a pizza cutter, this text walks you through techniques in modeling, assembly, and creation of working drawings moving from basic to more advanced design techniques. The text is heavily illustrated with screen captures and sample drawings and includes end-of-of chapter modeling problems for further practice. Table of Contents Solids Modeling with SolidWorks Getting Started in SolidWorks Modeling Parts with SolidWorks: Revolves Modeling and Assembly: The Pizza Cutter Creating Working Drawings Modeling the Handle as a Plastic Injection Molded Part Redesigning the Handle Thoroughly tested on SolidWorks 2001 and SolidWorks 2000. Richard M. Lueptow is the Charles Deering McCormick Professor of Teaching Excellence and Associate Professor of Mechanical Engineering at Northwestern University. He has five patents and over 40 refereed journal and proceedings papers along with many other articles, abstracts, and presentations. Michael Minbiole studied mechanical engineering at Northwestern University and works at Northrop Grumman's Electronic Sensors and Systems Sector.
The Future of Ideas: The Fate of the Commons in a Connected World
Authors: Lawrence Lessig
Venue:  (2002)

:"The Internet revolution has come. Some say it has gone. What was responsible for its birth? Who is responsible for its demise?" "In The Future of Ideas, Lawrence Lessig explains how the Internet revolution has produced a counterrevolution of devastating power and effect. The explosion of innovation we have seen in the environment of the Internet was not conjured from some new, previously unimagined technological magic; instead, it came from an ideal as old as the nation. Creativity flourished there because the Internet protected an innovation commons. The Internet's very design built a neutral platform upon which the widest range of creators could experiment. The legal architecture surrounding it protected this free space so that culture and information - the ideas of our era - could flow freely and inspire an unprecedented breadth of expression. But this structural design is changing - both legally and technically." This shift will destroy the opportunities for creativity and innovation that the Internet originally engendered. The cultural dinosaurs of our recent past are moving to quickly remake cyberspace so that they can better protect their interests against the future. Powerful forces are swiftly using both law and technology to "tame" the internet, transforming it from an open forum for ideas into nothing more than cable television on speed. Innovation, once again, will be directed from the top down, increasingly controlled by owners of the networks, holders of the largest patent portfolios, and, most invidiously, hoarders of copyrights.
Client/Server Programming with Microsoft Visual Basic, 1st edition
Authors: Kenneth L. Spencer, Ken Miller
Venue:  (1996)

:Visual Basic 4 is one of Microsoft's most powerful tools for constructing client/server applications. Client/Server Programming with Microsoft Visual Basic teaches you easy ways to build effective, robust client/server applications using Visual Basic 4. The book also focuses on helping you maximize the benefits of the new remote OLE automation capabilities of Visual Basic 4.
An annotated situation-awareness aid for augmented reality
Authors: Blaine Bell, Tobias Höllerer, Steven Feiner
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

We present a situation-awareness aid for augmented reality systems based on an annotated "world in miniature." Our aid is designed to provide users with an overview of their environment that allows them to select and inquire about the objects that it contains. Two key capabilities are discussed that are intended to address the needs of mobile users. The aid's position, scale, and orientation are controlled by a novel approach that allows the user to inspect the aid without the need for manual interaction. As the user alternates their attention between the physical world and virtual aid, popup annotations associated with selected objects can move freely between the objects' representations in the two models.
Recomputations in reverse mode AD
Authors: Ralf Giering, Thomas Kaminski
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

The main challenge of the reverse (or adjoint) mode of automatic differentiation (AD) is providing the accurate values of required variables to the derivative code. We discuss different strategies to tackle this challenge. The ability to generate efficient adjoint code is crucial for handling large scale applications. For challenging applications, efficient adjoint code must provide at least a fraction of the values of required variables through recomputations, but it is essential to avoid unnecessary recomputations. This is achieved by the Efficient Recomputation Algorithm implemented in the Tangent linear and Adjoint Model Compiler and in Transformation of Algorithms in Fortran, which are source-to-source translation AD tools for Fortran programs. We describe the algorithm and discuss possible improvements.
Macintosh...The Naked Truth
Authors: Scott Kelby
Venue:  (2002)

:Scott Kelby, the outspoken, founding Editor of Mac Today magazine, takes a no-holds-barred look at what it's really like to be a Macintosh user in a PC-dominated world. This is definitely not another look at Apple's history. Instead, it's a hilarious, off-the-wall view of the Macintosh culture and lifestyle with a take-no-prisoners policy toward PC users. Microsoft, Apple, and anyone else who gets in his way. No topic is off limits and Mac fanatics will cheer as he really tells it like it is, using his unique brand of humor, in this PC-slammin', Microsoft-bashing, all-out Macintosh love fest! Plus, the book is filled with enough "Mac Ammo" to put any PC user down on the ground, cowering in the fetal position, begging for mercy in 60 seconds or less. If you're ready to finally see someone settle the score, this book is for you!
Two matroidal families on the edge set of a graph
Authors: Andr&#x00E1;s Recski
Venue: Discrete Mathematics (2002)

Let G be a 2-connected undirected graph with n vertices. Its connected subgraphs of n - 1 edges (that is, its spanning trees) are the bases of the usual cycle matroid of G. Let now X be a subset of vertices of G and consider those connected subgraphs of n edges whose unique circuit passes through at least one element of X. They are shown to be the bases of another matroid. A similar construction is given if the connectivity of the subgraph is not required but every circuit of the subgraph must pass through at least one element of X. Both constructions still lead to matroids if X is a subset of edges of G. Relation of the first construction to elementary strong maps (if G is planar) and representability properties of the matroids arising from these constructions are also presented. Finally, a civil engineering problem is described which served as the original motivation of this study.
KDE 2.0 Development
Authors: David Sweet,  Ph.D.
Venue:  (2000)

:KDE users program KDE to create a personalized desktop environment. KDE 2.0 Development covers programming the newest release of KDE. Topics include: KDE UI Compliance, KDE Style Reference, The Qt Toolkit, Responsive User Interface, Complex-Function KDE Widgets, Multimedia, DCOP, KParts, Creating Documentation, Packaging Code, CVS and CVSUP, and KDevelop: the Integrated Development Environment for KDE.
C++ Programming for Technology, 1st edition
Authors: Dave Cooper, Arlet Boyer
Venue:  (2001)

:C++ Programming for Electronics is unique in that it is the only book that uses electronics problems, examples and illustrations to teach readers how to program in the C++ language. Complete programs are featured throughout - along with 15-20 program listings in every chapter - to ensure that readers see the "big picture" while explaining major programming commands and concepts. A CD-ROM containing the Borland C++ "Lite" compiler program, plus all program listings, is also included. Each chapter of C++ Programming for Electronics focuses on a specific area of electronics, correlating with a typical instructional sequence used in electronics training programs, progressing from basic concepts to more advanced material. At the start of each chapter, readers are given an elementary, yet thorough explanation of basic concepts supported by straightforward programming examples, figures and tables. This logical learning progression reduces the reader's risk of getting lost in a world of unfamiliar symbols and technical terminology on the way to becoming a skilled C++ programmer.
A New Algorithm for Solving Strictly Convex Quadratic Programs
Authors: Wu Li, John Swetits
Venue: SIAM Journal on Optimization (1997)

We reformulate convex quadratic programs with simple bound constraints and strictly convex quadratic programs as problems of unconstrained minimization of convex quadratic splines. Therefore, any algorithm for finding a minimizer of a convex quadratic spline can be used to solve these quadratic programming problems. In this paper, we propose a Newton method to find a minimizer of a convex quadratic spline derived from the unconstrained reformulation of a strictly convex quadratic programming problem. The Newton method is a "natural mixture" of a descent method and an active-set method. Moreover, it is an iterative method, yet it terminates in finite operations (in exact arithmetic).