ppxscal/embedding_network huggingface dataset:
Combining GAs and Symbolic Methods for High Quality Tests of Sequential Circuits
Authors: Martin Keim, Nicole Drechsler, Rolf Drechsler, Bernd Becker
Venue: Journal of Electronic Testing: Theory and Applications (2001)

A symbolic fault simulator is integrated in a Genetic Algorithm (GA) environment to perform Automatic Test Pattern Generation (ATPG) for synchronous sequential circuits. In a two phase algorithm test length and fault coverage as well are optimized. Furthermore, not only the Single Observation Time Test Strategy is supported, but also test patterns with respect to the Multiple Observation Time Test Strategy are generated. However, there are circuits that are hard to test using random pattern sequences, even if these sequences are genetically optimized. Thus, deterministic aspects are included in the GA environment to improve fault coverage. Experiments demonstrate that both a priori time consuming strategies, the symbolic simulation approach and the GA, can be combined at reasonable costs: Tests with higher fault coverages and considerably shorter test sequences than previously presented approaches are obtained.
Improved Algorithms and Analysis for Secretary Problems and Generalizations
Authors: Miklos Ajtai, Nimrod Megiddo, Orli Waarts
Venue: SIAM Journal on Discrete Mathematics (2001)

In the classical secretary problem, n objects from an ordered set arrive in random order, and one has to accept k of them so that the final decision about each object is made only on the basis of its rank relative to the ones already seen. Variants of the problem depend on the goal: either maximize the probability of accepting the best k objects, or minimize the expectation of the sum of the ranks (or powers of ranks) of the accepted objects. The problem and its generalizations are at the core of tasks with a large data set, in which it may be impractical to backtrack and select previous choices.Optimal algorithms for the special case of k = 1 are well known. Partial solutions for the first variant with general k are also known. In contrast, an explicit solution for the second variant with general k has not been known. It seems that the fact that the expected sum of powers of the ranks of selected items is bounded as n tends to infinity has been known to follow from standard results. We derive our results by obtaining explicit algorithms. For each $z \geq 1$, the resulting expected sum of the zth powers of the ranks of the selected objects is at most $k^{z + 1}/(z + 1) + C(z) \cdot k^{z + 0.5}\log k$, where log k \equiv \max\{1, \log_2 k\}$, whereas the best possible value at all is kz + 1/(z + 1) + O(kz). Our methods are very intuitive and apply to some generalizations. We also derive a lower bound on the trade-off between the probability of selecting the best object and the expected rank of the selected object.
Fault-tolerant Hamiltonicity of twisted cubes
Authors: Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu
Venue: Journal of Parallel and Distributed Computing (2002)

The twisted cube TQn, is derived by changing some connection of hypercube Qn according to specific rules. Recently, many topological properties of this variation cube are studied. In this paper, we consider a faulty twisted n-cube with both edge and/or node faults. Let F be a subset of V(TQn) &#x2229; E(TQn), we prove that TQn - F remains hamiltonian if |F| &#x2264; n - 2. Moreover, we prove that there exists a hamiltonian path in TQn - F joining any two vertices u, v in V(TQn)-F if |F| &#x2264; n - 3. The result is optimum in the sense that the fault-tolerant hamiltonicity (fault-tolerant hamiltonian connectivity respectively) of TQn is at most n - 2 (n - 3 respectively).
PERL Developer's Toolkit with Cdrom, 2nd edition
Authors: Randy Kobes
Venue:  (1997)

:Containing the complete CPAN as well as other Perl resources, the CD-ROM in this set was created by the author because there were no other products available that he recommended. Printed materials include the complete documentation on the 150 most important Perl modules.
Oracle8 Bible with Cdrom
Authors: Carol McCullough-Dieter, Taback, Ramesh Chandak
Venue:  (1998)

