ppxscal/embedding_network huggingface dataset:
Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
Authors: Xiaojun Chen, Zuhair Nashed, Liqun Qi
Venue: SIAM Journal on Numerical Analysis (2000)

We consider superlinearly convergent analogues of Newton methods for nondifferentiable operator equations in function spaces. The superlinear convergence analysis of semismooth methods for nondifferentiable equations described by a locally Lipschitzian operator in Rn is based on Rademacher's theorem which does not hold in function spaces. We introduce a concept of slant differentiability and use it to study superlinear convergence of smoothing methods and semismooth methods in a unified framework. We show that a function is slantly differentiable at a point if and only if it is Lipschitz continuous at that point. An application to the Dirichlet problems for a simple class of nonsmooth elliptic partial differential equations is discussed.
A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP
Authors: Roger Fletcher
Venue: SIAM Journal on Optimization (1998)

A new recursive method for resolving degeneracy in simplex-like methods for linear programming (LP) is described. The method provides a guarantee of termination, even in the presence of round-off errors, and is readily implemented. In contrast to a previous method of the author, this method works throughout in the primal space. One consequence is that the steepest-edge criterion can be used on all iterations and at all levels of recursion.It is also shown that the associated steepest-edge coefficients provide information from which the expected condition of the current LP basis can be calculated cheaply. This provides a more accurate indication of the actual condition of a system than is obtained from norm-based condition numbers. This idea also enables the condition of null space matrices to be estimated.
Interactive Computing Series: Microsoft Windows 98 Brief Edition, 2nd edition
Authors: Kenneth Laudon, Kenneth Rosenblatt
Venue:  (1999)

:Inexpensive,"offline" study option that can be used with the corresponding interactive CD-ROM or independently. All of the topics covered on the CD-ROM are also reinforced in the text.
Serious Ado: Universal Data Access with Visual Basic
Authors: Rob MacDonald
Venue:  (2000)

:- Helps developers gain firm control of Microsoft's premier data access technology with comprehensive explanations and real code examples - Provides detailed treatment of important topics including client cursors, disconnected Recordsets, Data Shaping, Recordset persistence and marshalling, and MTS/COM+ - Accompanying CD-ROM contains VB programs to compliment each chapter ADO is Microsoft's data access technology for application developers and Visual Basic is the programming language now at the heart of many application and Web servers. In this new book, Rob Macdonald offers developers comprehensive coverage of both ADO and VB and practical development wisdom to increase productivity. After examining ADO and key concepts in ADO programming, the author tackles use of ADO in real world development situations including Internet and data mining scenarios. Macdonald also covers the use of Microsoft Transaction Server (MTS) and COM+ to create transactional component based systems, and how to use ADO to write components that really benefit from MTS and COM+. Author Biography: Rob Macdonald is an independent software expert who specializes in enterprise system design and data access using Windows, COM+, ADO and MTS. After nine years running a thriving software development company, he now works directly with developers as a designer, mentor and trainer. He lives in southern England.
Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects, 2nd edition
Authors: Douglas C. Schmidt, Hans Rohnert, Michael Stal, Dieter Schultz
Venue:  (2000)

:Designing application and middleware software to run in concurrent and networked environments is a significant challenge to software developers. The patterns catalogued in this second volume of Pattern-Oriented Software Architectures (POSA) form the basis of a pattern language that addresses issues associated with concurrency and networking.The book presents 17 interrelated patterns ranging from idioms through architectural designs. They cover core elements of building concurrent and network systems: service access and configuration, event handling, synchronization,and concurrency. All patterns present extensive examples and known uses in multiple programming languages, including C++, C, and Java.The book can be used to tackle specific software development problems or read from cover to cover to provide a fundamental understanding of the best practices for constructing concurrent and networked applications and middleware.About the AuthorsThis book has been written by the award winning team responsible for the first POSA volume "A System of Patterns", joined in this volume by Douglas C. Schmidt from University of California, Irvine (UCI), USA.Visit our Web Page
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Authors: Joseph Cheriyan, Ramakrishna Thurimella
Venue: SIAM Journal on Computing (2000)

An efficient heuristic is presented for the problem of finding a minimum-size k-connected spanning subgraph of an (undirected or directed) simple graph G=(V,E). There are four versions of the problem, and the approximation guarantees are as follows:minimum-size k-node connected spanning subgraph of an undirected graph 1 + [1/k], minimum-size k-node connected spanning subgraph of a directed graph 1 + [1/k], minimum-size k-edge connected spanning subgraph of an undirected graph 1+[2/(k+1)], minimum-size k-edge connected spanning subgraph of a directed graph 1 + [4/\sqrt{k}]. The heuristic is based on a subroutine for the degree-constrained subgraph (b-matching) problem. It is simple and deterministic and runs in time O(k|E|2).The following result on simple undirected graphs is used in the analysis: The number of edges required for augmenting a graph of minimum degree k to be k-edge connected is at most k,|V|/(k+1).For undirected graphs and k=2, a (deterministic) parallel NC version of the heuristic finds a 2-node connected (or 2-edge connected) spanning subgraph whose size is within a factor of ($1.5+\epsilon$) of minimum, where $\epsilon>0$ is a constant.
AutoCAD Release 14 CD-ROM Encyclopedia
Authors: David Cohn
Venue:  (1998)

