ppxscal/embedding_network huggingface dataset:
MCSE Microsoft Windows 2000 Server Readiness Review: Exam 70-215
Authors: Robert Sheldon
Venue:  (2000)

:Building on the strengths of the world's leading server operating system, Windows 2000 Server will: Dramatically reduce the cost of ownership of managing enterprise computing resources. Be the ultimate platform for developing and deploying distributed applications. Designed for the Enterprise. 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
Iterative Identification and Control: Advances in Theory and Applications
Authors: P. Albertos, A. Sala Piqueras
Venue:  (2002)

:An exposition of the interplay between the modelling of dynamic systems and the design of feedback controllers based on these models is the main goal of this book. The combination of both subjects into a cohesive development allows the consistent treatment of both problems to yield powerful new tools for the improvement of system performance. Central among the themes of this work is the observation that operation of a system in feedback with a controller exposes the areas in which the model fit is constraining the controller performance achieved. The book presents new techniques for the understanding of the iterative improvement of performance through the successive fitting of models using closed-loop data and the design of high-performance controllers using these models. The subject matter includes: New approaches to understanding how to affect the fit of dynamical models to physical processes through the choice of experiments, data pre-filtering and model structure; connections between robust control design methods and their dependency on the quality of model fit; experimental design in which data collected in operation under feedback can reveal areas that limit the performance achieved; iterative approaches to link these model-fitting and control design phases in a cogent manner so as to achieve improved performance overall. The authors of individual chapters are some of the most renowned and authoritative figures in the fields of system identification and control design.
Genealogy Online for Dummies, 2nd edition
Authors: Matthew L. Helm, April Leigh Helm
Venue:  (1999)

:Is your great-grandmother's meticulously hand-sketched, parchment paper family tree yellowing in your attic and four generations out-of-date? Or maybe you're the first in your family to research your lineage. With help from Genealogy Online For Dummies, you can research your family history, establish your own genealogy Web site, communicate with other researchers, and catalog your findings -- all from the comfort of your own computer. Inside, find helpful advice on how to: Plan, organize, and undertake an efficient online genealogy project Identify important resources, find the information you need, and document it on your computer Locate other members of your family tree in cyberspace Discover genealogical associations, newsgroups, and mailing lists on the Internet Verify the family data you find Place your personal genealogy site on the World Wide Web
Optimal Control Formulation for Determining Optical Flow
Authors: Alfio Borzì, Kazufumi Ito, Karl Kunisch
Venue: SIAM Journal on Scientific Computing (2002)

An optimal control formulation for determining optical flow is presented. The new framework differs from preceding approaches in that it does not require differentiation of the data and does combine optical flow with image reconstruction. It can be considered as a control-in-the-coefficients problem with a cost functional of tracking type. A numerical algorithm that solves the optimality system consisting of hyperbolic and elliptic partial differential equations is presented. Numerical experiments demonstrate the effectiveness of the optimal control approach.
Smoothing Functions for Second-Order-Cone Complementarity Problems
Authors: Masao Fukushima, Zhi-Quan Luo, Paul Tseng
Venue: SIAM Journal on Optimization (2002)

Smoothing functions have been much studied in the solution of optimization and complementarity problems with nonnegativity constraints. In this paper, we extend smoothing functions to problems in which the nonnegative orthant is replaced by the direct product of second-order cones. These smoothing functions include the Chen--Mangasarian class and the smoothed Fischer--Burmeister function. We study the Lipschitzian and differential properties of these functions and, in particular, we derive computable formulas for these functions and their Jacobians. These properties and formulas can then be used to develop and analyze noninterior continuation methods for solving the corresponding optimization and complementarity problems. In particular, we establish the existence and uniqueness of the Newton direction when the underlying mapping is monotone.
Discrete Mathematics, 2nd edition
Authors: James L. Hein
Venue:  (2002)

:Discrete Mathematics, Second Edition is designed for an introductory course in discrete mathematics for the prospective computer scientist, applied mathematician, or engineer who wants to learn how the ideas apply to computer sciences. The choice of topics-and the breadth of coverage-reflects the desire to provide students with the foundations needed to successfully complete courses at the upper division level in undergraduate computer science courses.This book differs in several ways from current books about discrete mathematics. It presents an elementary and unified introduction to a collection of topics that has not been available in a single source. A major feature of the book is the unification of the material so that it does not fragment into a collection of seemingly unrelated ideas.
Compacting discriminator information for spatial trees
Authors: Inga Sitzmann, Peter J. Stuckey
Venue: Proceedings of the 13th Australasian database conference - Volume 5 (2002)

