ppxscal/embedding_network huggingface dataset:
Proceedings of the 18th spring conference on Computer graphics
Venue: Spring Conference on Computer Graphics (2002)

Welcome to the 18th Spring Conference on Computer Graphics (SCCG 2002). Now it its 18th year, SCCG is the oldest annual conference in computer graphics in central Europe. SCCG is a leading international forum for the exchange of ideas on all aspects of computer graphics. In addition to the high quality peer reviewed papers from around the world, we are delighted to have invited talks from Marcus Gross from ETH Z&uuml;rich, Switzerland, Karol Myszkowski from the Max-Planck-Institut f&uuml;r Informatik, Germany and Pavel ZemČ&iacute;k of Brno Technical University, Czech Republic.
A pilot study to examine the mobility problems of visually impaired users travelling the web
Authors: Simon Harper, Carole Goble, Robert Stevens
Venue: Issue 68 (September 2000) (2000)

The Towel project seeks to find solutions to problems encountered by both visually impaired and sighted users when travelling in the World Wide Web by leveraging solutions found in real-world mobility and applying them to the virtual world. Visually impaired users find mobility on the Web particularly difficult because of the reliance of hypermedia on visual layout and large viewable areas that facilitate and enhance sighted mobility. Hypertext design and usability has traditionally concentrated upon navigation to facilitate this mobility; consequently other aspects of travel are neglected and web mobility has suffered. Similarly, the Web Accessibility Initiative (WAI) Guidelines do not take a holistic view of travel and therefore in both these cases a fully rounded view of mobility cannot be formulated. This paper presents the basis for these assertions by drawing analogies between real-world and virtual-world mobility, and then attempts to substantiate these analogies by conducting a pilot study of virtual mobility on a focus group of both sighted and visually impaired web users. Knowledge of the differences in travel between visually impaired and sighted people will enable the design of better user agents and web content for visually impaired users as well as the sighted community.
Find It Online: The Complete Guide to Online Research, 2nd edition
Authors: Alan M. Schlein, James R. Flowers, Shirley K. Kisaichi
Venue:  (2000)

:The third edition of this title provides the tools and techniques you need to master online research.
Using Eudora
Authors: Ann LeBlanc, Robert LeBlanc
Venue:  (1995)

:Eudora is far and away the most popular Internet email program, both in its freeware versions and commercial version. This user-friendly reference covers the essential features of all versions in an easy, conversational style.Explains how to install, configure, connect, send, receive, read, archive, and moreCovers additional features included with the commercial version, such as the spell checker
Comparison of viewshed algorithms on regular spaced points
Authors: Branko Kaučič, Borut Zalik
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

Viewshed is a basic visibility structure and represents all visible points from a given viewpoint. The paper gives a survey of non-parallel viewshed algorithms using regular spaced points. At first, a comprehensive background of the problem is given, then the existing methods (R3, R2, XDraw, method based on the line rasterisation) are introduced briefly. They have been implemented in 11 variants. Real terrain data and fractal generated terrains have been used for their comparison against spent CPU time and the accuracy of a computed visibility information.
Linux Install and Configuration
Authors: Dee-Ann LeBlanc, Isaac-Hajime Yates
Venue:  (1999)

:Covers common installation issues as they relate to networking, ISP connectivity, and XWindows  topics that are not covered in the Redhat and Caldera installation guides. Details the how-tos of partitioning hard drives, creating user accounts, working with file systems, compiling the kernel, configuring a LAN, working with the internet and Perl, and monitoring security issues. Includes a handy tear-out card full of key commands and shortcuts. The only book available that covers installation of both Redhat and Caldera. The only book available with this low price point and high technical level. Unlike the competition, Linux Install and Configuration Little Black Book is not just a general reference but provides detailed solutions to installation and configuration problems. Covers hot new technologies like Gnome and Samba and how they relate to configuring and deploying Linux. Troubleshooting guide to the most difficult aspect of using Linux: installation! Tackles the newest versions of both Caldera and Redhat, the two largest distributions of Linux.
MCSE Windows NT Server 4.0 Study Guide (Exam 70-67)
Venue:  (1998)

