ppxscal/embedding_network huggingface dataset:
Proof in VDM: Case Studies, 1st edition
Authors: Sten Agerholm, Juan C. Bicarregui
Venue:  (1998)

:This volume provides a much-needed collection of realistic case studies, illustrating different aspects of the use of proof in formal development, it provides a companion volume to Proof in VDM: A Practitioner's Guide, which considers practical aspects of using and constructing proofs in software development. As well as presenting case studies in nuclear process tracking, explosives storage, security policy validation, compiler correctness, shared memory modelling and inter-processor communications, this volume also examines how proofs in VDM can be constructed via instantiations of the PVS and Isabelle theorem provers. Proof in VDM: Case Studies provides important reference material for practitioners of formal methods who need to construct proofs, students requiring a detailed introduction to the practicalities of proof, and researchers interested in tool support for theorem providing in formal development.
Cyberflirt: How to Attract Anyone, Anywhere on the World Wide Web
Authors: Susan Rabin, Barbara Lagowski
Venue:  (1999)

:Susan Rabin has flirted her way around the world, helping thousands of singles meet new people anywhere and everywhere. Now she turns her flirting savvy to cyberspace to help people pair off on-line. In Cyberflirt Rabin shares her picks of the best websites to meet people and counsels readers on how to find chat rooms in which they'll feel comfortable. With her inimitable style, she helps "newbies" to develop a sparkling on-line personality and provides sure-fire on-line conversation starters. Cyberflirt is also an indispensable guide on how to avoid the pitfalls of on-line romance, like kiss & tell flirts or imposters, and on safe ways to get to know an on-line pal better. Cyberflirt sets out all the rules of "netiquette" and promises to make the World Wide Web a much more up-close and personal place.
Alternative Solution for a Robotic Stereotactic System
Authors: V. Modrák, J. Paško, S. Pavlenko
Venue: Journal of Intelligent and Robotic Systems (2002)

The development of robotic technology applications in the stereotactic neurosurgical method has reached the stage of high acceptation, which is the driving force for searching for other solutions. The article describes an alternative robotic system solution for stereotaxis and compares it with other known solutions. It is characterised by a minimal number of the controlled robot axes, while preserving required articulation possibilities. Since it is a non-traditional robotic architecture, the article outlines its kinematic analysis with the specification of transformation matrices for an inversion problem. At the same time, outputs from the robot computer animation, which is an indispensable aid in the development of kinematic mechanisms, are presented.
Data Analysis and Decision Making with Microsoft Excel
Authors: S. Christian Albright, Wayne L. Winston, Christopher Zappe
Venue:  (2001)

:In response to the growing market trend in quantitative education, Albright, Winston, and Zappe's integrated business-statistics and management-science text presents core statistics and management-science methods in a modern, unified spreadsheet-oriented approach.With a focus on applications, not on mathematical techniques, the book covers business statistics with some essential management-science topics included. The example-based, Excel spreadsheet approach is useful in courses that combine traditional statistics and management-science topics, though it can be easily used for a one-term business statistics only course. The modeling and application focus, together with the Excel spreadsheet add-ins, provides a complete learning source for both students and practicing managers.
Using Information Technology Brief, 3rd edition
Authors: Stacey C. Sawyer, Brian K. Williams, Sarah E. Hutchinson
Venue:  (1998)

:UIT Brief, 3/E is a condensed version of the full book that continues to provide a complete representation of the key concepts introduced in the full version. UIT Brief, 3/E will retain the key strengths of the second brief edition, while decreasing the length, adding a separate Internet chapter, refining the hands-on Internet exercises, and implementing a coherent Web strategy.
PC User's Guide for the as-400, 1st edition
Authors: Bradley Dyck Kliewer, Henry W. Kliewer
Venue:  (1993)

:Come up to speed quickly on the AS/400 by utilizing your PC skills and techniques. Bradley and Henry Kliewer show you how in the PC User's Guide to the AS/400. By comparing and contrasting the differences and similarities between the PC platform and the AS/400, IBM's powerful mid-range solution, they give you the knowledge to master the rudiments of AS/400 operation, using tools you already possess: your familiarity with your own PC. With only that background, you will have a system up and running in no time that provides your organization with the computing power of a mainframe at a more reasonable cost. Designed for system administrators, system operators, security administrators, programmers, and knowledgeable end-users, the PC User's Guide to the AS/400 covers the major tasks involved in system administration, operation, and configuration of the AS/400 in an accessible, practical manner, using the PC platform as a basis for comparison. In addition, you will learn how to: handle connectivity for the AS/400 and create a LAN environment with PC Support, design and manage files and database systems on the AS/400, use the concepts of work management and resource allocation to regulate work flow and best harness system resources, and employ object-oriented techniques and client/server technology to exploit the full potential of the AS/400. Filled with practical examples and copious amounts of coding, the PC User's Guide to the AS/400 shows you how to implement and manage a basic AS/400 system that will provide your organization with a reliable, secure, mid-range environment with the functionality and processing power of a mainframe and the convenience of a PC.
Resource traces: a domain for processes sharing exclusive resources
Authors: Paul Gastin, Dan Teodosiu
Venue: Theoretical Computer Science (2002)

