ppxscal/embedding_network huggingface dataset:
On the effects of viewing cues in comprehending distortions
Authors: A. Zanella, M. S. T. Carpendale, M. Rounding
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

As a community, human-computer information and interface designers have tended to avoid use of fisheyes, and multi-scale presentations with their attendant distortion because of concern about how this distortion may lead to confusion and misinterpretation. On the other hand, for centuries, hand-created information presentations have made regular use of distortion to provide emphasis and actually enhance readability. Is the lack of use in computer presentations because thus far in our computational uses of distortion we have failed to provide adequate support that allows people to comprehend the manner in which the information is being presented? We describe a study about relative difficulty in reading distortions that investigates the effect of the use viewing cues such as the cartographic grid and shading on people's ability to interpret distortions. We look at two interpretation issues: whether people can locate the region of magnification and whether people can read the relative degree of magnification of these regions. We present the findings of this study and a discussion of its results.
Co-Ordination in Artificial Agent Societies: Social Structures and Its Implications for Autonomous Problem-Solving Agents
Authors: Sascha Ossowski
Venue:  (1999)

:This monograph provides a comprehensive survey of the different approaches to coordination in societies of artificial and human agents. Setting out from a critical assessment of the state of the art, the author develops a method of structuring multi-agent applications with a mechanism called structural cooperation. Agents are equipped with expertise about their environment in order to detect and overcome specific types of problem, they make use of their social knowledge to mutually adjust their activities, and they are coerced toward coherent collective behavior through normative rules.
Parallel programming with message passing and directives
Authors: Steve W. Bova, Clay P. Breshears, Henry Gabb, Bob Kuhn, Bill Magro, Rudolf Eigenmann, Greg Gaertner, Stefano Salvini, Howard Scott
Venue: Computing in Science and Engineering (2001)

The authors discuss methods for expressing and tuning the performance of parallel programs, using two programming models in the same program: distributed and shared memory. Such methods are important for anyone who uses these large machines for parallel programs as well as for those who study combinations of the two programming models.
High Resolution Schemes for Conservation Laws with Locally Varying Time Steps
Authors: Clint Dawson, Robert Kirby
Venue: SIAM Journal on Scientific Computing (2000)

We develop upwind methods which use limited high resolution corrections in the spatial discretization and local time stepping for forward Euler and second order time discretizations. $L^\infty$ stability is proven for both time stepping schemes for problems in one space dimension. These methods are restricted by a local CFL condition rather than the traditional global CFL condition, allowing local time refinement to be coupled with local spatial refinement. Numerical evidence demonstrates the stability and accuracy of the methods for problems in both one and two space dimensions.
Business @ The Speed of Thought: Using a Digital Nervous System
Authors: Bill Gates, Collins Hemingway
Venue:  (1999)

:Chances are your company has a sizable investment in technology-and is realizing only 20 percent of its potential benefit. As Gates explains, you're probably viewing hardware and software as a way to solve specific problems. But like a living organism, and organization functions best if it can rely on a nervous system that will instantaneously deliver information to the parts that need it. In clear, nontechnical language, BUSINESS @ THE SPEED OF THOUGHT shows you how a digital nervous system can unite all systems and processes under one common infrastructure, releasing rivers of information and allowing your company to make quantum leaps in efficiency, growth, and profits.
Microsoft Access 2000 at a Glance, 1st edition
Authors: Joan Carey
Venue:  (1999)

:Here's the fast, visual way to quickly get to work using the latest version of Microsoft's powerful relational database management system. Microsoft Access 2000 At a Glance lets you focus on a particular task and shows you, with clear, numbered steps, the easiest way to get it done. 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
One Connection between Standard Invariance Conditions on ModalFormulas and Generalized Quantifiers
Authors: Dorit Ben Shalom
Venue: Journal of Logic, Language and Information (2002)

The language of standard propositional modal logic has one operator (&square; or &diams;), that can be thought of as being determined by the quantifiers &forall; or &exist;, respectively: for example, a formula of the form &square;&phi; is true at a point s just in case all the immediate successors of s verify &phi;. This paper uses a propositional modal language with one operator determined by a generalized quantifier to discuss a simple connection between standard invariance conditions on modal formulas and generalized quantifiers: the combined generalized quantifier conditions of conservativity and extension correspond to the modal condition of invariance under generated submodels, and the modal condition of invariance under bisimulations corresponds to the generalized quantifier being a Boolean combination of &forall; and &exist;.
Programming and Problem Solving in C++, 2nd edition
Authors: Nell B. Dale, Chip Weems, Mark R. Headington
Venue:  (2000)

