ppxscal/embedding_network huggingface dataset:
Computation of the Distribution of the Completion Time When the Work Requirement is a PH Random Variable
Authors: Andrea Bobbio, S K Trivedi
Venue:  (1987)

In this paper we derive the distribution of the completion time of a job with a PH-distributed work requirement, on a server modeled by a homogeneous Markov reward process. The interactions between the job in progress and the server are allowed to be either of resume or of repeat type in a probabilistic manner. Thus, each transition of the structure-state process will lead to the resumption or to the loss of the work done until the transition time. This formulation extends and encompasses previous work in this field, and leads to more compact and realistic models in many applications. The paper shows that the distribution of the completion time of a job with PH distributed requirement is PH under both preemptive policies. This result is stated as a closure property of the PH distribution class. The complexity of the solution algorithm is examined and compared with different techniques proposed in the literature. Several application examples are presented.
Singular: A Computer Algebra System
Authors: Christoph Lossen
Venue: Computing in Science and Engineering (2003)

Singular is free software for polynomial computations. Originally designed for research in mathematics, it features one of the fastest implementations of Buchberger's Gröbner basisalgorithm, which is the core of many symbolic methods for simplifying and solving systems of polynomial equations.
Ethical gaps in studies of the digital divide
Authors: Kenneth L. Hacker, Shana M. Mason
Venue: Ethics and Information Technology (2003)

There are many reports about the digital divide and many discrepant interpretations of what the reports indicate. This pattern of competing analyses, often in relation to identical data sets, has endured for a good part of the last decade. It is argued here that a major problem with much of the digital divide research is a failure to include ethical concerns as an explicit part of analyzing and interpreting digital divide gaps. If researchers include more recognition of ethics with their findings about divide gaps, it is likely that they will produce better research and findings as well as more defensible linkages between study reports and policy deliberations.
The wavelet element method. Part II: Realization and additional features in 2D and 3D
Authors: Claudio Canuto, Anita Tabacco, Urban Karsten
Venue:  (1997)

The Wavelet Element Method (WEM) provides a construction of multiresolution systems and biorthogonal wavelets on fairly general domains. These are split into subdomains that are mapped to a single reference hypercube. Tensor products of scaling functions and wavelets defined on the unit interval are used on the reference domain. By introducing appropriate matching conditions across the interelement boundaries, a globally continuous biorthogonal wavalet basis on the general domain is obtained. This construction does not uniquely define the basis functions but rather leaves some freedom for fulfilling additional features. In this paper we detail the general construction principle of the WEM to the 1D, 2D and 3D cases. We address additional features such as symmetry, vanishing moments and minimal support of the wavelet functions in each particular dimension. The construction is illustrated by using biorthogonal spline wavelets on the interval. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: Wavelet Element Method, Matching conditions
Fault-Tolerant Adaptive and Shortest Routing in 2-D Extended Meshes Using Faulty-Block-Information
Authors: Xiao Chen
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In this paper, we first discuss the adaptive minimal routing algorithm in 2-D extended meshes without faulty blocks. Then a sufficient condition of the existence of a minimal path from the source to the destination is presented. After that, we propose a shortest fault-tolerant routing algorithm with one faulty block with the guidance of the faulty-block-information and extend the algorithm with one faulty block to multiple faulty blocks. This is the first attempt to address the routing algorithms on an extended mesh. 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 qualitative study of a vaccination model with non-linear incidence
Authors: A. B. Gumel, S. M. Moghadas
Venue: Applied Mathematics and Computation (2003)

We propose a new deterministic model for the dynamics of an infectious disease in the presence of a preventive (prophylactic) vaccine and an effective therapeutic treatment. The three-dimensional model, which assumes a non-linear incidence rate, is analysed qualitatively to determine the stability of its equilibria. The optimal vaccine coverage threshold needed for disease control and eradication is determined analytically (and verified using numerical simulations). The case where no vaccination is given (vaccination-free model) is also investigated. Using a Dulac function, it is shown that the vaccination-free model has no limit cycles.
Windows Server 2003 Clustering Load Balancing, 1 edition
Authors: Robert J. Shimonski
Venue:  (2003)

