ppxscal/embedding_network huggingface dataset:
Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter
Authors: P. Hayes, E. Sandewall, S. Amarel, A. Biermann, D. W. Loveland, R. Reiter, A. Joshi, D. Lenat, L. Bolc, S. Shafer, Fiora Pirri, A. Mackworth, D. Nau, Y. Shoham
Venue:  (2001)

:This collection of papers is the outcome of the work of a community of researchers in AI who, during the last twenty years, have developed the logical formalisms and methods for characterizing intelligent behaviors of agents, knowledge-based systems and processes in terms of reasoning about the environment, actions, and activities that are capable of changing the current state. The book deals with commonsense reasoning, in particular with Reiter's Default Logic formalism, the theory of actions and reasoning about actions, including formalisms for high-level robot control, and different approaches to knowledge representation, all based on symbolic logic.
Schaum's Outline of Programming with C++, 2 edition
Authors: John R. Hubbard
Venue:  (2000)

Confusing Textbooks? Missed Lectures? Not Enough Time? Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills. This Schaum's Outline gives you Practice problems with full explanations that reinforce knowledge Coverage of the most up-to-date developments in your course field In-depth review of practices and applications Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores! Schaum's Outlines-Problem Solved. Table of contents Chapter 1: Elementary C++ Programming. Chapter 2: Fundamental Types. Chapter 3: Selection. Chapter 4: Iteration. Chapter 5: Functions. Chapter 6: Arrays. Chapter 7: Pointers and References. Chapter 8: C-Strings. Chapter 9: Standard C++ Strings. Chapter 10: Classes. Chapter 11: Overloading Operators. Chapter 12: Composition and Inheritance. Chapter 13: Templates and Iterators. Chapter 14: Standard C++ Vectors. Chapter 15: Container Classes. Appendices: A: Character Codes. B: Standard C++ Keywords. C: Standard C++ Operators. D: Standard C++ Container Classes. E: Standard C++ Generic Algorithms. F: The Standard C Library. G: Hexadecimal Numbers. H: References.
Biaxial bending with axial force of reinforced, composite and repaired concrete sections of arbitrary shape by fiber model and computer graphics
Authors: M. G. Sfakianakis
Venue: Advances in Engineering Software (2002)

A new method is proposed for the study of the failure mechanism of reinforced concrete sections of arbitrary shape in biaxial bending with axial force. The procedure is an alternative fiber model which employs computer graphics as a computational tool for the integration of normal stresses over the section area. In addition to the cases of classic reinforced concrete sections with longitudinal reinforcement steel bars, the method is extended to sections of reinforced concrete structural members repaired by jackets as well as to members with composite steel-concrete sections. Such a computational tool satisfies the needs of nonlinear analysis of reinforced concrete structures as well as the needs of the daily design practice. The method does not include any iterative procedure within its steps and thus it does not have the disadvantage of possible nonconvergence. On the other hand, it is fast and gives accurate results. Four representative numerical applications of the method are presented for the clarification of its validity and advantages.
Resident Evil Director's Cut: Official Strategy Guide
Authors: Prima Development, Anthony James
Venue:  (2000)

:Horror has descended upon Raccoon Forest. Defeat it with complete walkthroughs for the Director's Cut and Resident Evil 2 demo, detailed maps for all versions, and vital secrets and strategies. All the hints and tips you need are here!
NetWare 5 CNA/CNE: Administration and Design Study
Authors: Michael G. Moncur, Reyes, John Hales, James Chellis, John W. Jenkins
Venue:  (1998)

:Here's the book for the Certified Novell Administrator (CNA) for NetWare 5 credential--and for three of the required exams for the Certified Novell Engineer (CNE) for NetWare 5 certification. This study guide provides full coverage of the NetWare 5 Administration, NetWare 5 Advanced Administration, NDS Design and Implementation courses, and is organized by course for ease of use. This book includes review sections and sample test questions, and can also be used by existing CNEs updating their certification to NetWare 5.
Learning styles and performance in the introductory programming sequence
Authors: Lynda Thomas, Mark Ratcliffe, John Woodbury, Emma Jarman
Venue: ACM SIGCSE Bulletin (2002)

