Results 261 to 270 of about 910,379 (294)
Some of the next articles are maybe not open access.
2023
This thesis addresses a significant problem in numerous scientific fields - the challenge of determining whether two sets of data are statistically identical, a procedure known as a two-sample homogeneity test. Various methods, including well-known parametric tests like t-tests and analysis of variance (ANOVA), have been employed for two-sample ...
openaire +1 more source
This thesis addresses a significant problem in numerous scientific fields - the challenge of determining whether two sets of data are statistically identical, a procedure known as a two-sample homogeneity test. Various methods, including well-known parametric tests like t-tests and analysis of variance (ANOVA), have been employed for two-sample ...
openaire +1 more source
Ranking Functions over Labelings
2018We study rankings over labelings as a generalization of traditional labeling-based semantics in abstract argumentation. Our approach is an alternative to recent developments on rankings over arguments. The formal basis is a qualitative abstraction of probability theory called ranking theory. We propose a fundamental property, called SCC stratification,
Rienstra Tjitze, Thimm Matthias
openaire +1 more source
1984
Let X be a reduced irreducible complex space and K(X) be the field of meromorphic functions on X. A subfield A of K(X) is called rank complete or analytically closed in K(X) if it has the following property: Let {f1,..,fk} be a system of elements of A and f∈ K(X) a meromorphic function analytically dependent on {f1,..,fk}, then f ∈ A.
openaire +1 more source
Let X be a reduced irreducible complex space and K(X) be the field of meromorphic functions on X. A subfield A of K(X) is called rank complete or analytically closed in K(X) if it has the following property: Let {f1,..,fk} be a system of elements of A and f∈ K(X) a meromorphic function analytically dependent on {f1,..,fk}, then f ∈ A.
openaire +1 more source
Ranking functions for size-change termination
ACM Transactions on Programming Languages and Systems, 2009This article explains how to construct a ranking function for any program that is proved terminating by size-change analysis . The “principle of size-change termination” for a first-order functional language with well-ordered data is intuitive: A program terminates on all inputs, if
openaire +2 more sources
Rotationally Invariant Rank 1 Convex Functions
Applied Mathematics & Optimization, 2001The author deals with functions defined on the set \(M^{n\times n}\) of all \(n\) by \(n\) real matrices. If such a function \(f\) is rotationally invariant with respect to the proper orthogonal group, then it has a representation \(\widetilde{f}\) through the signed singular values of the matrix argument \(A\in M^{n\times n}\).
openaire +2 more sources
Piecewise-Defined Ranking Functions
2013We present the design and implementation of an abstract domain for proving program termination by abstract interpretation. The domain automatically synthesizes piecewise-defined ranking functions and infers sufficient conditions for program termination.
openaire +1 more source
A generic ranking function discovery framework by genetic programming for information retrieval
Information Processing and Management, 2004Weiguo Fan, Praveen Pathak
exaly