arXiv research

Support Vector Data Description (SVDD) is a machine learning technique used for single class classification and outlier detection. SVDD based K-chart was first introduced by Sun and Tsung for monitoring multivariate processes when underlying distribution of process parameters or quality characteristics depart from Norm…

The paper monitors artificial neural networks using embeddings and multivariate control charts.

Research uses deep learning and copulas to predict multivariate survival data.

New method detects bearing faults using multivariate statistical process control.

A new control chart detects shifts in binary data streams quickly and reliably.

The classic N p chart gives a signal if the number of successes in a sequence of inde- pendent binary variables exceeds a control limit. Motivated by engineering applications in industrial image processing and, to some extent, financial statistics, we study a simple modification of this chart, which uses only the most …

The paper monitors stock market relationships using network analysis and statistical control charts.

The paper proves geometric and spectral alignment for deep neural networks.

No minimal charts with exactly seven white vertices found.

A novel bootstrap method improves concept drift detection in predictive models.

Proposes mCS for multivariate selection with FDR control.

In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the fundamental theorems. In the future paper, we give an numeration of the charts …

This paper studies minimal charts of a specific type to understand embedded surfaces in 4-space.

Martingale Doppelgänger-Eval benchmarks VLMs on candlestick evidence vs. trend extrapolation

No minimal chart of type (7) exists.

Multivariate boosted trees improve forecasting and control by capturing correlated predictions.

Hydropower plants are one of the most convenient option for power generation, as they generate energy exploiting a renewable source, they have relatively low operating and maintenance costs, and they may be used to provide ancillary services, exploiting the large reservoirs of available water. The recent advances in In…

No minimal chart of type (4,3) exists in 4-space.

Paper classifies surface-links using charts with specific properties.

The paper studies 4-charts with three crossings and their equivalence to a specific knot.

No minimal chart of type (2,3,2) exists.

Minimal charts of specific type contain unique subgraphs.

In this paper, we shall show a condition for that a chart is C-move equivalent to the product of two charts, the union of two charts $Γ^*$ and $Γ^{**}$ which are contained in disks $D^*$ and $D^{**}$ with $D^*\cap D^{**}=\emptyset$.

Prediction of the future trajectory of a disease is an important challenge for personalized medicine and population health management. However, many complex chronic diseases exhibit large degrees of heterogeneity, and furthermore there is not always a single readily available biomarker to quantify disease severity. Eve…

A method to fix radius distortion in generative models on curved spaces.

Control charts have traditionally been used in industrial statistics, but are constantly seeing new areas of application, especially in the age of Industry 4.0. This paper introduces a new method, which is suitable for applications in the healthcare sector, especially for monitoring a health-characteristic of a patient…

A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a graph called a chart on a surface diagram of $F$. We can simplify a branched cover…

Let $Γ$ be a chart. For each label $m$, we denote by $Γ_m$ the "subgraph" of $Γ$ consisting of all the edges of label $m$ and their vertices. Let $Γ$ be a minimal chart of type $(m;3,3)$. That is, a minimal chart $Γ$ has six white vertices, and both of $Γ_m\capΓ_{m+1}$ and $Γ_{m+1}\capΓ_{m+2}$ consist of three white ve…

A 2-dimensional braid over an oriented surface-knot $F$ is presented by a graph called a chart on a surface diagram of $F$. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves of 1-handles with chart loops, called 1-handle moves, and we investigate how muc…

Classifying streaming data requires the development of methods which are computationally efficient and able to cope with changes in the underlying distribution of the stream, a phenomenon known in the literature as concept drift. We propose a new method for detecting concept drift which uses an Exponentially Weighted M…

A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched covering surface-knot, an addition of 1-handles equipped with cha…

Novel approach integrates Multivariate Square-root Lasso into Synthetic Control for high-dimensional data.

Let $Γ$ be a chart, and we denote by $Γ_m$ the union of all the edges of label $m$. A chart $Γ$ is of type $(3,2,2)$ if there exists a label $m$ such that $w(Γ)=7$, $w(Γ_m\capΓ_{m+1})=3$, $w(Γ_{m+1}\capΓ_{m+2})=2$, and $w(Γ_{m+2}\capΓ_{m+3})=2$ where $w(G)$ is the number of white vertices in $G$. In this paper, we prov…

Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …

New surfaces in 4-ball constructed from knits, described by charts.

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for hyperelliptic Lefschetz fibrations, and show that any hyperelliptic Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

Chart autoencoders learn latent features preserving manifold topology and geometry, with robust denoising capabilities.

We investigate minimal charts with loops, a simple closed curve consisting of edges of label $m$ containing exactly one white vertex. We shall show that there does not exist any loop in a minimal chart with exactly seven white vertices in this paper.

Channel charting (CC) has been proposed recently to enable logical positioning of user equipments (UEs) in the neighborhood of a multi-antenna base-station solely from channel-state information (CSI). CC relies on dimensionality reduction of high-dimensional CSI features in order to construct a channel chart that captu…

We investigate the relationship between measurable differentiable structures on doubling metric measure spaces and derivations. We prove: [1] a decomposition theorem for the module of derivations into free modules; [2] the existence of a measurable differentiable structure assuming that one can control the pointwise up…

Discusses MultiFIT for multivariate dependence, comparing it to HSIC tests.

Introduces Hurewicz fibrations for embedding maps of orbifold charts.

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for genus-two Lefschetz fibrations, and show that any genus-two Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with appropriate weights. We also discuss relations between curves, Grothendieck dessins d'enfa…

We propose channel charting (CC), a novel framework in which a multi-antenna network element learns a chart of the radio geometry in its surrounding area. The channel chart captures the local spatial geometry of the area so that points that are close in space will also be close in the channel chart and vice versa. CC w…

Given a 2-crossing minimal chart $Γ$, a minimal chart with two crossings, set $α=\min\{~i~|~$there exists an edge of label $i$ containing a white vertex$\}$, and $β=\max\{~i~|~$there exists an edge of label $i$ containing a white vertex$\}$. In this paper we study the structure of a neighbourhood of $Γ_α\cupΓ_β$, and p…

The paper proves uniform Temple charts and applies them to null distance metrics.

This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $Γ$ we denote by $Γ_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $Γ$ with exactly two crossings, we can show that the two crossings are contained in $Γ_α\capΓ_β$ f…