:Proven classroom techniques: the only study guides to be based on the world's most successful and sought after exam preparation curriculum; approved and authorized by Microsoft's stringent ICV program; unique in detail and focus: presents only solutions that are acceptable on MCSE examsno red-herrings or alternate,but unauthorized,"options"; "from the Class Room" and "EXAM WATCH" sidebarsplus special Test-taking Techniques chapterfocus students on their goal: preparing and passing the exam; the first study guides to include Microsoft's new SIMULATION QUESTIONS on CDsoon to be included in every MCSE exam; paractice makes perfect! Contains over 1000 questionsmore sample tests than any other available study guideincluding 6 exams on CD; stuck on an exam question? The answer is just a click away with the electronically cross-referenced Study Guide on CD. You can even add marginal notes and book mark the CD for easy reference; CD includes internet links to valuable certification-focused web sites and multimedia computer-based-training modules for re-enforcement and skill building,plus special membership on GKN's web-based training site containing up-to-the-minute certification information. Get Certified with the Global Knowledge Network Advantage! Global Knowledge Network Study Guides are designed with one goal in mind: to help you pass a specific MCSE exam. No fluff or false promises. Just the most focused and authoritative material available,based on thousands of hours of research and classroom experience - plus more practice exam questions than any other available 150,000 network professionals each year,they can highlightspecific areas in the exam that are the toughest to master,then fine-tune their instruction to match the most recent changes in Microsoft's exam objectives. Curriculum-based classroom-proven,and exam-tested - the Global Knowledge Network Advantage puts you on the fast track to your valuable MCSE credentials. The closest you can get to actually being in the classroom! EXAM WATCH - Warnings based on thorough post-exam research identifying the most troublesome exam questions - and how to answer them correctly! FROM THE CLASSROOM - Discussions of important issues direct from the classrooms of Global Knowledge Network's award-winning instructors. CERTIFICATION EXERCISES - Step-by-step exercises that focus on specific skills most likely to be on the exam. TWO-MINUTE DRILL - Quick and concise checklists that summarize a chapter's main points - perfect for last-minute review! CHAPTER SELF-TESTS - Reinforce your learning experience with chapter-specific questions similar to those found on the exam. HOW TO TAKE THE EXAM - Key pointers on how to maximize your chances for success on examday. FREE MEMBERSHIP TO GLOBAL KNOWLEDGE NETWORK'S ACCESS GLOBAL WEB SITE - Get MCSE exam updates,assessment tools and tips for success.
Analysis of speculative prefetching
Authors: Michael Angermann
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2002)

Prefetching is a potential method to reduce waiting time for retrieving data over wireless network connections that commonly occur in mobile scenarios. These connections typically exhibit low bandwidth as well as high latency. This article analyzes fundamental principles in speculative prefetching. Based on a simplified system model, the influence of parameters and strategies on prefetching performance is investigated, both analytically and in simulation. The reduction of the mean waiting time is used as performance metric. An example is given that makes use of the Zipf distribution to demonstrate the influence of the documents' probability distribution and its parameters. A low-complexity algorithm that performs optimally under the given assumptions is presented.
Advanced Video-Based Surveillance Systems
Authors: Carlo S. Regazzoni, Gianni Vernazza, Gianni Fabri
Venue:  (1998)

:Advanced Video-Based Surveillance Systems presents second generation surveillance systems that automatically process large sets of signals for performance monitoring tasks. Included is coverage of different architecture designs, customization of surveillance architecture for end-users, advances in the processing of imaging sequences, security systems, sensors, and remote monitoring projects. Examples are provided of surveillance applications in highway traffic control, subway stations, wireless communications, and other areas. This work will be of interest to researchers in image processing, computer vision, digital signal processing, and telecommunications.
Notions of dependency satisfaction
Authors: Marc H. Graham, Alberto O. Mendelzon
Venue: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems (1982)

Two notions of dependency satisfaction, consistency and completeness, are introduced. Consistency is the natural generalization of weak satisfaction and seems appropriate when only equality-generating dependencies are given, but disagrees with the standard notion in the presence of tuple-generating dependencies. Completeness is based on the intuitive semantics of tuple-generating dependencies but appears unnatural for equality-generating dependencies. It is argued that neither approach is the correct one, but rather that they correspond to different policies on constraint enforcement, and each one is appropriate in different circumstances. Consistency and completeness of a state are characterized in terms of the tableau associated with the state and in terms of logical properties of a set of first-order sentences associated with the state. A close relation between the problems of testing for consistency and completeness and of testing implication of dependencies is established. The possibility of formalizing dependency satisfaction without using a universal relation scheme is examined.
The AutoCAD Workbook: A Guide to Drawing and Modeling Using Release 14
Authors: Mike Veveris, Julie DeRossa
Venue:  (1998)

