arXiv research

Convolutional Neural Networks predict forex trends from charts.

Deep CNN model uses stock bar charts for trading, outperforming Buy and Hold.

In this paper we try to design the necessary calculation needed for backtesting trading systems when only candle chart data are available. We lay particular emphasis on situations which are not or not uniquely decidable and give possible strategies to handle such situations.

Trading strategies improved by classifying financial time-series images.

We propose a new indicator for technical analysis. The indicator emphasizes maximums and minimums in price series with inherent smoothing and has a potential to be useful in both mechanical trading rules and chart pattern analysis.

FinVision uses LLM agents to predict stock markets by processing various financial data types.

MountainLion uses LLMs to interpret financial data and generate investment strategies.

No minimal charts with exactly seven white vertices found.

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

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 …

No minimal chart of type (7) exists.

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.

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

Minimal charts of specific type contain unique subgraphs.

Simplifies surface-knots using chart moves involving black vertices.

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$.

Simplifies surface-knots by adding 1-handles with chart loops.

This paper studies the structure of a specific neighborhood in minimal 2-crossing charts.

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…

Study integrates deep learning with financial data for improved trading strategies.

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

Paper improves channel charting using autoencoders with spatial constraints.

Study uses CNN and LSTM to recognize stock chart patterns.

Enhances trading signals using image analysis and weighted moving averages.

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…

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 autoencoders learn latent features preserving manifold topology and geometry, with robust denoising capabilities.

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.

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.

CC charts radio geometry for user localization.

Agent Trading Arena trains LLMs in real-time financial markets to improve numerical reasoning.

Introduces Hurewicz fibrations for embedding maps of orbifold charts.

Deep learning predicts stock market trends using candlestick 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…

Unified Siamese network for wireless positioning and channel charting.

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

Introduces orbifolds from charts and various topological perspectives.

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…

In this paper, we find a holomorphic Darboux chart around any immersed noncompact holomorphic Legendrian curve in a complex contact manifold $(X,ξ)$. By using such a chart, we show that every holomorphic Legendrian immersion $R\to X$ from an open Riemann surface can be approximated on relatively compact subsets by holo…

Continuing the study of bounded geometry for Riemannian foliations, begun by Sanguiao, we introduce a chart-free definition of this concept. Our main theorem states that it is equivalent to a condition involving certain normal foliation charts. For this type of charts, it is also shown that the derivatives of the chang…

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

FinAgent tackles financial trading with multimodal data and advanced AI.