ppxscal/embedding_network huggingface dataset:
Limit Hamilton--Jacobi--Isaacs Equations for Singularly Perturbed Zero-Sum Dynamic (Discrete Time) Games
Authors: Peng Shi
Venue: SIAM Journal on Control and Optimization (2002)

In this paper we study a singularly perturbed zero-sum dynamic game with full information. We introduce the upper (lower) value function of the dynamic game, in which the minimizer (maximizer) can be guaranteed if at the beginning of each interval his move (the choice of decision) precedes the move of the maximizer (minimizer). We show that when the singular perturbations parameter tends to zero, the upper (lower) value function of the dynamic game has a limit which coincides with a viscosity solution of a Hamilton--Jacobi--Isaacs-type equation. Two examples are given to demonstrate the potential of the proposed technique.
MCSE: Windows 2000 Directory Services Administration Study Guide
Authors: Anil F. Desai, James Chellis
Venue:  (2000)

:The new Windows 2000 MCSE certification track is here! And Sybex, the leader in certification self-study material, has what you need to approach the exams with confidence. The MCSE: Windows 2000 Directory Services Administration Study Guide provides in-depth coverage of all official exam objectives. In addition to the practical, real-world instruction in the book, the accompanying CD comes with the following valuable study tools: Pre-Assessment Exams Program Simulators Electronic Flashcards for PCs and Palm Devices Sample Adaptive Exams Bonus Review Questions Searchable Electronic Version of Entire Book
Producing Interactive Television
Authors: Annesa Hartman
Venue:  (2001)

:Interactive Television (ITV) is experiencing new growth due to technology developments that are merging television with interactive, web-like elements. Major net-works and software companies are gearing up for ITV production, putting time and money into the development of ITV content and infrastructure. In Producing Interactive Television, developers and producers will find detailed information on what ITV is, what it can do, and the technology behind this fascinating medium. This comprehensive resource also includes a complete "start to finish" section on the ITV content development process, with real-world case studies of what does and doesn't work when creating an ITV show. The tutorials on producing interactive television are non-platform specific, so readers learn what it takes to design and develop ITV content for today's market, and learn about the current and future development technologies, including HTML, XML, and Flash implementation. KEY FEATURES: * Provides an in-depth overview of ITV * Includes non-platform specific coverage * Provides industry expert advice * Details information on the planning, implementation, and development of ITV content * Uses real world case studies of cutting-edge ITV projects to provide real insight into the development process * Includes a comprehensive section on the creation process from planning, budgeting, and implementing, to development and delivery * Provides clear explanations and diagrams of how ITV works and its development process, including the use of HTML and Flash content * Takes an extensive look at current technologies including set top box, synchronized TV, and digital solutions *Companion CD-ROM includes actual examples of TV interface designs, hands-on ITV design and development tutorials, and ITV simulator and trigger software TOC Introduction, PART I The ITV Momentum: Section One: ITV at Home, ITV Defined, Accessing ITV - The Many Choices, Section Two: The Life of ITV, ITV in its Infancy: Case Studies, ITV Growing Up - What's Working Now, Section Three: What's Coming Down the Cable?, Current ITV Technologies Explained, On the Table (discussion of industry issues such as privacy, open access vs. forced, team building, unified delivery system, and attracting audience) PART II The Process of ITV Content Creation: Section One: Planning and Implementation; The Complete Picture, Picking the "Kind" of Show You Want to Create, Who's Your Audience?, Brainstorm "the Look and Feel,  Assess Resources, Phases of Production, Section Two: Development; The Development Process, Interface Design, Code, Timing, PART III: Showcase (Case Studies). Author Biography Annesa Hartman is co-owner/director of Sway Design, Inc., an interactive design company specializing in the creation of educational and corporate print and online content, and corporate training and consulting. She specializes and instructs in Flash animation, web development, and ITV content development and design, and is a certified Softimage instructor.
Symmetric Coupling for Eddy Current Problems
Authors: R. Hiptmair
Venue: SIAM Journal on Numerical Analysis (2002)

In this paper a novel symmetric finite element method-boundary element method-coupling for the $\mathbf{E}$-based eddy current model is derived in a rigorous fashion. To that end, the properties of potentials and boundary integral operators arising from a Stratton--Chu-type representation formula for the electric field in the nonconducting region are thoroughly analyzed in a Hilbert-space setting. It yields a variational problem with symmetric bilinear form that is coercive in the natural function spaces. Unknowns are the electric field inside the conductor and the equivalent surface current related to the magnetic field. Existence and uniqueness of solutions and the convergence of a conforming finite element/boundary element Galerkin discretization immediately follows. In particular, schemes based on curl-conforming edge elements and divergence-conforming surface elements are examined, and some aspects of implementation are discussed.
Geographical and organisational locality in active environments
Authors: Mark J. Wharton
Venue: Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system (2000)

