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

471114 · Feb 202019922001200920172026
48 results for coprime arrays

Robust STAP with coprime arrays reduces clutter using sparse modeling.

problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.

New q-deformed integers help compute Jones polynomials efficiently.

problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.

A polynomial f(t) with rational coefficients is strongly irreducible if f(t^k) is irreducible for all positive integers k. Likewise, two polynomials f and g are strongly coprime if f(t^k) and g(t^l) are relatively prime for all positive integers k and l. We provide some sufficient conditions for strong irreducibility a…

2011-05-12abs ↗pdf ↗

Improves magnetic field mapping using an array of magnetometers with noisy input.

problem Improving magnetic field maps in indoor environments with noisy magnetometer data.
method Uses Gaussian process regression with an array of magnetometers, incorporating known array positions and relative magnetometer locations.
result The method produces higher quality magnetic field maps compared to using a single magnetometer.

Paper improves DOA estimation in sparse arrays using Siamese neural networks.

problem Challenges in DOA estimation with limited snapshots in sparse linear arrays.
method Introduces a Siamese neural network with a sparse augmentation layer for enhanced signal feature embedding.
result Demonstrates improved DOA estimation accuracy in sparse arrays.

In this paper we prove that the Casson-Gordon invariants of the connected sum of two knots split when the Alexander polynomials of the knots are coprime. As one application, for any knot K, all but finitely many algebraically slice twisted doubles of K are linearly independent in the knot concordance group.

2001-02-15abs ↗pdf ↗

Direction of arrival (DoA) estimation of targets improves with the number of elements employed by a phased array radar antenna. Since larger arrays have high associated cost, area and computational load, there is recent interest in thinning the antenna arrays without loss of far-field DoA accuracy. In this context, a c…

2018-02-27abs ↗pdf ↗

We show that if the connected sum of two knots with coprime Alexander polynomials has vanishing von Neumann rho-invariants associated with certain metabelian representations then so do both knots. As an application, we give a new example of an infinite family of knots which are linearly independent in the knot concorda…

2007-10-10abs ↗pdf ↗

Analog arrays are a promising upcoming hardware technology with the potential to drastically speed up deep learning. Their main advantage is that they compute matrix-vector products in constant time, irrespective of the size of the matrix. However, early convolution layers in ConvNets map very unfavorably onto analog a…

2018-07-03abs ↗pdf ↗

Moduli spaces of semi-stable real and quaternionic vector bundles of a fixed topological type admit a presentation as Lagrangian quotients, and can be embedded into the symplectic quotient corresponding to the moduli variety of semi-stable holomorphic vector bundles of fixed rank and degree on a smooth complex projecti…

2011-09-23abs ↗pdf ↗

We study the representation spaces R(K;i)R(K;\bf{i}) as appearing in Kronheimer and Mrowka's framed instanton knot Floer homology, for a class of pretzel knots. In particular, for pretzel knots P(p,q,r)P(p,q,r) with p,q,rp, q, r pairwise coprime, these appear to be non-degenerate and comprise representations in SU(2) that are not b…

2010-12-13abs ↗pdf ↗

Novel CNN array for sign language recognition using wearable IMUs.

problem Efficiently recognizing sign language from wearable IMU signals.
method Two-dimensional Convolutional Neural Network array architecture for Indian sign language recognition.
result Peak classification accuracies of 94.20% for general sentences and 95.00% for interrogative sentences achieved.

Scoring systems are linear classification models that only require users to add, subtract and multiply a few small numbers in order to make a prediction. These models are in widespread use by the medical community, but are difficult to learn from data because they need to be accurate and sparse, have coprime integer co…

2015-02-15abs ↗pdf ↗

Massive MIMO is a variant of multiuser MIMO where the number of base-station antennas MM is very large (typically 100), and generally much larger than the number of spatially multiplexed data streams (typically 10). Unfortunately, the front-end A/D conversion necessary to drive hundreds of antennas, with a signal band…

2015-09-24abs ↗pdf ↗

Missing data is an important challenge when dealing with high dimensional data arranged in the form of an array. In this paper, we propose methods for estimation of the parameters of array variate normal probability model from partially observed multiway data. The methods developed here are useful for missing data impu…

2012-09-12abs ↗pdf ↗

We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …

2016-11-23abs ↗pdf ↗

We classify the Seifert fibrations of any given lens space L(p,q). We give an algorithmic construction of a Seifert fibration of L(p,q) over the base orbifold S^2(m,n) with the coprime parts of m and n arbitrarily prescribed. This algorithm produces all possible Seifert fibrations, and the equivalences between the resu…

