ppxscal/embedding_network huggingface dataset:
XHTML for Dummies with Cdrom
Authors: Ed Tittel, Natanya Pitts, Natanya Pitts-Moultis, Chelsea Valentine
Venue:  (2000)

:With the growing number of Internet-ready devices comes the need for more versatile new languages such as Extensible HyperText Markup Language (XHTML), a combination of XML and HTML that became a recommended standard language of the World Wide Web Consortium in January 2000. This guide offers tips on writing XHTML quickly and creating content that can be viewed on many devices, including PCs and Internet telephones. Helps Web designers get quickly up to speed on the newest Internet development standard Author Ed Tittel, of HTML For Dummies fame, teams with Web professionals Chelsea Valentine and Natanya Pitts to guide new XHTML users through building Web content that can be read on any Internet ready device Includes coverage on converting legacy HTML documents into XHTML XHTML For Dummies includes a CD-ROM that contains all XHTML code used in the book as well as tools for determining browser compatibility with XHTML About the Authors: Ed Tittel (Austin, TX) is the author of several . . .For Dummies books on programming and networking, including HTML 4 For Dummies, 2nd Edition as well as XML For Dummies, 2nd Edition. He has also written numerous articles for several computing publications and now concentrates primarily on publishing on Internet related topics. Chelsea Valentine works for Ed's company, LANWrights, as a full-time Webmaster, designer, trainer, and code and standards guru. Natanya Pitts has taught HTML, XML, and Dynamic HTML in classrooms and at conferences. She recently worked with Ed on the latest revision of HTML 4 For Dummies.
A Study on the Optimal Cost for the $H_\infty$ Problem of Discrete Linear Periodically Time-Varying Systems
Authors: Shunji Tanaka, Tomomichi Hagiwara, Mituhiko Araki
Venue: SIAM Journal on Control and Optimization (2002)

In this paper, we propose a new method to obtain the optimal cost (the infimum of the achievable $H_\infty$ norm of a closed-loop system) for discrete linear periodically time-varying (LPTV) systems. This method reduces via the lifting technique the original problem to the $H_\infty$ problems of linear time-invariant (LTI) systems without the causality constraint, and therefore the optimal cost can be easily calculated. It is one of the primary advantages over other existing methods. We also show, by applying our method to LTI systems, that the optimal cost for the $H_\infty$ problem of discrete LTI systems cannot be improved even if we use a class of noncausal controllers. An intriguing implication of this fact is further shown in the context of causal controllers.
Structure and Perturbation Analysis of Truncated SVDs for Column-Partitioned Matrices
Authors: Zhenyue Zhang, Hongyuan Zha
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this paper we study truncated SVDs for column-partitioned matrices. In particular, we analyze the relation between the truncated SVDs of a matrix and the truncated SVDs of its submatrices. We give necessary and sufficient conditions under which a truncated SVD of a matrix can be constructed from those of its submatrices. We then present perturbation analysis to show that an approximate truncated SVD can still be computed even if the given necessary and sufficient conditions are only approximately satisfied. We also apply our general results to a class of matrices with the so-called low-rank-plus-shift structure.
Two-Stage Budgeting: A Difficult Problem
Authors: A. Norman, J. Chou, M. Chowdhury, A. Dalal, K. Fortson, M. Jindal, K. Payne, M. Rajan
Venue: Computational Economics (2001)

Utility maximization with a weakly separable utility function requires a consumer create an optimal budget for each separable subgroup. We show that computational complexity of optimal budgeting is the maximum of an exponential in the number of alternatives and a quadratic in the number of budget increments. From a budget survey of undergraduates we show that an undergraduate procedural consumer can obtain a budget estimate from the experience of previous students and can monitor the flow of funds and can make adjustments at a minuscule fraction of the calculations needed for optimal budgeting.
A Multimethod Approach for Creating New Business Models: The General Motors OnStar Project
Authors: Vince Barabba, Chet Huber, Fred Cooke, Nick Pudar, Jim Smith, Mark Paich
Venue: Interfaces (2002)

