ppxscal/embedding_network huggingface dataset:
How to Do Everything with Your Visor, 2nd edition
Authors: Rick Broida, Dave Johnson
Venue:  (2001)

:Enhance your Visor experience with this comprehensive,solutions-packed guide. Easy to follow and loaded with practical information,this resource will help you master built-in applications and become familiar with third-party tools,allowing you to get the most out of your handheld device. Ideal for both beginners and experienced users,this reference covers everything from basic set-up to advanced development tools that will allow you to create your own applications. Get small! Learn to use this extremely portable,pocket-sized electronic organizer to manage addresses,appointments,expenses,tasks,memos,and more. With coverage of more than 50 available modulesplus new devices like the Visor Edge,Prism,and Prothis comprehensive directory is loaded with information,solutions,and practical advice. Discover why the Visor is not only an extension of your desktop computer,but a computer in its own right,capable of running sophisticated software from spreadsheet managers and expense trackers to electronic-book readers and Web browsers. How To Do Everything with Your Visor,Second Edition will help you get the most from your Handspring PDA. Completely up-to-datecovers Visor Pro,Prism,and Edge models,as well as the latest Springboard modules Access third-party programs to extend your Visor's capabilitiesor write your own! Travel in style while playing games,checking email,and connecting to your Internet service provider Write fluidly in minutes with the handwriting-recognition software Master the Visor's core applicationsAddress List,Date Book,Memo Pad,and To Do List Learn about MP3 music players,digital cameras,mobilephones,GPS receivers,games,memory expansion,and more Throw away your laptopturn your Visor into a mobile office suite Share data with Windows,Macs,and other PDAs Troubleshoot common problems
Linux in a Nutshell, 2nd edition
Authors: Ellen Siever
Venue:  (1999)

:Linux in a Nutshell covers the core commands available on common Linux distributions. This isn't a scaled-down quick reference of common commands, but a complete reference to all user, programming, administration, and networking commands. Contents include: Programming, system administration, and user commands with complete lists of options LILO and Loadlin (boot) options Shell syntax and variables for the bash, csh, and tcsh shells Pattern matching Emacs and vi editing commands se and gawk commands Common configuration tasks for the GNOME and KDE desktops and the fvwm2 window manager Red Hat and Debian package managers New material in the third edition includes common configuration tasks for the GNOME and KDE desktops and the fvwm2 window manager, the dpkg Debian package manager, an expanded investigation of the rpm Red Hat package manager and CVS, and many new commands. Linux in a Nutshell is a must for any Linux user; it weighs less than a stack of manual pages, but delivers everything needed for common, day-to-day use. It also covers a wide range of GNU tools for Unix users who have GNU versions of standard Unix tools.
Neo-Industrial Organising: Renewal by Action and Knowledge Formation in a Project-Intensive Economy
Authors: Eskil Ekstedt
Venue:  (1999)

:Neo-Industrial Organising outlines the fundamental mechanisms at work in transforming traditional 'permanent' organizational structures. The authors draw upon several international companies for empirical evidence including Volvo, Ericsson, Digital Equipment andthe Royal Swedish Opera.
Symmetry Analysis of Differential Equations with Mathematica with Cdrom, 1st edition
Authors: Gerd Baumann
Venue:  (1999)

:This is the first book that uses Mathematica to compute and solve differential equations using Lie's theory. Each section begins with a theoretical discussion of the material; the applications are then presented along with the corresponding Mathematica solutions.
Identifiability and Well-Posedness of Shaping-Filter Parameterizations: A Global Analysis Approach
Authors: Christopher I. Byrnes, Per Enqvist, Anders Lindquist
Venue: SIAM Journal on Control and Optimization (2002)