The domain of partially terminated finite and infinite words is commonly used to give denotational semantics for process algebras such as CSP. In this well-known framework the denotational semantics of concurrency is derived via power-domains from that of non-deterministic choice and interleaving to the effect that the denotational semantics of a concurrent process is equal to the set of all its possible finite and infinite sequential behaviours. In this paper, we define a more versatile domain of the so-called finite and infinite resource traces which allows to capture the concurrent behaviour of a process and encode the static concurrency of a system directly into the domains definition. The approach we present refines the previous work of Diekert and Gastin (Lecture Notes in Computer Science, vol. 944, Springer, Berlin, pp. 15-26) on - and -traces. We start with an alphabet of atomic actions, a set of resources, and a resource map assigning to each action the non-empty subset of resources it uses. Actions that do not share common resources are called independent and considered to be able to execute concurrently. A partially terminated concurrent process is specified by a resource trace which consists of two components: an already observed part represented as an action-labeled partial order (Mazurkiewicz trace), and a guard set containing the resources granted to the process for its further development. A process concatenation is then defined, which allows independent actions to execute concurrently. Specification refinement leads to a natural approximation ordering between processes. It confers to the set of all processes the structure of a coherently complete prime algebraic Scott domain, whereby, process concatenation is Scott-continuous in both arguments. Furthermore, we define a natural ultrametric on processes based on prefix information. The induced topology is shown to be equivalent to the compact Lawson topology induced by the approximation ordering. Process concatenation is moreover shown to be uniformly continuous with respect to the defined ultrametric. The mathematical theory we develop thus extends the central order and metric properties of the domain of partially terminated finite and infinite words which are needed in order to devise truly concurrent semantics for process algebras much in the style of classical CSP semantics.
Test Solutions for Digital Networks: Basic Principles and Measurement Techniques for Pdh, Sdh, ISDN and ATM, 1st edition
Authors: Roland Kiefer
Venue:  (1998)

:New Telecommunications methods and the liberation of the telecom markets have meant that network providers, city carriers and systems manufacturers are faced with new challenges and problems. This book is intended as a source of practical help and advice and as a reference work on the subject of test solutions for digital networks. The practical introduction to the basic principles of PDH, SDH, ISDN and ATM is helpful for getting acquainted with the material.
Performance Optimization Problem in Speculative Prefetching
Authors: Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Sajal K. Das
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modeling. We analyze the performance of a prefetcher that has uncertain knowledge about future accesses. Our performance metric is the improvement in access time, for which we derive a formula in terms of resource parameters (time available and time required for prefetching) and speculative parameters (probabilities for next access). We develop a prefetch algorithm to maximize the improvement in access time. The algorithm is based on finding the best solution to a stretch knapsack problem, using theoretically proven apparatus to reduce the search space. An integration between speculative prefetching and caching is also investigated.
Oracle and Open Source
Authors: Andy Duncan, Sean Hull
Venue:  (2001)

:Oracle & Open Source is the first book to tie together the commercial world of Oracle and the free-wheeling world of open source software. As this book reveals, these two worlds are not as far apart as they may seem. Today, there are many excellent and freely available software tools that Oracle developers and database administrators can use, at no cost, to improve their own coding productivity and their system's performance. Moreover, many of the finest Oracle developers are now making their source code freely available so their peers can build upon this code base. Oracle Corporation is even porting its RDBMS to Linux and starting to incorporate a growing number of open source tools in the company's own software. Oracle & Open Source describes close to 100 open source tools you can use for Oracle development and database administration, from large and widely known open source systems (like Linux, Perl, Apache, TCL/Tk and Python) to more Oracle-specific tools (like Orasoft, Orac, OracleTool, and OraSnap). You'll learn how to obtain the software and how to adapt it to best advantage. The book abounds with code examples, download and installation instructions, and helpful usage hints. Not only does it tell you how to find and use existing open source code; Oracle & Open Source gives you the details and the motivation to build your own open source contributions and release them to the Oracle community. You'll learn all about tools like the Oracle Call Interface (OCI) and Perl-DBI (Database Interface), which provide the glue allowing new open source tools to link into commercial Oracle software. With Oracle & OpenSource as a guide, you'll discover an enormous number of highly effective open source tools, while getting involved with the thriving community of open source development.
Variants of the Greville Formula with Applications to Exact Recursive Least Squares
Authors: Jie Zhou, Yunmin Zhu, X. Rong Li, Zhisheng You
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

