相关论文: Recursive process for constructing the refinement …
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of explicit type annotations in typical scripting languages forces programmers to must (re)discover critical pieces of design information…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
The flux reconstruction (FR) approach offers a flexible framework for describing a range of high-order numerical schemes; including nodal discontinuous Galerkin and spectral difference schemes. This is accomplished through the use of…
We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…
We propose a regularization scheme for image reconstruction that leverages the power of deep learning while hinging on classic sparsity-promoting models. Many deep-learning-based models are hard to interpret and cumbersome to analyze…
We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…
This article continues the investigation started in [9] on subdivision schemes refining 2D point-normal pairs, obtained by modifying linear subdivision schemes using the circle average. While in [9] the convergence of the Modified…
Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…
Interpolatory subdivision schemes generate smooth curves from piecewise-linear control polygons by repeatedly inserting new vertices. Classical schemes rely on a single global tension parameter and typically require separate formulations in…
In this paper subdivision schemes, which are used for functions approximation and curves generation, are considered. In classical case, for the functions defined on the real line, the theory of subdivision schemes is widely known due to…
Automatic parameter tuning methods for planning algorithms, which integrate pipeline approaches with learning-based techniques, are regarded as promising due to their stability and capability to handle highly constrained environments. While…
Neural machine translation (NMT) models generally adopt an encoder-decoder architecture for modeling the entire translation process. The encoder summarizes the representation of input sentence from scratch, which is potentially a problem if…
Tree-structured LSTM is promising way to consider long-distance interaction over hierarchies. However, there have been few research efforts on the hyperparameter tuning of the construction and traversal of tree-structured LSTM. To name a…
An important yet challenging problem in understanding indoor scene is recovering indoor frame structure from a monocular image. It is more difficult when occlusions and illumination vary, and object boundaries are weak. To overcome these…
A renormalization-group scheme is developed for the 3-dimensional O($2N$)-symmetric Ginzburg-Landau-Wilson model, which is consistent with the use of a 1/N expansion as a systematic method of approximation. It is motivated by an application…
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations of high order. In this paper, we introduce a control refinement…
Calculating averages with respect to probability measures on submanifolds is often necessary in various application areas such as molecular dynamics, computational statistical mechanics and Bayesian statistics. In recent years, various…
In this paper, we propose a class of super-schemes for efficiently solving nonlinear unconstrained optimization problems. The proposed approach introduces two novel choices of step-size parameters, leading to efficient descent directions…
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…