Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

1223 · Nov 201819922001200920172026
48 results for computer-assisted

Researchers solved the multiple fibration problem for Seifert 3-orbifolds.

problem Determining all inequivalent fibrations of closed orientable Seifert three-orbifolds.
method Geometric and direct arguments for R3\mathbb{R}^3 and S2imesR\mathbb{S}^2 imes \mathbb{R} geometries; computer-assisted for S3\mathbb{S}^3.
result Complete solution for R3\mathbb{R}^3 and S2imesR\mathbb{S}^2 imes \mathbb{R} geometries, recovering previous results.

We prove two conjectures of C. Gordon. We show that the maximal number of exceptional Dehn surgeries on a 1-cusped hyperbolic 3-manifold is 10, and that the maximal intersection number between exceptional slopes is 8. The proof uses a combination of new geometric techniques and a rigorous computer-assisted calculation.

2008-08-08abs ↗pdf ↗

Quantum computing improves fault diagnosis in industrial processes.

problem Fault detection and diagnosis in industrial process systems.
method Integrates quantum computing and deep learning to extract features and diagnose faults.
result Quantum-assisted deep learning achieves high fault detection rates (79.2% and 99.39%).

The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture.…

2005-08-11abs ↗pdf ↗

We prove the Goldman-Parker Conjecture: A complex hyperbolic ideal triangle group is directly embedded in PU(2,1) if and only if the product of its three standard generators is not elliptic. We also prove that such a group is indiscrete if the product of its three standard generators is elliptic. A novel feature of thi…

2001-05-01abs ↗pdf ↗

We consider the problem of classifying business process instances based on structural features derived from event logs. The main motivation is to provide machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from p…

2017-10-08abs ↗pdf ↗

Paper proves existence of a CMC hypertorus in 4D sphere using numerical methods.

problem Proving the existence of a constant mean curvature (CMC) hypertorus in \(S^4\).
method Employed the round Taylor method with rational arithmetic and the Poincare-Miranda theorem.
result Existence of a constant mean curvature (CMC) hypertorus in \(S^4\).

