ppxscal/embedding_network huggingface dataset:
Computational explorations into the dynamics of rings of coupled oscillators
Authors: Hubertus F. von Bremen, Firdaus E. Udwadia
Venue: Applied Mathematics and Computation (2002)

This paper deals with the response of homogeneous and inhomogeneous rings of coupled oscillators where each individual oscillator, when uncoupled from the others, is chaotic. It is shown that coupling can bring about a wide variety of global responses, and that there is a significant range of coupling values when the response of the ring is periodic despite the fact that each oscillator is chaotic. In fact numerous periodic solutions can be found depending on the initial conditions. The response of a coupled set of homogeneous and non-homogeneous rings is also investigated showing that the behavior of such coupled compartmental models can be quite counterintuitive and sensitive to the parameters that describe the extent and nature of coupling.
Sim City 3000 Strategies and Secrets (Unofficial), 1st edition
Authors: Daniel A. Tauber, Brenda Kienan
Venue:  (1999)

:"SimCity 2000 Strategies & Secrets" sold close to 100,000 copies. SimCity 3000 is the third major release of the game, incorporating the latest 3D graphics technology and running "mini-simulations" within the simulation. This new book covers all the new features of the game, including multi-player capabilities.
Optimize Your Operation
Authors: James C. Abbott
Venue:  (2001)

:Though the term sounds general, operational optimization actually consists of several clearly defined tools that must be used together to be successful. Product and process analysis, mental Division of Labor, and knowledge base building must all be properly applied to yield increased profitability, improvements in product quality, and a more robust knowledge base. Optimize Your Operation presents these vital tools using entertaining, easy-to-understand stories that speed the learning process. These stories encompass the lessons that will allow a businessperson to radically improve a department, a division, or an entire company. Optimize Your Operation is based on the authors popular Manager of the Future seminars. His successful lesson within a story approach has helped Fortune 100 companies throughout North and South America to improve their products, increase their profits, and to remain competitive in quickly shifting markets.
Inside MacIntosh, 1st edition
Authors: Apple Computer Inc Staff, Apple Computer Inc.
Venue:  (1993)

:Inside Macintosh: Networking describes how to write software that uses any of the AppleTalk networking protocols. You need this book if you want to write an application specifically designed to use AppleTalk, and AppleTalk network server, or a new networking protocol that is a client of any of the AppleTalk protocols. This book will also enhance your understanding of Macintosh communications and collaborative computing products such as the Communications Toolbox and the PPC Toolbox. Inside Macintosh: Networking covers the following topics in detail: The components and organization of AppleTalk how to select and AppleTalk protocol application interface to all AppleTalk protocols, including Name-Binding Protocol (NBP), Datagram Delivery Protocol (DDP), AppleTalk Transaction Protocol (ATP), Zone Information Protocol (ZIP), AppleTalk Session Protocol (ASP), AppleTalk Filing Protocol (AFP), and AppleTalk Data Stream Protocol (ADSP) the Link Access Protocol (LAP) Manager the .ENET driver and Ethernet protocol handlers Because all AppleTalk protocols are implemented as device drivers, to use this book you should be familiar with the Device Manger, which is described in Inside Macintosh: Devices. If you want to design your own protocol to work with the AppleTalk protocols or if you want to implement an AppleTalk protocol on a non-Macintosh platform, you should also consult Inside AppleTalk.
Set association analysis of SNP case-control and microarray data
Authors: Jurg Ott, Josephine Hoh
Venue: Proceedings of the sixth annual international conference on Computational biology (2002)

Common heritable diseases ("complex traits") are assumed to be due to multiple underlying susceptibility genes. While genetic mapping methods for mendelian disorders have been very successful, the search for genes underlying complex traits has been difficult and often disappointing. One of the reasons may be that most current gene mapping approaches are still based on conventional methodology of testing one or a few SNPs at a time. Here we demonstrate a simple strategy that allows for the joint analysis of multiple disease-associated SNPs in different genomic regions. Our set-association method combines information over SNPs by forming sums of relevant single-marker statistics. This approach successfully addresses the "curse of dimensionality" problem - too many variables should be estimated with a comparatively small number of observations. We also extend our method to microarray expression data, where expression levels for large numbers of genes should be compared between two tissue types. In applications to experimental expression data our approach turned out to be highly efficient.
Security of runtime extensible virtual environments
Authors: Ernesto J. Sallés, James Bret Michael, Michael Capps, Don McGregor, Andrzej Kapolka
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

