Related papers: Constructing Sequences One Step at a Time
The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.
We introduce a new weak Galerkin finite element method whose weak functions on interior neighboring edges are double-valued for parabolic problems. Based on $(P_k(T), P_{k}(e), RT_k(T))$ element, a fully discrete approach is formulated with…
Quasi-Monte Carlo (QMC) is an essential tool for integral approximation, Bayesian inference, and sampling for simulation in science, etc. In the QMC area, the rank-1 lattice is important due to its simple operation, and nice properties for…
Deep neural networks perform remarkably well in close-world scenarios. However, novel classes emerged continually in real applications, making it necessary to learn incrementally. Class-incremental learning (CIL) aims to gradually recognize…
We propose a quasi-random operator splitting method for evolution equations driven by multiple mechanisms. The method uses a low-discrepancy sequence to generate the ordering of the subflows, while requiring only one application of each…
Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
We give a new method to construct isolated left orderings of groups whose positive cones are finitely generated. Our construction uses an amalgamated free product of two groups having an isolated ordering. We construct a lot of new examples…
The weak Galerkin (WG) finite element method has shown great potential in solving various type of partial differential equations. In this paper, we propose an arbitrary order locking-free WG method for solving linear elasticity problems,…
Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman…
A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae have constant truth value on each cell of…
A new numerical method is devised and analyzed for a type of ill-posed elliptic Cauchy problems by using the primal-dual weak Galerkin finite element method. This new primal-dual weak Galerkin algorithm is robust and efficient in the sense…
This work extends weak KAM theory to the case of a nonsmooth Lagrangian satisfying a superlinear growth condition. Using the solution of a weak KAM equation that is a stationary Hamilton-Jacobi equation and the proximal aiming method, we…
Few-shot segmentation enables the model to recognize unseen classes with few annotated examples. Most existing methods adopt prototype learning architecture, where support prototype vectors are expanded and concatenated with query features…
In this paper, we propose a one-stage online clustering method called Contrastive Clustering (CC) which explicitly performs the instance- and cluster-level contrastive learning. To be specific, for a given dataset, the positive and negative…
Let $S$ be a Scott set, or even an $\omega$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
A general scheme, which includes constructions of coarse-grained (CG) models, weighted ensemble dynamics (WED) simulations and cluster analyses (CA) of stable states, is presented to detect dynamical and thermodynamical properties in…
In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…