ppxscal/embedding_network huggingface dataset:
Numerical Normalization Techniques for All Codim 2 Bifurcations of Equilibria in ODE's
Authors: Yu. A. Kuznetsov
Venue: SIAM Journal on Numerical Analysis (1999)

Explicit computational formulas for the coefficients of the normal forms for all codim 2 equilibrium bifurcations of equilibria in autonomous ODEs are derived. They include second-order coefficients for the Bogdanov--Takens bifurcation, third-order coefficients for the cusp and fold-Hopf bifurcations, and coefficients of the fifth-order terms for the generalized Hopf (Bautin) and double Hopf bifurcations. The formulas are independent on the dimension of the phase space and involve only critical eigenvectors of the Jacobian matrix of the right-hand sides and its transpose, as well as multilinear functions from the Taylor expansion of the right-hand sides at the critical equilibrium. The normal form coefficients for the fold-Hopf bifurcation in the "new" Lorenz model are computed using the derived formulas, proving the existence of a nontrivial invariant set in the system.
Learning UNIX: Second Edition- Disk includes MKS Tools -A UNIX Simulator and Primer for DOS USers!, 2nd edition
Authors: James Gardner
Venue:  (1994)

:An easy-to-understand introduction to both UNIX and UNIX utilities! This book/disk set is a complete, hands-on tutorial to UNIX fundamentals.Provides an introduction to both UNIX and Korn Shell programmingDisk contains 32 utilities from the MKS 4.2 toolkit, tutorial files and an installation program that allows readers to learn UNIX on a PC-no UNIX required 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
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
Authors: Seth Pettie, Vijaya Ramachandran
Venue: SIAM Journal on Computing (2002)

We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r. t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures. We also give a simple, general processor allocation scheme for tree-like computations.
From the Mosco and Slice Convergences for Convex Normal Integrands to that of Integral Functionals on Lp Spaces
Authors: Jérôme Couvreux
Venue: SIAM Journal on Control and Optimization (2000)

