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

81162242323 · Jun 202019922001200920172026
48 results for emergency call centers

End-to-end deep learning detects emotions in real-life emergency calls.

problem Recognizing emotions in real-life emergency call center recordings.
method Used an end-to-end deep learning architecture trained on IEMOCAP and CEMO datasets.
result Obtained 45.6% Unweighted Accuracy Recall on CEMO with 4 classes, 76.9% on 2 classes (Anger, Neutral).

ClovaCall introduces a new Korean call speech corpus for contact centers.

problem Lack of large-scale call-based speech corpora for Korean dialog scenarios.
method Development of a new large-scale Korean call-based speech corpus (ClovaCall) in a restaurant reservation domain.
result Validation of the dataset with ASR models shows its effectiveness.

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗pdf ↗

Crowdsourced data helps detect incidents faster, balancing accuracy and practicality.

problem Detecting incidents from crowdsourced data is challenging due to noise and uncertainty.
method CROME (Crowdsourced Multi-objective Event Detection) uses CNN and Pareto optimization.
result The approach outperforms existing methods in incident detection and practicality.

Due to the growing demand for improving surveillance capabilities in smart cities, systems need to be developed to provide better monitoring capabilities to competent authorities, agencies responsible for strategic resource management, and emergency call centers. This work assumes that, as a complementary monitoring so…

2019-10-27abs ↗pdf ↗

We call the Lie algebra of a Lie group with a left invariant pseudo-Riemannian flat metric pseudo-Riemannian flat Lie algebra. We give a new proof of a classical result of Milnor on Riemannian flat Lie algebras. We reduce the study of Lorentzian flat Lie algebras to those with trivial center or those with degenerate ce…

2011-03-03abs ↗pdf ↗

Correntropy is a local similarity measure defined in kernel space and the maximum correntropy criterion (MCC) has been successfully applied in many areas of signal processing and machine learning in recent years. The kernel function in correntropy is usually restricted to the Gaussian function with center located at ze…

2019-04-13abs ↗pdf ↗

Archimedes determined the center of gravity of a parabolic section as follows. For a parabolic section between a parabola and any chord ABAB on the parabola, let us denote by PP the point on the parabola where the tangent is parallel to ABAB and by VV the point where the line through PP parallel to the axis of the p…

2015-02-01abs ↗pdf ↗

We solve Einstein vacuum equations in a spacetime region up to the "center" of gravitational collapse. Within this region, we construct a sequence of marginally outer trapped surfaces (MOTS) with areas going to zero. These MOTS form a marginally outer trapped tube (apparent horizon). It emerges from a point and is smoo…

2017-03-01abs ↗pdf ↗

New random forest method provides optimal rates and confidence bands.

problem Improving random forest regression rates and constructing confidence bands.
method Proposed Ehrenfest centered purely random forests achieve optimal rates; used Gaussian approximation for supremum of empirical processes.
result Explicit asymptotic uniform confidence bands constructed for both random forest types.

Proposes a framework for energy-efficient AIGC workload scheduling in cloud data centers.

problem Challenges of scheduling AIGC workloads for energy efficiency and quality control.
method Joint energy management and coordinated AIGC workload scheduling framework with diffusion model-aided reward shaping.
result Effective learning of scheduling policies under sparse environmental feedback.

The Riemannian center of mass was constructed in [GrKa] (1973). In [GKR1, GKR2, Gr, Ka, BuKa] (1974-1981) it was successfully applied with more refined estimates. Probably in 1990 someone renamed it without justification into karcher mean and references to the older papers were omitted by those using the new name. As a…

2014-07-03abs ↗pdf ↗

The (relativistic) center of mass of an asymptotically flat Riemannian manifold is often defined by certain surface integral expressions evaluated along a foliation of the manifold near infinity, e. g. by Arnowitt, Deser, and Misner (ADM). There are also what we call 'abstract' definitions of the center of mass in term…

2013-12-22abs ↗pdf ↗

One key use of k-means clustering is to identify cluster prototypes which can serve as representative points for a dataset. However, a drawback of using k-means cluster centers as representative points is that such points distort the distribution of the underlying data. This can be highly disadvantageous in problems wh…

2019-11-14abs ↗pdf ↗

A network-based approach identifies financial factors from asset interactions, explaining market dynamics.

problem Characterizing joint financial asset behavior through underlying drivers.
method Modeling market as coupled iterated maps, where asset returns depend on past returns and interactions.
result Stable patterns of co-movement (financial factors) emerge from asset interactions, explaining asset variance.

A standard belief on emerging collective behavior is that it emerges from simple individual rules. Most of the mathematical research on such collective behavior starts from imperative individual rules, like always go to the center. But how could an (optimal) individual rule emerge during a short period within the group…

2018-02-21abs ↗pdf ↗

Through multi-agent competition, the simple objective of hide-and-seek, and standard reinforcement learning algorithms at scale, we find that agents create a self-supervised autocurriculum inducing multiple distinct rounds of emergent strategy, many of which require sophisticated tool use and coordination. We find clea…

2019-09-17abs ↗pdf ↗

