We present the International Lattice Data Grid (ILDG), a loosely federated grid of grids for sharing data from Lattice Quantum Chromodynamics (LQCD) simulations. The ILDG comprises of metadata, file format and web-service standards, which can be used to wrap regional data-grid interfaces, allowing seamless access to catalogues and data in a diverse set of collaborating regional grids. We discus...

At Fermilab a procedure using data from TBT BPM system to measure the lattice function of a synchrotron has been developed. The betatron oscillation recorded by the BPM system is fitted to obtain beam parameters x, x', y, y', and ∆p/p. These TBT beam parameters (x, x') or (y, y') are fitted to ellipses to obtain the lattice function β, α, and the emittance associated with the betatron amplitude...

In this paper, we discuss several aspects of data organization in the framework of a recently developed magnetic bubble memory technology known as a bubble lattice file. A dynamic ordering scheme, different from those implemented in conventional T-I bar bubble memories, is proposed. This ordering is particularly suited for bubble lattices. Some performance figures are included for comparison. I...

We introduce the technique of lattice querying which automatically forms the query from the set of text samples provided by a user, and produce search results by matching parse trees of this query with that of candidate answers. Lattice queries allow increase in big data exploration efficiency since they form multiple “hypotheses” concerning user intent and explore data from multiple respective...

Spatial heteroskedasticity may arise jointly with spatial autocorrelation in lattice data collected from agricultural trials and environmental studies. This leads to spatial clustering not only in the level but also in the variation of the data, the latter of which may be very important, for example, in constructing prediction intervals. This article introduces a spatial stochastic volatility (...

This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works. The security is quantified in an information-theoretic sense by means of the information leakage between the watermarked signals seen by the attacker and the secret key used in the embedding process. The theoretical analysis accomplished in the first ...

In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

We present a method of fast factorization in formal concept analysis (FCA) of data with fuzzy attributes. The output of FCA consists of a partially ordered collection of clusters extracted from a data table describing objects and their attributes. The collection is called a concept lattice. Factorization by similarity enables us to obtain, instead of a possibly large concept lattice, its factor...