Learn to implement clustering and load balancing solutions with Windows 2000 and Windows Server 2003, and deliver nearly 100 percent uptime. With a focus on real world production-based problems, the author delivers detailed high availability solutions that will give you the tools to roll out and troubleshoot these technologies. Table of contents 1: Introduction to High Availability, Clustering, and Load-Balancing Technologies 2: Designing a Clustered Solution with Windows 2000 Advanced Server 3: Designing a Clustered Solution with Windows Server 2003 4: Designing a Clustered and Load-Balanced Solution with Application Center 2000 5: Designing a Clustered Solution with Windows SQL Server 2000 Enterprise Edition 6: Designing a Highly Available Solution with Windows Services 7: Building Advanced Highly Available Load-Balanced Configurations 8: High Availability, Baselining, Performance Monitoring, and Disaster Recovery Planning A: Project Plan Sample B: Advanced Troubleshooting: Event IDs
Advances in Parallel Debuggers: New Approaches to Visualization
Authors: Paula S Utter, Cherri M. Pancake
Venue:  (1989)

Programmers who write serial code can take advantage of a wide range of debuggers whose features draw on more than three decades of research in how humans design and verify computer programs. Debugging tools are generally designed to facilitate a cyclic, cause-effect approach to error detection and correction. This strategy is effective in serial environments, where program execution is repeatable; in parallel settings, however, many traditional techniques are rendered useless by the effects of nondeterminism. This essay reviews recent research in parallel debuggers. In particular, it addresses the difficulties involved in developing effective schemes for portraying program behavior. A debugger''s visualization system encompasses representational and interpretive concepts as well as graphical display techniques. The goal of visualization design is to furnish relevant views of program execution as clearly and succinctly as possible. Inadequate or inappropriate visualization systems jeopardize the usefulness and acceptability of debugging tools by making it difficult for the user to draw accurate inferences about the relationship between program code and run-time errors. Industrial, governmental, and academic research efforts in debugger visualization are traced, with the emphasis on the evolution of new strategies and techniques. Three basic approaches are identified corresponding to functional, structural, and behavioral perspectives and examples of recent developments are presented from each area. This is followed by a summary of the problems still confronting visualization designers.
On the effectiveness of evaluating retrieval systems in the absence of relevance judgments
Authors: Javed A. Aslam, Robert Savell
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Soboroff, Nicholas and Cahan recently proposed a method for evaluating the performance of retrieval systems without relevance judgments. They demonstrated that the system evaluations produced by their methodology are correlated with actual evaluations using relevance judgments in the TREC competition. In this work, we propose an explanation for this phenomenon. We devise a simple measure for quantifying the similarity of retrieval systems by assessing the similarity of their retrieved results. Then, given a collection of retrieval systems and their retrieved results, we use this measure to assess the average similarity of a system to the other systems in the collection. We demonstrate that evaluating retrieval systems according to average similarity yields results quite similar to the methodology proposed by Soboroff et~al., and we further demonstrate that these two techniques are in fact highly correlated. Thus, the techniques are effectively evaluating and ranking retrieval systems by "popularity" as opposed to "performance.
Page Placement for Non-Uniform Memory Access Time (NUMA) Shared Memory Multiprocessors
Authors: P R LaRowe
Venue:  (1991)

\indent Shared memory multiprocessors are attractive because they are programmed in a manner similar to uniprocessors. The UMA ({\underline u}niform {\underline m}emory {\underline a}ccess time) class of shared memory multiprocessors is the most attractive, from the programmer''s point of view, since the programmer need not be concerned with the placement of code and data in the physical memory modules of the machine. Scalable shared memory multiprocessors, on the other hand, tend to present at least some degree of nonuniformity of memory access to the programmer, making the NUMA ({\underline n}on{\underline u}niform {\underline m}emory {\underline a}ccess time) class an important one to consider. In this thesis, we investigate the role of the operating system''s page placement policy in managing the physical memory of NUMA multiprocessors. Analytic, simulation, and implementation techniques are used to study a wide range of issues and problems associated with managing the placement of virtual pages in the physical memory modules of the machine. We begin with an analytic investigation of {\em dynamic multiple-copy} page placement policies. Such policies support the movement of virtual pages from memory module to memory module (called {\em page migration}) in response to changing shared memory reference patterns, as well as the creation of multiple physical copies of a single virtual page (called {\em page replication}). Mean value analysis techniques are used to motivate much of the experimental work that comprises the remainder of the thesis. We check the validity of the model by comparing its predictions with measured data from our DUnX operating system for the BBN GP1000 NUMA shared memory multiprocessor. The analytic results are also used to help explain some of the experimental results discussed later. The experimental component of the thesis begins with an investigation of {\em static} page placement policies. Static page placement policies are the traditional type, in the sense that they do not support the migration and replication of virtual pages. However, the initial selection of a free frame to satisfy a page fault is more significant in the case of a NUMA multiprocessor than in uniprocessors or UMA multiprocessors, since different frames present different memory access times to a particular processor. Our simulation results show that under certain workload assumptions, placement policies that are strongly biased towards local frame allocation but are willing to use remote frames under certain conditions (called {\em frame borrowing}) are able to reduce the number of page faults (eliminating page thrashing situations) and improve the overall computation time over strictly local frame allocation. The increased cost of memory operations due to the extra remote memory accesses is more than compensated for by the savings resulting from the reduction in demand fetches. This result is later validated using real application programs running on
General size-change termination and lexicographic descent
Authors: Amir M. Ben-Amram
Venue: The essence of computation: complexity, analysis, transformation (2002)

