Results 111 to 120 of about 523,591 (296)
Automated deduction in Topology: two different approaches
Two approaches to theorem proving in Topology are described and some research problems in the field are given.
Vincenzo Cutello
doaj
When to prove theorems by analogy? [PDF]
In recent years several computational systems and techniques for theorem proving by analogy have been developed. The obvious practical question, however, as to whether and when to use analogy has been neglected badly in these developments. This paper addresses this question, identifies situations where analogy is useful, and discusses the merits of ...
openaire +3 more sources
Vine copula knockoffs for variable selection in gene expression studies
Abstract Identifying clinical and genetic markers is essential for stratifying cancer patients by survival outcomes and guiding personalized treatment strategies. However, gene expression studies often involve high‐dimensional predictors with mixed data types and complex dependence, which complicates reliable variable selection.
José Ulises Márquez Urbina +3 more
wiley +1 more source
Nonparametric maximum likelihood estimation of the survival function using current lifetime data
Abstract An issue when estimating the failure time survival function is how to set up a prevalent cohort study infrastructure to follow subjects after enrollment. This problem can be circumvented through the well‐known Grenander density estimator using current lifetime observations only.
James H. McVittie, Masoud Asgharian
wiley +1 more source
Matkowski’s fixed point theorem in Rm-b-metric spaces
In this paper, we aim to extend the fixed point theorem in metric spaces to Rm-b-metric spaces. By constructing iterated sequences and proving that they are Cauchy sequences, we have established and proven the Matkowski fixed point theorem in Rm-b ...
ThS. Vo Thi Le Hang
doaj +1 more source
Abstract Homogeneous normalized random measures with independent increments represent a broad class of Bayesian nonparametric priors and thus are widely used. In this article, we obtain the strong law of large numbers, the central limit theorem (CLT), and the functional central limit theorem (fCLT) of such measures when the concentration parameter a ...
Junxi Zhang, Shui Feng, Yaozhong Hu
wiley +1 more source
Formal Proof of a Machine Closed Theorem in Coq
The paper presents a formal proof of a machine closed theorem of TLA+ in the theorem proving system Coq. A shallow embedding scheme is employed for the proof which is independent of concrete syntax.
Hai Wan +3 more
doaj +1 more source
Order restricted row‐column cluster randomized design
Abstract This research introduces a novel two‐stage cluster randomized design, the order restricted row‐column cluster randomized design. The new design builds upon the cluster randomized block design by incorporating a second layer of blocking, achieved through ranking cluster units that are randomly sampled from the population.
Dalton Hopper +2 more
wiley +1 more source
Mechanical Theorem Proving in Geometry
Mechanical theorem proving in geometry plays an important role in the research of automated reasoning. In this paper, we introduce three kinds of computerized methods for geometrical theorem proving: the first is Wu ’ s method in the international ...
Gao Jun-yu +3 more
core
Mitigating measurement error in misspecified small area models
Abstract In the framework of Small area estimation, we consider an area‐level model where a subset of covariates is measured with error. The extent of the error is assumed to be constant throughout the areas, and it is expressed by a scalar parameter γ$$ \gamma $$, which multiplies the deterministic covariance matrix of the estimator of the true ...
Diego Battagliese +3 more
wiley +1 more source