This paper reports on the implication of different preferred learning styles on students' performance in the introductory programming sequence and on work in progress on how to accommodate these different styles.Students were given a learning styles preference test and then their preferred learning styles were compared to their performance on the exam and the practical programming part of the introductory programming module. There were significant differences in performance between groups of students.This result could lead one to two possible conclusions. One might be that some students' learning styles are more suited to learning programming than others.An alternative explanation is that our current methods of teaching advantage students with certain learning preference styles. We are at present in the process of testing this second assumption by providing students with a wider range of learning materials. We will then see if student performance is improved by using our current results as a baseline for comparison
A Brief Review of the Development of Qualitative Control Theory in Belarus
Authors: V. M. Marchenko
Venue: Cybernetics and Systems Analysis (2002)

The main stages of the development of the qualitative control and observation theory in Belarus are analyzed. Some fundamental results are presented. Unsolved problems are formulated.
Waite Group's C Programming Using Turbo C++, 2nd edition
Authors: Robert Lafore
Venue:  (1993)

:The updated version of the ultimate introduction to ANSI C programming! Beginners as well as experienced programmers will enjoy this popular format to understanding C programming.Presents updated information to cover the latest version of Turbo C++Provides tips, hints, tricks, and strategiesFeatures end-of-chapter exercises and an extensive reference section
Stability and Regularization of a Discrete Approximation to the Cauchy Problem for Laplace's Equation
Authors: Hans-Jürgen Reinhardt, Houde Han, Dinh Nho Hào
Venue: SIAM Journal on Numerical Analysis (1999)

The standard five-point difference approximation to the Cauchy problem for Laplace's equation satisfies stability estimates---and hence turns out to be a well-posed problem---when a certain boundedness requirement is fulfilled. The estimates are of logarithmic convexity type. Herewith, a regularization method will be proposed and associated error bounds can be derived. Moreover, the error between the given (continuous) Cauchy problem and the difference approximation obtained via a suitable minimization problem can be estimated by a discretization and a regularization term.
Web Tcl Complete
Authors: Steve Ball
Venue:  (1998)

:The only book on Tcl written just for Web professionals, Web Tcl Complete gives you current information and hands-on help in developing and implementing this compact, adaptable language. You get everything you need to develop and implement GUI's for the Net and Web, interface with Java, write server-side and client-side scripting, build Tclet apps to run inside browsers, enable document processing, and link across platforms.
A unified language processing methodology
Authors: Teodor Rus
Venue: Theoretical Computer Science (2002)

This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodology. This concept of a language is regarded as a communication tool that allows language users to develop knowledges, while interacting with their universe of discourse, and to communicate with each other, while exchanging knowledges. Criteria for consistent usage of a language are established using a Galois connection between language syntax and language semantics. Solutions to ambiguity, paraphrase, attitude, and other problems concerning the relationship between syntax and semantics are addressed. A general schema for language specification is introduced and algorithms that perform language generation and language analysis are discussed as universal tools defined by the specification schema. Language transformations performed by various kinds of translators are examined and correctness criteria of these translators are defined using the language Galois connection. The paper is structured as follows: Section1 introduces the framework and justifies the necessity of a unified methodology for language processing. Section2 presents the mathematical concept of a language. Section3 illustrates the mathematical concept of a language with three kinds of language structures: natural language, logical language, and programming language. Section4 discusses the algebraic mechanism of language specification that unifies the methodology for language processing tool development. Section5 formalizes the criterion for the consistency of the language usage, defines the architecture of a unified language processing system, and shows how the consistency criteria for language usage can be employed as correctness criteria for the algorithms performing various language transformations.
CSP, partial automata, and coalgebras
Authors: Uwe Wolter
Venue: Theoretical Computer Science (2002)

The paper presents a first reconstruction of Hoare's theory of CSP in terms of partial automata and related coalgebras. We show that the concepts of processes in Hoare (Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985) are strongly related to the concepts of states for special, namely, final partial automata. Moreover, we show how the deterministic and nondeterministic operations in Hoare (1985) can be interpreted in a compatible way by constructions on the semantical level of automata. Based on this, we are able to interpret finite process expressions as representing finite partial automata with designated initial states. In such a way we provide a new method for solving recursive process equations which is based on the concept of final automata. The coalgebraic reconstruction of CSP allows us to use coinduction as a new proof principle. To make evident the usefulness of this principle we prove some example laws from Hoare (1985).
Distributed algorithmic mechanism design: recent results and future directions
Authors: Joan Feigenbaum, Scott Shenker
Venue: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications (2002)

Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science's traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet's decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems..
Database System Implementation
Authors: Hector Garcia-Molina, Jennifer Widom, Jeffrey D. Ullman
Venue:  (1999)

