ppxscal/embedding_network huggingface dataset:
On State Constraint Representations and Mesh-Dependent Gradient Projection Convergence Rates for Optimal Control Problems
Authors: J. C. Dunn
Venue: SIAM Journal on Control and Optimization (2000)

Two distinct nonlinear programming formulations are investigated for ODE optimal control problems with pointwise state and control constraints. The first formulation treats the differential equations of state as an equality constraint in the conventional manner. The second formulation employs a different equality constraint entailing the integrated state transition map. Related convergence rate estimates are developed for augmented gradient projection methods and discrete-time approximations to a large representative class of ODE control problems. In the first formulation, the rate estimates are mesh-dependent, and the predicted number of inner loop gradient projection iterations needed to achieve a fixed small deviation from the optimal value of the augmented Lagrangian is inversely proportional to the square of the mesh width. In the second formulation, the convergence rates and predicted iteration counts are mesh-invariant. The computational costs-per-iteration in the two formulations are comparable. These estimates elucidate previously published numerical experiments with augmented gradient projection% AGP methods and constrained regulator problems.
Secret Codes 2 for Nintendo 64
Authors: Tim Cox, David Bartley
Venue:  (1998)

:This edition 2 is an updated collection of the best cheats, tricks, and secret codes for the latest, top-selling Nintendo 64 video games. Game titles include Diddy Kong Racing, NFL Quarterback Club '98, Duke Nukem 64, MK Mythologies, and Nagano Winter Olympics '98.
Chromium: a stream-processing framework for interactive rendering on clusters
Authors: Greg Humphreys, Mike Houston, Ren Ng, Randall Frank, Sean Ahern, Peter D. Kirchner, James T. Klosowski
Venue: ACM Transactions on Graphics (TOG) (2002)

We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodity graphics accelerators. In addition, these stream filters can be extended programmatically, allowing the user to customize the stream transformations performed by nodes in a cluster. Because our stream processing mechanism is completely general, any cluster-parallel rendering algorithm can be either implemented on top of or embedded in Chromium. In this paper, we give examples of real-world applications that use Chromium to achieve good scalability on clusters of workstations, and describe other potential uses of this stream processing technology. By completely abstracting the underlying graphics architecture, network topology, and API command processing semantics, we allow a variety of applications to run in different environments.
Improved acquisition processes for safety-critical systems in the Australian department of defence
Authors: Peter A. Lindsay
Venue: Proceedings of the Sixth Australian workshop on Safety critical systems and software - Volume 3 (2001)

This paper describes recently developed policy and procedures for safety management during system acquisition within the Australian government's Defence Materiel Organisation (DMO). The thrust of the safety policy is that: all systems are considered safety-critical until shown otherwise; and any project acquiring or upgrading a system involving safety-critical elements is required to establish a System Safety Program during acquisition, and to deliver a Safety Case prior to acceptance into service. The policy is spelled out in detail, and recommended acquisition procedures are described.
Visualising reusable software over the web
Authors: Stuart Marshall, Kirk Jackson, Robert Biddle, Michael McGavin, Ewan Tempero, Matthew Duignan
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

This paper describes an architecture we have developed for web-based visualisation of remotely executing software. The motivation for this work is to allow users of web-based software repositories to explore existing code components and frame-works, to see what they do, and create interactive visual documentation of that code based on the developer's actions. This visual documentation can be used to determine what the code or framework does, how it does it, and whether it can be reused in the developer's current project. The architecture is designedy to be language neutral, and supports customisable software visualisations, viewable through widely available plug-ins to standard web browsers, and does not require modification of the source code being visualised.
Fault detection test derivation using Boolean difference techniques
Authors: George W. Smith,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

The Boolean difference technique for fault test derivation in logic networks is described through the use of simple examples. It is shown that the technique makes use of familiar Boolean algebra manipulations and eliminates the need for "chasing" 1's and 0's through the networks. A hint of the additional complexity of sequential networks is shown through the introduction of state variables and the derivation of test sequences.
America Online 4.0 Fast & Easy
Authors: Matthew Bryant, Kevin W. Ferns
Venue:  (1999)

:Learn AOL easily and visually--this book shows new members how to avoid the pitfalls, hindrances, and annoyances that often befall those with little Internet savvy. By spelling out the intricacies of the pricing plans, and online scams, this book will place the reader on the other end of the learning curve without them having to spend lots of time and read a 500 page book.
Com+ Unleashed with Cdrom
Authors: Richard Leinecker, Randy Charles Morin
Venue:  (2000)