:AutoCAD Release 14 CD-ROM Encyclopedia is a comprehensive reference companion to AutoCAD Release 14 for all AutoCAD users. Beginners get step-by-step instructions for every command, feature, and system variable. Power users quickly learn about the new features included in Release 14. Overview, detailed procedures, complete examples, warnings, techniques, and tips are included for over 650 AutoCAD features. Over 1,000 detailed figures and drawings demonstrate specific AutoCAD features. AutoCAD Release 14 CD-ROM Encyclopedia is convenient to use - either side-by-side with AutoCAD or by itself. Well organized for easy access, with a unique search mechanism and hyperlinked cross-references. Overview provides a description of what each command does, in simple terms. Procedure gives step-by-step directions on the most effective use of the feature or command. Examples show practical uses for each command or feature. Warnings point out where you are most likely to encounter problems. Tips promote rapid advancement in skills by taking advantage of the author's broad base of AutoCAD experience. Appropriate cross-references to other entries are also included.
Absolute Beginner's Guide to Creating Web Pages
Authors: Todd Stauffer
Venue:  (2002)

Learn to create Web pages and Web sites using the latest HTML standards with this book's friendly, professional approach. Without relying on technical jargon, Absolute Beginner's Guide to Creating Web Pages serves as a hands-on tutorial for the novice. It begins by explaining the need for HTML and the basics of good Web page design. It then covers using HTML tags and tools, formatting text, adding images and building links. Later chapters demonstrate how to add features to Web pages including tables, colors, frames, multimedia content, JavaScript, Style Sheets and Dynamic HTML. The book finishes with a useful HTML command reference readers can flip to quickly while creating Web pages.
Cisco Networking Academy Program, 2nd edition
Authors: Cisco Networking Academy Program
Venue:  (2001)

:The Only Authorized Journal and Workbook for the Cisco Networking Academy Program. Cisco-approved study materials for the Networking Academies courseWritten by the course developer!Maps to online curriculum versionIncreased integration across print products for more effective learning resourceIncludes exercise that will complement each chapter of the First Year Companion, Second Edition and each module of the online curriculum.Includes CCNA review material keyed to the curriculum and the CCNA Exam objectives.Cisco Networking Academy Program: Engineering Journal and Workbook, Volume I, Second Edition has been strongly integrated with the Cisco Networking Academy Program: First-Year Companion Guide, Second Edition, the Cisco Networking Academy Program: Lab Companion, Volume I, Second Edition, and the online curriculum.This book tracks to Semesters 1 and 2, Version 2.1 of the online curriculum and includes a chapter on the Engineering Journal and how to establish a habit of documenting your work. It provides study aids for each chapter, including a detailed chapter introduction and objectives, complete with a writing opportunity for each objective. High-level thought process questions called Focus Questions provide you with the opportunity to express what you have learned in writing. Each chapter also includes review questions to prepare you for the CCNA exam.
On the injectivity of the Parikh matrix mapping
Authors: Adrian Atanasiu, Carlos Mart&#x00ED;n-Vide Alexandru Mateescu
Venue: Fundamenta Informaticae (2002)

In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as "palindromic amiable", such that two such words are palindromic amiable if and only if they have the same image by the Parikh matrix mapping. Some other related problems are discussed, too.
Computers: Tools for an Information Age, 7th edition
Authors: H. L. Capron, J. A. Johnson
Venue:  (2001)

:The new edition of this bestselling computer concepts book focuses on the explosive growth of the Internet. Many topics have been updated or added, including web page design, ethics, Office 97, and push technology. Includes Capron's Pocket Internet, a resource manual with fun and interesting websites organized by category.
Adaptive Antennas for Wireless Communications
Authors: George V. Tsoulos
Venue:  (2000)

