ppxscal/embedding_network huggingface dataset:
Real-time eye detection and tracking under various light conditions
Authors: Zhiwei Zhu, Kikuo Fujimura, Qiang Ji
Venue: Proceedings of the 2002 symposium on Eye tracking research & applications (2002)

Non-intrusive methods based on active remote IR illumination for eye tracking are important for many applications of vision-based man-machine interaction. One problem that has plagued those methods is their sensitivity to lighting condition change. This tends to significantly limit their scope of application. In this paper, we present a new real-time eye detection and tracking methodology that works under variable and realistic lighting conditions. Based on combining the bright-pupil effect resulted from IR light and the conventional appearance-based object recognition technique, our method can robustly track eyes when the pupils are not very bright due to significant external illumination interferences. The appearance model is incorporated in both eyes detection and tracking via the use of support vector machine and the mean shift tracking. Additional improvement is achieved from modifying the image acquisition apparatus including the illuminator and the camera.
Object-Oriented Ray Tracing in C++
Authors: Nicholas P. Wilt
Venue:  (1993)

:Here is the first ray tracing book to focus on object-oriented methods that can greatly enhance both the speed of processing and the quality of the resulting graphics. Readers will find a brief introduction to ray tracing and background on advanced topics such as acceleration techniques, texture-mapping, and constructive solid geometry. They'll also get a "User's Manual" guide for the ray tracing class library, with code examples for both basic and sophisticated ray tracing problems.
Peer-to-peer data trading to preserve information
Authors: Brian F. Cooper, Hector Garcia-Molina
Venue: ACM Transactions on Information Systems (TOIS) (2002)

Data archiving systems rely on replication to preserve information. This paper discusses how a network of autonomous archiving sites can trade data to achieve the most reliable replication. A series of binary trades among sites produces a peer-to-peer archiving network. Two trading algorithms are examined, one based on trading collections (even if they are different sizes) and another based on trading equal sized blocks of space (which can then store collections). The concept of deeds is introduced; deeds track the blocks of space owned by one site at another. Policies for tuning these algorithms to provide the highest reliability, for example by changing the order in which sites are contacted and offered trades, are discussed. Finally, simulation results are presented that reveal which policies are best. The experiments indicate that a digital archive can achieve the best reliability by trading blocks of space (deeds), and that following certain policies will allow that site to maximize its reliability.
The Complete FreeBSD
Authors: Greg Lehey
Venue:  (1999)

:This robust open operating system is ideal for both novices and professionals and comes with full technical support. The book gives detailed descriptions of the installation process and shows how to share disks between FreeBSD and other operating systems. Readers will learn about rebuilding the kernel and creating a system that can alternately run UNIX and Windows.
Linking in context
Authors: Samhaa R. El-Beltagy, Wendy Hall, David De Roure, Leslie Carr
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