:Three well-known computer scientists at Stanford University-Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom-have written one of the most comprehensive books on database system implementation. Hector Garcia- Molina pioneered this book at Stanford as a second database systems course for computer science majors and industry-based professionals. It focuses on the implementation of database systems, including storage structures, query processing, and transaction management. Database System Implementation is valuable as an academic textbook or a professional reference. Noteworthy Features Provides extensive coverage of query processing, including major algorithms for execution of queries and techniques for optimizing queries Covers information integration, including warehousing and mediators, OLAP, and data-cube systems Explains error-correction in RAID disks and covers bitmap indexes, data mining, data statistics, and pointer swizzling Supports additional teaching materials found on the book's Web page at ...
MCSE Networking Essentials Exam Cram: Exam 70-058, 3rd edition
Authors: Ed Tittel, James Michael Stewart, Kurt Hudson
Venue:  (2000)

:MCSE Networking Essentials Exam Cram, Third Edition, covers all exam formats for Exam 70-058: Networking Essentials. The Third Edition contains a new 32-page "scenario section," designed to prepare the reader for scenario-based questions on the actual exam. Two completely revised practice exams include questions designed to assess the reader's readiness to take the exam, complete with answers and explanations that reinforce the reasoning behind the correct answers. The Third Edition also includes readers' favorite Exam Cram features: Warnings on trick questions, time-saving study tips, multiple-part question strategies, and shortcuts. Special features include: - A revised and updated Cram Sheet with tips, acronyms, and memory joggers that readers can take to the exam. - Cram Fitness Assessments that give readers a way to determine how to proceed with certification by analyzing their educational and experiential background and their subject knowledge level in order to make suggestions about preparation and study. MCSE Networking Essentials Exam Cram, Third Edition covers: OSI model, network hardware and topology, data transmission and network protocols, network and Internet names, remote access and security, and hardware and protocols used for Wide Area Networks.
Creativity, art practice, and knowledge
Authors: Ernest Edmonds, Linda Candy
Venue: Communications of the ACM (2002)

Achieving a balance of control and freedom by supporting a mix of strategies.
PHP Developer's Cookbook, 3rd edition
Authors: Sterling Hughes
Venue:  (2002)

:Provides a complete, solutions-oriented guide to the challenges most often faced by PHP developers Written specifically for experienced Web developers, the book offers real-world solutions to real-world needs PHP is the major open source alternative to Microsoft's Active Server Pages, and is currently in use on over 1.5 million Web sites The authors are both directly involved with the development of the PHP project
Boundary-Value Problems for Systems of Hamilton--Jacobi--Bellman Inclusions with Constraints
Authors: Jean-Pierre Aubin
Venue: SIAM Journal on Control and Optimization (2002)

We study in this paper boundary-value problems for systems of Hamilton--Jacobi--Bellman first-order partial differential equations and variational inequalities, the solutions of which are constrained to obey viability constraints. They are motivated by some control problems (such as impulse control) and financial mathematics. We shall prove the existence and uniqueness of such solutions in the class of closed set-valued maps by giving a precise meaning to what a solution means in this case. We shall also provide explicit formulas for this problem. When we deal with Hamilton--Jacobi--Bellman equations, we obtain the existence and uniqueness of Frankowska contingent episolutions. We shall deduce these results from the fact that the graph of the solution is the viable-capture basin of the graph of the boundary conditions under an auxiliary system and then from their properties and their characterizations proved in [J.-P. Aubin, SIAM J. Control Optim., 40 (2001), pp. 853--881].
Multimedia Technology for Applications, 1st edition
Authors: Bing J. Sheu, Mohammed Ismail
Venue:  (1998)

:"This single, expertly-written volume brings you in-depth, interdisciplinary coverage of today's state-of-the-art multimedia technology--the combined work of more than 20 leaders in the field. With an emphasis on consumer electronics, the contributing authors to MULTIMEDIA TECHNOLOGY FOR APPLICATIONS present the very latest advances in signal processing, communications and networking, computer databases, and circuits and systems as they relate to multimedia technology and applications. Topics covered include: multimedia systems; standards, and trends; submicro electronic enabling technologies; digital library servers; networking; multimedia signal processing and applications.MULTIMEDIA TECHNOLOGY FOR APPLICATIONS is thoughtfully structured and complete with numerous figures and examples, making it of key interest to advanced student engineers and managers in industry, as well as professional engineers in need of a current, practical resource."Sponsored by:IEEE Circuits and Systems Society, IEEE Solid-State Circuits Council/Society.
Closing the Deal: Negotion Strategies for Real Estate Success
Authors: Leigh Ronald Grossman, Edward C. Farthing
Venue:  (2001)