We developed a multimethod modeling approach to evaluate strategic alternatives for GM's OnStar communications system. We used dynamic modeling to address some decisions GM faced in 1997, such as the company's choice between incremental and aggressive marketing strategies for OnStar. We used an integrated simulation model for analyzing the new telematics industry, consisting of six sectors: customer acquisition, customer choice, alliances, customer service, financial dynamics, and dealer behavior. The modeling effort had important financial, organizational, and societal results. The OnStar business now has two million subscribers, an 80 percent market share of the emerging telematics market, and has been valued at between $4 and $10 billion. The OnStar project set the stage for a broader GM initiative in service businesses that ultimately could yield billions in incremental earnings. Most important, OnStar has saved many lives that otherwise would have been lost in vehicle accidents.
Computational complexity of uniform quantum circuit families and quantum Turing machines
Authors: Harumichi Nishimura, Masanao Ozawa
Venue: Theoretical Computer Science (2002)

Deutsch proposed two sorts of models of quantum computers, quantum Turing machines (QTMs) and quantum circuit families (QCFs). In this paper we explore the computational powers of these models and re-examine the claim of the computational equivalence of these models often made in the literature without detailed investigations. For this purpose, we formulate the notion of the codes of QCFs and the uniformity of QCFs by the computability of the codes. Various complexity classes are introduced for QTMs and QCFs according to constraints on the error probability of algorithms or transition amplitudes. Their interrelations are examined in detail. For Monte Carlo algorithms, it is proved that the complexity classes based on uniform QCFs are identical with the corresponding classes based on QTMs. However, for Las Vegas algorithms, it is still open whether the two models are equivalent. We indicate the possibility that they are not equivalent. In addition, we give a complete proof of the existence of a universal QTM efficiently simulating multi-tape QTMs. We also examine the simulation of various types of QTMs such as multi-tape QTMs, single tape QTMs, stationary, normal form QTMs (SNQTMs), and QTMs with the binary tapes. As a result, we show that these QTMs are computationally equivalent to one another as computing models implementing not only Monte Carlo algorithms but also exact (or error-free) ones
Helping the helpers: cameo - an information appliance for home care service
Authors: Niklas Andersson
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

In the future the proportion of elderly in the population will increase rapidly, while those who will take care of them will be fewer then today. The goal with the project was to create a vision of how digital technology and designated hardware and software can make tomorrows' home care more efficient, with increased quality and flexibility. The resulting design "Cameo", is a small handheld device which has been developed with the users' needs and requirements elaborated in a future scenario.
Exposure in wireless sensor networks: theory and practical solutions
Authors: Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Giacomino Veltri, Miodrag Potkonjak
Venue: Wireless Networks (2002)

Wireless ad hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This connection will enable computational treatments of the physical world in ways never before possible. In this far reaching scenario, Quality of Service can be expressed in terms of accuracy and/or latency of observing events and the overall state of the physical world. Consequently, one of the fundamental problems in sensor networks is the calculation of coverage, which can be defined as a measure of the ability to detect objects within a sensor filed. Exposure is directly related to coverage in that it is an integral measure of how well the sensor network can observe an object, moving on an arbitrary path, over a period of time. After elucidating the importance of exposure, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculations in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm can be applied to any given distribution of sensors, sensor and sensitivity models, and characteristics of the network. Furthermore, it provides an unbounded level of accuracy as a function of run time and storage. Finally, we provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation.
A Decomposition Method for Positive Semidefinite Matrices and Its Application to Recursive Parameter Estimation
Authors: Liyu Cao, Howard M. Schwartz
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