:COM+ Unleashed provides a complete understanding of how to build and implement COM components, focusing on using COM+. This book shows you how to build COM objects and encapsulate their functionality, use distributed COM to build client/server and Web-based enterprise applications, and enhance applications with distributed services (MTS, MSMQ). You'll also see how to fully utilize the COM+ model to enhance productivity and to create highly flexible and powerful applications and encapsulate business logic into COM objects. You'll learn how to apply the COM+ model creatively and effectively to solve everyday programming problems, enhance the efficiency and functionality of your enterprise applications and build sophisticated distributed applications. The examples and programs in this book are written in C++.
Decision tree approximations of Boolean functions
Authors: Dinesh Mehta, Vijay Raghavan
Venue: Theoretical Computer Science (2002)

Decision trees are popular representations of Boolean functions. We show that, given an alternative representation of a Boolean function f, say as a read-once branching program, one can find a decision tree T which approximates f to any desired amount of accuracy. Moreover, the size of the decision tree is at most that of the smallest decision tree which can represent f and this construction can be obtained in quasi-polynomial time. We also extend this result to the case where one has access only to a source of random evaluations of the Boolean function f instead of a complete representation. In this case, we show that a similar approximation can be obtained with any specified amount of confidence (as opposed to the absolute certainty of the former case.) This latter result implies proper PAC-learnability of decision trees under the uniform distribution without using membership queries.
Web transaction analysis and optimization (TAO)
Authors: Pankaj K. Garg, Ming Hao, Cipriano Santos, Hsiu-Khuern Tang, Alex Zhang
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

In the TAO project we develop metrics, models, and infrastructure to effectively manage the performance of Web applications. We use WebMon, a novel instrumentation tool to obtain profile data for web interactions, from end-user and system component perspectives. Our analysis techniques help determine important classes of web users and their transactions. The analysis is embedded in visualization and optimization modules, enabling efficient reporting for system and business administrators, and automated resource scheduling and planning. In this paper we present an overview of TAO, and highlight some of its novel aspects, e.g., use of pixel-bar charts, web request classification, and integrated demand and capacity planning.
Interoperability: A Continuning Challenge in Coalition Air Operations
Authors: Myron Hura, lewis jamison, Kevin O'Connell, Daniel Gonzales, William Little, Gary W. McLeod, Eric Larson, Richard Mesic, Jody Jacobs, Dan Norton, James Schneider
Venue:  (2001)

:This report describes research that was conducted (1) to help the U.S. Air Force identify potential interoperability problems that may arise in NATO Alliance operations or in U.S. coalition operations with NATO allies over the next decade; and (2) to suggest nonmateriel and technology-based solution directions to mitigate identified shortfalls. The focus of the research is on command, control, communications, intelligence, surveillance, and reconnaissance (C3ISR) systems and on out-of-NATO-area operations. The research was sponsored by the Air Force Director of Intelligence, Surveillance, and Reconnaissance (USAF/XOI), the Air Force Director of Command and Control (USAF/XOC), and the commander of the Aerospace Command, Control, Intelligence, Surveillance, and Reconnaissance Center (AC2ISR/CC). The research was performed within the Aerospace Force Development program of Project AIR FORCE (PAF), and it builds on two recent PAF study projects: "Investment Guidelines for Information Operations-Focus on ISR" and "Developing Future Integrated C2 and ISR Capabilities." This report should be of interest to policymakers, planners, and program managers involved in interoperability issues and programs of U.S. and NATO allies' air forces. It should also be of interest to planners and operational commanders involved in the employment of coalition C3ISR and combat capabilities.Project AIR FORCE Project AIR FORCE, a division of RAND, is the Air Force federally funded research and development center (FFRDC) for studies and analysis. It provides the Air Force with independent analyses of policy alternatives affecting the development, employment, combat readiness, and support of current andfuture aerospace forces. Research is performed in four programs: Aerospace Force Development; Manpower, Personnel, and Training; Resource Management; and Strategy and Doctrine.
Pedal curves and surfaces
Authors: Kenji Ueda
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

The positive pedal curve of a given curve is the locus of the feet of perpendiculars from a fixed point to all the tangent lines to the curve. Higher pedals are defined by induction. In this paper, it is shown that complex numbers are suitable for representing pedal curves. Pedal surfaces are defined in a similar manner to pedal curves, and quarternions are suitable for expression pedal surfaces.
Information retrieval on the Web
Authors: Maristella Agosti, Massimo Melucci
Venue: Lectures on information retrieval (2001)