In this paper, we present an order-recursive formula for the pseudoinverse of a matrix. It is a variant of the well-known Greville [SIAM Rev., 2 (1960), pp. 578--619] formula. Three forms of the proposed formula are presented for three different matrix structures. Compared with the original Greville formula, the proposed formulas have certain merits. For example, they reduce the storage requirements at each recursion by almost half; they are more convenient for deriving recursive solutions for optimization problems involving pseudoinverses.Regarding applications, using the new formulas, we derive recursive least squares (RLS) procedures which coincide exactly with the batch LS solutions to the problems of the unconstrained LS, weighted LS, and LS with linear equality constraints, respectively, including their simple and exact initializations. Compared with previous results, e.g., Albert and Sittler [J. Soc. Indust. Appl. Math. Ser. A Control, 3 (1965), pp. 384--417], our derivation of the explicit recursive formulas is much easier, and the recursions take a much simpler form. New findings include that the linear equality constrained LS and the unconstrained LS can have an identical recursion---their only difference is the initial conditions. In addition, some robustness issues, in particular, during the exact initialization of the RLS are studied.
Motion texture: a two-level statistical model for character motion synthesis
Authors: Yan Li, Tianshu Wang, Heung-Yeung Shum
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

In this paper, we describe a novel technique, called motion texture, for synthesizing complex human-figure motion (e.g., dancing) that is statistically similar to the original motion captured data. We define motion texture as a set of motion textons and their distribution, which characterize the stochastic and dynamic nature of the captured motion. Specifically, a motion texton is modeled by a linear dynamic system (LDS) while the texton distribution is represented by a transition matrix indicating how likely each texton is switched to another. We have designed a maximum likelihood algorithm to learn the motion textons and their relationship from the captured dance motion. The learnt motion texture can then be used to generate new animations automatically and/or edit animation sequences interactively. Most interestingly, motion texture can be manipulated at different levels, either by changing the fine details of a specific motion at the texton level or by designing a new choreography at the distribution level. Our approach is demonstrated by many synthesized sequences of visually compelling dance motion.
MCSE Windows 2000 Server Study Guide with Cdrom
Authors: Lisa Donald, James Chellis
Venue:  (2000)

:Here's the book you need to prepare for Exam 70-215, Installing, Configuring, and Administering Microsoft Windows 2000 Server. This Microsoft Certified Professional Approved Study Guide provides: In-depth coverage of every exam objectiveall the information you need to know Practical information on installing and maintaining Windows 2000 Server in a real-world environment Hundreds of challenging review questions, in the book and on the CD Leading-edge exam preparation software, including a testing engine and electronic flashcards Authoritative coverage of all exam objectives, including: Installing Windows 2000 Server Installing, configuring, and troubleshooting access to resources Configuring and troubleshooting hardware devices and drivers Managing, monitoring, and optimizing system performance, reliability, and availability Managing, configuring, and troubleshooting storage use Configuring and troubleshooting Windows 2000 network connections Implementing, monitoring, and troubleshooting security Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the Windows 2000 Server Exam. Loaded with hundreds of practice questions, you can test yourself chapter by chapter or according to objectives areas. It includes two bonus sample exams! You'll also find electronic flashcards for your PC and Palm devices that will help you further prepare for the test. Also included are WinSim 2000 product simulation software and two complete electronic books: MCSE: Windows 2000 Server Study Guide and The Dictionary of Networking.
Robust Controller Synthesis for Uncertain Time-Varying Systems
Authors: Carol Pirie, Geir E. Dullerud
Venue: SIAM Journal on Control and Optimization (2001)

In this paper we develop and present new convex synthesis conditions for robust performance in linear time-varying systems, subject to time-varying perturbations. In particular, these results are exact for sensitivity minimization in the presence of multiplicative perturbations. The methods apply to a number of additional robust performance problems and are always both necessary and sufficient when the system plant is periodic. Otherwise, the conditions provided are always sufficient, and a controller can be directly constructed when this condition holds.
The software engineering capstone: structure and tradeoffs
Authors: A. T. Chamillard, Kim A. Braun
Venue: ACM SIGCSE Bulletin (2002)