This paper presents a simple naming scheme that has many of the advantages of traditional naming schemes whilst also providing a powerful framework for finding local entities in terms of both geographical and organisational locality. It aims to provide users with a simple and intuitive way to access services relevant to them, as well and detailed geographical data, in a potentially global scale active environment.
An Algorithmic Regularity Lemma for Hypergraphs
Authors: Andrzej Czygrinow, Vojtech Rödl
Venue: SIAM Journal on Computing (2000)

In this paper, we will consider the problem of designing an efficient algorithm that finds an $\epsilon$-regular partition of an l-uniform hypergraph.
A Stochastic Control Approach to Portfolio Problems with Stochastic Interest Rates
Authors: Ralf Korn, Holger Kraft
Venue: SIAM Journal on Control and Optimization (2001)

We consider investment problems where an investor can invest in a savings account, stocks, and bonds and tries to maximize her utility from terminal wealth. In contrast to the classical Merton problem, we assume a stochastic interest rate. To solve the corresponding control problems it is necessary to prove a verification theorem without the usual Lipschitz assumptions.
Microsoft SQL Server 7.0 Performance Tuning Technical Reference
Authors: Steve Adrien DeLuca, Marcilina S. Garcia, Edward Whalen
Venue:  (2000)

:Microsoft SQL Server 7.0 Performance Tuning Techical Reference provides all the information that database administrators need toconfigure a SQL Server 7 relational database management system (RDBMS) for optimum performance and scalability. Unlike many tuning books onthe market, it teaches not just about the SQL Server 7 RDBMS but also about the underlying operating system and hardware. The advancedinformation it presents is easy to grasp because the authors start with the basics and build upon information in previous chapters to teach themechanics of performance tuning and how they affect the whole system.
Building Electronic Commerce with Web-Driven Databases with Cdrom, 1st edition
Authors: Anne Nelson, William Nelson
Venue:  (2001)

:Building Electronic Commerce with Web Database Constructions provides an overview of the topics that everyone must understand in order to create e-commerce sites that can display, insert, update, and delete data from a database. This book is set up as a tutorial rather than a theoretical reference. The chapters build upon each other, quickly laying foundational material on e-commerce in general, Web assessment, relational database principles, and HTML. Since technology in this area is rapidly changing, the chapters begin with an explanation of the concept (the architectures and approaches rather than specific tools). Thereafter, each chapter proceeds to a discussion of current tools and step-by-step examples that implement the concepts. These step-by-step examples are carried throughout the chapters and show the students the creation of an e-commerce site using Deerfield WebSite, one of today's most popular e-commerce programming environments. Guidelines are also included to show how the same site can be developed using Microsoft's IIS. After the examples, end-of-chapter project sections encourage students to develop their own site and put into practice the key concepts they have learned. The book also includes: Running case studies throughout every chapter that demonstrate how the techniques and tools discussed are implemented in a step-by-step manner to build Web database constructions, and to provide readers the opportunity to build their own Web database constructions. Recent electronic commerce news article case studies that demonstrate the application of theory and technique with specific tools. All the software tools neededto build the electronic commerce Web database constructions in the book including Deerfield WebSite, and eight other tools. Whether you are an IT professional, a student, or just like to learn about the hottest areas in computing, Building Electronic Commerce with Web Database Constructions is packed with information you can't afford to miss.
Visual Basic.NET by Example
Authors: Gabriel Oancea, Robert P. Donald
Venue:  (2001)

:Visual Basic.NET by Example helps the reader learn Visual Studio.NET as well as how the language interacts with the .NET framework and other Visual Studio programming languages. Using this book, the reader will learn to build stand alone applications or applications and services which run within Microsoft's .NET Framework. This book explains each topic using real code examples to illustrate the VB.NET language and teaches in an easy-to-use tutorial manner.
REALbasic: The Definitive Guide, 2nd edition
Authors: Matt Neuburg
Venue:  (2001)