Information Retrieval (IR) on the Web can be considered from many different perspectives, but one objective and relevant aspect to consider is that on mid-1999 the estimated number of pages being published and available for indexing in the Web was 800 million for 6 terabytes of textual data. Those Web pages were estimated to be distributed over 3 million Web servers. This means that anyone cannot effort to explore all the information distributed over those pages, but anyone necessarily needs to be supported by tools that help the end users to choose the most relevant Web pages to answer any specific request of information. The Web has started to operate only 10 years ago, and just a few years after the first information retrieval tools have been made available to help Web users to find Web pages with relevant information. To deal with the complexity and heterogeneity of the Web, we need search tools implementing algorithms for indexing and retrieval that are more advanced than those currently employed in IR. These advanced algorithms need to exploit the structure of, and the inter-relationships among Web pages. From a research point of view, we need also to re-think evaluation because of the different characteristics of Web IR, which can be expressed in terms of data, functionalities, architecture, and tools. These characteristics affect "how" to carry evaluation out and "what" to evaluate. This chapter faces the different aspects of IR on the Web that can be considered and analysed, that is: history of IR on the Web, different types of tools for performing IR on the Web which have been designed and developed to answer different user requirements, architecture and components of those IR Web tools, indexing and retrieval algorithms that can be employed for making Web IR effective, and methods for evaluation of Web IR.
Constructing an OLAP cube from distributed XML data
Authors: Tapio Niemi, Marko Niinimäki, Jyrki Nummenmaa, Peter Thanisch
Venue: Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP (2002)

On-Line Analytical Processing (OLAP) is a powerful method for analysing large data warehouse data. Typically, the data for an OLAP database is collected from a set of data repositories such as e.g. operational databases. This data set is often huge, and it may not be known in advance what data is required and when to perform the desired data analysis tasks. Sometimes it may happen that some parts of the data are only needed occasionally. Therefore, keeping the OLAP database constantly up-to-date is not only a highly demanding task but it also may be overkill in practice.This suggests that in some applications it would be more feasible to form the OLAP cubes only when they are actually needed. We present such a system. As the data sources may well be heterogeneous, we propose an XML language for data collection. Our system also has a facility, where the user may pose a query against a "universal" OLAP cube using the MDX language. The query is analysed to determine which data is required for the desired OLAP cube.
Internet Directory for Dummies with Cdrom, 2nd edition
Authors: Brad Hill, Srinivasan
Venue:  (1998)

:With concise reviews and an easy-to-read design, Internet Directory For Dummies takes the hassle out of Web surfing by listing the best sites on the World Wide Web. Net-savvy author Brad Hill shows you the best sites for news, sports, entertainment, shopping, and much more. And to make your Web browsing even easier, the bonus CD contains the URLs for every Web site reviewed in this book, so you're only a double-click away from the best info on the Net! Inside, find helpful advice that lets you Search for cool Web sites with the informative Micons (mini icons) Discover funny and unusual corners of the Web Find Internet resources that are fun and safe for the whole family Discover the best places to go for information on sports Access information on your favorite hobbies and pastimes Get up-to-the-minute news and weather from around the world
An architectural co-synthesis algorithm for distributed, embedded computing systems
Authors: Wayne H. Wolf
Venue: Readings in hardware/software co-design (2001)

Many embedded computers are distributed systems, composed of several heterogeneous processors and communication links of varying speeds and topologies. This paper describes a new, heuristic algorithm which simultaneously synthesizes the hardware and software architectures of a distributed system to meet a performance goal and minimize cost. The hardware architecture of the synthesized system consists of a network of processors of multiple types and arbitrary communication topology: the software architecture consists of an allocation of processes to processors and a schedule for the processes. Most previous work in co-synthesis targets an architectural template, whereas this algorithm can synthesize a distributed system of arbitrary topology. The algorithm works from a technology database which describes the available processors, communication links, I/O devices, and implementations of processes on processors. Previous work had proposed solving this problem by integer linear programming (ILP); our algorithm is much faster than ILP and produces high-quality results.
Maple V by Example with Cdrom, 2nd edition
Authors: Martha L. Abell, James P. Braselton
Venue:  (1998)

:Maple V By Example, Second Edition is an excellent reference for beginning and experienced Maple V users. Coverage includes the built-in Maple V commands used in areas such as calculus, linear algebra, business mathematics, ordinary and partial differential equations, and graphics.
Policy-Based Networking: Architecture and Algorithms
Authors: Dinesh C. Verma
Venue:  (2000)

:Policy-based networking is the new frontier in networking. A high-level directive given to the network at a single console, it promises easy management of critical network elements such as security, Quality of Service, and device configuration. The translation of high level policies into the device specific configurations is a complex procedure, requiring detailed knowledge of the topology and routes in the network, and translation-enabling algorithms. This book would take the mystery out of this process, allowing you, the network engineer to build policy support into your network architecture. Only scattered pieces of the solution can currently be found in various IETF and DMTF working groups, or in some research presentations and workshops. In-depth understanding of the algorithms behind policy-based networking is necessary for network engineers/architects who want to create new products/applications that deliver policy features.
The SAGE graphics architecture
Authors: Michael Deering David Naegle
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

The Scalable, Advanced Graphics Environment (SAGE) is a new high-end, multi-chip rendering architecture. Each single SAGE board can render in excess of 80 million fully lit, textured, anti-aliased triangles per second. SAGE brings high quality antialiasing filters to video rate hardware for the first time. To achieve this, the concept of a frame buffer is replaced by a fully double-buffered sample buffer of between 1 and 16 non-uniformly placed samples per final output pixel. The video output raster of samples is subject to convolution by a 5x5 programmable reconstruction and bandpass filter that replaces the traditional RAMDAC. The reconstruction filter processes up to 400 samples per output pixel, and supports any radially symmetric filter, including those with negative lobes (full Mitchell-Netravali filter). Each SAGE board comprises four parallel rendering sub-units, and supports up to two video output channels. Multiple SAGE systems can be tiled together to support even higher fill rates, resolutions, and performance.
Microsoft Windows NT Workstation 4.0 at a Glance
Authors: Jerry Joyce, Marianne Moon
Venue:  (2000)

:Here's the visual way to quickly get to work using the Microsoft Windows NT Workstation 4.0 operating system. Microsoft Windows NT Workstation 4.0 at a Glance lets you focus on a particular task and shows you, with clear, numbered steps, the easiest way to get it done right now. Experience Level: Beginner/ Intermediate
Refactoring design models for inductive verification
Authors: Yung-Pin Cheng
Venue: ACM SIGSOFT Software Engineering Notes (2002)

Systems composed of many identical processes can sometimes be verified inductively using a network invariant, but systems whose component processes vary in some systematic way are not amenable to direct application of that method. We describe how variations in behavior can be "factored out" into additional processes, thus enabling induction over the number of processes. The process is semi-automatic: The designer must choose from among a set of idiomatic transformations, but each transformation is applied and checked automatically.
How To Use Microsoft Publisher 2000
Authors: Jennifer Fulton
Venue:  (1999)

:How to Use Microsoft Publisher 2000 visually steps you through everything you need to know in order to quickly create a desired publication. Since Microsoft Publisher comes with hundreds of built-in templates, the focus of this book is not on specific types of projects, but on basic product features and general desktop publishing and design techniques that help you use and customize templates for a variety of different types of publications. Topics include page design, working with text and type, pictures, backgrounds and color, publishing on paper, and publishing online.
Regular Languages are Testable with a Constant Number of Queries
Authors: Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
Venue: SIAM Journal on Computing (2001)

We continue the study of combinatorial property testing, initiated by Goldreich, Goldwasser, and Ron in [J. ACM, 45 (1998), pp. 653--750]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language $L\in \{0,1\}^*$ and an integer n there exists a randomized algorithm which always accepts a word w of length n if $w\in L$ and rejects it with high probability if $w$ has to be modified in at least $\epsilon n$ positions to create a word in L. The algorithm queries $\tilde{O}(1/\epsilon)$ bits of w. This query complexity is shown to be optimal up to a factor polylogarithmic in $1/\epsilon$. We also discuss the testability of more complex languages and show, in particular, that the query complexity required for testing context-free languages cannot be bounded by any function of $\epsilon$. The problem of testing regular languages can be viewed as a part of a very general approach, seeking to probe testability of properties defined by logical means.
Remote automatic doorman via the internet
Authors: Rafael Palacios
Venue: Communications of the ACM (2002)

Using a low-end PC and a Web browser to operate a door two buildings away.