Results 1  10
of
82
Computing Persistent Homology
 Discrete Comput. Geom
"... We show that the persistent homology of a filtered d dimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields. It also enabl ..."
Abstract

Cited by 109 (19 self)
 Add to MetaCart
(Show Context)
We show that the persistent homology of a filtered d dimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields. It also enables us to derive a natural algorithm for computing persistent homology of spaces in arbitrary dimension over any field. This results generalizes and extends the previously known algorithm that was restricted to subcomplexes of S and Z2 coefficients. Finally, our study implies the lack of a simple classification over nonfields. Instead, we give an algorithm for computing individual persistent homology groups over an arbitrary PIDs in any dimension.
An algorithm for solving the discrete log problem on hyperelliptic curves
, 2000
"... Abstract. We present an indexcalculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that it is faster than the Rho method for genus greater than 4. To demonstrate the efficiency of our approach, we de ..."
Abstract

Cited by 88 (8 self)
 Add to MetaCart
(Show Context)
Abstract. We present an indexcalculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that it is faster than the Rho method for genus greater than 4. To demonstrate the efficiency of our approach, we describe our breaking of a cryptosystem based on a curve of genus 6 recently proposed by Koblitz. 1
A generic library of floatingpoint numbers and its application to exact computing
 In 14th International Conference on Theorem Proving in Higher Order Logics
, 2001
"... Abstract. In this paper we present a general library to reason about floatingpoint numbers within the Coq system. Most of the results of the library are proved for an arbitrary floatingpoint format and an arbitrary base. A special emphasis has been put on proving properties for exact computing, i. ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we present a general library to reason about floatingpoint numbers within the Coq system. Most of the results of the library are proved for an arbitrary floatingpoint format and an arbitrary base. A special emphasis has been put on proving properties for exact computing, i.e. computing without rounding errors. 1
System Design Methodologies for a Wireless Security Processing Platform
, 2002
"... Security protocols are critical to enabling the growth of a wide range of wireless data services and applications. However, they impose a high computational burden that is mismatched with the modest processing capabilities and battery resources available on wireless clients. Bridging the security pr ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
Security protocols are critical to enabling the growth of a wide range of wireless data services and applications. However, they impose a high computational burden that is mismatched with the modest processing capabilities and battery resources available on wireless clients. Bridging the security processing gap, while retaining sufficient programmability in order to support a wide range of current and future security protocol standards, requires the use of novel system architectures and design methodologies.
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation
, 1998
"... The FOXBOX system puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations. Black box objects are stored as functions. For instance: a black box polynomial is a procedure that takes values for the variabl ..."
Abstract

Cited by 32 (13 self)
 Add to MetaCart
The FOXBOX system puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations. Black box objects are stored as functions. For instance: a black box polynomial is a procedure that takes values for the variables as input and evaluates the polynomial at that given point. FOXBOX can compute the greatest common divisor and factorize polynomials in black box representation, producing as output new black boxes. It also can compute the standard sparse distributed representation of a black box polynomial, for example, one which was computed for an irreducible factor. We establish that the black box representation of objects can push the size of symbolic expressions far beyond what standard data structures could handle before. Furthermore, FOXBOX demonstrates the generic program design methodology. The FOXBOX system is written in C++. C++ template arguments provide for abstract domain types. Currently, F...
Automated Recovery in a Secure Bootstrap Process
, 1998
"... Integrity is rarely a valid presupposition in many systems architectures, yet it is necessary to make any security guarantees. To address this problem, we have designed a secure bootstrap process, AEGIS, which presumes a minimal amount of integrity, and which we have prototyped on the Intel x86 arch ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
(Show Context)
Integrity is rarely a valid presupposition in many systems architectures, yet it is necessary to make any security guarantees. To address this problem, we have designed a secure bootstrap process, AEGIS, which presumes a minimal amount of integrity, and which we have prototyped on the Intel x86 architecture. The basic principle is sequencing the bootstrap process as a chain of progressively higher levels of abstraction, and requiring each layer to check a digital signature of the next layer before control is passed to it. A major design decision is the consequence of a failed integrity check. A simplistic strategy is to simply halt the bootstrap process. However, as we show in this paper, the AEGIS bootstrap process can be augmented with automated recovery procedures which preserve the security properties of AEGIS under the additional assumption of the availability of a trusted repository. We describe two means by which such a repository can be implemented, and focus our attention on a networkaccessible repository.
An adaptable and extensible geometry kernel
 In Proc. Workshop on Algorithm Engineering
, 2001
"... ii ..."
Guaranteed proofs using interval arithmetic
 Proceedings of the 17th Symposium on Computer Arithmetic, Cape Cod
, 2005
"... This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval splitting and Taylor’s series expansions. Although the tools are designed for the proof assistant system PVS, expertise o ..."
Abstract

Cited by 24 (13 self)
 Add to MetaCart
(Show Context)
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval splitting and Taylor’s series expansions. Although the tools are designed for the proof assistant system PVS, expertise on PVS is not required. The ultimate goal of the tools is to provide guaranteed proofs of numerical properties with a minimal humantheorem prover interaction. 1
Optimizing the use of high performance software libraries
 In Languages and Compilers for Parallel Computing
, 2000
"... Abstract. This paper describes how the use of software libraries, which is prevalent in high performance computing, can benefit from compiler optimizations in much the same way that conventional computer languages do. We explain how the compilation of these informal languages differs from the compil ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
(Show Context)
Abstract. This paper describes how the use of software libraries, which is prevalent in high performance computing, can benefit from compiler optimizations in much the same way that conventional computer languages do. We explain how the compilation of these informal languages differs from the compilation of more conventional computer languages. In particular, such compilation requires precise pointer analysis, requires domainspecific information about the library’s semantics, and requires a configurable compilation scheme. Finally, we show that the combination of dataflow analysis and pattern matching form a powerful tool for performing configurable optimizations. 1
Exact solutions to linear programming problems
 Operations Research Letters
, 2007
"... The use of floatingpoint calculations limits the accuracy of solutions obtained by standard LP software. We present a simplexbased algorithm that returns exact rational solutions, taking advantage of the speed of floatingpoint calculations and attempting to minimize the operations performed in ra ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
(Show Context)
The use of floatingpoint calculations limits the accuracy of solutions obtained by standard LP software. We present a simplexbased algorithm that returns exact rational solutions, taking advantage of the speed of floatingpoint calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented.