Combinatorial Structures
Combinatorial Structures to Construct Simple Games and Molecules
... consider combinatorial structures defined from combinatorial classes and admissible operators [23], [8], ...from combinatorial structures [6], ...
6
Combinatorial structures and processing in Neural Blackboard Architectures
... Neural Blackboard Architectures (NBAs) can account for variable binding and (novel) combinato- rial processing in neural terms. They also satisfy a number of characteristics of brain representation and processing. ...
9
Simple extensions of combinatorial structures
... standard combinatorial structures, in addition to more general relational structures containing rela- tions of higher ...of structures presents different problems and this is reflected in the ...
23
Profiles of Large Combinatorial Structures
... random combinatorial structures using singularity anal- ysis of generating ...discrete structures at random which is useful both for providing intuition and conjecture and as a possible proof ...
265
Neural blackboard architectures of combinatorial structures in cognition
... In computational terms, a blackboard architecture provides a way to instantiate the parts and the relations of combinatorial structures. A blackboard architecture consists of a set of specialized processors ...
59
Finding combinatorial structures
... By contrast, suppose that G is a bipartite graph on n vertices such that no bipartition of G contains SI (2, 1) with the given bipartition. If G contains a vertex x of degree two or greater, then G must be connected and ...
163
Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices.
... The second section, some of which was presented at the Formal Power Series and Algebriac Combinatorics conference (FPSAC), discusses the author's work on several conjectures relating to parking functions and to Tesler ...
128
Partitions of combinatorial structures
... He conjectured that one possible extremal n-vertex K^-free 3-graph is that in which the n vertices are equipartitioned into three classes, Vi, V 2 , V 3 , and where the edges are those triples that intersect all the V^’s ...
160
Well quasi ordering of combinatorial structures
... In Section 7.2 we prove that the class of split permutation graphs and its analog a class of bichain graphs are minimal classes of unbounded clique-width and in Section 7.3 we prove that[r] ...
158
A unified approach to combinatorial key predistribution schemes for sensor networks
... of combinatorial structures such as designs and ...for combinatorial key predistribution ...underlying combinatorial structure into our general ...for combinatorial key predistribution ...
29
P R O FI L E S OFLARGE COM BINATORIAL STRUCTURES
... logarithmic combinatorial structures of [ABT03] are another example; cycle structure of permutations, factorizations of polynomials in finite fields, connected components of certain forests, prime factor- ...
262
Optimization of a control network for binding in combinatorial sentence structures
... on combinatorial structures. Humans use combinatorial structures in language by combining vowels and consonants into syllables, syllables into words and words into sentences (Zuidema & de ...
66
Combinatorial Species and Labelled Structures
... of combinatorial species has been similarly successful in the area of ...rial structures or ...many combinatorial objects of interest could be constructed algebraically, and in which those algebraic ...
209
Combinatorics
... combined combinatorial arguments with fairly elementary probabilistic techniques, whereas the development of the method in recent years required the application of more sophisticated tools from ...random ...
5
Interfacing native and non-native peptides: using Affimers to recognise α-helix mimicking foldamers.
... foldamer structures (a) bottom-up foldamer construction (b) PPI inhibition using foldamers (c) protein-prosthesis (d) combinatorial selection of peptides for foldamers (e) N-alkylated aromatic oligoamide ...
5
Hybrid Design of Scalable Key Distribution for Wireless Sensor Networks
... contrast with prior work, our approach is combinatorial based on Combinatorial Block Designs. We showed how to map from two classes of combinatorial designs to deterministic key distribution ...
6
Combinatorial geometry
... Any function r : 2SZ which is semimodular, normalized, increasing, unit increasing and has the finite basis property is the rank function of a unique pregeometry on S, having closure giv[r] ...
187
Combinatorial Disambiguation
... It should be noted that the transformation rules for syntactic choice points also include "fixup specifications" not shown above indicating how result semantic functions and attachments [r] ...
10
Combinatorial dynamics
... The subword complexity functions o f sequences over a finite alphabet have been studied extensively in the literature ([AMST], [AR], [ELR], [F], [Kl], [Pan], [R]). There is also a survey on the subject in [A]. One o f ...
102
An Overview of the Geometry and Combinatorics of the Macdonald Polynomial and q-t Catalan Number
... the combinatorial and geometric properties related to the Macdonald polynomials and the diagonal ...the combinatorial Macdonald polynomial formula that ts the de ning conditions ...
65