:In the tradition of Pascal and Turbo Pascal, authors Nell Dale and Chip Weems have teamed up with Mark Headington to offer Programming and Problem Solving with C++ for students in the CS1/C101 course. Written in the same style as the successful Pascal books, this text provides an accessible introduction to programming using C++ for beginning students. The first half of the text gives students a solid foundation in top-down programming techniques. The second half builds on this foundation and explains ADTs, the C++ class, encapsulation, information hiding, and object-oriented software development.
Dynamic Worlds: From the Frame Problems to Knowledge Management
Authors: Remo Pareschi, B. Fronhhofer
Venue:  (1999)

:Reasoning is an integral part of intelligent systems in fields like data bases, logic programming, robotics, knowledge engineering, human/computer interfaces, programming environments, etc. In reality any such system has to cope with a changing world and its dynamics. Hence it is of high importance that reasoning must account for coping with change in order to be truly useful in practise. The book comprises several contributions to current ways of approaching this problem. On the one hand it surveys and synthesizes recent research work, while on the other hand new research results are included. The book aims at researchers and advanced students active in this field.
On the Approximation of Complicated Dynamical Behavior
Authors: Michael Dellnitz, Oliver Junge
Venue: SIAM Journal on Numerical Analysis (1999)

We present efficient techniques for the numerical approximation of complicated dynamical behavior. In particular, we develop numerical methods which allow us to approximate Sinai--Ruelle--Bowen (SRB)-measures as well as (almost) cyclic behavior of a dynamical system. The methods are based on an appropriate discretization of the Frobenius--Perron operator, and two essentially different mathematical concepts are used: our idea is to combine classical convergence results for finite dimensional approximations of compact operators with results from ergodic theory concerning the approximation of SRB-measures by invariant measures of stochastically perturbed systems. The efficiency of the methods is illustrated by several numerical examples.
Andragogy in a web technologies course
Authors: Heidi J. C. Ellis
Venue: ACM SIGCSE Bulletin (2002)

The face of the student body in post-secondary degree programs in the United States is changing as an increasing number of students work full-time while attaining an advanced degree [13]. As the student population includes greater numbers of working professionals, a corresponding change in the instructional approaches used to educate the maturing student population is required. Knowles' theory of andragogy [9] is a set of principles that can be used to guide adult learning. This paper describes an application of andragogy to a graduate-level Web Technologies course comprised of working professional students. In this paper, the working professional is characterized and an educational philosophy based on the theory of andragogy is presented. The application of andragogy to a Web Technologies course is described and the results are discussed.
Microsoft Publisher 2002: Complete Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Thomas J. Cashman, Joy Starks
Venue:  (2001)

:Part of the highly successful Shelly Cashman Series, this text provides step-by-step instructions accompanied by full-color screen shots, helping students learn basic through advanced Publisher skills quickly and easily.
SKA: supporting algorithm and data structure discussion
Authors: Ashley George Hamilton-Taylor, Eileen Kraemer
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Algorithm animation system design has focused primarily on providing advanced graphical capabilities. However, a fundamental mismatch exists between the needs of instructors and the features of existing algorithm animation systems. This mismatch has reduced the rate of adoption of algorithm animation tools. We describe a system, SKA (Support Kit for Animation), whose design is based on an examination of the tasks performed in the process of discussing algorithms and data structures. SKA attempts to support and enhance time-consuming instructional tasks such as tracing and data structure diagram manipulation, while requiring minimal preparation or authoring time.
MCSE Windows XP Professional: Study Guide (Exam 70-270)
Authors: Curt Simmons
Venue:  (2002)

:Prepare to pass the Windows XP Professional exam using the only classroom-based study guide available. Containing 100% complete coverage of all official exam objectives,hundreds of practice questions,hands-on exercises,plus a CD-ROM containing a realistic practice exam,this is the ultimate self-paced learning system. The Only Certification Study System Based on 300,000+ Hours of IT Training Experience100% Complete CoverageAll official test objectives for exam 70-270 are covered in detail Hands-on ExercisesStep-by-step instruction modeled after classroom labs Exam WatchWarnings based on thorough post-exam research identifying the most troublesome exam topics and how to answer them correctly Three Types of Practice QuestionsKnowledge,scenario,and lab-based questions,all with in-depth answers From the ClassroomDiscussions of important issues direct from the classrooms of Global Knowledge's award-winning instructors MasterExamComplete Practice ExamExclusive 70-270 exam simulation with questions found only on the CD-ROM Detailed AnswersExplain why the correct options are right and why the incorrect options are wrong Score ReportProvides overall assessment of performance and indicates subject areas requiring further study PLUS: (with free on-line registration)LearnKey TrainingIncludes Windows XP interactive video training session #1 MasterExamAdditional 70-270 exam simulation download
Handbook of Information Security Management, 1st edition
Authors: Micki Krause, Harold F. Tipton
Venue:  (1998)