Cache-conscious behaviour of data structures becomes more important as memory sizes increase and whole databases fit into main memory. For spatial data, R-trees, originally designed for disk-based data, can be adopted for in-memory applications. In this paper, we will investigate how the small amount of space in an in-memory R-tree node can be used better to make R-trees more cache-conscious. We observe that many entries share sides with their parents, and introduce the partial R-tree which only stores information that is not given by the parent node. Our experiments showed that the partial R-tree shows up to 30 per cent better performance than the traditional R-tree. We also investigated if we could improve the search performance by storing more descriptive information instead of the standard minimum bounding box without decreasing the fanout of the R-tree. The partial static O-tree is based on the O-tree, but stores only the most important part of the information of an O-tree box. Experiments showed that this approach reduces the search time for line data by up to 60 per cent.
A logistic regression approach to distributed IR
Authors: Ray R. Larson
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

This poster session examines a probabilistic approach to distributed information retrieval using a Logistic Regression algorithm for estimation of collection relevance. The algorithm is compared to other methods for distributed search using test collections developed for distributed search evaluation.
XML Developer's Resource Library, 1st edition
Authors: Michael Leventhal, David Megginson, Mathew Fuchs, David Lewis, Robert Ducharme
Venue:  (1998)

:This authoritative, comprehensive resource for XML development features three book/CD-ROM packages at one price. The titles are "Structuring XML Documents"--DTDs that solve real-world problems; "Designing XML Internet Applications"--breakthrough Intranet information management techniques; and "XML: The Annotated Specifications"--the final standards, annotated by an expert.
Smart Card Application Development Using Java, 1st edition
Authors: Uwe Hansmann, Martin S. Nicklous, Frank Seliger, Thomas Schaeck
Venue:  (1999)

:In today's world, smart cards play an increasingly important role in everyday life. We encounter them as credit cards, loyalty cards, electronic purses, health cards, and as secure tokens for authentication or digital signature. Their small size and the compatibility of their form with the magnetic stripe card make them ideal carriers of personal information such as secret keys, passwords, customization profiles, and medical emergency information. This book provides a guide for the rapid development of smart card applications using Java and the OpenCard Framework. It gives you the basic information you need about smart cards and how they work. It shows in detail how to develop applications that use smart cards by guiding you through examples step by step. A smart card provided with the book will help you to quickly get some first hands-on experience.
The Weightless World: Strategies for Managing the Digital Economy
Authors: Diane Coyle
Venue:  (1998)

:'We live in a weightless world, not a global village.' -- Ffrom the introduction The Weightless World is the first book to map an economic world that has been turned upside down by digital technology and global business. How will our careers, businesses, and governments change in a world where bytes are the only currency and where the goods that shape our lives -- global financial transactions, computer code, and cyberspace commerce -- literally have no weight? Addressing such problems as economic inequity and unemployment, Diane Coyle calls on individuals and governments to develop a new politics of weightlessness so that the economic benefits can be shared fairly. She proposes the creation of a radical center as the way to a new era of human creativity and economic prosperity.
Error Analysis of a Finite Element--Integral Equation Scheme for Approximating the Time-Harmonic Maxwell System
Authors: G. C. Hsiao, P. B. Monk, N. Nigam
Venue: SIAM Journal on Numerical Analysis (2002)

In 1996 Hazard and Lenoir suggested a variational formulation of Maxwell's equations using an overlapping integral equation and volume representation of the solution [SIAM J. Math. Anal., 27 (1996), pp. 1597--1630]. They suggested a numerical scheme based on this approach, but no error analysis was provided. In this paper, we provide a convergence analysis of an edge finite element scheme for the method. The analysis uses the theory of collectively compact operators. Its novelty is that a perturbation argument is needed to obtain error estimates for the solution of the discrete problem that is best suited for implementation.
Skipper: a microarchitecture for exploiting control-flow independence
Authors: Chen-Yong Cher, T. N. Vijaykumar
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