We present a general method to compute a presentation for any cusped arithmetic hyperbolic lattice ΓΓ, applying a classical result of Macbeath to a suitable ΓΓ-invariant horoball cover of the corresponding symmetric space. As applications we compute presentations for the Picard modular groups ${\rm PU}(2,1,\mathcal{O…

2017-09-20abs ↗pdf ↗

New contractible domains on half-sphere with constant boundary Laplacian eigenfunctions.

problem Existence of contractible domains with specific boundary conditions.
method Local bifurcation argument around geodesic disks, anisotropic Hölder spaces, computer-assisted techniques.
result Existence of nontrivial contractible domains on half-sphere with constant boundary Laplacian eigenfunctions.

Articulatory distinctive features, as well as phonetic transcription, play important role in speech-related tasks: computer-assisted pronunciation training, text-to-speech conversion (TTS), studying speech production mechanisms, speech recognition for low-resourced languages. End-to-end approaches to speech-related tas…

2019-07-02abs ↗pdf ↗

Automated surgical workflow analysis and understanding can assist surgeons to standardize procedures and enhance post-surgical assessment and indexing, as well as, interventional monitoring. Computer-assisted interventional (CAI) systems based on video can perform workflow estimation through surgical instruments' recog…

2018-07-17abs ↗pdf ↗

We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the nature of optimal upper bounds in real fewnomial theory. We use a powerful recen…

2006-09-18abs ↗pdf ↗

We address the problem of combining sequence models of symbolic music with user defined constraints. For typical models this is non-trivial as only the conditional distribution of each symbol given the earlier symbols is available, while the constraints correspond to arbitrary times. Previously this has been addressed …

2019-09-10abs ↗pdf ↗

Let ΓΓ be the fundamental group of a surface of finite type and Comm(Γ)(Γ) be its abstract commensurator. Then Comm(Γ)(Γ) contains the solvable Baumslag--Solitar groups a,b:aba1=bn\langle a ,b : a b a^{-1} = b^n \rangle for any n>1n > 1. Moreover, the Baumslag--Solitar group a,b:ab2a1=b3\langle a ,b : a b^2 a^{-1} = b^3 \rangle has an imag…

2018-10-29abs ↗pdf ↗

This paper introduces a rigorous computer-assisted procedure for analyzing hyperbolic 3-manifolds. This technique is used to complete the proof of several long-standing rigidity conjectures in 3-manifold theory as well as to provide a new lower bound for the volume of a closed orientable hyperbolic 3-manifold. We prove…

1996-09-13abs ↗pdf ↗

The simplest non-collision solutions of the N-body problem are the "relative equilibria", in which each body follows a circular orbit around the centre of mass and the shape formed by the N bodies is constant. It is easy to see that the moment of inertia of such a solution is constant. In 1970, D. Saari conjectured tha…

2005-10-01abs ↗pdf ↗

We consider the problem of locating a point-source heart arrhythmia using data from a standard diagnostic procedure, where a reference catheter is placed in the heart, and arrival times from a second diagnostic catheter are recorded as the diagnostic catheter moves around within the heart. We model this situation as a …

2018-07-09abs ↗pdf ↗

New Einstein metrics constructed on complex line bundle over CP1.

problem Constructing SU(2)SU(2)-invariant negative Einstein metrics on complex line bundles.
method Rigorous numerics to approximate, then fixed-point methods to perturb to genuine Einstein metrics.
result Complete, asymptotically hyperbolic Einstein metrics constructed.

We study the problem of computer-assisted teaching with explanations. Conventional approaches for machine teaching typically only provide feedback at the instance level e.g., the category or label of the instance. However, it is intuitive that clear explanations from a knowledgeable teacher can significantly improve a …

2018-02-20abs ↗pdf ↗

Builds a novel educational recommender for lifelong learners.

problem Challenges in creating scalable and transparent models for lifelong learning.
method Integrative approach combining content novelty, background knowledge, and learner engagement.
result TrueLearn achieves promising performance while retaining a human interpretable learner model.

A general question behind this paper is to explore a good notion for intrinsic curvature in the framework of noncommutative geometry started by Alain Connes in the 80s. It has only recently begun (2014) to be comprehended via the intensive study of modular geometry on the noncommutative two tori. In this paper, we exte…

2015-10-15abs ↗pdf ↗

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.

We study the translation surfaces obtained by considering the unfoldings of the surfaces of Platonic solids. We show that they are all lattice surfaces and we compute the topology of the associated Teichmüller curves. Using an algorithm that can be used generally to compute Teichmüller curves of translation covers of p…

2018-11-09abs ↗pdf ↗

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number cc grows exponentially with cc, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings. Instead, we consider diagrams enumerated by bridge number, following the lead of S…

2016-04-04abs ↗pdf ↗

Computer-assisted synthesis planning aims to help chemists find better reaction pathways faster. Finding viable and short pathways from sugar molecules to value-added chemicals can be modeled as a retrosynthesis planning problem with a catalyst allowed. This is a crucial step in efficient biomass conversion. The tradit…

2019-11-10abs ↗pdf ↗

We consider the optimization problem associated with training simple ReLU neural networks of the form xi=1kmax{0,wix}\mathbf{x}\mapsto \sum_{i=1}^{k}\max\{0,\mathbf{w}_i^\top \mathbf{x}\} with respect to the squared loss. We provide a computer-assisted proof that even if the input distribution is standard Gaussian, even if the dime…

2017-12-24abs ↗pdf ↗

With an eye towards studying curve systems on low-complexity surfaces, we introduce and analyze the kk-Farey graphs Fk\mathcal{F}_k and Fk\mathcal{F}_{\leqslant k}, two natural variants of the Farey graph in which we relax the edge condition to indicate intersection number =k=k or k\le k, respectively. The former, $\…

2018-10-21abs ↗pdf ↗

Nowadays, organizations collect vast quantities of accounting relevant transactions, referred to as 'journal entries', in 'Enterprise Resource Planning' (ERP) systems. The aggregation of those entries ultimately defines an organization's financial statement. To detect potential misstatements and fraud, international au…

2019-10-09abs ↗pdf ↗

Paper proposes an active learning method for surgical workflow recognition using long-range temporal dependency.

problem Challenges in automatic surgical workflow recognition due to lack of large-scale labelled datasets.
method NL-RCNet with non-local block for capturing long-range temporal dependency and intra-clip dependency score for selection.
result Our approach outperforms state-of-the-art methods by selecting only 50% of samples for training.

Objective: A median of 14.4% of patient undergone at least one adverse event during surgery and a third of them are preventable. The occurrence of adverse events forces surgeons to implement corrective strategies and, thus, deviate from the standard surgical process. Therefore, it is clear that the automatic identifica…

2019-09-24abs ↗pdf ↗