ppxscal/embedding_network huggingface dataset:
Convergence Analysis of a Transmission Algorithm for Convection-Diffusion Problems
Authors: M. Tidriri
Venue: SIAM Journal on Numerical Analysis (2002)

We prove the convergence of the transmission time marching algorithm for the $\beta$--monoscale-multimodel methods for hydrodynamics-type problems. Our analysis is based on the author's transmission multiplier method we introduced in [C. R. Acad. Sci. Paris Sér. I Math., 328 (1999), pp. 637--642] and the local, global, and trace estimates we developed in [J. Math. Anal. Appl., 229 (1999), pp. 137--157; Abstr. Appl. Anal., 3 (2001), pp. 131--150].
On cyclically embeddable (n,n-1)-graphs
Authors: Mariusz Wozniak
Venue: Discrete Mathematics (2002)

An embedding of a simple graph G into its complement G is a permutation σ on V(G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n,n-1)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
A probabilistic approach to the descent statistic
Authors: Richard Ehrenborg, Michael Levin, Margaret A. Readdy
Venue: Journal of Combinatorial Theory Series A (2002)

We present a probabilistic approach to studying the descent statistic based upon a two-variable probability density. This density is log concave and, in fact, satisfies a higher order concavity condition. From these properties we derive quadratic inequalities for the descent statistic. Using Fourier series, we give exact expressions for the Euler numbers and the alternating r-signed permutations. We also obtain a probabilistic interpretation of the sin function.
Using Microsoft Excel 2000, 1st edition
Authors: Julia Kelley, Julia Kelly
Venue:  (1999)

:Using Microsoft Excel 2000 is structured in content and approach to fill the needs of the intermediate user, showing you how to get a task done and get on with your job. It provides enough information to be a through reference for all but the most advanced users while not intimidating newer users. This book brings you real-world, practical content that can not only increase the ability to use the software, but also increase your actual productivity level.
Nine Ways to Implement the Binomial Method for Option Valuation in MATLAB
Authors: Desmond J. Higham
Venue: SIAM Review (2002)

In the context of a real-life application that is of interest to many students, we illustrate how the choices made in translating an algorithm into a high-level computer code can affect the execution time. More precisely, we give nine MATLAB programs that implement the binomial method for valuing a European put option. The first program is a straightforward translation of the pseudocode in Figure 10.4 of The Mathematics of Financial Derivatives, by P. Wilmott, S. Howison, and J. Dewynne, Cambridge University Press, 1995. Four variants of this program are then presented that improve the efficiency by avoiding redundant computation, vectorizing, and accessing subarrays via MATLAB's colon notation. We then consider reformulating the problem via a binomial coefficient expansion. Here, a straightforward implementation is seen to be improved by vectorizing, avoiding overflow and underflow, and exploiting sparsity. Overall, the fastest of the binomial method programs has an execution time that is within a factor 2 of direct evaluation of the Black--Scholes formula. One of the vectorized versions is then used as the basis for a program that values an American put option. The programs show how execution times in MATLAB can be dramatically reduced by using high-level operations on arrays rather than computing with individual components, a principle that applies in many scientific computing environments. The relevant files are downloadable from the World Wide Web.
Lower bounds for some decision problems over C
Authors: Gregorio Malajovich
Venue: Theoretical Computer Science (2002)

Lower bounds for some explicit decision problems over the complex numbers are given. The decision problems considered are certain zero-dimensional subsets of NC, and can be assimilated to a countable family of polynomials gi. More precisely, one should decide for input (i,x) if gi(x)=0. A lower bound for deciding if a polynomial gi vanishes at some x can be derived from a uniform lower bound for the evaluation of all f(gi). That bound is obtained by means of an arithmetic invariant of the roots of gi, the Newton diagram of f and other known techniques.
Intranets, Extranets and Strategic Alliances: The Weaving of Cyberteams
Authors: Peter Lloyd, Paula Lloyd
Venue:  (1998)

:This guide illustrates the benefits and pitfalls of using technology to enhance internal and external connections and brings together a number of the hottest subjects in IT and Organizational Development using contributions from leading thinkers and practitioners in both areas.
Filemaker Pro 4.0: A Developer's Guide, 2nd edition
Authors: Alex Kennedy
Venue:  (1999)

