Results 1  10
of
145,519
LATERAL COMPLETION FOR ARBITRARY LATTICE GROUPS
"... to construct, for a given lattice group G, a canonical extension, G, with the property that if M is a subset of ô such that xAy=0 if x, y e M and Xyéy, then M has a supremum in G. The problem was first solved, for conditionally complete vector lattices, by Nakano [7] and was also treated ..."
Abstract
 Add to MetaCart
to construct, for a given lattice group G, a canonical extension, G, with the property that if M is a subset of ô such that xAy=0 if x, y e M and Xyéy, then M has a supremum in G. The problem was first solved, for conditionally complete vector lattices, by Nakano [7] and was also treated
A Note on the SetTheoretic Representation of Arbitrary Lattices
, 2003
"... Every lattice is isomorphic to a lattice whose elements are sets of sets and whose operations are intersection and the operation ∨ ∗ defined by A ∨ ∗ B = A ∪ B ∪ {Z: (∃X ∈ A)(∃Y ∈ B)X ∩ Y ⊆ Z}. This representation spells out precisely Birkhoff’s and Frink’s representation of arbitrary lattices, wh ..."
Abstract
 Add to MetaCart
Every lattice is isomorphic to a lattice whose elements are sets of sets and whose operations are intersection and the operation ∨ ∗ defined by A ∨ ∗ B = A ∪ B ∪ {Z: (∃X ∈ A)(∃Y ∈ B)X ∩ Y ⊆ Z}. This representation spells out precisely Birkhoff’s and Frink’s representation of arbitrary lattices
LatticeBased Access Control Models
, 1993
"... The objective of this article is to give a tutorial on latticebased access control models for computer security. The paper begins with a review of Denning's axioms for information flow policies, which provide a theoretical foundation for these models. The structure of security labels in the ..."
Abstract

Cited by 1485 (56 self)
 Add to MetaCart
The objective of this article is to give a tutorial on latticebased access control models for computer security. The paper begins with a review of Denning's axioms for information flow policies, which provide a theoretical foundation for these models. The structure of security labels
Fully homomorphic encryption using ideal lattices
 In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract

Cited by 642 (17 self)
 Add to MetaCart
of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable. Next, we describe a public key encryption scheme using ideal lattices
Multidimensional Windows Over Arbitrary Lattices And Their Application To FIR Filter Design
"... This paper presents some applications to FIR filter design of multiD windows over arbitrary lattices and with arbitrary center of spatial symmetry. First, classic windows (such as Hamming, Blackman, etc.) are extended to windows over 1D and multiD lattices with arbitrary spatial symmetry centers ( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents some applications to FIR filter design of multiD windows over arbitrary lattices and with arbitrary center of spatial symmetry. First, classic windows (such as Hamming, Blackman, etc.) are extended to windows over 1D and multiD lattices with arbitrary spatial symmetry centers
A Lattice Model of Secure Information Flow
, 1976
"... This paper investigates mechanisms that guarantee secure information flow in a computer system. These mechanisms are examined within a mathematical framework suitable for formulating the requirements of secure information flow among security classes. The central component of the model is a lattice s ..."
Abstract

Cited by 697 (2 self)
 Add to MetaCart
This paper investigates mechanisms that guarantee secure information flow in a computer system. These mechanisms are examined within a mathematical framework suitable for formulating the requirements of secure information flow among security classes. The central component of the model is a lattice
THE STRONG INDEPENDENCE THEOREM FOR AUTOMORPHISM GROUPS AND CONGRUENCE LATTICES OF ARBITRARY LATTICES
, 1999
"... In the book, General Lattice Theory, the first author raised the following problem (Problem II.18): Let L be a nontrivial lattice and let G be a group. Does there exist a lattice K such that K and L have isomorphic congruence lattices and the automorphism group of K is isomorphic to G? The finite ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In the book, General Lattice Theory, the first author raised the following problem (Problem II.18): Let L be a nontrivial lattice and let G be a group. Does there exist a lattice K such that K and L have isomorphic congruence lattices and the automorphism group of K is isomorphic to G? The finite
Transmultiplexing Of Multidimensional Signals Over Arbitrary Lattices With Perfect Reconstruction
 in Proc. IEEE Int. Conf. on Acoust., Speech, and Signal Process
, 1995
"... This research addresses the frequency multiplexing of multidimensional signals, having different bandwidths or defined on different lattices, with perfect or near perfect reconstruction i.e. zero or low crosstalk between signals and zero or low distortion of individual signals. The paper discusses i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This research addresses the frequency multiplexing of multidimensional signals, having different bandwidths or defined on different lattices, with perfect or near perfect reconstruction i.e. zero or low crosstalk between signals and zero or low distortion of individual signals. The paper discusses
Results 1  10
of
145,519