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,695 papers · 148 categories

Trend · papers per month

77155232309 · Jun 202019922001200920172026
48 results for Bicycle design

Dataset of 4500 bicycle designs aids in design analysis and synthesis.

problem Identify gaps in bicycle market and design space, classify bicycles, synthesize new designs.
method Processed dataset, unsupervised dimensionality reduction, supervised classification, machine learning synthesis.
result Identified design parameters and factors influencing bicycle classification.

We study closed smooth convex plane curves ΓΓ enjoying the following property: a pair of points x,yx,y can traverse ΓΓ so that the distances between xx and yy along the curve and in the ambient plane do not change; such curves are called {\it bicycle curves}. Motivation for this study comes from the problem how to d…

2004-05-24abs ↗pdf ↗

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

2012-11-10abs ↗pdf ↗

New model for visual cortex border completion using bicycle wheel motions.

problem Understanding border completion in the visual cortex V1.
method Sub-Riemannian Hamiltonian formalism and bicycle wheel analogy.
result Analogies between visual cortex border completion and bicycle wheel motions.

We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of the rear wheel is uniquely determined via a certain first order differential equa…

2017-05-17abs ↗pdf ↗

Study the geometry and dynamics of skew evolutes and involutes, related to bicycle kinematics.

problem Understanding the geometry and dynamics of skew evolutes and involutes.
method Investigate the skew evolute and involute maps, comparing them to bicycle kinematics.
result The skew evolute and involute maps have properties analogous to bicycle kinematics.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

New method linearizes Darboux transformations of discrete curves.

problem Linearizing Darboux transformations of discrete curves.
method Expressing Darboux transformations as parallel sections of discrete connections in quaternionic formalism.
result Closed-form discrete parametrisations of all Darboux transforms and bicycle correspondences.

The space C of conservative vertex colorings (over a field F) of a countable, locally finite graph G is introduced. The subspace of based colorings is shown to be isomorphic to the bicycle space of the graph. For graphs G with a free Z^d-action by automorphisms, C is a finitely generated module over the polynomial ring…

2014-08-27abs ↗pdf ↗

Model predicts multi-agent trajectories using a differentiable simulator.

problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.

We generalize the notion of planar bicycle tracks -- a.k.a. one-trailer systems -- to so-called tractor/tractrix systems in general Riemannian manifolds and prove explicit expressions for the length of the ensuing tractrices and for the area of the domains that are swept out by any given tractor/tractrix system. These …

2017-07-29abs ↗pdf ↗

We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…

2018-09-22abs ↗pdf ↗

This master thesis focuses on practical application of Convolutional Neural Network models on the task of road labeling with bike attractivity score. We start with an abstraction of real world locations into nodes and scored edges in partially annotated dataset. We enhance information available about each edge with pho…

2018-06-27abs ↗pdf ↗

Professional sports are developing towards increasingly scientific training methods with increasing amounts of data being collected from laboratory tests, training sessions and competitions. In cycling, it is standard to equip bicycles with small computers recording data from sensors such as power-meters, in addition t…

2018-08-01abs ↗pdf ↗

Understanding how users navigate in a network is of high interest in many applications. We consider a setting where only aggregate node-level traffic is observed and tackle the task of learning edge transition probabilities. We cast it as a preference learning problem, and we study a model where choices follow Luce's a…

2016-10-20abs ↗pdf ↗

A method for fast, accurate cross-temporal forecasts using machine learning.

problem Inconsistent forecasts across different levels of platform data.
method Non-linear hierarchical forecast reconciliation using machine learning.
result Automated direct production of reconciled forecasts for high-frequency decision making.

The paper studies self-Bäcklund curves in centroaffine geometry using elliptic functions.

problem Understanding self-Bäcklund curves in centroaffine geometry.
method Description of general properties and detailed analysis using elliptic functions.
result Provides a detailed description of self-Bäcklund centroaffine curves in terms of elliptic functions.

This note examines financial distributions to competing teams at the end of the most famous multiple stage professional (male) bicyclist race, TOUR DE FRANCE. A rank-size law (RSL) is calculated for the team financial gains. The RSL is found to be hyperbolic with a surprisingly simple decay exponent (about equal to -1)…

2019-10-24abs ↗pdf ↗

The paper studies a semigroup generated by finite intervals and characterizes its properties.

problem Characterizing the semigroup generated by finite intervals.
method Analyzing the semigroup BωFn\boldsymbol{B}_\omega^{\mathscr{F}_n}, showing Green relations coincide, isomorphic to partial convex order isomorphisms, and studying shift-continuous topologies.
result The semigroup BωFn\boldsymbol{B}_\omega^{\mathscr{F}_n} is isomorphic to the semigroup of partial convex order isomorphisms and admits only Rees congruences.

A framework for faster, better infographic design by non-experts and experts alike.

problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.

The paper proposes a method to reliably select design algorithms for machine learning-guided design tasks.

problem Choosing the right design algorithm for machine learning-guided design tasks.
method Combining designs' predicted property values with held-out labeled data to reliably forecast characteristics of the label distributions produced by different design algorithms.
result The method is guaranteed to return design algorithms that yield successful label distributions.

We propose a new low-cost machine-learning-based methodology which assists designers in reducing the gap between the problem and the solution in the design process. Our work applies reinforcement learning (RL) to find the optimal task-oriented design solution through the construction of the design action for each task.…

2019-03-13abs ↗pdf ↗

MO-PaDGAN generates diverse, high-performance designs with multiple metrics.

problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.

PaDGAN generates diverse, high-quality designs with improved performance.

problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.

ANN with GA optimizes flexible disc design for lower mass and stress.

problem Design flexible disc elements for lower mass and stress without compromising torque transmission and misalignment.
method Artificial Neural Network (ANN) coupled with Genetic Algorithm (GA) for design exploration.
result Optimized designs meet specified criteria with minimum mass and stress.

New method for mixed-variable GSA improves material design efficiency.

problem Designing materials with both quantitative and qualitative variables.
method Integrates LVGP with Sobol' analysis for mixed-variable GSA.
result Accelerates exploration of novel MOF candidates in combinatorial design spaces.

Efficient deep learning computing requires algorithm and hardware co-design to enable specialization: we usually need to change the algorithm to reduce memory footprint and improve energy efficiency. However, the extra degree of freedom from the algorithm makes the design space much larger: it's not only about designin…

2019-04-24abs ↗pdf ↗

DAD learns to design experiments quickly, outperforming traditional methods.

problem Real-time decision-making in sequential Bayesian experimental design.
method Amortized design network trained with contrastive information bounds.
result DAD outperforms alternative strategies on various problems.