相关论文: Analysis of the Harmonic Function Used in Bin-Pack…

Theoretical frameworks used to qualitatively and quantitatively describe nuclear dynamics in solids are often based on the harmonic approximation. However, this approximation is known to become inaccurate or to break down completely in many…

A convenient way to calculate $N$-particle quantum partition functions is by confining the particles in a weak harmonic potential instead of using a finite box or periodic boundary conditions. There is, however, a slightly different…

Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…

Circular-harmonic spectra are a compact representation of local image features in two dimensions. It is well known that the computational complexity of such transforms is greatly reduced when polar separability is exploited in steerable…

We consider the Ordered Open End Bin Packing problem. Items of sizes in $(0,1]$ are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size strictly below $1$. This…

Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and…

We provide analysis of the convergence properties and applicability extensions of flat-histogram algorithms, with a particular focus on the Wang-Landau algorithms (exemplified by converging stochastic approximation Monte Carlo (SAMC)) and…

Fourier Series is the second of monographs we present on harmonic analysis. Harmonic analysis is one of the most fascinating areas of research in mathematics. Its centrality in the development of many areas of mathematics such as partial…

The authors present SHarmonic, a new implementation of the spherical harmonics targeted for electronic-structure calculations. Their approach is to use explicit formulas for the harmonics written in terms of normalized Cartesian…

In 1993, Stanley and Stembridge conjectured that a chromatic symmetric function of any $(3+1)$-free poset is $e$-positive. Guay-Paquet reduced the conjecture to $(3+1)$- and $(2+2)$-free posets which are also called natural unit interval…

In this paper we analyze a hash function for $k$-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin. This generic method was originally introduced by Flajolet and…

We investigate Hardy spaces $H^1_L(X)$ corresponding to self-adjoint operators $L$. Our main aim is to obtain a description of $H^1_L(X)$ in terms of atomic decompositions similar to such characterisation of the classical Hardy spaces…

Recently a new metaheuristic called harmony search was developed. It mimics the behaviors of musicians improvising to find the better state harmony. In this paper, this algorithm is described and applied to solve the container storage…

Sample coordination, where similar instances have similar samples, was proposed by statisticians four decades ago as a way to maximize overlap in repeated surveys. Coordinated sampling had been since used for summarizing massive data sets.…

We tackle the problem of non-preemptive periodic scheduling with a harmonic set of periods. Problems of this kind arise within domains of periodic manufacturing and maintenance, and also during the design of industrial, automotive, and…

This paper investigates a class of algorithms for numerical integration of a function in d dimensions over a compact domain by Monte Carlo methods. We construct a histogram approximation to the function using a partition of the integration…

This paper develops theory for a newly-defined bicomplex hyperbolic harmonic function with four real-dimensional inputs, in a way that generalizes the connection between real harmonic functions with two real-dimensional inputs and complex…

Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems can be used to model task and resource allocation problems in…

In recent years, the throughput requirements of e-commerce fulfillment warehouses have seen a steep increase. This has resulted in various automation solutions being developed for item picking and movement. In this paper, we address the…

We consider the problem of distributedly computing a general class of functions, referred to as gradient-type computation, while maintaining the privacy of the input dataset. Gradient-type computation evaluates the sum of some `partial…