id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0636 | Anomaly Detection using One-Class Neural Networks | We propose a one-class neural network (OC-NN) model to detect anomalies in
complex data sets. OC-NN combines the ability of deep networks to extract a
progressively rich representation of data with the one-class objective of
creating a tight envelope around normal data. The OC-NN approach breaks new
ground for the fo... | cs.LG cs.NE stat.ML | we propose a oneclass neural network ocnn model to detect anomalies in complex data sets ocnn combines the ability of deep networks to extract a progressively rich representation of data with the oneclass objective of creating a tight envelope around normal data the ocnn approach breaks new ground for the following cru... | [['we', 'propose', 'a', 'oneclass', 'neural', 'network', 'ocnn', 'model', 'to', 'detect', 'anomalies', 'in', 'complex', 'data', 'sets', 'ocnn', 'combines', 'the', 'ability', 'of', 'deep', 'networks', 'to', 'extract', 'a', 'progressively', 'rich', 'representation', 'of', 'data', 'with', 'the', 'oneclass', 'objective', '... | [-0.029434442797005963, -0.019769788141322304, -0.10406230695397509, 0.0815283161631102, -0.14268990568877138, -0.19249215837289857, 0.06299442225801093, 0.4007190616753001, -0.2758577674470068, -0.2984567617320202, 0.06894704069059293, -0.31354171617029164, -0.21382729263141653, 0.17678236462895505, -0.077502326528819... |
1,802.06361 | On Finding Dense Common Subgraphs | We study the recently introduced problem of finding dense common subgraphs:
Given a sequence of graphs that share the same vertex set, the goal is to find
a subset of vertices $S$ that maximizes some aggregate measure of the density
of the subgraphs induced by $S$ in each of the given graphs. Different choices
for th... | cs.DS cs.CC | we study the recently introduced problem of finding dense common subgraphs given a sequence of graphs that share the same vertex set the goal is to find a subset of vertices s that maximizes some aggregate measure of the density of the subgraphs induced by s in each of the given graphs different choices for the aggrega... | [['we', 'study', 'the', 'recently', 'introduced', 'problem', 'of', 'finding', 'dense', 'common', 'subgraphs', 'given', 'a', 'sequence', 'of', 'graphs', 'that', 'share', 'the', 'same', 'vertex', 'set', 'the', 'goal', 'is', 'to', 'find', 'a', 'subset', 'of', 'vertices', 's', 'that', 'maximizes', 'some', 'aggregate', 'mea... | [-0.15334806082925448, 0.061115833807131516, -0.049894011909297355, 0.06081166925165841, -0.06686173828590351, -0.09486150986534388, 0.0870774840307907, 0.36880437556343776, -0.3196555249839245, -0.32966739099356346, 0.05340501324462821, -0.28139045246643946, -0.15213819195438796, 0.11624889478359061, -0.08627264402457... |
1,802.06362 | Experimental demonstration of three-dimensional broadband underwater
acoustic carpet cloak | We present the design, architecture and detailed performance of a
three-dimensional (3D) underwater acoustic carpet cloak (UACC). The proposed
system of the 3D UACC is an octahedral pyramid which is composed of periodical
steel strips. This underwater acoustic device, placed over the target to hide,
is able to manipu... | physics.app-ph | we present the design architecture and detailed performance of a threedimensional 3d underwater acoustic carpet cloak uacc the proposed system of the 3d uacc is an octahedral pyramid which is composed of periodical steel strips this underwater acoustic device placed over the target to hide is able to manipulate the sca... | [['we', 'present', 'the', 'design', 'architecture', 'and', 'detailed', 'performance', 'of', 'a', 'threedimensional', '3d', 'underwater', 'acoustic', 'carpet', 'cloak', 'uacc', 'the', 'proposed', 'system', 'of', 'the', '3d', 'uacc', 'is', 'an', 'octahedral', 'pyramid', 'which', 'is', 'composed', 'of', 'periodical', 'ste... | [-0.13066445132622342, 0.0799179181857863, -0.016487059622214965, -0.0604200552266915, -0.108927176920518, -0.09463933327396472, -0.036401416862365574, 0.45133011755891717, -0.23444726817363587, -0.304386587065752, 0.05816699774564208, -0.25842337466649323, -0.16642799949309287, 0.2718399551500065, -0.08387086021516901... |
1,802.06363 | Generalized Bessel multipliers in Hilbert spaces | The notation of generalized Bessel multipliers is obtained by a bounded
operator on $\ell^2$ which is inserted between the analysis and synthesis
operators. We show that various properties of generalized multipliers are
closely related to their parameters, in particular it will be shown that the
membership of general... | math.FA | the notation of generalized bessel multipliers is obtained by a bounded operator on ell2 which is inserted between the analysis and synthesis operators we show that various properties of generalized multipliers are closely related to their parameters in particular it will be shown that the membership of generalized bes... | [['the', 'notation', 'of', 'generalized', 'bessel', 'multipliers', 'is', 'obtained', 'by', 'a', 'bounded', 'operator', 'on', 'ell2', 'which', 'is', 'inserted', 'between', 'the', 'analysis', 'and', 'synthesis', 'operators', 'we', 'show', 'that', 'various', 'properties', 'of', 'generalized', 'multipliers', 'are', 'closel... | [-0.09875477872276317, 0.11992317782859355, -0.039466793422272266, 0.11430070976196073, -0.12038684847345937, -0.12856455990510393, -0.04433945545298589, 0.39626677885882616, -0.3024603324227555, -0.19015978325822558, 0.15710290758455417, -0.23475463645417213, -0.2011648524920781, 0.22999038675785527, -0.11810243767036... |
1,802.06364 | The variation of invariant graphs in forced systems | In skew-product systems with contractive factors, all orbits asymptotically
approach the graph of the so-called sync function; hence, the corresponding
regularity properties primarily matter. In the literature, sync function
Lipschitz continuity and differentiability have been proved to hold depending
on the derivati... | math.DS nlin.CD | in skewproduct systems with contractive factors all orbits asymptotically approach the graph of the socalled sync function hence the corresponding regularity properties primarily matter in the literature sync function lipschitz continuity and differentiability have been proved to hold depending on the derivative of the... | [['in', 'skewproduct', 'systems', 'with', 'contractive', 'factors', 'all', 'orbits', 'asymptotically', 'approach', 'the', 'graph', 'of', 'the', 'socalled', 'sync', 'function', 'hence', 'the', 'corresponding', 'regularity', 'properties', 'primarily', 'matter', 'in', 'the', 'literature', 'sync', 'function', 'lipschitz', ... | [-0.15062412387912744, 0.11449804084057376, -0.08524129641505124, 0.08745998197746933, -0.09736195086596054, -0.104768046952489, 0.03336038106838057, 0.3576774466598388, -0.31676183993199675, -0.22227719384660521, 0.1411239796520976, -0.2899196915568249, -0.1683522947760769, 0.1988848938265502, -0.09163167382507484, 0.... |
1,802.06365 | Orbitally limited pair-density wave phase of multilayer superconductors | We investigate the magnetic field dependence of an ideal superconducting
vortex lattice in the parity-mixed pair-density wave phase of multilayer
superconductors within a circular cell Ginzburg-Landau approach. In multilayer
systems, due to local inversion symmetry breaking, a Rashba spin-orbit coupling
is induced at... | cond-mat.supr-con | we investigate the magnetic field dependence of an ideal superconducting vortex lattice in the paritymixed pairdensity wave phase of multilayer superconductors within a circular cell ginzburglandau approach in multilayer systems due to local inversion symmetry breaking a rashba spinorbit coupling is induced at the oute... | [['we', 'investigate', 'the', 'magnetic', 'field', 'dependence', 'of', 'an', 'ideal', 'superconducting', 'vortex', 'lattice', 'in', 'the', 'paritymixed', 'pairdensity', 'wave', 'phase', 'of', 'multilayer', 'superconductors', 'within', 'a', 'circular', 'cell', 'ginzburglandau', 'approach', 'in', 'multilayer', 'systems',... | [-0.26767757626887606, 0.24969109457153152, 0.016203670710185754, 0.03523357714354796, -0.09171209282878982, -0.1475408688236616, 0.0886637932994697, 0.3419138358538284, -0.2651996409226405, -0.23088980025709852, -0.0070780798890873005, -0.27375524175892535, -0.12851908117728797, 0.11392925193435267, 0.0636223528999835... |
1,802.06366 | On the c-concavity with respect to the quadratic cost on a manifold | Pushing a little forward an approach proposed by Villani, we are going to
prove that in the Riemannian setting the condition $\nabla^2 f< g$ implies that
$f$ is $c$-concave with respect to the quadratic cost as soon as it has a
sufficiently small $C^1$-norm. From this, we deduce a sufficient condition for
the optimal... | math.OC math.DG | pushing a little forward an approach proposed by villani we are going to prove that in the riemannian setting the condition nabla2 f g implies that f is cconcave with respect to the quadratic cost as soon as it has a sufficiently small c1norm from this we deduce a sufficient condition for the optimality of transport ma... | [['pushing', 'a', 'little', 'forward', 'an', 'approach', 'proposed', 'by', 'villani', 'we', 'are', 'going', 'to', 'prove', 'that', 'in', 'the', 'riemannian', 'setting', 'the', 'condition', 'nabla2', 'f', 'g', 'implies', 'that', 'f', 'is', 'cconcave', 'with', 'respect', 'to', 'the', 'quadratic', 'cost', 'as', 'soon', 'a... | [-0.1442271657828574, 0.0723392219705212, -0.1058953325596771, 0.07326463698908421, -0.0778831769047039, -0.15918056571224173, 0.033003480140385885, 0.347843026476247, -0.31242760909455164, -0.2523334539031826, 0.1287540584848362, -0.2518848011137119, -0.15046742037936514, 0.20029583248210006, -0.12629414108648365, 0.0... |
1,802.06367 | Efficient Sparse-Winograd Convolutional Neural Networks | Convolutional Neural Networks (CNNs) are computationally intensive, which
limits their application on mobile devices. Their energy is dominated by the
number of multiplies needed to perform the convolutions. Winograd's minimal
filtering algorithm (Lavin, 2015) and network pruning (Han et al., 2015) can
reduce the ope... | cs.CV cs.LG cs.NE | convolutional neural networks cnns are computationally intensive which limits their application on mobile devices their energy is dominated by the number of multiplies needed to perform the convolutions winograds minimal filtering algorithm lavin 2015 and network pruning han et al 2015 can reduce the operation count bu... | [['convolutional', 'neural', 'networks', 'cnns', 'are', 'computationally', 'intensive', 'which', 'limits', 'their', 'application', 'on', 'mobile', 'devices', 'their', 'energy', 'is', 'dominated', 'by', 'the', 'number', 'of', 'multiplies', 'needed', 'to', 'perform', 'the', 'convolutions', 'winograds', 'minimal', 'filter... | [-0.05088024093321401, 0.033669003379185616, -0.018622360953697993, 0.03891590068119713, -0.13803223727575545, -0.15847684172386267, 0.0749819084667709, 0.4649617877296822, -0.3050398426364709, -0.34515277659461935, 0.08223534673972219, -0.2598556540453398, -0.19954023943370525, 0.16997489653258296, -0.1511657581717338... |
1,802.06368 | Node Centralities and Classification Performance for Characterizing Node
Embedding Algorithms | Embedding graph nodes into a vector space can allow the use of machine
learning to e.g. predict node classes, but the study of node embedding
algorithms is immature compared to the natural language processing field
because of a diverse nature of graphs. We examine the performance of node
embedding algorithms with res... | cs.LG cs.SI stat.ML | embedding graph nodes into a vector space can allow the use of machine learning to eg predict node classes but the study of node embedding algorithms is immature compared to the natural language processing field because of a diverse nature of graphs we examine the performance of node embedding algorithms with respect t... | [['embedding', 'graph', 'nodes', 'into', 'a', 'vector', 'space', 'can', 'allow', 'the', 'use', 'of', 'machine', 'learning', 'to', 'eg', 'predict', 'node', 'classes', 'but', 'the', 'study', 'of', 'node', 'embedding', 'algorithms', 'is', 'immature', 'compared', 'to', 'the', 'natural', 'language', 'processing', 'field', '... | [-0.09139364899126623, 0.021497235723714134, -0.08651483648608686, 0.05076391080736506, -0.14431438081403625, -0.17934034157031198, 0.062383242493153225, 0.4468485278514575, -0.2830934975942483, -0.3428589048188379, 0.07184191653980132, -0.3133776412079377, -0.16637662033388886, 0.16401937413647086, -0.0600971766766540... |
1,802.06369 | Linear-Time Algorithm for Long LCF with $k$ Mismatches | In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are
given two strings $X$ and $Y$ of total length $n$, and we are asked to find a
pair of maximal-length factors, one of $X$ and the other of $Y$, such that
their Hamming distance is at most $k$. Thankachan et al. show that this problem
can be sol... | cs.DS | in the longest common factor with k mismatches lcf_k problem we are given two strings x and y of total length n and we are asked to find a pair of maximallength factors one of x and the other of y such that their hamming distance is at most k thankachan et al show that this problem can be solved in mathcalon logk n tim... | [['in', 'the', 'longest', 'common', 'factor', 'with', 'k', 'mismatches', 'lcf_k', 'problem', 'we', 'are', 'given', 'two', 'strings', 'x', 'and', 'y', 'of', 'total', 'length', 'n', 'and', 'we', 'are', 'asked', 'to', 'find', 'a', 'pair', 'of', 'maximallength', 'factors', 'one', 'of', 'x', 'and', 'the', 'other', 'of', 'y'... | [-0.17379220231908232, 0.12535686950735137, -0.027423512184201446, 0.04739285255335782, -0.030966030719230743, -0.16298788480384097, 0.06188264302590428, 0.3968764764754331, -0.32233650517117307, -0.3260979880515027, 0.066767935567553, -0.2756107559823112, -0.09530345924148394, 0.1612058101885327, -0.038869211096188995... |
1,802.0637 | Hamiltonian Zoo for systems with one degree of freedom | We present alternative explicit forms of the standard Hamiltonian for systems
with one degree of freedom. This new class of infinite Hamiltonians is called
Newton-equivalent Hamiltonian zoo, producing the same equation of motion. These
Hamiltonians are directly solved from the Hamilton's equations and come with
extra... | math-ph math.MP | we present alternative explicit forms of the standard hamiltonian for systems with one degree of freedom this new class of infinite hamiltonians is called newtonequivalent hamiltonian zoo producing the same equation of motion these hamiltonians are directly solved from the hamiltons equations and come with extraparamet... | [['we', 'present', 'alternative', 'explicit', 'forms', 'of', 'the', 'standard', 'hamiltonian', 'for', 'systems', 'with', 'one', 'degree', 'of', 'freedom', 'this', 'new', 'class', 'of', 'infinite', 'hamiltonians', 'is', 'called', 'newtonequivalent', 'hamiltonian', 'zoo', 'producing', 'the', 'same', 'equation', 'of', 'mo... | [-0.14155982645555726, 0.14559589793301514, -0.09646712198249392, 0.08542574397162409, -0.09559557260316168, -0.12081427898610363, -0.04255767399445176, 0.30233247059623936, -0.29737876259998697, -0.3285859680256328, 0.0885417247143876, -0.2502894910002077, -0.15169859151481777, 0.20241063360024142, 0.01115818698009526... |
1,802.06371 | Inductive Framework for Multi-Aspect Streaming Tensor Completion with
Side Information | Low rank tensor completion is a well studied problem and has applications in
various fields. However, in many real world applications the data is dynamic,
i.e., new data arrives at different time intervals. As a result, the tensors
used to represent the data grow in size. Besides the tensors, in many real
world scena... | cs.LG | low rank tensor completion is a well studied problem and has applications in various fields however in many real world applications the data is dynamic ie new data arrives at different time intervals as a result the tensors used to represent the data grow in size besides the tensors in many real world scenarios side in... | [['low', 'rank', 'tensor', 'completion', 'is', 'a', 'well', 'studied', 'problem', 'and', 'has', 'applications', 'in', 'various', 'fields', 'however', 'in', 'many', 'real', 'world', 'applications', 'the', 'data', 'is', 'dynamic', 'ie', 'new', 'data', 'arrives', 'at', 'different', 'time', 'intervals', 'as', 'a', 'result'... | [-0.10787159329762465, 0.08348252743532525, -0.0734958805972332, 0.04148336963463329, -0.14172177805286373, -0.11119491252622704, -0.03422040943243082, 0.3767701719997174, -0.2950956519335026, -0.2893527911120298, 0.16151419137592715, -0.2763482151165378, -0.20046563472523152, 0.14055202956675425, -0.05305337575843397,... |
1,802.06372 | Strong convergence rates of semi-discrete splitting approximations for
stochastic Allen--Cahn equation | This article analyzes an explicit temporal splitting numerical scheme for the
stochastic Allen-Cahn equation driven by additive noise, in a bounded spatial
domain with smooth boundary in dimension $d\le 3$. The splitting strategy is
combined with an exponential Euler scheme of an auxiliary problem.
When $d=1$ and t... | math.PR | this article analyzes an explicit temporal splitting numerical scheme for the stochastic allencahn equation driven by additive noise in a bounded spatial domain with smooth boundary in dimension dle 3 the splitting strategy is combined with an exponential euler scheme of an auxiliary problem when d1 and the driving noi... | [['this', 'article', 'analyzes', 'an', 'explicit', 'temporal', 'splitting', 'numerical', 'scheme', 'for', 'the', 'stochastic', 'allencahn', 'equation', 'driven', 'by', 'additive', 'noise', 'in', 'a', 'bounded', 'spatial', 'domain', 'with', 'smooth', 'boundary', 'in', 'dimension', 'dle', '3', 'the', 'splitting', 'strate... | [-0.17827779284772882, 0.048312241798144445, -0.08752981163865037, 0.08311173964571883, -0.0350576558055869, -0.16905492577242895, 0.030517539927277012, 0.38014070236164593, -0.2893634869825041, -0.2247810193904392, 0.15131749811015374, -0.2130174469827013, -0.15538587117486674, 0.18128490130808475, -0.1016237925269060... |
1,802.06373 | Estimation of the linear fractional stable motion | In this paper we investigate the parametric inference for the linear
fractional stable motion in high and low frequency setting. The symmetric
linear fractional stable motion is a three-parameter family, which constitutes
a natural non-Gaussian analogue of the scaled fractional Brownian motion. It is
fully characteri... | stat.ME | in this paper we investigate the parametric inference for the linear fractional stable motion in high and low frequency setting the symmetric linear fractional stable motion is a threeparameter family which constitutes a natural nongaussian analogue of the scaled fractional brownian motion it is fully characterised by ... | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'parametric', 'inference', 'for', 'the', 'linear', 'fractional', 'stable', 'motion', 'in', 'high', 'and', 'low', 'frequency', 'setting', 'the', 'symmetric', 'linear', 'fractional', 'stable', 'motion', 'is', 'a', 'threeparameter', 'family', 'which', 'constitutes', 'a'... | [-0.11593009952684952, 0.15351297536108177, -0.09389245346392272, 0.08121935816325276, -0.05427266302831413, -0.1251135958955274, 0.02613133384033972, 0.3494362585624913, -0.29030249900824856, -0.2607816389281652, 0.102214767634905, -0.23753595240123104, -0.12008243474883784, 0.18218546735261043, -0.07578401983118965, ... |
1,802.06374 | Quantum metamaterials: entanglement of spin and orbital angular momentum
of a single photon | Metamaterials have been a major research area for more than two decades now,
involving artificial structures with predesigned electromagnetic properties
constructed from deep subwavelength building blocks. They have been used to
demonstrate a wealth of fascinating phenomena ranging from negative refractive
index and ... | quant-ph physics.optics | metamaterials have been a major research area for more than two decades now involving artificial structures with predesigned electromagnetic properties constructed from deep subwavelength building blocks they have been used to demonstrate a wealth of fascinating phenomena ranging from negative refractive index and epsi... | [['metamaterials', 'have', 'been', 'a', 'major', 'research', 'area', 'for', 'more', 'than', 'two', 'decades', 'now', 'involving', 'artificial', 'structures', 'with', 'predesigned', 'electromagnetic', 'properties', 'constructed', 'from', 'deep', 'subwavelength', 'building', 'blocks', 'they', 'have', 'been', 'used', 'to'... | [-0.1058371989079751, 0.17586387191899122, -0.07745615549385548, -0.013115248593191306, -0.1045470295722286, -0.16948944464636345, -0.024085098545377454, 0.46902893027911585, -0.24101101247724727, -0.3523763555660844, 0.06910455927640821, -0.31497736408064764, -0.19166966423702736, 0.2751039052630464, 0.006595851362993... |
1,802.06375 | Efficient Gradual Typing | Gradual typing combines static and dynamic typing in the same program. One
would hope that the performance in a gradually typed language would range
between that of a dynamically typed language and a statically typed language.
Existing implementations of gradually typed languages have not achieved this
goal due to ov... | cs.PL | gradual typing combines static and dynamic typing in the same program one would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language existing implementations of gradually typed languages have not achieved this goal due to overhe... | [['gradual', 'typing', 'combines', 'static', 'and', 'dynamic', 'typing', 'in', 'the', 'same', 'program', 'one', 'would', 'hope', 'that', 'the', 'performance', 'in', 'a', 'gradually', 'typed', 'language', 'would', 'range', 'between', 'that', 'of', 'a', 'dynamically', 'typed', 'language', 'and', 'a', 'statically', 'typed... | [-0.10185065507578353, 0.024902792192167705, -0.06939394420944155, 0.05876851613788555, -0.17270367580875043, -0.18979295023406545, 0.1286557321700578, 0.427632615102662, -0.26402643458296854, -0.3912713869661093, 0.057954648439255026, -0.20403705553358628, -0.0798905757566293, 0.23077777943677372, -0.149084003970816, ... |
1,802.06376 | On the entropy norm on the group of diffeomorphisms of closed oriented
surface | We prove that the entropy norm on the group of diffeomorphisms of a closed
orientable surface of positive genus is unbounded.
| math.GT math.DS math.GR | we prove that the entropy norm on the group of diffeomorphisms of a closed orientable surface of positive genus is unbounded | [['we', 'prove', 'that', 'the', 'entropy', 'norm', 'on', 'the', 'group', 'of', 'diffeomorphisms', 'of', 'a', 'closed', 'orientable', 'surface', 'of', 'positive', 'genus', 'is', 'unbounded']] | [-0.28340629062482287, 0.1680966934100503, -0.10938043733975585, 0.0993740335384029, -0.05850109910326345, -0.14092305805977612, -0.013779837948580584, 0.29986756046613056, -0.2689369973682222, -0.16975756335471356, 0.08274009688535616, -0.33158501849642824, -0.1288793708552562, 0.21659342891403607, -0.2068660463694305... |
1,802.06377 | On the structure of affine flat group schemes over discrete valuation
rings, II | In the 1st part of this work [DHdS18], we studied affine group schemes over a
discrete valuation ring (DVR) by means of Neron blowups. We also showed how to
apply these findings to throw light on the group schemes coming from Tannakian
categories of D-modules. In the present work, we follow up this theme. We show
tha... | math.AG | in the 1st part of this work dhds18 we studied affine group schemes over a discrete valuation ring dvr by means of neron blowups we also showed how to apply these findings to throw light on the group schemes coming from tannakian categories of dmodules in the present work we follow up this theme we show that a certain ... | [['in', 'the', '1st', 'part', 'of', 'this', 'work', 'dhds18', 'we', 'studied', 'affine', 'group', 'schemes', 'over', 'a', 'discrete', 'valuation', 'ring', 'dvr', 'by', 'means', 'of', 'neron', 'blowups', 'we', 'also', 'showed', 'how', 'to', 'apply', 'these', 'findings', 'to', 'throw', 'light', 'on', 'the', 'group', 'sch... | [-0.14836060029857825, -0.008757677720859646, -0.17710367214001183, 0.06972701207851059, -0.12624340380009796, -0.12397732751643552, 0.031555814966226794, 0.38848519727887054, -0.36718272965268367, -0.19097491389340057, 0.07642891825027098, -0.1669058638442948, -0.15092372138419055, 0.23056177775641637, -0.194142496446... |
1,802.06378 | Neutral gas properties of Lyman continuum emitting galaxies: column
densities and covering fractions from UV absorption lines | The processes allowing the escape of ionizing photons from galaxies into the
intergalactic medium are poorly known. To understand how Lyman continuum (LyC)
photons escape galaxies, we constrain the HI covering fractions and column
densities using ultraviolet HI and metal absorption lines of 18 star-forming
galaxies w... | astro-ph.GA | the processes allowing the escape of ionizing photons from galaxies into the intergalactic medium are poorly known to understand how lyman continuum lyc photons escape galaxies we constrain the hi covering fractions and column densities using ultraviolet hi and metal absorption lines of 18 starforming galaxies which ha... | [['the', 'processes', 'allowing', 'the', 'escape', 'of', 'ionizing', 'photons', 'from', 'galaxies', 'into', 'the', 'intergalactic', 'medium', 'are', 'poorly', 'known', 'to', 'understand', 'how', 'lyman', 'continuum', 'lyc', 'photons', 'escape', 'galaxies', 'we', 'constrain', 'the', 'hi', 'covering', 'fractions', 'and',... | [0.034987047124607, 0.11570865077460234, 0.008267540041720721, 0.1026659425504616, -0.03130341810498789, -0.046470083081315984, 0.08031727048732301, 0.514591207383817, -0.11483007565283505, -0.33200359949274216, -0.010512293554527704, -0.34311229390666564, 0.029086199297629727, 0.13830491906285078, 0.03171460227943464,... |
1,802.06379 | Long-Term Oscillations of Sunspots and a Special Class of Artifacts in
SOHO(MDI) and SDO(HMI) Data | A specific type of artifacts, that originate due to displacement of the image
of a moving object along the digital (pixel) matrix of receiver are analyzed in
detail. The criteria of appearance and the influence of these artifacts on the
study of long-term oscillations of sunspots are deduced. The obtained criteria
su... | astro-ph.SR | a specific type of artifacts that originate due to displacement of the image of a moving object along the digital pixel matrix of receiver are analyzed in detail the criteria of appearance and the influence of these artifacts on the study of longterm oscillations of sunspots are deduced the obtained criteria suggest us... | [['a', 'specific', 'type', 'of', 'artifacts', 'that', 'originate', 'due', 'to', 'displacement', 'of', 'the', 'image', 'of', 'a', 'moving', 'object', 'along', 'the', 'digital', 'pixel', 'matrix', 'of', 'receiver', 'are', 'analyzed', 'in', 'detail', 'the', 'criteria', 'of', 'appearance', 'and', 'the', 'influence', 'of', ... | [-0.1457667591331749, 0.14395448316898735, -0.08631294491397057, 0.07932043486581636, -0.06256659256424106, -0.04684352112090706, 0.05967413790020698, 0.368303914438581, -0.2487063422910313, -0.3281168155696484, 0.1321642235279389, -0.24761947521630592, -0.16268076112989652, 0.20778720875256765, -0.0648293318991452, 0.... |
1,802.0638 | A new discontinuous Galerkin spectral element method for elastic waves
with physically motivated numerical fluxes | The discontinuous Galerkin (DG) method is an established method for computing
approximate solutions of partial differential equations in many applications.
Unlike continuous finite elements, in DG methods, numerical fluxes are used to
enforce inter-element conditions, and internal and external physical boundary
condi... | math.NA cs.NA | the discontinuous galerkin dg method is an established method for computing approximate solutions of partial differential equations in many applications unlike continuous finite elements in dg methods numerical fluxes are used to enforce interelement conditions and internal and external physical boundary conditions how... | [['the', 'discontinuous', 'galerkin', 'dg', 'method', 'is', 'an', 'established', 'method', 'for', 'computing', 'approximate', 'solutions', 'of', 'partial', 'differential', 'equations', 'in', 'many', 'applications', 'unlike', 'continuous', 'finite', 'elements', 'in', 'dg', 'methods', 'numerical', 'fluxes', 'are', 'used'... | [-0.1670764016319366, 0.12258009071772631, -0.04569716201613432, 0.04058239851668798, -0.11156594421414809, -0.11985316344044418, -0.04831866676994096, 0.3973744599812332, -0.28606747393228715, -0.2610236132067853, 0.14789450125924, -0.2334571632305053, -0.16500920999190374, 0.21470197284695874, -0.01675016868052651, 0... |
1,802.06381 | Smooth maps compatible with simplicial structures and inverse images | As a higher dimensional version of the theory of Morse functions, there have
been various studies of smooth manifolds using generic smooth maps. As
fundamental results, in these studies, they have found that inverse images of
such maps often restrict the types of the source manifolds. For example, if a
generic map su... | math.AT | as a higher dimensional version of the theory of morse functions there have been various studies of smooth manifolds using generic smooth maps as fundamental results in these studies they have found that inverse images of such maps often restrict the types of the source manifolds for example if a generic map such that ... | [['as', 'a', 'higher', 'dimensional', 'version', 'of', 'the', 'theory', 'of', 'morse', 'functions', 'there', 'have', 'been', 'various', 'studies', 'of', 'smooth', 'manifolds', 'using', 'generic', 'smooth', 'maps', 'as', 'fundamental', 'results', 'in', 'these', 'studies', 'they', 'have', 'found', 'that', 'inverse', 'ima... | [-0.09810723292712982, 0.06037787841991163, -0.08853925234423234, 0.09814614286252225, -0.04608883090818731, -0.11396860142524999, -0.04521904532672264, 0.37515604943753433, -0.28354231600578017, -0.2529073494629791, 0.1652553211996117, -0.24347342741675676, -0.22873946751396243, 0.2515874806218422, -0.1083999990485608... |
1,802.06382 | Space-efficient Feature Maps for String Alignment Kernels | String kernels are attractive data analysis tools for analyzing string data.
Among them, alignment kernels are known for their high prediction accuracies in
string classifications when tested in combination with SVM in various
applications. However, alignment kernels have a crucial drawback in that they
scale poorly ... | cs.LG cs.AI stat.ML | string kernels are attractive data analysis tools for analyzing string data among them alignment kernels are known for their high prediction accuracies in string classifications when tested in combination with svm in various applications however alignment kernels have a crucial drawback in that they scale poorly due to... | [['string', 'kernels', 'are', 'attractive', 'data', 'analysis', 'tools', 'for', 'analyzing', 'string', 'data', 'among', 'them', 'alignment', 'kernels', 'are', 'known', 'for', 'their', 'high', 'prediction', 'accuracies', 'in', 'string', 'classifications', 'when', 'tested', 'in', 'combination', 'with', 'svm', 'in', 'vari... | [-0.09643309768890715, 0.0427337992987132, -0.036591386082648385, 0.10936338979236658, -0.10247462609191359, -0.15287192857888265, 0.055561449403005045, 0.39575993502733264, -0.2925276869766732, -0.3383428697047812, 0.0992387210844323, -0.2793290299281778, -0.1324844931746652, 0.18558604534609482, -0.07460453236774625,... |
1,802.06383 | Efficient Gaussian Process Classification Using Polya-Gamma Data
Augmentation | We propose a scalable stochastic variational approach to GP classification
building on Polya-Gamma data augmentation and inducing points. Unlike former
approaches, we obtain closed-form updates based on natural gradients that lead
to efficient optimization. We evaluate the algorithm on real-world datasets
containing ... | stat.ML cs.LG | we propose a scalable stochastic variational approach to gp classification building on polyagamma data augmentation and inducing points unlike former approaches we obtain closedform updates based on natural gradients that lead to efficient optimization we evaluate the algorithm on realworld datasets containing up to 11... | [['we', 'propose', 'a', 'scalable', 'stochastic', 'variational', 'approach', 'to', 'gp', 'classification', 'building', 'on', 'polyagamma', 'data', 'augmentation', 'and', 'inducing', 'points', 'unlike', 'former', 'approaches', 'we', 'obtain', 'closedform', 'updates', 'based', 'on', 'natural', 'gradients', 'that', 'lead'... | [-0.05104938377691826, -0.058047694823061914, -0.03924709943477327, 0.03652937680279548, -0.09847689771198366, -0.14439571388459332, 0.08283522868738838, 0.43964378798091913, -0.21993264453616782, -0.36851802066912953, 0.10498530588040626, -0.30194715769882774, -0.15034519030276397, 0.2632074732313746, -0.0844431767817... |
1,802.06384 | Spurious Valleys in Two-layer Neural Network Optimization Landscapes | Neural networks provide a rich class of high-dimensional, non-convex
optimization problems. Despite their non-convexity, gradient-descent methods
often successfully optimize these models. This has motivated a recent spur in
research attempting to characterize properties of their loss surface that may
explain such suc... | math.OC cs.LG stat.ML | neural networks provide a rich class of highdimensional nonconvex optimization problems despite their nonconvexity gradientdescent methods often successfully optimize these models this has motivated a recent spur in research attempting to characterize properties of their loss surface that may explain such success in th... | [['neural', 'networks', 'provide', 'a', 'rich', 'class', 'of', 'highdimensional', 'nonconvex', 'optimization', 'problems', 'despite', 'their', 'nonconvexity', 'gradientdescent', 'methods', 'often', 'successfully', 'optimize', 'these', 'models', 'this', 'has', 'motivated', 'a', 'recent', 'spur', 'in', 'research', 'attem... | [-0.1303120369321916, 0.10639104694687848, -0.05936202537421076, 0.1356486163930357, -0.07615462806879904, -0.16586310473459015, 0.05454679732172765, 0.39680948784661385, -0.2755065003888366, -0.305301214151003, 0.07494836758193688, -0.2344822280536421, -0.22164558450999297, 0.15842969651662242, -0.12172866289159079, 0... |
1,802.06385 | Connection between diphoton and triboson channels in new physics
searches | Diphoton channel provides a clean signature in searches for new physics. In
this paper, we discuss a connection between the diphoton channel
($\gamma\gamma$) and triboson channels ($Z\gamma\gamma$, $ZZ\gamma$,
$WW\gamma$) imposed by the $SU(2)_{L}\times U(1)_{Y}$ symmetry of the Standard
Model (SM) in certain classes... | hep-ph hep-ex | diphoton channel provides a clean signature in searches for new physics in this paper we discuss a connection between the diphoton channel gammagamma and triboson channels zgammagamma zzgamma wwgamma imposed by the su2_ltimes u1_y symmetry of the standard model sm in certain classes of models to illustrate this idea we... | [['diphoton', 'channel', 'provides', 'a', 'clean', 'signature', 'in', 'searches', 'for', 'new', 'physics', 'in', 'this', 'paper', 'we', 'discuss', 'a', 'connection', 'between', 'the', 'diphoton', 'channel', 'gammagamma', 'and', 'triboson', 'channels', 'zgammagamma', 'zzgamma', 'wwgamma', 'imposed', 'by', 'the', 'su2_lt... | [-0.11806909259231317, 0.17638909904552358, -0.07861781811252946, 0.14534837741160855, -0.09117708870298451, -0.25048397750194584, 0.04713424305941555, 0.3216793228472982, -0.250801008975222, -0.30310181285299004, 0.021861376178761324, -0.2696737960424452, -0.09935029557506952, 0.11995918701314146, 0.013045582618741763... |
1,802.06386 | How local in time is the no-arbitrage property under capital gains taxes
? | In frictionless financial markets, no-arbitrage is a local property in time.
This means that a discrete time model is arbitrage-free if and only if there
does not exist a one-period-arbitrage. With capital gains taxes, this
equivalence fails. For a model with a linear tax and one non-shortable risky
stock, we introdu... | q-fin.PM math.PR q-fin.MF | in frictionless financial markets noarbitrage is a local property in time this means that a discrete time model is arbitragefree if and only if there does not exist a oneperiodarbitrage with capital gains taxes this equivalence fails for a model with a linear tax and one nonshortable risky stock we introduce the concep... | [['in', 'frictionless', 'financial', 'markets', 'noarbitrage', 'is', 'a', 'local', 'property', 'in', 'time', 'this', 'means', 'that', 'a', 'discrete', 'time', 'model', 'is', 'arbitragefree', 'if', 'and', 'only', 'if', 'there', 'does', 'not', 'exist', 'a', 'oneperiodarbitrage', 'with', 'capital', 'gains', 'taxes', 'this... | [-0.11601582136651988, 0.09521838114932088, -0.1314571175902161, 0.15295596893331218, -0.11173489039340004, -0.19542002514151208, 0.09385492174828614, 0.4076833188994212, -0.30639886158110385, -0.21125285455883805, 0.1527108250348044, -0.2488094877564967, -0.15585015143831574, 0.14264263125434729, -0.17672994544891787,... |
1,802.06387 | Quantifying tolerance of a nonlocal multi-qudit state to any local noise | We present a general approach for quantifying tolerance of a nonlocal
N-partite state to any local noise under different classes of quantum
correlation scenarios with arbitrary numbers of settings and outcomes at each
site. This allows us to derive new precise bounds in d and N on noise
tolerances for: (i) an arbitra... | quant-ph math-ph math.MP | we present a general approach for quantifying tolerance of a nonlocal npartite state to any local noise under different classes of quantum correlation scenarios with arbitrary numbers of settings and outcomes at each site this allows us to derive new precise bounds in d and n on noise tolerances for i an arbitrary nonl... | [['we', 'present', 'a', 'general', 'approach', 'for', 'quantifying', 'tolerance', 'of', 'a', 'nonlocal', 'npartite', 'state', 'to', 'any', 'local', 'noise', 'under', 'different', 'classes', 'of', 'quantum', 'correlation', 'scenarios', 'with', 'arbitrary', 'numbers', 'of', 'settings', 'and', 'outcomes', 'at', 'each', 's... | [-0.14330450455274651, 0.16258809442292926, -0.034894129924257014, 0.05952066162135452, 0.013317694361595547, -0.2788806805277572, 0.10239216108422945, 0.3046087637324544, -0.17940594712546204, -0.31767051568364396, 0.0532526958062697, -0.22041661800998127, -0.029664130203480667, 0.14883750492213843, -0.030888527544105... |
1,802.06388 | On energy stable discontinuous Galerkin spectral element approximations
of the perfectly matched layer for the wave equation | We develop a provably energy stable discontinuous Galerkin spectral element
method (DGSEM) approximation of the perfectly matched layer (PML) for the three
and two space dimensional (3D and 2D) linear acoustic wave equations, in first
order form, subject to well-posed linear boundary conditions. First, using the
well... | math.NA | we develop a provably energy stable discontinuous galerkin spectral element method dgsem approximation of the perfectly matched layer pml for the three and two space dimensional 3d and 2d linear acoustic wave equations in first order form subject to wellposed linear boundary conditions first using the wellknown complex... | [['we', 'develop', 'a', 'provably', 'energy', 'stable', 'discontinuous', 'galerkin', 'spectral', 'element', 'method', 'dgsem', 'approximation', 'of', 'the', 'perfectly', 'matched', 'layer', 'pml', 'for', 'the', 'three', 'and', 'two', 'space', 'dimensional', '3d', 'and', '2d', 'linear', 'acoustic', 'wave', 'equations', ... | [-0.10533635477991181, 0.06098509718914159, -0.06127365661012207, 0.048531770341078494, -0.1135985250208289, -0.11846788339985614, 0.006532853789270875, 0.38004994485527277, -0.29966154266842343, -0.2440126242710555, 0.15002475398235973, -0.22481193840305538, -0.12632822734365695, 0.1798509237861776, -0.040403748635807... |
1,802.06389 | Malliavin calculus for the stochastic Cahn-Hilliard / Allen Cahn
equation with unbounded noise diffusion | The stochastic partial differential equation analyzed in this work, is
motivated by a simplified mesoscopic physical model for phase separation. It
describes pattern formation due to adsorption and desorption mechanisms
involved in surface processes, in the presence of a stochastic driving force.
This equation is a c... | math.PR | the stochastic partial differential equation analyzed in this work is motivated by a simplified mesoscopic physical model for phase separation it describes pattern formation due to adsorption and desorption mechanisms involved in surface processes in the presence of a stochastic driving force this equation is a combina... | [['the', 'stochastic', 'partial', 'differential', 'equation', 'analyzed', 'in', 'this', 'work', 'is', 'motivated', 'by', 'a', 'simplified', 'mesoscopic', 'physical', 'model', 'for', 'phase', 'separation', 'it', 'describes', 'pattern', 'formation', 'due', 'to', 'adsorption', 'and', 'desorption', 'mechanisms', 'involved'... | [-0.13827983270875727, 0.07942183349213705, -0.09411133327043388, 0.06527433804828452, -0.06720731828503607, -0.12882934601064647, 0.046782614306287704, 0.30770223534092406, -0.3312622841959511, -0.21811699757771874, 0.0819714223566644, -0.25976507320679376, -0.18350995893880034, 0.12615886745536514, -0.092616505575495... |
1,802.0639 | Current-density implementation for calculating flexoelectric
coefficients | The flexoelectric effect refers to polarization induced in an insulator when
a strain gradient is applied. We have developed a first-principles methodology
based on density-functional perturbation theory to calculate the elements of
the bulk, clamped-ion flexoelectric tensor. In order to determine the
transverse and ... | cond-mat.mtrl-sci cond-mat.mes-hall | the flexoelectric effect refers to polarization induced in an insulator when a strain gradient is applied we have developed a firstprinciples methodology based on densityfunctional perturbation theory to calculate the elements of the bulk clampedion flexoelectric tensor in order to determine the transverse and shear co... | [['the', 'flexoelectric', 'effect', 'refers', 'to', 'polarization', 'induced', 'in', 'an', 'insulator', 'when', 'a', 'strain', 'gradient', 'is', 'applied', 'we', 'have', 'developed', 'a', 'firstprinciples', 'methodology', 'based', 'on', 'densityfunctional', 'perturbation', 'theory', 'to', 'calculate', 'the', 'elements'... | [-0.12144969848374049, 0.11854114501693402, -0.05415165320820441, 0.01956865907275295, -0.05921165069143865, -0.04917885140249772, 0.028085032940171437, 0.37772485906524317, -0.2512576289203328, -0.2299804833601229, 0.025886695006019658, -0.2842002833439481, -0.17159664483984843, 0.18116244995256975, 0.0236849926129382... |
1,802.06391 | Orbits in elementary, power-law galaxy bars: 1. Occurence and role of
single loops | Orbits in galaxy bars are generally complex, but simple closed loop orbits
play an important role in our conceptual understanding of bars. Such orbits are
found in some well-studied potentials, provide a simple model of the bar in
themselves, and may generate complex orbit families. The precessing, power
ellipse (p-e... | astro-ph.GA | orbits in galaxy bars are generally complex but simple closed loop orbits play an important role in our conceptual understanding of bars such orbits are found in some wellstudied potentials provide a simple model of the bar in themselves and may generate complex orbit families the precessing power ellipse pellipse orbi... | [['orbits', 'in', 'galaxy', 'bars', 'are', 'generally', 'complex', 'but', 'simple', 'closed', 'loop', 'orbits', 'play', 'an', 'important', 'role', 'in', 'our', 'conceptual', 'understanding', 'of', 'bars', 'such', 'orbits', 'are', 'found', 'in', 'some', 'wellstudied', 'potentials', 'provide', 'a', 'simple', 'model', 'of... | [-0.19658874156995493, 0.1431676359782967, -0.09875786989760847, 0.10151242731237199, -0.06501293586459288, -0.14957348617132415, -0.02715137214563433, 0.41679738576269965, -0.19605273094551623, -0.2744213395929041, 0.06645251236267172, -0.24040597657026522, -0.14607386012039195, 0.22523991042851038, -0.039746982008069... |
1,802.06392 | Center-of-Mass-Based Grasp Pose Adaptation Using 3D Range and
Force/Torque Sensing | Lifting objects, whose mass may produce high wrist torques that exceed the
hardware strength limits, could lead to unstable grasps or serious robot
damage. This work introduces a new Center-of-Mass (CoM)-based grasp pose
adaptation method, for picking up objects using a combination of exteroceptive
3D perception and ... | cs.RO | lifting objects whose mass may produce high wrist torques that exceed the hardware strength limits could lead to unstable grasps or serious robot damage this work introduces a new centerofmass combased grasp pose adaptation method for picking up objects using a combination of exteroceptive 3d perception and propriocept... | [['lifting', 'objects', 'whose', 'mass', 'may', 'produce', 'high', 'wrist', 'torques', 'that', 'exceed', 'the', 'hardware', 'strength', 'limits', 'could', 'lead', 'to', 'unstable', 'grasps', 'or', 'serious', 'robot', 'damage', 'this', 'work', 'introduces', 'a', 'new', 'centerofmass', 'combased', 'grasp', 'pose', 'adapt... | [-0.0958787507845872, 0.04689809628497724, -0.07586768638787114, -0.030820385220324004, -0.12777953924166716, -0.1610971921017732, 0.044622160618151115, 0.4107116828249259, -0.2283082373249768, -0.3897503473076292, 0.09850393553021025, -0.2326043654614213, -0.12346475811315362, 0.22547626487635583, -0.16101157569580457... |
1,802.06393 | Primordial black holes and uncertainties in the choice of the window
function | Primordial black holes (PBHs) can be produced by the perturbations that exit
the horizon during inflationary phase. While inflation models predict the power
spectrum of the perturbations in Fourier space, the PBH abundance depends on
the probability distribution function (PDF) of density perturbations in real
space. ... | astro-ph.CO hep-ph | primordial black holes pbhs can be produced by the perturbations that exit the horizon during inflationary phase while inflation models predict the power spectrum of the perturbations in fourier space the pbh abundance depends on the probability distribution function pdf of density perturbations in real space in order ... | [['primordial', 'black', 'holes', 'pbhs', 'can', 'be', 'produced', 'by', 'the', 'perturbations', 'that', 'exit', 'the', 'horizon', 'during', 'inflationary', 'phase', 'while', 'inflation', 'models', 'predict', 'the', 'power', 'spectrum', 'of', 'the', 'perturbations', 'in', 'fourier', 'space', 'the', 'pbh', 'abundance', ... | [-0.12828715153273593, 0.17856251508974044, -0.09408498542424001, 0.1387919744287925, -0.07600083625570248, -0.003682931740451785, 0.0019658092500922245, 0.3172820051453863, -0.221227367313633, -0.33540111694720043, 0.112770447173513, -0.2712401922416955, -0.09817820105128651, 0.19552993189624862, -0.028670882316785457... |
1,802.06394 | Training Big Random Forests with Little Resources | Without access to large compute clusters, building random forests on large
datasets is still a challenging problem. This is, in particular, the case if
fully-grown trees are desired. We propose a simple yet effective framework that
allows to efficiently construct ensembles of huge trees for hundreds of
millions or ev... | cs.LG stat.ML | without access to large compute clusters building random forests on large datasets is still a challenging problem this is in particular the case if fullygrown trees are desired we propose a simple yet effective framework that allows to efficiently construct ensembles of huge trees for hundreds of millions or even billi... | [['without', 'access', 'to', 'large', 'compute', 'clusters', 'building', 'random', 'forests', 'on', 'large', 'datasets', 'is', 'still', 'a', 'challenging', 'problem', 'this', 'is', 'in', 'particular', 'the', 'case', 'if', 'fullygrown', 'trees', 'are', 'desired', 'we', 'propose', 'a', 'simple', 'yet', 'effective', 'fram... | [-0.10271035896306087, 0.10050490284968812, -0.01930097860802329, 0.03874645263649859, -0.12555947495253295, -0.15769411993556118, 0.09159257118345092, 0.3888004962494947, -0.27780034209608584, -0.36461347873721806, 0.11645236178178732, -0.2542875461803121, -0.1182202171075641, 0.2503459816010795, -0.07823220377129719,... |
1,802.06395 | A quasilinear approach to fully nonlinear parabolic (S)PDEs on
$\mathbb{R}^d$ | We study the Cauchy problem for fully nonlinear (stochastic) parabolic
partial differential equations. We provide both in deterministic and stochastic
case the existence of a maximal defined solution for the problem and we provide
suitable blow-up criterion. The key idea is the use of the paradifferential
operator ca... | math.AP | we study the cauchy problem for fully nonlinear stochastic parabolic partial differential equations we provide both in deterministic and stochastic case the existence of a maximal defined solution for the problem and we provide suitable blowup criterion the key idea is the use of the paradifferential operator calculus ... | [['we', 'study', 'the', 'cauchy', 'problem', 'for', 'fully', 'nonlinear', 'stochastic', 'parabolic', 'partial', 'differential', 'equations', 'we', 'provide', 'both', 'in', 'deterministic', 'and', 'stochastic', 'case', 'the', 'existence', 'of', 'a', 'maximal', 'defined', 'solution', 'for', 'the', 'problem', 'and', 'we',... | [-0.08806040125588575, -0.002043149254435169, -0.07054951251969517, 0.11331352781465588, -0.17211408759467303, -0.08715669509256259, -0.029773340088043672, 0.29257195175935824, -0.3656712183728814, -0.2057496146298945, 0.15205826702682923, -0.27461440180013597, -0.16552102173057695, 0.19784801503507576, -0.115573065155... |
1,802.06396 | Can quantum mechanics be considered consistent? a discussion of
Frauchinger and Renner's argument | We discuss the argument proposed in Ref.~\cite{Frauchiger-Renner}, and show
that it does not particularly illustrate any inconsistency in quantum
mechanics, but rather the well known difficulty often described as the
\textquotedblleft shifty split\textquotedblright: the exact point at which the
von Neumann reduction ... | quant-ph | we discuss the argument proposed in refcitefrauchigerrenner and show that it does not particularly illustrate any inconsistency in quantum mechanics but rather the well known difficulty often described as the textquotedblleft shifty splittextquotedblright the exact point at which the von neumann reduction postulate sho... | [['we', 'discuss', 'the', 'argument', 'proposed', 'in', 'refcitefrauchigerrenner', 'and', 'show', 'that', 'it', 'does', 'not', 'particularly', 'illustrate', 'any', 'inconsistency', 'in', 'quantum', 'mechanics', 'but', 'rather', 'the', 'well', 'known', 'difficulty', 'often', 'described', 'as', 'the', 'textquotedblleft',... | [-0.06257236301519162, 0.11167263999541706, -0.13407117389811282, 0.12963367848415985, -0.08426722070426805, -0.1801487993822988, 0.02867661084953352, 0.3028963075154824, -0.2666242993866087, -0.2999740598181672, 0.06996358362611066, -0.2429461900428836, -0.1679085643635072, 0.17809733601967334, -0.12873739284522673, 0... |
1,802.06397 | Semiclassical approach to finite temperature quantum annealing with
trapped ions | Recently it has been demonstrated that an ensemble of trapped ions may serve
as a quantum annealer for the number-partitioning problem [Nature Comm. DOI:
10.1038/ncomms11524]. This hard computational problem may be addressed
employing a tunable spin glass architecture. Following the proposal of the
trapped ions annea... | quant-ph cond-mat.quant-gas | recently it has been demonstrated that an ensemble of trapped ions may serve as a quantum annealer for the numberpartitioning problem nature comm doi 101038ncomms11524 this hard computational problem may be addressed employing a tunable spin glass architecture following the proposal of the trapped ions annealer we stud... | [['recently', 'it', 'has', 'been', 'demonstrated', 'that', 'an', 'ensemble', 'of', 'trapped', 'ions', 'may', 'serve', 'as', 'a', 'quantum', 'annealer', 'for', 'the', 'numberpartitioning', 'problem', 'nature', 'comm', 'doi', '101038ncomms11524', 'this', 'hard', 'computational', 'problem', 'may', 'be', 'addressed', 'empl... | [-0.08805376187499081, 0.0842433529354388, -0.10303643531432109, 0.07622830320615322, -0.03352914258305516, -0.18468658308986396, 0.037030554272323137, 0.3920996604930787, -0.2561114413974186, -0.3039496638767776, 0.07051441584314619, -0.2669655050018004, -0.17083713465503284, 0.1979172869186316, -0.05600649959939931, ... |
1,802.06398 | HybridSVD: When Collaborative Information is Not Enough | We propose a new hybrid algorithm that allows incorporating both user and
item side information within the standard collaborative filtering technique.
One of its key features is that it naturally extends a simple PureSVD approach
and inherits its unique advantages, such as highly efficient Lanczos-based
optimization ... | cs.LG cs.IR stat.ML | we propose a new hybrid algorithm that allows incorporating both user and item side information within the standard collaborative filtering technique one of its key features is that it naturally extends a simple puresvd approach and inherits its unique advantages such as highly efficient lanczosbased optimization proce... | [['we', 'propose', 'a', 'new', 'hybrid', 'algorithm', 'that', 'allows', 'incorporating', 'both', 'user', 'and', 'item', 'side', 'information', 'within', 'the', 'standard', 'collaborative', 'filtering', 'technique', 'one', 'of', 'its', 'key', 'features', 'is', 'that', 'it', 'naturally', 'extends', 'a', 'simple', 'puresv... | [-0.07235967371525476, -0.014088062515725142, -0.12505348077684175, 0.046684479002124135, -0.16563637093713623, -0.18339402615310973, 0.07423524736077525, 0.40349072303251887, -0.2948613119588117, -0.3048254134992021, 0.09170082043752359, -0.20698211313379034, -0.2031421173014678, 0.20431712716344919, -0.07291920700095... |
1,802.06399 | Visual-Only Recognition of Normal, Whispered and Silent Speech | Silent speech interfaces have been recently proposed as a way to enable
communication when the acoustic signal is not available. This introduces the
need to build visual speech recognition systems for silent and whispered
speech. However, almost all the recently proposed systems have been trained on
vocalised data on... | cs.CV | silent speech interfaces have been recently proposed as a way to enable communication when the acoustic signal is not available this introduces the need to build visual speech recognition systems for silent and whispered speech however almost all the recently proposed systems have been trained on vocalised data only th... | [['silent', 'speech', 'interfaces', 'have', 'been', 'recently', 'proposed', 'as', 'a', 'way', 'to', 'enable', 'communication', 'when', 'the', 'acoustic', 'signal', 'is', 'not', 'available', 'this', 'introduces', 'the', 'need', 'to', 'build', 'visual', 'speech', 'recognition', 'systems', 'for', 'silent', 'and', 'whisper... | [-0.07502401975396368, 0.0772390553483814, -0.051579642134776206, 0.03188786051369911, -0.10873222691919078, -0.16684804353670976, 0.031877560831471974, 0.43159121151091817, -0.2373756669922588, -0.3111972737131453, 0.12278980475888808, -0.2952049119666833, -0.18135158226287626, 0.22365229600589223, -0.1356551979822058... |
1,802.064 | Elementary Quotient Completions, Church's Thesis, and Partioned
Assemblies | Hyland's effective topos offers an important realizability model for
constructive mathematics in the form of a category whose internal logic
validates Church's Thesis. It also contains a boolean full sub-quasitopos of
"assemblies" where only a restricted form of Church's Thesis survives. In the
present paper we compa... | math.LO | hylands effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates churchs thesis it also contains a boolean full subquasitopos of assemblies where only a restricted form of churchs thesis survives in the present paper we compare the eff... | [['hylands', 'effective', 'topos', 'offers', 'an', 'important', 'realizability', 'model', 'for', 'constructive', 'mathematics', 'in', 'the', 'form', 'of', 'a', 'category', 'whose', 'internal', 'logic', 'validates', 'churchs', 'thesis', 'it', 'also', 'contains', 'a', 'boolean', 'full', 'subquasitopos', 'of', 'assemblies... | [-0.10223212684146486, 0.0714582330979633, -0.14233943839924626, 0.1107326474616107, -0.10862741498903443, -0.12267273544477156, 0.01335716844858745, 0.28186352757620625, -0.32696200124561214, -0.2399461360182613, 0.03189396206401467, -0.20798669859337118, -0.16355549762710536, 0.1257884268662355, -0.1516001694746172, ... |
1,802.06401 | An Overview of Physical Layer Security with Finite-Alphabet Signaling | Providing secure communications over the physical layer with the objective of
achieving perfect secrecy without requiring a secret key has been receiving
growing attention within the past decade. The vast majority of the existing
studies in the area of physical layer security focus exclusively on the
scenarios where ... | cs.IT math.IT | providing secure communications over the physical layer with the objective of achieving perfect secrecy without requiring a secret key has been receiving growing attention within the past decade the vast majority of the existing studies in the area of physical layer security focus exclusively on the scenarios where the... | [['providing', 'secure', 'communications', 'over', 'the', 'physical', 'layer', 'with', 'the', 'objective', 'of', 'achieving', 'perfect', 'secrecy', 'without', 'requiring', 'a', 'secret', 'key', 'has', 'been', 'receiving', 'growing', 'attention', 'within', 'the', 'past', 'decade', 'the', 'vast', 'majority', 'of', 'the',... | [-0.2370891749514226, 0.012708820352940573, -0.013372541895538307, -0.0010171808883966264, -0.058655575526024864, -0.26129639126147075, 0.12158837183152986, 0.4095083788345775, -0.2748620192590067, -0.25847630212411676, 0.14148346769637818, -0.238508471570748, -0.1659393284945761, 0.18032202579384662, -0.12203779924193... |
1,802.06402 | Towards Ultra-High Performance and Energy Efficiency of Deep Learning
Systems: An Algorithm-Hardware Co-Optimization Framework | Hardware accelerations of deep learning systems have been extensively
investigated in industry and academia. The aim of this paper is to achieve
ultra-high energy efficiency and performance for hardware implementations of
deep neural networks (DNNs). An algorithm-hardware co-optimization framework is
developed, which... | cs.LG stat.ML | hardware accelerations of deep learning systems have been extensively investigated in industry and academia the aim of this paper is to achieve ultrahigh energy efficiency and performance for hardware implementations of deep neural networks dnns an algorithmhardware cooptimization framework is developed which is applic... | [['hardware', 'accelerations', 'of', 'deep', 'learning', 'systems', 'have', 'been', 'extensively', 'investigated', 'in', 'industry', 'and', 'academia', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'achieve', 'ultrahigh', 'energy', 'efficiency', 'and', 'performance', 'for', 'hardware', 'implementations', 'of', 'deep... | [-0.11222484557979948, -0.035386526220099766, -0.02056976947027983, 0.008165691972115181, -0.049839950114902526, -0.21432021205934385, 0.045505500078434125, 0.4477847108203504, -0.22959735705775933, -0.39541460894720837, 0.05892295393407242, -0.21774982299086534, -0.14343670456437393, 0.22361670047199975, -0.1076270570... |
1,802.06403 | RadialGAN: Leveraging multiple datasets to improve target-specific
predictive models using Generative Adversarial Networks | Training complex machine learning models for prediction often requires a
large amount of data that is not always readily available. Leveraging these
external datasets from related but different sources is therefore an important
task if good predictive models are to be built for deployment in settings where
data can b... | cs.LG stat.ML | training complex machine learning models for prediction often requires a large amount of data that is not always readily available leveraging these external datasets from related but different sources is therefore an important task if good predictive models are to be built for deployment in settings where data can be r... | [['training', 'complex', 'machine', 'learning', 'models', 'for', 'prediction', 'often', 'requires', 'a', 'large', 'amount', 'of', 'data', 'that', 'is', 'not', 'always', 'readily', 'available', 'leveraging', 'these', 'external', 'datasets', 'from', 'related', 'but', 'different', 'sources', 'is', 'therefore', 'an', 'impo... | [0.01820663794286601, -0.010293224365442357, -0.07942860552510764, 0.06545503992836327, -0.1337022715565076, -0.16518079829337592, 0.048677504979827466, 0.4480398245569732, -0.2748482956602756, -0.3720236484530485, 0.08674533373353673, -0.27514836888035965, -0.14701470896963859, 0.28637117959765923, -0.1452489107355682... |
1,802.06404 | Using 3D Hahn Moments as A Computational Representation of ATS Drugs
Molecular Structure | The campaign against drug abuse is fought by all countries, most notably on
ATS drugs. The technical limitations of the current test kits to detect new
brand of ATS drugs present a challenge to law enforcement authorities and
forensic laboratories. Meanwhile, new molecular imaging devices which allowed
mankind to cha... | cs.CV | the campaign against drug abuse is fought by all countries most notably on ats drugs the technical limitations of the current test kits to detect new brand of ats drugs present a challenge to law enforcement authorities and forensic laboratories meanwhile new molecular imaging devices which allowed mankind to character... | [['the', 'campaign', 'against', 'drug', 'abuse', 'is', 'fought', 'by', 'all', 'countries', 'most', 'notably', 'on', 'ats', 'drugs', 'the', 'technical', 'limitations', 'of', 'the', 'current', 'test', 'kits', 'to', 'detect', 'new', 'brand', 'of', 'ats', 'drugs', 'present', 'a', 'challenge', 'to', 'law', 'enforcement', 'a... | [-0.04925780329663652, 0.011282369699729707, -0.04567928351236567, 0.059234777929872195, -0.13605232023814273, -0.16984301310793687, 0.05827256703063325, 0.38261556990885287, -0.2618444899368721, -0.32292568331374033, 0.10238207698241376, -0.2441716648798476, -0.15828260070874647, 0.22762466183493055, -0.06374691412734... |
1,802.06405 | Sums, products and ratios along the edges of a graph | In their seminal paper Erd\H{o}s and Szemer\'edi formulated conjectures on
the size of sumset and product set of integers. The strongest form of their
conjecture is about sums and products along the edges of a graph. In this paper
we show that this strong form of the Erd\H{o}s-Szemer\'edi conjecture does not
hold. We... | math.CO math.NT | in their seminal paper erdhos and szemeredi formulated conjectures on the size of sumset and product set of integers the strongest form of their conjecture is about sums and products along the edges of a graph in this paper we show that this strong form of the erdhosszemeredi conjecture does not hold we give upper and ... | [['in', 'their', 'seminal', 'paper', 'erdhos', 'and', 'szemeredi', 'formulated', 'conjectures', 'on', 'the', 'size', 'of', 'sumset', 'and', 'product', 'set', 'of', 'integers', 'the', 'strongest', 'form', 'of', 'their', 'conjecture', 'is', 'about', 'sums', 'and', 'products', 'along', 'the', 'edges', 'of', 'a', 'graph', ... | [-0.20122776407595366, 0.06670806901401853, -0.04293191485897931, 0.05151742428050007, -0.047514720730585595, -0.04799399383952969, 0.1049572663439106, 0.3153521551380623, -0.2648721812420512, -0.2976825629705436, 0.09260241922361087, -0.3057259377666226, -0.12262226489997685, 0.17093453756597352, -0.12812214916291303,... |
1,802.06406 | Predicting B Cell Receptor Substitution Profiles Using Public Repertoire
Data | B cells develop high affinity receptors during the course of affinity
maturation, a cyclic process of mutation and selection. At the end of affinity
maturation, a number of cells sharing the same ancestor (i.e. in the same
"clonal family") are released from the germinal center, their amino acid
frequency profile refl... | q-bio.BM q-bio.GN | b cells develop high affinity receptors during the course of affinity maturation a cyclic process of mutation and selection at the end of affinity maturation a number of cells sharing the same ancestor ie in the same clonal family are released from the germinal center their amino acid frequency profile reflects the all... | [['b', 'cells', 'develop', 'high', 'affinity', 'receptors', 'during', 'the', 'course', 'of', 'affinity', 'maturation', 'a', 'cyclic', 'process', 'of', 'mutation', 'and', 'selection', 'at', 'the', 'end', 'of', 'affinity', 'maturation', 'a', 'number', 'of', 'cells', 'sharing', 'the', 'same', 'ancestor', 'ie', 'in', 'the'... | [-0.04029033068111357, 0.06924744390001121, -0.05564008777371931, 0.0791033387457734, -0.0650927091720609, -0.191553765900281, 0.0994963876380376, 0.3995514453369744, -0.29281619510717916, -0.3033379873322627, 0.06375928797749612, -0.2913542220140902, -0.167211009231301, 0.17067004263933216, -0.08389600848313421, -0.00... |
1,802.06407 | Systematic elimination of Stokes divergences emanating from complex
phase space caustics | Stokes phenomenon refers to the fact that the asymptotic expansion of complex
functions can differ in different regions of the complex plane, and that beyond
the so-called Stokes lines has an unphysical divergence. An important special
case is when the Stokes lines emanate from phase space caustics of a complex
traje... | quant-ph | stokes phenomenon refers to the fact that the asymptotic expansion of complex functions can differ in different regions of the complex plane and that beyond the socalled stokes lines has an unphysical divergence an important special case is when the stokes lines emanate from phase space caustics of a complex trajectory... | [['stokes', 'phenomenon', 'refers', 'to', 'the', 'fact', 'that', 'the', 'asymptotic', 'expansion', 'of', 'complex', 'functions', 'can', 'differ', 'in', 'different', 'regions', 'of', 'the', 'complex', 'plane', 'and', 'that', 'beyond', 'the', 'socalled', 'stokes', 'lines', 'has', 'an', 'unphysical', 'divergence', 'an', '... | [-0.10369577069234635, 0.08156080056971009, -0.10136238005341722, 0.06971540535977554, -0.08771034476163538, -0.09768420461324506, 0.011903356228555952, 0.33681467063978415, -0.2599011780694127, -0.2446988571409871, 0.07076755975734214, -0.2719955382168572, -0.18158062533507136, 0.2042560501049469, -0.08746737699348284... |
1,802.06408 | A study of the HI and optical properties of Low Surface Brightness
galaxies: spirals, dwarfs and irregulars | We present a study of the HI and optical properties of nearby ($z$ $\le$ 0.1)
Low Surface Brightness galaxies (LSBGs). We started with a literature sample of
$\sim$900 LSBGs and divided them into three morphological classes: spirals,
irregulars and dwarfs. Of these, we could use $\sim$490 LSBGs to study their HI
and ... | astro-ph.GA | we present a study of the hi and optical properties of nearby z le 01 low surface brightness galaxies lsbgs we started with a literature sample of sim900 lsbgs and divided them into three morphological classes spirals irregulars and dwarfs of these we could use sim490 lsbgs to study their hi and stellar masses colours ... | [['we', 'present', 'a', 'study', 'of', 'the', 'hi', 'and', 'optical', 'properties', 'of', 'nearby', 'z', 'le', '01', 'low', 'surface', 'brightness', 'galaxies', 'lsbgs', 'we', 'started', 'with', 'a', 'literature', 'sample', 'of', 'sim900', 'lsbgs', 'and', 'divided', 'them', 'into', 'three', 'morphological', 'classes', ... | [-0.027994155797447698, 0.10350614583973462, -0.09503138427874849, 0.17921937596741674, -0.056424723138237216, -0.013776668859645725, 0.05505734450707678, 0.4870805499182704, -0.0441656583842511, -0.37484782029641794, -0.0010571063830866478, -0.3237330086198199, -0.06194093634063999, 0.18957226347411052, -0.05415604519... |
1,802.06409 | The many-faceted light curves of young disk-bearing stars in Upper Sco
and $\rho$ Oph observed by $K2$ Campaign 2 | The $K2$ Mission has photometrically monitored thousands of stars at high
precision and cadence in a series of $\sim$80-day campaigns focused on sections
of the ecliptic plane. During its second campaign, $K2$ targeted over 1000
young stellar objects (YSOs) in the $\sim$1-3 Myr $\rho$ Ophiuchus and 5-10 Myr
Upper Sco... | astro-ph.SR | the k2 mission has photometrically monitored thousands of stars at high precision and cadence in a series of sim80day campaigns focused on sections of the ecliptic plane during its second campaign k2 targeted over 1000 young stellar objects ysos in the sim13 myr rho ophiuchus and 510 myr upper scorpius regions from thi... | [['the', 'k2', 'mission', 'has', 'photometrically', 'monitored', 'thousands', 'of', 'stars', 'at', 'high', 'precision', 'and', 'cadence', 'in', 'a', 'series', 'of', 'sim80day', 'campaigns', 'focused', 'on', 'sections', 'of', 'the', 'ecliptic', 'plane', 'during', 'its', 'second', 'campaign', 'k2', 'targeted', 'over', '1... | [-0.07796496991345304, 0.1356008615499983, -0.04675405364417072, 0.09023809186247592, -0.1250367639632526, -0.08433511629072388, 0.10226078189462276, 0.4643198472802483, -0.1655331052625404, -0.3658152260311273, 0.10164895686893798, -0.30887098679326414, -0.052911780495566156, 0.21343415010178143, -0.07822260432987518,... |
1,802.0641 | Emergence of oscillatory behaviors for excitable systems with noise and
mean-field interaction, a slow-fast dynamics approach | We consider the long-time dynamics of a general class of nonlinear
Fokker-Planck equations, describing the large population behavior of mean-field
interacting units. The main motivation of this work concerns the case where the
individual dynamics is excitable, i.e. when each isolated dynamics rests in a
stable state,... | math.AP math-ph math.DS math.MP math.PR nlin.AO | we consider the longtime dynamics of a general class of nonlinear fokkerplanck equations describing the large population behavior of meanfield interacting units the main motivation of this work concerns the case where the individual dynamics is excitable ie when each isolated dynamics rests in a stable state whereas a ... | [['we', 'consider', 'the', 'longtime', 'dynamics', 'of', 'a', 'general', 'class', 'of', 'nonlinear', 'fokkerplanck', 'equations', 'describing', 'the', 'large', 'population', 'behavior', 'of', 'meanfield', 'interacting', 'units', 'the', 'main', 'motivation', 'of', 'this', 'work', 'concerns', 'the', 'case', 'where', 'the... | [-0.19693949855423556, 0.16071072250692728, -0.06398321292520426, 0.04941412614471119, 0.004672014151347449, -0.1252727026144999, 0.010203696522276496, 0.27992198256892936, -0.3099428922743411, -0.25806070411124743, 0.08226797476920576, -0.24819040497941142, -0.20768310852125413, 0.1237312826576542, -0.0272248436254763... |
1,802.06411 | Magnetoelectric effect and orbital magnetization in skyrmion crystals:
Detection and characterization of skyrmions | Skyrmions are small magnetic quasiparticles, which are uniquely characterized
by their topological charge and their helicity. In this Rapid Communication, we
show via calculations how both properties can be determined without relying on
real-space imaging. The orbital magnetization and topological Hall conductivity
m... | cond-mat.str-el | skyrmions are small magnetic quasiparticles which are uniquely characterized by their topological charge and their helicity in this rapid communication we show via calculations how both properties can be determined without relying on realspace imaging the orbital magnetization and topological hall conductivity measure ... | [['skyrmions', 'are', 'small', 'magnetic', 'quasiparticles', 'which', 'are', 'uniquely', 'characterized', 'by', 'their', 'topological', 'charge', 'and', 'their', 'helicity', 'in', 'this', 'rapid', 'communication', 'we', 'show', 'via', 'calculations', 'how', 'both', 'properties', 'can', 'be', 'determined', 'without', 'r... | [-0.20696992098155637, 0.2619803408534414, -0.07211992771396142, 0.04824896342856182, -0.11547509095307147, -0.07249173363199814, 0.03907633769316756, 0.36543203683130526, -0.27751673617808337, -0.31121562813733067, 0.04159306335914357, -0.26508084832819173, -0.13131800746372535, 0.18024482002110337, 0.0338875035522505... |
1,802.06412 | Improved TDNNs using Deep Kernels and Frequency Dependent Grid-RNNs | Time delay neural networks (TDNNs) are an effective acoustic model for large
vocabulary speech recognition. The strength of the model can be attributed to
its ability to effectively model long temporal contexts. However, current TDNN
models are relatively shallow, which limits the modelling capability. This
paper pro... | cs.CL cs.AI cs.SD eess.AS stat.ML | time delay neural networks tdnns are an effective acoustic model for large vocabulary speech recognition the strength of the model can be attributed to its ability to effectively model long temporal contexts however current tdnn models are relatively shallow which limits the modelling capability this paper proposes a m... | [['time', 'delay', 'neural', 'networks', 'tdnns', 'are', 'an', 'effective', 'acoustic', 'model', 'for', 'large', 'vocabulary', 'speech', 'recognition', 'the', 'strength', 'of', 'the', 'model', 'can', 'be', 'attributed', 'to', 'its', 'ability', 'to', 'effectively', 'model', 'long', 'temporal', 'contexts', 'however', 'cu... | [-0.07743692053814552, 0.05645097561500734, -0.02689897791472274, 0.04533184414082156, -0.07117683521297934, -0.1538595130493107, 0.04592315771471157, 0.4126591661146709, -0.2977294219596373, -0.3010825168122, 0.07268629134581475, -0.23844093016788856, -0.17663000982541305, 0.20265176633224505, -0.08475369271812039, 0.... |
1,802.06413 | New spinor classes on the Graf-Clifford algebra | Pinor and spinor fields are sections of the subbundles whose fibers are the
representation spaces of the Clifford algebra of the forms, equipped with the
Graf product. In this context, pinors and spinors are here considered and the
geometric generalized Fierz identities provide the necessary framework to
derive and c... | math-ph math.MP | pinor and spinor fields are sections of the subbundles whose fibers are the representation spaces of the clifford algebra of the forms equipped with the graf product in this context pinors and spinors are here considered and the geometric generalized fierz identities provide the necessary framework to derive and constr... | [['pinor', 'and', 'spinor', 'fields', 'are', 'sections', 'of', 'the', 'subbundles', 'whose', 'fibers', 'are', 'the', 'representation', 'spaces', 'of', 'the', 'clifford', 'algebra', 'of', 'the', 'forms', 'equipped', 'with', 'the', 'graf', 'product', 'in', 'this', 'context', 'pinors', 'and', 'spinors', 'are', 'here', 'co... | [-0.1571313050808385, 0.10404535128097785, -0.02569430257886109, 0.07529418098611611, -0.113461264617447, -0.11315062397012585, -0.09756953646673967, 0.3507819428402734, -0.24630205676045366, -0.22141375010342976, 0.11449305544527688, -0.22209889950279735, -0.16823359451403744, 0.20115842627618755, -0.07302059178657241... |
1,802.06414 | Magnetoanisotropic spin-triplet Andreev reflection in ferromagnet-Ising
superconductor junctions | We theoretically study the electronic transport through a ferromagnet-Ising
superconductor junction. A tight-binding Hamiltonian describing the Ising
superconductor is presented. Then by combing the non-equilibrium Green's
function method, the expressions of Andreev reflection coefficient and
conductance are obtained... | cond-mat.supr-con | we theoretically study the electronic transport through a ferromagnetising superconductor junction a tightbinding hamiltonian describing the ising superconductor is presented then by combing the nonequilibrium greens function method the expressions of andreev reflection coefficient and conductance are obtained a strong... | [['we', 'theoretically', 'study', 'the', 'electronic', 'transport', 'through', 'a', 'ferromagnetising', 'superconductor', 'junction', 'a', 'tightbinding', 'hamiltonian', 'describing', 'the', 'ising', 'superconductor', 'is', 'presented', 'then', 'by', 'combing', 'the', 'nonequilibrium', 'greens', 'function', 'method', '... | [-0.2700461531263393, 0.16330708289066986, -0.07377429071990815, 0.05303035914893704, -0.09888708966097276, -0.18676953072916733, 0.09902945407813761, 0.3858653194949503, -0.2432145162451827, -0.2658675391505139, -0.059261524980272505, -0.32318235037013954, -0.10677742644116216, 0.208172507029937, 0.043456505520513694,... |
1,802.06415 | Solving Large-Scale Minimum-Weight Triangulation Instances to Provable
Optimality | We consider practical methods for the problem of finding a minimum-weight
triangulation (MWT) of a planar point set, a classic problem of computational
geometry with many applications. While Mulzer and Rote proved in 2006 that
computing an MWT is NP-hard, Beirouti and Snoeyink showed in 1998 that
computing provably o... | cs.CG | we consider practical methods for the problem of finding a minimumweight triangulation mwt of a planar point set a classic problem of computational geometry with many applications while mulzer and rote proved in 2006 that computing an mwt is nphard beirouti and snoeyink showed in 1998 that computing provably optimal so... | [['we', 'consider', 'practical', 'methods', 'for', 'the', 'problem', 'of', 'finding', 'a', 'minimumweight', 'triangulation', 'mwt', 'of', 'a', 'planar', 'point', 'set', 'a', 'classic', 'problem', 'of', 'computational', 'geometry', 'with', 'many', 'applications', 'while', 'mulzer', 'and', 'rote', 'proved', 'in', '2006',... | [-0.08852780879342298, 0.024132340371689872, -0.06209454758003392, 0.04875452485173056, -0.08922612982698613, -0.1622955815189264, 0.10279269016940486, 0.40073218020478807, -0.2949323653498655, -0.35365896186358625, 0.14213056031983778, -0.26780349001843445, -0.1305329592068294, 0.2595477791354907, -0.13801173406718958... |
1,802.06416 | Sim-to-Real Optimization of Complex Real World Mobile Network with
Imperfect Information via Deep Reinforcement Learning from Self-play | Mobile network that millions of people use every day is one of the most
complex systems in the world. Optimization of mobile network to meet exploding
customer demand and reduce capital/operation expenditures poses great
challenges. Despite recent progress, application of deep reinforcement learning
(DRL) to complex ... | cs.AI cs.LG stat.ML | mobile network that millions of people use every day is one of the most complex systems in the world optimization of mobile network to meet exploding customer demand and reduce capitaloperation expenditures poses great challenges despite recent progress application of deep reinforcement learning drl to complex real wor... | [['mobile', 'network', 'that', 'millions', 'of', 'people', 'use', 'every', 'day', 'is', 'one', 'of', 'the', 'most', 'complex', 'systems', 'in', 'the', 'world', 'optimization', 'of', 'mobile', 'network', 'to', 'meet', 'exploding', 'customer', 'demand', 'and', 'reduce', 'capitaloperation', 'expenditures', 'poses', 'great... | [-0.08055434482698531, 0.018602073754426903, -0.00517755473138886, 0.06418614218507529, -0.1634494723752141, -0.1809499928019131, 0.06134155349320044, 0.4703946214493202, -0.31843913424932196, -0.352937114947354, 0.07704294227245871, -0.26799827634518886, -0.23574637079297606, 0.15010560302509238, -0.15669588217835712,... |
1,802.06417 | Superthermal photon bunching in terms of simple probability
distributions | We analyze the second-order photon autocorrelation function $g^{(2)}$ with
respect to the photon probability distribution and discuss the generic features
of a distribution that result in superthermal photon bunching ($g^{(2)}>2$).
Superthermal photon bunching has been reported for a number of optical
microcavity sys... | physics.optics quant-ph | we analyze the secondorder photon autocorrelation function g2 with respect to the photon probability distribution and discuss the generic features of a distribution that result in superthermal photon bunching g22 superthermal photon bunching has been reported for a number of optical microcavity systems that exhibit pro... | [['we', 'analyze', 'the', 'secondorder', 'photon', 'autocorrelation', 'function', 'g2', 'with', 'respect', 'to', 'the', 'photon', 'probability', 'distribution', 'and', 'discuss', 'the', 'generic', 'features', 'of', 'a', 'distribution', 'that', 'result', 'in', 'superthermal', 'photon', 'bunching', 'g22', 'superthermal',... | [-0.07214278892710768, 0.20412734612528036, -0.16125787188308222, 0.10664459799547762, 0.009029969190348788, -0.1657945475204488, 0.011705926061598676, 0.4110082110279415, -0.2161309988615979, -0.2732202405341103, -0.007253086156935643, -0.2888878591008263, -0.08867712375721756, 0.2404096911354152, -0.01191123782099215... |
1,802.06418 | Hot electron cooling in Dirac semimetal Cd$_3$As$_2$ due to polar
optical phonons | A theory of hot electron cooling power due to polar optical phonons $P_{\rm
op}$ is developed in three-dimensional Dirac semimetal($3$DDS) Cd$_3$As$_2$
taking account of hot phonon effect. Hot phonon distribution $N_q$ and $P_{\rm
op}$ are investigated as a function of electron temperature $T_e$, electron
density $n_... | cond-mat.mes-hall | a theory of hot electron cooling power due to polar optical phonons p_rm op is developed in threedimensional dirac semimetal3dds cd_3as_2 taking account of hot phonon effect hot phonon distribution n_q and p_rm op are investigated as a function of electron temperature t_e electron density n_e and phonon relaxation time... | [['a', 'theory', 'of', 'hot', 'electron', 'cooling', 'power', 'due', 'to', 'polar', 'optical', 'phonons', 'p_rm', 'op', 'is', 'developed', 'in', 'threedimensional', 'dirac', 'semimetal3dds', 'cd_3as_2', 'taking', 'account', 'of', 'hot', 'phonon', 'effect', 'hot', 'phonon', 'distribution', 'n_q', 'and', 'p_rm', 'op', 'a... | [-0.11411050265814993, 0.3381530779323922, -0.029755191536175764, 0.03994296801366462, 0.005436045407391662, -0.19048087213410658, 0.054605594985001844, 0.371031222642738, -0.20352098709289831, -0.28553361678496003, -0.05136462919869122, -0.37907567944388243, 0.05566156935475936, 0.2552189588790167, 0.05421887411883248... |
1,802.06419 | Maximizing the number of edges in three-dimensional colored
triangulations whose building blocks are balls | Colored triangulations offer a generalization of combinatorial maps to higher
dimensions. Just like maps are gluings of polygons, colored triangulations are
built as gluings of special, higher-dimensional building blocks, such as
octahedra, which we call colored building blocks and known in the dual as
bubbles. A col... | math.CO gr-qc math-ph math.MP | colored triangulations offer a generalization of combinatorial maps to higher dimensions just like maps are gluings of polygons colored triangulations are built as gluings of special higherdimensional building blocks such as octahedra which we call colored building blocks and known in the dual as bubbles a colored buil... | [['colored', 'triangulations', 'offer', 'a', 'generalization', 'of', 'combinatorial', 'maps', 'to', 'higher', 'dimensions', 'just', 'like', 'maps', 'are', 'gluings', 'of', 'polygons', 'colored', 'triangulations', 'are', 'built', 'as', 'gluings', 'of', 'special', 'higherdimensional', 'building', 'blocks', 'such', 'as', ... | [-0.15007671057425725, 0.1367086468860343, -0.049908510072735876, 0.020467225736819018, -0.08332131377448185, -0.13705537006414184, 0.010552264674632356, 0.3413368923506007, -0.2949911804369036, -0.30737422813380805, 0.13027716466212252, -0.3058685276139444, -0.17611728522789258, 0.15441019590444063, -0.133731000525399... |
1,802.0642 | Spectral stability of nonlinear gravity waves in the atmosphere | We apply spectral stability theory to investigate nonlinear gravity waves in
the atmosphere. These waves are determined by modulation equations that result
from Wentzel-Kramers-Brillouin theory. First, we establish that plane waves,
which represent exact solutions to the inviscid Boussinesq equations, are
spectrally ... | physics.flu-dyn | we apply spectral stability theory to investigate nonlinear gravity waves in the atmosphere these waves are determined by modulation equations that result from wentzelkramersbrillouin theory first we establish that plane waves which represent exact solutions to the inviscid boussinesq equations are spectrally stable wi... | [['we', 'apply', 'spectral', 'stability', 'theory', 'to', 'investigate', 'nonlinear', 'gravity', 'waves', 'in', 'the', 'atmosphere', 'these', 'waves', 'are', 'determined', 'by', 'modulation', 'equations', 'that', 'result', 'from', 'wentzelkramersbrillouin', 'theory', 'first', 'we', 'establish', 'that', 'plane', 'waves'... | [-0.1750697868982819, 0.12779255812973378, -0.08703861874446933, 0.10758981701212951, -0.06701070573258958, -0.12061240764168304, -0.04785081644037832, 0.2912152650292609, -0.29942456410167606, -0.23133712523134278, 0.1572013319139603, -0.25073941493817925, -0.16311262828927467, 0.20638523764606545, 0.00898334187391739... |
1,802.06421 | Measuring Accessibility using Gravity and Radiation Models | Since the presentation of the Radiation Model, much work has been done to
compare its findings with those obtained from Gravitational Models. These
comparisons always aim at measuring the accuracy with which the models
reproduce the mobility described by origin-destination matrices. This has been
done at different sp... | physics.soc-ph | since the presentation of the radiation model much work has been done to compare its findings with those obtained from gravitational models these comparisons always aim at measuring the accuracy with which the models reproduce the mobility described by origindestination matrices this has been done at different spatial ... | [['since', 'the', 'presentation', 'of', 'the', 'radiation', 'model', 'much', 'work', 'has', 'been', 'done', 'to', 'compare', 'its', 'findings', 'with', 'those', 'obtained', 'from', 'gravitational', 'models', 'these', 'comparisons', 'always', 'aim', 'at', 'measuring', 'the', 'accuracy', 'with', 'which', 'the', 'models',... | [-0.029073757996772368, 0.036846236158011206, -0.10367265186987776, 0.0942752592957666, -0.027858511403264757, -0.11789334078643533, 0.042596482547020635, 0.401737774912659, -0.22698565067990956, -0.37136292605929705, 0.11417922398939893, -0.2828754734824211, -0.12003876720491613, 0.1948756998972787, -0.079443909570019... |
1,802.06422 | Stochastic stability of invariant measures: The 2D Euler equation | In finite-dimensional dynamical systems, stochastic stability provides the
selection of physical relevant measures from the myriad invariant measures of
conservative systems. That this might also apply to infinite-dimensional
systems is the inspiration for this work. As an example the 2D Euler equation
is studied. Am... | math.DS physics.flu-dyn | in finitedimensional dynamical systems stochastic stability provides the selection of physical relevant measures from the myriad invariant measures of conservative systems that this might also apply to infinitedimensional systems is the inspiration for this work as an example the 2d euler equation is studied among othe... | [['in', 'finitedimensional', 'dynamical', 'systems', 'stochastic', 'stability', 'provides', 'the', 'selection', 'of', 'physical', 'relevant', 'measures', 'from', 'the', 'myriad', 'invariant', 'measures', 'of', 'conservative', 'systems', 'that', 'this', 'might', 'also', 'apply', 'to', 'infinitedimensional', 'systems', '... | [-0.14852333904587126, 0.1235929818528683, -0.09605703906058088, 0.10165637549423416, -0.04432334140323004, -0.12135710739561259, -0.016144303310858577, 0.33143752705501883, -0.3076937028978902, -0.2288346507549776, 0.1048979440927628, -0.22646034895871325, -0.20315713594103918, 0.2338533228214242, -0.08672895143421269... |
1,802.06423 | Experimental investigation of dynamical structures formation due to
flowing complex plasma past an obstacle | We report the experimental observation of dynamical behavior of flowing
complex plasma past a spherical obstacle. The experiment has been carried out
in a $\Pi$-shaped DC glow discharge experimental device using kaolin particles
as the dust component in a background of Argon plasma. A stationary dust cloud
is formed ... | physics.plasm-ph | we report the experimental observation of dynamical behavior of flowing complex plasma past a spherical obstacle the experiment has been carried out in a pishaped dc glow discharge experimental device using kaolin particles as the dust component in a background of argon plasma a stationary dust cloud is formed by maint... | [['we', 'report', 'the', 'experimental', 'observation', 'of', 'dynamical', 'behavior', 'of', 'flowing', 'complex', 'plasma', 'past', 'a', 'spherical', 'obstacle', 'the', 'experiment', 'has', 'been', 'carried', 'out', 'in', 'a', 'pishaped', 'dc', 'glow', 'discharge', 'experimental', 'device', 'using', 'kaolin', 'particl... | [-0.16043855739490673, 0.18206702762217614, -0.08498187851175432, -0.009208152857132432, -0.028581756035115306, -0.06876499526153179, -0.008277023333953474, 0.37177293271277334, -0.24786453687138563, -0.263379863130596, 0.09108800567387727, -0.2843656103423701, -0.032439630749034075, 0.18325255584617064, -0.01522627588... |
1,802.06424 | End-to-end Audiovisual Speech Recognition | Several end-to-end deep learning approaches have been recently presented
which extract either audio or visual features from the input images or audio
signals and perform speech recognition. However, research on end-to-end
audiovisual models is very limited. In this work, we present an end-to-end
audiovisual model bas... | cs.CV | several endtoend deep learning approaches have been recently presented which extract either audio or visual features from the input images or audio signals and perform speech recognition however research on endtoend audiovisual models is very limited in this work we present an endtoend audiovisual model based on residu... | [['several', 'endtoend', 'deep', 'learning', 'approaches', 'have', 'been', 'recently', 'presented', 'which', 'extract', 'either', 'audio', 'or', 'visual', 'features', 'from', 'the', 'input', 'images', 'or', 'audio', 'signals', 'and', 'perform', 'speech', 'recognition', 'however', 'research', 'on', 'endtoend', 'audiovis... | [-0.054577467388340406, -0.007374903821619228, -0.047371845697718004, 0.03205169962785606, -0.07403423867587532, -0.19572233848539847, 0.0004105409307937537, 0.4527994999608823, -0.2676595154218376, -0.3075957382460391, 0.05408142807594101, -0.3044755295664072, -0.18942064900483405, 0.19301082032466574, -0.123958523576... |
1,802.06425 | Parabolic orbits of $2$-nilpotent elements for classical groups | We consider the conjugation-action of the Borel subgroup of the symplectic or
the orthogonal group on the variety of nilpotent complex elements of nilpotency
degree $2$ in its Lie algebra. We translate the setup to a
representation-theoretic context in the language of a symmetric quiver algebra.
This makes it possibl... | math.RT math.CO | we consider the conjugationaction of the borel subgroup of the symplectic or the orthogonal group on the variety of nilpotent complex elements of nilpotency degree 2 in its lie algebra we translate the setup to a representationtheoretic context in the language of a symmetric quiver algebra this makes it possible to pro... | [['we', 'consider', 'the', 'conjugationaction', 'of', 'the', 'borel', 'subgroup', 'of', 'the', 'symplectic', 'or', 'the', 'orthogonal', 'group', 'on', 'the', 'variety', 'of', 'nilpotent', 'complex', 'elements', 'of', 'nilpotency', 'degree', '2', 'in', 'its', 'lie', 'algebra', 'we', 'translate', 'the', 'setup', 'to', 'a... | [-0.15689748240278123, 0.04044712513209658, -0.10128570726498011, 0.0727344731678889, -0.1818353344260299, -0.11528309252846272, 0.038603759962109296, 0.38367805287162676, -0.3492970887690465, -0.2179594367663277, 0.11655470038432271, -0.2171640507629181, -0.14312696665218297, 0.19381237407759863, -0.15761867007290192,... |
1,802.06426 | Estimating scale-invariant future in continuous time | Natural learners must compute an estimate of future outcomes that follow from
a stimulus in continuous time. Widely used reinforcement learning algorithms
discretize continuous time and estimate either transition functions from one
step to the next (model-based algorithms) or a scalar value of
exponentially-discounte... | cs.AI q-bio.NC | natural learners must compute an estimate of future outcomes that follow from a stimulus in continuous time widely used reinforcement learning algorithms discretize continuous time and estimate either transition functions from one step to the next modelbased algorithms or a scalar value of exponentiallydiscounted futur... | [['natural', 'learners', 'must', 'compute', 'an', 'estimate', 'of', 'future', 'outcomes', 'that', 'follow', 'from', 'a', 'stimulus', 'in', 'continuous', 'time', 'widely', 'used', 'reinforcement', 'learning', 'algorithms', 'discretize', 'continuous', 'time', 'and', 'estimate', 'either', 'transition', 'functions', 'from'... | [-0.038021864571973034, 0.08312274298773643, -0.13317069537499818, 0.09571486823362015, -0.1524648310479951, -0.16717345663219813, 0.03578230730161759, 0.41982797096969315, -0.318243148101433, -0.293304303048543, 0.11520151239212441, -0.22220900386025239, -0.1625583137299501, 0.23281765799923881, -0.08856090735618795, ... |
1,802.06427 | Iwasawa Main Conjecture for $p$-adic families of elliptic modular
cuspforms | In this article, we discuss Iwasawa Main Conjecture for $p$-adic families of
elliptic modular cuspforms. After the overview on the situation of the ordinary
case of Hida family, we will introduce a Coleman map for Coleman family for the
non-ordinary case (Coleman family) which was obtained as a joint work with
Filipp... | math.NT | in this article we discuss iwasawa main conjecture for padic families of elliptic modular cuspforms after the overview on the situation of the ordinary case of hida family we will introduce a coleman map for coleman family for the nonordinary case coleman family which was obtained as a joint work with filippo nuccio no... | [['in', 'this', 'article', 'we', 'discuss', 'iwasawa', 'main', 'conjecture', 'for', 'padic', 'families', 'of', 'elliptic', 'modular', 'cuspforms', 'after', 'the', 'overview', 'on', 'the', 'situation', 'of', 'the', 'ordinary', 'case', 'of', 'hida', 'family', 'we', 'will', 'introduce', 'a', 'coleman', 'map', 'for', 'cole... | [-0.19315585279695063, -0.000651052845499784, -0.18325334390134815, 0.09422518911181402, -0.08993993368255727, -0.11854397827930009, -0.0026283269678775705, 0.203006018735184, -0.22888564954703775, -0.26851448852689724, 0.07795122035206757, -0.20876963201284637, -0.1932046652010834, 0.2884464540042495, -0.1839253247185... |
1,802.06428 | Improving Mild Cognitive Impairment Prediction via Reinforcement
Learning and Dialogue Simulation | Mild cognitive impairment (MCI) is a prodromal phase in the progression from
normal aging to dementia, especially Alzheimers disease. Even though there is
mild cognitive decline in MCI patients, they have normal overall cognition and
thus is challenging to distinguish from normal aging. Using transcribed data
obtaine... | cs.LG cs.CL stat.ML | mild cognitive impairment mci is a prodromal phase in the progression from normal aging to dementia especially alzheimers disease even though there is mild cognitive decline in mci patients they have normal overall cognition and thus is challenging to distinguish from normal aging using transcribed data obtained from r... | [['mild', 'cognitive', 'impairment', 'mci', 'is', 'a', 'prodromal', 'phase', 'in', 'the', 'progression', 'from', 'normal', 'aging', 'to', 'dementia', 'especially', 'alzheimers', 'disease', 'even', 'though', 'there', 'is', 'mild', 'cognitive', 'decline', 'in', 'mci', 'patients', 'they', 'have', 'normal', 'overall', 'cog... | [-0.013203855382744222, 0.041104012637132606, -0.08935251321802896, 0.09328504042779585, -0.13065025715377965, -0.21214928912538056, 0.08576511053037585, 0.4464617167182855, -0.2143181795769028, -0.2956368856352607, 0.04910761378828044, -0.279616188961939, -0.2239972758940176, 0.2064968725274268, -0.2123576830680433, 0... |
1,802.06429 | Cech cohomology and the Capitulation kernel | We discuss the capitulation kernel associated to a degree n covering using
Cech cohomology and the Kummer sequence. The main result is a five-term exact
sequence that relates the capitulation kernel to the Cech cohomology of the
n-th roots of unity and a certain subquotient of the group of units modulo n-th
powers.
| math.NT math.AG | we discuss the capitulation kernel associated to a degree n covering using cech cohomology and the kummer sequence the main result is a fiveterm exact sequence that relates the capitulation kernel to the cech cohomology of the nth roots of unity and a certain subquotient of the group of units modulo nth powers | [['we', 'discuss', 'the', 'capitulation', 'kernel', 'associated', 'to', 'a', 'degree', 'n', 'covering', 'using', 'cech', 'cohomology', 'and', 'the', 'kummer', 'sequence', 'the', 'main', 'result', 'is', 'a', 'fiveterm', 'exact', 'sequence', 'that', 'relates', 'the', 'capitulation', 'kernel', 'to', 'the', 'cech', 'cohomo... | [-0.23903135452770963, 0.03547060941258129, -0.09170161837817363, 0.06821314728036874, -0.0910257778025039, -0.05586886687977415, -0.004780340575138634, 0.26555759781303834, -0.40852348003887906, -0.18126697237339784, 0.08033947093974587, -0.23799445775319944, -0.17980144770359094, 0.17320179418256543, -0.1237135035389... |
1,802.0643 | DARTS: Deceiving Autonomous Cars with Toxic Signs | Sign recognition is an integral part of autonomous cars. Any
misclassification of traffic signs can potentially lead to a multitude of
disastrous consequences, ranging from a life-threatening accident to even a
large-scale interruption of transportation services relying on autonomous cars.
In this paper, we propose a... | cs.CR cs.CV | sign recognition is an integral part of autonomous cars any misclassification of traffic signs can potentially lead to a multitude of disastrous consequences ranging from a lifethreatening accident to even a largescale interruption of transportation services relying on autonomous cars in this paper we propose and exami... | [['sign', 'recognition', 'is', 'an', 'integral', 'part', 'of', 'autonomous', 'cars', 'any', 'misclassification', 'of', 'traffic', 'signs', 'can', 'potentially', 'lead', 'to', 'a', 'multitude', 'of', 'disastrous', 'consequences', 'ranging', 'from', 'a', 'lifethreatening', 'accident', 'to', 'even', 'a', 'largescale', 'in... | [-0.1315727966657775, -0.0050074374319790714, -0.04823399563047313, 0.06482854371401711, -0.09367081879794893, -0.21936912697712235, 0.0769008927290457, 0.38569842266970045, -0.2142900994305711, -0.30393733514592713, 0.13165749051281952, -0.2951872974624373, -0.23313350891832743, 0.23596349267184152, -0.208213734664115... |
1,802.06431 | String Model with Mesons and Baryons in Modified Measure Theory | We consider string meson and string baryon models in the framework of the
modified measure theory, the theory that does not use the determinant of the
metric to construct the invariant volume element. As the outcome of this
theory, the string tension is not placed ad hoc but is derived. When the
charges are presented... | hep-th | we consider string meson and string baryon models in the framework of the modified measure theory the theory that does not use the determinant of the metric to construct the invariant volume element as the outcome of this theory the string tension is not placed ad hoc but is derived when the charges are presented the t... | [['we', 'consider', 'string', 'meson', 'and', 'string', 'baryon', 'models', 'in', 'the', 'framework', 'of', 'the', 'modified', 'measure', 'theory', 'the', 'theory', 'that', 'does', 'not', 'use', 'the', 'determinant', 'of', 'the', 'metric', 'to', 'construct', 'the', 'invariant', 'volume', 'element', 'as', 'the', 'outcom... | [-0.14956870568750202, 0.17773262276723809, -0.08820765159368792, 0.09820122724340763, -0.03960195147212491, -0.16538777855856568, 0.019648318888222868, 0.31282429799924744, -0.25602223562870036, -0.24291607620263542, 0.0939004534814524, -0.31848820598571803, -0.08781933702131803, 0.12117339504389006, -0.04425013148984... |
1,802.06432 | Music Genre Classification using Masked Conditional Neural Networks | The ConditionaL Neural Networks (CLNN) and the Masked ConditionaL Neural
Networks (MCLNN) exploit the nature of multi-dimensional temporal signals. The
CLNN captures the conditional temporal influence between the frames in a window
and the mask in the MCLNN enforces a systematic sparseness that follows a
filterbank-l... | cs.LG stat.ML | the conditional neural networks clnn and the masked conditional neural networks mclnn exploit the nature of multidimensional temporal signals the clnn captures the conditional temporal influence between the frames in a window and the mask in the mclnn enforces a systematic sparseness that follows a filterbanklike patte... | [['the', 'conditional', 'neural', 'networks', 'clnn', 'and', 'the', 'masked', 'conditional', 'neural', 'networks', 'mclnn', 'exploit', 'the', 'nature', 'of', 'multidimensional', 'temporal', 'signals', 'the', 'clnn', 'captures', 'the', 'conditional', 'temporal', 'influence', 'between', 'the', 'frames', 'in', 'a', 'windo... | [-0.095111622859443, 0.00758462602335919, -0.07482703651730267, 0.07571918710267969, -0.09634047211147845, -0.10926821849138904, 0.055573632197809364, 0.48565958050035296, -0.29231720827224233, -0.2931626871198652, 0.042550122065077876, -0.25083530724551234, -0.2198661132383027, 0.1547462460621896, -0.10145962918694648... |
1,802.06433 | Interpolating by functions from model subspaces in $H^1$ | Given an interpolating Blaschke product $B$ with zeros $\{a_j\}$, we seek to
characterize the sequences of values $\{w_j\}$ for which the interpolation
problem $$f(a_j)=w_j\qquad (j=1,2,\dots)$$ can be solved with a function $f$
from the model subspace $H^1\cap B\overline{H^1_0}$ of the Hardy space $H^1$.
| math.CV math.CA math.FA | given an interpolating blaschke product b with zeros a_j we seek to characterize the sequences of values w_j for which the interpolation problem fa_jw_jqquad j12dots can be solved with a function f from the model subspace h1cap boverlineh1_0 of the hardy space h1 | [['given', 'an', 'interpolating', 'blaschke', 'product', 'b', 'with', 'zeros', 'a_j', 'we', 'seek', 'to', 'characterize', 'the', 'sequences', 'of', 'values', 'w_j', 'for', 'which', 'the', 'interpolation', 'problem', 'fa_jw_jqquad', 'j12dots', 'can', 'be', 'solved', 'with', 'a', 'function', 'f', 'from', 'the', 'model', ... | [-0.1446044005271865, 0.05145348818928696, -0.0562523564823517, 0.048443376211585794, -0.043191880691887403, -0.10452996766785295, 0.016699590061495944, 0.3488687050369818, -0.38908518423757904, -0.20590224071610264, 0.11160909787683589, -0.2662585504671059, -0.08435404362020696, 0.1424861987768786, -0.0494986206701979... |
1,802.06434 | Random time-changes and asymptotic results for a class of
continuous-time Markov chains on integers with alternating rates | We consider continuous-time Markov chains on integers which allow transitions
to adjacent states only, with alternating rates. We give explicit formulas for
probability generating functions, and also for means, variances and state
probabilities of the random variables of the process. Moreover we study
independent ran... | math.PR | we consider continuoustime markov chains on integers which allow transitions to adjacent states only with alternating rates we give explicit formulas for probability generating functions and also for means variances and state probabilities of the random variables of the process moreover we study independent random time... | [['we', 'consider', 'continuoustime', 'markov', 'chains', 'on', 'integers', 'which', 'allow', 'transitions', 'to', 'adjacent', 'states', 'only', 'with', 'alternating', 'rates', 'we', 'give', 'explicit', 'formulas', 'for', 'probability', 'generating', 'functions', 'and', 'also', 'for', 'means', 'variances', 'and', 'stat... | [-0.11337895766436387, 0.18458342932122337, -0.06920389876573939, 0.078253476513489, -0.025053553873228586, -0.1442541818250902, 0.10645681734736585, 0.39589405023831536, -0.2622755408731543, -0.18914973413021388, 0.11280072807196782, -0.2480450584500266, -0.13752871870317243, 0.17723960313014686, -0.04830534565073983,... |
1,802.06435 | Topological Methods in the Quest for Periodic Orbits | These are lecture notes on Floer and Rabinowitz-Floer homology written for a
graduate course at UNICAMP August-December 2016 and a mini-course held at IMPA
in August 2017.
| math.SG math-ph math.DG math.DS math.GT math.MP | these are lecture notes on floer and rabinowitzfloer homology written for a graduate course at unicamp augustdecember 2016 and a minicourse held at impa in august 2017 | [['these', 'are', 'lecture', 'notes', 'on', 'floer', 'and', 'rabinowitzfloer', 'homology', 'written', 'for', 'a', 'graduate', 'course', 'at', 'unicamp', 'augustdecember', '2016', 'and', 'a', 'minicourse', 'held', 'at', 'impa', 'in', 'august', '2017']] | [-0.0972043197877981, 0.1285603372035203, -0.18079421665795423, 0.052517585180423876, -0.05262737569433672, -0.16648570199807486, -0.057059481739997864, 0.2648084144349451, -0.12274697575614685, -0.43794979651769, 0.2005398265318945, -0.33935483931391325, -0.14351219626971418, 0.16689326020854492, -0.23845113931154763,... |
1,802.06436 | Multicritical edge statistics for the momenta of fermions in
non-harmonic traps | We compute the joint statistics of the momenta $p_i$ of $N$ non-interacting
fermions in a trap, near the Fermi edge, with a particular focus on the largest
one $p_{\max}$. For a $1d$ harmonic trap, momenta and positions play a
symmetric role and hence, the joint statistics of momenta is identical to that
of the posit... | cond-mat.stat-mech cond-mat.quant-gas math-ph math.MP math.PR | we compute the joint statistics of the momenta p_i of n noninteracting fermions in a trap near the fermi edge with a particular focus on the largest one p_max for a 1d harmonic trap momenta and positions play a symmetric role and hence the joint statistics of momenta is identical to that of the positions in particular ... | [['we', 'compute', 'the', 'joint', 'statistics', 'of', 'the', 'momenta', 'p_i', 'of', 'n', 'noninteracting', 'fermions', 'in', 'a', 'trap', 'near', 'the', 'fermi', 'edge', 'with', 'a', 'particular', 'focus', 'on', 'the', 'largest', 'one', 'p_max', 'for', 'a', '1d', 'harmonic', 'trap', 'momenta', 'and', 'positions', 'pl... | [-0.14092686494481504, 0.19608366004142322, -0.06416206143330783, 0.04446433115088822, -0.01938094468909855, -0.168234505476185, 0.011781318338379558, 0.33832648508465163, -0.2451527418299137, -0.2453646648048705, 0.038245129170000405, -0.3378090202551041, -0.11254311941631481, 0.14534769887043358, 0.000868496534837360... |
1,802.06437 | What We Read, What We Search: Media Attention and Public Attention Among
193 Countries | We investigate the alignment of international attention of news media
organizations within 193 countries with the expressed international interests
of the public within those same countries from March 7, 2016 to April 14, 2017.
We collect fourteen months of longitudinal data of online news from Unfiltered
News and we... | cs.SI physics.soc-ph | we investigate the alignment of international attention of news media organizations within 193 countries with the expressed international interests of the public within those same countries from march 7 2016 to april 14 2017 we collect fourteen months of longitudinal data of online news from unfiltered news and web sea... | [['we', 'investigate', 'the', 'alignment', 'of', 'international', 'attention', 'of', 'news', 'media', 'organizations', 'within', '193', 'countries', 'with', 'the', 'expressed', 'international', 'interests', 'of', 'the', 'public', 'within', 'those', 'same', 'countries', 'from', 'march', '7', '2016', 'to', 'april', '14',... | [-0.0729366782361633, 0.07831393820860903, -0.03732600069677108, 0.10157656950129783, -0.1381517227879432, -0.1260280448871082, 0.09018821120857512, 0.470522282532412, -0.2182613240199304, -0.3336806584608881, 0.14398293421001995, -0.40302242545972333, -0.17191713401323747, 0.1821203818922165, -0.06608670600689948, -0.... |
1,802.06438 | Theory of nonlinear microwave absorption by interacting two-level
systems | The microwave absorption and noise caused by quantum two-level systems (TLS)
dramatically suppress the coherence in Josephson junction qubits that are
promising candidates for a quantum information applications. Microwave
absorption by TLSs is not clearly understood yet because of the complexity of
their interactions... | cond-mat.mes-hall quant-ph | the microwave absorption and noise caused by quantum twolevel systems tls dramatically suppress the coherence in josephson junction qubits that are promising candidates for a quantum information applications microwave absorption by tlss is not clearly understood yet because of the complexity of their interactions leadi... | [['the', 'microwave', 'absorption', 'and', 'noise', 'caused', 'by', 'quantum', 'twolevel', 'systems', 'tls', 'dramatically', 'suppress', 'the', 'coherence', 'in', 'josephson', 'junction', 'qubits', 'that', 'are', 'promising', 'candidates', 'for', 'a', 'quantum', 'information', 'applications', 'microwave', 'absorption',... | [-0.15633478006997772, 0.18473635090681068, -0.004535167974820577, 0.051230229099385814, -0.03536983491318633, -0.19356553448912825, 0.018624643389994727, 0.35260824486613274, -0.2616054011118967, -0.2690644865068643, 0.021786562045278072, -0.29803699197864897, -0.14320191133103166, 0.21133885943726094, -0.010561410471... |
1,802.06439 | Local Optimality and Generalization Guarantees for the Langevin
Algorithm via Empirical Metastability | We study the detailed path-wise behavior of the discrete-time Langevin
algorithm for non-convex Empirical Risk Minimization (ERM) through the lens of
metastability, adopting some techniques from Berglund and Gentz (2003.
For a particular local optimum of the empirical risk, with an arbitrary
initialization, we show... | cs.LG math.OC math.PR stat.ML | we study the detailed pathwise behavior of the discretetime langevin algorithm for nonconvex empirical risk minimization erm through the lens of metastability adopting some techniques from berglund and gentz 2003 for a particular local optimum of the empirical risk with an arbitrary initialization we show that with hig... | [['we', 'study', 'the', 'detailed', 'pathwise', 'behavior', 'of', 'the', 'discretetime', 'langevin', 'algorithm', 'for', 'nonconvex', 'empirical', 'risk', 'minimization', 'erm', 'through', 'the', 'lens', 'of', 'metastability', 'adopting', 'some', 'techniques', 'from', 'berglund', 'and', 'gentz', '2003', 'for', 'a', 'pa... | [-0.12563526437921255, 0.09624309554325766, -0.12996168519956022, 0.09206911864463907, -0.03377562188395885, -0.16031527951385033, 0.09691465471326521, 0.3749277497730239, -0.3064326446621792, -0.26328195533630905, 0.1134046701212915, -0.2532494291989765, -0.13346224618923946, 0.15208295373903477, -0.09146576426234265,... |
1,802.0644 | Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms | One of the most fundamental problems in Computer Science is the Knapsack
problem. Given a set of n items with different weights and values, it asks to
pick the most valuable subset whose total weight is below a capacity threshold
T. Despite its wide applicability in various areas in Computer Science,
Operations Resea... | cs.DS | one of the most fundamental problems in computer science is the knapsack problem given a set of n items with different weights and values it asks to pick the most valuable subset whose total weight is below a capacity threshold t despite its wide applicability in various areas in computer science operations research an... | [['one', 'of', 'the', 'most', 'fundamental', 'problems', 'in', 'computer', 'science', 'is', 'the', 'knapsack', 'problem', 'given', 'a', 'set', 'of', 'n', 'items', 'with', 'different', 'weights', 'and', 'values', 'it', 'asks', 'to', 'pick', 'the', 'most', 'valuable', 'subset', 'whose', 'total', 'weight', 'is', 'below', ... | [-0.1330592488415135, 0.06544645729588032, -0.0350727020544116, 0.02856613196899909, -0.11578937427279974, -0.15063372318006496, 0.08926423409004162, 0.37641588021798916, -0.3029595364566256, -0.364256855738399, 0.11881950883651765, -0.24796892910718493, -0.14302918383291527, 0.2101241906390615, -0.09236916643898815, 0... |
1,802.06441 | Deep neural decoders for near term fault-tolerant experiments | Finding efficient decoders for quantum error correcting codes adapted to
realistic experimental noise in fault-tolerant devices represents a significant
challenge. In this paper we introduce several decoding algorithms complemented
by deep neural decoders and apply them to analyze several fault-tolerant error
correct... | quant-ph stat.ML | finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in faulttolerant devices represents a significant challenge in this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several faulttolerant error correction p... | [['finding', 'efficient', 'decoders', 'for', 'quantum', 'error', 'correcting', 'codes', 'adapted', 'to', 'realistic', 'experimental', 'noise', 'in', 'faulttolerant', 'devices', 'represents', 'a', 'significant', 'challenge', 'in', 'this', 'paper', 'we', 'introduce', 'several', 'decoding', 'algorithms', 'complemented', '... | [-0.1291897798916895, -0.025853119079886022, -0.058519872759554385, 0.11167352907929798, -0.032078860989268106, -0.2737813867243691, 0.08432719758616722, 0.4463777789009773, -0.24670984262210907, -0.29659397893452216, 0.09965542501625035, -0.22288237876087733, -0.2388778880561645, 0.26308056679126635, -0.14407698160312... |
1,802.06442 | Tame and Wild Symmetric Special Multiserial Algebras | We provide a complete classification of all tame and wild symmetric special
multiserial algebras in terms of the underlying Brauer configuration. Our
classification contains the symmetric special multiserial algebras of finite
representation type.
| math.RT | we provide a complete classification of all tame and wild symmetric special multiserial algebras in terms of the underlying brauer configuration our classification contains the symmetric special multiserial algebras of finite representation type | [['we', 'provide', 'a', 'complete', 'classification', 'of', 'all', 'tame', 'and', 'wild', 'symmetric', 'special', 'multiserial', 'algebras', 'in', 'terms', 'of', 'the', 'underlying', 'brauer', 'configuration', 'our', 'classification', 'contains', 'the', 'symmetric', 'special', 'multiserial', 'algebras', 'of', 'finite',... | [-0.14981194207388343, -0.007892408544042459, -0.015834171212080753, 0.0860781367077972, -0.1615551646770627, -0.18208425897032474, -0.0827707350747942, 0.3472141755998812, -0.271334270819683, -0.11927014036160527, 0.1302677453883613, -0.1712452238284503, -0.1853624882289406, 0.1457767684972196, -0.2075712684485497, -0... |
1,802.06443 | Lifting Private Information Retrieval from Two to any Number of Messages | We study private information retrieval (PIR) on coded data with possibly
colluding servers. Devising PIR schemes with optimal download rate in the case
of collusion and coded data is still open in general. We provide a lifting
operation that can transform what we call one-shot PIR schemes for two messages
into scheme... | cs.IT math.IT | we study private information retrieval pir on coded data with possibly colluding servers devising pir schemes with optimal download rate in the case of collusion and coded data is still open in general we provide a lifting operation that can transform what we call oneshot pir schemes for two messages into schemes for a... | [['we', 'study', 'private', 'information', 'retrieval', 'pir', 'on', 'coded', 'data', 'with', 'possibly', 'colluding', 'servers', 'devising', 'pir', 'schemes', 'with', 'optimal', 'download', 'rate', 'in', 'the', 'case', 'of', 'collusion', 'and', 'coded', 'data', 'is', 'still', 'open', 'in', 'general', 'we', 'provide', ... | [-0.2619828150213302, -0.026229375847489446, -0.029020253292008025, 0.07339939956662354, -0.08244636636080539, -0.3411799036385911, 0.1866637063338547, 0.367685962678143, -0.3102543482112254, -0.23389239274049262, 0.19783762327357624, -0.2775526817023821, -0.06281515313228508, 0.20487276957210926, -0.21579477104131836,... |
1,802.06444 | Efficient Collaborative Multi-Agent Deep Reinforcement Learning for
Large-Scale Fleet Management | Large-scale online ride-sharing platforms have substantially transformed our
lives by reallocating transportation resources to alleviate traffic congestion
and promote transportation efficiency. An efficient fleet management strategy
not only can significantly improve the utilization of transportation resources
but a... | cs.MA cs.AI | largescale online ridesharing platforms have substantially transformed our lives by reallocating transportation resources to alleviate traffic congestion and promote transportation efficiency an efficient fleet management strategy not only can significantly improve the utilization of transportation resources but also i... | [['largescale', 'online', 'ridesharing', 'platforms', 'have', 'substantially', 'transformed', 'our', 'lives', 'by', 'reallocating', 'transportation', 'resources', 'to', 'alleviate', 'traffic', 'congestion', 'and', 'promote', 'transportation', 'efficiency', 'an', 'efficient', 'fleet', 'management', 'strategy', 'not', 'o... | [-0.1066558069388928, 0.027388599050403892, -0.03964552185337605, 0.06697650106447138, -0.14209404437770617, -0.1584328322960385, 0.08713573442916546, 0.4482081123081775, -0.3052312619823577, -0.3918747920446612, 0.09162716405177168, -0.2343817742822435, -0.18939329015797582, 0.20233026108351246, -0.20803807003359343, ... |
1,802.06445 | Dancing twins: stellar hierarchies that formed sequentially? | This paper attracts attention to the class of resolved triple stars with
moderate ratios of inner and outer periods (possibly in a mean motion
resonance) and nearly circular, mutually aligned orbits. Moreover, stars in the
inner pair are twins with almost identical masses, while the mass sum of the
inner pair is comp... | astro-ph.SR | this paper attracts attention to the class of resolved triple stars with moderate ratios of inner and outer periods possibly in a mean motion resonance and nearly circular mutually aligned orbits moreover stars in the inner pair are twins with almost identical masses while the mass sum of the inner pair is comparable t... | [['this', 'paper', 'attracts', 'attention', 'to', 'the', 'class', 'of', 'resolved', 'triple', 'stars', 'with', 'moderate', 'ratios', 'of', 'inner', 'and', 'outer', 'periods', 'possibly', 'in', 'a', 'mean', 'motion', 'resonance', 'and', 'nearly', 'circular', 'mutually', 'aligned', 'orbits', 'moreover', 'stars', 'in', 't... | [-0.1405820591323899, 0.20058354377328586, -0.010398923357083338, 0.009761436866215013, -0.056861617112913584, -0.0823911504900655, 0.03388830640730925, 0.39089461350740173, -0.20206053536311966, -0.3817497567222344, 0.10591730782963835, -0.28740662364444997, 0.000242591391896873, 0.1700454954608842, -0.063660971596690... |
1,802.06446 | Fast 5DOF Needle Tracking in iOCT | Purpose. Intraoperative Optical Coherence Tomography (iOCT) is an
increasingly available imaging technique for ophthalmic microsurgery that
provides high-resolution cross-sectional information of the surgical scene. We
propose to build on its desirable qualities and present a method for tracking
the orientation and l... | cs.CV | purpose intraoperative optical coherence tomography ioct is an increasingly available imaging technique for ophthalmic microsurgery that provides highresolution crosssectional information of the surgical scene we propose to build on its desirable qualities and present a method for tracking the orientation and location ... | [['purpose', 'intraoperative', 'optical', 'coherence', 'tomography', 'ioct', 'is', 'an', 'increasingly', 'available', 'imaging', 'technique', 'for', 'ophthalmic', 'microsurgery', 'that', 'provides', 'highresolution', 'crosssectional', 'information', 'of', 'the', 'surgical', 'scene', 'we', 'propose', 'to', 'build', 'on'... | [-0.035551280867565385, 0.022123908421200895, -0.12142291036434472, 0.04793954844258298, -0.11265227309163517, -0.19053171466415128, 0.00901887693462761, 0.4569814205169678, -0.2090646749403063, -0.3520118849774405, 0.12470281649129007, -0.2359253814192826, -0.11574822369501087, 0.24922842006173615, -0.1383136711770393... |
1,802.06447 | Eigenvalue bounds for Stark operators with complex potentials | We consider the 3-dimensional Stark operator perturbed by a complex-valued
potential. We obtain an estimate for the number of eigenvalues of this operator
as well as for the sum of imaginary parts of eigenvalues situated in the upper
half-plane.
| math.SP | we consider the 3dimensional stark operator perturbed by a complexvalued potential we obtain an estimate for the number of eigenvalues of this operator as well as for the sum of imaginary parts of eigenvalues situated in the upper halfplane | [['we', 'consider', 'the', '3dimensional', 'stark', 'operator', 'perturbed', 'by', 'a', 'complexvalued', 'potential', 'we', 'obtain', 'an', 'estimate', 'for', 'the', 'number', 'of', 'eigenvalues', 'of', 'this', 'operator', 'as', 'well', 'as', 'for', 'the', 'sum', 'of', 'imaginary', 'parts', 'of', 'eigenvalues', 'situat... | [-0.1454436944749875, 0.06357707965929503, 0.005171034306001205, 0.03237469139425323, -0.03954043062642599, -0.04756832140712784, 0.012700024801187025, 0.2969457636324641, -0.24851708916517404, -0.24462997555159605, 0.12447531390875483, -0.31465003276482606, -0.16396881226384535, 0.18185058355522463, -0.021584771382503... |
1,802.06448 | Particle resuspension from complex surfaces: current knowledge and
limitations | This review explores particle resuspension from surfaces due to fluid flows.
The objective of this review is to provide a general framework and terminology
for particle resuspension while highlighting the future developments needed to
deepen our understanding of these phenomena. For that purpose, the manuscript
is or... | physics.flu-dyn cond-mat.soft | this review explores particle resuspension from surfaces due to fluid flows the objective of this review is to provide a general framework and terminology for particle resuspension while highlighting the future developments needed to deepen our understanding of these phenomena for that purpose the manuscript is organiz... | [['this', 'review', 'explores', 'particle', 'resuspension', 'from', 'surfaces', 'due', 'to', 'fluid', 'flows', 'the', 'objective', 'of', 'this', 'review', 'is', 'to', 'provide', 'a', 'general', 'framework', 'and', 'terminology', 'for', 'particle', 'resuspension', 'while', 'highlighting', 'the', 'future', 'developments'... | [-0.079619380179153, 0.1747132615022525, -0.0762259831119861, 0.025842841217616715, -0.060559554693319806, -0.10446077276080089, 0.0029739678938422802, 0.35115682068639076, -0.27096695161250595, -0.3374766018385564, 0.06882695588705406, -0.2661419279801731, -0.1394122498235307, 0.19263233433817872, -0.08253121902097328... |
1,802.06449 | Toric topology of the complex Grassmann manifolds | The family of the complex Grassmann manifolds $G_{n,k}$ with a canonical
action of the torus $T^n=\mathbb{T}^{n}$ and the analogue of the moment map
$\mu : G_{n,k}\to \Delta _{n,k}$ for the hypersimplex $\Delta _{n,k}$, is well
known. In this paper we study the structure of the orbit space $G_{n,k}/T^n$ by
developing... | math.AT | the family of the complex grassmann manifolds g_nk with a canonical action of the torus tnmathbbtn and the analogue of the moment map mu g_nkto delta _nk for the hypersimplex delta _nk is well known in this paper we study the structure of the orbit space g_nktn by developing the methods of toric geometry and toric topo... | [['the', 'family', 'of', 'the', 'complex', 'grassmann', 'manifolds', 'g_nk', 'with', 'a', 'canonical', 'action', 'of', 'the', 'torus', 'tnmathbbtn', 'and', 'the', 'analogue', 'of', 'the', 'moment', 'map', 'mu', 'g_nkto', 'delta', '_nk', 'for', 'the', 'hypersimplex', 'delta', '_nk', 'is', 'well', 'known', 'in', 'this', ... | [-0.1565320165148781, 0.09157506233508078, -0.05105498818059762, 0.0717128428213376, -0.0517786294396501, -0.07643494826625101, 0.030871621879244533, 0.3260476523467029, -0.3119455039559398, -0.20981056253464583, 0.10082275309347703, -0.24338047703301224, -0.14855490423118076, 0.16423895908519626, -0.10884400235639381,... |
1,802.0645 | Reducing Initial Cell-search Latency in mmWave Networks | Millimeter-wave (mmWave) networks rely on directional transmissions, in both
control plane and data plane, to overcome severe path-loss. Nevertheless, the
use of narrow beams complicates the initial cell-search procedure where we lack
sufficient information for beamforming. In this paper, we investigate the
feasibili... | cs.IT cs.NI math.IT | millimeterwave mmwave networks rely on directional transmissions in both control plane and data plane to overcome severe pathloss nevertheless the use of narrow beams complicates the initial cellsearch procedure where we lack sufficient information for beamforming in this paper we investigate the feasibility of random ... | [['millimeterwave', 'mmwave', 'networks', 'rely', 'on', 'directional', 'transmissions', 'in', 'both', 'control', 'plane', 'and', 'data', 'plane', 'to', 'overcome', 'severe', 'pathloss', 'nevertheless', 'the', 'use', 'of', 'narrow', 'beams', 'complicates', 'the', 'initial', 'cellsearch', 'procedure', 'where', 'we', 'lac... | [-0.20695125833406408, 0.016970097592692506, -0.026904808624481507, 0.045345387615573905, -0.10873924158044275, -0.1584357280110897, 0.1245944217802206, 0.4148027055081009, -0.21468032478325993, -0.25760646491102124, 0.11280082299305458, -0.19169053685844176, -0.24317334159169085, 0.18827255817072452, -0.12036374777324... |
1,802.06451 | D-Sempre: Learning Deep Semantic-Preserving Embeddings for User
interests-Social Contents Modeling | Exponential growth of social media consumption demands effective user
interests-social contents modeling for more personalized recommendation and
social media summarization. However, due to the heterogeneous nature of social
contents, traditional approaches lack the ability of capturing the hidden
semantic correlatio... | cs.SI | exponential growth of social media consumption demands effective user interestssocial contents modeling for more personalized recommendation and social media summarization however due to the heterogeneous nature of social contents traditional approaches lack the ability of capturing the hidden semantic correlations acr... | [['exponential', 'growth', 'of', 'social', 'media', 'consumption', 'demands', 'effective', 'user', 'interestssocial', 'contents', 'modeling', 'for', 'more', 'personalized', 'recommendation', 'and', 'social', 'media', 'summarization', 'however', 'due', 'to', 'the', 'heterogeneous', 'nature', 'of', 'social', 'contents', ... | [-0.07765641044548136, 0.002568226161903502, -0.060705120903661564, 0.09739771946222477, -0.21350001409383756, -0.14819944456352718, 0.0994516169569189, 0.45321691724294355, -0.3043906153290577, -0.34673265510992635, -0.013561306183137709, -0.37218743195047693, -0.2184506646756615, 0.08323161520529539, -0.0837292091172... |
1,802.06452 | Direct linearisation of the discrete-time two-dimensional Toda lattices | The discrete-time two-dimensional Toda lattice of $A_\infty$-type is studied
within the direct linearisation framework, which allows us to deal with several
nonlinear equations in this class simultaneously and to construct more general
solutions of these equations. The periodic reductions of this model are also
consi... | nlin.SI math-ph math.MP | the discretetime twodimensional toda lattice of a_inftytype is studied within the direct linearisation framework which allows us to deal with several nonlinear equations in this class simultaneously and to construct more general solutions of these equations the periodic reductions of this model are also considered givi... | [['the', 'discretetime', 'twodimensional', 'toda', 'lattice', 'of', 'a_inftytype', 'is', 'studied', 'within', 'the', 'direct', 'linearisation', 'framework', 'which', 'allows', 'us', 'to', 'deal', 'with', 'several', 'nonlinear', 'equations', 'in', 'this', 'class', 'simultaneously', 'and', 'to', 'construct', 'more', 'gen... | [-0.12268884427612647, 0.08306224032531719, -0.03033555977398882, 0.06664260567039663, -0.10538123903569539, -0.17489384307299513, -0.02171043850830756, 0.3210089118094058, -0.33083673903869615, -0.24811024491901737, 0.13078781732710432, -0.22613839118295456, -0.14745785367700295, 0.17548895088288732, -0.03387660544831... |
1,802.06453 | Rescaling nonsmooth optimization using BFGS and Shor updates | The BFGS quasi-Newton methodology, popular for smooth minimization, has also
proved surprisingly effective in nonsmooth optimization. Through a variety of
simple examples and computational experiments, we explore how the BFGS matrix
update improves the local metric associated with a convex function even in the
absenc... | math.OC | the bfgs quasinewton methodology popular for smooth minimization has also proved surprisingly effective in nonsmooth optimization through a variety of simple examples and computational experiments we explore how the bfgs matrix update improves the local metric associated with a convex function even in the absence of sm... | [['the', 'bfgs', 'quasinewton', 'methodology', 'popular', 'for', 'smooth', 'minimization', 'has', 'also', 'proved', 'surprisingly', 'effective', 'in', 'nonsmooth', 'optimization', 'through', 'a', 'variety', 'of', 'simple', 'examples', 'and', 'computational', 'experiments', 'we', 'explore', 'how', 'the', 'bfgs', 'matrix... | [-0.06797985173761845, -0.028645387603088268, -0.08844648005943449, 0.08322843059986121, -0.11093580379845604, -0.19552044985106304, 0.07589742369831555, 0.41676493018629057, -0.2917720621954354, -0.2974430960566101, 0.1337430790576729, -0.22920305777104602, -0.22323573694106133, 0.18172014947788465, -0.102288409683202... |
1,802.06454 | DA-GAN: Instance-level Image Translation by Deep Attention Generative
Adversarial Networks (with Supplementary Materials) | Unsupervised image translation, which aims in translating two independent
sets of images, is challenging in discovering the correct correspondences
without paired data. Existing works build upon Generative Adversarial Network
(GAN) such that the distribution of the translated images are indistinguishable
from the dis... | cs.CV | unsupervised image translation which aims in translating two independent sets of images is challenging in discovering the correct correspondences without paired data existing works build upon generative adversarial network gan such that the distribution of the translated images are indistinguishable from the distributi... | [['unsupervised', 'image', 'translation', 'which', 'aims', 'in', 'translating', 'two', 'independent', 'sets', 'of', 'images', 'is', 'challenging', 'in', 'discovering', 'the', 'correct', 'correspondences', 'without', 'paired', 'data', 'existing', 'works', 'build', 'upon', 'generative', 'adversarial', 'network', 'gan', '... | [-0.03323624033367547, 0.0024325932381014347, -0.05470584453546772, 0.102830572953699, -0.16110783674330426, -0.1610030323321187, 0.05497063776889629, 0.45301120809067497, -0.31058562856546984, -0.36553660978775016, 0.06579894278008767, -0.27674240544536916, -0.14651748646055618, 0.1580788137024101, -0.1841989362208300... |
1,802.06455 | Bayesian Uncertainty Estimation for Batch Normalized Deep Networks | We show that training a deep network using batch normalization is equivalent
to approximate inference in Bayesian models. We further demonstrate that this
finding allows us to make meaningful estimates of the model uncertainty using
conventional architectures, without modifications to the network or the
training proc... | stat.ML | we show that training a deep network using batch normalization is equivalent to approximate inference in bayesian models we further demonstrate that this finding allows us to make meaningful estimates of the model uncertainty using conventional architectures without modifications to the network or the training procedur... | [['we', 'show', 'that', 'training', 'a', 'deep', 'network', 'using', 'batch', 'normalization', 'is', 'equivalent', 'to', 'approximate', 'inference', 'in', 'bayesian', 'models', 'we', 'further', 'demonstrate', 'that', 'this', 'finding', 'allows', 'us', 'to', 'make', 'meaningful', 'estimates', 'of', 'the', 'model', 'unce... | [-0.02334703872969121, -0.0684532521761103, -0.11355102829919714, 0.07957004915698673, -0.10573458886003972, -0.16514773095417537, 0.09702890081170165, 0.4845896387173806, -0.23831163112212111, -0.3591052143903518, 0.044819904413695134, -0.24459110693391672, -0.16742761610478255, 0.2270667394220737, -0.0975292076264726... |
1,802.06456 | Optimal allocation of attentional resource to multiple items with
unequal relevance | In natural perception, different items (objects) in a scene are rarely
equally relevant to the observer. The brain improves performance by directing
attention to the most relevant items, for example the ones most likely to be
probed. For a general set of probing probabilities, it is not known how
attentional resource... | q-bio.NC | in natural perception different items objects in a scene are rarely equally relevant to the observer the brain improves performance by directing attention to the most relevant items for example the ones most likely to be probed for a general set of probing probabilities it is not known how attentional resources should ... | [['in', 'natural', 'perception', 'different', 'items', 'objects', 'in', 'a', 'scene', 'are', 'rarely', 'equally', 'relevant', 'to', 'the', 'observer', 'the', 'brain', 'improves', 'performance', 'by', 'directing', 'attention', 'to', 'the', 'most', 'relevant', 'items', 'for', 'example', 'the', 'ones', 'most', 'likely', '... | [-0.09516723674839128, 0.10674924339095625, -0.04212280301499866, 0.08971701857904363, -0.15212225019206813, -0.21951076072016118, 0.12490074378842611, 0.4193723128465824, -0.2745256073212441, -0.30392715250682867, 0.049030281198431475, -0.25673317521305833, -0.13694051664579146, 0.17955430526660007, -0.129089227676793... |
1,802.06457 | Circles and crossing planar compact convex sets | Let $K_0$ be a compact convex subset of the plane $\mathbb R^2$, and assume
that whenever $K_1\subseteq \mathbb R^2$ is congruent to $K_0$, then $K_0$ and
$K_1$ are not crossing in a natural sense due to L. Fejes-T\'oth. A theorem of
L. Fejes-T\'oth from 1967 states that the assumption above holds for $K_0$ if
and on... | math.MG math.CO | let k_0 be a compact convex subset of the plane mathbb r2 and assume that whenever k_1subseteq mathbb r2 is congruent to k_0 then k_0 and k_1 are not crossing in a natural sense due to l fejestoth a theorem of l fejestoth from 1967 states that the assumption above holds for k_0 if and only if k_0 is a disk in a paper a... | [['let', 'k_0', 'be', 'a', 'compact', 'convex', 'subset', 'of', 'the', 'plane', 'mathbb', 'r2', 'and', 'assume', 'that', 'whenever', 'k_1subseteq', 'mathbb', 'r2', 'is', 'congruent', 'to', 'k_0', 'then', 'k_0', 'and', 'k_1', 'are', 'not', 'crossing', 'in', 'a', 'natural', 'sense', 'due', 'to', 'l', 'fejestoth', 'a', 't... | [-0.1265698769949542, 0.10249565836924236, -0.1144244611599433, 0.05986062718070382, -0.1070662801479094, -0.13324396413910758, 0.04029813581408062, 0.2957593774500154, -0.309534582984496, -0.2411514415499374, 0.10461667791345107, -0.24175555425070602, -0.16180095201380243, 0.19187866353458097, -0.14106685896514304, -0... |
1,802.06458 | A Generative Modeling Approach to Limited Channel ECG Classification | Processing temporal sequences is central to a variety of applications in
health care, and in particular multi-channel Electrocardiogram (ECG) is a
highly prevalent diagnostic modality that relies on robust sequence modeling.
While Recurrent Neural Networks (RNNs) have led to significant advances in
automated diagnosi... | stat.ML cs.LG | processing temporal sequences is central to a variety of applications in health care and in particular multichannel electrocardiogram ecg is a highly prevalent diagnostic modality that relies on robust sequence modeling while recurrent neural networks rnns have led to significant advances in automated diagnosis with ti... | [['processing', 'temporal', 'sequences', 'is', 'central', 'to', 'a', 'variety', 'of', 'applications', 'in', 'health', 'care', 'and', 'in', 'particular', 'multichannel', 'electrocardiogram', 'ecg', 'is', 'a', 'highly', 'prevalent', 'diagnostic', 'modality', 'that', 'relies', 'on', 'robust', 'sequence', 'modeling', 'whil... | [-0.037861574492617255, -0.012505438187348148, -0.0867292909251606, 0.09865100172982534, -0.13840569296503222, -0.19368895366959318, 0.03793502240256046, 0.43694788594644496, -0.25649936253810585, -0.2975708749202406, 0.1156331690591103, -0.2627878524991541, -0.2152673582734963, 0.2216897802584536, -0.17919878074556497... |
1,802.06459 | Structured Label Inference for Visual Understanding | Visual data such as images and videos contain a rich source of structured
semantic labels as well as a wide range of interacting components. Visual
content could be assigned with fine-grained labels describing major components,
coarse-grained labels depicting high level abstractions, or a set of labels
revealing attr... | cs.CV | visual data such as images and videos contain a rich source of structured semantic labels as well as a wide range of interacting components visual content could be assigned with finegrained labels describing major components coarsegrained labels depicting high level abstractions or a set of labels revealing attributes ... | [['visual', 'data', 'such', 'as', 'images', 'and', 'videos', 'contain', 'a', 'rich', 'source', 'of', 'structured', 'semantic', 'labels', 'as', 'well', 'as', 'a', 'wide', 'range', 'of', 'interacting', 'components', 'visual', 'content', 'could', 'be', 'assigned', 'with', 'finegrained', 'labels', 'describing', 'major', 'c... | [-0.05455632221142734, -0.0034733242954653088, 0.0049642641641203045, 0.07634597488720486, -0.1199805118416731, -0.1630042853804379, 0.023896921387444814, 0.48416215925486666, -0.25682321380786965, -0.3819148540658194, 0.06297715996002483, -0.2913664370189688, -0.1507066699507932, 0.1464704774622114, -0.156631663447421... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.