A matrix decomposition method for positive semidefinite matrices based on a given subspace is proposed in this paper. It is shown that any positive semidefinite matrix can be decomposed uniquely into two positive semidefinite parts with specified rank one of which is orthogonal to the subspace. This method is then compared with the rank-additivity decomposition, and the difference as well as the close connection between these two decompositions are given. Finally, the proposed decomposition method is used to develop a new recursive parameter estimation algorithm for linear systems.
Now That I Have OS-2 2.0 on My Computer, What Do I Do Next...: Mastering the Workplace Shell
Authors: Steven Levenson, Eli E. Hertz
Venue:  (1992)

:Soon you will:reduce the time required to complete current job assignmentsuse new OS/2 applications fasterenjoy the benefits of using OS/2, Windows, and DOS togetherstop being envious of your neighbor's MacintoshMost importantly, by relying onNow That I have OS/2 2.0 on My computer--What Do I Do Next?, even inexperienced PC users will soon confidently answer the question posed by the book's title--and then quickly move on to master OS/2 2.0's more sophisticated capabilities.
Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
Authors: Andrew V. Knyazev
Venue: SIAM Journal on Scientific Computing (2001)

We describe new algorithms of the locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest several other new methods. To be able to compare numerically different methods in the class, with different preconditioners, we propose a common system of model tests, using random preconditioners and initial guesses. As the "ideal" control algorithm, we advocate the standard preconditioned conjugate gradient method for finding an eigenvector as an element of the null-space of the corresponding homogeneous system of linear equations under the assumption that the eigenvalue is known. We recommend that every new preconditioned eigensolver be compared with this "ideal" algorithm on our model test problems in terms of the speed of convergence, costs of every iteration, and memory requirements. We provide such comparison for our LOBPCG method. Numerical results establish that our algorithm is practically as efficient as the ``ideal'' algorithm when the same preconditioner is used in both methods. We also show numerically that the LOBPCG method provides approximations to first eigenpairs of about the same quality as those by the much more expensive global optimization method on the same generalized block Krylov subspace. We propose a new version of block Davidson's method as a generalization of the LOBPCG method. Finally, direct numerical comparisons with the Jacobi--Davidson method show that our method is more robust and converges almost two times faster.
A+ Certification: Operating Systems
Authors: Total Seminars, Total Seminars Llc
Venue:  (1998)

:Becoming an A+ Certified computer technician just got easier. Accelerated A+ Certification Study Guides are written by experts - A+ Certified technicians and leaders in teaching PC and network maintenance and repair - for computer professionals who want to pass their exams the first time around. It's all here: everything you need to approach the exam with confidence, in a handy, study-anywhere format. The Accelerated A+ Certification DOS/Windows Study Guide provides exactly the kind of guidance necessary to get you ready for the key A+ DOS/Windows Exam - the test that's geared toward a knowledge of DOS and Windows 3.X and Windows 95. Pick any topic - from a basic understanding of file management to installing networks and establishing internet connections - and the information is all there, right where you want it.
GroupWise 5.5 Administrators Guide
Authors: Richard Beels, Scott Kunau, Danita Zanr
Venue:  (1998)

:The GroupWise Administrator's Guide is the essential resource for anyone administering a Group Wise collaborative computing environment. Written by recognized GroupWise experts, this comprehenisve handbook provides full coverage of every aspect of GroupWise administration, from planning and installing the GroupWise to extending its functionality.
Linux to Go, 1st edition
Authors: Rich Grace, Tim Parker
Venue:  (1999)

