$f(Q,T)$ gravity is a novel extension of the symmetric teleparallel where Lagrangian $L$ represented through an arbitrary function nonmetricity $Q$ and trace energy-momentum tensor $T$ \cite{fqt}. In this work, we have constrained widely used model form $f(Q,T) = Q^{n+1} + m T$ from primordial abundances light elements to understand its viability in Cosmology. We report that can elegantly expla...

the study focused on the analysis of production and marketing constraints of tomato among rural farmers in talensi nabdam district of upper east region of ghana.a total of 100 respondents were interviewed using questionnaire. data was analyzed using descriptive statistics to describe the socio economic characteristics of the farmers and kendall’s coefficient of concordance was used to rank the ...

We introduce a new general polynomial-time constructionthe fibre constructionwhich reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction problem CSP(P), where P is any subprojective relational system. As a consequence we get a new proof (not using universal algebra) that CSP(P) is NP -complete for any subprojective (and thus also projective) relational system. The fi...

Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way to achieve efficiency is to consider only the relevant instances that may violate an integrity constraint instead of the whole population of the information base. This is the approach we follow in this paper to autom...

Any implementation of an information system must ensure that an operation is only applied if its execution does not lead to a violation of any of the integrity constraints defined in its conceptual schema. In this paper we propose a method to automatically determine the operations that may potentially violate an OCL integrity constraint in conceptual schemas defined in the UML. This is done by ...

Introduction There is a recurrent view that language processing takes place in a cascade, with grammatical principles acting as an automatic filter on what information is made available to semantic and pragmatic processing mechanisms. Alternatively, one may view grammatical principles and semantic and pragmatic knowledge as applying more or less simultaneously (as the relevant information is en...

This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so is easier to analyze. For example, the exact satisfiability threshold for this problem is known, and the problem has high resolution complexity. In this paper, we prove the problem appears hard for DPLL. Specifically, if we pick...

<p style='text-indent:20px;'>In various applications, such as the computation of energy excitation states electrons and molecules, analysis interstellar clouds, linear response eigenvalue problem, which is a special type Hamiltonian frequently encountered. However, traditional eigensolvers may not be applicable to this problem owing its inherently large scale. In fact, we are usually more...

Conformance checking confronts process models with real process executions to detect and measure deviations between modelled and observed behaviour. The core technique for conformance checking is the computation of an alignment. Current approaches for alignment computation rely on a shortest-path technique over the product of the state-space of a model and the observed trace, thus suffering fro...