Size-change termination (SCT) is a general criterion to identify recursive function definitions that are guaranteed to terminate. It extends and subsumes the simpler criterion of lexicographic descent in function calls, which in classical recursion theory is known as multiple recursion . Neil Jones has conjectured that the class of functions computable by size-change terminating programs coincides with the multiply-recursive functions. This paper proves so.
A Framework for Flexible Networking
Authors: M. Moser, S. Sugiura, K. Sugawara, N. Shiratori
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Abstract Many of today' s applications, especially applications using a computer network, are rigid, both as far as user requirements and computational assets are concerned. The first problem limits ordmary users to the functions offered by the system as is, while the second one leads applications to degrade disgracefully, if the availability of assets changes while the applicaiion is running. In this paper we first analyze both problems and their interconnection, then give a unifying theoretical framework to deal with changes in the user requirements and computational assets. We then propose the Flexible Networking Kernel, which allows users to specify the kind of service they desire using a high level language, and then supplies the best service possible with the currently available computational assets compensating changes in both the user requirements and computational assets.
Kylix Power Solutions
Authors: Don Taylor, Jim Mischel, Tim Gentry
Venue:  (2002)

:Written by Kylix experts and respected software developers, this book provides readers with accurate, understandable, easy to use, and dependable programming approaches and solutions. It also helps readers understand the whys of Kylix and Linux as well as the hows, using carefully documented commentary on why each approach is used. This book is ideal for experienced Delphi programmers expanding to the Linux operating system through Kylix and existing Linux developers wishing to develop GUI-based programs under Linux.
Automating Reasoning in an Implementation of Constructive Type Theory
Authors: Douglas J. Howe
Venue:  (1988)

The starting point for this thesis is the Nuprl proof development system. Nuprl is an environment for the development of formal computational mathematics and has a rich constructive type theory as a logical basis. It provides sophisticated editors and an integrated tactic mechanism that allows the programming of guaranteed-sound extensions to the inference system. The work presented in this thesis concerns the automation of reasoning in Nuprl, and consists of three parts. The first is a collection of general-purpose tactics. These tactics are simple enough that their function can be readily understood, yet powerful enough to support development of substantial formal mathematics. The second part is the use of Nuprl to solve an open problem in the theory of programming languages. The set of basic tactics together with various tools provided by Nuprl play a crucial role in the solution, and it seems that this problem is not tractable without computer assistance. The third part is an implementation within Nuprl of mechanisms that support the use of Nuprl''s type theory as a language for constructing theorem-proving procedures. The main component of the implementation is a large library of definitions, theorems and proofs. This library may be regarded as the beginning of a book of formal mathematics; it contains a complete formal development and explanation of a useful subset of Nuprl''s metatheory, and of a mechanism for translating results established about this embedded metatheory to the object level. The type theory, besides permitting the internal development of this partial reflection mechanism, allows us to make abstractions that drastically reduce the burden of establishing the correctness of new theorem-proving procedures. Our library includes a formally verified term-rewriting system.
A Bibliography of Parallel Debuggers
Authors: Sue Utter, Cherri Pancake
Venue:  (1989)

A bibliography of over three hundred technical reports, journal and conference papers, and Ph.D. dissertations dealing with parallel and distributed debuggers. Treatments of programming environments, debugging methodology, and techniques for program analysis are included when a significant portion of the publication is devoted to factors influencing the design or implementation of debugging tools.
Planner Based Error Recovery Testing
Authors: Anneliese von Mayrhauser, Michael Scheetz, Eric Dahlman, Adele E. Howe
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Error recovery testing is an important part of software testing, especially for safety-critical systems. We show how an AI planning system and concepts of mutation testing can be combined to generate error recovery tests for software. We identify a set of mutation operations on the representation that the planner uses when generating test cases. These mutations cause error recovery test cases to be generated. The paper applies these concepts to the testing of a large tape storage system.
Computing Information Technology: The Human Side
Authors: Steven R. Gordon
Venue:  (2003)

