ppxscal/embedding_network huggingface dataset:
StyleCam: interactive stylized 3D navigation using integrated spatial & temporal controls
Authors: Nicholas Burtnyk, Azam Khan, George Fitzmaurice, Ravin Balakrishnan, Gordon Kurtenbach
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

This paper describes StyleCam, an approach for authoring 3D viewing experiences that incorporate stylistic elements that are not available in typical 3D viewers. A key aspect of StyleCam is that it allows the author to significantly tailor what the user sees and when they see it. The resulting viewing experience can approach the visual richness and pacing of highly authored visual content such as television commercials or feature films. At the same time, StyleCam allows for a satisfying level of interactivity while avoiding the problems inherent in using unconstrained camera models. The main components of StyleCam are camera surfaces which spatially constrain the viewing camera; animation clips that allow for visually appealing transitions between different camera surfaces; and a simple, unified, interaction technique that permits the user to seamlessly and continuously move between spatial-control of the camera and temporal-control of the animated transitions. Further, the user's focus of attention is always kept on the content, and not on extraneous interface widgets. In addition to describing the conceptual model of StyleCam, its current implementation, and an example authored experience, we also present the results of an evaluation involving real users.
Digital Systems Design with VHDL and Synthesis, 1st edition
Authors: K. C. Chang
Venue:  (1999)

:K. C. Chang presents an integrated approach to digital design principles, processes, and implementations to help the reader design increasingly complex systems within shorter design cycles. Chang introduces digital design concepts, VHDL coding, VHDL simulation, synthesis commands, and strategies together. Digital Systems Design with VHDL and Synthesis focuses on the ultimate product of the design cycle: the implementation of a digital design. Many of the design techniques and considerations illustrated in the text are examples of actual real-world designs.
Multiple-Rank Modifications of a Sparse Cholesky Factorization
Authors: Timothy A. Davis, William W. Hager
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Given a sparse symmetric positive definite matrix $\mathbf{AA}\tr$ and an associated sparse Cholesky factorization $\mathbf{LDL}\tr$ or $\mathbf{LL}\tr$, we develop sparse techniques for updating the factorization after either adding a collection of columns to A or deleting a collection of columns from A. Our techniques are based on an analysis and manipulation of the underlying graph structure, using the framework developed in an earlier paper on rank-1 modifications [T. A. Davis and W. W. Hager, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606--627]. Computationally, the multiple-rank update has better memory traffic and executes much faster than an equivalent series of rank-1 updates since the multiple-rank update makes one pass through L computing the new entries, while a series of rank-1 updates requires multiple passes through L.
Time-parameterized queries in spatio-temporal databases
Authors: Yufei Tao, Dimitris Papadias
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current motion of the query and the database objects, and (iii) the change that causes the expiration of the result. Due to the highly dynamic nature of several spatio-temporal applications, TP queries are important both as standalone methods, as well as building blocks of more complex operations. However, little work has been done towards their efficient processing. In this paper, we propose a general framework that covers time-parameterized variations of the most common spatial queries, namely window queries, k-nearest neighbors and spatial joins. In particular, each of these TP queries is reduced to nearest neighbor search where the distance functions are defined according to the query type. This reduction allows the application and extension of well-known branch and bound techniques to the current problem. The proposed methods can be applied with mobile queries, mobile objects or both, given a suitable indexing method. Our experimental evaluation is based on R-trees and their extensions for dynamic objects.
Managing Computer Viruses
Authors: Eric Louw, Neil Duffy
Venue:  (1992)

:This book presents a concise overview of the problem and a detailed framework for dealing with computer viruses in organizations. Managers are the target audience, and will find that it offers more than the usual technical information. There is a wealth of advice, much of which applies to the problem of computer security in general.
Performance and scalability of EJB applications
Authors: Emmanuel Cecchet, Julie Marguerite, Willy Zwaenepoel
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

