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.02267 | An overview of $\Lambda_c$ decays | The decays of the ground-state charmed baryon $\Lambda_c$ are now close to
being completely mapped out. In this paper we discuss some remaining open
questions, whose answers can help shed light on weak processes contributing to
those decays, on calculations of such quantities as transition form factors in
lattice QCD, and on missing decay modes such as $\Lambda_c \to \Lambda^* \ell^+
\nu_\ell$, where $\Lambda^*$ is an excited resonance. The discussion is in part
a counterpart to a previous analysis of inclusive $D_s$ decays.
| hep-ph hep-ex | the decays of the groundstate charmed baryon lambda_c are now close to being completely mapped out in this paper we discuss some remaining open questions whose answers can help shed light on weak processes contributing to those decays on calculations of such quantities as transition form factors in lattice qcd and on missing decay modes such as lambda_c to lambda ell nu_ell where lambda is an excited resonance the discussion is in part a counterpart to a previous analysis of inclusive d_s decays | [['the', 'decays', 'of', 'the', 'groundstate', 'charmed', 'baryon', 'lambda_c', 'are', 'now', 'close', 'to', 'being', 'completely', 'mapped', 'out', 'in', 'this', 'paper', 'we', 'discuss', 'some', 'remaining', 'open', 'questions', 'whose', 'answers', 'can', 'help', 'shed', 'light', 'on', 'weak', 'processes', 'contributing', 'to', 'those', 'decays', 'on', 'calculations', 'of', 'such', 'quantities', 'as', 'transition', 'form', 'factors', 'in', 'lattice', 'qcd', 'and', 'on', 'missing', 'decay', 'modes', 'such', 'as', 'lambda_c', 'to', 'lambda', 'ell', 'nu_ell', 'where', 'lambda', 'is', 'an', 'excited', 'resonance', 'the', 'discussion', 'is', 'in', 'part', 'a', 'counterpart', 'to', 'a', 'previous', 'analysis', 'of', 'inclusive', 'd_s', 'decays']] | [-0.07961682557319123, 0.22560748617962165, -0.05775682158005166, 0.12577071962793954, -0.08681354574096131, -0.13599337740094367, 0.09507881210280963, 0.30491127607872687, -0.25463433236063243, -0.18471770840192056, 0.027219452310342295, -0.4169642423806959, -0.018564540166295617, 0.12645825633431323, 0.08040427462568125, 0.0812631209089185, 0.06546495613888893, 0.046268102297761356, 0.004126351921403983, -0.2004835505756628, 0.311950510143336, 0.005197804488510971, 0.14605143545083252, 0.1318103355434106, -0.07204409808212195, -0.04813000248834148, -0.039225538649052066, -0.05509614510775869, -0.205454611253128, 0.039027727017577465, 0.2305728878870786, 0.10368807034858737, 0.1878850189407906, -0.3322898090020361, -0.10246164045375154, 0.14559711021909783, 0.255743422997128, 0.12212955079838095, 0.023680104796931774, -0.34092042396540745, 0.10430433189339307, -0.09191553917129984, -0.12487610510314803, -0.134270825389638, 0.041185245748205354, -0.053266596610108054, -0.2875795115503561, 0.06345738922750735, -0.04273831529307168, 0.03151618091995107, -0.020114890647580826, -0.21937117521393013, 0.03804802016007254, 0.08949896111994622, 0.13130432600155473, 0.11788421886670122, 0.15370037566578712, -0.1379837585663625, -0.159532672400216, 0.4150060511766428, -0.04112985327907176, -0.19011742310985608, 0.13530064187663415, -0.1864645165385656, -0.16640479863671787, 0.13568334086203432, 0.20599924878452916, 0.06869787787906377, -0.14940922201263257, 0.10309142825202118, -0.03786447199050292, 0.1873432075021317, 0.06681976998673685, 0.11411268078912813, 0.2118286937082478, 0.1803348994510899, -0.0414742211059454, 0.09904310245246413, -0.0029148482857833066, -0.068278409254524, -0.3724791384694806, -0.13148620423961835, -0.11418292083474527, 0.156052062940133, 0.02973612845634778, -0.13476385350103479, 0.37068608188047913, 0.053011941680045103, 0.31510487156190786, -0.030257378278457255, 0.2937873656278005, 0.0901828063006726, 0.04930284359570907, 0.0719818568463067, 0.2675630296485818, 0.2081611810409161, 0.07824110368221819, -0.2685009755547641, 0.010266612715884504, 0.03187199892386435] |
1,803.02268 | Potential Energy Between Static Quarks Is Time Dependent in The
Classical Yang-Mills Theory | Lattice QCD predicts that the potential energy between static quarks is
independent of time. However, in this paper we show that the gauge invariant
color singlet potential energy between static quarks in the classical
Yang-Mills theory depends on time even if the quarks are at rest. This is a
consequence of the time dependent fundamental color charge $q^a(t)$ of the
quark in the classical Yang-Mills theory. We find that the gauge invariant
color singlet time dependent potential energy between static quarks does not
violate the conservation of energy in the Yang-Mills theory.
| hep-ph hep-lat nucl-th | lattice qcd predicts that the potential energy between static quarks is independent of time however in this paper we show that the gauge invariant color singlet potential energy between static quarks in the classical yangmills theory depends on time even if the quarks are at rest this is a consequence of the time dependent fundamental color charge qat of the quark in the classical yangmills theory we find that the gauge invariant color singlet time dependent potential energy between static quarks does not violate the conservation of energy in the yangmills theory | [['lattice', 'qcd', 'predicts', 'that', 'the', 'potential', 'energy', 'between', 'static', 'quarks', 'is', 'independent', 'of', 'time', 'however', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'gauge', 'invariant', 'color', 'singlet', 'potential', 'energy', 'between', 'static', 'quarks', 'in', 'the', 'classical', 'yangmills', 'theory', 'depends', 'on', 'time', 'even', 'if', 'the', 'quarks', 'are', 'at', 'rest', 'this', 'is', 'a', 'consequence', 'of', 'the', 'time', 'dependent', 'fundamental', 'color', 'charge', 'qat', 'of', 'the', 'quark', 'in', 'the', 'classical', 'yangmills', 'theory', 'we', 'find', 'that', 'the', 'gauge', 'invariant', 'color', 'singlet', 'time', 'dependent', 'potential', 'energy', 'between', 'static', 'quarks', 'does', 'not', 'violate', 'the', 'conservation', 'of', 'energy', 'in', 'the', 'yangmills', 'theory']] | [-0.09730354278935524, 0.30900286291928397, -0.13874982065096012, 0.12094742018203049, -0.03103267118010832, -0.10918451304567735, 0.040394906570841355, 0.3603611983480337, -0.18784651606667624, -0.258182344229325, -0.040956355907205165, -0.2571765429380795, -0.07906792366006614, 0.02695253503549358, -0.018822972774100694, 0.035864481064693435, 0.009543949300322034, 0.09617321939794751, -0.11458782776279132, -0.25058198081450944, 0.33508869325843355, -0.04288608668392281, 0.29320535536491027, 0.203570473038227, 0.09472465637625883, 0.08122166683492453, -0.03450724670825445, -0.023007257016497137, -0.04544134484469554, 0.013897728083817206, 0.16975601821942962, 0.022506280663551675, 0.15228306455537677, -0.43304908741265535, -0.19426344041257043, 0.15323790916464414, 0.09815295790220895, 0.13716039125321675, -0.04982510529605307, -0.21074967724068658, 0.0981804397382328, -0.13561006421830668, -0.1518696632828442, -0.06750762141714602, 0.024703206175573818, -0.03281269174539889, -0.26860253770491516, 0.16188918027783866, 0.0006864057529879653, 0.017266324984476618, -0.06815490105857505, -0.09951643179595956, -0.12218266450698771, 0.060624058382413554, 0.1354980447643396, 0.1118614834672569, 0.11945508030729125, -0.2134816335240865, -0.1386355307287253, 0.4288081190670314, -0.10254908369287201, -0.21285107549603866, 0.15612420052006518, -0.1499713060354976, -0.13662823514871136, 0.05339455716160085, 0.14270417034909452, 0.14348925057413947, -0.15656056624594267, 0.2071539861170332, -0.07951323872270144, 0.22305156875644688, 0.07582285918761045, 0.09065500070320685, 0.24184898226319448, 0.12451323024604631, 0.06167541189200204, 0.06795868336263558, -0.005774411339940422, -0.188232252455276, -0.42134531883968285, -0.13177656405605376, -0.1834935223703961, 0.07827443881836624, -0.13878991947833286, -0.1623952844504105, 0.4185707846595703, 0.1455404823532065, 0.12068803111374703, 0.02036124731555743, 0.2741427564507593, 0.13645108967371608, 0.08861269814002773, 0.10382791510378213, 0.28870799360321026, 0.14171070257282775, 0.15128938222567187, -0.3062807658393665, -0.09291614603210727, 0.1353958765495285] |
1,803.02269 | Personalized Exposure Control Using Adaptive Metering and Reinforcement
Learning | We propose a reinforcement learning approach for real-time exposure control
of a mobile camera that is personalizable. Our approach is based on Markov
Decision Process (MDP). In the camera viewfinder or live preview mode, given
the current frame, our system predicts the change in exposure so as to optimize
the trade-off among image quality, fast convergence, and minimal temporal
oscillation. We model the exposure prediction function as a fully convolutional
neural network that can be trained through Gaussian policy gradient in an
end-to-end fashion. As a result, our system can associate scene semantics with
exposure values; it can also be extended to personalize the exposure
adjustments for a user and device. We improve the learning performance by
incorporating an adaptive metering module that links semantics with exposure.
This adaptive metering module generalizes the conventional spot or matrix
metering techniques. We validate our system using the MIT FiveK and our own
datasets captured using iPhone 7 and Google Pixel. Experimental results show
that our system exhibits stable real-time behavior while improving visual
quality compared to what is achieved through native camera control.
| cs.CV | we propose a reinforcement learning approach for realtime exposure control of a mobile camera that is personalizable our approach is based on markov decision process mdp in the camera viewfinder or live preview mode given the current frame our system predicts the change in exposure so as to optimize the tradeoff among image quality fast convergence and minimal temporal oscillation we model the exposure prediction function as a fully convolutional neural network that can be trained through gaussian policy gradient in an endtoend fashion as a result our system can associate scene semantics with exposure values it can also be extended to personalize the exposure adjustments for a user and device we improve the learning performance by incorporating an adaptive metering module that links semantics with exposure this adaptive metering module generalizes the conventional spot or matrix metering techniques we validate our system using the mit fivek and our own datasets captured using iphone 7 and google pixel experimental results show that our system exhibits stable realtime behavior while improving visual quality compared to what is achieved through native camera control | [['we', 'propose', 'a', 'reinforcement', 'learning', 'approach', 'for', 'realtime', 'exposure', 'control', 'of', 'a', 'mobile', 'camera', 'that', 'is', 'personalizable', 'our', 'approach', 'is', 'based', 'on', 'markov', 'decision', 'process', 'mdp', 'in', 'the', 'camera', 'viewfinder', 'or', 'live', 'preview', 'mode', 'given', 'the', 'current', 'frame', 'our', 'system', 'predicts', 'the', 'change', 'in', 'exposure', 'so', 'as', 'to', 'optimize', 'the', 'tradeoff', 'among', 'image', 'quality', 'fast', 'convergence', 'and', 'minimal', 'temporal', 'oscillation', 'we', 'model', 'the', 'exposure', 'prediction', 'function', 'as', 'a', 'fully', 'convolutional', 'neural', 'network', 'that', 'can', 'be', 'trained', 'through', 'gaussian', 'policy', 'gradient', 'in', 'an', 'endtoend', 'fashion', 'as', 'a', 'result', 'our', 'system', 'can', 'associate', 'scene', 'semantics', 'with', 'exposure', 'values', 'it', 'can', 'also', 'be', 'extended', 'to', 'personalize', 'the', 'exposure', 'adjustments', 'for', 'a', 'user', 'and', 'device', 'we', 'improve', 'the', 'learning', 'performance', 'by', 'incorporating', 'an', 'adaptive', 'metering', 'module', 'that', 'links', 'semantics', 'with', 'exposure', 'this', 'adaptive', 'metering', 'module', 'generalizes', 'the', 'conventional', 'spot', 'or', 'matrix', 'metering', 'techniques', 'we', 'validate', 'our', 'system', 'using', 'the', 'mit', 'fivek', 'and', 'our', 'own', 'datasets', 'captured', 'using', 'iphone', '7', 'and', 'google', 'pixel', 'experimental', 'results', 'show', 'that', 'our', 'system', 'exhibits', 'stable', 'realtime', 'behavior', 'while', 'improving', 'visual', 'quality', 'compared', 'to', 'what', 'is', 'achieved', 'through', 'native', 'camera', 'control']] | [-0.0567394502253996, 0.005345186583549043, -0.10834145509709035, 0.031162730483194737, -0.11255831113343852, -0.19708522119197167, 0.0727074842440844, 0.48500466984437984, -0.27927460119697367, -0.34742323779306994, 0.11629955908865668, -0.26154884457743416, -0.180343762311774, 0.1926038189079716, -0.17396026591822092, 0.07002901314028552, 0.13753650785656646, 0.04799004754879409, -0.03171807382669714, -0.28205588484803834, 0.24324597491003158, 0.09188659258135078, 0.32996130998039414, 0.0001301730957089199, 0.1575949161986096, 0.04407565480925971, 0.008783798099547211, 0.002895076176436204, -0.044467932341083524, 0.10783475944901713, 0.30011677976645945, 0.18985137744651487, 0.2966900106804031, -0.42011855042849977, -0.2232879195155369, 0.04544486258851571, 0.1309068196039233, 0.0443270360915954, -0.049630068112552786, -0.3621075539797958, 0.0779536580233576, -0.22483705939828522, -0.006270763602676905, -0.09897066418521314, -0.06822415657936493, -0.0035586098276932415, -0.34039659638526953, -0.018488298361868754, 0.010578562994487584, 0.0723115724291549, -0.08762275965677367, -0.05410338414496639, 0.019617459807907127, 0.17027423267977104, -0.0022002236668615498, 0.06829422955504721, 0.2122847432606957, -0.1434735848917626, -0.1414523266462816, 0.32340959635459715, -0.10101795094314082, -0.1902417648738871, 0.14864154705881244, -0.028884490832893385, -0.08732996109821316, 0.11663581748855197, 0.21066828919057218, 0.09069182463766386, -0.1769690492681952, 0.007361510723260128, -0.0327876981968681, 0.24091092708986253, 0.03557183514478513, -0.0017588879964831803, 0.16617715311585926, 0.3051266589279597, 0.09510332436507775, 0.1244644078400193, -0.12028198787916658, -0.0639679639833048, -0.23006558326338158, -0.13199617513908177, -0.14867259587028658, -0.014169060825628953, -0.10802326263154909, -0.11628966824953547, 0.3745725033649554, 0.2517318204019426, 0.1575849467008892, 0.13807514109390062, 0.36566317316610364, 0.063662910453018, 0.09586195409194463, 0.07063052393237336, 0.17691720072244707, -0.024691168169697953, 0.18111885778424847, -0.1947554685550535, 0.12304921651828206, 0.03964836471455379] |
1,803.0227 | Revisiting Frequency Moment Estimation in Random Order Streams | We revisit one of the classic problems in the data stream literature, namely,
that of estimating the frequency moments $F_p$ for $0 < p < 2$ of an underlying
$n$-dimensional vector presented as a sequence of additive updates in a stream.
It is well-known that using $p$-stable distributions one can approximate any of
these moments up to a multiplicative $(1+\epsilon)$-factor using
$O(\epsilon^{-2} \log n)$ bits of space, and this space bound is optimal up to
a constant factor in the turnstile streaming model. We show that surprisingly,
if one instead considers the popular random-order model of insertion-only
streams, in which the updates to the underlying vector arrive in a random
order, then one can beat this space bound and achieve $\tilde{O}(\epsilon^{-2}
+ \log n)$ bits of space, where the $\tilde{O}$ hides poly$(\log(1/\epsilon) +
\log \log n)$ factors. If $\epsilon^{-2} \approx \log n$, this represents a
roughly quadratic improvement in the space achievable in turnstile streams. Our
algorithm is in fact deterministic, and we show our space bound is optimal up
to poly$(\log(1/\epsilon) + \log \log n)$ factors for deterministic algorithms
in the random order model. We also obtain a similar improvement in space for $p
= 2$ whenever $F_2 \gtrsim \log n\cdot F_1$.
| cs.DS | we revisit one of the classic problems in the data stream literature namely that of estimating the frequency moments f_p for 0 p 2 of an underlying ndimensional vector presented as a sequence of additive updates in a stream it is wellknown that using pstable distributions one can approximate any of these moments up to a multiplicative 1epsilonfactor using oepsilon2 log n bits of space and this space bound is optimal up to a constant factor in the turnstile streaming model we show that surprisingly if one instead considers the popular randomorder model of insertiononly streams in which the updates to the underlying vector arrive in a random order then one can beat this space bound and achieve tildeoepsilon2 log n bits of space where the tildeo hides polylog1epsilon log log n factors if epsilon2 approx log n this represents a roughly quadratic improvement in the space achievable in turnstile streams our algorithm is in fact deterministic and we show our space bound is optimal up to polylog1epsilon log log n factors for deterministic algorithms in the random order model we also obtain a similar improvement in space for p 2 whenever f_2 gtrsim log ncdot f_1 | [['we', 'revisit', 'one', 'of', 'the', 'classic', 'problems', 'in', 'the', 'data', 'stream', 'literature', 'namely', 'that', 'of', 'estimating', 'the', 'frequency', 'moments', 'f_p', 'for', '0', 'p', '2', 'of', 'an', 'underlying', 'ndimensional', 'vector', 'presented', 'as', 'a', 'sequence', 'of', 'additive', 'updates', 'in', 'a', 'stream', 'it', 'is', 'wellknown', 'that', 'using', 'pstable', 'distributions', 'one', 'can', 'approximate', 'any', 'of', 'these', 'moments', 'up', 'to', 'a', 'multiplicative', '1epsilonfactor', 'using', 'oepsilon2', 'log', 'n', 'bits', 'of', 'space', 'and', 'this', 'space', 'bound', 'is', 'optimal', 'up', 'to', 'a', 'constant', 'factor', 'in', 'the', 'turnstile', 'streaming', 'model', 'we', 'show', 'that', 'surprisingly', 'if', 'one', 'instead', 'considers', 'the', 'popular', 'randomorder', 'model', 'of', 'insertiononly', 'streams', 'in', 'which', 'the', 'updates', 'to', 'the', 'underlying', 'vector', 'arrive', 'in', 'a', 'random', 'order', 'then', 'one', 'can', 'beat', 'this', 'space', 'bound', 'and', 'achieve', 'tildeoepsilon2', 'log', 'n', 'bits', 'of', 'space', 'where', 'the', 'tildeo', 'hides', 'polylog1epsilon', 'log', 'log', 'n', 'factors', 'if', 'epsilon2', 'approx', 'log', 'n', 'this', 'represents', 'a', 'roughly', 'quadratic', 'improvement', 'in', 'the', 'space', 'achievable', 'in', 'turnstile', 'streams', 'our', 'algorithm', 'is', 'in', 'fact', 'deterministic', 'and', 'we', 'show', 'our', 'space', 'bound', 'is', 'optimal', 'up', 'to', 'polylog1epsilon', 'log', 'log', 'n', 'factors', 'for', 'deterministic', 'algorithms', 'in', 'the', 'random', 'order', 'model', 'we', 'also', 'obtain', 'a', 'similar', 'improvement', 'in', 'space', 'for', 'p', '2', 'whenever', 'f_2', 'gtrsim', 'log', 'ncdot', 'f_1']] | [-0.15705052384548834, 0.11171541478773543, -0.04526171044252699, 0.06682407861069639, -0.0347644691450077, -0.14361073544750055, 0.11311354567261346, 0.3357468566521624, -0.29330468584362623, -0.32044480890886584, 0.05301881417145168, -0.28382595400160493, -0.1287538355201906, 0.18189909857187211, -0.06709962076304225, 0.038232690206171024, -0.013759238163226752, 0.09624164074489157, -0.06052187498101048, -0.34440664039938923, 0.26659842368645525, -0.010790513384009376, 0.1983403056850515, -0.061950658128932495, 0.11525640466550677, 0.007318406190893372, 0.015819383926954367, -0.04531347353485895, -0.1266331274309039, 0.09981555591436661, 0.25200650575074374, 0.14206690499887017, 0.25837463659996585, -0.3517057633601829, -0.15221348029518794, 0.13822377475479683, 0.1871230228943514, 0.05673839839418811, 0.007783995090326682, -0.177557535975525, 0.13635103971765938, -0.11047368324397198, -0.07613946989043922, -0.040851350608376344, 0.06250838635886456, -0.008608145866221583, -0.3776549862054777, 0.03400005789595978, 0.09133821152869215, -0.032507658269502186, 0.002128494757482886, -0.14782424166155647, 0.07068202699189485, 0.08632696599836655, 0.006516570838163536, 0.15013451920999546, 0.0578004973435297, -0.0906309888386144, -0.1097979753864409, 0.3755633060437471, -0.14161457261602456, -0.18238487378587748, 0.07511431646538037, -0.15265863255933304, -0.1576391403601141, 0.115359780066623, 0.1918710289277174, 0.14233403746511428, -0.05995741786924545, 0.17278452753532575, -0.09626830690646743, 0.22272575351641263, 0.09940902170190956, 0.029290544921012244, 0.0310912134083281, 0.1407609624471421, 0.11526428999823665, 0.09203997679612586, -0.05574463687714208, -0.08408309247694569, -0.31470272275158273, -0.17392910846011467, -0.18329576186854676, 0.06139484481226539, -0.19635257153480187, -0.1339143503216204, 0.29830299145045697, 0.12500377488440745, 0.28084078003288376, 0.10528007979436214, 0.3255136596974988, 0.12354487502477061, 0.0009483724518154327, 0.2089156303767512, 0.11829760490306819, 0.06751182099076243, 0.011926621438576108, -0.1693172151143639, 0.07862846359497097, 0.08182595426282907] |
1,803.02271 | Gravitational Waves produced by Compressible MHD Turbulence from
Cosmological Phase Transitions | We calculate the gravitational wave spectrum produced by magneto-hydrodynamic
turbulence in a first order phase transitions. We focus in particular on the
role of decorrelation of incompressible (solenoidal) homogeneous isotropic
turbulence, which is dominated by the sweeping effect. The sweeping effect
describes that turbulent decorrelation is primarily due to the small scale
eddies being swept with by large scale eddies in a stochastic manner. This
effect reduces the gravitational wave signal produced by incompressible MHD
turbulence by around an order of magnitude compared to previous studies.
Additionally, we find a more complicated dependence for the spectral shape of
the gravitational wave spectrum on the energy density sourced by solenoidal
modes (magnetic and kinetic). The high frequency tail follows either a
$k^{-5/3}$ or a $k^{-8/3}$ power law for large and small solenoidal turbulence
density parameter, respectively. Further, magnetic helicity tends to increase
the gravitational wave energy at low frequencies. Moreover, we show how
solenoidal modes might impact the gravitational wave spectrum from dilatational
modes e.g. sound waves. We find that solenoidal modes greatly affect the shape
of the gravitational wave spectrum due to the sweeping effect on the
dilatational modes. For a high velocity flow, one expects a $k^{-2}$ high
frequency tail, due to sweeping. In contrast, for a low velocity flow and a
sound wave dominated flow, we expect a $k^{-3}$ high frequency tail. If neither
of these limiting cases is realized, the gravitational wave spectrum may be a
broken power law with index between -2 and -3, extending up to the frequency at
which the source is damped by viscous dissipation.
| astro-ph.CO gr-qc | we calculate the gravitational wave spectrum produced by magnetohydrodynamic turbulence in a first order phase transitions we focus in particular on the role of decorrelation of incompressible solenoidal homogeneous isotropic turbulence which is dominated by the sweeping effect the sweeping effect describes that turbulent decorrelation is primarily due to the small scale eddies being swept with by large scale eddies in a stochastic manner this effect reduces the gravitational wave signal produced by incompressible mhd turbulence by around an order of magnitude compared to previous studies additionally we find a more complicated dependence for the spectral shape of the gravitational wave spectrum on the energy density sourced by solenoidal modes magnetic and kinetic the high frequency tail follows either a k53 or a k83 power law for large and small solenoidal turbulence density parameter respectively further magnetic helicity tends to increase the gravitational wave energy at low frequencies moreover we show how solenoidal modes might impact the gravitational wave spectrum from dilatational modes eg sound waves we find that solenoidal modes greatly affect the shape of the gravitational wave spectrum due to the sweeping effect on the dilatational modes for a high velocity flow one expects a k2 high frequency tail due to sweeping in contrast for a low velocity flow and a sound wave dominated flow we expect a k3 high frequency tail if neither of these limiting cases is realized the gravitational wave spectrum may be a broken power law with index between 2 and 3 extending up to the frequency at which the source is damped by viscous dissipation | [['we', 'calculate', 'the', 'gravitational', 'wave', 'spectrum', 'produced', 'by', 'magnetohydrodynamic', 'turbulence', 'in', 'a', 'first', 'order', 'phase', 'transitions', 'we', 'focus', 'in', 'particular', 'on', 'the', 'role', 'of', 'decorrelation', 'of', 'incompressible', 'solenoidal', 'homogeneous', 'isotropic', 'turbulence', 'which', 'is', 'dominated', 'by', 'the', 'sweeping', 'effect', 'the', 'sweeping', 'effect', 'describes', 'that', 'turbulent', 'decorrelation', 'is', 'primarily', 'due', 'to', 'the', 'small', 'scale', 'eddies', 'being', 'swept', 'with', 'by', 'large', 'scale', 'eddies', 'in', 'a', 'stochastic', 'manner', 'this', 'effect', 'reduces', 'the', 'gravitational', 'wave', 'signal', 'produced', 'by', 'incompressible', 'mhd', 'turbulence', 'by', 'around', 'an', 'order', 'of', 'magnitude', 'compared', 'to', 'previous', 'studies', 'additionally', 'we', 'find', 'a', 'more', 'complicated', 'dependence', 'for', 'the', 'spectral', 'shape', 'of', 'the', 'gravitational', 'wave', 'spectrum', 'on', 'the', 'energy', 'density', 'sourced', 'by', 'solenoidal', 'modes', 'magnetic', 'and', 'kinetic', 'the', 'high', 'frequency', 'tail', 'follows', 'either', 'a', 'k53', 'or', 'a', 'k83', 'power', 'law', 'for', 'large', 'and', 'small', 'solenoidal', 'turbulence', 'density', 'parameter', 'respectively', 'further', 'magnetic', 'helicity', 'tends', 'to', 'increase', 'the', 'gravitational', 'wave', 'energy', 'at', 'low', 'frequencies', 'moreover', 'we', 'show', 'how', 'solenoidal', 'modes', 'might', 'impact', 'the', 'gravitational', 'wave', 'spectrum', 'from', 'dilatational', 'modes', 'eg', 'sound', 'waves', 'we', 'find', 'that', 'solenoidal', 'modes', 'greatly', 'affect', 'the', 'shape', 'of', 'the', 'gravitational', 'wave', 'spectrum', 'due', 'to', 'the', 'sweeping', 'effect', 'on', 'the', 'dilatational', 'modes', 'for', 'a', 'high', 'velocity', 'flow', 'one', 'expects', 'a', 'k2', 'high', 'frequency', 'tail', 'due', 'to', 'sweeping', 'in', 'contrast', 'for', 'a', 'low', 'velocity', 'flow', 'and', 'a', 'sound', 'wave', 'dominated', 'flow', 'we', 'expect', 'a', 'k3', 'high', 'frequency', 'tail', 'if', 'neither', 'of', 'these', 'limiting', 'cases', 'is', 'realized', 'the', 'gravitational', 'wave', 'spectrum', 'may', 'be', 'a', 'broken', 'power', 'law', 'with', 'index', 'between', '2', 'and', '3', 'extending', 'up', 'to', 'the', 'frequency', 'at', 'which', 'the', 'source', 'is', 'damped', 'by', 'viscous', 'dissipation']] | [-0.19506109478298703, 0.24447457366388597, -0.07834178088979354, 0.06452890913462522, -0.09413874706871922, -0.03661077391384667, -0.045567404701177185, 0.29869007252162066, -0.2740513190275186, -0.27480519194918407, 0.07345248592167894, -0.24874333183473077, -0.07625913512733061, 0.2094332378043061, 0.035988647282791844, 0.04319225434206767, 0.010617443267522621, -0.022049187902958338, -0.019237691195964288, -0.10517744649955221, 0.3306443165971734, 0.12457143173034069, 0.28714558977335125, 0.014400164191504472, 0.06669660958680075, -0.057635469562978346, -0.03636903668483204, 0.049374318038755645, -0.12647986029594016, 0.016356127777399906, 0.18325320734528697, 0.00981024679379495, 0.2648458432918059, -0.4382675513340772, -0.26218543481081724, 0.07490998055103398, 0.16921525536988594, 0.10749316402401718, -0.025152862131809336, -0.25178531406959165, 0.0728610239510659, -0.19096727777478634, -0.15573315137600924, -0.03076413102476424, 0.04727841217118806, 0.044731773405854824, -0.27830394844432144, 0.16468827786521262, 0.07642262556122702, 0.04032359116547208, -0.06748636119789266, -0.04296187948229374, -0.04950068974671956, 0.03721715491318379, 0.11455860050779035, 0.057818461689415554, 0.15489766699682303, -0.17209532073048434, -0.022953873547327256, 0.3997287109799911, -0.13073991471990404, -0.18926428645166732, 0.18775316138524306, -0.21783972560527615, -0.06516286023565433, 0.23086490561360962, 0.19986855903576406, 0.05069888235481486, -0.05013879638108361, 0.03259198315808628, 0.03525694356991319, 0.18979220297800747, 0.1200796828271096, 0.014687935585326706, 0.24824048629215428, 0.11839256824068867, 0.0813010577267953, 0.13848880527653012, -0.15091363227050192, -0.011256426741646333, -0.2865386528090951, -0.07417770293861173, -0.20805318309847293, 0.056280711785886166, -0.08629798603342768, -0.13864459839599733, 0.4072331227575436, 0.11546612739116878, 0.156843813072236, 0.039724397010041955, 0.32900580967143744, 0.19351663013061737, 0.05208284394968415, 0.145481615195776, 0.3217768981103707, 0.15191861929217326, 0.1639337139026411, -0.25112822826308345, -0.006067538008321332, 0.030547860131833617] |
1,803.02272 | A geometric view of Biodiversity: scaling to metagenomics | We have designed a new efficient dimensionality reduction algorithm in order
to investigate new ways of accurately characterizing the biodiversity, namely
from a geometric point of view, scaling with large environmental sets produced
by NGS ($\sim 10^5$ sequences). The approach is based on Multidimensional
Scaling (MDS) that allows for mapping items on a set of $n$ points into a low
dimensional euclidean space given the set of pairwise distances. We compute all
pairwise distances between reads in a given sample, run MDS on the distance
matrix, and analyze the projection on first axis, by visualization tools. We
have circumvented the quadratic complexity of computing pairwise distances by
implementing it on a hyperparallel computer (Turing, a Blue Gene Q), and the
cubic complexity of the spectral decomposition by implementing a dense random
projection based algorithm. We have applied this data analysis scheme on a set
of $10^5$ reads, which are amplicons of a diatom environmental sample from Lake
Geneva. Analyzing the shape of the point cloud paves the way for a geometric
analysis of biodiversity, and for accurately building OTUs (Operational
Taxonomic Units), when the data set is too large for implementing unsupervised,
hierarchical, high-dimensional clustering.
| stat.CO q-bio.QM | we have designed a new efficient dimensionality reduction algorithm in order to investigate new ways of accurately characterizing the biodiversity namely from a geometric point of view scaling with large environmental sets produced by ngs sim 105 sequences the approach is based on multidimensional scaling mds that allows for mapping items on a set of n points into a low dimensional euclidean space given the set of pairwise distances we compute all pairwise distances between reads in a given sample run mds on the distance matrix and analyze the projection on first axis by visualization tools we have circumvented the quadratic complexity of computing pairwise distances by implementing it on a hyperparallel computer turing a blue gene q and the cubic complexity of the spectral decomposition by implementing a dense random projection based algorithm we have applied this data analysis scheme on a set of 105 reads which are amplicons of a diatom environmental sample from lake geneva analyzing the shape of the point cloud paves the way for a geometric analysis of biodiversity and for accurately building otus operational taxonomic units when the data set is too large for implementing unsupervised hierarchical highdimensional clustering | [['we', 'have', 'designed', 'a', 'new', 'efficient', 'dimensionality', 'reduction', 'algorithm', 'in', 'order', 'to', 'investigate', 'new', 'ways', 'of', 'accurately', 'characterizing', 'the', 'biodiversity', 'namely', 'from', 'a', 'geometric', 'point', 'of', 'view', 'scaling', 'with', 'large', 'environmental', 'sets', 'produced', 'by', 'ngs', 'sim', '105', 'sequences', 'the', 'approach', 'is', 'based', 'on', 'multidimensional', 'scaling', 'mds', 'that', 'allows', 'for', 'mapping', 'items', 'on', 'a', 'set', 'of', 'n', 'points', 'into', 'a', 'low', 'dimensional', 'euclidean', 'space', 'given', 'the', 'set', 'of', 'pairwise', 'distances', 'we', 'compute', 'all', 'pairwise', 'distances', 'between', 'reads', 'in', 'a', 'given', 'sample', 'run', 'mds', 'on', 'the', 'distance', 'matrix', 'and', 'analyze', 'the', 'projection', 'on', 'first', 'axis', 'by', 'visualization', 'tools', 'we', 'have', 'circumvented', 'the', 'quadratic', 'complexity', 'of', 'computing', 'pairwise', 'distances', 'by', 'implementing', 'it', 'on', 'a', 'hyperparallel', 'computer', 'turing', 'a', 'blue', 'gene', 'q', 'and', 'the', 'cubic', 'complexity', 'of', 'the', 'spectral', 'decomposition', 'by', 'implementing', 'a', 'dense', 'random', 'projection', 'based', 'algorithm', 'we', 'have', 'applied', 'this', 'data', 'analysis', 'scheme', 'on', 'a', 'set', 'of', '105', 'reads', 'which', 'are', 'amplicons', 'of', 'a', 'diatom', 'environmental', 'sample', 'from', 'lake', 'geneva', 'analyzing', 'the', 'shape', 'of', 'the', 'point', 'cloud', 'paves', 'the', 'way', 'for', 'a', 'geometric', 'analysis', 'of', 'biodiversity', 'and', 'for', 'accurately', 'building', 'otus', 'operational', 'taxonomic', 'units', 'when', 'the', 'data', 'set', 'is', 'too', 'large', 'for', 'implementing', 'unsupervised', 'hierarchical', 'highdimensional', 'clustering']] | [-0.10929629374414873, 0.07498655848873731, -0.09938768758319128, 0.07324591923851329, -0.03579048160344171, -0.11690514664977598, 0.09947248204396321, 0.34290533396296013, -0.26733824696558983, -0.3199022938473484, 0.09531517663898949, -0.2579616625232843, -0.12519709753135266, 0.20809104380985866, -0.05994403842741098, 0.08256515513818997, 0.09200886216086264, -0.022464107488019344, -0.0518920442286449, -0.24718318985870633, 0.31799633668687866, 0.02751736142433798, 0.28414546182522404, -0.04205561909609689, 0.13431284739755286, 0.01905095224531415, -0.07658459153742744, 0.05726216165095162, -0.1137522749906146, 0.1761674723134209, 0.2593963439062906, 0.20250567899873623, 0.28644355891797785, -0.37801643203046975, -0.17316045203270056, 0.13539425548261558, 0.12473347433603918, 0.1249613995419051, -0.0466792169934473, -0.2684360474634629, 0.09228464477779105, -0.12958926007402344, -0.08161577438123715, -0.09545036446995651, 0.04688462430659013, 0.015716985176102472, -0.2624090022240312, 0.0318728892526661, 0.011132230981288908, 0.11563698392218122, -0.002137565988008506, -0.12164885626078989, 0.02596326797054364, 0.11995303089184185, -0.03526144194154021, 0.05238158377603842, 0.11680868994683409, -0.05345056975332763, -0.09189936151393713, 0.3915969572388209, -0.025938578201338457, -0.183246757188, 0.1944297390178037, -0.08409412665626942, -0.1578240148197764, 0.11448709842963861, 0.23135873162521955, 0.07374058494057793, -0.17728360243871485, 0.11785345136304386, -0.0301938014343763, 0.16465862232576817, 0.07302544307298003, 0.01488262514034525, 0.1947816204246826, 0.20821056736943622, 0.0819636419072198, 0.13206057191336862, -0.12598434623856192, -0.0740002864649376, -0.23911229589571936, -0.12753333912636988, -0.23124402067206132, 0.04109816728398586, -0.17758940110223378, -0.16577288617308322, 0.3730604130458885, 0.1380995205588615, 0.2431237068075018, 0.10011056756678348, 0.29628367963700725, 0.041641565116468625, 0.10216759537549641, 0.09455909482800426, 0.12516045407033882, 0.08790758294172776, 0.03698636859130019, -0.19865282678212492, 0.05476757138967514, 0.10291676389483305] |
1,803.02273 | Dissonant points and the region of influence of non-saddle sets | The aim of this paper is to study dynamical and topological properties of a
flow in the region of influence of an isolated non-saddle set. We see, in
particular, that some topological conditions are sufficient to guarantee that
these sets are attractors or repellers. We study in detail the existence of
dissonant points of the flow, which play a key role in the description of the
region of influence of a non-saddle set. These points are responsible for much
of the dynamical and topological complexity of the system. We also study
non-saddle sets from the point of view of the Conley index theory and consider,
among other things, the case of flows on manifolds with trivial first
cohomology group. For flows on these manifolds, dynamical robustness is
equivalent to topological robustness. We carry out a particular study of
2-dimensional flows and give a topological condition which detects the
existence of dissonant points for flows on surfaces. We also prove that
isolated invariant continua of planar flows with global region of influence are
necessarily attractors or repellers.
| math.DS | the aim of this paper is to study dynamical and topological properties of a flow in the region of influence of an isolated nonsaddle set we see in particular that some topological conditions are sufficient to guarantee that these sets are attractors or repellers we study in detail the existence of dissonant points of the flow which play a key role in the description of the region of influence of a nonsaddle set these points are responsible for much of the dynamical and topological complexity of the system we also study nonsaddle sets from the point of view of the conley index theory and consider among other things the case of flows on manifolds with trivial first cohomology group for flows on these manifolds dynamical robustness is equivalent to topological robustness we carry out a particular study of 2dimensional flows and give a topological condition which detects the existence of dissonant points for flows on surfaces we also prove that isolated invariant continua of planar flows with global region of influence are necessarily attractors or repellers | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'study', 'dynamical', 'and', 'topological', 'properties', 'of', 'a', 'flow', 'in', 'the', 'region', 'of', 'influence', 'of', 'an', 'isolated', 'nonsaddle', 'set', 'we', 'see', 'in', 'particular', 'that', 'some', 'topological', 'conditions', 'are', 'sufficient', 'to', 'guarantee', 'that', 'these', 'sets', 'are', 'attractors', 'or', 'repellers', 'we', 'study', 'in', 'detail', 'the', 'existence', 'of', 'dissonant', 'points', 'of', 'the', 'flow', 'which', 'play', 'a', 'key', 'role', 'in', 'the', 'description', 'of', 'the', 'region', 'of', 'influence', 'of', 'a', 'nonsaddle', 'set', 'these', 'points', 'are', 'responsible', 'for', 'much', 'of', 'the', 'dynamical', 'and', 'topological', 'complexity', 'of', 'the', 'system', 'we', 'also', 'study', 'nonsaddle', 'sets', 'from', 'the', 'point', 'of', 'view', 'of', 'the', 'conley', 'index', 'theory', 'and', 'consider', 'among', 'other', 'things', 'the', 'case', 'of', 'flows', 'on', 'manifolds', 'with', 'trivial', 'first', 'cohomology', 'group', 'for', 'flows', 'on', 'these', 'manifolds', 'dynamical', 'robustness', 'is', 'equivalent', 'to', 'topological', 'robustness', 'we', 'carry', 'out', 'a', 'particular', 'study', 'of', '2dimensional', 'flows', 'and', 'give', 'a', 'topological', 'condition', 'which', 'detects', 'the', 'existence', 'of', 'dissonant', 'points', 'for', 'flows', 'on', 'surfaces', 'we', 'also', 'prove', 'that', 'isolated', 'invariant', 'continua', 'of', 'planar', 'flows', 'with', 'global', 'region', 'of', 'influence', 'are', 'necessarily', 'attractors', 'or', 'repellers']] | [-0.2075330097815657, 0.09187948134198946, -0.10934152979065072, 0.06725789215852274, -0.012638277187678877, -0.07803242936907653, 0.037024555801921946, 0.3226384407290342, -0.24752960400920446, -0.24845881964640945, 0.13044813223479484, -0.2874397751981054, -0.1991066988359142, 0.1878768342192581, -0.08099101437702219, 0.03923452903770588, 0.029366733122680507, 0.040122357047618025, -0.04760717061022164, -0.23201035194506403, 0.4368620792917103, -0.027521133872638034, 0.25200358377663756, 0.058062616185369814, 0.05199406651610678, -0.047154093302775764, -0.019306158627097666, 0.07755894103551823, -0.17905940096331754, 0.11638593055381947, 0.21166707009383987, 0.0665066993652462, 0.2157929111589593, -0.4029955800135874, -0.22736471629733304, 0.15350928558142518, 0.11115348397023891, 0.06649846351171039, -0.05130194803826849, -0.26234501087641215, 0.15854696456517559, -0.10297691187588498, -0.16282978959233416, -0.10611272913361476, 0.02085726558156735, 0.04489818344749934, -0.20278439853890715, 0.03615627097282082, 0.11161653183692331, 0.11552118222673678, -0.07299905966713348, -0.011097838469140697, -0.08547344127410642, 0.16534353928926232, 0.04782559921824776, -0.021521093884736976, 0.10395703706175978, -0.13176581596251874, -0.11358437422578307, 0.3897162653844465, -0.016333896771935873, -0.20701615065759557, 0.2332184019072553, -0.1411189856907268, -0.17610428019014018, 0.12029557310465448, 0.19788332946584639, 0.1374631743158468, -0.09349769281900742, 0.08273752174334897, -0.09230361886280165, 0.10929149263144856, 0.050442811339797285, 0.07384090270815333, 0.20757391945649448, 0.134706701107048, 0.14642156940482726, 0.17206017406880908, -0.05362696631511261, -0.1125658568396995, -0.3424891595178368, -0.17865746999053622, -0.10056571654753167, 0.07454596519677249, -0.06858667717229268, -0.2081024597996888, 0.4239781550925479, 0.12813524917741728, 0.2179875879400325, 0.0227322897818257, 0.21943434562788092, 0.06701434479046756, -0.013101189968768846, 0.0927499694172928, 0.21386848923843485, 0.13306900834802285, 0.04389028740115464, -0.1867946626748149, 0.006323099460463378, 0.14075200116547587] |
1,803.02274 | Regularity of many-body Schr\"odinger evolution equation and its application to numerical analysis | A decade ago, the mixed regularity of stationary many-body Schr\"o\-dinger equation has been studied by Harry Yserentant through the Pauli Principle and the Hardy inequality (Uncertainty Principle). In this article, we prove that the many-body evolution Schr\"odinger equation has a similar mixed regularity if the initial data $u_0$ satisfies the Pauli Principle. By generalization of the Strichartz estimates, our method also applies to the numerical approximation of this problem: based on these mixed derivatives, we design a new approximation which can hugely improve the computing capability especially in quantum chemistry. | math.AP | a decade ago the mixed regularity of stationary manybody schrodinger equation has been studied by harry yserentant through the pauli principle and the hardy inequality uncertainty principle in this article we prove that the manybody evolution schrodinger equation has a similar mixed regularity if the initial data u_0 satisfies the pauli principle by generalization of the strichartz estimates our method also applies to the numerical approximation of this problem based on these mixed derivatives we design a new approximation which can hugely improve the computing capability especially in quantum chemistry | [['a', 'decade', 'ago', 'the', 'mixed', 'regularity', 'of', 'stationary', 'manybody', 'schrodinger', 'equation', 'has', 'been', 'studied', 'by', 'harry', 'yserentant', 'through', 'the', 'pauli', 'principle', 'and', 'the', 'hardy', 'inequality', 'uncertainty', 'principle', 'in', 'this', 'article', 'we', 'prove', 'that', 'the', 'manybody', 'evolution', 'schrodinger', 'equation', 'has', 'a', 'similar', 'mixed', 'regularity', 'if', 'the', 'initial', 'data', 'u_0', 'satisfies', 'the', 'pauli', 'principle', 'by', 'generalization', 'of', 'the', 'strichartz', 'estimates', 'our', 'method', 'also', 'applies', 'to', 'the', 'numerical', 'approximation', 'of', 'this', 'problem', 'based', 'on', 'these', 'mixed', 'derivatives', 'we', 'design', 'a', 'new', 'approximation', 'which', 'can', 'hugely', 'improve', 'the', 'computing', 'capability', 'especially', 'in', 'quantum', 'chemistry']] | [-0.0854370201822747, 0.08156409885818033, -0.14793803227092192, 0.09877096502413826, -0.0830077833490802, -0.11839717883470185, 0.011688820685500676, 0.2688098747277988, -0.30200127539423743, -0.23988626932913668, 0.12110868878688746, -0.25253668431653065, -0.13993175737978367, 0.19431827190133294, -0.06401518112038042, 0.13656950793281364, 0.1159187639236785, 0.0018488847954052218, -0.12217243623741891, -0.28897816191291376, 0.34594886602436226, -0.011404520576934885, 0.27306059830602303, 0.08357771546736861, 0.10463612640846856, 0.022383234202024642, 0.05248499096481109, -0.021868272705443118, -0.17533822144746972, 0.15361520857157793, 0.21849198463592637, 0.10272934489747447, 0.37131428572066716, -0.4237931269440758, -0.27039788113750013, 0.1151399359086089, 0.12262873108802216, 0.13232765155661266, -0.07355179676257619, -0.35040752131366326, 0.025223880095846866, -0.1565202825435887, -0.1999693756842635, -0.08594295042409991, -0.0033274149009434695, 0.019679985689313225, -0.2747864050665096, 0.15283422247641407, 0.07502096223780948, -0.009906413252537369, -0.102834158509007, -0.10184429726155286, 0.02875839909172376, 0.01935923570411259, -0.019751039281320035, -0.0010693014777275953, 0.02010693514635891, -0.07399361140586519, -0.12435231367230751, 0.36902628800298054, -0.06723455732788536, -0.23988183449660794, 0.10658121943798209, -0.1311940679515011, -0.15920949775432602, 0.06129823352754367, 0.14867244529004178, 0.12645754135433543, -0.18023566601358437, 0.17814095847222305, -0.08540844919390223, 0.11589247673969674, 0.08994630309543834, 0.041463804677170646, 0.053589681665716545, 0.13878160306995505, 0.13211148303378834, 0.11901463768601919, -0.04099867178184069, -0.14714282201707699, -0.31257818905071594, -0.16032883317701602, -0.23556992311156197, 0.129482815073531, -0.0900873405637489, -0.13759028431279272, 0.3497112765908241, 0.16797170534290456, 0.05473625072503065, 0.03279033795213641, 0.24619466587482544, 0.19859743153472337, 0.03233994766965174, 0.06679942046574662, 0.24810160422341876, 0.21334866231851532, 0.14530925869188283, -0.24800998598907478, 0.0799974096949432, 0.16167969710266825] |
1,803.02275 | Toposes of connectivity spaces. Morita equivalences with topological
spaces and partially ordered sets in the finite case | This paper has two parts. First, we recall and detail the definition of the
Grothendieck topos of a connectivity space, that is the topos of sheaves on
such a space. In the second part, we prove that every finite connectivity space
is Morita-equivalent to a finite topological space, and vice versa (we have
given this proof in several, but we haven't yet shared this in writing).
| math.GN math.CT | this paper has two parts first we recall and detail the definition of the grothendieck topos of a connectivity space that is the topos of sheaves on such a space in the second part we prove that every finite connectivity space is moritaequivalent to a finite topological space and vice versa we have given this proof in several but we havent yet shared this in writing | [['this', 'paper', 'has', 'two', 'parts', 'first', 'we', 'recall', 'and', 'detail', 'the', 'definition', 'of', 'the', 'grothendieck', 'topos', 'of', 'a', 'connectivity', 'space', 'that', 'is', 'the', 'topos', 'of', 'sheaves', 'on', 'such', 'a', 'space', 'in', 'the', 'second', 'part', 'we', 'prove', 'that', 'every', 'finite', 'connectivity', 'space', 'is', 'moritaequivalent', 'to', 'a', 'finite', 'topological', 'space', 'and', 'vice', 'versa', 'we', 'have', 'given', 'this', 'proof', 'in', 'several', 'but', 'we', 'havent', 'yet', 'shared', 'this', 'in', 'writing']] | [-0.16962003334298392, 0.12190599650652571, -0.12561693086966194, 0.07073329072128134, -0.113833896223117, -0.058094594747561845, 0.04106288781622425, 0.40103925176134164, -0.31863828601710725, -0.1980624202017983, 0.10551254526239284, -0.22343786470027585, -0.1892156900668686, 0.12350104800002142, -0.18336496068249372, -0.07310181720690294, 0.011927188007217464, 0.10293565600207358, -0.06461132352353272, -0.31198041609516647, 0.4171535014315988, -0.051500642093632254, 0.2213945741497093, 0.07290611097899576, 0.11127034350383011, 0.0052145900007224445, -0.007299559353145234, 0.0520326157901295, -0.13478169109514443, 0.1625176045592084, 0.2996251167814163, 0.15393471128349615, 0.30690390620888636, -0.3855061586430317, -0.1648784037114996, 0.1689781607834227, 0.12936629692205426, 0.10048090260137212, -0.02458433493456775, -0.2716742509580923, 0.09984442189505155, -0.19578492982933918, -0.02875409321859479, -0.10316101735401334, 0.0818437955652674, -0.03616038594169147, -0.1611953491034607, -0.07026679174635898, 0.0986383089682821, 0.10912452838524725, -0.09521762591038803, -0.03363233358796799, -0.01870792635688276, 0.11727537718516859, -0.042591866832508735, 0.05618441790680994, 0.046977198872341294, -0.09045694850625075, -0.11021601960458087, 0.3734020872789463, -0.0376392399462709, -0.22980934087977264, 0.16879781815364506, -0.19156425240252054, -0.20905524140901185, 0.04500686638339451, 0.0710547859357162, 0.13458453530488027, -0.05269970025189898, 0.15246268018028897, -0.11707992565281915, 0.13052345182972425, 0.09863715267486194, 0.07757459170269695, 0.11777563459437454, 0.20679167277094992, 0.0871709050631828, 0.14859766788272696, -0.021846841941375962, -0.039186761509909324, -0.3700909715597377, -0.2440623908275456, -0.20478577176673393, 0.04214731440173857, -0.044099982277133895, -0.17617905805959846, 0.434838522592503, 0.14588154863679048, 0.19130778570913456, 0.10409236027661598, 0.30957588092177035, 0.07721617376206047, 0.02029384217563678, 0.06849911269929373, 0.18622282345666352, 0.11310675757175143, 0.08596957135578674, -0.10408598393824474, 0.04419568069561413, 0.15510006143118849] |
1,803.02276 | GeoNet: Unsupervised Learning of Dense Depth, Optical Flow and Camera
Pose | We propose GeoNet, a jointly unsupervised learning framework for monocular
depth, optical flow and ego-motion estimation from videos. The three components
are coupled by the nature of 3D scene geometry, jointly learned by our
framework in an end-to-end manner. Specifically, geometric relationships are
extracted over the predictions of individual modules and then combined as an
image reconstruction loss, reasoning about static and dynamic scene parts
separately. Furthermore, we propose an adaptive geometric consistency loss to
increase robustness towards outliers and non-Lambertian regions, which resolves
occlusions and texture ambiguities effectively. Experimentation on the KITTI
driving dataset reveals that our scheme achieves state-of-the-art results in
all of the three tasks, performing better than previously unsupervised methods
and comparably with supervised ones.
| cs.CV | we propose geonet a jointly unsupervised learning framework for monocular depth optical flow and egomotion estimation from videos the three components are coupled by the nature of 3d scene geometry jointly learned by our framework in an endtoend manner specifically geometric relationships are extracted over the predictions of individual modules and then combined as an image reconstruction loss reasoning about static and dynamic scene parts separately furthermore we propose an adaptive geometric consistency loss to increase robustness towards outliers and nonlambertian regions which resolves occlusions and texture ambiguities effectively experimentation on the kitti driving dataset reveals that our scheme achieves stateoftheart results in all of the three tasks performing better than previously unsupervised methods and comparably with supervised ones | [['we', 'propose', 'geonet', 'a', 'jointly', 'unsupervised', 'learning', 'framework', 'for', 'monocular', 'depth', 'optical', 'flow', 'and', 'egomotion', 'estimation', 'from', 'videos', 'the', 'three', 'components', 'are', 'coupled', 'by', 'the', 'nature', 'of', '3d', 'scene', 'geometry', 'jointly', 'learned', 'by', 'our', 'framework', 'in', 'an', 'endtoend', 'manner', 'specifically', 'geometric', 'relationships', 'are', 'extracted', 'over', 'the', 'predictions', 'of', 'individual', 'modules', 'and', 'then', 'combined', 'as', 'an', 'image', 'reconstruction', 'loss', 'reasoning', 'about', 'static', 'and', 'dynamic', 'scene', 'parts', 'separately', 'furthermore', 'we', 'propose', 'an', 'adaptive', 'geometric', 'consistency', 'loss', 'to', 'increase', 'robustness', 'towards', 'outliers', 'and', 'nonlambertian', 'regions', 'which', 'resolves', 'occlusions', 'and', 'texture', 'ambiguities', 'effectively', 'experimentation', 'on', 'the', 'kitti', 'driving', 'dataset', 'reveals', 'that', 'our', 'scheme', 'achieves', 'stateoftheart', 'results', 'in', 'all', 'of', 'the', 'three', 'tasks', 'performing', 'better', 'than', 'previously', 'unsupervised', 'methods', 'and', 'comparably', 'with', 'supervised', 'ones']] | [-0.035038295640226674, -0.013476457024808042, -0.0875499008629156, 0.037294984289382375, -0.09415524861454463, -0.1706786950416237, -0.006645620971753755, 0.5069861367986608, -0.2609094271999823, -0.3772346759997621, 0.061573730494060064, -0.28931221218795333, -0.18774502873107665, 0.16690037117785766, -0.18422765859951837, 0.08728847058368612, 0.14776066052844794, 0.003474884995204561, -0.09458565753649827, -0.2595619549622618, 0.3178823779849727, 0.020319180617875913, 0.3434994650707275, -0.018552947589861497, 0.17326214528219977, 0.02261831409673543, -0.07496185082391475, 0.02129868193365195, -0.029867659325179735, 0.1952219474591127, 0.3107822504591103, 0.1688301880930026, 0.2502489135847153, -0.3891531886736385, -0.25579825492121844, 0.025224688329866955, 0.18072571665803833, 0.0908590420530796, -0.015190461002869391, -0.3976253001880245, 0.06241799042043628, -0.13368202819481118, 0.04828656349378098, -0.1829822908249535, -0.044100809184943926, -0.07252293862030693, -0.304130052834624, 0.08785675557236336, 0.08736215388997137, 0.10137458101791494, -0.11170128846498002, -0.09640239430356677, 0.036044373501780906, 0.20765171721655906, 0.012485969110251162, 0.05074972140078409, 0.1636561059418424, -0.21312472282932335, -0.14244328697208128, 0.34397707697974533, -0.05277997925116958, -0.23366921858376816, 0.20310349354301305, -0.0012027106263494793, -0.11249786350453476, 0.12659574426248857, 0.2045197613388613, 0.1358074200879626, -0.16947111111729085, -0.03200681762625033, -0.061067252517716976, 0.1786504377133581, 0.04079404036600549, -0.0006434395087554175, 0.1734247705840482, 0.23432521208212906, 0.05941586967056545, 0.13320181892862926, -0.19066339027441787, -0.054262239165103233, -0.2190426750022511, -0.04861364265543824, -0.13481576644968116, -0.09399431259880046, -0.1667644324501636, -0.1006619615114427, 0.4055295309293445, 0.2628298206607021, 0.24353124294038705, 0.13028602736137276, 0.4230464617682605, -0.024364875409431254, 0.0581630183483607, 0.10709936952046237, 0.19316947320476174, 0.0024222086825478476, 0.11372155514927268, -0.2005160852176912, 0.06329588735663966, 0.06782167507609461] |
1,803.02277 | The interstellar medium: from molecules to star formation | The interstellar medium (ISM) is a very complex medium which contains the
matter needed to form stars and planets. The ISM is in permanent interaction
with radiation, turbulence, magnetic and gravitational fields, and accelerated
particles. Everything that happens in this medium has consequences on the
dynamics and evolution of the Galaxy, resulting the link that relates the
stellar scale with the galactic one. Thus, the study of the ISM is crucial to
advance in the knowledge of stellar and galactic astrophysics. In this article
I present a summary of what we know about the physics and chemistry of this
medium, giving an special emphasis on star formation, and how the processes
related to the stars birth and evolution interrelate with the environment that
surrounds them.
| astro-ph.GA | the interstellar medium ism is a very complex medium which contains the matter needed to form stars and planets the ism is in permanent interaction with radiation turbulence magnetic and gravitational fields and accelerated particles everything that happens in this medium has consequences on the dynamics and evolution of the galaxy resulting the link that relates the stellar scale with the galactic one thus the study of the ism is crucial to advance in the knowledge of stellar and galactic astrophysics in this article i present a summary of what we know about the physics and chemistry of this medium giving an special emphasis on star formation and how the processes related to the stars birth and evolution interrelate with the environment that surrounds them | [['the', 'interstellar', 'medium', 'ism', 'is', 'a', 'very', 'complex', 'medium', 'which', 'contains', 'the', 'matter', 'needed', 'to', 'form', 'stars', 'and', 'planets', 'the', 'ism', 'is', 'in', 'permanent', 'interaction', 'with', 'radiation', 'turbulence', 'magnetic', 'and', 'gravitational', 'fields', 'and', 'accelerated', 'particles', 'everything', 'that', 'happens', 'in', 'this', 'medium', 'has', 'consequences', 'on', 'the', 'dynamics', 'and', 'evolution', 'of', 'the', 'galaxy', 'resulting', 'the', 'link', 'that', 'relates', 'the', 'stellar', 'scale', 'with', 'the', 'galactic', 'one', 'thus', 'the', 'study', 'of', 'the', 'ism', 'is', 'crucial', 'to', 'advance', 'in', 'the', 'knowledge', 'of', 'stellar', 'and', 'galactic', 'astrophysics', 'in', 'this', 'article', 'i', 'present', 'a', 'summary', 'of', 'what', 'we', 'know', 'about', 'the', 'physics', 'and', 'chemistry', 'of', 'this', 'medium', 'giving', 'an', 'special', 'emphasis', 'on', 'star', 'formation', 'and', 'how', 'the', 'processes', 'related', 'to', 'the', 'stars', 'birth', 'and', 'evolution', 'interrelate', 'with', 'the', 'environment', 'that', 'surrounds', 'them']] | [-0.07967687100917101, 0.15294723800441715, -0.08404120444692671, 0.09975970241706818, -0.12189155997335911, -0.004780670145526528, -0.007702638061717153, 0.3546316348230466, -0.22471833597868682, -0.32524037803709505, 0.046064714528620244, -0.25188996697403493, -0.09765235812962056, 0.1452190700508654, -0.007412997230887413, -0.05946595001220703, 0.03590033554844558, 0.002071802705526352, 0.013815019814297556, -0.2603813010826707, 0.3825990733169019, 0.12084062945842743, 0.14225366797298192, 0.04681248459964991, 0.08238158616563306, -0.0695298957042396, -0.06253676407039166, -0.041567225832492116, -0.15363197974947979, 0.07658904949575662, 0.20957024755002931, 0.1540820480212569, 0.23202671819925308, -0.4645360488146543, -0.23587126265466213, 0.07074377140961588, 0.16924756316840647, 0.08488390638213604, -0.10857344798184931, -0.23345214933902025, -0.0003476921422407031, -0.15919704187614844, -0.1740509802401066, 0.04220278621464968, 0.039556777764111754, 0.03799991860799491, -0.20604712551133708, 0.0557564644087106, 0.06782870627660305, 0.048270274970680475, -0.08044454139471054, -0.04408221342973411, 0.0014413045160472393, 0.13170217683538796, 0.054707307958509775, 0.0870521518131718, 0.19398398993909358, -0.20964190495735965, 0.001939391255378723, 0.49903981685638427, -0.051693637795746324, -0.09281397114694119, 0.2502356529608369, -0.2319485600888729, -0.15771202360838651, 0.09831236251164227, 0.18314976799674332, 0.08546326352655888, -0.16733499191747978, 0.05312161003053188, -0.027973683778196572, 0.1486539365053177, 0.013009675708482974, 0.05288686023384798, 0.2863632871247828, 0.16444189602229745, 0.0333867885991931, 0.0939986796285957, -0.09048695492767729, -0.09402105008251965, -0.2621758517101407, -0.15809193428233265, -0.13864603967033326, 0.08863991229608655, -0.103407681950368, -0.1339352290406823, 0.37861646099202334, 0.16661666966043412, 0.1671364812105894, -0.03895894485060126, 0.30432656430453064, 0.045903058336116374, 0.032882071025669576, 0.1395440490357578, 0.2925760080739856, 0.22178208830114454, 0.1517983284369111, -0.24486404978856444, 0.11063809084519743, -0.0005529757682234048] |
1,803.02278 | Trapping and sorting active particles: motility-induced condensation &
smectic defects | We present an experimental realization of the collective trapping phase
transition [Kaiser et al., PRL 108, 268307 (2012)], using motile polar granular
rods in the presence of a V-shaped obstacle. We offer a theory of this
transition based on the interplay of motility-induced condensation and
liquid-crystalline ordering and show that trapping occurs when persistent
influx overcomes the collective expulsion of smectic defect structures. In
agreement with the theory, our experiments find that a trap fills to the brim
when the trap angle $\theta$ is below a threshold $\theta_c$, while all
particles escape for $\theta > \theta_c$. Our simulations support a further
prediction, that $\theta_c$ goes down with increasing rotational noise. We
exploit the sensitivity of trapping to the persistence of directed motion to
sort particles based on the statistical properties of their activity
| cond-mat.soft | we present an experimental realization of the collective trapping phase transition kaiser et al prl 108 268307 2012 using motile polar granular rods in the presence of a vshaped obstacle we offer a theory of this transition based on the interplay of motilityinduced condensation and liquidcrystalline ordering and show that trapping occurs when persistent influx overcomes the collective expulsion of smectic defect structures in agreement with the theory our experiments find that a trap fills to the brim when the trap angle theta is below a threshold theta_c while all particles escape for theta theta_c our simulations support a further prediction that theta_c goes down with increasing rotational noise we exploit the sensitivity of trapping to the persistence of directed motion to sort particles based on the statistical properties of their activity | [['we', 'present', 'an', 'experimental', 'realization', 'of', 'the', 'collective', 'trapping', 'phase', 'transition', 'kaiser', 'et', 'al', 'prl', '108', '268307', '2012', 'using', 'motile', 'polar', 'granular', 'rods', 'in', 'the', 'presence', 'of', 'a', 'vshaped', 'obstacle', 'we', 'offer', 'a', 'theory', 'of', 'this', 'transition', 'based', 'on', 'the', 'interplay', 'of', 'motilityinduced', 'condensation', 'and', 'liquidcrystalline', 'ordering', 'and', 'show', 'that', 'trapping', 'occurs', 'when', 'persistent', 'influx', 'overcomes', 'the', 'collective', 'expulsion', 'of', 'smectic', 'defect', 'structures', 'in', 'agreement', 'with', 'the', 'theory', 'our', 'experiments', 'find', 'that', 'a', 'trap', 'fills', 'to', 'the', 'brim', 'when', 'the', 'trap', 'angle', 'theta', 'is', 'below', 'a', 'threshold', 'theta_c', 'while', 'all', 'particles', 'escape', 'for', 'theta', 'theta_c', 'our', 'simulations', 'support', 'a', 'further', 'prediction', 'that', 'theta_c', 'goes', 'down', 'with', 'increasing', 'rotational', 'noise', 'we', 'exploit', 'the', 'sensitivity', 'of', 'trapping', 'to', 'the', 'persistence', 'of', 'directed', 'motion', 'to', 'sort', 'particles', 'based', 'on', 'the', 'statistical', 'properties', 'of', 'their', 'activity']] | [-0.13703200972873633, 0.2538340596797857, -0.06801999273766828, -0.011787986795183357, -0.030810085782880775, -0.0980745967840136, 0.10874764118983432, 0.3603988115583326, -0.2295670838571573, -0.2979932746562026, 0.01660699526893103, -0.29378299690953646, -0.1719305167003101, 0.13873901739645436, -0.022042861893481595, 0.022580438350391297, 0.012430679881305412, -0.034107661372377675, -0.05932188181842869, -0.17237270794202794, 0.23833811963474705, 0.0850104835481589, 0.2843258623238155, 0.07902347462123814, 0.09399016890212723, -0.0013594928069594707, 0.07405265401124612, 0.031252830523912235, -0.205771555611275, 0.0735765381979237, 0.1653499536354891, 0.010639217358708155, 0.21295192381295994, -0.4238237626850605, -0.2267171410427834, 0.07353248290063544, 0.14621758264203322, 0.13446690781105963, -0.10018972513614265, -0.28914972058433386, 0.015603341407476719, -0.14765747095358678, -0.16474988823934308, -0.07552105753561696, 0.05753543840024535, 0.04329385026135901, -0.27472985951045087, 0.1314811620573364, 0.10612659812158415, 0.08699603844434023, -0.06260533867588708, -0.06783013112260071, -0.0003406296071831052, 0.07475366917365935, 0.04065936384900324, 0.04068810021760696, 0.2078641424815789, -0.1380072116037788, -0.10523259917981496, 0.37590289741527033, -0.03492429726739336, -0.12194255136667914, 0.19682204602854966, -0.1742685360208381, -0.08859697521756624, 0.18708544253293452, 0.1460021145651579, 0.08042161502228438, -0.04341871932771889, 0.02594191758299801, -0.05996693033397994, 0.19119944971566663, 0.0952511053756306, -0.03150812821434535, 0.23597715459657365, 0.21044938365630236, 0.053334786833925105, 0.1408264435443828, -0.13873698228067285, -0.1311000118548413, -0.2673159070448054, -0.12882749835839707, -0.17187259725263015, 0.034191713889683985, -0.07769297521880415, -0.1606061786327881, 0.34820267694597024, 0.18066076748784035, 0.24228337874195274, 0.053354179323117694, 0.2511137739065608, 0.04995460581400553, 0.013011289318358767, 0.04137629939364056, 0.2869126048287419, 0.14561017621166378, 0.10081870564017871, -0.29042746224227356, 0.05047671254706491, 0.03106410714943417] |
1,803.02279 | An End-to-End Goal-Oriented Dialog System with a Generative Natural
Language Response Generation | Recently advancements in deep learning allowed the development of end-to-end
trained goal-oriented dialog systems. Although these systems already achieve
good performance, some simplifications limit their usage in real-life
scenarios.
In this work, we address two of these limitations: ignoring positional
information and a fixed number of possible response candidates. We propose to
use positional encodings in the input to model the word order of the user
utterances. Furthermore, by using a feedforward neural network, we are able to
generate the output word by word and are no longer restricted to a fixed number
of possible response candidates. Using the positional encoding, we were able to
achieve better accuracies in the Dialog bAbI Tasks and using the feedforward
neural network for generating the response, we were able to save computation
time and space consumption.
| cs.CL | recently advancements in deep learning allowed the development of endtoend trained goaloriented dialog systems although these systems already achieve good performance some simplifications limit their usage in reallife scenarios in this work we address two of these limitations ignoring positional information and a fixed number of possible response candidates we propose to use positional encodings in the input to model the word order of the user utterances furthermore by using a feedforward neural network we are able to generate the output word by word and are no longer restricted to a fixed number of possible response candidates using the positional encoding we were able to achieve better accuracies in the dialog babi tasks and using the feedforward neural network for generating the response we were able to save computation time and space consumption | [['recently', 'advancements', 'in', 'deep', 'learning', 'allowed', 'the', 'development', 'of', 'endtoend', 'trained', 'goaloriented', 'dialog', 'systems', 'although', 'these', 'systems', 'already', 'achieve', 'good', 'performance', 'some', 'simplifications', 'limit', 'their', 'usage', 'in', 'reallife', 'scenarios', 'in', 'this', 'work', 'we', 'address', 'two', 'of', 'these', 'limitations', 'ignoring', 'positional', 'information', 'and', 'a', 'fixed', 'number', 'of', 'possible', 'response', 'candidates', 'we', 'propose', 'to', 'use', 'positional', 'encodings', 'in', 'the', 'input', 'to', 'model', 'the', 'word', 'order', 'of', 'the', 'user', 'utterances', 'furthermore', 'by', 'using', 'a', 'feedforward', 'neural', 'network', 'we', 'are', 'able', 'to', 'generate', 'the', 'output', 'word', 'by', 'word', 'and', 'are', 'no', 'longer', 'restricted', 'to', 'a', 'fixed', 'number', 'of', 'possible', 'response', 'candidates', 'using', 'the', 'positional', 'encoding', 'we', 'were', 'able', 'to', 'achieve', 'better', 'accuracies', 'in', 'the', 'dialog', 'babi', 'tasks', 'and', 'using', 'the', 'feedforward', 'neural', 'network', 'for', 'generating', 'the', 'response', 'we', 'were', 'able', 'to', 'save', 'computation', 'time', 'and', 'space', 'consumption']] | [-0.08340027891939744, 0.02990559442844102, -0.01688393817416259, 0.08286007219501876, -0.13297068801379405, -0.1566616981360305, 0.09790832657783635, 0.4788885201446544, -0.26323351289558794, -0.3676219625832667, 0.047287551457713586, -0.26869614379606527, -0.1871099347717836, 0.19185750925374268, -0.13194014962488623, 0.14873205572086617, 0.09427819269467705, 0.0929152353883798, -0.060029325217246673, -0.3506514786679606, 0.262174031291073, 0.05081409142904957, 0.2970999744685745, -0.03378923014646634, 0.12995105592491932, -0.04122080408820981, -0.02256263836104899, -0.019397863430448956, -0.07210644026447956, 0.17697193819847434, 0.3390017182240613, 0.16918973552116282, 0.31614765452038973, -0.45092751308260276, -0.2144271707340823, 0.12461256786228571, 0.13271851086274797, 0.13410573801081768, -0.0096364192265485, -0.3087156004503481, 0.10820733110903573, -0.2132668499379678, 0.03188163488473099, -0.1520671817523084, -0.01844759460510616, 0.026923979617238632, -0.2558424912176018, 0.002846643307659411, 0.07438802643490017, 0.04460435440147618, -0.04342249351294529, -0.07972928973026853, 0.02256129912443851, 0.22381081962187713, 0.008456004873667388, 0.040952288534289186, 0.09013583915504186, -0.18968675783756575, -0.17681937053260444, 0.3665260972273081, -0.04974859046375141, -0.22981016501728305, 0.19177609338264043, -0.04175262132141375, -0.15438357998680016, 0.09473080932831433, 0.24277306017570927, 0.06133240403929599, -0.17755623130281842, -0.018417650571134977, -0.007195342745267807, 0.24709970004072315, 0.09446201264802226, 0.05247613487159483, 0.18440899292236418, 0.24821410816393905, -0.006094657388844884, 0.1496204289614706, -0.1232301124765037, -0.06970393306862815, -0.23213182748260355, -0.07750430020251613, -0.15504996108479405, -0.018641448191093996, -0.06598069951860794, -0.08914572184492267, 0.39281320066674424, 0.25773891296125667, 0.18134855440838782, 0.14982814160770827, 0.3128044090576862, 0.04245410507712934, 0.12010104603946377, 0.09148860283728157, 0.20030414195896715, 0.024770320610220272, 0.13757067098093212, -0.18413006729985537, 0.0860470861329564, 0.027195422976676906] |
1,803.0228 | ART-UP: A Novel Method for Generating Scanning-robust Aesthetic QR codes | QR codes are usually scanned in different environments, so they must be
robust to variations in illumination, scale, coverage, and camera angles.
Aesthetic QR codes improve the visual quality, but subtle changes in their
appearance may cause scanning failure. In this paper, a new method to generate
scanning-robust aesthetic QR codes is proposed, which is based on a
module-based scanning probability estimation model that can effectively balance
the tradeoff between visual quality and scanning robustness. Our method locally
adjusts the luminance of each module by estimating the probability of
successful sampling. The approach adopts the hierarchical, coarse-to-fine
strategy to enhance the visual quality of aesthetic QR codes, which
sequentially generate the following three codes: a binary aesthetic QR code, a
grayscale aesthetic QR code, and the final color aesthetic QR code. Our
approach also can be used to create QR codes with different visual styles by
adjusting some initialization parameters. User surveys and decoding experiments
were adopted for evaluating our method compared with state-of-the-art
algorithms, which indicates that the proposed approach has excellent
performance in terms of both visual quality and scanning robustness.
| cs.MM | qr codes are usually scanned in different environments so they must be robust to variations in illumination scale coverage and camera angles aesthetic qr codes improve the visual quality but subtle changes in their appearance may cause scanning failure in this paper a new method to generate scanningrobust aesthetic qr codes is proposed which is based on a modulebased scanning probability estimation model that can effectively balance the tradeoff between visual quality and scanning robustness our method locally adjusts the luminance of each module by estimating the probability of successful sampling the approach adopts the hierarchical coarsetofine strategy to enhance the visual quality of aesthetic qr codes which sequentially generate the following three codes a binary aesthetic qr code a grayscale aesthetic qr code and the final color aesthetic qr code our approach also can be used to create qr codes with different visual styles by adjusting some initialization parameters user surveys and decoding experiments were adopted for evaluating our method compared with stateoftheart algorithms which indicates that the proposed approach has excellent performance in terms of both visual quality and scanning robustness | [['qr', 'codes', 'are', 'usually', 'scanned', 'in', 'different', 'environments', 'so', 'they', 'must', 'be', 'robust', 'to', 'variations', 'in', 'illumination', 'scale', 'coverage', 'and', 'camera', 'angles', 'aesthetic', 'qr', 'codes', 'improve', 'the', 'visual', 'quality', 'but', 'subtle', 'changes', 'in', 'their', 'appearance', 'may', 'cause', 'scanning', 'failure', 'in', 'this', 'paper', 'a', 'new', 'method', 'to', 'generate', 'scanningrobust', 'aesthetic', 'qr', 'codes', 'is', 'proposed', 'which', 'is', 'based', 'on', 'a', 'modulebased', 'scanning', 'probability', 'estimation', 'model', 'that', 'can', 'effectively', 'balance', 'the', 'tradeoff', 'between', 'visual', 'quality', 'and', 'scanning', 'robustness', 'our', 'method', 'locally', 'adjusts', 'the', 'luminance', 'of', 'each', 'module', 'by', 'estimating', 'the', 'probability', 'of', 'successful', 'sampling', 'the', 'approach', 'adopts', 'the', 'hierarchical', 'coarsetofine', 'strategy', 'to', 'enhance', 'the', 'visual', 'quality', 'of', 'aesthetic', 'qr', 'codes', 'which', 'sequentially', 'generate', 'the', 'following', 'three', 'codes', 'a', 'binary', 'aesthetic', 'qr', 'code', 'a', 'grayscale', 'aesthetic', 'qr', 'code', 'and', 'the', 'final', 'color', 'aesthetic', 'qr', 'code', 'our', 'approach', 'also', 'can', 'be', 'used', 'to', 'create', 'qr', 'codes', 'with', 'different', 'visual', 'styles', 'by', 'adjusting', 'some', 'initialization', 'parameters', 'user', 'surveys', 'and', 'decoding', 'experiments', 'were', 'adopted', 'for', 'evaluating', 'our', 'method', 'compared', 'with', 'stateoftheart', 'algorithms', 'which', 'indicates', 'that', 'the', 'proposed', 'approach', 'has', 'excellent', 'performance', 'in', 'terms', 'of', 'both', 'visual', 'quality', 'and', 'scanning', 'robustness']] | [-0.058669566959756746, 0.007966560533572153, -0.14427997818098037, 0.07666471946708203, -0.08017373513328013, -0.2576683758141391, 0.01160168201741916, 0.4811329930856988, -0.2717912645580677, -0.3577406638823859, 0.06819728700441544, -0.21899075518556677, -0.19041405195513597, 0.16433020153947706, -0.19950642103104146, 0.1362116422125517, 0.10971370151785848, -0.02428244642278814, -0.13872837932885287, -0.3270730360175718, 0.2802278828988834, 0.14933390161124888, 0.3688368750633774, -0.009887894037292226, 0.082358119692679, -0.0003415173735817546, -0.059469528312047756, 0.030432446619270595, -0.059286880921358164, 0.1326913644101456, 0.29839199335201755, 0.2134629518100205, 0.2667721517404521, -0.3593520613753104, -0.18611349879794722, 0.008242835776859915, 0.16625406372790727, 0.11932024990968344, -0.08596143028174354, -0.2992467109925001, 0.14383235416927753, -0.17393505618559543, 0.029814151114436215, -0.10351839567442517, -0.04854178377286439, 0.0023845726704726424, -0.32308380301673334, -0.02982582101245938, 0.008421762058368096, 0.08180452522483993, -0.021407416324479157, -0.1242606420534315, 0.018061523544499754, 0.17658566204309054, -0.012641563789617106, 0.07955871883314103, 0.16287332177571542, -0.13732702106782388, -0.10269475782803096, 0.3872861803642341, -0.008438717520151, -0.24704115015741152, 0.16525391950706983, -0.051111062262002585, -0.04818410891527822, 0.13857194662073646, 0.20828476055284736, 0.12222550665847139, -0.10554213011074443, -0.02725491685643127, -0.008744205249688374, 0.21898344323898739, 0.08770730658715775, 0.054062341584230435, 0.2101892440843365, 0.13576573872641956, 0.01084541146909552, 0.11807955622258545, -0.13914751660994734, -0.011144472117238974, -0.1641700729691925, -0.11084229336631904, -0.17615183062498346, -0.07656747995169608, -0.1500030964772712, -0.17113165547661893, 0.46411464911895794, 0.2470557261648547, 0.19155270626748, 0.0451668764401872, 0.40655600460205266, 0.019050833038668464, 0.10590834901693717, 0.07328199327073909, 0.16829115337040404, 0.015971885291427106, 0.07907964304283999, -0.2278720600003438, 0.15548470330547418, 0.11156263613464454] |
1,803.02281 | High Precision Statistical Landau Gauge Lattice Gluon Propagator
Computation vs. the Gribov-Zwanziger approach | The compatibility of the results from the Gribov-Zwanziger tree level
prediction and lattice simulations, using large statistical ensembles, for the
Landau gauge gluon propagator are investigated, thereby complementing earlier
work using small-scale statistics. Our results show that the data is well
described by the tree level estimate only up to momenta $p \lesssim 1$ GeV
while clearly favoring the so-called Refined Gribov-Zwanziger scenario,
implying particular relations between certain possible $d=2$ condensates. We
also provide a global fit of the lattice data which interpolates between the
above scenario at low momenta and the usual continuum one-loop renormalization
improved perturbation theory after introducing an infrared log-regularizing
term.
| hep-lat hep-ph hep-th nucl-th | the compatibility of the results from the gribovzwanziger tree level prediction and lattice simulations using large statistical ensembles for the landau gauge gluon propagator are investigated thereby complementing earlier work using smallscale statistics our results show that the data is well described by the tree level estimate only up to momenta p lesssim 1 gev while clearly favoring the socalled refined gribovzwanziger scenario implying particular relations between certain possible d2 condensates we also provide a global fit of the lattice data which interpolates between the above scenario at low momenta and the usual continuum oneloop renormalization improved perturbation theory after introducing an infrared logregularizing term | [['the', 'compatibility', 'of', 'the', 'results', 'from', 'the', 'gribovzwanziger', 'tree', 'level', 'prediction', 'and', 'lattice', 'simulations', 'using', 'large', 'statistical', 'ensembles', 'for', 'the', 'landau', 'gauge', 'gluon', 'propagator', 'are', 'investigated', 'thereby', 'complementing', 'earlier', 'work', 'using', 'smallscale', 'statistics', 'our', 'results', 'show', 'that', 'the', 'data', 'is', 'well', 'described', 'by', 'the', 'tree', 'level', 'estimate', 'only', 'up', 'to', 'momenta', 'p', 'lesssim', '1', 'gev', 'while', 'clearly', 'favoring', 'the', 'socalled', 'refined', 'gribovzwanziger', 'scenario', 'implying', 'particular', 'relations', 'between', 'certain', 'possible', 'd2', 'condensates', 'we', 'also', 'provide', 'a', 'global', 'fit', 'of', 'the', 'lattice', 'data', 'which', 'interpolates', 'between', 'the', 'above', 'scenario', 'at', 'low', 'momenta', 'and', 'the', 'usual', 'continuum', 'oneloop', 'renormalization', 'improved', 'perturbation', 'theory', 'after', 'introducing', 'an', 'infrared', 'logregularizing', 'term']] | [-0.09420725503094637, 0.1999191588112388, -0.10453842176222959, 0.14927329479430157, -0.032650121624241225, -0.10507168495006716, 0.09755664021381213, 0.333990176459058, -0.21700898362234092, -0.32349278861119485, 0.0382013161209985, -0.2587935399407378, -0.08579152718448313, 0.1267065926468394, 0.01870729881696976, 0.04710748866021346, 0.06779453903436661, -0.005451504877363242, -0.07902796429306573, -0.2376551832556008, 0.3436004786635749, 0.11364687991310628, 0.2772341028052884, 0.08845799078699201, 0.08576762555122304, 0.03914348175301431, -0.04461938146358499, -0.02080254612127856, -0.14183800391968432, 0.05816992963306033, 0.1833269763178228, 0.02557879747249759, 0.17829675459674596, -0.3768957733319929, -0.2200788923386986, 0.03831794506046348, 0.14399540159725943, 0.11490109560523146, 0.004858848638832569, -0.29008968139980706, 0.07887050199608964, -0.1660053230051954, -0.16791512033691666, -0.11614093421779287, -0.06855440283946407, -0.08136792727264737, -0.3064387753939417, 0.12435198832911108, 0.022647124237174958, 0.06794214939089635, -0.04126884739693756, -0.14558088845268896, -0.05782135039156016, 0.08108569746680307, 0.07982425462194861, 0.09784846911218036, 0.09474172336117939, -0.17833361671700215, -0.126242046257875, 0.3781394236362897, -0.06707020032515104, -0.1354763513484683, 0.16704508578046584, -0.16997076988739607, -0.17189780791970685, 0.12619179350216514, 0.06902286841068417, 0.06491121513066062, -0.14803180694490528, 0.13583521270608728, -0.0490052383303499, 0.15655884490115568, 0.11432616113989542, 0.020314645584081657, 0.1942474500168688, 0.1291645480445228, 0.015079914413105983, 0.10119064478651406, -0.05942987082940258, -0.1325901464313994, -0.371217432924403, -0.03058186810141286, -0.14101114251221028, 0.020713410026823673, -0.16095314877384226, -0.0877237916395713, 0.3366240383251212, 0.15941358876163855, 0.22334875355591066, 0.11107820951348493, 0.26468174845481723, 0.14685755015838928, 0.08011266169397949, 0.067085756168056, 0.23627557233871463, 0.12465549827454826, 0.07259285009618346, -0.2331520564643702, -0.07680271424424763, 0.1045658493710037] |
1,803.02282 | The Preeminence of Ethnic Diversity in Scientific Collaboration | Inspired by the social and economic benefits of diversity, we analyze over 9
million papers and 6 million scientists to study the relationship between
research impact and five classes of diversity: ethnicity, discipline, gender,
affiliation, and academic age. Using randomized baseline models, we establish
the presence of homophily in ethnicity, gender and affiliation. We then study
the effect of diversity on scientific impact, as reflected in citations.
Remarkably, of the classes considered, ethnic diversity had the strongest
correlation with scientific impact. To further isolate the effects of ethnic
diversity, we used randomized baseline models and again found a clear link
between diversity and impact. To further support these findings, we use
coarsened exact matching to compare the scientific impact of ethnically diverse
papers and scientists with closely-matched control groups. Here, we find that
ethnic diversity resulted in an impact gain of 10.63% for papers, and 47.67%
for scientists.
| cs.DL cs.SI physics.soc-ph | inspired by the social and economic benefits of diversity we analyze over 9 million papers and 6 million scientists to study the relationship between research impact and five classes of diversity ethnicity discipline gender affiliation and academic age using randomized baseline models we establish the presence of homophily in ethnicity gender and affiliation we then study the effect of diversity on scientific impact as reflected in citations remarkably of the classes considered ethnic diversity had the strongest correlation with scientific impact to further isolate the effects of ethnic diversity we used randomized baseline models and again found a clear link between diversity and impact to further support these findings we use coarsened exact matching to compare the scientific impact of ethnically diverse papers and scientists with closelymatched control groups here we find that ethnic diversity resulted in an impact gain of 1063 for papers and 4767 for scientists | [['inspired', 'by', 'the', 'social', 'and', 'economic', 'benefits', 'of', 'diversity', 'we', 'analyze', 'over', '9', 'million', 'papers', 'and', '6', 'million', 'scientists', 'to', 'study', 'the', 'relationship', 'between', 'research', 'impact', 'and', 'five', 'classes', 'of', 'diversity', 'ethnicity', 'discipline', 'gender', 'affiliation', 'and', 'academic', 'age', 'using', 'randomized', 'baseline', 'models', 'we', 'establish', 'the', 'presence', 'of', 'homophily', 'in', 'ethnicity', 'gender', 'and', 'affiliation', 'we', 'then', 'study', 'the', 'effect', 'of', 'diversity', 'on', 'scientific', 'impact', 'as', 'reflected', 'in', 'citations', 'remarkably', 'of', 'the', 'classes', 'considered', 'ethnic', 'diversity', 'had', 'the', 'strongest', 'correlation', 'with', 'scientific', 'impact', 'to', 'further', 'isolate', 'the', 'effects', 'of', 'ethnic', 'diversity', 'we', 'used', 'randomized', 'baseline', 'models', 'and', 'again', 'found', 'a', 'clear', 'link', 'between', 'diversity', 'and', 'impact', 'to', 'further', 'support', 'these', 'findings', 'we', 'use', 'coarsened', 'exact', 'matching', 'to', 'compare', 'the', 'scientific', 'impact', 'of', 'ethnically', 'diverse', 'papers', 'and', 'scientists', 'with', 'closelymatched', 'control', 'groups', 'here', 'we', 'find', 'that', 'ethnic', 'diversity', 'resulted', 'in', 'an', 'impact', 'gain', 'of', '1063', 'for', 'papers', 'and', '4767', 'for', 'scientists']] | [-0.060621688294471524, 0.05528761284375566, -0.0563704742175736, 0.11220247409034038, -0.13961199092596363, -0.07724182204609471, 0.1301255059067388, 0.423475156316445, -0.21209380054212063, -0.42269635949359863, 0.027681545991938384, -0.3101911678162663, -0.20782598062437407, 0.1634788852546136, -0.10633864129899817, -0.04003044738922091, 0.050488575995221836, 0.014593438901083201, -0.04620653438163275, -0.34798162761080986, 0.3261285317035354, 0.07414564670564062, 0.33137386455675777, 0.08115684649653433, 0.04666519010768962, -0.03919698015254523, -0.16570540907837095, 0.05270348670480608, -0.14238956852105872, 0.136311890025224, 0.3067959224951052, 0.2342637154419406, 0.39248471987135963, -0.36842822453298535, -0.18988458944015763, 0.10531742204310132, 0.13350670524004873, 0.049000703232350194, -0.05562445917087575, -0.3030018344977681, 0.03544076925957715, -0.2543500644363919, -0.06549345039553484, -0.015398695151049161, 0.05684240438918374, 0.03385270496895283, -0.20365507137283784, 0.08943194462632646, -0.010733969525440413, 0.2044780660598051, -0.035217757932334934, -0.18090740004617747, -0.01065510836094111, 0.26981590388855126, 0.11644682256492223, -0.053815008041315844, 0.08989065860201713, -0.13220138913400623, -0.1784344314479548, 0.34467675317978475, -0.04129704653735266, -0.12552907690989903, 0.21657217707054144, -0.1482504936613041, -0.15588336048305643, 0.022513722777556703, 0.2678570814532082, -0.0007592306161920229, -0.13608636208778235, -0.039026349800762396, -0.021091829033467135, 0.1843291703899879, 0.11623297757817572, 0.049166911862929964, 0.1745948927844463, 0.1472254032712607, 0.011465968627507995, 0.10565419535019568, -0.07774184635827686, -0.08431542989778884, -0.17027601845511775, -0.11272655295280955, -0.08062355404048144, 0.025242589189208485, -0.1010950016336742, -0.11326862945930943, 0.43683360501186175, 0.18678757641385277, 0.08310137027684524, 0.05641496362050577, 0.22678065534085542, -0.03998613783212214, 0.057106360425108645, 0.05864632529836959, 0.20902136825009243, 0.07517040939209665, 0.13466574065308054, -0.19297077898316237, 0.149584932088041, -0.03818389551546171] |
1,803.02283 | Effect of charge ordering on the electrical properties and
magnetoresistance of manganites | The Monte Carlo Ferromagnetic Ising model was used to study the electrical
properties of manganese oxides due to the charge ordering phase occurring at
doping, x = 0.5. The half-doped manganites have an insulator antiferromagnetic
ground state. We calculated the internal energy, specific heat, resistivity and
the magneto-resistance, MR, with parallel and anti-parallel applied magnetic
fields. Our simulation reveals that the resistivity decreases exponentially and
the electric current increases with increasing temperature according the free
charge increase, to transport from an insulator to conductor phase. The
magnetoresistance has negative small values with parallel magnetic field but
has positive high values with unti-parallel magnetic field. The obtained
semiconductor-metal transition behavior candidates the half-doped manganites to
be very good semiconductors diode junctions.
| cond-mat.str-el | the monte carlo ferromagnetic ising model was used to study the electrical properties of manganese oxides due to the charge ordering phase occurring at doping x 05 the halfdoped manganites have an insulator antiferromagnetic ground state we calculated the internal energy specific heat resistivity and the magnetoresistance mr with parallel and antiparallel applied magnetic fields our simulation reveals that the resistivity decreases exponentially and the electric current increases with increasing temperature according the free charge increase to transport from an insulator to conductor phase the magnetoresistance has negative small values with parallel magnetic field but has positive high values with untiparallel magnetic field the obtained semiconductormetal transition behavior candidates the halfdoped manganites to be very good semiconductors diode junctions | [['the', 'monte', 'carlo', 'ferromagnetic', 'ising', 'model', 'was', 'used', 'to', 'study', 'the', 'electrical', 'properties', 'of', 'manganese', 'oxides', 'due', 'to', 'the', 'charge', 'ordering', 'phase', 'occurring', 'at', 'doping', 'x', '05', 'the', 'halfdoped', 'manganites', 'have', 'an', 'insulator', 'antiferromagnetic', 'ground', 'state', 'we', 'calculated', 'the', 'internal', 'energy', 'specific', 'heat', 'resistivity', 'and', 'the', 'magnetoresistance', 'mr', 'with', 'parallel', 'and', 'antiparallel', 'applied', 'magnetic', 'fields', 'our', 'simulation', 'reveals', 'that', 'the', 'resistivity', 'decreases', 'exponentially', 'and', 'the', 'electric', 'current', 'increases', 'with', 'increasing', 'temperature', 'according', 'the', 'free', 'charge', 'increase', 'to', 'transport', 'from', 'an', 'insulator', 'to', 'conductor', 'phase', 'the', 'magnetoresistance', 'has', 'negative', 'small', 'values', 'with', 'parallel', 'magnetic', 'field', 'but', 'has', 'positive', 'high', 'values', 'with', 'untiparallel', 'magnetic', 'field', 'the', 'obtained', 'semiconductormetal', 'transition', 'behavior', 'candidates', 'the', 'halfdoped', 'manganites', 'to', 'be', 'very', 'good', 'semiconductors', 'diode', 'junctions']] | [-0.19574351852436123, 0.23168580254793397, 0.020222886824601535, -0.0018020054360977926, -0.054793584681415965, -0.1830053786052612, 0.08357434549321563, 0.4084588279158382, -0.2557805569100557, -0.33533025779208897, -0.04211066538168086, -0.3687737702186835, -0.07105708408753499, 0.17860075191918257, 0.06975405928442034, -0.006625165440432206, -0.050413965624441406, -0.02768144451113323, -0.1323297903616518, -0.22318867606237153, 0.22515316078068404, 0.05862411225640799, 0.35993047890458574, 0.06319603616750594, 0.0433587433841332, -0.04143239224578207, 0.22281710253791662, 0.08405713137712525, -0.1837446482539975, -0.03841008661093853, 0.2682430729333122, -0.18606428076686748, 0.157463987379619, -0.45403781193071757, -0.19417516826415213, 0.027038006571721347, 0.10142808688125747, 0.1376101632910323, -0.11701010876055018, -0.26395516755785475, 0.08481677145681392, -0.1341925522004712, -0.08571604639341092, -0.1217210399760407, -0.03246716031275879, 0.011793432146077976, -0.27084585196354377, 0.1044231652108542, 0.01639552407313959, 0.14268137378049855, -0.13961300961633796, -0.19588727334522152, -0.10284060719067831, 0.05733458545074751, 0.12904977975847295, 0.15555749076785583, 0.20397236244358374, -0.1094268540559747, -0.1309604482267494, 0.26348377565332387, -0.03255418968442196, -0.06299165778367197, 0.1564711750863846, -0.23994831261777524, -0.0017897324743621462, 0.2185159669952246, 0.07233416647808152, 0.09544813857903167, -0.10706322308100949, 0.08876910313847475, 0.05624929734237366, 0.18742733843174716, -0.01802311639569826, 0.03575869313228118, 0.27348019606512736, 0.19600163790855116, 0.014890130670441284, 0.18100337543962838, -0.15051121313038077, -0.058247140502178316, -0.1554037868755601, -0.20370863551684357, -0.24263678982427692, 0.11127964493037218, -0.12987424156165353, -0.2592558398827026, 0.38182621300851893, 0.2117464871411419, 0.15954617147286565, -0.0876800835890285, 0.24262075634846875, 0.15302085580197716, 0.07922357108080917, 0.040383548865497304, 0.21114640692012163, 0.2555606860856889, 0.25326153347900104, -0.33515904222465104, 0.1279589967048427, -0.02755468549854043] |
1,803.02284 | Zero-Shot Sketch-Image Hashing | Recent studies show that large-scale sketch-based image retrieval (SBIR) can
be efficiently tackled by cross-modal binary representation learning methods,
where Hamming distance matching significantly speeds up the process of
similarity search. Providing training and test data subjected to a fixed set of
pre-defined categories, the cutting-edge SBIR and cross-modal hashing works
obtain acceptable retrieval performance. However, most of the existing methods
fail when the categories of query sketches have never been seen during
training. In this paper, the above problem is briefed as a novel but realistic
zero-shot SBIR hashing task. We elaborate the challenges of this special task
and accordingly propose a zero-shot sketch-image hashing (ZSIH) model. An
end-to-end three-network architecture is built, two of which are treated as the
binary encoders. The third network mitigates the sketch-image heterogeneity and
enhances the semantic relations among data by utilizing the Kronecker fusion
layer and graph convolution, respectively. As an important part of ZSIH, we
formulate a generative hashing scheme in reconstructing semantic knowledge
representations for zero-shot retrieval. To the best of our knowledge, ZSIH is
the first zero-shot hashing work suitable for SBIR and cross-modal search.
Comprehensive experiments are conducted on two extended datasets, i.e., Sketchy
and TU-Berlin with a novel zero-shot train-test split. The proposed model
remarkably outperforms related works.
| cs.CV | recent studies show that largescale sketchbased image retrieval sbir can be efficiently tackled by crossmodal binary representation learning methods where hamming distance matching significantly speeds up the process of similarity search providing training and test data subjected to a fixed set of predefined categories the cuttingedge sbir and crossmodal hashing works obtain acceptable retrieval performance however most of the existing methods fail when the categories of query sketches have never been seen during training in this paper the above problem is briefed as a novel but realistic zeroshot sbir hashing task we elaborate the challenges of this special task and accordingly propose a zeroshot sketchimage hashing zsih model an endtoend threenetwork architecture is built two of which are treated as the binary encoders the third network mitigates the sketchimage heterogeneity and enhances the semantic relations among data by utilizing the kronecker fusion layer and graph convolution respectively as an important part of zsih we formulate a generative hashing scheme in reconstructing semantic knowledge representations for zeroshot retrieval to the best of our knowledge zsih is the first zeroshot hashing work suitable for sbir and crossmodal search comprehensive experiments are conducted on two extended datasets ie sketchy and tuberlin with a novel zeroshot traintest split the proposed model remarkably outperforms related works | [['recent', 'studies', 'show', 'that', 'largescale', 'sketchbased', 'image', 'retrieval', 'sbir', 'can', 'be', 'efficiently', 'tackled', 'by', 'crossmodal', 'binary', 'representation', 'learning', 'methods', 'where', 'hamming', 'distance', 'matching', 'significantly', 'speeds', 'up', 'the', 'process', 'of', 'similarity', 'search', 'providing', 'training', 'and', 'test', 'data', 'subjected', 'to', 'a', 'fixed', 'set', 'of', 'predefined', 'categories', 'the', 'cuttingedge', 'sbir', 'and', 'crossmodal', 'hashing', 'works', 'obtain', 'acceptable', 'retrieval', 'performance', 'however', 'most', 'of', 'the', 'existing', 'methods', 'fail', 'when', 'the', 'categories', 'of', 'query', 'sketches', 'have', 'never', 'been', 'seen', 'during', 'training', 'in', 'this', 'paper', 'the', 'above', 'problem', 'is', 'briefed', 'as', 'a', 'novel', 'but', 'realistic', 'zeroshot', 'sbir', 'hashing', 'task', 'we', 'elaborate', 'the', 'challenges', 'of', 'this', 'special', 'task', 'and', 'accordingly', 'propose', 'a', 'zeroshot', 'sketchimage', 'hashing', 'zsih', 'model', 'an', 'endtoend', 'threenetwork', 'architecture', 'is', 'built', 'two', 'of', 'which', 'are', 'treated', 'as', 'the', 'binary', 'encoders', 'the', 'third', 'network', 'mitigates', 'the', 'sketchimage', 'heterogeneity', 'and', 'enhances', 'the', 'semantic', 'relations', 'among', 'data', 'by', 'utilizing', 'the', 'kronecker', 'fusion', 'layer', 'and', 'graph', 'convolution', 'respectively', 'as', 'an', 'important', 'part', 'of', 'zsih', 'we', 'formulate', 'a', 'generative', 'hashing', 'scheme', 'in', 'reconstructing', 'semantic', 'knowledge', 'representations', 'for', 'zeroshot', 'retrieval', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'zsih', 'is', 'the', 'first', 'zeroshot', 'hashing', 'work', 'suitable', 'for', 'sbir', 'and', 'crossmodal', 'search', 'comprehensive', 'experiments', 'are', 'conducted', 'on', 'two', 'extended', 'datasets', 'ie', 'sketchy', 'and', 'tuberlin', 'with', 'a', 'novel', 'zeroshot', 'traintest', 'split', 'the', 'proposed', 'model', 'remarkably', 'outperforms', 'related', 'works']] | [-0.06020716492951449, -0.021036530701704102, -0.05217969835336719, 0.08515926612118555, -0.12797343110100234, -0.20790660118883741, 0.02740461478852445, 0.4488897773658945, -0.27581659108677525, -0.33001390916428397, 0.05445357577409595, -0.2569561180977395, -0.1579008788180848, 0.16761626990600711, -0.1435167222987816, 0.10473618975097668, 0.1439836186911201, 0.051381283181364694, -0.11797297390820902, -0.3302501911104801, 0.3538608245995073, 0.06006614299091909, 0.3555120421081526, 0.03497944085060486, 0.11882742783830812, -0.019683827312352756, -0.06649554063000583, -0.03381169915422409, -0.032077983401090714, 0.18529678461906898, 0.3594090417249217, 0.2353763819261942, 0.28675335058166335, -0.33919040574913933, -0.2384566737738039, 0.09562639912834302, 0.14868299825383083, 0.09784310633175275, -0.07060408355609979, -0.36882687524914565, 0.0666177483164661, -0.19820534835702608, 0.11579336845315993, -0.15273911885562397, -0.03210602738850173, -0.043532939226965287, -0.3105556352729244, 0.021998866256104692, 0.12118076919578016, 0.040116571768053944, -0.05025866409275858, -0.13277970200315828, 0.08074058697425894, 0.14250463595311713, 0.018840375809702978, 0.09571335537115201, 0.09828758233315533, -0.18362407315345036, -0.16696091775471966, 0.3941618868105468, -0.04164331735422214, -0.17989554880963018, 0.17986556262975292, 0.009399040595772455, -0.17593069743098957, 0.05475480082012447, 0.22063635707988094, 0.1760775284597739, -0.17103618983369198, 0.02900792469542163, -0.08568348839790338, 0.1751068660956142, 0.08324326115206142, -0.00532606032433077, 0.15154737342215543, 0.280038089157703, 0.024722833018971695, 0.17847761320327188, -0.12306037108923885, -0.06145456506249805, -0.16883046222473716, -0.10294999188599399, -0.20046256617254887, -0.07963508559457426, -0.11104501656962038, -0.1259175393286915, 0.36544483373600956, 0.2343396296159231, 0.23041964857991495, 0.09318681590846695, 0.3654110384351086, -0.0098127177932405, 0.13004188878195627, 0.09788232072023675, 0.1716405273160143, 0.015388441704479712, 0.12186207359967133, -0.1416589587815993, 0.08655291915305757, 0.10210741662331635] |
1,803.02285 | Hybrid Multi-camera Visual Servoing to Moving Target | Visual servoing is a well-known task in robotics. However, there are still
challenges when multiple visual sources are combined to accurately guide the
robot or occlusions appear. In this paper we present a novel visual servoing
approach using hybrid multi-camera input data to lead a robot arm accurately to
dynamically moving target points in the presence of partial occlusions. The
approach uses four RGBD sensors as Eye-to-Hand (EtoH) visual input, and an
arm-mounted stereo camera as Eye-in-Hand (EinH). A Master supervisor task
selects between using the EtoH or the EinH, depending on the distance between
the robot and target. The Master also selects the subset of EtoH cameras that
best perceive the target. When the EinH sensor is used, if the target becomes
occluded or goes out of the sensor's view-frustum, the Master switches back to
the EtoH sensors to re-track the object. Using this adaptive visual input data,
the robot is then controlled using an iterative planner that uses position,
orientation and joint configuration to estimate the trajectory. Since the
target is dynamic, this trajectory is updated every time-step. Experiments show
good performance in four different situations: tracking a ball, targeting a
bulls-eye, guiding a straw to a mouth and delivering an item to a moving hand.
The experiments cover both simple situations such as a ball that is mostly
visible from all cameras, and more complex situations such as the mouth which
is partially occluded from some of the sensors.
| cs.CV cs.RO | visual servoing is a wellknown task in robotics however there are still challenges when multiple visual sources are combined to accurately guide the robot or occlusions appear in this paper we present a novel visual servoing approach using hybrid multicamera input data to lead a robot arm accurately to dynamically moving target points in the presence of partial occlusions the approach uses four rgbd sensors as eyetohand etoh visual input and an armmounted stereo camera as eyeinhand einh a master supervisor task selects between using the etoh or the einh depending on the distance between the robot and target the master also selects the subset of etoh cameras that best perceive the target when the einh sensor is used if the target becomes occluded or goes out of the sensors viewfrustum the master switches back to the etoh sensors to retrack the object using this adaptive visual input data the robot is then controlled using an iterative planner that uses position orientation and joint configuration to estimate the trajectory since the target is dynamic this trajectory is updated every timestep experiments show good performance in four different situations tracking a ball targeting a bullseye guiding a straw to a mouth and delivering an item to a moving hand the experiments cover both simple situations such as a ball that is mostly visible from all cameras and more complex situations such as the mouth which is partially occluded from some of the sensors | [['visual', 'servoing', 'is', 'a', 'wellknown', 'task', 'in', 'robotics', 'however', 'there', 'are', 'still', 'challenges', 'when', 'multiple', 'visual', 'sources', 'are', 'combined', 'to', 'accurately', 'guide', 'the', 'robot', 'or', 'occlusions', 'appear', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'visual', 'servoing', 'approach', 'using', 'hybrid', 'multicamera', 'input', 'data', 'to', 'lead', 'a', 'robot', 'arm', 'accurately', 'to', 'dynamically', 'moving', 'target', 'points', 'in', 'the', 'presence', 'of', 'partial', 'occlusions', 'the', 'approach', 'uses', 'four', 'rgbd', 'sensors', 'as', 'eyetohand', 'etoh', 'visual', 'input', 'and', 'an', 'armmounted', 'stereo', 'camera', 'as', 'eyeinhand', 'einh', 'a', 'master', 'supervisor', 'task', 'selects', 'between', 'using', 'the', 'etoh', 'or', 'the', 'einh', 'depending', 'on', 'the', 'distance', 'between', 'the', 'robot', 'and', 'target', 'the', 'master', 'also', 'selects', 'the', 'subset', 'of', 'etoh', 'cameras', 'that', 'best', 'perceive', 'the', 'target', 'when', 'the', 'einh', 'sensor', 'is', 'used', 'if', 'the', 'target', 'becomes', 'occluded', 'or', 'goes', 'out', 'of', 'the', 'sensors', 'viewfrustum', 'the', 'master', 'switches', 'back', 'to', 'the', 'etoh', 'sensors', 'to', 'retrack', 'the', 'object', 'using', 'this', 'adaptive', 'visual', 'input', 'data', 'the', 'robot', 'is', 'then', 'controlled', 'using', 'an', 'iterative', 'planner', 'that', 'uses', 'position', 'orientation', 'and', 'joint', 'configuration', 'to', 'estimate', 'the', 'trajectory', 'since', 'the', 'target', 'is', 'dynamic', 'this', 'trajectory', 'is', 'updated', 'every', 'timestep', 'experiments', 'show', 'good', 'performance', 'in', 'four', 'different', 'situations', 'tracking', 'a', 'ball', 'targeting', 'a', 'bullseye', 'guiding', 'a', 'straw', 'to', 'a', 'mouth', 'and', 'delivering', 'an', 'item', 'to', 'a', 'moving', 'hand', 'the', 'experiments', 'cover', 'both', 'simple', 'situations', 'such', 'as', 'a', 'ball', 'that', 'is', 'mostly', 'visible', 'from', 'all', 'cameras', 'and', 'more', 'complex', 'situations', 'such', 'as', 'the', 'mouth', 'which', 'is', 'partially', 'occluded', 'from', 'some', 'of', 'the', 'sensors']] | [-0.07829353197608847, 0.05243090471464841, -0.08833616322868586, 0.0007454976660811866, -0.13140133297376083, -0.19273296356428132, 0.03557729606341547, 0.4369491730354914, -0.264854578855017, -0.337982251328424, 0.09066103334681284, -0.2971083276959903, -0.16306821452556453, 0.17895942785828023, -0.20245806621231077, 0.06967586648509595, 0.12659633392957234, 0.09519053151549287, -0.005850890940671568, -0.20545551549186422, 0.2593636912912005, 0.01054645680720691, 0.24575098455656602, -0.033749446718945725, 0.18976457276823736, 0.03897115185919429, 0.00043387462173690317, 0.0025074686444200136, -0.026863779990508038, 0.09941564009455424, 0.30273536205714363, 0.16581534756887548, 0.2897624049214411, -0.41477559125107155, -0.16918704057300166, 0.05479213023683479, 0.1230193667638139, 0.0901567132007761, -0.037066916193426176, -0.3816368386008534, 0.06545490640736021, -0.1200519941909583, -0.06418937492818266, -0.02694833981843681, 0.018779375404510804, 0.004738535481591185, -0.298262825824649, -0.03928812038108898, 0.0003748613902751137, 0.04571718215832815, -0.08142784330700406, -0.05044414277556313, -0.0012090940247563755, 0.241685921923275, 0.009945386657765246, 0.08720796814818374, 0.21393751359897853, -0.1810308559905315, -0.08413313407286563, 0.40559298911390185, 0.004907281783667682, -0.24759461250872264, 0.21159959190423375, -0.07447053092735342, -0.09351676110542152, 0.12411188769463387, 0.18445763409826435, 0.16239331082571512, -0.17657308774169225, 0.011851451744886991, -0.046993940059064314, 0.1923681840304473, 0.08598148960624077, -0.02457609344391199, 0.19580461090712362, 0.21217867551457545, 0.10569738998946522, 0.13019886006749853, -0.17374099220223568, -0.052935819797014366, -0.2682136209178305, -0.09923049037446495, -0.17578420802968467, -0.04940958174743822, -0.08006029309708079, -0.13231238948857263, 0.3498638309694889, 0.2131800373992687, 0.2367455243219097, 0.027197767913201137, 0.39552422968216805, 0.02651424034246236, 0.060895768551844635, 0.06552406851722695, 0.19709918922962358, -0.027128368483058045, 0.12154582792994793, -0.186411369531298, 0.07500960079338226, 0.037933255701341484] |
1,803.02286 | Learning monocular visual odometry with dense 3D mapping from dense 3D
flow | This paper introduces a fully deep learning approach to monocular SLAM, which
can perform simultaneous localization using a neural network for learning
visual odometry (L-VO) and dense 3D mapping. Dense 2D flow and a depth image
are generated from monocular images by sub-networks, which are then used by a
3D flow associated layer in the L-VO network to generate dense 3D flow. Given
this 3D flow, the dual-stream L-VO network can then predict the 6DOF relative
pose and furthermore reconstruct the vehicle trajectory. In order to learn the
correlation between motion directions, the Bivariate Gaussian modelling is
employed in the loss function. The L-VO network achieves an overall performance
of 2.68% for average translational error and 0.0143 deg/m for average
rotational error on the KITTI odometry benchmark. Moreover, the learned depth
is fully leveraged to generate a dense 3D map. As a result, an entire visual
SLAM system, that is, learning monocular odometry combined with dense 3D
mapping, is achieved.
| cs.RO cs.CV | this paper introduces a fully deep learning approach to monocular slam which can perform simultaneous localization using a neural network for learning visual odometry lvo and dense 3d mapping dense 2d flow and a depth image are generated from monocular images by subnetworks which are then used by a 3d flow associated layer in the lvo network to generate dense 3d flow given this 3d flow the dualstream lvo network can then predict the 6dof relative pose and furthermore reconstruct the vehicle trajectory in order to learn the correlation between motion directions the bivariate gaussian modelling is employed in the loss function the lvo network achieves an overall performance of 268 for average translational error and 00143 degm for average rotational error on the kitti odometry benchmark moreover the learned depth is fully leveraged to generate a dense 3d map as a result an entire visual slam system that is learning monocular odometry combined with dense 3d mapping is achieved | [['this', 'paper', 'introduces', 'a', 'fully', 'deep', 'learning', 'approach', 'to', 'monocular', 'slam', 'which', 'can', 'perform', 'simultaneous', 'localization', 'using', 'a', 'neural', 'network', 'for', 'learning', 'visual', 'odometry', 'lvo', 'and', 'dense', '3d', 'mapping', 'dense', '2d', 'flow', 'and', 'a', 'depth', 'image', 'are', 'generated', 'from', 'monocular', 'images', 'by', 'subnetworks', 'which', 'are', 'then', 'used', 'by', 'a', '3d', 'flow', 'associated', 'layer', 'in', 'the', 'lvo', 'network', 'to', 'generate', 'dense', '3d', 'flow', 'given', 'this', '3d', 'flow', 'the', 'dualstream', 'lvo', 'network', 'can', 'then', 'predict', 'the', '6dof', 'relative', 'pose', 'and', 'furthermore', 'reconstruct', 'the', 'vehicle', 'trajectory', 'in', 'order', 'to', 'learn', 'the', 'correlation', 'between', 'motion', 'directions', 'the', 'bivariate', 'gaussian', 'modelling', 'is', 'employed', 'in', 'the', 'loss', 'function', 'the', 'lvo', 'network', 'achieves', 'an', 'overall', 'performance', 'of', '268', 'for', 'average', 'translational', 'error', 'and', '00143', 'degm', 'for', 'average', 'rotational', 'error', 'on', 'the', 'kitti', 'odometry', 'benchmark', 'moreover', 'the', 'learned', 'depth', 'is', 'fully', 'leveraged', 'to', 'generate', 'a', 'dense', '3d', 'map', 'as', 'a', 'result', 'an', 'entire', 'visual', 'slam', 'system', 'that', 'is', 'learning', 'monocular', 'odometry', 'combined', 'with', 'dense', '3d', 'mapping', 'is', 'achieved']] | [-0.05195315656601451, 0.0033234557851756106, -0.043002456273825374, -0.02048332892736653, -0.040656240373209585, -0.155613819998689, -0.04424027971035684, 0.4891466414090246, -0.3227191797690466, -0.30293413032777605, 0.06066565535511472, -0.25492945895530283, -0.20707482502912172, 0.15703106108267093, -0.1722494566674868, 0.15416651908890344, 0.17249447492649778, 0.028650648484472185, -0.09745292161824182, -0.18905488602758852, 0.2654094286175678, 0.0030994230362921373, 0.3095316412334796, -0.000580111873568967, 0.19023563813825603, -0.008900927279319149, -0.0003571428867871873, 0.016118664291570894, -0.06127492809632713, 0.2167187814571662, 0.2601230530577595, 0.14994581626087894, 0.2252424026548397, -0.40300099783344195, -0.2755201950611081, 0.039601461253187156, 0.16661634976626374, 0.07977078350813827, -0.02709046643358306, -0.4077351499348879, 0.09987136464915239, -0.16554764402098954, 0.017018618821748533, -0.11127775999921141, -0.02628790358940023, -0.03224545872435556, -0.3476694100652821, 0.05342382043290854, 0.04534110825429707, 0.09801545412628912, -0.07367502160777803, -0.00948403956135735, -0.034547750058118255, 0.26498443408781897, -0.05143190223388956, 0.15819449331902433, 0.15463669484088313, -0.22823239262070275, -0.05758803861572233, 0.397344610770233, -0.06543488699462614, -0.23651327746119932, 0.19340865464182572, -0.02424818294821307, -0.08749044958385639, 0.17735109752975403, 0.2606113653047942, 0.10191866008681245, -0.16289464185028918, -0.013813815319736023, -0.10307977303746156, 0.20057070077746175, 0.021974305500043555, -0.05780992968648206, 0.1756110557951615, 0.23022375207801815, 0.10148297914420254, 0.12000250797718763, -0.2520298347448261, -0.041841418264084496, -0.17794913698671735, -0.1145551472727675, -0.2041707481184858, -0.03736076319473795, -0.10825138241889362, -0.14102382089595267, 0.40893781518097966, 0.21947177831898443, 0.2379808395402506, 0.13065275981207378, 0.40607192494207994, 0.037665605119400425, 0.06044432325288653, 0.12199757929192856, 0.21027583308386966, 0.03190217341616517, 0.10961232471854601, -0.18608449445746372, 0.06045210186712211, 0.14615134838604718] |
1,803.02287 | Analyzing the basic principles of tissue microarray data measuring the
cooperative phenomena of marker proteins in invasive breast cancer | The analysis of a protein-expression pattern from tissue microarray (TMA)
data will not immediately give an answer on synergistic or antagonistic effects
between the expression of the observed proteins. But contrary to apparent first
impression, it is possible to reveal those cooperative phenomena from TMA data.
We present here a largely assumption-free combinatorial analysis, related to
correlation networks but with much less arbitrary constraints. A strong focus
was put on the analysis of the basic data to analyze how the cooperative
phenomena might be imprinted in the TMA data structure. The study design was
based on two independent panels of 589 and 366 invasive breast cancer cases
from different institutions, assembled on tissue microarrays. The combinatorial
analysis generates an optimal rank ordering of protein-expression coherence.
The outcome of the analysis corresponds to all the single observations
scattered over several publications and integrates them in one context. This
means all these scattered observations can also be deduced from one TMA
experiment. A comprehensive statistical meta-analysis of the TMA data suggests
the existence of a superposition of three basic coherence situations, and
offers the opportunity to analyze these data properties with additional
real-world data and synthetic data in more detail. The presented algorithm
gives molecular pathologists a tool to extract dependency information from TMA
data. Beyond this practical benefit, some light was shed on how dependency
aspects might be imprinted into expression data. This will certainly foster the
refinement of algorithms to reconstruct dependency networks. The implementation
of the algorithm is at the moment not end-user suitable, but available on
request.
| q-bio.MN | the analysis of a proteinexpression pattern from tissue microarray tma data will not immediately give an answer on synergistic or antagonistic effects between the expression of the observed proteins but contrary to apparent first impression it is possible to reveal those cooperative phenomena from tma data we present here a largely assumptionfree combinatorial analysis related to correlation networks but with much less arbitrary constraints a strong focus was put on the analysis of the basic data to analyze how the cooperative phenomena might be imprinted in the tma data structure the study design was based on two independent panels of 589 and 366 invasive breast cancer cases from different institutions assembled on tissue microarrays the combinatorial analysis generates an optimal rank ordering of proteinexpression coherence the outcome of the analysis corresponds to all the single observations scattered over several publications and integrates them in one context this means all these scattered observations can also be deduced from one tma experiment a comprehensive statistical metaanalysis of the tma data suggests the existence of a superposition of three basic coherence situations and offers the opportunity to analyze these data properties with additional realworld data and synthetic data in more detail the presented algorithm gives molecular pathologists a tool to extract dependency information from tma data beyond this practical benefit some light was shed on how dependency aspects might be imprinted into expression data this will certainly foster the refinement of algorithms to reconstruct dependency networks the implementation of the algorithm is at the moment not enduser suitable but available on request | [['the', 'analysis', 'of', 'a', 'proteinexpression', 'pattern', 'from', 'tissue', 'microarray', 'tma', 'data', 'will', 'not', 'immediately', 'give', 'an', 'answer', 'on', 'synergistic', 'or', 'antagonistic', 'effects', 'between', 'the', 'expression', 'of', 'the', 'observed', 'proteins', 'but', 'contrary', 'to', 'apparent', 'first', 'impression', 'it', 'is', 'possible', 'to', 'reveal', 'those', 'cooperative', 'phenomena', 'from', 'tma', 'data', 'we', 'present', 'here', 'a', 'largely', 'assumptionfree', 'combinatorial', 'analysis', 'related', 'to', 'correlation', 'networks', 'but', 'with', 'much', 'less', 'arbitrary', 'constraints', 'a', 'strong', 'focus', 'was', 'put', 'on', 'the', 'analysis', 'of', 'the', 'basic', 'data', 'to', 'analyze', 'how', 'the', 'cooperative', 'phenomena', 'might', 'be', 'imprinted', 'in', 'the', 'tma', 'data', 'structure', 'the', 'study', 'design', 'was', 'based', 'on', 'two', 'independent', 'panels', 'of', '589', 'and', '366', 'invasive', 'breast', 'cancer', 'cases', 'from', 'different', 'institutions', 'assembled', 'on', 'tissue', 'microarrays', 'the', 'combinatorial', 'analysis', 'generates', 'an', 'optimal', 'rank', 'ordering', 'of', 'proteinexpression', 'coherence', 'the', 'outcome', 'of', 'the', 'analysis', 'corresponds', 'to', 'all', 'the', 'single', 'observations', 'scattered', 'over', 'several', 'publications', 'and', 'integrates', 'them', 'in', 'one', 'context', 'this', 'means', 'all', 'these', 'scattered', 'observations', 'can', 'also', 'be', 'deduced', 'from', 'one', 'tma', 'experiment', 'a', 'comprehensive', 'statistical', 'metaanalysis', 'of', 'the', 'tma', 'data', 'suggests', 'the', 'existence', 'of', 'a', 'superposition', 'of', 'three', 'basic', 'coherence', 'situations', 'and', 'offers', 'the', 'opportunity', 'to', 'analyze', 'these', 'data', 'properties', 'with', 'additional', 'realworld', 'data', 'and', 'synthetic', 'data', 'in', 'more', 'detail', 'the', 'presented', 'algorithm', 'gives', 'molecular', 'pathologists', 'a', 'tool', 'to', 'extract', 'dependency', 'information', 'from', 'tma', 'data', 'beyond', 'this', 'practical', 'benefit', 'some', 'light', 'was', 'shed', 'on', 'how', 'dependency', 'aspects', 'might', 'be', 'imprinted', 'into', 'expression', 'data', 'this', 'will', 'certainly', 'foster', 'the', 'refinement', 'of', 'algorithms', 'to', 'reconstruct', 'dependency', 'networks', 'the', 'implementation', 'of', 'the', 'algorithm', 'is', 'at', 'the', 'moment', 'not', 'enduser', 'suitable', 'but', 'available', 'on', 'request']] | [-0.06628912916882163, 0.04698315858743552, -0.12241700850880129, 0.0978515459607801, -0.11471697000844644, -0.14818109744427732, 0.06625744712594281, 0.364231113773854, -0.2606889492839372, -0.32491220747291, 0.10438195311469806, -0.30478277986013996, -0.16651341906143532, 0.2118675713137459, -0.058831946653448014, 0.007980088826544322, 0.08865891168698495, 0.016147355020865218, -0.018210234799898403, -0.25130493161666584, 0.2929049216297814, 0.07523485375314604, 0.3286339798054372, 0.055926587581199665, 0.07662943939874058, -0.007601271890799591, -0.09333038351730469, -0.0014249984302324382, -0.13168389926997923, 0.150028872830025, 0.29526463940246794, 0.20854277253544012, 0.263090446472697, -0.4517484249235475, -0.1958094458047034, 0.07643751453985152, 0.13019373610883894, 0.1296193204040581, -0.02627321269123313, -0.27110072726144635, 0.03332050549091068, -0.1108539188498131, -0.08155052376374718, -0.08554873936121073, -0.016838501417259268, 0.006278655351346163, -0.2578653380565131, 0.05022934259715896, 0.027202895702748895, 0.09556696801863118, -0.05969492454310075, -0.12359634862038586, 0.013256085050882997, 0.1502653891546833, 0.04810675133485559, 0.008246037181365351, 0.14084194022763505, -0.09054327578327333, -0.11468033174189633, 0.37470858332185536, -0.011815178002401143, -0.15632845637576967, 0.18708825560652648, -0.12536987470615119, -0.15827310344581183, 0.1417008913810644, 0.19463727811300685, 0.0686035783485109, -0.20825215261352542, -0.00866329326142162, -0.03600594808314909, 0.21441829763715253, 0.05717854373472297, 0.022351824010338212, 0.18565226854767347, 0.2013609017868769, 0.01225274838987332, 0.13981910285509122, -0.10187896039141686, -0.05746879685576824, -0.24341493915650514, -0.10805680600705227, -0.14645074476720765, 0.030522618868912783, -0.0826198287085804, -0.13545301104107588, 0.385083991662755, 0.17599098632793425, 0.17918115380901395, -0.0033547961404945714, 0.31148697058253483, 0.017421975426089583, 0.08985707536520951, 0.0016923831426538527, 0.2139590107234501, 0.09147747969146136, 0.13026205092443857, -0.1969592159510688, 0.10868482410016285, -0.020291877129560893] |
1,803.02288 | A New Scaling Law for Activity Detection in Massive MIMO Systems | In this paper, we study the problem of \textit{activity detection} (AD) in a
massive MIMO setup, where the Base Station (BS) has $M \gg 1$ antennas. We
consider a block fading channel model where the $M$-dim channel vector of each
user remains almost constant over a \textit{coherence block} (CB) containing
$D_c$ signal dimensions. We study a setting in which the number of potential
users $K_c$ assigned to a specific CB is much larger than the dimension of the
CB $D_c$ ($K_c \gg D_c$) but at each time slot only $A_c \ll K_c$ of them are
active. Most of the previous results, based on compressed sensing, require that
$A_c\le D_c$, which is a bottleneck in massive deployment scenarios such as
Internet-of-Things (IoT) and Device-to-Device (D2D) communication. In this
paper, we show that one can overcome this fundamental limitation when the
number of BS antennas $M$ is sufficiently large. More specifically, we derive a
\textit{scaling law} on the parameters $(M, D_c, K_c, A_c)$ and also
\textit{Signal-to-Noise Ratio} (SNR) under which our proposed AD scheme
succeeds. Our analysis indicates that with a CB of dimension $D_c$, and a
sufficient number of BS antennas $M$ with $A_c/M=o(1)$, one can identify the
activity of $A_c=O(D_c^2/\log^2(\frac{K_c}{A_c}))$ active users, which is much
larger than the previous bound $A_c=O(D_c)$ obtained via traditional compressed
sensing techniques. In particular, in our proposed scheme one needs to pay only
a poly-logarithmic penalty $O(\log^2(\frac{K_c}{A_c}))$ for increasing the
number of potential users $K_c$, which makes it ideally suited for AD in IoT
setups. We propose low-complexity algorithms for AD and provide numerical
simulations to illustrate our results. We also compare the performance of our
proposed AD algorithms with that of other competitive algorithms in the
literature.
| cs.IT math.IT | in this paper we study the problem of textitactivity detection ad in a massive mimo setup where the base station bs has m gg 1 antennas we consider a block fading channel model where the mdim channel vector of each user remains almost constant over a textitcoherence block cb containing d_c signal dimensions we study a setting in which the number of potential users k_c assigned to a specific cb is much larger than the dimension of the cb d_c k_c gg d_c but at each time slot only a_c ll k_c of them are active most of the previous results based on compressed sensing require that a_cle d_c which is a bottleneck in massive deployment scenarios such as internetofthings iot and devicetodevice d2d communication in this paper we show that one can overcome this fundamental limitation when the number of bs antennas m is sufficiently large more specifically we derive a textitscaling law on the parameters m d_c k_c a_c and also textitsignaltonoise ratio snr under which our proposed ad scheme succeeds our analysis indicates that with a cb of dimension d_c and a sufficient number of bs antennas m with a_cmo1 one can identify the activity of a_cod_c2log2frack_ca_c active users which is much larger than the previous bound a_cod_c obtained via traditional compressed sensing techniques in particular in our proposed scheme one needs to pay only a polylogarithmic penalty olog2frack_ca_c for increasing the number of potential users k_c which makes it ideally suited for ad in iot setups we propose lowcomplexity algorithms for ad and provide numerical simulations to illustrate our results we also compare the performance of our proposed ad algorithms with that of other competitive algorithms in the literature | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'textitactivity', 'detection', 'ad', 'in', 'a', 'massive', 'mimo', 'setup', 'where', 'the', 'base', 'station', 'bs', 'has', 'm', 'gg', '1', 'antennas', 'we', 'consider', 'a', 'block', 'fading', 'channel', 'model', 'where', 'the', 'mdim', 'channel', 'vector', 'of', 'each', 'user', 'remains', 'almost', 'constant', 'over', 'a', 'textitcoherence', 'block', 'cb', 'containing', 'd_c', 'signal', 'dimensions', 'we', 'study', 'a', 'setting', 'in', 'which', 'the', 'number', 'of', 'potential', 'users', 'k_c', 'assigned', 'to', 'a', 'specific', 'cb', 'is', 'much', 'larger', 'than', 'the', 'dimension', 'of', 'the', 'cb', 'd_c', 'k_c', 'gg', 'd_c', 'but', 'at', 'each', 'time', 'slot', 'only', 'a_c', 'll', 'k_c', 'of', 'them', 'are', 'active', 'most', 'of', 'the', 'previous', 'results', 'based', 'on', 'compressed', 'sensing', 'require', 'that', 'a_cle', 'd_c', 'which', 'is', 'a', 'bottleneck', 'in', 'massive', 'deployment', 'scenarios', 'such', 'as', 'internetofthings', 'iot', 'and', 'devicetodevice', 'd2d', 'communication', 'in', 'this', 'paper', 'we', 'show', 'that', 'one', 'can', 'overcome', 'this', 'fundamental', 'limitation', 'when', 'the', 'number', 'of', 'bs', 'antennas', 'm', 'is', 'sufficiently', 'large', 'more', 'specifically', 'we', 'derive', 'a', 'textitscaling', 'law', 'on', 'the', 'parameters', 'm', 'd_c', 'k_c', 'a_c', 'and', 'also', 'textitsignaltonoise', 'ratio', 'snr', 'under', 'which', 'our', 'proposed', 'ad', 'scheme', 'succeeds', 'our', 'analysis', 'indicates', 'that', 'with', 'a', 'cb', 'of', 'dimension', 'd_c', 'and', 'a', 'sufficient', 'number', 'of', 'bs', 'antennas', 'm', 'with', 'a_cmo1', 'one', 'can', 'identify', 'the', 'activity', 'of', 'a_cod_c2log2frack_ca_c', 'active', 'users', 'which', 'is', 'much', 'larger', 'than', 'the', 'previous', 'bound', 'a_cod_c', 'obtained', 'via', 'traditional', 'compressed', 'sensing', 'techniques', 'in', 'particular', 'in', 'our', 'proposed', 'scheme', 'one', 'needs', 'to', 'pay', 'only', 'a', 'polylogarithmic', 'penalty', 'olog2frack_ca_c', 'for', 'increasing', 'the', 'number', 'of', 'potential', 'users', 'k_c', 'which', 'makes', 'it', 'ideally', 'suited', 'for', 'ad', 'in', 'iot', 'setups', 'we', 'propose', 'lowcomplexity', 'algorithms', 'for', 'ad', 'and', 'provide', 'numerical', 'simulations', 'to', 'illustrate', 'our', 'results', 'we', 'also', 'compare', 'the', 'performance', 'of', 'our', 'proposed', 'ad', 'algorithms', 'with', 'that', 'of', 'other', 'competitive', 'algorithms', 'in', 'the', 'literature']] | [-0.20159766568341733, 0.07520440778606673, -0.00790941595766068, -0.0010129047628240591, -0.076252052804326, -0.251350726046851, 0.12055129277346534, 0.3462123022972178, -0.21939812007446835, -0.27291689228511207, 0.09038672229762862, -0.24902142559851173, -0.17854139416471776, 0.1630659629692779, -0.06894728617511527, 0.02559322012753233, 0.054094605280399104, 0.09770356843948626, -0.018094003018685176, -0.2599645100959261, 0.2878969624268068, 0.06904629011889987, 0.2943810362124095, 0.026924540958984205, 0.027693704674768185, -0.0023772785606637706, -0.00424844914466061, -0.00492979445066439, -0.14558259764633968, 0.08879635249813475, 0.29977425051186857, 0.14032479581409507, 0.28973153264713847, -0.38722344838511064, -0.2444413542665922, 0.1242097711792202, 0.2176243402760639, 0.057871746865906716, -0.03205512928034827, -0.23560487841728422, 0.1777203775870947, -0.20922703690823494, -0.0626695576050815, 0.010236259141977686, 0.029082307493463702, -0.007496002135308881, -0.3526324681278291, 0.025742204484052237, 0.016115646669981037, 0.0068925769751497215, -0.01884412688048502, -0.15917761868501532, 0.04480625619860298, 0.10780420434165382, 0.059576665149002346, 0.01890013001376532, 0.1177166015229249, -0.10849999235586066, -0.08502115504212854, 0.37436995604653317, -0.0188885693185339, -0.20402104604945104, 0.19395801914221927, -0.13042643066091178, -0.10899278029364391, 0.12261340553667498, 0.20422813602906725, 0.1359937670816173, -0.10451640284147129, 0.07569849329242605, -0.056301218803366984, 0.18969898263033289, 0.052096260018157266, 0.07697717370006535, 0.1111546059225747, 0.2184587412787411, 0.1393423394315339, 0.09388858391448726, -0.11972653715504608, -0.0827555400055976, -0.2496168361908763, -0.15155348090228055, -0.2335391001751218, 0.04598283652347057, -0.14214284816755995, -0.07476112929709854, 0.3383966973621556, 0.17005140756272386, 0.21616087337177464, 0.09967935429996451, 0.365537191598411, 0.0837888329493368, 0.08945529721932227, 0.14205964967390916, 0.21221942386623296, 0.07192037850414423, 0.12651041637279517, -0.1814423747760937, 0.025091640761693138, 0.0167602748010158] |
1,803.02289 | Testing the complexity of a valued CSP language | A Valued Constraint Satisfaction Problem (VCSP) provides a common framework
that can express a wide range of discrete optimization problems. A VCSP
instance is given by a finite set of variables, a finite domain of labels, and
an objective function to be minimized. This function is represented as a sum of
terms where each term depends on a subset of the variables. To obtain different
classes of optimization problems, one can restrict all terms to come from a
fixed set $\Gamma$ of cost functions, called a language.
Recent breakthrough results have established a complete complexity
classification of such classes with respect to language $\Gamma$: if all cost
functions in $\Gamma$ satisfy a certain algebraic condition then all
$\Gamma$-instances can be solved in polynomial time, otherwise the problem is
NP-hard. Unfortunately, testing this condition for a given language $\Gamma$ is
known to be NP-hard. We thus study exponential algorithms for this
meta-problem. We show that the tractability condition of a finite-valued
language $\Gamma$ can be tested in $O(\sqrt[3]{3}^{\,|D|}\cdot
poly(size(\Gamma)))$ time, where $D$ is the domain of $\Gamma$ and
$poly(\cdot)$ is some fixed polynomial. We also obtain a matching lower bound
under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove
that for any constant $\delta<1$ there is no $O(\sqrt[3]{3}^{\,\delta|D|})$
algorithm, assuming that SETH holds.
| cs.CC | a valued constraint satisfaction problem vcsp provides a common framework that can express a wide range of discrete optimization problems a vcsp instance is given by a finite set of variables a finite domain of labels and an objective function to be minimized this function is represented as a sum of terms where each term depends on a subset of the variables to obtain different classes of optimization problems one can restrict all terms to come from a fixed set gamma of cost functions called a language recent breakthrough results have established a complete complexity classification of such classes with respect to language gamma if all cost functions in gamma satisfy a certain algebraic condition then all gammainstances can be solved in polynomial time otherwise the problem is nphard unfortunately testing this condition for a given language gamma is known to be nphard we thus study exponential algorithms for this metaproblem we show that the tractability condition of a finitevalued language gamma can be tested in osqrt33dcdot polysizegamma time where d is the domain of gamma and polycdot is some fixed polynomial we also obtain a matching lower bound under the strong exponential time hypothesis seth more precisely we prove that for any constant delta1 there is no osqrt33deltad algorithm assuming that seth holds | [['a', 'valued', 'constraint', 'satisfaction', 'problem', 'vcsp', 'provides', 'a', 'common', 'framework', 'that', 'can', 'express', 'a', 'wide', 'range', 'of', 'discrete', 'optimization', 'problems', 'a', 'vcsp', 'instance', 'is', 'given', 'by', 'a', 'finite', 'set', 'of', 'variables', 'a', 'finite', 'domain', 'of', 'labels', 'and', 'an', 'objective', 'function', 'to', 'be', 'minimized', 'this', 'function', 'is', 'represented', 'as', 'a', 'sum', 'of', 'terms', 'where', 'each', 'term', 'depends', 'on', 'a', 'subset', 'of', 'the', 'variables', 'to', 'obtain', 'different', 'classes', 'of', 'optimization', 'problems', 'one', 'can', 'restrict', 'all', 'terms', 'to', 'come', 'from', 'a', 'fixed', 'set', 'gamma', 'of', 'cost', 'functions', 'called', 'a', 'language', 'recent', 'breakthrough', 'results', 'have', 'established', 'a', 'complete', 'complexity', 'classification', 'of', 'such', 'classes', 'with', 'respect', 'to', 'language', 'gamma', 'if', 'all', 'cost', 'functions', 'in', 'gamma', 'satisfy', 'a', 'certain', 'algebraic', 'condition', 'then', 'all', 'gammainstances', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'otherwise', 'the', 'problem', 'is', 'nphard', 'unfortunately', 'testing', 'this', 'condition', 'for', 'a', 'given', 'language', 'gamma', 'is', 'known', 'to', 'be', 'nphard', 'we', 'thus', 'study', 'exponential', 'algorithms', 'for', 'this', 'metaproblem', 'we', 'show', 'that', 'the', 'tractability', 'condition', 'of', 'a', 'finitevalued', 'language', 'gamma', 'can', 'be', 'tested', 'in', 'osqrt33dcdot', 'polysizegamma', 'time', 'where', 'd', 'is', 'the', 'domain', 'of', 'gamma', 'and', 'polycdot', 'is', 'some', 'fixed', 'polynomial', 'we', 'also', 'obtain', 'a', 'matching', 'lower', 'bound', 'under', 'the', 'strong', 'exponential', 'time', 'hypothesis', 'seth', 'more', 'precisely', 'we', 'prove', 'that', 'for', 'any', 'constant', 'delta1', 'there', 'is', 'no', 'osqrt33deltad', 'algorithm', 'assuming', 'that', 'seth', 'holds']] | [-0.14632175198887612, 0.07390080975056972, -0.09179266293546515, 0.09903599225145066, -0.12954668528244398, -0.17719481627091443, 0.0788772087455081, 0.35938877270124747, -0.32483339648355136, -0.28804390475462505, 0.10322908592648786, -0.20897058973926605, -0.12890447134321387, 0.21640331197293858, -0.08808565851407901, 0.06769234338400966, 0.08487873761045733, 0.07360553989157918, -0.07162636276234262, -0.287753246948524, 0.2962677175631417, -0.04072658773222002, 0.19749240302725843, 0.08323609201169604, 0.11102304012463406, 0.0027469740890893354, 0.02400101695887067, 0.06831998313647922, -0.11892634193353359, 0.06558822565762165, 0.3002608509613959, 0.22038977194920575, 0.32320670745197383, -0.36525435829936176, -0.19288540791283454, 0.22780491440706221, 0.10389299303043688, 0.03981362232987426, -0.00199235079267773, -0.2186994083831755, 0.14786531947080814, -0.1188434319243138, -0.0826690856380718, -0.02992355512259038, 0.0445381704490614, 0.013690849570067306, -0.35241040635328186, 0.016404015694841807, 0.08819367390924744, 0.028448985172123714, -0.05384134967548496, -0.1000771615047088, 0.05430464958549259, 0.08863851001584216, 0.034895257418585325, 0.11023716266995572, 0.0506342922328441, -0.11230697725124159, -0.13578560152068805, 0.40641382657009306, -0.045101229867866736, -0.2751243465031947, 0.1543994956654296, -0.10251107888572523, -0.19514737384723563, 0.12406454065761141, 0.15661949178195028, 0.15004886633328843, -0.15008508017438166, 0.1766536488107508, -0.13148141804075483, 0.1803342032215099, 0.09859720839891564, 0.010371028242352013, 0.12190641043707728, 0.14376720741979385, 0.13719118143761594, 0.1770350431330484, 0.03024469313610559, -0.02110121107903091, -0.330757994474353, -0.13148343763743087, -0.20970996081412427, 0.04379435903147647, -0.12161906309741656, -0.18318586299222622, 0.35834079849172795, 0.06774486965860761, 0.18593329992412666, 0.1668204419141074, 0.2406353376377998, 0.18661994120380707, 0.027270775403087717, 0.09985631276733904, 0.1239263895904906, 0.0840911032326612, 0.010389476326075895, -0.15668278384806686, 0.1188983227706706, 0.0728241952690942] |
1,803.0229 | Bouligand-Landweber iteration for a non-smooth ill-posed problem | This work is concerned with the iterative regularization of a non-smooth
nonlinear ill-posed problem where the forward mapping is merely directionally
but not G\^ateaux differentiable. Using a Bouligand subderivative of the
forward mapping, a modified Landweber method can be applied; however, the
standard analysis is not applicable since the Bouligand subderivative mapping
is not continuous unless the forward mapping is G\^ateaux differentiable. We
therefore provide a novel convergence analysis of the modified Landweber method
that is based on the concept of asymptotic stability and merely requires a
generalized tangential cone condition. These conditions are verified for an
inverse source problem for an elliptic PDE with a non-smooth Lipschitz
continuous nonlinearity, showing that the corresponding Bouligand--Landweber
iteration converges strongly for exact data as well as in the limit of
vanishing data if the iteration is stopped according to the discrepancy
principle. This is illustrated
| math.NA math.OC | this work is concerned with the iterative regularization of a nonsmooth nonlinear illposed problem where the forward mapping is merely directionally but not gateaux differentiable using a bouligand subderivative of the forward mapping a modified landweber method can be applied however the standard analysis is not applicable since the bouligand subderivative mapping is not continuous unless the forward mapping is gateaux differentiable we therefore provide a novel convergence analysis of the modified landweber method that is based on the concept of asymptotic stability and merely requires a generalized tangential cone condition these conditions are verified for an inverse source problem for an elliptic pde with a nonsmooth lipschitz continuous nonlinearity showing that the corresponding bouligandlandweber iteration converges strongly for exact data as well as in the limit of vanishing data if the iteration is stopped according to the discrepancy principle this is illustrated | [['this', 'work', 'is', 'concerned', 'with', 'the', 'iterative', 'regularization', 'of', 'a', 'nonsmooth', 'nonlinear', 'illposed', 'problem', 'where', 'the', 'forward', 'mapping', 'is', 'merely', 'directionally', 'but', 'not', 'gateaux', 'differentiable', 'using', 'a', 'bouligand', 'subderivative', 'of', 'the', 'forward', 'mapping', 'a', 'modified', 'landweber', 'method', 'can', 'be', 'applied', 'however', 'the', 'standard', 'analysis', 'is', 'not', 'applicable', 'since', 'the', 'bouligand', 'subderivative', 'mapping', 'is', 'not', 'continuous', 'unless', 'the', 'forward', 'mapping', 'is', 'gateaux', 'differentiable', 'we', 'therefore', 'provide', 'a', 'novel', 'convergence', 'analysis', 'of', 'the', 'modified', 'landweber', 'method', 'that', 'is', 'based', 'on', 'the', 'concept', 'of', 'asymptotic', 'stability', 'and', 'merely', 'requires', 'a', 'generalized', 'tangential', 'cone', 'condition', 'these', 'conditions', 'are', 'verified', 'for', 'an', 'inverse', 'source', 'problem', 'for', 'an', 'elliptic', 'pde', 'with', 'a', 'nonsmooth', 'lipschitz', 'continuous', 'nonlinearity', 'showing', 'that', 'the', 'corresponding', 'bouligandlandweber', 'iteration', 'converges', 'strongly', 'for', 'exact', 'data', 'as', 'well', 'as', 'in', 'the', 'limit', 'of', 'vanishing', 'data', 'if', 'the', 'iteration', 'is', 'stopped', 'according', 'to', 'the', 'discrepancy', 'principle', 'this', 'is', 'illustrated']] | [-0.07391283391076336, 0.0125253837611805, -0.1332755954477044, 0.10210749179675756, -0.14338843879112842, -0.17471544955476698, -0.00270824544262928, 0.3684653954606661, -0.34526724693312927, -0.1853170454580809, 0.18522036267677322, -0.23112915242648302, -0.15253309265408718, 0.22022202694263887, -0.11476778171130154, 0.10833940364446648, 0.06944474302770072, 0.01891534209344044, -0.10362575157597975, -0.21660613012828037, 0.3324022069901333, 0.018884217851093486, 0.2477490082448742, 0.0561872627389368, 0.16454839877764577, 0.006913451595940221, -0.0178011071041856, 0.04222939420661776, -0.07304499267887826, 0.09949471873500135, 0.2586121280775176, 0.11733061392729262, 0.3441937630864936, -0.36782631890612166, -0.200839339394752, 0.1213640301737567, 0.13386334446390016, 0.042202454745690794, -0.04661375398724668, -0.254784924194584, 0.09635495619428619, -0.08290065041887508, -0.14283557467057673, -0.08525321536458058, -0.042500423046130636, 0.05196830735158201, -0.32931424466676645, 0.08990220895732268, 0.10269826222096347, 0.03602066157307004, -0.06757176703032317, -0.04470069934023728, -0.025092605886731664, 0.043536831060765495, 0.05275050910438975, 0.09172558701682416, 0.09023763805719644, -0.06879341472137038, -0.0593661545434783, 0.35665825779982646, -0.07515145967137331, -0.2895286641883808, 0.14975817518105441, -0.08640792788806516, -0.13623316518914833, 0.14513813427150984, 0.12252002933536472, 0.19752509755567765, -0.1788866071712593, 0.1401702201393151, -0.060542756504654675, 0.17119784096688767, 0.052482309072396496, -0.06082409022795692, 0.09185366463211274, 0.16124118092259995, 0.18081982261960355, 0.12440093403639482, -0.03770054962558173, -0.07852365405128246, -0.3559246001056802, -0.1438605956967697, -0.2293252726397018, 0.03381307235569283, -0.07331452876299498, -0.1795655381603455, 0.34137503778837414, 0.10597850919806097, 0.19226741595980776, 0.1159868930863269, 0.2941835835136631, 0.2231861769703781, 0.014521187001431006, 0.06723699081872761, 0.24292354970435862, 0.12398622900044257, 0.11215224188201549, -0.19679022211627378, 0.09681305569157161, 0.15058319240441204] |
1,803.02291 | Synthesizing Neural Network Controllers with Probabilistic Model based
Reinforcement Learning | We present an algorithm for rapidly learning controllers for robotics
systems. The algorithm follows the model-based reinforcement learning paradigm,
and improves upon existing algorithms; namely Probabilistic learning in Control
(PILCO) and a sample-based version of PILCO with neural network dynamics
(Deep-PILCO). We propose training a neural network dynamics model using
variational dropout with truncated Log-Normal noise. This allows us to obtain a
dynamics model with calibrated uncertainty, which can be used to simulate
controller executions via rollouts. We also describe set of techniques,
inspired by viewing PILCO as a recurrent neural network model, that are crucial
to improve the convergence of the method. We test our method on a variety of
benchmark tasks, demonstrating data-efficiency that is competitive with PILCO,
while being able to optimize complex neural network controllers. Finally, we
assess the performance of the algorithm for learning motor controllers for a
six legged autonomous underwater vehicle. This demonstrates the potential of
the algorithm for scaling up the dimensionality and dataset sizes, in more
complex control tasks.
| cs.RO cs.AI | we present an algorithm for rapidly learning controllers for robotics systems the algorithm follows the modelbased reinforcement learning paradigm and improves upon existing algorithms namely probabilistic learning in control pilco and a samplebased version of pilco with neural network dynamics deeppilco we propose training a neural network dynamics model using variational dropout with truncated lognormal noise this allows us to obtain a dynamics model with calibrated uncertainty which can be used to simulate controller executions via rollouts we also describe set of techniques inspired by viewing pilco as a recurrent neural network model that are crucial to improve the convergence of the method we test our method on a variety of benchmark tasks demonstrating dataefficiency that is competitive with pilco while being able to optimize complex neural network controllers finally we assess the performance of the algorithm for learning motor controllers for a six legged autonomous underwater vehicle this demonstrates the potential of the algorithm for scaling up the dimensionality and dataset sizes in more complex control tasks | [['we', 'present', 'an', 'algorithm', 'for', 'rapidly', 'learning', 'controllers', 'for', 'robotics', 'systems', 'the', 'algorithm', 'follows', 'the', 'modelbased', 'reinforcement', 'learning', 'paradigm', 'and', 'improves', 'upon', 'existing', 'algorithms', 'namely', 'probabilistic', 'learning', 'in', 'control', 'pilco', 'and', 'a', 'samplebased', 'version', 'of', 'pilco', 'with', 'neural', 'network', 'dynamics', 'deeppilco', 'we', 'propose', 'training', 'a', 'neural', 'network', 'dynamics', 'model', 'using', 'variational', 'dropout', 'with', 'truncated', 'lognormal', 'noise', 'this', 'allows', 'us', 'to', 'obtain', 'a', 'dynamics', 'model', 'with', 'calibrated', 'uncertainty', 'which', 'can', 'be', 'used', 'to', 'simulate', 'controller', 'executions', 'via', 'rollouts', 'we', 'also', 'describe', 'set', 'of', 'techniques', 'inspired', 'by', 'viewing', 'pilco', 'as', 'a', 'recurrent', 'neural', 'network', 'model', 'that', 'are', 'crucial', 'to', 'improve', 'the', 'convergence', 'of', 'the', 'method', 'we', 'test', 'our', 'method', 'on', 'a', 'variety', 'of', 'benchmark', 'tasks', 'demonstrating', 'dataefficiency', 'that', 'is', 'competitive', 'with', 'pilco', 'while', 'being', 'able', 'to', 'optimize', 'complex', 'neural', 'network', 'controllers', 'finally', 'we', 'assess', 'the', 'performance', 'of', 'the', 'algorithm', 'for', 'learning', 'motor', 'controllers', 'for', 'a', 'six', 'legged', 'autonomous', 'underwater', 'vehicle', 'this', 'demonstrates', 'the', 'potential', 'of', 'the', 'algorithm', 'for', 'scaling', 'up', 'the', 'dimensionality', 'and', 'dataset', 'sizes', 'in', 'more', 'complex', 'control', 'tasks']] | [-0.04343413164724824, -0.021826804924284352, -0.098966058872049, 0.04810644752237232, -0.08835710721887916, -0.21266389064334645, 0.04947234640695422, 0.4612933803505883, -0.2778363986509646, -0.3412853855818153, 0.06634213059198134, -0.1878913366529445, -0.2446697084107687, 0.25431526076009575, -0.14645595806873887, 0.1523295880293942, 0.11180190538114751, 0.007225200402812508, -0.02396362761459397, -0.2700057506037062, 0.27366022764799924, 0.0354464584822114, 0.3038333196633546, -0.043405943003644844, 0.17960347808774807, -0.02409470895539501, 0.02333964449374429, 0.00588065369645814, -0.06959502038890622, 0.17249388035671218, 0.27047157979467157, 0.21457540925625646, 0.3447904250735116, -0.40554667858568627, -0.2215586412965716, 0.12127795423698907, 0.15173812747882778, 0.11936938755624107, 0.0006079114418481003, -0.336633143344236, 0.0905066205908037, -0.2152787176111412, -0.03157519050009415, -0.18221752597771942, -0.05280134913756953, 0.03171826217394646, -0.32641826410294084, -0.0032493384224906406, 0.051032233249931454, 0.040992319924076516, -0.06425141176371975, -0.07868273672926614, 0.05409349513053336, 0.1478599698957569, -0.004029594643409559, 0.05891267933553743, 0.18208320055736932, -0.15725205790162264, -0.20256257213339834, 0.3406201432107719, -0.038289762202100994, -0.21774413951335916, 0.19343631923154087, 0.0086718597839737, -0.1680180920890259, 0.08268801126668152, 0.29175640553135623, 0.11404950859570251, -0.1818688590913275, 0.012928392578119936, -0.021328614612004, 0.17736030394883415, -0.03489960277659406, -0.07127790036750678, 0.11142064799543493, 0.3390215794628341, 0.09832443451107352, 0.15356811531052594, -0.09841980894575798, -0.12079142729129955, -0.18975662617403233, -0.0993322329930292, -0.15276212217899676, -0.019482408689256915, -0.12110497452526751, -0.13558698810558922, 0.3938528856563711, 0.24476170604546627, 0.18034878624937759, 0.18928126603139084, 0.36141261675333725, 0.05179690676373583, 0.09102399843538593, 0.13582521924347488, 0.19048283635924465, 0.0558759058549621, 0.1466617950999518, -0.22590596931303356, 0.09461976604502716, 0.06546519838223334] |
1,803.02292 | Weak Decays of Heavy Baryons in Light-Front Approach | In this work, we perform a analysis of semi-leptonic and nonleptonic weak
decays of heavy baryons: $\Lambda_{b},\Xi_{b},\Omega_{b}$ and
$\Lambda_{c},\Xi_{c},\Omega_{c}$. For nonleptonic decay modes, we study only
the factorizable channels induced by the external W-emission. The two spectator
quarks in baryonic transitions are treated as a diquark and form factors are
calculated in the light-front approach. Using the results for form factors, we
also calculate some corresponding semi-leptonic and nonleptonic decay widths.
We find that our results are comparable with the available experimental data
and other theoretical predictions. Decay branching fractions for many channels
are found to reach the level $10^{-3}\sim10^{-2}$, which are promising to be
discovered in the future measurements at BESIII, LHCb and BelleII. The SU(3)
symmetry in semi-leptonic decays is examined and sources of symmetry breaking
are discussed.
| hep-ph hep-ex | in this work we perform a analysis of semileptonic and nonleptonic weak decays of heavy baryons lambda_bxi_bomega_b and lambda_cxi_comega_c for nonleptonic decay modes we study only the factorizable channels induced by the external wemission the two spectator quarks in baryonic transitions are treated as a diquark and form factors are calculated in the lightfront approach using the results for form factors we also calculate some corresponding semileptonic and nonleptonic decay widths we find that our results are comparable with the available experimental data and other theoretical predictions decay branching fractions for many channels are found to reach the level 103sim102 which are promising to be discovered in the future measurements at besiii lhcb and belleii the su3 symmetry in semileptonic decays is examined and sources of symmetry breaking are discussed | [['in', 'this', 'work', 'we', 'perform', 'a', 'analysis', 'of', 'semileptonic', 'and', 'nonleptonic', 'weak', 'decays', 'of', 'heavy', 'baryons', 'lambda_bxi_bomega_b', 'and', 'lambda_cxi_comega_c', 'for', 'nonleptonic', 'decay', 'modes', 'we', 'study', 'only', 'the', 'factorizable', 'channels', 'induced', 'by', 'the', 'external', 'wemission', 'the', 'two', 'spectator', 'quarks', 'in', 'baryonic', 'transitions', 'are', 'treated', 'as', 'a', 'diquark', 'and', 'form', 'factors', 'are', 'calculated', 'in', 'the', 'lightfront', 'approach', 'using', 'the', 'results', 'for', 'form', 'factors', 'we', 'also', 'calculate', 'some', 'corresponding', 'semileptonic', 'and', 'nonleptonic', 'decay', 'widths', 'we', 'find', 'that', 'our', 'results', 'are', 'comparable', 'with', 'the', 'available', 'experimental', 'data', 'and', 'other', 'theoretical', 'predictions', 'decay', 'branching', 'fractions', 'for', 'many', 'channels', 'are', 'found', 'to', 'reach', 'the', 'level', '103sim102', 'which', 'are', 'promising', 'to', 'be', 'discovered', 'in', 'the', 'future', 'measurements', 'at', 'besiii', 'lhcb', 'and', 'belleii', 'the', 'su3', 'symmetry', 'in', 'semileptonic', 'decays', 'is', 'examined', 'and', 'sources', 'of', 'symmetry', 'breaking', 'are', 'discussed']] | [-0.0762862046528791, 0.25157769496174986, -0.03225076762138037, 0.13567627771110383, -0.06303389512339798, -0.1259238962249053, 0.05805890510907382, 0.3496205038794382, -0.18246681028683706, -0.18825532036547468, 0.01216857044821913, -0.3807503460781781, -0.027216231131442184, 0.13895505157072008, 0.12550330494244502, 0.10805049856875355, 0.10751636157281638, -0.00486230933085436, -0.07541817324566032, -0.2241589608052232, 0.27098358855179444, -0.0359001105108599, 0.22730372767660798, 0.13565791235442867, -0.07659311708719213, -0.055581063226481355, -0.07070494699841878, -0.034414182558259745, -0.15296571482323323, 0.04875768085311013, 0.22157757784841275, 0.10936345652068459, 0.12459219904528476, -0.39924291003583456, -0.0850227093892392, 0.10153479100109672, 0.19380191482207554, 0.14675738913553407, -0.0644506024138078, -0.3856659876476005, 0.1324851881491761, -0.16878119108861123, -0.07687217087712227, -0.15942613427769245, 0.008017697785871001, -0.03854564139729468, -0.3526929959244146, 0.10191729349633276, -0.07655792692162859, 0.03160309212971625, -0.033572717974930416, -0.24526587793398208, 0.012380008629750548, 0.0805368679428957, 0.1569168106386966, 0.05054227886359413, 0.1674518832390556, -0.163083035167028, -0.17296097013278036, 0.41983515525779386, -0.0605955559624667, -0.19658437331654424, 0.13714870055550782, -0.2048286501222884, -0.19418108885682475, 0.11287528063779272, 0.22820765501269558, 0.050432168966613886, -0.19736803402229558, 0.07764871048559545, -0.01749799935161833, 0.0975382796023041, 0.06623165167530808, 0.13245937531799312, 0.1610529710003358, 0.1676533609027351, -0.10655800489329285, 0.09064355984240345, -0.04959800879023676, -0.06313400240395013, -0.3951381157201854, -0.11423962916326379, -0.07964676478511001, 0.04982494893685482, -0.009087292333688095, -0.05666461414941697, 0.3690056252718617, 0.07125215938564126, 0.27621668005934147, 0.027157034104374627, 0.3010575214985714, 0.10427131594294374, 0.06951767260458057, 0.08632358375892747, 0.3421398452567908, 0.19855415197199314, 0.080113265062059, -0.29735055094306156, 0.017151409383371882, 0.010752148603595147] |
1,803.02293 | Pinning Transition of Bose-Einstein Condensates in Optical Ring
Resonators | We experimentally investigate the dynamic instability of Bose-Einstein
condensates in an optical ring resonator that is asymmetrically pumped in both
directions. We find that, beyond a critical resonator-pump detuning, the system
becomes stable regardless of the pump strength. Phase diagrams and quenching
curves are presented and described by numerical simulations. We discuss a
physical explanation based on a geometric interpretation of the underlying
nonlinear equations of motion.
| physics.atom-ph cond-mat.quant-gas physics.optics | we experimentally investigate the dynamic instability of boseeinstein condensates in an optical ring resonator that is asymmetrically pumped in both directions we find that beyond a critical resonatorpump detuning the system becomes stable regardless of the pump strength phase diagrams and quenching curves are presented and described by numerical simulations we discuss a physical explanation based on a geometric interpretation of the underlying nonlinear equations of motion | [['we', 'experimentally', 'investigate', 'the', 'dynamic', 'instability', 'of', 'boseeinstein', 'condensates', 'in', 'an', 'optical', 'ring', 'resonator', 'that', 'is', 'asymmetrically', 'pumped', 'in', 'both', 'directions', 'we', 'find', 'that', 'beyond', 'a', 'critical', 'resonatorpump', 'detuning', 'the', 'system', 'becomes', 'stable', 'regardless', 'of', 'the', 'pump', 'strength', 'phase', 'diagrams', 'and', 'quenching', 'curves', 'are', 'presented', 'and', 'described', 'by', 'numerical', 'simulations', 'we', 'discuss', 'a', 'physical', 'explanation', 'based', 'on', 'a', 'geometric', 'interpretation', 'of', 'the', 'underlying', 'nonlinear', 'equations', 'of', 'motion']] | [-0.23638168804234627, 0.1617991030165506, -0.09580351676171024, 0.03904666448061383, -0.028214249266029306, -0.14045817675210084, 0.033722384183695824, 0.41565685933738045, -0.23081258399355592, -0.21513441972660297, 0.06622687410774895, -0.22942853680896488, -0.16458418790363905, 0.22125536920926112, -0.011625090467560134, 0.024587211946985037, 0.0006001815764289913, -0.03424176699693569, -0.0449674090328203, -0.15515485944960153, 0.31659932338604424, 0.011675544873331532, 0.2851034368416577, 0.03119902932402593, 0.10612343094368099, -0.008067369372866146, 0.021996217610483818, 0.015027340106440313, -0.18585655806611723, 0.039660447192463005, 0.1779985296342409, 0.01681180790094941, 0.21818591908297755, -0.42117647197323316, -0.20756074394607407, 0.07480473218619767, 0.1886762338619905, 0.16687673208952852, -0.05587271614543473, -0.26548786240516964, 0.008105554420388105, -0.1264890413872446, -0.18709382745719544, -0.10488887250451653, 0.05034122723295833, 0.05704320396409568, -0.2376648710730175, 0.05948746605127147, 0.05094462325514266, 0.09649322527658308, -0.09518262416928668, -0.03127249050003505, -0.029948680633396813, 0.01599172754107382, -0.03907961624755637, -0.03146478982472962, 0.1894145574011473, -0.17817866346431951, -0.1132842934633972, 0.39558087492530997, -0.08151761889387148, -0.1472341469771257, 0.1594711375232278, -0.17663837319493972, -0.018562977039960748, 0.1274476464428572, 0.1545531992998087, 0.08905004004764398, -0.10449005762171565, 0.019055516796056923, -0.03372895592738959, 0.20122490812332905, 0.06422607566117111, 0.0524568790428792, 0.2699685234181357, 0.21014627045246237, -0.0023085834369394984, 0.19317868227936383, -0.0564788193688869, -0.15221222701030923, -0.3274059286411626, -0.10791337442104564, -0.1377566929793719, 0.02327834352653361, -0.09090581615270242, -0.14051881646314127, 0.4170768805920626, 0.18158319713830046, 0.20394991239608676, -0.04955767139185672, 0.3118749244533705, 0.17501607520336454, -0.0008608582852916284, 0.028126839237908523, 0.31734569046194805, 0.16705177424151, 0.08569026586712536, -0.3171104632783681, -0.0028180546360090375, 0.04679931557709069] |
1,803.02294 | A self-contained, brief and complete formulation of Voevodsky's
Univalence Axiom | In introductions to the subject for a general audience of mathematicians or
logicians, the univalence axiom is typically explained by handwaving. This
gives rise to several misconceptions, which cannot be properly addressed in the
absence of a precise definition. In this short set of notes we give a complete
formulation of the univalence axiom from scratch. The underlying idea of these
notes is that they should be as concise as possible (and not more). They are
not meant to be an Encyclopedia of Univalence.
| math.LO | in introductions to the subject for a general audience of mathematicians or logicians the univalence axiom is typically explained by handwaving this gives rise to several misconceptions which cannot be properly addressed in the absence of a precise definition in this short set of notes we give a complete formulation of the univalence axiom from scratch the underlying idea of these notes is that they should be as concise as possible and not more they are not meant to be an encyclopedia of univalence | [['in', 'introductions', 'to', 'the', 'subject', 'for', 'a', 'general', 'audience', 'of', 'mathematicians', 'or', 'logicians', 'the', 'univalence', 'axiom', 'is', 'typically', 'explained', 'by', 'handwaving', 'this', 'gives', 'rise', 'to', 'several', 'misconceptions', 'which', 'can', 'not', 'be', 'properly', 'addressed', 'in', 'the', 'absence', 'of', 'a', 'precise', 'definition', 'in', 'this', 'short', 'set', 'of', 'notes', 'we', 'give', 'a', 'complete', 'formulation', 'of', 'the', 'univalence', 'axiom', 'from', 'scratch', 'the', 'underlying', 'idea', 'of', 'these', 'notes', 'is', 'that', 'they', 'should', 'be', 'as', 'concise', 'as', 'possible', 'and', 'not', 'more', 'they', 'are', 'not', 'meant', 'to', 'be', 'an', 'encyclopedia', 'of', 'univalence']] | [-0.07075047650620998, 0.10104442127203048, -0.13468951045172564, 0.15414880406768883, -0.19294014172080684, -0.1419721193775973, 0.015027168239740764, 0.335244698296575, -0.25195117346832857, -0.30416517301517376, 0.1294952114838559, -0.23078375011682511, -0.1406001355526421, 0.2020529832225293, -0.2149693293058697, -0.06482814384953065, 0.04422703257159275, 0.05258702401290922, -0.03950028057990815, -0.29754488152616165, 0.30818384813473504, 0.055358053793144575, 0.16507637344081613, 0.12312035039615105, 0.030823677904246484, -0.03295521641095333, -0.03492278608438723, 0.06426553774405928, -0.13374153381420698, 0.16472488170599237, 0.34586168744238366, 0.20245962607509949, 0.34020214898183065, -0.44736191249069046, -0.12892009409363656, 0.07466237657319974, 0.10154090540976647, 0.14536715362851016, 0.02814637011872358, -0.26531400424154367, 0.0720662374925964, -0.15985889650662155, -0.1464440986404524, -0.08404441777452389, 0.02638777852167978, 0.01965714615276631, -0.21498557475450283, -0.0009041651097290656, 0.17246343890095459, 0.1350458588998984, -0.035511451682952395, -0.08010783437502515, 0.026304555210449238, 0.11378079568693304, 0.03642271958181963, 0.054094790749470975, 0.08330638455774854, -0.08534522531554103, -0.0963990292237962, 0.4313756847206284, -0.021408485073377104, -0.2580473968649612, 0.1724734068136005, -0.0819283229079755, -0.15205747348201626, 0.11659618710332056, 0.10862199299804429, 0.11607086294714142, -0.21485362579388653, 0.029212385864572272, -0.07701184838250115, 0.16259777085746036, 0.08971073780318393, 0.05991300601197187, 0.26898646090070116, 0.08901603407062152, 0.026520689935697353, 0.08698779727359686, 0.08632521560306058, -0.08339460220475517, -0.40419886357644025, -0.13066110006030238, -0.1546846714172074, 0.11521945748913019, 0.019306831544107648, -0.19450803743127515, 0.3668060389949995, 0.1700082155492376, 0.1511833399424658, 0.024505804984501618, 0.21677892304518642, 0.10814784864556072, 0.08952523824923178, 0.00970946094569038, 0.21517180167138578, 0.10531149906763697, 0.11607730762266061, -0.03978977033265812, 0.10064620858825304, 0.09814975644626162] |
1,803.02295 | Methods for preparation and detection of neutron spin-orbit states | The generation and control of neutron orbital angular momentum (OAM) states
and spin correlated OAM (spin-orbit) states provides a powerful probe of
materials with unique penetrating abilities and magnetic sensitivity. We
describe techniques to prepare and characterize neutron spin-orbit states, and
provide a quantitative comparison to known procedures. The proposed detection
method directly measures the correlations of spin state and transverse
momentum, and overcomes the major challenges associated with neutrons, which
are low flux and small spatial coherence length. Our preparation techniques,
utilizing special geometries of magnetic fields, are based on coherent
averaging and spatial control methods borrowed from nuclear magnetic resonance.
The described procedures may be extended to other probes such as electrons and
electromagnetic waves.
| quant-ph physics.atom-ph physics.optics | the generation and control of neutron orbital angular momentum oam states and spin correlated oam spinorbit states provides a powerful probe of materials with unique penetrating abilities and magnetic sensitivity we describe techniques to prepare and characterize neutron spinorbit states and provide a quantitative comparison to known procedures the proposed detection method directly measures the correlations of spin state and transverse momentum and overcomes the major challenges associated with neutrons which are low flux and small spatial coherence length our preparation techniques utilizing special geometries of magnetic fields are based on coherent averaging and spatial control methods borrowed from nuclear magnetic resonance the described procedures may be extended to other probes such as electrons and electromagnetic waves | [['the', 'generation', 'and', 'control', 'of', 'neutron', 'orbital', 'angular', 'momentum', 'oam', 'states', 'and', 'spin', 'correlated', 'oam', 'spinorbit', 'states', 'provides', 'a', 'powerful', 'probe', 'of', 'materials', 'with', 'unique', 'penetrating', 'abilities', 'and', 'magnetic', 'sensitivity', 'we', 'describe', 'techniques', 'to', 'prepare', 'and', 'characterize', 'neutron', 'spinorbit', 'states', 'and', 'provide', 'a', 'quantitative', 'comparison', 'to', 'known', 'procedures', 'the', 'proposed', 'detection', 'method', 'directly', 'measures', 'the', 'correlations', 'of', 'spin', 'state', 'and', 'transverse', 'momentum', 'and', 'overcomes', 'the', 'major', 'challenges', 'associated', 'with', 'neutrons', 'which', 'are', 'low', 'flux', 'and', 'small', 'spatial', 'coherence', 'length', 'our', 'preparation', 'techniques', 'utilizing', 'special', 'geometries', 'of', 'magnetic', 'fields', 'are', 'based', 'on', 'coherent', 'averaging', 'and', 'spatial', 'control', 'methods', 'borrowed', 'from', 'nuclear', 'magnetic', 'resonance', 'the', 'described', 'procedures', 'may', 'be', 'extended', 'to', 'other', 'probes', 'such', 'as', 'electrons', 'and', 'electromagnetic', 'waves']] | [-0.12122657941057323, 0.2157403056581433, -0.07061369719907132, 0.11091502644440047, -0.07468964424756411, -0.14355625512285364, 0.0037311223299744036, 0.39225419264477795, -0.2628174700344411, -0.3366018869977795, 0.024509824537294, -0.2667385248296186, -0.03249060825054717, 0.24048715067279136, 0.0117404378640155, 0.08404329582814, 0.05180837247027164, -0.044323408930178367, -0.09638192635785757, -0.1283309936352297, 0.3110396566156011, 0.05711739938546959, 0.32112375639665586, 0.06865091721177037, 0.1347382664720281, 0.05873539656725051, -0.01889601019091713, 0.00784310681395169, -0.09487459944206902, 0.10709505511545298, 0.2545598070594904, 0.05463030081616444, 0.19836586089327168, -0.46282595517034203, -0.21402345274766096, 0.04456857005810827, 0.12177663851647764, 0.15954836366726005, -0.0531429841559237, -0.32345474606109226, -0.018888347462798733, -0.15642823815409446, -0.15938691051406229, -0.1991595114963368, -0.022525964454055216, 0.060111819246075414, -0.2656721451248114, 0.08090881484164657, 0.049596046816963606, 0.0409173921833181, -0.08350013886801262, -0.12313623375927982, -0.035234309092132196, 0.09394617275032414, 0.05304521248222162, 0.054628618391883425, 0.16839107425443622, -0.1250015487635715, -0.19629979111317897, 0.31652736402729637, -0.01152598144661667, -0.19188601430107513, 0.213566920785711, -0.159298057651991, -0.07492678300437765, 0.13911575125629863, 0.17977233666219672, 0.12299473770360789, -0.11690508680911656, -0.01361806708870358, 0.038458986864544645, 0.17506430304457998, 0.041859264101964444, 0.17743643078332147, 0.27724771491355366, 0.15494682300740328, 0.049477271109811455, 0.1070886450719176, -0.1942813505968835, -0.05502860256844861, -0.20848501316056803, -0.12501956168940276, -0.20763979162463647, 0.05069114877364765, -0.026567871447152093, -0.11897050469325712, 0.40794695019881183, 0.13274142895646107, 0.12457852916290554, -0.07410589437513875, 0.33760428769338846, 0.07438602747841395, 0.08039624369743033, 0.045730367080013976, 0.265755913938738, 0.24948809909709913, 0.10103362581780197, -0.287094300155106, 0.02308888842439295, -0.01208368829714182] |
1,803.02296 | State tracking of linear ensembles via optimal mass transport | We consider the problems of tracking an ensemble of indistinguishable agents
with linear dynamics based only on output measurements. In this setting, the
dynamics of the agents can be modeled by distribution flows in the state space
and the measurements correspond to distributions in the output space. In this
paper we formulate the corresponding state estimation problem using optimal
mass transport theory with prior linear dynamics, and the optimal solution
gives an estimate of the state trajectories of the ensemble. For general
distributions of systems this can be formulated as a convex optimization
problem which is computationally feasible with when the number of state
dimensions is low. In the case where the marginal distributions are Gaussian,
the problem is reformulated as a semidefinite programming and can be
efficiently solved for tracking systems with a large number of states.
| cs.SY math.DS | we consider the problems of tracking an ensemble of indistinguishable agents with linear dynamics based only on output measurements in this setting the dynamics of the agents can be modeled by distribution flows in the state space and the measurements correspond to distributions in the output space in this paper we formulate the corresponding state estimation problem using optimal mass transport theory with prior linear dynamics and the optimal solution gives an estimate of the state trajectories of the ensemble for general distributions of systems this can be formulated as a convex optimization problem which is computationally feasible with when the number of state dimensions is low in the case where the marginal distributions are gaussian the problem is reformulated as a semidefinite programming and can be efficiently solved for tracking systems with a large number of states | [['we', 'consider', 'the', 'problems', 'of', 'tracking', 'an', 'ensemble', 'of', 'indistinguishable', 'agents', 'with', 'linear', 'dynamics', 'based', 'only', 'on', 'output', 'measurements', 'in', 'this', 'setting', 'the', 'dynamics', 'of', 'the', 'agents', 'can', 'be', 'modeled', 'by', 'distribution', 'flows', 'in', 'the', 'state', 'space', 'and', 'the', 'measurements', 'correspond', 'to', 'distributions', 'in', 'the', 'output', 'space', 'in', 'this', 'paper', 'we', 'formulate', 'the', 'corresponding', 'state', 'estimation', 'problem', 'using', 'optimal', 'mass', 'transport', 'theory', 'with', 'prior', 'linear', 'dynamics', 'and', 'the', 'optimal', 'solution', 'gives', 'an', 'estimate', 'of', 'the', 'state', 'trajectories', 'of', 'the', 'ensemble', 'for', 'general', 'distributions', 'of', 'systems', 'this', 'can', 'be', 'formulated', 'as', 'a', 'convex', 'optimization', 'problem', 'which', 'is', 'computationally', 'feasible', 'with', 'when', 'the', 'number', 'of', 'state', 'dimensions', 'is', 'low', 'in', 'the', 'case', 'where', 'the', 'marginal', 'distributions', 'are', 'gaussian', 'the', 'problem', 'is', 'reformulated', 'as', 'a', 'semidefinite', 'programming', 'and', 'can', 'be', 'efficiently', 'solved', 'for', 'tracking', 'systems', 'with', 'a', 'large', 'number', 'of', 'states']] | [-0.10311929050468556, 0.10271845383850513, -0.09086399150850333, 0.04407355352895388, -0.011198997613973916, -0.12463657047424087, 0.0031859271356539016, 0.34431692822903825, -0.3230481987576122, -0.32431924971414433, 0.14105872092245525, -0.25018009515749157, -0.12259346758145366, 0.16058177953801941, -0.07941520375375083, 0.11507831189268525, 0.07316388536339113, 0.03679130163610629, -0.06853164166239077, -0.233807054896623, 0.32601563786696375, 0.04492860073493658, 0.2562890822823713, -0.03407244683931703, 0.14267800343425377, 0.05729020165576451, 0.057661487410465874, 0.06566446734570386, -0.08283701006397334, 0.12896184526270835, 0.29421522945631295, 0.1647258949688757, 0.2873402716004816, -0.4118859479473769, -0.21867926041528152, 0.12739787461991975, 0.13982578674904947, 0.124456837210649, -0.003823648784748292, -0.2647550432736972, 0.03942840325180441, -0.1353665970593178, -0.09306733865304377, -0.06703479170961224, -0.03328900845667374, 0.017428155320332102, -0.32763821244968666, 0.08602936506487321, 0.00850842044810238, 0.003548796092956394, -0.0988432161503242, -0.10055620621373552, 0.0190555469294929, 0.13103349701154715, 0.012077045327464146, 0.009673633720671785, 0.10656346722617341, -0.1421596266757832, -0.1443431635144288, 0.37613287105130544, -0.06268090883647834, -0.3037343690833212, 0.1532623569423711, -0.10826924919029293, -0.10124674778215695, 0.12042570914870696, 0.2390912022927533, 0.19424553816139267, -0.1594565526530209, 0.0810425798415014, -0.09432705043666605, 0.16098360733493514, -0.006619479136872173, 0.013087881478038955, 0.18742034646540717, 0.175022207009876, 0.1394614830167721, 0.17663016962309275, -0.05864666446670552, -0.1485764518754719, -0.2780983546019896, -0.1338710335717685, -0.21714725290708567, 0.023348158596596426, -0.0679477543492702, -0.14499749684625346, 0.3637776393848269, 0.11866955969826845, 0.2368093784223648, 0.08530078368494287, 0.2772648354816804, 0.1949390304254611, -0.013631429246532312, 0.11531976898254799, 0.21962930633268063, 0.11196039785779473, 0.06268383209944527, -0.22866526657404998, 0.09850463750299768, 0.03296153315687147] |
1,803.02297 | Exponential stabilization of a smart piezoelectric composite beam with
only one boundary controller | Layered smart composite beams involving a piezoelectric layer are
traditionally actuated by a voltage source by the extension mechanism. In this
paper, we consider only the bending and shear of a cantilevered piezoelectric
smart composite beam modeled by the Mead-Marcus sandwich beam assumptions.
Uniform exponential stabilitization with only one boundary state feedback
controller, simultaneously controlling both bending moment and shear, is proved
by using a spectral multiplier approach. The state feedback controller slightly
differs from the classical counterparts by a non-trivial compact and
nonnegative integral operator. This is due to the strong coupling of the charge
equation with the stretching and bending equations. For simulations, the
so-called filtered semi-discrete finite difference scheme is adopted.
| math.AP | layered smart composite beams involving a piezoelectric layer are traditionally actuated by a voltage source by the extension mechanism in this paper we consider only the bending and shear of a cantilevered piezoelectric smart composite beam modeled by the meadmarcus sandwich beam assumptions uniform exponential stabilitization with only one boundary state feedback controller simultaneously controlling both bending moment and shear is proved by using a spectral multiplier approach the state feedback controller slightly differs from the classical counterparts by a nontrivial compact and nonnegative integral operator this is due to the strong coupling of the charge equation with the stretching and bending equations for simulations the socalled filtered semidiscrete finite difference scheme is adopted | [['layered', 'smart', 'composite', 'beams', 'involving', 'a', 'piezoelectric', 'layer', 'are', 'traditionally', 'actuated', 'by', 'a', 'voltage', 'source', 'by', 'the', 'extension', 'mechanism', 'in', 'this', 'paper', 'we', 'consider', 'only', 'the', 'bending', 'and', 'shear', 'of', 'a', 'cantilevered', 'piezoelectric', 'smart', 'composite', 'beam', 'modeled', 'by', 'the', 'meadmarcus', 'sandwich', 'beam', 'assumptions', 'uniform', 'exponential', 'stabilitization', 'with', 'only', 'one', 'boundary', 'state', 'feedback', 'controller', 'simultaneously', 'controlling', 'both', 'bending', 'moment', 'and', 'shear', 'is', 'proved', 'by', 'using', 'a', 'spectral', 'multiplier', 'approach', 'the', 'state', 'feedback', 'controller', 'slightly', 'differs', 'from', 'the', 'classical', 'counterparts', 'by', 'a', 'nontrivial', 'compact', 'and', 'nonnegative', 'integral', 'operator', 'this', 'is', 'due', 'to', 'the', 'strong', 'coupling', 'of', 'the', 'charge', 'equation', 'with', 'the', 'stretching', 'and', 'bending', 'equations', 'for', 'simulations', 'the', 'socalled', 'filtered', 'semidiscrete', 'finite', 'difference', 'scheme', 'is', 'adopted']] | [-0.1631989735116836, 0.1352152360224091, -0.06827680177088266, 0.002020419518611666, -0.10727949015202776, -0.2092734084843732, 0.015880467513868735, 0.37493045397300634, -0.32580776848887977, -0.2508519831406101, 0.11268205289621797, -0.23279669069874603, -0.11332279048134795, 0.18176056666349152, -0.04228920001841554, 0.0769039416743393, 0.026278337517308188, -0.047429693108671796, -0.037927820849998864, -0.13212969330081767, 0.32518879305241644, 0.042359637739384066, 0.3204077290189741, 0.006329448984325987, 0.14962794278359165, 0.01258433743305834, 0.007021994604028563, 0.036868166823385166, -0.11048302812856185, 0.1010293535294786, 0.1879053285028126, -0.038767567378328704, 0.27530316033903346, -0.4270602697012039, -0.23776287289616543, 0.043425559672007785, 0.0869957702131365, 0.07483822739460563, -0.0778232032878209, -0.2596903253610419, 0.10132839872122668, -0.18500894573888024, -0.14225212938308848, -0.015036308820631387, -0.04312580305901644, 0.06734361875724626, -0.29434276697951145, 0.0723439300004228, 0.073000806367305, 0.03224660970674482, -0.09373260126655213, -0.0848568820897325, -0.054418537248568856, 0.028920597360990695, 0.03646394472251918, 0.01614968720164183, 0.16515966801928866, -0.11250412434883482, -0.07132757505797575, 0.34866090327402394, -0.04449946093125747, -0.25451548239298627, 0.11525531004356072, -0.08363929233076957, -0.02065605467465599, 0.15229075577983683, 0.13150482146745235, 0.11500843644422372, -0.18764159417983178, 0.072898916201666, -0.008687242642003812, 0.1857346616504071, 0.09478368602313958, -0.0358240711379104, 0.1711773272069064, 0.15808876071421973, 0.11783286948086677, 0.17898243631285707, -0.06025299536624709, -0.08039338786187952, -0.301002791843715, -0.11275457049744715, -0.186224405425065, 0.059654816976888514, -0.08646823655745937, -0.1600599577444383, 0.38690319166433623, 0.04013428169630254, 0.10806486208766566, 0.035786777990252046, 0.3426859766014118, 0.14261148405772328, 0.07460529940713824, 0.04605896225881884, 0.2748204200524441, 0.1921299082985296, 0.13012631151483156, -0.2561356630155701, 0.05138338011466956, 0.11587833505769289] |
1,803.02298 | The CMB neutrino mass / vacuum energy degeneracy: a simple derivation of
the degeneracy slopes | It is well known that estimating cosmological parameters from cosmic
microwave background (CMB) data alone results in a significant degeneracy
between the total neutrino mass and several other cosmological parameters,
especially the Hubble constant H_0 and the matter density parameter $\Omega_m$.
Adding low-redshift measurements such as baryon acoustic oscillations (BAOs)
breaks this degeneracy and greatly improves the constraints on neutrino mass.
The sensitivity is surprisingly high, e.g. adding the $\sim 1$ percent
measurement of the BAO ratio $r_s/D_V$ from the BOSS survey leads to a limit
$\Sigma m_\nu < 0.19$ eV, equivalent to $\Omega_\nu < 0.0045$ at 95\%
confidence. For the case of $\Sigma m_\nu < 0.6$ eV, the CMB degeneracy with
neutrino mass almost follows a track of constant sound horizon angle (Howlett
et al 2012). For a $\Lambda$CDM + $m_\nu$ model, we use simple but quite
accurate analytic approximations to derive the slope of this track, giving
dimensionless multipliers between the neutrino to matter ratio ($x_\nu \equiv
\omega_\nu / \omega_{cb}$) and the shifts in other cosmological parameters. The
resulting multipliers are substantially larger than 1: conserving the CMB sound
horizon angle requires parameter shifts $\delta \ln H_0 \approx -2 \,\delta
x_\nu$, $\delta \ln \Omega_m \approx +5 \, \delta x_\nu$, $\delta \ln
\omega_\Lambda \approx -6.2 \, \delta x_\nu$, and most notably $\delta
\omega_\Lambda \approx -14 \, \delta \omega_\nu$. These multipliers give an
intuitive derivation of the degeneracy direction, which agrees well with the
numerical likelihood results from the Planck team.
| astro-ph.CO hep-ph | it is well known that estimating cosmological parameters from cosmic microwave background cmb data alone results in a significant degeneracy between the total neutrino mass and several other cosmological parameters especially the hubble constant h_0 and the matter density parameter omega_m adding lowredshift measurements such as baryon acoustic oscillations baos breaks this degeneracy and greatly improves the constraints on neutrino mass the sensitivity is surprisingly high eg adding the sim 1 percent measurement of the bao ratio r_sd_v from the boss survey leads to a limit sigma m_nu 019 ev equivalent to omega_nu 00045 at 95 confidence for the case of sigma m_nu 06 ev the cmb degeneracy with neutrino mass almost follows a track of constant sound horizon angle howlett et al 2012 for a lambdacdm m_nu model we use simple but quite accurate analytic approximations to derive the slope of this track giving dimensionless multipliers between the neutrino to matter ratio x_nu equiv omega_nu omega_cb and the shifts in other cosmological parameters the resulting multipliers are substantially larger than 1 conserving the cmb sound horizon angle requires parameter shifts delta ln h_0 approx 2 delta x_nu delta ln omega_m approx 5 delta x_nu delta ln omega_lambda approx 62 delta x_nu and most notably delta omega_lambda approx 14 delta omega_nu these multipliers give an intuitive derivation of the degeneracy direction which agrees well with the numerical likelihood results from the planck team | [['it', 'is', 'well', 'known', 'that', 'estimating', 'cosmological', 'parameters', 'from', 'cosmic', 'microwave', 'background', 'cmb', 'data', 'alone', 'results', 'in', 'a', 'significant', 'degeneracy', 'between', 'the', 'total', 'neutrino', 'mass', 'and', 'several', 'other', 'cosmological', 'parameters', 'especially', 'the', 'hubble', 'constant', 'h_0', 'and', 'the', 'matter', 'density', 'parameter', 'omega_m', 'adding', 'lowredshift', 'measurements', 'such', 'as', 'baryon', 'acoustic', 'oscillations', 'baos', 'breaks', 'this', 'degeneracy', 'and', 'greatly', 'improves', 'the', 'constraints', 'on', 'neutrino', 'mass', 'the', 'sensitivity', 'is', 'surprisingly', 'high', 'eg', 'adding', 'the', 'sim', '1', 'percent', 'measurement', 'of', 'the', 'bao', 'ratio', 'r_sd_v', 'from', 'the', 'boss', 'survey', 'leads', 'to', 'a', 'limit', 'sigma', 'm_nu', '019', 'ev', 'equivalent', 'to', 'omega_nu', '00045', 'at', '95', 'confidence', 'for', 'the', 'case', 'of', 'sigma', 'm_nu', '06', 'ev', 'the', 'cmb', 'degeneracy', 'with', 'neutrino', 'mass', 'almost', 'follows', 'a', 'track', 'of', 'constant', 'sound', 'horizon', 'angle', 'howlett', 'et', 'al', '2012', 'for', 'a', 'lambdacdm', 'm_nu', 'model', 'we', 'use', 'simple', 'but', 'quite', 'accurate', 'analytic', 'approximations', 'to', 'derive', 'the', 'slope', 'of', 'this', 'track', 'giving', 'dimensionless', 'multipliers', 'between', 'the', 'neutrino', 'to', 'matter', 'ratio', 'x_nu', 'equiv', 'omega_nu', 'omega_cb', 'and', 'the', 'shifts', 'in', 'other', 'cosmological', 'parameters', 'the', 'resulting', 'multipliers', 'are', 'substantially', 'larger', 'than', '1', 'conserving', 'the', 'cmb', 'sound', 'horizon', 'angle', 'requires', 'parameter', 'shifts', 'delta', 'ln', 'h_0', 'approx', '2', 'delta', 'x_nu', 'delta', 'ln', 'omega_m', 'approx', '5', 'delta', 'x_nu', 'delta', 'ln', 'omega_lambda', 'approx', '62', 'delta', 'x_nu', 'and', 'most', 'notably', 'delta', 'omega_lambda', 'approx', '14', 'delta', 'omega_nu', 'these', 'multipliers', 'give', 'an', 'intuitive', 'derivation', 'of', 'the', 'degeneracy', 'direction', 'which', 'agrees', 'well', 'with', 'the', 'numerical', 'likelihood', 'results', 'from', 'the', 'planck', 'team']] | [-0.11517966114855692, 0.18572840640369798, 0.02201353755362075, 0.10314905684359034, -0.12412081989319192, -0.15165306094247077, 0.07378454003653666, 0.2788563051385452, -0.21379679575881616, -0.38657729952507813, 0.020512148394682926, -0.36947400624068966, 0.02190986035014342, 0.2074462682327882, 0.021413302552838135, 0.007938134448365951, 0.010915317520467115, -0.03627539974243926, -0.11751931033133337, -0.22771500027036004, 0.22566997856182722, 0.13860536379948388, 0.21776232401567414, 0.005110840954173533, 0.07931238382900183, -0.0766242860378858, -0.04964277467586036, -0.031418846586442166, -0.26740119492020814, -0.012828488630475476, 0.1898274814884644, 0.1221559077164094, 0.15964929136881156, -0.26832937147640945, -0.16434556556211238, 0.16619785398757686, 0.17440116257477775, 0.0630533598912358, 0.02445078115450652, -0.2780932845208585, 0.00511721524225291, -0.17232578102442042, -0.12199006629076582, -0.008145291818374093, 0.005964339621453385, -0.042273046504023706, -0.2950753761066027, 0.26846587153830054, -0.03702244420178588, -0.016236893864798135, -0.042000815480072375, -0.23884007741761362, -0.05023490038804774, -0.01809985022931681, 0.07319798618946466, 0.10907918571871866, 0.1127549709776288, -0.11096396351610471, 0.027512198160522906, 0.3948460163323787, -0.11453798637758782, -0.11633209935248957, 0.04888562891022142, -0.18323518339996647, -0.1351786325224033, 0.07424444460725524, 0.06704041259343221, 0.03903490674766262, -0.09310427858646766, 0.1583261454409161, 0.021055731159165213, 0.2798244332782282, 0.13018795814573894, -0.0035685935872606933, 0.23796355524120436, 0.12150938195529683, 0.15509818326721997, -0.08261667124604392, -0.15862092608987385, 0.05299974255367174, -0.31592360308698925, -0.042892740244998756, -0.13651619260179296, 0.10648525884607807, -0.2348564840259973, -0.11979567545645765, 0.36201167953650243, 0.14061302207069118, 0.2649088845837155, 0.11725177825478725, 0.29240887832841916, 0.10965991369548961, 0.009786464041098952, 0.05342530346062067, 0.32498225722068536, 0.1577460656332952, 0.07676262374573933, -0.23752988906826117, -0.016650055065462046, 0.002824616846267198] |
1,803.02299 | Spherical collapse and cluster number counts in dark energy models
disformally coupled to dark matter | We investigate the effects of a disformal coupling between dark energy and
dark matter in the predictions of the spherical collapse and its signatures in
galaxy cluster number counts. We find that the disformal coupling has no
significant effects on spherical collapse at high redshifts, and in particular
during matter domination epoch. However, at lower redshifts, the extrapolated
linear density contrast at collapse close to redshift $z \lesssim 1$ and
overdensity at virialization can be strongly suppressed by a disformal coupling
between dark energy and dark matter. We also find that disformal coupling can
have different imprints on cluster number counts compared with conformal
coupling, such that the disformal coupling can strongly suppress the predicted
number of clusters per redshift interval at $z > 0.1$ while enhance the number
of cluster at $z < 0.05$. Using the specifications of eROSITA survey, we find
that the disformal coupling between dark energy and dark matter can be tightly
constrained by cluster number counts.
| astro-ph.CO | we investigate the effects of a disformal coupling between dark energy and dark matter in the predictions of the spherical collapse and its signatures in galaxy cluster number counts we find that the disformal coupling has no significant effects on spherical collapse at high redshifts and in particular during matter domination epoch however at lower redshifts the extrapolated linear density contrast at collapse close to redshift z lesssim 1 and overdensity at virialization can be strongly suppressed by a disformal coupling between dark energy and dark matter we also find that disformal coupling can have different imprints on cluster number counts compared with conformal coupling such that the disformal coupling can strongly suppress the predicted number of clusters per redshift interval at z 01 while enhance the number of cluster at z 005 using the specifications of erosita survey we find that the disformal coupling between dark energy and dark matter can be tightly constrained by cluster number counts | [['we', 'investigate', 'the', 'effects', 'of', 'a', 'disformal', 'coupling', 'between', 'dark', 'energy', 'and', 'dark', 'matter', 'in', 'the', 'predictions', 'of', 'the', 'spherical', 'collapse', 'and', 'its', 'signatures', 'in', 'galaxy', 'cluster', 'number', 'counts', 'we', 'find', 'that', 'the', 'disformal', 'coupling', 'has', 'no', 'significant', 'effects', 'on', 'spherical', 'collapse', 'at', 'high', 'redshifts', 'and', 'in', 'particular', 'during', 'matter', 'domination', 'epoch', 'however', 'at', 'lower', 'redshifts', 'the', 'extrapolated', 'linear', 'density', 'contrast', 'at', 'collapse', 'close', 'to', 'redshift', 'z', 'lesssim', '1', 'and', 'overdensity', 'at', 'virialization', 'can', 'be', 'strongly', 'suppressed', 'by', 'a', 'disformal', 'coupling', 'between', 'dark', 'energy', 'and', 'dark', 'matter', 'we', 'also', 'find', 'that', 'disformal', 'coupling', 'can', 'have', 'different', 'imprints', 'on', 'cluster', 'number', 'counts', 'compared', 'with', 'conformal', 'coupling', 'such', 'that', 'the', 'disformal', 'coupling', 'can', 'strongly', 'suppress', 'the', 'predicted', 'number', 'of', 'clusters', 'per', 'redshift', 'interval', 'at', 'z', '01', 'while', 'enhance', 'the', 'number', 'of', 'cluster', 'at', 'z', '005', 'using', 'the', 'specifications', 'of', 'erosita', 'survey', 'we', 'find', 'that', 'the', 'disformal', 'coupling', 'between', 'dark', 'energy', 'and', 'dark', 'matter', 'can', 'be', 'tightly', 'constrained', 'by', 'cluster', 'number', 'counts']] | [-0.14150154052899694, 0.2059335340072149, -0.07616701352251869, 0.12617141629844528, -0.10384914715797787, -0.09339436761003996, 0.0184459600878774, 0.371052520853356, -0.19526073438519576, -0.40202523289986375, -0.019764848509598407, -0.2787302564126703, -0.02067760151734798, 0.14607395944566284, 0.10125261016479992, -0.052824918181070206, -0.009432539321502682, 0.011466559910057288, -0.05885893088137971, -0.3053104424001298, 0.3309361131000772, 0.10544649642634457, 0.20329796882059262, 0.02627982593979101, 0.06781851307565123, -0.05342361936492131, -0.03673579054738178, 0.006484073560403765, -0.20165734409311428, -0.04150255675297289, 0.2069008095854741, 0.08690199503417378, 0.24256922428513755, -0.36326097319804646, -0.18712411160176656, 0.18382674835786317, 0.17911584304540223, 0.09827384793012163, -0.09267708871209021, -0.28333364459012383, 0.0517699696217318, -0.1834055652970788, -0.08211785959630455, -0.002809937779774081, -0.027483968275054445, 0.029855868704807387, -0.21672475370197739, 0.21044297073070845, -0.06495504355960109, -0.04323182549069887, -0.022824019024517597, -0.07284826224775247, -0.11023554492320092, -0.0024143038961872364, 0.07356628138167819, 0.0608506742894134, 0.21946878882663898, -0.21276595211827998, -0.0036047869954996233, 0.40289921780942745, -0.12537467857506476, -0.0913974340556769, 0.20349200372437729, -0.18393679877813413, -0.207174570866386, 0.12227401948085863, 0.18910688771364725, 0.03831927800469054, -0.09118531253071702, 0.12639676020758916, 0.03161348133866306, 0.2470178291225021, 0.11218627889599628, 0.06244362075016878, 0.3696864988514275, 0.09622304280487669, 0.05608214514839621, 0.05908682736650156, -0.12298430321714694, -0.011379361509948782, -0.32896531060478595, -0.07258618280947583, -0.17740818386628004, 0.032088403077503234, -0.17815085754048154, -0.08025484272929014, 0.32285274277622783, 0.12349878304076758, 0.18196911892103934, 0.1058065787883206, 0.2436535367712894, 0.09534495893086793, 0.08612198204551853, 0.059748120474154655, 0.3614121253526061, 0.15436773982965066, 0.04434239177645401, -0.2699762303440732, -0.024661054205055693, -0.021038345033786137] |
1,803.023 | A Gold Standard for Emotion Annotation in Stack Overflow | Software developers experience and share a wide range of emotions throughout
a rich ecosystem of communication channels. A recent trend that has emerged in
empirical software engineering studies is leveraging sentiment analysis of
developers' communication traces. We release a dataset of 4,800 questions,
answers, and comments from Stack Overflow, manually annotated for emotions. Our
dataset contributes to the building of a shared corpus of annotated resources
to support research on emotion awareness in software development.
| cs.SE | software developers experience and share a wide range of emotions throughout a rich ecosystem of communication channels a recent trend that has emerged in empirical software engineering studies is leveraging sentiment analysis of developers communication traces we release a dataset of 4800 questions answers and comments from stack overflow manually annotated for emotions our dataset contributes to the building of a shared corpus of annotated resources to support research on emotion awareness in software development | [['software', 'developers', 'experience', 'and', 'share', 'a', 'wide', 'range', 'of', 'emotions', 'throughout', 'a', 'rich', 'ecosystem', 'of', 'communication', 'channels', 'a', 'recent', 'trend', 'that', 'has', 'emerged', 'in', 'empirical', 'software', 'engineering', 'studies', 'is', 'leveraging', 'sentiment', 'analysis', 'of', 'developers', 'communication', 'traces', 'we', 'release', 'a', 'dataset', 'of', '4800', 'questions', 'answers', 'and', 'comments', 'from', 'stack', 'overflow', 'manually', 'annotated', 'for', 'emotions', 'our', 'dataset', 'contributes', 'to', 'the', 'building', 'of', 'a', 'shared', 'corpus', 'of', 'annotated', 'resources', 'to', 'support', 'research', 'on', 'emotion', 'awareness', 'in', 'software', 'development']] | [-0.15047771702210108, -0.006075352852543195, -0.030506905702253184, 0.05859423202307274, -0.2028480935158829, -0.16051749051238098, 0.11297016202782591, 0.4648158621788025, -0.19911149142930906, -0.3896232602869471, 0.07603066238574684, -0.37528309780483443, -0.11380954174945752, 0.23221820724507172, -0.157546794830511, 0.010108553630610306, 0.17957048394406835, 0.015125686683119663, 0.026406228768949706, -0.2992655950039625, 0.29990948279698687, 0.058348656981252134, 0.35027268862972655, 0.11139752538253864, 0.015567187747607628, -0.09138619588688016, -0.1313646669437488, -0.10183277542392413, -0.06037485597548463, 0.23973172424128278, 0.4590730632096529, 0.3295448693012198, 0.4175034909695387, -0.3588220274448395, -0.19886973030244312, -0.026991286582003036, 0.16219192056606213, 0.07464569102041424, -0.05896913018232832, -0.37459169345597426, 0.06174666822577516, -0.26737262073283397, -0.011822625150283178, -0.05772345547874769, 0.07212800708133728, -0.01717575203006466, -0.2081744580467542, -0.03461660571396351, 0.03313539838418365, 0.25589508763204016, -0.045426720088968676, -0.08419561256965001, -0.015317403658603628, 0.26843832215604685, 0.08754553796413043, 0.029150606386053067, 0.21393278416867056, -0.18784020212789376, -0.14974033345778784, 0.3212858669211467, -0.022244642674922942, -0.11253829995791118, 0.1995205965017279, -0.004298738005260627, -0.17936238936924687, 0.07923196211457252, 0.2957784014195204, 0.013118308503180742, -0.21056984625756742, 0.015056829947667816, -0.04724425433203578, 0.2978104276706775, 0.05337460848114764, -0.024728231611661614, 0.22034265624980132, 0.27391974670191604, -0.03809478101631006, 0.11948578236314157, 0.0418754878671219, -0.06773137504855792, -0.18507550967857242, -0.1656231867087384, -0.13587727637961508, 0.02938128058022509, -0.016569700892626618, -0.17635121239970128, 0.4062403272589048, 0.2288205076009035, 0.07862884526451429, 0.07501076467335224, 0.30325491925080617, -0.09697145658700417, 0.16182431012392043, 0.12663037940782185, 0.0604445573190848, -0.023605913097659748, 0.25566156627610326, -0.11016427917095523, 0.11385182901130368, -0.05806577934573094] |
1,803.02301 | De-Confinement in high multiplicity proton-proton collisions at LHC
energies | Recently, the CMS Collaboration has published identified particle transverse
momentum spectra in high multiplicity events at LHC energies $\sqrt s $ =
0.9-13 TeV. In the present work the transverse momentum spectra have been
analyzed in the framework of the color fields inside the clusters of
overlapping strings, which are produced in high energy hadronic collisions. The
non-Abelian nature is reflected in the coherence sum of the color fields which
as a consequence gives rise to an enhancement of the transverse momentum and a
suppression of the multiplicities relative to the non overlapping strings.
The initial temperature and shear viscosity to entropy density ratio $\eta/s$
are obtained. For the higher multiplicity events at $\sqrt s $ =7 and 13 TeV
the initial temperature is above the universal hadronization temperature and is
consistent with the creation of de-confined matter. In these small systems it
can be argued that the thermalization is a consequence of the quantum tunneling
through the event horizon introduced by the confining color fields, in analogy
to the Hawking-Unruh effect. The small shear viscosity to entropy density ratio
$\eta/s$ near the critical temperature suggests that the matter is a strongly
coupled Quark Gluon Plasma.
| hep-ph hep-ex | recently the cms collaboration has published identified particle transverse momentum spectra in high multiplicity events at lhc energies sqrt s 0913 tev in the present work the transverse momentum spectra have been analyzed in the framework of the color fields inside the clusters of overlapping strings which are produced in high energy hadronic collisions the nonabelian nature is reflected in the coherence sum of the color fields which as a consequence gives rise to an enhancement of the transverse momentum and a suppression of the multiplicities relative to the non overlapping strings the initial temperature and shear viscosity to entropy density ratio etas are obtained for the higher multiplicity events at sqrt s 7 and 13 tev the initial temperature is above the universal hadronization temperature and is consistent with the creation of deconfined matter in these small systems it can be argued that the thermalization is a consequence of the quantum tunneling through the event horizon introduced by the confining color fields in analogy to the hawkingunruh effect the small shear viscosity to entropy density ratio etas near the critical temperature suggests that the matter is a strongly coupled quark gluon plasma | [['recently', 'the', 'cms', 'collaboration', 'has', 'published', 'identified', 'particle', 'transverse', 'momentum', 'spectra', 'in', 'high', 'multiplicity', 'events', 'at', 'lhc', 'energies', 'sqrt', 's', '0913', 'tev', 'in', 'the', 'present', 'work', 'the', 'transverse', 'momentum', 'spectra', 'have', 'been', 'analyzed', 'in', 'the', 'framework', 'of', 'the', 'color', 'fields', 'inside', 'the', 'clusters', 'of', 'overlapping', 'strings', 'which', 'are', 'produced', 'in', 'high', 'energy', 'hadronic', 'collisions', 'the', 'nonabelian', 'nature', 'is', 'reflected', 'in', 'the', 'coherence', 'sum', 'of', 'the', 'color', 'fields', 'which', 'as', 'a', 'consequence', 'gives', 'rise', 'to', 'an', 'enhancement', 'of', 'the', 'transverse', 'momentum', 'and', 'a', 'suppression', 'of', 'the', 'multiplicities', 'relative', 'to', 'the', 'non', 'overlapping', 'strings', 'the', 'initial', 'temperature', 'and', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'are', 'obtained', 'for', 'the', 'higher', 'multiplicity', 'events', 'at', 'sqrt', 's', '7', 'and', '13', 'tev', 'the', 'initial', 'temperature', 'is', 'above', 'the', 'universal', 'hadronization', 'temperature', 'and', 'is', 'consistent', 'with', 'the', 'creation', 'of', 'deconfined', 'matter', 'in', 'these', 'small', 'systems', 'it', 'can', 'be', 'argued', 'that', 'the', 'thermalization', 'is', 'a', 'consequence', 'of', 'the', 'quantum', 'tunneling', 'through', 'the', 'event', 'horizon', 'introduced', 'by', 'the', 'confining', 'color', 'fields', 'in', 'analogy', 'to', 'the', 'hawkingunruh', 'effect', 'the', 'small', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'near', 'the', 'critical', 'temperature', 'suggests', 'that', 'the', 'matter', 'is', 'a', 'strongly', 'coupled', 'quark', 'gluon', 'plasma']] | [-0.13382789734485584, 0.2802775565401676, -0.14921782067084174, 0.108147569500764, 0.003618792574032369, -0.06164937834569055, -0.043723625644867745, 0.30869531631590363, -0.21214700001895118, -0.31664741496975324, -0.0041921318628115895, -0.31561256145546934, 0.03393325327359951, 0.12128210978442562, 0.01113638899245642, 0.06137006787264748, 0.03948075510682104, 0.06533794074893538, -0.03792142576822731, -0.2316419713517622, 0.29758347220081893, 0.10687119077132301, 0.2932522700462548, 0.1511879247779731, 0.07016951082891983, 0.011861090935583327, -0.019099063802163065, 0.058420438553481675, -0.14513074351810015, 0.01290808809807143, 0.24107733831006234, 0.026906199964400322, 0.15106779763986564, -0.3371094988026883, -0.19218178185479898, 0.10744449524257159, 0.13168714649871552, 0.09820420687117642, -0.04955429289914629, -0.23412486406072125, 0.09005865012416182, -0.19680099501009124, -0.1501648888266959, -0.02086264089261389, 0.052309616087631856, -0.005162996157926599, -0.26354231575378484, 0.1742274138854498, 0.01685851697383691, 0.03871861450528542, -0.039512953343391034, -0.1327061051589683, -0.09656969583810457, -0.0016997866332530975, 0.09869380282549371, 0.09881621293984161, 0.18110972221631924, -0.18354665004669982, -0.11675591579363367, 0.3207471622298882, -0.04410221347334394, -0.1217142512317303, 0.2185730601656685, -0.19312932508529546, -0.09451373251229814, 0.2041710959168373, 0.18600487171846003, 0.08624858272845803, -0.15540824075823004, 0.09186697926690773, -0.0037006689754309897, 0.15018155684856302, 0.1066593183035639, 0.06973927223890865, 0.27557044822862614, 0.150922527457129, 0.014207741729384337, 0.12437298833790665, -0.11731371755465633, -0.06580238238247256, -0.36333226587218015, -0.12448583980491433, -0.18749186489610437, 0.05038310179108069, -0.0966950774279066, -0.12082757577879133, 0.3580606049843557, 0.10233868374320355, 0.27920256911685276, -0.033622297288251585, 0.26538597737496883, 0.14201931029478562, 0.0734050935723908, 0.10611030322480271, 0.29277831381259223, 0.18526757355547785, 0.18715520053040333, -0.2658443505733414, -0.009720427575255769, 0.07801116355863723] |
1,803.02302 | Randomization inference with general interference and censoring | Interference occurs between individuals when the treatment (or exposure) of
one individual affects the outcome of another individual. Previous work on
causal inference methods in the presence of interference has focused on the
setting where a priori it is assumed there is 'partial interference,' in the
sense that individuals can be partitioned into groups wherein there is no
interference between individuals in different groups. Bowers, Fredrickson, and
Panagopoulos (2012) and Bowers, Fredrickson, and Aronow (2016) consider
randomization-based inferential methods that allow for more general
interference structures in the context of randomized experiments. In this
paper, extensions of Bowers et al. which allow for failure time outcomes
subject to right censoring are proposed. Permitting right censored outcomes is
challenging because standard randomization-based tests of the null hypothesis
of no treatment effect assume that whether an individual is censored does not
depend on treatment. The proposed extension of Bowers et al. to allow for
censoring entails adapting the method of Wang, Lagakos, and Gray (2010) for two
sample survival comparisons in the presence of unequal censoring. The methods
are examined via simulation studies and utilized to assess the effects of
cholera vaccination in an individually-randomized trial of 73,000 children and
women in Matlab, Bangladesh.
| stat.ME | interference occurs between individuals when the treatment or exposure of one individual affects the outcome of another individual previous work on causal inference methods in the presence of interference has focused on the setting where a priori it is assumed there is partial interference in the sense that individuals can be partitioned into groups wherein there is no interference between individuals in different groups bowers fredrickson and panagopoulos 2012 and bowers fredrickson and aronow 2016 consider randomizationbased inferential methods that allow for more general interference structures in the context of randomized experiments in this paper extensions of bowers et al which allow for failure time outcomes subject to right censoring are proposed permitting right censored outcomes is challenging because standard randomizationbased tests of the null hypothesis of no treatment effect assume that whether an individual is censored does not depend on treatment the proposed extension of bowers et al to allow for censoring entails adapting the method of wang lagakos and gray 2010 for two sample survival comparisons in the presence of unequal censoring the methods are examined via simulation studies and utilized to assess the effects of cholera vaccination in an individuallyrandomized trial of 73000 children and women in matlab bangladesh | [['interference', 'occurs', 'between', 'individuals', 'when', 'the', 'treatment', 'or', 'exposure', 'of', 'one', 'individual', 'affects', 'the', 'outcome', 'of', 'another', 'individual', 'previous', 'work', 'on', 'causal', 'inference', 'methods', 'in', 'the', 'presence', 'of', 'interference', 'has', 'focused', 'on', 'the', 'setting', 'where', 'a', 'priori', 'it', 'is', 'assumed', 'there', 'is', 'partial', 'interference', 'in', 'the', 'sense', 'that', 'individuals', 'can', 'be', 'partitioned', 'into', 'groups', 'wherein', 'there', 'is', 'no', 'interference', 'between', 'individuals', 'in', 'different', 'groups', 'bowers', 'fredrickson', 'and', 'panagopoulos', '2012', 'and', 'bowers', 'fredrickson', 'and', 'aronow', '2016', 'consider', 'randomizationbased', 'inferential', 'methods', 'that', 'allow', 'for', 'more', 'general', 'interference', 'structures', 'in', 'the', 'context', 'of', 'randomized', 'experiments', 'in', 'this', 'paper', 'extensions', 'of', 'bowers', 'et', 'al', 'which', 'allow', 'for', 'failure', 'time', 'outcomes', 'subject', 'to', 'right', 'censoring', 'are', 'proposed', 'permitting', 'right', 'censored', 'outcomes', 'is', 'challenging', 'because', 'standard', 'randomizationbased', 'tests', 'of', 'the', 'null', 'hypothesis', 'of', 'no', 'treatment', 'effect', 'assume', 'that', 'whether', 'an', 'individual', 'is', 'censored', 'does', 'not', 'depend', 'on', 'treatment', 'the', 'proposed', 'extension', 'of', 'bowers', 'et', 'al', 'to', 'allow', 'for', 'censoring', 'entails', 'adapting', 'the', 'method', 'of', 'wang', 'lagakos', 'and', 'gray', '2010', 'for', 'two', 'sample', 'survival', 'comparisons', 'in', 'the', 'presence', 'of', 'unequal', 'censoring', 'the', 'methods', 'are', 'examined', 'via', 'simulation', 'studies', 'and', 'utilized', 'to', 'assess', 'the', 'effects', 'of', 'cholera', 'vaccination', 'in', 'an', 'individuallyrandomized', 'trial', 'of', '73000', 'children', 'and', 'women', 'in', 'matlab', 'bangladesh']] | [-0.06574166013423971, 0.0706748557193661, -0.07176856605930432, 0.0862507216594926, -0.08257026577382419, -0.16564560481978946, 0.10476987418688216, 0.3802133831172133, -0.1679302799403106, -0.29620539870384577, 0.0754722140626467, -0.26934648375377884, -0.15406330486399183, 0.15775384896565883, -0.1548089364077896, 0.011304077020748027, 0.05495378121630705, 0.008411459148575986, 0.013841132760333394, -0.3283508642560255, 0.28601294314376446, 0.07571528647937367, 0.3155917005108005, 0.014973921331298542, 0.05797118085656484, 0.076706721735229, -0.10724495824697854, 0.02280607890459386, -0.10514896280121558, 0.03799725519635085, 0.2691921903073189, 0.17155822628088782, 0.34843604347139745, -0.43387363996600525, -0.21390081843801179, 0.14948498497099322, 0.11536194063049166, 0.082638689614575, -0.019389313372830747, -0.30884867722645926, 0.0527033430720731, -0.17101971603387114, -0.03778000816412682, -0.011312770404520646, 0.025865084374377307, -0.02173767787352878, -0.3452735444713365, 0.13451742032664504, 0.04534503426660208, 0.08220580487568212, -0.02120678041284745, -0.12342059744660036, 0.006233412557136473, 0.1286907437260101, 0.08129280438265253, -0.04558812916962121, 0.08059115607020019, -0.06513855794103039, -0.14959563388449407, 0.3316683298440173, 0.026195221884473315, -0.21663304457169533, 0.20850514201940049, -0.12403286949043447, -0.13272156769143015, 0.0737371076195736, 0.19112231193786608, 0.1050193504215073, -0.15949276743151644, 0.07416116887172357, -0.04688362305955821, 0.13872814394858896, 0.09901661010126785, -0.029791665393051846, 0.1446864892495796, 0.14590167050043953, 0.0480417059857314, 0.04637123435564882, -0.08206728731408416, -0.10396283447810323, -0.26662252174138124, -0.12690978516805823, -0.12363414742735837, -0.004904342788735513, -0.03325097786114041, -0.16067507683566243, 0.36096111690653626, 0.1914754252668456, 0.1434009114313103, 0.024696114380029614, 0.2631502525235091, 0.04497158283779594, 0.025663301938367848, 0.06140832500745064, 0.19699044551948394, 0.10399817702496171, 0.030241387952399914, -0.21708062320044405, 0.17088303001990646, -0.0038911272214734974] |
1,803.02303 | Path probabilities for consecutive measurements, and certain "quantum
paradoxes" | We consider a finite-dimensional quantum system, making a transition between
known initial and final states. The outcomes of several accurate measurements,
which {\it could be} made in the interim, define virtual paths, each endowed
with a probability amplitude. If the measurements are {\it actually made}, the
paths, which may now be called "real", acquire also the probabilities, related
to the frequencies, with which a path is seen to be travelled in a series of
identical trials. Different sets of measurements, made on the same system, can
produce different, or incompatible, statistical ensembles, whose conflicting
attributes may, although by no means should, appear "paradoxical". We describe
in detail the ensembles, resulting from intermediate measurements of mutually
commuting, or non-commuting, operators, in terms of the real paths produced. In
the same manner, we analyse the Hardy's and the "three box" paradoxes, the
photon's past in an interferometer, the "quantum Cheshire cat" experiment, an
the closely related subject of "interaction-free measurements". It is shown
that, in all these cases, inaccurate "weak measurements" produce no real paths,
and yield only limited information about the virtual paths' probability
amplitudes
| quant-ph | we consider a finitedimensional quantum system making a transition between known initial and final states the outcomes of several accurate measurements which it could be made in the interim define virtual paths each endowed with a probability amplitude if the measurements are it actually made the paths which may now be called real acquire also the probabilities related to the frequencies with which a path is seen to be travelled in a series of identical trials different sets of measurements made on the same system can produce different or incompatible statistical ensembles whose conflicting attributes may although by no means should appear paradoxical we describe in detail the ensembles resulting from intermediate measurements of mutually commuting or noncommuting operators in terms of the real paths produced in the same manner we analyse the hardys and the three box paradoxes the photons past in an interferometer the quantum cheshire cat experiment an the closely related subject of interactionfree measurements it is shown that in all these cases inaccurate weak measurements produce no real paths and yield only limited information about the virtual paths probability amplitudes | [['we', 'consider', 'a', 'finitedimensional', 'quantum', 'system', 'making', 'a', 'transition', 'between', 'known', 'initial', 'and', 'final', 'states', 'the', 'outcomes', 'of', 'several', 'accurate', 'measurements', 'which', 'it', 'could', 'be', 'made', 'in', 'the', 'interim', 'define', 'virtual', 'paths', 'each', 'endowed', 'with', 'a', 'probability', 'amplitude', 'if', 'the', 'measurements', 'are', 'it', 'actually', 'made', 'the', 'paths', 'which', 'may', 'now', 'be', 'called', 'real', 'acquire', 'also', 'the', 'probabilities', 'related', 'to', 'the', 'frequencies', 'with', 'which', 'a', 'path', 'is', 'seen', 'to', 'be', 'travelled', 'in', 'a', 'series', 'of', 'identical', 'trials', 'different', 'sets', 'of', 'measurements', 'made', 'on', 'the', 'same', 'system', 'can', 'produce', 'different', 'or', 'incompatible', 'statistical', 'ensembles', 'whose', 'conflicting', 'attributes', 'may', 'although', 'by', 'no', 'means', 'should', 'appear', 'paradoxical', 'we', 'describe', 'in', 'detail', 'the', 'ensembles', 'resulting', 'from', 'intermediate', 'measurements', 'of', 'mutually', 'commuting', 'or', 'noncommuting', 'operators', 'in', 'terms', 'of', 'the', 'real', 'paths', 'produced', 'in', 'the', 'same', 'manner', 'we', 'analyse', 'the', 'hardys', 'and', 'the', 'three', 'box', 'paradoxes', 'the', 'photons', 'past', 'in', 'an', 'interferometer', 'the', 'quantum', 'cheshire', 'cat', 'experiment', 'an', 'the', 'closely', 'related', 'subject', 'of', 'interactionfree', 'measurements', 'it', 'is', 'shown', 'that', 'in', 'all', 'these', 'cases', 'inaccurate', 'weak', 'measurements', 'produce', 'no', 'real', 'paths', 'and', 'yield', 'only', 'limited', 'information', 'about', 'the', 'virtual', 'paths', 'probability', 'amplitudes']] | [-0.13533103906782976, 0.2008645638291099, -0.10025444266988337, 0.08089582804139987, -0.033501242144468604, -0.14276207247040357, 0.050896430570940975, 0.377768262370449, -0.26113545197396254, -0.2816745767688743, 0.0785106658744474, -0.2991123719586302, -0.12007399327779675, 0.20799103126932017, -0.07641147814043191, 0.05861567768253102, 0.1340220779649984, 0.08421520929550752, -0.05122911555910199, -0.2401698686868337, 0.29893125481885363, 0.031004509669677962, 0.2617740166505151, -0.00982763104484943, 0.11447359537503318, 0.020618089403876144, -0.0505586874112297, 0.06159659930823063, -0.08699029501744719, 0.08816760694247458, 0.254406513962591, 0.1397849349659341, 0.22447015053045977, -0.44316654121908156, -0.1787630593272574, 0.15885938708505937, 0.12170086310842358, 0.12200921860779129, 0.0184581257047324, -0.311951864212144, 0.023962982422824058, -0.1388266531892283, -0.11111636447521564, -0.045410032217066895, 0.0031950326013864706, 0.0005238567043662719, -0.25857485291730287, 0.03251492379232608, 0.004308783353379746, 0.02587206917308757, -0.026220476438301495, -0.09128189732639483, 0.002980607757901611, 0.15856448663196163, 0.004734196230065604, 0.014347102370938164, 0.0982790789702963, -0.0865772248134422, -0.17838412541744258, 0.3677278613600799, 0.006080371380844356, -0.2102922895245011, 0.1978833150655112, -0.1792580331701016, -0.11240837864803009, 0.0973522229178343, 0.10590857106644366, 0.0998514143145218, -0.16069154157404505, -0.0017975181092523321, -0.04851440413166647, 0.16676235193913075, 0.09493848524668821, 0.08179913802862006, 0.22383337886865617, 0.06134557413473806, 0.033363148096174446, 0.10494057025125189, -0.028783711899608454, -0.11953871317825321, -0.3155302216397578, -0.14680496185223013, -0.1733431691365853, 0.08026063552761512, -0.05086347866468397, -0.1755216422086802, 0.3403382779936731, 0.15219111851183698, 0.24836386937607566, 0.0027366871205310376, 0.280057398274632, 0.11277315736135832, 0.08093970601381127, 0.03370277047962072, 0.24437748270524343, 0.1064216003249622, 0.06228885164170567, -0.17253017731506945, 0.10773649183576471, -0.014197912006436483] |
1,803.02304 | Differential Algebras in Codifferential Categories | Differential categories were introduced by Blute, Cockett, and Seely as
categorical models of differential linear logic and have since lead to abstract
formulations of many notions involving differentiation such as the directional
derivative, differential forms, smooth manifolds, De Rham cohomology, etc. In
this paper we study the generalization of differential algebras to the context
of differential categories by introducing $\mathsf{T}$-differential algebras,
which can be seen as special cases of Blute, Lucyshyn-Wright, and O'Neill's
notion of $\mathsf{T}$-derivations. As such, $\mathsf{T}$-differential algebras
are axiomatized by the chain rule and as a consequence we obtain both the
higher-order Leibniz rule and the Fa\`a di Bruno formula for the higher-order
chain rule. We also construct both free and cofree $\mathsf{T}$-differential
algebras for suitable codifferential categories and discuss power series of
$\mathsf{T}$-algebras.
| math.CT | differential categories were introduced by blute cockett and seely as categorical models of differential linear logic and have since lead to abstract formulations of many notions involving differentiation such as the directional derivative differential forms smooth manifolds de rham cohomology etc in this paper we study the generalization of differential algebras to the context of differential categories by introducing mathsftdifferential algebras which can be seen as special cases of blute lucyshynwright and oneills notion of mathsftderivations as such mathsftdifferential algebras are axiomatized by the chain rule and as a consequence we obtain both the higherorder leibniz rule and the faa di bruno formula for the higherorder chain rule we also construct both free and cofree mathsftdifferential algebras for suitable codifferential categories and discuss power series of mathsftalgebras | [['differential', 'categories', 'were', 'introduced', 'by', 'blute', 'cockett', 'and', 'seely', 'as', 'categorical', 'models', 'of', 'differential', 'linear', 'logic', 'and', 'have', 'since', 'lead', 'to', 'abstract', 'formulations', 'of', 'many', 'notions', 'involving', 'differentiation', 'such', 'as', 'the', 'directional', 'derivative', 'differential', 'forms', 'smooth', 'manifolds', 'de', 'rham', 'cohomology', 'etc', 'in', 'this', 'paper', 'we', 'study', 'the', 'generalization', 'of', 'differential', 'algebras', 'to', 'the', 'context', 'of', 'differential', 'categories', 'by', 'introducing', 'mathsftdifferential', 'algebras', 'which', 'can', 'be', 'seen', 'as', 'special', 'cases', 'of', 'blute', 'lucyshynwright', 'and', 'oneills', 'notion', 'of', 'mathsftderivations', 'as', 'such', 'mathsftdifferential', 'algebras', 'are', 'axiomatized', 'by', 'the', 'chain', 'rule', 'and', 'as', 'a', 'consequence', 'we', 'obtain', 'both', 'the', 'higherorder', 'leibniz', 'rule', 'and', 'the', 'faa', 'di', 'bruno', 'formula', 'for', 'the', 'higherorder', 'chain', 'rule', 'we', 'also', 'construct', 'both', 'free', 'and', 'cofree', 'mathsftdifferential', 'algebras', 'for', 'suitable', 'codifferential', 'categories', 'and', 'discuss', 'power', 'series', 'of', 'mathsftalgebras']] | [-0.11594241225881682, 0.0028816977358092706, -0.06362589341945075, 0.13811394046041964, -0.1470969412325611, -0.1508501738182179, -0.051865044739961084, 0.3199346919634169, -0.35953854497769966, -0.27000957764610045, 0.14443320863328182, -0.20607079642450704, -0.18665926729614335, 0.1948978931815814, -0.16534093198096078, -0.014752941615428896, 0.010720368795802878, 0.06283039572994195, -0.06134718817643701, -0.21805313112394464, 0.43856973415465966, 0.01800640967614468, 0.199393410806454, 0.016062409823550092, 0.15098523028991034, 0.051025111021684305, -0.0678770745233182, 0.03721485590673887, -0.15004869120856446, 0.12135143781216035, 0.3355895041711612, 0.07733393217542119, 0.21251760411917442, -0.3935129854587778, -0.11083003628112736, 0.11266437005214093, 0.09828546235052447, 0.058444104862451975, 0.011899949832549018, -0.3045610613940704, 0.05086875809431677, -0.28097024472850946, -0.07266450248613593, -0.1588667024278097, 0.037658760604596955, 0.060874758241322616, -0.23674360142960663, 0.04362565669350348, 0.13671644526578847, 0.12800465353763185, -0.06073487628835268, -0.1285499823730319, -0.0919940204551113, 0.038369125359871935, -0.03964169964855237, -0.05339763782009663, 0.09671218879896426, -0.07581323687730718, -0.21491502466866927, 0.3338005465845908, -0.06963863900502122, -0.2222916026094613, 0.12309732956571444, -0.10486059232930382, -0.19185670192406, 0.03346072074951265, 0.05976796730030929, 0.1757048584535838, -0.10892991601459441, 0.1312971540408457, -0.040962145081721246, 0.008895643701356265, 0.16675223493122407, 0.037163276416850424, 0.12837246963528975, 0.08434754548474185, 0.03522725296845179, 0.1259441012075366, 0.029814302057568586, -0.11729925408238365, -0.3282144583833043, -0.23894063976683444, -0.001233924604621866, 0.06025006341177129, -0.054900541513967664, -0.18600200969846017, 0.32372297742404044, 0.07294607427368852, 0.16685050413493188, 0.1250395794002895, 0.20627288806680288, 0.15553999710508862, 0.11298537834907972, -0.05381590570933411, 0.1290453169457314, 0.25697214845868366, 0.10957440045932608, -0.10117058714099732, 0.021412634658777425, 0.19354570253879852] |
1,803.02305 | Birationally rigid complete intersections of high codimension | We prove that a Fano complete intersection of codimension $k$ and index 1 in
the complex projective space ${\mathbb P}^{M+k}$ for $k\geqslant 20$ and
$M\geqslant 8k\log k$ with at most multi-quadratic singularities is
birationally superrigid. The codimension of the complement to the set of
birationally superrigid complete intersections in the natural parameter space
is shown to be at least $\frac12 (M-5k)(M-6k)$. The proof is based on the
techniques of hypertangent divisors combined with the recently discovered
$4n^2$-inequality for complete intersection singularities.
| math.AG | we prove that a fano complete intersection of codimension k and index 1 in the complex projective space mathbb pmk for kgeqslant 20 and mgeqslant 8klog k with at most multiquadratic singularities is birationally superrigid the codimension of the complement to the set of birationally superrigid complete intersections in the natural parameter space is shown to be at least frac12 m5km6k the proof is based on the techniques of hypertangent divisors combined with the recently discovered 4n2inequality for complete intersection singularities | [['we', 'prove', 'that', 'a', 'fano', 'complete', 'intersection', 'of', 'codimension', 'k', 'and', 'index', '1', 'in', 'the', 'complex', 'projective', 'space', 'mathbb', 'pmk', 'for', 'kgeqslant', '20', 'and', 'mgeqslant', '8klog', 'k', 'with', 'at', 'most', 'multiquadratic', 'singularities', 'is', 'birationally', 'superrigid', 'the', 'codimension', 'of', 'the', 'complement', 'to', 'the', 'set', 'of', 'birationally', 'superrigid', 'complete', 'intersections', 'in', 'the', 'natural', 'parameter', 'space', 'is', 'shown', 'to', 'be', 'at', 'least', 'frac12', 'm5km6k', 'the', 'proof', 'is', 'based', 'on', 'the', 'techniques', 'of', 'hypertangent', 'divisors', 'combined', 'with', 'the', 'recently', 'discovered', '4n2inequality', 'for', 'complete', 'intersection', 'singularities']] | [-0.19065863051517412, 0.02366921025662659, -0.06315293276491456, 0.04142816932961488, -0.05976408300921321, -0.18120194629479486, -0.03097878232335624, 0.2931613119510122, -0.24157904396102262, -0.17344432217904773, 0.09580093497135796, -0.3302591228021834, -0.11037692878371438, 0.19468234326594916, -0.14331850840542942, 0.0080937078798739, 0.011548240782501988, 0.10203425064145659, -0.05183500721035764, -0.3597434524398966, 0.42144247048940414, -0.07626245383364268, 0.18883189430030492, 0.09003959904209925, 0.12297127903170454, 0.01615276944059401, 0.03908252396071569, 0.02314110349741382, -0.1947130385032767, 0.10987228001706684, 0.3212417882317916, 0.10102220025594132, 0.16411259410998377, -0.33118697135852504, -0.1652517494482872, 0.2213052695330519, 0.14257465714875323, -0.0032383725166511843, 0.0781608352643581, -0.22903637657873333, 0.16889843503490853, -0.043801539223074004, -0.21432986484768873, -0.06343109308718106, 0.09264316651014945, -0.029491134369984653, -0.24715802005420512, -0.040478020398996964, 0.09752197009630692, 0.18177301860533845, 0.026125543968728147, -0.1458147807787053, -0.11277596953098112, -0.013239519658665627, -0.04611352865452854, 0.10933606578514744, 0.026787217140782815, -0.059332565499995, -0.13711789498353402, 0.35920657250934684, -0.031130889573922522, -0.1836182784098081, 0.13711018359754235, -0.19908146391837642, -0.14874456922571438, 0.22119704860811815, 0.07764448086993817, 0.20597229057397598, 0.006695260914663474, 0.1788099499535747, -0.059394437521218486, 0.09680834607197306, 0.12624279246068534, -0.007671943250804758, 0.11038771783933043, 0.10906917288994943, 0.13224146691843486, 0.07600610445772943, -0.026709008541029807, 0.0065463128356406325, -0.3599666748673488, -0.19497155937521407, -0.14799441422264165, 0.15707094570657668, -0.12193483105847218, -0.13043702174036298, 0.38483946879083913, 0.008941945679581318, 0.25528322169796014, 0.08579492428077337, 0.2560446242061563, 0.022558649749836873, 0.04294457188091026, 0.10491591394067001, 0.16650271338846487, 0.15230244376625007, -0.08113416510586365, -0.10513315211760645, -0.040640763472765684, 0.17530391439317894] |
1,803.02306 | Toric Nearly K\"ahler manifolds | We show that 6-dimensional strict nearly K\"ahler manifolds admitting
effective $\mathbb{T}^3$ actions by automorphisms are completely characterized
in the neigbourhood of each point by a function on $\mathbb{R}^3$ satisfying a
certain Monge-Amp\`ere type equation.
| math.DG | we show that 6dimensional strict nearly kahler manifolds admitting effective mathbbt3 actions by automorphisms are completely characterized in the neigbourhood of each point by a function on mathbbr3 satisfying a certain mongeampere type equation | [['we', 'show', 'that', '6dimensional', 'strict', 'nearly', 'kahler', 'manifolds', 'admitting', 'effective', 'mathbbt3', 'actions', 'by', 'automorphisms', 'are', 'completely', 'characterized', 'in', 'the', 'neigbourhood', 'of', 'each', 'point', 'by', 'a', 'function', 'on', 'mathbbr3', 'satisfying', 'a', 'certain', 'mongeampere', 'type', 'equation']] | [-0.2531425963868113, 0.0851695871199755, -0.0369217057219323, 0.06935631226309959, -0.126108764883076, -0.1994010084308684, -0.01134802952326615, 0.345746492200038, -0.2588092920863453, -0.19372047155218966, 0.1303187354351394, -0.2865649950416649, -0.17857914195081, 0.15665069792200537, -0.149307920022265, 0.01036430788500344, 0.057586860843002796, 0.08612449097392313, -0.1683058382546091, -0.2764865745078115, 0.5492159717661493, -0.13308395746657076, 0.17870089695241084, 0.040279789663412995, 0.2305735700955505, -0.039496812928358424, 0.056764472180100924, 0.04599423924296656, -0.18921723781835786, 0.030725049875293148, 0.226553287685794, 0.022320627111612874, 0.18941378282547436, -0.3492148168494596, -0.217625871355481, 0.21277269964818568, 0.13379263290313675, -0.038863345706725824, -0.06516157812781304, -0.3201778433011735, 0.07680361563175478, -0.08597592428764876, -0.24110690383788416, -0.11580928787589073, -0.012626200256978764, 0.04586702656439122, -0.22127787550390862, 0.025981139359988876, 0.09902944873936255, 0.08371494318742086, -0.15758078138563125, -0.04649438540903194, -0.13436942098333554, 0.01641526974408942, -0.021342654349556303, 0.0738396012731006, 0.09266581993057009, -0.0346278880503686, -0.05871086863472181, 0.3806190353763454, -0.11083318975151461, -0.3654533824609483, 0.07121437881141901, -0.13495418733424125, -0.175524314166978, 0.1496132607845699, 0.05574950686765506, 0.2162786702187184, -0.143654198057073, 0.2446772952509277, -0.10272743881625288, 0.06655634178605396, 0.12998696861733847, -0.054530409315381854, 0.141786450657117, 0.09775637605172746, 0.20580219069276662, 0.0748875767321271, 0.1346095970023752, -0.09212368819862604, -0.3718977214439827, -0.09827523327925626, -0.07475795814603128, 0.25649620022843866, -0.14875533289330847, -0.1941517743638114, 0.36318913299371214, -0.07190952721216223, 0.20035041046931462, 0.14070120752405593, 0.18453878646387772, 0.06108367681393728, 0.04538682327770135, 0.13179530762135983, 0.13638002377496483, 0.1518945185782607, 0.0032535112216411266, -0.1240868515759597, -0.07830871473176076, 0.23053942990544088] |
1,803.02307 | RealPen: Providing Realism in Handwriting Tasks on Touch Surfaces using
Auditory-Tactile Feedback | We present RealPen, an augmented stylus for capacitive tablet screens that
recreates the physical sensation of writing on paper with a pencil, ball-point
pen or marker pen. The aim is to create a more engaging experience when writing
on touch surfaces, such as screens of tablet computers. This is achieved by
re-generating the friction-induced oscillation and sound of a real writing tool
in contact with paper. To generate realistic tactile feedback, our algorithm
analyses the frequency spectrum of the friction oscillation generated when
writing with traditional tools, extracts principal frequencies, and uses the
actuator's frequency response profile for an adjustment weighting function. We
enhance the realism by providing the sound feedback aligned with the writing
pressure and speed. Furthermore, we investigated the effects of superposition
and fluctuation of several frequencies on human tactile perception, evaluated
the performance of RealPen, and characterized users' perception and preference
of each feedback type.
| cs.HC | we present realpen an augmented stylus for capacitive tablet screens that recreates the physical sensation of writing on paper with a pencil ballpoint pen or marker pen the aim is to create a more engaging experience when writing on touch surfaces such as screens of tablet computers this is achieved by regenerating the frictioninduced oscillation and sound of a real writing tool in contact with paper to generate realistic tactile feedback our algorithm analyses the frequency spectrum of the friction oscillation generated when writing with traditional tools extracts principal frequencies and uses the actuators frequency response profile for an adjustment weighting function we enhance the realism by providing the sound feedback aligned with the writing pressure and speed furthermore we investigated the effects of superposition and fluctuation of several frequencies on human tactile perception evaluated the performance of realpen and characterized users perception and preference of each feedback type | [['we', 'present', 'realpen', 'an', 'augmented', 'stylus', 'for', 'capacitive', 'tablet', 'screens', 'that', 'recreates', 'the', 'physical', 'sensation', 'of', 'writing', 'on', 'paper', 'with', 'a', 'pencil', 'ballpoint', 'pen', 'or', 'marker', 'pen', 'the', 'aim', 'is', 'to', 'create', 'a', 'more', 'engaging', 'experience', 'when', 'writing', 'on', 'touch', 'surfaces', 'such', 'as', 'screens', 'of', 'tablet', 'computers', 'this', 'is', 'achieved', 'by', 'regenerating', 'the', 'frictioninduced', 'oscillation', 'and', 'sound', 'of', 'a', 'real', 'writing', 'tool', 'in', 'contact', 'with', 'paper', 'to', 'generate', 'realistic', 'tactile', 'feedback', 'our', 'algorithm', 'analyses', 'the', 'frequency', 'spectrum', 'of', 'the', 'friction', 'oscillation', 'generated', 'when', 'writing', 'with', 'traditional', 'tools', 'extracts', 'principal', 'frequencies', 'and', 'uses', 'the', 'actuators', 'frequency', 'response', 'profile', 'for', 'an', 'adjustment', 'weighting', 'function', 'we', 'enhance', 'the', 'realism', 'by', 'providing', 'the', 'sound', 'feedback', 'aligned', 'with', 'the', 'writing', 'pressure', 'and', 'speed', 'furthermore', 'we', 'investigated', 'the', 'effects', 'of', 'superposition', 'and', 'fluctuation', 'of', 'several', 'frequencies', 'on', 'human', 'tactile', 'perception', 'evaluated', 'the', 'performance', 'of', 'realpen', 'and', 'characterized', 'users', 'perception', 'and', 'preference', 'of', 'each', 'feedback', 'type']] | [-0.12442340465740864, 0.10231152198575975, -0.062680945053798, -0.025027318264446444, -0.14643977995847865, -0.19631614267737382, 0.047121052467105844, 0.39536279133286606, -0.24461815792902494, -0.3067700617319467, 0.08218800036955726, -0.286226897009452, -0.18197801818938128, 0.22916236969477619, -0.1010577192650411, 0.026945731614488273, 0.024758931372922902, 0.050233103881342986, -0.005828777531662411, -0.19914354717194224, 0.2936601107274847, 0.07790502559292276, 0.304703804366544, 0.022350050518479273, 0.13089963532255672, 0.04303427831884347, -0.04437222691303512, 0.01907950519587287, -0.09739712941275987, 0.12371825172287114, 0.24547608444454516, 0.16905156031352322, 0.2950900995590705, -0.44347246416977476, -0.18800678402248797, 0.012299531671617712, 0.0899775409659206, 0.09945919288030895, -0.09709539466751756, -0.3162558585988218, 0.06922439488639333, -0.15954845025501893, -0.09216671863722863, -0.056787315280917953, 0.004850167426325026, 0.0216826870614661, -0.2619377815348356, 0.018740776299061825, 0.03409586526686326, 0.14530127565851625, -0.07188152175612089, -0.05079833297755848, 0.011758075357053657, 0.18063727984098768, 0.019480397554152474, -0.011465771379563831, 0.2201959792568925, -0.14058374749697733, -0.09579087622094659, 0.37384659690516336, -0.04444140946606592, -0.2135290399916014, 0.18888098249832788, -0.09579343057822018, -0.012239214254631883, 0.08119437956254372, 0.19012396133561826, 0.07359118217192147, -0.12906584639017482, -0.0353429297382823, 0.044801629889680415, 0.22624665907375058, 0.1462342538106648, -0.017462990718709978, 0.20914778269377543, 0.1943243909722232, 0.013967565774005286, 0.12774937213588583, -0.07083696247154504, 0.01350530029787701, -0.2539287822092978, -0.13213182942701035, -0.16995277350648072, 0.016756895093186314, -0.06237111013120541, -0.17970272082974817, 0.39150081909432705, 0.15531680984644308, 0.1447926039972222, 0.07539548747380878, 0.38404288079564264, 0.05928599594642415, 0.09305057784251007, 0.04712582477146671, 0.19502786823491358, 0.06545070996412969, 0.15646597348647762, -0.22082668003391753, 0.07673112782618018, 0.005346170713694222] |
1,803.02308 | A Relation between Disorder Chaos and Incongruent States in Spin Glasses
on ${\mathbb Z}^d$ | We derive lower bounds for the variance of the difference of energies between
incongruent ground states, i.e., states with edge overlaps strictly less than
one, of the Edwards-Anderson model on ${\mathbb Z}^d$. The bounds highlight a
relation between the existence of incongruent ground states and the absence of
edge disorder chaos. In particular, it suggests that the presence of disorder
chaos is necessary for the variance to be of order less than the volume. In
addition, a relation is established between the scale of disorder chaos and the
size of critical droplets. The results imply a long-conjectured relation
between the droplet theory of Fisher and Huse and the absence of incongruence.
| math.PR cond-mat.dis-nn | we derive lower bounds for the variance of the difference of energies between incongruent ground states ie states with edge overlaps strictly less than one of the edwardsanderson model on mathbb zd the bounds highlight a relation between the existence of incongruent ground states and the absence of edge disorder chaos in particular it suggests that the presence of disorder chaos is necessary for the variance to be of order less than the volume in addition a relation is established between the scale of disorder chaos and the size of critical droplets the results imply a longconjectured relation between the droplet theory of fisher and huse and the absence of incongruence | [['we', 'derive', 'lower', 'bounds', 'for', 'the', 'variance', 'of', 'the', 'difference', 'of', 'energies', 'between', 'incongruent', 'ground', 'states', 'ie', 'states', 'with', 'edge', 'overlaps', 'strictly', 'less', 'than', 'one', 'of', 'the', 'edwardsanderson', 'model', 'on', 'mathbb', 'zd', 'the', 'bounds', 'highlight', 'a', 'relation', 'between', 'the', 'existence', 'of', 'incongruent', 'ground', 'states', 'and', 'the', 'absence', 'of', 'edge', 'disorder', 'chaos', 'in', 'particular', 'it', 'suggests', 'that', 'the', 'presence', 'of', 'disorder', 'chaos', 'is', 'necessary', 'for', 'the', 'variance', 'to', 'be', 'of', 'order', 'less', 'than', 'the', 'volume', 'in', 'addition', 'a', 'relation', 'is', 'established', 'between', 'the', 'scale', 'of', 'disorder', 'chaos', 'and', 'the', 'size', 'of', 'critical', 'droplets', 'the', 'results', 'imply', 'a', 'longconjectured', 'relation', 'between', 'the', 'droplet', 'theory', 'of', 'fisher', 'and', 'huse', 'and', 'the', 'absence', 'of', 'incongruence']] | [-0.15852893382596137, 0.18700261388250902, -0.0795111100080314, 0.1019396940602812, 0.03541742301302719, -0.10119130736560905, 0.08999982617086487, 0.2846583877753064, -0.2057912797176254, -0.28968944313289885, 0.09671172942873929, -0.318160838841855, -0.14156218626125305, 0.1502249214487771, 0.0028563727349932263, 0.01907867684893243, 0.00426427463724001, 0.055299546254949795, -0.08943939749109517, -0.21319317844536928, 0.3397462889279432, 0.019479929612160805, 0.2892123423579678, 0.10042781281696113, 0.04011367085213597, -0.012081367597151716, 0.03452945814409235, 0.020838040191478824, -0.16711517948027216, 0.1329727185190538, 0.1668243368889356, 0.04544453520478832, 0.25406888434411706, -0.4009618232496553, -0.1792311011100406, 0.16778168102373947, 0.10875191169514044, 0.11050518286657764, 0.0014539636568762027, -0.2910933340459156, 0.07984993638269403, -0.1239346158732702, -0.1369410725142639, -0.022160619627348742, 0.06207900989364396, 0.018034143406931345, -0.27780752481372506, 0.17097722830435447, 0.10328215026917557, 0.10394199377949442, -0.052581897852858446, -0.10291523352131113, -0.07822577976663639, 0.13848519537111256, 0.038017430220025815, 0.01603722539394758, 0.07837319433236041, -0.156950363100649, -0.11393924229694447, 0.3529188924192174, -0.04422154701508892, -0.18386698982401475, 0.20456332621911355, -0.18810167695555063, -0.08019262129390561, 0.109247234557663, 0.11437326475877214, 0.059752689976547216, -0.05287864055434192, 0.06672141394527578, -0.020880817490218726, 0.19528999824815238, 0.06822373254040072, 0.08739148414702164, 0.15890659203937463, 0.14245312564234408, 0.13358187265190724, 0.16393445454892358, -0.09561615984945616, -0.14026411075715547, -0.29945430884490143, -0.17544948902014676, -0.23422944193353523, 0.004921172141424708, -0.1410599740065827, -0.1741344265551684, 0.3567062779623377, 0.17044815984932152, 0.20985065821793164, 0.09187128435744829, 0.19673030424091192, 0.10709393141489174, 0.016281793783376883, 0.08084567771964446, 0.2362185756503898, 0.1736641573627387, 0.01989935927495763, -0.25262137402587376, 0.11661188068342404, 0.06652549382399868] |
1,803.02309 | Analysing the Potential of BLE to Support Dynamic Broadcasting Scenarios | In this paper, we present a novel approach for broadcasting information based
on a Bluetooth Low Energy (BLE) ibeacon technology. We propose a dynamic method
that uses a combination of Wi-Fi and BLE technology where every technology
plays a part in a user discovery and broadcasting process. In such system, a
specific ibeacon device broadcasts the information when a user is in proximity.
Using experiments, we conduct a scenario where the system discovers users,
disseminates information, and later we use collected data to examine the system
performance and capability. The results show that our proposed approach has a
promising potential to become a powerful tool in the discovery and broadcasting
concept that can be easily implemented and used in business environments.
| cs.OH | in this paper we present a novel approach for broadcasting information based on a bluetooth low energy ble ibeacon technology we propose a dynamic method that uses a combination of wifi and ble technology where every technology plays a part in a user discovery and broadcasting process in such system a specific ibeacon device broadcasts the information when a user is in proximity using experiments we conduct a scenario where the system discovers users disseminates information and later we use collected data to examine the system performance and capability the results show that our proposed approach has a promising potential to become a powerful tool in the discovery and broadcasting concept that can be easily implemented and used in business environments | [['in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'approach', 'for', 'broadcasting', 'information', 'based', 'on', 'a', 'bluetooth', 'low', 'energy', 'ble', 'ibeacon', 'technology', 'we', 'propose', 'a', 'dynamic', 'method', 'that', 'uses', 'a', 'combination', 'of', 'wifi', 'and', 'ble', 'technology', 'where', 'every', 'technology', 'plays', 'a', 'part', 'in', 'a', 'user', 'discovery', 'and', 'broadcasting', 'process', 'in', 'such', 'system', 'a', 'specific', 'ibeacon', 'device', 'broadcasts', 'the', 'information', 'when', 'a', 'user', 'is', 'in', 'proximity', 'using', 'experiments', 'we', 'conduct', 'a', 'scenario', 'where', 'the', 'system', 'discovers', 'users', 'disseminates', 'information', 'and', 'later', 'we', 'use', 'collected', 'data', 'to', 'examine', 'the', 'system', 'performance', 'and', 'capability', 'the', 'results', 'show', 'that', 'our', 'proposed', 'approach', 'has', 'a', 'promising', 'potential', 'to', 'become', 'a', 'powerful', 'tool', 'in', 'the', 'discovery', 'and', 'broadcasting', 'concept', 'that', 'can', 'be', 'easily', 'implemented', 'and', 'used', 'in', 'business', 'environments']] | [-0.14536276460896547, -0.014875017570270118, -0.09943107218473904, 0.03016250193018809, -0.10361747449256234, -0.20054007939655671, 0.10854327232165123, 0.38222600661279743, -0.2417975831815342, -0.29888002988536005, 0.12000794859010387, -0.28607256837143014, -0.22948662086951832, 0.21360608877629533, -0.08427175905263005, 0.009091406598810322, 0.08052257240619048, 0.06891754760083642, 0.00893275315699183, -0.2044098419714565, 0.2728895095815836, 0.06620915272188457, 0.3344831024527488, 0.08853980022952083, 0.10722828573020067, 0.04265392277282008, -0.005095776536094009, -0.012890460908659234, -0.08503384460219565, 0.13338856856254014, 0.30075553147129963, 0.21429214983301098, 0.35214099792902137, -0.3940022530076036, -0.21662976399587452, 0.07600909941406413, 0.15550537138007398, 0.08758083162521405, -0.1457908394648347, -0.3116100817025939, 0.12501145919307696, -0.26398207271117563, -0.051876872312277555, -0.0712747611576876, -0.03164777513747373, -0.01005774600554473, -0.3294880310966333, -0.013101893278947178, -0.009411986550693361, 0.032665643937239225, -0.018640692657521687, -0.0202903443926268, 0.050306416699693594, 0.1729326787674588, -0.04642575344456598, 0.021194103086359554, 0.14232500964604425, -0.10566628664108532, -0.14978154774847602, 0.37714194766561354, -0.07750433130759346, -0.17128223522127536, 0.20778222337619148, -0.06293574564759273, -0.14551897011389417, 0.04015359324056748, 0.25773353298956697, 0.10736956767216402, -0.20680430510587902, 0.04269358872802551, -0.0004960037229105461, 0.1858686688394586, 0.005704836717860634, 0.06707203432471176, 0.18953374658772829, 0.28112657796706975, 0.09467155231193693, 0.12452905893052567, -0.11786727438496103, -0.03673533602686953, -0.22302555971709656, -0.19526503786198363, -0.22444052387929467, -0.009531229859495088, -0.017877532944443043, -0.06513539905282707, 0.3975436906060897, 0.22593114017290045, 0.1522373422356861, 0.018490074895137598, 0.37633131150433347, 0.033432279171783874, 0.0912773632405957, 0.13773244777540408, 0.16020238658120808, 0.004356167794874877, 0.21617800650410046, -0.126589793854293, 0.06679176050430734, -0.0029990936144570672] |
1,803.0231 | Deep Thermal Imaging: Proximate Material Type Recognition in the Wild
through Deep Learning of Spatial Surface Temperature Patterns | We introduce Deep Thermal Imaging, a new approach for close-range automatic
recognition of materials to enhance the understanding of people and ubiquitous
technologies of their proximal environment. Our approach uses a low-cost mobile
thermal camera integrated into a smartphone to capture thermal textures. A deep
neural network classifies these textures into material types. This approach
works effectively without the need for ambient light sources or direct contact
with materials. Furthermore, the use of a deep learning network removes the
need to handcraft the set of features for different materials. We evaluated the
performance of the system by training it to recognise 32 material types in both
indoor and outdoor environments. Our approach produced recognition accuracies
above 98% in 14,860 images of 15 indoor materials and above 89% in 26,584
images of 17 outdoor materials. We conclude by discussing its potentials for
real-time use in HCI applications and future directions.
| cs.CV cond-mat.mtrl-sci cs.HC cs.LG | we introduce deep thermal imaging a new approach for closerange automatic recognition of materials to enhance the understanding of people and ubiquitous technologies of their proximal environment our approach uses a lowcost mobile thermal camera integrated into a smartphone to capture thermal textures a deep neural network classifies these textures into material types this approach works effectively without the need for ambient light sources or direct contact with materials furthermore the use of a deep learning network removes the need to handcraft the set of features for different materials we evaluated the performance of the system by training it to recognise 32 material types in both indoor and outdoor environments our approach produced recognition accuracies above 98 in 14860 images of 15 indoor materials and above 89 in 26584 images of 17 outdoor materials we conclude by discussing its potentials for realtime use in hci applications and future directions | [['we', 'introduce', 'deep', 'thermal', 'imaging', 'a', 'new', 'approach', 'for', 'closerange', 'automatic', 'recognition', 'of', 'materials', 'to', 'enhance', 'the', 'understanding', 'of', 'people', 'and', 'ubiquitous', 'technologies', 'of', 'their', 'proximal', 'environment', 'our', 'approach', 'uses', 'a', 'lowcost', 'mobile', 'thermal', 'camera', 'integrated', 'into', 'a', 'smartphone', 'to', 'capture', 'thermal', 'textures', 'a', 'deep', 'neural', 'network', 'classifies', 'these', 'textures', 'into', 'material', 'types', 'this', 'approach', 'works', 'effectively', 'without', 'the', 'need', 'for', 'ambient', 'light', 'sources', 'or', 'direct', 'contact', 'with', 'materials', 'furthermore', 'the', 'use', 'of', 'a', 'deep', 'learning', 'network', 'removes', 'the', 'need', 'to', 'handcraft', 'the', 'set', 'of', 'features', 'for', 'different', 'materials', 'we', 'evaluated', 'the', 'performance', 'of', 'the', 'system', 'by', 'training', 'it', 'to', 'recognise', '32', 'material', 'types', 'in', 'both', 'indoor', 'and', 'outdoor', 'environments', 'our', 'approach', 'produced', 'recognition', 'accuracies', 'above', '98', 'in', '14860', 'images', 'of', '15', 'indoor', 'materials', 'and', 'above', '89', 'in', '26584', 'images', 'of', '17', 'outdoor', 'materials', 'we', 'conclude', 'by', 'discussing', 'its', 'potentials', 'for', 'realtime', 'use', 'in', 'hci', 'applications', 'and', 'future', 'directions']] | [-0.07946439678495636, 0.059019997586071696, -0.02401454508507333, 0.03302179201075262, -0.07173855138980613, -0.16304052205832334, 0.06233610512156572, 0.4674152088205831, -0.23465569995242316, -0.368392454865737, 0.06815746920436722, -0.28765011392850554, -0.19627134014573583, 0.23182522893097682, -0.11309647436576839, 0.060182830106172404, 0.10138264766159359, -0.02995626829393512, -0.05507276039633925, -0.23438315735939813, 0.273595847490364, 0.004710157681612906, 0.3423877195819427, 0.06295675876689757, 0.13543885543017464, -0.013298345411348403, -0.013817592523992062, -0.02765938759223894, -0.025141571097030007, 0.18340840753877447, 0.31521697401949744, 0.13249163875090225, 0.26459757951690127, -0.4449137699961358, -0.2815368142165877, 0.07027097417795587, 0.11708506536895733, 0.0919347969089717, -0.07945940128945726, -0.379479731882916, 0.10458358542377534, -0.17110428778885478, -0.08029669931405509, -0.11623775407823982, -0.012181120861296345, -0.013755619589264701, -0.2414162583858231, 0.0021426671526717897, 0.03654868965913054, 0.08837230975080763, -0.12218146008632595, -0.10745984293301875, 0.04742860039030867, 0.185091881187582, -0.020500319135584394, 0.0003474429938752128, 0.21607784632606064, -0.22319669813095105, -0.09967139879000836, 0.3919886799187076, -0.026025638514876263, -0.1528004734162368, 0.250495813538314, -0.036637670300318066, -0.10542644882181874, 0.13639948077398498, 0.2621710073126822, 0.11055926413459032, -0.20435034603412663, -0.0038193954847005455, 0.02883294877615206, 0.13113858443241388, 0.023225706989313064, 0.024916902537518822, 0.22878175205867865, 0.2593080904263509, 0.02492475029529345, 0.1269946838443985, -0.15969152942451895, 0.005673087480775759, -0.18680112207305244, -0.16197319954418304, -0.16682912745405318, 0.004745012501628474, -0.08986628887605486, -0.13591423612618567, 0.40405676237047733, 0.27103132160925336, 0.1623218559476287, 0.03828752897109608, 0.36255535003127287, -0.02153568717935772, 0.13584018116310037, 0.044126657914801116, 0.22317254470287487, 0.015180280872424241, 0.19902230864454087, -0.14396751948416892, 0.027385567419459016, 0.008240084521801902] |
1,803.02311 | Ground-State Magnetization in Mixtures of a Few Ultra-Cold Fermions in
One-Dimensional Traps | Ground-state properties of a few spin-$1/2$ ultra-cold fermions confined in a
one-dimensional trap are studied by the exact diagonalization method. In
contrast to previous studies, it is not assumed that the projection of a spin
of individual particles is fixed. Therefore, the spin is treated as an
additional degree of freedom and the global magnetization of the system is
established spontaneously. Depending on the shape of the trap, inter-particle
interactions, and an external magnetic field, the phase diagram of the system
is determined. It is shown that, for particular confinements, some values of
the magnetization cannot be reached by the ground-state of the system.
| cond-mat.quant-gas | groundstate properties of a few spin12 ultracold fermions confined in a onedimensional trap are studied by the exact diagonalization method in contrast to previous studies it is not assumed that the projection of a spin of individual particles is fixed therefore the spin is treated as an additional degree of freedom and the global magnetization of the system is established spontaneously depending on the shape of the trap interparticle interactions and an external magnetic field the phase diagram of the system is determined it is shown that for particular confinements some values of the magnetization cannot be reached by the groundstate of the system | [['groundstate', 'properties', 'of', 'a', 'few', 'spin12', 'ultracold', 'fermions', 'confined', 'in', 'a', 'onedimensional', 'trap', 'are', 'studied', 'by', 'the', 'exact', 'diagonalization', 'method', 'in', 'contrast', 'to', 'previous', 'studies', 'it', 'is', 'not', 'assumed', 'that', 'the', 'projection', 'of', 'a', 'spin', 'of', 'individual', 'particles', 'is', 'fixed', 'therefore', 'the', 'spin', 'is', 'treated', 'as', 'an', 'additional', 'degree', 'of', 'freedom', 'and', 'the', 'global', 'magnetization', 'of', 'the', 'system', 'is', 'established', 'spontaneously', 'depending', 'on', 'the', 'shape', 'of', 'the', 'trap', 'interparticle', 'interactions', 'and', 'an', 'external', 'magnetic', 'field', 'the', 'phase', 'diagram', 'of', 'the', 'system', 'is', 'determined', 'it', 'is', 'shown', 'that', 'for', 'particular', 'confinements', 'some', 'values', 'of', 'the', 'magnetization', 'can', 'not', 'be', 'reached', 'by', 'the', 'groundstate', 'of', 'the', 'system']] | [-0.1867112640901247, 0.2096694297492615, -0.06197170326319922, 0.016378879394116145, 0.0008724217059179431, -0.13208306807403764, 0.009160326077558454, 0.38477042069037753, -0.23627097053187235, -0.2844648891860353, 0.06660331777474356, -0.25700200954895647, -0.07828416857158854, 0.17197421253437087, 0.039913309933174226, 0.037234086302868535, 0.009305844668831144, 0.08110009475078966, -0.07610865088534496, -0.23874010660109066, 0.28188295889024934, 0.032822792196557635, 0.24082791941861312, 0.07755823757144667, 0.08195642585910502, 0.01965763416983897, 0.09569420288538649, 0.03287291351395349, -0.11373528631118547, 0.059777122301359974, 0.14800419867748305, -0.0010586466861977463, 0.20035953814429897, -0.4233826826370898, -0.20759909346344926, 0.09910078933905987, 0.19015982844201582, 0.16754216907900712, -0.023414040051977194, -0.2947531542607716, 0.011544728569597715, -0.15737112013171317, -0.18932758797669694, -0.10719748979345674, 0.0034611009028074997, 0.04887007295730568, -0.25665456967517025, 0.06912478126940273, 0.09598358426287415, 0.1030745668780236, -0.08779003207261364, -0.08549672919658145, -0.056943023541853544, 0.10945269675659282, 0.04892384605482221, 0.06679616402834654, 0.16278423574708756, -0.1547002580399359, -0.0722159843248803, 0.3899948671105362, -0.02803237272559532, -0.22161844646463924, 0.18164061546059593, -0.17507001236302866, -0.07979537997660892, 0.1499858294901926, 0.0985838327645546, 0.12485891970850173, -0.1816379011142999, 0.1048734568802285, -0.07311162744604406, 0.1956310339369035, 0.004084925233785596, 0.025938906405298483, 0.2322974248035323, 0.16583095997172806, 0.07244580339285589, 0.16254885464441032, -0.08308530558798728, -0.11784350625461056, -0.2546028586015815, -0.1417526871176614, -0.2905012666824318, 0.03192178564228622, -0.05648886371110123, -0.15079358033032067, 0.40054446328874854, 0.12130769249384425, 0.18056094917424378, -0.05802633303350636, 0.2570467131478446, 0.14367216534446925, 0.061455678961993686, 0.021389352705418353, 0.2873345846412814, 0.17328398228135136, 0.07197208516521468, -0.29789517832299073, 0.05159261790325954, 0.04165362400845403] |
1,803.02312 | Dimensionality Reduction for Stationary Time Series via Stochastic
Nonconvex Optimization | Stochastic optimization naturally arises in machine learning. Efficient
algorithms with provable guarantees, however, are still largely missing, when
the objective function is nonconvex and the data points are dependent. This
paper studies this fundamental challenge through a streaming PCA problem for
stationary time series data. Specifically, our goal is to estimate the
principle component of time series data with respect to the covariance matrix
of the stationary distribution. Computationally, we propose a variant of Oja's
algorithm combined with downsampling to control the bias of the stochastic
gradient caused by the data dependency. Theoretically, we quantify the
uncertainty of our proposed stochastic algorithm based on diffusion
approximations. This allows us to prove the asymptotic rate of convergence and
further implies near optimal asymptotic sample complexity. Numerical
experiments are provided to support our analysis.
| cs.LG math.OC stat.ML | stochastic optimization naturally arises in machine learning efficient algorithms with provable guarantees however are still largely missing when the objective function is nonconvex and the data points are dependent this paper studies this fundamental challenge through a streaming pca problem for stationary time series data specifically our goal is to estimate the principle component of time series data with respect to the covariance matrix of the stationary distribution computationally we propose a variant of ojas algorithm combined with downsampling to control the bias of the stochastic gradient caused by the data dependency theoretically we quantify the uncertainty of our proposed stochastic algorithm based on diffusion approximations this allows us to prove the asymptotic rate of convergence and further implies near optimal asymptotic sample complexity numerical experiments are provided to support our analysis | [['stochastic', 'optimization', 'naturally', 'arises', 'in', 'machine', 'learning', 'efficient', 'algorithms', 'with', 'provable', 'guarantees', 'however', 'are', 'still', 'largely', 'missing', 'when', 'the', 'objective', 'function', 'is', 'nonconvex', 'and', 'the', 'data', 'points', 'are', 'dependent', 'this', 'paper', 'studies', 'this', 'fundamental', 'challenge', 'through', 'a', 'streaming', 'pca', 'problem', 'for', 'stationary', 'time', 'series', 'data', 'specifically', 'our', 'goal', 'is', 'to', 'estimate', 'the', 'principle', 'component', 'of', 'time', 'series', 'data', 'with', 'respect', 'to', 'the', 'covariance', 'matrix', 'of', 'the', 'stationary', 'distribution', 'computationally', 'we', 'propose', 'a', 'variant', 'of', 'ojas', 'algorithm', 'combined', 'with', 'downsampling', 'to', 'control', 'the', 'bias', 'of', 'the', 'stochastic', 'gradient', 'caused', 'by', 'the', 'data', 'dependency', 'theoretically', 'we', 'quantify', 'the', 'uncertainty', 'of', 'our', 'proposed', 'stochastic', 'algorithm', 'based', 'on', 'diffusion', 'approximations', 'this', 'allows', 'us', 'to', 'prove', 'the', 'asymptotic', 'rate', 'of', 'convergence', 'and', 'further', 'implies', 'near', 'optimal', 'asymptotic', 'sample', 'complexity', 'numerical', 'experiments', 'are', 'provided', 'to', 'support', 'our', 'analysis']] | [-0.09186899586877023, -0.015917037051015843, -0.12099885007112542, 0.08214355954480583, -0.11052757623485487, -0.10443144497659171, 0.08350483312670169, 0.3910299676107102, -0.3370189554707119, -0.3055085397142896, 0.13777399723061756, -0.250038043954026, -0.1615814075052957, 0.18593194987624884, -0.11179278917949308, 0.15716296024479423, 0.09493677220730619, -0.01752308034338057, -0.05431216699424002, -0.2717283051319872, 0.29413093356627296, 0.08619300333895918, 0.337393432199447, -0.008277574490586465, 0.12806967866984478, 0.008523336071944372, -0.06539817934566544, 0.007912946554521719, -0.0988139882172232, 0.15924287031036025, 0.27500462371178647, 0.17243488724378755, 0.358299703781747, -0.41692519987284893, -0.169479250182948, 0.1323850015041623, 0.16473246018854712, 0.10842538141701935, -0.053752330427276764, -0.24273432111085363, 0.09888019491600888, -0.09914037029287129, -0.08793143450395402, -0.11488274643444597, -0.05229157515603936, 0.031922738684277814, -0.35208226941794046, 0.11007732821445008, 0.06306657298453942, 0.022423691864153654, -0.0524814405278338, -0.09240427784000833, 0.06577451057753271, 0.07736725991509791, 0.11397042254931435, 0.024986469017511063, 0.10739928697479297, -0.056439522461556466, -0.12379154849490574, 0.3329665653873235, -0.07210812025886933, -0.2224791097625822, 0.16025546116394584, -0.09621971437996818, -0.16847270387436517, 0.14210163318432134, 0.233674981518451, 0.13223603709643197, -0.1689160719896873, 0.07917649113259165, -0.025940629445496157, 0.15365069572087095, -0.025628860071513125, -0.006840767423537644, 0.09692393842851743, 0.20700490031087998, 0.12812633018863076, 0.14937865454350796, -0.08623726820312158, -0.12583141274058796, -0.2672774950712637, -0.10061867503011881, -0.21610787946723797, -0.006103189640050528, -0.14409504909483736, -0.16180743147252183, 0.3668158647293846, 0.19905582484506973, 0.19742273344926423, 0.13916716049425304, 0.3497054892994294, 0.14207699349781527, 0.0021399670583901534, 0.1333503667688505, 0.20374289770067358, 0.13046789531610115, 0.08894288106680368, -0.25105825300808204, 0.12743719822416702, 0.04369335852662158] |
1,803.02313 | Methods for separation of deuterons produced in the medium and in jets
in high energy collisions | Coalescence has long been used to describe the production of light
(anti-)nuclei in heavy ion collisions. The same underlying mechanism may also
exist in jets when a proton and a neutron are close enough in phase space to
form a deuteron. We model deuteron production in jets by applying an
afterburner to protons and neutrons produced in PYTHIA for $p$+$p$ collisions
at a center of mass energy $\sqrt{s} =$ 7 TeV. PYTHIA provides a reasonable
description of the proton spectra and the shape of the deuteron spectrum
predicted by the afterburner is in agreement with the data. We show that the
rise in the coalescence parameter $B_2$ with momentum observed in data is
consistent with coalescence in jets. We show that di-hadron correlations can be
used to separate the contributions from the jet and the underlying event. This
model predicts that the conditional coalescence parameter in the jet-like
correlation should be independent of the trigger momentum.
| hep-ph nucl-th | coalescence has long been used to describe the production of light antinuclei in heavy ion collisions the same underlying mechanism may also exist in jets when a proton and a neutron are close enough in phase space to form a deuteron we model deuteron production in jets by applying an afterburner to protons and neutrons produced in pythia for pp collisions at a center of mass energy sqrts 7 tev pythia provides a reasonable description of the proton spectra and the shape of the deuteron spectrum predicted by the afterburner is in agreement with the data we show that the rise in the coalescence parameter b_2 with momentum observed in data is consistent with coalescence in jets we show that dihadron correlations can be used to separate the contributions from the jet and the underlying event this model predicts that the conditional coalescence parameter in the jetlike correlation should be independent of the trigger momentum | [['coalescence', 'has', 'long', 'been', 'used', 'to', 'describe', 'the', 'production', 'of', 'light', 'antinuclei', 'in', 'heavy', 'ion', 'collisions', 'the', 'same', 'underlying', 'mechanism', 'may', 'also', 'exist', 'in', 'jets', 'when', 'a', 'proton', 'and', 'a', 'neutron', 'are', 'close', 'enough', 'in', 'phase', 'space', 'to', 'form', 'a', 'deuteron', 'we', 'model', 'deuteron', 'production', 'in', 'jets', 'by', 'applying', 'an', 'afterburner', 'to', 'protons', 'and', 'neutrons', 'produced', 'in', 'pythia', 'for', 'pp', 'collisions', 'at', 'a', 'center', 'of', 'mass', 'energy', 'sqrts', '7', 'tev', 'pythia', 'provides', 'a', 'reasonable', 'description', 'of', 'the', 'proton', 'spectra', 'and', 'the', 'shape', 'of', 'the', 'deuteron', 'spectrum', 'predicted', 'by', 'the', 'afterburner', 'is', 'in', 'agreement', 'with', 'the', 'data', 'we', 'show', 'that', 'the', 'rise', 'in', 'the', 'coalescence', 'parameter', 'b_2', 'with', 'momentum', 'observed', 'in', 'data', 'is', 'consistent', 'with', 'coalescence', 'in', 'jets', 'we', 'show', 'that', 'dihadron', 'correlations', 'can', 'be', 'used', 'to', 'separate', 'the', 'contributions', 'from', 'the', 'jet', 'and', 'the', 'underlying', 'event', 'this', 'model', 'predicts', 'that', 'the', 'conditional', 'coalescence', 'parameter', 'in', 'the', 'jetlike', 'correlation', 'should', 'be', 'independent', 'of', 'the', 'trigger', 'momentum']] | [-0.04599378335199529, 0.22601875258513893, -0.1550741730678466, 0.18027957150667545, -0.019131889849180177, -0.0592854677571825, -0.05385308320964537, 0.3795407557364313, -0.2062134446546195, -0.29256092849518023, -0.053410581846330914, -0.3255562912432417, 0.05431359442732026, 0.17355257725012638, 0.044613099140265296, 0.04976740690969652, 0.12635776591900316, 0.015964155151478705, -0.048058863173449234, -0.16490879431442027, 0.31316719633121526, 0.13874072720326724, 0.2208751864971653, 0.11150665041660109, 0.07323582053499957, 0.02619979462526258, -0.007948182407586324, -0.017387021876939183, -0.10637420723285158, 0.04124255487432463, 0.24105812167568552, 0.08528045569729593, 0.1175059786916057, -0.41925491724283465, -0.15867274615072435, 0.10684719338051735, 0.16507133518555953, 0.11072600455259934, -0.07587852408628791, -0.23178786509820531, 0.09066411586057756, -0.25506753129584175, -0.128206769340942, -0.03893800547286387, 0.013374941546710269, 0.05467481464748421, -0.31503820031460733, 0.09289882153389044, 0.018900538129626863, -0.005470279054415803, -0.052307654601792174, -0.10435745281377627, -0.0921703611079964, 0.019975317040676132, 0.12072643735145609, 0.12678367245131203, 0.14537266162374327, -0.12875501460005198, -0.16604117748079703, 0.3822038182207654, -0.005747194068446274, -0.14914781565387403, 0.16958821957269984, -0.23535395869234157, -0.14327200237180918, 0.19440080847200608, 0.24662949227157138, 0.05965710986544558, -0.18673143846540516, 0.016740902571848803, -0.0005824459296080374, 0.19786725573876832, 0.07525838178943002, 0.018429752794092508, 0.20426641392010836, 0.21690535306359732, -0.05916470919525431, 0.10240715180022357, -0.15321158898633816, -0.06809178810686835, -0.37010846774604533, -0.09626128646815496, -0.13633362249351078, 0.04334157121202518, -0.07593472893462486, -0.06393064559106865, 0.3748637753944363, 0.09259132757677786, 0.30267136783128784, -0.05222538879231339, 0.282540837347868, 0.07700860888637122, 0.07449759852832123, 0.1308733981643473, 0.3194093280640851, 0.12916880761603675, 0.15077401243991428, -0.21485656971344724, 0.09266591128863154, 0.03739720959096186] |
1,803.02314 | The generalised Baker--Schmidt problem on hypersurfaces | The Generalised Baker--Schmidt Problem (1970) concerns the $f$-dimensional
Hausdorff measure of the set of $\psi$-approximable points on a nondegenerate
manifold. There are two variants of this problem, concerning simultaneous and
dual approximation. Beresnevich--Dickinson--Velani (in 2006, for the
homogeneous setting) and Badziahin--Beresnevich--Velani (in 2013, for the
inhomogeneous setting) proved the divergence part of this problem for dual
approximation on arbitrary nondegenerate manifolds. The corresponding
convergence counterpart represents a major challenging open question and the
progress thus far has only been attained over planar curves. In this paper, we
settle this problem for hypersurfaces in a more general setting, i.e. for
inhomogeneous approximations and with a non-monotonic multivariable
approximating function.
| math.NT | the generalised bakerschmidt problem 1970 concerns the fdimensional hausdorff measure of the set of psiapproximable points on a nondegenerate manifold there are two variants of this problem concerning simultaneous and dual approximation beresnevichdickinsonvelani in 2006 for the homogeneous setting and badziahinberesnevichvelani in 2013 for the inhomogeneous setting proved the divergence part of this problem for dual approximation on arbitrary nondegenerate manifolds the corresponding convergence counterpart represents a major challenging open question and the progress thus far has only been attained over planar curves in this paper we settle this problem for hypersurfaces in a more general setting ie for inhomogeneous approximations and with a nonmonotonic multivariable approximating function | [['the', 'generalised', 'bakerschmidt', 'problem', '1970', 'concerns', 'the', 'fdimensional', 'hausdorff', 'measure', 'of', 'the', 'set', 'of', 'psiapproximable', 'points', 'on', 'a', 'nondegenerate', 'manifold', 'there', 'are', 'two', 'variants', 'of', 'this', 'problem', 'concerning', 'simultaneous', 'and', 'dual', 'approximation', 'beresnevichdickinsonvelani', 'in', '2006', 'for', 'the', 'homogeneous', 'setting', 'and', 'badziahinberesnevichvelani', 'in', '2013', 'for', 'the', 'inhomogeneous', 'setting', 'proved', 'the', 'divergence', 'part', 'of', 'this', 'problem', 'for', 'dual', 'approximation', 'on', 'arbitrary', 'nondegenerate', 'manifolds', 'the', 'corresponding', 'convergence', 'counterpart', 'represents', 'a', 'major', 'challenging', 'open', 'question', 'and', 'the', 'progress', 'thus', 'far', 'has', 'only', 'been', 'attained', 'over', 'planar', 'curves', 'in', 'this', 'paper', 'we', 'settle', 'this', 'problem', 'for', 'hypersurfaces', 'in', 'a', 'more', 'general', 'setting', 'ie', 'for', 'inhomogeneous', 'approximations', 'and', 'with', 'a', 'nonmonotonic', 'multivariable', 'approximating', 'function']] | [-0.1256583179555886, 0.016280647634115634, -0.05401919481678391, 0.08941888225809583, -0.04950357149003671, -0.11273237564688865, 0.04257540788857336, 0.3390911495629347, -0.26894106666386164, -0.24364156550112762, 0.13903091173346663, -0.25445561089447505, -0.146665707772009, 0.20969327649909933, -0.12954302840176443, 0.08573320214548763, 0.07475585670140132, 0.017824990784679102, -0.07679495220687592, -0.2861049975584841, 0.3769036854951168, -0.019724810851808144, 0.2517460017280548, 0.07057295702309963, 0.1451622598062111, 0.03979763697024505, -0.013607152737677097, 0.04898589837720688, -0.15704179425143971, 0.1423367765086334, 0.2643166504589454, 0.09343069109446281, 0.3114534219867497, -0.3516271980655081, -0.20759268770354605, 0.1781383696861152, 0.12946796926388623, 0.06963301259356569, -0.01568451899233964, -0.24466026618303555, 0.05876923108666714, -0.10008585140908594, -0.18200824823986106, -0.03425824835035458, 0.06582119085228527, -0.04403687715266814, -0.2615731327601199, 0.07027686250018272, 0.12295777576438477, 0.07344625316525125, -0.08452519236290652, -0.09133168898483317, 0.08846090483821858, 0.08350678136624959, 0.01079823024008634, 0.08074934243329994, -0.011309407818359587, -0.10089442842060102, -0.11921185175756449, 0.35250509533820285, -0.04407751218872672, -0.2421836518476067, 0.1588257320064893, -0.11843376601431167, -0.1655535388184395, 0.09477795169794194, 0.18001840879508066, 0.17701526449220079, -0.1186356972287989, 0.18624917888477938, -0.11469948419176464, 0.05653921171543979, 0.13865108002978815, -0.01678542304896082, 0.1434041769573254, 0.1313681178308918, 0.14347407466046652, 0.16650833240995747, 0.013070505775757274, -0.13157990307795359, -0.2716955832768021, -0.1406159293793915, -0.16310469120881468, 0.09733479495494152, -0.071100419215344, -0.1944782327298286, 0.3769262215684889, 0.06476523293476587, 0.18735556377159468, 0.06969417299512985, 0.2569571108917512, 0.12458329497441707, -0.04939904877419566, 0.11880049699003685, 0.21519626335038822, 0.17700384683986106, 0.08212830068846673, -0.1462866946360764, 0.04252643054483002, 0.11547377619470628] |
1,803.02315 | Comparison of Deep Learning Approaches for Multi-Label Chest X-Ray
Classification | The increased availability of X-ray image archives (e.g. the ChestX-ray14
dataset from the NIH Clinical Center) has triggered a growing interest in deep
learning techniques. To provide better insight into the different approaches,
and their applications to chest X-ray classification, we investigate a powerful
network architecture in detail: the ResNet-50. Building on prior work in this
domain, we consider transfer learning with and without fine-tuning as well as
the training of a dedicated X-ray network from scratch. To leverage the high
spatial resolution of X-ray data, we also include an extended ResNet-50
architecture, and a network integrating non-image data (patient age, gender and
acquisition type) in the classification process. In a concluding experiment, we
also investigate multiple ResNet depths (i.e. ResNet-38 and ResNet-101). In a
systematic evaluation, using 5-fold re-sampling and a multi-label loss
function, we compare the performance of the different approaches for pathology
classification by ROC statistics and analyze differences between the
classifiers using rank correlation. Overall, we observe a considerable spread
in the achieved performance and conclude that the X-ray-specific ResNet-38,
integrating non-image data yields the best overall results. Furthermore, class
activation maps are used to understand the classification process, and a
detailed analysis of the impact of non-image features is provided.
| cs.CV | the increased availability of xray image archives eg the chestxray14 dataset from the nih clinical center has triggered a growing interest in deep learning techniques to provide better insight into the different approaches and their applications to chest xray classification we investigate a powerful network architecture in detail the resnet50 building on prior work in this domain we consider transfer learning with and without finetuning as well as the training of a dedicated xray network from scratch to leverage the high spatial resolution of xray data we also include an extended resnet50 architecture and a network integrating nonimage data patient age gender and acquisition type in the classification process in a concluding experiment we also investigate multiple resnet depths ie resnet38 and resnet101 in a systematic evaluation using 5fold resampling and a multilabel loss function we compare the performance of the different approaches for pathology classification by roc statistics and analyze differences between the classifiers using rank correlation overall we observe a considerable spread in the achieved performance and conclude that the xrayspecific resnet38 integrating nonimage data yields the best overall results furthermore class activation maps are used to understand the classification process and a detailed analysis of the impact of nonimage features is provided | [['the', 'increased', 'availability', 'of', 'xray', 'image', 'archives', 'eg', 'the', 'chestxray14', 'dataset', 'from', 'the', 'nih', 'clinical', 'center', 'has', 'triggered', 'a', 'growing', 'interest', 'in', 'deep', 'learning', 'techniques', 'to', 'provide', 'better', 'insight', 'into', 'the', 'different', 'approaches', 'and', 'their', 'applications', 'to', 'chest', 'xray', 'classification', 'we', 'investigate', 'a', 'powerful', 'network', 'architecture', 'in', 'detail', 'the', 'resnet50', 'building', 'on', 'prior', 'work', 'in', 'this', 'domain', 'we', 'consider', 'transfer', 'learning', 'with', 'and', 'without', 'finetuning', 'as', 'well', 'as', 'the', 'training', 'of', 'a', 'dedicated', 'xray', 'network', 'from', 'scratch', 'to', 'leverage', 'the', 'high', 'spatial', 'resolution', 'of', 'xray', 'data', 'we', 'also', 'include', 'an', 'extended', 'resnet50', 'architecture', 'and', 'a', 'network', 'integrating', 'nonimage', 'data', 'patient', 'age', 'gender', 'and', 'acquisition', 'type', 'in', 'the', 'classification', 'process', 'in', 'a', 'concluding', 'experiment', 'we', 'also', 'investigate', 'multiple', 'resnet', 'depths', 'ie', 'resnet38', 'and', 'resnet101', 'in', 'a', 'systematic', 'evaluation', 'using', '5fold', 'resampling', 'and', 'a', 'multilabel', 'loss', 'function', 'we', 'compare', 'the', 'performance', 'of', 'the', 'different', 'approaches', 'for', 'pathology', 'classification', 'by', 'roc', 'statistics', 'and', 'analyze', 'differences', 'between', 'the', 'classifiers', 'using', 'rank', 'correlation', 'overall', 'we', 'observe', 'a', 'considerable', 'spread', 'in', 'the', 'achieved', 'performance', 'and', 'conclude', 'that', 'the', 'xrayspecific', 'resnet38', 'integrating', 'nonimage', 'data', 'yields', 'the', 'best', 'overall', 'results', 'furthermore', 'class', 'activation', 'maps', 'are', 'used', 'to', 'understand', 'the', 'classification', 'process', 'and', 'a', 'detailed', 'analysis', 'of', 'the', 'impact', 'of', 'nonimage', 'features', 'is', 'provided']] | [-0.017635076346706746, -0.029831293367369296, -0.0650040698271957, 0.09660525607495063, -0.07237343593984477, -0.12157068157017313, 0.08083678530095437, 0.4590696548897826, -0.2423520748156543, -0.3399427431891216, 0.10599213892162558, -0.29772756303496223, -0.16108488926992698, 0.22503140140792774, -0.11357242066593494, 0.06438218309759737, 0.13974890767541878, 0.020119998744585067, -0.10205540961846161, -0.28348736061004687, 0.3019270789421474, 0.07728266483729171, 0.366864113301477, 0.05048913366216071, 0.10740553629105254, -0.013563255930100293, -0.07934081970483485, -0.01054673070001288, -0.07797127779346791, 0.16485211415006323, 0.28311159015021414, 0.19713744191240573, 0.2965546824773043, -0.3834873564066548, -0.24438872554467297, 0.07852557009113405, 0.13660024977013796, 0.07160007068587755, -0.04574511548294229, -0.305136544132313, 0.078254418455603, -0.19047116790270416, -0.015616656678235707, -0.09622536287369098, -0.03856239167861549, 0.0039135461294220065, -0.2684848867465203, 0.051573225105005574, 0.038710353013205655, 0.12440859733660724, -0.09438615141769725, -0.11993066950555087, 0.01499068126077855, 0.178784393242049, 0.021094008609390015, 0.05174789692768279, 0.13746197516208186, -0.19705791396543146, -0.13648204875889683, 0.3189552327853116, -0.054005351199485435, -0.1518897188612826, 0.20050428473098458, -0.06477706433118631, -0.1527574522507505, 0.0930741284745654, 0.24315551968346186, 0.06845853914059905, -0.16080768845801918, -0.008834307570770547, 0.010134101867009247, 0.20183530343267336, 0.05315939119706551, -0.009698332216608905, 0.16185394878894108, 0.27830116838837665, -0.0189640623421463, 0.17138202665213897, -0.18244761901145218, -0.012800120328571283, -0.20879974226066705, -0.12645730211835482, -0.14765416401525155, 0.023353522025418523, -0.10280064705183772, -0.11887444436148394, 0.41181366189894286, 0.18248135637144977, 0.22961711045811137, 0.07143933277043021, 0.3136878837249242, 0.0139554670005215, 0.11784440078704125, 0.055095506316123935, 0.19346477390054667, 0.02933411176986827, 0.1335019144599381, -0.1938196119079686, 0.056295624218525034, -0.0030220136578267844] |
1,803.02316 | Precision Light Curves from TESS Full-Frame Images: A Difference Imaging
Approach | The Transiting Exoplanet Survey Satellite (TESS) will observe
$\sim$150~million stars brighter than $T_{\rm mag} \approx 16$, with
photometric precision from 60~ppm to 3~percent, enabling an array of exoplanet
and stellar astrophysics investigations.While light curves will be provided for
$\sim$400,000 targets observed at 2-min cadence, observations of most stars
will only be provided as full-frame images (FFIs) at 30~min cadence. The TESS
image scale of $\sim21$''/pix is highly susceptible to crowding, blending, and
source confusion, and the highly spatially variable point spread function (PSF)
will challenge traditional techniques, such as aperture and Gaussian-kernel PSF
photometry. We use official "End-to-End~6" TESS simulated FFIs to demonstrate a
difference image analysis pipeline, using a $\delta$-function kernel,that
achieves the mission specification noise floor of 60~ppm~hr$^{-1/2}$. We show
that the pipeline performance does not depend on position across the field, and
only $\sim$2\% of stars appear to exhibit residual systematics at the level of
$\sim$5~ppt. We also demonstrate recoverability of planet transits, eclipsing
binaries, and other variables. We provide the pipeline as an open-source tool
at https://github.com/ryanoelkers/DIA in both IDL and PYTHON. We intend to
extract light curves for all point sources in the \textit{TESS} FFIs as soon as
they become publicly available, and will provide the light curves through the
Filtergraph data visualization service. An example data portal based on the
simulated FFIs is available for inspection at https://filtergraph.com/tess_ffi.
| astro-ph.IM | the transiting exoplanet survey satellite tess will observe sim150million stars brighter than t_rm mag approx 16 with photometric precision from 60ppm to 3percent enabling an array of exoplanet and stellar astrophysics investigationswhile light curves will be provided for sim400000 targets observed at 2min cadence observations of most stars will only be provided as fullframe images ffis at 30min cadence the tess image scale of sim21pix is highly susceptible to crowding blending and source confusion and the highly spatially variable point spread function psf will challenge traditional techniques such as aperture and gaussiankernel psf photometry we use official endtoend6 tess simulated ffis to demonstrate a difference image analysis pipeline using a deltafunction kernelthat achieves the mission specification noise floor of 60ppmhr12 we show that the pipeline performance does not depend on position across the field and only sim2 of stars appear to exhibit residual systematics at the level of sim5ppt we also demonstrate recoverability of planet transits eclipsing binaries and other variables we provide the pipeline as an opensource tool at httpsgithubcomryanoelkersdia in both idl and python we intend to extract light curves for all point sources in the textittess ffis as soon as they become publicly available and will provide the light curves through the filtergraph data visualization service an example data portal based on the simulated ffis is available for inspection at httpsfiltergraphcomtess_ffi | [['the', 'transiting', 'exoplanet', 'survey', 'satellite', 'tess', 'will', 'observe', 'sim150million', 'stars', 'brighter', 'than', 't_rm', 'mag', 'approx', '16', 'with', 'photometric', 'precision', 'from', '60ppm', 'to', '3percent', 'enabling', 'an', 'array', 'of', 'exoplanet', 'and', 'stellar', 'astrophysics', 'investigationswhile', 'light', 'curves', 'will', 'be', 'provided', 'for', 'sim400000', 'targets', 'observed', 'at', '2min', 'cadence', 'observations', 'of', 'most', 'stars', 'will', 'only', 'be', 'provided', 'as', 'fullframe', 'images', 'ffis', 'at', '30min', 'cadence', 'the', 'tess', 'image', 'scale', 'of', 'sim21pix', 'is', 'highly', 'susceptible', 'to', 'crowding', 'blending', 'and', 'source', 'confusion', 'and', 'the', 'highly', 'spatially', 'variable', 'point', 'spread', 'function', 'psf', 'will', 'challenge', 'traditional', 'techniques', 'such', 'as', 'aperture', 'and', 'gaussiankernel', 'psf', 'photometry', 'we', 'use', 'official', 'endtoend6', 'tess', 'simulated', 'ffis', 'to', 'demonstrate', 'a', 'difference', 'image', 'analysis', 'pipeline', 'using', 'a', 'deltafunction', 'kernelthat', 'achieves', 'the', 'mission', 'specification', 'noise', 'floor', 'of', '60ppmhr12', 'we', 'show', 'that', 'the', 'pipeline', 'performance', 'does', 'not', 'depend', 'on', 'position', 'across', 'the', 'field', 'and', 'only', 'sim2', 'of', 'stars', 'appear', 'to', 'exhibit', 'residual', 'systematics', 'at', 'the', 'level', 'of', 'sim5ppt', 'we', 'also', 'demonstrate', 'recoverability', 'of', 'planet', 'transits', 'eclipsing', 'binaries', 'and', 'other', 'variables', 'we', 'provide', 'the', 'pipeline', 'as', 'an', 'opensource', 'tool', 'at', 'httpsgithubcomryanoelkersdia', 'in', 'both', 'idl', 'and', 'python', 'we', 'intend', 'to', 'extract', 'light', 'curves', 'for', 'all', 'point', 'sources', 'in', 'the', 'textittess', 'ffis', 'as', 'soon', 'as', 'they', 'become', 'publicly', 'available', 'and', 'will', 'provide', 'the', 'light', 'curves', 'through', 'the', 'filtergraph', 'data', 'visualization', 'service', 'an', 'example', 'data', 'portal', 'based', 'on', 'the', 'simulated', 'ffis', 'is', 'available', 'for', 'inspection', 'at', 'httpsfiltergraphcomtess_ffi']] | [-0.056046668764521586, 0.07490027782812624, -0.11072634851507031, 0.08943254684685108, -0.13644176686924145, -0.130217177322205, 0.06773140294128649, 0.44175511648463556, -0.19891593652452955, -0.3750311195567886, 0.14132544638641992, -0.3561805219133495, -0.0831613850876936, 0.30240342057182046, -0.11381482824868572, 0.03972631134810058, 0.16997871518916322, -0.049862142751308965, -0.016998692417309853, -0.32099020802879363, 0.22862542759168064, 0.08019082837901409, 0.16434249886580835, -0.029119042017589813, 0.07566154219753052, -0.007709591954028437, -0.09534577611101111, -0.045436386945900194, -0.11518223105695444, 0.0141622542769988, 0.2909761279616152, 0.20077418918628687, 0.1976063052827925, -0.3408780360111075, -0.1827518630770622, 0.04939925588305457, 0.17334945925557765, 0.05477156219408093, -0.0365133121040301, -0.29941102441718087, 0.059145122711321614, -0.13633981920222607, -0.1518020937508921, -0.06288702121684195, 0.015669695680996323, 0.03768936823170756, -0.24659336835887477, 0.01460793334370042, -0.024941584907507443, 0.1739239015779789, -0.08060484745548553, -0.1370170004120327, -0.0660020877128264, 0.1353917432114729, -0.03588945240938762, 0.09089864176831548, 0.13522576548432783, -0.12739134550489645, -0.016844180664180013, 0.3986885139798101, -0.11345219204095534, -0.05475076062878444, 0.15771114254498333, -0.15096552170795427, -0.13848229723880995, 0.12231982558561816, 0.21254669722628677, 0.09290853777119086, -0.18975511106543277, -0.01635099712414976, 0.06266977207490212, 0.260692831263734, 0.05393521891138847, 0.05888740605094263, 0.31227601677183753, 0.1756022298328967, 0.07097442721191052, 0.08687748791847458, -0.2993753327131801, 0.022503518802334522, -0.24969347945516002, -0.1053594801766948, -0.15106263599894781, 0.012030074235575464, -0.08773306225728844, -0.14780742005002023, 0.35286211062187406, 0.2077454633784444, 0.1221343387907009, 0.047812641405592056, 0.349098530059495, 0.036533816344042916, 0.1054284041328135, 0.08483733775389879, 0.2556167378038459, 0.04712855511745526, 0.12058710713039916, -0.1494923860841029, 0.03092492643111469, -0.04882319443373637] |
1,803.02317 | Conical Morris-Thorne Wormholes with a Global Monopole Charge | In this paper we have established an asymptotically conical Morris-Thorne
wormhole solution supported by anisotropic matter fluid and a global monopole
charge in the framework of a $1+3$ dimensional gravity minimally coupled to a
triplet of scalar fields $\phi^a$, resulting from the breaking of a global
$O(3)$ symmetry. For the anisotropic matter fluid we have considered the
equation of state (EoS) given by $\mathcal{P}_r=\omega \rho$, with a
consequence $\omega<-1$, implying a so-called phantom energy at the throat of
the wormhole which violates the energy conditions. In addition, we study the
weak gravitational lensing effect using the Gauss-Bonnet theorem (GBT) applied
to the wormhole optical geometry. We show that the total deflection angle
consists of a term given by $4\pi^2 \eta^2 $, which is independent from the
impact parameter $b$, and an additional term which depends on the radius of the
wormhole throat $b_0$ as well as the dimensionless constant $\zeta$.
| gr-qc | in this paper we have established an asymptotically conical morristhorne wormhole solution supported by anisotropic matter fluid and a global monopole charge in the framework of a 13 dimensional gravity minimally coupled to a triplet of scalar fields phia resulting from the breaking of a global o3 symmetry for the anisotropic matter fluid we have considered the equation of state eos given by mathcalp_romega rho with a consequence omega1 implying a socalled phantom energy at the throat of the wormhole which violates the energy conditions in addition we study the weak gravitational lensing effect using the gaussbonnet theorem gbt applied to the wormhole optical geometry we show that the total deflection angle consists of a term given by 4pi2 eta2 which is independent from the impact parameter b and an additional term which depends on the radius of the wormhole throat b_0 as well as the dimensionless constant zeta | [['in', 'this', 'paper', 'we', 'have', 'established', 'an', 'asymptotically', 'conical', 'morristhorne', 'wormhole', 'solution', 'supported', 'by', 'anisotropic', 'matter', 'fluid', 'and', 'a', 'global', 'monopole', 'charge', 'in', 'the', 'framework', 'of', 'a', '13', 'dimensional', 'gravity', 'minimally', 'coupled', 'to', 'a', 'triplet', 'of', 'scalar', 'fields', 'phia', 'resulting', 'from', 'the', 'breaking', 'of', 'a', 'global', 'o3', 'symmetry', 'for', 'the', 'anisotropic', 'matter', 'fluid', 'we', 'have', 'considered', 'the', 'equation', 'of', 'state', 'eos', 'given', 'by', 'mathcalp_romega', 'rho', 'with', 'a', 'consequence', 'omega1', 'implying', 'a', 'socalled', 'phantom', 'energy', 'at', 'the', 'throat', 'of', 'the', 'wormhole', 'which', 'violates', 'the', 'energy', 'conditions', 'in', 'addition', 'we', 'study', 'the', 'weak', 'gravitational', 'lensing', 'effect', 'using', 'the', 'gaussbonnet', 'theorem', 'gbt', 'applied', 'to', 'the', 'wormhole', 'optical', 'geometry', 'we', 'show', 'that', 'the', 'total', 'deflection', 'angle', 'consists', 'of', 'a', 'term', 'given', 'by', '4pi2', 'eta2', 'which', 'is', 'independent', 'from', 'the', 'impact', 'parameter', 'b', 'and', 'an', 'additional', 'term', 'which', 'depends', 'on', 'the', 'radius', 'of', 'the', 'wormhole', 'throat', 'b_0', 'as', 'well', 'as', 'the', 'dimensionless', 'constant', 'zeta']] | [-0.1943706338595901, 0.11405460174825527, -0.08452258219728498, 0.053349962200012965, -0.0856387186087542, -0.14420339545373478, -0.01570481836097315, 0.262137823058544, -0.20205284077422442, -0.30065850332077293, 0.06146796039585654, -0.2492412370126191, -0.10106402373325231, 0.1264120473752956, 0.00372138453295102, 0.030930135326736885, -0.027766471593389037, 0.061321614391164146, -0.06188170255847728, -0.18787900681805647, 0.3990708535814003, 0.055976739982331825, 0.23927336843130556, 0.0673083662074311, 0.12643351847607945, -0.01569106593111379, 0.019896876809464115, 0.0890614325558213, -0.21524802515955957, 0.006287273066747631, 0.14743884437799304, 0.053569759254379595, 0.20051690055422383, -0.40057826344225855, -0.2222654784721247, 0.10634072058884478, 0.12246061387673221, 0.11779675104520032, -0.07003127027309274, -0.3145955082916378, 0.055421339395153965, -0.20262564143765327, -0.16783447634441326, -0.013581029822219265, 0.03588712823614981, -0.0074943647848920445, -0.26790598298523677, 0.13815280927244472, 0.03849678616844923, -0.0214938491683554, -0.10694823647232575, -0.07894359006722634, -0.07139145157801781, 0.013772190549266147, 0.1414014491601847, 0.07031293977932954, 0.15145712115918286, -0.18515807714823962, -0.021790235090176448, 0.36435480299405754, -0.1328791421979691, -0.2210370126822208, 0.09229338057716754, -0.13635707344872425, -0.08602201684088623, 0.10207125155657933, 0.11086838414984093, 0.15675148455350585, -0.11216438860582137, 0.1727374072581517, -0.03757295904860429, 0.18098761258974067, 0.11823307967593742, 0.009018725750187563, 0.2739562231581658, 0.10091935290256515, 0.08006103101148698, 0.15700727257865002, -0.07577958363784805, -0.06095942914032856, -0.39145597780274377, -0.14926966202344644, -0.1717652544376088, 0.1001942441924601, -0.15768451869744976, -0.16522889343920993, 0.36066061878463607, 0.056297187290289694, 0.15954150068825362, -0.0019512191820713516, 0.25255197434170124, 0.09666898941567696, 0.04493737717613742, 0.09938082680093578, 0.32631914622647484, 0.14402412419597543, 0.12939282677787659, -0.24185708107433054, -0.05054480224734525, 0.07213720172561856] |
1,803.02318 | Stability of the Broad Line Region Geometry and Dynamics in Arp 151 Over
Seven Years | The Seyfert 1 galaxy Arp 151 was monitored as part of three reverberation
mapping campaigns spanning $2008-2015$. We present modeling of these
velocity-resolved reverberation mapping datasets using a geometric and
dynamical model for the broad line region (BLR). By modeling each of the three
datasets independently, we infer the evolution of the BLR structure in Arp 151
over a total of seven years and constrain the systematic uncertainties in
non-varying parameters such as the black hole mass. We find that the BLR
geometry of a thick disk viewed close to face-on is stable over this time,
although the size of the BLR grows by a factor of $\sim 2$. The dynamics of the
BLR are dominated by inflow and the inferred black hole mass is consistent for
the three datasets, despite the increase in BLR size. Combining the inference
for the three datasets yields a black hole mass and statistical uncertainty of
$\log_{10}($M$_{\rm BH}/\rm{M}_{\odot})=6.82^{+0.09}_{-0.09}$ with a standard
deviation in individual measurements of 0.13 dex.
| astro-ph.GA | the seyfert 1 galaxy arp 151 was monitored as part of three reverberation mapping campaigns spanning 20082015 we present modeling of these velocityresolved reverberation mapping datasets using a geometric and dynamical model for the broad line region blr by modeling each of the three datasets independently we infer the evolution of the blr structure in arp 151 over a total of seven years and constrain the systematic uncertainties in nonvarying parameters such as the black hole mass we find that the blr geometry of a thick disk viewed close to faceon is stable over this time although the size of the blr grows by a factor of sim 2 the dynamics of the blr are dominated by inflow and the inferred black hole mass is consistent for the three datasets despite the increase in blr size combining the inference for the three datasets yields a black hole mass and statistical uncertainty of log_10m_rm bhrmm_odot682009_009 with a standard deviation in individual measurements of 013 dex | [['the', 'seyfert', '1', 'galaxy', 'arp', '151', 'was', 'monitored', 'as', 'part', 'of', 'three', 'reverberation', 'mapping', 'campaigns', 'spanning', '20082015', 'we', 'present', 'modeling', 'of', 'these', 'velocityresolved', 'reverberation', 'mapping', 'datasets', 'using', 'a', 'geometric', 'and', 'dynamical', 'model', 'for', 'the', 'broad', 'line', 'region', 'blr', 'by', 'modeling', 'each', 'of', 'the', 'three', 'datasets', 'independently', 'we', 'infer', 'the', 'evolution', 'of', 'the', 'blr', 'structure', 'in', 'arp', '151', 'over', 'a', 'total', 'of', 'seven', 'years', 'and', 'constrain', 'the', 'systematic', 'uncertainties', 'in', 'nonvarying', 'parameters', 'such', 'as', 'the', 'black', 'hole', 'mass', 'we', 'find', 'that', 'the', 'blr', 'geometry', 'of', 'a', 'thick', 'disk', 'viewed', 'close', 'to', 'faceon', 'is', 'stable', 'over', 'this', 'time', 'although', 'the', 'size', 'of', 'the', 'blr', 'grows', 'by', 'a', 'factor', 'of', 'sim', '2', 'the', 'dynamics', 'of', 'the', 'blr', 'are', 'dominated', 'by', 'inflow', 'and', 'the', 'inferred', 'black', 'hole', 'mass', 'is', 'consistent', 'for', 'the', 'three', 'datasets', 'despite', 'the', 'increase', 'in', 'blr', 'size', 'combining', 'the', 'inference', 'for', 'the', 'three', 'datasets', 'yields', 'a', 'black', 'hole', 'mass', 'and', 'statistical', 'uncertainty', 'of', 'log_10m_rm', 'bhrmm_odot682009_009', 'with', 'a', 'standard', 'deviation', 'in', 'individual', 'measurements', 'of', '013', 'dex']] | [-0.07219712301214551, 0.024887187897793355, -0.022766068117818766, 0.0899104124293634, -0.021970725338334687, -0.09725765482325427, 0.05151133203701876, 0.3956672250081791, -0.17411829791734554, -0.35961128442199686, 0.10584197423643678, -0.2948208110452704, 0.0179777882558985, 0.24039052792916224, -0.035628944122771004, 0.01670409472190712, 0.003317484257891317, -0.08598925580236307, -0.10245076857044425, -0.19288554507239145, 0.34528284403031256, 0.056197795337008916, 0.17890816363877404, -0.023228507619665398, 0.10769052606395965, -0.04106413777574806, -0.07420709595781254, 0.027675783981574824, -0.13420052216067785, 0.08415094261954716, 0.23586041719275613, 0.15518997965574813, 0.241590010706461, -0.30341111648073593, -0.247311731674737, 0.04861868034265836, 0.16995909562380127, 0.04732502351602128, -0.0347895933853668, -0.2749800349819971, 0.02956879960478032, -0.2167166046329711, -0.12878794491325327, 0.06984355704547505, 0.07660998221689641, -0.024128719370103687, -0.22760032434366426, 0.1526500011045783, 0.02676298571632678, 0.08169236526241744, -0.11395730274198063, -0.07345357221019871, -0.04267321745550797, 0.12953618845039624, 0.07421278966622187, 0.026984066982393615, 0.2247354206857643, -0.0886376205520373, -0.06306943127119834, 0.39390937919711316, -0.07229636573486967, -0.05447739130171713, 0.17075606755500922, -0.2076051139938388, -0.14776762772317223, 0.1552930600709779, 0.17732477943935043, 0.1406230831238801, -0.13764075013313248, 0.04383786672874828, -0.0948869895184287, 0.2649709157262889, 0.021184450112557485, 0.014467011653033279, 0.29157630159902426, 0.16204841317397548, 0.009619214126348861, 0.11134857033019417, -0.222244695457487, -0.060199454186792754, -0.24970150674961827, -0.07672207196853038, -0.13023815898258992, 0.11046413218593967, -0.22205169969116925, -0.09658967027086422, 0.36911463733345407, 0.12112403083078425, 0.2926998899055451, 0.05725962209709537, 0.2850173489459179, 0.04265326327012932, 0.08994209582837401, 0.11209237804790627, 0.34514501724575014, 0.11369513866328777, 0.05534222122550331, -0.24573993308618208, 0.05593998903448642, 0.012038100546367317] |
1,803.02319 | Upper Covers of Chains and Antichains in Sets of Indecomposable Subsets | We prove that there are arbitrarily large indecomposable ordered sets T with
a 2-chain C such that the smallest indecomposable proper superset U of C in T
is T itself. Subsequently, we characterize all such indecomposable ordered sets
T and 2-chains C. We also prove the same type of result for 2-antichains.
| math.CO | we prove that there are arbitrarily large indecomposable ordered sets t with a 2chain c such that the smallest indecomposable proper superset u of c in t is t itself subsequently we characterize all such indecomposable ordered sets t and 2chains c we also prove the same type of result for 2antichains | [['we', 'prove', 'that', 'there', 'are', 'arbitrarily', 'large', 'indecomposable', 'ordered', 'sets', 't', 'with', 'a', '2chain', 'c', 'such', 'that', 'the', 'smallest', 'indecomposable', 'proper', 'superset', 'u', 'of', 'c', 'in', 't', 'is', 't', 'itself', 'subsequently', 'we', 'characterize', 'all', 'such', 'indecomposable', 'ordered', 'sets', 't', 'and', '2chains', 'c', 'we', 'also', 'prove', 'the', 'same', 'type', 'of', 'result', 'for', '2antichains']] | [-0.1900421230524194, 0.2195052187707202, 0.014351468204575427, 0.02913537912992943, -0.04684441086525718, -0.15216530831165465, 0.049110025386599934, 0.39190681249487636, -0.3761359152256274, -0.19106391304190837, 0.06956243348609217, -0.2860017351660074, -0.08460251737600558, 0.13833341605084784, -0.047349026144765244, -0.011361187725674873, 0.08591133545098059, 0.10757430105963174, -0.023789818640615717, -0.2856627785618983, 0.31824187875962723, -0.17299198132811808, 0.1567434481728603, 0.06478130405622662, 0.12923013437174113, -0.010404376313090324, -0.017590600549809488, 0.11732940007841178, -0.1854674857872762, 0.05276673979710276, 0.3179646650530106, 0.17302744155384453, 0.20068485428597413, -0.27396798287244406, -0.07584603669523608, 0.22261924929369023, 0.1152726224185351, 0.037016679350213674, 0.020962492736312104, -0.1946163090566794, 0.20880024124156027, -0.1601200343164451, -0.14039407679628507, -0.10760481628205847, 0.2091068978987488, 0.03656939870002223, -0.3036984604436393, -0.007911575159774729, 0.1719990562871281, 0.07571357912292667, -0.06260491492153675, -0.15903426495873751, -0.10044692915079056, 0.09260669621803305, -0.059865737283675405, 0.08709848074096382, 0.0049167777703819325, -0.04202903352686953, -0.09367528386121872, 0.3174945729209439, -0.0983909131666901, -0.1732613946877274, 0.21742158059679045, -0.20689684223821936, -0.17453314622352814, 0.09532940568055447, 0.03388491243708367, 0.17931319353188954, -0.043780720500531146, 0.23114089041322872, -0.16825916491307355, 0.08748286767114027, 0.1402380092014723, 0.055497071997938206, 0.12210201276648863, 0.09099770500781197, 0.11755508695747338, 0.1643177709158729, 0.0035090834956944864, 0.07502514920106121, -0.41131851771006395, -0.1773880491873213, -0.15292666200776675, 0.12678395991451016, -0.1044192568854972, -0.22288326999428226, 0.27609414037536173, 0.09777035175676585, 0.2621424007412119, 0.08233040202335984, 0.157198151993547, 0.01613727095080357, 0.05844531553185673, 0.1742672543771857, 0.0795052365637293, 0.1298103282301157, -0.018249832458940206, -0.1570479651438255, 0.0601096798702344, 0.13555435570614302] |
1,803.0232 | Argyres-Douglas theories, Painlev\'e II and quantum mechanics | We show in details that the all-orders genus expansion of the two-cut
Hermitian cubic matrix model reproduces the perturbative expansion of the $H_1$
Argyres-Douglas theory coupled to the $\Omega$ background. In the self-dual
limit we use the Painlev\'e/gauge correspondence and we show that, after
summing over all instanton sectors, the two-cut cubic matrix model computes the
tau function of Painlev\'e II without taking any double scaling limit or adding
any external fields. We decode such solution within the context of
trans-series. Finally in the Nekrasov-Shatashvili limit we connect the $H_1$
and the $H_0$ Argyres-Douglas theories to the quantum mechanical models with
cubic and double well potentials.
| hep-th math-ph math.MP | we show in details that the allorders genus expansion of the twocut hermitian cubic matrix model reproduces the perturbative expansion of the h_1 argyresdouglas theory coupled to the omega background in the selfdual limit we use the painlevegauge correspondence and we show that after summing over all instanton sectors the twocut cubic matrix model computes the tau function of painleve ii without taking any double scaling limit or adding any external fields we decode such solution within the context of transseries finally in the nekrasovshatashvili limit we connect the h_1 and the h_0 argyresdouglas theories to the quantum mechanical models with cubic and double well potentials | [['we', 'show', 'in', 'details', 'that', 'the', 'allorders', 'genus', 'expansion', 'of', 'the', 'twocut', 'hermitian', 'cubic', 'matrix', 'model', 'reproduces', 'the', 'perturbative', 'expansion', 'of', 'the', 'h_1', 'argyresdouglas', 'theory', 'coupled', 'to', 'the', 'omega', 'background', 'in', 'the', 'selfdual', 'limit', 'we', 'use', 'the', 'painlevegauge', 'correspondence', 'and', 'we', 'show', 'that', 'after', 'summing', 'over', 'all', 'instanton', 'sectors', 'the', 'twocut', 'cubic', 'matrix', 'model', 'computes', 'the', 'tau', 'function', 'of', 'painleve', 'ii', 'without', 'taking', 'any', 'double', 'scaling', 'limit', 'or', 'adding', 'any', 'external', 'fields', 'we', 'decode', 'such', 'solution', 'within', 'the', 'context', 'of', 'transseries', 'finally', 'in', 'the', 'nekrasovshatashvili', 'limit', 'we', 'connect', 'the', 'h_1', 'and', 'the', 'h_0', 'argyresdouglas', 'theories', 'to', 'the', 'quantum', 'mechanical', 'models', 'with', 'cubic', 'and', 'double', 'well', 'potentials']] | [-0.13854255737027243, 0.09377964897347348, -0.061736163816281726, 0.07251250130080042, -0.04189130596018263, -0.14221183810371996, 0.01087853159156761, 0.3168074887334591, -0.24689859898672217, -0.22788676568972213, 0.052943749211373785, -0.31164983467952834, -0.17759727948522638, 0.11438128884460422, 0.0036567399766118756, 0.03917435326036953, 0.027369799992690482, 0.07376781108212613, -0.11984692993795588, -0.2790710299785826, 0.325410557232265, -0.03050238631687881, 0.21106842573554743, 0.04528424830752469, 0.08386662775384528, 0.04960044891839581, 0.016225568148573594, -0.03327236855846076, -0.15789337196855785, 0.05948582874344928, 0.19521814917392302, 0.060913625661106335, 0.12191427396166893, -0.4375631123781204, -0.19576200430414506, 0.15870816313351194, 0.1742565606055515, 0.1208982215617739, 0.04256379586156635, -0.243938270441833, 0.04456675159966662, -0.18211148356397946, -0.186179120537071, -0.1001759439684628, -0.02568040784182293, -0.015331285338548436, -0.2922572817398413, 0.06827622445610662, 0.018775394734083895, -0.0015214978988903264, -0.039496022045967125, -0.0922880656374175, -0.03693430096664954, 0.11030231200469037, 0.04977197681464964, 0.037434009103370566, 0.0829085973313167, -0.18793246222305157, -0.10944955788907551, 0.3561743049394517, -0.14012445075980698, -0.18930133850136327, 0.10335369562464101, -0.177042903950704, -0.17464469285859238, 0.08532862822924342, 0.06262564787286379, 0.11541093468244765, -0.07704343252726609, 0.2657263416868989, -0.009021931460925512, 0.12975551125903925, 0.11481431252766577, -0.016961233131587504, 0.18849393218046143, 0.06621990858000659, -0.022824325421381565, 0.1333264887643357, -0.028001383505761625, -0.13305899662719595, -0.42728760426287493, -0.127213876756529, -0.13120916833147583, 0.1131550393754705, -0.20034797932644974, -0.20569831841414618, 0.3925305604269462, 0.12142856121063232, 0.18252072717462267, 0.0966310175667916, 0.20636865619037834, 0.1531947055476762, 0.09302968566438981, 0.05049951673662734, 0.2167391514716049, 0.1940491139356579, 0.026873404402951044, -0.2411619730559843, -0.09188506729191258, 0.17782169529902084] |
1,803.02321 | Monte Carlo Top Quark Mass Calibration | The most precise top quark mass measurements use kinematic reconstruction
methods, determining the top mass parameter of a Monte Carlo event generator,
$m_t^{\rm MC}$. Due to the complicated interplay of hadronization and parton
shower dynamics in Monte Carlo event generators relevant for kinematic
reconstruction, relating $m_t^{\rm MC}$ to field theory masses is a non-trivial
task. In this talk we report on a calibration procedure to determine this
relation using hadron level QCD predictions for 2-Jettiness in $e^+e^-$
annihilation, an observable which has kinematic top mass sensitivity and a
close relation to the invariant mass of the particles coming from the top
decay. The theoretical ingredients of the QCD prediction are reviewed. Fitting
$e^+e^-$ 2-Jettiness calculations at NLL/NNLL order to PYTHIA 8.205, we find
that $m_t^{\rm MC}$ agrees with the MSR mass $m_{t,1\,{\rm GeV}}^{\rm MSR}$
within uncertainties. At NNLL we find $m_t^{\rm MC} = m_{t,1\,{\rm GeV}}^{\rm
MSR} + (0.18 \pm 0.22)\,{\rm GeV}$. $m_t^{\rm MC}$ can differ from the pole
mass $m_t^{\rm pole}$ by up to $600\,{\rm MeV}$, and using the pole mass
generally leads to larger uncertainties. At NNLL we find $m_t^{\rm MC} =
m_t^{\rm pole} + (0.57 \pm 0.28)\,{\rm GeV}$ as the fit result. In contrast,
converting $m_{t,1\,{\rm GeV}}^{\rm MSR}$ obtained at NNLL to the pole mass
gives a result for $m_t^{\rm pole}$ that is substantially larger and
incompatible with the fit result. We also explain some theoretical aspects
relevant for employing the C-parameter as an alternative calibration
observable.
| hep-ph | the most precise top quark mass measurements use kinematic reconstruction methods determining the top mass parameter of a monte carlo event generator m_trm mc due to the complicated interplay of hadronization and parton shower dynamics in monte carlo event generators relevant for kinematic reconstruction relating m_trm mc to field theory masses is a nontrivial task in this talk we report on a calibration procedure to determine this relation using hadron level qcd predictions for 2jettiness in ee annihilation an observable which has kinematic top mass sensitivity and a close relation to the invariant mass of the particles coming from the top decay the theoretical ingredients of the qcd prediction are reviewed fitting ee 2jettiness calculations at nllnnll order to pythia 8205 we find that m_trm mc agrees with the msr mass m_t1rm gevrm msr within uncertainties at nnll we find m_trm mc m_t1rm gevrm msr 018 pm 022rm gev m_trm mc can differ from the pole mass m_trm pole by up to 600rm mev and using the pole mass generally leads to larger uncertainties at nnll we find m_trm mc m_trm pole 057 pm 028rm gev as the fit result in contrast converting m_t1rm gevrm msr obtained at nnll to the pole mass gives a result for m_trm pole that is substantially larger and incompatible with the fit result we also explain some theoretical aspects relevant for employing the cparameter as an alternative calibration observable | [['the', 'most', 'precise', 'top', 'quark', 'mass', 'measurements', 'use', 'kinematic', 'reconstruction', 'methods', 'determining', 'the', 'top', 'mass', 'parameter', 'of', 'a', 'monte', 'carlo', 'event', 'generator', 'm_trm', 'mc', 'due', 'to', 'the', 'complicated', 'interplay', 'of', 'hadronization', 'and', 'parton', 'shower', 'dynamics', 'in', 'monte', 'carlo', 'event', 'generators', 'relevant', 'for', 'kinematic', 'reconstruction', 'relating', 'm_trm', 'mc', 'to', 'field', 'theory', 'masses', 'is', 'a', 'nontrivial', 'task', 'in', 'this', 'talk', 'we', 'report', 'on', 'a', 'calibration', 'procedure', 'to', 'determine', 'this', 'relation', 'using', 'hadron', 'level', 'qcd', 'predictions', 'for', '2jettiness', 'in', 'ee', 'annihilation', 'an', 'observable', 'which', 'has', 'kinematic', 'top', 'mass', 'sensitivity', 'and', 'a', 'close', 'relation', 'to', 'the', 'invariant', 'mass', 'of', 'the', 'particles', 'coming', 'from', 'the', 'top', 'decay', 'the', 'theoretical', 'ingredients', 'of', 'the', 'qcd', 'prediction', 'are', 'reviewed', 'fitting', 'ee', '2jettiness', 'calculations', 'at', 'nllnnll', 'order', 'to', 'pythia', '8205', 'we', 'find', 'that', 'm_trm', 'mc', 'agrees', 'with', 'the', 'msr', 'mass', 'm_t1rm', 'gevrm', 'msr', 'within', 'uncertainties', 'at', 'nnll', 'we', 'find', 'm_trm', 'mc', 'm_t1rm', 'gevrm', 'msr', '018', 'pm', '022rm', 'gev', 'm_trm', 'mc', 'can', 'differ', 'from', 'the', 'pole', 'mass', 'm_trm', 'pole', 'by', 'up', 'to', '600rm', 'mev', 'and', 'using', 'the', 'pole', 'mass', 'generally', 'leads', 'to', 'larger', 'uncertainties', 'at', 'nnll', 'we', 'find', 'm_trm', 'mc', 'm_trm', 'pole', '057', 'pm', '028rm', 'gev', 'as', 'the', 'fit', 'result', 'in', 'contrast', 'converting', 'm_t1rm', 'gevrm', 'msr', 'obtained', 'at', 'nnll', 'to', 'the', 'pole', 'mass', 'gives', 'a', 'result', 'for', 'm_trm', 'pole', 'that', 'is', 'substantially', 'larger', 'and', 'incompatible', 'with', 'the', 'fit', 'result', 'we', 'also', 'explain', 'some', 'theoretical', 'aspects', 'relevant', 'for', 'employing', 'the', 'cparameter', 'as', 'an', 'alternative', 'calibration', 'observable']] | [-0.045228960896985464, 0.13896473323536787, -0.11642866893611753, 0.1872081851077258, -0.04902150169272139, -0.04932022559915224, 0.045080992295436606, 0.34294386551930356, -0.16300159560279667, -0.37155038072990304, 0.035618450226954736, -0.3130534447502727, 0.026145891638663717, 0.17849865566409773, 0.01856007583690091, 0.08866303286994767, 0.11947447306270506, 0.0060394861517497934, -0.16038874482624552, -0.13683473492940712, 0.25151458237037605, 0.15757820912951237, 0.18860572680003113, 0.12433063907103024, 0.07725218393487665, 0.04437880876596468, -0.061362639482483335, -0.0866695805432864, -0.2134931090079038, 0.04168220026553887, 0.22032766422999597, 0.024207231471251346, 0.068392149431424, -0.2695282373545516, -0.08005512938595927, 0.050446314661580526, 0.1506793978703646, 0.08275994891972424, -0.03375827779239203, -0.24307937651044792, 0.11761892297201687, -0.26067270352067345, -0.14447504232048541, -0.02011650395539836, -0.07418173544544679, -0.08932317951972732, -0.3420783521131907, 0.12366650625752408, -0.0909602343558501, 0.04338575524755462, 0.029927244157188088, -0.2432404565724393, -0.06318312546568644, 0.05219748895018338, 0.09967961696744697, 0.1618410812728913, 0.17412234351444894, -0.11392535353039639, -0.14026656767659876, 0.387036543753412, -0.02719012645429446, -0.12952003984624505, 0.11081021533319806, -0.1719292699952379, -0.1795452394001345, 0.17921070449858204, 0.184942939663485, 0.05060176859394862, -0.2185470610240108, 0.09983972559432285, 0.0032908328884464298, 0.19431465031165215, 0.054456916700403854, -0.018944929229144335, 0.21356676413844794, 0.17029328075930095, -0.02786790276877582, 0.02959694493558003, -0.13181048313764712, -0.13585944048678264, -0.34652573043782997, -0.05590923935270462, -0.10179712737385088, 0.06270381266850197, -0.12317991728718297, -0.12307799805719884, 0.30917865198710537, 0.19768824234387677, 0.2509875936477453, 0.08069240080608596, 0.3267504989475999, 0.09838008817880312, 0.10501416434701054, 0.08041937172021836, 0.2904118809832357, 0.1619317344773927, 0.08770246901469798, -0.251296239041397, 0.017191218605599468, 0.0957170654163879] |
1,803.02322 | Singular quasisymmetric mappings in dimensions two and greater | For all $n \geq 2$, we construct a metric space $(X,d)$ and a quasisymmetric
mapping $f\colon [0,1]^n \rightarrow X$ with the property that $f^{-1}$ is not
absolutely continuous with respect to the Hausdorff $n$-measure on $X$. That
is, there exists a Borel set $E \subset [0,1]^n$ with Lebesgue measure $|E|>0$
such that $f(E)$ has Hausdorff $n$-measure zero. The construction may be
carried out so that $X$ has finite Hausdorff $n$-measure and $|E|$ is
arbitrarily close to 1, or so that $|E| = 1$. This gives a negative answer to a
question of Heinonen and Semmes.
| math.MG | for all n geq 2 we construct a metric space xd and a quasisymmetric mapping fcolon 01n rightarrow x with the property that f1 is not absolutely continuous with respect to the hausdorff nmeasure on x that is there exists a borel set e subset 01n with lebesgue measure e0 such that fe has hausdorff nmeasure zero the construction may be carried out so that x has finite hausdorff nmeasure and e is arbitrarily close to 1 or so that e 1 this gives a negative answer to a question of heinonen and semmes | [['for', 'all', 'n', 'geq', '2', 'we', 'construct', 'a', 'metric', 'space', 'xd', 'and', 'a', 'quasisymmetric', 'mapping', 'fcolon', '01n', 'rightarrow', 'x', 'with', 'the', 'property', 'that', 'f1', 'is', 'not', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', 'hausdorff', 'nmeasure', 'on', 'x', 'that', 'is', 'there', 'exists', 'a', 'borel', 'set', 'e', 'subset', '01n', 'with', 'lebesgue', 'measure', 'e0', 'such', 'that', 'fe', 'has', 'hausdorff', 'nmeasure', 'zero', 'the', 'construction', 'may', 'be', 'carried', 'out', 'so', 'that', 'x', 'has', 'finite', 'hausdorff', 'nmeasure', 'and', 'e', 'is', 'arbitrarily', 'close', 'to', '1', 'or', 'so', 'that', 'e', '1', 'this', 'gives', 'a', 'negative', 'answer', 'to', 'a', 'question', 'of', 'heinonen', 'and', 'semmes']] | [-0.14692407702789345, 0.1261948370250893, -0.08642271937346681, 0.061366406093510066, -0.03648133297014902, -0.18615916801834517, 0.07830409222143761, 0.41417151138662023, -0.27860934136712806, -0.13341227964252889, 0.0362678686691884, -0.37892210660898623, -0.06461941842683294, 0.16444525692086825, -0.107625121974629, 0.0303388123222171, 0.016833258292419797, 0.09929813613045088, -0.06355082683829948, -0.2581507556606084, 0.3436669275521281, -0.05932126177890979, 0.19671464054548043, 0.06240249538615821, 0.16316304940413287, -0.07722903241928508, 0.034424782418546844, 0.05114888470896094, -0.18265522459741407, 0.06590233728329235, 0.279808917657492, 0.16388965591768476, 0.3010687652301598, -0.24251222442042955, -0.1507873832550955, 0.28928517832599104, 0.09910701522900861, -0.11031328087197022, 0.0075874953949328595, -0.27526826344113403, 0.1823237652325646, -0.11940673020906112, -0.1349970867827614, -0.10081646824255586, 0.18773736431265864, -0.03582538341350378, -0.3186446051460077, -0.0676534293477047, 0.15033785079883294, 0.04264541326506816, -0.030647597865181717, -0.10675742408815533, -0.0843788274499449, 0.0847894663184366, -0.01132357631712829, 0.2945052623956841, 0.05269561630693522, 0.055792130459288256, -0.10104375090474818, 0.35347355356281424, -0.10141824151171332, -0.2952351280824935, 0.15803856142187253, -0.2640071876961342, -0.14637167872662873, 0.14068931475915808, 0.04853342885666705, 0.12324015744664568, -0.03265136077088562, 0.2658805331751516, -0.13886884353872875, 0.16554014964841623, 0.1133113918191892, 0.010674972963975148, 0.13589750632564437, 0.07701211274066504, 0.19048645278993756, 0.08580054936093337, -0.011286142160818774, 0.05989579298097561, -0.34499782205935803, -0.15532988772827863, -0.20794151830016339, 0.24378792829876592, -0.06361738330281483, -0.20046471389248333, 0.2637330934905665, 0.06670200232134023, 0.24861679789907437, 0.11505076748893615, 0.17655871629818998, 0.04529024845752692, -0.026405361172634156, 0.08096051235445478, 0.10149830691714554, 0.12946298338988044, -0.024004001680642685, -0.10115390844061659, 0.02154812403270935, 0.1494330757624529] |
1,803.02323 | Deep Super Learner: A Deep Ensemble for Classification Problems | Deep learning has become very popular for tasks such as predictive modeling
and pattern recognition in handling big data. Deep learning is a powerful
machine learning method that extracts lower level features and feeds them
forward for the next layer to identify higher level features that improve
performance. However, deep neural networks have drawbacks, which include many
hyper-parameters and infinite architectures, opaqueness into results, and
relatively slower convergence on smaller datasets. While traditional machine
learning algorithms can address these drawbacks, they are not typically capable
of the performance levels achieved by deep neural networks. To improve
performance, ensemble methods are used to combine multiple base learners. Super
learning is an ensemble that finds the optimal combination of diverse learning
algorithms. This paper proposes deep super learning as an approach which
achieves log loss and accuracy results competitive to deep neural networks
while employing traditional machine learning algorithms in a hierarchical
structure. The deep super learner is flexible, adaptable, and easy to train
with good performance across different tasks using identical hyper-parameter
values. Using traditional machine learning requires fewer hyper-parameters,
allows transparency into results, and has relatively fast convergence on
smaller datasets. Experimental results show that the deep super learner has
superior performance compared to the individual base learners, single-layer
ensembles, and in some cases deep neural networks. Performance of the deep
super learner may further be improved with task-specific tuning.
| cs.LG stat.ML | deep learning has become very popular for tasks such as predictive modeling and pattern recognition in handling big data deep learning is a powerful machine learning method that extracts lower level features and feeds them forward for the next layer to identify higher level features that improve performance however deep neural networks have drawbacks which include many hyperparameters and infinite architectures opaqueness into results and relatively slower convergence on smaller datasets while traditional machine learning algorithms can address these drawbacks they are not typically capable of the performance levels achieved by deep neural networks to improve performance ensemble methods are used to combine multiple base learners super learning is an ensemble that finds the optimal combination of diverse learning algorithms this paper proposes deep super learning as an approach which achieves log loss and accuracy results competitive to deep neural networks while employing traditional machine learning algorithms in a hierarchical structure the deep super learner is flexible adaptable and easy to train with good performance across different tasks using identical hyperparameter values using traditional machine learning requires fewer hyperparameters allows transparency into results and has relatively fast convergence on smaller datasets experimental results show that the deep super learner has superior performance compared to the individual base learners singlelayer ensembles and in some cases deep neural networks performance of the deep super learner may further be improved with taskspecific tuning | [['deep', 'learning', 'has', 'become', 'very', 'popular', 'for', 'tasks', 'such', 'as', 'predictive', 'modeling', 'and', 'pattern', 'recognition', 'in', 'handling', 'big', 'data', 'deep', 'learning', 'is', 'a', 'powerful', 'machine', 'learning', 'method', 'that', 'extracts', 'lower', 'level', 'features', 'and', 'feeds', 'them', 'forward', 'for', 'the', 'next', 'layer', 'to', 'identify', 'higher', 'level', 'features', 'that', 'improve', 'performance', 'however', 'deep', 'neural', 'networks', 'have', 'drawbacks', 'which', 'include', 'many', 'hyperparameters', 'and', 'infinite', 'architectures', 'opaqueness', 'into', 'results', 'and', 'relatively', 'slower', 'convergence', 'on', 'smaller', 'datasets', 'while', 'traditional', 'machine', 'learning', 'algorithms', 'can', 'address', 'these', 'drawbacks', 'they', 'are', 'not', 'typically', 'capable', 'of', 'the', 'performance', 'levels', 'achieved', 'by', 'deep', 'neural', 'networks', 'to', 'improve', 'performance', 'ensemble', 'methods', 'are', 'used', 'to', 'combine', 'multiple', 'base', 'learners', 'super', 'learning', 'is', 'an', 'ensemble', 'that', 'finds', 'the', 'optimal', 'combination', 'of', 'diverse', 'learning', 'algorithms', 'this', 'paper', 'proposes', 'deep', 'super', 'learning', 'as', 'an', 'approach', 'which', 'achieves', 'log', 'loss', 'and', 'accuracy', 'results', 'competitive', 'to', 'deep', 'neural', 'networks', 'while', 'employing', 'traditional', 'machine', 'learning', 'algorithms', 'in', 'a', 'hierarchical', 'structure', 'the', 'deep', 'super', 'learner', 'is', 'flexible', 'adaptable', 'and', 'easy', 'to', 'train', 'with', 'good', 'performance', 'across', 'different', 'tasks', 'using', 'identical', 'hyperparameter', 'values', 'using', 'traditional', 'machine', 'learning', 'requires', 'fewer', 'hyperparameters', 'allows', 'transparency', 'into', 'results', 'and', 'has', 'relatively', 'fast', 'convergence', 'on', 'smaller', 'datasets', 'experimental', 'results', 'show', 'that', 'the', 'deep', 'super', 'learner', 'has', 'superior', 'performance', 'compared', 'to', 'the', 'individual', 'base', 'learners', 'singlelayer', 'ensembles', 'and', 'in', 'some', 'cases', 'deep', 'neural', 'networks', 'performance', 'of', 'the', 'deep', 'super', 'learner', 'may', 'further', 'be', 'improved', 'with', 'taskspecific', 'tuning']] | [0.00246660009041712, -0.0055747651574758654, -0.06937057155022479, 0.09126567005840353, -0.13827999462171092, -0.24508110436246447, 0.031847647764294856, 0.5088434457819423, -0.26417774722668463, -0.33052958243086167, 0.04685648232578229, -0.2512084904987917, -0.2033106239988347, 0.2368554869236465, -0.14366506391164402, 0.12110603937389501, 0.19031242200821313, 0.04359958317819173, -0.08131689990354378, -0.3423432623066575, 0.2745090960484484, 0.09226267021832704, 0.41683763183916556, -0.021525622163291857, 0.1543100771985179, -0.05449839064284511, 0.03694110862384348, -0.0065098490762861535, -0.005584724892927941, 0.20634577115187827, 0.37334219330476354, 0.22709746658599572, 0.39703178545156415, -0.42602317677405865, -0.2503979680502949, 0.08923619902368797, 0.2011461917553907, 0.07567845613951289, -0.018263446402978962, -0.2927022851608775, 0.09844807918011414, -0.16432828123519277, 0.025621734734665117, -0.23645210699583202, -0.07255739711994386, 0.007578313906434113, -0.29747634832063974, -0.020995665661504737, 0.08070781364449826, 0.06262698094967915, 0.0003575034558509841, -0.18797055098795049, 0.07854807239491493, 0.15984467187612925, 0.032986234995010105, 0.06409851589933564, 0.1656244787245827, -0.23790085250410534, -0.1687853757403386, 0.2958812900656915, -0.09098042874070614, -0.1728282018116063, 0.26437239739841417, 0.036543330568415314, -0.17870110410630055, 0.12119767500856972, 0.2771957293623532, 0.09425550610657134, -0.14897820984403118, 0.01660295472804295, 0.004785165336468946, 0.16971490624077293, 0.05150746765101086, 0.008683599843441143, 0.15449507230811793, 0.32681702039730937, 0.028868093250734406, 0.10248140449504084, -0.11924209482879276, -0.09842196896004127, -0.11715490081089387, -0.04979140098034607, -0.1567257314333287, -0.029650581349636447, -0.14814144364386067, -0.12859056575385772, 0.3472810941059952, 0.2071677381380299, 0.21188308019191027, 0.15123013925786719, 0.3681909739971161, 0.037058205375164424, 0.18302433475568566, 0.148307051345625, 0.22968670888715323, 0.03524781880070172, 0.14153771128368806, -0.15348323796491098, 0.08807024442307328, 0.023664327397051713] |
1,803.02324 | Annotation Artifacts in Natural Language Inference Data | Large-scale datasets for natural language inference are created by presenting
crowd workers with a sentence (premise), and asking them to generate three new
sentences (hypotheses) that it entails, contradicts, or is logically neutral
with respect to. We show that, in a significant portion of such data, this
protocol leaves clues that make it possible to identify the label by looking
only at the hypothesis, without observing the premise. Specifically, we show
that a simple text categorization model can correctly classify the hypothesis
alone in about 67% of SNLI (Bowman et. al, 2015) and 53% of MultiNLI (Williams
et. al, 2017). Our analysis reveals that specific linguistic phenomena such as
negation and vagueness are highly correlated with certain inference classes.
Our findings suggest that the success of natural language inference models to
date has been overestimated, and that the task remains a hard open problem.
| cs.CL cs.AI | largescale datasets for natural language inference are created by presenting crowd workers with a sentence premise and asking them to generate three new sentences hypotheses that it entails contradicts or is logically neutral with respect to we show that in a significant portion of such data this protocol leaves clues that make it possible to identify the label by looking only at the hypothesis without observing the premise specifically we show that a simple text categorization model can correctly classify the hypothesis alone in about 67 of snli bowman et al 2015 and 53 of multinli williams et al 2017 our analysis reveals that specific linguistic phenomena such as negation and vagueness are highly correlated with certain inference classes our findings suggest that the success of natural language inference models to date has been overestimated and that the task remains a hard open problem | [['largescale', 'datasets', 'for', 'natural', 'language', 'inference', 'are', 'created', 'by', 'presenting', 'crowd', 'workers', 'with', 'a', 'sentence', 'premise', 'and', 'asking', 'them', 'to', 'generate', 'three', 'new', 'sentences', 'hypotheses', 'that', 'it', 'entails', 'contradicts', 'or', 'is', 'logically', 'neutral', 'with', 'respect', 'to', 'we', 'show', 'that', 'in', 'a', 'significant', 'portion', 'of', 'such', 'data', 'this', 'protocol', 'leaves', 'clues', 'that', 'make', 'it', 'possible', 'to', 'identify', 'the', 'label', 'by', 'looking', 'only', 'at', 'the', 'hypothesis', 'without', 'observing', 'the', 'premise', 'specifically', 'we', 'show', 'that', 'a', 'simple', 'text', 'categorization', 'model', 'can', 'correctly', 'classify', 'the', 'hypothesis', 'alone', 'in', 'about', '67', 'of', 'snli', 'bowman', 'et', 'al', '2015', 'and', '53', 'of', 'multinli', 'williams', 'et', 'al', '2017', 'our', 'analysis', 'reveals', 'that', 'specific', 'linguistic', 'phenomena', 'such', 'as', 'negation', 'and', 'vagueness', 'are', 'highly', 'correlated', 'with', 'certain', 'inference', 'classes', 'our', 'findings', 'suggest', 'that', 'the', 'success', 'of', 'natural', 'language', 'inference', 'models', 'to', 'date', 'has', 'been', 'overestimated', 'and', 'that', 'the', 'task', 'remains', 'a', 'hard', 'open', 'problem']] | [-0.04716923000857302, 0.060421309867201164, -0.05291681090279275, 0.0991305910332206, -0.15482511167323942, -0.155459786985173, 0.09095100391520343, 0.38773949853687856, -0.2587256482349605, -0.40560529668073286, 0.04718792701735058, -0.2855964333167422, -0.1658206957880692, 0.18709889017433548, -0.1232358515165591, 0.0353513954517742, 0.11474184579047789, 0.015987782439980138, 0.02303399993939416, -0.29635451026519555, 0.31287694851764375, 0.055341086039940514, 0.29735750742515343, 0.04262559796269569, 0.10096929172949684, -0.04964454176499405, -0.06998810241121747, 0.009245980521275973, -0.05589172317978511, 0.11516790005892592, 0.2858750777809039, 0.24373013452309855, 0.29932218431107077, -0.3841584670072835, -0.21857884261731264, 0.0697699457992308, 0.08816233133741964, 0.11843751146574909, -0.013798450297650157, -0.3399134254545465, 0.11131317129628668, -0.14029892626503068, -0.02944351251709223, -0.12097887464592026, 0.07485051846490226, -0.046667831238462694, -0.25630820031154955, 0.0813567222713674, 0.14520815003844392, 0.0709066078763701, -0.03310684154550674, -0.08816174477235311, 0.01222999238396167, 0.09771102935418538, 0.045629703246555034, 0.06296842789985628, 0.0973620076062313, -0.1367655869200664, -0.179346981155201, 0.3785241785420415, -0.025348389597234525, -0.17688904136755607, 0.23941532170606983, -0.08683846516295388, -0.2319480937375273, 0.06516364024719223, 0.11496171266965878, 0.0718217891052417, -0.1629185273648343, 0.035507515530399464, -0.1313470774621237, 0.22175065685506626, 0.08165951926235317, -0.04041830938108938, 0.21622711147453325, 0.17005395957191163, -0.024417016601849657, 0.09232248435728252, -0.0596690668962007, -0.0617356880599497, -0.2432118367254993, -0.13556373261154578, -0.14166028284428953, 0.028178079455554124, -0.034834209609269036, -0.1383490468562943, 0.35400742100965643, 0.24155177749192566, 0.21753910582952407, 0.06796496180403563, 0.24140480059011477, 0.037024720213796374, 0.05702293611345036, 0.1177992083341653, 0.18969771648213887, 0.028433245584084135, 0.07440635695820674, -0.13329082728079003, 0.12819786991975787, -0.014711166563504068] |
1,803.02325 | Light Ion Accelerating Line (L3IA): Test Experiment at ILIL-PW | The construction of a novel Laser driven Light Ions Acceleration Line(L3IA)
is progressing rapidly towards the operation, following the recent upgrade of
the ILIL-PW laser facility. The Line was designed following the pilot
experimental activity carried out earlier at the same facility to define design
parameters and to identify main components including target control and
diagnostic equipment, also in combination with the numerical simulations for
the optimization of laser and target parameters. A preliminary set of data was
acquired following the successful commissioning of the laser system >100 TW
upgrade. Data include output from a range of different ion detectors and
optical diagnostics installed for qualification of the laser-target
interaction. An overview of the results is given along with a description of
the relevant upgraded laser facility and features.
| physics.plasm-ph | the construction of a novel laser driven light ions acceleration linel3ia is progressing rapidly towards the operation following the recent upgrade of the ililpw laser facility the line was designed following the pilot experimental activity carried out earlier at the same facility to define design parameters and to identify main components including target control and diagnostic equipment also in combination with the numerical simulations for the optimization of laser and target parameters a preliminary set of data was acquired following the successful commissioning of the laser system 100 tw upgrade data include output from a range of different ion detectors and optical diagnostics installed for qualification of the lasertarget interaction an overview of the results is given along with a description of the relevant upgraded laser facility and features | [['the', 'construction', 'of', 'a', 'novel', 'laser', 'driven', 'light', 'ions', 'acceleration', 'linel3ia', 'is', 'progressing', 'rapidly', 'towards', 'the', 'operation', 'following', 'the', 'recent', 'upgrade', 'of', 'the', 'ililpw', 'laser', 'facility', 'the', 'line', 'was', 'designed', 'following', 'the', 'pilot', 'experimental', 'activity', 'carried', 'out', 'earlier', 'at', 'the', 'same', 'facility', 'to', 'define', 'design', 'parameters', 'and', 'to', 'identify', 'main', 'components', 'including', 'target', 'control', 'and', 'diagnostic', 'equipment', 'also', 'in', 'combination', 'with', 'the', 'numerical', 'simulations', 'for', 'the', 'optimization', 'of', 'laser', 'and', 'target', 'parameters', 'a', 'preliminary', 'set', 'of', 'data', 'was', 'acquired', 'following', 'the', 'successful', 'commissioning', 'of', 'the', 'laser', 'system', '100', 'tw', 'upgrade', 'data', 'include', 'output', 'from', 'a', 'range', 'of', 'different', 'ion', 'detectors', 'and', 'optical', 'diagnostics', 'installed', 'for', 'qualification', 'of', 'the', 'lasertarget', 'interaction', 'an', 'overview', 'of', 'the', 'results', 'is', 'given', 'along', 'with', 'a', 'description', 'of', 'the', 'relevant', 'upgraded', 'laser', 'facility', 'and', 'features']] | [-0.0813637460553542, 0.11862267271121028, -0.07208318587788563, -0.032613518840347334, -0.03882971370783378, -0.1700634473025447, 0.01595680167766537, 0.39440176008621186, -0.2154930937983917, -0.34442060229581173, 0.10405001959371138, -0.2701765403378843, -0.012770838337019086, 0.257322332942785, -0.022120040114907712, 0.10156495797293862, 0.11909035079577189, -0.029214405581193762, -0.03692813954631409, -0.17106349998810072, 0.2781318295270381, 0.1885091280894662, 0.2919096395036015, 0.025867199873566393, 0.13601125457588084, 0.004990071341978371, -0.07227389175283509, -0.05706848011271456, -0.10635127681564158, 0.07732904070298972, 0.2726706354773427, 0.179333105514662, 0.26701535023455547, -0.4310845832854205, -0.19056694150199255, 0.017198671048734425, 0.0807074784763216, 0.060020693317495696, -0.11156724810262951, -0.2780987237035627, 0.014035490469587233, -0.16806248055521664, -0.17175300538312555, 0.015220657828828598, -0.005312628420729806, 0.10846277035215474, -0.30801147331967654, -0.11652926937699883, -0.013434108497032264, 0.09926411543246799, -0.08864055267410485, -0.12168405076954514, 0.021710846761945547, 0.10280846891004417, -0.006426238649209419, 0.09181977465279459, 0.17560013965153554, -0.12395164586500976, -0.08669222685999757, 0.34994515043309354, -0.041677795427550714, -0.04766264490739215, 0.18106978669887278, -0.15911956199840827, -0.1258882568987805, 0.1462139867440482, 0.1808449050217251, 0.10848750852737722, -0.16245281032293918, -0.005113803580362995, 0.03169205260837055, 0.1704414499128445, 0.06817738161656976, 0.00844198184483868, 0.2150947993720229, 0.23965799298108093, 0.035982979284578796, 0.17881156017512953, -0.1519095852004463, -0.03752619624192878, -0.3480523834848322, -0.11351147512048226, -0.12000003987629934, -0.009248143698154824, 0.007149685992456892, -0.05663131956216388, 0.45347053592833947, 0.1665149781280967, 0.12730485444712475, -0.04574928335904136, 0.33272938872320856, 0.06305335158783315, 0.07423177966573019, -0.024127755130780495, 0.2583981339620815, 0.09749431147672764, 0.16551593572311984, -0.25082655140477433, 0.03261913017894134, 0.00943332633340922] |
1,803.02326 | Comparison of various image fusion methods for impervious surface
classification from VNREDSat-1 | Impervious surface is an important indicator for urban development
monitoring. Accurate urban impervious surfaces mapping with VNREDSat-1 remains
challenging due to their spectral diversity not captured by individual PAN
image. In this artical, five multi-resolution image fusion techniques were
compared for classification task of urban impervious surface. The result shows
that for VNREDSat-1 dataset, UNB and Wavelet tranform methods are the best
techniques reserving spatial and spectral information of original MS image,
respectively. However, the UNB technique gives best results when it comes to
impervious surface classification especially in the case of shadow area
included in non-impervious surface group.
| cs.CV | impervious surface is an important indicator for urban development monitoring accurate urban impervious surfaces mapping with vnredsat1 remains challenging due to their spectral diversity not captured by individual pan image in this artical five multiresolution image fusion techniques were compared for classification task of urban impervious surface the result shows that for vnredsat1 dataset unb and wavelet tranform methods are the best techniques reserving spatial and spectral information of original ms image respectively however the unb technique gives best results when it comes to impervious surface classification especially in the case of shadow area included in nonimpervious surface group | [['impervious', 'surface', 'is', 'an', 'important', 'indicator', 'for', 'urban', 'development', 'monitoring', 'accurate', 'urban', 'impervious', 'surfaces', 'mapping', 'with', 'vnredsat1', 'remains', 'challenging', 'due', 'to', 'their', 'spectral', 'diversity', 'not', 'captured', 'by', 'individual', 'pan', 'image', 'in', 'this', 'artical', 'five', 'multiresolution', 'image', 'fusion', 'techniques', 'were', 'compared', 'for', 'classification', 'task', 'of', 'urban', 'impervious', 'surface', 'the', 'result', 'shows', 'that', 'for', 'vnredsat1', 'dataset', 'unb', 'and', 'wavelet', 'tranform', 'methods', 'are', 'the', 'best', 'techniques', 'reserving', 'spatial', 'and', 'spectral', 'information', 'of', 'original', 'ms', 'image', 'respectively', 'however', 'the', 'unb', 'technique', 'gives', 'best', 'results', 'when', 'it', 'comes', 'to', 'impervious', 'surface', 'classification', 'especially', 'in', 'the', 'case', 'of', 'shadow', 'area', 'included', 'in', 'nonimpervious', 'surface', 'group']] | [-0.04415501786165477, -0.007925978589163296, -0.09378483468551457, 0.09931076533093895, -0.032381658291098535, -0.14338946588260612, 0.00949036190766342, 0.44390868176658127, -0.20035191045440348, -0.3484535656638981, 0.15393238617515326, -0.2466016518259325, -0.18561509545393212, 0.270455547075565, -0.21231331457335925, 0.07586305455326285, 0.11526727271698338, 0.009659978954755153, -0.036537319102526174, -0.26634037488418605, 0.2880026431485396, 0.06127750968618184, 0.38282971479689953, 0.07742613327891096, 0.06315767010865905, 0.016850882217038385, -0.14547727281976605, -0.031614076720608265, -0.07541458936896926, 0.18253359194489716, 0.34314598676450936, 0.13033923611270515, 0.2354618588644896, -0.37286345328482773, -0.2551228877123368, 0.049170334530591046, 0.1437899910925273, 0.06784423404210008, -0.031216678612855906, -0.28961504110346364, 0.09012150469466507, -0.1287609993374532, -0.07759671158321711, -0.08274332069571025, 0.018889556605292044, -0.047449160334846176, -0.2047177396685471, 0.11170751424794345, 0.07108477606514911, 0.10323768930951345, -0.08294262773760584, -0.09962644508185307, -0.03888188724012412, 0.21695360118318013, 0.038560633682921897, 0.07200880985606231, 0.15119396678181654, -0.1677945081226182, -0.05100130433571938, 0.3738669743545392, -0.055923246320087425, -0.16475175036424675, 0.22090839237435578, -0.09474618288870786, -0.1174695901668717, 0.19111257767516007, 0.17130047431426873, 0.09247536043223646, -0.1541379387425943, 0.021151457249532577, -0.013365197571512964, 0.17088269134119308, 0.08998333670429348, -0.0017966529421661933, 0.16172697408047995, 0.22142691790671135, 0.09902720366239778, 0.08764410791102528, -0.18505750131822124, -0.01810286225770245, -0.14224431248977012, -0.11422711609938954, -0.19040352664167812, -0.01591095416407586, -0.09557679716525264, -0.1375291924083548, 0.3665094044558781, 0.1365865249830039, 0.1499891034855517, 0.01694770956162325, 0.3254268148280296, 0.013777125139538314, 0.07928733590968702, 0.0644692896004795, 0.16203881294068104, 0.05902443498315424, 0.09021939368937741, -0.16505778798132598, 0.04642269430806879, 0.07818205699747063] |
1,803.02327 | On the stationary solutions of Doi-Onsager model in general dimension | We give new results of the phase transition of dilute colloidal solutions of
rod-like molecules in dimension $D \geq 3$. For the low concentration of
particles in a carrier fluid, we prove that the isotropic phase is the unique
solution to the Doi-Onsager model with the general potential kernel. In
addition, we present the regime of the bifurcation of nematic phases in the
class of axially symmetric solutions. Our method is based on a generalization
of the classical Leray-Schauder degree we developed for this problem.
| math.AP | we give new results of the phase transition of dilute colloidal solutions of rodlike molecules in dimension d geq 3 for the low concentration of particles in a carrier fluid we prove that the isotropic phase is the unique solution to the doionsager model with the general potential kernel in addition we present the regime of the bifurcation of nematic phases in the class of axially symmetric solutions our method is based on a generalization of the classical lerayschauder degree we developed for this problem | [['we', 'give', 'new', 'results', 'of', 'the', 'phase', 'transition', 'of', 'dilute', 'colloidal', 'solutions', 'of', 'rodlike', 'molecules', 'in', 'dimension', 'd', 'geq', '3', 'for', 'the', 'low', 'concentration', 'of', 'particles', 'in', 'a', 'carrier', 'fluid', 'we', 'prove', 'that', 'the', 'isotropic', 'phase', 'is', 'the', 'unique', 'solution', 'to', 'the', 'doionsager', 'model', 'with', 'the', 'general', 'potential', 'kernel', 'in', 'addition', 'we', 'present', 'the', 'regime', 'of', 'the', 'bifurcation', 'of', 'nematic', 'phases', 'in', 'the', 'class', 'of', 'axially', 'symmetric', 'solutions', 'our', 'method', 'is', 'based', 'on', 'a', 'generalization', 'of', 'the', 'classical', 'lerayschauder', 'degree', 'we', 'developed', 'for', 'this', 'problem']] | [-0.15055592642987475, 0.12185715448439997, -0.09050667735145372, -0.006424203393159106, 0.00342608525089043, -0.12502696158035714, 0.023121431300087886, 0.3128738380749436, -0.2374320675235461, -0.23318168956320734, 0.06985225620309768, -0.2704324692487717, -0.18001441463608953, 0.12323189722100163, -0.018663177726899877, 0.05749038723023499, -0.021373405285617885, 0.01636188825701966, -0.0697021896540023, -0.20155415910789196, 0.3355488666881095, -0.0202864355791141, 0.26022711822434386, 0.07200032037628047, 0.11693171739359112, -0.015242542129229097, 0.08374137275797479, 0.029648887256489082, -0.2208218365911949, 0.09887704652432791, 0.22267772094346583, 0.03478733161875211, 0.20432122873471065, -0.4115595242118134, -0.22038850460530204, 0.13994977805379996, 0.14156084442511202, 0.16844992752680008, -0.11383632615290801, -0.2632856598671745, 0.08298441963646945, -0.1419153551613871, -0.21684278966858983, -0.07158979285946664, 0.02860418542781297, 0.06250507730771514, -0.27467138567829835, 0.13684183447347845, 0.10262939924209871, 0.03891541664574213, -0.12402006770648501, -0.09689403081942788, 0.026816475876223517, 0.061294550803380414, 0.032683204096632404, 0.012883779992732932, 0.07691334965912734, -0.15492859201998832, -0.07760772268452189, 0.3853958183516036, -0.0819752113236224, -0.2195455435745637, 0.18838278193108957, -0.1720406522784341, -0.127733333847102, 0.17029448519734774, 0.18084246350952204, 0.1880716663073091, -0.08805477818583742, 0.10295857259325739, -0.0748985625036499, 0.16657820116482017, 0.025379038865075393, -0.017596364138401387, 0.16059563192812837, 0.20195673553492216, 0.0796460571096224, 0.19888249479289002, -0.0973647443111986, -0.11917327668736963, -0.28126768697710597, -0.21384601344299667, -0.19712817059720264, 0.02599364979302182, -0.15743770926971645, -0.19149386554079897, 0.4120805054793463, 0.11725124101058634, 0.14918585735208847, 0.06410623254144893, 0.21282948549727307, 0.08602561601848506, -0.03493301273487946, 0.061018731412203875, 0.2622180624810212, 0.15111652336850323, 0.12191950670607826, -0.20119526928756387, 0.011271448794971495, 0.12591845278409036] |
1,803.02328 | Hidden Symmetries in Real and Theoretical Networks | Symmetries are ubiquitous in real networks and often characterize network
features and functions. Here we present a generalization of network symmetry
called \emph{latent symmetry}, which is an extension of the standard notion of
symmetry. They are defined in terms of standard symmetries in a reduced version
of the network. One unique aspect of latent symmetries is that each one is
associated with a \emph{size}, which provides a way of discussing symmetries at
multiple scales in a network. We are able to demonstrate a number of examples
of networks (graphs) which contain latent symmetry, including a number of real
networks. In numerical experiments, we show that latent symmetries are found
more frequently in graphs built using preferential attachment, a standard model
of network growth, when compared to non-network like (Erd{\H o}s-R\'enyi)
graphs. Finally we prove that if vertices in a network are latently symmetric,
then they must have the same eigenvector centrality, similar to vertices which
are symmetric in the standard sense. This suggests that the latent symmetries
present in real-networks may serve the same structural and functional purpose
standard symmetries do in these networks. We conclude from these facts and
observations that \emph{latent symmetries} are present in real networks and
provide useful information about the network potentially beyond standard
symmetries as they can appear at multiple scales.
| physics.soc-ph cond-mat.dis-nn cs.SI | symmetries are ubiquitous in real networks and often characterize network features and functions here we present a generalization of network symmetry called emphlatent symmetry which is an extension of the standard notion of symmetry they are defined in terms of standard symmetries in a reduced version of the network one unique aspect of latent symmetries is that each one is associated with a emphsize which provides a way of discussing symmetries at multiple scales in a network we are able to demonstrate a number of examples of networks graphs which contain latent symmetry including a number of real networks in numerical experiments we show that latent symmetries are found more frequently in graphs built using preferential attachment a standard model of network growth when compared to nonnetwork like erdh osrenyi graphs finally we prove that if vertices in a network are latently symmetric then they must have the same eigenvector centrality similar to vertices which are symmetric in the standard sense this suggests that the latent symmetries present in realnetworks may serve the same structural and functional purpose standard symmetries do in these networks we conclude from these facts and observations that emphlatent symmetries are present in real networks and provide useful information about the network potentially beyond standard symmetries as they can appear at multiple scales | [['symmetries', 'are', 'ubiquitous', 'in', 'real', 'networks', 'and', 'often', 'characterize', 'network', 'features', 'and', 'functions', 'here', 'we', 'present', 'a', 'generalization', 'of', 'network', 'symmetry', 'called', 'emphlatent', 'symmetry', 'which', 'is', 'an', 'extension', 'of', 'the', 'standard', 'notion', 'of', 'symmetry', 'they', 'are', 'defined', 'in', 'terms', 'of', 'standard', 'symmetries', 'in', 'a', 'reduced', 'version', 'of', 'the', 'network', 'one', 'unique', 'aspect', 'of', 'latent', 'symmetries', 'is', 'that', 'each', 'one', 'is', 'associated', 'with', 'a', 'emphsize', 'which', 'provides', 'a', 'way', 'of', 'discussing', 'symmetries', 'at', 'multiple', 'scales', 'in', 'a', 'network', 'we', 'are', 'able', 'to', 'demonstrate', 'a', 'number', 'of', 'examples', 'of', 'networks', 'graphs', 'which', 'contain', 'latent', 'symmetry', 'including', 'a', 'number', 'of', 'real', 'networks', 'in', 'numerical', 'experiments', 'we', 'show', 'that', 'latent', 'symmetries', 'are', 'found', 'more', 'frequently', 'in', 'graphs', 'built', 'using', 'preferential', 'attachment', 'a', 'standard', 'model', 'of', 'network', 'growth', 'when', 'compared', 'to', 'nonnetwork', 'like', 'erdh', 'osrenyi', 'graphs', 'finally', 'we', 'prove', 'that', 'if', 'vertices', 'in', 'a', 'network', 'are', 'latently', 'symmetric', 'then', 'they', 'must', 'have', 'the', 'same', 'eigenvector', 'centrality', 'similar', 'to', 'vertices', 'which', 'are', 'symmetric', 'in', 'the', 'standard', 'sense', 'this', 'suggests', 'that', 'the', 'latent', 'symmetries', 'present', 'in', 'realnetworks', 'may', 'serve', 'the', 'same', 'structural', 'and', 'functional', 'purpose', 'standard', 'symmetries', 'do', 'in', 'these', 'networks', 'we', 'conclude', 'from', 'these', 'facts', 'and', 'observations', 'that', 'emphlatent', 'symmetries', 'are', 'present', 'in', 'real', 'networks', 'and', 'provide', 'useful', 'information', 'about', 'the', 'network', 'potentially', 'beyond', 'standard', 'symmetries', 'as', 'they', 'can', 'appear', 'at', 'multiple', 'scales']] | [-0.12336413219249893, 0.10242074564552307, -0.06988635266855082, 0.09713790558075912, -0.0938782990841126, -0.1304854411411927, -0.01007302774491513, 0.41016168498511735, -0.29164777512455153, -0.2879088264879236, 0.09927699268128318, -0.28586832302001614, -0.21299847168632335, 0.12920346557264026, -0.06947919475216488, 0.01815490699502536, 0.04603170080237625, 0.07972623191084562, -0.051228908297532516, -0.23621079398597228, 0.32389730357358026, 0.013080707023618743, 0.2742288125338274, 0.019850273620923637, 0.06280619771321115, -0.041564750004370044, -0.00775478264161696, 0.04651429949175239, -0.06536415425704979, 0.12231129135815771, 0.2637804879858676, 0.13149550498821083, 0.24604259554676158, -0.45201054202496177, -0.23744286341092516, 0.1289051494612876, 0.14158340593308416, 0.11592571473037996, -0.016246805780610885, -0.2840871195032917, 0.1146800799954993, -0.1499674089104196, -0.0971097887614397, -0.11852755011231811, -0.03506951130435078, 0.024463837430866314, -0.2617188280047331, 0.05482891013875983, 0.06754440038127575, 0.055225181734284784, -0.00012258723317817958, -0.10362640160881845, -0.07817721310022063, 0.11891837941476735, 0.0291131794200973, -0.030097429198105128, 0.08148510776744741, -0.1319829925724426, -0.18030717616946074, 0.40928100933820977, -0.0212191374203367, -0.21988845821599373, 0.19128396573769688, -0.10484767486276622, -0.22662516409332897, 0.0693405646457837, 0.19561191356775384, 0.09783711538559012, -0.14301513670438404, 0.05178713739803276, -0.09245610891203224, 0.135507635896189, 0.04186014695356048, 0.04918957022191198, 0.17328512392877773, 0.15615754777940716, 0.06970818088760737, 0.13066140049421746, -0.04262250922733478, -0.1147500109628136, -0.29818589167499104, -0.12912224822125776, -0.1854236256924061, 0.043983680274794566, -0.13025685259391914, -0.15134808279711892, 0.41387346143299647, 0.15664895601124348, 0.2335414461795827, 0.08835596696439164, 0.20230705733357118, 0.04841139152402455, 0.1387015289489042, 0.11447060816162438, 0.17393338046881748, 0.09360817420572319, 0.058481033598245295, -0.11732285911879174, 0.07208385247994792, 0.051059479635484795] |
1,803.02329 | Learning Memory Access Patterns | The explosion in workload complexity and the recent slow-down in Moore's law
scaling call for new approaches towards efficient computing. Researchers are
now beginning to use recent advances in machine learning in software
optimizations, augmenting or replacing traditional heuristics and data
structures. However, the space of machine learning for computer hardware
architecture is only lightly explored. In this paper, we demonstrate the
potential of deep learning to address the von Neumann bottleneck of memory
performance. We focus on the critical problem of learning memory access
patterns, with the goal of constructing accurate and efficient memory
prefetchers. We relate contemporary prefetching strategies to n-gram models in
natural language processing, and show how recurrent neural networks can serve
as a drop-in replacement. On a suite of challenging benchmark datasets, we find
that neural networks consistently demonstrate superior performance in terms of
precision and recall. This work represents the first step towards practical
neural-network based prefetching, and opens a wide range of exciting directions
for machine learning in computer architecture research.
| cs.LG stat.ML | the explosion in workload complexity and the recent slowdown in moores law scaling call for new approaches towards efficient computing researchers are now beginning to use recent advances in machine learning in software optimizations augmenting or replacing traditional heuristics and data structures however the space of machine learning for computer hardware architecture is only lightly explored in this paper we demonstrate the potential of deep learning to address the von neumann bottleneck of memory performance we focus on the critical problem of learning memory access patterns with the goal of constructing accurate and efficient memory prefetchers we relate contemporary prefetching strategies to ngram models in natural language processing and show how recurrent neural networks can serve as a dropin replacement on a suite of challenging benchmark datasets we find that neural networks consistently demonstrate superior performance in terms of precision and recall this work represents the first step towards practical neuralnetwork based prefetching and opens a wide range of exciting directions for machine learning in computer architecture research | [['the', 'explosion', 'in', 'workload', 'complexity', 'and', 'the', 'recent', 'slowdown', 'in', 'moores', 'law', 'scaling', 'call', 'for', 'new', 'approaches', 'towards', 'efficient', 'computing', 'researchers', 'are', 'now', 'beginning', 'to', 'use', 'recent', 'advances', 'in', 'machine', 'learning', 'in', 'software', 'optimizations', 'augmenting', 'or', 'replacing', 'traditional', 'heuristics', 'and', 'data', 'structures', 'however', 'the', 'space', 'of', 'machine', 'learning', 'for', 'computer', 'hardware', 'architecture', 'is', 'only', 'lightly', 'explored', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'potential', 'of', 'deep', 'learning', 'to', 'address', 'the', 'von', 'neumann', 'bottleneck', 'of', 'memory', 'performance', 'we', 'focus', 'on', 'the', 'critical', 'problem', 'of', 'learning', 'memory', 'access', 'patterns', 'with', 'the', 'goal', 'of', 'constructing', 'accurate', 'and', 'efficient', 'memory', 'prefetchers', 'we', 'relate', 'contemporary', 'prefetching', 'strategies', 'to', 'ngram', 'models', 'in', 'natural', 'language', 'processing', 'and', 'show', 'how', 'recurrent', 'neural', 'networks', 'can', 'serve', 'as', 'a', 'dropin', 'replacement', 'on', 'a', 'suite', 'of', 'challenging', 'benchmark', 'datasets', 'we', 'find', 'that', 'neural', 'networks', 'consistently', 'demonstrate', 'superior', 'performance', 'in', 'terms', 'of', 'precision', 'and', 'recall', 'this', 'work', 'represents', 'the', 'first', 'step', 'towards', 'practical', 'neuralnetwork', 'based', 'prefetching', 'and', 'opens', 'a', 'wide', 'range', 'of', 'exciting', 'directions', 'for', 'machine', 'learning', 'in', 'computer', 'architecture', 'research']] | [-0.07450357506292805, 0.004344271117588505, -0.0531575755837063, 0.044671458917686584, -0.12490856446536436, -0.19795910763787106, 0.069693718663378, 0.4449153170419214, -0.2910092773021288, -0.32483645696421654, 0.07329220938152589, -0.23143626271935536, -0.19614638390166442, 0.25973175019663314, -0.15301150048818662, 0.13656978558061555, 0.1466180000487449, 0.014083240935135456, -0.07933782408751237, -0.28510459682521677, 0.2688399654247665, 0.07646684366721145, 0.3731948957235242, 0.032121552500895975, 0.08209498622523997, -0.04113636863517708, -0.026169512522063173, -0.03037795460234823, -0.0831241308924291, 0.1994463446338029, 0.33052360774822126, 0.22091039068930382, 0.3785308420414194, -0.4526018324984415, -0.24481766408592062, 0.07942571370430025, 0.16899924590169185, 0.11330110985597587, -0.06366735521476671, -0.2699537484718132, 0.0774687390671932, -0.2095715677188266, -0.01045223918724029, -0.16377994983035715, 0.00868339457693288, -0.0006369387965172617, -0.23545553238779707, -0.002299087407577428, 0.06357271346427124, 0.08184182816850287, -0.005657903402433952, -0.1356133098791664, 0.10230572120053694, 0.1334784479847821, 0.00012993990856644122, 0.061988575941844225, 0.1343109198441241, -0.20653939173124464, -0.2123921781340392, 0.36041418450795826, -0.040751585570563166, -0.14427125256597287, 0.19609831815302772, -0.0014965870414882722, -0.2174303809408143, 0.03143917183790888, 0.2632686390397361, 0.0681812698058344, -0.14496774291633518, 0.0753227134707794, 0.03132874347474648, 0.14388132375565224, 0.04172781355667948, 0.020467053436385912, 0.19347248499980196, 0.33588185214570593, 0.0321784042420664, 0.14920341841518944, -0.07319205083365973, -0.12732811746952524, -0.1795615082179817, -0.16602657335715776, -0.20081705529065358, -0.0053499241157190965, -0.07814510444603955, -0.14807231793903547, 0.373702993009439, 0.2540868247243842, 0.1540364354482985, 0.13815921799756498, 0.35081965864325565, 0.01701645628435515, 0.12897693817060263, 0.1355564491185803, 0.160739659277689, 0.029271628508078202, 0.21006227014558612, -0.17944529082922686, 0.07286593710887246, 0.022239262832434697] |
1,803.0233 | On almost revlex ideals with Hilbert function of complete intersections | In this paper, we investigate the behavior of almost reverse lexicographic
ideals with the Hilbert function of a complete intersection. More precisely,
over a field $K$, we give a new constructive proof of the existence of the
almost revlex ideal $J\subset K[x_1,\dots,x_n]$, with the same Hilbert function
as a complete intersection defined by $n$ forms of degrees $d_1\leq \dots \leq
d_n$. Properties of the reduction numbers for an almost revlex ideal have an
important role in our inductive and constructive proof, which is different from
the more general construction given by Pardue in 2010. We also detect several
cases in which an almost revlex ideal having the same Hilbert function as a
complete intersection corresponds to a singular point in a Hilbert scheme. This
second result is the outcome of a more general study of lower bounds for the
dimension of the tangent space to a Hilbert scheme at stable ideals, in terms
of the number of minimal generators.
| math.AC | in this paper we investigate the behavior of almost reverse lexicographic ideals with the hilbert function of a complete intersection more precisely over a field k we give a new constructive proof of the existence of the almost revlex ideal jsubset kx_1dotsx_n with the same hilbert function as a complete intersection defined by n forms of degrees d_1leq dots leq d_n properties of the reduction numbers for an almost revlex ideal have an important role in our inductive and constructive proof which is different from the more general construction given by pardue in 2010 we also detect several cases in which an almost revlex ideal having the same hilbert function as a complete intersection corresponds to a singular point in a hilbert scheme this second result is the outcome of a more general study of lower bounds for the dimension of the tangent space to a hilbert scheme at stable ideals in terms of the number of minimal generators | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'behavior', 'of', 'almost', 'reverse', 'lexicographic', 'ideals', 'with', 'the', 'hilbert', 'function', 'of', 'a', 'complete', 'intersection', 'more', 'precisely', 'over', 'a', 'field', 'k', 'we', 'give', 'a', 'new', 'constructive', 'proof', 'of', 'the', 'existence', 'of', 'the', 'almost', 'revlex', 'ideal', 'jsubset', 'kx_1dotsx_n', 'with', 'the', 'same', 'hilbert', 'function', 'as', 'a', 'complete', 'intersection', 'defined', 'by', 'n', 'forms', 'of', 'degrees', 'd_1leq', 'dots', 'leq', 'd_n', 'properties', 'of', 'the', 'reduction', 'numbers', 'for', 'an', 'almost', 'revlex', 'ideal', 'have', 'an', 'important', 'role', 'in', 'our', 'inductive', 'and', 'constructive', 'proof', 'which', 'is', 'different', 'from', 'the', 'more', 'general', 'construction', 'given', 'by', 'pardue', 'in', '2010', 'we', 'also', 'detect', 'several', 'cases', 'in', 'which', 'an', 'almost', 'revlex', 'ideal', 'having', 'the', 'same', 'hilbert', 'function', 'as', 'a', 'complete', 'intersection', 'corresponds', 'to', 'a', 'singular', 'point', 'in', 'a', 'hilbert', 'scheme', 'this', 'second', 'result', 'is', 'the', 'outcome', 'of', 'a', 'more', 'general', 'study', 'of', 'lower', 'bounds', 'for', 'the', 'dimension', 'of', 'the', 'tangent', 'space', 'to', 'a', 'hilbert', 'scheme', 'at', 'stable', 'ideals', 'in', 'terms', 'of', 'the', 'number', 'of', 'minimal', 'generators']] | [-0.15976323670529724, 0.0771173506958883, -0.09068828627596018, 0.04559422089021255, -0.03234481710483724, -0.09247548002222518, 0.011888585669140818, 0.2921834795372619, -0.2769978749448633, -0.21461098795791841, 0.08771240204988551, -0.2373291157806913, -0.1187175015388818, 0.20729396077540685, -0.08483386237713152, -0.0088447899024629, 0.019835598717016057, 0.0759985730749022, -0.09161385576937746, -0.30364289732193045, 0.3753837781706415, 0.035221762952260066, 0.2170055025511966, 0.02088723508289681, 0.09907186229027948, 0.027153663524666673, 0.008939764499019995, 0.005528527845631031, -0.17162676918197353, 0.13438114164977, 0.2846210142597556, 0.11285455173039634, 0.2800439368851436, -0.3723813624607411, -0.10709613380179764, 0.17451700613593812, 0.13107988233355888, 0.042740256532897834, -8.484082281481146e-05, -0.20686981459177514, 0.10160831721358986, -0.1540937920821444, -0.1891433133673415, -0.05546135409682427, 0.0676127679670909, -0.007831235574817384, -0.2950661367496604, -0.007223250981568177, 0.1495271511141609, 0.14124650613598103, -0.01743075991658576, -0.09288602928724726, -0.0258663432034166, 0.06691114484177281, -0.04429176474962407, 0.043296392768352, 0.021745795673989463, -0.10849396441330982, -0.14615458544671722, 0.3571173599818663, -0.06923843597306477, -0.20216949468730427, 0.14726600481003946, -0.1639477466877386, -0.11237322241243608, 0.12837205700716883, 0.11785013549931862, 0.17948779407537208, -0.0823553608124197, 0.13872600048040948, -0.1357797001599797, 0.09236617869958896, 0.09398022513696046, 0.07062126643759485, 0.11887843974824971, 0.12481399487012869, 0.14770193091731332, 0.1700183086671263, 0.019917318986219196, -0.056380322771205464, -0.38718391458193463, -0.22937990723155094, -0.17790383125110618, 0.1122571489357817, -0.128481389674905, -0.19615167610672354, 0.40720257912366176, 0.08709220619837069, 0.22853001794974032, 0.06487975939786143, 0.2650031362361503, 0.093833569120235, 0.03151777494441038, 0.07509084467801014, 0.1644122685458066, 0.15442876513233209, 0.0004423690554188014, -0.13180701382499943, 0.026796173796338855, 0.14487031145817922] |
1,803.02331 | Pathways to Fragmentation:User Flows and Web Distribution
Infrastructures | This study analyzes how web audiences flow across online digital features. We
construct a directed network of user flows based on sequential user
clickstreams for all popular websites (n=1761), using traffic data obtained
from a panel of a million web users in the United States. We analyze these data
to identify constellations of websites that are frequently browsed together in
temporal sequences, both by similar user groups in different browsing sessions
as well as by disparate users. Our analyses thus render visible previously
hidden online collectives and generate insight into the varied roles that
curatorial infrastructures may play in shaping audience fragmentation on the
web.
| cs.CY | this study analyzes how web audiences flow across online digital features we construct a directed network of user flows based on sequential user clickstreams for all popular websites n1761 using traffic data obtained from a panel of a million web users in the united states we analyze these data to identify constellations of websites that are frequently browsed together in temporal sequences both by similar user groups in different browsing sessions as well as by disparate users our analyses thus render visible previously hidden online collectives and generate insight into the varied roles that curatorial infrastructures may play in shaping audience fragmentation on the web | [['this', 'study', 'analyzes', 'how', 'web', 'audiences', 'flow', 'across', 'online', 'digital', 'features', 'we', 'construct', 'a', 'directed', 'network', 'of', 'user', 'flows', 'based', 'on', 'sequential', 'user', 'clickstreams', 'for', 'all', 'popular', 'websites', 'n1761', 'using', 'traffic', 'data', 'obtained', 'from', 'a', 'panel', 'of', 'a', 'million', 'web', 'users', 'in', 'the', 'united', 'states', 'we', 'analyze', 'these', 'data', 'to', 'identify', 'constellations', 'of', 'websites', 'that', 'are', 'frequently', 'browsed', 'together', 'in', 'temporal', 'sequences', 'both', 'by', 'similar', 'user', 'groups', 'in', 'different', 'browsing', 'sessions', 'as', 'well', 'as', 'by', 'disparate', 'users', 'our', 'analyses', 'thus', 'render', 'visible', 'previously', 'hidden', 'online', 'collectives', 'and', 'generate', 'insight', 'into', 'the', 'varied', 'roles', 'that', 'curatorial', 'infrastructures', 'may', 'play', 'in', 'shaping', 'audience', 'fragmentation', 'on', 'the', 'web']] | [-0.10114942949551803, 0.05893364036903502, -0.07394813582336959, 0.12953817107280394, -0.12975131431840753, -0.1523062342670388, 0.08934795152610885, 0.4331206697254227, -0.2555176912036796, -0.35370208810155207, 0.07735027128812642, -0.3227980734887891, -0.15426200267393142, 0.202712043788499, -0.07683716122455035, -0.018997897805932622, 0.05804814021282185, 0.037475992226973176, 0.04052984977785785, -0.30886660708347335, 0.3241668336021786, 0.03682040494795029, 0.34506036591931033, 0.012408809154294431, 0.02271062029579368, 0.032089497634352974, -0.1425127341823939, -0.014626015229553629, -0.09003920445978181, 0.1422198268762888, 0.40428692984726067, 0.2252716625091405, 0.3110927754090741, -0.44434142499589, -0.2169099451700906, 0.02453850283256123, 0.17395372590712774, 0.06996728593143277, -0.06422014662530273, -0.37190756130999386, 0.09884923835040983, -0.1938033191791664, -0.0018203167486577653, -0.08038532963725559, -0.022547252709046006, 0.07281334685607223, -0.22539318954715362, -0.011754605236581903, -0.04241285622769143, 0.13454970080727854, 0.00331694443593733, -0.07005267997178286, -0.03947843293784759, 0.26680408795632854, 0.08103208080865443, -0.05559231369541241, 0.18061798020230177, -0.15475286026608395, -0.15924063156461882, 0.369952929403203, 0.0038555080805403683, -0.10490823259505515, 0.18490218965990396, -0.04079893902123261, -0.1639283814986881, 0.09758342549992868, 0.329403571659126, 0.06580490337756391, -0.22854610385785726, -0.038392883130514886, -0.10435074033627573, 0.20475005636063331, 0.11052348755317955, 0.024933944262626868, 0.21147403962207206, 0.17262455580147126, 0.04434104600491432, 0.12007095253703973, -0.00022982456721365452, -0.10978106108198588, -0.18997963590216108, -0.11527851420508411, -0.1125446052319603, -0.0166525693020958, -0.11783903302127258, -0.13129303138926984, 0.4212790034675541, 0.1783939697835684, 0.17917165953594333, 0.033377176009358106, 0.2967488521065276, -0.06537294130472358, 0.11875844819027967, 0.12918542473702332, 0.09246032916976568, -0.04012383119865822, 0.24495763255981728, -0.10000693044723728, 0.11775196449329647, 0.009282915008952841] |
1,803.02332 | The Frankel property for self-shrinkers from the viewpoint of elliptic
PDE's | We show that two properly embedded self-shrinkers in Euclidean space that are
sufficiently separated at infinity must intersect at a finite point. The proof
is based on a localized version of the Reilly formula applied to a suitable
f-harmonic function with controlled gradient. In the immersed case, a new
direct proof of the generalized half-space property is also presented.
| math.DG | we show that two properly embedded selfshrinkers in euclidean space that are sufficiently separated at infinity must intersect at a finite point the proof is based on a localized version of the reilly formula applied to a suitable fharmonic function with controlled gradient in the immersed case a new direct proof of the generalized halfspace property is also presented | [['we', 'show', 'that', 'two', 'properly', 'embedded', 'selfshrinkers', 'in', 'euclidean', 'space', 'that', 'are', 'sufficiently', 'separated', 'at', 'infinity', 'must', 'intersect', 'at', 'a', 'finite', 'point', 'the', 'proof', 'is', 'based', 'on', 'a', 'localized', 'version', 'of', 'the', 'reilly', 'formula', 'applied', 'to', 'a', 'suitable', 'fharmonic', 'function', 'with', 'controlled', 'gradient', 'in', 'the', 'immersed', 'case', 'a', 'new', 'direct', 'proof', 'of', 'the', 'generalized', 'halfspace', 'property', 'is', 'also', 'presented']] | [-0.12820240965712879, 0.11884347982388938, -0.14445264430685065, 0.08098613202840216, -0.07056425458167569, -0.15493838043915012, -0.002587106860226999, 0.3726905542978291, -0.2585908888002573, -0.1661564716911417, 0.13231864049478229, -0.2633309714117293, -0.12206535195237246, 0.21572627273183, -0.09117681714627197, 0.00046666515833240443, 0.06909859681430952, 0.03538894031386254, -0.07773707691437991, -0.23926039425245785, 0.3503442169877432, -0.07197525324812948, 0.2569471976041036, 0.11317111532819474, 0.1287895939125427, 0.03265410953722263, 0.032396937073287314, 0.09440253614161906, -0.15474281271537804, 0.12043224334306384, 0.22906418315182298, 0.036343560435698696, 0.28276232652508226, -0.4068105972798194, -0.19471146560952826, 0.13470537731644966, 0.16369591455243654, 0.06274386673723742, -0.08099719431543312, -0.2549025223756177, 0.12826221327344745, -0.0813013456635556, -0.22562197165689984, -0.022193805156749184, -0.010560856810455226, 0.007994610895165953, -0.25538572088136513, 0.013647096684908936, 0.11818931632777833, 0.04906783919086901, -0.06359091470949352, -0.07137185063655094, -0.02084143854425115, 0.06446524258797705, -0.03413173797840284, 0.10011725566128932, 0.09580689980411682, 0.002379858850548833, -0.034371718174335944, 0.3212953954698297, -0.13072809000831034, -0.30915099952243646, 0.17973798152327664, -0.13411317135886117, -0.13308798475190997, 0.10201581839030072, 0.15454719751536594, 0.18366665884031583, -0.11133697404332807, 0.13910173122984185, -0.07897641980168173, 0.1103721022220147, 0.08801659421553298, -0.027268481093569327, 0.15472503347417055, 0.10707784142597752, 0.14684845605012725, 0.19944477880026323, -0.03321764189986733, -0.09863887294748072, -0.4225193988058274, -0.20104810410826388, -0.25626517596686166, 0.05922307484483315, -0.10945132802293825, -0.2112498327347813, 0.32239801533741214, 0.0402855404763151, 0.20344159023646832, 0.08353508617413247, 0.26683661632113537, 0.12278916511558376, 0.04785930498708355, 0.10333013532967386, 0.19502735543617253, 0.12933713187053167, 0.04697355206550683, -0.11479426837542046, -0.006902898945924589, 0.20210302685055945] |
1,803.02333 | Eilenberg--Mac Lane Spaces for Topological Groups | The goal of this paper is to establish a topological version of the notion of
an Eilenberg-Mac Lane space. If $X$ is a pointed topological space, $\pi_1(X)$
has a natural topology coming from the compact-open topology on the space of
maps $S^1 \to X$. In general the construction does not produce a topological
group because it is possible to create examples where the group multiplication
$\pi_1(X) \times \pi_1(X) \to \pi_1(X)$ is discontinuous. This failure to
obtain a topological group has been noticed by others, for example Fabel.
However, if we work in the category of compactly generated, weakly Hausdorff
spaces, we may retopologise both the space of maps $S^1 \to X$ and the product
$\pi_1(X) \times \pi_1(X)$ with compactly generated topologies to get that
$\pi_1(X)$ is a group object in this category. Such group objects are known as
$k$-groups.
Next we construct the Eilenberg-Mac Lane space $K(G,1)$ for any totally
path-disconnected $k$-group $G$. The main point of this paper is to show that,
for such a $G$, $\pi_1(K(G,1))$ is isomorphic to $G$ in the category of
$k$-groups.
All totally disconnected locally compact groups are $k$-groups and so our
results apply in particular to profinite groups. This answers questions that
have been raised by Sauer.
We also show that there are Mayer-Vietoris sequences and a Seifert-van Kampen
theorem in this theory.
The theory requires a careful analysis using model structures and other
homotopical structures on cartesian closed categories as we shall see that no
theory can be comfortably developed in the classical world.
| math.GR math.AT | the goal of this paper is to establish a topological version of the notion of an eilenbergmac lane space if x is a pointed topological space pi_1x has a natural topology coming from the compactopen topology on the space of maps s1 to x in general the construction does not produce a topological group because it is possible to create examples where the group multiplication pi_1x times pi_1x to pi_1x is discontinuous this failure to obtain a topological group has been noticed by others for example fabel however if we work in the category of compactly generated weakly hausdorff spaces we may retopologise both the space of maps s1 to x and the product pi_1x times pi_1x with compactly generated topologies to get that pi_1x is a group object in this category such group objects are known as kgroups next we construct the eilenbergmac lane space kg1 for any totally pathdisconnected kgroup g the main point of this paper is to show that for such a g pi_1kg1 is isomorphic to g in the category of kgroups all totally disconnected locally compact groups are kgroups and so our results apply in particular to profinite groups this answers questions that have been raised by sauer we also show that there are mayervietoris sequences and a seifertvan kampen theorem in this theory the theory requires a careful analysis using model structures and other homotopical structures on cartesian closed categories as we shall see that no theory can be comfortably developed in the classical world | [['the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'establish', 'a', 'topological', 'version', 'of', 'the', 'notion', 'of', 'an', 'eilenbergmac', 'lane', 'space', 'if', 'x', 'is', 'a', 'pointed', 'topological', 'space', 'pi_1x', 'has', 'a', 'natural', 'topology', 'coming', 'from', 'the', 'compactopen', 'topology', 'on', 'the', 'space', 'of', 'maps', 's1', 'to', 'x', 'in', 'general', 'the', 'construction', 'does', 'not', 'produce', 'a', 'topological', 'group', 'because', 'it', 'is', 'possible', 'to', 'create', 'examples', 'where', 'the', 'group', 'multiplication', 'pi_1x', 'times', 'pi_1x', 'to', 'pi_1x', 'is', 'discontinuous', 'this', 'failure', 'to', 'obtain', 'a', 'topological', 'group', 'has', 'been', 'noticed', 'by', 'others', 'for', 'example', 'fabel', 'however', 'if', 'we', 'work', 'in', 'the', 'category', 'of', 'compactly', 'generated', 'weakly', 'hausdorff', 'spaces', 'we', 'may', 'retopologise', 'both', 'the', 'space', 'of', 'maps', 's1', 'to', 'x', 'and', 'the', 'product', 'pi_1x', 'times', 'pi_1x', 'with', 'compactly', 'generated', 'topologies', 'to', 'get', 'that', 'pi_1x', 'is', 'a', 'group', 'object', 'in', 'this', 'category', 'such', 'group', 'objects', 'are', 'known', 'as', 'kgroups', 'next', 'we', 'construct', 'the', 'eilenbergmac', 'lane', 'space', 'kg1', 'for', 'any', 'totally', 'pathdisconnected', 'kgroup', 'g', 'the', 'main', 'point', 'of', 'this', 'paper', 'is', 'to', 'show', 'that', 'for', 'such', 'a', 'g', 'pi_1kg1', 'is', 'isomorphic', 'to', 'g', 'in', 'the', 'category', 'of', 'kgroups', 'all', 'totally', 'disconnected', 'locally', 'compact', 'groups', 'are', 'kgroups', 'and', 'so', 'our', 'results', 'apply', 'in', 'particular', 'to', 'profinite', 'groups', 'this', 'answers', 'questions', 'that', 'have', 'been', 'raised', 'by', 'sauer', 'we', 'also', 'show', 'that', 'there', 'are', 'mayervietoris', 'sequences', 'and', 'a', 'seifertvan', 'kampen', 'theorem', 'in', 'this', 'theory', 'the', 'theory', 'requires', 'a', 'careful', 'analysis', 'using', 'model', 'structures', 'and', 'other', 'homotopical', 'structures', 'on', 'cartesian', 'closed', 'categories', 'as', 'we', 'shall', 'see', 'that', 'no', 'theory', 'can', 'be', 'comfortably', 'developed', 'in', 'the', 'classical', 'world']] | [-0.15416307982260122, 0.09892131385048185, -0.1282393051134873, 0.08489026636802478, -0.1069274181575184, -0.07741805051750082, 0.007422994850898131, 0.42981206482246276, -0.31793254659128106, -0.21943260948436574, 0.11614220674692338, -0.23750364597817092, -0.1677594091912221, 0.20072593327307503, -0.18802045613166787, -0.062455509511393406, 0.04774967369232928, 0.11295505724621997, -0.0677090317568077, -0.2689893142134327, 0.39501237512506066, -0.03458576654215464, 0.22893312461148466, 0.05100124602716777, 0.07786309109970686, -0.038598752594665595, -0.02261929356093113, 0.019914431173909238, -0.14007742296003162, 0.11982307111705473, 0.3175168134630733, 0.07456015543674209, 0.22070211625560338, -0.3561515967744673, -0.20466912293235393, 0.20182369238060463, 0.10193032816272124, 0.02274804381886497, -0.0369892790833781, -0.3328649477447353, 0.16930585424979067, -0.19785326312769264, -0.09493436822066864, -0.09928064475834911, 0.10901104261715626, -0.031854197582429, -0.2100838136337247, -0.04251598587906037, 0.08483405054205158, 0.054589756444329396, -0.04751353305642448, -0.025029212408680317, -0.06335150043014437, 0.1346905446355982, 0.011507667619415799, 0.08546218607056465, 0.1058635241220585, -0.07059441838083008, -0.1257431861520144, 0.4194817263107266, -0.049542867901524706, -0.20099682359385393, 0.18728935422710022, -0.16158546650061203, -0.2037052560626762, 0.12649400190510338, 0.07739526625288906, 0.1427019228877109, -0.03499763053203482, 0.18694037210568035, -0.13016663125205424, 0.12375290948963788, 0.05196435050100028, -0.0010947215198557974, 0.12468477917812584, 0.10920478047562703, 0.12014316490404459, 0.11670904625240044, 0.010161878516702283, -0.006397435361812372, -0.3157916557224047, -0.189820916130092, -0.13541896220516308, 0.12573128686463245, -0.047508877577896666, -0.1797334993644918, 0.3687203279770338, 0.11879593023073656, 0.19504916709059128, 0.0982620040855592, 0.24686462890859995, 0.0480328132891314, 0.05205430106622272, 0.0777207009227676, 0.11910180949105838, 0.186741245833541, -0.021323659202842522, -0.07112520800681875, -0.0018392055194013783, 0.19940554970995553] |
1,803.02334 | A Nonparametric Approach to Measure the Heterogeneous Spatial
Association: Under Spatial Temporal Data | Spatial association and heterogeneity are two critical areas in the research
about spatial analysis, geography, statistics and so on. Though large amounts
of outstanding methods has been proposed and studied, there are few of them
tend to study spatial association under heterogeneous environment.
Additionally, most of the traditional methods are based on distance statistic
and spatial weighted matrix. However, in some abstract spatial situations,
distance statistic can not be applied since we can not even observe the
geographical locations directly. Meanwhile, under these circumstances, due to
invisibility of spatial positions, designing of weight matrix can not
absolutely avoid subjectivity. In this paper, a new entropy-based method, which
is data-driven and distribution-free, has been proposed to help us investigate
spatial association while fully taking the fact that heterogeneity widely
exist. Specifically, this method is not bounded with distance statistic or
weight matrix. Asymmetrical dependence is adopted to reflect the heterogeneity
in spatial association for each individual and the whole discussion in this
paper is performed on spatio-temporal data with only assuming stationary
m-dependent over time.
| econ.EM | spatial association and heterogeneity are two critical areas in the research about spatial analysis geography statistics and so on though large amounts of outstanding methods has been proposed and studied there are few of them tend to study spatial association under heterogeneous environment additionally most of the traditional methods are based on distance statistic and spatial weighted matrix however in some abstract spatial situations distance statistic can not be applied since we can not even observe the geographical locations directly meanwhile under these circumstances due to invisibility of spatial positions designing of weight matrix can not absolutely avoid subjectivity in this paper a new entropybased method which is datadriven and distributionfree has been proposed to help us investigate spatial association while fully taking the fact that heterogeneity widely exist specifically this method is not bounded with distance statistic or weight matrix asymmetrical dependence is adopted to reflect the heterogeneity in spatial association for each individual and the whole discussion in this paper is performed on spatiotemporal data with only assuming stationary mdependent over time | [['spatial', 'association', 'and', 'heterogeneity', 'are', 'two', 'critical', 'areas', 'in', 'the', 'research', 'about', 'spatial', 'analysis', 'geography', 'statistics', 'and', 'so', 'on', 'though', 'large', 'amounts', 'of', 'outstanding', 'methods', 'has', 'been', 'proposed', 'and', 'studied', 'there', 'are', 'few', 'of', 'them', 'tend', 'to', 'study', 'spatial', 'association', 'under', 'heterogeneous', 'environment', 'additionally', 'most', 'of', 'the', 'traditional', 'methods', 'are', 'based', 'on', 'distance', 'statistic', 'and', 'spatial', 'weighted', 'matrix', 'however', 'in', 'some', 'abstract', 'spatial', 'situations', 'distance', 'statistic', 'can', 'not', 'be', 'applied', 'since', 'we', 'can', 'not', 'even', 'observe', 'the', 'geographical', 'locations', 'directly', 'meanwhile', 'under', 'these', 'circumstances', 'due', 'to', 'invisibility', 'of', 'spatial', 'positions', 'designing', 'of', 'weight', 'matrix', 'can', 'not', 'absolutely', 'avoid', 'subjectivity', 'in', 'this', 'paper', 'a', 'new', 'entropybased', 'method', 'which', 'is', 'datadriven', 'and', 'distributionfree', 'has', 'been', 'proposed', 'to', 'help', 'us', 'investigate', 'spatial', 'association', 'while', 'fully', 'taking', 'the', 'fact', 'that', 'heterogeneity', 'widely', 'exist', 'specifically', 'this', 'method', 'is', 'not', 'bounded', 'with', 'distance', 'statistic', 'or', 'weight', 'matrix', 'asymmetrical', 'dependence', 'is', 'adopted', 'to', 'reflect', 'the', 'heterogeneity', 'in', 'spatial', 'association', 'for', 'each', 'individual', 'and', 'the', 'whole', 'discussion', 'in', 'this', 'paper', 'is', 'performed', 'on', 'spatiotemporal', 'data', 'with', 'only', 'assuming', 'stationary', 'mdependent', 'over', 'time']] | [-0.06930090337536758, 0.06724813476140643, -0.10599533010986045, 0.09579378881641588, -0.09572033142274909, -0.15838874929755842, 0.029212266612187798, 0.46648030062259616, -0.27479403145175063, -0.30854547003433963, 0.11859940278983472, -0.22688290872343483, -0.14600577358097566, 0.1423143205492511, -0.1097290725554286, 0.055703713006645054, 0.05240012553317108, 0.05512725041065922, -0.04273531852875791, -0.25597575713944587, 0.33322873579247203, 0.06318936863614397, 0.35788684578655267, 0.06813992232408096, 0.08431943030506052, -0.0030533394578244836, -0.08756836795384579, 0.06546906273191173, -0.05924251134094719, 0.13468238064917554, 0.2564043171072229, 0.14735600457328704, 0.3274910353852072, -0.4057885317303155, -0.25021131476922626, 0.178786880138662, 0.1821344001111628, 0.07254813005144162, -0.014841327238988516, -0.25726557954417906, 0.10757099761729311, -0.13197702835528072, -0.09078247299392429, -0.08189333310208936, 0.010056824883681604, 0.02504727026633651, -0.26882319433357693, 0.10182744166653218, 0.023129664073783862, 0.08222532382598896, -0.010827176957310915, -0.1229815495136226, 0.02546413713830641, 0.15235234703467196, 0.06558535692292726, -0.013131213452046117, 0.08632381387247608, -0.07623824991229601, -0.07627989687681219, 0.36111659389899126, 0.010003885630271986, -0.2592281894263244, 0.23571868983750371, -0.16714269067187548, -0.15823374247317598, 0.10791590276452574, 0.2120364430874329, 0.08824677919519358, -0.20269607547831175, 0.050095428744111554, -0.03499650819783752, 0.1906697952306305, 0.09212159031691651, 0.05188936779232717, 0.18896821853115983, 0.14762110076844692, 0.07002322387817347, 0.083150187485193, -0.14210105331443335, -0.12547392602314122, -0.2228228486699705, -0.10258328651035226, -0.1919346556693701, -0.00416455296806231, -0.09458184692069979, -0.14158816652870254, 0.37765287639487577, 0.1875653206584868, 0.18330633256787798, 0.03330959919532333, 0.2683304591136503, 0.08149652874522746, 0.0960902194318565, 0.06025240474765928, 0.1856340919816987, 0.08227437886077611, 0.09319067897941467, -0.15504289919412803, 0.1533319243760485, 0.018894023101642357] |
1,803.02335 | Mass generation and deconfinement in pure Yang-Mills theory: a
variational study | A simple variational argument based on the Gaussian Effective Potential (GEP)
is put forward to give evidence for mass generation and deconfinement in pure
Yang-Mills SU(N) theory. The GEP analysis shows that the massless gaussian
vacuum of Yang-Mills theory is perturbatively unstable towards a massive
gaussian vacuum, indicating that a massive expansion is the natural choice for
computations in YMT. At finite temperature, the GEP provides an optimal
temperature-dependent mass parameter for the expansion and signals the
occurrence of a weakly first-order phase transition at $T_{c}\approx$ 255 MeV
for $N=3$. The equation of state is found to be in good agreement with the
lattice data. This work is complemented with review material on the standard
and massive expansions of Yang-Mills theory and on the formalism of quantum
field theory at finite temperature. Comparisons are made with lattice results
and numerical tables are provided to support our findings.
| hep-th | a simple variational argument based on the gaussian effective potential gep is put forward to give evidence for mass generation and deconfinement in pure yangmills sun theory the gep analysis shows that the massless gaussian vacuum of yangmills theory is perturbatively unstable towards a massive gaussian vacuum indicating that a massive expansion is the natural choice for computations in ymt at finite temperature the gep provides an optimal temperaturedependent mass parameter for the expansion and signals the occurrence of a weakly firstorder phase transition at t_capprox 255 mev for n3 the equation of state is found to be in good agreement with the lattice data this work is complemented with review material on the standard and massive expansions of yangmills theory and on the formalism of quantum field theory at finite temperature comparisons are made with lattice results and numerical tables are provided to support our findings | [['a', 'simple', 'variational', 'argument', 'based', 'on', 'the', 'gaussian', 'effective', 'potential', 'gep', 'is', 'put', 'forward', 'to', 'give', 'evidence', 'for', 'mass', 'generation', 'and', 'deconfinement', 'in', 'pure', 'yangmills', 'sun', 'theory', 'the', 'gep', 'analysis', 'shows', 'that', 'the', 'massless', 'gaussian', 'vacuum', 'of', 'yangmills', 'theory', 'is', 'perturbatively', 'unstable', 'towards', 'a', 'massive', 'gaussian', 'vacuum', 'indicating', 'that', 'a', 'massive', 'expansion', 'is', 'the', 'natural', 'choice', 'for', 'computations', 'in', 'ymt', 'at', 'finite', 'temperature', 'the', 'gep', 'provides', 'an', 'optimal', 'temperaturedependent', 'mass', 'parameter', 'for', 'the', 'expansion', 'and', 'signals', 'the', 'occurrence', 'of', 'a', 'weakly', 'firstorder', 'phase', 'transition', 'at', 't_capprox', '255', 'mev', 'for', 'n3', 'the', 'equation', 'of', 'state', 'is', 'found', 'to', 'be', 'in', 'good', 'agreement', 'with', 'the', 'lattice', 'data', 'this', 'work', 'is', 'complemented', 'with', 'review', 'material', 'on', 'the', 'standard', 'and', 'massive', 'expansions', 'of', 'yangmills', 'theory', 'and', 'on', 'the', 'formalism', 'of', 'quantum', 'field', 'theory', 'at', 'finite', 'temperature', 'comparisons', 'are', 'made', 'with', 'lattice', 'results', 'and', 'numerical', 'tables', 'are', 'provided', 'to', 'support', 'our', 'findings']] | [-0.09129807896503847, 0.1809984663612415, -0.11349581381952317, 0.05177392137287925, -0.05199120495702006, -0.12507731429211896, 0.06870302747718174, 0.3503369972467014, -0.15895992300269027, -0.25739023914841347, 0.09023708716586666, -0.30208080596201226, -0.11520889071326652, 0.16915518971644852, 0.03245513545622487, 0.051564112085568374, 0.04723852792474097, 0.07190846168270258, -0.09696832205940753, -0.22806023391065736, 0.3028554698031345, 0.06937679975877248, 0.2911769183071917, 0.08698696284459215, 0.0683244861868108, -0.005249009139146911, 0.0017057752606701362, -0.006899783604663529, -0.1375321670382942, 0.08830472901431614, 0.2426939822018963, 0.035395630946293576, 0.22412654933557935, -0.39753399734474615, -0.23909258266132682, 0.02014772538956867, 0.12291965639690729, 0.14985026249483432, -0.07009842978213908, -0.25884127420411535, 0.09341023477712927, -0.14301826184845134, -0.18063297908281117, -0.10335277761723399, -0.010861873662191737, -0.06387294501932146, -0.32445187947859555, 0.10759909859159164, -0.005047791591233077, 0.05559062237344197, -0.06591478755940007, -0.13676274113663256, -0.019685928782365247, 0.033422009719612254, 0.03976301740441744, 0.08735538065777965, 0.10417011386215726, -0.12781097497695368, -0.08939212961887864, 0.37626054724168084, -0.08976922478935082, -0.16069887820886422, 0.17028687909813214, -0.13401133580490537, -0.140331367011603, 0.14044855946281443, 0.11401452290927609, 0.1087299656276017, -0.12082143825772282, 0.11982410856042607, -0.020381729114937838, 0.16286797298769123, 0.04206169051539204, 0.017318273447515773, 0.23513846264590751, 0.16496245511360977, 0.015268962667642594, 0.11338508414975304, -0.02052829786656705, -0.1743282910519318, -0.3392480622083172, -0.1326565301978543, -0.17494717512713515, 0.043622906871175086, -0.14325450125024, -0.18827907804540064, 0.3173323743051709, 0.13770563245355472, 0.1556911186812675, 0.060416192388838184, 0.25304653739543914, 0.16691677707123048, 0.019512029211610965, 0.07031072376691418, 0.2502428306879042, 0.21756387711821557, 0.10180807423344111, -0.2320780175505206, -0.04648950792313235, 0.09021845992259069] |
1,803.02336 | A symmetric $\beta$-model | We prove that there exists a countable $\beta$-model in which, for all reals
$X$ and $Y$, $X$ is definable from $Y$ if and only $X$ is hyperarithmetical in
$Y$. We also obtain some related results and pose some related questions.
| math.LO | we prove that there exists a countable betamodel in which for all reals x and y x is definable from y if and only x is hyperarithmetical in y we also obtain some related results and pose some related questions | [['we', 'prove', 'that', 'there', 'exists', 'a', 'countable', 'betamodel', 'in', 'which', 'for', 'all', 'reals', 'x', 'and', 'y', 'x', 'is', 'definable', 'from', 'y', 'if', 'and', 'only', 'x', 'is', 'hyperarithmetical', 'in', 'y', 'we', 'also', 'obtain', 'some', 'related', 'results', 'and', 'pose', 'some', 'related', 'questions']] | [-0.12984013818204404, 0.10601532348664477, -0.06433207909576595, 0.11454846542910672, -0.04154313438339159, -0.21372919803252444, 0.09176468658261001, 0.4410293924738653, -0.34450525902211665, -0.1586449606344104, 0.08371304384781979, -0.3400445479899645, -0.11010099304839968, 0.21580799342045792, -0.16691124392673373, -0.020456101186573504, 0.03349070521071553, 0.11974455337040127, -0.11066516657592729, -0.3248933610972017, 0.338303894829005, -0.20923503055237233, 0.13940533050335943, 0.07884940028889105, 0.193110269960016, -0.016935334040317683, -0.006995038641616702, 0.08434311179444194, -0.202822570043827, 0.0710552797303535, 0.3474258400616236, 0.1950150718621444, 0.2459797953721136, -0.30861140727065506, -0.1806571847992018, 0.1888309535337612, 0.06728246422717347, -0.06356930736510549, -0.06881372167845257, -0.22649937863461672, 0.16550717493519188, -0.08805405579041689, -0.0791973602725193, -0.11181469821603969, 0.13333152546547353, 0.06442812455352395, -0.28103321059606967, 0.021404805027850672, 0.18075847397558392, 0.02425051631871611, -0.022310761525295673, -0.13992370262276382, -0.09544679594691843, 0.07109762249747291, 0.06019842146197334, 0.18724724343046545, 0.016656545724254103, -0.0480299810791621, -0.05590751261916012, 0.3705518517643213, -0.07279505908954889, -0.2404128322377801, 0.1305255420971662, -0.22666209782473742, -0.24758740913821384, 0.09636624443810433, 0.038204937567934395, 0.14779214593581855, -0.04802666187752038, 0.24657558826293097, -0.19740306749008596, 0.2024387859273702, 0.10864658560603857, 0.02301449967781082, 0.13040207580197602, 0.06720952759496868, 0.10482660877460148, 0.08195766534772701, -0.00508089562645182, 0.05251638543559238, -0.3740802140906453, -0.1348097724840045, -0.10014698716404383, 0.14691034969873726, -0.079103580023002, -0.15504823299124837, 0.2651284832973033, 0.17638564741355367, 0.2376352165825665, 0.049391465124790555, 0.14925463121326174, 0.031060400954447686, -0.0806645849486813, 0.1258732944726944, 0.06383003395312699, 0.17866431851871312, -0.02684505460783839, -0.03930490196798928, 0.09248368192929775, 0.09742926266044379] |
1,803.02337 | Cyber-Physical Testbed for Power System Wide-Area Measurement-Based
Control Using Open-Source Software | The electric power system is a cyber-physical system with power flow in the
physical system and information flow in the cyber. Simulation is crucial to
understanding the dynamics and control of electric power systems yet the
underlying communication system has historically been ignored in these studies.
This paper aims at meeting the increasing needs to simulate the operations of a
real power system including the physical system, the energy management system,
the communication system, and the emerging wide-area measurement-based
controls. This paper proposes a cyber-physical testbed design and
implementation for verifying and demonstrating wide-area control methods based
on streaming telemetry and phasor measurement unit data. The proposed decoupled
architecture is composed of a differential algebraic equation based physical
system simulator, a software-defined network, a scripting language environment
for prototyping an EMS system and a control system, all of which are integrated
over industry-standard communication protocols. The proposed testbed is
implemented using open-source software packages managed by a Python dispatcher.
Finally, demonstrations are presented to show two wide-area measurement-based
controls - system separation control and hierarchical voltage control, in the
implemented testbed.
| cs.SY cs.SE | the electric power system is a cyberphysical system with power flow in the physical system and information flow in the cyber simulation is crucial to understanding the dynamics and control of electric power systems yet the underlying communication system has historically been ignored in these studies this paper aims at meeting the increasing needs to simulate the operations of a real power system including the physical system the energy management system the communication system and the emerging widearea measurementbased controls this paper proposes a cyberphysical testbed design and implementation for verifying and demonstrating widearea control methods based on streaming telemetry and phasor measurement unit data the proposed decoupled architecture is composed of a differential algebraic equation based physical system simulator a softwaredefined network a scripting language environment for prototyping an ems system and a control system all of which are integrated over industrystandard communication protocols the proposed testbed is implemented using opensource software packages managed by a python dispatcher finally demonstrations are presented to show two widearea measurementbased controls system separation control and hierarchical voltage control in the implemented testbed | [['the', 'electric', 'power', 'system', 'is', 'a', 'cyberphysical', 'system', 'with', 'power', 'flow', 'in', 'the', 'physical', 'system', 'and', 'information', 'flow', 'in', 'the', 'cyber', 'simulation', 'is', 'crucial', 'to', 'understanding', 'the', 'dynamics', 'and', 'control', 'of', 'electric', 'power', 'systems', 'yet', 'the', 'underlying', 'communication', 'system', 'has', 'historically', 'been', 'ignored', 'in', 'these', 'studies', 'this', 'paper', 'aims', 'at', 'meeting', 'the', 'increasing', 'needs', 'to', 'simulate', 'the', 'operations', 'of', 'a', 'real', 'power', 'system', 'including', 'the', 'physical', 'system', 'the', 'energy', 'management', 'system', 'the', 'communication', 'system', 'and', 'the', 'emerging', 'widearea', 'measurementbased', 'controls', 'this', 'paper', 'proposes', 'a', 'cyberphysical', 'testbed', 'design', 'and', 'implementation', 'for', 'verifying', 'and', 'demonstrating', 'widearea', 'control', 'methods', 'based', 'on', 'streaming', 'telemetry', 'and', 'phasor', 'measurement', 'unit', 'data', 'the', 'proposed', 'decoupled', 'architecture', 'is', 'composed', 'of', 'a', 'differential', 'algebraic', 'equation', 'based', 'physical', 'system', 'simulator', 'a', 'softwaredefined', 'network', 'a', 'scripting', 'language', 'environment', 'for', 'prototyping', 'an', 'ems', 'system', 'and', 'a', 'control', 'system', 'all', 'of', 'which', 'are', 'integrated', 'over', 'industrystandard', 'communication', 'protocols', 'the', 'proposed', 'testbed', 'is', 'implemented', 'using', 'opensource', 'software', 'packages', 'managed', 'by', 'a', 'python', 'dispatcher', 'finally', 'demonstrations', 'are', 'presented', 'to', 'show', 'two', 'widearea', 'measurementbased', 'controls', 'system', 'separation', 'control', 'and', 'hierarchical', 'voltage', 'control', 'in', 'the', 'implemented', 'testbed']] | [-0.2556097319944658, -0.011626602949157435, -0.056590947896863024, -0.032854851784779586, -0.04223392240754846, -0.20771834027643005, 0.009036338237476432, 0.35051120592074264, -0.283979318694522, -0.34245495012857846, 0.14279718191052476, -0.24427937326642374, -0.16682690126148778, 0.2738028699739112, -0.08085112334875803, 0.16129164763778034, 0.06413207038389777, -0.0311772716904266, 0.014788469807697564, -0.20014838767981727, 0.2797514145159059, 0.08355827508364908, 0.34423016792991096, 0.027202999415264155, 0.12614399466935236, -0.0017007225231888393, -0.02193035827949643, -0.01389201543513789, -0.04475443258415908, 0.11133278066667521, 0.29819899892512086, 0.20379348770948127, 0.31608266477576563, -0.44413532567107017, -0.21893050183749033, 0.036012683741541374, 0.15585662165087544, 0.0602061599758195, -0.05653118477008926, -0.30851172141394473, 0.07335963703420324, -0.26998315514582727, -0.0931558654565985, -0.0785903151276418, -0.009733679716009646, 0.03692206382725595, -0.27655639367456186, -0.05790456197897179, -0.00537392340031349, 0.1145733342661212, -0.07793140886739518, -0.01733478258894239, -0.009778699492259572, 0.1631143110857617, -0.10185610622478028, 0.011896601770745797, 0.220186229973721, -0.09881184162416806, -0.14353287963507075, 0.3848670860338542, 0.027345440201720014, -0.17876110328878794, 0.17786739632914153, -0.027763808547105227, -0.11901715252703676, 0.06258575449561855, 0.2848753582324005, 0.036428924919002584, -0.25845117984960475, 0.07064285170312765, 0.036355410278257394, 0.23096801473034753, -0.06316182051280823, 0.0435118231172156, 0.19243048838753668, 0.2778722504645379, 0.07176348641773479, 0.12280009746448034, -0.02624341537658539, -0.14128852831717167, -0.25691671501715774, -0.15775330963596287, -0.16093678201302988, 0.006864601730679472, -0.024510391756969816, -0.106154156211091, 0.39462670412225026, 0.19433671255052712, 0.05902543548986109, 0.04214501317991461, 0.45078434575763016, 0.09534620530385939, 0.09205210719568034, 0.14138356766844581, 0.18594911319928037, 0.05441887510500641, 0.2242650804931246, -0.22950518139017126, 0.06140943363489997, -0.017013285402208568] |
1,803.02338 | The CARMENES search for exoplanets around M dwarfs: Radial-velocity
variations of active stars in visual-channel spectra | Previous simulations predicted the activity-induced radial-velocity (RV)
variations of M dwarfs to range from $\sim1$ cm/s to $\sim1$ km/s, depending on
various stellar and activity parameters. We investigate the observed relations
between RVs, stellar activity, and stellar parameters of M dwarfs by analyzing
CARMENES high-resolution visual-channel spectra ($0.5$$-$$1$$\mu$m), which were
taken within the CARMENES RV planet survey during its first $20$ months of
operation. During this time, $287$ of the CARMENES-sample stars were observed
at least five times. From each spectrum we derived a relative RV and a measure
of chromospheric H$\alpha$ emission. In addition, we estimated the chromatic
index (CRX) of each spectrum, which is a measure of the RV wavelength
dependence. Despite having a median number of only $11$ measurements per star,
we show that the RV variations of the stars with RV scatter of $>10$ m/s and a
projected rotation velocity $v \sin{i}>2$ km/s are caused mainly by activity.
We name these stars `active RV-loud stars' and find their occurrence to
increase with spectral type: from $\sim3\%$ for early-type M dwarfs
(M$0.0$$-$$2.5$V) through $\sim30\%$ for mid-type M dwarfs (M$3.0$$-$$5.5$V) to
$>50\%$ for late-type M dwarfs (M$6.0$$-$$9.0$V). Their RV-scatter amplitude is
found to be correlated mainly with $v \sin{i}$. For about half of the stars, we
also find a linear RV$-$CRX anticorrelation, which indicates that their
activity-induced RV scatter is lower at longer wavelengths. For most of them we
can exclude a linear correlation between RV and H$\alpha$ emission. Our results
are in agreement with simulated activity-induced RV variations in M dwarfs. The
RV variations of most active RV-loud M dwarfs are likely to be caused by dark
spots on their surfaces, which move in and out of view as the stars rotate.
| astro-ph.SR astro-ph.EP | previous simulations predicted the activityinduced radialvelocity rv variations of m dwarfs to range from sim1 cms to sim1 kms depending on various stellar and activity parameters we investigate the observed relations between rvs stellar activity and stellar parameters of m dwarfs by analyzing carmenes highresolution visualchannel spectra 051mum which were taken within the carmenes rv planet survey during its first 20 months of operation during this time 287 of the carmenessample stars were observed at least five times from each spectrum we derived a relative rv and a measure of chromospheric halpha emission in addition we estimated the chromatic index crx of each spectrum which is a measure of the rv wavelength dependence despite having a median number of only 11 measurements per star we show that the rv variations of the stars with rv scatter of 10 ms and a projected rotation velocity v sini2 kms are caused mainly by activity we name these stars active rvloud stars and find their occurrence to increase with spectral type from sim3 for earlytype m dwarfs m0025v through sim30 for midtype m dwarfs m3055v to 50 for latetype m dwarfs m6090v their rvscatter amplitude is found to be correlated mainly with v sini for about half of the stars we also find a linear rvcrx anticorrelation which indicates that their activityinduced rv scatter is lower at longer wavelengths for most of them we can exclude a linear correlation between rv and halpha emission our results are in agreement with simulated activityinduced rv variations in m dwarfs the rv variations of most active rvloud m dwarfs are likely to be caused by dark spots on their surfaces which move in and out of view as the stars rotate | [['previous', 'simulations', 'predicted', 'the', 'activityinduced', 'radialvelocity', 'rv', 'variations', 'of', 'm', 'dwarfs', 'to', 'range', 'from', 'sim1', 'cms', 'to', 'sim1', 'kms', 'depending', 'on', 'various', 'stellar', 'and', 'activity', 'parameters', 'we', 'investigate', 'the', 'observed', 'relations', 'between', 'rvs', 'stellar', 'activity', 'and', 'stellar', 'parameters', 'of', 'm', 'dwarfs', 'by', 'analyzing', 'carmenes', 'highresolution', 'visualchannel', 'spectra', '051mum', 'which', 'were', 'taken', 'within', 'the', 'carmenes', 'rv', 'planet', 'survey', 'during', 'its', 'first', '20', 'months', 'of', 'operation', 'during', 'this', 'time', '287', 'of', 'the', 'carmenessample', 'stars', 'were', 'observed', 'at', 'least', 'five', 'times', 'from', 'each', 'spectrum', 'we', 'derived', 'a', 'relative', 'rv', 'and', 'a', 'measure', 'of', 'chromospheric', 'halpha', 'emission', 'in', 'addition', 'we', 'estimated', 'the', 'chromatic', 'index', 'crx', 'of', 'each', 'spectrum', 'which', 'is', 'a', 'measure', 'of', 'the', 'rv', 'wavelength', 'dependence', 'despite', 'having', 'a', 'median', 'number', 'of', 'only', '11', 'measurements', 'per', 'star', 'we', 'show', 'that', 'the', 'rv', 'variations', 'of', 'the', 'stars', 'with', 'rv', 'scatter', 'of', '10', 'ms', 'and', 'a', 'projected', 'rotation', 'velocity', 'v', 'sini2', 'kms', 'are', 'caused', 'mainly', 'by', 'activity', 'we', 'name', 'these', 'stars', 'active', 'rvloud', 'stars', 'and', 'find', 'their', 'occurrence', 'to', 'increase', 'with', 'spectral', 'type', 'from', 'sim3', 'for', 'earlytype', 'm', 'dwarfs', 'm0025v', 'through', 'sim30', 'for', 'midtype', 'm', 'dwarfs', 'm3055v', 'to', '50', 'for', 'latetype', 'm', 'dwarfs', 'm6090v', 'their', 'rvscatter', 'amplitude', 'is', 'found', 'to', 'be', 'correlated', 'mainly', 'with', 'v', 'sini', 'for', 'about', 'half', 'of', 'the', 'stars', 'we', 'also', 'find', 'a', 'linear', 'rvcrx', 'anticorrelation', 'which', 'indicates', 'that', 'their', 'activityinduced', 'rv', 'scatter', 'is', 'lower', 'at', 'longer', 'wavelengths', 'for', 'most', 'of', 'them', 'we', 'can', 'exclude', 'a', 'linear', 'correlation', 'between', 'rv', 'and', 'halpha', 'emission', 'our', 'results', 'are', 'in', 'agreement', 'with', 'simulated', 'activityinduced', 'rv', 'variations', 'in', 'm', 'dwarfs', 'the', 'rv', 'variations', 'of', 'most', 'active', 'rvloud', 'm', 'dwarfs', 'are', 'likely', 'to', 'be', 'caused', 'by', 'dark', 'spots', 'on', 'their', 'surfaces', 'which', 'move', 'in', 'and', 'out', 'of', 'view', 'as', 'the', 'stars', 'rotate']] | [-0.084965543801485, 0.18297133677346755, -0.05865123189550682, 0.07324023925220037, -0.10363527610269205, -0.06794715409819717, 0.08973998699615961, 0.42974013501411157, -0.16471171623051684, -0.4053756654072199, 0.05692978098607846, -0.31937191393022446, -0.048623043749766955, 0.2177521611273248, -0.09881184332796719, -0.009562088624637125, 0.11728183269232212, -0.03142665026549685, -0.057496263060963504, -0.285513742568556, 0.26982471247774675, 0.005504303897329926, 0.08765068718310391, -0.07441320810059127, 0.04509369844343874, -0.10019843765499621, -0.12496568033230375, 0.004907739861956696, -0.1434544822285364, 0.0335264906761352, 0.22530901987431912, 0.10568709541910946, 0.20804098441969113, -0.2846329768704944, -0.20194273705451485, 0.07080314544337142, 0.15440650491373628, -0.014029309263599044, -0.02343604064259311, -0.2743401752213818, 0.12948244232871317, -0.14434363939935327, -0.13784161254119495, 0.06010790455688716, 0.13032794767739184, 0.049008093702966514, -0.24750928739493672, 0.1231086693582402, 0.031151226087925612, 0.20250224225719315, -0.1268464606879857, -0.13728350849930931, -0.08113967162942731, 0.07318992107294255, 0.034526151869221706, 0.055486205525961396, 0.13958492028581346, -0.0741158420768954, -0.010335095740224228, 0.3919156965983175, -0.1663929907890567, -0.015750555335170162, 0.20478445493079123, -0.25002438499784285, -0.1286979427792295, 0.13478390684302038, 0.16441602086441007, 0.12428336854799767, -0.15682945087429706, -0.046201057944329535, 0.0001782703512504588, 0.24062898136542799, 0.09168557189557919, 0.06718466554686701, 0.3208055889708106, 0.08132309452409646, 0.05200362529768778, 0.01424802040526589, -0.30450918942608746, -0.009348273802426284, -0.2192349403647937, -0.09257843592828717, -0.10868174509471622, 0.057145672567769965, -0.12370292217277176, -0.09110846675347782, 0.3655368266491233, 0.1223348358579755, 0.24284809293058857, 0.07640970367122524, 0.2782075348170814, 0.12166019476249977, 0.12122447217600488, 0.12782225665299862, 0.30343432152766164, 0.21531114619255853, 0.10566676420798647, -0.2617956913343162, 0.07143627484218577, -0.020979836712299037] |
1,803.02339 | Weakly trapped surfaces in asymptotically de Sitter spacetimes | It is a standard fact that trapped or marginally trapped surfaces are not
visible from conformal infinity, under the usual set of conditions on matter
fields and the conformal completion, provided that the cosmological constant is
non-positive. In this note we show that the situation is more delicate in the
presence of a positive cosmological constant: we present examples of visible
marginally trapped surfaces, and we provide a set of natural conditions which
guarantee non-visibility.
| gr-qc | it is a standard fact that trapped or marginally trapped surfaces are not visible from conformal infinity under the usual set of conditions on matter fields and the conformal completion provided that the cosmological constant is nonpositive in this note we show that the situation is more delicate in the presence of a positive cosmological constant we present examples of visible marginally trapped surfaces and we provide a set of natural conditions which guarantee nonvisibility | [['it', 'is', 'a', 'standard', 'fact', 'that', 'trapped', 'or', 'marginally', 'trapped', 'surfaces', 'are', 'not', 'visible', 'from', 'conformal', 'infinity', 'under', 'the', 'usual', 'set', 'of', 'conditions', 'on', 'matter', 'fields', 'and', 'the', 'conformal', 'completion', 'provided', 'that', 'the', 'cosmological', 'constant', 'is', 'nonpositive', 'in', 'this', 'note', 'we', 'show', 'that', 'the', 'situation', 'is', 'more', 'delicate', 'in', 'the', 'presence', 'of', 'a', 'positive', 'cosmological', 'constant', 'we', 'present', 'examples', 'of', 'visible', 'marginally', 'trapped', 'surfaces', 'and', 'we', 'provide', 'a', 'set', 'of', 'natural', 'conditions', 'which', 'guarantee', 'nonvisibility']] | [-0.143361340505071, 0.15238875519484282, -0.06668146880964439, 0.058628617416446406, -0.06538028482968608, -0.16543166806921364, -0.013292025203506152, 0.3609164400647084, -0.21783791705965996, -0.23110807622472446, 0.11363169364941617, -0.25753972376386325, -0.14836528424484036, 0.19149137124108773, -0.08691856941053024, 0.009879846274852753, 0.0739000769952933, 0.07048774394866389, -0.0476781526611497, -0.3184939432144165, 0.3796980654199918, 0.03130705717951059, 0.21038913370420537, 0.08679271896913027, 0.08059166151176517, -0.06273896844436724, 0.022125039013723532, 0.05051220040535554, -0.1755106386898357, 0.09702723948595425, 0.1775620675335328, 0.10984869987393418, 0.23009758945554495, -0.4344964485615492, -0.2244000096867482, 0.17369498893618585, 0.10044574307122578, 0.12765719581550608, -0.09280500354807979, -0.263941264624397, 0.08288739384462436, -0.07062744642297426, -0.14663017347455023, -0.07127081568042437, -0.02820463196064035, -0.07168710512419542, -0.25685771321877837, 0.07986017598460118, 0.0877860993721212, 0.05828445135926207, -0.08262006945287188, -0.03605362965414922, -0.013181663788855076, 0.05442429034349819, 0.07728765197408696, 0.004273767041352888, 0.1309148195354889, -0.12274109306124349, -0.011565067258973917, 0.39310921913633745, -0.12239424169063567, -0.23802672614653905, 0.21690264534515638, -0.1866459087282419, -0.10733300268650055, 0.11529159198204676, 0.09040585409229, 0.16879331070929765, -0.11257043279707432, 0.16878601102003207, -0.09388713875164588, 0.15415752929945786, 0.11616022463267048, 0.024357456968476375, 0.2426298434038957, 0.08752068898330133, 0.13192255143076181, 0.11605709491297603, -0.03757763471143941, -0.06856744748229782, -0.4260415134827296, -0.15768618781740468, -0.17400262514750162, 0.07885900231718551, -0.08488621350338993, -0.19852114288757244, 0.34436231285333635, 0.11450889894544768, 0.20139026043315728, 0.0668237357850497, 0.2645550647377968, 0.06438004088005983, 0.04944290082280835, 0.09653605575983723, 0.27218733612447976, 0.07632551657035946, 0.056336642109478516, -0.16804094006928305, -0.01820155060539643, 0.026914683058857917] |
1,803.0234 | A Window On The Earliest Star Formation: Extreme Photoionization
Conditions of a High-Ionization, Low-Metallicity Lensed Galaxy at z~2 | We report new observations of SL2SJ021737-051329, a lens system consisting of
a bright arc at z=1.84435, magnified ~17x by a massive galaxy at z=0.65.
SL2SJ0217 is a low-mass (M <10^9 M*), low-metallicity (Z~1/20 Z*) galaxy, with
extreme star-forming conditions that produce strong nebular UV emission lines
in the absence of any apparent outflows. Here we present several notable
features from rest-frame UV Keck/LRIS spectroscopy: (1) Very strong narrow
emission lines are measured for CIV 1548,1550, HeII 1640, OIII] 1661,1666,
SiIII] 1883,1892, and CIII] 1907,1909. (2) Double-peaked LyA emission is
observed with a dominant blue peak and centered near the systemic velocity. (3)
The low- and high-ionization absorption features indicate very little or no
outflowing gas along the sightline to the lensed galaxy. The relative emission
line strengths can be reproduced with a very high-ionization, low-metallicity
starburst with binaries, with the exception of He \ii, which indicates an
additional ionization source is needed. We rule out large contributions from
AGN and shocks to the photoionization budget, suggesting that the emission
features requiring the hardest radiation field likely result from extreme
stellar populations that are beyond the capabilities of current models.
Therefore, SL2S0217 serves as a template for the extreme conditions that are
important for reionization and thought to be more common in the early Universe.
| astro-ph.GA | we report new observations of sl2sj021737051329 a lens system consisting of a bright arc at z184435 magnified 17x by a massive galaxy at z065 sl2sj0217 is a lowmass m 109 m lowmetallicity z120 z galaxy with extreme starforming conditions that produce strong nebular uv emission lines in the absence of any apparent outflows here we present several notable features from restframe uv kecklris spectroscopy 1 very strong narrow emission lines are measured for civ 15481550 heii 1640 oiii 16611666 siiii 18831892 and ciii 19071909 2 doublepeaked lya emission is observed with a dominant blue peak and centered near the systemic velocity 3 the low and highionization absorption features indicate very little or no outflowing gas along the sightline to the lensed galaxy the relative emission line strengths can be reproduced with a very highionization lowmetallicity starburst with binaries with the exception of he ii which indicates an additional ionization source is needed we rule out large contributions from agn and shocks to the photoionization budget suggesting that the emission features requiring the hardest radiation field likely result from extreme stellar populations that are beyond the capabilities of current models therefore sl2s0217 serves as a template for the extreme conditions that are important for reionization and thought to be more common in the early universe | [['we', 'report', 'new', 'observations', 'of', 'sl2sj021737051329', 'a', 'lens', 'system', 'consisting', 'of', 'a', 'bright', 'arc', 'at', 'z184435', 'magnified', '17x', 'by', 'a', 'massive', 'galaxy', 'at', 'z065', 'sl2sj0217', 'is', 'a', 'lowmass', 'm', '109', 'm', 'lowmetallicity', 'z120', 'z', 'galaxy', 'with', 'extreme', 'starforming', 'conditions', 'that', 'produce', 'strong', 'nebular', 'uv', 'emission', 'lines', 'in', 'the', 'absence', 'of', 'any', 'apparent', 'outflows', 'here', 'we', 'present', 'several', 'notable', 'features', 'from', 'restframe', 'uv', 'kecklris', 'spectroscopy', '1', 'very', 'strong', 'narrow', 'emission', 'lines', 'are', 'measured', 'for', 'civ', '15481550', 'heii', '1640', 'oiii', '16611666', 'siiii', '18831892', 'and', 'ciii', '19071909', '2', 'doublepeaked', 'lya', 'emission', 'is', 'observed', 'with', 'a', 'dominant', 'blue', 'peak', 'and', 'centered', 'near', 'the', 'systemic', 'velocity', '3', 'the', 'low', 'and', 'highionization', 'absorption', 'features', 'indicate', 'very', 'little', 'or', 'no', 'outflowing', 'gas', 'along', 'the', 'sightline', 'to', 'the', 'lensed', 'galaxy', 'the', 'relative', 'emission', 'line', 'strengths', 'can', 'be', 'reproduced', 'with', 'a', 'very', 'highionization', 'lowmetallicity', 'starburst', 'with', 'binaries', 'with', 'the', 'exception', 'of', 'he', 'ii', 'which', 'indicates', 'an', 'additional', 'ionization', 'source', 'is', 'needed', 'we', 'rule', 'out', 'large', 'contributions', 'from', 'agn', 'and', 'shocks', 'to', 'the', 'photoionization', 'budget', 'suggesting', 'that', 'the', 'emission', 'features', 'requiring', 'the', 'hardest', 'radiation', 'field', 'likely', 'result', 'from', 'extreme', 'stellar', 'populations', 'that', 'are', 'beyond', 'the', 'capabilities', 'of', 'current', 'models', 'therefore', 'sl2s0217', 'serves', 'as', 'a', 'template', 'for', 'the', 'extreme', 'conditions', 'that', 'are', 'important', 'for', 'reionization', 'and', 'thought', 'to', 'be', 'more', 'common', 'in', 'the', 'early', 'universe']] | [-0.035973677083417824, 0.06369820356548399, -0.0036578524920444647, 0.11950791505100475, -0.09064225959809846, -0.16531632789142, 0.023579309439530613, 0.5144798955163703, -0.09358683269685851, -0.3124208084773272, 0.008555793773176936, -0.3161676205121554, 0.009334522101338595, 0.17556317423609122, -0.0013401537636617343, -0.07994585481411867, 0.05011473768704141, -0.14382149995519564, 0.009882111554571357, -0.2273310565103132, 0.3184308976879737, 0.09065385766734835, 0.131058715666698, 0.01627912876742462, 0.0614982968842154, -0.1432005894793502, -0.06273570000820865, -0.012645679885911075, -0.08942579442051422, 0.03334622044349089, 0.2603544313020708, 0.15271016414156363, 0.2585511348196843, -0.29156087689065874, -0.2066075326853864, 0.06932840565815031, 0.2163555236251201, 0.05987537813836333, -0.07123880631486547, -0.28035140723099733, 0.02262377054340994, -0.13689001733683442, -0.17560620604378457, 0.11141224176837848, 0.03314519537413547, 0.04118369336132533, -0.2429423310212979, 0.1206708457097053, 0.015084369772046977, 0.12206097193232451, -0.05838555562625585, -0.06104148271361527, -0.0970246973581827, 0.01321972645214723, 0.004521588959155802, 0.06173248776870493, 0.22046425935024253, -0.18312130870924648, -0.021042926172133145, 0.43479789917966205, -0.12506107174088427, 0.0856488331203134, 0.2631697145015306, -0.22172203047151784, -0.21347570176854228, 0.2685466835582002, 0.09562862193202958, 0.11114664055989684, -0.11409883136702074, -0.027840691235933964, -0.028308549656335693, 0.23767815789548108, 0.019321724703051865, 0.10898626855060474, 0.3438448336315699, 0.032381486882513855, 0.013400786718893169, 0.0798373133808267, -0.24757372659559435, 0.026084913311373945, -0.28204113418290105, -0.08755129859155904, -0.09295960303195618, 0.1335529829823197, -0.13491467359248277, -0.14411422255887793, 0.308373462941605, 0.1109595495737057, 0.25244229605036356, 0.01654088781651808, 0.3137050209960972, 0.10852263419432208, 0.10218276439207749, 0.12269649734886255, 0.3275599846383557, 0.1671124943464887, 0.08595109185150179, -0.2309123728020775, 0.08796889900874633, -0.031609499283009566] |
1,803.02341 | Applications of Graded Methods to Cluster Variables in Arbitrary Types | This thesis is concerned with studying the properties of gradings on several
examples of cluster algebras, primarily of infinite type.
We first consider two finite type cases: $B_n$ and $C_n$, completing a
classification by Grabowski for coefficient-free finite type cluster algebras.
We then consider gradings arising from $3 \times 3$ skew-symmetric matrices.
We show that the mutation-cyclic matrices give rise to gradings in which all
degrees are positive and have only finitely many associated cluster variables
(excepting one particular case). For the mutation-acyclic matrices, we prove
that all occurring degrees have infinitely many variables.
We provide a sufficient condition for a graded cluster algebra generated by a
quiver to have infinitely many degrees, based on the presence of a subquiver in
its mutation class. We use this to show that the cluster algebras for (quantum)
coordinate rings of matrices and Grassmannians contain cluster variables of all
degrees in $\mathbb{N}$.
Next we consider the list (given by Felikson, Shapiro & Tumarkin) of
mutation-finite quivers that do not correspond to triangulations of marked
surfaces. We show that $X_7$ gives rise to only two degrees, both with
infinitely many variables, and that $\widetilde{E}_6$, $\widetilde{E}_7$ and
$\widetilde{E}_8$ give rise to infinitely many variables in some degrees.
Finally, we study gradings arising from marked surfaces (see Fomin, Shapiro &
Thurston). We adapt a definition by Muller to define the space of valuation
functions on such a surface and prove combinatorially that it is isomorphic to
the space of gradings on the associated cluster algebra. We illustrate this
theory by applying it to the annulus with $n+m$ marked points. We show that the
standard grading is of mixed type. We also give an alternative grading in which
all degrees have infinitely many cluster variables.
| math.RT math.AC math.CO | this thesis is concerned with studying the properties of gradings on several examples of cluster algebras primarily of infinite type we first consider two finite type cases b_n and c_n completing a classification by grabowski for coefficientfree finite type cluster algebras we then consider gradings arising from 3 times 3 skewsymmetric matrices we show that the mutationcyclic matrices give rise to gradings in which all degrees are positive and have only finitely many associated cluster variables excepting one particular case for the mutationacyclic matrices we prove that all occurring degrees have infinitely many variables we provide a sufficient condition for a graded cluster algebra generated by a quiver to have infinitely many degrees based on the presence of a subquiver in its mutation class we use this to show that the cluster algebras for quantum coordinate rings of matrices and grassmannians contain cluster variables of all degrees in mathbbn next we consider the list given by felikson shapiro tumarkin of mutationfinite quivers that do not correspond to triangulations of marked surfaces we show that x_7 gives rise to only two degrees both with infinitely many variables and that widetildee_6 widetildee_7 and widetildee_8 give rise to infinitely many variables in some degrees finally we study gradings arising from marked surfaces see fomin shapiro thurston we adapt a definition by muller to define the space of valuation functions on such a surface and prove combinatorially that it is isomorphic to the space of gradings on the associated cluster algebra we illustrate this theory by applying it to the annulus with nm marked points we show that the standard grading is of mixed type we also give an alternative grading in which all degrees have infinitely many cluster variables | [['this', 'thesis', 'is', 'concerned', 'with', 'studying', 'the', 'properties', 'of', 'gradings', 'on', 'several', 'examples', 'of', 'cluster', 'algebras', 'primarily', 'of', 'infinite', 'type', 'we', 'first', 'consider', 'two', 'finite', 'type', 'cases', 'b_n', 'and', 'c_n', 'completing', 'a', 'classification', 'by', 'grabowski', 'for', 'coefficientfree', 'finite', 'type', 'cluster', 'algebras', 'we', 'then', 'consider', 'gradings', 'arising', 'from', '3', 'times', '3', 'skewsymmetric', 'matrices', 'we', 'show', 'that', 'the', 'mutationcyclic', 'matrices', 'give', 'rise', 'to', 'gradings', 'in', 'which', 'all', 'degrees', 'are', 'positive', 'and', 'have', 'only', 'finitely', 'many', 'associated', 'cluster', 'variables', 'excepting', 'one', 'particular', 'case', 'for', 'the', 'mutationacyclic', 'matrices', 'we', 'prove', 'that', 'all', 'occurring', 'degrees', 'have', 'infinitely', 'many', 'variables', 'we', 'provide', 'a', 'sufficient', 'condition', 'for', 'a', 'graded', 'cluster', 'algebra', 'generated', 'by', 'a', 'quiver', 'to', 'have', 'infinitely', 'many', 'degrees', 'based', 'on', 'the', 'presence', 'of', 'a', 'subquiver', 'in', 'its', 'mutation', 'class', 'we', 'use', 'this', 'to', 'show', 'that', 'the', 'cluster', 'algebras', 'for', 'quantum', 'coordinate', 'rings', 'of', 'matrices', 'and', 'grassmannians', 'contain', 'cluster', 'variables', 'of', 'all', 'degrees', 'in', 'mathbbn', 'next', 'we', 'consider', 'the', 'list', 'given', 'by', 'felikson', 'shapiro', 'tumarkin', 'of', 'mutationfinite', 'quivers', 'that', 'do', 'not', 'correspond', 'to', 'triangulations', 'of', 'marked', 'surfaces', 'we', 'show', 'that', 'x_7', 'gives', 'rise', 'to', 'only', 'two', 'degrees', 'both', 'with', 'infinitely', 'many', 'variables', 'and', 'that', 'widetildee_6', 'widetildee_7', 'and', 'widetildee_8', 'give', 'rise', 'to', 'infinitely', 'many', 'variables', 'in', 'some', 'degrees', 'finally', 'we', 'study', 'gradings', 'arising', 'from', 'marked', 'surfaces', 'see', 'fomin', 'shapiro', 'thurston', 'we', 'adapt', 'a', 'definition', 'by', 'muller', 'to', 'define', 'the', 'space', 'of', 'valuation', 'functions', 'on', 'such', 'a', 'surface', 'and', 'prove', 'combinatorially', 'that', 'it', 'is', 'isomorphic', 'to', 'the', 'space', 'of', 'gradings', 'on', 'the', 'associated', 'cluster', 'algebra', 'we', 'illustrate', 'this', 'theory', 'by', 'applying', 'it', 'to', 'the', 'annulus', 'with', 'nm', 'marked', 'points', 'we', 'show', 'that', 'the', 'standard', 'grading', 'is', 'of', 'mixed', 'type', 'we', 'also', 'give', 'an', 'alternative', 'grading', 'in', 'which', 'all', 'degrees', 'have', 'infinitely', 'many', 'cluster', 'variables']] | [-0.16706546023161264, 0.1184765083670898, -0.0583856174542585, 0.04257080645418906, -0.07448109887997832, -0.14868036579798188, 0.0003102268511020954, 0.3753497580621849, -0.29958926877006886, -0.2435781820595526, 0.11535544636487764, -0.2427827760381134, -0.1881191707657356, 0.19201223056216055, -0.13269034805380853, -0.07372810250299312, 0.08146887288118403, 0.07122288316318749, -0.07492563890031817, -0.3392868624142322, 0.3841799752647874, -0.06588748178910464, 0.16401632576772388, 0.008071217716981967, 0.1288177659747338, 0.026573903363590178, -0.03682897621684038, 0.028296953145042623, -0.15530376844863783, 0.096654301803363, 0.27410355741158127, 0.08516222880499666, 0.2181535948630067, -0.3835023347321048, -0.1327310201991758, 0.19301957727589628, 0.151447022969328, 0.08382594463121341, -0.028323720111266562, -0.2269625645514839, 0.09230669539078679, -0.19218348822670808, -0.15872225457018144, -0.06801411361645973, 0.0646181031898187, 0.04130383327382764, -0.22116387226586148, 0.027258183842161342, 0.0946051433547645, 0.11386842956407028, -0.05171966770839501, -0.13930692176922763, -0.026923511294942155, 0.09499690641502016, -0.009876585969489003, -0.017286159352628155, 0.06664891780901439, -0.08632963186603758, -0.16933908134600834, 0.32663723234610076, 0.016751507249443277, -0.2189900794499472, 0.19900497965792424, -0.16292843103833626, -0.2079221463255715, 0.10717087047125556, 0.09318338996616372, 0.12150305747299601, -0.09238373413518594, 0.15970077133827368, -0.10824662489457089, 0.09473826524131654, 0.11892430255385605, 0.01870181013731972, 0.14734394822122626, 0.03941509760671148, 0.08312096508595634, 0.14611235697214542, -0.0015659972179779098, -0.06724469959572481, -0.3359249492486318, -0.16320155369232228, -0.10786835237716635, 0.11232033494881379, -0.10450231596600804, -0.20098842529400268, 0.38257663151608745, 0.1255293711799344, 0.22111878185778072, 0.10187296064554208, 0.1451671379463126, 0.05867746247513743, 0.09565815236827914, 0.060928533654333206, 0.11821630910874278, 0.21677198736242165, -0.005366570899557126, -0.1455008144327031, -0.019631283691054897, 0.15734633516699992] |
1,803.02342 | Magic-angle graphene superlattices: a new platform for unconventional
superconductivity | The understanding of strongly-correlated materials, and in particular
unconventional superconductors, has puzzled physicists for decades. Such
difficulties have stimulated new research paradigms, such as ultra-cold atom
lattices for simulating quantum materials. Here we report on the realization of
intrinsic unconventional superconductivity in a 2D superlattice created by
stacking two graphene sheets with a small twist angle. For angles near
$1.1^\circ$, the first `magic' angle, twisted bilayer graphene (TBG) exhibits
ultra-flat bands near charge neutrality, which lead to correlated insulating
states at half-filling. Upon electrostatic doping away from these correlated
insulating states, we observe tunable zero-resistance states with a critical
temperature $T_c$ up to 1.7 K. The temperature-density phase diagram shows
similarities with that of the cuprates, including superconducting domes.
Moreover, quantum oscillations indicate small Fermi surfaces near the
correlated insulating phase, in analogy with under-doped cuprates. The relative
high $T_c$, given such small Fermi surface (corresponding to a record-low 2D
carrier density of $10^{11} \textrm{cm}^{-2}$ , renders TBG among the strongest
coupling superconductors, in a regime close to the BCS-BEC crossover. These
novel results establish TBG as the first purely carbon-based 2D superconductor
and as a highly tunable platform to investigate strongly-correlated phenomena,
which could lead to insights into the physics of high-$T_c$ superconductors and
quantum spin liquids.
| cond-mat.mes-hall cond-mat.str-el cond-mat.supr-con | the understanding of stronglycorrelated materials and in particular unconventional superconductors has puzzled physicists for decades such difficulties have stimulated new research paradigms such as ultracold atom lattices for simulating quantum materials here we report on the realization of intrinsic unconventional superconductivity in a 2d superlattice created by stacking two graphene sheets with a small twist angle for angles near 11circ the first magic angle twisted bilayer graphene tbg exhibits ultraflat bands near charge neutrality which lead to correlated insulating states at halffilling upon electrostatic doping away from these correlated insulating states we observe tunable zeroresistance states with a critical temperature t_c up to 17 k the temperaturedensity phase diagram shows similarities with that of the cuprates including superconducting domes moreover quantum oscillations indicate small fermi surfaces near the correlated insulating phase in analogy with underdoped cuprates the relative high t_c given such small fermi surface corresponding to a recordlow 2d carrier density of 1011 textrmcm2 renders tbg among the strongest coupling superconductors in a regime close to the bcsbec crossover these novel results establish tbg as the first purely carbonbased 2d superconductor and as a highly tunable platform to investigate stronglycorrelated phenomena which could lead to insights into the physics of hight_c superconductors and quantum spin liquids | [['the', 'understanding', 'of', 'stronglycorrelated', 'materials', 'and', 'in', 'particular', 'unconventional', 'superconductors', 'has', 'puzzled', 'physicists', 'for', 'decades', 'such', 'difficulties', 'have', 'stimulated', 'new', 'research', 'paradigms', 'such', 'as', 'ultracold', 'atom', 'lattices', 'for', 'simulating', 'quantum', 'materials', 'here', 'we', 'report', 'on', 'the', 'realization', 'of', 'intrinsic', 'unconventional', 'superconductivity', 'in', 'a', '2d', 'superlattice', 'created', 'by', 'stacking', 'two', 'graphene', 'sheets', 'with', 'a', 'small', 'twist', 'angle', 'for', 'angles', 'near', '11circ', 'the', 'first', 'magic', 'angle', 'twisted', 'bilayer', 'graphene', 'tbg', 'exhibits', 'ultraflat', 'bands', 'near', 'charge', 'neutrality', 'which', 'lead', 'to', 'correlated', 'insulating', 'states', 'at', 'halffilling', 'upon', 'electrostatic', 'doping', 'away', 'from', 'these', 'correlated', 'insulating', 'states', 'we', 'observe', 'tunable', 'zeroresistance', 'states', 'with', 'a', 'critical', 'temperature', 't_c', 'up', 'to', '17', 'k', 'the', 'temperaturedensity', 'phase', 'diagram', 'shows', 'similarities', 'with', 'that', 'of', 'the', 'cuprates', 'including', 'superconducting', 'domes', 'moreover', 'quantum', 'oscillations', 'indicate', 'small', 'fermi', 'surfaces', 'near', 'the', 'correlated', 'insulating', 'phase', 'in', 'analogy', 'with', 'underdoped', 'cuprates', 'the', 'relative', 'high', 't_c', 'given', 'such', 'small', 'fermi', 'surface', 'corresponding', 'to', 'a', 'recordlow', '2d', 'carrier', 'density', 'of', '1011', 'textrmcm2', 'renders', 'tbg', 'among', 'the', 'strongest', 'coupling', 'superconductors', 'in', 'a', 'regime', 'close', 'to', 'the', 'bcsbec', 'crossover', 'these', 'novel', 'results', 'establish', 'tbg', 'as', 'the', 'first', 'purely', 'carbonbased', '2d', 'superconductor', 'and', 'as', 'a', 'highly', 'tunable', 'platform', 'to', 'investigate', 'stronglycorrelated', 'phenomena', 'which', 'could', 'lead', 'to', 'insights', 'into', 'the', 'physics', 'of', 'hight_c', 'superconductors', 'and', 'quantum', 'spin', 'liquids']] | [-0.18522505966973477, 0.2716948423008232, -0.026965538530210078, 0.03932907395987155, -0.027260126339064703, -0.2375431032941321, 0.13852780546367635, 0.3703834238385665, -0.23429697442907785, -0.2831671531330445, -0.05408325430752647, -0.35684342529165786, -0.15230259337464735, 0.203442573191931, 0.028779843016001755, 0.05249534813059575, -0.0611412600858209, -0.11648321601647686, -0.17327814004473965, -0.18329614420828594, 0.2920865167274279, -0.004422800813954558, 0.36376178504197276, 0.11679169730224831, 0.01745858571631609, -0.04771635244074075, 0.17706197881306282, 0.005085192814217386, -0.18323398551845035, 0.03605243076985378, 0.3367411649835426, -0.18266569914584216, 0.17873441444072705, -0.4408307201791429, -0.23589020333329333, -0.02359900282524922, 0.1424769620143399, 0.15102466886327715, -0.09100986890335104, -0.32292808448346916, -0.010848290695255433, -0.13981004955768944, -0.15961281115027226, -0.10881900864570056, -0.01068907982899227, -0.04191784429980289, -0.17259935505805168, 0.08825798089400042, 0.016242740303678675, 0.09865368326455534, -0.07772241010114658, -0.15253378644783572, -0.03586390967017426, 0.031754792250629854, 0.039812576207939696, 0.06485267705621495, 0.15014058611567183, -0.16878120065385538, -0.10419384446579981, 0.36276477576201954, -0.00762297576158375, -0.016725820133795484, 0.20487132750492057, -0.18816127891962728, -0.08368179260793587, 0.1717004282332525, 0.1123738024217315, 0.025231239500631025, -0.08698501779387395, 0.06706085721180428, -0.06057091399966537, 0.1619626857218859, 0.048939403915858784, 0.141389152770727, 0.35314946063762703, 0.22038925967656148, 0.05726653604952681, 0.12979342603205662, -0.13419358982736707, -0.054439915348618216, -0.2060322917430945, -0.18230938878369288, -0.22054039499135283, 0.08165717213009686, -0.04226014539038432, -0.2387682524652646, 0.40018477595910645, 0.16228127276304444, 0.20261041796653742, -0.11668574017616538, 0.17910883821331072, 0.07653580476998932, 0.06754670522720126, 0.023880344926906022, 0.2562942947609719, 0.15090165361717056, 0.11103243655907576, -0.2649878548235511, 0.037834569128794855, 0.01917288074683812] |
1,803.02343 | Infinitely Many M2-instanton Corrections to M-theory on $G_2$-manifolds | We consider the non-perturbative superpotential for a class of
four-dimensional $\mathcal N=1$ vacua obtained from M-theory on seven-manifolds
with holonomy $G_2$. The class of $G_2$-holonomy manifolds we consider are
so-called twisted connected sum (TCS) constructions, which have the topology of
a K3-fibration over $S^3$. We show that the non-perturbative superpotential of
M-theory on a class of TCS geometries receives infinitely many inequivalent
M2-instanton contributions from infinitely many three-spheres, which we
conjecture are supersymmetric (and thus associative) cycles. The rationale for
our construction is provided by the duality chain of arXiv:1708.07215, which
relates M-theory on TCS $G_2$-manifolds to $E_8\times E_8$ heterotic
backgrounds on the Schoen Calabi-Yau threefold, as well as to F-theory on a
K3-fibered Calabi-Yau fourfold. The latter are known to have an infinite number
of instanton corrections to the superpotential and it is these contributions
that we trace through the duality chain back to the $G_2$-compactification.
| hep-th math.DG | we consider the nonperturbative superpotential for a class of fourdimensional mathcal n1 vacua obtained from mtheory on sevenmanifolds with holonomy g_2 the class of g_2holonomy manifolds we consider are socalled twisted connected sum tcs constructions which have the topology of a k3fibration over s3 we show that the nonperturbative superpotential of mtheory on a class of tcs geometries receives infinitely many inequivalent m2instanton contributions from infinitely many threespheres which we conjecture are supersymmetric and thus associative cycles the rationale for our construction is provided by the duality chain of arxiv170807215 which relates mtheory on tcs g_2manifolds to e_8times e_8 heterotic backgrounds on the schoen calabiyau threefold as well as to ftheory on a k3fibered calabiyau fourfold the latter are known to have an infinite number of instanton corrections to the superpotential and it is these contributions that we trace through the duality chain back to the g_2compactification | [['we', 'consider', 'the', 'nonperturbative', 'superpotential', 'for', 'a', 'class', 'of', 'fourdimensional', 'mathcal', 'n1', 'vacua', 'obtained', 'from', 'mtheory', 'on', 'sevenmanifolds', 'with', 'holonomy', 'g_2', 'the', 'class', 'of', 'g_2holonomy', 'manifolds', 'we', 'consider', 'are', 'socalled', 'twisted', 'connected', 'sum', 'tcs', 'constructions', 'which', 'have', 'the', 'topology', 'of', 'a', 'k3fibration', 'over', 's3', 'we', 'show', 'that', 'the', 'nonperturbative', 'superpotential', 'of', 'mtheory', 'on', 'a', 'class', 'of', 'tcs', 'geometries', 'receives', 'infinitely', 'many', 'inequivalent', 'm2instanton', 'contributions', 'from', 'infinitely', 'many', 'threespheres', 'which', 'we', 'conjecture', 'are', 'supersymmetric', 'and', 'thus', 'associative', 'cycles', 'the', 'rationale', 'for', 'our', 'construction', 'is', 'provided', 'by', 'the', 'duality', 'chain', 'of', 'arxiv170807215', 'which', 'relates', 'mtheory', 'on', 'tcs', 'g_2manifolds', 'to', 'e_8times', 'e_8', 'heterotic', 'backgrounds', 'on', 'the', 'schoen', 'calabiyau', 'threefold', 'as', 'well', 'as', 'to', 'ftheory', 'on', 'a', 'k3fibered', 'calabiyau', 'fourfold', 'the', 'latter', 'are', 'known', 'to', 'have', 'an', 'infinite', 'number', 'of', 'instanton', 'corrections', 'to', 'the', 'superpotential', 'and', 'it', 'is', 'these', 'contributions', 'that', 'we', 'trace', 'through', 'the', 'duality', 'chain', 'back', 'to', 'the', 'g_2compactification']] | [-0.1714269454500431, 0.1135599959502037, -0.03671055175558043, 0.12929074815312763, -0.09593684240988093, -0.16603974502908792, -0.021158028618730087, 0.32522898455823046, -0.18117529979725885, -0.24123586491138363, 0.10429757193519941, -0.28929264049091014, -0.1873606155729956, 0.17906794717742336, -0.14593130521663827, -0.027687968301405717, -0.00724496348023725, 0.03454012855137181, -0.09420082960989223, -0.34284008021091317, 0.40325291949880515, -0.049749925473911896, 0.26201382774161175, 0.09565301222674963, 0.13445980250738407, -0.041573155160424195, 0.035771155044332974, -0.016775816041950345, -0.14827797349153116, 0.14231520821987134, 0.2834354415535927, 0.034592168035386645, 0.03944926199134594, -0.41811882465844974, -0.1802432399189355, 0.13117935850055396, 0.16315078106870512, 0.13870354512780775, 0.020434656134360314, -0.26071452917919186, 0.07069114513999214, -0.18239825107512944, -0.1258575382817071, -0.10707923808755974, 0.0008830462757032365, -0.05313241684861067, -0.2105834286647021, -0.032347336186729886, 0.016285450424927857, 0.012587076143568588, -0.00849592310098362, -0.10430143990864356, -0.11225561505933809, 0.07211841042509251, 0.14246457056207065, 0.057505966219145596, 0.0747827525742145, -0.1492049454342729, -0.1732190610621021, 0.31149571405452053, -0.01990541582442044, -0.21993120387519915, 0.10724261110751993, -0.08422433853492192, -0.22480018379024436, 0.14944207983353408, 0.07373974830908184, 0.2007814997668902, -0.0622626973065255, 0.23869665222769576, -0.0843750482341016, 0.03839810849361432, 0.10753065321478061, 0.026081623069735035, 0.21759804853677955, 0.08064131197817107, 0.07899891250498411, 0.13037205370427626, 0.006836938285333518, -0.13071148267125762, -0.43583740992471576, -0.11662287079626468, -0.09853669637232088, 0.25708969870336457, -0.11057705532402906, -0.1951969401173604, 0.3776500769308768, 0.018163498945000356, 0.21107317494008587, 0.11149593852314865, 0.16422875486184946, 0.009132864699899478, 0.08955181857810304, 0.020169618180564914, 0.19458037142208517, 0.16567046562866178, 0.007997665015055746, -0.2021933510291597, -0.1594292054812993, 0.24758518334904997] |
1,803.02344 | A new family of analytical anisotropic solutions by gravitational
decoupling | This work is focused in the study of analytic anisotropic solutions to
Einstein's field equations, describing spherically symmetric and static
configurations by way of the gravitational decoupling through the method of
Minimal Geometric Deformation (MGD). For this we apply MGD to Heintzmann's
solution obtaining two new analytic and well behaved anisotropic solutions, in
which all their parameters such as the effective density, the effective radial
and tangential pressure, as well as radial and tangential sound speed, fulfill
each of the requirements for the physical acceptability available in the
literature.
| gr-qc | this work is focused in the study of analytic anisotropic solutions to einsteins field equations describing spherically symmetric and static configurations by way of the gravitational decoupling through the method of minimal geometric deformation mgd for this we apply mgd to heintzmanns solution obtaining two new analytic and well behaved anisotropic solutions in which all their parameters such as the effective density the effective radial and tangential pressure as well as radial and tangential sound speed fulfill each of the requirements for the physical acceptability available in the literature | [['this', 'work', 'is', 'focused', 'in', 'the', 'study', 'of', 'analytic', 'anisotropic', 'solutions', 'to', 'einsteins', 'field', 'equations', 'describing', 'spherically', 'symmetric', 'and', 'static', 'configurations', 'by', 'way', 'of', 'the', 'gravitational', 'decoupling', 'through', 'the', 'method', 'of', 'minimal', 'geometric', 'deformation', 'mgd', 'for', 'this', 'we', 'apply', 'mgd', 'to', 'heintzmanns', 'solution', 'obtaining', 'two', 'new', 'analytic', 'and', 'well', 'behaved', 'anisotropic', 'solutions', 'in', 'which', 'all', 'their', 'parameters', 'such', 'as', 'the', 'effective', 'density', 'the', 'effective', 'radial', 'and', 'tangential', 'pressure', 'as', 'well', 'as', 'radial', 'and', 'tangential', 'sound', 'speed', 'fulfill', 'each', 'of', 'the', 'requirements', 'for', 'the', 'physical', 'acceptability', 'available', 'in', 'the', 'literature']] | [-0.1133439864709296, 0.06646847497375513, -0.08876112155584534, 0.066437383260398, -0.13093094820347193, -0.08653609197459776, -0.036850423171100294, 0.3238441797280261, -0.23246485359479926, -0.30345370750133455, 0.10632309697658374, -0.20248393165159292, -0.12750046551545066, 0.18763797004860613, -0.01721757829760794, 0.11765333645003424, -0.024646516984582624, 0.042733045615023, -0.10795865336893423, -0.1882731704549356, 0.3648670354715167, 0.03398071123625745, 0.2765702339185571, 0.029753002191269348, 0.11820301726799119, 0.0028405728622932325, -0.024928801248527387, 0.08209965524094348, -0.179032267523739, 0.1282873271900991, 0.21518086163665762, 0.12456980301067233, 0.20898369081657042, -0.41560597918843006, -0.23576682903380555, 0.041490764345243486, 0.13750137836905196, 0.1691573911428515, -0.06025250972544944, -0.25804019025103614, 0.07157237013928931, -0.1728675358886407, -0.231313555305612, -0.10830570071596991, 0.057054936744283295, 0.09061544562891041, -0.2488278183472258, 0.10754288575514113, 0.043598200763385234, 0.034161450445522365, -0.1709283963480795, -0.09545500427802009, -0.0290131245995078, 0.10382669350259345, 0.10770162410600195, 0.027264039622175253, 0.11597112395842983, -0.14509959271526895, -0.020076448933898726, 0.4204229208831252, -0.09936281101016159, -0.2610273421953686, 0.17962313049726866, -0.09902946187966419, -0.0846132681472227, 0.07316480426975018, 0.15467528708871792, 0.16618192170492627, -0.19261698857140305, 0.1043842207688034, 0.007071109481991946, 0.0850455271072199, 0.11239343824457716, 0.02494676766747778, 0.22224955474534494, 0.10011940426193178, 0.07236623865636913, 0.11057807262113784, -0.02586401313204657, -0.1028907509171404, -0.34292184629223565, -0.1525590956761417, -0.12203779046831187, 0.027714754825203934, -0.13749286393166668, -0.21404811139853502, 0.3999255904504521, 0.14814048017036507, 0.16359411478465932, 0.04636618891725613, 0.33024954198944295, 0.10197089456646195, 0.037617450249275534, 0.08454897930443456, 0.30185479372845625, 0.1409929533467882, 0.12365372820270502, -0.2205878975007429, 0.014855420777828178, 0.07184055812434632] |
1,803.02345 | State diagram of a three-sphere microswimmer in a channel | Geometric confinements are frequently encountered in soft matter systems and
in particular significantly alter the dynamics of swimming microorganisms in
viscous media. Surface-related effects on the motility of microswimmers can
lead to important consequences in a large number of biological systems, such as
biofilm formation, bacterial adhesion and microbial activity. On the basis of
low-Reynolds-number hydrodynamics, we explore the state diagram of a
three-sphere microswimmer under channel confinement in a slit geometry and
fully characterize the swimming behavior and trajectories for neutral swimmers,
puller- and pusher-type swimmers. While pushers always end up trapped at the
channel walls, neutral swimmers and pullers may further perform a gliding
motion and maintain a stable navigation along the channel. We find that the
resulting dynamical system exhibits a supercritical pitchfork bifurcation in
which swimming in the mid-plane becomes unstable beyond a transition channel
height while two new stable limit cycles or fixed points that are symmetrically
disposed with respect to the channel mid-height emerge. Additionally, we show
that an accurate description of the averaged swimming velocity and rotation
rate in a channel can be captured analytically using the method of hydrodynamic
images, provided that the swimmer size is much smaller than the channel height.
| physics.flu-dyn physics.bio-ph | geometric confinements are frequently encountered in soft matter systems and in particular significantly alter the dynamics of swimming microorganisms in viscous media surfacerelated effects on the motility of microswimmers can lead to important consequences in a large number of biological systems such as biofilm formation bacterial adhesion and microbial activity on the basis of lowreynoldsnumber hydrodynamics we explore the state diagram of a threesphere microswimmer under channel confinement in a slit geometry and fully characterize the swimming behavior and trajectories for neutral swimmers puller and pushertype swimmers while pushers always end up trapped at the channel walls neutral swimmers and pullers may further perform a gliding motion and maintain a stable navigation along the channel we find that the resulting dynamical system exhibits a supercritical pitchfork bifurcation in which swimming in the midplane becomes unstable beyond a transition channel height while two new stable limit cycles or fixed points that are symmetrically disposed with respect to the channel midheight emerge additionally we show that an accurate description of the averaged swimming velocity and rotation rate in a channel can be captured analytically using the method of hydrodynamic images provided that the swimmer size is much smaller than the channel height | [['geometric', 'confinements', 'are', 'frequently', 'encountered', 'in', 'soft', 'matter', 'systems', 'and', 'in', 'particular', 'significantly', 'alter', 'the', 'dynamics', 'of', 'swimming', 'microorganisms', 'in', 'viscous', 'media', 'surfacerelated', 'effects', 'on', 'the', 'motility', 'of', 'microswimmers', 'can', 'lead', 'to', 'important', 'consequences', 'in', 'a', 'large', 'number', 'of', 'biological', 'systems', 'such', 'as', 'biofilm', 'formation', 'bacterial', 'adhesion', 'and', 'microbial', 'activity', 'on', 'the', 'basis', 'of', 'lowreynoldsnumber', 'hydrodynamics', 'we', 'explore', 'the', 'state', 'diagram', 'of', 'a', 'threesphere', 'microswimmer', 'under', 'channel', 'confinement', 'in', 'a', 'slit', 'geometry', 'and', 'fully', 'characterize', 'the', 'swimming', 'behavior', 'and', 'trajectories', 'for', 'neutral', 'swimmers', 'puller', 'and', 'pushertype', 'swimmers', 'while', 'pushers', 'always', 'end', 'up', 'trapped', 'at', 'the', 'channel', 'walls', 'neutral', 'swimmers', 'and', 'pullers', 'may', 'further', 'perform', 'a', 'gliding', 'motion', 'and', 'maintain', 'a', 'stable', 'navigation', 'along', 'the', 'channel', 'we', 'find', 'that', 'the', 'resulting', 'dynamical', 'system', 'exhibits', 'a', 'supercritical', 'pitchfork', 'bifurcation', 'in', 'which', 'swimming', 'in', 'the', 'midplane', 'becomes', 'unstable', 'beyond', 'a', 'transition', 'channel', 'height', 'while', 'two', 'new', 'stable', 'limit', 'cycles', 'or', 'fixed', 'points', 'that', 'are', 'symmetrically', 'disposed', 'with', 'respect', 'to', 'the', 'channel', 'midheight', 'emerge', 'additionally', 'we', 'show', 'that', 'an', 'accurate', 'description', 'of', 'the', 'averaged', 'swimming', 'velocity', 'and', 'rotation', 'rate', 'in', 'a', 'channel', 'can', 'be', 'captured', 'analytically', 'using', 'the', 'method', 'of', 'hydrodynamic', 'images', 'provided', 'that', 'the', 'swimmer', 'size', 'is', 'much', 'smaller', 'than', 'the', 'channel', 'height']] | [-0.17637834222521634, 0.21644884590008587, -0.1008013739537273, 0.03472379390732385, -0.011646672760834918, -0.17131222076539415, 0.006247675197664648, 0.36443678171839566, -0.27203097019024425, -0.25179468540038213, 0.06028466661926359, -0.23225351947301534, -0.18255816926714033, 0.15995179372956045, -0.0731589708669344, 0.03225833219643391, 0.0563395422330359, 0.0008958202612120658, 0.03873413485940546, -0.16096570885973052, 0.22800929674645887, 0.022926181259099395, 0.27047659003641455, 0.020904998556070496, 0.10692683573346586, -0.03586141687235795, 0.053816304926294835, 0.06374974731588737, -0.20334828837847455, 0.043038404854014514, 0.18676599362515844, 0.006139615120482631, 0.2019629873521626, -0.4741136650973931, -0.23150012021360453, 0.08641483063460327, 0.24723558034282178, 0.15953820067399646, -0.038903111452964365, -0.2592688846623059, 0.03765684303652961, -0.15297243222477847, -0.15437387291691265, -0.05041823874460533, 0.04154264278884511, 0.060173886977718215, -0.239136803119909, 0.12009102351177717, 0.05700332661435823, 0.10677849562256597, -0.08405563675682061, -0.05498649840650614, -0.08994106681784615, 0.1487550636974629, 0.0738208921133446, -0.00997615564498119, 0.2659944571554661, -0.21283824210171587, -0.06295893085887655, 0.42391901050694286, -0.023142279397943638, -0.24365689430036583, 0.26128359953087055, -0.18167686076369136, -0.043388545182533565, 0.19814428564161063, 0.24944178585428745, 0.09387882969342172, -0.09336114306002856, -0.01252569793490693, -0.04143937715794891, 0.14663746295729652, 0.10760678787832148, -0.026412440598360263, 0.22578305880713742, 0.2071817664988339, 0.09123876013560221, 0.12642403938923963, -0.10118335803163063, -0.1391397907398641, -0.2371073747286573, -0.1361591761168529, -0.11200442655710503, 0.0231435862777289, -0.10437992549210322, -0.15754135410534217, 0.349242751726415, 0.11103544256126043, 0.20676604174310342, 0.0625574120337842, 0.281215001672972, 0.02075765869289171, 0.035710148259531706, 0.08321163565211463, 0.2756195415183902, 0.11059399566147476, 0.12293930022278801, -0.2621200705622323, 0.06593725366903527, 0.04708251940086484] |
1,803.02346 | The structure and stability of orbits in Hoag-like ring systems | Ring galaxies are amazing objects exemplified by the famous case of the
Hoag's Object. Here the mass of the central galaxy may be comparable to the
mass of the ring, making it a difficult case to model mechanically. In a
previous paper, it was shown that the outer potential of a torus (ring) can be
represented with good accuracy by the potential of a massive circle with the
same mass. This approach allows us to simplify the problem of the particle
motion in the gravitational field of a torus associated with a central mass by
replacing the torus with a massive circle. In such a system there is a circle
of unstable equilibrium that we call "Lagrangian circle" (LC). Stable circular
orbits exist only in some region limited by the last possible circular orbit
related to the disappearance of the extrema of the effective potential. We call
this orbit "the outermost stable circular orbit" (OSCO) by analogy with the
innermost stable circular orbit (ISCO) in the relativistic case of a black
hole. Under these conditions, there is a region between OSCO and LC where the
circular motion is not possible due to the competition between the
gravitational forces by the central mass and the ring. As a result, a gap in
the matter distribution can form in Hoag-like system with massive rings.
| astro-ph.GA | ring galaxies are amazing objects exemplified by the famous case of the hoags object here the mass of the central galaxy may be comparable to the mass of the ring making it a difficult case to model mechanically in a previous paper it was shown that the outer potential of a torus ring can be represented with good accuracy by the potential of a massive circle with the same mass this approach allows us to simplify the problem of the particle motion in the gravitational field of a torus associated with a central mass by replacing the torus with a massive circle in such a system there is a circle of unstable equilibrium that we call lagrangian circle lc stable circular orbits exist only in some region limited by the last possible circular orbit related to the disappearance of the extrema of the effective potential we call this orbit the outermost stable circular orbit osco by analogy with the innermost stable circular orbit isco in the relativistic case of a black hole under these conditions there is a region between osco and lc where the circular motion is not possible due to the competition between the gravitational forces by the central mass and the ring as a result a gap in the matter distribution can form in hoaglike system with massive rings | [['ring', 'galaxies', 'are', 'amazing', 'objects', 'exemplified', 'by', 'the', 'famous', 'case', 'of', 'the', 'hoags', 'object', 'here', 'the', 'mass', 'of', 'the', 'central', 'galaxy', 'may', 'be', 'comparable', 'to', 'the', 'mass', 'of', 'the', 'ring', 'making', 'it', 'a', 'difficult', 'case', 'to', 'model', 'mechanically', 'in', 'a', 'previous', 'paper', 'it', 'was', 'shown', 'that', 'the', 'outer', 'potential', 'of', 'a', 'torus', 'ring', 'can', 'be', 'represented', 'with', 'good', 'accuracy', 'by', 'the', 'potential', 'of', 'a', 'massive', 'circle', 'with', 'the', 'same', 'mass', 'this', 'approach', 'allows', 'us', 'to', 'simplify', 'the', 'problem', 'of', 'the', 'particle', 'motion', 'in', 'the', 'gravitational', 'field', 'of', 'a', 'torus', 'associated', 'with', 'a', 'central', 'mass', 'by', 'replacing', 'the', 'torus', 'with', 'a', 'massive', 'circle', 'in', 'such', 'a', 'system', 'there', 'is', 'a', 'circle', 'of', 'unstable', 'equilibrium', 'that', 'we', 'call', 'lagrangian', 'circle', 'lc', 'stable', 'circular', 'orbits', 'exist', 'only', 'in', 'some', 'region', 'limited', 'by', 'the', 'last', 'possible', 'circular', 'orbit', 'related', 'to', 'the', 'disappearance', 'of', 'the', 'extrema', 'of', 'the', 'effective', 'potential', 'we', 'call', 'this', 'orbit', 'the', 'outermost', 'stable', 'circular', 'orbit', 'osco', 'by', 'analogy', 'with', 'the', 'innermost', 'stable', 'circular', 'orbit', 'isco', 'in', 'the', 'relativistic', 'case', 'of', 'a', 'black', 'hole', 'under', 'these', 'conditions', 'there', 'is', 'a', 'region', 'between', 'osco', 'and', 'lc', 'where', 'the', 'circular', 'motion', 'is', 'not', 'possible', 'due', 'to', 'the', 'competition', 'between', 'the', 'gravitational', 'forces', 'by', 'the', 'central', 'mass', 'and', 'the', 'ring', 'as', 'a', 'result', 'a', 'gap', 'in', 'the', 'matter', 'distribution', 'can', 'form', 'in', 'hoaglike', 'system', 'with', 'massive', 'rings']] | [-0.17812330044378616, 0.09636064549561454, -0.08576851477633872, 0.04832276074347601, -0.04950216129851702, -0.1071210530518499, 0.011936291861432906, 0.344615071875864, -0.24356072637588466, -0.28340863303778924, 0.1057091109559884, -0.23107120923207036, -0.1099472773010464, 0.19870192342550497, -0.08182112621510249, 0.03324633981335109, 0.06432506625889269, 0.08461217528696015, -0.07163832072204736, -0.2016374849986506, 0.35348834831918247, 0.0815493413523588, 0.15909234647634843, 0.0032580009006180684, 0.06729100696682998, 0.011986245382066867, 0.03312976918179014, 0.05527743841755336, -0.1122102599358319, 0.11935465477277274, 0.17168916780586657, 0.05112835075961401, 0.22921098653252606, -0.38467677362841557, -0.16955232192851502, 0.11616430137429777, 0.15138153174517838, 0.08937124678329246, -0.07328315585765022, -0.2661720912480412, 0.07751787684753657, -0.2195679758415987, -0.21844383649374932, 0.016112663625786294, 0.09471506499377033, 0.018938604223469623, -0.22656147261511653, 0.08404726066164668, 0.09416198293937872, -0.013383775189323308, -0.06891131451694703, -0.02342766107349193, -0.0618260778703612, 0.09790429186509693, 0.0719279690297984, 0.06065892438578619, 0.17034288054357652, -0.11328539701144649, -0.0707815413461088, 0.4233427248793106, -0.0641399622261184, -0.1706444739734065, 0.21251501068345283, -0.21939723482716947, -0.08945953759862339, 0.1649974686036218, 0.12431386120582305, 0.15024179299298215, -0.1302158498422128, 0.10459101740770535, -0.10192814994535354, 0.146280504295073, 0.09747838542571283, -0.00753448844974229, 0.3516339770939252, 0.15031419809456897, 0.09444324712249871, 0.1280421555907674, -0.11820028294871888, -0.10017210388179766, -0.2650391050023303, -0.13160392879317068, -0.14127533582196525, 0.03430728487183763, -0.07686891321389995, -0.13406946710201903, 0.374990451375031, 0.09977241516906393, 0.23453784207962283, 0.0035338234864696265, 0.27269874278830203, 0.09479508490342069, 0.09906764689526737, 0.08893963930379922, 0.3047770186095896, 0.15173804456980466, 0.04821352898802387, -0.22818873016738872, -0.019182702371229727, 0.0609177600413765] |
1,803.02347 | Two results in metric fixed point theory | We establish two fixed point theorems for certain mappings of contractive
type. The first result is concerned with the case where such mappings take a
nonempty, closed subset of a complete metric space $X$ into $X$, and the second
with an application of the continuation method to the case where they satisfy
the Leray-Schauder boundary condition in Banach spaces.
| math.FA math.CA | we establish two fixed point theorems for certain mappings of contractive type the first result is concerned with the case where such mappings take a nonempty closed subset of a complete metric space x into x and the second with an application of the continuation method to the case where they satisfy the lerayschauder boundary condition in banach spaces | [['we', 'establish', 'two', 'fixed', 'point', 'theorems', 'for', 'certain', 'mappings', 'of', 'contractive', 'type', 'the', 'first', 'result', 'is', 'concerned', 'with', 'the', 'case', 'where', 'such', 'mappings', 'take', 'a', 'nonempty', 'closed', 'subset', 'of', 'a', 'complete', 'metric', 'space', 'x', 'into', 'x', 'and', 'the', 'second', 'with', 'an', 'application', 'of', 'the', 'continuation', 'method', 'to', 'the', 'case', 'where', 'they', 'satisfy', 'the', 'lerayschauder', 'boundary', 'condition', 'in', 'banach', 'spaces']] | [-0.16490456132786507, 0.027983799377718735, -0.054538316046029836, 0.06150828179769155, -0.061092275609183365, -0.13577400613576174, 0.06952732867734918, 0.33475105020896356, -0.31858014826804903, -0.13632563896224661, 0.14107323450359943, -0.2804913504988397, -0.12499424149834756, 0.18989148884774895, -0.11416433105182092, 0.039289727680763956, 0.04144549139349137, 0.10199553847028794, -0.13153723639365034, -0.24494892292482368, 0.46653785739662285, -0.10862039395813215, 0.21351536347578137, 0.04440929185030824, 0.143176719293756, 0.02782183650375928, 0.007940182067706423, 0.010231282348424922, -0.17720412248272008, 0.07222359463714569, 0.2722240462425654, 0.11115024439295974, 0.3308187915422654, -0.3823615044544814, -0.17226906457000365, 0.20924809402233716, 0.07001674165791374, -0.03110003244068663, -0.029314686118041056, -0.2973291361151989, 0.10827203989976038, -0.0743008219415985, -0.16537590700564747, -0.0589032196360877, -0.005967514036949408, 0.0314658622936172, -0.3422606319062791, -0.04927059133552899, 0.16013371630303436, 0.06882061390206218, -0.1418015448834305, -0.05758262749256219, -0.046173275361563695, 0.12535122583099342, 0.010998423041586401, 0.12432340832458715, 0.031706034134820864, -0.01786350081595829, -0.06512303528833692, 0.35709041552776, -0.04574010001053497, -0.2922124781219636, 0.1443937510603218, -0.1967334930264091, -0.1967428373015028, 0.09396797542507618, 0.11824168268812157, 0.19654587495251227, -0.10814092205679518, 0.17808621396385607, -0.08363794955085584, 0.08104252367195579, 0.0734990958037581, 0.03407247156157332, 0.11054379392762557, 0.13674734083746196, 0.16453434159521454, 0.1706288083124969, 0.0202897238758219, -0.06470283152736818, -0.42208678439512093, -0.17704407604790087, -0.14464423840597146, 0.09857899539362071, -0.14495975530476476, -0.2151657396580203, 0.3129246237340494, 0.058544256961194134, 0.22075221769637982, 0.0913119527306092, 0.20733738867408139, 0.11531643727320735, -0.01935589799689034, 0.07852451226247822, 0.14720179904567993, 0.15619506147074497, 0.04927331053699225, -0.072516305621228, -0.027116612073476033, 0.22198857501212318] |
1,803.02348 | Smoothed Action Value Functions for Learning Gaussian Policies | State-action value functions (i.e., Q-values) are ubiquitous in reinforcement
learning (RL), giving rise to popular algorithms such as SARSA and Q-learning.
We propose a new notion of action value defined by a Gaussian smoothed version
of the expected Q-value. We show that such smoothed Q-values still satisfy a
Bellman equation, making them learnable from experience sampled from an
environment. Moreover, the gradients of expected reward with respect to the
mean and covariance of a parameterized Gaussian policy can be recovered from
the gradient and Hessian of the smoothed Q-value function. Based on these
relationships, we develop new algorithms for training a Gaussian policy
directly from a learned smoothed Q-value approximator. The approach is
additionally amenable to proximal optimization by augmenting the objective with
a penalty on KL-divergence from a previous policy. We find that the ability to
learn both a mean and covariance during training leads to significantly
improved results on standard continuous control benchmarks.
| cs.LG cs.AI | stateaction value functions ie qvalues are ubiquitous in reinforcement learning rl giving rise to popular algorithms such as sarsa and qlearning we propose a new notion of action value defined by a gaussian smoothed version of the expected qvalue we show that such smoothed qvalues still satisfy a bellman equation making them learnable from experience sampled from an environment moreover the gradients of expected reward with respect to the mean and covariance of a parameterized gaussian policy can be recovered from the gradient and hessian of the smoothed qvalue function based on these relationships we develop new algorithms for training a gaussian policy directly from a learned smoothed qvalue approximator the approach is additionally amenable to proximal optimization by augmenting the objective with a penalty on kldivergence from a previous policy we find that the ability to learn both a mean and covariance during training leads to significantly improved results on standard continuous control benchmarks | [['stateaction', 'value', 'functions', 'ie', 'qvalues', 'are', 'ubiquitous', 'in', 'reinforcement', 'learning', 'rl', 'giving', 'rise', 'to', 'popular', 'algorithms', 'such', 'as', 'sarsa', 'and', 'qlearning', 'we', 'propose', 'a', 'new', 'notion', 'of', 'action', 'value', 'defined', 'by', 'a', 'gaussian', 'smoothed', 'version', 'of', 'the', 'expected', 'qvalue', 'we', 'show', 'that', 'such', 'smoothed', 'qvalues', 'still', 'satisfy', 'a', 'bellman', 'equation', 'making', 'them', 'learnable', 'from', 'experience', 'sampled', 'from', 'an', 'environment', 'moreover', 'the', 'gradients', 'of', 'expected', 'reward', 'with', 'respect', 'to', 'the', 'mean', 'and', 'covariance', 'of', 'a', 'parameterized', 'gaussian', 'policy', 'can', 'be', 'recovered', 'from', 'the', 'gradient', 'and', 'hessian', 'of', 'the', 'smoothed', 'qvalue', 'function', 'based', 'on', 'these', 'relationships', 'we', 'develop', 'new', 'algorithms', 'for', 'training', 'a', 'gaussian', 'policy', 'directly', 'from', 'a', 'learned', 'smoothed', 'qvalue', 'approximator', 'the', 'approach', 'is', 'additionally', 'amenable', 'to', 'proximal', 'optimization', 'by', 'augmenting', 'the', 'objective', 'with', 'a', 'penalty', 'on', 'kldivergence', 'from', 'a', 'previous', 'policy', 'we', 'find', 'that', 'the', 'ability', 'to', 'learn', 'both', 'a', 'mean', 'and', 'covariance', 'during', 'training', 'leads', 'to', 'significantly', 'improved', 'results', 'on', 'standard', 'continuous', 'control', 'benchmarks']] | [0.017617641048385733, 0.03954582022467343, -0.14307457338718158, 0.10714710982095811, -0.11437950435304833, -0.14922557300737788, 0.07977457302171857, 0.46390937321609066, -0.3344809001612086, -0.31058687249145983, 0.06206531169178385, -0.23788248924238067, -0.1890710874070083, 0.19307397046997662, -0.12490916980896145, 0.11590175851578674, 0.0734157441266542, 0.06214378170496333, -0.1487686411778052, -0.23891818764949999, 0.3104240736022832, 0.0657106834043178, 0.2452592898971371, -0.04681362453848124, 0.1546921320642615, -0.011979232716464228, -0.013276484455432622, 0.03144230479975381, -0.08293108772833817, 0.14733829814227178, 0.24524018000210485, 0.21423406414387205, 0.40060168899775994, -0.35977369805858017, -0.1838326683267951, 0.14385507869414024, 0.10968508209973094, 0.060449797600027055, -0.06688626891888318, -0.30850430385720345, 0.04733917820417593, -0.15329357924262782, -0.02106078153836631, -0.10727822375333597, -0.09710438331709273, 0.038517953496005744, -0.3952723007408842, 0.043257644309872584, 0.03626984219337183, 0.002728704978982287, -0.08397524219547067, -0.17403382823291805, 0.021675656356608435, 0.08353251069483737, 0.06402983275212107, 0.08825131822377444, 0.18853665000849193, -0.1550738939414582, -0.13629085851172285, 0.3049958967693871, -0.10018829329600257, -0.22076303133320424, 0.15727751769516016, -0.03737038116181089, -0.09039641246199608, 0.13730722354544747, 0.25449794807261034, 0.1608045477029537, -0.15204347890891856, 0.05592688557151104, -0.03371418275599999, 0.16567918664265063, 0.01124554472006557, -0.035097119999268366, 0.13309210946993721, 0.1525336327931596, 0.144346218796507, 0.1461062398446243, -0.07789515748398469, -0.14910402361063227, -0.2658605147063011, -0.10001914647497957, -0.20788823308783674, 0.04291899926479786, -0.12241007256914951, -0.1764371346108683, 0.3596615360148491, 0.18517152708804896, 0.22363758807881706, 0.20838814645765288, 0.30482771272861187, 0.1383622600584321, 0.09836609157162808, 0.13049290677412384, 0.20468301791397314, 0.07609179836938218, 0.09285359847389402, -0.20418332129146063, 0.12494575633036513, 0.07789888984313414] |
1,803.02349 | Billion-scale Commodity Embedding for E-commerce Recommendation in
Alibaba | Recommender systems (RSs) have been the most important technology for
increasing the business in Taobao, the largest online consumer-to-consumer
(C2C) platform in China. The billion-scale data in Taobao creates three major
challenges to Taobao's RS: scalability, sparsity and cold start. In this paper,
we present our technical solutions to address these three challenges. The
methods are based on the graph embedding framework. We first construct an item
graph from users' behavior history. Each item is then represented as a vector
using graph embedding. The item embeddings are employed to compute pairwise
similarities between all items, which are then used in the recommendation
process. To alleviate the sparsity and cold start problems, side information is
incorporated into the embedding framework. We propose two aggregation methods
to integrate the embeddings of items and the corresponding side information.
Experimental results from offline experiments show that methods incorporating
side information are superior to those that do not. Further, we describe the
platform upon which the embedding methods are deployed and the workflow to
process the billion-scale data in Taobao. Using online A/B test, we show that
the online Click-Through-Rate (CTRs) are improved comparing to the previous
recommendation methods widely used in Taobao, further demonstrating the
effectiveness and feasibility of our proposed methods in Taobao's live
production environment.
| cs.IR cs.AI | recommender systems rss have been the most important technology for increasing the business in taobao the largest online consumertoconsumer c2c platform in china the billionscale data in taobao creates three major challenges to taobaos rs scalability sparsity and cold start in this paper we present our technical solutions to address these three challenges the methods are based on the graph embedding framework we first construct an item graph from users behavior history each item is then represented as a vector using graph embedding the item embeddings are employed to compute pairwise similarities between all items which are then used in the recommendation process to alleviate the sparsity and cold start problems side information is incorporated into the embedding framework we propose two aggregation methods to integrate the embeddings of items and the corresponding side information experimental results from offline experiments show that methods incorporating side information are superior to those that do not further we describe the platform upon which the embedding methods are deployed and the workflow to process the billionscale data in taobao using online ab test we show that the online clickthroughrate ctrs are improved comparing to the previous recommendation methods widely used in taobao further demonstrating the effectiveness and feasibility of our proposed methods in taobaos live production environment | [['recommender', 'systems', 'rss', 'have', 'been', 'the', 'most', 'important', 'technology', 'for', 'increasing', 'the', 'business', 'in', 'taobao', 'the', 'largest', 'online', 'consumertoconsumer', 'c2c', 'platform', 'in', 'china', 'the', 'billionscale', 'data', 'in', 'taobao', 'creates', 'three', 'major', 'challenges', 'to', 'taobaos', 'rs', 'scalability', 'sparsity', 'and', 'cold', 'start', 'in', 'this', 'paper', 'we', 'present', 'our', 'technical', 'solutions', 'to', 'address', 'these', 'three', 'challenges', 'the', 'methods', 'are', 'based', 'on', 'the', 'graph', 'embedding', 'framework', 'we', 'first', 'construct', 'an', 'item', 'graph', 'from', 'users', 'behavior', 'history', 'each', 'item', 'is', 'then', 'represented', 'as', 'a', 'vector', 'using', 'graph', 'embedding', 'the', 'item', 'embeddings', 'are', 'employed', 'to', 'compute', 'pairwise', 'similarities', 'between', 'all', 'items', 'which', 'are', 'then', 'used', 'in', 'the', 'recommendation', 'process', 'to', 'alleviate', 'the', 'sparsity', 'and', 'cold', 'start', 'problems', 'side', 'information', 'is', 'incorporated', 'into', 'the', 'embedding', 'framework', 'we', 'propose', 'two', 'aggregation', 'methods', 'to', 'integrate', 'the', 'embeddings', 'of', 'items', 'and', 'the', 'corresponding', 'side', 'information', 'experimental', 'results', 'from', 'offline', 'experiments', 'show', 'that', 'methods', 'incorporating', 'side', 'information', 'are', 'superior', 'to', 'those', 'that', 'do', 'not', 'further', 'we', 'describe', 'the', 'platform', 'upon', 'which', 'the', 'embedding', 'methods', 'are', 'deployed', 'and', 'the', 'workflow', 'to', 'process', 'the', 'billionscale', 'data', 'in', 'taobao', 'using', 'online', 'ab', 'test', 'we', 'show', 'that', 'the', 'online', 'clickthroughrate', 'ctrs', 'are', 'improved', 'comparing', 'to', 'the', 'previous', 'recommendation', 'methods', 'widely', 'used', 'in', 'taobao', 'further', 'demonstrating', 'the', 'effectiveness', 'and', 'feasibility', 'of', 'our', 'proposed', 'methods', 'in', 'taobaos', 'live', 'production', 'environment']] | [-0.03567406185573178, -0.006764171632895804, -0.06183309146073506, 0.07355664628000838, -0.12535327199279805, -0.1425873970081327, 0.033663281209367096, 0.450808247551322, -0.29155876363006, -0.29986047776957386, 0.1218168896264203, -0.3621453159611742, -0.17847976680704444, 0.1705762396422698, -0.08078899396855806, 0.05975626690626498, 0.09616073072483798, 0.05204012105131592, -0.03205161811542293, -0.32228434075508594, 0.3068608399173069, 0.028783742505354138, 0.33671991416815455, 0.0518567210194031, 0.07240380798488469, -0.014913247790591756, -0.06465970151832565, 0.01928501190696755, -0.10284565892978653, 0.17486770944186608, 0.34016996469427746, 0.22811256252330253, 0.3177353326403668, -0.43152021906637356, -0.19006641639642557, 0.09524081903509796, 0.15703780098185646, 0.08292985298859729, -0.08068570658566764, -0.31385709171816006, 0.10457165156741503, -0.1932227518453421, 0.006680905232469569, -0.0972916952000474, -0.053114777878981154, 0.01046403193569584, -0.27788153263511806, -0.018083231954150042, 0.02427775597524882, 0.004434051933338128, -0.059155633128336015, -0.135467978484296, 0.04453989063424744, 0.18567840840649913, 0.04627072607042962, 0.004587481945493909, 0.13088283575697854, -0.11880357555498947, -0.19102301143267947, 0.3956941052884707, -0.04246388633300568, -0.18107728458933295, 0.19344347670898368, -0.043320786567593764, -0.16992629582791607, 0.05977550410129622, 0.24142735175357885, 0.07037735087928837, -0.18090318994297874, 0.046950054026312055, -0.032910082155381735, 0.1764282250001517, 0.021427552433210022, 0.0002621437833679594, 0.15087291641811015, 0.225220838262928, 0.038239863545212124, 0.11822058954649552, -0.05084991752705976, -0.08799501733617189, -0.197062982993095, -0.13888079195529363, -0.17958894965210315, -0.051184834074380015, -0.12018589957205102, -0.10880870466946431, 0.37133958602086903, 0.2502765619934027, 0.19487274735770627, 0.023639147883755558, 0.34387507041441806, 0.021080933951109403, 0.08134560804937105, 0.12202682015969295, 0.16727000584755586, -0.0037080729380249977, 0.13040322750501493, -0.1577245597881353, 0.08430870098856998, 0.06168041695436498] |
1,803.0235 | Degeneracy of gravitational waveforms in the context of GW150914 | We study the degeneracy of theoretical gravitational waveforms for binary
black hole mergers using an aligned-spin effective-one-body model. After
appropriate truncation, bandpassing, and matching, we identify regions in the
mass--spin parameter space containing waveforms similar to the template
proposed for GW150914, with masses $m_1 = 36^{+5}_{-4} M_\odot$ and $m_2 =
29^{+4}_{-4} M_\odot$, using the cross-correlation coefficient as a measure of
the similarity between waveforms. Remarkably high cross-correlations are found
across broad regions of parameter space. The associated uncertanties exceed
these from LIGO's Bayesian analysis considerably. We have shown that waveforms
with greatly increased masses, such as $m_1 = 70 M_\odot$ and $m_2 = 35
M_\odot$, and strong anti-aligned spins ($\chi_1=0.95$ and $\chi_2=-0.95$)
yield almost the same signal-to-noise ratio in the strain data for GW150914.
| gr-qc astro-ph.CO | we study the degeneracy of theoretical gravitational waveforms for binary black hole mergers using an alignedspin effectiveonebody model after appropriate truncation bandpassing and matching we identify regions in the massspin parameter space containing waveforms similar to the template proposed for gw150914 with masses m_1 365_4 m_odot and m_2 294_4 m_odot using the crosscorrelation coefficient as a measure of the similarity between waveforms remarkably high crosscorrelations are found across broad regions of parameter space the associated uncertanties exceed these from ligos bayesian analysis considerably we have shown that waveforms with greatly increased masses such as m_1 70 m_odot and m_2 35 m_odot and strong antialigned spins chi_1095 and chi_2095 yield almost the same signaltonoise ratio in the strain data for gw150914 | [['we', 'study', 'the', 'degeneracy', 'of', 'theoretical', 'gravitational', 'waveforms', 'for', 'binary', 'black', 'hole', 'mergers', 'using', 'an', 'alignedspin', 'effectiveonebody', 'model', 'after', 'appropriate', 'truncation', 'bandpassing', 'and', 'matching', 'we', 'identify', 'regions', 'in', 'the', 'massspin', 'parameter', 'space', 'containing', 'waveforms', 'similar', 'to', 'the', 'template', 'proposed', 'for', 'gw150914', 'with', 'masses', 'm_1', '365_4', 'm_odot', 'and', 'm_2', '294_4', 'm_odot', 'using', 'the', 'crosscorrelation', 'coefficient', 'as', 'a', 'measure', 'of', 'the', 'similarity', 'between', 'waveforms', 'remarkably', 'high', 'crosscorrelations', 'are', 'found', 'across', 'broad', 'regions', 'of', 'parameter', 'space', 'the', 'associated', 'uncertanties', 'exceed', 'these', 'from', 'ligos', 'bayesian', 'analysis', 'considerably', 'we', 'have', 'shown', 'that', 'waveforms', 'with', 'greatly', 'increased', 'masses', 'such', 'as', 'm_1', '70', 'm_odot', 'and', 'm_2', '35', 'm_odot', 'and', 'strong', 'antialigned', 'spins', 'chi_1095', 'and', 'chi_2095', 'yield', 'almost', 'the', 'same', 'signaltonoise', 'ratio', 'in', 'the', 'strain', 'data', 'for', 'gw150914']] | [-0.13380593019912523, 0.11544923581120309, 0.024114718329224547, 0.12416398671250474, -0.03627143254290509, -0.07737146862743075, 0.04019798881421655, 0.39086179495631257, -0.11807974951215468, -0.3686807653945634, 0.060016603495183764, -0.314882280403685, -0.0774676268565137, 0.23856016722018436, 0.004519739999214851, 0.0436622503655568, 0.10563707187124607, -0.03446041646618712, -0.16953598878591053, -0.2049459072236382, 0.29205489138689317, 0.06513219019319168, 0.19290550420123895, -0.07559090314859176, 0.08212334758965141, -0.01784172941441253, -0.00917420887498785, -0.06347636759362058, -0.21004023631252555, 0.005023148329139261, 0.2715646575907466, 0.16334919372605064, 0.15236157111002732, -0.2932047904192833, -0.1775890092397014, 0.0823398403255111, 0.16262197608246085, 0.06458489293769254, -0.05908631840799698, -0.30737063266786796, 0.10717225499190706, -0.2948410483057437, -0.06820123027063023, -0.025160835266618404, 0.052452587494942346, 0.01704433282355825, -0.29576235849477384, 0.18578611390854596, 0.0197256385009357, -0.05079597451475496, -0.09514113136377754, -0.1346983662253972, -0.10841156615307397, 0.07226444342789257, 0.11008570058531743, 0.08157229666416613, 0.1231982809357282, -0.04304816692246724, -0.05173676036756044, 0.35326017883322125, -0.07571015014289484, -0.13697943255360537, 0.17508664355471226, -0.195037528020093, -0.13286154609670767, 0.14604281263733757, 0.17470251954697325, 0.11726501337015781, -0.13555575106135112, 0.019078394162796154, 0.09054333133370442, 0.2613973943043058, 0.11591133326528814, 0.04482494640732342, 0.36437792638790306, 0.11328001984915996, 0.02294481403028624, 0.06022706168005243, -0.16055141758002042, -0.01657445838090853, -0.20630110738506952, -0.045280041759370004, -0.15203462724112196, 0.07384877251875507, -0.24185580564443301, -0.100905883633798, 0.33484442698990263, 0.1474559928164265, 0.23200182452939955, 0.09711535317774948, 0.2719784834248535, 0.08175192682873615, 0.0643507930207445, 0.05082271969679869, 0.3564584839820735, 0.14844196845019647, 0.029512877733904427, -0.20162154787606795, -0.02242374180232064, 0.002656465388392493] |
1,803.02351 | Time-dependent Features in the Primordial Spectrum | In a Quantum Field Theory with a time-dependent background,
time-translational symmetry is broken. We therefore expect time-dependent loop
corrections to cosmological observables after renormalization for an
interacting field, with the consequent physical implications. In this paper we
compute and discuss such radiative corrections to the primordial spectrum
within simple models, both for massless and massive virtual fields, and we
disentangle the time-dependence caused by the background and by the initial
state after renormalization. For the investigated models the departure from
near-scale-invariance is very small and there is full compatibility with the
current Planck data constraints. Future CMB measurements may improve the
current constraints on feature-full primordial spectra and possibly observe
these effects in the most optimistic scenario of hybrid inflation, revealing
the interacting nature of the inflaton field.
| gr-qc hep-ph hep-th | in a quantum field theory with a timedependent background timetranslational symmetry is broken we therefore expect timedependent loop corrections to cosmological observables after renormalization for an interacting field with the consequent physical implications in this paper we compute and discuss such radiative corrections to the primordial spectrum within simple models both for massless and massive virtual fields and we disentangle the timedependence caused by the background and by the initial state after renormalization for the investigated models the departure from nearscaleinvariance is very small and there is full compatibility with the current planck data constraints future cmb measurements may improve the current constraints on featurefull primordial spectra and possibly observe these effects in the most optimistic scenario of hybrid inflation revealing the interacting nature of the inflaton field | [['in', 'a', 'quantum', 'field', 'theory', 'with', 'a', 'timedependent', 'background', 'timetranslational', 'symmetry', 'is', 'broken', 'we', 'therefore', 'expect', 'timedependent', 'loop', 'corrections', 'to', 'cosmological', 'observables', 'after', 'renormalization', 'for', 'an', 'interacting', 'field', 'with', 'the', 'consequent', 'physical', 'implications', 'in', 'this', 'paper', 'we', 'compute', 'and', 'discuss', 'such', 'radiative', 'corrections', 'to', 'the', 'primordial', 'spectrum', 'within', 'simple', 'models', 'both', 'for', 'massless', 'and', 'massive', 'virtual', 'fields', 'and', 'we', 'disentangle', 'the', 'timedependence', 'caused', 'by', 'the', 'background', 'and', 'by', 'the', 'initial', 'state', 'after', 'renormalization', 'for', 'the', 'investigated', 'models', 'the', 'departure', 'from', 'nearscaleinvariance', 'is', 'very', 'small', 'and', 'there', 'is', 'full', 'compatibility', 'with', 'the', 'current', 'planck', 'data', 'constraints', 'future', 'cmb', 'measurements', 'may', 'improve', 'the', 'current', 'constraints', 'on', 'featurefull', 'primordial', 'spectra', 'and', 'possibly', 'observe', 'these', 'effects', 'in', 'the', 'most', 'optimistic', 'scenario', 'of', 'hybrid', 'inflation', 'revealing', 'the', 'interacting', 'nature', 'of', 'the', 'inflaton', 'field']] | [-0.14222176928472305, 0.1820402468550287, -0.08083613018416577, 0.11151983786770697, -0.05613893736153841, -0.11537757548429663, -0.0017869670261880235, 0.31230049383723074, -0.23297011485371355, -0.3234585319490482, 0.07697988830466149, -0.2673536600352871, -0.09363783014908669, 0.17567716914391707, 0.017313251070426926, 0.020642212732502864, 0.033999815476053054, 0.006301533918650378, -0.08163267336342306, -0.2022651042382691, 0.37142063308108064, 0.12938327394289126, 0.23642055283758848, 0.05601777924069514, 0.048394990815145394, -0.009473813093444776, -0.06286412273119721, 0.01602215925231576, -0.1143785638081941, 0.04689930307601268, 0.16356724327586505, 0.10574915987764677, 0.19469153024840039, -0.4757761357089741, -0.25360678220611244, 0.11381477012025518, 0.1072185313955526, 0.18557471853296553, -0.0848740097033673, -0.29122921774193405, 0.0461950150945793, -0.16378165135485312, -0.14210352501905862, -0.08432865160931316, -0.012651356732627997, -0.07209681216923017, -0.2879104043804257, 0.09271885436545643, -0.0341742439056924, 0.0039505188515971575, -0.08010642049235425, -0.05690503405362722, -0.034400515683320546, 0.08316206083529526, 0.10101178305922076, 0.01647302538659128, 0.15695290044707705, -0.21005890150609913, -0.0990847306388859, 0.4248689463036874, -0.1344683005193633, -0.14087647729967204, 0.14371310504123805, -0.16605150186648918, -0.19132070311729515, 0.08149540188929273, 0.1493558332375768, 0.07045300750594054, -0.1423048002623199, 0.14586334446877508, 0.06499270903360513, 0.13963370428731045, 0.0014952738152166445, 0.05878402726976053, 0.3020190825567596, 0.11136822661917124, 0.013680192069076592, 0.09100201761808306, -0.08107791521534738, -0.1112242466696198, -0.3464743864559938, -0.0800222584253384, -0.12804037873588858, 0.07569966949005094, -0.11463340151512677, -0.14139615324980004, 0.4011679572452392, 0.19278696487336197, 0.20084146772223038, 0.027489421008679543, 0.3120312798058703, 0.1276685845038469, 0.05712323734861991, 0.06152469029147473, 0.3049576947140315, 0.14703782049233152, 0.09402753663663235, -0.2621307162704715, -0.011841995369953414, -0.017142577776833187] |
1,803.02352 | Genealogy tree: understanding academic lineage of authors via
algorithmic and visual analysis | Ancestry and genealogy tree are proven tools to determine the lineage of any
person and establish dependencies among individuals. Genealogy tree can be
exploited further to gain information about the researcher and his scholastic
lineage which is of paramount importance in today's world of computer
technology. this insight into academic genealogy could be a way of helping PHD
students achieve academic socialization within the discipline, by making
explicit connections that may be influential. Awareness of his scientific
heritage gives the user a broader perspective of his own research project. This
paper also highlights and investigates how this academic network is exploited
by certain researchers using various visualization tools. It was observed
during this work that the credibility and influence factor is determined by the
various citations obtained by an author and to improve their rankings in
various forms, they tend to collaborate in their academic circle and boost
their citation count. A recent trend among researchers is to form communities
based on their academic relationships and rely on copious citations for their
mutual benefit. Tracing the genealogical relationships can be helpful in
detecting such communities and also create a more quality aware metric using a
lineage independent model for computation of author level metrics.
| cs.DL | ancestry and genealogy tree are proven tools to determine the lineage of any person and establish dependencies among individuals genealogy tree can be exploited further to gain information about the researcher and his scholastic lineage which is of paramount importance in todays world of computer technology this insight into academic genealogy could be a way of helping phd students achieve academic socialization within the discipline by making explicit connections that may be influential awareness of his scientific heritage gives the user a broader perspective of his own research project this paper also highlights and investigates how this academic network is exploited by certain researchers using various visualization tools it was observed during this work that the credibility and influence factor is determined by the various citations obtained by an author and to improve their rankings in various forms they tend to collaborate in their academic circle and boost their citation count a recent trend among researchers is to form communities based on their academic relationships and rely on copious citations for their mutual benefit tracing the genealogical relationships can be helpful in detecting such communities and also create a more quality aware metric using a lineage independent model for computation of author level metrics | [['ancestry', 'and', 'genealogy', 'tree', 'are', 'proven', 'tools', 'to', 'determine', 'the', 'lineage', 'of', 'any', 'person', 'and', 'establish', 'dependencies', 'among', 'individuals', 'genealogy', 'tree', 'can', 'be', 'exploited', 'further', 'to', 'gain', 'information', 'about', 'the', 'researcher', 'and', 'his', 'scholastic', 'lineage', 'which', 'is', 'of', 'paramount', 'importance', 'in', 'todays', 'world', 'of', 'computer', 'technology', 'this', 'insight', 'into', 'academic', 'genealogy', 'could', 'be', 'a', 'way', 'of', 'helping', 'phd', 'students', 'achieve', 'academic', 'socialization', 'within', 'the', 'discipline', 'by', 'making', 'explicit', 'connections', 'that', 'may', 'be', 'influential', 'awareness', 'of', 'his', 'scientific', 'heritage', 'gives', 'the', 'user', 'a', 'broader', 'perspective', 'of', 'his', 'own', 'research', 'project', 'this', 'paper', 'also', 'highlights', 'and', 'investigates', 'how', 'this', 'academic', 'network', 'is', 'exploited', 'by', 'certain', 'researchers', 'using', 'various', 'visualization', 'tools', 'it', 'was', 'observed', 'during', 'this', 'work', 'that', 'the', 'credibility', 'and', 'influence', 'factor', 'is', 'determined', 'by', 'the', 'various', 'citations', 'obtained', 'by', 'an', 'author', 'and', 'to', 'improve', 'their', 'rankings', 'in', 'various', 'forms', 'they', 'tend', 'to', 'collaborate', 'in', 'their', 'academic', 'circle', 'and', 'boost', 'their', 'citation', 'count', 'a', 'recent', 'trend', 'among', 'researchers', 'is', 'to', 'form', 'communities', 'based', 'on', 'their', 'academic', 'relationships', 'and', 'rely', 'on', 'copious', 'citations', 'for', 'their', 'mutual', 'benefit', 'tracing', 'the', 'genealogical', 'relationships', 'can', 'be', 'helpful', 'in', 'detecting', 'such', 'communities', 'and', 'also', 'create', 'a', 'more', 'quality', 'aware', 'metric', 'using', 'a', 'lineage', 'independent', 'model', 'for', 'computation', 'of', 'author', 'level', 'metrics']] | [-0.05290258641488275, 0.07585895987401325, -0.10420595400729309, 0.12624631031569294, -0.19992026134722812, -0.12756062393900186, 0.12342264428198356, 0.39328527744567277, -0.24485137988128425, -0.3781500895799813, 0.05928312938126242, -0.2942233219829516, -0.1896470685072321, 0.17751271082385095, -0.14222681093330417, -0.0014601875388739155, 0.09337853032846789, 0.05261892493239001, 0.050607984280099584, -0.35477513482785034, 0.2926196166606364, 0.12265493480178218, 0.331305182470447, 0.08144382704342527, 0.043851039428309556, -0.00040942957332613423, -0.15428836164852222, -0.0012453999878226907, -0.10369140429996632, 0.21394756019078925, 0.3846429697050731, 0.2775999534793193, 0.3810912460253081, -0.40823549847917484, -0.17814082853546293, 0.09435786407066546, 0.1682481868683324, 0.08989338275997023, -0.006537217656324513, -0.3527893338754189, 0.06397970631494936, -0.21308340305946402, -0.07726354763458491, -0.06781095069120913, 0.020538379062439643, 0.016190921563618614, -0.17103992600459605, -0.003682130452658634, 0.037113887112069525, 0.1293222064211709, 0.0316581306608129, -0.12255861860923652, -0.00528789023062963, 0.27182338289304764, 0.0933598040200213, 0.026358376870156658, 0.1744984190137235, -0.14398116997971575, -0.1530376548705367, 0.35665536636039247, 0.01135551194117094, -0.185969255500965, 0.1639783072511337, -0.10882580468394593, -0.16543235860744437, 0.0487506938972693, 0.22587373293936253, 0.03863044084259765, -0.21837073925188652, 0.031532753238114344, 0.0017566510439649516, 0.12613423804378174, 0.11342948555887002, -0.010953913550075217, 0.23691944306369359, 0.14777826697693444, 0.04420476319315711, 0.08354412790276018, 0.0232308349645167, -0.09053668143529006, -0.15614530750477285, -0.1830637742098713, -0.15032667069531538, 0.03608897304523042, -0.09077490494275801, -0.12004389827822759, 0.41925251316256346, 0.17091327846020588, 0.11574167841086712, 0.04690213148498122, 0.24620969133342013, 0.027915519059580916, 0.07263446331946362, 0.07645011666204037, 0.1639749312581604, 0.08320763722226462, 0.17184972853454597, -0.10617932053876347, 0.19104736094995328, 0.013800237517274333] |
1,803.02353 | Multi-level Attention Model for Weakly Supervised Audio Classification | In this paper, we propose a multi-level attention model to solve the weakly
labelled audio classification problem. The objective of audio classification is
to predict the presence or absence of audio events in an audio clip. Recently,
Google published a large scale weakly labelled dataset called Audio Set, where
each audio clip contains only the presence or absence of the audio events,
without the onset and offset time of the audio events. Our multi-level
attention model is an extension to the previously proposed single-level
attention model. It consists of several attention modules applied on
intermediate neural network layers. The output of these attention modules are
concatenated to a vector followed by a multi-label classifier to make the final
prediction of each class. Experiments shown that our model achieves a mean
average precision (mAP) of 0.360, outperforms the state-of-the-art single-level
attention model of 0.327 and Google baseline of 0.314.
| eess.AS cs.SD | in this paper we propose a multilevel attention model to solve the weakly labelled audio classification problem the objective of audio classification is to predict the presence or absence of audio events in an audio clip recently google published a large scale weakly labelled dataset called audio set where each audio clip contains only the presence or absence of the audio events without the onset and offset time of the audio events our multilevel attention model is an extension to the previously proposed singlelevel attention model it consists of several attention modules applied on intermediate neural network layers the output of these attention modules are concatenated to a vector followed by a multilabel classifier to make the final prediction of each class experiments shown that our model achieves a mean average precision map of 0360 outperforms the stateoftheart singlelevel attention model of 0327 and google baseline of 0314 | [['in', 'this', 'paper', 'we', 'propose', 'a', 'multilevel', 'attention', 'model', 'to', 'solve', 'the', 'weakly', 'labelled', 'audio', 'classification', 'problem', 'the', 'objective', 'of', 'audio', 'classification', 'is', 'to', 'predict', 'the', 'presence', 'or', 'absence', 'of', 'audio', 'events', 'in', 'an', 'audio', 'clip', 'recently', 'google', 'published', 'a', 'large', 'scale', 'weakly', 'labelled', 'dataset', 'called', 'audio', 'set', 'where', 'each', 'audio', 'clip', 'contains', 'only', 'the', 'presence', 'or', 'absence', 'of', 'the', 'audio', 'events', 'without', 'the', 'onset', 'and', 'offset', 'time', 'of', 'the', 'audio', 'events', 'our', 'multilevel', 'attention', 'model', 'is', 'an', 'extension', 'to', 'the', 'previously', 'proposed', 'singlelevel', 'attention', 'model', 'it', 'consists', 'of', 'several', 'attention', 'modules', 'applied', 'on', 'intermediate', 'neural', 'network', 'layers', 'the', 'output', 'of', 'these', 'attention', 'modules', 'are', 'concatenated', 'to', 'a', 'vector', 'followed', 'by', 'a', 'multilabel', 'classifier', 'to', 'make', 'the', 'final', 'prediction', 'of', 'each', 'class', 'experiments', 'shown', 'that', 'our', 'model', 'achieves', 'a', 'mean', 'average', 'precision', 'map', 'of', '0360', 'outperforms', 'the', 'stateoftheart', 'singlelevel', 'attention', 'model', 'of', '0327', 'and', 'google', 'baseline', 'of', '0314']] | [-0.09022324076598838, 0.01652976058126975, 0.002141987230012042, 0.056837771947627784, -0.10564056643901544, -0.1921229647972772, 0.017499285033507575, 0.4225673158023808, -0.24681779729026193, -0.3199199022775566, 0.04956491466775235, -0.32833247353020756, -0.1613431553186446, 0.16979651673761043, -0.11946886845681867, 0.06430772433963579, 0.15766374242643044, 0.1351237790029798, -0.0503019916847021, -0.2898528835266424, 0.2682579311753019, 0.04952227534424212, 0.3524492528365069, -0.0382378275633626, 0.1674310470250045, -0.011244629811797593, -0.06570915793103317, -0.054932901221233094, -4.171044811546626e-06, 0.12847736314083827, 0.2887437740636587, 0.14079583890899713, 0.3260118628071772, -0.3511752817792365, -0.2360484228639335, 0.11512320298651182, 0.11658166688426423, 0.11469876923837473, -0.04642674074892892, -0.37911696715997784, 0.10171200633929992, -0.22659755012058225, 0.06246583064942545, -0.0550732927497577, 0.013671437262658131, -0.015893707596193497, -0.3056258874240558, 0.05799585663732393, 0.10984007184108761, 0.038284079069460464, -0.04439010120915702, -0.08452251299388229, -0.0038808670974135196, 0.1413916233058616, 0.026922013713644718, 0.08108807122098861, 0.12192990533957207, -0.1702565124627703, -0.14271843977228463, 0.34965776743971416, -0.08964429033693631, -0.20317747401123917, 0.18842567644094596, -0.018939472051971353, -0.12806621511353533, 0.13681280052264197, 0.23146943442171086, 0.09629912444742748, -0.15537060280031575, 0.0002717961064804144, -0.09354862975384537, 0.24744892923941686, 0.04501465469680575, -0.008386537556951816, 0.18588832035232838, 0.2854109970000069, -0.036214423170816655, 0.1909346819628735, -0.1674281514461728, -0.05763901887710106, -0.2016864086979547, -0.07623622537515051, -0.17635477355026916, -0.028161162689856783, -0.0560421006173144, -0.1643490488206373, 0.44945279197968746, 0.22245240998391463, 0.24376000521226307, 0.10347383660641876, 0.32788697532629846, 0.019494336967712828, 0.10896447251080472, 0.04769791370081539, 0.1402700436112748, 0.03359414342117521, 0.12097577235348385, -0.1509294041237366, 0.06342948726504236, 0.1062355206908054] |
1,803.02354 | A Phase-Field Model for Fluid-Structure-Interaction | In this paper, we develop a novel phase-field model for fluid-structure
interaction (FSI), that is capable to handle very large deformations as well as
topology changes like contact of the solid to the domain boundary. The model is
based on a fully Eulerian description of the velocity field in both, the fluid
and the elastic domain. Viscous and elastic stresses in the Navier-Stokes
equations are restricted to the corresponding domains by multiplication with
their characteristic functions. To obtain the elastic stress, an additional
Oldroyd-B - like equation is solved. Thermodynamically consistent forces are
derived by energy variation. The convergence of the derived equations to the
traditional sharp interface formulation of fluid-structure interaction is shown
by matched asymptotic analysis. The model is evaluated in a challenging
benchmark scenario of an elastic body traversing a fluid channel. A comparison
to reference values from Arbitrary Lagrangian Eulerian (ALE) simulations shows
very good agreement. We highlight some distinct advantages of the new model,
like the avoidance of re-triangulations and the stable inclusion of surface
tension. Further, we demonstrate how simple it is to include contact dynamics
into the model, by simulating a ball bouncing off a wall. We extend this
scenario to include adhesion of the ball, which to our knowledge, cannot be
simulated with any other FSI model. While we have restricted simulations to
fluid-structure interaction, the model is capable to simulate any combination
of viscous fluids, visco-elastic fluids and elastic solids.
| physics.comp-ph physics.flu-dyn | in this paper we develop a novel phasefield model for fluidstructure interaction fsi that is capable to handle very large deformations as well as topology changes like contact of the solid to the domain boundary the model is based on a fully eulerian description of the velocity field in both the fluid and the elastic domain viscous and elastic stresses in the navierstokes equations are restricted to the corresponding domains by multiplication with their characteristic functions to obtain the elastic stress an additional oldroydb like equation is solved thermodynamically consistent forces are derived by energy variation the convergence of the derived equations to the traditional sharp interface formulation of fluidstructure interaction is shown by matched asymptotic analysis the model is evaluated in a challenging benchmark scenario of an elastic body traversing a fluid channel a comparison to reference values from arbitrary lagrangian eulerian ale simulations shows very good agreement we highlight some distinct advantages of the new model like the avoidance of retriangulations and the stable inclusion of surface tension further we demonstrate how simple it is to include contact dynamics into the model by simulating a ball bouncing off a wall we extend this scenario to include adhesion of the ball which to our knowledge cannot be simulated with any other fsi model while we have restricted simulations to fluidstructure interaction the model is capable to simulate any combination of viscous fluids viscoelastic fluids and elastic solids | [['in', 'this', 'paper', 'we', 'develop', 'a', 'novel', 'phasefield', 'model', 'for', 'fluidstructure', 'interaction', 'fsi', 'that', 'is', 'capable', 'to', 'handle', 'very', 'large', 'deformations', 'as', 'well', 'as', 'topology', 'changes', 'like', 'contact', 'of', 'the', 'solid', 'to', 'the', 'domain', 'boundary', 'the', 'model', 'is', 'based', 'on', 'a', 'fully', 'eulerian', 'description', 'of', 'the', 'velocity', 'field', 'in', 'both', 'the', 'fluid', 'and', 'the', 'elastic', 'domain', 'viscous', 'and', 'elastic', 'stresses', 'in', 'the', 'navierstokes', 'equations', 'are', 'restricted', 'to', 'the', 'corresponding', 'domains', 'by', 'multiplication', 'with', 'their', 'characteristic', 'functions', 'to', 'obtain', 'the', 'elastic', 'stress', 'an', 'additional', 'oldroydb', 'like', 'equation', 'is', 'solved', 'thermodynamically', 'consistent', 'forces', 'are', 'derived', 'by', 'energy', 'variation', 'the', 'convergence', 'of', 'the', 'derived', 'equations', 'to', 'the', 'traditional', 'sharp', 'interface', 'formulation', 'of', 'fluidstructure', 'interaction', 'is', 'shown', 'by', 'matched', 'asymptotic', 'analysis', 'the', 'model', 'is', 'evaluated', 'in', 'a', 'challenging', 'benchmark', 'scenario', 'of', 'an', 'elastic', 'body', 'traversing', 'a', 'fluid', 'channel', 'a', 'comparison', 'to', 'reference', 'values', 'from', 'arbitrary', 'lagrangian', 'eulerian', 'ale', 'simulations', 'shows', 'very', 'good', 'agreement', 'we', 'highlight', 'some', 'distinct', 'advantages', 'of', 'the', 'new', 'model', 'like', 'the', 'avoidance', 'of', 'retriangulations', 'and', 'the', 'stable', 'inclusion', 'of', 'surface', 'tension', 'further', 'we', 'demonstrate', 'how', 'simple', 'it', 'is', 'to', 'include', 'contact', 'dynamics', 'into', 'the', 'model', 'by', 'simulating', 'a', 'ball', 'bouncing', 'off', 'a', 'wall', 'we', 'extend', 'this', 'scenario', 'to', 'include', 'adhesion', 'of', 'the', 'ball', 'which', 'to', 'our', 'knowledge', 'can', 'not', 'be', 'simulated', 'with', 'any', 'other', 'fsi', 'model', 'while', 'we', 'have', 'restricted', 'simulations', 'to', 'fluidstructure', 'interaction', 'the', 'model', 'is', 'capable', 'to', 'simulate', 'any', 'combination', 'of', 'viscous', 'fluids', 'viscoelastic', 'fluids', 'and', 'elastic', 'solids']] | [-0.12383797975573023, 0.08916510384348358, -0.11296232526108403, 0.039179071383413804, -0.08902775145237561, -0.14237073215165863, -0.04494697500573972, 0.34445869991508854, -0.2929019244219482, -0.29027886550967436, 0.06102222429017121, -0.2556011373305692, -0.14281887546310812, 0.1605482293017005, -0.0476637976048436, 0.08111073120313494, 0.0887348449538548, -0.01137267383394622, -0.03240363479654516, -0.15969643561255595, 0.30712050117920114, 0.025374803752755793, 0.25603609068021804, 0.07290489086294312, 0.10783132905641399, 0.003815269365245398, 0.006712976114300056, 0.08439126837619056, -0.1762235790430023, 0.08502552902868077, 0.22195116564814402, 0.005496075254583246, 0.21607849418729574, -0.48887439949453626, -0.27529694160794793, 0.05964266390837103, 0.12596988558726183, 0.13406292633241543, -0.02396447552483482, -0.2623094430490702, 0.0682803030451564, -0.17523740725826567, -0.14613117710217646, -0.10125263909879728, 0.004106719746790482, 0.045062961531538874, -0.2643849494976594, 0.09615105041816338, 0.051983557751562694, 0.02250807101353064, -0.1357445810851054, -0.07671207811648198, -0.014371578835005708, 0.08175426078436308, 0.06058655655551545, 0.042086500428448734, 0.13160392510149033, -0.16692474500193974, -0.036949199937409215, 0.4440506718027554, -0.050867249171773925, -0.2846942436607445, 0.2414334536319258, -0.0857538968352053, -0.032975842832869404, 0.15406104254667422, 0.20261059305826282, 0.10911576349499534, -0.16487212257631936, 0.07421897483711765, -0.04476518264654711, 0.14441084369533783, 0.04293132310600153, -0.10021076481451233, 0.15715572687634854, 0.21744235188254163, 0.0195198144417397, 0.14843828319508323, -0.05839383721504724, -0.14205152553529674, -0.3342927915764143, -0.13205979081622066, -0.16849773439105226, -0.001794615359778786, -0.11212610093531386, -0.18738935913089877, 0.33650293138989507, 0.1267521385526081, 0.1780418923795771, 0.05829369409465693, 0.3146084220923421, 0.055240407701045616, 0.05249710109558332, 0.06838845102186902, 0.2739201028066533, 0.13623861893972367, 0.09912805732372883, -0.240393593735179, 0.04970483261868827, 0.07447437927353845] |
1,803.02355 | Cosmological bounds on the field content of asymptotically safe
gravity-matter models | We use the non-Gaussian fixed points (NGFPs) appearing in the renormalization
group flow of gravity and gravity-matter systems to construct models of
NGFP-driven inflation via a renormalization group improvement scheme. The
cosmological predictions of these models depend sensitively on the
characteristic properties of the NGFPs, including their position and stability
coefficients, which in turn are determined by the field content of the
underlying matter sector. We demonstrate that the NGFPs appearing in
gravity-matter systems where the matter content is close to the one of the
standard model of particle physics are the ones compatible with cosmological
data. Somewhat counterintuitively, the negative fixed point value of the
dimensionless cosmological constant is essential for these findings.
| gr-qc hep-th | we use the nongaussian fixed points ngfps appearing in the renormalization group flow of gravity and gravitymatter systems to construct models of ngfpdriven inflation via a renormalization group improvement scheme the cosmological predictions of these models depend sensitively on the characteristic properties of the ngfps including their position and stability coefficients which in turn are determined by the field content of the underlying matter sector we demonstrate that the ngfps appearing in gravitymatter systems where the matter content is close to the one of the standard model of particle physics are the ones compatible with cosmological data somewhat counterintuitively the negative fixed point value of the dimensionless cosmological constant is essential for these findings | [['we', 'use', 'the', 'nongaussian', 'fixed', 'points', 'ngfps', 'appearing', 'in', 'the', 'renormalization', 'group', 'flow', 'of', 'gravity', 'and', 'gravitymatter', 'systems', 'to', 'construct', 'models', 'of', 'ngfpdriven', 'inflation', 'via', 'a', 'renormalization', 'group', 'improvement', 'scheme', 'the', 'cosmological', 'predictions', 'of', 'these', 'models', 'depend', 'sensitively', 'on', 'the', 'characteristic', 'properties', 'of', 'the', 'ngfps', 'including', 'their', 'position', 'and', 'stability', 'coefficients', 'which', 'in', 'turn', 'are', 'determined', 'by', 'the', 'field', 'content', 'of', 'the', 'underlying', 'matter', 'sector', 'we', 'demonstrate', 'that', 'the', 'ngfps', 'appearing', 'in', 'gravitymatter', 'systems', 'where', 'the', 'matter', 'content', 'is', 'close', 'to', 'the', 'one', 'of', 'the', 'standard', 'model', 'of', 'particle', 'physics', 'are', 'the', 'ones', 'compatible', 'with', 'cosmological', 'data', 'somewhat', 'counterintuitively', 'the', 'negative', 'fixed', 'point', 'value', 'of', 'the', 'dimensionless', 'cosmological', 'constant', 'is', 'essential', 'for', 'these', 'findings']] | [-0.16094763228356573, 0.1350161539126946, -0.11915926186911828, 0.053655940027643755, -0.07662204667035721, -0.1414950941194805, 0.004272074748728985, 0.302576359724049, -0.24387951576010844, -0.30770352931149236, 0.09386714806767857, -0.2695626128996533, -0.12025699719572358, 0.1819529496493906, -0.009944136666579057, 0.04080471495347741, -0.008142796880771628, 0.05946964752835642, -0.08002568033227153, -0.2623805260024058, 0.4057436931004698, 0.0616707013903466, 0.25277833802114547, 0.009681914224231664, 0.08377998620292287, -0.03919042998242843, -0.0640182315198853, 0.008276786745847326, -0.16580804376364572, 0.09493513539458205, 0.18156272150552677, 0.05612763013295104, 0.1932461595892148, -0.3795361417238559, -0.23539752838824077, 0.11017873018683322, 0.1084161422182435, 0.13033256538735652, -0.05257935112906801, -0.26346612509043343, 0.06680285540281639, -0.14840799284711545, -0.14125089568654653, -0.06524137974164523, -0.02955160401988181, 0.012690073609108978, -0.23761110655567816, 0.12079828251070812, -0.01408444802004811, 0.015545494458844176, -0.050868904900086005, -0.10818958303075185, -0.03678406520326317, 0.11173439555414087, 0.10469045451187026, -0.01235788186550536, 0.18709642057249373, -0.20910163168523427, -0.07367354122905341, 0.44683646944771827, -0.10988100353562463, -0.20002283025762185, 0.17521472507263575, -0.1513710480638722, -0.13940575057475835, 0.08067559592211537, 0.14306975016370416, 0.099470765902702, -0.08904935105547176, 0.14935018857261084, -0.035623671346863284, 0.157512396183823, 0.01410844537174016, 0.04382800441482557, 0.2512044629032633, 0.10965271920493219, 0.034877589550405014, 0.032514510841100616, -0.02087537912998052, -0.14961125285455348, -0.3516178831326223, -0.11193965488335991, -0.1428507400874411, 0.018894526118462065, -0.16250296442669537, -0.17131752005584572, 0.39872584891601737, 0.1775390267025976, 0.21164689575367301, 0.02674878887786835, 0.22696230751750743, 0.12115084632934459, 0.04806432481525482, 0.05416503655971481, 0.27154352459891706, 0.12631929149249552, 0.07327122597098021, -0.2499404439900433, 0.019182340588123924, 0.07098282405908789] |
1,803.02356 | Complexity Functionals and Complexity Growth Limits in Continuous MERA
Circuits | Using the path integral associated to a cMERA tensor network, we provide an
operational definition for the complexity of a cMERA circuit/state which is
relevant to investigate the complexity of states in quantum field theory. In
this framework, it is possible to explicitly establish the correspondence
(Minimal) Complexity $=$ (Least) Action. Remarkably, it is also shown how the
cMERA complexity action functional can be seen as the action of a Liouville
field theory, thus establishing a connection with two dimensional quantum
gravity. Concretely, the Liouville mode is identified with the variational
parameter defining the cMERA circuit. The rate of complexity growth along the
cMERA renormalization group flow is obtained and shown to saturate limits which
are in close resemblance to the fundamental bounds to the speed of evolution in
unitary quantum dynamics, known as quantum speed limits. We also show that the
complexity of a cMERA circuit measured through these complexity functionals,
can be cast in terms of the variationally-optimized amount of left-right
entanglement created along the cMERA renormalization flow. Our results suggest
that the patterns of entanglement in states of a QFT could determine their dual
gravitational descriptions through a principle of least complexity.
| hep-th cond-mat.str-el quant-ph | using the path integral associated to a cmera tensor network we provide an operational definition for the complexity of a cmera circuitstate which is relevant to investigate the complexity of states in quantum field theory in this framework it is possible to explicitly establish the correspondence minimal complexity least action remarkably it is also shown how the cmera complexity action functional can be seen as the action of a liouville field theory thus establishing a connection with two dimensional quantum gravity concretely the liouville mode is identified with the variational parameter defining the cmera circuit the rate of complexity growth along the cmera renormalization group flow is obtained and shown to saturate limits which are in close resemblance to the fundamental bounds to the speed of evolution in unitary quantum dynamics known as quantum speed limits we also show that the complexity of a cmera circuit measured through these complexity functionals can be cast in terms of the variationallyoptimized amount of leftright entanglement created along the cmera renormalization flow our results suggest that the patterns of entanglement in states of a qft could determine their dual gravitational descriptions through a principle of least complexity | [['using', 'the', 'path', 'integral', 'associated', 'to', 'a', 'cmera', 'tensor', 'network', 'we', 'provide', 'an', 'operational', 'definition', 'for', 'the', 'complexity', 'of', 'a', 'cmera', 'circuitstate', 'which', 'is', 'relevant', 'to', 'investigate', 'the', 'complexity', 'of', 'states', 'in', 'quantum', 'field', 'theory', 'in', 'this', 'framework', 'it', 'is', 'possible', 'to', 'explicitly', 'establish', 'the', 'correspondence', 'minimal', 'complexity', 'least', 'action', 'remarkably', 'it', 'is', 'also', 'shown', 'how', 'the', 'cmera', 'complexity', 'action', 'functional', 'can', 'be', 'seen', 'as', 'the', 'action', 'of', 'a', 'liouville', 'field', 'theory', 'thus', 'establishing', 'a', 'connection', 'with', 'two', 'dimensional', 'quantum', 'gravity', 'concretely', 'the', 'liouville', 'mode', 'is', 'identified', 'with', 'the', 'variational', 'parameter', 'defining', 'the', 'cmera', 'circuit', 'the', 'rate', 'of', 'complexity', 'growth', 'along', 'the', 'cmera', 'renormalization', 'group', 'flow', 'is', 'obtained', 'and', 'shown', 'to', 'saturate', 'limits', 'which', 'are', 'in', 'close', 'resemblance', 'to', 'the', 'fundamental', 'bounds', 'to', 'the', 'speed', 'of', 'evolution', 'in', 'unitary', 'quantum', 'dynamics', 'known', 'as', 'quantum', 'speed', 'limits', 'we', 'also', 'show', 'that', 'the', 'complexity', 'of', 'a', 'cmera', 'circuit', 'measured', 'through', 'these', 'complexity', 'functionals', 'can', 'be', 'cast', 'in', 'terms', 'of', 'the', 'variationallyoptimized', 'amount', 'of', 'leftright', 'entanglement', 'created', 'along', 'the', 'cmera', 'renormalization', 'flow', 'our', 'results', 'suggest', 'that', 'the', 'patterns', 'of', 'entanglement', 'in', 'states', 'of', 'a', 'qft', 'could', 'determine', 'their', 'dual', 'gravitational', 'descriptions', 'through', 'a', 'principle', 'of', 'least', 'complexity']] | [-0.14603180333445998, 0.14098764599460464, -0.1306969095600547, 0.07778318739288674, -0.044959978491231956, -0.11884637315241244, 0.030777779915683704, 0.3119587644722332, -0.28737214694542745, -0.26705862865469615, 0.0843510715896505, -0.22368941500715409, -0.193335145436845, 0.19164857240828054, -0.07392945870699197, 0.0855989155137593, 0.024512950087887828, 0.10090355873436647, -0.09575658767162026, -0.24596337977931906, 0.2886472488777625, 0.0616665291310399, 0.29959552737020456, 0.06510294351058438, 0.10181126323494809, -0.04406862528789596, 0.014312500439323679, 0.0697975306032187, -0.13436238476416937, 0.12750662963986975, 0.2638872355003142, 0.14001665600947072, 0.2251180094990088, -0.4374820947975229, -0.24592292823688816, 0.06730741548648712, 0.12942156464421223, 0.14169229898563165, -0.020976797040609806, -0.2901695102472534, 0.03652073889144412, -0.17061873738065247, -0.13411181666188599, -0.08535014353982062, -0.005942895932489803, -0.07424498315498841, -0.21504069974771436, 0.05026371339836684, 0.004089188392857968, 0.018921085771467595, -0.016934972225056258, -0.009516514676087415, -0.028925448447982227, 0.12035392335895931, 0.04594417368640901, 0.052987437487768074, 0.11317908286642997, -0.16524753491642283, -0.15522989373288595, 0.3575469057456894, -0.08198193605226788, -0.2151127488646714, 0.18122233139529553, -0.12519423141013927, -0.14052982386346385, 0.09194859041026528, 0.12507902664841766, 0.08892513788908411, -0.12858873680523486, 0.1450730777400488, -0.042208537643949065, 0.15756417450527033, 0.03856288016546962, 0.098346560599929, 0.1568565580249632, 0.1107106866945942, 0.07352416413001368, 0.1938610666086463, -0.01251996590979738, -0.1576895382091852, -0.34800825879783637, -0.20851781862483895, -0.18577949051824252, 0.0917594413794191, -0.1224811612181287, -0.15986155295398308, 0.3883326286884324, 0.13957906750463905, 0.1836694654181643, 0.1003561124598868, 0.23102775249398588, 0.17116116928515734, 0.0797236504725668, 0.09529015196274986, 0.24372597703941823, 0.19288163899970023, 0.019384568414790797, -0.28706600629589446, 0.00864644135092747, 0.13816715196412] |
1,803.02357 | Revolutionizing Our Understanding of AGN Feedback and its Importance to
Galaxy Evolution in the Era of the Next Generation Very Large Array | Energetic feedback by Active Galactic Nuclei (AGNs) plays an important
evolutionary role in the regulation of star formation (SF) on galactic scales.
However, the effects of this feedback as a function of redshift and galaxy
properties such as mass, environment and cold gas content remain poorly
understood. The broad frequency coverage (1 to 116 GHz), high sensitivity (up
to ten times higher than the Karl G. Jansky Very Large Array), and superb
angular resolution (maximum baselines of at least a few hundred km) of the
proposed next generation Very Large Array (ngVLA) are uniquely poised to
revolutionize our understanding of AGNs and their role in galaxy evolution.
Here, we provide an overview of the science related to AGN feedback that will
be possible in the ngVLA era and present new continuum ngVLA imaging
simulations of resolved radio jets spanning a wide range of intrinsic extents.
We also consider key computational challenges and discuss exciting
opportunities for multi-wavelength synergy with other next-generation
instruments, such as the Square Kilometer Array and the James Webb Space
Telescope. The unique combination of high-resolution, large collecting area,
and wide frequency range will enable significant advancements in our
understanding of the effects of jet-driven feedback on sub-galactic scales,
particularly for sources with extents of a few pc to a few kpc such as young
and/or lower-power radio AGNs, AGNs hosted by low-mass galaxies, radio jets
that are interacting strongly with the interstellar medium of the host galaxy,
and AGNs at high redshift.
| astro-ph.GA | energetic feedback by active galactic nuclei agns plays an important evolutionary role in the regulation of star formation sf on galactic scales however the effects of this feedback as a function of redshift and galaxy properties such as mass environment and cold gas content remain poorly understood the broad frequency coverage 1 to 116 ghz high sensitivity up to ten times higher than the karl g jansky very large array and superb angular resolution maximum baselines of at least a few hundred km of the proposed next generation very large array ngvla are uniquely poised to revolutionize our understanding of agns and their role in galaxy evolution here we provide an overview of the science related to agn feedback that will be possible in the ngvla era and present new continuum ngvla imaging simulations of resolved radio jets spanning a wide range of intrinsic extents we also consider key computational challenges and discuss exciting opportunities for multiwavelength synergy with other nextgeneration instruments such as the square kilometer array and the james webb space telescope the unique combination of highresolution large collecting area and wide frequency range will enable significant advancements in our understanding of the effects of jetdriven feedback on subgalactic scales particularly for sources with extents of a few pc to a few kpc such as young andor lowerpower radio agns agns hosted by lowmass galaxies radio jets that are interacting strongly with the interstellar medium of the host galaxy and agns at high redshift | [['energetic', 'feedback', 'by', 'active', 'galactic', 'nuclei', 'agns', 'plays', 'an', 'important', 'evolutionary', 'role', 'in', 'the', 'regulation', 'of', 'star', 'formation', 'sf', 'on', 'galactic', 'scales', 'however', 'the', 'effects', 'of', 'this', 'feedback', 'as', 'a', 'function', 'of', 'redshift', 'and', 'galaxy', 'properties', 'such', 'as', 'mass', 'environment', 'and', 'cold', 'gas', 'content', 'remain', 'poorly', 'understood', 'the', 'broad', 'frequency', 'coverage', '1', 'to', '116', 'ghz', 'high', 'sensitivity', 'up', 'to', 'ten', 'times', 'higher', 'than', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'and', 'superb', 'angular', 'resolution', 'maximum', 'baselines', 'of', 'at', 'least', 'a', 'few', 'hundred', 'km', 'of', 'the', 'proposed', 'next', 'generation', 'very', 'large', 'array', 'ngvla', 'are', 'uniquely', 'poised', 'to', 'revolutionize', 'our', 'understanding', 'of', 'agns', 'and', 'their', 'role', 'in', 'galaxy', 'evolution', 'here', 'we', 'provide', 'an', 'overview', 'of', 'the', 'science', 'related', 'to', 'agn', 'feedback', 'that', 'will', 'be', 'possible', 'in', 'the', 'ngvla', 'era', 'and', 'present', 'new', 'continuum', 'ngvla', 'imaging', 'simulations', 'of', 'resolved', 'radio', 'jets', 'spanning', 'a', 'wide', 'range', 'of', 'intrinsic', 'extents', 'we', 'also', 'consider', 'key', 'computational', 'challenges', 'and', 'discuss', 'exciting', 'opportunities', 'for', 'multiwavelength', 'synergy', 'with', 'other', 'nextgeneration', 'instruments', 'such', 'as', 'the', 'square', 'kilometer', 'array', 'and', 'the', 'james', 'webb', 'space', 'telescope', 'the', 'unique', 'combination', 'of', 'highresolution', 'large', 'collecting', 'area', 'and', 'wide', 'frequency', 'range', 'will', 'enable', 'significant', 'advancements', 'in', 'our', 'understanding', 'of', 'the', 'effects', 'of', 'jetdriven', 'feedback', 'on', 'subgalactic', 'scales', 'particularly', 'for', 'sources', 'with', 'extents', 'of', 'a', 'few', 'pc', 'to', 'a', 'few', 'kpc', 'such', 'as', 'young', 'andor', 'lowerpower', 'radio', 'agns', 'agns', 'hosted', 'by', 'lowmass', 'galaxies', 'radio', 'jets', 'that', 'are', 'interacting', 'strongly', 'with', 'the', 'interstellar', 'medium', 'of', 'the', 'host', 'galaxy', 'and', 'agns', 'at', 'high', 'redshift']] | [-0.08431526244006582, 0.14490850591699392, 0.01980135967099388, 0.09434029632730682, -0.14370509895223488, -0.07473758469729465, 0.022145468227724296, 0.450764517186255, -0.19693102483160613, -0.38488516569652453, 0.11748939429242278, -0.2742976690945405, -0.049899623248483835, 0.2311945724044548, 0.010886784576682178, -0.03094834374638683, 0.06571774092707329, -0.1575263993050553, -0.00958323866288401, -0.23402527989289626, 0.2730073274048878, 0.19697844038709877, 0.18568240202408723, 0.02422190072654739, 0.1242574530772437, -0.10022193051087178, -0.10300186064616754, 0.003142854509135988, -0.1146444851626397, 0.06294965370543058, 0.32832087702553236, 0.14957578455067685, 0.2943132657284907, -0.373577941455159, -0.22635883552105568, 0.06561052018106438, 0.18891419599928735, 0.02171025258239086, -0.10177275392783397, -0.26449101150028287, 0.044017029465251885, -0.218871778924003, -0.18537186435423791, 0.03070614636095801, 0.045990756334267496, 0.07771372049730446, -0.17766201561832673, 0.08169443998947205, -0.03196889227748341, 0.08980413191898336, -0.05356033033373334, -0.11007759152775312, 0.022999667874404904, 0.1299559269767686, -0.028864311897176947, 0.10476560839092193, 0.17594489082670392, -0.19960256911896082, -0.06504104113228983, 0.4124798843678753, -0.03161407566783861, 0.011558268919617422, 0.26929720933359813, -0.24880830943963028, -0.2174240466873578, 0.12904276151202498, 0.24240903523220583, 0.10907825413235743, -0.11789231119030041, 0.006408716760891891, -0.0007395088110437117, 0.22967003917366993, 0.00822847550053422, 0.16775905012220052, 0.3513829238368274, 0.20398013657848615, 0.10097909423643799, 0.08591894903840172, -0.20385164616069174, -0.010897012931205772, -0.24144022975436874, -0.06364630473913943, -0.1454270689292031, 0.13688857460439932, -0.14236763594580987, -0.08037142438801739, 0.3586961303300951, 0.11165396766017789, 0.18349661134804288, 0.038176153984291826, 0.29989820083307966, -0.005591695585924133, 0.12987252275697977, 0.06757030941402101, 0.30500819688148006, 0.1513112390923079, 0.10962878090019028, -0.20964252380692075, -0.001354193161582438, -0.041300171469451814] |
1,803.02358 | The 4:1 Outer Lindblad Resonance of a long slow bar as a potential
explanation for the Hercules stream | There are multiple groups of comoving stars in the Solar neighbourhood, which
can potentially be explained as the signatures of one of the fundamental
resonances of non-axisymmetric structure such as the Galactic bar or spiral
arms. One such stream, Hercules, has been proposed to result from the outer
Lindblad resonance (OLR) of a short fast rotating bar as shown analytically, or
the corotation resonance (CR) of a longer slower rotating bar as observed in an
N-body model. We show that by including an m = 4 Fourier component in an
analytical long bar model, with an amplitude that is typical for bars in N-body
simulations, we can reproduce a Hercules like feature in the kinematics of the
Solar neighbourhood. We then describe the expected symmetry in the velocity
distribution arising from such a model, which we will soon be able to test with
Gaia.
| astro-ph.GA | there are multiple groups of comoving stars in the solar neighbourhood which can potentially be explained as the signatures of one of the fundamental resonances of nonaxisymmetric structure such as the galactic bar or spiral arms one such stream hercules has been proposed to result from the outer lindblad resonance olr of a short fast rotating bar as shown analytically or the corotation resonance cr of a longer slower rotating bar as observed in an nbody model we show that by including an m 4 fourier component in an analytical long bar model with an amplitude that is typical for bars in nbody simulations we can reproduce a hercules like feature in the kinematics of the solar neighbourhood we then describe the expected symmetry in the velocity distribution arising from such a model which we will soon be able to test with gaia | [['there', 'are', 'multiple', 'groups', 'of', 'comoving', 'stars', 'in', 'the', 'solar', 'neighbourhood', 'which', 'can', 'potentially', 'be', 'explained', 'as', 'the', 'signatures', 'of', 'one', 'of', 'the', 'fundamental', 'resonances', 'of', 'nonaxisymmetric', 'structure', 'such', 'as', 'the', 'galactic', 'bar', 'or', 'spiral', 'arms', 'one', 'such', 'stream', 'hercules', 'has', 'been', 'proposed', 'to', 'result', 'from', 'the', 'outer', 'lindblad', 'resonance', 'olr', 'of', 'a', 'short', 'fast', 'rotating', 'bar', 'as', 'shown', 'analytically', 'or', 'the', 'corotation', 'resonance', 'cr', 'of', 'a', 'longer', 'slower', 'rotating', 'bar', 'as', 'observed', 'in', 'an', 'nbody', 'model', 'we', 'show', 'that', 'by', 'including', 'an', 'm', '4', 'fourier', 'component', 'in', 'an', 'analytical', 'long', 'bar', 'model', 'with', 'an', 'amplitude', 'that', 'is', 'typical', 'for', 'bars', 'in', 'nbody', 'simulations', 'we', 'can', 'reproduce', 'a', 'hercules', 'like', 'feature', 'in', 'the', 'kinematics', 'of', 'the', 'solar', 'neighbourhood', 'we', 'then', 'describe', 'the', 'expected', 'symmetry', 'in', 'the', 'velocity', 'distribution', 'arising', 'from', 'such', 'a', 'model', 'which', 'we', 'will', 'soon', 'be', 'able', 'to', 'test', 'with', 'gaia']] | [-0.10914224171213206, 0.0941486727789051, -0.11286670522327971, 0.08229043848333893, -0.06890825552774685, -0.05529918450653761, -0.04611207324998466, 0.3628908920629354, -0.2851338723179448, -0.3084520091647868, 0.04613301758589288, -0.2510777756049122, -0.12363420029552824, 0.21148955455811863, -0.019451357254927807, 0.025615758487264384, 0.0478311443426223, 0.046271383400902255, -0.029396420256788288, -0.17288083765066353, 0.2740423954515295, 0.051032356930883614, 0.09920089670303896, -0.0647793339624011, 0.025283983179166185, -0.07619723036129783, 0.004408345307008578, 0.002714408926301069, -0.13050394731305517, 0.003920771806806951, 0.22076311055896478, 0.13039713116994428, 0.21745662787511752, -0.4550809942159828, -0.19180861169185776, 0.05213764883330339, 0.25323459941411874, 0.11506784371687734, -0.08155333391761968, -0.28886494133621454, 0.11585067146151633, -0.19453745699236327, -0.2069242778331875, 0.0021488124283252064, 0.061370874364319795, 0.03473231168561517, -0.2761314677817819, 0.0891100268850064, 0.09328778867342777, 0.0722696617428031, -0.0665139897296635, -0.09004034653032879, -0.04337508186463501, 0.0958160656688318, 0.061342193443124415, 0.09121369834259882, 0.16488760759340845, -0.11301863935964925, -0.07134062871076427, 0.4107006640577285, -0.1315386077206764, -0.14083652912762823, 0.21940966388145527, -0.213876829814765, -0.11079924614526905, 0.09127455256175954, 0.17942576447071937, 0.08485152763379672, -0.12843581544393282, 0.04190559197425634, -0.08340072541308778, 0.1610550785346048, 0.08050267633630315, 0.010074721082680291, 0.2773288190600925, 0.14404194361458605, 0.05810850281659123, 0.07286808970937883, -0.2042988233522258, -0.06288702915246774, -0.2790356436487893, -0.11526446958183201, -0.12027203425003047, 0.04808118397702131, -0.073860649703318, -0.15166418350987965, 0.3725382608029392, 0.09357461630256025, 0.25822690096716366, -0.006394282359486589, 0.3117747552940375, 0.09164973792222726, 0.14767590230265698, 0.1336687451042886, 0.29408559215522107, 0.13277327791800708, 0.030709855137979025, -0.24878482436891514, 0.0514374366388298, -0.01424591654872561] |
1,803.02359 | Dynamical structure factor of the $J_1-J_2$ Heisenberg model in one
dimension: the variational Monte Carlo approach | The dynamical spin structure factor is computed within a variational
framework to study the one-dimensional $J_1-J_2$ Heisenberg model. Starting
from Gutzwiller-projected fermionic wave functions, the low-energy spectrum is
constructed from two-spinon excitations. The direct comparison with Lanczos
calculations on small clusters demonstrates the excellent description of both
gapless and gapped (dimerized) phases, also including incommensurate structures
for $J_2/J_1>0.5$. Calculations on large clusters show how the intensity
evolves when increasing the frustrating ratio and give an unprecedented
accurate characterization of the dynamical properties of (non-integrable)
frustrated spin models.
| cond-mat.str-el | the dynamical spin structure factor is computed within a variational framework to study the onedimensional j_1j_2 heisenberg model starting from gutzwillerprojected fermionic wave functions the lowenergy spectrum is constructed from twospinon excitations the direct comparison with lanczos calculations on small clusters demonstrates the excellent description of both gapless and gapped dimerized phases also including incommensurate structures for j_2j_105 calculations on large clusters show how the intensity evolves when increasing the frustrating ratio and give an unprecedented accurate characterization of the dynamical properties of nonintegrable frustrated spin models | [['the', 'dynamical', 'spin', 'structure', 'factor', 'is', 'computed', 'within', 'a', 'variational', 'framework', 'to', 'study', 'the', 'onedimensional', 'j_1j_2', 'heisenberg', 'model', 'starting', 'from', 'gutzwillerprojected', 'fermionic', 'wave', 'functions', 'the', 'lowenergy', 'spectrum', 'is', 'constructed', 'from', 'twospinon', 'excitations', 'the', 'direct', 'comparison', 'with', 'lanczos', 'calculations', 'on', 'small', 'clusters', 'demonstrates', 'the', 'excellent', 'description', 'of', 'both', 'gapless', 'and', 'gapped', 'dimerized', 'phases', 'also', 'including', 'incommensurate', 'structures', 'for', 'j_2j_105', 'calculations', 'on', 'large', 'clusters', 'show', 'how', 'the', 'intensity', 'evolves', 'when', 'increasing', 'the', 'frustrating', 'ratio', 'and', 'give', 'an', 'unprecedented', 'accurate', 'characterization', 'of', 'the', 'dynamical', 'properties', 'of', 'nonintegrable', 'frustrated', 'spin', 'models']] | [-0.15627667266104756, 0.20011080809666149, -0.04723944665393096, 0.10140450943486187, -0.022848250895695782, -0.1301457675029363, 0.02073039744456095, 0.3725204599657278, -0.24048949882452345, -0.24598980784930033, 0.015886975818945246, -0.3384948721176934, -0.12217753418004033, 0.15821004783381418, 0.14732923300604966, 0.011446334335995817, 0.059038830514269315, -0.019999169503691894, -0.17529942154691652, -0.17675454339585214, 0.2565680116350795, 0.04708023191611657, 0.2972011532977052, 0.04355532353497699, 0.042205808325617135, 0.0783298934854021, 0.0894735579903441, -0.02165261865693851, -0.2172961195598988, 0.06369012065536889, 0.2383366128041803, -0.06645207814658168, 0.12542977991471088, -0.4208669262542122, -0.2160944202004921, 0.002010716558915788, 0.17748862181940042, 0.17104484348547186, -0.017652749932296145, -0.3361244244693682, 0.00697150239426557, -0.21451841209126615, -0.18012215312698793, -0.1756407238286117, -0.04789769129784799, 0.0019941819060979218, -0.22624509179250113, 0.14749644868826525, 0.03489612492173375, 0.08577684153941187, -0.12494353515607166, -0.13024910112800098, -0.08041887644319741, 0.08229092882053617, 0.004044799039129639, 0.052865871776901614, 0.09226525461451075, -0.13086497444316916, -0.12948429519738788, 0.3750334868271803, -0.0613972332754076, -0.13644635870560318, 0.18653156681671396, -0.14983437511947503, -0.15544797452273726, 0.16306861068775086, 0.10890777283093903, 0.05857104949396232, -0.1055214563801138, 0.1186196850706427, -0.04053944822426901, 0.21973787258806018, -0.057895334124372436, 0.06743515813027391, 0.26611735187899105, 0.20699844676091325, 0.03808633387744448, 0.16733301909447745, -0.07009735798741552, -0.17411124028115607, -0.21461249866533552, -0.0901425513290016, -0.24499875841121693, 0.07304112524401006, -0.12789789568860319, -0.2193648742790195, 0.4187886891993641, 0.11879447863528227, 0.17170155005350216, 0.013257612677655, 0.2335696415065777, 0.10734563743717027, 0.01947779519933051, 0.039948445081111346, 0.20700291783653263, 0.20142831009994636, 0.012263195222543403, -0.27576348809431706, -0.019871640629295646, 0.06600331397822137] |
1,803.0236 | Gaussian optimizers for entropic inequalities in quantum information | We survey the state of the art for the proof of the quantum Gaussian
optimizer conjectures of quantum information theory. These fundamental
conjectures state that quantum Gaussian input states are the solution to
several optimization problems involving quantum Gaussian channels. These
problems are the quantum counterpart of three fundamental results of functional
analysis and probability: the Entropy Power Inequality, the sharp Young's
inequality for convolutions, and the theorem "Gaussian kernels have only
Gaussian maximizers." Quantum Gaussian channels play a key role in quantum
communication theory: they are the quantum counterpart of Gaussian integral
kernels and provide the mathematical model for the propagation of
electromagnetic waves in the quantum regime. The quantum Gaussian optimizer
conjectures are needed to determine the maximum communication rates over
optical fibers and free space. The restriction of the quantum-limited Gaussian
attenuator to input states diagonal in the Fock basis coincides with the
thinning, which is the analog of the rescaling for positive integer random
variables. Quantum Gaussian channels provide then a bridge between functional
analysis and discrete probability.
| math-ph cs.IT math.FA math.IT math.MP math.PR quant-ph | we survey the state of the art for the proof of the quantum gaussian optimizer conjectures of quantum information theory these fundamental conjectures state that quantum gaussian input states are the solution to several optimization problems involving quantum gaussian channels these problems are the quantum counterpart of three fundamental results of functional analysis and probability the entropy power inequality the sharp youngs inequality for convolutions and the theorem gaussian kernels have only gaussian maximizers quantum gaussian channels play a key role in quantum communication theory they are the quantum counterpart of gaussian integral kernels and provide the mathematical model for the propagation of electromagnetic waves in the quantum regime the quantum gaussian optimizer conjectures are needed to determine the maximum communication rates over optical fibers and free space the restriction of the quantumlimited gaussian attenuator to input states diagonal in the fock basis coincides with the thinning which is the analog of the rescaling for positive integer random variables quantum gaussian channels provide then a bridge between functional analysis and discrete probability | [['we', 'survey', 'the', 'state', 'of', 'the', 'art', 'for', 'the', 'proof', 'of', 'the', 'quantum', 'gaussian', 'optimizer', 'conjectures', 'of', 'quantum', 'information', 'theory', 'these', 'fundamental', 'conjectures', 'state', 'that', 'quantum', 'gaussian', 'input', 'states', 'are', 'the', 'solution', 'to', 'several', 'optimization', 'problems', 'involving', 'quantum', 'gaussian', 'channels', 'these', 'problems', 'are', 'the', 'quantum', 'counterpart', 'of', 'three', 'fundamental', 'results', 'of', 'functional', 'analysis', 'and', 'probability', 'the', 'entropy', 'power', 'inequality', 'the', 'sharp', 'youngs', 'inequality', 'for', 'convolutions', 'and', 'the', 'theorem', 'gaussian', 'kernels', 'have', 'only', 'gaussian', 'maximizers', 'quantum', 'gaussian', 'channels', 'play', 'a', 'key', 'role', 'in', 'quantum', 'communication', 'theory', 'they', 'are', 'the', 'quantum', 'counterpart', 'of', 'gaussian', 'integral', 'kernels', 'and', 'provide', 'the', 'mathematical', 'model', 'for', 'the', 'propagation', 'of', 'electromagnetic', 'waves', 'in', 'the', 'quantum', 'regime', 'the', 'quantum', 'gaussian', 'optimizer', 'conjectures', 'are', 'needed', 'to', 'determine', 'the', 'maximum', 'communication', 'rates', 'over', 'optical', 'fibers', 'and', 'free', 'space', 'the', 'restriction', 'of', 'the', 'quantumlimited', 'gaussian', 'attenuator', 'to', 'input', 'states', 'diagonal', 'in', 'the', 'fock', 'basis', 'coincides', 'with', 'the', 'thinning', 'which', 'is', 'the', 'analog', 'of', 'the', 'rescaling', 'for', 'positive', 'integer', 'random', 'variables', 'quantum', 'gaussian', 'channels', 'provide', 'then', 'a', 'bridge', 'between', 'functional', 'analysis', 'and', 'discrete', 'probability']] | [-0.11885720293367888, 0.13557864011666024, -0.1165707625833145, 0.08224395482576193, -0.02912374906415163, -0.19518913267461888, 0.050964857500349715, 0.3391190791153349, -0.30536359696930576, -0.2171413543644946, 0.09543512713199287, -0.26903477503625717, -0.17414433612531527, 0.21946518080509375, -0.03527071298273324, 0.18631964260549827, 0.06167625622325685, 0.045095808503859636, -0.053859248900174184, -0.258382409136894, 0.3043732337320635, 0.019518934082656796, 0.29067535244664827, 0.017317294619630937, 0.0876551577496494, 0.04930972831247937, -0.02358086198719955, -0.08497508966954842, -0.14594943749571665, 0.15342856983608177, 0.2756044001015293, 0.11850237247106338, 0.2961117177930942, -0.4229826529207098, -0.2470475618922433, 0.11212597164693613, 0.07407781082504296, 0.10865402056870788, 0.016081163648862477, -0.3078312738893315, 0.050487277755881986, -0.11173023268591266, -0.11754664818236474, -0.07308919468981236, -0.04700632037616573, 0.023148609466071047, -0.2742553222924471, 0.10428561947611702, 0.10155945633224017, 0.02427222884292606, -0.04389593191986341, -0.11918152078612555, 0.06277205279844185, 0.10455596742631737, -0.04124008877091868, -0.001261567353774512, 0.1388805433837047, -0.17630439941489764, -0.19151596148054353, 0.30057526885012037, -0.042533071842965085, -0.22883758702596954, 0.12455373310462334, -0.09938618159622122, -0.10277471366490043, 0.09302500480864478, 0.15225026844919465, 0.05082858391755889, -0.10175299930703004, 0.12447021553004539, -0.05582220028262845, 0.12562847051628714, 0.09620618509930061, 0.14346470447192186, 0.16375923176907914, 0.03656342371399406, 0.08887168577043773, 0.16350101770123812, -0.08970593279911215, -0.23232391399201438, -0.3709725882197449, -0.21607987372323784, -0.2344301800882487, 0.08528992286385823, -0.14170758550608298, -0.1904051248146611, 0.35685573324160436, 0.0748905370818711, 0.1207822864742538, 0.08188988128203227, 0.27592391165536506, 0.1700904400380285, 0.0009770427402758667, 0.08422911181764374, 0.18853306543450196, 0.284599089514475, 0.05370161826059027, -0.16769955509483034, 0.02523297966771954, 0.05968176150172651] |
1,803.02361 | Galaxy clusters in simulations of the local Universe: a matter of
constraints | To study the full formation and evolution history of galaxy clusters and
their population, high resolution simulations of the latter are flourishing.
However comparing observed clusters to the simulated ones on a one-to-one basis
to refine the models and theories down to the details is non trivial. The large
variety of clusters limits the comparisons between observed and numerical
clusters. Simulations resembling the local Universe down to the cluster scales
permit pushing the limit. Simulated and observed clusters can be matched on a
one-to-one basis for direct comparisons provided that clusters are well
reproduced besides being in the proper large scale environment. Comparing
random and local-Universe like simulations obtained with differently grouped
observational catalogs of peculiar velocities, this paper shows that the
grouping scheme used to remove non-linear motions in the catalogs that
constrain the simulations affects the quality of the numerical clusters. With a
less aggressive grouping scheme - galaxies still falling onto clusters are
preserved - combined with a bias minimization scheme, the mass of the dark
matter halos, simulacra for 5 local clusters - Virgo, Centaurus, Coma, Hydra
and Perseus - is increased by 39% closing the gap with observational mass
estimates. Simulacra are found on average in 89% of the simulations, an
increase of 5% with respect to the previous grouping scheme. The only exception
is Perseus. Since the Perseus-Pisces region is not well covered by the used
peculiar velocity catalog, the latest release let us foresee a better
simulacrum for Perseus in a near future.
| astro-ph.CO | to study the full formation and evolution history of galaxy clusters and their population high resolution simulations of the latter are flourishing however comparing observed clusters to the simulated ones on a onetoone basis to refine the models and theories down to the details is non trivial the large variety of clusters limits the comparisons between observed and numerical clusters simulations resembling the local universe down to the cluster scales permit pushing the limit simulated and observed clusters can be matched on a onetoone basis for direct comparisons provided that clusters are well reproduced besides being in the proper large scale environment comparing random and localuniverse like simulations obtained with differently grouped observational catalogs of peculiar velocities this paper shows that the grouping scheme used to remove nonlinear motions in the catalogs that constrain the simulations affects the quality of the numerical clusters with a less aggressive grouping scheme galaxies still falling onto clusters are preserved combined with a bias minimization scheme the mass of the dark matter halos simulacra for 5 local clusters virgo centaurus coma hydra and perseus is increased by 39 closing the gap with observational mass estimates simulacra are found on average in 89 of the simulations an increase of 5 with respect to the previous grouping scheme the only exception is perseus since the perseuspisces region is not well covered by the used peculiar velocity catalog the latest release let us foresee a better simulacrum for perseus in a near future | [['to', 'study', 'the', 'full', 'formation', 'and', 'evolution', 'history', 'of', 'galaxy', 'clusters', 'and', 'their', 'population', 'high', 'resolution', 'simulations', 'of', 'the', 'latter', 'are', 'flourishing', 'however', 'comparing', 'observed', 'clusters', 'to', 'the', 'simulated', 'ones', 'on', 'a', 'onetoone', 'basis', 'to', 'refine', 'the', 'models', 'and', 'theories', 'down', 'to', 'the', 'details', 'is', 'non', 'trivial', 'the', 'large', 'variety', 'of', 'clusters', 'limits', 'the', 'comparisons', 'between', 'observed', 'and', 'numerical', 'clusters', 'simulations', 'resembling', 'the', 'local', 'universe', 'down', 'to', 'the', 'cluster', 'scales', 'permit', 'pushing', 'the', 'limit', 'simulated', 'and', 'observed', 'clusters', 'can', 'be', 'matched', 'on', 'a', 'onetoone', 'basis', 'for', 'direct', 'comparisons', 'provided', 'that', 'clusters', 'are', 'well', 'reproduced', 'besides', 'being', 'in', 'the', 'proper', 'large', 'scale', 'environment', 'comparing', 'random', 'and', 'localuniverse', 'like', 'simulations', 'obtained', 'with', 'differently', 'grouped', 'observational', 'catalogs', 'of', 'peculiar', 'velocities', 'this', 'paper', 'shows', 'that', 'the', 'grouping', 'scheme', 'used', 'to', 'remove', 'nonlinear', 'motions', 'in', 'the', 'catalogs', 'that', 'constrain', 'the', 'simulations', 'affects', 'the', 'quality', 'of', 'the', 'numerical', 'clusters', 'with', 'a', 'less', 'aggressive', 'grouping', 'scheme', 'galaxies', 'still', 'falling', 'onto', 'clusters', 'are', 'preserved', 'combined', 'with', 'a', 'bias', 'minimization', 'scheme', 'the', 'mass', 'of', 'the', 'dark', 'matter', 'halos', 'simulacra', 'for', '5', 'local', 'clusters', 'virgo', 'centaurus', 'coma', 'hydra', 'and', 'perseus', 'is', 'increased', 'by', '39', 'closing', 'the', 'gap', 'with', 'observational', 'mass', 'estimates', 'simulacra', 'are', 'found', 'on', 'average', 'in', '89', 'of', 'the', 'simulations', 'an', 'increase', 'of', '5', 'with', 'respect', 'to', 'the', 'previous', 'grouping', 'scheme', 'the', 'only', 'exception', 'is', 'perseus', 'since', 'the', 'perseuspisces', 'region', 'is', 'not', 'well', 'covered', 'by', 'the', 'used', 'peculiar', 'velocity', 'catalog', 'the', 'latest', 'release', 'let', 'us', 'foresee', 'a', 'better', 'simulacrum', 'for', 'perseus', 'in', 'a', 'near', 'future']] | [-0.07898993932308887, 0.07490620842186699, -0.08528007708141595, 0.10220291278120584, -0.08662025792793016, -0.04595102021911719, 0.05316133946426425, 0.39954870808429493, -0.20771592769798317, -0.38383761030263114, 0.06359646092329886, -0.2784401539247483, -0.027143937232714844, 0.21205959039384392, -0.008819515857447082, -0.009529241242888951, 0.1011032699626242, -0.031431210200809606, -0.057250662435156606, -0.2836036104065313, 0.26833471954928906, 0.10976174375543, 0.25059481425167296, -0.04552495473526358, 0.061537523469054785, -0.0683584382466033, -0.11047571765971598, 0.05012686889546704, -0.14340156216180397, 0.06777077544541137, 0.19316801531079741, 0.08766447724888056, 0.24327601248216701, -0.3892121931946859, -0.20354140838428317, 0.08093989328519116, 0.20993155798717683, 0.07081227526977295, -0.06266898651062171, -0.31739163890526423, 0.11000337584402764, -0.16733389162473622, -0.17380927895324502, -0.008501577068014236, -0.002967221756575523, 0.058340101898321756, -0.21801283758803747, 0.1521979269081333, -0.028144076147128078, 0.035618824036084434, -0.089080713668505, -0.10301914136871938, -0.05012838338403319, 0.12703250761274476, -0.011782310000143764, 0.06599369092193258, 0.17765687859656926, -0.1316198446831431, -0.06124215187198233, 0.41828747569182056, -0.025730901567182104, -0.08593113047905585, 0.25042371952345943, -0.17903678596580053, -0.16537455976770327, 0.10609808099577753, 0.13685087556004283, 0.06986650960695953, -0.13392326404242133, 0.028909775881121327, -0.04363359199511266, 0.19261139587591955, 0.04571654156183567, 0.014004355695723779, 0.25317878175027125, 0.1416198910910606, 0.058295166123718996, 0.09139008290887757, -0.13823668939597164, -0.08219667325613593, -0.2539946294041366, -0.07579170626671455, -0.15277753029552446, -0.00964742783655562, -0.12287303739471306, -0.11229863514668474, 0.3201298122125658, 0.12249794880655117, 0.22112883684202667, 0.06928247430009722, 0.29091219685790015, 0.0540059519235075, 0.11474897295172228, 0.08598283167958744, 0.2565641608602666, 0.147921402380249, 0.044907523640923624, -0.23470165286538744, 0.05066709093985193, -0.016590606920966287] |
1,803.02362 | IceCube bounds on sterile neutrinos above 10 eV | We study the capabilities of IceCube to search for sterile neutrinos with
masses above 10 eV by analyzing its $\nu_\mu$ disappearance atmospheric
neutrino sample. We find that IceCube is not only sensitive to the mixing of
sterile neutrinos to muon neutrinos, but also to the more elusive mixing with
tau neutrinos through matter effects. The currently released 1-year data shows
a mild (around 2$\sigma$) preference for non-zero sterile mixing, which
overlaps with the favoured region for the sterile neutrino interpretation of
the ANITA upward shower. Although the null results from CHORUS and NOMAD on
$\nu_\mu$ to $\nu_\tau$ oscillations in vacuum disfavour the hint from the
IceCube 1-year data, the relevant oscillation channel and underlying physics
are different. At the $99\%$ C.L. an upper bound is obtained instead that
improves over the present Super-Kamiokande and DeepCore constraints in some
parts of the parameter space. We also investigate the physics reach of the
roughly 8 years of data that is already on tape as well as a forecast of 20
years data to probe the present hint or improve upon current constraints.
| hep-ph | we study the capabilities of icecube to search for sterile neutrinos with masses above 10 ev by analyzing its nu_mu disappearance atmospheric neutrino sample we find that icecube is not only sensitive to the mixing of sterile neutrinos to muon neutrinos but also to the more elusive mixing with tau neutrinos through matter effects the currently released 1year data shows a mild around 2sigma preference for nonzero sterile mixing which overlaps with the favoured region for the sterile neutrino interpretation of the anita upward shower although the null results from chorus and nomad on nu_mu to nu_tau oscillations in vacuum disfavour the hint from the icecube 1year data the relevant oscillation channel and underlying physics are different at the 99 cl an upper bound is obtained instead that improves over the present superkamiokande and deepcore constraints in some parts of the parameter space we also investigate the physics reach of the roughly 8 years of data that is already on tape as well as a forecast of 20 years data to probe the present hint or improve upon current constraints | [['we', 'study', 'the', 'capabilities', 'of', 'icecube', 'to', 'search', 'for', 'sterile', 'neutrinos', 'with', 'masses', 'above', '10', 'ev', 'by', 'analyzing', 'its', 'nu_mu', 'disappearance', 'atmospheric', 'neutrino', 'sample', 'we', 'find', 'that', 'icecube', 'is', 'not', 'only', 'sensitive', 'to', 'the', 'mixing', 'of', 'sterile', 'neutrinos', 'to', 'muon', 'neutrinos', 'but', 'also', 'to', 'the', 'more', 'elusive', 'mixing', 'with', 'tau', 'neutrinos', 'through', 'matter', 'effects', 'the', 'currently', 'released', '1year', 'data', 'shows', 'a', 'mild', 'around', '2sigma', 'preference', 'for', 'nonzero', 'sterile', 'mixing', 'which', 'overlaps', 'with', 'the', 'favoured', 'region', 'for', 'the', 'sterile', 'neutrino', 'interpretation', 'of', 'the', 'anita', 'upward', 'shower', 'although', 'the', 'null', 'results', 'from', 'chorus', 'and', 'nomad', 'on', 'nu_mu', 'to', 'nu_tau', 'oscillations', 'in', 'vacuum', 'disfavour', 'the', 'hint', 'from', 'the', 'icecube', '1year', 'data', 'the', 'relevant', 'oscillation', 'channel', 'and', 'underlying', 'physics', 'are', 'different', 'at', 'the', '99', 'cl', 'an', 'upper', 'bound', 'is', 'obtained', 'instead', 'that', 'improves', 'over', 'the', 'present', 'superkamiokande', 'and', 'deepcore', 'constraints', 'in', 'some', 'parts', 'of', 'the', 'parameter', 'space', 'we', 'also', 'investigate', 'the', 'physics', 'reach', 'of', 'the', 'roughly', '8', 'years', 'of', 'data', 'that', 'is', 'already', 'on', 'tape', 'as', 'well', 'as', 'a', 'forecast', 'of', '20', 'years', 'data', 'to', 'probe', 'the', 'present', 'hint', 'or', 'improve', 'upon', 'current', 'constraints']] | [-0.06952643693592916, 0.2606771009645147, 0.0009483134962566611, 0.18769315357979696, -0.10055589261464774, -0.1041261323449564, 0.11509670339809316, 0.29576923236147395, -0.18741319418703722, -0.3861996105251213, 0.07695187769649137, -0.34110302472383613, 0.003227643545768741, 0.21077328684429328, 0.04259238554174469, 0.0033634834887278785, 0.12677607042456251, -0.0019007943557678825, -0.07068620057220364, -0.25063279079428563, 0.25109111319503025, 0.17444940290879457, 0.22813659858398347, 0.06697384189465083, 0.08102579983986086, -0.07248337364031208, -0.09141036923974752, -0.08869976681518084, -0.12347628929100109, 0.01640374865124209, 0.19796599007677287, 0.17737072730843567, 0.09516576169472601, -0.4025177046809808, -0.19485792754114503, 0.1671544426172558, 0.1385405454810502, 0.04956894159614522, -0.04236410925619162, -0.36677138852472935, 0.06195412575406307, -0.18205327623937692, -0.12151418317678488, 0.0006897614065868159, -0.04767020758655336, -0.07826503509164064, -0.28236277842790714, 0.08293062045672236, -0.02152290592267592, 0.01582673033553874, -0.05684558650524802, -0.21834772096222474, 0.0018883759492180413, 0.03777825645835643, 0.16877482387871068, 0.005686534709659302, 0.10739860787418568, -0.13257754026756932, -0.10214944811887108, 0.3730692987433738, -0.10834691046103317, -0.0950113381129793, 0.14630227713722788, -0.22163429133231854, -0.1478414014680311, 0.18001213155479895, 0.16223143868458767, 0.004804455421658026, -0.1991344967055031, 0.08281552228306989, -0.09925541464213489, 0.19452207263998894, 0.06142961625268476, 0.01276153368720164, 0.2702907184552815, 0.25634419876280135, 0.1693555548787117, -0.02684477152587432, -0.18838564024772494, 0.001896867511095479, -0.3504027527381873, -0.081947421886596, -0.10102949812620257, 0.060092472933158406, -0.04559066416671461, -0.09984499132907432, 0.4086909365400465, 0.15297455230190987, 0.2091203411627147, 0.002994599638946561, 0.29612705339612955, 0.02013388355391928, 0.042066732444800435, 0.04490678022719092, 0.35807514773866084, 0.10402062890352681, 0.13866621873587268, -0.21978450129067317, 0.04414481703877553, -0.013253073891003926] |
1,803.02363 | Merger history of central galaxies in Semi-Analytic Models of galaxy
formation | We investigate the dynamical evolution of galaxies in groups with different
formation epochs. Galaxy groups have been selected to be in different dynamical
states, namely dynamically old and dynamically young, which reflect their early
and late formation times, respectively, based on their halo mass assembly.
Brightest galaxies in dynamically young groups have suffered their last major
galaxy merger typically $\sim 2$ Gyr more recently than their counterparts in
dynamically old groups. Furthermore, we study the evolution of velocity
dispersion in these two classes and compare them with the analytic models of
isolated halos. The velocity dispersion of dwarf galaxies in high mass,
dynamically young groups increases slowly in time, while the analogous
dispersion in dynamically old high-mass groups is constant. In contrast, the
velocity dispersion of giant galaxies in low mass groups decreases rapidly at
late times. This increasing velocity bias is caused by dynamical friction, and
starts much earlier in the dynamically old groups. The recent {\sc Radio-SAGE}
model of galaxy formation suggests that radio luminosities of central galaxies,
considered to be tracers of AGN activity, are enhanced in halos that assembled
more recently, independent of the time since the last major merger.
| astro-ph.GA | we investigate the dynamical evolution of galaxies in groups with different formation epochs galaxy groups have been selected to be in different dynamical states namely dynamically old and dynamically young which reflect their early and late formation times respectively based on their halo mass assembly brightest galaxies in dynamically young groups have suffered their last major galaxy merger typically sim 2 gyr more recently than their counterparts in dynamically old groups furthermore we study the evolution of velocity dispersion in these two classes and compare them with the analytic models of isolated halos the velocity dispersion of dwarf galaxies in high mass dynamically young groups increases slowly in time while the analogous dispersion in dynamically old highmass groups is constant in contrast the velocity dispersion of giant galaxies in low mass groups decreases rapidly at late times this increasing velocity bias is caused by dynamical friction and starts much earlier in the dynamically old groups the recent sc radiosage model of galaxy formation suggests that radio luminosities of central galaxies considered to be tracers of agn activity are enhanced in halos that assembled more recently independent of the time since the last major merger | [['we', 'investigate', 'the', 'dynamical', 'evolution', 'of', 'galaxies', 'in', 'groups', 'with', 'different', 'formation', 'epochs', 'galaxy', 'groups', 'have', 'been', 'selected', 'to', 'be', 'in', 'different', 'dynamical', 'states', 'namely', 'dynamically', 'old', 'and', 'dynamically', 'young', 'which', 'reflect', 'their', 'early', 'and', 'late', 'formation', 'times', 'respectively', 'based', 'on', 'their', 'halo', 'mass', 'assembly', 'brightest', 'galaxies', 'in', 'dynamically', 'young', 'groups', 'have', 'suffered', 'their', 'last', 'major', 'galaxy', 'merger', 'typically', 'sim', '2', 'gyr', 'more', 'recently', 'than', 'their', 'counterparts', 'in', 'dynamically', 'old', 'groups', 'furthermore', 'we', 'study', 'the', 'evolution', 'of', 'velocity', 'dispersion', 'in', 'these', 'two', 'classes', 'and', 'compare', 'them', 'with', 'the', 'analytic', 'models', 'of', 'isolated', 'halos', 'the', 'velocity', 'dispersion', 'of', 'dwarf', 'galaxies', 'in', 'high', 'mass', 'dynamically', 'young', 'groups', 'increases', 'slowly', 'in', 'time', 'while', 'the', 'analogous', 'dispersion', 'in', 'dynamically', 'old', 'highmass', 'groups', 'is', 'constant', 'in', 'contrast', 'the', 'velocity', 'dispersion', 'of', 'giant', 'galaxies', 'in', 'low', 'mass', 'groups', 'decreases', 'rapidly', 'at', 'late', 'times', 'this', 'increasing', 'velocity', 'bias', 'is', 'caused', 'by', 'dynamical', 'friction', 'and', 'starts', 'much', 'earlier', 'in', 'the', 'dynamically', 'old', 'groups', 'the', 'recent', 'sc', 'radiosage', 'model', 'of', 'galaxy', 'formation', 'suggests', 'that', 'radio', 'luminosities', 'of', 'central', 'galaxies', 'considered', 'to', 'be', 'tracers', 'of', 'agn', 'activity', 'are', 'enhanced', 'in', 'halos', 'that', 'assembled', 'more', 'recently', 'independent', 'of', 'the', 'time', 'since', 'the', 'last', 'major', 'merger']] | [-0.1125346150266132, 0.1915195340958998, -0.11719530568231341, 0.10511816019214053, -0.07030702640611311, -0.04198497256271329, 0.0020541653104628305, 0.45294699339205735, -0.15567325496167872, -0.3722932508765416, 0.04983046573919722, -0.22781349224680214, -0.043100994523045236, 0.17674139015970106, -0.042220985968090555, -0.0588429714661632, 0.031016997921816194, -0.048043135032443805, -0.055561290761948094, -0.33391498808551173, 0.3509261611610207, 0.061187279017381566, 0.16222185477459986, -0.09820816121570805, 0.01672367724575527, -0.08748769536710928, -0.10454589778731138, -0.036284566992034875, -0.12818004609330816, 0.0023337483169013932, 0.2383777032918793, 0.07223094424857593, 0.28196979263903565, -0.38490147484283066, -0.20445655404295715, 0.09758689451161676, 0.2452141778830709, 0.06541130634886091, -0.14086967991520843, -0.28477884033318474, 0.09457071392961001, -0.21599888547753116, -0.16694915574888453, 0.10814928455480949, 0.1044414771595304, 0.04616167254286331, -0.1143081393334146, 0.22196880476356248, -0.005237943111464063, 0.05769301286218157, -0.1040565583877835, -0.10316424503912812, -0.08202380693271524, 0.12014418381985296, 0.05606618478418921, 0.03816524866444826, 0.20888146966541368, -0.14570112064495258, -0.03947529471551739, 0.39273063148434606, -0.027168235741329497, 0.0203587277237461, 0.29460167205998666, -0.22236075129967975, -0.21011677410992205, 0.10798906910817085, 0.18481539600104133, 0.10143710509512013, -0.14914846411119626, -0.006438679608167752, 0.006457273849561193, 0.17269940144464452, 0.06283763346323801, 0.03329851020661658, 0.3174458601068068, 0.11860053228224034, 0.033861466087497426, 0.06732273195059536, -0.06943032661361807, -0.06043068557215246, -0.13433856179291104, -0.10221819163642708, -0.09107504062562062, 0.06612536917715647, -0.14892036375352014, -0.09344048669001985, 0.360911496741205, 0.08928484028118416, 0.2408143270982748, 0.09511505915212429, 0.2805591962961335, 0.07683090847275109, 0.16826038824640446, 0.1465804947315778, 0.2740414063132566, 0.19661487426024915, 0.029720567083565297, -0.24883290344651382, 0.05073688416835283, 0.0023735220148348745] |
1,803.02364 | On the behaviour of composite resonances breaking lepton flavour
universality | Within the context of composite Higgs models, recent hints on lepton-flavour
non-universality in $B$ decays can be explained by a vector resonance $V$ with
sizeable couplings to the Standard Model leptons ($\ell$). We argue that, in
such a case, spin-$1/2$ leptonic resonances ($L$) are most probably light
enough to open the decay mode $V \rightarrow L\ell$. This implies, in
combination with the fact that couplings between composite resonances are much
larger than those between composite and elementary fields, that this new decay
can be important. In this paper, we explore under which conditions it dominates
over other decay modes. Its discovery, however, requires a dedicated search
strategy. Employing jet substructure techniques, we analyse the final state
with largest branching ratio, namely $\mu^+\mu^- Z/h, Z/h \rightarrow$ jets. We
show that (i) parameter space regions that were believed excluded by di-muon
searches are still allowed, (ii) these regions can already be tested with the
dedicated search we propose and (iii) $V$ masses as large as $\sim 3.5$ TeV can
be probed at the LHC during the high-luminosity phase.
| hep-ph | within the context of composite higgs models recent hints on leptonflavour nonuniversality in b decays can be explained by a vector resonance v with sizeable couplings to the standard model leptons ell we argue that in such a case spin12 leptonic resonances l are most probably light enough to open the decay mode v rightarrow lell this implies in combination with the fact that couplings between composite resonances are much larger than those between composite and elementary fields that this new decay can be important in this paper we explore under which conditions it dominates over other decay modes its discovery however requires a dedicated search strategy employing jet substructure techniques we analyse the final state with largest branching ratio namely mumu zh zh rightarrow jets we show that i parameter space regions that were believed excluded by dimuon searches are still allowed ii these regions can already be tested with the dedicated search we propose and iii v masses as large as sim 35 tev can be probed at the lhc during the highluminosity phase | [['within', 'the', 'context', 'of', 'composite', 'higgs', 'models', 'recent', 'hints', 'on', 'leptonflavour', 'nonuniversality', 'in', 'b', 'decays', 'can', 'be', 'explained', 'by', 'a', 'vector', 'resonance', 'v', 'with', 'sizeable', 'couplings', 'to', 'the', 'standard', 'model', 'leptons', 'ell', 'we', 'argue', 'that', 'in', 'such', 'a', 'case', 'spin12', 'leptonic', 'resonances', 'l', 'are', 'most', 'probably', 'light', 'enough', 'to', 'open', 'the', 'decay', 'mode', 'v', 'rightarrow', 'lell', 'this', 'implies', 'in', 'combination', 'with', 'the', 'fact', 'that', 'couplings', 'between', 'composite', 'resonances', 'are', 'much', 'larger', 'than', 'those', 'between', 'composite', 'and', 'elementary', 'fields', 'that', 'this', 'new', 'decay', 'can', 'be', 'important', 'in', 'this', 'paper', 'we', 'explore', 'under', 'which', 'conditions', 'it', 'dominates', 'over', 'other', 'decay', 'modes', 'its', 'discovery', 'however', 'requires', 'a', 'dedicated', 'search', 'strategy', 'employing', 'jet', 'substructure', 'techniques', 'we', 'analyse', 'the', 'final', 'state', 'with', 'largest', 'branching', 'ratio', 'namely', 'mumu', 'zh', 'zh', 'rightarrow', 'jets', 'we', 'show', 'that', 'i', 'parameter', 'space', 'regions', 'that', 'were', 'believed', 'excluded', 'by', 'dimuon', 'searches', 'are', 'still', 'allowed', 'ii', 'these', 'regions', 'can', 'already', 'be', 'tested', 'with', 'the', 'dedicated', 'search', 'we', 'propose', 'and', 'iii', 'v', 'masses', 'as', 'large', 'as', 'sim', '35', 'tev', 'can', 'be', 'probed', 'at', 'the', 'lhc', 'during', 'the', 'highluminosity', 'phase']] | [-0.08255025187959704, 0.249822214610917, -0.038047025464369326, 0.1228278428481479, -0.07737812962229575, -0.19229041365377436, 0.03448130431735825, 0.3615967763947662, -0.232128034066012, -0.30107172673160676, 0.04527823805189903, -0.27127632093404164, -0.038710602103740464, 0.16089688630017918, 0.04578726284274704, 0.01464796175299522, 0.10020188486669213, -0.023166476576906545, -0.039446981537780215, -0.21052535323013383, 0.25764687674646586, 0.014364776774362492, 0.18480457393161487, 0.04824639224567694, -0.016832915309350938, -0.01304982935173691, -0.02906431019867093, -0.01743217632098425, -0.14023323531103993, 0.037955362729752036, 0.21405583063090655, 0.11054812037082229, 0.17169915710664183, -0.32307098590536043, -0.12976362665093885, 0.20311808595645495, 0.22807258999620733, 0.0609108467754347, -0.05593542433515805, -0.33216492184411356, 0.13052317926088686, -0.17153584052522836, -0.08230565270853483, -0.05796118386206217, 0.00925287717836909, -0.0676632334685895, -0.3145097238593735, 0.08896946310348787, -0.004631782004170501, 0.020575507008206016, 0.0067887708686281585, -0.18269904957428065, -0.042937059165772305, -0.006073142407165671, 0.10559062516933243, 0.05535871810438535, 0.15323854923586955, -0.14536352922997056, -0.1660407238682224, 0.36084944220915943, -0.11928838168560932, -0.14974654199349144, 0.23278409785813314, -0.20959988912959074, -0.16115214734666303, 0.1458494078132472, 0.22015127284843897, 0.09433066348719876, -0.16867088035294067, 0.1422865250860923, -0.023679503562479196, 0.1628548555712438, 0.0317864850764057, 0.08076301642193523, 0.24834738176485355, 0.17825333120245804, 0.01738382648380304, 0.08372674287536276, -0.11563397133564153, -0.0341281102373614, -0.3749779717545607, -0.12600428445363254, -0.07984129288111448, 0.06601465621497482, -0.02218228344662004, -0.04294891248520633, 0.3581471659100233, 0.09590830427689732, 0.28631968187718565, 0.00018072095554089174, 0.25593022447587416, 0.09655080718353433, 0.12015476694432436, 0.09115780334633944, 0.34861324537897337, 0.11127389891002663, 0.08923302525164961, -0.19310127037897473, 0.07167068443496563, 0.023518088531669822] |
1,803.02365 | Strong Hydrogen Absorption at Cosmic Dawn: the Signature of a Baryonic
Universe | The recently reported detection of redshifted 21cm absorption at $z \approx
17$ is a significant advance in the exploration of the cosmic dark ages. The
observed signal ($T_{\mathrm{21}} \approx -0.5$ K with the limit
$T_{\mathrm{21}} < -0.3$ K at 99\% c.l.) is anomalously strong for
$\Lambda$CDM, which predicts at most $-0.24$ K. Here I show that the strong
observed signal is expected in a purely baryonic universe.
| astro-ph.CO | the recently reported detection of redshifted 21cm absorption at z approx 17 is a significant advance in the exploration of the cosmic dark ages the observed signal t_mathrm21 approx 05 k with the limit t_mathrm21 03 k at 99 cl is anomalously strong for lambdacdm which predicts at most 024 k here i show that the strong observed signal is expected in a purely baryonic universe | [['the', 'recently', 'reported', 'detection', 'of', 'redshifted', '21cm', 'absorption', 'at', 'z', 'approx', '17', 'is', 'a', 'significant', 'advance', 'in', 'the', 'exploration', 'of', 'the', 'cosmic', 'dark', 'ages', 'the', 'observed', 'signal', 't_mathrm21', 'approx', '05', 'k', 'with', 'the', 'limit', 't_mathrm21', '03', 'k', 'at', '99', 'cl', 'is', 'anomalously', 'strong', 'for', 'lambdacdm', 'which', 'predicts', 'at', 'most', '024', 'k', 'here', 'i', 'show', 'that', 'the', 'strong', 'observed', 'signal', 'is', 'expected', 'in', 'a', 'purely', 'baryonic', 'universe']] | [-0.11879281961591914, 0.16168922610813752, -0.030173286235367414, 0.05339142672710295, -0.035707785515114665, -0.11580883768328931, 0.058069643200724386, 0.34161675484938314, -0.178878528147834, -0.3722945030312985, 0.002653080980962841, -0.35682774809538387, -0.003702946472913027, 0.1515707374928752, 0.08918776876089396, -0.05556443298519298, -0.019058172529184958, 0.012075959180947393, -0.01893035666034848, -0.235190863495518, 0.16460079004173167, 0.10849806814803742, 0.2305249993733014, 0.0422621421112126, 0.08845986441883724, -0.12728415375750046, -0.04764358629472554, -0.01572165879770182, -0.1886545420317134, -0.007090527087711962, 0.26069209910929203, 0.1001804243423976, 0.22000217823006096, -0.2580617215426173, -0.20176859415369108, 0.16282777672313387, 0.17887271757354029, 0.07968375133896188, -0.08296620633336715, -0.28726445537176915, 0.13415686087682843, -0.11271821000264026, -0.1056496697710827, 0.08105078303924529, 0.0829239141457947, -0.09392376742471242, -0.2471639137220336, 0.2020552268368192, 0.02917316256207414, 0.07598503353074193, -0.04427837300681858, -0.18050255572597962, -0.02733281131804688, -0.05779914672893938, 0.01130205183653743, 0.1208782166504534, 0.16569251221517334, -0.142339697224088, -0.04711873877386097, 0.4330031983554363, -0.21325527744193096, 0.07024389071375481, 0.1694435329118278, -0.2738110830250662, -0.1900328447954962, 0.2469085132361215, 0.12133768524290645, 0.044334168623208825, -0.10059972309682053, 0.09190349486016203, -0.0013287971341924276, 0.2362362649582792, 0.05593681780737825, 0.037573838904791046, 0.32289066529483534, 0.13983637967612594, 0.050326243304880336, -0.026350418949732557, -0.21006065244728234, 0.0416748776769964, -0.2661433378561924, -0.09606697401522979, -0.15689268810092472, 0.0936213737440994, -0.1669328949865303, -0.04867984895827249, 0.31324561398650985, 0.15504520236572716, 0.2783842632670712, 0.08012464345847548, 0.2763068641652353, 0.11541220686922316, 0.027493018584209494, 0.07809772469772724, 0.3804595443652943, 0.14974519424140453, 0.10184046611539088, -0.19102046926127514, 0.0730821402539732, -0.07885796637856402] |
1,803.02366 | Dynamic suppression of Rayleigh light scattering in dielectric
resonators | The ultimate limits of performance for any classical optical system are set
by sub-wavelength fluctuations within the host material, that may be frozen-in
or even dynamically induced. The most common manifestation of such
sub-wavelength disorder is Rayleigh light scattering, which is observed in
nearly all wave-guiding technologies today and can lead to both irreversible
radiative losses as well as undesirable intermodal coupling. While it has been
shown that backscattering from disorder can be suppressed by breaking
time-reversal symmetry in magneto-optic and topological insulator materials,
common optical dielectrics possess neither of these properties. Here we
demonstrate an optomechanical approach for dynamically suppressing Rayleigh
backscattering within dielectric resonators. We achieve this by locally
breaking time-reversal symmetry in a silica resonator through a Brillouin
scattering interaction that is available in all materials. Near-complete
suppression of Rayleigh backscattering is experimentally confirmed through
three independent measurements -- the reduction of the back-reflections caused
by scatterers, the elimination of a commonly seen normal-mode splitting effect,
and by measurement of the reduction in intrinsic optical loss. More broadly,
our results provide new evidence that it is possible to dynamically suppress
Rayleigh backscattering within any optical dielectric medium, for achieving
robust light propagation in nanophotonic devices in spite of the presence of
scatterers or defects.
| physics.optics | the ultimate limits of performance for any classical optical system are set by subwavelength fluctuations within the host material that may be frozenin or even dynamically induced the most common manifestation of such subwavelength disorder is rayleigh light scattering which is observed in nearly all waveguiding technologies today and can lead to both irreversible radiative losses as well as undesirable intermodal coupling while it has been shown that backscattering from disorder can be suppressed by breaking timereversal symmetry in magnetooptic and topological insulator materials common optical dielectrics possess neither of these properties here we demonstrate an optomechanical approach for dynamically suppressing rayleigh backscattering within dielectric resonators we achieve this by locally breaking timereversal symmetry in a silica resonator through a brillouin scattering interaction that is available in all materials nearcomplete suppression of rayleigh backscattering is experimentally confirmed through three independent measurements the reduction of the backreflections caused by scatterers the elimination of a commonly seen normalmode splitting effect and by measurement of the reduction in intrinsic optical loss more broadly our results provide new evidence that it is possible to dynamically suppress rayleigh backscattering within any optical dielectric medium for achieving robust light propagation in nanophotonic devices in spite of the presence of scatterers or defects | [['the', 'ultimate', 'limits', 'of', 'performance', 'for', 'any', 'classical', 'optical', 'system', 'are', 'set', 'by', 'subwavelength', 'fluctuations', 'within', 'the', 'host', 'material', 'that', 'may', 'be', 'frozenin', 'or', 'even', 'dynamically', 'induced', 'the', 'most', 'common', 'manifestation', 'of', 'such', 'subwavelength', 'disorder', 'is', 'rayleigh', 'light', 'scattering', 'which', 'is', 'observed', 'in', 'nearly', 'all', 'waveguiding', 'technologies', 'today', 'and', 'can', 'lead', 'to', 'both', 'irreversible', 'radiative', 'losses', 'as', 'well', 'as', 'undesirable', 'intermodal', 'coupling', 'while', 'it', 'has', 'been', 'shown', 'that', 'backscattering', 'from', 'disorder', 'can', 'be', 'suppressed', 'by', 'breaking', 'timereversal', 'symmetry', 'in', 'magnetooptic', 'and', 'topological', 'insulator', 'materials', 'common', 'optical', 'dielectrics', 'possess', 'neither', 'of', 'these', 'properties', 'here', 'we', 'demonstrate', 'an', 'optomechanical', 'approach', 'for', 'dynamically', 'suppressing', 'rayleigh', 'backscattering', 'within', 'dielectric', 'resonators', 'we', 'achieve', 'this', 'by', 'locally', 'breaking', 'timereversal', 'symmetry', 'in', 'a', 'silica', 'resonator', 'through', 'a', 'brillouin', 'scattering', 'interaction', 'that', 'is', 'available', 'in', 'all', 'materials', 'nearcomplete', 'suppression', 'of', 'rayleigh', 'backscattering', 'is', 'experimentally', 'confirmed', 'through', 'three', 'independent', 'measurements', 'the', 'reduction', 'of', 'the', 'backreflections', 'caused', 'by', 'scatterers', 'the', 'elimination', 'of', 'a', 'commonly', 'seen', 'normalmode', 'splitting', 'effect', 'and', 'by', 'measurement', 'of', 'the', 'reduction', 'in', 'intrinsic', 'optical', 'loss', 'more', 'broadly', 'our', 'results', 'provide', 'new', 'evidence', 'that', 'it', 'is', 'possible', 'to', 'dynamically', 'suppress', 'rayleigh', 'backscattering', 'within', 'any', 'optical', 'dielectric', 'medium', 'for', 'achieving', 'robust', 'light', 'propagation', 'in', 'nanophotonic', 'devices', 'in', 'spite', 'of', 'the', 'presence', 'of', 'scatterers', 'or', 'defects']] | [-0.1756308465863768, 0.22707862673996715, -0.04127438828683666, 0.008724976579649645, -0.05152999212088299, -0.17000147344282313, 0.047119002384630945, 0.429387651614447, -0.26397051679894995, -0.2747631088640649, 0.059424086921459555, -0.28602844977624786, -0.18267908466988902, 0.20627346795133666, -0.015612861369306999, 0.07129561285320465, -0.007598137697747465, -0.09258433915796188, -0.005353672283834968, -0.17862005584683377, 0.2904584275318979, 0.03259382633044773, 0.3367463186794657, 0.10408654581366596, 0.033127675652368335, 0.03460498727028466, 0.05382066882821252, -0.0017327773859453144, -0.033135192581645705, 0.0521025512349403, 0.26092979055179455, -0.03477719677497042, 0.20626434983540942, -0.4506569760357079, -0.27633059195251863, 0.05754022669607719, 0.18819849830780866, 0.1766454554253339, -0.09544829186878576, -0.2900092441642892, 0.06749154915309792, -0.1217732387086268, -0.13848490249448925, -0.09113317113867012, -0.015617528842712381, -0.02010533117346728, -0.25297033057991164, 0.07319177686037875, 0.06977045783395562, 0.06993472712957617, -0.053149374802972674, -0.028945572009124766, -0.050473079809837625, 0.032040190430882486, 0.04200083317909869, -0.02963514927123646, 0.17982783490646115, -0.12194367648369081, -0.11112024749457403, 0.43522005792237023, -0.055855131575846775, -0.14220721464495636, 0.18392539352915493, -0.1391407944089948, 0.0028754714153056008, 0.2123099728510037, 0.15916988066424734, 0.0735453050289737, -0.1559445579554343, 0.023960867421125125, -0.020993040055172173, 0.17684230997534559, 0.10770068751553127, 0.1613261280061442, 0.23036849552209407, 0.194451740380033, 0.03493596976357331, 0.13076043582874017, -0.09404136370008503, -0.0026443041841277977, -0.2676836311245265, -0.11636568068015814, -0.22479351444929405, 0.060212302477948385, -0.08922480763303788, -0.16213253437068417, 0.32503275251585667, 0.16790235990763516, 0.14046649932770908, -0.034257334217418424, 0.32532223149935163, 0.11795531572765293, 0.14924467810728018, 0.04203149681296019, 0.35442722202911614, 0.16247625497635454, 0.048359249407669655, -0.2704889350740275, 0.07064004861159155, -0.050090659891246156] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.