Relevant bibliographies by topics / Complete lattice

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Complete lattice'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Complete lattice.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Complete lattice"

1

Sangalli, Arturo A. L. "Lattices of fuzzy objects." International Journal of Mathematics and Mathematical Sciences 19, no. 4 (1996): 759–66. http://dx.doi.org/10.1155/s0161171296001056.

Full text
Abstract:
The collection of fuzzy subsets of a setXforms a complete lattice that extends the complete lattice𝒫(X)of crisp subsets ofX. In this paper, we interpret this extension as a special case of the “fuzzification” of an arbitrary complete latticeA. We show how to construct a complete latticeF(A,L)–theL-fuzzificatio ofA, whereLis the valuation lattice– that extendsAwhile preserving all suprema and infima. The “fuzzy” objects inF(A,L)may be interpreted as the sup-preserving maps fromAto the dual ofL. In particular, each complete lattice coincides with its2-fuzzification, where2is the twoelement latti
APA, Harvard, Vancouver, ISO, and other styles
2

Pastijn, F., and P. G. Trotter. "Complete Congruences on Lattices of Varieties and of Pseudovarieties." International Journal of Algebra and Computation 08, no. 02 (1998): 171–201. http://dx.doi.org/10.1142/s0218196798000107.

Full text
Abstract:
Three methods for the construction of all complete congruences on the lattice Lv( V ) of subvarieties of a variety V are introduced. It is shown that there exists an order preserving embedding of the lattice of complete congruences on the lattice Lp( P ) of all subpseudovarieties of a given pseudovariety P into the direct product of the lattices of complete congruences on lattices of subvarieties of varieties generated by members of P; thus there are methods for constructing all complete congruences on Lp( P ). By way of application, 2ℵ0 complete congruences and complete endomorphisms are cons
APA, Harvard, Vancouver, ISO, and other styles
3

FREESE, R., G. GRÄTZE, and E. T. SCHMIDT. "ON COMPLETE CONGRUENCE LATTICES OF COMPLETE MODULAR LATTICES." International Journal of Algebra and Computation 01, no. 02 (1991): 147–60. http://dx.doi.org/10.1142/s0218196791000080.

Full text
Abstract:
The lattice of all complete congruence relations of a complete lattice is itself a complete lattice. In 1988, the second author announced the converse: every complete lattice L can be represented as the lattice of complete congruence relations of some complete lattice K. In this paper we improve this result by showing that K can be chosen to be a complete modular lattice.
APA, Harvard, Vancouver, ISO, and other styles
4

Yu, Bin, Qingguo Li, and Huanrong Wu. "A new view of relationship between atomic posets and complete (algebraic) lattices." Open Mathematics 15, no. 1 (2017): 238–51. http://dx.doi.org/10.1515/math-2017-0027.

Full text
Abstract:
AbstractIn the context of the atomic poset, we propose several new methods of constructing the complete lattice and the algebraic lattice, and the mutual decision of relationship between atomic posets and complete lattices (algebraic lattices) is studied.
APA, Harvard, Vancouver, ISO, and other styles
5

Jakubík, Ján. "Complete retract mappings of a complete lattice ordered group." Czechoslovak Mathematical Journal 43, no. 2 (1993): 309–18. http://dx.doi.org/10.21136/cmj.1993.128396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dai, Songsong. "Rough Approximation Operators on a Complete Orthomodular Lattice." Axioms 10, no. 3 (2021): 164. http://dx.doi.org/10.3390/axioms10030164.

Full text
Abstract:
This paper studies rough approximation via join and meet on a complete orthomodular lattice. Different from Boolean algebra, the distributive law of join over meet does not hold in orthomodular lattices. Some properties of rough approximation rely on the distributive law. Furthermore, we study the relationship among the distributive law, rough approximation and orthomodular lattice-valued relation.
APA, Harvard, Vancouver, ISO, and other styles
7

