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,803.03667 | Co-occurrence of the Benford-like and Zipf Laws Arising from the Texts
Representing Human and Artificial Languages | We demonstrate that large texts, representing human (English, Russian,
Ukrainian) and artificial (C++, Java) languages, display quantitative patterns
characterized by the Benford-like and Zipf laws. The frequency of a word
following the Zipf law is inversely proportional to its rank, whereas the total
numbers of a ce... | cs.CL physics.soc-ph stat.OT | we demonstrate that large texts representing human english russian ukrainian and artificial c java languages display quantitative patterns characterized by the benfordlike and zipf laws the frequency of a word following the zipf law is inversely proportional to its rank whereas the total numbers of a certain word appea... | [['we', 'demonstrate', 'that', 'large', 'texts', 'representing', 'human', 'english', 'russian', 'ukrainian', 'and', 'artificial', 'c', 'java', 'languages', 'display', 'quantitative', 'patterns', 'characterized', 'by', 'the', 'benfordlike', 'and', 'zipf', 'laws', 'the', 'frequency', 'of', 'a', 'word', 'following', 'the'... | [-0.11610000836662948, 0.13417693903684857, -0.07067101390235414, 0.13326309511733309, -0.08969652050409496, -0.13272889782258165, 0.07299369640792228, 0.3113609484086434, -0.2881654401748002, -0.33235999730953236, 0.010919660646884845, -0.3374369839675785, -0.1054931313738348, 0.21251380387589533, -0.08598210186069563... |
1,803.03668 | Coupling tunable D-band directional coupler for millimeter-wave
applications | A coupling tunable D-band directional coupler is designed based on a novel
coupling grid structure proposed in this letter. The designed directional
coupler has excellent performance with ultra-wideband. The coupling can be
tuned from -28.2 dB to -33.2 dB at 140 GHz by changing the angle of the
coupling grid, and the... | physics.ins-det | a coupling tunable dband directional coupler is designed based on a novel coupling grid structure proposed in this letter the designed directional coupler has excellent performance with ultrawideband the coupling can be tuned from 282 db to 332 db at 140 ghz by changing the angle of the coupling grid and the dynamic ra... | [['a', 'coupling', 'tunable', 'dband', 'directional', 'coupler', 'is', 'designed', 'based', 'on', 'a', 'novel', 'coupling', 'grid', 'structure', 'proposed', 'in', 'this', 'letter', 'the', 'designed', 'directional', 'coupler', 'has', 'excellent', 'performance', 'with', 'ultrawideband', 'the', 'coupling', 'can', 'be', 't... | [-0.16335102526867523, 0.12325841051037653, 0.03900951419791004, -0.050106155607701826, -0.07003470081467145, -0.19693788468819295, 0.11365705232440244, 0.446041181462236, -0.2202773249090308, -0.3726751750869916, 0.07023890429674325, -0.232955481036391, -0.07575438955872513, 0.1947719172475454, 0.008553452769036192, 0... |
1,803.03669 | Provably robust estimation of modulo 1 samples of a smooth function with
applications to phase unwrapping | Consider an unknown smooth function $f: [0,1]^d \rightarrow \mathbb{R}$, and
say we are given $n$ noisy mod 1 samples of $f$, i.e., $y_i = (f(x_i) +
\eta_i)\mod 1$, for $x_i \in [0,1]^d$, where $\eta_i$ denotes the noise. Given
the samples $(x_i,y_i)_{i=1}^{n}$, our goal is to recover smooth, robust
estimates of the ... | stat.ML | consider an unknown smooth function f 01d rightarrow mathbbr and say we are given n noisy mod 1 samples of f ie y_i fx_i eta_imod 1 for x_i in 01d where eta_i denotes the noise given the samples x_iy_i_i1n our goal is to recover smooth robust estimates of the clean samples fx_i bmod 1 we formulate a natural approach fo... | [['consider', 'an', 'unknown', 'smooth', 'function', 'f', '01d', 'rightarrow', 'mathbbr', 'and', 'say', 'we', 'are', 'given', 'n', 'noisy', 'mod', '1', 'samples', 'of', 'f', 'ie', 'y_i', 'fx_i', 'eta_imod', '1', 'for', 'x_i', 'in', '01d', 'where', 'eta_i', 'denotes', 'the', 'noise', 'given', 'the', 'samples', 'x_iy_i_i... | [-0.07903401245700091, 0.00342553220669962, -0.04977399210846117, 0.038024712018538395, -0.06675702822069032, -0.16960470444177622, 0.05291123239167191, 0.38274199803200243, -0.32204502564366466, -0.30768991529425016, 0.12397867921207399, -0.304167505754223, -0.14990927303703241, 0.2007476178085809, -0.1057724177408344... |
1,803.0367 | IcoRating: A Deep-Learning System for Scam ICO Identification | Cryptocurrencies (or digital tokens, digital currencies, e.g., BTC, ETH, XRP,
NEO) have been rapidly gaining ground in use, value, and understanding among
the public, bringing astonishing profits to investors. Unlike other money and
banking systems, most digital tokens do not require central authorities. Being
decent... | cs.CL | cryptocurrencies or digital tokens digital currencies eg btc eth xrp neo have been rapidly gaining ground in use value and understanding among the public bringing astonishing profits to investors unlike other money and banking systems most digital tokens do not require central authorities being decentralized poses sign... | [['cryptocurrencies', 'or', 'digital', 'tokens', 'digital', 'currencies', 'eg', 'btc', 'eth', 'xrp', 'neo', 'have', 'been', 'rapidly', 'gaining', 'ground', 'in', 'use', 'value', 'and', 'understanding', 'among', 'the', 'public', 'bringing', 'astonishing', 'profits', 'to', 'investors', 'unlike', 'other', 'money', 'and', ... | [-0.07028252633586861, -0.00829423176581988, -0.028740803408575898, 0.11603965714760682, -0.16696460115929654, -0.21194801307534297, 0.10785707593533005, 0.41303809903963595, -0.20947096842092958, -0.3324946563817773, 0.15523296124427327, -0.38197813884610965, -0.11544354219396716, 0.1854064815732076, -0.18354076816781... |
1,803.03671 | Unique dynamic crossover in supercooled x,3-dihydroxypropyl acrylate (x
= 1, 2) isomers mixture | The previtreous dynamics in glass forming monomer, glycerol monoacrylate
(GMA), using broadband dielectric spectroscopy (BDS) was tested. Measurements
revealed the clear dynamic crossover at temperature $T_B = 254$ K and the time
scale $\tau(T_B) = 5.4$ ns for the primary (structural) relaxation time and no
hallmarks... | cond-mat.soft | the previtreous dynamics in glass forming monomer glycerol monoacrylate gma using broadband dielectric spectroscopy bds was tested measurements revealed the clear dynamic crossover at temperature t_b 254 k and the time scale taut_b 54 ns for the primary structural relaxation time and no hallmarks for the crossover for ... | [['the', 'previtreous', 'dynamics', 'in', 'glass', 'forming', 'monomer', 'glycerol', 'monoacrylate', 'gma', 'using', 'broadband', 'dielectric', 'spectroscopy', 'bds', 'was', 'tested', 'measurements', 'revealed', 'the', 'clear', 'dynamic', 'crossover', 'at', 'temperature', 't_b', '254', 'k', 'and', 'the', 'time', 'scale... | [-0.10141670423276399, 0.24393105863026626, -0.09415011051029938, 0.0019440963722603477, 0.005836496451545669, -0.17360578224103412, 0.07437161045229954, 0.3566518155776936, -0.24879381296442538, -0.2743166596993156, 0.07442742295704945, -0.2981980233412722, -0.07779741270629609, 0.15640910122158896, 0.0823105633096850... |
1,803.03672 | Competitive Machine Learning: Best Theoretical Prediction vs
Optimization | Machine learning is often used in competitive scenarios: Participants learn
and fit static models, and those models compete in a shared platform. The
common assumption is that in order to win a competition one has to have the
best predictive model, i.e., the model with the smallest out-sample error. Is
that necessari... | cs.LG stat.ML | machine learning is often used in competitive scenarios participants learn and fit static models and those models compete in a shared platform the common assumption is that in order to win a competition one has to have the best predictive model ie the model with the smallest outsample error is that necessarily true doe... | [['machine', 'learning', 'is', 'often', 'used', 'in', 'competitive', 'scenarios', 'participants', 'learn', 'and', 'fit', 'static', 'models', 'and', 'those', 'models', 'compete', 'in', 'a', 'shared', 'platform', 'the', 'common', 'assumption', 'is', 'that', 'in', 'order', 'to', 'win', 'a', 'competition', 'one', 'has', 't... | [-0.013422048962014902, 0.03281163735586393, -0.1033067374946942, 0.09567435554913833, -0.10398380716163594, -0.20943824817529982, 0.06849744309933492, 0.39498607847853867, -0.26428998770393874, -0.32431547382703296, 0.08551531974685653, -0.29768802792144317, -0.16727166125748014, 0.16810581048904166, -0.11750651997805... |
1,803.03673 | Fault Localization Models in Debugging | Debugging is considered as a rigorous but important feature of software
engineering process. Since more than a decade, the software engineering
research community is exploring different techniques for removal of faults from
programs but it is quite difficult to overcome all the faults of software
programs. Thus, it i... | cs.SE | debugging is considered as a rigorous but important feature of software engineering process since more than a decade the software engineering research community is exploring different techniques for removal of faults from programs but it is quite difficult to overcome all the faults of software programs thus it is stil... | [['debugging', 'is', 'considered', 'as', 'a', 'rigorous', 'but', 'important', 'feature', 'of', 'software', 'engineering', 'process', 'since', 'more', 'than', 'a', 'decade', 'the', 'software', 'engineering', 'research', 'community', 'is', 'exploring', 'different', 'techniques', 'for', 'removal', 'of', 'faults', 'from', ... | [-0.0892803269498809, 0.02898859240597597, -0.0401072498479927, 0.10145041101660118, -0.07340180582401377, -0.18526221082925245, 0.029465341221334207, 0.38232259575139593, -0.2432993865399449, -0.3497299931322535, 0.1708406766919695, -0.22751727386688192, -0.20916092012215542, 0.2475113561445916, -0.09708778541535139, ... |
1,803.03674 | Sequential Outlier Detection based on Incremental Decision Trees | We introduce an online outlier detection algorithm to detect outliers in a
sequentially observed data stream. For this purpose, we use a two-stage
filtering and hedging approach. In the first stage, we construct a multi-modal
probability density function to model the normal samples. In the second stage,
given a new o... | cs.LG | we introduce an online outlier detection algorithm to detect outliers in a sequentially observed data stream for this purpose we use a twostage filtering and hedging approach in the first stage we construct a multimodal probability density function to model the normal samples in the second stage given a new observation... | [['we', 'introduce', 'an', 'online', 'outlier', 'detection', 'algorithm', 'to', 'detect', 'outliers', 'in', 'a', 'sequentially', 'observed', 'data', 'stream', 'for', 'this', 'purpose', 'we', 'use', 'a', 'twostage', 'filtering', 'and', 'hedging', 'approach', 'in', 'the', 'first', 'stage', 'we', 'construct', 'a', 'multim... | [-0.06646878873212508, 0.03871233235155741, -0.0886527145795641, 0.05448950076077948, -0.07336540160104935, -0.08444878776832992, 0.09147959681857483, 0.4094804070309287, -0.28239448080668866, -0.30530304413454734, 0.08550009556748124, -0.27335710998300294, -0.16130693753811753, 0.1513540975189568, -0.08186554223645916... |
1,803.03675 | Active Galactic Nuclei Feedback in an Elliptical Galaxy with the Most
Updated AGN Physics (II): High-Angular Momentum Case | This is the second paper of our series of works of studying the effects of
active galactic nuclei (AGN) feedback on the cosmological evolution of an
isolated elliptical galaxy by performing two-dimensional high-resolution
hydrodynamical numerical simulations. In these simulations, the inner boundary
is chosen so that... | astro-ph.HE astro-ph.GA | this is the second paper of our series of works of studying the effects of active galactic nuclei agn feedback on the cosmological evolution of an isolated elliptical galaxy by performing twodimensional highresolution hydrodynamical numerical simulations in these simulations the inner boundary is chosen so that the bon... | [['this', 'is', 'the', 'second', 'paper', 'of', 'our', 'series', 'of', 'works', 'of', 'studying', 'the', 'effects', 'of', 'active', 'galactic', 'nuclei', 'agn', 'feedback', 'on', 'the', 'cosmological', 'evolution', 'of', 'an', 'isolated', 'elliptical', 'galaxy', 'by', 'performing', 'twodimensional', 'highresolution', '... | [-0.08331083167433065, 0.0689171842343105, -0.061931819966706034, 0.09310388724480419, -0.09752971686632145, -0.04245072923197202, -0.006974295036888496, 0.3811979505024147, -0.1885469084012501, -0.30743582450241724, 0.06041929937431935, -0.27999870501631563, -0.0830232321287745, 0.19597672684711984, -0.064205257347951... |
1,803.03676 | Existence and Construction of Galilean invariant $z\neq2$ Theories | We prove a no-go theorem for the construction of a Galilean boost invariant
and $z\neq2$ anisotropic scale invariant field theory with a finite dimensional
basis of fields. Two point correlators in such theories, we show, grow
unboundedly with spatial separation. Correlators of theories with an infinite
dimensional b... | hep-th cond-mat.quant-gas cond-mat.str-el math-ph math.MP | we prove a nogo theorem for the construction of a galilean boost invariant and zneq2 anisotropic scale invariant field theory with a finite dimensional basis of fields two point correlators in such theories we show grow unboundedly with spatial separation correlators of theories with an infinite dimensional basis of fi... | [['we', 'prove', 'a', 'nogo', 'theorem', 'for', 'the', 'construction', 'of', 'a', 'galilean', 'boost', 'invariant', 'and', 'zneq2', 'anisotropic', 'scale', 'invariant', 'field', 'theory', 'with', 'a', 'finite', 'dimensional', 'basis', 'of', 'fields', 'two', 'point', 'correlators', 'in', 'such', 'theories', 'we', 'show'... | [-0.1382919753785245, 0.19089433858462143, -0.1114528054042774, 0.05031591512344997, -0.06975728959317648, -0.18587773058919566, -0.03350083939114805, 0.30461570100091834, -0.21639823339646683, -0.23644820956294152, 0.08871937633341398, -0.24350441427582958, -0.16789779290419948, 0.12761612412218443, -0.047769950012512... |
1,803.03677 | Nonparametric Risk Assessment and Density Estimation for Persistence
Landscapes | This paper presents approximate confidence intervals for each function of
parameters in a Banach space based on a bootstrap algorithm. We apply kernel
density approach to estimate the persistence landscape. In addition, we
evaluate the quality distribution function estimator of random variables using
integrated mean ... | stat.ML | this paper presents approximate confidence intervals for each function of parameters in a banach space based on a bootstrap algorithm we apply kernel density approach to estimate the persistence landscape in addition we evaluate the quality distribution function estimator of random variables using integrated mean squar... | [['this', 'paper', 'presents', 'approximate', 'confidence', 'intervals', 'for', 'each', 'function', 'of', 'parameters', 'in', 'a', 'banach', 'space', 'based', 'on', 'a', 'bootstrap', 'algorithm', 'we', 'apply', 'kernel', 'density', 'approach', 'to', 'estimate', 'the', 'persistence', 'landscape', 'in', 'addition', 'we',... | [-0.05091476668782819, -0.057921183783596814, -0.13274394725718033, 0.10045792183350735, -0.01169385564012023, -0.07883525644697678, 0.11629937877856159, 0.43656478378062064, -0.196125230151945, -0.32480471139290157, 0.10634025974006643, -0.2428681385667565, -0.15753890663136888, 0.24438717289012857, -0.079073696820369... |
1,803.03678 | Early-type galaxies in the Antlia Cluster: Catalogue and isophotal
analysis | We present a statistical isophotal analysis of 138 early-type galaxies in the
Antlia cluster, located at a distance of ${\sim} 35$ Mpc. The observational
material consists of CCD images of four $36$ arcmin ${\times} 36$ arcmin fields
obtained with the MOSAIC II camera at the Blanco 4-m telescope at CTIO. Our
present ... | astro-ph.GA | we present a statistical isophotal analysis of 138 earlytype galaxies in the antlia cluster located at a distance of sim 35 mpc the observational material consists of ccd images of four 36 arcmin times 36 arcmin fields obtained with the mosaic ii camera at the blanco 4m telescope at ctio our present work supersedes pre... | [['we', 'present', 'a', 'statistical', 'isophotal', 'analysis', 'of', '138', 'earlytype', 'galaxies', 'in', 'the', 'antlia', 'cluster', 'located', 'at', 'a', 'distance', 'of', 'sim', '35', 'mpc', 'the', 'observational', 'material', 'consists', 'of', 'ccd', 'images', 'of', 'four', '36', 'arcmin', 'times', '36', 'arcmin'... | [-0.07431361904639289, 0.07522850517631241, -0.08422868754951196, 0.07110072464956829, -0.06908578323054826, -0.07494150706679648, 0.030155497997384373, 0.45211165088403504, -0.14026330592218983, -0.38489371554896934, 0.06940645447821225, -0.3355540031916462, -0.050944901860020764, 0.21904516892345782, -0.0409984168647... |
1,803.03679 | Twist Angle-Dependent Bands and Valley Inversion in 2D Materials/hBN
Heterostructures | The use of relative twist angle between adjacent atomic layers in a van der
Waals heterostructure, has emerged as a new degree of freedom to tune
electronic and optoelectronic properties of devices based on 2D materials.
Using ABA-stacked trilayer (TLG) graphene as the model system, we show that,
contrary to conventi... | cond-mat.mes-hall | the use of relative twist angle between adjacent atomic layers in a van der waals heterostructure has emerged as a new degree of freedom to tune electronic and optoelectronic properties of devices based on 2d materials using abastacked trilayer tlg graphene as the model system we show that contrary to conventional wisd... | [['the', 'use', 'of', 'relative', 'twist', 'angle', 'between', 'adjacent', 'atomic', 'layers', 'in', 'a', 'van', 'der', 'waals', 'heterostructure', 'has', 'emerged', 'as', 'a', 'new', 'degree', 'of', 'freedom', 'to', 'tune', 'electronic', 'and', 'optoelectronic', 'properties', 'of', 'devices', 'based', 'on', '2d', 'mat... | [-0.1749997854543229, 0.13203458939637075, -0.023795441764928964, -0.04340587224049324, -0.0285725207967599, -0.18919147835395328, 0.10774454949458948, 0.4405434817828901, -0.2911600335465857, -0.33571439387389657, -0.08504257914539652, -0.30047972435678466, -0.23715897745040077, 0.20833069215895553, 0.0442395627354182... |
1,803.0368 | Modulus metrics on networks | The concept of $p$-modulus gives a way to measure the richness of a family of
objects on a graph. In this paper, we investigate the families of connecting
walks between two fixed nodes and show how to use $p$-modulus to form a
parametrized family of graph metrics that generalize several well-known and
widely-used met... | math.MG | the concept of pmodulus gives a way to measure the richness of a family of objects on a graph in this paper we investigate the families of connecting walks between two fixed nodes and show how to use pmodulus to form a parametrized family of graph metrics that generalize several wellknown and widelyused metrics we also... | [['the', 'concept', 'of', 'pmodulus', 'gives', 'a', 'way', 'to', 'measure', 'the', 'richness', 'of', 'a', 'family', 'of', 'objects', 'on', 'a', 'graph', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'families', 'of', 'connecting', 'walks', 'between', 'two', 'fixed', 'nodes', 'and', 'show', 'how', 'to', 'use', 'pmo... | [-0.1742663442397888, 0.03228648534316695, -0.10133186357326052, 0.07565864442790116, -0.09277877424584619, -0.10777566036774536, 0.08572694717702362, 0.3758568223356531, -0.2329043967837698, -0.282457749160488, 0.07799606484470868, -0.3011326266457902, -0.22993889150701546, 0.2236846754143637, -0.10562174951427439, 0.... |
1,803.03681 | Geometric and LP-based heuristics for the quadratic travelling salesman
problem | A generalization of the classical TSP is the so-called quadratic travelling
salesman problem (QTSP), in which a cost coefficient is associated with the
transition in every vertex, i.e. with every pair of edges traversed in
succession. In this paper we consider two geometrically motivated special cases
of the QTSP kno... | cs.DM | a generalization of the classical tsp is the socalled quadratic travelling salesman problem qtsp in which a cost coefficient is associated with the transition in every vertex ie with every pair of edges traversed in succession in this paper we consider two geometrically motivated special cases of the qtsp known from th... | [['a', 'generalization', 'of', 'the', 'classical', 'tsp', 'is', 'the', 'socalled', 'quadratic', 'travelling', 'salesman', 'problem', 'qtsp', 'in', 'which', 'a', 'cost', 'coefficient', 'is', 'associated', 'with', 'the', 'transition', 'in', 'every', 'vertex', 'ie', 'with', 'every', 'pair', 'of', 'edges', 'traversed', 'in... | [-0.11234718535718562, 0.0413892066387577, -0.07656086949139192, 0.04237659432692453, -0.08812332431476594, -0.15020799383971473, 0.07890410346339731, 0.36701126978350956, -0.3093585855815155, -0.3076493471677675, 0.10787921996508557, -0.29234833299033497, -0.17893215571625587, 0.18440680536746856, -0.04939836332026762... |
1,803.03682 | Network Traffic Driven Storage Repair | Recently we constructed an explicit family of locally repairable and locally
regenerating codes. Their existence was proven by Kamath et al. but no explicit
construction was given. Our design is based on HashTag codes that can have
different sub-packetization levels. In this work we emphasize the importance of
having... | cs.IT cs.DC math.IT | recently we constructed an explicit family of locally repairable and locally regenerating codes their existence was proven by kamath et al but no explicit construction was given our design is based on hashtag codes that can have different subpacketization levels in this work we emphasize the importance of having two wa... | [['recently', 'we', 'constructed', 'an', 'explicit', 'family', 'of', 'locally', 'repairable', 'and', 'locally', 'regenerating', 'codes', 'their', 'existence', 'was', 'proven', 'by', 'kamath', 'et', 'al', 'but', 'no', 'explicit', 'construction', 'was', 'given', 'our', 'design', 'is', 'based', 'on', 'hashtag', 'codes', '... | [-0.21590659234950887, 0.04849765937504142, -0.02560930727082046, 0.028460408798612963, -0.032029652709348336, -0.22765244699096204, 0.10344160890801707, 0.3835253182721014, -0.27617992441648515, -0.32529979317587276, 0.10513922197828328, -0.2456395892917903, -0.14020071119981972, 0.12916500828739824, -0.10788626476197... |
1,803.03683 | Nonperturbative Renormalization Group for the Landau-de Gennes Model | We studied the nematic isotropic phase transition by applying the functional
renormalization group to the Landau-de Gennes model. We derived the flow
equations for the effective potential as well as the cubic and quartic
"couplings" and the anomalous dimension. We then solved the coupled flow
equations on a grid usin... | cond-mat.stat-mech hep-ph | we studied the nematic isotropic phase transition by applying the functional renormalization group to the landaude gennes model we derived the flow equations for the effective potential as well as the cubic and quartic couplings and the anomalous dimension we then solved the coupled flow equations on a grid using newto... | [['we', 'studied', 'the', 'nematic', 'isotropic', 'phase', 'transition', 'by', 'applying', 'the', 'functional', 'renormalization', 'group', 'to', 'the', 'landaude', 'gennes', 'model', 'we', 'derived', 'the', 'flow', 'equations', 'for', 'the', 'effective', 'potential', 'as', 'well', 'as', 'the', 'cubic', 'and', 'quartic... | [-0.14241691066905163, 0.12273246426200278, -0.06112613956725528, 0.047977914018448184, -0.0626708306642899, -0.11729375163613018, 0.031669770200942575, 0.3512081604256013, -0.27094569256485895, -0.3084783427049081, 0.06383068784177953, -0.3206830853163156, -0.17809791023149912, 0.09239853316509208, 0.060854492427478, ... |
1,803.03684 | Scoring Formulation for Multi-Condition Joint PLDA | The joint PLDA model, is a generalization of PLDA where the nuisance variable
is no longer considered independent across samples, but potentially shared
(tied) across samples that correspond to the same nuisance condition. The
original work considered a single nuisance condition, deriving the EM and
scoring formulas ... | cs.LG stat.ML | the joint plda model is a generalization of plda where the nuisance variable is no longer considered independent across samples but potentially shared tied across samples that correspond to the same nuisance condition the original work considered a single nuisance condition deriving the em and scoring formulas for this... | [['the', 'joint', 'plda', 'model', 'is', 'a', 'generalization', 'of', 'plda', 'where', 'the', 'nuisance', 'variable', 'is', 'no', 'longer', 'considered', 'independent', 'across', 'samples', 'but', 'potentially', 'shared', 'tied', 'across', 'samples', 'that', 'correspond', 'to', 'the', 'same', 'nuisance', 'condition', '... | [-0.07913290425597257, 0.05686690870829871, -0.0710310088995267, 0.12327588585690713, -0.1136606684066093, -0.21644671564318343, 0.08050364040782754, 0.3878848617634093, -0.2544629728014935, -0.33417475517366974, 0.0727585601640052, -0.20283547153984996, -0.09407456098517901, 0.17569754825590153, -0.10944544844567927, ... |
1,803.03685 | Lattice Diagrams of Knots and Diagrams of Lattice Stick Knots | We give a simple example showing that a knot or link diagram that lies in the
${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick
knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and
sufficient condition for when a knot or link diagram that lies in the
${\mathbb{Z}}^2$ l... | math.GT | we give a simple example showing that a knot or link diagram that lies in the mathbbz2 lattice is not necessarily the projection of a lattice stick knot or link in the mathbbz3 lattice and we give a necessary and sufficient condition for when a knot or link diagram that lies in the mathbbz2 lattice is in fact the proje... | [['we', 'give', 'a', 'simple', 'example', 'showing', 'that', 'a', 'knot', 'or', 'link', 'diagram', 'that', 'lies', 'in', 'the', 'mathbbz2', 'lattice', 'is', 'not', 'necessarily', 'the', 'projection', 'of', 'a', 'lattice', 'stick', 'knot', 'or', 'link', 'in', 'the', 'mathbbz3', 'lattice', 'and', 'we', 'give', 'a', 'nece... | [-0.24891270129288087, 0.15212905726659653, -0.1505878715734206, 0.04475680412377106, -0.12693804480246643, -0.21671190581270564, 0.15463099121672116, 0.42414280794449705, -0.2591502938363979, -0.18388178838945146, 0.15943749627765658, -0.2023638486306169, -0.19021891348008343, 0.0868956086072904, -0.08647936968994674,... |
1,803.03686 | Jetting Through The Primordial Universe | Collisions of heavy ion nuclei at relativistic speeds (close to the speed of
light) creates a high temperature and very dense form of matter, now known to
consist of de-confined quarks and gluons, named the quark gluon plasma (QGP).
In this thesis, Run1 experimental data from pp and heavy ion collisions at the
CERN L... | hep-ex hep-ph | collisions of heavy ion nuclei at relativistic speeds close to the speed of light creates a high temperature and very dense form of matter now known to consist of deconfined quarks and gluons named the quark gluon plasma qgp in this thesis run1 experimental data from pp and heavy ion collisions at the cern lhc is analy... | [['collisions', 'of', 'heavy', 'ion', 'nuclei', 'at', 'relativistic', 'speeds', 'close', 'to', 'the', 'speed', 'of', 'light', 'creates', 'a', 'high', 'temperature', 'and', 'very', 'dense', 'form', 'of', 'matter', 'now', 'known', 'to', 'consist', 'of', 'deconfined', 'quarks', 'and', 'gluons', 'named', 'the', 'quark', 'g... | [-0.037232625763863325, 0.1924753518645996, -0.1518778185185098, 0.14570727460713834, -0.031217615943276555, -0.10313183109355258, -0.06004143312655171, 0.38272473569926374, -0.1994516215227703, -0.3254437496495955, -0.016191823071971905, -0.35363684482674335, 0.09930301848398554, 0.15438753808188047, 0.036551728703870... |
1,803.03687 | Data Driven Stability Analysis of Black-box Switched Linear Systems | Can we conclude the stability of an unknown dynamical system from the
knowledge of a finite number of snapshots of trajectories? We tackle this
black-box problem for switched linear systems. We show that, for any given
random set of observations, one can give probabilistic stability guarantees.
The probabilistic natu... | math.OC | can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories we tackle this blackbox problem for switched linear systems we show that for any given random set of observations one can give probabilistic stability guarantees the probabilistic nature of th... | [['can', 'we', 'conclude', 'the', 'stability', 'of', 'an', 'unknown', 'dynamical', 'system', 'from', 'the', 'knowledge', 'of', 'a', 'finite', 'number', 'of', 'snapshots', 'of', 'trajectories', 'we', 'tackle', 'this', 'blackbox', 'problem', 'for', 'switched', 'linear', 'systems', 'we', 'show', 'that', 'for', 'any', 'giv... | [-0.16819596752893548, -0.0023601354235628, -0.11370815514578475, 0.06922978151333728, -0.07112541582502492, -0.10863042824276564, 0.12111105871814731, 0.3341825724587784, -0.2607109664628903, -0.3458006487370611, 0.1297311585557517, -0.21078477292699185, -0.13780905524696652, 0.21812705870986254, -0.0783774798299681, ... |
1,803.03688 | Bit-Tactical: Exploiting Ineffectual Computations in Convolutional
Neural Networks: Which, Why, and How | We show that, during inference with Convolutional Neural Networks (CNNs),
more than 2x to $8x ineffectual work can be exposed if instead of targeting
those weights and activations that are zero, we target different combinations
of value stream properties. We demonstrate a practical application with
Bit-Tactical (TCL)... | cs.NE | we show that during inference with convolutional neural networks cnns more than 2x to 8x ineffectual work can be exposed if instead of targeting those weights and activations that are zero we target different combinations of value stream properties we demonstrate a practical application with bittactical tcl a hardware ... | [['we', 'show', 'that', 'during', 'inference', 'with', 'convolutional', 'neural', 'networks', 'cnns', 'more', 'than', '2x', 'to', '8x', 'ineffectual', 'work', 'can', 'be', 'exposed', 'if', 'instead', 'of', 'targeting', 'those', 'weights', 'and', 'activations', 'that', 'are', 'zero', 'we', 'target', 'different', 'combin... | [-0.07951038718677805, 0.05330247570058128, -0.0035785166732395534, 0.007924496738291546, -0.12536041004057585, -0.20688505174500718, 0.0759714790177103, 0.4641646320540229, -0.30734025604417264, -0.3318228597147105, 0.06790908388907742, -0.2551737160656167, -0.16626303183683336, 0.18807835621327915, -0.117633537229177... |
1,803.03689 | Three colour bipartite Ramsey number of cycles and paths | The $k$-colour bipartite Ramsey number of a bipartite graph $H$ is the least
integer $n$ for which every $k$-edge-coloured complete bipartite graph
$K_{n,n}$ contains a monochromatic copy of $H$. The study of bipartite Ramsey
numbers was initiated, over 40 years ago, by Faudree and Schelp and,
independently, by Gy\'a... | math.CO | the kcolour bipartite ramsey number of a bipartite graph h is the least integer n for which every kedgecoloured complete bipartite graph k_nn contains a monochromatic copy of h the study of bipartite ramsey numbers was initiated over 40 years ago by faudree and schelp and independently by gyarfas and lehel who determin... | [['the', 'kcolour', 'bipartite', 'ramsey', 'number', 'of', 'a', 'bipartite', 'graph', 'h', 'is', 'the', 'least', 'integer', 'n', 'for', 'which', 'every', 'kedgecoloured', 'complete', 'bipartite', 'graph', 'k_nn', 'contains', 'a', 'monochromatic', 'copy', 'of', 'h', 'the', 'study', 'of', 'bipartite', 'ramsey', 'numbers'... | [-0.2158473181227843, 0.28211055013273534, -0.0337630956619978, 0.016046688097218674, -0.026807428107907375, -0.15026979765078674, 0.10600739852990955, 0.32427750224868457, -0.19794291086494922, -0.37984008848667145, 0.08074816858706375, -0.33942920962969464, -0.12086557906431457, 0.08512454474965732, -0.12693217293669... |
1,803.0369 | Results from phase 1 of the HAYSTAC microwave cavity axion experiment | We report on the results from a search for dark matter axions with the
HAYSTAC experiment using a microwave cavity detector at frequencies between
5.6-5.8$\, \rm Ghz$. We exclude axion models with two photon coupling
$g_{a\gamma\gamma}\,\gtrsim\,2\times10^{-14}\,\rm GeV^{-1}$, a factor of 2.7
above the benchmark KSVZ... | hep-ex physics.ins-det | we report on the results from a search for dark matter axions with the haystac experiment using a microwave cavity detector at frequencies between 5658 rm ghz we exclude axion models with two photon coupling g_agammagammagtrsim2times1014rm gev1 a factor of 27 above the benchmark ksvz model over the mass range 2315m_a 2... | [['we', 'report', 'on', 'the', 'results', 'from', 'a', 'search', 'for', 'dark', 'matter', 'axions', 'with', 'the', 'haystac', 'experiment', 'using', 'a', 'microwave', 'cavity', 'detector', 'at', 'frequencies', 'between', '5658', 'rm', 'ghz', 'we', 'exclude', 'axion', 'models', 'with', 'two', 'photon', 'coupling', 'g_ag... | [-0.1312838959455904, 0.14550862979516818, -0.026565560888223073, -0.013435748690325353, -0.04158088305482158, -0.118032735210188, 0.11071811920221619, 0.356470788118464, -0.16562823380033176, -0.3871630717224131, 0.05308667954091949, -0.2913028778025398, -0.004774061283441606, 0.27869071786084937, 0.03081726497039199,... |
1,803.03691 | Cascades and Dissipative Anomalies in Nearly Collisionless Plasma
Turbulence | We develop first-principles theory of kinetic plasma turbulence governed by
the Vlasov-Maxwell-Landau equations in the limit of vanishing collision rates.
Following an exact renormalization-group approach pioneered by Onsager, we
demonstrate the existence of a "collisionless range" of scales (lengths and
velocities) ... | physics.plasm-ph astro-ph.GA astro-ph.SR | we develop firstprinciples theory of kinetic plasma turbulence governed by the vlasovmaxwelllandau equations in the limit of vanishing collision rates following an exact renormalizationgroup approach pioneered by onsager we demonstrate the existence of a collisionless range of scales lengths and velocities in 1particle... | [['we', 'develop', 'firstprinciples', 'theory', 'of', 'kinetic', 'plasma', 'turbulence', 'governed', 'by', 'the', 'vlasovmaxwelllandau', 'equations', 'in', 'the', 'limit', 'of', 'vanishing', 'collision', 'rates', 'following', 'an', 'exact', 'renormalizationgroup', 'approach', 'pioneered', 'by', 'onsager', 'we', 'demons... | [-0.1505993690926495, 0.2035184730777008, -0.08359732064932889, 0.08206114586940859, -0.058679508201258126, -0.08263040342541454, 0.01832453080366344, 0.2602238741145621, -0.25482031985315995, -0.31120613628435273, 0.011216614054256054, -0.2386636916656307, -0.06861348313842575, 0.20634555345736877, -0.0138404926610027... |
1,803.03692 | On the information in spike timing: neural codes derived from
polychronous groups | There is growing evidence regarding the importance of spike timing in neural
information processing, with even a small number of spikes carrying
information, but computational models lag significantly behind those for rate
coding. Experimental evidence on neuronal behavior is consistent with the
dynamical and state d... | q-bio.NC cs.NE stat.ML | there is growing evidence regarding the importance of spike timing in neural information processing with even a small number of spikes carrying information but computational models lag significantly behind those for rate coding experimental evidence on neuronal behavior is consistent with the dynamical and state depend... | [['there', 'is', 'growing', 'evidence', 'regarding', 'the', 'importance', 'of', 'spike', 'timing', 'in', 'neural', 'information', 'processing', 'with', 'even', 'a', 'small', 'number', 'of', 'spikes', 'carrying', 'information', 'but', 'computational', 'models', 'lag', 'significantly', 'behind', 'those', 'for', 'rate', '... | [-0.12763543105937641, 0.10570268857539916, -0.06846159682324042, 0.08579252342864567, -0.06312120140713899, -0.21599648640804678, 0.07769491963269075, 0.39691425905048966, -0.2899116853720882, -0.2742866649336758, 0.11329203501001608, -0.27525775092432186, -0.20287609421711442, 0.20109003274004628, -0.0772678187927928... |
1,803.03693 | Laboratory Measurements of X-Ray Emission from Highly Charged Argon Ions | Uncertainties in atomic models will introduce noticeable additional
systematics in calculating the flux of weak dielectronic recombination (DR)
satellite lines, affecting the detection and flux measurements of other weak
spectral lines. One important example is the Ar XVII He-beta DR, which is
expected to be present ... | astro-ph.HE | uncertainties in atomic models will introduce noticeable additional systematics in calculating the flux of weak dielectronic recombination dr satellite lines affecting the detection and flux measurements of other weak spectral lines one important example is the ar xvii hebeta dr which is expected to be present in emiss... | [['uncertainties', 'in', 'atomic', 'models', 'will', 'introduce', 'noticeable', 'additional', 'systematics', 'in', 'calculating', 'the', 'flux', 'of', 'weak', 'dielectronic', 'recombination', 'dr', 'satellite', 'lines', 'affecting', 'the', 'detection', 'and', 'flux', 'measurements', 'of', 'other', 'weak', 'spectral', '... | [-0.023763356305425986, 0.11660156110534445, -0.02997843918390572, 0.10589010923460591, -0.0019775576365645975, -0.14728496253956108, 0.055361839043034704, 0.4140700013656169, -0.1526815044612158, -0.34321842503268274, 0.01066936956718564, -0.35229730579070745, 0.058675148701295254, 0.20314563218038528, 0.0336804377031... |
1,803.03694 | Set Theory-Based Safety Supervisory Control for Wind Turbines to Ensure
Adequate Frequency Response | Inadequate frequency response can arise due to a high penetration of wind
turbine generators (WTGs) and requires a frequency support function to be
integrated in the WTG. The appropriate design for these controllers to ensure
adequate response has not been investigated thoroughly. In this paper, a safety
supervisory ... | cs.SY | inadequate frequency response can arise due to a high penetration of wind turbine generators wtgs and requires a frequency support function to be integrated in the wtg the appropriate design for these controllers to ensure adequate response has not been investigated thoroughly in this paper a safety supervisory control... | [['inadequate', 'frequency', 'response', 'can', 'arise', 'due', 'to', 'a', 'high', 'penetration', 'of', 'wind', 'turbine', 'generators', 'wtgs', 'and', 'requires', 'a', 'frequency', 'support', 'function', 'to', 'be', 'integrated', 'in', 'the', 'wtg', 'the', 'appropriate', 'design', 'for', 'these', 'controllers', 'to', ... | [-0.15812404961490692, 0.03176102940730933, -0.0730768515052378, 0.028978453873453408, -0.09392161050759407, -0.15255730374843865, 0.03120948769197076, 0.3557654008089664, -0.25737657225667143, -0.3033766513601711, 0.1419494055651204, -0.19539139911929515, -0.13189876664590638, 0.2034581496006795, -0.1562104450547914, ... |
1,803.03695 | Markov chains under nonlinear expectation | In this paper, we consider continuous-time Markov chains with a finite state
space under nonlinear expectations. We define so-called Q-operators as an
extension of Q-matrices or rate matrices to a nonlinear setup, where the
nonlinearity is due to model uncertainty. The main result gives a full
characterization of con... | math.PR | in this paper we consider continuoustime markov chains with a finite state space under nonlinear expectations we define socalled qoperators as an extension of qmatrices or rate matrices to a nonlinear setup where the nonlinearity is due to model uncertainty the main result gives a full characterization of convex qopera... | [['in', 'this', 'paper', 'we', 'consider', 'continuoustime', 'markov', 'chains', 'with', 'a', 'finite', 'state', 'space', 'under', 'nonlinear', 'expectations', 'we', 'define', 'socalled', 'qoperators', 'as', 'an', 'extension', 'of', 'qmatrices', 'or', 'rate', 'matrices', 'to', 'a', 'nonlinear', 'setup', 'where', 'the',... | [-0.0996642518732335, 0.078822143241465, -0.048742148065561985, 0.06873828437371254, -0.08381763282483695, -0.10146879628804084, 0.06218939269593967, 0.34084072656224706, -0.3269503006099635, -0.19563428574002575, 0.16617820778235518, -0.25230726313374535, -0.15112133097136393, 0.1917584595865117, -0.10531034825111714,... |
1,803.03696 | Minimum $T$-Joins and Signed-Circuit Covering | Let $G$ be a graph and $T$ be a vertex subset of $G$ with even cardinality. A
$T$-join of $G$ is a subset $J$ of edges such that a vertex of $G$ is incident
with an odd number of edges in $J$ if and only if the vertex belongs to $T$.
Minimum $T$-joins have many applications in combinatorial optimizations. In
this pap... | math.CO cs.DM | let g be a graph and t be a vertex subset of g with even cardinality a tjoin of g is a subset j of edges such that a vertex of g is incident with an odd number of edges in j if and only if the vertex belongs to t minimum tjoins have many applications in combinatorial optimizations in this paper we show that a minimum t... | [['let', 'g', 'be', 'a', 'graph', 'and', 't', 'be', 'a', 'vertex', 'subset', 'of', 'g', 'with', 'even', 'cardinality', 'a', 'tjoin', 'of', 'g', 'is', 'a', 'subset', 'j', 'of', 'edges', 'such', 'that', 'a', 'vertex', 'of', 'g', 'is', 'incident', 'with', 'an', 'odd', 'number', 'of', 'edges', 'in', 'j', 'if', 'and', 'only... | [-0.18392158603226696, 0.13774019071791338, -0.038652459649300135, -0.053640097835860046, -0.1378803890026002, -0.17353573593966387, 0.022417795113977734, 0.40012832428156225, -0.26668958865985687, -0.3369207408003233, 0.08064447941206809, -0.3613306621606979, -0.143758992312683, 0.10773481555559017, -0.091525808269916... |
1,803.03697 | Community Interaction and Conflict on the Web | Users organize themselves into communities on web platforms. These
communities can interact with one another, often leading to conflicts and toxic
interactions. However, little is known about the mechanisms of interactions
between communities and how they impact users.
Here we study intercommunity interactions acro... | cs.SI cs.CL cs.HC | users organize themselves into communities on web platforms these communities can interact with one another often leading to conflicts and toxic interactions however little is known about the mechanisms of interactions between communities and how they impact users here we study intercommunity interactions across 36000 ... | [['users', 'organize', 'themselves', 'into', 'communities', 'on', 'web', 'platforms', 'these', 'communities', 'can', 'interact', 'with', 'one', 'another', 'often', 'leading', 'to', 'conflicts', 'and', 'toxic', 'interactions', 'however', 'little', 'is', 'known', 'about', 'the', 'mechanisms', 'of', 'interactions', 'betwe... | [-0.11780170960248344, 0.11795204276632931, -0.06057602593131984, 0.12340008924973922, -0.16592052497383622, -0.16781956954632835, 0.15098556811067587, 0.41030913468036384, -0.24510368262107174, -0.3771830794877476, 0.057182818947605685, -0.35670698353813757, -0.19651994448983007, 0.09687052636510796, -0.07201591832741... |
1,803.03698 | Almost prime values of the order of abelian varieties over finite fields | Let $E/\mathbb Q$ be an elliptic curve, and denote by $N(p)$ the number of
$\mathbb{F}_p$-points of the reduction modulo $p$ of $E$. A conjecture of
Koblitz, refined by Zywina, states that the number of primes $p \leq X$ at
which $N(p)$ is also prime is asymptotic to $C_E \cdot X / \log(X)^2$, where
$C_E$ is an arith... | math.NT | let emathbb q be an elliptic curve and denote by np the number of mathbbf_ppoints of the reduction modulo p of e a conjecture of koblitz refined by zywina states that the number of primes p leq x at which np is also prime is asymptotic to c_e cdot x logx2 where c_e is an arithmeticallydefined nonnegative constant follo... | [['let', 'emathbb', 'q', 'be', 'an', 'elliptic', 'curve', 'and', 'denote', 'by', 'np', 'the', 'number', 'of', 'mathbbf_ppoints', 'of', 'the', 'reduction', 'modulo', 'p', 'of', 'e', 'a', 'conjecture', 'of', 'koblitz', 'refined', 'by', 'zywina', 'states', 'that', 'the', 'number', 'of', 'primes', 'p', 'leq', 'x', 'at', 'w... | [-0.2045944626619475, 0.1143768536772272, -0.12020188727359654, 0.028156619735951113, -0.051514190693551704, -0.1576870329268841, 0.055393492248240916, 0.26440049919201003, -0.27894544680902705, -0.3054282713018245, 0.013082045966505328, -0.271163689889804, -0.07368279152874355, 0.20451618576683386, -0.1324001480966354... |
1,803.03699 | Ideal convergent subseries in Banach spaces | Assume that $\mathcal{I}$ is an ideal on $\mathbb{N}$, and $\sum_n x_n$ is a
divergent series in a Banach space $X$. We study the Baire category, and the
measure of the set $A(\mathcal{I}):=\left\{t \in \{0,1\}^{\mathbb{N}} \colon
\sum_n t(n)x_n \textrm{ is } \mathcal{I}\textrm{-convergent}\right\}$. In the
category ... | math.FA | assume that mathcali is an ideal on mathbbn and sum_n x_n is a divergent series in a banach space x we study the baire category and the measure of the set amathcalileftt in 01mathbbn colon sum_n tnx_n textrm is mathcalitextrmconvergentright in the category case we assume that mathcali has the baire property and sum_n x... | [['assume', 'that', 'mathcali', 'is', 'an', 'ideal', 'on', 'mathbbn', 'and', 'sum_n', 'x_n', 'is', 'a', 'divergent', 'series', 'in', 'a', 'banach', 'space', 'x', 'we', 'study', 'the', 'baire', 'category', 'and', 'the', 'measure', 'of', 'the', 'set', 'amathcalileftt', 'in', '01mathbbn', 'colon', 'sum_n', 'tnx_n', 'textr... | [-0.17242736378474569, 0.10878351548981163, -0.10590346360971269, 0.07754080587581388, -0.032582812949566914, -0.10310562825026481, -0.017255033883905122, 0.38980434692107646, -0.3262656003208761, -0.04910771576057475, 0.10355534519706118, -0.3469884093024565, -0.09893040461430705, 0.1927854535607551, -0.14490308446277... |
1,803.037 | Semimartingales and Shrinkage of Filtration | We consider a complete probability space $(\Omega,\mathcal{F},\mathbb{P})$,
which is endowed with two filtrations, $\mathbb{G}$ and $\mathbb{F}$, assumed
to satisfy the usual conditions and such that $\mathbb{F} \subset \mathbb{G}$.
On this probability space we consider a real valued special
$\mathbb{G}$-semimartinga... | math.PR | we consider a complete probability space omegamathcalfmathbbp which is endowed with two filtrations mathbbg and mathbbf assumed to satisfy the usual conditions and such that mathbbf subset mathbbg on this probability space we consider a real valued special mathbbgsemimartingale x the purpose of this work is to study th... | [['we', 'consider', 'a', 'complete', 'probability', 'space', 'omegamathcalfmathbbp', 'which', 'is', 'endowed', 'with', 'two', 'filtrations', 'mathbbg', 'and', 'mathbbf', 'assumed', 'to', 'satisfy', 'the', 'usual', 'conditions', 'and', 'such', 'that', 'mathbbf', 'subset', 'mathbbg', 'on', 'this', 'probability', 'space',... | [-0.17593621306157517, 0.08323556935251916, -0.0778761771552771, 0.023426019124352167, -0.05203070720088062, -0.09796148764638646, 0.019583392519847427, 0.38299789247148247, -0.31139134618824404, -0.14416030687686887, 0.10316643780504253, -0.23532716281151453, -0.12754504562997557, 0.1560002835919556, -0.14452163180227... |
1,803.03701 | Biharmonic constant mean curvature surfaces in Killing submersions | A $3$-dimensional Riemannian manifold is called Killing submersion if it
admits a Riemannian submersion over a surface such that its fibers are the
trajectories of a complete unit Killing vector field. In this paper, we give a
characterization of proper biharmonic CMC surfaces in a Killing submersion. In
the last par... | math.DG | a 3dimensional riemannian manifold is called killing submersion if it admits a riemannian submersion over a surface such that its fibers are the trajectories of a complete unit killing vector field in this paper we give a characterization of proper biharmonic cmc surfaces in a killing submersion in the last part we als... | [['a', '3dimensional', 'riemannian', 'manifold', 'is', 'called', 'killing', 'submersion', 'if', 'it', 'admits', 'a', 'riemannian', 'submersion', 'over', 'a', 'surface', 'such', 'that', 'its', 'fibers', 'are', 'the', 'trajectories', 'of', 'a', 'complete', 'unit', 'killing', 'vector', 'field', 'in', 'this', 'paper', 'we'... | [-0.25765513480892255, 0.06002606348031097, -0.06388315596869068, 0.014640559752782186, -0.21428329244788205, -0.11406133252949942, -0.07399465885597266, 0.4542363202051511, -0.2536180833620684, -0.11003869437863903, 0.10642811149499187, -0.2754741923380939, -0.20887352566101722, 0.14871546365911997, -0.199229539246372... |
1,803.03702 | Orbifold Vertex Operator Algebras and the Positivity Condition | In this note we show that the irreducible twisted modules of a holomorphic,
$C_2$-cofinite vertex operator algebra $V$ have $L_0$-weights at least as large
as the smallest $L_0$-weight of $V$. Hence, if $V$ is of CFT-type, then the
twisted $V$-modules are almost strictly positively graded. This in turn implies
that t... | math.QA math.RT | in this note we show that the irreducible twisted modules of a holomorphic c_2cofinite vertex operator algebra v have l_0weights at least as large as the smallest l_0weight of v hence if v is of cfttype then the twisted vmodules are almost strictly positively graded this in turn implies that the fixedpoint vertex opera... | [['in', 'this', 'note', 'we', 'show', 'that', 'the', 'irreducible', 'twisted', 'modules', 'of', 'a', 'holomorphic', 'c_2cofinite', 'vertex', 'operator', 'algebra', 'v', 'have', 'l_0weights', 'at', 'least', 'as', 'large', 'as', 'the', 'smallest', 'l_0weight', 'of', 'v', 'hence', 'if', 'v', 'is', 'of', 'cfttype', 'then',... | [-0.19592012347246723, 0.1287555417619288, -0.05569307816792922, 0.014326650808543909, -0.0919008546712241, -0.1821106825205872, -0.007924723149887446, 0.37912286773869963, -0.3400035032295975, -0.1737631655394517, 0.10429569821130356, -0.2812766365348308, -0.14662495463813557, 0.14515413976563463, -0.1021999241034875,... |
1,803.03703 | Gravitational Coupling and the Cosmological Constant | We deal with a dynamical mechanism in which a large cosmological constant, as
suggested by inflationary scenarios, decays due to expansion of the universe.
This mechanism has its origin in the gravitational coupling of the vacuum
density. We assume that the vacuum couples anomalously to gravity that is the
metric ten... | gr-qc | we deal with a dynamical mechanism in which a large cosmological constant as suggested by inflationary scenarios decays due to expansion of the universe this mechanism has its origin in the gravitational coupling of the vacuum density we assume that the vacuum couples anomalously to gravity that is the metric tensor th... | [['we', 'deal', 'with', 'a', 'dynamical', 'mechanism', 'in', 'which', 'a', 'large', 'cosmological', 'constant', 'as', 'suggested', 'by', 'inflationary', 'scenarios', 'decays', 'due', 'to', 'expansion', 'of', 'the', 'universe', 'this', 'mechanism', 'has', 'its', 'origin', 'in', 'the', 'gravitational', 'coupling', 'of', ... | [-0.16743974902009198, 0.16411372077215566, -0.12582262156001472, 0.108479573288847, -0.11767773747170737, -0.08540800634831396, -0.03889384411527442, 0.3028959025278551, -0.2591634437467459, -0.25446845749991204, 0.08696396364146895, -0.22864332776345792, -0.16571177518285743, 0.1288101226134106, -0.007226616430412465... |
1,803.03704 | Edge-decomposing graphs into coprime forests | The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof
of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.],
asserts that for every tree T, there is a constant $c_T$ such that every
$c_T$-edge connected graph G with number of edges (size) divisible by the size
of T admi... | math.CO cs.DM | the baratthomassen conjecture recently proved in bensmail et al a proof of the baratthomassen conjecture j combin theory ser b 1243955 2017 asserts that for every tree t there is a constant c_t such that every c_tedge connected graph g with number of edges size divisible by the size of t admits an edge partition into c... | [['the', 'baratthomassen', 'conjecture', 'recently', 'proved', 'in', 'bensmail', 'et', 'al', 'a', 'proof', 'of', 'the', 'baratthomassen', 'conjecture', 'j', 'combin', 'theory', 'ser', 'b', '1243955', '2017', 'asserts', 'that', 'for', 'every', 'tree', 't', 'there', 'is', 'a', 'constant', 'c_t', 'such', 'that', 'every', ... | [-0.20007208146830724, 0.16434034181712104, -0.06024570950100394, -0.04617436736521351, -0.05958222592854691, -0.15439843244357795, 0.05757719787346844, 0.32252153386416255, -0.2536804020904903, -0.30617421681373036, 0.027734941929299747, -0.27797898502860957, -0.15687883286718787, 0.11897988415754433, -0.1164821228347... |
1,803.03705 | Geodesic Obstacle Representation of Graphs | An obstacle representation of a graph is a mapping of the vertices onto
points in the plane and a set of connected regions of the plane (called
obstacles) such that the straight-line segment connecting the points
corresponding to two vertices does not intersect any obstacles if and only if
the vertices are adjacent i... | cs.CG | an obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane called obstacles such that the straightline segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the... | [['an', 'obstacle', 'representation', 'of', 'a', 'graph', 'is', 'a', 'mapping', 'of', 'the', 'vertices', 'onto', 'points', 'in', 'the', 'plane', 'and', 'a', 'set', 'of', 'connected', 'regions', 'of', 'the', 'plane', 'called', 'obstacles', 'such', 'that', 'the', 'straightline', 'segment', 'connecting', 'the', 'points', ... | [-0.14992853769652004, 0.08120861654948494, -0.05622356461618207, 0.030195205325153032, -0.1176725391527888, -0.053065961181644854, 0.046537941413385964, 0.4025932752723639, -0.32723994768891873, -0.28048438858240843, 0.09867711071013612, -0.3439590885206612, -0.16271037868321386, 0.12043401488205488, -0.11046068767544... |
1,803.03706 | Electrode configuration and electrical dissipation of mechanical energy
in quartz crystal resonators | Mechanical resonators made with monolithic piezoelectric quartz crystals are
promising for studying new physical phenomena. High mechanical quality factors
($Q$) exhibited by the mm-sized quartz resonators make them ideal for studying
weak couplings or long timescales in the quantum regime. However, energy losses
thr... | physics.app-ph cond-mat.mes-hall | mechanical resonators made with monolithic piezoelectric quartz crystals are promising for studying new physical phenomena high mechanical quality factors q exhibited by the mmsized quartz resonators make them ideal for studying weak couplings or long timescales in the quantum regime however energy losses through mecha... | [['mechanical', 'resonators', 'made', 'with', 'monolithic', 'piezoelectric', 'quartz', 'crystals', 'are', 'promising', 'for', 'studying', 'new', 'physical', 'phenomena', 'high', 'mechanical', 'quality', 'factors', 'q', 'exhibited', 'by', 'the', 'mmsized', 'quartz', 'resonators', 'make', 'them', 'ideal', 'for', 'studyin... | [-0.15508761359557122, 0.152112293802582, 0.0010633349334399904, -0.015809840252728264, -0.05523538366708923, -0.14440861713122483, 0.07444934306160814, 0.4200179853556144, -0.23640627001444972, -0.3196349239688198, 0.050036950948315874, -0.24078903889199296, -0.11255982274835433, 0.25204844961537226, -0.07585729404829... |
1,803.03707 | Quasi-Equilibrium Problems with Non-self Constraint Map | In 2016 Aussel, Sultana and Vetrivel developed the concept of projected
solution for quasi-variational inequality problems and projected Nash
equilibrium. We introduce a new concept of solution for quasi-equilibrium
problems and we study the existence of such solutions. Additionally, as a
consequence of our results, ... | math.OC | in 2016 aussel sultana and vetrivel developed the concept of projected solution for quasivariational inequality problems and projected nash equilibrium we introduce a new concept of solution for quasiequilibrium problems and we study the existence of such solutions additionally as a consequence of our results we give e... | [['in', '2016', 'aussel', 'sultana', 'and', 'vetrivel', 'developed', 'the', 'concept', 'of', 'projected', 'solution', 'for', 'quasivariational', 'inequality', 'problems', 'and', 'projected', 'nash', 'equilibrium', 'we', 'introduce', 'a', 'new', 'concept', 'of', 'solution', 'for', 'quasiequilibrium', 'problems', 'and', ... | [-0.10441770707257092, -0.05637624128721654, -0.12679901206865907, 0.10505316344400246, -0.04512504246085882, -0.1480731516610831, 0.06161915850243531, 0.25304934810847046, -0.3206684383874138, -0.2851499600956837, 0.18096206444121588, -0.270893138848866, -0.18315866276000936, 0.1810652663310369, -0.063345854007639, 0.... |
1,803.03708 | Computational Complexity of Generalized Push Fight | We analyze the computational complexity of optimally playing the two-player
board game Push Fight, generalized to an arbitrary board and number of pieces.
We prove that the game is PSPACE-hard to decide who will win from a given
position, even for simple (almost rectangular) hole-free boards. We also
analyze the mate... | cs.CC | we analyze the computational complexity of optimally playing the twoplayer board game push fight generalized to an arbitrary board and number of pieces we prove that the game is pspacehard to decide who will win from a given position even for simple almost rectangular holefree boards we also analyze the matein1 problem... | [['we', 'analyze', 'the', 'computational', 'complexity', 'of', 'optimally', 'playing', 'the', 'twoplayer', 'board', 'game', 'push', 'fight', 'generalized', 'to', 'an', 'arbitrary', 'board', 'and', 'number', 'of', 'pieces', 'we', 'prove', 'that', 'the', 'game', 'is', 'pspacehard', 'to', 'decide', 'who', 'will', 'win', '... | [-0.13138292894733172, 0.14384301485314843, -0.06721928893347029, 0.050163287001972395, -0.11114531118008826, -0.23070162450204845, 0.1131625867759188, 0.3422174642207446, -0.31018731603571387, -0.3278927886233389, 0.11075701485991615, -0.2856449790779691, -0.09028977556326599, 0.17952787097095063, -0.11579233059935548... |
1,803.03709 | Nonadiabatic corrections to electric current in molecular junction due
to nuclear motion at the molecule-electrode interfaces | We present quantum electron transport theory that incorporates dynamical
effects of motion of atoms on electrode-molecule interfaces in the calculations
of the electric current. The theory is based on non-equilibrium Green's
functions. We separate time scales in the Green's functions on fast relative
time and slow ce... | cond-mat.mes-hall physics.chem-ph | we present quantum electron transport theory that incorporates dynamical effects of motion of atoms on electrodemolecule interfaces in the calculations of the electric current the theory is based on nonequilibrium greens functions we separate time scales in the greens functions on fast relative time and slow central ti... | [['we', 'present', 'quantum', 'electron', 'transport', 'theory', 'that', 'incorporates', 'dynamical', 'effects', 'of', 'motion', 'of', 'atoms', 'on', 'electrodemolecule', 'interfaces', 'in', 'the', 'calculations', 'of', 'the', 'electric', 'current', 'the', 'theory', 'is', 'based', 'on', 'nonequilibrium', 'greens', 'fun... | [-0.146109952028546, 0.10345313131722132, -0.09226753505318687, 0.052614191303317764, -0.004080920690618683, -0.05169447415035969, 0.0340851167545205, 0.3630539481092593, -0.2699516082195927, -0.25451950739697293, 0.02907210749677858, -0.2560450684299304, -0.10415689884383472, 0.1725640785679382, 0.04354606129450174, 0... |
1,803.0371 | Label-free imaging of cholesterol and lipid distributions in model
membranes | Over recent decades, lipid membranes have become standard models for
examining the biophysics and biochemistry of cell membranes. Interrogation of
lipid domains within biomembranes is generally done with fluorescence
microscopy via exogenous chemical probes. However, most fluorophores have
limited partitioning tunabi... | physics.bio-ph cond-mat.soft | over recent decades lipid membranes have become standard models for examining the biophysics and biochemistry of cell membranes interrogation of lipid domains within biomembranes is generally done with fluorescence microscopy via exogenous chemical probes however most fluorophores have limited partitioning tunability w... | [['over', 'recent', 'decades', 'lipid', 'membranes', 'have', 'become', 'standard', 'models', 'for', 'examining', 'the', 'biophysics', 'and', 'biochemistry', 'of', 'cell', 'membranes', 'interrogation', 'of', 'lipid', 'domains', 'within', 'biomembranes', 'is', 'generally', 'done', 'with', 'fluorescence', 'microscopy', 'v... | [-0.06617121997864005, 0.1556211185736742, -0.0008273435763169265, -0.035985346369986945, 0.02145154816626921, -0.15111127183673548, 0.04582994765228863, 0.4320227563486877, -0.22809365242868265, -0.27007561510574096, 0.029869735860992355, -0.2829586553424704, -0.18414675540964495, 0.15314569420607246, -0.0322735762382... |
1,803.03711 | Local Kernels that Approximate Bayesian Regularization and Proximal
Operators | In this work, we broadly connect kernel-based filtering (e.g. approaches such
as the bilateral filters and nonlocal means, but also many more) with general
variational formulations of Bayesian regularized least squares, and the related
concept of proximal operators. The latter set of variational/Bayesian/proximal
for... | cs.CV | in this work we broadly connect kernelbased filtering eg approaches such as the bilateral filters and nonlocal means but also many more with general variational formulations of bayesian regularized least squares and the related concept of proximal operators the latter set of variationalbayesianproximal formulations oft... | [['in', 'this', 'work', 'we', 'broadly', 'connect', 'kernelbased', 'filtering', 'eg', 'approaches', 'such', 'as', 'the', 'bilateral', 'filters', 'and', 'nonlocal', 'means', 'but', 'also', 'many', 'more', 'with', 'general', 'variational', 'formulations', 'of', 'bayesian', 'regularized', 'least', 'squares', 'and', 'the',... | [-0.028720232267391333, -0.019353226467854145, -0.10548395568674261, 0.08786791030275212, -0.12708098622688063, -0.17179077353882322, 0.02385294380964655, 0.4108518024737185, -0.32989576984563784, -0.29571139890361914, 0.16493424707670892, -0.22547307447671439, -0.21188275784705624, 0.2024629004885245, -0.0884183629867... |
1,803.03712 | Response to the authors of 'On the (un)effectiveness of Proton Boron
Capture in Proton Therapy' | This manuscript provides a response to a recent report by Mazzone et al.
available online on arXiv that, in turn, tentatively aims at demonstrating the
inefficacy of proton boron capture in hadrotherapy. We clarify that Mazzone et
al. do not add any scientific or technical insights to the points extensively
discussed... | physics.med-ph | this manuscript provides a response to a recent report by mazzone et al available online on arxiv that in turn tentatively aims at demonstrating the inefficacy of proton boron capture in hadrotherapy we clarify that mazzone et al do not add any scientific or technical insights to the points extensively discussed in the... | [['this', 'manuscript', 'provides', 'a', 'response', 'to', 'a', 'recent', 'report', 'by', 'mazzone', 'et', 'al', 'available', 'online', 'on', 'arxiv', 'that', 'in', 'turn', 'tentatively', 'aims', 'at', 'demonstrating', 'the', 'inefficacy', 'of', 'proton', 'boron', 'capture', 'in', 'hadrotherapy', 'we', 'clarify', 'that... | [-0.03500023244824863, 0.05815954135878266, -0.07632779599361711, -0.035786258011049545, -0.11297018453478813, -0.05043165666690237, 0.0894047908372708, 0.3401594650563147, -0.16580463108680338, -0.38861855087306, 0.037815995481729564, -0.2737338875685048, -0.21771626653679038, 0.18452311626873347, -0.18628676293967225... |
1,803.03713 | Current fluctuations in quantum absorption refrigerators | Absorption refrigerators transfer thermal energy from a cold bath to a hot
bath without input power by utilizing heat from an additional "work" reservoir.
Particularly interesting is a three-level design for a quantum absorption
refrigerator, which can be optimized to reach the maximal (Carnot) cooling
efficiency. Pr... | cond-mat.mes-hall cond-mat.stat-mech | absorption refrigerators transfer thermal energy from a cold bath to a hot bath without input power by utilizing heat from an additional work reservoir particularly interesting is a threelevel design for a quantum absorption refrigerator which can be optimized to reach the maximal carnot cooling efficiency previous stu... | [['absorption', 'refrigerators', 'transfer', 'thermal', 'energy', 'from', 'a', 'cold', 'bath', 'to', 'a', 'hot', 'bath', 'without', 'input', 'power', 'by', 'utilizing', 'heat', 'from', 'an', 'additional', 'work', 'reservoir', 'particularly', 'interesting', 'is', 'a', 'threelevel', 'design', 'for', 'a', 'quantum', 'abso... | [-0.07872089092797112, 0.12120601584983207, -0.06389641709511681, 0.040290081060212736, -0.03827970374223529, -0.1485073206420405, 0.10331610987298698, 0.3558227145904992, -0.243773127375424, -0.29886656028351616, 0.057808418696442126, -0.30007867166316327, -0.03885696081406608, 0.2746975116057917, 0.01298288426672419,... |
1,803.03714 | Accelerated Wirtinger Flow for Multiplexed Fourier Ptychographic
Microscopy | Fourier ptychographic microscopy enables gigapixel-scale imaging, with both
large field-of-view and high resolution. Using a set of low-resolution images
that are recorded under varying illumination angles, the goal is to
computationally reconstruct high-resolution phase and amplitude images. To
increase temporal res... | eess.SP math.OC | fourier ptychographic microscopy enables gigapixelscale imaging with both large fieldofview and high resolution using a set of lowresolution images that are recorded under varying illumination angles the goal is to computationally reconstruct highresolution phase and amplitude images to increase temporal resolution one... | [['fourier', 'ptychographic', 'microscopy', 'enables', 'gigapixelscale', 'imaging', 'with', 'both', 'large', 'fieldofview', 'and', 'high', 'resolution', 'using', 'a', 'set', 'of', 'lowresolution', 'images', 'that', 'are', 'recorded', 'under', 'varying', 'illumination', 'angles', 'the', 'goal', 'is', 'to', 'computationa... | [-0.06509377920247664, 0.03850965854657478, -0.10254156100409513, -0.00910416383385683, -0.07414942425336467, -0.12757460452270825, 0.03261691492840352, 0.4648340684639302, -0.29441996725485814, -0.3119085295687103, 0.10204663036610093, -0.2514700936523593, -0.1506683733329695, 0.20641179593119596, -0.12270811956147633... |
1,803.03715 | The dynamics of the angular and radial density correlation scaling
exponents in fractal to non-fractal morphodynamics | Fractal/non-fractal morphological transitions allow for the systematic study
of the physics behind fractal morphogenesis in nature. In these systems, the
fractal dimension is considered a non-thermal order parameter, commonly and
equivalently computed from the scaling of the two-point radial- or
angular-density corre... | nlin.PS cond-mat.soft | fractalnonfractal morphological transitions allow for the systematic study of the physics behind fractal morphogenesis in nature in these systems the fractal dimension is considered a nonthermal order parameter commonly and equivalently computed from the scaling of the twopoint radial or angulardensity correlations how... | [['fractalnonfractal', 'morphological', 'transitions', 'allow', 'for', 'the', 'systematic', 'study', 'of', 'the', 'physics', 'behind', 'fractal', 'morphogenesis', 'in', 'nature', 'in', 'these', 'systems', 'the', 'fractal', 'dimension', 'is', 'considered', 'a', 'nonthermal', 'order', 'parameter', 'commonly', 'and', 'equ... | [-0.10439063096733613, 0.15682647039343342, -0.10288079696348743, 0.11300440010696498, -0.01354335663947151, -0.0970741765120545, 0.011098000683469346, 0.303009332494332, -0.26816460217751964, -0.2729063751238927, 0.08649321054533199, -0.25502040722042424, -0.17157773738034773, 0.18518623462846703, 0.004195161116611515... |
1,803.03716 | TRAJEDI: Trajectory Dissimilarity | The vast increase in our ability to obtain and store trajectory data
necessitates trajectory analytics techniques to extract useful information from
this data. Pair-wise distance functions are a foundation building block for
common operations on trajectory datasets including constrained SELECT queries,
k-nearest neig... | cs.DB | the vast increase in our ability to obtain and store trajectory data necessitates trajectory analytics techniques to extract useful information from this data pairwise distance functions are a foundation building block for common operations on trajectory datasets including constrained select queries knearest neighbors ... | [['the', 'vast', 'increase', 'in', 'our', 'ability', 'to', 'obtain', 'and', 'store', 'trajectory', 'data', 'necessitates', 'trajectory', 'analytics', 'techniques', 'to', 'extract', 'useful', 'information', 'from', 'this', 'data', 'pairwise', 'distance', 'functions', 'are', 'a', 'foundation', 'building', 'block', 'for',... | [-0.07898700642122324, -0.020125450640112806, -0.07664629125719716, 0.06627206511547615, -0.12406128181459503, -0.18263853599967286, 0.14124320876087806, 0.4397163485284064, -0.26354279376486006, -0.3780091568532822, 0.10516834502751611, -0.307543239517727, -0.10429986501983601, 0.2198909005156899, -0.08015625470941015... |
1,803.03717 | Low-Rank Solution Methods for Stochastic Eigenvalue Problems | We study efficient solution methods for stochastic eigenvalue problems
arising from discretization of self-adjoint partial differential equations with
random data. With the stochastic Galerkin approach, the solutions are
represented as generalized polynomial chaos expansions. A low-rank variant of
the inverse subspac... | math.NA | we study efficient solution methods for stochastic eigenvalue problems arising from discretization of selfadjoint partial differential equations with random data with the stochastic galerkin approach the solutions are represented as generalized polynomial chaos expansions a lowrank variant of the inverse subspace itera... | [['we', 'study', 'efficient', 'solution', 'methods', 'for', 'stochastic', 'eigenvalue', 'problems', 'arising', 'from', 'discretization', 'of', 'selfadjoint', 'partial', 'differential', 'equations', 'with', 'random', 'data', 'with', 'the', 'stochastic', 'galerkin', 'approach', 'the', 'solutions', 'are', 'represented', '... | [-0.08445490203824238, -0.004288225269489195, -0.06449100003802342, 0.09383253586818695, -0.08152935652273662, -0.17824674194599402, -0.007875142176470435, 0.35572875141172755, -0.36076094564182537, -0.2713810008395701, 0.16807578017865804, -0.2889972477292655, -0.18185933306152727, 0.1887283823007044, -0.0457915320351... |
1,803.03718 | Simultaneous Broadband Vector Magnetometry Using Solid-State Spins | We demonstrate a vector magnetometer that simultaneously measures all
Cartesian components of a dynamic magnetic field using an ensemble of
nitrogen-vacancy (NV) centers in a single-crystal diamond. Optical NV-diamond
measurements provide high-sensitivity, broadband magnetometry under ambient or
extreme physical cond... | quant-ph cond-mat.mes-hall physics.app-ph physics.ins-det | we demonstrate a vector magnetometer that simultaneously measures all cartesian components of a dynamic magnetic field using an ensemble of nitrogenvacancy nv centers in a singlecrystal diamond optical nvdiamond measurements provide highsensitivity broadband magnetometry under ambient or extreme physical conditions and... | [['we', 'demonstrate', 'a', 'vector', 'magnetometer', 'that', 'simultaneously', 'measures', 'all', 'cartesian', 'components', 'of', 'a', 'dynamic', 'magnetic', 'field', 'using', 'an', 'ensemble', 'of', 'nitrogenvacancy', 'nv', 'centers', 'in', 'a', 'singlecrystal', 'diamond', 'optical', 'nvdiamond', 'measurements', 'pr... | [-0.15449892851431501, 0.16152415035651513, 0.019745261743896125, -0.08600810854854814, -0.04549527629018293, -0.16415847677980427, 0.052341746558255936, 0.5002851454043611, -0.25980250107309555, -0.30322593958435223, 0.07787689077378661, -0.2750114712817884, -0.036500953440120595, 0.22595839448828506, -0.0035772427543... |
1,803.03719 | DeepMoTIon: Learning to Navigate Like Humans | We present a novel human-aware navigation approach, where the robot learns to
mimic humans to navigate safely in crowds. The presented model, referred to as
DeepMoTIon, is trained with pedestrian surveillance data to predict human
velocity in the environment. The robot processes LiDAR scans via the trained
network to... | cs.RO cs.AI cs.LG stat.ML | we present a novel humanaware navigation approach where the robot learns to mimic humans to navigate safely in crowds the presented model referred to as deepmotion is trained with pedestrian surveillance data to predict human velocity in the environment the robot processes lidar scans via the trained network to navigat... | [['we', 'present', 'a', 'novel', 'humanaware', 'navigation', 'approach', 'where', 'the', 'robot', 'learns', 'to', 'mimic', 'humans', 'to', 'navigate', 'safely', 'in', 'crowds', 'the', 'presented', 'model', 'referred', 'to', 'as', 'deepmotion', 'is', 'trained', 'with', 'pedestrian', 'surveillance', 'data', 'to', 'predic... | [-0.03262588318723899, 0.014113856226993867, -0.06587180765345693, 0.04302811317913718, -0.10034322543069721, -0.14985822468566207, 0.07072952864512515, 0.44570641447431764, -0.23535258948373106, -0.37197708061967905, 0.04440051372557019, -0.2924146710465161, -0.16951554733543442, 0.19099600233782368, -0.14417419686259... |
1,803.0372 | Reduced modeling of porous media convection in a minimal flow unit at
large Rayleigh number | Direct numerical simulations (DNS) indicate that at large values of the
Rayleigh number ($Ra$) convection in porous media self-organizes into
narrowly-spaced columnar flows, with more complex spatiotemporal features being
confined to boundary layers near the top and bottom walls. In this
investigation of high-$Ra$ po... | physics.flu-dyn | direct numerical simulations dns indicate that at large values of the rayleigh number ra convection in porous media selforganizes into narrowlyspaced columnar flows with more complex spatiotemporal features being confined to boundary layers near the top and bottom walls in this investigation of highra porous media conv... | [['direct', 'numerical', 'simulations', 'dns', 'indicate', 'that', 'at', 'large', 'values', 'of', 'the', 'rayleigh', 'number', 'ra', 'convection', 'in', 'porous', 'media', 'selforganizes', 'into', 'narrowlyspaced', 'columnar', 'flows', 'with', 'more', 'complex', 'spatiotemporal', 'features', 'being', 'confined', 'to', ... | [-0.1336620965649798, 0.13669679628840573, -0.06957028476886709, 0.0005497420071794583, -0.056657815466604644, -0.084335236958388, 0.04028525839822852, 0.344055224472195, -0.2921584920590456, -0.3024090322612868, 0.10056007831694361, -0.25532332958527687, -0.1165264822330659, 0.17172849670476545, -0.030359631066510597,... |
1,803.03721 | Multiscale Methods for Model Order Reduction of Non Linear Multiphase
Flow Problems | Numerical simulations for flow and transport in subsurface porous media often
prove computationally prohibitive due to property data availability at multiple
spatial scales that can vary by orders of magnitude. A number of model order
reduction approaches are available in the existing literature that alleviate
this i... | math.NA | numerical simulations for flow and transport in subsurface porous media often prove computationally prohibitive due to property data availability at multiple spatial scales that can vary by orders of magnitude a number of model order reduction approaches are available in the existing literature that alleviate this issu... | [['numerical', 'simulations', 'for', 'flow', 'and', 'transport', 'in', 'subsurface', 'porous', 'media', 'often', 'prove', 'computationally', 'prohibitive', 'due', 'to', 'property', 'data', 'availability', 'at', 'multiple', 'spatial', 'scales', 'that', 'can', 'vary', 'by', 'orders', 'of', 'magnitude', 'a', 'number', 'of... | [-0.05659239998347264, 0.022543999492926858, -0.08500397943102257, 0.07298588728915374, -0.06320766485379717, -0.11827682265374943, -0.010999397876893793, 0.38751331765221375, -0.3111509500831499, -0.33758521240388334, 0.13827696724506638, -0.2591323449011843, -0.11358740275559713, 0.20697650701776482, -0.0400999891070... |
1,803.03722 | Random Partitions and Cohen-Lenstra Heuristics | We investigate combinatorial properties of a family of probability
distributions on finite abelian p-groups. This family includes several
well-known distributions as specializations. These specializations have been
studied in the context of Cohen-Lenstra heuristics and cokernels of families of
random p-adic matrices.... | math.NT math.CO math.PR | we investigate combinatorial properties of a family of probability distributions on finite abelian pgroups this family includes several wellknown distributions as specializations these specializations have been studied in the context of cohenlenstra heuristics and cokernels of families of random padic matrices | [['we', 'investigate', 'combinatorial', 'properties', 'of', 'a', 'family', 'of', 'probability', 'distributions', 'on', 'finite', 'abelian', 'pgroups', 'this', 'family', 'includes', 'several', 'wellknown', 'distributions', 'as', 'specializations', 'these', 'specializations', 'have', 'been', 'studied', 'in', 'the', 'cont... | [-0.1563476538257219, 0.09397373191739727, -0.12156971873397507, 0.1418192672923707, -0.09302148808975046, -0.0780638168202486, -0.018888912140959647, 0.3833307338106196, -0.3015382462521879, -0.2723695675660742, 0.04786106591714864, -0.23900867757819047, -0.14405341046612438, 0.21673569589762426, -0.13105957793844183,... |
1,803.03723 | Design, construction, and characterization of a compact DD neutron
generator designed for 40Ar/39Ar geochronology | A next-generation, high-flux DD neutron generator has been designed,
commissioned, and characterized, and is now operational in a new facility at
the University of California Berkeley. The generator, originally designed for
40Ar/39Ar dating of geological materials, has since served numerous additional
applications, i... | physics.acc-ph | a nextgeneration highflux dd neutron generator has been designed commissioned and characterized and is now operational in a new facility at the university of california berkeley the generator originally designed for 40ar39ar dating of geological materials has since served numerous additional applications including medi... | [['a', 'nextgeneration', 'highflux', 'dd', 'neutron', 'generator', 'has', 'been', 'designed', 'commissioned', 'and', 'characterized', 'and', 'is', 'now', 'operational', 'in', 'a', 'new', 'facility', 'at', 'the', 'university', 'of', 'california', 'berkeley', 'the', 'generator', 'originally', 'designed', 'for', '40ar39ar... | [-0.05138967528952943, 0.13851806279702472, -0.03893244445821211, 0.039512879026598585, -0.0318675188893427, -0.10038023217627567, 0.04737105455810027, 0.38603443018586386, -0.18566358736105162, -0.3872677730912621, 0.10171819359329592, -0.3236114307732334, 0.008636286054480804, 0.25736398095469415, -0.0181242955787469... |
1,803.03724 | Contour Parametrization via Anisotropic Mean Curvature Flows | We present a new implementation of anisotropic mean curvature flow for
contour recognition. Our procedure couples the mean curvature flow of planar
closed smooth curves, with an external field from a potential of point-wise
charges. This coupling constrains the motion when the curve matches a picture
placed as backgr... | math.DG cs.CG cs.CV math.AP math.NA | we present a new implementation of anisotropic mean curvature flow for contour recognition our procedure couples the mean curvature flow of planar closed smooth curves with an external field from a potential of pointwise charges this coupling constrains the motion when the curve matches a picture placed as background w... | [['we', 'present', 'a', 'new', 'implementation', 'of', 'anisotropic', 'mean', 'curvature', 'flow', 'for', 'contour', 'recognition', 'our', 'procedure', 'couples', 'the', 'mean', 'curvature', 'flow', 'of', 'planar', 'closed', 'smooth', 'curves', 'with', 'an', 'external', 'field', 'from', 'a', 'potential', 'of', 'pointwi... | [-0.1718620180056013, 0.0604523499759721, -0.12796703016321206, 0.028439266179640103, -0.08708749355041775, -0.11291245285196808, 0.00589080242809422, 0.3823407117020467, -0.23683693247108623, -0.2620416818315099, 0.0653526626671825, -0.2505980462542382, -0.1451903924843746, 0.22965864612367645, -0.0877618935794152, 0.... |
1,803.03725 | Dynamically Efficient Kinematics for Hyper-Redundant Manipulators | A hyper-redundant robotic arm is a manipulator with many degrees of freedom,
capable of executing tasks in cluttered environments where robotic arms with
fewer degrees of freedom are unable to operate. This paper introduces a new
method for modeling those manipulators in a completely dynamic way. The
proposed method ... | cs.RO | a hyperredundant robotic arm is a manipulator with many degrees of freedom capable of executing tasks in cluttered environments where robotic arms with fewer degrees of freedom are unable to operate this paper introduces a new method for modeling those manipulators in a completely dynamic way the proposed method enable... | [['a', 'hyperredundant', 'robotic', 'arm', 'is', 'a', 'manipulator', 'with', 'many', 'degrees', 'of', 'freedom', 'capable', 'of', 'executing', 'tasks', 'in', 'cluttered', 'environments', 'where', 'robotic', 'arms', 'with', 'fewer', 'degrees', 'of', 'freedom', 'are', 'unable', 'to', 'operate', 'this', 'paper', 'introduc... | [-0.11857297659568888, 0.039872049457127495, -0.09178325060555445, 0.003347260524086388, -0.1432731373734506, -0.13429203671735845, 0.014104050257343001, 0.4009220885179405, -0.26545265280375524, -0.35972034156854665, 0.0704855731297617, -0.1875050699255163, -0.1998533968081964, 0.2219401107302734, -0.10944503862410784... |
1,803.03726 | A new route to finding bounds on the generalized spectrum of many
physical operators | Here we obtain bounds on the spectrum of that operator whose inverse, when it
exists, gives the Green's function. We consider the wide of physical problems
that can be cast in a form where a constitutive equation ${\bf J}({\bf x})={\bf
L}({\bf x}){\bf E}({\bf x})-{\bf h}({\bf x})$ with a source term ${\bf h}({\bf
x})... | math-ph math.MP | here we obtain bounds on the spectrum of that operator whose inverse when it exists gives the greens function we consider the wide of physical problems that can be cast in a form where a constitutive equation bf jbf xbf lbf xbf ebf xbf hbf x with a source term bf hbf x holds for all bf x in some domain omega and relate... | [['here', 'we', 'obtain', 'bounds', 'on', 'the', 'spectrum', 'of', 'that', 'operator', 'whose', 'inverse', 'when', 'it', 'exists', 'gives', 'the', 'greens', 'function', 'we', 'consider', 'the', 'wide', 'of', 'physical', 'problems', 'that', 'can', 'be', 'cast', 'in', 'a', 'form', 'where', 'a', 'constitutive', 'equation'... | [-0.19318471263373657, 0.10633467370863864, -0.055547431708787974, 0.000989356784387228, -0.09733745525041947, -0.12488591122959372, 0.02755829079772943, 0.35274765020201226, -0.2616774670621556, -0.20770579996685726, 0.08793459821054228, -0.20247813028858355, -0.12999615509761497, 0.19047017249373174, -0.0455561424149... |
1,803.03727 | Thermal Management in Fine-Grained 3-D Integrated Circuits | For beyond 2-D CMOS logic, various 3-D integration approaches specially
transistor based 3-D integrations such as monolithic 3-D [1], Skybridge [2],
SN3D [3] holds most promise. However, such 3D architectures within small form
factor increase hotspots and demand careful consideration of thermal management
at all leve... | cs.ET | for beyond 2d cmos logic various 3d integration approaches specially transistor based 3d integrations such as monolithic 3d 1 skybridge 2 sn3d 3 holds most promise however such 3d architectures within small form factor increase hotspots and demand careful consideration of thermal management at all levels of integration... | [['for', 'beyond', '2d', 'cmos', 'logic', 'various', '3d', 'integration', 'approaches', 'specially', 'transistor', 'based', '3d', 'integrations', 'such', 'as', 'monolithic', '3d', '1', 'skybridge', '2', 'sn3d', '3', 'holds', 'most', 'promise', 'however', 'such', '3d', 'architectures', 'within', 'small', 'form', 'factor... | [-0.09183057742997977, 0.06207173985175734, 0.009158764800625196, -0.0028825303820400115, -0.05983000047854148, -0.18101275851265253, 0.06456598475351176, 0.4054331865079482, -0.24619014890092383, -0.341917398482431, 0.09103090246122413, -0.3126669844153131, -0.12384951650678619, 0.26221357927031075, -0.016828496912721... |
1,803.03728 | Geodesic nets with three boundary vertices | We prove that a geodesic net with three boundary (= unbalanced) vertices on a
non-positively curved plane has at most one balanced vertex. We do not assume
any a priori bound for the degrees of unbalanced vertices. The result seems to
be new even in the Euclidean case. We demonstrate by examples that the result
is no... | math.MG math.CO math.DG | we prove that a geodesic net with three boundary unbalanced vertices on a nonpositively curved plane has at most one balanced vertex we do not assume any a priori bound for the degrees of unbalanced vertices the result seems to be new even in the euclidean case we demonstrate by examples that the result is not true for... | [['we', 'prove', 'that', 'a', 'geodesic', 'net', 'with', 'three', 'boundary', 'unbalanced', 'vertices', 'on', 'a', 'nonpositively', 'curved', 'plane', 'has', 'at', 'most', 'one', 'balanced', 'vertex', 'we', 'do', 'not', 'assume', 'any', 'a', 'priori', 'bound', 'for', 'the', 'degrees', 'of', 'unbalanced', 'vertices', 't... | [-0.15750502463339305, 0.12265143758140323, -0.0365796938436333, 0.0882468225616144, -0.11240338802155925, -0.15068242049821448, 0.01987082013724054, 0.4027307070110266, -0.18108357811238754, -0.24964665430711536, 0.10177483715020438, -0.33644818444168423, -0.1837836765945412, 0.18214570808298206, -0.11888535755754608,... |
1,803.03729 | A Large-Scale Multi-Institutional Evaluation of Advanced Discrimination
Algorithms for Buried Threat Detection in Ground Penetrating Radar | In this paper we consider the development of algorithms for the automatic
detection of buried threats using ground penetrating radar (GPR) measurements.
GPR is one of the most studied and successful modalities for automatic buried
threat detection (BTD), and a large variety of BTD algorithms have been
proposed for it... | cs.CV | in this paper we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar gpr measurements gpr is one of the most studied and successful modalities for automatic buried threat detection btd and a large variety of btd algorithms have been proposed for it despite... | [['in', 'this', 'paper', 'we', 'consider', 'the', 'development', 'of', 'algorithms', 'for', 'the', 'automatic', 'detection', 'of', 'buried', 'threats', 'using', 'ground', 'penetrating', 'radar', 'gpr', 'measurements', 'gpr', 'is', 'one', 'of', 'the', 'most', 'studied', 'and', 'successful', 'modalities', 'for', 'automat... | [-0.07532842350170506, -0.00522196541339194, -0.03705464317922441, 0.02625827813803048, -0.06239130131751649, -0.12838898900488585, 0.03605868353971888, 0.3869946587813292, -0.16078481902018574, -0.37087351646921446, 0.17280030444684163, -0.30893881138531104, -0.17510160657319246, 0.2673893826510845, -0.090245875619305... |
1,803.0373 | A White Paper Submitted to The National Academy of Science's Committee
on Exoplanet Science Strategy: Observing Exoplanets with the James Webb Space
Telescope | The James Webb Space Telescope (JWST) will revolutionize our understanding of
exoplanets with transit spectroscopy of a wide range of mature planets close to
their host stars ($<$2 AU) and with coronagraphic imaging and spectroscopy of
young objects located further out ($>$10 AU). The census of exoplanets has
reveale... | astro-ph.IM astro-ph.EP astro-ph.SR | the james webb space telescope jwst will revolutionize our understanding of exoplanets with transit spectroscopy of a wide range of mature planets close to their host stars 2 au and with coronagraphic imaging and spectroscopy of young objects located further out 10 au the census of exoplanets has revealed an enormous v... | [['the', 'james', 'webb', 'space', 'telescope', 'jwst', 'will', 'revolutionize', 'our', 'understanding', 'of', 'exoplanets', 'with', 'transit', 'spectroscopy', 'of', 'a', 'wide', 'range', 'of', 'mature', 'planets', 'close', 'to', 'their', 'host', 'stars', '2', 'au', 'and', 'with', 'coronagraphic', 'imaging', 'and', 'sp... | [-0.046083580339992686, 0.12499638450691626, -0.08361673692041742, 0.02795753042113834, -0.19842960840822862, -0.03846680960351867, 0.08745914578654006, 0.36087991848055806, -0.1906301437211888, -0.41512354342932145, 0.1143377514921927, -0.3009838319183992, -0.10099569673516921, 0.2629865849789764, -0.10954121836195034... |
1,803.03731 | Model Structural Inference using Local Dynamic Operators | This paper focuses on the problem of quantifying the effects of
model-structure uncertainty in the context of time-evolving dynamical systems.
This is motivated by multi-model uncertainty in computer physics simulations:
developers often make different modeling choices in numerical approximations
and process simplifi... | math.DS math.AP | this paper focuses on the problem of quantifying the effects of modelstructure uncertainty in the context of timeevolving dynamical systems this is motivated by multimodel uncertainty in computer physics simulations developers often make different modeling choices in numerical approximations and process simplifications... | [['this', 'paper', 'focuses', 'on', 'the', 'problem', 'of', 'quantifying', 'the', 'effects', 'of', 'modelstructure', 'uncertainty', 'in', 'the', 'context', 'of', 'timeevolving', 'dynamical', 'systems', 'this', 'is', 'motivated', 'by', 'multimodel', 'uncertainty', 'in', 'computer', 'physics', 'simulations', 'developers'... | [-0.07050471135221843, 0.014922748529091411, -0.0885287349832789, 0.0971053148988725, -0.07331732723132689, -0.12614466527911816, 0.033758108413784835, 0.3437827976622601, -0.3229440523416929, -0.3310660262491097, 0.11807654911425966, -0.24920612558248048, -0.16264656334368618, 0.17376935949443645, -0.03745934429780562... |
1,803.03732 | Precision Space Astrometry as a Tool to Find Earth-like Exoplanets | Because of the recent technological advances, the key technologies needed for
precision space optical astrometry are now in hand. The Microarcsecond
Astrometry Probe (MAP) mission concept is designed to find 1 Earth mass planets
at 1AU orbit (scaled to solar luminosity) around the nearest ~90 FGK stars. The
MAP paylo... | astro-ph.IM astro-ph.EP | because of the recent technological advances the key technologies needed for precision space optical astrometry are now in hand the microarcsecond astrometry probe map mission concept is designed to find 1 earth mass planets at 1au orbit scaled to solar luminosity around the nearest 90 fgk stars the map payload include... | [['because', 'of', 'the', 'recent', 'technological', 'advances', 'the', 'key', 'technologies', 'needed', 'for', 'precision', 'space', 'optical', 'astrometry', 'are', 'now', 'in', 'hand', 'the', 'microarcsecond', 'astrometry', 'probe', 'map', 'mission', 'concept', 'is', 'designed', 'to', 'find', '1', 'earth', 'mass', 'p... | [-0.11556141591274659, 0.15224477249576884, -0.0598518279671089, 0.03311594524476565, -0.11153874360024929, -0.11502028399699195, 0.047383803453207196, 0.36921165980577114, -0.1912064716097213, -0.39910694401332003, 0.1300843421433924, -0.3205626648265177, -0.04852503956250936, 0.26784889041139426, -0.15497345259011594... |
1,803.03733 | Mobile Edge Computing for Cellular-Connected UAV: Computation Offloading
and Trajectory Optimization | This paper studies a new mobile edge computing (MEC) setup where an unmanned
aerial vehicle (UAV) is served by cellular ground base stations (GBSs) for
computation offloading. The UAV flies between a give pair of initial and final
locations, during which it needs to accomplish certain computation tasks by
offloading ... | cs.IT math.IT | this paper studies a new mobile edge computing mec setup where an unmanned aerial vehicle uav is served by cellular ground base stations gbss for computation offloading the uav flies between a give pair of initial and final locations during which it needs to accomplish certain computation tasks by offloading them to so... | [['this', 'paper', 'studies', 'a', 'new', 'mobile', 'edge', 'computing', 'mec', 'setup', 'where', 'an', 'unmanned', 'aerial', 'vehicle', 'uav', 'is', 'served', 'by', 'cellular', 'ground', 'base', 'stations', 'gbss', 'for', 'computation', 'offloading', 'the', 'uav', 'flies', 'between', 'a', 'give', 'pair', 'of', 'initia... | [-0.2223245812714786, 0.010475851376548618, -0.03591581675573252, -0.0029527620438449574, -0.1022696565809096, -0.22830582225364388, 0.15742026857409847, 0.4131423480269548, -0.31465212609863985, -0.3690028548559272, 0.10913417264696602, -0.20811066591474964, -0.15450343748671003, 0.16668122022192142, -0.18073483997412... |
1,803.03734 | Quantum heat engine based on trapped Bose gases: Its maximum efficiency
can approach the Carnot value at finite power | It was reported that, if and only if the specific heat, correlation length,
and dynamical exponents $\alpha, \nu$ and $z$, fulfill the condition
$\alpha-z\nu>0$, the phase transitions can enable a quantum heat engine to
approach Carnot efficiency at finite power. We start our analysis via a
different approach in whic... | cond-mat.stat-mech | it was reported that if and only if the specific heat correlation length and dynamical exponents alpha nu and z fulfill the condition alphaznu0 the phase transitions can enable a quantum heat engine to approach carnot efficiency at finite power we start our analysis via a different approach in which the effects of inte... | [['it', 'was', 'reported', 'that', 'if', 'and', 'only', 'if', 'the', 'specific', 'heat', 'correlation', 'length', 'and', 'dynamical', 'exponents', 'alpha', 'nu', 'and', 'z', 'fulfill', 'the', 'condition', 'alphaznu0', 'the', 'phase', 'transitions', 'can', 'enable', 'a', 'quantum', 'heat', 'engine', 'to', 'approach', 'c... | [-0.10513584432258292, 0.2117226861287649, -0.06100053146457702, 0.0264582348278385, -0.001238592725712806, -0.18283063358566407, 0.08518619755208916, 0.3218713404739075, -0.23804032436402683, -0.2680725007263721, 0.0607919322627078, -0.3102606299362378, -0.07199426047224154, 0.24734342339401005, 0.03757622267188377, 0... |
1,803.03735 | Attention-based Graph Neural Network for Semi-supervised Learning | Recently popularized graph neural networks achieve the state-of-the-art
accuracy on a number of standard benchmark datasets for graph-based
semi-supervised learning, improving significantly over existing approaches.
These architectures alternate between a propagation layer that aggregates the
hidden states of the loc... | stat.ML cs.AI cs.LG | recently popularized graph neural networks achieve the stateoftheart accuracy on a number of standard benchmark datasets for graphbased semisupervised learning improving significantly over existing approaches these architectures alternate between a propagation layer that aggregates the hidden states of the local neighb... | [['recently', 'popularized', 'graph', 'neural', 'networks', 'achieve', 'the', 'stateoftheart', 'accuracy', 'on', 'a', 'number', 'of', 'standard', 'benchmark', 'datasets', 'for', 'graphbased', 'semisupervised', 'learning', 'improving', 'significantly', 'over', 'existing', 'approaches', 'these', 'architectures', 'alterna... | [-0.08169571868957708, 0.030733371623838792, -0.036644076460483246, 0.048970195826382915, -0.125588739283778, -0.17653004704936961, 0.08527926884996093, 0.43099191098125894, -0.267219222781032, -0.32214665128714215, 0.012131513991261446, -0.2812472851184077, -0.22791536106031876, 0.18660957572953493, -0.065013279541009... |
1,803.03736 | Joint Optimization of Scheduling and Routing in Multicast Wireless
Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games | In this paper we present matrix game-theoretic models for joint routing,
network coding, and scheduling problem. First routing and network coding are
modeled by using a new approach based on compressed topology matrix that takes
into account the inherent multicast gain of the network. The scheduling is
optimized by a... | eess.SP cs.NI | in this paper we present matrix gametheoretic models for joint routing network coding and scheduling problem first routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network the scheduling is optimized by a new ap... | [['in', 'this', 'paper', 'we', 'present', 'matrix', 'gametheoretic', 'models', 'for', 'joint', 'routing', 'network', 'coding', 'and', 'scheduling', 'problem', 'first', 'routing', 'and', 'network', 'coding', 'are', 'modeled', 'by', 'using', 'a', 'new', 'approach', 'based', 'on', 'compressed', 'topology', 'matrix', 'that... | [-0.15780178536582376, 0.002640570739857884, -0.09613884362010953, 0.0336753466212729, -0.09178319763989513, -0.22750856355839616, 0.10397140688767838, 0.4320364192026011, -0.31608387956961614, -0.30477041374417496, 0.0748856807494033, -0.22672117390485189, -0.2381843420144422, 0.07564797058882278, -0.11669747085990345... |
1,803.03737 | Enhancing Evolutionary Conversion Rate Optimization via Multi-armed
Bandit Algorithms | Conversion rate optimization means designing web interfaces such that more
visitors perform a desired action (such as register or purchase) on the site.
One promising approach, implemented in Sentient Ascend, is to optimize the
design using evolutionary algorithms, evaluating each candidate design online
with actual ... | cs.NE | conversion rate optimization means designing web interfaces such that more visitors perform a desired action such as register or purchase on the site one promising approach implemented in sentient ascend is to optimize the design using evolutionary algorithms evaluating each candidate design online with actual visitors... | [['conversion', 'rate', 'optimization', 'means', 'designing', 'web', 'interfaces', 'such', 'that', 'more', 'visitors', 'perform', 'a', 'desired', 'action', 'such', 'as', 'register', 'or', 'purchase', 'on', 'the', 'site', 'one', 'promising', 'approach', 'implemented', 'in', 'sentient', 'ascend', 'is', 'to', 'optimize', ... | [-0.0994742261854706, 0.029161433563596267, -0.0740530874217329, 0.09242371718927604, -0.15425916601463788, -0.21606615799382053, 0.10270611059700534, 0.43624729571715454, -0.2878160771958107, -0.3703145678926465, 0.17037876939081067, -0.2396457979964104, -0.17805406545071742, 0.2321324157828545, -0.1039852553184367, 0... |
1,803.03738 | Stochastic Models of Coalition Games for Spectrum Sharing in Large Scale
Interference Channels | In this paper, we present a framework for the analysis of self-organized
distributed coalition formation process for spectrum sharing in interference
channel for large-scale ad hoc networks. In this approach, we use the concept
of coalition clusters within the network where mutual interdependency between
different cl... | eess.SP | in this paper we present a framework for the analysis of selforganized distributed coalition formation process for spectrum sharing in interference channel for largescale ad hoc networks in this approach we use the concept of coalition clusters within the network where mutual interdependency between different clusters ... | [['in', 'this', 'paper', 'we', 'present', 'a', 'framework', 'for', 'the', 'analysis', 'of', 'selforganized', 'distributed', 'coalition', 'formation', 'process', 'for', 'spectrum', 'sharing', 'in', 'interference', 'channel', 'for', 'largescale', 'ad', 'hoc', 'networks', 'in', 'this', 'approach', 'we', 'use', 'the', 'con... | [-0.16870049244110905, 0.03275681507103599, -0.0706067657575193, 0.06171793979655842, -0.03833190523508209, -0.1216010937148495, 0.11034419622894082, 0.397261959829981, -0.3024011118814531, -0.3273741239170748, 0.05120360311092355, -0.20432207577332298, -0.2034890040891563, 0.08929943444531002, -0.04482416582305166, 0.... |
1,803.03739 | Disentangled cooperative orderings in artificial rare-earth nickelates | Coupled transitions between distinct ordered phases are important aspects
behind the rich phase complexity of correlated oxides that hinders our
understanding of the underlying phenomena. For this reason, fundamental control
over complex transitions has become a leading motivation of the designer
approach to material... | cond-mat.str-el | coupled transitions between distinct ordered phases are important aspects behind the rich phase complexity of correlated oxides that hinders our understanding of the underlying phenomena for this reason fundamental control over complex transitions has become a leading motivation of the designer approach to materials we... | [['coupled', 'transitions', 'between', 'distinct', 'ordered', 'phases', 'are', 'important', 'aspects', 'behind', 'the', 'rich', 'phase', 'complexity', 'of', 'correlated', 'oxides', 'that', 'hinders', 'our', 'understanding', 'of', 'the', 'underlying', 'phenomena', 'for', 'this', 'reason', 'fundamental', 'control', 'over... | [-0.18444448317530632, 0.218757989919002, -0.043825164443461705, 0.043022485244834166, -0.0692775503096991, -0.1889786229758764, 0.12959298264506636, 0.3848262910009516, -0.29710625269024676, -0.286232362075752, 0.015799437083661654, -0.28991125249273036, -0.18112955924697122, 0.10014630150395316, 0.021263037333326625,... |
1,803.0374 | Cluster Size Optimization in Cooperative Spectrum Sensing | In this paper, we study and optimize the cooperation cluster size in
cooperative spectrum sensing to maximize the throughput of secondary users
(SUs). To calculate the effective throughput, we assume each SU spends just 1
symbol to negotiate with the other SUs in its transmission range. This is the
minimum overhead r... | eess.SP cs.IT math.IT | in this paper we study and optimize the cooperation cluster size in cooperative spectrum sensing to maximize the throughput of secondary users sus to calculate the effective throughput we assume each su spends just 1 symbol to negotiate with the other sus in its transmission range this is the minimum overhead required ... | [['in', 'this', 'paper', 'we', 'study', 'and', 'optimize', 'the', 'cooperation', 'cluster', 'size', 'in', 'cooperative', 'spectrum', 'sensing', 'to', 'maximize', 'the', 'throughput', 'of', 'secondary', 'users', 'sus', 'to', 'calculate', 'the', 'effective', 'throughput', 'we', 'assume', 'each', 'su', 'spends', 'just', '... | [-0.1711103270275979, 0.07892443535358755, -0.03435057902868877, 0.03987316970753493, -0.07997248637219591, -0.1572530728900024, 0.13800315634642918, 0.38512901545587364, -0.27847873051250255, -0.30763205655059345, 0.0748301010205841, -0.27107164140800716, -0.12988881903990943, 0.08947872567010583, -0.13380814306638253... |
1,803.03741 | Tokunaga self-similarity arises naturally from time invariance | The Tokunaga condition is an algebraic rule that provides a detailed
description of the branching structure in a self-similar tree. Despite a solid
empirical validation and practical convenience, the Tokunaga condition lacks a
theoretical justification. Such a justification is suggested in this work. We
define a geom... | math.DS math.PR nlin.AO nlin.CD | the tokunaga condition is an algebraic rule that provides a detailed description of the branching structure in a selfsimilar tree despite a solid empirical validation and practical convenience the tokunaga condition lacks a theoretical justification such a justification is suggested in this work we define a geometric b... | [['the', 'tokunaga', 'condition', 'is', 'an', 'algebraic', 'rule', 'that', 'provides', 'a', 'detailed', 'description', 'of', 'the', 'branching', 'structure', 'in', 'a', 'selfsimilar', 'tree', 'despite', 'a', 'solid', 'empirical', 'validation', 'and', 'practical', 'convenience', 'the', 'tokunaga', 'condition', 'lacks', ... | [-0.14968466791549323, 0.11101470625983305, -0.1445810668593069, 0.09106386839740488, -0.11865877947464835, -0.10290366627995957, 0.11032305481773214, 0.3127399123168136, -0.24466585252089662, -0.22670329416790946, 0.09176875987019734, -0.2042364294507674, -0.1340440950205891, 0.15446101416278035, -0.06933571050406293,... |
1,803.03742 | K-shell decomposition reveals hierarchical cortical organization of the
human brain | In recent years numerous attempts to understand the human brain were
undertaken from a network point of view. A network framework takes into account
the relationships between the different parts of the system and enables to
examine how global and complex functions might emerge from network topology.
Previous work rev... | q-bio.NC | in recent years numerous attempts to understand the human brain were undertaken from a network point of view a network framework takes into account the relationships between the different parts of the system and enables to examine how global and complex functions might emerge from network topology previous work reveale... | [['in', 'recent', 'years', 'numerous', 'attempts', 'to', 'understand', 'the', 'human', 'brain', 'were', 'undertaken', 'from', 'a', 'network', 'point', 'of', 'view', 'a', 'network', 'framework', 'takes', 'into', 'account', 'the', 'relationships', 'between', 'the', 'different', 'parts', 'of', 'the', 'system', 'and', 'ena... | [-0.10883063619573086, 0.05494552856512512, -0.07084551276908078, 0.07449274657618604, -0.07996091448965849, -0.12091988640995394, 0.040290244563738226, 0.37928396503067835, -0.2683272219047838, -0.33066387758976934, 0.06221135015118639, -0.2972572979244945, -0.2246216660128429, 0.1366547734152176, -0.03004354563296271... |
1,803.03743 | Classical and quantum dissipative dynamics in Josephson junctions: an
Arnold problem, bifurcation and capture into resonance | We theoretically study the phase dynamics in Josephson junctions, which maps
onto the oscillatory motion of a point-like particle in the washboard
potential. Under appropriate driving and damping conditions, the Josephson
phase undergoes intriguing bistable dynamics near a saddle point in the
quasienergy landscape. T... | cond-mat.stat-mech quant-ph | we theoretically study the phase dynamics in josephson junctions which maps onto the oscillatory motion of a pointlike particle in the washboard potential under appropriate driving and damping conditions the josephson phase undergoes intriguing bistable dynamics near a saddle point in the quasienergy landscape the bifu... | [['we', 'theoretically', 'study', 'the', 'phase', 'dynamics', 'in', 'josephson', 'junctions', 'which', 'maps', 'onto', 'the', 'oscillatory', 'motion', 'of', 'a', 'pointlike', 'particle', 'in', 'the', 'washboard', 'potential', 'under', 'appropriate', 'driving', 'and', 'damping', 'conditions', 'the', 'josephson', 'phase'... | [-0.21548953690116518, 0.1778816960286349, -0.09215860628795906, 0.06978934742048672, 0.025790900662380815, -0.1850177365172542, 0.10225704087121092, 0.33901017631307756, -0.2734428770370492, -0.23785848373442825, 0.04665176842937744, -0.2533226439544674, -0.1977467133005246, 0.2063382778965049, -0.00962983044908093, 0... |
1,803.03744 | Enhanced Optimization with Composite Objectives and Novelty Selection | An important benefit of multi-objective search is that it maintains a diverse
population of candidates, which helps in deceptive problems in particular. Not
all diversity is useful, however: candidates that optimize only one objective
while ignoring others are rarely helpful. This paper proposes a solution: The
origi... | cs.NE | an important benefit of multiobjective search is that it maintains a diverse population of candidates which helps in deceptive problems in particular not all diversity is useful however candidates that optimize only one objective while ignoring others are rarely helpful this paper proposes a solution the original objec... | [['an', 'important', 'benefit', 'of', 'multiobjective', 'search', 'is', 'that', 'it', 'maintains', 'a', 'diverse', 'population', 'of', 'candidates', 'which', 'helps', 'in', 'deceptive', 'problems', 'in', 'particular', 'not', 'all', 'diversity', 'is', 'useful', 'however', 'candidates', 'that', 'optimize', 'only', 'one',... | [-0.08177173355775154, 0.023748475747603408, -0.06250480785658044, 0.12222602553444353, -0.1504909688229711, -0.210876437211948, 0.07467933057149302, 0.39766590252195383, -0.2778799408355974, -0.36025125601074914, 0.08740760942955679, -0.2664529583493848, -0.2163846110694172, 0.21170049095680274, -0.07558415819359712, ... |
1,803.03745 | Evolutionary Architecture Search For Deep Multitask Networks | Multitask learning, i.e. learning several tasks at once with the same neural
network, can improve performance in each of the tasks. Designing deep neural
network architectures for multitask learning is a challenge: There are many
ways to tie the tasks together, and the design choices matter. The size and
complexity o... | cs.NE cs.AI | multitask learning ie learning several tasks at once with the same neural network can improve performance in each of the tasks designing deep neural network architectures for multitask learning is a challenge there are many ways to tie the tasks together and the design choices matter the size and complexity of this pro... | [['multitask', 'learning', 'ie', 'learning', 'several', 'tasks', 'at', 'once', 'with', 'the', 'same', 'neural', 'network', 'can', 'improve', 'performance', 'in', 'each', 'of', 'the', 'tasks', 'designing', 'deep', 'neural', 'network', 'architectures', 'for', 'multitask', 'learning', 'is', 'a', 'challenge', 'there', 'are... | [-0.08408059691709857, 0.019323975316459133, -0.07059972765705277, 0.034625285585981706, -0.11049926649899253, -0.19833468684566116, 0.008570691958941038, 0.4531745598320999, -0.3013097233349277, -0.3449542099189374, 0.07096473455143672, -0.2085489960327264, -0.2130905091597308, 0.19400542589174885, -0.1115990647257516... |
1,803.03746 | Signal Optimization with HV divider of MCP-PMT for JUNO | The Jiangmen Underground Neutrino Observatory (JUNO) is proposed to determine
the neutrino mass hierarchy using a 20 kiloton underground liquid scintillator
detector (CD). One of the keys is the energy resolution of the CD to reach <3%
at 1 MeV, where totally 15,000 MCP-PMT will be used. The optimization of the
20-in... | physics.ins-det hep-ex | the jiangmen underground neutrino observatory juno is proposed to determine the neutrino mass hierarchy using a 20 kiloton underground liquid scintillator detector cd one of the keys is the energy resolution of the cd to reach 3 at 1 mev where totally 15000 mcppmt will be used the optimization of the 20inch mcppmt is v... | [['the', 'jiangmen', 'underground', 'neutrino', 'observatory', 'juno', 'is', 'proposed', 'to', 'determine', 'the', 'neutrino', 'mass', 'hierarchy', 'using', 'a', '20', 'kiloton', 'underground', 'liquid', 'scintillator', 'detector', 'cd', 'one', 'of', 'the', 'keys', 'is', 'the', 'energy', 'resolution', 'of', 'the', 'cd'... | [-0.06955415018255244, 0.14766376744200652, -0.044839181401766834, 0.051414762242898544, -0.05202757074777666, -0.1668444757601498, 0.033312432892066805, 0.3482558812493005, -0.21729018626596175, -0.3502085599544886, 0.13514693255938992, -0.2987771090031979, -0.04453547791754072, 0.23011998482098853, -0.052608994928163... |
1,803.03747 | Emergence of spiral dark solitons in the merging of rotating
Bose-Einstein condensates | Merging of isolated Bose-Einstein condensates (BECs) is an important topic
due to its relevance to matter-wave interferometry and the Kibble-Zurek
mechanism. Many past research focused on merging of BECs with uniform initial
phases. In our recent numerical study (Phys. Rev. A 97, 013612 (2018)), we
revealed that upon... | cond-mat.quant-gas | merging of isolated boseeinstein condensates becs is an important topic due to its relevance to matterwave interferometry and the kibblezurek mechanism many past research focused on merging of becs with uniform initial phases in our recent numerical study phys rev a 97 013612 2018 we revealed that upon merging of rotat... | [['merging', 'of', 'isolated', 'boseeinstein', 'condensates', 'becs', 'is', 'an', 'important', 'topic', 'due', 'to', 'its', 'relevance', 'to', 'matterwave', 'interferometry', 'and', 'the', 'kibblezurek', 'mechanism', 'many', 'past', 'research', 'focused', 'on', 'merging', 'of', 'becs', 'with', 'uniform', 'initial', 'ph... | [-0.22360647064347736, 0.18767149133510053, -0.10681299558889709, 0.040868683923063094, -0.05400612968842537, -0.09406732720709597, 0.005228232435081481, 0.3662808532853834, -0.1863706487650324, -0.2723846737396146, 0.015334133973769974, -0.23138367319860828, -0.1091435892855999, 0.16936050063919558, -0.006020678196385... |
1,803.03748 | Integrated Optimization of Partitioning, Scheduling and Floorplanning
for Partially Dynamically Reconfigurable Systems | Confronted with the challenge of high performance for applications and the
restriction of hardware resources for field-programmable gate arrays (FPGAs),
partial dynamic reconfiguration (PDR) technology is anticipated to accelerate
the reconfiguration process and alleviate the device shortage. In this paper,
we propos... | cs.AR | confronted with the challenge of high performance for applications and the restriction of hardware resources for fieldprogrammable gate arrays fpgas partial dynamic reconfiguration pdr technology is anticipated to accelerate the reconfiguration process and alleviate the device shortage in this paper we propose an integ... | [['confronted', 'with', 'the', 'challenge', 'of', 'high', 'performance', 'for', 'applications', 'and', 'the', 'restriction', 'of', 'hardware', 'resources', 'for', 'fieldprogrammable', 'gate', 'arrays', 'fpgas', 'partial', 'dynamic', 'reconfiguration', 'pdr', 'technology', 'is', 'anticipated', 'to', 'accelerate', 'the',... | [-0.15751305910089286, 0.06440935689480891, -0.025618337208773784, 0.027188865713365356, -0.07513926248914989, -0.1492062078541494, 0.08048917507827962, 0.4204954964516219, -0.30826450879734085, -0.3568195905245375, 0.10589920769052696, -0.21259068563813344, -0.13068575610183567, 0.1641246595766764, -0.0856559588064556... |
1,803.03749 | Counting trees in a graph | We discuss a recursive formula for number of spanning trees in a graph. The
paper is written primary for school students.
| math.HO math.CO | we discuss a recursive formula for number of spanning trees in a graph the paper is written primary for school students | [['we', 'discuss', 'a', 'recursive', 'formula', 'for', 'number', 'of', 'spanning', 'trees', 'in', 'a', 'graph', 'the', 'paper', 'is', 'written', 'primary', 'for', 'school', 'students']] | [-0.1509954577223176, 0.1271908243763305, -0.08312050936122735, 0.11614714818452263, -0.16050141340210325, -0.08646930093389182, 0.08722830577642612, 0.3489486669145879, -0.2248256831829037, -0.38384588630426497, 0.0716671868216335, -0.2582473286117117, -0.18892073028144382, 0.22434976484094346, -0.16010251729970887, -... |
1,803.0375 | Charge Transfer Effects in Naturally Occurring van der Waals
Heterostructures (PbSe)1.16(TiSe2)m (m=1, 2) | Van der Waals heterostructures (VDWHs) exhibit rich properties and thus has
potential for applications, and charge transfer between different layers in a
heterostructure often dominates its properties and device performance. It is
thus critical to reveal and understand the charge transfer effects in VDWHs,
for which ... | cond-mat.str-el cond-mat.mtrl-sci | van der waals heterostructures vdwhs exhibit rich properties and thus has potential for applications and charge transfer between different layers in a heterostructure often dominates its properties and device performance it is thus critical to reveal and understand the charge transfer effects in vdwhs for which electro... | [['van', 'der', 'waals', 'heterostructures', 'vdwhs', 'exhibit', 'rich', 'properties', 'and', 'thus', 'has', 'potential', 'for', 'applications', 'and', 'charge', 'transfer', 'between', 'different', 'layers', 'in', 'a', 'heterostructure', 'often', 'dominates', 'its', 'properties', 'and', 'device', 'performance', 'it', '... | [-0.13093554270510538, 0.17845274355126226, -0.034919162749926125, 0.03342398482477065, -0.016094965047043996, -0.1470002838137855, 0.07493962472213841, 0.38536553784591576, -0.2764848740953134, -0.3449187378421789, 0.002631954179804136, -0.3529412439501867, -0.16755078420065705, 0.20712678049259434, 0.0403476658913238... |
1,803.03751 | Exploring Extreme Space Weather Factors of Exoplanetary Habitability | It is currently unknown how common life is on exoplanets, or how long planets
can remain viable for life. To date, we have a superficial notion of
habitability, a necessary first step, but so far lacking an understanding of
the detailed interaction between stars and planets over geological timescales,
dynamical evolu... | astro-ph.EP | it is currently unknown how common life is on exoplanets or how long planets can remain viable for life to date we have a superficial notion of habitability a necessary first step but so far lacking an understanding of the detailed interaction between stars and planets over geological timescales dynamical evolution of ... | [['it', 'is', 'currently', 'unknown', 'how', 'common', 'life', 'is', 'on', 'exoplanets', 'or', 'how', 'long', 'planets', 'can', 'remain', 'viable', 'for', 'life', 'to', 'date', 'we', 'have', 'a', 'superficial', 'notion', 'of', 'habitability', 'a', 'necessary', 'first', 'step', 'but', 'so', 'far', 'lacking', 'an', 'unde... | [-0.07572986387697295, 0.19723824362959225, -0.03758658736263509, 0.11618049700702045, -0.112548808833661, -0.022814116457115563, 0.06588717916847568, 0.3641620276477212, -0.19722226870812706, -0.3664324490963145, 0.11623581316557319, -0.25578024046482756, -0.13914273452266565, 0.22763616342579185, -0.10930251763324265... |
1,803.03752 | Optimum Linear Codes with Support Constraints over Small Fields | We consider the problem of designing optimal linear codes (in terms of having
the largest minimum distance) subject to a support constraint on the generator
matrix. We show that the largest minimum distance can be achieved by a subcode
of a Reed-Solomon code of small field size. As a by-product of this result, we
set... | cs.IT math.IT | we consider the problem of designing optimal linear codes in terms of having the largest minimum distance subject to a support constraint on the generator matrix we show that the largest minimum distance can be achieved by a subcode of a reedsolomon code of small field size as a byproduct of this result we settle the g... | [['we', 'consider', 'the', 'problem', 'of', 'designing', 'optimal', 'linear', 'codes', 'in', 'terms', 'of', 'having', 'the', 'largest', 'minimum', 'distance', 'subject', 'to', 'a', 'support', 'constraint', 'on', 'the', 'generator', 'matrix', 'we', 'show', 'that', 'the', 'largest', 'minimum', 'distance', 'can', 'be', 'a... | [-0.19143455306497903, 0.05841266419738531, -0.0470025000663904, 0.052244978561066094, -0.03269245992772854, -0.12635699920356275, 0.04802600717745148, 0.296359076945541, -0.2995301063100879, -0.321567563769909, 0.10613450140405734, -0.24404142951377883, -0.14216166918094342, 0.18352183328511623, -0.12517704046689548, ... |
1,803.03753 | On a metric generalization of the $tt$-degrees and effective dimension
theory | In this article, we study an analogue of $tt$-reducibility for points in
computable metric spaces. We characterize the notion of the metric $tt$-degree
in the context of first-level Borel isomorphism. Then, we study this concept
from the perspectives of effective topological dimension theory and of
effective fractal ... | math.LO cs.LO | in this article we study an analogue of ttreducibility for points in computable metric spaces we characterize the notion of the metric ttdegree in the context of firstlevel borel isomorphism then we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension the... | [['in', 'this', 'article', 'we', 'study', 'an', 'analogue', 'of', 'ttreducibility', 'for', 'points', 'in', 'computable', 'metric', 'spaces', 'we', 'characterize', 'the', 'notion', 'of', 'the', 'metric', 'ttdegree', 'in', 'the', 'context', 'of', 'firstlevel', 'borel', 'isomorphism', 'then', 'we', 'study', 'this', 'conce... | [-0.12004722450721136, 0.11458074884331894, -0.12041997527604566, 0.12344519119769176, -0.03448485153073326, -0.040207639931047215, 0.05152588925681057, 0.29970398822680433, -0.3255265253655454, -0.20849913154590002, 0.055856091676260086, -0.26481151176576917, -0.26654282370780374, 0.14933358144728429, -0.1290965630732... |
1,803.03754 | Extensions of $\overline\partial$-closed forms on compact generalized
Hermitian manifolds | In this paper, we first get a criterion formula for whether a differential
form is holomorphic with respect to the generalized complex structure induced
by $\epsilon$. Next, we get the local extensions of $\overline\partial$-closed
forms on a smooth family of compact generalized Hermitian manifolds by using
this crit... | math.DG | in this paper we first get a criterion formula for whether a differential form is holomorphic with respect to the generalized complex structure induced by epsilon next we get the local extensions of overlinepartialclosed forms on a smooth family of compact generalized hermitian manifolds by using this criterion finally... | [['in', 'this', 'paper', 'we', 'first', 'get', 'a', 'criterion', 'formula', 'for', 'whether', 'a', 'differential', 'form', 'is', 'holomorphic', 'with', 'respect', 'to', 'the', 'generalized', 'complex', 'structure', 'induced', 'by', 'epsilon', 'next', 'we', 'get', 'the', 'local', 'extensions', 'of', 'overlinepartialclos... | [-0.1412689870738081, 0.03779819601167171, -0.09602070148838193, 0.09385240265155996, -0.13437254275930555, -0.10066762427480794, -0.01155763903577616, 0.31738255344527333, -0.28949108631595183, -0.2217530302533353, 0.1138308406424537, -0.1998849067052728, -0.23392608526505923, 0.18901818846107313, -0.10986474505625665... |
1,803.03755 | Global stability of a network-based SIRS epidemic model with nonmonotone
incidence rate | This paper studies the dynamics of a network-based SIRS epidemic model with
vaccination and a nonmonotone incidence rate. This type of nonlinear incidence
can be used to describe the psychological or inhibitory effect from the
behavioral change of the susceptible individuals when the number of infective
individuals o... | q-bio.PE physics.soc-ph | this paper studies the dynamics of a networkbased sirs epidemic model with vaccination and a nonmonotone incidence rate this type of nonlinear incidence can be used to describe the psychological or inhibitory effect from the behavioral change of the susceptible individuals when the number of infective individuals on he... | [['this', 'paper', 'studies', 'the', 'dynamics', 'of', 'a', 'networkbased', 'sirs', 'epidemic', 'model', 'with', 'vaccination', 'and', 'a', 'nonmonotone', 'incidence', 'rate', 'this', 'type', 'of', 'nonlinear', 'incidence', 'can', 'be', 'used', 'to', 'describe', 'the', 'psychological', 'or', 'inhibitory', 'effect', 'fr... | [-0.11960496554777199, 0.13300960431097458, -0.07119059114291376, 0.12401082348201843, -0.02411572447058973, -0.23092252473094013, 0.08349150817283114, 0.34837831136776715, -0.22867917471306262, -0.18358352825983076, 0.12337942312846256, -0.30426816496726694, -0.23051652469092498, 0.16784293272236472, -0.04978891821047... |
1,803.03756 | Influence of the Event Rate on Discrimination Abilities of Bankruptcy
Prediction Models | In bankruptcy prediction, the proportion of events is very low, which is
often oversampled to eliminate this bias. In this paper, we study the influence
of the event rate on discrimination abilities of bankruptcy prediction models.
First the statistical association and significance of public records and
firmographics... | stat.ML cs.LG | in bankruptcy prediction the proportion of events is very low which is often oversampled to eliminate this bias in this paper we study the influence of the event rate on discrimination abilities of bankruptcy prediction models first the statistical association and significance of public records and firmographics indica... | [['in', 'bankruptcy', 'prediction', 'the', 'proportion', 'of', 'events', 'is', 'very', 'low', 'which', 'is', 'often', 'oversampled', 'to', 'eliminate', 'this', 'bias', 'in', 'this', 'paper', 'we', 'study', 'the', 'influence', 'of', 'the', 'event', 'rate', 'on', 'discrimination', 'abilities', 'of', 'bankruptcy', 'predic... | [-0.0464442480291272, 0.02474801242030386, -0.03979288575014678, 0.1433170428644095, -0.06946381127847166, -0.18112362018738198, 0.1265184348762228, 0.4256233155984303, -0.21707163453904976, -0.32842751656626834, 0.14742482801224907, -0.3233032659274237, -0.12230684815681186, 0.17305632450714192, -0.11213634989128031, ... |
1,803.03757 | Surface wrinkling of an elastic block subject to biaxial loading by an
energy method | Wrinkles are often observed on the surfaces of compressed soft materials in
nature. In the past few decades, the fascinating surface patterns have been
studied extensively by using the linear bifurcation analysis under plane
strain. The bifurcation concerns the non-uniqueness solutions, however, it
delivers little in... | cond-mat.soft | wrinkles are often observed on the surfaces of compressed soft materials in nature in the past few decades the fascinating surface patterns have been studied extensively by using the linear bifurcation analysis under plane strain the bifurcation concerns the nonuniqueness solutions however it delivers little informatio... | [['wrinkles', 'are', 'often', 'observed', 'on', 'the', 'surfaces', 'of', 'compressed', 'soft', 'materials', 'in', 'nature', 'in', 'the', 'past', 'few', 'decades', 'the', 'fascinating', 'surface', 'patterns', 'have', 'been', 'studied', 'extensively', 'by', 'using', 'the', 'linear', 'bifurcation', 'analysis', 'under', 'p... | [-0.1340870598143585, 0.13506677905688566, -0.09526120694460817, 0.03734035296756632, -0.04906093882830487, -0.08161433082863064, 0.031643627297207856, 0.34227709438765547, -0.2873435804499527, -0.2693084182625615, 0.1453063046245992, -0.2592785372185514, -0.1870689622898771, 0.18658836643417714, -0.029147559654488377,... |
1,803.03758 | A Tutorial On Autonomous Vehicle Steering Controller Design, Simulation
and Implementation | In this tutorial, we detailed simple controllers for autonomous parking and
path following for self-driving cars providing practical methods for curvature
computation.
| cs.RO | in this tutorial we detailed simple controllers for autonomous parking and path following for selfdriving cars providing practical methods for curvature computation | [['in', 'this', 'tutorial', 'we', 'detailed', 'simple', 'controllers', 'for', 'autonomous', 'parking', 'and', 'path', 'following', 'for', 'selfdriving', 'cars', 'providing', 'practical', 'methods', 'for', 'curvature', 'computation']] | [-0.18385844400406562, 0.03262076464439319, -0.03714108107272874, 0.03567950441819531, -0.17277141867882825, -0.22819896855137564, 0.074350729288364, 0.5060942240736701, -0.22458741801198234, -0.2568596585188061, 0.11248069477997805, -0.2142057768492536, -0.1970598897896707, 0.36710721389813855, -0.22509397830766498, 0... |
1,803.03759 | Speech Recognition: Keyword Spotting Through Image Recognition | The problem of identifying voice commands has always been a challenge due to
the presence of noise and variability in speed, pitch, etc. We will compare the
efficacies of several neural network architectures for the speech recognition
problem. In particular, we will build a model to determine whether a one second
aud... | stat.ML cs.LG | the problem of identifying voice commands has always been a challenge due to the presence of noise and variability in speed pitch etc we will compare the efficacies of several neural network architectures for the speech recognition problem in particular we will build a model to determine whether a one second audio clip... | [['the', 'problem', 'of', 'identifying', 'voice', 'commands', 'has', 'always', 'been', 'a', 'challenge', 'due', 'to', 'the', 'presence', 'of', 'noise', 'and', 'variability', 'in', 'speed', 'pitch', 'etc', 'we', 'will', 'compare', 'the', 'efficacies', 'of', 'several', 'neural', 'network', 'architectures', 'for', 'the', ... | [-0.07691718050084959, -0.0003907245432648608, -0.042018312654589246, 0.06295568596113836, -0.1325771739462628, -0.1914286537770957, 0.012530020425633696, 0.4399230558387685, -0.29945754018555953, -0.29598860368960783, 0.09593769786144989, -0.25335935930777714, -0.22533587262115673, 0.21648494132650678, -0.148079424305... |
1,803.0376 | Efficient Determination of Equivalence for Encrypted Data | Secure computation of equivalence has fundamental application in many
different areas, including healthcare. We study this problem in the context of
matching an individual identity to link medical records across systems. We
develop an efficient solution for equivalence based on existing work that can
evaluate the gre... | cs.CR | secure computation of equivalence has fundamental application in many different areas including healthcare we study this problem in the context of matching an individual identity to link medical records across systems we develop an efficient solution for equivalence based on existing work that can evaluate the greater ... | [['secure', 'computation', 'of', 'equivalence', 'has', 'fundamental', 'application', 'in', 'many', 'different', 'areas', 'including', 'healthcare', 'we', 'study', 'this', 'problem', 'in', 'the', 'context', 'of', 'matching', 'an', 'individual', 'identity', 'to', 'link', 'medical', 'records', 'across', 'systems', 'we', '... | [-0.08565365918246763, -0.04297702329391281, -0.04068090701475739, 0.101145994914363, -0.0637717847712338, -0.11472964871209115, 0.07209719042293727, 0.4150531425007752, -0.2585000857910407, -0.3430586656289441, 0.1513387739159433, -0.26149593948253563, -0.20803800399548242, 0.27486968730310246, -0.13914406833729506, 0... |
1,803.03761 | Quantum-secure message authentication via blind-unforgeability | Formulating and designing authentication of classical messages in the
presence of adversaries with quantum query access has been a longstanding
challenge, as the familiar classical notions of unforgeability do not directly
translate into meaningful notions in the quantum setting. A particular
difficulty is how to fai... | quant-ph cs.CR | formulating and designing authentication of classical messages in the presence of adversaries with quantum query access has been a longstanding challenge as the familiar classical notions of unforgeability do not directly translate into meaningful notions in the quantum setting a particular difficulty is how to fairly ... | [['formulating', 'and', 'designing', 'authentication', 'of', 'classical', 'messages', 'in', 'the', 'presence', 'of', 'adversaries', 'with', 'quantum', 'query', 'access', 'has', 'been', 'a', 'longstanding', 'challenge', 'as', 'the', 'familiar', 'classical', 'notions', 'of', 'unforgeability', 'do', 'not', 'directly', 'tr... | [-0.13322238569455822, 0.06535779080572425, -0.1135518537804244, 0.08360474993852192, -0.0882411528727971, -0.19652218303282656, 0.08677180423452932, 0.3305930748380976, -0.2768313457678643, -0.294678570421022, 0.08480831409378292, -0.24920330853051237, -0.18321727769028756, 0.19728418003585596, -0.16719028417543497, 0... |
1,803.03762 | The Dirichlet Casimir Energy for $\phi^4$ Theory in a Rectangle | In this article, we present the zero and first-order radiative correction to
the Dirichlet Casimir energy for massive and massless scalar field confined in
a rectangle. This calculation procedure was conducted in two spatial dimensions
and for the case of the first-order correction term is new. The renormalization
pr... | hep-th | in this article we present the zero and firstorder radiative correction to the dirichlet casimir energy for massive and massless scalar field confined in a rectangle this calculation procedure was conducted in two spatial dimensions and for the case of the firstorder correction term is new the renormalization program t... | [['in', 'this', 'article', 'we', 'present', 'the', 'zero', 'and', 'firstorder', 'radiative', 'correction', 'to', 'the', 'dirichlet', 'casimir', 'energy', 'for', 'massive', 'and', 'massless', 'scalar', 'field', 'confined', 'in', 'a', 'rectangle', 'this', 'calculation', 'procedure', 'was', 'conducted', 'in', 'two', 'spat... | [-0.12708117672251446, 0.09593572257787432, -0.09556508372367203, 0.08968235278389149, -0.07768155662412064, -0.1305083904742715, 0.03742484103122929, 0.3684819031709639, -0.197898791694903, -0.29471913172798875, 0.09821990719883435, -0.2550106583484293, -0.14442171031000592, 0.14274028050113874, -0.03321714871816595, ... |
1,803.03763 | \bf $\delta M$ Formalism and Anisotropic Chaotic Inflation Power
Spectrum | A new analytical approach to linear perturbations in anisotropic inflation
has been introduced in [A. Talebian-Ashkezari, N. Ahmadi and A.A. Abolhasanib,
JCAP 03(2018)001] under the name of $\delta M$ formalism. In this paper we
apply the mentioned approach to a model of anisotropic inflation driven by a
scalar field... | gr-qc | a new analytical approach to linear perturbations in anisotropic inflation has been introduced in a talebianashkezari n ahmadi and aa abolhasanib jcap 032018001 under the name of delta m formalism in this paper we apply the mentioned approach to a model of anisotropic inflation driven by a scalar field coupled to the k... | [['a', 'new', 'analytical', 'approach', 'to', 'linear', 'perturbations', 'in', 'anisotropic', 'inflation', 'has', 'been', 'introduced', 'in', 'a', 'talebianashkezari', 'n', 'ahmadi', 'and', 'aa', 'abolhasanib', 'jcap', '032018001', 'under', 'the', 'name', 'of', 'delta', 'm', 'formalism', 'in', 'this', 'paper', 'we', 'a... | [-0.16260432587751678, 0.12841792313496667, -0.1115966661307136, 0.07766332073787668, -0.0652149113193723, -0.1472055908783076, -0.03602544725641523, 0.32628454675343427, -0.20270902167237898, -0.30537850619116014, -0.0023098982593314794, -0.271884583924961, -0.1738099882126793, 0.14814330535969264, 0.05217922623944646... |
1,803.03764 | Variance Networks: When Expectation Does Not Meet Your Expectations | Ordinary stochastic neural networks mostly rely on the expected values of
their weights to make predictions, whereas the induced noise is mostly used to
capture the uncertainty, prevent overfitting and slightly boost the performance
through test-time averaging. In this paper, we introduce variance layers, a
different... | stat.ML | ordinary stochastic neural networks mostly rely on the expected values of their weights to make predictions whereas the induced noise is mostly used to capture the uncertainty prevent overfitting and slightly boost the performance through testtime averaging in this paper we introduce variance layers a different kind of... | [['ordinary', 'stochastic', 'neural', 'networks', 'mostly', 'rely', 'on', 'the', 'expected', 'values', 'of', 'their', 'weights', 'to', 'make', 'predictions', 'whereas', 'the', 'induced', 'noise', 'is', 'mostly', 'used', 'to', 'capture', 'the', 'uncertainty', 'prevent', 'overfitting', 'and', 'slightly', 'boost', 'the', ... | [-0.05392692767654675, 0.07106644929189959, -0.061448698611862036, 0.1023405062078913, -0.11329025975394531, -0.17097725509495956, 0.04775003114133992, 0.44008075941292857, -0.32293496085466805, -0.3122090032854437, 0.05431822067157223, -0.252340394252381, -0.21806197247066855, 0.1765474889318656, -0.14354093150867925,... |
1,803.03765 | How to solve the stochastic partial differential equation that gives a
Mat\'ern random field using the finite element method | This tutorial teaches parts of the finite element method (FEM), and solves a
stochastic partial differential equation (SPDE). The contents herein are
considered "known" in the numerics literature, but for statisticians it is very
difficult to find a resource for learning these ideas in a timely manner
(without doing ... | stat.CO | this tutorial teaches parts of the finite element method fem and solves a stochastic partial differential equation spde the contents herein are considered known in the numerics literature but for statisticians it is very difficult to find a resource for learning these ideas in a timely manner without doing a years wort... | [['this', 'tutorial', 'teaches', 'parts', 'of', 'the', 'finite', 'element', 'method', 'fem', 'and', 'solves', 'a', 'stochastic', 'partial', 'differential', 'equation', 'spde', 'the', 'contents', 'herein', 'are', 'considered', 'known', 'in', 'the', 'numerics', 'literature', 'but', 'for', 'statisticians', 'it', 'is', 've... | [-0.06415067880609354, 0.03278360206384732, -0.12456318157790013, 0.10774741819545323, -0.1781202268808387, -0.1826074022561485, 0.03381271885578022, 0.390336308931542, -0.2700471281003597, -0.3116105940696502, 0.1437120565042701, -0.2746193788750747, -0.16357467509806156, 0.18849460753547245, -0.14925515449194368, 0.0... |
1,803.03766 | Bright luminescence from indirect and strongly bound excitons in hBN | A quantitative analysis of the excitonic luminescence efficiency in hexagonal
boron nitride (hBN) is carried out by cathodoluminescence in the ultraviolet
range and compared with zinc oxide and diamond single crystals. A high quantum
yield value of ~50% is found for hBN at 10 K comparable to that of direct
bandgap se... | cond-mat.mtrl-sci | a quantitative analysis of the excitonic luminescence efficiency in hexagonal boron nitride hbn is carried out by cathodoluminescence in the ultraviolet range and compared with zinc oxide and diamond single crystals a high quantum yield value of 50 is found for hbn at 10 k comparable to that of direct bandgap semicondu... | [['a', 'quantitative', 'analysis', 'of', 'the', 'excitonic', 'luminescence', 'efficiency', 'in', 'hexagonal', 'boron', 'nitride', 'hbn', 'is', 'carried', 'out', 'by', 'cathodoluminescence', 'in', 'the', 'ultraviolet', 'range', 'and', 'compared', 'with', 'zinc', 'oxide', 'and', 'diamond', 'single', 'crystals', 'a', 'hig... | [-0.06987467418508814, 0.17346172044018662, -0.01562801840596069, 0.015377949620422004, 0.024678520337263598, -0.15833802983038744, 0.11849283738870565, 0.48342892953327726, -0.23812391499015398, -0.3379195320132868, -0.04091588123281367, -0.3466056818562679, -0.04202461488198321, 0.2017872053622163, 0.0841103216030992... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.