We investigate the combined effect of application implementation method, container design, and efficiency of communication layers on the performance scalability of J2EE application servers by detailed measurement and profiling of an auction site server.We have implemented five versions of the auction site. The first version uses stateless session beans, making only minimal use of the services provided by the Enterprise JavaBeans (EJB) container. Two versions use entity beans, one with container-managed persistence and the other with bean-managed persistence. The fourth version applies the session fasade pattern, using session beans as a fasade to access entity beans. The last version uses EJB 2.0 local interfaces with the session fasade pattern. We evaluate these different implementations on two popular open-source EJB containers with orthogonal designs. JBoss uses dynamic proxies to generate the container classes at run time, making an extensive use of reflection. JOnAS pre-compiles classes during deployment, minimizing the use of reflection at run time. We also evaluate the communication optimizations provided by each of these EJB containers.The most important factor in determining performance is the application implementation method. EJB applications with session beans perform as well as a Java servlets-only implementation and an order-of-magnitude better than most of the implementations based on entity beans. The fine-granularity access exposed by the entity beans limits scalability. Use of session fasade beans improves performance for entity beans, but only if local communication is very efficient or EJB 2.0 local interfaces are used. Otherwise, session fasade beans degrade performance.For the implementation using session beans, communication cost forms the major component of the execution time on the EJB server. The design of the container has little effect on performance. With entity beans, the design of the container becomes important. In particular, the cost of reflection affects performance. For implementations using session fasade beans, local communication cost is critically important. EJB 2.0 local interfaces improve the performance by avoiding the communication layers for local communications.
ArcView GIS/Avenue Programmer's Reference, 3rd edition
Authors: Amir H. Razavi, Valerie Warwick
Venue:  (1999)

:There are currently 200,000 copies of ArcView GIS in use worldwide, making it one of today's leading GIS applications. Because use of GIS as a decision-making tool is growing, and the GIS community is becoming increasingly sophisticated, the beginning programming audience is expanding rapidly.
Second order exact derivatives to perform optimization on self-consistent integral equations problems
Authors: Isabelle Charpentier, Noël Jakse, Fabrice Veersé
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

Great efforts have been made to search for enhanced semi-empirical forms of the bridge function b appearing in disordered condensed matter problems which are solved using the integral equation method. Currently, parameterized forms of the bridge function are manually chosen to fit as closely as possible the thermodynamic self-consistent equations depending on g and its derivatives. We discuss a second-order differentiation of the computer code that enables construction of parameterized bridge functions using optimal control techniques.
ACM SIGIR 2001 workshop "Information Retrieval Techniques for Speech Applications"
Authors: Anni R. Coden, Eric Brown, Savitha Srinivasan
Venue: ACM SIGIR Forum (2002)

We organized a workshop at SIGIR'01 to explore the area of information retrieval techniques for speech applications. Here we summarize the results of that workshop
Global Continuation for Distance Geometry Problems
Authors: Jorge J. Moré, Zhijun Wu
Venue: SIAM Journal on Optimization (1997)

Distance geometry problems arise in the determination of protein structure. We consider the case where only a subset of the distances between atoms is given and formulate this distance geometry problem as a global minimization problem with special structure. We show that global smoothing techniques and a continuation approach for global optimization can be used to determine global solutions of this problem reliably and efficiently. The global continuation approach determines a global solution with less computational effort than is required by a standard multistart algorithm. Moreover, the continuation approach usually finds the global solution from any given starting point, while the multistart algorithm tends to fail.
On the Controllability of Parabolic Systems with a Nonlinear Term Involving the State and the Gradient
Authors: A. Doubova, E. Fernández-Cara, M. González-Burgos, E. Zuazua
Venue: SIAM Journal on Control and Optimization (2002)

We present some results concerning the controllability of a quasi-linear parabolic equation (with linear principal part) in a bounded domain of ${\mathbb R}^N$ with Dirichlet boundary conditions. We analyze the controllability problem with distributed controls (supported on a small open subset) and boundary controls (supported on a small part of the boundary). We prove that the system is null and approximately controllable at any time if the nonlinear term $f( y, \nabla y)$ grows slower than $|y| \log^{3/2}(1+ |y| + |\nabla y|) + |\nabla y| \log^{1/2}(1+ |y| + |\nabla y|)$ at infinity (generally, in this case, in the absence of control, blow-up occurs). The proofs use global Carleman estimates, parabolic regularity, and the fixed point method.
Microsoft Project 2000 Step by Step Courseware Expert Skills
Authors: Timothy Johns, Carl S. Chatfield
Venue:  (2000)

:The in-depth software training course thats designed to help you get the most out of Microsoft Project 2000. This full-color student guide is a key part of the Microsoft&reg; Step By Step Courseware series, which provides everything you need to get up and running quickly with Microsoft software products. This guide will help you master advanced techniques with Project 2000. Tips provide helpful hints and alternative ways to complete tasks, while important notes state warnings and cautions. Numbered steps provide detailed instructions to help you learn new skills. Margin notes give you additional information about the lesson. The MOUS logo indicates a task that will be tested on the Microsoft Office User Specialist (MOUS) certification exam. Putting It All Together exercises challenge you to apply what youve learned in new ways. Quick Quizzes test what youve learned in each lesson. The Lesson Glossary defines key terms shown in boldface throughout the lesson. Using this Student Guide, youll learn how to: Meet Microsoft Project MOUS expert-level certification objectives Fine-tune tasks and resources Format your project plan and track progress against it Manage a project team with Microsoft Project Central Work with resource pools and consolidated projects Customize Microsoft Project 2000
Adobe PhotoShop for Windows, 1st edition
Authors: Prentice Hall Muncher Staff
Venue:  (1993)

