, 2014 The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r.
Pfender, Michael
core
Feynman rules for the Standard Model Effective Field Theory in R ξ -gauges
Journal of High Energy Physics, 2017 We assume that New Physics effects are parametrized within the Standard Model Effective Field Theory (SMEFT) written in a complete basis of gauge invariant operators up to dimension 6, commonly referred to as “Warsaw basis”.
A. Dedes +4 more
doaj +1 more source
A Family of Optimal Locally Recoverable Codes [PDF]
IEEE Transactions on Information Theory, 2013 A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most r ) other symbols.
Itzhak Tamo, A. Barg
semanticscholar +1 more source
NET v1.0: A framework to simulate permanent damage in elastomers under quasi-static deformations
SoftwareX, 2019 An analytical software for network evolution theory (NET) to describe the macroscopic behavior of filled rubber-like materials at different loading directions is presented.
Vahid Morovati, Roozbeh Dargazany
doaj +1 more source
Constraining the nuclear gluon PDF with inclusive hadron production data
SciPost Physics Proceedings, 2022 The nuclear parton distribution functions (nPDFs) of gluons are known to be difficult to determine with fits of deep inelastic scattering (DIS) and Drell-Yan (DY) data alone.
P. Duwentäster, L. A. Husová, T. Ježo, M. Klasen, K. Kovařík, A. Kusina, K. F. Muzakka, F. I. Olness, I. Schienbein, J.Y. Yu
doaj +1 more source
Sparse Representation-based Open Set Recognition
, 2017 We propose a generalized Sparse Representation- based Classification (SRC) algorithm for open set recognition where not all classes presented during testing are known during training. The SRC algorithm uses class reconstruction errors for classification.
Patel, Vishal M., Zhang, He
core +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
PROPERTIES OF GROUPS G OF DOUBLE ERRORS AND ITS INVARIANTS IN BCH CODES
Системный анализ и прикладная информатика, 2018 The goal of the work is the further extending the scope of application of code automorthism in methods and algorithms of error correction by these codes. The effectiveness of such approach was demonstrated by norm of syndrome theory that was developed by
V. A. Lipnitskij, A. V. Serada
doaj +1 more source
Being comfortable : having and making a comfortable cognitive and environmental habitat : a grounded theory on the meaning of home : a thesis presented in partial fulfillment of the requirements for the degree of Master of Arts in Psychology at Massey University [PDF]
, 2008 Prior research on the meanings of home represents a rather fragmented set of studies. The present research utilises phenomenology and aims to create a grounded theory on the meanings of home which is explorative, participant-led and integrates the ...
Aspinall, Charlotte Nicola
core
Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae
Life, 2017 A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes,
Christian J. Michel +4 more
doaj +1 more source