In this paper we prove a topological lemma on real valued random variables which implies the basic ingredients for the proof of the Fundamental Theorem of Asset Pricing in the two period case. In particular, previous results of Stricker, 9], and of Schachermayer, 6], are special cases of our result. Our proof is considerably shorter and more transparent than previous proofs of related special c...

We present a library for parallel block-sparse matrix-matrix multiplication on distributed memory clusters. By using a quadtree matrix representation data locality is exploited without any prior information about the matrix sparsity pattern. A distributed quadtree matrix representation is straightforward to implement due to our recent development of the Chunks and Tasks programming model [Paral...

Multiple constant multiplication (MCM) is the problem of realizing several constant multiplications with one data using as few additions/subtractions as possible. Almost all previously proposed MCM algorithms have been using carry-propagation adders. However, for high-speed applications carry-save adders are a better choice. Although it is possible to map carry-save adders to carry-propagation ...

Implementing public-key cryptography on platforms with limited resources, such as microprocessors, is a challenging task. Hardware/software co-design is often the only answer to implement the computationally intensive operations with limited memory and power at an acceptable speed. This contribution describes such a solution for Hyperelliptic Curve Cryptography (HECC). The proposed hardware/sof...

Semantic interoperability is needed to support meaningful data exchanges in distributed environments such as ad hoc networks of geospatial databases and geospatial web services. Even with the recent increasing popularity of ontologies to capture semantics of geospatial resources, semantics of geospatial data are often implicit or too weak to support meaningful exchanges. In this paper, we argue...

We prove the Verlinde conjecture in the following general form: Let V be a simple vertex operator algebra satisfying the following conditions: (i) V(n) = 0 for n < 0, V(0) = C1 and V ′ is isomorphic to V as a V -module. (ii) Every N-gradable weak V -module is completely reducible. (iii) V is C2-cofinite. (In the presence of Condition (i), Conditions (ii) and (iii) are equivalent to a single con...

This is a paper in a series to study vertex algebra-like structures arising from various algebras including quantum affine algebras and Yangians. In this paper, we study notions of ~-adic nonlocal vertex algebra and ~-adic (weak) quantum vertex algebra, slightly generalizing Etingof-Kazhdan’s notion of quantum vertex operator algebra. For any topologically free C[[~]]-module W , we study ~-adic...

This paper presents the comparison and optimization of Galois field algorithm and IDEA(International data encrypted algorithm) using VHDL(xc2v40-6cs144)with the help of Xilinx-Ise (9.2) .In terms of security IDEA algorithm is very much superior where as in terms of timings Galois field is much better and is already patented of Ascom. These are cryptographic algorithm used for security purpose. ...

We consider two natural embeddings between Artin groups: the group GÃn−1 of type Ãn−1 embeds into the group GBn of type Bn ; GBn in turn embeds into the classical braid group Brn+1 := GAn of type An . The cohomologies of these groups are related, by standard results, in a precise way. By using techniques developed in previous papers, we give precise formulas (sketching the proofs) for the cohom...