Given a sequence of integrands $f_n : T \times X \rightarrow R\ (n \geq 1)$ which converges in the sense of the slice-topology to an integrand f, $(T, \mathcal{A}, \mu)$ being a complete probability space and X a nonreflexive Banach space with separable dual, we show that the sequence of integral functionals I(fn) : u \rightarrow \int f_n(t, u(t)) d\mu\ (n \geq 1)$ associated to the (fn) converges to I(f) : u \rightarrow \int f(t, u(t)) d\mu$ in the sense of the slice-topology on Lp(X) and that the sequence of integral functionals associated to the conjugate integrands $(f^*_n)$ converges to $I(f^*) : u \rightarrow \int f^*(t, u(t)) d\mu$ on $L^q(X^*)$ (with $1 \leq p X is finite dimensional and by Salvadori for Mosco convergence when X is reflexive. We also need to provide some criteria for functional convergence in the slice-topology, using the strong epigraphical upper limit.
Budget-Dependent Convergence Rate of Stochastic Approximation
Authors: Pierre L'Ecuyer, George Yin
Venue: SIAM Journal on Optimization (1998)

Convergence rate results are derived for a stochastic optimization problem where a performance measure is minimized with respect to a vector parameter t. Assuming that a gradient estimator is available and that both the bias and the variance of the estimator are (known) functions of the budget devoted to its computation, the gradient estimator is employed in conjunction with a stochastic approximation (SA) algorithm. Our interest is to figure out how to allocate the total available computational budget to the successive SA iterations. The effort is devoted to solving the asymptotic version of this problem by finding the convergence rate of SA toward the optimizer, first as a function of the number of iterations and then as a function of the total computational effort. As a result the optimal rate of increase of the computational budget per iteration can be found. Explicit expressions for the case where the computational budget devoted to an iteration is a polynomial in the iteration number, and where the bias and variance of the gradient estimator are polynomials of the computational budget, are derived. Applications include the optimization of steady-state simulation models with likelihood ratio, perturbation analysis, or finite-difference gradient estimators; optimization of infinite-horizon models with discounting; optimization of functions of several expectations; and so on. Several examples are discussed. Our results readily generalize to general root-finding problems.
CCNA Routing and Switching Exam Prep with CD-ROM
Authors: Shawn McNutt, Jason Waters
Venue:  (2000)

:Includes the installation, configuration, and operation of simple-routed LAN, WAN, and switched LAN networks. Discusses remote access and integrating dial-up connectivity with traditional, remote LAN to LAN access, as well as supporting the high levels of performance required for new applications such as Internet commerce and multimedia. Demonstrates ways to optimize WAN through Internet solutions that reduce bandwidth and WAN cost.
Locally Adapted Tetrahedral Meshes Using Bisection
Authors: Douglas N. Arnold, Arup Mukherjee, Luc Pouly
Venue: SIAM Journal on Scientific Computing (2000)

We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The algorithm is based on bisection of tetrahedra. A new data structure is introduced, which simplifies both the selection of the refinement edge of a tetrahedron and the recursive refinement to conformity of a mesh once some tetrahedra have been bisected. We prove that repeated application of the algorithm leads to only finitely many tetrahedral shapes up to similarity, and we bound the amount of additional refinement that is needed to achieve conformity. Numerical examples of the effectiveness of the algorithm are presented.
Managing Projects with Microsoft Project '98: For Windows and MacIntosh, 1st edition
Authors: Gwen Lowery, Rob Ferrara
Venue:  (1997)

:Written by Microsoft(r) insiders, this concise guide leads you step by step through key project management stages, explores multiple ways to tailor Project '98 to your specific use and explains how to effectively manage multiple projects. Combining job-tested project management strategies and the full features of Microsoft(r) Project '98 this unique resource helps you schedule and manage every project on time and within budget.
Special Edition Using Macromedia Dreamweaver Ultradev 4
Venue:  (2001)

:Special Edition Using Macromedia Dreamweaver UltraDev 4 is the ideal reference to help readers understand the fundamentals of Web application development. Starting with step-by-step instruction on basic database fundamentals, the book progresses through more advanced concepts such as programming issues and extensions, guiding readers in developing efficient Web applications with minimal effort. This book provides beginning and more experienced readers alike with all of the information necessary to develop robust Web applications. 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
MCSE: Windows 2000 Server Exam Notes
Authors: Scott Johnson, Lisa Donald
Venue:  (2000)

:Approach the new MCSE 2000 exam with added confidence by reviewing with MCSE Exam Notes: Windows 2000 Server. Not a cram guide or cheat sheet, this innovative review guide provides objective-by-objective coverage of all the material you need to know for the exam, singling out critical information, outlining necessary procedures, identifying exam essentials, and providing sample questions. It's the perfect companion piece to the MCSE: Windows 2000 Server Study Guide.
Microsoft Office 2000 for Windows
Authors: Steve Sagman
Venue:  (1999)

:alone several at once. But get ready for Microsoft's long-awaited Office 2000, which packages the latest versions of all its most popular business apps, including Word, Excel, PowerPoint, Access, and Outlook. If you, like most people, don't have a lot of time and money to spend getting up to speed, you'll appreciate Microsoft Office 2000: Visual QuickStart Guide. Divided by Office application, the book guides you right to the information you need and covers all the most important tasks in each program with clear, step-by-step instructions, illustrated with hundreds of helpful screenshots. Office 2000 promises a wealth of exciting new features. Microsoft Office 2000: Visual QuickStart Guide lets you put them to work for you in a hurry.
Evaluation of the modified Bessel function of the third kind of imaginary orders
Authors: Amparo Gil, Javier Segura, Nico M. Temme
Venue: Journal of Computational Physics (2002)

The evaluation of the modified Bessel function of the third kind of purely imaginary order Kia(x) is discussed; we also present analogous results for the derivative. The methods are based on the use of Maclaurin series, nonoscillatory integral representations, asymptotic expansions, and a continued fraction method, depending on the ranges of x and a. We discuss the range of applicability of the different approaches considered and conclude that power series, the continued fraction method, and the nonoscillatory integral representation can be used to accurately compute the function Kia(x) in the range 0 ≤ a ≤ 200, 0 ≤ x ≤ 100; using a similar scheme the derivative K'ia(x) can also be computed within these ranges.
Running Microsoft Office 97 with Cdrom, 1st edition
Authors: Michael Halvorson, Michael Young
Venue:  (1998)

:Quickly find the information you need in this clear, comprehensive, one-volume answer book. You get everything from simple instructions to extensive guidance on every subject from integration to the Internet. Experience Level: Beginner/ Intermediate
Access 2002 Bible with CD-ROM
Authors: Cary N. Prague, Michael R. Irwin
Venue:  (2001)

:The most comprehensive all-in-one reference to the world's most popular database program! Packed with practical examples, advice, expanded coverage, and exclusive CD content, this book will contain over 1250 pages of examples, exercises, tips, techniques, workarounds, and more. The CD will feature exclusive Access software and source code created by the leading Access add-in company in the world. Readers can learn how to harness the power of Access's expressions, queries, controls and macros; design flexible databases using the proven 7-step method; create standard tables, forms, queries, and reports quickly with Access wizards. Experts in the field have praised previous editions, and this will be revised to come out with the new software release.
Intelligent Offices: Object-Oriented Multi-Media Information Management in Client/Server Architectures
Authors: Setrag Khoshafian, Razmik Abnous, A. Brad Baker, Kevin Shepherd
Venue:  (1992)

:Provides a practical intelligent office model which integrates many applications in order to create an object-oriented work flow model, integrated double imaging and distributed database access. Shows how these mature technologies can be connected by utilizing off-the-shelf open system software and hardware. Features fundamental imaging hardware for document imaging systems including compression boards, FAXboards, scanners, OCR along with integrating basic software concepts such as object orientation, full-text retrieval systems, graphic user interfaces, AI technologies and more.
Knowledge Driven Work: Unexpected Lessons from Japanese and United States Work Practices
Authors: Joel Cutcher-Gershenfeld, Michael Moore, Iwao Ishino, Michio Nitta, Nejib Belhedi, Simon S. Chow, Takashi Inaba, Wen-Jeng Lin, Betty Barrett
Venue:  (1998)

:Knowledge-Driven Work is a pioneering study of the cross-cultural diffusion of ideas about the organization of work. These ideas, linked with the knowledge of the work force, are rapidly becoming the primary source of competitive advantage in the world economy. The book provides an in-depth look at eight Japanese-affiliated manufacturing facilities operating in the United States, combined with examinations of their sister facilities in Japan. The authors offer their insights into the complex process by which elements of work systems in one country interact with those in another. They trace the flow of ideas from Japan to the United States and other nations, and the beginnings of a reverse diffusion of innovation back to Japan. The authors organize their findings into six categories: the cross-cultural diffusion of work practices, team-based work systems, kaizen and employee involvement, employment security, human resource management, and labor-management relations. Their study of team-based work systems yields a taxonomy of teams and reveals some conflicts between the desire for self-management and the existence of interdependencies.
Prime subprogram parsing of a program
Authors: Robert E. Tarjan, Jacobo Valdes
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

A parsing method based on the triconnected decomposition of a biconnected graph is presented. The parsing algorithm runs in linear time and handles a large class of flow graphs. The applications of this algorithm to flow analysis and to the automatic structuring of programs are discussed.
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver
Authors: Qun Chen, Michael C. Ferris
Venue: SIAM Journal on Optimization (2000)

We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers. The solver differs from previous parallel branch-and-bound codes by implementing a general purpose parallel mixed integer programming algorithm in an opportunistic multiple processor environment, as opposed to a conventional dedicated environment. It shows how to make effective use of resources as they become available while ensuring the program tolerates resource retreat. The solver performs well on test problems arising from real applications and is particularly useful for solving long running hard mixed integer programming problems.
A remote user authentication scheme using hash functions
Authors: Cheng-Chi Lee, Li-Hua Li, Min-Shiang Hwang
Venue: ACM SIGOPS Operating Systems Review (2002)

Recently, Peyravian and Zunic proposed a simple but efficient password authentication system. Their scheme is based on the collision-resistant hash function, such as SHA-1. Their scheme did not use any cryptosystems (such as DES, RSA, etc.). However, their scheme is vulnerable to guess attack. An attacker can easily obtain a user's password by guessing attack and then impersonate the user to login and access resources in the server. To overcome the vulnerability of their scheme, we propose an improved scheme to enhance security of their scheme in this article.
A+ Certification Training Kit with Cdrom, 2nd edition
Authors: Microsoft Corporation
Venue:  (2000)

:The A+ Certification program defines baseline knowledge and skill levels for IT professionals who support Intel-based personal computer hardware and software. As you build these real-world support skills, you're also preparing for the corresponding areas of the A+ Certification Core and Specialty exams -- making this kit your first step to career advancement! Here's what you'll learn: HARDWARE Installation, configuration, and upgrading Diagnosis and troubleshooting Safety and preventive maintenance Motherboard/processors/memory Printers Portable systems Basic networking MS-DOS/WINDOWS OPERATING SYSTEMS Function, structure, operation, and file management Memory management Installation, configuration, and upgrading Diagnosis and troubleshooting Networks
A Conjugate Duality Scheme Generating a New Class of Differentiable Duals
Authors: Aharon Ben-Tal, Marc Teboulle
Venue: SIAM Journal on Optimization (1996)

We construct a mechanism to generate a large class of duality schemes for (not necessarily differentiable) convex optimization problems, for which the dual problem is continuously differentiable. We use the conjugate duality framework of Rockafellar; the original primal problem is embedded in a family of perturbed problems. The perturbation function is constructed in terms of two perturbation vectors and a single-variable function $q$. The differentiability is a consequence of the dual objective function's being a kind of ``proximal regularization," but one which is expressed in terms of a {\em nonquadratic} regularizing term associated with the function $q$.
Lookahead revisited in wireless network simulations
Authors: Jason Liu, David M. Nicol
Venue: Proceedings of the sixteenth workshop on Parallel and distributed simulation (2002)

Rapid growth in wireless communication systems motivates the development of technology supporting the simulation of large-scale wireless systems. However, it is widely recognized that wireless communications do not have substantial "lookahead" needed by conservative synchronization protocols. This paper focuses on identifying and exploiting lookahead for such models. We find lookahead in three ways, exploiting characteristics of low power networks, the transceiver logic, and the way in which protocol stacks are typically constructed. We show how these observations allow a variety of conservative synchronization protocols to take advantage of lookahead, describe a synchronization method we use, and empirically examine the performance this method offers on a large-scale simulation of a sensor network intended for homeland defense scenarios
Official Small Soldiers: Squad Commander
Authors: Craig Wessel
Venue:  (1998)

:Think fast or get deactivated! Your mission is simple: lead your troopseither the Commando elite or the noble Gorgonitesto victory. Based on the film, Small Soldiers is an action/strategy game for kids. Players choose to control either the mighty Commandos or the noble Gorgonites in up to 20 challenging, non-linear missions.Fun and intricate puzzles are layered within each mission. The game features upgradable weapons, bonus artillery and special power gadgetts. Stunning graphics, dynamic music and kid-friendly design. BradyGames Small Soldiers strategy guide will include maps for every mission. Complete walkthroughs and cheats. How to defeat all the Gorgonites and Commandos, plus character bios of each one.
A macromodular graphics system for protein structure research
Authors: John M. Fritsch, Robert A. Ellis, Thomas H. Jacobi, Garland R. Marshall
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

A specialized graphics system has been developed for protein research; this system achieves real-time display and manipulation for line-segment models containing up to 4095 end points. The hardware consists of three components: 1) a collection of hardware subroutines assembled from digital computer building blocks called macromodules, 2) vector-matrix transformation and display equipment and 3) a small stored-program computer. This paper provides a general description of the system.
MCSETraining Guide: Internet Information Server 4, 2nd edition
Authors: David Bixler
Venue:  (1999)

:This book will be the second edition of MCSE Training Guide: Internet Information Server 4 and it will complete a set of second edition Training Guides for the MCSE track. The first edition has sold well. This was the first book published to include a simulation of the IIS product – a real coup because product simulations represented 20% of the IIS 4.0 exam, and a brand new question type from Microsoft. This edition will cover the exam's product simulations in much more detail, and prepare the reader with real-world detail and experience to reinforce the training concepts within the chapters. The new elements of the Training Guide will round out the second edition to provide the most technologically and pedagogically sophisticated product on the market today.
Computationally Sound Proofs
Authors: Silvio Micali
Venue: SIAM Journal on Computing (2000)

This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random oracle or a new complexity assumption, they enable us to prove that verifying is easier than deciding for all theorems; provide a quite effective way to prove membership in computationally hard languages (such as ${\cal C}o$-$\cal N \cal P$-complete ones); and show that every computation possesses a short certificate vouching its correctness. Finally, if a special type of computationally sound proof exists, we show that Blum's notion of program checking can be meaningfully broadened so as to prove that $\cal N \cal P$-complete languages are checkable.
Mcdba SQL Server 7 Database Design,Study Guide (Exam 70-29), 1st edition
Authors: Syngress Media Inc.
Venue:  (1999)

:Pass the MCDBA SQL Server 7 exam and upgrade your career The database administrator who passes exam 70-29 achieves Microsoft Certified Professional status u and opens the door to a flourishing career. Syngress Media's MCDBA SQL Server 7 Database Design Study Guide (Exam 70-29) delivers deep insight into SQL 7 along with complete coverage of official certification objectives. Providing critical information that's easy-to-digest with an eye on exam preparation,it's a complete study package that you can entrust your career to. Here's what you get:*Over 250 practice exam questions*CD-ROM with exclusive test yourself exam software,detailed score analysis,timed live exams,and expert answers. *Special exam watch warnings based on post-exam research*Hands-on drills emphasizing skills likely to be on the exam*Certification summaries that offer to-the-point review of important information Don't Let the Real Test Be Your First Test! Prepare to pass the MCDBA/MCSE SQL Server 7 Database Design exam - while gaining practical knowledge of Microsoft's relational database technology for on-the-job success. Built on the proven training methodology of Global Knowledge,this complete study guide and CD-ROM package offers actual classroom techniques used by more than 200,000 IT professionals each year. The MCDBA SQL Server 7 Database Design Study Guide covers the topics you need to review for the exam,including how to: Group data into entities by applying normalization rules. Choose the foreign key that will enforce a relationship between entities and will ensure referential integrity. Assess the potential impact of the logical design onperformance,maintaining,extensibility,scalability,availability,and security. Create and manage explicit,implicit,and distributed transactions to ensure data consistency and recoverability. Write INSERT,DELETE,UPDATE,and SELECT statements that retrieve and modify data. Create scripts using Transact-SQL. Programming elements include control-of-flow methods,local and global variables,functions,and error-handling methods. Create result sets that provide summary data. Query types include TOP n PERCENT and GROUP BY,specifically HAVING,CUBE,and ROLLUP. Create and manage files,file groups,and transaction logs that define a database. Populate the database with data from an external data source. 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