scholarly journals Combinatorial Complexity in a Transcriptionally Centered Signaling Hub in Arabidopsis

2014 ◽  
Vol 7 (11) ◽  
pp. 1598-1618 ◽  
Author(s):  
Anne Pfeiffer ◽  
Hui Shi ◽  
James M. Tepperman ◽  
Yu Zhang ◽  
Peter H. Quail
Keyword(s):  
Combinatorial Complexity

Constructible lattices of c-degrees

1982 ◽  
Vol 47 (4) ◽  
pp. 739-754
Author(s):  
C.P. Farrington
Keyword(s):  
Set Theory ◽  
Regular Cardinal ◽  
Boolean Algebras ◽  
Combinatorial Complexity ◽  
Generic Extension ◽  
Transitive Model ◽  
Perfect Set ◽  
Consistency Results ◽  
Combinatorial Principles ◽  
Souslin Trees

This paper is devoted to the proof of the following theorem.Theorem. Let M be a countable standard transitive model of ZF + V = L, and let ℒ Є M be a wellfounded lattice in M, with top and bottom. Let ∣ℒ∣M = λ, and suppose κ ≥ λ is a regular cardinal in M. Then there is a generic extension N of M such that(i) N and M have the same cardinals, and κN ⊂ M;(ii) the c-degrees of sets of ordinals of N form a pattern isomorphic to ℒ;(iii) if A ⊂ On and A Є N, there is B Є P(κ+)N such that L(A) = L(B).The proof proceeds by forcing with Souslin trees, and relies heavily on techniques developed by Jech. In [5] he uses these techniques to construct simple Boolean algebras in L, and in [6] he uses them to construct a model of set theory whose c-degrees have orderlype 1 + ω*.The proof also draws on ideas of Adamovicz. In [1]–[3] she obtains consistency results concerning the possible patterns of c-degrees of sets of ordinals using perfect set forcing and symmetric models. These methods have the advantage of yielding real degrees, but involve greater combinatorial complexity, in particular the use of ‘sequential representations’ of lattices.The advantage of the approach using Souslin trees is twofold: first, we can make use of ready-made combinatorial principles which hold in L, and secondly, the notion of genericity over a Souslin tree is particularly simple.

scholarly journals The Combination of Morphological and Evolutionary Algorithms for Graph-based Pathfinding on Maps with Complex Topologies

2019 ◽  
Author(s):  
Игорь Савостин ◽  
Igor' Savostin ◽  
Андрей Трубаков ◽  
Andrey Trubakov
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Real Data ◽  
Combinatorial Complexity ◽  
Ant Algorithm ◽  
Stochastic Algorithms ◽  
Morphological Operations ◽  
Path Finding ◽  
Large Size ◽  
Dijkstra's Algorithm

One of the difficult problems to solve has always been and still remains the problem of finding a path either in a graphic chart or a graphic maze of large size. The main problem is that traditional algorithms require a lot of time due to combinatorial complexity. At the same time, both classical algorithms based on the search of variants (such as Dijkstra's algorithm, A*, ARA*, D* lite), and stochastic algorithms (ant algorithm, genetic), alongside with algorithms based on morphology (wave) are not always able to achieve the goal. The article proposes a new modification of the path-finding algorithm, which is a hybrid of the following: the morphological operations on graphic chart approach and genetic algorithm having a useful property of elasticity in time. The experiments (both synthetic and real data) have shown the feasibility of the proposed idea and its comparison with the most commonly used algorithms of contemporaneity.

Cognitively Inspired Neural Network for Recognition of Situations

2010 ◽  
Vol 1 (1) ◽  
pp. 36-55 ◽  
Author(s):  
Roman Ilin ◽  
Leonid Perlovsky
Keyword(s):  
Neural Network ◽  
Intelligent Systems ◽  
Combinatorial Complexity ◽  
Neural Modeling ◽  
Mathematical Learning ◽  
Learning Framework

The authors present a cognitively inspired mathematical learning framework called Neural Modeling Fields (NMF). They apply it to learning and recognition of situations composed of objects. NMF successfully overcomes the combinatorial complexity of associating subsets of objects with situations and demonstrates fast and reliable convergence. The implications of the current results for building multi-layered intelligent systems are also discussed.

Let us keep our ontology and epistemology separate!

1999 ◽  
Vol 22 (5) ◽  
pp. 852-853
Author(s):  
William R. Uttal
Keyword(s):  
Combinatorial Complexity ◽  
Thermodynamic Irreversibility

Gold & Stoljar are right in their thesis but incomplete in not pointing out that there are many other arguments from cognate sciences suggesting that a radical eliminativist neuroreductionism is unlikely to be achieved. The radical neuron doctrine they criticize is only a hoped for dogma that cannot be verified, whereas a constrained monistic materialism (with only partial reductionism) is subject to immediate test by applying such criteria as combinatorial complexity and thermodynamic irreversibility.

scholarly journals Depicting combinatorial complexity with the molecular interaction map notation

2006 ◽  
Vol 2 (1) ◽  
pp. 51 ◽  
Author(s):  
Kurt W Kohn ◽  
Mirit I Aladjem ◽  
Sohyoung Kim ◽  
John N Weinstein ◽  
Yves Pommier
Keyword(s):  
Molecular Interaction ◽  
Combinatorial Complexity ◽  
Interaction Map

scholarly journals Combinatorial complexity bounds for arrangements of curves and spheres

1990 ◽  
Vol 5 (2) ◽  
pp. 99-160 ◽  
Author(s):  
Kenneth L. Clarkson ◽  
Herbert Edelsbrunner ◽  
Leonidas J. Guibas ◽  
Micha Sharir ◽  
Emo Welzl
Keyword(s):  
Combinatorial Complexity ◽  
Complexity Bounds

scholarly journals Combinatorial Complexity and Compositional Drift in Protein Interaction Networks

PLoS ONE ◽  
2012 ◽  
Vol 7 (3) ◽  
pp. e32032 ◽  
Author(s):  
Eric J. Deeds ◽  
Jean Krivine ◽  
Jérôme Feret ◽  
Vincent Danos ◽  
Walter Fontana
Keyword(s):  
Protein Interaction ◽  
Protein Interaction Networks ◽  
Combinatorial Complexity ◽  
Interaction Networks
Sign in / Sign up

Export Citation Format

Share Document