相关论文: Multidimensional Divide-and-Conquer and Weighted D…

We present a finite-horizon optimization algorithm that extends the established concept of Dual Dynamic Programming (DDP) in two ways. First, in contrast to the linear costs, dynamics, and constraints of standard DDP, we consider problems…

In this paper, we introduce 3-dimensional $L-$summing method, which is a rearrangement of the summation $\sum A_{abc}$ with $1\leq a,b,c\leq n$. Applying this method on some special arrays, we obtain some identities on the Riemann zeta…

We study how the divide and conquer principle --- partition the available data into subsamples, compute an estimate from each subsample and combine these appropriately to form the final estimator --- works in non-standard problems where…

We develop a recursive scheme, as well as polynomial forms (polynomials in $n$ of degree $m$), for the evaluation of Ledin and Brousseau's Fibonacci sums of the form $S(m,n,r)=\sum_{k=1}^nk^mF_{k + r}$, $T(m,n,r)=\sum_{k=1}^nk^mL_{k + r}$…

Given positive integers $a_1,..., a_n, t$, the fixed weight subset sum problem is to find a subset of the $a_i$ that sum to $t$, where the subset has a prescribed number of elements. It is this problem that underlies the security of modern…

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

A novel linear classification method that possesses the merits of both the Support Vector Machine (SVM) and the Distance-weighted Discrimination (DWD) is proposed in this article. The proposed Distance-weighted Support Vector Machine method…

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…

For a general dyadic grid, we give a Calder\'{o}n-Zygmund type decomposition, which is the principle fact about the multilinear maximal function $\mathfrak{M}$ on the upper half-spaces. Using the decomposition, we study the boundedness of…

In recent years, a significant amount of attention has been paid to solve partial differential equations (PDEs) by deep learning. For example, deep Galerkin method (DGM) uses the PDE residual in the least-squares sense as the loss function…

Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines designed to solve combinatorial optimization problems. They can be physically realized with continuous-time, non-quantum dynamical systems with memory (time…

Divide-and-conquer dividing by a half recurrences, of the form $x_n =a\cdot x_{\left\lceil{n}/{2}\right\rceil}+a\cdot x_{\left\lfloor{n}/{2}\right\rfloor}+p(n)$, $n\geq 2$, appear in many areas of applied mathematics, from the analysis of…

In this paper, we study the sum of the divisor function over sets with digit restrictions.

For an integer b>=2, let s_b(n) be the sum of the digits of the integer n when written in base b, and let S_b(N) be the sum of s_b(n) over n=0,...,N-1, so that S_b(N) is the sum of all b-ary digits needed to write the numbers 0,1,...,N-1.…

We propose a novel decomposition framework for the distributed optimization of Difference Convex (DC)-type nonseparable sum-utility functions subject to coupling convex constraints. A major contribution of the paper is to develop for the…

Marginal Structural Models (MSM) are the most popular models for causal inference from time-series observational data. However, they have two main drawbacks: (a) they do not capture subject heterogeneity, and (b) they only consider fixed…

The multi-user linearly-separable distributed computing problem is considered here, in which $N$ servers help to compute the real-valued functions requested by $K$ users, where each function can be written as a linear combination of up to…

In this paper we introduce the theory of derivatives of moments and (moment) functionals to represent moment functionals by Gaussian mixtures, characteristic functions of polytopes, and simple functions of polytopes. We study, among other…

We study the distribution of the generalized gcd and lcm functions on average. The generalized gcd function, denoted by $(m,n)_b$, is the largest $b$-th power divisor common to $m$ and $n$. Likewise, the generalized lcm function, denoted by…