Bessonov, Yu E., and A. A. Dobrynin. "Lattice complete graphs." Journal of Applied and Industrial Mathematics 11, no. 4 (2017): 481–85. http://dx.doi.org/10.1134/s1990478917040032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Booth, G. L., Q. N. Petersen та S. Veldsman. "Lattices of Radicals of Ω-Groups". Algebra Colloquium 13, № 03 (2006): 381–404. http://dx.doi.org/10.1142/s1005386706000332.

Full text
Abstract:
Snider initiated the study of lattices of the class of radicals, in the sense of Kurosh and Amitsur, of associative rings. Various authors continued the investigation in more general universal classes. Recently, Fernández-Alonso et al. studied the lattice of all preradicals in R-Mod. Our definition of a preradical is weaker than theirs. In this paper, we consider the lattices of ideal maps 𝕀, preradical maps ℙ, Hoehnke radical maps ℍ and Plotkin radical maps 𝔹 in any universal class of Ω-groups (of the same type). We show that 𝕀 is a complete and modular lattice which contains atoms. In genera
APA, Harvard, Vancouver, ISO, and other styles
9

Boyu, Li. "All retraction operators on a complete lattice form a complete lattice." Acta Mathematica Sinica 7, no. 3 (1991): 247–51. http://dx.doi.org/10.1007/bf02583001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Zhongxi, Qingguo Li, and Nan Zhang. "m-Algebraic lattices in formal concept analysis." Mathematical Structures in Computer Science 29, no. 10 (2019): 1556–74. http://dx.doi.org/10.1017/s0960129519000124.

Full text
Abstract:
AbstractThe notion of an m-algebraic lattice, where m stands for a cardinal number, includes numerous special cases, such as complete lattice, algebraic lattice, and prime algebraic lattice. In formal concept analysis, one fundamental result states that every concept lattice is complete, and conversely, each complete lattice is isomorphic to a concept lattice. In this paper, we introduce the notion of an m-approximable concept on each context. The m-approximable concept lattice derived from the notion is an m-algebraic lattice, and conversely, every m-algebraic lattice is isomorphic to an m-ap
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Complete lattice"

1

Pezzoli, Gian Marco. "Representations of symmetric groups on the homology of dual matroids of complete graphs." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18253/.

Full text
Abstract:
This thesis investigates the representations of the symmetric group on the homology of the dual matroid of a complete graph. These representations arise as follows: with each graph we can associate a matroid, by taking the set of edges of the graph as ground set and the edge sets of simple cycles as the circuits of the matroid. We focus on the dual of the matroid of the complete graph. We calculate the homology of the simplicial complex L associated with this matroid. Permuting the vertices of the complete graph induces a permutation on the edge set which is a vertex map of the simplicial comp
APA, Harvard, Vancouver, ISO, and other styles
2

Pogorelcnik, Romain. "Decomposition by complete minimum separators and applications." Thesis, Clermont-Ferrand 2, 2012. http://www.theses.fr/2012CLF22301/document.

Full text
Abstract:
Nous avons utilisé la décomposition par séparateurs minimaux complets. Pour décomposer un graphe G, il est nécessaire de trouver les séparateurs minimaux dans le graphe triangulé H correspondant. Dans ce contexte, nos premiers efforts se sont tournés vers la détection de séparateurs minimaux dans un graphe triangulé. Nous avons défini une structure, que nous avons nommée 'atom tree'. Cette dernière est inspirée du 'clique tree' et permet d'obtenir et de représenter les atomes qui sont les produits de la décomposition. Lors de la manipulation de données à l'aide de treillis de Galois, nous avon
APA, Harvard, Vancouver, ISO, and other styles
3

Almabruk, Bleblou Omalkhear Salem. "Some new lattice valued algebraic structures with comparative analysis of various approaches." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2017. https://www.cris.uns.ac.rs/record.jsf?recordId=105400&source=NDLTD&language=en.