:Adobe Photoshop for Windows covers thirteen tutorial lessons that allow you to maximize the power and sophistication of the world's leading photo design and production tool. A CD-ROM is included so you can practice using the tools and features of Adobe Photoshop with professionally created electronic files. Classroom in a Book: Adobe Photoshop for Windows supports Adobe Photoshop version 2.5 or later. 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
Debugging ASP.NET
Authors: Jonathan Goodyear, Brian Peek, Brad Fox
Venue:  (2001)

:The typical web or software developer spends over 50% of their time debugging code, yet most development books spend little (if any) time on the subject. Debugging ASP.NET concentrates on debugging issues related to Microsoft's new web development platform, ASP.NET. All of the new debugging tools introduced in ASP.NET are covered, and solutions are offered to many of the confusing error messages, pitfalls, and "gotchas" that developers will no doubt encounter while moving to this powerful new platform. Debugging ASP.NET is poised to become the de facto standard in ASP.NET debugging resources. Each debugging feature is closely examined, with full descriptions and related, useful code. This is the first book on ASP.NET that assumes things can (and will) go wrong, providing expert tips and solutions. Debugging ASP.NET provides you with expert advice on: Strategies to debug your code Keeping track of what you're doing using event logging Finding the source of the bug using tracing techniques Debugging ADO.NET Using conditional compilation to prevent mishaps Administering within the Visual Studio' .NET debugging environment using C# and Visual Basic'. NET Caching and COM+ issues Debugging your own serverside controls Debugging problems when moving from Visual Basic' to Visual Basic .NET Structured error handling strategies Strategies for planning and implementing a debugging cycle
Macworld MAC Secrets, 6th edition
Authors: David Pogue, Joseph Schorr
Venue:  (2001)

:Completely revised and updated, this new edition of the international Macintosh bestseller brings you authoritative, thorough coverage of Mac OS 8.5, the red-hot IMac, USB, G3 Macs and PowerBooks, Office 98, and the Internet explosion. Overhauled and fatter than ever, this new edition packs over 650 new tips, productivity pointers, and troubleshooting techniques. Complete with a CD-ROM crammed with over 500MB of software and shareware, Macworld Mac Secrets, 5th Edition, will keep you - and your Macsmiling!
Sams Teach Yourself Dreamweaver UltraDev in 21 Days, 1st edition
Authors: John Ray, Brooks Martin
Venue:  (2000)

:Sams Teach Yourself Dreamweaver UltraDev 4 in 21 Days teaches you all the skills you need to get up and running effectively with Dreamweaver UltraDev 4. The tutorial approach aids you in learning the basics quickly and then moves on to the more advanced features and concepts. By the end of the 21 days, you will know how to create dynamic Web sites containing database interactivity, streamline ASP content, write custom validations and extend functionality with JavaScript, design enhanced navigation of the Web site, and incorporate interactivity. Written by leading trainer and developer John Ray, you will benefit from expert tips for more effective site design.
Dictatorial Transaction Processing: Atomic Commitment Without Veto Right
Authors: Maha Abdallah, Rachid Guerraoui, Philippe Pucheral
Venue: Distributed and Parallel Databases (2002)

The current standard in governing distributed transaction termination is the so-called Two-Phase Commit protocol (2PC). The first phase of 2PC is a voting phase, where the participants in the transaction are given an ultimate right to abort that transaction. Giving up that veto right from all participants reduces the overhead of the atomic commitment protocol but also imposes some restrictions on the concurrency control and recovery protocols employed by the participants in the transaction.This paper gives, for the first time, a precise abstract specification of the Dictatorial Atomic Commitment (DAC) problem, resulting from removing veto rights from the traditional Atomic Commitment (AC) problem. We characterize transactional systems that are compatible with that specification in terms of necessary and sufficient conditions on concurrency control and recovery protocols, and discuss the practical impacts of those conditions. From this study, we capitalize on existing protocols that solve the DAC problem, and propose a new protocol that broadens the applicability of dictatorial transaction processing in order to meet the requirements of today's distributed environments. We point out interesting performance tradeoffs, and describe the implementation of our protocol in the context of current transactional standards, initially designed with 2PC in mind.
Generative programming for embedded systems
Authors: Janos Sztipanovits, Gabor Karsai
Venue: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming (2002)

