Results 21 to 30 of about 1,071,502 (272)
Journal of High Energy Physics, 2021 Primordial perturbations in our universe are believed to have a quantum origin, and can be described by the wavefunction of the universe (or equivalently, cosmological correlators). It follows that these observables must carry the imprint of the founding
Scott Melville, Enrico Pajer
doaj +1 more source
MHV gluon scattering in the massive scalar background and celestial OPE
Journal of High Energy Physics, 2023 In this paper we study the tree-level OPE between two positive helicity outgoing gluons in the celestial CFT for the Yang-Mills theory chirally coupled to a massive scalar background. This theory breaks the translation as well as scale invariance.
Shamik Banerjee +3 more
doaj +1 more source
Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application
Mathematics, 2020 In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms.
Yuriy Shablya +2 more
doaj +1 more source
An Energy-Efficient and Fault-Tolerant Convergecast Protocol in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2012 The simple graph theory is commonly employed in wireless sensor networks topology control. An inherent problem of small-granularity algorithms is the high computing complexity and large solution space when managing large-scale WSNs. Computed transmission
Ting Yang, ChunJian Kang, Guofang Nan
doaj +1 more source
A Method for Temporal Fault Tree Analysis Using Intuitionistic Fuzzy Set and Expert Elicitation
IEEE Access, 2020 Temporal fault trees (TFTs), an extension of classical Boolean fault trees, can model time-dependent failure behaviour of dynamic systems. The methodologies used for quantitative analysis of TFTs include algebraic solutions, Petri nets (PN), and Bayesian
Sohag Kabir +4 more
doaj +1 more source
Transforming structures by set interpretations [PDF]
Logical Methods in Computer Science, 2007 We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables.
Thomas Colcombet, Christof Löding
doaj +1 more source
A decidable characterization of locally testable tree languages [PDF]
Logical Methods in Computer Science, Volume 7, Issue 4 (November
22, 2011) lmcs:1210, 2011 A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable. The decidability is shown for ranked trees and for unranked unordered trees.
arxiv +1 more source
Scattering of conformal higher spin fields
Journal of High Energy Physics, 2018 We develop a formalism for describing the most general notion of tree-level scattering amplitudes in 4d conformal higher spin theory. As conformal higher spin fields obey higher-derivative equations of motion, there are many distinct on-shell external ...
Tim Adamo +2 more
doaj +1 more source
Structural theory of trees. I. Branching and condensations of trees [PDF]
arXiv, 2023 Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of \emph{condensed trees}, which are trees in which every node is a branching node.
arxiv
Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree
Algorithms, 2017 The decision tree algorithm is a core technology in data classification mining, and ID3 (Iterative Dichotomiser 3) algorithm is a famous one, which has achieved good results in the field of classification mining.
Yingying Wang +4 more
doaj +1 more source