In this paper, we study the well-posedness of the problems of determining shaping filters from combinations of finite windows of cepstral coefficients, covariance lags, or Markov parameters. For example, we determine whether there exists a shaping filter with a prescribed window of Markov parameters and a prescribed window of covariance lags. We show that several such problems are well-posed in the sense of Hadamard; that is, one can prove existence, uniqueness (identifiability), and continuous dependence of the model on the measurements. Our starting point is the global analysis of linear systems, where one studies an entire class of systems or models as a whole, and where one views measurements, such as covariance lags and cepstral coefficients or Markov parameters, from data as functions on the entire class. This enables one to pose such problems in a way that tools from calculus, optimization, geometry, and modern nonlinear analysis can be used to give a rigorous answer to such problems in an algorithm-independent fashion. In this language, we prove that a window of cepstral coefficients and a window of covariance coefficients yield a bona fide coordinate system on the space of shaping filters, thereby establishing existence, uniqueness, and smooth dependence of the model parameters on the measurements from data.
Law for E-Commerce
Authors: Roger LeRoy Miller, Gaylord A. Jentz
Venue:  (2001)

:This exciting new text highlights legal issues related to maintaining and conducting business on the World Wide Web. The text covers basic on-line legal environment topics plus specific topics that relate to management, marketing, human resources, finance, accounting/taxation, and economics. For maximum flexibility, the book can be sold as the core text or can be split into discipline-specific modules.
Virtual heritage: technology in the service of culture
Authors: Alonzo C. Addison
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

From the Coliseum in Rome to the verdant landscape of the Loire Valley, the world's cultural heritage has withstood the text of time. Today though, the pace of progress --- from urban sprawl to pollution, neglect, conflict, and even tourism --- threatens these landmarks of our past at an ever-increasing pace. In recent years, rapid advances in digital technologies, from 3D graphics, to multimedia, and virtual reality, have given heritage new hope: from archaeology to architecture, emerging digital tools offer promise in documenting, analyzing, and disseminating culture. Using examples from a decade of research at the University of California at Berkeley, and highlights from the 7th Int'l Conference on Virtual Systems and Multimedia (VSMM), we will explore the problems and potential of emerging documentation tools, representation and modeling aids, and presentation technologies.Despite the promise, more often than not, those responsible for recording, preserving, and teaching about culture have not been part of this digital revolution. Coupled with this, early 'digital heritage' failed to live up to expectations, whether due to limited tools, questionable research, or lack of visual realism. VAST and other gatherings are beginning to bridge researchers and practitioners, from government to academia, and archaeology to computer science. Using the Virtual Heritage Network and recent international media workshops with UNESCO as examples, we will explore the need for, and potential of, global cross-disciplinary collaboration. From the now obliterated Buddhist statues at Bamiyan, Afghanistan, to Minoru Yamasaki's Twin Towers in New York, we owe it to future generations to harness our digital tools to preserve and protect the world's cultural legacy.
Some results on k-power-free morphisms
Authors: G. Richomme, F. Wlazinski
Venue: Theoretical Computer Science (2002)

One way to generate infinite k-power-free words is to iterate a k-power-free morphism, that is a morphism that preserves finite k-power-free words. We first prove that the monoid of k-power-free endomorphisms on an alphabet containing at least three letters is not finitely generated. Test-sets for k-power-free morphisms (that is, the sets T such that a morphism f is k-power-free if and only if f(T) is k-power-free) give characterizations of these morphisms. In the case of binary morphisms and k=3, we prove that a set T of cube-free words is a test-set for cube-freeness if and only if it contains 12 particular factors. Consequently, a morphism f on {a,b} is cube-free if and only if f(aabbababbabbaabaababaabb) is cube-free (length 24 is optimal). Another consequence is an unpublished result of Leconte: a binary morphism is cube-free if and only if the images of all cube-free words of length 7 are cube-free. When k3, we show that no finite test-set exists for morphisms defined on an alphabet containing at least three letters. In the last part, we show that to generate an infinite cube-free word by iterating a morphism, we do not necessarily need a cube-free morphism. We give a new characterization of some morphisms that generate infinite cube-free words.
On the Boundary Complexity of the Union of Fat Triangles
Authors: János Pach, Gábor Tardos
Venue: SIAM Journal on Computing (2002)

