ppxscal/embedding_network huggingface dataset:
A mixture-model based algorithm for real-time terrain estimation: Research Articles
Authors: Isaac Miller, Mark Campbell
Venue: Journal of Robotic Systems (2006)

A real-time terrain mapping and estimation algorithm using Gaussian sum elevation densities to model terrain variations in a planar gridded elevation model is presented. A formal probabilistic analysis of each individual sensor measurement allows the modeling of multiple sources of error in a rigorous manner. Measurements are associated to multiple locations in the elevation model using a Gaussian sum conditional density to account for uncertainty in measured elevation as well as uncertainty in the in-plane location of the measurement. The approach is constructed such that terrain estimates and estimation error statistics can be constructed in real-time without maintaining a history of sensor measurements. The algorithm is validated experimentally on the 2005 Cornell University DARPA Grand Challenge ground vehicle, demonstrating accurate and computationally feasible elevation estimates on dense terrain models, as well as estimates of the errors in the terrain model. &copy; 2006 Wiley Periodicals, Inc.
IP Location, 1 edition
Authors: Martin Dawson, James Winterbottom, Martin Thomson
Venue:  (2006)

Comprehensive Coverage of the Breakthrough Technology That Can Find Anyone or Anything--AnywhereIn today's vast world of global commerce with users that are more nomadic than ever, the need for reliable, secure, and efficient access technologies is rapidly increasing. IP Location provides you with a guided tour of location determination, tackling this new technology head on and addressing all aspects of location management, delivery, and conveyance within IP networks. Covering important real-world applications such as emergency (911) services, asset tracking, call routing, navigation, and staff location in hot desk environments, this book gives you all the information you need to fully support this cutting-edge technology.Learn how location information is produced, transported, and consumed on the InternetUnderstand the semantics and constructs of the HELD and FLAP protocolsDiscover the three roles of the presence model--presentity, presence service, and watcherExplore how the Access Location Entity (ALE) helps determine location within particular types of networksExamine in detail the Location Information Server (LIS) including its different types and interfacesDetermine IP location for devices connected to all types of networks including WiFi and WiMAXGet details on location determination and acquisition techniques for residential broadband networks such as DSL and cableFind out about privacy controls and considerations for Internet locationTable of contentsForewordAcknowledgmentsIntroductionChapter 1: A Brief History of Location Services and ConceptsChapter 2: Location, Presence and PrivacyChapter 3: Location Determination and the Access Location EntityChapter 4: The LIS, Location Acquisition and the HELD ProtocolChapter 5: IP Location in Enterprise NetworksChapter 6: IP Location in Wireline Public Carrier NetworksChapter 7: WiFi and Ad Hoc Wireless NetworksChapter 8: IP Location in Wireless Public Carrier NetworksChapter 9: Device Interactions in Location DeterminationChapter 10: Privacy Considerations for Internet LocationAppendix A: Abridged FLAP SpecificationAppendix B: HELD Base SchemaAppendix C: Digital Signature for PIDF-LOAppendix D: HELD Protocol BindingsAppendix E: HELD Identity ExtensionsGlossaryIndex
Supporting interface customization using a mixed-initiative approach
Authors: Andrea Bunt, Cristina Conati, Joanna McGrenere
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We describe a mixed-initiative framework designed to support the customization of complex graphical user interfaces. The framework uses an innovative form of online GOMS analysis to provide the user with tailored customization suggestions aimed at maximizing the user's performance with the interface. The suggestions are presented non-intrusively, minimizing disruption and allowing the user to maintain full control. The framework has been applied to a general user-productivity application. A formal user evaluation of the system provides encouraging evidence that this mixed-initiative approach is preferred to a purely adaptable alternative and that the system's suggestions help improve task performance.
Sketching articulation and pose for facial animation
Authors: Edwin Chang, Odest Chadwicke Jenkins
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present a method for articulating and posing meshes, in particular facial meshes, through a 2D sketching interface. Our method establishes an interface between 3D meshes and 2D sketching with the inference of reference and target curves. Reference curves allow for user selection of features on a mesh and their manipulation to match a target curve. Our articulation system uses these curves to specify the deformations of a character rig, forming a coordinate space of mesh poses. Given such a coordinate space, our posing system uses reference and target curves to find the optimal pose of the mesh with respect to the sketch input. We present results demonstrating the efficacy of our method for mesh articulation, mesh posing with articulations generated in both Maya and our sketch-based system, and mesh animation using human features from video. Through our method, we aim to both provide novice-accessible articulation and posing mesh interfaces and rapid prototyping of complex deformations for more experienced users.
Essential Microsoft Operations Manager
Authors: Chris Fox
Venue:  (2006)

For system administrators, ensuring that all Windows servers are performing optimally is a tall order. The larger the enterprise, the greater the chance for irritating, time-consuming configuration problems. Sometimes, you can determine the root cause of the problem yourself-but that's only if you're lucky. With Microsoft Operations Manager (MOM), the diagnosis is done for you. MOM monitors server operations and automatically notifies you of problems by sending an immediate alert to your console, email address, or pager. To help you better understand how MOM works, O'Reilly presents Essential Microsoft Operations Manager.The goal of this comprehensive tutorial is to give first-time MOM administrators a solid foundation for planning, implementing, and administering MOM 2005. Author Chris Fox, a renowned MOM expert, offers the type of practical, real-world advice that you need to improve the performance of your IT infrastructure.After taking you through the entire process of setting up MOM on the network, the book moves on to more advanced administration issues. It carefully instructs you how to program and automate MOM and the agents that reside on the servers themselves. You'll also learn how to manage the scripts that determine which server agents are relevant to report.By capturing system data, intelligently analyzing it, and then notifying you with a suggested course of action, MOM makes extinguishing fires a breeze. And now, thanks to Essential Microsoft Operations Manager, learning how to use MOM is a breeze, too.
Introduction to information extraction
Authors: Douglas E. Appelt
Venue: AI Communications (1999)

In recent years, analysts have been confronted with the increasing availability of on&dash;line sources of information in the form of natural&dash;language texts. This increased accessibility of textual information has led to a corresponding interest in technology for processing this text automatically to extract task&dash;relevant information. This demand for a technological solution to the need to deal with the often&dash;overwhelming quantity of available information has stimulated the development of the field of Information Extraction. This article provides an overview of the problems addressed, current approaches toward solutions, and assesses the state of the art and its potential for future progress.
The shunt: an FPGA-based accelerator for network intrusion prevention
Authors: Nicholas Weaver, Vern Paxson, Jose M. Gonzalez
Venue: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays (2007)

The sophistication and complexity of analysis performed by today's network intrusion prevention systems (IPSs) benefits greatly from implementation using general-purpose CPUs. Yet the performance of such CPUs increasingly lags behind that necessary to process today's high-rate traffic streams. A key observation, however, is that much of the traffic comprising a high-volume stream can, after some initial analysis, be qualified as "likely uninteresting." To this end, we have developed an in-line, FPGA-based IPS ac-celerator, the Shunt, using the NetFPGA2 platform. The Shunt functions as the forwarding device used by the IPS; it alone processes the bulk of the traffic, offloading the memory bus and leaving the CPU free to inspect the subset of the traffic deemed germane for security analysis. To do so, the Shunt maintains several large state tables indexed by packet header fields, including IP/TCP flags, source and destination IP addresses, and connection tuples. The tables yield decision values the element makes on a packet-by-packet basis: forward the packet, drop it, or divert it through the IPS. By manipulating table entries, the IPS can specify the traffic it wishes to examine, directly block malicious traffic, and "cut through" traffic streams once it has had an opportunity to "vet" them, all on a fine-grained basis. We base our design on a novel series of caches, with a "fail safe" miss policy, coupled to a host PC to handle both cache management and higher level IPS analysis. The design requires only 2 MB of SRAM for its extensive caches, and can sup-port four Gbps Ethernets on a single Virtex 2 Pro 30.
Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format
Authors: Fred G. Gustavson, John K. Reid, Jerzy Waśniewski
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n &plus; 1)/2 real variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel subroutine that is used for the Cholesky factorization of the diagonal blocks since it is suitable for any positive-definite symmetric matrix that is small enough to be held in cache. We provide a comprehensive test program and simple example programs.
Mike Meyers' MCSE/MCSA Windows Server 2003 Active Directory Certification Passport (Exam 70-294), 1 edition
Authors: Brian Culp
Venue:  (2003)