:The Oracle8 Bible is a comprehensive guide to the Oracle8 Enterprise Package. It supplies in-depth coverage of the latest Oracle8 tools as well as various commands and techniques for effectively managing and delivering large amounts of data with Oracle8. Using step-by-step instructions and plenty of samples, author Carol McCullough-Dieter explains important topics such as Object-relational database design, data backup and recovery, auditing, and partitioning. Part introductory tour, part reference guide, the Oracle8 Bible is an essential resource for novice Oracle developers and veteran database administrators alike. The CD-ROM includes all the samples and SQL code in the book as well as a fully searchable version of Oracle8 Bible.
The Java Class Libraries Volume 2: java.applet, java.awt, java.beans, 2nd edition
Authors: Patrick Chan, Rosanna Lee
Venue:  (1997)

:This volume provides comprehensive reference documentation for the development of applets, user interfaces, and Java beans. The information is presented in an easy-to-use, dictionary-like format. The packages covered in Volume 2 are: java.applet java.awt.image java.awt java.awt.peer java.awt.datatransfer java.beans java.awt.event The extensive class and member descriptions contain details crucial for developing robust and professional applets and applications. Each description is supplemented by an example that demonstrates the class or member in a relevant context. The 20,000 lines of code in over 350 examples facilitate learning-by-example and provide useful code fragments for your projects. Each class description includes: a class hierarchy diagram showing its connection to related classes a detailed overview describing its purpose and key concepts a convenient member summary that briefly describes each member and arranges the members into related groups an example demonstrating the class in a "real-world" context comprehensive descriptions and an example for each member
Advantage Series Microsoft Access 2000 Complete Edition (Expert and Level 1), 1st edition
Authors: Sarah Hutchinson-Clifford, Glen Coulthard
Venue:  (2000)

:The Advantage Series presents the Why,What and How of computer application skills to today's students. Each lab in this series is built upon an efficient learning model,which provides students and faculty with complete coverage and enhances critical thinking skills. This text contains Intro level content plus 5 to 6 additional chapters of advanced-level content.
The Quasi-Cauchy Relation and Diagonal Updating
Authors: M. Zhu, J. L. Nazareth, H. Wolkowicz
Venue: SIAM Journal on Optimization (1999)

The quasi-Cauchy (QC) relation is the weak quasi-Newton relation of Dennis and Wolkowicz [SIAM J. Numer. Anal., 30 (1993), pp. 1291--1314] with the added restriction that full matrices are replaced by diagonal matrices. This relation is justified and explored and, in particular, two basic variational techniques for updating diagonal matrices that satisfy it are formulated.For purposes of illustration, a numerical experiment is described where a diagonal updated matrix with hereditary positive definiteness is used to precondition Cauchy's steepest-descent direction. The resulting QC algorithm is shown to be significantly accelerated.In the concluding section, the following topics are briefly discussed: additional variational principles, use of diagonal updates within other optimization algorithms together with some further numerical experience (summarized in an appendix), and an interesting connection between QC-diagonal updating and trust-region techniques.
Graphics File Formats, 2nd edition
Authors: David C. Kay, John R. Levine
Venue:  (1994)

:For software developers,systems managers,and computer hobbyists,this book will help bring a welcome sense of order to the chaotic world of graphics file format. David Kay and John Levine have compiled detailed specifications for 30 popular graphics file formats,so readers can more quickly and easily decide which standards are best for their applications.
Fundamentals of Data Warehouses, 2nd edition
Authors: Matthias Jarke, Maurizio Lenzerini, Yannis Vassiliou, Panos Vassiliadis
Venue:  (2001)

:Data warehouses have captured the attention of practitioners and researchers alike. But the design and optimization of data warehouses remains an art rather than a science. This book presents a comparative review of the state of the art and best current practice of data warehouses. It covers source and data integration, multidimensional aggregation, query optimization, update propagation, metadata management, quality assessment, and design optimization. Also, based on results of the European Data Warehouse Quality project, it offers a conceptual framework by which the architecture and quality of data warehouse efforts can be assessed and improved using enriched metadata management combined with advanced techniques from databases, business modeling, and artificial intelligence. For researchers and database professionals in academia and industry, the book offers an excellent introduction to the issues of quality and metadata usage in the context of data warehouses.
Researching Online for Dummies with Cdrom, 2nd edition
Authors: Reva Basch, Mary Ellen Bates
Venue:  (2000)