From the Book:PREFACE: PrefaceLinux has seen a spectacular growth curve over the last two or three years. When mail-order companies start to preload the operating system, you know it's made it to the big leagues. According to reasonable market estimates, there are over eight million Linux users in the world. Compare that to Windows's sixty-six million, and you can see that Linux has found a considerable niche in the market. Linux's popularity has grown as the operating system has evolved from a hacker's paradise a mere six years ago to a robust, dependable, stable operating system with a friendly GUI, commercial applications, and dedicated support on the Internet. Users are no longer faced with convoluted installation and configuration processes. They don't even have to learn much about UNIX. Since Linux can work superbly on old hardware, like the 386 and 486 you replaced with your Pentium, there's no reason not to use it. Along with the rise in popularity there has been an outpouring of books about the subject. One author has written eight books on the subject in the last five years. Yet most of the books on the shelves deal with introductory-level material for the non-UNIX user, or special configuration and programming subjects. There are no books on tricks and tips for the user who isn't a guru, but isn't a neophyte, either. You already know Linux commands, and you have the operating system running smoothly. This book addresses where to go from the basics you already understand. The target audience for all the To Go books are users moving beyond basic knowledge levels. The series tries to cover many aspects of the subject that may be of interest,withoutconcentrating too much on any one subject or theme. You'll find a varied assortment in these pages. Some of the subjects in this book are likely to be familiar to you; others may not be. Many veteran Linux users know the basic UNIX commands, but don't understand subjects like file permissions, using find, or configuring X properly. Thus, we've taken the subjects that most Linux users want to know about, answered many of the most commonly-asked questions, and tried to extend the typical Linux user's knowledge about the use of the operating system. Many of the subjects in this book, such as DNS, Apache, Samba, and Usenet news, have been included because of repeated requests for information from students in advanced UNIX courses. If they are curious, you may be, too.We cover a lot of material here, from the simple to the complex. We don't try to cover every obscure aspect of Linux. We don't try to be comprehensive. We can't possibly do that in the few hundred pages you hold. Instead, we include enough detail to whet your appetite, to start you experimenting with your system, and to expand your knowledge level considerably. We hope you enjoy reading Linux To Go. If you have suggestions for changes or additions, we'd like to hear from you. Above all else, we hope you learn something and are able to get even more from this great operating system.
Towards the Visual Microprocessor, 1st edition
Authors: Angel Rodriguez-Vasquez
Venue:  (2000)

:Written by a group of leading researchers in the field, this is a pioneering work, providing a concise analysis of the topic by the inventors of the CNN universal machine and the supercomputer chip. Opening with a foreword by the respected academic, Professor Leon Chua, the book progresses to explore circuit design, prototyping and analogical algorithms. Subjects covered include the VLSI design and implementation of CNNs, the testing of CNN chips and a detailed analysis of the new system for prototyping and interfacing the CNN universal chips Includes applications in: Neurocomputing, Machine Vision, Image Processing and VLSI Signal Processing Provides simple algorithms to design and synthesise complex circuits Written and edited by world authorities in this field, including Leon Chua who invented CNNs in the late 1980s.This text follows on from Roska's previous success - Cellular Neural Networks and D3 - with this groundbreaking work about a rapidly developing and increasingly influential field of circuit theory. This text would be of great interest to a broad audience including postgraduate and advanced students, researchers and professionals in electrical and electronic engineering, computer science, mathematics and neurobiology.
10 Minute Guide to Outlook 98, 1st edition
Authors: Joe W. Habraken
Venue:  (1998)

:10 minutes is all you need to learn how to: customize Outlook 98 for your personal use; send, receive and distribute email from workgroups and the Web; plan meetings and schedule appointments; track your daily tasks in the Outlook 98 journal; share data in Outlook 98 with other Office 97 applications; design a personal address book listing important contacts; and integrate Outlook 98 with Internet Explorer and Exchange Server.
All-in-One Cisco(R) Ccie(TM) Lab Study Guide, 2nd edition
Authors: Stephen Hutnik, Michael Satterlee
Venue:  (2001)

:This comprehensive study guide covers all exam objectives for the CCIE Lab examone of the most difficult tests to pass. You'll get details on the latest topics,including voice technology,VPN,ATM,and security,plus more than 100 network-based scenarios and a CD-ROM containing case studies and complete configuration examples. Get Certified With The Ultimate Hands-on Lab Exam Preparation Tool Prepare to pass the lab portion of the CCIE exam using this comprehensive exam study guide. Inside this one-stop resource you'll find all new coverage of voice technologies,VPNs,DLSW,and IPSecall accompanied by actual network configurations. Following the same successful format as the first edition,this proven exam guide will take you through numerous lab scenarios step-by-step. You'll get a detailed technology overview,a list of commands and a detailed explanation of its function,and tips for troubleshootingfor over 115 network-based scenarios. And,you'll find illustrations and end-of-chapter definitions to help reinforce new concepts and terminology that you've just learned. Includes details on commands and terminology for the following:ISDN ATM LANE All Interior Gateway Routing Protocols BGP IP Access Lists DLSW and Bridging Voice over IP MPLS IPSec Catalyst Switches
Asymptotic Minimum Covering Radius of Block Codes
Authors: Po-Ning Chen, Yunghsiang S. Han
Venue: SIAM Journal on Discrete Mathematics (2001)

In this paper, we restudy the covering radius of block codes from an information theoretic point of view by ignoring the combinatorial formulation of the problem. In the new setting, the formula of the statistically defined minimum covering radius, for which the probability mass of uncovered space by M spheres can be made arbitrarily small, is reduced to a minimization of a statistically defined spectrum formula among codeword-selecting distributions. The advantage of the new view is that no assumptions need to be made on the code alphabet (such as finite, countable, etc.) and the distance measure (such as additive, symmetric, bounded, etc.) in the problem transformation, and hence the spectrum formula can be applied in most general situations. We next address a sufficient condition under which uniform codeword-selecting distribution minimizes the spectrum formula. With the condition, the asymptotic minimum covering radius for block codes under J-ary quantized channels and constant weight codes under Hamming distance measure are determined to display the usage of the spectrum formula.
Accounting Information Systems: Concepts and Practice for Effective Decision Making, 2nd edition
Authors: Stephen A. Moscove, Mark G. Simkin
Venue:  (1984)

:This Fourth Edition analyzes the vital role of computerized accounting information systems in today's business world. Intended for the accounting major, covers management concepts of importance to accountants, with emphasis on the design of accounting information systems. It discusses the central tasks of accounting information systems, namely collecting, recording, and storing business data, and the accountant's role in implementing effective internal controls. Also gives thorough treatment to systems studies leading to development of more efficient accounting information systems and looks at special topics such as accounting for nonprofit organizations and small businesses. A variety of exercises and cases are included at the end of each chapter, and an entire section is devoted to more extensive case studies.
Introduction to Computing Systems: From Bits and Gates to C and Beyond, 1st edition
Authors: Yale N. Patt, Sanjay Patel
Venue:  (2000)

:The reason most students do not understand their first programming language is because they are forced to memorize technical details. They do not understand the basic underpinnings. This book is based on the premise that starting with a high level programming language has its shortcomings This premise lead to Patt/Patel's "bottom-up approach" found in "Introduction To Computing. " This text covers (in order) a switch level abstraction of a MOS Transistor,Logic Gates,latches,logic structures (MUX,Decoder,Adder,gated latches),finally culminating in an implementation of memory. From there,the book moves on to the Von Neumann model of execution,then a simple computer (the LC-2),machine language programming and then assembly language programming of the LC-2,the high level language C,recursion,and finally elementary data structures. The book establishes a foundation that can easily be built upon
Programming with Visibroker: A Developer's Guide to Visibroker for Java with Cdrom, 1st edition
Authors: Eric Bleifield, Jon Goldberg, Doug Pedrick, Jonathan Weedon
Venue:  (1997)

:Coauthored by the lead architect for the VisiBroker Java ORB, this is the authoritative guide to programming with VisiBroker for Java. Designed to help Java developers quickly master the skills they need to develop more powerful and sophisticated distributed, object-oriented, client/server systems from scratch or by combining existing components, it covers all the crucial bases in the life cycle of a VisiBroker implementation.