. This paper presents the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate exchange of software and data between researchers in sparse matrix computations. Our starting point is the Harwell

follow Husserl in presenting the basic concepts of formal ontology as falling into three groups: the theory of part and whole, the theory of dependence, and the theory of boundary, continuity and contact. These basic concepts are presented in relation to the problem of providing an account of the formal

Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest

In this chapter we discuss how object-oriented techniques can be applied in the design and implementation of a software library for linear algebra computations. 1.1 Introduction The basic concepts in linear algebra, such as vectors and matrices, are of fundamental importance to most

This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrix-vector operations which should provide for efficient and portable implementations of algorithms for high performance computers.

This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic

ABSTRACT: The lesson will begin with the basics of fuzzy set theory. Fuzzy set theory was first introduced in 1965 by Lotfi A. Zadeh [Zadeh 1965]. It may be regarded both as a generalization of classical set theory and as a generalization of dual logic. In knowledge-based methods, fuzzy sets

In support of research projects both within the Munsell Color Science Laboratory and outside which rely on having full knowledge of the spectral makeup of scenes, a number of methods for capturing spectral images are being explored. This project is named Lippmann2000 in honor of Gabriel Lippmann who in 1891 devised a method to perfectly reconstruct the spectral content of real world scenes. In spite of Lippmann’s invention, a more primitive three-channel model, first demonstrated by James Clerk Maxwell 30 years prior, has dominated the color imaging field. The Maxwellian model, universal in today’s silver halide and electronic color image capture systems, relies on the metameric properties of the human visual system to simulate the appearance of an original color. It has been recognized by those in the forefront of imaging research that the capture of full spectral data holds advantage over traditional three-channel methods. This paper describes our efforts to-date to build our database of spectral images.

time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.

delivers significantly better instrumentation performance than similar tools. For example, Pin is 3.3x faster than Valgrind and 2x faster than DynamoRIO for basic-block counting. To illustrate Pin’s versatility, we describe two Pintools in daily use to analyze production software. Pin is publicly available