Results 31 to 40 of about 945,610 (300)
Journal of High Energy Physics, 2022 We calculate the gluonic massive operator matrix elements in the unpolarized and polarized cases, A gg,Q (x, μ 2) and ∆A gg,Q (x, μ 2), at three-loop order for a single mass.
J. Ablinger +7 more
doaj +1 more source
A Novel Histogram Region Merging Based Multithreshold Segmentation Algorithm for MR Brain Images
International Journal of Biomedical Imaging, 2017 Multithreshold segmentation algorithm is time-consuming, and the time complexity will increase exponentially with the increase of thresholds. In order to reduce the time complexity, a novel multithreshold segmentation algorithm is proposed in this paper.
Siyan Liu +3 more
doaj +1 more source
Efficient Heuristics for Structure Learning of k-Dependence Bayesian Classifier
Entropy, 2018 The rapid growth in data makes the quest for highly scalable learners a popular one. To achieve the trade-off between structure complexity and classification accuracy, the k-dependence Bayesian classifier (KDB) allows to represent different number of ...
Yang Liu, Limin Wang, Minghui Sun
doaj +1 more source
The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We give an overview of how a huge class of multisum identities can be proven and discovered with the summation package Sigma implemented in the computer algebra system Mathematica. General principles of symbolic summation are discussed. We illustrate the
Carsten Schneider
doaj +1 more source
06271 Abstracts Collection – Challenges in Symbolic Computation Software [PDF]
, 2006 From 02.07.06 to 07.07.06, the Dagstuhl Seminar 06271 ``Challenges in Symbolic Computation Software'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Decker, Wolfram +3 more
core +1 more source
Using symbolic computation in buckling analysis [PDF]
, 1985 Asymptotic buckling analysis of elastic structures can be considered a well established procedure (Budiansky, 1974) . It consists in bifurcation analysis of a system of oneparameter differential equations: balance, compatibility and constitutive ...
Tatone, A. +4 more
core +1 more source
Robust Structure Learning of Bayesian Network by Identifying Significant Dependencies
IEEE Access, 2019 Bayesian networks have long been a popular medium for graphically representing the probabilistic dependencies which exist in a domain. State-of-the-art tree-augmented naive Bayes (TAN) builds maximum weighted spanning tree to represent 1-dependence ...
Yuguang Long +3 more
doaj +1 more source
IEEE Access, 2020 Accurately identifying protein-ATP (Adenosine-5'-triphosphate) binding sites is significant for protein function annotation and new drug invention. Previous studies often utilize classical machine learning classification algorithms to predict protein-ATP
Jiazhi Song +5 more
doaj +1 more source
Proving and Computing: Applying Automated Reasoning to the Verification of Symbolic Computation Systems [PDF]
, 2014 The application of automated reasoning to the formal verification of symbolic computation systems is motivated by the need of ensuring the correctness of the results computed by the system, beyond the classical approach of testing. Formal verification
Ruiz Reina, José Luis +1 more
core +1 more source
Symbolic computation with fermions
Journal of Symbolic Computation, 1990 A set of REDUCE routines for manipulating operators which anticommute amongst themselves is described. These routines have applications in theories such as supergravity where anticommuting operators are used to represent fermions. The Dirac bracket of the supersymmetry constraints arising in a quantum cosmological model based on N=1 supergravity ...
openaire +2 more sources