One of the largest challenges facing educators teaching undergraduate software engineering courses is providing the students with meaningful experiences they will find useful when they complete their undergraduate education. Those experiences should include all phases of the software development process, and to be as realistic as possible they should also include the uncertainty and continual change present in any real project. In addition, those experiences need to include working with others in a team, which can affect the morale of some students and also poses challenges to the professor when the time to assign grades arrives. In this paper we discuss how we have tailored the software engineering capstone sequence at the U.S. Air Force Academy to address these issues.
Markov Modeling for Reliability Analysis, 1st edition
Authors: Paul Pukite, Jan Pukite
Venue:  (1998)

:"Markov modeling has long been accepted as a fundamental and powerful technique for the fault tolerance analysis of mission-critical applications. However, the elaborate computations required have often made Markov modeling too time-consuming to be of practical use on these complex systems. With this hands-on tool, designers can use the Markov modeling technique to analyze safety, reliability, maintainability, and cost-effectiveness factors in the full range of complex systems in use today.Featuring ground-breaking simulation software and a comprehensive reference manual, MARKOV MODELING FOR RELIABILITY ANALYSIS helps system designers surmount the mathematical computations that have previously prevented effective reliability analysis. The text and software compose a valuable self-study tool that is complete with detailed explanations, examples, and a library of Markov models that can be used for experiments and as derivations for new simulation models. The book details how these analyses are conducted, while providing hands-on instruction on how to develop reliability models for the full range of system configurations.Computer-Aided Rate Modeling and Simulation (CARMS) software is an integrated modeling tool that includes a diagram-based environment for model setup, a spreadsheet like interface for data entry, an expert system link for automatic model construction, and an interactive graphic interface for displaying simulation results."
Computer Fun Science
Authors: Lisa Trumbauer
Venue:  (1999)

:Record the growth of plants, just like a scientist; prepare a balanced menu, just like a nutritionist; renew "worn-out" earth, just like an ecologist. Find out how to come up with your own formulas for science fun on the computer.
Turok 2: Seeds of Evil Official Strategy Guide
Authors: Brady Games, Games Brady
Venue:  (1998)

:This new game has some influences drawn from Mario and Zelda. As the game progresses, players will need this guide to achieve multiple objectives and complete their mission.
Reliability, Yield, and Stress Burn-in: A Unified Approach for Microelectronics Systems Manufacturing and Software Development
Authors: Way Kuo, Taeho Kim, Wei-Ting Kary Chien
Venue:  (1998)

:Reliability, Yield, and Stress Burn-In explains reliability issues in Microelectronics Systems Manufacturing and Software Development with an emphasis on evolving manufacturing technology for the semiconductor industry. Since most microelectronics components have their infant mortality period for about one year under the ordinary operating conditions, and many of the modern systems, such as the PC's, are heavily used in the first few years, the reliability problem at the infant mortality period becomes extremely important. Burn-in is an accelerated screening procedure that eliminates early on the infant mortalities in the shop before shipping out the products to the customers. This book will also help readers to analyze systems that exhibit high failure rate during a long infant mortality period. Reliability, Yield, and Stress Burn-In presents ways to systematically analyze burn-in policy at that component, sub-system, and system levels. Various statistical methods are addressed including parametric, nonparametric, and Bayesian approaches. Many case studies are introduced in combination with the developed theories. Included in the book is an introduction to software reliability.
Reconsidering custom memory allocation
Authors: Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight applications that use custom allocators. Surprisingly, for six of these applications, a state-of-the-art general-purpose allocator (the Lea allocator) performs as well as or better than the custom allocators. The two exceptions use regions, which deliver higher performance (improvements of up to 44%). Regions also reduce programmer burden and eliminate a source of memory leaks. However, we show that the inability of programmers to free individual objects within regions can lead to a substantial increase in memory consumption. Worse, this limitation precludes the use of regions for common programming idioms, reducing their usefulness.We present a generalization of general-purpose and region-based allocators that we call reaps. Reaps are a combination of regions and heaps, providing a full range of region semantics with the addition of individual object deletion. We show that our implementation of reaps provides high performance, outperforming other allocators with region-like semantics. We then use a case study to demonstrate the space advantages and software engineering benefits of reaps in practice. Our results indicate that programmers needing fast regions should use reaps, and that most programmers considering custom allocators should instead use the Lea allocator.
Castlevania: Symphony of the Night, Survival Guide
Authors: J. Douglas Arnold, Mark Elies
Venue:  (1997)

:Written by the bestselling coauthors of "PlayStation Player's Guide 1 & 2, Super Mario 64 Survival Guide", and "Star Fox 64 Survival Guide", this essential guide to "Castlevania" offers a complete walkthrough of the quest, from start to finish, combat tips and strategies, maps for all difficult areas of the game, and over 500 captioned pictures to illustrate the best strategies and secrets.