This paper explores the idea of dynamically adding multi-destination links to Web pages, based on the context of the pages and users, as a way of assisting Web users in their information finding and navigation activities. The work does not make any preconceived assumptions about the information needs of its users. Instead it presents a method for generating links by adapting to the information needs of a community of users and for utilizing these in assisting users within this community based on their individual needs. The implementation of this work is carried out within a multi-agent framework where concepts from open hypermedia are extended and exploited. In this paper, the entities involved in the process of generating and using `context links' as well as the techniques they employ to achieve their tasks, are described. The result of an experiment carried out to investigate the implications of linking in context on information finding, is also provided.
Rapid Turbo Pascal Graphics Tutor
Authors: J. J. Abas
Venue:  (1994)

:This interactive text/disk package help will the reader to master Turbo Pascal Graphics faster than with a conventional book or thumbing through thick manuals. It is aimed at those who can program in Pascal and who have had some experience of Turbo Pascal. Learning is split up into manageable chunks which are interspersed with activities to illustrate the principles covered. Fifteen demonstration programs and solutions to the activities in the text are supplied on a 3.5 inch MS-DOS disk. 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
Concurrent Systems: An Integrated Approach to Operating Systems, Database, and Distributed ..., 1st edition
Authors: Jean Bacon
Venue:  (1993)

:Concurrent Systems answers the need for a book on concurrent programming which serves to integrate operating systems and database concepts, and provides a foundation for later courses in these areas.
The visual knowledge builder: a second generation spatial hypertext
Authors: Frank M. Shipman,  III, Haowei Hsieh, Preetam Maloor, J. Michael Moore
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

The development of spatial hypertext systems was driven by the need to lower users' effort of expression. Users express categories and interrelationships through the visual similarity and co-location of information objects. The ease of changing a visual property or moving an object makes spatial hypertext better suited to tasks where the information continually evolves. But the implicit nature of the structure poses challenges for tasks in which the authors and readers are not the same set of people. The Visual Knowledge Builder (VKB) includes the ease of expression of earlier spatial hypertexts while adding greater support for long-term collaboration and tasks requiring explicit links. VKB includes a history mechanism that records the evolution of the spatial hypertext and local, global, and historical links for explicit navigational connections between chunks of information. The mechanisms added to VKB make spatial hypertext applicable in a much wider variety of tasks. In particular, VKB's global links enable wide-area distributed spatial hypertext using the existing infrastructure of the Internet. Versions of VKB have been in use for two years in tasks including note taking, writing, project management, and conference organization.
An efficient table-driven decoder for one-half rate convolutional codes
Authors: A. Dholakia, T. M. Lee, D. L. Bitzer, M. A. Vouk, L. Wang, P. D. Franzon
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

Error control schemes are becoming increasingly important as the needs increase for very high rates of data transmission over inherently noisy channels (e.g. satellite and spread-spectrum communication). Forward error-correction is one means of improving channel performance, but at high data transmission rates very efficient decoder implementations are required. In this paper, we describe an efficient table-driven decoder for 1/2-rate nonsystematic convolutional codes. Various decoder implementation and performance issues are discussed.
On the power of unique 2-prover 1-round games
Authors: Subhash Khot
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa (we implicitly assume games to be one round games). The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. We make the following conjecture regarding the power of unique 2-prover games, which we call the Unique Games Conjecture:(MATH) The Unique Games Conjecture: For arbitrarily small constants $ \ \zeta, \ \delta > 0$, there exists a constant $k = k(\zeta,\delta)$ such that it is NP-hard to determine whether a unique 2-prover game with answers from a domain of size $k$ has value at least $1-\zeta$ or at most $\delta$. \medskip.(MATH) We show that a positive resolution of this conjecture would imply the following hardness results:<ol>For any $\frac{1}{2} < t < 1$, for all sufficiently small constants $\epsilon > 0$, it is NP-hard to distinguish between the instances of the problem 2-Linear-Equations mod 2 where either there exists an assignment that satisfies $1-\epsilon$ fraction of equations or no assignment can satisfy more than $1-\epsilon^t$ fraction of equations. As a corollary of the above result, it is NP-hard to approximate the Min-2CNF-deletion problem within any constant factor.For the constraint satisfaction problem where every constraint is the predicate Not-all-equal($a,b,c$), $ \ a, b, c \in GF(3) \ $, it is NP-hard to distinguish between the instances where either there exists an assignment that satisfies $1-\epsilon$ fraction of the constraints or no assignment satisfies more than $\frac{8}{9}+\epsilon$ fraction of the constraints for an arbitrarily small constant $\epsilon > 0$. We also get a hardness result for a slight variation of approximate coloring of 3-uniform hypergraphs.</ol>.(MATH) We also show that a variation of the Unique Games Conjecture implies that for arbitrarily small constant $\delta > 0$ it is hard to find an independent set of size $\delta n$ in a graph that is guaranteed to have an independent set of size $\Omega(n)$.The main idea in all the above results is to use the 2-prover game given by the Unique Games Conjecture as an "outer verifier" and build new probabilistically checkable proof systems (PCPs) on top of it. The uniqueness property plays a crucial role in the analysis of these PCPs.(MATH) In light of such interesting consequences, we think it is an important open problem to prove (or disprove) the Unique Games Conjecture. We also present a semi-definite programming based algorithm for finding reasonable prover strategies for a unique 2-prover game. Given a unique 2-prover game with value $1-\zeta$ and answers from a domain of size $k$, this algorithm finds prover strategies that make the verifier accept with probability $1-O(k^2 \zeta^{1/5} \sqrt{\log (\frac{1}{\zeta})})$. This result shows that the domain size $k = k(\zeta, \delta)$ must be sufficiently large if the Unique Games Conjecture is true.
Using Waves and VHDL for Effective Design and Testing
Authors: James P. Hanna
Venue:  (1997)

:Using WAVES and VHDL for Effective Design and Testing presents a standard VHDL model test and verification methodology that facilitates automatic test bench generation as well as model and testbench interchange. Using a "building-block" approach, the book describes how a digital waveform may be dissected into components, and then how these components may be easily configured in WAVES to create the waveform for VHDL model testing - to stimulate a VHDL model and compare its responses with expected ones. Using WAVES and VHDL for Effective Design and Testing begins in the waveform context familiar to all engineers, and applies the WAVES principles and constructs in a sequential, easy-to-follow, tutorial fashion, allowing the reader to continually build upon knowledge and information as it is gained to learn and apply additional concepts and constructs. The chapters include real, simulatable, tested examples and code templates, which are also provided as source code on a companion CD, to permit the reader to try out the concepts and to build WAVES data sets for their particular applications.
Silicon Second Nature: Culturing Artificial Life in a Digital World
Authors: Stefan Helmreich
Venue:  (2000)

:Silicon Second Nature takes us on an expedition into an extraordinary world where nature is made of bits and bytes and life is born from sequences of zeroes and ones. Artificial Life is the brainchild of scientists who view self-replicating computer programssuch as computer virusesas new forms of life. Anthropologist Stefan Helmreich's look at the social and simulated worlds of Artificial Lifeprimarily at the Santa Fe Institute, a well-known center for studies in the sciences of complexityintroduces readers to the people and programs connected with this unusual hybrid of computer science and biology. When biology becomes an information science, when DNA is downloaded into virtual reality, new ways of imagining "life" become possible. Through detailed dissections of the artifacts of Artifical Life, Helmreich explores how these novel visions of life are recombining with the most traditional tales told by Western culture. Because Artificial Life scientists t to see themselves as masculine gods of their cyberspace creations, as digital Darwins exploring frontiers filled with primitive creatures, their programs reflect prevalent representations of gender, kinship, and race, and repeat origin stories most familiar from mythical and religious narratives. But Artificial Life does not, Helmreich says, simply reproduce old stories in new software. Much like contemporary activities of cloning, cryonics, and transgenics, the practice of simulating and synthesizing life in silico challenges and multiplies the very definition of vitality. Are these models, as some would claim, actually another form of the real thing? Silicon Second Nature takes Artifical Life as a symptom and source of ourmutatingvisions of life itself. Author Biography: Stefan Helmreich is Lecturer in Anthropology at Stanford University. 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
Visual basic .NET and XML
Authors: Rod Stephens, Brian Hochgurtel
Venue:  (2002)

Microsoft envisions a future where the Web will host millions of distributed applications all communicating via XML. Data packaged in XML will flow to and from databases, between applications, and directly to the browser. With the release of Visual Basic .NET, XML support is tightly integrated into the language and provides numerous methods for manipulating XML data. This tight integration means that VB programmers can load, manipulate, and save XML data faster and more easily than ever before. With real-world and fully functional examples, Rod Stephens and Brian Hochgurtel walk you step-by-step through how to take advantage of XML in all aspects of enterprise VB.NET development.
Web Site Developers Guide for Windows NT: With Cdrom, 1st edition
Authors: Sanjaya Hettihewa
Venue:  (1996)

:Windows NT and Microsoft's newly developed Internet Information Server is making it easier and more cost-effective to set up, manage, and administer a good Web site. Since the Windows NT environment is relatively new, there are few book on the market that adequately discusses its full potential. Windows NT 4 Web Development addresses that potential by providing information on all key aspects of server setup, maintenance, design, and implementation.Teaches how to incorporate new technologies to your Web siteCovers Java, JavaScript, Internet Studio, and Visual Basic ScriptCD-ROM contains valuable source code and powerful utilities
Maple: An Introduction and Reference
Authors: Michael Kofler
Venue:  (1997)

:Maple: An Introduction and Reference offers a practical and accessible introduction to the latest version of this very popular computer algebra system. The bookIs clear structure, which features syntax summaries at the end of each chapter, makes it ideal as both a text- and reference book. Following a straightforward introduction to Maple, all the important applications of the computer algebra system are covered, including simplification of mathematical expressions, equation solving, differentiation and integration, Fourier and Laplace transformations, and vector analysis. Features contains hundreds of examples extensive coverage of graphics, with more than 200 illustrations includes an introduction to programming common error and survival sections help avoid the usual pitfalls CD-ROM included, containing all the examples in the book, the Windows program MaplePS, which converts Maple graphics files into a format suitable for importing into any word processing program, and demo versions of Maple serving Macintosh, Windows and Unix platforms
The Plague of Fantasies
Authors: Slavoj Zizek
Venue:  (1997)

:With his idiosyncratic blend of ideas from Lacan and Hegel, the Slovenian philosopher Slavoj Zizek has emerged as one of the most original thinkers of our time. Never missing an opportunity to recount a revealing anecdote or joke, his writing is as entertaining as it is informative. Untangling a heady mix of fantasy and ideology, Zizek is sure to entertain his readers. 288 pp. 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
Sad MACs, Bombs and Other Disasters: And What to Do about Them, 4th edition
Authors: Ted Landau
Venue:  (2000)

:You don't need to be an expert to fix your Mac--most problems don't require hardware repair skills or advanced technical knowledge. That's the philosophy behind the bestselling Sad Macs, Bombs, and Other Disasters, now in its fourth edition. Newly updated to cover Mac OS 9 and the G4s, it's the premier troubleshooting guide for anyone who owns a Mac and wants to keep frustrating downtime to a minimum. Not only will this book help you diagnose and fix the most common--and annoying--Mac problems, it will sharpen your diagnostic skills so you can apply them to problems you may not find in the book. Sad Macs gives you the solutions you're looking for in plain English--not technical jargon--which makes it appropriate for everyone who wants to keep their Mac smiling, from near-beginners on up. Platform: MAC
ARM System Architecture
Authors: Steve B. Furber
Venue:  (1996)

:Features allows the reader to get started with the ARM chip and get programs running under emulation discusses assembly level programming, particularly for the ARM provides information on general computer architecture (processor design, caches, memory management) with detailed illustrations based on ARM chips details the architecture development process covers embedded system design principles and case studies
Disk Detective: Secrets You Must Know to Recover Information from a Computer
Authors: Norbert Zaenglein
Venue:  (1998)

:"Disk Detective" is designed to bring the secrets of information recover to the average person. In it, the author shows PIs, parents, teachers, business owners and law enforcement professionals what types of information can be recovered from IBM-compatible personal computers and how. He includes step-by-step instructions for * recovering information from reformatted disks or overwritten files retrieving deleted files * discovering passwords * retracing visited Internet files * Locating e-mail messages, and more. 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
Configuring distributed systems
Authors: Jeff Kramer, Jeff Magee, Morris Sloman
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Distributed systems are constructed from a set of computational components which are bound together to interact and communicate to achieve some over all objective. In this paper, we examine the issues related to system configuration, particularly those related to component binding. We argue that there is a need for tools to aid the initial construction and subsequent management of the structure of distributed systems.Currently, distributed systems are most commonly structured using a client/server approach. Servers register the service they provide by installing the name and type of the service together with a reference to that service in a distinguished server generally known as a name server. Clients bind to a particular service by looking up the reference in a name server (the reference to which must be well known). Once the client has retrieved the service reference, the service may be directly invoked (although, if the reference is location independent, it may require translation to an address). ANSA[1] is an example of a distributed systems environment which conforms to this paradigm with the extension of providing a more general service than name to reference translation via its Traders. Traders provide the ability to locate services by attribute in addition to simple name lookup.Problems with the client/server approach arise when the systems we wish to construct have a more complex interconnection structure than the simple many-to-one interconnection pattern which the approach directly supports. In particular, where the distributed program is more sensibly viewed as a set of agents with peer-to-peer connections. An example is the way applications may be constructed under Unix from a pipeline of filter processes. Although all reasonable systems allow servers to be the client for other services, the interconnection process becomes tortuous. It is the authors view that as distributed systems mature and become more complex, as servers themselves are realised by distributed multi-agent programs, this problem will become more acute.
Understanding and addressing the impact of wiring congestion during technology mapping
Authors: Davide Pandini, Lawrence T. Pileggi, Andrzej J. Strojwas
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

Traditionally, interconnect effects are taken into account during logic synthesis via wireload models, but their ineffectiveness for DSM technologies has been demonstrated and various physical synthesis approaches have been spawned to address the problem. Of particular interest is that logic block size is no longer dictated exclusively by total cell area, yet synthesis optimization objectives are aimed specifically at minimizing the number and size of cells. Methodologies that incorporate congestion within the logic synthesis objective function have been proposed in [9][10][11] and [15]; however, as we will demonstrate, predicting the true congestion prior to layout is not possible, and the efficacy of any approach can only be evaluated after routing is completed within the fixed die size. In this paper we propose a practical, complete methodology which first performs congestion-aware technology mapping using a global weighting factor for the cost function [15], and then applies incremental localized unmapping and remapping on congested areas. This complete approach addresses the problem that one global factor is not ideally suited for all regions of the designs. Most importantly, through the application of this methodology to industrial examples we will show that any attempt at a purely top-down single-pass congestion-aware technology mapping is merely wishful thinking.
The case for reflective middleware
Authors: Fabio Kon, Fabio Costa, Gordon Blair, Roy H. Campbell
Venue: Communications of the ACM (2002)

It's flexible and reconfigurable yet simple for programmers to use, notably for building dynamic distributed applications operating on the Net.