Researchers recover material parameters in transversely isotropic media from travel times of qP and qSV waves.
problem Recovering material parameters in transversely isotropic media from travel times of qP and qSV waves.
method Using parabolic type operators and stability estimates for travel times of qP and qSV waves.
result Stability estimates for recovering material parameters from travel times of qP and qSV waves.
Paper recovers material parameters in transversely isotropic media under specific conditions.
problem Recovering material parameters in transversely isotropic media.
method Knowledge of qSH wave travel times determines the axis of isotropy and some elastic material parameters.
result Full determination of material parameters under certain conditions.
We prove that the boundary distance map of a smooth compact Finsler manifold with smooth boundary determines its topological and differentiable structures. We construct the optimal fiberwise open subset of its tangent bundle and show that the boundary distance map determines the Finsler function in this set but not in …
PriceAggregator optimizes hotel price fetching to increase Agoda's bookings.
problem Limited QPS from suppliers causes many user searches to be ignored.
method Intelligently determines queries to suppliers for price fetching.
result PriceAggregator increases Agoda's bookings significantly.
Efficiently solves heterogeneous QPs by reducing variables using instance-specific projections.
problem Solving high-dimensional quadratic programming problems efficiently.
method Data-driven framework with a graph neural network generating projections tailored to each QP instance.
result Produces high-quality solutions with reduced computation time, outperforming existing methods.
Unified description of p-brane QP-manifolds connects two recent tensor hierarchy descriptions.
problem Connecting two recent tensor hierarchy descriptions of p-brane QP-manifolds.
method Presented a duality-covariant version of p-brane QP-manifolds based on a specific QP-manifold construction.
result Solutions to constraints correspond to 1/2-BPS p-branes, suggesting a new incarnation of a brane scan.
We provide a theoretical algorithm for checking local optimality and escaping saddles at nondifferentiable points of empirical risks of two-layer ReLU networks. Our algorithm receives any parameter value and returns: local minimum, second-order stationary point, or a strict descent direction. The presence of M data p…
QP perspective on Poisson-Lie T-duality topology changes.
problem Understanding Poisson-Lie T-duality through QP manifolds.
method QP manifolds and canonical transformations for symplectic reductions.
result Canonical transformations mediate Poisson-Lie T-duality.
Bayesian framework predicts post-disruption travel times in metro networks.
problem Uncertainty in post-disruption travel times in metro networks.
method Bayesian spatiotemporal modeling framework capturing train interactions and non-Gaussian distributional characteristics.
result The proposed models consistently outperform baseline specifications in point prediction and uncertainty quantification.
New method clusters travel behavior data from 1990-2017.
problem Challenges in analyzing large-scale travel data.
method Divide and Combine K-means clustering on time series data.
result Activity-travel patterns can be grouped into three clusters.
Method estimates travel times on urban roads using Uber data.
problem Estimating travel times on urban roads where data is scarce.
method Graph representation, trip sampling, least-squares optimization.
result Estimates travel times on arterial roads using aggregated Uber data.
New proofs confirm travel time data determine simple metrics on a disc.
problem Determining a simple Riemannian metric from travel time data.
method Proofs based on Myers-Steenrod theorem, Lipschitz-type stability estimate.
result Travel time data determine a simple Riemannian metric on a disc up to natural gauge.
Method recovers obstacles from travel times on curved surfaces.
problem Recovering obstacles from travel times on curved surfaces.
method Extending Noakes and Stoyanov's method to Riemannian surfaces with curvature constraints.
result Obstacles can be recovered from travel times on Riemannian surfaces under certain curvature conditions.
Paper addresses travel time tomography stability and statistical inversion.
problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.
Financial derivatives based on road travel times for hedging and pricing.
problem Market risk in crypto and banking sectors.
method Modeling travel time data with CARMA models and applying risk-neutral pricing.
result Derivatives pricing based on travel time and its volatility.
Billiard trajectories in curved spaces have predictable travel times.
problem Understanding travel times in billiard trajectories on curved surfaces.
method Analyzing geodesic flows and sectional curvature to prove time-preserving conjugacy.
result Billiard trajectories with almost identical obstacles have identical shapes.
Study uses neural networks to predict travel times for public transportation.
problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.
This paper presents a bus travel time prediction system using deep neural networks.
problem Accurate travel time predictions for urban buses to compete with other modes of transport.
method Multi-output, multi-time-step deep neural network combining convolutional and LSTM layers.
result The proposed model significantly outperforms other methods and detects small irregular peaks quickly.
Recover simple irreversible Finsler geometry from travel time data
problem Stable recovery of a simple irreversible Finsler geometry
method Use a Gromov-Hausdorff distance adapted to irreversible metric spaces
result Unique and Lipschitz-stable recovery
Same travelling times imply identical obstacles in Riemannian manifolds.
problem Determining if two sets of obstacles are identical based on travel times.
method Analyzing curvature conditions and geodesic intersections.
result Disjoint convex obstacles with identical travel times are identical.
Constructs brane current algebras from QP-manifolds, generalizing string currents.
problem Constructing brane current algebras from QP-manifolds.
method Using Poisson algebra and QP-manifolds (symplectic L∞-algebroids), the paper derives a universal geometric form for Poisson brackets of brane currents. result Derives a universal expression for 't Hooft anomaly in the presence of fluxes.
In building intelligent transportation systems such as taxi or rideshare services, accurate prediction of travel time and distance is crucial for customer experience and resource management. Using the NYC taxi dataset, which contains taxi trips data collected from GPS-enabled taxis [23], this paper investigates the use…
Defines formal exponentials for graded manifolds and linearizes QP-manifolds.
problem Formal exponentials and linearizations of QP-manifolds.
method Definition of formal exponential maps, Grothendieck connections, and connections on tangent bundles.
result Linearizes QP-manifolds at points, giving formal tangent spaces L∞-algebra structures. STAD improves travel time estimation by learning from real traffic data.
problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.
We know SGAN may have a risk of gradient vanishing. A significant improvement is WGAN, with the help of 1-Lipschitz constraint on discriminator to prevent from gradient vanishing. Is there any GAN having no gradient vanishing and no 1-Lipschitz constraint on discriminator? We do find one, called GAN-QP. To construct a …
In this paper, we give the notion of a CLWX 2-algebroid and show that a QP-structure of degree 3 gives rise to a CLWX 2-algebroid. This is the higher analogue of the result that a QP-structure of degree 2 gives rise to a Courant algebroid. A CLWX 2-algebroid can also be viewed as a categorified Courant algebroid. We sh…
Tail-Safe hedging uses reinforcement learning with a safety layer to manage financial risks.
problem Managing financial risks in derivatives trading with robustness and explainability.
method Combines distributional reinforcement learning with a CBF-QP safety layer to enforce financial constraints.
result Improves risk management without degrading central performance and avoids hard constraint violations.
Study shows stability of travel time data reconstruction from closed subsets.
problem Reconstruction of length spaces from travel time data on a closed subset.
method Lipschitz stability proof for certain types of length spaces.
result Reconstruction of length spaces is Lipschitz stable from travel time data on a closed subset.
Boosting algorithms improve delivery time prediction in postal services.
problem Challenges in long-term travel time prediction for postal services.
method Investigated linear regression models, tree-based ensembles (random forest, bagging, boosting), and compared their performance.
result Boosting algorithms, especially light gradient boosting and catboost, outperform other methods in accuracy and runtime efficiency.
Model predicts travel time under rare conditions using a vector-space model.
problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.
QP improves Gaussian process inference by minimizing Wasserstein distance.
problem Approximate inference in Gaussian processes using KL divergence is inadequate.
method Quantile Propagation (QP) minimizes Wasserstein distance instead of KL divergence.
result QP outperforms EP and variational Bayes in classification and Poisson regression.
Two novel models predict bus travel times with uncertainty, improving connection assurance.
problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.
Enhanced travel time prediction using deep neural networks and road network information.
problem Improving travel time estimation using deep learning models.
method Proposes incorporating road network information into deep learning models for travel time prediction.
result Improved travel time prediction, especially with limited training data.
Study travel time tomography for transversely isotropic media using modified pseudodifferential calculus.
problem Travel time tomography problem for transversely isotropic media.
method Modified scattering pseudodifferential calculus to solve the tomography problem.
result Construction and use of modified pseudodifferential calculus to solve the tomography problem.
Generalized current algebras introduced by Alekseev and Strobl in two dimensions are reconstructed by a graded manifold and a graded Poisson brackets. We generalize their current algebras to higher dimensions. QP manifolds provide the unified structures of current algebras in any dimension. Current algebras give rise t…
Dynamic linear models improve travel time prediction for congested freeways.
problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.
TripDecoder recovers metro routes and travel times from smart card data.
problem Recover unknown routes and travel times in metro systems.
method Decouples two inference tasks: travel time and route preference.
result TripDecoder improves accuracy and efficiency compared to competitors.
ProbETA models travel time correlations between trips for better navigation.
problem Trip correlations not captured by existing methods.
method Deep hierarchical joint probabilistic model with learnable link representations.
result ProbETA outperforms state-of-the-art methods with 12.60% MAPE reduction.
This study uses Twitter to analyze traveler behavior in Manhattan.
problem Analyzing traveler behavior using social media data.
method Systematic method to extract displacement information from geo-tagged tweets.
result Twitter reveals unique demographics and travel behavior patterns.
DeepIST uses CNNs to estimate travel time from path images.
problem Accurately estimating travel time for a path in urban transportation systems.
method Proposes DeepIST, a neural network framework that converts paths into generalized images and uses PathCNN and 1D CNN to capture spatial and temporal patterns.
result DeepIST significantly outperforms existing models in travel time estimation.
Study on travel time formulas in a lake with wind flow.
problem Travel time in a lake with wind flow.
method Geometric approach using Finsler metrics.
result Formulas for distances and travel times derived.
We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
Simplified approach to portfolio risk management and hedging in practice.
problem Challenges in applying academic portfolio risk management and hedging in real-world business settings.
method A straightforward approach using convex optimization and quadratic programming.
result Demonstrates how to solve portfolio risk management and hedging problems with CVXOPT.
Study shows curves converge to traveling waves under specific conditions.
problem Global stability of traveling waves for area-preserving curvature flow.
method Area-preserving curvature flow with contact angle condition.
result Moving curves converge to traveling waves starting from embedded convex curves.
We show that the travel time difference functions, measured on the boundary, determine a compact Riemannian manifold with smooth boundary up to Riemannian isometry, if boundary satisfies a certain visibility condition. This corresponds with the inverse microseismicity problem. The novelty of our paper is a new type of …
Paper reconstructs compact Riemannian manifolds from travel time data.
problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.
An integral stability estimate is proved for refraction coefficients of two conformal metrics in a plane domain in terms of its travel times. No assumption on absence of conjugate points of geodesics is made.