:REALbasic is a programming language in the best Macintosh tradition: visual, intuitive, and easy to learn. It allows you to create interfaces in minutes and entire, compiled applications without having to learn a complicated language; the strong object orientation makes it very easy even for beginners to develop, maintain, and alter projects. Best of all, an REALbasic 3, a single button click generates your project as a Mac OS 8/9 application, a Mac OS X native ("Carbon") application, or a Windows executable. No other application framework lets you compile for users on so many platforms so quickly and easily. REALbasic: The Definitive Guide not only gives you a firm grasp of the program's essential concepts, but also tells you things you won't learn from the official documentation alone. If you've never programmed before, the book offers both a primer in REALbasic and an intuitive approach to the concepts of programming itself, as you quickly reach the ability to program every aspect of REALbasic. You start out drawing the interface much as you would do in a drawing program: by selecting buttons, menus, dialog boxes, and the like from a tools menu. Then you use the code editor to fill in the code that tells these pieces what to do. The widely hailed first edition of REALbasic: The Definitive Guide has been completely rewritten to encompass reader suggestions and the many improvements of REALbasic 3like its ability to compile and run under OS X. The book is divided into three sections: Fundamentals: a detailed summary of the language that quickly shows you how to think about programming and accomplishyour goals in less time User Interface: how to create a complete application using the rich classes and pre-defined tools that make life so much easier for the REALbasic programmer. Reaching Out: Internet communications, databases, multimedia, game programming and more!
Alias analysis for exceptions in Java
Authors: Jongwook Woo, Jehak Woo, Isabelle Attali, Denis Caromel, Jean-Luc Gaudiot, Andrew L Wendelborn
Venue: Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4 (2002)

We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements, its type table, and its propagation rules. Also, for an exception construct, we consider try/catch/finally blocks as well as potential exception statement nodes while building a control flow graph. Finally, for the safe alias computation on a control flow graph, we present a structural order traverse of each block and node.
Fixed-Parameter Tractability, Definability, and Model-Checking
Authors: Jörg Flum, Martin Grohe
Venue: SIAM Journal on Computing (2002)

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For example, we establish the equivalence between the model-checking for existential first-order logic, the homomorphism problem for relational structures, and the substructure isomorphism problem. Our main tractability result shows that model-checking for first-order formulas is fixed-parameter tractable when restricted to a class of input structures with an excluded minor. On the intractability side, for every $t\ge 0$ we prove an equivalence between model-checking for first-order formulas with t quantifier alternations and the parameterized halting problem for alternating Turing machines with t alternations. We discuss the close connection between this alternation hierarchy and Downey and Fellows' W-hierarchy. On a more abstract level, we consider two forms of definability, called Fagin definability and slicewise definability, that are appropriate for describing parameterized problems. We give a characterization of the class FPT of all fixed-parameter tractable problems in terms of slicewise definability in finite variable least fixed-point logic, which is reminiscent of the Immerman--Vardi theorem characterizing the class PTIME in terms of definability in least fixed-point logic.
Retargetable cross compilation techniques: comparison and analysis of GCC and Zephyr
Authors: Dai Guilan, Tian Jinlan, Zhang Suqin, Jiang Weidu, Dai Jun
Venue: ACM SIGPLAN Notices (2002)

Both GCC and Zephyr are representative complier infrastructures. The paper explores the basic questions that need to be resolved to develop compilers for the support of multiple source languages and targets analyses and compares their architectures and key retargetable cross compilation techniques, summarizes the merits and shortcomings, respectively, and draws a conclusion that the Zephyr infrastructure has the advantage over GCC to an extent.
Program logic without binding is decidable
Authors: V. R. Pratt
Venue: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1981)

When the "binding mechanisms" of assignment, quantification, and procedure definition are removed from a conventional first order total correctness logic of programs, the remaining logical system is decidable in time approximately one exponential in the length of the input. This system is maximal in the sense that the presence of any one of the three binding mechanisms would make it undecidable. Such a decision procedure can play a central role in the construction of program verifiers based on decision methods.
Professional SQL Server 7.0 Development Using SQL-DMO, SQL-NS, and Dts
Authors: Frank Miller, Rachelle Reese
Venue:  (1999)

:For system administrators who want an introduction to DMO and programming to enable them to move beyond the constraints of T-SQL, this guide features comprehensive coverage of the hottest topics in SQL Server 7. The book assumes knowledge of typical SQL system administrator.
Cache performance for selected SPEC CPU2000 benchmarks
Authors: Jason F. Cantin, Mark D. Hill
Venue: ACM SIGARCH Computer Architecture News (2001)

