Related papers: Dynamic Ordered Weighted Averaging Functions for C…
In this paper, we study the structure of a general framed vertex operator algebra. We show that the structure codes (C,D) of a framed VOA V satisfy certain duality conditions. As a consequence, we prove that every framed VOA is a simple…
Dictionary learning is an effective tool for pattern recognition and classification of time series data. Among various dictionary learning techniques, the dynamic time warping (DTW) is commonly used for dealing with temporal delays,…
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping…
This paper begins with a brief survey of the period prior to and soon after the creation of the theory of vertex operator algebras (VOAs). This survey is intended to highlight some of the important developments leading to the creation of…
In this article, a theory of generalized oscillatory integrals (OIs) is developed whose phase functions as well as amplitudes may be generalized functions of Colombeau type. Based on this, generalized Fourier integral operators (FIOs)…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
Signal alignment has become a popular problem in robotics due in part to its fundamental role in action recognition. Currently, the most successful algorithms for signal alignment are Dynamic Time Warping (DTW) and its variant 'Fast'…
Object navigation tasks require agents to locate specific objects in unknown environments based on visual information. Previously, graph convolutions were used to implicitly explore the relationships between objects. However, due to…
Object oriented data analysis (OODA) aims at statistically analyzing populations of complicated objects. This paper is motivated by a study of cell images in cell culture biology, which highlights a common critical issue: choice of data…
A common problem in data analysis is the separation of signal and background. We revisit and generalise the so-called $sWeights$ method, which allows one to calculate an empirical estimate of the signal density of a control variable using a…
In multiclass deep network classifiers, the burden of classifying samples of different classes is put on a single classifier. As the result the optimum classification accuracy is not obtained. Also training times are large due to running…
The ostrowski inequality expresses bounds on the deviation of a function from its integral mean. The aim of this paper is to establish a new inequality using weight function which generalizes the inequalities of Dragomir, Wang and Cerone…
Multiple rotation averaging is an essential task for structure from motion, mapping, and robot navigation. The task is to estimate the absolute orientations of several cameras given some of their noisy relative orientation measurements. The…
Operator learning seeks to approximate mappings from input functions to output solutions, particularly in the context of partial differential equations (PDEs). While recent advances such as DeepONet and Fourier Neural Operator (FNO) have…
We give the distribution functions, the expected values, and the moments of linear combinations of lattice polynomials from the uniform distribution. Linear combinations of lattice polynomials, which include weighted sums, linear…
In discrete-time linear dynamical systems (LDSs), a linear map is repeatedly applied to an initial vector yielding a sequence of vectors called the orbit of the system. A weight function assigning weights to the points in the orbit can be…
Let $\mathcal{T}_{+}(E)$ be the tensor algebra of a $W^{*}$-correspondence $E$ over a $W^{*}$-algebra $M$. In earlier work, we showed that the completely contractive representations of $\mathcal{T}_{+}(E)$, whose restrictions to $M$ are…
Derivative-free optimization (DFO) has recently gained a lot of momentum in machine learning, spawning interest in the community to design faster methods for problems where gradients are not accessible. While some attention has been given…
Real-world data sets often exhibit temporal dynamics characterized by evolving data distributions. Disregarding this phenomenon, commonly referred to as concept drift, can significantly diminish a model's predictive accuracy. Furthermore,…
For exploratory data analysis, it is often desirable to know what answers you are likely to get before actually obtaining those answers. This can potentially be achieved by designing systems to offer the estimates of a data operation result…