:Expert negotiators share their secrets on how to maximize both sales and commission by combining traditional sales strategies with today's technology. In this volume, author Leigh Grossman has interviewed agents and brokers from around the country, resulting in a compilation of the best methods for real estate sales success in this volume. Together, these top producers offer time-tested advice to new and veteran agents alike.
Pick Matrix Conditions for Sign-Definite Solutions of the Algebraic Riccati Equation
Authors: H. L. Trentelman, P. Rapisarda
Venue: SIAM Journal on Control and Optimization (2001)

We study the existence of positive and negative semidefinite solutions of algebraic Riccati equations (ARE) corresponding to linear quadratic problems with an indefinite cost functional. The formulation of reasonable necessary and sufficient conditions for the existence of such solutions is a long-standing open problem. A central role is played by certain two-variable polynomial matrices associated with the ARE. Our main result characterizes all unmixed solutions of the ARE in terms of the Pick matrices associated with these two-variable polynomial matrices. As a corollary of this result, we find that the signatures of the extremal solutions of the ARE are determined by the signatures of particular Pick matrices.
Web Cams for Dummies
Authors: Wallace Wang, Wally Wang, Bill Karow
Venue:  (2001)

:Web Cams for Dummies provides a detailed look at these hot gadgets! Veteran Dummies author Wally Wang gives users a complete overview of their web cam, including: setting up your web cam, selecting a webcam (for those users buying one after their system purchase), picking and using the software and in-depth coverage of the utility of this great visual tool!
Dynamically Selecting Optimal Distribution Strategies for Web Documents
Authors: Guillaume Pierre, Maarten van Steen, Andrew S. Tannenbaum
Venue: IEEE Transactions on Computers (2002)

To improve the scalability of the Web, it is common practice to apply caching and replication techniques. Numerous strategies for placing and maintaining multiple copies of Web documents at several sites have been proposed. These approaches essentially apply a global strategy by which a single family of protocols is used to choose replication sites and keep copies mutually consistent. We propose a more flexible approach by allowing each distributed document to have its own associated strategy. We propose a method for assigning an optimal strategy to each document separately and prove that it generates a family of optimal results. Using trace-based simulations, we show that optimal assignments clearly outperform any global strategy. We have designed an architecture for supporting documents that can dynamically select their optimal strategy and evaluate its feasibility.
Build Your Own Combat Robot
Authors: Pete Miles, Tom Carroll
Venue:  (2002)

:Experience the excitement of building your own champion battling bot! Build a powerful and invincible robot-for full-blown competition or just for fun-using this authoritative robot resource. This team of experts gives you an inside look at the innovative new world of robotic combat, explaining the origins of the sport as well as all the elements that go into constructing a fighting robot. You'll learn technical basics from motors and wiring to locomotion, and read builders' true stories from the front lines of robot competition. Whether or not you're mechanically-minded, you'll find this book both entertaining and informative. Fully capturing the spirit of the sport, this detailed guide shows you how an imagination and a few bits of metal can start you on your way to constructing your own champion bot. Plan, design, and build your own battling robot Discover how electric motors work and choose the right type for your design Learn about both wheeled and walking robots Incorporate creative weapons and armor on your bot-learn the pros and cons of spinning hammers, jabbing spikes, buzzing saw blades, and more Minimize radio interference-so you can effectively control your bot to do what you want, when you want Understand what goes into building fully autonomous robots Save money on parts and equipment by enlisting help from company sponsors Read true stories from combat roboteers and learn which types of constructions work and which don't
Distributed Applications Engineering: Building New Applications and Managing Legacy Applications with Distributed Technologies, 1st edition
Authors: Inji Wijegunaratne, George Fernandez
Venue:  (1999)

:There is a need to tailor principles of software architecture and design to suit today's demands, and this book sets out to achieve just that. Focusing on the principles of good application design using client/server and distributed computing technologies, Inji Wijegunaratne and George Fernandez demonstrate principles and techniques not only for designing GUI client/server applications, but also to manage complex application environments containing both legacy and new applications. If you are a systems architect, a project manager, or a software engineer involved with or interested in client/server computing then you will find this book invaluable as indeed will all practitioners working in distributed applications engineering.
Animation of Java linked lists
Authors: Herbert L. Dershem, Ryan L. McFall, Ngozi Uti
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Linked lists are an important component of the computer science curriculum. JVALL is a software package that provides an animation of linked list operations that is fully compatible with the Java LinkedList class. The animations are driven by a client program that can be either an applet or standalone application. It provides an effective way for students to learn, experiment with, and debug linked list based classes.