Full text
Abstract:
In this work a comparative analysis of several approaches to fuzzy algebraic structures and comparison of previous approaches to the recent one developed at University of  Novi Sad has been done. Special attention is paid to reducts and expansions of algebraic structures in fuzzy settings. Besides mentioning all the relevant algebras and properties developed in this setting, particular new algebras and properties are developed and investigated. Some new structures, in particular Omega Boolean algebras, Omega Boolean lattices and Omega Boolean rings are developed in the framework of omega
APA, Harvard, Vancouver, ISO, and other styles
4

Serra, Jean. "Eléments de théorique pour l'optique morphologique." Paris 6, 1986. http://www.theses.fr/1986PA066321.

Full text
Abstract:
On définit d'abord la dilatation, ou opération qui commute avec le sup, à quoi l'on associe de manière biunivoque l'érosion, puis par combinaison, l'ouverture et la fermeture morphologiques. On analyse les suites monotones de ces opérateurs et leurs propriétés de continuité. Dans le cas des treillis booléens, deux nouveaux concepts, la connexité et le squelette sont étudiés. La deuxième partie du texte est consacrée au filtrage morphologique (i. E. Operateurs croissants et idempotents) avec quatre applications: les fonctions euclidiennes, les filtres alternes séquentiels, les filtres partition
APA, Harvard, Vancouver, ISO, and other styles
5

Meschke, Christian. "Concept Approximations." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86642.

Full text
Abstract:
In this thesis, we present a lattice theoretical approach to the field of approximations. Given a pair consisting of a kernel system and a closure system on an underlying lattice, one receives a lattice of approximations. We describe the theory of these lattices of approximations. Furthermore, we put a special focus on the case of concept lattices. As it turns out, approximation of formal concepts can be interpreted as traces, which are preconcepts in a subcontext<br>In der vorliegenden Arbeit beschreiben wir einen verbandstheoretischen Zugang zum Thema Approximieren. Ausgehend von einem Kern-
APA, Harvard, Vancouver, ISO, and other styles
6

Cartier, Noémie. "Lattice properties of acyclic pipe dreams." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG065.

Full text
Abstract:
Cette thèse s'inscrit dans le domaine de la combinatoire algébrique. Certains algorithmes de tri peuvent être décrits par des diagrammes appelés réseaux de tri, et l'exécution de ces algorithmes sur des permutations se traduit alors par des arrangements de courbes sur ces réseaux. Ces arrangements donnent des modèles pour des structures combinatoires classiques : par exemple, le treillis de Tamari, dont les relations de couverture sont les rotations sur les arbres binaires, et qui est un quotient bien connu de l'ordre faible sur les permutations. Les complexes de sous-mots généralisent les rés
APA, Harvard, Vancouver, ISO, and other styles
7