Distributed, real-time virtual environment (VE) architectures have traditionally been driven by quality of service (QOS) considerations, with little or no concern paid to security issues. With recent advancements in functionality, computing power and network bandwidth it has become practical to use VEs in sensitive areas such as product development with proprietary information and visualization of classified information. Consequently, previously ignored aspects of security need to be made a primary concern at the outset of designing a VE. In this paper we explore security concerns associated with a subtype of VEs: Runtime Extensible VEs (RTEVEs). We introduce a taxonomy of security issues, derived from a case study of NPSNET-V, with the goal of using this taxonomy to guide the formulation of security policy, requirements, and architectures for RTEVEs.
On Covering a Bipartite Graph with Cycles
Authors: Hong Wang
Venue: SIAM Journal on Discrete Mathematics (2002)

We conjectured in [H. Wang, Australas. J. Combin., 19 (1999), pp. 115--121] that, for each integer $k\geq 2$, there exists N(k) such that if G=(V1,V2;E) is a bipartite graph with $|V_1|=|V_2|=n\geq N(k)$ and d(x)+d(y)\geq n+k$ for each pair of nonadjacent vertices x and y of G with $x\in V_1$ and $y\in V_2$, then for any k independent edges e1, . . ., ek of G, there exist k vertex-disjoint cycles C1, . . . ,Ck in G such that $e_i\in E(C_i)$ for all $i\in\{1,\ldots ,k\}$ and $V(C_1\cup\cdots \cup C_k)=V(G)$. This conjecture is also verified for k=2 in [H. Wang, Australas. J. Combin., 19 (1999), pp. 115--121]. We prove this conjecture for k=3 in this paper.
GroupMorph:: a group collaboration mode approach to shared 3D virtual environments for product design
Authors: John M. Linebarger, G. Drew Kessler
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

Virtual reality technology is increasingly being applied to globally distributed teams engaged in collaborative product design. Observations of product design teams have suggested at least four distinct modes of collaboration-complementary, competitive, peer-to-peer, and leader-follower. Another insight from observation is that collaboration consists of fluid transitions between these modes in the accomplishment completion of the design task, driven by a flexible process of subgrouping and regrouping which reflects the structure and progress of the task. Yet most collaborative virtual environment systems support only one mode of collaboration-peer-to-peer-and those that do explicitly support multiple modes (or even individual roles) do not allow fluid transitions between them in the context of the same task. In addition, no explicit support is provided to allow subgroups to be formed and dissolved. To address this problem, a collaborative virtual environment (CVE) for product design that supports multiple collaboration modes and fluid transitions is proposed; two metaphors for collaborative product design (collaboration tree and infinitely recursive conference room) are introduced; the use of a collaboration tree interface widget is detailed; and the Simple Shared Virtual Environment (SSVE) toolkit for collaborative virtual environments is described.
Non-blocking timeout in scalable queue-based spin locks
Authors: Michael L. Scott
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

Queue-based spin locks allow programs with busy-wait synchronization to scale to very large multiprocessors, without fear of starvation or performance-destroying contention. Timeout-capable spin locks allow a thread to abandon its attempt to acquire a lock; they are used widely in real-time systems to avoid overshooting a deadline, and in database systems to recover from transaction deadlock and to tolerate preemption of the thread that holds a lock.In previous work we showed how to incorporate timeout in scalable queue-based locks. Technological trends suggest that this combination will be of increasing commercial importance. Our previous solutions, however, require a thread that is timing out to handshake with its neighbors in the queue, a requirement that may lead to indefinite delay in a preemptively multiprogrammed system.In the current paper we present new queue-based locks in which the timeout code is non-blocking. These locks sacrifice the constant worst-case space per thread of our previous algorithms, but allow us to bound the time that a thread may be delayed by preemption of its peers. We present empirical results indicating that space needs are modest in practice, and that performance scales well to large machines. We also conjecture that constant per-thread space cannot be guaranteed together with non-blocking timeout in a queue-based lock.
Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations, 1st edition
Authors: Uri M. Ascher, Linda R. Petzold
Venue:  (1998)

:Designed for those people who want to gain a practical knowledge of modern techniques, this book contains all the material necessary for a course on the numerical solution of differential equations. Written by two of the field's leading authorities, it provides a unified presentation of initial value and boundary value problems in ODEs as well as differential-algebraic equations. The approach is aimed at a thorough understanding of the issues and methods for practical computation while avoiding an extensive theorem-proof type of exposition. It also addresses reasons why existing software succeeds or fails. This book is a practical and mathematically well informed introduction that emphasizes basic methods and theory, issues in the use and development of mathematical software, and examples from scientific engineering applications. Topics requiring an extensive amount of mathematical development, such as symplectic methods for Hamiltonian systems, are introduced, motivated, and included in the exercises, but a complete and rigorous mathematical presentation is referenced rather than included. Audience This book is appropriate for senior undergraduate or beginning graduate students with a computational focus and practicing engineers and scientists who want to learn about computational differential equations. A beginning course in numerical analysis is needed, and a beginning course in ordinary differential equations would be helpful. About the Authors Uri M. Ascher is a Professor in the Department of Computer Science at the University of British Columbia, Vancouver. He is also Director of the Institute of Applied Mathematics there. Linda R. Petzold is a Professor in the Departments of Mechanical and Environmental Engineering and Computer Science at the University of California at Santa Barbara. She is also Director of the Computational Science and Engineering Program there.
Acoustics and Psychoacoustics, 2nd edition
Authors: David M. Howard, James Angus
Venue:  (2000)