:From the senior management to the clerical and support group levels, this study addresses the possible pitfalls and triumphs of implementing information technology (IT) into organizations in terms of organizational strategies, structures, and communication methods. Issues of human-computer interaction, ethics, privacy, and security are raised to help facilitate a sociopragmatic and constuctivist understanding of IT culture.Author Biography: Dr. Steven Gordon is a professor of math and science at Babson College. He lives in Babson Park, Massachusetts.
Solving ODEs with MATLAB
Authors: Ian Gladwell, Larry Shampine, S. Thompson
Venue:  (2003)

:This book is for people who need to solve ordinary differential equations (ODEs), both initial value problems (IVPs) and boundary value problems (BVPs) as well as delay differential equations (DDEs). These topics are usually taught in separate courses of length one semester each, but solving ODEs with Matlab provides a sound treatment of all three in about 250 pages. The chapters on each of these topics begin with a discussion of "the facts of life" for the problem, mainly by means of examples. Numerical methods for the problem are then developed - but only the methods most widely used. Although the treatment of each method is brief and technical issues are minimized, the issues important in practice and for understanding the codes are discussed. Often solving a real problem is much more than just learning how to call a code. The last part of each chapter is a tutorial that shows how to solve problems by means of small but realistic examples.
System Engineering in the Twenty-first Century
Authors: John Harauz, Peter T. Poon
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The panel will focus discussions on a number of issues, including: 1. What is the relationship between ISO/IEC 15288 (i.e., systems engineering life cycle) and ISO/IEC 12207 (i.e., software engineering life cycle)? 2. How to maximize the efficient use of ISO/IEC 15288 and ISO/IEC 12207? In real situations, will there be any obstacles when ISO/IEC 15288 invokes ISO/IEC 12207 for software tasks? 3. What impacts will ISO/IEC 15228 have on the way systems engineering will be performed in various countries? In various sectors? 4. How to ensure the adoption of ISO/IEC 15288 as an International Standard will lead to wide usage of this Standard? For example: What organizations and other standards committees should participate in the development of ISO/IEC 15288? How to ensure broad participation of system engineers in the development of ISO/IEC 15288? 5. How to ensure the revision of ISO/IEC 12207, subsequent to the publication of ISO/IEC 15288, will lead to consistency and interoperability with ISO/IEC 15288? 6. What approaches should be taken in gathering the experience of using ISO/IEC 15288?
A Usage Profile and Evaluation of a Wide-Area Distributed File System
Authors: Mirjana Spasojevic, Mahadev Satyanarayanan
Venue:  (1993)

The evolution of the Andrew File System (AFS) into a wide-area distributed file system has encouraged collaboration and information dissemination on a much broader scale than ever before. In this paper, we examine AFS as a provider of wide-area file services to over 80 organizations around the world. We discuss usage characteristics of AFS derived from empirical measurements of the system, and from user responses to a questionnaire. Our observations indicate that AFS provides robust and efficient data access in its current configuration, thus confirming its viability as a design point for wide-area distributed file systems.
Using Graph Models in Retargetable Optimizing Compilers for Microprocessors with VLIW Architectures
Authors: A. E. Doroshenko, D. V. Ragozin
Venue: Cybernetics and Systems Analysis (2003)

A mathematical model of programs, which is based on the concept of a hierarchical graph, is described. The model is used in the retargetable optimizing compiler NVRK-2 for microprocessor architectures with irregular very long instruction words (VLIWs). A formal description of a microprocessor with such an architecture is proposed and issues of code generation and analysis of microprocessors with VLIWs extended by a collection of instructions for signal processing and multimedia application are discussed. The problem of the computational speedup of the architectures being considered is also discussed.
Relaxation and block-relaxation procedures for the dual formulation of the Signorini-Coulomb frictional contact
Authors: P. Bisegna, F. Lebon, F. Maceri
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is devoted to the solution of frictional contact problems. The contact is modeled by the Signorini's law of unilateral contact and the friction by the Coulomb's friction law. A condensed duality formulation on the contact zone is introduced. A quasi-variational inequality is obtained and solved numerically by relaxation and block-relaxation procedures. The numerical example of the contact of an elastic body with a rigid support is presented.