Strååt, Johan. "Higher order complexes of distributive lattices." Thesis, KTH, Matematik (Avd.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-165379.

Full text
Abstract:
This thesis explores higher order complexes over distributive lattices and their properties. Computer programs were written to handle these very complex objects, in particular programs that input posets, transform them to distributive lattices, derive the higher order complex of said lattices and then compute their homology groups and ideally also checks if they are shellable. The results of the computer aided exploration inspired proofs of more general results about second order complexes of distributive lattices.<br>Det här examensarbetet undersöker högre ordningskomplex över distributiva la
APA, Harvard, Vancouver, ISO, and other styles
8

Eghosa, Edeghagba Elijah. "Ω-Algebraic Structures". Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2017. https://www.cris.uns.ac.rs/record.jsf?recordId=104206&source=NDLTD&language=en.

Full text
Abstract:
The research work carried out in this thesis is aimed&nbsp;&nbsp; at fuzzifying algebraic and relational structures in the framework of Ω-sets, where Ω is a complete lattice.Therefore we attempt to synthesis universal algebra and fuzzy set theory. Our&nbsp; investigations of Ω-algebraic structures are based on Ω-valued equality, satisability of identities and cut techniques. We introduce Ω-algebras, Ω-valued congruences,&nbsp; corresponding quotient&nbsp; Ω-valued-algebras and&nbsp; Ω-valued homomorphisms and we investigate connections among these notions. We prove that there is an Ω-valued ho
APA, Harvard, Vancouver, ISO, and other styles
9

de, lechtenf@itp uni-hannover. "N=(2$|$2) Supersymmetric Toda Lattice Hierarchy in N=(2$|$2) Superspace." J. Nonlinear Math. Phys. 8 (2001) 183-195, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi913.ps.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cox, Jennifer Jane. "Structure of organic molecular thin films vapour deposited on III-V semiconductor surfaces." Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Complete lattice"

1

Yeh, Chou, and Institute for Computer Applications in Science and Engineering., eds. Complete Galilean-invariant lattice BGK models for the Navier-Stokes equation. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ye, Zhou, and Institute for Computer Applications in Science and Engineering., eds. Complete Galilean-invariant lattice BGK models for the Navier-Stokes equation. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ye, Zhou, and Institute for Computer Applications in Science and Engineering., eds. Complete Galilean-invariant lattice BGK models for the Navier-Stokes equation. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yeh, Chou, and Institute for Computer Applications in Science and Engineering., eds. Complete Galilean-invariant lattice BGK models for the Navier-Stokes equation. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ebeling, Wolfgang. The monodromy groups of isolated singularities of complete intersections. Springer-Verlag, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Eklund, Patrik, Javier Gutiérrez García, Ulrich Höhle, and Jari Kortelainen. Semigroups in Complete Lattices. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78948-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mariano, Bernard N. The espresso encyclopedia: The complete guide for the home preparation of European café-quality espresso, cappuccino & caffè latte. 2nd ed. Trendex International, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Krzysztof, Jarosz, ed. Function spaces in modern analysis: Sixth Conference on Function Spaces, May 18-22, 2010, Southern Illinois University, Edwardsville. American Mathematical Society, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ebeling, Wolfgang. Monodromy Groups of Isolated Singularities of Complete Intersections. Springer London, Limited, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

C, Roy S. Complex Numbers: Lattice Simulation and Zeta Function Applications. Elsevier Science & Technology, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Complete lattice"

1

Grätzer, G. "The Complete Congruence Lattice of a Complete Lattice." In Lattices, Semigroups, and Universal Algebra. Springer US, 1990. http://dx.doi.org/10.1007/978-1-4899-2608-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Darnel, Michael R. "Complete Distributivity." In Theory of Lattice-Ordered Groups. CRC Press, 2021. http://dx.doi.org/10.1201/9781003067337-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Batz, Kevin, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Philipp Schröer. "Latticed k-Induction with an Application to Probabilistic Programs." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_25.

Full text
Abstract:
AbstractWe revisit two well-established verification techniques, k-induction and bounded model checking (BMC), in the more general setting of fixed point theory over complete lattices. Our main theoretical contribution is latticed k-induction, which (i) generalizes classical k-induction for verifying transition systems, (ii) generalizes Park induction for bounding fixed points of monotonic maps on complete lattices, and (iii) extends from naturals k to transfinite ordinals $$\kappa $$ κ , thus yielding $$\kappa $$ κ -induction.The lattice-theoretic understanding of k-induction and BMC enables
APA, Harvard, Vancouver, ISO, and other styles
4

Löhne, Andreas. "A complete lattice for vector optimization." In Vector Optimization. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18351-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Satake, Ichiro, Genjiro Fujisaki, Kazuya Kato, Masato Kurihara, and Shoichi Nakajima. "On the structure of conditionally complete lattice-groups." In Kenkichi Iwasawa Collected Papers. Springer Japan, 2001. http://dx.doi.org/10.1007/978-4-431-67947-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Drygaś, Paweł. "Some Remarks About Idempotent Uninorms on Complete Lattice." In Advances in Fuzzy Logic and Technology 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66830-7_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Hua-wen, and Pei-jun Xue. "T-Seminorms and Implications on a Complete Lattice." In Quantitative Logic and Soft Computing 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15660-1_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kaplansky, Irving. "Any Orthocomplemented Complete Modular Lattice is a Continuous Geometry." In Selected Papers and Other Writings. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5352-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Loeb, Arthur L. "Lattices and Lattice Complexes." In Space Structures. Birkhäuser Boston, 1991. http://dx.doi.org/10.1007/978-1-4612-0437-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kumar, N. V. Narendra, and R. K. Shyamasundar. "A Complete Generative Label Model for Lattice-Based Access Control Models." In Software Engineering and Formal Methods. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66197-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Complete lattice"

1

Feis, Joshua, Sebastian Weidemann, Tom Sheppard, Hannah Price, and Alexander Szameit. "Spacetime-topological events in synthetic photonic lattices." In Complex Light and Optical Forces XIX, edited by David L. Andrews, Enrique J. Galvez, and Halina Rubinsztein-Dunlop. SPIE, 2025. https://doi.org/10.1117/12.3042752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pan, Haiyu, Min Zhang, and Yixiang Chen. "Lattice-Valued Kripke Structures Based on Complete Residuated Lattice." In 2012 International Conference on Software Security and Reliability Companion. IEEE, 2012. http://dx.doi.org/10.1109/sere-c.2012.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Miura, Makoto. "Complete intersection Calabi–Yau threefolds in Hibi toric varieties and their smoothing." In Summer Workshop on Lattice Polytopes. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789811200489_0018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sun, Feng, Xue-ping Wang, Xiao-bing Qu, and Tian-fei Wang. "Square roots of matrices over a complete lattice." In 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology (IFSA-EUSFLAT-15). Atlantis Press, 2015. http://dx.doi.org/10.2991/ifsa-eusflat-15.2015.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cundy, Nigel D. "Complete Monopole Dominance of the Static Quark Potential." In 34th annual International Symposium on Lattice Field Theory. Sissa Medialab, 2017. http://dx.doi.org/10.22323/1.256.0352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xin, Hu, and Duan Chen-dong. "FLIR Image Denoising with Morphological Filters on Complete Lattice." In 2010 2nd International Conference on Information Technology and Computer Science (ITCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/itcs.2010.146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

MAŇUCH, JÁN, and DAYA RAM GAUR. "FITTING PROTEIN CHAINS TO CUBIC LATTICE IS NP-COMPLETE." In 5th Asia-Pacific Bioinformatics Conference. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO., 2007. http://dx.doi.org/10.1142/9781860947995_0018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, Hai, Narendra Shenoy, and William Nicholls. "Timing analysis with crosstalk as fixpoints on complete lattice." In the 38th conference. ACM Press, 2001. http://dx.doi.org/10.1145/378239.379053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

DeGrand, Thomas. "The complete lowest order chiral Lagrangian from a little box." In The XXV International Symposium on Lattice Field Theory. Sissa Medialab, 2008. http://dx.doi.org/10.22323/1.042.0069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

SU, YONG, ZHUDENG WANG, and XUEJUN LIU. "GENERATING LEFT SEMI-UNINORMS AND IMPLICATIONS ON A COMPLETE LATTICE." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0074.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Complete lattice"

1

Borgwardt, Stefan, and Rafael Peñaloza. Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.188.

Full text
Abstract:
Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI, we provide upper complexity bounds that match the complexity of crisp reasoning.
APA, Harvard, Vancouver, ISO, and other styles
2

Shaftan, Timur. Methodology for designing Complex Bend lattice. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1913818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boghosian, Bruce M. Lattice-Gas Models of Complex-Fluid Hydrodynamics. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada380845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Borgwardt, Stefan. The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.204.

Full text
Abstract:
The complexity of reasoning in fuzzy description logics (DLs) over finite lattices usually does not exceed that of the underlying classical DLs. This has recently been shown for the logics between L-IALC and L-ISCHI using a combination of automata- and tableau-based techniques. In this report, this approach is modified to deal with nominals and constants in L-ISCHOI. Reasoning w.r.t. general TBoxes is ExpTime-complete, and PSpace-completeness is shown under the restriction to acyclic terminologies in two sublogics. The latter implies two previously unknown complexity results for the classical
APA, Harvard, Vancouver, ISO, and other styles
5

Branch, Brittany, Paul Specht, Sally Jensen, and Bradley Jared. Transient Deformation in Additively Manufactured 316L Stainless Steel Lattices Characterized with in-situ X-ray Phase Contrast Imaging: The Complete Dataset for Three Geometrical Lattices. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1820238.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yepez, J. DTIC Information for AFOSR Task 2304CP Lattice-Gas Theory and Computation for Complex Fluid Dynamics. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada421715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fredrich, J. T., W. B. Lindquist, D. R. Noble, and R. M. O'Connor. Development, Implementation, and Experimental Validation of the Lattice Boltzmann Method for Modeling Three-Dimensional Complex Flows. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/3865.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ovalle, Samuel, E. Viamontes, and Tony Thomas. Optimization of DLP 3D Printed Ceramic Parts. Florida International University, 2021. http://dx.doi.org/10.25148/mmeurs.009776.

Full text
Abstract:
Digital Light Processing (DLP) 3D printing allows for the creation of parts with advanced engineering materials and geometries difficult to produce through conventional manufacturing techniques. Photosensitive resin monomers are activated with a UV-producing LCD screen to polymerize, layer by layer, forming the desired part. With the right mixture of photosensitive resin and advanced engineering powder material, useful engineering-grade parts can be produced. The Bison 1000 is a research-grade DLP printer that permits the user to change many parameters, in order to discover an optimal method f
APA, Harvard, Vancouver, ISO, and other styles
9

Neyedley, K., J. J. Hanley, P. Mercier-Langevin, and M. Fayek. Ore mineralogy, pyrite chemistry, and S isotope systematics of magmatic-hydrothermal Au mineralization associated with the Mooshla Intrusive Complex (MIC), Doyon-Bousquet-LaRonde mining camp, Abitibi greenstone belt, Québec. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328985.

Full text
Abstract:
The Mooshla Intrusive Complex (MIC) is an Archean polyphase magmatic body located in the Doyon-Bousquet-LaRonde (DBL) mining camp of the Abitibi greenstone belt, Québec. The MIC is spatially associated with numerous gold (Au)-rich VMS, epizonal 'intrusion-related' Au-Cu vein systems, and shear zone-hosted (orogenic?) Au deposits. To elucidate genetic links between deposits and the MIC, mineralized samples from two of the epizonal 'intrusion-related' Au-Cu vein systems (Doyon and Grand Duc Au-Cu) have been characterized using a variety of analytical techniques. Preliminary results indicate gold
APA, Harvard, Vancouver, ISO, and other styles
10

A SIMPLE METHOD FOR A RELIABLE MODELLING OF THE NONLINEAR BEHAVIOUR OF BOLTED CONNECTIONS IN STEEL LATTICE TOWERS. The Hong Kong Institute of Steel Construction, 2022. http://dx.doi.org/10.18057/ijasc.2022.18.1.6.

Full text
Abstract:
The behaviour of bolted connections in steel lattice transmission line towers affects their load-bearing capacity and failure mode. Bolted connections are commonly modelled as pinned or fixed joints, but their behaviour lies between these two extremes and evolves in a nonlinear manner. Accordingly, an accurate finite element modelling of the structural response of complete steel lattice towers requires the consideration of various nonlinear phenomena involved in bolted connexions, such as bolt slippage. In this study, a practical method is proposed for the modelling of the nonlinear response o
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Complete lattice' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography