ppxscal/embedding_network huggingface dataset:
Tuning NUMA Memory Management for Applications and Architectures
Authors: P R LaRowe, S C Ellis, S L Kaplan
Venue:  (1991)

\indent The study of operating systems level memory management policies for nonuniform memory access time (NUMA) shared memory multiprocessors is an area of active research. Previous results have shown that the best policy choice often depends on the application under consideration, while others have reported that the best policy depends on the particular architecture. Since both observations have merit, we explore the concept of policy tuning on an application/architecture basis. We introduce a highly tunable dynamic page placement policy for NUMA multiprocessors, and address issues related to the tuning of that policy to different architectures and applications. Experimental data acquired from our DUnX operating system running on two different NUMA multiprocessors are used to evaluate the usefulness, importance, and ease of policy tuning. Our results show that both application and architectural dependencies arise and interact with each other. Tuning policies for specific applications is justified by the benefits that have been realized and by the differences observed in how the programs of our workload respond to different parameter settings. The need to tune policies for the architecture seems obvious and is supported by data comparing how differences in costs affect the ``right'''' management decisions for the same application running on each architecture. We believe that a parameterized policy, such as that in DUnX, can form the basis for machine-independent memory management for NUMA machines.
Error Modeling for Hierarchical Lossless Image Compression
Authors: G P Howard, Scott J Vitter
Venue:  (1995)

We present a new method for error modeling applicable to the MLP algorithm for hierarchical lossless image compression. This method, based on a concept called the {\em variability index}, provides accurate models for pixel prediction errors without requiring explicit transmission of the models. We also use the variability index to show that prediction errors do not always follow the Laplace distribution, as is commonly assumed; replacing the Laplace distribution with a more general symmetric exponential distribution further improves compression. We describe a new compression measurement called {\em compression gain}, and we give experimental results showing that the MLP method using the variability index technique for error modeling gives significantly more compression gain than other methods in the literature.
A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377
Authors: Richard P. Brent, Samuli Larvala, Paul Zimmermann
Venue: Mathematics of Computation (2003)

The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r + O(1) bits of memory. We describe a new algorithm which requires only 3r/2+O(1) bits of memory and significantly fewer memory references and bit-operations than the standard algorithm.If 2r - 1 is a Mersenne prime, then an irreducible trinomial of degree r is necessarily primitive. We give primitive trinomials for the Mersenne exponents r = 756839, 859433, and 3021377. The results for r = 859433 extend and correct some computations of Kumada et al. The two results for r = 3021377 are primitive trinomials of the highest known degree.
TCP/IP and the European ATM pilot
Authors: O. Bonaventure, A. Danthine, E. Klovning
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Very few measurements have been done on wide area ATM networks. In this paper, we first look at how a compliant traffic can be generated with standard ATM equipment. We show that in our environment, even with a 23.42 Mbps VP out of 34 Mbps links, it is necessary to use some spacing in the ATM adapters to generate a compliant traffic. Our measurements show that with a large window TCP is able to achieve a throughput of 19 Mbps when the ATM level traffic is compliant with the traffic contract. However, if the ATM level traffic is not entirely compliant the segment loss rate increases quickly, and the TCP throughput collapses. A 3% change in the cell rate of the ATM level traffic can cause the TCP throughput to drop from 19 Mbps down to 1 Mbps
The Homogenous Capture of Random Strings
Authors: B. K. Natarajan
Venue:  (1985)

It is well known that a set of strings that are random in the Kolmogorov sense is immune to all computable enumerations. In this paper, we discuss the generalization of this property to the computational resource hierarchies. We then introduce the notion of homogeneous capture of sets and show that sets of random strings are not homogeneously captured by any computable enumeration. Again, we discuss the extension of this property to the resource hierarchies. Finally, we discuss the relationship between the notion of homogeneous capture and the traditional concept of randomness.
Model Checking Cache Coherence Protocols for Distributed File Systems
Authors: Mandana Vaziri-Farahani
Venue:  (1995)

Debugging complex software systems is a major problem. Proving properties of software systems can be thought of as a debugging tool. If a system S must satisfy property P but we can prove that it does not, then S has bugs in it. On the other hand, if S is proved to satisfy P then this is just a confirmation that a certain aspect of S is correct. We can prove properties of software systems at any stage of development. If we do these proofs early in the design stage, we can prevent errors from propagating to later development stages and therefore save time, money, and human effort. The traditional approach to proving properties of software systems is theorem proving. This approach has several pragmatic drawbacks. The size of the programs that we can prove correct is not very large. Theorem proving must be done by highly skilled experts in the field. Our approach to proving properties of software systems is model checking, which consists of proving the property by automatically checking every state in the system. Model checking is a technique successfully used in hardware verification. The model checking tool we use is SMV, which takes as input a finite state machine (FSM) and a property P expressed in Computation Tree Logic (CTL) and outputs ''true'' if the FSM satisfies P or ''false'' otherwise. If the outcome is false then SMV also outputs a counterexample. Because software systems are not, in general, finite state machines, model checking seems to be inadequate at first glance. However, we can overcome this problem by abstracting the system and checking a finite model of it. We use this method to check cache coherence protocols for distributed systems. The protocols we use are those of the Andrew File System and the Coda File System. We check a cache coherence invariant on the specifications of these protocols, which are natural abstractions of the systems. We perform other abstractions to reduce the size of the systems to manageable finite state machines. SMV checked our cache coherence invariant successfully and indicated that the protocol specifications satisfy this property. For our most complicated protocol, SMV took less than 1 second to check a finite state machine with over 43,600 reachable states.
A Quality of Service based Allocation and Routing Algorithm for Distributed, Heterogeneous Real Time Systems
Authors: Saurav Chatterjee
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

An increasing number of applications execute over a set of computing and communication resources and have end-to-end quality of service (QoS) requirements. Given a system and an application with specific flow structure and QoS requirements, this paper describes an integrated QoS-based allocation and routing algorithm that determines which computing and communication resources to utilize for this application. More specifically, the algorithm finds the best flow path for an application, subject to application flow and QoS constraints, so as to optimize system objectives (e.g., minimize total system utilization or balance the load). The paper also introduces a delta-optimal algorithm that, relative to the optimal algorithm, significantly reduces the run-time of the algorithm with a minor degradation in the optimality of the solution. The delta-optimal algorithm is guaranteed to produce a result that is at most delta-units sub-optimal. The paper also analyzes the optimality and run time of the solution as a function of delta for two multimedia scenarios. Rules of thumb for setting delta are also given.
Usability managers' forum: a commercial perspective
Authors: Simon Tyler, David Followell, Erik Gaelhoed
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Usability practitioners have to apply proven techniques to survive in a commercial environment. Commercial usability managers usability teams balance acknowledgment of current academic thinking and applying this in their day-to-day activities?
Mac OS X v10.2 (Special Edition Using), 2 edition
Authors: Brad Miser
Venue:  (2003)

:From using the basic features of Mac OS X and its applications, working with multimedia, the Internet, and peripherals to administering mixed networks, this book provides readers with the information they need to become savvy on Mac OS X, version 10.2. Topic selection focuses on the practical rather than the theoretical. The information in the book is designed to be applicable in regular, daily use of the Mac to accomplish specific tasks with the theme of "learn by doing." This updated edition of Special Edition Using Mac OS X reflects the major update version 10.2 represents. Updated coverage includes new and revised interfaces, additional email security features, better Mac-to-Windows networking, Bluetooth-enabled mobile computing, new and revised applications (iPhoto, iDVD, iChat, iCal/iSync, QuickTime 6 in support of the new MPEG-4 format, Inkwell for handwriting recognition), plus so much more.
Performance Analysis for Mesh and Mesh-Spectral Archetype Applications
Authors: Adam Rifkin, Berna Massingill
Venue:  (1998)

This document outlines a simple method for benchmarking a parallel communication library and for using the results to model the performance of applications developed with that communication library. We use compositional performance analysis - decomposing a parallel program into its modular parts and analyzing their respective performances - to gain perspective on the performance of the whole program. This model is useful for predicting parallel program execution times for different types of program archetypes, (e.g., mesh and mesh-spectral) using communication libraries built with different message-passing schemes (e.g., Fortran M and Fortran with MPI) running on different architectures (e.g., IBM SP2 and a network of Pentium personal computers).
eLearning with Dreamweaver MX: Building Online Learning Applications
Authors: Betsy Bruce
Venue:  (2002)

:eLearning with Dreamweaver MX: Building Online Learning Applications enables you to develop and deploy eLearning applications using Dreamweaver MX, a popular and powerful Web-editing software package. This book will show you how to create interactive courseware using Dreamweaver's built-in behaviors and the Macromedia learning extensions to Dreamweaver: CourseBuilder and Learning Site. eLearning with Dreamweaver MX: Building Online Learning Applications begins by teaching you the basic instructional design concepts you will need to know to create successful online learning applications. Betsy walks you through the development process step by step, beginning with planning and prototype creation. Then, she demonstrates how to add content, emphasizing methods that take advantage of Dreamweaver's templates and libraries. Next, the book delves into the CourseBuilder extension to add quizzes and interactions. The next step is to track user progress with databases and Learning Management Systems. Finally, Betsy wraps up with time-tested best practices for collaboration and optimization.
Using destination-set prediction to improve the latency/bandwidth tradeoff in shared-memory multiprocessors
Authors: Milo M. K. Martin, Pacia J. Harper, Daniel J. Sorin, Mark D. Hill, David A. Wood
Venue: ACM SIGARCH Computer Architecture News (2003)

Destination-set prediction can improve the latency/bandwidth tradeoff in shared-memory multiprocessors. The destination set is the collection of processors that receive a particular coherence request. Snooping protocols send requests to the maximal destination set (i.e., all processors), reducing latency for cache-to-cache misses at the expense of increased traffic. Directory protocols send requests to the minimal destination set, reducing bandwidth at the expense of an indirection through the directory for cache-to-cache misses. Recently proposed hybrid protocols trade-off latency and bandwidth by directly sending requests to a predicted destination set.This paper explores the destination-set predictor design space, focusing on a collection of important commercial workloads. First, we analyze the sharing behavior of these workloads. Second, we propose predictors that exploit the observed sharing behavior to target different points in the latency/bandwidth tradeoff. Third, we illustrate the effectiveness of destination-set predictors in the context of a multicast snooping protocol. For example, one of our predictors obtains almost 90% of the performance of snooping while using only 15% more bandwidth than a directory protocol (and less than half the bandwidth of snooping).
The Waveform BiConjugate Gradient Method for Parallel Transient Simulation of Semiconductor Devices
Authors: Laurence Tianruo Yang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers since these method are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. Here we are using an efficient parallel version of the Biconjugate gradient method (BiCG) proposed in [6] combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step with waveform Newton. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent. Therefore, the cost of global communication can be significantly reduced. Experimental results carried out on Parsytec massively parallel systems concerning the comparison with other accelerated approaches such as convolution SOR and waveform GMRES techniques on waveform relaxation algorithm and pointwise methods are described as well. 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
ISIS: A Fail-Safe Interface Realized in Smart Power Technology
Authors: M. Nicolaidis, N. Zaidan, T. Calin, D. Bied-Charreton
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

Actuators of safety critical systems must be driven by fail-safe signals. Under a failure in the system, such a signal has to be either on the correct state or on the safe state. This paper describes a fail-safe interface able to generate the fail-safe signals required in this context. The circuit is realized into a smart-power technology allowing delivering fail-safe signals having the power characteristics required in a railway system. It can replace traditional fail-safe interfaces realized by means of bulky and expensive discreet components.
Applying software engineering and process improvement to legacy defence system maintenance: an experience report
Authors: V. A. French
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The paper describes experiences gained while managing the successful application of software engineering methods and process improvement to a real-time legacy defence system. The methods applied included improved project management, software inspections, software metrics and two basic statistical process controls derived from inspection, metric and project management data.
Working sets and near-optimality
Authors: H. Schmutz, P. Silberbusch
Venue: ACM SIGOPS Operating Systems Review (1983)

In [1] Denning concludes from numerous observations of program behaviour that the WS algorithm with a single window size 8 is likely to "deliver throughput typically no worse than 10 percent from optimum". The authors of [2] report about observations of a set of programs, which requires several different window sizes for a i0 percent detuned WS algorithm. The purpose of this short note is to illustrate with the help of simple analysis why the observations reported in [1] were likely in the past and why observations like those of [2] become more and more likely in the future. To this end we introduce the notion of "degree of locality" and show that the locality set size and the degree of locality have impact on the optimal windowsize.
Leaky bucket access control for VBR MPEG video
Authors: P. Pancha, M. El Zarki
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The leaky bucket (LB) access control scheme has been widely proposed as the usage parameter control (UPC) mechanism at the user-network interface (UNI) for B-ISDN. An important goal for any UPC scheme is that it be able to accommodate a wide range of services. In this paper, we investigate the performance of the LB as an access control mechanism for transmission of variable bit rate (VBR) MPEG video. In particular, we focus on the following issues: 1) the requirements for lossless video transmission, 2) the trade-offs between token pool size and token regeneration rate, 3) the effect of traffic smoothing and 4) the performance of different encoded video sequences. Finally, we present a new technique for VBR video transmission using multiple LB's and we discuss the advantages of this techniques when cell losses occur.
Paralex: An Environment for Parellel Programming in Distributed Systems
Authors: Ozalp Babaoglu, Lorenzo Alvisi, Alessandro Amoroso, Renzo Davoli, Luigi A Giachini
Venue:  (1991)

Modern distributed systems consisting of powerful workstations and high-speed interconnection networks are an economical alternative to special-purpose super computers. The technical issues that need to be addressed in exploiting the parallelism inherent in a distributed system include heterogeneity, high-latency communication, fault tolerance and dynamic load balancing. Current software systems for parallel programming provide little or no automatic support towards these issues and require users to be experts in fault-tolerant distributed computing. The Paralex system is aimed at exploring the extent to which the parallel application programmer can be liberated from the complexities of distributed systems. Paralex is a complete programming environment and makes extensive use of graphics to define, edit, execute and debug parallel scientific applications. All of the necessary code for distributing the computation across a network and replicating it to achieve fault tolerance and dynamic load balancing is automatically generated by the system. In this paper we give an overview of Paralex and present our experiences with a prototype implementation
The Information Revolution and Developing Countries
Authors: Ernest J. Wilson
Venue:  (2003)

:In this book Ernest Wilson provides a clear, nuanced analysis of the major transformations resulting from the global information revolution. He shows that the information revolution is rooted in societal dynamics, political interests, and social structure. Using an innovative Strategic ReStructuring (SRS) model, he uncovers links between the big changes taking place around the world and the local initiatives of individual information activists, especially in developing countries. Indeed, Wilson shows that many of the structural changes of the information revolution, such as shifts from public to private ownership or from monopoly to competition, are driven by activists struggling individually and collectively to overcome local apathy and entrenched opposition to reform.Wilson applies his SRS model to the politics of Internet expansion in Brazil, China, and Ghana to illustrate the real-world challenges facing policy-makers and practitioners. Examples of such challenges include starting Internet companies, reforming regulatory laws, and formulating NGO strategies for dealing with the digital divide. Wilson identifies the tremendous possibilities for innovation and advancement in developing countries while acknowledging the structural, institutional, and cultural constraints that work against their realization.
Handprinted Hiragana Recognition Using Support Vector Machines
Authors: Ken-ichi Maruyama, Minoru Maruyama, Hidetoshi Miyao, Yasuaki Nakano
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes a method to improve the cumulative recognition rates of pattern recognition using Decision Directed Acyclic Graph (DDAG) based on support vectormachines (SVM). Though the original DDAG has high level of performance and its execution speed is fast, it does not consider the so-called cumulative recognition rate. We constructDDAG which can incorporate the cumulative recognition rate. As a result of our experiment for the hand-printed Hiragana characters in JEITA-HP, the cumulative recognition rate is improved and its execution time is almost the same as the original DDAG and 30 times fasterthan Max Win Algorithm which is one of famous recognition methods using support vector machines for a multi-class problem.
A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
Authors: G. S. Liu, J. Z. Zhang
Venue: Journal of Computational and Applied Mathematics (2002)

In order to find a global solution for a quadratic program with linear complementarity constraints (QPLCC) more quickly than some existing methods, we consider to embed a local search method into a global search method. To say more specifically, in a branch-and-bound algorithm for solving QPLCC, when we find a new feasible solution to the problem, we utilize an extreme point algorithm to obtain a locally optimal solution which can provide a better bound and help us to trim more branches. So, the global algorithm can be accelerated. A preliminary numerical experiment was conducted which supports the new algorithm.
The Complete Guide to Digital Photography, 2 edition
Authors: Michael Freeman
Venue:  (2003)

:It's the bestselling, most complete digital guide available--and now it's thoroughly updated to reflect the state of the art. Featuring the latest operating systems and software versions, plus a new section on traveling with your gear, this fully illustrated, total approach to digital will lead you into an exciting new world of image making. An essential round-up of available cameras, computers, scanners, software, and printers--including current online printing services such as photobox and fotango, and the Epson 2000 series of archive printers--offers a plethora of technical possibilities. Detailed text and more than 300 color photographs show exactly how to take and make great portraits, landscapes, action shots, and more. Take advantage of the heightened ability to enhance images; change backgrounds or colors; add reflections; and create artistic effects with collaging, filters, and lighting techniques. Includes easy-to-follow projects for making calendars, business cards, websites, and more.