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.03167 | Physical explanation of the universal "inverse-3rd-power-of-separation"
law found numerically for the electrostatic interaction between two
protruding nanostructures | Two conducting nanostructures on a conducting base-plate, and with a common
applied electrostatic field, interact because their electrons are a common
electron-thermodynamic system. Except at small separations, the interaction
reduces the apex field enhancement factor (FEF) of each nanostructure, by means
of "charge blunting". A parameter of interest is the fractional reduction (-d)
of the apex FEF, as compared with the apex FEF for the same emitter when
standing alone on the base-plate. For systems of two or a few identical
post-like emitters, or regular arrays of such emitters, details have been
investigated by methods based on numerical solution of Laplace's equation, and
by using line-charge models. For post separations c comparable with post height
h, several authors have shown that the variation of (-d) with c is well
described by formulae having exponential or quasi-exponential form. By
contrast, explorations of the two-emitter situation using the
"floating-sphere-at-emitter-plane potential" (FSEPP) model have predicted that,
for large c-values, (-d) falls off as 1/c*c*c. Numerical Laplace-type
simulations carried out by de Assis and Dall'Agnol (arXiv:1711.00601v2) have
confirmed this limiting dependence for six different situations involving pairs
of protruding nanostructures; hence they suggest it as an universal law. By
using the FSEPP model for the central structure, and by adopting a "first
moments" representation for the distant structure, this letter shows that a
clear physical reason can be given for this numerically discovered general
limiting (1/c*c*c) dependence. An implication is that the quasi-exponential
formula found useful for c comparable with h is simply a good fitting formula.
A second implication is that the FSEPP model, which currently is used mainly in
nanoscience, may have much wider applicability to electrostatic phenomena.
| cond-mat.mes-hall | two conducting nanostructures on a conducting baseplate and with a common applied electrostatic field interact because their electrons are a common electronthermodynamic system except at small separations the interaction reduces the apex field enhancement factor fef of each nanostructure by means of charge blunting a parameter of interest is the fractional reduction d of the apex fef as compared with the apex fef for the same emitter when standing alone on the baseplate for systems of two or a few identical postlike emitters or regular arrays of such emitters details have been investigated by methods based on numerical solution of laplaces equation and by using linecharge models for post separations c comparable with post height h several authors have shown that the variation of d with c is well described by formulae having exponential or quasiexponential form by contrast explorations of the twoemitter situation using the floatingsphereatemitterplane potential fsepp model have predicted that for large cvalues d falls off as 1ccc numerical laplacetype simulations carried out by de assis and dallagnol arxiv171100601v2 have confirmed this limiting dependence for six different situations involving pairs of protruding nanostructures hence they suggest it as an universal law by using the fsepp model for the central structure and by adopting a first moments representation for the distant structure this letter shows that a clear physical reason can be given for this numerically discovered general limiting 1ccc dependence an implication is that the quasiexponential formula found useful for c comparable with h is simply a good fitting formula a second implication is that the fsepp model which currently is used mainly in nanoscience may have much wider applicability to electrostatic phenomena | [['two', 'conducting', 'nanostructures', 'on', 'a', 'conducting', 'baseplate', 'and', 'with', 'a', 'common', 'applied', 'electrostatic', 'field', 'interact', 'because', 'their', 'electrons', 'are', 'a', 'common', 'electronthermodynamic', 'system', 'except', 'at', 'small', 'separations', 'the', 'interaction', 'reduces', 'the', 'apex', 'field', 'enhancement', 'factor', 'fef', 'of', 'each', 'nanostructure', 'by', 'means', 'of', 'charge', 'blunting', 'a', 'parameter', 'of', 'interest', 'is', 'the', 'fractional', 'reduction', 'd', 'of', 'the', 'apex', 'fef', 'as', 'compared', 'with', 'the', 'apex', 'fef', 'for', 'the', 'same', 'emitter', 'when', 'standing', 'alone', 'on', 'the', 'baseplate', 'for', 'systems', 'of', 'two', 'or', 'a', 'few', 'identical', 'postlike', 'emitters', 'or', 'regular', 'arrays', 'of', 'such', 'emitters', 'details', 'have', 'been', 'investigated', 'by', 'methods', 'based', 'on', 'numerical', 'solution', 'of', 'laplaces', 'equation', 'and', 'by', 'using', 'linecharge', 'models', 'for', 'post', 'separations', 'c', 'comparable', 'with', 'post', 'height', 'h', 'several', 'authors', 'have', 'shown', 'that', 'the', 'variation', 'of', 'd', 'with', 'c', 'is', 'well', 'described', 'by', 'formulae', 'having', 'exponential', 'or', 'quasiexponential', 'form', 'by', 'contrast', 'explorations', 'of', 'the', 'twoemitter', 'situation', 'using', 'the', 'floatingsphereatemitterplane', 'potential', 'fsepp', 'model', 'have', 'predicted', 'that', 'for', 'large', 'cvalues', 'd', 'falls', 'off', 'as', '1ccc', 'numerical', 'laplacetype', 'simulations', 'carried', 'out', 'by', 'de', 'assis', 'and', 'dallagnol', 'arxiv171100601v2', 'have', 'confirmed', 'this', 'limiting', 'dependence', 'for', 'six', 'different', 'situations', 'involving', 'pairs', 'of', 'protruding', 'nanostructures', 'hence', 'they', 'suggest', 'it', 'as', 'an', 'universal', 'law', 'by', 'using', 'the', 'fsepp', 'model', 'for', 'the', 'central', 'structure', 'and', 'by', 'adopting', 'a', 'first', 'moments', 'representation', 'for', 'the', 'distant', 'structure', 'this', 'letter', 'shows', 'that', 'a', 'clear', 'physical', 'reason', 'can', 'be', 'given', 'for', 'this', 'numerically', 'discovered', 'general', 'limiting', '1ccc', 'dependence', 'an', 'implication', 'is', 'that', 'the', 'quasiexponential', 'formula', 'found', 'useful', 'for', 'c', 'comparable', 'with', 'h', 'is', 'simply', 'a', 'good', 'fitting', 'formula', 'a', 'second', 'implication', 'is', 'that', 'the', 'fsepp', 'model', 'which', 'currently', 'is', 'used', 'mainly', 'in', 'nanoscience', 'may', 'have', 'much', 'wider', 'applicability', 'to', 'electrostatic', 'phenomena']] | [-0.09755145571360589, 0.09252918367945111, -0.06603495977922447, 0.05974845101763667, -0.03782373262241621, -0.17317059869701215, 0.03189909328810043, 0.36433612293460305, -0.21255889824770513, -0.32150974981486796, 0.08445819799434738, -0.2601323143544572, -0.11982342815587159, 0.23307554207362788, 0.019736158380854046, 0.022543999104958926, 0.04625201030565357, 0.01575065456348023, -0.03525400540416336, -0.19422417838574835, 0.2957159653340501, 0.059530081230871106, 0.24873090319473434, 0.047100000966478275, 0.0633146916895553, -0.013116028070173882, 0.007157648102104388, 0.05865017203614116, -0.11932369556466087, 0.08693543616854758, 0.19799301280567036, 0.04262533166307818, 0.2678075112937087, -0.4086954556836712, -0.2188622372949289, 0.054462705666406284, 0.17858546637084888, 0.09563158835775944, -0.06795384649540884, -0.2582584732522567, 0.07361423323487139, -0.1525497556939997, -0.1578984562040272, -0.038391029488088355, 0.0747097586531675, 0.04968043457471409, -0.24701135141550803, 0.07057479768129135, 0.050969256264269694, 0.06877317471015784, -0.03155573951942777, -0.14453167035503106, -0.01610841300010819, 0.08784021400788333, 0.02906542224680177, 0.04553763699476366, 0.12788935378193855, -0.1174668173885611, -0.09339990848114851, 0.3793203917918382, -0.07019040123516418, -0.18622554772688696, 0.18769993259812948, -0.1505523184141903, -0.08277299933790884, 0.14672834645974, 0.10071248207284414, 0.13701811054674584, -0.14106349497155019, 0.09128952069572902, -0.023675323975341462, 0.16194641201204998, 0.0995291029551515, 0.0019838804079443904, 0.23188332991795269, 0.1653698596986942, 0.010406642889224545, 0.13812796804165745, -0.08101656512202074, -0.07102248888566262, -0.2701420651645296, -0.13898820695812228, -0.1966750699147168, 0.05416827284541257, -0.08641591678584788, -0.14736423231025347, 0.34157480246396044, 0.09610051184771927, 0.19784143668668414, 0.013161194786274184, 0.2580382373270199, 0.1290094907593879, 0.10261679684303494, 0.04087054149160933, 0.25616898809438915, 0.12113650865697613, 0.06867072336150429, -0.19564372388812007, 0.08837844113112185, 0.02304833284061816] |
1,803.03168 | Coherence time of a Bose-Einstein condensate in an isolated harmonically
trapped gas | We study the condensate phase dynamics in a low-temperature equilibrium gas
of weakly interacting bosons, harmonically trapped and isolated from the
environment. We find that at long times, much longer than the collision time
between Bogoliubov quasiparticles, the variance of the phase accumulated by the
condensate grows with a ballistic term quadratic in time and a diffusive term
affine in time. We give the corresponding analytical expressions in the limit
of a large system, in the collisionless regime and in the ergodic approximation
for the quasiparticle motion. When properly rescaled, they are described by
universal functions of the temperature divided by the Thomas-Fermi chemical
potential. The same conclusion holds for the mode damping rates. Such
universality class differs from the previously studied one of the homogeneous
gas.
| cond-mat.quant-gas | we study the condensate phase dynamics in a lowtemperature equilibrium gas of weakly interacting bosons harmonically trapped and isolated from the environment we find that at long times much longer than the collision time between bogoliubov quasiparticles the variance of the phase accumulated by the condensate grows with a ballistic term quadratic in time and a diffusive term affine in time we give the corresponding analytical expressions in the limit of a large system in the collisionless regime and in the ergodic approximation for the quasiparticle motion when properly rescaled they are described by universal functions of the temperature divided by the thomasfermi chemical potential the same conclusion holds for the mode damping rates such universality class differs from the previously studied one of the homogeneous gas | [['we', 'study', 'the', 'condensate', 'phase', 'dynamics', 'in', 'a', 'lowtemperature', 'equilibrium', 'gas', 'of', 'weakly', 'interacting', 'bosons', 'harmonically', 'trapped', 'and', 'isolated', 'from', 'the', 'environment', 'we', 'find', 'that', 'at', 'long', 'times', 'much', 'longer', 'than', 'the', 'collision', 'time', 'between', 'bogoliubov', 'quasiparticles', 'the', 'variance', 'of', 'the', 'phase', 'accumulated', 'by', 'the', 'condensate', 'grows', 'with', 'a', 'ballistic', 'term', 'quadratic', 'in', 'time', 'and', 'a', 'diffusive', 'term', 'affine', 'in', 'time', 'we', 'give', 'the', 'corresponding', 'analytical', 'expressions', 'in', 'the', 'limit', 'of', 'a', 'large', 'system', 'in', 'the', 'collisionless', 'regime', 'and', 'in', 'the', 'ergodic', 'approximation', 'for', 'the', 'quasiparticle', 'motion', 'when', 'properly', 'rescaled', 'they', 'are', 'described', 'by', 'universal', 'functions', 'of', 'the', 'temperature', 'divided', 'by', 'the', 'thomasfermi', 'chemical', 'potential', 'the', 'same', 'conclusion', 'holds', 'for', 'the', 'mode', 'damping', 'rates', 'such', 'universality', 'class', 'differs', 'from', 'the', 'previously', 'studied', 'one', 'of', 'the', 'homogeneous', 'gas']] | [-0.15409445955361217, 0.22190391227115297, -0.09131003299995699, 0.08156066541798325, 0.0466169038398822, -0.12069278384199528, 0.05836323700298914, 0.30944311142877096, -0.2517373179503548, -0.2247743920503756, 0.02995171780949165, -0.28191500027319344, -0.06525883139624429, 0.168586669951736, 0.046460505911354415, 0.039876391458523085, 0.009973658017784827, 0.04199136438134207, -0.07014421115017049, -0.23450242982458647, 0.3087004553563306, 0.0364424407328149, 0.2658853715241659, 0.02469132457471152, 0.08194788434638048, 0.012505574795366155, 0.020531419488623387, 0.01580860819594245, -0.16613029375678987, -0.01494786091741013, 0.208503202164883, -0.02559325109257942, 0.2470615339340774, -0.44930327669020714, -0.2116218954104725, 0.10768878875358955, 0.19780631438557675, 0.14655796269790863, -0.029216919637901167, -0.27935179795402537, -0.018107569053233786, -0.16750447071106064, -0.1886953343380624, -0.026073061369770154, 0.04638084679599998, 0.05443918446672889, -0.23162763114050616, 0.16707874531582673, 0.0887007320255745, 0.030287701689718862, -0.09596801077301695, -0.06924929090969881, 0.0017602624679644277, 0.08166231004467168, 0.04260535648928618, 0.023998067089114485, 0.145503899584869, -0.15083382812541302, -0.03180950390556314, 0.37954010109703135, -0.14624005356699496, -0.16755464111682117, 0.21028659189134602, -0.22412034665146388, -0.05767984242053834, 0.17908892212765598, 0.13640088513016876, 0.09085261612015916, -0.16984448199012356, 0.10469532366270268, -0.03371712152285164, 0.11929348462415258, 0.04765981740472237, 0.05504660144096284, 0.21935711691053364, 0.16318112473584725, 0.024203537479336335, 0.15852727049156862, -0.059980194176928556, -0.16439252374253757, -0.2949090796691461, -0.14819772421624364, -0.21222861399429513, 0.05089617230082444, -0.09883439142083268, -0.15155898710698124, 0.38215642092991475, 0.11357848603997057, 0.20639333742722046, 0.08612179679715434, 0.2781630021145963, 0.18822953671099632, 0.04834309491277562, 0.1068738572937473, 0.2458572245246958, 0.09750142516054976, 0.09951229859143496, -0.2891754561257879, 0.018744453087478408, 0.0893252224192311] |
1,803.03169 | An Enabling Waveform for 5G - QAM-FBMC: Initial Analysis | In this paper, we identified the challenges and requirements for the waveform
design of the fifth generation mobile communication networks (5G) and compared
Orthogonal frequency-division multiplexing (OFDM) based waveforms with Filter
Bank Multicarrier (FBMC) based ones. Recently it has been shown that
Quadrature-Amplitude Modulation (QAM) transmission and reception can be enabled
in FBMC by using multiple prototype filters, resulting in a new waveform:
QAM-FBMC. Here, the transceiver architecture and signal model of QAM-FBMC are
presented and channel estimation error and RF impairment, e.g., phase noise,
are modeled. In addition, initial evaluation is made in terms of out-of-band
(OOB) emission and complexity. The simulation results show that QAM-FBCM can
achieve the same BER performance as cyclic-prefix (CP) OFDM without spectrum
efficiency reduction due to the adding of CP. Different equalization schemes
are evaluated and the effect of channel estimation error is investigated.
Moreover, effects of the phase noise are evaluated and QAM-FBMC is shown to be
robust to the phase noise.
| eess.SP cs.IT math.IT | in this paper we identified the challenges and requirements for the waveform design of the fifth generation mobile communication networks 5g and compared orthogonal frequencydivision multiplexing ofdm based waveforms with filter bank multicarrier fbmc based ones recently it has been shown that quadratureamplitude modulation qam transmission and reception can be enabled in fbmc by using multiple prototype filters resulting in a new waveform qamfbmc here the transceiver architecture and signal model of qamfbmc are presented and channel estimation error and rf impairment eg phase noise are modeled in addition initial evaluation is made in terms of outofband oob emission and complexity the simulation results show that qamfbcm can achieve the same ber performance as cyclicprefix cp ofdm without spectrum efficiency reduction due to the adding of cp different equalization schemes are evaluated and the effect of channel estimation error is investigated moreover effects of the phase noise are evaluated and qamfbmc is shown to be robust to the phase noise | [['in', 'this', 'paper', 'we', 'identified', 'the', 'challenges', 'and', 'requirements', 'for', 'the', 'waveform', 'design', 'of', 'the', 'fifth', 'generation', 'mobile', 'communication', 'networks', '5g', 'and', 'compared', 'orthogonal', 'frequencydivision', 'multiplexing', 'ofdm', 'based', 'waveforms', 'with', 'filter', 'bank', 'multicarrier', 'fbmc', 'based', 'ones', 'recently', 'it', 'has', 'been', 'shown', 'that', 'quadratureamplitude', 'modulation', 'qam', 'transmission', 'and', 'reception', 'can', 'be', 'enabled', 'in', 'fbmc', 'by', 'using', 'multiple', 'prototype', 'filters', 'resulting', 'in', 'a', 'new', 'waveform', 'qamfbmc', 'here', 'the', 'transceiver', 'architecture', 'and', 'signal', 'model', 'of', 'qamfbmc', 'are', 'presented', 'and', 'channel', 'estimation', 'error', 'and', 'rf', 'impairment', 'eg', 'phase', 'noise', 'are', 'modeled', 'in', 'addition', 'initial', 'evaluation', 'is', 'made', 'in', 'terms', 'of', 'outofband', 'oob', 'emission', 'and', 'complexity', 'the', 'simulation', 'results', 'show', 'that', 'qamfbcm', 'can', 'achieve', 'the', 'same', 'ber', 'performance', 'as', 'cyclicprefix', 'cp', 'ofdm', 'without', 'spectrum', 'efficiency', 'reduction', 'due', 'to', 'the', 'adding', 'of', 'cp', 'different', 'equalization', 'schemes', 'are', 'evaluated', 'and', 'the', 'effect', 'of', 'channel', 'estimation', 'error', 'is', 'investigated', 'moreover', 'effects', 'of', 'the', 'phase', 'noise', 'are', 'evaluated', 'and', 'qamfbmc', 'is', 'shown', 'to', 'be', 'robust', 'to', 'the', 'phase', 'noise']] | [-0.23010007489865072, 0.019122626483088958, -0.023312269229699607, -0.006927637055328807, -0.04933745678186229, -0.22373822322935336, 0.0338439328468598, 0.4364918564569275, -0.21417212609857697, -0.26739612697336657, 0.15050122495550286, -0.21464500650353496, -0.23977222075428134, 0.2096841600767495, -0.13310358954195237, 0.11160608889160198, 0.059977086357561486, -0.0302139797259661, -0.07396393851596722, -0.2444985735584519, 0.21964136734473044, 0.12754067865862223, 0.38017599962640014, -0.02138235901025528, 0.07787715834924225, -0.03057190526200681, -0.06809223592047046, -0.07881794978846919, -0.02476069394474536, 0.04313404659254465, 0.3096297464301259, 0.14465043357714027, 0.21027517247778135, -0.36476222425699234, -0.2737448290517589, 0.09013579943570244, 0.18723728564161873, 0.08252847645396613, -0.07808015082154493, -0.3315374834943305, 0.13421646674286644, -0.26208743860699096, 0.012175536163901008, -0.017742911593859677, -0.0785632919133553, 0.07068240458626042, -0.3541963594210035, 0.04594588938825207, 0.012586919768748558, 0.02168547486411935, -0.011404784551511208, -0.16066353824341073, 0.016759623246232293, 0.12047676415235367, 0.007362755979762746, -0.010656926391423686, 0.0854572669493837, -0.06575034019748136, -0.14473809392203185, 0.3874038526518915, -0.044247345861234945, -0.2546202220526413, 0.12467923635432392, -0.0932796097729566, -0.048528916766257875, 0.1805149549633007, 0.22579088702259012, -0.014209567500372071, -0.19102455497830637, 0.012492122035986106, 0.10500243385600617, 0.23122631827568482, 0.12031582068306329, 0.1623659275952469, 0.1272414365106807, 0.19299291265079951, 0.05721823741687731, 0.1526312774176118, -0.19151965407332489, -0.07102418047066268, -0.17658414693187582, -0.10425507932690517, -0.2130395296321151, -0.04446023933694891, -0.06163671955313613, -0.08567013089953623, 0.3974856504359218, 0.17047502552510574, 0.0792285928285956, 0.07027421108265437, 0.4133418359143554, 0.15696578513488244, 0.07711297322544942, 0.058563374646254024, 0.2448267122297167, 0.11253007099108547, 0.11993437785795837, -0.2433366512047982, 0.040443261495188065, -0.021588917373556574] |
1,803.0317 | Existence and Uniqueness of Solutions of Nabla Fractional Difference
Equations Tending to a Nonnegative Constant | In this paper, we reformulate certain nabla fractional difference equations
which had been investigated by other researchers. The previous results seem to
be incomplete. By using Contraction Mapping Theorem, we establish conditions
under which solutions exist and are unique and have certain asymptotic
properties.
| math.CA math.DS | in this paper we reformulate certain nabla fractional difference equations which had been investigated by other researchers the previous results seem to be incomplete by using contraction mapping theorem we establish conditions under which solutions exist and are unique and have certain asymptotic properties | [['in', 'this', 'paper', 'we', 'reformulate', 'certain', 'nabla', 'fractional', 'difference', 'equations', 'which', 'had', 'been', 'investigated', 'by', 'other', 'researchers', 'the', 'previous', 'results', 'seem', 'to', 'be', 'incomplete', 'by', 'using', 'contraction', 'mapping', 'theorem', 'we', 'establish', 'conditions', 'under', 'which', 'solutions', 'exist', 'and', 'are', 'unique', 'and', 'have', 'certain', 'asymptotic', 'properties']] | [-0.09878745078193871, 0.059200989050706004, -0.13252047830345956, 0.04372708066313697, -0.11728732545584948, -0.13502618146594614, -0.0038096809373448855, 0.38994494681669906, -0.2837338409894569, -0.2910001699135385, 0.18447277081775776, -0.22985162916169924, -0.18117622085000304, 0.16990149702707474, -0.11424043359742923, 0.09170546618671241, 0.04304074667478827, 0.009762297606688331, -0.11815595856486735, -0.2619454470378431, 0.3447888772934675, -0.05071410858495669, 0.2666883689605377, 0.06062940689496992, 0.0706340241118927, -0.0872023068474267, -0.022722253216091882, 0.05387092239900746, -0.2344004439232363, 0.07966561598533933, 0.2647918357767842, 0.10134238319534977, 0.30123807007277553, -0.47196705592796206, -0.23699796093966474, 0.1478590129197321, 0.12030631482643499, 0.05661498989634724, -0.06232847145292908, -0.30628146561370656, 0.14978298244320534, -0.12668265342521903, -0.14508343545127322, -0.13654228138991378, -0.013605029322206974, 0.10480249690061266, -0.2476297923448411, 0.0955237377942963, 0.10799113724550063, 0.05655037323859605, -0.0888312254127496, -0.12054969651878557, 0.0503065360667692, 0.12482870286542246, 0.10079658335730941, 0.0005975559099831364, 0.01315191379663619, -0.07542515932899815, -0.0846033599439331, 0.316184546713802, -0.043685802089219745, -0.2574071436485445, 0.1933802476322109, -0.14124950307781214, -0.19152820473325186, 0.07164811435028572, 0.10478813096415251, 0.1536867972040041, -0.21683748743750833, 0.1284704675278838, -0.0995738599237732, 0.061024739137131044, 0.17030580099460416, 0.0577922071414915, 0.14343749338348227, 0.0439582789443772, 0.08574328299040314, 0.12129502745996103, 0.013588951180943033, -0.10552161140367389, -0.26817232505841687, -0.1332874817943031, -0.09311706126159565, 0.11115457113324241, -0.018743428570318924, -0.11711683921219612, 0.31971667091023515, 0.15559016916350546, 0.1529367131456225, 0.042417701974045485, 0.17708282587541777, 0.2191758971999992, 0.0417281715834344, 0.06860944093205035, 0.2589177055474879, 0.16272549976764078, 0.08421380464410917, -0.1530358877908756, 0.08411676436662674, 0.1100003576006698] |
1,803.03171 | Heavy-to-light scalar form factors from Muskhelishvili-Omn\`es
dispersion relations | By solving the Muskhelishvili-Omn\`es integral equations, the scalar form
factors of the semileptonic heavy meson decays $D\to\pi \bar \ell \nu_\ell$,
$D\to \bar{K} \bar \ell \nu_\ell$, $\bar{B}\to \pi \ell \bar\nu_\ell$ and
$\bar{B}_s\to K \ell \bar\nu_\ell$ are simultaneously studied. As input, we
employ unitarized heavy meson-Goldstone boson chiral coupled-channel amplitudes
for the energy regions not far from thresholds, while, at high energies,
adequate asymptotic conditions are imposed. The scalar form factors are
expressed in terms of Omn\`es matrices multiplied by vector polynomials, which
contain some undetermined dispersive subtraction constants. We make use of
heavy quark and chiral symmetries to constrain these constants, which are
fitted to lattice QCD results both in the charm and the bottom sectors, and in
this latter sector to the light-cone sum rule predictions close to $q^2=0$ as
well. We find a good simultaneous description of the scalar form factors for
the four semileptonic decay reactions. From this combined fit, and taking
advantage that scalar and vector form factors are equal at $q^2=0$, we obtain
$|V_{cd}|=0.244\pm 0.022$, $|V_{cs}|=0.945\pm 0.041$ and $|V_{ub}|=(4.3\pm
0.7)\times10^{-3}$ for the involved Cabibbo-Kobayashi-Maskawa (CKM) matrix
elements. In addition, we predict the following vector form factors at $q^2=0$:
$|f_+^{D\to\eta}(0)|=0.01\pm 0.05$, $|f_+^{D_s\to K}(0)|=0.50 \pm 0.08$,
$|f_+^{D_s\to\eta}(0)|=0.73\pm 0.03$ and $|f_+^{\bar{B}\to\eta}(0)|=0.82 \pm
0.08$, which might serve as alternatives to determine the CKM elements when
experimental measurements of the corresponding differential decay rates become
available. Finally, we predict the different form factors above the
$q^2-$regions accessible in the semileptonic decays, up to moderate energies
amenable to be described using the unitarized coupled-channel chiral approach.
| hep-ph | by solving the muskhelishviliomnes integral equations the scalar form factors of the semileptonic heavy meson decays dtopi bar ell nu_ell dto bark bar ell nu_ell barbto pi ell barnu_ell and barb_sto k ell barnu_ell are simultaneously studied as input we employ unitarized heavy mesongoldstone boson chiral coupledchannel amplitudes for the energy regions not far from thresholds while at high energies adequate asymptotic conditions are imposed the scalar form factors are expressed in terms of omnes matrices multiplied by vector polynomials which contain some undetermined dispersive subtraction constants we make use of heavy quark and chiral symmetries to constrain these constants which are fitted to lattice qcd results both in the charm and the bottom sectors and in this latter sector to the lightcone sum rule predictions close to q20 as well we find a good simultaneous description of the scalar form factors for the four semileptonic decay reactions from this combined fit and taking advantage that scalar and vector form factors are equal at q20 we obtain v_cd0244pm 0022 v_cs0945pm 0041 and v_ub43pm 07times103 for the involved cabibbokobayashimaskawa ckm matrix elements in addition we predict the following vector form factors at q20 f_dtoeta0001pm 005 f_d_sto k0050 pm 008 f_d_stoeta0073pm 003 and f_barbtoeta0082 pm 008 which might serve as alternatives to determine the ckm elements when experimental measurements of the corresponding differential decay rates become available finally we predict the different form factors above the q2regions accessible in the semileptonic decays up to moderate energies amenable to be described using the unitarized coupledchannel chiral approach | [['by', 'solving', 'the', 'muskhelishviliomnes', 'integral', 'equations', 'the', 'scalar', 'form', 'factors', 'of', 'the', 'semileptonic', 'heavy', 'meson', 'decays', 'dtopi', 'bar', 'ell', 'nu_ell', 'dto', 'bark', 'bar', 'ell', 'nu_ell', 'barbto', 'pi', 'ell', 'barnu_ell', 'and', 'barb_sto', 'k', 'ell', 'barnu_ell', 'are', 'simultaneously', 'studied', 'as', 'input', 'we', 'employ', 'unitarized', 'heavy', 'mesongoldstone', 'boson', 'chiral', 'coupledchannel', 'amplitudes', 'for', 'the', 'energy', 'regions', 'not', 'far', 'from', 'thresholds', 'while', 'at', 'high', 'energies', 'adequate', 'asymptotic', 'conditions', 'are', 'imposed', 'the', 'scalar', 'form', 'factors', 'are', 'expressed', 'in', 'terms', 'of', 'omnes', 'matrices', 'multiplied', 'by', 'vector', 'polynomials', 'which', 'contain', 'some', 'undetermined', 'dispersive', 'subtraction', 'constants', 'we', 'make', 'use', 'of', 'heavy', 'quark', 'and', 'chiral', 'symmetries', 'to', 'constrain', 'these', 'constants', 'which', 'are', 'fitted', 'to', 'lattice', 'qcd', 'results', 'both', 'in', 'the', 'charm', 'and', 'the', 'bottom', 'sectors', 'and', 'in', 'this', 'latter', 'sector', 'to', 'the', 'lightcone', 'sum', 'rule', 'predictions', 'close', 'to', 'q20', 'as', 'well', 'we', 'find', 'a', 'good', 'simultaneous', 'description', 'of', 'the', 'scalar', 'form', 'factors', 'for', 'the', 'four', 'semileptonic', 'decay', 'reactions', 'from', 'this', 'combined', 'fit', 'and', 'taking', 'advantage', 'that', 'scalar', 'and', 'vector', 'form', 'factors', 'are', 'equal', 'at', 'q20', 'we', 'obtain', 'v_cd0244pm', '0022', 'v_cs0945pm', '0041', 'and', 'v_ub43pm', '07times103', 'for', 'the', 'involved', 'cabibbokobayashimaskawa', 'ckm', 'matrix', 'elements', 'in', 'addition', 'we', 'predict', 'the', 'following', 'vector', 'form', 'factors', 'at', 'q20', 'f_dtoeta0001pm', '005', 'f_d_sto', 'k0050', 'pm', '008', 'f_d_stoeta0073pm', '003', 'and', 'f_barbtoeta0082', 'pm', '008', 'which', 'might', 'serve', 'as', 'alternatives', 'to', 'determine', 'the', 'ckm', 'elements', 'when', 'experimental', 'measurements', 'of', 'the', 'corresponding', 'differential', 'decay', 'rates', 'become', 'available', 'finally', 'we', 'predict', 'the', 'different', 'form', 'factors', 'above', 'the', 'q2regions', 'accessible', 'in', 'the', 'semileptonic', 'decays', 'up', 'to', 'moderate', 'energies', 'amenable', 'to', 'be', 'described', 'using', 'the', 'unitarized', 'coupledchannel', 'chiral', 'approach']] | [-0.0893714965221476, 0.23371667918459793, -0.043416053980374285, 0.1092109770653961, -0.07190713191255467, -0.15910220024494048, 0.08565817453798842, 0.30490692578440093, -0.2345792753209931, -0.21662666324579727, -0.0027795915837771426, -0.3465281235659687, -0.02693581037844221, 0.10498745799631862, 0.0979197766189176, 0.11417738264311611, 0.05662896988938329, 0.04602251768901699, -0.08234486914500441, -0.17910521844480523, 0.26626014211234245, -0.02484718504181676, 0.1866005624686617, 0.09080970465155785, -0.006832284573082326, -0.002214740886096172, -0.041027602195402475, -0.09898401299549493, -0.18640887575744916, 0.05530008887431351, 0.25406983446348036, 0.07295477070793924, 0.10041002490377599, -0.36392231971991285, -0.07597916688934858, 0.11412807551323755, 0.1992384349379244, 0.0747039828343133, 0.03144777034420842, -0.3102299345153242, 0.14668309755195527, -0.18599046600422986, -0.13238452097454678, -0.17188932836331702, 0.00264327125666939, -0.0907984449618703, -0.4020798188507741, 0.10374502871863912, -0.0826380034280345, 0.04423119919206909, -0.024618507726041315, -0.3111647098505325, 0.022583681165428502, 0.08595322682428817, 0.12057950426709413, 0.08920730726178755, 0.16195876689660343, -0.1499038131250291, -0.07517615962225499, 0.4330247235685633, -0.08747471200513994, -0.20951569865555864, 0.06447790144586268, -0.19519899231515855, -0.1453328378663356, 0.1558241268251965, 0.2047369518526159, 0.0589726488431724, -0.17769004410611122, 0.11612870967892452, -0.016009635301575127, 0.14322873394804098, 0.13100283998620424, 0.0709257600618212, 0.1692872300579734, 0.07485741509389086, -0.09141971862303867, 0.011681529209918416, -0.03128361443264617, -0.060923058781082985, -0.3918430811491768, -0.08999009882655654, -0.0708254404795268, 0.0937139330808013, -0.12066666565072788, -0.08170217910059056, 0.350330675980881, 0.046430290379626635, 0.2907394326537265, 0.02912361946468598, 0.28675296244598586, 0.1321302132667598, 0.09249084035831469, 0.10119376006179753, 0.2805453260835699, 0.22384385262336198, 0.0644294371286902, -0.2729346807068789, 0.012289660212913443, 0.07786421241035585] |
1,803.03172 | Influence of Morphology on Blinking Mechanisms and Excitonic Fine
Structure of Single Colloidal Nanoplatelets | Colloidal semiconductor nanoplatelets (NPLs) with electronic structure as
quantum wells have recently emerged as exciting materials for optoelectronic
applications. Here we investigate how morphology affects important
photoluminescence (PL) properties of single CdSe and core/shell CdSe/CdZnS
nanoplatelets. By analyzing PL intensity-lifetime correlation and second-order
photon correlation results, we demonstrate that, irrespective of morphology,
Auger recombination cannot be responsible for PL blinking of single NPLs. We
propose that hot carrier trapping plays a significant role in blinking and find
that a rough shell induces additional nonradiative channels presumably related
to defects or traps of an imperfect shell. Polarization-resolved PL
spectroscopy analysis reveals exciton fine-structure splitting on the order of
several tens of meV in rough-shell NPLs at room temperature, which is
attributed to exciton localization and substantiated with theoretical
calculations taking into account the NPL shape and electron-hole exchange
interaction.
| cond-mat.mes-hall physics.atm-clus physics.optics | colloidal semiconductor nanoplatelets npls with electronic structure as quantum wells have recently emerged as exciting materials for optoelectronic applications here we investigate how morphology affects important photoluminescence pl properties of single cdse and coreshell cdsecdzns nanoplatelets by analyzing pl intensitylifetime correlation and secondorder photon correlation results we demonstrate that irrespective of morphology auger recombination cannot be responsible for pl blinking of single npls we propose that hot carrier trapping plays a significant role in blinking and find that a rough shell induces additional nonradiative channels presumably related to defects or traps of an imperfect shell polarizationresolved pl spectroscopy analysis reveals exciton finestructure splitting on the order of several tens of mev in roughshell npls at room temperature which is attributed to exciton localization and substantiated with theoretical calculations taking into account the npl shape and electronhole exchange interaction | [['colloidal', 'semiconductor', 'nanoplatelets', 'npls', 'with', 'electronic', 'structure', 'as', 'quantum', 'wells', 'have', 'recently', 'emerged', 'as', 'exciting', 'materials', 'for', 'optoelectronic', 'applications', 'here', 'we', 'investigate', 'how', 'morphology', 'affects', 'important', 'photoluminescence', 'pl', 'properties', 'of', 'single', 'cdse', 'and', 'coreshell', 'cdsecdzns', 'nanoplatelets', 'by', 'analyzing', 'pl', 'intensitylifetime', 'correlation', 'and', 'secondorder', 'photon', 'correlation', 'results', 'we', 'demonstrate', 'that', 'irrespective', 'of', 'morphology', 'auger', 'recombination', 'can', 'not', 'be', 'responsible', 'for', 'pl', 'blinking', 'of', 'single', 'npls', 'we', 'propose', 'that', 'hot', 'carrier', 'trapping', 'plays', 'a', 'significant', 'role', 'in', 'blinking', 'and', 'find', 'that', 'a', 'rough', 'shell', 'induces', 'additional', 'nonradiative', 'channels', 'presumably', 'related', 'to', 'defects', 'or', 'traps', 'of', 'an', 'imperfect', 'shell', 'polarizationresolved', 'pl', 'spectroscopy', 'analysis', 'reveals', 'exciton', 'finestructure', 'splitting', 'on', 'the', 'order', 'of', 'several', 'tens', 'of', 'mev', 'in', 'roughshell', 'npls', 'at', 'room', 'temperature', 'which', 'is', 'attributed', 'to', 'exciton', 'localization', 'and', 'substantiated', 'with', 'theoretical', 'calculations', 'taking', 'into', 'account', 'the', 'npl', 'shape', 'and', 'electronhole', 'exchange', 'interaction']] | [-0.07594099373775809, 0.1702893480517506, -0.06529611030119294, 0.057838175583610256, 0.01677049270908944, -0.19241507228477583, 0.026532673128017718, 0.5296351392342544, -0.2392936386887039, -0.32285108062548235, -0.05266778790118063, -0.30497067674706857, -0.14456643230497482, 0.19789755639195553, 0.03787654125035795, 0.015143319416572066, 0.018937597013599074, -0.14490346331061066, -0.009327424135442604, -0.13312631230955424, 0.2667266281650347, 0.0788696857592132, 0.3104246447636636, 0.20326063123887733, 0.03224796011208502, 0.04426746061482631, 0.061388943659360797, -0.005623257705284392, -0.15910378847906137, 0.11923834481208093, 0.24167495659896623, -0.07937598142170292, 0.2432730699673651, -0.4531467470121296, -0.24300223384531872, 0.01035685887943734, 0.2173799727769459, 0.1527356681686155, -0.1548296822079197, -0.2753786428091938, 0.032976662455921006, -0.09140148663016803, -0.06359784565318156, -0.083132189239704, 0.016734569204238464, 0.0024135723532013155, -0.1815769971739535, 0.12125992529806406, 0.04476529629627133, 0.051647194874717306, -0.10537425999149598, -0.09439428305717336, -0.043369297701728475, 0.0885121591598042, -0.0008703495379236034, -0.049559108274372515, 0.2580886538095964, -0.09801925377413521, -0.155355362672708, 0.39142938539289923, -0.08711932982602294, -0.019856822355102527, 0.14666044633486308, -0.16623388421516316, -0.0737493854111937, 0.1902449767358656, 0.12128457660540282, 0.09330488588517148, -0.1280432081210379, 0.06791688430209486, 0.037451121514416576, 0.2518049966550761, 0.0865815469502088, 0.17359460511600927, 0.2645115901250392, 0.1963081854286001, -0.007336083229507922, 0.15825887323744076, -0.13937735383789165, -0.06491081105709515, -0.1744344685224967, -0.18032662937869592, -0.18594309576677487, 0.148463235811184, -0.06543202054640193, -0.18778833604472525, 0.37463873777853546, 0.06360449726172887, 0.17822333114386044, -0.08510096086897914, 0.21772248443106518, 0.1035750209549031, 0.09047322005875792, -0.025762605545905364, 0.26487891147296655, 0.18164301005890593, 0.0819267152589472, -0.3328246008365086, 0.07725062469356037, -0.05204551836290835] |
1,803.03173 | Towards the Modular Specification and Validation of Cyber-Physical
Systems | Cyber-Physical Systems (CPS) are systems controlled by one or more
computer-based components tightly integrated with a set of physical components,
typically described as sensors and actuators, that can either be directly
attached to the computer components, or at a remote location, and accessible
through a network connection. The modeling and verification of such systems is
a hard task and error prone that require rigorous techniques. Hybrid automata
is a formalism that extends finite-state automata with continuous behavior,
described by ordinary differential equations. This paper uses a rewriting
logic-based technique to model and validate CPS, thus exploring the use of a
formal technique to develop such systems that combines expressive specification
with efficient state-based analysis. Moreover, we aim at the modular
specification of such systems such that each CPS component is independently
specified and the final system emerges as the synchronous product of its
constituent components. We model CPSs using Linear Hybrid Automaton and
implement them in Real-Time Maude, a rewriting logic tool for real-time
systems. With this method, we develop a specification for the $n$-reservoir
problem, a CPS that controls a hose to fill a number of reservoirs according to
the physical properties of the hose and the reservoirs.
| cs.LO | cyberphysical systems cps are systems controlled by one or more computerbased components tightly integrated with a set of physical components typically described as sensors and actuators that can either be directly attached to the computer components or at a remote location and accessible through a network connection the modeling and verification of such systems is a hard task and error prone that require rigorous techniques hybrid automata is a formalism that extends finitestate automata with continuous behavior described by ordinary differential equations this paper uses a rewriting logicbased technique to model and validate cps thus exploring the use of a formal technique to develop such systems that combines expressive specification with efficient statebased analysis moreover we aim at the modular specification of such systems such that each cps component is independently specified and the final system emerges as the synchronous product of its constituent components we model cpss using linear hybrid automaton and implement them in realtime maude a rewriting logic tool for realtime systems with this method we develop a specification for the nreservoir problem a cps that controls a hose to fill a number of reservoirs according to the physical properties of the hose and the reservoirs | [['cyberphysical', 'systems', 'cps', 'are', 'systems', 'controlled', 'by', 'one', 'or', 'more', 'computerbased', 'components', 'tightly', 'integrated', 'with', 'a', 'set', 'of', 'physical', 'components', 'typically', 'described', 'as', 'sensors', 'and', 'actuators', 'that', 'can', 'either', 'be', 'directly', 'attached', 'to', 'the', 'computer', 'components', 'or', 'at', 'a', 'remote', 'location', 'and', 'accessible', 'through', 'a', 'network', 'connection', 'the', 'modeling', 'and', 'verification', 'of', 'such', 'systems', 'is', 'a', 'hard', 'task', 'and', 'error', 'prone', 'that', 'require', 'rigorous', 'techniques', 'hybrid', 'automata', 'is', 'a', 'formalism', 'that', 'extends', 'finitestate', 'automata', 'with', 'continuous', 'behavior', 'described', 'by', 'ordinary', 'differential', 'equations', 'this', 'paper', 'uses', 'a', 'rewriting', 'logicbased', 'technique', 'to', 'model', 'and', 'validate', 'cps', 'thus', 'exploring', 'the', 'use', 'of', 'a', 'formal', 'technique', 'to', 'develop', 'such', 'systems', 'that', 'combines', 'expressive', 'specification', 'with', 'efficient', 'statebased', 'analysis', 'moreover', 'we', 'aim', 'at', 'the', 'modular', 'specification', 'of', 'such', 'systems', 'such', 'that', 'each', 'cps', 'component', 'is', 'independently', 'specified', 'and', 'the', 'final', 'system', 'emerges', 'as', 'the', 'synchronous', 'product', 'of', 'its', 'constituent', 'components', 'we', 'model', 'cpss', 'using', 'linear', 'hybrid', 'automaton', 'and', 'implement', 'them', 'in', 'realtime', 'maude', 'a', 'rewriting', 'logic', 'tool', 'for', 'realtime', 'systems', 'with', 'this', 'method', 'we', 'develop', 'a', 'specification', 'for', 'the', 'nreservoir', 'problem', 'a', 'cps', 'that', 'controls', 'a', 'hose', 'to', 'fill', 'a', 'number', 'of', 'reservoirs', 'according', 'to', 'the', 'physical', 'properties', 'of', 'the', 'hose', 'and', 'the', 'reservoirs']] | [-0.13895625206997567, 0.062344527484689174, -0.08951063071509277, 0.038674013801753955, -0.0870039452953885, -0.1956305531479155, 0.061400501128648304, 0.34132093841426375, -0.2918339372810089, -0.31130230288030675, 0.11625851526553037, -0.244053300721759, -0.1567949045924564, 0.19506459023728215, -0.06905410928425915, 0.11324378741156037, 0.055568183785494926, 0.0077985246463518855, -0.02924767355293487, -0.1667093280091355, 0.3121054287049731, 0.006669476008597724, 0.2497445017092325, -0.027903936091913946, 0.12322495456766148, 0.0401088992719341, -0.0036052547729188444, 0.037251601565058634, -0.05687724639927072, 0.16112561774089687, 0.3126834346148458, 0.18000941284734642, 0.289006386559005, -0.4484490667789648, -0.19090023048097418, 0.07244495851413413, 0.11812371379728759, 0.07749392379620912, 0.004869270287415911, -0.27696055796637076, 0.10950024832613917, -0.24665179310455881, -0.11248201108067249, -0.10307896158403972, 0.008656577263591867, 0.04564441496922606, -0.27090779322110153, -0.026372125238236604, 0.10120493730040964, 0.07230057366747371, -0.018397325458771766, -0.03890990595641367, -0.017224587184362903, 0.1326612561254414, -0.05440248561272812, -0.012928163061845068, 0.18069750438162097, -0.08562197060691136, -0.15637847619375797, 0.37014619712576724, -0.033809380171905185, -0.21868000571813548, 0.26492225463064667, -0.003519644716171303, -0.16574615632498993, 0.09344560767034765, 0.19284875939230933, 0.09892111337470888, -0.21054848663525355, 0.053117352655475535, 0.01043343696874952, 0.23927534882548368, -0.008598410057590692, 0.02173195330477837, 0.23704417345273976, 0.23335611733203435, 0.05740819600127953, 0.15474537125203025, 0.02075967910529627, -0.09744939641354398, -0.26361470410226656, -0.1631663572865033, -0.13444658004293086, -0.02578614620936357, -0.008445152617177239, -0.17872454205673716, 0.38234540817123186, 0.171933332464606, 0.14396409581960978, 0.10903529585527275, 0.3765008308539035, 0.1369987042031205, 0.07863774175774495, 0.0691381181161639, 0.14962781087855215, 0.10916881399015153, 0.12564521785496235, -0.18324398932534017, 0.0851444517852588, 0.052732531467395025] |
1,803.03174 | Study of supersolidity in the two-dimensional Hubbard-Holstein model | We derive an effective Hamiltonian for the two-dimensional Hubbard-Holstein
model in the regimes of strong electron-electron and strong electron-phonon
interactions by using a nonperturbative approach. In the parameter region where
the system manifests the existence of a correlated singlet phase, the effective
Hamiltonian transforms to a $t_1-V_1-V_2-V_3$ Hamiltonian for hard-core-bosons
on a checkerboard lattice. We employ quantum Monte Carlo simulations, involving
stochastic-series-expansion technique, to obtain the ground state phase
diagram. At filling $1/8$, as the strength of off-site repulsion increases, the
system undergoes a first-order transition from a superfluid to a diagonal
striped solid with ordering wavevector $\vec{Q}=(\pi/4,3\pi/4)$ or
$(\pi/4,5\pi/4)$. Unlike the one-dimensional situation, our results in the
two-dimensional case reveal a supersolid phase (corresponding to the diagonal
striped solid) around filling $1/8$ and at large off-site repulsions.
Furthermore, for small off-site repulsions, we witness a valence bond solid at
one-fourth filling and tiny phase-separated regions at slightly higher
fillings.
| cond-mat.str-el | we derive an effective hamiltonian for the twodimensional hubbardholstein model in the regimes of strong electronelectron and strong electronphonon interactions by using a nonperturbative approach in the parameter region where the system manifests the existence of a correlated singlet phase the effective hamiltonian transforms to a t_1v_1v_2v_3 hamiltonian for hardcorebosons on a checkerboard lattice we employ quantum monte carlo simulations involving stochasticseriesexpansion technique to obtain the ground state phase diagram at filling 18 as the strength of offsite repulsion increases the system undergoes a firstorder transition from a superfluid to a diagonal striped solid with ordering wavevector vecqpi43pi4 or pi45pi4 unlike the onedimensional situation our results in the twodimensional case reveal a supersolid phase corresponding to the diagonal striped solid around filling 18 and at large offsite repulsions furthermore for small offsite repulsions we witness a valence bond solid at onefourth filling and tiny phaseseparated regions at slightly higher fillings | [['we', 'derive', 'an', 'effective', 'hamiltonian', 'for', 'the', 'twodimensional', 'hubbardholstein', 'model', 'in', 'the', 'regimes', 'of', 'strong', 'electronelectron', 'and', 'strong', 'electronphonon', 'interactions', 'by', 'using', 'a', 'nonperturbative', 'approach', 'in', 'the', 'parameter', 'region', 'where', 'the', 'system', 'manifests', 'the', 'existence', 'of', 'a', 'correlated', 'singlet', 'phase', 'the', 'effective', 'hamiltonian', 'transforms', 'to', 'a', 't_1v_1v_2v_3', 'hamiltonian', 'for', 'hardcorebosons', 'on', 'a', 'checkerboard', 'lattice', 'we', 'employ', 'quantum', 'monte', 'carlo', 'simulations', 'involving', 'stochasticseriesexpansion', 'technique', 'to', 'obtain', 'the', 'ground', 'state', 'phase', 'diagram', 'at', 'filling', '18', 'as', 'the', 'strength', 'of', 'offsite', 'repulsion', 'increases', 'the', 'system', 'undergoes', 'a', 'firstorder', 'transition', 'from', 'a', 'superfluid', 'to', 'a', 'diagonal', 'striped', 'solid', 'with', 'ordering', 'wavevector', 'vecqpi43pi4', 'or', 'pi45pi4', 'unlike', 'the', 'onedimensional', 'situation', 'our', 'results', 'in', 'the', 'twodimensional', 'case', 'reveal', 'a', 'supersolid', 'phase', 'corresponding', 'to', 'the', 'diagonal', 'striped', 'solid', 'around', 'filling', '18', 'and', 'at', 'large', 'offsite', 'repulsions', 'furthermore', 'for', 'small', 'offsite', 'repulsions', 'we', 'witness', 'a', 'valence', 'bond', 'solid', 'at', 'onefourth', 'filling', 'and', 'tiny', 'phaseseparated', 'regions', 'at', 'slightly', 'higher', 'fillings']] | [-0.19251279171862423, 0.25116426238723577, -0.03874027569760721, 0.07172932894820705, 0.016265923839878953, -0.16851606389367316, 0.12831374398777134, 0.34814697139169254, -0.23992897239226643, -0.25012881751810134, 0.01804461310799425, -0.32841093151842893, -0.12162573797762241, 0.1026968045386626, 0.10638964523649806, -0.024908176878441688, 0.005753614368835745, -0.019070991708846022, -0.1769128817130416, -0.17588826016400746, 0.29557031336916634, -0.011420808471771187, 0.25548793747383236, 0.0980289254675632, 0.058625942743574716, 0.037506306892943056, 0.15453850978041347, 0.02838503874117534, -0.18768505055508386, 0.005063860686751057, 0.20918769949938693, -0.11112287458453378, 0.21232414763544014, -0.4057835209987139, -0.18848397474965617, 0.027580398528785636, 0.14917998040917851, 0.18457276968617145, -0.024580000096785338, -0.327771597132023, -0.024398703134478363, -0.23130662722053796, -0.17071102734348953, -0.09592962701970788, -0.01654667738978177, -0.026201598477001264, -0.2792285415662886, 0.13856031287147358, 0.04470738208029827, 0.06263255629662985, -0.08440110388639294, -0.12072691531080038, -0.04430985768255459, 0.06818309101859771, -0.010820294859538442, 0.08935103659862526, 0.0880916175617492, -0.151352020860841, -0.06137373047077084, 0.3921488224439425, -0.05904690976962702, -0.13760205142659276, 0.21054731614007424, -0.16585395641765263, -0.09090474713793063, 0.22708854871508602, 0.1335436385396026, 0.04791089355282179, -0.06519779729439992, 0.07327525056252727, -0.01465610789345603, 0.20944908410386495, -0.006504072062990131, 0.018060543022616064, 0.21945628256111227, 0.19999412704284672, 0.08089356291847788, 0.20023491578846406, -0.1257186510284393, -0.17928177327530026, -0.2562150463130172, -0.11460064087471325, -0.2285422659925606, 0.009669870355051674, -0.11398845518373467, -0.20863356616360787, 0.37536340833909504, 0.11255051704659445, 0.16981545726653852, -0.025183359747880125, 0.237049246299374, 0.10468319577024612, 0.029732650683312486, 0.02542597614786881, 0.23161916867255755, 0.11291031252229204, 0.08571958406477503, -0.28434928292759426, 0.008688891172562151, 0.13082930155430142] |
1,803.03175 | Automatic Detection of Public Development Projects in Large Open Source
Ecosystems: An Exploratory Study on GitHub | Hosting over 10 million of software projects, GitHub is one of the most
important data sources to study behavior of developers and software projects.
However, with the increase of the size of open source datasets, the potential
threats to mining these datasets have also grown. As the dataset grows, it
becomes gradually unrealistic for human to confirm quality of all samples. Some
studies have investigated this problem and provided solutions to avoid threats
in sample selection, but some of these solutions (e.g., finding development
projects) require human intervention. When the amount of data to be processed
increases, these semi-automatic solutions become less useful since the effort
in need for human intervention is far beyond affordable. To solve this problem,
we investigated the GHTorrent dataset and proposed a method to detect public
development projects. The results show that our method can effectively improve
the sample selection process in two ways: (1) We provide a simple model to
automatically select samples (with 0.827 precision and 0.947 recall); (2) We
also offer a complex model to help researchers carefully screen samples (with
63.2% less effort than manually confirming all samples, and can achieve 0.926
precision and 0.959 recall).
| cs.SE | hosting over 10 million of software projects github is one of the most important data sources to study behavior of developers and software projects however with the increase of the size of open source datasets the potential threats to mining these datasets have also grown as the dataset grows it becomes gradually unrealistic for human to confirm quality of all samples some studies have investigated this problem and provided solutions to avoid threats in sample selection but some of these solutions eg finding development projects require human intervention when the amount of data to be processed increases these semiautomatic solutions become less useful since the effort in need for human intervention is far beyond affordable to solve this problem we investigated the ghtorrent dataset and proposed a method to detect public development projects the results show that our method can effectively improve the sample selection process in two ways 1 we provide a simple model to automatically select samples with 0827 precision and 0947 recall 2 we also offer a complex model to help researchers carefully screen samples with 632 less effort than manually confirming all samples and can achieve 0926 precision and 0959 recall | [['hosting', 'over', '10', 'million', 'of', 'software', 'projects', 'github', 'is', 'one', 'of', 'the', 'most', 'important', 'data', 'sources', 'to', 'study', 'behavior', 'of', 'developers', 'and', 'software', 'projects', 'however', 'with', 'the', 'increase', 'of', 'the', 'size', 'of', 'open', 'source', 'datasets', 'the', 'potential', 'threats', 'to', 'mining', 'these', 'datasets', 'have', 'also', 'grown', 'as', 'the', 'dataset', 'grows', 'it', 'becomes', 'gradually', 'unrealistic', 'for', 'human', 'to', 'confirm', 'quality', 'of', 'all', 'samples', 'some', 'studies', 'have', 'investigated', 'this', 'problem', 'and', 'provided', 'solutions', 'to', 'avoid', 'threats', 'in', 'sample', 'selection', 'but', 'some', 'of', 'these', 'solutions', 'eg', 'finding', 'development', 'projects', 'require', 'human', 'intervention', 'when', 'the', 'amount', 'of', 'data', 'to', 'be', 'processed', 'increases', 'these', 'semiautomatic', 'solutions', 'become', 'less', 'useful', 'since', 'the', 'effort', 'in', 'need', 'for', 'human', 'intervention', 'is', 'far', 'beyond', 'affordable', 'to', 'solve', 'this', 'problem', 'we', 'investigated', 'the', 'ghtorrent', 'dataset', 'and', 'proposed', 'a', 'method', 'to', 'detect', 'public', 'development', 'projects', 'the', 'results', 'show', 'that', 'our', 'method', 'can', 'effectively', 'improve', 'the', 'sample', 'selection', 'process', 'in', 'two', 'ways', '1', 'we', 'provide', 'a', 'simple', 'model', 'to', 'automatically', 'select', 'samples', 'with', '0827', 'precision', 'and', '0947', 'recall', '2', 'we', 'also', 'offer', 'a', 'complex', 'model', 'to', 'help', 'researchers', 'carefully', 'screen', 'samples', 'with', '632', 'less', 'effort', 'than', 'manually', 'confirming', 'all', 'samples', 'and', 'can', 'achieve', '0926', 'precision', 'and', '0959', 'recall']] | [-0.04207964636131607, 0.025715560611510247, -0.0566726294880224, 0.06277840220858351, -0.116719911622033, -0.17365266917724662, 0.08019240372862245, 0.4195472693128377, -0.21415784926040904, -0.41908133513841433, 0.1535508913670897, -0.3444910865785919, -0.08652629577746787, 0.2352792436866685, -0.09647000808095962, 0.06012438609055964, 0.1267871296638743, 0.0011866082830088137, -0.009919164165806897, -0.3457858503133673, 0.26098250050323335, 0.06377408766312544, 0.2969781815352821, 0.028270267667824922, 0.03915102587719976, -0.07304396334622708, -0.05890229268037935, -0.0009156340929996414, -0.09453626277817674, 0.13758781536112627, 0.3240088864431246, 0.21492189052754762, 0.34542029300589383, -0.39810903075584103, -0.19225177540895097, 0.10572938308763058, 0.16788455319839, 0.11157095712773411, -0.05852497313423658, -0.29305863561775997, 0.12724064732901752, -0.1609784531063213, -0.13090939584101752, -0.1137855052978002, 0.011468749464556728, -0.024556096527394215, -0.25082083303225106, 0.012962916006331726, -0.007917895584580843, 0.08728494068377257, -0.033212325653330106, -0.13291284354576438, 0.008785177095428339, 0.183473387931878, 0.09783882719357186, 0.054882662622834144, 0.1435776911249874, -0.1524689651055972, -0.09514648044486675, 0.353036507119223, 0.006206626229371621, -0.1866149716511292, 0.19815951204059415, -0.09812840190716088, -0.14821464036541546, 0.12163843091135633, 0.2100573418897183, 0.1028457004588923, -0.18329461795896274, -0.0003591463943108071, 0.026051854354703856, 0.2287659116933055, 0.04657173005518379, 0.010001181578623689, 0.15805475879460573, 0.22026525302334046, 0.04417968041157907, 0.12217063700945895, -0.07670414337729939, -0.029869517724308157, -0.20098766179745728, -0.14601425269796253, -0.12417164639228974, 0.021085954721316157, -0.0713114050097257, -0.14012561294642642, 0.35767215461537394, 0.2541751918507759, 0.1482963524806822, 0.05620428373480273, 0.2974019154387805, 0.0030635421010713603, 0.13817277009336076, 0.08038603688110765, 0.1972560981332358, -0.015346064171081735, 0.11393149112790496, -0.17187136773874542, 0.08633541598071143, -0.057499330189587916] |
1,803.03176 | Modeling Activation Processes in Human Memory to Improve Tag
Recommendations | This thesis was submitted by Dr. Dominik Kowald to the Institute of
Interactive Systems and Data Science of Graz University of Technology in
Austria on the 5th of September 2017 for the attainment of the degree
'Dr.techn'. The supervisors of this thesis have been Prof. Stefanie Lindstaedt
and Ass.Prof. Elisabeth Lex from Graz University of Technology, and the
external assessor has been Prof. Tobias Ley from Tallinn University.
In the current enthusiasm around Data Science and Big Data Analytics, it is
important to mention that only theory-guided approaches will truly enable us to
fully understand why an algorithm works and how specific results can be
explained. It was the goal of this dissertation research to follow this path by
demonstrating that a recommender system inspired by human memory theory can
have a true impact in the field.
| cs.IR | this thesis was submitted by dr dominik kowald to the institute of interactive systems and data science of graz university of technology in austria on the 5th of september 2017 for the attainment of the degree drtechn the supervisors of this thesis have been prof stefanie lindstaedt and assprof elisabeth lex from graz university of technology and the external assessor has been prof tobias ley from tallinn university in the current enthusiasm around data science and big data analytics it is important to mention that only theoryguided approaches will truly enable us to fully understand why an algorithm works and how specific results can be explained it was the goal of this dissertation research to follow this path by demonstrating that a recommender system inspired by human memory theory can have a true impact in the field | [['this', 'thesis', 'was', 'submitted', 'by', 'dr', 'dominik', 'kowald', 'to', 'the', 'institute', 'of', 'interactive', 'systems', 'and', 'data', 'science', 'of', 'graz', 'university', 'of', 'technology', 'in', 'austria', 'on', 'the', '5th', 'of', 'september', '2017', 'for', 'the', 'attainment', 'of', 'the', 'degree', 'drtechn', 'the', 'supervisors', 'of', 'this', 'thesis', 'have', 'been', 'prof', 'stefanie', 'lindstaedt', 'and', 'assprof', 'elisabeth', 'lex', 'from', 'graz', 'university', 'of', 'technology', 'and', 'the', 'external', 'assessor', 'has', 'been', 'prof', 'tobias', 'ley', 'from', 'tallinn', 'university', 'in', 'the', 'current', 'enthusiasm', 'around', 'data', 'science', 'and', 'big', 'data', 'analytics', 'it', 'is', 'important', 'to', 'mention', 'that', 'only', 'theoryguided', 'approaches', 'will', 'truly', 'enable', 'us', 'to', 'fully', 'understand', 'why', 'an', 'algorithm', 'works', 'and', 'how', 'specific', 'results', 'can', 'be', 'explained', 'it', 'was', 'the', 'goal', 'of', 'this', 'dissertation', 'research', 'to', 'follow', 'this', 'path', 'by', 'demonstrating', 'that', 'a', 'recommender', 'system', 'inspired', 'by', 'human', 'memory', 'theory', 'can', 'have', 'a', 'true', 'impact', 'in', 'the', 'field']] | [-0.04228608288350656, 0.06580038203350286, -0.13653376031046113, 0.0008203313376394693, -0.11366222245675145, -0.12275801802928926, 0.017592467168772902, 0.3093370318934886, -0.2068963857565188, -0.37478235427459533, 0.1429065667898888, -0.29539232116869907, -0.1690662715471152, 0.20946866564741923, -0.15536676519409273, 0.0276576173491776, 0.07332458736544306, 0.02362453063180896, 0.03121915862147668, -0.3283782438621997, 0.27883449897247675, 0.14286560971628537, 0.3272721500799173, 0.08732572414517177, 0.07914445266236947, -0.00340965904020281, -0.059192984640090304, -0.02122914682982038, -0.09193190159754577, 0.15137089876666185, 0.32767353678354993, 0.23158502462672803, 0.3633923711763187, -0.4203208302373462, -0.15655640473899743, 0.03716263218401847, 0.081943199716713, 0.07698193956898511, -0.013613860423599059, -0.34454052491734427, 0.05759389886004625, -0.22732985233740305, -0.1000738135542523, -0.04744275154856344, 0.05198340342383634, 0.0029586541367638292, -0.19225068349447666, -0.009501780245707116, 0.06048685719371971, 0.12882250263073453, -0.03347980438830388, -0.10740587431637598, 0.03636832368052141, 0.17889013967589673, 0.017802361601780198, 0.10406921406728074, 0.07772924606053327, -0.12854067610125197, -0.15541648035022346, 0.3631367777865803, -0.011206606780020096, -0.05429842749920984, 0.17615076936040583, -0.1306113347580487, -0.17819243934707518, 0.043527933648984996, 0.21084370374393818, 0.05608198077551964, -0.2012623990003979, 0.13425426297092627, -0.012325735588092357, 0.15646424427430963, 0.061309114621535904, -0.0719628142136516, 0.20261954241521546, 0.17927849938331003, -0.01674384300625234, 0.0656122216261627, -0.02922288309712189, -0.07283103559166193, -0.21637468405639415, -0.18125661122471545, -0.18122336871668018, 0.035316249528532906, 0.08055059710629091, -0.05936163535278121, 0.3693964778177553, 0.20451946710917665, 0.0860940711643321, -0.058842392063304556, 0.2663028985209001, 0.04748458921500115, 0.08366799408174826, 0.0837847342799333, 0.2393192663245524, 0.0812273745365074, 0.2286159449264012, -0.15232847186835538, 0.06158814050617035, 0.043337713255878596] |
1,803.03177 | Kubo spins in nano-scale aluminum grains: A muon spin relaxation study | We report muon spin relaxation rate measurements on films composed of
aluminum grains having a size of a few nm, with a large energy level splitting
of the order of 100 K. The films range from weakly metallic to insulating. In
the insulating case the low temperature relaxation rate is consistent with the
presence of single electron spins in grains having an odd number of electrons.
The relaxation rate temperature dependence follows an activation law having an
energy scale in agreement with the average level splitting. In weakly metallic
films the relaxation rate is smaller and decreases faster with temperature.
Overall our observations are in line with the presence of a Kubo spin in Al
nano-size grains due to quantum size effects.
| cond-mat.str-el cond-mat.other | we report muon spin relaxation rate measurements on films composed of aluminum grains having a size of a few nm with a large energy level splitting of the order of 100 k the films range from weakly metallic to insulating in the insulating case the low temperature relaxation rate is consistent with the presence of single electron spins in grains having an odd number of electrons the relaxation rate temperature dependence follows an activation law having an energy scale in agreement with the average level splitting in weakly metallic films the relaxation rate is smaller and decreases faster with temperature overall our observations are in line with the presence of a kubo spin in al nanosize grains due to quantum size effects | [['we', 'report', 'muon', 'spin', 'relaxation', 'rate', 'measurements', 'on', 'films', 'composed', 'of', 'aluminum', 'grains', 'having', 'a', 'size', 'of', 'a', 'few', 'nm', 'with', 'a', 'large', 'energy', 'level', 'splitting', 'of', 'the', 'order', 'of', '100', 'k', 'the', 'films', 'range', 'from', 'weakly', 'metallic', 'to', 'insulating', 'in', 'the', 'insulating', 'case', 'the', 'low', 'temperature', 'relaxation', 'rate', 'is', 'consistent', 'with', 'the', 'presence', 'of', 'single', 'electron', 'spins', 'in', 'grains', 'having', 'an', 'odd', 'number', 'of', 'electrons', 'the', 'relaxation', 'rate', 'temperature', 'dependence', 'follows', 'an', 'activation', 'law', 'having', 'an', 'energy', 'scale', 'in', 'agreement', 'with', 'the', 'average', 'level', 'splitting', 'in', 'weakly', 'metallic', 'films', 'the', 'relaxation', 'rate', 'is', 'smaller', 'and', 'decreases', 'faster', 'with', 'temperature', 'overall', 'our', 'observations', 'are', 'in', 'line', 'with', 'the', 'presence', 'of', 'a', 'kubo', 'spin', 'in', 'al', 'nanosize', 'grains', 'due', 'to', 'quantum', 'size', 'effects']] | [-0.1463550638071582, 0.25256954820492195, 0.002583035596142538, -0.04555917812747973, 0.014558955448771232, -0.11126779374231385, 0.0525742118517853, 0.3746293632649496, -0.2408071236883397, -0.3391538622071508, 0.025620874110990982, -0.346726217101038, 0.013509789718406611, 0.17606590145943138, 0.03455275077311719, 0.0024511965568278548, -0.020150812442002237, -0.03894534742184838, -0.0980425816807957, -0.22983110927953768, 0.23307179788604176, 0.1124714708488175, 0.30986896928277663, 0.09174303175761273, 0.058658994974751695, -0.018575686220934647, 0.12084378000371708, 0.02663490122907459, -0.14282400499204875, 0.039593293266199134, 0.23787320415168756, -0.10513759917029958, 0.19965718153742004, -0.4556650558150694, -0.17183486309921614, 0.025305508109206547, 0.10149448685210626, 0.1261003615914798, -0.07863949571801045, -0.18391741470426137, 0.06477758691733947, -0.1290755081982886, -0.13773894856481614, -0.0031040173222417716, 0.03677594426591865, -0.0014208516899923808, -0.2739394915626064, 0.16818192290508602, 0.07552279701807582, 0.08290219222974093, -0.09582127492348129, -0.1466342273061393, -0.037879707022631146, 0.0242321466775153, 0.08444644315320937, 0.03361077104613078, 0.21143767722027346, -0.10860616004964734, -0.0769428922184056, 0.3203105785746555, -0.11366756700006024, -0.09280552880716372, 0.20318659157568558, -0.215768417627856, -0.028459069708392758, 0.24819830583683292, 0.1376181806973945, 0.14376682014574085, -0.1096903773398734, 0.06108603189049525, -0.022847080893326002, 0.2747177014768612, 0.04312077326868035, 0.08817406533113976, 0.24142706423967344, 0.24636079435099345, 0.04804530466494501, 0.16060398497664538, -0.16575060947416503, -0.06503793410050347, -0.21605180775685634, -0.15456957271376046, -0.22459027322284023, 0.11780651167538933, -0.12846996282887183, -0.15869661390811937, 0.35120939000005846, 0.0866965743155814, 0.24198942997141695, 0.04427923352961413, 0.25248984160802523, 0.11299043259064316, 0.08703397048759412, 0.07705025474939754, 0.22279949521371087, 0.16640780062307833, 0.09592529314906016, -0.3043579980788264, 0.10286036486829035, -0.009279474005347392] |
1,803.03178 | Fact Checking in Community Forums | Community Question Answering (cQA) forums are very popular nowadays, as they
represent effective means for communities around particular topics to share
information. Unfortunately, this information is not always factual. Thus, here
we explore a new dimension in the context of cQA, which has been ignored so
far: checking the veracity of answers to particular questions in cQA forums. As
this is a new problem, we create a specialized dataset for it. We further
propose a novel multi-faceted model, which captures information from the answer
content (what is said and how), from the author profile (who says it), from the
rest of the community forum (where it is said), and from external authoritative
sources of information (external support). Evaluation results show a MAP value
of 86.54, which is 21 points absolute above the baseline.
| cs.CL | community question answering cqa forums are very popular nowadays as they represent effective means for communities around particular topics to share information unfortunately this information is not always factual thus here we explore a new dimension in the context of cqa which has been ignored so far checking the veracity of answers to particular questions in cqa forums as this is a new problem we create a specialized dataset for it we further propose a novel multifaceted model which captures information from the answer content what is said and how from the author profile who says it from the rest of the community forum where it is said and from external authoritative sources of information external support evaluation results show a map value of 8654 which is 21 points absolute above the baseline | [['community', 'question', 'answering', 'cqa', 'forums', 'are', 'very', 'popular', 'nowadays', 'as', 'they', 'represent', 'effective', 'means', 'for', 'communities', 'around', 'particular', 'topics', 'to', 'share', 'information', 'unfortunately', 'this', 'information', 'is', 'not', 'always', 'factual', 'thus', 'here', 'we', 'explore', 'a', 'new', 'dimension', 'in', 'the', 'context', 'of', 'cqa', 'which', 'has', 'been', 'ignored', 'so', 'far', 'checking', 'the', 'veracity', 'of', 'answers', 'to', 'particular', 'questions', 'in', 'cqa', 'forums', 'as', 'this', 'is', 'a', 'new', 'problem', 'we', 'create', 'a', 'specialized', 'dataset', 'for', 'it', 'we', 'further', 'propose', 'a', 'novel', 'multifaceted', 'model', 'which', 'captures', 'information', 'from', 'the', 'answer', 'content', 'what', 'is', 'said', 'and', 'how', 'from', 'the', 'author', 'profile', 'who', 'says', 'it', 'from', 'the', 'rest', 'of', 'the', 'community', 'forum', 'where', 'it', 'is', 'said', 'and', 'from', 'external', 'authoritative', 'sources', 'of', 'information', 'external', 'support', 'evaluation', 'results', 'show', 'a', 'map', 'value', 'of', '8654', 'which', 'is', '21', 'points', 'absolute', 'above', 'the', 'baseline']] | [-0.038866793439383124, 0.049646905630431844, -0.09406770070111661, 0.12683659397104444, -0.1715807440817695, -0.1649841984047574, 0.08512758780411925, 0.3749940247331379, -0.2822222456434798, -0.3407069318786715, 0.12355439354856075, -0.3475892863299867, -0.16885244794133486, 0.173707222211471, -0.11651782178192992, 0.007172885502355216, 0.08116769325693673, 0.10572376510721039, 0.016251421762827897, -0.2912782656141754, 0.3664885017258877, 0.06772565006086194, 0.29171792092154536, 0.11986273599463995, 0.07380893989995291, -0.027376925318755886, -0.06916089126819068, 0.03159221590877595, -0.11583077830128428, 0.13673096932920584, 0.34450520890073455, 0.24614246476046514, 0.355513007196626, -0.33115498785363423, -0.19725203162736513, 0.09625419994170609, 0.15350229435981336, 0.12933252117628316, -0.04364065982482509, -0.3180294656265301, 0.08292116230321964, -0.16350179443940183, -0.06593937099078727, -0.08310774758909688, 0.053397037939055626, -0.03848757476291873, -0.23449787532797817, 0.00406873127278893, 0.08936350506194161, 0.08670932407998903, -0.016641739265513465, -0.065945612196105, 0.04503138787395349, 0.20367725314413707, 0.059035178269775286, 0.07619620339281744, 0.11077678599042085, -0.17277264928402888, -0.12200851762794297, 0.40597186406552227, -0.01437322194970241, -0.1765297144072864, 0.17818277342788255, -0.07212269419599607, -0.15513435837188314, 0.06182949014262042, 0.18328918005819572, 0.10970140096138824, -0.1914903221256805, 0.05926340495881794, -0.14038827887446986, 0.21838992935690013, 0.06977219460179296, 0.00914820148979991, 0.24742267609602123, 0.17124266488915027, 0.05828586747079636, 0.10278436995047907, 0.0016470020213587718, -0.06323858687590639, -0.21038864274724442, -0.150262675643193, -0.16581677957825983, 0.061325695349902766, -0.0028819775543524884, -0.15004794357060525, 0.39041894456287, 0.23117928859375586, 0.16108268061935, -0.0033424284078082014, 0.2885998811459903, 0.027230557398235596, 0.059859009946442464, 0.1305509354534672, 0.16961252620923473, 0.03736191871576011, 0.14191031943218232, -0.07819671443818758, 0.11320750415325165, 0.033180667630707227] |
1,803.03179 | ASASSN-16dt and ASASSN-16hg: Promising Candidates for a Period Bouncer | We present optical photometry of superoutbursts in 2016 of two WZ Sge-type
dwarf novae (DNe), ASASSN-16dt and ASASSN-16hg. Their light curves showed a dip
in brightness between the first plateau stage with no ordinary superhumps (or
early superhumps) and the second plateau stage with ordinary superhumps. We
find that the dip is produced by slow evolution of the 3:1 resonance tidal
instability and that it would be likely observed in low mass-ratio objects. The
estimated mass ratio ($q \equiv M_{2}/M_{1}$) from the period of developing
(stage A) superhumps (0.06420(3) d) was 0.036(2) in ASASSN-16dt. Additionally,
its superoutburst has many properties similar to those in other low-$q$ WZ
Sge-type DNe: long-lasting stage A superhumps, small superhump amplitudes, long
delay of ordinary superhump appearance, and slow decline rate in the plateau
stage with superhumps. The very small mass ratio and observational
characteristics suggest that this system is one of the best candidates for a
period bouncer -- a binary accounting for the missing population of post-period
minimum cataclysmic variables. Although it is not clearly verified due to the
lack of detection of stage A superhumps, ASASSN-16hg might be a possible
candidate for a period bouncer on the basis of the morphology of its light
curves and the small superhump amplitudes. Many outburst properties of
period-bouncer candidates would originate from the small tidal effects by their
secondary stars.
| astro-ph.SR | we present optical photometry of superoutbursts in 2016 of two wz sgetype dwarf novae dne asassn16dt and asassn16hg their light curves showed a dip in brightness between the first plateau stage with no ordinary superhumps or early superhumps and the second plateau stage with ordinary superhumps we find that the dip is produced by slow evolution of the 31 resonance tidal instability and that it would be likely observed in low massratio objects the estimated mass ratio q equiv m_2m_1 from the period of developing stage a superhumps 0064203 d was 00362 in asassn16dt additionally its superoutburst has many properties similar to those in other lowq wz sgetype dne longlasting stage a superhumps small superhump amplitudes long delay of ordinary superhump appearance and slow decline rate in the plateau stage with superhumps the very small mass ratio and observational characteristics suggest that this system is one of the best candidates for a period bouncer a binary accounting for the missing population of postperiod minimum cataclysmic variables although it is not clearly verified due to the lack of detection of stage a superhumps asassn16hg might be a possible candidate for a period bouncer on the basis of the morphology of its light curves and the small superhump amplitudes many outburst properties of periodbouncer candidates would originate from the small tidal effects by their secondary stars | [['we', 'present', 'optical', 'photometry', 'of', 'superoutbursts', 'in', '2016', 'of', 'two', 'wz', 'sgetype', 'dwarf', 'novae', 'dne', 'asassn16dt', 'and', 'asassn16hg', 'their', 'light', 'curves', 'showed', 'a', 'dip', 'in', 'brightness', 'between', 'the', 'first', 'plateau', 'stage', 'with', 'no', 'ordinary', 'superhumps', 'or', 'early', 'superhumps', 'and', 'the', 'second', 'plateau', 'stage', 'with', 'ordinary', 'superhumps', 'we', 'find', 'that', 'the', 'dip', 'is', 'produced', 'by', 'slow', 'evolution', 'of', 'the', '31', 'resonance', 'tidal', 'instability', 'and', 'that', 'it', 'would', 'be', 'likely', 'observed', 'in', 'low', 'massratio', 'objects', 'the', 'estimated', 'mass', 'ratio', 'q', 'equiv', 'm_2m_1', 'from', 'the', 'period', 'of', 'developing', 'stage', 'a', 'superhumps', '0064203', 'd', 'was', '00362', 'in', 'asassn16dt', 'additionally', 'its', 'superoutburst', 'has', 'many', 'properties', 'similar', 'to', 'those', 'in', 'other', 'lowq', 'wz', 'sgetype', 'dne', 'longlasting', 'stage', 'a', 'superhumps', 'small', 'superhump', 'amplitudes', 'long', 'delay', 'of', 'ordinary', 'superhump', 'appearance', 'and', 'slow', 'decline', 'rate', 'in', 'the', 'plateau', 'stage', 'with', 'superhumps', 'the', 'very', 'small', 'mass', 'ratio', 'and', 'observational', 'characteristics', 'suggest', 'that', 'this', 'system', 'is', 'one', 'of', 'the', 'best', 'candidates', 'for', 'a', 'period', 'bouncer', 'a', 'binary', 'accounting', 'for', 'the', 'missing', 'population', 'of', 'postperiod', 'minimum', 'cataclysmic', 'variables', 'although', 'it', 'is', 'not', 'clearly', 'verified', 'due', 'to', 'the', 'lack', 'of', 'detection', 'of', 'stage', 'a', 'superhumps', 'asassn16hg', 'might', 'be', 'a', 'possible', 'candidate', 'for', 'a', 'period', 'bouncer', 'on', 'the', 'basis', 'of', 'the', 'morphology', 'of', 'its', 'light', 'curves', 'and', 'the', 'small', 'superhump', 'amplitudes', 'many', 'outburst', 'properties', 'of', 'periodbouncer', 'candidates', 'would', 'originate', 'from', 'the', 'small', 'tidal', 'effects', 'by', 'their', 'secondary', 'stars']] | [-0.15778750193215185, 0.16056854665936035, -0.1437951237652028, 0.08755737053035127, -0.11307711086948381, -0.1590724187121997, 0.05636057291021099, 0.35225617155874756, -0.1994321920312426, -0.3361572702029025, 0.09718371149525905, -0.2781018186961451, -0.1467980438111616, 0.2013074227593719, -0.11534073766243691, 0.004023092027972474, 0.15088890481274575, -0.0072360509064494875, -0.032929388567760225, -0.3379031537585647, 0.2513940468471291, 0.016050523186686195, 0.11661061293510977, -0.11528599950214548, 0.030541831582424142, -0.03071551853232944, -0.03771495787318998, -0.10589276536256247, -0.08093000608407179, -0.0417727194189991, 0.24217761051733785, 0.0909718814030883, 0.2086567084695543, -0.3460657402249654, -0.18661311258506116, 0.11577742622118048, 0.14863562257531257, 0.05915694898219719, -0.05858729918506683, -0.21102424340874112, 0.07623571522715222, -0.17978300308499673, -0.1706197551936598, 0.061790347322478276, 0.17266586598026037, -0.012045537329746694, -0.23038913978452574, 0.17410131665762119, 0.07562886418968928, 0.06881095817922035, -0.14315950873625477, -0.13041206935907754, -0.07998211314678536, 0.027101451395860603, 0.11825533923832485, 0.06472687676231365, 0.05160341668264588, -0.1294422021150709, -0.12075534522584919, 0.33039955186232717, -0.14205727673324536, 0.03647595372862152, 0.1948037729319614, -0.19501446401228278, -0.10316135648912686, 0.1988257176461651, 0.14562619912270713, 0.1151341457447801, -0.13545122488148614, -0.05549396429474311, 0.06794048973985772, 0.21816923696878215, 0.08276326775825518, 0.05996421085453854, 0.3544333352994878, 0.1532057980805086, -0.08366751073578518, 0.09201269206716486, -0.21136922080151324, -0.029415718835836473, -0.25715526376855197, -0.12960201827487328, -0.1382574954248261, 0.0542643764740943, -0.11612956075403895, -0.14060397756882526, 0.3957276004130527, 0.01738076392681368, 0.27190477598977836, 0.00983146283977283, 0.2531971764677818, 0.14521526804404153, 0.06906812901179196, 0.10304049685198281, 0.36610758976264074, 0.14688993413816742, 0.17423972570496152, -0.26892979780744763, 0.16969548188330186, 0.004570854729050041] |
1,803.0318 | Comment on "Hearing the signal of dark sectors with gravitational wave
detectors" [Phys. Rev. D 94, no. 10, 103519 (2016)] | We revisit the calculation of the gravitational wave spectra generated in a
classically scale-invariant $SU(2)$ gauge sector with a scalar field in the
adjoint representation, as discussed by J.~Jaeckel, et al. The
finite-temperature potential at 1-loop level can induce a strong first-order
phase transition, during which gravitational waves can be generated. With the
accurate numerical computation of the on-shell Euclidean actions of the
nucleation bubbles, we find that the triangle approximation employed by
J.~Jaeckel, et al. strongly distorts the actual potential near its maximum and
thus greatly underestimates the action values. As a result, the gravitational
wave spectra predicted by J.~Jaeckel, et al deviate significantly from the
exact ones in peak frequencies and shapes.
| hep-ph | we revisit the calculation of the gravitational wave spectra generated in a classically scaleinvariant su2 gauge sector with a scalar field in the adjoint representation as discussed by jjaeckel et al the finitetemperature potential at 1loop level can induce a strong firstorder phase transition during which gravitational waves can be generated with the accurate numerical computation of the onshell euclidean actions of the nucleation bubbles we find that the triangle approximation employed by jjaeckel et al strongly distorts the actual potential near its maximum and thus greatly underestimates the action values as a result the gravitational wave spectra predicted by jjaeckel et al deviate significantly from the exact ones in peak frequencies and shapes | [['we', 'revisit', 'the', 'calculation', 'of', 'the', 'gravitational', 'wave', 'spectra', 'generated', 'in', 'a', 'classically', 'scaleinvariant', 'su2', 'gauge', 'sector', 'with', 'a', 'scalar', 'field', 'in', 'the', 'adjoint', 'representation', 'as', 'discussed', 'by', 'jjaeckel', 'et', 'al', 'the', 'finitetemperature', 'potential', 'at', '1loop', 'level', 'can', 'induce', 'a', 'strong', 'firstorder', 'phase', 'transition', 'during', 'which', 'gravitational', 'waves', 'can', 'be', 'generated', 'with', 'the', 'accurate', 'numerical', 'computation', 'of', 'the', 'onshell', 'euclidean', 'actions', 'of', 'the', 'nucleation', 'bubbles', 'we', 'find', 'that', 'the', 'triangle', 'approximation', 'employed', 'by', 'jjaeckel', 'et', 'al', 'strongly', 'distorts', 'the', 'actual', 'potential', 'near', 'its', 'maximum', 'and', 'thus', 'greatly', 'underestimates', 'the', 'action', 'values', 'as', 'a', 'result', 'the', 'gravitational', 'wave', 'spectra', 'predicted', 'by', 'jjaeckel', 'et', 'al', 'deviate', 'significantly', 'from', 'the', 'exact', 'ones', 'in', 'peak', 'frequencies', 'and', 'shapes']] | [-0.09246279539033901, 0.18922920411671185, -0.07068588688005611, 0.07474438235441451, -0.07479347794913083, -0.05258488383454581, 0.048394203169696164, 0.3122145281001729, -0.20990078518036426, -0.31704135173359854, 0.03460206144607805, -0.27684357539309484, -0.19809587117643995, 0.161975761279137, 0.009426886440722452, 0.033070273005649686, 0.029076469596475363, 0.004768049979598768, -0.09630526628206369, -0.2129570633610057, 0.2777677967086467, 0.11476788013405576, 0.2576744982486656, 0.031067949098845322, 0.04214228243411829, 0.03306209153838848, -0.018451580148713106, 0.028426609443206536, -0.12299914128718165, 0.04388626460639531, 0.1903355385814058, 0.06880880278339119, 0.17054708339192234, -0.4039871035503191, -0.245575060824641, 0.0991511069107474, 0.13433452698365345, 0.17134692132566942, -0.04542353367759732, -0.354640929739138, 0.04211757546944315, -0.17546736260900567, -0.15352303454152175, -0.061760286404342765, 0.01185236538437669, -0.012480330445166481, -0.27464232641157876, 0.11799259688051646, 0.012802263721823692, -0.008312633718576348, -0.04356529738594729, -0.07981594391739029, -0.08856074073711377, 0.037627150583399556, 0.040373506324708854, 0.09212780077742584, 0.14156131783353262, -0.16266040210693813, -0.11108024086978842, 0.3985258823897886, -0.12241197220384747, -0.13455517077001564, 0.1422451074284158, -0.16016789397894682, -0.07694422242868888, 0.1785140419133792, 0.11841059283541287, 0.10600702108798973, -0.09032650764933542, 0.148263788950556, 0.0007986011713224446, 0.12411631045458642, 0.13160629184883937, -0.0038656857224148617, 0.2321453124954643, 0.03735763619229067, -0.0021392402132940397, 0.10327955989244704, -0.054463092893313025, -0.10656461498869599, -0.3079738510249738, -0.07647707114154943, -0.18630378262809755, 0.014045767260030149, -0.08458548982647092, -0.15563855608496324, 0.38917476031929255, 0.13810953676798626, 0.1837856778180586, 0.05620844326525306, 0.2583363129463243, 0.1584552395200406, 0.04364450780364374, 0.09804238921864644, 0.3364521521470395, 0.13081004397674023, 0.08438511513859819, -0.2668209800133155, 0.003567394328695771, 0.13160679586386928] |
1,803.03181 | Quantum Interactions of Topological Solitons from Electrodynamics | The Casimir energy for the classically stable configurations of the
topological solitons in 2D quantum antiferromagnets is studied by performing
the path-integral over quantum fluctuations. The magnon fluctuation around the
solitons saturating the Bogomol'nyi inequality may be viewed as a charged
scalar field coupled with an effective magnetic field induced by the solitons.
The magnon-soliton couping is closely related to the Pauli Hamiltonian, with
which the effective action is calculated by adapting the worldline formulation
of the derivative expansion for the 2+1d quantum electrodynamics in an external
field. The resulting framework is more flexible than the conventional
scattering analysis based on the Dashen-Hasslacher-Neveu formula. We obtain a
short-range attractive well and a universal long-range $1/r$-type repulsive
potential between two solitons.
| cond-mat.str-el hep-th math-ph math.MP | the casimir energy for the classically stable configurations of the topological solitons in 2d quantum antiferromagnets is studied by performing the pathintegral over quantum fluctuations the magnon fluctuation around the solitons saturating the bogomolnyi inequality may be viewed as a charged scalar field coupled with an effective magnetic field induced by the solitons the magnonsoliton couping is closely related to the pauli hamiltonian with which the effective action is calculated by adapting the worldline formulation of the derivative expansion for the 21d quantum electrodynamics in an external field the resulting framework is more flexible than the conventional scattering analysis based on the dashenhasslacherneveu formula we obtain a shortrange attractive well and a universal longrange 1rtype repulsive potential between two solitons | [['the', 'casimir', 'energy', 'for', 'the', 'classically', 'stable', 'configurations', 'of', 'the', 'topological', 'solitons', 'in', '2d', 'quantum', 'antiferromagnets', 'is', 'studied', 'by', 'performing', 'the', 'pathintegral', 'over', 'quantum', 'fluctuations', 'the', 'magnon', 'fluctuation', 'around', 'the', 'solitons', 'saturating', 'the', 'bogomolnyi', 'inequality', 'may', 'be', 'viewed', 'as', 'a', 'charged', 'scalar', 'field', 'coupled', 'with', 'an', 'effective', 'magnetic', 'field', 'induced', 'by', 'the', 'solitons', 'the', 'magnonsoliton', 'couping', 'is', 'closely', 'related', 'to', 'the', 'pauli', 'hamiltonian', 'with', 'which', 'the', 'effective', 'action', 'is', 'calculated', 'by', 'adapting', 'the', 'worldline', 'formulation', 'of', 'the', 'derivative', 'expansion', 'for', 'the', '21d', 'quantum', 'electrodynamics', 'in', 'an', 'external', 'field', 'the', 'resulting', 'framework', 'is', 'more', 'flexible', 'than', 'the', 'conventional', 'scattering', 'analysis', 'based', 'on', 'the', 'dashenhasslacherneveu', 'formula', 'we', 'obtain', 'a', 'shortrange', 'attractive', 'well', 'and', 'a', 'universal', 'longrange', '1rtype', 'repulsive', 'potential', 'between', 'two', 'solitons']] | [-0.17849399977446517, 0.21230380213646793, -0.08789013709537034, 0.10468242559345219, -0.05066154959564239, -0.15406370450647833, -0.05053941606962264, 0.3002888974417948, -0.21633383566197956, -0.25734589468308927, 0.023201153142046245, -0.2808929384228284, -0.15761452360015551, 0.1840199666823876, 0.044235061641024837, 0.0468844882670348, -0.03414911305397686, 0.08281891189231458, -0.07691888035752542, -0.2058718942255729, 0.3201018161598151, 0.03179978111352361, 0.2875159804796074, 0.07926094953475868, 0.07270357898689049, 0.05713311250329459, 0.0824282313262949, 0.046226684477622224, -0.14455875604792293, 0.11127460159171941, 0.18718737049691253, -0.04805509244107594, 0.18909169144739033, -0.432189397829569, -0.24686995685353116, 0.07103522602662096, 0.15536708951438383, 0.18049885182132377, -0.039293231781580985, -0.3661760832518497, 0.025257242736959104, -0.16170837446036984, -0.15516454244813865, -0.12313542976754449, -0.0038537192483969287, -0.00483037384574191, -0.24312270098065925, 0.10529370589519188, 0.06371021483555216, 0.04207570178402682, -0.08043611883896135, -0.03794062385430275, -0.015431450981788842, 0.040044140599478605, 0.057786034601661616, 0.0682679602000231, 0.14356803255534525, -0.16641124968132856, -0.1433871668572064, 0.38706046080816603, -0.11429138210963682, -0.21859994356252127, 0.1382431311560479, -0.05771861478717903, -0.02596871244180474, 0.1307989400552981, 0.07603320658751526, 0.1376411986904282, -0.15218431378667385, 0.1397045635045072, 0.005675408182176367, 0.12847131525631994, 0.05322824652164669, 0.03822383088438566, 0.26225716061890125, 0.12301422278515174, 0.06944091519798641, 0.17793304401240706, -0.052073018166746636, -0.19986661413084653, -0.3091792642174415, -0.14918858397720478, -0.2331191941906335, 0.0700251865881432, -0.12296580334213243, -0.1871249585696575, 0.38620300157295573, 0.10080946360860746, 0.14515311334487366, -0.002570668483050382, 0.27481903322435663, 0.1955055347160373, 0.10098077432978582, 0.07084894258039609, 0.27859527476021423, 0.19429800117001633, 0.0954633008489401, -0.2893874771395793, -0.0804808372868446, 0.11087001859352498] |
1,803.03182 | Quadratic principal indecomposable modules and strongly real elements of
finite Groups | Let $P$ be a principal indecomposable module of a finite group $G$ in
characteristic $2$ and let $\varphi$ be the Brauer character of the
corresponding simple $G$-module. We show that $P$ affords a non-degenerate
$G$-invariant quadratic form if and only if there are involutions $s,t\in G$
such that $st$ has odd order and $\varphi(st)/2$ is not an algebraic integer.
We then show that the number of isomorphism classes of quadratic principal
indecomposable $G$-modules is equal to the number of strongly real conjugacy
classes of odd order elements of $G$.
| math.RT | let p be a principal indecomposable module of a finite group g in characteristic 2 and let varphi be the brauer character of the corresponding simple gmodule we show that p affords a nondegenerate ginvariant quadratic form if and only if there are involutions stin g such that st has odd order and varphist2 is not an algebraic integer we then show that the number of isomorphism classes of quadratic principal indecomposable gmodules is equal to the number of strongly real conjugacy classes of odd order elements of g | [['let', 'p', 'be', 'a', 'principal', 'indecomposable', 'module', 'of', 'a', 'finite', 'group', 'g', 'in', 'characteristic', '2', 'and', 'let', 'varphi', 'be', 'the', 'brauer', 'character', 'of', 'the', 'corresponding', 'simple', 'gmodule', 'we', 'show', 'that', 'p', 'affords', 'a', 'nondegenerate', 'ginvariant', 'quadratic', 'form', 'if', 'and', 'only', 'if', 'there', 'are', 'involutions', 'stin', 'g', 'such', 'that', 'st', 'has', 'odd', 'order', 'and', 'varphist2', 'is', 'not', 'an', 'algebraic', 'integer', 'we', 'then', 'show', 'that', 'the', 'number', 'of', 'isomorphism', 'classes', 'of', 'quadratic', 'principal', 'indecomposable', 'gmodules', 'is', 'equal', 'to', 'the', 'number', 'of', 'strongly', 'real', 'conjugacy', 'classes', 'of', 'odd', 'order', 'elements', 'of', 'g']] | [-0.2554505781736225, 0.1651932753793517, -0.08118245075456798, -0.0269725921230433, -0.14864416667577726, -0.18689499839357185, -0.052395656710194256, 0.3450781633728184, -0.3765363263664767, -0.22475270941768857, 0.02942682852815117, -0.28105811086821963, -0.14880539692372127, 0.17833785721185533, -0.07487033502812582, -0.075819372035436, 0.0597874796023296, 0.19928021601993928, -0.08204839708526958, -0.3195750177732076, 0.38419956993311644, -0.14361299242062325, 0.15234815418212252, 0.032382449812509796, 0.1312037174886262, -0.002379833514251831, 0.05417499465296383, 0.026282593057575552, -0.11207667316846875, 0.06981477761556479, 0.3755780308486216, 0.08514237202193313, 0.24312752213286745, -0.3274249321336604, -0.07611667615657841, 0.3373343671714379, 0.1422396369585344, -0.07384314610284161, 0.002616522436834533, -0.18282356801104138, 0.20899080774291756, -0.19712678514505652, -0.11088992669035426, -0.07646580300801857, 0.19275554874911904, -0.015120980922471394, -0.30977144777584315, -0.04409318129447373, 0.1246473967013034, 0.13892392423638905, -0.028077082877809353, -0.1569422737639715, -0.11081064918967472, 0.07208338265032084, -0.0445833752005869, 0.049289470437956465, 0.02027775707061995, -0.05146997539453547, -0.11784579254030673, 0.40147352051413193, -0.06278838413312439, -0.22581517619387756, 0.10463567964986643, -0.208448871885511, -0.12887263096424498, 0.14988094051791864, 0.07397913641761988, 0.1547002263621173, 0.04173560294359711, 0.2301304561717023, -0.16828372043726797, 0.11312824545364658, 0.05665269318904558, -0.05430623883148655, 0.13263735596344553, 0.042482432441002776, 0.08459456394087862, 0.11992321549967694, 0.04839973202483221, 0.14896922672844745, -0.3848780455829745, -0.18756224420609546, -0.17158111087999053, 0.18395664569388, -0.13069946728914641, -0.1719780688978393, 0.416820387829582, 0.0595455847796984, 0.15469848808028142, 0.1272336645898494, 0.18796924745071342, 0.10073997108900751, 0.048506557100071485, 0.0941468562880552, 0.053193997612900355, 0.23926468482452698, -0.17504114636474036, -0.19952511935579506, -0.0030949406315233896, 0.18420998375884004] |
1,803.03183 | Multiple Weyl and Double-Weyl Points in an Elastic Chiral Lattice | We show that Multiple Weyl and double Weyl points arise in a chiral elastic
system through stacking many two-dimensional honeycomb mechanical structures.
On the distinct kz plane, the band structures calculated from tight-binding
model exhibit the presence of Weyl points at Brillouin vertices and double Weyl
Points at Brillouin centre. Based on the tight-binding model, we design a
practical chiral mechanical structure which can be fabricated by current 3D
printing technology. The numerical calculation illustrates several Weyl and
double-Weyl points as expected in our analysis of tight-binding model. To
verify the topological feature, topological charges of every degeneracy are
calculated. Within these Weyl points, we theoretically prove that the existence
of topologically protected surface modes, and their robustness against defects
are also demonstrated.
| cond-mat.mes-hall | we show that multiple weyl and double weyl points arise in a chiral elastic system through stacking many twodimensional honeycomb mechanical structures on the distinct kz plane the band structures calculated from tightbinding model exhibit the presence of weyl points at brillouin vertices and double weyl points at brillouin centre based on the tightbinding model we design a practical chiral mechanical structure which can be fabricated by current 3d printing technology the numerical calculation illustrates several weyl and doubleweyl points as expected in our analysis of tightbinding model to verify the topological feature topological charges of every degeneracy are calculated within these weyl points we theoretically prove that the existence of topologically protected surface modes and their robustness against defects are also demonstrated | [['we', 'show', 'that', 'multiple', 'weyl', 'and', 'double', 'weyl', 'points', 'arise', 'in', 'a', 'chiral', 'elastic', 'system', 'through', 'stacking', 'many', 'twodimensional', 'honeycomb', 'mechanical', 'structures', 'on', 'the', 'distinct', 'kz', 'plane', 'the', 'band', 'structures', 'calculated', 'from', 'tightbinding', 'model', 'exhibit', 'the', 'presence', 'of', 'weyl', 'points', 'at', 'brillouin', 'vertices', 'and', 'double', 'weyl', 'points', 'at', 'brillouin', 'centre', 'based', 'on', 'the', 'tightbinding', 'model', 'we', 'design', 'a', 'practical', 'chiral', 'mechanical', 'structure', 'which', 'can', 'be', 'fabricated', 'by', 'current', '3d', 'printing', 'technology', 'the', 'numerical', 'calculation', 'illustrates', 'several', 'weyl', 'and', 'doubleweyl', 'points', 'as', 'expected', 'in', 'our', 'analysis', 'of', 'tightbinding', 'model', 'to', 'verify', 'the', 'topological', 'feature', 'topological', 'charges', 'of', 'every', 'degeneracy', 'are', 'calculated', 'within', 'these', 'weyl', 'points', 'we', 'theoretically', 'prove', 'that', 'the', 'existence', 'of', 'topologically', 'protected', 'surface', 'modes', 'and', 'their', 'robustness', 'against', 'defects', 'are', 'also', 'demonstrated']] | [-0.22259925847979095, 0.12357226696539277, -0.045727778135276426, -0.01640823662538475, -0.058751249010106775, -0.1715591776873765, 0.08922222834383327, 0.3953098895982271, -0.2874721087273059, -0.23753001051765632, -0.0010191169813487345, -0.3272233280709119, -0.23787512700546654, 0.17533440941876574, 0.02875139846511912, 0.07263376120841358, 0.013380110218394093, -0.050105536884696385, -0.10972181429359608, -0.2223840461328353, 0.3161981836211209, -0.013964327805622564, 0.3530520368215999, 0.040222949408963926, 0.0129003377510159, 0.001135397685419132, 0.09146619864126168, 0.02594443749091247, -0.12748667577386177, 0.0740182892972134, 0.24838996250788128, -0.10098197023626568, 0.15092907591753194, -0.4730417588221693, -0.23070211544239183, 0.014359248476481535, 0.1478433441976464, 0.12801188828397117, -0.08194810685482089, -0.33292393203885334, 0.14731545654708536, -0.13931674912299324, -0.17065313051083708, -0.1232153277946409, -0.06365638651423217, -0.04502889301203858, -0.15493661330916306, 0.023428961511358724, 0.00585150131312146, 0.09785032817124714, -0.07784826739698769, -0.09723875088886003, -0.1918234950105652, 0.07971471144128742, 0.012745261442425425, -0.049372036627122785, 0.13353555222804755, -0.07111608459258346, -0.19801296691629824, 0.422868539234699, 0.009526119628027687, -0.1722468681504753, 0.16627161924318387, -0.13333765828671554, -0.08894706224810665, 0.13323180524185602, 0.13059822428873097, 0.06249350837310701, -0.09392020620199344, 0.11441712174753893, -0.057570637776364945, 0.08147804135062951, 0.062122523845211275, 0.05260946883297548, 0.30841170735960083, 0.13144814294225315, 0.03828083227787969, 0.1111250961136936, -0.14956342453152183, -0.07048779230458828, -0.3313351732956026, -0.1655589195017559, -0.27717293778195884, 0.03403394219249759, -0.09679630620933206, -0.24681755289344526, 0.45974280566310255, 0.14533241840866887, 0.21258879421142543, -0.026386769987241463, 0.22137579426351117, 0.09630093301033102, 0.07936514957762528, 0.05482039693364404, 0.2546639867028509, 0.11623583553449773, 0.00805695512809041, -0.22507005065823413, -0.04862857680215039, 0.10596979825901306] |
1,803.03184 | The two and three-loop matter bispectrum in perturbation theories | We evaluate for the first time the dark matter bispectrum of large-scale
structure at two loops in the Standard Perturbation Theory and at three loops
in the Renormalised Perturbation Theory (MPTbreeze formalism), removing in each
case the leading divergences in the integrals in order to make them
infrared-safe. We show that the Standard Perturbation Theory at two loops can
be employed to model the matter bispectrum further into the quasi-nonlinear
regime compared to one loop, up to $k_{\text{max}} \sim 0.1 \, h/{\text{Mpc}}$
at $z = 0$, but without reaching a high level of accuracy. In the case of the
MPTbreeze method, we show that its bispectra decay at smaller and smaller
scales with increasing loop order, but with smaller improvements. At three
loops, this model predicts the bispectrum accurately up to scales
$k_{\text{max}} \sim 0.17 \, h/{\text{Mpc}}$ at $z = 0$ and $k_{\text{max}}
\sim 0.24 \, h/{\text{Mpc}}$ at $z = 1$.
| astro-ph.CO | we evaluate for the first time the dark matter bispectrum of largescale structure at two loops in the standard perturbation theory and at three loops in the renormalised perturbation theory mptbreeze formalism removing in each case the leading divergences in the integrals in order to make them infraredsafe we show that the standard perturbation theory at two loops can be employed to model the matter bispectrum further into the quasinonlinear regime compared to one loop up to k_textmax sim 01 htextmpc at z 0 but without reaching a high level of accuracy in the case of the mptbreeze method we show that its bispectra decay at smaller and smaller scales with increasing loop order but with smaller improvements at three loops this model predicts the bispectrum accurately up to scales k_textmax sim 017 htextmpc at z 0 and k_textmax sim 024 htextmpc at z 1 | [['we', 'evaluate', 'for', 'the', 'first', 'time', 'the', 'dark', 'matter', 'bispectrum', 'of', 'largescale', 'structure', 'at', 'two', 'loops', 'in', 'the', 'standard', 'perturbation', 'theory', 'and', 'at', 'three', 'loops', 'in', 'the', 'renormalised', 'perturbation', 'theory', 'mptbreeze', 'formalism', 'removing', 'in', 'each', 'case', 'the', 'leading', 'divergences', 'in', 'the', 'integrals', 'in', 'order', 'to', 'make', 'them', 'infraredsafe', 'we', 'show', 'that', 'the', 'standard', 'perturbation', 'theory', 'at', 'two', 'loops', 'can', 'be', 'employed', 'to', 'model', 'the', 'matter', 'bispectrum', 'further', 'into', 'the', 'quasinonlinear', 'regime', 'compared', 'to', 'one', 'loop', 'up', 'to', 'k_textmax', 'sim', '01', 'htextmpc', 'at', 'z', '0', 'but', 'without', 'reaching', 'a', 'high', 'level', 'of', 'accuracy', 'in', 'the', 'case', 'of', 'the', 'mptbreeze', 'method', 'we', 'show', 'that', 'its', 'bispectra', 'decay', 'at', 'smaller', 'and', 'smaller', 'scales', 'with', 'increasing', 'loop', 'order', 'but', 'with', 'smaller', 'improvements', 'at', 'three', 'loops', 'this', 'model', 'predicts', 'the', 'bispectrum', 'accurately', 'up', 'to', 'scales', 'k_textmax', 'sim', '017', 'htextmpc', 'at', 'z', '0', 'and', 'k_textmax', 'sim', '024', 'htextmpc', 'at', 'z', '1']] | [-0.08691719364663907, 0.16354721818472548, -0.07356050879341261, 0.10282603924821035, 0.022797721304834404, -0.11072032597429793, 0.005694876807934508, 0.3423157645678469, -0.2468319169406233, -0.3313950697281237, 0.04913022602779855, -0.33756762854875355, -0.04663984932262322, 0.1607387949006054, 0.06426752915541674, 0.014809313428925415, -0.007372381600776109, 0.0352716863942172, -0.08663275780413171, -0.25517523325337416, 0.26803412930718784, 0.051085621841926256, 0.19053590870141213, 0.04341948343408776, 0.08434535290339383, -0.06849368949388636, -0.0027382505415328618, 0.003320178026654597, -0.12905822812693982, 0.03321168030419483, 0.1931125439960381, 0.015993050334910896, 0.24419824103664223, -0.3763456511471806, -0.15889937708973242, 0.08124354413293045, 0.17740798612478478, 0.10012879184093969, 0.04891115346730783, -0.2382842726684336, 0.15701635750331755, -0.18148150749279765, -0.13768561861702594, -0.06155608348419954, -0.014282994116817055, -0.10152100055028909, -0.27249052472420615, 0.1427972470056908, -0.022065515225303586, -0.009474251945984774, 0.022839777586491906, -0.1360368839368738, -0.018420409825469913, 0.0914991163199061, 0.06665031929050796, 0.09423445256141913, 0.1186677789861529, -0.16048024098568492, -0.07878045382877362, 0.3706134765312589, -0.1322069157806129, -0.11726292246984768, 0.12928019119747755, -0.25459136307753366, -0.1842582097822993, 0.15351016825899996, 0.15618137308167582, 0.10859768320605609, -0.06398939311701066, 0.10552530862784398, 0.09566733938609731, 0.20138269724517033, 0.09872682708604583, 0.0036745900930515653, 0.20801573614108151, 0.11564516293302435, 0.047733798436820504, 0.0660972948691904, -0.10524566286777404, -0.061465989994206306, -0.34149498451372673, -0.07067683650933884, -0.09500132530670742, 0.02228939954897967, -0.1630215374781983, -0.11090714188035707, 0.37517937514288674, 0.18586538338648348, 0.22216050564472017, 0.12785149458795786, 0.30729936512893646, 0.11742247050820753, 0.10587284685401567, 0.08033922122598722, 0.259694867398076, 0.10769620527802357, 0.06505353813027513, -0.1949387265433525, -0.048260675678993094, 0.03959076514082222] |
1,803.03185 | Drug Recommendation toward Safe Polypharmacy | Adverse drug reactions (ADRs) induced from high-order drug-drug interactions
(DDIs) due to polypharmacy represent a significant public health problem. In
this paper, we formally formulate the to-avoid and safe (with respect to ADRs)
drug recommendation problems when multiple drugs have been taken
simultaneously. We develop a joint model with a recommendation component and an
ADR label prediction component to recommend for a prescription a set of
to-avoid drugs that will induce ADRs if taken together with the prescription.
We also develop real drug-drug interaction datasets and corresponding
evaluation protocols. Our experimental results on real datasets demonstrate the
strong performance of the joint model compared to other baseline methods.
| cs.IR cs.LG | adverse drug reactions adrs induced from highorder drugdrug interactions ddis due to polypharmacy represent a significant public health problem in this paper we formally formulate the toavoid and safe with respect to adrs drug recommendation problems when multiple drugs have been taken simultaneously we develop a joint model with a recommendation component and an adr label prediction component to recommend for a prescription a set of toavoid drugs that will induce adrs if taken together with the prescription we also develop real drugdrug interaction datasets and corresponding evaluation protocols our experimental results on real datasets demonstrate the strong performance of the joint model compared to other baseline methods | [['adverse', 'drug', 'reactions', 'adrs', 'induced', 'from', 'highorder', 'drugdrug', 'interactions', 'ddis', 'due', 'to', 'polypharmacy', 'represent', 'a', 'significant', 'public', 'health', 'problem', 'in', 'this', 'paper', 'we', 'formally', 'formulate', 'the', 'toavoid', 'and', 'safe', 'with', 'respect', 'to', 'adrs', 'drug', 'recommendation', 'problems', 'when', 'multiple', 'drugs', 'have', 'been', 'taken', 'simultaneously', 'we', 'develop', 'a', 'joint', 'model', 'with', 'a', 'recommendation', 'component', 'and', 'an', 'adr', 'label', 'prediction', 'component', 'to', 'recommend', 'for', 'a', 'prescription', 'a', 'set', 'of', 'toavoid', 'drugs', 'that', 'will', 'induce', 'adrs', 'if', 'taken', 'together', 'with', 'the', 'prescription', 'we', 'also', 'develop', 'real', 'drugdrug', 'interaction', 'datasets', 'and', 'corresponding', 'evaluation', 'protocols', 'our', 'experimental', 'results', 'on', 'real', 'datasets', 'demonstrate', 'the', 'strong', 'performance', 'of', 'the', 'joint', 'model', 'compared', 'to', 'other', 'baseline', 'methods']] | [-0.05272830364224062, 0.012346758340394238, -0.051259535949628905, 0.08051661061417346, -0.10669015200791072, -0.17203729139763932, 0.07440914624735256, 0.41816539556350346, -0.22039788788325101, -0.30106322940731123, 0.060155205430796825, -0.34218782687313715, -0.18441705969777308, 0.19045748398639262, -0.09899982889973612, 0.0369411404134776, 0.16553823186418498, 0.031889681616481744, 0.030920923509599886, -0.2763245195031764, 0.3072759393198451, 0.039613805427918876, 0.28357797049267114, 0.13463596282043616, 0.10423286623356617, 0.02108909269654245, -0.07752046974393416, 0.01987168798662441, -0.07322386661930205, 0.1370390188157611, 0.3498896395283496, 0.15748478279159106, 0.3341312554823059, -0.42242267207716994, -0.23866237372265392, 0.13880752439430546, 0.07517401338994222, 0.1455616171030824, -0.04793050124657006, -0.3529275765220793, 0.0650581972199088, -0.24370282479860592, -0.03886293834690356, -0.14192517293740134, -0.011145086185830945, -0.009524416424474626, -0.3521358350836584, 0.06146023740287967, -0.013076190893837023, 0.0543831516637133, -0.10962705593556166, -0.13973100405221558, 0.025576742484568142, 0.18467599108627392, 0.10022538472713798, 0.041646521178267476, 0.11551687349060129, -0.13621411159555516, -0.16675007741300846, 0.38858922131640733, -0.04628286723767952, -0.20773382405838314, 0.2032318646439685, -0.0019620225395796435, -0.15117065690651113, 0.09641855537785955, 0.26519567232122115, 0.11101970023844603, -0.20747730144113413, -0.04390727108913333, -0.006161596529396638, 0.17217236267894787, 0.0015345376230916888, -0.04705815267626126, 0.15995765347604834, 0.1748112362769942, 0.030523423204321484, 0.10060394390646527, -0.11487671103600834, -0.04713593489262012, -0.21601722191388825, -0.09571353130631219, -0.08568582805049307, 0.0023187096602720523, -0.08739503617807542, -0.1602586435641707, 0.35973545121257455, 0.237492376903318, 0.1469795200095143, 0.04548854674520147, 0.3286651149216407, 0.025334843939729255, 0.1069852503297745, 0.007350518561477931, 0.16533634430324695, 0.001964958024404521, 0.09029931556169857, -0.2470477933200287, 0.13136664567128667, 0.00043876283749375705] |
1,803.03186 | RAN Enablers for 5G Radio Resource Management | This paper presents the description of several key RAN enablers for the radio
resource management (RRM) framework of the fifth generation (5G) radio access
network (RAN), referred to as building blocks of the 5G RRM. In particular, the
following key RAN enablers are discussed: i) interference management techniques
for dense and dynamic deployments, focusing on cell-edge performance
enhancement; ii) dynamic traffic steering mechanisms that aim to attain the
optimum mapping of 5G services to any available resources when and where needed
by considering the peculiarities of different air interface variants (AIVs);
iii) resource management strategies that deal with network slices; and iv)
tight interworking between novel 5G AIVs and evolved legacy AIVs such as
Long-term Evolution (LTE). Evaluation results for each of these key RAN
enablers are also presented.
| cs.IT math.IT | this paper presents the description of several key ran enablers for the radio resource management rrm framework of the fifth generation 5g radio access network ran referred to as building blocks of the 5g rrm in particular the following key ran enablers are discussed i interference management techniques for dense and dynamic deployments focusing on celledge performance enhancement ii dynamic traffic steering mechanisms that aim to attain the optimum mapping of 5g services to any available resources when and where needed by considering the peculiarities of different air interface variants aivs iii resource management strategies that deal with network slices and iv tight interworking between novel 5g aivs and evolved legacy aivs such as longterm evolution lte evaluation results for each of these key ran enablers are also presented | [['this', 'paper', 'presents', 'the', 'description', 'of', 'several', 'key', 'ran', 'enablers', 'for', 'the', 'radio', 'resource', 'management', 'rrm', 'framework', 'of', 'the', 'fifth', 'generation', '5g', 'radio', 'access', 'network', 'ran', 'referred', 'to', 'as', 'building', 'blocks', 'of', 'the', '5g', 'rrm', 'in', 'particular', 'the', 'following', 'key', 'ran', 'enablers', 'are', 'discussed', 'i', 'interference', 'management', 'techniques', 'for', 'dense', 'and', 'dynamic', 'deployments', 'focusing', 'on', 'celledge', 'performance', 'enhancement', 'ii', 'dynamic', 'traffic', 'steering', 'mechanisms', 'that', 'aim', 'to', 'attain', 'the', 'optimum', 'mapping', 'of', '5g', 'services', 'to', 'any', 'available', 'resources', 'when', 'and', 'where', 'needed', 'by', 'considering', 'the', 'peculiarities', 'of', 'different', 'air', 'interface', 'variants', 'aivs', 'iii', 'resource', 'management', 'strategies', 'that', 'deal', 'with', 'network', 'slices', 'and', 'iv', 'tight', 'interworking', 'between', 'novel', '5g', 'aivs', 'and', 'evolved', 'legacy', 'aivs', 'such', 'as', 'longterm', 'evolution', 'lte', 'evaluation', 'results', 'for', 'each', 'of', 'these', 'key', 'ran', 'enablers', 'are', 'also', 'presented']] | [-0.21904212795197964, 0.004208098255935334, 0.04933825974143291, 0.03538954593945121, -0.05035279682375375, -0.21179485276283683, 0.07174434210444519, 0.3726090651092141, -0.2386083096489599, -0.26901586293856533, 0.10867711195682515, -0.18593899492001117, -0.20150920978833942, 0.17049094046422736, -0.07710696518233465, 0.07813083934200596, 0.04690863317701706, -0.09241941008110378, 0.0138596679813178, -0.23444300261145645, 0.3253496011444765, 0.12817522370104872, 0.4138229211157029, 0.09000018347314624, 0.009743053350568742, -0.042384081761995256, -0.09928655805059008, -0.06393759479825638, -0.07427791789746681, 0.14533546960789911, 0.3527220601086007, 0.2535540028800105, 0.31482677133537307, -0.4497323333819996, -0.2332243612974651, 0.04729001377095548, 0.1864687803223036, -0.012961501168996789, -0.030038641974178337, -0.2565090950549573, 0.14563619798814603, -0.27225085511052793, -0.114495972703868, -0.020537780294584675, -0.0038011559617323006, 0.12204222509623036, -0.2841969523254002, -0.03992046727893636, -0.020365649747640588, 0.042133338641115396, -0.06382162749853938, -0.1084396565087544, 0.014791499314353217, 0.22865302959938041, -0.0014899445322248362, 0.0034854252995966477, 0.11076984360278043, -0.13181828492855321, -0.1561713838198966, 0.46095839336283445, 0.0052007469420804996, -0.11743385094495909, 0.19563853198142592, -0.016982297875102637, -0.19409152944824953, 0.03160872628331156, 0.23854687549137735, -0.003376602054421985, -0.20628879059707592, -0.0017010748563262151, 0.03705740154742501, 0.1299908614262592, 0.0671271010078201, 0.14056875024987167, 0.19050218570569544, 0.2652293926704126, 0.1350281709126493, 0.08901707634019355, -0.1041866064255754, -0.1275027056031521, -0.2447984435075764, -0.14360251108747582, -0.1433915949043955, 0.0075114116346997805, -0.07313494215306082, -0.09041842276071624, 0.39327372128302734, 0.1603492105437457, 0.07334863733817902, 0.08030971517974092, 0.4139136121673293, 0.03102078484623989, 0.11379526755519846, 0.1637324440733407, 0.1444486407987239, 0.022271501400341936, 0.22553547723002212, -0.19717938491132456, 0.059433233389963015, -0.0028931282590641534] |
1,803.03187 | Computing local sensitivity and tolerances for stellarator physics
properties using shape gradients | Tight tolerances have been a leading driver of cost in recent stellarator
experiments, so improved definition and control of tolerances can have
significant impact on progress in the field. Here we relate tolerances to the
shape gradient representation that has been useful for shape optimization in
industry, used for example to determine which regions of a car or aerofoil most
affect drag, and we demonstrate how the shape gradient can be computed for
physics properties of toroidal plasmas. The shape gradient gives the local
differential contribution to some scalar figure of merit (shape functional)
caused by normal displacement of the shape. In contrast to derivatives with
respect to quantities parameterizing a shape (e.g. Fourier amplitudes), which
have been used previously for optimizing plasma and coil shapes, the shape
gradient gives spatially local information and so is more easily related to
engineering constraints. We present a method to determine the shape gradient
for any figure of merit using the parameter derivatives that are already
routinely computed for stellarator optimization. Examples of shape gradients
for plasma and electromagnetic coil shapes are given. We also derive and
present examples of an analogous representation of the local sensitivity to
magnetic field errors; this magnetic sensitivity can be rapidly computed from
the shape gradient. The shape gradient and magnetic sensitivity can both be
converted into local tolerances, which inform how accurately the coils should
be built and positioned, where trim coils and structural supports for coils
should be placed, and where magnetic material and current leads can best be
located. Both sensitivity measures provide insight into shape optimization,
enable systematic calculation of tolerances, and connect physics optimization
to engineering criteria that are more easily specified in real space than in
Fourier space.
| physics.plasm-ph | tight tolerances have been a leading driver of cost in recent stellarator experiments so improved definition and control of tolerances can have significant impact on progress in the field here we relate tolerances to the shape gradient representation that has been useful for shape optimization in industry used for example to determine which regions of a car or aerofoil most affect drag and we demonstrate how the shape gradient can be computed for physics properties of toroidal plasmas the shape gradient gives the local differential contribution to some scalar figure of merit shape functional caused by normal displacement of the shape in contrast to derivatives with respect to quantities parameterizing a shape eg fourier amplitudes which have been used previously for optimizing plasma and coil shapes the shape gradient gives spatially local information and so is more easily related to engineering constraints we present a method to determine the shape gradient for any figure of merit using the parameter derivatives that are already routinely computed for stellarator optimization examples of shape gradients for plasma and electromagnetic coil shapes are given we also derive and present examples of an analogous representation of the local sensitivity to magnetic field errors this magnetic sensitivity can be rapidly computed from the shape gradient the shape gradient and magnetic sensitivity can both be converted into local tolerances which inform how accurately the coils should be built and positioned where trim coils and structural supports for coils should be placed and where magnetic material and current leads can best be located both sensitivity measures provide insight into shape optimization enable systematic calculation of tolerances and connect physics optimization to engineering criteria that are more easily specified in real space than in fourier space | [['tight', 'tolerances', 'have', 'been', 'a', 'leading', 'driver', 'of', 'cost', 'in', 'recent', 'stellarator', 'experiments', 'so', 'improved', 'definition', 'and', 'control', 'of', 'tolerances', 'can', 'have', 'significant', 'impact', 'on', 'progress', 'in', 'the', 'field', 'here', 'we', 'relate', 'tolerances', 'to', 'the', 'shape', 'gradient', 'representation', 'that', 'has', 'been', 'useful', 'for', 'shape', 'optimization', 'in', 'industry', 'used', 'for', 'example', 'to', 'determine', 'which', 'regions', 'of', 'a', 'car', 'or', 'aerofoil', 'most', 'affect', 'drag', 'and', 'we', 'demonstrate', 'how', 'the', 'shape', 'gradient', 'can', 'be', 'computed', 'for', 'physics', 'properties', 'of', 'toroidal', 'plasmas', 'the', 'shape', 'gradient', 'gives', 'the', 'local', 'differential', 'contribution', 'to', 'some', 'scalar', 'figure', 'of', 'merit', 'shape', 'functional', 'caused', 'by', 'normal', 'displacement', 'of', 'the', 'shape', 'in', 'contrast', 'to', 'derivatives', 'with', 'respect', 'to', 'quantities', 'parameterizing', 'a', 'shape', 'eg', 'fourier', 'amplitudes', 'which', 'have', 'been', 'used', 'previously', 'for', 'optimizing', 'plasma', 'and', 'coil', 'shapes', 'the', 'shape', 'gradient', 'gives', 'spatially', 'local', 'information', 'and', 'so', 'is', 'more', 'easily', 'related', 'to', 'engineering', 'constraints', 'we', 'present', 'a', 'method', 'to', 'determine', 'the', 'shape', 'gradient', 'for', 'any', 'figure', 'of', 'merit', 'using', 'the', 'parameter', 'derivatives', 'that', 'are', 'already', 'routinely', 'computed', 'for', 'stellarator', 'optimization', 'examples', 'of', 'shape', 'gradients', 'for', 'plasma', 'and', 'electromagnetic', 'coil', 'shapes', 'are', 'given', 'we', 'also', 'derive', 'and', 'present', 'examples', 'of', 'an', 'analogous', 'representation', 'of', 'the', 'local', 'sensitivity', 'to', 'magnetic', 'field', 'errors', 'this', 'magnetic', 'sensitivity', 'can', 'be', 'rapidly', 'computed', 'from', 'the', 'shape', 'gradient', 'the', 'shape', 'gradient', 'and', 'magnetic', 'sensitivity', 'can', 'both', 'be', 'converted', 'into', 'local', 'tolerances', 'which', 'inform', 'how', 'accurately', 'the', 'coils', 'should', 'be', 'built', 'and', 'positioned', 'where', 'trim', 'coils', 'and', 'structural', 'supports', 'for', 'coils', 'should', 'be', 'placed', 'and', 'where', 'magnetic', 'material', 'and', 'current', 'leads', 'can', 'best', 'be', 'located', 'both', 'sensitivity', 'measures', 'provide', 'insight', 'into', 'shape', 'optimization', 'enable', 'systematic', 'calculation', 'of', 'tolerances', 'and', 'connect', 'physics', 'optimization', 'to', 'engineering', 'criteria', 'that', 'are', 'more', 'easily', 'specified', 'in', 'real', 'space', 'than', 'in', 'fourier', 'space']] | [-0.05303798132504658, 0.08643127472561951, -0.11465012508635945, 0.04911760406776328, -0.11771628031513624, -0.11259397076449328, -0.033983355523930794, 0.42664120519592164, -0.26904870588648805, -0.35585401232134495, 0.10166170254417854, -0.20265315240249038, -0.13437209028640326, 0.25073755495185324, -0.07532379334915806, 0.07225738710014779, 0.01483034768457385, 0.004433589516218122, -0.08573805664942635, -0.20441477077944978, 0.24422740969905882, 0.06456839840515202, 0.2779791205099261, 0.04948171546264107, 0.05933597576415056, -0.028843233587369583, 0.002420428157897621, 0.09316364082265223, -0.1322830594516672, 0.1252642320371671, 0.23705629580848905, 0.10866750155129687, 0.2252325559593088, -0.47909061214156473, -0.2035066699988423, 0.10435097428194477, 0.16758012827354984, 0.08768406304009972, -0.042531811926803526, -0.24867800696597203, 0.07448686625175849, -0.1265052914268983, -0.1219149078031554, -0.15006098374708163, 0.005088335002905556, 0.0694074891442725, -0.2847456629858563, 0.039456788435775485, 0.02274228932919266, 0.04916874960734986, -0.051290500906656274, -0.14470499344754198, -0.012348905311189982, 0.13087268029047558, 0.017541592508288368, 0.059595178270417194, 0.22125212971365665, -0.14586798233006032, -0.06508594827900092, 0.36106165014256036, -0.024360037230546198, -0.25504347089457385, 0.11969137295775557, -0.14561903893051975, -0.10101882078545331, 0.14012386668343682, 0.2096700582593251, 0.08839170854820186, -0.14688863571512575, 0.046663293802383835, 0.05140194923086384, 0.16597458077286362, 0.07870730433940809, 0.014565342801983244, 0.22326331672774635, 0.11962140875443401, 0.09928378903430535, 0.16863068814376428, -0.11379199690114097, -0.05668759547199937, -0.2718092891442807, -0.13960144514029763, -0.13791560431786581, -0.004720127359292233, -0.07545544568404437, -0.15159885431858888, 0.4091433295039038, 0.15095631920859115, 0.191819919674018, -0.006843859205291791, 0.29505724828318736, 0.12334411691217959, 0.08401529272829979, 0.05084470819960955, 0.28248309923503434, 0.1343665368869602, 0.06975063639254883, -0.20927674214206377, 0.09821546142831614, 0.03580997992981913] |
1,803.03188 | Reexamination of group velocities of structured light pulses | Recently, a series of theoretical and experimental papers on free-space
propagation of pulsed Laguerre-Gaussian and Bessel beams was published, which
reached contradictory and controversial results about group velocities of such
pulses. Depending on themeasurement scheme, the group velocity can be defined
differently.We analyze how different versions of group velocity are related to
the measurable travel time (time of flight) of the pulse between input (source)
and output (detecting) planes. The analysis is tested on a theoretical
model---the Bessel-Gauss pulse whose propagation path exhibits both subluminal
and superluminal regions. Our main conclusion from resolving the contradictions
in the literature is that different versions of group velocity are appropriate,
depending on whether or not the beam is hollow and how the pulse is recorded in
the output plane---integrally or with spatial resolution.
| physics.optics | recently a series of theoretical and experimental papers on freespace propagation of pulsed laguerregaussian and bessel beams was published which reached contradictory and controversial results about group velocities of such pulses depending on themeasurement scheme the group velocity can be defined differentlywe analyze how different versions of group velocity are related to the measurable travel time time of flight of the pulse between input source and output detecting planes the analysis is tested on a theoretical modelthe besselgauss pulse whose propagation path exhibits both subluminal and superluminal regions our main conclusion from resolving the contradictions in the literature is that different versions of group velocity are appropriate depending on whether or not the beam is hollow and how the pulse is recorded in the output planeintegrally or with spatial resolution | [['recently', 'a', 'series', 'of', 'theoretical', 'and', 'experimental', 'papers', 'on', 'freespace', 'propagation', 'of', 'pulsed', 'laguerregaussian', 'and', 'bessel', 'beams', 'was', 'published', 'which', 'reached', 'contradictory', 'and', 'controversial', 'results', 'about', 'group', 'velocities', 'of', 'such', 'pulses', 'depending', 'on', 'themeasurement', 'scheme', 'the', 'group', 'velocity', 'can', 'be', 'defined', 'differentlywe', 'analyze', 'how', 'different', 'versions', 'of', 'group', 'velocity', 'are', 'related', 'to', 'the', 'measurable', 'travel', 'time', 'time', 'of', 'flight', 'of', 'the', 'pulse', 'between', 'input', 'source', 'and', 'output', 'detecting', 'planes', 'the', 'analysis', 'is', 'tested', 'on', 'a', 'theoretical', 'modelthe', 'besselgauss', 'pulse', 'whose', 'propagation', 'path', 'exhibits', 'both', 'subluminal', 'and', 'superluminal', 'regions', 'our', 'main', 'conclusion', 'from', 'resolving', 'the', 'contradictions', 'in', 'the', 'literature', 'is', 'that', 'different', 'versions', 'of', 'group', 'velocity', 'are', 'appropriate', 'depending', 'on', 'whether', 'or', 'not', 'the', 'beam', 'is', 'hollow', 'and', 'how', 'the', 'pulse', 'is', 'recorded', 'in', 'the', 'output', 'planeintegrally', 'or', 'with', 'spatial', 'resolution']] | [-0.12448826712495684, 0.16842840842565332, -0.13426311761434154, 0.01844281613034761, -0.10027769827613915, -0.13358932391073056, 0.0025779025473445837, 0.4767465487298534, -0.23831545456973047, -0.3111118473787242, 0.09000368629156898, -0.2575341916192088, -0.0391870785695244, 0.2528133024278236, -0.05751667306648465, 0.05191985226472781, 0.06936670707788055, 0.03508231042715625, -0.054999912163154696, -0.20078314999558441, 0.2934911789181899, 0.054482985236571996, 0.31175685074092363, 0.023942112851169282, 0.12614811734318382, -0.021133686049188687, -0.06464040046557784, -0.0067927662547179095, -0.08959325177872995, 0.08455626479364697, 0.18477401402082264, 0.11427819432496408, 0.2251749574992802, -0.43330603282839997, -0.23435812672292153, 0.05691850654355536, 0.14068403005449645, 0.09100144584621962, -0.0252441842966955, -0.33472451706981565, 0.03367714628973228, -0.0974027567000429, -0.12419522329651582, 0.005489518887942701, 0.03336063351144823, 0.10096921954729308, -0.19621174774814662, 0.07939691465406672, 0.005768229787083944, 0.0758393822170475, -0.027412033489516634, -0.08787826341980202, -0.02464128834723429, 0.10077661257163864, 0.0794905034539209, 0.031449228712159584, 0.1130874845433951, -0.09102002598389279, -0.12213122766230285, 0.3954685468842664, -0.042648449129476323, -0.1559467871185744, 0.17622515541596676, -0.18673147055215944, -0.04755512516080277, 0.13040649374272292, 0.18263032330350407, 0.08575530040745191, -0.08968619455942722, -0.021194935742377, -0.059719089925560485, 0.2158981403775924, 0.1714754151272052, 0.036677088001816294, 0.17205250069415828, 0.12869150701206267, 0.01923533652608437, 0.08356941396124866, -0.11122707043926591, -0.06389500545319463, -0.32644319205680555, -0.11302903678092197, -0.16588268461307204, 0.01724568151744673, -0.04868299307555554, -0.10385209017279227, 0.4409139075282515, 0.1489753792920392, 0.143252137681748, 0.007681088156330832, 0.29902146655450185, 0.12170557667020943, 0.009501698907230079, 0.05029950868045017, 0.23071889443631013, 0.14906788717654687, 0.07614394154135637, -0.22333265716892, 0.07728055044715329, 0.024428971647101595] |
1,803.03189 | Single nucleotide polymorphisms that modulate microRNA regulation of
gene expression in tumors | Genome-wide association studies (GWAS) have identified single nucleotide
polymorphisms (SNPs) associated with trait diversity and disease
susceptibility, yet the functional properties of many genetic variants and
their molecular interactions remains unclear. It has been hypothesized that
SNPs in microRNA binding sites may disrupt gene regulation by microRNAs
(miRNAs), short non-coding RNAs that bind to mRNA and downregulate the target
gene. While a number of studies have been conducted to predict the location of
SNPs in miRNA binding sites, to date there has been no comprehensive analysis
of how SNP variants may impact miRNA regulation of genes. Here we investigate
the functional properties of genetic variants and their effects on miRNA
regulation of gene expression in cancer. Our analysis is motivated by the
hypothesis that distinct alleles may cause differential binding (from miRNAs to
mRNAs or from transcription factors to DNA) and change the expression of genes.
We previously identified pathways--systems of genes conferring specific cell
functions--that are dysregulated by miRNAs in cancer, by comparing
miRNA-pathway associations between healthy and tumor tissue. We draw on these
results as a starting point to assess whether SNPs in genes on dysregulated
pathways are responsible for miRNA dysregulation of individual genes in tumors.
Using an integrative analysis that incorporates miRNA expression, mRNA
expression, and SNP genotype data, we identify SNPs that appear to influence
the association between miRNAs and genes, which we term "regulatory QTLs
(regQTLs)": loci whose alleles impact the regulation of genes by miRNAs. We
describe the method, apply it to analyze four cancer types (breast, liver,
lung, prostate) using data from The Cancer Genome Atlas (TCGA), and provide a
tool to explore the findings.
| q-bio.GN | genomewide association studies gwas have identified single nucleotide polymorphisms snps associated with trait diversity and disease susceptibility yet the functional properties of many genetic variants and their molecular interactions remains unclear it has been hypothesized that snps in microrna binding sites may disrupt gene regulation by micrornas mirnas short noncoding rnas that bind to mrna and downregulate the target gene while a number of studies have been conducted to predict the location of snps in mirna binding sites to date there has been no comprehensive analysis of how snp variants may impact mirna regulation of genes here we investigate the functional properties of genetic variants and their effects on mirna regulation of gene expression in cancer our analysis is motivated by the hypothesis that distinct alleles may cause differential binding from mirnas to mrnas or from transcription factors to dna and change the expression of genes we previously identified pathwayssystems of genes conferring specific cell functionsthat are dysregulated by mirnas in cancer by comparing mirnapathway associations between healthy and tumor tissue we draw on these results as a starting point to assess whether snps in genes on dysregulated pathways are responsible for mirna dysregulation of individual genes in tumors using an integrative analysis that incorporates mirna expression mrna expression and snp genotype data we identify snps that appear to influence the association between mirnas and genes which we term regulatory qtls regqtls loci whose alleles impact the regulation of genes by mirnas we describe the method apply it to analyze four cancer types breast liver lung prostate using data from the cancer genome atlas tcga and provide a tool to explore the findings | [['genomewide', 'association', 'studies', 'gwas', 'have', 'identified', 'single', 'nucleotide', 'polymorphisms', 'snps', 'associated', 'with', 'trait', 'diversity', 'and', 'disease', 'susceptibility', 'yet', 'the', 'functional', 'properties', 'of', 'many', 'genetic', 'variants', 'and', 'their', 'molecular', 'interactions', 'remains', 'unclear', 'it', 'has', 'been', 'hypothesized', 'that', 'snps', 'in', 'microrna', 'binding', 'sites', 'may', 'disrupt', 'gene', 'regulation', 'by', 'micrornas', 'mirnas', 'short', 'noncoding', 'rnas', 'that', 'bind', 'to', 'mrna', 'and', 'downregulate', 'the', 'target', 'gene', 'while', 'a', 'number', 'of', 'studies', 'have', 'been', 'conducted', 'to', 'predict', 'the', 'location', 'of', 'snps', 'in', 'mirna', 'binding', 'sites', 'to', 'date', 'there', 'has', 'been', 'no', 'comprehensive', 'analysis', 'of', 'how', 'snp', 'variants', 'may', 'impact', 'mirna', 'regulation', 'of', 'genes', 'here', 'we', 'investigate', 'the', 'functional', 'properties', 'of', 'genetic', 'variants', 'and', 'their', 'effects', 'on', 'mirna', 'regulation', 'of', 'gene', 'expression', 'in', 'cancer', 'our', 'analysis', 'is', 'motivated', 'by', 'the', 'hypothesis', 'that', 'distinct', 'alleles', 'may', 'cause', 'differential', 'binding', 'from', 'mirnas', 'to', 'mrnas', 'or', 'from', 'transcription', 'factors', 'to', 'dna', 'and', 'change', 'the', 'expression', 'of', 'genes', 'we', 'previously', 'identified', 'pathwayssystems', 'of', 'genes', 'conferring', 'specific', 'cell', 'functionsthat', 'are', 'dysregulated', 'by', 'mirnas', 'in', 'cancer', 'by', 'comparing', 'mirnapathway', 'associations', 'between', 'healthy', 'and', 'tumor', 'tissue', 'we', 'draw', 'on', 'these', 'results', 'as', 'a', 'starting', 'point', 'to', 'assess', 'whether', 'snps', 'in', 'genes', 'on', 'dysregulated', 'pathways', 'are', 'responsible', 'for', 'mirna', 'dysregulation', 'of', 'individual', 'genes', 'in', 'tumors', 'using', 'an', 'integrative', 'analysis', 'that', 'incorporates', 'mirna', 'expression', 'mrna', 'expression', 'and', 'snp', 'genotype', 'data', 'we', 'identify', 'snps', 'that', 'appear', 'to', 'influence', 'the', 'association', 'between', 'mirnas', 'and', 'genes', 'which', 'we', 'term', 'regulatory', 'qtls', 'regqtls', 'loci', 'whose', 'alleles', 'impact', 'the', 'regulation', 'of', 'genes', 'by', 'mirnas', 'we', 'describe', 'the', 'method', 'apply', 'it', 'to', 'analyze', 'four', 'cancer', 'types', 'breast', 'liver', 'lung', 'prostate', 'using', 'data', 'from', 'the', 'cancer', 'genome', 'atlas', 'tcga', 'and', 'provide', 'a', 'tool', 'to', 'explore', 'the', 'findings']] | [-0.07355031262691446, 0.0593505047027703, 0.01933631467150964, 0.16965400475391781, -0.05053527004040805, -0.17223508212873473, 0.18040199573125992, 0.3881882393519597, -0.19843947829341865, -0.234158116665143, -0.033406052295963974, -0.31810374682549236, -0.2889071630998738, 0.15114272033496728, -0.08986719922640282, -0.03812843233303337, 0.15658538412075915, 0.036355276827806114, 0.20019085874791323, -0.24763721359096386, 0.25173445450781234, 0.06972695349476053, 0.28130785821648346, 0.022822151300789465, 0.11558823921714266, -0.10956138213306006, -0.0667876004438153, -0.03417216451100599, -0.1552809526423704, 0.21409197949632106, 0.41180149429392693, 0.2712706725578755, 0.34048740781596226, -0.4416548270470982, -0.22464310391582687, 0.13807342981411028, 0.1987018448470772, 0.1931616410065779, -0.042696461686966516, -0.2802983067901393, 0.09095738757817536, -0.11534864279034297, -0.013115033729867907, -0.10930271276162862, 0.026591327435739092, 0.07802269686137178, -0.23882078888698918, 0.2199658541003675, -0.08749993284154732, 0.1985142027196299, -0.1229616106020431, -0.1780812040790125, -0.09801214046125915, 0.24711451626973865, 0.1608754248530999, 0.017126516870315776, 0.2832287406751618, -0.11792693782006683, -0.17564640583589028, 0.25448564331930446, 0.057279504668070656, -0.2237250543965415, 0.23144573705078436, -0.12260626400803727, -0.24873543427174574, 0.12892879453931017, 0.1664117243599724, 0.04124255400285042, -0.3238502625496053, -0.04023735595581799, 0.040264507466102384, 0.22745326404406938, 0.17025831774842834, -0.04074519175719951, 0.16638971992439291, 0.2139271918883568, -0.06976889312629007, 0.1040646848526553, -0.17361788539240838, -0.056816597060193874, -0.14454118873600974, -0.13228498708939598, -0.04398409633459506, 0.026361888818824286, -0.07592368142706611, -0.2109071014911225, 0.39564746424102143, 0.04691085389715824, 0.14738845454792687, 0.06233614084879589, 0.13962023321546038, -0.0688915067941734, 0.20844372149687468, -0.08062002407489997, 0.08537701391434552, 0.08689035559161154, -0.02640961879104843, -0.34463071971495957, 0.258267909676529, 0.004033806427069201] |
1,803.0319 | Dynamic IoT Choreographies | The Internet of Things is growing at a dramatic rate and extending into
various application domains. We have designed, implemented and evaluated a
resilient and decentralized system using IoT concepts. We applied it to
maintaining the functionality of building automation systems, so that new
devices can appear and vanish on-the-fly.
| cs.DC | the internet of things is growing at a dramatic rate and extending into various application domains we have designed implemented and evaluated a resilient and decentralized system using iot concepts we applied it to maintaining the functionality of building automation systems so that new devices can appear and vanish onthefly | [['the', 'internet', 'of', 'things', 'is', 'growing', 'at', 'a', 'dramatic', 'rate', 'and', 'extending', 'into', 'various', 'application', 'domains', 'we', 'have', 'designed', 'implemented', 'and', 'evaluated', 'a', 'resilient', 'and', 'decentralized', 'system', 'using', 'iot', 'concepts', 'we', 'applied', 'it', 'to', 'maintaining', 'the', 'functionality', 'of', 'building', 'automation', 'systems', 'so', 'that', 'new', 'devices', 'can', 'appear', 'and', 'vanish', 'onthefly']] | [-0.1913295028405264, 0.03886264529312029, -0.043227721182629464, 0.00948870309861377, -0.0991250341013074, -0.16126994071528317, 0.04686786239821231, 0.39102604596351737, -0.2699864144995809, -0.2906287736445665, 0.16066133560612797, -0.24092425875365733, -0.18665295804850757, 0.26375369550660255, -0.07521916007623076, 0.10022336980327964, 0.031144233932718635, -0.02747284104581922, -0.01428151003376115, -0.273718217946589, 0.28012331686913966, 0.03028716057538986, 0.3497242333739996, 0.08904790068976581, 0.10898143510334193, -0.00640170673141256, -0.022792075546458363, 0.059387873485684396, -0.07092447302144138, 0.15694655628874898, 0.32556679216679185, 0.19784565467387438, 0.3114222526270896, -0.48341552849859, -0.18703864760696887, 0.0778315144404769, 0.19639929805416614, 0.10189322393387557, -0.08985916833393276, -0.32858837641775607, 0.15937898932024835, -0.26193610358983277, -0.12253247370448662, -0.12693625947460532, 0.0027573085948824883, 0.04665037387982011, -0.21802007289603353, -0.05513783792965114, 0.02871174717321992, 0.040781520530581476, -0.02489560201211134, -0.06934497681213543, -0.01667721456149593, 0.21358722357079388, -0.019702261821366848, 0.0035735311266034842, 0.2314251115452498, -0.10572000574320554, -0.13171358425170182, 0.36545138731598853, -0.0014863949222490192, -0.12790421111509204, 0.24228630180470645, -0.02208432825282216, -0.16113233678042888, 0.0839262801874429, 0.24220867853611708, 0.07918962478637695, -0.16169337142258883, 0.08564489619340748, 0.08149858467280864, 0.16693663893267513, 0.05231007625348866, 0.07690924347378314, 0.20237581244204195, 0.24132918167859316, 0.10482480567530729, 0.1309456900600344, -0.005273966547101736, -0.0940004951134324, -0.20952384099829943, -0.16634692694991826, -0.16393755144206806, -0.013950948305428028, -0.02099725009757094, -0.11837242484092712, 0.3715817978978157, 0.2161995846312493, 0.14207830300554633, 0.04110693915281445, 0.3362954617291689, 0.09238144733011723, 0.21251499727368356, 0.11273372351191938, 0.17226406186819077, 0.03840582934208214, 0.2116507920343429, -0.11221780356951058, 0.07763416293892078, -0.024333469988778233] |
1,803.03191 | A Bayesian and Machine Learning approach to estimating Influence Model
parameters for IM-RO | The rise of Online Social Networks (OSNs) has caused an insurmountable amount
of interest from advertisers and researchers seeking to monopolize on its
features. Researchers aim to develop strategies for determining how information
is propagated among users within an OSN that is captured by diffusion or
influence models. We consider the influence models for the IM-RO problem, a
novel formulation to the Influence Maximization (IM) problem based on
implementing Stochastic Dynamic Programming (SDP). In contrast to existing
approaches involving influence spread and the theory of submodular functions,
the SDP method focuses on optimizing clicks and ultimately revenue to
advertisers in OSNs. Existing approaches to influence maximization have been
actively researched over the past decade, with applications to multiple fields,
however, our approach is a more practical variant to the original IM problem.
In this paper, we provide an analysis on the influence models of the IM-RO
problem by conducting experiments on synthetic and real-world datasets. We
propose a Bayesian and Machine Learning approach for estimating the parameters
of the influence models for the (Influence Maximization- Revenue Optimization)
IM-RO problem. We present a Bayesian hierarchical model and implement the
well-known Naive Bayes classifier (NBC), Decision Trees classifier (DTC) and
Random Forest classifier (RFC) on three real-world datasets. Compared to
previous approaches to estimating influence model parameters, our strategy has
the great advantage of being directly implementable in standard software
packages such as WinBUGS/OpenBUGS/JAGS and Apache Spark. We demonstrate the
efficiency and usability of our methods in terms of spreading information and
generating revenue for advertisers in the context of OSNs.
| stat.ML cs.LG | the rise of online social networks osns has caused an insurmountable amount of interest from advertisers and researchers seeking to monopolize on its features researchers aim to develop strategies for determining how information is propagated among users within an osn that is captured by diffusion or influence models we consider the influence models for the imro problem a novel formulation to the influence maximization im problem based on implementing stochastic dynamic programming sdp in contrast to existing approaches involving influence spread and the theory of submodular functions the sdp method focuses on optimizing clicks and ultimately revenue to advertisers in osns existing approaches to influence maximization have been actively researched over the past decade with applications to multiple fields however our approach is a more practical variant to the original im problem in this paper we provide an analysis on the influence models of the imro problem by conducting experiments on synthetic and realworld datasets we propose a bayesian and machine learning approach for estimating the parameters of the influence models for the influence maximization revenue optimization imro problem we present a bayesian hierarchical model and implement the wellknown naive bayes classifier nbc decision trees classifier dtc and random forest classifier rfc on three realworld datasets compared to previous approaches to estimating influence model parameters our strategy has the great advantage of being directly implementable in standard software packages such as winbugsopenbugsjags and apache spark we demonstrate the efficiency and usability of our methods in terms of spreading information and generating revenue for advertisers in the context of osns | [['the', 'rise', 'of', 'online', 'social', 'networks', 'osns', 'has', 'caused', 'an', 'insurmountable', 'amount', 'of', 'interest', 'from', 'advertisers', 'and', 'researchers', 'seeking', 'to', 'monopolize', 'on', 'its', 'features', 'researchers', 'aim', 'to', 'develop', 'strategies', 'for', 'determining', 'how', 'information', 'is', 'propagated', 'among', 'users', 'within', 'an', 'osn', 'that', 'is', 'captured', 'by', 'diffusion', 'or', 'influence', 'models', 'we', 'consider', 'the', 'influence', 'models', 'for', 'the', 'imro', 'problem', 'a', 'novel', 'formulation', 'to', 'the', 'influence', 'maximization', 'im', 'problem', 'based', 'on', 'implementing', 'stochastic', 'dynamic', 'programming', 'sdp', 'in', 'contrast', 'to', 'existing', 'approaches', 'involving', 'influence', 'spread', 'and', 'the', 'theory', 'of', 'submodular', 'functions', 'the', 'sdp', 'method', 'focuses', 'on', 'optimizing', 'clicks', 'and', 'ultimately', 'revenue', 'to', 'advertisers', 'in', 'osns', 'existing', 'approaches', 'to', 'influence', 'maximization', 'have', 'been', 'actively', 'researched', 'over', 'the', 'past', 'decade', 'with', 'applications', 'to', 'multiple', 'fields', 'however', 'our', 'approach', 'is', 'a', 'more', 'practical', 'variant', 'to', 'the', 'original', 'im', 'problem', 'in', 'this', 'paper', 'we', 'provide', 'an', 'analysis', 'on', 'the', 'influence', 'models', 'of', 'the', 'imro', 'problem', 'by', 'conducting', 'experiments', 'on', 'synthetic', 'and', 'realworld', 'datasets', 'we', 'propose', 'a', 'bayesian', 'and', 'machine', 'learning', 'approach', 'for', 'estimating', 'the', 'parameters', 'of', 'the', 'influence', 'models', 'for', 'the', 'influence', 'maximization', 'revenue', 'optimization', 'imro', 'problem', 'we', 'present', 'a', 'bayesian', 'hierarchical', 'model', 'and', 'implement', 'the', 'wellknown', 'naive', 'bayes', 'classifier', 'nbc', 'decision', 'trees', 'classifier', 'dtc', 'and', 'random', 'forest', 'classifier', 'rfc', 'on', 'three', 'realworld', 'datasets', 'compared', 'to', 'previous', 'approaches', 'to', 'estimating', 'influence', 'model', 'parameters', 'our', 'strategy', 'has', 'the', 'great', 'advantage', 'of', 'being', 'directly', 'implementable', 'in', 'standard', 'software', 'packages', 'such', 'as', 'winbugsopenbugsjags', 'and', 'apache', 'spark', 'we', 'demonstrate', 'the', 'efficiency', 'and', 'usability', 'of', 'our', 'methods', 'in', 'terms', 'of', 'spreading', 'information', 'and', 'generating', 'revenue', 'for', 'advertisers', 'in', 'the', 'context', 'of', 'osns']] | [-0.06049011089584552, -0.05168932849071359, -0.054902922241612834, 0.08694820188693414, -0.13384278986761852, -0.16176729194439546, 0.09776656636192153, 0.42761429778278565, -0.2852682668188688, -0.3337292213844814, 0.09222850917031729, -0.31607678765972513, -0.2014930350029148, 0.19027470653997816, -0.09165263978327631, 0.07899667554044944, 0.06848088757265772, 0.020157552142505707, -0.032689106360965864, -0.3265221618836053, 0.3134394929484399, 0.08557593077511433, 0.34308822903973446, 0.06370096431788808, 0.0900638280039321, 0.033843739644097266, -0.041445696830448096, 0.02778043747922882, -0.11604550552149795, 0.15942042997935355, 0.293878460079876, 0.24916324756097394, 0.39668720280534997, -0.4105953035872545, -0.23494570350451321, 0.13005723567073083, 0.13835135520994934, 0.07689801114712852, -0.044903097952485475, -0.2931128778826994, 0.0546559008802179, -0.18691217365977897, 0.00327394512489207, -0.08979924946712951, -0.029453947612214402, -0.005183919873485674, -0.30581611692824207, 0.01171377947817506, 0.013086520583466302, 0.0486115890324058, -0.050406661074583296, -0.13661388375673644, 0.049213710541533694, 0.1416693174834327, 0.09870931810179144, -0.007631962424931081, 0.16530537176624577, -0.16182914663777623, -0.2012630992509468, 0.367816388722538, -0.03828863061192019, -0.20622648678488972, 0.16316704152155553, -0.0003700423769133036, -0.14480992804584636, 0.07700611724989316, 0.2919184269325793, 0.14885097680353496, -0.18474646279445756, 0.05317380566189658, -0.04882103949875477, 0.14042773588841181, 0.011324831149215961, -0.012444397746837994, 0.1778392727539131, 0.23939031314952192, 0.07183014780423756, 0.13915506711901102, -0.04462399112436083, -0.14188686060870803, -0.1327858015075019, -0.09945572550451859, -0.16668333291967738, -0.004396789754170549, -0.11337323863789811, -0.16465140793331748, 0.4125246742001172, 0.25003191710688, 0.12464784761726524, 0.09023443495057426, 0.35325474582085487, 0.07316477125593598, 0.06226690131119568, 0.1003318340607825, 0.20248576544893926, 0.038748516881650735, 0.1367590108199601, -0.1760947530856356, 0.14357363641561666, 0.03213135287812694] |
1,803.03192 | On the Production of an Isotensor Dibaryon in the $pp \to pp\pi^+\pi^-$
Reaction | Exclusive measurements of the quasi-free $pp \to pp\pi^+\pi^-$ reaction have
been performed by means of $pd$ collisions at $T_p$ = 1.2 GeV using the WASA
detector setup at COSY. Total and differential cross sections have been
obtained covering the energy region $T_p = 1.08 - 1.36$ GeV ($\sqrt s$ = 2.35 -
2.46 GeV), which includes the regions of $N^*(1440)$ and
$\Delta(1232)\Delta(1232)$ resonance excitations. Calculations describing these
excitations by $t$-channel meson exchange are at variance with experimental
differential cross sections and underpredict substantially the measured total
cross section. An isotensor $\Delta N$ dibaryon resonance with $I(J^P) =
2(1^+)$ produced associatedly with a pion is able to overcome these
deficiencies. Such a dibaryon was predicted by Dyson and Xuong and more
recently calculated by Gal and Garcilazo.
| nucl-ex hep-ex | exclusive measurements of the quasifree pp to pppipi reaction have been performed by means of pd collisions at t_p 12 gev using the wasa detector setup at cosy total and differential cross sections have been obtained covering the energy region t_p 108 136 gev sqrt s 235 246 gev which includes the regions of n1440 and delta1232delta1232 resonance excitations calculations describing these excitations by tchannel meson exchange are at variance with experimental differential cross sections and underpredict substantially the measured total cross section an isotensor delta n dibaryon resonance with ijp 21 produced associatedly with a pion is able to overcome these deficiencies such a dibaryon was predicted by dyson and xuong and more recently calculated by gal and garcilazo | [['exclusive', 'measurements', 'of', 'the', 'quasifree', 'pp', 'to', 'pppipi', 'reaction', 'have', 'been', 'performed', 'by', 'means', 'of', 'pd', 'collisions', 'at', 't_p', '12', 'gev', 'using', 'the', 'wasa', 'detector', 'setup', 'at', 'cosy', 'total', 'and', 'differential', 'cross', 'sections', 'have', 'been', 'obtained', 'covering', 'the', 'energy', 'region', 't_p', '108', '136', 'gev', 'sqrt', 's', '235', '246', 'gev', 'which', 'includes', 'the', 'regions', 'of', 'n1440', 'and', 'delta1232delta1232', 'resonance', 'excitations', 'calculations', 'describing', 'these', 'excitations', 'by', 'tchannel', 'meson', 'exchange', 'are', 'at', 'variance', 'with', 'experimental', 'differential', 'cross', 'sections', 'and', 'underpredict', 'substantially', 'the', 'measured', 'total', 'cross', 'section', 'an', 'isotensor', 'delta', 'n', 'dibaryon', 'resonance', 'with', 'ijp', '21', 'produced', 'associatedly', 'with', 'a', 'pion', 'is', 'able', 'to', 'overcome', 'these', 'deficiencies', 'such', 'a', 'dibaryon', 'was', 'predicted', 'by', 'dyson', 'and', 'xuong', 'and', 'more', 'recently', 'calculated', 'by', 'gal', 'and', 'garcilazo']] | [-0.051543631641332716, 0.21593179788296452, -0.05472567289137354, 0.11400487348296807, 0.03570004580301586, -0.11470965026869792, 0.022706816090343133, 0.3371527777595349, -0.14278080882022864, -0.35640580110765735, -0.08924830907249245, -0.420369021614596, 0.06264607542282741, 0.15126552471714416, 0.12527625380131086, 0.12640523901690953, 0.07475384959754341, 0.04460953557984261, -0.015650817588501578, -0.20520580602520755, 0.2722683399735051, 0.10914788027454553, 0.17494001234219217, 0.16316899944674865, 0.07308032258076529, 0.058020041803909655, -0.028626164345167064, -0.07081241189534294, -0.17984499744187785, 0.05992556122108563, 0.30283635398092007, -0.0003072186614033477, 0.10281658766726995, -0.34156846120985673, -0.11425421062599996, 0.08918441074136604, 0.15414227541648493, 0.029420057619753262, -0.010534465608637628, -0.32301807967175183, 0.13818141241188578, -0.23555470942037887, -0.10469337900426111, -0.04078511380116809, 0.05979266919793786, -0.025979426890162045, -0.2933786554775875, 0.08176684333011508, -0.0697741028024807, 0.11082753295836326, -0.04441219023910576, -0.28467796652192445, -0.08229788100941042, -0.055426541466972436, 0.0413531309278714, 0.09729240492015379, 0.2100813158924274, -0.0650943608057348, -0.166447369064654, 0.32001686596375856, -0.039283063712305034, -0.10302314605435421, 0.09083621611754442, -0.20503963409633985, -0.09496922119358024, 0.27290516838045986, 0.1485969400573281, 0.07700085271940695, -0.2236984316901914, 0.10370650715375287, 0.0043013781863104165, 0.18236479253692808, 0.17654501684090315, -0.005479014280918536, 0.11790556215745365, 0.14541915574428177, -0.05653549222564646, 0.0029706240557375013, -0.18427242540176317, -0.08005128343236344, -0.350267145032031, -0.07196269917366063, -0.06277965112781987, 0.09555266858660616, 0.016808997905674663, 0.03665382095516242, 0.29291358953020696, 0.0010285708041668966, 0.3255849132185866, -0.05221692576215618, 0.2485481319860716, 0.1615301274266977, 0.10260936342067374, 0.07867427533861261, 0.32330465284356813, 0.22630532787598925, 0.1548868617091071, -0.22952444693635635, -0.0021172379874142594, 0.013102514896108287] |
1,803.03193 | An Isotensor Dibaryon in the $pp \to pp\pi^+\pi^-$ Reaction? | Exclusive measurements of the quasi-free $pp \to pp\pi^+\pi^-$ reaction have
been carried out at WASA@COSY by means of $pd$ collisions at $T_p$ = 1.2 GeV.
Total and differential cross sections have been extracted covering the energy
region $T_p = 1.08 - 1.36$ GeV, which is the region of $N^*(1440)$ and
$\Delta(1232)\Delta(1232)$ resonance excitations. Calculations describing these
excitations by $t$-channel meson exchange are at variance with the measured
differential cross sections and underpredict substantially the experimental
total cross section. An isotensor $\Delta N$ dibaryon resonance with $I(J^P) =
2(1^+)$ produced associatedly with a pion is able to overcome these
deficiencies.
| nucl-ex hep-ex | exclusive measurements of the quasifree pp to pppipi reaction have been carried out at wasacosy by means of pd collisions at t_p 12 gev total and differential cross sections have been extracted covering the energy region t_p 108 136 gev which is the region of n1440 and delta1232delta1232 resonance excitations calculations describing these excitations by tchannel meson exchange are at variance with the measured differential cross sections and underpredict substantially the experimental total cross section an isotensor delta n dibaryon resonance with ijp 21 produced associatedly with a pion is able to overcome these deficiencies | [['exclusive', 'measurements', 'of', 'the', 'quasifree', 'pp', 'to', 'pppipi', 'reaction', 'have', 'been', 'carried', 'out', 'at', 'wasacosy', 'by', 'means', 'of', 'pd', 'collisions', 'at', 't_p', '12', 'gev', 'total', 'and', 'differential', 'cross', 'sections', 'have', 'been', 'extracted', 'covering', 'the', 'energy', 'region', 't_p', '108', '136', 'gev', 'which', 'is', 'the', 'region', 'of', 'n1440', 'and', 'delta1232delta1232', 'resonance', 'excitations', 'calculations', 'describing', 'these', 'excitations', 'by', 'tchannel', 'meson', 'exchange', 'are', 'at', 'variance', 'with', 'the', 'measured', 'differential', 'cross', 'sections', 'and', 'underpredict', 'substantially', 'the', 'experimental', 'total', 'cross', 'section', 'an', 'isotensor', 'delta', 'n', 'dibaryon', 'resonance', 'with', 'ijp', '21', 'produced', 'associatedly', 'with', 'a', 'pion', 'is', 'able', 'to', 'overcome', 'these', 'deficiencies']] | [-0.06689643934876058, 0.20869386910791984, -0.051311833566487816, 0.11622840547884103, 0.0310260557008767, -0.09026147988224302, 0.025798377641026052, 0.3356051214955627, -0.17275187496336236, -0.33111462219347876, -0.09680172622764624, -0.43498315332177023, 0.07667193777849196, 0.13830247422009306, 0.14178849119249912, 0.10736447162750948, 0.08405090555403462, 0.05660910766211248, -0.008076076846449606, -0.20916775114313568, 0.29697399265984054, 0.09931378703444235, 0.18002384153985848, 0.18728348168153916, 0.06497422653821207, 0.053489233855338346, -0.024608502114411963, -0.0758697430412936, -0.18087260898763455, 0.06361380507149333, 0.3288348177598128, -0.012783380595826975, 0.09709100381180805, -0.33894125024677924, -0.12031932582738258, 0.10120568248713689, 0.1783851606180511, 0.04430045307018063, 0.008652989261893815, -0.30301277069074495, 0.1249422092611591, -0.21743841367142816, -0.0966804837808013, -0.05623322146974744, 0.043019063780785245, -0.024539668203121232, -0.28298305846270055, 0.09214210127710655, -0.06853910899778667, 0.10732590201865037, -0.043075723884006344, -0.2732606490132629, -0.10044363221674356, -0.023959827644409994, 0.05926464205127089, 0.084432640059423, 0.22753025505751853, -0.07458214882025195, -0.1508214607163863, 0.31387736632298396, -0.02785107907989333, -0.12735285301522542, 0.08395396247355928, -0.21606346220779482, -0.10672171880310823, 0.29758185360540623, 0.17445530440603252, 0.07406192766477464, -0.2199861620282454, 0.08544429163110533, 0.010060387973984083, 0.1943854331890101, 0.16155014066426185, 0.017571340641757895, 0.13993343449528178, 0.14486692038549973, -0.06274270355421048, -0.01864003252002701, -0.1817658508737241, -0.10707464352530498, -0.3629662097702103, -0.07222644939658142, -0.039343353861602405, 0.10295994963211517, 0.021269162722972162, 0.02073403269613302, 0.2746523421017393, 0.014791840817579019, 0.33167454392038365, -0.05139585523252746, 0.2610349968396207, 0.1742157515636595, 0.11183771371130422, 0.0570092407962425, 0.3345186574564826, 0.23894780903794272, 0.15698148333217188, -0.2445957953090309, 0.01378447005415075, -0.001823827884690736] |
1,803.03194 | Universal dielectric response across a continuous metal-insulator
transition | A wide range of disordered materials, including disordered correlated
systems, show "Universal Dielectric Response" (UDR), followed by a superlinear
power-law increase in their optical responses over exceptionally broad
frequency regimes. While extensively used in various contexts over the years,
the microscopics underpinning UDR remains controversial. Here, we investigate
the optical response of the simplest model of correlated fermions,
Falicov-Kimball model (FKM), across the continuous metal-insulator transition
(MIT) and analyze the associated quantum criticality in detail using cluster
extension of dynamical mean field theory (CDMFT). Surprisingly, we find that
UDR naturally emerges in the quantum critical region associated with the
continuous MIT. We tie the emergence of these novel features to a many-body
orthogonality catastrophe accompanying the onset of strongly correlated
electronic glassy dynamics close to the MIT, providing a microscopic
realization of Jonscher's time-honored proposal as well as a rationale for
similarities in optical responses between correlated electronic matter and
canonical glass formers.
| cond-mat.str-el cond-mat.dis-nn | a wide range of disordered materials including disordered correlated systems show universal dielectric response udr followed by a superlinear powerlaw increase in their optical responses over exceptionally broad frequency regimes while extensively used in various contexts over the years the microscopics underpinning udr remains controversial here we investigate the optical response of the simplest model of correlated fermions falicovkimball model fkm across the continuous metalinsulator transition mit and analyze the associated quantum criticality in detail using cluster extension of dynamical mean field theory cdmft surprisingly we find that udr naturally emerges in the quantum critical region associated with the continuous mit we tie the emergence of these novel features to a manybody orthogonality catastrophe accompanying the onset of strongly correlated electronic glassy dynamics close to the mit providing a microscopic realization of jonschers timehonored proposal as well as a rationale for similarities in optical responses between correlated electronic matter and canonical glass formers | [['a', 'wide', 'range', 'of', 'disordered', 'materials', 'including', 'disordered', 'correlated', 'systems', 'show', 'universal', 'dielectric', 'response', 'udr', 'followed', 'by', 'a', 'superlinear', 'powerlaw', 'increase', 'in', 'their', 'optical', 'responses', 'over', 'exceptionally', 'broad', 'frequency', 'regimes', 'while', 'extensively', 'used', 'in', 'various', 'contexts', 'over', 'the', 'years', 'the', 'microscopics', 'underpinning', 'udr', 'remains', 'controversial', 'here', 'we', 'investigate', 'the', 'optical', 'response', 'of', 'the', 'simplest', 'model', 'of', 'correlated', 'fermions', 'falicovkimball', 'model', 'fkm', 'across', 'the', 'continuous', 'metalinsulator', 'transition', 'mit', 'and', 'analyze', 'the', 'associated', 'quantum', 'criticality', 'in', 'detail', 'using', 'cluster', 'extension', 'of', 'dynamical', 'mean', 'field', 'theory', 'cdmft', 'surprisingly', 'we', 'find', 'that', 'udr', 'naturally', 'emerges', 'in', 'the', 'quantum', 'critical', 'region', 'associated', 'with', 'the', 'continuous', 'mit', 'we', 'tie', 'the', 'emergence', 'of', 'these', 'novel', 'features', 'to', 'a', 'manybody', 'orthogonality', 'catastrophe', 'accompanying', 'the', 'onset', 'of', 'strongly', 'correlated', 'electronic', 'glassy', 'dynamics', 'close', 'to', 'the', 'mit', 'providing', 'a', 'microscopic', 'realization', 'of', 'jonschers', 'timehonored', 'proposal', 'as', 'well', 'as', 'a', 'rationale', 'for', 'similarities', 'in', 'optical', 'responses', 'between', 'correlated', 'electronic', 'matter', 'and', 'canonical', 'glass', 'formers']] | [-0.11638267866634076, 0.19068945930308961, -0.07112793534160196, 0.08663436333995823, -0.023112073840476036, -0.16868199744745724, 0.06474040596505469, 0.3842816170308057, -0.25678499462996046, -0.24625418123369122, 0.04120820014071012, -0.28273276323026497, -0.23013825152142375, 0.14626601878918855, 0.008276012832461705, 0.05727554494941157, -0.06443710832740941, -0.014051461193613172, -0.12104654423375097, -0.16600831743144107, 0.268524425390353, 0.025041790835839375, 0.3278786160289219, 0.07173963794956482, 0.06590128965748876, 0.035492173365615554, 0.06292147675736083, 0.031756281454018716, -0.13179576289833383, 0.04491283403697357, 0.27867233011646353, -0.025078195646356525, 0.25447997485425017, -0.39972073013827303, -0.274818440187065, 0.043662971606952886, 0.11921453100379581, 0.0974646951513231, -0.05193809753917675, -0.28568247422648996, -0.01845829171941576, -0.1978868873108154, -0.1500337445846716, -0.09409905167135221, 0.010388982991286206, 0.021070681560671968, -0.20655776050818317, 0.14757826190222711, 0.03050709823188311, 0.12208625096584262, -0.10538346362569856, -0.04654054335178503, 0.00814868163034393, 0.0845599482733805, -0.012283596953375607, 0.02159885002309274, 0.1558439057789061, -0.17938023988839263, -0.12010552259040327, 0.39012981211048325, -0.055956289880555975, -0.03066505606779281, 0.2516999952358139, -0.1621035399943365, -0.11502576935153723, 0.12472911919025838, 0.14221855691631075, 0.03809404623347754, -0.1502051473666725, 0.06578094184511261, -0.023445642815014114, 0.17182743461084327, -0.018700148204183267, 0.11190983439716541, 0.27850058745422396, 0.20842414548364924, -0.0362381590788977, 0.1751767083685967, -0.038936970616216024, -0.1885020625899284, -0.249825926528014, -0.10412828545116522, -0.1876559029652865, 0.05285376405002537, -0.08572020189470636, -0.22420714533845193, 0.43601556152738385, 0.17327896930928666, 0.19324079463927965, -0.007554160486001315, 0.17283948380926173, 0.09096250391650482, 0.022697888428856637, 0.02532482133064346, 0.23566220337442265, 0.1532643093602744, 0.13793580284573478, -0.2672047023083162, 0.06061047756225723, 0.00905738193754813] |
1,803.03195 | Synchronization crossover of polariton condensates in weakly disordered
lattices | We demonstrate that the synchronization of a lattice of solid-state
condensates when inter-site tunnelling is switched on, depends strongly on the
weak local disorder. This finding is vital for implementation of condensate
arrays as computation devices. The condensates here are nonlinear bosonic
fluids of exciton-polaritons trapped in a weakly disordered Bose-Hubbard
potential, where the nearest neighboring tunneling rate (Josephson coupling)
can be dynamically tuned. The system can thus be tuned from a localized to a
delocalized fluid as the number density, or the Josephson coupling between
nearest neighbors increases. The localized fluid is observed as a lattice of
unsynchronized condensates emitting at different energies set by the disorder
potential. In the delocalized phase the condensates synchronize, and long-range
order appears, evidenced by narrowing of momentum and energy distributions, new
diffraction peaks in momentum space, and spatial coherence between condensates.
Our work identifies similarities and differences of this nonequilibrium
crossover to the traditional Bose-glass to superfluid transition in atomic
condensates.
| cond-mat.other | we demonstrate that the synchronization of a lattice of solidstate condensates when intersite tunnelling is switched on depends strongly on the weak local disorder this finding is vital for implementation of condensate arrays as computation devices the condensates here are nonlinear bosonic fluids of excitonpolaritons trapped in a weakly disordered bosehubbard potential where the nearest neighboring tunneling rate josephson coupling can be dynamically tuned the system can thus be tuned from a localized to a delocalized fluid as the number density or the josephson coupling between nearest neighbors increases the localized fluid is observed as a lattice of unsynchronized condensates emitting at different energies set by the disorder potential in the delocalized phase the condensates synchronize and longrange order appears evidenced by narrowing of momentum and energy distributions new diffraction peaks in momentum space and spatial coherence between condensates our work identifies similarities and differences of this nonequilibrium crossover to the traditional boseglass to superfluid transition in atomic condensates | [['we', 'demonstrate', 'that', 'the', 'synchronization', 'of', 'a', 'lattice', 'of', 'solidstate', 'condensates', 'when', 'intersite', 'tunnelling', 'is', 'switched', 'on', 'depends', 'strongly', 'on', 'the', 'weak', 'local', 'disorder', 'this', 'finding', 'is', 'vital', 'for', 'implementation', 'of', 'condensate', 'arrays', 'as', 'computation', 'devices', 'the', 'condensates', 'here', 'are', 'nonlinear', 'bosonic', 'fluids', 'of', 'excitonpolaritons', 'trapped', 'in', 'a', 'weakly', 'disordered', 'bosehubbard', 'potential', 'where', 'the', 'nearest', 'neighboring', 'tunneling', 'rate', 'josephson', 'coupling', 'can', 'be', 'dynamically', 'tuned', 'the', 'system', 'can', 'thus', 'be', 'tuned', 'from', 'a', 'localized', 'to', 'a', 'delocalized', 'fluid', 'as', 'the', 'number', 'density', 'or', 'the', 'josephson', 'coupling', 'between', 'nearest', 'neighbors', 'increases', 'the', 'localized', 'fluid', 'is', 'observed', 'as', 'a', 'lattice', 'of', 'unsynchronized', 'condensates', 'emitting', 'at', 'different', 'energies', 'set', 'by', 'the', 'disorder', 'potential', 'in', 'the', 'delocalized', 'phase', 'the', 'condensates', 'synchronize', 'and', 'longrange', 'order', 'appears', 'evidenced', 'by', 'narrowing', 'of', 'momentum', 'and', 'energy', 'distributions', 'new', 'diffraction', 'peaks', 'in', 'momentum', 'space', 'and', 'spatial', 'coherence', 'between', 'condensates', 'our', 'work', 'identifies', 'similarities', 'and', 'differences', 'of', 'this', 'nonequilibrium', 'crossover', 'to', 'the', 'traditional', 'boseglass', 'to', 'superfluid', 'transition', 'in', 'atomic', 'condensates']] | [-0.2069953336269132, 0.28406740881578774, -0.024708276728765584, 0.04664726814463055, 0.004074166473235536, -0.18947506381737642, 0.07082540641462653, 0.3767344530952989, -0.26297158922461217, -0.2412438656894619, -0.02112735995624519, -0.30952091451218855, -0.09731088432998825, 0.11730223107913146, 0.05868360473655029, 0.012208686737378812, -0.011842006419158582, -0.024110615647356934, -0.05597946086880874, -0.2108360729502432, 0.3254480748876648, -0.004924421443211488, 0.3236654819657077, 0.09936063823952053, 0.03258161911808259, -0.01428049240179313, 0.10890230196440276, 0.010008080879851602, -0.10478267742419921, 0.04478368125914496, 0.23668061653386402, -0.06798196712336005, 0.24381432309161005, -0.4440376720561078, -0.21638792857480874, 0.08591677155492113, 0.2371129743423922, 0.185672041591046, -0.01977694850289058, -0.34852476309144387, -0.04962204247947384, -0.14229446742171128, -0.13158295093440675, -0.12883608518053014, 0.029202589612899336, 0.07644084170050684, -0.263115640001887, 0.13004342989949216, 0.04713708998155106, 0.04467338427854409, -0.03908442593673493, -0.016365292536990962, -0.06595289433058703, 0.06646928313988519, -0.016690945069733187, 0.045805613169118575, 0.17402901537657814, -0.14819873508165515, -0.08178950924757258, 0.37414032118922136, -0.08116872380150822, -0.1339168654499962, 0.2229558662438191, -0.15327822694953228, -0.017311813998945443, 0.14835986325739878, 0.1403481429969927, 0.07377722044475377, -0.1332793867039976, 0.040440366178042246, -0.0004557115941033142, 0.19952688071255884, 0.07165392534697498, 0.11384142822521569, 0.29665437252290033, 0.22216527941988184, 0.043994456304108386, 0.15818279188378193, -0.10274261079295524, -0.1612774196927254, -0.23969443574102609, -0.11574464043567204, -0.2873452811402345, 0.029725035945387005, -0.07802755913057265, -0.17341234467619057, 0.3804772451736689, 0.14734556893935227, 0.20078688499125294, -0.040762499241585225, 0.26618674779662266, 0.12331504717481297, 0.050063922705491946, 0.017681304052026954, 0.2599419460649479, 0.1530335304011011, 0.10899398424340494, -0.3213876498169002, -0.014641994267589348, 0.047222948978719474] |
1,803.03196 | Modeling of gate controlled Kondo effect at carbon point-defects in
graphene | We study the magnetic properties in the vicinity of a single carbon defect in
a monolayer of graphene. We include the unbound $\sigma$ orbital and the
vacancy induced bound $\pi$ state in an effective two-orbital single impurity
model. The local magnetic moments are stabilized by the Coulomb interaction as
well as a significant ferromagnetic Hund's rule coupling between the orbitals
predicted by a density functional theory calculation. A hybridization between
the orbitals and the Dirac fermions is generated by the curvature of the
graphene sheet in the vicinity of the vacancy. We present results for the local
spectral function calculated using Wilson's numerical renormalization group
approach for a realistic graphene band structure and find three different
regimes depending on the filling, the controlling chemical potential, and the
hybridization strength. These different regions are characterized by different
magnetic properties. The calculated spectral functions qualitatively agree with
recent scanning tunneling spectra on graphene vacancies.
| cond-mat.mes-hall | we study the magnetic properties in the vicinity of a single carbon defect in a monolayer of graphene we include the unbound sigma orbital and the vacancy induced bound pi state in an effective twoorbital single impurity model the local magnetic moments are stabilized by the coulomb interaction as well as a significant ferromagnetic hunds rule coupling between the orbitals predicted by a density functional theory calculation a hybridization between the orbitals and the dirac fermions is generated by the curvature of the graphene sheet in the vicinity of the vacancy we present results for the local spectral function calculated using wilsons numerical renormalization group approach for a realistic graphene band structure and find three different regimes depending on the filling the controlling chemical potential and the hybridization strength these different regions are characterized by different magnetic properties the calculated spectral functions qualitatively agree with recent scanning tunneling spectra on graphene vacancies | [['we', 'study', 'the', 'magnetic', 'properties', 'in', 'the', 'vicinity', 'of', 'a', 'single', 'carbon', 'defect', 'in', 'a', 'monolayer', 'of', 'graphene', 'we', 'include', 'the', 'unbound', 'sigma', 'orbital', 'and', 'the', 'vacancy', 'induced', 'bound', 'pi', 'state', 'in', 'an', 'effective', 'twoorbital', 'single', 'impurity', 'model', 'the', 'local', 'magnetic', 'moments', 'are', 'stabilized', 'by', 'the', 'coulomb', 'interaction', 'as', 'well', 'as', 'a', 'significant', 'ferromagnetic', 'hunds', 'rule', 'coupling', 'between', 'the', 'orbitals', 'predicted', 'by', 'a', 'density', 'functional', 'theory', 'calculation', 'a', 'hybridization', 'between', 'the', 'orbitals', 'and', 'the', 'dirac', 'fermions', 'is', 'generated', 'by', 'the', 'curvature', 'of', 'the', 'graphene', 'sheet', 'in', 'the', 'vicinity', 'of', 'the', 'vacancy', 'we', 'present', 'results', 'for', 'the', 'local', 'spectral', 'function', 'calculated', 'using', 'wilsons', 'numerical', 'renormalization', 'group', 'approach', 'for', 'a', 'realistic', 'graphene', 'band', 'structure', 'and', 'find', 'three', 'different', 'regimes', 'depending', 'on', 'the', 'filling', 'the', 'controlling', 'chemical', 'potential', 'and', 'the', 'hybridization', 'strength', 'these', 'different', 'regions', 'are', 'characterized', 'by', 'different', 'magnetic', 'properties', 'the', 'calculated', 'spectral', 'functions', 'qualitatively', 'agree', 'with', 'recent', 'scanning', 'tunneling', 'spectra', 'on', 'graphene', 'vacancies']] | [-0.15841258671992509, 0.16823263578264328, -0.017809489748048548, 0.06036225422423357, 0.038207596180176266, -0.12100681732408702, 0.10270764949458872, 0.3882135851431246, -0.25611287905638547, -0.31569307698181975, -0.0713446224996771, -0.3114495013325818, -0.14411771416933716, 0.13093191875132584, 0.09737957499333118, -0.013845390416559224, 0.016152055088528676, -0.045121092916049654, -0.12867069181275406, -0.18324175523440844, 0.3297384484505624, 0.028523116102932317, 0.29497344469602566, 0.11739100440172479, -0.013425602240634984, 0.02485609862732848, 0.0859567824211952, 0.03848745798275463, -0.16649767833970194, 0.09563293645317715, 0.18088477370091774, -0.10765593598204616, 0.22532074802438729, -0.4592735016546947, -0.2083094260826903, -0.031035726494768535, 0.13835169387809737, 0.1465384667788289, -0.08221752726393261, -0.31682370440103114, 0.035526044145961735, -0.14552701779910804, -0.12506802568800354, -0.08896026433764123, -0.024052050321571233, 0.02460097705816703, -0.2555696807888269, 0.11231612243079182, -0.022693448189161962, 0.08470170766629867, -0.130515767665776, -0.14999219848112644, -0.13871376737982868, 0.07930178817141016, 0.04447686355208708, 0.029358457107599333, 0.20147441451339737, -0.1240369892134607, -0.10723607272130291, 0.37961749343422097, -0.08538927751176648, -0.1433917157272318, 0.16412525350767138, -0.16783564411238522, -0.07412624974906641, 0.13113078048091234, 0.07053503728514586, 0.1199340841971877, -0.13936904330138963, 0.12325782624401127, -0.025997086070435074, 0.13126628180218272, 0.0445429869731398, 0.057816382208042534, 0.24612050550671197, 0.16557836875252083, 0.029030483467259297, 0.09699282535477419, -0.1442746678934016, -0.07420035142384127, -0.24596442349598205, -0.14909694304170493, -0.2490757087668355, 0.038471450016674534, -0.1212598113990297, -0.20570037027477825, 0.44513525510774343, 0.08307381370717562, 0.19334550640135267, -0.06275501377316878, 0.22534233695937714, 0.15178728099808245, 0.061967331937538755, 0.007222801177321296, 0.2529327890768304, 0.1713729184932737, 0.04468993044084575, -0.31506392439692527, 0.025880909880996977, 0.07439796313318718] |
1,803.03197 | Not all phylogenetic networks are leaf-reconstructible | Unrooted phylogenetic networks are graphs used to represent evolutionary
relationships. Accurately reconstructing such networks is of great relevance
for evolutionary biology. It has recently been conjectured that all
phylogenetic networks with at least five leaves can be uniquely reconstructed
from their subnetworks obtained by deleting a single leaf and suppressing
degree-2 vertices. Here, we show that this conjecture is false, by presenting a
counter example for each possible number of leaves that is at least~4.
Moreover, we show that the conjecture is still false when restricted to binary
networks.
| math.CO | unrooted phylogenetic networks are graphs used to represent evolutionary relationships accurately reconstructing such networks is of great relevance for evolutionary biology it has recently been conjectured that all phylogenetic networks with at least five leaves can be uniquely reconstructed from their subnetworks obtained by deleting a single leaf and suppressing degree2 vertices here we show that this conjecture is false by presenting a counter example for each possible number of leaves that is at least4 moreover we show that the conjecture is still false when restricted to binary networks | [['unrooted', 'phylogenetic', 'networks', 'are', 'graphs', 'used', 'to', 'represent', 'evolutionary', 'relationships', 'accurately', 'reconstructing', 'such', 'networks', 'is', 'of', 'great', 'relevance', 'for', 'evolutionary', 'biology', 'it', 'has', 'recently', 'been', 'conjectured', 'that', 'all', 'phylogenetic', 'networks', 'with', 'at', 'least', 'five', 'leaves', 'can', 'be', 'uniquely', 'reconstructed', 'from', 'their', 'subnetworks', 'obtained', 'by', 'deleting', 'a', 'single', 'leaf', 'and', 'suppressing', 'degree2', 'vertices', 'here', 'we', 'show', 'that', 'this', 'conjecture', 'is', 'false', 'by', 'presenting', 'a', 'counter', 'example', 'for', 'each', 'possible', 'number', 'of', 'leaves', 'that', 'is', 'at', 'least4', 'moreover', 'we', 'show', 'that', 'the', 'conjecture', 'is', 'still', 'false', 'when', 'restricted', 'to', 'binary', 'networks']] | [-0.11522094382161505, 0.13461244124866856, -0.029879385678704535, 0.07243197461396582, -0.07074195181092854, -0.20068837337070303, 0.048525132709758334, 0.39783577457740066, -0.28508434118179793, -0.32414912743745056, 0.08695170827853504, -0.29870633763690174, -0.25786675912526885, 0.14853013739031687, -0.08859678071771822, 0.04322708036038983, 0.15550000518769697, 0.07368297697034444, 0.031678527169154556, -0.3354828583725383, 0.32958777269788003, 0.02654677779110295, 0.19488230939389448, 0.0442596884899553, 0.14047625543696157, -0.04014665786218777, -0.004557003172930707, 0.09340477095435509, -0.08980817758128978, 0.10227838862658573, 0.31227148629808693, 0.25359885993915915, 0.25022047548816445, -0.3608529051828585, -0.25537678112244505, 0.20647567590133528, 0.16378639420243293, 0.16237423112720586, -0.03277584145452534, -0.2397119609097521, 0.20604132677773745, -0.09489637532198195, -0.09211308189950297, -0.07894169351902236, 0.07048341670084034, -0.002324361422130566, -0.20585237225528094, 0.0382037299362749, 0.019536419007717895, 0.014677959886703933, 0.017436922093581282, -0.1578728270539072, -0.1041370401828644, 0.16853217699916856, -0.0010455848879358741, 0.07516602392758379, 0.04843358585631914, -0.12283683209052162, -0.17912923636731137, 0.3149439219929529, 0.016067357498398993, -0.18698169896379113, 0.19492395360315784, -0.10798538096374675, -0.23405283713566788, 0.1445893689655186, 0.11411434281198832, 0.13333737339008223, -0.19193817642494498, 0.037023115379270166, -0.07340754150528084, 0.1280671315126414, 0.16739648194941745, -0.03397199196029413, 0.24464129955636002, 0.20304402339355915, 0.05969408830481299, 0.13582426043661583, -0.07249774229241891, -0.03448345660286945, -0.19223879354487938, -0.10503062362824514, -0.2184435090460825, 0.08354953525514666, -0.1099098623372821, -0.1392072845103868, 0.36330564744937954, 0.13156443248827304, 0.20247270383484914, 0.1372221244729302, 0.25123842675866703, 0.05125412227732412, 0.08178316015132776, 0.11204735975545109, 0.18224348837321394, 0.1297673852747997, -0.004581733397469761, -0.12401324280098164, 0.15226269289432617, 0.06643919636537268] |
1,803.03198 | Knowledge Graphs in the Libraries and Digital Humanities Domain | Knowledge graphs represent concepts (e.g., people, places, events) and their
semantic relationships. As a data structure, they underpin a digital
information system, support users in resource discovery and retrieval, and are
useful for navigation and visualization purposes. Within the libaries and
humanities domain, knowledge graphs are typically rooted in knowledge
organization systems, which have a century-old tradition and have undergone
their digital transformation with the advent of the Web and Linked Data. Being
exposed to the Web, metadata and concept definitions are now forming an
interconnected and decentralized global knowledge network that can be curated
and enriched by community-driven editorial processes. In the future, knowledge
graphs could be vehicles for formalizing and connecting findings and insights
derived from the analysis of possibly large-scale corpora in the libraries and
digital humanities domain.
| cs.DL | knowledge graphs represent concepts eg people places events and their semantic relationships as a data structure they underpin a digital information system support users in resource discovery and retrieval and are useful for navigation and visualization purposes within the libaries and humanities domain knowledge graphs are typically rooted in knowledge organization systems which have a centuryold tradition and have undergone their digital transformation with the advent of the web and linked data being exposed to the web metadata and concept definitions are now forming an interconnected and decentralized global knowledge network that can be curated and enriched by communitydriven editorial processes in the future knowledge graphs could be vehicles for formalizing and connecting findings and insights derived from the analysis of possibly largescale corpora in the libraries and digital humanities domain | [['knowledge', 'graphs', 'represent', 'concepts', 'eg', 'people', 'places', 'events', 'and', 'their', 'semantic', 'relationships', 'as', 'a', 'data', 'structure', 'they', 'underpin', 'a', 'digital', 'information', 'system', 'support', 'users', 'in', 'resource', 'discovery', 'and', 'retrieval', 'and', 'are', 'useful', 'for', 'navigation', 'and', 'visualization', 'purposes', 'within', 'the', 'libaries', 'and', 'humanities', 'domain', 'knowledge', 'graphs', 'are', 'typically', 'rooted', 'in', 'knowledge', 'organization', 'systems', 'which', 'have', 'a', 'centuryold', 'tradition', 'and', 'have', 'undergone', 'their', 'digital', 'transformation', 'with', 'the', 'advent', 'of', 'the', 'web', 'and', 'linked', 'data', 'being', 'exposed', 'to', 'the', 'web', 'metadata', 'and', 'concept', 'definitions', 'are', 'now', 'forming', 'an', 'interconnected', 'and', 'decentralized', 'global', 'knowledge', 'network', 'that', 'can', 'be', 'curated', 'and', 'enriched', 'by', 'communitydriven', 'editorial', 'processes', 'in', 'the', 'future', 'knowledge', 'graphs', 'could', 'be', 'vehicles', 'for', 'formalizing', 'and', 'connecting', 'findings', 'and', 'insights', 'derived', 'from', 'the', 'analysis', 'of', 'possibly', 'largescale', 'corpora', 'in', 'the', 'libraries', 'and', 'digital', 'humanities', 'domain']] | [-0.09371766512497114, 0.045822686011692544, -0.05061908132181718, 0.09423697444681937, -0.1881359615103485, -0.08687606639085481, 0.0641813641700607, 0.41965846502437043, -0.28232943673546496, -0.3879242668107439, 0.1571730327147704, -0.3247812753198489, -0.1439249598618167, 0.18747627374787743, -0.08297197115428459, -0.014589176319826107, 0.09059455938941728, 0.030110321360496947, 0.010225326164016644, -0.22382429525291977, 0.3224186753997436, 0.028826347194038905, 0.3375215066740146, 0.0386954958192431, 0.04960934485917767, -0.03548203874558497, -0.1479259310402155, 0.0027087526745162905, -0.07434552707535869, 0.19034629211259577, 0.3965136339171575, 0.290165970252397, 0.28502502122070067, -0.4647945037828042, -0.20435446727161224, 0.06883593783355677, 0.15137027156608662, 0.08600340922488472, -0.0699002334364475, -0.3984413664071606, 0.05147714628614127, -0.17641512438332518, -0.043583412830216384, -0.11019292167262533, 0.021708332535882408, 0.053843561574691334, -0.20961061382102064, -0.012557102191679475, 0.07048750213804082, 0.14715744524191204, -0.03545968536144266, -0.08860523685221919, -0.02953740468320365, 0.24903770017151075, -0.02275711607474547, 0.014365804305550857, 0.1596827593488762, -0.1770874350080983, -0.18691731423247032, 0.3827481187665119, 0.04295724551909818, -0.14483952473920697, 0.2012241629507536, -0.05674100485764659, -0.17330969342460426, 0.07104642080286375, 0.2324224383212053, 0.036770770779381005, -0.24842174440810386, 0.04569564257309629, 0.008765058566887791, 0.17414524941794718, 0.07977353842893185, 0.07372969289023716, 0.2760787600472283, 0.22627356034488633, 0.018257506762613326, 0.06272140772690853, 0.009512787906435104, -0.1175964635796845, -0.17894318549571417, -0.13911760797222647, -0.16920413062191353, -0.030777629929630516, -0.09126199993804152, -0.1325240613749394, 0.3257513138358123, 0.15224142509799163, 0.11185149933354786, 0.01769986200468758, 0.28658570121400634, -0.03541762509401171, 0.1521994612716998, 0.10343398312823131, 0.13502359476764328, 0.07118675011890725, 0.22950833509317958, -0.049934540997939904, 0.14220928118044798, -0.006632526247547223] |
1,803.03199 | From coalescing random walks on a torus to Kingman's coalescent | Let $\mathbb{T}^d_N$, $d\ge 2$, be the discrete $d$-dimensional torus with
$N^d$ points. Place a particle at each site of $\mathbb{T}^d_N$ and let them
evolve as independent, nearest-neighbor, symmetric, continuous-time random
walks. Each time two particles meet, they coalesce into one. Denote by $C_N$
the first time the set of particles is reduced to a singleton. Cox [6] proved
the existence of a time-scale $\theta_N$ for which $C_N/\theta_N$ converges to
the sum of independent exponential random variables. Denote by $Z^N_t$ the
total number of particles at time $t$. We prove that the sequence of Markov
chains $(Z^N_{t\theta_N})_{t\ge 0}$ converges to the total number of partitions
in Kingman's coalescent.
| math.PR cond-mat.stat-mech | let mathbbtd_n dge 2 be the discrete ddimensional torus with nd points place a particle at each site of mathbbtd_n and let them evolve as independent nearestneighbor symmetric continuoustime random walks each time two particles meet they coalesce into one denote by c_n the first time the set of particles is reduced to a singleton cox 6 proved the existence of a timescale theta_n for which c_ntheta_n converges to the sum of independent exponential random variables denote by zn_t the total number of particles at time t we prove that the sequence of markov chains zn_ttheta_n_tge 0 converges to the total number of partitions in kingmans coalescent | [['let', 'mathbbtd_n', 'dge', '2', 'be', 'the', 'discrete', 'ddimensional', 'torus', 'with', 'nd', 'points', 'place', 'a', 'particle', 'at', 'each', 'site', 'of', 'mathbbtd_n', 'and', 'let', 'them', 'evolve', 'as', 'independent', 'nearestneighbor', 'symmetric', 'continuoustime', 'random', 'walks', 'each', 'time', 'two', 'particles', 'meet', 'they', 'coalesce', 'into', 'one', 'denote', 'by', 'c_n', 'the', 'first', 'time', 'the', 'set', 'of', 'particles', 'is', 'reduced', 'to', 'a', 'singleton', 'cox', '6', 'proved', 'the', 'existence', 'of', 'a', 'timescale', 'theta_n', 'for', 'which', 'c_ntheta_n', 'converges', 'to', 'the', 'sum', 'of', 'independent', 'exponential', 'random', 'variables', 'denote', 'by', 'zn_t', 'the', 'total', 'number', 'of', 'particles', 'at', 'time', 't', 'we', 'prove', 'that', 'the', 'sequence', 'of', 'markov', 'chains', 'zn_ttheta_n_tge', '0', 'converges', 'to', 'the', 'total', 'number', 'of', 'partitions', 'in', 'kingmans', 'coalescent']] | [-0.150375397309807, 0.25172042598783534, -0.04779297010242647, 0.002038263137150994, -0.003924877236725069, -0.18718791359067694, 0.0697450021877611, 0.2941501713494825, -0.3108335393115732, -0.22601662803094322, 0.062133979644653774, -0.31351569396735846, -0.02136307848416561, 0.09793183538610772, -0.010958759506762611, -0.01827719532222688, 0.02895383151047224, 0.09683490781953522, -0.001557448019465322, -0.3260401080307715, 0.24806844793241836, -0.00923781934212528, 0.17754840738067001, -0.06328578599199068, 0.14962114202424737, 0.058571915539419823, -0.013614310965161113, -0.009544512813947364, -0.14356086156868852, 0.031564755292207584, 0.2130162887978276, 0.08892488566683217, 0.3102902177602564, -0.41792264987038924, -0.158945493037155, 0.251425488532393, 0.20300492731963887, -0.0017176172433548845, 0.061560227478598704, -0.2598774394056961, 0.11875420449502475, -0.1023874673889676, -0.17070954697955326, 0.03629201153001072, 0.09266029023017515, 0.10406747707804921, -0.32888868719558506, 0.021064968633593296, 0.09607144431941503, 0.002386227738587003, 0.00032209208025140503, -0.1444244563086506, -0.0751117019726913, 0.10372207690870353, 0.02669632824493901, 0.05796172252545754, 0.11647844048874344, -0.008752813046871154, -0.16483294988489328, 0.3451941313915977, -0.05882900585785654, -0.22226927506134792, 0.1414981555540626, -0.19424317698177024, -0.1593658156309496, 0.18897074522614918, 0.1690153519454065, 0.1458289889600493, -0.10938499543779329, 0.14654921718322964, -0.08490085809984628, 0.12332256215364289, 0.09369451706936839, -0.002581767806345049, 0.19315980124634272, 0.13327730066307328, 0.12734239860483462, 0.16096261567230719, -0.05208176400828604, -0.12239342730939753, -0.3025708075626479, -0.16128033404603748, -0.2676781453922683, 0.14313668285624362, -0.20615427637020212, -0.1781065550395379, 0.33723962758941683, 0.08912151015601029, 0.22792729974139994, 0.1942145355880676, 0.17230663379179498, 0.13673165138122081, -0.018233155231356768, 0.10462026369628695, 0.028167256941635382, 0.1621377825344383, 0.007618583884893679, -0.16000047564853495, 0.055075368045044, 0.1668946519676669] |
1,803.032 | Towards Knowledge Discovery from the Vatican Secret Archives. In Codice
Ratio -- Episode 1: Machine Transcription of the Manuscripts | In Codice Ratio is a research project to study tools and techniques for
analyzing the contents of historical documents conserved in the Vatican Secret
Archives (VSA). In this paper, we present our efforts to develop a system to
support the transcription of medieval manuscripts. The goal is to provide
paleographers with a tool to reduce their efforts in transcribing large
volumes, as those stored in the VSA, producing good transcriptions for
significant portions of the manuscripts. We propose an original approach based
on character segmentation. Our solution is able to deal with the dirty
segmentation that inevitably occurs in handwritten documents. We use a
convolutional neural network to recognize characters and language models to
compose word transcriptions. Our approach requires minimal training efforts,
making the transcription process more scalable as the production of training
sets requires a few pages and can be easily crowdsourced. We have conducted
experiments on manuscripts from the Vatican Registers, an unreleased corpus
containing the correspondence of the popes. With training data produced by 120
high school students, our system has been able to produce good transcriptions
that can be used by paleographers as a solid basis to speedup the transcription
process at a large scale.
| cs.DL cs.CV | in codice ratio is a research project to study tools and techniques for analyzing the contents of historical documents conserved in the vatican secret archives vsa in this paper we present our efforts to develop a system to support the transcription of medieval manuscripts the goal is to provide paleographers with a tool to reduce their efforts in transcribing large volumes as those stored in the vsa producing good transcriptions for significant portions of the manuscripts we propose an original approach based on character segmentation our solution is able to deal with the dirty segmentation that inevitably occurs in handwritten documents we use a convolutional neural network to recognize characters and language models to compose word transcriptions our approach requires minimal training efforts making the transcription process more scalable as the production of training sets requires a few pages and can be easily crowdsourced we have conducted experiments on manuscripts from the vatican registers an unreleased corpus containing the correspondence of the popes with training data produced by 120 high school students our system has been able to produce good transcriptions that can be used by paleographers as a solid basis to speedup the transcription process at a large scale | [['in', 'codice', 'ratio', 'is', 'a', 'research', 'project', 'to', 'study', 'tools', 'and', 'techniques', 'for', 'analyzing', 'the', 'contents', 'of', 'historical', 'documents', 'conserved', 'in', 'the', 'vatican', 'secret', 'archives', 'vsa', 'in', 'this', 'paper', 'we', 'present', 'our', 'efforts', 'to', 'develop', 'a', 'system', 'to', 'support', 'the', 'transcription', 'of', 'medieval', 'manuscripts', 'the', 'goal', 'is', 'to', 'provide', 'paleographers', 'with', 'a', 'tool', 'to', 'reduce', 'their', 'efforts', 'in', 'transcribing', 'large', 'volumes', 'as', 'those', 'stored', 'in', 'the', 'vsa', 'producing', 'good', 'transcriptions', 'for', 'significant', 'portions', 'of', 'the', 'manuscripts', 'we', 'propose', 'an', 'original', 'approach', 'based', 'on', 'character', 'segmentation', 'our', 'solution', 'is', 'able', 'to', 'deal', 'with', 'the', 'dirty', 'segmentation', 'that', 'inevitably', 'occurs', 'in', 'handwritten', 'documents', 'we', 'use', 'a', 'convolutional', 'neural', 'network', 'to', 'recognize', 'characters', 'and', 'language', 'models', 'to', 'compose', 'word', 'transcriptions', 'our', 'approach', 'requires', 'minimal', 'training', 'efforts', 'making', 'the', 'transcription', 'process', 'more', 'scalable', 'as', 'the', 'production', 'of', 'training', 'sets', 'requires', 'a', 'few', 'pages', 'and', 'can', 'be', 'easily', 'crowdsourced', 'we', 'have', 'conducted', 'experiments', 'on', 'manuscripts', 'from', 'the', 'vatican', 'registers', 'an', 'unreleased', 'corpus', 'containing', 'the', 'correspondence', 'of', 'the', 'popes', 'with', 'training', 'data', 'produced', 'by', '120', 'high', 'school', 'students', 'our', 'system', 'has', 'been', 'able', 'to', 'produce', 'good', 'transcriptions', 'that', 'can', 'be', 'used', 'by', 'paleographers', 'as', 'a', 'solid', 'basis', 'to', 'speedup', 'the', 'transcription', 'process', 'at', 'a', 'large', 'scale']] | [-0.04920614923276862, 0.04489769245420965, -0.06457527318484702, 0.0803553778126728, -0.12491191385850804, -0.11634522257016364, 0.0732416098537066, 0.39805949839278676, -0.22633668454839106, -0.3486102193199592, 0.09185749883597184, -0.3266876130198528, -0.11668156067441617, 0.215038089537803, -0.13771887303672123, 0.0499077522271902, 0.14924215504362684, 0.033997632331619926, -0.007493316270149674, -0.3082715877455336, 0.26884852843454143, 0.09114742165963564, 0.3317261941835512, 0.0055444265528087865, 0.10161521185809576, -0.07905217293383819, -0.050502773256418866, -0.049189791429612065, -0.060454133916209685, 0.2068541990212944, 0.3755873100227495, 0.2236924597444678, 0.3021966671233769, -0.4472850236224429, -0.14686139837876722, 0.0766588221755525, 0.1330521363635519, 0.16927184614980098, -0.05599830569784045, -0.3237732636043802, 0.10303022608408058, -0.1847998975480346, -0.012492983357277604, -0.1367661562577194, 0.00986755124236248, -0.025667784323355144, -0.24205242471272906, 0.011589358317219101, 0.03535194222830778, 0.09243694423788171, -0.021597941666223794, -0.0920663993361368, 0.03480882000425184, 0.19641587353900683, 0.05398401825264695, 0.0810690627668566, 0.10164186362490742, -0.15111819564778245, -0.13141161083999298, 0.39312933820622914, -0.07375034075693646, -0.19702098421676426, 0.19461851969613142, -0.05912865734687645, -0.14904011893608815, 0.12772097152049597, 0.23497202454456448, 0.07398318506275987, -0.18878415277303787, 0.011882043479554526, -0.0338394463523196, 0.24614837895710573, 0.062418762284416555, -0.03322507866316152, 0.20754502955063872, 0.2330724019566147, -0.04287196034553689, 0.15928165244808115, -0.09502580495579738, -0.02094950975508106, -0.230816202185934, -0.14954373572135762, -0.18753845638498112, 0.006032466769042634, -0.03527971485141743, -0.1620600092395836, 0.36902041455293644, 0.2055103664134382, 0.18815526247442682, 0.07168227366922537, 0.2786664753601107, -0.007558708750923183, 0.15234666630344784, 0.07777700324219708, 0.13986925081509088, 0.014460701240008051, 0.1668262483287194, -0.12069108747171561, 0.08767669534724092, 0.04235980629134562] |
1,803.03201 | Quantifying the impact of a periodic presence of antimicrobial on
resistance evolution in a homogeneous microbial population of fixed size | The evolution of antimicrobial resistance generally occurs in an environment
where antimicrobial concentration is variable, which has dramatic consequences
on the microorganisms' fitness landscape, and thus on the evolution of
resistance. We investigate the effect of these time-varying patterns of
selection within a stochastic model. We consider a homogeneous microbial
population of fixed size subjected to periodic alternations of phases of
absence and presence of an antimicrobial that stops growth. Combining
analytical approaches and stochastic simulations, we quantify how the time
necessary for fit resistant bacteria to take over the microbial population
depends on the alternation period. We demonstrate that fast alternations
strongly accelerate the evolution of resistance, reaching a plateau for
sufficiently small periods. Furthermore, this acceleration is stronger in
larger populations. For asymmetric alternations, featuring a different duration
of the phases with and without antimicrobial, we shed light on the existence of
a minimum for the time taken by the population to fully evolve resistance. The
corresponding dramatic acceleration of the evolution of antimicrobial
resistance likely occurs in realistic situations, and may have an important
impact both in clinical and experimental situations.
| physics.bio-ph q-bio.PE | the evolution of antimicrobial resistance generally occurs in an environment where antimicrobial concentration is variable which has dramatic consequences on the microorganisms fitness landscape and thus on the evolution of resistance we investigate the effect of these timevarying patterns of selection within a stochastic model we consider a homogeneous microbial population of fixed size subjected to periodic alternations of phases of absence and presence of an antimicrobial that stops growth combining analytical approaches and stochastic simulations we quantify how the time necessary for fit resistant bacteria to take over the microbial population depends on the alternation period we demonstrate that fast alternations strongly accelerate the evolution of resistance reaching a plateau for sufficiently small periods furthermore this acceleration is stronger in larger populations for asymmetric alternations featuring a different duration of the phases with and without antimicrobial we shed light on the existence of a minimum for the time taken by the population to fully evolve resistance the corresponding dramatic acceleration of the evolution of antimicrobial resistance likely occurs in realistic situations and may have an important impact both in clinical and experimental situations | [['the', 'evolution', 'of', 'antimicrobial', 'resistance', 'generally', 'occurs', 'in', 'an', 'environment', 'where', 'antimicrobial', 'concentration', 'is', 'variable', 'which', 'has', 'dramatic', 'consequences', 'on', 'the', 'microorganisms', 'fitness', 'landscape', 'and', 'thus', 'on', 'the', 'evolution', 'of', 'resistance', 'we', 'investigate', 'the', 'effect', 'of', 'these', 'timevarying', 'patterns', 'of', 'selection', 'within', 'a', 'stochastic', 'model', 'we', 'consider', 'a', 'homogeneous', 'microbial', 'population', 'of', 'fixed', 'size', 'subjected', 'to', 'periodic', 'alternations', 'of', 'phases', 'of', 'absence', 'and', 'presence', 'of', 'an', 'antimicrobial', 'that', 'stops', 'growth', 'combining', 'analytical', 'approaches', 'and', 'stochastic', 'simulations', 'we', 'quantify', 'how', 'the', 'time', 'necessary', 'for', 'fit', 'resistant', 'bacteria', 'to', 'take', 'over', 'the', 'microbial', 'population', 'depends', 'on', 'the', 'alternation', 'period', 'we', 'demonstrate', 'that', 'fast', 'alternations', 'strongly', 'accelerate', 'the', 'evolution', 'of', 'resistance', 'reaching', 'a', 'plateau', 'for', 'sufficiently', 'small', 'periods', 'furthermore', 'this', 'acceleration', 'is', 'stronger', 'in', 'larger', 'populations', 'for', 'asymmetric', 'alternations', 'featuring', 'a', 'different', 'duration', 'of', 'the', 'phases', 'with', 'and', 'without', 'antimicrobial', 'we', 'shed', 'light', 'on', 'the', 'existence', 'of', 'a', 'minimum', 'for', 'the', 'time', 'taken', 'by', 'the', 'population', 'to', 'fully', 'evolve', 'resistance', 'the', 'corresponding', 'dramatic', 'acceleration', 'of', 'the', 'evolution', 'of', 'antimicrobial', 'resistance', 'likely', 'occurs', 'in', 'realistic', 'situations', 'and', 'may', 'have', 'an', 'important', 'impact', 'both', 'in', 'clinical', 'and', 'experimental', 'situations']] | [-0.1398441798924266, 0.17435106691173924, -0.07726393222464653, 0.062103632093488195, -0.02366952829027508, -0.12427740313527781, 0.07993906630840882, 0.3709488938595472, -0.25621414943800674, -0.30143329259210633, 0.07931116608518135, -0.2364692039271809, -0.16404681811210417, 0.19597174215975785, -0.06789169570243836, -0.02407768226491854, 0.04985700319040283, 0.009587333816022652, 0.0037569088754421305, -0.26540950495425775, 0.27551307841634337, 0.06580612421891166, 0.2631586118975816, 0.04197129451242053, 0.09223256475651516, 0.0043480227177497, -0.00013568755267719413, 0.049346509288348585, -0.14207008688335127, 0.04604631862299436, 0.19653850264908018, 0.08978551471828604, 0.30019941283946694, -0.4965570148892964, -0.2428669835611325, 0.14096633691287538, 0.14214375662793274, 0.13941687811862008, -0.07696454986454108, -0.20825287371205733, 0.044210567077085296, -0.12199938382574423, -0.1474859184059112, -0.02721015202468666, 0.08617437057166724, 0.04212667129120192, -0.2565619512359895, 0.13045763310662511, 0.017722644373703668, 0.09007458812202854, -0.09817325139216415, -0.09830195801433823, -0.04388404818525052, 0.15800218580166667, 0.06689701352202658, -0.03729121695505455, 0.15035716712768393, -0.13953833760941683, -0.0992337504032311, 0.34036308566725854, -0.07167980815132108, -0.12302225106965203, 0.2396448878267699, -0.13968539507265593, -0.09494170973219139, 0.15131673342852003, 0.22835107761151766, 0.11096848243766505, -0.12029714301689123, 0.006517741355270593, 0.02127658003313548, 0.17406302223832387, 0.05887763143223508, 0.009541058695227232, 0.21121024091363602, 0.23555963311556968, 0.04749748479377519, 0.1304949084575207, -0.09151640021793908, -0.1179040868035214, -0.229059180325788, -0.13138867448240332, -0.09685026792778997, 0.0725825750572688, -0.12048762047403294, -0.1957874206127599, 0.42833533764148696, 0.1474673310010036, 0.18777693695064163, 0.05153980051514025, 0.24466631103954886, 0.08947566773808237, 0.06152928452130531, 0.024071853046062523, 0.1981426853820702, 0.09372101250894206, 0.09917655240164806, -0.31607023803529877, 0.19871785730989042, -0.04931343502096791] |
1,803.03202 | Multi-terminal Conductance at the Surface of a Weyl Semimetal | Weyl semimetals are a new paradigmatic topological phase of matter featuring
a gapless spectrum. One of its most distinctive features is the presence of
Fermi arc surface states. Here, we report on atomistic simulations of the dc
conductance and quantum Hall response of a minimal Weyl semimetal. By using
scattering theory we show that a quantized Hall conductance with a
non-vanishing longitudinal conductance emerges associated to the Fermi arc
surface states with a remarkable robustness to high concentrations of defects
in the system. Additionally, we predict that a slab of a Weyl semimetal with
broken time-reversal symmetry bears persistent currents fully determined by the
system size and the lattice parameters.
| cond-mat.mes-hall | weyl semimetals are a new paradigmatic topological phase of matter featuring a gapless spectrum one of its most distinctive features is the presence of fermi arc surface states here we report on atomistic simulations of the dc conductance and quantum hall response of a minimal weyl semimetal by using scattering theory we show that a quantized hall conductance with a nonvanishing longitudinal conductance emerges associated to the fermi arc surface states with a remarkable robustness to high concentrations of defects in the system additionally we predict that a slab of a weyl semimetal with broken timereversal symmetry bears persistent currents fully determined by the system size and the lattice parameters | [['weyl', 'semimetals', 'are', 'a', 'new', 'paradigmatic', 'topological', 'phase', 'of', 'matter', 'featuring', 'a', 'gapless', 'spectrum', 'one', 'of', 'its', 'most', 'distinctive', 'features', 'is', 'the', 'presence', 'of', 'fermi', 'arc', 'surface', 'states', 'here', 'we', 'report', 'on', 'atomistic', 'simulations', 'of', 'the', 'dc', 'conductance', 'and', 'quantum', 'hall', 'response', 'of', 'a', 'minimal', 'weyl', 'semimetal', 'by', 'using', 'scattering', 'theory', 'we', 'show', 'that', 'a', 'quantized', 'hall', 'conductance', 'with', 'a', 'nonvanishing', 'longitudinal', 'conductance', 'emerges', 'associated', 'to', 'the', 'fermi', 'arc', 'surface', 'states', 'with', 'a', 'remarkable', 'robustness', 'to', 'high', 'concentrations', 'of', 'defects', 'in', 'the', 'system', 'additionally', 'we', 'predict', 'that', 'a', 'slab', 'of', 'a', 'weyl', 'semimetal', 'with', 'broken', 'timereversal', 'symmetry', 'bears', 'persistent', 'currents', 'fully', 'determined', 'by', 'the', 'system', 'size', 'and', 'the', 'lattice', 'parameters']] | [-0.2616807300385765, 0.21954820763785393, -0.07869922220283611, -0.016466777029828253, -0.064554483121769, -0.2227667017882182, 0.07763835204320706, 0.3291675862305882, -0.25473681167297235, -0.25116245827044953, -0.006609690486749803, -0.3369016121056947, -0.20797226315533573, 0.14590292529795656, 0.0035894659453664314, 0.0675376001602589, -0.016842481891878626, -0.02542758375744928, -0.1406064575538039, -0.1997933692023666, 0.3307361071019179, 0.005834785039240325, 0.3135445858838714, 0.06196607347916473, 0.08146730941953137, -0.03229479734912853, 0.11596169601279226, 0.10374939822676507, -0.1065607595687404, 0.062050061371304435, 0.19948656960940836, -0.14328845399431883, 0.13277850929986346, -0.4384704174812544, -0.22803018590520052, -0.014816980904222211, 0.07840272286557592, 0.15348777370527386, -0.09407872475196861, -0.3371890448308973, 0.08205195201391524, -0.1748377262487669, -0.15374646713449197, -0.09379477122036571, -0.0036311205857518045, -0.0891011404635554, -0.1512206434991888, 0.126492186030373, 0.024512348586524076, 0.10173267268321731, -0.06697859337278218, -0.06061296357921409, -0.12937525425910612, 0.058980587985239585, 0.02461093332068148, -0.023385493207553572, 0.1379901552710428, -0.1862529011824253, -0.1780026071239263, 0.3926786474714225, -0.08132895546414974, -0.12711338544428474, 0.1697794599797238, -0.19937879013913598, -0.10004938218149949, 0.17225453161888502, 0.10495651804588058, 0.04167469860139218, -0.0810035652311688, 0.10073195391398093, -0.07887412408705462, 0.1373236640949141, -0.014035900214432993, 0.05674153345383026, 0.3280003258111802, 0.17392931136048653, 0.07886080701666122, 0.15620499384504827, -0.16729749252606946, -0.01223894479599866, -0.3259540032764727, -0.20805594222170343, -0.26700085465880957, 0.09097204917025838, -0.004446954034342939, -0.2440005265768956, 0.4912973739714785, 0.10413504055025194, 0.219817244049839, -0.01612465149638328, 0.2208314936100082, 0.15046538315840405, 0.07049300759522752, 0.05869515040381388, 0.19211301822638646, 0.17675081432310186, 0.07731598364612595, -0.32560413207075645, 0.017398505436722188, 0.03260057519020682] |
1,803.03203 | The Petrov type D isolated null surfaces | Generic black holes in vacuum-de Sitter / Anti-de Sitter spacetimes are
studied in quasi-local framework, where the relevant properties are captured in
the intrinsic geometry of the null surface (the horizon). Imposing the
quasi-local notion of stationarity (null symmetry of the metric up to second
order at the horizon only) we perform the complete classification of all the so
called special Petrov types of these surfaces defined by the properties
(structure of principal null direction) of the Weyl tensor at the surface. The
only possible types are: II, D and O. In particular all the geometries of type
O are identified. The condition distinguishing type D horizons, taking the form
of a second order differential equation on certain complex invariant
constructed from the Gaussian curvature and the rotation scalar, is shown to be
an integrability condition for the so called near horizon geometry equation.
The emergence of the near horizon geometry in this context is equivalent to the
hyper-suface orthogonality of both double principal null directions. We further
formulate a no-hair theorem for the Petrov type D axisymmetric null surfaces of
topologically spherical sections, showing that the space of solutions is
uniquely parametrized by the horizon area and angular momentum.
| gr-qc hep-th | generic black holes in vacuumde sitter antide sitter spacetimes are studied in quasilocal framework where the relevant properties are captured in the intrinsic geometry of the null surface the horizon imposing the quasilocal notion of stationarity null symmetry of the metric up to second order at the horizon only we perform the complete classification of all the so called special petrov types of these surfaces defined by the properties structure of principal null direction of the weyl tensor at the surface the only possible types are ii d and o in particular all the geometries of type o are identified the condition distinguishing type d horizons taking the form of a second order differential equation on certain complex invariant constructed from the gaussian curvature and the rotation scalar is shown to be an integrability condition for the so called near horizon geometry equation the emergence of the near horizon geometry in this context is equivalent to the hypersuface orthogonality of both double principal null directions we further formulate a nohair theorem for the petrov type d axisymmetric null surfaces of topologically spherical sections showing that the space of solutions is uniquely parametrized by the horizon area and angular momentum | [['generic', 'black', 'holes', 'in', 'vacuumde', 'sitter', 'antide', 'sitter', 'spacetimes', 'are', 'studied', 'in', 'quasilocal', 'framework', 'where', 'the', 'relevant', 'properties', 'are', 'captured', 'in', 'the', 'intrinsic', 'geometry', 'of', 'the', 'null', 'surface', 'the', 'horizon', 'imposing', 'the', 'quasilocal', 'notion', 'of', 'stationarity', 'null', 'symmetry', 'of', 'the', 'metric', 'up', 'to', 'second', 'order', 'at', 'the', 'horizon', 'only', 'we', 'perform', 'the', 'complete', 'classification', 'of', 'all', 'the', 'so', 'called', 'special', 'petrov', 'types', 'of', 'these', 'surfaces', 'defined', 'by', 'the', 'properties', 'structure', 'of', 'principal', 'null', 'direction', 'of', 'the', 'weyl', 'tensor', 'at', 'the', 'surface', 'the', 'only', 'possible', 'types', 'are', 'ii', 'd', 'and', 'o', 'in', 'particular', 'all', 'the', 'geometries', 'of', 'type', 'o', 'are', 'identified', 'the', 'condition', 'distinguishing', 'type', 'd', 'horizons', 'taking', 'the', 'form', 'of', 'a', 'second', 'order', 'differential', 'equation', 'on', 'certain', 'complex', 'invariant', 'constructed', 'from', 'the', 'gaussian', 'curvature', 'and', 'the', 'rotation', 'scalar', 'is', 'shown', 'to', 'be', 'an', 'integrability', 'condition', 'for', 'the', 'so', 'called', 'near', 'horizon', 'geometry', 'equation', 'the', 'emergence', 'of', 'the', 'near', 'horizon', 'geometry', 'in', 'this', 'context', 'is', 'equivalent', 'to', 'the', 'hypersuface', 'orthogonality', 'of', 'both', 'double', 'principal', 'null', 'directions', 'we', 'further', 'formulate', 'a', 'nohair', 'theorem', 'for', 'the', 'petrov', 'type', 'd', 'axisymmetric', 'null', 'surfaces', 'of', 'topologically', 'spherical', 'sections', 'showing', 'that', 'the', 'space', 'of', 'solutions', 'is', 'uniquely', 'parametrized', 'by', 'the', 'horizon', 'area', 'and', 'angular', 'momentum']] | [-0.17927911574540736, 0.09713273919771033, -0.062299925616396724, 0.09888606358230152, -0.102495984806952, -0.13698573029515418, -0.046170651729246885, 0.301243438747608, -0.24156993677877267, -0.23514630278393703, 0.10965241670474467, -0.25544508488853507, -0.11088388469399452, 0.1434121776014717, -0.05333667335299201, 0.04987465667848786, -0.006126432741916917, 0.07992738669601768, -0.12237759885722724, -0.2453908937820939, 0.4212522916025435, 0.055222611436902574, 0.29124716210244883, -0.004562378491773599, 0.1085227857981197, 0.012662761106221663, -0.009876451358631855, 0.08281260929196824, -0.1729544010850077, 0.08672670012156507, 0.19704406817838777, 0.1165847334836732, 0.18235391854529617, -0.39293809487211584, -0.20564202905980625, 0.10209043151487342, 0.12134491562410588, 0.09590286177564224, 0.006977241647998906, -0.31708123790796355, 0.10115836334480631, -0.11707801433195444, -0.20594497659535269, -0.05098137566749232, 0.041696101837471654, -0.03436267362070279, -0.18788021530943094, 0.08887590642905596, 0.1204534742905937, 0.024672245205793943, -0.12024200624889797, -0.03721164173394856, -0.09527021435776142, 0.06073726172502519, 0.10026736798119434, -0.01904522663339822, 0.0938567548944389, -0.08469926664544589, -0.09328423664173713, 0.3326194439026894, -0.026290228245238953, -0.26082970212317175, 0.13934323633785803, -0.19978428064114084, -0.10077140078235493, 0.1234713949838117, 0.1460438910848226, 0.20654347468158135, -0.14152638902305625, 0.19118335435662015, -0.008117544177844369, 0.06271591870528129, 0.14604260338319822, 0.02254752008329061, 0.2629086075849229, 0.06937676782818568, 0.0720954722738966, 0.10908211315123628, -0.0898320491371601, -0.09239092595038013, -0.43584047573044743, -0.20652738887572078, -0.15822347347281235, 0.07432824500478954, -0.1435428389788028, -0.1999240939655621, 0.35982041579384283, 0.027552276646607848, 0.18875753791853456, 0.025049663633296287, 0.20493273370799087, 0.08434500317136297, 0.0472991954278897, 0.11376557910739622, 0.28281069822336613, 0.15048386192189134, 0.08458702954595362, -0.21089876872296867, -0.011350904567863303, 0.1302985331394023] |
1,803.03204 | Strengthening Relationships between Neural Ideals and Receptive Fields | Neural codes are collections of binary vectors that represent the firing
patterns of neurons. The information given by a neural code $C$ can be
represented by its neural ideal $J_C$. In turn, the polynomials in $J_C$ can be
used to determine the relationships among the receptive fields of the neurons.
In a paper by Curto et al., three such relationships, known as the Type 1-3
relations, were linked to the neural ideal by three if-and-only-if statements.
Later, Garcia et al. discovered the Type 4-6 relations. These new relations
differed from the first three in that they were related to $J_C$ by one-way
implications. In this paper, we first show that the converses of these new
implications are false at the level of both the neural ideal $J_C$ and the
larger ideal $I(C)$ of a code. We then present modified statements of these
relations that, like the first three, can be related by if-and-only-if
statements to both $J_C$ and $I(C)$. Using the modified relations, we uncover a
new relationship involving $J_C$, $I(C)$, and the Type 1-6 relations.
| math.AC q-bio.NC | neural codes are collections of binary vectors that represent the firing patterns of neurons the information given by a neural code c can be represented by its neural ideal j_c in turn the polynomials in j_c can be used to determine the relationships among the receptive fields of the neurons in a paper by curto et al three such relationships known as the type 13 relations were linked to the neural ideal by three ifandonlyif statements later garcia et al discovered the type 46 relations these new relations differed from the first three in that they were related to j_c by oneway implications in this paper we first show that the converses of these new implications are false at the level of both the neural ideal j_c and the larger ideal ic of a code we then present modified statements of these relations that like the first three can be related by ifandonlyif statements to both j_c and ic using the modified relations we uncover a new relationship involving j_c ic and the type 16 relations | [['neural', 'codes', 'are', 'collections', 'of', 'binary', 'vectors', 'that', 'represent', 'the', 'firing', 'patterns', 'of', 'neurons', 'the', 'information', 'given', 'by', 'a', 'neural', 'code', 'c', 'can', 'be', 'represented', 'by', 'its', 'neural', 'ideal', 'j_c', 'in', 'turn', 'the', 'polynomials', 'in', 'j_c', 'can', 'be', 'used', 'to', 'determine', 'the', 'relationships', 'among', 'the', 'receptive', 'fields', 'of', 'the', 'neurons', 'in', 'a', 'paper', 'by', 'curto', 'et', 'al', 'three', 'such', 'relationships', 'known', 'as', 'the', 'type', '13', 'relations', 'were', 'linked', 'to', 'the', 'neural', 'ideal', 'by', 'three', 'ifandonlyif', 'statements', 'later', 'garcia', 'et', 'al', 'discovered', 'the', 'type', '46', 'relations', 'these', 'new', 'relations', 'differed', 'from', 'the', 'first', 'three', 'in', 'that', 'they', 'were', 'related', 'to', 'j_c', 'by', 'oneway', 'implications', 'in', 'this', 'paper', 'we', 'first', 'show', 'that', 'the', 'converses', 'of', 'these', 'new', 'implications', 'are', 'false', 'at', 'the', 'level', 'of', 'both', 'the', 'neural', 'ideal', 'j_c', 'and', 'the', 'larger', 'ideal', 'ic', 'of', 'a', 'code', 'we', 'then', 'present', 'modified', 'statements', 'of', 'these', 'relations', 'that', 'like', 'the', 'first', 'three', 'can', 'be', 'related', 'by', 'ifandonlyif', 'statements', 'to', 'both', 'j_c', 'and', 'ic', 'using', 'the', 'modified', 'relations', 'we', 'uncover', 'a', 'new', 'relationship', 'involving', 'j_c', 'ic', 'and', 'the', 'type', '16', 'relations']] | [-0.10858816967811435, 0.1233851384855701, -0.021716858104231174, 0.10020979489953871, -0.07597695491991048, -0.14070459788655915, 0.054448600075292314, 0.32662314623700117, -0.30365135065618565, -0.3078491597552784, 0.08126273537676422, -0.2691003139281582, -0.2147760602687909, 0.23773157721470026, -0.04166672278767113, 0.02514163393293116, -0.008641148017804053, 0.011674795326226476, -0.06845436986093939, -0.32397795805776364, 0.3492786565647376, 0.032245723207862204, 0.2738426454187985, -0.02698501896520611, 0.05212414084632077, -0.05824947882634164, -0.06511948741139019, 0.04343995297941464, -0.14687978921128061, 0.15268374005443713, 0.25871818029819144, 0.16554410743595904, 0.2183453475418818, -0.4345097465345382, -0.1672964954142861, 0.0762153088058271, 0.13904251538174736, 0.09110963680194056, 0.025316237773619254, -0.2687917380965452, 0.1244037439041263, -0.18017924403697674, -0.08454195233802735, -0.05951499766987664, 0.034776126992338424, 0.10048874429247173, -0.23976086865348573, 0.06611113989228298, 0.1066574875023269, 0.08615724931322885, -0.05154395185805201, -0.1236922379413789, -0.022976080492795023, 0.12732980974992228, -0.018448297910667447, 0.039168642180481, 0.06326755771773275, -0.15782925601789347, -0.15208745941477406, 0.29839779646135867, -0.026017737594718874, -0.16782234580023214, 0.19055660916704006, -0.0910460403591225, -0.13854780076971193, 0.05830942607611756, 0.12262030332137576, 0.049926137952504425, -0.1983834235738455, 0.03478403352710302, -0.08692820323895747, 0.14020256198339417, 0.10009704077013092, 0.00899434259256602, 0.2100109772926027, 0.09124724925178188, -0.05556757003333504, 0.1324010703280113, -0.09421185781618326, -0.015766970496439502, -0.28373165983727877, -0.15492817040649243, -0.1501228004397655, 0.04654674970185046, -0.09870263493849052, -0.08860448020012965, 0.3830405820256353, 0.16609613787097094, 0.20611638282901945, 0.0635598336137429, 0.1820748056369749, 0.08711241050663045, 0.10812135918438964, 0.11136599150962535, 0.24083955207871358, 0.16574932604139161, 0.09412203440231016, -0.17430590651664798, 0.10409020514502614, 0.09158862514728257] |
1,803.03205 | The open dihypergraph dichotomy and the second level of the Borel
hierarchy | We show that several dichotomy theorems concerning the second level of the
Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization
of the open graph dichotomy, which itself follows from the usual proof(s) of
the perfect set theorem. Under the axiom of determinacy, we obtain the
generalizations of these results from analytic metric spaces to separable
metric spaces. We also consider connections between cardinal invariants and the
chromatic numbers of the corresponding dihypergraphs.
| math.LO math.CO | we show that several dichotomy theorems concerning the second level of the borel hierarchy are special cases of the aleph_0dimensional generalization of the open graph dichotomy which itself follows from the usual proofs of the perfect set theorem under the axiom of determinacy we obtain the generalizations of these results from analytic metric spaces to separable metric spaces we also consider connections between cardinal invariants and the chromatic numbers of the corresponding dihypergraphs | [['we', 'show', 'that', 'several', 'dichotomy', 'theorems', 'concerning', 'the', 'second', 'level', 'of', 'the', 'borel', 'hierarchy', 'are', 'special', 'cases', 'of', 'the', 'aleph_0dimensional', 'generalization', 'of', 'the', 'open', 'graph', 'dichotomy', 'which', 'itself', 'follows', 'from', 'the', 'usual', 'proofs', 'of', 'the', 'perfect', 'set', 'theorem', 'under', 'the', 'axiom', 'of', 'determinacy', 'we', 'obtain', 'the', 'generalizations', 'of', 'these', 'results', 'from', 'analytic', 'metric', 'spaces', 'to', 'separable', 'metric', 'spaces', 'we', 'also', 'consider', 'connections', 'between', 'cardinal', 'invariants', 'and', 'the', 'chromatic', 'numbers', 'of', 'the', 'corresponding', 'dihypergraphs']] | [-0.14388239227192687, 0.06860641826068799, -0.10860230916665053, 0.1747657476045506, -0.09863947703778533, -0.09896910652308397, 0.08209909081072088, 0.29200261711916875, -0.31992112573000114, -0.2498206251471395, 0.11186124224373152, -0.2698644652838071, -0.15020008628177917, 0.22321025780598883, -0.13524067184140146, 0.016833667223617226, 0.060898233834706564, 0.07272466672190898, -0.08783199482689232, -0.25132258673088664, 0.46691698982367213, -0.07289494770828267, 0.23314800651245554, 0.10200267148925185, 0.10494881222093426, 0.014545408628461227, -0.045133005329210996, 0.05945743785854523, -0.19336683243157712, 0.12105417999268418, 0.24597784647927948, 0.1801045793043056, 0.2303666749733015, -0.3469907812459368, -0.11979738440246544, 0.16468805625614985, 0.014234625950822947, 0.0437139416126613, 0.034237426292466025, -0.30980393770609943, 0.09413917256768425, -0.12578191558345103, -0.16874426856397612, -0.06773879346896855, 0.003802651447624388, 0.056018766579808484, -0.21748371395400504, 0.03646114201926049, 0.2130544819987156, 0.05325382677809513, -0.08444414341914087, -0.11079748159825382, -0.014977779065612967, 0.10353549602638248, 0.05917867555768347, -0.0037616016322740316, 0.017368742605854928, -0.09844177193992154, -0.17532391139161838, 0.365338677514187, -0.03139463245448932, -0.21874083581210021, 0.1656761593644468, -0.1685812974637243, -0.19925189630167794, 0.031118823603963033, 0.08077797742927788, 0.11317748258965955, -0.03682853185742254, 0.16476483093361488, -0.17101277631353323, 0.09291745977259805, 0.1543188236430812, 0.10836144446880674, 0.11174669797519143, 0.05617386543414962, 0.11528143205706187, 0.2109786673075139, 0.026280956513340205, -0.11594351162497794, -0.36616467044387063, -0.12798331142731115, -0.1276504102123665, 0.08564077178672166, -0.1701229162107166, -0.20977984938088437, 0.37980754041231013, 0.11991741758128496, 0.12321528047979088, 0.1759705916194665, 0.24508382038960994, 0.09204533251357416, -0.008033042314501715, 0.04735157013199338, 0.18322165249387773, 0.24698570339192807, 0.00632059498047325, -0.12074882265477127, 0.008191718808440884, 0.18691199123334717] |
1,803.03206 | Matrix diagonalization and exact solution of the k-photon
Jaynes-Cummings model | We study and exactly solve the two-photon and k-photon Jaynes-Cummings models
by using a novelty algebraic method. This algebraic method is based on the
Pauli matrices realization and the tilting transformation of the $SU(2)$ group
and let us diagonalize the Hamiltonian of these models by properly choosing the
coherent state parameters of the transformation. Finally, we explicitly obtain
the energy spectrum and eigenfunctions for each model.
| quant-ph | we study and exactly solve the twophoton and kphoton jaynescummings models by using a novelty algebraic method this algebraic method is based on the pauli matrices realization and the tilting transformation of the su2 group and let us diagonalize the hamiltonian of these models by properly choosing the coherent state parameters of the transformation finally we explicitly obtain the energy spectrum and eigenfunctions for each model | [['we', 'study', 'and', 'exactly', 'solve', 'the', 'twophoton', 'and', 'kphoton', 'jaynescummings', 'models', 'by', 'using', 'a', 'novelty', 'algebraic', 'method', 'this', 'algebraic', 'method', 'is', 'based', 'on', 'the', 'pauli', 'matrices', 'realization', 'and', 'the', 'tilting', 'transformation', 'of', 'the', 'su2', 'group', 'and', 'let', 'us', 'diagonalize', 'the', 'hamiltonian', 'of', 'these', 'models', 'by', 'properly', 'choosing', 'the', 'coherent', 'state', 'parameters', 'of', 'the', 'transformation', 'finally', 'we', 'explicitly', 'obtain', 'the', 'energy', 'spectrum', 'and', 'eigenfunctions', 'for', 'each', 'model']] | [-0.0855611613528295, 0.1142575375905091, -0.07551268526973824, 0.04237308835074531, -0.07233597146290721, -0.16038144928064535, 0.05807700908432404, 0.35812919349832967, -0.2889143062021696, -0.2618998154842605, 0.06401738520203666, -0.24155428616160696, -0.16919221991151007, 0.1614351610081609, 0.005181745079233114, 0.04060592107249029, 0.06782670575899608, 0.0468470590527762, -0.12328036925332113, -0.2168953682888638, 0.38385591648914147, 0.010701156672880505, 0.27930851342777413, 0.00869590564010044, 0.17312228455292908, 0.06643424309500419, 0.024262142395882896, -0.05304568019258141, -0.12849814596473041, 0.13373272326796062, 0.21144435519608756, 0.08445635346949777, 0.20158336908471855, -0.3980029767492052, -0.17282366989688439, 0.12177330834057296, 0.13829648362121644, 0.16180602928172005, 0.01797366309664071, -0.341314097316089, 0.034486746126221435, -0.19417219539878494, -0.13878635651516644, -0.13807614240795374, -0.03978978223731798, -0.005065123035544248, -0.282280668305854, 0.023504464908579725, 0.052991716067701804, 0.03370931088416414, -0.09409475155090066, -0.06561726165201628, -0.01313417591507349, 0.0849699978011124, -0.03659539778935582, -0.035450430287076444, 0.0718067735292469, -0.06628457227877031, -0.11330073262003927, 0.3723825520807595, -0.051745862072989854, -0.2541475633977715, 0.08245404663312277, -0.09726712601541569, -0.10721602708552823, 0.057404670479820306, 0.12096807826310396, 0.10640475089012673, -0.14116311625041295, 0.1722883548769239, -0.06580493648564725, 0.13061022394421426, 0.004942805068849614, -0.014304035159787445, 0.12135145110501484, 0.0742677830470105, 0.020683700060048563, 0.15594932871560255, -0.021424647819279045, -0.10130650152198294, -0.3254905418125969, -0.13355333182720863, -0.19745544488118452, 0.08001907801989352, -0.1131002338253452, -0.11057855265045707, 0.5001613237845683, 0.16269466145472092, 0.19018064545128832, 0.03327218052987574, 0.278799658133225, 0.196998389621237, 0.04162020152029017, 0.044368651048209744, 0.1669627622362565, 0.22276604191795218, -0.01811166047683042, -0.2991157327143645, -0.026589551702438093, 0.17033332405668317] |
1,803.03207 | Long time $L^\infty(L^2)$ a posteriori error estimates for fully
discrete parabolic problems | Computable estimates for the error of finite element discretisations of
parabolic problems in the $L^\infty(0,T; L^2)$ norm are developed, which
exhibit constant effectivities (the ratio of the estimated error to the true
error) with respect to the simulation time. These estimates, which are of
optimal order, represent a significant advantage for long-time simulations, and
are derived using energy techniques based on elliptic reconstructions. The
effectivities of previous optimal order error estimates in this norm derived
using energy techniques are shown numerically to grow either in proportion to
the simulation duration or its square root, a key disadvantage compared with
earlier estimators derived using parabolic duality arguments. The new estimates
form a continuous family, almost all of which are new, reproducing certain
familiar energy-based estimates well suited for short-time simulations and not
available through the parabolic duality framework. For clarity, we demonstrate
the technique applied to a linear parabolic problem discretised using standard
conforming finite element methods in space coupled with backward Euler and
Crank-Nicolson time discretisations, although it can be applied much more
widely.
| math.NA | computable estimates for the error of finite element discretisations of parabolic problems in the linfty0t l2 norm are developed which exhibit constant effectivities the ratio of the estimated error to the true error with respect to the simulation time these estimates which are of optimal order represent a significant advantage for longtime simulations and are derived using energy techniques based on elliptic reconstructions the effectivities of previous optimal order error estimates in this norm derived using energy techniques are shown numerically to grow either in proportion to the simulation duration or its square root a key disadvantage compared with earlier estimators derived using parabolic duality arguments the new estimates form a continuous family almost all of which are new reproducing certain familiar energybased estimates well suited for shorttime simulations and not available through the parabolic duality framework for clarity we demonstrate the technique applied to a linear parabolic problem discretised using standard conforming finite element methods in space coupled with backward euler and cranknicolson time discretisations although it can be applied much more widely | [['computable', 'estimates', 'for', 'the', 'error', 'of', 'finite', 'element', 'discretisations', 'of', 'parabolic', 'problems', 'in', 'the', 'linfty0t', 'l2', 'norm', 'are', 'developed', 'which', 'exhibit', 'constant', 'effectivities', 'the', 'ratio', 'of', 'the', 'estimated', 'error', 'to', 'the', 'true', 'error', 'with', 'respect', 'to', 'the', 'simulation', 'time', 'these', 'estimates', 'which', 'are', 'of', 'optimal', 'order', 'represent', 'a', 'significant', 'advantage', 'for', 'longtime', 'simulations', 'and', 'are', 'derived', 'using', 'energy', 'techniques', 'based', 'on', 'elliptic', 'reconstructions', 'the', 'effectivities', 'of', 'previous', 'optimal', 'order', 'error', 'estimates', 'in', 'this', 'norm', 'derived', 'using', 'energy', 'techniques', 'are', 'shown', 'numerically', 'to', 'grow', 'either', 'in', 'proportion', 'to', 'the', 'simulation', 'duration', 'or', 'its', 'square', 'root', 'a', 'key', 'disadvantage', 'compared', 'with', 'earlier', 'estimators', 'derived', 'using', 'parabolic', 'duality', 'arguments', 'the', 'new', 'estimates', 'form', 'a', 'continuous', 'family', 'almost', 'all', 'of', 'which', 'are', 'new', 'reproducing', 'certain', 'familiar', 'energybased', 'estimates', 'well', 'suited', 'for', 'shorttime', 'simulations', 'and', 'not', 'available', 'through', 'the', 'parabolic', 'duality', 'framework', 'for', 'clarity', 'we', 'demonstrate', 'the', 'technique', 'applied', 'to', 'a', 'linear', 'parabolic', 'problem', 'discretised', 'using', 'standard', 'conforming', 'finite', 'element', 'methods', 'in', 'space', 'coupled', 'with', 'backward', 'euler', 'and', 'cranknicolson', 'time', 'discretisations', 'although', 'it', 'can', 'be', 'applied', 'much', 'more', 'widely']] | [-0.0521674751840671, 0.03806200571443174, -0.09176335789446569, 0.11255584993525462, -0.059953375653251366, -0.15120402691302415, -0.007372275225004588, 0.38364644613566584, -0.2932684991144757, -0.27351576876565653, 0.16581628394270337, -0.2377705335036327, -0.09266750071058585, 0.2620091160783416, -0.0819319271343364, 0.15552058043834838, 0.0826845635277294, 0.02188011166778789, -0.13173981787283615, -0.26371540957205425, 0.27597160926476744, 0.0301693151330297, 0.27784108971218824, -0.020147784215655048, 0.11531287703085048, -0.04257848054363296, -0.05634715117182283, 0.041622505151103356, -0.16828876372357165, 0.14455590029876014, 0.2557674739723918, 0.02899693292244498, 0.31137918989741425, -0.4039300120912021, -0.22369114359326916, 0.12391017225902827, 0.15804279243022246, 0.09000348524878272, -0.056250097002347677, -0.27430847100913525, 0.10163068548099127, -0.14270755244504618, -0.15074402104592186, -0.08387168686992179, -0.05505453836408326, 0.08704235131488364, -0.31656037304475476, 0.11965691023265365, 0.023678468060599447, 0.04922100581528469, -0.07379655446221613, -0.14578547291511176, 0.006364792364585246, 0.1073055962400361, 0.043901664523365, 0.010917790884408972, 0.04510052937090306, -0.04473713680636138, -0.09506645920718539, 0.36508590008243225, -0.09273157356676229, -0.2766412846990272, 0.15458239190248324, -0.12152788128661013, -0.06523486873035951, 0.16064296114518062, 0.17504438668243244, 0.1362239813978045, -0.11633477127714746, 0.07217718466170314, -0.018368794593489033, 0.16463582655655798, 0.03607152341717811, 0.015408751795646446, 0.0647317282909035, 0.13466463535194467, 0.0944090126692478, 0.06925907328085246, -0.06192682877894833, -0.14021142752273758, -0.31327114165385905, -0.1272377655814648, -0.1790745823173088, 0.00224683930351059, -0.1154538280898123, -0.19489242460082912, 0.33094509178371134, 0.13500011412309076, 0.12994927508708345, 0.1324141235913728, 0.28664078165231077, 0.16592378386606774, 0.06648334266548313, 0.09102426612436579, 0.22367229755437965, 0.1539665869622486, 0.06409325727914598, -0.21800079493082247, 0.07048369695475304, 0.16785086408236075] |
1,803.03208 | Toward a probability theory for product logic: states, integral
representation and reasoning | The aim of this paper is to extend probability theory from the classical to
the product t-norm fuzzy logic setting. More precisely, we axiomatize a
generalized notion of finitely additive probability for product logic formulas,
called state, and show that every state is the Lebesgue integral with respect
to a unique regular Borel probability measure. Furthermore, the relation
between states and measures is shown to be one-one. In addition, we study
geometrical properties of the convex set of states and show that extremal
states, i.e., the extremal points of the state space, are the same as the
truth-value assignments of the logic. Finally, we axiomatize a two-tiered modal
logic for probabilistic reasoning on product logic events and prove soundness
and completeness with respect to probabilistic spaces, where the algebra is a
free product algebra and the measure is a state in the above sense.
| math.LO math.PR | the aim of this paper is to extend probability theory from the classical to the product tnorm fuzzy logic setting more precisely we axiomatize a generalized notion of finitely additive probability for product logic formulas called state and show that every state is the lebesgue integral with respect to a unique regular borel probability measure furthermore the relation between states and measures is shown to be oneone in addition we study geometrical properties of the convex set of states and show that extremal states ie the extremal points of the state space are the same as the truthvalue assignments of the logic finally we axiomatize a twotiered modal logic for probabilistic reasoning on product logic events and prove soundness and completeness with respect to probabilistic spaces where the algebra is a free product algebra and the measure is a state in the above sense | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'extend', 'probability', 'theory', 'from', 'the', 'classical', 'to', 'the', 'product', 'tnorm', 'fuzzy', 'logic', 'setting', 'more', 'precisely', 'we', 'axiomatize', 'a', 'generalized', 'notion', 'of', 'finitely', 'additive', 'probability', 'for', 'product', 'logic', 'formulas', 'called', 'state', 'and', 'show', 'that', 'every', 'state', 'is', 'the', 'lebesgue', 'integral', 'with', 'respect', 'to', 'a', 'unique', 'regular', 'borel', 'probability', 'measure', 'furthermore', 'the', 'relation', 'between', 'states', 'and', 'measures', 'is', 'shown', 'to', 'be', 'oneone', 'in', 'addition', 'we', 'study', 'geometrical', 'properties', 'of', 'the', 'convex', 'set', 'of', 'states', 'and', 'show', 'that', 'extremal', 'states', 'ie', 'the', 'extremal', 'points', 'of', 'the', 'state', 'space', 'are', 'the', 'same', 'as', 'the', 'truthvalue', 'assignments', 'of', 'the', 'logic', 'finally', 'we', 'axiomatize', 'a', 'twotiered', 'modal', 'logic', 'for', 'probabilistic', 'reasoning', 'on', 'product', 'logic', 'events', 'and', 'prove', 'soundness', 'and', 'completeness', 'with', 'respect', 'to', 'probabilistic', 'spaces', 'where', 'the', 'algebra', 'is', 'a', 'free', 'product', 'algebra', 'and', 'the', 'measure', 'is', 'a', 'state', 'in', 'the', 'above', 'sense']] | [-0.09698457908396246, 0.0838177586976801, -0.10075665506883524, 0.12182736344726032, -0.08682687262706976, -0.09225308279080006, 0.07850849990952863, 0.35457888611644095, -0.32154412052801085, -0.20453199006038225, 0.09295114712707193, -0.2801894621613125, -0.11988513926614057, 0.14070048442226835, -0.15239056540980933, 0.06452575684913124, 0.03625994802051638, 0.14772269056346785, -0.08738302543901631, -0.1956513015837926, 0.39743623631915803, -0.02907181598857278, 0.2700324294855818, 0.03152156282319791, 0.13410408563342774, 0.02190446902790831, 0.01509210366445283, 0.0584968222002418, -0.1437811503133667, 0.1390306386007675, 0.29312853438346387, 0.2023089348464661, 0.2858977045010154, -0.3590908147636785, -0.10349567702764438, 0.13934099002896497, 0.04785869385684944, 0.028422198576865614, 0.038473036914991904, -0.3143474693642929, 0.10116004213664888, -0.2069951497477531, -0.09753768398918004, -0.10642367788629296, 0.07267162939468916, 0.014416154338202128, -0.2608265762618329, -0.016068071437378723, 0.13515342788822535, 0.034214508454574064, -0.0833580771302675, -0.05800154102002529, -0.04175829639360826, 0.059208747170891404, -0.04309608134887336, 0.04240090565953222, 0.08378073676228975, -0.06243636123933053, -0.2127713706520606, 0.3192170273072811, -0.02627093122646329, -0.2514623043308448, 0.14436441052950816, -0.1811161690727911, -0.15616063055090812, 0.05626901542644999, 0.08451863022572878, 0.1379757871489144, -0.1007899685905108, 0.15408287609736565, -0.08605496509699151, 0.1774938533263695, 0.09089328689798196, 0.09572193622847812, 0.1569796991777063, 0.12056475889403373, 0.10575879755843845, 0.1962362661781501, 0.010064159547457367, -0.131090057390894, -0.3349156545009464, -0.21902370552642322, -0.13087570995008313, 0.03769839141750708, -0.08183917553853665, -0.20583053136680166, 0.3860872145839191, 0.13378441492346205, 0.15182352556277895, 0.1781565637534691, 0.2427015053625736, 0.1418299106558657, 0.00611054746776871, 0.045039409584003605, 0.16066108042933694, 0.2137425306589446, 0.014970663278492995, -0.1470190689126159, 0.08791684814301941, 0.10675682696132248] |
1,803.03209 | Shear-density coupling for a compressible single-component yield-stress
fluid | Flow behavior of a single-component yield stress fluid is addressed on the
hydrodynamic level. A basic ingredient of the model is a coupling between
fluctuations of density and velocity gradient via a Herschel-Bulkley-type
constitutive model. Focusing on the limit of low shear rates and high
densities, the model approximates well---but is not limited to---gently sheared
hard sphere colloidal glasses, where solvent effects are negligible. A detailed
analysis of the linearized hydrodynamic equations for fluctuations and the
resulting cubic dispersion relation reveals the existence of a range of
densities and shear rates with growing flow heterogeneity. In this regime,
after an initial transient, the velocity and density fields monotonically reach
a spatially inhomogeneous stationary profile, where regions of high shear rate
and low density coexist with regions of low shear rate and high density. The
steady state is thus maintained by a competition between shear-induced
enhancement of density inhomogeneities and relaxation via overdamped sound
waves. An analysis of the mechanical equilibrium condition provides a criterion
for the existence of steady state solutions. The dynamical evolution of the
system is discussed in detail for various boundary conditions, imposing either
a constant velocity, shear rate, or stress at the walls.
| cond-mat.soft cond-mat.mtrl-sci physics.flu-dyn | flow behavior of a singlecomponent yield stress fluid is addressed on the hydrodynamic level a basic ingredient of the model is a coupling between fluctuations of density and velocity gradient via a herschelbulkleytype constitutive model focusing on the limit of low shear rates and high densities the model approximates wellbut is not limited togently sheared hard sphere colloidal glasses where solvent effects are negligible a detailed analysis of the linearized hydrodynamic equations for fluctuations and the resulting cubic dispersion relation reveals the existence of a range of densities and shear rates with growing flow heterogeneity in this regime after an initial transient the velocity and density fields monotonically reach a spatially inhomogeneous stationary profile where regions of high shear rate and low density coexist with regions of low shear rate and high density the steady state is thus maintained by a competition between shearinduced enhancement of density inhomogeneities and relaxation via overdamped sound waves an analysis of the mechanical equilibrium condition provides a criterion for the existence of steady state solutions the dynamical evolution of the system is discussed in detail for various boundary conditions imposing either a constant velocity shear rate or stress at the walls | [['flow', 'behavior', 'of', 'a', 'singlecomponent', 'yield', 'stress', 'fluid', 'is', 'addressed', 'on', 'the', 'hydrodynamic', 'level', 'a', 'basic', 'ingredient', 'of', 'the', 'model', 'is', 'a', 'coupling', 'between', 'fluctuations', 'of', 'density', 'and', 'velocity', 'gradient', 'via', 'a', 'herschelbulkleytype', 'constitutive', 'model', 'focusing', 'on', 'the', 'limit', 'of', 'low', 'shear', 'rates', 'and', 'high', 'densities', 'the', 'model', 'approximates', 'wellbut', 'is', 'not', 'limited', 'togently', 'sheared', 'hard', 'sphere', 'colloidal', 'glasses', 'where', 'solvent', 'effects', 'are', 'negligible', 'a', 'detailed', 'analysis', 'of', 'the', 'linearized', 'hydrodynamic', 'equations', 'for', 'fluctuations', 'and', 'the', 'resulting', 'cubic', 'dispersion', 'relation', 'reveals', 'the', 'existence', 'of', 'a', 'range', 'of', 'densities', 'and', 'shear', 'rates', 'with', 'growing', 'flow', 'heterogeneity', 'in', 'this', 'regime', 'after', 'an', 'initial', 'transient', 'the', 'velocity', 'and', 'density', 'fields', 'monotonically', 'reach', 'a', 'spatially', 'inhomogeneous', 'stationary', 'profile', 'where', 'regions', 'of', 'high', 'shear', 'rate', 'and', 'low', 'density', 'coexist', 'with', 'regions', 'of', 'low', 'shear', 'rate', 'and', 'high', 'density', 'the', 'steady', 'state', 'is', 'thus', 'maintained', 'by', 'a', 'competition', 'between', 'shearinduced', 'enhancement', 'of', 'density', 'inhomogeneities', 'and', 'relaxation', 'via', 'overdamped', 'sound', 'waves', 'an', 'analysis', 'of', 'the', 'mechanical', 'equilibrium', 'condition', 'provides', 'a', 'criterion', 'for', 'the', 'existence', 'of', 'steady', 'state', 'solutions', 'the', 'dynamical', 'evolution', 'of', 'the', 'system', 'is', 'discussed', 'in', 'detail', 'for', 'various', 'boundary', 'conditions', 'imposing', 'either', 'a', 'constant', 'velocity', 'shear', 'rate', 'or', 'stress', 'at', 'the', 'walls']] | [-0.190760319531636, 0.19791423699463906, -0.11913275924396038, 0.013481423299586804, -0.0011592135097370628, -0.09570541475316241, 0.00979871725778758, 0.3040897497754561, -0.2769694696372548, -0.27457243558523464, 0.10759215181592621, -0.2375842794564735, -0.08182917964601524, 0.13592156348509965, 0.040357874139912965, 0.05443052928078651, 0.024579711777479724, -0.009128595588335134, -0.0701328133054068, -0.16398844024953768, 0.2800555434630051, 0.07877789466574635, 0.3631108788888633, 0.06931656395738042, 0.12995727224866999, -0.030951840345766972, 0.019562443111634322, 0.08614952332753036, -0.20745653590696297, 0.024543755078092984, 0.18825546645597777, 0.008715928342558214, 0.26675743875861857, -0.44121484925307947, -0.26676945468847707, 0.06147097741474503, 0.12225413810072909, 0.1270494997870722, -0.044036199378339365, -0.22064219159074128, 0.04460230572197164, -0.1479392098922993, -0.1660079379642824, -0.05417681219459502, 0.03916897971936761, 0.07743568255052392, -0.2761835575988276, 0.25812132059855714, 0.047623360255755934, 0.0781970618859164, -0.1335125852918694, -0.03967392359819436, -0.09188712522274689, 0.08358863549734245, 0.07068558177939549, 0.012155151773110925, 0.1957329894732876, -0.228613540015337, 0.01985254069819048, 0.3623116406967345, -0.1059435488753376, -0.20632529984103495, 0.23898929061809765, -0.150828605426533, -0.06440897899459011, 0.2011185974055498, 0.18560892548238062, 0.10226766991467436, -0.12297677231194049, 0.02983915441133653, 0.016174238806436817, 0.18349952255519703, 0.050398332412479464, -0.00922170560566958, 0.2522282816359255, 0.18048335842910634, 0.06877813435918123, 0.13792036988138767, -0.1021589222184104, -0.10226768829269316, -0.31225921686099045, -0.10998824791089852, -0.15386547622530117, 0.03479485820083862, -0.1344655510248165, -0.18199799576121353, 0.34038831320946517, 0.07372901021963772, 0.19745761472143752, 0.05511171863769594, 0.2738469303435569, 0.1472143599638696, -0.026397405109445073, 0.09735197979624871, 0.28397337653309335, 0.199680987050632, 0.12162386373491939, -0.26511175766558454, 0.08270605423874174, 0.047048588993853516] |
1,803.0321 | Virtual Tribrackets | We introduce virtual tribrackets, an algebraic structure for coloring regions
in the planar complement of an oriented virtual knot or link diagram. We use
these structures to define counting invariants of virtual knots and links and
provide examples of the computation of the invariant; in particular we show
that the invariant can distinguish certain virtual knots.
| math.GT math.QA | we introduce virtual tribrackets an algebraic structure for coloring regions in the planar complement of an oriented virtual knot or link diagram we use these structures to define counting invariants of virtual knots and links and provide examples of the computation of the invariant in particular we show that the invariant can distinguish certain virtual knots | [['we', 'introduce', 'virtual', 'tribrackets', 'an', 'algebraic', 'structure', 'for', 'coloring', 'regions', 'in', 'the', 'planar', 'complement', 'of', 'an', 'oriented', 'virtual', 'knot', 'or', 'link', 'diagram', 'we', 'use', 'these', 'structures', 'to', 'define', 'counting', 'invariants', 'of', 'virtual', 'knots', 'and', 'links', 'and', 'provide', 'examples', 'of', 'the', 'computation', 'of', 'the', 'invariant', 'in', 'particular', 'we', 'show', 'that', 'the', 'invariant', 'can', 'distinguish', 'certain', 'virtual', 'knots']] | [-0.27918519328602337, 0.10713384334812873, -0.10990173347632994, 0.1271957712755962, -0.09385093735022979, -0.1129304063083096, 0.03907030776820399, 0.40331087491729045, -0.3161301646042954, -0.31683693372390487, 0.021037171700630675, -0.19858002378181977, -0.22487765732221304, 0.16711769506589255, -0.11137098596293733, -0.017415526585484092, 0.059088301912627435, 0.03106378674644723, -0.037884530996565115, -0.19260982404547658, 0.41827536323531106, -0.08055172896181995, 0.21174708633598957, 0.10709172638810494, 0.07180542253296483, 0.040657892865552145, -0.08149969858879393, 0.04150613495572047, -0.20450886068508473, 0.16188131268559533, 0.24537340683693235, 0.1053997127847238, 0.06890740340829572, -0.39739965891296214, -0.10898254009133035, 0.1191707312891429, 0.17120363561605864, 0.01968269552612169, -0.014377773307602515, -0.2693790305744518, 0.12363796562633732, -0.1940099251879887, -0.1643511502029882, -0.1012774037535895, -0.029562117040834644, 0.02293885959820314, -0.14591249398231, -0.10268217330290512, -0.007648983123627576, 0.09513174845752391, 0.019195517736741087, -0.02665171128570695, 3.594683313911611e-05, 0.21491992655210196, -0.046550697122107854, 0.048265909166498616, 0.08533837211910975, -0.2076155490157279, -0.24855235222388397, 0.3947185065258633, -0.017109827815809033, -0.2573158149692145, 0.2240779134021564, -0.09287656154483556, -0.2354621181433851, 0.18171666261147368, 0.1461000767621127, 0.10965637524019588, -0.031549009419342675, 0.073489731666632, -0.12465533363548192, 0.0895684566094794, 0.07315057265487585, 0.017175012513656506, 0.13852557262236423, 0.02814194386909631, 0.07887190666727044, 0.253522042540664, -0.08244300425391306, -0.06099767522378401, -0.32964701782912015, -0.29807873977009547, -0.10957125548950651, 0.05024975466287949, -0.102940083819505, -0.23514177250591192, 0.3907717473804951, 0.06534382164986297, 0.19481246811761097, 0.11349823483350602, 0.31240478010255507, 0.07017010389403863, 0.0763728965073824, 0.11597555332224477, 0.1434345657259903, 0.12010693814266812, -0.02851505825634707, -0.10604643545706163, 0.020175641639666123, 0.1511879131536592] |
1,803.03211 | PhaseNet: A Deep-Neural-Network-Based Seismic Arrival Time Picking
Method | As the number of seismic sensors grows, it is becoming increasingly difficult
for analysts to pick seismic phases manually and comprehensively, yet such
efforts are fundamental to earthquake monitoring. Despite years of improvements
in automatic phase picking, it is difficult to match the performance of
experienced analysts. A more subtle issue is that different seismic analysts
may pick phases differently, which can introduce bias into earthquake
locations. We present a deep-neural-network-based arrival-time picking method
called "PhaseNet" that picks the arrival times of both P and S waves. Deep
neural networks have recently made rapid progress in feature learning, and with
sufficient training, have achieved super-human performance in many
applications. PhaseNet uses three-component seismic waveforms as input and
generates probability distributions of P arrivals, S arrivals, and noise as
output. We engineer PhaseNet such that peaks in probability provide accurate
arrival times for both P and S waves, and have the potential to increase the
number of S-wave observations dramatically over what is currently available.
This will enable both improved locations and improved shear wave velocity
models. PhaseNet is trained on the prodigious available data set provided by
analyst-labeled P and S arrival times from the Northern California Earthquake
Data Center. The dataset we use contains more than seven million waveform
samples extracted from over thirty years of earthquake recordings. We
demonstrate that PhaseNet achieves much higher picking accuracy and recall rate
than existing methods.
| physics.geo-ph stat.AP | as the number of seismic sensors grows it is becoming increasingly difficult for analysts to pick seismic phases manually and comprehensively yet such efforts are fundamental to earthquake monitoring despite years of improvements in automatic phase picking it is difficult to match the performance of experienced analysts a more subtle issue is that different seismic analysts may pick phases differently which can introduce bias into earthquake locations we present a deepneuralnetworkbased arrivaltime picking method called phasenet that picks the arrival times of both p and s waves deep neural networks have recently made rapid progress in feature learning and with sufficient training have achieved superhuman performance in many applications phasenet uses threecomponent seismic waveforms as input and generates probability distributions of p arrivals s arrivals and noise as output we engineer phasenet such that peaks in probability provide accurate arrival times for both p and s waves and have the potential to increase the number of swave observations dramatically over what is currently available this will enable both improved locations and improved shear wave velocity models phasenet is trained on the prodigious available data set provided by analystlabeled p and s arrival times from the northern california earthquake data center the dataset we use contains more than seven million waveform samples extracted from over thirty years of earthquake recordings we demonstrate that phasenet achieves much higher picking accuracy and recall rate than existing methods | [['as', 'the', 'number', 'of', 'seismic', 'sensors', 'grows', 'it', 'is', 'becoming', 'increasingly', 'difficult', 'for', 'analysts', 'to', 'pick', 'seismic', 'phases', 'manually', 'and', 'comprehensively', 'yet', 'such', 'efforts', 'are', 'fundamental', 'to', 'earthquake', 'monitoring', 'despite', 'years', 'of', 'improvements', 'in', 'automatic', 'phase', 'picking', 'it', 'is', 'difficult', 'to', 'match', 'the', 'performance', 'of', 'experienced', 'analysts', 'a', 'more', 'subtle', 'issue', 'is', 'that', 'different', 'seismic', 'analysts', 'may', 'pick', 'phases', 'differently', 'which', 'can', 'introduce', 'bias', 'into', 'earthquake', 'locations', 'we', 'present', 'a', 'deepneuralnetworkbased', 'arrivaltime', 'picking', 'method', 'called', 'phasenet', 'that', 'picks', 'the', 'arrival', 'times', 'of', 'both', 'p', 'and', 's', 'waves', 'deep', 'neural', 'networks', 'have', 'recently', 'made', 'rapid', 'progress', 'in', 'feature', 'learning', 'and', 'with', 'sufficient', 'training', 'have', 'achieved', 'superhuman', 'performance', 'in', 'many', 'applications', 'phasenet', 'uses', 'threecomponent', 'seismic', 'waveforms', 'as', 'input', 'and', 'generates', 'probability', 'distributions', 'of', 'p', 'arrivals', 's', 'arrivals', 'and', 'noise', 'as', 'output', 'we', 'engineer', 'phasenet', 'such', 'that', 'peaks', 'in', 'probability', 'provide', 'accurate', 'arrival', 'times', 'for', 'both', 'p', 'and', 's', 'waves', 'and', 'have', 'the', 'potential', 'to', 'increase', 'the', 'number', 'of', 'swave', 'observations', 'dramatically', 'over', 'what', 'is', 'currently', 'available', 'this', 'will', 'enable', 'both', 'improved', 'locations', 'and', 'improved', 'shear', 'wave', 'velocity', 'models', 'phasenet', 'is', 'trained', 'on', 'the', 'prodigious', 'available', 'data', 'set', 'provided', 'by', 'analystlabeled', 'p', 'and', 's', 'arrival', 'times', 'from', 'the', 'northern', 'california', 'earthquake', 'data', 'center', 'the', 'dataset', 'we', 'use', 'contains', 'more', 'than', 'seven', 'million', 'waveform', 'samples', 'extracted', 'from', 'over', 'thirty', 'years', 'of', 'earthquake', 'recordings', 'we', 'demonstrate', 'that', 'phasenet', 'achieves', 'much', 'higher', 'picking', 'accuracy', 'and', 'recall', 'rate', 'than', 'existing', 'methods']] | [-0.10004553607067437, 0.10023671293969949, -0.07010405861558752, 0.05704748795203896, -0.09929811419087738, -0.13840691558616997, 0.059312446764870165, 0.43212197207777797, -0.18579942231414273, -0.3560443948634576, 0.1071676717463545, -0.3287590176157869, -0.1333997152264074, 0.2444618302996994, -0.07648785760358391, 0.08718529880264686, 0.12098472693169593, 0.04351206783761366, -0.03740565747943459, -0.29823328554530354, 0.20454103392129164, 0.05387410133377081, 0.32292028514132737, -0.02725268437131408, 0.09451184916018225, -0.02353965099341368, -0.05278804869907648, -0.04290058891650673, -0.07948724951136901, 0.09591127358888607, 0.31368979787356394, 0.19041937522694086, 0.283386187022352, -0.4377261196570911, -0.23357344989149229, 0.13548444361373974, 0.1277542424529627, 0.08592950125162933, -0.022746007678287838, -0.3081939498186431, 0.08329477206785871, -0.17681744251831918, -0.07250506717156091, -0.08941366878396116, 0.09234129109551287, 0.017401292264589426, -0.2795793539224904, 0.05729021558182338, 0.016680451517708823, 0.07763594760391622, -0.008846259219501999, -0.14080225244524705, -0.013653973391271584, 0.16485389121488345, 0.0823025085689508, 0.08734279166349478, 0.1295277384057833, -0.11800002959012773, -0.09774562084343875, 0.3685738179950611, -0.04126607313966518, -0.12006959534258194, 0.18003386277715425, -0.12164639471542958, -0.11633616062920428, 0.16149960997486448, 0.22599054329984625, 0.060499259254739264, -0.15727750207557314, -0.024049388934746226, 0.028519400819207247, 0.16722234723042265, 0.12540837109604522, -0.0018606969268289055, 0.19082995104681413, 0.21479877605714512, 0.07605135155109241, 0.0948704346702654, -0.1669996089701463, -0.028173717187993358, -0.21108073139235442, -0.06893113727276383, -0.17266343264288944, 0.03884892836841405, -0.07287813194409361, -0.1136556869890349, 0.3892348955960968, 0.23401754639309316, 0.18138442965486196, 0.05634535138761073, 0.2981171047458897, 0.04426596159583343, 0.08049734592109982, 0.10192113356313033, 0.1930418087253467, 0.029443948632585835, 0.12328960910732278, -0.12370233838106685, 0.1112970460132324, -0.010612500476867737] |
1,803.03212 | Self-adaptive loop for external disturbance reduction in differential
measurement set-up | We present a method developed to actively compensate common-mode magnetic
disturbances on a multi-sensor device devoted to differential measurements. The
system uses a field-programmable-gated-array card, and operates in conjunction
with a high sensitivity magnetometer: compensating the common-mode of magnetic
disturbances results in a relevant reduction of the difference-mode noise. The
digital nature of the compensation system allows for using a numerical approach
aimed at automatically adapting the feedback loop filter response. A common
mode disturbance attenuation exceeding 50 dB is achieved, resulting in a final
improvement of the differential noise floor by a factor of 10 over the whole
spectral interval of interest.
| physics.ins-det physics.app-ph physics.atom-ph | we present a method developed to actively compensate commonmode magnetic disturbances on a multisensor device devoted to differential measurements the system uses a fieldprogrammablegatedarray card and operates in conjunction with a high sensitivity magnetometer compensating the commonmode of magnetic disturbances results in a relevant reduction of the differencemode noise the digital nature of the compensation system allows for using a numerical approach aimed at automatically adapting the feedback loop filter response a common mode disturbance attenuation exceeding 50 db is achieved resulting in a final improvement of the differential noise floor by a factor of 10 over the whole spectral interval of interest | [['we', 'present', 'a', 'method', 'developed', 'to', 'actively', 'compensate', 'commonmode', 'magnetic', 'disturbances', 'on', 'a', 'multisensor', 'device', 'devoted', 'to', 'differential', 'measurements', 'the', 'system', 'uses', 'a', 'fieldprogrammablegatedarray', 'card', 'and', 'operates', 'in', 'conjunction', 'with', 'a', 'high', 'sensitivity', 'magnetometer', 'compensating', 'the', 'commonmode', 'of', 'magnetic', 'disturbances', 'results', 'in', 'a', 'relevant', 'reduction', 'of', 'the', 'differencemode', 'noise', 'the', 'digital', 'nature', 'of', 'the', 'compensation', 'system', 'allows', 'for', 'using', 'a', 'numerical', 'approach', 'aimed', 'at', 'automatically', 'adapting', 'the', 'feedback', 'loop', 'filter', 'response', 'a', 'common', 'mode', 'disturbance', 'attenuation', 'exceeding', '50', 'db', 'is', 'achieved', 'resulting', 'in', 'a', 'final', 'improvement', 'of', 'the', 'differential', 'noise', 'floor', 'by', 'a', 'factor', 'of', '10', 'over', 'the', 'whole', 'spectral', 'interval', 'of', 'interest']] | [-0.1538751241197754, 0.08416880647384442, -0.044927985395885786, 0.008074985707575215, -0.040057754494471125, -0.11950353355986057, 0.08697608103837338, 0.3493054960992667, -0.22830915934231022, -0.356121957007021, 0.11979251476304403, -0.23956781163097632, -0.1163516437800804, 0.24291925869955874, -0.12175339009465262, 0.09150053784804474, 0.05222931397285792, 0.02988949383719649, -0.05052243018670395, -0.18662630072287698, 0.25887213235762485, 0.11816056550821603, 0.30515912959886954, -0.04177788896532268, 0.20606168529876315, 0.007331709354415093, -0.06856941675195599, 0.025872544893801287, -0.04599053890439728, 0.08695541057242358, 0.2384193829966174, 0.05502200678525732, 0.3296899978846016, -0.3612469350135341, -0.1985745097759484, 0.04532400554156687, 0.1030298318900629, 0.1245121275130106, -0.07967805462119419, -0.2946229393197463, 0.09062169582495411, -0.17951081165730362, -0.10155579678732718, -0.04063804261847445, -0.04286845163027249, 0.001020850148862418, -0.339795055679313, 0.052764860558148365, 0.06345251306089213, 0.11490112711389613, -0.049890671525321124, -0.07738824648146361, 0.030174792808766414, 0.12689508078619838, -0.04874030053315887, 0.03822962717282226, 0.2006699361026951, -0.12787808129324182, -0.1015736303075521, 0.3299762275770749, -0.11639180399090199, -0.18857039955656718, 0.12600781310275935, -0.15084085498687508, -0.04182379507450479, 0.2495325630240253, 0.21204078126477427, 0.06282817544692224, -0.17625142159032645, 0.021868002425192275, 0.08034818014129996, 0.2415694053847306, 0.05836059488724954, 0.0298220878605279, 0.16623243779903002, 0.23236748336648366, 0.08472756072786627, 0.16218642340650283, -0.1638727687912449, -0.018872438679854987, -0.28049505610793535, -0.11046015850088495, -0.10741764710989024, 0.006937229447988885, -0.060187962482364084, -0.12097328274261833, 0.4146015798341077, 0.20064289614991607, 0.15906689935225513, 0.0005674861223980931, 0.38400763278771743, 0.13271330299183245, 0.0895906232555609, 0.021632508619107527, 0.2501062870228497, 0.16757678649489685, 0.16813403771761437, -0.24700545307045968, 0.04762116511177161, -0.015834014710629046] |
1,803.03213 | One-sided Device-independent Self-testing of any Pure Two-qubit
Entangled State | We consider the problem of $1$-sided device-independent self-testing of any
pure entangled two-qubit state based on steering inequalities which certify the
presence of quantum steering. In particular, we note that in the $2-2-2$
steering scenario (involving $2$ parties, $2$ measurement settings per party,
$2$ outcomes per measurement setting), the maximal violation of a fine-grained
steering inequality can be used to witness certain extremal steerable
correlations, which certify all pure two-qubit entangled states. We demonstrate
that the violation of analogous CHSH inequality of steering or nonvanishing
value of a quantity constructed using a correlation function called mutual
predictability together with the maximal violation of fine-grained steering
inequality can be used to self-test any pure entangled two-qubit state in a
$1$-sided device-independent way.
| quant-ph | we consider the problem of 1sided deviceindependent selftesting of any pure entangled twoqubit state based on steering inequalities which certify the presence of quantum steering in particular we note that in the 222 steering scenario involving 2 parties 2 measurement settings per party 2 outcomes per measurement setting the maximal violation of a finegrained steering inequality can be used to witness certain extremal steerable correlations which certify all pure twoqubit entangled states we demonstrate that the violation of analogous chsh inequality of steering or nonvanishing value of a quantity constructed using a correlation function called mutual predictability together with the maximal violation of finegrained steering inequality can be used to selftest any pure entangled twoqubit state in a 1sided deviceindependent way | [['we', 'consider', 'the', 'problem', 'of', '1sided', 'deviceindependent', 'selftesting', 'of', 'any', 'pure', 'entangled', 'twoqubit', 'state', 'based', 'on', 'steering', 'inequalities', 'which', 'certify', 'the', 'presence', 'of', 'quantum', 'steering', 'in', 'particular', 'we', 'note', 'that', 'in', 'the', '222', 'steering', 'scenario', 'involving', '2', 'parties', '2', 'measurement', 'settings', 'per', 'party', '2', 'outcomes', 'per', 'measurement', 'setting', 'the', 'maximal', 'violation', 'of', 'a', 'finegrained', 'steering', 'inequality', 'can', 'be', 'used', 'to', 'witness', 'certain', 'extremal', 'steerable', 'correlations', 'which', 'certify', 'all', 'pure', 'twoqubit', 'entangled', 'states', 'we', 'demonstrate', 'that', 'the', 'violation', 'of', 'analogous', 'chsh', 'inequality', 'of', 'steering', 'or', 'nonvanishing', 'value', 'of', 'a', 'quantity', 'constructed', 'using', 'a', 'correlation', 'function', 'called', 'mutual', 'predictability', 'together', 'with', 'the', 'maximal', 'violation', 'of', 'finegrained', 'steering', 'inequality', 'can', 'be', 'used', 'to', 'selftest', 'any', 'pure', 'entangled', 'twoqubit', 'state', 'in', 'a', '1sided', 'deviceindependent', 'way']] | [-0.15607184895953116, 0.1641058042214429, -0.06988058517848657, 0.08050925871896103, -0.0011303255580796684, -0.34834499736431956, 0.06439981640178002, 0.27262744065066263, -0.2362416188390387, -0.2838710066746951, 0.05047416545100479, -0.27117945382002095, -0.04668851879671647, 0.19443540153919125, -0.10548063640844477, 0.1664070441764741, 0.04384154610890002, 0.02100642068573266, -0.08584664793000056, -0.25575050200751315, 0.3183025539129172, -0.05214929732028395, 0.29756671149853214, 0.053036089139905845, 0.12323964167047631, 0.07318517351753948, 0.09321971074485581, 0.012653040843977293, -0.10428810923243392, 0.14024019942951796, 0.27208329570356543, 0.2543576485092544, 0.26841924068602646, -0.3577447436011035, -0.12763344879793234, 0.25032870409902463, 0.06117250299281325, 0.15730545595711606, -0.006499854269560642, -0.3890032761938069, -0.05190819106064737, -0.22216266779467647, -0.13394035862312337, -0.11081133780554553, -0.01909940634384628, -0.10008652895411924, -0.34292194675962046, 0.18594264231375918, 0.060037015610151304, 0.01915487810903929, 0.03867474470426105, 0.014706066336236463, 0.031064906919544392, 0.08773940405038701, -0.11033092032105869, -0.004826747431335124, 0.14073345559256628, -0.0559411283836446, -0.279332620858057, 0.2869390205110708, 0.0037135912090047333, -0.27076192246749997, 0.08641091057807515, -0.18297947239715698, -0.1599233733119216, -0.026684788856193548, 0.15442576602270658, 0.11620224160257696, -0.12302727144488618, -0.030992804618536932, -0.14838759314022526, 0.2611570625589037, 0.1345740127000065, 0.18625891476500134, 0.11611476933683677, 0.003086638513736981, 0.17915801205172027, 0.23280411370460344, -0.022467425264310368, -0.11979172866375855, -0.4044842281001658, -0.2704410983157183, -0.27139373300770253, 0.14451179736532455, -0.11839955721881763, -0.029667573334449086, 0.3665301011921453, 0.09458812006002615, 0.07298500233229772, 0.012260805301691505, 0.2538529939695515, 0.049220695422023286, 0.04608930572713456, 0.0783225311320429, 0.2895652411028373, 0.1594136824450371, 0.04880326301290477, -0.20021944987243195, 0.16914094265642737, -0.005324368683086354] |
1,803.03214 | Grain-Boundary Kinetics: A Unified Approach | Grain boundaries (GBs) are central defects for describing polycrystalline
materials, and playing major role in a wide-range of physical properties of
polycrystals. Control over GB kinetics provides effective means to tailor
polycrystal properties through material processing. While many approaches
describe different GB kinetic phenomena, this review provides a unifying
concept for a wide range of GB kinetic behavior. Our approach rests on a
disconnection description of GB kinetics. Disconnections are topological line
defects constrained to crystalline interfaces with both step and dislocation
character. These characteristics can be completely specified by GB
bicrystallography and the macroscopic degrees of freedom of GBs. GB thermal
fluctuations, GB migration and the ability of GBs to absorb/emit other defects
from/into the delimiting grains can be modeled via the nucleation, propagation
and reaction of disconnections in the GB. We review the fundamentals of
bicrystallography and its relationship to disconnections and ultimately to the
kinetic behavior of GBs. We then relate disconnection dynamics and GB kinetics
to microstructural evolution. While this review of the GB kinetics literature
is not exhaustive, we review much of the foundational literature and draw
comparisons from a wide swath of the extant experimental, simulation, and
theoretical GB kinetics literature.
| cond-mat.mtrl-sci | grain boundaries gbs are central defects for describing polycrystalline materials and playing major role in a widerange of physical properties of polycrystals control over gb kinetics provides effective means to tailor polycrystal properties through material processing while many approaches describe different gb kinetic phenomena this review provides a unifying concept for a wide range of gb kinetic behavior our approach rests on a disconnection description of gb kinetics disconnections are topological line defects constrained to crystalline interfaces with both step and dislocation character these characteristics can be completely specified by gb bicrystallography and the macroscopic degrees of freedom of gbs gb thermal fluctuations gb migration and the ability of gbs to absorbemit other defects frominto the delimiting grains can be modeled via the nucleation propagation and reaction of disconnections in the gb we review the fundamentals of bicrystallography and its relationship to disconnections and ultimately to the kinetic behavior of gbs we then relate disconnection dynamics and gb kinetics to microstructural evolution while this review of the gb kinetics literature is not exhaustive we review much of the foundational literature and draw comparisons from a wide swath of the extant experimental simulation and theoretical gb kinetics literature | [['grain', 'boundaries', 'gbs', 'are', 'central', 'defects', 'for', 'describing', 'polycrystalline', 'materials', 'and', 'playing', 'major', 'role', 'in', 'a', 'widerange', 'of', 'physical', 'properties', 'of', 'polycrystals', 'control', 'over', 'gb', 'kinetics', 'provides', 'effective', 'means', 'to', 'tailor', 'polycrystal', 'properties', 'through', 'material', 'processing', 'while', 'many', 'approaches', 'describe', 'different', 'gb', 'kinetic', 'phenomena', 'this', 'review', 'provides', 'a', 'unifying', 'concept', 'for', 'a', 'wide', 'range', 'of', 'gb', 'kinetic', 'behavior', 'our', 'approach', 'rests', 'on', 'a', 'disconnection', 'description', 'of', 'gb', 'kinetics', 'disconnections', 'are', 'topological', 'line', 'defects', 'constrained', 'to', 'crystalline', 'interfaces', 'with', 'both', 'step', 'and', 'dislocation', 'character', 'these', 'characteristics', 'can', 'be', 'completely', 'specified', 'by', 'gb', 'bicrystallography', 'and', 'the', 'macroscopic', 'degrees', 'of', 'freedom', 'of', 'gbs', 'gb', 'thermal', 'fluctuations', 'gb', 'migration', 'and', 'the', 'ability', 'of', 'gbs', 'to', 'absorbemit', 'other', 'defects', 'frominto', 'the', 'delimiting', 'grains', 'can', 'be', 'modeled', 'via', 'the', 'nucleation', 'propagation', 'and', 'reaction', 'of', 'disconnections', 'in', 'the', 'gb', 'we', 'review', 'the', 'fundamentals', 'of', 'bicrystallography', 'and', 'its', 'relationship', 'to', 'disconnections', 'and', 'ultimately', 'to', 'the', 'kinetic', 'behavior', 'of', 'gbs', 'we', 'then', 'relate', 'disconnection', 'dynamics', 'and', 'gb', 'kinetics', 'to', 'microstructural', 'evolution', 'while', 'this', 'review', 'of', 'the', 'gb', 'kinetics', 'literature', 'is', 'not', 'exhaustive', 'we', 'review', 'much', 'of', 'the', 'foundational', 'literature', 'and', 'draw', 'comparisons', 'from', 'a', 'wide', 'swath', 'of', 'the', 'extant', 'experimental', 'simulation', 'and', 'theoretical', 'gb', 'kinetics', 'literature']] | [-0.12199602523127842, 0.10163690763577933, -0.08131224539963058, -0.007400460268622644, -0.09050664661110056, -0.08242387557120125, 0.06587187404036332, 0.3703061396503175, -0.29156311017898273, -0.3135555050934532, 0.052127886018288154, -0.23340148912690467, -0.1449555483508893, 0.17604882313278314, -0.03346303313951559, 0.012506165643571876, 0.02592343096478785, -0.05393488788312035, -0.049455768211949046, -0.2451056887488337, 0.26093661236548227, 0.0641847950629403, 0.32803786260536777, 0.09739064421517803, 0.05825014043675394, -0.022765806096853042, -0.0033702179480686175, 0.03887364049252046, -0.23159367566434097, 0.13936677157976285, 0.24822336512294654, 0.01476547915764077, 0.17640443832366443, -0.48662470207473607, -0.28536302728426394, 0.0145362058621166, 0.11646286141583506, 0.15424325254415244, -0.03417231791773906, -0.21971128793547348, 0.10482549692066956, -0.12328407628110097, -0.08342796302154706, -0.04219690380126181, 0.043563827680280116, 0.044147243257018035, -0.1861780319952083, 0.0839618867759448, 0.0598923273251525, 0.10170629118407046, -0.10852191681386808, -0.10493280697965576, -0.08420068915453455, 0.1201335841704312, 0.04801796733553768, -0.01816565771536707, 0.23437444296337626, -0.1441212011892016, -0.135545310807861, 0.42947982795232414, 0.01744540072906268, -0.13817825358674615, 0.25024781090787096, -0.10951795932235153, -0.1038602888797961, 0.1716905773213586, 0.16482432792438384, 0.09427993736058778, -0.16368089802800773, 0.07466838860763142, 0.0840974437329462, 0.14782928653317978, 0.04686197320864137, 0.04661114971932708, 0.23426940171190594, 0.22442518086742838, -0.025379514160054635, 0.1567402891250451, -0.07640782664933869, -0.17383709126057065, -0.29538188902637447, -0.21476661063474128, -0.13102138920672884, 0.06803727638558782, -0.11532575357809297, -0.17291661160190266, 0.36406947231414366, 0.15478870838498032, 0.17449499257247447, -0.021153910510831188, 0.19597053687962496, 0.006224672108703312, 0.068876921268161, 0.013722799312114259, 0.1753901030478657, 0.14126354416152842, 0.13522524788811785, -0.235641739060342, 0.1058844384922627, 0.0076775414945215595] |
1,803.03215 | Deep Learning: A Tool for Computational Nuclear Physics | In recent years, several successful applications of the Artificial Neural
Networks (ANNs) have emerged in nuclear physics and high-energy physics, as
well as in biology, chemistry, meteorology, and other fields of science. A
major goal of nuclear theory is to predict nuclear structure and nuclear
reactions from the underlying theory of the strong interactions, Quantum
Chromodynamics (QCD). With access to powerful High Performance Computing (HPC)
systems, several ab initio approaches, such as the No-Core Shell Model (NCSM),
have been developed to calculate the properties of atomic nuclei. However, to
accurately solve for the properties of atomic nuclei, one faces immense
theoretical and computational challenges. The present study proposes a
feed-forward ANN method for predicting the properties of atomic nuclei like
ground state energy and ground state point proton root-mean-square (rms) radius
based on NCSM results in computationally accessible basis spaces. The designed
ANNs are sufficient to produce results for these two very different observables
in 6Li from the ab initio NCSM results in small basis spaces that satisfy the
theoretical physics condition: independence of basis space parameters in the
limit of extremely large matrices. We also provide comparisons of the results
from ANNs with established methods of estimating the results in the infinite
matrix limit.
| physics.comp-ph nucl-th | in recent years several successful applications of the artificial neural networks anns have emerged in nuclear physics and highenergy physics as well as in biology chemistry meteorology and other fields of science a major goal of nuclear theory is to predict nuclear structure and nuclear reactions from the underlying theory of the strong interactions quantum chromodynamics qcd with access to powerful high performance computing hpc systems several ab initio approaches such as the nocore shell model ncsm have been developed to calculate the properties of atomic nuclei however to accurately solve for the properties of atomic nuclei one faces immense theoretical and computational challenges the present study proposes a feedforward ann method for predicting the properties of atomic nuclei like ground state energy and ground state point proton rootmeansquare rms radius based on ncsm results in computationally accessible basis spaces the designed anns are sufficient to produce results for these two very different observables in 6li from the ab initio ncsm results in small basis spaces that satisfy the theoretical physics condition independence of basis space parameters in the limit of extremely large matrices we also provide comparisons of the results from anns with established methods of estimating the results in the infinite matrix limit | [['in', 'recent', 'years', 'several', 'successful', 'applications', 'of', 'the', 'artificial', 'neural', 'networks', 'anns', 'have', 'emerged', 'in', 'nuclear', 'physics', 'and', 'highenergy', 'physics', 'as', 'well', 'as', 'in', 'biology', 'chemistry', 'meteorology', 'and', 'other', 'fields', 'of', 'science', 'a', 'major', 'goal', 'of', 'nuclear', 'theory', 'is', 'to', 'predict', 'nuclear', 'structure', 'and', 'nuclear', 'reactions', 'from', 'the', 'underlying', 'theory', 'of', 'the', 'strong', 'interactions', 'quantum', 'chromodynamics', 'qcd', 'with', 'access', 'to', 'powerful', 'high', 'performance', 'computing', 'hpc', 'systems', 'several', 'ab', 'initio', 'approaches', 'such', 'as', 'the', 'nocore', 'shell', 'model', 'ncsm', 'have', 'been', 'developed', 'to', 'calculate', 'the', 'properties', 'of', 'atomic', 'nuclei', 'however', 'to', 'accurately', 'solve', 'for', 'the', 'properties', 'of', 'atomic', 'nuclei', 'one', 'faces', 'immense', 'theoretical', 'and', 'computational', 'challenges', 'the', 'present', 'study', 'proposes', 'a', 'feedforward', 'ann', 'method', 'for', 'predicting', 'the', 'properties', 'of', 'atomic', 'nuclei', 'like', 'ground', 'state', 'energy', 'and', 'ground', 'state', 'point', 'proton', 'rootmeansquare', 'rms', 'radius', 'based', 'on', 'ncsm', 'results', 'in', 'computationally', 'accessible', 'basis', 'spaces', 'the', 'designed', 'anns', 'are', 'sufficient', 'to', 'produce', 'results', 'for', 'these', 'two', 'very', 'different', 'observables', 'in', '6li', 'from', 'the', 'ab', 'initio', 'ncsm', 'results', 'in', 'small', 'basis', 'spaces', 'that', 'satisfy', 'the', 'theoretical', 'physics', 'condition', 'independence', 'of', 'basis', 'space', 'parameters', 'in', 'the', 'limit', 'of', 'extremely', 'large', 'matrices', 'we', 'also', 'provide', 'comparisons', 'of', 'the', 'results', 'from', 'anns', 'with', 'established', 'methods', 'of', 'estimating', 'the', 'results', 'in', 'the', 'infinite', 'matrix', 'limit']] | [-0.011758983304451515, 0.0976282560749252, -0.08465411105312452, 0.1288559849016232, -0.014910892669747515, -0.10138673428531236, 0.023133851267772204, 0.3868372123506738, -0.24099651952842024, -0.3247968208430925, 0.05292548759522416, -0.2785536096317739, -0.1280270100275918, 0.19666729289924773, 0.019999444910052528, 0.13495211367745225, 0.08885241714646903, 0.0019849567192999885, -0.10102506043395118, -0.20965525548814273, 0.28879502688920716, 0.09125232380053892, 0.2768721091265722, 0.07331491088290222, 0.060189313382455485, -0.020818264663174022, -0.0019382810560850108, -0.015023253837787751, -0.12486196362499358, 0.18090373564670545, 0.3250071420084413, 0.1197273755593725, 0.2703087724938353, -0.5106856309729287, -0.22751908663478565, 0.08684130350309538, 0.10857515303565689, 0.14456801645616751, -0.06838829536956349, -0.2654504505440411, 0.03923029109563043, -0.20097295572958523, -0.15324350329706582, -0.16684582984790478, 0.03174597530983525, 0.06545535403888718, -0.2367501321490059, 0.029761004344440952, -0.014411108216225373, 0.08642071685413034, -0.09873777292555244, -0.21601424253398052, 0.03962324260416009, 0.12392696896567941, 0.016976118129223765, 0.043815504725477315, 0.1458967161489787, -0.17459073963052615, -0.14416421150970388, 0.4288261627051525, -0.011592846436471474, -0.1368437595665455, 0.20780249632463405, -0.1148846467025578, -0.1904306352729114, 0.10084270195014741, 0.18254372164289034, 0.07817643126813559, -0.13730237591563066, 0.11408122123826704, -0.017909336991312846, 0.15680241388816774, -0.004459934334111649, 0.06596631596955221, 0.1735513723580303, 0.21560076985780785, 0.007133633009919034, 0.04895673966427084, -0.10021795636133814, -0.15015578631073145, -0.2346222032520284, -0.0851962574557458, -0.21366487411645854, 0.038400669847955794, -0.06265754187444122, -0.16621994261698025, 0.36340808561298904, 0.1555413670815164, 0.15999350220237563, -0.0214132115256223, 0.2960685650704474, 0.034165102449279824, 0.06497042990863187, 0.044202580576671695, 0.28919490358178934, 0.21254520906453453, 0.07083566751694534, -0.20341424580277284, 0.028436932235206592, 0.06829439415028546] |
1,803.03216 | Distributed Fault Detection and Accommodation in Dynamic Average
Consensus | This paper presents the formulation of fault detection and accommodation
schemes for a network of autonomous agents running internal model-based dynamic
average consensus algorithms. We focus on two types of consensus algorithms,
one that is internally stable but non-robust to initial conditions and one that
is robust to initial conditions but not internally stable. For each consensus
algorithm, a fault detection filter based on the unknown input observer scheme
is developed for precisely estimating the communication faults that occur on
the network edges. We then propose a fault remediation scheme so that the
agents could reach average consensus even in the presence of communication
faults.
| math.OC math.DS | this paper presents the formulation of fault detection and accommodation schemes for a network of autonomous agents running internal modelbased dynamic average consensus algorithms we focus on two types of consensus algorithms one that is internally stable but nonrobust to initial conditions and one that is robust to initial conditions but not internally stable for each consensus algorithm a fault detection filter based on the unknown input observer scheme is developed for precisely estimating the communication faults that occur on the network edges we then propose a fault remediation scheme so that the agents could reach average consensus even in the presence of communication faults | [['this', 'paper', 'presents', 'the', 'formulation', 'of', 'fault', 'detection', 'and', 'accommodation', 'schemes', 'for', 'a', 'network', 'of', 'autonomous', 'agents', 'running', 'internal', 'modelbased', 'dynamic', 'average', 'consensus', 'algorithms', 'we', 'focus', 'on', 'two', 'types', 'of', 'consensus', 'algorithms', 'one', 'that', 'is', 'internally', 'stable', 'but', 'nonrobust', 'to', 'initial', 'conditions', 'and', 'one', 'that', 'is', 'robust', 'to', 'initial', 'conditions', 'but', 'not', 'internally', 'stable', 'for', 'each', 'consensus', 'algorithm', 'a', 'fault', 'detection', 'filter', 'based', 'on', 'the', 'unknown', 'input', 'observer', 'scheme', 'is', 'developed', 'for', 'precisely', 'estimating', 'the', 'communication', 'faults', 'that', 'occur', 'on', 'the', 'network', 'edges', 'we', 'then', 'propose', 'a', 'fault', 'remediation', 'scheme', 'so', 'that', 'the', 'agents', 'could', 'reach', 'average', 'consensus', 'even', 'in', 'the', 'presence', 'of', 'communication', 'faults']] | [-0.21927863334172537, 0.059717143193951674, -0.07649128862789699, 0.02476917816813858, -0.0638559150686931, -0.23200866653184807, 0.081468593463346, 0.4465783244087583, -0.23250747034769684, -0.30673504056675094, 0.15684622009395666, -0.1731091755043183, -0.1765140250591295, 0.12970996653838526, -0.12861801114022023, 0.09080929851070756, 0.12419550967849015, 0.07389766298944042, 0.005049812108544367, -0.2954245430018221, 0.2816640951981147, 0.045700130398784365, 0.30648944150833857, -0.017839791244339376, 0.1417432507854842, 0.013146830271441666, 0.019284393252538782, 0.06461476003972902, -0.09035855192563585, 0.10787542441505052, 0.2881042496877767, 0.1902363989723935, 0.32797756326340494, -0.42501767053091455, -0.181816979604108, 0.1533063791947262, 0.12146282673236869, 0.1608184699190869, -0.008123136357226897, -0.2923705128952861, 0.13987177603301548, -0.1671196327677795, -0.05105890108361131, -0.025858312916188012, 0.011276551016739437, 0.01894941172518191, -0.30695123105265554, 0.03485267196028005, 0.06651199303700456, 0.0361525329628161, -0.08178715352855978, -0.04585921504268689, 0.023298666094030654, 0.11331645976752043, -0.023232807553861114, -0.02622810508168879, 0.20554826088870565, -0.1094458924839273, -0.16457864536593358, 0.366145547958357, 0.018526186235249043, -0.20042245042998166, 0.18929169087981185, 0.0034724492491001176, -0.1824122686293863, 0.1363868567471703, 0.22967522298651083, 0.11521746748171392, -0.16583156401424537, -0.011324492692282157, 0.0011141047946044377, 0.18416633356273884, 0.03371932129043021, 0.011844550392457418, 0.13786652623897508, 0.20612752913120425, 0.22887262520158574, 0.0919485015040707, -0.07467689575583097, -0.09995164857245982, -0.2577119648811363, -0.1253508447580749, -0.15808791647709552, -0.03477042514950015, -0.08841313118796928, -0.20405450616741463, 0.3891390480214059, 0.23935195936688355, 0.1362942624704114, 0.09565317882224918, 0.3993990259056556, 0.06011852918281441, 0.02541678820160173, 0.1611277708473305, 0.24510920073038767, 0.03280915807311734, 0.05366769811315905, -0.19686453724723488, 0.193707646887439, 0.04170246912787358] |
1,803.03217 | Multilevel Illumination Coding for Fourier Transform Interferometry in
Fluorescence Spectroscopy | Fourier Transform Interferometry (FTI) is an interferometric procedure for
acquiring HyperSpectral (HS) data. Recently, it has been observed that the
light source highlighting a (biologic) sample can be coded before the FTI
acquisition in a procedure called Coded Illumination-FTI (CI-FTI). This turns
HS data reconstruction into a Compressive Sensing (CS) problem regularized by
the sparsity of the HS data. CI-FTI combines the high spectral resolution of
FTI with the advantages of reduced-light-exposure imaging in biology.
In this paper, we leverage multilevel sampling scheme recently developed in
CS theory to adapt the coding strategy of CI-FTI to the spectral sparsity
structure of HS data in Fluorescence Spectroscopy (FS). This structure is
actually extracted from the spectral signatures of actual fluorescent dyes used
in FS. Accordingly, the optimum illumination coding as well as the theoretical
recovery guarantee are derived. We conduct numerous numerical experiments on
synthetic and experimental data that show the faithfulness of the proposed
theory to experimental observations.
| cs.IT math.IT | fourier transform interferometry fti is an interferometric procedure for acquiring hyperspectral hs data recently it has been observed that the light source highlighting a biologic sample can be coded before the fti acquisition in a procedure called coded illuminationfti cifti this turns hs data reconstruction into a compressive sensing cs problem regularized by the sparsity of the hs data cifti combines the high spectral resolution of fti with the advantages of reducedlightexposure imaging in biology in this paper we leverage multilevel sampling scheme recently developed in cs theory to adapt the coding strategy of cifti to the spectral sparsity structure of hs data in fluorescence spectroscopy fs this structure is actually extracted from the spectral signatures of actual fluorescent dyes used in fs accordingly the optimum illumination coding as well as the theoretical recovery guarantee are derived we conduct numerous numerical experiments on synthetic and experimental data that show the faithfulness of the proposed theory to experimental observations | [['fourier', 'transform', 'interferometry', 'fti', 'is', 'an', 'interferometric', 'procedure', 'for', 'acquiring', 'hyperspectral', 'hs', 'data', 'recently', 'it', 'has', 'been', 'observed', 'that', 'the', 'light', 'source', 'highlighting', 'a', 'biologic', 'sample', 'can', 'be', 'coded', 'before', 'the', 'fti', 'acquisition', 'in', 'a', 'procedure', 'called', 'coded', 'illuminationfti', 'cifti', 'this', 'turns', 'hs', 'data', 'reconstruction', 'into', 'a', 'compressive', 'sensing', 'cs', 'problem', 'regularized', 'by', 'the', 'sparsity', 'of', 'the', 'hs', 'data', 'cifti', 'combines', 'the', 'high', 'spectral', 'resolution', 'of', 'fti', 'with', 'the', 'advantages', 'of', 'reducedlightexposure', 'imaging', 'in', 'biology', 'in', 'this', 'paper', 'we', 'leverage', 'multilevel', 'sampling', 'scheme', 'recently', 'developed', 'in', 'cs', 'theory', 'to', 'adapt', 'the', 'coding', 'strategy', 'of', 'cifti', 'to', 'the', 'spectral', 'sparsity', 'structure', 'of', 'hs', 'data', 'in', 'fluorescence', 'spectroscopy', 'fs', 'this', 'structure', 'is', 'actually', 'extracted', 'from', 'the', 'spectral', 'signatures', 'of', 'actual', 'fluorescent', 'dyes', 'used', 'in', 'fs', 'accordingly', 'the', 'optimum', 'illumination', 'coding', 'as', 'well', 'as', 'the', 'theoretical', 'recovery', 'guarantee', 'are', 'derived', 'we', 'conduct', 'numerous', 'numerical', 'experiments', 'on', 'synthetic', 'and', 'experimental', 'data', 'that', 'show', 'the', 'faithfulness', 'of', 'the', 'proposed', 'theory', 'to', 'experimental', 'observations']] | [-0.05295497877224802, 0.02965833010080715, -0.1209396787483293, 0.050128822533551075, -0.044190864359291315, -0.15069439069021684, 0.028066189146976776, 0.43511596451011986, -0.304968789855663, -0.3055636565475605, 0.14838750167743853, -0.24444261269691664, -0.17954498887635195, 0.16206255477094927, -0.1170761728575692, 0.10494818078512207, 0.08241391445969781, -0.013940683786924452, -0.08315315184434159, -0.20821239773888522, 0.225346266083085, 0.09469119776846267, 0.3439425869594113, -0.008252184960441902, 0.09349607240456419, 0.01454029427184604, -0.05664518534635695, -0.023138804937703893, -0.08247218126453869, 0.1466332826000722, 0.31400012189092547, 0.21626815948374292, 0.24701557607234767, -0.414770408778051, -0.27524287823754817, 0.03749103620737934, 0.14851408182846335, 0.10390742249392833, -0.10788704228411333, -0.31076788091554475, 0.07869957208943863, -0.101158835984862, -0.04048333427635953, -0.10895426395850685, -0.039656340571430825, -0.003679629009312544, -0.30847985416617935, 0.058371908034389026, 0.006812579442526047, 0.06702723399473307, -0.10263493763378416, -0.09659853733431262, 0.013169939717791306, 0.07433715782080515, 0.017401915291348137, 0.029455954907462, 0.08110800565918908, -0.08159151721674089, -0.10745094189844213, 0.3447431116961898, -0.051659372115794286, -0.14363151813487116, 0.1623867953148408, -0.11952027106860605, -0.1564255024646767, 0.18855277405908474, 0.1307495018632975, 0.11363557515403208, -0.12222393725786763, 0.0775767274149425, -0.05210106515994248, 0.21844635802643517, 0.07284972313284062, 0.09381288740163048, 0.12143865035240872, 0.20157815523756048, 0.038474311565574355, 0.15334569847432133, -0.2155866699714142, -0.03819590722783827, -0.196214478289804, -0.12766652119208652, -0.2653918725838407, -0.013011222311223928, -0.0784916211014206, -0.12003220959405343, 0.3816202541460231, 0.1540613493625409, 0.1820968568492203, -0.004198434268637823, 0.35948003088243496, 0.07234834658895405, 0.08063084112468343, -0.010610777801141525, 0.2071539879961608, 0.1433244329031694, 0.14464346552864674, -0.2378967095581361, 0.005181133597850418, 0.0351853115687099] |
1,803.03218 | The least prime number represented by a binary quadratic form | Let $D<0$ be a fundamental discriminant and $h(D)$ be the class number of
$\mathbb{Q}(\sqrt{D})$. Let $R(X,D)$ be the number of classes of the binary
quadratic forms of discriminant $D$ which represent a prime number in the
interval $[X,2X]$. Moreover, assume that $\pi_{D}(X)$ is the number of primes,
which split in $\mathbb{Q}(\sqrt{D})$ with norm in the interval $[X,2X].$ We
prove that $$ \Big(\frac{\pi_D(X)}{\pi(X)}\Big)^2 \ll
\frac{R(X,D)}{h(D)}\Big(1+\frac{h(D)}{\pi(X)}\Big), $$ where $\pi(X)$ is the
number of primes in the interval $[X,2X]$ and the implicit constant in $\ll$ is
independent of $D$ and $X$.
| math.NT | let d0 be a fundamental discriminant and hd be the class number of mathbbqsqrtd let rxd be the number of classes of the binary quadratic forms of discriminant d which represent a prime number in the interval x2x moreover assume that pi_dx is the number of primes which split in mathbbqsqrtd with norm in the interval x2x we prove that bigfracpi_dxpixbig2 ll fracrxdhdbig1frachdpixbig where pix is the number of primes in the interval x2x and the implicit constant in ll is independent of d and x | [['let', 'd0', 'be', 'a', 'fundamental', 'discriminant', 'and', 'hd', 'be', 'the', 'class', 'number', 'of', 'mathbbqsqrtd', 'let', 'rxd', 'be', 'the', 'number', 'of', 'classes', 'of', 'the', 'binary', 'quadratic', 'forms', 'of', 'discriminant', 'd', 'which', 'represent', 'a', 'prime', 'number', 'in', 'the', 'interval', 'x2x', 'moreover', 'assume', 'that', 'pi_dx', 'is', 'the', 'number', 'of', 'primes', 'which', 'split', 'in', 'mathbbqsqrtd', 'with', 'norm', 'in', 'the', 'interval', 'x2x', 'we', 'prove', 'that', 'bigfracpi_dxpixbig2', 'll', 'fracrxdhdbig1frachdpixbig', 'where', 'pix', 'is', 'the', 'number', 'of', 'primes', 'in', 'the', 'interval', 'x2x', 'and', 'the', 'implicit', 'constant', 'in', 'll', 'is', 'independent', 'of', 'd', 'and', 'x']] | [-0.21939134779607966, 0.1347982449944885, -0.08144166921660403, 0.0036611476056610365, -0.045933250044029025, -0.15465875441164134, 0.012621968452419554, 0.2488411857214357, -0.3131208700970525, -0.2771726310297492, 0.04326505456923596, -0.27857228541480644, -0.05976131915425261, 0.19371470941197394, -0.055520528428522606, -0.027784307867044673, 0.025427799799390846, 0.1584114223452551, 0.006327720435192099, -0.3214261230258715, 0.3189277464989573, -0.08553152750911457, 0.1184580328297757, 0.002308203173535211, 0.04971690464853531, 0.015240549159768437, 0.03253411794901781, 0.014376539748073333, -0.1079681676965265, 0.08230463085263702, 0.3304975102156667, 0.10953770302451933, 0.29559527568164323, -0.3256268546517406, -0.11894837524076658, 0.2469264209004385, 0.14610246607723334, -0.06466234896963995, 0.04083998281497597, -0.17844850189257636, 0.18474713465270942, -0.13757663415301413, -0.09784124037694364, -0.01897559656451146, 0.1245560583248291, 0.061639911511779895, -0.3654291274114734, 0.04789780317583964, 0.07747849478341994, 0.1235925345570736, -0.015457686272427617, -0.19964517460071615, -0.0061433471827989534, 0.03126462291194392, 0.03988649773999073, 0.08590306800102726, -0.010543169115581327, -0.06917534540185616, -0.061301608791663534, 0.3331801640756783, -0.058355344947250115, -0.22670172128294194, 0.10039733445072281, -0.21059535859551812, -0.15607438019720749, 0.1276984122648303, 0.15113613158020944, 0.15042333788282813, -0.00558851224126383, 0.21320217745614217, -0.13792356213421694, 0.19612877905074994, 0.09551302428978185, 0.0314939255975852, 0.14180972830148503, 0.09462632947889645, 0.0524673259573146, 0.10375491162301928, -0.0965359187795825, 0.021321322192393598, -0.36133995723156703, -0.20124797653295987, -0.2203191152297049, 0.11519931840095003, -0.14418300488978275, -0.1626292954509457, 0.36889673946868806, 0.043305327233004696, 0.2482873873197518, 0.11317462242662996, 0.1844613329019575, 0.11856482969596982, 0.037639267213221285, 0.11284982374802764, 0.09568406215735845, 0.15755956779633248, -0.06558594806674159, -0.1927179777994752, 0.031331290396684336, 0.13326931956578933] |
1,803.03219 | Integrable quad equations derived from the quantum Yang-Baxter equation | This paper presents an explicit correspondence between two different types of
integrable equations; the quantum Yang-Baxter equation in its star-triangle
relation form, and the classical 3D-consistent quad equations in the
Adler-Bobenko-Suris (ABS) classification. Each of the 3D-consistent ABS quad
equations of $H$-type, are respectively derived from the quasi-classical
expansion of a counterpart star-triangle relation. Through these derivations it
is seen that the star-triangle relation provides a natural path integral
quantization of an ABS equation. The interpretation of the different
star-triangle relations is also given in terms of
(hyperbolic/rational/classical) hypergeometric integrals, revealing the
hypergeometric structure that links the two different types of integrable
systems. Many new limiting relations that exist between the star-triangle
relations/hypergeometric integrals are proven for each case.
| math-ph math.MP nlin.SI | this paper presents an explicit correspondence between two different types of integrable equations the quantum yangbaxter equation in its startriangle relation form and the classical 3dconsistent quad equations in the adlerbobenkosuris abs classification each of the 3dconsistent abs quad equations of htype are respectively derived from the quasiclassical expansion of a counterpart startriangle relation through these derivations it is seen that the startriangle relation provides a natural path integral quantization of an abs equation the interpretation of the different startriangle relations is also given in terms of hyperbolicrationalclassical hypergeometric integrals revealing the hypergeometric structure that links the two different types of integrable systems many new limiting relations that exist between the startriangle relationshypergeometric integrals are proven for each case | [['this', 'paper', 'presents', 'an', 'explicit', 'correspondence', 'between', 'two', 'different', 'types', 'of', 'integrable', 'equations', 'the', 'quantum', 'yangbaxter', 'equation', 'in', 'its', 'startriangle', 'relation', 'form', 'and', 'the', 'classical', '3dconsistent', 'quad', 'equations', 'in', 'the', 'adlerbobenkosuris', 'abs', 'classification', 'each', 'of', 'the', '3dconsistent', 'abs', 'quad', 'equations', 'of', 'htype', 'are', 'respectively', 'derived', 'from', 'the', 'quasiclassical', 'expansion', 'of', 'a', 'counterpart', 'startriangle', 'relation', 'through', 'these', 'derivations', 'it', 'is', 'seen', 'that', 'the', 'startriangle', 'relation', 'provides', 'a', 'natural', 'path', 'integral', 'quantization', 'of', 'an', 'abs', 'equation', 'the', 'interpretation', 'of', 'the', 'different', 'startriangle', 'relations', 'is', 'also', 'given', 'in', 'terms', 'of', 'hyperbolicrationalclassical', 'hypergeometric', 'integrals', 'revealing', 'the', 'hypergeometric', 'structure', 'that', 'links', 'the', 'two', 'different', 'types', 'of', 'integrable', 'systems', 'many', 'new', 'limiting', 'relations', 'that', 'exist', 'between', 'the', 'startriangle', 'relationshypergeometric', 'integrals', 'are', 'proven', 'for', 'each', 'case']] | [-0.2156218103109262, 0.03329456950419455, -0.09108763010615212, 0.1083631136894433, -0.12827183831578645, -0.1407468367455543, -0.02277868326343437, 0.2851561189939578, -0.3201000954892136, -0.22916095418871468, 0.04173714216822424, -0.32139433725760913, -0.2130547549862128, 0.2540968408505631, -0.011339618872182492, 0.04192873215030194, 0.04258832197763726, 0.0407418758672081, -0.163562847325244, -0.2377034899018482, 0.3633278778825815, -0.08791435928318776, 0.26646429346675354, -0.04706912134718309, 0.17104231579722756, -0.026876493046681087, -0.013327756777214698, -0.06436493914001264, -0.17921601756346267, 0.09312279137551911, 0.27296015441927135, 0.06380844676994488, 0.17511272764143845, -0.37748768190160775, -0.14107100788352644, 0.06265540280116674, 0.1972291178157569, 0.06047539125618517, 0.0047515351882475056, -0.29231079833972085, 0.008167696062029682, -0.16252983767841744, -0.15559004408777014, -0.039881348363163635, 0.041748699496309154, 0.08270007146235842, -0.1976594326318178, 0.1325964284023473, 0.0928276644096288, 0.034376603376088485, -0.09481051480735883, -0.1191787827744061, -0.02583773018847992, 0.13889345493263158, -0.010156874191692561, 0.0030761644459114624, -0.028992823890259124, -0.14445650921219116, -0.11981008876051404, 0.36112369959935164, 0.006784436856117896, -0.2735755469154519, 0.1558826316653504, -0.09898251410709041, -0.18488547462237698, 0.05419518477800819, 0.0354057274854336, 0.0921520820986002, -0.24155337129506624, 0.1287633713775585, -0.08179817337574613, 0.09877597042518613, 0.11862049873472534, 0.03002804622420261, 0.1843124360429311, 0.06365321308342564, -0.0083826412849773, 0.14395769808489162, 0.011018664858694006, -0.17029423125756857, -0.3712023970627218, -0.19968914796208215, -0.11745297768562196, 0.09184209765711178, -0.13930285618126564, -0.17657132022496727, 0.32836853640957964, 0.10559445271879418, 0.14146735340866268, 0.08952749053883947, 0.20960220073660216, 0.24345150670339155, 0.03625647570444351, 0.02631533230280774, 0.17087834348711065, 0.1972013550898076, 0.08050713982257961, -0.23402922021167386, -0.03616541853715849, 0.17730165746970436] |
1,803.0322 | Predicting Software Defects through SVM: An Empirical Approach | Software defect prediction is an important aspect of preventive maintenance
of a software. Many techniques have been employed to improve software quality
through defect prediction. This paper introduces an approach of defect
prediction through a machine learning algorithm, support vector machines (SVM),
by using the code smells as the factor. Smell prediction model based on support
vector machines was used to predict defects in the subsequent releases of the
eclipse software. The results signify the role of smells in predicting the
defects of a software. The results can further be used as a baseline to
investigate further the role of smells in predicting defects.
| cs.SE | software defect prediction is an important aspect of preventive maintenance of a software many techniques have been employed to improve software quality through defect prediction this paper introduces an approach of defect prediction through a machine learning algorithm support vector machines svm by using the code smells as the factor smell prediction model based on support vector machines was used to predict defects in the subsequent releases of the eclipse software the results signify the role of smells in predicting the defects of a software the results can further be used as a baseline to investigate further the role of smells in predicting defects | [['software', 'defect', 'prediction', 'is', 'an', 'important', 'aspect', 'of', 'preventive', 'maintenance', 'of', 'a', 'software', 'many', 'techniques', 'have', 'been', 'employed', 'to', 'improve', 'software', 'quality', 'through', 'defect', 'prediction', 'this', 'paper', 'introduces', 'an', 'approach', 'of', 'defect', 'prediction', 'through', 'a', 'machine', 'learning', 'algorithm', 'support', 'vector', 'machines', 'svm', 'by', 'using', 'the', 'code', 'smells', 'as', 'the', 'factor', 'smell', 'prediction', 'model', 'based', 'on', 'support', 'vector', 'machines', 'was', 'used', 'to', 'predict', 'defects', 'in', 'the', 'subsequent', 'releases', 'of', 'the', 'eclipse', 'software', 'the', 'results', 'signify', 'the', 'role', 'of', 'smells', 'in', 'predicting', 'the', 'defects', 'of', 'a', 'software', 'the', 'results', 'can', 'further', 'be', 'used', 'as', 'a', 'baseline', 'to', 'investigate', 'further', 'the', 'role', 'of', 'smells', 'in', 'predicting', 'defects']] | [-0.05414618791725773, 0.02754423399528605, -0.08719882601872087, 0.07099387525186802, -0.053560891130473465, -0.15484149978370765, 0.053058316475541614, 0.41952368359153086, -0.221498521994083, -0.3156592163722962, 0.11059847330034245, -0.23901407865252203, -0.17040679166809872, 0.20599132962301014, -0.09803067787120548, 0.1365181822777511, 0.11895490480730167, 0.04397917367616454, -0.026564117341947097, -0.30139081853513533, 0.292193399849706, 0.15608339836426938, 0.3595517201958081, 0.11585301151857354, 0.004456479465051626, 0.019772283137381937, -0.06407006880572926, -0.0002572292802282251, -0.07886906681456961, 0.16727368361674821, 0.3283211222934859, 0.21838648701668717, 0.3442418322396966, -0.42211954462198686, -0.2461505642053313, 0.044941199343436614, 0.1583105070883623, 0.11414033242572959, -0.019264686173231054, -0.2701111763017252, 0.10475304200931881, -0.19747655510078543, -0.10518341631485292, -0.09855569863262084, -0.05808451675469629, 0.002640383067325904, -0.23913717647799507, -0.013901176137061646, 0.05923092148777169, 0.1209154214996558, -0.07762346143583553, -0.09443888408602036, -0.029882908727114018, 0.18532510151495585, 0.08809483185289607, 0.09592228934455377, 0.18595085808864006, -0.15781141285417385, -0.2425131962350301, 0.4077590094664349, -0.07157584906627353, -0.17902700970612037, 0.1665921364485537, 0.05614699183766229, -0.17298002082120198, 0.1022122346688635, 0.2667150175772034, 0.03774825184462735, -0.14933402752145553, -0.0006069973952924976, 0.040512691905650385, 0.19940757542365015, 0.009365383826661855, -0.04752814787654923, 0.23652342095290527, 0.24453122436310737, -0.0375340018458351, 0.14726207940279543, -0.08858768781423211, 0.001928859573896401, -0.21796742442081898, -0.22782180863074386, -0.12100298077208348, -0.0204224631373878, -0.08216179998663183, -0.21220594694694647, 0.4096184787340462, 0.20851982542976308, 0.14113511569583073, -0.01488882436667784, 0.2800798637147706, 0.04280371917635561, 0.14110427498459244, 0.08090272126719356, 0.20733074549375138, 0.04942192047467241, 0.10259065624380198, -0.20247102825557634, 0.1432274071714626, 0.06225185624610346] |
1,803.03221 | Singularities of the projections of $n$-dimensional knots | Let n be aninteger>4. There is a smoothly knotted n-dimensional sphere in
(n+2)-space such that the singular point set of its projection in (n+1)-space
consists of double points and that the components of the singular point set are
two. (The sphere is knotted in the sense that it does not bound any embedded
(n+1)-ball in (n+2)-space.) Furthermore, the projection is not the projection
of any unknotted sphere in the (n+2)-space. There are two inequivalent
embeddings of an n-manifold in the (n+2)-space such that the projection of one
of these in (n+1)-space has no double points and the projection of the other
has a connected embedded double point set.
| math.GT | let n be aninteger4 there is a smoothly knotted ndimensional sphere in n2space such that the singular point set of its projection in n1space consists of double points and that the components of the singular point set are two the sphere is knotted in the sense that it does not bound any embedded n1ball in n2space furthermore the projection is not the projection of any unknotted sphere in the n2space there are two inequivalent embeddings of an nmanifold in the n2space such that the projection of one of these in n1space has no double points and the projection of the other has a connected embedded double point set | [['let', 'n', 'be', 'aninteger4', 'there', 'is', 'a', 'smoothly', 'knotted', 'ndimensional', 'sphere', 'in', 'n2space', 'such', 'that', 'the', 'singular', 'point', 'set', 'of', 'its', 'projection', 'in', 'n1space', 'consists', 'of', 'double', 'points', 'and', 'that', 'the', 'components', 'of', 'the', 'singular', 'point', 'set', 'are', 'two', 'the', 'sphere', 'is', 'knotted', 'in', 'the', 'sense', 'that', 'it', 'does', 'not', 'bound', 'any', 'embedded', 'n1ball', 'in', 'n2space', 'furthermore', 'the', 'projection', 'is', 'not', 'the', 'projection', 'of', 'any', 'unknotted', 'sphere', 'in', 'the', 'n2space', 'there', 'are', 'two', 'inequivalent', 'embeddings', 'of', 'an', 'nmanifold', 'in', 'the', 'n2space', 'such', 'that', 'the', 'projection', 'of', 'one', 'of', 'these', 'in', 'n1space', 'has', 'no', 'double', 'points', 'and', 'the', 'projection', 'of', 'the', 'other', 'has', 'a', 'connected', 'embedded', 'double', 'point', 'set']] | [-0.18525587921997286, 0.10158182828775542, -0.08806359873346563, -0.004678338314714086, -0.021922552299176185, -0.13459264915348645, -0.005513305037791999, 0.36734226423333277, -0.2797460417561936, -0.18239261717799138, 0.1210305453289107, -0.33544655615147556, -0.13312410041997386, 0.1959543981334581, -0.07867657481956314, -0.01486716857059191, 0.04680400340870585, 0.11810226573274946, -0.09568779849675747, -0.24678525782985403, 0.37512231535137686, -0.10887813994898198, 0.19084343273095997, 0.029054019920844235, 0.10919377959842952, -0.003508899119278451, 0.03157449485558384, 0.06257677675259984, -0.085542348689314, 0.10948631568934838, 0.2390808852670609, 0.12964359124384398, 0.20679825560611514, -0.41219970699013125, -0.16961283475722908, 0.2278638468036112, 0.15896613359943312, -0.0038267190937163694, -0.01171514869860883, -0.21931207560020377, 0.117873852070913, -0.054894644969125404, -0.16686553072254612, -0.028568985046080825, 0.04277906472847428, 0.0024935484354226094, -0.17948537256638958, -0.04463838727020149, 0.14918097860689433, 0.010391345739645778, -0.016875220055226237, -0.10082635880043765, -0.07106478836273177, 0.12884216630866505, -0.02968071060439677, 0.13862966941142418, 0.10139039281825975, -0.07347153130707876, -0.11439670009191481, 0.3765032415383689, -0.04457024171210404, -0.3097869581806491, 0.17589361376990126, -0.1662525329958507, -0.13117716650320393, 0.1914973751211293, 0.08164815661356838, 0.11371780041042927, -0.07636327557661131, 0.189136688587616, -0.1395704526682648, 0.12024993267111296, 0.08717255177468343, -0.034371869933993535, 0.21173163510437282, 0.10503402585163713, 0.15089892197277052, 0.10263860900392141, -0.11469224256129479, -0.09672373790680519, -0.353934656415697, -0.22754297583234356, -0.22573580979018137, 0.08861372747073029, -0.13606984358921181, -0.2509616331882634, 0.3524136872663391, 0.017153416013450554, 0.23698711986565646, -0.01955875128788768, 0.25845406832665485, 0.0671442207579121, 0.09276478796898616, 0.11970540987028969, 0.2114623467842082, 0.08572420894326467, -0.04356632066697304, -0.12405831937432149, -0.009861173248797093, 0.13115981020437517] |
1,803.03222 | Large tunable intrinsic gap in rhombohedral-stacked tetralayer graphene | In rhombohedral-stacked few-layer graphene, the very flat energy bands near
the charge neutrality point are unstable to electronic interactions, giving
rise to states with spontaneous broken symmetries. Using transport measurements
on suspended rhombohedral-stacked tetralayer graphene, we observe an insulating
ground state with a large interaction-induced gap up to 80 meV. This gapped
state can be enhanced by a perpendicular magnetic field, and suppressed by an
interlayer potential, carrier density, or a critical temperature of ~ 40 K.
| cond-mat.mes-hall cond-mat.mtrl-sci | in rhombohedralstacked fewlayer graphene the very flat energy bands near the charge neutrality point are unstable to electronic interactions giving rise to states with spontaneous broken symmetries using transport measurements on suspended rhombohedralstacked tetralayer graphene we observe an insulating ground state with a large interactioninduced gap up to 80 mev this gapped state can be enhanced by a perpendicular magnetic field and suppressed by an interlayer potential carrier density or a critical temperature of 40 k | [['in', 'rhombohedralstacked', 'fewlayer', 'graphene', 'the', 'very', 'flat', 'energy', 'bands', 'near', 'the', 'charge', 'neutrality', 'point', 'are', 'unstable', 'to', 'electronic', 'interactions', 'giving', 'rise', 'to', 'states', 'with', 'spontaneous', 'broken', 'symmetries', 'using', 'transport', 'measurements', 'on', 'suspended', 'rhombohedralstacked', 'tetralayer', 'graphene', 'we', 'observe', 'an', 'insulating', 'ground', 'state', 'with', 'a', 'large', 'interactioninduced', 'gap', 'up', 'to', '80', 'mev', 'this', 'gapped', 'state', 'can', 'be', 'enhanced', 'by', 'a', 'perpendicular', 'magnetic', 'field', 'and', 'suppressed', 'by', 'an', 'interlayer', 'potential', 'carrier', 'density', 'or', 'a', 'critical', 'temperature', 'of', '40', 'k']] | [-0.22168918012788422, 0.27904271924489876, -0.01964409940180638, -0.007141127699900321, 0.014953933835051047, -0.1873471748074639, 0.15094157185491272, 0.4008722453819294, -0.27646993687621463, -0.32510944203884146, -0.03197847447805352, -0.34287118686265067, -0.06887375824704864, 0.10608842902155102, 0.0593553573309787, -0.005698713829348746, -0.025361427963760338, -0.08947962543338929, -0.09734757526434566, -0.16544454040826836, 0.269755908606672, 0.05312427123824723, 0.3565767183532252, 0.13687749886517658, 0.0023022502106246783, -0.03295418449469205, 0.18335426862866275, 0.02867262992444203, -0.16281744619022662, 0.01793631679902319, 0.2664828312454598, -0.222824213579052, 0.18698658423473766, -0.4563703626703692, -0.1651623079577755, -0.0009663716834773751, 0.13787857899564857, 0.17901880647925855, -0.08905153998861542, -0.33562952354795444, 0.0777232623291447, -0.14400952336865502, -0.1665134091163054, -0.11767744029241026, -0.026478462324073342, -0.07308903785030309, -0.21948090199944809, 0.13841582562676386, -0.000246570451724294, 0.07316211713661783, -0.12433631787395202, -0.10942137881035083, -0.15426117600873113, 0.03993056988110766, 0.053857469949626216, 0.08791983256263561, 0.22589948680251837, -0.14487199328907177, -0.09038396475003346, 0.3311561462469399, -0.08816414596022744, -0.08160770661197603, 0.17519911098918928, -0.1438481299831581, 0.0014809173298999667, 0.24857052317575404, 0.09157895020478846, 0.06323758228436897, -0.11606054955260142, 0.08937091231392084, 0.010772926394374258, 0.17659519327456732, 0.06860944028870251, 0.10054542238235865, 0.31881029200495076, 0.1633400295640489, 0.10822000320216543, 0.11647802085989449, -0.1266508931186859, -0.01698163200145293, -0.19979239321362816, -0.14225278622593338, -0.21008829054986372, 0.1703382835993053, -0.04186486401943655, -0.18780225037450068, 0.43326824480716725, 0.11088019161558661, 0.21230672133204184, -0.08221528522278133, 0.2185199982670479, 0.13898113651636154, 0.08823600027244538, 0.0706149696473547, 0.2640406525797995, 0.16288648875840744, 0.10534262341006022, -0.23557841689570955, -0.032478990563264996, -0.057092157131257024] |
1,803.03223 | On the spectrum of differential operators under Riemannian coverings | For a Riemannian covering $p \colon M_{2} \to M_{1}$, we compare the spectrum
of an essentially self-adjoint differential operator $D_{1}$ on a bundle $E_{1}
\to M_{1}$ with the spectrum of its lift $D_{2}$ on $p^{*}E_{1} \to M_{2}$. We
prove that if the covering is infinite sheeted and amenable, then the spectrum
of $D_{1}$ is contained in the essential spectrum of any self-adjoint extension
of $D_{2}$. We show that if the deck transformations group of the covering is
infinite and $D_{2}$ is essentially self-adjoint (or symmetric and bounded from
below), then $D_{2}$ (or the Friedrichs extension of $D_{2}$) does not have
eigenvalues of finite multiplicity and in particular, its spectrum is
essential. Moreover, we prove that if $M_{1}$ is closed, then $p$ is amenable
if and only if it preserves the bottom of the spectrum of some/any
Schr\"{o}dinger operator, extending a result due to Brooks.
| math.DG math.SP | for a riemannian covering p colon m_2 to m_1 we compare the spectrum of an essentially selfadjoint differential operator d_1 on a bundle e_1 to m_1 with the spectrum of its lift d_2 on pe_1 to m_2 we prove that if the covering is infinite sheeted and amenable then the spectrum of d_1 is contained in the essential spectrum of any selfadjoint extension of d_2 we show that if the deck transformations group of the covering is infinite and d_2 is essentially selfadjoint or symmetric and bounded from below then d_2 or the friedrichs extension of d_2 does not have eigenvalues of finite multiplicity and in particular its spectrum is essential moreover we prove that if m_1 is closed then p is amenable if and only if it preserves the bottom of the spectrum of someany schrodinger operator extending a result due to brooks | [['for', 'a', 'riemannian', 'covering', 'p', 'colon', 'm_2', 'to', 'm_1', 'we', 'compare', 'the', 'spectrum', 'of', 'an', 'essentially', 'selfadjoint', 'differential', 'operator', 'd_1', 'on', 'a', 'bundle', 'e_1', 'to', 'm_1', 'with', 'the', 'spectrum', 'of', 'its', 'lift', 'd_2', 'on', 'pe_1', 'to', 'm_2', 'we', 'prove', 'that', 'if', 'the', 'covering', 'is', 'infinite', 'sheeted', 'and', 'amenable', 'then', 'the', 'spectrum', 'of', 'd_1', 'is', 'contained', 'in', 'the', 'essential', 'spectrum', 'of', 'any', 'selfadjoint', 'extension', 'of', 'd_2', 'we', 'show', 'that', 'if', 'the', 'deck', 'transformations', 'group', 'of', 'the', 'covering', 'is', 'infinite', 'and', 'd_2', 'is', 'essentially', 'selfadjoint', 'or', 'symmetric', 'and', 'bounded', 'from', 'below', 'then', 'd_2', 'or', 'the', 'friedrichs', 'extension', 'of', 'd_2', 'does', 'not', 'have', 'eigenvalues', 'of', 'finite', 'multiplicity', 'and', 'in', 'particular', 'its', 'spectrum', 'is', 'essential', 'moreover', 'we', 'prove', 'that', 'if', 'm_1', 'is', 'closed', 'then', 'p', 'is', 'amenable', 'if', 'and', 'only', 'if', 'it', 'preserves', 'the', 'bottom', 'of', 'the', 'spectrum', 'of', 'someany', 'schrodinger', 'operator', 'extending', 'a', 'result', 'due', 'to', 'brooks']] | [-0.12708326905784714, 0.155423198499294, -0.07355432114046481, 0.031825120084653866, -0.07083786073296021, -0.15429166232934222, -0.021360222993987717, 0.3988161388422466, -0.29135032520732945, -0.1626613619996028, 0.11162696540607915, -0.3207508081622008, -0.09438128928498675, 0.1643755311799598, -0.07610408727325396, -0.010969635633551257, 0.07525833859108388, 0.16046593251586375, -0.08157401585453448, -0.1648165145282595, 0.39801555837038904, -0.07586622154404823, 0.13676187651354768, 0.1174805432124736, 0.08722971487279413, 0.002557448166448416, 0.030514438529886927, -0.05328744168057003, -0.16111916072658358, 0.09160260993909712, 0.22187996994600528, 0.13155074965066482, 0.18145343576583806, -0.305579897080962, -0.13282467572490633, 0.23504370576524203, 0.16607158076820067, -0.03591691180028849, 0.03710512836470217, -0.22667244561792663, 0.15667100633598036, -0.14532160370921096, -0.14348372420580643, -0.043584765517152846, 0.09182365724559026, -0.03944283943726785, -0.30096337753477403, 0.05215095475109087, 0.15832592636191598, 0.06963435986027536, -0.04109524272401662, -0.12615468010577993, -0.10689899053249974, 0.08137725542959136, -0.0015574624590549825, -0.005936485284109949, 0.041714282442828536, -0.0009099942528539234, -0.038166794754538894, 0.41478857175550526, -0.1060669487414998, -0.22155805668120998, 0.11430317090384455, -0.20741691798806036, -0.11761196871440108, 0.12567229325456233, 0.05176803552442127, 0.1749737572083379, -0.03428619466851362, 0.2474089761490177, -0.11402643071778584, 0.1910699946157466, 0.08780195503236933, -0.010551457066968497, 0.09326765160464372, 0.07511496916574995, 0.16757368984690402, 0.09492238223659417, 0.0022228678345628497, -0.014097287846703289, -0.3671226818631921, -0.14664686183419284, -0.19904511504703098, 0.14718233809829448, -0.05469850448763383, -0.16740860465991622, 0.37815491624900865, 0.0508090088971787, 0.23763721430603052, 0.05614246514354212, 0.2743553519119612, 0.12704247649526224, 0.027802551663222, 0.08083963480506402, 0.1445650560846035, 0.22857891111764023, -0.021211710810247395, -0.21592058581073717, -0.04204514023149386, 0.11020667521481503] |
1,803.03224 | Distributed Maximum Likelihood using Dynamic Average Consensus | This paper presents the formulation and analysis of a novel distributed
maximum likelihood algorithm that utilizes a first-order optimization scheme.
The proposed approach utilizes a static average consensus algorithm to reach
agreement on the initial condition to the iterative optimization scheme and a
dynamic average consensus algorithm to reach agreement on the gradient
direction. The current distributed algorithm is guaranteed to exponentially
recover the performance of the centralized algorithm. Though the current
formulation focuses on maximum likelihood algorithm built on first-order
methods, it can be easily extended to higher order methods. Numerical
simulations validate the theoretical contributions of the paper.
| math.OC | this paper presents the formulation and analysis of a novel distributed maximum likelihood algorithm that utilizes a firstorder optimization scheme the proposed approach utilizes a static average consensus algorithm to reach agreement on the initial condition to the iterative optimization scheme and a dynamic average consensus algorithm to reach agreement on the gradient direction the current distributed algorithm is guaranteed to exponentially recover the performance of the centralized algorithm though the current formulation focuses on maximum likelihood algorithm built on firstorder methods it can be easily extended to higher order methods numerical simulations validate the theoretical contributions of the paper | [['this', 'paper', 'presents', 'the', 'formulation', 'and', 'analysis', 'of', 'a', 'novel', 'distributed', 'maximum', 'likelihood', 'algorithm', 'that', 'utilizes', 'a', 'firstorder', 'optimization', 'scheme', 'the', 'proposed', 'approach', 'utilizes', 'a', 'static', 'average', 'consensus', 'algorithm', 'to', 'reach', 'agreement', 'on', 'the', 'initial', 'condition', 'to', 'the', 'iterative', 'optimization', 'scheme', 'and', 'a', 'dynamic', 'average', 'consensus', 'algorithm', 'to', 'reach', 'agreement', 'on', 'the', 'gradient', 'direction', 'the', 'current', 'distributed', 'algorithm', 'is', 'guaranteed', 'to', 'exponentially', 'recover', 'the', 'performance', 'of', 'the', 'centralized', 'algorithm', 'though', 'the', 'current', 'formulation', 'focuses', 'on', 'maximum', 'likelihood', 'algorithm', 'built', 'on', 'firstorder', 'methods', 'it', 'can', 'be', 'easily', 'extended', 'to', 'higher', 'order', 'methods', 'numerical', 'simulations', 'validate', 'the', 'theoretical', 'contributions', 'of', 'the', 'paper']] | [-0.12404724742751569, -0.05705282726325095, -0.14338578266091645, 0.03956437233369797, -0.09144468929618597, -0.16079970359802245, 0.10260346945608034, 0.41780749440193177, -0.2597804279066622, -0.3569784135557711, 0.11014945628587157, -0.19690413927659392, -0.1694631838100031, 0.18162401898764075, -0.07445460690185428, 0.1285410683648661, 0.10884620742872357, 0.03882204861845821, -0.1074076207424514, -0.297254484212026, 0.20578257838031278, 0.10397663940675557, 0.36990566705353556, 0.011146730799227953, 0.14190181228797882, -0.01578702833503485, -0.022834419701248408, 0.08108583483844996, -0.11314128891834116, 0.15148452681489288, 0.21500940587371586, 0.19615006440551952, 0.3263642531400546, -0.381314804572612, -0.14774129105731845, 0.09289959987625479, 0.1822923985426314, 0.14229630937799811, -0.010521752615459264, -0.2533466857392341, 0.12844608847983183, -0.15945593594573437, -0.06839222173206508, -0.08153950590640306, -0.11617566673317924, 0.012816422386094928, -0.35684372708201406, 0.077096185144037, 0.02723506967537105, -0.022286833496764302, -0.04537415239959955, -0.12215962050948292, 0.07691517499275506, 0.019694543314399196, 0.015555127754341811, 0.07366499513853342, 0.14690070292912424, -0.03742014974122867, -0.162171111125499, 0.33816927194595336, -0.04625319386832416, -0.19450433897960465, 0.13684142918325962, -0.010648481054231525, -0.12501564423087985, 0.1873796994634904, 0.24478075912222266, 0.18935009222041116, -0.14936531085520982, 0.048652433970710264, -0.026360775511711836, 0.18735241306945682, -0.024305161023512482, -0.05171608929653303, 0.13729484779061749, 0.20266432742588222, 0.1811316038109362, 0.12283947161282413, -0.052746705608442426, -0.18872128382325173, -0.264929189234972, -0.10171013780287468, -0.20587977299466728, -0.07954094789805823, -0.10221769992233021, -0.15815839486196637, 0.3906327928954124, 0.2598630302911624, 0.13217077956534923, 0.14251095663756133, 0.4215196611569263, 0.12271713387803175, -0.002977784797549248, 0.14720650801900775, 0.2405111898481846, 0.1272272142674774, 0.1387717382237315, -0.263047520914115, 0.1167488816496916, 0.11454874182119966] |
1,803.03225 | Inclusive study of bottomonium production in association with an $\eta$
meson in $e^+e^-$ annihilations near $\Upsilon(5S)$ | We study bottomonium production in association with an $\eta$ meson in
$e^+e^-$ annihilations near the $\Upsilon(5S)$, at a center of mass energy of
$\sqrt{s}=10.866\,$GeV. The results are based on the $121.4\,$fb$^{-1}$ data
sample collected by the Belle experiment at the asymmetric energy KEKB
collider. Only the $\eta$ meson is reconstructed and the missing-mass spectrum
of $\eta$ candidates is investigated. We observe the
$e^+e^-\to\eta\Upsilon_J(1D)$ process and find evidence for the
$e^+e^-\to\eta\Upsilon(2S)$ process, while no significant signals of
$\Upsilon(1S)$, $h_b(1P)$, nor $h_b(2P)$ are found. Cross sections for the
studied processes are reported.
| hep-ex | we study bottomonium production in association with an eta meson in ee annihilations near the upsilon5s at a center of mass energy of sqrts10866gev the results are based on the 1214fb1 data sample collected by the belle experiment at the asymmetric energy kekb collider only the eta meson is reconstructed and the missingmass spectrum of eta candidates is investigated we observe the eetoetaupsilon_j1d process and find evidence for the eetoetaupsilon2s process while no significant signals of upsilon1s h_b1p nor h_b2p are found cross sections for the studied processes are reported | [['we', 'study', 'bottomonium', 'production', 'in', 'association', 'with', 'an', 'eta', 'meson', 'in', 'ee', 'annihilations', 'near', 'the', 'upsilon5s', 'at', 'a', 'center', 'of', 'mass', 'energy', 'of', 'sqrts10866gev', 'the', 'results', 'are', 'based', 'on', 'the', '1214fb1', 'data', 'sample', 'collected', 'by', 'the', 'belle', 'experiment', 'at', 'the', 'asymmetric', 'energy', 'kekb', 'collider', 'only', 'the', 'eta', 'meson', 'is', 'reconstructed', 'and', 'the', 'missingmass', 'spectrum', 'of', 'eta', 'candidates', 'is', 'investigated', 'we', 'observe', 'the', 'eetoetaupsilon_j1d', 'process', 'and', 'find', 'evidence', 'for', 'the', 'eetoetaupsilon2s', 'process', 'while', 'no', 'significant', 'signals', 'of', 'upsilon1s', 'h_b1p', 'nor', 'h_b2p', 'are', 'found', 'cross', 'sections', 'for', 'the', 'studied', 'processes', 'are', 'reported']] | [-0.09334884260128114, 0.16399078991885654, -0.09939248520538382, 0.1345919948969864, 0.003554322200174304, -0.09449554172119703, 0.06322129115451598, 0.3615536445399864, -0.13345050075273404, -0.24822198323391634, -0.02819506762196021, -0.41952452436089516, 0.03485767748849145, 0.17776687593325094, 0.12375155944462823, 0.11016804425195716, 0.16018454673774968, 0.07995462915913641, -0.005927293973535985, -0.15459355742044362, 0.30881515913375324, 0.1159501855513188, 0.25179335203064585, 0.1277897284398305, 0.008517617896338389, 0.007842876573746231, -0.07975997331206976, -0.09040716485302339, -0.15060005647440752, 0.014237857762263852, 0.2537279929055822, 0.10783171752767487, 0.1187600679856179, -0.3141239306553442, -0.06950945598769119, 0.18998239962544677, 0.13203573238168811, 0.026194420865276593, -0.10469886200267008, -0.3591950288277933, 0.15857846663472638, -0.17013000266562248, -0.08037831161663621, -0.015832369751029318, 0.032805394734545, -0.058150196065938894, -0.3290453578784377, 0.10472477906672605, -0.062116236543689654, 0.07305614841063561, -0.08648322340390034, -0.24558715971358036, -0.07223524668136205, -0.03350819557391364, 0.06026374282591024, 0.040836223885524034, 0.1991113956493122, -0.1350219373915066, -0.21549549163586793, 0.3425470079969743, -0.029830044136287634, -0.08913731649946208, 0.1644236404989343, -0.253125061088338, -0.1267624885652043, 0.20671910056095014, 0.2513183750367413, 0.04994372291832991, -0.21137232673836165, 0.11201755627427765, -0.01588978620524379, 0.15802082364533054, 0.08935042880154376, 0.06574369897000791, 0.1684973599956553, 0.19715347598124852, -0.0353741104896555, 0.06886237584878745, -0.16285205343684675, -0.058539204540309205, -0.3806755854607688, -0.1342507396000384, -0.10056750110789449, 0.03224799905678835, 0.030386909232648817, -0.024829184823808657, 0.3234506466147629, -0.000816314855868789, 0.3500690182146413, -0.02874365803282494, 0.29210155148690714, 0.14075068032754393, 0.03999773550399943, 0.10375662892304184, 0.3566602510453641, 0.12525973524951814, 0.18115960483053892, -0.2844940294597255, 0.037603984792963015, -0.04281942145470744] |
1,803.03226 | Physical qubit calibration on a directed acyclic graph | High-fidelity control of qubits requires precisely tuned control parameters.
Typically, these parameters are found through a series of bootstrapped
calibration experiments which successively acquire more accurate information
about a physical qubit. However, optimal parameters are typically different
between devices and can also drift in time, which begets the need for an
efficient calibration strategy. Here, we introduce a framework to understand
the relationship between calibrations as a directed graph. With this approach,
calibration is reduced to a graph traversal problem that is automatable and
extensible.
| quant-ph | highfidelity control of qubits requires precisely tuned control parameters typically these parameters are found through a series of bootstrapped calibration experiments which successively acquire more accurate information about a physical qubit however optimal parameters are typically different between devices and can also drift in time which begets the need for an efficient calibration strategy here we introduce a framework to understand the relationship between calibrations as a directed graph with this approach calibration is reduced to a graph traversal problem that is automatable and extensible | [['highfidelity', 'control', 'of', 'qubits', 'requires', 'precisely', 'tuned', 'control', 'parameters', 'typically', 'these', 'parameters', 'are', 'found', 'through', 'a', 'series', 'of', 'bootstrapped', 'calibration', 'experiments', 'which', 'successively', 'acquire', 'more', 'accurate', 'information', 'about', 'a', 'physical', 'qubit', 'however', 'optimal', 'parameters', 'are', 'typically', 'different', 'between', 'devices', 'and', 'can', 'also', 'drift', 'in', 'time', 'which', 'begets', 'the', 'need', 'for', 'an', 'efficient', 'calibration', 'strategy', 'here', 'we', 'introduce', 'a', 'framework', 'to', 'understand', 'the', 'relationship', 'between', 'calibrations', 'as', 'a', 'directed', 'graph', 'with', 'this', 'approach', 'calibration', 'is', 'reduced', 'to', 'a', 'graph', 'traversal', 'problem', 'that', 'is', 'automatable', 'and', 'extensible']] | [-0.07867884136709001, 0.13863640479514075, -0.0908150264664608, 0.06150193000897108, -0.13042686167447007, -0.19800153596545844, 0.07773620648419156, 0.4533845325164935, -0.2736648415817934, -0.39790302918237797, 0.11574275275993653, -0.21275816661689212, -0.14338967867524308, 0.23476552003446746, -0.07823186038500246, 0.08121694267234382, 0.10872994745698045, -0.023483827381449586, -0.08893699972232913, -0.19053849382668406, 0.24833109353614205, 0.05379482748616925, 0.27769853104015485, -0.009290301054716111, 0.1304824613746913, -0.007222005954998381, -0.031678557401413426, 0.026864391455755515, -0.12373157552321894, 0.14363222914775287, 0.3030359309824074, 0.11853917449274484, 0.3025706387837144, -0.44203004210310826, -0.19472865975078416, 0.10594430520911427, 0.15105284618980744, 0.12722917283227778, -0.012498322709442993, -0.23001708561444983, 0.06489510616178022, -0.14836256864535458, -0.042810067293227325, -0.10824166880372693, 0.040623668384026076, 0.003692690358387635, -0.34196334298261827, 0.019447177839944797, 0.008084347225068247, 0.05009433103396612, 0.006057633955873933, -0.04042327765046674, 0.005235323392073898, 0.17094644874005632, -0.0427434125860386, 0.012570754902930383, 0.15271282600896324, -0.08738710111253621, -0.11357335408820826, 0.33542812629055013, 0.0001413469175424646, -0.24689376634709975, 0.15003465633318924, -0.041797084383228246, -0.1048219389117816, 0.07715495599926833, 0.17375734763986925, 0.11434911544270375, -0.23204423459246754, 0.004463839014608632, 0.020266073580612155, 0.23603709143696025, 0.007549320509218994, 0.03489944234709529, 0.17566465126240954, 0.19770728352424852, 0.14378993896329229, 0.111693125218153, -0.043087333824266404, -0.07551524862373138, -0.29160665234222133, -0.13073081218154745, -0.15455587341943208, 0.024754538923940236, -0.10062775470501305, -0.14535780578632565, 0.38834218563621536, 0.21345749504672473, 0.1858825164847076, 0.04449052134912242, 0.34250054810853564, 0.10035495341563706, 0.07002832106150249, 0.07043475744807545, 0.20635238037828138, 0.08446680125506485, 0.0686815224313999, -0.20016252139911933, 0.10737427594140173, 0.013070259407600936] |
1,803.03227 | $K$-theory of AF-algebras from braided C*-tensor categories | Renault, Wassermann, Handelman and Rossmann (early 1980s) and Evans and Gould
(1994) explicitly described the $K$-theory of certain unital AF-algebras $A$ as
(quotients of) polynomial rings. In this paper, we show that in each case the
multiplication in the polynomial ring (quotient) is induced by a
$*$-homomorphism $A\otimes A\to A$ arising from a unitary braiding on a
C*-tensor category and essentially defined by Erlijman and Wenzl (2007). We
also present some new explicit calculations based on the work of Gepner, Fuchs
and others. Specifically, we perform computations for the rank two compact Lie
groups SU(3), Sp(4) and G$_2$ that are analogous to the Evans-Gould computation
for the rank one compact Lie group SU(2).
The Verlinde rings are the fusion rings of Wess-Zumino-Witten models in
conformal field theory or, equivalently, of certain related C*-tensor
categories. Freed, Hopkins and Teleman (early 2000s) realized these rings via
twisted equivariant $K$-theory. Inspired by this, our long-term goal is to
realize these rings in a simpler $K$-theoretical manner, avoiding the
technicalities of loop group analysis. As a step in this direction, we note
that the Verlinde rings can be recovered as above in certain special cases.
| math-ph hep-th math.KT math.MP math.OA | renault wassermann handelman and rossmann early 1980s and evans and gould 1994 explicitly described the ktheory of certain unital afalgebras a as quotients of polynomial rings in this paper we show that in each case the multiplication in the polynomial ring quotient is induced by a homomorphism aotimes ato a arising from a unitary braiding on a ctensor category and essentially defined by erlijman and wenzl 2007 we also present some new explicit calculations based on the work of gepner fuchs and others specifically we perform computations for the rank two compact lie groups su3 sp4 and g_2 that are analogous to the evansgould computation for the rank one compact lie group su2 the verlinde rings are the fusion rings of wesszuminowitten models in conformal field theory or equivalently of certain related ctensor categories freed hopkins and teleman early 2000s realized these rings via twisted equivariant ktheory inspired by this our longterm goal is to realize these rings in a simpler ktheoretical manner avoiding the technicalities of loop group analysis as a step in this direction we note that the verlinde rings can be recovered as above in certain special cases | [['renault', 'wassermann', 'handelman', 'and', 'rossmann', 'early', '1980s', 'and', 'evans', 'and', 'gould', '1994', 'explicitly', 'described', 'the', 'ktheory', 'of', 'certain', 'unital', 'afalgebras', 'a', 'as', 'quotients', 'of', 'polynomial', 'rings', 'in', 'this', 'paper', 'we', 'show', 'that', 'in', 'each', 'case', 'the', 'multiplication', 'in', 'the', 'polynomial', 'ring', 'quotient', 'is', 'induced', 'by', 'a', 'homomorphism', 'aotimes', 'ato', 'a', 'arising', 'from', 'a', 'unitary', 'braiding', 'on', 'a', 'ctensor', 'category', 'and', 'essentially', 'defined', 'by', 'erlijman', 'and', 'wenzl', '2007', 'we', 'also', 'present', 'some', 'new', 'explicit', 'calculations', 'based', 'on', 'the', 'work', 'of', 'gepner', 'fuchs', 'and', 'others', 'specifically', 'we', 'perform', 'computations', 'for', 'the', 'rank', 'two', 'compact', 'lie', 'groups', 'su3', 'sp4', 'and', 'g_2', 'that', 'are', 'analogous', 'to', 'the', 'evansgould', 'computation', 'for', 'the', 'rank', 'one', 'compact', 'lie', 'group', 'su2', 'the', 'verlinde', 'rings', 'are', 'the', 'fusion', 'rings', 'of', 'wesszuminowitten', 'models', 'in', 'conformal', 'field', 'theory', 'or', 'equivalently', 'of', 'certain', 'related', 'ctensor', 'categories', 'freed', 'hopkins', 'and', 'teleman', 'early', '2000s', 'realized', 'these', 'rings', 'via', 'twisted', 'equivariant', 'ktheory', 'inspired', 'by', 'this', 'our', 'longterm', 'goal', 'is', 'to', 'realize', 'these', 'rings', 'in', 'a', 'simpler', 'ktheoretical', 'manner', 'avoiding', 'the', 'technicalities', 'of', 'loop', 'group', 'analysis', 'as', 'a', 'step', 'in', 'this', 'direction', 'we', 'note', 'that', 'the', 'verlinde', 'rings', 'can', 'be', 'recovered', 'as', 'above', 'in', 'certain', 'special', 'cases']] | [-0.16459538249752273, 0.07709323028940215, -0.09123947734023055, 0.08399222565201363, -0.08653115073130244, -0.14581838764358687, -0.025495426363444755, 0.3600303377098744, -0.30554916254348224, -0.20682093565642992, 0.13816554772990347, -0.18647157932468753, -0.19057580909479863, 0.18398665463078825, -0.1648017164421694, -0.030507025979065076, 0.0251580749727076, 0.07362903177826888, -0.09290231366040648, -0.30811662364996867, 0.37943210266776894, 0.052054807101499546, 0.20580696697573536, 0.01713800035902452, 0.049747356282616104, 0.019819519074175448, -0.05572018645554116, -0.01047729341880575, -0.1279112215611758, 0.12392179535088381, 0.315341085083072, 0.04133887886606827, 0.16710941235507282, -0.39716623412080543, -0.11932022500014494, 0.15298022017641752, 0.1175043978352622, 0.05425879721672683, -0.03985446389941942, -0.3111412033189837, 0.09646417553383838, -0.26362858766877145, -0.0984717734064414, -0.0853351575874344, 0.07386190211769962, -0.0311835601965271, -0.2286384985757568, 0.017841642758058798, 0.10973495250893017, 0.12627155903973045, -0.050750257366671964, -0.08559442142261163, -0.048156162348166894, 0.08051123891626953, -0.03197143949872707, 0.024133486246995666, 0.1487945585201184, -0.09548902707346887, -0.16141889576779225, 0.3557196167943181, -0.05753116500465367, -0.1524379723791585, 0.15238977817476052, -0.12893942524013774, -0.20109164078286282, 0.08184456754206045, 0.03478505064255346, 0.15758365612980915, -0.044637003268001886, 0.1901868110641276, -0.14800013511111496, 0.020445343954537912, 0.1314695332120493, -0.02588837534662277, 0.1513043682832547, 0.05458366137402004, 0.018110421655740262, 0.13574788763579573, 0.043453062576532524, -0.056825044081994784, -0.35616162111834876, -0.18366995900154862, -0.11665635851147786, 0.13171846341038684, -0.04958232115922131, -0.1088425233164339, 0.409493419770447, 0.07811853998282459, 0.18932837052714258, 0.08711293826179047, 0.22409616517169134, 0.06221563598047449, 0.07431645697800729, 0.05591574987358409, 0.15083755631564633, 0.23920423440295197, 0.007099245697698462, -0.15968164806402038, -0.08125044313560008, 0.2398600983396468] |
1,803.03228 | Normal form for single-qutrit Clifford+T operators and synthesis of
single-qutrit gates | We study single-qutrit gates composed of Clifford and $T$ gates, using the
qutrit version of the $T$ gate proposed by Howard and Vala. We propose a normal
form for single-qutrit gates analogous to the Matsumoto-Amano normal form for
qubits. We prove that the normal form is optimal with respect to the number of
$T$ gates used and that any string of qutrit Clifford+$T$ operators can be put
into this normal form in polynomial time. We also prove that this form is
unique and provide an algorithm for exact synthesis of any single qutrit
Clifford+$T$ operator.
| quant-ph hep-th math.NT | we study singlequtrit gates composed of clifford and t gates using the qutrit version of the t gate proposed by howard and vala we propose a normal form for singlequtrit gates analogous to the matsumotoamano normal form for qubits we prove that the normal form is optimal with respect to the number of t gates used and that any string of qutrit cliffordt operators can be put into this normal form in polynomial time we also prove that this form is unique and provide an algorithm for exact synthesis of any single qutrit cliffordt operator | [['we', 'study', 'singlequtrit', 'gates', 'composed', 'of', 'clifford', 'and', 't', 'gates', 'using', 'the', 'qutrit', 'version', 'of', 'the', 't', 'gate', 'proposed', 'by', 'howard', 'and', 'vala', 'we', 'propose', 'a', 'normal', 'form', 'for', 'singlequtrit', 'gates', 'analogous', 'to', 'the', 'matsumotoamano', 'normal', 'form', 'for', 'qubits', 'we', 'prove', 'that', 'the', 'normal', 'form', 'is', 'optimal', 'with', 'respect', 'to', 'the', 'number', 'of', 't', 'gates', 'used', 'and', 'that', 'any', 'string', 'of', 'qutrit', 'cliffordt', 'operators', 'can', 'be', 'put', 'into', 'this', 'normal', 'form', 'in', 'polynomial', 'time', 'we', 'also', 'prove', 'that', 'this', 'form', 'is', 'unique', 'and', 'provide', 'an', 'algorithm', 'for', 'exact', 'synthesis', 'of', 'any', 'single', 'qutrit', 'cliffordt', 'operator']] | [-0.14900998221409897, 0.13799096227974647, -0.04819253313365162, 0.018681509049749502, -0.017574301262396157, -0.23174954878206375, 0.09522076763252738, 0.3596663069260377, -0.22527539850242675, -0.2561207638523962, 0.03740801244425858, -0.21939426908890405, -0.14459063154795476, 0.23467229201548523, -0.06898759827218069, 0.07770874578585868, 0.030743934011327162, 0.052939271231705165, -0.1328827436257314, -0.2791244828052098, 0.29284287560530886, -0.06932953792193564, 0.22910464992646568, -0.04068637939710771, 0.11479936109515287, 0.0037171346515977896, 0.07779279210033917, -0.017670109086940364, -0.0889252464233626, 0.1082609006834607, 0.2515834518858502, 0.17175672389066188, 0.2078761553882511, -0.48556802253569326, -0.08242961420847844, 0.12012992999566499, 0.1076741452248747, 0.11997004394089023, -0.051087330450974806, -0.27978820604101945, 0.10488841403651261, -0.15406693003430802, -0.0843449289489898, -0.1450109292042031, 0.046507385574401386, -0.03404284757561982, -0.29027824560981447, 0.014163869815836009, 0.14120758413988097, 0.020480360695591535, -0.006674045466527503, -0.06585249682307563, 0.02557626768185567, 0.09452789498653302, -0.1258670830628484, 0.042269795950281845, 0.1008267065407508, -0.04615378941118877, -0.16659052627942256, 0.2948219018778013, -0.07057920521906307, -0.24956171120446857, 0.06887741971720931, -0.12498292675922795, -0.12125438408705816, 0.018066165958761527, 0.10936797519404722, 0.11954718165259848, -0.15555122189263823, 0.14085777880754122, -0.08243631461374862, 0.19643374131892316, 0.10259123066420196, 0.05700103835933792, 0.09975164917407818, 0.10022922714431119, 0.1072629526938482, 0.22459480114236113, -0.015841953791878235, -0.062344076567559796, -0.38595034903095615, -0.2601702285352193, -0.15916721937146477, 0.11953183750231419, -0.05639255581040596, -0.17842051893552785, 0.4042634731233721, 0.09597691380473915, 0.17513538214067617, 0.07715259039754509, 0.2634505190115462, 0.18204533542075785, 0.11457272544903781, 0.12144071512645291, 0.13904141646719748, 0.18315965434666523, -0.026988729073475767, -0.23698475153776266, 0.0650861130035933, 0.10173650495507704] |
1,803.03229 | Regular rings and perfect(oid) algebras | We prove a $p$-adic analog of Kunz's theorem: a $p$-adically complete
noetherian ring is regular exactly when it admits a faithfully flat map to a
perfectoid ring. This result is deduced from a more precise statement on
detecting finiteness of projective dimension of finitely generated modules over
noetherian rings via maps to perfectoid rings. We also establish a version of
the $p$-adic Kunz's theorem where the flatness hypothesis is relaxed to almost
flatness.
| math.AC | we prove a padic analog of kunzs theorem a padically complete noetherian ring is regular exactly when it admits a faithfully flat map to a perfectoid ring this result is deduced from a more precise statement on detecting finiteness of projective dimension of finitely generated modules over noetherian rings via maps to perfectoid rings we also establish a version of the padic kunzs theorem where the flatness hypothesis is relaxed to almost flatness | [['we', 'prove', 'a', 'padic', 'analog', 'of', 'kunzs', 'theorem', 'a', 'padically', 'complete', 'noetherian', 'ring', 'is', 'regular', 'exactly', 'when', 'it', 'admits', 'a', 'faithfully', 'flat', 'map', 'to', 'a', 'perfectoid', 'ring', 'this', 'result', 'is', 'deduced', 'from', 'a', 'more', 'precise', 'statement', 'on', 'detecting', 'finiteness', 'of', 'projective', 'dimension', 'of', 'finitely', 'generated', 'modules', 'over', 'noetherian', 'rings', 'via', 'maps', 'to', 'perfectoid', 'rings', 'we', 'also', 'establish', 'a', 'version', 'of', 'the', 'padic', 'kunzs', 'theorem', 'where', 'the', 'flatness', 'hypothesis', 'is', 'relaxed', 'to', 'almost', 'flatness']] | [-0.22450885231995776, -0.028091044637234244, -0.2128056702012681, 0.11853111534353906, -0.08653264562918307, -0.1940261229030686, -0.07276196221578611, 0.3010399278782767, -0.39169090304345094, -0.12686759407459822, 0.11589329909813935, -0.1650924000455296, -0.06245377208170009, 0.25834954928045406, -0.18500383486588523, -0.06800509704442771, 0.033963453002299554, 0.10384669866770098, -0.058184906240705755, -0.33482916072195984, 0.38798463696690455, 0.004094402969189703, 0.2340169770974819, 0.03845478543590703, 0.12335162152446909, 0.0828602171298882, -0.014559839954217002, 0.01791273632839526, -0.19798290282998182, 0.11768013790045699, 0.3519886622092948, 0.057108320136337654, 0.21806192839492675, -0.3514925755802797, -0.11299113490401883, 0.2693521707726974, 0.08904078579188822, 0.04613965477998534, -0.02122230602253694, -0.2835827081604567, 0.20297604176049974, -0.1742261587578344, -0.21277988201951328, -0.07533693534309326, 0.07491980429279478, -0.0249728846223387, -0.2719012319225155, 0.05013785480596571, 0.1673868363053372, 0.1860609843510471, -0.07361046842312159, 0.03772848403744706, -0.05067928962103308, -0.02272781920707019, -0.05764101164683393, 0.025026155661230218, 0.14096288184622582, -0.029905985543274716, -0.08766102860362766, 0.31103967369393737, -0.10004746744868485, -0.18000380955445133, 0.11727928284121907, -0.20166230006526187, -0.11881162734600166, 0.12250894684446594, -0.027708031262641084, 0.17718827153064873, -0.02765750687043916, 0.23102197025532592, -0.23887136780133802, 0.10973576220926153, 0.14940542982865687, 0.010357384238239021, 0.18378145530284062, 0.05857714848937339, 0.14785705440540556, 0.16207670067015983, 0.04168351745146824, -0.016719691366059324, -0.3600836999663343, -0.18813790832582403, -0.14065545999878787, 0.22084025389272466, -0.09649382026432311, -0.17884995242140625, 0.4080580152086403, 0.06581616721894235, 0.15744668236385062, 0.16246174890803147, 0.28185669605760544, 0.02459681313484907, 0.08392964893543761, 0.038405374591940475, 0.08491453829489343, 0.2897846087022391, -0.04965972172077235, -0.03040006541493923, -0.06749997090242088, 0.22813177940576043] |
1,803.0323 | The Impact of Primordial Magnetic Fields on Future CMB Bounds on
Inflationary Gravitational Waves | We discuss whether an unaccounted contribution to the Cosmic Microwave
Background polarization $B$-mode by primordial magnetic fields (PMFs) can bias
future constraints on inflationary gravitational waves. As a case-study, we
consider a scale-invariant PMF spectrum with amplitude of
$\approx{1}\,{\mathrm{nG}}$ on $1\,\mathrm{Mpc}$ scales, compatible with
current cosmological bounds. We find a degeneracy in the $B$-mode spectra
between PMFs and inflationary gravitational waves. If PMFs of this amplitude
are not accounted for, future CMB experiments could claim a false detection of
a tensor-to-scalar ratio $r\approx 0.007$, close to the predictions of
Starobinsky and $\alpha$-attractor models. The degeneracy can be broken if
$B$-modes are measured also at multipoles $\ell\gtrsim 900$: more precisely
experiments like CMB-S4 or CORE-M5 would be able to discriminate PMFs from
primordial GWs at high statistical significance. Experiments like LiteBIRD or
PIXIE will not be able to break the degeneracy and will need complementary
bounds coming, for example, from measurements of anisotropies in the Faraday
rotation angle of CMB polarization. This reinforces the importance of future
experimental constraints on PMFs.
| astro-ph.CO | we discuss whether an unaccounted contribution to the cosmic microwave background polarization bmode by primordial magnetic fields pmfs can bias future constraints on inflationary gravitational waves as a casestudy we consider a scaleinvariant pmf spectrum with amplitude of approx1mathrmng on 1mathrmmpc scales compatible with current cosmological bounds we find a degeneracy in the bmode spectra between pmfs and inflationary gravitational waves if pmfs of this amplitude are not accounted for future cmb experiments could claim a false detection of a tensortoscalar ratio rapprox 0007 close to the predictions of starobinsky and alphaattractor models the degeneracy can be broken if bmodes are measured also at multipoles ellgtrsim 900 more precisely experiments like cmbs4 or corem5 would be able to discriminate pmfs from primordial gws at high statistical significance experiments like litebird or pixie will not be able to break the degeneracy and will need complementary bounds coming for example from measurements of anisotropies in the faraday rotation angle of cmb polarization this reinforces the importance of future experimental constraints on pmfs | [['we', 'discuss', 'whether', 'an', 'unaccounted', 'contribution', 'to', 'the', 'cosmic', 'microwave', 'background', 'polarization', 'bmode', 'by', 'primordial', 'magnetic', 'fields', 'pmfs', 'can', 'bias', 'future', 'constraints', 'on', 'inflationary', 'gravitational', 'waves', 'as', 'a', 'casestudy', 'we', 'consider', 'a', 'scaleinvariant', 'pmf', 'spectrum', 'with', 'amplitude', 'of', 'approx1mathrmng', 'on', '1mathrmmpc', 'scales', 'compatible', 'with', 'current', 'cosmological', 'bounds', 'we', 'find', 'a', 'degeneracy', 'in', 'the', 'bmode', 'spectra', 'between', 'pmfs', 'and', 'inflationary', 'gravitational', 'waves', 'if', 'pmfs', 'of', 'this', 'amplitude', 'are', 'not', 'accounted', 'for', 'future', 'cmb', 'experiments', 'could', 'claim', 'a', 'false', 'detection', 'of', 'a', 'tensortoscalar', 'ratio', 'rapprox', '0007', 'close', 'to', 'the', 'predictions', 'of', 'starobinsky', 'and', 'alphaattractor', 'models', 'the', 'degeneracy', 'can', 'be', 'broken', 'if', 'bmodes', 'are', 'measured', 'also', 'at', 'multipoles', 'ellgtrsim', '900', 'more', 'precisely', 'experiments', 'like', 'cmbs4', 'or', 'corem5', 'would', 'be', 'able', 'to', 'discriminate', 'pmfs', 'from', 'primordial', 'gws', 'at', 'high', 'statistical', 'significance', 'experiments', 'like', 'litebird', 'or', 'pixie', 'will', 'not', 'be', 'able', 'to', 'break', 'the', 'degeneracy', 'and', 'will', 'need', 'complementary', 'bounds', 'coming', 'for', 'example', 'from', 'measurements', 'of', 'anisotropies', 'in', 'the', 'faraday', 'rotation', 'angle', 'of', 'cmb', 'polarization', 'this', 'reinforces', 'the', 'importance', 'of', 'future', 'experimental', 'constraints', 'on', 'pmfs']] | [-0.15351954028717177, 0.20983754160581503, -0.07721570346205096, 0.15329488653307116, -0.13788534100915836, -0.11257198129758417, -0.04996039700650033, 0.3181293076458609, -0.23256253936449953, -0.3224447843829347, 0.06528804592034292, -0.3153071471855843, -0.08822882120286868, 0.2436652916616627, 0.032906294897353895, 0.03163363312238029, 0.03142608469534025, -0.050211015989632526, -0.030953485468801643, -0.2317203590396925, 0.26744746810072684, 0.22191008859746425, 0.24369520605320022, 0.037188950416055466, 0.017177309161135263, -0.11178942411927328, -0.05331004375780356, 0.03072300861545262, -0.16147543195516587, 0.03423879189566443, 0.22613668066014725, 0.179888146377856, 0.1262184594275563, -0.4037169599018636, -0.21558335210041454, 0.20665253410004966, 0.12223310603959751, 0.16318551758221084, -0.022966040309170023, -0.31658146827526035, 0.058095428876792234, -0.13593850191266807, -0.07368587169496875, -0.08700073095609523, -0.02180995034065009, -0.05611899860204652, -0.30923875569853754, 0.13301932700016464, -0.00981294227849936, 0.012887464398296461, -0.04789968902089944, -0.10215249269579847, -0.05260571427754171, 0.01396428378454099, 0.07742285818745759, 0.048168133259640034, 0.17712873219612188, -0.1293122698615272, -0.11777283452656342, 0.3905593318465565, -0.19001955907359452, -0.13546249207242259, 0.06605968803064786, -0.2246036156873396, -0.19284325820141626, 0.07338048327004626, 0.1926505160982266, 0.022986039444471577, -0.07584421264584221, 0.10089309283683265, 0.10193655243520403, 0.23688747232136803, 0.1319188945109047, 0.029442362168559895, 0.4545405815699182, 0.05677180187263903, 0.0944462322846188, 0.056187570618931204, -0.16399445881238317, 0.0912871098622591, -0.31945388967038263, 0.0014771973836191353, -0.16590741801649397, 0.11228951978115392, -0.12641589249003682, -0.11120727848278225, 0.3869589600903315, 0.2072394909392599, 0.18727544822502837, 0.0730353204354677, 0.3551733293570578, 0.046045663112073226, 0.029927202414477334, 0.0008461160229801733, 0.38860845336291405, 0.11910287208142802, 0.07212608764114391, -0.18108261180861432, 0.03351310727607813, -0.07840971402627128] |
1,803.03231 | Principal eigenvalue and maximum principle for cooperative
periodic-parabolic systems | This paper classifies the set of supersolutions of a general class of
periodic-parabolic problems in the presence of a positive supersolution. From
this result we characterize the positivity of the underlying resolvent operator
through the positivity of the associated principal eigenvalue and the existence
of a positive strict supersolution. Lastly, this (scalar) characterization is
used to characterize the strong maximum principle for a class of
periodic-parabolic systems of cooperative type under arbitrary boundary
conditions of mixed type.
| math.AP | this paper classifies the set of supersolutions of a general class of periodicparabolic problems in the presence of a positive supersolution from this result we characterize the positivity of the underlying resolvent operator through the positivity of the associated principal eigenvalue and the existence of a positive strict supersolution lastly this scalar characterization is used to characterize the strong maximum principle for a class of periodicparabolic systems of cooperative type under arbitrary boundary conditions of mixed type | [['this', 'paper', 'classifies', 'the', 'set', 'of', 'supersolutions', 'of', 'a', 'general', 'class', 'of', 'periodicparabolic', 'problems', 'in', 'the', 'presence', 'of', 'a', 'positive', 'supersolution', 'from', 'this', 'result', 'we', 'characterize', 'the', 'positivity', 'of', 'the', 'underlying', 'resolvent', 'operator', 'through', 'the', 'positivity', 'of', 'the', 'associated', 'principal', 'eigenvalue', 'and', 'the', 'existence', 'of', 'a', 'positive', 'strict', 'supersolution', 'lastly', 'this', 'scalar', 'characterization', 'is', 'used', 'to', 'characterize', 'the', 'strong', 'maximum', 'principle', 'for', 'a', 'class', 'of', 'periodicparabolic', 'systems', 'of', 'cooperative', 'type', 'under', 'arbitrary', 'boundary', 'conditions', 'of', 'mixed', 'type']] | [-0.18078441176466742, 0.031347773799842056, -0.041325998165971274, 0.051392842534711804, -0.0970659059768712, -0.11337620685143131, 0.038971879980647814, 0.23039947256639406, -0.3274370083561191, -0.19820085619636751, 0.16409352771157712, -0.21356499074147894, -0.14658483221231924, 0.15490983231839808, -0.07767785373204328, 0.07045780772996413, 0.0644997692328285, 0.06511077667018036, -0.08648026397137286, -0.15959408585066823, 0.45767312816211153, -0.05592185120981235, 0.23524861075225975, 0.09442099995000965, 0.12564856002663638, -0.007085768155173048, -0.008553512219049327, 0.05234110297320725, -0.15769874000946035, 0.170989732403163, 0.2248307843783314, 0.12387170964948736, 0.3302858924710905, -0.3367422774567136, -0.19460603164194465, 0.21073048160858937, 0.057059282538263346, 0.05443818959734076, -0.02516883620145646, -0.2740162139782658, 0.16861790589316955, -0.11525160708017164, -0.21997953464531086, -0.015419957953710834, -0.030155349837301615, 0.03977746487437905, -0.3284801585091786, 0.11528365554699263, 0.13184228786206864, 0.044097023012189124, -0.13582903910851615, -0.07293863634294649, -0.0186385776176323, 0.08260499433215175, 0.01853178225929377, -0.07644321005368097, 0.034191528655733765, -0.10138431734211936, -0.09759793485145919, 0.32130242680961435, -0.08395908295189018, -0.22334296617947227, 0.19523478694586688, -0.11195056346039493, -0.1470162781838376, 0.12735526739051203, 0.18305029422528557, 0.1893729568374428, -0.14331690682848167, 0.1382135770022083, -0.1200285851456491, 0.10522798384999396, 0.08512013139469284, 0.046797350663601044, 0.1317883103121338, 0.11872647948224437, 0.18353995057911454, 0.19362390312281522, -0.01131925100911191, -0.06436146843525303, -0.4106230340269092, -0.19052009458665725, -0.1674468128204152, 0.12622800255315259, -0.11679651605115762, -0.23753539988069566, 0.4272897759174275, 0.0959152113041514, 0.13899920065584895, 0.11306376838391381, 0.19499730582457858, 0.1545408299276318, 0.0018316562855979065, 0.015478419412120983, 0.20233048576039153, 0.23360351597672546, 0.09113106126110855, -0.26017854163459464, 0.07287647243734303, 0.15579349025116337] |
1,803.03232 | Feudal Reinforcement Learning for Dialogue Management in Large Domains | Reinforcement learning (RL) is a promising approach to solve dialogue policy
optimisation. Traditional RL algorithms, however, fail to scale to large
domains due to the curse of dimensionality. We propose a novel Dialogue
Management architecture, based on Feudal RL, which decomposes the decision into
two steps; a first step where a master policy selects a subset of primitive
actions, and a second step where a primitive action is chosen from the selected
subset. The structural information included in the domain ontology is used to
abstract the dialogue state space, taking the decisions at each step using
different parts of the abstracted state. This, combined with an information
sharing mechanism between slots, increases the scalability to large domains. We
show that an implementation of this approach, based on Deep-Q Networks,
significantly outperforms previous state of the art in several dialogue domains
and environments, without the need of any additional reward signal.
| cs.CL cs.AI cs.NE | reinforcement learning rl is a promising approach to solve dialogue policy optimisation traditional rl algorithms however fail to scale to large domains due to the curse of dimensionality we propose a novel dialogue management architecture based on feudal rl which decomposes the decision into two steps a first step where a master policy selects a subset of primitive actions and a second step where a primitive action is chosen from the selected subset the structural information included in the domain ontology is used to abstract the dialogue state space taking the decisions at each step using different parts of the abstracted state this combined with an information sharing mechanism between slots increases the scalability to large domains we show that an implementation of this approach based on deepq networks significantly outperforms previous state of the art in several dialogue domains and environments without the need of any additional reward signal | [['reinforcement', 'learning', 'rl', 'is', 'a', 'promising', 'approach', 'to', 'solve', 'dialogue', 'policy', 'optimisation', 'traditional', 'rl', 'algorithms', 'however', 'fail', 'to', 'scale', 'to', 'large', 'domains', 'due', 'to', 'the', 'curse', 'of', 'dimensionality', 'we', 'propose', 'a', 'novel', 'dialogue', 'management', 'architecture', 'based', 'on', 'feudal', 'rl', 'which', 'decomposes', 'the', 'decision', 'into', 'two', 'steps', 'a', 'first', 'step', 'where', 'a', 'master', 'policy', 'selects', 'a', 'subset', 'of', 'primitive', 'actions', 'and', 'a', 'second', 'step', 'where', 'a', 'primitive', 'action', 'is', 'chosen', 'from', 'the', 'selected', 'subset', 'the', 'structural', 'information', 'included', 'in', 'the', 'domain', 'ontology', 'is', 'used', 'to', 'abstract', 'the', 'dialogue', 'state', 'space', 'taking', 'the', 'decisions', 'at', 'each', 'step', 'using', 'different', 'parts', 'of', 'the', 'abstracted', 'state', 'this', 'combined', 'with', 'an', 'information', 'sharing', 'mechanism', 'between', 'slots', 'increases', 'the', 'scalability', 'to', 'large', 'domains', 'we', 'show', 'that', 'an', 'implementation', 'of', 'this', 'approach', 'based', 'on', 'deepq', 'networks', 'significantly', 'outperforms', 'previous', 'state', 'of', 'the', 'art', 'in', 'several', 'dialogue', 'domains', 'and', 'environments', 'without', 'the', 'need', 'of', 'any', 'additional', 'reward', 'signal']] | [-0.08786255300200234, 0.015224607698813392, -0.07880326651968061, 0.019550880366393054, -0.1689903793297708, -0.1296552576419587, 0.09964177682685356, 0.4117242776043713, -0.3070631592472394, -0.29280978376666705, 0.10294916667820266, -0.23814285771300395, -0.1294928125361912, 0.15761109900350373, -0.11253458744225403, 0.051786929704248905, 0.08068501772514235, 0.049915190475682415, -0.03420077433654418, -0.24667362904020895, 0.35444823432713746, -0.008586886503423253, 0.3460278914061685, -0.03189651327828566, 0.17030372448265552, -0.002291496985902389, 0.009072422209040571, -0.013796712045441382, -0.04514242877431873, 0.1474494606970499, 0.3586816777645921, 0.1974041433321933, 0.41347376998048274, -0.4180102212416629, -0.19568797546128433, 0.09762801108881831, 0.1441116396492968, 0.12470280564622954, -0.02052761608036235, -0.3371033037391802, 0.059547795780623955, -0.17787923321748772, -0.000716703332339724, -0.08626046129424746, -0.03133433858243128, -0.04952205686286713, -0.30923731685305633, -0.04480830024617414, 0.07249057101551443, 0.0009197440743446351, -0.08047480828128756, -0.12986621184274555, 0.026412975573912263, 0.1834464129153639, 0.017640569504971306, 0.08578781312719608, 0.15389654892729596, -0.15446366652535895, -0.18355319054486852, 0.3712331057960788, -0.03150745834223926, -0.21685416355505974, 0.19098107068411385, -0.022377859863142172, -0.16475054076348897, 0.11422280898628136, 0.2195517385751009, 0.13324716653985283, -0.14524130882540096, 0.03560913750668988, -0.008854544429729383, 0.22512875642006597, -0.017003399015714724, 0.010228523664797345, 0.1330245585149775, 0.27622193315376836, 0.08842632311706741, 0.13936567288512985, -0.04993175655292968, -0.13693824616571268, -0.254061814431722, -0.14099636139037708, -0.20102844492221872, -0.01412726161380609, -0.0974179215261635, -0.13454003018016616, 0.354103106946374, 0.2096542804626127, 0.20553541098721326, 0.09040623493259772, 0.3524524117005058, 0.06652270361160238, 0.10600868806747409, 0.11157757366076111, 0.1359533612911279, -0.012094495928225419, 0.12838346283261975, -0.22264244143249623, 0.110175376109158, 0.0650467277141676] |
1,803.03233 | Defects at grain boundaries: A coarse-grained, three-dimensional
description by the amplitude expansion of the phase-field crystal model | We address a three-dimensional, coarse-grained description of dislocation
networks at grain boundaries between rotated crystals. The so-called amplitude
expansion of the phase-field crystal model is exploited with the aid of finite
element method calculations. This approach allows for the description of
microscopic features, such as dislocations, while simultaneously being able to
describe length scales that are orders of magnitude larger than the lattice
spacing. Moreover, it allows for the direct description of extended defects by
means of a scalar order parameter. The versatility of this framework is shown
by considering both fcc and bcc lattice symmetries and different rotation axes.
First, the specific case of planar, twist grain boundaries is illustrated. The
details of the method are reported and the consistency of the results with
literature is discussed. Then, the dislocation networks forming at the
interface between a spherical, rotated crystal embedded in an unrotated
crystalline structure, are shown. Although explicitly accounting for
dislocations which lead to an anisotropic shrinkage of the rotated grain, the
extension of the spherical grain boundary is found to decrease linearly over
time in agreement with the classical theory of grain growth and recent
atomistic investigations. It is shown that the results obtained for a system
with bcc symmetry agree very well with existing results, validating the
methodology. Furthermore, fully original results are shown for fcc lattice
symmetry, revealing the generality of the reported observations.
| cond-mat.mtrl-sci | we address a threedimensional coarsegrained description of dislocation networks at grain boundaries between rotated crystals the socalled amplitude expansion of the phasefield crystal model is exploited with the aid of finite element method calculations this approach allows for the description of microscopic features such as dislocations while simultaneously being able to describe length scales that are orders of magnitude larger than the lattice spacing moreover it allows for the direct description of extended defects by means of a scalar order parameter the versatility of this framework is shown by considering both fcc and bcc lattice symmetries and different rotation axes first the specific case of planar twist grain boundaries is illustrated the details of the method are reported and the consistency of the results with literature is discussed then the dislocation networks forming at the interface between a spherical rotated crystal embedded in an unrotated crystalline structure are shown although explicitly accounting for dislocations which lead to an anisotropic shrinkage of the rotated grain the extension of the spherical grain boundary is found to decrease linearly over time in agreement with the classical theory of grain growth and recent atomistic investigations it is shown that the results obtained for a system with bcc symmetry agree very well with existing results validating the methodology furthermore fully original results are shown for fcc lattice symmetry revealing the generality of the reported observations | [['we', 'address', 'a', 'threedimensional', 'coarsegrained', 'description', 'of', 'dislocation', 'networks', 'at', 'grain', 'boundaries', 'between', 'rotated', 'crystals', 'the', 'socalled', 'amplitude', 'expansion', 'of', 'the', 'phasefield', 'crystal', 'model', 'is', 'exploited', 'with', 'the', 'aid', 'of', 'finite', 'element', 'method', 'calculations', 'this', 'approach', 'allows', 'for', 'the', 'description', 'of', 'microscopic', 'features', 'such', 'as', 'dislocations', 'while', 'simultaneously', 'being', 'able', 'to', 'describe', 'length', 'scales', 'that', 'are', 'orders', 'of', 'magnitude', 'larger', 'than', 'the', 'lattice', 'spacing', 'moreover', 'it', 'allows', 'for', 'the', 'direct', 'description', 'of', 'extended', 'defects', 'by', 'means', 'of', 'a', 'scalar', 'order', 'parameter', 'the', 'versatility', 'of', 'this', 'framework', 'is', 'shown', 'by', 'considering', 'both', 'fcc', 'and', 'bcc', 'lattice', 'symmetries', 'and', 'different', 'rotation', 'axes', 'first', 'the', 'specific', 'case', 'of', 'planar', 'twist', 'grain', 'boundaries', 'is', 'illustrated', 'the', 'details', 'of', 'the', 'method', 'are', 'reported', 'and', 'the', 'consistency', 'of', 'the', 'results', 'with', 'literature', 'is', 'discussed', 'then', 'the', 'dislocation', 'networks', 'forming', 'at', 'the', 'interface', 'between', 'a', 'spherical', 'rotated', 'crystal', 'embedded', 'in', 'an', 'unrotated', 'crystalline', 'structure', 'are', 'shown', 'although', 'explicitly', 'accounting', 'for', 'dislocations', 'which', 'lead', 'to', 'an', 'anisotropic', 'shrinkage', 'of', 'the', 'rotated', 'grain', 'the', 'extension', 'of', 'the', 'spherical', 'grain', 'boundary', 'is', 'found', 'to', 'decrease', 'linearly', 'over', 'time', 'in', 'agreement', 'with', 'the', 'classical', 'theory', 'of', 'grain', 'growth', 'and', 'recent', 'atomistic', 'investigations', 'it', 'is', 'shown', 'that', 'the', 'results', 'obtained', 'for', 'a', 'system', 'with', 'bcc', 'symmetry', 'agree', 'very', 'well', 'with', 'existing', 'results', 'validating', 'the', 'methodology', 'furthermore', 'fully', 'original', 'results', 'are', 'shown', 'for', 'fcc', 'lattice', 'symmetry', 'revealing', 'the', 'generality', 'of', 'the', 'reported', 'observations']] | [-0.09152445239381884, 0.13551336048770715, -0.05710860636976102, 0.0034360287063147713, -0.04748157081244837, -0.09716261960844429, -0.004982203041183074, 0.41992474327714224, -0.2442545233760029, -0.28815650193061193, 0.07073302078820036, -0.25111150064761245, -0.13760208133000718, 0.15897802311481665, 0.014700865123798038, 0.0696277595287108, 0.04080252503196749, -0.005660730382711019, -0.09400953784099092, -0.25206456882372985, 0.27170341206593035, 0.06875315502731373, 0.3363223129114055, 0.053088022523012986, 0.0625078583723339, -0.003489219897892326, -0.011293725741510887, 0.06706579706186186, -0.1886724265963573, 0.1337324585438024, 0.21513624148261126, -0.035048109965155956, 0.16967483793547297, -0.45962743854312144, -0.23778191342261498, 0.011845641963831756, 0.13102706879701304, 0.154532049679825, -0.03303429711630325, -0.256529978892523, 0.10451940832679849, -0.1271788872697431, -0.18569607141052985, -0.0765143902891356, -0.012124886339449364, -0.0046540115981651585, -0.26173072955685, 0.09620835232022015, 0.078122880773963, 0.07641943216234642, -0.09413292386781667, -0.10839139582417176, -0.08846153436005925, 0.0791599665970906, 0.05335460155746778, 0.021674153427390947, 0.10603208571530716, -0.08484698677961917, -0.1153846178555598, 0.44146980489401716, 0.008448974498858898, -0.18734462682927108, 0.17428562575343834, -0.1405340878718087, -0.08993661760595506, 0.16321563417820828, 0.10354378967616788, 0.09018627247449172, -0.12542826479488134, 0.07345031571736478, -0.02221123320809768, 0.16636153727456038, 0.07625685235910604, -0.010512781414771502, 0.1965311930514872, 0.1995725744988506, 0.026062473808617696, 0.1560879990833042, -0.09328180143467919, -0.1354992929076695, -0.2993153754206698, -0.14646472378137887, -0.2050339863382523, -0.02927323196629953, -0.13895432718728326, -0.1643188823983782, 0.3538441773382542, 0.11576214326000216, 0.18144988920539618, 0.036363653824968346, 0.22824766630023394, 0.07556654510807002, 0.10510706722802159, 0.032804760509980435, 0.21793201780351606, 0.15504056419822915, 0.07189046445191312, -0.23903152111654535, 0.06632844990767214, 0.05969239043820973] |
1,803.03234 | Improving Optimization for Models With Continuous Symmetry Breaking | Many loss functions in representation learning are invariant under a
continuous symmetry transformation. For example, the loss function of word
embeddings (Mikolov et al., 2013) remains unchanged if we simultaneously rotate
all word and context embedding vectors. We show that representation learning
models for time series possess an approximate continuous symmetry that leads to
slow convergence of gradient descent. We propose a new optimization algorithm
that speeds up convergence using ideas from gauge theory in physics. Our
algorithm leads to orders of magnitude faster convergence and to more
interpretable representations, as we show for dynamic extensions of matrix
factorization and word embedding models. We further present an example
application of our proposed algorithm that translates modern words into their
historic equivalents.
| stat.ML cs.LG | many loss functions in representation learning are invariant under a continuous symmetry transformation for example the loss function of word embeddings mikolov et al 2013 remains unchanged if we simultaneously rotate all word and context embedding vectors we show that representation learning models for time series possess an approximate continuous symmetry that leads to slow convergence of gradient descent we propose a new optimization algorithm that speeds up convergence using ideas from gauge theory in physics our algorithm leads to orders of magnitude faster convergence and to more interpretable representations as we show for dynamic extensions of matrix factorization and word embedding models we further present an example application of our proposed algorithm that translates modern words into their historic equivalents | [['many', 'loss', 'functions', 'in', 'representation', 'learning', 'are', 'invariant', 'under', 'a', 'continuous', 'symmetry', 'transformation', 'for', 'example', 'the', 'loss', 'function', 'of', 'word', 'embeddings', 'mikolov', 'et', 'al', '2013', 'remains', 'unchanged', 'if', 'we', 'simultaneously', 'rotate', 'all', 'word', 'and', 'context', 'embedding', 'vectors', 'we', 'show', 'that', 'representation', 'learning', 'models', 'for', 'time', 'series', 'possess', 'an', 'approximate', 'continuous', 'symmetry', 'that', 'leads', 'to', 'slow', 'convergence', 'of', 'gradient', 'descent', 'we', 'propose', 'a', 'new', 'optimization', 'algorithm', 'that', 'speeds', 'up', 'convergence', 'using', 'ideas', 'from', 'gauge', 'theory', 'in', 'physics', 'our', 'algorithm', 'leads', 'to', 'orders', 'of', 'magnitude', 'faster', 'convergence', 'and', 'to', 'more', 'interpretable', 'representations', 'as', 'we', 'show', 'for', 'dynamic', 'extensions', 'of', 'matrix', 'factorization', 'and', 'word', 'embedding', 'models', 'we', 'further', 'present', 'an', 'example', 'application', 'of', 'our', 'proposed', 'algorithm', 'that', 'translates', 'modern', 'words', 'into', 'their', 'historic', 'equivalents']] | [-0.03541768493788886, 0.07402945866289717, -0.11780936694280668, 0.08434957805212803, -0.10728675268267181, -0.11848690931556347, 0.03438220669857942, 0.4707657350458143, -0.3424071542810926, -0.2901432725970349, 0.06772247426719828, -0.2507197777009454, -0.22392218483011583, 0.19395250412260281, -0.10128360731942841, 0.07308786369336784, 0.07248166057642949, 0.013568516524339264, -0.14332518971348104, -0.31165001613726795, 0.2536674153313718, 0.00490019437356675, 0.30060434814019144, -0.03482802173224747, 0.17286665979960417, 0.009618371513418177, 0.007594768469768368, -0.029505692941929437, -0.07397871864127373, 0.15722932872239284, 0.250318103270571, 0.20573051512041243, 0.2855161306532947, -0.3854800727187602, -0.19924800834533843, 0.10610887732295211, 0.1673868927712098, 0.1300556613555686, -0.08788308325887, -0.27668029940417727, 0.09611722243534139, -0.1891650373408617, -0.03318019794812041, -0.20599587553196147, 0.013918038828044453, -0.015559291928883426, -0.29404844484322756, 0.07375107518760347, 0.1329591994343156, 0.04233229267295481, -0.08163884490312746, -0.10392395317677625, 0.05722725770074474, 0.07874128482620085, 0.07663301012886703, 0.07038820125470477, 0.08784596561762112, -0.12084266157389796, -0.16734992805868387, 0.3627612592521593, -0.09146232003238329, -0.2152962848728846, 0.2015276715113235, -0.05274748537700993, -0.17102121519432825, 0.09724681333769575, 0.23408540456809782, 0.1083893149336877, -0.09957519844790136, 0.10445820903482515, -0.06568941756436401, 0.15678403815466233, 0.08643128119085815, 0.0012550659108260447, 0.12396849543702873, 0.15248999363850524, 0.09817543337727735, 0.12435446209505138, -0.0026261371479577517, -0.09973437620051713, -0.26898047934509506, -0.1472029965418999, -0.13730997922695587, 0.006191913463744866, -0.13879848297356825, -0.148515000081167, 0.41211523740621636, 0.20840522136600795, 0.2221613356628078, 0.14577595890338016, 0.26052541464320883, 0.10869947379966813, 0.06609415893889348, 0.1587678904699023, 0.14062821483508922, 0.09877242937814906, 0.05188809422206534, -0.15710894579321824, 0.04923527025856263, 0.16621032945642417] |
1,803.03235 | Meson properties and phase diagrams in a SU(3) nlPNJL model with
lQCD-inspired form factors | We study the features of a nonlocal SU(3) Polyakov-Nambu-Jona-Lasinio model
that includes wave function renormalization. Model parameters are determined
from vacuum phenomenology considering lattice QCD-inspired nonlocal form
factors. Within this framework we analyze the properties of light scalar and
pseudoscalar mesons at finite temperature and chemical potential determining
characteristics of deconfinement and chiral restoration transitions.
| hep-ph | we study the features of a nonlocal su3 polyakovnambujonalasinio model that includes wave function renormalization model parameters are determined from vacuum phenomenology considering lattice qcdinspired nonlocal form factors within this framework we analyze the properties of light scalar and pseudoscalar mesons at finite temperature and chemical potential determining characteristics of deconfinement and chiral restoration transitions | [['we', 'study', 'the', 'features', 'of', 'a', 'nonlocal', 'su3', 'polyakovnambujonalasinio', 'model', 'that', 'includes', 'wave', 'function', 'renormalization', 'model', 'parameters', 'are', 'determined', 'from', 'vacuum', 'phenomenology', 'considering', 'lattice', 'qcdinspired', 'nonlocal', 'form', 'factors', 'within', 'this', 'framework', 'we', 'analyze', 'the', 'properties', 'of', 'light', 'scalar', 'and', 'pseudoscalar', 'mesons', 'at', 'finite', 'temperature', 'and', 'chemical', 'potential', 'determining', 'characteristics', 'of', 'deconfinement', 'and', 'chiral', 'restoration', 'transitions']] | [-0.11174203346229412, 0.23081221309575167, -0.11356005786325443, 0.10468920822128315, -0.06987623954191804, -0.13544069114564494, 0.0438332124189897, 0.370077969641848, -0.18743770478547297, -0.2214694162661379, -0.027215412072837352, -0.3029657620259307, -0.1326076686043631, 0.0248641992919147, 0.12717522150328892, 0.0884378857402639, -0.03287132878487517, 0.011815737551924858, -0.13532768836752934, -0.1629276682538065, 0.3479425274174322, -0.053529626528986476, 0.25097003684125163, 0.17061337028545412, 0.04686236139386892, 0.004047797112302347, -0.00403277524323626, -0.015133105624805797, -0.15779618626441913, -0.001714809120378711, 0.17466204201125285, 0.029736851240423592, 0.13757995543154802, -0.37021191689101135, -0.30899160047569735, 0.10595263317227363, 0.08535983271642843, 0.17126636096191677, -0.03828718166121028, -0.3189723038199273, 0.057484895465048876, -0.17946443329141898, -0.20301870124583896, -0.16884933947162195, -0.04658050669187849, -0.04446685399267484, -0.30495827638290146, 0.12537377348000353, -0.07156962501731785, 0.08320255513218316, -0.08723274732685903, -0.19075683751566844, -0.05067978036505255, 0.0566119503907182, 0.0817973929330368, 0.019888141543858432, 0.1932282279330221, -0.23890606152655727, -0.08647858518472111, 0.45986132777550004, -0.1232031284069473, -0.1558914097634525, 0.09592230565507304, -0.11888277699154887, -0.13080712026831778, 0.07219798201695085, 0.21368984596973115, 0.07995400018143382, -0.22225770447403193, 0.12243382518962873, -0.024657452241676352, 0.14218510929283432, 0.04575758627615869, 0.10455167968334123, 0.22561611241915008, 0.19281495069576934, -0.09677131763574752, 0.11987643604251472, 0.004037037813528018, -0.17176785750145263, -0.41615828549997375, -0.05005288174037229, -0.11822851364585486, 0.01815796841692645, -0.13634669784885112, -0.12783706862987443, 0.48430371577004816, 0.13175289902666754, 0.1916617621413686, -0.03154140712524002, 0.24019634276628493, 0.11730245751413432, 0.055453009945763784, 0.058784200217236175, 0.23324673820964315, 0.21582347019575537, 0.10402575026858937, -0.3586956860455261, -0.06324577612209727, 0.14902024844830686] |
1,803.03236 | First predictions of the angular power spectrum of the astrophysical
gravitational wave background | We present the first predictions for the angular power spectrum of the
astrophysical gravitational wave background constituted of the radiation
emitted by all resolved and unresolved astrophysical sources. Its shape and
amplitude depend on both the astrophysical properties on galactic scales and on
cosmological properties. We show that the angular power spectrum behaves as
$C_{\ell}\propto 1/{\ell}$ on large scales and that relative fluctuations of
the signal are of order 30% at 100 Hz. We also present the correlations of the
astrophysical gravitational wave background with weak-lensing and galaxy
distribution. These numerical results pave the way to the study of a new
observable at the crossroad between general relativity, astrophysics and
cosmology.
| astro-ph.CO astro-ph.GA gr-qc hep-th | we present the first predictions for the angular power spectrum of the astrophysical gravitational wave background constituted of the radiation emitted by all resolved and unresolved astrophysical sources its shape and amplitude depend on both the astrophysical properties on galactic scales and on cosmological properties we show that the angular power spectrum behaves as c_ellpropto 1ell on large scales and that relative fluctuations of the signal are of order 30 at 100 hz we also present the correlations of the astrophysical gravitational wave background with weaklensing and galaxy distribution these numerical results pave the way to the study of a new observable at the crossroad between general relativity astrophysics and cosmology | [['we', 'present', 'the', 'first', 'predictions', 'for', 'the', 'angular', 'power', 'spectrum', 'of', 'the', 'astrophysical', 'gravitational', 'wave', 'background', 'constituted', 'of', 'the', 'radiation', 'emitted', 'by', 'all', 'resolved', 'and', 'unresolved', 'astrophysical', 'sources', 'its', 'shape', 'and', 'amplitude', 'depend', 'on', 'both', 'the', 'astrophysical', 'properties', 'on', 'galactic', 'scales', 'and', 'on', 'cosmological', 'properties', 'we', 'show', 'that', 'the', 'angular', 'power', 'spectrum', 'behaves', 'as', 'c_ellpropto', '1ell', 'on', 'large', 'scales', 'and', 'that', 'relative', 'fluctuations', 'of', 'the', 'signal', 'are', 'of', 'order', '30', 'at', '100', 'hz', 'we', 'also', 'present', 'the', 'correlations', 'of', 'the', 'astrophysical', 'gravitational', 'wave', 'background', 'with', 'weaklensing', 'and', 'galaxy', 'distribution', 'these', 'numerical', 'results', 'pave', 'the', 'way', 'to', 'the', 'study', 'of', 'a', 'new', 'observable', 'at', 'the', 'crossroad', 'between', 'general', 'relativity', 'astrophysics', 'and', 'cosmology']] | [-0.1197350671430203, 0.14734920096922327, -0.072999693216248, 0.10657322004897817, -0.08856619296129793, -0.01303743723441254, -0.053132361304861576, 0.33279525281607425, -0.22153315933590587, -0.3413462734019214, 0.0541318061909723, -0.31768550016832625, -0.054544644358313896, 0.27061231503400696, 0.07678354350341991, 0.03245539429798638, 0.023197315370833332, -0.024131921289319343, -0.04085243367907507, -0.1680825450372967, 0.3674886379729618, 0.16982475741004402, 0.21027819559359076, 0.03371047754348679, 0.11694833533415062, -0.049098257813602685, -0.1016227441501211, 0.00781794464300302, -0.1582782352836644, 0.05422447100810876, 0.21743285364725373, 0.14113326009193605, 0.1672611088068648, -0.39069311375814403, -0.2305034819313071, 0.07032326276160099, 0.1130698524119163, 0.10843387099660255, -0.08247573337179016, -0.28585755530406126, 0.05478450661863793, -0.15266295235434715, -0.13177098124288023, -0.017777138080617243, 0.015008149888705124, 0.060447898132472554, -0.19368857539428228, 0.141851551197628, 0.014788684039707402, -0.008307586855847727, -0.09039805891860107, -0.10479288149244068, 0.004968614084646106, 0.10733925205740062, 0.07273898997598073, 0.013374936354177242, 0.1733228235082193, -0.1480690591016107, -0.06477606509896842, 0.43143292924558574, -0.09607517826900056, -0.13746764688667926, 0.1635699362070723, -0.2631738157053901, -0.1725586315151304, 0.09786012894050641, 0.20378371091898193, 0.11588987118818543, -0.08122439648617398, 0.07014750058191235, 0.029523205444142647, 0.19100791685791177, 0.07748669822784987, 0.11811738258018688, 0.3223620508966798, 0.1240727635100484, 0.04034115180309693, 0.08098501994232224, -0.20059832685457712, -0.0251198132712902, -0.34652825346407057, -0.057535728676752614, -0.16396817880873146, 0.09377345516087106, -0.13372399273926436, -0.12119257130014541, 0.40898167753422804, 0.1721108417746357, 0.17130398989485746, 0.06674796702678908, 0.3147023000500419, 0.06604331210361455, -0.005661510273983533, 0.07990081300958991, 0.3410528901964426, 0.14482106949753043, 0.10478619484400208, -0.2539061019027775, -0.0028472820508547805, -0.05022538616321981] |
1,803.03237 | A Classification-based Approach for Approximate Reachability | Hamilton-Jacobi (HJ) reachability analysis has been developed over the past
decades into a widely-applicable tool for determining goal satisfaction and
safety verification in nonlinear systems. While HJ reachability can be
formulated very generally, computational complexity can be a serious impediment
for many systems of practical interest. Much prior work has been devoted to
computing approximate solutions to large reachability problems, yet many of
these methods may only apply to very restrictive problem classes, do not
generate controllers, and/or can be extremely conservative. In this paper, we
present a new method for approximating the optimal controller of the HJ
reachability problem for control-affine systems. While also a specific problem
class, many dynamical systems of interest are, or can be well approximated, by
control-affine models. We explicitly avoid storing a representation of the
reachability value function, and instead learn a controller as a sequence of
simple binary classifiers. We compare our approach to existing grid-based
methodologies in HJ reachability and demonstrate its utility on several
examples, including a physical quadrotor navigation task.
| cs.RO | hamiltonjacobi hj reachability analysis has been developed over the past decades into a widelyapplicable tool for determining goal satisfaction and safety verification in nonlinear systems while hj reachability can be formulated very generally computational complexity can be a serious impediment for many systems of practical interest much prior work has been devoted to computing approximate solutions to large reachability problems yet many of these methods may only apply to very restrictive problem classes do not generate controllers andor can be extremely conservative in this paper we present a new method for approximating the optimal controller of the hj reachability problem for controlaffine systems while also a specific problem class many dynamical systems of interest are or can be well approximated by controlaffine models we explicitly avoid storing a representation of the reachability value function and instead learn a controller as a sequence of simple binary classifiers we compare our approach to existing gridbased methodologies in hj reachability and demonstrate its utility on several examples including a physical quadrotor navigation task | [['hamiltonjacobi', 'hj', 'reachability', 'analysis', 'has', 'been', 'developed', 'over', 'the', 'past', 'decades', 'into', 'a', 'widelyapplicable', 'tool', 'for', 'determining', 'goal', 'satisfaction', 'and', 'safety', 'verification', 'in', 'nonlinear', 'systems', 'while', 'hj', 'reachability', 'can', 'be', 'formulated', 'very', 'generally', 'computational', 'complexity', 'can', 'be', 'a', 'serious', 'impediment', 'for', 'many', 'systems', 'of', 'practical', 'interest', 'much', 'prior', 'work', 'has', 'been', 'devoted', 'to', 'computing', 'approximate', 'solutions', 'to', 'large', 'reachability', 'problems', 'yet', 'many', 'of', 'these', 'methods', 'may', 'only', 'apply', 'to', 'very', 'restrictive', 'problem', 'classes', 'do', 'not', 'generate', 'controllers', 'andor', 'can', 'be', 'extremely', 'conservative', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'method', 'for', 'approximating', 'the', 'optimal', 'controller', 'of', 'the', 'hj', 'reachability', 'problem', 'for', 'controlaffine', 'systems', 'while', 'also', 'a', 'specific', 'problem', 'class', 'many', 'dynamical', 'systems', 'of', 'interest', 'are', 'or', 'can', 'be', 'well', 'approximated', 'by', 'controlaffine', 'models', 'we', 'explicitly', 'avoid', 'storing', 'a', 'representation', 'of', 'the', 'reachability', 'value', 'function', 'and', 'instead', 'learn', 'a', 'controller', 'as', 'a', 'sequence', 'of', 'simple', 'binary', 'classifiers', 'we', 'compare', 'our', 'approach', 'to', 'existing', 'gridbased', 'methodologies', 'in', 'hj', 'reachability', 'and', 'demonstrate', 'its', 'utility', 'on', 'several', 'examples', 'including', 'a', 'physical', 'quadrotor', 'navigation', 'task']] | [-0.12197482278570533, -0.02423671287320116, -0.0770259134197498, 0.09040452300036764, -0.12306149581666379, -0.19347359054954721, 0.04368157305426019, 0.3718171056250439, -0.2925028911271297, -0.3602118241135031, 0.17285311217625243, -0.2264121327576611, -0.15906859040979351, 0.2651300997685586, -0.15888983112869456, 0.21394864372559824, 0.12313295336770191, 0.023491105700240416, -0.05609187916578615, -0.23914403038387022, 0.2884831402943853, -0.01807137323433862, 0.20208860218990593, 0.01872957570697455, 0.09427502173108651, -0.0029008560396237846, 0.02619534205809674, 0.0879691803964841, -0.07924238391467096, 0.11186721352038577, 0.3569485987381888, 0.21511703002376154, 0.3792576622984865, -0.399227349832654, -0.25428531937410725, 0.15075603882741073, 0.18845954897115008, 0.14430509884293904, -0.041904166840044235, -0.2868449956158121, 0.10750793283805252, -0.2095601747120621, -0.07100546912509291, -0.14464084991692183, 0.02216694833820357, 0.008522547591436544, -0.2672732019139563, -0.017317531086840008, 0.0783275786196635, 0.04137464471654419, -0.07018032726927606, -0.09016979271546006, 0.02010797370937379, 0.13468447764650646, 0.02313365106306532, -0.004020736041917082, 0.10749592391623403, -0.1187991266258691, -0.18466754142667496, 0.4018682595451965, 0.027091714680907042, -0.24830401356825058, 0.23525627815328976, -0.02549259271198774, -0.20575432947508115, 0.12170490000999587, 0.24716974781442652, 0.18239493069019827, -0.21230924150372363, 0.0862671627488453, -0.022028534421149423, 0.16180706073749154, 0.0317609953094849, 0.021040964512811865, 0.19624705895891084, 0.2300855481860173, 0.11863370332627228, 0.12396455713383416, 0.025191318661467555, -0.13098193037816708, -0.20136167058611618, -0.12284134328296846, -0.14946597251109778, 0.012884708582372268, -0.050963046984928526, -0.1449956894205945, 0.35432291089776247, 0.19606237813003485, 0.1414914009435212, 0.12557713563334855, 0.33478948191246566, 0.15936781789504867, 0.0449485497412217, 0.0784599293697872, 0.2107091346522793, 0.0991157150882132, 0.10883074388770825, -0.2042536493527758, 0.13707968859577221, 0.0667201638194349] |
1,803.03238 | Length of the longest common subsequence between overlapping words | Given two random finite sequences from $[k]^n$ such that a prefix of the
first sequence is a suffix of the second, we examine the length of their
longest common subsequence. If $\ell$ is the length of the overlap, we prove
that the expected length of an LCS is approximately $\max(\ell,
\mathbb{E}[L_n])$, where $L_n$ is the length of an LCS between two independent
random sequences. We also obtain tail bounds on this quantity.
| math.PR math.CO | given two random finite sequences from kn such that a prefix of the first sequence is a suffix of the second we examine the length of their longest common subsequence if ell is the length of the overlap we prove that the expected length of an lcs is approximately maxell mathbbel_n where l_n is the length of an lcs between two independent random sequences we also obtain tail bounds on this quantity | [['given', 'two', 'random', 'finite', 'sequences', 'from', 'kn', 'such', 'that', 'a', 'prefix', 'of', 'the', 'first', 'sequence', 'is', 'a', 'suffix', 'of', 'the', 'second', 'we', 'examine', 'the', 'length', 'of', 'their', 'longest', 'common', 'subsequence', 'if', 'ell', 'is', 'the', 'length', 'of', 'the', 'overlap', 'we', 'prove', 'that', 'the', 'expected', 'length', 'of', 'an', 'lcs', 'is', 'approximately', 'maxell', 'mathbbel_n', 'where', 'l_n', 'is', 'the', 'length', 'of', 'an', 'lcs', 'between', 'two', 'independent', 'random', 'sequences', 'we', 'also', 'obtain', 'tail', 'bounds', 'on', 'this', 'quantity']] | [-0.2066525184391399, 0.204546200940136, -0.07865841402007001, 0.08080957973475701, -0.022954972494127496, -0.07151641429268889, 0.04796769023440512, 0.3963677822346134, -0.38692239033324377, -0.18076373439149132, 0.09388632402489228, -0.3174283900963409, -0.12525862127076834, 0.18726351765050953, -0.05895997945086232, 0.015280598184160357, 0.03714457832143775, 0.1673552077795778, -0.04641457208698349, -0.25315432481334676, 0.28427572684096436, -0.0004157402286572116, 0.22491442656942776, -0.010489665756800345, 0.08404323220519083, 0.044858703788902075, -0.03473262158222497, -0.014481998048722744, -0.1729131935773434, 0.09502495479370866, 0.18688999393156597, 0.1773810213705084, 0.2587094793229231, -0.3563761496118137, -0.11345018153744084, 0.1760177270908441, 0.16180964412965945, 0.09883838978462986, 0.02280471043029268, -0.1683076304649668, 0.18039184675684997, -0.08341505341730746, -0.08625714824135815, 0.09132431890549404, 0.11992800628234233, 0.08979422808624804, -0.25875774483595576, 0.007002935448378724, 0.10956086594212268, 0.04238120034070952, 0.018265745116929924, -0.13269251832472426, 0.052501412201672794, 0.15124832994437643, 0.12933919006692512, 0.044485532086608666, -0.006602735930521573, -0.059977724067201574, -0.13765485188923776, 0.36290841988687006, -0.10499877237847872, -0.1792950781860522, 0.10061061816023929, -0.11128500964093421, -0.14475088895830726, 0.129764124072556, 0.09728229623287916, 0.15347317837710892, -0.11131800600726689, 0.07700029006227851, -0.14696791197971573, 0.26604757185227107, 0.1328410008656127, 0.0885992675088346, 0.1882621859732483, 0.17519889056150403, 0.11075864707651947, 0.17858487743485188, -0.11937232837413571, -0.037343781581148504, -0.3168194178225739, -0.14962764842369194, -0.24255714268822756, 0.06784975049751145, -0.20195858273655176, -0.23427050124155357, 0.3662593644644533, 0.1338522625288793, 0.2425690345266568, 0.17107618964343732, 0.2508033928993557, 0.11932720024404782, 0.031056410972295063, 0.10892051648614662, 0.0851363011768886, 0.09550826107151807, -0.05545770707540214, -0.23233326672884036, 0.07106398773113531, 0.13880009812835073] |
1,803.03239 | Fairness Through Computationally-Bounded Awareness | We study the problem of fair classification within the versatile framework of
Dwork et al. [ITCS '12], which assumes the existence of a metric that measures
similarity between pairs of individuals. Unlike earlier work, we do not assume
that the entire metric is known to the learning algorithm; instead, the learner
can query this arbitrary metric a bounded number of times. We propose a new
notion of fairness called metric multifairness and show how to achieve this
notion in our setting. Metric multifairness is parameterized by a similarity
metric $d$ on pairs of individuals to classify and a rich collection ${\cal C}$
of (possibly overlapping) "comparison sets" over pairs of individuals. At a
high level, metric multifairness guarantees that similar subpopulations are
treated similarly, as long as these subpopulations are identified within the
class ${\cal C}$.
| cs.LG cs.CC cs.DS | we study the problem of fair classification within the versatile framework of dwork et al itcs 12 which assumes the existence of a metric that measures similarity between pairs of individuals unlike earlier work we do not assume that the entire metric is known to the learning algorithm instead the learner can query this arbitrary metric a bounded number of times we propose a new notion of fairness called metric multifairness and show how to achieve this notion in our setting metric multifairness is parameterized by a similarity metric d on pairs of individuals to classify and a rich collection cal c of possibly overlapping comparison sets over pairs of individuals at a high level metric multifairness guarantees that similar subpopulations are treated similarly as long as these subpopulations are identified within the class cal c | [['we', 'study', 'the', 'problem', 'of', 'fair', 'classification', 'within', 'the', 'versatile', 'framework', 'of', 'dwork', 'et', 'al', 'itcs', '12', 'which', 'assumes', 'the', 'existence', 'of', 'a', 'metric', 'that', 'measures', 'similarity', 'between', 'pairs', 'of', 'individuals', 'unlike', 'earlier', 'work', 'we', 'do', 'not', 'assume', 'that', 'the', 'entire', 'metric', 'is', 'known', 'to', 'the', 'learning', 'algorithm', 'instead', 'the', 'learner', 'can', 'query', 'this', 'arbitrary', 'metric', 'a', 'bounded', 'number', 'of', 'times', 'we', 'propose', 'a', 'new', 'notion', 'of', 'fairness', 'called', 'metric', 'multifairness', 'and', 'show', 'how', 'to', 'achieve', 'this', 'notion', 'in', 'our', 'setting', 'metric', 'multifairness', 'is', 'parameterized', 'by', 'a', 'similarity', 'metric', 'd', 'on', 'pairs', 'of', 'individuals', 'to', 'classify', 'and', 'a', 'rich', 'collection', 'cal', 'c', 'of', 'possibly', 'overlapping', 'comparison', 'sets', 'over', 'pairs', 'of', 'individuals', 'at', 'a', 'high', 'level', 'metric', 'multifairness', 'guarantees', 'that', 'similar', 'subpopulations', 'are', 'treated', 'similarly', 'as', 'long', 'as', 'these', 'subpopulations', 'are', 'identified', 'within', 'the', 'class', 'cal', 'c']] | [-0.12894834773204125, 0.06835212181014118, -0.07336292704670033, 0.08770040344611249, -0.07420122720748837, -0.1383441820165471, 0.09594192070311264, 0.38869636041550515, -0.24030822054962353, -0.32271293429863257, -0.0026799780102652114, -0.2908836151747143, -0.15605781959825168, 0.12253299948283444, -0.1453649364754229, 0.01201074749833959, 0.05203120769960258, 0.07647322393227916, -0.04165068779462565, -0.2850163878790815, 0.34963840595446527, 0.016089695724932587, 0.28517020719728486, 0.011767998111762983, 0.11289282833732774, -0.004047914121817003, -0.04087854443830164, 0.08948361720917199, -0.10376945984808117, 0.14205883749373777, 0.27309050861581724, 0.21526896575232968, 0.3207423475687392, -0.3013939401956604, -0.20116395047722002, 0.1553343270009945, 0.12571111272143967, 0.07323334708053153, 0.012952113334904425, -0.29571539245765, 0.13727673668130164, -0.17127285181435153, -0.06914471873588969, -0.06852451134781244, 0.022506012187531108, -0.0006700883609215345, -0.2637426847222206, 0.03575010804642636, 0.08809361393864759, 0.030266078853267517, -0.04390212807201726, -0.06928375470862888, 0.0037720438541488394, 0.09471856202135849, 0.013564532131353831, 0.08107835068714099, 0.08359081934288363, -0.06206209589864182, -0.13252135312444913, 0.34682665469453616, -0.06776284355831141, -0.20579524634077268, 0.20662290549850748, -0.10175722974407322, -0.14069887387621052, 0.05322859002112904, 0.21253829046669553, 0.1829693161861916, -0.15501995666829102, 0.08748694693221136, -0.11446583144339349, 0.1443157771787168, 0.0872622834662359, 0.04019858343321282, 0.13083842549788052, 0.13745025018408127, 0.08563062640228856, 0.10817429871873602, -0.010424211090567577, -0.08353242026650524, -0.29927291053429467, -0.1393351677842849, -0.1446525639433222, 0.0481536331714297, -0.10747512130332967, -0.19016214422171127, 0.37031144769314456, 0.09530252468539402, 0.25143995263394625, 0.12348790865935906, 0.22497570176389725, 0.017855319683268832, 0.05204178715597235, 0.11475483981399413, 0.18211065937751247, 0.07338503968853996, 0.034239666898536275, -0.1651906958722975, 0.08794079049873878, 0.08282068547455043] |
1,803.0324 | The maximum number of $P_\ell$ copies in $P_k$-free graphs | Generalizing Tur\'an's classical extremal problem, Alon and Shikhelman
investigated the problem of maximizing the number of $T$ copies in an $H$-free
graph, for a pair of graphs $T$ and $H$. Whereas Alon and Shikhelman were
primarily interested in determining the order of magnitude for large classes of
graphs $H$, we focus on the case when $T$ and $H$ are paths, where we find
asymptotic and in some cases exact results. We also consider other structures
like stars and the set of cycles of length at least $k$, where we derive
asymptotically sharp estimates. Our results generalize well-known extremal
theorems of Erd\H{o}s and Gallai.
| math.CO | generalizing turans classical extremal problem alon and shikhelman investigated the problem of maximizing the number of t copies in an hfree graph for a pair of graphs t and h whereas alon and shikhelman were primarily interested in determining the order of magnitude for large classes of graphs h we focus on the case when t and h are paths where we find asymptotic and in some cases exact results we also consider other structures like stars and the set of cycles of length at least k where we derive asymptotically sharp estimates our results generalize wellknown extremal theorems of erdhos and gallai | [['generalizing', 'turans', 'classical', 'extremal', 'problem', 'alon', 'and', 'shikhelman', 'investigated', 'the', 'problem', 'of', 'maximizing', 'the', 'number', 'of', 't', 'copies', 'in', 'an', 'hfree', 'graph', 'for', 'a', 'pair', 'of', 'graphs', 't', 'and', 'h', 'whereas', 'alon', 'and', 'shikhelman', 'were', 'primarily', 'interested', 'in', 'determining', 'the', 'order', 'of', 'magnitude', 'for', 'large', 'classes', 'of', 'graphs', 'h', 'we', 'focus', 'on', 'the', 'case', 'when', 't', 'and', 'h', 'are', 'paths', 'where', 'we', 'find', 'asymptotic', 'and', 'in', 'some', 'cases', 'exact', 'results', 'we', 'also', 'consider', 'other', 'structures', 'like', 'stars', 'and', 'the', 'set', 'of', 'cycles', 'of', 'length', 'at', 'least', 'k', 'where', 'we', 'derive', 'asymptotically', 'sharp', 'estimates', 'our', 'results', 'generalize', 'wellknown', 'extremal', 'theorems', 'of', 'erdhos', 'and', 'gallai']] | [-0.12907421352224224, 0.12565770171691767, 0.01676878645491687, 0.06525547652351625, -0.04837226755781443, -0.1339506134436041, 0.07807142390288611, 0.33273806719525345, -0.2410159038528981, -0.34703679909947716, 0.11443893231894568, -0.33794358962224524, -0.10727871771793342, 0.17364310898402144, -0.09919605373847977, 0.036050219351009834, 0.08725439391724932, 0.08718281645707569, 0.014708577763759395, -0.3128729458365395, 0.30637316981188384, -0.03718933511923239, 0.1735124115298674, 0.0835669959321148, 0.02515844339776097, 0.06256951832718857, -0.04912923037716486, 0.06072452584705335, -0.25608207095070806, 0.07185121756996417, 0.25835283235330314, 0.11951630481618267, 0.23938875450092612, -0.3599928218274585, -0.1626492033721608, 0.17662801249495264, 0.13299917282753634, 0.06476321380395551, 0.010700904469240855, -0.21806433420510762, 0.11573447718440998, -0.04426499167954531, -0.10638782651009925, 0.00920750755021005, 0.10046738277650574, 0.034015474443152116, -0.2932818962749347, 0.04731576803487328, 0.16768762127505343, 0.04228271014572492, 0.011465068784479088, -0.2019322257809956, -0.0020184094149583174, 0.09742151688048571, 0.03420491940093236, 0.014659412518297367, 0.013639538214334007, -0.12962965131963342, -0.1563850509780414, 0.3108899222361376, -0.04477958667015169, -0.11037281108568016, 0.1423244333907383, -0.1629335607845083, -0.20058764998339912, 0.06438091526585586, 0.11856257224690567, 0.25754867955924743, -0.08337687855449084, 0.16040939547503547, -0.11060148218049876, 0.059302165371917404, 0.1943677556610585, 0.04124982055735512, 0.0820116950470267, 0.08547839058282812, 0.11233657191267907, 0.22069133194762472, -0.02155904585576969, -0.04234110748449576, -0.27450087208422896, -0.11885268768652803, -0.1856100068527084, 0.07407862514040424, -0.17921808990777033, -0.17385474556731512, 0.36763508384595217, 0.09423538154269144, 0.21351308241323794, 0.11195573329166011, 0.18201091164017766, 0.076655418128459, -0.03572486444078024, 0.18139840504244983, 0.16350735601821, 0.19986398251008386, 0.009208695501884788, -0.18611882776202796, 0.04934677962683937, 0.15782295398016288] |
1,803.03241 | Efficient Algorithms for Outlier-Robust Regression | We give the first polynomial-time algorithm for performing linear or
polynomial regression resilient to adversarial corruptions in both examples and
labels.
Given a sufficiently large (polynomial-size) training set drawn i.i.d. from
distribution D and subsequently corrupted on some fraction of points, our
algorithm outputs a linear function whose squared error is close to the squared
error of the best-fitting linear function with respect to D, assuming that the
marginal distribution of D over the input space is \emph{certifiably
hypercontractive}. This natural property is satisfied by many well-studied
distributions such as Gaussian, strongly log-concave distributions and, uniform
distribution on the hypercube among others. We also give a simple statistical
lower bound showing that some distributional assumption is necessary to succeed
in this setting.
These results are the first of their kind and were not known to be even
information-theoretically possible prior to our work.
Our approach is based on the sum-of-squares (SoS) method and is inspired by
the recent applications of the method for parameter recovery problems in
unsupervised learning. Our algorithm can be seen as a natural convex relaxation
of the following conceptually simple non-convex optimization problem: find a
linear function and a large subset of the input corrupted sample such that the
least squares loss of the function over the subset is minimized over all
possible large subsets.
| cs.LG cs.AI cs.DS stat.ML | we give the first polynomialtime algorithm for performing linear or polynomial regression resilient to adversarial corruptions in both examples and labels given a sufficiently large polynomialsize training set drawn iid from distribution d and subsequently corrupted on some fraction of points our algorithm outputs a linear function whose squared error is close to the squared error of the bestfitting linear function with respect to d assuming that the marginal distribution of d over the input space is emphcertifiably hypercontractive this natural property is satisfied by many wellstudied distributions such as gaussian strongly logconcave distributions and uniform distribution on the hypercube among others we also give a simple statistical lower bound showing that some distributional assumption is necessary to succeed in this setting these results are the first of their kind and were not known to be even informationtheoretically possible prior to our work our approach is based on the sumofsquares sos method and is inspired by the recent applications of the method for parameter recovery problems in unsupervised learning our algorithm can be seen as a natural convex relaxation of the following conceptually simple nonconvex optimization problem find a linear function and a large subset of the input corrupted sample such that the least squares loss of the function over the subset is minimized over all possible large subsets | [['we', 'give', 'the', 'first', 'polynomialtime', 'algorithm', 'for', 'performing', 'linear', 'or', 'polynomial', 'regression', 'resilient', 'to', 'adversarial', 'corruptions', 'in', 'both', 'examples', 'and', 'labels', 'given', 'a', 'sufficiently', 'large', 'polynomialsize', 'training', 'set', 'drawn', 'iid', 'from', 'distribution', 'd', 'and', 'subsequently', 'corrupted', 'on', 'some', 'fraction', 'of', 'points', 'our', 'algorithm', 'outputs', 'a', 'linear', 'function', 'whose', 'squared', 'error', 'is', 'close', 'to', 'the', 'squared', 'error', 'of', 'the', 'bestfitting', 'linear', 'function', 'with', 'respect', 'to', 'd', 'assuming', 'that', 'the', 'marginal', 'distribution', 'of', 'd', 'over', 'the', 'input', 'space', 'is', 'emphcertifiably', 'hypercontractive', 'this', 'natural', 'property', 'is', 'satisfied', 'by', 'many', 'wellstudied', 'distributions', 'such', 'as', 'gaussian', 'strongly', 'logconcave', 'distributions', 'and', 'uniform', 'distribution', 'on', 'the', 'hypercube', 'among', 'others', 'we', 'also', 'give', 'a', 'simple', 'statistical', 'lower', 'bound', 'showing', 'that', 'some', 'distributional', 'assumption', 'is', 'necessary', 'to', 'succeed', 'in', 'this', 'setting', 'these', 'results', 'are', 'the', 'first', 'of', 'their', 'kind', 'and', 'were', 'not', 'known', 'to', 'be', 'even', 'informationtheoretically', 'possible', 'prior', 'to', 'our', 'work', 'our', 'approach', 'is', 'based', 'on', 'the', 'sumofsquares', 'sos', 'method', 'and', 'is', 'inspired', 'by', 'the', 'recent', 'applications', 'of', 'the', 'method', 'for', 'parameter', 'recovery', 'problems', 'in', 'unsupervised', 'learning', 'our', 'algorithm', 'can', 'be', 'seen', 'as', 'a', 'natural', 'convex', 'relaxation', 'of', 'the', 'following', 'conceptually', 'simple', 'nonconvex', 'optimization', 'problem', 'find', 'a', 'linear', 'function', 'and', 'a', 'large', 'subset', 'of', 'the', 'input', 'corrupted', 'sample', 'such', 'that', 'the', 'least', 'squares', 'loss', 'of', 'the', 'function', 'over', 'the', 'subset', 'is', 'minimized', 'over', 'all', 'possible', 'large', 'subsets']] | [-0.06804727494114275, 0.04934703550566364, -0.07438892169712419, 0.0784854681702083, -0.08954458658310047, -0.15463888352104557, 0.06436640076465272, 0.39000824432170716, -0.3242318909850245, -0.2985684758358221, 0.10630214827801657, -0.25415109505090827, -0.18496906552666695, 0.20292283160347116, -0.1135538549914341, 0.13609622879415204, 0.05742729481719776, 0.03287841188358229, -0.0640462837235387, -0.34468415937463354, 0.3045230542113065, 0.002382132912550224, 0.22332335715481175, 0.0016734564459002618, 0.12030541246389509, 0.012164569679869834, -0.014369835201309088, 0.02687186593979644, -0.09541976014672167, 0.10852871839877713, 0.25872315307053817, 0.20253019043193157, 0.31073708811330547, -0.3632690509087489, -0.17842622149581894, 0.17956778310813915, 0.11214070990596206, 0.09326828406790459, -0.0262635730718553, -0.25619763360196435, 0.11792475438127807, -0.1234096193626318, -0.06164488269960285, -0.08621709812389806, 0.010084570119893173, 0.027759216566689723, -0.3522208246761301, 0.07090598352692931, 0.11207301694597545, 0.029133004476017226, -0.040480866190900494, -0.18758540941239976, 0.03341269339627048, 0.07312566268262069, 0.03775824019001848, 0.08052320991762392, 0.07852133686244146, -0.09494222412975249, -0.0919725678785311, 0.333405990220837, -0.05036667396246088, -0.25024814937058665, 0.16540031429538246, -0.12172705746349802, -0.136083693553292, 0.13368965839163974, 0.2018891444735212, 0.14477657365518967, -0.1289198125484015, 0.08102626536509296, -0.11492851281932709, 0.14502559391858585, 0.04526301378698234, 0.02944559631484706, 0.1242665457670094, 0.13613413069119523, 0.13023094022876172, 0.15820515588558184, -0.053886325962610816, -0.07664249630948237, -0.32265983203131227, -0.08665894708941144, -0.28175184218460747, 0.03143072103417464, -0.14717342590856036, -0.18358141386138122, 0.3587509324334118, 0.11957473818473346, 0.25005992481895134, 0.15352474698458302, 0.3034852932788295, 0.10698290428349913, 0.030600408195740107, 0.12044982302030377, 0.17115236923911337, 0.11311701383898803, -0.0008069938540014378, -0.16306833165949808, 0.13265992869855836, 0.0341300370551885] |
1,803.03242 | Probably Approximately Metric-Fair Learning | The seminal work of Dwork {\em et al.} [ITCS 2012] introduced a metric-based
notion of individual fairness. Given a task-specific similarity metric, their
notion required that every pair of similar individuals should be treated
similarly. In the context of machine learning, however, individual fairness
does not generalize from a training set to the underlying population. We show
that this can lead to computational intractability even for simple
fair-learning tasks.
With this motivation in mind, we introduce and study a relaxed notion of {\em
approximate metric-fairness}: for a random pair of individuals sampled from the
population, with all but a small probability of error, if they are similar then
they should be treated similarly. We formalize the goal of achieving
approximate metric-fairness simultaneously with best-possible accuracy as
Probably Approximately Correct and Fair (PACF) Learning. We show that
approximate metric-fairness {\em does} generalize, and leverage these
generalization guarantees to construct polynomial-time PACF learning algorithms
for the classes of linear and logistic predictors.
| cs.LG cs.DS | the seminal work of dwork em et al itcs 2012 introduced a metricbased notion of individual fairness given a taskspecific similarity metric their notion required that every pair of similar individuals should be treated similarly in the context of machine learning however individual fairness does not generalize from a training set to the underlying population we show that this can lead to computational intractability even for simple fairlearning tasks with this motivation in mind we introduce and study a relaxed notion of em approximate metricfairness for a random pair of individuals sampled from the population with all but a small probability of error if they are similar then they should be treated similarly we formalize the goal of achieving approximate metricfairness simultaneously with bestpossible accuracy as probably approximately correct and fair pacf learning we show that approximate metricfairness em does generalize and leverage these generalization guarantees to construct polynomialtime pacf learning algorithms for the classes of linear and logistic predictors | [['the', 'seminal', 'work', 'of', 'dwork', 'em', 'et', 'al', 'itcs', '2012', 'introduced', 'a', 'metricbased', 'notion', 'of', 'individual', 'fairness', 'given', 'a', 'taskspecific', 'similarity', 'metric', 'their', 'notion', 'required', 'that', 'every', 'pair', 'of', 'similar', 'individuals', 'should', 'be', 'treated', 'similarly', 'in', 'the', 'context', 'of', 'machine', 'learning', 'however', 'individual', 'fairness', 'does', 'not', 'generalize', 'from', 'a', 'training', 'set', 'to', 'the', 'underlying', 'population', 'we', 'show', 'that', 'this', 'can', 'lead', 'to', 'computational', 'intractability', 'even', 'for', 'simple', 'fairlearning', 'tasks', 'with', 'this', 'motivation', 'in', 'mind', 'we', 'introduce', 'and', 'study', 'a', 'relaxed', 'notion', 'of', 'em', 'approximate', 'metricfairness', 'for', 'a', 'random', 'pair', 'of', 'individuals', 'sampled', 'from', 'the', 'population', 'with', 'all', 'but', 'a', 'small', 'probability', 'of', 'error', 'if', 'they', 'are', 'similar', 'then', 'they', 'should', 'be', 'treated', 'similarly', 'we', 'formalize', 'the', 'goal', 'of', 'achieving', 'approximate', 'metricfairness', 'simultaneously', 'with', 'bestpossible', 'accuracy', 'as', 'probably', 'approximately', 'correct', 'and', 'fair', 'pacf', 'learning', 'we', 'show', 'that', 'approximate', 'metricfairness', 'em', 'does', 'generalize', 'and', 'leverage', 'these', 'generalization', 'guarantees', 'to', 'construct', 'polynomialtime', 'pacf', 'learning', 'algorithms', 'for', 'the', 'classes', 'of', 'linear', 'and', 'logistic', 'predictors']] | [-0.06315847427427546, 0.04950463577794532, -0.08116321074747064, 0.12247880597751874, -0.12139770043018104, -0.172510037468102, 0.09888705734819549, 0.3973511611375044, -0.2766801922585019, -0.3309497179217496, 0.02103212286949556, -0.22785162587163957, -0.17609820060458314, 0.13946104505386367, -0.18482451235770053, 0.07141908937362286, 0.08081055313067616, 0.05159061903766585, -0.04090009270083604, -0.31497670917291454, 0.2841356781416766, 0.06241251051472793, 0.27085083110386843, -0.013130639483507886, 0.11348275570843205, 0.026032809865127945, -0.04309482300806346, 0.07253709008679989, -0.1089519479076518, 0.14088660129089695, 0.3131487632006313, 0.21481009549022, 0.362059510916284, -0.3654579930031253, -0.16326233249233812, 0.1829502464421445, 0.12525878256880943, 0.1231545392912959, -0.00691606888310316, -0.26014212088999134, 0.1189893379546819, -0.17125473733194782, -0.07685934591587375, -0.10610901417046692, -0.03344319077536651, 0.035024020569721155, -0.2919375954998317, 0.042245652889774284, 0.13115290759728765, 0.022136080413108616, -0.02415946196565557, -0.11493145171904338, 0.017356160219829036, 0.10436571062302345, 0.022474930585075006, 0.04503383837587569, 0.08681894052823502, -0.10306561703401261, -0.16061251667919774, 0.35848506921375134, -0.030543917954061767, -0.19728028889066018, 0.1974258914812462, -0.06760853608636735, -0.1729684623628972, 0.06277295945903415, 0.20141045131088006, 0.10795462796898009, -0.15075812317173248, 0.05741292258004113, -0.09779575889133527, 0.14422856655803584, 0.08719476839855501, 0.025449484913264337, 0.1354767465802882, 0.11550208152441671, 0.07280573380361281, 0.10688914837749125, -0.007957289831525405, -0.07902717032014399, -0.2563332134986636, -0.1358715346487204, -0.18125333773402744, 0.0593946578886994, -0.07379084447678472, -0.16926311971817412, 0.34754398243162055, 0.16247084737116904, 0.20974524548780993, 0.18046892655474492, 0.25009395073331986, 0.06425684003268131, 0.03583096195987584, 0.1561869641139213, 0.21269481077807834, 0.07240567430883131, 0.04659024553092302, -0.1664624282652395, 0.12563042351741743, 0.0672250853576141] |
1,803.03243 | Domain Adaptive Faster R-CNN for Object Detection in the Wild | Object detection typically assumes that training and test data are drawn from
an identical distribution, which, however, does not always hold in practice.
Such a distribution mismatch will lead to a significant performance drop. In
this work, we aim to improve the cross-domain robustness of object detection.
We tackle the domain shift on two levels: 1) the image-level shift, such as
image style, illumination, etc, and 2) the instance-level shift, such as object
appearance, size, etc. We build our approach based on the recent
state-of-the-art Faster R-CNN model, and design two domain adaptation
components, on image level and instance level, to reduce the domain
discrepancy. The two domain adaptation components are based on H-divergence
theory, and are implemented by learning a domain classifier in adversarial
training manner. The domain classifiers on different levels are further
reinforced with a consistency regularization to learn a domain-invariant region
proposal network (RPN) in the Faster R-CNN model. We evaluate our newly
proposed approach using multiple datasets including Cityscapes, KITTI, SIM10K,
etc. The results demonstrate the effectiveness of our proposed approach for
robust object detection in various domain shift scenarios.
| cs.CV | object detection typically assumes that training and test data are drawn from an identical distribution which however does not always hold in practice such a distribution mismatch will lead to a significant performance drop in this work we aim to improve the crossdomain robustness of object detection we tackle the domain shift on two levels 1 the imagelevel shift such as image style illumination etc and 2 the instancelevel shift such as object appearance size etc we build our approach based on the recent stateoftheart faster rcnn model and design two domain adaptation components on image level and instance level to reduce the domain discrepancy the two domain adaptation components are based on hdivergence theory and are implemented by learning a domain classifier in adversarial training manner the domain classifiers on different levels are further reinforced with a consistency regularization to learn a domaininvariant region proposal network rpn in the faster rcnn model we evaluate our newly proposed approach using multiple datasets including cityscapes kitti sim10k etc the results demonstrate the effectiveness of our proposed approach for robust object detection in various domain shift scenarios | [['object', 'detection', 'typically', 'assumes', 'that', 'training', 'and', 'test', 'data', 'are', 'drawn', 'from', 'an', 'identical', 'distribution', 'which', 'however', 'does', 'not', 'always', 'hold', 'in', 'practice', 'such', 'a', 'distribution', 'mismatch', 'will', 'lead', 'to', 'a', 'significant', 'performance', 'drop', 'in', 'this', 'work', 'we', 'aim', 'to', 'improve', 'the', 'crossdomain', 'robustness', 'of', 'object', 'detection', 'we', 'tackle', 'the', 'domain', 'shift', 'on', 'two', 'levels', '1', 'the', 'imagelevel', 'shift', 'such', 'as', 'image', 'style', 'illumination', 'etc', 'and', '2', 'the', 'instancelevel', 'shift', 'such', 'as', 'object', 'appearance', 'size', 'etc', 'we', 'build', 'our', 'approach', 'based', 'on', 'the', 'recent', 'stateoftheart', 'faster', 'rcnn', 'model', 'and', 'design', 'two', 'domain', 'adaptation', 'components', 'on', 'image', 'level', 'and', 'instance', 'level', 'to', 'reduce', 'the', 'domain', 'discrepancy', 'the', 'two', 'domain', 'adaptation', 'components', 'are', 'based', 'on', 'hdivergence', 'theory', 'and', 'are', 'implemented', 'by', 'learning', 'a', 'domain', 'classifier', 'in', 'adversarial', 'training', 'manner', 'the', 'domain', 'classifiers', 'on', 'different', 'levels', 'are', 'further', 'reinforced', 'with', 'a', 'consistency', 'regularization', 'to', 'learn', 'a', 'domaininvariant', 'region', 'proposal', 'network', 'rpn', 'in', 'the', 'faster', 'rcnn', 'model', 'we', 'evaluate', 'our', 'newly', 'proposed', 'approach', 'using', 'multiple', 'datasets', 'including', 'cityscapes', 'kitti', 'sim10k', 'etc', 'the', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'approach', 'for', 'robust', 'object', 'detection', 'in', 'various', 'domain', 'shift', 'scenarios']] | [-0.02808148935867433, -0.009455944805544594, -0.060399961011707706, 0.045726996304280045, -0.11430884502149875, -0.15048181323041004, 0.039406423393064986, 0.4719036002744637, -0.21773641038200128, -0.3512740737060085, 0.10422265833767597, -0.25543211472635763, -0.17298228966841556, 0.18359499834387744, -0.16895387483315932, 0.07535702225805321, 0.12987707196431153, 0.027582727634580806, -0.05371912713899687, -0.2679326858293359, 0.3295131969852778, 0.0009417677014742209, 0.398620641795392, 0.04128360739433328, 0.11575716091054188, -0.04811256590334739, -0.023887738815297464, -0.010991706614731811, -0.022383551719624094, 0.15078716991600863, 0.26404800337268564, 0.18792797028507505, 0.2828445566043703, -0.39687210965190467, -0.24360027417550673, 0.07789543763805262, 0.14312856821545764, 0.10616718052701997, -0.058249177094219944, -0.37030290860212, 0.09508809584709209, -0.18504701192875433, 0.02068556934018093, -0.11646069109986495, -0.030815351927408894, -0.03160141524922042, -0.28751230902170116, 0.02259515736596254, 0.11126513994658245, 0.04225652016517099, -0.07152896128979552, -0.13583025171132962, 0.05216268651027982, 0.16076696587918812, 0.03500272315874969, 0.08487913230308787, 0.16519199831647868, -0.1849719895446232, -0.14771849665861658, 0.3354453073749107, -0.08501870202219478, -0.24516229170030387, 0.23824755189106445, -0.05822911224095151, -0.13051659959297546, 0.07564731370202145, 0.23494611172835625, 0.14486240847896703, -0.11002376150977596, -0.002451981505462596, -0.012826684796575295, 0.19976900166163788, 0.08045922068286808, -0.023643111705061292, 0.1626300836024988, 0.2550745914366258, 0.05051093865064183, 0.15086339622275377, -0.18785004429493868, -0.07175626070618266, -0.2516674382600088, -0.0749986445247803, -0.21346814999782035, -0.07456001549895597, -0.09209686077322302, -0.13350962558054205, 0.4088797747947114, 0.2593423894950715, 0.24398364918179932, 0.09321111749285711, 0.35258957167641947, 0.018660092667509478, 0.1085705311719642, 0.06088174417242914, 0.19901570835171026, -0.025189081357814797, 0.09530570320835662, -0.19178392318376017, 0.06925588432742465, 0.05289516289232542] |
1,803.03244 | Time-dependent i-DFT exchange-correlation potentials with memory:
Applications to the out-of-equilibrium Anderson model | We have recently put forward a steady-state density functional theory (i-DFT)
to calculate the transport coefficients of quantum junctions. Within i-DFT it
is possible to obtain the steady density on and the steady current through an
interacting junction using a fictitious noninteracting junction subject to an
effective gate and bias potential. In this work we extend i-DFT to the time
domain for the single-impurity Anderson model. By a reverse engineering
procedure we extract the exchange-correlation (xc) potential and xc bias at
temperatures above the Kondo temperature $T_{\rm K}$. The derivation is based
on a generalization of a recent paper by Dittmann et al. [arXiv:1706.04547].
Interestingly the time-dependent (TD) i-DFT potentials depend on the system's
history only through the first time-derivative of the density. We perform
numerical simulations of the early transient current and investigate the role
of the history dependence. We also empirically extend the history-dependent TD
i-DFT potentials to temperatures below $T_{\rm K}$. For this purpose we use a
recently proposed parametrization of the i-DFT potentials which yields highly
accurate results in the steady state.
| cond-mat.mes-hall | we have recently put forward a steadystate density functional theory idft to calculate the transport coefficients of quantum junctions within idft it is possible to obtain the steady density on and the steady current through an interacting junction using a fictitious noninteracting junction subject to an effective gate and bias potential in this work we extend idft to the time domain for the singleimpurity anderson model by a reverse engineering procedure we extract the exchangecorrelation xc potential and xc bias at temperatures above the kondo temperature t_rm k the derivation is based on a generalization of a recent paper by dittmann et al arxiv170604547 interestingly the timedependent td idft potentials depend on the systems history only through the first timederivative of the density we perform numerical simulations of the early transient current and investigate the role of the history dependence we also empirically extend the historydependent td idft potentials to temperatures below t_rm k for this purpose we use a recently proposed parametrization of the idft potentials which yields highly accurate results in the steady state | [['we', 'have', 'recently', 'put', 'forward', 'a', 'steadystate', 'density', 'functional', 'theory', 'idft', 'to', 'calculate', 'the', 'transport', 'coefficients', 'of', 'quantum', 'junctions', 'within', 'idft', 'it', 'is', 'possible', 'to', 'obtain', 'the', 'steady', 'density', 'on', 'and', 'the', 'steady', 'current', 'through', 'an', 'interacting', 'junction', 'using', 'a', 'fictitious', 'noninteracting', 'junction', 'subject', 'to', 'an', 'effective', 'gate', 'and', 'bias', 'potential', 'in', 'this', 'work', 'we', 'extend', 'idft', 'to', 'the', 'time', 'domain', 'for', 'the', 'singleimpurity', 'anderson', 'model', 'by', 'a', 'reverse', 'engineering', 'procedure', 'we', 'extract', 'the', 'exchangecorrelation', 'xc', 'potential', 'and', 'xc', 'bias', 'at', 'temperatures', 'above', 'the', 'kondo', 'temperature', 't_rm', 'k', 'the', 'derivation', 'is', 'based', 'on', 'a', 'generalization', 'of', 'a', 'recent', 'paper', 'by', 'dittmann', 'et', 'al', 'arxiv170604547', 'interestingly', 'the', 'timedependent', 'td', 'idft', 'potentials', 'depend', 'on', 'the', 'systems', 'history', 'only', 'through', 'the', 'first', 'timederivative', 'of', 'the', 'density', 'we', 'perform', 'numerical', 'simulations', 'of', 'the', 'early', 'transient', 'current', 'and', 'investigate', 'the', 'role', 'of', 'the', 'history', 'dependence', 'we', 'also', 'empirically', 'extend', 'the', 'historydependent', 'td', 'idft', 'potentials', 'to', 'temperatures', 'below', 't_rm', 'k', 'for', 'this', 'purpose', 'we', 'use', 'a', 'recently', 'proposed', 'parametrization', 'of', 'the', 'idft', 'potentials', 'which', 'yields', 'highly', 'accurate', 'results', 'in', 'the', 'steady', 'state']] | [-0.1024020186013409, 0.07288104852811167, -0.12514670161530375, 0.04081027330564601, -0.016918881854840688, -0.11828130925207266, 0.09150815815598305, 0.3501622015410768, -0.2272375613317958, -0.2716951801428305, 0.02069536534670208, -0.2573743248624461, -0.13565781552876746, 0.1765648301038891, 0.014395372749173215, 0.055749547335186174, -0.01599404760237251, 0.0025136493405859385, -0.10981405908807314, -0.22751947068343206, 0.2873202102870813, 0.08299101733935199, 0.2774427505050387, 0.09940011212070074, 0.06458196749777666, 0.007149741149374417, 0.04116624444989221, 0.015986807301108328, -0.2052896949036845, 0.05113080609456769, 0.20609055651484856, 0.012530968756015812, 0.26418061035951335, -0.4614844179153442, -0.262654730666961, 0.053844254969486166, 0.1025207227521709, 0.1651471078735111, -0.04895705906408174, -0.2628642265684903, 0.0407011280907318, -0.18664274592218655, -0.11883244503555554, -0.11121210510177272, 0.06336545902969581, 0.034359840559107915, -0.2674531231487968, 0.13451017160667106, 0.026346681444639607, 0.0068516453013788645, -0.0722695562536163, -0.10679064771360053, 0.004171819416806102, 0.06241372925295894, -0.00942578822640436, 0.061768656138862885, 0.15509953660092182, -0.10277728318369814, -0.07740927201296602, 0.2940933629285012, -0.11684548740674343, -0.14683257057331503, 0.2013130161818117, -0.10948986440231757, -0.11462604566876378, 0.0798053910636476, 0.14026242863652963, 0.14061530035853917, -0.19309218013393029, 0.1424725662531065, -0.0020509667155732, 0.14483452944218048, 0.022493595664522477, -0.024103920872190168, 0.19149830562727793, 0.17160323976938213, 0.051811324330712005, 0.11433904884516129, -0.09157405474489289, -0.12281052241567522, -0.2805982479293432, -0.12580054819109915, -0.20290848073416523, 0.05510152145155839, -0.04343555631881048, -0.17365169104986958, 0.43827428942280156, 0.22202916125101702, 0.20394789429115398, 0.031857538768090304, 0.2690529882921172, 0.1901373157863106, 0.012460927619997944, 0.08637487455271184, 0.21621136876521632, 0.1901617378289146, 0.1058300344033965, -0.29778916017085844, 0.046207193171139804, 0.061765851128314224] |
1,803.03245 | The EDGES 21 cm Anomaly and Properties of Dark Matter | The recently claimed anomaly in the measurement of the 21 cm hydrogen
absorption signal by EDGES at $z\sim 17$, if cosmological, requires the
existence of new physics. The possible attempts to resolve the anomaly rely on
either (i) cooling the hydrogen gas via new dark matter-hydrogen interactions
or (ii) modifying the soft photon background beyond the standard CMB one, as
possibly suggested also by the ARCADE~2 excess. We argue that solutions
belonging to the first class are generally in tension with cosmological dark
matter probes once simple dark sector models are considered. Therefore, we
propose soft photon emission by light dark matter as a natural solution to the
21 cm anomaly, studying a few realizations of this scenario. We find that the
signal singles out a photophilic dark matter candidate characterised by an
enhanced collective decay mechanism, such as axion mini-clusters.
| hep-ph astro-ph.HE | the recently claimed anomaly in the measurement of the 21 cm hydrogen absorption signal by edges at zsim 17 if cosmological requires the existence of new physics the possible attempts to resolve the anomaly rely on either i cooling the hydrogen gas via new dark matterhydrogen interactions or ii modifying the soft photon background beyond the standard cmb one as possibly suggested also by the arcade2 excess we argue that solutions belonging to the first class are generally in tension with cosmological dark matter probes once simple dark sector models are considered therefore we propose soft photon emission by light dark matter as a natural solution to the 21 cm anomaly studying a few realizations of this scenario we find that the signal singles out a photophilic dark matter candidate characterised by an enhanced collective decay mechanism such as axion miniclusters | [['the', 'recently', 'claimed', 'anomaly', 'in', 'the', 'measurement', 'of', 'the', '21', 'cm', 'hydrogen', 'absorption', 'signal', 'by', 'edges', 'at', 'zsim', '17', 'if', 'cosmological', 'requires', 'the', 'existence', 'of', 'new', 'physics', 'the', 'possible', 'attempts', 'to', 'resolve', 'the', 'anomaly', 'rely', 'on', 'either', 'i', 'cooling', 'the', 'hydrogen', 'gas', 'via', 'new', 'dark', 'matterhydrogen', 'interactions', 'or', 'ii', 'modifying', 'the', 'soft', 'photon', 'background', 'beyond', 'the', 'standard', 'cmb', 'one', 'as', 'possibly', 'suggested', 'also', 'by', 'the', 'arcade2', 'excess', 'we', 'argue', 'that', 'solutions', 'belonging', 'to', 'the', 'first', 'class', 'are', 'generally', 'in', 'tension', 'with', 'cosmological', 'dark', 'matter', 'probes', 'once', 'simple', 'dark', 'sector', 'models', 'are', 'considered', 'therefore', 'we', 'propose', 'soft', 'photon', 'emission', 'by', 'light', 'dark', 'matter', 'as', 'a', 'natural', 'solution', 'to', 'the', '21', 'cm', 'anomaly', 'studying', 'a', 'few', 'realizations', 'of', 'this', 'scenario', 'we', 'find', 'that', 'the', 'signal', 'singles', 'out', 'a', 'photophilic', 'dark', 'matter', 'candidate', 'characterised', 'by', 'an', 'enhanced', 'collective', 'decay', 'mechanism', 'such', 'as', 'axion', 'miniclusters']] | [-0.0932938974998094, 0.15199002921139476, -0.06283844142512371, 0.11956370269742346, -0.10261163304445983, -0.15042675226229987, 0.029506592207300147, 0.31517015382808317, -0.23043729985223266, -0.3781228257383374, 0.06603389873383768, -0.2819018952427901, -0.06737158834270919, 0.12334365029350298, 0.04206194509852597, 0.011642942895188177, -0.03512002908618009, -0.0019140123396361474, -0.011006534319113866, -0.2225381229441318, 0.31879582161773934, 0.09829787406802391, 0.1976453989556582, 0.04630489729465448, 0.07625326933339238, -0.04695969851848354, -0.07953854605702938, -0.02763434427140428, -0.11736597712438557, 0.037321169632855505, 0.1951069204523716, 0.10587596321116677, 0.1743481887903118, -0.4138080872957119, -0.26579538579333384, 0.1898198058399901, 0.15980083290688532, 0.12687794847762307, -0.11139559014465847, -0.29746299143880606, 0.025490818833329265, -0.19259612096084966, -0.13843356677927346, -0.027016495068041647, -0.008805641184205846, -0.05069580875343824, -0.21862138458192618, 0.12674744606998803, -0.012218972889994599, -0.05465413252789554, -0.04140330693791721, -0.09232073253114446, 0.017683539087314615, -0.02153431524509202, 0.08329073951718659, 0.0015302238727939858, 0.20826190081927523, -0.19208657436521737, -0.11831814484844963, 0.4266966033539326, -0.16055947014217753, -0.09488049772628349, 0.19138685865126712, -0.13333669348063765, -0.19187566419902571, 0.18324142755444744, 0.08465386123223509, 0.06394288080188332, -0.16408708723757764, 0.07682671843485224, -0.03652206420389225, 0.19487208181744267, 0.07351769509653246, 0.051748349701503306, 0.3706270535845015, 0.14564777950575347, 0.04394477738482918, 0.06054780258822863, -0.128010135958065, -0.01596520160427049, -0.3466528352658204, -0.1201729968511801, -0.13587188090887858, 0.05762827875998822, -0.05589802764865349, -0.11168490424283224, 0.326048638152374, 0.11121239718183767, 0.2101917853980935, -0.021554558535387888, 0.29849266081298, 0.07339349625005702, 0.0691899152459215, 0.0397252565454051, 0.36218077049543745, 0.12047885517294941, 0.09474080471027134, -0.2113999919178594, -0.01059790723287105, 0.006373716695837194] |
1,803.03246 | Dual loop quantizations of 3d gravity | The loop quantization of 3d gravity consists in defining the Hilbert space of
states satisfying the Gau{\ss} constraint and the flatness constraint. The
Gau{\ss} constraint is enforced at the kinematical level by introducing spin
networks which form a basis for the Hilbert space of gauge invariant
functionals. The flatness constraint is implemented at the dynamical level via
the Ponzano-Regge state-sum model. We propose in this work a dual loop
quantization scheme where the role of the constraints is exchanged. The
flatness constraint is imposed first via the introduction of a new basis
labeled by group variables, while the Gau{\ss} constraint is implemented
dynamically using a projector which is related to the Dijkgraaf-Witten model.
We discuss how this alternative quantization program is related to 3d
teleparallel gravity.
| gr-qc | the loop quantization of 3d gravity consists in defining the hilbert space of states satisfying the gauss constraint and the flatness constraint the gauss constraint is enforced at the kinematical level by introducing spin networks which form a basis for the hilbert space of gauge invariant functionals the flatness constraint is implemented at the dynamical level via the ponzanoregge statesum model we propose in this work a dual loop quantization scheme where the role of the constraints is exchanged the flatness constraint is imposed first via the introduction of a new basis labeled by group variables while the gauss constraint is implemented dynamically using a projector which is related to the dijkgraafwitten model we discuss how this alternative quantization program is related to 3d teleparallel gravity | [['the', 'loop', 'quantization', 'of', '3d', 'gravity', 'consists', 'in', 'defining', 'the', 'hilbert', 'space', 'of', 'states', 'satisfying', 'the', 'gauss', 'constraint', 'and', 'the', 'flatness', 'constraint', 'the', 'gauss', 'constraint', 'is', 'enforced', 'at', 'the', 'kinematical', 'level', 'by', 'introducing', 'spin', 'networks', 'which', 'form', 'a', 'basis', 'for', 'the', 'hilbert', 'space', 'of', 'gauge', 'invariant', 'functionals', 'the', 'flatness', 'constraint', 'is', 'implemented', 'at', 'the', 'dynamical', 'level', 'via', 'the', 'ponzanoregge', 'statesum', 'model', 'we', 'propose', 'in', 'this', 'work', 'a', 'dual', 'loop', 'quantization', 'scheme', 'where', 'the', 'role', 'of', 'the', 'constraints', 'is', 'exchanged', 'the', 'flatness', 'constraint', 'is', 'imposed', 'first', 'via', 'the', 'introduction', 'of', 'a', 'new', 'basis', 'labeled', 'by', 'group', 'variables', 'while', 'the', 'gauss', 'constraint', 'is', 'implemented', 'dynamically', 'using', 'a', 'projector', 'which', 'is', 'related', 'to', 'the', 'dijkgraafwitten', 'model', 'we', 'discuss', 'how', 'this', 'alternative', 'quantization', 'program', 'is', 'related', 'to', '3d', 'teleparallel', 'gravity']] | [-0.19042250917234, 0.11089116727401103, -0.11544063076051692, 0.0786418374193581, -0.12591656098245746, -0.13657544799877094, 0.0034466979670382683, 0.28038844989524003, -0.28811207287649193, -0.29886711501176394, 0.10187968920495007, -0.16993320654220287, -0.1367566766779101, 0.10548879075721497, -0.06826437170070315, 0.053837806149016294, 0.016345334322457866, 0.0611544396314356, -0.14417054844024177, -0.2514387798756139, 0.4038137153681693, 0.1005731591999176, 0.273715386255866, 0.013831496637846743, 0.16196432724476806, 0.015636481577530503, -0.004239329824312812, 0.010561443731791176, -0.10174152674892592, 0.1478857046879259, 0.18247745077990526, 0.11710930175872312, 0.2325456227944602, -0.4141658565827778, -0.2301144748519633, 0.0634686725827614, 0.09387027615374545, 0.0677681395909675, -0.015520229218675503, -0.29169678408282973, 0.03746818309088075, -0.1293646342801078, -0.0884158781790618, -0.08620661050672569, -0.048844460028386306, -0.08865212964028904, -0.27807866957127336, 0.0544684578420683, 0.03861611400290193, 0.033368354020196764, -0.046339494339975765, -0.05865393695791089, -0.049106832290630016, 0.06317507369547254, 0.01725038230818297, 0.09679394864176015, 0.12153441136673329, -0.11856647603221178, -0.08536556620697772, 0.4195664614838149, -0.06226543109634861, -0.29870493792825276, 0.08197381866667124, -0.09012657712169346, -0.1840912544608323, 0.06907191260584764, 0.10343069682962128, 0.11537950215417714, -0.15746420247125484, 0.19141894105834784, -0.03753865668402305, 0.11750043798533696, 0.062232774408859395, 0.04610664880878869, 0.23402260376199607, 0.13733439713657375, 0.07958516417559058, 0.16611885045108105, -0.06391801033169031, -0.12867588926077125, -0.4108014396938776, -0.1792052535354973, -0.1641768545710615, 0.03214939474128187, -0.0842939636535852, -0.11620401761065872, 0.39972346358560557, 0.11449493307413326, 0.16391145469739088, 0.07572771334572093, 0.2901594104274871, 0.18400265790876888, 0.10640102166392368, 0.044377413722464724, 0.20024815653376873, 0.16888594411919633, 0.03371044592229679, -0.24125859444768774, -0.026223166790072038, 0.1699041338038764] |
1,803.03247 | Pair creation in electric fields, anomalies, and renormalization of the
electric current | We investigate the Schwinger pair production phenomena in spatially
homogeneous strong electric fields. We first consider scalar QED in
four-dimensions and discuss the potential ambiguity in the adiabatic order
assignment for the electromagnetic potential required to fix the
renormalization subtractions. We argue that this ambiguity can be solved by
invoking the conformal anomaly when both electric and gravitational backgrounds
are present. We also extend the adiabatic regularization method for spinor QED
in two-dimensions and find consistency with the chiral anomaly. We focus on the
issue of the renormalization of the electric current $\langle j^\mu \rangle$
generated by the created pairs. We illustrate how to implement the
renormalization of the electric current for the Sauter pulse.
| hep-th | we investigate the schwinger pair production phenomena in spatially homogeneous strong electric fields we first consider scalar qed in fourdimensions and discuss the potential ambiguity in the adiabatic order assignment for the electromagnetic potential required to fix the renormalization subtractions we argue that this ambiguity can be solved by invoking the conformal anomaly when both electric and gravitational backgrounds are present we also extend the adiabatic regularization method for spinor qed in twodimensions and find consistency with the chiral anomaly we focus on the issue of the renormalization of the electric current langle jmu rangle generated by the created pairs we illustrate how to implement the renormalization of the electric current for the sauter pulse | [['we', 'investigate', 'the', 'schwinger', 'pair', 'production', 'phenomena', 'in', 'spatially', 'homogeneous', 'strong', 'electric', 'fields', 'we', 'first', 'consider', 'scalar', 'qed', 'in', 'fourdimensions', 'and', 'discuss', 'the', 'potential', 'ambiguity', 'in', 'the', 'adiabatic', 'order', 'assignment', 'for', 'the', 'electromagnetic', 'potential', 'required', 'to', 'fix', 'the', 'renormalization', 'subtractions', 'we', 'argue', 'that', 'this', 'ambiguity', 'can', 'be', 'solved', 'by', 'invoking', 'the', 'conformal', 'anomaly', 'when', 'both', 'electric', 'and', 'gravitational', 'backgrounds', 'are', 'present', 'we', 'also', 'extend', 'the', 'adiabatic', 'regularization', 'method', 'for', 'spinor', 'qed', 'in', 'twodimensions', 'and', 'find', 'consistency', 'with', 'the', 'chiral', 'anomaly', 'we', 'focus', 'on', 'the', 'issue', 'of', 'the', 'renormalization', 'of', 'the', 'electric', 'current', 'langle', 'jmu', 'rangle', 'generated', 'by', 'the', 'created', 'pairs', 'we', 'illustrate', 'how', 'to', 'implement', 'the', 'renormalization', 'of', 'the', 'electric', 'current', 'for', 'the', 'sauter', 'pulse']] | [-0.1731296628612377, 0.18027178742315458, -0.042820579302497205, 0.10238238756605626, -0.05705014682860802, -0.08297001510129674, 0.0013825769232505042, 0.39715743965428807, -0.2230060071279497, -0.2801439463333024, 0.02455333300471387, -0.24358243938413976, -0.1252678612733017, 0.12200796929714472, 0.019423983225841886, 0.04832259730800338, -0.020517038205719512, 0.04976682938716334, -0.0877714017406106, -0.2276298026351825, 0.36867871362634974, 0.0014100642631883207, 0.2791239123062595, 0.1340887562736221, 0.0725962245715377, 0.041905384615023175, -0.04229038576949793, 0.017130766671312893, -0.08494836084130879, 0.0598961071556677, 0.18349669229887103, 0.04869758405155786, 0.20137052690691273, -0.4515309910249451, -0.20238652355645015, 0.0980814067930307, 0.15025524086440387, 0.16260538018794488, -0.08437899644587837, -0.30338221526826203, 0.05991929773767681, -0.18542075960532478, -0.148873554530513, -0.14391848419833442, -0.023115467203214116, -0.02138022369016772, -0.28708925897093573, 0.08568367577719745, -0.012260764232917649, 0.005070150158691989, -0.053035730295612114, -0.056433152168503274, 0.030309082648676374, 0.06237471739523639, 0.10113248657738871, 0.05685534838020154, 0.13602519895395507, -0.18505670556434148, -0.14508397584963265, 0.38389537666478885, -0.131028715902737, -0.2232891050329351, 0.07912704633224918, -0.15173296736067404, -0.12931463485583664, 0.0440681147267637, 0.1301465650230808, 0.12338510816106978, -0.1596473849810022, 0.14977381622833807, 0.022461371237169143, 0.09201826662655271, 0.07048779119454, -0.0047028682073173315, 0.21577128705609103, 0.07276528736212007, 0.01838872303032195, 0.15868604690464133, -0.06282070622448531, -0.0672558281287227, -0.39495358110769935, -0.13694001673518316, -0.12696613116118977, 0.0761868502539785, -0.07090298889012521, -0.14149012081325055, 0.4030947418195074, 0.24257043355648183, 0.15008588414639235, -0.007873549267811619, 0.297023038290765, 0.17940185948416754, 0.06181347345751103, 0.08447470099300794, 0.29916677721168683, 0.139647981658092, 0.0953110454512922, -0.3337243363423192, -0.06949211736412152, 0.09023026513902511] |
1,803.03248 | Improved Distributed $\Delta$-Coloring | We present a randomized distributed algorithm that computes a
$\Delta$-coloring in any non-complete graph with maximum degree $\Delta \geq 4$
in $O(\log \Delta) + 2^{O(\sqrt{\log\log n})}$ rounds, as well as a randomized
algorithm that computes a $\Delta$-coloring in $O((\log \log n)^2)$ rounds when
$\Delta \in [3, O(1)]$. Both these algorithms improve on an $O(\log^3 n/\log
\Delta)$-round algorithm of Panconesi and Srinivasan~[STOC'1993], which has
remained the state of the art for the past 25 years. Moreover, the latter
algorithm gets (exponentially) closer to an $\Omega(\log\log n)$ round lower
bound of Brandt et al.~[STOC'16].
| cs.DS cs.DC | we present a randomized distributed algorithm that computes a deltacoloring in any noncomplete graph with maximum degree delta geq 4 in olog delta 2osqrtloglog n rounds as well as a randomized algorithm that computes a deltacoloring in olog log n2 rounds when delta in 3 o1 both these algorithms improve on an olog3 nlog deltaround algorithm of panconesi and srinivasanstoc1993 which has remained the state of the art for the past 25 years moreover the latter algorithm gets exponentially closer to an omegaloglog n round lower bound of brandt et alstoc16 | [['we', 'present', 'a', 'randomized', 'distributed', 'algorithm', 'that', 'computes', 'a', 'deltacoloring', 'in', 'any', 'noncomplete', 'graph', 'with', 'maximum', 'degree', 'delta', 'geq', '4', 'in', 'olog', 'delta', '2osqrtloglog', 'n', 'rounds', 'as', 'well', 'as', 'a', 'randomized', 'algorithm', 'that', 'computes', 'a', 'deltacoloring', 'in', 'olog', 'log', 'n2', 'rounds', 'when', 'delta', 'in', '3', 'o1', 'both', 'these', 'algorithms', 'improve', 'on', 'an', 'olog3', 'nlog', 'deltaround', 'algorithm', 'of', 'panconesi', 'and', 'srinivasanstoc1993', 'which', 'has', 'remained', 'the', 'state', 'of', 'the', 'art', 'for', 'the', 'past', '25', 'years', 'moreover', 'the', 'latter', 'algorithm', 'gets', 'exponentially', 'closer', 'to', 'an', 'omegaloglog', 'n', 'round', 'lower', 'bound', 'of', 'brandt', 'et', 'alstoc16']] | [-0.16617536765858112, 0.12138743279272889, -0.022045931700365933, 0.00407288841421852, 0.009265431255269586, -0.24532483619627324, 0.1415618668085362, 0.3551898012670238, -0.21825497774302624, -0.4200715608476253, 0.08203753924227497, -0.2924181641487593, -0.14528695747957387, 0.15170738374385354, -0.0992439336593399, 0.05204064404759347, 0.03474776923991321, 0.07426591997108098, -0.016132125510635337, -0.3937864750587732, 0.14673197972771365, 0.043510643634526586, 0.1563565488080651, 0.015390493415212363, 0.056826403008752996, 0.029508345697619273, 0.025441862564282807, -0.013705405197367909, -0.1509703647855766, 0.02524600305667754, 0.23856911592687782, 0.22398179580112187, 0.30443888375263534, -0.40829782761382255, -0.08315419736370612, 0.17877632939371835, 0.23833289486486883, 0.09234699414744764, 0.022906399037678507, -0.18877213810350787, 0.12969244981580774, -0.11248586313119498, -0.07916573038209607, 0.02057092335321051, 0.10494243724041441, -0.061230866929118555, -0.3286582079579991, -0.0007261862321704458, 0.0878348190041803, -0.02797794369248192, 0.044336820649129624, -0.20773566868993337, 0.06068219759585231, 0.056070935414395076, -0.07919826528078384, 0.20298310595282007, 0.0007144311924328965, -0.08374497505804795, -0.19181246876591043, 0.2691832647522849, -0.09288876865247495, -0.08074384833570947, 0.058039104764799725, -0.0834146791943506, -0.21769543256861776, 0.14639339437629775, 0.1537637777961372, 0.20422657483435247, 0.00466060865682869, 0.1880527345164093, -0.12192800695474228, 0.236592247943509, 0.12034917496186628, 0.015862561312368077, -0.05381323774920756, 0.1714491591490596, 0.19257863620400764, 0.08429948478058148, -0.004302413514135092, -0.0544898402353937, -0.2485041038625026, -0.1709416256360762, -0.22729412299905266, 0.06479917799928382, -0.23118809487110167, -0.1335256133605255, 0.30688246180502216, 0.06652308992643872, 0.25697965892241076, 0.19233348936475603, 0.31693874743212475, 0.04330348127961075, -0.0444306100017569, 0.2990658109421643, 0.13447166661459828, 0.06670094411192315, 0.044079316435957305, -0.19895064610506544, 0.11936430149355882, 0.12800242369006953] |
1,803.03249 | Computing the Nucleolus of Weighted Cooperative Matching Games in
Polynomial Time | We provide an efficient algorithm for computing the nucleolus for an instance
of a weighted cooperative matching game. This resolves a long-standing open
question posed in [Faigle, Kern, Fekete, Hochst\"{a}ttler, Mathematical
Programming, 1998].
| cs.GT | we provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game this resolves a longstanding open question posed in faigle kern fekete hochstattler mathematical programming 1998 | [['we', 'provide', 'an', 'efficient', 'algorithm', 'for', 'computing', 'the', 'nucleolus', 'for', 'an', 'instance', 'of', 'a', 'weighted', 'cooperative', 'matching', 'game', 'this', 'resolves', 'a', 'longstanding', 'open', 'question', 'posed', 'in', 'faigle', 'kern', 'fekete', 'hochstattler', 'mathematical', 'programming', '1998']] | [-0.14295530150588037, -0.04588116665113238, -0.0855357510348161, 0.1408986655790641, -0.09066045967241128, -0.19560684745595086, 0.09905257912804231, 0.33348678732573084, -0.32713777391296445, -0.31368773916708026, 0.09186476248556352, -0.22368978296942782, -0.1745925291977597, 0.16470417826238906, -0.20625071600079536, 0.08537261496354459, 0.0681258138537294, -0.05498257703341854, 0.08019406088825429, -0.28498404447666625, 0.2339649517724121, 0.04889355473940007, 0.18272322388083645, 0.1602608665936824, 0.10667459541141536, 0.07735751461267214, -0.012785684938232103, 0.0249502834243079, -0.230493063897346, 0.1712971105324951, 0.3407654261611628, 0.2828599908248042, 0.39082325498263043, -0.36075503491994104, -0.08736137968177597, 0.10803793884362235, 0.144131340933117, 0.08808229801555474, -0.08941618248707417, -0.2561326643282717, 0.05498705246965542, -0.09213687846380653, -0.11580220700213403, -0.011905048839804349, 0.0929129199322426, -0.12209835385543887, -0.3211039307555466, 0.005434542132372206, 0.08251327614363452, 0.06905234161990159, -0.07269077530751626, -0.15028041110120036, 0.20346513430051733, 0.11533863018407967, -0.11804082775206277, 0.11615239610105302, -0.0258323681597231, -0.0965144043209765, -0.2735489245617028, 0.37072765917489026, -0.0024463234638625927, -0.15345567058433185, 0.09872791711523225, 0.06008193376615192, -0.19234793384869894, 0.06333269367954045, 0.14446607469157738, 0.13076056976040656, -0.13723877783526073, 0.15168166459735596, -0.25028632231282466, 0.12125960233353192, 0.13948300133713268, -0.06968002309176055, 0.12769052729532687, 0.22003726164499918, 0.1434463383912137, 0.1332797957584262, 0.073792927785579, -0.1156967268184279, -0.16086026032765707, -0.1886564762416211, -0.1495029665247509, 0.0525530012691337, -0.07178327683923823, -0.24158028201341178, 0.3126129421377272, 0.10692175963159764, 0.12941796747459608, 0.10348134490689545, 0.2515927884960547, 0.12915773204330241, -0.12023544108325784, 0.2125580797966739, 0.11613429165586378, 0.14258758328629262, 0.13581210325443835, -0.2473424401021365, 0.01953183396747618, 0.13183529113391132] |
1,803.0325 | Twisted Fourier-Mukai partners of Enriques surfaces | Bridgeland and Maciocia showed that a complex Enriques surface X has no
Fourier-Mukai partners apart from itself: that is, if D^b(X) = D^b(Y) then X =
Y. We extend this to twisted Fourier-Mukai partners: if alpha is the
non-trivial element of Br(X) = Z/2 and D^b(X,alpha) = D^b(Y,beta), then X = Y
and beta is non-trivial. Our main tools are twisted topological K-theory and
twisted Mukai lattices.
| math.AG | bridgeland and maciocia showed that a complex enriques surface x has no fouriermukai partners apart from itself that is if dbx dby then x y we extend this to twisted fouriermukai partners if alpha is the nontrivial element of brx z2 and dbxalpha dbybeta then x y and beta is nontrivial our main tools are twisted topological ktheory and twisted mukai lattices | [['bridgeland', 'and', 'maciocia', 'showed', 'that', 'a', 'complex', 'enriques', 'surface', 'x', 'has', 'no', 'fouriermukai', 'partners', 'apart', 'from', 'itself', 'that', 'is', 'if', 'dbx', 'dby', 'then', 'x', 'y', 'we', 'extend', 'this', 'to', 'twisted', 'fouriermukai', 'partners', 'if', 'alpha', 'is', 'the', 'nontrivial', 'element', 'of', 'brx', 'z2', 'and', 'dbxalpha', 'dbybeta', 'then', 'x', 'y', 'and', 'beta', 'is', 'nontrivial', 'our', 'main', 'tools', 'are', 'twisted', 'topological', 'ktheory', 'and', 'twisted', 'mukai', 'lattices']] | [-0.17209966597147286, 0.1665306759105685, -0.15144332551086942, 0.1170343886090753, -0.10405583282311757, -0.24302938415203243, 0.032918929339696965, 0.4521834969520569, -0.3384744750956694, -0.14545767762465403, 0.06387595736887305, -0.2690936301689362, -0.17776799059162537, 0.16011215334001463, -0.17954803798347713, -0.04343093633651733, 0.029646957029278078, 0.042335605171198644, -0.12008151865641897, -0.3172557817151149, 0.4213998281940197, -0.11251691835544382, 0.21943500473474462, 0.08832355421521546, 0.07797020910462986, -0.007914189676133295, 0.04029594393602262, -0.09410694019558528, -0.14053799942412298, 0.11878870336028437, 0.25347725094761697, 0.0042880430972824495, 0.08549280986189842, -0.3091178926328818, -0.15043064523488284, 0.19061489433515816, 0.0767789605151241, -0.05260479214290778, -0.045895878217803936, -0.27882284425819914, 0.1842991202759246, -0.13737433915957808, -0.13340059899104137, -0.09539698764371375, 0.13162307349654537, 0.009818626753985881, -0.23593662467319518, -0.06969825193906824, 0.08787288029367725, 0.10429651620797813, -0.0010543682146817446, -0.14060831998164455, -0.2621780399194298, 0.07044681201223284, 0.07774524055809404, 0.15070090404866884, 0.09671539621582875, -0.08574301024200395, -0.0900964745786041, 0.32445196018864714, -0.053444100093717375, -0.18965015995005766, 0.1508385316779216, -0.17311028772188972, -0.1647983934575071, 0.16821897515716652, -0.02382983563778301, 0.16373113229249914, 0.049862403934821484, 0.26048082573882614, -0.16279767725306252, 0.17776667579310015, 0.09707828363558899, -0.05472168791457079, 0.14326781440371025, 0.05198314096002529, 0.0727432893589139, 0.08506574973774453, -0.009190224941509466, 0.020367831426362195, -0.3451781504477064, -0.2550427336245775, -0.08307690874983867, 0.23299541524611414, -0.020594625093508512, -0.11514131836593151, 0.3629406112867097, 0.007140365367134412, 0.17193322136687736, 0.03240947386560341, 0.2084634809133907, 0.01821842069621198, -0.031163578325261673, 0.006113036679259191, 0.10828535779534529, 0.23302838155068456, -0.015525638281057278, -0.12520081110997125, -0.08039444348930071, 0.2234667965831856] |
1,803.03251 | Dynamic Spike Super-resolution and Applications to Ultrafast Ultrasound
Imaging | We consider the dynamical super-resolution problem consisting in the recovery
of positions and velocities of moving particles from low-frequency static
measurements taken over multiple time steps. The standard approach to this
issue is a two-step process: first, at each time step some static
reconstruction method is applied to locate the positions of the particles with
super-resolution and, second, some tracking technique is applied to obtain the
velocities. In this paper we propose a fully dynamical method based on a
phase-space lifting of the positions and the velocities of the particles, which
are simultaneously reconstructed with super-resolution. We provide a rigorous
mathematical analysis of the recovery problem, both for the noiseless case and
in presence of noise (in the discrete setting). Several numerical simulations
illustrate and validate our method, which shows some advantage over existing
techniques. We then discuss the application of this approach to the dynamical
super-resolution problem in ultrafast ultrasound imaging: blood vessels'
locations and blood flow velocities are recovered with super-resolution.
| math.NA cs.IT math.IT | we consider the dynamical superresolution problem consisting in the recovery of positions and velocities of moving particles from lowfrequency static measurements taken over multiple time steps the standard approach to this issue is a twostep process first at each time step some static reconstruction method is applied to locate the positions of the particles with superresolution and second some tracking technique is applied to obtain the velocities in this paper we propose a fully dynamical method based on a phasespace lifting of the positions and the velocities of the particles which are simultaneously reconstructed with superresolution we provide a rigorous mathematical analysis of the recovery problem both for the noiseless case and in presence of noise in the discrete setting several numerical simulations illustrate and validate our method which shows some advantage over existing techniques we then discuss the application of this approach to the dynamical superresolution problem in ultrafast ultrasound imaging blood vessels locations and blood flow velocities are recovered with superresolution | [['we', 'consider', 'the', 'dynamical', 'superresolution', 'problem', 'consisting', 'in', 'the', 'recovery', 'of', 'positions', 'and', 'velocities', 'of', 'moving', 'particles', 'from', 'lowfrequency', 'static', 'measurements', 'taken', 'over', 'multiple', 'time', 'steps', 'the', 'standard', 'approach', 'to', 'this', 'issue', 'is', 'a', 'twostep', 'process', 'first', 'at', 'each', 'time', 'step', 'some', 'static', 'reconstruction', 'method', 'is', 'applied', 'to', 'locate', 'the', 'positions', 'of', 'the', 'particles', 'with', 'superresolution', 'and', 'second', 'some', 'tracking', 'technique', 'is', 'applied', 'to', 'obtain', 'the', 'velocities', 'in', 'this', 'paper', 'we', 'propose', 'a', 'fully', 'dynamical', 'method', 'based', 'on', 'a', 'phasespace', 'lifting', 'of', 'the', 'positions', 'and', 'the', 'velocities', 'of', 'the', 'particles', 'which', 'are', 'simultaneously', 'reconstructed', 'with', 'superresolution', 'we', 'provide', 'a', 'rigorous', 'mathematical', 'analysis', 'of', 'the', 'recovery', 'problem', 'both', 'for', 'the', 'noiseless', 'case', 'and', 'in', 'presence', 'of', 'noise', 'in', 'the', 'discrete', 'setting', 'several', 'numerical', 'simulations', 'illustrate', 'and', 'validate', 'our', 'method', 'which', 'shows', 'some', 'advantage', 'over', 'existing', 'techniques', 'we', 'then', 'discuss', 'the', 'application', 'of', 'this', 'approach', 'to', 'the', 'dynamical', 'superresolution', 'problem', 'in', 'ultrafast', 'ultrasound', 'imaging', 'blood', 'vessels', 'locations', 'and', 'blood', 'flow', 'velocities', 'are', 'recovered', 'with', 'superresolution']] | [-0.06829732373653928, 0.045437765152742116, -0.10826609579652, -0.008310491668698832, -0.026746092689869227, -0.10632040233856947, 0.023995244876800128, 0.40895886828928635, -0.2846918693840778, -0.28718197795968115, 0.11813071949844552, -0.24951193143722195, -0.15638362870128836, 0.19170450415759366, -0.07876332468736025, 0.09259774477329631, 0.08959693219398428, 0.025905435575076602, -0.05368905420301902, -0.21055821897719124, 0.2541983966884186, 0.0090287073115044, 0.2814958070696223, 0.008694898114293997, 0.14028149720944144, 0.021797076513293698, -0.06574062091738352, 0.03321678986761468, -0.11442696415544973, 0.11156780389351828, 0.24553896000243128, 0.10387190948726117, 0.29815056960618386, -0.4245323050035838, -0.2592346071168506, 0.0835732295537836, 0.16433807732423117, 0.17148211101738542, -0.08113653934703557, -0.32047604476787334, 0.07609759689240139, -0.08887028727863282, -0.1088255141216096, -0.07053849834126015, -0.05739535262773922, 0.008813914568649113, -0.280316788800335, 0.11209172430373956, 0.025752996028996604, 0.04697417912924765, -0.10270951474028314, -0.06172128997891684, 0.07618647126875178, 0.1527637333096365, 0.032902692990810355, -0.0052420643952452335, 0.1339740129187703, -0.10593274425846622, -0.10616885509307673, 0.404546503457555, -0.04046120242704209, -0.21892486824625473, 0.19727110635472084, -0.13720950609975796, -0.1312097534280202, 0.16260361041519447, 0.19871553283847548, 0.16459157017910955, -0.15867780151125616, 0.006917906588691921, -0.02600898085150616, 0.14459578044129753, 0.07544305940598615, -0.0028684957901392977, 0.14962509608301877, 0.1953164248161612, 0.06638721810608096, 0.14692148034377994, -0.2033002875978127, -0.06281218073827906, -0.27030735903175296, -0.13547480272620552, -0.17256346535640396, -0.024532532585824787, -0.07943367272664713, -0.14324769196586193, 0.4196799096817071, 0.2232432882101532, 0.2171910730664807, 0.07566317405831641, 0.38975108684571974, 0.08978167411648423, 0.0086382825921741, 0.03910171858497832, 0.20975468447485487, 0.12452270776216239, 0.12888900334146902, -0.2292032315121875, 0.0019958937952032118, 0.07965329039893312] |
1,803.03252 | Updated Global SMEFT Fit to Higgs, Diboson and Electroweak Data | The ATLAS and CMS collaborations have recently released significant new data
on Higgs and diboson production in LHC Run 2. Measurements of Higgs properties
have improved in many channels, while kinematic information for $h \to
\gamma\gamma$ and $h \to ZZ$ can now be more accurately incorporated in fits
using the STXS method, and $W^+ W^-$ diboson production at high $p_T$ gives new
sensitivity to deviations from the Standard Model. We have performed an updated
global fit to precision electroweak data, $W^+W^-$ measurements at LEP, and
Higgs and diboson data from Runs 1 and 2 of the LHC in the framework of the
Standard Model Effective Field Theory (SMEFT), allowing all coefficients to
vary across the combined dataset, and present the results in both the Warsaw
and SILH operator bases. We exhibit the improvement in the constraints on
operator coefficients provided by the LHC Run 2 data, and discuss the
correlations between them. We also explore the constraints our fit results
impose on several models of physics beyond the Standard Model, including models
that contribute to the operator coefficients at the tree level and stops in the
MSSM that contribute via loops.
| hep-ph hep-ex | the atlas and cms collaborations have recently released significant new data on higgs and diboson production in lhc run 2 measurements of higgs properties have improved in many channels while kinematic information for h to gammagamma and h to zz can now be more accurately incorporated in fits using the stxs method and w w diboson production at high p_t gives new sensitivity to deviations from the standard model we have performed an updated global fit to precision electroweak data ww measurements at lep and higgs and diboson data from runs 1 and 2 of the lhc in the framework of the standard model effective field theory smeft allowing all coefficients to vary across the combined dataset and present the results in both the warsaw and silh operator bases we exhibit the improvement in the constraints on operator coefficients provided by the lhc run 2 data and discuss the correlations between them we also explore the constraints our fit results impose on several models of physics beyond the standard model including models that contribute to the operator coefficients at the tree level and stops in the mssm that contribute via loops | [['the', 'atlas', 'and', 'cms', 'collaborations', 'have', 'recently', 'released', 'significant', 'new', 'data', 'on', 'higgs', 'and', 'diboson', 'production', 'in', 'lhc', 'run', '2', 'measurements', 'of', 'higgs', 'properties', 'have', 'improved', 'in', 'many', 'channels', 'while', 'kinematic', 'information', 'for', 'h', 'to', 'gammagamma', 'and', 'h', 'to', 'zz', 'can', 'now', 'be', 'more', 'accurately', 'incorporated', 'in', 'fits', 'using', 'the', 'stxs', 'method', 'and', 'w', 'w', 'diboson', 'production', 'at', 'high', 'p_t', 'gives', 'new', 'sensitivity', 'to', 'deviations', 'from', 'the', 'standard', 'model', 'we', 'have', 'performed', 'an', 'updated', 'global', 'fit', 'to', 'precision', 'electroweak', 'data', 'ww', 'measurements', 'at', 'lep', 'and', 'higgs', 'and', 'diboson', 'data', 'from', 'runs', '1', 'and', '2', 'of', 'the', 'lhc', 'in', 'the', 'framework', 'of', 'the', 'standard', 'model', 'effective', 'field', 'theory', 'smeft', 'allowing', 'all', 'coefficients', 'to', 'vary', 'across', 'the', 'combined', 'dataset', 'and', 'present', 'the', 'results', 'in', 'both', 'the', 'warsaw', 'and', 'silh', 'operator', 'bases', 'we', 'exhibit', 'the', 'improvement', 'in', 'the', 'constraints', 'on', 'operator', 'coefficients', 'provided', 'by', 'the', 'lhc', 'run', '2', 'data', 'and', 'discuss', 'the', 'correlations', 'between', 'them', 'we', 'also', 'explore', 'the', 'constraints', 'our', 'fit', 'results', 'impose', 'on', 'several', 'models', 'of', 'physics', 'beyond', 'the', 'standard', 'model', 'including', 'models', 'that', 'contribute', 'to', 'the', 'operator', 'coefficients', 'at', 'the', 'tree', 'level', 'and', 'stops', 'in', 'the', 'mssm', 'that', 'contribute', 'via', 'loops']] | [-0.0030945432409153957, 0.1458385294150886, -0.08465058202671476, 0.11445134822279215, -0.06306240130951138, -0.16789193906772293, 0.0362758804976597, 0.340642962898863, -0.24261292383613947, -0.33855957696704486, 0.06294322941746366, -0.3309447036688461, -0.00933270030164797, 0.20322185007389634, 0.03760951913795189, 0.10282234543640363, 0.14409439211319153, -0.0011715115464635585, -0.05342788592618155, -0.2965611216422219, 0.2572670203743895, 0.08255177676849264, 0.20296947275974642, 0.0865465382126307, 0.06330525729878757, 0.020278634121151346, -0.09440034675644711, -0.05123780991048797, -0.15528839349686965, 0.11456146645972407, 0.20327988220673623, 0.12340721027484458, 0.12087911051747045, -0.3934707725126492, -0.14434788861483533, 0.12056217132332293, 0.13028890955212868, 0.06981464444390056, -0.03498990275555498, -0.29973288941883336, 0.11949299513178534, -0.21053643375635148, -0.05846297737260006, -0.08586129146922183, -0.04607033115064137, -0.09770730424053525, -0.34576789968107874, 0.08610136418658505, -0.02559205763483126, 0.0740597410152029, -0.018274058352567648, -0.18312365900921193, -0.07906411037118616, 0.07276794304090896, 0.08681125373757248, 0.04034177392099273, 0.13758348596931777, -0.19875490034832374, -0.21146411058909603, 0.3411521849761668, -0.13022580018732696, -0.16949156360627202, 0.19520510330208038, -0.19633528356146263, -0.185830257622231, 0.10881044512957727, 0.2558345838793014, 0.018614204343114244, -0.16751814742915724, 0.18401158074021193, 0.004752874960142531, 0.14157454878226608, 0.029286113938953924, 0.039915961807128045, 0.16524345108038305, 0.1636805181440554, 0.020325644815181333, 0.0469772642888864, -0.10017567665582694, -0.05555632066618847, -0.39043871983885764, -0.09618072504863927, -0.0539409528504812, -0.03954936790427095, -0.07794251142377585, -0.047273041678004356, 0.40228937918222263, 0.1866064575948832, 0.29185895688194585, 0.033422166704488186, 0.2738236453874331, 0.08343317201054704, 0.12477930458875275, 0.05799222639884408, 0.3109206669571761, 0.10512986410727823, 0.1572396250968603, -0.17091555635101702, 0.02330961501666982, 0.03570201933678044] |
1,803.03253 | Projective Logarithmic Potentials | We study the projective logarithmic potential $G_\mu$ of a Probability
measure $\mu$ on the complex projective space ${P}^{n}$ equiped with the
Fubini-Study metric $\omega$. We prove that the Green operator $G $ has strong
regularizing properties.
It was shown by the second author that the range of the operator $G$ is
contained in the (local) domain of definition of the complex Monge-Amp\`ere
operator on $P^n$. This result extends earlier results by Carlehed.
We will show that the complex Monge-Amp\`ere measure of the logarithmic
potential of $\mu$ is absolutely continuous with respect to the Lebesgue
measure on $P^n$ if and only if the measure $\mu$ has no atoms.
Moreover when the measure $\mu$ has a "positive dimension", we give more
precise results on regularity properties of the potential $G_\mu$ in terms of
the dimension of $\mu$.
| math.CV | we study the projective logarithmic potential g_mu of a probability measure mu on the complex projective space pn equiped with the fubinistudy metric omega we prove that the green operator g has strong regularizing properties it was shown by the second author that the range of the operator g is contained in the local domain of definition of the complex mongeampere operator on pn this result extends earlier results by carlehed we will show that the complex mongeampere measure of the logarithmic potential of mu is absolutely continuous with respect to the lebesgue measure on pn if and only if the measure mu has no atoms moreover when the measure mu has a positive dimension we give more precise results on regularity properties of the potential g_mu in terms of the dimension of mu | [['we', 'study', 'the', 'projective', 'logarithmic', 'potential', 'g_mu', 'of', 'a', 'probability', 'measure', 'mu', 'on', 'the', 'complex', 'projective', 'space', 'pn', 'equiped', 'with', 'the', 'fubinistudy', 'metric', 'omega', 'we', 'prove', 'that', 'the', 'green', 'operator', 'g', 'has', 'strong', 'regularizing', 'properties', 'it', 'was', 'shown', 'by', 'the', 'second', 'author', 'that', 'the', 'range', 'of', 'the', 'operator', 'g', 'is', 'contained', 'in', 'the', 'local', 'domain', 'of', 'definition', 'of', 'the', 'complex', 'mongeampere', 'operator', 'on', 'pn', 'this', 'result', 'extends', 'earlier', 'results', 'by', 'carlehed', 'we', 'will', 'show', 'that', 'the', 'complex', 'mongeampere', 'measure', 'of', 'the', 'logarithmic', 'potential', 'of', 'mu', 'is', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', 'lebesgue', 'measure', 'on', 'pn', 'if', 'and', 'only', 'if', 'the', 'measure', 'mu', 'has', 'no', 'atoms', 'moreover', 'when', 'the', 'measure', 'mu', 'has', 'a', 'positive', 'dimension', 'we', 'give', 'more', 'precise', 'results', 'on', 'regularity', 'properties', 'of', 'the', 'potential', 'g_mu', 'in', 'terms', 'of', 'the', 'dimension', 'of', 'mu']] | [-0.15447578319747532, 0.05207466939814333, -0.09196575101170885, 0.04072379282083979, -0.06785682573235292, -0.09111977123508327, 0.01615440908730156, 0.3505471837461779, -0.24769138629877366, -0.17706457913294785, 0.059315241801489456, -0.30143134644661185, -0.14709236212354854, 0.1775233590777585, -0.09099443365392604, 0.03980191582743835, 0.038285602314775825, 0.11827240812879308, -0.07672980398506879, -0.24375485413693787, 0.4361107402299076, -0.009782737000194146, 0.2078131276245852, 0.10712081176067766, 0.10569991659779186, -0.019330597528137435, -0.03553158382331967, 0.001482116670962213, -0.18511470498886315, 0.12257850343095404, 0.16503155751559093, 0.09071459671083305, 0.250913941672534, -0.31046600055817825, -0.21463595494221813, 0.2148310710619995, 0.06617624734535366, -0.038780925566106475, -0.0057481322959424316, -0.31520295853173375, 0.15839954304571888, -0.10649799133994077, -0.184125225535853, -0.09782043153934769, 0.1058974678355052, 0.022055331013634577, -0.2752821027350269, 0.04341478148104161, 0.08970269603528698, 0.03348772275380622, -0.0587259864914266, -0.1099433161710438, -0.05128171382457914, 0.06910799736532565, 0.01865610836381863, 0.12127896172915326, 0.09309244003230915, -0.05820356204902711, -0.07985511617524955, 0.36376668122786104, -0.13811793630326488, -0.2673511204740411, 0.17370829416116826, -0.27380540962085914, -0.10024462371392358, 0.09732419253095873, 0.11672648979014807, 0.14435491699347258, -0.09965493189596791, 0.2395285494705221, -0.06597394831618644, 0.13440487808302828, 0.09312969444081523, 0.05169864853098288, 0.07259882174264219, 0.10907849036262167, 0.1905893269590193, 0.1064860153264065, -0.041540224483250676, -0.03710986297101455, -0.3320393187827186, -0.20799377625037854, -0.21192486524665938, 0.14313237924002728, -0.11845710436991658, -0.14102273919734284, 0.37758925083072337, 0.07055777686655074, 0.2176913155410859, 0.06321832855035991, 0.2540743485149136, 0.15864028162287927, 0.05382499621596355, 0.007030021917439045, 0.18634510038532598, 0.18190708078962184, 0.057270774953907595, -0.1986864271551402, 0.034863475008160436, 0.10054412969086964] |
1,803.03254 | GONet: A Semi-Supervised Deep Learning Approach For Traversability
Estimation | We present semi-supervised deep learning approaches for traversability
estimation from fisheye images. Our method, GONet, and the proposed extensions
leverage Generative Adversarial Networks (GANs) to effectively predict whether
the area seen in the input image(s) is safe for a robot to traverse. These
methods are trained with many positive images of traversable places, but just a
small set of negative images depicting blocked and unsafe areas. This makes the
proposed methods practical. Positive examples can be collected easily by simply
operating a robot through traversable spaces, while obtaining negative examples
is time consuming, costly, and potentially dangerous. Through extensive
experiments and several demonstrations, we show that the proposed
traversability estimation approaches are robust and can generalize to unseen
scenarios. Further, we demonstrate that our methods are memory efficient and
fast, allowing for real-time operation on a mobile robot with single or stereo
fisheye cameras. As part of our contributions, we open-source two new datasets
for traversability estimation. These datasets are composed of approximately 24h
of videos from more than 25 indoor environments. Our methods outperform
baseline approaches for traversability estimation on these new datasets.
| cs.RO cs.CV cs.LG | we present semisupervised deep learning approaches for traversability estimation from fisheye images our method gonet and the proposed extensions leverage generative adversarial networks gans to effectively predict whether the area seen in the input images is safe for a robot to traverse these methods are trained with many positive images of traversable places but just a small set of negative images depicting blocked and unsafe areas this makes the proposed methods practical positive examples can be collected easily by simply operating a robot through traversable spaces while obtaining negative examples is time consuming costly and potentially dangerous through extensive experiments and several demonstrations we show that the proposed traversability estimation approaches are robust and can generalize to unseen scenarios further we demonstrate that our methods are memory efficient and fast allowing for realtime operation on a mobile robot with single or stereo fisheye cameras as part of our contributions we opensource two new datasets for traversability estimation these datasets are composed of approximately 24h of videos from more than 25 indoor environments our methods outperform baseline approaches for traversability estimation on these new datasets | [['we', 'present', 'semisupervised', 'deep', 'learning', 'approaches', 'for', 'traversability', 'estimation', 'from', 'fisheye', 'images', 'our', 'method', 'gonet', 'and', 'the', 'proposed', 'extensions', 'leverage', 'generative', 'adversarial', 'networks', 'gans', 'to', 'effectively', 'predict', 'whether', 'the', 'area', 'seen', 'in', 'the', 'input', 'images', 'is', 'safe', 'for', 'a', 'robot', 'to', 'traverse', 'these', 'methods', 'are', 'trained', 'with', 'many', 'positive', 'images', 'of', 'traversable', 'places', 'but', 'just', 'a', 'small', 'set', 'of', 'negative', 'images', 'depicting', 'blocked', 'and', 'unsafe', 'areas', 'this', 'makes', 'the', 'proposed', 'methods', 'practical', 'positive', 'examples', 'can', 'be', 'collected', 'easily', 'by', 'simply', 'operating', 'a', 'robot', 'through', 'traversable', 'spaces', 'while', 'obtaining', 'negative', 'examples', 'is', 'time', 'consuming', 'costly', 'and', 'potentially', 'dangerous', 'through', 'extensive', 'experiments', 'and', 'several', 'demonstrations', 'we', 'show', 'that', 'the', 'proposed', 'traversability', 'estimation', 'approaches', 'are', 'robust', 'and', 'can', 'generalize', 'to', 'unseen', 'scenarios', 'further', 'we', 'demonstrate', 'that', 'our', 'methods', 'are', 'memory', 'efficient', 'and', 'fast', 'allowing', 'for', 'realtime', 'operation', 'on', 'a', 'mobile', 'robot', 'with', 'single', 'or', 'stereo', 'fisheye', 'cameras', 'as', 'part', 'of', 'our', 'contributions', 'we', 'opensource', 'two', 'new', 'datasets', 'for', 'traversability', 'estimation', 'these', 'datasets', 'are', 'composed', 'of', 'approximately', '24h', 'of', 'videos', 'from', 'more', 'than', '25', 'indoor', 'environments', 'our', 'methods', 'outperform', 'baseline', 'approaches', 'for', 'traversability', 'estimation', 'on', 'these', 'new', 'datasets']] | [-0.0625350960038739, 0.027417598752831313, -0.0577684965075763, 0.08228186850053885, -0.11457487858538314, -0.2143371598440749, 0.011309442901224627, 0.4770695958235908, -0.2013839520615242, -0.3700918096077183, 0.12080755850247046, -0.2893477927554277, -0.1819938906815166, 0.2730734856234884, -0.1771821456774057, 0.08351185073590149, 0.1664812964407484, 0.011610626229768335, -0.05668035695460909, -0.2828782838060642, 0.28132809530222364, -0.008175406449521213, 0.29766138812334725, 0.018935132836265002, 0.14978298290541558, -0.04812207241490757, -0.015181019531471817, 0.03163776582020902, -0.04899592970634884, 0.13522506493293052, 0.33327251890390786, 0.21469716974736555, 0.2935271806098804, -0.425040507687853, -0.24556170850384818, 0.1048105347479419, 0.1500494123737672, 0.11065274601352702, -0.06670028663219178, -0.42076591906927363, 0.09389039068723239, -0.1523387740485107, -0.01054304452744596, -0.17595760013563963, -0.022233044488846488, -0.023732694019323073, -0.31005993211115507, 0.01948736226768233, 0.005893898154128059, 0.040023475591822164, -0.06480543853483497, -0.10351409965242846, 0.03711096829172912, 0.1754344636928695, 0.042870005034669506, -0.0011979863313330418, 0.1648638690467519, -0.1628116147871681, -0.14681630599332732, 0.332891004362508, -0.027350243974781377, -0.2199621602789114, 0.23987031473940157, -0.024439433602231515, -0.09665977731903853, 0.11491481855046004, 0.23949466876650188, 0.1896170169805017, -0.14079052797561695, -0.012904429445093821, -0.04098488459598941, 0.1403409303419049, 0.06227891540924168, -0.03470983892760199, 0.19888414787546144, 0.2157388543608882, 0.06663599136790373, 0.14086577969884156, -0.1461765843230988, -0.060199677426324975, -0.24155749611014946, -0.08510079322023438, -0.18978226380489144, -0.032811462871588606, -0.10954411513866154, -0.1315841566627015, 0.36820572779675864, 0.274071227070754, 0.1641558895258324, 0.11571615040441469, 0.41460628870307753, -0.02157666163546547, 0.13494238842521672, 0.11482892845980013, 0.19325171845570288, -0.04530890015556234, 0.1364216232538203, -0.11446792793045145, 0.06379282529308947, 0.0020244589414569023] |
1,803.03255 | Scale-dependent polytropic black hole | In the present work we study the scale--dependence of polytropic non-charged
black holes in (3+1)-dimensional space--times assuming a cosmological constant.
We allow for scale--dependence of the gravitational and cosmological couplings,
and we solve the corresponding generalized field equations imposing the null
energy condition. Besides, some properties, such as horizon structure and
thermodynamics, are discussed in detail.
| gr-qc | in the present work we study the scaledependence of polytropic noncharged black holes in 31dimensional spacetimes assuming a cosmological constant we allow for scaledependence of the gravitational and cosmological couplings and we solve the corresponding generalized field equations imposing the null energy condition besides some properties such as horizon structure and thermodynamics are discussed in detail | [['in', 'the', 'present', 'work', 'we', 'study', 'the', 'scaledependence', 'of', 'polytropic', 'noncharged', 'black', 'holes', 'in', '31dimensional', 'spacetimes', 'assuming', 'a', 'cosmological', 'constant', 'we', 'allow', 'for', 'scaledependence', 'of', 'the', 'gravitational', 'and', 'cosmological', 'couplings', 'and', 'we', 'solve', 'the', 'corresponding', 'generalized', 'field', 'equations', 'imposing', 'the', 'null', 'energy', 'condition', 'besides', 'some', 'properties', 'such', 'as', 'horizon', 'structure', 'and', 'thermodynamics', 'are', 'discussed', 'in', 'detail']] | [-0.1859137514340026, 0.10496396668479845, -0.07890989986481145, 0.1526552103459835, -0.1307868748886644, -0.10228243035297575, -0.08581876643750418, 0.300862766278442, -0.1820489523649615, -0.29634764358135207, 0.07942046414037966, -0.24981009886999214, -0.10295398816067193, 0.14300675854818629, 0.01538227085672718, 0.07962196096819493, -0.015810068156237582, 0.014338328074830185, -0.10641225153813139, -0.23136570297564113, 0.436520771389561, 0.10386411922809202, 0.21304428263101727, 0.029250010099661137, 0.10633084387518466, -0.031236429237261682, -0.021308074447525933, 0.12746138148109562, -0.27579616771877874, -0.013686964415163467, 0.1690500483133032, 0.12411648041701742, 0.18501205465041234, -0.4378458308055997, -0.23776086591117615, 0.10857501883791494, 0.11998897194696058, 0.1993564647855237, -0.10089320043334737, -0.2529634942766279, 0.0646617281017825, -0.20846031785809568, -0.19608197526706914, -0.0713617840914854, -0.0260205597712359, -0.013728041476237454, -0.20664471850718005, 0.1697392668242433, 0.034393228174719424, -0.050219906211298494, -0.15300711143728613, -0.031136185828862444, -0.023021109136087552, 0.018596735150952424, 0.13921809079641076, -0.07455523594398983, 0.1263839968596585, -0.1527383648873573, -0.07257013568388564, 0.4093843718125884, -0.10178923851760503, -0.26977111043275465, 0.10837394420689504, -0.1958888867271266, -0.20098262815736234, -0.001880154396141214, 0.1573316614875304, 0.17543910337345942, -0.15483543270238442, 0.20636405593437043, 0.021107874378295883, 0.11831808122639943, 0.14429821947955393, 0.06173596491238901, 0.3169785419678582, 0.10255219897122256, -0.009024248441814311, 0.13780477179014788, -0.0178895862689907, -0.10432093804515066, -0.40704218870294945, -0.16255762255085365, -0.1039475327623742, 0.10639212094247341, -0.18575550545028818, -0.15791818623464288, 0.35300239265364197, 0.1559210083308114, 0.1536142633329811, 0.060686138624857576, 0.21779495024000944, 0.09475056271600936, -0.02096379289598969, 0.13445464080931352, 0.3365351442922214, 0.1806362174559451, 0.14077880795645928, -0.2343056604731828, -0.07715652550437621, 0.08756579686139178] |
1,803.03256 | A simple class of infinitely many absolutely exotic manifolds | We show that the smooth $4$-manifold $M$ obtained by attaching a $2$-handle
to $B^4$ along a certain knot $K\subset \partial B^4$ admits infinitely many
absolutely exotic copies $M_n$, $n=0,1,2..$, such that each copy $M_n$ is
obtained by attaching $2$-handle to a fixed compact smooth contractible
manifold $W$ along the iterates $f^{n}(c)$ of a knot $c\subset \partial W$ by a
diffeomorphism $f:\partial W \to \partial W$. This generalizes the example in
author's 1991 paper, which corresponds to $n=1$ case.
| math.GT math.DG | we show that the smooth 4manifold m obtained by attaching a 2handle to b4 along a certain knot ksubset partial b4 admits infinitely many absolutely exotic copies m_n n012 such that each copy m_n is obtained by attaching 2handle to a fixed compact smooth contractible manifold w along the iterates fnc of a knot csubset partial w by a diffeomorphism fpartial w to partial w this generalizes the example in authors 1991 paper which corresponds to n1 case | [['we', 'show', 'that', 'the', 'smooth', '4manifold', 'm', 'obtained', 'by', 'attaching', 'a', '2handle', 'to', 'b4', 'along', 'a', 'certain', 'knot', 'ksubset', 'partial', 'b4', 'admits', 'infinitely', 'many', 'absolutely', 'exotic', 'copies', 'm_n', 'n012', 'such', 'that', 'each', 'copy', 'm_n', 'is', 'obtained', 'by', 'attaching', '2handle', 'to', 'a', 'fixed', 'compact', 'smooth', 'contractible', 'manifold', 'w', 'along', 'the', 'iterates', 'fnc', 'of', 'a', 'knot', 'csubset', 'partial', 'w', 'by', 'a', 'diffeomorphism', 'fpartial', 'w', 'to', 'partial', 'w', 'this', 'generalizes', 'the', 'example', 'in', 'authors', '1991', 'paper', 'which', 'corresponds', 'to', 'n1', 'case']] | [-0.24693689426072898, 0.144445993949492, -0.04920671801440991, -0.0145495959963554, -0.10504184792546603, -0.24250434935451126, 0.038073609702480145, 0.3581673161437114, -0.2911819421196691, -0.19651140291721392, 0.054962425968812734, -0.32175034781297046, -0.10960223112637416, 0.1244655325799846, -0.17467061600361306, 0.004242560635201442, 0.11181104505577913, 0.08916095295586647, -0.06004017044025927, -0.23844312363041517, 0.3482769429803086, -0.17526072615948626, 0.10965072727189042, -0.0045326093020729525, 0.17111663576454306, 0.01252978224044618, 0.02280594261052708, -0.007212918669654009, -0.2132268641332466, 0.06796875425900978, 0.27329121370059556, 0.03716008018893309, 0.17891484620766, -0.30640535486432224, -0.17278888226988223, 0.1860358549090914, 0.17935994462086222, -0.059095434875836454, -0.022754725961325068, -0.29999088201722585, 0.1467569800845992, -0.13551688214572957, -0.2176642393012746, 0.003098788826415936, 0.08224679646679224, -0.02715120291432891, -0.2679723396133154, -0.04203448240430309, 0.10784768011683646, 0.0060334573828209285, 0.04426300191344359, -0.1364314307172138, -0.15529079491926284, 0.05593928855318481, 0.026190177898686856, 0.23487744442760372, 0.08272012591791841, -0.03409820567303074, -0.10054472387911609, 0.32274304998990816, -0.11622796024983892, -0.2762397987774024, 0.11251900017034644, -0.12906659258983266, -0.22663421088304275, 0.24724245477372256, -0.006809257866384892, 0.15302160892110223, -0.06052008381811902, 0.22026317078285876, -0.16374340309546545, 0.07308858819902898, 0.19429344513143101, -0.06803910129775222, 0.08494694481412761, 0.023539398465520486, 0.15835931557991828, 0.15204583891094303, 0.04670489378846609, 0.010456003427792054, -0.37398384568782955, -0.2103885180579546, -0.12963584129913494, 0.24489615538802284, -0.09632284437471893, -0.11696813678225645, 0.33353274647528547, -0.07555696928802018, 0.25874039801792836, 0.05987188155697181, 0.2312233173646606, 0.02695285793668471, -7.548433943436696e-05, 0.10567953717933658, 0.016483429299954038, 0.17564527638769972, -0.03241748217111214, -0.09997730603059515, -0.0725541092389717, 0.1992193033847098] |
1,803.03257 | Global well-posedness for the mass-critical stochastic nonlinear
Schr\"{o}dinger equation on $\mathbb{R}$: small initial data | We prove the global existence of solution to the small data mass critical
stochastic nonlinear Schr\"{o}dinger equation in $d=1$. We further show the
stability of the solution under perturbation of initial data. Our construction
starts with the existence of the solution to the truncated subcritical problem.
We then obtain uniform bounds on these solutions that enable us to reach
criticality and then remove the truncation.
| math.PR math.AP | we prove the global existence of solution to the small data mass critical stochastic nonlinear schrodinger equation in d1 we further show the stability of the solution under perturbation of initial data our construction starts with the existence of the solution to the truncated subcritical problem we then obtain uniform bounds on these solutions that enable us to reach criticality and then remove the truncation | [['we', 'prove', 'the', 'global', 'existence', 'of', 'solution', 'to', 'the', 'small', 'data', 'mass', 'critical', 'stochastic', 'nonlinear', 'schrodinger', 'equation', 'in', 'd1', 'we', 'further', 'show', 'the', 'stability', 'of', 'the', 'solution', 'under', 'perturbation', 'of', 'initial', 'data', 'our', 'construction', 'starts', 'with', 'the', 'existence', 'of', 'the', 'solution', 'to', 'the', 'truncated', 'subcritical', 'problem', 'we', 'then', 'obtain', 'uniform', 'bounds', 'on', 'these', 'solutions', 'that', 'enable', 'us', 'to', 'reach', 'criticality', 'and', 'then', 'remove', 'the', 'truncation']] | [-0.11625726963751591, 0.02617789148711241, -0.11628535037430433, 0.04715320489799174, -0.06603511869907379, -0.09830611382539456, 0.0663308315552198, 0.2648394389507862, -0.2948799720750405, -0.2464484890528883, 0.19185752663582276, -0.2895534195005894, -0.11860704373281736, 0.13125940661590832, -0.03325044454003756, 0.10524058489558788, 0.072982677215567, 0.036956802010536194, -0.08279413668653712, -0.24956857872983584, 0.37369628015619055, -0.00047912865590590695, 0.25407090367606056, 0.05480455086620238, 0.08272205947611767, -0.04465374119866353, 0.03358674370325529, -0.008891845114815694, -0.23177944424689764, 0.08404656530966839, 0.19250149913132192, 0.14130497477733744, 0.2815315878425071, -0.45742397852815114, -0.15795703512714962, 0.1344201231518617, 0.13708953766035847, 0.1625305755637013, -0.06730173951408898, -0.2846276842344266, 0.1333615379121441, -0.10901662446558476, -0.25415325184854176, -0.12524116069365007, -0.023027223305633435, 0.05846758719820243, -0.3352464238324991, 0.0970350848367581, 0.08825678558876882, -0.059171437366435736, -0.1781897978642239, -0.04400512336824949, -0.0308018152996038, 0.0873361478631313, 0.06776571382696812, -0.010114811016963078, 0.04323190447086325, -0.12472556236271674, -0.0486636293765444, 0.3082653314878161, -0.10262853332186261, -0.2335785451846627, 0.17705991480212946, -0.16744139496810162, -0.13990865748089093, 0.11487052512283509, 0.19027347586905727, 0.12951670014657654, -0.10350224410112087, 0.10544972607346538, -0.050632874216311255, 0.1726521892616382, 0.08189710146532608, -0.006317785418090912, 0.10556994318388975, 0.16037565372669352, 0.1897891714882392, 0.14990322928016003, -0.06349981739991703, -0.13357382946862625, -0.33400634785111133, -0.08708636765413058, -0.13885557720294364, 0.09322397560597612, -0.15699390827010995, -0.20095738170919222, 0.385317649337678, 0.23142990014300896, 0.19046584786130832, 0.09902618129809315, 0.22156036063276519, 0.1844937804889364, 0.004047414201956529, 0.08141959914937616, 0.26307869696846375, 0.12816422667999108, 0.09340767540180912, -0.2490025327182733, -0.0261226635480013, 0.12813865999476268] |
1,803.03258 | Laboratory verification of 'Fast & Furious' phase diversity: Towards
controlling the low wind effect in the SPHERE instrument | The low wind effect (LWE) refers to a characteristic set of quasi-static
wavefront aberrations seen consistently by the SPHERE instrument when
dome-level wind speeds drop below 3 m/s. This effect produces bright low-order
speckles in the stellar PSF, which severely limit the contrast performance of
SPHERE under otherwise optimal observing conditions. In this paper we propose
the Fast & Furious (F&F) phase diversity algorithm as a viable software-only
solution for real-time LWE compensation, which would utilise image sequences
from the SPHERE differential tip-tilt sensor (DTTS). We evaluated the
closed-loop performance of F&F on the MITHIC high-contrast test-bench under a
variety of conditions emulating LWE-affected DTTS images, in order to assess
the expected performance of an on-sky implementation of F&F in SPHERE. The
algorithm was found to be capable of returning such LWE-affected images to
Strehl ratios of greater than 90% within five iterations, for all appropriate
laboratory test cases. These results are highly representative of predictive
simulations, and demonstrate the stability of the algorithm against a wide
range of factors including low image signal-to-noise ratio (S/N), small image
field of view, and amplitude errors. It was also found in simulation that
closed-loop stability can be preserved down to image S/N as low as five while
still improving overall wavefront quality, allowing for reliable operation even
on faint targets. The Fast & Furious algorithm is an extremely promising
solution for real-time compensation of the LWE, which can operate
simultaneously with science observations and may be implemented in SPHERE
without requiring additional hardware. The robustness and relatively large
effective dynamic range of F&F also make it suitable for general wavefront
optimisation applications, including the co-phasing of segmented ELT-class
telescopes.
| astro-ph.IM astro-ph.EP | the low wind effect lwe refers to a characteristic set of quasistatic wavefront aberrations seen consistently by the sphere instrument when domelevel wind speeds drop below 3 ms this effect produces bright loworder speckles in the stellar psf which severely limit the contrast performance of sphere under otherwise optimal observing conditions in this paper we propose the fast furious ff phase diversity algorithm as a viable softwareonly solution for realtime lwe compensation which would utilise image sequences from the sphere differential tiptilt sensor dtts we evaluated the closedloop performance of ff on the mithic highcontrast testbench under a variety of conditions emulating lweaffected dtts images in order to assess the expected performance of an onsky implementation of ff in sphere the algorithm was found to be capable of returning such lweaffected images to strehl ratios of greater than 90 within five iterations for all appropriate laboratory test cases these results are highly representative of predictive simulations and demonstrate the stability of the algorithm against a wide range of factors including low image signaltonoise ratio sn small image field of view and amplitude errors it was also found in simulation that closedloop stability can be preserved down to image sn as low as five while still improving overall wavefront quality allowing for reliable operation even on faint targets the fast furious algorithm is an extremely promising solution for realtime compensation of the lwe which can operate simultaneously with science observations and may be implemented in sphere without requiring additional hardware the robustness and relatively large effective dynamic range of ff also make it suitable for general wavefront optimisation applications including the cophasing of segmented eltclass telescopes | [['the', 'low', 'wind', 'effect', 'lwe', 'refers', 'to', 'a', 'characteristic', 'set', 'of', 'quasistatic', 'wavefront', 'aberrations', 'seen', 'consistently', 'by', 'the', 'sphere', 'instrument', 'when', 'domelevel', 'wind', 'speeds', 'drop', 'below', '3', 'ms', 'this', 'effect', 'produces', 'bright', 'loworder', 'speckles', 'in', 'the', 'stellar', 'psf', 'which', 'severely', 'limit', 'the', 'contrast', 'performance', 'of', 'sphere', 'under', 'otherwise', 'optimal', 'observing', 'conditions', 'in', 'this', 'paper', 'we', 'propose', 'the', 'fast', 'furious', 'ff', 'phase', 'diversity', 'algorithm', 'as', 'a', 'viable', 'softwareonly', 'solution', 'for', 'realtime', 'lwe', 'compensation', 'which', 'would', 'utilise', 'image', 'sequences', 'from', 'the', 'sphere', 'differential', 'tiptilt', 'sensor', 'dtts', 'we', 'evaluated', 'the', 'closedloop', 'performance', 'of', 'ff', 'on', 'the', 'mithic', 'highcontrast', 'testbench', 'under', 'a', 'variety', 'of', 'conditions', 'emulating', 'lweaffected', 'dtts', 'images', 'in', 'order', 'to', 'assess', 'the', 'expected', 'performance', 'of', 'an', 'onsky', 'implementation', 'of', 'ff', 'in', 'sphere', 'the', 'algorithm', 'was', 'found', 'to', 'be', 'capable', 'of', 'returning', 'such', 'lweaffected', 'images', 'to', 'strehl', 'ratios', 'of', 'greater', 'than', '90', 'within', 'five', 'iterations', 'for', 'all', 'appropriate', 'laboratory', 'test', 'cases', 'these', 'results', 'are', 'highly', 'representative', 'of', 'predictive', 'simulations', 'and', 'demonstrate', 'the', 'stability', 'of', 'the', 'algorithm', 'against', 'a', 'wide', 'range', 'of', 'factors', 'including', 'low', 'image', 'signaltonoise', 'ratio', 'sn', 'small', 'image', 'field', 'of', 'view', 'and', 'amplitude', 'errors', 'it', 'was', 'also', 'found', 'in', 'simulation', 'that', 'closedloop', 'stability', 'can', 'be', 'preserved', 'down', 'to', 'image', 'sn', 'as', 'low', 'as', 'five', 'while', 'still', 'improving', 'overall', 'wavefront', 'quality', 'allowing', 'for', 'reliable', 'operation', 'even', 'on', 'faint', 'targets', 'the', 'fast', 'furious', 'algorithm', 'is', 'an', 'extremely', 'promising', 'solution', 'for', 'realtime', 'compensation', 'of', 'the', 'lwe', 'which', 'can', 'operate', 'simultaneously', 'with', 'science', 'observations', 'and', 'may', 'be', 'implemented', 'in', 'sphere', 'without', 'requiring', 'additional', 'hardware', 'the', 'robustness', 'and', 'relatively', 'large', 'effective', 'dynamic', 'range', 'of', 'ff', 'also', 'make', 'it', 'suitable', 'for', 'general', 'wavefront', 'optimisation', 'applications', 'including', 'the', 'cophasing', 'of', 'segmented', 'eltclass', 'telescopes']] | [-0.11588399841415661, 0.0655499746463546, -0.05483938727648584, 0.057457065025422104, -0.04265448191737825, -0.15023341654041023, 0.029553146143357648, 0.41324807499983796, -0.21684645442464562, -0.3698681464970664, 0.15384958651875086, -0.19468393303384934, -0.11906359503218145, 0.2616776494483929, -0.13121504093158162, 0.10221828682934521, 0.1065829787351605, -0.014325983266139196, -0.0661185692199204, -0.25968426799367145, 0.2244897060967223, 0.1082004442707532, 0.27421474345373337, -0.005714477871596399, 0.11792046146519068, -0.017322783460150714, 0.0067835431735686685, 0.02115467340006742, -0.06657078330573751, 0.03749443967244588, 0.269972076508458, 0.13032849508303182, 0.24313866178919044, -0.3898266286244271, -0.18863319889383598, 0.0751475962761712, 0.1566660175824331, 0.060911221155051695, -0.05369581262509908, -0.2835417268625288, 0.11885529764048341, -0.14134327724006854, -0.1302425216883421, -0.09313852298245938, -0.0196779068856914, 0.020775450755522964, -0.31232939582852715, 0.02476747294691719, 0.021889804648580376, 0.07829893443009092, -0.0559583284460974, -0.10460479588515159, 0.020154483293838524, 0.132211373425714, -0.006271534619197525, 0.0516202457632904, 0.15177785757135737, -0.16728940600641418, -0.0253495459496561, 0.4112406512308452, -0.05834812600541799, -0.1503836189914081, 0.17061543968609638, -0.14110863135299748, -0.08921190604602021, 0.20416786414743573, 0.2029401712887058, 0.11137733903403084, -0.13387019708003478, 0.012439139270443572, 0.03363415571102114, 0.20466575613417834, 0.08541913903059645, 0.05663799819023417, 0.19738370413564282, 0.1882048916351643, 0.08944036108226067, 0.12786413140776048, -0.19408167764734202, -0.04089927115581102, -0.24984688830682664, -0.1172282147721422, -0.13138645590558923, 0.0009149810282030592, -0.13161578882395084, -0.14361955219431333, 0.35711746841186176, 0.18691647535888478, 0.1310813037148263, 0.05993954331777921, 0.3660109467149057, 0.07264268983816254, 0.0838887648419822, 0.050957418296969044, 0.27813381151925703, 0.06963443548970476, 0.09880410753345738, -0.21445783443007344, 0.05762889915991023, 0.0005596077845742305] |
1,803.03259 | A reciprocal formulation of non-exponential radiative transfer. 1:
Sketch and motivation | Previous proposals to permit non-exponential free-path statistics in
radiative transfer have not included support for volume and boundary sources
that are spatially uncorrelated from the scattering events in the medium.
Birth-collision free paths are treated identically to collision-collision free
paths and application of this to general, bounded scenes with inclusions leads
to non-reciprocal transport. Beginning with reciprocity as a desired property,
we propose a new way to integrate non-exponential transport theory into general
scenes. We distinguish between the free-path-length statistics between
correlated medium particles and the free-path-length statistics beginning at
locations not correlated to medium particles, such as boundary surfaces,
inclusions and uncorrelated sources. Reciprocity requires that the uncorrelated
free-path distributions are simply the normalized transmittance of the
correlated free-path distributions. The combination leads to an equilibrium
imbedding of a previously derived generalized transport equation into bounded
domains. We compare predictions of this approach to Monte Carlo simulation of
multiple scattering from negatively-correlated suspensions of monodispersive
hard spheres in bounded two-dimensional domains and demonstrate improved
performance relative to previous work. We also derive new, exact, reciprocal,
single-scattering solutions for plane-parallel half-spaces over a variety of
non-exponential media types.
| physics.comp-ph cs.GR nucl-th | previous proposals to permit nonexponential freepath statistics in radiative transfer have not included support for volume and boundary sources that are spatially uncorrelated from the scattering events in the medium birthcollision free paths are treated identically to collisioncollision free paths and application of this to general bounded scenes with inclusions leads to nonreciprocal transport beginning with reciprocity as a desired property we propose a new way to integrate nonexponential transport theory into general scenes we distinguish between the freepathlength statistics between correlated medium particles and the freepathlength statistics beginning at locations not correlated to medium particles such as boundary surfaces inclusions and uncorrelated sources reciprocity requires that the uncorrelated freepath distributions are simply the normalized transmittance of the correlated freepath distributions the combination leads to an equilibrium imbedding of a previously derived generalized transport equation into bounded domains we compare predictions of this approach to monte carlo simulation of multiple scattering from negativelycorrelated suspensions of monodispersive hard spheres in bounded twodimensional domains and demonstrate improved performance relative to previous work we also derive new exact reciprocal singlescattering solutions for planeparallel halfspaces over a variety of nonexponential media types | [['previous', 'proposals', 'to', 'permit', 'nonexponential', 'freepath', 'statistics', 'in', 'radiative', 'transfer', 'have', 'not', 'included', 'support', 'for', 'volume', 'and', 'boundary', 'sources', 'that', 'are', 'spatially', 'uncorrelated', 'from', 'the', 'scattering', 'events', 'in', 'the', 'medium', 'birthcollision', 'free', 'paths', 'are', 'treated', 'identically', 'to', 'collisioncollision', 'free', 'paths', 'and', 'application', 'of', 'this', 'to', 'general', 'bounded', 'scenes', 'with', 'inclusions', 'leads', 'to', 'nonreciprocal', 'transport', 'beginning', 'with', 'reciprocity', 'as', 'a', 'desired', 'property', 'we', 'propose', 'a', 'new', 'way', 'to', 'integrate', 'nonexponential', 'transport', 'theory', 'into', 'general', 'scenes', 'we', 'distinguish', 'between', 'the', 'freepathlength', 'statistics', 'between', 'correlated', 'medium', 'particles', 'and', 'the', 'freepathlength', 'statistics', 'beginning', 'at', 'locations', 'not', 'correlated', 'to', 'medium', 'particles', 'such', 'as', 'boundary', 'surfaces', 'inclusions', 'and', 'uncorrelated', 'sources', 'reciprocity', 'requires', 'that', 'the', 'uncorrelated', 'freepath', 'distributions', 'are', 'simply', 'the', 'normalized', 'transmittance', 'of', 'the', 'correlated', 'freepath', 'distributions', 'the', 'combination', 'leads', 'to', 'an', 'equilibrium', 'imbedding', 'of', 'a', 'previously', 'derived', 'generalized', 'transport', 'equation', 'into', 'bounded', 'domains', 'we', 'compare', 'predictions', 'of', 'this', 'approach', 'to', 'monte', 'carlo', 'simulation', 'of', 'multiple', 'scattering', 'from', 'negativelycorrelated', 'suspensions', 'of', 'monodispersive', 'hard', 'spheres', 'in', 'bounded', 'twodimensional', 'domains', 'and', 'demonstrate', 'improved', 'performance', 'relative', 'to', 'previous', 'work', 'we', 'also', 'derive', 'new', 'exact', 'reciprocal', 'singlescattering', 'solutions', 'for', 'planeparallel', 'halfspaces', 'over', 'a', 'variety', 'of', 'nonexponential', 'media', 'types']] | [-0.09964599176545379, 0.1658469790019778, -0.09737939015285321, 0.07722399631245418, -0.057878343261208366, -0.13145445238880285, 0.024609940762051426, 0.4227596666623172, -0.29709159113120676, -0.2753726341504008, 0.017531521278662515, -0.307829491208852, -0.10922158556186233, 0.18036811908101408, -0.050342831142307795, 0.08080772748802244, 0.03834929380978107, -0.051712748022047714, -0.05348820743223212, -0.20989430422227973, 0.31072287714050617, 0.016646678798038085, 0.30655084698476265, 0.04356301730292559, 0.08720987103879452, 0.046581484673432164, -0.0435566216926065, 0.03870180490903195, -0.1486849569760249, 0.10080110680189777, 0.2460589678550923, 0.024625886811829003, 0.18449306040696922, -0.46793660185620434, -0.26540440274656957, 0.10600290870131121, 0.16544068078739477, 0.09032855282125414, -0.029026772202847557, -0.26580713049106586, 0.03660904701870403, -0.14610429948877768, -0.13979007120885442, -0.06489918113793017, 0.004508924245569712, 0.0548802033076928, -0.27479506771034395, 0.12075559644246743, 0.04375367163690195, 0.028976570491684103, -0.07915793330398455, -0.09939574536389055, 0.022159871283938978, 0.13619195730832553, 0.033420536493439776, -0.03833046934155167, 0.12934538848759208, -0.1267056021841925, -0.09926372120485137, 0.35451529762177103, -0.0558750921722929, -0.23161925897104005, 0.2297249272659095, -0.15219399946057263, -0.0633640742168604, 0.1914742247613727, 0.20750742038213166, 0.13290802938507393, -0.19366639113063858, 0.024185321243833546, -0.04864251038792436, 0.13354291329083995, 0.06724441819697048, 0.04161834516091771, 0.18276922310870447, 0.10563465772779364, 0.05231449271608246, 0.15442962015952275, -0.06421570281772951, -0.14069931330973579, -0.3045628871390204, -0.1257506299508186, -0.17783169512245092, 0.06980086457193575, -0.09167479231272622, -0.19605497680693518, 0.30882256040400496, 0.15708978611293956, 0.18544370358392515, 0.09089976365937562, 0.2704188366792078, 0.0962176215491395, 0.020647452248494482, 0.07719386022415806, 0.18996086927344563, 0.1716909578774262, 0.10135902535829368, -0.16418922596605992, 0.05568083453429812, 0.015231560186124813] |
1,803.0326 | Development, Characterization and Qualification of first GEM foils
produced in India | The increasing demand for Gas Electron Multiplier (GEM) foils has been driven
by their application in many current and proposed high-energy physics
experiments. Micropack, a Bengaluru-based company, has established and
commercialized GEM foils for the first time in India. Micropack used the
double-mask etching technique to successfully produce 10 cm $\times$ 10 cm GEM
foil. In this paper, we report on the development as well as the geometrical
and electrical properties of these foils, including the size uniformity of the
holes and leakage current measurements. Our characterization studies show that
the foils are of good quality and satisfy all the necessary quality control
criteria.
| physics.ins-det hep-ex | the increasing demand for gas electron multiplier gem foils has been driven by their application in many current and proposed highenergy physics experiments micropack a bengalurubased company has established and commercialized gem foils for the first time in india micropack used the doublemask etching technique to successfully produce 10 cm times 10 cm gem foil in this paper we report on the development as well as the geometrical and electrical properties of these foils including the size uniformity of the holes and leakage current measurements our characterization studies show that the foils are of good quality and satisfy all the necessary quality control criteria | [['the', 'increasing', 'demand', 'for', 'gas', 'electron', 'multiplier', 'gem', 'foils', 'has', 'been', 'driven', 'by', 'their', 'application', 'in', 'many', 'current', 'and', 'proposed', 'highenergy', 'physics', 'experiments', 'micropack', 'a', 'bengalurubased', 'company', 'has', 'established', 'and', 'commercialized', 'gem', 'foils', 'for', 'the', 'first', 'time', 'in', 'india', 'micropack', 'used', 'the', 'doublemask', 'etching', 'technique', 'to', 'successfully', 'produce', '10', 'cm', 'times', '10', 'cm', 'gem', 'foil', 'in', 'this', 'paper', 'we', 'report', 'on', 'the', 'development', 'as', 'well', 'as', 'the', 'geometrical', 'and', 'electrical', 'properties', 'of', 'these', 'foils', 'including', 'the', 'size', 'uniformity', 'of', 'the', 'holes', 'and', 'leakage', 'current', 'measurements', 'our', 'characterization', 'studies', 'show', 'that', 'the', 'foils', 'are', 'of', 'good', 'quality', 'and', 'satisfy', 'all', 'the', 'necessary', 'quality', 'control', 'criteria']] | [-0.030619165205139017, 0.08427284397546528, -0.02112468274635742, -0.0022440351222560388, 0.022030718484441342, -0.12682295888571918, -0.003194391258395485, 0.41772827419262487, -0.20237674201314237, -0.34156866156432814, 0.13012403423459387, -0.3025921972387118, -0.04879533300556026, 0.28969987895050386, -0.0648513052395536, 0.1377806207978899, 0.03009270161539497, -0.061845870955295645, -0.06125234393628983, -0.2756580823627798, 0.22094300677954645, 0.1293033908926023, 0.3569005800465357, 0.09053370173007828, 0.12769983736436488, -0.05067419125110779, -0.03342841508079465, 0.0053472035356516975, -0.13935844360171756, 0.07874148550615148, 0.2625288508687783, 0.09462551797233812, 0.23004702118776957, -0.49050034774304596, -0.20099047849913246, 0.016747936570239298, 0.0886170331352544, -0.006132058708847148, -0.14949995383859874, -0.20495202412458083, 0.12008479338826485, -0.2206433672566437, -0.11661335856436743, -0.05263267189164836, 0.014847548029756227, 0.10705187968520936, -0.2515474977875942, -0.03335037679429555, 0.0614964836062321, 0.04488482880541711, -0.05008807387519447, -0.11677831744558169, 0.02661503123535404, 0.1087693363129731, 0.06300535910871351, 0.02304993919322936, 0.2112674431613131, -0.11749959570464218, -0.08880674669030801, 0.30082632716998314, -0.052711783162345295, -0.11654939815329696, 0.21488781732696932, -0.18975863710963575, -0.10004971224760402, 0.1164182502622671, 0.14035641292598353, 0.08189729367409951, -0.18710315739283861, 0.07642293226107214, 0.005886890563788345, 0.1829096881889747, 0.142356746875256, 0.034224622139200855, 0.1861637646662415, 0.21997396813398137, 0.039792405160537295, 0.10475706650414368, -0.14046402818532389, 0.04021433378723495, -0.25996723300913005, -0.20515423339511296, -0.12861463998430817, 0.06233348949468758, -0.035879129755680306, -0.1256911725312182, 0.403548218924733, 0.13566603227654128, 0.134667893329147, -0.056586699985257054, 0.307224518006496, 0.06726760641237703, 0.09335806493918514, -0.006922011797144575, 0.2774406041705854, 0.1253471612880567, 0.1730599431275815, -0.17623175806772795, 0.0883415051627434, 0.027746570210686876] |
1,803.03261 | Runaway Coalescence at the Onset of Common Envelope Episodes | Luminous red nova transients, presumably from stellar coalescence, exhibit
long-term precursor emission over hundreds of binary orbits, leading to
impulsive outbursts with durations similar to a single orbital period. In an
effort to understand these signatures, we present and analyze a hydrodynamic
model of unstable mass transfer from a giant-star donor onto a more compact
accretor in a binary system. Our simulation begins with mass transfer at the
Roche limit separation and traces a phase of runaway decay leading up to the
plunge of the accretor within the envelope of the donor. We characterize the
fluxes of mass and angular momentum through the system and show that the
orbital evolution can be reconstructed from measurements of these quantities.
The morphology of outflow from the binary changes significantly as the binary
orbit tightens. At wide separations, a thin stream of relatively high-entropy
gas trails from the outer Lagrange points. As the orbit tightens, the orbital
motion desynchronizes from the donor's rotation, and low-entropy ejecta trace a
broad fan of largely ballistic trajectories. An order-of-magnitude increase in
mass ejection rate accompanies the plunge of the accretor with the envelope of
the donor. We argue that this transition marks the precursor-to-outburst
transition observed in stellar coalescence transients.
| astro-ph.SR astro-ph.HE | luminous red nova transients presumably from stellar coalescence exhibit longterm precursor emission over hundreds of binary orbits leading to impulsive outbursts with durations similar to a single orbital period in an effort to understand these signatures we present and analyze a hydrodynamic model of unstable mass transfer from a giantstar donor onto a more compact accretor in a binary system our simulation begins with mass transfer at the roche limit separation and traces a phase of runaway decay leading up to the plunge of the accretor within the envelope of the donor we characterize the fluxes of mass and angular momentum through the system and show that the orbital evolution can be reconstructed from measurements of these quantities the morphology of outflow from the binary changes significantly as the binary orbit tightens at wide separations a thin stream of relatively highentropy gas trails from the outer lagrange points as the orbit tightens the orbital motion desynchronizes from the donors rotation and lowentropy ejecta trace a broad fan of largely ballistic trajectories an orderofmagnitude increase in mass ejection rate accompanies the plunge of the accretor with the envelope of the donor we argue that this transition marks the precursortooutburst transition observed in stellar coalescence transients | [['luminous', 'red', 'nova', 'transients', 'presumably', 'from', 'stellar', 'coalescence', 'exhibit', 'longterm', 'precursor', 'emission', 'over', 'hundreds', 'of', 'binary', 'orbits', 'leading', 'to', 'impulsive', 'outbursts', 'with', 'durations', 'similar', 'to', 'a', 'single', 'orbital', 'period', 'in', 'an', 'effort', 'to', 'understand', 'these', 'signatures', 'we', 'present', 'and', 'analyze', 'a', 'hydrodynamic', 'model', 'of', 'unstable', 'mass', 'transfer', 'from', 'a', 'giantstar', 'donor', 'onto', 'a', 'more', 'compact', 'accretor', 'in', 'a', 'binary', 'system', 'our', 'simulation', 'begins', 'with', 'mass', 'transfer', 'at', 'the', 'roche', 'limit', 'separation', 'and', 'traces', 'a', 'phase', 'of', 'runaway', 'decay', 'leading', 'up', 'to', 'the', 'plunge', 'of', 'the', 'accretor', 'within', 'the', 'envelope', 'of', 'the', 'donor', 'we', 'characterize', 'the', 'fluxes', 'of', 'mass', 'and', 'angular', 'momentum', 'through', 'the', 'system', 'and', 'show', 'that', 'the', 'orbital', 'evolution', 'can', 'be', 'reconstructed', 'from', 'measurements', 'of', 'these', 'quantities', 'the', 'morphology', 'of', 'outflow', 'from', 'the', 'binary', 'changes', 'significantly', 'as', 'the', 'binary', 'orbit', 'tightens', 'at', 'wide', 'separations', 'a', 'thin', 'stream', 'of', 'relatively', 'highentropy', 'gas', 'trails', 'from', 'the', 'outer', 'lagrange', 'points', 'as', 'the', 'orbit', 'tightens', 'the', 'orbital', 'motion', 'desynchronizes', 'from', 'the', 'donors', 'rotation', 'and', 'lowentropy', 'ejecta', 'trace', 'a', 'broad', 'fan', 'of', 'largely', 'ballistic', 'trajectories', 'an', 'orderofmagnitude', 'increase', 'in', 'mass', 'ejection', 'rate', 'accompanies', 'the', 'plunge', 'of', 'the', 'accretor', 'with', 'the', 'envelope', 'of', 'the', 'donor', 'we', 'argue', 'that', 'this', 'transition', 'marks', 'the', 'precursortooutburst', 'transition', 'observed', 'in', 'stellar', 'coalescence', 'transients']] | [-0.12565105210379973, 0.15779301922178784, -0.09958345994427062, 0.07502584763523652, -0.04099228827854489, -0.05580390094650338, 0.08814155785735733, 0.36102369060915074, -0.24239337399122443, -0.3197482023019307, 0.06652463475325246, -0.2714683392666059, -0.038909725071447396, 0.20960182529260876, -0.049398836217553234, -0.013075249679939876, 0.15252581013753863, -0.02487568445965483, -0.1499890258269486, -0.1850265366241963, 0.31396825619429203, 0.06479754579013748, 0.09622640385163377, -0.04734027547309968, 0.0661628426370755, -0.053204324974743006, 0.024077123380698364, -0.10082759193172401, -0.13217117398377048, 0.0297367524475307, 0.18529692680360565, 0.09934083308268449, 0.1893133116208275, -0.38041108921930966, -0.2150359356632954, 0.01635749749885411, 0.1865105171697122, 0.09334837115544936, -0.07392650664751453, -0.2551769720561028, 0.026116012973655567, -0.2664401700448171, -0.15396912662210957, 0.04662886726218137, 0.07529207933371389, 0.048132480399932086, -0.22240783639239506, 0.13988599299492388, 0.09735549996447943, 0.014407662275975735, -0.1392589198957926, -0.053912569375681035, -0.12173952612136076, 0.09992453236003766, 0.08371141160513265, 0.07069221803731755, 0.1883964164546774, -0.09791904465193943, -0.03147245147542124, 0.37946645247676214, -0.0700555904537882, -0.041414657716021534, 0.25025645542963604, -0.23970670123079718, -0.08167874042433457, 0.2469800298637019, 0.21061992885010078, 0.1424760018103055, -0.13609201595055212, -0.05128434560368861, 0.02476888544175147, 0.21100918395504686, 0.06737110551647234, 0.03995153735971567, 0.3885901758391387, 0.15600490457341443, 0.005673154007694177, 0.13175878603193486, -0.20241912685122598, -0.09168002205799416, -0.21660347485287798, -0.10129271748537395, -0.14303379586095563, 0.11333245244730117, -0.11379811267037403, -0.15499731356342608, 0.35397933224393824, 0.11093843475187032, 0.27127661198230074, 0.010874243060099237, 0.2712919774631241, 0.09244122789333584, 0.07535381063723552, 0.12809796563561748, 0.2973459634727033, 0.16247965655483232, 0.12083158264748377, -0.30343824727454977, 0.09236650736622125, 0.035779085049479464] |
1,803.03262 | Dipole portal to heavy neutral leptons | We consider generic neutrino dipole portals between left-handed neutrinos,
photons, and right-handed heavy neutral leptons (HNL) with Dirac masses. The
dominance of this portal significantly alters the conventional phenomenology of
HNLs. We derive a comprehensive set of constraints on the dipole portal to HNLs
by utilizing data from LEP, LHC, MiniBooNE, LSND as well as observations of
Supernova 1987A and consistency of the standard Big Bang Nucleosynthesis. We
calculate projected sensitivities from the proposed high-intensity SHiP beam
dump experiment, and the ongoing experiments at the Short-Baseline Neutrino
facility at Fermilab. Dipole mediated Primakoff neutrino upscattering and
Dalitz-like meson decays are found to be the main production mechanisms in most
of the parametric regime under consideration. Proposed explanations of LSND and
MiniBooNE anomalies based on HNLs with dipole-induced decays are found to be
severely constrained, or to be tested in the future experiments.
| hep-ph hep-ex | we consider generic neutrino dipole portals between lefthanded neutrinos photons and righthanded heavy neutral leptons hnl with dirac masses the dominance of this portal significantly alters the conventional phenomenology of hnls we derive a comprehensive set of constraints on the dipole portal to hnls by utilizing data from lep lhc miniboone lsnd as well as observations of supernova 1987a and consistency of the standard big bang nucleosynthesis we calculate projected sensitivities from the proposed highintensity ship beam dump experiment and the ongoing experiments at the shortbaseline neutrino facility at fermilab dipole mediated primakoff neutrino upscattering and dalitzlike meson decays are found to be the main production mechanisms in most of the parametric regime under consideration proposed explanations of lsnd and miniboone anomalies based on hnls with dipoleinduced decays are found to be severely constrained or to be tested in the future experiments | [['we', 'consider', 'generic', 'neutrino', 'dipole', 'portals', 'between', 'lefthanded', 'neutrinos', 'photons', 'and', 'righthanded', 'heavy', 'neutral', 'leptons', 'hnl', 'with', 'dirac', 'masses', 'the', 'dominance', 'of', 'this', 'portal', 'significantly', 'alters', 'the', 'conventional', 'phenomenology', 'of', 'hnls', 'we', 'derive', 'a', 'comprehensive', 'set', 'of', 'constraints', 'on', 'the', 'dipole', 'portal', 'to', 'hnls', 'by', 'utilizing', 'data', 'from', 'lep', 'lhc', 'miniboone', 'lsnd', 'as', 'well', 'as', 'observations', 'of', 'supernova', '1987a', 'and', 'consistency', 'of', 'the', 'standard', 'big', 'bang', 'nucleosynthesis', 'we', 'calculate', 'projected', 'sensitivities', 'from', 'the', 'proposed', 'highintensity', 'ship', 'beam', 'dump', 'experiment', 'and', 'the', 'ongoing', 'experiments', 'at', 'the', 'shortbaseline', 'neutrino', 'facility', 'at', 'fermilab', 'dipole', 'mediated', 'primakoff', 'neutrino', 'upscattering', 'and', 'dalitzlike', 'meson', 'decays', 'are', 'found', 'to', 'be', 'the', 'main', 'production', 'mechanisms', 'in', 'most', 'of', 'the', 'parametric', 'regime', 'under', 'consideration', 'proposed', 'explanations', 'of', 'lsnd', 'and', 'miniboone', 'anomalies', 'based', 'on', 'hnls', 'with', 'dipoleinduced', 'decays', 'are', 'found', 'to', 'be', 'severely', 'constrained', 'or', 'to', 'be', 'tested', 'in', 'the', 'future', 'experiments']] | [-0.032796035873257676, 0.2559714072226534, 0.0022789335507951993, 0.18046022079225865, -0.12526215818828682, -0.16392829655800803, 0.04699892295085051, 0.2984734011918936, -0.19867976683005034, -0.29310832740935744, -0.00017323089324095299, -0.3733656069271604, 0.0207509003681275, 0.19310325897187258, 0.08375841956979162, 0.05837953176339564, 0.10600007008302065, -0.057933772150033584, -0.04009916453005772, -0.2247291622932633, 0.26090825993147954, 0.12835262465277608, 0.26315466248968117, 0.121363285625219, 0.05537298401165098, -0.04979188167809797, -0.05025044616605286, -0.10961227474445609, -0.06655201051875287, 0.04556231377121638, 0.1944867743349931, 0.18433030898449942, 0.04731976111217822, -0.46064341960238736, -0.15755807422101498, 0.18221536407437386, 0.1481733222780618, 0.060887826585315795, -0.11569627877947887, -0.4038237743538765, 0.047396479597115154, -0.20079060345822553, -0.11015675335132162, -0.028514305490370786, -0.10114227305494354, -0.04350594867309424, -0.34354243811193697, 0.061001732909369846, -0.10652006865383952, 0.008034624897999505, -0.02635176304373628, -0.21212908321939095, 0.007828239451529799, -0.03816451585005549, 0.19878732587758477, -0.017491507986691635, 0.16670321725131812, -0.16089074168531356, -0.1532445862294096, 0.4310049047938738, -0.11362291199424054, -0.09418154965666398, 0.15011488368183795, -0.2092230557964157, -0.11206755094463006, 0.10738683306664543, 0.22100291232509592, 0.028613552569188704, -0.21760573023667848, 0.10511289653491268, -0.061166193747801155, 0.11985532967390125, 0.10627388838403137, 0.011156040413354763, 0.30031663257035124, 0.2696986541022468, 0.026114148205854525, -0.019371402596654763, -0.1584377077549145, 0.0043010212010441634, -0.4038910534237774, -0.049418127485616525, -0.057183578127542586, 0.04385799271936699, 0.0032836605183342404, -0.05173350934883658, 0.37536090406471156, 0.1318810833093356, 0.21451215847382243, -0.0461993944621317, 0.34425292978666616, 0.03824153939078801, 0.07340319810720475, 0.00950356058671441, 0.37235357918002654, 0.12532543346308775, 0.15189787639882152, -0.2863462124524874, 0.009158923553424219, 0.046171753916522146] |
1,803.03263 | Cosmological Signatures of a Mirror Twin Higgs | We explore the cosmological signatures associated with the twin baryons,
electrons, photons and neutrinos in the Mirror Twin Higgs framework. We
consider a scenario in which the twin baryons constitute a subcomponent of dark
matter, and the contribution of the twin photon and neutrinos to dark radiation
is suppressed due to late asymmetric reheating, but remains large enough to be
detected in future cosmic microwave background (CMB) experiments. We show that
this framework can lead to distinctive signals in large scale structure and in
the cosmic microwave background. Baryon acoustic oscillations in the mirror
sector prior to recombination lead to a suppression of structure on large
scales, and leave a residual oscillatory pattern in the matter power spectrum.
This pattern depends sensitively on the relative abundances and ionization
energies of both twin hydrogen and helium, and is therefore characteristic of
this class of models. Although both mirror photons and neutrinos constitute
dark radiation in the early universe, their effects on the CMB are distinct.
This is because prior to recombination the twin neutrinos free stream, while
the twin photons are prevented from free streaming by scattering off twin
electrons. In the Mirror Twin Higgs framework the relative contributions of
these two species to the energy density in dark radiation is predicted, leading
to testable effects in the CMB. These highly distinctive cosmological
signatures may allow this class of models to be discovered, and distinguished
from more general dark sectors.
| hep-ph | we explore the cosmological signatures associated with the twin baryons electrons photons and neutrinos in the mirror twin higgs framework we consider a scenario in which the twin baryons constitute a subcomponent of dark matter and the contribution of the twin photon and neutrinos to dark radiation is suppressed due to late asymmetric reheating but remains large enough to be detected in future cosmic microwave background cmb experiments we show that this framework can lead to distinctive signals in large scale structure and in the cosmic microwave background baryon acoustic oscillations in the mirror sector prior to recombination lead to a suppression of structure on large scales and leave a residual oscillatory pattern in the matter power spectrum this pattern depends sensitively on the relative abundances and ionization energies of both twin hydrogen and helium and is therefore characteristic of this class of models although both mirror photons and neutrinos constitute dark radiation in the early universe their effects on the cmb are distinct this is because prior to recombination the twin neutrinos free stream while the twin photons are prevented from free streaming by scattering off twin electrons in the mirror twin higgs framework the relative contributions of these two species to the energy density in dark radiation is predicted leading to testable effects in the cmb these highly distinctive cosmological signatures may allow this class of models to be discovered and distinguished from more general dark sectors | [['we', 'explore', 'the', 'cosmological', 'signatures', 'associated', 'with', 'the', 'twin', 'baryons', 'electrons', 'photons', 'and', 'neutrinos', 'in', 'the', 'mirror', 'twin', 'higgs', 'framework', 'we', 'consider', 'a', 'scenario', 'in', 'which', 'the', 'twin', 'baryons', 'constitute', 'a', 'subcomponent', 'of', 'dark', 'matter', 'and', 'the', 'contribution', 'of', 'the', 'twin', 'photon', 'and', 'neutrinos', 'to', 'dark', 'radiation', 'is', 'suppressed', 'due', 'to', 'late', 'asymmetric', 'reheating', 'but', 'remains', 'large', 'enough', 'to', 'be', 'detected', 'in', 'future', 'cosmic', 'microwave', 'background', 'cmb', 'experiments', 'we', 'show', 'that', 'this', 'framework', 'can', 'lead', 'to', 'distinctive', 'signals', 'in', 'large', 'scale', 'structure', 'and', 'in', 'the', 'cosmic', 'microwave', 'background', 'baryon', 'acoustic', 'oscillations', 'in', 'the', 'mirror', 'sector', 'prior', 'to', 'recombination', 'lead', 'to', 'a', 'suppression', 'of', 'structure', 'on', 'large', 'scales', 'and', 'leave', 'a', 'residual', 'oscillatory', 'pattern', 'in', 'the', 'matter', 'power', 'spectrum', 'this', 'pattern', 'depends', 'sensitively', 'on', 'the', 'relative', 'abundances', 'and', 'ionization', 'energies', 'of', 'both', 'twin', 'hydrogen', 'and', 'helium', 'and', 'is', 'therefore', 'characteristic', 'of', 'this', 'class', 'of', 'models', 'although', 'both', 'mirror', 'photons', 'and', 'neutrinos', 'constitute', 'dark', 'radiation', 'in', 'the', 'early', 'universe', 'their', 'effects', 'on', 'the', 'cmb', 'are', 'distinct', 'this', 'is', 'because', 'prior', 'to', 'recombination', 'the', 'twin', 'neutrinos', 'free', 'stream', 'while', 'the', 'twin', 'photons', 'are', 'prevented', 'from', 'free', 'streaming', 'by', 'scattering', 'off', 'twin', 'electrons', 'in', 'the', 'mirror', 'twin', 'higgs', 'framework', 'the', 'relative', 'contributions', 'of', 'these', 'two', 'species', 'to', 'the', 'energy', 'density', 'in', 'dark', 'radiation', 'is', 'predicted', 'leading', 'to', 'testable', 'effects', 'in', 'the', 'cmb', 'these', 'highly', 'distinctive', 'cosmological', 'signatures', 'may', 'allow', 'this', 'class', 'of', 'models', 'to', 'be', 'discovered', 'and', 'distinguished', 'from', 'more', 'general', 'dark', 'sectors']] | [-0.10856038262477245, 0.25393072429607977, -0.0955976028303191, 0.15711830807099642, -0.08634180016036314, -0.10344844054972371, -0.02130272003693436, 0.3291151576313077, -0.2584663156564172, -0.3538670568477565, 0.00982004841136898, -0.2894478843481159, -0.023370359330652398, 0.1669679016778908, 0.008358217908311089, -0.03578413277085107, 0.022460158767225416, -0.013233520181179358, 0.019634658253993294, -0.21290020574036223, 0.33054765047521084, 0.12675642261523207, 0.26284122093732637, 0.055065782372469556, 0.06419872670633149, -0.07520556679505964, -0.07572975789613741, -0.04722978611463081, -0.07613039236558015, 0.07333753189017458, 0.19144097837721408, 0.09398870591939307, 0.1396536153408009, -0.4485495657071658, -0.22388614561588008, 0.20958928824850517, 0.14923748826007963, 0.16782288851896418, -0.1020524457424502, -0.2826875454929334, 0.045756366761220094, -0.15097273835156377, -0.10953731199913506, -0.0012144470571785792, -0.0545488210418359, -0.03768296098306378, -0.2421130865669096, 0.12118674208951732, -0.013153958615297003, -0.05163332278875315, -0.04158018295025788, -0.07891714902912271, -0.02125363790130079, 0.01589925939248384, 0.12151382486852252, -0.019119576751702626, 0.16096308736995674, -0.18356621633556566, -0.07708993168921838, 0.4259855487543669, -0.12512226307216182, -0.09714108893977065, 0.185434082458692, -0.20903139348067812, -0.141815860549214, 0.15605674117168403, 0.1804174318267656, 0.07323073349475655, -0.10654011417887073, 0.0807003190104799, 0.009430192404613678, 0.16798441466060954, 0.10075746814400799, 0.08081025368544745, 0.36745835114348385, 0.13919259263806544, 0.024027066837672813, 0.06035025038553799, -0.1270027772660336, -0.015635582363178416, -0.32890239666643745, -0.10386687083847852, -0.12012362119324786, 0.020023372314605378, -0.054994229526745125, -0.15576435765251517, 0.4127555973009522, 0.12341386702756307, 0.21384310174760676, -0.039677957206804726, 0.31151244490286606, 0.03888158215707651, 0.05680220696206154, 0.0426644975237673, 0.3242053082017968, 0.14311946512815624, 0.09444197061058586, -0.26841882798064765, 0.012263873463426424, -0.023846782494538997] |
1,803.03264 | Search for Boosted Dark Matter at ProtoDUNE | We propose the first experimental test of the inelastic boosted dark matter
hypothesis, capitalizing on the new physics potential with the imminent data
taking of the ProtoDUNE detectors. More specifically, we explore various
experimental signatures at the cosmic frontier, arising in boosted dark matter
scenarios, i.e., relativistic, inelastic scattering of boosted dark matter
often created by the annihilation of its heavier component which usually
comprises of the dominant relic abundance. Although features are unique enough
to isolate signal events from potential backgrounds, vetoing a vast amount of
cosmic background is rather challenging as the detectors are located on the
ground. We argue, with a careful estimate, that such backgrounds nevertheless
can be well under control by performing dedicated analyses after data
acquisition. We then discuss some phenomenological studies which can be
achieved with ProtoDUNE, employing a dark photon scenario as our benchmark
dark-sector model.
| hep-ph hep-ex | we propose the first experimental test of the inelastic boosted dark matter hypothesis capitalizing on the new physics potential with the imminent data taking of the protodune detectors more specifically we explore various experimental signatures at the cosmic frontier arising in boosted dark matter scenarios ie relativistic inelastic scattering of boosted dark matter often created by the annihilation of its heavier component which usually comprises of the dominant relic abundance although features are unique enough to isolate signal events from potential backgrounds vetoing a vast amount of cosmic background is rather challenging as the detectors are located on the ground we argue with a careful estimate that such backgrounds nevertheless can be well under control by performing dedicated analyses after data acquisition we then discuss some phenomenological studies which can be achieved with protodune employing a dark photon scenario as our benchmark darksector model | [['we', 'propose', 'the', 'first', 'experimental', 'test', 'of', 'the', 'inelastic', 'boosted', 'dark', 'matter', 'hypothesis', 'capitalizing', 'on', 'the', 'new', 'physics', 'potential', 'with', 'the', 'imminent', 'data', 'taking', 'of', 'the', 'protodune', 'detectors', 'more', 'specifically', 'we', 'explore', 'various', 'experimental', 'signatures', 'at', 'the', 'cosmic', 'frontier', 'arising', 'in', 'boosted', 'dark', 'matter', 'scenarios', 'ie', 'relativistic', 'inelastic', 'scattering', 'of', 'boosted', 'dark', 'matter', 'often', 'created', 'by', 'the', 'annihilation', 'of', 'its', 'heavier', 'component', 'which', 'usually', 'comprises', 'of', 'the', 'dominant', 'relic', 'abundance', 'although', 'features', 'are', 'unique', 'enough', 'to', 'isolate', 'signal', 'events', 'from', 'potential', 'backgrounds', 'vetoing', 'a', 'vast', 'amount', 'of', 'cosmic', 'background', 'is', 'rather', 'challenging', 'as', 'the', 'detectors', 'are', 'located', 'on', 'the', 'ground', 'we', 'argue', 'with', 'a', 'careful', 'estimate', 'that', 'such', 'backgrounds', 'nevertheless', 'can', 'be', 'well', 'under', 'control', 'by', 'performing', 'dedicated', 'analyses', 'after', 'data', 'acquisition', 'we', 'then', 'discuss', 'some', 'phenomenological', 'studies', 'which', 'can', 'be', 'achieved', 'with', 'protodune', 'employing', 'a', 'dark', 'photon', 'scenario', 'as', 'our', 'benchmark', 'darksector', 'model']] | [-0.07844690788786263, 0.1680743245637536, -0.12107533840430228, 0.12693265173341692, -0.08993006175296614, -0.12428196154198506, 0.008581749664800655, 0.3297892569454335, -0.22965855990898693, -0.37452128746210495, 0.065152410047934, -0.3136710654200417, -0.043648389942973154, 0.20571444695007005, 0.04146722863030542, 0.04563552978935251, 0.08143874984388175, 0.01679769974240723, -0.03741292808909849, -0.22992758488463652, 0.32013973848127836, 0.12508493398005763, 0.2584903897546206, 0.04956978332605407, 0.07814218022879989, 0.002455828355677012, -0.10117748082686578, -0.015719655034546223, -0.08170845496619626, 0.0737309158333422, 0.243752588784749, 0.1580330134020187, 0.17188359616420712, -0.45197143903674764, -0.24763235276623163, 0.17584335954193697, 0.15567788571125776, 0.11205828504009535, -0.12827310465753625, -0.3480791453880051, 0.05947419009559477, -0.19249960273090336, -0.09226676457587422, -0.07441921484456139, -0.06761939350205164, -0.008928847279296152, -0.2461384755968336, 0.08843698707722877, -0.03616231586703281, -0.04279856269972192, -0.04258165865030605, -0.11284880002656589, -0.00104761881731166, 0.01731975457288273, 0.09805253506056033, -0.012619003626039356, 0.20165417293254803, -0.22014846838363963, -0.11435307532196425, 0.40649659582413733, -0.0964805317344144, -0.12788164113104963, 0.2094045940870678, -0.12395237140460974, -0.16929655483949724, 0.13956072210890447, 0.19272399375525615, 0.08719370126103361, -0.1814285670051403, 0.08117262127699279, -0.005738100082251347, 0.16286002079141326, 0.043267824082350775, 0.056868366340091195, 0.3198502216740356, 0.24822207460884885, 0.018681983133622754, 0.09548176477740829, -0.1719739054901513, -0.03189981941896905, -0.349119753350452, -0.0820384445768367, -0.12396299181596583, 0.026030829654903047, -0.03526625865358963, -0.10576822381052706, 0.33942464675702566, 0.14789660552762346, 0.21052882063991596, -0.030379919640836306, 0.33164151248315143, 0.048632208979850274, 0.05279508062004526, 0.015274001124554262, 0.3175202990898672, 0.07123363402302453, 0.0814397655105697, -0.17847853026372226, 0.04067942458237263, -0.043212680139630616] |
1,803.03265 | A unified model for tidal disruption events | In the past few years wide-field optical and UV transient surveys as well as
X-ray telescopes have allowed us to identify a few dozen candidate tidal
disruption events (TDEs). While in theory the physical processes in TDEs are
expected to be ubiquitous, a few distinct classes of TDEs have been observed.
Some TDEs radiate mainly in NUV/optical while others produce prominent X-rays.
Moreover, relativistic jets have been observed in only a handful of TDEs. This
diversity might be related to the details of the super-Eddington accretion and
emission physics relevant to TDE disks. In this Letter, we utilize novel
three-dimensional general relativistic radiation magnetohydrodynamics
simulations to study the super-Eddington compact disk phase expected in TDEs.
Consistent with previous studies, geometrically thick disks, wide-angle
optically-thick fast outflows and relativistic jets are produced. The outflow
density and velocity depend sensitively on the inclination angle, and hence so
does the reprocessing of emission produced from the inner disk. We then use
Monte-Carlo radiative transfer to calculate the reprocessed spectra and find
that that the observed ratio of optical to X-ray fluxes increases with
increasing inclination angle. This naturally leads to a unified model for
different classes of TDEs in which the spectral properties of the TDE depend
mainly on the viewing-angle of the observer with respect to the orientation of
the disk.
| astro-ph.HE | in the past few years widefield optical and uv transient surveys as well as xray telescopes have allowed us to identify a few dozen candidate tidal disruption events tdes while in theory the physical processes in tdes are expected to be ubiquitous a few distinct classes of tdes have been observed some tdes radiate mainly in nuvoptical while others produce prominent xrays moreover relativistic jets have been observed in only a handful of tdes this diversity might be related to the details of the supereddington accretion and emission physics relevant to tde disks in this letter we utilize novel threedimensional general relativistic radiation magnetohydrodynamics simulations to study the supereddington compact disk phase expected in tdes consistent with previous studies geometrically thick disks wideangle opticallythick fast outflows and relativistic jets are produced the outflow density and velocity depend sensitively on the inclination angle and hence so does the reprocessing of emission produced from the inner disk we then use montecarlo radiative transfer to calculate the reprocessed spectra and find that that the observed ratio of optical to xray fluxes increases with increasing inclination angle this naturally leads to a unified model for different classes of tdes in which the spectral properties of the tde depend mainly on the viewingangle of the observer with respect to the orientation of the disk | [['in', 'the', 'past', 'few', 'years', 'widefield', 'optical', 'and', 'uv', 'transient', 'surveys', 'as', 'well', 'as', 'xray', 'telescopes', 'have', 'allowed', 'us', 'to', 'identify', 'a', 'few', 'dozen', 'candidate', 'tidal', 'disruption', 'events', 'tdes', 'while', 'in', 'theory', 'the', 'physical', 'processes', 'in', 'tdes', 'are', 'expected', 'to', 'be', 'ubiquitous', 'a', 'few', 'distinct', 'classes', 'of', 'tdes', 'have', 'been', 'observed', 'some', 'tdes', 'radiate', 'mainly', 'in', 'nuvoptical', 'while', 'others', 'produce', 'prominent', 'xrays', 'moreover', 'relativistic', 'jets', 'have', 'been', 'observed', 'in', 'only', 'a', 'handful', 'of', 'tdes', 'this', 'diversity', 'might', 'be', 'related', 'to', 'the', 'details', 'of', 'the', 'supereddington', 'accretion', 'and', 'emission', 'physics', 'relevant', 'to', 'tde', 'disks', 'in', 'this', 'letter', 'we', 'utilize', 'novel', 'threedimensional', 'general', 'relativistic', 'radiation', 'magnetohydrodynamics', 'simulations', 'to', 'study', 'the', 'supereddington', 'compact', 'disk', 'phase', 'expected', 'in', 'tdes', 'consistent', 'with', 'previous', 'studies', 'geometrically', 'thick', 'disks', 'wideangle', 'opticallythick', 'fast', 'outflows', 'and', 'relativistic', 'jets', 'are', 'produced', 'the', 'outflow', 'density', 'and', 'velocity', 'depend', 'sensitively', 'on', 'the', 'inclination', 'angle', 'and', 'hence', 'so', 'does', 'the', 'reprocessing', 'of', 'emission', 'produced', 'from', 'the', 'inner', 'disk', 'we', 'then', 'use', 'montecarlo', 'radiative', 'transfer', 'to', 'calculate', 'the', 'reprocessed', 'spectra', 'and', 'find', 'that', 'that', 'the', 'observed', 'ratio', 'of', 'optical', 'to', 'xray', 'fluxes', 'increases', 'with', 'increasing', 'inclination', 'angle', 'this', 'naturally', 'leads', 'to', 'a', 'unified', 'model', 'for', 'different', 'classes', 'of', 'tdes', 'in', 'which', 'the', 'spectral', 'properties', 'of', 'the', 'tde', 'depend', 'mainly', 'on', 'the', 'viewingangle', 'of', 'the', 'observer', 'with', 'respect', 'to', 'the', 'orientation', 'of', 'the', 'disk']] | [-0.07624989075556432, 0.1258830881919967, -0.039594780772788336, 0.14574780553041375, -0.1300810143504649, -0.08964678152867266, -0.01171018847489738, 0.4561342973162135, -0.20697398169910255, -0.3352625513213823, 0.06548420264338863, -0.2879453406129117, -0.033858559757777275, 0.2351172859791122, -0.042742303187733505, 0.016170835104392475, 0.04038280501087796, -0.10353557667248461, -0.058445532119420426, -0.20438315015983635, 0.29504521674429784, 0.11495164351975842, 0.13634994892046265, -0.016663511547357797, 0.04436057678861841, -0.07066885964678107, -0.07076846274917256, 0.005228359741265099, -0.15190605452045272, 0.04296793796113569, 0.22100271249708792, 0.09856206936693696, 0.18954575507086702, -0.4237029132949928, -0.2625807571271647, 0.060024257602603874, 0.19621018475329835, 0.04321064531418269, -0.06393121094995743, -0.21706097033385136, 0.035002097683069916, -0.2509602052053292, -0.14217260726366074, 0.01905248813558642, 0.04737866437275252, 0.057216265944070276, -0.2157986705238212, 0.08599621216132897, 0.03905620688325874, 0.03591161316524358, -0.08314639195102398, -0.02354637691145125, -0.05907636292684891, 0.047294836453604404, 0.12656083611556707, 0.03996127126440746, 0.20609494046091217, -0.13966455985685666, -0.10115345361213025, 0.40057457482854764, -0.025279432071636528, -0.027773492442248346, 0.25807825989965943, -0.25402350788914757, -0.1640190886123346, 0.23744896298793217, 0.21361873284424548, 0.1646609199531036, -0.13493226942091704, -0.02333778970647331, -0.047413348101747126, 0.16725810320801252, 0.035038197554486325, 0.10698302346201971, 0.34617966979733544, 0.07437823491317717, -0.02882495167299459, 0.11872252025301291, -0.19354850956298342, -0.04315493765104239, -0.2530923712165116, -0.07252562046795233, -0.12476433549218781, 0.11399938844141155, -0.07171850292329447, -0.14670687597101453, 0.34999943647287, 0.13808816201284796, 0.22097215261395392, -0.006963530122032697, 0.3105456436384622, 0.0916916577392109, 0.10986480597176984, 0.1265362024500745, 0.3841688590817691, 0.12075129987222258, 0.08972554336970175, -0.22441010327571706, 0.09922631640629376, 0.0030558662899433887] |
1,803.03266 | Dark halos around neutron stars and gravitational waves | We find that a class of models of MeV-GeV dark matter in which dark matter
interacts strongly can be constrained by the observation of gravitational waves
from neutron star mergers. Trace amounts of dark matter, either produced during
the supernova or accreted later, can alter the structure of neutron stars and
influence their tidal polarizability. We focus on models of dark matter
interacting by the exchange of light vector gauge bosons that couple to a
conserved dark charge. In these models, dark matter accumulated in neutron
stars can extend to large radii and enhance their tidal polarizability.
Gravitational waves detected from the first binary neutron star merger GW170817
places useful constraints on such not-so compact objects. Dark halos, if
present, also predict a greater variability of neutron star tidal
polarizabilities than expected for ordinary neutron stars.
| hep-ph | we find that a class of models of mevgev dark matter in which dark matter interacts strongly can be constrained by the observation of gravitational waves from neutron star mergers trace amounts of dark matter either produced during the supernova or accreted later can alter the structure of neutron stars and influence their tidal polarizability we focus on models of dark matter interacting by the exchange of light vector gauge bosons that couple to a conserved dark charge in these models dark matter accumulated in neutron stars can extend to large radii and enhance their tidal polarizability gravitational waves detected from the first binary neutron star merger gw170817 places useful constraints on such notso compact objects dark halos if present also predict a greater variability of neutron star tidal polarizabilities than expected for ordinary neutron stars | [['we', 'find', 'that', 'a', 'class', 'of', 'models', 'of', 'mevgev', 'dark', 'matter', 'in', 'which', 'dark', 'matter', 'interacts', 'strongly', 'can', 'be', 'constrained', 'by', 'the', 'observation', 'of', 'gravitational', 'waves', 'from', 'neutron', 'star', 'mergers', 'trace', 'amounts', 'of', 'dark', 'matter', 'either', 'produced', 'during', 'the', 'supernova', 'or', 'accreted', 'later', 'can', 'alter', 'the', 'structure', 'of', 'neutron', 'stars', 'and', 'influence', 'their', 'tidal', 'polarizability', 'we', 'focus', 'on', 'models', 'of', 'dark', 'matter', 'interacting', 'by', 'the', 'exchange', 'of', 'light', 'vector', 'gauge', 'bosons', 'that', 'couple', 'to', 'a', 'conserved', 'dark', 'charge', 'in', 'these', 'models', 'dark', 'matter', 'accumulated', 'in', 'neutron', 'stars', 'can', 'extend', 'to', 'large', 'radii', 'and', 'enhance', 'their', 'tidal', 'polarizability', 'gravitational', 'waves', 'detected', 'from', 'the', 'first', 'binary', 'neutron', 'star', 'merger', 'gw170817', 'places', 'useful', 'constraints', 'on', 'such', 'notso', 'compact', 'objects', 'dark', 'halos', 'if', 'present', 'also', 'predict', 'a', 'greater', 'variability', 'of', 'neutron', 'star', 'tidal', 'polarizabilities', 'than', 'expected', 'for', 'ordinary', 'neutron', 'stars']] | [-0.11897418407585333, 0.24520591306672604, -0.11938656611299073, 0.17871597100877099, -0.20339628197252752, -0.03030718485997231, 0.0006451114270560167, 0.31536941420700815, -0.18019861839366733, -0.3702843568874178, -0.035873967106454074, -0.30985585139305505, -0.007865338032651279, 0.17775595993734897, 0.05661173058604753, -0.046294964158355635, 0.08809010873169258, 0.05304770726641571, -0.07431101194341426, -0.27273567101952656, 0.3573721150824524, 0.035098786807308595, 0.08706481609217546, -0.005812602034873432, 0.06996189555222238, -0.02517514783475134, -0.06217746528348437, -0.06737428313052213, -0.13187474405308927, 0.026601396642487358, 0.20899247715960545, 0.14060076343292302, 0.122135812882334, -0.49606548304911013, -0.2658913245079694, 0.1711174074198223, 0.1749216709079014, 0.08729735224731956, -0.1258715966699162, -0.3435409562981308, 0.056595886757390364, -0.3127113834489137, -0.11714458508779191, -0.01014927476644516, 0.03793367578613537, 0.07148762241143872, -0.19939484398820678, 0.13941244360952018, 0.01451854225144618, -0.08450237088319328, -0.15572270723749643, -0.10155083371619522, -0.0471689755131525, -0.04251021804046576, 0.11058562563180371, 0.03592882665150143, 0.2651045481467413, -0.23392440778272294, -0.03930096263842036, 0.4431023485889589, -0.13542345057605956, -0.07440271069882093, 0.19482516738827582, -0.20099124553164952, -0.16903409893727964, 0.15918390464589552, 0.20865752837379223, 0.16844942904318924, -0.14597701992606743, 0.0053084868463446145, 0.0049845101924061224, 0.2290725291396181, 0.09611359093062304, 0.059965903935274886, 0.5094959024270928, 0.15371431161270097, 0.0057926344926710486, 0.0535508506629547, -0.15698055269679537, -0.0054602020178680065, -0.24574318401239537, -0.08096523085755676, -0.15675919445714465, 0.061449428398541554, -0.09371908193225627, -0.09201797006427552, 0.28867309401846597, 0.07232603401083637, 0.10854541626931341, -0.015235761215875823, 0.28993435125384065, 0.05494815601656834, 0.07734865841662718, 0.06712183498742956, 0.38147838506330217, 0.22571779849283674, 0.07222020106252144, -0.27797763728433184, 0.04075767534129598, -0.025228631965540073] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.