Filters








1,227,654 Hits in 9.4 sec

Index sets for some classes of structures

Ekaterina B. Fokina
2009 Annals of Pure and Applied Logic  
For a class K of structures, closed under isomorphism, the index set is the set I(K ) of all indices for computable members of K in a universal computable numbering of all computable structures for a fixed  ...  For a class K of structures, closed under isomorphism, the index set is the set I(K ) = {e : ∃B ∈ K ϕ e = χ D(B)  ...  The formula for d i,j is Having the result for graphs, we can apply Theorem 9 and get the result for lattices.  ... 
doi:10.1016/j.apal.2008.09.006 fatcat:xjvlkxm425cthbfwtk5cx5sa7i

Indiscernibles, EM-Types, and Ramsey Classes of Trees

Lynn Scow
2015 Notre Dame Journal of Formal Logic  
It was shown in sc12 that for a certain class of structures , -indexed indiscernible sets have the modeling property just in case the age of is a Ramsey class.  ...  As a corollary, we may conclude that certain classes of finite trees are Ramsey, some previously known. See updated paper for new references.  ...  some set I that is an I-indexed indiscernible for some choice of structure I on I.  ... 
doi:10.1215/00294527-3132797 fatcat:2qkcv7zpnbdyhmeek444zhshpm

Equivalence Relations on Classes of Computable Structures [chapter]

Ekaterina B. Fokina, Sy-David Friedman
2009 Lecture Notes in Computer Science  
In the present paper we study the status of these Σ 1 1 equivalence relations (on classes of computable structures with hyperarithmetical index set) within the class of Σ 1 1 equivalence relations as a  ...  If K is a class of L-structures closed under isomorphism we denote by K c the set of all computable members of K.  ...  For a class K of structures, closed under isomorphism, the index set I(K) is the set of all indices of computable members in K.  ... 
doi:10.1007/978-3-642-03073-4_21 fatcat:tkc2imruzrc2zg44ygekmrtoe4

Improving XML Query Performance Using Social Classes [chapter]

Weining Zhang, Douglas Pollok
2004 Lecture Notes in Computer Science  
The positions of data nodes, the social classes of data nodes, and the required social classes of query nodes are used during query evaluation to provide an effective mechanism for filtering and indexing  ...  Then during query compilation, queries are analyzed to determine required structural relations among query nodes and to derive required social classes for each individual query node.  ...  However, for some datasets, the graph index may become much larger than the data tree itself.  ... 
doi:10.1007/978-3-540-24655-8_17 fatcat:ot2zdhuocfbn5faup3cfbmykpq

COMPARISON OF DATA MINING ALGORITHMS, INVERTED INDEX SEARCH AND SUFFIX TREE CLUSTERING SEARCH

Miloš Ilić, Dejan Rančić, Petar Spalević
2016 Facta Universitatis Series Automatic Control and Robotics  
On the other hand, an inverted index is a structure that provides fast search too, but this structure does not create clusters or groups of similar data.  ...  Data mining works with large amount of data sets and offers data to the end user; it consists of many different techniques and algorithms.  ...  The application created for inverted index algorithm In this part of paper, we are describing our application that uses an inverted index structure to search some query in a set of text documents.  ... 
doi:10.22190/fuacr.v15i3.1836 fatcat:jj3urpknpzcsbj6lr3qhdbmyc4

COMPARISON OF DATA MINING ALGORITHMS, INVERTED INDEX SEARCH AND SUFFIX TREE CLUSTERING SEARCH

Miloš Ilić, Dejan Rančić, Petar Spalević
2016 Facta Universitatis Series Automatic Control and Robotics  
On the other hand, an inverted index is a structure that provides fast search too, but this structure does not create clusters or groups of similar data.  ...  Data mining works with large amount of data sets and offers data to the end user; it consists of many different techniques and algorithms.  ...  The application created for inverted index algorithm In this part of paper, we are describing our application that uses an inverted index structure to search some query in a set of text documents.  ... 
doi:10.22190/fuacr1603171i fatcat:f4odzmliovgmbkpzjgymmhesz4

Mining a Large Database for Peptidomimetic Ring Structures Using a Topological Index

Alan H. Lipkus
1999 Journal of chemical information and computer sciences  
A topological index that characterizes the way in which a substructure is imbedded in the rings of a structure was recently introduced as a tool for analyzing large substructure-search answer sets.  ...  The strategy is to run a very general substructure search and then extract from the answer set those structures with the least common index values.  ...  Figure 2 . 2 Typical structures from some of the largest RIQI classes. Figure 3 . 3 Representative structures for RIQI classes a-f (see Figure 4 . 4 Same asFigure 3but for RIQI classes g-m.  ... 
doi:10.1021/ci980151+ fatcat:4qvzkniggrdcfm74ipzn7q2rca

Partial evaluation for efficient access to inheritance lexicons [chapter]

Sven Hartrumpf
2000 Current issues in linguistic theory  
I identify the parts of a lexicon which should be evaluated, and show how partial evaluation works for inheritance lexicons.  ...  After showing two basic strategies for lookup in inheritance lexicons, a compromise is developed which combines to a large degree (from a practical point of view) the advantages of both strategies and  ...  main feature structure, the default feature structure, and the set of variant feature structures, respectively, of class c i .  ... 
doi:10.1075/cilt.189.08har fatcat:iic5x46eyrfonlndtyxpfbvgfe

Page 3996 of Mathematical Reviews Vol. , Issue 83j [page]

1983 Mathematical Reviews  
Each such class contains an index set (a set consisting of all indices of some class of r.e. sets) which is 1-complete for the class. L.  ...  Hay conjectured that this was true for all naturally defined classes of sets and that, moreover, every index set is 1-complete for some such class of sets.  ... 

Characterization of NIP theories by ordered graph-indiscernibles [article]

Lynn Scow
2011 arXiv   pre-print
set.  ...  We use a generalized form of indiscernibles from sh78: in our notation, a sequence of parameters from an L-structure M, (b_i : i ∈ I), indexed by an L'-structure I is L'-generalized indiscernible in M  ...  Many thanks to Baldwin, Goodrick and Laskowski for their suggestions to eliminate reference to the "random ordered graph", R, in order to simplify the main result and to Kojman for pointing us towards  ... 
arXiv:1106.5153v2 fatcat:ocouy2ndznfibbprnbcdfxhhra

Computing the Reverse Eccentric Connectivity Index for Certain Family of Nanocone and Fullerene Structures

Wei Gao, Mohammad Reza Farahani
2016 Journal of Nanotechnology  
In this paper, we determine the reverse eccentric connectivity index of one family of pentagonal carbon nanoconesPCN5[n]and three infinite families of fullerenesC12n+2, C12n+4, andC18n+10based on graph  ...  structures.  ...  By means of the structure of fullerenes 12 +4 , we ensure that (V) = 9 for arbitrary V ∈ ( 12 +4 ). According to the value of ec(V), the set ( 12 +4 ) can be divided into two classes.  ... 
doi:10.1155/2016/3129561 fatcat:36uo2jfn5ne6tp2n55l4zhpbia

Performance formula-based optimal deployments of multilevel indices for service retrieval

Yan Wu, Wei Xu, Lu Liu, Dejun Miao
2017 Concurrency and Computation  
Different service sets maybe have different characteristics that may affect performance from different aspects. For a given service set, which index structure is the most optimal one?  ...  There are many different index structures for service repositories, such as sequential index, inverted index and multilevel indices that includes three deployments.  ...  . • is denote a set of parameter, which • is= • Cs for Csis. R2 denotes a set of all input-similar classes. Ck denotes a key class that is a set of input-similar class with the same key.  ... 
doi:10.1002/cpe.4265 fatcat:tuovfpyxn5e2lia6zpsoxybknu

What Was the Syntax-Semantics Debate in the Philosophy of Science About?

Sebastian Lutz
2015 Philosophy and Phenomenological Research  
The debate between critics of syntactic and semantic approaches to the formalization of scientific theories has been going on for over 40 years.  ...  dependence of syntactic and semantic approaches.  ...  For two indexed structures are isomorphic given their index sets, so that changing the index sets of two isomorphic structures can render them non-isomorphic, and changing the index sets of two non-isomorphic  ... 
doi:10.1111/phpr.12221 fatcat:aasjrgy3dvheln3mstpremkxge

Generalising Automaticity to Modal Properties of Finite Structures [chapter]

A. Dawar, S. Kreutzer
2002 Lecture Notes in Computer Science  
The function that takes Ò to the size of the smallest labelling system doing this is called the labelling index of the property.  ...  From this we derive several separation results of modal and non-modal fixed-point logics, some of which are already known whereas others are new.  ...  Assume otherwise and suppose that for some Ò ¾ there is a labelling system Ä of size less than Ò accepting the class Ò of structures from of rank at most Ò.  ... 
doi:10.1007/3-540-36206-1_11 fatcat:tgw2ps565rditmiphtx7uxomta

Oligomorphic Permutation Groups [chapter]

Peter J. Cameron
2009 Perspectives in Mathematical Sciences II  
A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of n-tuples of elements of Ω).  ...  such as simplicity, the small index property, and "almost-freeness".  ...  If G i is a transitive permutation group on Ω i for i ∈ I, where I is some index set, the cartesian product i∈I G i is the set of functions f : I → i∈I G i satisfying f (i) ∈ G i for all i ∈ I.  ... 
doi:10.1142/9789814273657_0003 fatcat:kxt2dwfkpvc45kfjwjkb2j6qma
« Previous Showing results 1 — 15 out of 1,227,654 results