:Ever been caught in a maze of irrelevant Web links that draw you further and further away from the topic you were trying to research? Researching Online For Dummies shows you how to stay focused, find just what you need on the Net, and apply that information to the project you're working on. Inside, find helpful advice on how to Choose the best search engine for your research project Use search tools specialized for your area of interest Link up with a virtual guru for guidance on your quest Get just what you need from online libraries, archives, and gated information services Tackle governmental cyberbureaucracy like a special agent Make the most of the business and investing data on the Web Verify your information, deal with copyright issues, and cite online resources properly
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
Authors: Amir Daneshgar
Venue: SIAM Journal on Discrete Mathematics (2001)

Let G be a simple undirected uniquely vertex k-colorable graph, or a k-UCG for short. M. Truszczy&nacute;ski [Some results on uniquely colorable graphs, in Finite and Infinite Sets, North-Holland, Amsterdam, 1984, pp. 733--748] introduced $e^{^{*}}(G)=|V(G)|(k-1)-{k \choose 2}$ as the minimum number of edges for a k-UCG and S. J. Xu [J. Combin. Theory Ser. B, 50 (1990), pp. 319--320] conjectured that any minimal k-UCG contains a Kk as a subgraph. In this paper, first we introduce a technique called forcing. Then by applying this technique in conjunction with a feedback structure we construct a k-UCG with clique number k-t, for each $t \geq 1$ and each k, when k is large enough. This also improves some known results for the case t=1.Second, we analyze the parameter $\Lambda(G)=|E(G)|-e^{^{*}}(G)$ for our constructions, and we obtain some bounds for the functions \lambda_{_{t}}(k)= \min \{\Lambda(G) \ : \ G \ {\rm is \ a} \ k\mbox{\rm -UCG and} \ cl(G)=k-t \}, $$ $$ \nu_{_{t}}(k)= \min \{|V(G)| \ : \ G \ {\rm is \ a} \ k\mbox{\rm -UCG and} \ cl(G)=k-t \}. Also, we introduce some possible applications of the technique in cryptography and data compression.
Asynchronous control circuits
Authors: Luciano Lavagno, Steven M. Nowick
Venue: Logic Synthesis and Verification (2001)

Asynchronous, or clockless, design is receiving renewed attention, due to its potential benefits of modularity, low power, low electromagnetic interference and average-case performance. This chapter focuses on two styles for asynchronous controller synthesis: speed-independent and burst-mode. Basic synthesis and optimization methods are presented, as well as an introduction to timing-based optimization.
Control of Linear Systems with Regulation and Input Constraints, 1st edition
Authors: Ali Saberi, Peddapullaiah Sannuti, Anton Stoorvogel
Venue:  (2000)

:The issue of tracking a desired reference signal in the presence of external disturbances is a classical control problem that resides at the core of control engineering. This is referred to as the output regulation problem. In this book the output regulation problem is examined in depth. New, highly significant dimensions are added to the problem and all pertinent topics associated with it are discussed. These topics include: Analysis and design of controllers for the output regulation problem subject to physical constraints on actuators such as amplitude and rate saturation. Incorporating transient performance requirements into output regulation problem formulation, thus creating an optimal framework for the output regulation problem. Uniting the output regulation problem formulation with other performance requirements of modern control theory such as H2 and Hinfinity optimal and suboptimal performance criteria. Opening up a novel framework of output regulation problem formulation in order to enlarge the class of signals dealt with whilst at the same time adding new possibilities. This book is designed to meet the needs of a variety of readers including practising control engineers, graduate students, and researchers in control engineering.
Access 2000 for Windows Visual QuickStart Guide, 1st edition
Authors: Deborah S. Ray, Eric J. Ray
Venue:  (1999)