Composition and component-based design are key tools of modern software engineering for managing complexity. The concept of component-based design is straightforward: systems are built by composing software components with precisely defined interfaces using standardized interconnection mechanisms. "Plug-and-play" construction is supported by some underlying composition framework, such as CORBA, which facilitates the component interactions by providing standard services such as request broker, interface repository and others. Unfortunately, this solution tends to work only for building systems with a giant component using small "plug-ins" or for very small systems with a few components.The success of building applications based on a giant component is the result of strong restrictions on plug-in-s and their interaction: the dominant component (such as databases or web browsers) preserves the overall design integrity. In case of small systems, the system designers can preserve design integrity without extensive tool support. The problems of software composition for embedded systems are even harder. Embedded computers are surrounded by physical processes: they receive their inputs from sensors and send their outputs to actuators. Embedded computing devices, viewed from their sensor and actuator interfaces, act like physical processes with dynamics, noise, fault, size, power and other physical characteristics.It is not surprising that using current software technology, logical/functional composability does not imply physical composability. In fact, physical properties are not composable, rather, they appear as cross-cutting constraints in the development process. .Our vision with Model-Integrated Computing (MIC) is to answer the composition challenges of embedded systems the following way:.Modeling: The software development paradigm is changing from the use of dominantly imperative programming languages to dominantly declarative, Domain-Specific Modeling Languages (DSML). Complexity is managed by the use of multiple-view modeling and model analysis techniques.Model-Based Generators: The tight relationship between the model-based design and the modeled system is ensured by the extensive use of model-based generators, which translate the synthesized and verified models into code and other artifacts that form the application.The MIC toolset of ISIS has significant progress in implementing this vision.
Microsoft Excel 2000 Simplified, 1st edition
Authors: Ruth Maran
Venue:  (1999)

:This book uses a 3-D Visual® approach to learning. Features: Special sections cover time-saving, practical advice Each two-page spread covers one task, for easy and focused learning Advanced technology produces screens with incredible resolution for the sharpest and clearest image Each step is visually and clearly connected to the area on the screen where your action takes place
Data Segmentation and Model Selection for Computer Vision, 1st edition
Authors: Alireza Bab-Hadiashar
Venue:  (1999)

:This unique interdisciplinary book contains research material from two relatively distinct communities: statisticians working on robust techniques for model fitting and model selection; and engineers and computer scientists working on problems involving data segmentation." "For statisticians, the book contains a convenient summary of recent work in their community and provides them with an excellent primer on the problems of data segmentation within a machine-vision context. For engineers and computer scientists, the book provides both a convenient entry into current research in data segmentation and a synopsis of the main statistical ideas relevant to a study on the subject within a statistical context." "The book presents material at a level appropriate for advanced undergraduates, graduate students, and researchers in statistics, computer science, and computer engineering. It can also serve as an up-to-date resource for a seminar series at the postgraduate level.
Separation of NP-Completeness Notions
Authors: A. Pavan, Alan L. Selman
Venue: SIAM Journal on Computing (2002)

We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is $\mbox{${\leq}^{\rm P}_{\rm T}$}$-complete but not $\mbox{${\leq}^{\rm P}_{tt}$}$-complete. We provide fairly thorough analyses of the hypotheses that we introduce.
Towards a sound view integration methodology
Authors: M. A. Casanova, V. M. P. Vidal
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

View integration is investigated with the help of three classes of interrelational dependencies, inclusion dependencies, exclusion dependencies and union functional dependencies. The process of view integration is divided into two steps, combination and optimization. View combination consists in defining new interrelational dependencies that capture similarities between different views. The optimization step tries to reduce redundancy and the size of the schema. Finally, general results about interrelational dependencies are presented that lead to an optimization procedure for a restricted class of schemas.
Oracle Certified Professional Application Developer Exam Guide
Authors: Jason S. Couchman, Lakshmana N. Rao, Christopher Allen
Venue:  (1999)

:Certify your skills and demonstrate your expertise by earning your OCP credential - with help from this Oracle-authorized exam guide. The book provides full coverage of the Developer Track Release 2 exams as well as the Release 1 upgrade exams. Fully endorsed by Oracle Corporation and developed in conjunction with Oracle's OCP program, this book and CD-ROM package is a powerful preparation tool containing more than 400 practice exam questions.