:Completely revised and updated, the Handbook of Information Security Management 1998 continues to report how the best and the brightest security experts handle some of the most challenging security problems. The Handbook of Information Security Management 1998 provides dozens of case studies and analyses showing you how to protect your data systems and data.
Context sensitivity in role-based access control
Authors: Arun Kumar, Neeran Karnik, Girish Chafle
Venue: ACM SIGOPS Operating Systems Review (2002)

This paper describes an extended role-based access control (RBAC) model, which makes RBAC sensitive to the context of an attempted operation. Traditional RBAC does not specify whether the permissions associated with a role enable access to a particular object, or to some subset of objects belonging to a class. We extend the model by introducing the notions of role context and context filters. Context filters are Boolean expressions based on the context of the user attempting the operation, as well as the context of the object upon which the operation is attempted. By supplying context filters during the definition of a role, a security administrator can easily limit the applicability of users' role memberships to particular subsets of the target objects. We also describe our implementation of the model in a web-services platform, to illustrate how this technique is particularly valuable when the data is hierarchically structured.
Software Reuse: Domain Analysis and Design Processes
Authors: Jag Sodhi, Prince Sodhi
Venue:  (1998)

:Large-scale software systems used by government and corporations - they are anything but simple, but object-oriented programming has made these systems far easier to manage through software reuse. Now comes a trailblazing resource that goes a long way in simplifying the process of software reuse itself: Software Reuse: Doamin Analysis and Design Processes. The first book to focus on domain analysis and design processes, it lays out an innovative, comprehensive, and unified approach to large-scale software projects - one that integrates object-oriented components, design patterns, and conversion tools that make code written for one purpose serve other uses.
A summary of graphics terminal requirements based on application studies
Authors: Eric D. Carlson
Venue: Proceedings of the 3rd annual conference on Computer graphics and interactive techniques (1976)

Decreasing costs of graphics hardware, improvements in graphics software, and establishment of online data bases are increasing the interest in computer graphics. For new applications of computer graphics to be developed and used, the graphics terminal must meet the requirements of users and applications. Because many of the users will be nonprogrammers and the interactions will involve pictures, the applications are significantly different from those currently supported by batch computing or alphanumeric terminals. Studies of users, applications, and implementations of interactive computer graphics systems have resulted in thirty specific requirements for the display screen, the associated hardware for input, output, processing and storage, the interaction rates, the terminal packaging, and the support of the applications programmer. Comparison of existing graphics terminal alternatives in terms of the requirements indicates that eighteen of the thirty requirements are provided inadequately. Comparison of the relative importance of the requirements for different classes of applications indicates that color, image mixing, hard copy output, portability, upward compatibility, and reduced reflection, glare, and noise would be the most useful terminal improvements for developing new applications of computer graphics.
Engineering Journal and Workbook: Cisco Networking Academy Program, 2nd edition
Authors: Cisco Systems Inc., Cisco Networking Academy Program
Venue:  (2001)

:The Only Authorized Journal and Workbook for the Cisco Networking Academy Program Cisco-approved study materials for the Networking Academies courseWritten by the course developer!Maps to online curriculum version Increased integration across print products for more effective learning resourceIncludes exercise that will complement each chapter of the Second Year Companion, Second Edition and each module of the online curriculum.Includes CCNA review material keyed to the curriculum and the CCNA Exam objectives.Cisco Networking Academy Program: Engineering Journal and Workbook, Volume II, Second Edition has been strongly integrated with the Cisco Networking Academy Program: Second-Year Companion Guide, Second Edition, the Cisco Networking Academy Program: Lab Companion, Volume II, Second Edition, and the online curriculum.This book tracks to Semesters 3 and 4, Version 2.0 of the online curriculum and helps you learn to keep an engineering journal. The workbook also leads you through the Threaded Case Study and will ultimately become the engineering journal for that project. In addition, the project design process is discussed and a detailed design project document is included, for you to use as a model as you develop your own class projects. Focus questions give you an opportunity to express what you have learned in writing, and review questions help you prepare for the CCNA exam.
Concurrency on high-traffic data elements
Authors: Andreas Reuter
Venue: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems (1982)