:Developed and trailed as a self-study course at Britain's University of Derby, this brief and clearly written guide provides the complete novice with a simple and comprehensive introduction to this powerful design tool.Through a series of graduated step-by-step guided exercises, the reader progressively develops expertise from 2- to 3-dimensional work through to rendered drawings, and learns the use of the program's icons and functions. The exercises are broken down into their component steps, clearly illustrated and fully but plainly explained.The guide is fully up to date with the latest release (#14), but is readily usable with earlier releases. The authors' students have acclaimed the material as 'everything you wanted to know about AutoCAD but never dared to ask".Requiring only a knowledge of the Windows environment, this book leads the reader to a high standard of proficiency in AutoCAD design.
IBM and the Holocaust: The Strategic Alliance between Nazi Germany and America's Most Powerfulcorporation
Authors: Edwin Black
Venue:  (2002)

:IBM and the Holocaust is the stunning story of IBM's strategic alliance with Nazi Germany -- beginning in 1933 in the first weeks that Hitler came to power and continuing well into World War II. As the Third Reich embarked upon its plan of conquest and genocide, IBM and its subsidiaries helped create enabling technologies, step-by-step, from the identification and cataloging programs of the 1930s to the selections of the 1940s. Only after Jews were identified -- a massive and complex task that Hitler wanted done immediately -- could they be targeted for efficient asset confiscation, ghettoization, deportation, enslaved labor, and, ultimately, annihilation. It was a cross-tabulation and organizational challenge so monumental, it called for a computer. Of course, in the 1930s no computer existed. But IBM's Hollerith punch card technology did exist. Aided by the company's custom-designed and constantly updated Hollerith systems, Hitler was able to automate his persecution of the Jews. Historians have always been amazed at the speed and accuracy with which the Nazis were able to identify and locate European Jewry. Until now, the pieces of this puzzle have never been fully assembled. The fact is, IBM technology was used to organize nearly everything in Germany and then Nazi Europe, from the identification of the Jews in censuses, registrations, and ancestral tracing programs to the running of railroads and organizing of concentration camp slave labor. IBM and its German subsidiary custom-designed complex solutions, one by one, anticipating the Reich's needs. They did not merely sell the machines and walk away. Instead, IBM leased these machines for high fees and becamethe sole source of the billions of punch cards Hitler needed. IBM and the Holocaust takes you through the carefully crafted corporate collusion with the Third Reich, as well as the structured deniability of oral agreements, undated letters, and the Geneva intermediaries -- all undertaken as the newspapers blazed with accounts of persecution and destruction. Just as compelling is the human drama of one of our century's greatest minds, IBM founder Thomas Watson, who cooperated with the Nazis for the sake of profit. Only with IBM's technologic assistance was Hitler able to achieve the staggering numbers of the Holocaust. Edwin Black has now uncovered one of the last great mysteries of Germany's war against the Jews -- how did Hitler get the names?
Windows CE Developer's Handbook with Cdrom
Authors: Luisa Cesana, David L. Heskett, Terence Goggin, Jason M. MacLean
Venue:  (1999)

:The Windows CE Developer's Handbook is for experienced Windows developers who are ready to apply their skills to the rapidly expanding world of Windows CE. Inside, a CE expert offers an unflinching look at the realities of CE programming, including constraints on memory and processing power, a proliferation of device-specific capabilities, and a reduced API and runtime library. Can you meet these challenges? This book ensures that you can, providing in-depth coverage of the toughest tasks you'll face.
A Geometric Approach for the Theory and Applications of 3D Projective Invariants
Authors: Eduardo Bayro-Corrochano, Vladimir Banarer
Venue: Journal of Mathematical Imaging and Vision (2002)

A central task of computer vision is to automatically recognize objects in real-world scenes. The parameters defining image and object spaces can vary due to lighting conditions, camera calibration and viewing position. It is therefore desirable to look for geometric properties of the object which remain invariant under such changes in the observation parameters. The study of such geometric invariance is a field of active research. This paper presents the theory and computation of projective invariants formed from points and lines using the geometric algebra framework. This work shows that geometric algebra is a very elegant language for expressing projective invariants using n views. The paper compares projective invariants involving two and three cameras using simulated and real images. Illustrations of the application of such projective invariants in visual guided grasping, camera self-localization and reconstruction of shape and motion complement the experimental part.
MOUS Excel 2000 Exam Prep
Authors: Elizabeth Eisner Reding, Tara Lynn O'Keefe
Venue:  (2000)

:Integrates all the information necessary to build, edit, and format worksheets and charts. Demonstrates ways to program with Excel, and exchange data with other programs, and work with Internet applications. Enables reader to manage workbooks, automate worksheet tasks, use lists, and analyze list data.
A Taylor-series solution in Cartesian space to GMA-system equations and its application to initial-value problems
Authors: F. Shiraishi, H. Takeuchi, T. Hasegawa, H. Nagasue
Venue: Applied Mathematics and Computation (2002)

A variable-order, variable-step Taylor-series method in Cartesian space is discussed which makes it possible to solve simultaneous first-order differential equations expressed in GMA-system canonical form with a super high-order accuracy that is comparable to the machine accuracy of the computer. In this method, the stepsize for each differential equation is calculated from the formula derived by setting the ratio of the appropriate two terms of the first few Taylor-series terms at unity, and a minimum value of them is then used as the initial value of the stepsize at each step of the integration and is halved if several criterions are satisfied. Also, when each dependent variable takes a value near zero, the integration is carried out with a very small stepsize. The Taylor-series method constructed here is first applied to the Lotka Volterra equation to confirm the validity of the calculation algorithm and it is found that the calculated values completely agree with those by the conventional method in which the Taylor-series solution in logarithmic space is used. Second, the differential equation with a solution of cos(t) is solved and the relative error is found to instantaneously increase when the dependent variables take a value near zero and becomes equal to zero or almost zero in the other region. Finally, the differential equation for a two-body problem is solved and it is shown that the accuracies of the calculated values are kept at high levels even after integration over 625 cycles. In conclusion, the Taylor-series method constructed in Cartesian space is considered to have high applicability to simultaneous differential equations and provides high accuracies for the calculated values.
A new instructional operating system
Authors: David A. Holland, Ada T. Lim, Margo I. Seltzer
Venue: ACM SIGCSE Bulletin (2002)

This paper presents a new instructional operating system, OS/161, and simulated execution environment, System/161, for use in teaching an introductory undergraduate operating systems course. We describe the new system, the assignments used in our course, and our experience teaching using the new system.
Animation on a satellite graphics system
Authors: Richard M. Sowar
Venue: ACM SIGGRAPH Computer Graphics (1976)

Although animation processing capability can be extremely valuable in certain graphics programs, its application is generally limited to users of stand alone, single user graphics systems. This paper describes an organization of software which enables a host program to define and control animations for an intelligent satellite graphics system. The discussion centers around the particular system on which it was implemented, but the technique should be general enough to have wide application. The results have significantly enhanced the operating characteristics of programs in the host-satellite environment.
Atlas: a distributed system for the simulation of large-scale systems
Authors: Cyril Ray, Christophe Claramunt
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

This paper introduces a novel distributed computing environment designed as a simulation tool for the analysis of large and disaggregated data flows. Our research is based on a mapping between a large scale system, in which the interest of study is the modelling of disaggregated data flows, and a distributed computing environment, both being modelled as a graph. This distributed computing environment is a middleware that supports management and migration of computing objects. Its dynamic properties replicate the behaviour of large data flows, i.e., entities travelling between the different nodes of a graph. It also supports distribution and processing of objects at the appropriate level of granularity: the nodes of the computing graph. Such a property gives a high level of flexibility and scalability to the system, computing objects being distributed and processed at the local middleware level. The potential of our middleware is illustrated by a case study that simulates large passenger flows between the halls of an airport terminal.
Resources for Next Generation Introductory CS Courses: Report of the ITiCSE'99 Working Group on Resources for the Next Generation CS 1 Course
Authors: Joseph Bergin, Amruth Kumar, Viera K. Proulx, Myles McNally, Alyce Faulstich Brady, David Mutchler, Stephen Hartley, Richard Rasala, Charles Kelemen, Rocky Ross, Frank Klassner
Venue: Working group reports from ITiCSE on Innovation and technology in computer science education (1999)

The ongoing purpose of this working group is to collect, evaluate, and foster the development of resources that might be used in next generation introductory CS courses. Such courses will integrate elements of object-oriented programming and design, program design patterns, concurrency, and event-driven programming. The product of the working group is a web repository that provides resources that might be used in such a course. The site will include sample syllabi, pedagogical patterns, programming and design patterns, course modules, projects, tools and techniques.The URL for the web site is:http://csis.pace.edu/ ~bergin/iticse99/
Optimal termination protocols for network partitioning
Authors: Francis Chin, K. V. S. Ramarao
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

Commit protocols guarantee the consistency of distributed databases in absence of any failures. A commit protocol is resilient to a class of failures if it is possible to guarantee that a) databases at all operational sites in presence of these failures are consistent and b) other sites can be recovered consistently with these sites when the failure is repaired. Such a commit protocol is called nonblocking if no operational site needs to wait on a transaction which is incomplete at the time of the failure. It is known that no nonblocking commit protocol resilient to network partitioning exists. In this paper, the possible termination protocols of commit protocols are studied in the context of network partitioning. A formal model for termination protocols is introduced and a general logical interpretation of termination protocols is presented. The model makes use of all the information that is available in a component of the partition --- namely, the constituent sites and their respective states at the time of partition. Optimality measures for the termination protocols in terms of the number of waiting components and average number of waiting sites are introduced and protocols optimal under these measures are produced for all the possible centralized and decentralized commit protocols. It is proved that quorum-based termination protocols indeed perform very well in the presence of network partitioning. If the central site(s) is reliable, we can prove that centralized commit protocols indeed perform better than all decentralized ones. Thus, the general preference for centralized commit protocols is justified.