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.00867 | Probing vorticity structure in heavy-ion collisions by local $\Lambda$
polarization | We study the local structure of the vorticity field and the $\Lambda$
polarization in Au+Au collisions in the energy range
$\sqrt{s_{\mathrm{NN}}}=7.7$--$200$ GeV and Pb+Pb collisions at
$\sqrt{s_{\mathrm{NN}}}=2760$ GeV using A Multi-Phase Transport (AMPT) model.
We focus on the vorticity field arising from the non-... | nucl-th hep-ph | we study the local structure of the vorticity field and the lambda polarization in auau collisions in the energy range sqrts_mathrmnn77200 gev and pbpb collisions at sqrts_mathrmnn2760 gev using a multiphase transport ampt model we focus on the vorticity field arising from the nonuniform expansion of the fireball which... | [['we', 'study', 'the', 'local', 'structure', 'of', 'the', 'vorticity', 'field', 'and', 'the', 'lambda', 'polarization', 'in', 'auau', 'collisions', 'in', 'the', 'energy', 'range', 'sqrts_mathrmnn77200', 'gev', 'and', 'pbpb', 'collisions', 'at', 'sqrts_mathrmnn2760', 'gev', 'using', 'a', 'multiphase', 'transport', 'amp... | [-0.15881430090715487, 0.2057490018584455, -0.10661842952637622, 0.08139353259466589, -0.021558475443938126, -0.025036101889175672, -0.10029035097298523, 0.37321368971218666, -0.2966724050114863, -0.24462379492276037, -0.006308829606859944, -0.27559748260149114, 0.033783326763659714, 0.17377705387577105, 0.101029432401... |
1,803.00868 | Equation of state of the intergalactic medium in the early Universe | Spectroscopy of the Ly$\alpha$ forest in quasar spectra proved to be a useful
tool for probing the intergalactic gas. We developed the automatic program for
Voigt profile fitting of Ly$\alpha$ forest lines. We run this code on 9 high
resolution ($\sim 50000$) quasars spectra with a high signal-to-noise ratio
($\sim 5... | astro-ph.CO | spectroscopy of the lyalpha forest in quasar spectra proved to be a useful tool for probing the intergalactic gas we developed the automatic program for voigt profile fitting of lyalpha forest lines we run this code on 9 high resolution sim 50000 quasars spectra with a high signaltonoise ratio sim 50 100 from the keck ... | [['spectroscopy', 'of', 'the', 'lyalpha', 'forest', 'in', 'quasar', 'spectra', 'proved', 'to', 'be', 'a', 'useful', 'tool', 'for', 'probing', 'the', 'intergalactic', 'gas', 'we', 'developed', 'the', 'automatic', 'program', 'for', 'voigt', 'profile', 'fitting', 'of', 'lyalpha', 'forest', 'lines', 'we', 'run', 'this', 'c... | [-0.013891255169356655, 0.07145068554370756, -0.04286869170351161, 0.04285394834513436, -0.07067443644036613, -0.14031827926547044, 0.0644262574376568, 0.44775035391960827, -0.16110513681760205, -0.3856218337258768, 0.03020257063834588, -0.32134022073273266, 0.017900624672331597, 0.2230154104560377, 0.0493346718066032,... |
1,803.00869 | A perfect obstruction theory for moduli of coherent systems | Let $C$ be a curve of genus $g$. A coherent system on $C$ is a pair $(E,V)$,
where $E$ is a finite rank vector bundle on $C$ and $V$ is a linear subspace of
the space of global sections of $E$. The type of a coherent system $(E,V)$ is a
triple $(n,d,k)$, where $n$ is the rank of $E$, $d$ is the degree of $E$ and
$k$ ... | math.AG | let c be a curve of genus g a coherent system on c is a pair ev where e is a finite rank vector bundle on c and v is a linear subspace of the space of global sections of e the type of a coherent system ev is a triple ndk where n is the rank of e d is the degree of e and k is the dimension of v the notion of stability f... | [['let', 'c', 'be', 'a', 'curve', 'of', 'genus', 'g', 'a', 'coherent', 'system', 'on', 'c', 'is', 'a', 'pair', 'ev', 'where', 'e', 'is', 'a', 'finite', 'rank', 'vector', 'bundle', 'on', 'c', 'and', 'v', 'is', 'a', 'linear', 'subspace', 'of', 'the', 'space', 'of', 'global', 'sections', 'of', 'e', 'the', 'type', 'of', 'a... | [-0.21429319117694748, 0.11765275290041287, -0.0827029024922224, 0.011443903308962796, -0.03686567430714752, -0.16378645669820524, 0.04692320219514523, 0.320165217150176, -0.2808373017686008, -0.19862206878010616, 0.0595973419603556, -0.26935073195653425, -0.1061588711901243, 0.22110571916726807, -0.08137889161467725, ... |
1,803.0087 | Interaction of a supersonic particle with a three-dimensional complex
plasma | The influence of a supersonic projectile on a three-dimensional complex
plasma is studied. Micron sized particles in a low-temperature plasma formed a
large undisturbed system in the new 'Zyflex' chamber during microgravity
conditions. A supersonic probe particle excited a Mach cone with Mach number M
$\approx$ 1.5 -... | physics.plasm-ph | the influence of a supersonic projectile on a threedimensional complex plasma is studied micron sized particles in a lowtemperature plasma formed a large undisturbed system in the new zyflex chamber during microgravity conditions a supersonic probe particle excited a mach cone with mach number m approx 15 2 and double ... | [['the', 'influence', 'of', 'a', 'supersonic', 'projectile', 'on', 'a', 'threedimensional', 'complex', 'plasma', 'is', 'studied', 'micron', 'sized', 'particles', 'in', 'a', 'lowtemperature', 'plasma', 'formed', 'a', 'large', 'undisturbed', 'system', 'in', 'the', 'new', 'zyflex', 'chamber', 'during', 'microgravity', 'co... | [-0.12571206609681834, 0.256078127478286, -0.09477056213837909, 0.03710037297074221, -0.019765866945560023, -0.08604955712817317, -0.012758159569985284, 0.3238907602769653, -0.21997902455087018, -0.3166564557789348, 0.0253332978926643, -0.24927376743083393, -0.00669922079436305, 0.19431192354541124, -0.0093066688759003... |
1,803.00871 | Nanodiamonds-induced effects on neuronal firing of mouse hippocampal
microcircuits | Fluorescent nanodiamonds (FND) are carbon-based nanomaterials that can
efficiently incorporate optically active photoluminescent centers such as the
nitrogen-vacancy complex, thus making them promising candidates as optical
biolabels and drug-delivery agents. FNDs exhibit bright fluorescence without
photobleaching co... | q-bio.NC physics.bio-ph | fluorescent nanodiamonds fnd are carbonbased nanomaterials that can efficiently incorporate optically active photoluminescent centers such as the nitrogenvacancy complex thus making them promising candidates as optical biolabels and drugdelivery agents fnds exhibit bright fluorescence without photobleaching combined wi... | [['fluorescent', 'nanodiamonds', 'fnd', 'are', 'carbonbased', 'nanomaterials', 'that', 'can', 'efficiently', 'incorporate', 'optically', 'active', 'photoluminescent', 'centers', 'such', 'as', 'the', 'nitrogenvacancy', 'complex', 'thus', 'making', 'them', 'promising', 'candidates', 'as', 'optical', 'biolabels', 'and', '... | [-0.09620874522500293, 0.2014965977434655, 0.077740737378862, 0.00455395891632516, -0.03740194949655626, -0.18598303867286534, 0.11975582101060843, 0.43707617823280354, -0.20287746819312955, -0.2848664518649014, 0.03832950804389654, -0.3033057611227641, -0.2527517310868438, 0.1972095813793674, -0.07581950495371756, 0.0... |
1,803.00872 | On Nelson-type Hamiltonians and abstract boundary conditions | We construct Hamiltonians for systems of nonrelativistic particles linearly
coupled to massive scalar bosons using abstract boundary conditions. The
construction yields an explicit characterisation of the domain of
self-adjointness in terms of boundary conditions that relate sectors with
different numbers of bosons. ... | math-ph math.MP | we construct hamiltonians for systems of nonrelativistic particles linearly coupled to massive scalar bosons using abstract boundary conditions the construction yields an explicit characterisation of the domain of selfadjointness in terms of boundary conditions that relate sectors with different numbers of bosons we tr... | [['we', 'construct', 'hamiltonians', 'for', 'systems', 'of', 'nonrelativistic', 'particles', 'linearly', 'coupled', 'to', 'massive', 'scalar', 'bosons', 'using', 'abstract', 'boundary', 'conditions', 'the', 'construction', 'yields', 'an', 'explicit', 'characterisation', 'of', 'the', 'domain', 'of', 'selfadjointness', '... | [-0.1408813637555451, 0.19649378011003923, -0.05880869207022762, 0.10068650573108194, -0.04461707530945942, -0.15683537569979356, -0.05763071498556717, 0.2823681166219349, -0.22203484970472148, -0.2845490554259536, 0.08093797099285734, -0.24656869887021948, -0.11921753461560788, 0.1363054001420686, -0.01371207050475719... |
1,803.00873 | Using Spatial Correlation in Semi-Supervised Hyperspectral Unmixing
under Polynomial Post-nonlinear Mixing Model | This paper presents a semi-supervised hyperspectral unmixing solution that
integrate the spatial information in the abundance estimation procedure. The
proposed method is applied on a nonlinear model based on polynomial
postnonlinear mixing model where characterizes each pixel reflections composed
of nonlinear functi... | eess.SP | this paper presents a semisupervised hyperspectral unmixing solution that integrate the spatial information in the abundance estimation procedure the proposed method is applied on a nonlinear model based on polynomial postnonlinear mixing model where characterizes each pixel reflections composed of nonlinear function o... | [['this', 'paper', 'presents', 'a', 'semisupervised', 'hyperspectral', 'unmixing', 'solution', 'that', 'integrate', 'the', 'spatial', 'information', 'in', 'the', 'abundance', 'estimation', 'procedure', 'the', 'proposed', 'method', 'is', 'applied', 'on', 'a', 'nonlinear', 'model', 'based', 'on', 'polynomial', 'postnonli... | [-0.03122449621939695, 0.04156588674468586, -0.06520676935029901, 0.04650458464180175, -0.09190481829426128, -0.14120364357774842, 0.012873699806535235, 0.425096215433385, -0.26783126621810066, -0.3314321727003812, 0.06304889516722613, -0.2395075593446662, -0.15269853279530352, 0.13643584733391292, -0.07054612532269254... |
1,803.00874 | Estimating Total Search Space Size for Specific Piece Sets in Chess | Automatic chess problem or puzzle composition typically involves generating
and testing various different positions, sometimes using particular piece sets.
Once a position has been generated, it is then usually tested for positional
legality based on the game rules. However, it is useful to be able to estimate
what t... | cs.AI | automatic chess problem or puzzle composition typically involves generating and testing various different positions sometimes using particular piece sets once a position has been generated it is then usually tested for positional legality based on the game rules however it is useful to be able to estimate what the sear... | [['automatic', 'chess', 'problem', 'or', 'puzzle', 'composition', 'typically', 'involves', 'generating', 'and', 'testing', 'various', 'different', 'positions', 'sometimes', 'using', 'particular', 'piece', 'sets', 'once', 'a', 'position', 'has', 'been', 'generated', 'it', 'is', 'then', 'usually', 'tested', 'for', 'posit... | [-0.021924809007140906, 0.06932830922097079, -0.13027674907387526, 0.09458253112857912, -0.13672137098932471, -0.12680990642761414, 0.08494406659156084, 0.39454518884086787, -0.26040364470824007, -0.37682565468692436, 0.1525245077933523, -0.24596378411078335, -0.11984939178578156, 0.21161093169114373, -0.05690749758734... |
1,803.00875 | Supercritical Poincar\'e-Andronov-Hopf bifurcation in a mean field
quantum laser equation | We deal with the dynamical system properties of a
Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) equation with mean-field
Hamiltonian that models a simple laser by applying a mean field approximation
to a quantum system describing a single-mode optical cavity and a set of two
level atoms, each coupled to a reservoir. W... | math-ph math.FA math.MP math.PR nlin.CD quant-ph | we deal with the dynamical system properties of a gorinikossakowskisudarshanlindblad gksl equation with meanfield hamiltonian that models a simple laser by applying a mean field approximation to a quantum system describing a singlemode optical cavity and a set of two level atoms each coupled to a reservoir we prove tha... | [['we', 'deal', 'with', 'the', 'dynamical', 'system', 'properties', 'of', 'a', 'gorinikossakowskisudarshanlindblad', 'gksl', 'equation', 'with', 'meanfield', 'hamiltonian', 'that', 'models', 'a', 'simple', 'laser', 'by', 'applying', 'a', 'mean', 'field', 'approximation', 'to', 'a', 'quantum', 'system', 'describing', 'a... | [-0.14642337430926705, 0.1550395190732244, -0.13884231248580894, 0.053038944490151084, 0.01008352050360279, -0.1595044791070718, 0.07840722944347234, 0.3126840388045281, -0.2735304748565419, -0.19870161071794878, 0.0927462573284563, -0.2601865247770644, -0.112401366316098, 0.19205391876047392, -0.01906245826396354, 0.0... |
1,803.00876 | fCDN: A Flexible and Efficient CDN Infrastructure without DNS
Redirection or Content Reflection | Flexible and efficient CDNs are critical to facilitate content distribution
in 5G+ architectures. Current CDNs suffer from inefficient request mapping
based on DNS redirection, and inefficient content distribution from origin to
edge servers, through content reflection. We proposes a novel, flexible CDN
architecture ... | cs.NI | flexible and efficient cdns are critical to facilitate content distribution in 5g architectures current cdns suffer from inefficient request mapping based on dns redirection and inefficient content distribution from origin to edge servers through content reflection we proposes a novel flexible cdn architecture that rem... | [['flexible', 'and', 'efficient', 'cdns', 'are', 'critical', 'to', 'facilitate', 'content', 'distribution', 'in', '5g', 'architectures', 'current', 'cdns', 'suffer', 'from', 'inefficient', 'request', 'mapping', 'based', 'on', 'dns', 'redirection', 'and', 'inefficient', 'content', 'distribution', 'from', 'origin', 'to',... | [-0.18274084801959012, -0.002935429218575939, -0.023856100259405193, 0.028022672530985338, -0.10588076539353762, -0.17765001509765976, 0.1703067593033591, 0.4330425268539038, -0.30202782802380523, -0.3149040935931977, 0.07665075649491217, -0.27719877727402303, -0.14919687197563838, 0.13732913708882769, -0.0894955082502... |
1,803.00877 | The last zero crossing of an iterated Brownian motion with drift | In this paper we consider the iterated Brownian motion $
^{\mu_1}_{\mu_2}\!I(t) = B_1^{\mu_1} ( | B_{2}^{\mu_2} (t)|) $ where
$B_j^{\mu_j} , j=1,2$ are two independent Brownian motions with drift $\mu_j$.
Here we study the last zero crossing of $ ^{\mu_1}_{\mu_2}\!I(t) $ and for this
purpose we derive the last zero-c... | math.PR | in this paper we consider the iterated brownian motion mu_1_mu_2it b_1mu_1 b_2mu_2 t where b_jmu_j j12 are two independent brownian motions with drift mu_j here we study the last zero crossing of mu_1_mu_2it and for this purpose we derive the last zerocrossing distribution of the drifted brownian motion we derive also ... | [['in', 'this', 'paper', 'we', 'consider', 'the', 'iterated', 'brownian', 'motion', 'mu_1_mu_2it', 'b_1mu_1', 'b_2mu_2', 't', 'where', 'b_jmu_j', 'j12', 'are', 'two', 'independent', 'brownian', 'motions', 'with', 'drift', 'mu_j', 'here', 'we', 'study', 'the', 'last', 'zero', 'crossing', 'of', 'mu_1_mu_2it', 'and', 'for... | [-0.14825707768764476, 0.19105803559871454, -0.08650714059456668, 0.010160334689285734, -0.022694100629827327, -0.12842470780014992, 0.05664754362379458, 0.3671315123471592, -0.29244932084312214, -0.21473888597932367, 0.08644545785099236, -0.2741425120279771, -0.08219697650778911, 0.12122572817365992, -0.03619175695687... |
1,803.00878 | Sunspot Equilibrium in General Quitting Games | We prove that positive recursive general quitting games, which are quitting
games in which each player may have more than one continue action, admit a
sunspot $\ep$-equilibrium, for every $\ep > 0$. To this end we show that the
equilibrium set of strategic-form games can be uniformly approximated by a
smooth manifold... | math.PR | we prove that positive recursive general quitting games which are quitting games in which each player may have more than one continue action admit a sunspot epequilibrium for every ep 0 to this end we show that the equilibrium set of strategicform games can be uniformly approximated by a smooth manifold and develop a n... | [['we', 'prove', 'that', 'positive', 'recursive', 'general', 'quitting', 'games', 'which', 'are', 'quitting', 'games', 'in', 'which', 'each', 'player', 'may', 'have', 'more', 'than', 'one', 'continue', 'action', 'admit', 'a', 'sunspot', 'epequilibrium', 'for', 'every', 'ep', '0', 'to', 'this', 'end', 'we', 'show', 'tha... | [-0.10097654384056416, 0.09877467051458856, -0.17820115921398003, 0.12041730997734704, -0.07697670203633607, -0.24626341397718837, 0.03796449720781917, 0.3988339725881815, -0.2524174629400174, -0.19821896245703102, 0.10766181649135736, -0.2415798322763294, -0.18102846040079992, 0.14758180013256303, -0.15766520001925527... |
1,803.00879 | Probabilistic design of a molybdenum-base alloy using a neural network | An artificial intelligence tool is exploited to discover and characterize a
new molybdenum-base alloy that is the most likely to simultaneously satisfy
targets of cost, phase stability, precipitate content, yield stress, and
hardness. Experimental testing demonstrates that the proposed alloy fulfils the
computational... | cond-mat.mtrl-sci cs.LG physics.comp-ph | an artificial intelligence tool is exploited to discover and characterize a new molybdenumbase alloy that is the most likely to simultaneously satisfy targets of cost phase stability precipitate content yield stress and hardness experimental testing demonstrates that the proposed alloy fulfils the computational predict... | [['an', 'artificial', 'intelligence', 'tool', 'is', 'exploited', 'to', 'discover', 'and', 'characterize', 'a', 'new', 'molybdenumbase', 'alloy', 'that', 'is', 'the', 'most', 'likely', 'to', 'simultaneously', 'satisfy', 'targets', 'of', 'cost', 'phase', 'stability', 'precipitate', 'content', 'yield', 'stress', 'and', 'h... | [-0.047837052159338145, 0.1054167260210083, -0.1022050356851858, 0.03958124772384109, -0.08401588994290746, -0.16980159067826575, 0.04606820590663375, 0.3882706707768273, -0.2698203019671175, -0.3371530541529258, 0.0638666404942214, -0.2815834114311688, -0.15876312660903, 0.23950190631378637, -0.06546670991698639, 0.10... |
1,803.0088 | A comparative study of stochastic resonance for a model with two
pathways by escape times, linear response, invariant measures and the
conditional Kolmogorov-Smirnov Test | We consider stochastic resonance for a diffusion with drift given by a
potential, which has two metastable states and two pathways between them.
Depending on the direction of the forcing, the height of the two barriers, one
for each path, will either oscillate alternating or in synchronisation. We
consider a simplifi... | math.PR math-ph math.MP physics.data-an physics.geo-ph | we consider stochastic resonance for a diffusion with drift given by a potential which has two metastable states and two pathways between them depending on the direction of the forcing the height of the two barriers one for each path will either oscillate alternating or in synchronisation we consider a simplified model... | [['we', 'consider', 'stochastic', 'resonance', 'for', 'a', 'diffusion', 'with', 'drift', 'given', 'by', 'a', 'potential', 'which', 'has', 'two', 'metastable', 'states', 'and', 'two', 'pathways', 'between', 'them', 'depending', 'on', 'the', 'direction', 'of', 'the', 'forcing', 'the', 'height', 'of', 'the', 'two', 'barri... | [-0.14819136064385627, 0.14992563320041274, -0.06844573536521542, 0.10328939393317947, -0.03857413299459343, -0.17449007534887642, 0.029981961241477013, 0.3537193057204907, -0.2816619255181043, -0.26259936079538115, 0.09192141509362652, -0.2577937816133878, -0.11545745905508133, 0.1794696168382264, -0.01145780320318105... |
1,803.00881 | Identifying Driver Behaviors using Trajectory Features for Vehicle
Navigation | We present a novel approach to automatically identify driver behaviors from
vehicle trajectories and use them for safe navigation of autonomous vehicles.
We propose a novel set of features that can be easily extracted from car
trajectories. We derive a data-driven mapping between these features and six
driver behavio... | cs.RO | we present a novel approach to automatically identify driver behaviors from vehicle trajectories and use them for safe navigation of autonomous vehicles we propose a novel set of features that can be easily extracted from car trajectories we derive a datadriven mapping between these features and six driver behaviors us... | [['we', 'present', 'a', 'novel', 'approach', 'to', 'automatically', 'identify', 'driver', 'behaviors', 'from', 'vehicle', 'trajectories', 'and', 'use', 'them', 'for', 'safe', 'navigation', 'of', 'autonomous', 'vehicles', 'we', 'propose', 'a', 'novel', 'set', 'of', 'features', 'that', 'can', 'be', 'easily', 'extracted',... | [-0.11001363741413045, 0.05146005763708672, -0.10890165330895868, 0.06185724211144798, -0.12915277693313187, -0.18304288627741, 0.09958817241288041, 0.4269142894504162, -0.2528920546688963, -0.33832006974933815, 0.0849021101368215, -0.2676566856769988, -0.2211749857009496, 0.23349329986824438, -0.12899513899062115, 0.0... |
1,803.00882 | Temporal Graph Classes: A View Through Temporal Separators | We investigate the computational complexity of separating two distinct
vertices s and z by vertex deletion in a temporal graph. In a temporal graph,
the vertex set is fixed but the edges have (discrete) time labels. Since the
corresponding Temporal (s, z)-Separation problem is NP-hard, it is natural to
investigate wh... | cs.CC | we investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph in a temporal graph the vertex set is fixed but the edges have discrete time labels since the corresponding temporal s zseparation problem is nphard it is natural to investigate whether relevan... | [['we', 'investigate', 'the', 'computational', 'complexity', 'of', 'separating', 'two', 'distinct', 'vertices', 's', 'and', 'z', 'by', 'vertex', 'deletion', 'in', 'a', 'temporal', 'graph', 'in', 'a', 'temporal', 'graph', 'the', 'vertex', 'set', 'is', 'fixed', 'but', 'the', 'edges', 'have', 'discrete', 'time', 'labels',... | [-0.1429580970889046, 0.09527914233927039, -0.01660740225620213, 0.11420402404120458, -0.13441148753987536, -0.170216646772765, 0.0806874102003695, 0.43844589363960995, -0.3348425497700061, -0.28504224298965364, 0.09171008037491923, -0.2424033807346686, -0.15566221950464837, 0.08180416932418233, -0.08080912530865697, 0... |
1,803.00883 | The Shape of Alerts: Detecting Malware Using Distributed Detectors by
Robustly Amplifying Transient Correlations | We introduce a new malware detector - Shape-GD - that aggregates per-machine
detectors into a robust global detector. Shape-GD is based on two insights: 1.
Structural: actions such as visiting a website (waterhole attack) by nodes
correlate well with malware spread, and create dynamic neighborhoods of nodes
that were... | cs.CR | we introduce a new malware detector shapegd that aggregates permachine detectors into a robust global detector shapegd is based on two insights 1 structural actions such as visiting a website waterhole attack by nodes correlate well with malware spread and create dynamic neighborhoods of nodes that were exposed to the ... | [['we', 'introduce', 'a', 'new', 'malware', 'detector', 'shapegd', 'that', 'aggregates', 'permachine', 'detectors', 'into', 'a', 'robust', 'global', 'detector', 'shapegd', 'is', 'based', 'on', 'two', 'insights', '1', 'structural', 'actions', 'such', 'as', 'visiting', 'a', 'website', 'waterhole', 'attack', 'by', 'nodes'... | [-0.09786921919533803, 0.1083839053108785, -0.04462742429797448, 0.09253219159905829, -0.06680813029168113, -0.2257273042758536, 0.1280680332212679, 0.35155995280271574, -0.22130449399231902, -0.37697843232702827, 0.10968292212909869, -0.40537121414897903, -0.09335255878414178, 0.16653622619717592, -0.12244680034402278... |
1,803.00884 | Physical Layer Security for RF Satellite Channels in the Finite-length
Regime | Secure communications is becoming increasingly relevant in the development of
space technology. Well established cryptographic technology is already in place
and is expected to continue to be so. On the other hand, information
theoretical security emerges as a post-quantum versatile candidate to
complement overall se... | cs.IT math.IT | secure communications is becoming increasingly relevant in the development of space technology well established cryptographic technology is already in place and is expected to continue to be so on the other hand information theoretical security emerges as a postquantum versatile candidate to complement overall security... | [['secure', 'communications', 'is', 'becoming', 'increasingly', 'relevant', 'in', 'the', 'development', 'of', 'space', 'technology', 'well', 'established', 'cryptographic', 'technology', 'is', 'already', 'in', 'place', 'and', 'is', 'expected', 'to', 'continue', 'to', 'be', 'so', 'on', 'the', 'other', 'hand', 'informati... | [-0.2344270782122909, -0.024205386993484214, -0.048090433456787936, 0.07280568054430413, -0.07243035427437952, -0.2931771549614908, 0.13060465546255093, 0.38797446676654374, -0.26633348616183194, -0.2766649369301222, 0.11170007895512378, -0.2306175552881681, -0.1610979621113855, 0.19687187334386866, -0.1695013866799427... |
1,803.00885 | Essentially No Barriers in Neural Network Energy Landscape | Training neural networks involves finding minima of a high-dimensional
non-convex loss function. Knowledge of the structure of this energy landscape
is sparse. Relaxing from linear interpolations, we construct continuous paths
between minima of recent neural network architectures on CIFAR10 and CIFAR100.
Surprisingly... | stat.ML cs.AI cs.LG | training neural networks involves finding minima of a highdimensional nonconvex loss function knowledge of the structure of this energy landscape is sparse relaxing from linear interpolations we construct continuous paths between minima of recent neural network architectures on cifar10 and cifar100 surprisingly the pat... | [['training', 'neural', 'networks', 'involves', 'finding', 'minima', 'of', 'a', 'highdimensional', 'nonconvex', 'loss', 'function', 'knowledge', 'of', 'the', 'structure', 'of', 'this', 'energy', 'landscape', 'is', 'sparse', 'relaxing', 'from', 'linear', 'interpolations', 'we', 'construct', 'continuous', 'paths', 'betwe... | [-0.12663250056269404, 0.07051441387611103, -0.06549447370631682, 0.09381349180482206, -0.06693031703336881, -0.18361864669330336, 0.04351553373591422, 0.43098453736024817, -0.30694818910170385, -0.31124333677951577, 0.06363464671872802, -0.28521979970161565, -0.2537342201212196, 0.13627419624078488, -0.097155841425634... |
1,803.00886 | Deep factorization for speech signal | Various informative factors mixed in speech signals, leading to great
difficulty when decoding any of the factors. An intuitive idea is to factorize
each speech frame into individual informative factors, though it turns out to
be highly difficult. Recently, we found that speaker traits, which were assumed
to be long-... | eess.AS cs.CL cs.LG cs.SD | various informative factors mixed in speech signals leading to great difficulty when decoding any of the factors an intuitive idea is to factorize each speech frame into individual informative factors though it turns out to be highly difficult recently we found that speaker traits which were assumed to be longterm dist... | [['various', 'informative', 'factors', 'mixed', 'in', 'speech', 'signals', 'leading', 'to', 'great', 'difficulty', 'when', 'decoding', 'any', 'of', 'the', 'factors', 'an', 'intuitive', 'idea', 'is', 'to', 'factorize', 'each', 'speech', 'frame', 'into', 'individual', 'informative', 'factors', 'though', 'it', 'turns', 'o... | [-0.032621410413229336, 0.07755229235914135, -0.1283378281448265, 0.08520070548424111, -0.12871703069727375, -0.17960232895734551, -0.009624048067350526, 0.455852335318923, -0.2993219546481686, -0.29460401589903135, 0.06926274455940269, -0.2377897448744039, -0.24417796790154664, 0.18046446282522016, -0.1272377220902053... |
1,803.00887 | Power series solution of the inhomogeneous exclusion process | We develop a power series method for the nonequilibrium steady state of the
inhomogeneous one-dimensional totally asymmetric simple exclusion process
(TASEP) in contact with two particle reservoirs and with site-dependent hopping
rates in the bulk. The power series is performed in the entrance or exit rates
governing... | cond-mat.stat-mech math-ph math.MP | we develop a power series method for the nonequilibrium steady state of the inhomogeneous onedimensional totally asymmetric simple exclusion process tasep in contact with two particle reservoirs and with sitedependent hopping rates in the bulk the power series is performed in the entrance or exit rates governing partic... | [['we', 'develop', 'a', 'power', 'series', 'method', 'for', 'the', 'nonequilibrium', 'steady', 'state', 'of', 'the', 'inhomogeneous', 'onedimensional', 'totally', 'asymmetric', 'simple', 'exclusion', 'process', 'tasep', 'in', 'contact', 'with', 'two', 'particle', 'reservoirs', 'and', 'with', 'sitedependent', 'hopping',... | [-0.10540588933335089, 0.16294112654382, -0.04912956973621205, 0.05440115008237192, -0.013127428854801762, -0.15325859972665004, 0.04662911905933158, 0.3605778986073808, -0.30987590021773503, -0.25280438690905027, 0.10054104226648307, -0.23491537736975518, -0.08170448763316858, 0.18898866228488231, 0.000891598678235687... |
1,803.00888 | Tetragonal-orthorhombic phase coexistence under magnetic fields in
BaFe$_2$As$_2$ and Sr(Fe$_{1-x}$Co$_{x}$)$_2$As$_2$: evidence of magnetically
driven structural transition | Synchrotron x-ray diffraction experiments were performed on BaFe$_2$As$_2$
and Sr(Fe$_{1-x}$Co$_{x}$)$_2$As$_2$ single crystals as a function of
temperature and applied magnetic field along the tetragonal $[1 \bar{1} 0]$
direction, complemented by electrical resistivity and specific heat
experiments. For a BaFe$_2$As... | cond-mat.supr-con cond-mat.str-el | synchrotron xray diffraction experiments were performed on bafe_2as_2 and srfe_1xco_x_2as_2 single crystals as a function of temperature and applied magnetic field along the tetragonal 1 bar1 0 direction complemented by electrical resistivity and specific heat experiments for a bafe_2as_2 crystal with spindensitywave a... | [['synchrotron', 'xray', 'diffraction', 'experiments', 'were', 'performed', 'on', 'bafe_2as_2', 'and', 'srfe_1xco_x_2as_2', 'single', 'crystals', 'as', 'a', 'function', 'of', 'temperature', 'and', 'applied', 'magnetic', 'field', 'along', 'the', 'tetragonal', '1', 'bar1', '0', 'direction', 'complemented', 'by', 'electri... | [-0.16757524673956126, 0.2725299181721854, 0.012656373273142996, -0.03610693639097344, -0.08677622463804584, -0.14628057562973068, 0.1552017016117187, 0.4579043271873115, -0.2378722793508728, -0.2715873833620498, 0.0005188917118993376, -0.3750394522955939, -0.02956986940708481, 0.1612251568937815, 0.14604963558655576, ... |
1,803.00889 | Scalable Bayesian uncertainty quantification in imaging inverse problems
via convex optimization | We propose a Bayesian uncertainty quantification method for large-scale
imaging inverse problems. Our method applies to all Bayesian models that are
log-concave, where maximum-a-posteriori (MAP) estimation is a convex
optimization problem. The method is a framework to analyse the confidence in
specific structures obs... | stat.ME astro-ph.IM | we propose a bayesian uncertainty quantification method for largescale imaging inverse problems our method applies to all bayesian models that are logconcave where maximumaposteriori map estimation is a convex optimization problem the method is a framework to analyse the confidence in specific structures observed in ma... | [['we', 'propose', 'a', 'bayesian', 'uncertainty', 'quantification', 'method', 'for', 'largescale', 'imaging', 'inverse', 'problems', 'our', 'method', 'applies', 'to', 'all', 'bayesian', 'models', 'that', 'are', 'logconcave', 'where', 'maximumaposteriori', 'map', 'estimation', 'is', 'a', 'convex', 'optimization', 'prob... | [-0.012262942454846645, -0.00105566479679611, -0.10366878556831377, 0.12618607949655228, -0.1320481354896738, -0.149900786796395, 0.059572293792303686, 0.4150950267428049, -0.3032134366340297, -0.337066288770142, 0.15224184488114487, -0.22941866096873667, -0.188968334161338, 0.201517759460128, -0.11791351688926052, 0.1... |
1,803.0089 | The no information at a distance principle and local mathematics: some
effects on physics and geometry | Local mathematics assumes the existence of number structures of different
types, vector spaces, etc. localized at each space time point. Relations
between number structures at different locations are based on two aspects:
distinction between two so far conflated concepts, number and number value and
the "No informati... | quant-ph gr-qc hep-th math-ph math.MP | local mathematics assumes the existence of number structures of different types vector spaces etc localized at each space time point relations between number structures at different locations are based on two aspects distinction between two so far conflated concepts number and number value and the no information at a d... | [['local', 'mathematics', 'assumes', 'the', 'existence', 'of', 'number', 'structures', 'of', 'different', 'types', 'vector', 'spaces', 'etc', 'localized', 'at', 'each', 'space', 'time', 'point', 'relations', 'between', 'number', 'structures', 'at', 'different', 'locations', 'are', 'based', 'on', 'two', 'aspects', 'dist... | [-0.1801885739718118, 0.16127973094661818, -0.058120156458004356, 0.08874935067080438, -0.10591502115526732, -0.09687223810544039, 0.026238801858903087, 0.34206697258781243, -0.2757633058076843, -0.3460518957749802, 0.054327461630740065, -0.2606370642959596, -0.0947615720836961, 0.18077629565439643, 0.01346966017587506... |
1,803.00891 | Monocular Depth Estimation using Multi-Scale Continuous CRFs as
Sequential Deep Networks | Depth cues have been proved very useful in various computer vision and
robotic tasks. This paper addresses the problem of monocular depth estimation
from a single still image. Inspired by the effectiveness of recent works on
multi-scale convolutional neural networks (CNN), we propose a deep model which
fuses compleme... | cs.CV | depth cues have been proved very useful in various computer vision and robotic tasks this paper addresses the problem of monocular depth estimation from a single still image inspired by the effectiveness of recent works on multiscale convolutional neural networks cnn we propose a deep model which fuses complementary in... | [['depth', 'cues', 'have', 'been', 'proved', 'very', 'useful', 'in', 'various', 'computer', 'vision', 'and', 'robotic', 'tasks', 'this', 'paper', 'addresses', 'the', 'problem', 'of', 'monocular', 'depth', 'estimation', 'from', 'a', 'single', 'still', 'image', 'inspired', 'by', 'the', 'effectiveness', 'of', 'recent', 'w... | [-0.051171479275010624, 0.0018407690660654672, -0.06619863293461568, 0.028597739647754285, -0.08058889741739313, -0.18344970328248375, -0.007028996350640464, 0.4744076476096225, -0.27160242077007274, -0.3147990126658738, 0.07980601035593045, -0.21625644817242962, -0.22594648669749365, 0.22923153481782366, -0.1325192094... |
1,803.00892 | A Framework for Blockchain-Based Applications | Blockchains have recently generated explosive interest from both academia and
industry, with many proposed applications. But descriptions of many these
proposals are more visionary projections than realizable proposals, and even
basic definitions are often missing. We define "blockchain" and "blockchain
network", and... | cs.CY cs.CR | blockchains have recently generated explosive interest from both academia and industry with many proposed applications but descriptions of many these proposals are more visionary projections than realizable proposals and even basic definitions are often missing we define blockchain and blockchain network and then discu... | [['blockchains', 'have', 'recently', 'generated', 'explosive', 'interest', 'from', 'both', 'academia', 'and', 'industry', 'with', 'many', 'proposed', 'applications', 'but', 'descriptions', 'of', 'many', 'these', 'proposals', 'are', 'more', 'visionary', 'projections', 'than', 'realizable', 'proposals', 'and', 'even', 'b... | [-0.0918634969164573, 0.044473825049487735, -0.06273311761296577, 0.11068219141129197, -0.12428149723610471, -0.2152014809424087, 0.022529676161144697, 0.4051981328557881, -0.30888417697260306, -0.2968742402694521, 0.1637387305326272, -0.28812702995769324, -0.16678272987649376, 0.18915751593978336, -0.12619714825488035... |
1,803.00893 | Dose Delivery Concept and Instrumentation | Radiation therapy aims to deliver the prescribed amount of dose to a tumour
at the same time as sparing the surrounding tissues as much as possible. In
charged particle therapy, delivering the prescribed dose is equivalent to
delivering the prescribed number of ions of a given energy at each position of
the irradiati... | physics.med-ph physics.acc-ph | radiation therapy aims to deliver the prescribed amount of dose to a tumour at the same time as sparing the surrounding tissues as much as possible in charged particle therapy delivering the prescribed dose is equivalent to delivering the prescribed number of ions of a given energy at each position of the irradiation f... | [['radiation', 'therapy', 'aims', 'to', 'deliver', 'the', 'prescribed', 'amount', 'of', 'dose', 'to', 'a', 'tumour', 'at', 'the', 'same', 'time', 'as', 'sparing', 'the', 'surrounding', 'tissues', 'as', 'much', 'as', 'possible', 'in', 'charged', 'particle', 'therapy', 'delivering', 'the', 'prescribed', 'dose', 'is', 'eq... | [-0.05929216628139154, 0.1469091403134967, -0.04505496400692579, 0.04814104165942382, -0.015051075820363847, -0.17643727602352952, -0.000702499166015262, 0.42913662682229514, -0.200987327757744, -0.33252069145035906, 0.06562163259197384, -0.28284521958143527, -0.001434161794098294, 0.21999380406417152, -0.0806017737114... |
1,803.00894 | Sparse Identification of Nonlinear Dynamics for Rapid Model Recovery | Big data has become a critically enabling component of emerging mathematical
methods aimed at the automated discovery of dynamical systems, where first
principles modeling may be intractable. However, in many engineering systems,
abrupt changes must be rapidly characterized based on limited, incomplete, and
noisy dat... | physics.data-an nlin.AO | big data has become a critically enabling component of emerging mathematical methods aimed at the automated discovery of dynamical systems where first principles modeling may be intractable however in many engineering systems abrupt changes must be rapidly characterized based on limited incomplete and noisy data many l... | [['big', 'data', 'has', 'become', 'a', 'critically', 'enabling', 'component', 'of', 'emerging', 'mathematical', 'methods', 'aimed', 'at', 'the', 'automated', 'discovery', 'of', 'dynamical', 'systems', 'where', 'first', 'principles', 'modeling', 'may', 'be', 'intractable', 'however', 'in', 'many', 'engineering', 'system... | [-0.09154699991182001, 0.051317589002031705, -0.0769802377421663, 0.06726428698854182, -0.08648529974955388, -0.17556806659558788, 0.07841892889489166, 0.3715939386832443, -0.2846738989697769, -0.34689820774894375, 0.1582280999065419, -0.25263000433333216, -0.20778371872994203, 0.1862403367910619, -0.10114150729072703,... |
1,803.00895 | Observational constraints on Gauss-Bonnet cosmology | We analyze a fully geometric approach to dark energy in the framework of
$F(R,{\cal G})$ theories of gravity, where $R$ is the Ricci curvature scalar
and ${\cal G}$ is the Gauss-Bonnet topological invariant. The latter invariant
naturally exhausts, together with $R$, the whole curvature content related to
curvature i... | gr-qc astro-ph.CO hep-th | we analyze a fully geometric approach to dark energy in the framework of frcal g theories of gravity where r is the ricci curvature scalar and cal g is the gaussbonnet topological invariant the latter invariant naturally exhausts together with r the whole curvature content related to curvature invariants coming from th... | [['we', 'analyze', 'a', 'fully', 'geometric', 'approach', 'to', 'dark', 'energy', 'in', 'the', 'framework', 'of', 'frcal', 'g', 'theories', 'of', 'gravity', 'where', 'r', 'is', 'the', 'ricci', 'curvature', 'scalar', 'and', 'cal', 'g', 'is', 'the', 'gaussbonnet', 'topological', 'invariant', 'the', 'latter', 'invariant',... | [-0.12757827632195146, 0.11216347600497523, -0.0991457458205777, 0.047116956175424864, -0.11810983979051269, -0.07895199740665282, -0.030675645406026186, 0.31530333617529754, -0.2438012520330978, -0.33761708071463353, 0.0909446696945678, -0.3008379741719736, -0.07324397239170553, 0.17303448239972918, -0.022526429766237... |
1,803.00896 | Hausdorff Morita Equivalence of singular foliations | We introduce a notion of equivalence for singular foliations - understood as
suitable families of vector fields - that preserves their transverse geometry.
Associated to every singular foliation there is a holonomy groupoid, by the
work of Androulidakis-Skandalis. We show that our notion of equivalence is
compatible ... | math.DG | we introduce a notion of equivalence for singular foliations understood as suitable families of vector fields that preserves their transverse geometry associated to every singular foliation there is a holonomy groupoid by the work of androulidakisskandalis we show that our notion of equivalence is compatible with this ... | [['we', 'introduce', 'a', 'notion', 'of', 'equivalence', 'for', 'singular', 'foliations', 'understood', 'as', 'suitable', 'families', 'of', 'vector', 'fields', 'that', 'preserves', 'their', 'transverse', 'geometry', 'associated', 'to', 'every', 'singular', 'foliation', 'there', 'is', 'a', 'holonomy', 'groupoid', 'by', ... | [-0.2088987502073379, 0.11528383800759912, -0.12249584546263673, 0.11584161335792344, -0.10086710415290374, -0.11238574281359386, -0.04683808511196587, 0.37995455070937934, -0.3039822495468941, -0.20189929121222935, 0.06823898607246137, -0.23226990442919104, -0.2080874325658538, 0.19956919074741708, -0.1598038894222363... |
1,803.00897 | Impact of Biases in Big Data | The underlying paradigm of big data-driven machine learning reflects the
desire of deriving better conclusions from simply analyzing more data, without
the necessity of looking at theory and models. Is having simply more data
always helpful? In 1936, The Literary Digest collected 2.3M filled in
questionnaires to pred... | cs.LG | the underlying paradigm of big datadriven machine learning reflects the desire of deriving better conclusions from simply analyzing more data without the necessity of looking at theory and models is having simply more data always helpful in 1936 the literary digest collected 23m filled in questionnaires to predict the ... | [['the', 'underlying', 'paradigm', 'of', 'big', 'datadriven', 'machine', 'learning', 'reflects', 'the', 'desire', 'of', 'deriving', 'better', 'conclusions', 'from', 'simply', 'analyzing', 'more', 'data', 'without', 'the', 'necessity', 'of', 'looking', 'at', 'theory', 'and', 'models', 'is', 'having', 'simply', 'more', '... | [-0.02218545830030714, 0.07856979857569968, -0.12319062970957682, 0.13897723890642572, -0.16887148534244095, -0.17348026905727404, 0.07988177384554133, 0.3787367793636143, -0.2518741273068537, -0.3586289370088542, 0.07630808453210523, -0.30075216869590804, -0.12741849645019762, 0.202888963560161, -0.14875724719075317, ... |
1,803.00898 | The split in the ancient cold front in the Perseus cluster | Sloshing cold fronts in clusters, produced as the dense cluster core moves
around in the cluster potential in response to in-falling subgroups, provide a
powerful probe of the physics of the intracluster medium (ICM), and the
magnetic fields permeating it. These sharp discontinuities in density and
temperature rise g... | astro-ph.HE astro-ph.GA | sloshing cold fronts in clusters produced as the dense cluster core moves around in the cluster potential in response to infalling subgroups provide a powerful probe of the physics of the intracluster medium icm and the magnetic fields permeating it these sharp discontinuities in density and temperature rise gradually ... | [['sloshing', 'cold', 'fronts', 'in', 'clusters', 'produced', 'as', 'the', 'dense', 'cluster', 'core', 'moves', 'around', 'in', 'the', 'cluster', 'potential', 'in', 'response', 'to', 'infalling', 'subgroups', 'provide', 'a', 'powerful', 'probe', 'of', 'the', 'physics', 'of', 'the', 'intracluster', 'medium', 'icm', 'and... | [-0.10369974998397063, 0.19275367689365264, -0.10841139969647506, 0.06259506197005654, -0.07703723656383636, -0.028728027008628237, 0.038818323620703095, 0.42212735165620624, -0.27096844677947135, -0.32272500499506684, 0.06791627687499832, -0.27148485320150073, -0.030820671312037588, 0.16381607697865005, 0.023475585739... |
1,803.00899 | Service-based Fog architecture without DNS redirection | The heterogeneous and distributed nature of the Internet of Things (IoT) is
driving the need for extremely fast and fine-grained service provisioning in
5/5+G architectures and beyond. To meet these needs, it is critical to enable
efficient and flexible computation and networking fabrics, that can be rapidly
reconfig... | cs.NI | the heterogeneous and distributed nature of the internet of things iot is driving the need for extremely fast and finegrained service provisioning in 55g architectures and beyond to meet these needs it is critical to enable efficient and flexible computation and networking fabrics that can be rapidly reconfigured to me... | [['the', 'heterogeneous', 'and', 'distributed', 'nature', 'of', 'the', 'internet', 'of', 'things', 'iot', 'is', 'driving', 'the', 'need', 'for', 'extremely', 'fast', 'and', 'finegrained', 'service', 'provisioning', 'in', '55g', 'architectures', 'and', 'beyond', 'to', 'meet', 'these', 'needs', 'it', 'is', 'critical', 't... | [-0.22086088399090498, -0.0021813457300551907, -0.005275747533831857, 0.006111495799111749, -0.12917429090527718, -0.21460954997616033, 0.1222052521164345, 0.44331923481857705, -0.28961709704428557, -0.31347138903098193, 0.093904092347439, -0.22851802539749594, -0.19539517038892174, 0.19670533175820004, -0.134057916244... |
1,803.009 | Slotted CSMA/CA Based Energy Efficient MAC Protocol Design in
Nanonetworks | Devices in a beacon-enabled network use slotted CSMA/CA to contend for
channel usage. Each node in the network competes for the channels when ready to
transmit data. The slotted CSMA/CA mechanism based on the super-frame structure
fairly provides communication chance for each node and makes a reasonable usage
of the ... | cs.NI cs.IT math.IT | devices in a beaconenabled network use slotted csmaca to contend for channel usage each node in the network competes for the channels when ready to transmit data the slotted csmaca mechanism based on the superframe structure fairly provides communication chance for each node and makes a reasonable usage of the availabl... | [['devices', 'in', 'a', 'beaconenabled', 'network', 'use', 'slotted', 'csmaca', 'to', 'contend', 'for', 'channel', 'usage', 'each', 'node', 'in', 'the', 'network', 'competes', 'for', 'the', 'channels', 'when', 'ready', 'to', 'transmit', 'data', 'the', 'slotted', 'csmaca', 'mechanism', 'based', 'on', 'the', 'superframe'... | [-0.2517402765208057, 0.014222263756944032, -0.029637484019622205, 0.011238037058917273, -0.06567765787642982, -0.29385499522489095, 0.13306644004520163, 0.4434479632414877, -0.2561120038319911, -0.24763300358983023, 0.04339340228886743, -0.2577262948400208, -0.15721199414193895, 0.13506533043858196, -0.127309488019506... |
1,803.00901 | The fundamental group of an algebra with strongly simply connected
Galois covering | In this work, we prove that if a triangular algebra $A$ admits a strongly
simply connected universal Galois covering for a given presentation then the
fundamental group associated to this presentation is free.
| math.RT | in this work we prove that if a triangular algebra a admits a strongly simply connected universal galois covering for a given presentation then the fundamental group associated to this presentation is free | [['in', 'this', 'work', 'we', 'prove', 'that', 'if', 'a', 'triangular', 'algebra', 'a', 'admits', 'a', 'strongly', 'simply', 'connected', 'universal', 'galois', 'covering', 'for', 'a', 'given', 'presentation', 'then', 'the', 'fundamental', 'group', 'associated', 'to', 'this', 'presentation', 'is', 'free']] | [-0.17938197703298295, 0.13939579838717525, -0.13801525173370133, 0.013263973728471407, -0.1857302297104263, -0.13694990273903718, 0.025953611020337452, 0.35486787320538, -0.37176628477137647, -0.15632267801486183, 0.11623589654636542, -0.21074901498628384, -0.17940705006405938, 0.22063665969692398, -0.1718694030335455... |
1,803.00902 | DEMorphy, German Language Morphological Analyzer | DEMorphy is a morphological analyzer for German. It is built onto large,
compactified lexicons from German Morphological Dictionary. A guesser based on
German declension suffixed is also provided. For German, we provided a
state-of-art morphological analyzer. DEMorphy is implemented in Python with
ease of usability a... | cs.CL | demorphy is a morphological analyzer for german it is built onto large compactified lexicons from german morphological dictionary a guesser based on german declension suffixed is also provided for german we provided a stateofart morphological analyzer demorphy is implemented in python with ease of usability and accompa... | [['demorphy', 'is', 'a', 'morphological', 'analyzer', 'for', 'german', 'it', 'is', 'built', 'onto', 'large', 'compactified', 'lexicons', 'from', 'german', 'morphological', 'dictionary', 'a', 'guesser', 'based', 'on', 'german', 'declension', 'suffixed', 'is', 'also', 'provided', 'for', 'german', 'we', 'provided', 'a', '... | [-0.042967634859605364, 0.006737188325595047, -0.06843239954530687, 0.05646719600634365, -0.1843484733964048, -0.204852082214113, -0.0010404727200709156, 0.45464254214459937, -0.18114502753241588, -0.2801518260611821, 0.13426969602696157, -0.2796966886873973, -0.055152081947584274, 0.30796368208603336, -0.0845478755753... |
1,803.00903 | Characterization of nuclear pseudo-multipliers associated to the
harmonic oscillator | In this paper we study pseudo-multipliers associated to the harmonic
oscillator (also called Hermite multipliers) belonging to the ideal of
$r$-nuclear operators on Lebesgue spaces.
| math.FA | in this paper we study pseudomultipliers associated to the harmonic oscillator also called hermite multipliers belonging to the ideal of rnuclear operators on lebesgue spaces | [['in', 'this', 'paper', 'we', 'study', 'pseudomultipliers', 'associated', 'to', 'the', 'harmonic', 'oscillator', 'also', 'called', 'hermite', 'multipliers', 'belonging', 'to', 'the', 'ideal', 'of', 'rnuclear', 'operators', 'on', 'lebesgue', 'spaces']] | [-0.09862062558531762, 0.09954113733023405, -0.0029663751274347306, 0.08353729201015085, -0.08469555296935141, -0.07849020354449748, -0.0053944560466334225, 0.3807818639278412, -0.30663628071546556, -0.0440308103710413, 0.11689690149854869, -0.28861993059515956, -0.15292515426874162, 0.20021776650100948, -0.15271665811... |
1,803.00904 | Hardness of Approximate Nearest Neighbor Search | We prove conditional near-quadratic running time lower bounds for approximate
Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance.
Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false,
for every $\delta>0$ there exists a constant $\epsilon>0$ such that computing a
$(1+... | cs.CC cs.DS | we prove conditional nearquadratic running time lower bounds for approximate bichromatic closest pair with euclidean manhattan hamming or edit distance specifically unless the strong exponential time hypothesis seth is false for every delta0 there exists a constant epsilon0 such that computing a 1epsilonapproximation t... | [['we', 'prove', 'conditional', 'nearquadratic', 'running', 'time', 'lower', 'bounds', 'for', 'approximate', 'bichromatic', 'closest', 'pair', 'with', 'euclidean', 'manhattan', 'hamming', 'or', 'edit', 'distance', 'specifically', 'unless', 'the', 'strong', 'exponential', 'time', 'hypothesis', 'seth', 'is', 'false', 'fo... | [-0.16151919289323916, 0.040506330905137236, -0.09006186247872258, 0.09897628089055177, -0.06137112256449958, -0.2596086137798718, 0.1221217650325141, 0.4244785440257854, -0.2944339906313905, -0.3230092419544235, 0.05350249390661096, -0.2393543404802956, -0.1018536524778163, 0.19405566088001555, -0.05340122863115674, 0... |
1,803.00905 | Inferring correlations associated to causal interactions in brain
signals using autoregressive models | The specific connectivity of a neuronal network is reflected in the dynamics
of the signals recorded on its nodes. The analysis of how the activity in one
node predicts the behaviour of another gives the directionality in their
relationship. However, each node is composed of many different elements which
define the p... | q-bio.QM q-bio.NC | the specific connectivity of a neuronal network is reflected in the dynamics of the signals recorded on its nodes the analysis of how the activity in one node predicts the behaviour of another gives the directionality in their relationship however each node is composed of many different elements which define the proper... | [['the', 'specific', 'connectivity', 'of', 'a', 'neuronal', 'network', 'is', 'reflected', 'in', 'the', 'dynamics', 'of', 'the', 'signals', 'recorded', 'on', 'its', 'nodes', 'the', 'analysis', 'of', 'how', 'the', 'activity', 'in', 'one', 'node', 'predicts', 'the', 'behaviour', 'of', 'another', 'gives', 'the', 'direction... | [-0.14894105542163197, 0.10044411442458803, -0.06830463196844952, 0.0814703801992138, -0.08832385476030734, -0.1808968606305979, 0.06758272682465917, 0.34766192803528284, -0.2864355341292882, -0.2921508542455481, 0.042762333769036306, -0.299946461374543, -0.2574168844047286, 0.14370028338516536, -0.03703116656479016, -... |
1,803.00906 | Enhancing Cooperative Coevolution for Large Scale Optimization by
Adaptively Constructing Surrogate Models | It has been shown that cooperative coevolution (CC) can effectively deal with
large scale optimization problems (LSOPs) through a divide-and-conquer
strategy. However, its performance is severely restricted by the current
context-vector-based sub-solution evaluation method since this method needs to
access the origin... | cs.NE | it has been shown that cooperative coevolution cc can effectively deal with large scale optimization problems lsops through a divideandconquer strategy however its performance is severely restricted by the current contextvectorbased subsolution evaluation method since this method needs to access the original high dimen... | [['it', 'has', 'been', 'shown', 'that', 'cooperative', 'coevolution', 'cc', 'can', 'effectively', 'deal', 'with', 'large', 'scale', 'optimization', 'problems', 'lsops', 'through', 'a', 'divideandconquer', 'strategy', 'however', 'its', 'performance', 'is', 'severely', 'restricted', 'by', 'the', 'current', 'contextvector... | [-0.03926884093417001, -0.02531187641864281, -0.08066323405807733, 0.09774497863458384, -0.08397655118508549, -0.20557208027723742, 0.07929005707864682, 0.3763582846220715, -0.29606446254582425, -0.3463725238213514, 0.11994293711129292, -0.20692593715245822, -0.1463463529991695, 0.21516741189614014, -0.0786104901159846... |
1,803.00907 | Multi-Instance Dynamic Ordinal Random Fields for Weakly-supervised
Facial Behavior Analysis | We propose a Multi-Instance-Learning (MIL) approach for weakly-supervised
learning problems, where a training set is formed by bags (sets of feature
vectors or instances) and only labels at bag-level are provided. Specifically,
we consider the Multi-Instance Dynamic-Ordinal-Regression (MI-DOR) setting,
where the inst... | cs.CV cs.AI | we propose a multiinstancelearning mil approach for weaklysupervised learning problems where a training set is formed by bags sets of feature vectors or instances and only labels at baglevel are provided specifically we consider the multiinstance dynamicordinalregression midor setting where the instance labels are natu... | [['we', 'propose', 'a', 'multiinstancelearning', 'mil', 'approach', 'for', 'weaklysupervised', 'learning', 'problems', 'where', 'a', 'training', 'set', 'is', 'formed', 'by', 'bags', 'sets', 'of', 'feature', 'vectors', 'or', 'instances', 'and', 'only', 'labels', 'at', 'baglevel', 'are', 'provided', 'specifically', 'we',... | [-0.023209894639244694, 0.05531803400105515, -0.024659111382004745, 0.09727423178230016, -0.12573973278648884, -0.16361439937180533, 0.050271219695210013, 0.4509101462491905, -0.2844298105843053, -0.3161798710321372, 0.0621378530230942, -0.2744186971413981, -0.17767377356401906, 0.12715339079683277, -0.1547339730826346... |
1,803.00908 | Goldberg's Conjecture is true for random multigraphs | In the 70s, Goldberg, and independently Seymour, conjectured that for any
multigraph $G$, the chromatic index $\chi'(G)$ satisfies $\chi'(G)\leq \max
\{\Delta(G)+1, \lceil\rho(G)\rceil\}$, where $\rho(G)=\max \{\frac
{e(G[S])}{\lfloor
|S|/2\rfloor} \mid S\subseteq V \}$. We show that their conjecture (in a
stronger... | math.CO math.PR | in the 70s goldberg and independently seymour conjectured that for any multigraph g the chromatic index chig satisfies chigleq max deltag1 lceilrhogrceil where rhogmax frac egslfloor s2rfloor mid ssubseteq v we show that their conjecture in a stronger form is true for random multigraphs let mnm be the probability space... | [['in', 'the', '70s', 'goldberg', 'and', 'independently', 'seymour', 'conjectured', 'that', 'for', 'any', 'multigraph', 'g', 'the', 'chromatic', 'index', 'chig', 'satisfies', 'chigleq', 'max', 'deltag1', 'lceilrhogrceil', 'where', 'rhogmax', 'frac', 'egslfloor', 's2rfloor', 'mid', 'ssubseteq', 'v', 'we', 'show', 'that'... | [-0.1970956531567041, 0.22461859861266661, -0.017849704321305893, 0.010424317850265652, 0.00047193092607022795, -0.24051374289756794, 0.03365773847326636, 0.3513003458826207, -0.20562089356731195, -0.3099882502459967, 0.01265951517547603, -0.34789607654226423, -0.11471506985683055, 0.117345560651242, -0.070845823719731... |
1,803.00909 | Understanding the Loss Surface of Neural Networks for Binary
Classification | It is widely conjectured that the reason that training algorithms for neural
networks are successful because all local minima lead to similar performance,
for example, see (LeCun et al., 2015, Choromanska et al., 2015, Dauphin et al.,
2014). Performance is typically measured in terms of two metrics: training
performa... | cs.LG cs.AI stat.ML | it is widely conjectured that the reason that training algorithms for neural networks are successful because all local minima lead to similar performance for example see lecun et al 2015 choromanska et al 2015 dauphin et al 2014 performance is typically measured in terms of two metrics training performance and generali... | [['it', 'is', 'widely', 'conjectured', 'that', 'the', 'reason', 'that', 'training', 'algorithms', 'for', 'neural', 'networks', 'are', 'successful', 'because', 'all', 'local', 'minima', 'lead', 'to', 'similar', 'performance', 'for', 'example', 'see', 'lecun', 'et', 'al', '2015', 'choromanska', 'et', 'al', '2015', 'dauph... | [-0.04817403397475281, 0.020317823349933282, -0.0643203052229853, 0.08441012982537385, -0.08050953612125812, -0.15787526084123737, 0.017339335508087146, 0.41981515391682184, -0.23223577708305015, -0.3338995998874851, 0.07141480102190191, -0.25202211119696827, -0.2648317294864895, 0.22720045250174284, -0.183861488075315... |
1,803.0091 | A survey of non-uniqueness results for the anisotropic Calder{\'o}n
problem with disjoint data | After giving a general introduction to the main known results on the
anisotropic Calder{\'o}n problem on n-dimensional compact Riemannian manifolds
with boundary, we give a motivated review of some recent non-uniqueness results
obtained in [5, 6] for the anisotropic Calder{\'o}n problem at fixed frequency,
in dimensi... | math.AP math-ph math.DG math.MP | after giving a general introduction to the main known results on the anisotropic calderon problem on ndimensional compact riemannian manifolds with boundary we give a motivated review of some recent nonuniqueness results obtained in 5 6 for the anisotropic calderon problem at fixed frequency in dimension n ge 3 when th... | [['after', 'giving', 'a', 'general', 'introduction', 'to', 'the', 'main', 'known', 'results', 'on', 'the', 'anisotropic', 'calderon', 'problem', 'on', 'ndimensional', 'compact', 'riemannian', 'manifolds', 'with', 'boundary', 'we', 'give', 'a', 'motivated', 'review', 'of', 'some', 'recent', 'nonuniqueness', 'results', '... | [-0.16118595882870665, 0.11345947372484727, -0.005375348514791171, 0.03355403840463577, -0.11223353497085295, -0.16994917739237494, -0.040093444720176716, 0.37271197130629685, -0.24800708666913399, -0.2523188244711858, 0.15465551969583513, -0.34467178722452213, -0.08771385828780495, 0.18187134049122589, -0.116067039038... |
1,803.00911 | Dual spaces of cadlag processes | This article characterizes topological duals of spaces of cadlag processes.
We obtain extensions of functional analytic results of Dellacherie and Meyer
that underlie many fundamental results in stochastic analysis. In particular,
we obtain a characterization of the dual of cadlag processes of class $(D)$ in
terms of... | math.PR | this article characterizes topological duals of spaces of cadlag processes we obtain extensions of functional analytic results of dellacherie and meyer that underlie many fundamental results in stochastic analysis in particular we obtain a characterization of the dual of cadlag processes of class d in terms of optional... | [['this', 'article', 'characterizes', 'topological', 'duals', 'of', 'spaces', 'of', 'cadlag', 'processes', 'we', 'obtain', 'extensions', 'of', 'functional', 'analytic', 'results', 'of', 'dellacherie', 'and', 'meyer', 'that', 'underlie', 'many', 'fundamental', 'results', 'in', 'stochastic', 'analysis', 'in', 'particular... | [-0.09050121541561869, 0.06131064387348791, -0.08107457834557863, 0.12174491572053132, -0.0652726056650863, -0.08111302903368293, 0.046019481829716824, 0.33121493022190407, -0.31233619250512373, -0.20057564678912362, 0.1442933739745058, -0.22284304143492287, -0.20112074478917444, 0.24286471761297435, -0.143866920387760... |
1,803.00912 | Cleaning Interfaces in Layered Materials Heterostructures | Heterostructures formed by stacking layered materials require atomically
clean interfaces. However, contaminants are usually trapped between the layers,
aggregating into blisters. We report a process to remove such blisters,
resulting in clean interfaces. We fabricate blister-free regions of graphene
encapsulated in ... | cond-mat.mes-hall | heterostructures formed by stacking layered materials require atomically clean interfaces however contaminants are usually trapped between the layers aggregating into blisters we report a process to remove such blisters resulting in clean interfaces we fabricate blisterfree regions of graphene encapsulated in hexagonal... | [['heterostructures', 'formed', 'by', 'stacking', 'layered', 'materials', 'require', 'atomically', 'clean', 'interfaces', 'however', 'contaminants', 'are', 'usually', 'trapped', 'between', 'the', 'layers', 'aggregating', 'into', 'blisters', 'we', 'report', 'a', 'process', 'to', 'remove', 'such', 'blisters', 'resulting'... | [-0.08675350078766973, 0.11395982060709904, 0.004037664162701574, -0.08551860372168323, -0.005669523300281886, -0.16377416052373833, 0.11786887100094866, 0.48630538140905316, -0.25351485495038073, -0.3220638261144531, 0.004373387186306304, -0.34587684353363923, -0.13880986815302407, 0.22059287328016142, -0.030965379610... |
1,803.00913 | Fixed points for $G$-cyclic $(\phi -\psi)$-Kannan and $G$-cyclic $(\phi
-\psi)$-Chatterjea contractions in $G$-metric spaces | Definitions of what are called $G$-cyclic $\left( \phi -\psi \right)$-Kannan
contraction and $G$-cyclic $\left( \phi -\psi\right)$-Chatterjea contraction
are introduced in this paper. We use these new concepts to establish new fixed
point results in the context of complete generalized metric spaces. These
results are... | math.GM | definitions of what are called gcyclic left phi psi rightkannan contraction and gcyclic left phi psirightchatterjea contraction are introduced in this paper we use these new concepts to establish new fixed point results in the context of complete generalized metric spaces these results are new generalizations and exten... | [['definitions', 'of', 'what', 'are', 'called', 'gcyclic', 'left', 'phi', 'psi', 'rightkannan', 'contraction', 'and', 'gcyclic', 'left', 'phi', 'psirightchatterjea', 'contraction', 'are', 'introduced', 'in', 'this', 'paper', 'we', 'use', 'these', 'new', 'concepts', 'to', 'establish', 'new', 'fixed', 'point', 'results',... | [-0.08170412180383932, 0.11129377827316217, -0.07328039655232266, 0.10175003382945051, -0.07530586621468913, -0.12981661946244843, 0.016488685546927666, 0.3406536111174381, -0.3006198468988072, -0.21338078596514382, 0.15048193454595715, -0.3124457420908833, -0.2145342860651547, 0.22900282543101538, -0.13558094507108812... |
1,803.00914 | Realizability Interpretation and Normalization of Typed Call-by-Need
$$\lambda$$-calculus With Control | We define a variant of realizability where realizers are pairs of a term and
a substitution. This variant allows us to prove the normalization of a
simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et
al. Indeed, in such call-by-need calculus, substitutions have to be delayed
until knowing if ... | cs.LO | we define a variant of realizability where realizers are pairs of a term and a substitution this variant allows us to prove the normalization of a simplytyped callbyneed lambdacalculus with control due to ariola et al indeed in such callbyneed calculus substitutions have to be delayed until knowing if an argument is re... | [['we', 'define', 'a', 'variant', 'of', 'realizability', 'where', 'realizers', 'are', 'pairs', 'of', 'a', 'term', 'and', 'a', 'substitution', 'this', 'variant', 'allows', 'us', 'to', 'prove', 'the', 'normalization', 'of', 'a', 'simplytyped', 'callbyneed', 'lambdacalculus', 'with', 'control', 'due', 'to', 'ariola', 'et'... | [-0.09720306790300778, 0.02694901218762555, -0.12282123982108065, 0.07521827868407681, -0.18930449273792052, -0.1938632338174752, 0.10065237247340736, 0.2926952590012834, -0.3478949385296021, -0.28348211319230143, 0.04180575853568457, -0.2268662665639394, -0.10309952199459076, 0.1439355092389243, -0.1784144217984985, 0... |
1,803.00915 | Radial basis function methods for optimal control of the
convection-diffusion equation | PDE-constrained optimization problems have been barely solved by radial basis
functions (RBFs) methods [Pearson, 2013]. It is well known that RBF methods can
attain an exponential rate of convergence when $C^{\infty}$ kernels are used,
also, these techniques, which are truly scattered, are known to be flexible to
dis... | math.NA | pdeconstrained optimization problems have been barely solved by radial basis functions rbfs methods pearson 2013 it is well known that rbf methods can attain an exponential rate of convergence when cinfty kernels are used also these techniques which are truly scattered are known to be flexible to discretize complex bou... | [['pdeconstrained', 'optimization', 'problems', 'have', 'been', 'barely', 'solved', 'by', 'radial', 'basis', 'functions', 'rbfs', 'methods', 'pearson', '2013', 'it', 'is', 'well', 'known', 'that', 'rbf', 'methods', 'can', 'attain', 'an', 'exponential', 'rate', 'of', 'convergence', 'when', 'cinfty', 'kernels', 'are', 'u... | [-0.06524216194294655, -0.00785609197919257, -0.09285883219501238, 0.10692067619908185, -0.08486229530309589, -0.17000574029267776, -0.007392910855609779, 0.42983122480336977, -0.3395012691300543, -0.2946008473851727, 0.1536357036788351, -0.19860342069578726, -0.20086523254845037, 0.23032799563415854, -0.09395418286287... |
1,803.00916 | Deep Learning for Signal Authentication and Security in Massive Internet
of Things Systems | Secure signal authentication is arguably one of the most challenging problems
in the Internet of Things (IoT) environment, due to the large-scale nature of
the system and its susceptibility to man-in-the-middle and eavesdropping
attacks. In this paper, a novel deep learning method is proposed for dynamic
authenticati... | cs.CR cs.GT cs.LG | secure signal authentication is arguably one of the most challenging problems in the internet of things iot environment due to the largescale nature of the system and its susceptibility to maninthemiddle and eavesdropping attacks in this paper a novel deep learning method is proposed for dynamic authentication of iot s... | [['secure', 'signal', 'authentication', 'is', 'arguably', 'one', 'of', 'the', 'most', 'challenging', 'problems', 'in', 'the', 'internet', 'of', 'things', 'iot', 'environment', 'due', 'to', 'the', 'largescale', 'nature', 'of', 'the', 'system', 'and', 'its', 'susceptibility', 'to', 'maninthemiddle', 'and', 'eavesdropping... | [-0.14513983038109293, -0.006084384290584092, -0.09024852583698902, 0.03653364090897285, -0.09669975755656118, -0.19321691660931514, 0.07775990297812568, 0.3471135897127958, -0.30412122664353924, -0.3040447483259824, 0.12325726586434069, -0.27440075442636397, -0.16524016173676617, 0.17181444281585329, -0.12444335673718... |
1,803.00917 | On the geometry of period doubling invariant sets for area-preserving maps | The geometry of the period doubling Cantor sets of strongly dissipative infinitely renormalizable H\'enon-like maps has been shown to be unbounded by M. Lyubich, M. Martens and A. de Carvalho, although the measure of unbounded "spots" in the Cantor set has been demonstrated to be zero.
We show that an even more extre... | math.DS | the geometry of the period doubling cantor sets of strongly dissipative infinitely renormalizable henonlike maps has been shown to be unbounded by m lyubich m martens and a de carvalho although the measure of unbounded spots in the cantor set has been demonstrated to be zero we show that an even more extreme situation ... | [['the', 'geometry', 'of', 'the', 'period', 'doubling', 'cantor', 'sets', 'of', 'strongly', 'dissipative', 'infinitely', 'renormalizable', 'henonlike', 'maps', 'has', 'been', 'shown', 'to', 'be', 'unbounded', 'by', 'm', 'lyubich', 'm', 'martens', 'and', 'a', 'de', 'carvalho', 'although', 'the', 'measure', 'of', 'unboun... | [-0.2108881542082774, 0.16734350496470093, -0.1196551752493602, 0.11663183532272504, -0.03525254385520334, -0.17580252714225486, -0.022951835115784653, 0.310296901846177, -0.2110586449478383, -0.17972880667585828, 0.11268234307628941, -0.31894586296522454, -0.13412673352924112, 0.24535414346251383, -0.13255875033313688... |
1,803.00918 | An analogue of a result of Tits for linear and symplectic transvection
groups | In [9] Bogdan Nica presented an elementary proof of a result which says that
the relative elementary linear group with respect to a square of an ideal of
the ring is a subset of the true relative elementary linear group. The original
result was proved by J. Tits in [16] in the much general context of Chevalley
groups... | math.AC | in 9 bogdan nica presented an elementary proof of a result which says that the relative elementary linear group with respect to a square of an ideal of the ring is a subset of the true relative elementary linear group the original result was proved by j tits in 16 in the much general context of chevalley groups in this... | [['in', '9', 'bogdan', 'nica', 'presented', 'an', 'elementary', 'proof', 'of', 'a', 'result', 'which', 'says', 'that', 'the', 'relative', 'elementary', 'linear', 'group', 'with', 'respect', 'to', 'a', 'square', 'of', 'an', 'ideal', 'of', 'the', 'ring', 'is', 'a', 'subset', 'of', 'the', 'true', 'relative', 'elementary',... | [-0.15453050273718644, 0.07661990621102709, -0.13301697697177112, 0.04443166491458036, -0.1031974492699047, -0.09391416859090607, 0.009837531416119885, 0.2899772448848202, -0.3058683160762085, -0.2456601872049037, 0.10266718087352325, -0.21227732868473453, -0.13064147903699272, 0.2204549007866288, -0.1661158396435954, ... |
1,803.00919 | House Price Modeling over Heterogeneous Regions with Hierarchical
Spatial Functional Analysis | Online real-estate information systems such as Zillow and Trulia have gained
increasing popularity in recent years. One important feature offered by these
systems is the online home price estimate through automated data-intensive
computation based on housing information and comparative market value analysis.
State-of... | cs.CE | online realestate information systems such as zillow and trulia have gained increasing popularity in recent years one important feature offered by these systems is the online home price estimate through automated dataintensive computation based on housing information and comparative market value analysis stateoftheart ... | [['online', 'realestate', 'information', 'systems', 'such', 'as', 'zillow', 'and', 'trulia', 'have', 'gained', 'increasing', 'popularity', 'in', 'recent', 'years', 'one', 'important', 'feature', 'offered', 'by', 'these', 'systems', 'is', 'the', 'online', 'home', 'price', 'estimate', 'through', 'automated', 'dataintensi... | [-0.016341755222444725, -0.0021783658846189786, -0.10297432837605482, 0.09255360097924749, -0.10212437775217653, -0.13753103362420488, 0.07289907611349182, 0.40502180833697626, -0.2736972185054437, -0.34604641480535425, 0.16249012336263993, -0.2914196316036999, -0.16429626113533674, 0.17406139285858585, -0.117554698590... |
1,803.0092 | Distributed Robust Output Regulation of Heterogeneous Uncertain Linear
Agents by Adaptive Internal Model Principle | We study a multi-agent output regulation problem, where not all agents have
access to the exosystem's dynamics. We propose a fully distributed controller
that solves the problem for linear, heterogeneous, and uncertain agent dynamics
as well as time-varying directed networks. The distributed controller consists
of tw... | cs.SY | we study a multiagent output regulation problem where not all agents have access to the exosystems dynamics we propose a fully distributed controller that solves the problem for linear heterogeneous and uncertain agent dynamics as well as timevarying directed networks the distributed controller consists of two parts 1 ... | [['we', 'study', 'a', 'multiagent', 'output', 'regulation', 'problem', 'where', 'not', 'all', 'agents', 'have', 'access', 'to', 'the', 'exosystems', 'dynamics', 'we', 'propose', 'a', 'fully', 'distributed', 'controller', 'that', 'solves', 'the', 'problem', 'for', 'linear', 'heterogeneous', 'and', 'uncertain', 'agent', ... | [-0.16627920509309024, 0.04675620724468954, -0.042451052268252784, -0.018464570462395597, -0.08612063106261474, -0.19952891505134285, 0.023140266819513942, 0.4028063600784854, -0.3550344334593169, -0.2919421529579431, 0.09655439163579192, -0.19939478379639244, -0.19553545544001, 0.1295969937122742, -0.11043252736414061... |
1,803.00921 | Evaluation of weighted Fibonacci sums of a certain type | We derive a formula for the evaluation of weighted generalized Fibonacci sums
of the type $S_k^n (w,r) = \sum_{j = 0}^k {w^j j^r G_j{}^n }$. Several explicit
evaluations are presented as examples.
| math.GM | we derive a formula for the evaluation of weighted generalized fibonacci sums of the type s_kn wr sum_j 0k wj jr g_jn several explicit evaluations are presented as examples | [['we', 'derive', 'a', 'formula', 'for', 'the', 'evaluation', 'of', 'weighted', 'generalized', 'fibonacci', 'sums', 'of', 'the', 'type', 's_kn', 'wr', 'sum_j', '0k', 'wj', 'jr', 'g_jn', 'several', 'explicit', 'evaluations', 'are', 'presented', 'as', 'examples']] | [-0.20672175188415817, 0.05069424973667732, -0.003902385476976633, 0.13997448461928538, -0.1045650082773396, -0.12961071708040045, 0.10020829060314489, 0.3190469148435763, -0.2109486374787853, -0.19793217296579055, 0.0918199792338003, -0.32536309091041665, -0.15995019421513593, 0.255361475457903, -0.022691706378412033,... |
1,803.00922 | Online Scheduling of Spark Workloads with Mesos using Different Fair
Allocation Algorithms | In the following, we present example illustrative and experimental results
comparing fair schedulers allocating resources from multiple servers to
distributed application frameworks. Resources are allocated so that at least
one resource is exhausted in every server. Schedulers considered include DRF
(DRFH) and Best-F... | cs.PF | in the following we present example illustrative and experimental results comparing fair schedulers allocating resources from multiple servers to distributed application frameworks resources are allocated so that at least one resource is exhausted in every server schedulers considered include drf drfh and bestfit drf b... | [['in', 'the', 'following', 'we', 'present', 'example', 'illustrative', 'and', 'experimental', 'results', 'comparing', 'fair', 'schedulers', 'allocating', 'resources', 'from', 'multiple', 'servers', 'to', 'distributed', 'application', 'frameworks', 'resources', 'are', 'allocated', 'so', 'that', 'at', 'least', 'one', 'r... | [-0.14923687695356255, 0.016161434636027976, -0.06315110175531696, 0.04247400438603522, -0.05754379800055176, -0.24659951232077384, 0.1376681401521306, 0.44418359342962505, -0.21102397441440685, -0.29915775569494474, 0.13594219033204188, -0.2581091822294349, -0.07572945350654084, 0.2121962239288471, -0.1010303272781047... |
1,803.00923 | Fokker-Planck equation driven by asymmetric L\'evy motion | Non-Gaussian L\'evy noises are present in many models for understanding
underlining principles of physics, finance, biology and more. In this work, we
consider the Fokker-Planck equation(FPE) due to one-dimensional asymmetric
L\'evy motion, which is a nonlocal partial differential equation. We present an
accurate num... | math.DS math.NA | nongaussian levy noises are present in many models for understanding underlining principles of physics finance biology and more in this work we consider the fokkerplanck equationfpe due to onedimensional asymmetric levy motion which is a nonlocal partial differential equation we present an accurate numerical quadrature... | [['nongaussian', 'levy', 'noises', 'are', 'present', 'in', 'many', 'models', 'for', 'understanding', 'underlining', 'principles', 'of', 'physics', 'finance', 'biology', 'and', 'more', 'in', 'this', 'work', 'we', 'consider', 'the', 'fokkerplanck', 'equationfpe', 'due', 'to', 'onedimensional', 'asymmetric', 'levy', 'moti... | [-0.08646820641720522, 0.05369617133196988, -0.07169915142374986, 0.06861412166683863, -0.0708446411254109, -0.10898267819896235, 0.016798795136484378, 0.3231857528923251, -0.2690127309979805, -0.251714300899271, 0.12845675940361165, -0.2586730992213446, -0.1652187412300854, 0.21869259795292895, -0.0694704085086053, 0.... |
1,803.00924 | All-Electron, Real-Space Perturbation Theory for Homogeneous Electric
Fields: Theory, Implementation, and Application within DFT | Within density-functional theory, perturbation theory~(PT) is the
state-of-the-art formalism for assessing the response to homogeneous electric
fields and the associated material properties, e.g., polarizabilities,
dielectric constants, and Raman intensities. Here we derive a real-space
formulation of PT and present ... | cond-mat.mtrl-sci physics.comp-ph | within densityfunctional theory perturbation theorypt is the stateoftheart formalism for assessing the response to homogeneous electric fields and the associated material properties eg polarizabilities dielectric constants and raman intensities here we derive a realspace formulation of pt and present an implementation ... | [['within', 'densityfunctional', 'theory', 'perturbation', 'theorypt', 'is', 'the', 'stateoftheart', 'formalism', 'for', 'assessing', 'the', 'response', 'to', 'homogeneous', 'electric', 'fields', 'and', 'the', 'associated', 'material', 'properties', 'eg', 'polarizabilities', 'dielectric', 'constants', 'and', 'raman', '... | [-0.08350708330369616, 0.050119001863831926, -0.06797894905491249, 0.013860207223537358, 0.015565292513759358, -0.10195611198165073, 0.040087334532120746, 0.43744387695851333, -0.20732355405182246, -0.30929645460760086, -0.05385189402736316, -0.3347433516179997, -0.15858790243085283, 0.18332666906963246, 0.104499882124... |
1,803.00925 | Experimental Evaluation of Parameterized Algorithms for Feedback Vertex
Set | Feedback Vertex Set is a classic combinatorial optimization problem that asks
for a minimum set of vertices in a given graph whose deletion makes the graph
acyclic. From the point of view of parameterized algorithms and fixed-parameter
tractability, Feedback Vertex Set is one of the landmark problems: a long line
of ... | cs.DS | feedback vertex set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic from the point of view of parameterized algorithms and fixedparameter tractability feedback vertex set is one of the landmark problems a long line of study ... | [['feedback', 'vertex', 'set', 'is', 'a', 'classic', 'combinatorial', 'optimization', 'problem', 'that', 'asks', 'for', 'a', 'minimum', 'set', 'of', 'vertices', 'in', 'a', 'given', 'graph', 'whose', 'deletion', 'makes', 'the', 'graph', 'acyclic', 'from', 'the', 'point', 'of', 'view', 'of', 'parameterized', 'algorithms'... | [-0.10240545393934361, -0.012645585100416969, -0.042965421571650286, 0.032859955189721374, -0.14487231197964512, -0.14001888895943534, 0.11581068675485298, 0.34059726776922067, -0.3126210127117564, -0.3594769784334031, 0.09807134018223168, -0.2780806578893327, -0.1678431128123493, 0.2076856619367997, -0.107358185670366... |
1,803.00926 | Semi-Supervised Algorithms for Approximately Optimal and Accurate
Clustering | We study $k$-means clustering in a semi-supervised setting. Given an oracle
that returns whether two given points belong to the same cluster in a fixed
optimal clustering, we investigate the following question: how many oracle
queries are sufficient to efficiently recover a clustering that, with
probability at least ... | cs.DS | we study kmeans clustering in a semisupervised setting given an oracle that returns whether two given points belong to the same cluster in a fixed optimal clustering we investigate the following question how many oracle queries are sufficient to efficiently recover a clustering that with probability at least 1 delta si... | [['we', 'study', 'kmeans', 'clustering', 'in', 'a', 'semisupervised', 'setting', 'given', 'an', 'oracle', 'that', 'returns', 'whether', 'two', 'given', 'points', 'belong', 'to', 'the', 'same', 'cluster', 'in', 'a', 'fixed', 'optimal', 'clustering', 'we', 'investigate', 'the', 'following', 'question', 'how', 'many', 'or... | [-0.10917622725350659, 0.07259738682302672, -0.049908167271284165, 0.09428411523643011, -0.046183571801067906, -0.1647063044392674, 0.10269588752568641, 0.4103926461523377, -0.2865184943870268, -0.33296669293072706, 0.054139166091956514, -0.3325613476625908, -0.10352072687565933, 0.15324813364696932, -0.081072270618353... |
1,803.00927 | Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental
Evaluation | The notion of treewidth, introduced by Robertson and Seymour in their seminal
Graph Minors series, turned out to have tremendous impact on graph
algorithmics. Many hard computational problems on graphs turn out to be
efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped
with separators of bo... | cs.DS | the notion of treewidth introduced by robertson and seymour in their seminal graph minors series turned out to have tremendous impact on graph algorithmics many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth graphs that can be sweeped with separators of bounded ... | [['the', 'notion', 'of', 'treewidth', 'introduced', 'by', 'robertson', 'and', 'seymour', 'in', 'their', 'seminal', 'graph', 'minors', 'series', 'turned', 'out', 'to', 'have', 'tremendous', 'impact', 'on', 'graph', 'algorithmics', 'many', 'hard', 'computational', 'problems', 'on', 'graphs', 'turn', 'out', 'to', 'be', 'e... | [-0.1207486534724012, 0.0672297699797538, -0.0490510557612945, 0.06003374778214962, -0.13380214827315462, -0.1532455087669434, 0.04877329172506448, 0.37711384740447806, -0.29848078927776267, -0.36668515844691185, 0.12531876414788948, -0.25034535939865293, -0.15189776262568852, 0.22102623072963568, -0.09558602117993419,... |
1,803.00928 | Estimating model bias over the complete nuclide chart with sparse
Gaussian processes at the example of INCL/ABLA and double-differential
neutron spectra | Predictions of nuclear models guide the design of nuclear facilities to
ensure their safe and efficient operation. Because nuclear models often do not
perfectly reproduce available experimental data, decisions based on their
predictions may not be optimal. Awareness about systematic deviations between
models and expe... | nucl-th physics.data-an | predictions of nuclear models guide the design of nuclear facilities to ensure their safe and efficient operation because nuclear models often do not perfectly reproduce available experimental data decisions based on their predictions may not be optimal awareness about systematic deviations between models and experimen... | [['predictions', 'of', 'nuclear', 'models', 'guide', 'the', 'design', 'of', 'nuclear', 'facilities', 'to', 'ensure', 'their', 'safe', 'and', 'efficient', 'operation', 'because', 'nuclear', 'models', 'often', 'do', 'not', 'perfectly', 'reproduce', 'available', 'experimental', 'data', 'decisions', 'based', 'on', 'their',... | [-0.009138263311276939, 0.08314839813280551, -0.12075968539182913, 0.1350244379775303, -0.09961701263698505, -0.14427633240898663, 0.05607384364905065, 0.39518315841090235, -0.25087932169556937, -0.3300554062274688, 0.07432047883982466, -0.2869219330791882, -0.07450342362200783, 0.19510751088301745, -0.0333601260498006... |
1,803.00929 | God plays coins or superposition principle for classical probabilities
in quantum suprematism representation of qubit states | For three given probability distributions describing positions of three
classical coins the quantum density matrix of spin-$1/2$ state is constructed
and its matrix elements are associated with triada of Malevich's squares. The
superposition principle of spin-$1/2$ states is presented in the form of
nonlinear additio... | quant-ph | for three given probability distributions describing positions of three classical coins the quantum density matrix of spin12 state is constructed and its matrix elements are associated with triada of malevichs squares the superposition principle of spin12 states is presented in the form of nonlinear addition rule for t... | [['for', 'three', 'given', 'probability', 'distributions', 'describing', 'positions', 'of', 'three', 'classical', 'coins', 'the', 'quantum', 'density', 'matrix', 'of', 'spin12', 'state', 'is', 'constructed', 'and', 'its', 'matrix', 'elements', 'are', 'associated', 'with', 'triada', 'of', 'malevichs', 'squares', 'the', ... | [-0.12191262147098314, 0.18707910168450326, -0.06221311938861618, 0.05922848780028289, -0.010876031155930832, -0.19121209120203275, 0.016234240330959437, 0.34418762123095803, -0.22696494232513942, -0.2531228459774866, 0.07647217936937523, -0.32899862551130354, -0.1267398394702468, 0.13500507269782247, -0.04292561104261... |
1,803.0093 | Beyond black-boxes in Bayesian inverse problems and model validation:
applications in solid mechanics of elastography | The present paper is motivated by one of the most fundamental challenges in
inverse problems, that of quantifying model discrepancies and errors. While
significant strides have been made in calibrating model parameters, the
overwhelming majority of pertinent methods is based on the assumption of a
perfect model. Moti... | physics.comp-ph stat.ML | the present paper is motivated by one of the most fundamental challenges in inverse problems that of quantifying model discrepancies and errors while significant strides have been made in calibrating model parameters the overwhelming majority of pertinent methods is based on the assumption of a perfect model motivated ... | [['the', 'present', 'paper', 'is', 'motivated', 'by', 'one', 'of', 'the', 'most', 'fundamental', 'challenges', 'in', 'inverse', 'problems', 'that', 'of', 'quantifying', 'model', 'discrepancies', 'and', 'errors', 'while', 'significant', 'strides', 'have', 'been', 'made', 'in', 'calibrating', 'model', 'parameters', 'the'... | [-0.05671256218370574, 0.0468146763082775, -0.04178974860721195, 0.09165361320196483, -0.08826101769281182, -0.15153259926685883, 0.03886299394875816, 0.35927621937841864, -0.2799509496536441, -0.34524996901008254, 0.10738294012254439, -0.23737061663620895, -0.1572584407404065, 0.18018745278568363, -0.09553474244180947... |
1,803.00931 | Magnetoresistance of semi-metals: the case of antimony | Large unsaturated magnetoresistance has been recently reported in numerous
semi-metals. Many of them have a topologically non-trivial band dispersion,
such as Weyl nodes or lines. Here, we show that elemental antimony displays the
largest high-field magnetoresistance among all known semi-metals. We present a
detailed... | cond-mat.mtrl-sci cond-mat.str-el | large unsaturated magnetoresistance has been recently reported in numerous semimetals many of them have a topologically nontrivial band dispersion such as weyl nodes or lines here we show that elemental antimony displays the largest highfield magnetoresistance among all known semimetals we present a detailed study of t... | [['large', 'unsaturated', 'magnetoresistance', 'has', 'been', 'recently', 'reported', 'in', 'numerous', 'semimetals', 'many', 'of', 'them', 'have', 'a', 'topologically', 'nontrivial', 'band', 'dispersion', 'such', 'as', 'weyl', 'nodes', 'or', 'lines', 'here', 'we', 'show', 'that', 'elemental', 'antimony', 'displays', '... | [-0.21534791665846928, 0.15615184702045568, -0.02707291181481273, 0.016556005968390897, -0.09713245530015933, -0.14303947194203945, 0.03937800840350052, 0.38604902335718067, -0.24537683139279695, -0.3391575801094443, -0.006379234220858821, -0.3012306163428535, -0.1625088463475088, 0.2031382426117796, -0.009966335357757... |
1,803.00932 | An Experimental Study of Factor Analysis over Cellular Network Data | Mobile Network Operators (MNOs) are evolving towards becoming data-driven,
while delivering capacity to collect and analyze data. This can help in
enhancing user experiences while empowering the operation workforce and
building new business models. Mobile traffic demands of users can give insights
to MNOs to plan, de... | cs.NI | mobile network operators mnos are evolving towards becoming datadriven while delivering capacity to collect and analyze data this can help in enhancing user experiences while empowering the operation workforce and building new business models mobile traffic demands of users can give insights to mnos to plan decide and ... | [['mobile', 'network', 'operators', 'mnos', 'are', 'evolving', 'towards', 'becoming', 'datadriven', 'while', 'delivering', 'capacity', 'to', 'collect', 'and', 'analyze', 'data', 'this', 'can', 'help', 'in', 'enhancing', 'user', 'experiences', 'while', 'empowering', 'the', 'operation', 'workforce', 'and', 'building', 'n... | [-0.11533520678119137, 0.09442494861367676, -0.019043756362425127, 0.06895249068365718, -0.09549573065980879, -0.16823047961357956, 0.12998510701840538, 0.397680538590827, -0.2323833009040933, -0.34703660205773573, 0.15730894686048547, -0.3341628267168025, -0.1953976914040087, 0.1737851591086855, -0.13878233908493998, ... |
1,803.00933 | Distributed Prioritized Experience Replay | We propose a distributed architecture for deep reinforcement learning at
scale, that enables agents to learn effectively from orders of magnitude more
data than previously possible. The algorithm decouples acting from learning:
the actors interact with their own instances of the environment by selecting
actions accor... | cs.LG | we propose a distributed architecture for deep reinforcement learning at scale that enables agents to learn effectively from orders of magnitude more data than previously possible the algorithm decouples acting from learning the actors interact with their own instances of the environment by selecting actions according ... | [['we', 'propose', 'a', 'distributed', 'architecture', 'for', 'deep', 'reinforcement', 'learning', 'at', 'scale', 'that', 'enables', 'agents', 'to', 'learn', 'effectively', 'from', 'orders', 'of', 'magnitude', 'more', 'data', 'than', 'previously', 'possible', 'the', 'algorithm', 'decouples', 'acting', 'from', 'learning... | [-0.08717695574209063, 0.07463362979529015, -0.06532493513866754, 0.007287029940556041, -0.13800576795681807, -0.1577035203059125, 0.12137592509704626, 0.4469891522332268, -0.26375292467399325, -0.37769704246577823, 0.02507422357931796, -0.2647755585839751, -0.13686061844671682, 0.17342651131862807, -0.1200304519408777... |
1,803.00934 | Quadratic 2-step Lie algebras: Computational algorithms and
classification | Taking into account the theoretical results and guidelines given inthis work,
we introduce a computational method to construct any 2 step nilpotent quadratic
algebra of d generators. Along the work we show that the key of the
classification of this class of metric algebras relies on certain families of
skewsymmetric ... | math.RA | taking into account the theoretical results and guidelines given inthis work we introduce a computational method to construct any 2 step nilpotent quadratic algebra of d generators along the work we show that the key of the classification of this class of metric algebras relies on certain families of skewsymmetric matr... | [['taking', 'into', 'account', 'the', 'theoretical', 'results', 'and', 'guidelines', 'given', 'inthis', 'work', 'we', 'introduce', 'a', 'computational', 'method', 'to', 'construct', 'any', '2', 'step', 'nilpotent', 'quadratic', 'algebra', 'of', 'd', 'generators', 'along', 'the', 'work', 'we', 'show', 'that', 'the', 'ke... | [-0.12638151109497592, 0.043685284824560175, -0.04183361396707337, 0.013449256972746989, -0.11165511062176063, -0.15139129333165957, 0.008969440799334953, 0.3496832010047189, -0.2690488230597613, -0.2636982263306734, 0.09244831696008171, -0.22645140304390726, -0.1903374729445204, 0.2087431040046544, -0.1344381516251376... |
1,803.00935 | Breakdown of the Wiedemann-Franz law in a unitary Fermi gas | We report on coupled heat and particle transport measurements through a
quantum point contact (QPC) connecting two reservoirs of resonantly
interacting, finite temperature Fermi gases. After heating one of them, we
observe a particle current flowing from cold to hot. We monitor the temperature
evolution of the reserv... | cond-mat.quant-gas cond-mat.mes-hall | we report on coupled heat and particle transport measurements through a quantum point contact qpc connecting two reservoirs of resonantly interacting finite temperature fermi gases after heating one of them we observe a particle current flowing from cold to hot we monitor the temperature evolution of the reservoirs and... | [['we', 'report', 'on', 'coupled', 'heat', 'and', 'particle', 'transport', 'measurements', 'through', 'a', 'quantum', 'point', 'contact', 'qpc', 'connecting', 'two', 'reservoirs', 'of', 'resonantly', 'interacting', 'finite', 'temperature', 'fermi', 'gases', 'after', 'heating', 'one', 'of', 'them', 'we', 'observe', 'a',... | [-0.16269345252891693, 0.20730565674424004, -0.09107410774770427, -0.0022156940160548305, 0.008594991604394135, -0.17148382927385722, 0.10749450210795643, 0.2813110263049503, -0.26819987354780184, -0.27738890551867335, -0.00835596624809133, -0.3531337661798147, -0.06172316947224784, 0.20893651917315323, 0.0343853093803... |
1,803.00936 | Universal Central Extensions and Non-abelian tensor product of
Hom-Lie-Rinehart Algebras | In this paper we study universal central extensions and non-abelian tensor
product of hom-Lie-Rinehart algebras. We discuss about universal $\alpha$-
central extensions, and, lifting of automorphisms and $\alpha$-derivations to
central extensions for hom-Lie-Rinehart algebras. This is in turn provide such
lifting of ... | math.KT math.RA math.RT | in this paper we study universal central extensions and nonabelian tensor product of homlierinehart algebras we discuss about universal alpha central extensions and lifting of automorphisms and alphaderivations to central extensions for homlierinehart algebras this is in turn provide such lifting of automorphisms and a... | [['in', 'this', 'paper', 'we', 'study', 'universal', 'central', 'extensions', 'and', 'nonabelian', 'tensor', 'product', 'of', 'homlierinehart', 'algebras', 'we', 'discuss', 'about', 'universal', 'alpha', 'central', 'extensions', 'and', 'lifting', 'of', 'automorphisms', 'and', 'alphaderivations', 'to', 'central', 'exten... | [-0.14342561975121498, 0.037123157787136735, -0.04543598439544439, 0.11308146851835772, -0.1224940325692296, -0.1034575979784131, -0.055790095997508615, 0.3385121192038059, -0.37865941271185877, -0.1776810740493238, 0.16351150191854685, -0.2299128355877474, -0.13557954954449086, 0.15853767465800048, -0.2009814268629998... |
1,803.00937 | An improved FPT algorithm for Independent Feedback Vertex Set | We study the Independent Feedback Vertex Set problem - a variant of the
classic Feedback Vertex Set problem where, given a graph $G$ and an integer
$k$, the problem is to decide whether there exists a vertex set $S\subseteq
V(G)$ such that $G\setminus S$ is a forest and $S$ is an independent set of
size at most $k$. ... | cs.DS | we study the independent feedback vertex set problem a variant of the classic feedback vertex set problem where given a graph g and an integer k the problem is to decide whether there exists a vertex set ssubseteq vg such that gsetminus s is a forest and s is an independent set of size at most k we present an oast1varp... | [['we', 'study', 'the', 'independent', 'feedback', 'vertex', 'set', 'problem', 'a', 'variant', 'of', 'the', 'classic', 'feedback', 'vertex', 'set', 'problem', 'where', 'given', 'a', 'graph', 'g', 'and', 'an', 'integer', 'k', 'the', 'problem', 'is', 'to', 'decide', 'whether', 'there', 'exists', 'a', 'vertex', 'set', 'ss... | [-0.11599785671869005, 0.050369332957563316, -0.04099354268948767, 0.020690568317537756, -0.1403382681789534, -0.16269447661676062, 0.1192933900798808, 0.32888314566191507, -0.29680199409674113, -0.30933324299643145, 0.060465225068208596, -0.28960080793213444, -0.1488817777546287, 0.18725024815991193, -0.08326918511610... |
1,803.00938 | Multivariate Fine-Grained Complexity of Longest Common Subsequence | We revisit the classic combinatorial pattern matching problem of finding a
longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a
textbook algorithm solves LCS in time $O(n^2)$, but although much effort has
been spent, no $O(n^{2-\varepsilon})$-time algorithm is known. Recent work
indeed shows tha... | cs.CC cs.DS | we revisit the classic combinatorial pattern matching problem of finding a longest common subsequence lcs for strings x and y of length n a textbook algorithm solves lcs in time on2 but although much effort has been spent no on2varepsilontime algorithm is known recent work indeed shows that such an algorithm would refu... | [['we', 'revisit', 'the', 'classic', 'combinatorial', 'pattern', 'matching', 'problem', 'of', 'finding', 'a', 'longest', 'common', 'subsequence', 'lcs', 'for', 'strings', 'x', 'and', 'y', 'of', 'length', 'n', 'a', 'textbook', 'algorithm', 'solves', 'lcs', 'in', 'time', 'on2', 'but', 'although', 'much', 'effort', 'has',... | [-0.13563638799691247, 0.06999921109054023, -0.06122191981379327, 0.0998811544796611, -0.08340627318612727, -0.16904657460488975, 0.0986943981809926, 0.37277248489846115, -0.27781741704967444, -0.3485548777681414, 0.08976316866129339, -0.2386538307215634, -0.10663370133685843, 0.2116829810234854, -0.0925726515648628, 0... |
1,803.00939 | Current and future constraints on Higgs couplings in the nonlinear
Effective Theory | We perform a Bayesian statistical analysis of the constraints on the
nonlinear Effective Theory given by the Higgs electroweak chiral Lagrangian. We
obtain bounds on the effective coefficients entering in Higgs observables at
the leading order, using all available Higgs-boson signal strengths from the
LHC runs 1 and ... | hep-ph hep-ex | we perform a bayesian statistical analysis of the constraints on the nonlinear effective theory given by the higgs electroweak chiral lagrangian we obtain bounds on the effective coefficients entering in higgs observables at the leading order using all available higgsboson signal strengths from the lhc runs 1 and 2 usi... | [['we', 'perform', 'a', 'bayesian', 'statistical', 'analysis', 'of', 'the', 'constraints', 'on', 'the', 'nonlinear', 'effective', 'theory', 'given', 'by', 'the', 'higgs', 'electroweak', 'chiral', 'lagrangian', 'we', 'obtain', 'bounds', 'on', 'the', 'effective', 'coefficients', 'entering', 'in', 'higgs', 'observables', ... | [-0.08684240987274758, 0.1254885655818219, -0.07318187876575694, 0.11623129248859111, -0.0743841234757805, -0.09945501132685806, 0.030872683908511913, 0.32698062302775144, -0.20547231116341716, -0.27166377062208413, 0.09349285227669038, -0.2826074185425934, -0.1206627727591807, 0.17359050597573064, 0.04918059005315617,... |
1,803.0094 | Protecting JPEG Images Against Adversarial Attacks | As deep neural networks (DNNs) have been integrated into critical systems,
several methods to attack these systems have been developed. These adversarial
attacks make imperceptible modifications to an image that fool DNN classifiers.
We present an adaptive JPEG encoder which defends against many of these
attacks. Exp... | cs.CV cs.GR | as deep neural networks dnns have been integrated into critical systems several methods to attack these systems have been developed these adversarial attacks make imperceptible modifications to an image that fool dnn classifiers we present an adaptive jpeg encoder which defends against many of these attacks experimenta... | [['as', 'deep', 'neural', 'networks', 'dnns', 'have', 'been', 'integrated', 'into', 'critical', 'systems', 'several', 'methods', 'to', 'attack', 'these', 'systems', 'have', 'been', 'developed', 'these', 'adversarial', 'attacks', 'make', 'imperceptible', 'modifications', 'to', 'an', 'image', 'that', 'fool', 'dnn', 'clas... | [-0.07845938479233729, -0.024330499007881277, -0.09242957593186905, 0.05483834523903696, -0.04426988316209693, -0.27280919077365023, 0.0006533043679634208, 0.4884694501855656, -0.2571751969033166, -0.32870657028336275, 0.11154355777697147, -0.2652157050900553, -0.23875168957502435, 0.23158807565479564, -0.1968736365535... |
1,803.00941 | Ignition of detonation in accreted helium | Sub-Chandrasekhar CO white dwarfs accreting helium have been considered as
candidates for Type Ia supernova(SNIa) progenitors since the early 1980s
(helium shell mass $> 0.1 M_\odot $). These models, once detonated did not fit
the observed spectra and light curve of typical SNIa observations. New
theoretical work exa... | astro-ph.HE | subchandrasekhar co white dwarfs accreting helium have been considered as candidates for type ia supernovasnia progenitors since the early 1980s helium shell mass 01 m_odot these models once detonated did not fit the observed spectra and light curve of typical snia observations new theoretical work examined detonations... | [['subchandrasekhar', 'co', 'white', 'dwarfs', 'accreting', 'helium', 'have', 'been', 'considered', 'as', 'candidates', 'for', 'type', 'ia', 'supernovasnia', 'progenitors', 'since', 'the', 'early', '1980s', 'helium', 'shell', 'mass', '01', 'm_odot', 'these', 'models', 'once', 'detonated', 'did', 'not', 'fit', 'the', 'o... | [-0.054121999125680435, 0.11040878950148683, -0.05957596271558442, 0.10332664335691438, -0.0848654087373278, -0.13413624741359556, 0.047020901244883714, 0.37965216159210663, -0.19021572085072708, -0.30438269446480326, 0.09380586944784211, -0.2654014423764383, -0.060232797919863225, 0.21485574174398325, -0.0524227647481... |
1,803.00942 | Not All Samples Are Created Equal: Deep Learning with Importance
Sampling | Deep neural network training spends most of the computation on examples that
are properly handled, and could be ignored. We propose to mitigate this
phenomenon with a principled importance sampling scheme that focuses
computation on "informative" examples, and reduces the variance of the
stochastic gradients during t... | cs.LG | deep neural network training spends most of the computation on examples that are properly handled and could be ignored we propose to mitigate this phenomenon with a principled importance sampling scheme that focuses computation on informative examples and reduces the variance of the stochastic gradients during training... | [['deep', 'neural', 'network', 'training', 'spends', 'most', 'of', 'the', 'computation', 'on', 'examples', 'that', 'are', 'properly', 'handled', 'and', 'could', 'be', 'ignored', 'we', 'propose', 'to', 'mitigate', 'this', 'phenomenon', 'with', 'a', 'principled', 'importance', 'sampling', 'scheme', 'that', 'focuses', 'co... | [-0.07569790891702137, 0.04732855386504408, -0.06398489113405137, 0.08372694592201901, -0.07880464856993527, -0.14176905794189343, 0.10445277438979717, 0.43060469062578294, -0.26327746826028753, -0.36349304640485397, 0.09565731751912784, -0.2272031540877276, -0.1504284944595589, 0.22488743732833574, -0.1405200054084191... |
1,803.00943 | Widespread HCN maser emission in carbon-rich evolved stars | Context. HCN is a major constituent of the circumstellar envelopes of
carbon-rich evolved stars, and rotational lines from within its vibrationally
excited states probe parts of these regions closest to the stellar surface. A
number of such lines are known to show maser action. Historically, in one of
them, the 177 G... | astro-ph.SR | context hcn is a major constituent of the circumstellar envelopes of carbonrich evolved stars and rotational lines from within its vibrationally excited states probe parts of these regions closest to the stellar surface a number of such lines are known to show maser action historically in one of them the 177 ghz j2righ... | [['context', 'hcn', 'is', 'a', 'major', 'constituent', 'of', 'the', 'circumstellar', 'envelopes', 'of', 'carbonrich', 'evolved', 'stars', 'and', 'rotational', 'lines', 'from', 'within', 'its', 'vibrationally', 'excited', 'states', 'probe', 'parts', 'of', 'these', 'regions', 'closest', 'to', 'the', 'stellar', 'surface',... | [-0.099605693067534, 0.07527828730458777, 0.012187356255787212, 0.007387927906151392, -0.067722199796369, -0.11870854259395283, 0.06785893592503156, 0.4621467383974415, -0.11070648169210988, -0.2921546367253727, 0.07082899261630822, -0.3002339492562982, -0.015425266679669694, 0.14349299528100712, -0.0013691904674115495... |
1,803.00944 | Dolphin: a task orchestration language for autonomous vehicle networks | We present Dolphin, an extensible programming language for autonomous vehicle
networks. A Dolphin program expresses an orchestrated execution of tasks
defined compositionally for multiple vehicles. Building upon the base case of
elementary one-vehicle tasks, the built-in operators include support for
composing tasks ... | cs.RO | we present dolphin an extensible programming language for autonomous vehicle networks a dolphin program expresses an orchestrated execution of tasks defined compositionally for multiple vehicles building upon the base case of elementary onevehicle tasks the builtin operators include support for composing tasks in sever... | [['we', 'present', 'dolphin', 'an', 'extensible', 'programming', 'language', 'for', 'autonomous', 'vehicle', 'networks', 'a', 'dolphin', 'program', 'expresses', 'an', 'orchestrated', 'execution', 'of', 'tasks', 'defined', 'compositionally', 'for', 'multiple', 'vehicles', 'building', 'upon', 'the', 'base', 'case', 'of',... | [-0.22142014340768812, 0.0058640608245007315, -0.022910339911513537, 0.012878303602563887, -0.1509111339827656, -0.17547720575759423, 0.009326226962956338, 0.43004432957149247, -0.24613594757483423, -0.3602000399700646, 0.09355984189891194, -0.20989321589072063, -0.1637279900379741, 0.2830399470381186, -0.1590763889230... |
1,803.00945 | Low-energy Effects of Lepton Flavour Universality Violation | The persisting anomalous data in semileptonic B-decays point towards New
Physics models exhibiting large sources of Lepton Flavour Universality
Violation. In this work we generalise previous studies by considering
frameworks which include an enlarged set of semileptonic four-fermion operators
invariant under the SM g... | hep-ph | the persisting anomalous data in semileptonic bdecays point towards new physics models exhibiting large sources of lepton flavour universality violation in this work we generalise previous studies by considering frameworks which include an enlarged set of semileptonic fourfermion operators invariant under the sm gauge ... | [['the', 'persisting', 'anomalous', 'data', 'in', 'semileptonic', 'bdecays', 'point', 'towards', 'new', 'physics', 'models', 'exhibiting', 'large', 'sources', 'of', 'lepton', 'flavour', 'universality', 'violation', 'in', 'this', 'work', 'we', 'generalise', 'previous', 'studies', 'by', 'considering', 'frameworks', 'whic... | [-0.0991851497474272, 0.19291243574582495, -0.01584718181493372, 0.15549238135099586, -0.08189851928727876, -0.1917763645742525, 0.08230764230484056, 0.23766932195394475, -0.21046530967032595, -0.2932153789297445, 0.028407895333657507, -0.31283695912838994, -0.060795065150159644, 0.14714302599713847, 0.0274190094719841... |
1,803.00946 | LINER galaxy properties and the local environment | We analyse the properties of a sample of 5560 LINER galaxies selected from
SDSS-DR12 at low redshift, for a complete range of local density environments.
The host LINER galaxies were studied and compared with a well-defined control
sample of 5553 non-LINER galaxies matched in red shift, luminosity, morphology
and loc... | astro-ph.GA | we analyse the properties of a sample of 5560 liner galaxies selected from sdssdr12 at low redshift for a complete range of local density environments the host liner galaxies were studied and compared with a welldefined control sample of 5553 nonliner galaxies matched in red shift luminosity morphology and local densit... | [['we', 'analyse', 'the', 'properties', 'of', 'a', 'sample', 'of', '5560', 'liner', 'galaxies', 'selected', 'from', 'sdssdr12', 'at', 'low', 'redshift', 'for', 'a', 'complete', 'range', 'of', 'local', 'density', 'environments', 'the', 'host', 'liner', 'galaxies', 'were', 'studied', 'and', 'compared', 'with', 'a', 'well... | [-0.01182845546131595, 0.10323274611526043, -0.0897632652211567, 0.12333006234412053, -0.07031449900410999, -0.03569594458562099, 0.06320814879287577, 0.4612585869858242, -0.08916494099012283, -0.38398465307805457, 0.018115837442876658, -0.3013910757877291, 0.0009948355298786656, 0.17838369437139218, -0.050020395336506... |
1,803.00947 | A nonlinear Stokes-Biot model for the interaction of a non-Newtonian
fluid with poroelastic media | We develop and analyze a model for the interaction of a quasi-Newtonian free
fluid with a poroelastic medium. The flow in the fluid region is described by
the nonlinear Stokes equations and in the poroelastic medium by the nonlinear
quasi-static Biot model. Equilibrium and kinematic conditions are imposed on
the inte... | math.NA | we develop and analyze a model for the interaction of a quasinewtonian free fluid with a poroelastic medium the flow in the fluid region is described by the nonlinear stokes equations and in the poroelastic medium by the nonlinear quasistatic biot model equilibrium and kinematic conditions are imposed on the interface ... | [['we', 'develop', 'and', 'analyze', 'a', 'model', 'for', 'the', 'interaction', 'of', 'a', 'quasinewtonian', 'free', 'fluid', 'with', 'a', 'poroelastic', 'medium', 'the', 'flow', 'in', 'the', 'fluid', 'region', 'is', 'described', 'by', 'the', 'nonlinear', 'stokes', 'equations', 'and', 'in', 'the', 'poroelastic', 'mediu... | [-0.13866015357407144, 0.0745327070964357, -0.10500510721706235, 0.019799712712530237, -0.049251157323268645, -0.10730818727722344, 0.006493997434751155, 0.3253624492014448, -0.29115771638372767, -0.24459212651858345, 0.13912979748923904, -0.24670985515396565, -0.12443947626086764, 0.11109058155964774, 0.00220616323871... |
1,803.00948 | Alternatives for Generating a Reduced Basis to Solve the Hyperspectral
Diffuse Optical Tomography Model | The Reduced Basis Method (RBM) is a model reduction technique used to solve
parametric PDEs that relies upon a basis set of solutions to the PDE at
specific parameter values. To generate this reduced basis, the set of a small
number of parameter values must be strategically chosen. We apply a Metropolis
algorithm and... | math.NA math.AP | the reduced basis method rbm is a model reduction technique used to solve parametric pdes that relies upon a basis set of solutions to the pde at specific parameter values to generate this reduced basis the set of a small number of parameter values must be strategically chosen we apply a metropolis algorithm and a grad... | [['the', 'reduced', 'basis', 'method', 'rbm', 'is', 'a', 'model', 'reduction', 'technique', 'used', 'to', 'solve', 'parametric', 'pdes', 'that', 'relies', 'upon', 'a', 'basis', 'set', 'of', 'solutions', 'to', 'the', 'pde', 'at', 'specific', 'parameter', 'values', 'to', 'generate', 'this', 'reduced', 'basis', 'the', 'se... | [-0.038496911817797894, 0.03939294746393936, -0.11046850456051617, 0.04861557051076515, -0.09869593337795438, -0.14915702397764258, 0.05777423079924647, 0.37395905882406694, -0.3083809269461285, -0.29793689460645173, 0.10764752922251754, -0.24534681185352555, -0.11763496618420327, 0.23476487229930887, -0.04995727691435... |
1,803.00949 | Tree Species Identification from Bark Images Using Convolutional Neural
Networks | Tree species identification using bark images is a challenging problem that
could prove useful for many forestry related tasks. However, while the recent
progress in deep learning showed impressive results on standard vision
problems, a lack of datasets prevented its use on tree bark species
classification. In this w... | cs.CV | tree species identification using bark images is a challenging problem that could prove useful for many forestry related tasks however while the recent progress in deep learning showed impressive results on standard vision problems a lack of datasets prevented its use on tree bark species classification in this work we... | [['tree', 'species', 'identification', 'using', 'bark', 'images', 'is', 'a', 'challenging', 'problem', 'that', 'could', 'prove', 'useful', 'for', 'many', 'forestry', 'related', 'tasks', 'however', 'while', 'the', 'recent', 'progress', 'in', 'deep', 'learning', 'showed', 'impressive', 'results', 'on', 'standard', 'visio... | [-0.04792601581338156, 0.041139336951011116, -0.03948158462452212, 0.03900175944574202, -0.08291513789261348, -0.10866953083467179, 0.08492466627687559, 0.42277716703124735, -0.23781364895617835, -0.3524226542029187, 0.07898333274505076, -0.3033845836210898, -0.15245817745668128, 0.2295373997430464, -0.0956545639721872... |
1,803.0095 | Multi-jet merged top-pair production including electroweak corrections | We present theoretical predictions for the production of top-quark pairs in
association with jets at the LHC including electroweak (EW) corrections. First,
we present and compare differential predictions at the fixed-order level for $t
\bar t$ and $t \bar t+$jet production at the LHC considering the dominant NLO
EW c... | hep-ph hep-ex | we present theoretical predictions for the production of topquark pairs in association with jets at the lhc including electroweak ew corrections first we present and compare differential predictions at the fixedorder level for t bar t and t bar tjet production at the lhc considering the dominant nlo ew corrections of o... | [['we', 'present', 'theoretical', 'predictions', 'for', 'the', 'production', 'of', 'topquark', 'pairs', 'in', 'association', 'with', 'jets', 'at', 'the', 'lhc', 'including', 'electroweak', 'ew', 'corrections', 'first', 'we', 'present', 'and', 'compare', 'differential', 'predictions', 'at', 'the', 'fixedorder', 'level',... | [-0.03208651111429575, 0.15646388491417013, -0.08380099508608466, 0.17283703751005322, -0.005808375570109313, -0.11794084553534473, 0.015892577736787677, 0.3679773249274608, -0.1883894625929121, -0.3036182276832247, -0.019933066238169966, -0.3644190662082322, 0.06929184033680093, 0.12898778983446074, 0.0862116566463599... |
1,803.00951 | Multimodal Registration of Retinal Images Using Domain-Specific
Landmarks and Vessel Enhancement | The analysis of different image modalities is frequently performed in
ophthalmology as it provides complementary information for the diagnosis and
follow-up of relevant diseases, like hypertension or diabetes. This work
presents a hybrid method for the multimodal registration of color fundus
retinography and fluoresc... | cs.CV | the analysis of different image modalities is frequently performed in ophthalmology as it provides complementary information for the diagnosis and followup of relevant diseases like hypertension or diabetes this work presents a hybrid method for the multimodal registration of color fundus retinography and fluorescein a... | [['the', 'analysis', 'of', 'different', 'image', 'modalities', 'is', 'frequently', 'performed', 'in', 'ophthalmology', 'as', 'it', 'provides', 'complementary', 'information', 'for', 'the', 'diagnosis', 'and', 'followup', 'of', 'relevant', 'diseases', 'like', 'hypertension', 'or', 'diabetes', 'this', 'work', 'presents',... | [-9.139081107563587e-05, -0.07646828836111519, -0.10595697083365206, 0.06367875782504823, -0.04560519550038382, -0.16683584752005584, 0.015211269547821048, 0.4343880481778755, -0.16689552510276848, -0.3246044183508792, 0.07706330636080456, -0.2873063297993546, -0.20572053807907217, 0.22841529215583492, -0.1588953955338... |
1,803.00952 | Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees
Embedded | Decision trees usefully represent sparse, high dimensional and noisy data.
Having learned a function from this data, we may want to thereafter integrate
the function into a larger decision-making problem, e.g., for picking the best
chemical process catalyst. We study a large-scale, industrially-relevant
mixed-integer... | math.OC cs.AI | decision trees usefully represent sparse high dimensional and noisy data having learned a function from this data we may want to thereafter integrate the function into a larger decisionmaking problem eg for picking the best chemical process catalyst we study a largescale industriallyrelevant mixedinteger nonlinear nonc... | [['decision', 'trees', 'usefully', 'represent', 'sparse', 'high', 'dimensional', 'and', 'noisy', 'data', 'having', 'learned', 'a', 'function', 'from', 'this', 'data', 'we', 'may', 'want', 'to', 'thereafter', 'integrate', 'the', 'function', 'into', 'a', 'larger', 'decisionmaking', 'problem', 'eg', 'for', 'picking', 'the... | [-0.04075955969747156, -0.01730538213066341, -0.08906489316972771, 0.13649912110212037, -0.19793686158955098, -0.20680146337752894, 0.11593437681440263, 0.43919995365930453, -0.3498645759985915, -0.3132003029459156, 0.140300339643831, -0.24615471775635211, -0.19501679773841585, 0.1444763567631266, -0.11596965197739857,... |
1,803.00953 | A measure theoretic approach to traffic flow optimization on networks | We consider a class of optimal control problems for measure-valued nonlinear
transport equations describing traffic flow problems on networks. The objective
isto minimise/maximise macroscopic quantities, such as traffic volume or
average speed,controlling few agents, for example smart traffic lights and
automated car... | math.OC math.AP | we consider a class of optimal control problems for measurevalued nonlinear transport equations describing traffic flow problems on networks the objective isto minimisemaximise macroscopic quantities such as traffic volume or average speedcontrolling few agents for example smart traffic lights and automated cars the me... | [['we', 'consider', 'a', 'class', 'of', 'optimal', 'control', 'problems', 'for', 'measurevalued', 'nonlinear', 'transport', 'equations', 'describing', 'traffic', 'flow', 'problems', 'on', 'networks', 'the', 'objective', 'isto', 'minimisemaximise', 'macroscopic', 'quantities', 'such', 'as', 'traffic', 'volume', 'or', 'a... | [-0.16531214518754772, 0.0429888375460951, -0.0702090577100112, 0.08301622013918905, -0.07509109721932974, -0.1773135418994258, 0.08271334088299273, 0.35863602718319554, -0.2914220920641615, -0.3053075199466989, 0.1408559456932114, -0.27067634692627845, -0.1616479977024625, 0.21751885616333422, -0.1288913287495197, 0.1... |
1,803.00954 | An Effective Multi-Cue Positioning System for Agricultural Robotics | The self-localization capability is a crucial component for Unmanned Ground
Vehicles (UGV) in farming applications. Approaches based solely on visual cues
or on low-cost GPS are easily prone to fail in such scenarios. In this paper,
we present a robust and accurate 3D global pose estimation framework, designed
to tak... | cs.RO | the selflocalization capability is a crucial component for unmanned ground vehicles ugv in farming applications approaches based solely on visual cues or on lowcost gps are easily prone to fail in such scenarios in this paper we present a robust and accurate 3d global pose estimation framework designed to take full adv... | [['the', 'selflocalization', 'capability', 'is', 'a', 'crucial', 'component', 'for', 'unmanned', 'ground', 'vehicles', 'ugv', 'in', 'farming', 'applications', 'approaches', 'based', 'solely', 'on', 'visual', 'cues', 'or', 'on', 'lowcost', 'gps', 'are', 'easily', 'prone', 'to', 'fail', 'in', 'such', 'scenarios', 'in', '... | [-0.108895036839224, 0.030752998495731373, -0.05074414986373829, 0.006801981255847942, -0.08868555025440719, -0.16260384747946607, 0.0392770590122991, 0.424750978193645, -0.25801045316147614, -0.35062978047736476, 0.12604699952796267, -0.2714850213252503, -0.19109735199883396, 0.20527602653844934, -0.1662447233409093, ... |
1,803.00955 | Global solution of the initial value problem for the focusing
Davey-Stewartson II system | We consider the two dimensional focusing Davey-Stewartson II system and
construct the global solution of the Cauchy problem for a dense in $L^2(\mathbb
C)$ set of initial data. We do not assume that the initial data is small. So,
the solutions may have singularities. We show that the blow-up may occur only
on a real ... | math-ph math.AP math.MP nlin.SI | we consider the two dimensional focusing daveystewartson ii system and construct the global solution of the cauchy problem for a dense in l2mathbb c set of initial data we do not assume that the initial data is small so the solutions may have singularities we show that the blowup may occur only on a real analytic varie... | [['we', 'consider', 'the', 'two', 'dimensional', 'focusing', 'daveystewartson', 'ii', 'system', 'and', 'construct', 'the', 'global', 'solution', 'of', 'the', 'cauchy', 'problem', 'for', 'a', 'dense', 'in', 'l2mathbb', 'c', 'set', 'of', 'initial', 'data', 'we', 'do', 'not', 'assume', 'that', 'the', 'initial', 'data', 'i... | [-0.19147102871690602, 0.05903477820239084, -0.04193662405561875, 0.05288280677118832, -0.08041426747599069, -0.15374583724940963, -0.01980354849879137, 0.35463663105688553, -0.27609675142037515, -0.19900827416602304, 0.19155795818454968, -0.29276755701421814, -0.10541550638428067, 0.18005504011457293, -0.0539450283737... |
1,803.00956 | Diagnostics upgrades for investigations of HOM effects in Tesla-type
SCRF cavities | We describe the upgrades to diagnostic capabilities on the Fermilab
Accelerator Science and Technology (FAST) electron linear accelerator that will
allow investigations of the effects of high-order modes (HOMs) in SCRF cavities
on macropulse-average beam quality. We examine the dipole modes in the first
pass-band gen... | physics.acc-ph | we describe the upgrades to diagnostic capabilities on the fermilab accelerator science and technology fast electron linear accelerator that will allow investigations of the effects of highorder modes homs in scrf cavities on macropulseaverage beam quality we examine the dipole modes in the first passband generally obs... | [['we', 'describe', 'the', 'upgrades', 'to', 'diagnostic', 'capabilities', 'on', 'the', 'fermilab', 'accelerator', 'science', 'and', 'technology', 'fast', 'electron', 'linear', 'accelerator', 'that', 'will', 'allow', 'investigations', 'of', 'the', 'effects', 'of', 'highorder', 'modes', 'homs', 'in', 'scrf', 'cavities',... | [-0.08654692039934096, 0.16159782056730274, -0.02835918764944549, 0.03179525204741203, -0.048119102780883376, -0.16810503929249337, -0.01839844983591287, 0.4786790850664581, -0.1846032775151921, -0.3213611424518833, 0.08549804472981172, -0.2897090389821175, 0.0428149993762139, 0.2656609069163752, 0.0007968369477034152,... |
1,803.00957 | New copulas based on general partitions-of-unity (part III) - the
continuous case (extended version) | In this paper we discuss a natural extension of infinite discrete
partition-of-unity copulas which were recently introduced in the literature to
continuous partition of copulas with possible applications in risk management
and other fields. We present a general simple algorithm to generate such
copulas on the basis o... | q-fin.RM | in this paper we discuss a natural extension of infinite discrete partitionofunity copulas which were recently introduced in the literature to continuous partition of copulas with possible applications in risk management and other fields we present a general simple algorithm to generate such copulas on the basis of the... | [['in', 'this', 'paper', 'we', 'discuss', 'a', 'natural', 'extension', 'of', 'infinite', 'discrete', 'partitionofunity', 'copulas', 'which', 'were', 'recently', 'introduced', 'in', 'the', 'literature', 'to', 'continuous', 'partition', 'of', 'copulas', 'with', 'possible', 'applications', 'in', 'risk', 'management', 'and... | [-0.01723012792713502, 0.03025283195396803, -0.1106020532822346, 0.13081660494208336, -0.1132102032411186, -0.12180915698956918, 0.03380476802943603, 0.42768045909264507, -0.25164175693164853, -0.23350887811359236, 0.11161914810620467, -0.2193192001486964, -0.1569262665860793, 0.19377056045786423, -0.1223082255161203, ... |
1,803.00958 | A study in $\mathbb{G}_{\mathbb{R}, \geq 0}$: from the geometric case
book of Wilson loop diagrams and SYM $N=4$ | We study the geometry underlying the Wilson loop diagram approach to
calculating scattering amplitudes in the gauge theory of Supersymmetric Yang
Mills (SYM) $N=4$. By applying the tools developed to study total positivity in
the real Grassmannian, we are able to systematically compute with all Wilson
loop diagrams o... | math.CO math-ph math.MP | we study the geometry underlying the wilson loop diagram approach to calculating scattering amplitudes in the gauge theory of supersymmetric yang mills sym n4 by applying the tools developed to study total positivity in the real grassmannian we are able to systematically compute with all wilson loop diagrams of a given... | [['we', 'study', 'the', 'geometry', 'underlying', 'the', 'wilson', 'loop', 'diagram', 'approach', 'to', 'calculating', 'scattering', 'amplitudes', 'in', 'the', 'gauge', 'theory', 'of', 'supersymmetric', 'yang', 'mills', 'sym', 'n4', 'by', 'applying', 'the', 'tools', 'developed', 'to', 'study', 'total', 'positivity', 'i... | [-0.15105956941117823, 0.1401055857355966, -0.04590431095452094, 0.10396354574400962, -0.046412953381716714, -0.10868109501211247, 0.05440126210699224, 0.34770827766385726, -0.20136609762052043, -0.2652599603456796, 0.06220940969785156, -0.30134769614411855, -0.23104044007229024, 0.11078870500395929, -0.073576741473993... |
1,803.00959 | Robustness of the Insulating Bulk in the Topological Kondo Insulator
SmB$_{6}$ | We used the inverted resistance method to extend the bulk resistivity of
SmB$_{6}$ to a regime where the surface conduction overwhelms the bulk.
Remarkably, the bulk resistivity shows an intrinsic thermally activated
behavior that changes ten orders of magnitude, suggesting that it is an ideal
insulator that is immun... | cond-mat.str-el | we used the inverted resistance method to extend the bulk resistivity of smb_6 to a regime where the surface conduction overwhelms the bulk remarkably the bulk resistivity shows an intrinsic thermally activated behavior that changes ten orders of magnitude suggesting that it is an ideal insulator that is immune to diso... | [['we', 'used', 'the', 'inverted', 'resistance', 'method', 'to', 'extend', 'the', 'bulk', 'resistivity', 'of', 'smb_6', 'to', 'a', 'regime', 'where', 'the', 'surface', 'conduction', 'overwhelms', 'the', 'bulk', 'remarkably', 'the', 'bulk', 'resistivity', 'shows', 'an', 'intrinsic', 'thermally', 'activated', 'behavior',... | [-0.11370256236918709, 0.23724838639797835, -0.06912184719763258, 0.03050736146979034, -0.02938572686877759, -0.19045741231016378, 0.08883664216024473, 0.34799653098863714, -0.30553155318450403, -0.29561685428899875, -0.0024947150021462756, -0.3507829862537191, -0.16162022299626294, 0.19227098538814222, -0.032818790486... |
1,803.0096 | Fitting and Analysis Technique for Inconsistent Nuclear Data | Consistent experiment data are crucial to adjust parameters of physics models
and to determine best estimates of observables. However, often experiment data
are not consistent due to unrecognized systematic errors. Standard methods of
statistics such as $\chi^2$-fitting cannot deal with this case. Their
predictions b... | nucl-th nucl-ex physics.data-an | consistent experiment data are crucial to adjust parameters of physics models and to determine best estimates of observables however often experiment data are not consistent due to unrecognized systematic errors standard methods of statistics such as chi2fitting cannot deal with this case their predictions become doubt... | [['consistent', 'experiment', 'data', 'are', 'crucial', 'to', 'adjust', 'parameters', 'of', 'physics', 'models', 'and', 'to', 'determine', 'best', 'estimates', 'of', 'observables', 'however', 'often', 'experiment', 'data', 'are', 'not', 'consistent', 'due', 'to', 'unrecognized', 'systematic', 'errors', 'standard', 'met... | [-0.027755351271480322, 0.04821723791675863, -0.10079666970817086, 0.15690827564909482, -0.1229171772988943, -0.152581308541509, 0.08336478578022276, 0.376973803447655, -0.26137128015621924, -0.37967917697731024, 0.12123332037262093, -0.31328489947386867, -0.06627803857032305, 0.21014830889628053, -0.15482530891387844,... |
1,803.00961 | Full and unbiased solution of the Dyson-Schwinger equation in the
functional integro-differential representation | We provide a full and unbiased solution to the Dyson-Schwinger equation
illustrated for $\phi^4$ theory in 2D. It is based on an exact treatment of the
functional derivative $\partial \Gamma / \partial G$ of the 4-point vertex
function $\Gamma$ with respect to the 2-point correlation function $G$ within
the framework... | cond-mat.stat-mech hep-lat | we provide a full and unbiased solution to the dysonschwinger equation illustrated for phi4 theory in 2d it is based on an exact treatment of the functional derivative partial gamma partial g of the 4point vertex function gamma with respect to the 2point correlation function g within the framework of the homotopy analy... | [['we', 'provide', 'a', 'full', 'and', 'unbiased', 'solution', 'to', 'the', 'dysonschwinger', 'equation', 'illustrated', 'for', 'phi4', 'theory', 'in', '2d', 'it', 'is', 'based', 'on', 'an', 'exact', 'treatment', 'of', 'the', 'functional', 'derivative', 'partial', 'gamma', 'partial', 'g', 'of', 'the', '4point', 'vertex... | [-0.10966047291070796, 0.09549989557954877, -0.12851420818881776, 0.08245554948673368, -0.09229905016075533, -0.10794601766034388, 0.054967709338570085, 0.3708194182540935, -0.2760367811585848, -0.26941028633020603, 0.0860295305100198, -0.3037395498966082, -0.15591346030213082, 0.17751209632529374, 0.009552437573886262... |
1,803.00962 | Broadband spectroscopy of thermodynamic magnetization fluctuations
through a ferromagnetic spin-reorientation transition | We use scanning optical magnetometry to study the broadband frequency spectra
of spontaneous magnetization fluctuations, or "magnetization noise", in an
archetypal ferromagnetic film that can be smoothly tuned through a spin
reorientation transition (SRT). The SRT is achieved by laterally varying the
magnetic anisotr... | cond-mat.mtrl-sci cond-mat.mes-hall | we use scanning optical magnetometry to study the broadband frequency spectra of spontaneous magnetization fluctuations or magnetization noise in an archetypal ferromagnetic film that can be smoothly tuned through a spin reorientation transition srt the srt is achieved by laterally varying the magnetic anisotropy acros... | [['we', 'use', 'scanning', 'optical', 'magnetometry', 'to', 'study', 'the', 'broadband', 'frequency', 'spectra', 'of', 'spontaneous', 'magnetization', 'fluctuations', 'or', 'magnetization', 'noise', 'in', 'an', 'archetypal', 'ferromagnetic', 'film', 'that', 'can', 'be', 'smoothly', 'tuned', 'through', 'a', 'spin', 'reo... | [-0.17845137679484363, 0.2333843104392981, -0.06322028679041103, 0.012411958387963235, -0.048355824154687116, -0.13698534130362824, 0.03584183200591189, 0.4371978716257422, -0.30079653927867106, -0.286685945313638, 0.030531504178384846, -0.27008914866828343, -0.08963125964432436, 0.24475843562585187, 0.0371105857366225... |
1,803.00963 | Entire functions arising from trees | Given any infinite tree in the plane satisfying certain topological
conditions, we construct an entire function $f$ with only two critical values
$\pm 1$ and no asymptotic values such that $f^{-1}([-1,1])$ is ambiently
homeomorphic to the given tree. This can be viewed as a generalization of a
result of Grothendieck ... | math.CV | given any infinite tree in the plane satisfying certain topological conditions we construct an entire function f with only two critical values pm 1 and no asymptotic values such that f111 is ambiently homeomorphic to the given tree this can be viewed as a generalization of a result of grothendieck to the case of infini... | [['given', 'any', 'infinite', 'tree', 'in', 'the', 'plane', 'satisfying', 'certain', 'topological', 'conditions', 'we', 'construct', 'an', 'entire', 'function', 'f', 'with', 'only', 'two', 'critical', 'values', 'pm', '1', 'and', 'no', 'asymptotic', 'values', 'such', 'that', 'f111', 'is', 'ambiently', 'homeomorphic', 't... | [-0.16229496730698478, 0.11463620610225513, -0.1136643384266386, 0.08197379334726268, -0.09251328905358808, -0.11025331444236347, 0.07624837737562808, 0.28651031396455234, -0.2706518584551911, -0.2548929817922827, 0.10383087696552845, -0.23403728367864257, -0.15241360441238308, 0.19591186390930992, -0.11780304142868975... |
1,803.00964 | An influence of the spectator-nuclear motion on nonresonant formation of
the muonic hydrogen molecules | A model for description of nonresonant formation of the muonic molecules in
collisions of the muonic hydrogen atoms with the hydrogenic molecules has been
developed with taking into account the internal motion of all nuclei. It has
been shown that such a motion leads to a significant smearing of the calculated
energy... | physics.atom-ph | a model for description of nonresonant formation of the muonic molecules in collisions of the muonic hydrogen atoms with the hydrogenic molecules has been developed with taking into account the internal motion of all nuclei it has been shown that such a motion leads to a significant smearing of the calculated energydep... | [['a', 'model', 'for', 'description', 'of', 'nonresonant', 'formation', 'of', 'the', 'muonic', 'molecules', 'in', 'collisions', 'of', 'the', 'muonic', 'hydrogen', 'atoms', 'with', 'the', 'hydrogenic', 'molecules', 'has', 'been', 'developed', 'with', 'taking', 'into', 'account', 'the', 'internal', 'motion', 'of', 'all',... | [-0.08477740897035453, 0.1743519282041642, -0.04702042527801453, 0.06326233216117476, 0.045265873735248346, -0.0769443690937848, -0.032910637621698186, 0.38711128610177575, -0.17457979099355012, -0.2767601297454578, -0.045916052920326036, -0.30474228290928024, -0.026231264965347598, 0.14589325479388446, 0.0453932599477... |
1,803.00965 | Type-Preserving Matrices and Security of Block Ciphers | We provide a new property, called Non-Type-Preserving, for a mixing layer
which guarantees protection against algebraic attacks based on the
imprimitivity of the group generated by the round functions. Our main result is
to present necessary and sufficient conditions on the structure of the binary
matrix associated t... | math.GR cs.CR | we provide a new property called nontypepreserving for a mixing layer which guarantees protection against algebraic attacks based on the imprimitivity of the group generated by the round functions our main result is to present necessary and sufficient conditions on the structure of the binary matrix associated to the m... | [['we', 'provide', 'a', 'new', 'property', 'called', 'nontypepreserving', 'for', 'a', 'mixing', 'layer', 'which', 'guarantees', 'protection', 'against', 'algebraic', 'attacks', 'based', 'on', 'the', 'imprimitivity', 'of', 'the', 'group', 'generated', 'by', 'the', 'round', 'functions', 'our', 'main', 'result', 'is', 'to... | [-0.1462816273215516, 0.10837326363895233, -0.09131213760902655, 0.018249572515648245, -0.03576191748685107, -0.12281730637468141, 0.0407576063407007, 0.33597848723835216, -0.34216053510277433, -0.22137416637791643, 0.15643086059275887, -0.24810725134508363, -0.20073667806011208, 0.16784468939656327, -0.075198403073089... |
1,803.00966 | Stability and error analysis for the Helmholtz equation with variable
coefficients | We discuss the stability theory and numerical analysis of the Helmholtz
equation with variable and possibly non-smooth or oscillatory coefficients.
Using the unique continuation principle and the Fredholm alternative, we first
give an existence-uniqueness result for this problem, which holds under rather
general cond... | math.NA | we discuss the stability theory and numerical analysis of the helmholtz equation with variable and possibly nonsmooth or oscillatory coefficients using the unique continuation principle and the fredholm alternative we first give an existenceuniqueness result for this problem which holds under rather general conditions ... | [['we', 'discuss', 'the', 'stability', 'theory', 'and', 'numerical', 'analysis', 'of', 'the', 'helmholtz', 'equation', 'with', 'variable', 'and', 'possibly', 'nonsmooth', 'or', 'oscillatory', 'coefficients', 'using', 'the', 'unique', 'continuation', 'principle', 'and', 'the', 'fredholm', 'alternative', 'we', 'first', '... | [-0.12383863201181937, 0.05656649720073412, -0.08760124911038604, 0.03977089156064072, -0.08954360886210842, -0.1008484924451581, 0.04864981808699667, 0.3252544509684334, -0.2838657488447747, -0.2423694711434655, 0.17686576253834313, -0.2510592895586576, -0.15185551762614133, 0.21655990120023488, -0.037665831756645014,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.