Related papers: A note on an OACF-preserving operation based on Pa…
The nonlinear Fourier transform discussed in these notes is the map from the potential of a one dimensional discrete Dirac operator to the transmission and reflection coefficients thereof. Emphasis is on this being a nonlinear variant of…
We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…
Machine learning models often suffer from catastrophic forgetting of previously learned knowledge when learning new classes. Various methods have been proposed to mitigate this issue. However, rehearsal-based learning, which retains samples…
This work aims to predict channels in wireless communication systems based on noisy observations, utilizing sequence-to-sequence models with attention (Seq2Seq-attn) and transformer models. Both models are adapted from natural language…
It is well known that increasing functions do not preserve operator order in general; nor do decreasing functions reverse operator order. However, operator monotone increasing or operator monotone decreasing do. In this article, we employ a…
Transformers have driven remarkable breakthroughs in natural language processing and computer vision, yet their standard attention mechanism still imposes O(N^2) complexity, hindering scalability to longer sequences. We introduce…
Anomaly detection in time-series data is crucial for identifying faults, failures, threats, and outliers across a range of applications. Recently, deep learning techniques have been applied to this topic, but they often struggle in…
Tensor decomposition is an important technique for capturing the high-order interactions among multiway data. Multi-linear tensor composition methods, such as the Tucker decomposition and the CANDECOMP/PARAFAC (CP), assume that the complex…
Online Continual Learning (OCL) models continuously adapt to nonstationary data streams, usually without task information. These settings are complex and many traditional CL methods fail, while online methods (mainly replay-based) suffer…
One method of constructing $(a^2+1, 2,a, 1)$-SEDFs (i.e., strong external difference families) in $\mathbb{Z}_{a^2+1}$ makes use of $\alpha$-valuations of complete bipartite graphs $K_{a,a}$. We explore this approach and we provide a…
The paper deals with time-scaling transformations of dynamical systems. Such scaling functions operate a change of coordinates on the time axis of the system trajectories preserving its phase portrait. Exploiting this property, a chaos…
Post-hoc explanation methods for machine learning models have been widely used to support decision-making. One of the popular methods is Counterfactual Explanation (CE), also known as Actionable Recourse, which provides a user with a…
For decades the primary experimental goal in studies of hadronic parity nonconservation (PNC) has been the isolation of the isovector weak nucleon-nucleon interaction, expected to be dominated by long-range pion exchange and enhanced by the…
Error-tolerant applications, such as multimedia processing, machine learning, signal processing, and scientific computing, can produce satisfactory outputs even when approximate computations are performed. Approximate computing (AxC) is…
We consider the problem of stabilization of unstable periodic solutions to autonomous systems by the non-invasive delayed feedback control known as Pyragas control method. The Odd Number Theorem imposes an important restriction upon the…
We investigate the parity-violating nucleon-nucleon potential as obtained in chiral effective field theory. By using resonance saturation we compare the chiral potential to the more traditional one-meson exchange potential. In particular,…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
We report on a study of eclipse timing variations in contact binary systems, using long-cadence lightcurves in the Kepler archive. As a first step, 'observed minus calculated' (O-C) curves were produced for both the primary and secondary…
We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four…