id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0176 | Motion and collision of particles in rotating linear dilaton black hole | We study the motion of particles in the background of a four-dimensional
linear dilaton black hole. We solve analytically the equations of motion of the
test particles and we describe their motion. We show that the dilaton black
hole acts as a particle accelerator by analyzing the energy in the center of
mass (CM) frame of two colliding particles in the vicinity of its horizon. In
particular we find that there is a critical value of the angular momentum,
which depends on the string coupling, and a particle with this critical angular
momentum can reach the inner horizon with an arbitrarily high CM energy. This
is known as the Ba\~nados, Silk and West (BSW) process. We also show that the
motion and collisions of particles have a similar behavior to the
three-dimensional BTZ black hole. In fact, the photons can plunge into the
horizon or escape to infinity, and they can not be deflected, while for massive
particles there are no confined orbits of first kind, like planetary or
circular orbits.
| gr-qc hep-th | we study the motion of particles in the background of a fourdimensional linear dilaton black hole we solve analytically the equations of motion of the test particles and we describe their motion we show that the dilaton black hole acts as a particle accelerator by analyzing the energy in the center of mass cm frame of two colliding particles in the vicinity of its horizon in particular we find that there is a critical value of the angular momentum which depends on the string coupling and a particle with this critical angular momentum can reach the inner horizon with an arbitrarily high cm energy this is known as the banados silk and west bsw process we also show that the motion and collisions of particles have a similar behavior to the threedimensional btz black hole in fact the photons can plunge into the horizon or escape to infinity and they can not be deflected while for massive particles there are no confined orbits of first kind like planetary or circular orbits | [['we', 'study', 'the', 'motion', 'of', 'particles', 'in', 'the', 'background', 'of', 'a', 'fourdimensional', 'linear', 'dilaton', 'black', 'hole', 'we', 'solve', 'analytically', 'the', 'equations', 'of', 'motion', 'of', 'the', 'test', 'particles', 'and', 'we', 'describe', 'their', 'motion', 'we', 'show', 'that', 'the', 'dilaton', 'black', 'hole', 'acts', 'as', 'a', 'particle', 'accelerator', 'by', 'analyzing', 'the', 'energy', 'in', 'the', 'center', 'of', 'mass', 'cm', 'frame', 'of', 'two', 'colliding', 'particles', 'in', 'the', 'vicinity', 'of', 'its', 'horizon', 'in', 'particular', 'we', 'find', 'that', 'there', 'is', 'a', 'critical', 'value', 'of', 'the', 'angular', 'momentum', 'which', 'depends', 'on', 'the', 'string', 'coupling', 'and', 'a', 'particle', 'with', 'this', 'critical', 'angular', 'momentum', 'can', 'reach', 'the', 'inner', 'horizon', 'with', 'an', 'arbitrarily', 'high', 'cm', 'energy', 'this', 'is', 'known', 'as', 'the', 'banados', 'silk', 'and', 'west', 'bsw', 'process', 'we', 'also', 'show', 'that', 'the', 'motion', 'and', 'collisions', 'of', 'particles', 'have', 'a', 'similar', 'behavior', 'to', 'the', 'threedimensional', 'btz', 'black', 'hole', 'in', 'fact', 'the', 'photons', 'can', 'plunge', 'into', 'the', 'horizon', 'or', 'escape', 'to', 'infinity', 'and', 'they', 'can', 'not', 'be', 'deflected', 'while', 'for', 'massive', 'particles', 'there', 'are', 'no', 'confined', 'orbits', 'of', 'first', 'kind', 'like', 'planetary', 'or', 'circular', 'orbits']] | [-0.1438402745230069, 0.18023448505608042, -0.09249717301153987, 0.0748355023387115, -0.06404621692167388, -0.0998700873120225, -0.023462482128967666, 0.32677796574402057, -0.2085207789014393, -0.30391374809431915, 0.07617550336943711, -0.3125011397448058, -0.07011868553345053, 0.1798263839459624, -0.04089392913670187, 0.032901496370118764, 0.048635366710436626, 0.07147830269539086, -0.05401789180713853, -0.18453821209286564, 0.33727058573838387, 0.11008406978519905, 0.17703517706797878, 0.03862273597229294, 0.1575167780018368, 0.02088902695703576, 0.04666255612187741, 0.06028048230310608, -0.1473704420257076, 0.05333053806067543, 0.17922348770372876, 0.08458704904555098, 0.2090821047667523, -0.4026676284595888, -0.18595660043259463, 0.1114527985122741, 0.21563076535348744, 0.14693086810630598, -0.09564710755720844, -0.26567654847575906, 0.055650013057128335, -0.19371372223995104, -0.186426443088669, 0.005279575307085587, 0.06582368191124664, 0.009753339440215988, -0.20067356534748834, 0.10185817196507045, 0.0877832231433158, -0.05090931077536784, -0.10207066445118525, -0.02997886195059931, -0.0708702563319072, 0.09206835064514164, 0.13889876295453227, 0.018547568316380793, 0.21542351613398533, -0.13500666441239298, -0.11110153507539317, 0.39444080632376044, -0.0421738542659938, -0.21760915723569385, 0.20142906622577197, -0.2553213006430115, -0.07456995509918889, 0.1410380728019957, 0.2113859020228013, 0.16745805798223712, -0.12876016678756963, 0.11472522553256631, -0.031761335119147575, 0.14179494417931515, 0.13579866570170032, 0.020007828628366583, 0.34921734509390523, 0.1192198477628265, 0.05117012708099308, 0.14563184297896856, -0.12362415328137141, -0.09664352074924486, -0.3085733084661657, -0.17903548155568147, -0.1562985670929829, 0.06937586295574003, -0.12858587951079073, -0.1382075328929949, 0.3284210191484083, 0.11332683652715637, 0.23302958159549544, 0.002931012358783325, 0.24795629873760153, 0.1154022360920405, 0.04615673406508462, 0.13895541087490076, 0.34907304883896434, 0.07161880364745027, 0.13063927009914136, -0.25541551512385563, -0.06327663296602165, 0.052976196347218424] |
1,802.01761 | Nonequilibrium theory of the conversion-efficiency limit of solar cells
including thermalization and extraction of carriers | The ideal solar cell conversion efficiency limit known as the
Shockley-Queisser (SQ) limit, which is based on a detailed balance between
absorption and radiation, has long been a target for solar cell researchers.
While the theory for this limit uses several assumptions, the requirements in
real devices have not been discussed fully. Given the current situation in
which research-level cell efficiencies are approaching the SQ limit, a
quantitative argument with regard to these requirements is worthwhile in terms
of understanding of the remaining loss mechanisms in current devices and the
device characteristics of solar cells that are operating outside the detailed
balance conditions. Here we examine two basic assumptions: (1) that the
photo-generated carriers lose their kinetic energy via phonon emission in a
moment (fast thermalization), and (2) that the photo-generated carriers are
extracted into carrier reservoirs in a moment (fast extraction). Using a model
that accounts for the carrier relaxation and extraction dynamics, we
reformulate the nonequilibrium theory for solar cells in a manner that covers
both the equilibrium and nonequilibrium regimes. Using a simple planar solar
cell as an example, we address the parameter regime in terms of the carrier
extraction time and then consider where the conventional SQ theory applies and
what could happen outside the applicable range.
| physics.app-ph cond-mat.mes-hall | the ideal solar cell conversion efficiency limit known as the shockleyqueisser sq limit which is based on a detailed balance between absorption and radiation has long been a target for solar cell researchers while the theory for this limit uses several assumptions the requirements in real devices have not been discussed fully given the current situation in which researchlevel cell efficiencies are approaching the sq limit a quantitative argument with regard to these requirements is worthwhile in terms of understanding of the remaining loss mechanisms in current devices and the device characteristics of solar cells that are operating outside the detailed balance conditions here we examine two basic assumptions 1 that the photogenerated carriers lose their kinetic energy via phonon emission in a moment fast thermalization and 2 that the photogenerated carriers are extracted into carrier reservoirs in a moment fast extraction using a model that accounts for the carrier relaxation and extraction dynamics we reformulate the nonequilibrium theory for solar cells in a manner that covers both the equilibrium and nonequilibrium regimes using a simple planar solar cell as an example we address the parameter regime in terms of the carrier extraction time and then consider where the conventional sq theory applies and what could happen outside the applicable range | [['the', 'ideal', 'solar', 'cell', 'conversion', 'efficiency', 'limit', 'known', 'as', 'the', 'shockleyqueisser', 'sq', 'limit', 'which', 'is', 'based', 'on', 'a', 'detailed', 'balance', 'between', 'absorption', 'and', 'radiation', 'has', 'long', 'been', 'a', 'target', 'for', 'solar', 'cell', 'researchers', 'while', 'the', 'theory', 'for', 'this', 'limit', 'uses', 'several', 'assumptions', 'the', 'requirements', 'in', 'real', 'devices', 'have', 'not', 'been', 'discussed', 'fully', 'given', 'the', 'current', 'situation', 'in', 'which', 'researchlevel', 'cell', 'efficiencies', 'are', 'approaching', 'the', 'sq', 'limit', 'a', 'quantitative', 'argument', 'with', 'regard', 'to', 'these', 'requirements', 'is', 'worthwhile', 'in', 'terms', 'of', 'understanding', 'of', 'the', 'remaining', 'loss', 'mechanisms', 'in', 'current', 'devices', 'and', 'the', 'device', 'characteristics', 'of', 'solar', 'cells', 'that', 'are', 'operating', 'outside', 'the', 'detailed', 'balance', 'conditions', 'here', 'we', 'examine', 'two', 'basic', 'assumptions', '1', 'that', 'the', 'photogenerated', 'carriers', 'lose', 'their', 'kinetic', 'energy', 'via', 'phonon', 'emission', 'in', 'a', 'moment', 'fast', 'thermalization', 'and', '2', 'that', 'the', 'photogenerated', 'carriers', 'are', 'extracted', 'into', 'carrier', 'reservoirs', 'in', 'a', 'moment', 'fast', 'extraction', 'using', 'a', 'model', 'that', 'accounts', 'for', 'the', 'carrier', 'relaxation', 'and', 'extraction', 'dynamics', 'we', 'reformulate', 'the', 'nonequilibrium', 'theory', 'for', 'solar', 'cells', 'in', 'a', 'manner', 'that', 'covers', 'both', 'the', 'equilibrium', 'and', 'nonequilibrium', 'regimes', 'using', 'a', 'simple', 'planar', 'solar', 'cell', 'as', 'an', 'example', 'we', 'address', 'the', 'parameter', 'regime', 'in', 'terms', 'of', 'the', 'carrier', 'extraction', 'time', 'and', 'then', 'consider', 'where', 'the', 'conventional', 'sq', 'theory', 'applies', 'and', 'what', 'could', 'happen', 'outside', 'the', 'applicable', 'range']] | [-0.0970122648239736, 0.1401661617568417, -0.03573226593478949, 0.06951417181457689, -0.015985829222691355, -0.11146001077711723, 0.09461973225190282, 0.35283451037419633, -0.24040849835024838, -0.2886697682430659, 0.0778984826486293, -0.26078039474599946, -0.11745081948760844, 0.22214631987316313, -0.054063751969168676, 0.009679523511277733, 0.03217732209118604, -0.004433711664089094, -0.03111348596569239, -0.1753740611009441, 0.2425100522786732, 0.055444706493979805, 0.32043046222876104, 0.08940802034326074, 0.10745337644980346, -0.01367448222320262, 0.03634380455770512, 0.02225481665591705, -0.13624951754610734, 0.09245783652695364, 0.2534130504553458, 0.08860631070819229, 0.2597335345968074, -0.4836552508740346, -0.268225655246579, 0.03654428312424747, 0.16581809003059467, 0.07196490292509651, -0.06139209629996499, -0.17354498580495398, 0.0848157228388872, -0.15790448482898703, -0.104961859109625, -0.05056062677402879, 0.018732013343060964, 0.05193326065854183, -0.2608216627196396, 0.07589859994938288, 0.07925657493004937, 0.04043340458318379, -0.08036676932899259, -0.0849819154968547, 0.005626082307795919, 0.16026375684180955, 0.024153047143062358, -0.02473025485405354, 0.20844568083751328, -0.1435975125048451, -0.08272453275910839, 0.3937239831851981, -0.040258960465688734, -0.1808096863521413, 0.20169667708599207, -0.17890828502059902, -0.09212053135386117, 0.1364283137579594, 0.1314523815093518, 0.12075493043902114, -0.20852116990604955, 0.08366559869835984, -0.009014642108849722, 0.15675443888617618, 0.06076515340621438, 0.08832255356682474, 0.22953833682877475, 0.20690868678944124, 0.046635722738174255, 0.09236753844739913, -0.12888735657562259, -0.1099155677208827, -0.27880247333528413, -0.15456894060632134, -0.16234418908376866, 0.08287205531101031, -0.0673683246921652, -0.12299015569407934, 0.4017188900649124, 0.16575021841463972, 0.17577333571124487, 0.014904290694805188, 0.30404721661272205, 0.13556990959964058, 0.05040325216564981, 0.057948498337825324, 0.26225890634775656, 0.12143454326193126, 0.14005151439912758, -0.23062457797068978, 0.04875172103503587, 0.04293071467570643] |
1,802.01762 | Low-lying zeros of cubic Dirichlet $L$-functions and the Ratios
Conjecture | We compute the one-level density for the family of cubic Dirichlet
$L$-functions when the support of the Fourier transform of a test function is
in $(-1,1)$. We also establish the Ratios conjecture prediction for the
one-level density for this family, and confirm that it agrees with the
one-level density we obtain.
| math.NT | we compute the onelevel density for the family of cubic dirichlet lfunctions when the support of the fourier transform of a test function is in 11 we also establish the ratios conjecture prediction for the onelevel density for this family and confirm that it agrees with the onelevel density we obtain | [['we', 'compute', 'the', 'onelevel', 'density', 'for', 'the', 'family', 'of', 'cubic', 'dirichlet', 'lfunctions', 'when', 'the', 'support', 'of', 'the', 'fourier', 'transform', 'of', 'a', 'test', 'function', 'is', 'in', '11', 'we', 'also', 'establish', 'the', 'ratios', 'conjecture', 'prediction', 'for', 'the', 'onelevel', 'density', 'for', 'this', 'family', 'and', 'confirm', 'that', 'it', 'agrees', 'with', 'the', 'onelevel', 'density', 'we', 'obtain']] | [-0.10675842981493357, 0.017053282856210775, -0.1321279144179368, 0.09912386279114906, 0.015610875050519026, -0.056593440756128696, 0.03303165568550136, 0.31415332181780947, -0.221683502872931, -0.2854269277304411, 0.0984377439713617, -0.2422893668168827, -0.14928226804762496, 0.18652419775140053, -0.010693221576694473, 0.1127597759386488, 0.0018478004974039162, 0.07806840067838922, -0.16312160963356934, -0.25159386077932283, 0.3356019633767359, -0.005428648042474307, 0.30215676994446444, 0.054538080441382, 0.02704993779679724, 0.018045621687847683, -0.010739314086808293, -0.06573808258947204, -0.16879564382700254, 0.17548181268149146, 0.2062146841530122, 0.07957726421619893, 0.22921179782818346, -0.36811600766126434, -0.19967942334729813, 0.11586544292924159, 0.10056880468904388, 0.06874952126778297, -0.03277272802284535, -0.21340284690114797, 0.14394347548630892, -0.1510093048507092, -0.21334207841359518, -0.11524558186019752, 0.00488713285063996, 0.08930390936495992, -0.35258329192212984, 0.13589773784955397, 0.02522897260153995, 0.019961505598735576, -0.12936357290977063, -0.1713900360662271, 0.03437966763900191, 0.043522992151373924, 0.036777364797707573, 0.018978525290959607, 0.03179961602733124, -0.09025989494323, -0.04809092831633547, 0.3161913086819992, -0.12977318901239948, -0.21572718800355992, 0.12891181262538715, -0.1974763978163109, -0.20608903484090285, 0.09226591416689403, 0.1273491480844278, 0.12167998285525862, -0.030378026345929624, 0.12663277143534893, -0.13331226988777736, 0.13461591464047337, 0.11383222637004127, -0.05891625388689777, 0.16809394276317427, 0.09177070937813352, 0.08286481805364876, 0.19331682540987635, -0.127302112413899, -0.07382670849306035, -0.30352516665908635, -0.24606680802489614, -0.24953182836008422, 0.0059332916531346595, -0.1185326497067638, -0.2194330172211516, 0.40837161060349614, 0.14136021962279782, 0.2332179214184483, 0.2148044518213354, 0.20781091556829565, 0.22011467238303786, 0.033770638463251734, 0.09330981769872938, 0.16008137553638102, 0.19155257843964385, -0.00015459678994089949, -0.21950177012887948, 0.017574030075076165, 0.1183713692760862] |
1,802.01763 | Simple networks on complex cellular automata: From de Bruijn diagrams to
jump-graphs | We overview networks which characterise dynamics in cellular automata. These
networks are derived from one-dimensional cellular automaton rules and global
states of the automaton evolution: de Bruijn diagrams, subsystem diagrams,
basins of attraction, and jump-graphs. These networks are used to understand
properties of spatially-extended dynamical systems: emergence of non-trivial
patterns, self-organisation, reversibility and chaos. Particular attention is
paid to networks determined by travelling self-localisations, or gliders.
| nlin.CG | we overview networks which characterise dynamics in cellular automata these networks are derived from onedimensional cellular automaton rules and global states of the automaton evolution de bruijn diagrams subsystem diagrams basins of attraction and jumpgraphs these networks are used to understand properties of spatiallyextended dynamical systems emergence of nontrivial patterns selforganisation reversibility and chaos particular attention is paid to networks determined by travelling selflocalisations or gliders | [['we', 'overview', 'networks', 'which', 'characterise', 'dynamics', 'in', 'cellular', 'automata', 'these', 'networks', 'are', 'derived', 'from', 'onedimensional', 'cellular', 'automaton', 'rules', 'and', 'global', 'states', 'of', 'the', 'automaton', 'evolution', 'de', 'bruijn', 'diagrams', 'subsystem', 'diagrams', 'basins', 'of', 'attraction', 'and', 'jumpgraphs', 'these', 'networks', 'are', 'used', 'to', 'understand', 'properties', 'of', 'spatiallyextended', 'dynamical', 'systems', 'emergence', 'of', 'nontrivial', 'patterns', 'selforganisation', 'reversibility', 'and', 'chaos', 'particular', 'attention', 'is', 'paid', 'to', 'networks', 'determined', 'by', 'travelling', 'selflocalisations', 'or', 'gliders']] | [-0.20479546536171256, 0.14973275402735453, -0.06494517871396965, 0.19143292211265361, -0.02672181365051074, -0.14422642244062445, 0.08297243581910152, 0.37001535565650556, -0.3202333408407867, -0.20661214872961864, 0.08056922382183984, -0.2450563200400211, -0.2704732607708138, 0.10900014850994921, -0.023644590692128986, 0.07666944403899834, 0.06862421323967283, 0.0038862560395500623, 0.039207202185934875, -0.18160311930114403, 0.33482675964478403, 0.023553875027573667, 0.33377023849243415, -0.046827446391034755, 0.04423545772442594, -0.07588074240629794, -0.04943948011714383, 0.029631472993060015, -0.17677374381310074, 0.11163416352337663, 0.27641978254541755, 0.16991610356490128, 0.19937048622523434, -0.48958570035756566, -0.27540322493587155, 0.19941600097808987, 0.1899406301381532, 0.12875484771757328, 0.06277144200430484, -0.36624576011672616, 0.06435754356789403, -0.1764302120282082, -0.13228924561553868, -0.11136829427414341, 0.06982010995852761, 0.12240333698719041, -0.1579847056455037, -0.009271317005186575, 0.09419045423192074, 0.12632742093410343, -0.03837096877396107, -0.04642767153563909, -0.11228058602500823, 0.1894923727704736, -0.0817392167118669, -0.08241999110759934, 0.1411198091955157, -0.13105849077692255, -0.22414736803330015, 0.3686960916093085, 0.00801800165027089, -0.16417497459906372, 0.27903550033443025, -0.0792290991084883, -0.15974337627994828, 0.18060592751862714, 0.18791047469130717, 0.021014183104853146, -0.19209730991860852, 0.0508470702015984, 0.012612937411176972, 0.1397375785049917, 0.09547645870770793, 0.09759784716879949, 0.22551244689384475, 0.21704304297963972, 0.038615525714703836, 0.1405956518719904, 0.0329412189012146, -0.25359104794915766, -0.1601690361276269, -0.07730951494158944, -0.10852545464149443, 0.03525121456186753, -0.034103813413139505, -0.20634213706944138, 0.3879835124826059, 0.09860770052910084, 0.11110552041964183, 0.11237251815873606, 0.16577866178704426, 0.0719762047592667, 0.03555278046405874, 0.0401539176600636, 0.11836827476508915, 0.19819746980283526, 0.1723483904679597, -0.24265245734204655, 0.06137467478401959, 0.1827802784391679] |
1,802.01764 | Simple zeros of automorphic $L$-functions | We prove that the complete $L$-function associated to any cuspidal
automorphic representation of $GL_2(\mathbb{A}_{\mathbb Q})$ has infinitely
many simple zeros.
| math.NT | we prove that the complete lfunction associated to any cuspidal automorphic representation of gl_2mathbba_mathbb q has infinitely many simple zeros | [['we', 'prove', 'that', 'the', 'complete', 'lfunction', 'associated', 'to', 'any', 'cuspidal', 'automorphic', 'representation', 'of', 'gl_2mathbba_mathbb', 'q', 'has', 'infinitely', 'many', 'simple', 'zeros']] | [-0.3170945483112806, -0.008244110859538379, -0.27997192867884513, 0.1022652750344653, -0.18742779309028074, -0.1588442864778795, -0.05758415392943119, 0.3041835987548295, -0.2590772288998491, -0.11344649227287032, 0.02198504683512606, -0.28059969764006765, -0.22069201182181897, 0.2384952840052153, -0.12495636092008729, 0.11764656144537423, 0.10393582245236949, 0.26228551292105723, -0.10888828487919741, -0.2906751454268631, 0.3888619293115641, -0.18032524636701533, 0.14512163221738056, 0.05286217623047138, 0.13116406104037245, 0.06231785087699169, 0.10158024365572553, -0.2774246082592167, -0.1045181522483625, 0.1438042713623298, 0.41476255473925877, 0.03432482112150051, 0.247503728262688, -0.39936088339278575, -0.12166854170592208, 0.43715524869529826, 0.2355891091651038, -0.07758463826030493, 0.03949517544702088, -0.21085980608078994, 0.16401419639097234, -0.21326541832010998, -0.27979210190671056, -0.17721354799639238, 0.10033159668704397, -0.006775823642352694, -0.2807611394673586, -0.008760074594695317, 0.14979506362425654, 0.2164848346851374, -0.08600179988302682, -0.2010699768648728, -0.031123710502135127, 0.06876695759006236, 0.06088677225144286, 0.07829136546014955, 0.03887813501550179, -0.17057905836324944, -0.10922603338564697, 0.24512135391858847, -0.00974278730389319, -0.2181581886191117, 0.10474013027391936, -0.2593507803976536, -0.2301600040181687, 0.2097656911140994, 0.05052936680026745, 0.07589657609596064, 0.019082583094898024, 0.24678248412122852, -0.23979153464499273, 0.07013187263357012, 0.21530565830241694, -0.1214409421296104, 0.20008351085217377, -0.06913032323906296, 0.0802909639192206, 0.1135786734521389, 0.07030393271155558, 0.014980660114241274, -0.3561129248455951, -0.1640827651870878, -0.16744270690373683, 0.16012895617045855, -0.1327396435663104, -0.24040933639595383, 0.4526813426300099, 0.10508227576256583, 0.2098970754366172, 0.1928020715223331, 0.1711935242147822, 0.1688680815461435, 0.08950312469938868, 0.1386075172769396, 0.017556832147468077, 0.21450499249132057, -0.11650096115313079, -0.08232477204383988, -0.0020176007191797622, 0.17054503058132373] |
1,802.01765 | Training Generative Adversarial Networks via Primal-Dual Subgradient
Methods: A Lagrangian Perspective on GAN | We relate the minimax game of generative adversarial networks (GANs) to
finding the saddle points of the Lagrangian function for a convex optimization
problem, where the discriminator outputs and the distribution of generator
outputs play the roles of primal variables and dual variables, respectively.
This formulation shows the connection between the standard GAN training process
and the primal-dual subgradient methods for convex optimization. The inherent
connection does not only provide a theoretical convergence proof for training
GANs in the function space, but also inspires a novel objective function for
training. The modified objective function forces the distribution of generator
outputs to be updated along the direction according to the primal-dual
subgradient methods. A toy example shows that the proposed method is able to
resolve mode collapse, which in this case cannot be avoided by the standard GAN
or Wasserstein GAN. Experiments on both Gaussian mixture synthetic data and
real-world image datasets demonstrate the performance of the proposed method on
generating diverse samples.
| cs.LG stat.ML | we relate the minimax game of generative adversarial networks gans to finding the saddle points of the lagrangian function for a convex optimization problem where the discriminator outputs and the distribution of generator outputs play the roles of primal variables and dual variables respectively this formulation shows the connection between the standard gan training process and the primaldual subgradient methods for convex optimization the inherent connection does not only provide a theoretical convergence proof for training gans in the function space but also inspires a novel objective function for training the modified objective function forces the distribution of generator outputs to be updated along the direction according to the primaldual subgradient methods a toy example shows that the proposed method is able to resolve mode collapse which in this case cannot be avoided by the standard gan or wasserstein gan experiments on both gaussian mixture synthetic data and realworld image datasets demonstrate the performance of the proposed method on generating diverse samples | [['we', 'relate', 'the', 'minimax', 'game', 'of', 'generative', 'adversarial', 'networks', 'gans', 'to', 'finding', 'the', 'saddle', 'points', 'of', 'the', 'lagrangian', 'function', 'for', 'a', 'convex', 'optimization', 'problem', 'where', 'the', 'discriminator', 'outputs', 'and', 'the', 'distribution', 'of', 'generator', 'outputs', 'play', 'the', 'roles', 'of', 'primal', 'variables', 'and', 'dual', 'variables', 'respectively', 'this', 'formulation', 'shows', 'the', 'connection', 'between', 'the', 'standard', 'gan', 'training', 'process', 'and', 'the', 'primaldual', 'subgradient', 'methods', 'for', 'convex', 'optimization', 'the', 'inherent', 'connection', 'does', 'not', 'only', 'provide', 'a', 'theoretical', 'convergence', 'proof', 'for', 'training', 'gans', 'in', 'the', 'function', 'space', 'but', 'also', 'inspires', 'a', 'novel', 'objective', 'function', 'for', 'training', 'the', 'modified', 'objective', 'function', 'forces', 'the', 'distribution', 'of', 'generator', 'outputs', 'to', 'be', 'updated', 'along', 'the', 'direction', 'according', 'to', 'the', 'primaldual', 'subgradient', 'methods', 'a', 'toy', 'example', 'shows', 'that', 'the', 'proposed', 'method', 'is', 'able', 'to', 'resolve', 'mode', 'collapse', 'which', 'in', 'this', 'case', 'can', 'not', 'be', 'avoided', 'by', 'the', 'standard', 'gan', 'or', 'wasserstein', 'gan', 'experiments', 'on', 'both', 'gaussian', 'mixture', 'synthetic', 'data', 'and', 'realworld', 'image', 'datasets', 'demonstrate', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'on', 'generating', 'diverse', 'samples']] | [-0.029587911746173274, -0.023230388114925907, -0.11482515751721303, 0.12101396290766672, -0.094563497203985, -0.16214014214686365, 0.04695030471504283, 0.41892080060977693, -0.3087248939883672, -0.30785907345589686, 0.036543764675356034, -0.23998427888709892, -0.20239598576145168, 0.1579968258609961, -0.14516318427753047, 0.10949334356879553, 0.11928618113307476, -0.02338305486496852, -0.08739293258040115, -0.2909200082824457, 0.30862065614915335, 0.027395577644186517, 0.3316334336938942, 0.008465518874967574, 0.16124245149234848, -0.018022762365822047, 0.035082226017764284, -0.00811885068096839, -0.06772478212813306, 0.125821333380696, 0.26220215677620806, 0.21257678210232522, 0.35374263812005063, -0.4181355867717712, -0.19403907837220497, 0.13724651175088312, 0.11314341885843343, 0.07399338997189496, -0.08392243953336008, -0.28538156969135664, 0.07007158044339987, -0.08709143343284452, -0.016074235725325126, -0.11152667881909506, -0.07593077759864095, 0.03653456353613867, -0.36499921948951813, 0.021846651892032064, 0.0782077818497604, 0.010965195638727557, -0.06413497452115628, -0.12669763571805567, -0.02041352115445799, 0.07622630152411393, 0.06988311332255527, 0.09418274483649186, 0.13547977148640925, -0.10778538639902886, -0.14582538813855384, 0.31818518581931576, -0.05371877169622211, -0.26759851912468274, 0.1458800997259381, -0.046740504513077576, -0.11451947955883171, 0.09478899791402502, 0.23714042866339713, 0.17786750219765182, -0.1489357424848513, 0.05546704593308818, -0.04167406813618641, 0.12302681578586072, 0.009053115457284945, -0.029044521766846167, 0.14495303351403516, 0.1782110528091963, 0.10631649366985618, 0.1693894626341326, -0.09202548206149617, -0.1581793826579065, -0.2991146701987993, -0.12883522768327796, -0.2613179522194754, -0.01471306741676162, -0.14944761328683434, -0.18024872856191787, 0.41680498616312817, 0.17542539434393217, 0.21544102867322465, 0.13207726099419814, 0.33550078359552504, 0.07303019765010275, 0.08297675664313824, 0.08129977310887693, 0.22758739968716094, 0.10282064717908625, 0.08811254156582012, -0.21549697592711659, 0.10806627999248405, 0.09702898749647422] |
1,802.01766 | Question-Answer Selection in User to User Marketplace Conversations | Sellers in user to user marketplaces can be inundated with questions from
potential buyers. Answers are often already available in the product
description. We collected a dataset of around 590K such questions and answers
from conversations in an online marketplace. We propose a question answering
system that selects a sentence from the product description using a
neural-network ranking model. We explore multiple encoding strategies, with
recurrent neural networks and feed-forward attention layers yielding good
results. This paper presents a demo to interactively pose buyer questions and
visualize the ranking scores of product description sentences from live online
listings.
| cs.CL | sellers in user to user marketplaces can be inundated with questions from potential buyers answers are often already available in the product description we collected a dataset of around 590k such questions and answers from conversations in an online marketplace we propose a question answering system that selects a sentence from the product description using a neuralnetwork ranking model we explore multiple encoding strategies with recurrent neural networks and feedforward attention layers yielding good results this paper presents a demo to interactively pose buyer questions and visualize the ranking scores of product description sentences from live online listings | [['sellers', 'in', 'user', 'to', 'user', 'marketplaces', 'can', 'be', 'inundated', 'with', 'questions', 'from', 'potential', 'buyers', 'answers', 'are', 'often', 'already', 'available', 'in', 'the', 'product', 'description', 'we', 'collected', 'a', 'dataset', 'of', 'around', '590k', 'such', 'questions', 'and', 'answers', 'from', 'conversations', 'in', 'an', 'online', 'marketplace', 'we', 'propose', 'a', 'question', 'answering', 'system', 'that', 'selects', 'a', 'sentence', 'from', 'the', 'product', 'description', 'using', 'a', 'neuralnetwork', 'ranking', 'model', 'we', 'explore', 'multiple', 'encoding', 'strategies', 'with', 'recurrent', 'neural', 'networks', 'and', 'feedforward', 'attention', 'layers', 'yielding', 'good', 'results', 'this', 'paper', 'presents', 'a', 'demo', 'to', 'interactively', 'pose', 'buyer', 'questions', 'and', 'visualize', 'the', 'ranking', 'scores', 'of', 'product', 'description', 'sentences', 'from', 'live', 'online', 'listings']] | [-0.07159458681672197, -0.024341641856716303, -0.04157846938991516, 0.08707987251523498, -0.1621350285395519, -0.22927626569457737, 0.13367249601707823, 0.4654216253265892, -0.28559140312322173, -0.34069459376491834, 0.018386658123867184, -0.379889602936113, -0.17855955396068388, 0.15438109756082527, -0.15803515698434306, 0.015030391819141422, 0.1578309623063686, 0.07793195456141587, 0.017876784638237667, -0.3424782701719975, 0.3273424732105173, 0.0656336059688216, 0.26879715866207615, 0.034064294491923344, 0.09242522698279816, -0.00972653026500544, -0.07512738519665046, -0.022481972740521442, -0.11882382674785102, 0.18516733945160144, 0.39590803194627855, 0.25610038098846455, 0.37234100612053245, -0.394036310321661, -0.11589334718883038, 0.05393832106954543, 0.12609702266618303, 0.1064171621806382, -0.04358978871947404, -0.3602350870550601, 0.05762854290492449, -0.2524651896650183, 0.054414042454097686, -0.12585797646687819, -0.04238167739072431, -0.03527564682623314, -0.3186732665203589, -0.02961094221388249, 0.02657848230524699, 0.0847083326385923, -0.09611929012174458, -0.055558638617194726, 0.04121430788534818, 0.20202146983734265, 0.06867002777289599, 0.05266466179920226, 0.13323557516559958, -0.20828054872936733, -0.2141251429944232, 0.37052117368763254, -0.014860236743637888, -0.16468396892689513, 0.16518290655101775, -0.03876041553760927, -0.13496798907464236, 0.0576097947670166, 0.2879474359017211, 0.08184045897412699, -0.20580667932277796, -0.002858702347196216, -0.15748609688142604, 0.21629969661901752, 0.10623226459762178, -0.021848496384486632, 0.22784943805681063, 0.23208784002849123, -0.0019051192193916162, 0.1378282086897315, 0.034059930074307104, -0.05482347350394756, -0.1811484258445508, -0.12013696493327704, -0.13105297697343163, 0.05344996447722936, -0.06876109563940584, -0.15823992528021336, 0.43155345944783735, 0.2009796333432044, 0.22383014942260132, 0.09544513613158434, 0.2908883156235685, -0.02618446166041432, 0.045767694651677286, 0.14394763695825005, 0.05493422219836988, -0.0425485168324457, 0.1789785542707775, -0.04491523964349756, 0.12129396040319014, 0.07740979886748203] |
1,802.01767 | Pseudomonads and Descent, PhD Thesis (Chapter 1) | This is the introductory chapter of my PhD Thesis. This thesis consists of
one introductory chapter and four single-authored papers written during my PhD
studies at the University of Coimbra under supervision of Maria Manuel
Clementino. In this first chapter, we give a glance of the scope of our work
and briefly describe elements of the original contributions of each paper,
including some connections between them. We also give a brief exposition of our
main setting, which is $2$-dimensional category theory. In this direction: (1)
we give an exposition on the doctrinal adjunction, focusing on the
Beck-Chevalley condition as used in Chapter "Pseudo-Kan Extensions and Descent"
(arXiv: 1606.04999), (2) we apply the results of "On lifting of biadjoints and
lax algebras" (arXiv: 1607.03087) in a generalized setting of the formal theory
of monads and (3) we apply the biadjoint triangle theorem of "On biadjoint
triangles" (aXiv: 1606.05009) to study (pseudo)exponentiable pseudocoalgebras.
| math.CT | this is the introductory chapter of my phd thesis this thesis consists of one introductory chapter and four singleauthored papers written during my phd studies at the university of coimbra under supervision of maria manuel clementino in this first chapter we give a glance of the scope of our work and briefly describe elements of the original contributions of each paper including some connections between them we also give a brief exposition of our main setting which is 2dimensional category theory in this direction 1 we give an exposition on the doctrinal adjunction focusing on the beckchevalley condition as used in chapter pseudokan extensions and descent arxiv 160604999 2 we apply the results of on lifting of biadjoints and lax algebras arxiv 160703087 in a generalized setting of the formal theory of monads and 3 we apply the biadjoint triangle theorem of on biadjoint triangles axiv 160605009 to study pseudoexponentiable pseudocoalgebras | [['this', 'is', 'the', 'introductory', 'chapter', 'of', 'my', 'phd', 'thesis', 'this', 'thesis', 'consists', 'of', 'one', 'introductory', 'chapter', 'and', 'four', 'singleauthored', 'papers', 'written', 'during', 'my', 'phd', 'studies', 'at', 'the', 'university', 'of', 'coimbra', 'under', 'supervision', 'of', 'maria', 'manuel', 'clementino', 'in', 'this', 'first', 'chapter', 'we', 'give', 'a', 'glance', 'of', 'the', 'scope', 'of', 'our', 'work', 'and', 'briefly', 'describe', 'elements', 'of', 'the', 'original', 'contributions', 'of', 'each', 'paper', 'including', 'some', 'connections', 'between', 'them', 'we', 'also', 'give', 'a', 'brief', 'exposition', 'of', 'our', 'main', 'setting', 'which', 'is', '2dimensional', 'category', 'theory', 'in', 'this', 'direction', '1', 'we', 'give', 'an', 'exposition', 'on', 'the', 'doctrinal', 'adjunction', 'focusing', 'on', 'the', 'beckchevalley', 'condition', 'as', 'used', 'in', 'chapter', 'pseudokan', 'extensions', 'and', 'descent', 'arxiv', '160604999', '2', 'we', 'apply', 'the', 'results', 'of', 'on', 'lifting', 'of', 'biadjoints', 'and', 'lax', 'algebras', 'arxiv', '160703087', 'in', 'a', 'generalized', 'setting', 'of', 'the', 'formal', 'theory', 'of', 'monads', 'and', '3', 'we', 'apply', 'the', 'biadjoint', 'triangle', 'theorem', 'of', 'on', 'biadjoint', 'triangles', 'axiv', '160605009', 'to', 'study', 'pseudoexponentiable', 'pseudocoalgebras']] | [-0.07254160780759229, 0.030670128048049982, -0.08960829437156762, 0.05261651049954231, -0.10272146556917187, -0.10415324533742468, -0.010213270595368858, 0.29026773332299055, -0.21909726587925238, -0.28701172944913794, 0.1122274185771813, -0.27287744190804397, -0.19941455104316658, 0.1395863767231365, -0.1654053996870672, -0.09536391402223518, 0.06652483375664879, 0.037314078659861236, -0.07901973944235514, -0.34638203617504476, 0.3889305298574842, 0.04582297151103954, 0.22003180352593218, 0.08594076064942605, 0.09886848042439018, 0.06769073227342297, -0.09746812480352038, -0.03947086996965475, -0.1988414265565457, 0.18434176419477363, 0.291088639625016, 0.13381955162394088, 0.2949786457873008, -0.424964528687142, -0.0619331833489656, 0.030879853993419793, 0.09716264452537769, 0.10727722166102849, -0.01918833837860713, -0.29677864694251466, 0.039762619824207326, -0.19392098913008307, -0.11280446528221832, -0.00412073420357428, 0.01843711129353883, 0.001210957659136543, -0.14487015887919058, 0.005513807108839062, 0.17287077471757165, 0.16215244044836324, -0.034026876100912117, -0.16830113514528408, 0.06082937580458429, 0.07867122224737219, 0.06474215766232642, 0.035785372240364655, 0.05927245046005591, -0.07441840633925806, -0.12988472977242843, 0.36679795027508605, -0.0363154045112392, -0.11720173693362988, 0.15455331784018506, -0.10486122946600085, -0.24384592565010998, 0.004029579652746865, 0.16760615295880324, 0.1599027749602406, -0.14106798376497273, 0.14071667774122898, -0.07498113833159417, 0.1034075014862652, 0.10531837719661946, -0.019349510791643126, 0.1363885821514092, 0.1469281041637304, 0.0067365855512606515, 0.1666840913760886, 0.0053083832956560715, -0.08679683104652416, -0.4321002381091768, -0.21682840084878507, -0.10385150341414749, 0.06773945413060956, 0.042829854746525814, -0.11799703375599184, 0.46417982778609634, 0.19386148807703407, 0.1283103886062045, 0.07059193496393704, 0.2476638739576915, 0.04574654086483187, -0.015538626319933944, 0.01010567482586924, 0.1736259137199283, 0.19368784136783618, 0.14950531707438347, -0.05756692237292345, -0.04983106902898191, 0.15549669833528204] |
1,802.01768 | Weak factorization of the Hardy space $H^p$ for small values of $p$, in
the multilinear setting | We give a weak factorization proof of the Hardy space $H^{p}(\mathbb{R}^{n})$
in the multilinear setting, for $\frac{n}{n+1} < p <1$. As a consequence, we
obtain a characterization of the boundedness of the commutator $[b,T]$ from
$L^{r_{1}}(\mathbb R^n) \text{~x ... x~} L^{r_{m}} (\mathbb R^n) \text{ to }
L^{q^\prime} (\mathbb R^n)$, where $b \in \text{Lip}_\alpha (\mathbb R^n)$, and
$\frac{\alpha}{n} = \sum_{i=1}^{m} \frac{1}{r_{i}} +\frac{1}{q} - 1$.
| math.CA | we give a weak factorization proof of the hardy space hpmathbbrn in the multilinear setting for fracnn1 p 1 as a consequence we obtain a characterization of the boundedness of the commutator bt from lr_1mathbb rn textx x lr_m mathbb rn text to lqprime mathbb rn where b in textlip_alpha mathbb rn and fracalphan sum_i1m frac1r_i frac1q 1 | [['we', 'give', 'a', 'weak', 'factorization', 'proof', 'of', 'the', 'hardy', 'space', 'hpmathbbrn', 'in', 'the', 'multilinear', 'setting', 'for', 'fracnn1', 'p', '1', 'as', 'a', 'consequence', 'we', 'obtain', 'a', 'characterization', 'of', 'the', 'boundedness', 'of', 'the', 'commutator', 'bt', 'from', 'lr_1mathbb', 'rn', 'textx', 'x', 'lr_m', 'mathbb', 'rn', 'text', 'to', 'lqprime', 'mathbb', 'rn', 'where', 'b', 'in', 'textlip_alpha', 'mathbb', 'rn', 'and', 'fracalphan', 'sum_i1m', 'frac1r_i', 'frac1q', '1']] | [-0.1702321594258627, 0.028621141145077463, 0.002194415957022172, 0.022130761080636427, -0.044303578530581526, -0.14519622005844632, -0.011521564062254934, 0.26896731412181485, -0.34792290828548944, -0.07602702588057862, 0.12831900343567562, -0.3297468768253636, -0.06515680350219974, 0.154413349666776, -0.12217641226015985, 0.035453932046388775, -0.08282362617767201, 0.09702647452314313, -0.1202401475255521, -0.2691226352650959, 0.3376186520864184, -0.20241851936309382, 0.10832454779973397, 0.038775073480792344, 0.046289450059143394, 0.02675178052427677, 0.04143089553018889, -0.08014460243877973, -0.28406134840602487, 0.09086731674436194, 0.24920603160997137, 0.14736248817867958, 0.27490736003696487, -0.3479635570474784, -0.1319034396079727, 0.2570083871877824, 0.20302370667923242, -0.13856918185662764, -0.06005815631495072, -0.3461382535393708, 0.11956700309215543, -0.09677233247874448, -0.11426979642755423, -0.06439940538425268, 0.16033455288897341, 0.057175976246631205, -0.4428271788100784, 0.07554581596587713, 0.2393976587873812, 0.03227235935628414, -0.13429264757835951, -0.1698611368998312, 0.009093377739191055, 0.029829880016712614, -0.03266618182309545, 0.2665441456875459, 0.05474852621913529, -0.009178845301413765, -0.061639842263852745, 0.38570072860098803, -0.10149882592332478, -0.23904372583358333, 0.05400282423047779, -0.25443773383561236, -0.14988195669586554, 0.023856416833810866, 0.13384026330627072, 0.19515877346006724, -0.027823433136710755, 0.30746352190684634, -0.13820945020191944, 0.11011009190518123, 0.11866314865003985, 0.08781009253401023, -0.02003570882460246, 0.07258118563689865, 0.134278354073803, 0.12365645354685302, -0.04094025208765883, 0.06350124054230176, -0.42389329193303216, -0.20759304186615807, -0.17340627200722408, 0.24562792336711517, -0.16317404645395492, -0.1315107960612155, 0.26292232274471855, 0.05721854859103377, 0.23716659325649603, 0.1444997326291811, 0.16790118695308381, 0.02558409739420033, -0.02674038028187799, 0.04601005983735936, 0.06673261865328711, 0.1678378731549646, 0.08979825553699182, -0.07597976179274085, -0.04544632315026739, 0.2510020891473127] |
1,802.01769 | Corrections to $R_{D}$ and $R_{D^{*}}$ in the BLMSSM | The deviation of the measurement of $R_{D}$ ($R_{D^{*}}$) from the Standard
Model (SM) expectation is $2.3\sigma$ ($3.1\sigma$). $R_{D}$ ($R_{D^{*}}$) is
the ratio of the branching fraction of $\overline{B} \rightarrow
D\tau\overline{\nu}_{\tau}$ ($\overline{B} \rightarrow
D^{*}\tau\overline{\nu}_{\tau}$) to that of $\overline{B} \rightarrow
Dl\overline{\nu}_{l}$ ($\overline{B} \rightarrow D^{*}l\overline{\nu}_{l}$),
where $l = e$ or $\mu$. This anomaly may imply the existence of new physics
(NP). In this paper, we restudy this problem in the supersymmetric extension of
the Standard Model with local gauged baryon and lepton numbers (BLMSSM), and
give one-loop corrections to $R_{D}$ ($R_{D^{*}}$).
| hep-ph | the deviation of the measurement of r_d r_d from the standard model sm expectation is 23sigma 31sigma r_d r_d is the ratio of the branching fraction of overlineb rightarrow dtauoverlinenu_tau overlineb rightarrow dtauoverlinenu_tau to that of overlineb rightarrow dloverlinenu_l overlineb rightarrow dloverlinenu_l where l e or mu this anomaly may imply the existence of new physics np in this paper we restudy this problem in the supersymmetric extension of the standard model with local gauged baryon and lepton numbers blmssm and give oneloop corrections to r_d r_d | [['the', 'deviation', 'of', 'the', 'measurement', 'of', 'r_d', 'r_d', 'from', 'the', 'standard', 'model', 'sm', 'expectation', 'is', '23sigma', '31sigma', 'r_d', 'r_d', 'is', 'the', 'ratio', 'of', 'the', 'branching', 'fraction', 'of', 'overlineb', 'rightarrow', 'dtauoverlinenu_tau', 'overlineb', 'rightarrow', 'dtauoverlinenu_tau', 'to', 'that', 'of', 'overlineb', 'rightarrow', 'dloverlinenu_l', 'overlineb', 'rightarrow', 'dloverlinenu_l', 'where', 'l', 'e', 'or', 'mu', 'this', 'anomaly', 'may', 'imply', 'the', 'existence', 'of', 'new', 'physics', 'np', 'in', 'this', 'paper', 'we', 'restudy', 'this', 'problem', 'in', 'the', 'supersymmetric', 'extension', 'of', 'the', 'standard', 'model', 'with', 'local', 'gauged', 'baryon', 'and', 'lepton', 'numbers', 'blmssm', 'and', 'give', 'oneloop', 'corrections', 'to', 'r_d', 'r_d']] | [-0.09907781515980184, 0.19242711923455438, 0.002598381832000766, 0.08097247154794139, -0.01278141119057335, -0.136354071099356, 0.07275935338883022, 0.20367214992552637, -0.24659116166862602, -0.2374983155897942, -0.020200855384793985, -0.3440679583743394, -0.014937241356932076, 0.06985065792350614, -0.013580437466300216, 0.08337493445051003, -0.030194084479821373, 0.0054846423599554835, -0.05282532544638288, -0.17625850547351932, 0.17305876653787333, 0.021513847241469895, 0.14963893194020872, 0.07827854650768351, -0.019278004473770958, -0.04286259178812784, -0.046246912947530486, -0.027564739763557194, -0.22680510392635905, 0.04741303789491081, 0.1495411001280489, 0.1682916761997313, 0.05470287518194282, -0.3023519188457404, -0.06571227562591343, 0.33046328267419195, 0.15321199807439403, 0.026558239991967398, 0.02410768960176193, -0.32439542757010603, 0.15158161793622266, -0.1609835735555873, -0.058218469753502367, 0.014021659574291882, 0.09021941821528487, -0.15766409214541136, -0.40832956180155994, 0.18545033205973815, 0.004080092068761587, 0.03527267245822642, 0.043964644955718016, -0.27202654532605713, -0.007886682738022632, -0.03808685639839485, 0.17241997688346689, 0.13389034690377472, 0.1728462791834756, -0.11726600320235524, -0.1695672780813941, 0.424204403197909, -0.13729744694049817, -0.18526943771067603, 0.09824615967998573, -0.2654278354539749, -0.20365369157618085, 0.09980171932333923, 0.1941399232495621, 0.0753671774663121, -0.12328780883451901, 0.2721723184895601, -0.11893868325972447, 0.138071976624519, 0.04850378157907581, 0.039029316926173056, 0.20883659309292413, 0.15810678547377283, 0.03389038968023406, 0.027717127745230514, -0.0962228435905179, 0.006558328463011478, -0.4938954053873039, -0.13861762105027237, -0.04120359291373023, 0.18476956034729997, -0.07443038167688626, -0.09299675634983613, 0.30154915385127784, 0.10035749749948147, 0.3440938915563635, 0.1387072780382741, 0.27976247089275397, 0.0813825960055061, 0.0505422075189291, -0.029795617370092006, 0.28851402234510487, 0.19758210493902484, 0.05987666872560035, -0.3031590162826904, 0.015456429587295616, 0.09505856013015272] |
1,802.0177 | Scale-recurrent Network for Deep Image Deblurring | In single image deblurring, the "coarse-to-fine" scheme, i.e. gradually
restoring the sharp image on different resolutions in a pyramid, is very
successful in both traditional optimization-based methods and recent
neural-network-based approaches. In this paper, we investigate this strategy
and propose a Scale-recurrent Network (SRN-DeblurNet) for this deblurring task.
Compared with the many recent learning-based approaches in [25], it has a
simpler network structure, a smaller number of parameters and is easier to
train. We evaluate our method on large-scale deblurring datasets with complex
motion. Results show that our method can produce better quality results than
state-of-the-arts, both quantitatively and qualitatively.
| cs.CV | in single image deblurring the coarsetofine scheme ie gradually restoring the sharp image on different resolutions in a pyramid is very successful in both traditional optimizationbased methods and recent neuralnetworkbased approaches in this paper we investigate this strategy and propose a scalerecurrent network srndeblurnet for this deblurring task compared with the many recent learningbased approaches in 25 it has a simpler network structure a smaller number of parameters and is easier to train we evaluate our method on largescale deblurring datasets with complex motion results show that our method can produce better quality results than stateofthearts both quantitatively and qualitatively | [['in', 'single', 'image', 'deblurring', 'the', 'coarsetofine', 'scheme', 'ie', 'gradually', 'restoring', 'the', 'sharp', 'image', 'on', 'different', 'resolutions', 'in', 'a', 'pyramid', 'is', 'very', 'successful', 'in', 'both', 'traditional', 'optimizationbased', 'methods', 'and', 'recent', 'neuralnetworkbased', 'approaches', 'in', 'this', 'paper', 'we', 'investigate', 'this', 'strategy', 'and', 'propose', 'a', 'scalerecurrent', 'network', 'srndeblurnet', 'for', 'this', 'deblurring', 'task', 'compared', 'with', 'the', 'many', 'recent', 'learningbased', 'approaches', 'in', '25', 'it', 'has', 'a', 'simpler', 'network', 'structure', 'a', 'smaller', 'number', 'of', 'parameters', 'and', 'is', 'easier', 'to', 'train', 'we', 'evaluate', 'our', 'method', 'on', 'largescale', 'deblurring', 'datasets', 'with', 'complex', 'motion', 'results', 'show', 'that', 'our', 'method', 'can', 'produce', 'better', 'quality', 'results', 'than', 'stateofthearts', 'both', 'quantitatively', 'and', 'qualitatively']] | [-0.01690861312387397, -0.034744108120711256, -0.09987303264895264, 0.05487278604057941, -0.07330603584551329, -0.16249191197471655, -0.02978647912600629, 0.49661628768912386, -0.24212863619382285, -0.3466507239761401, 0.07282265504627318, -0.2396646571097354, -0.22678425469036614, 0.22055074017570944, -0.17460903003502978, 0.1020071056519388, 0.15201581520389537, 0.011226622649107357, -0.08898542052353448, -0.27306498174451066, 0.2781779589891738, 0.027568254068645895, 0.39229251155439687, 0.024824229206851855, 0.09298532555944153, -0.04983142569509088, -0.03153688142703352, 0.04012597796782775, -0.08005880927989242, 0.16701743610402836, 0.25496655959179815, 0.1482722830616546, 0.3106888879817549, -0.43132795906644694, -0.25168589286729504, 0.04673684124207618, 0.1630183009487786, 0.15809682284482418, -0.07430501631698666, -0.316172227406, 0.11613047957819488, -0.15700491668884548, 0.017202218866203815, -0.169418128649229, -0.049260723632665315, -0.046400450028678666, -0.2950033920000982, 0.07590492605706867, 0.0674163815850506, 0.012194319951290987, -0.05543331302730937, -0.12580402801526064, 0.08486900791734914, 0.11269834134917782, 0.03797680202738515, 0.1062171375343329, 0.09853345155715942, -0.1946168596165377, -0.15045534599363347, 0.3939681401932422, -0.07153790275764067, -0.24260658229112017, 0.24407252730155476, -0.06441563953721553, -0.14381646067474266, 0.13482262870791006, 0.19290189957246184, 0.18106979796929018, -0.09463013406446184, -0.0055519811623748775, -0.06327180461767985, 0.17452895754416073, 0.03607704369493817, -0.01754242244024514, 0.10790303966258558, 0.2853486206648605, 0.07848266895553953, 0.13305734509925302, -0.167430374980429, -0.049071224154524355, -0.1480283929457964, -0.08431735388906103, -0.16637920864800715, -0.05595199602218915, -0.11687012021465475, -0.11586060814977604, 0.4393061761049318, 0.26770853947334905, 0.24490611652406502, 0.09888825651106177, 0.434195570989835, 0.018514016203639308, 0.09174073996896646, 0.06290038818034951, 0.19863277212336508, 0.0020255235270882138, 0.1452734148395913, -0.16920494596112748, 0.03114555240846334, 0.06243168327919379] |
1,802.01771 | Symplectic no-core configuration interaction framework for ab initio
nuclear structure | We introduce a symplectic no-core configuration interaction (SpNCCI)
framework for ab initio nuclear structure calculations, in a correlated
many-body basis which encodes an approximate Sp(3,R) symmetry of the nucleus.
Such a scheme potentially provides a means of restricting the many-body space
to include only those highly-excited configurations which dominantly contribute
to the nuclear wave function. We examine the symplectic symmetry structure
arising in an illustrative ab initio SpNCCI calculation for 6Li. We observe
both the dominance of symplectic symmetry in individual wave functions and the
emergence of families of states related by symplectic symmetry.
| nucl-th | we introduce a symplectic nocore configuration interaction spncci framework for ab initio nuclear structure calculations in a correlated manybody basis which encodes an approximate sp3r symmetry of the nucleus such a scheme potentially provides a means of restricting the manybody space to include only those highlyexcited configurations which dominantly contribute to the nuclear wave function we examine the symplectic symmetry structure arising in an illustrative ab initio spncci calculation for 6li we observe both the dominance of symplectic symmetry in individual wave functions and the emergence of families of states related by symplectic symmetry | [['we', 'introduce', 'a', 'symplectic', 'nocore', 'configuration', 'interaction', 'spncci', 'framework', 'for', 'ab', 'initio', 'nuclear', 'structure', 'calculations', 'in', 'a', 'correlated', 'manybody', 'basis', 'which', 'encodes', 'an', 'approximate', 'sp3r', 'symmetry', 'of', 'the', 'nucleus', 'such', 'a', 'scheme', 'potentially', 'provides', 'a', 'means', 'of', 'restricting', 'the', 'manybody', 'space', 'to', 'include', 'only', 'those', 'highlyexcited', 'configurations', 'which', 'dominantly', 'contribute', 'to', 'the', 'nuclear', 'wave', 'function', 'we', 'examine', 'the', 'symplectic', 'symmetry', 'structure', 'arising', 'in', 'an', 'illustrative', 'ab', 'initio', 'spncci', 'calculation', 'for', '6li', 'we', 'observe', 'both', 'the', 'dominance', 'of', 'symplectic', 'symmetry', 'in', 'individual', 'wave', 'functions', 'and', 'the', 'emergence', 'of', 'families', 'of', 'states', 'related', 'by', 'symplectic', 'symmetry']] | [-0.1612684704536071, 0.12772245690733974, -0.10852172726299614, 0.11851656201558755, -0.03194775102336122, -0.07209080793773351, 0.021868972434237112, 0.378524824258183, -0.27459394893831696, -0.24421051654802717, -0.028698036977363263, -0.2634197515435517, -0.1646517322641676, 0.09566366681500095, 0.08199020727719787, 0.027343071754211964, 0.03697591565097631, 0.00041856962944502414, -0.17018032275170655, -0.13031416192888687, 0.37015767474456324, 0.04283480836159509, 0.21483247690712629, 0.059757245123799534, 0.05460263066418955, 0.059908528599645135, 0.021639033995123336, -0.061755403719713366, -0.11577209302049596, 0.1413605906083198, 0.25235058930664545, 0.06013135694513988, 0.1884825852900932, -0.4882709429720822, -0.19975909043062964, 0.052514590044586876, 0.14195436110679546, 0.18210749045196598, -0.0581887954916886, -0.324048981500749, -0.00457469883764608, -0.22804361172830281, -0.1975388421611253, -0.18954323758573635, -0.011298505336289172, 0.0005745807885313811, -0.25381331336709834, 0.05333494826260468, 0.009305899519898483, 0.07123622900239159, -0.11899029319275818, -0.12949640821139125, -0.026709457705020093, 0.05358047143090516, -0.01164568823499038, 0.0681896675074392, 0.1469139552614449, -0.110692927787212, -0.12055708019002138, 0.44212139447462623, -0.0025701774081782155, -0.20175046259132418, 0.12698934935843167, -0.11720634630941988, -0.19376841595943045, 0.15954778701795833, 0.12688480214084216, 0.1103489661751234, -0.09299243109062841, 0.14062893750973593, -0.05553135847636124, 0.15194538464445784, 0.018425211614078802, 0.04803527590474519, 0.15777884128139072, 0.141275555745739, 0.04555384450308655, 0.10004507205398429, -0.07850525041525859, -0.18156543140218634, -0.3053442293818554, -0.12404417712241411, -0.1630646208220202, 0.09286946225905052, -0.03914727045728638, -0.18565494160714519, 0.443152364408058, 0.05372537580399733, 0.15287680890532615, -0.02884550571806081, 0.21372469352892318, 0.08430014346452916, 0.06205345973569859, 0.02267884427641073, 0.23177780457974775, 0.19445452290971804, -0.07156875134071174, -0.3004431862373958, -0.024657246925609954, 0.07662061586692605] |
1,802.01772 | Decomposition Methods with Deep Corrections for Reinforcement Learning | Decomposition methods have been proposed to approximate solutions to large
sequential decision making problems. In contexts where an agent interacts with
multiple entities, utility decomposition can be used to separate the global
objective into local tasks considering each individual entity independently. An
arbitrator is then responsible for combining the individual utilities and
selecting an action in real time to solve the global problem. Although these
techniques can perform well empirically, they rely on strong assumptions of
independence between the local tasks and sacrifice the optimality of the global
solution. This paper proposes an approach that improves upon such approximate
solutions by learning a correction term represented by a neural network. We
demonstrate this approach on a fisheries management problem where multiple
boats must coordinate to maximize their catch over time as well as on a
pedestrian avoidance problem for autonomous driving. In each problem,
decomposition methods can scale to multiple boats or pedestrians by using
strategies involving one entity. We verify empirically that the proposed
correction method significantly improves the decomposition method and
outperforms a policy trained on the full scale problem without utility
decomposition.
| cs.LG cs.AI | decomposition methods have been proposed to approximate solutions to large sequential decision making problems in contexts where an agent interacts with multiple entities utility decomposition can be used to separate the global objective into local tasks considering each individual entity independently an arbitrator is then responsible for combining the individual utilities and selecting an action in real time to solve the global problem although these techniques can perform well empirically they rely on strong assumptions of independence between the local tasks and sacrifice the optimality of the global solution this paper proposes an approach that improves upon such approximate solutions by learning a correction term represented by a neural network we demonstrate this approach on a fisheries management problem where multiple boats must coordinate to maximize their catch over time as well as on a pedestrian avoidance problem for autonomous driving in each problem decomposition methods can scale to multiple boats or pedestrians by using strategies involving one entity we verify empirically that the proposed correction method significantly improves the decomposition method and outperforms a policy trained on the full scale problem without utility decomposition | [['decomposition', 'methods', 'have', 'been', 'proposed', 'to', 'approximate', 'solutions', 'to', 'large', 'sequential', 'decision', 'making', 'problems', 'in', 'contexts', 'where', 'an', 'agent', 'interacts', 'with', 'multiple', 'entities', 'utility', 'decomposition', 'can', 'be', 'used', 'to', 'separate', 'the', 'global', 'objective', 'into', 'local', 'tasks', 'considering', 'each', 'individual', 'entity', 'independently', 'an', 'arbitrator', 'is', 'then', 'responsible', 'for', 'combining', 'the', 'individual', 'utilities', 'and', 'selecting', 'an', 'action', 'in', 'real', 'time', 'to', 'solve', 'the', 'global', 'problem', 'although', 'these', 'techniques', 'can', 'perform', 'well', 'empirically', 'they', 'rely', 'on', 'strong', 'assumptions', 'of', 'independence', 'between', 'the', 'local', 'tasks', 'and', 'sacrifice', 'the', 'optimality', 'of', 'the', 'global', 'solution', 'this', 'paper', 'proposes', 'an', 'approach', 'that', 'improves', 'upon', 'such', 'approximate', 'solutions', 'by', 'learning', 'a', 'correction', 'term', 'represented', 'by', 'a', 'neural', 'network', 'we', 'demonstrate', 'this', 'approach', 'on', 'a', 'fisheries', 'management', 'problem', 'where', 'multiple', 'boats', 'must', 'coordinate', 'to', 'maximize', 'their', 'catch', 'over', 'time', 'as', 'well', 'as', 'on', 'a', 'pedestrian', 'avoidance', 'problem', 'for', 'autonomous', 'driving', 'in', 'each', 'problem', 'decomposition', 'methods', 'can', 'scale', 'to', 'multiple', 'boats', 'or', 'pedestrians', 'by', 'using', 'strategies', 'involving', 'one', 'entity', 'we', 'verify', 'empirically', 'that', 'the', 'proposed', 'correction', 'method', 'significantly', 'improves', 'the', 'decomposition', 'method', 'and', 'outperforms', 'a', 'policy', 'trained', 'on', 'the', 'full', 'scale', 'problem', 'without', 'utility', 'decomposition']] | [-0.07435732541001729, -0.025053362132717125, -0.09616032034171292, 0.056968545347587454, -0.1165846485644579, -0.16405271903133473, 0.06619592449420157, 0.42061165636657055, -0.3200467818215288, -0.3309152009179564, 0.1147098836822536, -0.23213368473398324, -0.1624769038709535, 0.18064915206459528, -0.11568534242341648, 0.09139121621532517, 0.08942820135050931, 0.046947047547311396, -0.02194876897375326, -0.274216207136979, 0.30239363461732865, 0.03525788894023847, 0.3225007496472146, 0.027520815562456846, 0.17783501250354725, 0.03692459593703215, -0.02446371959711148, 0.04913535493212073, -0.04312346539801502, 0.1088871588899024, 0.28728202229390876, 0.2080653555829682, 0.3767915958991727, -0.4468019112743236, -0.20677080804582787, 0.13345343412428692, 0.1745250386412482, 0.09849067696156232, 0.026773475938652817, -0.30593670561305575, 0.09955262508545373, -0.17571393548183747, -0.05498718942792432, -0.11816058958049964, -0.060893970400699084, 0.021257581020629888, -0.3270126215349002, 0.02809909766137197, 0.02468480363966444, 0.02303996052139917, -0.0964034686148217, -0.08911088734261087, 0.04196602898473675, 0.18136114885376112, 0.05738797501434346, 0.004329989615173356, 0.14433825101099304, -0.1420496236205705, -0.18909419412422623, 0.38231185828964853, -0.04828770818138445, -0.2689883035657978, 0.18681408076773623, 0.013675420503509608, -0.1462474154786685, 0.08738492634399114, 0.20537702510183728, 0.15329786227588113, -0.16051623298711068, 0.03701553955592366, -0.05566386911841865, 0.17344805763128238, 0.06357430511632481, -0.018803401220891927, 0.16121171767055686, 0.19868241926730687, 0.13382029614310612, 0.11126640416568498, -0.04574164943360547, -0.11417417754167439, -0.20277157486133227, -0.09670694138197153, -0.18844074874210195, -0.015313888066825834, -0.1101312572461383, -0.12563031990634832, 0.3684563195307714, 0.19479531144622614, 0.18785399975557182, 0.08834106619847384, 0.3654506991139135, 0.1000569181416083, 0.08938102194995343, 0.09621186291396215, 0.17611188959091198, 0.0002588693452118015, 0.10473781367889731, -0.2262499599031651, 0.11906032369950333, 0.10881044782975034] |
1,802.01773 | Feynman diagrams, ribbon graphs, and topological recursion of
Eynard-Orantin | We consider two seemingly unrelated problems, the calculation of the WKB
expansion of the harmonic oscillator wave functions and the counting the number
of Feynman diagrams in QED or in many-body physics and show that their
solutions are both encoded in a single enumerative problem, the calculation of
the number of certain types of ribbon graphs. In turn, the numbers of such
ribbon graphs as a function of the number of their vertices and edges can be
determined recursively through the application of the topological recursion of
Eynard-Orantin to the algebraic curve encoded in the Schr\"odinger equation of
the harmonic oscillator. We show how the numbers of these ribbon graphs can be
written down in closed form for any given number of vertices and edges. We use
these numbers to obtain a formula for the number of N-rooted ribbon graphs with
e edges, which is the same as the number of Feynman diagrams for 2N-point
function with e+1-N loops.
| hep-th | we consider two seemingly unrelated problems the calculation of the wkb expansion of the harmonic oscillator wave functions and the counting the number of feynman diagrams in qed or in manybody physics and show that their solutions are both encoded in a single enumerative problem the calculation of the number of certain types of ribbon graphs in turn the numbers of such ribbon graphs as a function of the number of their vertices and edges can be determined recursively through the application of the topological recursion of eynardorantin to the algebraic curve encoded in the schrodinger equation of the harmonic oscillator we show how the numbers of these ribbon graphs can be written down in closed form for any given number of vertices and edges we use these numbers to obtain a formula for the number of nrooted ribbon graphs with e edges which is the same as the number of feynman diagrams for 2npoint function with e1n loops | [['we', 'consider', 'two', 'seemingly', 'unrelated', 'problems', 'the', 'calculation', 'of', 'the', 'wkb', 'expansion', 'of', 'the', 'harmonic', 'oscillator', 'wave', 'functions', 'and', 'the', 'counting', 'the', 'number', 'of', 'feynman', 'diagrams', 'in', 'qed', 'or', 'in', 'manybody', 'physics', 'and', 'show', 'that', 'their', 'solutions', 'are', 'both', 'encoded', 'in', 'a', 'single', 'enumerative', 'problem', 'the', 'calculation', 'of', 'the', 'number', 'of', 'certain', 'types', 'of', 'ribbon', 'graphs', 'in', 'turn', 'the', 'numbers', 'of', 'such', 'ribbon', 'graphs', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'their', 'vertices', 'and', 'edges', 'can', 'be', 'determined', 'recursively', 'through', 'the', 'application', 'of', 'the', 'topological', 'recursion', 'of', 'eynardorantin', 'to', 'the', 'algebraic', 'curve', 'encoded', 'in', 'the', 'schrodinger', 'equation', 'of', 'the', 'harmonic', 'oscillator', 'we', 'show', 'how', 'the', 'numbers', 'of', 'these', 'ribbon', 'graphs', 'can', 'be', 'written', 'down', 'in', 'closed', 'form', 'for', 'any', 'given', 'number', 'of', 'vertices', 'and', 'edges', 'we', 'use', 'these', 'numbers', 'to', 'obtain', 'a', 'formula', 'for', 'the', 'number', 'of', 'nrooted', 'ribbon', 'graphs', 'with', 'e', 'edges', 'which', 'is', 'the', 'same', 'as', 'the', 'number', 'of', 'feynman', 'diagrams', 'for', '2npoint', 'function', 'with', 'e1n', 'loops']] | [-0.189054090260241, 0.14717563170845965, -0.052529371601277554, 0.0718590437746519, -0.07359935266533925, -0.08896207991319727, 0.045560120667899086, 0.33731859592053126, -0.282174704514397, -0.3428078016644027, 0.04138405533630471, -0.2820772235267122, -0.17038923739045625, 0.19786334845952033, -0.022100621942758747, 0.054013336709928965, 0.07466312175698625, 0.08768259677977401, -0.030955072731049086, -0.24100996393552226, 0.3229303535003707, -0.06849244600981942, 0.18080167367515512, 0.07008799579750113, 0.050244328393103006, 0.039975650834048505, 0.006741385496918511, 0.06314171553126671, -0.10932275909461328, 0.12627732412634804, 0.2398783158065763, 0.11220494894392835, 0.19319667697608847, -0.4497069124038677, -0.1455808745685426, 0.12213990657514184, 0.15993635817694496, 0.10577664619718778, 0.03957917914673124, -0.23165989361422243, 0.052664991882600404, -0.13911863999827853, -0.13480308870697078, -0.04730828517298185, 0.02934031073683463, 0.08092964073290182, -0.20930985151350778, 0.010539945466853913, 0.038189775052732265, 0.036641139273514166, 0.017007443298286986, -0.113641587738387, -0.06606021209227496, 0.13926276710300278, 0.006116057190393924, 0.018454014997249878, 0.05625534628711219, -0.18419932492616228, -0.167045146994199, 0.37110491092873255, -0.019503648516593163, -0.21598148846514845, 0.10438443026241828, -0.1754366973087004, -0.13975729935351502, 0.12650672803082322, 0.12117749273355277, 0.1502852749969787, -0.10141383301841575, 0.10793055775985357, -0.05235079284173469, 0.08306215628659434, 0.1366032351821708, 0.041277852076334214, 0.17344210876310068, 0.06112814648516195, 0.033139398834029644, 0.22291829923033105, -0.020972564533856587, -0.06327748283122976, -0.3443226362314989, -0.1694180832270814, -0.20214532587513234, 0.07215715588666075, -0.1553987150732867, -0.27061914085592115, 0.4480458812468902, 0.09677694234177002, 0.22465057832843466, 0.08042107127188067, 0.2287662338184298, 0.1803624803660168, 0.06634551875656412, 0.05947260606928535, 0.15642960929551963, 0.1873411167641434, 0.027442175130588265, -0.19301312113965644, -0.0073267221333658174, 0.16539191926753372] |
1,802.01774 | Local theta correspondence and nilpotent invariants | We consider two types of nilpotent invariants associated to smooth
representations, namely generalized Whittaker models, and associated characters
(in the case of a real reductive group). We survey some recent results on the
behavior of these nilpotent invariants under local theta correspondence, and
highlight the special role of a certain double fiberation of moment maps.
| math.RT | we consider two types of nilpotent invariants associated to smooth representations namely generalized whittaker models and associated characters in the case of a real reductive group we survey some recent results on the behavior of these nilpotent invariants under local theta correspondence and highlight the special role of a certain double fiberation of moment maps | [['we', 'consider', 'two', 'types', 'of', 'nilpotent', 'invariants', 'associated', 'to', 'smooth', 'representations', 'namely', 'generalized', 'whittaker', 'models', 'and', 'associated', 'characters', 'in', 'the', 'case', 'of', 'a', 'real', 'reductive', 'group', 'we', 'survey', 'some', 'recent', 'results', 'on', 'the', 'behavior', 'of', 'these', 'nilpotent', 'invariants', 'under', 'local', 'theta', 'correspondence', 'and', 'highlight', 'the', 'special', 'role', 'of', 'a', 'certain', 'double', 'fiberation', 'of', 'moment', 'maps']] | [-0.22290203592705507, 0.04765825607911985, -0.07045736543282315, 0.06828314148717457, -0.11687091146423309, -0.10370620336659529, -0.03462475639470439, 0.33425436831182903, -0.3226841555011493, -0.19523095808647298, 0.10689786906759427, -0.25463166090021666, -0.22766634592510485, 0.2392161457488934, -0.10454234960316508, -0.006582803360221011, 0.036893432136383596, 0.1096927725572001, -0.15049993288185862, -0.2741149654072985, 0.4572634081597681, -0.0624638353409763, 0.2570632705120025, 0.01930420332980618, 0.0959725537320116, 0.02471564881745036, -0.05224080364806233, -0.034666796318358846, -0.12961185326868738, 0.14055370242783316, 0.27919836080487853, 0.038816637756233965, 0.1963528595407735, -0.39681922230455613, -0.1417200556024909, 0.19716233277210482, 0.09581599277616651, 0.0060351319714552825, -0.0555289542211944, -0.29858164804452964, 0.08097487024497241, -0.18198898588134735, -0.18124839832523354, -0.09071184911213263, 0.009158552641531936, 0.053869099903817254, -0.21403846686223038, 0.053786428058864896, 0.08210893363381426, 0.13118288429729916, -0.11598356002596794, -0.11056070246882478, -0.02810117796373864, 0.10054733075580939, 0.032884557703423696, -0.03767200010069818, 0.07871680708464097, -0.1748954625800252, -0.12491130408899928, 0.36868911215828526, -0.052491599693894386, -0.22564221522339653, 0.18588218130861167, -0.16007709651495572, -0.24672941001201118, 0.055366629540609814, 0.1492105769165964, 0.18355099494672483, -0.02412889080329074, 0.14299681801478276, -0.10907139673967052, -0.001127716776897648, 0.0747122269951635, -0.015681732773642848, 0.1736191109650665, 0.034163209747661044, 0.003862342728232896, 0.1359624967832739, -0.01759840559033263, -0.07580117465005498, -0.38164326355413153, -0.16028117923135007, -0.05985953147885286, 0.09401320272849666, -0.11846937226181142, -0.15006984587482833, 0.494955248578831, 0.08441626426280925, 0.2160986970756548, 0.11402819095248426, 0.1648096916852174, 0.07277105762127407, 0.05633830551609949, -0.028301821159267868, 0.11268347822381959, 0.23889182025083788, -0.057792985156454424, -0.17408024471822298, -0.020440271561879112, 0.17529267788416258] |
1,802.01775 | Multi-cavity ultra-stable laser towards 10-18 | In this letter, we demonstrate a technique of making an ultrastable laser
referenced to a multi-cavity, corresponding to a lower thermal noise limit due
to the larger equivalent beam size. The multi-cavity consists of several pairs
of mirrors and a common spacer. We can stabilize the laser frequencies on these
cavities, and average the laser frequencies with synthesizing technique. In
comparison with a single cavity system, relative frequency instability of the
synthesized laser can be improved by a factor of the squire root of the cavity
number (n). In addition, we perform an experiment to simulate a two-cavity
system. Experimental results show that frequency instability of the synthesized
laser is improved by a factor of 1.4, and discrimination of the laser frequency
instability, introduced by the process of lasers synthesizing, is negligible,
and can reach a floor at low level 10-18 limited by noise of currently used
signal generators. This technique is comparable with other techniques; thus, it
can gain a factor of the squre root of n on the frequency instability of an
ultrastable laser to an unprecedented level.
| physics.ins-det physics.optics | in this letter we demonstrate a technique of making an ultrastable laser referenced to a multicavity corresponding to a lower thermal noise limit due to the larger equivalent beam size the multicavity consists of several pairs of mirrors and a common spacer we can stabilize the laser frequencies on these cavities and average the laser frequencies with synthesizing technique in comparison with a single cavity system relative frequency instability of the synthesized laser can be improved by a factor of the squire root of the cavity number n in addition we perform an experiment to simulate a twocavity system experimental results show that frequency instability of the synthesized laser is improved by a factor of 14 and discrimination of the laser frequency instability introduced by the process of lasers synthesizing is negligible and can reach a floor at low level 1018 limited by noise of currently used signal generators this technique is comparable with other techniques thus it can gain a factor of the squre root of n on the frequency instability of an ultrastable laser to an unprecedented level | [['in', 'this', 'letter', 'we', 'demonstrate', 'a', 'technique', 'of', 'making', 'an', 'ultrastable', 'laser', 'referenced', 'to', 'a', 'multicavity', 'corresponding', 'to', 'a', 'lower', 'thermal', 'noise', 'limit', 'due', 'to', 'the', 'larger', 'equivalent', 'beam', 'size', 'the', 'multicavity', 'consists', 'of', 'several', 'pairs', 'of', 'mirrors', 'and', 'a', 'common', 'spacer', 'we', 'can', 'stabilize', 'the', 'laser', 'frequencies', 'on', 'these', 'cavities', 'and', 'average', 'the', 'laser', 'frequencies', 'with', 'synthesizing', 'technique', 'in', 'comparison', 'with', 'a', 'single', 'cavity', 'system', 'relative', 'frequency', 'instability', 'of', 'the', 'synthesized', 'laser', 'can', 'be', 'improved', 'by', 'a', 'factor', 'of', 'the', 'squire', 'root', 'of', 'the', 'cavity', 'number', 'n', 'in', 'addition', 'we', 'perform', 'an', 'experiment', 'to', 'simulate', 'a', 'twocavity', 'system', 'experimental', 'results', 'show', 'that', 'frequency', 'instability', 'of', 'the', 'synthesized', 'laser', 'is', 'improved', 'by', 'a', 'factor', 'of', '14', 'and', 'discrimination', 'of', 'the', 'laser', 'frequency', 'instability', 'introduced', 'by', 'the', 'process', 'of', 'lasers', 'synthesizing', 'is', 'negligible', 'and', 'can', 'reach', 'a', 'floor', 'at', 'low', 'level', '1018', 'limited', 'by', 'noise', 'of', 'currently', 'used', 'signal', 'generators', 'this', 'technique', 'is', 'comparable', 'with', 'other', 'techniques', 'thus', 'it', 'can', 'gain', 'a', 'factor', 'of', 'the', 'squre', 'root', 'of', 'n', 'on', 'the', 'frequency', 'instability', 'of', 'an', 'ultrastable', 'laser', 'to', 'an', 'unprecedented', 'level']] | [-0.13940259699798163, 0.18862826971554422, -0.05812581976636329, -0.02722557045432325, 0.0002513803177781132, -0.12365335741408127, 0.07373363917820967, 0.4068162558839641, -0.24945964598664025, -0.3214234486040165, 0.07448853283935856, -0.24147024749408805, -0.07148492282292905, 0.27355008394660313, -0.056471241255649805, 0.06787885468473981, 0.04174588792619176, 0.004846634044098621, -0.024592731464081887, -0.17170177933736575, 0.25639925011844694, 0.14691807468572643, 0.3130912362238881, -0.006593109121514932, 0.13951250198999596, -0.06203262151352926, 0.03142755487465492, -0.025173402805006205, -0.10130843953718073, 0.10449131928363492, 0.22929459449824716, 0.053480047951114246, 0.27706004524676325, -0.40167284703829104, -0.1961925881810736, 0.06267993106616027, 0.13795380820858413, 0.13555108932856283, -0.04196996895944981, -0.2548234481819744, 0.07975031242786527, -0.17234341049821808, -0.14621645893235613, -0.01828465151324785, -0.027775794391223754, 0.04106592950307082, -0.30214114710376416, 0.0027185621890551594, 0.06173353847890979, 0.06896795133940417, -0.021886875811319113, -0.07161949931737556, 0.01518955653502122, 0.07103842577777345, -0.025761278064085128, 0.05743181373170894, 0.1600801488410619, -0.11723058858844737, -0.10745329701721502, 0.3612880835611394, -0.11345524751638483, -0.13927796598024375, 0.1762471366634686, -0.1614698494326677, -0.02122820464779711, 0.18374622376979063, 0.17024745368860486, 0.09448040257515021, -0.10979370932047927, 0.008097054660690989, 0.029280971647266237, 0.27939533883596473, 0.14014927390182402, 0.06298123763395505, 0.18395995172312973, 0.2286330460559046, 0.04690432343723034, 0.1967977012189589, -0.10874043142568715, 0.011860552159340938, -0.23965920008427605, -0.10781542858103675, -0.17174348214838925, 0.05148311405741498, -0.0747436212070739, -0.10519376652856363, 0.38965174968890304, 0.16651823886217518, 0.15746790260940208, -0.023040255227297878, 0.33181970206534167, 0.16369047535937176, 0.07892132997148613, -0.014947532439955924, 0.2725749744249341, 0.12002513627911912, 0.053556613821806855, -0.252717655368654, -0.00695738614882816, -0.0057334310476610945] |
1,802.01776 | The Brauer Group of a Surface over a Finite Field | This is an English translation of the author's 1989 note in Russian,
published in a collection "Arithmetic and Geometry of Varieties" (V.E.
Voskresenski, ed.), Kuibyshev State University, Kuibyshev, 1989, pp. 57--67.
Let $X$ be be an absolutely irreducible smooth projective surface over a
finite field $k$ of odd characteristic, let $Br(X)$ be the (commutative
periodic) Brauer group of $X$ and $DIV Br(X)$ the subgroup of its divisible
elements. We write $Br(X)_{DIV}$ for the quotient $Br(X)/DIV Br(X)$ and
$Br(X)_{DIV}(2)$ for its (finite) $2$-primary component. We prove that the
order of $Br(X)_{DIV}(2)$ is a full square under the following additional
assumptions on $\bar{X}=X\times \bar{k}$ where $ \bar{k}$ is an algebraic
closure of $k$.
There is no 2-torsion in the N\'eron-Severi group of $\bar{X}$. The surface
$\bar{X}$ admits a lifting to characteristic 0.
The proof is based on constructions of author's paper (Math. USSR Izv. 20
(1983), 203-234) and Wu's Theorem that relates Stiefel-Whitney classes and
Steenrod squares.
| math.NT | this is an english translation of the authors 1989 note in russian published in a collection arithmetic and geometry of varieties ve voskresenski ed kuibyshev state university kuibyshev 1989 pp 5767 let x be be an absolutely irreducible smooth projective surface over a finite field k of odd characteristic let brx be the commutative periodic brauer group of x and div brx the subgroup of its divisible elements we write brx_div for the quotient brxdiv brx and brx_div2 for its finite 2primary component we prove that the order of brx_div2 is a full square under the following additional assumptions on barxxtimes bark where bark is an algebraic closure of k there is no 2torsion in the neronseveri group of barx the surface barx admits a lifting to characteristic 0 the proof is based on constructions of authors paper math ussr izv 20 1983 203234 and wus theorem that relates stiefelwhitney classes and steenrod squares | [['this', 'is', 'an', 'english', 'translation', 'of', 'the', 'authors', '1989', 'note', 'in', 'russian', 'published', 'in', 'a', 'collection', 'arithmetic', 'and', 'geometry', 'of', 'varieties', 've', 'voskresenski', 'ed', 'kuibyshev', 'state', 'university', 'kuibyshev', '1989', 'pp', '5767', 'let', 'x', 'be', 'be', 'an', 'absolutely', 'irreducible', 'smooth', 'projective', 'surface', 'over', 'a', 'finite', 'field', 'k', 'of', 'odd', 'characteristic', 'let', 'brx', 'be', 'the', 'commutative', 'periodic', 'brauer', 'group', 'of', 'x', 'and', 'div', 'brx', 'the', 'subgroup', 'of', 'its', 'divisible', 'elements', 'we', 'write', 'brx_div', 'for', 'the', 'quotient', 'brxdiv', 'brx', 'and', 'brx_div2', 'for', 'its', 'finite', '2primary', 'component', 'we', 'prove', 'that', 'the', 'order', 'of', 'brx_div2', 'is', 'a', 'full', 'square', 'under', 'the', 'following', 'additional', 'assumptions', 'on', 'barxxtimes', 'bark', 'where', 'bark', 'is', 'an', 'algebraic', 'closure', 'of', 'k', 'there', 'is', 'no', '2torsion', 'in', 'the', 'neronseveri', 'group', 'of', 'barx', 'the', 'surface', 'barx', 'admits', 'a', 'lifting', 'to', 'characteristic', '0', 'the', 'proof', 'is', 'based', 'on', 'constructions', 'of', 'authors', 'paper', 'math', 'ussr', 'izv', '20', '1983', '203234', 'and', 'wus', 'theorem', 'that', 'relates', 'stiefelwhitney', 'classes', 'and', 'steenrod', 'squares']] | [-0.19646080185113282, 0.09146287976954823, -0.14333760731949888, 0.0034854626925341016, -0.10441429161884147, -0.11998388855236358, 0.013150317720458682, 0.3172430182654603, -0.3158971110936897, -0.2004689425278198, 0.08139111829022395, -0.2796017853800079, -0.08651940956840228, 0.1829681464695725, -0.1563995693071649, -0.06525454805152298, 0.021438784982431038, 0.09965306062347673, -0.09061612079305381, -0.32580343217685304, 0.3283887271833574, -0.056201817363436365, 0.20011641440656164, 0.06146419777912248, 0.1223418189951315, 0.03821310322131592, -0.008893390382029886, -0.05307121385081575, -0.14782078830446999, 0.09160492809746286, 0.3403765566261678, 0.07245644435511324, 0.20687849736483446, -0.33975764533569075, -0.09704298578395412, 0.20974686804131187, 0.08663730791223974, -0.030497483457920367, 0.044952658062865, -0.270594022641408, 0.15155268645853381, -0.17817363551464574, -0.14682405291141234, -0.02805001249151497, 0.13945461538829038, -0.016366509451723563, -0.24688892790341171, -0.01785130691554012, 0.14256220752020077, 0.2327046879470862, -0.03982157237217601, -0.17895743824332824, -0.05704284206931961, 0.049907990625320836, -0.006600432382125793, 0.11554852800186852, 0.05491879601352687, -0.03734002546086137, -0.10011170292192878, 0.36241753396802934, -0.05882630114331199, -0.17447709066086803, 0.1074815330818167, -0.13097642850259256, -0.1365416955652422, 0.15563837346331827, 0.10403317176608433, 0.13221073173757258, -0.02160131986541995, 0.2666103279454923, -0.1713188359867139, 0.15476114179393083, 0.1252464418845444, -0.0759171461236888, 0.07909099971554402, 0.0810662506533594, 0.061427373586800595, 0.08843424578823535, -0.009573255347666041, 0.008153326479429058, -0.3721792951033547, -0.2110640390479038, -0.15323941874606856, 0.18226942845845018, -0.07157629156467135, -0.14797169492933257, 0.4004526737178194, 0.03678478562465773, 0.10782331096907628, 0.07257851775221784, 0.18388854388211823, 0.07734082645961436, -0.0013560845227590923, 0.11850672085841732, 0.0724224261682609, 0.249155410049997, -0.027672177826953602, -0.1498600204475224, -0.010502186358167694, 0.1876778462034618] |
1,802.01777 | Brute-Force Facial Landmark Analysis With A 140,000-Way Classifier | We propose a simple approach to visual alignment, focusing on the
illustrative task of facial landmark estimation. While most prior work treats
this as a regression problem, we instead formulate it as a discrete $K$-way
classification task, where a classifier is trained to return one of $K$
discrete alignments. One crucial benefit of a classifier is the ability to
report back a (softmax) distribution over putative alignments. We demonstrate
that this distribution is a rich representation that can be marginalized (to
generate uncertainty estimates over groups of landmarks) and conditioned on (to
incorporate top-down context, provided by temporal constraints in a video
stream or an interactive human user). Such capabilities are difficult to
integrate into classic regression-based approaches. We study performance as a
function of the number of classes $K$, including the extreme "exemplar class"
setting where $K$ is equal to the number of training examples (140K in our
setting). Perhaps surprisingly, we show that classifiers can still be learned
in this setting. When compared to prior work in classification, our $K$ is
unprecedentedly large, including many "fine-grained" classes that are very
similar. We address these issues by using a multi-label loss function that
allows for training examples to be non-uniformly shared across discrete
classes. We perform a comprehensive experimental analysis of our method on
standard benchmarks, demonstrating state-of-the-art results for facial
alignment in videos.
| cs.CV | we propose a simple approach to visual alignment focusing on the illustrative task of facial landmark estimation while most prior work treats this as a regression problem we instead formulate it as a discrete kway classification task where a classifier is trained to return one of k discrete alignments one crucial benefit of a classifier is the ability to report back a softmax distribution over putative alignments we demonstrate that this distribution is a rich representation that can be marginalized to generate uncertainty estimates over groups of landmarks and conditioned on to incorporate topdown context provided by temporal constraints in a video stream or an interactive human user such capabilities are difficult to integrate into classic regressionbased approaches we study performance as a function of the number of classes k including the extreme exemplar class setting where k is equal to the number of training examples 140k in our setting perhaps surprisingly we show that classifiers can still be learned in this setting when compared to prior work in classification our k is unprecedentedly large including many finegrained classes that are very similar we address these issues by using a multilabel loss function that allows for training examples to be nonuniformly shared across discrete classes we perform a comprehensive experimental analysis of our method on standard benchmarks demonstrating stateoftheart results for facial alignment in videos | [['we', 'propose', 'a', 'simple', 'approach', 'to', 'visual', 'alignment', 'focusing', 'on', 'the', 'illustrative', 'task', 'of', 'facial', 'landmark', 'estimation', 'while', 'most', 'prior', 'work', 'treats', 'this', 'as', 'a', 'regression', 'problem', 'we', 'instead', 'formulate', 'it', 'as', 'a', 'discrete', 'kway', 'classification', 'task', 'where', 'a', 'classifier', 'is', 'trained', 'to', 'return', 'one', 'of', 'k', 'discrete', 'alignments', 'one', 'crucial', 'benefit', 'of', 'a', 'classifier', 'is', 'the', 'ability', 'to', 'report', 'back', 'a', 'softmax', 'distribution', 'over', 'putative', 'alignments', 'we', 'demonstrate', 'that', 'this', 'distribution', 'is', 'a', 'rich', 'representation', 'that', 'can', 'be', 'marginalized', 'to', 'generate', 'uncertainty', 'estimates', 'over', 'groups', 'of', 'landmarks', 'and', 'conditioned', 'on', 'to', 'incorporate', 'topdown', 'context', 'provided', 'by', 'temporal', 'constraints', 'in', 'a', 'video', 'stream', 'or', 'an', 'interactive', 'human', 'user', 'such', 'capabilities', 'are', 'difficult', 'to', 'integrate', 'into', 'classic', 'regressionbased', 'approaches', 'we', 'study', 'performance', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'classes', 'k', 'including', 'the', 'extreme', 'exemplar', 'class', 'setting', 'where', 'k', 'is', 'equal', 'to', 'the', 'number', 'of', 'training', 'examples', '140k', 'in', 'our', 'setting', 'perhaps', 'surprisingly', 'we', 'show', 'that', 'classifiers', 'can', 'still', 'be', 'learned', 'in', 'this', 'setting', 'when', 'compared', 'to', 'prior', 'work', 'in', 'classification', 'our', 'k', 'is', 'unprecedentedly', 'large', 'including', 'many', 'finegrained', 'classes', 'that', 'are', 'very', 'similar', 'we', 'address', 'these', 'issues', 'by', 'using', 'a', 'multilabel', 'loss', 'function', 'that', 'allows', 'for', 'training', 'examples', 'to', 'be', 'nonuniformly', 'shared', 'across', 'discrete', 'classes', 'we', 'perform', 'a', 'comprehensive', 'experimental', 'analysis', 'of', 'our', 'method', 'on', 'standard', 'benchmarks', 'demonstrating', 'stateoftheart', 'results', 'for', 'facial', 'alignment', 'in', 'videos']] | [-0.04392704759827919, 0.005135092632392318, -0.07414943011270629, 0.07434531505374858, -0.1243433917934696, -0.16268174131504365, 0.056427609332733684, 0.44519844100707107, -0.2727658587885607, -0.3447484575543139, 0.07217829525677694, -0.2741715673078498, -0.17310070605845088, 0.21578419624142245, -0.14760085537201828, 0.06175880411484589, 0.11743983190092776, 0.0662952866901954, -0.07562726449505944, -0.2954934296518978, 0.29289876072046656, 0.014257192090153694, 0.2906203069165349, 0.003042887080874708, 0.1105440765308837, -0.009681501527213388, -0.02548159633659654, 0.022990662618022826, -0.055168338887581034, 0.15547780795100455, 0.32573688683307006, 0.17698970970594222, 0.3357005905070239, -0.35979242453144655, -0.24041564104871618, 0.10390269299555156, 0.14273056890815497, 0.1249245601447506, -0.030237358383730883, -0.3074556184063355, 0.11424882570695546, -0.1557182004633877, 0.0074726735055446625, -0.13732446572329435, -0.02005493503063917, -0.025363261554286712, -0.313482889169051, 0.05941420363469256, 0.09613351337197754, 0.06330952176617252, -0.047357814964165704, -0.10051528652302093, 0.03344350748488473, 0.16745210869405935, 0.053661029052196274, 0.04107123012654483, 0.11766845999285579, -0.16488747886873575, -0.13219074261685212, 0.3813593524570266, -0.056782561993329886, -0.2341517579431335, 0.20995522672517433, -0.054923505925883846, -0.1678524487424228, 0.09224363193847239, 0.24985910856475432, 0.1534437347203493, -0.14597585771989544, 0.011462617510050122, -0.09535344478156832, 0.18376129930838941, 0.04521717304156886, -0.006297842011683517, 0.1959229398306666, 0.23179581630871526, 0.05251065239077434, 0.1754269367389174, -0.11810864476538781, -0.06518894207663833, -0.25596810478303167, -0.10409509917928113, -0.19976656896993517, 0.01196612665688412, -0.07950095294450875, -0.14352794368647867, 0.39988178781440686, 0.21616731059013142, 0.26143496540064615, 0.12207114179605721, 0.330656955829925, 0.03140134102147486, 0.08289574827998876, 0.060699229846294556, 0.14835820437512465, 0.02448406546583606, 0.048384321224358345, -0.14276187036186458, 0.08151875657339891, 0.04844881706767612] |
1,802.01778 | Solar Imaging using Low Frequency Arrays | Low frequency imaging radio arrays such as MWA, LWA and LOFAR have been
recently commissioned, and significantly more advanced and flexible arrays are
planned for the near term. These powerful instruments offer new opportunities
for direct solar imaging at high time and frequency resolution. They can also
probe large volumes of the heliosphere simultaneously, by virtue of very large
fields of view. They allow highly detailed, spatially resolved study of solar
and heliospheric radio bursts, which are complemented by heliospheric
propagation studies using both background astronomical radio emissions as well
as the bursts themselves.
In this paper, the state of the art in such wide field solar and heliospheric
radio studies is summarized, including recent results from the Murchison
Widefield Array (MWA). The prospects for major advances in observational
capabilities in the near future are reviewed, with particular emphasis on the
RAPID system developed at Haystack Observatory
| astro-ph.IM | low frequency imaging radio arrays such as mwa lwa and lofar have been recently commissioned and significantly more advanced and flexible arrays are planned for the near term these powerful instruments offer new opportunities for direct solar imaging at high time and frequency resolution they can also probe large volumes of the heliosphere simultaneously by virtue of very large fields of view they allow highly detailed spatially resolved study of solar and heliospheric radio bursts which are complemented by heliospheric propagation studies using both background astronomical radio emissions as well as the bursts themselves in this paper the state of the art in such wide field solar and heliospheric radio studies is summarized including recent results from the murchison widefield array mwa the prospects for major advances in observational capabilities in the near future are reviewed with particular emphasis on the rapid system developed at haystack observatory | [['low', 'frequency', 'imaging', 'radio', 'arrays', 'such', 'as', 'mwa', 'lwa', 'and', 'lofar', 'have', 'been', 'recently', 'commissioned', 'and', 'significantly', 'more', 'advanced', 'and', 'flexible', 'arrays', 'are', 'planned', 'for', 'the', 'near', 'term', 'these', 'powerful', 'instruments', 'offer', 'new', 'opportunities', 'for', 'direct', 'solar', 'imaging', 'at', 'high', 'time', 'and', 'frequency', 'resolution', 'they', 'can', 'also', 'probe', 'large', 'volumes', 'of', 'the', 'heliosphere', 'simultaneously', 'by', 'virtue', 'of', 'very', 'large', 'fields', 'of', 'view', 'they', 'allow', 'highly', 'detailed', 'spatially', 'resolved', 'study', 'of', 'solar', 'and', 'heliospheric', 'radio', 'bursts', 'which', 'are', 'complemented', 'by', 'heliospheric', 'propagation', 'studies', 'using', 'both', 'background', 'astronomical', 'radio', 'emissions', 'as', 'well', 'as', 'the', 'bursts', 'themselves', 'in', 'this', 'paper', 'the', 'state', 'of', 'the', 'art', 'in', 'such', 'wide', 'field', 'solar', 'and', 'heliospheric', 'radio', 'studies', 'is', 'summarized', 'including', 'recent', 'results', 'from', 'the', 'murchison', 'widefield', 'array', 'mwa', 'the', 'prospects', 'for', 'major', 'advances', 'in', 'observational', 'capabilities', 'in', 'the', 'near', 'future', 'are', 'reviewed', 'with', 'particular', 'emphasis', 'on', 'the', 'rapid', 'system', 'developed', 'at', 'haystack', 'observatory']] | [-0.08394110212846957, 0.1769541310444221, 0.03449800642219936, 0.07225654869131287, -0.1084765825487141, -0.0812959015293389, -0.025404582857344375, 0.45317712606114596, -0.21108645970495987, -0.3562928774888266, 0.1834927909424668, -0.25438762718469515, -0.1472142623851494, 0.31092161052190337, 0.005523513071238995, 0.041459549334831536, 0.11574562150212069, -0.12556361279380665, -0.0056852338927462194, -0.15372434890192307, 0.1928393240973708, 0.22579644006505914, 0.27794405737880706, 0.008866853326191606, 0.08103551340232394, -0.03229712074476795, -0.11383407891785004, 0.03410436771176502, -0.07140505413875636, 0.0798805646921451, 0.32327271803903085, 0.17537952218280764, 0.22279590265001772, -0.5052155885389265, -0.2405932930291814, 0.010156728549017793, 0.14627367871984534, 0.016266486964657344, -0.08998447442460936, -0.3543809655369545, 0.041696225647374255, -0.17684005809073544, -0.168211598304056, -0.013415988539292106, -0.013937941263746596, 0.1123032056248183, -0.20006886214337813, 0.0017253041271750695, -0.06451450619485458, 0.09779779677323643, -0.0820610718326453, -0.13717133090213626, 0.058927746434208186, 0.14310570127650665, 0.01128907484274839, 0.050586353174131994, 0.09383220839326833, -0.15243770659356345, -0.10049081083108373, 0.3523505063803524, -0.06996494811661795, -0.030379528113241707, 0.24671020360701545, -0.25631631224089124, -0.20560206155780525, 0.13269822163741757, 0.2007432323136069, 0.06640792686213441, -0.16581925448999568, 0.08411514591429617, 0.031038348559847696, 0.13823815627454394, 0.06352579575602194, 0.12923088426175874, 0.3368102876963664, 0.19775626212390152, 0.09104268566933366, 0.06995799167233767, -0.2335548972644444, 0.008838011228264038, -0.22160027889363773, -0.08925875199350472, -0.14671705017772307, 0.038140447229403546, -0.04867992754890995, -0.11645604043305681, 0.3946801377967203, 0.15250849682951764, 0.10327470683347002, -0.009373338613500756, 0.3563413605043272, 0.03943070117146613, 0.09259709234343094, 0.03596434264830282, 0.3186277365755467, 0.10776254109924241, 0.21640454698670783, -0.1406423536328865, 0.015877215639366546, -0.03257127052872302] |
1,802.01779 | Isotropic Subspaces of Schur Modules | It is a well-known fact that over the complex numbers and for a fixed $k$ and
$n$, a generic $s$ in $Sym^2V^*$ vanishes on some $k$-dimensional subspace of
$V$ if and only if $n\geq 2k$. Tevelev found exact conditions for the extension
of this statement for general symmetric and skew-symmetric multilinear forms,
and we extend his work to all possible symmetric types, which corresponds to
Schur modules for a general partition.
| math.CO math.AG | it is a wellknown fact that over the complex numbers and for a fixed k and n a generic s in sym2v vanishes on some kdimensional subspace of v if and only if ngeq 2k tevelev found exact conditions for the extension of this statement for general symmetric and skewsymmetric multilinear forms and we extend his work to all possible symmetric types which corresponds to schur modules for a general partition | [['it', 'is', 'a', 'wellknown', 'fact', 'that', 'over', 'the', 'complex', 'numbers', 'and', 'for', 'a', 'fixed', 'k', 'and', 'n', 'a', 'generic', 's', 'in', 'sym2v', 'vanishes', 'on', 'some', 'kdimensional', 'subspace', 'of', 'v', 'if', 'and', 'only', 'if', 'ngeq', '2k', 'tevelev', 'found', 'exact', 'conditions', 'for', 'the', 'extension', 'of', 'this', 'statement', 'for', 'general', 'symmetric', 'and', 'skewsymmetric', 'multilinear', 'forms', 'and', 'we', 'extend', 'his', 'work', 'to', 'all', 'possible', 'symmetric', 'types', 'which', 'corresponds', 'to', 'schur', 'modules', 'for', 'a', 'general', 'partition']] | [-0.15034308707607644, 0.08634518225610788, -0.02297895047813654, 0.044195816155323496, -0.08588112558770393, -0.1992807268165052, 0.021415877555097853, 0.30994718209175126, -0.2717650786773967, -0.18257948202746255, 0.10533781274986853, -0.2405441425740719, -0.1959197904548741, 0.18851203728866364, -0.05634550664773477, -0.02486594125096287, 0.015646523124139222, 0.13122470924364668, -0.11048201322971311, -0.3083447544702462, 0.3628105008176395, -0.05537839900436146, 0.19454841448127158, 0.05086722173395434, 0.11621286666819028, 0.051627531226923956, 0.015732294440801653, 0.02346033426500591, -0.14529680711867904, 0.1022716498135456, 0.2893254124692508, 0.1365775106142142, 0.23208144679665565, -0.33669553687795994, -0.14084520653954574, 0.21701793882197568, 0.11388781609545862, 0.040363997997649545, 0.004903811247952815, -0.213831432243543, 0.16533610039124533, -0.1442408808872902, -0.17272585333058876, -0.0571401999797672, 0.15511066569347998, -0.038080246733235464, -0.34697715855602707, 0.012909466700096215, 0.16047135322753872, 0.035467316306728336, -0.04930004639817136, -0.15986381184775383, -0.00403312022265579, 0.054808468830638696, -0.038935167438882805, 0.05626003066343921, 0.02521771127358079, -0.07486503256950527, -0.08680760670187218, 0.3455644622844245, -0.02219385624464069, -0.24946842916376358, 0.15240118560115143, -0.14600827495700547, -0.16689510712832478, 0.10016926631797105, 0.07877862345693366, 0.17733284570276736, -0.059024380599813804, 0.18955011726606505, -0.1529906508512795, 0.09984135198340352, 0.14393780737050943, -0.010613883750712766, 0.13167059915140272, 0.0333517958010946, 0.1203327588870057, 0.1341412013862282, 0.015449596692009696, -0.04872027740763899, -0.35530136015232916, -0.2033102668938227, -0.16603976231500772, 0.12730631842943174, -0.10274728976219194, -0.15764959252971625, 0.38533717661297745, 0.08347911361072745, 0.17768686847495183, 0.13200331859989092, 0.23719688717808043, 0.0557122133007007, 0.05272742733359337, 0.09655890936846845, 0.1048851476404317, 0.19693535736628942, 0.015610820079954076, -0.1173404541930982, 0.008555048890411854, 0.1183278791207288] |
1,802.0178 | Goal Inference Improves Objective and Perceived Performance in
Human-Robot Collaboration | The study of human-robot interaction is fundamental to the design and use of
robotics in real-world applications. Robots will need to predict and adapt to
the actions of human collaborators in order to achieve good performance and
improve safety and end-user adoption. This paper evaluates a human-robot
collaboration scheme that combines the task allocation and motion levels of
reasoning: the robotic agent uses Bayesian inference to predict the next goal
of its human partner from his or her ongoing motion, and re-plans its own
actions in real time. This anticipative adaptation is desirable in many
practical scenarios, where humans are unable or unwilling to take on the
cognitive overhead required to explicitly communicate their intent to the
robot. A behavioral experiment indicates that the combination of goal inference
and dynamic task planning significantly improves both objective and perceived
performance of the human-robot team. Participants were highly sensitive to the
differences between robot behaviors, preferring to work with a robot that
adapted to their actions over one that did not.
| cs.RO cs.AI cs.HC | the study of humanrobot interaction is fundamental to the design and use of robotics in realworld applications robots will need to predict and adapt to the actions of human collaborators in order to achieve good performance and improve safety and enduser adoption this paper evaluates a humanrobot collaboration scheme that combines the task allocation and motion levels of reasoning the robotic agent uses bayesian inference to predict the next goal of its human partner from his or her ongoing motion and replans its own actions in real time this anticipative adaptation is desirable in many practical scenarios where humans are unable or unwilling to take on the cognitive overhead required to explicitly communicate their intent to the robot a behavioral experiment indicates that the combination of goal inference and dynamic task planning significantly improves both objective and perceived performance of the humanrobot team participants were highly sensitive to the differences between robot behaviors preferring to work with a robot that adapted to their actions over one that did not | [['the', 'study', 'of', 'humanrobot', 'interaction', 'is', 'fundamental', 'to', 'the', 'design', 'and', 'use', 'of', 'robotics', 'in', 'realworld', 'applications', 'robots', 'will', 'need', 'to', 'predict', 'and', 'adapt', 'to', 'the', 'actions', 'of', 'human', 'collaborators', 'in', 'order', 'to', 'achieve', 'good', 'performance', 'and', 'improve', 'safety', 'and', 'enduser', 'adoption', 'this', 'paper', 'evaluates', 'a', 'humanrobot', 'collaboration', 'scheme', 'that', 'combines', 'the', 'task', 'allocation', 'and', 'motion', 'levels', 'of', 'reasoning', 'the', 'robotic', 'agent', 'uses', 'bayesian', 'inference', 'to', 'predict', 'the', 'next', 'goal', 'of', 'its', 'human', 'partner', 'from', 'his', 'or', 'her', 'ongoing', 'motion', 'and', 'replans', 'its', 'own', 'actions', 'in', 'real', 'time', 'this', 'anticipative', 'adaptation', 'is', 'desirable', 'in', 'many', 'practical', 'scenarios', 'where', 'humans', 'are', 'unable', 'or', 'unwilling', 'to', 'take', 'on', 'the', 'cognitive', 'overhead', 'required', 'to', 'explicitly', 'communicate', 'their', 'intent', 'to', 'the', 'robot', 'a', 'behavioral', 'experiment', 'indicates', 'that', 'the', 'combination', 'of', 'goal', 'inference', 'and', 'dynamic', 'task', 'planning', 'significantly', 'improves', 'both', 'objective', 'and', 'perceived', 'performance', 'of', 'the', 'humanrobot', 'team', 'participants', 'were', 'highly', 'sensitive', 'to', 'the', 'differences', 'between', 'robot', 'behaviors', 'preferring', 'to', 'work', 'with', 'a', 'robot', 'that', 'adapted', 'to', 'their', 'actions', 'over', 'one', 'that', 'did', 'not']] | [-0.09332504238934702, 0.027055384348747293, -0.08266312566161509, 0.034734305727967894, -0.21464778094128126, -0.18378319446350166, 0.08562828671289112, 0.4607934606807119, -0.22467145189565754, -0.3856299647058432, 0.051094509048811736, -0.23629965666356392, -0.20673200420032328, 0.15524658845935965, -0.2043196475078192, 0.071715897719993, 0.10804138257245384, 0.09216876808394121, 0.0207432470843747, -0.2822079741776254, 0.24877897430674212, 0.06433455182305543, 0.2750931593545398, 0.051887642003915456, 0.10866631614182078, 0.03468261777145028, -0.017045828276837365, -0.04096254953197011, -0.06012876938905198, 0.16843110514520915, 0.358440491018511, 0.21777859063730878, 0.3610587252976274, -0.4234050851612842, -0.15995975172411672, 0.10845617091657936, 0.10908330762386872, 0.038128849019753865, 0.029116310376932943, -0.3658449568967583, 0.07572214953055793, -0.21896995418944765, -0.070946883829035, -0.09598139589707527, -0.003641494840504767, 0.001163249501280663, -0.2790868253799806, -0.04629188821635198, 0.023498827056992338, 0.07658020268089673, -0.07677294743611042, -0.04643705486700203, 0.01904035883668666, 0.28150236252254457, 0.08583955481488632, 0.04155307026929911, 0.20382963570066281, -0.18397335042300794, -0.18960807274113625, 0.4281174960221059, 0.026093389288544346, -0.20735804142000583, 0.25656483856480317, -0.08638736657790023, -0.13168112009477156, 0.07155873276535753, 0.2532586907029714, 0.09142779903458817, -0.1668726531189409, 0.010419135144498397, 0.046197702816119915, 0.18321418330988146, 0.02930044481729174, -0.02555663412513994, 0.1715583756990378, 0.20568625680198507, 0.07774614570724375, 0.06319839664398742, -0.0076447338783375085, -0.1315315509416141, -0.21170325760492648, -0.14250129609666323, -0.13956025734091915, -0.03212539428497524, -0.03303261885361625, -0.06365865540205772, 0.3737808276814818, 0.2641787865314875, 0.13891424299300423, 0.10376476405116801, 0.34967963921302964, 0.001326972870128615, 0.06318269155026805, 0.06054056020379177, 0.2121755121215164, -0.00869970428950247, 0.18845383209223204, -0.25169503167354274, 0.13992812225427037, -0.03848387427991752] |
1,802.01781 | A parallel Voronoi-based approach for mesoscale simulations of cell
aggregate electropermeabilization | We introduce a numerical framework that enables unprecedented direct
numerical studies of the electropermeabilization effects of a cell aggregate at
the meso-scale. Our simulations qualitatively replicate the shadowing effect
observed in experiments and reproduce the time evolution of the impedance of
the cell sample in agreement with the trends observed in experiments. This
approach sets the scene for performing homogenization studies for understanding
the effect of tissue environment on the efficiency of electropermeabilization.
We employ a forest of Octree grids along with a Voronoi mesh in a parallel
environment that exhibits excellent scalability. We exploit the electric
interactions between the cells through a nonlinear phenomenological model that
is generalized to account for the permeability of the cell membranes. We use
the Voronoi Interface Method (VIM) to accurately capture the sharp jump in the
electric potential on the cell boundaries. The case study simulation covers a
volume of $(1\ mm)^3$ with more than $27,000$ well-resolved cells with a
heterogeneous mix of morphologies that are randomly distributed throughout a
spheroid region.
| physics.comp-ph | we introduce a numerical framework that enables unprecedented direct numerical studies of the electropermeabilization effects of a cell aggregate at the mesoscale our simulations qualitatively replicate the shadowing effect observed in experiments and reproduce the time evolution of the impedance of the cell sample in agreement with the trends observed in experiments this approach sets the scene for performing homogenization studies for understanding the effect of tissue environment on the efficiency of electropermeabilization we employ a forest of octree grids along with a voronoi mesh in a parallel environment that exhibits excellent scalability we exploit the electric interactions between the cells through a nonlinear phenomenological model that is generalized to account for the permeability of the cell membranes we use the voronoi interface method vim to accurately capture the sharp jump in the electric potential on the cell boundaries the case study simulation covers a volume of 1 mm3 with more than 27000 wellresolved cells with a heterogeneous mix of morphologies that are randomly distributed throughout a spheroid region | [['we', 'introduce', 'a', 'numerical', 'framework', 'that', 'enables', 'unprecedented', 'direct', 'numerical', 'studies', 'of', 'the', 'electropermeabilization', 'effects', 'of', 'a', 'cell', 'aggregate', 'at', 'the', 'mesoscale', 'our', 'simulations', 'qualitatively', 'replicate', 'the', 'shadowing', 'effect', 'observed', 'in', 'experiments', 'and', 'reproduce', 'the', 'time', 'evolution', 'of', 'the', 'impedance', 'of', 'the', 'cell', 'sample', 'in', 'agreement', 'with', 'the', 'trends', 'observed', 'in', 'experiments', 'this', 'approach', 'sets', 'the', 'scene', 'for', 'performing', 'homogenization', 'studies', 'for', 'understanding', 'the', 'effect', 'of', 'tissue', 'environment', 'on', 'the', 'efficiency', 'of', 'electropermeabilization', 'we', 'employ', 'a', 'forest', 'of', 'octree', 'grids', 'along', 'with', 'a', 'voronoi', 'mesh', 'in', 'a', 'parallel', 'environment', 'that', 'exhibits', 'excellent', 'scalability', 'we', 'exploit', 'the', 'electric', 'interactions', 'between', 'the', 'cells', 'through', 'a', 'nonlinear', 'phenomenological', 'model', 'that', 'is', 'generalized', 'to', 'account', 'for', 'the', 'permeability', 'of', 'the', 'cell', 'membranes', 'we', 'use', 'the', 'voronoi', 'interface', 'method', 'vim', 'to', 'accurately', 'capture', 'the', 'sharp', 'jump', 'in', 'the', 'electric', 'potential', 'on', 'the', 'cell', 'boundaries', 'the', 'case', 'study', 'simulation', 'covers', 'a', 'volume', 'of', '1', 'mm3', 'with', 'more', 'than', '27000', 'wellresolved', 'cells', 'with', 'a', 'heterogeneous', 'mix', 'of', 'morphologies', 'that', 'are', 'randomly', 'distributed', 'throughout', 'a', 'spheroid', 'region']] | [-0.09156762167174898, 0.06268037921065718, -0.07588117414177534, 0.02265316514937571, -0.014206868546777928, -0.0701588637542707, 0.06929310908976435, 0.41568859009700415, -0.22130318354682985, -0.29036565506059303, 0.04106934504873139, -0.28193699920098103, -0.15966104494791633, 0.18183831089539948, -0.03669701803619588, 0.009699941728506568, 0.07913183432882487, -0.035265949439014906, -0.003202500483076248, -0.193928706441791, 0.25614997350332497, 0.061807076547972684, 0.3171315501807753, 0.023802397674853367, 0.10846881937929953, -0.04189711182306592, -0.031865146164727236, 0.08906309191997235, -0.14125024405058015, 0.12302135965737278, 0.21596644468296913, 0.05252257069936518, 0.24983069025387866, -0.4874515234981026, -0.2562479229875394, 0.04690871840017743, 0.15492328608232225, 0.09019938738294739, -0.08219036144197894, -0.21265359335446718, 0.09355223103916857, -0.13113385311895487, -0.13774968712789024, -0.038942727860967086, -0.025336599815085795, 0.06162970759299689, -0.284833519933084, 0.10045190475269403, 0.004275662028203173, 0.0770557635827486, -0.08472923910832197, -0.07331685382547684, -0.008292436978597877, 0.1533513276558094, -0.01819991209260436, -0.022638649553661207, 0.1696348865089398, -0.11494980200149736, -0.08416851120312098, 0.40234887431315064, -0.029156390918276175, -0.21014131690491233, 0.20054282946546545, -0.19694182168989932, -0.08999913506011462, 0.15544968569023015, 0.21723940934622166, 0.0913346665360298, -0.1324390213407532, 0.045247317456775314, -0.04715721919504408, 0.16867119244839887, 0.03107028932740482, -0.03943373441470397, 0.17656941701983206, 0.2616824583403943, 0.023944476677914914, 0.1384156158468796, -0.1283418418186546, -0.10451805793277963, -0.27125711645242157, -0.1477653986261882, -0.15636239460388407, -0.016057476216028915, -0.1477738531385087, -0.1987912835740655, 0.4003277421879345, 0.1796595823328347, 0.19837707968789686, 0.07113508519388669, 0.3210876195763166, 0.0221454746306174, 0.09605208062429048, 0.028183056876482166, 0.1893081423666703, 0.12484567626737632, 0.14997205757894194, -0.2706153318513262, 0.06831496725266678, 0.025801521699776397] |
1,802.01782 | Anisotropic diffraction induced by orbital angular momentum during
propagations of optical beams | It is demonstrated that the orbital angular momentum (OAM) carried by the
elliptic beam without the phase-singularity can induce the anisotropic
diffraction (AD). The quantitative relation between the OAM and its induced AD
is analytically obtained by a comparison of two different kinds of
(1+2)-dimensional beam propagations: the linear propagations of the elliptic
beam without the OAM in an anisotropic medium and that with the OAM in an
isotropic one. In the former case, the optical beam evolves as the fundamental
mode of the eigenmodes when its ellipticity is the square root of the
anisotropic parameter defined in the paper; while in the latter case, the
fundamental mode exists only when the OAM carried by the optical beam equals a
specific one called a critical OAM. The OAM always enhances the beam-expanding
in the major-axis direction and weakens that in the minor-axis direction no
matter the sign of the OAM, and the larger the OAM, the stronger the AD induced
by it. Besides, the OAM can also make the elliptic beam rotate, and the
absolute value of the rotation angle is no larger than $\pi/2$ during the
propagation.
| physics.optics | it is demonstrated that the orbital angular momentum oam carried by the elliptic beam without the phasesingularity can induce the anisotropic diffraction ad the quantitative relation between the oam and its induced ad is analytically obtained by a comparison of two different kinds of 12dimensional beam propagations the linear propagations of the elliptic beam without the oam in an anisotropic medium and that with the oam in an isotropic one in the former case the optical beam evolves as the fundamental mode of the eigenmodes when its ellipticity is the square root of the anisotropic parameter defined in the paper while in the latter case the fundamental mode exists only when the oam carried by the optical beam equals a specific one called a critical oam the oam always enhances the beamexpanding in the majoraxis direction and weakens that in the minoraxis direction no matter the sign of the oam and the larger the oam the stronger the ad induced by it besides the oam can also make the elliptic beam rotate and the absolute value of the rotation angle is no larger than pi2 during the propagation | [['it', 'is', 'demonstrated', 'that', 'the', 'orbital', 'angular', 'momentum', 'oam', 'carried', 'by', 'the', 'elliptic', 'beam', 'without', 'the', 'phasesingularity', 'can', 'induce', 'the', 'anisotropic', 'diffraction', 'ad', 'the', 'quantitative', 'relation', 'between', 'the', 'oam', 'and', 'its', 'induced', 'ad', 'is', 'analytically', 'obtained', 'by', 'a', 'comparison', 'of', 'two', 'different', 'kinds', 'of', '12dimensional', 'beam', 'propagations', 'the', 'linear', 'propagations', 'of', 'the', 'elliptic', 'beam', 'without', 'the', 'oam', 'in', 'an', 'anisotropic', 'medium', 'and', 'that', 'with', 'the', 'oam', 'in', 'an', 'isotropic', 'one', 'in', 'the', 'former', 'case', 'the', 'optical', 'beam', 'evolves', 'as', 'the', 'fundamental', 'mode', 'of', 'the', 'eigenmodes', 'when', 'its', 'ellipticity', 'is', 'the', 'square', 'root', 'of', 'the', 'anisotropic', 'parameter', 'defined', 'in', 'the', 'paper', 'while', 'in', 'the', 'latter', 'case', 'the', 'fundamental', 'mode', 'exists', 'only', 'when', 'the', 'oam', 'carried', 'by', 'the', 'optical', 'beam', 'equals', 'a', 'specific', 'one', 'called', 'a', 'critical', 'oam', 'the', 'oam', 'always', 'enhances', 'the', 'beamexpanding', 'in', 'the', 'majoraxis', 'direction', 'and', 'weakens', 'that', 'in', 'the', 'minoraxis', 'direction', 'no', 'matter', 'the', 'sign', 'of', 'the', 'oam', 'and', 'the', 'larger', 'the', 'oam', 'the', 'stronger', 'the', 'ad', 'induced', 'by', 'it', 'besides', 'the', 'oam', 'can', 'also', 'make', 'the', 'elliptic', 'beam', 'rotate', 'and', 'the', 'absolute', 'value', 'of', 'the', 'rotation', 'angle', 'is', 'no', 'larger', 'than', 'pi2', 'during', 'the', 'propagation']] | [-0.2016660668937269, 0.2133875626531462, -0.08271629343520329, 0.020175354518947662, -0.07632877673673373, -0.10104272821767916, -0.004231123778823843, 0.40426431554219416, -0.2866072606280326, -0.2698265906919034, 0.04524815701241154, -0.26696025588116556, -0.05834863339901291, 0.2187206980982615, 0.028283172036691378, 0.06039238138242014, 0.03462248520552611, 0.030007313063207974, -0.07651423244431654, -0.1599227509446322, 0.3372959998205945, 0.08182267244574765, 0.31924808555362766, 0.02067914677618612, 0.11236761862121683, 0.07267063893584325, -0.019933547101093716, -0.026794798353465363, -0.10479771857764365, 0.08785590203416344, 0.15757874654535886, 0.023822791874408722, 0.23850032877707752, -0.38350206628561984, -0.1914812970495913, 0.10988125731287304, 0.15432302564756833, 0.10052357161773108, -0.026829961342461687, -0.2241242614960278, 0.03691666712295965, -0.1310611429689352, -0.19638538733625444, -0.0024268153156103787, 0.020566185650926445, 0.007902995251076576, -0.23496486793362326, 0.07376177251725133, 0.11048085073895392, 0.0704282324520811, -0.020201475315687237, -0.11142172313405461, -0.13147759186204083, 0.06275272071117445, 0.08619859917358084, 0.07197147649362363, 0.06951392570670734, -0.1521104269095206, -0.08726551304183279, 0.3915896910312836, -0.022220841706971393, -0.24089067750259913, 0.07394563564930552, -0.18551143946333273, 0.01546584614909314, 0.143656596100779, 0.12738411007348888, 0.10774796902232113, -0.05538784656426444, 0.009940906536392367, -0.06457373484097902, 0.1933180837621612, 0.12542797616552762, 0.05145644775706954, 0.21836472663687923, 0.07645185744785453, 0.09962322247484999, 0.1386563733610655, -0.13707544284081588, -0.08617158129705511, -0.26938161940278826, -0.16270358528771628, -0.1960857169191298, 0.035947478987118205, -0.11752767444008358, -0.08083143832302221, 0.42516379357285555, 0.09928948909642929, 0.17003723971845497, -0.06120432976392969, 0.3496048075681482, 0.1512719795792564, 0.09078478612010718, 0.05541098667609115, 0.35695131979281863, 0.12772784779669458, 0.15247094396111224, -0.30624392285933016, 0.05057436126404472, 0.0019165562385673163] |
1,802.01783 | Large Synoptic Survey Telescope Solar System Science Roadmap | The Large Synoptic Survey Telescope (LSST) is uniquely equipped to search for
Solar System bodies due to its unprecedented combination of depth and wide
field coverage. Over a ten-year period starting in 2022, LSST will generate the
largest catalog of Solar System objects to date. The main goal of the LSST
Solar System Science Collaboration (SSSC) is to facilitate the efforts of the
planetary community to study the planets and small body populations residing
within our Solar System using LSST data. To prepare for future survey cadence
decisions and ensure that interesting and novel Solar System science is
achievable with LSST, the SSSC has identified and prioritized key Solar System
research areas for investigation with LSST in this roadmap. The ranked science
priorities highlighted in this living document will inform LSST survey cadence
decisions and aid in identifying software tools and pipelines needed to be
developed by the planetary community as added value products and resources
before the planned start of LSST science operations.
| astro-ph.EP astro-ph.IM | the large synoptic survey telescope lsst is uniquely equipped to search for solar system bodies due to its unprecedented combination of depth and wide field coverage over a tenyear period starting in 2022 lsst will generate the largest catalog of solar system objects to date the main goal of the lsst solar system science collaboration sssc is to facilitate the efforts of the planetary community to study the planets and small body populations residing within our solar system using lsst data to prepare for future survey cadence decisions and ensure that interesting and novel solar system science is achievable with lsst the sssc has identified and prioritized key solar system research areas for investigation with lsst in this roadmap the ranked science priorities highlighted in this living document will inform lsst survey cadence decisions and aid in identifying software tools and pipelines needed to be developed by the planetary community as added value products and resources before the planned start of lsst science operations | [['the', 'large', 'synoptic', 'survey', 'telescope', 'lsst', 'is', 'uniquely', 'equipped', 'to', 'search', 'for', 'solar', 'system', 'bodies', 'due', 'to', 'its', 'unprecedented', 'combination', 'of', 'depth', 'and', 'wide', 'field', 'coverage', 'over', 'a', 'tenyear', 'period', 'starting', 'in', '2022', 'lsst', 'will', 'generate', 'the', 'largest', 'catalog', 'of', 'solar', 'system', 'objects', 'to', 'date', 'the', 'main', 'goal', 'of', 'the', 'lsst', 'solar', 'system', 'science', 'collaboration', 'sssc', 'is', 'to', 'facilitate', 'the', 'efforts', 'of', 'the', 'planetary', 'community', 'to', 'study', 'the', 'planets', 'and', 'small', 'body', 'populations', 'residing', 'within', 'our', 'solar', 'system', 'using', 'lsst', 'data', 'to', 'prepare', 'for', 'future', 'survey', 'cadence', 'decisions', 'and', 'ensure', 'that', 'interesting', 'and', 'novel', 'solar', 'system', 'science', 'is', 'achievable', 'with', 'lsst', 'the', 'sssc', 'has', 'identified', 'and', 'prioritized', 'key', 'solar', 'system', 'research', 'areas', 'for', 'investigation', 'with', 'lsst', 'in', 'this', 'roadmap', 'the', 'ranked', 'science', 'priorities', 'highlighted', 'in', 'this', 'living', 'document', 'will', 'inform', 'lsst', 'survey', 'cadence', 'decisions', 'and', 'aid', 'in', 'identifying', 'software', 'tools', 'and', 'pipelines', 'needed', 'to', 'be', 'developed', 'by', 'the', 'planetary', 'community', 'as', 'added', 'value', 'products', 'and', 'resources', 'before', 'the', 'planned', 'start', 'of', 'lsst', 'science', 'operations']] | [-0.09823164758350553, 0.10373475264598865, -0.02030045977188842, 0.055659747907534106, -0.1497248685208899, -0.06201817587773293, 0.05929152445765439, 0.3345691682884424, -0.23532638168416736, -0.41956904995902555, 0.1475225506185713, -0.30913450818497507, -0.1223307513637559, 0.2681519990636422, -0.1270150554937129, 0.07365047219204049, 0.19357589879300355, -0.0662707740571577, 0.023403465161497546, -0.34329983287224003, 0.20892826088053948, 0.17905973986915608, 0.1953441350530583, -0.057281017025205785, 0.05907977565203044, -0.026420280729880466, -0.1064987116553267, -0.002149102175835429, -0.17327805608373437, 0.11725813400556856, 0.36089963133009606, 0.27630410435972963, 0.3079018440841493, -0.39075814495317457, -0.16835186069422378, 0.06781645223467112, 0.11896132084288316, 0.002228569960585091, -0.009922694687436267, -0.3323872619941717, 0.05676460069449471, -0.20597881012420147, -0.18227802169730706, -0.02697372468608636, 0.04633401273877542, 0.08117908707119967, -0.2243567664551026, -0.07045148407171549, -0.05249026131095001, 0.1448488734270696, -0.10929750652611823, -0.10337604000091144, -0.02522151199490309, 0.20489327509521235, -0.013435645277396118, 0.08480183230556843, 0.1345106450835152, -0.15204624742199951, -0.06895700622656632, 0.43916247891852767, -0.03191922277087209, -0.003978799889432039, 0.1541495882531929, -0.16876021217520734, -0.1661111242478577, 0.09406041527357202, 0.2758698166098173, 0.04270367972089954, -0.20903659637938624, 0.03862724293139763, 0.06269756100912828, 0.20792565904784857, 0.017362469408331756, 0.06697632012627565, 0.3510757223930119, 0.23578257562036103, 0.1495507061914484, 0.07165288007406449, -0.17794117546873167, -0.04975397101988187, -0.24537357944063842, -0.15610720302409878, -0.14827032625198183, 0.030627630770251883, -0.005902205665578793, -0.09473981718252705, 0.3730364586169854, 0.21384935292540255, 0.06391116623232913, 0.00045125032264012386, 0.2994879111548227, -0.030077389009842057, 0.14295277191390263, 0.021109954597394367, 0.2666126196613399, 0.05998076420425006, 0.21917483081300063, -0.15083843257303758, 0.04063904662786915, -0.014229578849087219] |
1,802.01784 | Giant electrocaloric response in the prototypical Pb(Mg,Nb)O$_{3}$
relaxor ferroelectric from atomistic simulations | An atomistic effective Hamiltonian is used to investigate electrocaloric (EC)
effects of Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$ (PMN) relaxor ferroelectrics in its
ergodic regime, and subject to electric fields applied along the pseudocubic
[111] direction. Such Hamiltonian qualitatively reproduces (i) the electric
field-versus-temperature phase diagram, including the existence of a critical
point where first-order and second-order transitions meet each other; and (ii)
a giant EC response near such critical point. It also reveals that such giant
response around this critical point is microscopically induced by field-induced
percolation of polar nanoregions. Moreover, it is also found that, for any
temperature above the critical point, the EC coefficient-versus-electric field
curve adopts a maximum (and thus larger electrocaloric response too), that can
be well described by the general Landau-like model proposed in [Jiang et al,
Phys. Rev. B 96, 014114 (2017)] and that is further correlated with specific
microscopic features related to dipoles lying along different rhombohedral
directions. Furthermore, for temperatures being at least 40 K higher than the
critical temperature, the (electric field, temperature) line associated with
this maximal EC coefficient is below both the Widom line and the line
representing percolation of polar nanoregions.
| cond-mat.mtrl-sci | an atomistic effective hamiltonian is used to investigate electrocaloric ec effects of pbmg_13nb_23o_3 pmn relaxor ferroelectrics in its ergodic regime and subject to electric fields applied along the pseudocubic 111 direction such hamiltonian qualitatively reproduces i the electric fieldversustemperature phase diagram including the existence of a critical point where firstorder and secondorder transitions meet each other and ii a giant ec response near such critical point it also reveals that such giant response around this critical point is microscopically induced by fieldinduced percolation of polar nanoregions moreover it is also found that for any temperature above the critical point the ec coefficientversuselectric field curve adopts a maximum and thus larger electrocaloric response too that can be well described by the general landaulike model proposed in jiang et al phys rev b 96 014114 2017 and that is further correlated with specific microscopic features related to dipoles lying along different rhombohedral directions furthermore for temperatures being at least 40 k higher than the critical temperature the electric field temperature line associated with this maximal ec coefficient is below both the widom line and the line representing percolation of polar nanoregions | [['an', 'atomistic', 'effective', 'hamiltonian', 'is', 'used', 'to', 'investigate', 'electrocaloric', 'ec', 'effects', 'of', 'pbmg_13nb_23o_3', 'pmn', 'relaxor', 'ferroelectrics', 'in', 'its', 'ergodic', 'regime', 'and', 'subject', 'to', 'electric', 'fields', 'applied', 'along', 'the', 'pseudocubic', '111', 'direction', 'such', 'hamiltonian', 'qualitatively', 'reproduces', 'i', 'the', 'electric', 'fieldversustemperature', 'phase', 'diagram', 'including', 'the', 'existence', 'of', 'a', 'critical', 'point', 'where', 'firstorder', 'and', 'secondorder', 'transitions', 'meet', 'each', 'other', 'and', 'ii', 'a', 'giant', 'ec', 'response', 'near', 'such', 'critical', 'point', 'it', 'also', 'reveals', 'that', 'such', 'giant', 'response', 'around', 'this', 'critical', 'point', 'is', 'microscopically', 'induced', 'by', 'fieldinduced', 'percolation', 'of', 'polar', 'nanoregions', 'moreover', 'it', 'is', 'also', 'found', 'that', 'for', 'any', 'temperature', 'above', 'the', 'critical', 'point', 'the', 'ec', 'coefficientversuselectric', 'field', 'curve', 'adopts', 'a', 'maximum', 'and', 'thus', 'larger', 'electrocaloric', 'response', 'too', 'that', 'can', 'be', 'well', 'described', 'by', 'the', 'general', 'landaulike', 'model', 'proposed', 'in', 'jiang', 'et', 'al', 'phys', 'rev', 'b', '96', '014114', '2017', 'and', 'that', 'is', 'further', 'correlated', 'with', 'specific', 'microscopic', 'features', 'related', 'to', 'dipoles', 'lying', 'along', 'different', 'rhombohedral', 'directions', 'furthermore', 'for', 'temperatures', 'being', 'at', 'least', '40', 'k', 'higher', 'than', 'the', 'critical', 'temperature', 'the', 'electric', 'field', 'temperature', 'line', 'associated', 'with', 'this', 'maximal', 'ec', 'coefficient', 'is', 'below', 'both', 'the', 'widom', 'line', 'and', 'the', 'line', 'representing', 'percolation', 'of', 'polar', 'nanoregions']] | [-0.12877720936892495, 0.18201682571972963, -0.021440416677123916, -0.006972293209870376, -0.05686058470809091, -0.16543962925444708, 0.08715716717509372, 0.38104936894610203, -0.2197270212264391, -0.2569459506200366, 0.02959934956399143, -0.29391734977002426, -0.17491374454481068, 0.1720065526496519, -0.005543090996422594, -0.0057220282987566285, -0.09351442910490497, 0.030994764530107438, -0.064760100046706, -0.17971212818394966, 0.248523177338704, 0.06228006560535681, 0.3258877503547958, 0.08951497874322838, 0.02242054996551365, -0.008772455936958712, 0.09981918034002295, 0.08416090674337841, -0.1712599615924754, -0.0017123769878620101, 0.2551513812291907, -0.010056593790850651, 0.17227242935088374, -0.3601118938106122, -0.23803442738129085, 0.06866392594641976, 0.10604290830119142, 0.08986478011118829, -0.018924229889757612, -0.2520110944926899, 0.07472655002243056, -0.10425051227988054, -0.1679389880449381, -0.056949555037683376, 0.056237392042393, 0.03694233588213401, -0.2579909485554503, 0.10232499562925534, 0.09231312589104017, 0.11845510397281658, -0.08281200330752019, -0.15286637233978298, -0.052912715478219415, 0.036845544252985266, 0.04243106366903771, 0.13395914970396428, 0.17402592747502268, -0.0796800053413076, -0.09579490173779558, 0.3694291510969721, -0.05354068760976999, -0.06164923347332465, 0.18882765126369533, -0.17780561437104297, -0.10273081512861354, 0.2040830623403552, 0.11430250160315986, 0.12000063161105318, -0.14601567093913834, 0.08604631310029823, 0.022083342701236727, 0.1299936303090284, 0.059190535519812855, -0.01975690012501042, 0.23264097977399587, 0.11637441673496317, 0.04416304468477686, 0.1371597553417462, -0.13680035547229402, -0.11994998616958788, -0.27188431728451, -0.14420843074568898, -0.18697801840952247, 0.0426001357733302, -0.10679540587592275, -0.17278113785221072, 0.3891903516656208, 0.1602952094882087, 0.19055800954185387, -0.03836016563738706, 0.21995239490793356, 0.1428037875091597, 0.032033885277429675, 0.11818897981266742, 0.2607266043653331, 0.1555080573219726, 0.11784037105458718, -0.27343537392950945, 0.06623956733520933, 0.03797300953558216] |
1,802.01785 | Stability of strong solutions to the Navier-Stokes-Fourier system | We identify a large class of objects - dissipative measure-valued (DMV)
solutions to the Navier-Stokes-Fourier system - in which the strong solutions
are stable. More precisely, a DMV solution coincides with the strong solution
emanating from the same initial data as long as the latter exists. The DMV
solutions are represented by parameterized families of measures satisfying
certain compatibility conditions. They can be seen as an analogue to the
dissipative measure-valued solutions introduced earlier in the context of the
(inviscid) Euler system.
| math.AP | we identify a large class of objects dissipative measurevalued dmv solutions to the navierstokesfourier system in which the strong solutions are stable more precisely a dmv solution coincides with the strong solution emanating from the same initial data as long as the latter exists the dmv solutions are represented by parameterized families of measures satisfying certain compatibility conditions they can be seen as an analogue to the dissipative measurevalued solutions introduced earlier in the context of the inviscid euler system | [['we', 'identify', 'a', 'large', 'class', 'of', 'objects', 'dissipative', 'measurevalued', 'dmv', 'solutions', 'to', 'the', 'navierstokesfourier', 'system', 'in', 'which', 'the', 'strong', 'solutions', 'are', 'stable', 'more', 'precisely', 'a', 'dmv', 'solution', 'coincides', 'with', 'the', 'strong', 'solution', 'emanating', 'from', 'the', 'same', 'initial', 'data', 'as', 'long', 'as', 'the', 'latter', 'exists', 'the', 'dmv', 'solutions', 'are', 'represented', 'by', 'parameterized', 'families', 'of', 'measures', 'satisfying', 'certain', 'compatibility', 'conditions', 'they', 'can', 'be', 'seen', 'as', 'an', 'analogue', 'to', 'the', 'dissipative', 'measurevalued', 'solutions', 'introduced', 'earlier', 'in', 'the', 'context', 'of', 'the', 'inviscid', 'euler', 'system']] | [-0.18677313818334368, 0.06246129889786971, -0.07939611718757078, 0.0955701292376034, -0.04940574961656239, -0.12954591958550737, -0.06194969327189028, 0.25775546580553055, -0.3180713238660246, -0.2549723626114428, 0.1491457271622494, -0.28944308077625464, -0.0864697094890289, 0.19124902109615505, -0.0765120419615414, 0.1123483322095126, 0.08107680170214734, 0.021655323353479618, -0.04372244723635958, -0.1710699924034998, 0.3691986117279157, -0.0016400599939515813, 0.24015814673621208, -0.04096047759521752, 0.1302368413322256, -0.08586309604579583, 0.03434166872175411, 0.0814263419888448, -0.1642582517990377, 0.040409937349613755, 0.24461695584468543, 0.10611512191826478, 0.2735216810076963, -0.39592534843832256, -0.20183419464156033, 0.1336110946838744, 0.12776172590674834, 0.11570358426397434, -0.0192719046763159, -0.32678438401781024, 0.10454320028657094, -0.1653986163495574, -0.22682351561379618, -0.05590970183602621, 0.03563241097144783, 0.12781389929004944, -0.27109363179188223, 0.05747822358825942, 0.11041428518947213, -0.025320519215893, -0.1656924007460475, -0.02327430801524315, -0.07615285189822316, 0.09779613153077663, 0.0768208434456028, 0.0018973814730998129, 0.03871350535191596, -0.16315559491049497, -0.07991346202325075, 0.3824588296469301, -0.1297490254335571, -0.24955550448503344, 0.2542559835826978, -0.09639678233652375, -0.11436178717412986, 0.15954735279956367, 0.11044054293306545, 0.1589017241843976, -0.16514795689145104, 0.09064325188519433, -0.1281273061526008, 0.10623825582442806, 0.10942667128983885, 0.036890778853558, 0.16820860706502572, 0.14152425338397734, 0.1186798389418982, 0.1672890815549181, 0.017518319969531147, -0.1483858301595319, -0.3382391918072244, -0.14187845725100487, -0.13146676609758287, 0.10334170124260708, -0.09205838202033192, -0.21710735140368342, 0.32416069181053897, 0.09858928558242042, 0.1811261098482646, 0.0696374708917574, 0.1935916806178284, 0.17777510216255904, 0.05366188539192081, 0.07815304532414302, 0.22428478490910492, 0.11133629666583147, 0.14297705927165225, -0.17074544131464792, 0.06647888304069056, 0.12702665326651186] |
1,802.01786 | Mining Public Opinion about Economic Issues: Twitter and the U.S.
Presidential Election | Opinion polls have been the bridge between public opinion and politicians in
elections. However, developing surveys to disclose people's feedback with
respect to economic issues is limited, expensive, and time-consuming. In recent
years, social media such as Twitter has enabled people to share their opinions
regarding elections. Social media has provided a platform for collecting a
large amount of social media data. This paper proposes a computational public
opinion mining approach to explore the discussion of economic issues in social
media during an election. Current related studies use text mining methods
independently for election analysis and election prediction; this research
combines two text mining methods: sentiment analysis and topic modeling. The
proposed approach has effectively been deployed on millions of tweets to
analyze economic concerns of people during the 2012 US presidential election.
| cs.SI cs.CL cs.IR stat.AP stat.ML | opinion polls have been the bridge between public opinion and politicians in elections however developing surveys to disclose peoples feedback with respect to economic issues is limited expensive and timeconsuming in recent years social media such as twitter has enabled people to share their opinions regarding elections social media has provided a platform for collecting a large amount of social media data this paper proposes a computational public opinion mining approach to explore the discussion of economic issues in social media during an election current related studies use text mining methods independently for election analysis and election prediction this research combines two text mining methods sentiment analysis and topic modeling the proposed approach has effectively been deployed on millions of tweets to analyze economic concerns of people during the 2012 us presidential election | [['opinion', 'polls', 'have', 'been', 'the', 'bridge', 'between', 'public', 'opinion', 'and', 'politicians', 'in', 'elections', 'however', 'developing', 'surveys', 'to', 'disclose', 'peoples', 'feedback', 'with', 'respect', 'to', 'economic', 'issues', 'is', 'limited', 'expensive', 'and', 'timeconsuming', 'in', 'recent', 'years', 'social', 'media', 'such', 'as', 'twitter', 'has', 'enabled', 'people', 'to', 'share', 'their', 'opinions', 'regarding', 'elections', 'social', 'media', 'has', 'provided', 'a', 'platform', 'for', 'collecting', 'a', 'large', 'amount', 'of', 'social', 'media', 'data', 'this', 'paper', 'proposes', 'a', 'computational', 'public', 'opinion', 'mining', 'approach', 'to', 'explore', 'the', 'discussion', 'of', 'economic', 'issues', 'in', 'social', 'media', 'during', 'an', 'election', 'current', 'related', 'studies', 'use', 'text', 'mining', 'methods', 'independently', 'for', 'election', 'analysis', 'and', 'election', 'prediction', 'this', 'research', 'combines', 'two', 'text', 'mining', 'methods', 'sentiment', 'analysis', 'and', 'topic', 'modeling', 'the', 'proposed', 'approach', 'has', 'effectively', 'been', 'deployed', 'on', 'millions', 'of', 'tweets', 'to', 'analyze', 'economic', 'concerns', 'of', 'people', 'during', 'the', '2012', 'us', 'presidential', 'election']] | [-0.08323227564972314, -0.007917155157070067, -0.0821021293216434, 0.08956910165628992, -0.23544068564485787, -0.15282348398805448, 0.14556586039445146, 0.4390411069406603, -0.21566100335238794, -0.34838539493468035, 0.11831350345252067, -0.4035337530356601, -0.17800415048281193, 0.15796962038559587, -0.14251005779461642, 0.049408158255895056, 0.12227572749992062, 0.03187044616613565, 0.12890738924734182, -0.3960707054413939, 0.2763361110460517, 0.03169303207091035, 0.39697328618818656, 0.08513560362118192, 0.07401993690160125, 0.013112762909648674, -0.19160406724584841, -0.030294958802283202, -0.11134619371618908, 0.1884906188185726, 0.44877744778374534, 0.26301894623688177, 0.5041656735312908, -0.44152248588467674, -0.21189251562223343, 0.10231951550104396, 0.12936512885713264, 0.10704211991816878, -0.04086607173732937, -0.39485187901366026, 0.017195158182902445, -0.271113658884078, -0.050157874556524415, -0.12559959283396183, 0.06283564703132873, 0.0034218018625091972, -0.1933744704925028, 0.038907820603957304, -0.02386765127399362, 0.16877009538247398, 0.026110781104605, -0.05246893353357603, 0.058338616029324386, 0.2322468755767187, 0.18884162391847545, -0.03350697735786662, 0.16494651846202524, -0.18824787554156064, -0.22547658335039378, 0.4051263366958925, 0.044403028604399444, -0.09347139687900592, 0.17825194955558368, -0.029413181581163315, -0.21885984685776153, -0.0009542326337860939, 0.300536450718554, 0.035093808630691434, -0.2145265301766532, -0.029929901639531766, -0.07778303028273403, 0.22686008247721912, 0.09602040334611683, -0.06686887038518023, 0.18746121816120034, 0.24083370458390704, 0.07714617079915129, 0.06278893344552446, -0.009201256752616368, -0.15941367667392456, -0.06799428192443474, -0.09650319634719674, -0.15200290401795305, 0.0429767757405604, -0.09964995075645681, -0.1187532457231572, 0.3808840630800092, 0.2023974822420991, 0.10655448386179549, -0.03241253753465818, 0.27112906286142824, -0.07611985476004814, 0.03901092693930898, 0.09126775423231136, 0.15481947838587867, -0.005903372485050582, 0.3210374374936958, -0.11840360142514669, 0.20678135577004572, -0.021924020925578765] |
1,802.01787 | A Distributed Hybrid Hardware-In-the-Loop Simulation framework for
Infrastructure Enabled Autonomy | Infrastructure Enabled Autonomy (IEA) is a new paradigm that employs a
distributed intelligence architecture for connected autonomous vehicles by
offloading core functionalities to the infrastructure. In this paper, we
develop a simulation framework that can be used to study the concept. A key
challenge for such a simulation is the rapid increase in the scale of the
computations with the size of the infrastructure to be considered. Our
simulation framework is designed to be distributed and scales proportionally
with the infrastructure. By integrally using both the hardware controllers and
communication devices as part of the simulation framework, we achieve an
optimal balance between modeling of the dynamics and sensors, and reusing real
hardware for simulation of proprietary or complex communication methods.
Multiple cameras on the infrastructure are simulated. The simulation of the
camera image processing is done in distributed hardware and the resultant
position information is transmitted wirelessly to the computer simulating the
autonomous vehicle. We demonstrate closed loop control of a single vehicle
following given waypoints using information from multiple cameras located on
Road-Side-Units.
| cs.RO | infrastructure enabled autonomy iea is a new paradigm that employs a distributed intelligence architecture for connected autonomous vehicles by offloading core functionalities to the infrastructure in this paper we develop a simulation framework that can be used to study the concept a key challenge for such a simulation is the rapid increase in the scale of the computations with the size of the infrastructure to be considered our simulation framework is designed to be distributed and scales proportionally with the infrastructure by integrally using both the hardware controllers and communication devices as part of the simulation framework we achieve an optimal balance between modeling of the dynamics and sensors and reusing real hardware for simulation of proprietary or complex communication methods multiple cameras on the infrastructure are simulated the simulation of the camera image processing is done in distributed hardware and the resultant position information is transmitted wirelessly to the computer simulating the autonomous vehicle we demonstrate closed loop control of a single vehicle following given waypoints using information from multiple cameras located on roadsideunits | [['infrastructure', 'enabled', 'autonomy', 'iea', 'is', 'a', 'new', 'paradigm', 'that', 'employs', 'a', 'distributed', 'intelligence', 'architecture', 'for', 'connected', 'autonomous', 'vehicles', 'by', 'offloading', 'core', 'functionalities', 'to', 'the', 'infrastructure', 'in', 'this', 'paper', 'we', 'develop', 'a', 'simulation', 'framework', 'that', 'can', 'be', 'used', 'to', 'study', 'the', 'concept', 'a', 'key', 'challenge', 'for', 'such', 'a', 'simulation', 'is', 'the', 'rapid', 'increase', 'in', 'the', 'scale', 'of', 'the', 'computations', 'with', 'the', 'size', 'of', 'the', 'infrastructure', 'to', 'be', 'considered', 'our', 'simulation', 'framework', 'is', 'designed', 'to', 'be', 'distributed', 'and', 'scales', 'proportionally', 'with', 'the', 'infrastructure', 'by', 'integrally', 'using', 'both', 'the', 'hardware', 'controllers', 'and', 'communication', 'devices', 'as', 'part', 'of', 'the', 'simulation', 'framework', 'we', 'achieve', 'an', 'optimal', 'balance', 'between', 'modeling', 'of', 'the', 'dynamics', 'and', 'sensors', 'and', 'reusing', 'real', 'hardware', 'for', 'simulation', 'of', 'proprietary', 'or', 'complex', 'communication', 'methods', 'multiple', 'cameras', 'on', 'the', 'infrastructure', 'are', 'simulated', 'the', 'simulation', 'of', 'the', 'camera', 'image', 'processing', 'is', 'done', 'in', 'distributed', 'hardware', 'and', 'the', 'resultant', 'position', 'information', 'is', 'transmitted', 'wirelessly', 'to', 'the', 'computer', 'simulating', 'the', 'autonomous', 'vehicle', 'we', 'demonstrate', 'closed', 'loop', 'control', 'of', 'a', 'single', 'vehicle', 'following', 'given', 'waypoints', 'using', 'information', 'from', 'multiple', 'cameras', 'located', 'on', 'roadsideunits']] | [-0.19847820180698417, 0.04002219171274317, -0.07750488546457485, -0.022411808390277385, -0.06000910603826673, -0.1744073016941012, 0.0324193888722555, 0.3943143755882636, -0.2965507634497922, -0.35202953950555504, 0.11450466916738507, -0.24380894559007352, -0.15345765435506173, 0.24796257863736487, -0.11339558626460874, 0.09172708689417133, 0.08824106630228257, 0.010083166933243817, 0.018161455610895466, -0.21468571810608453, 0.27034852974419216, 0.07488351312851341, 0.317875456720612, 0.03205423383978891, 0.12240589409531362, -0.00022426235018533538, -0.024770841717013513, -0.008209209337873363, -0.038560319839506384, 0.17553799914734053, 0.30582341271581065, 0.19813652993072808, 0.3082998672088116, -0.4963941404210596, -0.20704828794636154, 0.08314151870857539, 0.1444031101753186, 0.03736313578843985, -0.0685614609332145, -0.3132205964721761, 0.11188911077373757, -0.21111151497896719, -0.1009745892851002, -0.03371159940082901, -0.0381714874843735, 0.05203664038014523, -0.27744269278970946, -0.04838006564244714, -0.04005931395416459, 0.08128902719934182, -0.04440805076023673, -0.01734819723528692, 0.02637155462811091, 0.21487967916844605, -0.0528453428983764, 0.022225021545229286, 0.19680704950119488, -0.12349172565288542, -0.14364912929334517, 0.38487458995265095, 0.026783455454947792, -0.2054152174574462, 0.17716032100557724, -0.026604963178832042, -0.10234384533638756, 0.09376162345703135, 0.2465046997404197, 0.08414110225516949, -0.18944560767461857, 0.05293361030501613, 0.02103418971936422, 0.18558829614956832, -0.015364306552025178, -0.003822247334488336, 0.20523566894779174, 0.27286095938099353, 0.10873654973191402, 0.11859385436735298, -0.10409796695845823, -0.14039670100606894, -0.2619521324583008, -0.1661978757568239, -0.21216778010236978, -0.011296979954530453, -0.0554352366339901, -0.10198327398527114, 0.35332803309549865, 0.20624336695041637, 0.120601607103907, 0.0815049620310444, 0.43709820454362136, 0.057915402851977396, 0.1391791642038687, 0.13799822866788197, 0.16229957904019018, 0.034272720344129134, 0.17028528893494915, -0.20923496589222496, 0.06348731623020494, -0.009955002685430748] |
1,802.01788 | Aggregate Graph Statistics | Collecting statistic from graph-based data is an increasingly studied topic
in the data mining community. We argue that these statistics have great value
as well in dynamic IoT contexts: they can support complex computational
activities involving distributed coordination and provision of situation
recognition. We show that the HyperANF algorithm for calculating the
neighbourhood function of vertices of a graph naturally allows for a fully
distributed and asynchronous implementation, thanks to a mapping to the field
calculus, a distribution model proposed for collective adaptive systems. This
mapping gives evidence that the field calculus framework is well-suited to
accommodate massively parallel computations over graphs. Furthermore, it
provides a new "self-stabilising" building block which can be used in aggregate
computing in several contexts, there including improved leader election or
network vulnerabilities detection.
| cs.DC | collecting statistic from graphbased data is an increasingly studied topic in the data mining community we argue that these statistics have great value as well in dynamic iot contexts they can support complex computational activities involving distributed coordination and provision of situation recognition we show that the hyperanf algorithm for calculating the neighbourhood function of vertices of a graph naturally allows for a fully distributed and asynchronous implementation thanks to a mapping to the field calculus a distribution model proposed for collective adaptive systems this mapping gives evidence that the field calculus framework is wellsuited to accommodate massively parallel computations over graphs furthermore it provides a new selfstabilising building block which can be used in aggregate computing in several contexts there including improved leader election or network vulnerabilities detection | [['collecting', 'statistic', 'from', 'graphbased', 'data', 'is', 'an', 'increasingly', 'studied', 'topic', 'in', 'the', 'data', 'mining', 'community', 'we', 'argue', 'that', 'these', 'statistics', 'have', 'great', 'value', 'as', 'well', 'in', 'dynamic', 'iot', 'contexts', 'they', 'can', 'support', 'complex', 'computational', 'activities', 'involving', 'distributed', 'coordination', 'and', 'provision', 'of', 'situation', 'recognition', 'we', 'show', 'that', 'the', 'hyperanf', 'algorithm', 'for', 'calculating', 'the', 'neighbourhood', 'function', 'of', 'vertices', 'of', 'a', 'graph', 'naturally', 'allows', 'for', 'a', 'fully', 'distributed', 'and', 'asynchronous', 'implementation', 'thanks', 'to', 'a', 'mapping', 'to', 'the', 'field', 'calculus', 'a', 'distribution', 'model', 'proposed', 'for', 'collective', 'adaptive', 'systems', 'this', 'mapping', 'gives', 'evidence', 'that', 'the', 'field', 'calculus', 'framework', 'is', 'wellsuited', 'to', 'accommodate', 'massively', 'parallel', 'computations', 'over', 'graphs', 'furthermore', 'it', 'provides', 'a', 'new', 'selfstabilising', 'building', 'block', 'which', 'can', 'be', 'used', 'in', 'aggregate', 'computing', 'in', 'several', 'contexts', 'there', 'including', 'improved', 'leader', 'election', 'or', 'network', 'vulnerabilities', 'detection']] | [-0.1396320290184876, 0.019629778743964304, -0.09457450630973534, 0.07960886129380254, -0.1144384647008436, -0.1531490470614833, 0.04963357109294901, 0.4050582510964266, -0.2935401207132106, -0.3429924704625394, 0.10862032901549842, -0.2170316029157058, -0.18817777792533297, 0.1914445882367129, -0.10216017584713508, 0.06311612284576246, 0.09416646016545074, 0.031866292714668336, 0.014966767649039944, -0.23674444386996366, 0.2543397867535927, 0.053007746768696594, 0.31970583171720884, 0.03019969519263841, 0.07467470044277377, 0.03575318284664852, -0.04425279626102988, 0.04991509411628394, -0.052123269002987055, 0.15690233300678258, 0.35221987127420284, 0.22352167484603186, 0.313959906224248, -0.433044435961764, -0.2019391067600412, 0.13115537879706987, 0.18521186309079676, 0.11353284637750552, -0.07383803006391539, -0.28934067808264907, 0.08704472342217269, -0.21124168059268836, -0.07321128089480868, -0.14127987560043617, 0.020688758096332815, 0.016251320524733198, -0.2954770914935904, -0.009817287566811713, 0.036385182382416184, 0.07599595727673335, -0.009470640624378801, -0.0840982892225648, 0.05728097123729224, 0.1355964077272012, 0.006910356942890483, 0.02987415804491602, 0.13536231299544604, -0.12670730683021247, -0.17629905062359433, 0.37092871279564016, -0.01724998272464488, -0.18277841288047705, 0.1710793018835604, -0.04187478203980285, -0.2245173695020724, 0.09014245080436732, 0.2192767278341822, 0.10064939812706537, -0.17522721928219462, 0.07728378281860013, -0.040840709267920536, 0.15622895884565835, 0.024242809222823427, 0.00596937849800023, 0.19262924770889586, 0.21834451803177696, 0.1120727892095122, 0.13183943257493855, -0.05657215368782365, -0.15107795740874816, -0.22115039318807192, -0.15893368436341254, -0.17367211865015733, -0.02523303112419423, -0.1107345494699336, -0.18171036192179882, 0.37509914259462396, 0.19436652907856214, 0.15240065347179482, 0.08040488343740013, 0.3012001949521287, 0.07293812410821128, 0.1344960476921568, 0.13984549711927657, 0.13315964654329876, 0.0884155318765475, 0.15248209896024548, -0.12967646655774595, 0.09795261025537065, 0.020034683763605447] |
1,802.01789 | Resilient Blocks for Summarising Distributed Data | Summarising distributed data is a central routine for parallel programming,
lying at the core of widely used frameworks such as the map/reduce paradigm. In
the IoT context it is even more crucial, being a privileged mean to allow
long-range interactions: in fact, summarising is needed to avoid data explosion
in each computational unit.
We introduce a new algorithm for dynamic summarising of distributed data,
weighted multi-path, improving over the state-of-the-art multi-path algorithm.
We validate the new algorithm in an archetypal scenario, taking into account
sources of volatility of many sorts and comparing it to other existing
implementations. We thus show that weighted multi-path retains adequate
accuracy even in high-variability scenarios where the other algorithms are
diverging significantly from the correct values.
| cs.DC | summarising distributed data is a central routine for parallel programming lying at the core of widely used frameworks such as the mapreduce paradigm in the iot context it is even more crucial being a privileged mean to allow longrange interactions in fact summarising is needed to avoid data explosion in each computational unit we introduce a new algorithm for dynamic summarising of distributed data weighted multipath improving over the stateoftheart multipath algorithm we validate the new algorithm in an archetypal scenario taking into account sources of volatility of many sorts and comparing it to other existing implementations we thus show that weighted multipath retains adequate accuracy even in highvariability scenarios where the other algorithms are diverging significantly from the correct values | [['summarising', 'distributed', 'data', 'is', 'a', 'central', 'routine', 'for', 'parallel', 'programming', 'lying', 'at', 'the', 'core', 'of', 'widely', 'used', 'frameworks', 'such', 'as', 'the', 'mapreduce', 'paradigm', 'in', 'the', 'iot', 'context', 'it', 'is', 'even', 'more', 'crucial', 'being', 'a', 'privileged', 'mean', 'to', 'allow', 'longrange', 'interactions', 'in', 'fact', 'summarising', 'is', 'needed', 'to', 'avoid', 'data', 'explosion', 'in', 'each', 'computational', 'unit', 'we', 'introduce', 'a', 'new', 'algorithm', 'for', 'dynamic', 'summarising', 'of', 'distributed', 'data', 'weighted', 'multipath', 'improving', 'over', 'the', 'stateoftheart', 'multipath', 'algorithm', 'we', 'validate', 'the', 'new', 'algorithm', 'in', 'an', 'archetypal', 'scenario', 'taking', 'into', 'account', 'sources', 'of', 'volatility', 'of', 'many', 'sorts', 'and', 'comparing', 'it', 'to', 'other', 'existing', 'implementations', 'we', 'thus', 'show', 'that', 'weighted', 'multipath', 'retains', 'adequate', 'accuracy', 'even', 'in', 'highvariability', 'scenarios', 'where', 'the', 'other', 'algorithms', 'are', 'diverging', 'significantly', 'from', 'the', 'correct', 'values']] | [-0.10618577265153709, 0.036472050916747004, -0.07594485861713005, 0.0972097604910743, -0.08928732492014273, -0.1697213744459874, 0.030274785398928958, 0.41863357999231204, -0.2768319690261375, -0.31604840501773457, 0.08999753222619915, -0.2602226415818388, -0.10885742308248665, 0.2257088547156862, -0.09175957627363565, 0.06336302754639028, 0.07302522164392324, 0.02134486416562591, -0.036733895774270706, -0.27542597747577185, 0.25924585442528253, 0.06741794823738169, 0.2960567865828591, 0.0314849214079936, 0.07938513265271317, 0.0380392461237767, -0.05136465268211501, 0.02464936133993651, -0.0475053095227143, 0.1160412604404875, 0.2864933698476592, 0.20547307630585246, 0.31113412819248587, -0.45435415579329347, -0.2213292268820661, 0.11851998919828925, 0.1766158550061778, 0.10642295527610589, -0.03480182583734859, -0.2714017414957408, 0.10134820535794394, -0.18170390145522197, -0.0676752799017401, -0.074845284612249, -0.024578733277104966, 0.016309489588414834, -0.26996508996581564, 0.05082261356840695, 0.03277307085804487, 0.026098746360204574, -0.056884715314338766, -0.13434993674832374, 0.06297903995930164, 0.12702412384923947, 0.027896434599764583, 0.02632717613885102, 0.09188164903181952, -0.10266537613751105, -0.1434128762690412, 0.42021092604691823, -0.02334001299555698, -0.15441151382064847, 0.17461283673717032, -0.04690536493358533, -0.18036288875039697, 0.11707049472765489, 0.21192569665857092, 0.09009787105052725, -0.16823711592707907, 0.053856388747996135, 0.011420072079443734, 0.13423987973793142, 0.0094210203575386, 0.0481709781014322, 0.17602988621912713, 0.24875079423250737, 0.09225368511253075, 0.11706560152132557, -0.0929481049910359, -0.13859981599587115, -0.23907149006893536, -0.1398165719622115, -0.16788099593798483, -0.059531153464489735, -0.146948130322069, -0.1524336791538618, 0.36215863758621136, 0.23874678846048422, 0.17469194550298092, 0.06120180946674721, 0.3837508051694671, 0.050574863748047656, 0.11176564924665226, 0.13326222411441532, 0.17699065173529704, 0.05305058451817748, 0.1080317575097746, -0.14540983886026954, 0.11380164038528465, -0.0052378845828285146] |
1,802.0179 | Towards Runtime Monitoring of Node.js and Its Application to the
Internet of Things | In the last years Node.js has emerged as a framework particularly suitable
for implementing lightweight IoT applications, thanks to its underlying
asynchronous event-driven, non blocking I/O model. However, verifying the
correctness of programs with asynchronous nested callbacks is quite difficult,
and, hence, runtime monitoring can be a valuable support to tackle such a
complex task.
Runtime monitoring is a useful software verification technique that
complements static analysis and testing, but has not been yet fully explored in
the context of Internet of Things (IoT) systems. Trace expressions have been
successfully employed for runtime monitoring in widespread multiagent system
platforms. Recently, their expressive power has been extended to allow
parametric specifications on data that can be captured and monitored only at
runtime. Furthermore, they can be language and system agnostic, through the
notion of event domain and type. This paper investigates the use of parametric
trace expressions as a first step towards runtime monitoring of programs
developed in Node.js and Node-RED, a flow-based IoT programming tool built on
top of Node.js. Runtime verification of such systems is a task that mostly
seems to have been overlooked so far in the literature.
A prototype implementing the proposed system for Node.js, in order to
dynamically check with trace expressions the correct usage of API functions, is
presented. The tool exploits the dynamic analysis framework Jalangi for
monitoring Node.js programs and allows detection of errors that would be
difficult to catch with other techniques. Furthermore, it offers a simple REST
interface which can be exploited for runtime verification of Node-RED
components, and, more generally, IoT devices.
| cs.PL cs.LO cs.SE | in the last years nodejs has emerged as a framework particularly suitable for implementing lightweight iot applications thanks to its underlying asynchronous eventdriven non blocking io model however verifying the correctness of programs with asynchronous nested callbacks is quite difficult and hence runtime monitoring can be a valuable support to tackle such a complex task runtime monitoring is a useful software verification technique that complements static analysis and testing but has not been yet fully explored in the context of internet of things iot systems trace expressions have been successfully employed for runtime monitoring in widespread multiagent system platforms recently their expressive power has been extended to allow parametric specifications on data that can be captured and monitored only at runtime furthermore they can be language and system agnostic through the notion of event domain and type this paper investigates the use of parametric trace expressions as a first step towards runtime monitoring of programs developed in nodejs and nodered a flowbased iot programming tool built on top of nodejs runtime verification of such systems is a task that mostly seems to have been overlooked so far in the literature a prototype implementing the proposed system for nodejs in order to dynamically check with trace expressions the correct usage of api functions is presented the tool exploits the dynamic analysis framework jalangi for monitoring nodejs programs and allows detection of errors that would be difficult to catch with other techniques furthermore it offers a simple rest interface which can be exploited for runtime verification of nodered components and more generally iot devices | [['in', 'the', 'last', 'years', 'nodejs', 'has', 'emerged', 'as', 'a', 'framework', 'particularly', 'suitable', 'for', 'implementing', 'lightweight', 'iot', 'applications', 'thanks', 'to', 'its', 'underlying', 'asynchronous', 'eventdriven', 'non', 'blocking', 'io', 'model', 'however', 'verifying', 'the', 'correctness', 'of', 'programs', 'with', 'asynchronous', 'nested', 'callbacks', 'is', 'quite', 'difficult', 'and', 'hence', 'runtime', 'monitoring', 'can', 'be', 'a', 'valuable', 'support', 'to', 'tackle', 'such', 'a', 'complex', 'task', 'runtime', 'monitoring', 'is', 'a', 'useful', 'software', 'verification', 'technique', 'that', 'complements', 'static', 'analysis', 'and', 'testing', 'but', 'has', 'not', 'been', 'yet', 'fully', 'explored', 'in', 'the', 'context', 'of', 'internet', 'of', 'things', 'iot', 'systems', 'trace', 'expressions', 'have', 'been', 'successfully', 'employed', 'for', 'runtime', 'monitoring', 'in', 'widespread', 'multiagent', 'system', 'platforms', 'recently', 'their', 'expressive', 'power', 'has', 'been', 'extended', 'to', 'allow', 'parametric', 'specifications', 'on', 'data', 'that', 'can', 'be', 'captured', 'and', 'monitored', 'only', 'at', 'runtime', 'furthermore', 'they', 'can', 'be', 'language', 'and', 'system', 'agnostic', 'through', 'the', 'notion', 'of', 'event', 'domain', 'and', 'type', 'this', 'paper', 'investigates', 'the', 'use', 'of', 'parametric', 'trace', 'expressions', 'as', 'a', 'first', 'step', 'towards', 'runtime', 'monitoring', 'of', 'programs', 'developed', 'in', 'nodejs', 'and', 'nodered', 'a', 'flowbased', 'iot', 'programming', 'tool', 'built', 'on', 'top', 'of', 'nodejs', 'runtime', 'verification', 'of', 'such', 'systems', 'is', 'a', 'task', 'that', 'mostly', 'seems', 'to', 'have', 'been', 'overlooked', 'so', 'far', 'in', 'the', 'literature', 'a', 'prototype', 'implementing', 'the', 'proposed', 'system', 'for', 'nodejs', 'in', 'order', 'to', 'dynamically', 'check', 'with', 'trace', 'expressions', 'the', 'correct', 'usage', 'of', 'api', 'functions', 'is', 'presented', 'the', 'tool', 'exploits', 'the', 'dynamic', 'analysis', 'framework', 'jalangi', 'for', 'monitoring', 'nodejs', 'programs', 'and', 'allows', 'detection', 'of', 'errors', 'that', 'would', 'be', 'difficult', 'to', 'catch', 'with', 'other', 'techniques', 'furthermore', 'it', 'offers', 'a', 'simple', 'rest', 'interface', 'which', 'can', 'be', 'exploited', 'for', 'runtime', 'verification', 'of', 'nodered', 'components', 'and', 'more', 'generally', 'iot', 'devices']] | [-0.1354094602875019, -0.017074539280635702, -0.11559028822573622, 0.05978212363516619, -0.14758923042376465, -0.20964705336739048, 0.030828147397333777, 0.4063900129805351, -0.24609076464905535, -0.3348471142558588, 0.17936780623881096, -0.2000853163610017, -0.13095401217036978, 0.2529589930376202, -0.09141343911742784, 0.12678742427285225, 0.06462981036937371, -0.0025136594226001984, -0.018832371039721952, -0.22000764179760698, 0.23359315097332, 0.07140154304929341, 0.28214836842737295, 0.06427936236127868, 0.0669588729711535, 0.007310602494151513, -0.03173982828518312, 0.025199464568689864, -0.019165483227207493, 0.12633601563154823, 0.35996308369326524, 0.23542543263727678, 0.30665673140679056, -0.44129029383090723, -0.18428326704783787, 0.08286665410822136, 0.17858257040384107, 0.09441405583351005, -0.04480784788436276, -0.3071155920624733, 0.13106453991753775, -0.2448015035222859, -0.09592392773208452, -0.14555259026146325, 0.03478563904906783, 0.0027267916062918146, -0.22980446419259354, -0.05177928888108724, 0.055559531934300646, 0.08820785407041168, 0.008026374116309354, -0.06177696191225829, 0.008413208836789504, 0.15907231286182372, 0.01617999005448555, 0.0023986332312982772, 0.1469407827090258, -0.0878063501728613, -0.15073191476682507, 0.3745509980953837, -0.01726105881335706, -0.15880166777049215, 0.24517785208531695, -0.025280398844787673, -0.206163687058778, 0.09778749926097806, 0.2209759661160638, 0.11987922905552445, -0.24487508977923927, 0.09838739522443764, 0.021973955318317445, 0.22184157337711488, 0.02871880403066846, 0.04633570235879143, 0.19488941848820426, 0.23614102830018463, 0.05470887411956589, 0.1454433957094744, -0.016197294289410344, -0.08407509827030059, -0.208610066078903, -0.19052587924712477, -0.14208184392994333, -0.033846358856009194, -0.0249284805290194, -0.1498769002045965, 0.37008212116356026, 0.1883847101384567, 0.10664712336588779, 0.07303283095541116, 0.3716491625351667, 0.10071833102635583, 0.16148072252517487, 0.11095455882515957, 0.18185947226026805, 0.05405146327655641, 0.17938720610106929, -0.14736745404605878, 0.17084820842438633, 0.004601273557235454] |
1,802.01791 | Formalising Sensor Topologies for Target Counting | We present a formal model developed to reason about topologies created by
sensor ranges. This model is used to formalise the topological aspects of an
existing counting algorithm to estimate the number of targets in the area
covered by the sensors. To that end, we present a first-order logic tailored to
specify relations between parts of the space with respect to sensor coverage.
The logic serves as a specification language for Hoare-style proofs of
correctness of the topological computations of the algorithm, which uncovers
ambiguities in their results. Subsequently, we extend the formal model as a
step towards improving the estimation of the algorithm. Finally, we sketch how
the model can be extended to take mobile sensors and temporal aspects into
account.
| cs.LO | we present a formal model developed to reason about topologies created by sensor ranges this model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the sensors to that end we present a firstorder logic tailored to specify relations between parts of the space with respect to sensor coverage the logic serves as a specification language for hoarestyle proofs of correctness of the topological computations of the algorithm which uncovers ambiguities in their results subsequently we extend the formal model as a step towards improving the estimation of the algorithm finally we sketch how the model can be extended to take mobile sensors and temporal aspects into account | [['we', 'present', 'a', 'formal', 'model', 'developed', 'to', 'reason', 'about', 'topologies', 'created', 'by', 'sensor', 'ranges', 'this', 'model', 'is', 'used', 'to', 'formalise', 'the', 'topological', 'aspects', 'of', 'an', 'existing', 'counting', 'algorithm', 'to', 'estimate', 'the', 'number', 'of', 'targets', 'in', 'the', 'area', 'covered', 'by', 'the', 'sensors', 'to', 'that', 'end', 'we', 'present', 'a', 'firstorder', 'logic', 'tailored', 'to', 'specify', 'relations', 'between', 'parts', 'of', 'the', 'space', 'with', 'respect', 'to', 'sensor', 'coverage', 'the', 'logic', 'serves', 'as', 'a', 'specification', 'language', 'for', 'hoarestyle', 'proofs', 'of', 'correctness', 'of', 'the', 'topological', 'computations', 'of', 'the', 'algorithm', 'which', 'uncovers', 'ambiguities', 'in', 'their', 'results', 'subsequently', 'we', 'extend', 'the', 'formal', 'model', 'as', 'a', 'step', 'towards', 'improving', 'the', 'estimation', 'of', 'the', 'algorithm', 'finally', 'we', 'sketch', 'how', 'the', 'model', 'can', 'be', 'extended', 'to', 'take', 'mobile', 'sensors', 'and', 'temporal', 'aspects', 'into', 'account']] | [-0.08995288190361281, 0.028324616281768942, -0.1092305279291067, 0.058173418124244536, -0.10826439958936, -0.12585486909260088, 0.08771959287267117, 0.37737838113222455, -0.26809072793751465, -0.3665433038683555, 0.07964881850582105, -0.23628883521629834, -0.13493394341413315, 0.16867841858813754, -0.1220160009750275, 0.05974446040135427, 0.015955765869040957, 0.03304344098862322, -0.06137855479028076, -0.21827608828249648, 0.27821156325307295, 0.04058142698018766, 0.24328081340330546, 0.05248059005668333, 0.09175242416438509, 0.03145864372309603, -0.04563414045899618, 0.04663358217264625, -0.1389185861939279, 0.16383371896064672, 0.30893722178078575, 0.19049841956403413, 0.27934266129111657, -0.4530198711016383, -0.18791046962103822, 0.060418394936218124, 0.13018545609914134, 0.10777885679701404, -0.004664214701987192, -0.3283207602417249, 0.12338440539697032, -0.18871833499307272, -0.10399783408788384, -0.09493638272015531, 0.0015159787259018812, 0.006847487088888273, -0.23045308073337542, -0.05564093370692896, 0.10502314010871666, 0.03475259190242066, -0.055424043287515455, -0.05489284376667232, 0.02128792400510035, 0.174903288416824, 0.014669722949904217, -0.008182151254541317, 0.12213500762228534, -0.1083351093798601, -0.1546346255669706, 0.3683912399068444, -0.013464147624365038, -0.21291059218194397, 0.14988682871936349, -0.0634275108278103, -0.16131220375508315, 0.0775951712266313, 0.19319360809339609, 0.10530791321738822, -0.13876027961215767, 0.06551221494713691, 0.007761927144544688, 0.20268831577640575, 0.015414071977367534, 0.04139792128679816, 0.19459344921480926, 0.21291798586789212, 0.06516175791783427, 0.1945701542426832, -0.07078343259744259, -0.09518548595093068, -0.32733955038100726, -0.15958346293563572, -0.13713945789629076, -0.04185917913211418, -0.0646153333687298, -0.15747543454139692, 0.42384659118385465, 0.25449608536780677, 0.21123968173184846, 0.09717456681260717, 0.33180820771309805, 0.09947906989703474, 0.08508190508649426, 0.01772803514737819, 0.1743518458303593, 0.12099158830681174, 0.13098926256700863, -0.14628489447574392, 0.08396954998587731, 0.08599559885457342] |
1,802.01792 | A relation between Mirkovi\'c-Vilonen cycles and modules over
preprojective algebra of Dynkin quiver of type ADE | The irreducible components of the variety of all modules over the
preprojective algebra and MV cycles both index bases of the universal
enveloping algebra of the positive part of a semisimple Lie algebra
canonically. To relate these two objects Baumann and Kamnitzer associate a
cycle in the affine Grassmannian for a given module. It is conjectured that the
ring of functions of the T-fixed point subscheme of the associated cycle is
isomorphic to the cohomology ring of the quiver Grassmannian of the module. I
give a proof of part of this conjecture. Given this conjecture, I give a proof
of the reduceness conjecture.
| math.RT | the irreducible components of the variety of all modules over the preprojective algebra and mv cycles both index bases of the universal enveloping algebra of the positive part of a semisimple lie algebra canonically to relate these two objects baumann and kamnitzer associate a cycle in the affine grassmannian for a given module it is conjectured that the ring of functions of the tfixed point subscheme of the associated cycle is isomorphic to the cohomology ring of the quiver grassmannian of the module i give a proof of part of this conjecture given this conjecture i give a proof of the reduceness conjecture | [['the', 'irreducible', 'components', 'of', 'the', 'variety', 'of', 'all', 'modules', 'over', 'the', 'preprojective', 'algebra', 'and', 'mv', 'cycles', 'both', 'index', 'bases', 'of', 'the', 'universal', 'enveloping', 'algebra', 'of', 'the', 'positive', 'part', 'of', 'a', 'semisimple', 'lie', 'algebra', 'canonically', 'to', 'relate', 'these', 'two', 'objects', 'baumann', 'and', 'kamnitzer', 'associate', 'a', 'cycle', 'in', 'the', 'affine', 'grassmannian', 'for', 'a', 'given', 'module', 'it', 'is', 'conjectured', 'that', 'the', 'ring', 'of', 'functions', 'of', 'the', 'tfixed', 'point', 'subscheme', 'of', 'the', 'associated', 'cycle', 'is', 'isomorphic', 'to', 'the', 'cohomology', 'ring', 'of', 'the', 'quiver', 'grassmannian', 'of', 'the', 'module', 'i', 'give', 'a', 'proof', 'of', 'part', 'of', 'this', 'conjecture', 'given', 'this', 'conjecture', 'i', 'give', 'a', 'proof', 'of', 'the', 'reduceness', 'conjecture']] | [-0.2347624250870271, 0.011915273927882606, -0.10521863907685175, -0.009512299874354629, -0.08537471293033484, -0.1440408446725604, -0.04832640920272645, 0.2858770794472566, -0.3809776117696482, -0.16356880988071984, 0.10831440703409231, -0.1713754364640872, -0.16319476682510153, 0.17006877164228582, -0.1696679352180046, -0.11055908437964379, 0.0824377512577556, 0.11477806809467866, -0.055157840208552196, -0.31394439877248276, 0.42269761379187304, -0.00012959543542534696, 0.19931414307953388, 0.04005066757820839, 0.1663488482682071, 0.012711676558954459, -0.0432018841954642, -0.056905457302562745, -0.12563168255912707, 0.16215700622848875, 0.3422684490717217, 0.12650999406754387, 0.16044202487226392, -0.3394884857549971, -0.050570033460983314, 0.217509955921046, 0.1425172205210901, 0.0024255700409412384, 0.022696656467137383, -0.20520224263343742, 0.09917000020105465, -0.24586492904699317, -0.17973267797417208, -0.0021374725837114395, 0.1396939976770869, -0.008972151725816623, -0.2051292168131719, -0.026325230240164435, 0.12193155920534741, 0.16554598858141722, -0.10904188328148688, -0.10503495237607435, -0.0961347843575127, 0.06718867352944524, -0.0907731213442543, 0.06829288428279516, 0.11898164450665753, -0.11167115913064894, -0.18797818144016407, 0.3465942164846495, 0.00949657266484756, -0.1748474415976043, 0.09793850215261474, -0.1946508717339705, -0.1661034371776908, 0.1501903393141487, 0.018302285160376307, 0.12589028437494063, 0.008265874558584947, 0.18557752392085852, -0.17531272771713488, 0.007317817643542737, 0.07896907406621705, -0.011971941669174818, 0.18105019660045704, 0.08166863276239704, 0.02441471808482425, 0.14076480915879502, 0.03948167310605355, -0.003865188745526122, -0.40366075691018327, -0.2477469393326079, -0.11294691055652448, 0.14488841032645866, -0.1295325382947625, -0.20776675276312173, 0.4646618485030736, 0.09246989421765595, 0.19495070127510084, 0.13492560062064407, 0.18140463425102188, 0.06995331920573816, 0.12341654004173025, 0.026367043537617315, 0.13746835843331234, 0.3066273124377225, -0.02373586792393825, -0.14595441590519806, -0.05652453967680534, 0.25285970049855466] |
1,802.01793 | On a family of sequences related to Chebyshev polynomials | The appearance of primes in a family of linear recurrence sequences labelled
by a positive integer $n$ is considered. The terms of each sequence correspond
to a particular class of Lehmer numbers, or (viewing them as polynomials in
$n$) dilated versions of the so-called Chebyshev polynomials of the fourth
kind, also known as airfoil polynomials. It is proved that when the value of
$n$ is given by a dilated Chebyshev polynomial of the first kind evaluated at a
suitable integer, either the sequence contains a single prime, or no term is
prime. For all other values of $n$, it is conjectured that the sequence
contains infinitely many primes, whose distribution has analogous properties to
the distribution of Mersenne primes among the Mersenne numbers. Similar results
are obtained for the sequences associated with negative integers $n$, which
correspond to Chebyshev polynomials of the third kind, and to another family of
Lehmer numbers.
| math.NT | the appearance of primes in a family of linear recurrence sequences labelled by a positive integer n is considered the terms of each sequence correspond to a particular class of lehmer numbers or viewing them as polynomials in n dilated versions of the socalled chebyshev polynomials of the fourth kind also known as airfoil polynomials it is proved that when the value of n is given by a dilated chebyshev polynomial of the first kind evaluated at a suitable integer either the sequence contains a single prime or no term is prime for all other values of n it is conjectured that the sequence contains infinitely many primes whose distribution has analogous properties to the distribution of mersenne primes among the mersenne numbers similar results are obtained for the sequences associated with negative integers n which correspond to chebyshev polynomials of the third kind and to another family of lehmer numbers | [['the', 'appearance', 'of', 'primes', 'in', 'a', 'family', 'of', 'linear', 'recurrence', 'sequences', 'labelled', 'by', 'a', 'positive', 'integer', 'n', 'is', 'considered', 'the', 'terms', 'of', 'each', 'sequence', 'correspond', 'to', 'a', 'particular', 'class', 'of', 'lehmer', 'numbers', 'or', 'viewing', 'them', 'as', 'polynomials', 'in', 'n', 'dilated', 'versions', 'of', 'the', 'socalled', 'chebyshev', 'polynomials', 'of', 'the', 'fourth', 'kind', 'also', 'known', 'as', 'airfoil', 'polynomials', 'it', 'is', 'proved', 'that', 'when', 'the', 'value', 'of', 'n', 'is', 'given', 'by', 'a', 'dilated', 'chebyshev', 'polynomial', 'of', 'the', 'first', 'kind', 'evaluated', 'at', 'a', 'suitable', 'integer', 'either', 'the', 'sequence', 'contains', 'a', 'single', 'prime', 'or', 'no', 'term', 'is', 'prime', 'for', 'all', 'other', 'values', 'of', 'n', 'it', 'is', 'conjectured', 'that', 'the', 'sequence', 'contains', 'infinitely', 'many', 'primes', 'whose', 'distribution', 'has', 'analogous', 'properties', 'to', 'the', 'distribution', 'of', 'mersenne', 'primes', 'among', 'the', 'mersenne', 'numbers', 'similar', 'results', 'are', 'obtained', 'for', 'the', 'sequences', 'associated', 'with', 'negative', 'integers', 'n', 'which', 'correspond', 'to', 'chebyshev', 'polynomials', 'of', 'the', 'third', 'kind', 'and', 'to', 'another', 'family', 'of', 'lehmer', 'numbers']] | [-0.22364521487338457, 0.13048426993114146, -0.06935536469368736, 0.07773920492229008, -0.06057124326178274, -0.15550709436863464, -0.026582695127446328, 0.2712358201403689, -0.3185149153928883, -0.2769948027331061, 0.07797279104664429, -0.2978216162605199, -0.14889409410187493, 0.2113769041799897, -0.05320474921127424, 0.06491098678618784, 0.02979409493296253, 0.14442025538262548, -0.026481974151429555, -0.32896236414151475, 0.33739880829223046, -0.05226097690613805, 0.14668091393341096, -0.06155655342493428, 0.09361426928543196, -0.03460526296295324, 0.008534348178161493, -0.026452291269620128, -0.07608798663862379, 0.0952348986159492, 0.2775356226495856, 0.11576779590950838, 0.2995527136781012, -0.3334729702918118, -0.09239197856074335, 0.20680946848796225, 0.14784124824303257, 0.0014796005646753687, -0.017873383762425935, -0.19594565036379738, 0.1404041308386942, -0.12339959928260141, -0.17706689189823455, -0.046151711691837044, 0.08835340221258288, 0.11567828159113198, -0.32828504072243214, 0.013647251088435867, 0.1083574534720735, 0.09410944001884847, 0.02991320491638898, -0.2202853741500502, 0.020639281929624793, 0.09180383033844618, 0.03675711639256322, 0.02594465176059883, -0.025411245166416595, -0.09577046470394333, -0.13395080014150465, 0.36404947295942225, -0.021984842721533202, -0.22626205441381608, 0.10400958823669233, -0.173035587945842, -0.17885295090277908, 0.16387487338880533, 0.07074179525320597, 0.14701049360724178, -0.04400643814150444, 0.0762478897948626, -0.15462909086564222, 0.15485084438634827, 0.19014936354665074, 0.030325290653700415, 0.18153362068662185, 0.02214364767296622, 0.024251725900508093, 0.1876354405262495, -0.024903798690767316, -0.0671304635000446, -0.31860551350928895, -0.16950804504584396, -0.2809018356770289, 0.08320218993239845, -0.12573688368716612, -0.21766073988220155, 0.37054947255463, 0.045758302480796514, 0.18660038192787312, 0.13091615715838154, 0.20631769126194793, 0.12021068988263064, 0.08830215151125677, 0.03581103633176412, 0.0760820875073851, 0.14657796163494322, 0.023555189025717856, -0.13614527145493158, 0.06730351700379655, 0.19960038003123162] |
1,802.01794 | Nadel-Nakano vanishing theorems of vector bundles with singular
Hermitian metrics | We study a singular Hermitian metric of a vector bundle. First, we prove the
sheaf of locally square integrable holomorphic sections of a vector bundle with
a singular Hermitian metric, which is a higher rank analogy of a multiplier
ideal sheaf, is coherent under some assumptions. Second, we prove a
Nadel-Nakano type vanishing theorem of a vector bundle with a singular
Hermitian metric. We do not use an approximation technique of a singular
Hermitian metric. We apply these theorems to a singular Hermitian metric
induced by holomorphic sections and a big vector bundle, and we obtain a
generalization of Griffiths' vanishing theorem. Finally, we show a
generalization of Ohsawa's vanishing theorem.
| math.CV math.AG math.DG | we study a singular hermitian metric of a vector bundle first we prove the sheaf of locally square integrable holomorphic sections of a vector bundle with a singular hermitian metric which is a higher rank analogy of a multiplier ideal sheaf is coherent under some assumptions second we prove a nadelnakano type vanishing theorem of a vector bundle with a singular hermitian metric we do not use an approximation technique of a singular hermitian metric we apply these theorems to a singular hermitian metric induced by holomorphic sections and a big vector bundle and we obtain a generalization of griffiths vanishing theorem finally we show a generalization of ohsawas vanishing theorem | [['we', 'study', 'a', 'singular', 'hermitian', 'metric', 'of', 'a', 'vector', 'bundle', 'first', 'we', 'prove', 'the', 'sheaf', 'of', 'locally', 'square', 'integrable', 'holomorphic', 'sections', 'of', 'a', 'vector', 'bundle', 'with', 'a', 'singular', 'hermitian', 'metric', 'which', 'is', 'a', 'higher', 'rank', 'analogy', 'of', 'a', 'multiplier', 'ideal', 'sheaf', 'is', 'coherent', 'under', 'some', 'assumptions', 'second', 'we', 'prove', 'a', 'nadelnakano', 'type', 'vanishing', 'theorem', 'of', 'a', 'vector', 'bundle', 'with', 'a', 'singular', 'hermitian', 'metric', 'we', 'do', 'not', 'use', 'an', 'approximation', 'technique', 'of', 'a', 'singular', 'hermitian', 'metric', 'we', 'apply', 'these', 'theorems', 'to', 'a', 'singular', 'hermitian', 'metric', 'induced', 'by', 'holomorphic', 'sections', 'and', 'a', 'big', 'vector', 'bundle', 'and', 'we', 'obtain', 'a', 'generalization', 'of', 'griffiths', 'vanishing', 'theorem', 'finally', 'we', 'show', 'a', 'generalization', 'of', 'ohsawas', 'vanishing', 'theorem']] | [-0.22720795782675984, 0.05065184170628552, -0.10625047640823716, 0.11204453126459014, -0.15364917148536908, -0.17892377888527486, 0.005054103560882424, 0.3367132178994767, -0.27251386239167746, -0.0660851050313528, 0.10363796353767361, -0.24831046998808418, -0.2515766539252064, 0.147741764144109, -0.13463087022142195, 0.05823938369135791, 0.07789944947927917, 0.13369143429562586, -0.20928194789096302, -0.2421482633329381, 0.49900867121823883, -0.01685207128661488, 0.24299460898982275, 0.10919029761154905, 0.19188934553269332, 0.024805068273370694, -0.021788534144401003, 0.0025267343660560224, -0.1223865973874243, 0.13375533149372615, 0.26985650826587315, 0.05831062431882964, 0.2637647343884914, -0.33256563696360913, -0.15613070495187417, 0.27821372938128786, 0.027551035525185407, 0.03490286117415328, 0.030773746494818992, -0.27020696247287024, 0.15112334387291462, -0.16334513833729225, -0.23659322539412783, -0.13195415152185555, -0.014343517643416626, -0.007141000131965367, -0.266986100729384, -0.01191125305181523, 0.16869345411589934, 0.08410891025127425, -0.12474322412590232, -0.045929243076814834, -0.024243301615853786, -0.04241877964723411, -0.009219039492138209, 0.07686042310798182, 0.12278081070836805, -0.04507852619975258, -0.12027937764677843, 0.3242395297226863, -0.18449487956934993, -0.2939719248631405, 0.032058314018703384, -0.09462204218389245, -0.1280047536374779, 0.09619728533055531, 0.14411703369755366, 0.20652078570175378, -0.018301041006460923, 0.16623432811140296, -0.14121803888247922, 0.05299113278272946, 0.09204459705586554, -0.011490883604717363, 0.11902843675909376, 0.07794906031511245, 0.1258558181537435, 0.09870757775193234, -0.02792157491224758, -0.09954471628121826, -0.3974116871458128, -0.2582845298761348, -0.13593846825036912, 0.2709026301661218, -0.15709119776040614, -0.25963296235427946, 0.3932757595673614, 0.02029072185294754, 0.28577810551526894, 0.13520339973924528, 0.2615572098779296, 0.10007040403834587, 0.032229841626975515, 0.05424660161445174, 0.2105658388060599, 0.2860926203536502, 0.025810795468748163, -0.04153169134077445, -0.0886062183246495, 0.23696856240852984] |
1,802.01795 | A Lean formalization of Matiyasevi\v{c}'s Theorem | In this paper, we present a formalization of Matiyasevi\v{c}'s theorem, which
states that the power function is Diophantine, forming the last and hardest
piece of the MRDP theorem of the unsolvability of Hilbert's 10th problem. The
formalization is performed within the Lean theorem prover, and necessitated the
development of a small number theory library, including in particular the
solution to Pell's equation and properties of the Pell $x,y$ sequences.
| math.LO | in this paper we present a formalization of matiyasevivcs theorem which states that the power function is diophantine forming the last and hardest piece of the mrdp theorem of the unsolvability of hilberts 10th problem the formalization is performed within the lean theorem prover and necessitated the development of a small number theory library including in particular the solution to pells equation and properties of the pell xy sequences | [['in', 'this', 'paper', 'we', 'present', 'a', 'formalization', 'of', 'matiyasevivcs', 'theorem', 'which', 'states', 'that', 'the', 'power', 'function', 'is', 'diophantine', 'forming', 'the', 'last', 'and', 'hardest', 'piece', 'of', 'the', 'mrdp', 'theorem', 'of', 'the', 'unsolvability', 'of', 'hilberts', '10th', 'problem', 'the', 'formalization', 'is', 'performed', 'within', 'the', 'lean', 'theorem', 'prover', 'and', 'necessitated', 'the', 'development', 'of', 'a', 'small', 'number', 'theory', 'library', 'including', 'in', 'particular', 'the', 'solution', 'to', 'pells', 'equation', 'and', 'properties', 'of', 'the', 'pell', 'xy', 'sequences']] | [-0.16955059104571668, 0.022992047577110285, -0.11893766671966981, 0.040834992632667044, -0.08320155438473996, -0.07586812802508254, 0.058393015604986644, 0.22423587101237738, -0.3258136587409193, -0.2875750763889621, 0.11840528510990278, -0.2659752420423662, -0.11797841851983, 0.20666971238439574, -0.08415795222048045, 0.056016935336896605, 0.06257740358876832, 0.02483807352323578, -0.03189699648646638, -0.2638964184357867, 0.3262529631782159, -0.02476431184229167, 0.22545798847397022, 0.08548329454189275, 0.11592756666462212, 0.046976840996649116, 0.009359306929742588, -0.039637292625711244, -0.12076525221741843, 0.16059625024910715, 0.2730285706108107, 0.16555672408738994, 0.34032689308857217, -0.3962062558378367, -0.08926847798284143, 0.09761707495850072, 0.0873432563350755, 0.08855368510429638, -0.03683918532367576, -0.24313357628553228, 0.11146252949177271, -0.17558906747795203, -0.19268927660168095, -0.030282003394163707, 0.0306448264129679, 0.04156755058861831, -0.18565571408972198, 0.03947189173948787, 0.17347202360328726, 0.08146596400012426, -0.041045276187908125, -0.09951059773619123, 0.008102624793536961, 0.09953688388443827, 0.05487963401794653, 0.052431104259620255, 0.04134675636476673, -0.13016093866420253, -0.13347451006719732, 0.381683736190419, -0.017912831102662227, -0.15078980351031265, 0.09386090504224687, -0.12061351524008547, -0.20481947008246446, 0.08497024921234697, 0.13487691426759257, 0.16429571035619386, -0.11648582546588253, 0.13443290464569788, -0.1051261666477384, 0.21472753893912716, 0.11886608146254302, 0.022939685492447633, 0.13903525049852974, 0.1740731317036347, 0.011768149006563951, 0.17515715156846187, 0.003507218898876625, -0.12297006644418135, -0.32666541196351107, -0.1932805007981027, -0.15810988956089952, 0.04792836398872383, -0.0753375967780063, -0.23546845208415212, 0.4101811573183274, 0.1165477307718795, 0.07054220780949383, 0.08748858771458104, 0.28024383716504364, 0.14382632608141968, 0.019098577613476664, 0.06959832806194968, 0.1862485476440805, 0.19668950626681395, 0.13963259310078094, -0.1458087183726842, 0.026045017511077115, 0.17796691353706753] |
1,802.01796 | The regularity of a semilinear elliptic system with quadratic growth of
gradient | In this paper, we study semilinear elliptic systems with critical
nonlinearity of the form \begin{equation}\label{sys01} \Delta u=Q(x, u, \nabla
u), \end{equation} for $u: \mathbb{R}^n\rightarrow \mathbb{R}^K$, $Q$ has
quadratic growth in $\nabla u$. Our work is motivated by elliptic systems for
harmonic map and biharmonic map. When $n=2$, such a system does not have smooth
regularity in general for $W^{1, 2}$ weak solutions, by a well-known example of
J. Frehse. Classical results of harmonic map, proved by F. H\'elein (for $n=2$)
and F. B\'ethuel (for $n\geq 3$), assert that a $W^{1, n}$ weak solution of
harmonic map is always smooth. We extend B\'ethuel's result to above general
system, that a $W^{1, n}$ weak solution of above system is smooth for $n\geq
3$. For a fourth order semilinear elliptic system with critical nonlinearity
which extends biharmonic map, we prove a similar result, that a $W^{2, n/2}$
weak solution of such system is always smooth, for $n\geq 5$. We also construct
various examples, and these examples show that our regularity results are
optimal in various sense.
| math.AP | in this paper we study semilinear elliptic systems with critical nonlinearity of the form beginequationlabelsys01 delta uqx u nabla u endequation for u mathbbrnrightarrow mathbbrk q has quadratic growth in nabla u our work is motivated by elliptic systems for harmonic map and biharmonic map when n2 such a system does not have smooth regularity in general for w1 2 weak solutions by a wellknown example of j frehse classical results of harmonic map proved by f helein for n2 and f bethuel for ngeq 3 assert that a w1 n weak solution of harmonic map is always smooth we extend bethuels result to above general system that a w1 n weak solution of above system is smooth for ngeq 3 for a fourth order semilinear elliptic system with critical nonlinearity which extends biharmonic map we prove a similar result that a w2 n2 weak solution of such system is always smooth for ngeq 5 we also construct various examples and these examples show that our regularity results are optimal in various sense | [['in', 'this', 'paper', 'we', 'study', 'semilinear', 'elliptic', 'systems', 'with', 'critical', 'nonlinearity', 'of', 'the', 'form', 'beginequationlabelsys01', 'delta', 'uqx', 'u', 'nabla', 'u', 'endequation', 'for', 'u', 'mathbbrnrightarrow', 'mathbbrk', 'q', 'has', 'quadratic', 'growth', 'in', 'nabla', 'u', 'our', 'work', 'is', 'motivated', 'by', 'elliptic', 'systems', 'for', 'harmonic', 'map', 'and', 'biharmonic', 'map', 'when', 'n2', 'such', 'a', 'system', 'does', 'not', 'have', 'smooth', 'regularity', 'in', 'general', 'for', 'w1', '2', 'weak', 'solutions', 'by', 'a', 'wellknown', 'example', 'of', 'j', 'frehse', 'classical', 'results', 'of', 'harmonic', 'map', 'proved', 'by', 'f', 'helein', 'for', 'n2', 'and', 'f', 'bethuel', 'for', 'ngeq', '3', 'assert', 'that', 'a', 'w1', 'n', 'weak', 'solution', 'of', 'harmonic', 'map', 'is', 'always', 'smooth', 'we', 'extend', 'bethuels', 'result', 'to', 'above', 'general', 'system', 'that', 'a', 'w1', 'n', 'weak', 'solution', 'of', 'above', 'system', 'is', 'smooth', 'for', 'ngeq', '3', 'for', 'a', 'fourth', 'order', 'semilinear', 'elliptic', 'system', 'with', 'critical', 'nonlinearity', 'which', 'extends', 'biharmonic', 'map', 'we', 'prove', 'a', 'similar', 'result', 'that', 'a', 'w2', 'n2', 'weak', 'solution', 'of', 'such', 'system', 'is', 'always', 'smooth', 'for', 'ngeq', '5', 'we', 'also', 'construct', 'various', 'examples', 'and', 'these', 'examples', 'show', 'that', 'our', 'regularity', 'results', 'are', 'optimal', 'in', 'various', 'sense']] | [-0.18028108649613225, 0.027004529278287115, 0.005631208091097719, 0.031783587325994365, -0.04552645528798594, -0.20783460776540724, -0.03782737801221254, 0.32633968475274744, -0.282822387246415, -0.22096831251264495, 0.10443186576012523, -0.32576125528225125, -0.16569906705990434, 0.23461739911752588, -0.08023110965047689, 0.09661489143447184, 0.06148535763598321, 0.037136328349109085, -0.056165546948282366, -0.2563898248762331, 0.39716699458658694, -0.14907136483063155, 0.15694437401372638, 0.06525374746826641, 0.09900866693351418, -0.027601494044339394, 0.06910760723163976, 0.005082071665674448, -0.21815985987486783, 0.0735431921942269, 0.24928412694648347, 0.04697629155125469, 0.30052860019838107, -0.33679234833620925, -0.22626884448725512, 0.180337545511258, 0.13083747898995438, 0.05052191284964518, -0.03424023126306779, -0.24567335748716312, 0.1541550472522538, -0.09188830327270005, -0.20586033036987134, -0.09467058998450417, 0.11245894295108669, 0.06972218265188584, -0.3671496130334323, 0.09861349642999223, 0.17560290092438022, 0.05151382184532635, -0.08697804091772174, -0.10549276341643075, -0.050346167332164064, 0.05286064732987571, -0.023044711989624534, 0.16133885784211624, -0.013101131036220228, -0.12697034422445166, -0.023395911500761833, 0.335460665671374, -0.12289999773219118, -0.2369468538200154, 0.127154666497646, -0.17852523453150163, -0.15590547593584395, 0.10037790763684933, 0.11593489698134363, 0.16207778500119113, -0.09378519701293793, 0.2090144700360457, -0.0777780860717244, 0.17657866794889904, 0.11686439900659025, -0.05107456615728819, 0.058150143694023, 0.0820729168570217, 0.1803355724674047, 0.11889268767417353, 0.019599883874659153, -0.017016053512035046, -0.37054599673857036, -0.16155892254456, -0.13809255243772092, 0.15011553714567152, -0.10046948032318409, -0.11344732526032364, 0.30755368482513246, 0.08343064708957065, 0.17487007817801306, 0.1008345311103553, 0.18987958721597406, 0.1583468993413536, -0.03602140008691041, 0.09426880690323956, 0.18211407871807322, 0.10872308879214175, 0.1066399770186228, -0.1597484556465026, -0.07251020318225902, 0.13707489861887606] |
1,802.01797 | Continuous Production of Rovibronic Ground State RbCs Molecules via
Short-Range Photoassociation to the $b^3\Pi_{1}-c^3\Sigma^+_{1}-B^1\Pi_1$
States | We have investigated rovibronic levels of the strongly mixed
$b^3\Pi_1-c^3\Sigma^+_1-B^1\Pi_1$ states [the 2(1), 3(1), and 4(1) states in
Hund's case (c) notation] of $^{85}$Rb$^{133}$Cs in the energy range of
13950$-$14200 cm$^{-1}$ using short-range photoassociation (PA). For selected
PA states, vibrational and rotational branching in the $X^1\Sigma^+$ state have
been investigated using resonance-enhanced multiphoton ionization and depletion
spectroscopy. Efficient production of $^{85}$Rb$^{133}$Cs molecules in the
rovibronic ground state $X^1\Sigma^+ (v=0, J=0)$, at up to $\sim$1$\times 10^4$
molecules/s, has been achieved.
| physics.atom-ph | we have investigated rovibronic levels of the strongly mixed b3pi_1c3sigma_1b1pi_1 states the 21 31 and 41 states in hunds case c notation of 85rb133cs in the energy range of 1395014200 cm1 using shortrange photoassociation pa for selected pa states vibrational and rotational branching in the x1sigma state have been investigated using resonanceenhanced multiphoton ionization and depletion spectroscopy efficient production of 85rb133cs molecules in the rovibronic ground state x1sigma v0 j0 at up to sim1times 104 moleculess has been achieved | [['we', 'have', 'investigated', 'rovibronic', 'levels', 'of', 'the', 'strongly', 'mixed', 'b3pi_1c3sigma_1b1pi_1', 'states', 'the', '21', '31', 'and', '41', 'states', 'in', 'hunds', 'case', 'c', 'notation', 'of', '85rb133cs', 'in', 'the', 'energy', 'range', 'of', '1395014200', 'cm1', 'using', 'shortrange', 'photoassociation', 'pa', 'for', 'selected', 'pa', 'states', 'vibrational', 'and', 'rotational', 'branching', 'in', 'the', 'x1sigma', 'state', 'have', 'been', 'investigated', 'using', 'resonanceenhanced', 'multiphoton', 'ionization', 'and', 'depletion', 'spectroscopy', 'efficient', 'production', 'of', '85rb133cs', 'molecules', 'in', 'the', 'rovibronic', 'ground', 'state', 'x1sigma', 'v0', 'j0', 'at', 'up', 'to', 'sim1times', '104', 'moleculess', 'has', 'been', 'achieved']] | [-0.08462574828713275, 0.1985592191891843, 0.02819754831541918, -0.0046414195737605425, 0.14979187529043933, -0.1351396474055946, 0.11066179212770964, 0.4197086482308805, -0.1537347199199231, -0.26948851948346647, -0.03271878652862812, -0.3018494266403937, 0.08433542138357696, 0.08265864151824069, 0.12395670599040673, 0.05964079486990446, 0.025945436773135475, -0.03868599757429605, 0.01730024002149309, -0.16345309323974347, 0.24080832105277009, 0.018528380345455127, 0.22952610691764244, 0.14377292206412867, 0.08815311934602887, -0.04677680193593627, 0.12737713577486207, -0.1275874958618691, -0.15219437956540405, 0.08999867986130994, 0.314150520974133, 0.02463451250284714, 0.2129620782246715, -0.3643419912673141, -0.14048892297585935, 0.05779166863986144, 0.16121690274265252, 0.17904654956471763, 0.028602115491307097, -0.3499762240129425, -0.0008413921183857479, -0.20943223148290263, -0.09231080298655127, -0.1367357316377916, 0.06458329265373514, -0.010146120820488585, -0.2511864202832313, 0.10519306253837912, -0.063471292559131, 0.17191625522804985, -0.14046187057637757, -0.2724572294636777, -0.12366787303778294, 0.020370719871655302, -0.08217580917009495, 0.050662038785001064, 0.15137692656686627, -0.10935416997802493, -0.1518671962518343, 0.3981971756898259, -0.1427867233777713, -0.09197087780768542, 0.19194667301398063, -0.1869230653943592, -0.18659977556059235, 0.2863485141118106, 0.10848753259664304, 0.14206670648969807, -0.10714833443298151, 0.07564049138531309, 0.03626856524007101, 0.20447713983134905, 0.17131306422188095, 0.1257306936098949, 0.10279747356023443, 0.10614567208961632, -0.04357037561528973, 0.11532376002593848, -0.20166377765494153, -0.10929200414715237, -0.1820333692686338, -0.1614982774910076, -0.16818455302793728, 0.08625931675104719, 0.0642397547158716, -0.013977798498480729, 0.3403775512093776, 0.024257756806419867, 0.14622214647916784, -0.0954478477421952, 0.2091255766388617, 0.1561087629218635, -0.042491072640251856, 0.04359756778208784, 0.3378533960601903, 0.20646203075854205, 0.09781208853727501, -0.29983669482661707, 0.027691626984865013, -0.036285524205978664] |
1,802.01798 | Flux Rope Breaking and Formation of a Rotating Blowout Jet | We analyzed a small flux rope eruption converted into a helical blowout jet
in a fan-spine configuration using multi-wavelength observations taken by SDO,
which occurred near the limb on 2016 January 9. In our study, first, we
estimated the fan-spine magnetic configuration with the potential field
calculation and found a sinistral small filament inside it. The filament along
with the flux rope erupted upward and interacted with the surrounding fan-
spine magnetic configuration, where the flux rope breaks in the middle section.
We observed compact brightening, flare ribbons and post-flare loops underneath
the erupting filament. The northern section of the flux rope reconnected with
the surrounding positive polarity, while the southern section straightened.
Next, we observed the untwisting motion of the southern leg, which was
transformed into a rotating helical blowout jet. The sign of the helicity of
the mini-filament matches the one of the rotating jet. This is consistent with
the jet models presented by Adams et al. (2014) and Sterling et al. (2015). We
focused on the fine thread structure of the rotating jet and traced three blobs
with the speed of 60-120 km/s, while the radial speed of the jet is approx 400
km/s. The untwisting motion of the jet accelerated plasma upward along the
collimated outer spine field lines, and it finally evolved into a narrow
coronal mass ejection at the height of approx 9 Rsun . On the basis of the
detailed analysis, we discussed clear evidence of the scenario of the breaking
of the flux rope and the formation of the helical blowout jet in the fan-spine
magnetic configuration.
| astro-ph.SR | we analyzed a small flux rope eruption converted into a helical blowout jet in a fanspine configuration using multiwavelength observations taken by sdo which occurred near the limb on 2016 january 9 in our study first we estimated the fanspine magnetic configuration with the potential field calculation and found a sinistral small filament inside it the filament along with the flux rope erupted upward and interacted with the surrounding fan spine magnetic configuration where the flux rope breaks in the middle section we observed compact brightening flare ribbons and postflare loops underneath the erupting filament the northern section of the flux rope reconnected with the surrounding positive polarity while the southern section straightened next we observed the untwisting motion of the southern leg which was transformed into a rotating helical blowout jet the sign of the helicity of the minifilament matches the one of the rotating jet this is consistent with the jet models presented by adams et al 2014 and sterling et al 2015 we focused on the fine thread structure of the rotating jet and traced three blobs with the speed of 60120 kms while the radial speed of the jet is approx 400 kms the untwisting motion of the jet accelerated plasma upward along the collimated outer spine field lines and it finally evolved into a narrow coronal mass ejection at the height of approx 9 rsun on the basis of the detailed analysis we discussed clear evidence of the scenario of the breaking of the flux rope and the formation of the helical blowout jet in the fanspine magnetic configuration | [['we', 'analyzed', 'a', 'small', 'flux', 'rope', 'eruption', 'converted', 'into', 'a', 'helical', 'blowout', 'jet', 'in', 'a', 'fanspine', 'configuration', 'using', 'multiwavelength', 'observations', 'taken', 'by', 'sdo', 'which', 'occurred', 'near', 'the', 'limb', 'on', '2016', 'january', '9', 'in', 'our', 'study', 'first', 'we', 'estimated', 'the', 'fanspine', 'magnetic', 'configuration', 'with', 'the', 'potential', 'field', 'calculation', 'and', 'found', 'a', 'sinistral', 'small', 'filament', 'inside', 'it', 'the', 'filament', 'along', 'with', 'the', 'flux', 'rope', 'erupted', 'upward', 'and', 'interacted', 'with', 'the', 'surrounding', 'fan', 'spine', 'magnetic', 'configuration', 'where', 'the', 'flux', 'rope', 'breaks', 'in', 'the', 'middle', 'section', 'we', 'observed', 'compact', 'brightening', 'flare', 'ribbons', 'and', 'postflare', 'loops', 'underneath', 'the', 'erupting', 'filament', 'the', 'northern', 'section', 'of', 'the', 'flux', 'rope', 'reconnected', 'with', 'the', 'surrounding', 'positive', 'polarity', 'while', 'the', 'southern', 'section', 'straightened', 'next', 'we', 'observed', 'the', 'untwisting', 'motion', 'of', 'the', 'southern', 'leg', 'which', 'was', 'transformed', 'into', 'a', 'rotating', 'helical', 'blowout', 'jet', 'the', 'sign', 'of', 'the', 'helicity', 'of', 'the', 'minifilament', 'matches', 'the', 'one', 'of', 'the', 'rotating', 'jet', 'this', 'is', 'consistent', 'with', 'the', 'jet', 'models', 'presented', 'by', 'adams', 'et', 'al', '2014', 'and', 'sterling', 'et', 'al', '2015', 'we', 'focused', 'on', 'the', 'fine', 'thread', 'structure', 'of', 'the', 'rotating', 'jet', 'and', 'traced', 'three', 'blobs', 'with', 'the', 'speed', 'of', '60120', 'kms', 'while', 'the', 'radial', 'speed', 'of', 'the', 'jet', 'is', 'approx', '400', 'kms', 'the', 'untwisting', 'motion', 'of', 'the', 'jet', 'accelerated', 'plasma', 'upward', 'along', 'the', 'collimated', 'outer', 'spine', 'field', 'lines', 'and', 'it', 'finally', 'evolved', 'into', 'a', 'narrow', 'coronal', 'mass', 'ejection', 'at', 'the', 'height', 'of', 'approx', '9', 'rsun', 'on', 'the', 'basis', 'of', 'the', 'detailed', 'analysis', 'we', 'discussed', 'clear', 'evidence', 'of', 'the', 'scenario', 'of', 'the', 'breaking', 'of', 'the', 'flux', 'rope', 'and', 'the', 'formation', 'of', 'the', 'helical', 'blowout', 'jet', 'in', 'the', 'fanspine', 'magnetic', 'configuration']] | [-0.14198777547757013, 0.1934163341277533, 0.005774742988940103, 0.06989194623813753, -0.10076397727067216, -0.040187239683070926, 0.009401333884108515, 0.44049992014399986, -0.16584939101724586, -0.34664971515479864, 0.048505378857953474, -0.21168183563206572, -0.03763117860999597, 0.16160943609561815, -0.005371594044845551, -0.03446420963155106, 0.11328028596626334, -0.03282699002849051, -0.020410113336490183, -0.1592515472959459, 0.24758815962140393, 0.11772939966458855, 0.22184463200215815, 0.026025223001962524, 0.11777163105558208, -0.09200310559103717, -0.023893255220062918, 0.03369652053736376, -0.1378130944928919, 0.030495090455973917, 0.06881671452120744, 0.0611423509288932, 0.1977167353307419, -0.4630914054895667, -0.17376357769755874, -0.05882296422990321, 0.19171947570231912, -0.017748347346434566, 0.011494426476984341, -0.31029014740753075, 0.03680257595701595, -0.1616756284581215, -0.18514726577312546, 0.12245508668252802, 0.044917629739784665, -0.01634786991361938, -0.2239415033406906, 0.09038038224257021, 0.07914769025801709, 0.07873889121092913, -0.10429253136548637, -0.03926815840355685, -0.14771146728096277, 0.06859844646081029, 0.1397299399250187, 0.1641227239800201, 0.24041382005177156, -0.1282875115542593, -0.09781333644324067, 0.31028277113579283, -0.014148726033895262, -0.004593025217411306, 0.13361812966493083, -0.248660372007483, -0.14929507909497866, 0.27095970488858945, 0.12721313235829945, 0.06441510422243454, -0.05664846162102494, -0.0275829415042994, -0.09686576030093641, 0.1150107136204359, 0.09769521088332334, -0.10464756203917645, 0.3090052124444452, 0.11964625955762599, 0.016908723249357674, 0.18259727864841063, -0.2753363161137906, -0.08365940704199161, -0.33064599973890424, -0.138246974001628, -0.06136949306749033, 0.04228637148458581, -0.07551548549880946, -0.2064661420617168, 0.4492595986124467, 0.0798026048565093, 0.258986664311537, -0.07749976052339964, 0.30065414383054967, 0.057654645295273935, 0.07397978997439415, 0.2310344082493843, 0.3164200882310979, 0.22787618861845907, 0.22768542584769116, -0.23080873190227782, 0.03494348097768979, 0.09462927426934722] |
1,802.01799 | Optimal Scheduling across Heterogeneous Air Interfaces of LTE/WiFi
Aggregation | LTE/WiFi Aggregation (LWA) provides a promising approach to relieve data
traffic congestion in licensed bands by leveraging unlicensed bands. Critical
challenges arise from provisioning quality-of-service (QoS) through
heterogenous interfaces of licensed and unlicensed bands. In this paper, we
minimize the required licensed spectrum without degrading the QoS in the
presence of multiple users. Specifically, the aggregated effective capacity of
LWA is firstly derived by developing a new semi-Markov model. Multi-band
resource allocation with the QoS guarantee between the licensed and unlicensed
bands is formulated to minimize the licensed bandwidth, convexified by
exploiting Block Coordinate Descent (BCD) and difference of two convex
functions (DC) programming, and solved efficiently with a new iterative
algorithm. Simulation results demonstrate significant performance gain of the
proposed approach over heuristic alternatives.
| cs.IT math.IT | ltewifi aggregation lwa provides a promising approach to relieve data traffic congestion in licensed bands by leveraging unlicensed bands critical challenges arise from provisioning qualityofservice qos through heterogenous interfaces of licensed and unlicensed bands in this paper we minimize the required licensed spectrum without degrading the qos in the presence of multiple users specifically the aggregated effective capacity of lwa is firstly derived by developing a new semimarkov model multiband resource allocation with the qos guarantee between the licensed and unlicensed bands is formulated to minimize the licensed bandwidth convexified by exploiting block coordinate descent bcd and difference of two convex functions dc programming and solved efficiently with a new iterative algorithm simulation results demonstrate significant performance gain of the proposed approach over heuristic alternatives | [['ltewifi', 'aggregation', 'lwa', 'provides', 'a', 'promising', 'approach', 'to', 'relieve', 'data', 'traffic', 'congestion', 'in', 'licensed', 'bands', 'by', 'leveraging', 'unlicensed', 'bands', 'critical', 'challenges', 'arise', 'from', 'provisioning', 'qualityofservice', 'qos', 'through', 'heterogenous', 'interfaces', 'of', 'licensed', 'and', 'unlicensed', 'bands', 'in', 'this', 'paper', 'we', 'minimize', 'the', 'required', 'licensed', 'spectrum', 'without', 'degrading', 'the', 'qos', 'in', 'the', 'presence', 'of', 'multiple', 'users', 'specifically', 'the', 'aggregated', 'effective', 'capacity', 'of', 'lwa', 'is', 'firstly', 'derived', 'by', 'developing', 'a', 'new', 'semimarkov', 'model', 'multiband', 'resource', 'allocation', 'with', 'the', 'qos', 'guarantee', 'between', 'the', 'licensed', 'and', 'unlicensed', 'bands', 'is', 'formulated', 'to', 'minimize', 'the', 'licensed', 'bandwidth', 'convexified', 'by', 'exploiting', 'block', 'coordinate', 'descent', 'bcd', 'and', 'difference', 'of', 'two', 'convex', 'functions', 'dc', 'programming', 'and', 'solved', 'efficiently', 'with', 'a', 'new', 'iterative', 'algorithm', 'simulation', 'results', 'demonstrate', 'significant', 'performance', 'gain', 'of', 'the', 'proposed', 'approach', 'over', 'heuristic', 'alternatives']] | [-0.24614099416136742, -0.034051772099221125, 0.003974405497312546, 0.04468256220826879, -0.1165118392817676, -0.2686807622499764, 0.18054585222247987, 0.44434228658676145, -0.32428254548460245, -0.31144592695683243, 0.054175982348620894, -0.24852986497059465, -0.16142309994995593, 0.09591603607870638, -0.1426933004669845, 0.05770636068284512, 0.0771474571209401, -0.09136064444482327, 0.00166080829128623, -0.25436666889674964, 0.25740021927654744, 0.12718892435729504, 0.4338504280894995, 0.06835889768227935, 0.011039644875563682, 0.02456267535686493, -0.032826913598924874, -0.05689552068756893, -0.05769438663497567, 0.15606808950752019, 0.40579567290097474, 0.1858030290901661, 0.3381900049000979, -0.43109118814766406, -0.26897403740882875, 0.039360015485435725, 0.14143191619869322, -0.023231432013213635, -0.035014406772330406, -0.2941464797258377, 0.1450490068346262, -0.2531244031265378, -0.02012209812924266, -0.0312397794816643, -0.15567318930104374, 0.04073968891426921, -0.33588065680861473, 0.02039146245713346, -0.06274597661942244, 0.04631923236616421, -0.1474035484874621, -0.10645840431004763, -0.010451612129807473, 0.14525763926655055, 0.07059926516190171, -0.043120554327964786, 0.08996448686812072, -0.06162633979134262, -0.13016562100593002, 0.4265387536510825, -0.03695342604443431, -0.17358681275323035, 0.14382187920808792, 0.010991114787757397, -0.10614417644217611, 0.16757375350268558, 0.23274748469889164, 0.037932736927643415, -0.26824265916273, 0.07364414923451841, 0.029348843298852442, 0.14528159697540105, 0.09368383179605007, 0.1066840470507741, 0.16041512153856458, 0.19634584373235703, 0.19130494118481875, 0.1450844965595752, -0.06287515356205403, -0.08039784329384565, -0.16671858740272, -0.07828074222803116, -0.23447702280059457, -0.036307904854416845, -0.07427918035490438, -0.08839619990810751, 0.44120412633568046, 0.12999762751720845, 0.05836797159910202, 0.14762391127832233, 0.40577695216983556, 0.09940003098547459, 0.08090880230814218, 0.19327956379204989, 0.12685828170925378, -0.0025288364570587875, 0.18281160789635031, -0.24950489941053092, 0.024528649842366575, -0.01588972886931151] |
1,802.018 | Euclidean Triangles Have No Hot Spots | We show that a second Neumann eigenfunction u of a Euclidean triangle has no
critical points in the interior of the triangle.
| math.AP | we show that a second neumann eigenfunction u of a euclidean triangle has no critical points in the interior of the triangle | [['we', 'show', 'that', 'a', 'second', 'neumann', 'eigenfunction', 'u', 'of', 'a', 'euclidean', 'triangle', 'has', 'no', 'critical', 'points', 'in', 'the', 'interior', 'of', 'the', 'triangle']] | [-0.2006984418258071, 0.03227352566847747, -0.10627726465463638, 0.02892852583053437, -0.055250576781955635, -0.1035653317601166, 0.09531679779121821, 0.30010467855556106, -0.2620728103951974, -0.10634091547267004, 0.12680096508913927, -0.4238314117220315, -0.14729810269041496, 0.12666299803690476, -0.07539313667538491, 0.09810388393022797, 0.13657400795173916, 0.21362097425894302, -0.14428334902252324, -0.16849513047120787, 0.39092660075138236, -0.12828540576579558, 0.16855790008875457, 0.1281509010798552, 0.04770693098279563, -0.051474100021137434, 0.07550095885314724, 0.07307375042529946, -0.1718088101548677, 0.10828281016173688, 0.17256974856453863, 0.07700939425690607, 0.3082498767497865, -0.41707340763373807, -0.1727591317824342, 0.24087118729948997, 0.1411058072593402, 0.00621094825592908, -0.04523812589997595, -0.2671321331608025, 0.10277253520590338, -0.04331307324834845, -0.19654900491745633, 0.01317431540651755, 0.07103835425170307, -0.03722585432908752, -0.26249516022984276, 0.09009588232517919, 0.11786557876356793, 0.06964760117063468, -0.030537213135341353, -0.15328030656515199, -0.06667194532399828, 0.10211437463294715, -0.04468859766017307, 0.11556222848594189, -0.0050548901146447115, -0.07850293904034929, -0.08765049947595055, 0.40854529812085355, -0.016191703521392563, -0.22326776512305846, 0.08866903405975211, -0.28502312169240956, -0.11288590043444525, 0.04678312824531035, 0.04893991888754747, 0.08304425159638579, -0.09749290431764993, 0.24112300236116757, -0.13409089424054732, 0.12247591228647665, 0.15204746115275405, -0.09638947663849896, 0.12222751856527546, 0.07057378762824969, 0.24404899157922377, 0.18559783392331816, -0.1077840043739839, -0.08728504307906736, -0.3975251547314904, -0.20622433027760548, -0.26396835392171686, 0.04382823788645593, -0.1947842638685622, -0.2883550375699997, 0.36484975303756073, 0.07117138024080884, 0.22984837503595787, -0.04241587340154431, 0.22153722079978747, 0.12495313832451674, 0.06559242092242296, 0.13740989769046957, 0.21683401804925365, 0.07160589505325664, 0.0771860723299059, -0.23601738313895607, -0.03419773388569328, 0.21217648748477752] |
1,802.01801 | Anisotropic neutron stars in $R^2$ gravity | We consider static neutron stars within the framework of $R^2$ gravity. The
neutron fluid is described by three different types of realistic equations of
state (soft, moderately stiff, and stiff). Using the observational data on the
neutron star mass-radius relation, it is demonstrated that the characteristics
of the objects supported by the isotropic fluid agree with the observations
only if one uses the soft equation of state. We show that the inclusion of the
fluid anisotropy enables one also to employ more stiff equations of state to
model configurations that will satisfy the observational constraints
sufficiently. Also, using the standard thin accretion disk model, we
demonstrate potentially observable differences, which allow us to distinguish
the neutron stars constructed within the modified gravity framework from those
described in Einstein's general relativity.
| gr-qc | we consider static neutron stars within the framework of r2 gravity the neutron fluid is described by three different types of realistic equations of state soft moderately stiff and stiff using the observational data on the neutron star massradius relation it is demonstrated that the characteristics of the objects supported by the isotropic fluid agree with the observations only if one uses the soft equation of state we show that the inclusion of the fluid anisotropy enables one also to employ more stiff equations of state to model configurations that will satisfy the observational constraints sufficiently also using the standard thin accretion disk model we demonstrate potentially observable differences which allow us to distinguish the neutron stars constructed within the modified gravity framework from those described in einsteins general relativity | [['we', 'consider', 'static', 'neutron', 'stars', 'within', 'the', 'framework', 'of', 'r2', 'gravity', 'the', 'neutron', 'fluid', 'is', 'described', 'by', 'three', 'different', 'types', 'of', 'realistic', 'equations', 'of', 'state', 'soft', 'moderately', 'stiff', 'and', 'stiff', 'using', 'the', 'observational', 'data', 'on', 'the', 'neutron', 'star', 'massradius', 'relation', 'it', 'is', 'demonstrated', 'that', 'the', 'characteristics', 'of', 'the', 'objects', 'supported', 'by', 'the', 'isotropic', 'fluid', 'agree', 'with', 'the', 'observations', 'only', 'if', 'one', 'uses', 'the', 'soft', 'equation', 'of', 'state', 'we', 'show', 'that', 'the', 'inclusion', 'of', 'the', 'fluid', 'anisotropy', 'enables', 'one', 'also', 'to', 'employ', 'more', 'stiff', 'equations', 'of', 'state', 'to', 'model', 'configurations', 'that', 'will', 'satisfy', 'the', 'observational', 'constraints', 'sufficiently', 'also', 'using', 'the', 'standard', 'thin', 'accretion', 'disk', 'model', 'we', 'demonstrate', 'potentially', 'observable', 'differences', 'which', 'allow', 'us', 'to', 'distinguish', 'the', 'neutron', 'stars', 'constructed', 'within', 'the', 'modified', 'gravity', 'framework', 'from', 'those', 'described', 'in', 'einsteins', 'general', 'relativity']] | [-0.08883455232269345, 0.1409671081086764, -0.11814281953892743, 0.09492625848640902, -0.12566505736456468, -0.13349052113839066, -0.017210329008790163, 0.303806254414555, -0.22854497560944695, -0.33881624465664995, 0.043473341565829916, -0.276223361506485, -0.06257922872542762, 0.19874706113299068, -0.008934565959498287, 0.025421892042056873, 0.07386676260592559, 0.019896906848925238, -0.0708743119907852, -0.19472227291956257, 0.36806392040676794, 0.012070122576103761, 0.2104188912986921, -0.042733237695378755, 0.09855889367799346, -0.04172344803093718, -0.014155785803898023, 0.06916321338369297, -0.17019348818391267, 0.05671144142263354, 0.22475853991121628, 0.11290977959736036, 0.15326585701953332, -0.485406928222913, -0.26178246188478976, 0.04270474418567923, 0.08260496519147777, 0.10269585411118057, -0.03611817749613412, -0.269878380258496, 0.06418568286149261, -0.23120400753105058, -0.1698351558441153, -0.08351362268798626, -0.010764355241106107, 0.031137390671154626, -0.22132824397368284, 0.10239744944847189, 0.05278086452924002, -0.06425865210700207, -0.14089598464779557, -0.08025508726624629, -0.03436470819064058, 0.06019027289450885, 0.06508887045604822, 0.007189252818576419, 0.12010931462909166, -0.1534514455912778, -0.027193823908097468, 0.4194104030298499, -0.08735273431162709, -0.19597469711532958, 0.19002040160390046, -0.18383901874319866, -0.13899489004666415, 0.09974968098641301, 0.1248987721816565, 0.1673006072640419, -0.16488741543143987, 0.05694802182048219, -0.021046602747474726, 0.2024899270528784, 0.05398122695847773, -0.03012674084927242, 0.28868299351575283, 0.1771642888824527, -0.03241804198433573, 0.12028654682844017, -0.1245094706179001, -0.1252623088980237, -0.30917728771097386, -0.08190521308794045, -0.11941584624672452, 0.033182946463617, -0.14381189267139863, -0.14928504964336753, 0.3101713626502225, 0.13761052468505044, 0.11893995550210373, 0.03125057610808513, 0.28271910118368954, 0.07449391383964282, 0.03833818775243484, 0.09556719042504062, 0.33427510714301695, 0.18294690352721282, 0.09346064699359256, -0.2549943187493437, 0.05144171248763227, 0.019081611587451055] |
1,802.01802 | Interlocking mechanism between molecular gears attached to surfaces | While molecular machines play an increasingly significant role in nanoscience
research and applications, there remains a shortage of investigations and
understanding of the molecular gear (cogwheel), which is an indispensable and
fundamental component to drive a larger correlated molecular machine system.
Employing ab initio calculations, we investigate model systems consisting of
molecules adsorbed on metal or graphene surfaces, ranging from very simple
triple-arm gears such as PF3 and NH3 to larger multi-arm gears based on carbon
rings. We explore in detail the transmission of slow rotational motion from one
gear to the next by these relatively simple molecules, so as to isolate and
reveal the mechanisms of the relevant intermolecular interactions. Several
characteristics of molecular gears are discussed, in particular the flexibility
of the arms and the slipping and skipping between interlocking arms of adjacent
gears, which differ from familiar macroscopic rigid gears. The underlying
theoretical concepts suggest strongly that other analogous structures may also
exhibit similar behavior which may inspire future exploration in designing
large correlated molecular machines.
| physics.chem-ph cond-mat.mtrl-sci | while molecular machines play an increasingly significant role in nanoscience research and applications there remains a shortage of investigations and understanding of the molecular gear cogwheel which is an indispensable and fundamental component to drive a larger correlated molecular machine system employing ab initio calculations we investigate model systems consisting of molecules adsorbed on metal or graphene surfaces ranging from very simple triplearm gears such as pf3 and nh3 to larger multiarm gears based on carbon rings we explore in detail the transmission of slow rotational motion from one gear to the next by these relatively simple molecules so as to isolate and reveal the mechanisms of the relevant intermolecular interactions several characteristics of molecular gears are discussed in particular the flexibility of the arms and the slipping and skipping between interlocking arms of adjacent gears which differ from familiar macroscopic rigid gears the underlying theoretical concepts suggest strongly that other analogous structures may also exhibit similar behavior which may inspire future exploration in designing large correlated molecular machines | [['while', 'molecular', 'machines', 'play', 'an', 'increasingly', 'significant', 'role', 'in', 'nanoscience', 'research', 'and', 'applications', 'there', 'remains', 'a', 'shortage', 'of', 'investigations', 'and', 'understanding', 'of', 'the', 'molecular', 'gear', 'cogwheel', 'which', 'is', 'an', 'indispensable', 'and', 'fundamental', 'component', 'to', 'drive', 'a', 'larger', 'correlated', 'molecular', 'machine', 'system', 'employing', 'ab', 'initio', 'calculations', 'we', 'investigate', 'model', 'systems', 'consisting', 'of', 'molecules', 'adsorbed', 'on', 'metal', 'or', 'graphene', 'surfaces', 'ranging', 'from', 'very', 'simple', 'triplearm', 'gears', 'such', 'as', 'pf3', 'and', 'nh3', 'to', 'larger', 'multiarm', 'gears', 'based', 'on', 'carbon', 'rings', 'we', 'explore', 'in', 'detail', 'the', 'transmission', 'of', 'slow', 'rotational', 'motion', 'from', 'one', 'gear', 'to', 'the', 'next', 'by', 'these', 'relatively', 'simple', 'molecules', 'so', 'as', 'to', 'isolate', 'and', 'reveal', 'the', 'mechanisms', 'of', 'the', 'relevant', 'intermolecular', 'interactions', 'several', 'characteristics', 'of', 'molecular', 'gears', 'are', 'discussed', 'in', 'particular', 'the', 'flexibility', 'of', 'the', 'arms', 'and', 'the', 'slipping', 'and', 'skipping', 'between', 'interlocking', 'arms', 'of', 'adjacent', 'gears', 'which', 'differ', 'from', 'familiar', 'macroscopic', 'rigid', 'gears', 'the', 'underlying', 'theoretical', 'concepts', 'suggest', 'strongly', 'that', 'other', 'analogous', 'structures', 'may', 'also', 'exhibit', 'similar', 'behavior', 'which', 'may', 'inspire', 'future', 'exploration', 'in', 'designing', 'large', 'correlated', 'molecular', 'machines']] | [-0.12110337807412097, 0.15076490309982404, -0.053361673882958885, 0.04420705208579959, -0.06538486602286736, -0.17274939358613628, 0.03595763482264951, 0.4092092469117108, -0.28780425143634486, -0.3023545416155663, 0.03748854432355412, -0.24480393913457404, -0.1882933095183982, 0.19885524718263772, -0.0010912871172283581, 0.006513611996312163, 0.05136648776611971, -0.048146702491393883, -0.017875254788564263, -0.14610200504782647, 0.2646739933901874, 0.05820801573063799, 0.26284471454801495, 0.04904390840852511, 0.046670995847862995, -0.029382888825811044, -0.009862674995531846, 0.0071380865442271, -0.12898764568929105, 0.1732063514801465, 0.2566864683883945, 0.021652666550731944, 0.25866372939087673, -0.5371427068118743, -0.20648182672587875, 0.05395429816465089, 0.1661964658798349, 0.12287372987996927, -0.06392566807997485, -0.2365444752605197, 0.026350434056014758, -0.12717039020820314, -0.14792475672884883, -0.09247795107333871, 0.045861598377500826, 0.08922011804352876, -0.18660479276524689, 0.02918098794284533, 0.049931852505291384, 0.1134366135786599, -0.05487751436955156, -0.14990302781131074, -0.03711209328242851, 0.14935807772203832, 0.023312160308182818, 0.025585426597627338, 0.21438616099851038, -0.16324506797214333, -0.13079820419410745, 0.45524988469004096, -0.010735517632617743, -0.14910667970731944, 0.29132843325416485, -0.11776320367750383, -0.1514436999715106, 0.1308531838658818, 0.17655382005910494, 0.08599114653927659, -0.13451435401653006, -0.01813028185331391, -0.011470120605137088, 0.1468528836301924, 0.07803003482163666, 0.0603982056776887, 0.27321183714948727, 0.19254166979348275, 0.02601639629051669, 0.11657870003136578, -0.08147570208721644, -0.1599758391723059, -0.204521900033045, -0.1590032350755726, -0.1293088473222068, 0.03990272131436895, -0.033713299669809835, -0.15778967386430887, 0.33260215650881436, 0.137659727577622, 0.17952930103307088, -0.048841385016758776, 0.295799929079806, 0.015168179194289566, 0.0979267226177976, 0.03093549676663326, 0.2421053881104478, 0.11270449833503875, 0.058250086414097936, -0.23215214980202922, 0.08963387881957753, -0.025348594103393306] |
1,802.01803 | Energy-aware Adaptive Spectrum Access and Power Allocation in LAA
Networks via Lyapunov Optimization | To relieve the traffic burden and improve the system capacity,
licensed-assisted access (LAA) has been becoming a promising technology to the
supplementary utilization of the unlicensed spectrum. However, due to the
densification of small base stations (SBSs) and the dynamic variety of the
number of Wi-Fi nodes in the overlapping areas, the licensed channel
interference and the unlicensed channel collision could seriously influence the
Quality of Service (QoS) and the energy consumption. In this paper, jointly
considering time-variant wireless channel conditions, dynamic traffic loads,
and random numbers of Wi-Fi nodes, we address an adaptive spectrum access and
power allocation problem that enables minimizing the system power consumption
under a certain queue stability constraint in the LAA-enabled SBSs and Wi-Fi
networks. The complex stochastic optimization problem is rewritten as the
difference of two convex (D.C.) program in the framework of Lyapunov
optimization, thus developing an online energy-aware optimal algorithm. We also
characterize the performance bounds of the proposed algorithm with a tradeoff
of [O(1=V ); O(V )] between power consumption and delay theoretically. The
numerical results verify the tradeoff and show that our scheme can reduce the
power consumption over the existing scheme by up to 72.1% under the same
traffic delay.
| eess.SP | to relieve the traffic burden and improve the system capacity licensedassisted access laa has been becoming a promising technology to the supplementary utilization of the unlicensed spectrum however due to the densification of small base stations sbss and the dynamic variety of the number of wifi nodes in the overlapping areas the licensed channel interference and the unlicensed channel collision could seriously influence the quality of service qos and the energy consumption in this paper jointly considering timevariant wireless channel conditions dynamic traffic loads and random numbers of wifi nodes we address an adaptive spectrum access and power allocation problem that enables minimizing the system power consumption under a certain queue stability constraint in the laaenabled sbss and wifi networks the complex stochastic optimization problem is rewritten as the difference of two convex dc program in the framework of lyapunov optimization thus developing an online energyaware optimal algorithm we also characterize the performance bounds of the proposed algorithm with a tradeoff of o1v ov between power consumption and delay theoretically the numerical results verify the tradeoff and show that our scheme can reduce the power consumption over the existing scheme by up to 721 under the same traffic delay | [['to', 'relieve', 'the', 'traffic', 'burden', 'and', 'improve', 'the', 'system', 'capacity', 'licensedassisted', 'access', 'laa', 'has', 'been', 'becoming', 'a', 'promising', 'technology', 'to', 'the', 'supplementary', 'utilization', 'of', 'the', 'unlicensed', 'spectrum', 'however', 'due', 'to', 'the', 'densification', 'of', 'small', 'base', 'stations', 'sbss', 'and', 'the', 'dynamic', 'variety', 'of', 'the', 'number', 'of', 'wifi', 'nodes', 'in', 'the', 'overlapping', 'areas', 'the', 'licensed', 'channel', 'interference', 'and', 'the', 'unlicensed', 'channel', 'collision', 'could', 'seriously', 'influence', 'the', 'quality', 'of', 'service', 'qos', 'and', 'the', 'energy', 'consumption', 'in', 'this', 'paper', 'jointly', 'considering', 'timevariant', 'wireless', 'channel', 'conditions', 'dynamic', 'traffic', 'loads', 'and', 'random', 'numbers', 'of', 'wifi', 'nodes', 'we', 'address', 'an', 'adaptive', 'spectrum', 'access', 'and', 'power', 'allocation', 'problem', 'that', 'enables', 'minimizing', 'the', 'system', 'power', 'consumption', 'under', 'a', 'certain', 'queue', 'stability', 'constraint', 'in', 'the', 'laaenabled', 'sbss', 'and', 'wifi', 'networks', 'the', 'complex', 'stochastic', 'optimization', 'problem', 'is', 'rewritten', 'as', 'the', 'difference', 'of', 'two', 'convex', 'dc', 'program', 'in', 'the', 'framework', 'of', 'lyapunov', 'optimization', 'thus', 'developing', 'an', 'online', 'energyaware', 'optimal', 'algorithm', 'we', 'also', 'characterize', 'the', 'performance', 'bounds', 'of', 'the', 'proposed', 'algorithm', 'with', 'a', 'tradeoff', 'of', 'o1v', 'ov', 'between', 'power', 'consumption', 'and', 'delay', 'theoretically', 'the', 'numerical', 'results', 'verify', 'the', 'tradeoff', 'and', 'show', 'that', 'our', 'scheme', 'can', 'reduce', 'the', 'power', 'consumption', 'over', 'the', 'existing', 'scheme', 'by', 'up', 'to', '721', 'under', 'the', 'same', 'traffic', 'delay']] | [-0.26586576334360723, -0.0054740740485769235, -0.03395048246925904, 0.02318394569929388, -0.06348120539820744, -0.19316689179730462, 0.15915441710908776, 0.3774401182967304, -0.31966716300865466, -0.3243408195316942, 0.09271966801330711, -0.24593883230717797, -0.1491292379620118, 0.1603022743665585, -0.15197323043031072, 0.11361844330729748, 0.05398214422342734, 0.022633594317324084, 0.007599349187762298, -0.27553266733696663, 0.26561623849938953, 0.14161504109888667, 0.4187102228299611, 0.08882754782598108, 0.051417111228643494, -0.008825107302394403, -0.014357662212334085, -0.018993457965082443, -0.06930217720873036, 0.11533832887182896, 0.318973549128971, 0.17970149965387666, 0.31402151229687864, -0.4359098483968263, -0.2601377567972499, 0.11413095352937223, 0.1396210242197743, -0.0020354759804151875, -0.014750257204992302, -0.2578255788921708, 0.13971638166806613, -0.2562637616576853, -0.03883358801896167, -0.0010634904699117849, -0.07471368716549918, 0.07839672404724747, -0.3331632803739848, -0.0037067530224290253, -0.03459686642945415, 0.019812322732042333, -0.07827392742367029, -0.0745591188962054, -0.0051806650149184424, 0.1827867440503053, 0.05693635590094603, -0.057562734077995024, 0.11032630085728762, -0.11607753917001037, -0.10885008478906438, 0.39538666335489564, 0.013563946881942977, -0.18956739594454342, 0.12410838883270209, -0.02648944164405229, -0.09097879718885654, 0.156451220943997, 0.2663606375366487, 0.03775082249429566, -0.19477037639878078, 0.05066506724511838, -0.0007262818040232164, 0.16192253872827447, 0.09351423163569034, 0.09581091540167108, 0.118262841667265, 0.2224387711741858, 0.20624777090481736, 0.13063341016631874, -0.08968606309476074, -0.103382741840735, -0.18576905788910208, -0.12324166338599164, -0.19551017106219074, 0.00573447370323155, -0.11970050241308688, -0.06266316564193918, 0.40003403210482585, 0.12641391648459388, 0.11575856318020007, 0.12596848297563165, 0.414585961612186, 0.10760401335375552, 0.034914164119541194, 0.16852817883611554, 0.15868008236466635, 0.05940747639338364, 0.21477996589876994, -0.28986929864222843, 0.061344954138151324, -0.027664128225296736] |
1,802.01804 | Neutron Lifetime and Axial Coupling Connection | Experimental studies of neutron decay, $n\to pe\bar\nu$, exhibit two
anomalies. The first is a 8.6(2.1)s, roughly $4\sigma$ difference between the
average beam measured neutron lifetime, $\tau_n^\text{beam}=888.0(2.0)$s, and
the more precise average trapped ultra cold neutron determination,
$\tau_n^\text{trap}=879.4(6)$s. The second is a $5\sigma$ difference between
the pre2002 average axial coupling, $g_A$, as measured in neutron decay
asymmetries $g_A^\text{pre2002}=1.2637(21)$, and the more recent, post2002,
average $g_A^\text{post2002}=1.2755(11)$, where, following the UCNA
collaboration division, experiments are classified by the date of their most
recent result. In this study, we correlate those $\tau_n$ and $g_A$ values
using a (slightly) updated relation $\tau_n(1+3g_A^2)=5172.0(1.1)$s.
Consistency with that relation and better precision suggest
$\tau_n^\text{favored}=879.4(6)$s and $g_A^\text{favored}=1.2755(11)$ as
preferred values for those parameters. Comparisons of $g_A^\text{favored}$ with
recent lattice QCD and muonic hydrogen capture results are made. A general
constraint on exotic neutron decay branching ratios, $<0.27\%$, is discussed
and applied to a recently proposed solution to the neutron lifetime puzzle.
| hep-ph | experimental studies of neutron decay nto pebarnu exhibit two anomalies the first is a 8621s roughly 4sigma difference between the average beam measured neutron lifetime tau_ntextbeam888020s and the more precise average trapped ultra cold neutron determination tau_ntexttrap87946s the second is a 5sigma difference between the pre2002 average axial coupling g_a as measured in neutron decay asymmetries g_atextpre20021263721 and the more recent post2002 average g_atextpost20021275511 where following the ucna collaboration division experiments are classified by the date of their most recent result in this study we correlate those tau_n and g_a values using a slightly updated relation tau_n13g_a25172011s consistency with that relation and better precision suggest tau_ntextfavored87946s and g_atextfavored1275511 as preferred values for those parameters comparisons of g_atextfavored with recent lattice qcd and muonic hydrogen capture results are made a general constraint on exotic neutron decay branching ratios 027 is discussed and applied to a recently proposed solution to the neutron lifetime puzzle | [['experimental', 'studies', 'of', 'neutron', 'decay', 'nto', 'pebarnu', 'exhibit', 'two', 'anomalies', 'the', 'first', 'is', 'a', '8621s', 'roughly', '4sigma', 'difference', 'between', 'the', 'average', 'beam', 'measured', 'neutron', 'lifetime', 'tau_ntextbeam888020s', 'and', 'the', 'more', 'precise', 'average', 'trapped', 'ultra', 'cold', 'neutron', 'determination', 'tau_ntexttrap87946s', 'the', 'second', 'is', 'a', '5sigma', 'difference', 'between', 'the', 'pre2002', 'average', 'axial', 'coupling', 'g_a', 'as', 'measured', 'in', 'neutron', 'decay', 'asymmetries', 'g_atextpre20021263721', 'and', 'the', 'more', 'recent', 'post2002', 'average', 'g_atextpost20021275511', 'where', 'following', 'the', 'ucna', 'collaboration', 'division', 'experiments', 'are', 'classified', 'by', 'the', 'date', 'of', 'their', 'most', 'recent', 'result', 'in', 'this', 'study', 'we', 'correlate', 'those', 'tau_n', 'and', 'g_a', 'values', 'using', 'a', 'slightly', 'updated', 'relation', 'tau_n13g_a25172011s', 'consistency', 'with', 'that', 'relation', 'and', 'better', 'precision', 'suggest', 'tau_ntextfavored87946s', 'and', 'g_atextfavored1275511', 'as', 'preferred', 'values', 'for', 'those', 'parameters', 'comparisons', 'of', 'g_atextfavored', 'with', 'recent', 'lattice', 'qcd', 'and', 'muonic', 'hydrogen', 'capture', 'results', 'are', 'made', 'a', 'general', 'constraint', 'on', 'exotic', 'neutron', 'decay', 'branching', 'ratios', '027', 'is', 'discussed', 'and', 'applied', 'to', 'a', 'recently', 'proposed', 'solution', 'to', 'the', 'neutron', 'lifetime', 'puzzle']] | [-0.08987175959669652, 0.18921143735226775, -0.062099999217649124, 0.10015786160282525, -0.05321823402108358, -0.10046728285628238, 0.09401453092494713, 0.37326461540402045, -0.1732204536649598, -0.3393093847282996, 0.04667096148145252, -0.3411232505858477, -0.00784514408359038, 0.19621981428936125, 0.0466846599368312, 0.07980444724276563, 0.09420893536880612, 0.043648976127484015, -0.11365507384928475, -0.20298703010692926, 0.2602643742192803, 0.08434611951067511, 0.2756505859749658, 0.0707981098842408, 0.01626007582526654, -0.02959693479019084, -0.06423505939144109, 0.002272306555616004, -0.17140969256397512, 0.08821383300237358, 0.19046421013419085, 0.08007464604161214, 0.12763798431094203, -0.3851771194620856, -0.15184186373039016, 0.13194990280150834, 0.13231316666850554, 0.06192714532704226, -0.0812754092823265, -0.2740483556258758, 0.07607674962034383, -0.20638150310010783, -0.10515659470443747, -0.04935938382654318, 0.08650541290449577, 0.04268042954582987, -0.275901418954267, 0.11216442926420964, -0.015089283813722432, 0.029421630445202546, -0.08306140911133428, -0.21816644219798037, 0.03786591710855386, 0.07460993444879672, 0.09640522970585153, 0.10140374808272878, 0.13816456727217882, -0.10359894589387945, -0.11770853506750427, 0.37576099996055873, -0.09685065232915804, -0.12435198401965733, 0.13341180911229458, -0.20981714567502163, -0.1500443208696587, 0.11537783672569536, 0.11746439814534304, 0.10709961897560528, -0.13685395631057742, -0.02112224525397843, -0.045430142447418935, 0.2005954956901925, 0.10476701230176591, 0.0540416373492917, 0.23076495018529905, 0.2171877908137893, -0.0058170576297145865, 0.0420574617904744, -0.11475532231020874, -0.08021236620843411, -0.2726808952932645, -0.09755353151621031, -0.10412440009282103, 0.06449327949168426, -0.07486469697999253, -0.04954290952134345, 0.31174063135736757, 0.08549996734530266, 0.25127073522391064, 0.03400127972210092, 0.29956581997019904, 0.10854023583067049, 0.05791844455608433, 0.010673078533727676, 0.33640730772167443, 0.21857605695425134, 0.08706295664222645, -0.27887154828079347, 0.08070961899772686, -0.0003191803764951016] |
1,802.01805 | The second lightest CP-even Higgs boson signals in the NMSSM at the LHC | We study the signal rates of the second lightest CP-even Higgs boson, $h_2$,
of the NMSSM produced in gluon fusion, in association with bottom quarks and in
association with top quarks, which is not the SM-like Higgs boson, at the LHC.
We evaluate the production rates of the $h_2$ in the SM fermionic and bosonic
final states in addition to $a_1a_1$, $h_1h_1$ and $Za_1$ final states. It is
observed that the size of the signal rates in some regions of the NMSSM
parameter space is quite large and that could help extracting the $h_2$ signals
at the LHC through a variety of decay channels.
| hep-ph | we study the signal rates of the second lightest cpeven higgs boson h_2 of the nmssm produced in gluon fusion in association with bottom quarks and in association with top quarks which is not the smlike higgs boson at the lhc we evaluate the production rates of the h_2 in the sm fermionic and bosonic final states in addition to a_1a_1 h_1h_1 and za_1 final states it is observed that the size of the signal rates in some regions of the nmssm parameter space is quite large and that could help extracting the h_2 signals at the lhc through a variety of decay channels | [['we', 'study', 'the', 'signal', 'rates', 'of', 'the', 'second', 'lightest', 'cpeven', 'higgs', 'boson', 'h_2', 'of', 'the', 'nmssm', 'produced', 'in', 'gluon', 'fusion', 'in', 'association', 'with', 'bottom', 'quarks', 'and', 'in', 'association', 'with', 'top', 'quarks', 'which', 'is', 'not', 'the', 'smlike', 'higgs', 'boson', 'at', 'the', 'lhc', 'we', 'evaluate', 'the', 'production', 'rates', 'of', 'the', 'h_2', 'in', 'the', 'sm', 'fermionic', 'and', 'bosonic', 'final', 'states', 'in', 'addition', 'to', 'a_1a_1', 'h_1h_1', 'and', 'za_1', 'final', 'states', 'it', 'is', 'observed', 'that', 'the', 'size', 'of', 'the', 'signal', 'rates', 'in', 'some', 'regions', 'of', 'the', 'nmssm', 'parameter', 'space', 'is', 'quite', 'large', 'and', 'that', 'could', 'help', 'extracting', 'the', 'h_2', 'signals', 'at', 'the', 'lhc', 'through', 'a', 'variety', 'of', 'decay', 'channels']] | [-0.05987155193668933, 0.2791967185823104, -0.03830563954901523, 0.15250629172190272, -0.024482669362511773, -0.15486531393029368, 0.06154232739488809, 0.33587588751554276, -0.22506533914174026, -0.20548059634613589, 0.0185804251053084, -0.2803763778647408, 0.027911393876330785, 0.11050236847950146, 0.04842134230420925, 0.07782192622275594, 0.13700591395228492, 0.03747547050807043, 0.00011546666232439187, -0.3031577418620985, 0.313260546516036, 0.025142752072917156, 0.1854777880048809, 0.12186769516511749, 0.02490764289485434, 0.0032687720735199177, -0.00497161814676544, -0.16047486273796843, -0.0937837273417804, 0.10238897671829014, 0.21571051209376982, 0.09437146039160255, 0.13401724455448297, -0.2891595333886261, -0.11239644795512924, 0.1955751009607831, 0.16246713042402497, 0.09807580315995998, -0.07705255565815605, -0.32664741001700837, 0.13684158994314763, -0.218140279301084, -0.04857316592153019, -0.014056442731928725, -0.041500010438120134, -0.11590342435206716, -0.3526206082113696, 0.09832567159229746, -0.08409799253198659, 0.005687311611836776, -0.0051812008375866124, -0.16721833247888404, -0.15404928027867124, 0.013198337526633762, 0.15218389792537962, 0.03262655232286376, 0.19362193654524162, -0.27923530844075756, -0.1604386233867934, 0.3888658830233348, -0.14947488982803547, -0.18394169910327315, 0.23098118902998976, -0.2265456315362826, -0.15027712755531517, 0.16945974060441726, 0.23324335556334028, 0.05622446419706998, -0.15211375270826885, 0.15730498625243156, -0.04061784050785578, 0.16736052488872352, 0.06308809405443473, 0.09984873444325505, 0.21882638817008299, 0.1686761946318886, 0.005715749548891416, 0.106147029177429, -0.13982408506294283, -0.10854709296164891, -0.4110409035632844, -0.19527770625427365, -0.06346132716862485, -0.026951983818295187, -0.05316628302758685, -0.05753114486399751, 0.42348911406812617, 0.09641062106059578, 0.2965511307993438, -0.03986141352148619, 0.28003620067521784, 0.09057669981848449, 0.0837366803294012, 0.031621854727675855, 0.32771847813189825, 0.15378968979124552, 0.1137402004096657, -0.23815853358946, 0.015380578603631316, 0.0751813923035605] |
1,802.01806 | Detection of persistent signals and its relation to coherent feedforward
loops | Many studies have shown that cells use temporal dynamics of signalling
molecules to encode information. One particular class of temporal dynamics is
persistent and transient signals, i.e. signals of long and short durations
respectively. It has been shown that the coherent type-1 feedforward loop with
an AND logic at the output (or C1-FFL for short) can be used to discriminate a
persistent input signal from a transient one. This has been done by modelling
the C1-FFL, and then use the model to show that persistent and transient input
signals give, respectively, a non-zero and zero output. Instead of assuming the
structure of C1-FFL, this paper shows that it is possible to deduce the C1-FFL
model from the requirement of discriminating a persistent signal. We do this by
first formulating a statistical detection problem of distinguishing persistent
signals from transient ones. The solution of the detection problem is to
compute the log-likelihood ratio of observing a persistent signal to a
transient signal. We show that, if this log-likelihood ratio is positive, which
happens when the signal is likely to be persistent, then it can be
approximately computed by a C1-FFL. Although the capability of C1-FFL to
discriminate persistent signals is known, this paper adds an information
processing interpretation on how a C1-FFL works as a detector of persistent
signals.
| q-bio.MN cs.IT math.IT | many studies have shown that cells use temporal dynamics of signalling molecules to encode information one particular class of temporal dynamics is persistent and transient signals ie signals of long and short durations respectively it has been shown that the coherent type1 feedforward loop with an and logic at the output or c1ffl for short can be used to discriminate a persistent input signal from a transient one this has been done by modelling the c1ffl and then use the model to show that persistent and transient input signals give respectively a nonzero and zero output instead of assuming the structure of c1ffl this paper shows that it is possible to deduce the c1ffl model from the requirement of discriminating a persistent signal we do this by first formulating a statistical detection problem of distinguishing persistent signals from transient ones the solution of the detection problem is to compute the loglikelihood ratio of observing a persistent signal to a transient signal we show that if this loglikelihood ratio is positive which happens when the signal is likely to be persistent then it can be approximately computed by a c1ffl although the capability of c1ffl to discriminate persistent signals is known this paper adds an information processing interpretation on how a c1ffl works as a detector of persistent signals | [['many', 'studies', 'have', 'shown', 'that', 'cells', 'use', 'temporal', 'dynamics', 'of', 'signalling', 'molecules', 'to', 'encode', 'information', 'one', 'particular', 'class', 'of', 'temporal', 'dynamics', 'is', 'persistent', 'and', 'transient', 'signals', 'ie', 'signals', 'of', 'long', 'and', 'short', 'durations', 'respectively', 'it', 'has', 'been', 'shown', 'that', 'the', 'coherent', 'type1', 'feedforward', 'loop', 'with', 'an', 'and', 'logic', 'at', 'the', 'output', 'or', 'c1ffl', 'for', 'short', 'can', 'be', 'used', 'to', 'discriminate', 'a', 'persistent', 'input', 'signal', 'from', 'a', 'transient', 'one', 'this', 'has', 'been', 'done', 'by', 'modelling', 'the', 'c1ffl', 'and', 'then', 'use', 'the', 'model', 'to', 'show', 'that', 'persistent', 'and', 'transient', 'input', 'signals', 'give', 'respectively', 'a', 'nonzero', 'and', 'zero', 'output', 'instead', 'of', 'assuming', 'the', 'structure', 'of', 'c1ffl', 'this', 'paper', 'shows', 'that', 'it', 'is', 'possible', 'to', 'deduce', 'the', 'c1ffl', 'model', 'from', 'the', 'requirement', 'of', 'discriminating', 'a', 'persistent', 'signal', 'we', 'do', 'this', 'by', 'first', 'formulating', 'a', 'statistical', 'detection', 'problem', 'of', 'distinguishing', 'persistent', 'signals', 'from', 'transient', 'ones', 'the', 'solution', 'of', 'the', 'detection', 'problem', 'is', 'to', 'compute', 'the', 'loglikelihood', 'ratio', 'of', 'observing', 'a', 'persistent', 'signal', 'to', 'a', 'transient', 'signal', 'we', 'show', 'that', 'if', 'this', 'loglikelihood', 'ratio', 'is', 'positive', 'which', 'happens', 'when', 'the', 'signal', 'is', 'likely', 'to', 'be', 'persistent', 'then', 'it', 'can', 'be', 'approximately', 'computed', 'by', 'a', 'c1ffl', 'although', 'the', 'capability', 'of', 'c1ffl', 'to', 'discriminate', 'persistent', 'signals', 'is', 'known', 'this', 'paper', 'adds', 'an', 'information', 'processing', 'interpretation', 'on', 'how', 'a', 'c1ffl', 'works', 'as', 'a', 'detector', 'of', 'persistent', 'signals']] | [-0.11945082190357909, 0.08931530254303986, -0.10098648762731992, 0.10125589990452223, -0.08199691441798702, -0.16549665052785512, 0.0264629547306926, 0.3732888457117551, -0.3151112408120903, -0.292093950551251, 0.13908404976860064, -0.2672971230397565, -0.18990236972010088, 0.18478002135456034, -0.0698274030887368, 0.016959377320978894, 0.06610929150638435, 0.08329597740741702, -0.028343457563613634, -0.18816737713903153, 0.24574253630798754, 0.06746361714172595, 0.25898633083892525, 0.012436159659997312, 0.13827885639503462, -0.013781499709301722, -0.043005551643554255, 0.024757090759455064, -0.05049512115147081, 0.08747113579211312, 0.2669631701620689, 0.16939535486477708, 0.23030875382385294, -0.3996346239854983, -0.24656029088943854, 0.1710684521752837, 0.11395953015150362, 0.12645298558866194, -0.024980953152407892, -0.2649599693100387, 0.14382903985764592, -0.16170175759540445, -0.05296915431438578, -0.05969694656866748, 0.058338794056240706, 0.0178229113466132, -0.26679116512414863, 0.06504416763686378, 0.08825561990363336, -0.010889498627992399, -0.021222195363765874, -0.03570819162943084, 0.012686490161352953, 0.148741027640009, 0.05826888444252449, 0.04400740934102241, 0.11167485179131799, -0.13908208309835113, -0.15503923105152853, 0.3204646958251817, -0.07775753125101927, -0.17028657895504334, 0.1870811458702686, -0.12855955516789194, -0.13306171579688036, 0.16616470322286317, 0.15157948054561238, 0.1018262932593977, -0.1737608391351153, 0.0008476988221262368, -0.011244759031938851, 0.2352128751445647, 0.06028677540918846, 0.03956874454214554, 0.24295111937414204, 0.16196257808062017, 0.05788678169403216, 0.1698170235330333, -0.15422270441969319, -0.03317054771682581, -0.24274679060241447, -0.10767999859718999, -0.18031068680884846, 0.06727919635499631, -0.009623794335954174, -0.13954895788642424, 0.4267604587377485, 0.16023118721765525, 0.20751263838423706, 0.06952446166996272, 0.3301365696857128, 0.13349668387218952, 0.05728704748042953, 0.042719030061762336, 0.23993904503498123, 0.1216205842381796, 0.08592165724391443, -0.18248702624039467, 0.11914919875134979, 0.0015741560518434015] |
1,802.01807 | Channel Diagonalization for Cloud Radio Access | The diagonalization of a conventional multiple-input multiple-output (MIMO)
channel into parallel and independent subchannels via singular value
decomposition (SVD) is a fundamental strategy that allows the MIMO channel
capacity to be achieved using scalar channel codes. This letter establishes a
similar channel diagonalization result for the uplink and the downlink of a
cloud radio access network (C-RAN), in which a central processor (CP) is
connected to a remote radio head (RRH) serving a single user via rate-limit
digital fronthaul carrying the compressed baseband signal. Specifically, we
show that the diagonalization of the MIMO channel between the RRH and the user
via SVD and the subsequent independent and parallel quantization of scalar
signals and channel coding in each of the subchannels is optimal. This letter
establishes this fact using the majorization theory. Further, an
uplink-downlink duality for the multiple-antenna C-RAN is identified for this
single-user case.
| cs.IT math.IT | the diagonalization of a conventional multipleinput multipleoutput mimo channel into parallel and independent subchannels via singular value decomposition svd is a fundamental strategy that allows the mimo channel capacity to be achieved using scalar channel codes this letter establishes a similar channel diagonalization result for the uplink and the downlink of a cloud radio access network cran in which a central processor cp is connected to a remote radio head rrh serving a single user via ratelimit digital fronthaul carrying the compressed baseband signal specifically we show that the diagonalization of the mimo channel between the rrh and the user via svd and the subsequent independent and parallel quantization of scalar signals and channel coding in each of the subchannels is optimal this letter establishes this fact using the majorization theory further an uplinkdownlink duality for the multipleantenna cran is identified for this singleuser case | [['the', 'diagonalization', 'of', 'a', 'conventional', 'multipleinput', 'multipleoutput', 'mimo', 'channel', 'into', 'parallel', 'and', 'independent', 'subchannels', 'via', 'singular', 'value', 'decomposition', 'svd', 'is', 'a', 'fundamental', 'strategy', 'that', 'allows', 'the', 'mimo', 'channel', 'capacity', 'to', 'be', 'achieved', 'using', 'scalar', 'channel', 'codes', 'this', 'letter', 'establishes', 'a', 'similar', 'channel', 'diagonalization', 'result', 'for', 'the', 'uplink', 'and', 'the', 'downlink', 'of', 'a', 'cloud', 'radio', 'access', 'network', 'cran', 'in', 'which', 'a', 'central', 'processor', 'cp', 'is', 'connected', 'to', 'a', 'remote', 'radio', 'head', 'rrh', 'serving', 'a', 'single', 'user', 'via', 'ratelimit', 'digital', 'fronthaul', 'carrying', 'the', 'compressed', 'baseband', 'signal', 'specifically', 'we', 'show', 'that', 'the', 'diagonalization', 'of', 'the', 'mimo', 'channel', 'between', 'the', 'rrh', 'and', 'the', 'user', 'via', 'svd', 'and', 'the', 'subsequent', 'independent', 'and', 'parallel', 'quantization', 'of', 'scalar', 'signals', 'and', 'channel', 'coding', 'in', 'each', 'of', 'the', 'subchannels', 'is', 'optimal', 'this', 'letter', 'establishes', 'this', 'fact', 'using', 'the', 'majorization', 'theory', 'further', 'an', 'uplinkdownlink', 'duality', 'for', 'the', 'multipleantenna', 'cran', 'is', 'identified', 'for', 'this', 'singleuser', 'case']] | [-0.30626150845983546, 0.020840959364231193, -0.03430606736801565, -0.04333440055107248, -0.10114387876097242, -0.2814743739038963, 0.15567521362581516, 0.3517873717728874, -0.30203880455088, -0.16629139157975542, 0.10732654142675215, -0.20427490802018117, -0.17013554119761906, 0.08889969076062071, -0.05663598141922005, 0.04731155806943646, 0.07176909839798665, 0.03693954875243121, -0.055084191895379074, -0.21794392394608464, 0.2833956491908637, 0.13049986042596143, 0.3906690310815285, -0.00448394198099087, 0.07033685102962471, 0.07010210160615629, -0.05291732847048291, -0.10112501890077416, -0.05298079683591917, 0.07644109512711393, 0.3665881160421875, 0.2179604294138824, 0.2378094781318615, -0.398455732746114, -0.23573210111594406, 0.08246795882888396, 0.24520435708912153, 0.053459682793292246, -0.07133847966404824, -0.30279467908569196, 0.1677216091570605, -0.2793046140256498, 0.043952352112030676, 0.08734664753850165, -0.11792395225372808, -0.019314098575931235, -0.4239114206412743, 0.05722788597882629, -0.03424374043684581, 0.02746613990708158, -0.03668394064378186, -0.12157431186080493, 0.0775047097001867, 0.1535146604645355, 0.019734588628313666, 0.024784051599623314, 0.10432541329927486, -0.10017059378984287, -0.09441974848460663, 0.3464791168346359, 0.029464039270733964, -0.26805066641677044, 0.13997521094319507, -0.07488846112331697, -0.10215815362231485, 0.12170638788876863, 0.23255573878514355, 0.041418520290131586, -0.2085770432869422, 0.07046320542195363, -0.07900658745061735, 0.17114751299297246, 0.07509951456931645, 0.13874402446993467, 0.16781329491882233, 0.17474941753396958, 0.13563358780510468, 0.20072860019522365, -0.1625859118837478, -0.11290214075546326, -0.20324646091803203, -0.17128109580451814, -0.27272432293614435, 0.03796371503187151, -0.13137322546982463, -0.06229766694957326, 0.37598211432582346, 0.06753834749347178, 0.08985661169000227, 0.1176945488297798, 0.43867766114658324, 0.1182417384027664, 0.08459063195462885, 0.15268507123250386, 0.19745352185042253, 0.2251213356732102, 0.16272999243409342, -0.22720389115013953, -0.04123764364048839, 0.001288783657846266] |
1,802.01808 | Mixed Link Networks | Basing on the analysis by revealing the equivalence of modern networks, we
find that both ResNet and DenseNet are essentially derived from the same "dense
topology", yet they only differ in the form of connection -- addition (dubbed
"inner link") vs. concatenation (dubbed "outer link"). However, both two forms
of connections have the superiority and insufficiency. To combine their
advantages and avoid certain limitations on representation learning, we present
a highly efficient and modularized Mixed Link Network (MixNet) which is
equipped with flexible inner link and outer link modules. Consequently, ResNet,
DenseNet and Dual Path Network (DPN) can be regarded as a special case of
MixNet, respectively. Furthermore, we demonstrate that MixNets can achieve
superior efficiency in parameter over the state-of-the-art architectures on
many competitive datasets like CIFAR-10/100, SVHN and ImageNet.
| cs.LG | basing on the analysis by revealing the equivalence of modern networks we find that both resnet and densenet are essentially derived from the same dense topology yet they only differ in the form of connection addition dubbed inner link vs concatenation dubbed outer link however both two forms of connections have the superiority and insufficiency to combine their advantages and avoid certain limitations on representation learning we present a highly efficient and modularized mixed link network mixnet which is equipped with flexible inner link and outer link modules consequently resnet densenet and dual path network dpn can be regarded as a special case of mixnet respectively furthermore we demonstrate that mixnets can achieve superior efficiency in parameter over the stateoftheart architectures on many competitive datasets like cifar10100 svhn and imagenet | [['basing', 'on', 'the', 'analysis', 'by', 'revealing', 'the', 'equivalence', 'of', 'modern', 'networks', 'we', 'find', 'that', 'both', 'resnet', 'and', 'densenet', 'are', 'essentially', 'derived', 'from', 'the', 'same', 'dense', 'topology', 'yet', 'they', 'only', 'differ', 'in', 'the', 'form', 'of', 'connection', 'addition', 'dubbed', 'inner', 'link', 'vs', 'concatenation', 'dubbed', 'outer', 'link', 'however', 'both', 'two', 'forms', 'of', 'connections', 'have', 'the', 'superiority', 'and', 'insufficiency', 'to', 'combine', 'their', 'advantages', 'and', 'avoid', 'certain', 'limitations', 'on', 'representation', 'learning', 'we', 'present', 'a', 'highly', 'efficient', 'and', 'modularized', 'mixed', 'link', 'network', 'mixnet', 'which', 'is', 'equipped', 'with', 'flexible', 'inner', 'link', 'and', 'outer', 'link', 'modules', 'consequently', 'resnet', 'densenet', 'and', 'dual', 'path', 'network', 'dpn', 'can', 'be', 'regarded', 'as', 'a', 'special', 'case', 'of', 'mixnet', 'respectively', 'furthermore', 'we', 'demonstrate', 'that', 'mixnets', 'can', 'achieve', 'superior', 'efficiency', 'in', 'parameter', 'over', 'the', 'stateoftheart', 'architectures', 'on', 'many', 'competitive', 'datasets', 'like', 'cifar10100', 'svhn', 'and', 'imagenet']] | [-0.12402397544266512, -0.005483980555660449, -0.05170805358524936, 0.06763761325542314, -0.09949470188271684, -0.20169648217897002, 0.0254593960994568, 0.44436596482992174, -0.27175745385913896, -0.2998585509194527, 0.11914260376853725, -0.22414076131087943, -0.21960243287747008, 0.2263860419177665, -0.11484944067465572, -0.0011103628059992423, 0.14229964604959466, 0.027713908881951983, -0.12001968044877195, -0.25538454135306754, 0.28859273208794406, 0.049279989696179444, 0.33827493228734684, 0.03549256933704153, 0.1306127619790809, -0.045913918920604584, -0.0037090602456233824, 0.040194358682044996, -0.048550742467565355, 0.15171685172244906, 0.25545608535982095, 0.13924260190150772, 0.2261340589656566, -0.44111148146196055, -0.2174913856630715, 0.08706853795581712, 0.16113998971592922, -0.00894722623488633, -0.011629580966949176, -0.27703755785030526, 0.11982959267647507, -0.23367435114386564, 0.027115659032894587, -0.13106707370338533, -0.05981125843782838, 0.03288832603362747, -0.2228502914739343, 0.033358947853915966, 0.05768082389034904, 0.02725415819396193, -0.027132833587865418, -0.1475430391048296, -0.018929792020040064, 0.16027775549535783, -0.032052492273326676, 0.030132081911254386, 0.10994086243355504, -0.18932057093255794, -0.1482446080718476, 0.33636851578664323, -0.07883369830904904, -0.19776506219059228, 0.2582989448806844, -0.01402849630595973, -0.14089885384489137, 0.07294534875724751, 0.17108379794427983, 0.07796868681370352, -0.09099574555427982, 0.05232018449460156, -0.07644893672460547, 0.14106880023072546, 0.10149285445491282, 0.07183297274347682, 0.15511271212269023, 0.22614017189838564, 0.04283075087050048, 0.1446570547019991, -0.11944790094052084, -0.13552657831102036, -0.20528008779510856, -0.14765778565421128, -0.14456233540549873, -0.011589728083568984, -0.12985049744344837, -0.12194405935991269, 0.37702263512541184, 0.14387591716905052, 0.2153073543933435, 0.1356095537476134, 0.31085096824412733, -0.013136785902763503, 0.1354162537976383, 0.12518571893541286, 0.23188835171302064, 0.11164421408992405, 0.046490126858966856, -0.16063642421549257, 0.07141660498634267, 0.04530883480149966] |
1,802.01809 | Suspension splittings and self-maps of flag manifolds | If $G$ is a compact connected Lie group and $T$ is a maximal torus, we give a
wedge decomposition of $\Sigma G/T$ by identifying families of idempotents in
cohomology. This is used to give new information on the self-maps of $G/T$.
| math.AT | if g is a compact connected lie group and t is a maximal torus we give a wedge decomposition of sigma gt by identifying families of idempotents in cohomology this is used to give new information on the selfmaps of gt | [['if', 'g', 'is', 'a', 'compact', 'connected', 'lie', 'group', 'and', 't', 'is', 'a', 'maximal', 'torus', 'we', 'give', 'a', 'wedge', 'decomposition', 'of', 'sigma', 'gt', 'by', 'identifying', 'families', 'of', 'idempotents', 'in', 'cohomology', 'this', 'is', 'used', 'to', 'give', 'new', 'information', 'on', 'the', 'selfmaps', 'of', 'gt']] | [-0.231390798282696, 0.09288299113239457, -0.12890106348729716, 0.01959491564846802, -0.15503942743852372, -0.11349162310589014, 0.0059123759089810095, 0.35280053671903727, -0.2731552260314546, -0.16819400158597203, 0.1298460690503395, -0.24512019561512804, -0.10505575723037487, 0.19335597716044725, -0.13129591744211389, -0.09151691862768153, 0.019234292186433223, 0.16501109233898362, -0.08593474507967873, -0.21117118864161213, 0.4109258241042858, -0.06688161494164932, 0.14183519823794685, 0.05414964036061996, 0.0957537257771303, -0.033824967640656525, -0.03506949939765036, -0.018303630101244625, -0.2030221559788759, 0.12260419266616426, 0.316733967512846, 0.10970009282009857, 0.20448545089400397, -0.3253586040128295, -0.1447816439336393, 0.20167552918286585, 0.08513785219501431, -0.029004005885614855, -0.02361278198716208, -0.2665704342468483, 0.12598591862763164, -0.15288407201083695, -0.12464108210193311, -0.079149673193148, 0.1445066686719656, -0.01773938929616678, -0.2591893463054808, 0.008616860808304897, 0.09792327122172205, 0.09071169300686295, 0.006686391308903694, -0.0872706570776134, -0.06621696947642215, 0.12790715361650035, -0.0814312333411469, 0.09758379559952585, 0.1296732189111048, -0.04944167762608608, -0.09093054686105106, 0.3906903089614721, -0.07517361136085195, -0.2365374592837037, 0.10377188885539043, -0.1838913594554292, -0.19599829923088957, 0.13951118877611873, 0.09173507229765741, 0.20251889913002166, -0.06405530974450635, 0.18751741043808756, -0.1499844154842743, 0.06524307844115466, 0.03903531653397694, -0.033632540939057744, 0.15121924479651014, 0.15107245865368807, 0.15025688230809642, 0.1588352336321117, 0.012767821862703053, 0.06963503013205964, -0.38805914379474593, -0.17769024939071842, -0.14751199687399516, 0.16657662889125144, -0.09771146846717939, -0.16611781610508178, 0.4323117308682058, 0.0179411055656468, 0.21822682996394066, 0.08035178392168657, 0.18375403458456985, 0.05463031351725321, 0.09316794723045171, 0.12547314227217946, 0.10863752654049455, 0.2816066416264398, -0.1136025946201166, -0.1408493625477138, -0.04430154691274255, 0.2292004427986174] |
1,802.0181 | Polynomial Invariants for Affine Programs | We exhibit an algorithm to compute the strongest polynomial (or algebraic)
invariants that hold at each location of a given affine program (i.e., a
program having only non-deterministic (as opposed to conditional) branching and
all of whose assignments are given by affine expressions). Our main tool is an
algebraic result of independent interest: given a finite set of rational square
matrices of the same dimension, we show how to compute the Zariski closure of
the semigroup that they generate.
| cs.LO cs.DM math.AG | we exhibit an algorithm to compute the strongest polynomial or algebraic invariants that hold at each location of a given affine program ie a program having only nondeterministic as opposed to conditional branching and all of whose assignments are given by affine expressions our main tool is an algebraic result of independent interest given a finite set of rational square matrices of the same dimension we show how to compute the zariski closure of the semigroup that they generate | [['we', 'exhibit', 'an', 'algorithm', 'to', 'compute', 'the', 'strongest', 'polynomial', 'or', 'algebraic', 'invariants', 'that', 'hold', 'at', 'each', 'location', 'of', 'a', 'given', 'affine', 'program', 'ie', 'a', 'program', 'having', 'only', 'nondeterministic', 'as', 'opposed', 'to', 'conditional', 'branching', 'and', 'all', 'of', 'whose', 'assignments', 'are', 'given', 'by', 'affine', 'expressions', 'our', 'main', 'tool', 'is', 'an', 'algebraic', 'result', 'of', 'independent', 'interest', 'given', 'a', 'finite', 'set', 'of', 'rational', 'square', 'matrices', 'of', 'the', 'same', 'dimension', 'we', 'show', 'how', 'to', 'compute', 'the', 'zariski', 'closure', 'of', 'the', 'semigroup', 'that', 'they', 'generate']] | [-0.11982238284220825, 0.06815330810657749, -0.08499992172575638, 0.06989047458967124, -0.09674541778343765, -0.15828378553814668, 0.03343968912281237, 0.31942975261731993, -0.33033114492515975, -0.24726048450256827, 0.11031551204645369, -0.2290104268224839, -0.13605639193784683, 0.21312425239011645, -0.07799745787117819, 0.04641811639995939, 0.002259190701231172, 0.11694789519887182, -0.09140529470736326, -0.3063494304218624, 0.33344887524748906, -0.013342025701569605, 0.2066986642636453, 0.018900428589174074, 0.1683712943126978, 0.010553731194025353, -0.049984583480849484, 0.02962708296372166, -0.10448844258800956, 0.11356415024286584, 0.3065032075053152, 0.1930247397651812, 0.2212222336991867, -0.3921658824657715, -0.07300319005086829, 0.20638138081442234, 0.13484355084055774, 0.08076936703269617, 0.01792633906596258, -0.24421714694250987, 0.14374103983038966, -0.1550823383658087, -0.15094000517237413, -0.07380249628891485, 0.04268365077485767, 0.051619196421897065, -0.2692405696298125, -0.057498496827445456, 0.10703698293412034, 0.09499402874727038, -0.03501398269605788, -0.11648822088042109, -0.04464606896537957, 0.1335000463280992, -0.019308293524162867, 0.04920429668000227, 0.10083220381572654, -0.07424109984598935, -0.16594003829397733, 0.37476790148788425, -0.016784467581140845, -0.23448509138218965, 0.15430357659462532, -0.1526464395449037, -0.16589337069234705, 0.15587637838435983, 0.15103249225906934, 0.1158909141970209, -0.06856024424439366, 0.11934434081342284, -0.14848717221919494, 0.12623627073296545, 0.0527347588640508, 0.035256569651014445, 0.15438327999031054, 0.068693408359408, 0.1012493185934764, 0.15255828409255306, 0.03258483420727374, -0.060715860657724025, -0.3875096848682512, -0.14996548017038952, -0.19087545624051927, 0.06787621638961608, -0.11987779486929567, -0.25295927077885483, 0.3962345266643959, 0.1074309353539838, 0.2067586377828936, 0.16890860021208662, 0.24490545995392, 0.1534687971530108, 0.04024154810777193, 0.09950911429934675, 0.10479774113885965, 0.15925161649850256, -0.033383369357384084, -0.1875109037478702, 0.10233583683265915, 0.1412110403769567] |
1,802.01811 | Topological light-trapping on a dislocation | Topology has been revealed to play a fundamental role in physics in the past
decades. Topological insulators have unconventional gapless edge states where
disorder-induced back-scattering is suppressed. In photonics, such edge states
lead to unidirectional waveguides which are useful for integrated photonic
chips. Cavity modes, another type of fundamental components in photonic chips,
however, are not protected by band topology because of their lower dimensions.
Here we demonstrate that concurrent wavevector-space and real-space topology,
dubbed as the "dual-topology", can lead to light-trapping in lower-dimensions.
The resultant photonic bound state emerges as a Jackiw-Rebbi soliton mode
localized on a dislocation in a two-dimensional (2D) photonic crystal, as
predicted theoretically and discovered experimentally. Such a strongly-confined
0D localized mode, which is solely due to the topological mechanism, is found
to be robust against perturbations. Our study unveils a new mechanism for
topological light-trapping in lower-dimensions, which is valuable for
fundamental physics and a variety of applications in photonics.
| physics.optics cond-mat.mtrl-sci | topology has been revealed to play a fundamental role in physics in the past decades topological insulators have unconventional gapless edge states where disorderinduced backscattering is suppressed in photonics such edge states lead to unidirectional waveguides which are useful for integrated photonic chips cavity modes another type of fundamental components in photonic chips however are not protected by band topology because of their lower dimensions here we demonstrate that concurrent wavevectorspace and realspace topology dubbed as the dualtopology can lead to lighttrapping in lowerdimensions the resultant photonic bound state emerges as a jackiwrebbi soliton mode localized on a dislocation in a twodimensional 2d photonic crystal as predicted theoretically and discovered experimentally such a stronglyconfined 0d localized mode which is solely due to the topological mechanism is found to be robust against perturbations our study unveils a new mechanism for topological lighttrapping in lowerdimensions which is valuable for fundamental physics and a variety of applications in photonics | [['topology', 'has', 'been', 'revealed', 'to', 'play', 'a', 'fundamental', 'role', 'in', 'physics', 'in', 'the', 'past', 'decades', 'topological', 'insulators', 'have', 'unconventional', 'gapless', 'edge', 'states', 'where', 'disorderinduced', 'backscattering', 'is', 'suppressed', 'in', 'photonics', 'such', 'edge', 'states', 'lead', 'to', 'unidirectional', 'waveguides', 'which', 'are', 'useful', 'for', 'integrated', 'photonic', 'chips', 'cavity', 'modes', 'another', 'type', 'of', 'fundamental', 'components', 'in', 'photonic', 'chips', 'however', 'are', 'not', 'protected', 'by', 'band', 'topology', 'because', 'of', 'their', 'lower', 'dimensions', 'here', 'we', 'demonstrate', 'that', 'concurrent', 'wavevectorspace', 'and', 'realspace', 'topology', 'dubbed', 'as', 'the', 'dualtopology', 'can', 'lead', 'to', 'lighttrapping', 'in', 'lowerdimensions', 'the', 'resultant', 'photonic', 'bound', 'state', 'emerges', 'as', 'a', 'jackiwrebbi', 'soliton', 'mode', 'localized', 'on', 'a', 'dislocation', 'in', 'a', 'twodimensional', '2d', 'photonic', 'crystal', 'as', 'predicted', 'theoretically', 'and', 'discovered', 'experimentally', 'such', 'a', 'stronglyconfined', '0d', 'localized', 'mode', 'which', 'is', 'solely', 'due', 'to', 'the', 'topological', 'mechanism', 'is', 'found', 'to', 'be', 'robust', 'against', 'perturbations', 'our', 'study', 'unveils', 'a', 'new', 'mechanism', 'for', 'topological', 'lighttrapping', 'in', 'lowerdimensions', 'which', 'is', 'valuable', 'for', 'fundamental', 'physics', 'and', 'a', 'variety', 'of', 'applications', 'in', 'photonics']] | [-0.16164127377756907, 0.216073708052372, -0.07901528043757108, 0.04011145149442283, -0.06481172548086903, -0.2081270388285206, 0.030874489111880253, 0.38530666602460983, -0.26083884542420893, -0.27285089430870946, 0.06528891404401269, -0.2577393977576262, -0.21088446105237713, 0.219240093700491, -0.018356656177912826, 0.08615011080809228, -0.02090238040470361, -0.05596068426180486, -0.0045602170277278045, -0.1477027662285882, 0.26289663165082017, 0.009305076540580817, 0.3743055517718728, 0.10137289345518431, 0.01555114951553186, -0.035247309745724806, 0.06172120507032453, -0.0024446238145268487, -0.10619090021726435, 0.09756540181493241, 0.2984547215462292, -0.04154128837096807, 0.23000836251424506, -0.48783116993288717, -0.262909671479183, 0.04244012528328926, 0.19601535860013652, 0.15757838640643235, -0.11235814801774097, -0.3106265895479879, 0.10011736303265509, -0.13055399046037588, -0.12844512919145454, -0.10298744680710717, 0.03805417700537613, -0.08031612981410165, -0.18658443504049407, 0.047335273141718724, 0.05243542426161456, 0.029806474189715486, -0.01772524145516482, -0.027997431742910344, -0.09988365839265723, 0.05904303444851819, -0.03494250308949041, 0.013193029877820428, 0.1118214616382664, -0.1454422924238221, -0.20510729861010302, 0.4009420924953052, -0.00915024695047117, -0.15188249727928793, 0.21183409635582334, -0.0898081818671123, -0.07534078160881416, 0.11953538226253994, 0.19719507589417679, 0.04704669731602605, -0.07162298200056319, 0.07379996058018576, -0.03340377791046903, 0.1625645574932168, 0.032754306010176225, 0.2072135482963126, 0.29110753860977756, 0.2118469530281115, 0.07630632326036937, 0.14876890637195223, -0.07863700001760592, -0.07507882162916486, -0.23013569907490888, -0.19905254402532024, -0.24025326690375018, 0.04909903473890154, -0.011200781475904536, -0.2164104839548009, 0.4429321712874747, 0.08984138088167778, 0.15303084892886026, -0.09793429226726415, 0.23290555462446788, 0.12274907069740357, 0.11088718505207353, 0.054255558141543495, 0.3045604421224977, 0.1533296769666304, 0.06548619932228965, -0.20113808314399884, 0.0367554998805432, 0.016741686431062105] |
1,802.01812 | Decoding-History-Based Adaptive Control of Attention for Neural Machine
Translation | Attention-based sequence-to-sequence model has proved successful in Neural
Machine Translation (NMT). However, the attention without consideration of
decoding history, which includes the past information in the decoder and the
attention mechanism, often causes much repetition. To address this problem, we
propose the decoding-history-based Adaptive Control of Attention (ACA) for the
NMT model. ACA learns to control the attention by keeping track of the decoding
history and the current information with a memory vector, so that the model can
take the translated contents and the current information into consideration.
Experiments on Chinese-English translation and the English-Vietnamese
translation have demonstrated that our model significantly outperforms the
strong baselines. The analysis shows that our model is capable of generating
translation with less repetition and higher accuracy. The code will be
available at https://github.com/lancopku
| cs.CL cs.AI cs.LG | attentionbased sequencetosequence model has proved successful in neural machine translation nmt however the attention without consideration of decoding history which includes the past information in the decoder and the attention mechanism often causes much repetition to address this problem we propose the decodinghistorybased adaptive control of attention aca for the nmt model aca learns to control the attention by keeping track of the decoding history and the current information with a memory vector so that the model can take the translated contents and the current information into consideration experiments on chineseenglish translation and the englishvietnamese translation have demonstrated that our model significantly outperforms the strong baselines the analysis shows that our model is capable of generating translation with less repetition and higher accuracy the code will be available at httpsgithubcomlancopku | [['attentionbased', 'sequencetosequence', 'model', 'has', 'proved', 'successful', 'in', 'neural', 'machine', 'translation', 'nmt', 'however', 'the', 'attention', 'without', 'consideration', 'of', 'decoding', 'history', 'which', 'includes', 'the', 'past', 'information', 'in', 'the', 'decoder', 'and', 'the', 'attention', 'mechanism', 'often', 'causes', 'much', 'repetition', 'to', 'address', 'this', 'problem', 'we', 'propose', 'the', 'decodinghistorybased', 'adaptive', 'control', 'of', 'attention', 'aca', 'for', 'the', 'nmt', 'model', 'aca', 'learns', 'to', 'control', 'the', 'attention', 'by', 'keeping', 'track', 'of', 'the', 'decoding', 'history', 'and', 'the', 'current', 'information', 'with', 'a', 'memory', 'vector', 'so', 'that', 'the', 'model', 'can', 'take', 'the', 'translated', 'contents', 'and', 'the', 'current', 'information', 'into', 'consideration', 'experiments', 'on', 'chineseenglish', 'translation', 'and', 'the', 'englishvietnamese', 'translation', 'have', 'demonstrated', 'that', 'our', 'model', 'significantly', 'outperforms', 'the', 'strong', 'baselines', 'the', 'analysis', 'shows', 'that', 'our', 'model', 'is', 'capable', 'of', 'generating', 'translation', 'with', 'less', 'repetition', 'and', 'higher', 'accuracy', 'the', 'code', 'will', 'be', 'available', 'at', 'httpsgithubcomlancopku']] | [-0.0702781168583897, 0.05129987251984858, -0.0477883726307482, 0.06563011536309205, -0.1152865216427017, -0.21698163571636542, 0.046593683466198854, 0.4430513262923341, -0.2763173137063859, -0.3113514989527175, 0.07632433557409968, -0.25116333166215554, -0.12589324486725673, 0.1847358101131249, -0.11053146394988289, 0.07478185654326808, 0.11884833179647103, 0.08652266310309642, -0.06969408197255689, -0.3084902293412597, 0.24997042762333876, 0.1187395489832852, 0.40149465397553286, 0.015181523325736634, 0.14776796056139574, -0.0030073672751314007, -0.04901027654977952, -0.06958042028418276, -0.054835178246264604, 0.14935482873534056, 0.2399805216373352, 0.20929583640463534, 0.3187484265145031, -0.409675142429478, -0.27784735321620246, 0.04292065971822012, 0.11738385203352664, 0.16339145990332327, -0.06462280914456642, -0.3033632951992331, 0.10088180342609121, -0.20378868285479257, 0.06486170872449293, -0.11072371965565253, -0.022027993589290418, -0.02516852064309205, -0.2588926926255226, -0.03272877727977175, 0.19130297188166878, 0.050765568143106066, -0.04792992968214094, -0.10334184634848498, -0.013437641682685353, 0.14204461830013315, 0.07786521446087136, 0.1305086023576223, 0.08565550140701816, -0.1566499005384685, -0.14597114213756868, 0.3904022212664131, -0.07911939039877325, -0.22948865311627742, 0.1584797267551039, -0.07774439484273898, -0.15097752039582701, 0.11042802932206541, 0.23265276552410796, 0.04671359401254449, -0.12807638393496745, 0.051652653984547214, -0.028016308060614392, 0.23133368957496714, 0.040962297811347526, 0.019985640814411454, 0.20002844800546882, 0.25614445744577097, -0.02650296593128587, 0.15680461230203946, -0.11242638762450952, -0.13261559727106942, -0.1667206565689412, -0.08570512467667868, -0.12326732121618988, -0.019694104213158425, -0.0479310857621158, -0.07854460957241827, 0.4374138273160497, 0.24587115310350782, 0.16723329488377203, 0.14575588224306557, 0.3282253217184916, 0.042557093876894214, 0.17632885015336797, 0.0960723648131534, 0.20200472787837498, 0.0060459784835984465, 0.13878574542104616, -0.23276519964565523, 0.13539485551882535, 0.04959771795256529] |
1,802.01813 | Eigenvalues of the linearized 2D Euler equations via Birman-Schwinger
and Lin's operators | We study spectral instability of steady states to the linearized 2D Euler
equations on the torus written in vorticity form via certain Birman-Schwinger
type operators $K_{\lambda}(\mu)$ and their associated 2-modified perturbation
determinants $\mathcal D(\lambda,\mu)$. Our main result characterizes the
existence of an unstable eigenvalue to the linearized vorticity operator
$L_{\rm vor}$ in terms of zeros of the 2-modified Fredholm determinant
$\mathcal D(\lambda,0)=\det_{2}(I-K_{\lambda}(0))$ associated with the Hilbert
Schmidt operator $K_{\lambda}(\mu)$ for $\mu=0$. As a consequence, we are also
able to provide an alternative proof to an instability theorem first proved by
Zhiwu Lin which relates existence of an unstable eigenvalue for $L_{\rm vor}$
to the number of negative eigenvalues of a limiting elliptic dispersion
operator $A_{0}$.
| math.AP math.SP | we study spectral instability of steady states to the linearized 2d euler equations on the torus written in vorticity form via certain birmanschwinger type operators k_lambdamu and their associated 2modified perturbation determinants mathcal dlambdamu our main result characterizes the existence of an unstable eigenvalue to the linearized vorticity operator l_rm vor in terms of zeros of the 2modified fredholm determinant mathcal dlambda0det_2ik_lambda0 associated with the hilbert schmidt operator k_lambdamu for mu0 as a consequence we are also able to provide an alternative proof to an instability theorem first proved by zhiwu lin which relates existence of an unstable eigenvalue for l_rm vor to the number of negative eigenvalues of a limiting elliptic dispersion operator a_0 | [['we', 'study', 'spectral', 'instability', 'of', 'steady', 'states', 'to', 'the', 'linearized', '2d', 'euler', 'equations', 'on', 'the', 'torus', 'written', 'in', 'vorticity', 'form', 'via', 'certain', 'birmanschwinger', 'type', 'operators', 'k_lambdamu', 'and', 'their', 'associated', '2modified', 'perturbation', 'determinants', 'mathcal', 'dlambdamu', 'our', 'main', 'result', 'characterizes', 'the', 'existence', 'of', 'an', 'unstable', 'eigenvalue', 'to', 'the', 'linearized', 'vorticity', 'operator', 'l_rm', 'vor', 'in', 'terms', 'of', 'zeros', 'of', 'the', '2modified', 'fredholm', 'determinant', 'mathcal', 'dlambda0det_2ik_lambda0', 'associated', 'with', 'the', 'hilbert', 'schmidt', 'operator', 'k_lambdamu', 'for', 'mu0', 'as', 'a', 'consequence', 'we', 'are', 'also', 'able', 'to', 'provide', 'an', 'alternative', 'proof', 'to', 'an', 'instability', 'theorem', 'first', 'proved', 'by', 'zhiwu', 'lin', 'which', 'relates', 'existence', 'of', 'an', 'unstable', 'eigenvalue', 'for', 'l_rm', 'vor', 'to', 'the', 'number', 'of', 'negative', 'eigenvalues', 'of', 'a', 'limiting', 'elliptic', 'dispersion', 'operator', 'a_0']] | [-0.18769736557650113, 0.06296993274476595, -0.07970818930438586, 0.09387497225543484, -0.07105933083429201, -0.10589392424195207, -0.059755236201453954, 0.23888350942537986, -0.27215758569738163, -0.16682402026240847, 0.11181861123311267, -0.28679947464635397, -0.13294994037797941, 0.16833703885952542, -0.06861847442009353, 0.08212823344677288, 0.041011304894969465, 0.03246730999905724, -0.07530471853429585, -0.16804018423135858, 0.4096162904523745, 0.018583919541145275, 0.20025640021568897, 0.08237441582605243, 0.06438753089085887, -0.022572212166518772, 0.015659128415531347, -0.07043947037475716, -0.17754807003620954, 0.08775821990846973, 0.2597409976213904, 0.05188311731659009, 0.272192043672216, -0.3806446828447016, -0.08633956750938003, 0.15493518926502606, 0.19030819135618263, -0.013301775176452273, 0.02489660621306809, -0.28585450471811263, 0.07698186829553119, -0.158680377989575, -0.2674679768762352, -0.08549641711163401, 0.053934739503477304, 0.016303858152241446, -0.3033456343359181, 0.13109560553831606, 0.10818444401125557, 0.03556638604537251, -0.10630631692973631, -0.11530215163449091, -0.09100867485228394, 0.03289248422619754, 0.05569050872873049, 0.002096543456510907, 0.037372471062034104, -0.09137340405972541, -0.05485484583186917, 0.2983501260574225, -0.10267996338942405, -0.23074321357333766, 0.09875744949178104, -0.1125368843536957, -0.09786635671376384, 0.11550946378182354, 0.09820698624077652, 0.14423322931647167, -0.06036509995880936, 0.1148189397556832, -0.090541588159145, 0.11783764700105946, 0.11376293291687034, 0.03101459052413702, 0.1104582360047581, 0.04334733669903861, 0.10721582429583318, 0.12674486800720583, 0.005725964430894237, -0.08717965500545688, -0.3561035610535847, -0.1996174042828248, -0.20482884989386158, 0.16097172650708153, -0.13011929366608196, -0.23942293669928663, 0.3813540655100951, 0.09607222360708485, 0.18588060267835058, 0.09029497456789873, 0.19420261383389256, 0.22770888940379205, 0.045361101887205484, 0.09905111987193647, 0.18658587056311912, 0.2504295911993332, 0.08659658979740925, -0.2618288829440384, -0.039182430711142455, 0.25838038177295986] |
1,802.01814 | Non-weight modules over algebras related to the Virasoro algebra | In this paper, we study a class of non-weight modules over two kinds of
algebras related to the Virasoro algebra, i.e., the loop-Virasoro algebras
$\mathfrak{L}$ and a class of Block type Lie algebras $\mathfrak{B(q)}$, where
$q$ is a nonzero complex number. We determine those modules whose restriction
to the Cartan subalgebra (modulo center) are free of rank one. We also provide
a sufficient and necessary condition for such modules to be simple, and
determine their isomorphism classes. Moreover, we obtain the simplicity of
modules over loop-Virasoro algebras by taking tensor products of some
irreducible modules mentioned above with irreducible highest weight modules or
Whittaker modules.
| math.RT math.RA | in this paper we study a class of nonweight modules over two kinds of algebras related to the virasoro algebra ie the loopvirasoro algebras mathfrakl and a class of block type lie algebras mathfrakbq where q is a nonzero complex number we determine those modules whose restriction to the cartan subalgebra modulo center are free of rank one we also provide a sufficient and necessary condition for such modules to be simple and determine their isomorphism classes moreover we obtain the simplicity of modules over loopvirasoro algebras by taking tensor products of some irreducible modules mentioned above with irreducible highest weight modules or whittaker modules | [['in', 'this', 'paper', 'we', 'study', 'a', 'class', 'of', 'nonweight', 'modules', 'over', 'two', 'kinds', 'of', 'algebras', 'related', 'to', 'the', 'virasoro', 'algebra', 'ie', 'the', 'loopvirasoro', 'algebras', 'mathfrakl', 'and', 'a', 'class', 'of', 'block', 'type', 'lie', 'algebras', 'mathfrakbq', 'where', 'q', 'is', 'a', 'nonzero', 'complex', 'number', 'we', 'determine', 'those', 'modules', 'whose', 'restriction', 'to', 'the', 'cartan', 'subalgebra', 'modulo', 'center', 'are', 'free', 'of', 'rank', 'one', 'we', 'also', 'provide', 'a', 'sufficient', 'and', 'necessary', 'condition', 'for', 'such', 'modules', 'to', 'be', 'simple', 'and', 'determine', 'their', 'isomorphism', 'classes', 'moreover', 'we', 'obtain', 'the', 'simplicity', 'of', 'modules', 'over', 'loopvirasoro', 'algebras', 'by', 'taking', 'tensor', 'products', 'of', 'some', 'irreducible', 'modules', 'mentioned', 'above', 'with', 'irreducible', 'highest', 'weight', 'modules', 'or', 'whittaker', 'modules']] | [-0.1724677151785447, 0.07015947385046345, 0.0011039658476455281, 0.0371262294983563, -0.13201342402429034, -0.1755895411524062, -0.06757691455109474, 0.3753688458998043, -0.3932163645513356, -0.1920156915528843, 0.16550164955305474, -0.185718205345508, -0.12948179733043966, 0.1843167781323875, -0.10881524086513449, -0.060123154580091626, 0.09978575062772367, 0.16236571284137497, -0.12735851031566897, -0.2977759293638743, 0.45684263001805026, -0.0046253424146785755, 0.22240625243956366, 0.007601630001982602, 0.1609563394718302, 0.027008548146113753, -0.011454362272231195, -0.03132385530849346, -0.1540100530255586, 0.13722412356470998, 0.3592216077242763, 0.06307976483367383, 0.19897823067059597, -0.3373039615286801, -0.036372294049495116, 0.2727832073489061, 0.13973294667308578, 0.012158533240346095, 0.02896229937547245, -0.2067381446607984, 0.13679070128217483, -0.2986902611580892, -0.10767884855606379, -0.07586845485583091, 0.05150033868603014, 0.0063245624702316355, -0.254106820650542, 0.0021028977238389556, 0.08745218626707076, 0.13487090989320466, -0.15787890819886413, -0.14379733824171126, -0.05295545698698753, 0.09135852059430014, -0.097699507894084, -0.07201788994223954, 0.12184626795799257, -0.1164863595555429, -0.15994865491162413, 0.3162811778915616, 0.04602267881497168, -0.2454641220303109, 0.17935728397703946, -0.18193033259236613, -0.18471379389610285, 0.0966215410791427, 0.042839368585891165, 0.0812767980435008, -0.08034624425300325, 0.16131797390642952, -0.11796817612440254, -0.01919853386397545, 0.11172292927333799, 0.02485626400448382, 0.1530391597703923, 0.07508147962821218, 0.035362758561789706, 0.14868802871765532, 0.07027629226929723, 0.05031698119217673, -0.39020096700495255, -0.23056845316358915, -0.06600159971276298, 0.10577094546393849, -0.08767887209321018, -0.16741941364195484, 0.5028280498495755, 0.1053866325573136, 0.19666679749822763, 0.1589145243857414, 0.15799631756873658, 0.05451911451158454, 0.19475478236339627, 0.05030621695242679, 0.1064989671098234, 0.29268981800907146, -0.05727419689915573, -0.07991087840547642, -0.07210372807541997, 0.21310755760462669] |
1,802.01815 | Effects of Jamming Attacks on Wireless Networked Control Systems Under
Disturbance | Jamming attacks on wireless networked control systems are investigated for
the scenarios where the system dynamics face exogenous disturbance. In
particular, the control input packets are assumed to be transmitted from a
controller to a remotely located linear plant over an insecure wireless
communication channel that is subject to jamming attacks. The time-varying
likelihood of transmission failures on this channel depends on the power of the
jamming interference signal emitted by an attacker. We show that jamming
attacks can prevent stability when the system faces disturbance, even if the
attacked system without disturbance is stable. We also show that stability
under jamming and disturbance can be achieved if the average jamming
interference power is restricted in a certain way that we characterize in the
paper. We illustrate our results on an example networked control system with a
fading wireless channel, where the outage probability is affected by jamming
attacks.
| cs.SY | jamming attacks on wireless networked control systems are investigated for the scenarios where the system dynamics face exogenous disturbance in particular the control input packets are assumed to be transmitted from a controller to a remotely located linear plant over an insecure wireless communication channel that is subject to jamming attacks the timevarying likelihood of transmission failures on this channel depends on the power of the jamming interference signal emitted by an attacker we show that jamming attacks can prevent stability when the system faces disturbance even if the attacked system without disturbance is stable we also show that stability under jamming and disturbance can be achieved if the average jamming interference power is restricted in a certain way that we characterize in the paper we illustrate our results on an example networked control system with a fading wireless channel where the outage probability is affected by jamming attacks | [['jamming', 'attacks', 'on', 'wireless', 'networked', 'control', 'systems', 'are', 'investigated', 'for', 'the', 'scenarios', 'where', 'the', 'system', 'dynamics', 'face', 'exogenous', 'disturbance', 'in', 'particular', 'the', 'control', 'input', 'packets', 'are', 'assumed', 'to', 'be', 'transmitted', 'from', 'a', 'controller', 'to', 'a', 'remotely', 'located', 'linear', 'plant', 'over', 'an', 'insecure', 'wireless', 'communication', 'channel', 'that', 'is', 'subject', 'to', 'jamming', 'attacks', 'the', 'timevarying', 'likelihood', 'of', 'transmission', 'failures', 'on', 'this', 'channel', 'depends', 'on', 'the', 'power', 'of', 'the', 'jamming', 'interference', 'signal', 'emitted', 'by', 'an', 'attacker', 'we', 'show', 'that', 'jamming', 'attacks', 'can', 'prevent', 'stability', 'when', 'the', 'system', 'faces', 'disturbance', 'even', 'if', 'the', 'attacked', 'system', 'without', 'disturbance', 'is', 'stable', 'we', 'also', 'show', 'that', 'stability', 'under', 'jamming', 'and', 'disturbance', 'can', 'be', 'achieved', 'if', 'the', 'average', 'jamming', 'interference', 'power', 'is', 'restricted', 'in', 'a', 'certain', 'way', 'that', 'we', 'characterize', 'in', 'the', 'paper', 'we', 'illustrate', 'our', 'results', 'on', 'an', 'example', 'networked', 'control', 'system', 'with', 'a', 'fading', 'wireless', 'channel', 'where', 'the', 'outage', 'probability', 'is', 'affected', 'by', 'jamming', 'attacks']] | [-0.299519229464658, 0.09651043751046934, -0.07037753790254461, -0.013146669193110022, -0.00026771418387757853, -0.27318238161954306, 0.0881649553252309, 0.34578490242262017, -0.3067693053525966, -0.20748954715719758, 0.14007404792331934, -0.2855733610570881, -0.24843843886941272, 0.16166684389951946, -0.1944060336998445, 0.11520284194274237, 0.005725916837976508, 0.07266977005138144, 0.04044938477024986, -0.2682542425264673, 0.3205165590172096, 0.09362496095303222, 0.30729358066060897, 0.027638946189123187, 0.0663043724579249, 0.035345357762268374, 0.059090829585622624, -0.006623928516403141, -0.08913784713000715, -0.02432171691634111, 0.31003083263667636, 0.1652362703614487, 0.2804325926023842, -0.4269133801103238, -0.28629980801960964, 0.14807206261653028, 0.14140220492728203, 0.1038356276897826, -0.036857511782581176, -0.35996563896386813, 0.15818072617016482, -0.251753571793287, -0.030552350100279853, 0.0026157673420197014, -0.052609857068640874, 0.06306015135682869, -0.3240432347414778, 0.01154201194130653, 0.032322287993918127, 0.05730557886121057, -0.05349064412395526, 0.00808592859324343, -0.013556243081408358, 0.1583301541639645, 0.01787541712628015, -0.07081887210350508, 0.24186013702103157, -0.1385111905518769, -0.0919507943662571, 0.3606395725185839, 0.03974044952079054, -0.23267900839060446, 0.14695461777206073, -0.07033587762798439, -0.06472840518440626, 0.18990201538666182, 0.2939191990463226, 0.02837112575031867, -0.1644238313436766, -0.005694064462085523, -0.022032594920804838, 0.24234022502943672, 0.05578788527718827, 0.05964376733344573, 0.1582220981679638, 0.15944051122192868, 0.19788656679713387, 0.17216055164888702, -0.1042184517750104, -0.10465373205577318, -0.25302971654490336, -0.05470363557613736, -0.23190538184529783, 0.04721309744359163, -0.06188920735615546, -0.05678267331618891, 0.33573404905205007, 0.17541118314522539, 0.13333650848096948, 0.10408849860604028, 0.41918525313520993, 0.09257454305477815, -0.03063628462537023, 0.13578439944880022, 0.2708849715468967, 0.07279975130144607, 0.0900531266995662, -0.2060332514092501, 0.17310620294946352, -0.07630653900481861] |
1,802.01816 | Strong photon antibunching in weakly nonlinear two-dimensional
exciton-polaritons | A deterministic and scalable array of single photon nonlinearities in the
solid state holds great potential for both fundamental physics and
technological applications, but its realization has proved extremely
challenging. Despite significant advances, leading candidates such as quantum
dots and group III-V quantum wells have yet to overcome their respective
bottlenecks in random positioning and weak nonlinearity. Here we consider a
hybrid light-matter platform, marrying an atomically thin two-dimensional
material to a photonic crystal cavity, and analyze its second-order coherence
function. We identify several mechanisms for photon antibunching under
different system parameters, including one characterized by large dissipation
and weak nonlinearity. Finally, we show that by patterning the two-dimensional
material into different sizes, we can drive our system dynamics from a coherent
state into a regime of strong antibunching with $g^{(2)}(0) \sim 10^{-3}$,
opening a possible route to building scalable, on-chip quantum simulators.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.optics | a deterministic and scalable array of single photon nonlinearities in the solid state holds great potential for both fundamental physics and technological applications but its realization has proved extremely challenging despite significant advances leading candidates such as quantum dots and group iiiv quantum wells have yet to overcome their respective bottlenecks in random positioning and weak nonlinearity here we consider a hybrid lightmatter platform marrying an atomically thin twodimensional material to a photonic crystal cavity and analyze its secondorder coherence function we identify several mechanisms for photon antibunching under different system parameters including one characterized by large dissipation and weak nonlinearity finally we show that by patterning the twodimensional material into different sizes we can drive our system dynamics from a coherent state into a regime of strong antibunching with g20 sim 103 opening a possible route to building scalable onchip quantum simulators | [['a', 'deterministic', 'and', 'scalable', 'array', 'of', 'single', 'photon', 'nonlinearities', 'in', 'the', 'solid', 'state', 'holds', 'great', 'potential', 'for', 'both', 'fundamental', 'physics', 'and', 'technological', 'applications', 'but', 'its', 'realization', 'has', 'proved', 'extremely', 'challenging', 'despite', 'significant', 'advances', 'leading', 'candidates', 'such', 'as', 'quantum', 'dots', 'and', 'group', 'iiiv', 'quantum', 'wells', 'have', 'yet', 'to', 'overcome', 'their', 'respective', 'bottlenecks', 'in', 'random', 'positioning', 'and', 'weak', 'nonlinearity', 'here', 'we', 'consider', 'a', 'hybrid', 'lightmatter', 'platform', 'marrying', 'an', 'atomically', 'thin', 'twodimensional', 'material', 'to', 'a', 'photonic', 'crystal', 'cavity', 'and', 'analyze', 'its', 'secondorder', 'coherence', 'function', 'we', 'identify', 'several', 'mechanisms', 'for', 'photon', 'antibunching', 'under', 'different', 'system', 'parameters', 'including', 'one', 'characterized', 'by', 'large', 'dissipation', 'and', 'weak', 'nonlinearity', 'finally', 'we', 'show', 'that', 'by', 'patterning', 'the', 'twodimensional', 'material', 'into', 'different', 'sizes', 'we', 'can', 'drive', 'our', 'system', 'dynamics', 'from', 'a', 'coherent', 'state', 'into', 'a', 'regime', 'of', 'strong', 'antibunching', 'with', 'g20', 'sim', '103', 'opening', 'a', 'possible', 'route', 'to', 'building', 'scalable', 'onchip', 'quantum', 'simulators']] | [-0.16792443372354798, 0.16007447762219837, -0.0330654303258337, 0.0017571272452645186, -0.031027352359224034, -0.23504759632441755, 0.05381651684215253, 0.4349574675015011, -0.28303240091129617, -0.2845011587047923, 0.04695892681520745, -0.2560373434627598, -0.14344172760228777, 0.2777628585357558, -0.008381104817242732, 0.12419537015151806, 0.03453900493759584, -0.0994820129158874, -0.03432894889729332, -0.1750727089429665, 0.24092396770740723, 0.0004401624510455486, 0.32952548399359194, 0.07630344999138383, 0.13885245300256288, -0.029194620949170597, 0.09518421465088125, -0.008022640579399633, -0.1213959104333572, 0.08866432127322989, 0.2574573455677999, 0.0015312843610877757, 0.32887059947723274, -0.46730975629566435, -0.23725294728984836, 0.0720924783019362, 0.14848681476143827, 0.17337000801006552, -0.12728596502146522, -0.3149278277687572, 0.04250329949484383, -0.16559162153699597, -0.12783908506878164, -0.1163131789356418, 0.015711173480311473, -0.0031935201365162025, -0.21222693305519585, 0.029935196631464298, 0.041928548404907846, 0.006208059047446489, 0.006189190023871777, -0.0444172047895959, 0.020645969029568084, 0.10498115169275161, -0.06017113056675355, -0.0080037737245691, 0.14285542994210093, -0.18869279836910172, -0.15700699856921613, 0.3996610045823809, -0.050616790910521715, -0.13275529107183115, 0.21431099594134342, -0.14086491969199136, -0.091556586136299, 0.11060520949597646, 0.19369967002380914, 0.0678713662721627, -0.1466283920712336, 0.07248794222071481, 0.034356434640663486, 0.20697037526569168, 0.045014261681638607, 0.18576756167596767, 0.24834349832230515, 0.21577563078201317, 0.048623409182471516, 0.15888115761791832, -0.0751518901759902, -0.09131369198928099, -0.2354358449478864, -0.18554780415505157, -0.2078957334486442, 0.11381063179415814, -0.10137054791052864, -0.17461340794978025, 0.369551366966843, 0.14639148201428717, 0.138443861567005, -0.01810308752281891, 0.2860317928911923, 0.11115741951251076, 0.07552769522091465, 0.008663757821427776, 0.2737815184811768, 0.1484723474840158, 0.07924103536457881, -0.21509092565140706, 0.04236081158628335, -0.04633036996009988] |
1,802.01817 | Byte-Level Recursive Convolutional Auto-Encoder for Text | This article proposes to auto-encode text at byte-level using convolutional
networks with a recursive architecture. The motivation is to explore whether it
is possible to have scalable and homogeneous text generation at byte-level in a
non-sequential fashion through the simple task of auto-encoding. We show that
non-sequential text generation from a fixed-length representation is not only
possible, but also achieved much better auto-encoding results than recurrent
networks. The proposed model is a multi-stage deep convolutional
encoder-decoder framework using residual connections, containing up to 160
parameterized layers. Each encoder or decoder contains a shared group of
modules that consists of either pooling or upsampling layers, making the
network recursive in terms of abstraction levels in representation. Results for
6 large-scale paragraph datasets are reported, in 3 languages including Arabic,
Chinese and English. Analyses are conducted to study several properties of the
proposed model.
| cs.CL | this article proposes to autoencode text at bytelevel using convolutional networks with a recursive architecture the motivation is to explore whether it is possible to have scalable and homogeneous text generation at bytelevel in a nonsequential fashion through the simple task of autoencoding we show that nonsequential text generation from a fixedlength representation is not only possible but also achieved much better autoencoding results than recurrent networks the proposed model is a multistage deep convolutional encoderdecoder framework using residual connections containing up to 160 parameterized layers each encoder or decoder contains a shared group of modules that consists of either pooling or upsampling layers making the network recursive in terms of abstraction levels in representation results for 6 largescale paragraph datasets are reported in 3 languages including arabic chinese and english analyses are conducted to study several properties of the proposed model | [['this', 'article', 'proposes', 'to', 'autoencode', 'text', 'at', 'bytelevel', 'using', 'convolutional', 'networks', 'with', 'a', 'recursive', 'architecture', 'the', 'motivation', 'is', 'to', 'explore', 'whether', 'it', 'is', 'possible', 'to', 'have', 'scalable', 'and', 'homogeneous', 'text', 'generation', 'at', 'bytelevel', 'in', 'a', 'nonsequential', 'fashion', 'through', 'the', 'simple', 'task', 'of', 'autoencoding', 'we', 'show', 'that', 'nonsequential', 'text', 'generation', 'from', 'a', 'fixedlength', 'representation', 'is', 'not', 'only', 'possible', 'but', 'also', 'achieved', 'much', 'better', 'autoencoding', 'results', 'than', 'recurrent', 'networks', 'the', 'proposed', 'model', 'is', 'a', 'multistage', 'deep', 'convolutional', 'encoderdecoder', 'framework', 'using', 'residual', 'connections', 'containing', 'up', 'to', '160', 'parameterized', 'layers', 'each', 'encoder', 'or', 'decoder', 'contains', 'a', 'shared', 'group', 'of', 'modules', 'that', 'consists', 'of', 'either', 'pooling', 'or', 'upsampling', 'layers', 'making', 'the', 'network', 'recursive', 'in', 'terms', 'of', 'abstraction', 'levels', 'in', 'representation', 'results', 'for', '6', 'largescale', 'paragraph', 'datasets', 'are', 'reported', 'in', '3', 'languages', 'including', 'arabic', 'chinese', 'and', 'english', 'analyses', 'are', 'conducted', 'to', 'study', 'several', 'properties', 'of', 'the', 'proposed', 'model']] | [-0.06661940508187604, 0.012494500425995104, -0.024555136589005485, 0.06919360225020028, -0.09985602235349393, -0.19877493949147912, 0.04020043519902712, 0.4780961592275072, -0.3065879760887211, -0.2900321355325655, 0.051618719217695404, -0.277323922012444, -0.20306941863390435, 0.16014896966779316, -0.07480715413276158, 0.03293239274783663, 0.14256256160450917, 0.04742240935603393, -0.05946527044436383, -0.2942863091855953, 0.3033294057158727, 0.05172054327079128, 0.33677002883673657, -0.016182419575119972, 0.16283400172472628, -0.06375645011873313, -0.04518391500050071, -0.05916965743576006, -0.018349426028398227, 0.18426041867138004, 0.3116505990644366, 0.17392904396024597, 0.2968686489080092, -0.42276840264790916, -0.22553186906947637, 0.047506147136413296, 0.15017299555425703, 0.11244577772902656, 0.0013812051194024757, -0.300952964485295, 0.14033241045962966, -0.20180056200028254, 0.07878174480996882, -0.11036624519124096, -0.025981358659099524, -0.04173936107782909, -0.2926772641588632, 0.016978273599229845, 0.11584518465187243, 0.06715490742140567, -0.01586401787206111, -0.12313905774786228, 0.020805049953657583, 0.12481783955148093, -0.025859297929548095, 0.08169495432988517, 0.07330618213868739, -0.1678655485187667, -0.1657182228239909, 0.35729912970162614, -0.07188931841596008, -0.2072184110047217, 0.19079449846947066, -0.03680225208231156, -0.17763842460305862, 0.09048007790353411, 0.2073628542539795, 0.10010650962866632, -0.1745777645190968, 0.011338632743195695, -0.07380841244799151, 0.22052495732647695, 0.0960076458909562, -0.009534628956060541, 0.1581405654916881, 0.317933577053826, -0.014671914881213345, 0.174740350342841, -0.12332118399651118, -0.06899961723181956, -0.2191185038635166, -0.10508642449784814, -0.1532633591174397, -0.028580028148803328, -0.06383340651621143, -0.14711346340851045, 0.4327587101306819, 0.18237213583820513, 0.17703005681994935, 0.13961261706295566, 0.3131411477651211, 0.0022249570850965002, 0.1567587808272998, 0.1156030586673911, 0.12513882682894842, 0.04923516058717185, 0.10301436265786244, -0.06871637519822836, 0.08196436242124805, 0.10750202263679198] |
1,802.01818 | Fog Computing in IoT Aided Smart Grid Transition- Requirements,
Prospects, Status Quos and Challenges | Due to unfolded developments in both the IT sectors viz. Intelligent
Transportation and Information Technology contemporary Smart Grid (SG) systems
are leveraged with smart devices and entities. Such infrastructures when
bestowed with the Internet of Things (IoT) and sensor network make a universe
of objects active and online. The traditional cloud deployment succumbs to meet
the analytics and computational exigencies decentralized, dynamic cum
resource-time critical SG ecosystems. This paper synoptically inspects to what
extent the cloud computing utilities can satisfy the mission-critical
requirements of SG ecosystems and which subdomains and services call for fog
based computing archetypes. The objective of this work is to comprehend the
applicability of fog computing algorithms to interplay with the core centered
cloud computing support, thus enabling to come up with a new breed of real-time
and latency free SG services. The work also highlights the opportunities
brought by fog based SG deployments. Correspondingly, we also highlight the
challenges and research thrusts elucidated towards the viability of fog
computing for successful SG Transition.
| cs.DC cs.ET | due to unfolded developments in both the it sectors viz intelligent transportation and information technology contemporary smart grid sg systems are leveraged with smart devices and entities such infrastructures when bestowed with the internet of things iot and sensor network make a universe of objects active and online the traditional cloud deployment succumbs to meet the analytics and computational exigencies decentralized dynamic cum resourcetime critical sg ecosystems this paper synoptically inspects to what extent the cloud computing utilities can satisfy the missioncritical requirements of sg ecosystems and which subdomains and services call for fog based computing archetypes the objective of this work is to comprehend the applicability of fog computing algorithms to interplay with the core centered cloud computing support thus enabling to come up with a new breed of realtime and latency free sg services the work also highlights the opportunities brought by fog based sg deployments correspondingly we also highlight the challenges and research thrusts elucidated towards the viability of fog computing for successful sg transition | [['due', 'to', 'unfolded', 'developments', 'in', 'both', 'the', 'it', 'sectors', 'viz', 'intelligent', 'transportation', 'and', 'information', 'technology', 'contemporary', 'smart', 'grid', 'sg', 'systems', 'are', 'leveraged', 'with', 'smart', 'devices', 'and', 'entities', 'such', 'infrastructures', 'when', 'bestowed', 'with', 'the', 'internet', 'of', 'things', 'iot', 'and', 'sensor', 'network', 'make', 'a', 'universe', 'of', 'objects', 'active', 'and', 'online', 'the', 'traditional', 'cloud', 'deployment', 'succumbs', 'to', 'meet', 'the', 'analytics', 'and', 'computational', 'exigencies', 'decentralized', 'dynamic', 'cum', 'resourcetime', 'critical', 'sg', 'ecosystems', 'this', 'paper', 'synoptically', 'inspects', 'to', 'what', 'extent', 'the', 'cloud', 'computing', 'utilities', 'can', 'satisfy', 'the', 'missioncritical', 'requirements', 'of', 'sg', 'ecosystems', 'and', 'which', 'subdomains', 'and', 'services', 'call', 'for', 'fog', 'based', 'computing', 'archetypes', 'the', 'objective', 'of', 'this', 'work', 'is', 'to', 'comprehend', 'the', 'applicability', 'of', 'fog', 'computing', 'algorithms', 'to', 'interplay', 'with', 'the', 'core', 'centered', 'cloud', 'computing', 'support', 'thus', 'enabling', 'to', 'come', 'up', 'with', 'a', 'new', 'breed', 'of', 'realtime', 'and', 'latency', 'free', 'sg', 'services', 'the', 'work', 'also', 'highlights', 'the', 'opportunities', 'brought', 'by', 'fog', 'based', 'sg', 'deployments', 'correspondingly', 'we', 'also', 'highlight', 'the', 'challenges', 'and', 'research', 'thrusts', 'elucidated', 'towards', 'the', 'viability', 'of', 'fog', 'computing', 'for', 'successful', 'sg', 'transition']] | [-0.1738092783213911, 0.05548390782993108, -0.03583890628446072, 0.01640524781757999, -0.11990178358032853, -0.15390439083364732, 0.08516773756824902, 0.3471804202623487, -0.27828613778682215, -0.33099173823745176, 0.13785974825188674, -0.2693390240167786, -0.18829053449918498, 0.1701550405199952, -0.13062564202289673, 0.07393090172620591, 0.03632918738308335, -0.03569744217689121, 0.0017252398128858293, -0.26616634652130083, 0.31591372863489936, 0.06274727032335843, 0.3601887694777486, 0.1052768217611634, 0.03127130083837351, -0.06963297616185699, -0.04645914405104732, -0.009372674114862737, -0.10305819258896891, 0.2162427443496515, 0.3376462800061598, 0.21861056768067716, 0.33688003887717954, -0.4812556743443369, -0.18723459780344484, 0.09839651997418639, 0.17838034696784985, -0.011279884634140746, -0.07215625497172336, -0.3075626404610223, 0.1053258750596764, -0.24180711418652384, -0.15030271179469032, -0.062285452579220614, 0.021285316517540325, 0.07305442933606619, -0.22043522310437647, -0.05971668906890491, -0.03341237891292545, 0.042216842266323856, -0.0285657083544731, -0.10842799368554247, -0.011131078855296274, 0.17881519972534243, -0.0022149731636515813, -0.008323045269708835, 0.19209716871693105, -0.16646957604080706, -0.13257049450450048, 0.4367662098281041, 0.07496361506818432, -0.09171595640792818, 0.18019003132748568, -0.030393676496317197, -0.17649953358689557, 0.038029188587202015, 0.21900422712557943, -0.0125509443564597, -0.1900754905391023, 0.06087006421022195, 0.07642794712474514, 0.10275616008275283, 0.021268565472616942, 0.06325764652943897, 0.2491677174564942, 0.24192745140251776, 0.15463967338583606, 0.0858811585464052, -0.03797243113356258, -0.1620017527254064, -0.1502123691161124, -0.18680341155296135, -0.17603771374309937, -0.020189726767046546, -0.10466725365487053, -0.15262176390335766, 0.3537669986553356, 0.2319911680836788, 0.10996219072167478, 0.0527117813088301, 0.38484939645200655, 0.04046062364094489, 0.13229971218151515, 0.16301938726198664, 0.129116120214245, 0.035306306783382466, 0.2732473827067562, -0.15780326384426413, 0.06049691758559136, -0.008583694375761433] |
1,802.01819 | SDSS-IV MaNGA: Global stellar population and gradients for about 2000
early-type and spiral galaxies on the mass-size plane | We perform full spectrum fitting stellar population analysis and Jeans
Anisotropic modelling (JAM) of the stellar kinematics for about 2000 early-type
galaxies (ETGs) and spiral galaxies from the MaNGA DR14 sample. Galaxies with
different morphologies are found to be located on a remarkably tight mass plane
which is close to the prediction of the virial theorem, extending previous
results for ETGs. By examining an inclined projection (`the mass-size' plane),
we find that spiral and early-type galaxies occupy different regions on the
plane, and their stellar population properties (i.e. age, metallicity and
stellar mass-to-light ratio) vary systematically along roughly the direction of
velocity dispersion, which is a proxy for the bulge fraction. Galaxies with
higher velocity dispersions have typically older ages, larger stellar
mass-to-light ratios and are more metal rich, which indicates that galaxies
increase their bulge fractions as their stellar populations age and become
enriched chemically. The age and stellar mass-to-light ratio gradients for
low-mass galaxies in our sample tend to be positive ($\rm centre<outer$), while
the gradients for most massive galaxies are negative. The metallicity gradients
show a clear peak around velocity dispersion $\log_{10} \sigma_{\rm e}\approx
2.0$, which corresponds to the critical mass $\sim 3\times 10^{10}M_{\odot}$ of
the break in the mass-size relation. Spiral galaxies with large mass and size
have the steepest gradients, while the most massive ETGs, especially above the
critical mass $M_{\rm crit}\ge 2\times 10^{11} M_{\odot}$, where slow rotator
ETGs start dominating, have much flatter gradients. This may be due to
differences in their evolution histories, e.g. mergers.
| astro-ph.GA | we perform full spectrum fitting stellar population analysis and jeans anisotropic modelling jam of the stellar kinematics for about 2000 earlytype galaxies etgs and spiral galaxies from the manga dr14 sample galaxies with different morphologies are found to be located on a remarkably tight mass plane which is close to the prediction of the virial theorem extending previous results for etgs by examining an inclined projection the masssize plane we find that spiral and earlytype galaxies occupy different regions on the plane and their stellar population properties ie age metallicity and stellar masstolight ratio vary systematically along roughly the direction of velocity dispersion which is a proxy for the bulge fraction galaxies with higher velocity dispersions have typically older ages larger stellar masstolight ratios and are more metal rich which indicates that galaxies increase their bulge fractions as their stellar populations age and become enriched chemically the age and stellar masstolight ratio gradients for lowmass galaxies in our sample tend to be positive rm centreouter while the gradients for most massive galaxies are negative the metallicity gradients show a clear peak around velocity dispersion log_10 sigma_rm eapprox 20 which corresponds to the critical mass sim 3times 1010m_odot of the break in the masssize relation spiral galaxies with large mass and size have the steepest gradients while the most massive etgs especially above the critical mass m_rm critge 2times 1011 m_odot where slow rotator etgs start dominating have much flatter gradients this may be due to differences in their evolution histories eg mergers | [['we', 'perform', 'full', 'spectrum', 'fitting', 'stellar', 'population', 'analysis', 'and', 'jeans', 'anisotropic', 'modelling', 'jam', 'of', 'the', 'stellar', 'kinematics', 'for', 'about', '2000', 'earlytype', 'galaxies', 'etgs', 'and', 'spiral', 'galaxies', 'from', 'the', 'manga', 'dr14', 'sample', 'galaxies', 'with', 'different', 'morphologies', 'are', 'found', 'to', 'be', 'located', 'on', 'a', 'remarkably', 'tight', 'mass', 'plane', 'which', 'is', 'close', 'to', 'the', 'prediction', 'of', 'the', 'virial', 'theorem', 'extending', 'previous', 'results', 'for', 'etgs', 'by', 'examining', 'an', 'inclined', 'projection', 'the', 'masssize', 'plane', 'we', 'find', 'that', 'spiral', 'and', 'earlytype', 'galaxies', 'occupy', 'different', 'regions', 'on', 'the', 'plane', 'and', 'their', 'stellar', 'population', 'properties', 'ie', 'age', 'metallicity', 'and', 'stellar', 'masstolight', 'ratio', 'vary', 'systematically', 'along', 'roughly', 'the', 'direction', 'of', 'velocity', 'dispersion', 'which', 'is', 'a', 'proxy', 'for', 'the', 'bulge', 'fraction', 'galaxies', 'with', 'higher', 'velocity', 'dispersions', 'have', 'typically', 'older', 'ages', 'larger', 'stellar', 'masstolight', 'ratios', 'and', 'are', 'more', 'metal', 'rich', 'which', 'indicates', 'that', 'galaxies', 'increase', 'their', 'bulge', 'fractions', 'as', 'their', 'stellar', 'populations', 'age', 'and', 'become', 'enriched', 'chemically', 'the', 'age', 'and', 'stellar', 'masstolight', 'ratio', 'gradients', 'for', 'lowmass', 'galaxies', 'in', 'our', 'sample', 'tend', 'to', 'be', 'positive', 'rm', 'centreouter', 'while', 'the', 'gradients', 'for', 'most', 'massive', 'galaxies', 'are', 'negative', 'the', 'metallicity', 'gradients', 'show', 'a', 'clear', 'peak', 'around', 'velocity', 'dispersion', 'log_10', 'sigma_rm', 'eapprox', '20', 'which', 'corresponds', 'to', 'the', 'critical', 'mass', 'sim', '3times', '1010m_odot', 'of', 'the', 'break', 'in', 'the', 'masssize', 'relation', 'spiral', 'galaxies', 'with', 'large', 'mass', 'and', 'size', 'have', 'the', 'steepest', 'gradients', 'while', 'the', 'most', 'massive', 'etgs', 'especially', 'above', 'the', 'critical', 'mass', 'm_rm', 'critge', '2times', '1011', 'm_odot', 'where', 'slow', 'rotator', 'etgs', 'start', 'dominating', 'have', 'much', 'flatter', 'gradients', 'this', 'may', 'be', 'due', 'to', 'differences', 'in', 'their', 'evolution', 'histories', 'eg', 'mergers']] | [-0.05440515153249726, 0.13954210124938982, -0.07811982074473053, 0.1485781643600203, -0.10139228679519147, -0.024274019928649068, 0.012948065459728242, 0.4528306491076946, -0.08519456278334837, -0.39535528625547883, -0.0037475067266495897, -0.28280633153952656, 0.014928825924172998, 0.19463057666271924, -0.024178240859415383, -0.03849048467632383, 0.020515218968736006, -0.1365168776558712, -0.0884002368170768, -0.30164649365330115, 0.31095403258036824, 0.020853298960253595, 0.1696372663434595, -0.10763839473202824, 0.02128715805290267, -0.13648975223861634, -0.05176138820964843, -0.019560160015709697, -0.18856151598406723, -0.005185587253421545, 0.24409680822584778, 0.10587019017525018, 0.23074633797816932, -0.310501123628288, -0.14546945571200923, 0.08479342121258378, 0.2905290137689444, 0.036669108083937314, -0.12054940477275522, -0.23957943053357303, 0.08603688692301512, -0.16555676304828376, -0.19218261268560308, 0.11729963404289447, 0.07626592852640897, 0.02972042703209445, -0.2022824270874262, 0.2769350872561336, 0.01349172092648223, 0.1497491053417325, -0.0992091655395925, -0.14468980428949, -0.15736268868576736, 0.06499433469958603, 0.02840063258772716, 0.1087279623686336, 0.27559956192970275, -0.15074102223664523, 0.08688872447842733, 0.4179049657061696, -0.03499538248358294, -0.023795264300890268, 0.24841972992569208, -0.22097345544281416, -0.15385799257969485, 0.07866868358489591, 0.21190881451126187, 0.09825645916210488, -0.14667710718978197, -0.02251177066960372, -0.023842621280811726, 0.25686526778154073, 0.03876390148885548, 0.03943231584969908, 0.3632264292482287, 0.04775673834327608, 0.07816367897577584, -0.006372508787550032, -0.1705176178193651, -0.05807066239521373, -0.13022273598005996, -0.1060127566982992, -0.06512535345787182, 0.08889033274399116, -0.23422979588381712, -0.11228403796406929, 0.29705439327657224, 0.0903938683597371, 0.2933236479312181, 0.1783629938311642, 0.2928613259270787, 0.1238264910876751, 0.19108820423856376, 0.16076005752873607, 0.31086062756180766, 0.23353282210882753, 0.06076034609926864, -0.2663236574716866, 0.0799951161518693, -0.03083274636021815] |
1,802.0182 | Fuzzification of Strongly Compact and Locally Strongly Compact Spaces | In this paper, we study some characterizations of fuzzifying strong
compactness including nets and pre-subbases properties. We also introduve new
characterizations of locally strong compactness in fuzzifying topology and
mappings.
| math.LO | in this paper we study some characterizations of fuzzifying strong compactness including nets and presubbases properties we also introduve new characterizations of locally strong compactness in fuzzifying topology and mappings | [['in', 'this', 'paper', 'we', 'study', 'some', 'characterizations', 'of', 'fuzzifying', 'strong', 'compactness', 'including', 'nets', 'and', 'presubbases', 'properties', 'we', 'also', 'introduve', 'new', 'characterizations', 'of', 'locally', 'strong', 'compactness', 'in', 'fuzzifying', 'topology', 'and', 'mappings']] | [-0.15254595090768167, 0.026192311762965152, -0.024264153276037956, 0.13281478587720943, -0.09917628272835698, -0.028867958446166346, 0.06041935642133467, 0.4543067336614643, -0.32472955036376205, -0.1917353654280305, 0.1361801781209319, -0.2688755357105817, -0.19466804832752263, 0.18548014320965325, -0.17462172452360392, 0.002030706365725824, 0.01109624288177916, -0.043950825929641724, -0.18485743905018484, -0.18553032338968478, 0.41946760192513466, -0.033270527608692646, 0.21148585604636796, 0.17573358797069108, 0.024770107145221636, 0.0012207341912601674, -0.010369132040068507, 0.11559066422549742, -0.27130869523222956, 0.166233301628381, 0.16872432508638927, 0.14731570004784902, 0.28474300780466627, -0.36901060811110903, -0.16395972329857095, 0.14406099183751003, 0.050905564932950904, 0.012150636475001062, -0.12918589536898903, -0.29491739853152205, 0.15599610077749407, -0.09461807193500656, -0.11259660284434046, -0.19785582766469037, -0.01520087303859847, 0.17241277262136073, -0.19180998964501278, 0.013641142094067098, 0.2660965427723048, 0.11986989907122084, -0.15204456062721355, 0.005642514343760142, 0.0012493499421647616, 0.06340495212602296, 0.025035251464162554, -0.027141431554420187, -0.037386958354285786, -0.12987123309202225, -0.10021969968719142, 0.2606087661614375, -0.08777966939045914, -0.16878001777721302, 0.28318128255861147, -0.1835339542677892, -0.27619757982237, 0.0069422051684731355, 0.22592882785413945, 0.19574739133739577, -0.21547515630455955, 0.12107294009183533, -0.05689752261553492, 0.10011766997299024, 0.09507972534213747, 0.22706056905112096, 0.07439944773380246, 0.15401456278881856, 0.11083599023653992, 0.22249510333806807, 0.0023928511488650528, -0.01077201177499124, -0.34694446729762213, -0.18906423835349934, -0.04645336345337065, 0.046838456232632907, -0.10805059520290732, -0.18690384551882744, 0.41119323295008925, 0.13074045375521695, 0.18631611704560264, 0.0749079034929829, 0.20826589529003417, 0.01995788168694292, 0.001424852292984724, 0.06727522239089012, 0.236572733470114, 0.25202626096350805, 0.0403328923774617, -0.08551104074909485, 0.008929061404030238, 0.15733172812698676] |
1,802.01821 | Rollable Latent Space for Azimuth Invariant SAR Target Recognition | This paper proposes rollable latent space (RLS) for an azimuth invariant
synthetic aperture radar (SAR) target recognition. Scarce labeled data and
limited viewing direction are critical issues in SAR target recognition.The RLS
is a designed space in which rolling of latent features corresponds to 3D
rotation of an object. Thus latent features of an arbitrary view can be
inferred using those of different views. This characteristic further enables us
to augment data from limited viewing in RLS. RLS-based classifiers with and
without data augmentation and a conventional classifier trained with target
front shots are evaluated over untrained target back shots. Results show that
the RLS-based classifier with augmentation improves an accuracy by 30% compared
to the conventional classifier.
| cs.CV | this paper proposes rollable latent space rls for an azimuth invariant synthetic aperture radar sar target recognition scarce labeled data and limited viewing direction are critical issues in sar target recognitionthe rls is a designed space in which rolling of latent features corresponds to 3d rotation of an object thus latent features of an arbitrary view can be inferred using those of different views this characteristic further enables us to augment data from limited viewing in rls rlsbased classifiers with and without data augmentation and a conventional classifier trained with target front shots are evaluated over untrained target back shots results show that the rlsbased classifier with augmentation improves an accuracy by 30 compared to the conventional classifier | [['this', 'paper', 'proposes', 'rollable', 'latent', 'space', 'rls', 'for', 'an', 'azimuth', 'invariant', 'synthetic', 'aperture', 'radar', 'sar', 'target', 'recognition', 'scarce', 'labeled', 'data', 'and', 'limited', 'viewing', 'direction', 'are', 'critical', 'issues', 'in', 'sar', 'target', 'recognitionthe', 'rls', 'is', 'a', 'designed', 'space', 'in', 'which', 'rolling', 'of', 'latent', 'features', 'corresponds', 'to', '3d', 'rotation', 'of', 'an', 'object', 'thus', 'latent', 'features', 'of', 'an', 'arbitrary', 'view', 'can', 'be', 'inferred', 'using', 'those', 'of', 'different', 'views', 'this', 'characteristic', 'further', 'enables', 'us', 'to', 'augment', 'data', 'from', 'limited', 'viewing', 'in', 'rls', 'rlsbased', 'classifiers', 'with', 'and', 'without', 'data', 'augmentation', 'and', 'a', 'conventional', 'classifier', 'trained', 'with', 'target', 'front', 'shots', 'are', 'evaluated', 'over', 'untrained', 'target', 'back', 'shots', 'results', 'show', 'that', 'the', 'rlsbased', 'classifier', 'with', 'augmentation', 'improves', 'an', 'accuracy', 'by', '30', 'compared', 'to', 'the', 'conventional', 'classifier']] | [-0.0021769634050574026, 0.041231991354364034, -0.040885986260475654, 0.032742299556989096, -0.14274726555369602, -0.20477173884463465, 0.05056926421118611, 0.48825939134534063, -0.29967427274597613, -0.35206378859885296, 0.06518472819127431, -0.27029233949724585, -0.11247661193945156, 0.1862137683403552, -0.19044353194727465, 0.07740691230779263, 0.12085050370560252, 0.04526566187369412, -0.10127137675841243, -0.26839634433894516, 0.3102318690648174, 0.0872946443790891, 0.35682719586224393, -0.08830021198935292, 0.15300636775771573, -0.005319278474479657, -0.07724200899648512, 0.005816147038472238, -0.00445671514579113, 0.14188175835919664, 0.32724271872650895, 0.2213871684447252, 0.25139306124765426, -0.37549834391343057, -0.21965913611046714, 0.05552337684877847, 0.15898470620721064, 0.10305416978923765, 0.010528127149004361, -0.37566810688967334, 0.05677527405626687, -0.14365666443763045, -0.0337405230183604, -0.09655183721996105, -0.048621845614277466, 0.0002312158547534511, -0.3308991541813031, -0.003596829667944333, 0.03397872477392506, 0.1473588790515727, -0.09546553361197484, -0.11970170837794912, 0.0021313143219670347, 0.16609183503696212, 0.043105512341596826, 0.1111712098595333, 0.13216010438165918, -0.1781928490742977, -0.12644769173468753, 0.3661996789019683, -0.07003370661525345, -0.23304034328963286, 0.17369574435247942, -0.06221121135529067, -0.07296434352334974, 0.2064890924837151, 0.2269619571753569, 0.12911179246067808, -0.15229616438616708, -0.024524466539552467, -0.06514856130976615, 0.18200236849551057, 0.06182520700104792, -0.0654809754943989, 0.18106024295336504, 0.19760689656410751, 0.06075816835198503, 0.16666791482993146, -0.25902312806133054, -0.01346510125460617, -0.20360250081084186, -0.07293843203384814, -0.2057346159728758, -0.023035635043674244, -0.13626253552665102, -0.1019452074883859, 0.34638117788287265, 0.21311397577941033, 0.271431157798988, 0.09596203737350277, 0.36234870559439575, 0.033445704447362445, 0.1143822046879936, 0.073616024859928, 0.14883413286939873, 0.009598376094925636, 0.09203878800075597, -0.15196317784359742, 0.09335812813088555, 0.01491234079003334] |
1,802.01822 | Geometry-Contrastive GAN for Facial Expression Transfer | In this paper, we propose a Geometry-Contrastive Generative Adversarial
Network (GC-GAN) for transferring continuous emotions across different
subjects. Given an input face with certain emotion and a target facial
expression from another subject, GC-GAN can generate an identity-preserving
face with the target expression. Geometry information is introduced into cGANs
as continuous conditions to guide the generation of facial expressions. In
order to handle the misalignment across different subjects or emotions,
contrastive learning is used to transform geometry manifold into an embedded
semantic manifold of facial expressions. Therefore, the embedded geometry is
injected into the latent space of GANs and control the emotion generation
effectively. Experimental results demonstrate that our proposed method can be
applied in facial expression transfer even there exist big differences in
facial shapes and expressions between different subjects.
| cs.CV | in this paper we propose a geometrycontrastive generative adversarial network gcgan for transferring continuous emotions across different subjects given an input face with certain emotion and a target facial expression from another subject gcgan can generate an identitypreserving face with the target expression geometry information is introduced into cgans as continuous conditions to guide the generation of facial expressions in order to handle the misalignment across different subjects or emotions contrastive learning is used to transform geometry manifold into an embedded semantic manifold of facial expressions therefore the embedded geometry is injected into the latent space of gans and control the emotion generation effectively experimental results demonstrate that our proposed method can be applied in facial expression transfer even there exist big differences in facial shapes and expressions between different subjects | [['in', 'this', 'paper', 'we', 'propose', 'a', 'geometrycontrastive', 'generative', 'adversarial', 'network', 'gcgan', 'for', 'transferring', 'continuous', 'emotions', 'across', 'different', 'subjects', 'given', 'an', 'input', 'face', 'with', 'certain', 'emotion', 'and', 'a', 'target', 'facial', 'expression', 'from', 'another', 'subject', 'gcgan', 'can', 'generate', 'an', 'identitypreserving', 'face', 'with', 'the', 'target', 'expression', 'geometry', 'information', 'is', 'introduced', 'into', 'cgans', 'as', 'continuous', 'conditions', 'to', 'guide', 'the', 'generation', 'of', 'facial', 'expressions', 'in', 'order', 'to', 'handle', 'the', 'misalignment', 'across', 'different', 'subjects', 'or', 'emotions', 'contrastive', 'learning', 'is', 'used', 'to', 'transform', 'geometry', 'manifold', 'into', 'an', 'embedded', 'semantic', 'manifold', 'of', 'facial', 'expressions', 'therefore', 'the', 'embedded', 'geometry', 'is', 'injected', 'into', 'the', 'latent', 'space', 'of', 'gans', 'and', 'control', 'the', 'emotion', 'generation', 'effectively', 'experimental', 'results', 'demonstrate', 'that', 'our', 'proposed', 'method', 'can', 'be', 'applied', 'in', 'facial', 'expression', 'transfer', 'even', 'there', 'exist', 'big', 'differences', 'in', 'facial', 'shapes', 'and', 'expressions', 'between', 'different', 'subjects']] | [-0.027241522215263103, 0.03198986305085327, -0.06441835073201219, 0.08299126466772577, -0.0991989098747581, -0.18801359351346036, -0.04755778914750408, 0.47006413079361664, -0.2658900346359587, -0.3190630248718662, 0.019739125367777888, -0.2618874564614089, -0.23669030868222762, 0.170231226586111, -0.2020316855996498, 0.0409937301537866, 0.0766946283983998, 0.08689633879293979, -0.044733221130400125, -0.2229091864367092, 0.33156115964447963, -0.04271598410923616, 0.34232531546149403, 0.0343297751423961, 0.1647386144786651, -0.03401839492835279, -0.0018651447498996276, -0.011746510766215579, -0.05303377126830355, 0.20966160224270425, 0.37688331580284284, 0.2319171653725789, 0.2738383895375591, -0.46775002269714605, -0.21342785037518297, 0.06800841500808019, 0.13274070193438092, 0.12518761746832752, -0.06999311724575819, -0.4022165500209667, 0.0739409187099227, -0.15208613545200933, 0.04326663486426696, -0.13898674744268646, 0.006360071263770806, -0.07407798697067847, -0.3197896626224974, -0.008043373858527048, 0.09045304439496249, 0.10624211222602753, -0.12028534847058836, -0.07925440113103832, -0.021413126147308503, 0.27531576521323586, 0.06817454684824042, 0.05686774667537975, 0.15228068217675172, -0.18741422814809994, -0.10147617596521741, 0.3466706254548626, -0.026319847110244154, -0.308669970218034, 0.15293425542222394, -0.08005471356773342, -0.08871203394664917, 0.11592512838979019, 0.25646643596610375, 0.1181374111038167, -0.17439845886838157, -0.01941392202343195, -0.024551820636588673, 0.194711168667709, 0.10306053228850942, -0.03391534535523988, 0.21171259171023848, 0.1375781388123869, 0.023317023002164206, 0.20465526734278683, -0.15690706987516023, -0.0696690367476549, -0.2385050462471554, -0.09440863446798176, -0.1726520374941174, 0.0014879075606586412, -0.1246390192642366, -0.15460394271212863, 0.4309538510606217, 0.16876051601866493, 0.23455242040290614, 0.0689430957750119, 0.32502152166307496, 0.06951886904062121, 0.09201992091038846, 0.04583248041308252, 0.11112374387448654, 0.019442857068497688, 0.09568370840133866, -0.16998780832500415, 0.11078885167444241, 0.043605944723822176] |
1,802.01823 | A Physical Light Transport Model for Non-Line-of-Sight Imaging
Applications | Non-line-of-sight (NLOS) imaging has recently attracted a lot of interest
from the scientific community. The goal of this paper is to provide the basis
for a comprehensive mathematical framework for NLOS imaging that is directly
derived from physical concepts. We introduce the irradiance phasor field
(P-field) as an abstract quantity for irradiance fluctuations, akin to the
complex envelope of the Electrical field (E-field) that is used to describe
propagation of electromagnetic energy. We demonstrate that the P-field
propagator is analogous to the Huygens-Fresnel propagator that describes the
propagation of other waves and show that NLOS light transport can be described
with the processing methods that are available for LOS imaging. We perform
simulations to demonstrate the accuracy and validity of the P-field formulation
and provide experimental results to demonstrate a Huygens-like P-field
summation behavior.
| physics.optics | nonlineofsight nlos imaging has recently attracted a lot of interest from the scientific community the goal of this paper is to provide the basis for a comprehensive mathematical framework for nlos imaging that is directly derived from physical concepts we introduce the irradiance phasor field pfield as an abstract quantity for irradiance fluctuations akin to the complex envelope of the electrical field efield that is used to describe propagation of electromagnetic energy we demonstrate that the pfield propagator is analogous to the huygensfresnel propagator that describes the propagation of other waves and show that nlos light transport can be described with the processing methods that are available for los imaging we perform simulations to demonstrate the accuracy and validity of the pfield formulation and provide experimental results to demonstrate a huygenslike pfield summation behavior | [['nonlineofsight', 'nlos', 'imaging', 'has', 'recently', 'attracted', 'a', 'lot', 'of', 'interest', 'from', 'the', 'scientific', 'community', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'provide', 'the', 'basis', 'for', 'a', 'comprehensive', 'mathematical', 'framework', 'for', 'nlos', 'imaging', 'that', 'is', 'directly', 'derived', 'from', 'physical', 'concepts', 'we', 'introduce', 'the', 'irradiance', 'phasor', 'field', 'pfield', 'as', 'an', 'abstract', 'quantity', 'for', 'irradiance', 'fluctuations', 'akin', 'to', 'the', 'complex', 'envelope', 'of', 'the', 'electrical', 'field', 'efield', 'that', 'is', 'used', 'to', 'describe', 'propagation', 'of', 'electromagnetic', 'energy', 'we', 'demonstrate', 'that', 'the', 'pfield', 'propagator', 'is', 'analogous', 'to', 'the', 'huygensfresnel', 'propagator', 'that', 'describes', 'the', 'propagation', 'of', 'other', 'waves', 'and', 'show', 'that', 'nlos', 'light', 'transport', 'can', 'be', 'described', 'with', 'the', 'processing', 'methods', 'that', 'are', 'available', 'for', 'los', 'imaging', 'we', 'perform', 'simulations', 'to', 'demonstrate', 'the', 'accuracy', 'and', 'validity', 'of', 'the', 'pfield', 'formulation', 'and', 'provide', 'experimental', 'results', 'to', 'demonstrate', 'a', 'huygenslike', 'pfield', 'summation', 'behavior']] | [-0.11514809639175612, 0.07054451972351644, -0.10046643400704838, 0.05074761937375888, -0.11626344093618761, -0.06381231801290262, -0.0235858696357074, 0.4090932767306055, -0.2401445256336067, -0.28990532363996024, 0.06462275800540258, -0.24061200330454044, -0.19972838342357846, 0.24096983739812122, -0.07342897138831422, 0.05862034959508512, 0.08723374832460054, 0.018665089920124642, -0.019105495393969454, -0.17252250529188468, 0.2671245579009077, 0.07635254190912596, 0.310502949149761, 0.08907392509876841, 0.10234234587086323, 0.030111617126845215, -0.026071578085674604, 0.03464478765845411, -0.1044272774657807, 0.1267227359620252, 0.2752998633436242, 0.16886931046304343, 0.24963304862604105, -0.42656375956896664, -0.29103629938366166, 0.04438301891480621, 0.14186986892823747, 0.10674720376912028, -0.06931269494028888, -0.2916651172948567, 0.05875573755430996, -0.13474206277344347, -0.11861657392394666, -0.08386008935381792, -0.03670067328756633, 0.027300976543281143, -0.28284744616541874, 0.056916584539108146, -0.014934403405181672, 0.08015080313793474, -0.052019397598600255, -0.10152293316655814, -0.002251232725645142, 0.13901881891551351, 0.02955384376017671, 0.044278226799814774, 0.11893166713313728, -0.10339814179254822, -0.10318152212950968, 0.3997559896705294, -0.061213601919773375, -0.19275265411802925, 0.15550046895728692, -0.13595816313378387, -0.09491132122737572, 0.14347233862048925, 0.19800312752674396, 0.06613324157879653, -0.16709526577838382, 0.04695603330458796, -0.05137520116802893, 0.1393717480893422, 0.02854367576826616, 0.05435954502790718, 0.18777805790865332, 0.15588631403555436, 0.03901662489861474, 0.134329155455536, -0.12730846082077438, -0.07528407259010955, -0.27512286615705017, -0.17450755891299113, -0.1760539057808123, 0.04963207738018854, -0.0418104681477854, -0.16034272960317147, 0.4107783173063868, 0.27084249583304043, 0.12095563956781437, 0.06129751565579073, 0.36113479287412603, 0.1331623236997109, 0.040199593224219586, 0.06283487466381009, 0.28092408169207994, 0.1640187927024593, 0.14735830949857495, -0.21281764758890845, 0.03159360742350494, 0.023603987584198665] |
1,802.01824 | On the limitations of statistical absorption studies with the Sloan
Digital Sky Surveys I--III | We investigate the limitations of statistical absorption measurements with
the SDSS optical spectroscopic surveys. We show that changes in the data
reduction strategy throughout different data releases have led to a better
accuracy at long wavelengths, in particular for sky line subtraction, but a
degradation at short wavelengths with the emergence of systematic spectral
features with an amplitude of about one percent. We show that these features
originate from inaccuracy in the fitting of modeled F-star spectra used for
flux calibration. The best-fit models for those stars are found to
systematically over-estimate the strength of metal lines and under-estimate
that of Lithium. We also identify the existence of artifacts due to masking and
interpolation procedures at the wavelengths of the hydrogen Balmer series
leading to the existence of artificial Balmer $\alpha$ absorption in all SDSS
optical spectra. All these effects occur in the rest-frame of the standard
stars and therefore present Galactic longitude variations due to the rotation
of the Galaxy. We demonstrate that the detection of certain weak absorption
lines reported in the literature are solely due to calibration effects.
Finally, we discuss new strategies to mitigate these issues.
| astro-ph.IM astro-ph.GA | we investigate the limitations of statistical absorption measurements with the sdss optical spectroscopic surveys we show that changes in the data reduction strategy throughout different data releases have led to a better accuracy at long wavelengths in particular for sky line subtraction but a degradation at short wavelengths with the emergence of systematic spectral features with an amplitude of about one percent we show that these features originate from inaccuracy in the fitting of modeled fstar spectra used for flux calibration the bestfit models for those stars are found to systematically overestimate the strength of metal lines and underestimate that of lithium we also identify the existence of artifacts due to masking and interpolation procedures at the wavelengths of the hydrogen balmer series leading to the existence of artificial balmer alpha absorption in all sdss optical spectra all these effects occur in the restframe of the standard stars and therefore present galactic longitude variations due to the rotation of the galaxy we demonstrate that the detection of certain weak absorption lines reported in the literature are solely due to calibration effects finally we discuss new strategies to mitigate these issues | [['we', 'investigate', 'the', 'limitations', 'of', 'statistical', 'absorption', 'measurements', 'with', 'the', 'sdss', 'optical', 'spectroscopic', 'surveys', 'we', 'show', 'that', 'changes', 'in', 'the', 'data', 'reduction', 'strategy', 'throughout', 'different', 'data', 'releases', 'have', 'led', 'to', 'a', 'better', 'accuracy', 'at', 'long', 'wavelengths', 'in', 'particular', 'for', 'sky', 'line', 'subtraction', 'but', 'a', 'degradation', 'at', 'short', 'wavelengths', 'with', 'the', 'emergence', 'of', 'systematic', 'spectral', 'features', 'with', 'an', 'amplitude', 'of', 'about', 'one', 'percent', 'we', 'show', 'that', 'these', 'features', 'originate', 'from', 'inaccuracy', 'in', 'the', 'fitting', 'of', 'modeled', 'fstar', 'spectra', 'used', 'for', 'flux', 'calibration', 'the', 'bestfit', 'models', 'for', 'those', 'stars', 'are', 'found', 'to', 'systematically', 'overestimate', 'the', 'strength', 'of', 'metal', 'lines', 'and', 'underestimate', 'that', 'of', 'lithium', 'we', 'also', 'identify', 'the', 'existence', 'of', 'artifacts', 'due', 'to', 'masking', 'and', 'interpolation', 'procedures', 'at', 'the', 'wavelengths', 'of', 'the', 'hydrogen', 'balmer', 'series', 'leading', 'to', 'the', 'existence', 'of', 'artificial', 'balmer', 'alpha', 'absorption', 'in', 'all', 'sdss', 'optical', 'spectra', 'all', 'these', 'effects', 'occur', 'in', 'the', 'restframe', 'of', 'the', 'standard', 'stars', 'and', 'therefore', 'present', 'galactic', 'longitude', 'variations', 'due', 'to', 'the', 'rotation', 'of', 'the', 'galaxy', 'we', 'demonstrate', 'that', 'the', 'detection', 'of', 'certain', 'weak', 'absorption', 'lines', 'reported', 'in', 'the', 'literature', 'are', 'solely', 'due', 'to', 'calibration', 'effects', 'finally', 'we', 'discuss', 'new', 'strategies', 'to', 'mitigate', 'these', 'issues']] | [-0.04980686219090498, 0.057501558712637665, -0.03746696457291316, 0.08350280129203672, -0.06213244930105774, -0.08186671815224383, 0.06522052516474536, 0.448220472949508, -0.232113761432763, -0.32920355295370285, 0.07980034516045922, -0.31909563233095567, -0.06613168710058456, 0.19657924059582385, -0.06574258716458356, -0.0005349407928358568, 0.05543023709599909, -0.09551161664881204, -0.059010383457337556, -0.2441435441987491, 0.3018488898677261, 0.06973241851910164, 0.2390063456259668, 0.02471993256752428, 0.0350699568326634, -0.0679980126503659, -0.10915039515759992, 0.00527956265631426, -0.14453623876738436, 0.08082605464063052, 0.25086379998302666, 0.09139690735671473, 0.2251675225671773, -0.36476779251212355, -0.23482004683464766, 0.10553121180518678, 0.15294298511978827, 0.1332852049222167, -0.030122630670666693, -0.2443942153483237, 0.05710782511895032, -0.1295969867588658, -0.15721486910050245, -0.025068919615525948, 0.025901826598534457, 0.06984588463490486, -0.21910083044847278, 0.09088051008706986, 0.021589799160689215, 0.124451195260228, -0.08987903448287397, -0.1261925969971344, -0.03935397274326533, 0.11315264076631712, 0.05719674772729999, -0.02423809248414871, 0.12681782589245, -0.1340985749701136, -0.07237956718002495, 0.39868098156232584, -0.10905133093321255, -0.05009825747509144, 0.1751953770847697, -0.17458070215254434, -0.17908239753726918, 0.18278973484963276, 0.16532755872528804, 0.07765514135144737, -0.1275573752232288, -0.014022364731767755, 0.040469067411399204, 0.209307027838536, 0.07394065016292428, 0.10448990548772455, 0.24320446765540463, 0.08118627496725439, 0.017692119445602752, 0.09841399724582994, -0.24580227940980542, -0.008304779650643468, -0.27367258695640456, -0.05568359533422872, -0.09503572346078919, 0.03609467133830645, -0.08558328828114195, -0.16808419843100159, 0.3894759836508647, 0.22322127897243357, 0.2215557803412115, 0.029718586439756972, 0.319560722070501, 0.10655077952389164, 0.11217274386925917, 0.03875446474351185, 0.3370174434673237, 0.11224667756377082, 0.10284860252010587, -0.2533194126009843, 0.06776985719701961, -0.012059895284964066] |
1,802.01825 | Transversals in Uniform Linear Hypergraphs | The transversal number $\tau(H)$ of a hypergraph $H$ is the minimum number of
vertices that intersect every edge of $H$. A linear hypergraph is one in which
every two distinct edges intersect in at most one vertex. A $k$-uniform
hypergraph has all edges of size $k$. It is known that $\tau(H) \le (n +
m)/(k+1)$ holds for all $k$-uniform, linear hypergraphs $H$ when $k \in
\{2,3\}$ or when $k \ge 4$ and the maximum degree of $H$ is at most two. It has
been conjectured that $\tau(H) \le (n+m)/(k+1)$ holds for all $k$-uniform,
linear hypergraphs $H$. We disprove the conjecture for large $k$, and show that
the best possible constant $c_k$ in the bound $\tau(H) \le c_k (n+m)$ has order
$\ln(k)/k$ for both linear (which we show in this paper) and non-linear
hypergraphs. We show that for those $k$ where the conjecture holds, it is tight
for a large number of densities if there exists an affine plane $AG(2,k)$ of
order $k \ge 2$. We raise the problem to find the smallest value, $k_{\min}$,
of $k$ for which the conjecture fails. We prove a general result, which when
applied to a projective plane of order $331$ shows that $k_{\min} \le 166$.
Even though the conjecture fails for large $k$, our main result is that it
still holds for $k=4$, implying that $k_{\min} \ge 5$. The case $k=4$ is much
more difficult than the cases $k \in \{2,3\}$, as the conjecture does not hold
for general (non-linear) hypergraphs when $k=4$. Key to our proof is the
completely new technique of the deficiency of a hypergraph introduced in this
paper.
| math.CO | the transversal number tauh of a hypergraph h is the minimum number of vertices that intersect every edge of h a linear hypergraph is one in which every two distinct edges intersect in at most one vertex a kuniform hypergraph has all edges of size k it is known that tauh le n mk1 holds for all kuniform linear hypergraphs h when k in 23 or when k ge 4 and the maximum degree of h is at most two it has been conjectured that tauh le nmk1 holds for all kuniform linear hypergraphs h we disprove the conjecture for large k and show that the best possible constant c_k in the bound tauh le c_k nm has order lnkk for both linear which we show in this paper and nonlinear hypergraphs we show that for those k where the conjecture holds it is tight for a large number of densities if there exists an affine plane ag2k of order k ge 2 we raise the problem to find the smallest value k_min of k for which the conjecture fails we prove a general result which when applied to a projective plane of order 331 shows that k_min le 166 even though the conjecture fails for large k our main result is that it still holds for k4 implying that k_min ge 5 the case k4 is much more difficult than the cases k in 23 as the conjecture does not hold for general nonlinear hypergraphs when k4 key to our proof is the completely new technique of the deficiency of a hypergraph introduced in this paper | [['the', 'transversal', 'number', 'tauh', 'of', 'a', 'hypergraph', 'h', 'is', 'the', 'minimum', 'number', 'of', 'vertices', 'that', 'intersect', 'every', 'edge', 'of', 'h', 'a', 'linear', 'hypergraph', 'is', 'one', 'in', 'which', 'every', 'two', 'distinct', 'edges', 'intersect', 'in', 'at', 'most', 'one', 'vertex', 'a', 'kuniform', 'hypergraph', 'has', 'all', 'edges', 'of', 'size', 'k', 'it', 'is', 'known', 'that', 'tauh', 'le', 'n', 'mk1', 'holds', 'for', 'all', 'kuniform', 'linear', 'hypergraphs', 'h', 'when', 'k', 'in', '23', 'or', 'when', 'k', 'ge', '4', 'and', 'the', 'maximum', 'degree', 'of', 'h', 'is', 'at', 'most', 'two', 'it', 'has', 'been', 'conjectured', 'that', 'tauh', 'le', 'nmk1', 'holds', 'for', 'all', 'kuniform', 'linear', 'hypergraphs', 'h', 'we', 'disprove', 'the', 'conjecture', 'for', 'large', 'k', 'and', 'show', 'that', 'the', 'best', 'possible', 'constant', 'c_k', 'in', 'the', 'bound', 'tauh', 'le', 'c_k', 'nm', 'has', 'order', 'lnkk', 'for', 'both', 'linear', 'which', 'we', 'show', 'in', 'this', 'paper', 'and', 'nonlinear', 'hypergraphs', 'we', 'show', 'that', 'for', 'those', 'k', 'where', 'the', 'conjecture', 'holds', 'it', 'is', 'tight', 'for', 'a', 'large', 'number', 'of', 'densities', 'if', 'there', 'exists', 'an', 'affine', 'plane', 'ag2k', 'of', 'order', 'k', 'ge', '2', 'we', 'raise', 'the', 'problem', 'to', 'find', 'the', 'smallest', 'value', 'k_min', 'of', 'k', 'for', 'which', 'the', 'conjecture', 'fails', 'we', 'prove', 'a', 'general', 'result', 'which', 'when', 'applied', 'to', 'a', 'projective', 'plane', 'of', 'order', '331', 'shows', 'that', 'k_min', 'le', '166', 'even', 'though', 'the', 'conjecture', 'fails', 'for', 'large', 'k', 'our', 'main', 'result', 'is', 'that', 'it', 'still', 'holds', 'for', 'k4', 'implying', 'that', 'k_min', 'ge', '5', 'the', 'case', 'k4', 'is', 'much', 'more', 'difficult', 'than', 'the', 'cases', 'k', 'in', '23', 'as', 'the', 'conjecture', 'does', 'not', 'hold', 'for', 'general', 'nonlinear', 'hypergraphs', 'when', 'k4', 'key', 'to', 'our', 'proof', 'is', 'the', 'completely', 'new', 'technique', 'of', 'the', 'deficiency', 'of', 'a', 'hypergraph', 'introduced', 'in', 'this', 'paper']] | [-0.16832141206506288, 0.1518874784820086, -0.016860647275197236, 0.03260551724551161, -0.041869432125663894, -0.2151930141492013, 0.014929282476342369, 0.32871794487811823, -0.23648737429351913, -0.3121499696033866, 0.05587765771347084, -0.30350618074545777, -0.11935915473132451, 0.15547392443951333, -0.056635189082678124, 0.00820882553120045, 0.04955104680530811, 0.0889645182054885, 0.029687104200561545, -0.3301778865034893, 0.2683187449539687, -0.06194015283659665, 0.17670811790660743, 0.12015964253629191, 0.03555792251206709, 0.037356637837188886, 0.07321821266227882, 0.06923291869210599, -0.20882451629894963, 0.044919880362585624, 0.2797172158325063, 0.15839090188136185, 0.2698251274379083, -0.32392900445825723, -0.1625186649343408, 0.21640461782094048, 0.14092085221350178, 0.06614218009141923, 0.02033995436018317, -0.12465893132894328, 0.2081779666495453, -0.0670680312822228, -0.14426952243824911, 0.012234479421749711, 0.14698514635992152, -0.06184676360113151, -0.3181435168777226, 0.027041037827130465, 0.18095671742180872, 0.039837237548040735, 0.05071821697162126, -0.2202009901106287, -0.057853646267727585, 0.06385488051675951, -0.0366191768297347, 0.08006448909873143, -0.015090389131342597, -0.10535793621128312, -0.08948396157586214, 0.369075840762393, -0.07594035472968906, -0.09988392698384511, 0.12962339351691876, -0.20833927322757628, -0.21566731827227736, 0.14051705830956274, 0.06992173845047188, 0.18566104539257305, -0.04067861819996985, 0.17026657305563497, -0.1647158842573514, 0.1726176124030837, 0.13536410966789295, 0.015555499638801186, 0.09143361602698198, 0.09378683365084174, 0.18548895166807625, 0.11775925241862283, -0.040922863518283, 0.04005042305299977, -0.3103516665216761, -0.16940045722598865, -0.23219401139376164, 0.10223286620886497, -0.1542671893203078, -0.130891594330244, 0.33088397560729366, 0.127501651694536, 0.20759463944176043, 0.11743094613881443, 0.20317728608841373, 0.08648780743445086, 0.0371609518589332, 0.18831306175949672, 0.19154749066872295, 0.18223073745894275, -0.01549152169856384, -0.14435428186499683, 0.042116832259731986, 0.07393181741512804] |
1,802.01826 | Switchable Virtual, Augmented, and Mixed Reality through Optical
Cloaking | A switchable virtual reality (VR), augmented reality (AR), and mixed reality
(MR) system is proposed using digital optical cloaking. Optical cloaking allows
completely opaque VR devices to be "cloaked," switching to AR or MR while
providing correct three-dimensional (3D) parallax and perspective of the real
world, without the need for transparent optics. On the other hand, 3D capture
and display devices with non-zero thicknesses, require optical cloaking to
properly display captured reality. A simplified stereoscopic system with two
cameras and existing VR systems can be an approximation for limited VR, AR, or
MR. To provide true 3D visual effects, multiple input cameras, a 3D display,
and a simple linear calculation amounting to cloaking can be used. Since the
display size requirements for VR, AR, and MR are usually small, with increasing
computing power and pixel densities, the framework presented here can provide a
widely deployable VR, AR, MR design.
| physics.optics | a switchable virtual reality vr augmented reality ar and mixed reality mr system is proposed using digital optical cloaking optical cloaking allows completely opaque vr devices to be cloaked switching to ar or mr while providing correct threedimensional 3d parallax and perspective of the real world without the need for transparent optics on the other hand 3d capture and display devices with nonzero thicknesses require optical cloaking to properly display captured reality a simplified stereoscopic system with two cameras and existing vr systems can be an approximation for limited vr ar or mr to provide true 3d visual effects multiple input cameras a 3d display and a simple linear calculation amounting to cloaking can be used since the display size requirements for vr ar and mr are usually small with increasing computing power and pixel densities the framework presented here can provide a widely deployable vr ar mr design | [['a', 'switchable', 'virtual', 'reality', 'vr', 'augmented', 'reality', 'ar', 'and', 'mixed', 'reality', 'mr', 'system', 'is', 'proposed', 'using', 'digital', 'optical', 'cloaking', 'optical', 'cloaking', 'allows', 'completely', 'opaque', 'vr', 'devices', 'to', 'be', 'cloaked', 'switching', 'to', 'ar', 'or', 'mr', 'while', 'providing', 'correct', 'threedimensional', '3d', 'parallax', 'and', 'perspective', 'of', 'the', 'real', 'world', 'without', 'the', 'need', 'for', 'transparent', 'optics', 'on', 'the', 'other', 'hand', '3d', 'capture', 'and', 'display', 'devices', 'with', 'nonzero', 'thicknesses', 'require', 'optical', 'cloaking', 'to', 'properly', 'display', 'captured', 'reality', 'a', 'simplified', 'stereoscopic', 'system', 'with', 'two', 'cameras', 'and', 'existing', 'vr', 'systems', 'can', 'be', 'an', 'approximation', 'for', 'limited', 'vr', 'ar', 'or', 'mr', 'to', 'provide', 'true', '3d', 'visual', 'effects', 'multiple', 'input', 'cameras', 'a', '3d', 'display', 'and', 'a', 'simple', 'linear', 'calculation', 'amounting', 'to', 'cloaking', 'can', 'be', 'used', 'since', 'the', 'display', 'size', 'requirements', 'for', 'vr', 'ar', 'and', 'mr', 'are', 'usually', 'small', 'with', 'increasing', 'computing', 'power', 'and', 'pixel', 'densities', 'the', 'framework', 'presented', 'here', 'can', 'provide', 'a', 'widely', 'deployable', 'vr', 'ar', 'mr', 'design']] | [-0.0787540807454353, 0.06069978244140535, -0.051105888379150186, 0.005976633325800449, -0.12640516247151845, -0.27253950206365984, -0.033781170957540504, 0.47401936911046505, -0.22695616707549549, -0.38261562467071436, 0.06624097251270791, -0.23772549564997436, -0.17040291510134836, 0.21265129145584852, -0.14520608982885405, 0.08034625620309313, 0.04914812873908312, -0.006055854260530823, -0.06454299445320295, -0.1662803035520092, 0.2539920523737701, -0.026504412205927325, 0.2872053281866614, 0.02342491125650454, 0.08717785296561634, 0.02625348289565952, 0.025664517362977084, 0.10672129437424267, 0.002696992845068242, 0.13182341842755876, 0.27756288886889063, 0.12057514258366603, 0.21299402390750463, -0.5072416119627504, -0.21072291860969475, 0.04016590012618709, 0.16713251400232665, 0.05557667874831131, -0.11527250629096548, -0.3499121002168488, 0.09003819912459526, -0.1661237500601717, -0.11996991915808797, -0.07997631137228052, 0.04320185424622473, -0.015570784325558293, -0.3312180599497769, -0.028050348518928826, -0.03551893660661158, 0.1293134625466703, -0.09980211525529642, -0.06206884636893718, 0.011684550313066516, 0.17103090143181235, -0.05940859603493212, -0.004194692455407157, 0.15206233022622015, -0.1519399354915641, -0.0587458612831722, 0.4117917034324984, 0.057232740732072386, -0.17689061475505166, 0.21483704910516713, -0.11473526451861699, 0.05427561838401719, 0.1838709532542837, 0.20368775742358197, 0.08634048018717026, -0.1349250387506647, 0.03421920794726431, -0.01074284751393251, 0.1901557382427456, 0.03810899610546786, 0.08516254370888357, 0.20635055447147296, 0.14288672209786088, 0.009465484254862239, 0.05866045849327461, -0.19361590036978607, -0.01817638771264695, -0.22841623613349907, -0.18952284093271166, -0.18167618989019385, 0.01358028073426361, -0.08829133849930497, -0.21117294222841526, 0.32937811377564535, 0.18036836967178488, 0.15286422579474246, 0.008088433525943815, 0.40204992585334204, 0.1224098929810344, 0.13948312686168707, 0.05043564111794401, 0.27092228917367506, 0.031032743563738044, 0.24626647327689066, -0.15444296273565383, 0.05264863346534587, 0.01447018478128234] |
1,802.01827 | Coalgebroids in monoidal bicategories and their comodules | Quantum categories have been recently studied because of their relation to
bialgebroids, small categories, and skew monoidales. This is the first of a
series of papers based on the author's PhD thesis in which we examine the
theory of quantum categories developed by Day, Lack, and Street.
A quantum category is an opmonoidal monad on the monoidale associated to a
biduality $R\dashv R^{\circ}$, or enveloping monoidale, in a monoidal
bicategory of modules $\mathsf{Mod}(\mathcal{V})$ for a monoidal category
$\mathcal{V}$. Lack and Street proved that quantum categories are in
equivalence with right skew monoidales whose unit has a right adjoint in
$\mathsf{Mod}(\mathcal{V})$. Our first important result is similar to that of
Lack and Street. It is a characterisation of opmonoidal \emph{arrows} on
enveloping monoidales in terms of a new structure named \emph{oplax action}. We
then provide three different notions of comodule for an opmonoidal arrow, and
using a similar technique we prove that they are equivalent. Finally, when the
opmonoidal arrow is an opmonoidal monad, we are able to provide the category of
comodules for a quantum category with a monoidal structure such that the
forgetful functor is monoidal.
| math.CT math.QA | quantum categories have been recently studied because of their relation to bialgebroids small categories and skew monoidales this is the first of a series of papers based on the authors phd thesis in which we examine the theory of quantum categories developed by day lack and street a quantum category is an opmonoidal monad on the monoidale associated to a biduality rdashv rcirc or enveloping monoidale in a monoidal bicategory of modules mathsfmodmathcalv for a monoidal category mathcalv lack and street proved that quantum categories are in equivalence with right skew monoidales whose unit has a right adjoint in mathsfmodmathcalv our first important result is similar to that of lack and street it is a characterisation of opmonoidal empharrows on enveloping monoidales in terms of a new structure named emphoplax action we then provide three different notions of comodule for an opmonoidal arrow and using a similar technique we prove that they are equivalent finally when the opmonoidal arrow is an opmonoidal monad we are able to provide the category of comodules for a quantum category with a monoidal structure such that the forgetful functor is monoidal | [['quantum', 'categories', 'have', 'been', 'recently', 'studied', 'because', 'of', 'their', 'relation', 'to', 'bialgebroids', 'small', 'categories', 'and', 'skew', 'monoidales', 'this', 'is', 'the', 'first', 'of', 'a', 'series', 'of', 'papers', 'based', 'on', 'the', 'authors', 'phd', 'thesis', 'in', 'which', 'we', 'examine', 'the', 'theory', 'of', 'quantum', 'categories', 'developed', 'by', 'day', 'lack', 'and', 'street', 'a', 'quantum', 'category', 'is', 'an', 'opmonoidal', 'monad', 'on', 'the', 'monoidale', 'associated', 'to', 'a', 'biduality', 'rdashv', 'rcirc', 'or', 'enveloping', 'monoidale', 'in', 'a', 'monoidal', 'bicategory', 'of', 'modules', 'mathsfmodmathcalv', 'for', 'a', 'monoidal', 'category', 'mathcalv', 'lack', 'and', 'street', 'proved', 'that', 'quantum', 'categories', 'are', 'in', 'equivalence', 'with', 'right', 'skew', 'monoidales', 'whose', 'unit', 'has', 'a', 'right', 'adjoint', 'in', 'mathsfmodmathcalv', 'our', 'first', 'important', 'result', 'is', 'similar', 'to', 'that', 'of', 'lack', 'and', 'street', 'it', 'is', 'a', 'characterisation', 'of', 'opmonoidal', 'empharrows', 'on', 'enveloping', 'monoidales', 'in', 'terms', 'of', 'a', 'new', 'structure', 'named', 'emphoplax', 'action', 'we', 'then', 'provide', 'three', 'different', 'notions', 'of', 'comodule', 'for', 'an', 'opmonoidal', 'arrow', 'and', 'using', 'a', 'similar', 'technique', 'we', 'prove', 'that', 'they', 'are', 'equivalent', 'finally', 'when', 'the', 'opmonoidal', 'arrow', 'is', 'an', 'opmonoidal', 'monad', 'we', 'are', 'able', 'to', 'provide', 'the', 'category', 'of', 'comodules', 'for', 'a', 'quantum', 'category', 'with', 'a', 'monoidal', 'structure', 'such', 'that', 'the', 'forgetful', 'functor', 'is', 'monoidal']] | [-0.1080281124730172, 0.034784645326496, -0.08150625416673109, 0.09277902138190436, -0.12911500712561477, -0.13932750421662718, -0.024214601893578477, 0.4178582284843824, -0.38053515822692807, -0.1830206767788228, 0.09619898057626713, -0.1994706562906631, -0.15042424507698685, 0.17302979114516306, -0.22042448231263362, -0.07357008736631503, 0.06483195049375234, 0.116399809743578, -0.04682088333762205, -0.22959512068834054, 0.43546486625834646, 0.019486351611723747, 0.27696003181137185, 0.03891345351912804, 0.13600286049259408, -0.045923922297448086, -0.012930786768941443, 0.02472248199126108, -0.12463414531199216, 0.15182951579151593, 0.2928599199532058, 0.10408571051036725, 0.22483833862946984, -0.38888599137302304, -0.050220859599620346, 0.10442077099533925, 0.09299649500677393, 0.05080786558781634, -0.027539525550657813, -0.37496334711303475, 0.15241498293344294, -0.2894232654206129, -0.004466831075953818, -0.06479377791386026, 0.129562352967189, -0.01686572029078481, -0.2260516924163978, -0.0427570723689319, 0.11048816391165099, 0.13685680105976883, -0.07983625234140317, -0.043335012036828637, -0.04080212538008441, 0.12829511921647352, -0.07432568796701688, 0.013836998848722932, 0.12140128474244899, -0.1384589998369599, -0.17728154658743236, 0.38456348541492974, -0.0398488015975279, -0.19208760348528267, 0.16061421308814056, -0.10669227884802458, -0.1525763585512104, 0.0636982083564899, 0.004345932215213002, 0.1263051530514218, -0.09360478613298205, 0.16634514477820253, -0.17647350200355216, 0.07301104531363874, 0.10194526542782213, 0.04688824647197836, 0.18219820844375942, 0.13560600312365617, 0.020844438636186916, 0.15385536626083116, 0.005920740504446312, -0.09814985778915589, -0.33595531550872193, -0.23296243096625463, -0.04446445061962624, 0.12589959689569302, -0.009801254006814532, -0.19052307345125763, 0.3751538349442754, 0.14978388376798624, 0.1781445039878981, 0.12397138686924461, 0.22235924188719422, 0.044469434649001584, 0.09825430460951082, 0.0062517679494912505, 0.14239227654707562, 0.24956402978147355, 0.05644960277790173, -0.04878348476747102, 0.023814582333345314, 0.1887351876160364] |
1,802.01828 | Weighted composition operators on the class of subordinate functions | In this article, we study the weighted composition operators preserving the
class $\mathcal{P}_{\alpha}$ of analytic functions subordinate to
$\frac{1+\alpha z}{1-z}$ for $|\alpha|\leq 1, \alpha \neq -1$. Some of its
consequences and examples for some special cases are presented. Furthermore, we
discuss about the fixed points of weighted composition operators.
| math.FA | in this article we study the weighted composition operators preserving the class mathcalp_alpha of analytic functions subordinate to frac1alpha z1z for alphaleq 1 alpha neq 1 some of its consequences and examples for some special cases are presented furthermore we discuss about the fixed points of weighted composition operators | [['in', 'this', 'article', 'we', 'study', 'the', 'weighted', 'composition', 'operators', 'preserving', 'the', 'class', 'mathcalp_alpha', 'of', 'analytic', 'functions', 'subordinate', 'to', 'frac1alpha', 'z1z', 'for', 'alphaleq', '1', 'alpha', 'neq', '1', 'some', 'of', 'its', 'consequences', 'and', 'examples', 'for', 'some', 'special', 'cases', 'are', 'presented', 'furthermore', 'we', 'discuss', 'about', 'the', 'fixed', 'points', 'of', 'weighted', 'composition', 'operators']] | [-0.116005648955858, 0.0916740772081539, 0.03508815050493771, 0.13098320689702328, -0.03504297564116617, -0.11376427419600077, 0.056285386584931985, 0.39747957869743306, -0.2742825620128618, -0.201716112322174, 0.11949398881066979, -0.35068348646260955, -0.15467746175515154, 0.20137087733019143, -0.08890205972905581, 0.04041686740310979, -0.011534044848910222, 0.020973523225014407, -0.13520774142428613, -0.23216836526989937, 0.41046942009901005, -0.020133908508190263, 0.10403376998632059, 0.08249244622614545, 0.06510772096225992, -0.028473487463391695, -0.051293985675632335, -0.02666514830317131, -0.23525637758818144, 0.1138666964834556, 0.2195670133611808, 0.1450714191305451, 0.26539364515338093, -0.31404441636793007, -0.1584332689526491, 0.2110162465251051, 0.11510776059973675, -0.011098338601489862, -0.02926306090860938, -0.2364836718964701, 0.15821096568834037, -0.12494798330590129, -0.1973902077782744, -0.08800986787537113, 0.054821943204539515, 0.09651838021333485, -0.28644842757300165, 0.028572223343265552, 0.1333798641183724, 0.10316552640870214, -0.11740490038694891, -0.2219758714782074, 0.018194219514649983, 0.1256392237264663, 0.041305107549609, -0.008724927974981256, 0.05533464920396606, -0.1166247061676889, -0.06200154160615057, 0.3383262899199811, -0.033328946970868856, -0.23887060402194038, 0.11261124425800517, -0.19193377415649593, -0.2254006942481889, 0.004562617291715772, 0.12465408745144184, 0.18927636560207853, -0.09750184395428126, 0.1609964512354054, -0.04334345898435762, 0.08925335896977533, 0.08421111455148396, 0.06096663085433344, 0.04404838879903158, 0.06376431477838196, 0.10767941892603024, 0.12178474565735087, -0.013060511322692037, -0.05657839627626041, -0.4267634929468234, -0.18237526464508846, -0.09486255748197436, 0.060381633772825204, -0.14390863521809175, -0.1574465533873687, 0.4292378663085401, 0.12564264761749655, 0.21920973420492373, 0.10625430891135086, 0.171919805657429, 0.14968302593721697, -0.030920645581015076, 0.04801042135416841, 0.14869034279278517, 0.1382140041484187, 0.061767619042560305, -0.12895361887058243, 0.0074506936653051525, 0.10391456228292857] |
1,802.01829 | Average Case $(s, t)$-weak tractability of non-homogenous tensor product
problems | We study $d$-variate problem in the average case setting with respect to a
zero-mean Gaussian measure. The covariance kernel of this Gaussian measure is a
product of univariate kernels and satisfies some special properties. We study
$(s, t)$-weak tractability of this multivariate problem, and obtain a necessary
and sufficient condition for $s>0$ and $t\in(0,1)$. Our result can apply to the
problems with covariance kernels corresponding to Euler and Wiener integrated
processes, Korobov kernels, and analytic Korobov kernels.
| math.NA | we study dvariate problem in the average case setting with respect to a zeromean gaussian measure the covariance kernel of this gaussian measure is a product of univariate kernels and satisfies some special properties we study s tweak tractability of this multivariate problem and obtain a necessary and sufficient condition for s0 and tin01 our result can apply to the problems with covariance kernels corresponding to euler and wiener integrated processes korobov kernels and analytic korobov kernels | [['we', 'study', 'dvariate', 'problem', 'in', 'the', 'average', 'case', 'setting', 'with', 'respect', 'to', 'a', 'zeromean', 'gaussian', 'measure', 'the', 'covariance', 'kernel', 'of', 'this', 'gaussian', 'measure', 'is', 'a', 'product', 'of', 'univariate', 'kernels', 'and', 'satisfies', 'some', 'special', 'properties', 'we', 'study', 's', 'tweak', 'tractability', 'of', 'this', 'multivariate', 'problem', 'and', 'obtain', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 's0', 'and', 'tin01', 'our', 'result', 'can', 'apply', 'to', 'the', 'problems', 'with', 'covariance', 'kernels', 'corresponding', 'to', 'euler', 'and', 'wiener', 'integrated', 'processes', 'korobov', 'kernels', 'and', 'analytic', 'korobov', 'kernels']] | [-0.06130450384618787, -0.01736291439435747, -0.0976572601584258, 0.14355684420571652, -0.0931503313666137, -0.125347001786501, 0.018219409667729558, 0.4104124957229942, -0.27805428274653177, -0.18810966115387448, 0.1577729215745681, -0.24253770688476115, -0.15946366995960087, 0.18541808078948457, -0.09008918177675117, 0.1540045209664416, 0.0735723042540107, 0.001637481503769175, -0.11239744193077862, -0.2573588663657716, 0.3642588295405368, 0.02995649628437959, 0.2111213482650263, 0.010768720057684106, 0.12825879895479067, 0.008485321306272761, -0.08260137051670485, -0.05852010410714459, -0.17690989599478515, 0.08529024919821554, 0.24214161284171143, 0.1241006435971562, 0.3159820605553203, -0.35037411529232154, -0.16301396760073575, 0.22957182603634216, 0.08436190902993276, -0.032944175959020466, 0.05456481878827145, -0.2824514380250997, 0.09064398743454125, -0.11329542482634644, -0.14493814683458828, -0.09256448027641549, 0.000741568227697696, 0.057309233770983944, -0.4304590784980879, 0.10211236112110027, 0.13688248449138232, 0.007299845699559559, -0.07441638709445085, -0.13719137192570738, 0.08080408417668145, 0.04303971111363211, 0.0005689261136455582, 0.028233355417690398, 0.061398462682672135, -0.08133570563846401, -0.11008004155372839, 0.31822377449965905, -0.0823983630806498, -0.3206640996958141, 0.15764301301693762, -0.1682623556585281, -0.11999698159853359, 0.07016380414118772, 0.21177489927201834, 0.11120138083911174, -0.15378956959353057, 0.1556389890807717, -0.06859355594043608, 0.07161309526531727, 0.08038580825237872, 0.0191511469711731, 0.02183795791095147, 0.06696583067562867, 0.13800843960799083, 0.23279858830191388, -0.04370776679391017, -0.10014602419158275, -0.3341188189851773, -0.1962209553155419, -0.19483777031592733, 0.07079387227581306, -0.17945820727429426, -0.21911280544160247, 0.37687478109879735, 0.10186524328763609, 0.21435801837859408, 0.17171162583369326, 0.23235951835144456, 0.19950833337686882, -0.012995975802640444, 0.09674014895549649, 0.05376531505487049, 0.26732795129155185, 0.07364680988157725, -0.1323098721490665, 0.06466758808169465, 0.07850407069403824] |
1,802.0183 | A Neurobiologically Motivated Analysis of Distributional Semantic Models | The pervasive use of distributional semantic models or word embeddings in a
variety of research fields is due to their remarkable ability to represent the
meanings of words for both practical application and cognitive modeling.
However, little has been known about what kind of information is encoded in
text-based word vectors. This lack of understanding is particularly problematic
when word vectors are regarded as a model of semantic representation for
abstract concepts. This paper attempts to reveal the internal information of
distributional word vectors by the analysis using Binder et al.'s (2016)
brain-based vectors, explicitly structured conceptual representations based on
neurobiologically motivated attributes. In the analysis, the mapping from
text-based vectors to brain-based vectors is trained and prediction performance
is evaluated by comparing the estimated and original brain-based vectors. The
analysis demonstrates that social and cognitive information is better encoded
in text-based word vectors, but emotional information is not. This result is
discussed in terms of embodied theories for abstract concepts.
| cs.CL q-bio.NC | the pervasive use of distributional semantic models or word embeddings in a variety of research fields is due to their remarkable ability to represent the meanings of words for both practical application and cognitive modeling however little has been known about what kind of information is encoded in textbased word vectors this lack of understanding is particularly problematic when word vectors are regarded as a model of semantic representation for abstract concepts this paper attempts to reveal the internal information of distributional word vectors by the analysis using binder et als 2016 brainbased vectors explicitly structured conceptual representations based on neurobiologically motivated attributes in the analysis the mapping from textbased vectors to brainbased vectors is trained and prediction performance is evaluated by comparing the estimated and original brainbased vectors the analysis demonstrates that social and cognitive information is better encoded in textbased word vectors but emotional information is not this result is discussed in terms of embodied theories for abstract concepts | [['the', 'pervasive', 'use', 'of', 'distributional', 'semantic', 'models', 'or', 'word', 'embeddings', 'in', 'a', 'variety', 'of', 'research', 'fields', 'is', 'due', 'to', 'their', 'remarkable', 'ability', 'to', 'represent', 'the', 'meanings', 'of', 'words', 'for', 'both', 'practical', 'application', 'and', 'cognitive', 'modeling', 'however', 'little', 'has', 'been', 'known', 'about', 'what', 'kind', 'of', 'information', 'is', 'encoded', 'in', 'textbased', 'word', 'vectors', 'this', 'lack', 'of', 'understanding', 'is', 'particularly', 'problematic', 'when', 'word', 'vectors', 'are', 'regarded', 'as', 'a', 'model', 'of', 'semantic', 'representation', 'for', 'abstract', 'concepts', 'this', 'paper', 'attempts', 'to', 'reveal', 'the', 'internal', 'information', 'of', 'distributional', 'word', 'vectors', 'by', 'the', 'analysis', 'using', 'binder', 'et', 'als', '2016', 'brainbased', 'vectors', 'explicitly', 'structured', 'conceptual', 'representations', 'based', 'on', 'neurobiologically', 'motivated', 'attributes', 'in', 'the', 'analysis', 'the', 'mapping', 'from', 'textbased', 'vectors', 'to', 'brainbased', 'vectors', 'is', 'trained', 'and', 'prediction', 'performance', 'is', 'evaluated', 'by', 'comparing', 'the', 'estimated', 'and', 'original', 'brainbased', 'vectors', 'the', 'analysis', 'demonstrates', 'that', 'social', 'and', 'cognitive', 'information', 'is', 'better', 'encoded', 'in', 'textbased', 'word', 'vectors', 'but', 'emotional', 'information', 'is', 'not', 'this', 'result', 'is', 'discussed', 'in', 'terms', 'of', 'embodied', 'theories', 'for', 'abstract', 'concepts']] | [-0.05932403420769141, 0.04287144860038707, -0.05734498013730699, 0.12766789034173842, -0.17793761673875108, -0.11589930577041663, 0.03750970909843418, 0.40048306092319097, -0.31139405218664534, -0.2967100702312931, 0.0771213225631321, -0.2881769271428633, -0.21818945592309794, 0.1674082082734582, -0.1462495362108446, 0.0489143922155642, 0.07535146737633192, 0.11555590633135174, -0.06587292652097039, -0.24697233018152068, 0.3361377825943163, 0.06524610913775121, 0.349830326126738, 0.0020982406842551247, 0.13614101331357076, 0.010051981343523315, -0.11902045488056744, -0.02798300117300534, -0.04473138251942937, 0.2179346349696276, 0.386146564363009, 0.24426599339616734, 0.30482619080652035, -0.375786899710479, -0.24927552634422084, 0.0661949379874324, 0.1457648979697336, 0.12233467816349165, 0.0037245184337859104, -0.37295755543832826, 0.09964259423934478, -0.1531692634550681, 0.013175526755335539, -0.129182112384414, 0.0315055475622323, -0.021367276901587472, -0.21830978102386228, 0.04860420061581947, 0.14414229005215812, 0.12098252211599062, -0.06508398851848306, -0.1233835426688495, 0.01935356985112386, 0.16922611239751634, 0.06640078749736157, 0.07858356409735098, 0.1107407292316419, -0.16874091067027464, -0.17379577901476115, 0.4054659518257061, -0.02008366184771894, -0.2683393856838074, 0.20111299033265168, -0.04916894505876377, -0.1282708061778027, 0.039098078069011014, 0.188227580414842, 0.033280551896332215, -0.17714499502837938, 0.05388102708030087, -0.07814041443707086, 0.20671179328802164, 0.08383987457867458, 0.06538497844872915, 0.2056271799424987, 0.19694306976443898, -0.057484516926017235, 0.09764314021463998, -0.009482278221038094, -0.08009533570524051, -0.19537558429729865, -0.15313567371420006, -0.2107299953548712, -0.01611804955424553, -0.10968243021927253, -0.1375096459158621, 0.37949134765759757, 0.22484047182181977, 0.19363248787866616, 0.04812577747745636, 0.2961043086400406, 0.05512749221138309, 0.07661995796236551, 0.07233231427055431, 0.14038278102897894, 0.08589188579574042, 0.11486601052366151, -0.09870674546847051, 0.16435010181826695, 0.09491392619971487] |
1,802.01831 | Estimate for norm of a composition operator on the Hardy-Dirichlet space | By using the Schur test, we give some upper and lower estimates on the norm
of a composition operator on $\mathcal{H}^2$, the space of Dirichlet series
with square summable coefficients, for the inducing symbol
$\varphi(s)=c_1+c_{q}q^{-s}$ where $q\geq 2$ is a fixed integer. We also give
an estimate on the approximation numbers of such an operator.
| math.FA | by using the schur test we give some upper and lower estimates on the norm of a composition operator on mathcalh2 the space of dirichlet series with square summable coefficients for the inducing symbol varphisc_1c_qqs where qgeq 2 is a fixed integer we also give an estimate on the approximation numbers of such an operator | [['by', 'using', 'the', 'schur', 'test', 'we', 'give', 'some', 'upper', 'and', 'lower', 'estimates', 'on', 'the', 'norm', 'of', 'a', 'composition', 'operator', 'on', 'mathcalh2', 'the', 'space', 'of', 'dirichlet', 'series', 'with', 'square', 'summable', 'coefficients', 'for', 'the', 'inducing', 'symbol', 'varphisc_1c_qqs', 'where', 'qgeq', '2', 'is', 'a', 'fixed', 'integer', 'we', 'also', 'give', 'an', 'estimate', 'on', 'the', 'approximation', 'numbers', 'of', 'such', 'an', 'operator']] | [-0.13811306536404622, 0.1027474358933331, -0.05735710451295341, 0.0623139811235618, -0.06239677985905911, -0.0934164256926764, 0.03608741224053557, 0.33306695708867023, -0.2823952384362066, -0.21751168170185, 0.18256139822511208, -0.28126974764314516, -0.1367891003276411, 0.21639733063488234, -0.047945129228065965, 0.03040227042166171, 0.015359630627143715, 0.13939404572118763, -0.12690722111060662, -0.25449772279157684, 0.3640303512069362, 0.029729594942182302, 0.13588841249131495, 0.06495593288154514, 0.11406680231017095, 0.011545568540761317, -0.012613298414550998, -0.08220366066962015, -0.21333643800958438, 0.1378779711322514, 0.18117277597991266, 0.07218624259069285, 0.2884027661272773, -0.4038188004590295, -0.11069389170518627, 0.16111975778066726, 0.10858921142708924, -0.04220364232444101, -0.03861656289815006, -0.23946573245511563, 0.10771021690150653, -0.13380104030861897, -0.10970939551825049, -0.09281953477680131, 0.02414919560154279, 0.053066740142336734, -0.4047736664199167, 0.04503803096088598, 0.10666547005099279, 0.11645872684365949, -0.12923473297376875, -0.21095821585644176, 0.06172753473812783, 0.08672499854152126, -0.017253018868224765, 0.04027044181539505, 0.011551341542077286, -0.08547416705362222, -0.10061645316373971, 0.30304059386253357, -0.11329074612715179, -0.29694142668611473, 0.09251366871305639, -0.1891687907261291, -0.11853089330166026, 0.05985287152644661, 0.1666082232431681, 0.13538533911384917, -0.02833633392152411, 0.16636992632131162, -0.11836481981596013, 0.15638766222185008, 0.09390785263989258, 0.015923428176729766, 0.08885999848307283, 0.06397279603751721, 0.1883026256777898, 0.16565497439458138, -0.05617934554660072, -0.02670171567135387, -0.3752492984963788, -0.1736036021805679, -0.24859589729803028, 0.08504407694218336, -0.17908443997725113, -0.23748718283173662, 0.3734786887739406, 0.07951241015905032, 0.2369846117993196, 0.12499763064638332, 0.2238773649075517, 0.2278820542808346, 0.019736576739146753, 0.05980239840465839, 0.10932492819470267, 0.1490409234236857, 0.006275353082283227, -0.17422597456068076, 0.038390930319480876, 0.21793021820485592] |
1,802.01832 | Chiral density wave versus pion condensation at finite density | The quark-meson model is often used as an effective low-energy model for QCD
to study the chiral transition at finite temperature $T$, baryon chemical
potential $\mu_B$, and isospin chemical potential $\mu_I$. The parameters of
the model are determined by matching the meson and quark masses, as well as the
pion decay constant to their physical values using the on-shell and modified
minimal subtraction schemes. In this paper, we study the possibility of
different phases at zero temperature. In particular, we investigate the
competition between an inhomogeneous chiral condensate and a pion condensate.
For the inhomogeneity, we use a chiral-density wave ansatz. For a sigma mass of
$600$ MeV, we find that an inhomogeneous chiral condensate exist only for pion
masses below approximately 37 MeV. We also show that due to our parameter
fixing, the onset of pion condensation takes place exactly at
$\mu_I={1\over2}m_{\pi}$ in accordance with exact results.
| hep-ph | the quarkmeson model is often used as an effective lowenergy model for qcd to study the chiral transition at finite temperature t baryon chemical potential mu_b and isospin chemical potential mu_i the parameters of the model are determined by matching the meson and quark masses as well as the pion decay constant to their physical values using the onshell and modified minimal subtraction schemes in this paper we study the possibility of different phases at zero temperature in particular we investigate the competition between an inhomogeneous chiral condensate and a pion condensate for the inhomogeneity we use a chiraldensity wave ansatz for a sigma mass of 600 mev we find that an inhomogeneous chiral condensate exist only for pion masses below approximately 37 mev we also show that due to our parameter fixing the onset of pion condensation takes place exactly at mu_i1over2m_pi in accordance with exact results | [['the', 'quarkmeson', 'model', 'is', 'often', 'used', 'as', 'an', 'effective', 'lowenergy', 'model', 'for', 'qcd', 'to', 'study', 'the', 'chiral', 'transition', 'at', 'finite', 'temperature', 't', 'baryon', 'chemical', 'potential', 'mu_b', 'and', 'isospin', 'chemical', 'potential', 'mu_i', 'the', 'parameters', 'of', 'the', 'model', 'are', 'determined', 'by', 'matching', 'the', 'meson', 'and', 'quark', 'masses', 'as', 'well', 'as', 'the', 'pion', 'decay', 'constant', 'to', 'their', 'physical', 'values', 'using', 'the', 'onshell', 'and', 'modified', 'minimal', 'subtraction', 'schemes', 'in', 'this', 'paper', 'we', 'study', 'the', 'possibility', 'of', 'different', 'phases', 'at', 'zero', 'temperature', 'in', 'particular', 'we', 'investigate', 'the', 'competition', 'between', 'an', 'inhomogeneous', 'chiral', 'condensate', 'and', 'a', 'pion', 'condensate', 'for', 'the', 'inhomogeneity', 'we', 'use', 'a', 'chiraldensity', 'wave', 'ansatz', 'for', 'a', 'sigma', 'mass', 'of', '600', 'mev', 'we', 'find', 'that', 'an', 'inhomogeneous', 'chiral', 'condensate', 'exist', 'only', 'for', 'pion', 'masses', 'below', 'approximately', '37', 'mev', 'we', 'also', 'show', 'that', 'due', 'to', 'our', 'parameter', 'fixing', 'the', 'onset', 'of', 'pion', 'condensation', 'takes', 'place', 'exactly', 'at', 'mu_i1over2m_pi', 'in', 'accordance', 'with', 'exact', 'results']] | [-0.09055201671772073, 0.2674250980599769, -0.05970175865543436, 0.09691481944807127, -0.01757765462389216, -0.08779955746092814, 0.10550960651392965, 0.357655515770751, -0.17489213868658862, -0.2643284456215191, -0.006616602076033802, -0.28681663440249, -0.04389490262244125, 0.08521742576600186, 0.08646367708233749, 0.0524779126598685, -0.03314345227364374, 0.06532528698697787, -0.1042957444054385, -0.19988747206231466, 0.3618407586374048, 0.008425156750595894, 0.2336268601242174, 0.18064203646768923, 0.07481338767981043, -0.020066671958826734, 0.03884947605329712, -0.03956590427820678, -0.18393160861199737, -0.026540399120398322, 0.1864579072040759, -0.012651101812770982, 0.14671311415985328, -0.3488571926837369, -0.20841640655385318, 0.1273885087258987, 0.16328985329565346, 0.18004329996753712, -0.04730185664034778, -0.2703509090759722, 0.07709877050741493, -0.20466092975531408, -0.2195841037972393, -0.11400939296728292, 0.012951223955800137, -0.030785379630393114, -0.31653283307721625, 0.12560336697778543, -0.04163128436546215, 0.046940809320484216, -0.09098162423806633, -0.19995046214384288, -0.035595887369115134, 0.07023218154058265, 0.08412867019405956, 0.09225593971208904, 0.13952839382461646, -0.16567257467220176, -0.06315119035199893, 0.4267646245987845, -0.10955930234338505, -0.11491462116056046, 0.1204728022198744, -0.11561325266270274, -0.0971935548800595, 0.11413968027867123, 0.1587759105636751, 0.07074443199259996, -0.1777948559749694, 0.0922135745038969, -0.035934436176075966, 0.18818145919809764, 0.11504533416496551, 0.023623521883218063, 0.24466893108891083, 0.17995298019654693, -0.012619447183231412, 0.07539642431304416, -0.05920858319443302, -0.11054163676414157, -0.3546984388879469, -0.0841787548705644, -0.15303995410537943, 0.044100268294406754, -0.1352655393872125, -0.13576822340501105, 0.38164619721953763, 0.16751284320636012, 0.24833124642558144, 0.019639715945132735, 0.29245987390389755, 0.1217121369075537, 0.07087754401802814, 0.054576633966901676, 0.24767695672391932, 0.18861334104578764, 0.12783489149494642, -0.31215090358108727, -0.06320057161228389, 0.06890437563526489] |
1,802.01833 | How far can neural correlations reduce uncertainty? Comparison of
Information Transmission Rates for Markov and Bernoulli processes | The nature of neural codes is central to neuroscience. Do neurons encode
information through relatively slow changes in the emission rates of individual
spikes (rate code), or by the precise timing of every spike (temporal codes)?
Here we compare the loss of information due to correlations for these two
possible neural codes. The essence of Shannon's definition of information is to
combine information with uncertainty: the higher the uncertainty of a given
event, the more information is conveyed by that event. Correlations can reduce
uncertainty or the amount of information, but by how much? In this paper we
address this question by a direct comparison of the information per symbol
conveyed by the words coming from a binary Markov source (temporal codes) with
the information per symbol coming from the corresponding Bernoulli source
(uncorrelated, rate code source). In a previous paper we found that a crucial
role in the relation between Information Transmission Rates (ITR) and Firing
Rates is played by a parameter s, which is the sum of transitions probabilities
from the no-spike-state to the spike-state and vice versa. It turned out that
also in this case a crucial role is played by the same parameter s. We found
bounds of the quotient of ITRs for these sources, i.e. this quotient's minimal
and maximal values. Next, making use of the entropy grouping axiom, we
determined the loss of information in a Markov source in relation to its
corresponding Bernoulli source for a given length of word. Our results show
that in practical situations in the case of correlated signals the loss of
information is relatively small, thus temporal codes, which are more
energetically efficient, can replace the rate code effectively. These phenomena
were confirmed by experiments.
| q-bio.QM | the nature of neural codes is central to neuroscience do neurons encode information through relatively slow changes in the emission rates of individual spikes rate code or by the precise timing of every spike temporal codes here we compare the loss of information due to correlations for these two possible neural codes the essence of shannons definition of information is to combine information with uncertainty the higher the uncertainty of a given event the more information is conveyed by that event correlations can reduce uncertainty or the amount of information but by how much in this paper we address this question by a direct comparison of the information per symbol conveyed by the words coming from a binary markov source temporal codes with the information per symbol coming from the corresponding bernoulli source uncorrelated rate code source in a previous paper we found that a crucial role in the relation between information transmission rates itr and firing rates is played by a parameter s which is the sum of transitions probabilities from the nospikestate to the spikestate and vice versa it turned out that also in this case a crucial role is played by the same parameter s we found bounds of the quotient of itrs for these sources ie this quotients minimal and maximal values next making use of the entropy grouping axiom we determined the loss of information in a markov source in relation to its corresponding bernoulli source for a given length of word our results show that in practical situations in the case of correlated signals the loss of information is relatively small thus temporal codes which are more energetically efficient can replace the rate code effectively these phenomena were confirmed by experiments | [['the', 'nature', 'of', 'neural', 'codes', 'is', 'central', 'to', 'neuroscience', 'do', 'neurons', 'encode', 'information', 'through', 'relatively', 'slow', 'changes', 'in', 'the', 'emission', 'rates', 'of', 'individual', 'spikes', 'rate', 'code', 'or', 'by', 'the', 'precise', 'timing', 'of', 'every', 'spike', 'temporal', 'codes', 'here', 'we', 'compare', 'the', 'loss', 'of', 'information', 'due', 'to', 'correlations', 'for', 'these', 'two', 'possible', 'neural', 'codes', 'the', 'essence', 'of', 'shannons', 'definition', 'of', 'information', 'is', 'to', 'combine', 'information', 'with', 'uncertainty', 'the', 'higher', 'the', 'uncertainty', 'of', 'a', 'given', 'event', 'the', 'more', 'information', 'is', 'conveyed', 'by', 'that', 'event', 'correlations', 'can', 'reduce', 'uncertainty', 'or', 'the', 'amount', 'of', 'information', 'but', 'by', 'how', 'much', 'in', 'this', 'paper', 'we', 'address', 'this', 'question', 'by', 'a', 'direct', 'comparison', 'of', 'the', 'information', 'per', 'symbol', 'conveyed', 'by', 'the', 'words', 'coming', 'from', 'a', 'binary', 'markov', 'source', 'temporal', 'codes', 'with', 'the', 'information', 'per', 'symbol', 'coming', 'from', 'the', 'corresponding', 'bernoulli', 'source', 'uncorrelated', 'rate', 'code', 'source', 'in', 'a', 'previous', 'paper', 'we', 'found', 'that', 'a', 'crucial', 'role', 'in', 'the', 'relation', 'between', 'information', 'transmission', 'rates', 'itr', 'and', 'firing', 'rates', 'is', 'played', 'by', 'a', 'parameter', 's', 'which', 'is', 'the', 'sum', 'of', 'transitions', 'probabilities', 'from', 'the', 'nospikestate', 'to', 'the', 'spikestate', 'and', 'vice', 'versa', 'it', 'turned', 'out', 'that', 'also', 'in', 'this', 'case', 'a', 'crucial', 'role', 'is', 'played', 'by', 'the', 'same', 'parameter', 's', 'we', 'found', 'bounds', 'of', 'the', 'quotient', 'of', 'itrs', 'for', 'these', 'sources', 'ie', 'this', 'quotients', 'minimal', 'and', 'maximal', 'values', 'next', 'making', 'use', 'of', 'the', 'entropy', 'grouping', 'axiom', 'we', 'determined', 'the', 'loss', 'of', 'information', 'in', 'a', 'markov', 'source', 'in', 'relation', 'to', 'its', 'corresponding', 'bernoulli', 'source', 'for', 'a', 'given', 'length', 'of', 'word', 'our', 'results', 'show', 'that', 'in', 'practical', 'situations', 'in', 'the', 'case', 'of', 'correlated', 'signals', 'the', 'loss', 'of', 'information', 'is', 'relatively', 'small', 'thus', 'temporal', 'codes', 'which', 'are', 'more', 'energetically', 'efficient', 'can', 'replace', 'the', 'rate', 'code', 'effectively', 'these', 'phenomena', 'were', 'confirmed', 'by', 'experiments']] | [-0.12105611119778795, 0.12034498349305961, -0.05346022093047698, 0.12566979557332958, -0.054994414998381806, -0.13663813704461383, 0.09575997630804124, 0.36961499664507674, -0.31890784261682836, -0.2902777647289137, 0.11848996384600341, -0.29597418342079773, -0.13671347280768187, 0.20346629608549144, -0.09068436116560183, 0.02990817700930373, 0.08305681785731985, 0.09923458369122001, -0.08127725846746839, -0.24949818351060937, 0.32344068284228183, 0.12751748489804174, 0.2648927218844428, 0.03548550636899707, 0.10573896113456341, -0.0011741066226948118, -0.09321278173705204, -0.020762821734605127, -0.12407548920988726, 0.1503759083107549, 0.28001991157499634, 0.16978609113782447, 0.2810159028736515, -0.39597127309606184, -0.2497329677830924, 0.11156697187638073, 0.13009312384672006, 0.12496222696295661, -0.02715054814705805, -0.24436669662848048, 0.07262331970820302, -0.17133386021627015, -0.034265929257922004, -0.016153711221066482, 0.029541589179190628, 0.028371224366128444, -0.2721232352578163, 0.08779260930942225, 0.10232893813997834, 0.044730891333024936, -0.010908311569099233, -0.05532471950966538, -0.03458718294359482, 0.1722390688547309, 0.039046436579685595, 0.03673919320081998, 0.09682121305591672, -0.13031044111407378, -0.12289160049863551, 0.34135308740517584, -0.040663702695797964, -0.21529486565799616, 0.12639097071399813, -0.13531408836705644, -0.11358457625396305, 0.1444494850051246, 0.159197377125945, 0.09927578984204222, -0.16177695189529148, 0.0007465025426395107, -0.008116633779156888, 0.22350002552480683, 0.07627118513674329, 0.09937310567321746, 0.22280806757411675, 0.1250447931585082, 0.016110654844771744, 0.16439402402386788, -0.10467093084661061, -0.09221671787764583, -0.2763952286985474, -0.11835393047556608, -0.17921325986910808, 0.03801803131293702, -0.1000188400047288, -0.09235238718918705, 0.36646777942384545, 0.170415632503532, 0.19751587515010646, 0.05186256308255619, 0.27816442474477776, 0.08585042811423671, 0.07483275910398286, 0.08141276457739112, 0.19582261707748105, 0.12754110502969604, 0.06914375578788551, -0.19887440773789167, 0.13112804649495766, 0.0483196065597759] |
1,802.01834 | The Labyrinth of Quantum Logic | Quantum mechanics predicts many surprising phenomena, including the two-slit
interference of electrons. It has often been claimed that these phenomena
cannot be understood in classical terms. But the meaning of "classical" is
often not precisely specified. One might, for example, interpret it as
"classical physics" or "classical logic" or "classical probability theory".
Quantum mechanics also suffers from a conceptual difficulty known as the
measurement problem. Early in his career, Hilary Putnam believed that
modifications of classical logic could both solve the measurement problem and
account for the two-slit phenomena. Over 40 years later he had abandoned
quantum logic in favor of the investigation of various theories--using
classical logic and probability theory--that can accomplish these tasks. The
trajectory from Putnam's earlier views to his later views illustrates the
difficulty trying to solve physical problems with alterations of logic or
mathematics.
| physics.hist-ph quant-ph | quantum mechanics predicts many surprising phenomena including the twoslit interference of electrons it has often been claimed that these phenomena cannot be understood in classical terms but the meaning of classical is often not precisely specified one might for example interpret it as classical physics or classical logic or classical probability theory quantum mechanics also suffers from a conceptual difficulty known as the measurement problem early in his career hilary putnam believed that modifications of classical logic could both solve the measurement problem and account for the twoslit phenomena over 40 years later he had abandoned quantum logic in favor of the investigation of various theoriesusing classical logic and probability theorythat can accomplish these tasks the trajectory from putnams earlier views to his later views illustrates the difficulty trying to solve physical problems with alterations of logic or mathematics | [['quantum', 'mechanics', 'predicts', 'many', 'surprising', 'phenomena', 'including', 'the', 'twoslit', 'interference', 'of', 'electrons', 'it', 'has', 'often', 'been', 'claimed', 'that', 'these', 'phenomena', 'can', 'not', 'be', 'understood', 'in', 'classical', 'terms', 'but', 'the', 'meaning', 'of', 'classical', 'is', 'often', 'not', 'precisely', 'specified', 'one', 'might', 'for', 'example', 'interpret', 'it', 'as', 'classical', 'physics', 'or', 'classical', 'logic', 'or', 'classical', 'probability', 'theory', 'quantum', 'mechanics', 'also', 'suffers', 'from', 'a', 'conceptual', 'difficulty', 'known', 'as', 'the', 'measurement', 'problem', 'early', 'in', 'his', 'career', 'hilary', 'putnam', 'believed', 'that', 'modifications', 'of', 'classical', 'logic', 'could', 'both', 'solve', 'the', 'measurement', 'problem', 'and', 'account', 'for', 'the', 'twoslit', 'phenomena', 'over', '40', 'years', 'later', 'he', 'had', 'abandoned', 'quantum', 'logic', 'in', 'favor', 'of', 'the', 'investigation', 'of', 'various', 'theoriesusing', 'classical', 'logic', 'and', 'probability', 'theorythat', 'can', 'accomplish', 'these', 'tasks', 'the', 'trajectory', 'from', 'putnams', 'earlier', 'views', 'to', 'his', 'later', 'views', 'illustrates', 'the', 'difficulty', 'trying', 'to', 'solve', 'physical', 'problems', 'with', 'alterations', 'of', 'logic', 'or', 'mathematics']] | [-0.049710072746178766, 0.101718939464747, -0.14694604427694416, 0.16763475191487978, -0.12971046985220835, -0.200687878464496, 0.03111959245179867, 0.29471358373801376, -0.3062890317398224, -0.37364152309705884, 0.06624463999228512, -0.23792856106226393, -0.18267761014582817, 0.20920847443547166, -0.18950919888699228, 0.06540239946045678, 0.04360825770949985, 0.05677962810363915, -0.04001234537124527, -0.2559090873214798, 0.23659863252956553, 0.04467508496579265, 0.24975002898077528, 0.04609351481223921, 0.06876853675574815, 0.040348463457265345, -0.017015902338911305, 0.04464806832135287, -0.05124635608892355, 0.053959357282548824, 0.34328085646408496, 0.19455997416541893, 0.3297234050185828, -0.48072479409333185, -0.25850804761159335, 0.09948892982277965, 0.1345335957929224, 0.1479840380560084, 0.010659931713326586, -0.29671287369117033, -0.006497873266591027, -0.1517758736045187, -0.11963383574038744, -0.035731139416109586, 0.023040624124981236, -0.04648153911338007, -0.14386343727518114, 0.0606112230094669, 0.12521902753857614, 0.04767086301601941, 0.008572137929673353, -0.10792464807147173, 0.0650926632078016, 0.10982723173135958, 0.03964300174098596, 0.01996303182899309, 0.1267572727687523, -0.12048788244413922, -0.25126245133779784, 0.42608918988635, 0.061069435901058795, -0.14165128652247594, 0.20742519668859544, -0.12839550623777424, -0.15493029999385902, 0.08287073768970134, 0.06791178629525917, 0.07314073501771196, -0.13523986253203998, 0.08867121079732268, -0.02219167629779457, 0.14309037406091318, 0.11546745269874231, 0.0692213394663635, 0.24055201889906855, 0.08345633306919108, -0.03729191866725107, 0.0763942814614664, 0.00132332069015385, -0.20422492389359492, -0.2765945260205286, -0.15878356046716702, -0.1485780759399636, 0.09921178959746403, 0.0017397800435750954, -0.1303444454687641, 0.32144359658679944, 0.1559353440538511, 0.11471431153632111, 0.015991973945294783, 0.28851046784037204, 0.10270525652600332, 0.05612083788200704, -0.01000802271677811, 0.2668061581601074, 0.14677503013735463, 0.16301282847605028, -0.14454970890053098, 0.14121366876659902, 0.050810660386337435] |
1,802.01835 | Quantum Zeno dynamics of a matter-wave bright soliton | The quantum measurement problem, namely how the deterministic quantum
evolution leads to probabilistic measurement outcomes, remains a profound
question to be answered. In the present work, we propose a spectacular
demonstration and test of the subtle and peculiar character of the quantum
measurement process. We show that a bright soliton supported by a Bose-Einstein
condensate can be reflected as a whole by an electron beam, with neither
attraction nor repulsion between the condensate's neutral atoms and the beam's
electrons. This macroscopic reflection is purely due to the quantum Zeno
dynamics induced by the frequent position measurement of the condensate's atoms
by the electron beam. As an example of application, just as a soccer player
would stop a coming ball, an electron beam moving backward with half the
velocity of the bright soliton can precisely stop the soliton. This offers an
entirely new and useful tool for manipulating bright solitons.
| quant-ph | the quantum measurement problem namely how the deterministic quantum evolution leads to probabilistic measurement outcomes remains a profound question to be answered in the present work we propose a spectacular demonstration and test of the subtle and peculiar character of the quantum measurement process we show that a bright soliton supported by a boseeinstein condensate can be reflected as a whole by an electron beam with neither attraction nor repulsion between the condensates neutral atoms and the beams electrons this macroscopic reflection is purely due to the quantum zeno dynamics induced by the frequent position measurement of the condensates atoms by the electron beam as an example of application just as a soccer player would stop a coming ball an electron beam moving backward with half the velocity of the bright soliton can precisely stop the soliton this offers an entirely new and useful tool for manipulating bright solitons | [['the', 'quantum', 'measurement', 'problem', 'namely', 'how', 'the', 'deterministic', 'quantum', 'evolution', 'leads', 'to', 'probabilistic', 'measurement', 'outcomes', 'remains', 'a', 'profound', 'question', 'to', 'be', 'answered', 'in', 'the', 'present', 'work', 'we', 'propose', 'a', 'spectacular', 'demonstration', 'and', 'test', 'of', 'the', 'subtle', 'and', 'peculiar', 'character', 'of', 'the', 'quantum', 'measurement', 'process', 'we', 'show', 'that', 'a', 'bright', 'soliton', 'supported', 'by', 'a', 'boseeinstein', 'condensate', 'can', 'be', 'reflected', 'as', 'a', 'whole', 'by', 'an', 'electron', 'beam', 'with', 'neither', 'attraction', 'nor', 'repulsion', 'between', 'the', 'condensates', 'neutral', 'atoms', 'and', 'the', 'beams', 'electrons', 'this', 'macroscopic', 'reflection', 'is', 'purely', 'due', 'to', 'the', 'quantum', 'zeno', 'dynamics', 'induced', 'by', 'the', 'frequent', 'position', 'measurement', 'of', 'the', 'condensates', 'atoms', 'by', 'the', 'electron', 'beam', 'as', 'an', 'example', 'of', 'application', 'just', 'as', 'a', 'soccer', 'player', 'would', 'stop', 'a', 'coming', 'ball', 'an', 'electron', 'beam', 'moving', 'backward', 'with', 'half', 'the', 'velocity', 'of', 'the', 'bright', 'soliton', 'can', 'precisely', 'stop', 'the', 'soliton', 'this', 'offers', 'an', 'entirely', 'new', 'and', 'useful', 'tool', 'for', 'manipulating', 'bright', 'solitons']] | [-0.11096962804174763, 0.22018588144658757, -0.10642172613543702, 0.0787540322507017, -0.05708461207331427, -0.17946731814514572, 0.05871256898394036, 0.36959973710820376, -0.26665204903423384, -0.2701960454801185, 0.0449497906261455, -0.26865861288915643, -0.08086499693372205, 0.18299058499596013, -0.04018425252663609, 0.04937577797037443, 0.08148355987673038, -0.0035090719899725192, -0.00594287922437109, -0.19309230141447944, 0.325587498280376, 0.060766375311119045, 0.2465648733379457, 0.09122042968906713, 0.11135602222080498, 0.04117610178662826, 0.03744783529374224, -0.014963582303412508, -0.11939773153250563, 0.0802387417967575, 0.204360015052777, 0.07472154444346092, 0.2821590598460112, -0.436251149469074, -0.18385435933334715, 0.09979606157906304, 0.18049837033469043, 0.1918240374582351, -0.11474640506488465, -0.36925358378372136, -0.0219688392791197, -0.13232734581555597, -0.19428174459959863, -0.054485413522440816, 0.015895314827161347, -0.0017898668591308114, -0.21878579185788063, 0.07240463936726418, 0.09781571032265327, 0.037174291854830545, -0.008523694270809224, 0.003521868965319739, 0.013951033066283137, 0.0798881035430932, 0.004806447784914854, 0.035084652745683724, 0.16109183945711827, -0.13428458714726438, -0.1569323145890696, 0.4321101459630784, -0.09433016314596288, -0.1527222017413818, 0.15717287207078565, -0.1482977389589252, 0.0015760295947813648, 0.13016538007572392, 0.1437475951732255, 0.10239078500776883, -0.134247084954541, 0.006199849858542517, -0.06996135687105508, 0.19463567931873837, 0.10873849734338938, 0.06064183382792461, 0.281363168214104, 0.1660753836349003, 0.0718211270634385, 0.1403777768070522, -0.0983633064608646, -0.09906789900081844, -0.2900760320152762, -0.17290033980728997, -0.18198676712204695, 0.08641596255156339, -0.02309597752349226, -0.15105189694304194, 0.39559001019287027, 0.09195487526864213, 0.20498447630229413, -0.06842408254242584, 0.31767884327486257, 0.1355404695847553, 0.01685196349722327, 0.013208048861948835, 0.24647651934541526, 0.12700586717250764, 0.10835738790115254, -0.25914829197783495, 0.03761287394836045, 0.017430171723658808] |
1,802.01836 | Slopes and signatures of links | We define the slope of a colored link in an integral homology sphere,
associated to admissible characters on the link group. Away from a certain
singular locus, the slope is a rational function which can be regarded as a
multivariate generalization of the Kojima--Yamasaki $\eta$-function. It is the
ratio of two Conway potentials, provided that the latter makes sense;
otherwise, it is a new invariant. The slope is responsible for an extra
correction term in the signature formula for the splice of two links, in the
previously open exceptional case where both characters are admissible. Using a
similar construction for a special class of tangles, we formulate generalized
skein relations for the signature.
| math.GT | we define the slope of a colored link in an integral homology sphere associated to admissible characters on the link group away from a certain singular locus the slope is a rational function which can be regarded as a multivariate generalization of the kojimayamasaki etafunction it is the ratio of two conway potentials provided that the latter makes sense otherwise it is a new invariant the slope is responsible for an extra correction term in the signature formula for the splice of two links in the previously open exceptional case where both characters are admissible using a similar construction for a special class of tangles we formulate generalized skein relations for the signature | [['we', 'define', 'the', 'slope', 'of', 'a', 'colored', 'link', 'in', 'an', 'integral', 'homology', 'sphere', 'associated', 'to', 'admissible', 'characters', 'on', 'the', 'link', 'group', 'away', 'from', 'a', 'certain', 'singular', 'locus', 'the', 'slope', 'is', 'a', 'rational', 'function', 'which', 'can', 'be', 'regarded', 'as', 'a', 'multivariate', 'generalization', 'of', 'the', 'kojimayamasaki', 'etafunction', 'it', 'is', 'the', 'ratio', 'of', 'two', 'conway', 'potentials', 'provided', 'that', 'the', 'latter', 'makes', 'sense', 'otherwise', 'it', 'is', 'a', 'new', 'invariant', 'the', 'slope', 'is', 'responsible', 'for', 'an', 'extra', 'correction', 'term', 'in', 'the', 'signature', 'formula', 'for', 'the', 'splice', 'of', 'two', 'links', 'in', 'the', 'previously', 'open', 'exceptional', 'case', 'where', 'both', 'characters', 'are', 'admissible', 'using', 'a', 'similar', 'construction', 'for', 'a', 'special', 'class', 'of', 'tangles', 'we', 'formulate', 'generalized', 'skein', 'relations', 'for', 'the', 'signature']] | [-0.20094617339782417, 0.06346374351726679, -0.1422586530555106, 0.12742295500772474, -0.10791678430229824, -0.1622730381495785, 0.027901330958619446, 0.3090576295840687, -0.31691573756480856, -0.2398877140700019, 0.08994091299557892, -0.2373961509739664, -0.20763902836396092, 0.21602726672011027, -0.10766724137023889, -0.012169473377330828, 0.022334992723439688, 0.0989748127758503, -0.06818920839577913, -0.20939714691069508, 0.3744587164837867, 0.012030670443242084, 0.22862161221148977, 0.03572818542306777, 0.09494551847871792, 0.01966415556879448, -0.02856409943862153, -0.009022526122862473, -0.1312117937593809, 0.09127933763167155, 0.24762536787186815, 0.0320919318016552, 0.18123093879382526, -0.3109105220147675, -0.13984373638205788, 0.1742254220007453, 0.13063171470587673, 0.03575617313098129, -0.00945678380854328, -0.22977401824859303, 0.08607413584000564, -0.19408728422630311, -0.18026935902889818, -0.015494946810317092, 0.03824331705774447, -0.002333202079171315, -0.2600134767209446, 0.028038615905513455, 0.06050686860856201, 0.08169117641500634, -0.05746166268779364, -0.09561260387999937, -0.016040118714694733, 0.13333086581925663, 0.005928169158453654, 0.06404776131551314, 0.06205199849708671, -0.1736545842140913, -0.08791629445061387, 0.3585802720398143, -0.05953548748012898, -0.26850248154577067, 0.1424679499094574, -0.09079175866125817, -0.1788378398549477, 0.14892599379631324, 0.059045726050888855, 0.10663643769969765, -0.10265058545961178, 0.09773951185135436, -0.11901816336986874, 0.09925538550201704, 0.0955688277151369, -0.006039911854064225, 0.20080362706877558, 0.07370982139088612, 0.07745421352696472, 0.1940174137115329, -0.06149689266385394, -0.09023365900585693, -0.36454148597217034, -0.23017746010763013, -0.15335290962476783, 0.07190124040269959, -0.10375372397746625, -0.19966230551426634, 0.3867098404360669, 0.0349835126087003, 0.21249816646117584, 0.11570362672812605, 0.2226866681989382, 0.14786916628924832, 0.12207101205629962, 0.03320413752226159, 0.16641979181856317, 0.15582199338366212, 0.0027465568356482045, -0.1434965657234508, 0.05925725952589086, 0.175076183476319] |
1,802.01837 | Space-homogeneous quantum walks on Z from the viewpoint of complex
analysis | The subject of this paper is quantum walks, which are expected to simulate
several kinds of quantum dynamical systems. In this paper, we define
analyticity for quantum walks on Z. Almost all the quantum walks on
$\mathbb{Z}$ which have been already studied are analytic. In the framework of
analytic quantum walks, we can enlarge the theory of quantum walks. We obtain
not only several generalizations of known results, but also new types of
theorems. It is proved that every analytic space-homogeneous quantum walk on Z
is essentially a composite of shift operators and continuous-time analytic
space-homogeneous quantum walks. We also prove existence of the weak limit
distribution for analytic space-homogeneous quantum walks on Z.
| math-ph math.MP math.PR | the subject of this paper is quantum walks which are expected to simulate several kinds of quantum dynamical systems in this paper we define analyticity for quantum walks on z almost all the quantum walks on mathbbz which have been already studied are analytic in the framework of analytic quantum walks we can enlarge the theory of quantum walks we obtain not only several generalizations of known results but also new types of theorems it is proved that every analytic spacehomogeneous quantum walk on z is essentially a composite of shift operators and continuoustime analytic spacehomogeneous quantum walks we also prove existence of the weak limit distribution for analytic spacehomogeneous quantum walks on z | [['the', 'subject', 'of', 'this', 'paper', 'is', 'quantum', 'walks', 'which', 'are', 'expected', 'to', 'simulate', 'several', 'kinds', 'of', 'quantum', 'dynamical', 'systems', 'in', 'this', 'paper', 'we', 'define', 'analyticity', 'for', 'quantum', 'walks', 'on', 'z', 'almost', 'all', 'the', 'quantum', 'walks', 'on', 'mathbbz', 'which', 'have', 'been', 'already', 'studied', 'are', 'analytic', 'in', 'the', 'framework', 'of', 'analytic', 'quantum', 'walks', 'we', 'can', 'enlarge', 'the', 'theory', 'of', 'quantum', 'walks', 'we', 'obtain', 'not', 'only', 'several', 'generalizations', 'of', 'known', 'results', 'but', 'also', 'new', 'types', 'of', 'theorems', 'it', 'is', 'proved', 'that', 'every', 'analytic', 'spacehomogeneous', 'quantum', 'walk', 'on', 'z', 'is', 'essentially', 'a', 'composite', 'of', 'shift', 'operators', 'and', 'continuoustime', 'analytic', 'spacehomogeneous', 'quantum', 'walks', 'we', 'also', 'prove', 'existence', 'of', 'the', 'weak', 'limit', 'distribution', 'for', 'analytic', 'spacehomogeneous', 'quantum', 'walks', 'on', 'z']] | [-0.14096172858364553, 0.18565822350220723, -0.12383395407283515, 0.07679058636718414, -0.021076912466812422, -0.17253649917026787, 0.04094624217383139, 0.38720554896025805, -0.22654935446355426, -0.16027082667048825, 0.11460201373005188, -0.2635677977579466, -0.19667854987436154, 0.26197364840558485, -0.04362883080989776, 0.12525231224125283, 0.013042552481413606, 0.046775609017921646, -0.04238942068421461, -0.3090997241731537, 0.29170544027644946, -0.045503999189302126, 0.20586749066582374, 0.06779556402430069, 0.08529714029282331, 0.026743321385430664, -0.012911076710575767, -0.006477608737584792, -0.20913541640734284, 0.08681095812240974, 0.21240215795931586, 0.039289144683400015, 0.24135406696025216, -0.3865512308668194, -0.22254157003440095, 0.15498327426387715, 0.17208078412110345, 0.16527805947228907, -0.03906464544655919, -0.33577221584620703, 0.10454092771141675, -0.1455789704055509, -0.1182191460720149, -0.061717225402070766, 0.020925754270712405, 0.039302314758268106, -0.20107540462917664, 0.03273705045821292, 0.11598494488683636, 0.05235601649537944, 0.022232428182880477, -0.054291344884979095, 0.05417821221788855, 0.12112590075029354, -0.04893364534067938, -0.01617160502804868, 0.09798173537312418, -0.0788836635101848, -0.23601525167836562, 0.3782997687690352, -0.004542943795840664, -0.2214154537620121, 0.18800355904948032, -0.17681176692508815, -0.2163690942535667, 0.03421130755164644, 0.16104066422977076, 0.13047655431651756, -0.15713949467611024, 0.21264153887188927, -0.10485624478672419, 0.07696609243162368, 0.048796712478067265, 0.1053324225052309, 0.15763326659553537, 0.05292931007907579, 0.10423808878393877, 0.15030312356988393, 0.01573562010583517, -0.23259484816930795, -0.32684416449097753, -0.18531473159888073, -0.21733332679529363, 0.17718150125412585, -0.09218285923500509, -0.24554939362988398, 0.37752908148002207, 0.171483473913548, 0.17565690658234975, 0.1289423136367348, 0.22088068764423952, 0.1792243309645799, -0.012092512562511521, 0.05394410319511958, 0.16409776244198152, 0.19804598062642312, 0.043769334861600215, -0.11764892156382925, 0.03329206353641654, 0.1323167572753798] |
1,802.01838 | Real Tropical Singularities and Bergman Fans | In this paper, we classify singular real plane tropical curves by means of
subdivisions of Newton polytopes. First, we introduce signed Bergman fans
(generalizing positive Bergman fans from [AKW06]) that describe real
tropicalizations of real linear spaces ([Tab15]). Then, we establish a duality
of real plane tropical curves and signed regular subdivisions of the Newton
polytope and explore the combinatorics. We define a signed secondary fan that
parametrizes real tropical Laurent polynomials and study the subset providing
singular real plane tropical curves. A cone of the signed secondary fan is of
maximal dimensional type if its corresponding subdivision contains only marked
points ([MMS12a]). These cones parametrize real plane tropical curves. We
classify singular real plane tropical curves of maximal dimensional type.
| math.AG math.CO | in this paper we classify singular real plane tropical curves by means of subdivisions of newton polytopes first we introduce signed bergman fans generalizing positive bergman fans from akw06 that describe real tropicalizations of real linear spaces tab15 then we establish a duality of real plane tropical curves and signed regular subdivisions of the newton polytope and explore the combinatorics we define a signed secondary fan that parametrizes real tropical laurent polynomials and study the subset providing singular real plane tropical curves a cone of the signed secondary fan is of maximal dimensional type if its corresponding subdivision contains only marked points mms12a these cones parametrize real plane tropical curves we classify singular real plane tropical curves of maximal dimensional type | [['in', 'this', 'paper', 'we', 'classify', 'singular', 'real', 'plane', 'tropical', 'curves', 'by', 'means', 'of', 'subdivisions', 'of', 'newton', 'polytopes', 'first', 'we', 'introduce', 'signed', 'bergman', 'fans', 'generalizing', 'positive', 'bergman', 'fans', 'from', 'akw06', 'that', 'describe', 'real', 'tropicalizations', 'of', 'real', 'linear', 'spaces', 'tab15', 'then', 'we', 'establish', 'a', 'duality', 'of', 'real', 'plane', 'tropical', 'curves', 'and', 'signed', 'regular', 'subdivisions', 'of', 'the', 'newton', 'polytope', 'and', 'explore', 'the', 'combinatorics', 'we', 'define', 'a', 'signed', 'secondary', 'fan', 'that', 'parametrizes', 'real', 'tropical', 'laurent', 'polynomials', 'and', 'study', 'the', 'subset', 'providing', 'singular', 'real', 'plane', 'tropical', 'curves', 'a', 'cone', 'of', 'the', 'signed', 'secondary', 'fan', 'is', 'of', 'maximal', 'dimensional', 'type', 'if', 'its', 'corresponding', 'subdivision', 'contains', 'only', 'marked', 'points', 'mms12a', 'these', 'cones', 'parametrize', 'real', 'plane', 'tropical', 'curves', 'we', 'classify', 'singular', 'real', 'plane', 'tropical', 'curves', 'of', 'maximal', 'dimensional', 'type']] | [-0.2107717490617395, 0.038386990999412264, -0.08020397285157341, 0.12071752861552572, -0.15715728890766406, -0.08184700054747952, 0.02666048128730065, 0.29098814322565825, -0.38571569349585194, -0.12330068230344834, 0.11937169439526338, -0.285170399694372, -0.3199541408379199, 0.22130225788233643, -0.2202588014336208, -0.039657886752215515, 0.04031784844316416, 0.0026069920257491583, -0.10156965543421269, -0.3660680450226764, 0.4404061403662219, -0.08556650118049929, 0.19363194161244685, 0.012136412800242335, 0.11123037811810688, 0.0671032327542997, -0.07454220726454662, 0.058793064163429505, -0.15053308731937975, 0.1473020077367329, 0.3018971707995476, 0.19792449388305766, 0.08496065302041628, -0.37632482462578404, -0.11094655398816122, 0.3197241702227522, 0.08614902272011485, -0.06841673238116111, 0.036791986839103875, -0.1832651713373676, 0.04522804577313995, -0.04008699736510545, -0.2878920556720883, -0.10147072952556407, 0.039296110867033315, 0.07722586219917225, -0.18595830184383855, -0.04226629207131721, 0.03946309800307125, 0.23942128349869055, -0.022122198345842062, -0.1181112053977736, -0.12118954314668742, 0.02787153708937941, -0.08618285259531842, 0.044016928473187576, 0.029730890064610768, -0.0013761549799109147, -0.17002084994120364, 0.34261250243151276, 0.02805925984334169, -0.1984004040852473, 0.11066090774927605, -0.2577284714759533, -0.07306046962493368, 0.17259064421720677, 0.21532542995666548, 0.18335478887419707, -0.005739270243793726, 0.16044474454148736, -0.20318095262904287, -0.034058162413726924, 0.2013336020596799, -0.1288763506005526, 0.19149087741181758, 0.03826874899835783, 0.09835143826144227, 0.2037936571829605, -0.07338139176037226, -0.09695402970606604, -0.3462461158159678, -0.16935854752437543, -0.14555201104790824, 0.11279840078362721, -0.23496634402508174, -0.27544498593562233, 0.44169625354204645, -0.012812488285185358, 0.23639157460213212, 0.10348708443817194, 0.26669789213584577, 0.03691370258013071, -0.017995004177140863, 0.05579812448645421, 0.12522922904364828, 0.20895227408865308, 0.019428970619751993, -0.11181276212880482, -0.05042491312399191, 0.25992123529283423] |
1,802.01839 | Atlas for the properties of elemental 2D metals | Common two-dimensional (2D) materials have a layered 3D structure with
covalently bonded, atomically thin layers held together by weak van der Waals
forces. However, in a recent transmission electron microscopy experiment,
atomically thin 2D patches of iron were discovered inside a graphene nanopore.
Motivated by this discovery, we perform a systematic density-functional study
on atomically thin elemental 2D metal films, using 45 metals in three lattice
structures. Cohesive energies, equilibrium distances, and bulk moduli in 2D are
found to be linearly correlated to the corresponding 3D bulk properties,
enabling the quick estimation of these values for a given 2D metal and lattice
structure. In-plane elastic constants show that most 2D metals are stable in
hexagonal and honeycomb, but unstable in square 2D structures. Many 2D metals
are surprisingly stable against bending.
| cond-mat.mes-hall | common twodimensional 2d materials have a layered 3d structure with covalently bonded atomically thin layers held together by weak van der waals forces however in a recent transmission electron microscopy experiment atomically thin 2d patches of iron were discovered inside a graphene nanopore motivated by this discovery we perform a systematic densityfunctional study on atomically thin elemental 2d metal films using 45 metals in three lattice structures cohesive energies equilibrium distances and bulk moduli in 2d are found to be linearly correlated to the corresponding 3d bulk properties enabling the quick estimation of these values for a given 2d metal and lattice structure inplane elastic constants show that most 2d metals are stable in hexagonal and honeycomb but unstable in square 2d structures many 2d metals are surprisingly stable against bending | [['common', 'twodimensional', '2d', 'materials', 'have', 'a', 'layered', '3d', 'structure', 'with', 'covalently', 'bonded', 'atomically', 'thin', 'layers', 'held', 'together', 'by', 'weak', 'van', 'der', 'waals', 'forces', 'however', 'in', 'a', 'recent', 'transmission', 'electron', 'microscopy', 'experiment', 'atomically', 'thin', '2d', 'patches', 'of', 'iron', 'were', 'discovered', 'inside', 'a', 'graphene', 'nanopore', 'motivated', 'by', 'this', 'discovery', 'we', 'perform', 'a', 'systematic', 'densityfunctional', 'study', 'on', 'atomically', 'thin', 'elemental', '2d', 'metal', 'films', 'using', '45', 'metals', 'in', 'three', 'lattice', 'structures', 'cohesive', 'energies', 'equilibrium', 'distances', 'and', 'bulk', 'moduli', 'in', '2d', 'are', 'found', 'to', 'be', 'linearly', 'correlated', 'to', 'the', 'corresponding', '3d', 'bulk', 'properties', 'enabling', 'the', 'quick', 'estimation', 'of', 'these', 'values', 'for', 'a', 'given', '2d', 'metal', 'and', 'lattice', 'structure', 'inplane', 'elastic', 'constants', 'show', 'that', 'most', '2d', 'metals', 'are', 'stable', 'in', 'hexagonal', 'and', 'honeycomb', 'but', 'unstable', 'in', 'square', '2d', 'structures', 'many', '2d', 'metals', 'are', 'surprisingly', 'stable', 'against', 'bending']] | [-0.12875597131125743, 0.1594171890844982, 0.0077948531932161965, -0.03901963237537967, -0.004785769050301031, -0.21208558521297483, 0.030022203820519407, 0.47354326997919166, -0.2865903453576158, -0.2645569264085409, -0.010496262867067663, -0.35339930646462747, -0.18547491306965133, 0.1765380844283664, 0.05483000793046396, 0.11443199193514332, 0.015855570753879902, -0.18378539637925514, -0.12552230925128605, -0.22462900271212669, 0.24476083370195773, 0.024672237740303495, 0.3568357296131608, 0.028595621347470023, -0.022405971982694083, -0.027063035550136262, 0.09970097374597578, 0.09385332800376847, -0.22567187861446336, 0.1551257622186521, 0.26682535630565507, -0.22803840662871722, 0.18105028228805833, -0.5535810750745634, -0.24700326031742206, -0.07252994764290523, 0.11061777479107712, 0.1829564592068773, -0.12333798777860347, -0.24376088977286606, 0.07241996881047277, -0.1023346399284103, -0.10651828266168369, -0.0929185010649207, 0.0004691747123844751, 0.03252995200544055, -0.1839408188838803, 0.0902789882028774, 0.014092589948923533, 0.10347665023264824, -0.1287277316024086, -0.12170772542394982, -0.11707717792898814, 0.059338983887707, -0.014696088104103585, 0.02172817120449404, 0.19769250474628489, -0.13623504958982857, -0.05834481647622039, 0.447977832326566, -0.02139811327268604, -0.1116822021302433, 0.2358724968721166, -0.14153779613010528, -0.054847821010319334, 0.19002215205229647, 0.12253704018720234, 0.10881604162535367, -0.14807980830598097, 0.10268857729850507, -0.06402831467074219, 0.19084215528893334, 0.11802322419274969, 0.036014618000143585, 0.3037631908815553, 0.208714836185535, 0.002031996516948068, 0.09652018089483684, -0.11577757694829569, -0.02230238474422056, -0.1279220987708514, -0.221306269504983, -0.21575219245300492, 0.08308387194397568, -0.07950447473058722, -0.32698362548160187, 0.3426739670521089, 0.06493909558181772, 0.20319168756268066, -0.07258747484648728, 0.2373439400751883, -0.0353620464838899, 0.08267455797585595, -0.008812855028028366, 0.30758188336817477, 0.14805726362712227, 0.06961413850962941, -0.13010942723019092, 0.06714493475004832, 0.09558701353815903] |
1,802.0184 | Search for a Structure in the $B^0_s \pi^\pm$ Invariant Mass Spectrum
with the ATLAS Experiment | A search for the narrow structure, $X(5568)$, reported by the D0
Collaboration in the decay sequence $X \to B^0_s \pi^\pm$, $B^0_s \to
J/\psi\phi$, is presented. The analysis is based on a data sample recorded with
the ATLAS detector at the LHC corresponding to 4.9 fb$^{-1}$ of $pp$ collisions
at 7 TeV and 19.5 fb$^{-1}$ at 8 TeV. No significant signal was found. Upper
limits on the number of signal events, with properties corresponding to those
reported by D0, and on the $X$ production rate relative to $B^0_s$ mesons,
$\rho_X$, were determined at 95% confidence level. The results are $N(X) < 382$
and $\rho_X < 0.015$ for $B^0_s$ mesons with transverse momenta above 10 GeV,
and $N(X) < 356$ and $\rho_X < 0.016$ for transverse momenta above 15 GeV.
Limits are also set for potential $B^0_s \pi^\pm$ resonances in the mass range
5550 MeV to 5700 MeV.
| hep-ex | a search for the narrow structure x5568 reported by the d0 collaboration in the decay sequence x to b0_s pipm b0_s to jpsiphi is presented the analysis is based on a data sample recorded with the atlas detector at the lhc corresponding to 49 fb1 of pp collisions at 7 tev and 195 fb1 at 8 tev no significant signal was found upper limits on the number of signal events with properties corresponding to those reported by d0 and on the x production rate relative to b0_s mesons rho_x were determined at 95 confidence level the results are nx 382 and rho_x 0015 for b0_s mesons with transverse momenta above 10 gev and nx 356 and rho_x 0016 for transverse momenta above 15 gev limits are also set for potential b0_s pipm resonances in the mass range 5550 mev to 5700 mev | [['a', 'search', 'for', 'the', 'narrow', 'structure', 'x5568', 'reported', 'by', 'the', 'd0', 'collaboration', 'in', 'the', 'decay', 'sequence', 'x', 'to', 'b0_s', 'pipm', 'b0_s', 'to', 'jpsiphi', 'is', 'presented', 'the', 'analysis', 'is', 'based', 'on', 'a', 'data', 'sample', 'recorded', 'with', 'the', 'atlas', 'detector', 'at', 'the', 'lhc', 'corresponding', 'to', '49', 'fb1', 'of', 'pp', 'collisions', 'at', '7', 'tev', 'and', '195', 'fb1', 'at', '8', 'tev', 'no', 'significant', 'signal', 'was', 'found', 'upper', 'limits', 'on', 'the', 'number', 'of', 'signal', 'events', 'with', 'properties', 'corresponding', 'to', 'those', 'reported', 'by', 'd0', 'and', 'on', 'the', 'x', 'production', 'rate', 'relative', 'to', 'b0_s', 'mesons', 'rho_x', 'were', 'determined', 'at', '95', 'confidence', 'level', 'the', 'results', 'are', 'nx', '382', 'and', 'rho_x', '0015', 'for', 'b0_s', 'mesons', 'with', 'transverse', 'momenta', 'above', '10', 'gev', 'and', 'nx', '356', 'and', 'rho_x', '0016', 'for', 'transverse', 'momenta', 'above', '15', 'gev', 'limits', 'are', 'also', 'set', 'for', 'potential', 'b0_s', 'pipm', 'resonances', 'in', 'the', 'mass', 'range', '5550', 'mev', 'to', '5700', 'mev']] | [-0.05850197419911151, 0.24614094058871533, -0.040605221606108924, 0.13604936283901597, -0.01972273706571645, -0.10220808306918808, 0.06953988496532244, 0.31530159129269264, -0.1437566047665519, -0.37983601650511717, -0.027216022784992213, -0.4424521284453361, 0.14221810195332682, 0.18207432086330275, 0.10372545025114652, 0.13856693498649253, 0.12029838575292903, 0.021079512349080662, -0.034300712229106835, -0.20581315706228234, 0.1791128206827586, 0.05301779486455391, 0.20322168935877336, 0.1085847087965255, 0.04300256724826808, -0.01972519400083578, -0.022034197377162317, -0.17046653350788943, -0.19555552355604064, 0.01647940413345104, 0.26953527650100667, 0.06946231022765728, 0.10762483417548396, -0.21654316119850298, 0.011944200563192052, 0.16007116375963243, 0.14816829123088276, -0.028495905815925395, -0.021832387798472346, -0.40989794779542676, 0.23804771667674288, -0.16915902455622644, -0.07935688545120696, 0.02599696606778028, 0.09039562263093154, -0.10695215760612152, -0.3339703532520347, 0.15105961815394217, -0.0969550444587838, 0.1387884020049069, -0.042766061675420006, -0.3019814770176849, -0.08789128075439064, -0.08005742864801325, 0.07426732191553628, 0.1603940216060744, 0.19836373093314993, -0.040008312956545104, -0.16344689198402346, 0.3140290586251608, -0.04150713236451569, -0.10781795173472705, 0.17034743518714504, -0.24249571952706492, -0.11221554314284782, 0.25853607091646064, 0.2538541082430526, -0.003462578593031831, -0.2274950053874882, 0.10854734895827944, 0.001124987109813472, 0.2525423516988308, 0.12138891779870109, 0.07293016591411032, 0.15541636144168902, 0.19830166709832323, -0.022262150802137986, 0.013344414238686817, -0.18885790423160537, 0.0127315989820103, -0.4127398855118474, -0.05814015369822966, -0.06972775035734538, 0.09313811988710806, -0.06736667643817269, 0.04257860714176171, 0.3631219417053524, 0.03562366682380228, 0.3685564330359265, 0.012461038745782325, 0.24730197193337158, 0.10052373641571047, 0.00719979245373061, 0.09857244819933943, 0.3521785453899803, 0.19642312654530183, 0.18620076773255329, -0.20857021933369024, -0.019847582848611434, 0.0018635217631629236] |
1,802.01841 | Quantifying dependencies for sensitivity analysis with multivariate
input sample data | We present a novel method for quantifying dependencies in multivariate
datasets, based on estimating the R\'{e}nyi entropy by minimum spanning trees
(MSTs). The length of the MSTs can be used to order pairs of variables from
strongly to weakly dependent, making it a useful tool for sensitivity analysis
with dependent input variables. It is well-suited for cases where the input
distribution is unknown and only a sample of the inputs is available. We
introduce an estimator to quantify dependency based on the MST length, and
investigate its properties with several numerical examples. To reduce the
computational cost of constructing the exact MST for large datasets, we explore
methods to compute approximations to the exact MST, and find the multilevel
approach introduced recently by Zhong et al. (2015) to be the most accurate. We
apply our proposed method to an artificial testcase based on the Ishigami
function, as well as to a real-world testcase involving sediment transport in
the North Sea. The results are consistent with prior knowledge and heuristic
understanding, as well as with variance-based analysis using Sobol indices in
the case where these indices can be computed.
| math.ST stat.TH | we present a novel method for quantifying dependencies in multivariate datasets based on estimating the renyi entropy by minimum spanning trees msts the length of the msts can be used to order pairs of variables from strongly to weakly dependent making it a useful tool for sensitivity analysis with dependent input variables it is wellsuited for cases where the input distribution is unknown and only a sample of the inputs is available we introduce an estimator to quantify dependency based on the mst length and investigate its properties with several numerical examples to reduce the computational cost of constructing the exact mst for large datasets we explore methods to compute approximations to the exact mst and find the multilevel approach introduced recently by zhong et al 2015 to be the most accurate we apply our proposed method to an artificial testcase based on the ishigami function as well as to a realworld testcase involving sediment transport in the north sea the results are consistent with prior knowledge and heuristic understanding as well as with variancebased analysis using sobol indices in the case where these indices can be computed | [['we', 'present', 'a', 'novel', 'method', 'for', 'quantifying', 'dependencies', 'in', 'multivariate', 'datasets', 'based', 'on', 'estimating', 'the', 'renyi', 'entropy', 'by', 'minimum', 'spanning', 'trees', 'msts', 'the', 'length', 'of', 'the', 'msts', 'can', 'be', 'used', 'to', 'order', 'pairs', 'of', 'variables', 'from', 'strongly', 'to', 'weakly', 'dependent', 'making', 'it', 'a', 'useful', 'tool', 'for', 'sensitivity', 'analysis', 'with', 'dependent', 'input', 'variables', 'it', 'is', 'wellsuited', 'for', 'cases', 'where', 'the', 'input', 'distribution', 'is', 'unknown', 'and', 'only', 'a', 'sample', 'of', 'the', 'inputs', 'is', 'available', 'we', 'introduce', 'an', 'estimator', 'to', 'quantify', 'dependency', 'based', 'on', 'the', 'mst', 'length', 'and', 'investigate', 'its', 'properties', 'with', 'several', 'numerical', 'examples', 'to', 'reduce', 'the', 'computational', 'cost', 'of', 'constructing', 'the', 'exact', 'mst', 'for', 'large', 'datasets', 'we', 'explore', 'methods', 'to', 'compute', 'approximations', 'to', 'the', 'exact', 'mst', 'and', 'find', 'the', 'multilevel', 'approach', 'introduced', 'recently', 'by', 'zhong', 'et', 'al', '2015', 'to', 'be', 'the', 'most', 'accurate', 'we', 'apply', 'our', 'proposed', 'method', 'to', 'an', 'artificial', 'testcase', 'based', 'on', 'the', 'ishigami', 'function', 'as', 'well', 'as', 'to', 'a', 'realworld', 'testcase', 'involving', 'sediment', 'transport', 'in', 'the', 'north', 'sea', 'the', 'results', 'are', 'consistent', 'with', 'prior', 'knowledge', 'and', 'heuristic', 'understanding', 'as', 'well', 'as', 'with', 'variancebased', 'analysis', 'using', 'sobol', 'indices', 'in', 'the', 'case', 'where', 'these', 'indices', 'can', 'be', 'computed']] | [-0.0297787870141737, 0.0587327158156884, -0.07747382855419307, 0.09464416975103457, -0.07948135236833007, -0.09085744634974113, 0.05687310351950533, 0.36831731035527676, -0.24117464125911864, -0.3713922945886573, 0.12527016831618892, -0.2743218046726976, -0.17864424702612328, 0.23277673852677022, -0.06424707345208748, 0.09855805850925885, 0.060424856140595326, -0.003913097772152817, -0.04330949778228929, -0.25338859505768113, 0.27998894081076986, 0.09537562205793058, 0.28605879198105266, 0.03235250347333544, 0.10943139484771429, 0.034196798830847946, -0.07983994297683239, 0.04592055069881408, -0.14135962913798644, 0.13535294831888947, 0.2595688989968039, 0.1576871848343178, 0.2375502623964418, -0.3769977246991286, -0.21848192930399896, 0.09940504579107584, 0.10391915881600072, 0.11502219081693453, 0.004715010370226934, -0.26275871741025647, 0.08276120354817744, -0.15066170739009976, -0.08681322818131562, -0.13416457371513776, 0.017663033095812623, 0.049538885517246486, -0.3214830034808751, 0.07808058524561273, 0.001781927960109897, 0.03427947621217909, -0.0063372670339687945, -0.15697506897181193, -0.00038882935087771175, 0.13551770195307983, 0.03404353752898231, 0.022269050115124978, 0.08132736481963954, -0.08800891027884915, -0.13472924840715814, 0.348972048218476, -0.07442684601707522, -0.2175815822457538, 0.19351436458206042, -0.07439594688835217, -0.15238621877506375, 0.05846803404385858, 0.2106174538357857, 0.15687400889285702, -0.15370732308315865, 0.04013900083435224, -0.030962639056056975, 0.18058793126986897, 0.02903537714526929, 0.012290510587379375, 0.14666376551216903, 0.2041171001532967, 0.07114470118788031, 0.18274667293658142, -0.11867944560350573, -0.08672365972411848, -0.24218891998455722, -0.12674475961017728, -0.2216487450542503, -0.02131886742984321, -0.12399529662952967, -0.19092774779555646, 0.38504521170274375, 0.21108721743308087, 0.21304403838919514, 0.07715314328472347, 0.3016376005042285, 0.11977263638920627, 0.06009019431261782, 0.11092678060076457, 0.17720031305686867, 0.12019088676947347, 0.05570501750186482, -0.2031794124582604, 0.09225818843511428, 0.07862562680260297] |
1,802.01842 | Rational RBF-based partition of unity method for efficiently and
accurately approximating 3D objects | We consider the problem of reconstructing 3D objects via meshfree
interpolation methods. In this framework, we usually deal with large data sets
and thus we develop an efficient local scheme via the well-known Partition of
Unity (PU) method. The main contribution in this paper consists in constructing
the local interpolants for the implicit interpolation by means of Rational
Radial Basis Functions (RRBFs). Numerical evidence confirms that the proposed
method is particularly performing when 3D objects, or more in general implicit
functions defined by scattered data, need to be approximated.
| math.NA | we consider the problem of reconstructing 3d objects via meshfree interpolation methods in this framework we usually deal with large data sets and thus we develop an efficient local scheme via the wellknown partition of unity pu method the main contribution in this paper consists in constructing the local interpolants for the implicit interpolation by means of rational radial basis functions rrbfs numerical evidence confirms that the proposed method is particularly performing when 3d objects or more in general implicit functions defined by scattered data need to be approximated | [['we', 'consider', 'the', 'problem', 'of', 'reconstructing', '3d', 'objects', 'via', 'meshfree', 'interpolation', 'methods', 'in', 'this', 'framework', 'we', 'usually', 'deal', 'with', 'large', 'data', 'sets', 'and', 'thus', 'we', 'develop', 'an', 'efficient', 'local', 'scheme', 'via', 'the', 'wellknown', 'partition', 'of', 'unity', 'pu', 'method', 'the', 'main', 'contribution', 'in', 'this', 'paper', 'consists', 'in', 'constructing', 'the', 'local', 'interpolants', 'for', 'the', 'implicit', 'interpolation', 'by', 'means', 'of', 'rational', 'radial', 'basis', 'functions', 'rrbfs', 'numerical', 'evidence', 'confirms', 'that', 'the', 'proposed', 'method', 'is', 'particularly', 'performing', 'when', '3d', 'objects', 'or', 'more', 'in', 'general', 'implicit', 'functions', 'defined', 'by', 'scattered', 'data', 'need', 'to', 'be', 'approximated']] | [-0.06878986801000958, -0.004226472536836148, -0.08414006581402976, 0.0896465569954175, -0.05858452441382476, -0.10495821843968853, 0.03291745940143962, 0.3813235212794759, -0.2920227140103551, -0.29932138112648815, 0.07172254961915314, -0.210724038238616, -0.185803831853925, 0.20972984728392807, -0.07318707623265007, 0.08850250034381381, 0.07553795850385954, -0.0682132864868353, -0.09039095472491515, -0.23483835955928292, 0.3906781073786657, 0.03995779559905217, 0.2537339317178438, -0.0020135584742423484, 0.09738811022676104, 0.05415865485768088, -0.10976854550906202, 0.048824115613983435, -0.07372958383521935, 0.18999702390944798, 0.27099618153244426, 0.15392865545370363, 0.3061630223793062, -0.4474462753966112, -0.19512943262022667, 0.12983604981458152, 0.1788959752514281, 0.11373065861830996, -0.08186590390373154, -0.25491650150665507, 0.10558440745543604, -0.14876502472378145, -0.1561758158866062, -0.12924773633924566, -0.038115135042145004, 0.02869817871727388, -0.32025786967609415, 0.08447355829941278, 0.04144849828365047, 0.09198232523207976, -0.07594919160262427, -0.08351661790749693, 0.037540372625120326, 0.09605473653044266, 0.003761767030069181, 0.05319968827693215, 0.035758034627757625, -0.0971274752095765, -0.09425913213900375, 0.38863643955185334, -0.03314955764852295, -0.30282395422479813, 0.16681204574177338, -0.09716530751690945, -0.11727404363707385, 0.1319630310172215, 0.15945722863332115, 0.19969178898496798, -0.15228491398027638, 0.09157996783390197, -0.04428676811882972, 0.15034413745954886, 0.02953471388371492, -0.04422143513048385, 0.1595935751789842, 0.14380460305255838, 0.06744691001420672, 0.15313375131518114, -0.07406254418046129, -0.0746982432663737, -0.2729576331052654, -0.13889586155577985, -0.23375479391754858, -0.046791845218236136, -0.08087354658594202, -0.168270673581653, 0.3593147147424299, 0.15965633158339188, 0.1970961174123328, 0.07345607574097812, 0.3798336666924032, 0.1500754881093268, 0.05591361607234417, 0.08138910588406195, 0.1558332667098677, 0.0718504493177699, 0.060340826166793704, -0.1589615106296895, 0.054767952829768714, 0.17082191665064206] |
1,802.01843 | Double Collins effect in $e^+ e^-\to\Lambda \bar\Lambda X$ process in a
diquark spectator model | We study the Collins function $H^\perp_{1}$ of the $\Lambda$ hyperon, which
describes the fragmentation of a transversely polarized quark into an
unpolarized $\Lambda$ hyperon. We calculate $H^\perp_{1}$ for light quarks of
the $\Lambda$ hyperon, in the diquark spectator model with a Gaussian form
factor for the hyperon-quark-diquark vertex. The model calculation includes
contributions from both the scalar diquark and vector diquark spectators. Using
the model result, we estimate the weighted $\cos2\phi_0$ asymmetry in the
process $e^+e^- \to \Lambda\bar{\Lambda}X$ contributed by the coupling of two
Collins functions. The QCD evolution effects for the first $k_T$-moment of the
Collins function and the unpolarized fragmentation function $D_1(z)$ are also
included. The results show that asymmetry is sizable and measurable at the
kinematical configurations of Belle and BaBar experiments. We also find that
the evolution effects play an important role in the phenomenological analysis.
| hep-ph hep-ex | we study the collins function hperp_1 of the lambda hyperon which describes the fragmentation of a transversely polarized quark into an unpolarized lambda hyperon we calculate hperp_1 for light quarks of the lambda hyperon in the diquark spectator model with a gaussian form factor for the hyperonquarkdiquark vertex the model calculation includes contributions from both the scalar diquark and vector diquark spectators using the model result we estimate the weighted cos2phi_0 asymmetry in the process ee to lambdabarlambdax contributed by the coupling of two collins functions the qcd evolution effects for the first k_tmoment of the collins function and the unpolarized fragmentation function d_1z are also included the results show that asymmetry is sizable and measurable at the kinematical configurations of belle and babar experiments we also find that the evolution effects play an important role in the phenomenological analysis | [['we', 'study', 'the', 'collins', 'function', 'hperp_1', 'of', 'the', 'lambda', 'hyperon', 'which', 'describes', 'the', 'fragmentation', 'of', 'a', 'transversely', 'polarized', 'quark', 'into', 'an', 'unpolarized', 'lambda', 'hyperon', 'we', 'calculate', 'hperp_1', 'for', 'light', 'quarks', 'of', 'the', 'lambda', 'hyperon', 'in', 'the', 'diquark', 'spectator', 'model', 'with', 'a', 'gaussian', 'form', 'factor', 'for', 'the', 'hyperonquarkdiquark', 'vertex', 'the', 'model', 'calculation', 'includes', 'contributions', 'from', 'both', 'the', 'scalar', 'diquark', 'and', 'vector', 'diquark', 'spectators', 'using', 'the', 'model', 'result', 'we', 'estimate', 'the', 'weighted', 'cos2phi_0', 'asymmetry', 'in', 'the', 'process', 'ee', 'to', 'lambdabarlambdax', 'contributed', 'by', 'the', 'coupling', 'of', 'two', 'collins', 'functions', 'the', 'qcd', 'evolution', 'effects', 'for', 'the', 'first', 'k_tmoment', 'of', 'the', 'collins', 'function', 'and', 'the', 'unpolarized', 'fragmentation', 'function', 'd_1z', 'are', 'also', 'included', 'the', 'results', 'show', 'that', 'asymmetry', 'is', 'sizable', 'and', 'measurable', 'at', 'the', 'kinematical', 'configurations', 'of', 'belle', 'and', 'babar', 'experiments', 'we', 'also', 'find', 'that', 'the', 'evolution', 'effects', 'play', 'an', 'important', 'role', 'in', 'the', 'phenomenological', 'analysis']] | [-0.05273236827090828, 0.20738909810407039, -0.13178537379943334, 0.15144470821570707, -0.05183068710838014, -0.04660225727546738, 0.009315775790766104, 0.3408812428060085, -0.18890793842555426, -0.18467381759894205, -0.08962770509655212, -0.31944927375819254, -0.06959206688282107, 0.09772028459354179, 0.1405232399285062, 0.0613388394061198, 0.05099237905363483, -0.013432904615748063, -0.030578599883062735, -0.2164871410897641, 0.41031325203297075, 0.019853271001866506, 0.21246614864916166, 0.1869423952676467, 0.03966601344812384, 0.07816988040707004, -0.09207459383838769, -0.061070794886005905, -0.12731293551400114, 0.01733948164419688, 0.17029168449451715, 0.10406591280697108, 0.15876611284438152, -0.3646387228005524, -0.1288828370838996, 0.11331306042066261, 0.12436859079622734, 0.13535264145440437, -0.040359362433386496, -0.2824293849433758, 0.04756191769726018, -0.22343421262452628, -0.15029494970717203, -0.09275772280942426, 0.02129123147243439, -0.008096498362511508, -0.3591464152768143, 0.07094278325519608, 0.030332347151819868, -0.019136385290202364, -0.06577382987684835, -0.2527611878728355, -0.06673947552656893, 0.05037699515389195, 0.0823080090155613, 0.13176476159793282, 0.13263933435985958, -0.22120941476896405, -0.12339857567115617, 0.3626695572565407, -0.09953731762196646, -0.21479018992369078, 0.03849035740913406, -0.21643190407333202, -0.13180813700683527, 0.08711834061793539, 0.21858636216901645, 0.08989923674662757, -0.17271842713704083, 0.09132267033451918, -0.06387765706888636, 0.15349750306610185, 0.07776575880090414, 0.03987460451047701, 0.19836830245608936, 0.1805470398759275, -0.05481370771303773, 0.13647408503517786, -0.08251243156592497, -0.1180980859859499, -0.40581262890082687, -0.09131952064674792, -0.09737707446537801, 0.024155626607991046, -0.09541159491150279, -0.11209074839421396, 0.4000936844368785, 0.07807805716518813, 0.2535935238684847, -0.01588453676242298, 0.3016347722219887, 0.10960947932439175, 0.07624709473248682, 0.05283016031051972, 0.2733650662477559, 0.18712693882007986, 0.1274146307676808, -0.31588903401192947, 0.05175948892233532, 0.036624210744178785] |
1,802.01844 | Spin transport in multilayer systems with fully epitaxial NiO thin films | We report on the generation and transport of thermal spin currents in fully
epitaxial {\gamma}-Fe$_2$O$_3$/NiO(001)/Pt and Fe$_3$O$_4$/NiO(001)/Pt
trilayers. A thermal gradient, perpendicular to the plane of the sample,
generates a magnonic spin current in the ferrimagnetic maghemite
({\gamma}-Fe$_2$O$_3$) and magnetite (Fe$_3$O$_4$) thin films by means of the
spin Seebeck effect. The spin current propagates across the epitaxial,
antiferromagnetic insulating NiO layer, before being detected in the Pt layer
by the inverse spin Hall effect. The transport of the spin signal is studied as
a function of the NiO thickness, temperature and ferrimagnetic material where
the spin current is generated. In epitaxial NiO grown on maghemite, the spin
Seebeck signal decays exponentially as a function of the NiO thickness, with a
spin-diffusion length for thermally-generated magnons of {\lambda}$_{MSDL}$ =
$1.6 \pm 0.2$ nm, largely independent on temperature. We see no enhancement of
the spin current signal as previously reported for certain temperatures and
thicknesses of the NiO. In epitaxial NiO grown on magnetite, the
temperature-averaged spin diffusion length is {\lambda}$_{MSDL}$ = $3.8 \pm
0.3$ nm, and we observe an enhancement of the spin signal when the NiO
thickness is 0.8 nm, demonstrating that the growth conditions dramatically
affect the spin transport properties of the NiO even for full epitaxial growth.
In contrast to theoretical predictions for coherent spin transport, we do not
see vastly different spin diffusion lengths between epitaxial and
polycrystalline NiO layers.
| cond-mat.mtrl-sci | we report on the generation and transport of thermal spin currents in fully epitaxial gammafe_2o_3nio001pt and fe_3o_4nio001pt trilayers a thermal gradient perpendicular to the plane of the sample generates a magnonic spin current in the ferrimagnetic maghemite gammafe_2o_3 and magnetite fe_3o_4 thin films by means of the spin seebeck effect the spin current propagates across the epitaxial antiferromagnetic insulating nio layer before being detected in the pt layer by the inverse spin hall effect the transport of the spin signal is studied as a function of the nio thickness temperature and ferrimagnetic material where the spin current is generated in epitaxial nio grown on maghemite the spin seebeck signal decays exponentially as a function of the nio thickness with a spindiffusion length for thermallygenerated magnons of lambda_msdl 16 pm 02 nm largely independent on temperature we see no enhancement of the spin current signal as previously reported for certain temperatures and thicknesses of the nio in epitaxial nio grown on magnetite the temperatureaveraged spin diffusion length is lambda_msdl 38 pm 03 nm and we observe an enhancement of the spin signal when the nio thickness is 08 nm demonstrating that the growth conditions dramatically affect the spin transport properties of the nio even for full epitaxial growth in contrast to theoretical predictions for coherent spin transport we do not see vastly different spin diffusion lengths between epitaxial and polycrystalline nio layers | [['we', 'report', 'on', 'the', 'generation', 'and', 'transport', 'of', 'thermal', 'spin', 'currents', 'in', 'fully', 'epitaxial', 'gammafe_2o_3nio001pt', 'and', 'fe_3o_4nio001pt', 'trilayers', 'a', 'thermal', 'gradient', 'perpendicular', 'to', 'the', 'plane', 'of', 'the', 'sample', 'generates', 'a', 'magnonic', 'spin', 'current', 'in', 'the', 'ferrimagnetic', 'maghemite', 'gammafe_2o_3', 'and', 'magnetite', 'fe_3o_4', 'thin', 'films', 'by', 'means', 'of', 'the', 'spin', 'seebeck', 'effect', 'the', 'spin', 'current', 'propagates', 'across', 'the', 'epitaxial', 'antiferromagnetic', 'insulating', 'nio', 'layer', 'before', 'being', 'detected', 'in', 'the', 'pt', 'layer', 'by', 'the', 'inverse', 'spin', 'hall', 'effect', 'the', 'transport', 'of', 'the', 'spin', 'signal', 'is', 'studied', 'as', 'a', 'function', 'of', 'the', 'nio', 'thickness', 'temperature', 'and', 'ferrimagnetic', 'material', 'where', 'the', 'spin', 'current', 'is', 'generated', 'in', 'epitaxial', 'nio', 'grown', 'on', 'maghemite', 'the', 'spin', 'seebeck', 'signal', 'decays', 'exponentially', 'as', 'a', 'function', 'of', 'the', 'nio', 'thickness', 'with', 'a', 'spindiffusion', 'length', 'for', 'thermallygenerated', 'magnons', 'of', 'lambda_msdl', '16', 'pm', '02', 'nm', 'largely', 'independent', 'on', 'temperature', 'we', 'see', 'no', 'enhancement', 'of', 'the', 'spin', 'current', 'signal', 'as', 'previously', 'reported', 'for', 'certain', 'temperatures', 'and', 'thicknesses', 'of', 'the', 'nio', 'in', 'epitaxial', 'nio', 'grown', 'on', 'magnetite', 'the', 'temperatureaveraged', 'spin', 'diffusion', 'length', 'is', 'lambda_msdl', '38', 'pm', '03', 'nm', 'and', 'we', 'observe', 'an', 'enhancement', 'of', 'the', 'spin', 'signal', 'when', 'the', 'nio', 'thickness', 'is', '08', 'nm', 'demonstrating', 'that', 'the', 'growth', 'conditions', 'dramatically', 'affect', 'the', 'spin', 'transport', 'properties', 'of', 'the', 'nio', 'even', 'for', 'full', 'epitaxial', 'growth', 'in', 'contrast', 'to', 'theoretical', 'predictions', 'for', 'coherent', 'spin', 'transport', 'we', 'do', 'not', 'see', 'vastly', 'different', 'spin', 'diffusion', 'lengths', 'between', 'epitaxial', 'and', 'polycrystalline', 'nio', 'layers']] | [-0.1527125032993901, 0.2465628858237034, 0.02188477037985504, -0.055868820723072025, -0.0070928766987640906, -0.0964761719218892, 0.039400930368584636, 0.45617679127829924, -0.30472582577216745, -0.3020935631810432, 0.026761217723781885, -0.32360187049623396, -0.045627178452868816, 0.21944085041635908, 0.0909574409540891, 0.036908052983256966, -0.05994324149786437, -0.09691290379696592, -0.11802926015075857, -0.1794192893018501, 0.20373531722719163, 0.008532873073601024, 0.3514628676611073, 0.11030053249477878, 0.04788224965507016, 0.02615223387132638, 0.15587453428935052, -0.003108676750649723, -0.19768715356142427, -0.00740057223234882, 0.24797274353007365, -0.17993931895185936, 0.13163253723281082, -0.48948899830007836, -0.17890486041824663, -0.05731751737638121, 0.1297535821013781, 0.1525472772329715, -0.07739975271474538, -0.22612403062856304, 0.07759748307979805, -0.14026660999011215, -0.06867960932591427, -0.002332171029102189, 0.00041102699366752553, -0.04623369079452024, -0.2505459547554353, 0.140610853253361, 0.1133189614886929, 0.11867908471206252, -0.08571485146896633, -0.19448794033666825, -0.16286143295743, 0.028199628279446543, 0.07824920753709379, 0.07016834009034906, 0.24915880092138432, -0.10748537079342517, -0.15132972368747985, 0.26638131424685757, -0.06714579697690112, -0.0995789080759329, 0.10920879425917777, -0.2276546633658123, 0.012023795832904567, 0.15511385035552744, 0.10163747149713305, 0.137600233134725, -0.1432675206738208, 0.06985139553007604, -0.0025803315168889487, 0.26770388904548936, 0.07988312705708421, 0.08822463038408371, 0.24515186418548424, 0.25351297246205695, 0.02112492701011417, 0.15127678936660555, -0.18818458080687353, -0.0036970954161730752, -0.13249243862218166, -0.21005733147164626, -0.243281118110733, 0.13553495971859172, -0.1416622084654704, -0.20933946318083765, 0.4189392233976221, 0.17867300320268337, 0.1496885562917234, -0.03143528284233545, 0.24300360105997693, 0.07213188981610573, 0.09324446142408008, 0.006505254779703322, 0.2662644191167062, 0.24427130199511396, 0.18077988198869996, -0.3023946598332903, 0.1700436734641795, -0.04649062776516719] |
1,802.01845 | Failure of the integral Hodge conjecture for threefolds of Kodaira
dimension zero | We prove that the product of an Enriques surface and a very general curve of
genus at least 1 does not satisfy the integral Hodge conjecture for 1-cycles.
This provides the first examples of smooth projective complex threefolds of
Kodaira dimension zero for which the integral Hodge conjecture fails, and the
first examples of non-algebraic torsion cohomology classes of degree 4 on
smooth projective complex threefolds.
| math.AG | we prove that the product of an enriques surface and a very general curve of genus at least 1 does not satisfy the integral hodge conjecture for 1cycles this provides the first examples of smooth projective complex threefolds of kodaira dimension zero for which the integral hodge conjecture fails and the first examples of nonalgebraic torsion cohomology classes of degree 4 on smooth projective complex threefolds | [['we', 'prove', 'that', 'the', 'product', 'of', 'an', 'enriques', 'surface', 'and', 'a', 'very', 'general', 'curve', 'of', 'genus', 'at', 'least', '1', 'does', 'not', 'satisfy', 'the', 'integral', 'hodge', 'conjecture', 'for', '1cycles', 'this', 'provides', 'the', 'first', 'examples', 'of', 'smooth', 'projective', 'complex', 'threefolds', 'of', 'kodaira', 'dimension', 'zero', 'for', 'which', 'the', 'integral', 'hodge', 'conjecture', 'fails', 'and', 'the', 'first', 'examples', 'of', 'nonalgebraic', 'torsion', 'cohomology', 'classes', 'of', 'degree', '4', 'on', 'smooth', 'projective', 'complex', 'threefolds']] | [-0.23955343883823266, 0.0016829956300419078, -0.13124221823686225, 0.11488921228252973, -0.1257965580320381, -0.2149809857364744, -0.06371627914874504, 0.277524732843493, -0.2806320831207841, -0.199872786969398, 0.08671836712341191, -0.2088049694430083, -0.18508729491044174, 0.2461342076721573, -0.22244408706936872, -0.010250468639600458, 0.03463965405314935, 0.08864359091967344, -0.1047482977720034, -0.43595474925964617, 0.5255054262551394, -0.1114888448324619, 0.192830231123618, 0.16132954910228198, 0.16493826662895805, 0.0012823797296732664, 0.04052151542044047, -0.06677247121027022, -0.16871079697088906, 0.16249586224809967, 0.35042422098305187, 0.04654386396181177, 0.11790854100025061, -0.3918955002939611, -0.17225214341570708, 0.2552007409094861, 0.07584184842805068, 0.025670256386299363, 0.028966220407958397, -0.1846161906282897, 0.08794250462034886, -0.07737871174278112, -0.2789411447998701, -0.11401959376014544, 0.0534823345669517, 0.005922633392566984, -0.1735553516314901, -0.00792581047933323, 0.09915830600639862, 0.2022199839438227, -0.0618885129506728, -0.0943620843992738, -0.14286922930852708, 0.013710811866489663, -0.007785527585920962, 0.04675135155434184, 0.01794959645661892, -0.11878823811738667, -0.10643060997156709, 0.31654126485668577, -0.05274630669560848, -0.17673762092564368, 0.10819905653602979, -0.18039680770457242, -0.22134226481571342, 0.2214013501775987, 0.06222612383972966, 0.255640259024927, 0.07339106395727757, 0.1636012504776855, -0.10696772986910108, 0.1056643840645186, 0.14113954227474151, -0.08229600802808294, 0.10811893778824896, 0.059080520320232165, 0.10499580894512209, 0.07337685182662398, -0.04624549378852614, -0.008450726456375736, -0.44847911009282776, -0.279504280226926, -0.13969310010769265, 0.2344034096037803, -0.18089391157043405, -0.17725173180753534, 0.42628486319021747, -0.03768931748345494, 0.16571198837041404, 0.19282110916119014, 0.2356444543058222, -0.000372264872897755, 0.031784373109765125, 0.053592409515245396, 0.12142324748195031, 0.23916488794158353, -0.034817703724415464, -0.0984901233336352, -0.04542277054861188, 0.2106362037134893] |
1,802.01846 | Thermal conductivity of thin insulating films determined by tunnel
magneto-Seebeck effect measurements and finite-element modeling | In general, it is difficult to access the thermal conductivity of thin
insulating films experimentally just by electrical means. Here, we present a
new approach utilizing the tunnel magneto-Seebeck effect (TMS) in combination
with finite-element modeling (FEM). We detect the laser-induced TMS and the
absolute thermovoltage of laser-heated magnetic tunnel junctions with 2.6 nm
thin barriers of MgAl$_2$O$_4$ (MAO) and MgO, respectively. A second
measurement of the absolute thermovoltage after a dielectric breakdown of the
barrier grants insight into the remaining thermovoltage of the stack. Thus, the
pure TMS without any parasitic Nernst contributions from the leads can be
identified. In combination with FEM via COMSOL, we are able to extract values
for the thermal conductivity of MAO ($0.7$ W/(K$\cdot$m)) and MgO ($5.8$
W/(K$\cdot$m)), which are in very good agreement with theoretical predictions.
Our method provides a new promising way to extract the experimentally
challenging parameter of the thermal conductivity of thin insulating films.
| cond-mat.mtrl-sci | in general it is difficult to access the thermal conductivity of thin insulating films experimentally just by electrical means here we present a new approach utilizing the tunnel magnetoseebeck effect tms in combination with finiteelement modeling fem we detect the laserinduced tms and the absolute thermovoltage of laserheated magnetic tunnel junctions with 26 nm thin barriers of mgal_2o_4 mao and mgo respectively a second measurement of the absolute thermovoltage after a dielectric breakdown of the barrier grants insight into the remaining thermovoltage of the stack thus the pure tms without any parasitic nernst contributions from the leads can be identified in combination with fem via comsol we are able to extract values for the thermal conductivity of mao 07 wkcdotm and mgo 58 wkcdotm which are in very good agreement with theoretical predictions our method provides a new promising way to extract the experimentally challenging parameter of the thermal conductivity of thin insulating films | [['in', 'general', 'it', 'is', 'difficult', 'to', 'access', 'the', 'thermal', 'conductivity', 'of', 'thin', 'insulating', 'films', 'experimentally', 'just', 'by', 'electrical', 'means', 'here', 'we', 'present', 'a', 'new', 'approach', 'utilizing', 'the', 'tunnel', 'magnetoseebeck', 'effect', 'tms', 'in', 'combination', 'with', 'finiteelement', 'modeling', 'fem', 'we', 'detect', 'the', 'laserinduced', 'tms', 'and', 'the', 'absolute', 'thermovoltage', 'of', 'laserheated', 'magnetic', 'tunnel', 'junctions', 'with', '26', 'nm', 'thin', 'barriers', 'of', 'mgal_2o_4', 'mao', 'and', 'mgo', 'respectively', 'a', 'second', 'measurement', 'of', 'the', 'absolute', 'thermovoltage', 'after', 'a', 'dielectric', 'breakdown', 'of', 'the', 'barrier', 'grants', 'insight', 'into', 'the', 'remaining', 'thermovoltage', 'of', 'the', 'stack', 'thus', 'the', 'pure', 'tms', 'without', 'any', 'parasitic', 'nernst', 'contributions', 'from', 'the', 'leads', 'can', 'be', 'identified', 'in', 'combination', 'with', 'fem', 'via', 'comsol', 'we', 'are', 'able', 'to', 'extract', 'values', 'for', 'the', 'thermal', 'conductivity', 'of', 'mao', '07', 'wkcdotm', 'and', 'mgo', '58', 'wkcdotm', 'which', 'are', 'in', 'very', 'good', 'agreement', 'with', 'theoretical', 'predictions', 'our', 'method', 'provides', 'a', 'new', 'promising', 'way', 'to', 'extract', 'the', 'experimentally', 'challenging', 'parameter', 'of', 'the', 'thermal', 'conductivity', 'of', 'thin', 'insulating', 'films']] | [-0.0858162472129487, 0.1112884247222131, -0.06729299437230159, -0.043974076870654244, -0.05131334299834347, -0.15565446107403227, 0.11213269401081274, 0.41788633262101366, -0.244998979284183, -0.34315455772325787, 0.016161757289266557, -0.29056536986517084, -0.08440064123868452, 0.2508695287152046, -0.004846176901513613, 0.05447615476221376, -0.005897861357784438, -0.11813355467625354, -0.04502310292139698, -0.17976745138883798, 0.23690921506893478, 0.04188372855883484, 0.3294757626503461, 0.11449196233450876, 0.041983079995445316, -0.04742696394494392, 0.06108733504018011, 0.06314742940134908, -0.1542743874934355, 0.07589935682297341, 0.2447223699097154, -0.11153871667154722, 0.1896263208105474, -0.48928164940719543, -0.1861111670257646, -0.002646809725679065, 0.08658976412353743, 0.13486125283663186, -0.06926194015326664, -0.25035195531764703, 0.10269723921450541, -0.12417288953714122, -0.09254352675481259, -0.10829913099051307, -0.024353150011800034, -0.041111356367381585, -0.26672172332894806, 0.09862047799335989, 0.018963903698022477, 0.07473065165533244, -0.06913126827720062, -0.17028446572351785, -0.04661303980882574, 0.08043071241455006, 0.013210575548184448, 0.009839277260317957, 0.17483045905675298, -0.08284543519479676, -0.09428613379560902, 0.33138629292922195, -0.08559729722573568, -0.10542733197737682, 0.14551288996498393, -0.16566210427615596, -0.006975364813115448, 0.16673986189447246, 0.09732774205775441, 0.11867541009977638, -0.16454253938220637, 0.0557790840167926, 0.004426111007648471, 0.18401903813049247, 0.08199197331161581, 0.00760413180131237, 0.2220870715896844, 0.22168051724714277, -0.02578577527157521, 0.15650288457905653, -0.1503579822172852, 0.01863820804742557, -0.25167373543311106, -0.1936740783398579, -0.17228043375775756, 0.0876251298621738, -0.09997592206118018, -0.20416042112475752, 0.39435206307136567, 0.18946816988280166, 0.15543855332744946, -0.029459341085289213, 0.3239345063063267, 0.101228787083528, 0.08463830983045657, 0.004982506139448991, 0.2739155853609861, 0.19931354636087475, 0.14647155850204735, -0.2640754339673118, 0.11679334567375727, -0.0264337504999467] |
1,802.01847 | A large deviation approach to super-critical bootstrap percolation on
the random graph $G_{n,p}$ | We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze
the simple irreversible epidemic process on the graph, known in the literature
as bootstrap percolation. We give a quantitative version of some results by
Janson et al. (2012), providing a fine asymptotic analysis of the final size
$A_n^*$ of active nodes, under a suitable super-critical regime. More
specifically, we establish large deviation principles for the sequence of
random variables $\{\frac{n- A_n^*}{f(n)}\}_{n\geq 1}$ with explicit rate
functions and allowing the scaling function $f$ to vary in the widest possible
range.
| math.PR cs.PF | we consider the erdosrenyi random graph g_np and we analyze the simple irreversible epidemic process on the graph known in the literature as bootstrap percolation we give a quantitative version of some results by janson et al 2012 providing a fine asymptotic analysis of the final size a_n of active nodes under a suitable supercritical regime more specifically we establish large deviation principles for the sequence of random variables fracn a_nfn_ngeq 1 with explicit rate functions and allowing the scaling function f to vary in the widest possible range | [['we', 'consider', 'the', 'erdosrenyi', 'random', 'graph', 'g_np', 'and', 'we', 'analyze', 'the', 'simple', 'irreversible', 'epidemic', 'process', 'on', 'the', 'graph', 'known', 'in', 'the', 'literature', 'as', 'bootstrap', 'percolation', 'we', 'give', 'a', 'quantitative', 'version', 'of', 'some', 'results', 'by', 'janson', 'et', 'al', '2012', 'providing', 'a', 'fine', 'asymptotic', 'analysis', 'of', 'the', 'final', 'size', 'a_n', 'of', 'active', 'nodes', 'under', 'a', 'suitable', 'supercritical', 'regime', 'more', 'specifically', 'we', 'establish', 'large', 'deviation', 'principles', 'for', 'the', 'sequence', 'of', 'random', 'variables', 'fracn', 'a_nfn_ngeq', '1', 'with', 'explicit', 'rate', 'functions', 'and', 'allowing', 'the', 'scaling', 'function', 'f', 'to', 'vary', 'in', 'the', 'widest', 'possible', 'range']] | [-0.11755049878874244, 0.10451761025152254, -0.044404546190476554, 0.0898456140402521, -0.06952656456269324, -0.12243242289299484, 0.142148750364537, 0.3637142588850111, -0.2382168648658659, -0.2998251053081317, 0.09159014834122817, -0.25310138801895926, -0.17063640655462883, 0.13799157820176333, -0.0715956257825548, 0.08182383726737251, 0.04498479522193189, 0.022120398871431298, 0.002778107654276854, -0.2562361328223646, 0.29091668194318615, 0.045369732257148083, 0.2503452785736458, 0.004941822354422501, 0.06681816810636189, 0.07377144793281332, -0.0361960405240428, 0.011436624336056411, -0.25084662836426025, 0.05990283475892449, 0.2112562396677359, 0.10178459841567515, 0.2755133703626184, -0.3816324568099596, -0.1852714117134879, 0.1554779498586537, 0.12668273161596683, 0.10449281656606631, -0.006154145272375899, -0.25188584724938584, 0.10060415669100951, -0.1574146866795755, -0.14240516184046018, -0.029927267544818194, 0.060732923141172665, 0.07989200250118632, -0.33882350144399837, 0.09562201050787487, 0.10263328351588412, 0.049836531694216486, 0.02656280342357191, -0.14643921497256748, 0.01689649281748147, 0.13479577882125424, -0.005963553871962094, 0.017271406242137098, 0.1199621247572147, -0.08736673640404743, -0.12299516518859574, 0.29615967529190873, -0.03677550193176351, -0.13640522047750314, 0.17273176795887676, -0.15513783535094594, -0.20528414044317536, 0.07896803101440045, 0.17675386447544125, 0.12734053675508636, -0.13285541783129287, 0.11365370762888977, -0.08223886174065145, 0.13509356682400472, 0.0669058278330009, -0.0061661468485412615, 0.06790315551916137, 0.18849937259537083, 0.07921309676021338, 0.1801503444889518, -0.051906117105814206, -0.10671584409613967, -0.3202567072691057, -0.1027946182822978, -0.19534017781420102, 0.09303555342194159, -0.2292327948853199, -0.19870452202369712, 0.3938809080917219, 0.146819754146484, 0.24550724419532344, 0.13851446861570532, 0.17637592025196433, 0.12071454116349659, -0.024050844939086925, 0.10929192261855034, 0.1724338175226876, 0.17817018215481023, 0.10369259487858719, -0.12599326124076138, 0.08186777899655598, 0.11598507680570368] |
1,802.01848 | On quiver Grassmannians and orbit closures for gen-finite modules | We show that endomorphism rings of cogenerators in the module category of a
finite-dimensional algebra A admit a canonical tilting module, whose tilted
algebra B is related to A by a recollement. Let M be a gen-finite A-module,
meaning there are only finitely many indecomposable modules generated by M.
Using the canonical tilts of endomorphism algebras of suitable cogenerators
associated to M, and the resulting recollements, we construct
desingularisations of the orbit closure and quiver Grassmannians of M, thus
generalising all results from previous work of Crawley-Boevey and the second
author in 2017. We provide dual versions of the key results, in order to also
treat cogen-finite modules.
| math.RA math.AG math.RT | we show that endomorphism rings of cogenerators in the module category of a finitedimensional algebra a admit a canonical tilting module whose tilted algebra b is related to a by a recollement let m be a genfinite amodule meaning there are only finitely many indecomposable modules generated by m using the canonical tilts of endomorphism algebras of suitable cogenerators associated to m and the resulting recollements we construct desingularisations of the orbit closure and quiver grassmannians of m thus generalising all results from previous work of crawleyboevey and the second author in 2017 we provide dual versions of the key results in order to also treat cogenfinite modules | [['we', 'show', 'that', 'endomorphism', 'rings', 'of', 'cogenerators', 'in', 'the', 'module', 'category', 'of', 'a', 'finitedimensional', 'algebra', 'a', 'admit', 'a', 'canonical', 'tilting', 'module', 'whose', 'tilted', 'algebra', 'b', 'is', 'related', 'to', 'a', 'by', 'a', 'recollement', 'let', 'm', 'be', 'a', 'genfinite', 'amodule', 'meaning', 'there', 'are', 'only', 'finitely', 'many', 'indecomposable', 'modules', 'generated', 'by', 'm', 'using', 'the', 'canonical', 'tilts', 'of', 'endomorphism', 'algebras', 'of', 'suitable', 'cogenerators', 'associated', 'to', 'm', 'and', 'the', 'resulting', 'recollements', 'we', 'construct', 'desingularisations', 'of', 'the', 'orbit', 'closure', 'and', 'quiver', 'grassmannians', 'of', 'm', 'thus', 'generalising', 'all', 'results', 'from', 'previous', 'work', 'of', 'crawleyboevey', 'and', 'the', 'second', 'author', 'in', '2017', 'we', 'provide', 'dual', 'versions', 'of', 'the', 'key', 'results', 'in', 'order', 'to', 'also', 'treat', 'cogenfinite', 'modules']] | [-0.17654014900678172, 0.05892655390472907, -0.06360652867072034, 0.008106708879152066, -0.10425655518763892, -0.15803268183690478, -0.07456957170067637, 0.3573011736174659, -0.3803607637967633, -0.1983706017446546, 0.09204085685756444, -0.19288690063118372, -0.15703908572652167, 0.2033287132936442, -0.18724752250039634, -0.07637965944507774, 0.10884512610346922, 0.115168093666621, -0.09029914534712245, -0.28194529867186297, 0.4348744628599511, 0.03106027848377191, 0.17271440758870668, -0.02637619776475542, 0.1511696649645016, 0.020202446324785926, -0.03349704519441386, 0.03145267417157983, -0.16899374099416747, 0.1379283176524178, 0.3302193491890991, 0.06741767892403142, 0.20033869446136654, -0.3457092966462644, -0.04351895639479582, 0.19116777323959572, 0.12403102002802903, -0.0007438340031032292, -0.021307997721827256, -0.2699431931195816, 0.1379435269712835, -0.27149892353918403, -0.1020553710624435, -0.08780004875734448, 0.11027223917102125, 0.023099818697445235, -0.27123912089978747, -0.028155809464119812, 0.1324349816642561, 0.13401118956752262, -0.12286790138338956, -0.08382009686287141, -0.12329757620387201, 0.074047889270521, -0.08075337190365524, 0.04004480536227589, 0.11368974159858278, -0.0721130019651269, -0.16904451529372413, 0.330674685520243, -0.05097894457647718, -0.21948238847039217, 0.15068165930581084, -0.19066860554915555, -0.12811405073745913, 0.12235167308903809, 0.005953351141146894, 0.14116392780165626, -0.015169748843137949, 0.20813893777909162, -0.17633329989950894, 0.025102426109062333, 0.10182313511657687, -0.00017234642181615786, 0.1849965877646475, 0.08465072298466386, 0.02944060660215569, 0.13150466866857144, 0.03859455424376307, 0.01748479960073348, -0.3576485164604097, -0.20702207561160596, -0.07980023286819353, 0.1348167102748774, -0.05507034519733971, -0.13326416652263054, 0.4146366844959733, 0.1350706072836095, 0.2193177306567723, 0.1083870328136913, 0.1972327045129858, 0.010447671544685398, 0.114300523026306, 0.05396874256586911, 0.12288746666514648, 0.2758298488026309, -0.024736112721686094, -0.10174925993487705, -0.053219708895205324, 0.22748767034554818] |
1,802.01849 | Breakdown of Ehrenfest theorem for free particle constrained on a
hypersurface | There is a belief that the Ehrenfest theorem holds true universally. We
demonstrate that for a classically nonrelativistic particle constrained on an
$N-1$ ($N\geq 2$) curved hypersurface embedded in $N$ flat space, the theorem
breaks down.
| quant-ph math-ph math.MP | there is a belief that the ehrenfest theorem holds true universally we demonstrate that for a classically nonrelativistic particle constrained on an n1 ngeq 2 curved hypersurface embedded in n flat space the theorem breaks down | [['there', 'is', 'a', 'belief', 'that', 'the', 'ehrenfest', 'theorem', 'holds', 'true', 'universally', 'we', 'demonstrate', 'that', 'for', 'a', 'classically', 'nonrelativistic', 'particle', 'constrained', 'on', 'an', 'n1', 'ngeq', '2', 'curved', 'hypersurface', 'embedded', 'in', 'n', 'flat', 'space', 'the', 'theorem', 'breaks', 'down']] | [-0.15999882952827546, 0.19873113269608844, -0.08982850758669277, 0.169038464538365, 0.008457931508827541, -0.23108321296361586, -0.020025894045829773, 0.3564528768571715, -0.21799722598451707, -0.20474725383165707, 0.035955476105704695, -0.20935561106954184, -0.11178757245781729, 0.15738628689561868, -0.09571467821175854, -0.013922951908575164, 0.011993264210306935, 0.08005751120961374, -0.08326145203318447, -0.2826846427698102, 0.3042932870383892, -0.07626355377336343, 0.24656406399380001, 0.07485519096048342, 0.16285593986524166, 0.09132753597158524, 0.10810150811448693, 0.035424978135173056, -0.13739636831653318, 0.05268665820444261, 0.2544840947828359, 0.13064976795835215, 0.2528414638881158, -0.4115286553795967, -0.21130537014040682, 0.1549640833141489, 0.17784873370288146, 0.09452621524946557, -0.009107510937610641, -0.24137240808664095, 0.11455767036467376, -0.06458775624115434, -0.30737035121354794, -0.01881796954613593, 0.05235909466217789, -0.13974931463599205, -0.21744901697254843, 0.10475917957309219, 0.2152551806324886, 0.0015018770419475106, -0.04389416938647628, -0.00772023175118698, -0.04921672824356291, 0.023443799595245056, -0.019590682757552713, 0.11158694606274366, 0.11683827143214229, -0.07152033055252913, -0.11084853708032621, 0.38223460554015926, -0.07106490406375895, -0.2753152168718063, 0.08301482326351106, -0.14401215410584378, -0.20463305289740674, 0.12700395793136623, 0.07080495579996043, 0.1819225080156078, -0.041878741027580366, 0.2822919517962469, -0.14139413087913352, 0.20842126172242892, 0.14062184150033216, -0.028727208600483008, 0.16389883676957753, 0.1233919915329251, 0.10297143361013797, 0.07207978716016644, -0.03573354133792842, -0.14862435383515227, -0.3920459471022089, -0.20224817174797258, -0.21861279228081307, 0.17029016486291462, -0.17238095315082724, -0.1624763457932406, 0.22708616207819432, 0.08502457376259069, 0.10913689015433192, 0.16867447535817823, 0.21290281099370784, 0.09681996992892689, -0.006070141059656938, 0.17135705412106794, 0.22119701995203891, 0.1394858804900044, 0.025900983109345868, -0.09386603194030209, -0.1003618729300797, 0.08435310953710642] |
1,802.0185 | Correlation strength, Lifshitz transition and the emergence of a two- to
three-dimensional crossover in FeSe under pressure | We report a detailed theoretical study of the electronic structure, spectral
properties, and lattice parameters of bulk FeSe under pressure using a fully
charge self-consistent implementation of the density functional theory plus
dynamical mean-field theory method (DFT+DMFT). In particular, we perform a
structural optimization and compute the evolution of the lattice parameters
(volume, $c/a$ ratio, and the internal $z$ position of Se) and the electronic
structure of the tetragonal (space group $P4/nmm$) paramagnetic FeSe. Our
results for the lattice parameters are in good quantitative agreement with
experiment. The $c/a$ ratio is slightly overestimated by about $3$~\%,
presumably due to the absence of the van der Waals interactions between the
FeSe layers in our calculations. The lattice parameters determined within DFT
are off the experimental values by a remarkable $\sim$$6$-$15$~\%, implying a
crucial importance of electron correlations. Upon compression to $10$~GPa, the
$c/a$ ratio and the lattice volume show a decrease by $2$ and $10$~\%,
respectively, while the Se $z$ coordinate weakly increases by $\sim$$2$~\%.
Most importantly, our results reveal a topological change of the Fermi surface
(Lifshitz transition) which is accompanied by a two- to three-dimensional
crossover. Our results indicate a small reduction of the quasiparticle mass
renormalization $m^*/m$ by about $5$~\% for the $e$ and less than $1$~\% for
the $t_2$ states, as compared to ambient pressure. The behavior of the
momentum-resolved magnetic susceptibility $\chi({\bf q})$ shows no topological
changes of magnetic correlations under pressure, but demonstrates a reduction
of the degree of the in-plane $(\pi,\pi)$ stripe-type nesting. Our results for
the electronic structure and lattice parameters of FeSe are in good qualitative
agreement with recent experiments on its isoelectronic counterpart
FeSe$_{1-x}$S$_x$.
| cond-mat.str-el | we report a detailed theoretical study of the electronic structure spectral properties and lattice parameters of bulk fese under pressure using a fully charge selfconsistent implementation of the density functional theory plus dynamical meanfield theory method dftdmft in particular we perform a structural optimization and compute the evolution of the lattice parameters volume ca ratio and the internal z position of se and the electronic structure of the tetragonal space group p4nmm paramagnetic fese our results for the lattice parameters are in good quantitative agreement with experiment the ca ratio is slightly overestimated by about 3 presumably due to the absence of the van der waals interactions between the fese layers in our calculations the lattice parameters determined within dft are off the experimental values by a remarkable sim615 implying a crucial importance of electron correlations upon compression to 10gpa the ca ratio and the lattice volume show a decrease by 2 and 10 respectively while the se z coordinate weakly increases by sim2 most importantly our results reveal a topological change of the fermi surface lifshitz transition which is accompanied by a two to threedimensional crossover our results indicate a small reduction of the quasiparticle mass renormalization mm by about 5 for the e and less than 1 for the t_2 states as compared to ambient pressure the behavior of the momentumresolved magnetic susceptibility chibf q shows no topological changes of magnetic correlations under pressure but demonstrates a reduction of the degree of the inplane pipi stripetype nesting our results for the electronic structure and lattice parameters of fese are in good qualitative agreement with recent experiments on its isoelectronic counterpart fese_1xs_x | [['we', 'report', 'a', 'detailed', 'theoretical', 'study', 'of', 'the', 'electronic', 'structure', 'spectral', 'properties', 'and', 'lattice', 'parameters', 'of', 'bulk', 'fese', 'under', 'pressure', 'using', 'a', 'fully', 'charge', 'selfconsistent', 'implementation', 'of', 'the', 'density', 'functional', 'theory', 'plus', 'dynamical', 'meanfield', 'theory', 'method', 'dftdmft', 'in', 'particular', 'we', 'perform', 'a', 'structural', 'optimization', 'and', 'compute', 'the', 'evolution', 'of', 'the', 'lattice', 'parameters', 'volume', 'ca', 'ratio', 'and', 'the', 'internal', 'z', 'position', 'of', 'se', 'and', 'the', 'electronic', 'structure', 'of', 'the', 'tetragonal', 'space', 'group', 'p4nmm', 'paramagnetic', 'fese', 'our', 'results', 'for', 'the', 'lattice', 'parameters', 'are', 'in', 'good', 'quantitative', 'agreement', 'with', 'experiment', 'the', 'ca', 'ratio', 'is', 'slightly', 'overestimated', 'by', 'about', '3', 'presumably', 'due', 'to', 'the', 'absence', 'of', 'the', 'van', 'der', 'waals', 'interactions', 'between', 'the', 'fese', 'layers', 'in', 'our', 'calculations', 'the', 'lattice', 'parameters', 'determined', 'within', 'dft', 'are', 'off', 'the', 'experimental', 'values', 'by', 'a', 'remarkable', 'sim615', 'implying', 'a', 'crucial', 'importance', 'of', 'electron', 'correlations', 'upon', 'compression', 'to', '10gpa', 'the', 'ca', 'ratio', 'and', 'the', 'lattice', 'volume', 'show', 'a', 'decrease', 'by', '2', 'and', '10', 'respectively', 'while', 'the', 'se', 'z', 'coordinate', 'weakly', 'increases', 'by', 'sim2', 'most', 'importantly', 'our', 'results', 'reveal', 'a', 'topological', 'change', 'of', 'the', 'fermi', 'surface', 'lifshitz', 'transition', 'which', 'is', 'accompanied', 'by', 'a', 'two', 'to', 'threedimensional', 'crossover', 'our', 'results', 'indicate', 'a', 'small', 'reduction', 'of', 'the', 'quasiparticle', 'mass', 'renormalization', 'mm', 'by', 'about', '5', 'for', 'the', 'e', 'and', 'less', 'than', '1', 'for', 'the', 't_2', 'states', 'as', 'compared', 'to', 'ambient', 'pressure', 'the', 'behavior', 'of', 'the', 'momentumresolved', 'magnetic', 'susceptibility', 'chibf', 'q', 'shows', 'no', 'topological', 'changes', 'of', 'magnetic', 'correlations', 'under', 'pressure', 'but', 'demonstrates', 'a', 'reduction', 'of', 'the', 'degree', 'of', 'the', 'inplane', 'pipi', 'stripetype', 'nesting', 'our', 'results', 'for', 'the', 'electronic', 'structure', 'and', 'lattice', 'parameters', 'of', 'fese', 'are', 'in', 'good', 'qualitative', 'agreement', 'with', 'recent', 'experiments', 'on', 'its', 'isoelectronic', 'counterpart', 'fese_1xs_x']] | [-0.14384965643865358, 0.161370278291596, -0.0542213941407681, 0.027591313024030943, -0.0003441870623432538, -0.09183034064592314, 0.1184039753399488, 0.3721362575820154, -0.23250129763576244, -0.30018375138067366, -0.0024547452665180623, -0.3291366429526961, -0.12844288421140793, 0.15892943241958754, 0.04753505610364407, 0.03388046140394983, 0.027555603625574698, -0.008400476759347571, -0.16563371564723853, -0.23411099314449424, 0.29257114882313867, 0.08017085832184154, 0.30888839574575233, 0.08918353922212298, 0.016222446472110116, 0.019449479809041163, 0.045657128786414806, 0.0593931581122032, -0.16912064382909997, 0.09846318959002662, 0.21499047464235713, -0.04377909206703086, 0.2032172505663338, -0.4090056983062395, -0.23469645672422998, -0.0311582876559388, 0.08709225213982898, 0.10471436299720903, -0.05700641574452782, -0.2555793642429361, 0.08660243214869885, -0.1462605300846596, -0.10706698965548318, -0.1132855786349597, -0.013788749497454025, 0.011677719652438742, -0.23802258884397282, 0.13638388043396202, 0.03081347456881143, 0.12901108634894307, -0.12050020361279809, -0.15257160387751784, -0.07350285510833868, 0.05447011083357639, 0.04235666649422937, 0.09486251090214971, 0.1544815921344493, -0.11779500960255973, -0.0756551360605312, 0.405564769914182, -0.05735063619479607, -0.09763609206931827, 0.17031171076643445, -0.1797609129883794, -0.10226556344862141, 0.1782798039716641, 0.07306674944394377, 0.05884266083269134, -0.08314354940696778, 0.0868873212055084, -0.012601306427741828, 0.24578453964375727, 0.02812202412956942, 0.04310249189947011, 0.17254682892598794, 0.16713295686777735, 0.030399593355147827, 0.09739468026493663, -0.10330772713966914, -0.0808115020956714, -0.2507435538290712, -0.15959154491771615, -0.18083424625450895, 0.06055600775374949, -0.13205220237646512, -0.16840003122856348, 0.38632559967706637, 0.11300651121350444, 0.24047983634826617, -0.019026759292875582, 0.22354717491415452, 0.0767018273113268, 0.0557058650541448, 0.04262821276343482, 0.26154518095341595, 0.1831011721977334, 0.08770267956681303, -0.3143793122289935, 0.07260603965251529, 0.04204801945546505] |
1,802.01851 | A propos d'une version faible du probl\`eme inverse de Galois | This paper deals with the Weak Inverse Galois Problem which, for a given
field $k$, states that, for every finite group $G$, there exists a finite
separable extension $L/k$ such that ${\rm{Aut}}(L/k)=G$. One of its goals is to
explain how one can generically produce families of fields which fulfill this
problem, but which do not fulfill the usual Inverse Galois Problem. We show
that this holds for, e.g., the fields $\mathbb{Q}^{{{\rm{sol}}}}$,
$\mathbb{Q}^{{{\rm{tr}}}}$, $\mathbb{Q}^{{{\rm{pyth}}}}$, and for the maximal
pro-$p$-extensions of $\mathbb{Q}$. Moreover, we show that, for every finite
non-trivial group $G$, there exists many fields fulfilling the Weak Inverse
Galois Problem, but over which $G$ does not occur as a Galois group. As a
further application, we show that every field fulfills the regular version of
the Weak Inverse Galois Problem.
| math.NT | this paper deals with the weak inverse galois problem which for a given field k states that for every finite group g there exists a finite separable extension lk such that rmautlkg one of its goals is to explain how one can generically produce families of fields which fulfill this problem but which do not fulfill the usual inverse galois problem we show that this holds for eg the fields mathbbqrmsol mathbbqrmtr mathbbqrmpyth and for the maximal propextensions of mathbbq moreover we show that for every finite nontrivial group g there exists many fields fulfilling the weak inverse galois problem but over which g does not occur as a galois group as a further application we show that every field fulfills the regular version of the weak inverse galois problem | [['this', 'paper', 'deals', 'with', 'the', 'weak', 'inverse', 'galois', 'problem', 'which', 'for', 'a', 'given', 'field', 'k', 'states', 'that', 'for', 'every', 'finite', 'group', 'g', 'there', 'exists', 'a', 'finite', 'separable', 'extension', 'lk', 'such', 'that', 'rmautlkg', 'one', 'of', 'its', 'goals', 'is', 'to', 'explain', 'how', 'one', 'can', 'generically', 'produce', 'families', 'of', 'fields', 'which', 'fulfill', 'this', 'problem', 'but', 'which', 'do', 'not', 'fulfill', 'the', 'usual', 'inverse', 'galois', 'problem', 'we', 'show', 'that', 'this', 'holds', 'for', 'eg', 'the', 'fields', 'mathbbqrmsol', 'mathbbqrmtr', 'mathbbqrmpyth', 'and', 'for', 'the', 'maximal', 'propextensions', 'of', 'mathbbq', 'moreover', 'we', 'show', 'that', 'for', 'every', 'finite', 'nontrivial', 'group', 'g', 'there', 'exists', 'many', 'fields', 'fulfilling', 'the', 'weak', 'inverse', 'galois', 'problem', 'but', 'over', 'which', 'g', 'does', 'not', 'occur', 'as', 'a', 'galois', 'group', 'as', 'a', 'further', 'application', 'we', 'show', 'that', 'every', 'field', 'fulfills', 'the', 'regular', 'version', 'of', 'the', 'weak', 'inverse', 'galois', 'problem']] | [-0.17940630342438818, 0.11880507231503724, -0.10988350166380405, 0.08927043520472944, -0.13659064042568206, -0.13352529658004642, -0.011156556106172503, 0.3570517476052046, -0.3596991860866547, -0.23768947079777716, 0.10688338548317551, -0.21762751886248588, -0.1490466663967818, 0.2363669637190178, -0.1027653957773, -0.021783245686907322, 0.05166820175945759, 0.16081441644579172, -0.07454059656523168, -0.2634220194593072, 0.36841676697134973, -0.08677853313088417, 0.221715303869918, 0.06723894913494587, 0.16874346835911275, 0.05727227759733796, 0.06886680490896106, 0.07284377457201481, -0.09926931038458132, 0.05609215730708093, 0.3363545302897692, 0.10976127767562867, 0.3068859943840653, -0.3627338002475444, -0.21182900262624024, 0.3062917295321822, 0.12223291334358509, 0.049644086761632934, -0.08063169571012259, -0.20067511922912673, 0.16611291018128396, -0.14666208101809025, -0.13543332105129957, -0.0516291367597878, 0.07258034435845911, -0.008979855045676232, -0.2804251441489905, 0.01011700090765953, 0.13992570599075407, 0.11039653248339891, -0.04159843346197158, -0.0950864079669118, 0.017200231790542603, 0.09534457453340292, 0.03384664640389383, 0.05737936936318874, 0.05118935995409265, -0.1352365312743932, -0.10438882878236473, 0.4062763077020645, -0.07753072813898325, -0.16740703403390944, 0.13561921879649164, -0.13726890556141735, -0.1841021759584546, 0.09724773702397943, 0.07588642578572034, 0.13080653338693082, -0.04467617919296026, 0.19158636566950007, -0.18126905784010888, 0.15952284958958626, 0.04745254825055599, -0.015506817650049924, 0.1434268230702728, 0.05280881588347256, 0.18445459022140132, 0.10509435714408755, 0.02866252452135086, 0.019894572123885155, -0.38240122389793396, -0.15125983522087336, -0.13368684463761746, 0.07307049713120796, -0.03723612553242128, -0.2102915534451604, 0.37579194210469724, 0.1730246522054076, 0.1458760673813522, 0.11154015050455927, 0.20873878678493202, 0.127067705063615, 0.10076439338177443, 0.10042573514953256, 0.17463355487957596, 0.18189904882013797, -0.016651172761805357, -0.20394270287454128, -0.0158655267492868, 0.10041813923418522] |
1,802.01852 | The Coronal Monsoon: Thermal Nonequilibrium Revealed by Periodic Coronal
Rain | We report on the discovery of periodic coronal rain in an off-limb sequence
of {\it Solar Dynamics Observatory}/Atmospheric Imaging Assembly images. The
showers are co-spatial and in phase with periodic (6.6~hr) intensity pulsations
of coronal loops of the sort described by Auchere et al. (2014) and Froment et
al. (2015, 2017). These new observations make possible a unified description of
both phenomena. Coronal rain and periodic intensity pulsations of loops are two
manifestations of the same physical process: evaporation / condensation cycles
resulting from a state of thermal nonequilibrium (TNE). The fluctuations around
coronal temperatures produce the intensity pulsations of loops, and rain falls
along their legs if thermal runaway cools the periodic condensations down and
below transition-region (TR) temperatures. This scenario is in line with the
predictions of numerical models of quasi-steadily and footpoint heated loops.
The presence of coronal rain -- albeit non-periodic -- in several other
structures within the studied field of view implies that this type of heating
is at play on a large scale.
| astro-ph.SR | we report on the discovery of periodic coronal rain in an offlimb sequence of it solar dynamics observatoryatmospheric imaging assembly images the showers are cospatial and in phase with periodic 66hr intensity pulsations of coronal loops of the sort described by auchere et al 2014 and froment et al 2015 2017 these new observations make possible a unified description of both phenomena coronal rain and periodic intensity pulsations of loops are two manifestations of the same physical process evaporation condensation cycles resulting from a state of thermal nonequilibrium tne the fluctuations around coronal temperatures produce the intensity pulsations of loops and rain falls along their legs if thermal runaway cools the periodic condensations down and below transitionregion tr temperatures this scenario is in line with the predictions of numerical models of quasisteadily and footpoint heated loops the presence of coronal rain albeit nonperiodic in several other structures within the studied field of view implies that this type of heating is at play on a large scale | [['we', 'report', 'on', 'the', 'discovery', 'of', 'periodic', 'coronal', 'rain', 'in', 'an', 'offlimb', 'sequence', 'of', 'it', 'solar', 'dynamics', 'observatoryatmospheric', 'imaging', 'assembly', 'images', 'the', 'showers', 'are', 'cospatial', 'and', 'in', 'phase', 'with', 'periodic', '66hr', 'intensity', 'pulsations', 'of', 'coronal', 'loops', 'of', 'the', 'sort', 'described', 'by', 'auchere', 'et', 'al', '2014', 'and', 'froment', 'et', 'al', '2015', '2017', 'these', 'new', 'observations', 'make', 'possible', 'a', 'unified', 'description', 'of', 'both', 'phenomena', 'coronal', 'rain', 'and', 'periodic', 'intensity', 'pulsations', 'of', 'loops', 'are', 'two', 'manifestations', 'of', 'the', 'same', 'physical', 'process', 'evaporation', 'condensation', 'cycles', 'resulting', 'from', 'a', 'state', 'of', 'thermal', 'nonequilibrium', 'tne', 'the', 'fluctuations', 'around', 'coronal', 'temperatures', 'produce', 'the', 'intensity', 'pulsations', 'of', 'loops', 'and', 'rain', 'falls', 'along', 'their', 'legs', 'if', 'thermal', 'runaway', 'cools', 'the', 'periodic', 'condensations', 'down', 'and', 'below', 'transitionregion', 'tr', 'temperatures', 'this', 'scenario', 'is', 'in', 'line', 'with', 'the', 'predictions', 'of', 'numerical', 'models', 'of', 'quasisteadily', 'and', 'footpoint', 'heated', 'loops', 'the', 'presence', 'of', 'coronal', 'rain', 'albeit', 'nonperiodic', 'in', 'several', 'other', 'structures', 'within', 'the', 'studied', 'field', 'of', 'view', 'implies', 'that', 'this', 'type', 'of', 'heating', 'is', 'at', 'play', 'on', 'a', 'large', 'scale']] | [-0.13140409327243552, 0.2714494354059624, -0.011334956043679838, 0.10112518091167423, -0.03996531113959346, -0.04069912107804207, 0.04250736550665089, 0.41562382038111334, -0.19094815318746938, -0.3320835750732868, 0.09605304320040016, -0.25310208590735506, -0.11917850185197099, 0.20747731834867159, -0.051842142589264575, -0.00918281836323783, 0.08578540261640596, -0.049721674800084825, -0.004430081879225862, -0.19129921324505397, 0.2695028401776988, 0.10609402803509879, 0.20742566600739043, 0.025234419478252074, 0.0616187725267573, -0.11088187444206625, -0.04714954813493793, 0.007196249148916979, -0.09780385269251533, -9.876049832195226e-05, 0.17292901818838097, 0.08314614158489404, 0.18874455962695777, -0.468606173615057, -0.28846430964767933, -0.0013136037873915552, 0.14490084942327414, 0.03665516443552015, -0.03485816880129278, -0.2546203756602081, 0.03174251745357835, -0.09516711889171939, -0.1369222143259288, 0.03303274138190675, 0.04826593751579157, 0.0006209892889290499, -0.2509635340256696, 0.12091246201011117, 0.08905773228062945, 0.12002586398525106, -0.08722841752795903, -0.03438999378865162, -0.06871185178634213, 0.10881865519081797, 0.05990249964682117, 0.02923632267165495, 0.18829716486353543, -0.12316401991593234, -0.10692746844142675, 0.33843326599457146, -0.06262596240738533, 0.015765826632068748, 0.2421867422005333, -0.193077947540163, -0.16661258953326363, 0.25440166300545486, 0.138074015842485, 0.10067892142791483, -0.12341328842873954, 0.012033569427291746, -0.05633524758598419, 0.12795585318771333, 0.14610125745098146, 0.0025390079073562212, 0.3255746378820458, 0.12292413007999353, -0.010660821149137122, 0.14832249815408655, -0.1898585491802292, -0.0871225417248099, -0.27615632818429015, -0.09485655123699296, -0.07682444810141678, 0.029440169378528027, -0.050534077051011386, -0.24331177503693324, 0.4074666794972277, 0.18413017812596372, 0.2312364811906191, -0.0383182530722758, 0.27588752849153214, 0.09375044341239096, 0.02630161650570258, 0.14257835943903202, 0.2395931267082417, 0.1893584095412991, 0.18253475753304782, -0.2512472371407927, 0.02121440546609964, 0.0909528060304858] |
1,802.01853 | Analog quantum simulation of generalized Dicke models in trapped ions | We propose the analog quantum simulation of generalized Dicke models in
trapped ions. By combining bicromatic laser interactions on multiple ions we
can generate all regimes of light-matter coupling in these models, where here
the light mode is mimicked by a motional mode. We present numerical simulations
of the three-qubit Dicke model both in the weak field (WF) regime, where the
Jaynes-Cummings behaviour arises, and the ultrastrong coupling (USC) regime,
where rotating-wave approximation (RWA) cannot be considered. We also simulate
the two-qubit biased Dicke model in the WF and USC regimes and the two-qubit
anisotropic Dicke model in the USC regime and the deep-strong coupling (DSC)
regime. The agreement between the mathematical models and the ion system
convinces us that these quantum simulations can be implemented in the lab with
current or near-future technology. This formalism establishes an avenue for the
quantum simulation of many-spin Dicke models in trapped ions.
| quant-ph cond-mat.mes-hall | we propose the analog quantum simulation of generalized dicke models in trapped ions by combining bicromatic laser interactions on multiple ions we can generate all regimes of lightmatter coupling in these models where here the light mode is mimicked by a motional mode we present numerical simulations of the threequbit dicke model both in the weak field wf regime where the jaynescummings behaviour arises and the ultrastrong coupling usc regime where rotatingwave approximation rwa cannot be considered we also simulate the twoqubit biased dicke model in the wf and usc regimes and the twoqubit anisotropic dicke model in the usc regime and the deepstrong coupling dsc regime the agreement between the mathematical models and the ion system convinces us that these quantum simulations can be implemented in the lab with current or nearfuture technology this formalism establishes an avenue for the quantum simulation of manyspin dicke models in trapped ions | [['we', 'propose', 'the', 'analog', 'quantum', 'simulation', 'of', 'generalized', 'dicke', 'models', 'in', 'trapped', 'ions', 'by', 'combining', 'bicromatic', 'laser', 'interactions', 'on', 'multiple', 'ions', 'we', 'can', 'generate', 'all', 'regimes', 'of', 'lightmatter', 'coupling', 'in', 'these', 'models', 'where', 'here', 'the', 'light', 'mode', 'is', 'mimicked', 'by', 'a', 'motional', 'mode', 'we', 'present', 'numerical', 'simulations', 'of', 'the', 'threequbit', 'dicke', 'model', 'both', 'in', 'the', 'weak', 'field', 'wf', 'regime', 'where', 'the', 'jaynescummings', 'behaviour', 'arises', 'and', 'the', 'ultrastrong', 'coupling', 'usc', 'regime', 'where', 'rotatingwave', 'approximation', 'rwa', 'can', 'not', 'be', 'considered', 'we', 'also', 'simulate', 'the', 'twoqubit', 'biased', 'dicke', 'model', 'in', 'the', 'wf', 'and', 'usc', 'regimes', 'and', 'the', 'twoqubit', 'anisotropic', 'dicke', 'model', 'in', 'the', 'usc', 'regime', 'and', 'the', 'deepstrong', 'coupling', 'dsc', 'regime', 'the', 'agreement', 'between', 'the', 'mathematical', 'models', 'and', 'the', 'ion', 'system', 'convinces', 'us', 'that', 'these', 'quantum', 'simulations', 'can', 'be', 'implemented', 'in', 'the', 'lab', 'with', 'current', 'or', 'nearfuture', 'technology', 'this', 'formalism', 'establishes', 'an', 'avenue', 'for', 'the', 'quantum', 'simulation', 'of', 'manyspin', 'dicke', 'models', 'in', 'trapped', 'ions']] | [-0.14136349433722595, 0.21088148839548618, -0.016965378291982535, 0.03456423685575525, 0.0428667932904015, -0.24983866214441755, 0.06081345716491342, 0.34997296683955936, -0.2235487078440686, -0.24685286335026224, -0.020470061546657235, -0.23585000191815197, -0.12277570167944456, 0.22244366090667123, 0.043267549035760265, 0.05537973036058247, 0.04535666011894743, -0.07430455589201301, -0.004209048308160467, -0.1848536004964262, 0.27509988378267736, 0.05696417991071939, 0.29770699977564313, 0.02991912146098912, 0.08500192212561766, -0.014818888820833915, 0.1417068298906088, 0.005425302119304736, -0.13032875251049214, 0.02906736144485573, 0.2660466284596866, 0.050968195193757615, 0.25545864147444564, -0.4625711487932131, -0.21594579555715124, 0.07450664822012186, 0.17799717815903326, 0.22697282272701463, -0.023716772491267572, -0.36203713992610576, -0.08263174688753983, -0.22807564030090968, -0.11016702368855476, -0.11073479674756527, -0.07134243763439978, -0.00666517204643848, -0.31420388132644195, 0.08227307223850706, 0.058396258074790236, 0.021677615197064976, -0.03436237596596281, -0.009901877910985301, 0.06236188684900602, 0.06401636710390449, -0.07988534585650389, -0.008557902611792088, 0.12831468005664648, -0.14964641593357858, -0.14145189965958707, 0.36855435574116807, -0.12139470939058811, -0.17468100223690272, 0.20512868109780052, -0.18047448344528674, -0.07051335347816348, 0.03485328132286668, 0.1323530778257797, 0.07505150984351834, -0.12240925441806515, 0.13732715756127922, -0.03146789728353421, 0.18244548801926916, 0.009754315614700318, 0.08478895967472151, 0.20941086156914632, 0.13492410793279608, -0.043893154443552095, 0.17639373597388233, -0.07607120411586948, -0.1696137546095997, -0.2902326945312476, -0.12699643021122028, -0.1930790346383583, 0.038555776015952385, -0.07735783659804535, -0.0957500193764766, 0.39984361722444495, 0.19897748975393673, 0.07669583886240919, -0.01741024186524252, 0.28034085950503745, 0.15603303166106344, -0.008943809177726508, 0.055417525597537556, 0.34968540628130235, 0.1635794881513963, 0.07741613850307962, -0.32273028171466045, 0.023480205957894212, 0.007733423098300894] |
1,802.01854 | Blow-up profile of rotating 2D focusing Bose gases | We consider the Gross-Pitaevskii equation describing an attractive Bose gas
trapped to a quasi 2D layer by means of a purely harmonic potential, and which
rotates at a fixed speed of rotation $\Omega$. First we study the behavior of
the ground state when the coupling constant approaches $a\_*$ , the critical
strength of the cubic nonlinearity for the focusing nonlinear Schr{\"o}dinger
equation. We prove that blow-up always happens at the center of the trap, with
the blow-up profile given by the Gagliardo-Nirenberg solution. In particular,
the blow-up scenario is independent of $\Omega$, to leading order. This
generalizes results obtained by Guo and Seiringer (Lett. Math. Phys., 2014,
vol. 104, p. 141--156) in the non-rotating case. In a second part we consider
the many-particle Hamiltonian for $N$ bosons, interacting with a potential
rescaled in the mean-field manner $--a\_N N^{2\beta--1} w(N^{\beta} x), with
$w$ a positive function such that $\int\_{\mathbb{R}^2} w(x) dx = 1$. Assuming
that $\beta < 1/2$ and that $a\_N \to a\_*$ sufficiently slowly, we prove that
the many-body system is fully condensed on the Gross-Pitaevskii ground state in
the limit $N \to \infty$.
| math.AP cond-mat.quant-gas math-ph math.MP | we consider the grosspitaevskii equation describing an attractive bose gas trapped to a quasi 2d layer by means of a purely harmonic potential and which rotates at a fixed speed of rotation omega first we study the behavior of the ground state when the coupling constant approaches a_ the critical strength of the cubic nonlinearity for the focusing nonlinear schrodinger equation we prove that blowup always happens at the center of the trap with the blowup profile given by the gagliardonirenberg solution in particular the blowup scenario is independent of omega to leading order this generalizes results obtained by guo and seiringer lett math phys 2014 vol 104 p 141156 in the nonrotating case in a second part we consider the manyparticle hamiltonian for n bosons interacting with a potential rescaled in the meanfield manner a_n n2beta1 wnbeta x with w a positive function such that int_mathbbr2 wx dx 1 assuming that beta 12 and that a_n to a_ sufficiently slowly we prove that the manybody system is fully condensed on the grosspitaevskii ground state in the limit n to infty | [['we', 'consider', 'the', 'grosspitaevskii', 'equation', 'describing', 'an', 'attractive', 'bose', 'gas', 'trapped', 'to', 'a', 'quasi', '2d', 'layer', 'by', 'means', 'of', 'a', 'purely', 'harmonic', 'potential', 'and', 'which', 'rotates', 'at', 'a', 'fixed', 'speed', 'of', 'rotation', 'omega', 'first', 'we', 'study', 'the', 'behavior', 'of', 'the', 'ground', 'state', 'when', 'the', 'coupling', 'constant', 'approaches', 'a_', 'the', 'critical', 'strength', 'of', 'the', 'cubic', 'nonlinearity', 'for', 'the', 'focusing', 'nonlinear', 'schrodinger', 'equation', 'we', 'prove', 'that', 'blowup', 'always', 'happens', 'at', 'the', 'center', 'of', 'the', 'trap', 'with', 'the', 'blowup', 'profile', 'given', 'by', 'the', 'gagliardonirenberg', 'solution', 'in', 'particular', 'the', 'blowup', 'scenario', 'is', 'independent', 'of', 'omega', 'to', 'leading', 'order', 'this', 'generalizes', 'results', 'obtained', 'by', 'guo', 'and', 'seiringer', 'lett', 'math', 'phys', '2014', 'vol', '104', 'p', '141156', 'in', 'the', 'nonrotating', 'case', 'in', 'a', 'second', 'part', 'we', 'consider', 'the', 'manyparticle', 'hamiltonian', 'for', 'n', 'bosons', 'interacting', 'with', 'a', 'potential', 'rescaled', 'in', 'the', 'meanfield', 'manner', 'a_n', 'n2beta1', 'wnbeta', 'x', 'with', 'w', 'a', 'positive', 'function', 'such', 'that', 'int_mathbbr2', 'wx', 'dx', '1', 'assuming', 'that', 'beta', '12', 'and', 'that', 'a_n', 'to', 'a_', 'sufficiently', 'slowly', 'we', 'prove', 'that', 'the', 'manybody', 'system', 'is', 'fully', 'condensed', 'on', 'the', 'grosspitaevskii', 'ground', 'state', 'in', 'the', 'limit', 'n', 'to', 'infty']] | [-0.1580380445941066, 0.12425098292540375, -0.0421715092458082, 0.0016471021226607263, -0.00937244662455168, -0.17469172045232706, 0.026644594826097233, 0.29972545685393087, -0.2408099605393167, -0.2111312898433129, 0.032821396270275034, -0.31976045366753353, -0.10227003182138034, 0.13559831225894015, 0.005820978132045168, 0.0658018743420501, 0.025095811184349188, 0.05419381923078863, -0.06295027639625302, -0.2604832919811558, 0.33140062815457416, -0.018301352374569587, 0.2165056842384504, 0.027573101471042197, 0.08555686752719993, 0.022051889168129963, 0.09997736141422445, -0.03598974190987228, -0.23052165360590396, 0.04390854405741511, 0.19687399137869813, 0.025381594876982102, 0.28532459565406937, -0.38554220276183626, -0.19444385276102785, 0.12731311028938364, 0.16516254253664545, 0.10813012954012459, -0.022180705282214528, -0.3184471522219835, 0.05473685449053366, -0.15982823374189353, -0.21948506232623136, -0.051880509807110835, 0.10886799695828323, 0.0471320406159679, -0.3064604517349743, 0.1391256462725068, 0.10885379390445736, 0.026621105802589452, -0.0831113486293065, -0.08080933910331511, -0.030625988357815513, 0.01897283880974642, 0.011306320637558702, 0.10350617594046392, 0.06787024537268817, -0.12930334156530837, -0.04829463579566375, 0.3657491775229573, -0.1288586212642585, -0.20872980742610656, 0.16350618837233843, -0.19604954971366803, -0.09935675341154585, 0.10181607877877488, 0.1297668128580462, 0.13774070043471287, -0.08709626903685838, 0.17385535626155535, -0.05698819484122181, 0.173361684711064, 0.08962769259625439, -0.03520187839938935, 0.14609901746734977, 0.13924766529947938, 0.0797003737593258, 0.11780246069492625, -0.05642879273862777, -0.10999261911466635, -0.3369206528420026, -0.14168331445602889, -0.2120379075411906, 0.1323021942058976, -0.06101902627578761, -0.12721124889716254, 0.34204598209883474, 0.094829018787596, 0.21457371021505822, 0.046294637465865214, 0.20770062214768167, 0.18559878956254447, -0.04102681046469514, 0.1035523960259586, 0.2280618372763078, 0.15911653162610687, 0.12704043577718183, -0.24516130632114613, -0.05108848824872102, 0.12335991532426704] |
1,802.01855 | Properties of the Space of Sections of Some Banach Bundles | One shows for Banach bundles in a certain class that having a second
countable locally compact Hausdorff base space and separable fibers implies the
separability of the Banach space of the all sections that vanish at infinity.
In the reverse direction, it is proved that for a Banach bundle with locally
compact Hausdorff base space the separability of the space of all the sections
that vanish at infinity implies that the base space is second countable. If the
base space is compact and the space of all the sections of the bundle is
generated by a weakly compact subset then the base space is an Eberlein
compact.
| math.FA | one shows for banach bundles in a certain class that having a second countable locally compact hausdorff base space and separable fibers implies the separability of the banach space of the all sections that vanish at infinity in the reverse direction it is proved that for a banach bundle with locally compact hausdorff base space the separability of the space of all the sections that vanish at infinity implies that the base space is second countable if the base space is compact and the space of all the sections of the bundle is generated by a weakly compact subset then the base space is an eberlein compact | [['one', 'shows', 'for', 'banach', 'bundles', 'in', 'a', 'certain', 'class', 'that', 'having', 'a', 'second', 'countable', 'locally', 'compact', 'hausdorff', 'base', 'space', 'and', 'separable', 'fibers', 'implies', 'the', 'separability', 'of', 'the', 'banach', 'space', 'of', 'the', 'all', 'sections', 'that', 'vanish', 'at', 'infinity', 'in', 'the', 'reverse', 'direction', 'it', 'is', 'proved', 'that', 'for', 'a', 'banach', 'bundle', 'with', 'locally', 'compact', 'hausdorff', 'base', 'space', 'the', 'separability', 'of', 'the', 'space', 'of', 'all', 'the', 'sections', 'that', 'vanish', 'at', 'infinity', 'implies', 'that', 'the', 'base', 'space', 'is', 'second', 'countable', 'if', 'the', 'base', 'space', 'is', 'compact', 'and', 'the', 'space', 'of', 'all', 'the', 'sections', 'of', 'the', 'bundle', 'is', 'generated', 'by', 'a', 'weakly', 'compact', 'subset', 'then', 'the', 'base', 'space', 'is', 'an', 'eberlein', 'compact']] | [-0.17173357254164032, 0.15349498755262106, -0.057119311007592724, 0.07195324926946103, -0.11826252058653214, -0.0711920959787948, 0.01759129033258585, 0.38414634814677395, -0.2777861202675327, -0.0735030366525611, 0.12307819952996814, -0.24031575812705766, -0.07657298856528005, 0.2134591008799812, -0.07270960229509901, -0.03496134634103591, 0.05723428349315285, 0.1518914660125553, -0.0987292508372741, -0.2906090168251926, 0.525286240137626, -0.022884073453981465, 0.27250519216443614, -0.0006490351292783411, 0.170670818999871, 0.01806679368019104, 0.01442303157533371, 0.05023544545015581, -0.06900647639849922, 0.13192863536728808, 0.29678595642272, 0.13293582228856665, 0.27550121324537236, -0.3134589727759083, -0.2160929803536317, 0.21486492275704291, 0.05768374116899811, -0.04925940659497734, 0.0354428147781797, -0.29834245359438044, 0.13419796611730742, -0.13642252208752054, -0.15294574624989357, -0.07641555577795082, 0.08749949810460697, 0.010361188430791703, -0.26151365624026995, -0.07995876001420422, 0.1309442899111554, 0.018865512853714628, -0.11950568905291713, -0.026329792793361454, -0.11914096579443072, 0.08771730634975726, -0.01876340735329437, 0.12010142100522313, 0.10567362135641764, 0.004571056498266826, -0.06512846064832166, 0.37561410004011936, -0.08407815426009246, -0.2756330519044232, 0.1648293532013336, -0.26851308153872594, -0.1539578376311774, 0.21823592257694663, 0.10924825333406991, 0.1631609528003452, -0.01912356681564701, 0.220173826918798, -0.12519332046716292, 0.12195607274770737, 0.07422699053362708, 0.05534122442112905, 0.12316255645704603, 0.1673199483715694, 0.1908666769599664, 0.0868374370430187, -0.03664138216838658, -0.023962514139885937, -0.4181784437098932, -0.2554581398536042, -0.1945263566547204, 0.08409438925473212, -0.11293190188469826, -0.17172254207021792, 0.29868470804295805, -0.015847700909128255, 0.23652931174837818, 0.11827858418191427, 0.2334993274830212, 0.0517268571197534, 0.043568095427319826, 0.14104545488518394, 0.1938016983358381, 0.16471126141400885, -0.002324670666358738, -0.08981069852434813, -0.022132596975871336, 0.16600434368946285] |
1,802.01856 | Accurate optical properties from first principles: a Quasiparticle Self
consistent GW plus Bethe-Salpeter Equation approach | We present an approach to calculate the optical absorption spectra that
combines the quasiparticle self-consistent GW method [Phys. Rev. B, 76 165106
(2007)] for the electronic structure with the solution of the ladder
approximation to the Bethe-Salpeter equation for the macroscopic dielectric
function. The solution of the Bethe-Salpeter equation has been implemented
within an all-electron framework, using a linear muffin-tin orbital basis set,
with the contribution from the non-local self-energy to the transition dipole
moments (in the optical limit) evaluated explicitly. This approach addresses
those systems whose electronic structure is poorly described within the
standard perturbative GW approaches with as a starting point density-functional
theory calculations. The merits of this approach have been exemplified by
calculating optical absorption spectra of a strongly correlated transition
metal oxide, NiO, and a narrow gap semiconductor, Ge. In both cases, the
calculated spectrum is in good agreement with the experiment. It is also shown
that for systems whose electronic structure is well-described within the
standard perturbative GW, such as Si, LiF and h-BN, the performance of the
present approach is in general comparable to the standard GW plus
Bethe-Salpeter equation. It is argued that both vertex corrections to the
electronic screening and the electron-phonon interaction are responsible for
the observed systematic overestimation of the fundamental bandgap and spectrum
onset.
| cond-mat.mtrl-sci | we present an approach to calculate the optical absorption spectra that combines the quasiparticle selfconsistent gw method phys rev b 76 165106 2007 for the electronic structure with the solution of the ladder approximation to the bethesalpeter equation for the macroscopic dielectric function the solution of the bethesalpeter equation has been implemented within an allelectron framework using a linear muffintin orbital basis set with the contribution from the nonlocal selfenergy to the transition dipole moments in the optical limit evaluated explicitly this approach addresses those systems whose electronic structure is poorly described within the standard perturbative gw approaches with as a starting point densityfunctional theory calculations the merits of this approach have been exemplified by calculating optical absorption spectra of a strongly correlated transition metal oxide nio and a narrow gap semiconductor ge in both cases the calculated spectrum is in good agreement with the experiment it is also shown that for systems whose electronic structure is welldescribed within the standard perturbative gw such as si lif and hbn the performance of the present approach is in general comparable to the standard gw plus bethesalpeter equation it is argued that both vertex corrections to the electronic screening and the electronphonon interaction are responsible for the observed systematic overestimation of the fundamental bandgap and spectrum onset | [['we', 'present', 'an', 'approach', 'to', 'calculate', 'the', 'optical', 'absorption', 'spectra', 'that', 'combines', 'the', 'quasiparticle', 'selfconsistent', 'gw', 'method', 'phys', 'rev', 'b', '76', '165106', '2007', 'for', 'the', 'electronic', 'structure', 'with', 'the', 'solution', 'of', 'the', 'ladder', 'approximation', 'to', 'the', 'bethesalpeter', 'equation', 'for', 'the', 'macroscopic', 'dielectric', 'function', 'the', 'solution', 'of', 'the', 'bethesalpeter', 'equation', 'has', 'been', 'implemented', 'within', 'an', 'allelectron', 'framework', 'using', 'a', 'linear', 'muffintin', 'orbital', 'basis', 'set', 'with', 'the', 'contribution', 'from', 'the', 'nonlocal', 'selfenergy', 'to', 'the', 'transition', 'dipole', 'moments', 'in', 'the', 'optical', 'limit', 'evaluated', 'explicitly', 'this', 'approach', 'addresses', 'those', 'systems', 'whose', 'electronic', 'structure', 'is', 'poorly', 'described', 'within', 'the', 'standard', 'perturbative', 'gw', 'approaches', 'with', 'as', 'a', 'starting', 'point', 'densityfunctional', 'theory', 'calculations', 'the', 'merits', 'of', 'this', 'approach', 'have', 'been', 'exemplified', 'by', 'calculating', 'optical', 'absorption', 'spectra', 'of', 'a', 'strongly', 'correlated', 'transition', 'metal', 'oxide', 'nio', 'and', 'a', 'narrow', 'gap', 'semiconductor', 'ge', 'in', 'both', 'cases', 'the', 'calculated', 'spectrum', 'is', 'in', 'good', 'agreement', 'with', 'the', 'experiment', 'it', 'is', 'also', 'shown', 'that', 'for', 'systems', 'whose', 'electronic', 'structure', 'is', 'welldescribed', 'within', 'the', 'standard', 'perturbative', 'gw', 'such', 'as', 'si', 'lif', 'and', 'hbn', 'the', 'performance', 'of', 'the', 'present', 'approach', 'is', 'in', 'general', 'comparable', 'to', 'the', 'standard', 'gw', 'plus', 'bethesalpeter', 'equation', 'it', 'is', 'argued', 'that', 'both', 'vertex', 'corrections', 'to', 'the', 'electronic', 'screening', 'and', 'the', 'electronphonon', 'interaction', 'are', 'responsible', 'for', 'the', 'observed', 'systematic', 'overestimation', 'of', 'the', 'fundamental', 'bandgap', 'and', 'spectrum', 'onset']] | [-0.08079884221470506, 0.046738345847953604, -0.06982177697452847, 0.051771364107327626, -0.017031521505946032, -0.10321857705581759, 0.04833350730374473, 0.3870335828173453, -0.23500815716084686, -0.2850554636070313, -0.025329909620319155, -0.3383746594625795, -0.1626586691219638, 0.15580681444550473, 0.0692545089742308, 0.06871549637822835, 0.04261989940923996, -0.03670683532091571, -0.10500064509483946, -0.1672635685193361, 0.2659911900676056, 0.07496723820124622, 0.27395037117100834, 0.08284755935457265, 0.036812979027315555, 0.03230654948802282, 0.042197576214811794, 0.016018349822630947, -0.10836293503659626, 0.09976307382082532, 0.24947111580056294, 0.0009365968371384611, 0.234506299794286, -0.42593757514450176, -0.22850321938727644, -0.003096373697359846, 0.11759454801365316, 0.15543871318538474, -0.03819433563874673, -0.2951832016599234, 0.057667483006621424, -0.20288507685187124, -0.13853803419325256, -0.10965169954905722, 0.015312833198515924, -0.0006608546444402015, -0.24077262274162609, 0.10720516532476204, -0.023106192639010533, -0.0043043807145465435, -0.1033697863594655, -0.14759448101846326, -0.029258876775661222, 0.04001281075788853, -0.008045798289441616, 0.07100271720495771, 0.12422442314961368, -0.08556218877396889, -0.10561513948655757, 0.43859229294287266, -0.10844405158205289, -0.13108089270514098, 0.13691038594724803, -0.15626322559220282, -0.07583956492990777, 0.1707969595260361, 0.0964845624185498, 0.11743582703040426, -0.2115338300798136, 0.13610325013856522, 0.0029156843339589156, 0.1773280976118496, 0.024317719605881895, 0.07482105996521603, 0.18595698226578358, 0.19111182678177535, -0.027649284181050157, 0.072411738211239, -0.09590117397628917, -0.09327174735333875, -0.28225147631019354, -0.10092085036100977, -0.22606327469573817, 0.048335249283324895, -0.05627404541298355, -0.22896588571784718, 0.4226344568681007, 0.138641812838614, 0.1357881995570785, -0.006264134305289938, 0.28218174707927857, 0.19095977357727156, 0.05022118853924091, 0.0700328007893132, 0.31544120757727423, 0.18116178577243586, 0.06621387278526221, -0.2796585880139425, 0.04021633973521416, 0.06820037164159606] |
1,802.01857 | Improved parametrix in the glancing region for the interior
Dirichlet-to-Neumann map | We study the semi-classical microlocal structure of the Dirichlet-to-Neumann
map for an arbitrary compact Riemannian manifold with a non-empty smooth
boundary. We build a new, improved parametrix in the glancing region compaired
with that one built in [9], [12]. We also study the way in which the parametrix
depends on the refraction index. As a consequence, we improve the transmission
eigenvalue-free regions obtained in [12] in the isotropic case when the
restrictions of the refraction indices on the boundary coincide.
| math.AP | we study the semiclassical microlocal structure of the dirichlettoneumann map for an arbitrary compact riemannian manifold with a nonempty smooth boundary we build a new improved parametrix in the glancing region compaired with that one built in 9 12 we also study the way in which the parametrix depends on the refraction index as a consequence we improve the transmission eigenvaluefree regions obtained in 12 in the isotropic case when the restrictions of the refraction indices on the boundary coincide | [['we', 'study', 'the', 'semiclassical', 'microlocal', 'structure', 'of', 'the', 'dirichlettoneumann', 'map', 'for', 'an', 'arbitrary', 'compact', 'riemannian', 'manifold', 'with', 'a', 'nonempty', 'smooth', 'boundary', 'we', 'build', 'a', 'new', 'improved', 'parametrix', 'in', 'the', 'glancing', 'region', 'compaired', 'with', 'that', 'one', 'built', 'in', '9', '12', 'we', 'also', 'study', 'the', 'way', 'in', 'which', 'the', 'parametrix', 'depends', 'on', 'the', 'refraction', 'index', 'as', 'a', 'consequence', 'we', 'improve', 'the', 'transmission', 'eigenvaluefree', 'regions', 'obtained', 'in', '12', 'in', 'the', 'isotropic', 'case', 'when', 'the', 'restrictions', 'of', 'the', 'refraction', 'indices', 'on', 'the', 'boundary', 'coincide']] | [-0.12751408321782948, 0.07438456680556556, -0.08327521227765829, 0.05795817424077541, -0.09814427951350808, -0.0843977567332331, 0.027347524277865888, 0.370890932995826, -0.2426655812188983, -0.24108893738593906, 0.13744750249170465, -0.2788799522444606, -0.15595586541458034, 0.19472972676958306, -0.09069744313928822, 0.035367263399530204, 0.02687126430682838, 0.04859731531469151, -0.11253450424119364, -0.17606949311302741, 0.4271408953005448, 0.016030831274110823, 0.2541117146844044, 0.07012186273850603, 0.07158078983193264, 0.011632384397671558, -0.01778918767813593, -0.006144384737126529, -0.1814451693823685, 0.12088742291089147, 0.19018449333962054, 0.030773700628196822, 0.1891597639216343, -0.3980119875865057, -0.23935224614106118, 0.08026830502785742, 0.12761483073118143, 0.027525161315861624, -0.03295711841492448, -0.2936622032400919, 0.06597503646626138, -0.10715351465623826, -0.21151924561709165, 0.007487207604572177, -0.018695964472135528, -0.023762960454041603, -0.2662325247169065, 0.023384132350111032, 0.05975285624153912, 0.04694082472706214, -0.11978758908226154, -0.0825156815291848, -0.02945457211462781, 0.12888300066006195, -0.029067416698671876, 0.035899495727790054, 0.07830565997282975, -0.0751408365817042, -0.08092657765955664, 0.3126240338198841, -0.12870067147887312, -0.25776078205090014, 0.11023030548240058, -0.21729241388384252, -0.13056290207896382, 0.1245304706855677, 0.148787591222208, 0.1664697154366877, -0.07173115296627657, 0.12436363962478936, -0.06606568030256313, 0.1350501200198778, 0.12606769296107814, -0.009627971512963995, 0.1122950576012954, 0.12846487803326453, 0.16013587334309703, 0.1475234226032626, -0.09638721585506574, -0.02601099577441346, -0.3361841719597578, -0.17584796962328256, -0.16578844145988114, 0.11101947610732169, -0.1659840438514948, -0.21334135299548507, 0.39619094679364936, 0.09464541526976973, 0.22306821697857232, 0.029122447870031466, 0.2584413710515946, 0.1325421430359711, 0.013105560558778961, 0.10694852621527388, 0.23253445038571954, 0.12842872163746505, 0.09420499341795222, -0.176714605212328, -0.0390619341051206, 0.10760153581795748] |
1,802.01858 | Quasiparticle dynamics in granular aluminum close to the superconductor
to insulator transition | Superconducting high kinetic inductance elements constitute a valuable
resource for quantum circuit design and millimeter-wave detection. Granular
aluminum (GrAl) in the superconducting regime is a particularly interesting
material since it has already shown a kinetic inductance in the range of
nH$/\Box$ and its deposition is compatible with conventional Al/AlOx/Al
Josephson junction fabrication. We characterize microwave resonators fabricated
from GrAl with a room temperature resistivity of $4 \times
10^3\,\mu\Omega\cdot$cm, which is a factor of 3 below the superconductor to
insulator transition, showing a kinetic inductance fraction close to unity. The
measured internal quality factors are on the order of $Q_{\mathrm{i}} = 10^5$
in the single photon regime, and we demonstrate that non-equilibrium
quasiparticles (QP) constitute the dominant loss mechanism. We extract QP
relaxation times in the range of 1 s and we observe QP bursts every $\sim 20$
s. The current level of coherence of GrAl resonators makes them attractive for
integration in quantum devices, while it also evidences the need to reduce the
density of non-equilibrium QPs.
| cond-mat.supr-con | superconducting high kinetic inductance elements constitute a valuable resource for quantum circuit design and millimeterwave detection granular aluminum gral in the superconducting regime is a particularly interesting material since it has already shown a kinetic inductance in the range of nhbox and its deposition is compatible with conventional alaloxal josephson junction fabrication we characterize microwave resonators fabricated from gral with a room temperature resistivity of 4 times 103muomegacdotcm which is a factor of 3 below the superconductor to insulator transition showing a kinetic inductance fraction close to unity the measured internal quality factors are on the order of q_mathrmi 105 in the single photon regime and we demonstrate that nonequilibrium quasiparticles qp constitute the dominant loss mechanism we extract qp relaxation times in the range of 1 s and we observe qp bursts every sim 20 s the current level of coherence of gral resonators makes them attractive for integration in quantum devices while it also evidences the need to reduce the density of nonequilibrium qps | [['superconducting', 'high', 'kinetic', 'inductance', 'elements', 'constitute', 'a', 'valuable', 'resource', 'for', 'quantum', 'circuit', 'design', 'and', 'millimeterwave', 'detection', 'granular', 'aluminum', 'gral', 'in', 'the', 'superconducting', 'regime', 'is', 'a', 'particularly', 'interesting', 'material', 'since', 'it', 'has', 'already', 'shown', 'a', 'kinetic', 'inductance', 'in', 'the', 'range', 'of', 'nhbox', 'and', 'its', 'deposition', 'is', 'compatible', 'with', 'conventional', 'alaloxal', 'josephson', 'junction', 'fabrication', 'we', 'characterize', 'microwave', 'resonators', 'fabricated', 'from', 'gral', 'with', 'a', 'room', 'temperature', 'resistivity', 'of', '4', 'times', '103muomegacdotcm', 'which', 'is', 'a', 'factor', 'of', '3', 'below', 'the', 'superconductor', 'to', 'insulator', 'transition', 'showing', 'a', 'kinetic', 'inductance', 'fraction', 'close', 'to', 'unity', 'the', 'measured', 'internal', 'quality', 'factors', 'are', 'on', 'the', 'order', 'of', 'q_mathrmi', '105', 'in', 'the', 'single', 'photon', 'regime', 'and', 'we', 'demonstrate', 'that', 'nonequilibrium', 'quasiparticles', 'qp', 'constitute', 'the', 'dominant', 'loss', 'mechanism', 'we', 'extract', 'qp', 'relaxation', 'times', 'in', 'the', 'range', 'of', '1', 's', 'and', 'we', 'observe', 'qp', 'bursts', 'every', 'sim', '20', 's', 'the', 'current', 'level', 'of', 'coherence', 'of', 'gral', 'resonators', 'makes', 'them', 'attractive', 'for', 'integration', 'in', 'quantum', 'devices', 'while', 'it', 'also', 'evidences', 'the', 'need', 'to', 'reduce', 'the', 'density', 'of', 'nonequilibrium', 'qps']] | [-0.18344074289425186, 0.20078693011707469, -0.01702382332054762, -0.005059369760934581, -0.02270262335319208, -0.1725899989591775, 0.06699452487462224, 0.3745499313127522, -0.20272817673933943, -0.31431166835345054, 0.009030760605904705, -0.3190740467554594, -0.07420447545705318, 0.2430386039749265, 0.01984276317866383, 0.053461415976748757, -0.005613581791361112, -0.030177873316527593, -0.08171207113858744, -0.17993916802693205, 0.23147580933206283, 0.05885986522799812, 0.3322452106122666, 0.08386804056410654, 0.12158276501293408, -0.082045582711566, 0.08997066801402537, 0.008142668053595826, -0.16040050633495323, 0.04531811196470588, 0.3006033235592995, -0.016452189836810446, 0.23068212571826469, -0.4346364019685297, -0.21482717263279483, 0.041919270114371236, 0.11999676735055201, 0.09155456730655803, -0.021920025741210117, -0.21924353778509922, 0.08203250306045137, -0.18117144192205514, -0.05818186352225006, -0.06065680179461019, 0.025928223167727815, -0.01194295676875144, -0.2440177826778736, 0.06156234174704878, 0.039414004855022604, 0.02803776859342711, 0.009148317746155776, -0.09545884729844302, 0.015254681061090129, 0.018678759661980154, -0.03668393916379456, 0.034438083653385104, 0.20385714640759967, -0.14419378246189232, -0.06306086281504732, 0.33603690598705194, -0.03838150714532609, -0.07831017583432584, 0.1670614657533162, -0.17215594290698902, -0.056046653780291174, 0.18698733695605257, 0.09701772646697397, 0.04020276420434551, -0.151684250637162, 0.0680000291237176, 0.04240692806892983, 0.22144195797467014, 0.0695607642396126, 0.12720412814424645, 0.24477521277589315, 0.25047934130394955, 0.04052618548001458, 0.13700527428555664, -0.10291267012649857, -0.009423886153210954, -0.2793618060489435, -0.19160399766689984, -0.2024973922305479, 0.12295763314951484, -0.07567586410164595, -0.17194685658845318, 0.36699565544315593, 0.17110473172818652, 0.17523874326398958, -0.010761180710155381, 0.2735250246421457, 0.15567043359553237, 0.10813091149576372, 0.04092794993222214, 0.25430252673615494, 0.1744661978673099, 0.1180921822442764, -0.27324877326836716, 0.016928068218786816, -0.02338318317623173] |
1,802.01859 | Circuit Quantum Electrodynamics of Granular Aluminum Resonators | The introduction of crystalline defects or dopants can give rise to so-called
"dirty superconductors", characterized by reduced coherence length and
quasiparticle mean free path. In particular, granular superconductors such as
Granular Aluminum (GrAl), consisting of remarkably uniform grains connected by
Josephson contacts have attracted interest since the sixties thanks to their
rich phase diagram and practical advantages, like increased critical
temperature, critical field, and kinetic inductance. Here we report the
measurement and modeling of circuit quantum electrodynamics properties of GrAl
microwave resonators in a wide frequency range, up to the spectral
superconducting gap. Interestingly, we observe self-Kerr coefficients ranging
from $10^{-2}$ Hz to $10^5$ Hz, within an order of magnitude from analytic
calculations based on GrAl microstructure. This amenable nonlinearity, combined
with the relatively high quality factors in the $10^5$ range, open new avenues
for applications in quantum information processing and kinetic inductance
detectors.
| cond-mat.supr-con quant-ph | the introduction of crystalline defects or dopants can give rise to socalled dirty superconductors characterized by reduced coherence length and quasiparticle mean free path in particular granular superconductors such as granular aluminum gral consisting of remarkably uniform grains connected by josephson contacts have attracted interest since the sixties thanks to their rich phase diagram and practical advantages like increased critical temperature critical field and kinetic inductance here we report the measurement and modeling of circuit quantum electrodynamics properties of gral microwave resonators in a wide frequency range up to the spectral superconducting gap interestingly we observe selfkerr coefficients ranging from 102 hz to 105 hz within an order of magnitude from analytic calculations based on gral microstructure this amenable nonlinearity combined with the relatively high quality factors in the 105 range open new avenues for applications in quantum information processing and kinetic inductance detectors | [['the', 'introduction', 'of', 'crystalline', 'defects', 'or', 'dopants', 'can', 'give', 'rise', 'to', 'socalled', 'dirty', 'superconductors', 'characterized', 'by', 'reduced', 'coherence', 'length', 'and', 'quasiparticle', 'mean', 'free', 'path', 'in', 'particular', 'granular', 'superconductors', 'such', 'as', 'granular', 'aluminum', 'gral', 'consisting', 'of', 'remarkably', 'uniform', 'grains', 'connected', 'by', 'josephson', 'contacts', 'have', 'attracted', 'interest', 'since', 'the', 'sixties', 'thanks', 'to', 'their', 'rich', 'phase', 'diagram', 'and', 'practical', 'advantages', 'like', 'increased', 'critical', 'temperature', 'critical', 'field', 'and', 'kinetic', 'inductance', 'here', 'we', 'report', 'the', 'measurement', 'and', 'modeling', 'of', 'circuit', 'quantum', 'electrodynamics', 'properties', 'of', 'gral', 'microwave', 'resonators', 'in', 'a', 'wide', 'frequency', 'range', 'up', 'to', 'the', 'spectral', 'superconducting', 'gap', 'interestingly', 'we', 'observe', 'selfkerr', 'coefficients', 'ranging', 'from', '102', 'hz', 'to', '105', 'hz', 'within', 'an', 'order', 'of', 'magnitude', 'from', 'analytic', 'calculations', 'based', 'on', 'gral', 'microstructure', 'this', 'amenable', 'nonlinearity', 'combined', 'with', 'the', 'relatively', 'high', 'quality', 'factors', 'in', 'the', '105', 'range', 'open', 'new', 'avenues', 'for', 'applications', 'in', 'quantum', 'information', 'processing', 'and', 'kinetic', 'inductance', 'detectors']] | [-0.1438832209743042, 0.2168452821369, -0.0012630661852502574, -0.01880044152251988, -0.06717880044016056, -0.13948543428947838, 0.08451777240326111, 0.37151687520155163, -0.21769077607637477, -0.33191777252715027, 0.0354780072650303, -0.30765988614035045, -0.09321233098712077, 0.25215323279715246, -0.03537743823027187, 0.07242254384133655, -0.01922452047195596, -0.04045350591574485, -0.11062265090650827, -0.18781247093284037, 0.24458956713594185, 0.03903272849856876, 0.3549952706509632, 0.07913653102109998, 0.0936363494208005, -0.04330587162338714, 0.050624959219324715, 0.034812744394407166, -0.2196316644614045, 0.07188705909842004, 0.2982412814356697, -0.043088046106277034, 0.219426766185077, -0.461892870034919, -0.2419991097445341, 0.032403045346856944, 0.14258767025765134, 0.08758788382531041, -0.06080599791392968, -0.2704913981918556, 0.03931040921533066, -0.18384831244798583, -0.0875026937428629, -0.08161841255302231, 0.027029447786238354, 0.018087941205724038, -0.19975673267294447, 0.08240815589346716, 0.02250290693175177, 0.09569361404399185, -0.0026653774509921074, -0.096414394010531, 0.04677823394174791, 0.04141458937051033, -0.013591190230929188, 0.015307301978787614, 0.18349456535603773, -0.1396314081883045, -0.06759913697088551, 0.3554638728803386, -0.06920636730097209, -0.06681859378780548, 0.18148458833295283, -0.13493526226860317, -0.057590847153430026, 0.18300714930632644, 0.14586745155732692, 0.030856830370289065, -0.15122369144551662, 0.08900412191441218, 0.08241695638409713, 0.20916755872167414, 0.09967852615874209, 0.1589486835817095, 0.24662163189901143, 0.21088322747932076, 0.02095965229859252, 0.1410858162934245, -0.07818484274078703, -0.05033144203318645, -0.23447169369157767, -0.14984307894095159, -0.19758677789650392, 0.10973279412266695, -0.11638136554665834, -0.21237320264723772, 0.37482507951790467, 0.1834884232214083, 0.17038225184013653, -0.045923868879779346, 0.24560526934348875, 0.10702708203542796, 0.08162463985718205, 0.014778692204143025, 0.23218558534669378, 0.2080961207563329, 0.12521484805620275, -0.2199812667838867, 0.008762665812456463, -0.013007660920266062] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.