Mike Meyers, the industry expert on professional certification, brings you this concise, affordable, and portable study tool for exam 70-294. With an intensive focus on only what you need to know to pass this challenging exam plus practice exam software on CD, this Certification Passport is your ticket to success on exam day.Table of contents 1: Planning and Preparing for Active Directory 2: The Physical Active Directory Components 3: The Logical Active Directory Components 4: Managing and Maintaining an Active Directory Infrastructure 5: Planning and Implementing User, Computer, and Group Strategies 6: Planning and Implementing Group Policy 7: Manage Software and Security Using Group Policy Appendix A: About the CD-ROM Appendix B: Career Flight Path Appendix C: DNS: The Backbone for Active Directory
Planar parameterization for closed 2-manifold genus-1 meshes
Authors: D. Steiner, A. Fischer
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Parameterization of 3D meshes is important for many graphics and CAD applications, in particular for texture mapping, re-meshing and morphing. Current parameterization methods for closed manifold genus-n meshes usually involve cutting the mesh according to the object generators, fixing the resulting boundary and then applying the 2D position for each of the mesh vertices on a plane, such that the flattened triangles are not too distorted and do not overlap. Unfortunately, fixing the boundary distorts the resulting parameterization, especially near the boundary. A special case is that of closed manifold genus-1 meshes that have two generators. They can therefore be flattened naturally to a plane without the use of a fixed boundary while still maintaining the continuity of the parameterization. Therefore, in treating genus-1 objects, this attribute must be exploited. This paper introduces a generalized method for planar parameterization of closed manifold genus-1 meshes. As in any planar parameterization with a fixed boundary, weights are assigned over the mesh edges. The type of weights defined depends on the type of mesh characteristics to be preserved. The paper proves that the method satisfies the non-overlapping requirement for any type of positive barycentric weights, including nonsymmetrical weights. Moreover, convergence is guaranteed according to the Gauss-Seidel method. The proposed method is simple to implement, fast and robust. The feasibility of the method will be demonstrated on several complex objects.
Bridging the Gap between Simulation and Experimental Evaluation in Computer Networks
Authors: Marinho P. Barcellos, Giovani Facchini, Hisham H. Muhammad
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

Simulation and experimentation are two complementary techniques for performance evaluation, each one of them having opposite characteristics and advantages. While one allows total control and abstraction in the experiment, the other provides greater detail and realism. Though ideally it would be desirable to perform both, it is hard to direct the required efforts to develop a performance evaluation twice, once over a simulator and then again on a real network. In this paper a new approach is explored through a tool called Simmcast Testbed, which allows one to execute, from a single codebase, experiments both in simulation and experimentation mode. A didactic example is discussed in detail, and the correlation of the simulated and experimental results is presented.
Toward diagrammability and efficiency in event-sequence languages
Authors: Kathi Fisler
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

Many industrial verification teams are developing suitable event-sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardware specific, as well as efficient to verify. While the formal verification community has formal models for assessing the efficiency of an event-sequence language, none of these models also accounts for designer friendliness. We propose an intermediate language for event sequences that addresses both concerns. The language achieves usability through a correlation to timing diagrams; its efficiency arises from its mapping into deterministic weak automata. We present the language, relate it to existing event-sequence languages, and prove its relationship to deterministic weak automata. These results indicate that timing diagrams can become more expressive while remaining more efficient for symbolic model checking than LTL.
Access 2007 for Starters: The Missing Manual
Authors: Matthew MacDonald
Venue:  (2007)