From the Book:PREFACE: This book has been completely revised to provide detailed coverage of the latest release of FileMaker Pro, versions 4.0 and 4.1 which is a fully relational database management system available for the Apple Macintosh and the Windows 95 and Windows 98 operating system for PCIs. This book begins with an introduction to the basic concepts and ideas behind relational theory. It progresses to consider the issues involved in building a successful relational database. The emphasis here is on data modelling and how to ensure that the database model that you use is the most appropriate for your requirements. The second part of this book is a comprehensive description of the features of FileMaker Pro 4.0 and 4.1. It focuses on a range of issues that developers and experienced users alike may encounter and highlights the ways in which FileMaker Pro 4.x provides a number of different approaches to solving problems that may arise. The book is best read while working with FileMaker Pro 4.x so that you can try out some of the ideas and examples included on the accompanying CD-ROM and see the results for yourself. I have done my best to ensure that all examples work, but if you do come across any problems, please contact the publisher. When you have read this book, you will be able to develop successful FileMaker Pro 4.x databases and be familiar enough with the software to be able to discover four yourself what is not explicitly included in the text. As your knowledge and experience grow, you may continue to use the book as a reference source on particular topics. What is important is that I have not attempted to describe every single commandexhaustively,nor every method of manipulating data in FileMaker Pro. DonIt forget that FileMaker Pro offers a rich and rewarding development environment and there is always more than one route to solve any given problem. 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
Eigenstructures of spatial design matrices
Authors: David J. Gorsich, Marc G. Genton, Gilbert Strang
Venue: Journal of Multivariate Analysis (2002)

In estimating the variogram of a spatial stochastic process, we use a spatial design matrix. This matrix is the key to Matheron's variogram estimator. We show how the structure of the matrix for any dimension is based on the one-dimensional spatial design matrix, and we compute explicit eigenvalues and eigenvectors for all dimensions. This design matrix involves Kronecker products of second order finite difference matrices, with cosine eigenvectors and eigenvalues. Using the eigenvalues of the spatial design matrix, the statistics of Matheron's variogram estimator are determined. Finally, a small simulation study is performed.
Locking and Restarting Quadratic Eigenvalue Solvers
Authors: Karl Meerbergen
Venue: SIAM Journal on Scientific Computing (2000)

This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from finite-element simulations in acoustics. One approach is the shift-and-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or deflation of converged eigenvectors (or Schur vectors). In order to avoid unlimited growth of the subspace dimension, one can restart the method by purging unwanted eigenvectors (or Schur vectors). Both locking and restarting use the partial Schur form. The disadvantage of this approach is that the dimension of the linearized problem is twice that of the quadratic problem. The quadratic residual iteration and Jacobi--Davidson methods directly solve the quadratic problem. Unfortunately, the Schur form is not defined, nor are locking and restarting. This paper shows a link between methods for solving quadratic eigenvalue problems and the linearized problem. It aims to combine the benefits of the quadratic and the linearized approaches by employing a locking and restarting scheme based on the Schur form of the linearized problem in quadratic residual iteration and Jacobi--Davidson. Numerical experiments illustrate quadratic residual iteration and Jacobi--Davidson for computing the linear Schur form. It also makes a comparison with the shift-and-invert Arnoldi method.
Gendered Cyborg: Reader
Authors: Gill Kirkup, Linda Janes, Kathryn Woodward
Venue:  (1999)

:The Gendered Cyborg brings together material from a variety of disciplines that analyze the relationship between gender and technoscience, and the way that this relationship is represented through ideas, language and visual imagery. The book opens with key feminist articles from the history and philosophy of science. They look at the ways that modern scientific thinking has constructed oppositional dualities such as objectivity/subjectivity, human/machine, nature/science, and male/female, and how these have constrained who can engage in science/technology and how they have limited our ideas of the possibilities for both humanity and science.Later sections contain readings that present key feminist theories about representation to examine how gender and technoscience are represented in areas of particular contemporary interest: the new human reproductive technologies, science fiction, film and the Internet. The readings constantly ask "Is this for women, for human beings?" Contributors: Alison Adam, Anne Balsamo, Lynda K. Bundtzen, Barbara Creed, Mary Ann Doane, Dion Farquhar, Jennifer Gonzalez, Evelynn M. Hammonds, Donna Haraway, Fiona Hovenden, Luce Irigaray, Linda Janes, Gill Kirkup, Nina Lykke, Sadie Plant, Rosalind Pollack Perchesky, Londa Schiebinger, Vivian Sobchack, Deborah Lynn Steinberg, Nancy Leys Stepan, Nina Wakeford, Kathryn Woodward.
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Authors: John A. Stankovic, Krithi Ramamritham, Marco Spuri
Venue:  (1998)

:Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed especially for the more complicated situations where mathematical analysis is difficult. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing.
Recursive space decompositions in force-directed graph drawing algorithms
Authors: K. J. Pulo
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