:In the past decade, the wireless communications community recognized adaptive antennas as a core technology that would help existing systems overcome problems related to spectrum efficiency and provide a vehicle to achieve the ambitious requirements of next-generation networks. The communications industry has already begun to develop adaptive antenna systems for commercial use and at the same time is working with standardization institutes around the world to produce adaptive antenna-friendly standards. Adaptive Antennas for Wireless Communications is a concise, detailed resource of information for all critical issues related to this technology and is compiled from the original published work of experts in the field. The extensive literature covers: Historical and background aspects Radio channel simulation techniques and characteristics Adaptive algorithm performance under a variety of conditions Adaptive antenna performance in different operational environments Design and implementation issues Experimental results Other issues such as network planning and recent novel techniques Adaptive Antennas for Wireless Communications is a valuable reference for helping consultants, researchers, communications professionals, academics, and students gain an in-depth understanding of adaptive antenna technology.
Reliable network connections
Authors: Victor C. Zandy, Barton P. Miller
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

We present two systems, reliable sockets (rocks) and reliable packets (racks), that provide transparent network connection mobility using only user- level mechanisms. Each system can detect a connection failure within seconds of its occurrence, preserve the endpoint of a failed connection in a suspended state for an arbitrary period of time, and automatically reconnect, even when one end of the connection changes IP address, with correct recovery of in-flight data. To allow rocks and racks to interoperate with ordinary clients and servers, we introduce a general user-level Enhancement Detection Protocol that enables the remote detection of rocks and racks, or any other socket enhancement system, but does not affect applications that use ordinary sockets. Rocks and racks provide the same functionality but have different implementation models: rocks intercept and modify the behavior of the sockets API by using an interposed library, while racks uses a packet filter to intercept and modify the packets exchanged over a connection. Racks and rocks introduce small throughput and latency overheads that we deem acceptable for the level of mobility and reliability they provide.
Configuring Cisco Routers for Bridging, DLSw+, and Desktop Protocols with Cdrom
Authors: Tan Nam-Kee, Tan Nam Kee
Venue:  (1999)

:Configure Cisco routers for bridging in a multiprotocol environment At last there's a complete guide to configuring and supporting multiprotocol networks on Cisco routers. Written by Tan Nam-Kee,an experienced CCIE and Cisco trainer,Configuring Cisco Routers for Bridging,DLSw+ and Desktop Protocols gives you detailed coverage of: *Concepts and configurations of transparent bridging and source-route bridging *IBM Networking Protocols DLSw+ (SNA),including DLSw and Ethernet,DLSw and Frame Relay,and DLSw and DDR> *Desktop Protocols,including Novell IPX,AppleTalk,Banyan VINES,DECnet,and ISO CLNS This hands-on tutor is packed with step-by-step implementations,practical scenarios,and case studies to help you both on the job and in preparing for the CCIE exam. You simply can't afford not to have it by your side! Accompanying CD-ROM includes all of the configurations in the book,to be used as templates.
Circuit-level techniques to control gate leakage for sub-100nm CMOS
Authors: Fatih Hamzaoglu, Mircea R. Stan
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

Although still negligible for state-of-the-art CMOS, gate leakage will become significant in the future for sub-100nm technologies, due to the scaling of oxide thickness. We propose several circuit techniques to control gate leakage based on the fact that PMOS transistors with SiO2 gate oxide have an order of magnitude smaller gate leakage than NMOS transistors in the same technology. First, we compare n-type domino with p-type domino circuits in terms of performance, leakage and switching power, and explore the different tradeoffs between performance and power. Second, we compare n-type with p-type gating for MTCMOS to control the leakage during sleep. The proposed circuits are simulated for a predictive 70nm CMOS technology with 10&Aring; gate oxide thickness and 1.2V supply voltage.
Exercise Workbook for Advanced AutoCAD 2000, 2000i and LT
Authors: Cheryl R. Shrock
Venue:  (2001)

:About the AuthorCheryl R. Shrock is a Professor and Chairperson of Computer Aided Drafting at Orange Coast College in Costa Mesa, California. She is an Autodesk registered author/publisher and has written eight workbooks on AutoCAD. Ms. Shrock began teaching CAD in 1990. Previous to teaching, she owned and operated a commercial product and machine design business where designs were created and documented using CAD. Her workbooks are a combination of her teaching abilities and her industry experience. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Creating a Virtual Library: A how-to-Do-It Manual, 1st edition
Authors: Frederick J. Stielow
Venue:  (1999)

:Training staff and patrons to use the Internet is one of today's most pressing needs for libraries of every type. This unique guide helps librarians teach their staff to be Internet trainers, and includes complete scripted workshops tailored for teaching Internet skills to library patrons. Part 1 focuses on training library staff with three one-hour workshops teaching staff members the basic principles of learning; how to apply those principles to the design of solid Internet training session; and how to conduct effective Internet training sessions with confidence. Areas covered include training objectives, adult learning principles, choosing and preparing the training site, interactive presentation techniques, and assisting resistant or intimidated trainees. Part 2 features seven ready-to-go workshops for users on major Internet topics, including the World Wide Web, search engines and finding information, books and literature information on the Web, college information, and Web publishing and HTML. Each one-hour module includes an introduction, an objective, a timed lesson plan, suggested methods for demonstrating the skills covered, tips, a sample script, a reproducible handout, lists of related Websites, and recommended books and magazines. These modules are designed to be as universal as possible in terms of content, setting and software, and are relevant to every type and size of library. Evaluation/assessment instruments and a listing of Web resources for trainers round out this time-saving resource. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Networking Home PCs for Dummies, 1st edition
Authors: IDG Press, Kathy Ivens
Venue:  (1999)