This fast-paced book teaches you the basics of Access 2007 so you can start using this popular database program right away. You'll learn how to work with Access' most useful features to design databases, maintain them, search for valuable nuggets of information, and build attractive forms for quick-and-easy data entry. The new Access is radically different from previous versions, but with this book, you'll breeze through the new interface and its timesaving features in no time with: Clear explanationsStep-by-step instructionsLots of illustrationsLarger typePlenty of friendly advice One thing that hasn't improved is Microsoft's documentation. Even if you find the features you need, you still may not know what to do with them. Access 2007 for Starters: The Missing Manual is the perfect primer for small businesses with no techie to turn to, as well as those who want to organize household and office information. Ideal for small businesses and households, Access runs on PCs and manages large stores information, including numbers, pages of text, and pictures -- everything from a list of family phone numbers to an enormous product catalog. Unfortunately, each new version of the program crammed in yet another set of features -- so many that even the pros don't know where to find them all. Access 2007 breaks the mold: Microsoft changed the user interface by designing a tabbed toolbar that makes features easy to locate.
Indirect cycle-time quantile estimation for non-FIFO dispatching policies
Authors: Jennifer McNeill Bekki, Gerald T. Mackulak, John W. Fowler
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Previous work has shown that the Cornish-Fisher expansion (CFE) can be used successfully in conjunction with discrete event simulation models of manufacturing systems to estimate cycle-time quantiles. However, the accuracy of the approach degrades when non-FIFO dispatching rules are employed for at least one workstation. This paper suggests a modification to the CFE-only approach which utilizes a power data transformation in conjunction with the CFE. An overview of the suggested approach is given, and results of the implemented approach are presented for a model of a non-volatile memory factory. Cycle-time quantiles for this system are estimated using the CFE with and without the data transformation, and results show a significant accuracy improvement in cycle-time quantile estimation when the transformation is used. Additionally, the technique is shown to be easy to implement, to require very low data storage, and to allow easy estimation of the entire cycle-time cumulative distribution function.
Macromedia Dreamweaver 8 Recipes
Authors: Joseph Lowery, Eric Ott
Venue:  (2005)

Looking for timesaving ways to get frequently needed data-driven applications up and running? Look no further! In this book, you'll find a primer for using data sources to connect your Dreamweaver pages to a database. Lowery and Ott then provide step-by-step instructions for creating 7 full-featured, professional-quality Web applications suitable for small to medium organizations. Follow the carefully constructed tutorials, and you can use them today-because all the files and code you need are available on the included CD! Better still, the explanations you'll read will give you insight into why each step was taken so that you can extend any of the recipes to meet individualized needs. Recipes for the following full-feature applications: User Login ï¾ Employee Lookup Conference Room Scheduler In/Out Dashboard Time Cards Journal Mail Merge
Maran Illustrated Windows XP (Maran Illustrated)
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 500 full-color screen shots, illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of Windows XP, the latest version of Windows, including Windows Security Center, Wi-Fi wireless networking, Bluetooth wireless connections, Windows Media Player 10, and Internet Explorer's Pop-up Blocker. Also covers the latest in computer gadgets and accessories including MP3 player, DVD players, and much more. Using simple, easy-to-understand and concise text, this book covers over 120 essential Windows XP topics for both the Home and Professional versions, making it a great reference for all skill levels. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available. All examples contained in the book are available for download at www.maran.com. 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
Facial animation in a nutshell: past, present and future
Authors: Mauricio Radovan, Laurette Pretorius
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

During its almost forty years of existence, facial animation has seen a host of technologies being invented, then fading into obsolescence. The modelling and animation methods have mostly been dictated by the available hardware, which greatly evolved through the years. Many animation desiderata that have been considered dreams at the time are now reality while ever new frontiers are encountered and explored. This paper provides an overview of the historically used technologies and attempts to predict the future trends in the field of facial animation as it permeates the entertainment industry with its feature films and computer games; the broad field of visualisation in science, including medical science and forensic analysis; and the fast growing field of information and communication technology and human-computer interaction.
Absolute Beginner's Guide to Upgrading and Fixing Your PC
Authors: Michael Miller
Venue:  (2003)

We have the technology. This book shows how to make it stronger, faster, better than it was before... For some, buying a new PC is out of the question, so we show how to breathe life back into an older PC. Does that PC really need an upgrade or just a little fixing? This book shows how to make that call without breaking the bank. Why pay to have a PC tech perform simple upgrades? With the help of this book, readers can install a new DVD-ROM drive, memory and new speakers! 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
New methods in linear programming
Authors: Gordon B. Hatfield
Venue: Issue 19 (August 1975) (1975)

Linear programming (LP) is an area of applied mathematics that is concerned with the minimization (or maximization) of a real-valued linear function on a convex polyhedron. Since the underlying theory is relatively straightforward, the history of the field is dated by the development of algorithms for solving LP problems. Thus the first important contribution was the simplex method developed in 1974 by George Dantzig (4, p. 15). The approach taken by Dantzig was to transform the inequality constraints into a system of equations with sign-restricted variables. This permitted pivoting methods, for solving systems of equations, to be used in linear programming. Thus the simplex method is a set of pivoting rules designed to maximize a linear function constrained by a set of linear equations. Geometrically it can be viewed as an adjacent extreme point method that finds the maximum through an iterative process of implicitly enumerating basic feasible solutions. 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