Exploració per tema "Lattice theory"
Ara es mostren els items 1-10 de 10
-
A lattice representation of relations, multivalued dependencies and Armstrong relations
(2005)
Text en actes de congrés
Accés restringit per política de l'editorialWe present a lattice-base formalism to relate, in a novel way, different representation methods for relational data. Specifically, relations given extensionally by tuples, multivalued dependencies, and Armstrong relations ... -
A simplified new multigrid algorithm of lattice Boltzmann method for steady states
(2023-02-01)
Article
Accés restringit per política de l'editorialIn the present paper, a new strategy of multigrid method is introduced to accelerate the convergence speed of numerical simulations via lattice Boltzmann method. Based on the popular V-cycle multigrid algorithm, a simplified ... -
Approximation and decomposition in lattices of clutters
(2023-08-01)
Article
Accés obertA clutter on O is a family of subsets of O that are incomparable under inclusion. Given a collection S of clutters on O and another clutter ¿ on O, we study the problem of approximating and decomposing ¿ in terms of the ... -
Characterization and Armstrong relations for Degenerated Multivalued Dependencies using Formal Concept Analysis
(Springer, 2005)
Text en actes de congrés
Accés restringit per política de l'editorialFunctional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of ... -
Line tracking performance of a least squares adaptive lattice algorithm
(1983)
Text en actes de congrés
Accés obertThe work shows the performance of an algorithm for adaptive lattice structures in line tracking. The algorithm introduces some modifications in the classical LMS procedure, which theoretical background can be viewed in ... -
Satins, lattices, and extended Euclid's algorithm
(2021-01-01)
Article
Accés obertMotivated by the design of satins with draft of period m and step a, we draw our attention to the lattices L(m,a)=¿(1,a),(0,m)¿ where 1=a<m are integers with gcd(m,a)=1. We show that the extended Euclid's algorithm applied ... -
Sensor placement for fault diagnosis performance maximization under budgetary constraints
(2012)
Text en actes de congrés
Accés restringit per política de l'editorialThe success of any diagnosis strategy critically depends on the sensors measuring process variables. This paper presents a strategy based on diagnosability maximization for optimally locating sensors in distribution networks. ... -
Teoremes de representació per a àlgebres de Boole finites i retícles distributius finits
(Universitat Politècnica de Catalunya, 2019-09)
Treball Final de Grau
Accés obertUn dels problemes centrals de les matemàtiques és el de la classificació. Per a cada tipus d objecte, tenim la corresponent noció d isomorfisme i ens interessa saber sota quines circumstàncies dos objectes d aquest tipus ... -
Uncertainty analysis in lattice physics calculations: application of the NRG's TALYS evaluated data to a case of burnup
(Universitat Politècnica de Catalunya / Institut National Polytechnique de Grenoble, 2011)
Projecte Final de Màster Oficial
Accés obertTENDL evaluate files have been processed with NJOY and different libraries have been created and processed by the deterministic code DRAGON. The aim of this process is obtain hundreds of burnups calculation that has been ... -
Unified characterization of symmetric dependencies with lattices
(2006)
Text en actes de congrés
Accés restringit per política de l'editorialSymmetric dependencies, or MultiValued Dependencies-like, are those dependencies that follow the deduction rules of MultiValued Dependencies (MVD’s). These are MVD-clauses, Degenerate MultiValued Dependencies (DMVD’s), and ...