:Acoustics and Psychoacoustics is a comprehensive book designed to provide a broad-ranging introduction to the subject of acoustics including the principles of human perception of sound, sometimes called psychoacoustics. It is ideal for students of music technology, sound recording, traditional music and acoustics, as well as engineers studying audio, multi-media and communications systems, and is geared very much towards those who want a practical understanding of how real musical sounds behave and are perceived in real spaces. It will also help those who need to use acoustics principles in the design of equipment, instruments and rooms and it will benefit those who make recordings. Whilst introducing all of the main fundamentals the text is easy to read and avoids non-essential mathematics. It is written for engineers, musicians and students, and there are plenty of worked examples for study.
Digital Video for Dummies, 1st edition
Authors: Idg Publishing, Dummies Tech Press
Venue:  (1996)

:"Digital Video For Dummies" helps professionals and consumers find the equipment that suits their needs, create a quality production, and edit using Adobe Premiere 5, a top digital editing tool. The CD-ROM contains a selection of sample videos and software, including a demo suite of Premiere, AfterEffects, and Photoshop. There is also a music library available for use with finished digital videos.
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
Authors: Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting
Venue: SIAM Journal on Computing (2000)

We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n1.5 log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our algorithm allows the input trees to be mixed trees, i.e., trees that may contain directed and undirected edges at the same time. Our algorithm adopts a recursive strategy exploiting a technique called label compression. The backbone of this technique is an algorithm that computes the maximum weight matchings over many subgraphs of a bipartite graph as fast as it takes to compute a single matching.
Compressibility and Resource Bounded Measure
Authors: Harry Buhrman, Luc Longpré
Venue: SIAM Journal on Computing (2002)

We give a new definition of resource bounded measure based on compressibility of infinite binary strings. We prove that the new definition is equivalent to the one commonly used. This new characterization offers us a different way to look at resource bounded measure, shedding more light on the meaning of measure zero results and providing one more tool to prove such results. The main contribution of the paper is the new definition and the proofs leading to the equivalence result. We then show how this new characterization can be used to prove that the class of linear autoreducible sets has p- measure 0. We also prove that the class of sets that are truth-table reducible to a p-selective set has p-measure 0 and that the class of sets that Turing reduce to a subpolynomial dense set has p-measure 0. This strengthens various results.
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
Authors: Jianer Chen, Antonio Miranda
Venue: SIAM Journal on Computing (2002)

Recently, there have been considerable interests in the multiprocessor job scheduling problem, in which a job can be processed in parallel on one of several alternative subsets of processors. In this paper, a polynomial time approximation scheme is presented for the problem in which the number of processors in the system is a fixed constant. This result is the best possible because of the strong NP-hardness of the problem and is a significant improvement over the past results: the best previous result was an approximation algorithm of ratio $7/6 + \epsilon$ for 3-processor systems based on Goemans's algorithm for a restricted version of the problem.
WebMaster in a Nutshell, 3rd edition
Authors: Stephen Spainhour, Robert Eckstein
Venue:  (2002)

:WebMaster in a Nutshell takes all the essential reference information for the Web and pulls it together into one slim volume. This book is a quick reference for anyone who works on the Web - content providers, programmers, and administrators alike. WebMaster in a Nutshell covers HTML 3.2, the markup language for Web documents; CGI, for creating interactive content on the Web; JavaScript, a scripting language that can be embedded directly into HTML to make interactive Web page; HTML extensions from Netscape Navigator 3.0 and Microsoft Internet Explorer 3.0; examples and descriptions of the HTML tags for creating frames, tables, and fill-in forms; HTTP 1.1, the underlying protocol that drives the Web; configuration for the Apache, NCSA, CERN, Netscape, and Website servers; Perl 5, the programming language used most often for CGI; WinCGI, the CGI interface for Windows-based programming languages; Cookies, for maintaining state between multiple HTTP transactions ; and Server Side Includes, for embedding dynamic data into Web pages. WebMaster in a Nutshell breaks up these topics into concise, distinct chapters, designed to make it easy to find the information you want at a moment's notice.
Programming and Deploying Java Mobile Agents Aglets, 1st edition
Authors: Danny B. Lange, Oshima Mitsuru
Venue:  (1998)