Force-directed graph drawing algorithms are a popular method of drawing graphs, but poor scalability makes them unsuitable for drawing large graphs. The FADE paradigm uses the proximity information in recursive space decompositions to address this problem and that of high visual complexity. The FADE paradigm has been presented with a simple and common recursive space decomposition known as the quadtree. However, quadtrees have the disadvantage of not being robust with respect to small perturbations and some transformations of the input data, and this can adversely affect the resultant graph drawing. This paper investigates the FADE paradigm using an alternative recursive space decomposition known as the recursive voronoi diagram, which avoids some of the problems found in quadtrees at an additional time complexity cost. Preliminary results with random graphs and graphs in the domain of software engineering are presented and suggest that using better recursive space decompositions has promise, but the additional computational effort may not be easily justified.
Fundamentals of Data Structures in C
Authors: Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed
Venue:  (1992)

:Designed to function as a textbook or as a professional reference, Fundamentals Of Data Structures In C provides in-depth coverage of all aspects of data structure implementation in ANSI C. This book goes beyond the standard fare of Stacks, Queues, and Lists to offer such features as full chapter on Search Structures and a discussion of Advanced Tree Structures.
Beyond the Dot.Coms: The Economic Promise of the Internet
Authors: Robert E. Litan, Alice M. Rivlin
Venue:  (2001)

:In the few years since its public launching, the Internet has proved to be a cheap, convenient, quick, and flexible means of communication for millions of people engaged in all kinds of activities. In the late 1990s the media predicted that information technology (IT) and the Internet would create a new economy in which incomes would grow, stock values would soar, and recessions would be mild and infrequent. Confidence in the future of electronic commerce produced an explosion of new companies -- dot.coms -- that attracted optimistic investors and turned young entrepreneurs into instant millionaires, at least on paper. Skeptics urged caution, but confidence in the future of the Internet ran high, and the stocks of dot.com companies soared -- for a time. Then the bubble burst. Investors lost confidence in Internet companies with vague prospects but no profits. Dot.com stocks plummeted, and many went bankrupt. Skeptics crowed, and some voices predicted prolonged distress in the world economy caused by the Internet bust in the United States. In these pages, two leading economists look beyond the dot.coms to examine the Internet's true impact on the economy. By focusing on its potential effect on productivity growth across a wide range of existing "old economy" sectors, Robert Litan and Alice Rivlin predict that the impact of the Internet revolution is likely to be positive, significant, and sustained. The book draws on the work of the Brookings Task Force on the Internet, a group of experts from leading business schools and universities. Their findings suggest that the most significant impact of the Internet revolution will be felt not in e-commerce, but in productivity enhancements that lower transaction costs and improve efficiency in businesses such as automobile manufacturing and sales, general manufacturing, education, financial services, government, health care, retailing, and trucking. The resulting productivity growth could translate into significantly higher average living standards for consumers over the next five years. Litan and Rivlin also envision economic benefits that will not show up in productivity statistics -- such as increased convenience, a wider range of choices, and the opportunity to acquire products customized to their specifications. They conclude that it is a mistake to equate the benefits of the Internet with the economic health of the dot.coms, and they see far more light than darkness in the years ahead.
The New Book of Space
Authors: Robin Scagell
Venue:  (1997)

:Is there life on Mars? What can powerful new telescopes tell us about stars? Blast off into the galaxies for a high-tech look at the latest missions and discoveries in space exploration. Full color illustrations & photos.
Windows NT Registry: A Setting Reference
Authors: Sandra Osborne
Venue:  (1998)

:More than a simple troubleshooting or optimization book, this solutions-driven guide shows you how to manage hardware, Windows NT Workstation and other clients, notebook computers, application software, and Internet settings in the most efficient and cost-effective manner possible. If you're a network developer, system engineer, server administrator, or workstation technician, you'll come to rely on the expert advice contained in this comprehensive reference.
Communications Policy and Information Technology: Promises, Problems, Prospects
Authors: Lorrie Faith Cranor, Shane M. Greenstein
Venue:  (2002)

:New technologies, although developed with optimism, often fall short of their predicted potential and create new problems. Communications technologies are no different. Their utopian proponents claim that universal access to advanced communications technologies can help to feed the hungry, cure the sick, educate the illiterate, improve the global standard of living, and ultimately bring about world peace. The sobering reality is that while communications technologies have a role to play in making the world a better place, the impact of any specific technological advance is likely to be modest. The limitations of new technologies are often not inherent in the technologies themselves but the result of regulatory or economic constraints. While the capability may exist to deliver any information anywhere in the world, many people lack the money to pay for it, the equipment to access it, the skills to use it, or even the knowledge that it might be useful to them. This book examines the complex ways in which communication technologies and policies affect the people whose lives they are intended to improve. The areas of discussion include Internet regulation, electronic voting and petitioning, monopoly and competition in communications markets, the future of wireless communications, and the concept of universal service.
Designing Campus Networks
Authors: Terry Quinn-Andry, Kitty Haller
Venue:  (1998)