A triangle is said to be {\it $\delta$-fat\/} if its smallest angle is at least $\delta>0$. A connected component of the complement of the union of a family of triangles is called a {\it hole}. It is shown that any family of n $\delta$-fat triangles in the plane determines at most $O\left(\frac{n}{\delta}\log\frac{2}{\delta}\right)$ holes. This improves on some earlier bounds of Efrat, Rote, Sharir, and Matousek, et al. Solving a problem of Agarwal and Bern, we also give a general upper bound for the number of holes determined by n triangles in the plane with given angles. As a corollary, we obtain improved upper bounds for the boundary complexity of the union of fat polygons in the plane, which, in turn, leads to better upper bounds for the running times of some known algorithms for motion planning, for finding a separator line for a set of segments, etc.
Exploration of process interaction in operating systems: a pipe-fork simulator
Authors: Steven Robbins
Venue: ACM SIGCSE Bulletin (2002)

This paper examines the use of a simulator to explore process interaction in Unix. The simulator allows instructors to trace through a variety of programs and to show how the processes and pipes are connected. Students can create C language programs and see how changes in their code or changes in process scheduling affect the configuration of the processes and pipes as well as the output of the program. Students can also see the consequences of not protecting critical sections in an executing program. The simulator is flexible enough to allow the creation of process fans, chains and trees as well as unidirectional and bidirectional rings. The program is written in Java and can be run as a standalone application or as an applet from a browser.
Sams Teach Yourself PowerPoint 97 in 10 Minutes, 1st edition
Authors: Faithe Wempen, Jennifer Fulton
Venue:  (1998)

:10 minutes is all you need to learn how to design captivating presentations quickly using the AutoContent Wizard; integrate charts, graphs, text, and even Web information from Office 97 and Internet Explorer; enliven your presentations with animation effects, pictures, sounds, and video clips; enhance your text with unique characters, fonts, and Word Art; master your presentation power by utilizing slide notes and presentation timers; customize your own templates and backgrounds for personalization; and make the Internet your audience by publishing directly to the Web.
Microcomputer Repair, 3rd edition
Authors: James L. Antonakos, Thomas A. Adamson
Venue:  (1998)

:The fourth edition of Microcomputer Repair contains 58 exercises divided into six units. This combined text and tab manual is designed to teach beginning electronics students the fundamental skills needed to service microcomputer systems' hardware and software. Major revisions to this edition are: Key terms and summary sections, additional information, and several new self-test questions and. activities have been added to all the exercises. Six new exercises increase coverage of Windows and networking. Exercise 51, Computer Languages, now contains exposure to additional languages typically used an the PC, such as Visual C++ and Visual BASIC. Photos of new and current computer hardware have been added. A new Appendix C covers fault tolerance in Windows NT. A new Appendix D provides information -on installing and upgrading Windows. A glossary, which contains detailed terms related to microcomputer systems, has been added. Two CD-ROMs are packaged with the text: One CD-ROM contains DOS-executable programs called WiNQUIZ and NETQUIZ, which test the reader's knowledge of the text material, as well as demonstration versions of useful networking and file-management utilities. A second CD-ROM provides a demonstration version of McAfee Utilities.
Recognizing Imprecisely Localized, Partially Occluded, and Expression Variant Faces from a Single Sample per Class
Authors: Aleix M. Martínez
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The classical way of attempting to solve the face (or object) recognition problem is by using large and representative data sets. In many applications, though, only one sample per class is available to the system. In this contribution, we describe a probabilistic approach that is able to compensate for imprecisely localized, partially occluded, and expression-variant faces even when only one single training sample per class is available to the system. To solve the localization problem, we find the subspace (within the feature space, e.g., eigenspace) that represents this error for each of the training images. To resolve the occlusion problem, each face is divided into k local regions which are analyzed in isolation. In contrast with other approaches where a simple voting space is used, we present a probabilistic method that analyzes how "good" a local match is. To make the recognition system less sensitive to the differences between the facial expression displayed on the training and the testing images, we weight the results obtained on each local area on the basis of how much of this local area is affected by the expression displayed on the current test image.
CommOnCV: modelling the competencies underlying a curriculum vitae
Authors: Mounira Harzallah, Michel Leclère, Francky Trichet
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