:Tired of haggling over who's going to check e-mail first? Don't want to spend any more money on another modem and phone line - or hard drive or printer for that matter? Set up a home network! With the expert advice of Kathy Ivens, you'll quickly and easily figure out what you need to know to connect your PCs and peripherals - and save a lot of money and headaches!
The Orthogonal Decomposition Theorems for Mimetic Finite Difference Methods
Authors: James M. Hyman, Mikhail Shashkov
Venue: SIAM Journal on Numerical Analysis (1999)

Accurate discrete analogs of differential operators that satisfy the identities and theorems of vector and tensor calculus provide reliable finite difference methods for approximating the solutions to a wide class of partial differential equations. These methods mimic many fundamental properties of the underlying physical problem including conservation laws, symmetries in the solution, and the nondivergence of particular vector fields (i.e., they are divergence free) and should satisfy a discrete version of the orthogonal decomposition theorem. This theorem plays a fundamental role in the theory of generalized solutions and in the numerical solution of physical models, including the Navier--Stokes equations and in electrodynamics. We are deriving mimetic finite difference approximations of the divergence, gradient, and curl that satisfy discrete analogs of the integral identities satisfied by the differential operators. We first define the natural discrete divergence, gradient, and curl operators based on coordinate invariant definitions, such as Gauss's theorem, for the divergence. Next we use the formal adjoints of these natural operators to derive compatible divergence, gradient, and curl operators with complementary domains and ranges of values. In this paper we prove that these operators satisfy discrete analogs of the orthogonal decomposition theorem and demonstrate how a discrete vector can be decomposed into two orthogonal vectors in a unique way, satisfying a discrete analog of the formula $\vec{A} = \ggrad \, \varphi + \curl \, \vec{B}$. We also present a numerical example to illustrate the numerical procedure and calculate the convergence rate of the method for a spiral vector field.
Sams Teach Yourself UNIX System Administration in 21 Days, 1st edition
Authors: Joan Ray, William C. Ray
Venue:  (1999)

:In just 21 days, users can go to beginner or intermediate to the capability level of performing more advanced system administrator functions. The book covers the workshop configuration for all major flavors of UNIX and fills the void other books leave by being too narrowly focused.
Improving the performance of radial basis function classifiers in condition monitoring and fault diagnosis applications where &#x2018;unknown&#x2019; faults may occur
Authors: Yuhua Li, Michael J. Pont, N. Barrie Jones
Venue: Pattern Recognition Letters (2002)

This paper presents a novel technique which may be used to determine an appropriate threshold for interpreting the outputs of a trained radial basis function (RBF) classifier. Results from two experiments demonstrate that this method can be used to improve the performance of RBF classifiers in practical applications.
PowerBookmarks: an advanced Web bookmark database system and its information sharing and management
Authors: Wen-Syan Li, Yi-Leh Wu, Corey Bufi, Chen-Chuan K. Chang, Divyakant Agrawal, Yoshinori Hara
Venue: Information organization and databases: foundations of data organization (2000)

Bookmarks in existing Internet browsers only provide limited functionalities: storing URLs, titles, and organizing folders for manual categorization of URLs. We extend the notion of bookmarks by introducing the concepts and functionalities of databases, such as query, re-organization, information sharing, view, and access control. We have developed an advanced Web bookmark system, PowerBookmarks, which allows users to select URLs of their interests to construct their bookmark databases for subsequent querying. PowerBookmarks supports organization of bookmark URLs as an hierarchical structure. Users can also set the access control for sharing their bookmark databases with other users.
Atomic Transactions: In Concurrent and Distributed Systems
Authors: Nancy A. Lynch, Michael Merritt
Venue:  (1993)

:This book develops a theory for transactions that provides practical solutions for system developers, focusing on the interface between the user and the database that executes transactions. Atomic transactions are a useful abstraction for programming concurrent and distributed data processing systems. Presents many important algorithms which provide maximum concurrency for transaction processing without sacrificing data integrity. The authors include a well-developed data processing case study to help readers understand transaction processing algorithms more clearly. The book offers conceptual tools for the design of new algorithms, and for devising variations on the familiar algorithms presented in the discussions. Whether your background is in the development of practical systems or formal methods, this book will offer you a new way to view distributed systems.