It is shown by several authors going back to Huisken-Yau that asymptotically Schwarzschildean time-slices possess a unique foliation by stable constant mean curvature (CMC) spheres defining the so-called CMC center of mass. We analyze how the leaves of this foliation evolve in time under the Einstein equations. More pr…

2013-12-21abs ↗pdf ↗

Artin groups of type DnD_n have special cycles and complexes with interesting properties.

problem Characterizing cycles and complexes in Artin groups of type DnD_n.
method Analyzing 6-cycles and their centers/quasi-centers in the 1-skeleton of the Artin complex.
result Certain 6-cycles in the Artin complex of type DnD_n have centers or quasi-centers.

New method for better initial centers in clustering with improved accuracy and privacy.

problem Improving the quality of clustering centers in metric spaces.
method HST initialization based on metric embedding tree structure, combined with efficient search algorithm and DP extension.
result HST initialization produces better initial centers than kk-median++ with comparable efficiency and improved privacy.

We find that for any n-dimensional, compact, convex subset K of R^{n+1} there is an affinely-spherical hypersurface M in R^{n+1} with center at the relative interior of K, such that the disjoint union of M and K is the boundary of an (n+1)-dimensional, compact, convex set. This so-called affine hemisphere M is uniquely…

2015-08-03abs ↗pdf ↗

A key challenge for modern Bayesian statistics is how to perform scalable inference of posterior distributions. To address this challenge, variational Bayes (VB) methods have emerged as a popular alternative to the classical Markov chain Monte Carlo (MCMC) methods. VB methods tend to be faster while achieving comparabl…

2017-05-09abs ↗pdf ↗

This thesis discusses the Newtonian limit of General Relativity for static isolated systems with compactly supported matter. We call these systems "geometrostatic" to underline their geometric nature. We introduce new quasi-local notions of mass and center of mass that can be read off locally in the vicinity of the mat…

2012-01-26abs ↗pdf ↗

The paper studies a rebalanced dataset for imbalanced classification using Centered Random Forests.

problem Imbalanced classification where one class is underrepresented.
method Theoretical analysis of Centered Random Forests (CRF) with rebalanced datasets and debiasing techniques.
result Theoretical Central Limit Theorem (CLT) for the infinite CRF and debiased estimator IS-ICRF.

With the emergence of the Hospital Readmission Reduction Program of the Center for Medicare and Medicaid Services on October 1, 2012, forecasting unplanned patient readmission risk became crucial to the healthcare domain. There are tangible works in the literature emphasizing on developing readmission risk prediction m…

2018-12-11abs ↗pdf ↗

Latency to end-users and regulatory requirements push large companies to build data centers all around the world. The resulting data is "born" geographically distributed. On the other hand, many machine learning applications require a global view of such data in order to achieve the best results. These types of applica…

2016-03-30abs ↗pdf ↗

The preprint is prepared as description of results that were obtained during joint scientific project No: 71NC /2015/VNCCCT on the VIASM (Vietnam Institute for Advanced Study in Mathematics) from 08.12.2015 to 06.02.2016. The problem was formulated how to calculate so called the Mackenzie obstruction for existing of tr…

2017-08-09abs ↗pdf ↗

This paper constructs a family of coordinate systems about a point on a quaternionic contact manifold, called quaternionic contact pseudohermitian normal coordinates. Once defined, conformal variations of the quaternionic contact structure induce changes on the coordinates which are studied in an effort to simplify the…

2008-07-02abs ↗pdf ↗

The paper axiomatizes strong emergence in parameterized field theories and proves existence theorems.

problem Formalizing and proving existence of strong emergence in parameterized field theories.
method Axiomatization and proof of existence theorems for strong emergence between Lagrangian field theories.
result Existence of strong emergence phenomena between parameterized Lagrangian field theories.

The paper studies stability of discretized Anosov flows.

problem Global stability of discretized Anosov flows.
method Defined and proved equivalence with previous definitions, showed properties through C1C^1 openness and closedness, and established integrability and uniqueness of invariant foliations.
result Discretized Anosov flows are globally stable.

We introduce a simplified version of Drinfeld's equations that still solves Kashiwara-Vergne equations.

problem Solving Kashiwara-Vergne equations using Drinfeld's associator equations.
method Introducing a weak version of Drinfeld's associator equations and showing its solutions lead to solutions of the Kashiwara-Vergne equations.
result Solutions to emergent Drinfeld equations still solve the Kashiwara-Vergne equations.

Batch Normalization (BN) is capable of accelerating the training of deep models by centering and scaling activations within mini-batches. In this work, we propose Decorrelated Batch Normalization (DBN), which not just centers and scales activations but whitens them. We explore multiple whitening techniques, and find th…

2018-04-23abs ↗pdf ↗

Du, Kakade, Wang, and Yang recently established intriguing lower bounds on sample complexity, which suggest that reinforcement learning with a misspecified representation is intractable. Another line of work, which centers around a statistic called the eluder dimension, establishes tractability of problems similar to t…

2019-11-18abs ↗pdf ↗