This paper presents the project CommOnCV, which aims at dealing with the problematics of e---recruitment by considering a new approach based on competency management. The idea consists of allowing a job seeker (respectively a recruiter to identify and formally represent the competencies underlying its Curriculum Vitae (respectively its job offer). These competencies, which allow to make explicit knowledge, skills, abilities, traits and motives acquired by a person (respectively required for a job), are then used to refine the matching process between "supply and demand". In other words, the objective of CommOnCV is to provide to the end-users of websites dedicated to e---recruitment new job-matching services based on competency management. From a technical viewpoint, these competencies are represented by a set of CV's annotations, which are formally represented by using semantic web languages such as RDF/RDFs or DAML+OIL. These annotations, which respect a particular model of competency, are defined according to domain ontologies. These ontologies can be related to a specific sector like Finance/Banking or Healthcare (in this context, the ontology includes the description of jobs and their associated tasks, the description of knowledge, skills and abilities related to these jobs, the organizations of the leader firms, etc.) and/or to a particular enterprise (in this case, the ontology includes the description of more specific tasks exclusively performed by the considered enterprise, organizational, technological and cultural aspects, etc.).
Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
Authors: Mariane Pelletier
Venue: SIAM Journal on Control and Optimization (2000)

First, we define the notion of almost sure efficiency for a decreasing stepsize stochastic algorithm, and then we show that the averaging method, which gives asymptotically efficient algorithms, also gives asymptotically almost surely efficient algorithms. Moreover, we prove that the averaged algorithm also satisfies a law of the iterated logarithm, as well as an almost sure central limit theorem.
A Lagrange Scheme for a Mathematical Model of Powder Compression
Authors: G. Godinaud, M. N. Le Roux, A. Y. Le Roux
Venue: SIAM Journal on Scientific Computing (2001)

A mathematical model to simulate the compression of pharmaceutical powder under fixed deformation is proposed. This model is an hydrodynamic one, completed with the description of the porosity in the medium. This study leads to the elaboration of a general monodimensional model, made of three nonlinear partial derivative equations and a state law for the pressure. The mathematical resolution of this system is made using a splitting technique and an efficient numerical method.
SQL Server 7 Database Design; Covers Exam: 70-029 with Cdrom
Authors: David Besch
Venue:  (1999)

:The Microsoft Certified Systems Engineer (MCSE) certification continues to increase in popularity. Employers often require this certification because it proves applicants have mastered the ability to design, develop, implement, and support solutions with Microsoft products and technologies. Computer professionals who become Microsoft Certified are recognized as experts and are sought after industry-wide. Having MCSE credentials increases an administrator's salary potential by thousands of dollars. In order to obtain their MCSE, candidates are required to pass six exams-four core exams and two elective exams. This curriculum is very rigorous and extremely challenging. The MCSE exams, which cost $100 each, are much more difficult than the Novell CNE exams. Candidates are in need of a complete, concise, inexpensive study guide to fully prepare them to pass the exams.
Learning Java with CD-ROM, 1st edition
Authors: Pat Niemeyer, Jonathan Knudsen
Venue:  (2000)

:Part of O'Reilly's definitive set of Java documentation, Learning Java introduces the basics of Java, the object-oriented programming language for networked applications from Sun Microsystems. This book provides a broad survey of the Java 2 Standard Edition and contains everything you need to know to get up to speed quickly. It covers the essentials of hot topics like Swing and JFC; describes new tools for signing applets and other Java classes; and shows you how to write networked clients and servers, servlets, JavaBeans, and state-of-the-art user interfaces. Java started out as a tool for creating animated Web pages, but it's proved to be much more. Java is now used for everything from sophisticated Web clients to mission-critical enterprise applications. In the future, Java will become the basis for a new generation of distributed software that runs on devices ranging from cell phones to supercomputers. In the practical, hands-on approach characteristic of O'Reilly, Learning Java will show you why Java is now the language of choice for building the next generation of computer software. Includes CD-ROM containing the complete Java 2 SDK, version 1.3, as well as examples and code from the book. Part of O'Reilly's definitive set of Java documentation, Learning Java covers: History and principles of Java How to write simple applets and applications How to integrate applets into the World Wide Web Java Fundamental Class (JFC) and Swing Libraries Using threads Using arrays Network programming with sockets Remote Method Invocation Servlets Signing applets Creating a security policy
In Code
Authors: Sarah Flannery, David Flannery
Venue:  (2001)

:From puzzles on the blackboard in an Irish country kitchen to her acclaimed Cayley-Purser algorithm, Sarah Flannery has made an extraordinary beginning as a mathematician. Her research and discoveries in Internet cryptography won her both Ireland's Young Scientist of the Year and European Young Scientist of the Year awards. Her story was splashed across the front page of the London Times - and suddenly this teenager from Country Cork had an international reputation. How did Sarah, an above average student who loves "maths" but adamantly refuses epithets like brilliant or genius, astound the world with an algorithm? In Code, cowritten with Sarah's father and teacher, David Flannery, is a surprising and heartwarming story that will have readers cheering Sarah on. A memoir with mathematics, In Code tells how the girl next door moved from the simple math puzzles that were the staple of dinnertime conversation to number theory, the Sieve of Eratosthenes, and Femat's Little Theorem Finally culminating in a passion for public key cryptography, and the creative breakthroughs that led to her own discoveries. "A TERRIFIC ADVENTURE IN CRYPTOGRAHY." (Simon Singh, author of Fermat's Enigma and The Code Book" "A veritable mathematical travelogue. What every aspiring young scientist and mathematician needs: love, humor, inspiration and...a copy of this book." (Richard Mankiewicz, author of The Story of Mathematics) "Whether you're a math fan or have always shied away from it, you'll be hooked on Sarah Flannery's story from the very first page. The amazing life of this young woman and her incredible mathematical journey, told here by herself and her father-tutor, are sure to captivate you like few other human stories!" (Eli Maor, author of To Infinity and Beyond and e: The Story of a Number" "A wonderfully moving story about the thrill of the mathematical chase. Sarah's story should serve as an inspiration [not only] for all young people contemplating a life in mathematics...but for anyone interested in the human spirit and its boundless capacity for innovation and imagination." (John L. Casti, Nature) "A paean to intellectual adventure." (Times Educational Supplement) "An engaging, almost playful, book in which the reader is encouraged to spend lots of time working out mathematical puzzles [that] are interwoven with a narrative of Sarah's annus mirabilis. What's striking about this account is its level-headed, self-deprecating, eminently sane tone. This is a girl whose head hasn't turned by fame. And that, in a way, is her greatest achievement." (John Naughton, author of A Brief History of the Future.) Author Biography: Sarah Flannery is now a student at Cambridge University. David Flannery, Sarah's father, lectures on mathematics at Ireland's Cork Institute of Technology.
PERL with Cdrom
Authors: Joe Merlino
Venue:  (2001)

:The big day is Monday - the day you get to show off what you know about Perl. The problem is, you're not really up to speed. Maybe it's been a while since you worked with Perl. Of maybe you just like a challenge. In any event, we've got a solution for you -- Perl Weekend Crash Course. Open the book Friday evening and on Sunday afternoon - after completing 30 fast, focused sessions - you'll be able to jump right in and start writing Perl scripts. It's as simple as that.