:Java aglets, the next huge wave of internet development are lightweight mobile agents that enable the autonomous execution of programs on remote heterogeneous hosts. Because Java aglets automate many of the processes users must now perform manually, the technology is poised to transform the way many users interact with the internet. Written by the creators of the technology, this book gives you the knowledge and skills you need to create Java aglets using IBM's Aglets Software Development Kit. Practical in focus, the book features numerous real-world examples of Java code that illustrate concepts and demonstrate Java aglets in action. Geared for Java programmers with no previous agent experience, the book presents a clear introduction to mobile agents that explains the basic conceptual model, agent behavior, the creation and disposal of agents, and agent transfer over a network.
Apache Pocket Reference, 1st edition
Authors: Andrew Ford
Venue:  (1999)

:Apache is far and away the most widely used Web server platform in the world, running on Windows NT as well as UNIX and other platforms. It powers about half of the world's existing Web sites and is still increasing market share. Apache also forms the basis of a number of commercial Web servers, such as IBM HTTP Server powered by Apache and C2Net's Stronghold. Apache is at the leading edge of Web server development with many new technologies being implemented first. Apache has a flexible architecture that allows independent developers to add their own functionality by way of modules, written either in C or, with the advent of mod_perl, also in Perl. The Apache Pocket Reference, a companion volume to Writing Apache Modules with Perl and C and Apache: The Definitive Guide, 2nd Edition, covers Apache 1.3.12. It provides a complete overview of the command-line options, configuration directives, and modules, and covers Apache support utilities.
Optical Character Recognition, 1st edition
Authors: Shunji Mori, Hirobumi Nishida, Hiromitsu Yamada
Venue:  (1999)

:Optical Character Recognition (OCR) has become an important and widely used technology. Among its many practical applications are the scanners used at store check-out counters, money changing machines, office scanning machines, and the efforts to automate the postal system. Research is particularly active in Japan where one important goal is to develop economical machines that can read Kanji characters. Such machines will be widely used in offices as man-machine interfaces. Dr. Mori from the Ricoh R&D Center in Japan has used his experience in optical character recognition to create a thorough reference to this widely used but still growing technology.
NetScape Navigator Gold 3 (Laura Lemay's Web Workshop), 3rd edition
Authors: Laura Lemay, Ned Snell
Venue:  (1997)

:Laura Lemay's Web Workshop: Netscape Navigator Gold 3, Deluxe Edition is a compilation of individual workshops that teach you only what you need to learn. Just turn to the chapter on that subject, complete the workshop, and you're done! Each workshop is written in the popular, easy-to-understand style of best-selling author Laura Lemay. You'll learn how to make the Netscape wizards do your dirty work, use the Netscape editor, make frames, embed multimedia, build tables, use JavaScript, publish Web documents, and more!
An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3
Authors: H. Tapia-Recillas, G. Vega
Venue: Designs, Codes and Cryptography (2001)

The difficulty involved in characterizing the weight distribution of all Boolean functions of degree {\geq} 3 is well-known [2, p. 446]. In [1] the author introduces a transformation on Boolean functions which changes their weights in a way that is easy to follow, and which, when iterated, reduces the degree of the function to 2 or 3. He concludes that it is just as difficult to characterize the weight of any function of degree 3 as it is for any other degree. The application of this transformation on a Boolean function defined on V_m = GF(2)^m, m \in \Bbb{N}, increases the number of its variables by two. On the other hand, in order to reduce the degree of a function to 2 or 3 it is necessary to apply the tranformation a number of times that grows exponentially with respect to m. In this paper, a factorization method on Boolean functions that allows the establishment of an upper bound for the number of applications of the transformation is presented. It shows that, in general, it is possible to significantly decrease the number of iterations in this process of degree reduction.
Love in 5-D Stereograms
Authors: Susan Polis. Schutz
Venue:  (1994)

:What is a 5-D Stereogram? A stereogram is a computer-generated image that "pops out" of the paper as if it were a Multi-Dimensional object. In order to see this image, however, the stereogram must be viewed in a certain way. How do you see the hidden 5-D stereogram image? Hold the art close to your nose so that it appears blurry. Relax and stare at it. Make believe you are looking "through" the art. Slowly move it away from your face until an image "pops out" and becomes perfectly clear. The time it takes to see the image can vary, so donÆt get impatient! Each page of the artwork has a hidden image in it, accompanied by a poem. Experience a truly astounding form of interactive art!