:The newest Macintosh operating system, Mac OS 8.5, has brought definite changes to the Mac, and Robin Williams' blockbuster, The Little Mac Book, is right there to cover them. With more than 1 million copies in print, this is one of the best-selling guides of all time for Macintosh beginners. The completely updated and revised Sixth Edition covers the new features of OS 8.5, including the Sherlock search system, which connects directly to the Internet for Web searches. The Little Mac Book, Sixth Edition covers Mac essentials using a warm, friendly tone that doesn't get lost in dense technical text and obscure details. A must-have for Mac newcomers, Robin Williams fans, and veteran Mac users who want to get up to speed with OS 8.5.
Perpetual American Options Under Lévy Processes
Authors: S. I. Boyarchenko, S. Z. Levendorskii
Venue: SIAM Journal on Control and Optimization (2001)

We consider perpetual American options, assuming that under a chosen equivalent martingale measure the stock returns follow a Lévy process. For put and call options, their analogues for more general payoffs, and a wide class of Lévy processes that contains Brownian motion, normal inverse Gaussian processes, hyperbolic processes, truncated Lévy processes, and their mixtures, we obtain formulas for the optimal exercise price and the fair price of the option in terms of the factors in the Wiener--Hopf factorization formula, i.e., in terms of the resolvents of the supremum and infimum processes, and derive explicit formulas for these factors. For calls, puts, and some other options, the results are valid for any Lévy process. We use Dynkin's formula and the Wiener--Hopf factorization to find the explicit formula for the price of the option for any candidate for the exercise boundary, and by using this explicit representation, we select the optimal solution.We show that in some cases the principle of the smooth fit fails and suggest a generalization of this principle.
E-Business: Principles and Practice
Authors: Jennifer Rowley
Venue:  (2002)

:"This book offers an overview of key concepts in e-business at an introductory level, and is illustrated with case studies throughout. It is informed by research and practice from marketing, information technology, strategy and organisational studies." This book has been designed to develop the necessary analytical skills for students to evaluate e-business models and issues that will enable them to identify, analyse and evaluate future technologies - whatever those may be.
Red Hat Linux 7.2 WCC
Authors: Naba Barkakati, Kurt Wall
Venue:  (2001)

:Author Biography: Naba Barkakati is an expert programmer and successful computer-book author who has experience in a wide variety of systems, ranging from MS-DOS and Windows to UNIX and the X Window System. Over the past 12 years, Naba has written 25 computer books on a number of topics ranging from C++ programming to Linux. He has authored several best-selling titles, such as The Waite Group's Turbo C++ Bible, Object-Oriented Programming in C++, X Window System Programming, Visual C++ Developer's Guide, and Borland C++ 4 Developer's Guide. Naba's most recent book is the best-selling Red Hat Linux 7.1 Secrets, also published by Hungry Minds. Naba lives in North Potomac, Maryland, with his wife Leha and their children Ivy, Emily, and Ashley. Kurt Wall has been using and programming Linux and UNIX since 1993. Kurt is the author of two editions of Linux Programming Unleashed and Linux Programming by Example. Additionally, he has contributed chapters to The Informix Handbook, The Linux Bible, and forthcoming titles on Linux clustering, Linux performance tuning and capacity planning, and Microsoft Access database development. Kurt is does the technical editor for a wide variety of Linux titles.
Finite Difference Methods and Spatial A Posteriori Error Estimates for Solving Parabolic Equations in Three Space Dimensions on Grids with Irregular Nodes
Authors: Peter K. Moore
Venue: SIAM Journal on Numerical Analysis (1999)