:This practical, thoroughly illustrated text looks at network design criteria both individually and integrated into a local area network. Contemporary challenges facing network designers are covered, including traffic patterns, types, and prioritization; security, redundancy, and scalability. Then, network blueprints which incorporate all these challenges, in varying degrees, are presented. Network designers can scale and adjust these blueprints to accommodate the unique mix of design criteria for their particular networks.
A Low-Cost Fault-Tolerant Structure for the Hypercube
Authors: Dajin Wang
Venue: The Journal of Supercomputing (2001)

We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors and extra links. The target of the proposed structure is to fully tolerate the first faulty node, no matter where it occurs, and &ldquo;almost fully&rdquo; tolerate the second, meaning that the underlying hypercube topology can be resumed if the second faulty node occurs at most locations&mdash;expectantly 92% of locations. The unique features of our structure are that (1) it utilizes the unused extra link-ports in the processor nodes of the hypercube to obtain the proposed topology, so that minimum extra hardware is needed in constructing the fault-tolerant structure and (2) the structure's node-degrees are low as desired&mdash;the primary and spare nodes all have node-degrees of n + 2 for an n-dimensional hypercube. The number of spare nodes is one fourth of primary nodes. The reconfiguration algorithm in the presence of faults is elegant and efficient. The proposed structure also effectively enhances the diagnosability of the hypercube system. It is shown that the diagnosability of the structure is increased to n + 2, whereas an ordinary n-dimensional hypercube has diagnosability n.
High Availability: Design, Techniques and Processes, 1st edition
Authors: Michael Hawkins, Floyd Piedad
Venue:  (2000)

From the Book:PREFACE: IntroductionBack when the mainframe ruled the world, information technology (IT) practitioners quickly learned the value of a well-managed system. They understood the value of managing problems, changes, and other issues confronting large, mission-critical computer systems running an organization's most sensitive business functions.When the popularity of mainframes waned in favor of less costly midrange and PC systems, IT organizations were caught in the frenzy of developing and deploying new business applications with breakneck speed. Suddenly, more computing power was available to end users, who wanted to accomplish more with it than ever before. The corporate information system grew in scope, use, and importance, with no end in sight.Now that the dust has settled somewhat, both the IT organization and the leaders of the business recognize that an unmanaged state-of-the-art computer system can be as bad as having none at all. Symptoms of this problem with unmanaged systems manifest themselves in ballooning IT costs, overworked and demoralized IT staff, and user dissatisfaction.This book demonstrates how to deliver maximum system availability and manageability throughout a computer system's lifecycle, from design through implementation and maintenance. We review every key technique for simplifying the management and maintenance of computer systems - including redundancy, standardization, backups, and many more. We discuss practical means of implementing these techniques to make your current and future systems far less prone to outages.We cover technical and management issues, since you cannot achieve long-termsystemavailability and manageability solutions without addressing both. We have written this book to benefit everyone in the IT organization. Technical staff will find practical operational solutions that can be implemented immediately. IT management will gain a better perspective of the end-to-end and interrelated requirements of running an IT shop. And Chief Information Officers (CIOs) and other senior IT executives will find forward-looking strategies for enhancing the IT infrastructure and its contribution to the corporate bottom line.You can manage systems better if you design them with high systems availability in mind. This book will show you how to address your system availability problems, from start to finish.
Efficient concise deterministic pattern-matching automata for ambiguous patterns
Authors: Nadia Nedjah, Luiza de Macedo Mourelle
Venue: ACM SIGPLAN Notices (2002)

Pattern-matching is a fundamental feature in many applications such as functional programming, logic programming, theorem proving, term rewriting and rule-based expert systems. Usually, patterns are pre-processed into a deterministic finite automaton. Using such an automaton allows one to determine the matched pattern(s) by a single scan of the input term. The matching automaton is typically based on left-to-right traversal of patterns. With ambiguous patterns a subject term may be an instance of more than one pattern. To select the pattern to use, a priority rule is usually engaged. The pre-processing of the patterns adds new patterns which are instances of the original ones. When the original patterns are ambiguous, some of the instances supplied may be irrelevant for the matching process. They may cause an unnecessary increase in the space requirements of the automaton and may also reduce the time efficiency of the matching process. Here, we devise a new pre-processing operation that recognises and avoids such irrelevant instances and hence improves space and time requirements for the matching automaton.