2016-08-24abs ↗pdf ↗

Using the L^2 norm of the Higgs field as a Morse function, we study the moduli spaces of U(p,q)-Higgs bundles over a Riemann surface. We require that the genus of the surface be at least two, but place no constraints on (p,q). A key step is the identification of the function's local minima as moduli spaces of holomorph…

2002-11-27abs ↗pdf ↗

A neural network, IHT-Net, improves DOA estimation with sparse arrays.

problem Single-snapshot DOA estimation with sparse arrays in dynamic settings.
method IHT-inspired neural network with recurrent neural network and autoencoders.
result IHT-Net achieves faster convergence and higher accuracy in DOA estimation.

The harmonic knot (˝a,b,c)\H(a,b,c) is parametrized as K(t)=(Ta(t),Tb(t),Tc(t))K(t)= (T_a(t) ,T_b (t), T_c (t)) where aa, bb and cc are pairwise coprime integers and TnT_n is the degree nn Chebyshev polynomial of the first kind. We classify the harmonic knots (˝a,b,c)\H(a,b,c) for a4. a \le 4. We study the knots (˝2n1,2n,2n+1),\H (2n-1, 2n, 2n+1), the knots $\H…

2012-03-20abs ↗pdf ↗

A Chebyshev knot is a knot which admits a parametrization of the form x(t)=Ta(t); y(t)=Tb(t); z(t)=Tc(t+φ), x(t)=T_a(t); \ y(t)=T_b(t) ; \ z(t)= T_c(t + φ), where a,b,ca,b,c are pairwise coprime, Tn(t)T_n(t) is the Chebyshev polynomial of degree n,n, and $φ\in \RR .$ Chebyshev knots are non compact analogues of the classical Lissajous knots. We show that the…

2008-12-05abs ↗pdf ↗

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗pdf ↗

Paper proposes a learning-based sparse Bayesian method for accurate off-grid DOA estimation.

problem One-bit off-grid direction of arrival (DOA) estimation in a single snapshot scenario.
method Formulated off-grid DOA estimation model, used Sparse Bayesian framework, proposed Learning-based Sparse Bayesian approach.
result Improved computational efficiency and accuracy in off-grid DOA estimation.

For each rational homology 3-sphere YY which bounds simply connected definite 4-manifolds of both signs, we construct an infinite family of irreducible rational homology 3-spheres which are homology cobordant to YY but cannot bound any simply connected definite 4-manifold. As a corollary, for any coprime integers $p,…

2018-08-28abs ↗pdf ↗

Hardware architectures composed of resistive cross-point device arrays can provide significant power and speed benefits for deep neural network training workloads using stochastic gradient descent (SGD) and backpropagation (BP) algorithm. The training accuracy on this imminent analog hardware however strongly depends o…

2019-09-17abs ↗pdf ↗

We give a sufficient condition under which vanishing property of Cochran-Orr-Teichner knot concordance obstructions splits under connected sum. The condition is described in terms of self-annihilating submodules with respect to higher-order Blanchfield linking forms. This extends results of Levine and the authors on di…

2013-04-10abs ↗pdf ↗

This paper proposes a learning framework for n-bit quantized neural networks that improves accuracy and speed on FPGAs.

problem Efficiently implementing quantized neural networks on FPGAs to maintain accuracy and speed.
method A novel learning framework for n-bit QNNs, constrained weights, reconstructed gradient function, n-BQ-NN structure, and SVPE array.
result Quantized models achieve almost the same accuracy as full-precision models and outperform typical low-precision QNNs.

Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if th…

2019-05-28abs ↗pdf ↗

In this paper we prove the following geometric inequality in the hyperbolic space $\H^n$ (n5)n\ge 5), which is a hyperbolic Alexandrov-Fenchel inequality, \[\begin{array}{rcl} \ds \int_Σ\s_4 d μ\ge \ds\vs C_{n-1}^4ω_{n-1}\left\{\left(\frac{|Σ|}{ω_{n-1}} \right)^\frac 12 + \left(\frac{|Σ|}{ω_{n-1}} \right)^{\frac 12\frac…

2013-03-07abs ↗pdf ↗

The paper proves existence of solutions for mean field equations on compact Riemann surfaces.

problem Existence of solutions for mean field equations on compact Riemann surfaces.
method Min-max scheme introduced by Djadli-Malchiodi (2006) and Djadli (2008).
result Proves existence of solutions for mean field equations on compact Riemann surfaces.