Results 191 to 200 of about 3,852,866 (250)
Generating Unconventional Spin‐Orbit Torques With Patterned Phase Gradients in Tungsten Thin Films
ABSTRACT A key aim in spintronics is to achieve current‐induced magnetization switching via spin‐orbit torques without external magnetic fields. For this, the focus of recent work has been on introducing controlled lateral gradients across ferromagnet/heavy‐metal devices, giving variations in thickness, composition, or interface quality.
Lauren J. Riddiford +9 more
wiley +1 more source
Resonant Domain Wall Dynamics in a Three‐Dimensional Magnetic Nano Double Helix
3D magnetic nanostructures promise exciting possibilities for magnetization dynamics. However, experimental realizations remain scarce. In nanoprinted cobalt double helices, time‐resolved X‐ray microscopy reveals harmonic domain wall dynamics. Simulations identify the mode and additional higher‐frequency resonances, revealing a rich dynamic landscape ...
Pamela Morales‐Fernández +15 more
wiley +1 more source
CHARACTERIZING TREES IN CONCEPT LATTICES
Concept lattices are systems of conceptual clusters, called formal concepts, which are partially ordered by the subconcept/superconcept relationship. Concept lattices are basic structures used in formal concept analysis. In general, a concept lattice may contain overlapping clusters and need not be a tree.
Radim Belohlávek +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The approximations in rough concept lattice and approximable concept lattice
Journal of Intelligent & Fuzzy Systems, 2017In a formal context, the lower and upper approximations of an arbitrary set of objects are constructed by object-oriented concepts, attribute-oriented concepts, approximable concepts and weak approximable concepts, respectively. We first define the concept of approximations based on lattice-theoretic operators, and the properties of them are discussed.
Qimei Xiao +3 more
openaire +2 more sources
Constructions of concept lattices
1999A construction method by means of which we obtain from two contexts K1 and K2 a new context, let us say K, can only be a useful construction principle for concept lattices, if it is invariant under reduction. This means that, if the same construction is applied to contexts whose concept lattices are isomorphic to those of K1 and K2, then the concept ...
Bernhard Ganter, Rudolf Wille
openaire +1 more source
Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
Fuzzy Sets and Systems, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L'ubomír Antoni +2 more
openaire +1 more source
Logic Journal of the IGPL, 2005
Summary: We describe a new approach to fuzzify a concept lattice and we show that it is a generalization and common platform for already known approaches: the classical crisp Ganter \& Wille [\textit{B. Ganter} and \textit{R. Wille}, Formal concept analysis. Berlin: Springer (1999; Zbl 0909.06001)] case, the fuzzy Pollandt [\textit{S. Pollandt}, in: G.
openaire +2 more sources
Summary: We describe a new approach to fuzzify a concept lattice and we show that it is a generalization and common platform for already known approaches: the classical crisp Ganter \& Wille [\textit{B. Ganter} and \textit{R. Wille}, Formal concept analysis. Berlin: Springer (1999; Zbl 0909.06001)] case, the fuzzy Pollandt [\textit{S. Pollandt}, in: G.
openaire +2 more sources
Concept Approximation in Concept Lattice
2007In this paper we present a novel approach to the concept approximations in concept lattice. Using the similar idea of rough set theory and unique properties of concept lattice, upper and lower approximations of any object or attribute set can be found by exploiting meet-(union-)irreducible elements in concept lattice, the approximations can be ...
Keyun Hu +4 more
openaire +1 more source
Decompositions of Concept Lattices
1999A complex concept lattice can possibly be split up into simpler parts. Here the mathematical model must prove its worth by providing efficacious and versatile methods for the decomposition. Every such decomposition principle can be reversed to make a construction method.
Bernhard Ganter, Rudolf Wille
openaire +1 more source
Decomposition of Relations and Concept Lattices
Fundamenta Informaticae, 2013We introduce the decomposition of an arbitrary relation into a sequential composition of three relations, viz. of a mapping with a partial order and then the transpose of a mapping. After presenting some basic properties, we investigate the specific classes of junkfree, irreducible and minimal decompositions and show that for all relations a minimal ...
Rudolf Berghammer, Michael Winter 0001
openaire +3 more sources