Although modern superscalar processors achieve high branch prediction accuracy, certain branches either are inherently difficult to predict or incur destructive interference in prediction tables, causing significant performance loss due to mispredictions. We propose a novel microarchitecture, called Skipper, to handle such difficult branches by exploiting control-flow independence. Previous approaches to handling difficult branches, one way or another, amount to executing incorrect instructions, squandering cycles and resources such as the i-cache bandwidth. Skipper altogether avoids incorrect instructions by skipping over, without even fetching, the control-flow dependent computation conditioned by a difficult branch. Instead, Skipper fetches and executes the control-flow independent instructions, which are past the point where the branch's taken and not-taken paths reconverge, and which need to be executed irrespective of the branch outcome. Because Skipper executes the correct control-flow dependent instructions after the difficult branch is resolved, it conserves the valuable resources.Skipper is the first proposal to exploit control-flow independence by skipping over control-flow dependent computation in a superscalar pipeline. Skipper fetches the skipped control-flow dependent instructions after the post-reconvergent instructions, out of program order. We describe key mechanisms to implement Skipper without unduly complicating the pipeline despite out-of-order fetch. SPECint95 simulations show that Skipper performs 10% and 8% better than superscalar and the previously-proposed Polypath, respectively, when all three microarchitectures have equal i-cache bandwidth and hardware resources.
Utilizing complementary know-how: advanced fine arts meeting information technology to provide a virtual university for artists - students & alumni
Authors: Evangelos Sakkopoulos, Athanasios Tsakalidis
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Since 1837, Advanced School of Fine Arts (ASFA http://www.asfa.gr/) in Athens, Greece produced practically all Greek painters, sculptors and printmakers and it has currently enrolled approximately 2,000 students. For several years now ASFA closely collaborates with the oldest computer engineering institution in the country, Computer Engineering & Informatics Dept (CEID http://www.ceid.upatras.gr/), University of Patras, Greece. Together we have elaborated a significant number of projects bringing closer fine arts and information technology. Under a common umbrella, librarians, academics and artists from ASFA, computer specialists from CEID, coupled with network and laboratory administrators supporting the Greek Universities network backbone (GUnet http://www.gunet.gr/) in ASFA have jointly undertaken a visionary project: "Eurydice", a virtual university for both students and alumni artists.The scope is to provide the ASFA students and alumni artists with a convenient way to communicate ideas and knowledge in a life-long learning sense. We imagined an effective web service that is mastered during academic years and is used for long after their completion.The invasion of IT as well as the dominating role of ASFA for the reception of modern artistic trends by the wider public emerged the need for an Internet-based meeting-point that would provide integrated access to ASFA Library of Art, a range of automatically Renewable Educational Material on Fine Arts and on Artist-oriented IT topics, supported by a powerful set of Communicational Tools and Support Services with Personalization features that evolve over time, from the first day in ASFA until years later as mature artist-visitors.This paper will address the following topics: restructural changes followed the CEID know-how "invasion"; re-engineering of existing IT supporting services and procedures; the methodology followed for the requirements gathering, the conceptual design, the navigational design, the abstract interface design and implementation; the pilot phase feedback; training the helpdesk and administrators; populating the service in ASFA community.
AutoCAD 14: The Complete Reference
Authors: David S. Cohn
Venue:  (1998)

:Maximize your technical drafting and design productivity with AutoCAD 14, the fastest and most refined version of this top-rated design software. AutoCAD 14: The Complete Reference covers everything from 2-D drawing to working with external databases and shows you how to take advantage of all the new features, such as the Windows interface, smarter drawing tools, little-known bonus tools, built-in rendering capabilities, the SQL environment, and a wealth of internet file-sharing and publishing capabilities. Whether you're a student, architect, technical designer, or mechanical engineer, this one-stop tutorial and reference demonstrates how both beginners and experts can get the most out of this exceptional software.
Odyss&eacute;e versus hand differentiation of a terrain modeling application
Authors: Bernard Cappelaere, David Elizondo, Christèle Faure
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

A comparison is made between differentiation alternatives for a terrain modeling problem, a sample application where strong nonlinearities are solved iteratively. Investigated methods include automatic differentiation (AD) with the Odyss&eacute;e software (forward and reverse modes) and manual differentiation (MD) using the model's adjoint equations. The comparison mainly focuses on accuracy and computing efficiency, as well as on development effort. While AD ensures perfect consistency between the computer model and its derivative at a low development cost, MD shows significantly lesser computing costs. We discuss the perturbation method as well as hybrid strategies that combine advantages of AD and MD.
Distributed problem solving and planning
Authors: Edmund H. Durfee
Venue: Mutli-agents systems and applications (2001)

Distributed problem solving involves the collective effort of multiple problems solvers to combine their knowledge, information, and capabilities so as to develop solutions to problems that each could not have solved as well (if at all) alone. The challenge in distributed problem solving is thus in marshalling the distributed capabilities in the right ways so that the problem solving activities of each agent complement the activities of the others, so as to lead efficiently to effective solutions. Thus, while working together leads to distributed problem solving, there is also the distributed problem of how to work together that must be solved. We consider that problem to be a distributed planning problem, where each agent must formulate plans for what it will do that take into account (sufficiently well) the plans of other agents. In this paper, we characterize the variations of distributed problem solving and distributed planning, and summarize some of the basic techniques that have been developed to date.
Lossless and Dissipative Distributed Systems
Authors: Harish K. Pillai, Jan C. Willems
Venue: SIAM Journal on Control and Optimization (2001)

This paper deals with linear shift-invariant distributed systems. By this we mean systems described by constant coefficient linear partial differential equations. We define dissipativity with respect to a quadratic differential form, i.e., a quadratic functional in the system variables and their partial derivatives. The main result states the equivalence of dissipativity and the existence of a storage function or a dissipation rate. The proof of this result involves the construction of the dissipation rate. We show that this problem can be reduced to Hilbert's 17th problem on the representation of a nonnegative rational function as a sum of squares of rational functions.
C#: How to Program, 1st edition
Authors: Harvey M. Deitel, Paul J. Deitel, Marina Zlatkina
Venue:  (2001)

:The authoritative DEITEL LIVE-CODE introduction to Windows®, .NET, Internet and World Wide Web programming in C# This new book by the world's leading programming-language textbook authors carefully explains how to use C#the premier language in Microsoft's .NET initiativeas a general-purpose programming language, and how to develop multi-tier, client/server, data-base-intensive, Internet- and Web-based applications. Dr. Harvey M. Deitel and Paul J. Deitel are the founders of Deitel & Associates, Inc., the internationally-recognized corporate-training and content-creation organization specializing in C#, Visual Basic® .NET, Visual C++® .NET, Java, C++, C, XML, Python, Perl; Internet, Web, wireless, e-business and object technologies. The Deitels are the authors of several worldwide #1 programming-language textbooks, including Java How to Program, 4/e, C++ How to Program, 3/e and Internet & World Wide Web How to Program, 2/e. In C# How to Program the Deitels and their colleagues, Jeff Listfield, Tem. R. Nieto, Cheryl Yaeger and Marina Zlatkina, discuss topics you need to build complete .NET, Web-based applications. Key topics include: .NET Introduction/IDE/Debugger Web Services/ASP.NET Control Structures/Methods/Properties Classes/Data Abstraction OOP/Inheritance/Polymorphism Arrays/Data Structures/Collections Database/ADO .NET/SQLAssemblies/Namespaces/Exceptions GUI/Forms/Controls/Events/Delegates Web Forms/Web Controls/Accessibility XML/XSLT/DOM/VoiceXML Multithreading/Networking/Client-Server Files/Streams/Strings/Regular Expressions Operator Overloading/COM Integration Multimedia/Graphics/GDI+ Bit and Character Manipulation/Unicode® C# How to Program includes extensive pedagogic features: Hundreds of LIVE-CODE programs with screen captures that show exact outputs Internet and World Wide Web resources to encourage further research Hundreds of tips, recommended practices and cautionsall marked with icons C# How to Program is the centerpiece of a complete family of resources for teaching and learning C#, including several Web sites with the book's source-code examples (which are also on the enclosed CD) and other information for faculty, students and professionals; an optional interactive CD (C# Multimedia Cyber Classroom) containing hyperlinks, solutions to half the book's exercises and audio walkthroughs of the book's code examples; and e-mail access to the authors at: deitel@deitel.com For information on worldwide Deitel on-site seminars and to subscribe to the Deitel Buzz e-mail newsletter.
Automatic performance setting for dynamic voltage scaling
Authors: Krisztián Flautner, Steve Reinhardt, Trevor Mudge
Venue: Wireless Networks (2002)

The emphasis on processors that are both low power and high performance has resulted in the incorporation of dynamic voltage scaling into processor designs. This feature allows one to make fine granularity tradeoffs between power use and performance, provided there is a mechanism in the OS to control that tradeoff. In this paper, we describe a novel software approach to automatically controlling dynamic voltage scaling in order to optimize energy use. Our mechanism is implemented in the Linux kernel and requires no modification of user programs. Unlike previous automated approaches, our method works equally well with irregular and multiprogrammed workloads. Moreover, it has the ability to ensure that the quality of interactive performance is within user specified parameters. Our experiments show that as a result of our algorithm, processor energy savings of as much as 75% can be achieved with only a minimal impact on the user experience.