the paper deals with special types of $l$-ordered sets, $l$-fuzzy complete lattices, and fuzzy directed complete posets.first, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $l$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $l$-fuzzy complete lattice $(p;e)$, then the least fixpoint of $f$ is meet of ...

In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with ice...

To simplify the engineering efforts of implementing the PEP-II lattices, many modifications have been made to these lattices since the conceptual design report[1]. During the development and evolution of the lattices, changes in a lattice would often result in a significant reduction in the dynamic aperture. At such times, we often relied on a non-linear analysis using the one-turn resonance ba...

A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter, each of which can be partitioned into an ideal and a filter, etc., until you reach 1-element lattices. In this note, we find a quasi-equational basis for the pseudoquasivariety of interval dismantlable lattices, and show that there are infinitely many minimal interval non-dismantlable lattices. Define...

We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation. We prove: Theorem 0.1. If K is a tame AEC with amalgamation satisfying a natural definition of superstability (which follows from categoricity in a high-enough cardinal), then for all high-enough λ: (1) The union of an increasing chain of λ-saturated models is λ-...

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

Because of the highly repetitive nature and simple cell structure of FFAG lattices, it is possible to automatically design these lattices. In designing an FFAG lattice, one will try to meet certain constraints and then minimize some cost function by varying any remaining free parameters. I will first review previously published work on optimized FFAG design. Then I will describe recent advances...