Related papers: New plans orthogonal through the block factor
We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…
A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, then a down step. We find three different forms for the bivariate generating function for plateaus in Motzkin paths, then generalize to longer…
We construct an explicit family of modular iterated integrals which involves cusp forms. This leads to a new method of producing "invariant versions" of iterated integrals of modular forms. The construction will be based on an extension of…
In this work a new empirical tolerance factor for compounds with pyrochlore structure is proposed. This suggested tolerance factor is based on experimental structural data and on the tolerance factors currently proposed. However, since it…
Online, sample-based planning algorithms for POMDPs have shown great promise in scaling to problems with large state spaces, but they become intractable for large action and observation spaces. This is particularly problematic in multiagent…
This article provides an introductory tutorial on structural results in partially observed Markov decision processes (POMDPs). Typically, computing the optimal policy of a POMDP is computationally intractable. We use lattice program- ming…
Given a compact manifold X, the set of simple manifold structures on X x \Delta^k relative to the boundary can be viewed as the k-th homotopy group of a space \S^s (X). This space is called the block structure space of X. We study the block…
A broad class of blocked or jammed configurations of particles on the one-dimensional lattice can be characterized in terms of local rules involving only the lengths of clusters of particles (occupied sites) and of holes (empty sites).…
A method for solving cyclic block three-diagonal systems of equations is generalized for solving a block cyclic penta-diagonal system of equations. Introducing a special form of two new variables the original system is split into three…
The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a parallel algorithm with good scalability and with low…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
In this article we present a method for constructing two-point functions in the spirit of the hexagon proposal, which leads us to propose a "square form factor". Since cutting the square gives us two squares, we can write a consistency…
Designing a robot or structure that can fold itself into a target shape is a process that involves challenges originated from multiple sources. For example, the designer of rigid self-folding robots must consider foldability from geometric…
We define new geometric constants for normed planes, determine their optimal values, and characterize types of planes for which these optimal values are attained. Relations of these constants to several topics, such as areas and distances…
In this paper, we introduce a prime factorization of open meanders, articulated through the framework of 2-colored operads. We demonstrate that each open meander can be canonically constructed from building blocks of two types: iterated…
As collaborative robots move closer to human environments, motion generation and reactive planning strategies that allow for elaborate task execution with minimal easy-to-implement guidance whilst coping with changes in the environment is…
Autonomous systems are often required to operate in partially observable environments. They must reliably execute a specified objective even with incomplete information about the state of the environment. We propose a methodology to…
We study preconditioned gradient-based optimization methods where the preconditioning matrix has block-diagonal form. Such a structural constraint comes with the advantage that the update computation is block-separable and can be…
In exploratory factor analysis, rotation techniques are employed to derive interpretable factor loading matrices. Factor rotations deal with equality-constrained optimization problems aimed at determining a loading matrix based on measure…
Starting from Rodrigues formula we present a general construction of raising and lowering operators for orthogonal polynomials of continuous and discrete variable on uniform lattice. In order to have these operators mutually adjoint we…