In many large database applications there are certain elements mostly containing aggregate information, which are very frequently referred to (read and modified) by many transactions. If access to such fields has to obey to conventional two-phase lock protocols (1,2), transactions will be serialized in front of these "hot spots", i.e. the degree of parallelism is reduced. To avoid this kind of lock contention some improved lock protocols have been proposed, the most interesting of which is the one implemented in IMS Fast Path (3,4), where add and subtract may be performed concurrently on numerical fields, since backout is always possible with the unique inverse of each operand. A similar scheme is proposed in (10). We expand this idea to parallel readers and writers on numerical data types, proving that under certain conditions the result of such concurrent operations is consistent in the sense that it is equal to some serial schedule (2,5).
Vertex Ramsey properties of families of graphs
Authors: Tomasz Łuczak, Andrzei Ruciński, Sebastian Urbański
Venue: Journal of Combinatorial Theory Series B (2002)

For graphs F, G1, ..., Gr, we write F → (G1, ...., Gr) if for every coloring of the vertices of F with r colors there exists i, i = 1, 2, ..., r, such that a copy of Gi is colored with the ith color. For two families of graphs G1, ..., Gr and H1, ..., Hs, by (G1, ..., Gr) → (H1, ..., Hs) we denote the fact that F → (G1, ..., Gr) implies F → (H1, ..., Hs) for every graph F. In this paper, we give necessary and sufficient conditions for (G1, ..., Gr) → (H1, ..., Hs) under some weak assumptions on the families of G1, ..., Gr, and H1, ..., Hs. We also consider the induced version of this problem.
On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus
Authors: G. F. Gronchi
Venue: SIAM Journal on Scientific Computing (2002)

In this paper we introduce an effective algebraic method for the computation of all the stationary points of the squared distance $d^2$ between a point on one ellipse and a point on a second ellipse with a focus in common with the first one.This problem comes from celestial mechanics, in which the minima between two elliptic Keplerian orbits are relevant to study the probability of collision; some applications of our algorithm in this field are shown.This algorithm is based on the use of the fast Fourier transform to obtain the coefficients of the resultant of the two bivariate components of the gradient of $d^2$ with respect to one variable and relies on specific tools in symbolic computation.An upper bound to the total number of stationary points that we have to expect in this problem is also given; this is done using some tools from algebraic geometry.
Expert One on One: Oracle
Authors: Thomas Kyte
Venue:  (2001)

:This book offers the knowledge required for both those who build Oracle database applications, and those who administer the database. It is critical that the DBA knows what the developers are trying to accomplish and the best developers know how to exploit the DBA's data management strategies. Armed with the fundamental knowledge of the Oracle environment that Tom describes, you will be able to build bigger, faster, and more scalable applications. Knowledge of SQL and PL/SQL is assumed and familiarity with any 3GL language (such as C, Java, or Visual Basic) would be useful.
Elements of Software Process Assessment & Improvement, 1st edition
Authors: Khaled El Emam, Nazim H. Madhavji
Venue:  (1999)

:Elements of Software Process Assessment and Improvement reviews current assessment practices, experiences, and new research trends in software process improvement. Revised chapters expanded from articles in The Software Process Newsletter of the IEEE Computer Society Technical Council on Software Engineering, describe the improvement cycle in detail from diagnosing an organization, establishing a business case, and changing elements within a process to final evaluation.
3D Studio Max 3 Fundamentals
Authors: Michael Todd Peterson
Venue:  (1999)

:Whether you are new to 3D Studio MAX, upgrading from a previous release, or moving from 2D to 3D design, 3D Studio MAX X Fundamentals has everything you need to get up to speed quickly and easily. With fully illustrated examples, easy-to-follow exercises, time saving tips, and helpful notes, you'll learn how to build fundamental objects, create realistic textures, light a scene, place cameras, render basic animation, and more. This hands-on guide also explains complex 3D design concepts in a simple, easy-to-understand language to give you a solid foundation in the basics.
Discrete Mathematics with Graph Theory, 2nd edition
Authors: Edgar G. Goodaire, Michael M. Parmenter
Venue:  (2001)

:Adopting a user-friendly, conversationaland at times humorousstyle, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader interest and bring clarity to even the most complex concepts. Above all, the book is designed to engage today's readers in the interesting, applicable facets of modern mathematics. More than 200 worked examples and problems, as well as over 2500 exercises are included. Full solutions are provided in the back of the book. More than 150 Pausesshort questions inserted at strategic pointsare included. Full solutions to Pauses are included at the end of each section. For educators in area of discrete mathematics.