The SPEC CPU2000 benchmark suite (http://www.spec.org/osg/cpu2000) is a collection of 26 compute-intensive, non-trivial programs used to evaluate the performance of a computer's CPU, memory system, and compilers. The benchmarks in this suite were chosen to represent real-world applications, and thus exhibit a wide range of runtime behaviors. On this webpage, we present functional cache miss ratios and related statistics for selected benchmarks in the SPEC CPU2000 suite. In particular, split L1 cache sizes ranging from 4KB to 1MB with 64B blocks and associativities of 1, 2, 4, 8 and full. Most of this data was collected at the University of Wisconsin-Madison with the aid of the Simplescalar toolset (http://www.simplescalar.org).
Little machines: understanding users understanding interfaces
Authors: Johndan Johnson-Eilola
Venue: ACM Journal of Computer Documentation (JCD) (2001)

This paper questions the ubiquitous practice of supplying minimalist information to users, of making that information functional only, of assuming that the Shannon-Weaver communication model should govern online systems, and of ignoring the social implications of such a stance. Help systems that provide fast, temporary solutions without providing any background information lead to the danger of users completing tasks that they do not understand at all. (Word will help us write a legal pleading, even if we have no idea what one is.) As a result, we have help systems that attempt to be invisible and to provide tool instruction but not conceptual instruction. Such a system presents itself as a neutral tool, but it is actually an incomplete environment, denying both the complexity and alternative (and possibly improved) modes of thinking about the subject at hand.
NT Server 4 in the Enterprise Study Guide, 3rd edition
Authors: Lisa Donald, James Chellis
Venue:  (1999)

:Discover the powerful enterprise networking capabilities of NT Server as you prepare for the Implementing and Supporting Microsoft NT Server 4 in the Enterprise exam -- a core requirement for the MCSE certification. This new and expanded second edition of the best-selling Microsoft Certified Professional Approved Study Guide covers every objective for the exam, from installation and configuration to administration. Hands-on examples help you learn; a sample testing program, supplied on the companion CD, provides practice for the actual exam.
Taylor models in deterministic global optimization
Authors: R. Baker Kearfott, Alvard Arazyan
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

Deterministic global optimization requires a global search with rejection of subregions. To reject a subregion, bounds on the range of the constraints and objective function can be used. Although often effective, simple interval arithmetic sometimes gives impractically large bounds on the ranges. However, Taylor models aa developed by Berz et al. may be effective in this context. Efficient incorporation of such models in a general global optimization package is a significant project. Here, we use the system COSY Infinity by Berz et al. to study the bounds on the range of various order Taylor models for certain difficult test problems we have previously encountered. Based on that, we conclude that Taylor models may be useful for some, but not all, problems in verified global optimization. Forthcoming improvements in the COSY Infinity interface will help us reach stronger conclusions.
CorelDRAW 9: The Official Guide, 1st edition
Authors: Foster D. Coburn,  III, Peter McCormick
Venue:  (1999)

:Written by Corel-certified instructors and best-selling authors Foster D. Coburn III and Peter McCormick, CorelDRAW 9: The Official Guide gives you in-depth coverage of the product and shows you how to take full advantage of version 9's new and improved features. Plus, you'll get 16 pages of full-color CorelDRAW-generated images to spark your imagination, as well as valuable software and utilities on the book's CD to help you take advantage of CorelDRAW's features!.
A faster off-line algorithm for the TCP acknowledgement problem
Authors: John Noga, Steve Seiden, Gerhard J. Woeginger
Venue: Information Processing Letters (2002)

In a recent paper [Proceedings of STOC'98, 1998, pp. 389-398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n2) off-line algorithm for computing the optimal way of acknowledging n packet arrivals and departures.In this brief note, we observe that there is a faster off-line algorithm for this problem with time complexity O(n).
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
Authors: Yaagoub A. Ashir, Iain A. Stewart
Venue: SIAM Journal on Discrete Mathematics (2002)

We consider the fault-tolerant capabilities of networks of processors whose underlying topology is that of the k-ary n-cube $Q_n^k$, where $k\geq 3$ and $n\geq 2$. In particular, given a copy of $Q_n^k$ where some of the interprocessor links may be faulty but where every processor is incident with at least two healthy links, we show that if the number of faults is at most 4n-5, then $Q_n^k$ still contains a Hamiltonian circuit, but that there are situations where the number of faults is 4n-4 (and every processor is incident with at least two healthy links) and no Hamiltonian circuit exists. We also remark that given a faulty $Q_n^k$, the problem of deciding whether there exists a Hamiltonian circuit is NP-complete.
Integrated Management Systems: A Practical Approach to Transforming Organizations
Authors: Thomas H. Lee, Robert C. Wood, Shoji Shiba
Venue:  (1999)

:Based on a profoundly important six-year study by the Center for the Quality of Management (CQM), "Integrated Management Systems" shows how successful organizations accomplish something unbelievably powerful: Creating their own particular ways of executing the scientific method. The authors worked with the cooperation of some of America's largest companies - Teradyne, Hewlett-Packard, Eastman Chemical, Ritz-Carlton -- and of non-profit organizations including top hospitals and the U.S. Navy. They were surprised to find how radically successful systems differed from one organization to the next. Yet the core of each was universal: Each organization had designed a system that gathered data about the organization's particular problems, developed theories, tested the theories, and finally documented and shared the results throughout the organization. Each successful organization's methods were unique much as the methods of each successful discipline within the sciences are unique. But less successful organizations had nothing comparable. And the processes through which the leaders in these organizations had gotten them on the right path had a great deal in common.