Elementary equivalence classes of generic structures and existentially complete structures

Author(s):  
E. Fisher ◽  
H. Simmons ◽  
W. Wheeler
GERAM ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 30-43
Author(s):  
Muhammad Mukhlis ◽  
Asnawi Asnawi

This research is entitled as "Anecdotal Text in the Oral Story of Yong Dollah Inheritance of Malays as Alternative Choice for Indonesian Language Teaching Materials". It is inspired by the collection of Yong Dollah stories as the inheritance of Malays in Bengkalis Regency which contain of humor elements. In addition, the stories have the same characteristics with anecdotal text, so that it can be applied as teaching material for Indonesia Language subject in the school. This research method was content analysis of descriptive approach. This research was conducted during six months. The technique used to collect data were documentation and interview. The data of this study were the entire generic structure and language features of anecdotal texts contained in a collection of Yong Dollah stories which consisted of 11 stories. The result showed that as following. First, there are five texts contain of complete generic structures and six texts contain of incomplete generic structure which is coda part for data 2, 3, 5, 8, and 1. Second, about language features, there are four data contains of all language features of Anecdote text, but on the other side, there are seven incomplete language features in the texts. Third, the consideration of choosing Yong Dollah as alternative material for Indonesia Language subject refers to eight indicators that are conveyed based on teachers’ perception toward Anecdote text Yong Dolla. 55 % of number of teachers claim that these texts suitable to be implemented as teaching material, but 44% of them claim neutral, and 1% claim disagree on it.


2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.


1989 ◽  
Vol 12 (3) ◽  
pp. 317-356
Author(s):  
David C. Rine

Partitioning and allocating of software components are two important parts of software design in distributed software engineering. This paper presents two general algorithms that can, to a limited extent, be used as tools to assist in partitioning software components represented as objects in a distributed software design environment. One algorithm produces a partition (equivalence classes) of the objects, and a second algorithm allows a minimum amount of redundancy. Only binary relationships of actions (use or non-use) are considered in this paper.


2021 ◽  
pp. 1-18
Author(s):  
YOTAM SMILANSKY ◽  
YAAR SOLOMON

Abstract We prove that in every compact space of Delone sets in ${\mathbb {R}}^d$ , which is minimal with respect to the action by translations, either all Delone sets are uniformly spread or continuously many distinct bounded displacement equivalence classes are represented, none of which contains a lattice. The implied limits are taken with respect to the Chabauty–Fell topology, which is the natural topology on the space of closed subsets of ${\mathbb {R}}^d$ . This topology coincides with the standard local topology in the finite local complexity setting, and it follows that the dichotomy holds for all minimal spaces of Delone sets associated with well-studied constructions such as cut-and-project sets and substitution tilings, whether or not finite local complexity is assumed.


Sign in / Sign up

Export Citation Format

Share Document