Results 21 to 30 of about 275,299 (260)
Occurrence of Associated Elements in a Copper Mine by EDX-SEM
BACKGROUND Associated elements in copper deposits are of high economic value. However, they are difficult to locate and utilize because of their fine (micrometer to nanometer) size.
WANG Guan +4 more
doaj +1 more source
AbstractIf T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion such that, in any -generic extension of the universe, there are non-isomorphic models M1 and M2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete
Laskowski, M. C., Shelah, Saharon
openaire +3 more sources
Jordan Isomorphisms on Nest Subalgebras
This paper is devoted to the study of Jordan isomorphisms on nest subalgebras of factor von Neumann algebras. It is shown that every Jordan isomorphism ϕ between the two nest subalgebras algMβ and algMγ is either an isomorphism or an anti-isomorphism.
Aili Yang
doaj +1 more source
Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
The paper proposes an algorithm for solving the problem of finding the maximum common subgraph. Both the sequential and the parallel version of the algorithm, their software implementation are described, and an experimental study of their effectiveness ...
Vladimir V. Vasilchikov
doaj +1 more source
Isomorphic cohomology yields isomorphic homology
Given a map \(f:X\rightarrow Y\) of locally compact Hausdorff spaces, \textit{W. S. Massey} [Algebraic topology: an introduction (1967; Zbl 0153.24901)] has shown that if \(f\) induces an isomorphism \(H^n(X;{\mathbb{Z}})\cong H^n(Y;{\mathbb{Z}})\) for all \(n\geq 0\), then \(f\) induces an isomorphism in homology with coefficients in any abelian group.
Golasinksi, Marek, Lima Goncalves, D.
openaire +1 more source
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar +2 more
core +5 more sources
Titanium silicalite‐1 (TS‐1), used in industrial selective oxidation processes, depends on specific, yet still unresolved Ti sites, dispersed within the framework of an MFI‐zeolite. Applying high field (28.2 T) 47/49Ti NMR and 17O NMR spectroscopy for an array of TS‐1 catalysts enables the development of an NMR crystallography protocol and the ...
Christoph J. Kaul +14 more
wiley +2 more sources
An Optimization of Closed Frequent Subgraph Mining Algorithm
Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
In this article, we apply a new class of fuzzy control functions to approximate a Cauchy additive mapping in fuzzy Banach space (FBS). Further, considering the unital FBS (UFBS), we will investigate the isomorphisms defined in this space.
Zahra Eidinejad +2 more
doaj +1 more source
We describe a Monte Carlo study examining the impact of assuming item isomorphism (i.e., equivalent construct meaning across levels of analysis) on conclusions about homology (i.e., equivalent structural relations across levels of analysis) under varying
Nigel eGuenole
doaj +1 more source