Adaptive methods for solving systems of partial differential equations have become widespread. Much of the effort has focused on finite element methods. In this paper modified finite difference approximations are obtained for grids with irregular nodes. The modifications are required to ensure consistency and stability. Asymptotically exact a posteriori error estimates of the spatial error are presented for the finite difference method. These estimates are derived from interpolation estimates and are computed using central difference approximations of second derivatives of the solution at grid nodes. The interpolation error estimates are shown to converge for irregular grids while the a posteriori error estimates are shown to converge for uniform grids. Computational results demonstrate the convergence of the finite difference method and a posteriori error estimates for cases not covered by the theory.
On Lagrangian Relaxation of Quadratic Matrix Constraints
Authors: Kurt Anstreicher, Henry Wolkowicz
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equivalent to semidefinite programming relaxations.For several special cases of QQP, e.g., convex programs and trust region subproblems, the Lagrangian relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective. In this paper we consider a certain QQP where the quadratic constraints correspond to the matrix orthogonality condition XXT=I. For this problem we show that the Lagrangian dual based on relaxing the constraints XXT=I and the seemingly redundant constraints XT X=I has a zero duality gap. This result has natural applications to quadratic assignment and graph partitioning problems, as well as the problem of minimizing the weighted sum of the largest eigenvalues of a matrix. We also show that the technique of relaxing quadratic matrix constraints can be used to obtain a strengthened semidefinite relaxation for the max-cut problem.
Using NetScape Navigator Gold 3, with CD-ROM (Special Edition)
Authors: Que Corporation, Heather Fleming, Tim Evans, Galen Grimes, Steven Forrest Burnett, Raym Gronberg
Venue:  (1997)

:A complete reference on how to use and customize the latest version of Netscape Navigator, the most popular and powerful Web software available. From installing and configuring Netscape Navigator on any computer to creating world-class Web Pages and Web sites, this book is your complete guide to Netscape. The CD-ROM includes a free licensed copy of Netscape Navigator Gold 3, over 25 of the best plug ins, plus four computer reference books in an electronic version.
Tutorial: mobile software agents for dynamic routing
Authors: Kwindla Hultman Kramer, Nelson Minar, Pattie Maes
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

As portable digital devices of all kinds proliferate, wireless networks that allow for flexible, timely and efficient data communication become more and more important. Networks for mobile devices are quite difficult to design for several reasons, chief among them the problem of routing packets across networks characterized by constantly changing topology. In this article we describe ways to address the routing problem using a new technique for 'distributed programming, mobile software agents.
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings
Authors: Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, Mark Jerrum, Michael Mitzenmacher
Venue: SIAM Journal on Computing (2001)

A new method for analyzing the mixing time of Markov chains is described. This method is an extension of path coupling and involves analyzing the coupling over multiple steps. The expected behavior of the coupling at a certain stopping time is used to bound the expected behavior of the coupling after a fixed number of steps. The new method is applied to analyze the mixing time of the Glauber dynamics for graph colorings. We show that the Glauber dynamics has O(n log(n)) mixing time for triangle-free $\Delta$-regular graphs if k colors are used, where $k\geq (2-\eta)\Delta$, for some small positive constant $\eta$. This is the first proof of an optimal upper bound for the mixing time of the Glauber dynamics for some values of k in the range $k\leq 2\Delta$.
Tom Clancy's Rainbow Six: Prima's Official Strategy Guide
Authors: Michael Knight, Tom Clancy
Venue:  (1998)

:Tom Clancy is the master of military action. In Rainbow Six, you lead his elite multinational task force in a battle against international terrorism. To succeed in this treacherous mission you will need Prima's Official Strategy Guide. Inside you will find everything you need to concoct an effective plan and lead a terrifying assault, including backgrounds on the 20 special operatives from which you can choose your team, expert information for all 16 unique missions, specs for all weapons, details of all locations, and multiplayer tips and tactics.
Visual mapping of articulable tacit knowledge
Authors: Peter Anthony Busch, Debbie Richards, C. N. G. 'Kit' Dampney
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

Tacit knowledge has long been recognised, however its research has focused largely on who is more likely to have this store of knowledge, rather than taking this one step further and elaborating on just how well this knowledge is diffused throughout the organisational domain. We focus our efforts on the IS organisational domain, by which we mean computing workplace professionals as opposed to the entire intra-organisational workplace. Our methodology largely follows the Sternberg example, however we seek also to include information flows through the incorporation of Social Network Analysis techniques. We present here, some qualitative interpretations of our understanding of tacit knowledge and also results from a complete pilot study in Organisation X which illustrates how the pivotal role a even a single individual could affect tacit knowledge information flows within the IS domain.