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.0286 | Mean field model of a game for power | Our aim is to model a game for power as a dynamical process, where an excess
of power possessed by a player allows him to gain even more power. Such a
positive feedback is often termed as the Matthew effect. Analytical and
numerical methods allow to identify a set of fixed points of the model
dynamics. The positions of the unstable fixed points give an insight on the
basins of attraction of the stable fixed points. The results are interpreted in
terms of modeling of coercive power.
| physics.soc-ph | our aim is to model a game for power as a dynamical process where an excess of power possessed by a player allows him to gain even more power such a positive feedback is often termed as the matthew effect analytical and numerical methods allow to identify a set of fixed points of the model dynamics the positions of the unstable fixed points give an insight on the basins of attraction of the stable fixed points the results are interpreted in terms of modeling of coercive power | [['our', 'aim', 'is', 'to', 'model', 'a', 'game', 'for', 'power', 'as', 'a', 'dynamical', 'process', 'where', 'an', 'excess', 'of', 'power', 'possessed', 'by', 'a', 'player', 'allows', 'him', 'to', 'gain', 'even', 'more', 'power', 'such', 'a', 'positive', 'feedback', 'is', 'often', 'termed', 'as', 'the', 'matthew', 'effect', 'analytical', 'and', 'numerical', 'methods', 'allow', 'to', 'identify', 'a', 'set', 'of', 'fixed', 'points', 'of', 'the', 'model', 'dynamics', 'the', 'positions', 'of', 'the', 'unstable', 'fixed', 'points', 'give', 'an', 'insight', 'on', 'the', 'basins', 'of', 'attraction', 'of', 'the', 'stable', 'fixed', 'points', 'the', 'results', 'are', 'interpreted', 'in', 'terms', 'of', 'modeling', 'of', 'coercive', 'power']] | [-0.13685536353939867, 0.057709884902411517, -0.14008430820814838, 0.05304734921160214, -0.05529553346046857, -0.1384732592007916, 0.10225861633046605, 0.3005728935448175, -0.26161100674720333, -0.2800593001917861, 0.08022411762677861, -0.2964298238727898, -0.14837473915654353, 0.18928442586577315, -0.0747314485207457, 0.025964888406853223, -0.00021000905497663323, 0.08086804571914775, 0.017805281435085953, -0.2259415857836433, 0.31887032490908757, 0.10098022598259408, 0.22055318613333263, 0.024720580157176215, 0.1065882937715057, -0.04660733070374391, -0.01011290798905766, 0.058748755412679377, -0.10977203854033188, 0.09158126318334849, 0.23054719127543355, 0.10563161713874032, 0.3466337479907891, -0.4096053756837701, -0.21487110188958802, 0.1410458948270514, 0.12394496561937976, 0.07489630461659753, -0.05775317709324962, -0.24457079347694058, 0.10879669669244824, -0.16194330373158058, -0.14584488504105944, -0.08246725699168513, 0.016813660217127924, 0.047896930278449, -0.3327803057564915, 0.006185034198964807, 0.09376877418220118, 0.08405931722158673, -0.0722915998709538, -0.09607042886059859, -0.05380811844684783, 0.17621946486312595, 0.03818096696023144, -0.015190917718887928, 0.114723173805095, -0.1386067843942464, -0.14029618958546514, 0.39421835167657304, -0.02369885578425066, -0.2017758908553113, 0.18275332163441285, -0.10344930897177808, -0.053155921094504927, 0.16443941267956605, 0.1824434271681754, 0.12045040979296312, -0.11939797073003204, 0.05654840209272465, -0.039942963744631445, 0.17483429353812646, 0.038485638642062746, 0.003611535925803513, 0.22461963632283197, 0.15974204868463607, 0.1272586721434504, 0.14296481402151973, -0.050494273479535494, -0.14037393577846474, -0.2922733259740575, -0.10758014192440729, -0.15563510133531586, 0.054513700673056914, -0.1167047853933195, -0.17785078954572478, 0.41093361176999993, 0.11821285116047352, 0.24749657773980122, 0.045262939639218236, 0.29255523425580443, 0.15580314076950522, 0.016131063859010565, 0.03881966993854991, 0.20314616480863643, 0.09299684018592468, 0.08148415873212547, -0.21459802127732286, 0.0736743756195252, 0.05669307252713319] |
1,802.02861 | Gamma-positivity and partial gamma-positivity of descent-type
polynomials | In this paper, we study gamma-positivity of descent-type polynomials by
introducing the change of context-free grammars method. We first present
grammatical proofs of the gamma-positivity of the Eulerian polynomials, type B
Eulerian polynomials, derangement polynomials, Narayana polynomials and type B
Narayana polynomials. We then provide partial gamma-positive expansions for
several multivariate polynomials associated to Stirling permutations,
Legendre-Stirling permutations, Jacobi-Stirling permutations and type B
derangements, and the recurrences for the partial gamma-coefficients of these
expansions are also obtained. Moreover, we define variants of the Foata-Strehl
group action which are used to give combinatorial interpretations for the
coefficients of most of these partial gamma-positive expansions.
| math.CO | in this paper we study gammapositivity of descenttype polynomials by introducing the change of contextfree grammars method we first present grammatical proofs of the gammapositivity of the eulerian polynomials type b eulerian polynomials derangement polynomials narayana polynomials and type b narayana polynomials we then provide partial gammapositive expansions for several multivariate polynomials associated to stirling permutations legendrestirling permutations jacobistirling permutations and type b derangements and the recurrences for the partial gammacoefficients of these expansions are also obtained moreover we define variants of the foatastrehl group action which are used to give combinatorial interpretations for the coefficients of most of these partial gammapositive expansions | [['in', 'this', 'paper', 'we', 'study', 'gammapositivity', 'of', 'descenttype', 'polynomials', 'by', 'introducing', 'the', 'change', 'of', 'contextfree', 'grammars', 'method', 'we', 'first', 'present', 'grammatical', 'proofs', 'of', 'the', 'gammapositivity', 'of', 'the', 'eulerian', 'polynomials', 'type', 'b', 'eulerian', 'polynomials', 'derangement', 'polynomials', 'narayana', 'polynomials', 'and', 'type', 'b', 'narayana', 'polynomials', 'we', 'then', 'provide', 'partial', 'gammapositive', 'expansions', 'for', 'several', 'multivariate', 'polynomials', 'associated', 'to', 'stirling', 'permutations', 'legendrestirling', 'permutations', 'jacobistirling', 'permutations', 'and', 'type', 'b', 'derangements', 'and', 'the', 'recurrences', 'for', 'the', 'partial', 'gammacoefficients', 'of', 'these', 'expansions', 'are', 'also', 'obtained', 'moreover', 'we', 'define', 'variants', 'of', 'the', 'foatastrehl', 'group', 'action', 'which', 'are', 'used', 'to', 'give', 'combinatorial', 'interpretations', 'for', 'the', 'coefficients', 'of', 'most', 'of', 'these', 'partial', 'gammapositive', 'expansions']] | [-0.19484861900982475, 0.08234720601184854, -0.07619993074896556, 0.10130617398547136, -0.158913279747934, -0.1138084577667771, 0.0524647210812811, 0.2816446142822721, -0.3456219145180477, -0.21411903990089026, 0.07835266224529087, -0.25014364151555357, -0.19712585299411445, 0.15712283709475283, -0.11476467050684308, 0.05735247021708276, 0.029298541251371064, 0.03197025513820106, -0.09346199864898842, -0.313594805438397, 0.31866134352218, -0.04435018745241958, 0.11678084413728958, -0.042739670958767816, 0.09045214599305854, -0.03058659095425629, -0.11582111332619797, -0.04145253534672908, -0.19348465278744698, 0.11651554322819614, 0.2908576197596719, 0.1831584527864781, 0.1836464448269113, -0.39098502842944516, -0.02274166469380838, 0.1708881424161271, 0.19368954142555594, 0.044031576742870206, -0.0019337845383013048, -0.2657161248097359, 0.07032597446090823, -0.1835481411985402, -0.1271892575845484, -0.13065076686297228, 0.04217812548237808, 0.17741464880222763, -0.3200081458441841, 0.06270042632099522, 0.12498733000287297, 0.1726964531461844, 0.06648994433621253, -0.24219904009487878, 0.07463774717078336, 0.031851292223524355, -0.004575082236557331, -0.039452618600583626, -0.021825625927377384, -0.06576290475521056, -0.2070080228692409, 0.3652520932401847, 0.027069841104659063, -0.25101914113948065, 0.08197901775671658, -0.18323327746531629, -0.2712745481414847, 0.070418833066637, 0.11454439374790029, 0.1895372079486407, -0.0700567091173194, 0.054587465058221, -0.15386859401246733, 0.04447856326632708, 0.2556311663475285, 0.029643689010979482, 0.08100167018117256, -0.06524297774959247, -0.020214802142485833, 0.1985342667157789, 0.03863210699383115, -0.042216209274291705, -0.33093940484726314, -0.1871482676383361, -0.1073930901260504, 0.006754254409139162, -0.19574009464051714, -0.2275277948712261, 0.4275286463134497, 0.12601641582741033, 0.09956037247490174, 0.18911048720333073, 0.16019631553558833, 0.13240531883518963, 0.025368454802252388, 0.002796757799003599, 0.020468887068258907, 0.2722492337936662, 0.04969241332660601, -0.1566883923476833, 0.05668367053725693, 0.3272915346620297] |
1,802.02862 | Noncommutative Heisenberg algebra in the neighbourhood of a generic null
surface | We show that the diffeomorphisms, which preserve the null nature for a
generic null metric very near to the null surface, provide {\it noncommutative}
Heisenberg algebra. This is the generalization of the earlier work (Phys. Rev.
D95, 044020 (2017)) \cite{Majhi:2017fua}, done for the Rindler horizon. The
present analysis revels that the algebra is very general as it is obtained for
a generic null surface and is applicable for any spacetime horizon. Finally
using these results, the entropy of the null surface is derived in the form of
the Cardy formula. Our analysis is completely {\it off-shell} as no equation of
motion is used. We believe present discussion can illuminate the paradigm of
`gravity as an emergent phenomenon' and could be a candidate to probe the
origin of gravitational entropy.
| gr-qc hep-th | we show that the diffeomorphisms which preserve the null nature for a generic null metric very near to the null surface provide it noncommutative heisenberg algebra this is the generalization of the earlier work phys rev d95 044020 2017 citemajhi2017fua done for the rindler horizon the present analysis revels that the algebra is very general as it is obtained for a generic null surface and is applicable for any spacetime horizon finally using these results the entropy of the null surface is derived in the form of the cardy formula our analysis is completely it offshell as no equation of motion is used we believe present discussion can illuminate the paradigm of gravity as an emergent phenomenon and could be a candidate to probe the origin of gravitational entropy | [['we', 'show', 'that', 'the', 'diffeomorphisms', 'which', 'preserve', 'the', 'null', 'nature', 'for', 'a', 'generic', 'null', 'metric', 'very', 'near', 'to', 'the', 'null', 'surface', 'provide', 'it', 'noncommutative', 'heisenberg', 'algebra', 'this', 'is', 'the', 'generalization', 'of', 'the', 'earlier', 'work', 'phys', 'rev', 'd95', '044020', '2017', 'citemajhi2017fua', 'done', 'for', 'the', 'rindler', 'horizon', 'the', 'present', 'analysis', 'revels', 'that', 'the', 'algebra', 'is', 'very', 'general', 'as', 'it', 'is', 'obtained', 'for', 'a', 'generic', 'null', 'surface', 'and', 'is', 'applicable', 'for', 'any', 'spacetime', 'horizon', 'finally', 'using', 'these', 'results', 'the', 'entropy', 'of', 'the', 'null', 'surface', 'is', 'derived', 'in', 'the', 'form', 'of', 'the', 'cardy', 'formula', 'our', 'analysis', 'is', 'completely', 'it', 'offshell', 'as', 'no', 'equation', 'of', 'motion', 'is', 'used', 'we', 'believe', 'present', 'discussion', 'can', 'illuminate', 'the', 'paradigm', 'of', 'gravity', 'as', 'an', 'emergent', 'phenomenon', 'and', 'could', 'be', 'a', 'candidate', 'to', 'probe', 'the', 'origin', 'of', 'gravitational', 'entropy']] | [-0.12622242077715753, 0.07858018192756411, -0.1504483106546104, 0.08427735643028685, -0.11303442163671565, -0.1290892549995773, -0.014954331591285355, 0.2925377311624997, -0.2034013695596886, -0.2541834819387263, 0.09518233904574712, -0.25511252243570454, -0.17853175335395055, 0.2121024642902331, -0.08416436234393751, 0.01936848100832128, 0.03791436703791329, 0.06655113503000494, -0.08562648672185193, -0.214103583143804, 0.3187422223396482, 0.1233678793172099, 0.2746837678453408, 0.06929284955125566, 0.10221564363116237, 0.014909124823184464, 0.004805531191426938, 0.0534949838293819, -0.14593760298226327, 0.07916836852691775, 0.22620161282683277, 0.14972527921896459, 0.17952762743619483, -0.3844166753270964, -0.252974099164286, 0.08770084392836713, 0.11416536802517646, 0.1417942983015829, -0.039699051969164, -0.31494020205724427, 0.08377280898252869, -0.17070469824142578, -0.18898889000388228, -0.0966693810150614, 0.04988144873641431, -0.0853012468112178, -0.22174274462355872, 0.10015360889113031, 0.10706975757635719, 0.025829445915942915, -0.08599861625097985, -0.02144470028890898, -0.046865126523225914, 0.059647967582421864, 0.07763819706417238, 0.08396748158261254, 0.12195478289894114, -0.043605844902725316, -0.09924177102392584, 0.3593751729033359, -0.05297543240370097, -0.2422015736117642, 0.17904960152722427, -0.16078993374129802, -0.1380040297013392, 0.0697748561969071, 0.10274045651514582, 0.15798755245618742, -0.17467375997248596, 0.1496469416155106, -0.07952996301574736, 0.09590794244693138, 0.07135097222864686, 0.014262143985870638, 0.25621569438243474, 0.12263571079380399, 0.046049820765207604, 0.14670149632271262, -0.08344396409087294, -0.07042633392298081, -0.4179629844642706, -0.23549579734378678, -0.1950912531318627, 0.0836464397001491, -0.08418898137747384, -0.1673713276019745, 0.3370782187718194, 0.15066668858951485, 0.17913524021911345, 0.051830674067880285, 0.2251677021501571, 0.13548724447087362, 0.039389752878213495, 0.10383691386444362, 0.2854874502192801, 0.1446626757337587, 0.07984031003342545, -0.20256407499610352, 0.006527163256986404, 0.09853253945502943] |
1,802.02863 | Generalized Verma modules over U_q(sl_n(C)) | We construct realizations of quantum generalized Verma modules for
U_q(sl_n(C)) by quan- tum differential operators. Taking the classical limit q
! 1 provides a realization of classical generalized Verma modules for sl_n(C)
by differential operators.
| math.QA | we construct realizations of quantum generalized verma modules for u_qsl_nc by quan tum differential operators taking the classical limit q 1 provides a realization of classical generalized verma modules for sl_nc by differential operators | [['we', 'construct', 'realizations', 'of', 'quantum', 'generalized', 'verma', 'modules', 'for', 'u_qsl_nc', 'by', 'quan', 'tum', 'differential', 'operators', 'taking', 'the', 'classical', 'limit', 'q', '1', 'provides', 'a', 'realization', 'of', 'classical', 'generalized', 'verma', 'modules', 'for', 'sl_nc', 'by', 'differential', 'operators']] | [-0.1937536337610447, 0.10001953253804734, -0.04984053749252449, 0.03869293314037901, -0.0444965552905518, -0.19997345948253165, -0.04267853027858743, 0.20397897770233225, -0.3281493825329976, -0.172129322577155, 0.07090410513267147, -0.2219878159124743, -0.17197259109128604, 0.27275977729622164, -0.13778228071433576, 0.0967128003636996, 0.08864240687001836, 0.026534792543812233, -0.08746593259980506, -0.239804105240513, 0.44608891823075036, 0.028284617082328732, 0.24184530352552733, -0.08475669682251685, 0.23403086671323486, 0.13674170762356935, -0.01578592486453779, -0.07544201278043064, -0.1876919541338628, 0.13111987103228318, 0.3385856712632107, 0.0018138775150432732, 0.18355079147626052, -0.37484804518295056, -0.1086198262531649, 0.13884450929860273, 0.0725608818571676, 0.07047110457311977, 0.008534514175897295, -0.3287612882894323, 0.07776663443920287, -0.2730547113231186, -0.11403812180188569, -0.15516104673345885, 0.05718623920146263, -0.019493781270064188, -0.30311155477256485, 0.042875685637365234, 0.10688733936033466, 0.08617689364561529, -0.09117469947898027, -0.16296897859623036, -0.002616003720146237, 0.024107162346781202, -0.24352649469493012, -0.12961424293109414, 0.11088106484914367, -0.11611919996864868, -0.30272842187321547, 0.3000486826129032, -0.08183416097678921, -0.2407791833534385, 0.031023286734566544, -0.12845111144424387, -0.09754961576651443, 0.0003090915129040227, 0.009394403151942022, 0.05166687810737075, -0.10830218649723312, 0.25615140862029157, -0.07575506434747667, -0.019960868221735865, 0.10613192056277485, 0.060657231504041134, 0.11524134355060982, 0.05565208648190354, 0.01340556401533611, 0.1398174820904828, 0.044251634358343755, -0.10291887701235035, -0.38611794646942255, -0.24382221749560398, -0.0396584127888535, 0.14160816168243234, -0.06233590567540942, -0.13080501238900152, 0.421636777845296, 0.09344256122836447, 0.1767120682211085, 0.11070785191700314, 0.16563351170131654, 0.20760503186223409, 0.11421350468740318, -0.006259512438467054, 0.14659138735045085, 0.3144959857207582, 0.0665335056343765, -0.12602984498847614, -0.1018159267189207, 0.2473892831441128] |
1,802.02864 | Gauge Invariant Noether's Theorem and The Proton Spin Crisis | Due to proton spin crisis it is necessary to understand the gauge invariant
definition of the spin and orbital angular momentum of the quark and gluon from
first principle. In this paper we derive the gauge invariant Noether's theorem
by using combined Lorentz transformation plus local gauge transformation. We
find that the notion of the gauge invariant definition of the spin (or orbital)
angular momentum of the electromagnetic field does not exist in Dirac-Maxwell
theory although the notion of the gauge invariant definition of the spin (or
orbital) angular momentum of the electron exists. We find that the gauge
invariant definition of the spin angular momentum of the electromagnetic field
in the literature is not correct because of the non-vanishing surface term in
Dirac-Maxwell theory although the corresponding surface term vanishes for
linear momentum. We also show that the Belinfante-Rosenfeld tensor is not
required to obtain symmetric and gauge invariant energy momentum tensor of the
electron and the electromagnetic field in Dirac-Maxwell theory.
| hep-ph nucl-th | due to proton spin crisis it is necessary to understand the gauge invariant definition of the spin and orbital angular momentum of the quark and gluon from first principle in this paper we derive the gauge invariant noethers theorem by using combined lorentz transformation plus local gauge transformation we find that the notion of the gauge invariant definition of the spin or orbital angular momentum of the electromagnetic field does not exist in diracmaxwell theory although the notion of the gauge invariant definition of the spin or orbital angular momentum of the electron exists we find that the gauge invariant definition of the spin angular momentum of the electromagnetic field in the literature is not correct because of the nonvanishing surface term in diracmaxwell theory although the corresponding surface term vanishes for linear momentum we also show that the belinfanterosenfeld tensor is not required to obtain symmetric and gauge invariant energy momentum tensor of the electron and the electromagnetic field in diracmaxwell theory | [['due', 'to', 'proton', 'spin', 'crisis', 'it', 'is', 'necessary', 'to', 'understand', 'the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'and', 'orbital', 'angular', 'momentum', 'of', 'the', 'quark', 'and', 'gluon', 'from', 'first', 'principle', 'in', 'this', 'paper', 'we', 'derive', 'the', 'gauge', 'invariant', 'noethers', 'theorem', 'by', 'using', 'combined', 'lorentz', 'transformation', 'plus', 'local', 'gauge', 'transformation', 'we', 'find', 'that', 'the', 'notion', 'of', 'the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'or', 'orbital', 'angular', 'momentum', 'of', 'the', 'electromagnetic', 'field', 'does', 'not', 'exist', 'in', 'diracmaxwell', 'theory', 'although', 'the', 'notion', 'of', 'the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'or', 'orbital', 'angular', 'momentum', 'of', 'the', 'electron', 'exists', 'we', 'find', 'that', 'the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'angular', 'momentum', 'of', 'the', 'electromagnetic', 'field', 'in', 'the', 'literature', 'is', 'not', 'correct', 'because', 'of', 'the', 'nonvanishing', 'surface', 'term', 'in', 'diracmaxwell', 'theory', 'although', 'the', 'corresponding', 'surface', 'term', 'vanishes', 'for', 'linear', 'momentum', 'we', 'also', 'show', 'that', 'the', 'belinfanterosenfeld', 'tensor', 'is', 'not', 'required', 'to', 'obtain', 'symmetric', 'and', 'gauge', 'invariant', 'energy', 'momentum', 'tensor', 'of', 'the', 'electron', 'and', 'the', 'electromagnetic', 'field', 'in', 'diracmaxwell', 'theory']] | [-0.17980156158685592, 0.22736184596886824, -0.130218548048859, 0.10368890808809526, -0.1161632054668217, -0.06372692674916934, -0.028836969848282268, 0.3148822061191856, -0.23258747141436886, -0.29371744906815467, -0.005595226450737543, -0.20120366856432947, -0.1113680587550111, 0.10188447261954789, -0.013126565320588694, 0.04199038753914504, -0.0003656248242074361, 0.06602614031578957, -0.15739453329484726, -0.17398848840281184, 0.38420491701883314, 0.036664166687730634, 0.2639475477162314, 0.1095285562232731, 0.18583008024750128, 0.08602712142418362, -0.07553552333951179, -0.01324253192491418, -0.12813851578682312, 0.0667572969319356, 0.19451771789063282, 0.02464038813115309, 0.15328745340551336, -0.3911704478751114, -0.13555420663613438, 0.08879307437505275, 0.0935895313691645, 0.15245066093926551, -0.004571672393283321, -0.24016934619827962, 0.05402429750691985, -0.21324721034730504, -0.18037297987404846, -0.12871177038577802, 0.01866360171769454, -0.05569162443737311, -0.2486334300965665, 0.12699904846897217, 0.12710273845772618, 0.05166156255451539, -0.09583563022201229, -0.07232540627038735, -0.12579461078850862, 0.015767582957889954, 0.16529932232613623, 0.11900533040974037, 0.1389165708096698, -0.15590129568287245, -0.10262306786479394, 0.39331716577882414, -0.07157439424262091, -0.2694145723323172, 0.10878249419498846, -0.2009901927506974, -0.12289659177421655, 0.11458790597957244, 0.12477334686826366, 0.1064097421883714, -0.14842063303968292, 0.16540535979767107, -0.06736547800432319, 0.12427530145384029, 0.08423955519140863, 0.11647565286903659, 0.24570624690868556, 0.01869472751302496, 0.08927775085246636, 0.08120909867168295, -0.07983454937069602, -0.12240263480304575, -0.34560896038003497, -0.1846509666462069, -0.20915478116552705, 0.12770784166354066, -0.05229189635286225, -0.1452573739232187, 0.4009482141961258, 0.13796020437894743, 0.13179112718786268, 0.025981388648291994, 0.27098746992793343, 0.15068287274406, 0.10142107929840136, 0.0704497569926266, 0.2770818197996887, 0.21667214299757834, 0.11584470627909424, -0.29722851800319505, -0.06357162772032197, 0.11855907378821103] |
1,802.02865 | A curvature bound from gravitational catalysis | We determine bounds on the curvature of local patches of spacetime from the
requirement of intact long-range chiral symmetry. The bounds arise from a
scale-dependent analysis of gravitational catalysis and its influence on the
effective potential for the chiral order parameter, as induced by fermionic
fluctuations on a curved spacetime with local hyperbolic properties. The bound
is expressed in terms of the local curvature scalar measured in units of a
gauge-invariant coarse-graining scale. We argue that any effective field theory
of quantum gravity obeying this curvature bound is safe from chiral symmetry
breaking through gravitational catalysis and thus compatible with the
simultaneous existence of chiral fermions in the low-energy spectrum. With
increasing number of dimensions, the curvature bound in terms of the hyperbolic
scale parameter becomes stronger. Applying the curvature bound to the
asymptotic safety scenario for quantum gravity in four spacetime dimensions
translates into bounds on the matter content of particle physics models.
| hep-th gr-qc hep-ph | we determine bounds on the curvature of local patches of spacetime from the requirement of intact longrange chiral symmetry the bounds arise from a scaledependent analysis of gravitational catalysis and its influence on the effective potential for the chiral order parameter as induced by fermionic fluctuations on a curved spacetime with local hyperbolic properties the bound is expressed in terms of the local curvature scalar measured in units of a gaugeinvariant coarsegraining scale we argue that any effective field theory of quantum gravity obeying this curvature bound is safe from chiral symmetry breaking through gravitational catalysis and thus compatible with the simultaneous existence of chiral fermions in the lowenergy spectrum with increasing number of dimensions the curvature bound in terms of the hyperbolic scale parameter becomes stronger applying the curvature bound to the asymptotic safety scenario for quantum gravity in four spacetime dimensions translates into bounds on the matter content of particle physics models | [['we', 'determine', 'bounds', 'on', 'the', 'curvature', 'of', 'local', 'patches', 'of', 'spacetime', 'from', 'the', 'requirement', 'of', 'intact', 'longrange', 'chiral', 'symmetry', 'the', 'bounds', 'arise', 'from', 'a', 'scaledependent', 'analysis', 'of', 'gravitational', 'catalysis', 'and', 'its', 'influence', 'on', 'the', 'effective', 'potential', 'for', 'the', 'chiral', 'order', 'parameter', 'as', 'induced', 'by', 'fermionic', 'fluctuations', 'on', 'a', 'curved', 'spacetime', 'with', 'local', 'hyperbolic', 'properties', 'the', 'bound', 'is', 'expressed', 'in', 'terms', 'of', 'the', 'local', 'curvature', 'scalar', 'measured', 'in', 'units', 'of', 'a', 'gaugeinvariant', 'coarsegraining', 'scale', 'we', 'argue', 'that', 'any', 'effective', 'field', 'theory', 'of', 'quantum', 'gravity', 'obeying', 'this', 'curvature', 'bound', 'is', 'safe', 'from', 'chiral', 'symmetry', 'breaking', 'through', 'gravitational', 'catalysis', 'and', 'thus', 'compatible', 'with', 'the', 'simultaneous', 'existence', 'of', 'chiral', 'fermions', 'in', 'the', 'lowenergy', 'spectrum', 'with', 'increasing', 'number', 'of', 'dimensions', 'the', 'curvature', 'bound', 'in', 'terms', 'of', 'the', 'hyperbolic', 'scale', 'parameter', 'becomes', 'stronger', 'applying', 'the', 'curvature', 'bound', 'to', 'the', 'asymptotic', 'safety', 'scenario', 'for', 'quantum', 'gravity', 'in', 'four', 'spacetime', 'dimensions', 'translates', 'into', 'bounds', 'on', 'the', 'matter', 'content', 'of', 'particle', 'physics', 'models']] | [-0.19035139915460794, 0.23854628970389943, -0.09037289697096332, 0.07326511667463807, -0.06955947269770232, -0.10452256395554098, -0.008709997024127076, 0.24493951167814532, -0.1998049526342324, -0.3138874599516585, 0.05382080777327518, -0.2654634305675115, -0.14860485327829207, 0.12749402864772658, 0.0022066800277559208, 0.047114781962402236, -0.06531070396697221, 0.09711779530656028, -0.08095971592958992, -0.20515321994006827, 0.3660428722497898, 0.04246938097224172, 0.2733702129977695, 0.11891631777216861, 0.08099475223571062, -0.007286438319299903, 0.003305076046199719, 0.04409797821653547, -0.16009586388359562, 0.12016809537595549, 0.1535278150955468, 0.042881780939007345, 0.16872044447386128, -0.446734146759301, -0.2583625926575684, 0.10459646497333011, 0.13163910042373583, 0.13306972388837293, -0.06087706573216801, -0.3242548303013401, 0.06110509017681969, -0.1299076923154077, -0.1768786471379413, -0.07498489977797954, -0.0188959386893669, -0.07708122584267289, -0.2509721392741451, 0.15040296834459613, 0.06251352855783748, 0.06182848931253924, -0.06643332098497308, -0.07111633887707994, -0.050153892596143404, 0.07699411325519542, 0.10910936981717778, 4.0888792363467156e-05, 0.16153193730407384, -0.1963211296885214, -0.09004289885248094, 0.3980114249597219, -0.11768085891214598, -0.2257127838145772, 0.12168583609224237, -0.12951078816988298, -0.14008425091780335, 0.1095769735530938, 0.18163290081013525, 0.11632346920215512, -0.1008068165793265, 0.20282752155674041, 0.005328781480973514, 0.14212670529642227, 0.09145074198098078, 0.10982228747067078, 0.25669587379950404, 0.10952482081559643, 0.11895887944665919, 0.1146908737409122, -0.04003210778451334, -0.1378212549010074, -0.380817320488103, -0.13827928337238293, -0.20027777421977613, 0.06722007539839932, -0.18491857080148116, -0.17224474872126813, 0.3844775790832453, 0.11864836920693807, 0.16355276000576377, 0.05962084427584785, 0.2663012942837479, 0.11619481928011571, 0.09293685808427052, 0.058205843969647376, 0.2811227971899577, 0.16961362499701368, 0.051779442152322885, -0.25188230094651076, -0.028852229565986758, 0.11665988545381016] |
1,802.02866 | Polynomial approximation of the Lense-Thirring rigid precession
frequency | We propose a polynomial approximation of the global Lense-Thirring rigid
precession frequency to study low frequency quasi-periodic oscillations around
spinning black holes. This high-performing approximation allows to determine
the expected frequencies of a precessing thick accretion disc with fixed inner
radius and variable outer radius around a black hole with given mass and spin.
We discuss the accuracy and the applicability regions of our polynomial
approximation, showing that the computational times are reduced by a factor of
$\approx70$ in the range of minutes.
| astro-ph.HE | we propose a polynomial approximation of the global lensethirring rigid precession frequency to study low frequency quasiperiodic oscillations around spinning black holes this highperforming approximation allows to determine the expected frequencies of a precessing thick accretion disc with fixed inner radius and variable outer radius around a black hole with given mass and spin we discuss the accuracy and the applicability regions of our polynomial approximation showing that the computational times are reduced by a factor of approx70 in the range of minutes | [['we', 'propose', 'a', 'polynomial', 'approximation', 'of', 'the', 'global', 'lensethirring', 'rigid', 'precession', 'frequency', 'to', 'study', 'low', 'frequency', 'quasiperiodic', 'oscillations', 'around', 'spinning', 'black', 'holes', 'this', 'highperforming', 'approximation', 'allows', 'to', 'determine', 'the', 'expected', 'frequencies', 'of', 'a', 'precessing', 'thick', 'accretion', 'disc', 'with', 'fixed', 'inner', 'radius', 'and', 'variable', 'outer', 'radius', 'around', 'a', 'black', 'hole', 'with', 'given', 'mass', 'and', 'spin', 'we', 'discuss', 'the', 'accuracy', 'and', 'the', 'applicability', 'regions', 'of', 'our', 'polynomial', 'approximation', 'showing', 'that', 'the', 'computational', 'times', 'are', 'reduced', 'by', 'a', 'factor', 'of', 'approx70', 'in', 'the', 'range', 'of', 'minutes']] | [-0.17168104760797628, 0.09161057429253516, -0.013049615603164736, 0.059201312760530735, -0.07558916371697223, -0.06872172371473119, 0.0639721454872963, 0.35638842148235045, -0.21612256845032954, -0.31628380122269134, 0.09736331336127302, -0.20966983970597594, -0.03843312739136528, 0.22748797598956938, -0.06608721993145454, 0.03135902184224407, 0.012336098802197411, 0.0028583536777331167, -0.15519971454078443, -0.17891858051901302, 0.2586266427267208, 0.09844492118053856, 0.1335722208808524, -0.03341147422521229, 0.07979047763531646, -0.03711594143007175, 0.027972618028162474, 0.004982759985309768, -0.19266970402549558, 0.08075490156300814, 0.23084691249911327, 0.06203336617067815, 0.24058699219611035, -0.38571043239334174, -0.19692819177296506, 0.04146355134434998, 0.15608538466741342, 0.09545920927537582, -0.04936097387269319, -0.21326276512973638, 0.09256102963833206, -0.24957593100661613, -0.22379167648929968, -0.03081479962601001, 0.10069777625781226, -0.0049724576977945596, -0.24967214835426174, 0.15716850939936128, 0.10963078507457871, -0.008021157515425998, -0.1001674200033668, -0.055521381295185135, 0.0008908435393753181, 0.05427999218297472, 0.10101960893406207, 0.057868071178153874, 0.22675562424428133, -0.059584799040310894, -0.08813932715320444, 0.35782922934516365, -0.091220343238618, -0.15351345400180083, 0.1871987017802894, -0.3000474709916456, -0.04551750006356153, 0.1650744464742132, 0.21181137639894543, 0.16900472834998045, -0.07712280482940197, 0.07713876898135395, -0.02461999668515321, 0.2336944626217865, 0.16041744693956642, 0.019837842070419026, 0.34877501568106195, 0.15884427834268525, 0.0441273452422346, 0.14322373516161938, -0.16030254514105283, -0.07556606786247029, -0.2447406616151692, -0.060218997333333434, -0.13016818084961634, 0.07608638537194894, -0.19475879369206103, -0.16038585503596858, 0.3996769095243639, 0.0951915400674993, 0.22497536095016332, 0.07411778980237713, 0.29558335580388456, 0.12196124490232667, 0.045149405882413306, 0.16377752482980848, 0.29421425845294474, 0.13373024166135275, 0.06750284121315701, -0.28695940776133394, -0.021332352486697126, 0.0690320913668677] |
1,802.02867 | Compactly Generated Shape Index Theory and its Application to a Retarded
Nonautonomous Parabolic Equation | We establish the compactly generated shape (H-shape) index theory for local
semiflows on complete metric spaces via more general shape index pairs, and
define the H-shape cohomology index to develop the Morse equations. The main
advantages are that the quotient space $N/E$ is not necessarily metrizable for
the shape index pair $(N,E)$ and $N\sm E$ need not to be a neighborhood of the
compact invariant set. Moreover, in this new theory, the phase space is not
required to be separable. We apply H-shape index theory to an abstract retarded
nonautonomous parabolic equation to obtain the existence of bounded full
solutions.
| math.DS | we establish the compactly generated shape hshape index theory for local semiflows on complete metric spaces via more general shape index pairs and define the hshape cohomology index to develop the morse equations the main advantages are that the quotient space ne is not necessarily metrizable for the shape index pair ne and nsm e need not to be a neighborhood of the compact invariant set moreover in this new theory the phase space is not required to be separable we apply hshape index theory to an abstract retarded nonautonomous parabolic equation to obtain the existence of bounded full solutions | [['we', 'establish', 'the', 'compactly', 'generated', 'shape', 'hshape', 'index', 'theory', 'for', 'local', 'semiflows', 'on', 'complete', 'metric', 'spaces', 'via', 'more', 'general', 'shape', 'index', 'pairs', 'and', 'define', 'the', 'hshape', 'cohomology', 'index', 'to', 'develop', 'the', 'morse', 'equations', 'the', 'main', 'advantages', 'are', 'that', 'the', 'quotient', 'space', 'ne', 'is', 'not', 'necessarily', 'metrizable', 'for', 'the', 'shape', 'index', 'pair', 'ne', 'and', 'nsm', 'e', 'need', 'not', 'to', 'be', 'a', 'neighborhood', 'of', 'the', 'compact', 'invariant', 'set', 'moreover', 'in', 'this', 'new', 'theory', 'the', 'phase', 'space', 'is', 'not', 'required', 'to', 'be', 'separable', 'we', 'apply', 'hshape', 'index', 'theory', 'to', 'an', 'abstract', 'retarded', 'nonautonomous', 'parabolic', 'equation', 'to', 'obtain', 'the', 'existence', 'of', 'bounded', 'full', 'solutions']] | [-0.09326118425349705, 0.08051322918283405, -0.12973841064842417, 0.11054870018386281, -0.1259188728639856, -0.11696167921181769, -0.0204863478790503, 0.3750355101749301, -0.32822596743702886, -0.2176119238557294, 0.06678534142440185, -0.23644584937021138, -0.14121296321973204, 0.16452511958777905, -0.13657732118852436, 0.007348844725638628, 0.01885366013739258, 0.056544887302443385, -0.08067699706647545, -0.21755250149406494, 0.40010052132885904, -0.039314555991441014, 0.23916291206143797, 0.04525157610885799, 0.05244338219985366, 0.022725016898475586, -0.01577583746984601, 0.029708641925244594, -0.17193352200360096, 0.14144344344735146, 0.26281661910004916, 0.1224557266710326, 0.22670320854056628, -0.36521828260272743, -0.20425950791686773, 0.20315080068074168, 0.08402800013776869, 0.015329269689973444, -0.02787894795721513, -0.31407044196501377, 0.15128984350245445, -0.17060440050438047, -0.2040059462422505, -0.09765194694104139, 0.07129128326661885, 0.01710014997050166, -0.2760663829324767, 0.012644339664839209, 0.06356626854045316, 0.018489475371316077, -0.10769676575437188, -0.013173635200364514, -0.08030914335278794, 0.09375247702002526, -0.042458493940066545, 0.041447131426539274, 0.09181928767822684, -0.03395351858111098, -0.09235932839801535, 0.3496817638725042, -0.08865278692916036, -0.28089310476789253, 0.14021137851377716, -0.14863817646866664, -0.1315436276374385, 0.1477119180187583, 0.13457056846003979, 0.16744344117119908, -0.08022591701243073, 0.16281457460368984, -0.05223541978019057, 0.18677790982648731, 0.06146649916190654, 0.03093244646966923, 0.12004173189401626, 0.06813249268569052, 0.1430148375843419, 0.1020980737847276, 0.02257611950626597, -0.08595761759381276, -0.36903397254645826, -0.17270854223985224, -0.14311311774421484, 0.08250472668602014, -0.1143006199967931, -0.2268963849171996, 0.3741494597122073, 0.045983927873894576, 0.13680665847845375, 0.09961574688088148, 0.23162989544682205, 0.14605227046311484, -0.02320084280334413, 0.09512333981081611, 0.17990783967543394, 0.17304356887936592, 0.04717123519862071, -0.14005185648798943, -0.007348394189029932, 0.20937230574010754] |
1,802.02868 | A discrete unified gas-kinetic scheme for immiscible two-phase flows | In this work, we extend the discrete unified gas-kinetic scheme (DUGKS) [Guo
et al., Phys. Rev. E 88, 033305 (2013)] to continue two-phase flows. In the
framework of DUGKS, two kinetic model equations are used to solve the
quasi-incompressible phase-field governing equations [Yang et al., Phys. Rev.E
93, 043303 (2016)]. One is for the Chan-Hilliard (CH) equation and the other is
for the Navier-Stokes equations. The DUGKS can correctly recover the
quasi-incompressible phase-field governing equations through the Chapman-Enskog
analysis. Unlike previous phase-field-based LB models, the
Courant-Friedricks-Lewy condition in DUGKS is ajustable which can increase
numerical stability. Furthermore, with the finite-volume formulation the model
can be easily implemented on non-uniform meshes which can improve numerical
precision. The proposed model is validated by simulating a stationary drop,
layered Poiseuille flow, rising bubble and Rayleigh-Taylor instability and
comparing with the quasi-incompressible lattice Boltzmann method (LBM).
Numerical results show that the method can track the interface with high
accuracy and stability. The model is also capable of dealing with a wider range
of viscosity and density ratios than the quasi-incompressible lattice Boltzmann
model. The present model is a promising tool for numerical simulation of
two-phase flows.
| physics.comp-ph physics.flu-dyn | in this work we extend the discrete unified gaskinetic scheme dugks guo et al phys rev e 88 033305 2013 to continue twophase flows in the framework of dugks two kinetic model equations are used to solve the quasiincompressible phasefield governing equations yang et al phys reve 93 043303 2016 one is for the chanhilliard ch equation and the other is for the navierstokes equations the dugks can correctly recover the quasiincompressible phasefield governing equations through the chapmanenskog analysis unlike previous phasefieldbased lb models the courantfriedrickslewy condition in dugks is ajustable which can increase numerical stability furthermore with the finitevolume formulation the model can be easily implemented on nonuniform meshes which can improve numerical precision the proposed model is validated by simulating a stationary drop layered poiseuille flow rising bubble and rayleightaylor instability and comparing with the quasiincompressible lattice boltzmann method lbm numerical results show that the method can track the interface with high accuracy and stability the model is also capable of dealing with a wider range of viscosity and density ratios than the quasiincompressible lattice boltzmann model the present model is a promising tool for numerical simulation of twophase flows | [['in', 'this', 'work', 'we', 'extend', 'the', 'discrete', 'unified', 'gaskinetic', 'scheme', 'dugks', 'guo', 'et', 'al', 'phys', 'rev', 'e', '88', '033305', '2013', 'to', 'continue', 'twophase', 'flows', 'in', 'the', 'framework', 'of', 'dugks', 'two', 'kinetic', 'model', 'equations', 'are', 'used', 'to', 'solve', 'the', 'quasiincompressible', 'phasefield', 'governing', 'equations', 'yang', 'et', 'al', 'phys', 'reve', '93', '043303', '2016', 'one', 'is', 'for', 'the', 'chanhilliard', 'ch', 'equation', 'and', 'the', 'other', 'is', 'for', 'the', 'navierstokes', 'equations', 'the', 'dugks', 'can', 'correctly', 'recover', 'the', 'quasiincompressible', 'phasefield', 'governing', 'equations', 'through', 'the', 'chapmanenskog', 'analysis', 'unlike', 'previous', 'phasefieldbased', 'lb', 'models', 'the', 'courantfriedrickslewy', 'condition', 'in', 'dugks', 'is', 'ajustable', 'which', 'can', 'increase', 'numerical', 'stability', 'furthermore', 'with', 'the', 'finitevolume', 'formulation', 'the', 'model', 'can', 'be', 'easily', 'implemented', 'on', 'nonuniform', 'meshes', 'which', 'can', 'improve', 'numerical', 'precision', 'the', 'proposed', 'model', 'is', 'validated', 'by', 'simulating', 'a', 'stationary', 'drop', 'layered', 'poiseuille', 'flow', 'rising', 'bubble', 'and', 'rayleightaylor', 'instability', 'and', 'comparing', 'with', 'the', 'quasiincompressible', 'lattice', 'boltzmann', 'method', 'lbm', 'numerical', 'results', 'show', 'that', 'the', 'method', 'can', 'track', 'the', 'interface', 'with', 'high', 'accuracy', 'and', 'stability', 'the', 'model', 'is', 'also', 'capable', 'of', 'dealing', 'with', 'a', 'wider', 'range', 'of', 'viscosity', 'and', 'density', 'ratios', 'than', 'the', 'quasiincompressible', 'lattice', 'boltzmann', 'model', 'the', 'present', 'model', 'is', 'a', 'promising', 'tool', 'for', 'numerical', 'simulation', 'of', 'twophase', 'flows']] | [-0.06525513310817645, 0.06255297693473465, -0.09829129743423223, -0.023161268093006466, -0.07625980129802322, -0.1484493126205981, -0.008407379691290887, 0.2878839883636287, -0.23059004435979544, -0.32304701159777555, 0.059181455674487106, -0.24941612372392827, -0.12218637405052543, 0.19000217706544642, -0.055115367845691585, 0.13963301575921, 0.06955225333729957, -0.12293225982563293, -0.05079152030660399, -0.25890123162869405, 0.2086239484314648, 0.10008885168552181, 0.3343838021813079, 0.04210849504972352, 0.09599906969642108, -0.054951062884201554, -0.03091976143595604, 0.06495675289269012, -0.1966173710957361, 0.038847288869796916, 0.20348341114400836, 0.008466328157389418, 0.24061937836751818, -0.4351691782395256, -0.3453029246698629, 0.010438526232548534, 0.14645831315391797, 0.15045170805310493, -0.019501351306779668, -0.26260645123956566, 0.10662285875692527, -0.21976929712307422, -0.1446096788413149, -0.11558480745557934, -0.013078365009278059, 0.05329491952037875, -0.3179810677972087, 0.18130225502805997, 0.04104391493131109, 0.00321088946223794, -0.09131472113175675, -0.0820970320256744, -0.056604446575758936, 0.0022465769186655574, -0.028056410741942758, 0.04319277363383469, 0.056597085216360046, -0.07640262209547763, -0.07324890908785164, 0.4233465432783866, -0.06778148160369614, -0.2697193847942547, 0.23067963374481398, -0.06324485608948112, -0.0796241940573809, 0.15692584976514287, 0.1811979666347318, 0.15449824335519224, -0.1527116792626754, 0.0796491413602006, -0.11573505721985675, 0.13774229457696027, 0.031993619414006774, -0.14159476530906606, 0.10190995624338454, 0.19940523049754508, -0.024718479176567113, 0.10297138868190814, -0.07158174611283763, -0.1767125354638646, -0.2781634039166284, -0.1549820374246028, -0.1432148290481022, -0.030280411178419526, -0.09128182532197357, -0.12285467242683343, 0.35420751104451714, 0.19545575340545954, 0.1342352926433879, 0.04330035672210989, 0.2836277942728013, 0.14986557688593785, -0.029858903484753372, 0.16849362761020026, 0.24325298478125912, 0.1819428954721785, 0.16473131560958287, -0.27100625356778185, 0.02241956190815433, 0.18867182512792383] |
1,802.02869 | Relative perturbation bounds with applications to empirical covariance
operators | The goal of this paper is to establish relative perturbation bounds, tailored
for empirical covariance operators. Our main results are expansions for
empirical eigenvalues and spectral projectors, leading to concentration
inequalities and limit theorems. One of the key ingredients is a specific
separation measure for population eigenvalues, which we call the relative rank,
giving rise to a sharp invariance principle in terms of limit theorems,
concentration inequalities and inconsistency results. Our framework is very
general, requiring only $p > 4$ moments and allows for a huge variety of
dependence structures.
| math.PR | the goal of this paper is to establish relative perturbation bounds tailored for empirical covariance operators our main results are expansions for empirical eigenvalues and spectral projectors leading to concentration inequalities and limit theorems one of the key ingredients is a specific separation measure for population eigenvalues which we call the relative rank giving rise to a sharp invariance principle in terms of limit theorems concentration inequalities and inconsistency results our framework is very general requiring only p 4 moments and allows for a huge variety of dependence structures | [['the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'establish', 'relative', 'perturbation', 'bounds', 'tailored', 'for', 'empirical', 'covariance', 'operators', 'our', 'main', 'results', 'are', 'expansions', 'for', 'empirical', 'eigenvalues', 'and', 'spectral', 'projectors', 'leading', 'to', 'concentration', 'inequalities', 'and', 'limit', 'theorems', 'one', 'of', 'the', 'key', 'ingredients', 'is', 'a', 'specific', 'separation', 'measure', 'for', 'population', 'eigenvalues', 'which', 'we', 'call', 'the', 'relative', 'rank', 'giving', 'rise', 'to', 'a', 'sharp', 'invariance', 'principle', 'in', 'terms', 'of', 'limit', 'theorems', 'concentration', 'inequalities', 'and', 'inconsistency', 'results', 'our', 'framework', 'is', 'very', 'general', 'requiring', 'only', 'p', '4', 'moments', 'and', 'allows', 'for', 'a', 'huge', 'variety', 'of', 'dependence', 'structures']] | [-0.07856931120649063, 0.058953591416723336, -0.12772765508695935, 0.12408736809889336, -0.0577249752143084, -0.11130097578018067, 0.06273816926849567, 0.2943476541909609, -0.22508734398720304, -0.31398196480749696, 0.11281412799994388, -0.2842512201713045, -0.1228735168788875, 0.19668469641075123, -0.10440786843177642, 0.06790227969857247, 0.049258464842699884, 0.018642321532445678, -0.10310832647543945, -0.21481532623384442, 0.3442865655537737, 0.021203635365105746, 0.28505700253593746, 0.12152139433356149, 0.06806345731857118, -0.002597512462793776, -0.019756461467510193, -0.013477016512430115, -0.151708393807659, 0.21808860796304902, 0.2714904172534353, 0.10269090514420794, 0.27755899370511933, -0.36097825331132066, -0.13000539816874132, 0.1466923650704701, 0.12639105438615791, 0.10273260300262214, -0.03201849103559939, -0.2472147550747803, 0.08086000862165113, -0.1212408997221808, -0.19398376254464259, -0.15031578433647586, 0.023188435766856405, 0.038484466607483586, -0.3642365590752929, 0.11463176899620992, 0.1371827021594685, 0.04414350191246341, -0.04913375184811087, -0.12457661390738833, 0.0637892057983142, 0.12805992603992647, 0.07490082161783586, -0.03936050386884867, 0.10723480062161604, -0.05260454572990976, -0.10117165992308534, 0.32928076539230483, -0.05195051480838087, -0.19499749941437433, 0.17297781414739535, -0.1573886698153749, -0.17548701627012553, 0.07987830923409776, 0.14866946353001542, 0.13602824781706108, -0.13835646510333494, 0.1082678692431053, -0.016964107762310613, 0.15544116093117868, 0.08648598639378219, 0.09033734277950264, 0.1266929272750623, 0.08676360465136221, 0.14134551614870872, 0.11813210178522414, -0.04884007393141811, -0.09545287745219938, -0.3558643312517847, -0.1550650531844644, -0.204808020127121, 0.05765673965006397, -0.19179564607630514, -0.15454057961822687, 0.3893659865533347, 0.1093599531942458, 0.19393414801007577, 0.11576998769698058, 0.22271143818755498, 0.1612613694245268, 0.0489359785334385, 0.03232026934424897, 0.19480239475418007, 0.2610902102308327, 0.06226545412438723, -0.13935546001440355, 0.07031263758459788, 0.122301757236252] |
1,802.0287 | Biomedical term normalization of EHRs with UMLS | This paper presents a novel prototype for biomedical term normalization of
electronic health record excerpts with the Unified Medical Language System
(UMLS) Metathesaurus. Despite being multilingual and cross-lingual by design,
we first focus on processing clinical text in Spanish because there is no
existing tool for this language and for this specific purpose. The tool is
based on Apache Lucene to index the Metathesaurus and generate mapping
candidates from input text. It uses the IXA pipeline for basic language
processing and resolves ambiguities with the UKB toolkit. It has been evaluated
by measuring its agreement with MetaMap in two English-Spanish parallel
corpora. In addition, we present a web-based interface for the tool.
| cs.CL | this paper presents a novel prototype for biomedical term normalization of electronic health record excerpts with the unified medical language system umls metathesaurus despite being multilingual and crosslingual by design we first focus on processing clinical text in spanish because there is no existing tool for this language and for this specific purpose the tool is based on apache lucene to index the metathesaurus and generate mapping candidates from input text it uses the ixa pipeline for basic language processing and resolves ambiguities with the ukb toolkit it has been evaluated by measuring its agreement with metamap in two englishspanish parallel corpora in addition we present a webbased interface for the tool | [['this', 'paper', 'presents', 'a', 'novel', 'prototype', 'for', 'biomedical', 'term', 'normalization', 'of', 'electronic', 'health', 'record', 'excerpts', 'with', 'the', 'unified', 'medical', 'language', 'system', 'umls', 'metathesaurus', 'despite', 'being', 'multilingual', 'and', 'crosslingual', 'by', 'design', 'we', 'first', 'focus', 'on', 'processing', 'clinical', 'text', 'in', 'spanish', 'because', 'there', 'is', 'no', 'existing', 'tool', 'for', 'this', 'language', 'and', 'for', 'this', 'specific', 'purpose', 'the', 'tool', 'is', 'based', 'on', 'apache', 'lucene', 'to', 'index', 'the', 'metathesaurus', 'and', 'generate', 'mapping', 'candidates', 'from', 'input', 'text', 'it', 'uses', 'the', 'ixa', 'pipeline', 'for', 'basic', 'language', 'processing', 'and', 'resolves', 'ambiguities', 'with', 'the', 'ukb', 'toolkit', 'it', 'has', 'been', 'evaluated', 'by', 'measuring', 'its', 'agreement', 'with', 'metamap', 'in', 'two', 'englishspanish', 'parallel', 'corpora', 'in', 'addition', 'we', 'present', 'a', 'webbased', 'interface', 'for', 'the', 'tool']] | [-0.04249056962293547, -0.014312424504005158, -0.06002356258099311, 0.0628189067933121, -0.13604764438964226, -0.15169310305888453, 0.004583729966963129, 0.4325620414907331, -0.23509937533185826, -0.34400717270568953, 0.08367298476435747, -0.30578410091415587, -0.1399173718281426, 0.2672534611680218, -0.10074947643102156, 0.06524672670009848, 0.12639130629716558, 0.050569045967799986, -0.006425003671120886, -0.199952929272308, 0.29970353836327923, 0.0380133400012546, 0.3637235351011728, 0.05422604867982938, 0.11115911450270596, 0.021838180311779316, -0.09492038789903745, -0.061747165779092325, -0.07378962076361384, 0.18590420101945465, 0.368791623762599, 0.24553236112560708, 0.28750605813252766, -0.371873796942669, -0.154155973194016, 0.021208461185262817, 0.11035466085079017, 0.09622490539101188, -0.12437952428254895, -0.32072559729017114, 0.11343999741901015, -0.1667535596921503, 0.02884423431546033, -0.12131125144324861, 0.04125646855010911, -0.04233642378958311, -0.21375202471998664, 0.022663651688678843, 0.045062650410408106, 0.17506447712983098, -0.022089183952466392, -0.1162452425352541, 0.06720739952078811, 0.1741446056529074, 0.02955514700561007, 0.11929840293738085, 0.09297283630616762, -0.11755746829078055, -0.12607571241017934, 0.4192991477462488, -0.07263692229910679, -0.18623642703237198, 0.19615022636958407, -0.009239885731608615, -0.22204624927526148, 0.011206612032880117, 0.17345895648929752, 0.06541651105172597, -0.24811286667177268, 0.09885666172569701, -0.0001432710990041226, 0.24006203729092973, 0.05491180744584281, -0.015334386216554695, 0.21360326458507026, 0.2834198797239108, -0.03180617151932942, 0.1783116587546763, -0.07467323549192499, -0.02228640091211141, -0.22940486881605074, -0.20504773520971523, -0.14643193650067793, -0.039054053536666605, -0.04623835014026226, -0.18149514118343726, 0.39109591399697036, 0.22215681305579393, 0.09004786258211007, 0.03701084409316012, 0.3387519007229859, 0.004632851889205945, 0.11752638993952591, 0.07723243434930237, 0.11501959692435088, -0.0027539389300252405, 0.21546375660880193, -0.1336728008831054, 0.07673526356030289, 0.04301232031991219] |
1,802.02871 | Online Learning: A Comprehensive Survey | Online learning represents an important family of machine learning
algorithms, in which a learner attempts to resolve an online prediction (or any
type of decision-making) task by learning a model/hypothesis from a sequence of
data instances one at a time. The goal of online learning is to ensure that the
online learner would make a sequence of accurate predictions (or correct
decisions) given the knowledge of correct answers to previous prediction or
learning tasks and possibly additional information. This is in contrast to many
traditional batch learning or offline machine learning algorithms that are
often designed to train a model in batch from a given collection of training
data instances. This survey aims to provide a comprehensive survey of the
online machine learning literatures through a systematic review of basic ideas
and key principles and a proper categorization of different algorithms and
techniques. Generally speaking, according to the learning type and the forms of
feedback information, the existing online learning works can be classified into
three major categories: (i) supervised online learning where full feedback
information is always available, (ii) online learning with limited feedback,
and (iii) unsupervised online learning where there is no feedback available.
Due to space limitation, the survey will be mainly focused on the first
category, but also briefly cover some basics of the other two categories.
Finally, we also discuss some open issues and attempt to shed light on
potential future research directions in this field.
| cs.LG | online learning represents an important family of machine learning algorithms in which a learner attempts to resolve an online prediction or any type of decisionmaking task by learning a modelhypothesis from a sequence of data instances one at a time the goal of online learning is to ensure that the online learner would make a sequence of accurate predictions or correct decisions given the knowledge of correct answers to previous prediction or learning tasks and possibly additional information this is in contrast to many traditional batch learning or offline machine learning algorithms that are often designed to train a model in batch from a given collection of training data instances this survey aims to provide a comprehensive survey of the online machine learning literatures through a systematic review of basic ideas and key principles and a proper categorization of different algorithms and techniques generally speaking according to the learning type and the forms of feedback information the existing online learning works can be classified into three major categories i supervised online learning where full feedback information is always available ii online learning with limited feedback and iii unsupervised online learning where there is no feedback available due to space limitation the survey will be mainly focused on the first category but also briefly cover some basics of the other two categories finally we also discuss some open issues and attempt to shed light on potential future research directions in this field | [['online', 'learning', 'represents', 'an', 'important', 'family', 'of', 'machine', 'learning', 'algorithms', 'in', 'which', 'a', 'learner', 'attempts', 'to', 'resolve', 'an', 'online', 'prediction', 'or', 'any', 'type', 'of', 'decisionmaking', 'task', 'by', 'learning', 'a', 'modelhypothesis', 'from', 'a', 'sequence', 'of', 'data', 'instances', 'one', 'at', 'a', 'time', 'the', 'goal', 'of', 'online', 'learning', 'is', 'to', 'ensure', 'that', 'the', 'online', 'learner', 'would', 'make', 'a', 'sequence', 'of', 'accurate', 'predictions', 'or', 'correct', 'decisions', 'given', 'the', 'knowledge', 'of', 'correct', 'answers', 'to', 'previous', 'prediction', 'or', 'learning', 'tasks', 'and', 'possibly', 'additional', 'information', 'this', 'is', 'in', 'contrast', 'to', 'many', 'traditional', 'batch', 'learning', 'or', 'offline', 'machine', 'learning', 'algorithms', 'that', 'are', 'often', 'designed', 'to', 'train', 'a', 'model', 'in', 'batch', 'from', 'a', 'given', 'collection', 'of', 'training', 'data', 'instances', 'this', 'survey', 'aims', 'to', 'provide', 'a', 'comprehensive', 'survey', 'of', 'the', 'online', 'machine', 'learning', 'literatures', 'through', 'a', 'systematic', 'review', 'of', 'basic', 'ideas', 'and', 'key', 'principles', 'and', 'a', 'proper', 'categorization', 'of', 'different', 'algorithms', 'and', 'techniques', 'generally', 'speaking', 'according', 'to', 'the', 'learning', 'type', 'and', 'the', 'forms', 'of', 'feedback', 'information', 'the', 'existing', 'online', 'learning', 'works', 'can', 'be', 'classified', 'into', 'three', 'major', 'categories', 'i', 'supervised', 'online', 'learning', 'where', 'full', 'feedback', 'information', 'is', 'always', 'available', 'ii', 'online', 'learning', 'with', 'limited', 'feedback', 'and', 'iii', 'unsupervised', 'online', 'learning', 'where', 'there', 'is', 'no', 'feedback', 'available', 'due', 'to', 'space', 'limitation', 'the', 'survey', 'will', 'be', 'mainly', 'focused', 'on', 'the', 'first', 'category', 'but', 'also', 'briefly', 'cover', 'some', 'basics', 'of', 'the', 'other', 'two', 'categories', 'finally', 'we', 'also', 'discuss', 'some', 'open', 'issues', 'and', 'attempt', 'to', 'shed', 'light', 'on', 'potential', 'future', 'research', 'directions', 'in', 'this', 'field']] | [-0.024383156507974492, 0.026874779964297584, -0.08214730103112136, 0.08326276611236001, -0.19539317305510243, -0.20538887194124983, 0.06983641250505267, 0.4382017926002542, -0.2971217756470044, -0.3229378887432783, 0.13436067537598623, -0.26605690211678545, -0.14375718175433577, 0.18995791600997716, -0.1551611944072647, 0.04277296640308729, 0.11965676542022266, 0.09825980261969865, -0.042274901480413976, -0.32642129116187185, 0.34932321853217824, 0.04704918342661889, 0.30184951247647407, 0.007869139777418847, 0.10033075669489336, -0.006872142656357027, -0.1037765146077921, 0.0034854282708389897, -0.10534062929188319, 0.18121287767159325, 0.3918204974848777, 0.2523554436552028, 0.41214883515737405, -0.38643599704373627, -0.17785131024429573, 0.12017141988811393, 0.15463849071869237, 0.13953471588890048, -0.07206318927395235, -0.2977356384779947, 0.04055537387393997, -0.14243485743548565, 0.0013097935006953776, -0.0929405063817588, -0.021130246942144975, 0.0009070961206513554, -0.2815385129263935, -0.04595814061103738, 0.09402865860356542, 0.0735204762526943, -0.06045845575038887, -0.11000859735552998, 0.09112887584875959, 0.16886373803815027, 0.062472143047004165, 0.07037125769663059, 0.14085616707743612, -0.19295518281190502, -0.18661100401174432, 0.3694963254779092, -0.010689773172149824, -0.1418006175411089, 0.1943554896104615, -0.005987450210765625, -0.1929963712730872, 0.10691391662451982, 0.254952264190797, 0.0899965885328129, -0.19040656235689918, 0.01790732362739315, -0.023351862559017413, 0.17535400946556667, -0.009847708591648067, -0.015754636010872975, 0.16852722825836583, 0.22692488427467955, 0.03204130205170562, 0.087775224075934, -0.043000991134128225, -0.07911902792596569, -0.2541358260437846, -0.10501720379537195, -0.15620206653838978, 0.02552464075027577, -0.07122659415526869, -0.14243626939908913, 0.3599460564146284, 0.19195870113326235, 0.1986596037837444, 0.06372623490848733, 0.36455365919973703, -0.003724306577350944, 0.08634528369681599, 0.1325279243811868, 0.19752773933748055, 0.03220670317047431, 0.14617328374958258, -0.14945738411091344, 0.08946861030417494, 0.01684057601572325] |
1,802.02872 | SQL Query Completion for Data Exploration | Within the big data tsunami, relational databases and SQL are still there and
remain mandatory in most of cases for accessing data. On the one hand, SQL is
easy-to-use by non specialists and allows to identify pertinent initial data at
the very beginning of the data exploration process. On the other hand, it is
not always so easy to formulate SQL queries: nowadays, it is more and more
frequent to have several databases available for one application domain, some
of them with hundreds of tables and/or attributes. Identifying the pertinent
conditions to select the desired data, or even identifying relevant attributes
is far from trivial. To make it easier to write SQL queries, we propose the
notion of SQL query completion: given a query, it suggests additional
conditions to be added to its WHERE clause. This completion is semantic, as it
relies on the data from the database, unlike current completion tools that are
mostly syntactic. Since the process can be repeated over and over again --
until the data analyst reaches her data of interest --, SQL query completion
facilitates the exploration of databases. SQL query completion has been
implemented in a SQL editor on top of a database management system. For the
evaluation, two questions need to be studied: first, does the completion speed
up the writing of SQL queries? Second , is the completion easily adopted by
users? A thorough experiment has been conducted on a group of 70 computer
science students divided in two groups (one with the completion and the other
one without) to answer those questions. The results are positive and very
promising.
| cs.DB | within the big data tsunami relational databases and sql are still there and remain mandatory in most of cases for accessing data on the one hand sql is easytouse by non specialists and allows to identify pertinent initial data at the very beginning of the data exploration process on the other hand it is not always so easy to formulate sql queries nowadays it is more and more frequent to have several databases available for one application domain some of them with hundreds of tables andor attributes identifying the pertinent conditions to select the desired data or even identifying relevant attributes is far from trivial to make it easier to write sql queries we propose the notion of sql query completion given a query it suggests additional conditions to be added to its where clause this completion is semantic as it relies on the data from the database unlike current completion tools that are mostly syntactic since the process can be repeated over and over again until the data analyst reaches her data of interest sql query completion facilitates the exploration of databases sql query completion has been implemented in a sql editor on top of a database management system for the evaluation two questions need to be studied first does the completion speed up the writing of sql queries second is the completion easily adopted by users a thorough experiment has been conducted on a group of 70 computer science students divided in two groups one with the completion and the other one without to answer those questions the results are positive and very promising | [['within', 'the', 'big', 'data', 'tsunami', 'relational', 'databases', 'and', 'sql', 'are', 'still', 'there', 'and', 'remain', 'mandatory', 'in', 'most', 'of', 'cases', 'for', 'accessing', 'data', 'on', 'the', 'one', 'hand', 'sql', 'is', 'easytouse', 'by', 'non', 'specialists', 'and', 'allows', 'to', 'identify', 'pertinent', 'initial', 'data', 'at', 'the', 'very', 'beginning', 'of', 'the', 'data', 'exploration', 'process', 'on', 'the', 'other', 'hand', 'it', 'is', 'not', 'always', 'so', 'easy', 'to', 'formulate', 'sql', 'queries', 'nowadays', 'it', 'is', 'more', 'and', 'more', 'frequent', 'to', 'have', 'several', 'databases', 'available', 'for', 'one', 'application', 'domain', 'some', 'of', 'them', 'with', 'hundreds', 'of', 'tables', 'andor', 'attributes', 'identifying', 'the', 'pertinent', 'conditions', 'to', 'select', 'the', 'desired', 'data', 'or', 'even', 'identifying', 'relevant', 'attributes', 'is', 'far', 'from', 'trivial', 'to', 'make', 'it', 'easier', 'to', 'write', 'sql', 'queries', 'we', 'propose', 'the', 'notion', 'of', 'sql', 'query', 'completion', 'given', 'a', 'query', 'it', 'suggests', 'additional', 'conditions', 'to', 'be', 'added', 'to', 'its', 'where', 'clause', 'this', 'completion', 'is', 'semantic', 'as', 'it', 'relies', 'on', 'the', 'data', 'from', 'the', 'database', 'unlike', 'current', 'completion', 'tools', 'that', 'are', 'mostly', 'syntactic', 'since', 'the', 'process', 'can', 'be', 'repeated', 'over', 'and', 'over', 'again', 'until', 'the', 'data', 'analyst', 'reaches', 'her', 'data', 'of', 'interest', 'sql', 'query', 'completion', 'facilitates', 'the', 'exploration', 'of', 'databases', 'sql', 'query', 'completion', 'has', 'been', 'implemented', 'in', 'a', 'sql', 'editor', 'on', 'top', 'of', 'a', 'database', 'management', 'system', 'for', 'the', 'evaluation', 'two', 'questions', 'need', 'to', 'be', 'studied', 'first', 'does', 'the', 'completion', 'speed', 'up', 'the', 'writing', 'of', 'sql', 'queries', 'second', 'is', 'the', 'completion', 'easily', 'adopted', 'by', 'users', 'a', 'thorough', 'experiment', 'has', 'been', 'conducted', 'on', 'a', 'group', 'of', '70', 'computer', 'science', 'students', 'divided', 'in', 'two', 'groups', 'one', 'with', 'the', 'completion', 'and', 'the', 'other', 'one', 'without', 'to', 'answer', 'those', 'questions', 'the', 'results', 'are', 'positive', 'and', 'very', 'promising']] | [-0.081857121076883, 0.026722692561517925, -0.07410949956506659, 0.08963284074642909, -0.15169221565435478, -0.17965751320221707, 0.11526015470910789, 0.3909236297157551, -0.29839805768027244, -0.36641002392144245, 0.17334095901797378, -0.3184471979650955, -0.036898056474948454, 0.2420960216690205, -0.08542615388383515, 0.06662161356119152, 0.09657154723483705, 0.10911773929908115, -0.025431306594724527, -0.3052413490245511, 0.2973088721221285, 0.051780759170695204, 0.2645769086657652, 0.03425208490720033, 0.026224059062831356, 0.011438512472386378, -0.07670941226415448, -0.014701702982521036, -0.053688732287598136, 0.12015444060364787, 0.35154049684594674, 0.26054690736569147, 0.29917965518814843, -0.43035406598303105, -0.1440904066159173, 0.06812924790875356, 0.09677339263939382, 0.11218041531160418, -0.0248226004511974, -0.3087244377177405, 0.10108243393505174, -0.1629123343960067, -0.005082980775155295, -0.10969069937622189, 0.049441483731318576, -0.05495105058837094, -0.2419272740301501, -0.04004679260166236, 0.05592535002878342, 0.06324181684530936, -0.012278503741626102, -0.07436848225418209, 0.012949559750924712, 0.17138652132099313, 0.050762417462666964, 0.041775019796078505, 0.14609052160320649, -0.1437071839870913, -0.11500645922085523, 0.43681525083388295, -0.019827061792296406, -0.16030046540221438, 0.2063264392716355, -0.10109929559022342, -0.15622894580763086, 0.11341163119007099, 0.1337135907685335, 0.10931983987338617, -0.18384865335279837, 0.09656173443702694, -0.0345899163919529, 0.19947913488289132, 0.06978405750473905, 0.004779630947658526, 0.2001534425872343, 0.19656280708180643, 0.051034234492615904, 0.11983904942232919, -0.02595391830867524, -0.06532652613608853, -0.2430293220252891, -0.14150348212745012, -0.17581535405059226, -0.004772301301956649, -0.06933899758401356, -0.1755459129616016, 0.36469595348094835, 0.24166241979236974, 0.18250151042812468, 0.03035132556845595, 0.33131603658185305, 0.04782757994684275, 0.1447828198166886, 0.10119370978870044, 0.1413951529198916, 0.015788096624699637, 0.15246772058080546, -0.09915059789259396, 0.1258438020353, -0.006122600838640018] |
1,802.02873 | Quadrupole and octupole collectivity and cluster structures in neon
isotopes | The lowest positive- and negative-parity bands of $^{20}$Ne and neutron-rich
even-even Ne isotopes are investigated using a theoretical framework based on
energy density functionals. Starting from a self-consistent relativistic
Hartree-Bogoliubov calculation of axially-symmetric and reflection-asymmetric
deformation energy surfaces, the collective symmetry-conserving states are
built using projection techniques and the generator coordinate method. Overall
a good agreement with the experimental excitation energies and transition rates
is obtained. In particular, the model provides an accurate description of the
excitation spectra and transition probabilities in $^{20}$Ne. The contribution
of cluster configurations to the low-energy states is discussed, as well as the
transitional character of the ground state. The analysis is extended to
$^{22}$Ne and the shape-coexisting isotope $^{24}$Ne, and to the drip-line
nuclei $^{32}$Ne and $^{34}$Ne. The role of valence neutrons in the formation
of molecular-type bonds between clusters is discussed.
| nucl-th | the lowest positive and negativeparity bands of 20ne and neutronrich eveneven ne isotopes are investigated using a theoretical framework based on energy density functionals starting from a selfconsistent relativistic hartreebogoliubov calculation of axiallysymmetric and reflectionasymmetric deformation energy surfaces the collective symmetryconserving states are built using projection techniques and the generator coordinate method overall a good agreement with the experimental excitation energies and transition rates is obtained in particular the model provides an accurate description of the excitation spectra and transition probabilities in 20ne the contribution of cluster configurations to the lowenergy states is discussed as well as the transitional character of the ground state the analysis is extended to 22ne and the shapecoexisting isotope 24ne and to the dripline nuclei 32ne and 34ne the role of valence neutrons in the formation of moleculartype bonds between clusters is discussed | [['the', 'lowest', 'positive', 'and', 'negativeparity', 'bands', 'of', '20ne', 'and', 'neutronrich', 'eveneven', 'ne', 'isotopes', 'are', 'investigated', 'using', 'a', 'theoretical', 'framework', 'based', 'on', 'energy', 'density', 'functionals', 'starting', 'from', 'a', 'selfconsistent', 'relativistic', 'hartreebogoliubov', 'calculation', 'of', 'axiallysymmetric', 'and', 'reflectionasymmetric', 'deformation', 'energy', 'surfaces', 'the', 'collective', 'symmetryconserving', 'states', 'are', 'built', 'using', 'projection', 'techniques', 'and', 'the', 'generator', 'coordinate', 'method', 'overall', 'a', 'good', 'agreement', 'with', 'the', 'experimental', 'excitation', 'energies', 'and', 'transition', 'rates', 'is', 'obtained', 'in', 'particular', 'the', 'model', 'provides', 'an', 'accurate', 'description', 'of', 'the', 'excitation', 'spectra', 'and', 'transition', 'probabilities', 'in', '20ne', 'the', 'contribution', 'of', 'cluster', 'configurations', 'to', 'the', 'lowenergy', 'states', 'is', 'discussed', 'as', 'well', 'as', 'the', 'transitional', 'character', 'of', 'the', 'ground', 'state', 'the', 'analysis', 'is', 'extended', 'to', '22ne', 'and', 'the', 'shapecoexisting', 'isotope', '24ne', 'and', 'to', 'the', 'dripline', 'nuclei', '32ne', 'and', '34ne', 'the', 'role', 'of', 'valence', 'neutrons', 'in', 'the', 'formation', 'of', 'moleculartype', 'bonds', 'between', 'clusters', 'is', 'discussed']] | [-0.04173448982301855, 0.1655253223977332, -0.08057719253914526, 0.12885844334620086, 0.06274083449274138, -0.08789765419791976, 0.0683025926942971, 0.3774025886163224, -0.16929538305984795, -0.2681198701802913, -0.04385738311943863, -0.3283215964282693, -0.03607946691565542, 0.11896204594760644, 0.08220766405880886, 0.03138613008832845, 0.06854062805795212, 0.0312445777549959, -0.09996958089949705, -0.11472614107051878, 0.30800447540942333, 0.14124498784161396, 0.2951102859177457, 0.08208878735338684, 0.030776270852172678, -0.002770630748140333, 0.06800897349433525, -0.05111413856417648, -0.14109226477325615, 0.11774063672331658, 0.27129421188380487, 0.028298800481469745, 0.1566107858662378, -0.41682907642565503, -0.173479556908192, 0.03613726169985794, 0.13867057351069184, 0.17154684000696144, -0.0729342525813008, -0.3200757337519967, 0.014476942663237343, -0.22579403282788985, -0.17129728340808928, -0.11321739096578591, 0.029730300711345498, 0.0859428308360333, -0.2575804428605322, 0.10340795848674963, -0.008916971599173318, 0.05655655354587701, -0.18363259253466, -0.23061008598437926, -0.09117025767969661, 0.08003740890264294, 0.06459245805196927, 0.020267591545745783, 0.15868466792043542, -0.08021721565742454, -0.07568448529422392, 0.41796592955416356, -0.013737011061858958, -0.10332382131830184, 0.14315746994655118, -0.1213876081938196, -0.13036823396938071, 0.18218103565112517, 0.10593649898791672, 0.14580850863326206, -0.10950417946650218, 0.07554556619686952, 0.011565572278825634, 0.15467438939618913, 0.030026998111500617, 0.052857379931614504, 0.16667563429299442, 0.18013132849443078, -0.03721528201887425, 0.08189532108074665, -0.16712065587112557, -0.14968015487394193, -0.28778369919852403, -0.10465193388932198, -0.16435921116711666, 0.004383077619794457, -0.0022146102765627737, -0.13653183525558188, 0.39276794297280754, -0.002956448503545601, 0.1739959964464099, -0.0328765220151548, 0.23859117546859776, 0.1111848887050164, 0.005027698317455998, 0.04913613510430267, 0.29213629032563365, 0.2257698288945359, 0.025060243727843257, -0.28861541183152145, 0.04149927066666258, 0.07059403300543662] |
1,802.02874 | Full PIC simulation of a first ACHIP experiment @ SINBAD | In laser illuminated dielectric accelerators (DLA) high acceleration
gradients can be achieved due to high damage thresholds of the materials at
optical frequencies. This is a necessity for developing more compact particle
accelerator technologies. The Accelerator on a CHip International Program
(ACHIP) funded by the Gordon and Betty Moore Foundation is researching such
devices. DESY Hamburg is part of the collaboration. The dedicated accelerator
research facility SINBAD is particularly well suited for DLA experiments at
relativistic electron energies. High quality beams and short bunch lengths are
anticipated from the ARES linac which is currently under construction at
SINBAD. The aim of the experiment is the injection of a short electron bunch
from the ARES linac into a DLA. In this study the results of one of the first
possible experiments at the facility are estimated via a combination of
particle-in-cell (PIC) and tracking simulations. ASTRA is used to simulate an
electron bunch from the ARES linac at a suitable working point. The dielectric
part of the setup will be simulated using the PIC code from CST Particle Studio
incorporating the retrieved bunch from the ASTRA simulation. The energy spectra
of the electron bunches are calculated as would be measured from a spectrometer
dipole with and without the laser fields.
| physics.acc-ph | in laser illuminated dielectric accelerators dla high acceleration gradients can be achieved due to high damage thresholds of the materials at optical frequencies this is a necessity for developing more compact particle accelerator technologies the accelerator on a chip international program achip funded by the gordon and betty moore foundation is researching such devices desy hamburg is part of the collaboration the dedicated accelerator research facility sinbad is particularly well suited for dla experiments at relativistic electron energies high quality beams and short bunch lengths are anticipated from the ares linac which is currently under construction at sinbad the aim of the experiment is the injection of a short electron bunch from the ares linac into a dla in this study the results of one of the first possible experiments at the facility are estimated via a combination of particleincell pic and tracking simulations astra is used to simulate an electron bunch from the ares linac at a suitable working point the dielectric part of the setup will be simulated using the pic code from cst particle studio incorporating the retrieved bunch from the astra simulation the energy spectra of the electron bunches are calculated as would be measured from a spectrometer dipole with and without the laser fields | [['in', 'laser', 'illuminated', 'dielectric', 'accelerators', 'dla', 'high', 'acceleration', 'gradients', 'can', 'be', 'achieved', 'due', 'to', 'high', 'damage', 'thresholds', 'of', 'the', 'materials', 'at', 'optical', 'frequencies', 'this', 'is', 'a', 'necessity', 'for', 'developing', 'more', 'compact', 'particle', 'accelerator', 'technologies', 'the', 'accelerator', 'on', 'a', 'chip', 'international', 'program', 'achip', 'funded', 'by', 'the', 'gordon', 'and', 'betty', 'moore', 'foundation', 'is', 'researching', 'such', 'devices', 'desy', 'hamburg', 'is', 'part', 'of', 'the', 'collaboration', 'the', 'dedicated', 'accelerator', 'research', 'facility', 'sinbad', 'is', 'particularly', 'well', 'suited', 'for', 'dla', 'experiments', 'at', 'relativistic', 'electron', 'energies', 'high', 'quality', 'beams', 'and', 'short', 'bunch', 'lengths', 'are', 'anticipated', 'from', 'the', 'ares', 'linac', 'which', 'is', 'currently', 'under', 'construction', 'at', 'sinbad', 'the', 'aim', 'of', 'the', 'experiment', 'is', 'the', 'injection', 'of', 'a', 'short', 'electron', 'bunch', 'from', 'the', 'ares', 'linac', 'into', 'a', 'dla', 'in', 'this', 'study', 'the', 'results', 'of', 'one', 'of', 'the', 'first', 'possible', 'experiments', 'at', 'the', 'facility', 'are', 'estimated', 'via', 'a', 'combination', 'of', 'particleincell', 'pic', 'and', 'tracking', 'simulations', 'astra', 'is', 'used', 'to', 'simulate', 'an', 'electron', 'bunch', 'from', 'the', 'ares', 'linac', 'at', 'a', 'suitable', 'working', 'point', 'the', 'dielectric', 'part', 'of', 'the', 'setup', 'will', 'be', 'simulated', 'using', 'the', 'pic', 'code', 'from', 'cst', 'particle', 'studio', 'incorporating', 'the', 'retrieved', 'bunch', 'from', 'the', 'astra', 'simulation', 'the', 'energy', 'spectra', 'of', 'the', 'electron', 'bunches', 'are', 'calculated', 'as', 'would', 'be', 'measured', 'from', 'a', 'spectrometer', 'dipole', 'with', 'and', 'without', 'the', 'laser', 'fields']] | [-0.06598064134484513, 0.17989353542880357, -0.08774747376878296, 0.05884116250324246, -0.013187436427047663, -0.15693192699318084, -0.03041288292962327, 0.40409090512534646, -0.20181379833093813, -0.33042568350700957, 0.06598939382890016, -0.297490131414638, 0.025422702820829014, 0.3081255972387634, 0.024162207130770507, 0.10002881884641732, 0.09297282589626227, -0.042282502247136464, -0.008952170601794185, -0.17790284603009776, 0.24627590974632418, 0.2497772320895567, 0.302694386815982, 0.05745693069462705, 0.13810267357565642, -0.0058927100143979115, -0.023969499592593556, -0.03980751659801346, -0.069494742091353, 0.08724242470641598, 0.2751453765055263, 0.10378024956371867, 0.2605047108445085, -0.4560220863527516, -0.17995695814222396, -0.015359762305188835, 0.08822356004704628, 0.10139676071335807, -0.11215860067631962, -0.26915542258653774, 0.044278762450343685, -0.1830020719697993, -0.16258621543892893, 0.034118263471109064, -0.0516839599889663, 0.09731846357891827, -0.26272079758969935, -0.049726956531753026, -0.024277333244083963, 0.08678881492483559, -0.044306494134968996, -0.10391060401502836, 0.04535736133451418, 0.06139256868290862, -0.011407863041809336, 0.0959879052624748, 0.1801334494595643, -0.10792723588108499, -0.11418213101513862, 0.41041574237476053, -0.028364220238624935, -0.10071371277152565, 0.17647549616168454, -0.21174004599763946, -0.04399806696422505, 0.16688674871930095, 0.1990533245985873, 0.07624093437083868, -0.163714525113261, 0.07085118484104043, 0.015230548198214558, 0.1694311108079496, 0.12361261476294703, -0.019008281259712847, 0.23773071602093832, 0.2296382108982875, 0.012917575692094008, 0.1136830910788537, -0.15209466571647798, 0.023471457290777303, -0.3229401304105823, -0.12325047793852179, -0.17926720898313242, 0.014662800298851378, 0.029956894746533725, -0.079029340562121, 0.4137768657325486, 0.12176345675542023, 0.07901266861805006, -0.028584583129808442, 0.3478309759195074, 0.08147525684696368, 0.10248157271277605, 0.05274335817661154, 0.2329330818051401, 0.09337904411501058, 0.15247762084684588, -0.22452150550158473, 0.0020628445770627148, 0.03707252246657449] |
1,802.02875 | Vanishing ideals of binary Hamming spheres | We consider the simplified Algebraic Normal Form (sANF) of Boolean functions
vanishing on Hamming spheres centred at zero and the associated sANF vector. We
show that this vector is periodic, leading to an efficient computation of the
sANF and to specific formulas for particular cases. Moreover, we explicitly
provide a connection to the binary M{\"o}bius transform of the elementary
symmetric functions. We conclude by presenting a method based on polynomial
evaluation to bound the minimum distance of binary nonlinear codes. The same
method can be used to compute the minimum distance and the weight distribution
of binary linear codes.
| math.AC math.CO | we consider the simplified algebraic normal form sanf of boolean functions vanishing on hamming spheres centred at zero and the associated sanf vector we show that this vector is periodic leading to an efficient computation of the sanf and to specific formulas for particular cases moreover we explicitly provide a connection to the binary mobius transform of the elementary symmetric functions we conclude by presenting a method based on polynomial evaluation to bound the minimum distance of binary nonlinear codes the same method can be used to compute the minimum distance and the weight distribution of binary linear codes | [['we', 'consider', 'the', 'simplified', 'algebraic', 'normal', 'form', 'sanf', 'of', 'boolean', 'functions', 'vanishing', 'on', 'hamming', 'spheres', 'centred', 'at', 'zero', 'and', 'the', 'associated', 'sanf', 'vector', 'we', 'show', 'that', 'this', 'vector', 'is', 'periodic', 'leading', 'to', 'an', 'efficient', 'computation', 'of', 'the', 'sanf', 'and', 'to', 'specific', 'formulas', 'for', 'particular', 'cases', 'moreover', 'we', 'explicitly', 'provide', 'a', 'connection', 'to', 'the', 'binary', 'mobius', 'transform', 'of', 'the', 'elementary', 'symmetric', 'functions', 'we', 'conclude', 'by', 'presenting', 'a', 'method', 'based', 'on', 'polynomial', 'evaluation', 'to', 'bound', 'the', 'minimum', 'distance', 'of', 'binary', 'nonlinear', 'codes', 'the', 'same', 'method', 'can', 'be', 'used', 'to', 'compute', 'the', 'minimum', 'distance', 'and', 'the', 'weight', 'distribution', 'of', 'binary', 'linear', 'codes']] | [-0.14833743264898658, 0.07324765019034708, -0.08039833836238643, 0.10313732586471797, -0.09974388067017902, -0.1403160396718768, 0.06286071456564271, 0.36723310652311253, -0.30907701736203197, -0.2142589575930903, 0.09866429988125508, -0.2409732626243071, -0.18164225543597526, 0.18941584718648832, -0.031254898210090226, 0.08749862897651967, 0.04446467845418462, 0.08360266712561222, -0.17308498998737018, -0.2895903371561394, 0.34876063229948884, 0.055014443724895966, 0.2275412982009878, 0.04317046634175561, 0.11266664170067418, 0.05395043308898392, -0.02711997571344854, -0.015718911864873137, -0.16101664001149457, 0.15465339506397757, 0.20933381831179362, 0.1474401515137141, 0.20557306908691922, -0.3835079383970511, -0.1424163637889756, 0.1362761422813014, 0.10920189365725776, 0.09246071296358349, -0.015416719388649469, -0.1941832248862325, 0.14540351688217448, -0.17095987470538326, -0.13057206363671206, -0.06086361238902265, 0.03479714778186095, 0.05947862388660209, -0.28009183947561367, 0.04466247751443374, 0.07675872944445923, 0.038001165388979845, -0.0752625924892573, -0.14026161912014953, 0.024287542173018057, 0.08782248931814625, -0.025487424315404936, 0.04932997879487547, 0.05419363365643846, -0.08120737003040208, -0.11231443025183516, 0.33877740900098074, -0.07679428446642829, -0.25373307948536944, 0.146683657610074, -0.09805501886935096, -0.10132244500952463, 0.09471381664266716, 0.2290774389038408, 0.1451752383180781, -0.10378414799807349, 0.08409232640406117, -0.07019627247137403, 0.13877481948984127, 0.09303411201696203, 0.0229675032132578, 0.17296321718774813, 0.05068674797163994, 0.07162044298331809, 0.22936610510511643, -0.07093360506508481, -0.1057634088916309, -0.3082382614639672, -0.15245182419282788, -0.2029439342970198, 0.045292848144949535, -0.13109972380584392, -0.2221180513557611, 0.3881494510951781, 0.0778685725892887, 0.20366546809949648, 0.12427911351933474, 0.246709418073861, 0.15612699593277118, 0.07948969360064677, 0.09398382496220445, 0.1754498409102624, 0.16344864638240048, -0.019551895869274933, -0.20774834044748033, 0.0323993784197338, 0.13762476136249424] |
1,802.02876 | Multivariate subordination of stable processes | This article is devoted to some time-changed stochastic models based on
multivariate stable processes. The considered models have several advantages in
comparison with classical time-changed Brownian motions - for instance, it
turns out that they are more appropriate for describing stock prices if the
amount of transactions is used for a stochastic time change. In this paper, we
provide a detailed discussion of the model, which is based on two popular
concepts - multivariate subordination and L{\'e}vy copulas.
| math.PR | this article is devoted to some timechanged stochastic models based on multivariate stable processes the considered models have several advantages in comparison with classical timechanged brownian motions for instance it turns out that they are more appropriate for describing stock prices if the amount of transactions is used for a stochastic time change in this paper we provide a detailed discussion of the model which is based on two popular concepts multivariate subordination and levy copulas | [['this', 'article', 'is', 'devoted', 'to', 'some', 'timechanged', 'stochastic', 'models', 'based', 'on', 'multivariate', 'stable', 'processes', 'the', 'considered', 'models', 'have', 'several', 'advantages', 'in', 'comparison', 'with', 'classical', 'timechanged', 'brownian', 'motions', 'for', 'instance', 'it', 'turns', 'out', 'that', 'they', 'are', 'more', 'appropriate', 'for', 'describing', 'stock', 'prices', 'if', 'the', 'amount', 'of', 'transactions', 'is', 'used', 'for', 'a', 'stochastic', 'time', 'change', 'in', 'this', 'paper', 'we', 'provide', 'a', 'detailed', 'discussion', 'of', 'the', 'model', 'which', 'is', 'based', 'on', 'two', 'popular', 'concepts', 'multivariate', 'subordination', 'and', 'levy', 'copulas']] | [-0.03990311994934209, 0.06486096962257043, -0.13881708166598783, 0.14431314924762487, -0.10922688601146403, -0.14435531214908942, 0.03779454471230948, 0.42181326407252956, -0.2772719215503649, -0.19819556046767453, 0.1471476792587629, -0.2675404011235131, -0.1601771369919573, 0.23473514765684836, -0.11120658827406403, 0.07800348924080792, 0.05313486888342978, -0.007478291520735519, 0.025686308197787423, -0.277142938054902, 0.2975074577414872, 0.06300305616796802, 0.2388517839319416, -0.0475682021596616, 0.14697621809318662, -0.019987912477135023, -0.12649864455881088, -0.005706108653133637, -0.15598312012078072, 0.13554287325639866, 0.2540366185970159, 0.0720476824422612, 0.35869231195140044, -0.44575804601864594, -0.20007301838823446, 0.16412728802472548, 0.08666848742301993, 0.03954251334653236, -0.027610680009705613, -0.2784971833645709, 0.01830327104146004, -0.18178924350803227, -0.083669726908403, -0.1242225325764402, 0.07456497874993243, 0.07299829036377273, -0.28903897143410223, 0.07832356229099739, 0.1131419233095489, 0.05518895603132765, -0.00030608158436064655, -0.13021802437785818, 0.022528402446033925, 0.05553599320180518, 0.10394394775932214, -0.06248054792798173, 0.12807105128702365, -0.054255425550141616, -0.1631761118830917, 0.3774148866681284, -0.06575058109592646, -0.2903533145589264, 0.1850819984530589, -0.11790839793454659, -0.20950592695857936, 0.08561098253305413, 0.18070453703158387, 0.11823948899185971, -0.2634366711258496, 0.06682556894482236, -0.05167395865397626, 0.11043219412922074, 0.049369257035371115, -0.022043421944162173, 0.1816897792067673, 0.22503878025485105, 0.09507095407829375, 0.13598749668974625, -0.04873159100718208, -0.22919147296833167, -0.31089228048528494, -0.16310707219159476, -0.14109538703862773, 0.051280390857228714, -0.11648477833870474, -0.18600410813661783, 0.3837118862552176, 0.19908450580872963, 0.14885544763436834, 0.08736651166691445, 0.2393105987851557, 0.16372576882866652, -0.04675687913550064, 0.062416191771932826, 0.12796660817395222, 0.12377012763662558, 0.1413366672411365, -0.09385042304577502, 0.1449157307659717, 0.06597550464548955] |
1,802.02877 | Existence and uniqueness of solutions to singular Cahn-Hilliard
equations with nonlinear viscosity terms and dynamic boundary conditions | We prove global existence and uniqueness of solutions to a Cahn-Hilliard
system with nonlinear viscosity terms and nonlinear dynamic boundary
conditions. The problem is highly nonlinear, characterized by four
nonlinearities and two separate diffusive terms, all acting in the interior of
the domain or on its boundary. Through a suitable approximation of the problem
based on abstract theory of doubly nonlinear evolution equations, existence and
uniqueness of solutions are proved using compactness and monotonicity
arguments. The asymptotic behaviour of the solutions as the the diffusion
operator on the boundary vanishes is also shown.
| math.AP | we prove global existence and uniqueness of solutions to a cahnhilliard system with nonlinear viscosity terms and nonlinear dynamic boundary conditions the problem is highly nonlinear characterized by four nonlinearities and two separate diffusive terms all acting in the interior of the domain or on its boundary through a suitable approximation of the problem based on abstract theory of doubly nonlinear evolution equations existence and uniqueness of solutions are proved using compactness and monotonicity arguments the asymptotic behaviour of the solutions as the the diffusion operator on the boundary vanishes is also shown | [['we', 'prove', 'global', 'existence', 'and', 'uniqueness', 'of', 'solutions', 'to', 'a', 'cahnhilliard', 'system', 'with', 'nonlinear', 'viscosity', 'terms', 'and', 'nonlinear', 'dynamic', 'boundary', 'conditions', 'the', 'problem', 'is', 'highly', 'nonlinear', 'characterized', 'by', 'four', 'nonlinearities', 'and', 'two', 'separate', 'diffusive', 'terms', 'all', 'acting', 'in', 'the', 'interior', 'of', 'the', 'domain', 'or', 'on', 'its', 'boundary', 'through', 'a', 'suitable', 'approximation', 'of', 'the', 'problem', 'based', 'on', 'abstract', 'theory', 'of', 'doubly', 'nonlinear', 'evolution', 'equations', 'existence', 'and', 'uniqueness', 'of', 'solutions', 'are', 'proved', 'using', 'compactness', 'and', 'monotonicity', 'arguments', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'solutions', 'as', 'the', 'the', 'diffusion', 'operator', 'on', 'the', 'boundary', 'vanishes', 'is', 'also', 'shown']] | [-0.16423492592143557, 0.05172513539512311, -0.08918909222308186, 0.04441849568418117, -0.09991917017376631, -0.1071458453442701, -0.024621530249464497, 0.26527472519345824, -0.30525802872994895, -0.21351578529243187, 0.22416795913745918, -0.27862163895480735, -0.166119125073335, 0.16245645741050843, -0.02213208347193456, 0.11930491126290152, 0.049109364614411385, 0.017541356151923537, -0.0726608941932359, -0.19274707268723237, 0.4097030418824845, -0.07493776060961267, 0.2512167045591219, 0.0859534361710151, 0.14784657283215433, -0.025045475123890784, 0.005227101506084525, 0.058627977106039245, -0.14834297099901783, 0.09125980991439553, 0.18607250932273606, 0.05512402091746128, 0.3073413722136969, -0.4541847701434807, -0.22717914475949222, 0.0709420889816297, 0.12333980324347654, 0.05714922458414109, -0.03003895276486473, -0.2922719305341122, 0.0992054516194208, -0.08080250738809507, -0.19691628267267539, -0.07730872137346856, -0.008050110448972993, 0.08440370869732672, -0.29661755073535184, 0.1262834171300769, 0.09911738440234175, 0.01829525419781285, -0.19509143710088847, -0.04568327991517201, -0.06823203371216853, 0.07394998483309742, 0.0716400307538088, -0.06763197966821251, 0.04321557688476738, -0.1513279982171552, -0.0811754637548039, 0.34461795045463467, -0.09648739998929844, -0.3169255353790778, 0.23548289752184784, -0.11989698902032869, -0.05918781636082517, 0.10382337657539474, 0.14564061500332368, 0.20712261034115667, -0.1729080533328396, 0.14846599740113922, -0.031220214688018846, 0.13041454952420486, 0.10197008828262008, 0.028481414060919516, 0.1008208097329223, 0.17278572013701804, 0.1589449294592424, 0.15244926186528818, 0.004468250964012157, -0.1251381648008421, -0.3525373042430929, -0.11143277162655947, -0.1333059494806734, 0.06877473669667397, -0.1326176272747445, -0.2396522303551851, 0.3783712972804243, 0.08771543473666234, 0.15131593573718302, 0.054829701936493315, 0.22947729987302615, 0.20703632939451685, -0.04547773808821715, 0.08122658708523359, 0.24014975190643342, 0.19072859974888465, 0.13889725547364, -0.28092586683730286, 0.07827139159123744, 0.18908524335992913] |
1,802.02878 | New Physics Phenomena and F-theory GUTs | In this presentation the new physics implications of the $B$-meson decay
anomalies, observed at LHCb, are discussed. In the first part of the talk a
brief overview of the experimental status is presented. In the second part, a
class of semi-local F-theory GUT models with additional neutral gauge bosons
are proposed which are capable of accounting for the anomalous $B$-decay ratios
$R_{K}$ and $R_{K^*}$
| hep-ph hep-ex hep-th | in this presentation the new physics implications of the bmeson decay anomalies observed at lhcb are discussed in the first part of the talk a brief overview of the experimental status is presented in the second part a class of semilocal ftheory gut models with additional neutral gauge bosons are proposed which are capable of accounting for the anomalous bdecay ratios r_k and r_k | [['in', 'this', 'presentation', 'the', 'new', 'physics', 'implications', 'of', 'the', 'bmeson', 'decay', 'anomalies', 'observed', 'at', 'lhcb', 'are', 'discussed', 'in', 'the', 'first', 'part', 'of', 'the', 'talk', 'a', 'brief', 'overview', 'of', 'the', 'experimental', 'status', 'is', 'presented', 'in', 'the', 'second', 'part', 'a', 'class', 'of', 'semilocal', 'ftheory', 'gut', 'models', 'with', 'additional', 'neutral', 'gauge', 'bosons', 'are', 'proposed', 'which', 'are', 'capable', 'of', 'accounting', 'for', 'the', 'anomalous', 'bdecay', 'ratios', 'r_k', 'and', 'r_k']] | [-0.12294948261296668, 0.18759377201786265, -0.01162174191995291, 0.1275262316921726, -0.08530591730959713, -0.13686261991097126, -0.024643033859319985, 0.267826858223998, -0.15526336054608691, -0.28279396711150184, 0.06507883996710007, -0.29630968438868877, -0.10755899710784433, 0.12284044501575409, 0.0006225118995644152, 0.0566834917262895, 0.04196130148193333, 0.007130404468625784, -0.07099042490153806, -0.2682996223556984, 0.2538076292257756, 0.046230010892031714, 0.22554198661237024, 0.13766032800049288, 0.013068312211544253, -0.054351133596355794, -0.11689980627852492, -0.038820370737084886, -0.12912575226073386, 0.14088955798797542, 0.25493305045785064, 0.09767639539677475, 0.11793435027357191, -0.3848511430842336, -0.12174310108821373, 0.12394936698547099, 0.1253729827767529, 0.11504982077713066, -0.11178529348399024, -0.3278388362377882, 0.09415257349610329, -0.1930888441274874, -0.10344983794402651, -0.05345899220992578, 0.007541104419942712, -0.041191353695467114, -0.27505280991317704, 0.08336841627169633, -0.023993007227545604, 0.09477063503254612, -0.02837065712083131, -0.2430558035557624, 0.06266296740068356, 0.03648658414022066, 0.14878107749609626, 0.003944350748497527, 0.1264720625258633, -0.1858889205577725, -0.17977779910143, 0.401473997393623, -0.07892082704347558, -0.12965980984154157, 0.13301820532979036, -0.19204690927290358, -0.24839513349434128, 0.11785465975117404, 0.15268221270525828, 0.04186489300627727, -0.20282020840386394, 0.15282011845465604, -0.04228763370338129, 0.07955763042264152, -0.017243917674932163, 0.10094180563464761, 0.29216363410523627, 0.23279225333681097, -0.038912539297598414, 0.04977454000618309, -0.046435129956080345, -0.07118143732077442, -0.5199031009397004, -0.1363830857007997, -0.0798225896578515, 0.020408716089150403, -0.0006918480137301231, -0.06562893411319237, 0.4465774222626351, 0.13678724148485344, 0.27509997101151384, 0.034940055184051744, 0.27837432746309787, 0.045689099380979314, 0.05412779180915095, 0.005474947414768394, 0.28095835050044116, 0.1370450806862209, 0.16543353949964512, -0.2565236113118772, 0.028925170758157037, 0.11374750941104139] |
1,802.02879 | Designing and experimental verification of a photoacoustic flow sensor
using computational fluid dynamics | A photoacoustic (PA) sensor for fast and real-time gas sensing is
demonstrated. The PA sensor is a standalone system controlled by a
Field-Programmable Gate Array (FPGA). The PA cell has been designed for flow
noise immunity using computational fluid dynamics (CFD) analysis. The aim of
the CFD analysis was to investigate and minimize the influence of the gas
distribution and the flow noise on the PA signal. PA measurements were
conducted at different flow rates by exciting molecular C-H stretch vibrational
bands of hexane (C$_6$H$_{14}$) and decane (C$_{10}$H$_{22}$) molecules in
clean air at 2950 cm$^{-1}$ (3.38 $\mu$m) with a custom made mid-infrared
interband cascade laser (ICL). We observe a (1$\sigma$, standard deviation)
sensitivity of 0.4 $\pm0.1$ ppb (nmol/mol) for hexane in clean air at flow
rates up to 1.7 L/min, corresponding to a normalized noise equivalent
absorption (NNEA) coefficient of 2.5$\times 10^{-9}$ W cm$^{-1}$ Hz$^{-1/2}$,
demonstrating high sensitivity and fast real-time gas analysis. An Allan
deviation analysis for decane shows that the detection limit at optimum
integration time is 0.25 ppbV (nmol/mol).
| physics.ins-det physics.flu-dyn | a photoacoustic pa sensor for fast and realtime gas sensing is demonstrated the pa sensor is a standalone system controlled by a fieldprogrammable gate array fpga the pa cell has been designed for flow noise immunity using computational fluid dynamics cfd analysis the aim of the cfd analysis was to investigate and minimize the influence of the gas distribution and the flow noise on the pa signal pa measurements were conducted at different flow rates by exciting molecular ch stretch vibrational bands of hexane c_6h_14 and decane c_10h_22 molecules in clean air at 2950 cm1 338 mum with a custom made midinfrared interband cascade laser icl we observe a 1sigma standard deviation sensitivity of 04 pm01 ppb nmolmol for hexane in clean air at flow rates up to 17 lmin corresponding to a normalized noise equivalent absorption nnea coefficient of 25times 109 w cm1 hz12 demonstrating high sensitivity and fast realtime gas analysis an allan deviation analysis for decane shows that the detection limit at optimum integration time is 025 ppbv nmolmol | [['a', 'photoacoustic', 'pa', 'sensor', 'for', 'fast', 'and', 'realtime', 'gas', 'sensing', 'is', 'demonstrated', 'the', 'pa', 'sensor', 'is', 'a', 'standalone', 'system', 'controlled', 'by', 'a', 'fieldprogrammable', 'gate', 'array', 'fpga', 'the', 'pa', 'cell', 'has', 'been', 'designed', 'for', 'flow', 'noise', 'immunity', 'using', 'computational', 'fluid', 'dynamics', 'cfd', 'analysis', 'the', 'aim', 'of', 'the', 'cfd', 'analysis', 'was', 'to', 'investigate', 'and', 'minimize', 'the', 'influence', 'of', 'the', 'gas', 'distribution', 'and', 'the', 'flow', 'noise', 'on', 'the', 'pa', 'signal', 'pa', 'measurements', 'were', 'conducted', 'at', 'different', 'flow', 'rates', 'by', 'exciting', 'molecular', 'ch', 'stretch', 'vibrational', 'bands', 'of', 'hexane', 'c_6h_14', 'and', 'decane', 'c_10h_22', 'molecules', 'in', 'clean', 'air', 'at', '2950', 'cm1', '338', 'mum', 'with', 'a', 'custom', 'made', 'midinfrared', 'interband', 'cascade', 'laser', 'icl', 'we', 'observe', 'a', '1sigma', 'standard', 'deviation', 'sensitivity', 'of', '04', 'pm01', 'ppb', 'nmolmol', 'for', 'hexane', 'in', 'clean', 'air', 'at', 'flow', 'rates', 'up', 'to', '17', 'lmin', 'corresponding', 'to', 'a', 'normalized', 'noise', 'equivalent', 'absorption', 'nnea', 'coefficient', 'of', '25times', '109', 'w', 'cm1', 'hz12', 'demonstrating', 'high', 'sensitivity', 'and', 'fast', 'realtime', 'gas', 'analysis', 'an', 'allan', 'deviation', 'analysis', 'for', 'decane', 'shows', 'that', 'the', 'detection', 'limit', 'at', 'optimum', 'integration', 'time', 'is', '025', 'ppbv', 'nmolmol']] | [-0.09256996660294724, 0.10625378947562936, -0.038440956673858794, -0.015236177624833277, 0.0536212770624415, -0.15736638626412433, 0.04427360146552982, 0.4245705801555339, -0.2334738624843714, -0.3108173472176799, 0.076200097893803, -0.31339798896189996, -0.015228849852128941, 0.20220102236113127, -0.035428801513112645, 0.09475403310292783, 0.06510894528918845, -0.07297037515981013, -0.005164062211235218, -0.14904717263245187, 0.09789836179903325, 0.14190306661321836, 0.3321465651559479, 0.07164353368913426, 0.15036443764453425, -0.04984153516672771, -0.018161938724669573, -0.029391004271147884, -0.14678460758830839, 0.061586367560769704, 0.2757605552659644, 0.012397565830991986, 0.23149691264912048, -0.36426525870338083, -0.18832418709883794, 0.03548454197863227, 0.10458606470047552, 0.06861493144293919, -0.01865364698049448, -0.26095082226538047, 0.10309891063062583, -0.17526298232705279, -0.08784329847651808, -0.012047258457031978, 0.030966693384791997, 0.021572812890414805, -0.27309144021504944, 0.1208112866809482, -0.02552350904135143, 0.16699196652454487, -0.023980297313948327, -0.1473516666323549, -0.0059467747814350705, 0.055595511233653215, -0.04642756024567301, 0.07082166858291362, 0.270963508764501, -0.09950073742211851, -0.03828133418882156, 0.3774071636472774, -0.14469761868445752, -0.0907564844497863, 0.182933823553407, -0.15994731060722295, -0.07442589983179727, 0.26364405833951693, 0.18279636541162345, 0.04514266689143637, -0.16234750629073996, 0.007829139700419653, 0.035433007448035125, 0.2852448995088172, 0.1359367156319101, 0.02473159636480405, 0.16575638811781948, 0.20595734410590547, 0.05180887175100746, 0.12107661607784821, -0.222723258896183, 0.006474622859455207, -0.21791727692436647, -0.12903516433913917, -0.14342403890811564, 0.062278614843757275, -0.09765996861447895, -0.06434015831567676, 0.3455424331868177, 0.09827429579077836, 0.13676171581781305, 0.029474074825617102, 0.32851576031569174, 0.09931912726161125, 0.022146000609363375, 0.06352661730009405, 0.27656568667358333, 0.16469270911868936, 0.1502983355812509, -0.2604057299137554, 0.03759833737687372, -0.023534175775506917] |
1,802.0288 | Roughness as Classicality Indicator of a Quantum State | We define a new quantifier of classicality for a quantum state, the
Roughness, which is given by the $\mathcal{L}^2 (\R^2)$ distance between Wigner
and Husimi functions. We show that the Roughness is bounded and therefore it is
a useful tool for comparison between different quantum states for single
bosonic systems. The state classification via the Roughness is not binary, but
rather it is continuous in the interval [0,1], being the state more classic as
the Roughness approaches to zero, and more quantum when it is closer to the
unity. The Roughness is maximum for Fock states when its number of photons is
arbitrarily large, and also for squeezed states at the maximum compression
limit. On the other hand, the Roughness reaches its minimum value for thermal
states at infinite temperature and, more generally, for infinite entropy
states. The Roughness of a coherent state is slightly below one half, so we may
say that it is more a classical state than a quantum one. Another important
result is that the Roughness performs well for discriminating both pure and
mixed states. Since the Roughness measures the inherent quantumness of a state,
we propose another function, the Dynamic Distance Measure (DDM), which is
suitable for measure how much quantum is a dynamics. Using DDM, we studied the
quartic oscillator, and we observed that there is a certain complementarity
between dynamics and state, i.e. when dynamics becomes more quantum, the
Roughness of the state decreases, while the Roughness grows as the dynamics
becomes less quantum.
| quant-ph | we define a new quantifier of classicality for a quantum state the roughness which is given by the mathcall2 r2 distance between wigner and husimi functions we show that the roughness is bounded and therefore it is a useful tool for comparison between different quantum states for single bosonic systems the state classification via the roughness is not binary but rather it is continuous in the interval 01 being the state more classic as the roughness approaches to zero and more quantum when it is closer to the unity the roughness is maximum for fock states when its number of photons is arbitrarily large and also for squeezed states at the maximum compression limit on the other hand the roughness reaches its minimum value for thermal states at infinite temperature and more generally for infinite entropy states the roughness of a coherent state is slightly below one half so we may say that it is more a classical state than a quantum one another important result is that the roughness performs well for discriminating both pure and mixed states since the roughness measures the inherent quantumness of a state we propose another function the dynamic distance measure ddm which is suitable for measure how much quantum is a dynamics using ddm we studied the quartic oscillator and we observed that there is a certain complementarity between dynamics and state ie when dynamics becomes more quantum the roughness of the state decreases while the roughness grows as the dynamics becomes less quantum | [['we', 'define', 'a', 'new', 'quantifier', 'of', 'classicality', 'for', 'a', 'quantum', 'state', 'the', 'roughness', 'which', 'is', 'given', 'by', 'the', 'mathcall2', 'r2', 'distance', 'between', 'wigner', 'and', 'husimi', 'functions', 'we', 'show', 'that', 'the', 'roughness', 'is', 'bounded', 'and', 'therefore', 'it', 'is', 'a', 'useful', 'tool', 'for', 'comparison', 'between', 'different', 'quantum', 'states', 'for', 'single', 'bosonic', 'systems', 'the', 'state', 'classification', 'via', 'the', 'roughness', 'is', 'not', 'binary', 'but', 'rather', 'it', 'is', 'continuous', 'in', 'the', 'interval', '01', 'being', 'the', 'state', 'more', 'classic', 'as', 'the', 'roughness', 'approaches', 'to', 'zero', 'and', 'more', 'quantum', 'when', 'it', 'is', 'closer', 'to', 'the', 'unity', 'the', 'roughness', 'is', 'maximum', 'for', 'fock', 'states', 'when', 'its', 'number', 'of', 'photons', 'is', 'arbitrarily', 'large', 'and', 'also', 'for', 'squeezed', 'states', 'at', 'the', 'maximum', 'compression', 'limit', 'on', 'the', 'other', 'hand', 'the', 'roughness', 'reaches', 'its', 'minimum', 'value', 'for', 'thermal', 'states', 'at', 'infinite', 'temperature', 'and', 'more', 'generally', 'for', 'infinite', 'entropy', 'states', 'the', 'roughness', 'of', 'a', 'coherent', 'state', 'is', 'slightly', 'below', 'one', 'half', 'so', 'we', 'may', 'say', 'that', 'it', 'is', 'more', 'a', 'classical', 'state', 'than', 'a', 'quantum', 'one', 'another', 'important', 'result', 'is', 'that', 'the', 'roughness', 'performs', 'well', 'for', 'discriminating', 'both', 'pure', 'and', 'mixed', 'states', 'since', 'the', 'roughness', 'measures', 'the', 'inherent', 'quantumness', 'of', 'a', 'state', 'we', 'propose', 'another', 'function', 'the', 'dynamic', 'distance', 'measure', 'ddm', 'which', 'is', 'suitable', 'for', 'measure', 'how', 'much', 'quantum', 'is', 'a', 'dynamics', 'using', 'ddm', 'we', 'studied', 'the', 'quartic', 'oscillator', 'and', 'we', 'observed', 'that', 'there', 'is', 'a', 'certain', 'complementarity', 'between', 'dynamics', 'and', 'state', 'ie', 'when', 'dynamics', 'becomes', 'more', 'quantum', 'the', 'roughness', 'of', 'the', 'state', 'decreases', 'while', 'the', 'roughness', 'grows', 'as', 'the', 'dynamics', 'becomes', 'less', 'quantum']] | [-0.09614102979908619, 0.23561526322922857, -0.14114199840905242, 0.10144054767141393, -0.012869386708798013, -0.17821411371594703, 0.034966102982147695, 0.3355574477269162, -0.28609284825541403, -0.24163571418301513, 0.08194850878678707, -0.3058652695568939, -0.11180446782349739, 0.21703820158374976, -0.03688886963676075, 0.07265113391291973, 0.04020618121937452, 0.0764402043467677, -0.06536972258551663, -0.21025848824649573, 0.3351725606151311, 0.051950419286870775, 0.2820249840717362, 0.0726874945425536, 0.08425663386200707, 0.012296590927396473, 0.09691423866911736, 0.029083513864408807, -0.12483472632213154, 0.082393141606715, 0.2203301633031022, 0.08049085508638704, 0.28558614155077244, -0.36544147262208726, -0.22065855185705352, 0.11474035302292096, 0.09425227124667429, 0.14226050617032318, 0.016090585240680053, -0.25873376751008753, 0.06979975023861618, -0.13309434569715356, -0.12505282068150156, -0.058250530405838295, 0.07096765079977087, -0.06830160652284521, -0.23233742798322374, 0.10717230292783393, 0.06318904502819148, 0.039232840348754926, -0.014810645424081866, -0.10303234004330232, -0.04954009659707071, 0.12443857355610527, -0.013432010713281978, 0.04813238757985284, 0.13331622927518286, -0.17209864778590733, -0.07740900349205887, 0.36772295054181875, -0.04224999890268726, -0.23936616366662353, 0.20599701839445375, -0.13958765913461488, -0.05325779037186468, 0.10066314515624329, 0.09733252970172943, 0.11967932326771111, -0.07769607629739926, 0.04949378717108166, -0.022052565255606792, 0.22306150991044776, 0.05637965819045189, 0.075538914257603, 0.18543823434534368, 0.15800244911328937, 0.1482491419517038, 0.18270788136781546, -0.1059587090916234, -0.1439742823771435, -0.28826765052647707, -0.1848547780335291, -0.23768608674566555, 0.07153195045445257, -0.09525850033934832, -0.1800335620277639, 0.37339923518572554, 0.10563606730930367, 0.18799635763855213, 0.0712024007220771, 0.28214930682220457, 0.170118806046059, 0.04765193124925087, 0.07414366395780408, 0.24411384547055065, 0.14112556374917526, 0.05667179799453166, -0.2195545070956784, 0.1088310471871326, 0.01911522604475694] |
1,802.02881 | Optical single photon detection in micron-scaled NbN bridges | We demonstrate experimentally that single photon detection can be achieved in
micron-wide NbN bridges, with widths ranging from 0.53 $\mu$m to 5.15 $\mu$m
and for photon-wavelengths from 408 nm to 1550 nm. The microbridges are biased
with a dc current close to the experimental critical current, which is
estimated to be about 50 % of the theoretically expected depairing current.
These results offer an alternative to the standard superconducting
single-photon detectors (SSPDs), based on nanometer scale nanowires implemented
in a long meandering structure. The results are consistent with improved
theoretical modelling based on the theory of non-equilibrium superconductivity
including the vortex-assisted mechanism of initial dissipation.
| cond-mat.supr-con | we demonstrate experimentally that single photon detection can be achieved in micronwide nbn bridges with widths ranging from 053 mum to 515 mum and for photonwavelengths from 408 nm to 1550 nm the microbridges are biased with a dc current close to the experimental critical current which is estimated to be about 50 of the theoretically expected depairing current these results offer an alternative to the standard superconducting singlephoton detectors sspds based on nanometer scale nanowires implemented in a long meandering structure the results are consistent with improved theoretical modelling based on the theory of nonequilibrium superconductivity including the vortexassisted mechanism of initial dissipation | [['we', 'demonstrate', 'experimentally', 'that', 'single', 'photon', 'detection', 'can', 'be', 'achieved', 'in', 'micronwide', 'nbn', 'bridges', 'with', 'widths', 'ranging', 'from', '053', 'mum', 'to', '515', 'mum', 'and', 'for', 'photonwavelengths', 'from', '408', 'nm', 'to', '1550', 'nm', 'the', 'microbridges', 'are', 'biased', 'with', 'a', 'dc', 'current', 'close', 'to', 'the', 'experimental', 'critical', 'current', 'which', 'is', 'estimated', 'to', 'be', 'about', '50', 'of', 'the', 'theoretically', 'expected', 'depairing', 'current', 'these', 'results', 'offer', 'an', 'alternative', 'to', 'the', 'standard', 'superconducting', 'singlephoton', 'detectors', 'sspds', 'based', 'on', 'nanometer', 'scale', 'nanowires', 'implemented', 'in', 'a', 'long', 'meandering', 'structure', 'the', 'results', 'are', 'consistent', 'with', 'improved', 'theoretical', 'modelling', 'based', 'on', 'the', 'theory', 'of', 'nonequilibrium', 'superconductivity', 'including', 'the', 'vortexassisted', 'mechanism', 'of', 'initial', 'dissipation']] | [-0.07613800686564953, 0.18041255228194594, -0.04123258819876641, 0.004179863118813099, -0.01873521897519537, -0.17108805693329915, 0.07051710835909106, 0.4417102413078514, -0.21871339784953378, -0.3523422147731717, 0.05369951777467184, -0.3007193947320475, -0.019845162326579586, 0.2809971949249944, -0.011222035747350138, 0.10160966370569761, 0.01574470657928317, -0.0659051847908938, -0.06000751089082127, -0.18220027026551427, 0.21776180851099758, 0.0659619251074379, 0.3634488517601116, 0.11831752545948998, 0.06053299575532768, -0.09211103301976098, 0.04987118883496698, 0.002647018034978971, -0.1542385134064306, 0.1115525344537352, 0.2440663173922575, -0.022315207622287905, 0.19538490468973987, -0.4447400574481078, -0.19707237756537163, -0.014343527378514409, 0.13329147075658992, 0.11694119178904586, -0.022131471958595748, -0.3279216763307797, 0.15894540470075227, -0.1211934347417863, -0.08473800899753091, 0.011079798671690858, -0.014691895394421676, 0.02037743317173319, -0.25508717143298676, 0.08110361306028732, -0.010994341562264691, 0.07386152298354051, -0.037157946268516574, -0.14992760086212964, -0.014692262403995675, 0.01818503045896981, -0.02523520420186733, 0.05791626783434813, 0.2165951961377526, -0.11775224503385377, -0.15621469210029817, 0.30595889468403425, -0.11538690063810232, -0.07711065356966619, 0.1790389672204779, -0.13480774089283146, -0.008857562016083986, 0.173580412643359, 0.11813848027411629, 0.08788576768254679, -0.1382730255141973, -0.020354922434575307, 0.009882076040786855, 0.26139941670950134, 0.07355954799362842, 0.10039561465565189, 0.26093133000255214, 0.2602545144310331, 2.862355105724989e-05, 0.10513227950786148, -0.1866226647158756, -0.0744534169972016, -0.2687805102562861, -0.10322851402566348, -0.16609996278752007, 0.10879197133038485, -0.08439687697896528, -0.14496991638203754, 0.375508031899146, 0.2531164310753857, 0.2059297937393079, 0.03448547203637039, 0.28049988254868224, 0.11750111648557234, 0.09673879652594526, 0.009483821223279936, 0.3345797498728715, 0.1318484610688471, 0.0914323777051679, -0.1990772721348513, 0.040896289383846464, -0.07672099120841891] |
1,802.02882 | Low-lying eigenvalues of semiclassical Schr\"odinger operator with
degenerate wells | In this article, we consider the semiclassical Schr\"odinger operator $P = -
h^{2} \Delta + V$ in $\mathbb{R}^{d}$ with confining non-negative potential $V$
which vanishes, and study its low-lying eigenvalues $\lambda_{k} ( P )$ as $h
\to 0$. First, we give a necessary and sufficient criterion upon $V^{-1} ( 0 )$
for $\lambda_{1} ( P ) h^{- 2}$ to be bounded. When $d = 1$ and $V^{-1} ( 0 ) =
\{ 0 \}$, we are able to control the eigenvalues $\lambda_{k} ( P )$ for
monotonous potentials by a quantity linked to an interval $I_{h}$, determined
by an implicit relation involving $V$ and $h$. Next, we consider the case where
$V$ has a flat minimum, in the sense that it vanishes to infinite order. We
give the asymptotic of the eigenvalues: they behave as the eigenvalues of the
Dirichlet Laplacian on $I_{h}$. Our analysis includes an asymptotic of the
associated eigenvectors and extends in particular cases to higher dimensions.
| math.SP math-ph math.MP | in this article we consider the semiclassical schrodinger operator p h2 delta v in mathbbrd with confining nonnegative potential v which vanishes and study its lowlying eigenvalues lambda_k p as h to 0 first we give a necessary and sufficient criterion upon v1 0 for lambda_1 p h 2 to be bounded when d 1 and v1 0 0 we are able to control the eigenvalues lambda_k p for monotonous potentials by a quantity linked to an interval i_h determined by an implicit relation involving v and h next we consider the case where v has a flat minimum in the sense that it vanishes to infinite order we give the asymptotic of the eigenvalues they behave as the eigenvalues of the dirichlet laplacian on i_h our analysis includes an asymptotic of the associated eigenvectors and extends in particular cases to higher dimensions | [['in', 'this', 'article', 'we', 'consider', 'the', 'semiclassical', 'schrodinger', 'operator', 'p', 'h2', 'delta', 'v', 'in', 'mathbbrd', 'with', 'confining', 'nonnegative', 'potential', 'v', 'which', 'vanishes', 'and', 'study', 'its', 'lowlying', 'eigenvalues', 'lambda_k', 'p', 'as', 'h', 'to', '0', 'first', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'criterion', 'upon', 'v1', '0', 'for', 'lambda_1', 'p', 'h', '2', 'to', 'be', 'bounded', 'when', 'd', '1', 'and', 'v1', '0', '0', 'we', 'are', 'able', 'to', 'control', 'the', 'eigenvalues', 'lambda_k', 'p', 'for', 'monotonous', 'potentials', 'by', 'a', 'quantity', 'linked', 'to', 'an', 'interval', 'i_h', 'determined', 'by', 'an', 'implicit', 'relation', 'involving', 'v', 'and', 'h', 'next', 'we', 'consider', 'the', 'case', 'where', 'v', 'has', 'a', 'flat', 'minimum', 'in', 'the', 'sense', 'that', 'it', 'vanishes', 'to', 'infinite', 'order', 'we', 'give', 'the', 'asymptotic', 'of', 'the', 'eigenvalues', 'they', 'behave', 'as', 'the', 'eigenvalues', 'of', 'the', 'dirichlet', 'laplacian', 'on', 'i_h', 'our', 'analysis', 'includes', 'an', 'asymptotic', 'of', 'the', 'associated', 'eigenvectors', 'and', 'extends', 'in', 'particular', 'cases', 'to', 'higher', 'dimensions']] | [-0.15332485672242782, 0.11802802174268665, -0.015599391079618484, 0.023999725226671077, -0.037410550182555, -0.1813297445423432, 0.021655199855526948, 0.3546373331772776, -0.2688651754768318, -0.21103005054800844, 0.06067506306791691, -0.32218470930779625, -0.13461869299229418, 0.09194073321336842, -0.033095465842764696, 0.040405360707065574, 0.03852024847247566, 0.14638504638968336, -0.048510244634764436, -0.22121750167733828, 0.31779355255209585, -0.028236318308000382, 0.15464221556683988, 0.08258227756820045, 0.0508563384523927, -0.011735645238427328, 0.03637232434597205, -0.02922996594089499, -0.2488655757496945, 0.09290022387208378, 0.2449755179923731, 0.06154889548262516, 0.28179199680998607, -0.3646695230455769, -0.13788052179388233, 0.1915328317497681, 0.17836383205021966, 0.0009517837470475507, 0.050186448895789264, -0.258373841482143, 0.14203293360704622, -0.10594557190209732, -0.20353070587909722, -0.06486028259607045, 0.13471117982204509, 0.004870137615761088, -0.33332466444821207, 0.11242050087971651, 0.12791710246640903, 0.03838553105422354, -0.07078256794183117, -0.18554820344047426, -0.05116818950290082, 0.10020184225563149, 0.019280383205432055, 0.04310715493951253, 0.03585776175092255, -0.07454609135458884, -0.046827273134799945, 0.36313922637487417, -0.09929063152994022, -0.22718989859246388, 0.12237570333535543, -0.1865624581053332, -0.11721790486204249, 0.08061877288367156, 0.12075658829661308, 0.16190723565543866, -0.058554321923639165, 0.20478690921783227, -0.02704737211050062, 0.10234418715890888, 0.10388058931664466, -0.01586425788798272, 0.06944997475476011, 0.04319820925267739, 0.14798194771368786, 0.12579035641335706, -0.044926354478005893, -0.012572729162272665, -0.3921279192127131, -0.14691885123420115, -0.2242793081706012, 0.12359691120544122, -0.1009177887852758, -0.16563126190819524, 0.35660113411193545, 0.09283717869539986, 0.2617510688080863, 0.06421031666206443, 0.17050519408462764, 0.1865118085768992, -0.01731683274444479, 0.09351222596776027, 0.12478572597004264, 0.18600580822090274, 0.09321643982304038, -0.209358630382775, -0.019016762879527322, 0.0970454203013544] |
1,802.02883 | Renormalization for a Scalar Field in an External Scalar Potential | The Pauli--Villars regularization procedure confirms and sharpens the
conclusions reached previously by covariant point splitting. The divergences in
the stress tensor of a quantized scalar field interacting with a static scalar
potential are isolated into a three-parameter local, covariant functional of
the background potential. These divergences can be naturally absorbed into
coupling constants of the potential, regarded as a dynamical object in its own
right; here this is demonstrated in detail for two different models of the
field-potential coupling. here is a residual dependence on the logarithm of the
potential, reminiscent of the renormalization group in fully interacting
quantum field theories; these terms are finite but numerically dependent on an
arbitrary mass or length parameter, which is purely a matter of convention.
This work is one step in a program to elucidate boundary divergences by
replacing a sharp boundary by a steeply rising smooth potential.
| hep-th gr-qc math-ph math.MP quant-ph | the paulivillars regularization procedure confirms and sharpens the conclusions reached previously by covariant point splitting the divergences in the stress tensor of a quantized scalar field interacting with a static scalar potential are isolated into a threeparameter local covariant functional of the background potential these divergences can be naturally absorbed into coupling constants of the potential regarded as a dynamical object in its own right here this is demonstrated in detail for two different models of the fieldpotential coupling here is a residual dependence on the logarithm of the potential reminiscent of the renormalization group in fully interacting quantum field theories these terms are finite but numerically dependent on an arbitrary mass or length parameter which is purely a matter of convention this work is one step in a program to elucidate boundary divergences by replacing a sharp boundary by a steeply rising smooth potential | [['the', 'paulivillars', 'regularization', 'procedure', 'confirms', 'and', 'sharpens', 'the', 'conclusions', 'reached', 'previously', 'by', 'covariant', 'point', 'splitting', 'the', 'divergences', 'in', 'the', 'stress', 'tensor', 'of', 'a', 'quantized', 'scalar', 'field', 'interacting', 'with', 'a', 'static', 'scalar', 'potential', 'are', 'isolated', 'into', 'a', 'threeparameter', 'local', 'covariant', 'functional', 'of', 'the', 'background', 'potential', 'these', 'divergences', 'can', 'be', 'naturally', 'absorbed', 'into', 'coupling', 'constants', 'of', 'the', 'potential', 'regarded', 'as', 'a', 'dynamical', 'object', 'in', 'its', 'own', 'right', 'here', 'this', 'is', 'demonstrated', 'in', 'detail', 'for', 'two', 'different', 'models', 'of', 'the', 'fieldpotential', 'coupling', 'here', 'is', 'a', 'residual', 'dependence', 'on', 'the', 'logarithm', 'of', 'the', 'potential', 'reminiscent', 'of', 'the', 'renormalization', 'group', 'in', 'fully', 'interacting', 'quantum', 'field', 'theories', 'these', 'terms', 'are', 'finite', 'but', 'numerically', 'dependent', 'on', 'an', 'arbitrary', 'mass', 'or', 'length', 'parameter', 'which', 'is', 'purely', 'a', 'matter', 'of', 'convention', 'this', 'work', 'is', 'one', 'step', 'in', 'a', 'program', 'to', 'elucidate', 'boundary', 'divergences', 'by', 'replacing', 'a', 'sharp', 'boundary', 'by', 'a', 'steeply', 'rising', 'smooth', 'potential']] | [-0.1468182152410134, 0.17793910886925757, -0.1398903830811895, 0.07119838331649402, -0.08026463768348611, -0.14545148255158988, 0.004087015567347407, 0.3395596560171067, -0.24483423633500934, -0.25937023380578594, 0.058951951090471244, -0.263063915793238, -0.14992680730747765, 0.12547263320985025, -0.0372454092548839, 0.03883657276847175, -0.026988205798612587, 0.06744118781182273, -0.08102837524473153, -0.21798107460349928, 0.35878761792234304, 0.02598717365060644, 0.2388921691506202, 0.08577464171845851, 0.08708434560304058, -0.0015441449086085477, -0.015652208974392248, 0.055750655488849714, -0.07066781579773744, 0.07691890703642677, 0.18503751024267143, 0.014742767884685048, 0.2781137521254252, -0.39920937972592896, -0.262444035952975, 0.06543046568745169, 0.1663776349372648, 0.10705726526533092, -0.05997030921280384, -0.26854891294998856, 0.03381185600341394, -0.17077766087163113, -0.16454276421573014, -0.07831920724008874, 0.0002581895698375743, -0.03284648592696236, -0.26657472491135886, 0.11187837673832887, 0.014907803369388947, 0.04443230701064498, -0.0782264847493056, -0.08623125351612167, -0.03066755850189205, 0.06909415876163684, 0.07516683961489591, 0.07276134562662578, 0.14482279733337206, -0.16733872860927007, -0.08170239083822174, 0.3542336855019475, -0.0921783815836534, -0.22768390600826463, 0.14804249886937182, -0.11304100005534189, -0.11267551170854732, 0.11258614399663076, 0.11094255544694848, 0.15068042800151582, -0.1746154856065224, 0.15437354588648305, 0.014564667173243803, 0.12064286463769507, 0.04819420409099809, 0.004435554326608263, 0.23778602844425317, 0.10369141987235896, 0.03698895179249089, 0.13704539510052138, -0.0071717536755323665, -0.13642192573511394, -0.38422091447844586, -0.14516764192617146, -0.177687364790974, 0.05833806504409134, -0.12086008729338887, -0.19716535775183602, 0.4091345655250138, 0.09524469312344645, 0.21623448623898278, 0.027645235670056067, 0.29181588978089135, 0.15807540418564117, 0.10152156574266225, 0.0206360448890462, 0.2714985573278933, 0.15767071224219198, 0.04128449568043238, -0.24242084729083782, -0.014268689271833362, 0.08291136572651309] |
1,802.02884 | Performance of a full scale prototype detector at the BR2 reactor for
the SoLid experiment | The SoLid collaboration has developed a new detector technology to detect
electron anti-neutrinos at close proximity to the Belgian BR2 reactor at
surface level. A 288$\,$kg prototype detector was deployed in 2015 and
collected data during the operational period of the reactor and during reactor
shut-down. Dedicated calibration campaigns were also performed with gamma and
neutron sources.
This paper describes the construction of the prototype detector with a high
control on its proton content and the stability of its operation over a period
of several months after deployment at the BR2 reactor site. All detector cells
provide sufficient light yields to achieve a target energy resolution of better
than 20%/$\sqrt{E(MeV)}$. The capability of the detector to track muons is
exploited to equalize the light response of a large number of channels to a
precision of 3% and to demonstrate the stability of the energy scale over time.
Particle identification based on pulse-shape discrimination is demonstrated
with calibration sources. Despite a lower neutron detection efficiency due to
triggering constraints, the main backgrounds at the reactor site were
determined and taken into account in the shielding strategy for the main
experiment. The results obtained with this prototype proved essential in the
design optimization of the final detector.
This paper is dedicated to our SCK$\cdot$CEN colleague, Edgar Koonen, who
passed away unexpectedly in 2017. Edgar was part of the SoLid collaboration
since its inception and his efforts were vital to get the experiment started.
He will be duly missed.
| physics.ins-det hep-ex | the solid collaboration has developed a new detector technology to detect electron antineutrinos at close proximity to the belgian br2 reactor at surface level a 288kg prototype detector was deployed in 2015 and collected data during the operational period of the reactor and during reactor shutdown dedicated calibration campaigns were also performed with gamma and neutron sources this paper describes the construction of the prototype detector with a high control on its proton content and the stability of its operation over a period of several months after deployment at the br2 reactor site all detector cells provide sufficient light yields to achieve a target energy resolution of better than 20sqrtemev the capability of the detector to track muons is exploited to equalize the light response of a large number of channels to a precision of 3 and to demonstrate the stability of the energy scale over time particle identification based on pulseshape discrimination is demonstrated with calibration sources despite a lower neutron detection efficiency due to triggering constraints the main backgrounds at the reactor site were determined and taken into account in the shielding strategy for the main experiment the results obtained with this prototype proved essential in the design optimization of the final detector this paper is dedicated to our sckcdotcen colleague edgar koonen who passed away unexpectedly in 2017 edgar was part of the solid collaboration since its inception and his efforts were vital to get the experiment started he will be duly missed | [['the', 'solid', 'collaboration', 'has', 'developed', 'a', 'new', 'detector', 'technology', 'to', 'detect', 'electron', 'antineutrinos', 'at', 'close', 'proximity', 'to', 'the', 'belgian', 'br2', 'reactor', 'at', 'surface', 'level', 'a', '288kg', 'prototype', 'detector', 'was', 'deployed', 'in', '2015', 'and', 'collected', 'data', 'during', 'the', 'operational', 'period', 'of', 'the', 'reactor', 'and', 'during', 'reactor', 'shutdown', 'dedicated', 'calibration', 'campaigns', 'were', 'also', 'performed', 'with', 'gamma', 'and', 'neutron', 'sources', 'this', 'paper', 'describes', 'the', 'construction', 'of', 'the', 'prototype', 'detector', 'with', 'a', 'high', 'control', 'on', 'its', 'proton', 'content', 'and', 'the', 'stability', 'of', 'its', 'operation', 'over', 'a', 'period', 'of', 'several', 'months', 'after', 'deployment', 'at', 'the', 'br2', 'reactor', 'site', 'all', 'detector', 'cells', 'provide', 'sufficient', 'light', 'yields', 'to', 'achieve', 'a', 'target', 'energy', 'resolution', 'of', 'better', 'than', '20sqrtemev', 'the', 'capability', 'of', 'the', 'detector', 'to', 'track', 'muons', 'is', 'exploited', 'to', 'equalize', 'the', 'light', 'response', 'of', 'a', 'large', 'number', 'of', 'channels', 'to', 'a', 'precision', 'of', '3', 'and', 'to', 'demonstrate', 'the', 'stability', 'of', 'the', 'energy', 'scale', 'over', 'time', 'particle', 'identification', 'based', 'on', 'pulseshape', 'discrimination', 'is', 'demonstrated', 'with', 'calibration', 'sources', 'despite', 'a', 'lower', 'neutron', 'detection', 'efficiency', 'due', 'to', 'triggering', 'constraints', 'the', 'main', 'backgrounds', 'at', 'the', 'reactor', 'site', 'were', 'determined', 'and', 'taken', 'into', 'account', 'in', 'the', 'shielding', 'strategy', 'for', 'the', 'main', 'experiment', 'the', 'results', 'obtained', 'with', 'this', 'prototype', 'proved', 'essential', 'in', 'the', 'design', 'optimization', 'of', 'the', 'final', 'detector', 'this', 'paper', 'is', 'dedicated', 'to', 'our', 'sckcdotcen', 'colleague', 'edgar', 'koonen', 'who', 'passed', 'away', 'unexpectedly', 'in', '2017', 'edgar', 'was', 'part', 'of', 'the', 'solid', 'collaboration', 'since', 'its', 'inception', 'and', 'his', 'efforts', 'were', 'vital', 'to', 'get', 'the', 'experiment', 'started', 'he', 'will', 'be', 'duly', 'missed']] | [-0.05767323851401902, 0.12370519654886651, -0.08966554547131872, 0.02275926404759104, -0.030959949234630836, -0.13126958192229354, 0.06683016591897012, 0.33895976535608, -0.18486377587704825, -0.37798508462484603, 0.1228915544019805, -0.312421172536304, -0.0347434783147441, 0.20971385525096853, -0.0750207027339917, 0.06788079154322216, 0.11778911557278515, 0.03363623150153404, -0.05871958887672105, -0.2532111347677884, 0.22616853006255963, 0.2181831132390617, 0.2950844402729683, 0.0839372842722101, 0.1375561119291985, -0.009739583956054699, -0.08519325842108355, -0.04869039485675624, -0.07190647440600312, 0.06342962582752783, 0.27801320223145404, 0.13703255134025288, 0.21743189830978787, -0.44356840877283993, -0.16350998853104776, 0.09914891200509965, 0.051472626396535354, 0.03693547915310863, -0.0650498942728825, -0.31265370679613, 0.09604729223448338, -0.203940496314317, -0.14533474022875167, 0.0056601511007903045, 0.006930009011608461, 0.0071798343735520916, -0.24069556188645078, -0.020344234662970775, -0.0028737781348028854, 0.05080701854585865, -0.06028514188367475, -0.14141812946248816, 0.020989280867624124, 0.13960598998630244, 0.04043889737458288, 0.04445677897866543, 0.14407583199529583, -0.09965700603956396, -0.08102115954237955, 0.33639568866924247, -0.009050586516980883, -0.08763855003017391, 0.1759960554983781, -0.17404206026462385, -0.09789196804976436, 0.18362488093979487, 0.20505681036829704, 0.0632495693728297, -0.18891123787273842, 0.014101208599884094, 0.02466853578678436, 0.1867879157878244, 0.0923014788317337, -0.015928831048225487, 0.21025938072448802, 0.270549766635024, 0.07169272056100469, 0.10333032977581408, -0.1859054792147329, -0.010093727538078533, -0.29630710315074266, -0.12917429383606036, -0.13724683472693136, 0.030780515594718356, 0.03121466559295422, -0.06870787668870326, 0.42193840435656255, 0.09924005640578674, 0.1289945557543916, -0.013298224420152573, 0.29048140729306104, 0.01736682861657246, 0.08428382028314407, 0.021297366501104257, 0.3084055842436973, 0.10731257155264293, 0.19696656304388593, -0.2179742370111247, 0.07597650637574217, 0.028924690869947273] |
1,802.02885 | Online Decomposition of Compressive Streaming Data Using $n$-$\ell_1$
Cluster-Weighted Minimization | We consider a decomposition method for compressive streaming data in the
context of online compressive Robust Principle Component Analysis (RPCA). The
proposed decomposition solves an $n$-$\ell_1$ cluster-weighted minimization to
decompose a sequence of frames (or vectors), into sparse and low-rank
components, from compressive measurements. Our method processes a data vector
of the stream per time instance from a small number of measurements in contrast
to conventional batch RPCA, which needs to access full data. The $n$-$\ell_1$
cluster-weighted minimization leverages the sparse components along with their
correlations with multiple previously-recovered sparse vectors. Moreover, the
proposed minimization can exploit the structures of sparse components via
clustering and re-weighting iteratively. The method outperforms the existing
methods for both numerical data and actual video data.
| cs.IT math.IT stat.ML | we consider a decomposition method for compressive streaming data in the context of online compressive robust principle component analysis rpca the proposed decomposition solves an nell_1 clusterweighted minimization to decompose a sequence of frames or vectors into sparse and lowrank components from compressive measurements our method processes a data vector of the stream per time instance from a small number of measurements in contrast to conventional batch rpca which needs to access full data the nell_1 clusterweighted minimization leverages the sparse components along with their correlations with multiple previouslyrecovered sparse vectors moreover the proposed minimization can exploit the structures of sparse components via clustering and reweighting iteratively the method outperforms the existing methods for both numerical data and actual video data | [['we', 'consider', 'a', 'decomposition', 'method', 'for', 'compressive', 'streaming', 'data', 'in', 'the', 'context', 'of', 'online', 'compressive', 'robust', 'principle', 'component', 'analysis', 'rpca', 'the', 'proposed', 'decomposition', 'solves', 'an', 'nell_1', 'clusterweighted', 'minimization', 'to', 'decompose', 'a', 'sequence', 'of', 'frames', 'or', 'vectors', 'into', 'sparse', 'and', 'lowrank', 'components', 'from', 'compressive', 'measurements', 'our', 'method', 'processes', 'a', 'data', 'vector', 'of', 'the', 'stream', 'per', 'time', 'instance', 'from', 'a', 'small', 'number', 'of', 'measurements', 'in', 'contrast', 'to', 'conventional', 'batch', 'rpca', 'which', 'needs', 'to', 'access', 'full', 'data', 'the', 'nell_1', 'clusterweighted', 'minimization', 'leverages', 'the', 'sparse', 'components', 'along', 'with', 'their', 'correlations', 'with', 'multiple', 'previouslyrecovered', 'sparse', 'vectors', 'moreover', 'the', 'proposed', 'minimization', 'can', 'exploit', 'the', 'structures', 'of', 'sparse', 'components', 'via', 'clustering', 'and', 'reweighting', 'iteratively', 'the', 'method', 'outperforms', 'the', 'existing', 'methods', 'for', 'both', 'numerical', 'data', 'and', 'actual', 'video', 'data']] | [-0.08756571243866347, 0.008422254130831182, -0.10719505836411068, 0.009313036978710443, -0.10452216317256292, -0.12369354263355489, 0.02435395406888953, 0.3962834457556407, -0.380902181713221, -0.26736087960501514, 0.14202590047886285, -0.2710278570225152, -0.14339851043769158, 0.1382018968288321, -0.06749835661612451, 0.11948651948963136, 0.13870667410083115, 0.007122088898904621, -0.0921122290349255, -0.22867245775220604, 0.2650073545053601, 0.04446978329991301, 0.35592714019585403, -0.07294828361676385, 0.14112112673174124, 0.09512708351345887, -0.09747605870458452, 0.013713944796472788, -0.00793842250908104, 0.1889630447103021, 0.308290715670834, 0.2359358841061142, 0.3180662667301173, -0.43895007905860745, -0.2411388327057163, 0.10461279705632479, 0.15050008207132728, 0.10407334140327293, -0.05539374077925459, -0.280384572725355, 0.12451653684062573, -0.13020142577879595, 0.017776751477504148, -0.1334540982497856, -0.07899732950997228, -0.007257452579991271, -0.39753204172787565, 0.11888504448579625, 0.052025086145537594, -0.0027845787815749647, -0.12335354802198709, -0.16464624052168803, 0.06940377242475128, 0.07162827051846156, 0.07547120824359202, 0.030354183334081124, 0.11065367173869163, -0.0783930602328231, -0.13069670843154502, 0.3702832391485572, -0.07244807989142525, -0.21491696174586347, 0.15623094087156156, -0.002591780264629051, -0.1594596814655233, 0.15708655689328832, 0.2506247993306412, 0.10129845180393507, -0.1382168678062347, 0.031071342885358413, -0.06697933453445633, 0.1748382886328424, 0.00405088736054798, -0.014670554835659762, 0.1010437958757393, 0.15231006812149037, 0.10066040173048046, 0.12565032137887708, -0.16383054034085945, -0.037221323947111765, -0.19608169109900095, -0.08743768686739108, -0.24452043085669478, -0.09917173904977972, -0.18547595811117693, -0.14955715238271902, 0.4014459306024946, 0.1576411995687522, 0.23670157336164266, 0.08253856763185467, 0.4385022413606445, 0.040328013930896606, 0.10072693790273964, 0.12042387373221572, 0.15042409885597105, 0.15278815977896254, 0.10306630508457601, -0.17945765748542422, 0.043067150431064266, 0.06414302672880391] |
1,802.02886 | Characterization of spin coated Zn doped cupric oxide thin films | Thin films of Zn2+ doped cupric oxide (CuO) were synthesized using spin
coating technique starting from a solution with Cu and Zn. The speed of spin
coating and time duration were varied to fabricate a film with required uniform
thickness. Samples were subsequently annealed in air at different annealing
temperatures to crystallize the phase of CuO. Doping concentration of Zn2+ was
varied up to weight percentage of 10%. Structural properties of samples were
determined using X-ray diffraction technique. Particle size, dislocation
density and strain at different doping concentrations were determined using XRD
patterns. Optical properties were measured by means of UV/Vis spectrometer.
Optical band gap of CuO could be tailored by doping a trace amount of Zn2+. The
optical band gap decreases with increase of particle size. The particle size,
dislocation density, strain and optical band gap have a turning point close to
the doping concentration of 6%.
| cond-mat.mtrl-sci | thin films of zn2 doped cupric oxide cuo were synthesized using spin coating technique starting from a solution with cu and zn the speed of spin coating and time duration were varied to fabricate a film with required uniform thickness samples were subsequently annealed in air at different annealing temperatures to crystallize the phase of cuo doping concentration of zn2 was varied up to weight percentage of 10 structural properties of samples were determined using xray diffraction technique particle size dislocation density and strain at different doping concentrations were determined using xrd patterns optical properties were measured by means of uvvis spectrometer optical band gap of cuo could be tailored by doping a trace amount of zn2 the optical band gap decreases with increase of particle size the particle size dislocation density strain and optical band gap have a turning point close to the doping concentration of 6 | [['thin', 'films', 'of', 'zn2', 'doped', 'cupric', 'oxide', 'cuo', 'were', 'synthesized', 'using', 'spin', 'coating', 'technique', 'starting', 'from', 'a', 'solution', 'with', 'cu', 'and', 'zn', 'the', 'speed', 'of', 'spin', 'coating', 'and', 'time', 'duration', 'were', 'varied', 'to', 'fabricate', 'a', 'film', 'with', 'required', 'uniform', 'thickness', 'samples', 'were', 'subsequently', 'annealed', 'in', 'air', 'at', 'different', 'annealing', 'temperatures', 'to', 'crystallize', 'the', 'phase', 'of', 'cuo', 'doping', 'concentration', 'of', 'zn2', 'was', 'varied', 'up', 'to', 'weight', 'percentage', 'of', '10', 'structural', 'properties', 'of', 'samples', 'were', 'determined', 'using', 'xray', 'diffraction', 'technique', 'particle', 'size', 'dislocation', 'density', 'and', 'strain', 'at', 'different', 'doping', 'concentrations', 'were', 'determined', 'using', 'xrd', 'patterns', 'optical', 'properties', 'were', 'measured', 'by', 'means', 'of', 'uvvis', 'spectrometer', 'optical', 'band', 'gap', 'of', 'cuo', 'could', 'be', 'tailored', 'by', 'doping', 'a', 'trace', 'amount', 'of', 'zn2', 'the', 'optical', 'band', 'gap', 'decreases', 'with', 'increase', 'of', 'particle', 'size', 'the', 'particle', 'size', 'dislocation', 'density', 'strain', 'and', 'optical', 'band', 'gap', 'have', 'a', 'turning', 'point', 'close', 'to', 'the', 'doping', 'concentration', 'of', '6']] | [-0.05938106126130741, 0.24956018495750204, -0.010224571583691883, -0.06349352611279166, 0.02428447575358724, -0.15158006973325502, 0.14496958972508642, 0.5162628448090038, -0.282576646542529, -0.3769940722095025, 0.019712476788176777, -0.37015190796070807, -0.017429966057927626, 0.14340953617529767, 0.0309381449116847, 0.08186083891101785, -0.05584701087807205, -0.12419979745794302, -0.14390881635670275, -0.24366482061875128, 0.20676693473030133, 0.09636218103932569, 0.33501795085612684, 0.054351185753664655, 0.007122852178793904, 0.009864463782365862, 0.09751221571570716, 0.06059278376287202, -0.17644809893131055, 0.039564405690652095, 0.2720465147977921, -0.1226044352405478, 0.15642053519400792, -0.46778460259775856, -0.24181062623707428, -0.049192207258169515, 0.10834960176332577, 0.10319029467457251, -0.10675952132127399, -0.2319820773932529, 0.08479642846646744, -0.07549995366433584, -0.1508426284102874, -0.022132039227447397, -0.02583118830178235, 0.05752209239840709, -0.22087077431048807, 0.1000589975785162, -0.008909886048452274, 0.15823170142499982, -0.15218192414456122, -0.16765815517676338, -0.1475972548202687, 0.059169628569302524, 0.050657984759734084, 0.04807462595478707, 0.2878620399011148, -0.018652942223549896, -0.03945892317711401, 0.28488870514902864, -0.002857525703950307, -0.014062475496069277, 0.12996774901812141, -0.18605976626654533, -0.024020292189819686, 0.2831976623589022, 0.10169915163360939, 0.09862793648514796, -0.16686350392882485, 0.06457619326711456, 0.033232389805709465, 0.2946638388040466, 0.2025961947212046, 0.034201661082349614, 0.20778914030981124, 0.23751528999717855, 0.007482100865328559, 0.16874184163218062, -0.20579135209727856, 0.06268791851235202, -0.10794194468385163, -0.19968083340712395, -0.23666893932779595, 0.07955403594658836, -0.13518525354408445, -0.18286022710034977, 0.3641336139297818, 0.08153510145761224, 0.15022394664088465, -0.05135118422677388, 0.14289130681946344, 0.08105968909866705, 0.09807834174244891, -0.0225269314077859, 0.22294158189607835, 0.18847251932193348, 0.1435885169761408, -0.27995379232153345, 0.11147093500039773, 0.014129414821729518] |
1,802.02887 | Geometrodynamics of electrons in a crystal under position and time
dependent deformation | Semiclassical dynamics of Bloch electrons in a crystal under slowly varying
deformation is developed in the geometric language of a lattice bundle. Berry
curvatures and gradients of energy are introduced in terms of lattice covariant
derivatives, with the corresponding connections given by the gradient and rate
of strain. A number of physical effects are discussed: an effective
post-Newtonian gravity at band bottom, polarization induced by spatial gradient
of strain, orbital magnetization induced by strain rate, and electron energy
stress tensor.
| cond-mat.mtrl-sci | semiclassical dynamics of bloch electrons in a crystal under slowly varying deformation is developed in the geometric language of a lattice bundle berry curvatures and gradients of energy are introduced in terms of lattice covariant derivatives with the corresponding connections given by the gradient and rate of strain a number of physical effects are discussed an effective postnewtonian gravity at band bottom polarization induced by spatial gradient of strain orbital magnetization induced by strain rate and electron energy stress tensor | [['semiclassical', 'dynamics', 'of', 'bloch', 'electrons', 'in', 'a', 'crystal', 'under', 'slowly', 'varying', 'deformation', 'is', 'developed', 'in', 'the', 'geometric', 'language', 'of', 'a', 'lattice', 'bundle', 'berry', 'curvatures', 'and', 'gradients', 'of', 'energy', 'are', 'introduced', 'in', 'terms', 'of', 'lattice', 'covariant', 'derivatives', 'with', 'the', 'corresponding', 'connections', 'given', 'by', 'the', 'gradient', 'and', 'rate', 'of', 'strain', 'a', 'number', 'of', 'physical', 'effects', 'are', 'discussed', 'an', 'effective', 'postnewtonian', 'gravity', 'at', 'band', 'bottom', 'polarization', 'induced', 'by', 'spatial', 'gradient', 'of', 'strain', 'orbital', 'magnetization', 'induced', 'by', 'strain', 'rate', 'and', 'electron', 'energy', 'stress', 'tensor']] | [-0.20150675388867967, 0.2401597814519846, -0.04667994451592676, 0.013845479891460854, -0.06622132469783537, -0.07277381388121285, 0.0022900624899193645, 0.3919991665054113, -0.30093681905418634, -0.26605522201862186, 0.0014073093960178084, -0.21453467366518453, -0.14011716693639756, 0.1335019453195855, -0.028422629201668315, 0.05306752354154014, -0.024389279360184445, 0.01212398192146793, -0.11639988477109, -0.2180602044929401, 0.3156921115005389, 0.09001769119640812, 0.2802473900024779, 0.07669332507421131, 0.11302467939676716, 0.008939214842393994, 0.02788798741530627, 0.05608356389566325, -0.15197484641103073, 0.1102418171823956, 0.19232298245769924, -0.07251269800035516, 0.2228420645929873, -0.478249166556634, -0.2428526246105321, -0.0017689294007141143, 0.050448408164083955, 0.1249139977269806, -0.02627620449056849, -0.2697930722963065, 0.019908682687673717, -0.1311076608253643, -0.13006127022599684, -0.10716319057391957, 0.04344832339556888, 0.02337011058116332, -0.24027720124431654, 0.1618581610131514, 0.028579927308601327, 0.11280096645932644, -0.10758149475877872, -0.11125619653321336, -0.14105041289585643, 0.0031573017593473198, 0.12335994987224694, 0.09221260777012504, 0.19625434699701144, -0.10871027329412755, -0.09415662325918675, 0.3811962509644218, -0.10748422857141122, -0.24405051385983825, 0.060758641915163024, -0.15296228041988796, -0.026105333818122745, 0.1709669181436766, 0.15347420532416436, 0.09660648396238684, -0.1415282194269821, 0.12107432448319741, 0.10361700060311704, 0.08933418339584023, 0.12396741197444498, 0.042898143734782936, 0.24391894857399166, 0.10499266088008881, 0.06052971938624978, 0.11380223385058344, -0.10461584540898912, -0.08967846970772371, -0.31062710005789995, -0.1496986520010978, -0.22862759652198292, 0.07937082126445602, -0.16238790504230566, -0.1515116745082196, 0.4398021792061627, 0.035231737163849176, 0.1506776790607546, 0.015723047833307646, 0.23281437196128535, 0.12072587821166962, 0.050456296105403454, 0.07613036112743429, 0.2737873421632685, 0.23315782112476882, 0.08038887180300662, -0.29918825891800227, 0.005601780005963519, 0.09247079986089375] |
1,802.02888 | Spatial mapping and analysis of aerosols during a forest fire using
computational mobile microscopy | Forest fires are a major source of particulate matter (PM) air pollution on a
global scale. The composition and impact of PM are typically studied using only
laboratory instruments and extrapolated to real fire events owing to a lack of
analytical techniques suitable for field-settings. To address this and similar
field test challenges, we developed a mobile-microscopy and
machine-learning-based air quality monitoring platform called c-Air, which can
perform air sampling and microscopic analysis of aerosols in an integrated
portable device. We tested its performance for PM sizing and morphological
analysis during a recent forest fire event in La Tuna Canyon Park by spatially
mapping the PM. The result shows that with decreasing distance to the fire
site, the PM concentration increases dramatically, especially for particles
smaller than 2 microns. Image analysis from the c-Air portable device also
shows that the increased PM is comparatively strongly absorbing and asymmetric,
with an aspect ratio of 0.5-0.7. These PM features indicate that a major
portion of the PM may be open-flame-combustion-generated element carbon
soot-type particles. This initial small-scale experiment shows that c-Air has
some potential for forest fire monitoring.
| physics.ins-det physics.app-ph | forest fires are a major source of particulate matter pm air pollution on a global scale the composition and impact of pm are typically studied using only laboratory instruments and extrapolated to real fire events owing to a lack of analytical techniques suitable for fieldsettings to address this and similar field test challenges we developed a mobilemicroscopy and machinelearningbased air quality monitoring platform called cair which can perform air sampling and microscopic analysis of aerosols in an integrated portable device we tested its performance for pm sizing and morphological analysis during a recent forest fire event in la tuna canyon park by spatially mapping the pm the result shows that with decreasing distance to the fire site the pm concentration increases dramatically especially for particles smaller than 2 microns image analysis from the cair portable device also shows that the increased pm is comparatively strongly absorbing and asymmetric with an aspect ratio of 0507 these pm features indicate that a major portion of the pm may be openflamecombustiongenerated element carbon soottype particles this initial smallscale experiment shows that cair has some potential for forest fire monitoring | [['forest', 'fires', 'are', 'a', 'major', 'source', 'of', 'particulate', 'matter', 'pm', 'air', 'pollution', 'on', 'a', 'global', 'scale', 'the', 'composition', 'and', 'impact', 'of', 'pm', 'are', 'typically', 'studied', 'using', 'only', 'laboratory', 'instruments', 'and', 'extrapolated', 'to', 'real', 'fire', 'events', 'owing', 'to', 'a', 'lack', 'of', 'analytical', 'techniques', 'suitable', 'for', 'fieldsettings', 'to', 'address', 'this', 'and', 'similar', 'field', 'test', 'challenges', 'we', 'developed', 'a', 'mobilemicroscopy', 'and', 'machinelearningbased', 'air', 'quality', 'monitoring', 'platform', 'called', 'cair', 'which', 'can', 'perform', 'air', 'sampling', 'and', 'microscopic', 'analysis', 'of', 'aerosols', 'in', 'an', 'integrated', 'portable', 'device', 'we', 'tested', 'its', 'performance', 'for', 'pm', 'sizing', 'and', 'morphological', 'analysis', 'during', 'a', 'recent', 'forest', 'fire', 'event', 'in', 'la', 'tuna', 'canyon', 'park', 'by', 'spatially', 'mapping', 'the', 'pm', 'the', 'result', 'shows', 'that', 'with', 'decreasing', 'distance', 'to', 'the', 'fire', 'site', 'the', 'pm', 'concentration', 'increases', 'dramatically', 'especially', 'for', 'particles', 'smaller', 'than', '2', 'microns', 'image', 'analysis', 'from', 'the', 'cair', 'portable', 'device', 'also', 'shows', 'that', 'the', 'increased', 'pm', 'is', 'comparatively', 'strongly', 'absorbing', 'and', 'asymmetric', 'with', 'an', 'aspect', 'ratio', 'of', '0507', 'these', 'pm', 'features', 'indicate', 'that', 'a', 'major', 'portion', 'of', 'the', 'pm', 'may', 'be', 'openflamecombustiongenerated', 'element', 'carbon', 'soottype', 'particles', 'this', 'initial', 'smallscale', 'experiment', 'shows', 'that', 'cair', 'has', 'some', 'potential', 'for', 'forest', 'fire', 'monitoring']] | [-0.08869029564660165, 0.11307623274614753, -0.08088050568143704, 0.02107389487139369, -0.013989736654816174, -0.13446887093468232, 0.04614420094946911, 0.3960485782852949, -0.19938885493224467, -0.36442886203895886, 0.13561531399846188, -0.3333302594274845, -0.09008957051856259, 0.2293519557320646, -0.07950020469929818, 0.03934167840250686, 0.08574161731387274, -0.0463997605640523, 0.012310033313582068, -0.17536327047887576, 0.20296287055608336, 0.12648562394059518, 0.30554241101272855, 0.06177569972862909, 0.0920035953756299, -0.029600395704199818, -0.06925224408169615, 0.013561739696312573, -0.10661574747943663, 0.06785511491298266, 0.23716862292085253, 0.10946587221134085, 0.2524792519321276, -0.4044560219601288, -0.22171080503472035, 0.10223222018352576, 0.14632024791969273, 0.032398790362704245, -0.08724030468595, -0.29903405222141155, 0.0998015751874146, -0.16709127663960935, -0.13024586726477047, 0.015757642138831237, 0.03693423502641004, 0.00342354027152696, -0.25893613371250807, 0.07481573002299698, -0.019108813424571672, 0.11537138230702552, -0.031027730038149057, -0.13919715271177854, -0.03996560531207821, 0.13162672459301386, 0.014360615879982955, 0.05166960002887728, 0.20000085593610592, -0.10337423909823973, -0.03202377473884313, 0.37661877111020076, -0.08694169576227688, -0.09184205921105836, 0.1967895129736472, -0.11652074478743188, -0.13689498493149185, 0.15700862178538036, 0.20189504364280256, 0.05877333078251967, -0.1586705491837155, -0.009303246705043181, 0.004337799279940325, 0.24060821820787348, 0.042736018319604, -0.04189300477238638, 0.2320341420127079, 0.20667282992380334, 0.0765690837454583, 0.09345654384578465, -0.1493144170166848, -0.0228559763105535, -0.2110031000485613, -0.14621161285705947, -0.13028913973587575, 0.04342970629811164, -0.11386598830546603, -0.14600811473856384, 0.36180259063225856, 0.18672180343687964, 0.17001085498646556, 0.012298243335872929, 0.302609834881438, 0.06308477478112084, 0.07693042993995843, 0.06220033306086047, 0.21859749855494745, 0.06644515639801374, 0.13048985208241412, -0.1974244938791054, 0.08175168243802286, -0.011384276389995089] |
1,802.02889 | Semilocal Pauli-Gaussian Kinetic Functionals for Orbital-Free Density
Functional Theory Calculations of Solids | Kinetic energy (KE) approximations are key elements in orbital-free density
functional theory. To date, the use of non-local functionals, possibly
employing system dependent parameters, has been considered mandatory in order
to obtain satisfactory accuracy for different solid-state systems, whereas
semilocal approximations are generally regarded as unfit to this aim. Here, we
show that instead properly constructed semilocal approximations, the
Pauli-Gaussian (PG) KE functionals, especially at the Laplacian-level of
theory, can indeed achieve similar accuracy as non-local functionals and can be
accurate for both metals and semiconductors, without the need of
system-dependent parameters.
| cond-mat.mtrl-sci | kinetic energy ke approximations are key elements in orbitalfree density functional theory to date the use of nonlocal functionals possibly employing system dependent parameters has been considered mandatory in order to obtain satisfactory accuracy for different solidstate systems whereas semilocal approximations are generally regarded as unfit to this aim here we show that instead properly constructed semilocal approximations the pauligaussian pg ke functionals especially at the laplacianlevel of theory can indeed achieve similar accuracy as nonlocal functionals and can be accurate for both metals and semiconductors without the need of systemdependent parameters | [['kinetic', 'energy', 'ke', 'approximations', 'are', 'key', 'elements', 'in', 'orbitalfree', 'density', 'functional', 'theory', 'to', 'date', 'the', 'use', 'of', 'nonlocal', 'functionals', 'possibly', 'employing', 'system', 'dependent', 'parameters', 'has', 'been', 'considered', 'mandatory', 'in', 'order', 'to', 'obtain', 'satisfactory', 'accuracy', 'for', 'different', 'solidstate', 'systems', 'whereas', 'semilocal', 'approximations', 'are', 'generally', 'regarded', 'as', 'unfit', 'to', 'this', 'aim', 'here', 'we', 'show', 'that', 'instead', 'properly', 'constructed', 'semilocal', 'approximations', 'the', 'pauligaussian', 'pg', 'ke', 'functionals', 'especially', 'at', 'the', 'laplacianlevel', 'of', 'theory', 'can', 'indeed', 'achieve', 'similar', 'accuracy', 'as', 'nonlocal', 'functionals', 'and', 'can', 'be', 'accurate', 'for', 'both', 'metals', 'and', 'semiconductors', 'without', 'the', 'need', 'of', 'systemdependent', 'parameters']] | [-0.06537764855138548, 0.05422602476204162, -0.09784095642249008, 0.16253936430311425, -0.0077414396449227586, -0.13659426885155532, 0.010884025929864127, 0.3838220593202245, -0.21968641647925743, -0.3331794242302959, 0.03598453849298204, -0.28050283193658615, -0.10954341207948196, 0.18223494703748397, -0.050119938200933266, 0.1106243232306052, 0.035277158881609254, 0.003408376012345428, -0.12795869006959537, -0.22572242309196064, 0.2521407771343877, 0.07753982786907927, 0.26559303497772785, 0.05042665273176281, 0.0451572875922116, -0.04064452002889344, 0.010407613319150367, 0.06853202944314414, -0.13237995937491248, 0.12913852172218018, 0.34042437335701436, -0.02691629322586008, 0.28757938926855287, -0.49136668140744116, -0.30187578020351274, 0.09449041968116864, 0.11599773842029677, 0.13556741081833185, 0.0025193072180007842, -0.19694964822310096, 0.11515163427095983, -0.19395544766294923, -0.12797948083831356, -0.20900749006810096, -0.015957221179013395, 0.09755094292583866, -0.2826333931841693, 0.13549845379388348, 0.009446550518847428, 0.0019754697491957264, -0.07018039934337139, -0.16865519141896043, -0.043887693951786544, 0.08272891285877859, 0.0027541603974916124, 0.03668840734574657, 0.09392761709270897, -0.08631384616031997, -0.0651695056112258, 0.3937010069142331, -0.08948569818768282, -0.22315432868161045, 0.2194126415831436, -0.06317574303638149, -0.13514478348072742, 0.1059330534241111, 0.12574981755044842, 0.1294549493589899, -0.19265461806207895, 0.14172946502950942, 0.05517312943561842, 0.16924160469200586, 0.028649426822724578, 0.10401354919975767, 0.1527654946587243, 0.12746685741285047, 0.06578878659222807, -0.005252840633217532, -0.01757717136662085, -0.10543616850358936, -0.282270487750993, -0.11802372242343884, -0.19548525439145473, 0.045862891260984834, -0.06597446933853092, -0.19206255936360622, 0.3323489403797334, 0.16698318679950067, 0.10103805885128267, 0.00801474428198372, 0.254067417582149, 0.1667519623777, 0.06630568608007097, 0.04770488317564621, 0.24498482260873522, 0.13861580646678723, 0.04025574363154042, -0.17834484067318224, 0.08728662935331218, 0.10339834896468936] |
1,802.0289 | Adinkras From Ordered Quartets of BC4 Coxeter Group Elements and
Regarding Another Gadget's 1,358,954,496 Matrix Elements | A Gadget, more precisely a scalar Gadget, is defined as a mathematical
calculation acting over a domain of one or more adinkra graphs and whose range
is a real number. A 2010 work on the subject of automorphisms of adinkra
graphs, implied the existence of multiple numbers of Gadgets depending on the
number of colors under consideration. For four colors, this number is two. In
this work, we verify the existence of a second such Gadget and calculate (both
analytically and via explicit computer-enabled algorithms) its 1,358,954,496
matrix elements over 36,864 minimal valise adinkras related to the Coxeter
Group BC4.
| hep-th math-ph math.MP | a gadget more precisely a scalar gadget is defined as a mathematical calculation acting over a domain of one or more adinkra graphs and whose range is a real number a 2010 work on the subject of automorphisms of adinkra graphs implied the existence of multiple numbers of gadgets depending on the number of colors under consideration for four colors this number is two in this work we verify the existence of a second such gadget and calculate both analytically and via explicit computerenabled algorithms its 1358954496 matrix elements over 36864 minimal valise adinkras related to the coxeter group bc4 | [['a', 'gadget', 'more', 'precisely', 'a', 'scalar', 'gadget', 'is', 'defined', 'as', 'a', 'mathematical', 'calculation', 'acting', 'over', 'a', 'domain', 'of', 'one', 'or', 'more', 'adinkra', 'graphs', 'and', 'whose', 'range', 'is', 'a', 'real', 'number', 'a', '2010', 'work', 'on', 'the', 'subject', 'of', 'automorphisms', 'of', 'adinkra', 'graphs', 'implied', 'the', 'existence', 'of', 'multiple', 'numbers', 'of', 'gadgets', 'depending', 'on', 'the', 'number', 'of', 'colors', 'under', 'consideration', 'for', 'four', 'colors', 'this', 'number', 'is', 'two', 'in', 'this', 'work', 'we', 'verify', 'the', 'existence', 'of', 'a', 'second', 'such', 'gadget', 'and', 'calculate', 'both', 'analytically', 'and', 'via', 'explicit', 'computerenabled', 'algorithms', 'its', '1358954496', 'matrix', 'elements', 'over', '36864', 'minimal', 'valise', 'adinkras', 'related', 'to', 'the', 'coxeter', 'group', 'bc4']] | [-0.1701952091926633, 0.1122455856553754, -0.06774466297095072, 0.025321891822386533, -0.10696350857710504, -0.10169786823039152, 0.041008332978259315, 0.3277700777232115, -0.22316841057938885, -0.34460069170715857, 0.11296382080644787, -0.24280022309079757, -0.14733812751186706, 0.20461419837463798, -0.06904452558777922, 0.0128060867243722, 0.04615297034021695, 0.08254918673227789, -0.05965807698001819, -0.28736669788783303, 0.35248032133617646, -0.03950838792631973, 0.17435370594956817, 0.03786806406973557, 0.07815750254964342, 0.0353616540918925, -0.057236424559366186, 0.04728490110410719, -0.12036232719654028, 0.11848776936008386, 0.1936317382817518, 0.12051164028139746, 0.24488333296220827, -0.38884475009458863, -0.16973473631529784, 0.1765032732117997, 0.10641049530965332, 0.08440486669816001, -0.019969440260438762, -0.2104731689834473, 0.10171553686650812, -0.21080967477921927, -0.10159168132386, -0.0234924011355342, 0.05318226633422381, 0.0018632199629495035, -0.2614899550811673, -0.03119907084358286, 0.04129120500102563, 0.08951812145319216, 0.014845814492924101, -0.10093619834099497, -0.04475606677398009, 0.1306113122644055, -0.01654738281029829, -0.0058807399413757485, 0.0730406500408616, -0.12172633898444474, -0.14623899519448263, 0.39804490617647464, -0.006864917502567476, -0.23431885255766766, 0.18980362527642627, -0.08483874416739053, -0.14581400844059428, 0.11127818998529063, 0.16703454783300356, 0.1811579743457236, -0.09175346304225374, 0.10921325639890488, -0.1282485391070344, 0.12787678489005383, 0.10447070155558842, 0.02681931412816808, 0.13152208751274216, 0.10368561837822199, 0.0725813589239379, 0.15592653001658618, 0.017443685968197425, -0.06676133890393932, -0.3187408174099448, -0.16138461662684472, -0.1921644470777971, 0.07010847956360299, -0.13189857486324807, -0.20056338161610218, 0.4493465171556692, 0.10399918491971127, 0.18994639914634884, 0.10958055924738244, 0.2566591620882403, 0.04974859049044816, 0.07037609007342585, 0.07524030560114402, 0.11549967148445775, 0.19918690870482741, 0.005521272914959308, -0.19033922454400454, 0.010858446792034166, 0.1392090159696432] |
1,802.02891 | On blowup solutions to the focusing $L^2$-supercritical nonlinear
fractional Schr\"odinger equation | We study dynamical properties of blowup solutions to the focusing
$L^2$-supercritical nonlinear fractional Schr\"odinger equation \[ i\partial_t
u -(-\Delta)^s u = -|u|^\alpha u, \quad u(0) = u_0, \quad \text{on } [0,\infty)
\times \mathbb{R}^d, \] where $d \geq 2, \frac{d}{2d-1} \leq s <1$,
$\frac{4s}{d}<\alpha<\frac{4s}{d-2s}$ and $u_0 \in \dot{H}^{s_{\text{c}}} \cap
\dot{H}^s$ is radial with the critical Sobolev exponent $s_{\text{c}}$. To this
end, we establish a compactness lemma related to the equation by means of the
profile decomposition for bounded sequences in $\dot{H}^{s_{\text{c}}} \cap
\dot{H}^s$. As a result, we obtain the $\dot{H}^{s_{\text{c}}}$-concentration
of blowup solutions with bounded $\dot{H}^{s_{\text{c}}}$-norm and the limiting
profile of blowup solutions with critical $\dot{H}^{s_{\text{c}}}$-norm.
| math.AP | we study dynamical properties of blowup solutions to the focusing l2supercritical nonlinear fractional schrodinger equation ipartial_t u deltas u ualpha u quad u0 u_0 quad texton 0infty times mathbbrd where d geq 2 fracd2d1 leq s 1 frac4sdalphafrac4sd2s and u_0 in doths_textc cap doths is radial with the critical sobolev exponent s_textc to this end we establish a compactness lemma related to the equation by means of the profile decomposition for bounded sequences in doths_textc cap doths as a result we obtain the doths_textcconcentration of blowup solutions with bounded doths_textcnorm and the limiting profile of blowup solutions with critical doths_textcnorm | [['we', 'study', 'dynamical', 'properties', 'of', 'blowup', 'solutions', 'to', 'the', 'focusing', 'l2supercritical', 'nonlinear', 'fractional', 'schrodinger', 'equation', 'ipartial_t', 'u', 'deltas', 'u', 'ualpha', 'u', 'quad', 'u0', 'u_0', 'quad', 'texton', '0infty', 'times', 'mathbbrd', 'where', 'd', 'geq', '2', 'fracd2d1', 'leq', 's', '1', 'frac4sdalphafrac4sd2s', 'and', 'u_0', 'in', 'doths_textc', 'cap', 'doths', 'is', 'radial', 'with', 'the', 'critical', 'sobolev', 'exponent', 's_textc', 'to', 'this', 'end', 'we', 'establish', 'a', 'compactness', 'lemma', 'related', 'to', 'the', 'equation', 'by', 'means', 'of', 'the', 'profile', 'decomposition', 'for', 'bounded', 'sequences', 'in', 'doths_textc', 'cap', 'doths', 'as', 'a', 'result', 'we', 'obtain', 'the', 'doths_textcconcentration', 'of', 'blowup', 'solutions', 'with', 'bounded', 'doths_textcnorm', 'and', 'the', 'limiting', 'profile', 'of', 'blowup', 'solutions', 'with', 'critical', 'doths_textcnorm']] | [-0.177281579582624, 0.022773863327118657, 0.00816364838711677, 0.01458107464025498, -0.0784872182017763, -0.1969717620353725, -0.03620196842858868, 0.26437065465956605, -0.34489549398021674, -0.1329452516210656, 0.17687408627331336, -0.42818548250693067, -0.04661958344200606, 0.1418939412982073, -0.03717363105526054, 0.11073697356366984, -0.01287630294519727, 0.0063540876933163215, -0.07698636273953623, -0.18686675823103355, 0.3741173818457111, -0.21637151076868977, 0.15646675727780787, 0.06781430614571418, 0.09236751176837471, -0.047794286467094896, 0.08481589146959846, -0.07887798498675067, -0.3894330276156305, 0.010719627712763125, 0.19036382507352578, 0.0648189220647578, 0.3248837301307308, -0.37497508287509923, -0.191818996900267, 0.2121267112182273, 0.21510186510521076, -0.02676252463972697, 0.006449238717636113, -0.3565307524986565, 0.1419003349979238, -0.03743961058877489, -0.25715957777774945, -0.013445866444418508, 0.16449993908385274, 0.1549440131150937, -0.39302467975404953, 0.1892779238762394, 0.11986751755497979, -0.0038357955223369982, -0.1590651069036735, -0.15969861699869076, -0.05770172588076563, 0.00012563536524452188, 0.023505982770133885, 0.194954201967145, -0.02083578073389588, -0.13572983603714214, 0.02405255849182766, 0.34448512835848716, -0.12147514109865272, -0.25568645167094406, 0.05639306409785184, -0.23710421250472147, -0.11671457232366647, 0.05022330238779266, 0.11083019309006231, 0.17732430313543607, -0.0636413246493346, 0.2483376956191815, -0.02943372812062021, 0.19488199906403658, 0.17352584221710762, -0.011514781613744075, -0.03443492739711718, 0.13574341940443202, 0.2048911188719093, 0.07067923407791363, -0.04231735272333026, -0.007911323254267055, -0.3766542225475273, -0.08738648895454663, -0.12322727681928745, 0.22090922112786962, -0.15015541514605835, -0.16172667768012772, 0.3047130806571854, 0.07311282715489788, 0.20257461161142395, 0.07574212391890826, 0.13783360332230565, 0.21071314294972726, -0.09066813046948843, 0.12120824409849061, 0.0636407653976392, 0.1281823012001452, 0.20465757806975676, -0.23969395927864537, -0.05170517664913449, 0.18694813460485898] |
1,802.02892 | Efficient Large-Scale Multi-Modal Classification | While the incipient internet was largely text-based, the modern digital world
is becoming increasingly multi-modal. Here, we examine multi-modal
classification where one modality is discrete, e.g. text, and the other is
continuous, e.g. visual representations transferred from a convolutional neural
network. In particular, we focus on scenarios where we have to be able to
classify large quantities of data quickly. We investigate various methods for
performing multi-modal fusion and analyze their trade-offs in terms of
classification accuracy and computational efficiency. Our findings indicate
that the inclusion of continuous information improves performance over
text-only on a range of multi-modal classification tasks, even with simple
fusion methods. In addition, we experiment with discretizing the continuous
features in order to speed up and simplify the fusion process even further. Our
results show that fusion with discretized features outperforms text-only
classification, at a fraction of the computational cost of full multi-modal
fusion, with the additional benefit of improved interpretability.
| cs.CL cs.AI cs.CV | while the incipient internet was largely textbased the modern digital world is becoming increasingly multimodal here we examine multimodal classification where one modality is discrete eg text and the other is continuous eg visual representations transferred from a convolutional neural network in particular we focus on scenarios where we have to be able to classify large quantities of data quickly we investigate various methods for performing multimodal fusion and analyze their tradeoffs in terms of classification accuracy and computational efficiency our findings indicate that the inclusion of continuous information improves performance over textonly on a range of multimodal classification tasks even with simple fusion methods in addition we experiment with discretizing the continuous features in order to speed up and simplify the fusion process even further our results show that fusion with discretized features outperforms textonly classification at a fraction of the computational cost of full multimodal fusion with the additional benefit of improved interpretability | [['while', 'the', 'incipient', 'internet', 'was', 'largely', 'textbased', 'the', 'modern', 'digital', 'world', 'is', 'becoming', 'increasingly', 'multimodal', 'here', 'we', 'examine', 'multimodal', 'classification', 'where', 'one', 'modality', 'is', 'discrete', 'eg', 'text', 'and', 'the', 'other', 'is', 'continuous', 'eg', 'visual', 'representations', 'transferred', 'from', 'a', 'convolutional', 'neural', 'network', 'in', 'particular', 'we', 'focus', 'on', 'scenarios', 'where', 'we', 'have', 'to', 'be', 'able', 'to', 'classify', 'large', 'quantities', 'of', 'data', 'quickly', 'we', 'investigate', 'various', 'methods', 'for', 'performing', 'multimodal', 'fusion', 'and', 'analyze', 'their', 'tradeoffs', 'in', 'terms', 'of', 'classification', 'accuracy', 'and', 'computational', 'efficiency', 'our', 'findings', 'indicate', 'that', 'the', 'inclusion', 'of', 'continuous', 'information', 'improves', 'performance', 'over', 'textonly', 'on', 'a', 'range', 'of', 'multimodal', 'classification', 'tasks', 'even', 'with', 'simple', 'fusion', 'methods', 'in', 'addition', 'we', 'experiment', 'with', 'discretizing', 'the', 'continuous', 'features', 'in', 'order', 'to', 'speed', 'up', 'and', 'simplify', 'the', 'fusion', 'process', 'even', 'further', 'our', 'results', 'show', 'that', 'fusion', 'with', 'discretized', 'features', 'outperforms', 'textonly', 'classification', 'at', 'a', 'fraction', 'of', 'the', 'computational', 'cost', 'of', 'full', 'multimodal', 'fusion', 'with', 'the', 'additional', 'benefit', 'of', 'improved', 'interpretability']] | [-0.018476679164075083, 0.030470521784117147, -0.053385452628736535, 0.04022831325687988, -0.08468014660982355, -0.12874610308978346, 0.03484449488140883, 0.45796891644356713, -0.29228283273236405, -0.29518733073266284, 0.10591713999428096, -0.2805226807031901, -0.1584957290095307, 0.22513432577552814, -0.1322677324526012, 0.06937968998907074, 0.15484013361180382, 0.09064337247081342, -0.07721378522542034, -0.30847902855434034, 0.31254067859957896, 0.0212116657485885, 0.3510752445657647, 0.061079459715514414, 0.11356184279767706, 0.006090015429072082, -0.08389649796600063, -0.006278295389136239, -0.04640944407278327, 0.18995577199084143, 0.32784619679253907, 0.16939068574518445, 0.29555553671783735, -0.3930084090379457, -0.2507340510526011, 0.10222632265199096, 0.1551616314548864, 0.10144333051998289, -0.034711166226395196, -0.32771070299129335, 0.12018589208563489, -0.20671259719998605, 0.00806285242640203, -0.15960284118660756, -0.020977509971107207, 0.017986422717090576, -0.2906794215552509, 0.055817710989785774, 0.07136400523445298, 0.0820175035165683, -0.05865977296846048, -0.10288095863145445, 0.0014601913814042365, 0.16964690337077745, 0.013920054853435665, 0.03696956597794328, 0.13992602919198333, -0.22831786650743696, -0.14940576933835062, 0.371970729589943, -0.040122160245664416, -0.21291919228050016, 0.26139842931241275, -0.07639752384575625, -0.16270382698144645, 0.10526662809143383, 0.23489847292582836, 0.08352990391393823, -0.11294556852550276, 0.03616421271506096, -0.00123251469865922, 0.18700126938206413, 0.04664964318996476, 0.033229514061202926, 0.14028630684779567, 0.28304172666713356, 0.010075622744437667, 0.1262300221801495, -0.12011293822283586, -0.09431383942344015, -0.20448842009589557, -0.13004958708319933, -0.1509266952848843, -0.03984033079186995, -0.09417206007919665, -0.10241257326617356, 0.3937198158714079, 0.2272136966757957, 0.22594533691993884, 0.10207072754480666, 0.34226630378154016, 0.05492766254258553, 0.09043828180931028, 0.06581025484709009, 0.18003237507636508, 0.01259833390433942, 0.12379508302997677, -0.1768357903080722, 0.04910935734008109, 0.022471570253612533] |
1,802.02893 | Weak and strong connectivity regimes for a general time elapsed neuron
network model | For large fully connected neuron networks, we study the dynamics of
homogenous assemblies of interacting neurons described by time elapsed models.
Under general assumptions on the firing rate which include the ones made in
previous works [7, 8, 6], we establish accurate estimate on the long time
behavior of the solutions in the weak and the strong connectivity regime both
in the case with and without delay. Our results improve [7, 8] where a less
accurate estimate was established and [6] where only smooth firing rates were
considered. Our approach combines several arguments introduced in the above
previous works as well as a slightly refined version of the Weyl's and spectral
mapping theorems presented in [13, 4].
| math.AP | for large fully connected neuron networks we study the dynamics of homogenous assemblies of interacting neurons described by time elapsed models under general assumptions on the firing rate which include the ones made in previous works 7 8 6 we establish accurate estimate on the long time behavior of the solutions in the weak and the strong connectivity regime both in the case with and without delay our results improve 7 8 where a less accurate estimate was established and 6 where only smooth firing rates were considered our approach combines several arguments introduced in the above previous works as well as a slightly refined version of the weyls and spectral mapping theorems presented in 13 4 | [['for', 'large', 'fully', 'connected', 'neuron', 'networks', 'we', 'study', 'the', 'dynamics', 'of', 'homogenous', 'assemblies', 'of', 'interacting', 'neurons', 'described', 'by', 'time', 'elapsed', 'models', 'under', 'general', 'assumptions', 'on', 'the', 'firing', 'rate', 'which', 'include', 'the', 'ones', 'made', 'in', 'previous', 'works', '7', '8', '6', 'we', 'establish', 'accurate', 'estimate', 'on', 'the', 'long', 'time', 'behavior', 'of', 'the', 'solutions', 'in', 'the', 'weak', 'and', 'the', 'strong', 'connectivity', 'regime', 'both', 'in', 'the', 'case', 'with', 'and', 'without', 'delay', 'our', 'results', 'improve', '7', '8', 'where', 'a', 'less', 'accurate', 'estimate', 'was', 'established', 'and', '6', 'where', 'only', 'smooth', 'firing', 'rates', 'were', 'considered', 'our', 'approach', 'combines', 'several', 'arguments', 'introduced', 'in', 'the', 'above', 'previous', 'works', 'as', 'well', 'as', 'a', 'slightly', 'refined', 'version', 'of', 'the', 'weyls', 'and', 'spectral', 'mapping', 'theorems', 'presented', 'in', '13', '4']] | [-0.09940964391884896, 0.07663709022757462, -0.011726022546744755, 0.08991928907254568, 0.010279157819847265, -0.1559295235440517, 0.052478355498841174, 0.35553127229532117, -0.19006364293491992, -0.3374452740829597, 0.13954561150286537, -0.24110811951960254, -0.15299629922418928, 0.21312697214456514, -0.0638093433669235, 0.05747943013731358, 0.05143014736807881, 0.05334378876842749, -0.03963983043407401, -0.29432121832242125, 0.26284446677145284, 0.04348716410832145, 0.2709341485473192, 0.03301135632637331, 0.07972240803015028, 0.03012722524472027, -0.0758171454231199, 0.005989144785074979, -0.15303897481853476, 0.09126819339461434, 0.20139838662934434, 0.06522584071832621, 0.2598514886588877, -0.4705452559690954, -0.2511522750266724, 0.07099560484226443, 0.11698842364657894, 0.10967214870277561, -0.013750932961463546, -0.2729220127161497, 0.10279480857440294, -0.1484527708007357, -0.1289271275496954, -0.038313024860416725, 0.010908642345959814, 0.08521108195169741, -0.2553094840632417, 0.10054681520873252, 0.10432609850560658, 0.053602096210751266, -0.08635855575726949, -0.0931545222729333, 0.025945827502231948, 0.13331671572951043, 0.014007540945059214, 0.048526535652434595, 0.08865395278677854, -0.1239847408957843, -0.10948160393402362, 0.2943172153427751, -0.0927422690905758, -0.18318191076764184, 0.23935819000133082, -0.13889020422282508, -0.1580154529900059, 0.12967001165673295, 0.13467790435454371, 0.13491800887924102, -0.14557700543704197, 0.04619562208587075, -0.012168585537717892, 0.19176733024959636, 0.07618188046109982, 0.00491664380991322, 0.07828564084837468, 0.19002777689860928, 0.04369021240924286, 0.10487384719447766, -0.07690411050302479, -0.10452625215149079, -0.28637060542137194, -0.06576642554236425, -0.16427981048527882, 0.05640388245129178, -0.10521028629000673, -0.08372701280929434, 0.4075487627663737, 0.10232999316679361, 0.242469732884445, 0.13143226840338296, 0.24374325268774524, 0.0922734122723341, 0.060140021527424835, 0.08280758862582664, 0.2667410584787528, 0.15053156086315328, 0.14204232103756478, -0.14227782777693665, 0.05493805219586461, 0.0651134555387255] |
1,802.02894 | The dynamic framework of decision-making | This work explores dynamics existing in interactions between players. The
dynamic system of games is a new attitude to modeling in which an event is
modeled using several games. The model allows us to analyze the interplay
capabilities and the feasibility objectives of each player after a conflict
with other players objectives and capabilities. As an application, we model
relations between the Soviet Union and America after World War II to October
1962, by using the dynamic system of games. The dynamic system of games as an
important insight clearly has significant implications for modeling strategic
interactions in which player pursue goals for increasing their personal
interests. In addition, we introduce a new game in which there is a dilemma
which this dilemma occurs in most societies. We investigate depends on the
claim that each player in this dilemma is hyper-rational. In the concept of
hyper-rational, the player thinks about profit or loss of other actors in
addition to his personal profit or loss and then will choose an action which is
desirable to him. In this dilemma, a weak trust has been created between
players, but it is fragile.
| physics.soc-ph cs.GT | this work explores dynamics existing in interactions between players the dynamic system of games is a new attitude to modeling in which an event is modeled using several games the model allows us to analyze the interplay capabilities and the feasibility objectives of each player after a conflict with other players objectives and capabilities as an application we model relations between the soviet union and america after world war ii to october 1962 by using the dynamic system of games the dynamic system of games as an important insight clearly has significant implications for modeling strategic interactions in which player pursue goals for increasing their personal interests in addition we introduce a new game in which there is a dilemma which this dilemma occurs in most societies we investigate depends on the claim that each player in this dilemma is hyperrational in the concept of hyperrational the player thinks about profit or loss of other actors in addition to his personal profit or loss and then will choose an action which is desirable to him in this dilemma a weak trust has been created between players but it is fragile | [['this', 'work', 'explores', 'dynamics', 'existing', 'in', 'interactions', 'between', 'players', 'the', 'dynamic', 'system', 'of', 'games', 'is', 'a', 'new', 'attitude', 'to', 'modeling', 'in', 'which', 'an', 'event', 'is', 'modeled', 'using', 'several', 'games', 'the', 'model', 'allows', 'us', 'to', 'analyze', 'the', 'interplay', 'capabilities', 'and', 'the', 'feasibility', 'objectives', 'of', 'each', 'player', 'after', 'a', 'conflict', 'with', 'other', 'players', 'objectives', 'and', 'capabilities', 'as', 'an', 'application', 'we', 'model', 'relations', 'between', 'the', 'soviet', 'union', 'and', 'america', 'after', 'world', 'war', 'ii', 'to', 'october', '1962', 'by', 'using', 'the', 'dynamic', 'system', 'of', 'games', 'the', 'dynamic', 'system', 'of', 'games', 'as', 'an', 'important', 'insight', 'clearly', 'has', 'significant', 'implications', 'for', 'modeling', 'strategic', 'interactions', 'in', 'which', 'player', 'pursue', 'goals', 'for', 'increasing', 'their', 'personal', 'interests', 'in', 'addition', 'we', 'introduce', 'a', 'new', 'game', 'in', 'which', 'there', 'is', 'a', 'dilemma', 'which', 'this', 'dilemma', 'occurs', 'in', 'most', 'societies', 'we', 'investigate', 'depends', 'on', 'the', 'claim', 'that', 'each', 'player', 'in', 'this', 'dilemma', 'is', 'hyperrational', 'in', 'the', 'concept', 'of', 'hyperrational', 'the', 'player', 'thinks', 'about', 'profit', 'or', 'loss', 'of', 'other', 'actors', 'in', 'addition', 'to', 'his', 'personal', 'profit', 'or', 'loss', 'and', 'then', 'will', 'choose', 'an', 'action', 'which', 'is', 'desirable', 'to', 'him', 'in', 'this', 'dilemma', 'a', 'weak', 'trust', 'has', 'been', 'created', 'between', 'players', 'but', 'it', 'is', 'fragile']] | [-0.0948923309309114, 0.04767114504969581, -0.12988376102569563, 0.08318526092120201, -0.0924364557097617, -0.19089870050696559, 0.0910133858082669, 0.39856629789267717, -0.2741849486035981, -0.3266419370609679, 0.07228732471427832, -0.30609106376505224, -0.1917199160241963, 0.07532239985027302, -0.1779331994684119, -0.031858168935133636, 0.0677263454383999, 0.04341498804401214, 0.05206604172402111, -0.2805991310859099, 0.3359226949316891, 0.05755896268069352, 0.2287451122568822, 0.07179409063353791, 0.1153540921593575, 0.04091329882105224, 0.005996517531916891, 0.05404822742076296, -0.09958096070994016, 0.10632752920746019, 0.27904201679078766, 0.21766264410321845, 0.4439371030777693, -0.42774822021785536, -0.1444064529245033, 0.12921819088392353, 0.10105237822342468, 0.0794135743088861, -0.014857913551876616, -0.3074560975165744, 0.009953771654124323, -0.2295090019997013, -0.08688597654997322, -0.02265259982638159, 0.03929633471967751, 0.003725281284239731, -0.26306353906341096, -0.04689717107011299, 0.043740237170928405, 0.08944540136458512, -0.040307117114149915, -0.08498364633108538, 0.01555066595442201, 0.23272593062689625, 0.06528409371078994, -0.013210632024626983, 0.10419113136043674, -0.18415684600262658, -0.2169349855767857, 0.4228241691491444, -0.022805904882567885, -0.12913685386730847, 0.1847379489434197, -0.10339022921153197, -0.13176775896541873, 0.05069806006810579, 0.18982736855549248, 0.10276990369403441, -0.16046332835562918, 0.03231854594043015, -0.06423795192355389, 0.19991576765467853, 0.04827678701840341, 0.021583840301211334, 0.2029390925835622, 0.2197033000815856, 0.12843978295936004, 0.10189150561100656, 0.004687843420584901, -0.1909043909491677, -0.22560940033413077, -0.153288572590406, -0.12139226388382285, 0.006611560554684777, -0.041913530225314105, -0.0892051069997251, 0.37064455484628284, 0.17660326256269687, 0.12577571321867015, 0.011260863758721634, 0.29574524063715024, 0.04674994708651579, 0.04706345902829382, 0.04164613708853722, 0.2399887663851443, 0.030842649467338466, 0.17452368103212823, -0.18853493548660097, 0.1478851760345462, 0.0196808555610723] |
1,802.02895 | Adaptive Coded Caching for Fair Delivery over Fading Channels | The performance of existing coded caching schemes is sensitive to the worst
channel quality, a problem which is exacerbated when communicating over fading
channels. In this paper, we address this limitation in the following manner: in
short-term, we allow transmissions to subsets of users with good channel
quality, avoiding users with fades, while in long-term we ensure fairness among
users. Our online scheme combines (i) the classical decentralized coded caching
scheme \cite{maddah2013decentralized} with (ii) joint scheduling and power
control for the fading broadcast channel, as well as (iii) congestion control
for ensuring the optimal long-term average performance. We prove that our
online delivery scheme maximizes the alpha-fair utility among all schemes
restricted to decentralized placement. By tuning the value of alpha, the
proposed scheme can achieve different operating points on the average delivery
rate region and tune performance according to an operator's choice.
We demonstrate via simulations that our scheme outperforms two baseline
schemes: (a) standard coded caching with multicast transmission, limited by the
worst channel user yet exploiting the global caching gain; (b) opportunistic
scheduling with unicast transmissions exploiting the fading diversity but
limited to local caching gain.
| cs.IT cs.NI math.IT | the performance of existing coded caching schemes is sensitive to the worst channel quality a problem which is exacerbated when communicating over fading channels in this paper we address this limitation in the following manner in shortterm we allow transmissions to subsets of users with good channel quality avoiding users with fades while in longterm we ensure fairness among users our online scheme combines i the classical decentralized coded caching scheme citemaddah2013decentralized with ii joint scheduling and power control for the fading broadcast channel as well as iii congestion control for ensuring the optimal longterm average performance we prove that our online delivery scheme maximizes the alphafair utility among all schemes restricted to decentralized placement by tuning the value of alpha the proposed scheme can achieve different operating points on the average delivery rate region and tune performance according to an operators choice we demonstrate via simulations that our scheme outperforms two baseline schemes a standard coded caching with multicast transmission limited by the worst channel user yet exploiting the global caching gain b opportunistic scheduling with unicast transmissions exploiting the fading diversity but limited to local caching gain | [['the', 'performance', 'of', 'existing', 'coded', 'caching', 'schemes', 'is', 'sensitive', 'to', 'the', 'worst', 'channel', 'quality', 'a', 'problem', 'which', 'is', 'exacerbated', 'when', 'communicating', 'over', 'fading', 'channels', 'in', 'this', 'paper', 'we', 'address', 'this', 'limitation', 'in', 'the', 'following', 'manner', 'in', 'shortterm', 'we', 'allow', 'transmissions', 'to', 'subsets', 'of', 'users', 'with', 'good', 'channel', 'quality', 'avoiding', 'users', 'with', 'fades', 'while', 'in', 'longterm', 'we', 'ensure', 'fairness', 'among', 'users', 'our', 'online', 'scheme', 'combines', 'i', 'the', 'classical', 'decentralized', 'coded', 'caching', 'scheme', 'citemaddah2013decentralized', 'with', 'ii', 'joint', 'scheduling', 'and', 'power', 'control', 'for', 'the', 'fading', 'broadcast', 'channel', 'as', 'well', 'as', 'iii', 'congestion', 'control', 'for', 'ensuring', 'the', 'optimal', 'longterm', 'average', 'performance', 'we', 'prove', 'that', 'our', 'online', 'delivery', 'scheme', 'maximizes', 'the', 'alphafair', 'utility', 'among', 'all', 'schemes', 'restricted', 'to', 'decentralized', 'placement', 'by', 'tuning', 'the', 'value', 'of', 'alpha', 'the', 'proposed', 'scheme', 'can', 'achieve', 'different', 'operating', 'points', 'on', 'the', 'average', 'delivery', 'rate', 'region', 'and', 'tune', 'performance', 'according', 'to', 'an', 'operators', 'choice', 'we', 'demonstrate', 'via', 'simulations', 'that', 'our', 'scheme', 'outperforms', 'two', 'baseline', 'schemes', 'a', 'standard', 'coded', 'caching', 'with', 'multicast', 'transmission', 'limited', 'by', 'the', 'worst', 'channel', 'user', 'yet', 'exploiting', 'the', 'global', 'caching', 'gain', 'b', 'opportunistic', 'scheduling', 'with', 'unicast', 'transmissions', 'exploiting', 'the', 'fading', 'diversity', 'but', 'limited', 'to', 'local', 'caching', 'gain']] | [-0.2480049939154885, -0.031988006062168464, -0.02014282077273473, -0.0052773689162580574, -0.08168514460161765, -0.2780045519156897, 0.20283362188096593, 0.4724380703880749, -0.2950013669286954, -0.2765356177226343, 0.06984293213958773, -0.2229162837784896, -0.1421498340440597, 0.11682448856299743, -0.19607193941052908, 0.08904634357152626, 0.04486487638031905, -0.004357139932913112, -0.018969709719927546, -0.3685837823029439, 0.2761226113504195, 0.14123546329643974, 0.4076828299724358, 0.02525890680981126, 0.07497946182860339, 0.06508695354754541, -0.06112490056167441, -0.020318127020878006, -0.0908891090921509, 0.06922103805737471, 0.34801753333948077, 0.2122625832488027, 0.3007252973682703, -0.3657417619016339, -0.2559208468226914, 0.09306511988595842, 0.1884974491673502, 0.03850202372376906, -0.043933829424551075, -0.26084371808757806, 0.16238580603756883, -0.25175414050488354, 0.02621983266138333, 0.0014500082718168802, -0.10326564360281175, 0.08162025589108259, -0.39773870608769357, -0.0046772343909090505, -0.044808629077259805, 0.006555619406850731, -0.05424380512596009, -0.08983009939696243, 0.05816155233038986, 0.1872438830275527, 0.045798784162740205, -0.04242056462557075, 0.10120309748379712, -0.09324857739711855, -0.15123942482998556, 0.3857808282222361, -0.006375271840605568, -0.21124444281350466, 0.1179072878365603, -0.041912594213190074, -0.06890941746198533, 0.17142339781461718, 0.23688607357759425, 0.07552792083229275, -0.16253378977319485, -0.00020937884952179454, -0.04010056334911806, 0.19989813724532723, 0.10133690841278022, 0.1758921544211223, 0.09466287035010805, 0.22801938821794465, 0.19356752251042053, 0.11168530395630985, -0.07206016277276386, -0.15578316622710925, -0.19834934266412907, -0.10377234021855637, -0.16150775762891614, -0.008835741135470093, -0.1316234216592807, -0.037280426690097346, 0.36850436124174674, 0.1578942805258037, 0.11496019056760409, 0.15092003830285008, 0.4341332851116486, 0.07859374576141721, 0.045379312631260466, 0.2164772432049776, 0.16451986738730798, 0.02018224594847081, 0.17100181899250527, -0.26133455856766075, 0.1249455382398508, -0.010229788420900226] |
1,802.02896 | Learning Role-based Graph Embeddings | Random walks are at the heart of many existing network embedding methods.
However, such algorithms have many limitations that arise from the use of
random walks, e.g., the features resulting from these methods are unable to
transfer to new nodes and graphs as they are tied to vertex identity. In this
work, we introduce the Role2Vec framework which uses the flexible notion of
attributed random walks, and serves as a basis for generalizing existing
methods such as DeepWalk, node2vec, and many others that leverage random walks.
Our proposed framework enables these methods to be more widely applicable for
both transductive and inductive learning as well as for use on graphs with
attributes (if available). This is achieved by learning functions that
generalize to new nodes and graphs. We show that our proposed framework is
effective with an average AUC improvement of 16.55% while requiring on average
853x less space than existing methods on a variety of graphs.
| stat.ML cs.AI cs.SI stat.AP | random walks are at the heart of many existing network embedding methods however such algorithms have many limitations that arise from the use of random walks eg the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to vertex identity in this work we introduce the role2vec framework which uses the flexible notion of attributed random walks and serves as a basis for generalizing existing methods such as deepwalk node2vec and many others that leverage random walks our proposed framework enables these methods to be more widely applicable for both transductive and inductive learning as well as for use on graphs with attributes if available this is achieved by learning functions that generalize to new nodes and graphs we show that our proposed framework is effective with an average auc improvement of 1655 while requiring on average 853x less space than existing methods on a variety of graphs | [['random', 'walks', 'are', 'at', 'the', 'heart', 'of', 'many', 'existing', 'network', 'embedding', 'methods', 'however', 'such', 'algorithms', 'have', 'many', 'limitations', 'that', 'arise', 'from', 'the', 'use', 'of', 'random', 'walks', 'eg', 'the', 'features', 'resulting', 'from', 'these', 'methods', 'are', 'unable', 'to', 'transfer', 'to', 'new', 'nodes', 'and', 'graphs', 'as', 'they', 'are', 'tied', 'to', 'vertex', 'identity', 'in', 'this', 'work', 'we', 'introduce', 'the', 'role2vec', 'framework', 'which', 'uses', 'the', 'flexible', 'notion', 'of', 'attributed', 'random', 'walks', 'and', 'serves', 'as', 'a', 'basis', 'for', 'generalizing', 'existing', 'methods', 'such', 'as', 'deepwalk', 'node2vec', 'and', 'many', 'others', 'that', 'leverage', 'random', 'walks', 'our', 'proposed', 'framework', 'enables', 'these', 'methods', 'to', 'be', 'more', 'widely', 'applicable', 'for', 'both', 'transductive', 'and', 'inductive', 'learning', 'as', 'well', 'as', 'for', 'use', 'on', 'graphs', 'with', 'attributes', 'if', 'available', 'this', 'is', 'achieved', 'by', 'learning', 'functions', 'that', 'generalize', 'to', 'new', 'nodes', 'and', 'graphs', 'we', 'show', 'that', 'our', 'proposed', 'framework', 'is', 'effective', 'with', 'an', 'average', 'auc', 'improvement', 'of', '1655', 'while', 'requiring', 'on', 'average', '853x', 'less', 'space', 'than', 'existing', 'methods', 'on', 'a', 'variety', 'of', 'graphs']] | [-0.01675549504692636, 0.04515908616228825, -0.05848880388563679, 0.05548619498031551, -0.1001327270101155, -0.17431967057167522, 0.031085513000406566, 0.447044532457667, -0.25641828462661753, -0.3117399513961807, 0.1095961344751319, -0.2718201685756926, -0.204557443013595, 0.2528028370932706, -0.1235936646439856, 0.08375338320470145, 0.07908539814393847, 0.049945828964513155, -0.034944960707047536, -0.2725788034543756, 0.3206995123156136, 0.016577100747775648, 0.3024482614631134, 0.04688089397555638, 0.10316424766375172, 0.02148318959460143, -0.024247982058553927, 0.06555145757419298, -0.07022011302986123, 0.18901162914511177, 0.2901685682876456, 0.17310655875612171, 0.28941699303085766, -0.403642630685241, -0.2595050528630494, 0.13839562097414126, 0.15781545352309026, 0.1253910545913142, -0.005768456984209948, -0.29087374505076197, 0.10818705324669399, -0.16668759670499111, -0.011192918921850863, -0.14698456102651694, -0.029956437465584566, 0.06165743069009735, -0.2684827348938392, 0.020329193637758914, 0.08757806529756636, 0.04339341710531904, 0.031202405125593708, -0.16741567051353595, 0.04638485628510675, 0.157139761433486, 0.01675079734995961, 0.040345547327231016, 0.11299268581018213, -0.10739316989577585, -0.22329090483516695, 0.3983194888779713, -0.041608519730958034, -0.21273358105531623, 0.2448077195474217, -0.029825453373092798, -0.176398237347002, 0.07603174805295684, 0.20060834844386385, 0.15176946701662195, -0.1261301914410245, 0.04529110905075927, -0.03566624100410169, 0.08712611590482054, 0.029946173135671886, 0.050481684365865566, 0.13132299091066083, 0.15519633141586617, 0.10398872131218893, 0.11784831649969302, -0.04809003687583872, -0.08973890742166869, -0.22585486460837625, -0.1028582586305997, -0.2108255747795826, 0.007445571409358132, -0.13307092117639485, -0.1930317519585632, 0.38050816223375505, 0.22699113027812282, 0.2169971060488493, 0.13771743266580386, 0.29390717903452535, 0.04978966522856706, 0.125902459025383, 0.14390353184914398, 0.1554126242115613, 0.10009097536394913, 0.07440433624020266, -0.09371962697215137, 0.10559573196355374, 0.0697482428273126] |
1,802.02897 | Arf good semigroups with fixed genus | In this paper we give an algorithm for the computation of all the Arf
numerical semigroups with a given genus. Moreover, we generalize the concept of
genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give
a procedure to calculate all the Arf semigroups of $\mathbb{N}^r$ with a given
genus.
| math.AC | in this paper we give an algorithm for the computation of all the arf numerical semigroups with a given genus moreover we generalize the concept of genus of a numerical semigroup to good semigroups of mathbbnr and we give a procedure to calculate all the arf semigroups of mathbbnr with a given genus | [['in', 'this', 'paper', 'we', 'give', 'an', 'algorithm', 'for', 'the', 'computation', 'of', 'all', 'the', 'arf', 'numerical', 'semigroups', 'with', 'a', 'given', 'genus', 'moreover', 'we', 'generalize', 'the', 'concept', 'of', 'genus', 'of', 'a', 'numerical', 'semigroup', 'to', 'good', 'semigroups', 'of', 'mathbbnr', 'and', 'we', 'give', 'a', 'procedure', 'to', 'calculate', 'all', 'the', 'arf', 'semigroups', 'of', 'mathbbnr', 'with', 'a', 'given', 'genus']] | [-0.12777847431178363, 0.0636291660059283, -0.09365574110580503, 0.06380774764967907, -0.05735610142561062, -0.09128241617021696, 0.04449455431477992, 0.3589075169754478, -0.28139738415209753, -0.23744978611621093, 0.09342301066499203, -0.2900213790389727, -0.17468255758285522, 0.2943420930291122, -0.13343272309800838, 0.07198793792499686, 0.06321438992360853, 0.08740736435185063, -0.14106831729482366, -0.28245499792271556, 0.3851052041885988, 0.03914276608880961, 0.11112607968092528, 0.11325723937501744, 0.1245231885849586, -0.04779656938681344, -0.06630172032230305, -0.00013412973615077307, -0.2339534663577687, 0.14762475128935756, 0.30181987383315023, 0.10466253915625923, 0.21105714103663867, -0.39300531500353003, -0.13738120190869524, 0.21466562107978565, 0.07317526120130184, 0.07434059440527323, -0.06564900734163118, -0.21727335807990353, 0.15452932722796248, -0.19099599966463052, -0.16380295129317157, -0.12578389669860765, 0.0388020054560225, 0.0333221611338404, -0.2727124955997152, -0.03593526894824123, 0.1055091879559013, 0.12787996831719042, -0.003424836094227602, -0.06331711431156914, -0.001788953411445584, 0.0976154579657991, 0.0037134842209096226, 0.008221749146029635, 0.011720208688375523, -0.07005517254583538, -0.18173652933031884, 0.3241287893000639, -0.019689337860019702, -0.21583464917428088, 0.114127043480897, -0.15570993995610274, -0.13408224363723453, 0.14930190156512665, 0.09733264685942317, 0.19195575766124814, -0.046064316716818314, 0.10582644093390729, -0.11562902817748627, 0.08826472149845564, 0.053142552457328116, -0.04216634643808851, 0.06362526920044197, 0.12330005832789641, 0.07408496811283084, 0.2343602399781065, 0.0366809045597208, 0.02373615720854053, -0.3958628990177838, -0.22541046836677026, -0.12025285916807095, 0.08972932679912532, -0.09708146040985703, -0.25366017735510504, 0.48715785820529145, 0.16411340103115676, 0.1826694303034049, 0.2262188551314878, 0.23452203223516918, 0.11939568093643999, -0.02139628449244038, 0.10881691263935897, 0.08096038943754053, 0.20140343405446917, -0.015853418652319682, -0.18634365868034228, -0.03894928694298526, 0.2250142657496738] |
1,802.02898 | Spectroscopic Criteria for Identification of Nuclear Tetrahedral and
Octahedral Symmetries: Illustration on a Rare Earth Nucleus | We formulate criteria for identification of the nuclear tetrahedral and
octahedral symmetries and illustrate for the first time their possible
realization in a Rare Earth nucleus 152Sm. We use realistic nuclear mean-field
theory calculations with the phenomenological macroscopic-microscopic method,
the Gogny-Hartree-Fock-Bogoliubov approach and the general point-group theory
considerations to guide the experimental identification method as illustrated
on published experimental data. Following group-theory the examined symmetries
imply the existence of exotic rotational bands on whose properties the
spectroscopic identification criteria are based. These bands may contain
simultaneously states of even and odd spins, of both parities and parity
doublets at well defined spins. In the exact-symmetry limit those bands involve
no E2-transitions. We show that coexistence of tetrahedral and octahedral
deformations is essential when calculating the corresponding energy minima and
surrounding barriers and that it has a characteristic impact on the rotational
bands. The symmetries in question imply the existence of long-lived
shape-isomers and, possibly, new waiting point nuclei -- impacting the
nucleosynthesis processes in astrophysics -- and an existence of 16-fold
degenerate particle-hole excitations. Specifically designed experiments which
aim at strengthening the identification arguments are briefly discussed.
| nucl-th nucl-ex | we formulate criteria for identification of the nuclear tetrahedral and octahedral symmetries and illustrate for the first time their possible realization in a rare earth nucleus 152sm we use realistic nuclear meanfield theory calculations with the phenomenological macroscopicmicroscopic method the gognyhartreefockbogoliubov approach and the general pointgroup theory considerations to guide the experimental identification method as illustrated on published experimental data following grouptheory the examined symmetries imply the existence of exotic rotational bands on whose properties the spectroscopic identification criteria are based these bands may contain simultaneously states of even and odd spins of both parities and parity doublets at well defined spins in the exactsymmetry limit those bands involve no e2transitions we show that coexistence of tetrahedral and octahedral deformations is essential when calculating the corresponding energy minima and surrounding barriers and that it has a characteristic impact on the rotational bands the symmetries in question imply the existence of longlived shapeisomers and possibly new waiting point nuclei impacting the nucleosynthesis processes in astrophysics and an existence of 16fold degenerate particlehole excitations specifically designed experiments which aim at strengthening the identification arguments are briefly discussed | [['we', 'formulate', 'criteria', 'for', 'identification', 'of', 'the', 'nuclear', 'tetrahedral', 'and', 'octahedral', 'symmetries', 'and', 'illustrate', 'for', 'the', 'first', 'time', 'their', 'possible', 'realization', 'in', 'a', 'rare', 'earth', 'nucleus', '152sm', 'we', 'use', 'realistic', 'nuclear', 'meanfield', 'theory', 'calculations', 'with', 'the', 'phenomenological', 'macroscopicmicroscopic', 'method', 'the', 'gognyhartreefockbogoliubov', 'approach', 'and', 'the', 'general', 'pointgroup', 'theory', 'considerations', 'to', 'guide', 'the', 'experimental', 'identification', 'method', 'as', 'illustrated', 'on', 'published', 'experimental', 'data', 'following', 'grouptheory', 'the', 'examined', 'symmetries', 'imply', 'the', 'existence', 'of', 'exotic', 'rotational', 'bands', 'on', 'whose', 'properties', 'the', 'spectroscopic', 'identification', 'criteria', 'are', 'based', 'these', 'bands', 'may', 'contain', 'simultaneously', 'states', 'of', 'even', 'and', 'odd', 'spins', 'of', 'both', 'parities', 'and', 'parity', 'doublets', 'at', 'well', 'defined', 'spins', 'in', 'the', 'exactsymmetry', 'limit', 'those', 'bands', 'involve', 'no', 'e2transitions', 'we', 'show', 'that', 'coexistence', 'of', 'tetrahedral', 'and', 'octahedral', 'deformations', 'is', 'essential', 'when', 'calculating', 'the', 'corresponding', 'energy', 'minima', 'and', 'surrounding', 'barriers', 'and', 'that', 'it', 'has', 'a', 'characteristic', 'impact', 'on', 'the', 'rotational', 'bands', 'the', 'symmetries', 'in', 'question', 'imply', 'the', 'existence', 'of', 'longlived', 'shapeisomers', 'and', 'possibly', 'new', 'waiting', 'point', 'nuclei', 'impacting', 'the', 'nucleosynthesis', 'processes', 'in', 'astrophysics', 'and', 'an', 'existence', 'of', '16fold', 'degenerate', 'particlehole', 'excitations', 'specifically', 'designed', 'experiments', 'which', 'aim', 'at', 'strengthening', 'the', 'identification', 'arguments', 'are', 'briefly', 'discussed']] | [-0.11003862503163803, 0.15242931240624916, -0.06245317163616214, 0.11826352184385082, -0.03449086754347433, -0.14350608990599328, 0.07091195153067359, 0.3701341693791059, -0.21604977320920635, -0.3015583108197181, 0.07691625093626739, -0.2848090410877306, -0.10708644746669702, 0.13846747466020162, 0.020565789111040452, 0.010255353941049958, 0.034529369634033726, -0.0063962072471750306, -0.08807860855441695, -0.1986444201883297, 0.30294917423292805, 0.051635718575658296, 0.2825826354667667, 0.07540814973357815, 0.04368911136663263, 0.02543136952214639, -0.0014803054727163616, -0.03684640226240914, -0.1459009112975884, 0.10136125358378074, 0.2426555507412119, 0.0596924975289257, 0.17430523479009394, -0.4500659659893794, -0.1827585237186433, 0.0709474537646971, 0.11886158361928639, 0.14038806441585422, -0.092937544767315, -0.30140624164634355, 0.032842173406107164, -0.14679164197909964, -0.19600461209244044, -0.13192395584729427, 0.014898940265833676, 0.027723565897239105, -0.21837606936038195, 0.08806950347830675, 0.06106770878394165, 0.09680206107405356, -0.15595888503754235, -0.17055031293069248, -0.06644313385809905, 0.09085838234382758, 0.08113463129976171, -0.05936878283986576, 0.1091327263927599, -0.09721638605121401, -0.14675933118860984, 0.4093071463323393, 0.015127791161521, -0.14345724568548765, 0.2109191309837215, -0.1391803708553038, -0.19690594576544815, 0.12970807602447407, 0.14041771321681554, 0.12357884090250501, -0.08341305400924515, 0.07732019356162809, -0.021198950828165634, 0.1270338557105688, 0.03627477426230293, 0.08487652147036548, 0.22456106031569398, 0.14138818279568843, 0.04599755505582185, 0.07125401300516307, -0.11285879362789034, -0.1110067867784592, -0.33229272306518076, -0.1054922147004118, -0.15971359066859625, 0.025114752127082793, -0.039867537601941755, -0.11000306114290871, 0.39692719330612036, 0.09062221166383537, 0.1666083806840406, -0.023763223824981642, 0.22502032443522835, 0.06841159905121498, 0.050618573572577145, 0.03619481581563877, 0.2511519081685897, 0.15361828115451467, 0.02241285081478194, -0.2826556997951939, 0.02956872563975464, 0.06012099334115551] |
1,802.02899 | From Selective Deep Convolutional Features to Compact Binary
Representations for Image Retrieval | In the large-scale image retrieval task, the two most important requirements
are the discriminability of image representations and the efficiency in
computation and storage of representations. Regarding the former requirement,
Convolutional Neural Network (CNN) is proven to be a very powerful tool to
extract highly discriminative local descriptors for effective image search.
Additionally, in order to further improve the discriminative power of the
descriptors, recent works adopt fine-tuned strategies. In this paper, taking a
different approach, we propose a novel, computationally efficient, and
competitive framework. Specifically, we firstly propose various strategies to
compute masks, namely SIFT-mask, SUM-mask, and MAX-mask, to select a
representative subset of local convolutional features and eliminate redundant
features. Our in-depth analyses demonstrate that proposed masking schemes are
effective to address the burstiness drawback and improve retrieval accuracy.
Secondly, we propose to employ recent embedding and aggregating methods which
can significantly boost the feature discriminability. Regarding the computation
and storage efficiency, we include a hashing module to produce very compact
binary image representations. Extensive experiments on six image retrieval
benchmarks demonstrate that our proposed framework achieves the
state-of-the-art retrieval performances.
| cs.CV | in the largescale image retrieval task the two most important requirements are the discriminability of image representations and the efficiency in computation and storage of representations regarding the former requirement convolutional neural network cnn is proven to be a very powerful tool to extract highly discriminative local descriptors for effective image search additionally in order to further improve the discriminative power of the descriptors recent works adopt finetuned strategies in this paper taking a different approach we propose a novel computationally efficient and competitive framework specifically we firstly propose various strategies to compute masks namely siftmask summask and maxmask to select a representative subset of local convolutional features and eliminate redundant features our indepth analyses demonstrate that proposed masking schemes are effective to address the burstiness drawback and improve retrieval accuracy secondly we propose to employ recent embedding and aggregating methods which can significantly boost the feature discriminability regarding the computation and storage efficiency we include a hashing module to produce very compact binary image representations extensive experiments on six image retrieval benchmarks demonstrate that our proposed framework achieves the stateoftheart retrieval performances | [['in', 'the', 'largescale', 'image', 'retrieval', 'task', 'the', 'two', 'most', 'important', 'requirements', 'are', 'the', 'discriminability', 'of', 'image', 'representations', 'and', 'the', 'efficiency', 'in', 'computation', 'and', 'storage', 'of', 'representations', 'regarding', 'the', 'former', 'requirement', 'convolutional', 'neural', 'network', 'cnn', 'is', 'proven', 'to', 'be', 'a', 'very', 'powerful', 'tool', 'to', 'extract', 'highly', 'discriminative', 'local', 'descriptors', 'for', 'effective', 'image', 'search', 'additionally', 'in', 'order', 'to', 'further', 'improve', 'the', 'discriminative', 'power', 'of', 'the', 'descriptors', 'recent', 'works', 'adopt', 'finetuned', 'strategies', 'in', 'this', 'paper', 'taking', 'a', 'different', 'approach', 'we', 'propose', 'a', 'novel', 'computationally', 'efficient', 'and', 'competitive', 'framework', 'specifically', 'we', 'firstly', 'propose', 'various', 'strategies', 'to', 'compute', 'masks', 'namely', 'siftmask', 'summask', 'and', 'maxmask', 'to', 'select', 'a', 'representative', 'subset', 'of', 'local', 'convolutional', 'features', 'and', 'eliminate', 'redundant', 'features', 'our', 'indepth', 'analyses', 'demonstrate', 'that', 'proposed', 'masking', 'schemes', 'are', 'effective', 'to', 'address', 'the', 'burstiness', 'drawback', 'and', 'improve', 'retrieval', 'accuracy', 'secondly', 'we', 'propose', 'to', 'employ', 'recent', 'embedding', 'and', 'aggregating', 'methods', 'which', 'can', 'significantly', 'boost', 'the', 'feature', 'discriminability', 'regarding', 'the', 'computation', 'and', 'storage', 'efficiency', 'we', 'include', 'a', 'hashing', 'module', 'to', 'produce', 'very', 'compact', 'binary', 'image', 'representations', 'extensive', 'experiments', 'on', 'six', 'image', 'retrieval', 'benchmarks', 'demonstrate', 'that', 'our', 'proposed', 'framework', 'achieves', 'the', 'stateoftheart', 'retrieval', 'performances']] | [-0.04844715398632818, -0.05475039636302326, -0.09950976473434518, 0.07832010307918406, -0.0969226889545098, -0.18210463614668698, 0.0250577306019194, 0.465471984166652, -0.27227611003973934, -0.33148570698168545, 0.08527051869314164, -0.2517683232937189, -0.2062155884017961, 0.15973638370245075, -0.1337317426478775, 0.108365158543327, 0.13076167079852893, 0.01489144673687406, -0.11217594580310915, -0.32406921685259377, 0.2997064277775482, 0.09880684877538846, 0.39635646721451645, 0.03504414505376998, 0.1198934055140449, -0.03645178471019284, -0.1139168288539319, -0.0176431234259831, -0.05707271578697449, 0.2368058151487882, 0.33185752019700077, 0.2039001563150022, 0.27852239148665425, -0.4029442958326803, -0.2525089281843975, 0.09991369545459747, 0.16092201464214465, 0.11171862044979611, -0.07401044629182757, -0.3031426460617998, 0.1426223992408874, -0.1873441155275537, 0.06005166142195877, -0.2452029596393307, -0.031255787926622564, -0.040233775816806074, -0.32596017714693315, 0.011305519949140337, 0.08463980221034338, 0.00897947330183039, -0.0406479485934445, -0.09983949142559949, 0.0668058063750828, 0.15296145593488797, -0.012710118492961758, 0.04280513126868755, 0.15131173224395347, -0.19996812065106093, -0.13617471641563397, 0.37682425441841283, -0.05671986157604907, -0.2161814740755492, 0.21508180727768275, 0.00321518228479868, -0.17463460457511246, 0.091859107718402, 0.2451684105158266, 0.13984304117620922, -0.14049428852999377, -0.014291243211159276, -0.01572447782382369, 0.1922216062750926, 0.05347192818751662, 0.07899219745304435, 0.17042026626618786, 0.2508663780418121, 0.042575161686788, 0.18092855641088035, -0.16668342347127488, -0.0453526202071872, -0.16819985261083478, -0.09700757226803236, -0.16240081335547277, -0.06697730489540846, -0.12307582207593239, -0.09524150744546205, 0.4379556378763583, 0.2701164418236456, 0.2198847198781247, 0.08255359923609326, 0.3835872824303806, 0.01077400387601099, 0.12566602617605693, 0.10146536174870562, 0.1932802937640291, 0.002041847005279528, 0.10103902348039102, -0.18360528752932118, 0.0472124726807427, 0.10367446967736921] |
1,802.029 | The $n$ body matrix and its determinant | The primary purpose of this note is to prove two recent conjectures
concerning the $n$ body matrix that arose in recent papers of Escobar-Ruiz,
Miller, and Turbiner on the classical and quantum $n$ body problem in
$d$-dimensional space. First, whenever the positions of the masses are in a
nonsingular configuration, meaning that they do not lie on an affine subspace
of dimension $\leq n-2$, the $n$ body matrix is positive definite and, hence,
defines a Riemannian metric on the space coordinatized by their interpoint
distances. Second, its determinant can be factored into the product of the
order $n$ Cayley--Menger determinant and a mass-dependent factor that is also
of one sign on all nonsingular mass configurations. The factorization of the
$n$ body determinant is shown to be a special case of an intriguing general
result proving the factorization of determinants of a certain form.
| math-ph math.MP | the primary purpose of this note is to prove two recent conjectures concerning the n body matrix that arose in recent papers of escobarruiz miller and turbiner on the classical and quantum n body problem in ddimensional space first whenever the positions of the masses are in a nonsingular configuration meaning that they do not lie on an affine subspace of dimension leq n2 the n body matrix is positive definite and hence defines a riemannian metric on the space coordinatized by their interpoint distances second its determinant can be factored into the product of the order n cayleymenger determinant and a massdependent factor that is also of one sign on all nonsingular mass configurations the factorization of the n body determinant is shown to be a special case of an intriguing general result proving the factorization of determinants of a certain form | [['the', 'primary', 'purpose', 'of', 'this', 'note', 'is', 'to', 'prove', 'two', 'recent', 'conjectures', 'concerning', 'the', 'n', 'body', 'matrix', 'that', 'arose', 'in', 'recent', 'papers', 'of', 'escobarruiz', 'miller', 'and', 'turbiner', 'on', 'the', 'classical', 'and', 'quantum', 'n', 'body', 'problem', 'in', 'ddimensional', 'space', 'first', 'whenever', 'the', 'positions', 'of', 'the', 'masses', 'are', 'in', 'a', 'nonsingular', 'configuration', 'meaning', 'that', 'they', 'do', 'not', 'lie', 'on', 'an', 'affine', 'subspace', 'of', 'dimension', 'leq', 'n2', 'the', 'n', 'body', 'matrix', 'is', 'positive', 'definite', 'and', 'hence', 'defines', 'a', 'riemannian', 'metric', 'on', 'the', 'space', 'coordinatized', 'by', 'their', 'interpoint', 'distances', 'second', 'its', 'determinant', 'can', 'be', 'factored', 'into', 'the', 'product', 'of', 'the', 'order', 'n', 'cayleymenger', 'determinant', 'and', 'a', 'massdependent', 'factor', 'that', 'is', 'also', 'of', 'one', 'sign', 'on', 'all', 'nonsingular', 'mass', 'configurations', 'the', 'factorization', 'of', 'the', 'n', 'body', 'determinant', 'is', 'shown', 'to', 'be', 'a', 'special', 'case', 'of', 'an', 'intriguing', 'general', 'result', 'proving', 'the', 'factorization', 'of', 'determinants', 'of', 'a', 'certain', 'form']] | [-0.16424586291959456, 0.11663200520655356, -0.05597316039378532, 0.03448656247846756, -0.0547736061238487, -0.10809714763923745, -0.020656331396386236, 0.3285109722350632, -0.2495864814468725, -0.2315495649064091, 0.1049389020838237, -0.28273395975087573, -0.17604602629181101, 0.15183612061943202, -0.07781177884112046, 0.027348175946160704, 0.054565931573628226, 0.1100310002827466, -0.12324439039909688, -0.29960801595130043, 0.4049575079075048, -0.0006969423913790411, 0.182139690357103, 0.07032843665252636, 0.09848290793991214, 0.017935685765057226, -0.009018236403943787, 0.005930371156608371, -0.09666234852731168, 0.13072206304182338, 0.23447364682174274, 0.15702670551574147, 0.2372748638949239, -0.3730462982227475, -0.14867133256310308, 0.16759678656169752, 0.14229999272930385, 0.062136523299325834, 0.007289646995175158, -0.2522963525737229, 0.08162418220841497, -0.15586878737749557, -0.16655819547939782, -0.0340980325143417, 0.08287294621539998, -0.04579161042609895, -0.25951479279606693, 0.02274847504970598, 0.117326323769357, 0.012675233992000282, -0.037667375674445024, -0.16480227302625433, 0.01814299029573588, 0.11473905064844409, 0.04835896637999046, 0.05596648398901559, 0.07661407898363828, -0.06571896571803733, -0.09502805726156688, 0.37210962465885555, -0.013458378538390962, -0.2395891694935747, 0.1255381347604988, -0.16787368373479694, -0.1549148545764439, 0.10090780516014054, 0.13733159302419026, 0.16036588836028437, -0.08675086784707776, 0.16284423512832957, -0.12050319710930049, 0.1417973089084344, 0.09638607112074297, -0.0153368752803096, 0.17614170984679858, 0.06572283751619848, 0.0751733082021967, 0.09294662840867704, 0.018367874629559442, -0.09946516817960312, -0.31239482086204307, -0.2139490068542548, -0.23275780684436004, 0.13125179909855458, -0.1521696717421767, -0.1747217361073741, 0.3449719510759345, 0.05446458384058517, 0.23476560450237716, 0.07973690247032005, 0.237483982495229, 0.10077194075106682, 0.05065512516319384, 0.05874995054336081, 0.18002925082405005, 0.1840082905189672, 0.024643225552724073, -0.17948775433030956, 0.029626281149882142, 0.1636995819764553] |
1,802.02901 | Pair correlation of sequences $(\lbrace a_n \alpha \rbrace)_{n \in
\mathbb{N}}$ with maximal order of additive energy | We show for sequences $\left(a_{n}\right)_{n \in \mathbb{N}}$ of distinct
positive integers with maximal order of additive energy, that the sequence
$\left(\left\{a_{n} \alpha\right\}\right)_{n \in \mathbb{N}}$ does not have
Poissonian pair correlations for any $\alpha$. This result essentially sharpens
a result obtained by J. Bourgain on this topic.
| math.NT | we show for sequences lefta_nright_n in mathbbn of distinct positive integers with maximal order of additive energy that the sequence leftlefta_n alpharightright_n in mathbbn does not have poissonian pair correlations for any alpha this result essentially sharpens a result obtained by j bourgain on this topic | [['we', 'show', 'for', 'sequences', 'lefta_nright_n', 'in', 'mathbbn', 'of', 'distinct', 'positive', 'integers', 'with', 'maximal', 'order', 'of', 'additive', 'energy', 'that', 'the', 'sequence', 'leftlefta_n', 'alpharightright_n', 'in', 'mathbbn', 'does', 'not', 'have', 'poissonian', 'pair', 'correlations', 'for', 'any', 'alpha', 'this', 'result', 'essentially', 'sharpens', 'a', 'result', 'obtained', 'by', 'j', 'bourgain', 'on', 'this', 'topic']] | [-0.16112665973765694, 0.18115639858676688, -0.03471176552019366, 0.03473710007054488, 0.0072788906678476414, -0.1313817392953712, 0.014113934105768314, 0.3595527889126021, -0.2586214513639393, -0.23583707670964624, -0.014142577879639524, -0.305063849558001, -0.12005217458404925, 0.1751149399610965, -0.11915266212156933, 0.013440565218764317, 0.07582697271794567, 0.07379438622814158, 0.011370951274369398, -0.2930470546100127, 0.3533195700982343, -0.06609590687667546, 0.17055672388738932, 0.042855560516371675, 0.052941832159969796, 0.03459445073815953, -0.04391904199576896, -0.013344055304870657, -0.23961493335034745, 0.052855905631314155, 0.28659233507072635, 0.0888459806472225, 0.32559534931636375, -0.30335953989592584, -0.21479530922015724, 0.23107049316572753, 0.16293775472466066, 0.027978906787567488, -0.04970110649921243, -0.2429926566698629, 0.15915020577528555, -0.13035850758087295, -0.10781206387985984, -0.04810181254035105, 0.1225181085098049, 0.08204765686684329, -0.3585329273938323, 0.08838690865946852, 0.2663915821391603, 0.0503778792715267, -0.011613005326817865, -0.2016966824784227, 0.004776125348618497, 0.09656236118272594, 0.013439492484473663, 0.11275001790921163, -0.028256893633743344, -0.012008675556305958, -0.1536790180708403, 0.255168734057604, -0.12395064045077837, -0.19067952008513006, 0.0956268601079026, -0.2105810294110004, -0.21173263513280646, 0.13660309189404157, 0.022494250625047996, 0.11312802142018209, -0.04725215211510658, 0.15928805971761112, -0.10369739546339311, 0.20234040687184618, 0.16199159350894068, 0.031350112854219646, 0.11742856444628991, 0.004482561378213374, 0.11026690385567592, 0.08613750933790984, 0.025119992808195882, -0.001733327820978087, -0.3003739934900533, -0.12080935994163156, -0.2615224140615243, 0.15962689107254846, -0.09669308518262013, -0.16915898405663346, 0.32391541410723457, 0.09556723732258314, 0.20957252670727347, 0.13923701289636287, 0.17924744502195847, 0.10428633095453614, -0.01021265878048523, 0.05692204128464927, 0.07852790358921756, 0.10430812249061368, 0.04740522026954948, -0.15708530649704777, 0.0446722280315083, 0.15278896163015263] |
1,802.02902 | Quasi-exactly solvable Schr\"odinger equations, symmetric polynomials,
and functional Bethe ansatz method | For applications to quasi-exactly solvable Schr\"odinger equations in quantum
mechanics, we consider the general conditions that have to be satisfied by the
coefficients of a second-order differential equation with at most $k+1$
singular points in order that this equation has particular solutions that are
$n$th-degree polynomials. In a first approach, we show that such conditions
involve $k-2$ integration constants, which satisfy a system of linear equations
whose coefficients can be written in terms of elementary symmetric polynomials
in the polynomial solution roots whenver such roots are all real and distinct.
In a second approach, we consider the functional Bethe ansatz method in its
most general form under the same assumption. Comparing the two approaches, we
prove that the above-mentioned $k-2$ integration constants can be expressed as
linear combinations of monomial symmetric polynomials in the roots, associated
with partitions into no more than two parts. We illustrate these results by
considering a quasi-exactly solvable extension of the Mathews-Lakshmanan
nonlinear oscillator corresponding to $k=4$.
| math-ph math.MP nlin.SI quant-ph | for applications to quasiexactly solvable schrodinger equations in quantum mechanics we consider the general conditions that have to be satisfied by the coefficients of a secondorder differential equation with at most k1 singular points in order that this equation has particular solutions that are nthdegree polynomials in a first approach we show that such conditions involve k2 integration constants which satisfy a system of linear equations whose coefficients can be written in terms of elementary symmetric polynomials in the polynomial solution roots whenver such roots are all real and distinct in a second approach we consider the functional bethe ansatz method in its most general form under the same assumption comparing the two approaches we prove that the abovementioned k2 integration constants can be expressed as linear combinations of monomial symmetric polynomials in the roots associated with partitions into no more than two parts we illustrate these results by considering a quasiexactly solvable extension of the mathewslakshmanan nonlinear oscillator corresponding to k4 | [['for', 'applications', 'to', 'quasiexactly', 'solvable', 'schrodinger', 'equations', 'in', 'quantum', 'mechanics', 'we', 'consider', 'the', 'general', 'conditions', 'that', 'have', 'to', 'be', 'satisfied', 'by', 'the', 'coefficients', 'of', 'a', 'secondorder', 'differential', 'equation', 'with', 'at', 'most', 'k1', 'singular', 'points', 'in', 'order', 'that', 'this', 'equation', 'has', 'particular', 'solutions', 'that', 'are', 'nthdegree', 'polynomials', 'in', 'a', 'first', 'approach', 'we', 'show', 'that', 'such', 'conditions', 'involve', 'k2', 'integration', 'constants', 'which', 'satisfy', 'a', 'system', 'of', 'linear', 'equations', 'whose', 'coefficients', 'can', 'be', 'written', 'in', 'terms', 'of', 'elementary', 'symmetric', 'polynomials', 'in', 'the', 'polynomial', 'solution', 'roots', 'whenver', 'such', 'roots', 'are', 'all', 'real', 'and', 'distinct', 'in', 'a', 'second', 'approach', 'we', 'consider', 'the', 'functional', 'bethe', 'ansatz', 'method', 'in', 'its', 'most', 'general', 'form', 'under', 'the', 'same', 'assumption', 'comparing', 'the', 'two', 'approaches', 'we', 'prove', 'that', 'the', 'abovementioned', 'k2', 'integration', 'constants', 'can', 'be', 'expressed', 'as', 'linear', 'combinations', 'of', 'monomial', 'symmetric', 'polynomials', 'in', 'the', 'roots', 'associated', 'with', 'partitions', 'into', 'no', 'more', 'than', 'two', 'parts', 'we', 'illustrate', 'these', 'results', 'by', 'considering', 'a', 'quasiexactly', 'solvable', 'extension', 'of', 'the', 'mathewslakshmanan', 'nonlinear', 'oscillator', 'corresponding', 'to', 'k4']] | [-0.1583415289140248, 0.06902088096176158, -0.06269559567735997, 0.03801514793376555, -0.0982055753149325, -0.17479951194836757, -0.057038483471114884, 0.31399181426968426, -0.28697178563597847, -0.21278758633125108, 0.10894323058601003, -0.2879706515581347, -0.20843271067169553, 0.2206204739966779, -0.005066148353216704, 0.06792881550027233, 0.04846003202110296, 0.06616593451035442, -0.10405249205214204, -0.2891910460864892, 0.32686958013509865, -0.07789298911447987, 0.16758765798149397, 0.000455800113195437, 0.11754448267747648, -0.025559972926566844, 0.02852422243449837, 0.020291413072845897, -0.13045170953814705, 0.10168884307495318, 0.3037582772842143, 0.0901173925594776, 0.24097685432061552, -0.4280740736925509, -0.16200486242305487, 0.15528042064688635, 0.14808380775502883, 0.10037897160436841, 0.010584263249893412, -0.23973519213905092, 0.09505745834612753, -0.15177448390750214, -0.19836559019749983, -0.10170257922727614, 0.0044225893187103795, 0.06020992731209844, -0.27948235819349065, 0.08027857824927195, 0.06486245752312243, 0.05665065600564958, -0.09930412704779883, -0.14425918818233185, 0.027663390920497476, 0.041484516416676345, 0.004014837242721114, -0.06136240599444136, 0.012575523077975959, -0.1140098536896403, -0.12093822045717388, 0.4148035617152345, -0.07493508168963672, -0.3022934766722756, 0.12454506990034134, -0.15251622485229746, -0.18247726352710741, 0.10443832450400806, 0.13428577308077366, 0.14619677352602595, -0.15452040087548086, 0.15299188530298125, -0.06873941140074749, 0.12040775376808596, 0.14208747064694763, -0.001355798586155288, 0.12848585039027965, 0.03445162134667044, 0.04811224693112308, 0.14864394214455387, 0.07782830907053721, -0.146797735572909, -0.33619275281671435, -0.15889622786489782, -0.18502130164633854, 0.0666955671273172, -0.13506754850959624, -0.15330468952888623, 0.40924201039451874, 0.11717075874330476, 0.17013604980311356, 0.07990362444033963, 0.2257337041082792, 0.24087878084610564, 0.05726005777833052, 0.06833493103656565, 0.18456662438693455, 0.1445329091642634, 0.036823631409788504, -0.19522605206748267, 0.025787706887058448, 0.1372686200251337] |
1,802.02903 | Nonspecific biological effects of weak magnetic fields depend on
molecular rotations | The radical pair mechanism is a leading hypothesis in animal magnetic
navigation. This mechanism associates the magnetic sense with the visual
system, the radical pairs in cryptochromes of the eye retina being specialized
magnetic receptors that modulate rhodopsin-mediated photoreception. There are
also nonspecific magnetic effects in biology, which occur mostly by chance and
originate from the interaction of weak magnetic fields with the magnetic
moments dispersed all over the organism at the microscopic level. The radical
pair mechanism cannot explain this type of response for many reasons. We have
previously shown that the above interaction has a finite probability of
resulting in an observable. Here, we develop our physical model of nonspecific
magnetic effects for the case of magnetic moments located in rotating
molecules. We generalize the results of recent experiments on gene expression
in plants in a constant magnetic field, and show that the precession of the
magnetic moments that reside on rotating molecules can be slowed relative to
the immediate biophysical structures. In quantum mechanical language, the
crossing of the quantum levels of magnetic moments conjointly with molecular
rotations explain nonspecific magnetic effects and leads to magnetic
field-dependences that are in good agreement with the experiment.
| physics.bio-ph | the radical pair mechanism is a leading hypothesis in animal magnetic navigation this mechanism associates the magnetic sense with the visual system the radical pairs in cryptochromes of the eye retina being specialized magnetic receptors that modulate rhodopsinmediated photoreception there are also nonspecific magnetic effects in biology which occur mostly by chance and originate from the interaction of weak magnetic fields with the magnetic moments dispersed all over the organism at the microscopic level the radical pair mechanism cannot explain this type of response for many reasons we have previously shown that the above interaction has a finite probability of resulting in an observable here we develop our physical model of nonspecific magnetic effects for the case of magnetic moments located in rotating molecules we generalize the results of recent experiments on gene expression in plants in a constant magnetic field and show that the precession of the magnetic moments that reside on rotating molecules can be slowed relative to the immediate biophysical structures in quantum mechanical language the crossing of the quantum levels of magnetic moments conjointly with molecular rotations explain nonspecific magnetic effects and leads to magnetic fielddependences that are in good agreement with the experiment | [['the', 'radical', 'pair', 'mechanism', 'is', 'a', 'leading', 'hypothesis', 'in', 'animal', 'magnetic', 'navigation', 'this', 'mechanism', 'associates', 'the', 'magnetic', 'sense', 'with', 'the', 'visual', 'system', 'the', 'radical', 'pairs', 'in', 'cryptochromes', 'of', 'the', 'eye', 'retina', 'being', 'specialized', 'magnetic', 'receptors', 'that', 'modulate', 'rhodopsinmediated', 'photoreception', 'there', 'are', 'also', 'nonspecific', 'magnetic', 'effects', 'in', 'biology', 'which', 'occur', 'mostly', 'by', 'chance', 'and', 'originate', 'from', 'the', 'interaction', 'of', 'weak', 'magnetic', 'fields', 'with', 'the', 'magnetic', 'moments', 'dispersed', 'all', 'over', 'the', 'organism', 'at', 'the', 'microscopic', 'level', 'the', 'radical', 'pair', 'mechanism', 'can', 'not', 'explain', 'this', 'type', 'of', 'response', 'for', 'many', 'reasons', 'we', 'have', 'previously', 'shown', 'that', 'the', 'above', 'interaction', 'has', 'a', 'finite', 'probability', 'of', 'resulting', 'in', 'an', 'observable', 'here', 'we', 'develop', 'our', 'physical', 'model', 'of', 'nonspecific', 'magnetic', 'effects', 'for', 'the', 'case', 'of', 'magnetic', 'moments', 'located', 'in', 'rotating', 'molecules', 'we', 'generalize', 'the', 'results', 'of', 'recent', 'experiments', 'on', 'gene', 'expression', 'in', 'plants', 'in', 'a', 'constant', 'magnetic', 'field', 'and', 'show', 'that', 'the', 'precession', 'of', 'the', 'magnetic', 'moments', 'that', 'reside', 'on', 'rotating', 'molecules', 'can', 'be', 'slowed', 'relative', 'to', 'the', 'immediate', 'biophysical', 'structures', 'in', 'quantum', 'mechanical', 'language', 'the', 'crossing', 'of', 'the', 'quantum', 'levels', 'of', 'magnetic', 'moments', 'conjointly', 'with', 'molecular', 'rotations', 'explain', 'nonspecific', 'magnetic', 'effects', 'and', 'leads', 'to', 'magnetic', 'fielddependences', 'that', 'are', 'in', 'good', 'agreement', 'with', 'the', 'experiment']] | [-0.14506801591689547, 0.19340150710262122, -0.015348180143129346, 0.07170967109161619, -0.044931899067204524, -0.08854442710361006, 0.017136245536527654, 0.3853304797678958, -0.2582027260594222, -0.31156743311190177, -0.022262479138812432, -0.24702493260063382, -0.17472923509016328, 0.19061139164812035, -0.014172695120986628, -0.06105206601027095, 0.031063491475889556, 0.08280325486510041, 0.017585946471496885, -0.19097567226604692, 0.2823550515256974, 0.05244611085710895, 0.26485664246138185, 0.07151226161109588, 0.08166895806551816, -0.06382735465933588, 0.07491307623645205, 0.0217353153180293, -0.08300102208667508, 0.10225110232998731, 0.22641258394376526, 0.05743813767972193, 0.23277432912466478, -0.4994450557492293, -0.19937151189351796, 0.09676353313618016, 0.13087339060647146, 0.15305132920585326, -0.08817428055490197, -0.28133528358754417, 0.06155181080768151, -0.12967826191773069, -0.12771768686219062, -0.08768102148077356, 0.017886652215027575, 0.06769358006315496, -0.2709788639943011, 0.1113401803885033, 0.08179464458200007, 0.12171573663422629, -0.12297762998341753, -0.07533661581811077, -0.022938532096675922, 0.1360079788327293, 0.08876974903206265, 0.06618169065382526, 0.19730516322603336, -0.1438794742678102, -0.13983317907265275, 0.35664659277631006, -0.031055835885832047, -0.18381142080761492, 0.20889239513068175, -0.2177281012349971, -0.13961593523545532, 0.15509823441020765, 0.15338245004044884, 0.09898559475067839, -0.14151675037669056, 0.059645794523578155, -0.027657973803389743, 0.14233990314675551, 0.05698015881887618, 0.023516058258625277, 0.2636696132878792, 0.1448816934859437, 0.0008819293648322892, 0.11346681323199419, -0.11975905435796523, -0.08894490784705897, -0.24309121998863256, -0.14210191913357728, -0.15287088391748826, 0.03942629224117382, -0.04686570177260104, -0.15956243640034606, 0.3727006933138687, 0.17692810657899827, 0.1737070922188613, -0.026370187660047253, 0.26663153527817707, 0.05960365136127862, 0.1003153455260742, 0.018674650283266637, 0.26451468348446094, 0.1524651498564671, 0.08390806101402742, -0.27228845900746673, 0.11755031837228856, 0.02301586154677278] |
1,802.02904 | Deep Reinforcement Learning for Image Hashing | Deep hashing methods have received much attention recently, which achieve
promising results by taking advantage of the strong representation power of
deep networks. However, most existing deep hashing methods learn a whole set of
hashing functions independently, while ignore the correlations between
different hashing functions that can promote the retrieval accuracy greatly.
Inspired by the sequential decision ability of deep reinforcement learning, we
propose a new Deep Reinforcement Learning approach for Image Hashing (DRLIH).
Our proposed DRLIH approach models the hashing learning problem as a sequential
decision process, which learns each hashing function by correcting the errors
imposed by previous ones and promotes retrieval accuracy. To the best of our
knowledge, this is the first work to address hashing problem from deep
reinforcement learning perspective. The main contributions of our proposed
DRLIH approach can be summarized as follows: (1) We propose a deep
reinforcement learning hashing network. In the proposed network, we utilize
recurrent neural network (RNN) as agents to model the hashing functions, which
take actions of projecting images into binary codes sequentially, so that the
current hashing function learning can take previous hashing functions' error
into account. (2) We propose a sequential learning strategy based on proposed
DRLIH. We define the state as a tuple of internal features of RNN's hidden
layers and image features, which can reflect history decisions made by the
agents. We also propose an action group method to enhance the correlation of
hash functions in the same group. Experiments on three widely-used datasets
demonstrate the effectiveness of our proposed DRLIH approach.
| cs.CV | deep hashing methods have received much attention recently which achieve promising results by taking advantage of the strong representation power of deep networks however most existing deep hashing methods learn a whole set of hashing functions independently while ignore the correlations between different hashing functions that can promote the retrieval accuracy greatly inspired by the sequential decision ability of deep reinforcement learning we propose a new deep reinforcement learning approach for image hashing drlih our proposed drlih approach models the hashing learning problem as a sequential decision process which learns each hashing function by correcting the errors imposed by previous ones and promotes retrieval accuracy to the best of our knowledge this is the first work to address hashing problem from deep reinforcement learning perspective the main contributions of our proposed drlih approach can be summarized as follows 1 we propose a deep reinforcement learning hashing network in the proposed network we utilize recurrent neural network rnn as agents to model the hashing functions which take actions of projecting images into binary codes sequentially so that the current hashing function learning can take previous hashing functions error into account 2 we propose a sequential learning strategy based on proposed drlih we define the state as a tuple of internal features of rnns hidden layers and image features which can reflect history decisions made by the agents we also propose an action group method to enhance the correlation of hash functions in the same group experiments on three widelyused datasets demonstrate the effectiveness of our proposed drlih approach | [['deep', 'hashing', 'methods', 'have', 'received', 'much', 'attention', 'recently', 'which', 'achieve', 'promising', 'results', 'by', 'taking', 'advantage', 'of', 'the', 'strong', 'representation', 'power', 'of', 'deep', 'networks', 'however', 'most', 'existing', 'deep', 'hashing', 'methods', 'learn', 'a', 'whole', 'set', 'of', 'hashing', 'functions', 'independently', 'while', 'ignore', 'the', 'correlations', 'between', 'different', 'hashing', 'functions', 'that', 'can', 'promote', 'the', 'retrieval', 'accuracy', 'greatly', 'inspired', 'by', 'the', 'sequential', 'decision', 'ability', 'of', 'deep', 'reinforcement', 'learning', 'we', 'propose', 'a', 'new', 'deep', 'reinforcement', 'learning', 'approach', 'for', 'image', 'hashing', 'drlih', 'our', 'proposed', 'drlih', 'approach', 'models', 'the', 'hashing', 'learning', 'problem', 'as', 'a', 'sequential', 'decision', 'process', 'which', 'learns', 'each', 'hashing', 'function', 'by', 'correcting', 'the', 'errors', 'imposed', 'by', 'previous', 'ones', 'and', 'promotes', 'retrieval', 'accuracy', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'work', 'to', 'address', 'hashing', 'problem', 'from', 'deep', 'reinforcement', 'learning', 'perspective', 'the', 'main', 'contributions', 'of', 'our', 'proposed', 'drlih', 'approach', 'can', 'be', 'summarized', 'as', 'follows', '1', 'we', 'propose', 'a', 'deep', 'reinforcement', 'learning', 'hashing', 'network', 'in', 'the', 'proposed', 'network', 'we', 'utilize', 'recurrent', 'neural', 'network', 'rnn', 'as', 'agents', 'to', 'model', 'the', 'hashing', 'functions', 'which', 'take', 'actions', 'of', 'projecting', 'images', 'into', 'binary', 'codes', 'sequentially', 'so', 'that', 'the', 'current', 'hashing', 'function', 'learning', 'can', 'take', 'previous', 'hashing', 'functions', 'error', 'into', 'account', '2', 'we', 'propose', 'a', 'sequential', 'learning', 'strategy', 'based', 'on', 'proposed', 'drlih', 'we', 'define', 'the', 'state', 'as', 'a', 'tuple', 'of', 'internal', 'features', 'of', 'rnns', 'hidden', 'layers', 'and', 'image', 'features', 'which', 'can', 'reflect', 'history', 'decisions', 'made', 'by', 'the', 'agents', 'we', 'also', 'propose', 'an', 'action', 'group', 'method', 'to', 'enhance', 'the', 'correlation', 'of', 'hash', 'functions', 'in', 'the', 'same', 'group', 'experiments', 'on', 'three', 'widelyused', 'datasets', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'drlih', 'approach']] | [-0.03084778204534913, -0.02148587186588654, -0.12631495575808308, 0.0737045383468943, -0.11234707522191513, -0.19736510158991188, 0.061384944035037484, 0.4705608453228345, -0.32047811157481404, -0.2947070806718464, 0.034248502744753134, -0.24693216211506772, -0.2180740604102829, 0.13655565738957012, -0.1237492281218795, 0.1069500384918425, 0.10445373711005897, 0.00813118530009739, -0.08776906088668607, -0.3516290779633208, 0.35638734704003117, 0.0506848057312755, 0.3641001871326786, 0.001525402598169991, 0.15146068405316498, 0.03043061746094115, -0.030952250368436546, -0.03691962964747623, -0.028134331873861315, 0.1955687002494482, 0.3191448064791864, 0.23699324663274593, 0.3660198744741569, -0.3979834758383059, -0.2711328686910758, 0.0995878819339992, 0.15405061284029414, 0.10725680848087342, -0.05308161759549745, -0.35249848610582013, 0.06246392131902655, -0.2084765885721037, 0.09795218055654709, -0.18239302681351885, -0.06711706080236599, -0.012117056983046538, -0.3050756775321084, -0.02544227383266645, 0.1045380545814489, -0.024786344487473716, -0.04618874506785712, -0.1622166625058264, 0.0632344584065899, 0.14230520675794117, 0.032486508501098396, 0.11032170148254716, 0.14203605566496313, -0.18083601043168238, -0.1869632130022639, 0.3227707773070159, -0.06493551396775686, -0.181988568453785, 0.15157097043534776, 0.0017061702298283112, -0.16786410273433253, 0.07730881282914763, 0.26052880762434827, 0.16047454876691586, -0.16213110374678144, 0.009430685064733638, -0.06847034074032701, 0.18864667261062834, 0.014325056486882646, 0.02210619347260591, 0.1456571827653491, 0.26633657771615665, 0.030227081784036314, 0.1526667752365694, -0.11472017641980128, -0.09635286865545734, -0.1619449589575427, -0.07440293381164569, -0.21567299197235865, -0.037372508029188914, -0.12479919031729418, -0.11774624153594115, 0.3932418508023922, 0.24596701703360033, 0.2366604970257135, 0.1365381075424443, 0.3553441371650939, 0.026247060998645974, 0.18102322384019306, 0.10744894009286443, 0.20272008397033012, 0.034817523396381896, 0.09899283510067497, -0.17180613109910794, 0.1371378901819762, 0.12625550104537073] |
1,802.02905 | $ F_4$ , $E_6$ and $G_2$ Exceptional Gauge Groups in Vacuum Domain
Structure Model | Using vacuum domain structure model, trivial static potentials in various
representations of $F_4$, $E_6$ and $G_2$ exceptional groups are calculated by
means of the unit center element. Due to the absence of the non-trivial center
elements, the potential of every representation is screened at far distances.
However, the linear part is observed at intermediate quark separations which is
investigated by the decomposition of the exceptional group to its maximal
subgroups. Comparing the group factor of the super-group with the corresponding
one obtained from the non-trivial center elements of $SU(3)$ subgroup, shows
that $SU(3)$ is not the direct cause of temporary confinement in any of the
exceptional groups. However, the trivial potential obtained from the group
decomposition to the $SU(3)$ subgroup is the same as the potential of the
super-group itself. In addition, any regular or singular decomposition to the
$SU(2)$ subgroup which produces the Cartan generator with the same elements as
$h_1$, in any exceptional group, leads to the linear intermediate potential of
the exceptional gauge groups. The other $SU(2)$ decompositions with the Cartan
generator different from $h_1$, are still able to describe the linear potential
if the number of $SU(2)$ non-trivial center element which emerge in the
decompositions is the same. As a result, it is the center vortices quantized in
terms of non-trivial center element of the $SU(2)$ subgroup which give rise to
the intermediate confinement in the static potentials.
| hep-th hep-ph | using vacuum domain structure model trivial static potentials in various representations of f_4 e_6 and g_2 exceptional groups are calculated by means of the unit center element due to the absence of the nontrivial center elements the potential of every representation is screened at far distances however the linear part is observed at intermediate quark separations which is investigated by the decomposition of the exceptional group to its maximal subgroups comparing the group factor of the supergroup with the corresponding one obtained from the nontrivial center elements of su3 subgroup shows that su3 is not the direct cause of temporary confinement in any of the exceptional groups however the trivial potential obtained from the group decomposition to the su3 subgroup is the same as the potential of the supergroup itself in addition any regular or singular decomposition to the su2 subgroup which produces the cartan generator with the same elements as h_1 in any exceptional group leads to the linear intermediate potential of the exceptional gauge groups the other su2 decompositions with the cartan generator different from h_1 are still able to describe the linear potential if the number of su2 nontrivial center element which emerge in the decompositions is the same as a result it is the center vortices quantized in terms of nontrivial center element of the su2 subgroup which give rise to the intermediate confinement in the static potentials | [['using', 'vacuum', 'domain', 'structure', 'model', 'trivial', 'static', 'potentials', 'in', 'various', 'representations', 'of', 'f_4', 'e_6', 'and', 'g_2', 'exceptional', 'groups', 'are', 'calculated', 'by', 'means', 'of', 'the', 'unit', 'center', 'element', 'due', 'to', 'the', 'absence', 'of', 'the', 'nontrivial', 'center', 'elements', 'the', 'potential', 'of', 'every', 'representation', 'is', 'screened', 'at', 'far', 'distances', 'however', 'the', 'linear', 'part', 'is', 'observed', 'at', 'intermediate', 'quark', 'separations', 'which', 'is', 'investigated', 'by', 'the', 'decomposition', 'of', 'the', 'exceptional', 'group', 'to', 'its', 'maximal', 'subgroups', 'comparing', 'the', 'group', 'factor', 'of', 'the', 'supergroup', 'with', 'the', 'corresponding', 'one', 'obtained', 'from', 'the', 'nontrivial', 'center', 'elements', 'of', 'su3', 'subgroup', 'shows', 'that', 'su3', 'is', 'not', 'the', 'direct', 'cause', 'of', 'temporary', 'confinement', 'in', 'any', 'of', 'the', 'exceptional', 'groups', 'however', 'the', 'trivial', 'potential', 'obtained', 'from', 'the', 'group', 'decomposition', 'to', 'the', 'su3', 'subgroup', 'is', 'the', 'same', 'as', 'the', 'potential', 'of', 'the', 'supergroup', 'itself', 'in', 'addition', 'any', 'regular', 'or', 'singular', 'decomposition', 'to', 'the', 'su2', 'subgroup', 'which', 'produces', 'the', 'cartan', 'generator', 'with', 'the', 'same', 'elements', 'as', 'h_1', 'in', 'any', 'exceptional', 'group', 'leads', 'to', 'the', 'linear', 'intermediate', 'potential', 'of', 'the', 'exceptional', 'gauge', 'groups', 'the', 'other', 'su2', 'decompositions', 'with', 'the', 'cartan', 'generator', 'different', 'from', 'h_1', 'are', 'still', 'able', 'to', 'describe', 'the', 'linear', 'potential', 'if', 'the', 'number', 'of', 'su2', 'nontrivial', 'center', 'element', 'which', 'emerge', 'in', 'the', 'decompositions', 'is', 'the', 'same', 'as', 'a', 'result', 'it', 'is', 'the', 'center', 'vortices', 'quantized', 'in', 'terms', 'of', 'nontrivial', 'center', 'element', 'of', 'the', 'su2', 'subgroup', 'which', 'give', 'rise', 'to', 'the', 'intermediate', 'confinement', 'in', 'the', 'static', 'potentials']] | [-0.14546829907603437, 0.12087306143176052, -0.09340726617514959, 0.03911056182626233, -0.08723796225064595, -0.10653615588972602, 0.01592844481738525, 0.3613007601735921, -0.2926821021587941, -0.2392790347442095, 0.12224308128623243, -0.2552494952968996, -0.09162613833905198, 0.12591547991052784, -0.02928090809266372, -0.034344302546804976, 0.03680402163921952, 0.15363500336815347, -0.10781431519466549, -0.21409772378131586, 0.34310890504977953, -0.020309166918540823, 0.2818326700894275, 0.009872586944076264, 0.08957594435999235, -0.005041929031120099, 0.006893981593371979, -0.03684311035161453, -0.03326192012790953, 0.10756596508521209, 0.23473355065251436, 0.005091664166559048, 0.17842465705350682, -0.3705070675605384, -0.16428870288554803, 0.17870096647951367, 0.15569340959813543, 0.10439866012291468, -0.06770311187850392, -0.29598921412403356, 0.1240559220514742, -0.17621416630271566, -0.19669700763037765, -0.03179597771517804, 0.04376215397195633, -0.033533978474663634, -0.22555331543669033, 0.05507812874215045, 0.03228783935854404, 0.07780257352740215, -0.05382219561755031, -0.13992790102051442, -0.09715486200102846, 0.15746794958249666, 0.046895433956423996, 0.04553239083856922, 0.12599075763413065, -0.1369831697114117, -0.11824887813117098, 0.4529871424902953, -0.049324290766701875, -0.17826498644491698, 0.17012910780914384, -0.19354631874814693, -0.13086281508982084, 0.13526330506007572, 0.08513522186469094, 0.08094303646116871, -0.07761936436496587, 0.18038416190091963, -0.06191909137374625, 0.0871750551139422, 0.0589151193482143, -0.002270695462357253, 0.16007733477905778, 0.08847232757674145, 0.06309106921504155, 0.1128123654215697, 0.006777549453545362, -0.05131959939447778, -0.3655614392462604, -0.12985730640076357, -0.15777737388471624, 0.0745076772061017, -0.13691487791552862, -0.18446191784560456, 0.4384451833200352, 0.05363203377607439, 0.1781621243240681, -0.0006381949657726841, 0.21482474733834508, 0.095732070620529, 0.15437677834616526, 0.0581696626970119, 0.2199021883003799, 0.19879729565080448, -0.035133022642373266, -0.25752943118126936, -0.04956648429426172, 0.14177253139847568] |
1,802.02906 | Improved results on the oscillation of the modulus of the Rudin-Shapiro
polynomials on the unit circle | Let either $R_k(t) := |P_k(e^{it})|^2$ or $R_k(t) := |Q_k(e^{it})|^2$, where
$P_k$ and $Q_k$ are the usual Rudin-Shapiro polynomials of degree $n-1$ with
$n=2^k$. In a recent paper we combined close to sharp upper bounds for the
modulus of the autocorrelation coefficients of the Rudin-Shapiro polynomials
with a deep theorem of Littlewood to prove that there is an absolute constant
$A>0$ such that the equation $R_k(t) = (1+\eta )n$ has at least
$An^{0.5394282}$ distinct zeros in $[0,2\pi)$ whenever $\eta$ is real and
$|\eta| < 2^{-11}$. In this paper we show that the equation $R_k(t)=(1+\eta)n$
has at least $(1/2-|\eta|-\varepsilon)n/2$ distinct zeros in $[0,2\pi)$ for
every $\eta \in (-1/2,1/2)$, $\varepsilon > 0$, and sufficiently large $k \geq
k_{\eta,\varepsilon}$.
| math.CA | let either r_kt p_keit2 or r_kt q_keit2 where p_k and q_k are the usual rudinshapiro polynomials of degree n1 with n2k in a recent paper we combined close to sharp upper bounds for the modulus of the autocorrelation coefficients of the rudinshapiro polynomials with a deep theorem of littlewood to prove that there is an absolute constant a0 such that the equation r_kt 1eta n has at least an05394282 distinct zeros in 02pi whenever eta is real and eta 211 in this paper we show that the equation r_kt1etan has at least 12etavarepsilonn2 distinct zeros in 02pi for every eta in 1212 varepsilon 0 and sufficiently large k geq k_etavarepsilon | [['let', 'either', 'r_kt', 'p_keit2', 'or', 'r_kt', 'q_keit2', 'where', 'p_k', 'and', 'q_k', 'are', 'the', 'usual', 'rudinshapiro', 'polynomials', 'of', 'degree', 'n1', 'with', 'n2k', 'in', 'a', 'recent', 'paper', 'we', 'combined', 'close', 'to', 'sharp', 'upper', 'bounds', 'for', 'the', 'modulus', 'of', 'the', 'autocorrelation', 'coefficients', 'of', 'the', 'rudinshapiro', 'polynomials', 'with', 'a', 'deep', 'theorem', 'of', 'littlewood', 'to', 'prove', 'that', 'there', 'is', 'an', 'absolute', 'constant', 'a0', 'such', 'that', 'the', 'equation', 'r_kt', '1eta', 'n', 'has', 'at', 'least', 'an05394282', 'distinct', 'zeros', 'in', '02pi', 'whenever', 'eta', 'is', 'real', 'and', 'eta', '211', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'equation', 'r_kt1etan', 'has', 'at', 'least', '12etavarepsilonn2', 'distinct', 'zeros', 'in', '02pi', 'for', 'every', 'eta', 'in', '1212', 'varepsilon', '0', 'and', 'sufficiently', 'large', 'k', 'geq', 'k_etavarepsilon']] | [-0.20542176421776487, 0.17971670736523476, -0.08857061388418795, -0.016313255947002638, -0.01287995803151996, -0.1856098156153726, 0.027915154084509525, 0.30763624175988996, -0.27896287184781754, -0.20242311511761868, 0.06589031425895743, -0.35664060034860784, -0.12534269267388692, 0.1622345260268328, -0.043113955426423885, 0.030264736618846655, 0.02122223276931506, 0.13012775176992783, -0.06772884986863713, -0.26014665263490033, 0.28135884820053786, -0.08033936310703911, 0.1109439906431362, 0.04256435537871976, 0.09597173943005216, -0.00918950454510755, 0.05143573846614275, -0.05572973207185546, -0.21521846959785762, 0.03257310511365246, 0.2559372607860356, 0.08271445914914903, 0.27748369857615146, -0.3087595465193982, -0.10175022270917768, 0.24476264535377806, 0.20748321600527, -0.05204593577610257, 0.02542767244561289, -0.19341437258900931, 0.17991279614999747, -0.06221433247506306, -0.1940618752179524, -0.025201060012197837, 0.13418570296086657, 0.03345751576125622, -0.34745306446431923, 0.08882777014514431, 0.08658634592743161, 0.10601177307650617, -0.015364660280353677, -0.248754504349423, 0.005005250532681553, 0.05256113183657782, 0.05904300311857906, 0.11741703719263359, -0.028073518433442447, -0.1110194637596858, -0.07779033242080075, 0.31275796474745643, -0.10255587455601646, -0.20550384370681757, 0.11789290287728924, -0.2487345366882017, -0.19048467713694733, 0.12300088059586975, 0.1156064646739441, 0.1494899862804092, -0.03364524528240928, 0.17170723634066795, -0.11660579194386418, 0.16289941476693806, 0.16390204425596705, 0.00717655876920057, 0.10287656643329403, 0.035271567079829626, 0.0741309001056764, 0.10774719796161382, -0.055567492184659034, -0.011977691234698376, -0.3285561135898416, -0.1702101003880111, -0.22751360931075537, 0.12096590190552749, -0.17857513209995746, -0.13184924033143594, 0.2912122713885485, 0.06488080423038739, 0.2361213223148997, 0.10981802873385067, 0.23210072211133173, 0.15918813115702227, 0.0190676557227002, 0.12716793097878018, 0.14322022291330191, 0.15531107816451156, 0.04156585463967461, -0.16141920947792152, 0.027469535802643243, 0.09707218577386811] |
1,802.02907 | A Game-Theoretic Approach to Design Secure and Resilient Distributed
Support Vector Machines | Distributed Support Vector Machines (DSVM) have been developed to solve
large-scale classification problems in networked systems with a large number of
sensors and control units. However, the systems become more vulnerable as
detection and defense are increasingly difficult and expensive. This work aims
to develop secure and resilient DSVM algorithms under adversarial environments
in which an attacker can manipulate the training data to achieve his objective.
We establish a game-theoretic framework to capture the conflicting interests
between an adversary and a set of distributed data processing units. The Nash
equilibrium of the game allows predicting the outcome of learning algorithms in
adversarial environments, and enhancing the resilience of the machine learning
through dynamic distributed learning algorithms. We prove that the convergence
of the distributed algorithm is guaranteed without assumptions on the training
data or network topologies. Numerical experiments are conducted to corroborate
the results. We show that network topology plays an important role in the
security of DSVM. Networks with fewer nodes and higher average degrees are more
secure. Moreover, a balanced network is found to be less vulnerable to attacks.
| stat.ML cs.LG | distributed support vector machines dsvm have been developed to solve largescale classification problems in networked systems with a large number of sensors and control units however the systems become more vulnerable as detection and defense are increasingly difficult and expensive this work aims to develop secure and resilient dsvm algorithms under adversarial environments in which an attacker can manipulate the training data to achieve his objective we establish a gametheoretic framework to capture the conflicting interests between an adversary and a set of distributed data processing units the nash equilibrium of the game allows predicting the outcome of learning algorithms in adversarial environments and enhancing the resilience of the machine learning through dynamic distributed learning algorithms we prove that the convergence of the distributed algorithm is guaranteed without assumptions on the training data or network topologies numerical experiments are conducted to corroborate the results we show that network topology plays an important role in the security of dsvm networks with fewer nodes and higher average degrees are more secure moreover a balanced network is found to be less vulnerable to attacks | [['distributed', 'support', 'vector', 'machines', 'dsvm', 'have', 'been', 'developed', 'to', 'solve', 'largescale', 'classification', 'problems', 'in', 'networked', 'systems', 'with', 'a', 'large', 'number', 'of', 'sensors', 'and', 'control', 'units', 'however', 'the', 'systems', 'become', 'more', 'vulnerable', 'as', 'detection', 'and', 'defense', 'are', 'increasingly', 'difficult', 'and', 'expensive', 'this', 'work', 'aims', 'to', 'develop', 'secure', 'and', 'resilient', 'dsvm', 'algorithms', 'under', 'adversarial', 'environments', 'in', 'which', 'an', 'attacker', 'can', 'manipulate', 'the', 'training', 'data', 'to', 'achieve', 'his', 'objective', 'we', 'establish', 'a', 'gametheoretic', 'framework', 'to', 'capture', 'the', 'conflicting', 'interests', 'between', 'an', 'adversary', 'and', 'a', 'set', 'of', 'distributed', 'data', 'processing', 'units', 'the', 'nash', 'equilibrium', 'of', 'the', 'game', 'allows', 'predicting', 'the', 'outcome', 'of', 'learning', 'algorithms', 'in', 'adversarial', 'environments', 'and', 'enhancing', 'the', 'resilience', 'of', 'the', 'machine', 'learning', 'through', 'dynamic', 'distributed', 'learning', 'algorithms', 'we', 'prove', 'that', 'the', 'convergence', 'of', 'the', 'distributed', 'algorithm', 'is', 'guaranteed', 'without', 'assumptions', 'on', 'the', 'training', 'data', 'or', 'network', 'topologies', 'numerical', 'experiments', 'are', 'conducted', 'to', 'corroborate', 'the', 'results', 'we', 'show', 'that', 'network', 'topology', 'plays', 'an', 'important', 'role', 'in', 'the', 'security', 'of', 'dsvm', 'networks', 'with', 'fewer', 'nodes', 'and', 'higher', 'average', 'degrees', 'are', 'more', 'secure', 'moreover', 'a', 'balanced', 'network', 'is', 'found', 'to', 'be', 'less', 'vulnerable', 'to', 'attacks']] | [-0.16317179702217202, 0.011981002234153383, -0.06798887585974119, 0.07576827069317398, -0.07830726734789613, -0.21857350724955085, 0.06974594001220899, 0.41726485652931405, -0.26984952317643396, -0.3389399916818623, 0.0941404745842006, -0.26614725409123535, -0.20074774413523958, 0.1794699767124659, -0.1542089355939701, 0.12711607599991132, 0.0733782203725889, 0.03899670960072901, 0.006185344348337439, -0.32637744347657494, 0.3171862170681646, 0.08308719526667621, 0.3311859098371139, 0.011166341698957473, 0.07364233797647635, -0.025409075360776065, -0.009837288604837003, 0.020281660044437162, -0.042725384958716785, 0.1625598002616213, 0.3549730833928559, 0.21768494686806442, 0.3994366332621041, -0.4770278950885597, -0.19628347261443488, 0.16537397445786683, 0.12668434484959554, 0.11347573972114192, -0.041712090604744324, -0.3147126884953484, 0.15195797320882384, -0.18069025830530372, -0.03566926707467322, -0.15393974168421648, -0.02194008323523468, 0.018967684144823097, -0.31977159531339383, -0.03486274917435045, 0.05355842312854504, 0.0760281531845132, -0.03627959187869343, -0.06245707192082596, 0.01615111151509481, 0.16702267862547662, 0.02745255861091762, 0.004990938518360998, 0.17847004994873514, -0.16456727210679273, -0.17786435987182908, 0.3619927392091643, 0.023540269660645097, -0.19218691504297994, 0.21140933083370328, 0.03181937938808201, -0.15678757016459552, 0.1018785753683573, 0.2917044417757685, 0.13322604607111513, -0.15771519245569549, 0.012279667050606, -0.024255761863838737, 0.17893365102315847, -0.003945085145430177, 0.033486143788785894, 0.13654118620157654, 0.21822032051994492, 0.14800285822351705, 0.13387504068540296, -0.06817126297906494, -0.13341693075898603, -0.17988446548848686, -0.106295501137955, -0.18592285888092025, -0.007272252479815104, -0.08554938476918926, -0.13129840980577206, 0.32214859989471734, 0.23530425054139525, 0.17599098022785348, 0.10677344445975302, 0.3611728806686665, 0.021744765220123127, 0.07295591874435307, 0.17718612598203823, 0.22063923777038943, 0.08208007331505336, 0.13247039864220508, -0.1604169832699474, 0.15166677637231532, -0.038147955893626365] |
1,802.02908 | Stability of Ricci de Turck flow on Singular Spaces | In this paper we establish stability of the Ricci de Turck flow near
Ricci-flat metrics with isolated conical singularities. More precisely, we
construct a Ricci de Turck flow which starts sufficiently close to a Ricci-flat
metric with isolated conical singularities and converges to a singular
Ricci-flat metric under an assumption of integrability, linear and tangential
stability. We provide a characterization of conical singularities satisfying
tangential stability and discuss examples where the integrability condition is
satisfied.
| math.DG math.AP math.SP | in this paper we establish stability of the ricci de turck flow near ricciflat metrics with isolated conical singularities more precisely we construct a ricci de turck flow which starts sufficiently close to a ricciflat metric with isolated conical singularities and converges to a singular ricciflat metric under an assumption of integrability linear and tangential stability we provide a characterization of conical singularities satisfying tangential stability and discuss examples where the integrability condition is satisfied | [['in', 'this', 'paper', 'we', 'establish', 'stability', 'of', 'the', 'ricci', 'de', 'turck', 'flow', 'near', 'ricciflat', 'metrics', 'with', 'isolated', 'conical', 'singularities', 'more', 'precisely', 'we', 'construct', 'a', 'ricci', 'de', 'turck', 'flow', 'which', 'starts', 'sufficiently', 'close', 'to', 'a', 'ricciflat', 'metric', 'with', 'isolated', 'conical', 'singularities', 'and', 'converges', 'to', 'a', 'singular', 'ricciflat', 'metric', 'under', 'an', 'assumption', 'of', 'integrability', 'linear', 'and', 'tangential', 'stability', 'we', 'provide', 'a', 'characterization', 'of', 'conical', 'singularities', 'satisfying', 'tangential', 'stability', 'and', 'discuss', 'examples', 'where', 'the', 'integrability', 'condition', 'is', 'satisfied']] | [-0.2584328839105243, 0.021466986513890635, -0.15926510763665042, 0.09614082507789135, -0.15099257150664924, -0.1831119385485848, -0.10317931023581574, 0.3155135462184747, -0.19174403212964536, -0.14296639713148276, 0.1462082499374325, -0.29703291442245244, -0.16590572734673817, 0.09800491955131292, -0.1366687469681104, 0.057201360824207466, 0.07791590709239245, 0.07026086305306914, -0.13581595660497744, -0.24476677500953278, 0.4829176310698191, 0.04768695668627818, 0.2668184565504392, 0.08593681787683939, 0.1661432125295202, -0.07002845882127683, 0.07586234174668789, 0.0879357902954022, -0.2928310005366802, 0.053286700366685785, 0.23051339540630578, 0.061049897621075315, 0.20885024992128212, -0.3772577622284492, -0.18619090748329958, 0.16637330517793694, 0.11340539287775755, 0.06840008424129337, -0.052616944540641274, -0.29772917985916136, 0.17243769540761908, -0.06139562952021758, -0.32201932278616974, -0.09699575219303369, -0.06720931693911553, 0.01772393467525641, -0.22611025153348843, 0.08080385339756807, 0.1441141508271297, 0.06403246313333512, -0.09165021929269036, 0.03792360577732325, -0.10658754295359055, 0.008048993200063706, 0.06777949711618324, 0.02005738714709878, 0.06547654597088695, -0.09240394035897528, -0.05035803663233916, 0.32204107494714357, -0.11479789658139149, -0.2778652204324802, 0.14364423002426824, -0.12410927537207803, -0.10508529183765253, 0.12321852986390391, 0.1194823188893497, 0.2254853323722879, -0.07082633287024995, 0.1395124890631996, 0.027377973161637783, 0.03685895306368669, 0.2259671983247002, -0.0011142779824634393, 0.15563748640939593, 0.09559600569307804, 0.20802764468515914, 0.1329414636765917, 0.00013683147728443145, -0.09863800074905157, -0.4091879524787267, -0.19769683975726365, -0.09806531260410944, 0.24097413208335638, -0.18764734758005944, -0.24928981366256872, 0.3531453451762597, -0.011663035079836846, 0.2101625998194019, 0.11327015556550274, 0.23233635236819586, 0.022762688621878625, -0.06404804099972049, 0.1574475400087734, 0.25552289103468256, 0.1801020235940814, 0.10242632700751225, -0.1505883088770012, -0.07818684658035636, 0.13631042243291935] |
1,802.02909 | Spin-Orbital Excitations in Ca$_{2}$RuO$_4$ Revealed by Resonant
Inelastic X-ray Scattering | The strongly correlated insulator Ca$_{2}$RuO$_4$ is considered as a
paradigmatic realization of both spin-orbital physics and a band-Mott
insulating phase, characterized by orbitally selective coexistence of a band
and a Mott gap. We present a high-resolution oxygen $K$-edge resonant inelastic
X-ray scattering study of the antiferromagnetic Mott insulating state of
Ca$_{2}$RuO$_4$. A set of low-energy ($\sim$80 and 400 meV) and high-energy
($\sim$1.3 and 2.2 eV) excitations are reported that show strong incident light
polarization dependence. Our results strongly support a spin-orbit coupled
band-Mott scenario and explore in detail the nature of its exotic excitations.
Guided by theoretical modelling, we interpret the low-energy excitations as a
result of composite spin-orbital excitations. Their nature unveil the intricate
interplay of crystal-field splitting and spin-orbit coupling in the band-Mott
scenario. The high-energy excitations correspond to intra-atomic
singlet-triplet transitions at an energy scale set by the Hund's coupling. Our
findings give a unifying picture of the spin and orbital excitations in the
band-Mott insulator Ca$_{2}$RuO$_4$.
| cond-mat.str-el | the strongly correlated insulator ca_2ruo_4 is considered as a paradigmatic realization of both spinorbital physics and a bandmott insulating phase characterized by orbitally selective coexistence of a band and a mott gap we present a highresolution oxygen kedge resonant inelastic xray scattering study of the antiferromagnetic mott insulating state of ca_2ruo_4 a set of lowenergy sim80 and 400 mev and highenergy sim13 and 22 ev excitations are reported that show strong incident light polarization dependence our results strongly support a spinorbit coupled bandmott scenario and explore in detail the nature of its exotic excitations guided by theoretical modelling we interpret the lowenergy excitations as a result of composite spinorbital excitations their nature unveil the intricate interplay of crystalfield splitting and spinorbit coupling in the bandmott scenario the highenergy excitations correspond to intraatomic singlettriplet transitions at an energy scale set by the hunds coupling our findings give a unifying picture of the spin and orbital excitations in the bandmott insulator ca_2ruo_4 | [['the', 'strongly', 'correlated', 'insulator', 'ca_2ruo_4', 'is', 'considered', 'as', 'a', 'paradigmatic', 'realization', 'of', 'both', 'spinorbital', 'physics', 'and', 'a', 'bandmott', 'insulating', 'phase', 'characterized', 'by', 'orbitally', 'selective', 'coexistence', 'of', 'a', 'band', 'and', 'a', 'mott', 'gap', 'we', 'present', 'a', 'highresolution', 'oxygen', 'kedge', 'resonant', 'inelastic', 'xray', 'scattering', 'study', 'of', 'the', 'antiferromagnetic', 'mott', 'insulating', 'state', 'of', 'ca_2ruo_4', 'a', 'set', 'of', 'lowenergy', 'sim80', 'and', '400', 'mev', 'and', 'highenergy', 'sim13', 'and', '22', 'ev', 'excitations', 'are', 'reported', 'that', 'show', 'strong', 'incident', 'light', 'polarization', 'dependence', 'our', 'results', 'strongly', 'support', 'a', 'spinorbit', 'coupled', 'bandmott', 'scenario', 'and', 'explore', 'in', 'detail', 'the', 'nature', 'of', 'its', 'exotic', 'excitations', 'guided', 'by', 'theoretical', 'modelling', 'we', 'interpret', 'the', 'lowenergy', 'excitations', 'as', 'a', 'result', 'of', 'composite', 'spinorbital', 'excitations', 'their', 'nature', 'unveil', 'the', 'intricate', 'interplay', 'of', 'crystalfield', 'splitting', 'and', 'spinorbit', 'coupling', 'in', 'the', 'bandmott', 'scenario', 'the', 'highenergy', 'excitations', 'correspond', 'to', 'intraatomic', 'singlettriplet', 'transitions', 'at', 'an', 'energy', 'scale', 'set', 'by', 'the', 'hunds', 'coupling', 'our', 'findings', 'give', 'a', 'unifying', 'picture', 'of', 'the', 'spin', 'and', 'orbital', 'excitations', 'in', 'the', 'bandmott', 'insulator', 'ca_2ruo_4']] | [-0.20728581872826907, 0.26285786842499875, -0.033288511712453325, 0.1029115913224814, -0.05969778344970109, -0.15015530198143096, 0.12450396102358355, 0.36996071981848216, -0.2381500706425868, -0.3061556370696053, -0.05212752018633182, -0.33609406067116654, -0.11391033154795878, 0.11187221862419391, 0.1149458286643494, -0.048490280687474296, -0.006360158331153798, -0.11933585581136867, -0.07019031746167456, -0.14360020130334306, 0.29083139140857384, 0.013469146899296902, 0.2717204177941312, 0.14836014745451392, 0.0011962623364524915, 0.03860646918328712, 0.14091714170644992, -0.04761917419236852, -0.14111820431594424, 0.06832504614430945, 0.2862487569625955, -0.11076988659333438, 0.16515116285299883, -0.39151588077656924, -0.1845072429307038, -0.043154721907922064, 0.14870743458668584, 0.1335883457446471, -0.0744471599231474, -0.3389885453274474, -0.046889872230531184, -0.2059398667071946, -0.15127103606027958, -0.14095270874386187, -0.033812569387373516, -0.04546720289326913, -0.23731280708161648, 0.08742563557752873, 0.07590875202586175, 0.08200349514954723, -0.12319924116291077, -0.10435105848882813, -0.10955900801054667, 0.0005964786949334666, 0.04816597219614778, 0.03825746236689156, 0.10178008946677437, -0.11886482399568195, -0.1624630232749041, 0.3838594435517734, -0.046830899866472465, -0.036742849502479656, 0.18446337751229294, -0.17043752831814346, -0.07471884062688332, 0.20867622764781119, 0.0982587522121321, 0.09598048011539503, -0.09928487896977459, 0.09579730463738087, -0.04580526256177109, 0.20451953196898104, -0.03528772591962479, 0.17657703727454646, 0.31238664557458834, 0.22277514925517608, 0.005400871025631204, 0.12484369993471774, -0.12489758024530602, -0.06950697072024922, -0.24701745931233746, -0.10246833673445507, -0.23163437567127404, 0.07283248303137953, -0.02982589797975379, -0.15373452547937633, 0.43303667961154135, 0.11149397677509114, 0.19640060515448568, -0.09889479252888123, 0.19593893619603478, 0.09202651668329054, -0.013212179807305801, 0.006347032642224804, 0.3165647564572282, 0.20411859489249765, 0.10383803842632915, -0.3451500136186951, 0.011653346782986773, 0.0033684850845020265] |
1,802.0291 | Sur l'hyperbolicit\'e de graphes associ\'es au groupe de Cremona | To reinforce the analogy between the mapping class group and the Cremona
group of rank $2$ over an algebraic closed field, we look for a graph
analoguous to the curve graph and such that the Cremona group acts on it
non-trivially. A candidate is a graph introduced by D. Wright. However, we
demonstrate that it is not Gromov-hyperbolic. This answers a question of A.
Minasyan and D. Osin. Then, we construct two graphs associated to a Vorono\"i
tesselation of the Cremona group introduced in a previous work of the autor. We
show that one is quasi-isometric to the Wright graph. We prove that the second
one is Gromov-hyperbolic.
| math.GR math.AG | to reinforce the analogy between the mapping class group and the cremona group of rank 2 over an algebraic closed field we look for a graph analoguous to the curve graph and such that the cremona group acts on it nontrivially a candidate is a graph introduced by d wright however we demonstrate that it is not gromovhyperbolic this answers a question of a minasyan and d osin then we construct two graphs associated to a voronoi tesselation of the cremona group introduced in a previous work of the autor we show that one is quasiisometric to the wright graph we prove that the second one is gromovhyperbolic | [['to', 'reinforce', 'the', 'analogy', 'between', 'the', 'mapping', 'class', 'group', 'and', 'the', 'cremona', 'group', 'of', 'rank', '2', 'over', 'an', 'algebraic', 'closed', 'field', 'we', 'look', 'for', 'a', 'graph', 'analoguous', 'to', 'the', 'curve', 'graph', 'and', 'such', 'that', 'the', 'cremona', 'group', 'acts', 'on', 'it', 'nontrivially', 'a', 'candidate', 'is', 'a', 'graph', 'introduced', 'by', 'd', 'wright', 'however', 'we', 'demonstrate', 'that', 'it', 'is', 'not', 'gromovhyperbolic', 'this', 'answers', 'a', 'question', 'of', 'a', 'minasyan', 'and', 'd', 'osin', 'then', 'we', 'construct', 'two', 'graphs', 'associated', 'to', 'a', 'voronoi', 'tesselation', 'of', 'the', 'cremona', 'group', 'introduced', 'in', 'a', 'previous', 'work', 'of', 'the', 'autor', 'we', 'show', 'that', 'one', 'is', 'quasiisometric', 'to', 'the', 'wright', 'graph', 'we', 'prove', 'that', 'the', 'second', 'one', 'is', 'gromovhyperbolic']] | [-0.16404990196503974, 0.053474446841762446, -0.13532000364890942, 0.048062535976189084, -0.15160760484825545, -0.10264644325555612, 0.04171031454785003, 0.39089739425280307, -0.3003555664197645, -0.24717611671183948, 0.09042639217740442, -0.2869605316470067, -0.20872858730231034, 0.1841840730652351, -0.14376746619948083, -0.025166038768710913, 0.02047179389262089, 0.109641226215495, -0.027219044574950304, -0.30616157381747916, 0.36973234321232196, -0.03637572950079899, 0.20115784205565299, 0.03992766478202409, 0.12221207280850245, 0.026301720332143036, -0.03180671006837791, 0.04707901179790497, -0.14302647693424392, 0.11194021285660306, 0.24591980126031018, 0.13356427749386057, 0.23663407828037938, -0.32009551936277636, -0.20234818545308103, 0.18072857289506053, 0.08853869142142314, 0.04908963188494521, -0.02781131165856668, -0.2699248893531384, 0.11737077316717694, -0.15700331773539936, -0.0995068610171546, -0.04199401517986122, 0.08502790263931577, -0.029431657174697007, -0.22736841187105272, -0.05692125500731722, 0.14871492811168233, 0.07681991741992533, -0.0030487754524478484, -0.050755740293189536, -0.029837625743648795, 0.11431412250062244, -0.016814592768679613, 0.1273393510470029, 0.06192831038411155, -0.0735599964714816, -0.10938305887221186, 0.4090666332825397, -0.05378040226383342, -0.1831805625050846, 0.15203277606310117, -0.15186676055762088, -0.20210661625606008, 0.07529771756553263, 0.11540851531619276, 0.11501571656386929, -0.06644696598286154, 0.14540434815690215, -0.1590619150687147, 0.14133754408491464, 0.07527280160812316, -0.08721839732283519, 0.07308296360564849, 0.09748651833635652, 0.10988049305699489, 0.15442034102872843, 0.00985250801130422, 0.012402958960996734, -0.28434707084670663, -0.21771897768377568, -0.18478478480958277, 0.08413575907279328, -0.09566516207093999, -0.16823608470494272, 0.43468018383201623, 0.11441201175976959, 0.18834270717990068, 0.099914696196922, 0.19310008317525326, 0.027941699777902278, 0.04002179490850755, 0.13392221971621943, 0.13391712035216322, 0.1630356807576458, -0.04600806258019508, -0.16132157112830706, -0.02047114531268124, 0.1969498550536594] |
1,802.02911 | Event-by-Event Efficiency Fluctuations and Efficiency Correction for
Cumulants of Superposed Multiplicity Distributions in Relativistic Heavy-ion
Collision Experiments | We performed systematic studies on the effects of event-by-event efficiency
fluctuations on efficiency correction for cumulant analysis in relativistic
heavy-ion collision experiments. Experimentally, particle efficiencies of
events measured under different experimental conditions should be different.
For fluctuation measurements, the final event-by-event multiplicity
distributions should be the superposed distributions of various type of events
measured under different conditions. We demonstrate efficiency fluctuation
effects using numerical simulation, in which we construct an event ensemble
consisting of events with two different efficiencies. By using the mean
particle efficiencies, we find that the efficiency corrected cumulants show
large deviations from the original inputs when the discrepancy between the two
efficiencies is large. We further studied the effects of efficiency
fluctuations for the cumulants of net-proton distributions by implementing the
UrQMD events of Au+Au collisions at $\sqrt{s_{NN}}=7.7$ GeV in a realistic STAR
detector acceptance. We consider the unequal efficiency in two sides of the
Time Projection Chamber (TPC), multiplicity dependent efficiency, and the
event-by-event variations of the collision vertex position along the
longitudinal direction ($V_\mathrm{z}$). When the efficiencies fluctuate
dramatically within the studied event sample, the effects of efficiency
fluctuations have significant impacts on the efficiency corrections of
cumulants with the mean efficiency. We find that this effect can be effectively
suppressed by binning the entire event ensemble into various sub-event samples,
in which the efficiency variations are relatively small. The final efficiency
corrected cumulants can be calculated from the weighted average of the
corrected factorial moments of the sub-event samples with the mean efficiency.
| physics.data-an hep-ex hep-lat hep-ph hep-th nucl-th | we performed systematic studies on the effects of eventbyevent efficiency fluctuations on efficiency correction for cumulant analysis in relativistic heavyion collision experiments experimentally particle efficiencies of events measured under different experimental conditions should be different for fluctuation measurements the final eventbyevent multiplicity distributions should be the superposed distributions of various type of events measured under different conditions we demonstrate efficiency fluctuation effects using numerical simulation in which we construct an event ensemble consisting of events with two different efficiencies by using the mean particle efficiencies we find that the efficiency corrected cumulants show large deviations from the original inputs when the discrepancy between the two efficiencies is large we further studied the effects of efficiency fluctuations for the cumulants of netproton distributions by implementing the urqmd events of auau collisions at sqrts_nn77 gev in a realistic star detector acceptance we consider the unequal efficiency in two sides of the time projection chamber tpc multiplicity dependent efficiency and the eventbyevent variations of the collision vertex position along the longitudinal direction v_mathrmz when the efficiencies fluctuate dramatically within the studied event sample the effects of efficiency fluctuations have significant impacts on the efficiency corrections of cumulants with the mean efficiency we find that this effect can be effectively suppressed by binning the entire event ensemble into various subevent samples in which the efficiency variations are relatively small the final efficiency corrected cumulants can be calculated from the weighted average of the corrected factorial moments of the subevent samples with the mean efficiency | [['we', 'performed', 'systematic', 'studies', 'on', 'the', 'effects', 'of', 'eventbyevent', 'efficiency', 'fluctuations', 'on', 'efficiency', 'correction', 'for', 'cumulant', 'analysis', 'in', 'relativistic', 'heavyion', 'collision', 'experiments', 'experimentally', 'particle', 'efficiencies', 'of', 'events', 'measured', 'under', 'different', 'experimental', 'conditions', 'should', 'be', 'different', 'for', 'fluctuation', 'measurements', 'the', 'final', 'eventbyevent', 'multiplicity', 'distributions', 'should', 'be', 'the', 'superposed', 'distributions', 'of', 'various', 'type', 'of', 'events', 'measured', 'under', 'different', 'conditions', 'we', 'demonstrate', 'efficiency', 'fluctuation', 'effects', 'using', 'numerical', 'simulation', 'in', 'which', 'we', 'construct', 'an', 'event', 'ensemble', 'consisting', 'of', 'events', 'with', 'two', 'different', 'efficiencies', 'by', 'using', 'the', 'mean', 'particle', 'efficiencies', 'we', 'find', 'that', 'the', 'efficiency', 'corrected', 'cumulants', 'show', 'large', 'deviations', 'from', 'the', 'original', 'inputs', 'when', 'the', 'discrepancy', 'between', 'the', 'two', 'efficiencies', 'is', 'large', 'we', 'further', 'studied', 'the', 'effects', 'of', 'efficiency', 'fluctuations', 'for', 'the', 'cumulants', 'of', 'netproton', 'distributions', 'by', 'implementing', 'the', 'urqmd', 'events', 'of', 'auau', 'collisions', 'at', 'sqrts_nn77', 'gev', 'in', 'a', 'realistic', 'star', 'detector', 'acceptance', 'we', 'consider', 'the', 'unequal', 'efficiency', 'in', 'two', 'sides', 'of', 'the', 'time', 'projection', 'chamber', 'tpc', 'multiplicity', 'dependent', 'efficiency', 'and', 'the', 'eventbyevent', 'variations', 'of', 'the', 'collision', 'vertex', 'position', 'along', 'the', 'longitudinal', 'direction', 'v_mathrmz', 'when', 'the', 'efficiencies', 'fluctuate', 'dramatically', 'within', 'the', 'studied', 'event', 'sample', 'the', 'effects', 'of', 'efficiency', 'fluctuations', 'have', 'significant', 'impacts', 'on', 'the', 'efficiency', 'corrections', 'of', 'cumulants', 'with', 'the', 'mean', 'efficiency', 'we', 'find', 'that', 'this', 'effect', 'can', 'be', 'effectively', 'suppressed', 'by', 'binning', 'the', 'entire', 'event', 'ensemble', 'into', 'various', 'subevent', 'samples', 'in', 'which', 'the', 'efficiency', 'variations', 'are', 'relatively', 'small', 'the', 'final', 'efficiency', 'corrected', 'cumulants', 'can', 'be', 'calculated', 'from', 'the', 'weighted', 'average', 'of', 'the', 'corrected', 'factorial', 'moments', 'of', 'the', 'subevent', 'samples', 'with', 'the', 'mean', 'efficiency']] | [-0.08720836440198512, 0.1784271713684385, -0.13719987007976325, 0.13187094345449443, 0.061394647713825405, -0.026010747813810426, -0.006040165795529464, 0.36211227449068584, -0.20106680045300818, -0.34923789560435764, 0.013577138387455967, -0.3244500714929281, 0.025617319267677015, 0.1921991953817028, -0.019538786626013226, 0.08274493860006032, 0.14163294899086637, -0.007799191426590504, -0.09958012821573585, -0.23564757691812235, 0.2781771132526134, 0.1575732705357249, 0.33136961360947775, 0.07800741788433738, 0.12140125388384285, 0.024244186657305104, -0.047257224258678746, 0.07087575406748726, -0.12949754703766805, 0.03278333844252802, 0.22330005268891712, 0.0658197211546741, 0.18719385006749276, -0.4016186262528077, -0.19066610689981875, 0.12623012027362862, 0.12893906574094122, 0.07363642619870861, -0.07855070126850726, -0.24391587210602192, 0.09886986410047066, -0.22389468560032696, -0.09591640110677445, -0.030748609514218796, -0.0006847209418678738, 0.10321710220571742, -0.2937038139885209, 0.16543141551162435, 0.016826568219070154, 0.061191864832992625, 0.0013863650547063734, -0.17173171283146105, -0.03322320114204054, 0.09215450156797995, 0.04585795216582599, -0.047452185546089126, 0.21123859029353023, -0.12111706669086096, -0.15359063632505754, 0.3296228599020216, -0.05524711605735557, -0.2167742347165224, 0.12046286509555566, -0.23453111987538547, -0.10772170417616705, 0.1599725931864157, 0.23622852651566925, 0.12871787525773287, -0.16249705136467957, -0.021204182369696224, 0.05275890988907422, 0.1599496791436595, 0.06361770706090433, 0.04520385482079203, 0.20014781658967815, 0.14604106142412848, -0.014758233608393723, 0.16593093695069933, -0.1761023502209669, -0.11108728756858821, -0.3289452139512602, -0.09737329184634977, -0.15292474820398272, 0.015499318625411415, -0.14107264597224864, -0.06485139830299769, 0.3948054747079989, 0.192734403200416, 0.22174389139621942, 0.017258252517458605, 0.298595263933142, 0.13717539341003826, 0.059779714579538755, 0.03903624998409316, 0.2707034428884466, 0.09822155601330042, 0.11020591485185033, -0.2901550178980851, 0.09232184855009329, 0.03281358152583062] |
1,802.02912 | Fast Fiber Orientation Estimation in Diffusion MRI from kq-Space
Sampling and Anatomical Priors | High spatio-angular resolution diffusion MRI (dMRI) has been shown to provide
accurate identification of complex neuronal fiber configurations, albeit, at
the cost of long acquisition times. We propose a method to recover intra-voxel
fiber configurations at high spatio-angular resolution relying on a 3D kq-space
under-sampling scheme to enable accelerated acquisitions. Simulations and real
data analysis suggest that accurate FOD mapping can be achieved from severe
kq-space under-sampling regimes potentially enabling high spatio-angular
resolution dMRI in the clinical setting.
| eess.IV physics.med-ph | high spatioangular resolution diffusion mri dmri has been shown to provide accurate identification of complex neuronal fiber configurations albeit at the cost of long acquisition times we propose a method to recover intravoxel fiber configurations at high spatioangular resolution relying on a 3d kqspace undersampling scheme to enable accelerated acquisitions simulations and real data analysis suggest that accurate fod mapping can be achieved from severe kqspace undersampling regimes potentially enabling high spatioangular resolution dmri in the clinical setting | [['high', 'spatioangular', 'resolution', 'diffusion', 'mri', 'dmri', 'has', 'been', 'shown', 'to', 'provide', 'accurate', 'identification', 'of', 'complex', 'neuronal', 'fiber', 'configurations', 'albeit', 'at', 'the', 'cost', 'of', 'long', 'acquisition', 'times', 'we', 'propose', 'a', 'method', 'to', 'recover', 'intravoxel', 'fiber', 'configurations', 'at', 'high', 'spatioangular', 'resolution', 'relying', 'on', 'a', '3d', 'kqspace', 'undersampling', 'scheme', 'to', 'enable', 'accelerated', 'acquisitions', 'simulations', 'and', 'real', 'data', 'analysis', 'suggest', 'that', 'accurate', 'fod', 'mapping', 'can', 'be', 'achieved', 'from', 'severe', 'kqspace', 'undersampling', 'regimes', 'potentially', 'enabling', 'high', 'spatioangular', 'resolution', 'dmri', 'in', 'the', 'clinical', 'setting']] | [-0.07229507870178144, 0.015258620839374952, -0.06982394073827144, 0.04754525263948987, -0.05596583482857125, -0.18652322404802993, -0.011115386497038297, 0.456422879300916, -0.2418057375993484, -0.30643327481662613, 0.14203895006227332, -0.17779869241162372, -0.11609311483036248, 0.23864078318747955, -0.13037780853800285, 0.07430205491777414, 0.16399840572968316, -0.0438293097925056, -0.062474792513500854, -0.17836232094141918, 0.17262197921249586, 0.11790590995970444, 0.36632150233699345, -0.006882781928512626, 0.213624720427339, -0.010910458504580535, -0.0399440072882825, 0.0029375904884475926, -0.10109456533385898, 0.12577278338647327, 0.33233373237248415, 0.12745025645619115, 0.2674206193918601, -0.4392403254333215, -0.29642758985312706, 0.07189143880103262, 0.1972629414835515, 0.11832774843638524, -0.04028184681635302, -0.3003065828950359, 0.1301785093838146, -0.10787671498763256, -0.08324175850989726, -0.19515353466610974, -0.0815735149782342, -0.01681289994993653, -0.3547501565816884, 0.12047634876589888, -0.0603281072824477, 0.12479651944998366, -0.036156943945500716, -0.03941733078457988, 0.0511738575863628, 0.1268169037051475, -0.019944752375475872, 0.06559304624366072, 0.11937502902359344, -0.13864229078918028, -0.0852620442224762, 0.3191220827687245, 0.014289787397361718, -0.20296025414688465, 0.23765422094565553, -0.1885979171627416, -0.09352991939522326, 0.28467972493037963, 0.20696838296806583, 0.09794509136834396, -0.08215892569233592, 0.011499479871977551, 0.08363314391149637, 0.20484090071076003, 0.10975131054576008, 0.034279734785787955, 0.12579929631931755, 0.23506140193113914, 0.057551982114091516, 0.05813786745943034, -0.20872195193675372, 0.0038227600355943045, -0.14885138818182242, -0.10262284147551654, -0.17560479645497906, 0.08473642516839437, -0.12922866972598385, -0.09305402633057944, 0.32589796523261144, 0.17663706582970917, 0.20048488481925467, 0.036506914641135015, 0.36991511094861496, 0.05221871994376087, 0.09699904697780044, -0.026455309346485406, 0.16519347592615163, 0.0886599361980095, 0.14045619301330775, -0.20438325300944063, 0.03552264391253583, 0.007481972113824808] |
1,802.02913 | Towards the First Catalog of Fermi-LAT sources below 100 MeV | Previous analyses of point sources in the gamma-ray range were done either
below 30 MeV or above 100 MeV. Below 30 MeV, the imaging Compton telescope
(COMPTEL) onboard NASA's Compton Gamma-Ray Observatory detected 26 steady
sources in the energy range from 0.75 to 30 MeV. At high energy, the Fermi
Large Area Telescope (LAT) has detected more than three thousand sources
between 100 MeV and 300 GeV. Since the Fermi LAT detects gamma rays also below
100 MeV, we apply a point source detection algorithm in the energy range
between 30 MeV and 100 MeV. In the analysis we use PGWave, which is a
background independent tool based on a wavelet transform.
| astro-ph.IM astro-ph.HE | previous analyses of point sources in the gammaray range were done either below 30 mev or above 100 mev below 30 mev the imaging compton telescope comptel onboard nasas compton gammaray observatory detected 26 steady sources in the energy range from 075 to 30 mev at high energy the fermi large area telescope lat has detected more than three thousand sources between 100 mev and 300 gev since the fermi lat detects gamma rays also below 100 mev we apply a point source detection algorithm in the energy range between 30 mev and 100 mev in the analysis we use pgwave which is a background independent tool based on a wavelet transform | [['previous', 'analyses', 'of', 'point', 'sources', 'in', 'the', 'gammaray', 'range', 'were', 'done', 'either', 'below', '30', 'mev', 'or', 'above', '100', 'mev', 'below', '30', 'mev', 'the', 'imaging', 'compton', 'telescope', 'comptel', 'onboard', 'nasas', 'compton', 'gammaray', 'observatory', 'detected', '26', 'steady', 'sources', 'in', 'the', 'energy', 'range', 'from', '075', 'to', '30', 'mev', 'at', 'high', 'energy', 'the', 'fermi', 'large', 'area', 'telescope', 'lat', 'has', 'detected', 'more', 'than', 'three', 'thousand', 'sources', 'between', '100', 'mev', 'and', '300', 'gev', 'since', 'the', 'fermi', 'lat', 'detects', 'gamma', 'rays', 'also', 'below', '100', 'mev', 'we', 'apply', 'a', 'point', 'source', 'detection', 'algorithm', 'in', 'the', 'energy', 'range', 'between', '30', 'mev', 'and', '100', 'mev', 'in', 'the', 'analysis', 'we', 'use', 'pgwave', 'which', 'is', 'a', 'background', 'independent', 'tool', 'based', 'on', 'a', 'wavelet', 'transform']] | [-0.04319225068008693, 0.26792215400408687, 0.003573875782811748, 0.17229041284736013, -0.07152066336753446, -0.10133676265416268, 0.13694442538118373, 0.4406227159446904, -0.18430441364762373, -0.49330345090960953, 0.01680051803123206, -0.41786954206431154, 0.08319006104180257, 0.3226449353699406, 0.10034089740448897, -0.008136254161529775, 0.10022448729640539, -0.05454999092866534, -0.06141843508729445, -0.15959802095104741, 0.22446793361034775, 0.20910129472447028, 0.26005679356499706, 0.11076599851782833, 0.12762167932149687, -0.04222930942653745, -0.014337976429877537, -0.1400031693712143, -0.09218579566472077, 0.013167804199578572, 0.2902758138453854, 0.027985975323450214, 0.2030377959267103, -0.27321098861284554, -0.2218634632050193, 0.1124064811280862, 0.10316419958170238, -0.09183815449796384, 0.008629265204295475, -0.35260827194101046, 0.09342307853928235, -0.18160264880862087, -0.19204778676170722, 0.06122229847200548, -0.014237536391842045, -0.030280694461128275, -0.09217994898374725, 0.09716553481510866, -0.08490704728423484, 0.10719040994133268, -0.15965024216815696, -0.15795978509621428, 0.07120497807461236, -0.014066073767025955, 0.030473820463937176, 0.12103655808563676, 0.19527033845744363, -0.03326483421759414, -0.06742238219261967, 0.3427208104569997, -0.05676755999762203, 0.019268530379382094, 0.13767992284140615, -0.2020650068048521, -0.1591084488567763, 0.32672242624019937, 0.15615612201093296, 0.07677488279296085, -0.18527612877993047, 0.0808670695893982, 0.03348925528449139, 0.2967076954690648, 0.13637385816712463, -0.0019530750827730767, 0.20583555964445363, 0.18264088288716657, 0.07269589071594444, 0.07134531034223203, -0.3898546374049537, 0.012597256207040377, -0.28323692753994173, -0.044419853490710794, -0.1629396700799199, 0.13843374732719635, -0.0628548339588763, -0.025278466348806563, 0.3831252762216276, 0.1150426477667809, 0.17706127022600932, 0.0007498918847496887, 0.28373304781104836, 0.035027457118433504, 0.0980647662280327, 0.1375422524995104, 0.36337390068053665, 0.077914319379488, 0.16860316902914615, -0.0561941428022692, -0.08073987189813384, -0.07540508604142815] |
1,802.02914 | Praaline: Integrating Tools for Speech Corpus Research | This paper presents Praaline, an open-source software system for managing,
annotating, analysing and visualising speech corpora. Researchers working with
speech corpora are often faced with multiple tools and formats, and they need
to work with ever-increasing amounts of data in a collaborative way. Praaline
integrates and extends existing time-proven tools for spoken corpora analysis
(Praat, Sonic Visualiser and a bridge to the R statistical package) in a
modular system, facilitating automation and reuse. Users are exposed to an
integrated, user-friendly interface from which to access multiple tools. Corpus
metadata and annotations may be stored in a database, locally or remotely, and
users can define the metadata and annotation structure. Users may run a
customisable cascade of analysis steps, based on plug-ins and scripts, and
update the database with the results. The corpus database may be queried, to
produce aggregated data-sets. Praaline is extensible using Python or C++
plug-ins, while Praat and R scripts may be executed against the corpus data. A
series of visualisations, editors and plug-ins are provided. Praaline is free
software, released under the GPL license.
| cs.CL cs.DB | this paper presents praaline an opensource software system for managing annotating analysing and visualising speech corpora researchers working with speech corpora are often faced with multiple tools and formats and they need to work with everincreasing amounts of data in a collaborative way praaline integrates and extends existing timeproven tools for spoken corpora analysis praat sonic visualiser and a bridge to the r statistical package in a modular system facilitating automation and reuse users are exposed to an integrated userfriendly interface from which to access multiple tools corpus metadata and annotations may be stored in a database locally or remotely and users can define the metadata and annotation structure users may run a customisable cascade of analysis steps based on plugins and scripts and update the database with the results the corpus database may be queried to produce aggregated datasets praaline is extensible using python or c plugins while praat and r scripts may be executed against the corpus data a series of visualisations editors and plugins are provided praaline is free software released under the gpl license | [['this', 'paper', 'presents', 'praaline', 'an', 'opensource', 'software', 'system', 'for', 'managing', 'annotating', 'analysing', 'and', 'visualising', 'speech', 'corpora', 'researchers', 'working', 'with', 'speech', 'corpora', 'are', 'often', 'faced', 'with', 'multiple', 'tools', 'and', 'formats', 'and', 'they', 'need', 'to', 'work', 'with', 'everincreasing', 'amounts', 'of', 'data', 'in', 'a', 'collaborative', 'way', 'praaline', 'integrates', 'and', 'extends', 'existing', 'timeproven', 'tools', 'for', 'spoken', 'corpora', 'analysis', 'praat', 'sonic', 'visualiser', 'and', 'a', 'bridge', 'to', 'the', 'r', 'statistical', 'package', 'in', 'a', 'modular', 'system', 'facilitating', 'automation', 'and', 'reuse', 'users', 'are', 'exposed', 'to', 'an', 'integrated', 'userfriendly', 'interface', 'from', 'which', 'to', 'access', 'multiple', 'tools', 'corpus', 'metadata', 'and', 'annotations', 'may', 'be', 'stored', 'in', 'a', 'database', 'locally', 'or', 'remotely', 'and', 'users', 'can', 'define', 'the', 'metadata', 'and', 'annotation', 'structure', 'users', 'may', 'run', 'a', 'customisable', 'cascade', 'of', 'analysis', 'steps', 'based', 'on', 'plugins', 'and', 'scripts', 'and', 'update', 'the', 'database', 'with', 'the', 'results', 'the', 'corpus', 'database', 'may', 'be', 'queried', 'to', 'produce', 'aggregated', 'datasets', 'praaline', 'is', 'extensible', 'using', 'python', 'or', 'c', 'plugins', 'while', 'praat', 'and', 'r', 'scripts', 'may', 'be', 'executed', 'against', 'the', 'corpus', 'data', 'a', 'series', 'of', 'visualisations', 'editors', 'and', 'plugins', 'are', 'provided', 'praaline', 'is', 'free', 'software', 'released', 'under', 'the', 'gpl', 'license']] | [-0.10966099873395627, 8.053672358546259e-05, -0.07313675582961385, 0.05505998036758395, -0.17621395616308067, -0.21385907255491968, 0.025105779754434645, 0.42286950661300937, -0.27009828298715716, -0.37570780461277853, 0.10924106840857194, -0.3445664397348771, -0.02301850207320988, 0.24529864883976382, -0.10328614992999845, 0.051136560157983235, 0.17358902772614931, 5.933063599349415e-05, 0.023219434435921327, -0.2662928103729767, 0.26745627177510894, 0.07943233388270866, 0.3206350783222897, 0.019945818108393375, 0.02124002313183484, -0.0404786955260035, -0.12478752285215772, -0.044716167066372554, -0.042594499624265876, 0.1994758859937116, 0.4224043611771201, 0.28762481085124747, 0.2932202208058456, -0.42623632307240666, -0.12026036928123715, -0.008711764938855743, 0.1585335920375409, 0.08677964904656342, -0.04131646113835886, -0.38919322603608425, 0.09127156639939943, -0.2373195848540182, 0.0010265213868838581, -0.14295330626331335, -0.005094132646602594, 0.009362124314723736, -0.3150715244145364, -0.05193913324688703, 0.015081278893823333, 0.19354477452671964, -0.01590310511873814, -0.07646411889769389, -0.025829070729156165, 0.20055560396173916, 0.04315372343085664, 0.04191224738668735, 0.17879947014205622, -0.10700048436805354, -0.11099522357634242, 0.3831453600130175, -0.0272428818602157, -0.19723464269980284, 0.20176100349750917, 0.03249065979715374, -0.15423116143687635, 0.07121706753443022, 0.2406689595946737, 0.0373214776127857, -0.2653751786956748, 0.06738054383602678, 0.031804462968461254, 0.2646314722201708, 0.07645483405591057, -0.05196919820487163, 0.20345442725271828, 0.18239611883958182, -0.048944717825595604, 0.15798201105928333, -0.01259334153748291, -0.008864990521043455, -0.2250910367149765, -0.1697173344818507, -0.1524515252790248, -0.04834923118295011, -0.05570272608463834, -0.19288364066518737, 0.33580105156127343, 0.1911945388110428, 0.04897243160712349, 0.08338976454313339, 0.3403541533326425, -0.052435444799478106, 0.15526152996012235, 0.17892341907293993, 0.0009967741572250754, -0.07169428623990434, 0.22901621286620485, -0.0679701123305065, 0.09401438537048502, -0.020715403880945032] |
1,802.02915 | Estimating city-level travel patterns using street imagery: a case study
of using Google Street View in Britain | Street imagery is a promising big data source providing current and
historical images in more than 100 countries. Previous studies used this data
to audit built environment features. Here we explore a novel application, using
Google Street View (GSV) to predict travel patterns at the city level. We
sampled 34 cities in Great Britain. In each city, we accessed GSV images from
1000 random locations from years overlapping with the 2011 Census and the
2011-2013 Active People Survey (APS). We manually annotated images into seven
categories of road users. We developed regression models with the counts of
images of road users as predictors. Outcomes included Census-reported commute
shares of four modes (walking plus public transport, cycling, motorcycle, and
car), and APS-reported past-month participation in walking and cycling. In
bivariate analyses, we found high correlations between GSV counts of cyclists
(GSV-cyclists) and cycle commute mode share (r=0.92) and past-month cycling
(r=0.90). Likewise, GSV-pedestrians was moderately correlated with past-month
walking for transport (r=0.46), GSV-motorcycles was moderately correlated with
commute share of motorcycles (r=0.44), and GSV-buses was highly correlated with
commute share of walking plus public transport (r=0.81). GSV-car was not
correlated with car commute mode share (r=-0.12). However, in multivariable
regression models, all mode shares were predicted well. Cross-validation
analyses showed good prediction performance for all the outcomes except
past-month walking. Street imagery is a promising new big data source to
predict urban mobility patterns. Further testing across multiple settings is
warranted both for cross-sectional and longitudinal assessments.
| cs.CY | street imagery is a promising big data source providing current and historical images in more than 100 countries previous studies used this data to audit built environment features here we explore a novel application using google street view gsv to predict travel patterns at the city level we sampled 34 cities in great britain in each city we accessed gsv images from 1000 random locations from years overlapping with the 2011 census and the 20112013 active people survey aps we manually annotated images into seven categories of road users we developed regression models with the counts of images of road users as predictors outcomes included censusreported commute shares of four modes walking plus public transport cycling motorcycle and car and apsreported pastmonth participation in walking and cycling in bivariate analyses we found high correlations between gsv counts of cyclists gsvcyclists and cycle commute mode share r092 and pastmonth cycling r090 likewise gsvpedestrians was moderately correlated with pastmonth walking for transport r046 gsvmotorcycles was moderately correlated with commute share of motorcycles r044 and gsvbuses was highly correlated with commute share of walking plus public transport r081 gsvcar was not correlated with car commute mode share r012 however in multivariable regression models all mode shares were predicted well crossvalidation analyses showed good prediction performance for all the outcomes except pastmonth walking street imagery is a promising new big data source to predict urban mobility patterns further testing across multiple settings is warranted both for crosssectional and longitudinal assessments | [['street', 'imagery', 'is', 'a', 'promising', 'big', 'data', 'source', 'providing', 'current', 'and', 'historical', 'images', 'in', 'more', 'than', '100', 'countries', 'previous', 'studies', 'used', 'this', 'data', 'to', 'audit', 'built', 'environment', 'features', 'here', 'we', 'explore', 'a', 'novel', 'application', 'using', 'google', 'street', 'view', 'gsv', 'to', 'predict', 'travel', 'patterns', 'at', 'the', 'city', 'level', 'we', 'sampled', '34', 'cities', 'in', 'great', 'britain', 'in', 'each', 'city', 'we', 'accessed', 'gsv', 'images', 'from', '1000', 'random', 'locations', 'from', 'years', 'overlapping', 'with', 'the', '2011', 'census', 'and', 'the', '20112013', 'active', 'people', 'survey', 'aps', 'we', 'manually', 'annotated', 'images', 'into', 'seven', 'categories', 'of', 'road', 'users', 'we', 'developed', 'regression', 'models', 'with', 'the', 'counts', 'of', 'images', 'of', 'road', 'users', 'as', 'predictors', 'outcomes', 'included', 'censusreported', 'commute', 'shares', 'of', 'four', 'modes', 'walking', 'plus', 'public', 'transport', 'cycling', 'motorcycle', 'and', 'car', 'and', 'apsreported', 'pastmonth', 'participation', 'in', 'walking', 'and', 'cycling', 'in', 'bivariate', 'analyses', 'we', 'found', 'high', 'correlations', 'between', 'gsv', 'counts', 'of', 'cyclists', 'gsvcyclists', 'and', 'cycle', 'commute', 'mode', 'share', 'r092', 'and', 'pastmonth', 'cycling', 'r090', 'likewise', 'gsvpedestrians', 'was', 'moderately', 'correlated', 'with', 'pastmonth', 'walking', 'for', 'transport', 'r046', 'gsvmotorcycles', 'was', 'moderately', 'correlated', 'with', 'commute', 'share', 'of', 'motorcycles', 'r044', 'and', 'gsvbuses', 'was', 'highly', 'correlated', 'with', 'commute', 'share', 'of', 'walking', 'plus', 'public', 'transport', 'r081', 'gsvcar', 'was', 'not', 'correlated', 'with', 'car', 'commute', 'mode', 'share', 'r012', 'however', 'in', 'multivariable', 'regression', 'models', 'all', 'mode', 'shares', 'were', 'predicted', 'well', 'crossvalidation', 'analyses', 'showed', 'good', 'prediction', 'performance', 'for', 'all', 'the', 'outcomes', 'except', 'pastmonth', 'walking', 'street', 'imagery', 'is', 'a', 'promising', 'new', 'big', 'data', 'source', 'to', 'predict', 'urban', 'mobility', 'patterns', 'further', 'testing', 'across', 'multiple', 'settings', 'is', 'warranted', 'both', 'for', 'crosssectional', 'and', 'longitudinal', 'assessments']] | [-0.08559183742391277, 0.09698852928161969, -0.08473532987359943, 0.09268525868488507, -0.07480790093541145, -0.21641151999494346, 0.08873802214324222, 0.4362716408134675, -0.1988728434613006, -0.3454437072751886, 0.0915691858059845, -0.3828394828823995, -0.11145153756142925, 0.1841053620130771, -0.16683218164677274, 0.03436630492698464, 0.12093695627241316, 0.0023706296934367364, 0.03192711084366084, -0.25501893080723614, 0.2158030784043673, 0.0350498694796273, 0.3531623075388656, -0.01984616052911822, 0.07024347543335614, 0.012041061683518465, -0.105335764831595, 0.013175981533819695, -0.054578721269736286, 0.0985240966231578, 0.3197635344186291, 0.14446841826528248, 0.2610680890495009, -0.41967333000058593, -0.19359906741429783, 0.07856835369060164, 0.12240389387431097, 0.02497865686240464, 0.0077071880254676465, -0.32442749983441654, 0.03899700881185585, -0.17736685472063057, -0.08657912586882742, -0.050549255657874013, 0.025226833338265198, 0.01715484689240407, -0.2575705146310472, 0.08247247792216081, -0.08723028807484513, 0.1799815025120644, -0.045144201885766774, -0.09851843885528871, -0.06039954153761678, 0.23678401425545956, 0.05856634601477092, 0.0005287926263517258, 0.17225336113557915, -0.14870465353182596, -0.14484864206179598, 0.3764436884291896, -0.0386287349829834, -0.11108085707272009, 0.21931725996546447, -0.14938149599247943, -0.15753006938177996, 0.09345259123000364, 0.20920797858695042, 0.05326940902110221, -0.1587344414566375, -0.05635337257226022, -0.08347950006097207, 0.13974667541382801, 0.08748392266975084, -0.02842968604695131, 0.2092189816047706, 0.19522699366360152, 0.027867588605258172, 0.07048185521103979, -0.15348756109893133, -0.07543420912184895, -0.1957475395058775, -0.09910832521890663, -0.128163108993958, 0.010003857607659745, -0.07190057243188691, -0.1176330935707221, 0.40065863703661675, 0.17892130754900512, 0.172109712081985, 0.057968285455545054, 0.2596951654808343, -0.00754457442099781, 0.10874439426993762, 0.11791919841494222, 0.13379420482472643, 0.00040607515355508964, 0.16750573951324796, -0.11805208954344487, 0.09013323461581653, -0.02624333102438082] |
1,802.02916 | Swarm parameter measurement in hydrogen, considering secondary photonic
electron emission | Discharges in hydrogen at pressures above $1\,$kPa and a reduced electric
field of $E/N=100-200\,$Td show a characteristic current oscillation in Pulsed
Townsend experiments. This is explained by secondary emission of electrons from
the photo-cathode: some hundreds of nano-seconds after the laser-pulse that
released the initial $10^4-10^6$ primary electrons, secondary electrons are
emitted from the cathode. Mechanisms discussed in literature are UV-emission
from neutral molecules, emission by positive ions reaching the cathode, and
back-scattering of excited neutrals. For a measurement up to $500\,$Td and
pressures up to $2\,$kPa we model different sources, and agree with previous
findings that the observed secondary emission is purely due to ultra-violet
light below $200\,$Td: the simulation fits with the complicated form of the
oscillating waveform. Obtained swarm parameters agree well with the literature.
Our findings suggest a very high efficiency of the photo-cathode for UV light
of energies above $8\,$eV.
| physics.plasm-ph | discharges in hydrogen at pressures above 1kpa and a reduced electric field of en100200td show a characteristic current oscillation in pulsed townsend experiments this is explained by secondary emission of electrons from the photocathode some hundreds of nanoseconds after the laserpulse that released the initial 104106 primary electrons secondary electrons are emitted from the cathode mechanisms discussed in literature are uvemission from neutral molecules emission by positive ions reaching the cathode and backscattering of excited neutrals for a measurement up to 500td and pressures up to 2kpa we model different sources and agree with previous findings that the observed secondary emission is purely due to ultraviolet light below 200td the simulation fits with the complicated form of the oscillating waveform obtained swarm parameters agree well with the literature our findings suggest a very high efficiency of the photocathode for uv light of energies above 8ev | [['discharges', 'in', 'hydrogen', 'at', 'pressures', 'above', '1kpa', 'and', 'a', 'reduced', 'electric', 'field', 'of', 'en100200td', 'show', 'a', 'characteristic', 'current', 'oscillation', 'in', 'pulsed', 'townsend', 'experiments', 'this', 'is', 'explained', 'by', 'secondary', 'emission', 'of', 'electrons', 'from', 'the', 'photocathode', 'some', 'hundreds', 'of', 'nanoseconds', 'after', 'the', 'laserpulse', 'that', 'released', 'the', 'initial', '104106', 'primary', 'electrons', 'secondary', 'electrons', 'are', 'emitted', 'from', 'the', 'cathode', 'mechanisms', 'discussed', 'in', 'literature', 'are', 'uvemission', 'from', 'neutral', 'molecules', 'emission', 'by', 'positive', 'ions', 'reaching', 'the', 'cathode', 'and', 'backscattering', 'of', 'excited', 'neutrals', 'for', 'a', 'measurement', 'up', 'to', '500td', 'and', 'pressures', 'up', 'to', '2kpa', 'we', 'model', 'different', 'sources', 'and', 'agree', 'with', 'previous', 'findings', 'that', 'the', 'observed', 'secondary', 'emission', 'is', 'purely', 'due', 'to', 'ultraviolet', 'light', 'below', '200td', 'the', 'simulation', 'fits', 'with', 'the', 'complicated', 'form', 'of', 'the', 'oscillating', 'waveform', 'obtained', 'swarm', 'parameters', 'agree', 'well', 'with', 'the', 'literature', 'our', 'findings', 'suggest', 'a', 'very', 'high', 'efficiency', 'of', 'the', 'photocathode', 'for', 'uv', 'light', 'of', 'energies', 'above', '8ev']] | [-0.05899154310048159, 0.22215584837831556, -0.00577708800223523, 0.052619391094153145, 0.023940830464873997, -0.1475097019557974, 0.05186143856761711, 0.40735803238515345, -0.2154476511458467, -0.3523807168006897, 0.012762339643502076, -0.3242766301979178, -0.0026154905258278763, 0.23981672032969073, -0.00505181040082659, -0.008710275627007442, 0.05309137951948547, -0.038325307318674666, -0.03155939691101334, -0.16185383952854734, 0.25897074929172437, 0.13595683676789383, 0.2433098790468648, 0.09811589909451349, 0.06399113559496722, -0.07791859068841274, -0.006634697757129158, -0.02345330106826233, -0.09946600749941094, 0.06026571416316853, 0.20680040601374847, 0.0520709778913962, 0.17553343516109246, -0.45353094111861925, -0.26945570959443493, 0.012588572648486921, 0.12553485250765725, 0.10570627990590376, -0.1146606848774744, -0.2606172831296655, 0.052557095005093805, -0.14121411987081436, -0.15529581677567747, 0.023202514315822296, -0.010508923344397252, 0.09601446807743871, -0.25545170278970286, 0.08902128388539755, 0.009925396939174139, 0.051055237979328795, -0.1274470926879855, -0.1432325454428792, -0.048535094095859675, 0.05096094727050513, 0.10063725179809678, 0.0461658839726754, 0.23096581777624253, -0.10170606336323544, -0.08655479999225853, 0.35693822984581597, -0.07735391956687505, -0.03181725924701563, 0.19563208807791982, -0.2261015472534512, -0.05206615058705211, 0.27930189760934027, 0.1280425503384322, 0.10909066558482923, -0.1409230087152017, -0.005325297618817006, -0.0005938773625530303, 0.15621900860486285, 0.11714352374796623, 0.0186251495698733, 0.25128968681341834, 0.14738469416209096, -0.010543560176821691, 0.11834235915448517, -0.11344067942866656, -0.02168877173348197, -0.28215029529695, -0.0846216871868819, -0.14717693950182625, 0.0702978259817298, -0.02229482242629664, -0.09522184753150213, 0.40388490040620256, 0.13048228633456996, 0.17028284836726795, -0.005959846643132291, 0.32740702365658114, 0.10449451485931474, 0.05227598686968642, 0.05564226337342656, 0.3118791191749291, 0.15955124618152955, 0.13671166958021266, -0.2426766176059443, 0.031160949371821647, -0.043800675700913415] |
1,802.02917 | Classical Higher-Order Processes | Classical Processes (CP) is a calculus where the proof theory of classical
linear logic types communicating processes with mobile channels, a la
pi-calculus. Its construction builds on a recent propositions as types
correspondence between session types and propositions in linear logic.
Desirable properties such as type preservation under reductions and progress
come for free from the metatheory of linear logic.
We contribute to this research line by extending CP with code mobility. We
generalise classical linear logic to capture higher-order (linear) reasoning on
proofs, which yields a logical reconstruction of (a variant of) the
Higher-Order pi-calculus (HOpi). The resulting calculus is called Classical
Higher-Order Processes (CHOP). We explore the metatheory of CHOP, proving that
its semantics enjoys type preservation and progress (terms do not get stuck).
We also illustrate the expressivity of CHOP through examples, derivable syntax
sugar, and an extension to multiparty sessions. Lastly, we define a translation
from CHOP to CP, which encodes mobility of process code into reference passing.
| cs.LO cs.PL | classical processes cp is a calculus where the proof theory of classical linear logic types communicating processes with mobile channels a la picalculus its construction builds on a recent propositions as types correspondence between session types and propositions in linear logic desirable properties such as type preservation under reductions and progress come for free from the metatheory of linear logic we contribute to this research line by extending cp with code mobility we generalise classical linear logic to capture higherorder linear reasoning on proofs which yields a logical reconstruction of a variant of the higherorder picalculus hopi the resulting calculus is called classical higherorder processes chop we explore the metatheory of chop proving that its semantics enjoys type preservation and progress terms do not get stuck we also illustrate the expressivity of chop through examples derivable syntax sugar and an extension to multiparty sessions lastly we define a translation from chop to cp which encodes mobility of process code into reference passing | [['classical', 'processes', 'cp', 'is', 'a', 'calculus', 'where', 'the', 'proof', 'theory', 'of', 'classical', 'linear', 'logic', 'types', 'communicating', 'processes', 'with', 'mobile', 'channels', 'a', 'la', 'picalculus', 'its', 'construction', 'builds', 'on', 'a', 'recent', 'propositions', 'as', 'types', 'correspondence', 'between', 'session', 'types', 'and', 'propositions', 'in', 'linear', 'logic', 'desirable', 'properties', 'such', 'as', 'type', 'preservation', 'under', 'reductions', 'and', 'progress', 'come', 'for', 'free', 'from', 'the', 'metatheory', 'of', 'linear', 'logic', 'we', 'contribute', 'to', 'this', 'research', 'line', 'by', 'extending', 'cp', 'with', 'code', 'mobility', 'we', 'generalise', 'classical', 'linear', 'logic', 'to', 'capture', 'higherorder', 'linear', 'reasoning', 'on', 'proofs', 'which', 'yields', 'a', 'logical', 'reconstruction', 'of', 'a', 'variant', 'of', 'the', 'higherorder', 'picalculus', 'hopi', 'the', 'resulting', 'calculus', 'is', 'called', 'classical', 'higherorder', 'processes', 'chop', 'we', 'explore', 'the', 'metatheory', 'of', 'chop', 'proving', 'that', 'its', 'semantics', 'enjoys', 'type', 'preservation', 'and', 'progress', 'terms', 'do', 'not', 'get', 'stuck', 'we', 'also', 'illustrate', 'the', 'expressivity', 'of', 'chop', 'through', 'examples', 'derivable', 'syntax', 'sugar', 'and', 'an', 'extension', 'to', 'multiparty', 'sessions', 'lastly', 'we', 'define', 'a', 'translation', 'from', 'chop', 'to', 'cp', 'which', 'encodes', 'mobility', 'of', 'process', 'code', 'into', 'reference', 'passing']] | [-0.09925786052513609, 0.03743297157223109, -0.08026358870398483, 0.09141838258492947, -0.17239571556759378, -0.1881114533745948, 0.08758507424859147, 0.31929025812833395, -0.3467652949585039, -0.27486458976097683, 0.05746752436108956, -0.23603664486910458, -0.12217121469259354, 0.16786286034578182, -0.1289513650778566, 0.037270794690868324, 0.03269559936364394, 0.022873095564406226, -0.09509830593769611, -0.2151999494842725, 0.28225921091255674, -0.010323389847245481, 0.2557633185305023, 0.03510391447272002, 0.10196933554726895, 0.07633887817738233, -0.05158583167652933, 0.01805024619794876, -0.09590923790928634, 0.15465985152605968, 0.311113428807369, 0.24465499653044032, 0.24788051576319117, -0.4526642137322069, -0.1573260143702134, 0.04366573842420576, 0.07723224875919613, 0.12536301758042595, -0.0031091936153969093, -0.3294044780820884, 0.08423746178245724, -0.19617502879384432, -0.06698595818396612, -0.11492063263776126, 0.006548360355175388, 0.013661608278153487, -0.22775642702608934, -0.019247980488149484, 0.20793327086685617, 0.10813602441519407, 0.009152160835291408, -0.060024586218742675, -0.01891566102427465, 0.0812867068697089, -0.004370263392676277, -0.021003562896684917, 0.12065681594820624, -0.06718764763561158, -0.23489452888154322, 0.3458611518662009, -0.03432777606922397, -0.20160356548005415, 0.20889148069258182, -0.044092210918021055, -0.18895889876444857, 0.06585452078703653, 0.14582732967158527, 0.09317388387833848, -0.13450712815823931, 0.14502917734595636, -0.03282411640544457, 0.20399907524668737, 0.12085995211461444, 0.10614201726670733, 0.16476606612990577, 0.1699093342255686, 0.028884207086787086, 0.14913259028316256, 0.02836574238644522, -0.17098809992549596, -0.3451600342207117, -0.18823139151191068, -0.032116859038877815, 0.01138175832530567, -0.05058708153111734, -0.1733423573788497, 0.35104610517701523, 0.14915703127540095, 0.11811807542970335, 0.15676227343602128, 0.296136444513571, 0.10563685293136924, 0.09751000036887916, 0.02870898930511127, 0.12449496964073199, 0.18007748263460846, 0.1408975667918078, -0.16574830823190967, 0.11146185928625112, 0.13006850860920954] |
1,802.02918 | Finite Element Error Estimates for Optimal Control Problems with
Pointwise Tracking | We consider a linear-quadratic elliptic optimal control problem with point
evaluations of the state variable in the cost functional. The state variable is
discretized by conforming linear finite elements. For control discretization,
three different approaches are considered. The main goal of the paper is to
significantly improve known a priori discretization error estimates for this
problem. We prove optimal error estimates for cellwise constant control
discretizations in two and three space dimensions. Further, in two space
dimensions, optimal error estimates for variational discretization and for the
post-processing approach are derived.
| math.NA | we consider a linearquadratic elliptic optimal control problem with point evaluations of the state variable in the cost functional the state variable is discretized by conforming linear finite elements for control discretization three different approaches are considered the main goal of the paper is to significantly improve known a priori discretization error estimates for this problem we prove optimal error estimates for cellwise constant control discretizations in two and three space dimensions further in two space dimensions optimal error estimates for variational discretization and for the postprocessing approach are derived | [['we', 'consider', 'a', 'linearquadratic', 'elliptic', 'optimal', 'control', 'problem', 'with', 'point', 'evaluations', 'of', 'the', 'state', 'variable', 'in', 'the', 'cost', 'functional', 'the', 'state', 'variable', 'is', 'discretized', 'by', 'conforming', 'linear', 'finite', 'elements', 'for', 'control', 'discretization', 'three', 'different', 'approaches', 'are', 'considered', 'the', 'main', 'goal', 'of', 'the', 'paper', 'is', 'to', 'significantly', 'improve', 'known', 'a', 'priori', 'discretization', 'error', 'estimates', 'for', 'this', 'problem', 'we', 'prove', 'optimal', 'error', 'estimates', 'for', 'cellwise', 'constant', 'control', 'discretizations', 'in', 'two', 'and', 'three', 'space', 'dimensions', 'further', 'in', 'two', 'space', 'dimensions', 'optimal', 'error', 'estimates', 'for', 'variational', 'discretization', 'and', 'for', 'the', 'postprocessing', 'approach', 'are', 'derived']] | [-0.09255416300147772, 0.05004974701150786, -0.05711652402662569, 0.08986377670662478, -0.045186170149180624, -0.16250556799479657, 0.06917095629679453, 0.38533626645803454, -0.3053748244005773, -0.293065992070155, 0.18419776056091197, -0.2461855979791532, -0.09269167934026983, 0.19476701725895207, -0.14509800102354753, 0.18722923054463333, 0.07705215579157489, -0.022110208444711236, -0.12976467591102442, -0.27313131980546235, 0.36257103486210934, -0.06529275019549662, 0.2656870012482007, -0.037290991227039036, 0.15125632289176186, -0.021101817426582178, -0.05841509198976887, 0.01111865189789872, -0.14681286774058308, 0.14961040849124807, 0.2930330354461653, 0.05114870026138508, 0.36585567554252013, -0.36070958400248654, -0.25482857891668875, 0.08924506016515402, 0.15690292165381833, 0.12014095837043391, -0.0312906097025714, -0.2332542668070851, 0.0815290850147398, -0.11663903330142299, -0.12915970223127968, -0.0687104276381433, -0.052457822212535477, 0.02811493998289936, -0.3777813808578584, 0.07799356346691234, 0.01433029456788467, 0.04248930180652274, -0.13659280921436018, -0.17692303000949322, 0.0479534365534265, 0.14894549214384623, 0.02365737481482534, 0.014706958354347282, 0.04717770613109072, -0.06595922395224786, -0.1205012502717889, 0.3494049757098158, -0.055419439191205636, -0.35525305275287894, 0.1011336412668849, -0.07552758483733568, -0.13234789775839698, 0.12308921243788468, 0.22711643366039627, 0.15865357759305174, -0.15043666530400515, 0.08504691875099929, 0.013145104081680377, 0.17227878037794855, 0.02218908778288298, 0.026836142373374765, 0.01154270718495051, 0.1868060163532694, 0.21416174018134673, 0.10035105385403666, -0.049606866772390075, -0.15269297911889024, -0.3688302849729856, -0.14899491973014342, -0.1796786447107378, -0.024890338819629203, -0.1482883241386541, -0.15981780179879732, 0.3440867000052498, 0.14769863737229671, 0.11018483452498913, 0.1139221244595117, 0.30759076734797824, 0.1716615457398196, -0.03518245986714545, 0.10511667952458892, 0.21260946924901672, 0.10827664166119777, 0.045366703330849606, -0.25167665975168346, 0.05720808289479464, 0.19416097439825536] |
1,802.02919 | Adaptive online scheduling of tasks with anytime property on
heterogeneous resources | An acceptable response time of a server is an important aspect in many
client-server applications; this is evident in situations in which the server
is overloaded by many computationally intensive requests. In this work, we
consider that the requests, or in this case tasks, generated by the clients are
instances of optimization problems solved by anytime algorithms, i.e. the
quality of the solution increases with the processing time of a task. These
tasks are submitted to the server which schedules them to the available
computational resources where the tasks are processed. To tackle the overload
problem, we propose a scheduling algorithm which combines traditional
scheduling approaches with a quality control heuristic which adjusts the
requested quality of the solutions and thus changes the processing time of the
tasks. Two efficient quality control heuristics are introduced: the first
heuristic sets a global quality for all tasks, whereas the second heuristic
sets the quality for each task independently. Moreover, in practice, the
relationship between the processing time and the quality is not known a priori.
Because it is crucial for scheduling algorithms to know at least the estimation
of these relationships, we propose a general procedure for estimating these
relationships using information obtained from the already executed tasks.
Finally, the performance of the proposed scheduling algorithm is demonstrated
on a real-world problem from the domain of personnel rostering with very good
results.
| cs.DC | an acceptable response time of a server is an important aspect in many clientserver applications this is evident in situations in which the server is overloaded by many computationally intensive requests in this work we consider that the requests or in this case tasks generated by the clients are instances of optimization problems solved by anytime algorithms ie the quality of the solution increases with the processing time of a task these tasks are submitted to the server which schedules them to the available computational resources where the tasks are processed to tackle the overload problem we propose a scheduling algorithm which combines traditional scheduling approaches with a quality control heuristic which adjusts the requested quality of the solutions and thus changes the processing time of the tasks two efficient quality control heuristics are introduced the first heuristic sets a global quality for all tasks whereas the second heuristic sets the quality for each task independently moreover in practice the relationship between the processing time and the quality is not known a priori because it is crucial for scheduling algorithms to know at least the estimation of these relationships we propose a general procedure for estimating these relationships using information obtained from the already executed tasks finally the performance of the proposed scheduling algorithm is demonstrated on a realworld problem from the domain of personnel rostering with very good results | [['an', 'acceptable', 'response', 'time', 'of', 'a', 'server', 'is', 'an', 'important', 'aspect', 'in', 'many', 'clientserver', 'applications', 'this', 'is', 'evident', 'in', 'situations', 'in', 'which', 'the', 'server', 'is', 'overloaded', 'by', 'many', 'computationally', 'intensive', 'requests', 'in', 'this', 'work', 'we', 'consider', 'that', 'the', 'requests', 'or', 'in', 'this', 'case', 'tasks', 'generated', 'by', 'the', 'clients', 'are', 'instances', 'of', 'optimization', 'problems', 'solved', 'by', 'anytime', 'algorithms', 'ie', 'the', 'quality', 'of', 'the', 'solution', 'increases', 'with', 'the', 'processing', 'time', 'of', 'a', 'task', 'these', 'tasks', 'are', 'submitted', 'to', 'the', 'server', 'which', 'schedules', 'them', 'to', 'the', 'available', 'computational', 'resources', 'where', 'the', 'tasks', 'are', 'processed', 'to', 'tackle', 'the', 'overload', 'problem', 'we', 'propose', 'a', 'scheduling', 'algorithm', 'which', 'combines', 'traditional', 'scheduling', 'approaches', 'with', 'a', 'quality', 'control', 'heuristic', 'which', 'adjusts', 'the', 'requested', 'quality', 'of', 'the', 'solutions', 'and', 'thus', 'changes', 'the', 'processing', 'time', 'of', 'the', 'tasks', 'two', 'efficient', 'quality', 'control', 'heuristics', 'are', 'introduced', 'the', 'first', 'heuristic', 'sets', 'a', 'global', 'quality', 'for', 'all', 'tasks', 'whereas', 'the', 'second', 'heuristic', 'sets', 'the', 'quality', 'for', 'each', 'task', 'independently', 'moreover', 'in', 'practice', 'the', 'relationship', 'between', 'the', 'processing', 'time', 'and', 'the', 'quality', 'is', 'not', 'known', 'a', 'priori', 'because', 'it', 'is', 'crucial', 'for', 'scheduling', 'algorithms', 'to', 'know', 'at', 'least', 'the', 'estimation', 'of', 'these', 'relationships', 'we', 'propose', 'a', 'general', 'procedure', 'for', 'estimating', 'these', 'relationships', 'using', 'information', 'obtained', 'from', 'the', 'already', 'executed', 'tasks', 'finally', 'the', 'performance', 'of', 'the', 'proposed', 'scheduling', 'algorithm', 'is', 'demonstrated', 'on', 'a', 'realworld', 'problem', 'from', 'the', 'domain', 'of', 'personnel', 'rostering', 'with', 'very', 'good', 'results']] | [-0.14165646904300008, 0.0026351015347957046, -0.0666846546061013, 0.048560524022247156, -0.10193876675127642, -0.17826341150490485, 0.1011588114850304, 0.4205988507029479, -0.28856479027308524, -0.3655687125278232, 0.13532672664251827, -0.23645448329777496, -0.13570143839283644, 0.2112237227746569, -0.14155688397636962, 0.12642748129918524, 0.11445663257036358, 0.06794320621082316, -0.04077557111741044, -0.32959322076817243, 0.2519726106502197, 0.04130647905656825, 0.3312007620971164, 0.031596963352564233, 0.08978344505936231, -0.004113507807335776, -0.021735583810621628, 0.013226446041675366, -0.07084241394860209, 0.138814524559933, 0.3475479966748263, 0.20613466978168657, 0.3649999878571733, -0.41437304264805075, -0.18798011566876718, 0.08441204765517993, 0.13404876060945833, 0.07227307269659713, -0.03439840597566217, -0.2619276653094541, 0.09445919131090784, -0.1199567940678326, 0.0052674137248212224, -0.06473581386203675, -0.00806720012029552, 0.011832671128618329, -0.3114984886277892, 0.02000636208964431, 0.001064457080286482, 0.014222805908597681, -0.05528896806518669, -0.07779629960524566, 0.06078073421655142, 0.19281202293223823, 0.078425404914837, 0.023625313336252358, 0.12911589927363978, -0.15395328658734164, -0.17624187016778667, 0.4399604252499083, 0.042665691495336514, -0.2137943838318081, 0.18858091853275571, -0.014535203273408116, -0.18490906112445216, 0.11448896245464035, 0.19932234204151547, 0.13284078689858966, -0.18297485033374117, 0.03702411785185256, -0.022043596517861537, 0.18301344374700895, 0.0658535281256975, -0.002416156169593982, 0.15091201815167038, 0.2164129797571703, 0.10179654070651968, 0.15391738756873605, -0.02391179467933556, -0.06487413439191068, -0.23105375996294797, -0.12528808895174576, -0.21696560253115857, -0.0379519716491695, -0.09223322900728342, -0.13415148442044206, 0.387134610262254, 0.19319792954737078, 0.17057509072448895, 0.09106827624061185, 0.4056246664830605, 0.09468121286532234, 0.06769412940003626, 0.1563227258212662, 0.14940457568179977, -0.021371481732627297, 0.1776403879625318, -0.21097184512270717, 0.11855582824564012, 0.035221645570076676] |
1,802.0292 | Spectral State Compression of Markov Processes | Model reduction of Markov processes is a basic problem in modeling
state-transition systems. Motivated by the state aggregation approach rooted in
control theory, we study the statistical state compression of a discrete-state
Markov chain from empirical trajectories. Through the lens of spectral
decomposition, we study the rank and features of Markov processes, as well as
properties like representability, aggregability, and lumpability. We develop
spectral methods for estimating the transition matrix of a low-rank Markov
model, estimating the leading subspace spanned by Markov features, and
recovering latent structures like state aggregation and lumpable partition of
the state space. We prove statistical upper bounds for the estimation errors
and nearly matching minimax lower bounds. Numerical studies are performed on
synthetic data and a dataset of New York City taxi trips.
| stat.ML cs.LG stat.ME | model reduction of markov processes is a basic problem in modeling statetransition systems motivated by the state aggregation approach rooted in control theory we study the statistical state compression of a discretestate markov chain from empirical trajectories through the lens of spectral decomposition we study the rank and features of markov processes as well as properties like representability aggregability and lumpability we develop spectral methods for estimating the transition matrix of a lowrank markov model estimating the leading subspace spanned by markov features and recovering latent structures like state aggregation and lumpable partition of the state space we prove statistical upper bounds for the estimation errors and nearly matching minimax lower bounds numerical studies are performed on synthetic data and a dataset of new york city taxi trips | [['model', 'reduction', 'of', 'markov', 'processes', 'is', 'a', 'basic', 'problem', 'in', 'modeling', 'statetransition', 'systems', 'motivated', 'by', 'the', 'state', 'aggregation', 'approach', 'rooted', 'in', 'control', 'theory', 'we', 'study', 'the', 'statistical', 'state', 'compression', 'of', 'a', 'discretestate', 'markov', 'chain', 'from', 'empirical', 'trajectories', 'through', 'the', 'lens', 'of', 'spectral', 'decomposition', 'we', 'study', 'the', 'rank', 'and', 'features', 'of', 'markov', 'processes', 'as', 'well', 'as', 'properties', 'like', 'representability', 'aggregability', 'and', 'lumpability', 'we', 'develop', 'spectral', 'methods', 'for', 'estimating', 'the', 'transition', 'matrix', 'of', 'a', 'lowrank', 'markov', 'model', 'estimating', 'the', 'leading', 'subspace', 'spanned', 'by', 'markov', 'features', 'and', 'recovering', 'latent', 'structures', 'like', 'state', 'aggregation', 'and', 'lumpable', 'partition', 'of', 'the', 'state', 'space', 'we', 'prove', 'statistical', 'upper', 'bounds', 'for', 'the', 'estimation', 'errors', 'and', 'nearly', 'matching', 'minimax', 'lower', 'bounds', 'numerical', 'studies', 'are', 'performed', 'on', 'synthetic', 'data', 'and', 'a', 'dataset', 'of', 'new', 'york', 'city', 'taxi', 'trips']] | [-0.07241373892330866, 0.08606247868806886, -0.0901887158525917, 0.11258536546058424, -0.051854033661111604, -0.12100940068457716, 0.10918064514728718, 0.37536025866426115, -0.30727570913878716, -0.29519195334003195, 0.1727894263829684, -0.27338685919200695, -0.1525140612232169, 0.15981548544620788, -0.04262120218023541, 0.11732026747625879, 0.08930577579739056, 0.0008672363469450493, -0.06944799165454084, -0.18175674653722076, 0.3150637267931093, 0.057006970685943376, 0.30488226026677945, -0.0351372998369139, 0.13685839404040345, 0.037411642083934854, -0.05016482060071169, -0.013511994014187957, -0.1407855332656727, 0.15655511822899817, 0.26219163795449135, 0.20266969681086797, 0.2741295317055907, -0.37281865982602785, -0.2546135133488001, 0.12275757065490181, 0.12480411284757177, 0.10131551991248922, -0.005964648551454284, -0.33186940345033183, 0.030153757070308537, -0.17038968780378658, -0.03408961317421296, -0.11722169191151212, -0.05180430002088886, 0.011056908923311261, -0.3094522802628518, 0.07985836491868721, 0.06633838607955313, 0.09075156438478826, -0.09629673723454081, -0.1482987821681469, 0.0017238263367110585, 0.12500510510702537, 0.027667906314985256, -0.048433899545792754, 0.1348536068309597, -0.12565006546705493, -0.17698511712282428, 0.32987989254999817, -0.07634429015424543, -0.18746757824120558, 0.15904610818178636, -0.09118579839554242, -0.18479613801391107, 0.09933298990115758, 0.2313994125749065, 0.12718878466407696, -0.16290296323040104, 0.09639455562211778, -0.06213747745189141, 0.131665319847823, 0.0040906658212793625, 0.001861202606187004, 0.13496971765430424, 0.21320878687190023, 0.09754635305070561, 0.16759970107695132, -0.09204458912255198, -0.1617580837401466, -0.25125835562403515, -0.13107074943818445, -0.2186332895222494, 0.021000378941163772, -0.1509417543606191, -0.20282635970708482, 0.39130122154789765, 0.15894887599371554, 0.2144419361771209, 0.12738307898930148, 0.26430110878487095, 0.1024413499082842, -0.04891825358632688, 0.0998831856849156, 0.10981666315420288, 0.17325604183042026, 0.03968423149009019, -0.173942816673822, 0.11304790296364488, 0.1340751839695337] |
1,802.02921 | Coherent control of solid state nuclear spin nano-ensembles | Detecting and controlling nuclear spin nano-ensembles is crucial for the
further development of nuclear magnetic resonance (NMR) spectroscopy and for
the emerging solid state quantum technology. Here we present the fabrication of
a $\approx$ 1 nanometre thick diamond layer consisting of $^{13}$C nuclear
spins doped with Nitrogen-Vacancy centres (NV) embedded in a spin-free $^{12}$C
crystal matrix. A single NV in the vicinity of the layer is used for
polarization of the $^{13}$C spins and the readout of their magnetization. We
demonstrate a method for coherent control of few tens of nuclear spins by using
radio frequency pulses and show the basic coherent control experiments - Rabi
oscillations, Ramsey spectroscopy and Hahn echo, though any NMR pulse sequence
can be implemented. The results shown present a first steps towards the
realization of a nuclear spin based quantum simulator.
| quant-ph cond-mat.mes-hall | detecting and controlling nuclear spin nanoensembles is crucial for the further development of nuclear magnetic resonance nmr spectroscopy and for the emerging solid state quantum technology here we present the fabrication of a approx 1 nanometre thick diamond layer consisting of 13c nuclear spins doped with nitrogenvacancy centres nv embedded in a spinfree 12c crystal matrix a single nv in the vicinity of the layer is used for polarization of the 13c spins and the readout of their magnetization we demonstrate a method for coherent control of few tens of nuclear spins by using radio frequency pulses and show the basic coherent control experiments rabi oscillations ramsey spectroscopy and hahn echo though any nmr pulse sequence can be implemented the results shown present a first steps towards the realization of a nuclear spin based quantum simulator | [['detecting', 'and', 'controlling', 'nuclear', 'spin', 'nanoensembles', 'is', 'crucial', 'for', 'the', 'further', 'development', 'of', 'nuclear', 'magnetic', 'resonance', 'nmr', 'spectroscopy', 'and', 'for', 'the', 'emerging', 'solid', 'state', 'quantum', 'technology', 'here', 'we', 'present', 'the', 'fabrication', 'of', 'a', 'approx', '1', 'nanometre', 'thick', 'diamond', 'layer', 'consisting', 'of', '13c', 'nuclear', 'spins', 'doped', 'with', 'nitrogenvacancy', 'centres', 'nv', 'embedded', 'in', 'a', 'spinfree', '12c', 'crystal', 'matrix', 'a', 'single', 'nv', 'in', 'the', 'vicinity', 'of', 'the', 'layer', 'is', 'used', 'for', 'polarization', 'of', 'the', '13c', 'spins', 'and', 'the', 'readout', 'of', 'their', 'magnetization', 'we', 'demonstrate', 'a', 'method', 'for', 'coherent', 'control', 'of', 'few', 'tens', 'of', 'nuclear', 'spins', 'by', 'using', 'radio', 'frequency', 'pulses', 'and', 'show', 'the', 'basic', 'coherent', 'control', 'experiments', 'rabi', 'oscillations', 'ramsey', 'spectroscopy', 'and', 'hahn', 'echo', 'though', 'any', 'nmr', 'pulse', 'sequence', 'can', 'be', 'implemented', 'the', 'results', 'shown', 'present', 'a', 'first', 'steps', 'towards', 'the', 'realization', 'of', 'a', 'nuclear', 'spin', 'based', 'quantum', 'simulator']] | [-0.08861867837207255, 0.21426724431084415, 0.007634128019323244, -0.02700210123507799, 0.031480253427563346, -0.151524066726458, 0.03433572841373354, 0.4541195343686816, -0.2330765835906598, -0.2689069005256683, 0.06121638802612912, -0.2637724730764817, -0.029832185539656646, 0.24466114513651357, 0.05198479016180232, 0.05002392895660117, 0.040973306099391156, 0.0030377822078983575, -0.07452963885910269, -0.12575048004167483, 0.25324423291332254, 0.0257622843115207, 0.27855775776141156, 0.0548958005674649, 0.1429813387495575, 0.044627358493230795, 0.10720398546169128, -0.07378618869081359, -0.07248677777373386, 0.13898901805206312, 0.303137154200265, 0.028335794404162753, 0.22575802781776635, -0.49356252185123806, -0.18607917556415915, 0.06035174899529118, 0.1641439894434263, 0.21790739261910752, -0.1525379488559659, -0.308978354842539, 0.03310217069092152, -0.15644584371115985, -0.13574518122272017, -0.10398042319695164, -0.025152979298796067, 0.02699306492200669, -0.2232782695659005, 0.05610079920049483, 0.051665246359976554, 0.07617335914812215, -0.07762895982715931, -0.10218762213823057, 0.04230585777515765, 0.0741348009186742, -0.08600520145709571, 0.058115294994101584, 0.2800607363323626, -0.09148440438644577, -0.19309988691855004, 0.31234962789013104, -0.040985875228858167, -0.05238712799002636, 0.09958601811633665, -0.20436508423539207, -0.10821285054964178, 0.08922949851052288, 0.11033560922634719, 0.17846670620800817, -0.14573457582103883, 0.029767812162497326, 0.013371467960121878, 0.2667664434651242, 0.04461291691747166, 0.11274718713727505, 0.22519736387766898, 0.2514588772113818, 0.05388131063527373, 0.1426802045222276, -0.2062437012055478, -0.05209996480056468, -0.21122099805678077, -0.1647963738976293, -0.2187832461683737, 0.12532770289929912, -0.06378084297498657, -0.11069904833836036, 0.4369373261459473, 0.07677202377646394, 0.12936536148738334, -0.10170714305850732, 0.2911363844828242, 0.05208004879600862, 0.09421882372835706, 0.009776850794236559, 0.2521867228480166, 0.2916476599656401, 0.07613716289565406, -0.3640462664257297, 0.013574438399861237, -0.04062745447513675] |
1,802.02922 | Phase estimation with squeezed single photons | We address the performance of an interferometric setup in which a squeezed
single photon interferes at a beam splitter with a coherent state. Our analysis
in based on both the quantum Fisher information and the sensitivity when a
Mach-Zehnder setup is considered and the difference photocurrent is detected at
the output. We compare our results with those obtained feeding the
interferometer with a squeezed vacuum (with the same squeezing parameter of the
squeezed single photon) and a coherent state in order to have the same total
number of photons circulating in the interferometer. We find that for fixed
squeezing parameter and total number of photons there is a threshold of the
coherent amplitude interfering with the squeezed single photon above which the
squeezed single photons outperform the performance of squeezed vacuum (showing
the highest quantum Fisher information). When the difference photocurrent
measurement is considered, we can always find a threshold of the squeezing
parameter (given the total number of photons and the coherent amplitude) above
which squeezed single photons can be exploited to reach a better sensitivity
with respect to the use of squeezed vacuum states also in the presence of non
unit quantum efficiency.
| quant-ph | we address the performance of an interferometric setup in which a squeezed single photon interferes at a beam splitter with a coherent state our analysis in based on both the quantum fisher information and the sensitivity when a machzehnder setup is considered and the difference photocurrent is detected at the output we compare our results with those obtained feeding the interferometer with a squeezed vacuum with the same squeezing parameter of the squeezed single photon and a coherent state in order to have the same total number of photons circulating in the interferometer we find that for fixed squeezing parameter and total number of photons there is a threshold of the coherent amplitude interfering with the squeezed single photon above which the squeezed single photons outperform the performance of squeezed vacuum showing the highest quantum fisher information when the difference photocurrent measurement is considered we can always find a threshold of the squeezing parameter given the total number of photons and the coherent amplitude above which squeezed single photons can be exploited to reach a better sensitivity with respect to the use of squeezed vacuum states also in the presence of non unit quantum efficiency | [['we', 'address', 'the', 'performance', 'of', 'an', 'interferometric', 'setup', 'in', 'which', 'a', 'squeezed', 'single', 'photon', 'interferes', 'at', 'a', 'beam', 'splitter', 'with', 'a', 'coherent', 'state', 'our', 'analysis', 'in', 'based', 'on', 'both', 'the', 'quantum', 'fisher', 'information', 'and', 'the', 'sensitivity', 'when', 'a', 'machzehnder', 'setup', 'is', 'considered', 'and', 'the', 'difference', 'photocurrent', 'is', 'detected', 'at', 'the', 'output', 'we', 'compare', 'our', 'results', 'with', 'those', 'obtained', 'feeding', 'the', 'interferometer', 'with', 'a', 'squeezed', 'vacuum', 'with', 'the', 'same', 'squeezing', 'parameter', 'of', 'the', 'squeezed', 'single', 'photon', 'and', 'a', 'coherent', 'state', 'in', 'order', 'to', 'have', 'the', 'same', 'total', 'number', 'of', 'photons', 'circulating', 'in', 'the', 'interferometer', 'we', 'find', 'that', 'for', 'fixed', 'squeezing', 'parameter', 'and', 'total', 'number', 'of', 'photons', 'there', 'is', 'a', 'threshold', 'of', 'the', 'coherent', 'amplitude', 'interfering', 'with', 'the', 'squeezed', 'single', 'photon', 'above', 'which', 'the', 'squeezed', 'single', 'photons', 'outperform', 'the', 'performance', 'of', 'squeezed', 'vacuum', 'showing', 'the', 'highest', 'quantum', 'fisher', 'information', 'when', 'the', 'difference', 'photocurrent', 'measurement', 'is', 'considered', 'we', 'can', 'always', 'find', 'a', 'threshold', 'of', 'the', 'squeezing', 'parameter', 'given', 'the', 'total', 'number', 'of', 'photons', 'and', 'the', 'coherent', 'amplitude', 'above', 'which', 'squeezed', 'single', 'photons', 'can', 'be', 'exploited', 'to', 'reach', 'a', 'better', 'sensitivity', 'with', 'respect', 'to', 'the', 'use', 'of', 'squeezed', 'vacuum', 'states', 'also', 'in', 'the', 'presence', 'of', 'non', 'unit', 'quantum', 'efficiency']] | [-0.13313732812515436, 0.21893710634881594, -0.08630963327566114, 0.016055857544191754, 0.01707336528537174, -0.1334174138875917, 0.06662169944805403, 0.3834075474419082, -0.21977686488236756, -0.3039578760654713, 0.018278728544306105, -0.29670210117713, -0.039429409878376204, 0.23995898697429743, -0.0306471994266105, 0.08647306164583335, 0.08098673965686407, 0.061413937453658154, -0.028333722555245727, -0.21004925838265665, 0.30647253453349454, 0.07567619239069664, 0.3401419174929078, 0.00992184894410177, 0.15860354934269802, 0.01779721794076837, 0.02939294314919374, -0.027086789581256036, -0.0705575727107293, 0.07716402090124738, 0.2117735984753101, 0.07712057426561399, 0.23497747977574665, -0.36210098856916795, -0.18028593866679912, 0.15256335924451167, 0.10521935010149788, 0.17520182945658094, 0.003805208631241933, -0.30561189541640954, 0.008591467922983261, -0.15657407467086346, -0.09979860863337914, -0.040827768902557016, -0.05993352557222049, -0.006286889435842824, -0.26581457742991355, 0.06840711510008894, -0.00306514548137784, -0.04001772879467656, 0.04141188079061416, -0.07048698838513631, -0.05200774704512113, 0.08555458738402917, -0.049608214942213055, 0.0240120249430243, 0.15905772786712846, -0.21173588581508598, -0.13824013905981794, 0.3095682148463451, -0.1245621473223974, -0.19792123946528403, 0.08407435959372192, -0.1930118785550197, -0.048424421267536204, 0.14619483087355128, 0.12137237643966307, 0.09823612822697331, -0.06730371915499489, -0.007605499092740222, -0.03495769087965481, 0.2610576906074316, 0.144914639982371, 0.16633311308896503, 0.22792435246639145, 0.1356324569465449, 0.07206362006732095, 0.22196580750975184, -0.14564489135742545, -0.07369221140785763, -0.3500816207188062, -0.13586055056717342, -0.21352063205857308, 0.0766971718490076, -0.0814558772748569, -0.12113200406042429, 0.41146353741104785, 0.1350519126949784, 0.15869069419419154, -0.002961220122420062, 0.36736639188304065, 0.16355572258456585, 0.03550008004292464, 0.03349481491037668, 0.3401457661201652, 0.14502172609074757, 0.07220890598419386, -0.26557812484172294, -0.003331731216241725, -0.0747457571208286] |
1,802.02923 | Limitation of atmospheric composition by combustion-explosion in
exoplanetary atmospheres | This work presents theoretical studies which combine aspects of combustion
and explosion theory with exoplanetary atmospheric science. Super Earths could
possess a large amount of molecular hydrogen depending on disk, planetary and
stellar properties. Super Earths orbiting pre-main sequence-M-dwarf stars have
been suggested to possess large amounts of O2 produced abiotically via water
photolysis followed by hydrogen escape . If these two constituents were present
simultaneously, such large amounts of H2 and O2 can react via photochemistry to
form up to about 10 Earth oceans. In cases where photochemical removal is slow
so that O2 can indeed build up abiotically, the atmosphere could reach the
combustion explosion limit. Then, H2 and O2 react extremely quickly to form
water together with modest amounts of hydrogen peroxide. These processes set
constraints for H2 O2 atmospheric compositions in Super Earth atmospheres. Our
initial study of the gas-phase oxidation pathways for modest conditions with
Earth insolation and about a tenth of a percent of H2 suggests that H2 is
oxidized by O2 into H2O mostly via HOx and mixed HOx NOx catalyzed cycles.
Regarding other atmospheric species-pairs we find that CO,O2 mixtures could
attain explosive combustive levels on mini gas planets for mid range for the C
to O ratio in the equilibrium chemistry regime for p more than about 1bar.
Regarding CH4,O2 mixtures, a small number of modeled rocky planets assuming
Earth like atmospheres orbiting cooler stars could have compositions at or near
the explosive combustive level although more work is required to investigate
this issue.
| astro-ph.EP | this work presents theoretical studies which combine aspects of combustion and explosion theory with exoplanetary atmospheric science super earths could possess a large amount of molecular hydrogen depending on disk planetary and stellar properties super earths orbiting premain sequencemdwarf stars have been suggested to possess large amounts of o2 produced abiotically via water photolysis followed by hydrogen escape if these two constituents were present simultaneously such large amounts of h2 and o2 can react via photochemistry to form up to about 10 earth oceans in cases where photochemical removal is slow so that o2 can indeed build up abiotically the atmosphere could reach the combustion explosion limit then h2 and o2 react extremely quickly to form water together with modest amounts of hydrogen peroxide these processes set constraints for h2 o2 atmospheric compositions in super earth atmospheres our initial study of the gasphase oxidation pathways for modest conditions with earth insolation and about a tenth of a percent of h2 suggests that h2 is oxidized by o2 into h2o mostly via hox and mixed hox nox catalyzed cycles regarding other atmospheric speciespairs we find that coo2 mixtures could attain explosive combustive levels on mini gas planets for mid range for the c to o ratio in the equilibrium chemistry regime for p more than about 1bar regarding ch4o2 mixtures a small number of modeled rocky planets assuming earth like atmospheres orbiting cooler stars could have compositions at or near the explosive combustive level although more work is required to investigate this issue | [['this', 'work', 'presents', 'theoretical', 'studies', 'which', 'combine', 'aspects', 'of', 'combustion', 'and', 'explosion', 'theory', 'with', 'exoplanetary', 'atmospheric', 'science', 'super', 'earths', 'could', 'possess', 'a', 'large', 'amount', 'of', 'molecular', 'hydrogen', 'depending', 'on', 'disk', 'planetary', 'and', 'stellar', 'properties', 'super', 'earths', 'orbiting', 'premain', 'sequencemdwarf', 'stars', 'have', 'been', 'suggested', 'to', 'possess', 'large', 'amounts', 'of', 'o2', 'produced', 'abiotically', 'via', 'water', 'photolysis', 'followed', 'by', 'hydrogen', 'escape', 'if', 'these', 'two', 'constituents', 'were', 'present', 'simultaneously', 'such', 'large', 'amounts', 'of', 'h2', 'and', 'o2', 'can', 'react', 'via', 'photochemistry', 'to', 'form', 'up', 'to', 'about', '10', 'earth', 'oceans', 'in', 'cases', 'where', 'photochemical', 'removal', 'is', 'slow', 'so', 'that', 'o2', 'can', 'indeed', 'build', 'up', 'abiotically', 'the', 'atmosphere', 'could', 'reach', 'the', 'combustion', 'explosion', 'limit', 'then', 'h2', 'and', 'o2', 'react', 'extremely', 'quickly', 'to', 'form', 'water', 'together', 'with', 'modest', 'amounts', 'of', 'hydrogen', 'peroxide', 'these', 'processes', 'set', 'constraints', 'for', 'h2', 'o2', 'atmospheric', 'compositions', 'in', 'super', 'earth', 'atmospheres', 'our', 'initial', 'study', 'of', 'the', 'gasphase', 'oxidation', 'pathways', 'for', 'modest', 'conditions', 'with', 'earth', 'insolation', 'and', 'about', 'a', 'tenth', 'of', 'a', 'percent', 'of', 'h2', 'suggests', 'that', 'h2', 'is', 'oxidized', 'by', 'o2', 'into', 'h2o', 'mostly', 'via', 'hox', 'and', 'mixed', 'hox', 'nox', 'catalyzed', 'cycles', 'regarding', 'other', 'atmospheric', 'speciespairs', 'we', 'find', 'that', 'coo2', 'mixtures', 'could', 'attain', 'explosive', 'combustive', 'levels', 'on', 'mini', 'gas', 'planets', 'for', 'mid', 'range', 'for', 'the', 'c', 'to', 'o', 'ratio', 'in', 'the', 'equilibrium', 'chemistry', 'regime', 'for', 'p', 'more', 'than', 'about', '1bar', 'regarding', 'ch4o2', 'mixtures', 'a', 'small', 'number', 'of', 'modeled', 'rocky', 'planets', 'assuming', 'earth', 'like', 'atmospheres', 'orbiting', 'cooler', 'stars', 'could', 'have', 'compositions', 'at', 'or', 'near', 'the', 'explosive', 'combustive', 'level', 'although', 'more', 'work', 'is', 'required', 'to', 'investigate', 'this', 'issue']] | [-0.016151027261187147, 0.23499302034123012, 0.02005691676464701, 0.04452256910429385, -0.019321963401239834, -0.07472184230479212, 0.09483669376470194, 0.3612905826102867, -0.1977617075791213, -0.35888137902521533, 0.09197407891490282, -0.2748989170371943, -0.05932432795999202, 0.15850413376031827, -0.05683616568383418, -0.011412619617352873, 0.11410481232946158, -0.06837918234400843, -0.019877386844984673, -0.24621063935559107, 0.25437944448036465, 0.11162596180099948, 0.08480839468991226, 0.06287937603046295, 0.017874360372979754, -0.15370364234168157, 0.007914809205640968, -0.09665632896876154, -0.15631260816429093, 0.09778697554376505, 0.2750837087050563, 0.1305323124209019, 0.1831248201739028, -0.5128591855090519, -0.2959646049213901, 0.08795095337847618, 0.13068455252664443, 0.07554613664012914, -0.06615951093470372, -0.19739378465580856, 0.05907361816071909, -0.16673574468398067, -0.14861969590405763, -0.029331637086414616, 0.06532921989331482, -0.003609106497488433, -0.2752117938626, 0.04997027896416302, 0.023753691417766502, 0.14692472370514864, -0.10597300882213692, -0.19336384523712732, -0.1276128236845377, 0.0609746790554201, 0.036794931772975666, -0.017814599859282215, 0.26173550664232326, -0.10048268560173088, 0.04423216417684457, 0.454395946358455, -0.1467897243779987, -0.05651120525296506, 0.3139913938760471, -0.196142945857153, -0.18501705379670236, 0.23345009431050645, 0.1557890769727679, 0.13948435067229334, -0.16283454652687135, 0.005844141375971015, -0.00936943957363425, 0.18257872072894618, 0.16002301719446896, 0.016328782190074803, 0.3253640217257867, 0.14532770373602116, 0.06994267979491622, 0.08304035862052798, -0.14220877126828288, -0.06814396999274883, -0.13404438963069426, -0.20700609405960527, -0.08259863777393438, 0.10280260147087593, -0.05645214867797446, -0.10774030020627333, 0.25293552452087525, 0.10653847546659802, 0.15521985483600906, -0.050010817013737496, 0.24631662912023922, 0.04570457614164824, 0.05717667732114417, 0.07959077516306749, 0.25558629775747865, 0.14866613015732333, 0.10108143988401, -0.23635313208007558, 0.1563524978884839, 0.01944974000350787] |
1,802.02924 | The GALAH Survey: Stellar streams and how stellar velocity distributions
vary with Galactic longitude, hemisphere and metallicity | Using GALAH survey data of nearby stars, we look at how structure in the
planar (u,v) velocity distribution depends on metallicity and on viewing
direction within the Galaxy. In nearby stars, with distance d < 1 kpc, the
Hercules stream is most strongly seen in higher metallicity stars [Fe/H] > 0.2.
The Hercules stream peak v value depends on viewed galactic longitude, which we
interpret as due to the gap between the stellar stream and more circular orbits
being associated with a specific angular momentum value of about 1640 km/s kpc.
The association of the gap with a particular angular momentum value supports a
bar resonant model for the Hercules stream.
Moving groups previously identified in Hipparcos observations are easiest to
see in stars nearer than 250 pc, and their visibility and peak velocities in
the velocity distributions depends on both viewing direction (galactic
longitude and hemisphere) and metallicity. We infer that there is fine
structure in local velocity distributions that varies over distances of a few
hundred pc in the Galaxy.
| astro-ph.GA | using galah survey data of nearby stars we look at how structure in the planar uv velocity distribution depends on metallicity and on viewing direction within the galaxy in nearby stars with distance d 1 kpc the hercules stream is most strongly seen in higher metallicity stars feh 02 the hercules stream peak v value depends on viewed galactic longitude which we interpret as due to the gap between the stellar stream and more circular orbits being associated with a specific angular momentum value of about 1640 kms kpc the association of the gap with a particular angular momentum value supports a bar resonant model for the hercules stream moving groups previously identified in hipparcos observations are easiest to see in stars nearer than 250 pc and their visibility and peak velocities in the velocity distributions depends on both viewing direction galactic longitude and hemisphere and metallicity we infer that there is fine structure in local velocity distributions that varies over distances of a few hundred pc in the galaxy | [['using', 'galah', 'survey', 'data', 'of', 'nearby', 'stars', 'we', 'look', 'at', 'how', 'structure', 'in', 'the', 'planar', 'uv', 'velocity', 'distribution', 'depends', 'on', 'metallicity', 'and', 'on', 'viewing', 'direction', 'within', 'the', 'galaxy', 'in', 'nearby', 'stars', 'with', 'distance', 'd', '1', 'kpc', 'the', 'hercules', 'stream', 'is', 'most', 'strongly', 'seen', 'in', 'higher', 'metallicity', 'stars', 'feh', '02', 'the', 'hercules', 'stream', 'peak', 'v', 'value', 'depends', 'on', 'viewed', 'galactic', 'longitude', 'which', 'we', 'interpret', 'as', 'due', 'to', 'the', 'gap', 'between', 'the', 'stellar', 'stream', 'and', 'more', 'circular', 'orbits', 'being', 'associated', 'with', 'a', 'specific', 'angular', 'momentum', 'value', 'of', 'about', '1640', 'kms', 'kpc', 'the', 'association', 'of', 'the', 'gap', 'with', 'a', 'particular', 'angular', 'momentum', 'value', 'supports', 'a', 'bar', 'resonant', 'model', 'for', 'the', 'hercules', 'stream', 'moving', 'groups', 'previously', 'identified', 'in', 'hipparcos', 'observations', 'are', 'easiest', 'to', 'see', 'in', 'stars', 'nearer', 'than', '250', 'pc', 'and', 'their', 'visibility', 'and', 'peak', 'velocities', 'in', 'the', 'velocity', 'distributions', 'depends', 'on', 'both', 'viewing', 'direction', 'galactic', 'longitude', 'and', 'hemisphere', 'and', 'metallicity', 'we', 'infer', 'that', 'there', 'is', 'fine', 'structure', 'in', 'local', 'velocity', 'distributions', 'that', 'varies', 'over', 'distances', 'of', 'a', 'few', 'hundred', 'pc', 'in', 'the', 'galaxy']] | [-0.11135978173560408, 0.09969418824116207, -0.08135491078993415, 0.06298201942734201, -0.15442901746753385, -0.05425859499065315, 0.05717375799243147, 0.4690070512101931, -0.2244994467103799, -0.355233909411575, -0.018913788523744136, -0.2936683796455755, 0.023606585464714204, 0.20681666606379784, -0.05366485111333211, -0.06913974778384299, 0.07040608789333526, -0.00013990827000645153, -0.060467634599327164, -0.2141260923434268, 0.3044815956834046, 0.05601735828471754, 0.13415606877054362, -0.05666610576102839, 0.061013502707732294, -0.07599173381767126, -0.06631091678384965, -0.0057170224512982015, -0.16416647088044556, 0.03264003894839655, 0.20333352115909187, 0.11654013302177191, 0.22463708393385304, -0.2903754790450501, -0.15520413534797947, 0.012813568152213359, 0.2237364101689309, 0.013192363950999125, -0.0641867401147679, -0.27067680833039476, 0.06754057649249101, -0.1540546395637862, -0.2276503709035323, 0.12418133875848178, 0.09865760401384358, 0.04952587541466688, -0.17287870679283515, 0.17642989820554195, -0.005134233054431046, 0.17012070548748048, -0.0904335383531254, -0.1508592954946353, -0.09264706675346722, 0.07643045716206817, 0.04161405964850393, 0.1366875808001222, 0.18099233148455182, -0.11731691489215283, -0.003858216723208042, 0.4254485221394776, -0.08477792323144112, -0.05211561157176381, 0.2048646151307313, -0.25494397343958125, -0.1272612541092231, 0.07704750378273756, 0.1966267843675964, 0.1312468180891729, -0.1194719900000457, 0.020605989522985455, -0.06192261887823834, 0.21961107886300477, 0.13079352433491936, 0.04569414982945412, 0.29210850868377536, 0.065142243975253, 0.12973912559887943, 0.014803039857788998, -0.3073758917987374, -0.0879684376735788, -0.22561029498876237, -0.08246016213670374, -0.1170745175667381, 0.047282006043721646, -0.17257442862456254, -0.10861723535995492, 0.3683129834175548, 0.13440979056972804, 0.3072232140406199, 0.02889836269827998, 0.2738942081861965, 0.0652154813404195, 0.14708705545293496, 0.18501735709826736, 0.2914000882767141, 0.1881028905236984, 0.09449315612026325, -0.20246762766995852, 0.10660438967923469, -0.012632072611492785] |
1,802.02925 | A Deep Unsupervised Learning Approach Toward MTBI Identification Using
Diffusion MRI | Mild traumatic brain injury is a growing public health problem with an
estimated incidence of over 1.7 million people annually in US. Diagnosis is
based on clinical history and symptoms, and accurate, concrete measures of
injury are lacking. This work aims to directly use diffusion MR images obtained
within one month of trauma to detect injury, by incorporating deep learning
techniques. To overcome the challenge due to limited training data, we describe
each brain region using the bag of word representation, which specifies the
distribution of representative patch patterns. We apply a convolutional
auto-encoder to learn the patch-level features, from overlapping image patches
extracted from the MR images, to learn features from diffusion MR images of
brain using an unsupervised approach. Our experimental results show that the
bag of word representation using patch level features learnt by the auto
encoder provides similar performance as that using the raw patch patterns, both
significantly outperform earlier work relying on the mean values of MR metrics
in selected brain regions.
| cs.CV | mild traumatic brain injury is a growing public health problem with an estimated incidence of over 17 million people annually in us diagnosis is based on clinical history and symptoms and accurate concrete measures of injury are lacking this work aims to directly use diffusion mr images obtained within one month of trauma to detect injury by incorporating deep learning techniques to overcome the challenge due to limited training data we describe each brain region using the bag of word representation which specifies the distribution of representative patch patterns we apply a convolutional autoencoder to learn the patchlevel features from overlapping image patches extracted from the mr images to learn features from diffusion mr images of brain using an unsupervised approach our experimental results show that the bag of word representation using patch level features learnt by the auto encoder provides similar performance as that using the raw patch patterns both significantly outperform earlier work relying on the mean values of mr metrics in selected brain regions | [['mild', 'traumatic', 'brain', 'injury', 'is', 'a', 'growing', 'public', 'health', 'problem', 'with', 'an', 'estimated', 'incidence', 'of', 'over', '17', 'million', 'people', 'annually', 'in', 'us', 'diagnosis', 'is', 'based', 'on', 'clinical', 'history', 'and', 'symptoms', 'and', 'accurate', 'concrete', 'measures', 'of', 'injury', 'are', 'lacking', 'this', 'work', 'aims', 'to', 'directly', 'use', 'diffusion', 'mr', 'images', 'obtained', 'within', 'one', 'month', 'of', 'trauma', 'to', 'detect', 'injury', 'by', 'incorporating', 'deep', 'learning', 'techniques', 'to', 'overcome', 'the', 'challenge', 'due', 'to', 'limited', 'training', 'data', 'we', 'describe', 'each', 'brain', 'region', 'using', 'the', 'bag', 'of', 'word', 'representation', 'which', 'specifies', 'the', 'distribution', 'of', 'representative', 'patch', 'patterns', 'we', 'apply', 'a', 'convolutional', 'autoencoder', 'to', 'learn', 'the', 'patchlevel', 'features', 'from', 'overlapping', 'image', 'patches', 'extracted', 'from', 'the', 'mr', 'images', 'to', 'learn', 'features', 'from', 'diffusion', 'mr', 'images', 'of', 'brain', 'using', 'an', 'unsupervised', 'approach', 'our', 'experimental', 'results', 'show', 'that', 'the', 'bag', 'of', 'word', 'representation', 'using', 'patch', 'level', 'features', 'learnt', 'by', 'the', 'auto', 'encoder', 'provides', 'similar', 'performance', 'as', 'that', 'using', 'the', 'raw', 'patch', 'patterns', 'both', 'significantly', 'outperform', 'earlier', 'work', 'relying', 'on', 'the', 'mean', 'values', 'of', 'mr', 'metrics', 'in', 'selected', 'brain', 'regions']] | [0.028313336663699604, 0.005000538467520201, -0.10014844145402758, 0.08595685317936705, -0.12899039805069298, -0.14429788671790839, 0.029657766075169078, 0.4228460114283005, -0.26053091712730997, -0.3155865298206277, 0.07410740156234158, -0.31273058089734374, -0.21828684856568625, 0.18032272872765978, -0.1538836458772156, 0.04087462289334473, 0.1270014048459198, 0.07334523022587518, -0.03672940047139937, -0.28391368664566896, 0.30492418719606174, 0.040947719681889524, 0.3652928399401689, -0.028330036327465922, 0.14012073165901606, -0.02342875967148, -0.06422327785657908, -0.014490437746873338, -0.09026217434604437, 0.18608910105997017, 0.3543275541564572, 0.2159112517172638, 0.3228575180725245, -0.4488080983234201, -0.26434070210831384, 0.03792578371208228, 0.117281355652512, 0.1095762463435698, -0.017597371235512152, -0.3969706840043564, 0.1067566373357605, -0.11888529114079421, 0.009278042677268497, -0.08045191165341432, -0.04027440964765735, -0.04742306890593518, -0.2864816335593155, 0.13652224908722285, -0.00646421533289873, 0.1305211813964262, -0.12272927103965671, -0.10932355487864175, 0.015869862535232288, 0.22134607724432728, 0.052384316967242585, 0.09226804244987985, 0.1915071100020268, -0.2048491524465516, -0.11614956630360403, 0.2921133828098456, -0.03008694145940021, -0.17060505746916763, 0.17371623511258846, -0.09706331034118455, -0.09429964064592551, 0.1375024832260912, 0.22337538087259542, 0.07174090194253775, -0.19129919136099205, -0.05289911645991605, -0.02762756656442663, 0.20742218703321533, 0.10284222912288711, -0.05497042145538227, 0.16788623911157127, 0.21776073231378537, -0.02565170598668074, 0.1408746614759442, -0.1998463782180703, -0.0009032162519807587, -0.20765273865803094, -0.06428349286540548, -0.17976386376801587, -0.016259013629144805, -0.10164207085659643, -0.16172194865502243, 0.4383957352388851, 0.23402359254357075, 0.23519256319516077, 0.09258400421648169, 0.28253631573170424, -0.01849091075595, 0.15278741543342966, 0.049752372779889024, 0.13014948656183004, 0.02616857153134878, 0.11695526881229891, -0.16966304627545511, 0.12958421413703058, 0.042724462245551945] |
1,802.02926 | DisMo: A Morphosyntactic, Disfluency and Multi-Word Unit Annotator. An
Evaluation on a Corpus of French Spontaneous and Read Speech | We present DisMo, a multi-level annotator for spoken language corpora that
integrates part-of-speech tagging with basic disfluency detection and
annotation, and multi-word unit recognition. DisMo is a hybrid system that uses
a combination of lexical resources, rules, and statistical models based on
Conditional Random Fields (CRF). In this paper, we present the first public
version of DisMo for French. The system is trained and its performance
evaluated on a 57k-token corpus, including different varieties of French spoken
in three countries (Belgium, France and Switzerland). DisMo supports a
multi-level annotation scheme, in which the tokenisation to minimal word units
is complemented with multi-word unit groupings (each having associated POS
tags), as well as separate levels for annotating disfluencies and discourse
phenomena. We present the system's architecture, linguistic resources and its
hierarchical tag-set. Results show that DisMo achieves a precision of 95%
(finest tag-set) to 96.8% (coarse tag-set) in POS-tagging non-punctuated,
sound-aligned transcriptions of spoken French, while also offering substantial
possibilities for automated multi-level annotation.
| cs.CL | we present dismo a multilevel annotator for spoken language corpora that integrates partofspeech tagging with basic disfluency detection and annotation and multiword unit recognition dismo is a hybrid system that uses a combination of lexical resources rules and statistical models based on conditional random fields crf in this paper we present the first public version of dismo for french the system is trained and its performance evaluated on a 57ktoken corpus including different varieties of french spoken in three countries belgium france and switzerland dismo supports a multilevel annotation scheme in which the tokenisation to minimal word units is complemented with multiword unit groupings each having associated pos tags as well as separate levels for annotating disfluencies and discourse phenomena we present the systems architecture linguistic resources and its hierarchical tagset results show that dismo achieves a precision of 95 finest tagset to 968 coarse tagset in postagging nonpunctuated soundaligned transcriptions of spoken french while also offering substantial possibilities for automated multilevel annotation | [['we', 'present', 'dismo', 'a', 'multilevel', 'annotator', 'for', 'spoken', 'language', 'corpora', 'that', 'integrates', 'partofspeech', 'tagging', 'with', 'basic', 'disfluency', 'detection', 'and', 'annotation', 'and', 'multiword', 'unit', 'recognition', 'dismo', 'is', 'a', 'hybrid', 'system', 'that', 'uses', 'a', 'combination', 'of', 'lexical', 'resources', 'rules', 'and', 'statistical', 'models', 'based', 'on', 'conditional', 'random', 'fields', 'crf', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'public', 'version', 'of', 'dismo', 'for', 'french', 'the', 'system', 'is', 'trained', 'and', 'its', 'performance', 'evaluated', 'on', 'a', '57ktoken', 'corpus', 'including', 'different', 'varieties', 'of', 'french', 'spoken', 'in', 'three', 'countries', 'belgium', 'france', 'and', 'switzerland', 'dismo', 'supports', 'a', 'multilevel', 'annotation', 'scheme', 'in', 'which', 'the', 'tokenisation', 'to', 'minimal', 'word', 'units', 'is', 'complemented', 'with', 'multiword', 'unit', 'groupings', 'each', 'having', 'associated', 'pos', 'tags', 'as', 'well', 'as', 'separate', 'levels', 'for', 'annotating', 'disfluencies', 'and', 'discourse', 'phenomena', 'we', 'present', 'the', 'systems', 'architecture', 'linguistic', 'resources', 'and', 'its', 'hierarchical', 'tagset', 'results', 'show', 'that', 'dismo', 'achieves', 'a', 'precision', 'of', '95', 'finest', 'tagset', 'to', '968', 'coarse', 'tagset', 'in', 'postagging', 'nonpunctuated', 'soundaligned', 'transcriptions', 'of', 'spoken', 'french', 'while', 'also', 'offering', 'substantial', 'possibilities', 'for', 'automated', 'multilevel', 'annotation']] | [-0.07026954847715387, 0.021310982733848505, -0.01459628843003884, 0.09340460362236627, -0.12947880208375864, -0.14515907503664494, 0.10595228373640567, 0.40674764665600377, -0.2228576574852923, -0.3259639906696975, 0.02685490259027574, -0.30377340195700525, -0.10859279863652774, 0.20388010921597016, -0.14424159608606715, 0.03306583836019854, 0.15133103292173472, 0.07159423249249812, -0.006727279392362106, -0.26105721918938796, 0.2861580565229815, 0.049594072448962835, 0.36372797361982523, 0.013186376913927234, 0.19652675901015754, -0.07205253650608938, -0.06005667344288668, -0.06144101726822555, -0.027886623108452115, 0.22090091703139478, 0.3457774139659932, 0.24374077974935063, 0.31953807699901515, -0.3529245925950818, -0.14666470430529444, 0.008055025698922691, 0.10443944905346143, 0.0748645678815592, -0.02193387295992579, -0.36545975255430674, 0.08755079165566712, -0.23408240943099373, 0.0714709793246584, -0.1292776825843248, 0.004306122711568605, 0.004373158208545646, -0.2624235663264699, 0.07536105830349697, 0.08929268594074528, 0.18328638622770085, -0.0433022089782753, -0.15003539850149536, 0.01180075447045965, 0.19754074697557372, -0.031163505560834893, 0.049172832925978585, 0.09799281742380117, -0.15064108483929886, -0.1837124794081319, 0.3981274665333331, -0.09237613459408749, -0.21756509186816403, 0.1889603948002332, -0.04799899084464414, -0.2343056889483705, 0.019202093221247198, 0.2208388073311653, 0.05823456160906062, -0.1944327878241893, 0.023339501812006346, -0.05668952560736216, 0.27942556731868534, 0.10697109766770155, -0.004779407646856271, 0.17772656640954665, 0.30619737675297076, -0.05627270666300319, 0.14140004445289378, -0.10321282012628216, -0.05199028519418789, -0.22113773892051541, -0.16095289104559923, -0.11580469592445297, -0.07045957030313729, -0.0703676764177544, -0.16794416432312573, 0.3781607162957471, 0.176256485900376, 0.10422402303247509, 0.12966115103263293, 0.31229441667092034, -0.032956950354855505, 0.10388033528870437, 0.08232002799486508, 0.0553254994800227, -0.03982513872615527, 0.1616322301375476, -0.1319106177717913, 0.06806885439436883, 0.10018715917281043] |
1,802.02927 | From quantum to classical modelling of radiation reaction: a focus on
the radiation spectrum | Soon available multi petawatt ultra-high-intensity (UHI) lasers will allow us
to probe high-amplitude electromagnetic fields interacting with either
ultra-relativistic electron beams or hot plasmas in the so-called moderately
quantum regime. The correct modelling of the back-reaction of high-energy
photon emission on the radiating electron dynamics, a.k.a. radiation reaction,
in this regime is a key point for UHI physics. This will lead to both
validation of theoretical predictions on the photon spectrum emitted during the
laser-particle interaction and to the generation of high energy photon sources.
In this paper we analyse in detail such emission using recently developed
models to account for radiation reaction. We show how the predictions on the
spectrum can be linked to a reduced description of the electron distribution
function in terms of the first energy moments. The temporal evolution of the
spectrum is discussed, as well as the parameters for which quantum effects
induce hardening of the spectrum.
| physics.plasm-ph | soon available multi petawatt ultrahighintensity uhi lasers will allow us to probe highamplitude electromagnetic fields interacting with either ultrarelativistic electron beams or hot plasmas in the socalled moderately quantum regime the correct modelling of the backreaction of highenergy photon emission on the radiating electron dynamics aka radiation reaction in this regime is a key point for uhi physics this will lead to both validation of theoretical predictions on the photon spectrum emitted during the laserparticle interaction and to the generation of high energy photon sources in this paper we analyse in detail such emission using recently developed models to account for radiation reaction we show how the predictions on the spectrum can be linked to a reduced description of the electron distribution function in terms of the first energy moments the temporal evolution of the spectrum is discussed as well as the parameters for which quantum effects induce hardening of the spectrum | [['soon', 'available', 'multi', 'petawatt', 'ultrahighintensity', 'uhi', 'lasers', 'will', 'allow', 'us', 'to', 'probe', 'highamplitude', 'electromagnetic', 'fields', 'interacting', 'with', 'either', 'ultrarelativistic', 'electron', 'beams', 'or', 'hot', 'plasmas', 'in', 'the', 'socalled', 'moderately', 'quantum', 'regime', 'the', 'correct', 'modelling', 'of', 'the', 'backreaction', 'of', 'highenergy', 'photon', 'emission', 'on', 'the', 'radiating', 'electron', 'dynamics', 'aka', 'radiation', 'reaction', 'in', 'this', 'regime', 'is', 'a', 'key', 'point', 'for', 'uhi', 'physics', 'this', 'will', 'lead', 'to', 'both', 'validation', 'of', 'theoretical', 'predictions', 'on', 'the', 'photon', 'spectrum', 'emitted', 'during', 'the', 'laserparticle', 'interaction', 'and', 'to', 'the', 'generation', 'of', 'high', 'energy', 'photon', 'sources', 'in', 'this', 'paper', 'we', 'analyse', 'in', 'detail', 'such', 'emission', 'using', 'recently', 'developed', 'models', 'to', 'account', 'for', 'radiation', 'reaction', 'we', 'show', 'how', 'the', 'predictions', 'on', 'the', 'spectrum', 'can', 'be', 'linked', 'to', 'a', 'reduced', 'description', 'of', 'the', 'electron', 'distribution', 'function', 'in', 'terms', 'of', 'the', 'first', 'energy', 'moments', 'the', 'temporal', 'evolution', 'of', 'the', 'spectrum', 'is', 'discussed', 'as', 'well', 'as', 'the', 'parameters', 'for', 'which', 'quantum', 'effects', 'induce', 'hardening', 'of', 'the', 'spectrum']] | [-0.07020210240060758, 0.19438311759088384, -0.09019343455829106, 0.10311354104698311, -0.023386110147265226, -0.09292065293993801, -0.011184456644849362, 0.35448681202864174, -0.22842851425459804, -0.31016708675183746, 0.03055478825377864, -0.29447273389240236, -0.033017967354297934, 0.21438500666040214, 0.011129188256362747, 0.03547198017507693, 0.0503865299335877, -0.01618813418348222, 0.0036874733632430434, -0.13615220649769885, 0.3020210508379693, 0.17436907258601614, 0.27763852081874285, 0.09844364705618079, 0.08524722203238573, 0.03309756525681893, -0.016113588137637923, -0.02926610829308629, -0.11043374834116548, 0.0667208843679921, 0.2305609034618723, 0.06644912868566615, 0.20160251248039698, -0.443479467256877, -0.26760977101328437, 0.09365597910762422, 0.16079483990018306, 0.11740426590748891, -0.06598459952127948, -0.243253353088604, 0.00048649472821699947, -0.19462656227896283, -0.1493567063375131, -0.042941876200003254, -0.017243120764186114, 0.05475706389284154, -0.267530791375688, 0.04974260454151878, 0.013754315593120592, -0.011240576271359859, -0.05566346428301921, -0.025058109864020434, -0.006818640701423742, 0.0934047691683334, 0.04434791962787705, 0.005490319070017186, 0.15556535591780343, -0.16147626804128154, -0.10387945253598063, 0.4097121302651143, -0.09363084162377115, -0.1275459176272546, 0.17351719065520324, -0.21130286294991443, -0.13301770877718044, 0.17115816426782035, 0.20092410026853413, 0.10937657991215881, -0.13763782590027213, 0.03796757684712678, 0.04054470181673471, 0.15693472218672946, 0.053334067900371006, 0.0972520319965521, 0.2605405472598872, 0.15962227302799492, -0.0324805796270467, 0.13221361093325723, -0.1386912028476792, -0.07362392915743649, -0.30543776683350043, -0.10906101152068004, -0.15971901054849455, 0.08783382015434127, -0.021730241118156732, -0.1475161593709919, 0.4231208054115996, 0.15432562222275392, 0.14721054974698314, -0.045789750347275435, 0.3089908560076238, 0.16387494697425464, 0.01884169587068946, 0.052366333053214476, 0.30448511437709, 0.1465408229590761, 0.12106656437390484, -0.24973796721621366, 0.017749994533675675, 0.004475626967369432] |
1,802.02928 | Statistical tests for extreme precipitation volumes | The approaches, based on the negative binomial model for the distribution of
duration of the wet periods measured in days, are proposed to the definition of
extreme precipitation. This model demonstrates excellent fit with real data and
provides a theoretical base for the determination of asymptotic approximations
to the distributions of the maximum daily precipitation volume within a wet
period as well as the total precipitation volume over a wet period. The first
approach to the definition (and determination) of extreme precipitation is
based on the tempered Snedecor-Fisher distribution of the maximum daily
precipitation. According to this approach, a daily precipitation volume is
considered to be extreme, if it exceeds a certain (pre-defined) quantile of the
tempered Snedecor--Fisher distribution. The second approach is based on that
the total precipitation volume for a wet period has the gamma distribution.
Hence, the hypothesis that the total precipitation volume during a certain wet
period is extremely large can be formulated as the homogeneity hypothesis of a
sample from the gamma distribution. Two equivalent tests are proposed for
testing this hypothesis. Both of these tests deal with the relative
contribution of the total precipitation volume for a wet period to the
considered set (sample) of successive wet periods. Within the second approach
it is possible to introduce the notions of relatively and absolutely extreme
precipitation volumes. The results of the application of these tests to real
data are presented yielding the conclusion that the intensity of wet periods
with extreme large precipitation volume increases.
| stat.ME math.PR | the approaches based on the negative binomial model for the distribution of duration of the wet periods measured in days are proposed to the definition of extreme precipitation this model demonstrates excellent fit with real data and provides a theoretical base for the determination of asymptotic approximations to the distributions of the maximum daily precipitation volume within a wet period as well as the total precipitation volume over a wet period the first approach to the definition and determination of extreme precipitation is based on the tempered snedecorfisher distribution of the maximum daily precipitation according to this approach a daily precipitation volume is considered to be extreme if it exceeds a certain predefined quantile of the tempered snedecorfisher distribution the second approach is based on that the total precipitation volume for a wet period has the gamma distribution hence the hypothesis that the total precipitation volume during a certain wet period is extremely large can be formulated as the homogeneity hypothesis of a sample from the gamma distribution two equivalent tests are proposed for testing this hypothesis both of these tests deal with the relative contribution of the total precipitation volume for a wet period to the considered set sample of successive wet periods within the second approach it is possible to introduce the notions of relatively and absolutely extreme precipitation volumes the results of the application of these tests to real data are presented yielding the conclusion that the intensity of wet periods with extreme large precipitation volume increases | [['the', 'approaches', 'based', 'on', 'the', 'negative', 'binomial', 'model', 'for', 'the', 'distribution', 'of', 'duration', 'of', 'the', 'wet', 'periods', 'measured', 'in', 'days', 'are', 'proposed', 'to', 'the', 'definition', 'of', 'extreme', 'precipitation', 'this', 'model', 'demonstrates', 'excellent', 'fit', 'with', 'real', 'data', 'and', 'provides', 'a', 'theoretical', 'base', 'for', 'the', 'determination', 'of', 'asymptotic', 'approximations', 'to', 'the', 'distributions', 'of', 'the', 'maximum', 'daily', 'precipitation', 'volume', 'within', 'a', 'wet', 'period', 'as', 'well', 'as', 'the', 'total', 'precipitation', 'volume', 'over', 'a', 'wet', 'period', 'the', 'first', 'approach', 'to', 'the', 'definition', 'and', 'determination', 'of', 'extreme', 'precipitation', 'is', 'based', 'on', 'the', 'tempered', 'snedecorfisher', 'distribution', 'of', 'the', 'maximum', 'daily', 'precipitation', 'according', 'to', 'this', 'approach', 'a', 'daily', 'precipitation', 'volume', 'is', 'considered', 'to', 'be', 'extreme', 'if', 'it', 'exceeds', 'a', 'certain', 'predefined', 'quantile', 'of', 'the', 'tempered', 'snedecorfisher', 'distribution', 'the', 'second', 'approach', 'is', 'based', 'on', 'that', 'the', 'total', 'precipitation', 'volume', 'for', 'a', 'wet', 'period', 'has', 'the', 'gamma', 'distribution', 'hence', 'the', 'hypothesis', 'that', 'the', 'total', 'precipitation', 'volume', 'during', 'a', 'certain', 'wet', 'period', 'is', 'extremely', 'large', 'can', 'be', 'formulated', 'as', 'the', 'homogeneity', 'hypothesis', 'of', 'a', 'sample', 'from', 'the', 'gamma', 'distribution', 'two', 'equivalent', 'tests', 'are', 'proposed', 'for', 'testing', 'this', 'hypothesis', 'both', 'of', 'these', 'tests', 'deal', 'with', 'the', 'relative', 'contribution', 'of', 'the', 'total', 'precipitation', 'volume', 'for', 'a', 'wet', 'period', 'to', 'the', 'considered', 'set', 'sample', 'of', 'successive', 'wet', 'periods', 'within', 'the', 'second', 'approach', 'it', 'is', 'possible', 'to', 'introduce', 'the', 'notions', 'of', 'relatively', 'and', 'absolutely', 'extreme', 'precipitation', 'volumes', 'the', 'results', 'of', 'the', 'application', 'of', 'these', 'tests', 'to', 'real', 'data', 'are', 'presented', 'yielding', 'the', 'conclusion', 'that', 'the', 'intensity', 'of', 'wet', 'periods', 'with', 'extreme', 'large', 'precipitation', 'volume', 'increases']] | [-0.07325780879589729, 0.15124878568761052, -0.1319232241101563, 0.06973460836987942, 0.004538344115018845, -0.04073269887827337, 0.07997207833826542, 0.33783778753131627, -0.22185239635407925, -0.3360146044548601, 0.13524633152922616, -0.2501321740326239, -0.10509167334809899, 0.2166503223609179, -0.09500477967597544, 0.05193530279770493, 0.0553780982112512, 0.02424176396615803, -0.05599157755100168, -0.29045956175308674, 0.2627881478369236, 0.09746672631800175, 0.33220738733373584, 0.02958703516237438, 0.10461450716480612, 0.008863101080991328, -0.06965018354461062, -0.007768328253441723, -0.10247676625670284, 0.12674105528742075, 0.22261893951706588, 0.12919978670217097, 0.28373772619664667, -0.36770487046957717, -0.24664656157791615, 0.11739137761411257, 0.027719475760124623, 0.0001803661985322833, 0.00015967897744849325, -0.19188101274520158, 0.09283644997142255, -0.17148377816565336, -0.13475263768341392, -0.01894574115984142, 0.04602954298071563, 0.043130122069269416, -0.3107844536304474, 0.12247642823401839, 0.007498813656769926, 0.08202284862007946, -0.09291027030348778, -0.11260270888917148, -0.027337905619293452, 0.10329932596348226, 0.10211279941536486, -0.02300307285087183, 0.14060041337134316, -0.033175916664185935, -0.05296603362262249, 0.3849743387587368, -0.062170006638159976, -0.1439612763039768, 0.17604633337911219, -0.19152262608334422, -0.09324728261737619, 0.17272307332232595, 0.1991069956421852, 0.10749168732669205, -0.1391728539057076, 0.0005662317939568311, -0.029909686802420767, 0.14711945115029812, 0.08523041331395508, -0.058222670186311005, 0.22439668174181132, 0.19232141286833213, 0.066856147964485, 0.10665203213668428, -0.1627164321700111, -0.12040822509140707, -0.30143425887078046, -0.16556054437533022, -0.2109809048548341, 0.020414810132235287, -0.12626907296088757, -0.2071356544662267, 0.3732402189290151, 0.10396273419540375, 0.21218540846463294, 0.06846395579911768, 0.28336359368264674, 0.09662905024160864, 0.038435338339826555, 0.021582646222785114, 0.19336647118162364, 0.11487099054083229, 0.10279103517485783, -0.18774361237999984, 0.13339976836740972, 0.010789513438008725] |
1,802.02929 | Kostant's pair of Lie type and conformal embeddings | We deal with some aspects of the theory of conformal embeddings of affine
vertex algebras, providing a new proof of the Symmetric Space Theorem and a
criterion for conformal embeddings of equal rank subalgebras. We finally study
some examples of embeddings at the critical level. We prove a criterion for
embeddings at the critical level which enables us to prove equality of certain
central elements.
| math.RT | we deal with some aspects of the theory of conformal embeddings of affine vertex algebras providing a new proof of the symmetric space theorem and a criterion for conformal embeddings of equal rank subalgebras we finally study some examples of embeddings at the critical level we prove a criterion for embeddings at the critical level which enables us to prove equality of certain central elements | [['we', 'deal', 'with', 'some', 'aspects', 'of', 'the', 'theory', 'of', 'conformal', 'embeddings', 'of', 'affine', 'vertex', 'algebras', 'providing', 'a', 'new', 'proof', 'of', 'the', 'symmetric', 'space', 'theorem', 'and', 'a', 'criterion', 'for', 'conformal', 'embeddings', 'of', 'equal', 'rank', 'subalgebras', 'we', 'finally', 'study', 'some', 'examples', 'of', 'embeddings', 'at', 'the', 'critical', 'level', 'we', 'prove', 'a', 'criterion', 'for', 'embeddings', 'at', 'the', 'critical', 'level', 'which', 'enables', 'us', 'to', 'prove', 'equality', 'of', 'certain', 'central', 'elements']] | [-0.11043139830088386, 0.05253066897678834, -0.07768316462349434, 0.11029855102443924, -0.08786376840076768, -0.16324319092270273, 0.06923542560543865, 0.31090487187298443, -0.2890728664656098, -0.21446613752498075, 0.10720401647715615, -0.29927677619629184, -0.14700359667722995, 0.18493487763290223, -0.09347837663685474, 0.016970493673132015, 0.04084318518065489, 0.136593821644783, -0.1633486195682333, -0.2781631478896508, 0.4229219581000507, -0.021388467132615354, 0.2674417212032355, 0.12045718129867544, 0.16713618530081406, 0.028723701318869223, -0.023881960259034083, -0.0005333358354759044, -0.21386010751414758, 0.19831384999247698, 0.2995684674726083, 0.11876831635689507, 0.27866797825464834, -0.3405219030781434, -0.1427517518759347, 0.17266015568031715, 0.107025287558253, 0.11510340471644527, -0.012307863926085141, -0.2749356560409069, 0.1436515911947936, -0.15031974087827482, -0.19221050356729671, -0.10377374077932193, -0.01547258070562608, -0.018268809127263152, -0.2725268964154216, -0.0008107517559367876, 0.1672213858136764, 0.11029269077743475, -0.09220069877516765, -0.05957039925986184, 0.0007075660933668797, 0.10687230072485712, -0.006174659528411352, 0.004591678155478663, 0.08598189189170416, -0.13008630209817337, -0.14455950861940017, 0.3395476717215318, 0.020308159029362005, -0.23116301525957308, 0.1627271592617035, -0.15233504479894272, -0.2165937280568939, 0.03895611293040789, 0.16249461676209018, 0.09982469298993238, -0.05625025955243752, 0.14645293776142912, -0.07732324068649457, 0.06749253995680751, 0.10955330854138502, 0.04643603388506633, 0.17614711296673005, 0.09900651697355967, 0.1181950447937617, 0.18131483796124276, 0.020577243658212514, -0.04429933606432034, -0.3892592568810169, -0.19019458963750646, -0.08294485590349022, 0.07722066741150159, -0.1925714066751355, -0.16543785471182604, 0.44270546707826164, 0.11529043748965845, 0.19319751023386533, 0.15468988976118944, 0.18789911487927805, 0.09075451904477981, 0.08052624984859275, 0.0610086845807158, 0.14106492179607114, 0.2136566985828372, -0.009112598850893286, -0.09191658795954516, -0.049907578621059656, 0.24020454676535266] |
1,802.0293 | Evolution of the Science Fiction Writer's Capacity to Imagine the Future | Drawing upon a body of research on the evolution of creativity, this paper
proposes a theory of how, when, and why the forward-thinking story-telling
abilities of humans evolved, culminating in the visionary abilities of science
fiction writers. The ability to recursively chain thoughts together evolved
approximately two million years ago. Language abilities, and the ability to
shift between different modes of thought, evolved approximately 100,000 years
ago. Science fiction dates to at least the second Century AD. It is suggested
that well before this time, but after 100,000 years ago, and concurrent with
the evolution of a division of labour between creators and imitators there
arose a division of labour between past, present, and future thinkers.
Agent-based model research suggests there are social benefits to the evolution
of individual differences in creativity such that there is a balance between
novelty-generating creators and continuity-perpetuating imitators. A balance
between individuals focused on the past, present, and future would be expected
to yield similar adaptive benefits.
| q-bio.NC | drawing upon a body of research on the evolution of creativity this paper proposes a theory of how when and why the forwardthinking storytelling abilities of humans evolved culminating in the visionary abilities of science fiction writers the ability to recursively chain thoughts together evolved approximately two million years ago language abilities and the ability to shift between different modes of thought evolved approximately 100000 years ago science fiction dates to at least the second century ad it is suggested that well before this time but after 100000 years ago and concurrent with the evolution of a division of labour between creators and imitators there arose a division of labour between past present and future thinkers agentbased model research suggests there are social benefits to the evolution of individual differences in creativity such that there is a balance between noveltygenerating creators and continuityperpetuating imitators a balance between individuals focused on the past present and future would be expected to yield similar adaptive benefits | [['drawing', 'upon', 'a', 'body', 'of', 'research', 'on', 'the', 'evolution', 'of', 'creativity', 'this', 'paper', 'proposes', 'a', 'theory', 'of', 'how', 'when', 'and', 'why', 'the', 'forwardthinking', 'storytelling', 'abilities', 'of', 'humans', 'evolved', 'culminating', 'in', 'the', 'visionary', 'abilities', 'of', 'science', 'fiction', 'writers', 'the', 'ability', 'to', 'recursively', 'chain', 'thoughts', 'together', 'evolved', 'approximately', 'two', 'million', 'years', 'ago', 'language', 'abilities', 'and', 'the', 'ability', 'to', 'shift', 'between', 'different', 'modes', 'of', 'thought', 'evolved', 'approximately', '100000', 'years', 'ago', 'science', 'fiction', 'dates', 'to', 'at', 'least', 'the', 'second', 'century', 'ad', 'it', 'is', 'suggested', 'that', 'well', 'before', 'this', 'time', 'but', 'after', '100000', 'years', 'ago', 'and', 'concurrent', 'with', 'the', 'evolution', 'of', 'a', 'division', 'of', 'labour', 'between', 'creators', 'and', 'imitators', 'there', 'arose', 'a', 'division', 'of', 'labour', 'between', 'past', 'present', 'and', 'future', 'thinkers', 'agentbased', 'model', 'research', 'suggests', 'there', 'are', 'social', 'benefits', 'to', 'the', 'evolution', 'of', 'individual', 'differences', 'in', 'creativity', 'such', 'that', 'there', 'is', 'a', 'balance', 'between', 'noveltygenerating', 'creators', 'and', 'continuityperpetuating', 'imitators', 'a', 'balance', 'between', 'individuals', 'focused', 'on', 'the', 'past', 'present', 'and', 'future', 'would', 'be', 'expected', 'to', 'yield', 'similar', 'adaptive', 'benefits']] | [-0.06546084696111726, 0.12542648501231435, -0.11576722956534406, 0.06638695679891346, -0.13179091632515133, -0.10582414647182507, 0.07703693102038703, 0.4059940630089931, -0.24721839109447247, -0.3690328398164107, 0.057098676081058446, -0.2910475449301071, -0.18048850371305664, 0.1652392393588349, -0.10108141497830334, -0.03058973215708382, 0.09178517855738538, 0.035065516152691024, -0.009523015953773944, -0.3312219863537676, 0.27143703702177785, 0.10630322769515632, 0.26263890263294765, 0.015884751717195562, 0.11828692113801328, -0.02167135301213827, -0.08340280409974642, -0.02823626689948373, -0.09514560376885796, 0.174693853558932, 0.3168639246409076, 0.25184330433861624, 0.44966331788379216, -0.47586191649207416, -0.19129391493541853, 0.08955498890638906, 0.13249553589480031, 0.05537637762193169, -0.02811686674375897, -0.25063962387557354, 0.01586512473675058, -0.21436134712576796, -0.09257250646511035, -0.00746913540382401, 0.12829168836632454, -0.0193843727248796, -0.14720134558850287, 0.05638541467487812, 0.03804661454676263, 0.14658360466106524, -0.006001470775360831, -0.12786569031568604, 0.012278729495852722, 0.20645391110346004, 0.10947980024773767, 0.02607900599272262, 0.11805701766868834, -0.11561212213478567, -0.16305464879988898, 0.3646148466244803, -0.011796858247169055, -0.05465175591767853, 0.24444868077772744, -0.12521542364048846, -0.1003707238698598, 0.07446507985200386, 0.16544258912088153, 0.057841375821576634, -0.16639051938283775, -0.021401132624350512, 0.0009279591913525918, 0.1782730359364278, 0.12205195556227003, -0.02142007979896984, 0.2851808970238759, 0.204532073077497, 0.005923224470624411, 0.05130772119003307, 0.021888956812250872, -0.1681415433735118, -0.1820011158034159, -0.15682084153851736, -0.09931475341519606, 0.07664262628043939, 0.004026896584115963, -0.089180543532838, 0.3868742031132027, 0.16507133738892515, 0.1429159538473309, 0.050610781739818755, 0.2725920169411794, -0.0183942199226249, 0.10480119303007673, 0.07762319607781651, 0.217138194684402, 0.060501580531506435, 0.19600287313220202, -0.16669572047167602, 0.10408701966024982, -0.01599450519320017] |
1,802.02931 | Topological indexes in symmetry preserving dynamics | The quench dynamics of topological phases have received intensive
investigations in recent years. In this work, we prove exactly that the
topological invariants for both $\mathbb{Z}$ and $\mathbb{Z}_2$ indexes are
independent of time in symmetry preserving dynamics. We first reach this
conclusion by a direct relation between the time derivative of Berry connection
and the Hamiltonian energy based on the time dependent Hellman-Feynman theorem,
with which we show exactly that the topological indexes for systems without and
with time reversal symmetry are unchanged during evolution. In contrast, the
geometry phase without symmetry protection in a closed parameter space can
change dramtically with time, as revealed from the parameterized Landau-Zener
model. Then we interpret this result by showing that the time dependent wave
function is essentially the eigenvector of an auxiliary Hamiltonian, which has
exactly the same spectra and symmetries as the original Hamiltonian. For this
reason, the adiabatic evolution between the original and auxiliary Hamiltonian
will not lead to gap closing and reopening, thus the topological indexes are
independent of time. This result has generality and can be applied to models
with other symmetries and dimensions, and may even be applied to gapless
phases. Finally, possible ways to outreach this rigorous result are discussed.
| quant-ph | the quench dynamics of topological phases have received intensive investigations in recent years in this work we prove exactly that the topological invariants for both mathbbz and mathbbz_2 indexes are independent of time in symmetry preserving dynamics we first reach this conclusion by a direct relation between the time derivative of berry connection and the hamiltonian energy based on the time dependent hellmanfeynman theorem with which we show exactly that the topological indexes for systems without and with time reversal symmetry are unchanged during evolution in contrast the geometry phase without symmetry protection in a closed parameter space can change dramtically with time as revealed from the parameterized landauzener model then we interpret this result by showing that the time dependent wave function is essentially the eigenvector of an auxiliary hamiltonian which has exactly the same spectra and symmetries as the original hamiltonian for this reason the adiabatic evolution between the original and auxiliary hamiltonian will not lead to gap closing and reopening thus the topological indexes are independent of time this result has generality and can be applied to models with other symmetries and dimensions and may even be applied to gapless phases finally possible ways to outreach this rigorous result are discussed | [['the', 'quench', 'dynamics', 'of', 'topological', 'phases', 'have', 'received', 'intensive', 'investigations', 'in', 'recent', 'years', 'in', 'this', 'work', 'we', 'prove', 'exactly', 'that', 'the', 'topological', 'invariants', 'for', 'both', 'mathbbz', 'and', 'mathbbz_2', 'indexes', 'are', 'independent', 'of', 'time', 'in', 'symmetry', 'preserving', 'dynamics', 'we', 'first', 'reach', 'this', 'conclusion', 'by', 'a', 'direct', 'relation', 'between', 'the', 'time', 'derivative', 'of', 'berry', 'connection', 'and', 'the', 'hamiltonian', 'energy', 'based', 'on', 'the', 'time', 'dependent', 'hellmanfeynman', 'theorem', 'with', 'which', 'we', 'show', 'exactly', 'that', 'the', 'topological', 'indexes', 'for', 'systems', 'without', 'and', 'with', 'time', 'reversal', 'symmetry', 'are', 'unchanged', 'during', 'evolution', 'in', 'contrast', 'the', 'geometry', 'phase', 'without', 'symmetry', 'protection', 'in', 'a', 'closed', 'parameter', 'space', 'can', 'change', 'dramtically', 'with', 'time', 'as', 'revealed', 'from', 'the', 'parameterized', 'landauzener', 'model', 'then', 'we', 'interpret', 'this', 'result', 'by', 'showing', 'that', 'the', 'time', 'dependent', 'wave', 'function', 'is', 'essentially', 'the', 'eigenvector', 'of', 'an', 'auxiliary', 'hamiltonian', 'which', 'has', 'exactly', 'the', 'same', 'spectra', 'and', 'symmetries', 'as', 'the', 'original', 'hamiltonian', 'for', 'this', 'reason', 'the', 'adiabatic', 'evolution', 'between', 'the', 'original', 'and', 'auxiliary', 'hamiltonian', 'will', 'not', 'lead', 'to', 'gap', 'closing', 'and', 'reopening', 'thus', 'the', 'topological', 'indexes', 'are', 'independent', 'of', 'time', 'this', 'result', 'has', 'generality', 'and', 'can', 'be', 'applied', 'to', 'models', 'with', 'other', 'symmetries', 'and', 'dimensions', 'and', 'may', 'even', 'be', 'applied', 'to', 'gapless', 'phases', 'finally', 'possible', 'ways', 'to', 'outreach', 'this', 'rigorous', 'result', 'are', 'discussed']] | [-0.14416633287457328, 0.18672701285292082, -0.1084230899451796, 0.03980508988454773, -0.0694057152244111, -0.12683122286233556, 0.041640239889306825, 0.380656084715586, -0.2875826838288658, -0.33148268510110385, 0.10616694065900474, -0.23704344836141675, -0.16006420901861831, 0.15394955906406815, -0.03348187593114677, 0.0543823972243467, 0.02599497161704698, 0.015055272241898359, -0.13374830827402556, -0.2538784934882203, 0.30148038598410604, 0.01958041125564409, 0.26215415661282876, 0.06277704142318496, 0.042283741765302314, 0.01782283243227732, 0.002938771386415207, 0.01367899899705304, -0.11966111560479314, 0.03983065983516883, 0.24452314050398263, 0.06038939132487913, 0.19905366951581366, -0.452099058235734, -0.22997546012127965, 0.1030844513537922, 0.13562048276888639, 0.12966889645124377, -0.028238610338690354, -0.3026436960618264, 0.04955533756117515, -0.14545812529713611, -0.13419436352336642, -0.10319102255070095, 0.04957463474843302, -0.0269245111287154, -0.20449110636088466, 0.09106085725642483, 0.09179394081317513, 0.04929362157396422, -0.06704388794447914, -0.03967191383650921, -0.06832570166515159, 0.12703554299855008, 0.09994300172992253, 0.030099446534321374, 0.05170716547115885, -0.07826278962910616, -0.16171808544950092, 0.3719564089872714, -0.059110657704519246, -0.19341726786929545, 0.1721194344997094, -0.1203593808925066, -0.15319486904494795, 0.0933179393922204, 0.11026611092862824, 0.0916712250425182, -0.10634610412890101, 0.11482069505524266, -0.019823172946820112, 0.1580634686816025, 0.03695462758336308, 0.0516878935228001, 0.1902835360668563, 0.10396778411828349, 0.08632686328753059, 0.13648972334024803, -0.028816840935698047, -0.1250825568502012, -0.3003379275891563, -0.17569965282409208, -0.21624008050014085, 0.07139030896417402, -0.07288816757363971, -0.12475562658564651, 0.45800224850023064, 0.15690758745839792, 0.19174284406988124, 0.049715429430900904, 0.2659667673024115, 0.17135802808612255, 0.06211919282858944, 0.06673204777487025, 0.23027225339204863, 0.08996236515736088, 0.08903161560533926, -0.21820514801352886, 0.05822701831210606, 0.0788642387421976] |
1,802.02932 | Lower Bounds for the Fair Resource Allocation Problem | The $\alpha$-fair resource allocation problem has received remarkable
attention and has been studied in numerous application fields. Several
algorithms have been proposed in the context of $\alpha$-fair resource sharing
to distributively compute its value. However, little work has been done on its
structural properties. In this work, we present a lower bound for the optimal
solution of the weighted $\alpha$-fair resource allocation problem and compare
it with existing propositions in the literature. Our derivations rely on a
localization property verified by optimization problems with separable
objective that permit one to better exploit their local structures. We give a
local version of the well-known midpoint domination axiom used to axiomatically
build the Nash Bargaining Solution (or proportionally fair resource allocation
problem). Moreover, we show how our lower bound can improve the performances of
a distributed algorithm based on the Alternating Directions Method of
Multipliers (ADMM). The evaluation of the algorithm shows that our lower bound
can considerably reduce its convergence time up to two orders of magnitude
compared to when the bound is not used at all or is simply looser.
| cs.NI math.OC | the alphafair resource allocation problem has received remarkable attention and has been studied in numerous application fields several algorithms have been proposed in the context of alphafair resource sharing to distributively compute its value however little work has been done on its structural properties in this work we present a lower bound for the optimal solution of the weighted alphafair resource allocation problem and compare it with existing propositions in the literature our derivations rely on a localization property verified by optimization problems with separable objective that permit one to better exploit their local structures we give a local version of the wellknown midpoint domination axiom used to axiomatically build the nash bargaining solution or proportionally fair resource allocation problem moreover we show how our lower bound can improve the performances of a distributed algorithm based on the alternating directions method of multipliers admm the evaluation of the algorithm shows that our lower bound can considerably reduce its convergence time up to two orders of magnitude compared to when the bound is not used at all or is simply looser | [['the', 'alphafair', 'resource', 'allocation', 'problem', 'has', 'received', 'remarkable', 'attention', 'and', 'has', 'been', 'studied', 'in', 'numerous', 'application', 'fields', 'several', 'algorithms', 'have', 'been', 'proposed', 'in', 'the', 'context', 'of', 'alphafair', 'resource', 'sharing', 'to', 'distributively', 'compute', 'its', 'value', 'however', 'little', 'work', 'has', 'been', 'done', 'on', 'its', 'structural', 'properties', 'in', 'this', 'work', 'we', 'present', 'a', 'lower', 'bound', 'for', 'the', 'optimal', 'solution', 'of', 'the', 'weighted', 'alphafair', 'resource', 'allocation', 'problem', 'and', 'compare', 'it', 'with', 'existing', 'propositions', 'in', 'the', 'literature', 'our', 'derivations', 'rely', 'on', 'a', 'localization', 'property', 'verified', 'by', 'optimization', 'problems', 'with', 'separable', 'objective', 'that', 'permit', 'one', 'to', 'better', 'exploit', 'their', 'local', 'structures', 'we', 'give', 'a', 'local', 'version', 'of', 'the', 'wellknown', 'midpoint', 'domination', 'axiom', 'used', 'to', 'axiomatically', 'build', 'the', 'nash', 'bargaining', 'solution', 'or', 'proportionally', 'fair', 'resource', 'allocation', 'problem', 'moreover', 'we', 'show', 'how', 'our', 'lower', 'bound', 'can', 'improve', 'the', 'performances', 'of', 'a', 'distributed', 'algorithm', 'based', 'on', 'the', 'alternating', 'directions', 'method', 'of', 'multipliers', 'admm', 'the', 'evaluation', 'of', 'the', 'algorithm', 'shows', 'that', 'our', 'lower', 'bound', 'can', 'considerably', 'reduce', 'its', 'convergence', 'time', 'up', 'to', 'two', 'orders', 'of', 'magnitude', 'compared', 'to', 'when', 'the', 'bound', 'is', 'not', 'used', 'at', 'all', 'or', 'is', 'simply', 'looser']] | [-0.1111409930473504, -0.02148960658814758, -0.12044303683926248, 0.06554338088996398, -0.1142405704051877, -0.15115249016994817, 0.09739944154991664, 0.41950528133246634, -0.2799000687263389, -0.3222137747746375, 0.13227850722873377, -0.22677163433594008, -0.13600734742358328, 0.19551102444270832, -0.0992985004494484, 0.09946110484403713, 0.04787405170241578, 0.06428654635480295, -0.05359929867554456, -0.3460937460677491, 0.2760272154590995, 0.07330296219766347, 0.3538818060045337, 0.07704200955469989, 0.06097207070367101, -0.02382179834207313, -0.007265272245018019, 0.04213791984754304, -0.1400431484440762, 0.16058492569783184, 0.2665487867417849, 0.20383638528874143, 0.35431321072909566, -0.4222024099797838, -0.18697624360469894, 0.14852868114701576, 0.1658541810983378, 0.06744265601349374, -0.03897184659920943, -0.22712052650749684, 0.1074462714475683, -0.1892990606267833, -0.06027420508778757, -0.07141583725008079, -0.028817893360327515, 0.03205381826264784, -0.2665537448781025, 0.034655396073099434, 0.060651458580590165, -0.0012287338911038306, -0.07499871207853882, -0.17166447574272753, 0.046021330196203455, 0.11957810166010556, 0.05493264081111799, 0.026385878295534185, 0.08521624010625399, -0.08924388244049623, -0.1869014017264514, 0.3728438790784114, -0.02814125888204823, -0.23138152736290876, 0.17036847837088215, -0.056022201954490605, -0.15295951094206733, 0.10188858417095617, 0.166105471075409, 0.16013874507302212, -0.13290414976436296, 0.08575704986449434, -0.08847962458126454, 0.15224002986215054, 0.07246097424067557, 0.075771265088891, 0.08716740679099327, 0.16522208062750804, 0.19683293241347807, 0.18538030947303114, 0.006279412091761413, -0.11519048479126973, -0.18798465182060478, -0.11830349916255929, -0.19990830985479988, -0.0009254479734712125, -0.07100603417477235, -0.11172319768100149, 0.3998177490921484, 0.1640395751559279, 0.1424575879988778, 0.11187105393554601, 0.3328280622443546, 0.1359557104083554, 0.06516218571535622, 0.12472165873170726, 0.24352403661210298, 0.09324860072358408, 0.10110967529730665, -0.22409782337975534, 0.1096305468869913, 0.09595343971159309] |
1,802.02933 | A D'-type symbiotic binary in the planetary nebula SMP LMC 88 | SMP LMC 88 is one of the planetary nebulae (PN) in the Large Magellanic
Cloud. We identify in its spectrum Raman scattered O VI lines at 6825 and
7083A. This unambiguously classifies the central object of the nebula as a
symbiotic star (SySt). We identified the cold component to be a K-type giant,
making this the first D'-type (yellow) SySt discovered outside the Galaxy. The
photometric variability in SMP LMC 88 resembles the the orbital variability of
Galactic D'-type SySt with its low amplitude and sinusoidal lightcurve shape.
The SySt classification is also supported by the He I diagnostic diagram.
| astro-ph.SR | smp lmc 88 is one of the planetary nebulae pn in the large magellanic cloud we identify in its spectrum raman scattered o vi lines at 6825 and 7083a this unambiguously classifies the central object of the nebula as a symbiotic star syst we identified the cold component to be a ktype giant making this the first dtype yellow syst discovered outside the galaxy the photometric variability in smp lmc 88 resembles the the orbital variability of galactic dtype syst with its low amplitude and sinusoidal lightcurve shape the syst classification is also supported by the he i diagnostic diagram | [['smp', 'lmc', '88', 'is', 'one', 'of', 'the', 'planetary', 'nebulae', 'pn', 'in', 'the', 'large', 'magellanic', 'cloud', 'we', 'identify', 'in', 'its', 'spectrum', 'raman', 'scattered', 'o', 'vi', 'lines', 'at', '6825', 'and', '7083a', 'this', 'unambiguously', 'classifies', 'the', 'central', 'object', 'of', 'the', 'nebula', 'as', 'a', 'symbiotic', 'star', 'syst', 'we', 'identified', 'the', 'cold', 'component', 'to', 'be', 'a', 'ktype', 'giant', 'making', 'this', 'the', 'first', 'dtype', 'yellow', 'syst', 'discovered', 'outside', 'the', 'galaxy', 'the', 'photometric', 'variability', 'in', 'smp', 'lmc', '88', 'resembles', 'the', 'the', 'orbital', 'variability', 'of', 'galactic', 'dtype', 'syst', 'with', 'its', 'low', 'amplitude', 'and', 'sinusoidal', 'lightcurve', 'shape', 'the', 'syst', 'classification', 'is', 'also', 'supported', 'by', 'the', 'he', 'i', 'diagnostic', 'diagram']] | [-0.11837956010166442, 0.04238769352069181, -0.07803030523255167, 0.07334084459933254, -0.08862830631933505, -0.07293579843121045, 0.10224512752822855, 0.3844694167074531, -0.19992958906331837, -0.3367355104601669, 0.009920808722998834, -0.3116431682267123, -0.044748810439775084, 0.15079595431252713, -0.125996599406606, -0.05630825625643172, 0.08620076998127531, -0.08521340244609599, 0.023711647330359978, -0.23965065879747272, 0.19968145596559603, -0.00337909816792517, 0.12869203056801448, -0.070215091240978, -0.0068552005057684095, -0.06346839193649816, -0.05072948609648103, -0.10961154837048415, -0.10176946401991176, 0.11152333602535003, 0.24331492379383005, 0.1087050579883384, 0.11340718102086374, -0.23944031797035484, -0.13423810534254468, 0.05083141569518531, 0.22657541431147943, -0.008893244516461937, 0.028843761694551717, -0.2935755047194584, 0.08656888333798358, -0.2060050249024473, -0.22000154908840555, 0.12030982117949411, 0.14479632990792243, 0.030103294282323785, -0.19415304641800255, 0.14982068163049972, 0.0017994658250098277, 0.14472401230313786, -0.11088784854398157, -0.12982409386754487, -0.10180255774446208, 0.023136829044858014, 0.009651447561654177, 0.10957193733757419, 0.1180301828291079, -0.11865867725620517, -0.03060832710447486, 0.42459733088058654, -0.09787498217786314, 0.05100421645123549, 0.1780875145993901, -0.21502392295503406, -0.23223858037869435, 0.19947880627869657, 0.07965955037548385, 0.15364821909955054, -0.19488867385444616, 0.027916893656095114, -0.027614114918943607, 0.23208614819121048, 0.05515584764494137, 0.048955017343461, 0.32411289026941914, 0.12059258137396867, -0.04597464980877409, 0.13592763809720054, -0.32821681194308433, -0.06654207746282507, -0.2665022787205273, -0.11531558455052701, -0.11507902520172524, 0.08045624175598148, -0.13727900185922132, -0.14122183633159208, 0.35108442165220927, 0.06122391081575041, 0.23896578764966267, -0.06670590897438804, 0.275299994232641, 0.10652357504369145, 0.07603548103684767, 0.14309982097510135, 0.3500164904622267, 0.22094769892517965, 0.1614397119998525, -0.27588555438801493, 0.11278026217519484, 0.02234819597291826] |
1,802.02934 | Anomalous phonon lifetime shortening in paramagnetic CrN caused by
magneto-lattice coupling: A combined spin and ab initio molecular dynamics
study | We study the mutual coupling of spin fluctuations and lattice vibrations in
paramagnetic CrN by combining atomistic spin dynamics and ab initio molecular
dynamics. The two degrees of freedom are dynamically coupled leading to
non-adiabatic effects. Those effects suppress the phonon life times at low
temperature compared to an adiabatic approach. The here identified dynamic
coupling provides an explanation for the experimentally observed unexpected
temperature dependence of the thermal conductivity of magnetic semiconductors
above the magnetic ordering temperature.
| cond-mat.mtrl-sci | we study the mutual coupling of spin fluctuations and lattice vibrations in paramagnetic crn by combining atomistic spin dynamics and ab initio molecular dynamics the two degrees of freedom are dynamically coupled leading to nonadiabatic effects those effects suppress the phonon life times at low temperature compared to an adiabatic approach the here identified dynamic coupling provides an explanation for the experimentally observed unexpected temperature dependence of the thermal conductivity of magnetic semiconductors above the magnetic ordering temperature | [['we', 'study', 'the', 'mutual', 'coupling', 'of', 'spin', 'fluctuations', 'and', 'lattice', 'vibrations', 'in', 'paramagnetic', 'crn', 'by', 'combining', 'atomistic', 'spin', 'dynamics', 'and', 'ab', 'initio', 'molecular', 'dynamics', 'the', 'two', 'degrees', 'of', 'freedom', 'are', 'dynamically', 'coupled', 'leading', 'to', 'nonadiabatic', 'effects', 'those', 'effects', 'suppress', 'the', 'phonon', 'life', 'times', 'at', 'low', 'temperature', 'compared', 'to', 'an', 'adiabatic', 'approach', 'the', 'here', 'identified', 'dynamic', 'coupling', 'provides', 'an', 'explanation', 'for', 'the', 'experimentally', 'observed', 'unexpected', 'temperature', 'dependence', 'of', 'the', 'thermal', 'conductivity', 'of', 'magnetic', 'semiconductors', 'above', 'the', 'magnetic', 'ordering', 'temperature']] | [-0.20791717025881204, 0.27021601403957435, -0.05784597346344246, 0.02202904695430054, -0.018924624865086608, -0.0935515647706313, 0.06731779455171469, 0.3888143901235591, -0.2970856516980208, -0.2870724658266856, -0.014757996223544559, -0.30327347964525986, -0.10620980906801727, 0.13133953020979577, 0.11267869464026238, -0.008882009788440207, -0.05433163500558107, -0.035517273005098104, -0.06525306203193629, -0.14999359135384646, 0.21374022640669957, 0.10367547103370993, 0.28747985437393, 0.12325846205632655, 0.05873321803907553, -0.004322947205927892, 0.10402067254882497, 0.02508453882705325, -0.17093035996628878, 0.016020321167814426, 0.2239374817850498, -0.11239472116964559, 0.18586959757913762, -0.48404708290950227, -0.23973925151408482, -0.007042272947728634, 0.11329490560083053, 0.1817489382930291, -0.026305407070769712, -0.22707459817712122, -0.028924348811881665, -0.12396721097712333, -0.1542788019615751, -0.163725292062363, -0.004152235885461171, -0.04111304800085819, -0.2508459599682679, 0.15940123440650028, 0.032758237197039984, 0.13016746518536446, -0.11802712789115806, -0.15015318516331413, -0.07036300760526688, 0.05361107877121331, 0.044582977604407534, 0.02576831501060858, 0.23208602633064565, -0.09663067426747428, -0.14219052665150508, 0.3719517189878015, -0.07495817503569505, -0.09119492777599356, 0.20082901840886244, -0.1621935648115304, -0.08874988660980494, 0.19726075997385076, 0.12383898844321568, 0.08198001558626763, -0.1922318005385116, 0.05170934820638743, 0.09356446840012303, 0.1611902326411114, 0.022844476046231695, 0.12137260499338691, 0.2706318700160736, 0.1921309218324052, -0.015686432281747844, 0.12908410872571552, -0.11324685203054777, -0.13158689073931712, -0.18757002461606112, -0.08410657658122289, -0.22234790292210305, 0.08787127884510809, -0.1200104194677596, -0.14697881183849695, 0.4036803301065587, 0.21991898427950218, 0.13054064362763595, -0.028028851148682848, 0.28944799872354054, 0.11028304934883729, 0.03233662037214694, 0.046098689727771744, 0.28686155845673805, 0.23601376004099178, 0.07092840445395081, -0.430159530053154, 0.054425063076241016, -0.02863603973020919] |
1,802.02935 | Suppression and revival of long-range ferromagnetic order in the
multiorbital Fermi-Hubbard model | By means of dynamical mean-field theory allowing for complete account of
SU(2) rotational symmetry of interactions between spin-1/2 particles, we
observe a strong effect of suppression of ferromagnetic order in the
multiorbital Fermi-Hubbard model in comparison with a widely used restriction
to density-density interactions. In the case of orbital degeneracy, we show
that the suppression effect is the strongest in the two-orbital model (with
effective spin $S_{\rm eff}=1$) and significantly decreases when considering
three orbitals ($S_{\rm eff}=3/2$), thus magnetic ordering can effectively
revive for the same range of parameters, in agreement with arguments based on
vanishing of quantum fluctuations in the limit of classical spins ($S_{\rm
eff}\to\infty$). We analyze a connection to the double-exchange model and
observe high importance of spin-flip processes there as well.
| cond-mat.str-el cond-mat.quant-gas | by means of dynamical meanfield theory allowing for complete account of su2 rotational symmetry of interactions between spin12 particles we observe a strong effect of suppression of ferromagnetic order in the multiorbital fermihubbard model in comparison with a widely used restriction to densitydensity interactions in the case of orbital degeneracy we show that the suppression effect is the strongest in the twoorbital model with effective spin s_rm eff1 and significantly decreases when considering three orbitals s_rm eff32 thus magnetic ordering can effectively revive for the same range of parameters in agreement with arguments based on vanishing of quantum fluctuations in the limit of classical spins s_rm efftoinfty we analyze a connection to the doubleexchange model and observe high importance of spinflip processes there as well | [['by', 'means', 'of', 'dynamical', 'meanfield', 'theory', 'allowing', 'for', 'complete', 'account', 'of', 'su2', 'rotational', 'symmetry', 'of', 'interactions', 'between', 'spin12', 'particles', 'we', 'observe', 'a', 'strong', 'effect', 'of', 'suppression', 'of', 'ferromagnetic', 'order', 'in', 'the', 'multiorbital', 'fermihubbard', 'model', 'in', 'comparison', 'with', 'a', 'widely', 'used', 'restriction', 'to', 'densitydensity', 'interactions', 'in', 'the', 'case', 'of', 'orbital', 'degeneracy', 'we', 'show', 'that', 'the', 'suppression', 'effect', 'is', 'the', 'strongest', 'in', 'the', 'twoorbital', 'model', 'with', 'effective', 'spin', 's_rm', 'eff1', 'and', 'significantly', 'decreases', 'when', 'considering', 'three', 'orbitals', 's_rm', 'eff32', 'thus', 'magnetic', 'ordering', 'can', 'effectively', 'revive', 'for', 'the', 'same', 'range', 'of', 'parameters', 'in', 'agreement', 'with', 'arguments', 'based', 'on', 'vanishing', 'of', 'quantum', 'fluctuations', 'in', 'the', 'limit', 'of', 'classical', 'spins', 's_rm', 'efftoinfty', 'we', 'analyze', 'a', 'connection', 'to', 'the', 'doubleexchange', 'model', 'and', 'observe', 'high', 'importance', 'of', 'spinflip', 'processes', 'there', 'as', 'well']] | [-0.15020720361153655, 0.20191017682929108, -0.033554999507032335, 0.12688256561002748, -0.012764581342841067, -0.12531603183843407, 0.0583397619912734, 0.33979104975677604, -0.21889323394412433, -0.3229691615172972, -0.02387886882922423, -0.2940540339540296, -0.11570928494135539, 0.12241309523256874, 0.07223365380527164, -0.004884860088397574, -0.01282380998694921, -0.0005717208926997534, -0.11399540751159752, -0.17948558191935404, 0.3083109189878072, 0.036275788644760304, 0.2827914886903472, 0.09732266106998654, 0.07054605813530403, 0.08892007359366001, 0.07867977629620128, 0.03138909373826128, -0.13142700781280267, 0.04256676980937884, 0.2088197619858675, -0.04519850805371515, 0.19389470780980053, -0.42904284073993926, -0.22464463431236706, 0.08549795299011274, 0.14642869780688145, 0.15948293504221894, -0.011501999464022314, -0.26883414660095867, 0.027727126943636535, -0.21788627244872835, -0.13410317216719675, -0.09214010611327926, -0.00762253939136257, 0.003926747107530028, -0.30130002774843356, 0.1540205287304612, 0.0860535311283131, 0.1065913972452404, -0.07063524346425751, -0.09040947690060953, -0.07345615019378199, 0.06867732078606467, 0.07059745664795392, 0.045396627933998415, 0.08408041308138035, -0.12325167461162115, -0.14270354117971004, 0.4045477951081788, -0.11689919508933051, -0.16690022992803072, 0.19060882606271018, -0.17942371709287408, -0.12607768346835685, 0.09217320560814615, 0.12295810533006017, 0.07238117542223839, -0.11580219102620688, 0.09999239973144651, 0.017929123956861536, 0.17730904752161444, -0.02559840134004267, 0.07849049777481316, 0.21694184800731095, 0.17539458748945072, 0.041848815693633586, 0.15173230264563023, -0.11331350143385552, -0.17939379590381754, -0.2493510302601049, -0.11330718843728244, -0.187981130975503, 0.06380024092552078, -0.11669616667980638, -0.11692926774891775, 0.367326414114152, 0.18972373872425605, 0.20582076715593173, 0.0023203895548434277, 0.23648048475445285, 0.12470080043904756, 0.05301131796076652, 0.024757475467262473, 0.277056082627666, 0.19000860333548691, 0.03221880410214871, -0.3085689851673456, 0.04243454993588895, 0.0572085814272258] |
1,802.02936 | Software-Defined Microgrid Control for Resilience Against Cyber Attacks | Microgrids (MGs) rely on networked control supported by off-the-shelf
wireless communications. This makes them vulnerable to cyber-attacks, such as
denial-of-service (DoS). In this paper, we mitigate those attacks by applying
the concepts of (i) separation of data plane from network control plane,
inspired by the software defined networking (SDN) paradigm, and (ii) agile
reconfiguration of the data plane connections. In our architecture, all
generators operate as either voltage regulators (active agents), or current
sources (passive agents), with their operating mode being locally determined,
according the global information on the MG state. The software-defined MG
control utilizes the fact that, besides the data exchange on the wireless
channel, the power-grid bus can be used to create side communication channels
that carry control plane information about the state of the MG. For this
purpose, we adopt power talk, a modem-less, low-rate, power-line communication
designed for direct current (DC) MGs. The results show that the proposed
software-defined MG offers superior performance compared to the static MG, as
well as resilience against cyber attacks.
| cs.SY | microgrids mgs rely on networked control supported by offtheshelf wireless communications this makes them vulnerable to cyberattacks such as denialofservice dos in this paper we mitigate those attacks by applying the concepts of i separation of data plane from network control plane inspired by the software defined networking sdn paradigm and ii agile reconfiguration of the data plane connections in our architecture all generators operate as either voltage regulators active agents or current sources passive agents with their operating mode being locally determined according the global information on the mg state the softwaredefined mg control utilizes the fact that besides the data exchange on the wireless channel the powergrid bus can be used to create side communication channels that carry control plane information about the state of the mg for this purpose we adopt power talk a modemless lowrate powerline communication designed for direct current dc mgs the results show that the proposed softwaredefined mg offers superior performance compared to the static mg as well as resilience against cyber attacks | [['microgrids', 'mgs', 'rely', 'on', 'networked', 'control', 'supported', 'by', 'offtheshelf', 'wireless', 'communications', 'this', 'makes', 'them', 'vulnerable', 'to', 'cyberattacks', 'such', 'as', 'denialofservice', 'dos', 'in', 'this', 'paper', 'we', 'mitigate', 'those', 'attacks', 'by', 'applying', 'the', 'concepts', 'of', 'i', 'separation', 'of', 'data', 'plane', 'from', 'network', 'control', 'plane', 'inspired', 'by', 'the', 'software', 'defined', 'networking', 'sdn', 'paradigm', 'and', 'ii', 'agile', 'reconfiguration', 'of', 'the', 'data', 'plane', 'connections', 'in', 'our', 'architecture', 'all', 'generators', 'operate', 'as', 'either', 'voltage', 'regulators', 'active', 'agents', 'or', 'current', 'sources', 'passive', 'agents', 'with', 'their', 'operating', 'mode', 'being', 'locally', 'determined', 'according', 'the', 'global', 'information', 'on', 'the', 'mg', 'state', 'the', 'softwaredefined', 'mg', 'control', 'utilizes', 'the', 'fact', 'that', 'besides', 'the', 'data', 'exchange', 'on', 'the', 'wireless', 'channel', 'the', 'powergrid', 'bus', 'can', 'be', 'used', 'to', 'create', 'side', 'communication', 'channels', 'that', 'carry', 'control', 'plane', 'information', 'about', 'the', 'state', 'of', 'the', 'mg', 'for', 'this', 'purpose', 'we', 'adopt', 'power', 'talk', 'a', 'modemless', 'lowrate', 'powerline', 'communication', 'designed', 'for', 'direct', 'current', 'dc', 'mgs', 'the', 'results', 'show', 'that', 'the', 'proposed', 'softwaredefined', 'mg', 'offers', 'superior', 'performance', 'compared', 'to', 'the', 'static', 'mg', 'as', 'well', 'as', 'resilience', 'against', 'cyber', 'attacks']] | [-0.22172113378620403, 0.010315912151598983, 0.004214851819419649, 0.013002443210684732, -0.09994586329554489, -0.2216121545474778, 0.08260503134720534, 0.386594091520022, -0.2611498259864341, -0.3074434801330652, 0.11624877351079929, -0.27184641654134767, -0.16178463665167828, 0.20427807862319317, -0.12430725854231849, 0.05208927071129782, 0.006821406467889364, -0.02293822730852831, 0.021891948528320545, -0.22892310236685376, 0.3176349903451356, 0.0856397292251594, 0.3840345118756919, 0.0018242698537096927, 0.02998479147587721, 0.029836955427925086, -0.021949136762303912, 0.017763007624367923, -0.07466196578980897, 0.11949514795147081, 0.35245411736152227, 0.1905766630919992, 0.2724310260392814, -0.4570179054149862, -0.23704470065835664, 0.06997923562633833, 0.11893265511697301, 0.059848704433534294, -0.04963642961168924, -0.3352217221489319, 0.10515723150697422, -0.24607769378664843, -0.0908922073042114, -0.036880723999802176, -0.06934934781765091, 0.08615354348260623, -0.2319568094119606, -0.043704228089934974, 0.028617251546607082, 0.06944577636737266, -0.033449005955532636, -0.07472885843881642, -0.05633276560172968, 0.15622845434769023, -0.024741116937349095, -0.0019747966324590895, 0.24128236371428657, -0.06852186193755834, -0.16850270083747232, 0.3490842242006036, -0.008703434116726454, -0.15932967119416933, 0.1632606782306388, 0.015968775521335604, -0.08912535160559522, 0.09221610937063643, 0.23049144481321826, 0.05636869140276575, -0.18543754548272504, 0.040594416159031546, 0.05188969446114711, 0.18153146789175012, 0.021687555275637017, 0.07103042665747761, 0.1722398528611541, 0.1805587258994491, 0.173596305839136, 0.09098616554939117, -0.07813891317173921, -0.11339776926073274, -0.22237859737298854, -0.11051745403877641, -0.1891105885301598, 0.0519848592805307, -0.05194916436216207, -0.10601063324489834, 0.37670212558101446, 0.18896331744180364, 0.1341539835777773, 0.041855341060494884, 0.41242653971328536, 0.01880808333114076, 0.10547234993648423, 0.15544971388891426, 0.24371781480256138, 0.0701002378289494, 0.1976577610858253, -0.2046305038828469, 0.11434845574552843, -0.048236536194112965] |
1,802.02937 | Effects of high vs moderate-intensity training on neuroplasticity and
functional recovery after focal ischemia | Background and Purpose: This study was designed to compare the effects of
high-intensity interval training (HIT) and moderate-intensity continuous
training (MOD) on functional recovery and cerebral plasticity during the first
2 weeks following cerebral ischemia. Methods: Rats were randomized as follows:
Control (n=15), SHAM (n=9), MCAO (n=13), MCAO-D1 (n=7), MOD (n=13) and HIT
(n=13). Incremental tests were performed at day 1 (D1) and 14 (D14) to identify
the running speed associated with the lactate threshold (SLT) and the maximal
speed (Smax). Functional tests were performed at D1, D7 and D14. Microglia
form, cytokines, p75NTR, KCC2 and NKCC1 expression were made at D15.
Results-HIT was more effective to improve the endurance performance than MOD
and induced a fast recovery of the impaired forelimb grip force. The Iba-1
positive cells with amoeboid form and the pro- and anti-inflammatory cytokine
expression were lower in HIT group, mainly in the ipsilesional hemisphere. A
p75NTR overexpression is observed on the ipsilesional side together with a
restored NKCC1/KCC2 ratio on the contralesional side. Conclusions-Low-volume
HIT based on lactate threshold appears to be more effective after cerebral
ischemia than work-matched MOD to improve aerobic fitness, grip strength and
might promote cerebral plasticity.
| q-bio.NC q-bio.SC | background and purpose this study was designed to compare the effects of highintensity interval training hit and moderateintensity continuous training mod on functional recovery and cerebral plasticity during the first 2 weeks following cerebral ischemia methods rats were randomized as follows control n15 sham n9 mcao n13 mcaod1 n7 mod n13 and hit n13 incremental tests were performed at day 1 d1 and 14 d14 to identify the running speed associated with the lactate threshold slt and the maximal speed smax functional tests were performed at d1 d7 and d14 microglia form cytokines p75ntr kcc2 and nkcc1 expression were made at d15 resultshit was more effective to improve the endurance performance than mod and induced a fast recovery of the impaired forelimb grip force the iba1 positive cells with amoeboid form and the pro and antiinflammatory cytokine expression were lower in hit group mainly in the ipsilesional hemisphere a p75ntr overexpression is observed on the ipsilesional side together with a restored nkcc1kcc2 ratio on the contralesional side conclusionslowvolume hit based on lactate threshold appears to be more effective after cerebral ischemia than workmatched mod to improve aerobic fitness grip strength and might promote cerebral plasticity | [['background', 'and', 'purpose', 'this', 'study', 'was', 'designed', 'to', 'compare', 'the', 'effects', 'of', 'highintensity', 'interval', 'training', 'hit', 'and', 'moderateintensity', 'continuous', 'training', 'mod', 'on', 'functional', 'recovery', 'and', 'cerebral', 'plasticity', 'during', 'the', 'first', '2', 'weeks', 'following', 'cerebral', 'ischemia', 'methods', 'rats', 'were', 'randomized', 'as', 'follows', 'control', 'n15', 'sham', 'n9', 'mcao', 'n13', 'mcaod1', 'n7', 'mod', 'n13', 'and', 'hit', 'n13', 'incremental', 'tests', 'were', 'performed', 'at', 'day', '1', 'd1', 'and', '14', 'd14', 'to', 'identify', 'the', 'running', 'speed', 'associated', 'with', 'the', 'lactate', 'threshold', 'slt', 'and', 'the', 'maximal', 'speed', 'smax', 'functional', 'tests', 'were', 'performed', 'at', 'd1', 'd7', 'and', 'd14', 'microglia', 'form', 'cytokines', 'p75ntr', 'kcc2', 'and', 'nkcc1', 'expression', 'were', 'made', 'at', 'd15', 'resultshit', 'was', 'more', 'effective', 'to', 'improve', 'the', 'endurance', 'performance', 'than', 'mod', 'and', 'induced', 'a', 'fast', 'recovery', 'of', 'the', 'impaired', 'forelimb', 'grip', 'force', 'the', 'iba1', 'positive', 'cells', 'with', 'amoeboid', 'form', 'and', 'the', 'pro', 'and', 'antiinflammatory', 'cytokine', 'expression', 'were', 'lower', 'in', 'hit', 'group', 'mainly', 'in', 'the', 'ipsilesional', 'hemisphere', 'a', 'p75ntr', 'overexpression', 'is', 'observed', 'on', 'the', 'ipsilesional', 'side', 'together', 'with', 'a', 'restored', 'nkcc1kcc2', 'ratio', 'on', 'the', 'contralesional', 'side', 'conclusionslowvolume', 'hit', 'based', 'on', 'lactate', 'threshold', 'appears', 'to', 'be', 'more', 'effective', 'after', 'cerebral', 'ischemia', 'than', 'workmatched', 'mod', 'to', 'improve', 'aerobic', 'fitness', 'grip', 'strength', 'and', 'might', 'promote', 'cerebral', 'plasticity']] | [-0.08708666104602097, 0.129867279907246, -0.02506412358347388, 0.0433738173438411, -0.019923092550417996, -0.21784870523331656, 0.06453258857305949, 0.38721891911443096, -0.16642129493784674, -0.3101788150475911, 0.12011744381148542, -0.3022212257727116, -0.15509947035985855, 0.15100357706468162, -0.1293915187945147, 0.031788912686668544, 0.03869966906302439, 0.07832524232541915, -0.0036296797221660286, -0.2828922997343287, 0.16082736352254065, 0.10367782763591375, 0.2926924912354173, 0.027495703855477973, 0.07966309899299596, -0.027325612513441077, -0.021939066238058164, -0.030421914018237788, -0.13307322151135673, 0.07530213172807364, 0.23083227303249565, 0.0971044588998701, 0.2716068601231245, -0.4751184241156716, -0.15812547471440522, 0.08912999299805076, 0.12178957276560819, 0.047086919585850026, 0.018647706501111284, -0.2636305035345349, 0.12972695997386183, -0.12119089039454227, -0.07305068030788754, -0.041795064397789766, 0.06025252998574992, 0.002631769303325049, -0.29487183526510796, 0.10885889978290829, 0.010454035755143969, 0.1363197456304375, -0.08107456427648951, -0.1585357328130766, -0.02093612117363521, 0.1509704917761914, 0.04988199315105889, 0.0945564832915269, 0.22052411645527373, -0.11362117660445424, -0.0817560127268041, 0.2836348829657169, -0.03503477164092011, -0.1161313721632266, 0.18622405375662718, -0.13273149015747257, -0.12032047322390406, 0.17788518368503212, 0.16081481556233163, 0.06990704317165548, -0.10183017612666467, -0.026653841260170372, 0.07566649727561918, 0.21178393984324098, 0.190275853041827, -0.08821996201205361, 0.0716625269083049, 0.18902993951383876, 0.027756441552101926, 0.0979185280520649, -0.1342669609186075, 0.0006363860380357307, -0.22061305384033292, -0.13141063571449638, -0.08757070357620572, 0.059991992188544264, -0.08323454255018209, -0.07028257018932815, 0.36488405731249374, 0.07884733968296022, 0.15038507138713372, 0.09696527728322091, 0.2249617386887169, 0.024931022140019937, 0.09199168444842676, 0.05941807220751698, 0.20091927286175734, 0.08068571152880746, 0.09678215100507133, -0.26264039757635793, 0.10122690119302075, 0.08306027794107589] |
1,802.02938 | Usage and Attribution of Stack Overflow Code Snippets in GitHub Projects | Stack Overflow (SO) is the most popular question-and-answer website for
software developers, providing a large amount of copyable code snippets. Using
those snippets raises maintenance and legal issues. SO's license (CC BY-SA 3.0)
requires attribution, i.e., referencing the original question or answer, and
requires derived work to adopt a compatible license. While there is a heated
debate on SO's license model for code snippets and the required attribution,
little is known about the extent to which snippets are copied from SO without
proper attribution. We present results of a large-scale empirical study
analyzing the usage and attribution of non-trivial Java code snippets from SO
answers in public GitHub (GH) projects. We followed three different approaches
to triangulate an estimate for the ratio of unattributed usages and conducted
two online surveys with software developers to complement our results. For the
different sets of projects that we analyzed, the ratio of projects containing
files with a reference to SO varied between 3.3% and 11.9%. We found that at
most 1.8% of all analyzed repositories containing code from SO used the code in
a way compatible with CC BY-SA 3.0. Moreover, we estimate that at most a
quarter of the copied code snippets from SO are attributed as required. Of the
surveyed developers, almost one half admitted copying code from SO without
attribution and about two thirds were not aware of the license of SO code
snippets and its implications.
| cs.SE | stack overflow so is the most popular questionandanswer website for software developers providing a large amount of copyable code snippets using those snippets raises maintenance and legal issues sos license cc bysa 30 requires attribution ie referencing the original question or answer and requires derived work to adopt a compatible license while there is a heated debate on sos license model for code snippets and the required attribution little is known about the extent to which snippets are copied from so without proper attribution we present results of a largescale empirical study analyzing the usage and attribution of nontrivial java code snippets from so answers in public github gh projects we followed three different approaches to triangulate an estimate for the ratio of unattributed usages and conducted two online surveys with software developers to complement our results for the different sets of projects that we analyzed the ratio of projects containing files with a reference to so varied between 33 and 119 we found that at most 18 of all analyzed repositories containing code from so used the code in a way compatible with cc bysa 30 moreover we estimate that at most a quarter of the copied code snippets from so are attributed as required of the surveyed developers almost one half admitted copying code from so without attribution and about two thirds were not aware of the license of so code snippets and its implications | [['stack', 'overflow', 'so', 'is', 'the', 'most', 'popular', 'questionandanswer', 'website', 'for', 'software', 'developers', 'providing', 'a', 'large', 'amount', 'of', 'copyable', 'code', 'snippets', 'using', 'those', 'snippets', 'raises', 'maintenance', 'and', 'legal', 'issues', 'sos', 'license', 'cc', 'bysa', '30', 'requires', 'attribution', 'ie', 'referencing', 'the', 'original', 'question', 'or', 'answer', 'and', 'requires', 'derived', 'work', 'to', 'adopt', 'a', 'compatible', 'license', 'while', 'there', 'is', 'a', 'heated', 'debate', 'on', 'sos', 'license', 'model', 'for', 'code', 'snippets', 'and', 'the', 'required', 'attribution', 'little', 'is', 'known', 'about', 'the', 'extent', 'to', 'which', 'snippets', 'are', 'copied', 'from', 'so', 'without', 'proper', 'attribution', 'we', 'present', 'results', 'of', 'a', 'largescale', 'empirical', 'study', 'analyzing', 'the', 'usage', 'and', 'attribution', 'of', 'nontrivial', 'java', 'code', 'snippets', 'from', 'so', 'answers', 'in', 'public', 'github', 'gh', 'projects', 'we', 'followed', 'three', 'different', 'approaches', 'to', 'triangulate', 'an', 'estimate', 'for', 'the', 'ratio', 'of', 'unattributed', 'usages', 'and', 'conducted', 'two', 'online', 'surveys', 'with', 'software', 'developers', 'to', 'complement', 'our', 'results', 'for', 'the', 'different', 'sets', 'of', 'projects', 'that', 'we', 'analyzed', 'the', 'ratio', 'of', 'projects', 'containing', 'files', 'with', 'a', 'reference', 'to', 'so', 'varied', 'between', '33', 'and', '119', 'we', 'found', 'that', 'at', 'most', '18', 'of', 'all', 'analyzed', 'repositories', 'containing', 'code', 'from', 'so', 'used', 'the', 'code', 'in', 'a', 'way', 'compatible', 'with', 'cc', 'bysa', '30', 'moreover', 'we', 'estimate', 'that', 'at', 'most', 'a', 'quarter', 'of', 'the', 'copied', 'code', 'snippets', 'from', 'so', 'are', 'attributed', 'as', 'required', 'of', 'the', 'surveyed', 'developers', 'almost', 'one', 'half', 'admitted', 'copying', 'code', 'from', 'so', 'without', 'attribution', 'and', 'about', 'two', 'thirds', 'were', 'not', 'aware', 'of', 'the', 'license', 'of', 'so', 'code', 'snippets', 'and', 'its', 'implications']] | [-0.0923985760621648, -0.0012924086792126322, -0.030911260795335477, 0.10701832439473394, -0.11540448655008892, -0.18693378635678237, 0.10583406432830426, 0.40891597399543106, -0.2507517935373164, -0.3668070545278584, 0.13649144482244796, -0.32453590276320016, -0.05256783194154234, 0.22060855840753277, -0.06725812489746476, 0.03662333609894869, 0.12831630967734264, 0.02171728605373059, -0.041274665938375935, -0.30816623867383297, 0.31525489188561745, 0.10952687339920095, 0.2513508425705245, 0.09031069913352466, 0.02879012996558776, -0.04517826388338542, -0.12987801875380744, -0.024583933191208898, -0.10837420350564364, 0.12229765313780643, 0.31356245109257347, 0.2655519992584669, 0.28460593010742957, -0.37426703202612854, -0.12047377525325786, -0.0025199663526681154, 0.13342200233777868, 0.11862063072553054, -0.0332242598759481, -0.28195844766711387, 0.14063643869641335, -0.21855486620940615, -0.05765522102813555, -0.0028366645039668314, 0.029379578851524913, -0.016792213324435794, -0.19454185123445333, -0.03319324736624862, 0.013608910518655168, 0.14256278194785746, -0.04467060052119746, -0.16988577717278577, -0.05421448158560014, 0.2003065969545457, 0.07921492132689555, 0.0472145365946042, 0.11670583281675864, -0.11878003030406303, -0.09157329174308775, 0.4314062343006521, -0.027854767867721585, -0.15951251882454576, 0.1854628701605893, -0.030198344406730766, -0.1374687603041176, 0.10984936647337197, 0.15380243360856252, 0.09653979170547292, -0.20064919389576066, 0.015226375935442023, -0.03885748252304043, 0.2803429235362365, 0.11764434521294785, -0.009505027176159973, 0.21992057354389866, 0.11742389842967074, -0.016821119629774037, 0.15442969450208394, -0.04051558423162544, -0.045934558588665624, -0.24635503500432782, -0.13816436840013016, -0.12727292241157281, 0.05125755514613822, -0.017848491849955406, -0.1765280280356543, 0.37681554295201214, 0.21661552387281843, 0.08867838786313711, 0.03389766590545968, 0.28186768368829657, -0.058512154884070536, 0.15087021879025614, 0.1990435161777155, 0.13616602031616218, -0.02052486567062479, 0.12563446196648861, -0.11316926265012607, 0.10932845628883234, -0.011569109853388514] |
1,802.02939 | The sum of log-normal variates in geometric Brownian motion | Geometric Brownian motion (GBM) is a key model for representing
self-reproducing entities. Self-reproduction may be considered the definition
of life [5], and the dynamics it induces are of interest to those concerned
with living systems from biology to economics. Trajectories of GBM are
distributed according to the well-known log-normal density, broadening with
time. However, in many applications, what's of interest is not a single
trajectory but the sum, or average, of several trajectories. The distribution
of these objects is more complicated. Here we show two different ways of
finding their typical trajectories. We make use of an intriguing connection to
spin glasses: the expected free energy of the random energy model is an average
of log-normal variates. We make the mapping to GBM explicit and find that the
free energy result gives qualitatively correct behavior for GBM trajectories.
We then also compute the typical sum of lognormal variates using Ito calculus.
This alternative route is in close quantitative agreement with numerical work.
| cond-mat.stat-mech q-fin.MF | geometric brownian motion gbm is a key model for representing selfreproducing entities selfreproduction may be considered the definition of life 5 and the dynamics it induces are of interest to those concerned with living systems from biology to economics trajectories of gbm are distributed according to the wellknown lognormal density broadening with time however in many applications whats of interest is not a single trajectory but the sum or average of several trajectories the distribution of these objects is more complicated here we show two different ways of finding their typical trajectories we make use of an intriguing connection to spin glasses the expected free energy of the random energy model is an average of lognormal variates we make the mapping to gbm explicit and find that the free energy result gives qualitatively correct behavior for gbm trajectories we then also compute the typical sum of lognormal variates using ito calculus this alternative route is in close quantitative agreement with numerical work | [['geometric', 'brownian', 'motion', 'gbm', 'is', 'a', 'key', 'model', 'for', 'representing', 'selfreproducing', 'entities', 'selfreproduction', 'may', 'be', 'considered', 'the', 'definition', 'of', 'life', '5', 'and', 'the', 'dynamics', 'it', 'induces', 'are', 'of', 'interest', 'to', 'those', 'concerned', 'with', 'living', 'systems', 'from', 'biology', 'to', 'economics', 'trajectories', 'of', 'gbm', 'are', 'distributed', 'according', 'to', 'the', 'wellknown', 'lognormal', 'density', 'broadening', 'with', 'time', 'however', 'in', 'many', 'applications', 'whats', 'of', 'interest', 'is', 'not', 'a', 'single', 'trajectory', 'but', 'the', 'sum', 'or', 'average', 'of', 'several', 'trajectories', 'the', 'distribution', 'of', 'these', 'objects', 'is', 'more', 'complicated', 'here', 'we', 'show', 'two', 'different', 'ways', 'of', 'finding', 'their', 'typical', 'trajectories', 'we', 'make', 'use', 'of', 'an', 'intriguing', 'connection', 'to', 'spin', 'glasses', 'the', 'expected', 'free', 'energy', 'of', 'the', 'random', 'energy', 'model', 'is', 'an', 'average', 'of', 'lognormal', 'variates', 'we', 'make', 'the', 'mapping', 'to', 'gbm', 'explicit', 'and', 'find', 'that', 'the', 'free', 'energy', 'result', 'gives', 'qualitatively', 'correct', 'behavior', 'for', 'gbm', 'trajectories', 'we', 'then', 'also', 'compute', 'the', 'typical', 'sum', 'of', 'lognormal', 'variates', 'using', 'ito', 'calculus', 'this', 'alternative', 'route', 'is', 'in', 'close', 'quantitative', 'agreement', 'with', 'numerical', 'work']] | [-0.08717582844496694, 0.1442324737516982, -0.13166973710830474, 0.10307520414978542, -0.07267856490827039, -0.11350346791067874, 0.03951893321433921, 0.41048682591429464, -0.284430077187372, -0.32499126052874844, 0.03150757373293379, -0.28864306178415355, -0.1715633512839652, 0.23078081769621528, -0.10969968611822913, 0.05725444603659627, 0.04908075010013065, 0.05190850606326152, -0.028983235487105026, -0.21351942672957608, 0.2725080264937765, 0.05375112028631531, 0.2741295007649625, -0.018877070686739675, 0.09489681677214433, 0.0035955929326721365, -0.038684326902399827, 0.011956392124431411, -0.13434549008754268, 0.14354071080006292, 0.23598616132598924, 0.10776485818334752, 0.26493963360625467, -0.40366643444163564, -0.22630792261204785, 0.12833412361250798, 0.13594581179693055, 0.07491167599513529, -0.014192806498343728, -0.24500462561730801, 0.036059150104353455, -0.17924352761869675, -0.17041518363273805, -0.07480668860062221, 0.03560849660964407, 0.0809272352561504, -0.23531555699150045, 0.0976345264049244, 0.04588077640459861, 0.04279408029591044, -0.07971646349961915, -0.08833778948799052, 0.0168290965842589, 0.14460377709474415, 0.09119477197470396, 0.005495238402444456, 0.14974075322252134, -0.1273305125284457, -0.1367961073547234, 0.3987943834659678, -0.011515182399846337, -0.20088905630127332, 0.20432213233082475, -0.13568712179951462, -0.12993027749011454, 0.15034152011467536, 0.11760578859298501, 0.0983755246874083, -0.18301348895104716, 0.044142151296707906, -0.01968171464546618, 0.15333956482613254, 0.030094437335652334, 0.025428910644458718, 0.19660846375785537, 0.15885447063138364, 0.07092740431817444, 0.11059715692241343, -0.08593067855079785, -0.17272110302633617, -0.2864769062589291, -0.15336643423982838, -0.1762720485114389, 0.09355222017162575, -0.0901639419519788, -0.18110875203561635, 0.36931479319263205, 0.17669946795550784, 0.20797518737050763, 0.09255412187898693, 0.267393087680785, 0.1379531005384504, -0.009384782192941157, 0.048076629586931735, 0.1847149603827684, 0.0873544724272955, 0.07614077571607022, -0.13869075181342108, 0.08384388909433726, 0.009125744706928085] |
1,802.0294 | Orbital Origin of Extremely Anisotropic Superconducting Gap in Nematic
Phase of FeSe Superconductor | The iron-based superconductors are characterized by multiple-orbital physics
where all the five Fe 3$d$ orbitals get involved. The multiple-orbital nature
gives rise to various novel phenomena like orbital-selective Mott transition,
nematicity and orbital fluctuation that provide a new route for realizing
superconductivity. The complexity of multiple-orbital also asks to disentangle
the relationship between orbital, spin and nematicity, and to identify dominant
orbital ingredients that dictate superconductivity. The bulk FeSe
superconductor provides an ideal platform to address these issues because of
its simple crystal structure and unique coexistence of superconductivity and
nematicity. However, the orbital nature of the low energy electronic
excitations and its relation to the superconducting gap remain controversial.
Here we report direct observation of highly anisotropic Fermi surface and
extremely anisotropic superconducting gap in the nematic state of FeSe
superconductor by high resolution laser-based angle-resolved photoemission
measurements. We find that the low energy excitations of the entire hole pocket
at the Brillouin zone center are dominated by the single $d_{xz}$ orbital. The
superconducting gap exhibits an anti-correlation relation with the $d_{xz}$
spectral weight near the Fermi level, i.e., the gap size minimum (maximum)
corresponds to the maximum (minimum) of the $d_{xz}$ spectral weight along the
Fermi surface. These observations provide new insights in understanding the
orbital origin of the extremely anisotropic superconducting gap in FeSe
superconductor and the relation between nematicity and superconductivity in the
iron-based superconductors.
| cond-mat.supr-con | the ironbased superconductors are characterized by multipleorbital physics where all the five fe 3d orbitals get involved the multipleorbital nature gives rise to various novel phenomena like orbitalselective mott transition nematicity and orbital fluctuation that provide a new route for realizing superconductivity the complexity of multipleorbital also asks to disentangle the relationship between orbital spin and nematicity and to identify dominant orbital ingredients that dictate superconductivity the bulk fese superconductor provides an ideal platform to address these issues because of its simple crystal structure and unique coexistence of superconductivity and nematicity however the orbital nature of the low energy electronic excitations and its relation to the superconducting gap remain controversial here we report direct observation of highly anisotropic fermi surface and extremely anisotropic superconducting gap in the nematic state of fese superconductor by high resolution laserbased angleresolved photoemission measurements we find that the low energy excitations of the entire hole pocket at the brillouin zone center are dominated by the single d_xz orbital the superconducting gap exhibits an anticorrelation relation with the d_xz spectral weight near the fermi level ie the gap size minimum maximum corresponds to the maximum minimum of the d_xz spectral weight along the fermi surface these observations provide new insights in understanding the orbital origin of the extremely anisotropic superconducting gap in fese superconductor and the relation between nematicity and superconductivity in the ironbased superconductors | [['the', 'ironbased', 'superconductors', 'are', 'characterized', 'by', 'multipleorbital', 'physics', 'where', 'all', 'the', 'five', 'fe', '3d', 'orbitals', 'get', 'involved', 'the', 'multipleorbital', 'nature', 'gives', 'rise', 'to', 'various', 'novel', 'phenomena', 'like', 'orbitalselective', 'mott', 'transition', 'nematicity', 'and', 'orbital', 'fluctuation', 'that', 'provide', 'a', 'new', 'route', 'for', 'realizing', 'superconductivity', 'the', 'complexity', 'of', 'multipleorbital', 'also', 'asks', 'to', 'disentangle', 'the', 'relationship', 'between', 'orbital', 'spin', 'and', 'nematicity', 'and', 'to', 'identify', 'dominant', 'orbital', 'ingredients', 'that', 'dictate', 'superconductivity', 'the', 'bulk', 'fese', 'superconductor', 'provides', 'an', 'ideal', 'platform', 'to', 'address', 'these', 'issues', 'because', 'of', 'its', 'simple', 'crystal', 'structure', 'and', 'unique', 'coexistence', 'of', 'superconductivity', 'and', 'nematicity', 'however', 'the', 'orbital', 'nature', 'of', 'the', 'low', 'energy', 'electronic', 'excitations', 'and', 'its', 'relation', 'to', 'the', 'superconducting', 'gap', 'remain', 'controversial', 'here', 'we', 'report', 'direct', 'observation', 'of', 'highly', 'anisotropic', 'fermi', 'surface', 'and', 'extremely', 'anisotropic', 'superconducting', 'gap', 'in', 'the', 'nematic', 'state', 'of', 'fese', 'superconductor', 'by', 'high', 'resolution', 'laserbased', 'angleresolved', 'photoemission', 'measurements', 'we', 'find', 'that', 'the', 'low', 'energy', 'excitations', 'of', 'the', 'entire', 'hole', 'pocket', 'at', 'the', 'brillouin', 'zone', 'center', 'are', 'dominated', 'by', 'the', 'single', 'd_xz', 'orbital', 'the', 'superconducting', 'gap', 'exhibits', 'an', 'anticorrelation', 'relation', 'with', 'the', 'd_xz', 'spectral', 'weight', 'near', 'the', 'fermi', 'level', 'ie', 'the', 'gap', 'size', 'minimum', 'maximum', 'corresponds', 'to', 'the', 'maximum', 'minimum', 'of', 'the', 'd_xz', 'spectral', 'weight', 'along', 'the', 'fermi', 'surface', 'these', 'observations', 'provide', 'new', 'insights', 'in', 'understanding', 'the', 'orbital', 'origin', 'of', 'the', 'extremely', 'anisotropic', 'superconducting', 'gap', 'in', 'fese', 'superconductor', 'and', 'the', 'relation', 'between', 'nematicity', 'and', 'superconductivity', 'in', 'the', 'ironbased', 'superconductors']] | [-0.2308697533533465, 0.21622841151120592, -0.04458261850009384, 0.0902071068445668, -0.11900600821886, -0.17118305016073143, 0.14740296189396696, 0.35488162083779035, -0.2797894744104889, -0.30784337322215455, -0.03710639389972996, -0.3519052457223, -0.08754234154928296, 0.14290624865489365, 0.048398576305231575, 0.0074798768934261, -0.04526110690526306, -0.08882450098024405, -0.17996477077086762, -0.20124837541830723, 0.3592068644196779, 0.05840624482309909, 0.34539623355379073, 0.11103061963214364, 0.02672258843403456, -0.012639584456973071, 0.14356744128755217, -0.042233729686213896, -0.18559199184792266, 0.10647808556245664, 0.3286536498225038, -0.0890708409883204, 0.18850295875343434, -0.4322090950879923, -0.2053414843353752, -0.02959773500702104, 0.1327984789843919, 0.10668403481481004, -0.04643778980599806, -0.23869160169991765, 0.018896946012485757, -0.14835057372642135, -0.14090479665342312, -0.11032060914221484, -0.01749188171401742, -0.06347445799007312, -0.14970218832528331, 0.12019625215017944, 0.05922261727811142, 0.1105323661704381, -0.12885509784980045, -0.12114976876512919, -0.09348395322073316, 0.024176847657359585, 0.07325314566610974, 0.06854252064131366, 0.06908371105513589, -0.12506722325182573, -0.09587671444954668, 0.35572269133914375, 0.02415206543613209, -0.01176246099568513, 0.16461104253412726, -0.19452264314867132, -0.07435835839359001, 0.1767618370152945, 0.07000330148705008, 0.01484644369986803, -0.1143544209456604, 0.06145295812687369, -0.012798332922388373, 0.19685171707329954, 0.007905666334043647, 0.180573276490152, 0.3343249212657651, 0.21422628573178595, 0.0760695584581994, 0.08779504703709604, -0.17215202573949154, -0.018199916611787534, -0.21321786798569312, -0.1933434203566524, -0.24399891684460148, 0.02811565645665386, -0.0538301893739832, -0.20188546045347805, 0.4101353529108664, 0.15586115147178284, 0.2231654327395311, -0.12045426311491944, 0.17806920346165458, 0.07794467685083294, 0.03211360624238979, 0.07796052088335717, 0.2574349363358878, 0.16182793274330684, 0.10283627142259387, -0.3772213287187911, 0.09199119068851987, 0.03017684281091958] |
1,802.02941 | Solving Linear Programs with Complementarity Constraints using
Branch-and-Cut | A linear program with linear complementarity constraints (LPCC) requires the
minimization of a linear objective over a set of linear constraints together
with additional linear complementarity constraints. This class has emerged as a
modeling paradigm for a broad collection of problems, including bilevel
programs, Stackelberg games, inverse quadratic programs, and problems involving
equilibrium constraints. The presence of the complementarity constraints
results in a nonconvex optimization problem. We develop a branch-and-cut
algorithm to find a global optimum for this class of optimization problems,
where we branch directly on complementarities. We develop branching rules and
feasibility recovery procedures and demonstrate their computational
effectiveness in a comparison with CPLEX. The implementation builds on CPLEX
through the use of callback routines. The computational results show that our
approach is a strong alternative to constructing an integer programming
formulation using big-$M$ terms to represent bounds for variables, with testing
conducted on general LPCCs as well as on instances generated from bilevel
programs with convex quadratic lower level problems.
| math.OC | a linear program with linear complementarity constraints lpcc requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints this class has emerged as a modeling paradigm for a broad collection of problems including bilevel programs stackelberg games inverse quadratic programs and problems involving equilibrium constraints the presence of the complementarity constraints results in a nonconvex optimization problem we develop a branchandcut algorithm to find a global optimum for this class of optimization problems where we branch directly on complementarities we develop branching rules and feasibility recovery procedures and demonstrate their computational effectiveness in a comparison with cplex the implementation builds on cplex through the use of callback routines the computational results show that our approach is a strong alternative to constructing an integer programming formulation using bigm terms to represent bounds for variables with testing conducted on general lpccs as well as on instances generated from bilevel programs with convex quadratic lower level problems | [['a', 'linear', 'program', 'with', 'linear', 'complementarity', 'constraints', 'lpcc', 'requires', 'the', 'minimization', 'of', 'a', 'linear', 'objective', 'over', 'a', 'set', 'of', 'linear', 'constraints', 'together', 'with', 'additional', 'linear', 'complementarity', 'constraints', 'this', 'class', 'has', 'emerged', 'as', 'a', 'modeling', 'paradigm', 'for', 'a', 'broad', 'collection', 'of', 'problems', 'including', 'bilevel', 'programs', 'stackelberg', 'games', 'inverse', 'quadratic', 'programs', 'and', 'problems', 'involving', 'equilibrium', 'constraints', 'the', 'presence', 'of', 'the', 'complementarity', 'constraints', 'results', 'in', 'a', 'nonconvex', 'optimization', 'problem', 'we', 'develop', 'a', 'branchandcut', 'algorithm', 'to', 'find', 'a', 'global', 'optimum', 'for', 'this', 'class', 'of', 'optimization', 'problems', 'where', 'we', 'branch', 'directly', 'on', 'complementarities', 'we', 'develop', 'branching', 'rules', 'and', 'feasibility', 'recovery', 'procedures', 'and', 'demonstrate', 'their', 'computational', 'effectiveness', 'in', 'a', 'comparison', 'with', 'cplex', 'the', 'implementation', 'builds', 'on', 'cplex', 'through', 'the', 'use', 'of', 'callback', 'routines', 'the', 'computational', 'results', 'show', 'that', 'our', 'approach', 'is', 'a', 'strong', 'alternative', 'to', 'constructing', 'an', 'integer', 'programming', 'formulation', 'using', 'bigm', 'terms', 'to', 'represent', 'bounds', 'for', 'variables', 'with', 'testing', 'conducted', 'on', 'general', 'lpccs', 'as', 'well', 'as', 'on', 'instances', 'generated', 'from', 'bilevel', 'programs', 'with', 'convex', 'quadratic', 'lower', 'level', 'problems']] | [-0.09468075799946903, -0.07281549918430463, -0.0745220008100682, 0.06650671990010543, -0.15602021889450648, -0.17554174335443495, 0.08430258811876913, 0.3336366652338593, -0.3309862141703675, -0.3649335341114137, 0.16684203315382523, -0.23473881324178275, -0.16648774351464746, 0.21892741805425397, -0.053565059357357246, 0.14085614452437487, 0.09195932689594266, -0.0542482687699108, -0.12408841624539806, -0.2576102838171703, 0.2636602757696959, 0.019059722053094044, 0.21817178366544807, 0.037198708037684824, 0.15172823820260273, 0.04657014223846124, 0.021809977950689233, 0.09810154896263999, -0.08215404371178549, 0.16127830698301462, 0.3235331331997719, 0.24623745524060028, 0.36806239928751266, -0.4166844993668758, -0.16792843029489396, 0.10488059065293198, 0.05252052379634093, 0.09437721670478766, -0.06712195109489753, -0.23850956701071369, 0.05860253825803851, -0.11933243263190911, -0.02518794559413728, -0.08015281363838801, -0.046880522515067115, 0.010874611684149936, -0.37571476036567747, 0.015081221288440886, 0.02395900833365841, 0.050613314631958436, -0.07193586998044249, -0.18245238064210517, 0.04515755939280131, 0.009616493146843564, 0.042498197011293176, -0.014615146014056123, 0.1026755629774229, -0.11282104167822794, -0.23742796319686335, 0.3947495957951487, -0.06655744516670152, -0.23904093851645788, 0.19808820494016585, 0.0009956632878769327, -0.19370226917018032, 0.09183006236375665, 0.25599622619510803, 0.17862218438416294, -0.14158087727659738, 0.12874553791128018, -0.09753105976693562, 0.1677349266599013, 0.008636403351700232, 0.007121073782377888, 0.18919575714325118, 0.20591388572651295, 0.15540466667440386, 0.2082751136140921, 0.009268359233334914, -0.12062010550756513, -0.31011753494529354, -0.0994688354426834, -0.13912047675155378, -0.0348301574194022, -0.09044291136506442, -0.15919241161490963, 0.3614615001514508, 0.10163289006155582, 0.15065613969672545, 0.19565661152376346, 0.316383059228552, 0.14710107317022234, 0.05604342398101487, 0.07747910543413902, 0.20349509270436325, 0.11054197662038567, 0.08280425948409915, -0.24419837035123765, 0.06547808869350931, 0.0683972762817126] |
1,802.02942 | The nonconforming virtual element method for eigenvalue problems | We analyse the nonconforming Virtual Element Method (VEM) for the
approximation of elliptic eigenvalue problems. The nonconforming VEM allow to
treat in the same formulation the two- and three-dimensional case.We present
two possible formulations of the discrete problem, derived respectively by the
nonstabilized and stabilized approximation of the L^2-inner product, and we
study the convergence properties of the corresponding discrete eigenvalue
problem. The proposed schemes provide a correct approximation of the spectrum,
in particular we prove optimal-order error estimates for the eigenfunctions and
the usual double order of convergence of the eigenvalues. Finally we show a
large set of numerical tests supporting the theoretical results, including a
comparison with the conforming Virtual Element choice.
| math.NA | we analyse the nonconforming virtual element method vem for the approximation of elliptic eigenvalue problems the nonconforming vem allow to treat in the same formulation the two and threedimensional casewe present two possible formulations of the discrete problem derived respectively by the nonstabilized and stabilized approximation of the l2inner product and we study the convergence properties of the corresponding discrete eigenvalue problem the proposed schemes provide a correct approximation of the spectrum in particular we prove optimalorder error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues finally we show a large set of numerical tests supporting the theoretical results including a comparison with the conforming virtual element choice | [['we', 'analyse', 'the', 'nonconforming', 'virtual', 'element', 'method', 'vem', 'for', 'the', 'approximation', 'of', 'elliptic', 'eigenvalue', 'problems', 'the', 'nonconforming', 'vem', 'allow', 'to', 'treat', 'in', 'the', 'same', 'formulation', 'the', 'two', 'and', 'threedimensional', 'casewe', 'present', 'two', 'possible', 'formulations', 'of', 'the', 'discrete', 'problem', 'derived', 'respectively', 'by', 'the', 'nonstabilized', 'and', 'stabilized', 'approximation', 'of', 'the', 'l2inner', 'product', 'and', 'we', 'study', 'the', 'convergence', 'properties', 'of', 'the', 'corresponding', 'discrete', 'eigenvalue', 'problem', 'the', 'proposed', 'schemes', 'provide', 'a', 'correct', 'approximation', 'of', 'the', 'spectrum', 'in', 'particular', 'we', 'prove', 'optimalorder', 'error', 'estimates', 'for', 'the', 'eigenfunctions', 'and', 'the', 'usual', 'double', 'order', 'of', 'convergence', 'of', 'the', 'eigenvalues', 'finally', 'we', 'show', 'a', 'large', 'set', 'of', 'numerical', 'tests', 'supporting', 'the', 'theoretical', 'results', 'including', 'a', 'comparison', 'with', 'the', 'conforming', 'virtual', 'element', 'choice']] | [-0.10670183276300106, 0.005312885468970707, -0.09789343430301208, 0.07737133232876658, -0.021182117187172958, -0.07735376905960341, 0.04101317917331727, 0.34003608536563423, -0.27959299012365046, -0.2570342794877657, 0.11819386593956631, -0.25580380615173726, -0.11319752333720476, 0.17647925542928933, -0.04250519985145187, 0.12499844174823936, 0.10358447535167727, 0.005986129801992017, -0.12683902925601342, -0.20544933091967546, 0.34049457582857523, -0.03310555312782526, 0.2677889803420393, 0.06621105727339327, 0.09704501773312427, -0.01811016853561772, -0.07012873975429357, 0.017087629808341723, -0.155098460635105, 0.17327739061019792, 0.22927722854441718, 0.05732640258665605, 0.2985669574128431, -0.4072982239406229, -0.16088764594557384, 0.1087743865342386, 0.12465826585366015, 0.08658829660015997, -0.06085542587996379, -0.2597739358203845, 0.1043679834764222, -0.15139044288202727, -0.19510916671143813, -0.07129931378611282, -0.08621804004590224, 0.054163111416672016, -0.31953208723612, 0.05547563276680497, 0.04229742436865835, 0.020256204399884792, -0.09829675085769084, -0.1547630164678323, 0.04389460944456228, 0.10892456178063233, 0.032230482024156994, -0.07289557617051494, -0.004860223017698317, -0.04492873892906988, -0.11631496657470339, 0.4271817055547185, -0.0600748057885651, -0.2723379229571213, 0.1363597222125942, -0.10912462697658491, -0.10865178491446402, 0.10343775344530545, 0.18035200084462608, 0.1741133863719082, -0.056829242190967, 0.12546038298189574, -0.049768231616645495, 0.12051543264992927, 0.04407816224224996, -0.009136869071721378, 0.03321483907730956, 0.12561019855804675, 0.09548257995527565, 0.14025718848866395, -0.07750607210644439, -0.12872753089769712, -0.3670077746113141, -0.18321430794241136, -0.18016138876249133, -0.032468184162944294, -0.16138274128612115, -0.2368086323901815, 0.4041360995095027, 0.128418430134556, 0.12091881542858716, 0.0903508856386077, 0.30124408592420976, 0.15739494584934283, -0.017623366142639464, 0.08551750497140906, 0.23630574013498662, 0.18285667429996752, 0.04618713768860815, -0.27094429079443216, 0.016297391174655212, 0.20894965584177458] |
1,802.02943 | Parametric inference for hypoelliptic ergodic diffusions with full
observations | Multidimensional hypoelliptic diffusions arise naturally in different fields,
for example to model neuronal activity. Estimation in those models is complex
because of the degenerate structure of the diffusion coefficient. In this paper
we consider hypoelliptic diffusions, given as a solution of two-dimensional
stochastic differential equations (SDEs), with the discrete time observations
of both coordinates being available on an interval $T = n\Delta_n$, with
$\Delta_n$ the time step between the observations. The estimation is studied in
the asymptotic setting, with $T\to\infty$ as $\Delta_n\to 0$. We build a
consistent estimator of the drift and variance parameters with the help of a
discretized log-likelihood of the continuous process. We discuss the
difficulties generated by the hypoellipticity and provide a proof of the
consistency and the asymptotic normality of the estimator. We test our approach
numerically on the hypoelliptic FitzHugh-Nagumo model, which describes the
firing mechanism of a neuron.
| math.PR math.ST stat.TH | multidimensional hypoelliptic diffusions arise naturally in different fields for example to model neuronal activity estimation in those models is complex because of the degenerate structure of the diffusion coefficient in this paper we consider hypoelliptic diffusions given as a solution of twodimensional stochastic differential equations sdes with the discrete time observations of both coordinates being available on an interval t ndelta_n with delta_n the time step between the observations the estimation is studied in the asymptotic setting with ttoinfty as delta_nto 0 we build a consistent estimator of the drift and variance parameters with the help of a discretized loglikelihood of the continuous process we discuss the difficulties generated by the hypoellipticity and provide a proof of the consistency and the asymptotic normality of the estimator we test our approach numerically on the hypoelliptic fitzhughnagumo model which describes the firing mechanism of a neuron | [['multidimensional', 'hypoelliptic', 'diffusions', 'arise', 'naturally', 'in', 'different', 'fields', 'for', 'example', 'to', 'model', 'neuronal', 'activity', 'estimation', 'in', 'those', 'models', 'is', 'complex', 'because', 'of', 'the', 'degenerate', 'structure', 'of', 'the', 'diffusion', 'coefficient', 'in', 'this', 'paper', 'we', 'consider', 'hypoelliptic', 'diffusions', 'given', 'as', 'a', 'solution', 'of', 'twodimensional', 'stochastic', 'differential', 'equations', 'sdes', 'with', 'the', 'discrete', 'time', 'observations', 'of', 'both', 'coordinates', 'being', 'available', 'on', 'an', 'interval', 't', 'ndelta_n', 'with', 'delta_n', 'the', 'time', 'step', 'between', 'the', 'observations', 'the', 'estimation', 'is', 'studied', 'in', 'the', 'asymptotic', 'setting', 'with', 'ttoinfty', 'as', 'delta_nto', '0', 'we', 'build', 'a', 'consistent', 'estimator', 'of', 'the', 'drift', 'and', 'variance', 'parameters', 'with', 'the', 'help', 'of', 'a', 'discretized', 'loglikelihood', 'of', 'the', 'continuous', 'process', 'we', 'discuss', 'the', 'difficulties', 'generated', 'by', 'the', 'hypoellipticity', 'and', 'provide', 'a', 'proof', 'of', 'the', 'consistency', 'and', 'the', 'asymptotic', 'normality', 'of', 'the', 'estimator', 'we', 'test', 'our', 'approach', 'numerically', 'on', 'the', 'hypoelliptic', 'fitzhughnagumo', 'model', 'which', 'describes', 'the', 'firing', 'mechanism', 'of', 'a', 'neuron']] | [-0.11210084631925889, 0.06105901872564977, -0.061169418988154374, 0.07545469138581969, -0.0624726833581614, -0.12778285430006994, 0.009779108995442383, 0.3455450577716369, -0.28474985947832465, -0.23769053722369587, 0.13858464368644896, -0.2669937861501239, -0.17193436911879367, 0.17115444794116128, -0.0819204110885039, 0.08181343576870859, 0.06425999929585184, 0.03455593551613371, -0.03717079218363829, -0.22955577111052763, 0.301275265884922, 0.037990503776301116, 0.2403835791305432, -0.046576708126748495, 0.17753130059120142, -0.028432563671635255, -0.04724917573467893, -0.024755668402778812, -0.15614908847944914, 0.10009963068942954, 0.2308381796088573, 0.07419703335229617, 0.30101274377375375, -0.4032271575803558, -0.21798654100146247, 0.11484221186320712, 0.12241528407947852, 0.08658524692792627, -0.01661356708144821, -0.29959377667142284, 0.026187146934615966, -0.12805847542282814, -0.15345058482974613, -0.045771624661736295, -0.027826773332587134, 0.08650557437795214, -0.3306525013617324, 0.13588841418903838, 0.1035647841870539, 0.045358500530710444, -0.0725141520314436, -0.07877677527398595, -0.020422190387358166, 0.08876752235098845, 0.08584925252196424, -0.027316752695090447, 0.07453499895927962, -0.10895290822211084, -0.12584758017005193, 0.3173202534736548, -0.11936889621817197, -0.2662536775589817, 0.15555385368255278, -0.18330932326433766, -0.13947717160529768, 0.08886441204453553, 0.19240926386313126, 0.1465150230780839, -0.1716746247196473, 0.1267874631371847, -0.0327467891232421, 0.10458681953362732, 0.015798255472974334, -0.01740015679549995, 0.10550205421168357, 0.20283932375281843, 0.0893344608517105, 0.12178667302295151, -0.07670565611220405, -0.129860822583497, -0.36084485628331703, -0.14623073886226243, -0.1827876011682545, 0.06911496314731064, -0.14687907211969609, -0.20576482880521021, 0.39418141438444665, 0.16834782612406546, 0.22425904341637054, 0.12512048381823762, 0.2468520700705186, 0.18290121902464307, -0.008347818201905789, 0.06175143664505514, 0.1577645092555839, 0.1748533370684729, 0.11784264357346627, -0.22387289746095324, 0.10497074294309844, 0.09653981067822315] |
1,802.02944 | Neural-network Kohn-Sham exchange-correlation potential and its
out-of-training transferability | We incorporate in the Kohn-Sham self consistent equation a trained
neural-network projection from the charge density distribution to the
Hartree-exchange-correlation potential $n \rightarrow V_{\rm Hxc}$ for possible
numerical approach to the exact Kohn-Sham scheme. The potential trained through
a newly developed scheme enables us to evaluate the total energy without
explicitly treating the formula of the exchange-correlation energy. With a case
study of a simple model we show that the well-trained neural-network $V_{\rm
Hxc}$ achieves accuracy for the charge density and total energy out of the
model parameter range used for the training, indicating that the property of
the elusive ideal functional form of $V_{\rm Hxc}$ can approximately be
encapsulated by the machine-learning construction. We also exemplify a factor
that crucially limits the transferability--the boundary in the model parameter
space where the number of the one-particle bound states changes--and see that
this is cured by setting the training parameter range across that boundary. The
training scheme and insights from the model study apply to more general
systems, opening a novel path to numerically efficient Kohn-Sham potential.
| physics.comp-ph cond-mat.mtrl-sci | we incorporate in the kohnsham self consistent equation a trained neuralnetwork projection from the charge density distribution to the hartreeexchangecorrelation potential n rightarrow v_rm hxc for possible numerical approach to the exact kohnsham scheme the potential trained through a newly developed scheme enables us to evaluate the total energy without explicitly treating the formula of the exchangecorrelation energy with a case study of a simple model we show that the welltrained neuralnetwork v_rm hxc achieves accuracy for the charge density and total energy out of the model parameter range used for the training indicating that the property of the elusive ideal functional form of v_rm hxc can approximately be encapsulated by the machinelearning construction we also exemplify a factor that crucially limits the transferabilitythe boundary in the model parameter space where the number of the oneparticle bound states changesand see that this is cured by setting the training parameter range across that boundary the training scheme and insights from the model study apply to more general systems opening a novel path to numerically efficient kohnsham potential | [['we', 'incorporate', 'in', 'the', 'kohnsham', 'self', 'consistent', 'equation', 'a', 'trained', 'neuralnetwork', 'projection', 'from', 'the', 'charge', 'density', 'distribution', 'to', 'the', 'hartreeexchangecorrelation', 'potential', 'n', 'rightarrow', 'v_rm', 'hxc', 'for', 'possible', 'numerical', 'approach', 'to', 'the', 'exact', 'kohnsham', 'scheme', 'the', 'potential', 'trained', 'through', 'a', 'newly', 'developed', 'scheme', 'enables', 'us', 'to', 'evaluate', 'the', 'total', 'energy', 'without', 'explicitly', 'treating', 'the', 'formula', 'of', 'the', 'exchangecorrelation', 'energy', 'with', 'a', 'case', 'study', 'of', 'a', 'simple', 'model', 'we', 'show', 'that', 'the', 'welltrained', 'neuralnetwork', 'v_rm', 'hxc', 'achieves', 'accuracy', 'for', 'the', 'charge', 'density', 'and', 'total', 'energy', 'out', 'of', 'the', 'model', 'parameter', 'range', 'used', 'for', 'the', 'training', 'indicating', 'that', 'the', 'property', 'of', 'the', 'elusive', 'ideal', 'functional', 'form', 'of', 'v_rm', 'hxc', 'can', 'approximately', 'be', 'encapsulated', 'by', 'the', 'machinelearning', 'construction', 'we', 'also', 'exemplify', 'a', 'factor', 'that', 'crucially', 'limits', 'the', 'transferabilitythe', 'boundary', 'in', 'the', 'model', 'parameter', 'space', 'where', 'the', 'number', 'of', 'the', 'oneparticle', 'bound', 'states', 'changesand', 'see', 'that', 'this', 'is', 'cured', 'by', 'setting', 'the', 'training', 'parameter', 'range', 'across', 'that', 'boundary', 'the', 'training', 'scheme', 'and', 'insights', 'from', 'the', 'model', 'study', 'apply', 'to', 'more', 'general', 'systems', 'opening', 'a', 'novel', 'path', 'to', 'numerically', 'efficient', 'kohnsham', 'potential']] | [-0.07662699305841796, 0.05786788001677942, -0.08844815497286618, 0.06288111760901909, -0.045860730788681185, -0.14065496191842716, 0.09412978332618187, 0.34743888910602905, -0.2532488635537782, -0.3150951580931272, -0.011160258322836425, -0.23854930394318427, -0.14335972094378466, 0.18066428105839283, 0.0013737963705227293, 0.06860122974191246, 0.07234389957270702, 0.02210250602842405, -0.09874597343719221, -0.21149781067058143, 0.3045637060770358, 0.0650841578835857, 0.2919252444775882, 0.07278287183257869, 0.10668947024741905, -0.002213107232652048, 0.03354912813239057, 0.010619531030834909, -0.1433052743926672, 0.11751651422330714, 0.22257739411474303, 0.09652059412683124, 0.29197817434417617, -0.4160884564271432, -0.2283242056586167, 0.09473653295045269, 0.12760676273904825, 0.12873297471595907, -0.023768198881388626, -0.2737189302550115, 0.07539159773270888, -0.21946869999834004, -0.1474449167820229, -0.130356174210239, -0.0014652159364744164, -0.008554442598345294, -0.29779726789257993, 0.10903734034485982, 0.012476503684442362, -0.03210238707198323, -0.10065891231870515, -0.11824080092904704, -0.05104076684099333, 0.0683614522052779, 0.012765102139299458, 0.05488694121729283, 0.1225532007580302, -0.13505593023557133, -0.04126704907166536, 0.35567340980037704, -0.08300710534783957, -0.21224330071675665, 0.13630471349260287, -0.07929742695688773, -0.08699334217449543, 0.12569118485968003, 0.16843059144368203, 0.11754168281010513, -0.176064915209741, 0.11882101977177115, -0.023075759918000763, 0.17354470078335626, 0.015596343316780082, -0.01843468873358824, 0.14234455177700447, 0.15503573878240054, 0.05851003022372037, 0.11358408777822002, -0.11290624271275411, -0.11219752508773596, -0.3055323595127583, -0.15540825627759586, -0.21382692407538323, 0.019831095316350973, -0.0997702442656536, -0.13822554139923518, 0.41264532428272366, 0.20376224819859812, 0.21243060661222915, 0.08415549059231878, 0.28716960096539096, 0.1344972163888401, 0.07972090145380333, 0.09281200106555446, 0.2121498174821535, 0.09791265230294018, 0.04741544734944868, -0.2499376489291096, 0.02665521882557385, 0.0744245331573846] |
1,802.02945 | Lattice-induced photon scattering in an optical lattice clock | We investigate scattering of lattice laser radiation in a strontium optical
lattice clock and its implications for operating clocks at interrogation times
up to several tens of seconds. Rayleigh scattering does not cause significant
decoherence of the atomic superposition state near a magic wavelength. Among
the Raman scattering processes, lattice-induced decay of the excited state
$(5s5p)\,{}^{3}\mathrm{P}_{0}$ to the ground state
$(5s^2)\,{}^{1}\mathrm{S}_{0}$ via the state $(5s5p)\,{}^{3}\mathrm{P}_{1}$ is
particularly relevant, as it reduces the effective lifetime of the excited
state and gives rise to quantum projection noise in spectroscopy. We observe
this process in our experiment and find a decay rate of $556(15)\times
10^{-6}\,\mathrm{s}^{-1}$ per photon recoil energy $E_\mathrm{r}$ of effective
lattice depth, which agrees well with the rate we predict from atomic data. We
also derive a natural lifetime $\tau = 330(140)\,\mathrm{s}$ of the excited
state ${}^{3}\mathrm{P}_{0}$ from our observations. Lattice-induced decay thus
exceeds spontaneous decay at typical lattice depths used by present clocks. It
eventually limits interrogation times in clocks restricted to high-intensity
lattices, but can be largely avoided, e.g., by operating them with shallow
lattice potentials.
| physics.atom-ph | we investigate scattering of lattice laser radiation in a strontium optical lattice clock and its implications for operating clocks at interrogation times up to several tens of seconds rayleigh scattering does not cause significant decoherence of the atomic superposition state near a magic wavelength among the raman scattering processes latticeinduced decay of the excited state 5s5p3mathrmp_0 to the ground state 5s21mathrms_0 via the state 5s5p3mathrmp_1 is particularly relevant as it reduces the effective lifetime of the excited state and gives rise to quantum projection noise in spectroscopy we observe this process in our experiment and find a decay rate of 55615times 106mathrms1 per photon recoil energy e_mathrmr of effective lattice depth which agrees well with the rate we predict from atomic data we also derive a natural lifetime tau 330140mathrms of the excited state 3mathrmp_0 from our observations latticeinduced decay thus exceeds spontaneous decay at typical lattice depths used by present clocks it eventually limits interrogation times in clocks restricted to highintensity lattices but can be largely avoided eg by operating them with shallow lattice potentials | [['we', 'investigate', 'scattering', 'of', 'lattice', 'laser', 'radiation', 'in', 'a', 'strontium', 'optical', 'lattice', 'clock', 'and', 'its', 'implications', 'for', 'operating', 'clocks', 'at', 'interrogation', 'times', 'up', 'to', 'several', 'tens', 'of', 'seconds', 'rayleigh', 'scattering', 'does', 'not', 'cause', 'significant', 'decoherence', 'of', 'the', 'atomic', 'superposition', 'state', 'near', 'a', 'magic', 'wavelength', 'among', 'the', 'raman', 'scattering', 'processes', 'latticeinduced', 'decay', 'of', 'the', 'excited', 'state', '5s5p3mathrmp_0', 'to', 'the', 'ground', 'state', '5s21mathrms_0', 'via', 'the', 'state', '5s5p3mathrmp_1', 'is', 'particularly', 'relevant', 'as', 'it', 'reduces', 'the', 'effective', 'lifetime', 'of', 'the', 'excited', 'state', 'and', 'gives', 'rise', 'to', 'quantum', 'projection', 'noise', 'in', 'spectroscopy', 'we', 'observe', 'this', 'process', 'in', 'our', 'experiment', 'and', 'find', 'a', 'decay', 'rate', 'of', '55615times', '106mathrms1', 'per', 'photon', 'recoil', 'energy', 'e_mathrmr', 'of', 'effective', 'lattice', 'depth', 'which', 'agrees', 'well', 'with', 'the', 'rate', 'we', 'predict', 'from', 'atomic', 'data', 'we', 'also', 'derive', 'a', 'natural', 'lifetime', 'tau', '330140mathrms', 'of', 'the', 'excited', 'state', '3mathrmp_0', 'from', 'our', 'observations', 'latticeinduced', 'decay', 'thus', 'exceeds', 'spontaneous', 'decay', 'at', 'typical', 'lattice', 'depths', 'used', 'by', 'present', 'clocks', 'it', 'eventually', 'limits', 'interrogation', 'times', 'in', 'clocks', 'restricted', 'to', 'highintensity', 'lattices', 'but', 'can', 'be', 'largely', 'avoided', 'eg', 'by', 'operating', 'them', 'with', 'shallow', 'lattice', 'potentials']] | [-0.09649385859467882, 0.26433335405019437, -0.034752372919565296, 0.03979309021050158, 0.023911688895620536, -0.14208660838221746, 0.13058116293468197, 0.4047758619372661, -0.2779407925867977, -0.25947572486461334, 0.08149460142412217, -0.2723665096488445, -0.011251794885204742, 0.20947066841222697, 0.04367933388986796, 0.0585880151446275, 0.07286236762653309, 0.04531145419859322, -0.025579543442592112, -0.18505937717965193, 0.23936715409071488, 0.10363578204735122, 0.28562844609814153, 0.06552445786569774, 0.07328744724009892, 0.009634721506188607, 0.03264937839972285, -0.08251942905663519, -0.1206933442770487, 0.07008988577211221, 0.2226626794487679, 0.06173417054271028, 0.1809090992667266, -0.453722097365373, -0.21204423302641282, 0.10345012966072265, 0.14388393675355646, 0.2012195321641719, -0.009519466712172612, -0.31214079382407794, -0.023997979268938655, -0.14894191444487748, -0.13929445211384336, -0.07620432668437178, 0.038333993936894385, 0.011424646415257242, -0.25337755585574273, 0.08850996331232545, 0.00893214425883537, 0.043889215468159, -0.08270466878745683, -0.09948834768129987, 0.03829071422923114, 0.07746707305509168, 0.018981383315572715, 0.03320776126292374, 0.16221444974185006, -0.11616765368198038, -0.10635174550639587, 0.4089075162036884, -0.13187441537597563, -0.07603478921610399, 0.17988228729096678, -0.17047083104778765, -0.04797028043285321, 0.20545556580857235, 0.149963694836768, 0.09350065538072794, -0.09662045872241215, 0.0224760276208268, 0.024797029503946296, 0.22993880498206473, 0.11568585539666507, 0.14846416559489167, 0.21020111484493034, 0.19088769969723282, 0.03967907177229252, 0.12704172968993943, -0.1444602475748549, -0.09132733491811483, -0.2821497962143294, -0.09117020423711449, -0.16586119717141315, 0.12596502845024363, -0.014164994222531509, -0.09678743176228373, 0.3635663139722007, 0.13781840391126435, 0.19999823988189358, 0.010606408141933647, 0.2854228338072374, 0.1466689161472739, 0.09845736607104628, 0.012718815501839937, 0.2944881839391131, 0.13215923062443027, 0.06870643246764614, -0.3023773188855686, 0.02263558829153651, -0.0018126580205652311] |
1,802.02946 | The CARMENES search for exoplanets around M dwarfs - Photospheric
parameters of target stars from high-resolution spectroscopy | The new CARMENES instrument comprises two high-resolution and high-stability
spectrographs that are used to search for habitable planets around M dwarfs in
the visible and near-infrared regime via the Doppler technique. Characterising
our target sample is important for constraining the physical properties of any
planetary systems that are detected. The aim of this paper is to determine the
fundamental stellar parameters of the CARMENES M-dwarf target sample from
high-resolution spectra observed with CARMENES. We also include several M-dwarf
spectra observed with other high-resolution spectrographs, that is CAFE, FEROS,
and HRS, for completeness. We used a {chi}^2 method to derive the stellar
parameters effective temperature T_eff, surface gravity log g, and metallicity
[Fe/H] of the target stars by fitting the most recent version of the
PHOENIX-ACES models to high-resolution spectroscopic data. These stellar
atmosphere models incorporate a new equation of state to describe spectral
features of low-temperature stellar atmospheres. Since T_eff, log g, and [Fe/H]
show degeneracies, the surface gravity is determined independently using
stellar evolutionary models. We derive the stellar parameters for a total of
300 stars. The fits achieve very good agreement between the PHOENIX models and
observed spectra. We estimate that our method provides parameters with
uncertainties of {sigma} T_eff = 51 K, {sigma} log g = 0.07, and {sigma} [Fe/H]
= 0.16, and show that atmosphere models for low-mass stars have significantly
improved in the last years. Our work also provides an independent test of the
new PHOENIX-ACES models, and a comparison for other methods using
low-resolution spectra. In particular, our effective temperatures agree well
with literature values, while metallicities determined with our method exhibit
a larger spread when compared to literature results.
| astro-ph.SR astro-ph.EP | the new carmenes instrument comprises two highresolution and highstability spectrographs that are used to search for habitable planets around m dwarfs in the visible and nearinfrared regime via the doppler technique characterising our target sample is important for constraining the physical properties of any planetary systems that are detected the aim of this paper is to determine the fundamental stellar parameters of the carmenes mdwarf target sample from highresolution spectra observed with carmenes we also include several mdwarf spectra observed with other highresolution spectrographs that is cafe feros and hrs for completeness we used a chi2 method to derive the stellar parameters effective temperature t_eff surface gravity log g and metallicity feh of the target stars by fitting the most recent version of the phoenixaces models to highresolution spectroscopic data these stellar atmosphere models incorporate a new equation of state to describe spectral features of lowtemperature stellar atmospheres since t_eff log g and feh show degeneracies the surface gravity is determined independently using stellar evolutionary models we derive the stellar parameters for a total of 300 stars the fits achieve very good agreement between the phoenix models and observed spectra we estimate that our method provides parameters with uncertainties of sigma t_eff 51 k sigma log g 007 and sigma feh 016 and show that atmosphere models for lowmass stars have significantly improved in the last years our work also provides an independent test of the new phoenixaces models and a comparison for other methods using lowresolution spectra in particular our effective temperatures agree well with literature values while metallicities determined with our method exhibit a larger spread when compared to literature results | [['the', 'new', 'carmenes', 'instrument', 'comprises', 'two', 'highresolution', 'and', 'highstability', 'spectrographs', 'that', 'are', 'used', 'to', 'search', 'for', 'habitable', 'planets', 'around', 'm', 'dwarfs', 'in', 'the', 'visible', 'and', 'nearinfrared', 'regime', 'via', 'the', 'doppler', 'technique', 'characterising', 'our', 'target', 'sample', 'is', 'important', 'for', 'constraining', 'the', 'physical', 'properties', 'of', 'any', 'planetary', 'systems', 'that', 'are', 'detected', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'determine', 'the', 'fundamental', 'stellar', 'parameters', 'of', 'the', 'carmenes', 'mdwarf', 'target', 'sample', 'from', 'highresolution', 'spectra', 'observed', 'with', 'carmenes', 'we', 'also', 'include', 'several', 'mdwarf', 'spectra', 'observed', 'with', 'other', 'highresolution', 'spectrographs', 'that', 'is', 'cafe', 'feros', 'and', 'hrs', 'for', 'completeness', 'we', 'used', 'a', 'chi2', 'method', 'to', 'derive', 'the', 'stellar', 'parameters', 'effective', 'temperature', 't_eff', 'surface', 'gravity', 'log', 'g', 'and', 'metallicity', 'feh', 'of', 'the', 'target', 'stars', 'by', 'fitting', 'the', 'most', 'recent', 'version', 'of', 'the', 'phoenixaces', 'models', 'to', 'highresolution', 'spectroscopic', 'data', 'these', 'stellar', 'atmosphere', 'models', 'incorporate', 'a', 'new', 'equation', 'of', 'state', 'to', 'describe', 'spectral', 'features', 'of', 'lowtemperature', 'stellar', 'atmospheres', 'since', 't_eff', 'log', 'g', 'and', 'feh', 'show', 'degeneracies', 'the', 'surface', 'gravity', 'is', 'determined', 'independently', 'using', 'stellar', 'evolutionary', 'models', 'we', 'derive', 'the', 'stellar', 'parameters', 'for', 'a', 'total', 'of', '300', 'stars', 'the', 'fits', 'achieve', 'very', 'good', 'agreement', 'between', 'the', 'phoenix', 'models', 'and', 'observed', 'spectra', 'we', 'estimate', 'that', 'our', 'method', 'provides', 'parameters', 'with', 'uncertainties', 'of', 'sigma', 't_eff', '51', 'k', 'sigma', 'log', 'g', '007', 'and', 'sigma', 'feh', '016', 'and', 'show', 'that', 'atmosphere', 'models', 'for', 'lowmass', 'stars', 'have', 'significantly', 'improved', 'in', 'the', 'last', 'years', 'our', 'work', 'also', 'provides', 'an', 'independent', 'test', 'of', 'the', 'new', 'phoenixaces', 'models', 'and', 'a', 'comparison', 'for', 'other', 'methods', 'using', 'lowresolution', 'spectra', 'in', 'particular', 'our', 'effective', 'temperatures', 'agree', 'well', 'with', 'literature', 'values', 'while', 'metallicities', 'determined', 'with', 'our', 'method', 'exhibit', 'a', 'larger', 'spread', 'when', 'compared', 'to', 'literature', 'results']] | [-0.014713238412599614, 0.09784117836942052, -0.10095754383309256, 0.07562834668295601, -0.10568057037139442, -0.11820219076603597, 0.06024362329579549, 0.40541437494094335, -0.13919169331291834, -0.4218500778130205, 0.027726255937636363, -0.29465712894491114, -0.0520746962198452, 0.26182422550197265, -0.07687990712479521, 0.03207918514687126, 0.13767334783531643, -0.046659224650663945, -0.05563264444466994, -0.2682519247077385, 0.2939206759906766, 0.05722541916512478, 0.13968640726124493, -0.06332426927915533, 0.05185361299876997, -0.1011485488121159, -0.0739030596602285, -0.020811595210307465, -0.23216364976859694, 0.06255373435483856, 0.2703750875785479, 0.11144315580269318, 0.16788416591066962, -0.300239917224914, -0.2609080742778523, 0.040119349041394206, 0.1572912309093626, 0.037798881984909403, -0.05932125057718092, -0.22588343012927872, 0.08710529204908309, -0.1487992683497186, -0.14641134375314, -0.02727817562272288, 0.022272030826344158, 0.009316544865314327, -0.28810893348503464, 0.06704981970424242, -0.007960521027995035, 0.16162250962299415, -0.13779795821500265, -0.210217704454048, -0.07767666394109309, 0.12283305825647256, -0.013765893147357709, 0.030716440632714184, 0.09768191838275382, -0.09739591996867769, 0.004074398087910735, 0.39777168399234725, -0.17642093590211683, -0.03403809234980091, 0.20576025677449156, -0.15776537850860767, -0.15866881958038406, 0.08374649400894459, 0.16099543752312495, 0.18822233841648742, -0.19179226561039456, 0.04917445987605425, -0.018718472382585918, 0.22682692792314368, 0.033277479016593906, 0.04706410321488788, 0.2672114047041033, 0.13628733601172083, 0.015349033154758723, 0.024578173257216073, -0.23799089252464337, -0.0009458879479667643, -0.20825930984329172, -0.1086907456151377, -0.1158409393904219, 0.014835977312791479, -0.14609090499566046, -0.12007064564706205, 0.36170818670669863, 0.190440304411043, 0.20991823702859572, 0.09033876515228997, 0.32081397505129106, 0.10616344432201537, 0.08264546110652961, 0.10247055825780764, 0.2780865202026762, 0.20317873847670853, 0.07441919314506167, -0.2534121197099105, 0.04644753651620118, 0.003721790219360328] |
1,802.02947 | Gravitational waves from first order electroweak phase transition in
models with the $U(1)_X^{}$ gauge symmetry | We consider a standard model extension equipped with a dark sector where the
$U(1)_X^{}$ Abelian gauge symmetry is spontaneously broken by the dark Higgs
mechanism. In this framework, we investigate patterns of the electroweak phase
transition as well as those of the dark phase transition, and examine
detectability of gravitational waves (GWs) generated by such strongly first
order phase transition. It is pointed out that the collider bounds on the
properties of the discovered Higgs boson exclude a part of parameter space that
could otherwise generate detectable GWs. After imposing various constraints on
this model, it is shown that GWs produced by multi-step phase transitions are
detectable at future space-based interferometers, such as LISA and DECIGO, if
the dark photon is heavier than 25 GeV. Furthermore, we discuss the
complementarity of dark photon searches or dark matter searches with the GW
observations in these models with the dark gauge symmetry.
| hep-ph | we consider a standard model extension equipped with a dark sector where the u1_x abelian gauge symmetry is spontaneously broken by the dark higgs mechanism in this framework we investigate patterns of the electroweak phase transition as well as those of the dark phase transition and examine detectability of gravitational waves gws generated by such strongly first order phase transition it is pointed out that the collider bounds on the properties of the discovered higgs boson exclude a part of parameter space that could otherwise generate detectable gws after imposing various constraints on this model it is shown that gws produced by multistep phase transitions are detectable at future spacebased interferometers such as lisa and decigo if the dark photon is heavier than 25 gev furthermore we discuss the complementarity of dark photon searches or dark matter searches with the gw observations in these models with the dark gauge symmetry | [['we', 'consider', 'a', 'standard', 'model', 'extension', 'equipped', 'with', 'a', 'dark', 'sector', 'where', 'the', 'u1_x', 'abelian', 'gauge', 'symmetry', 'is', 'spontaneously', 'broken', 'by', 'the', 'dark', 'higgs', 'mechanism', 'in', 'this', 'framework', 'we', 'investigate', 'patterns', 'of', 'the', 'electroweak', 'phase', 'transition', 'as', 'well', 'as', 'those', 'of', 'the', 'dark', 'phase', 'transition', 'and', 'examine', 'detectability', 'of', 'gravitational', 'waves', 'gws', 'generated', 'by', 'such', 'strongly', 'first', 'order', 'phase', 'transition', 'it', 'is', 'pointed', 'out', 'that', 'the', 'collider', 'bounds', 'on', 'the', 'properties', 'of', 'the', 'discovered', 'higgs', 'boson', 'exclude', 'a', 'part', 'of', 'parameter', 'space', 'that', 'could', 'otherwise', 'generate', 'detectable', 'gws', 'after', 'imposing', 'various', 'constraints', 'on', 'this', 'model', 'it', 'is', 'shown', 'that', 'gws', 'produced', 'by', 'multistep', 'phase', 'transitions', 'are', 'detectable', 'at', 'future', 'spacebased', 'interferometers', 'such', 'as', 'lisa', 'and', 'decigo', 'if', 'the', 'dark', 'photon', 'is', 'heavier', 'than', '25', 'gev', 'furthermore', 'we', 'discuss', 'the', 'complementarity', 'of', 'dark', 'photon', 'searches', 'or', 'dark', 'matter', 'searches', 'with', 'the', 'gw', 'observations', 'in', 'these', 'models', 'with', 'the', 'dark', 'gauge', 'symmetry']] | [-0.1557226664146098, 0.2758313537699481, -0.07377322863166531, 0.1700522431746746, -0.1216613043565303, -0.13305700241898497, 0.006760526914149523, 0.342163463793695, -0.21618255527690053, -0.3249350960521648, 0.08535277566096434, -0.28683192893862725, -0.08911276816856116, 0.13100405564686904, 0.08722787093526373, 0.030155802195270857, 0.021173796572256834, -0.002770159598439932, -0.05819317662157118, -0.21488862151124824, 0.29942254699766635, 0.06681339062129457, 0.18266966767298679, 0.013592284821594755, 0.08483483834114547, -0.021553462063893677, -0.016510784865046542, -0.07604538943327498, -0.13567344950720628, -0.000873492465664943, 0.21259340883652234, 0.12467655801214278, 0.1459942759713158, -0.3960550241606931, -0.25058520045131444, 0.22140212815410146, 0.10819180553623786, 0.10565483434125782, -0.09941340545658023, -0.41933724787086246, 0.05845943966220754, -0.23493800609993437, -0.10185905672144145, -0.056125918370671574, -0.06083486954662173, -0.056002840952714905, -0.23782974739326165, 0.0610927186285456, -0.031159472534200178, -0.050235002379243575, -0.02863789498495559, -0.0660042572983851, -0.07397111937015628, -0.07377108823663245, 0.12746219598765796, 0.029616109874720374, 0.17541832292918116, -0.20606269951094874, -0.1522392641721914, 0.46147280221184095, -0.13872234025630556, -0.10863366023016473, 0.15697187645516048, -0.17011263711688418, -0.1745858043152839, 0.12531868606805802, 0.1529397178410242, 0.0998551067089041, -0.08763060279500981, 0.1334409529506229, 0.0003822700213640928, 0.20017319204596182, 0.07415495925272504, 0.08498577833175659, 0.36482774653782446, 0.18896395178822178, 0.08580573449842632, 0.08428175121545792, -0.10886899268565078, -0.0447492966024826, -0.4028244825576742, -0.11441776579245926, -0.13139413008466364, 0.01953046187059954, -0.035934595557822226, -0.08109321661894986, 0.3737447926371048, 0.1524266848154366, 0.16821003451943398, 0.012971224306772153, 0.2950989606200407, 0.0972050313015158, 0.05766643836570438, -0.0036974017055278335, 0.3780305419365565, 0.09765023305779323, 0.061515003933260835, -0.18178286756699283, -0.012969960402697324, 0.03533955165262644] |
1,802.02948 | Fragmentation-fraction ratio $f_{\Xi_b}/f_{\Lambda_b}$ in $b$- and
$c$-baryon decays | We study the ratio of fragmentation fractions, $f_{\Xi_b}/f_{\Lambda_b}$,
from the measurement of $\Xi_b^0\to \Xi_c^+\pi^-$ and $\Lambda_b^0\to
\Lambda_c^+\pi^-$ with $\Xi_{c}^{+}/\Lambda_{c}^{+}\to p K^-\pi^+$. With the
branching fraction $\mathcal{B}(\Xi_c^+\to pK^-\pi^+)=(2.2\pm0.8)\%$ obtained
under the U-spin symmetry, the fragmentation ratio is determined as
$f_{\Xi_b}/f_{\Lambda_b}$=$0.054\pm0.020$. To reduce the above uncertainties,
we suggest to measure the branching fractions of $\Xi_c^+\to p \overline
K^{*0}$ and $\Lambda_c^+\to \Sigma^+ K^{*0}$ at BESIII, Belle(II) and LHCb.
| hep-ph hep-ex | we study the ratio of fragmentation fractions f_xi_bf_lambda_b from the measurement of xi_b0to xi_cpi and lambda_b0to lambda_cpi with xi_clambda_cto p kpi with the branching fraction mathcalbxi_cto pkpi22pm08 obtained under the uspin symmetry the fragmentation ratio is determined as f_xi_bf_lambda_b0054pm0020 to reduce the above uncertainties we suggest to measure the branching fractions of xi_cto p overline k0 and lambda_cto sigma k0 at besiii belleii and lhcb | [['we', 'study', 'the', 'ratio', 'of', 'fragmentation', 'fractions', 'f_xi_bf_lambda_b', 'from', 'the', 'measurement', 'of', 'xi_b0to', 'xi_cpi', 'and', 'lambda_b0to', 'lambda_cpi', 'with', 'xi_clambda_cto', 'p', 'kpi', 'with', 'the', 'branching', 'fraction', 'mathcalbxi_cto', 'pkpi22pm08', 'obtained', 'under', 'the', 'uspin', 'symmetry', 'the', 'fragmentation', 'ratio', 'is', 'determined', 'as', 'f_xi_bf_lambda_b0054pm0020', 'to', 'reduce', 'the', 'above', 'uncertainties', 'we', 'suggest', 'to', 'measure', 'the', 'branching', 'fractions', 'of', 'xi_cto', 'p', 'overline', 'k0', 'and', 'lambda_cto', 'sigma', 'k0', 'at', 'besiii', 'belleii', 'and', 'lhcb']] | [-0.11786894534390925, 0.22088184217148918, -0.09299633475967635, 0.04544486592610572, -0.00500823699443017, -0.07045610353224359, 0.13382465307111457, 0.24849172130669073, -0.201052298422082, -0.22583270151862653, -0.010935932018999325, -0.3654452961380199, 0.056789354705330676, 0.10482773390772232, 0.0660555704133743, 0.14996664790373485, 0.07492531585049327, -0.005211401201974032, -0.05585260753977602, -0.19023960183169378, 0.22169613153219886, 0.024502817572931112, 0.19194628225671032, 0.09272887215503665, -0.03612176752333545, -0.025070549643961555, -0.07944067670190233, -0.03431609971843407, -0.27666883874621434, -0.006302084189729165, 0.2196402212810087, 0.1541676650107917, 0.05629478259627723, -0.24034282085248979, 0.03435433169795295, 0.22218464384392156, 0.12831084932184825, 0.001380119977866189, 0.034620090277265696, -0.39100615307688713, 0.20922925305390982, -0.1479733239038516, -0.09400001404436022, -0.029007939590235888, 0.10701990790538869, -0.06218722188387508, -0.34082243294786596, 0.13427694122922623, -0.05933885377342418, 0.03565345053813594, -0.005049583825708951, -0.3248237901509313, -0.05686778757500194, -0.01165462984561415, 0.12070349687355239, 0.09813350678610978, 0.19934652428639957, -0.1039126737090617, -0.12582086186098346, 0.4172004160739608, -0.07070093039991492, -0.1693280416918658, 0.08900975958854591, -0.30394395540263186, -0.19262663245800946, 0.20061543615440192, 0.24554153718054295, 0.011901802304437605, -0.09262415247385279, 0.08389515937720346, -0.013732331059083848, 0.1655557596645618, 0.13179985088911855, 0.042729745334866696, 0.1179729745707522, 0.17813785366272017, -0.027415033635067736, 0.08069869152949018, -0.08714733791727004, -0.01978716615713754, -0.3813863598812624, -0.13323853527969223, -0.02547791713485652, 0.13121515693995406, -0.03270413810944666, -0.004090001530377037, 0.22285757752893082, -0.005037667577044438, 0.3710593055239168, 0.1123695446778152, 0.2403690792872744, 0.1345421205742395, 0.02116716610094122, 0.005100763229242826, 0.27100786402568977, 0.23199056169428564, 0.09842706583558693, -0.3650822061926947, 0.09244493960986956, -0.005512902386865373] |
1,802.02949 | Capillary-driven binding of thin triangular prisms at fluid interfaces | We observe capillary-driven binding between thin, equilateral triangular
prisms at a flat air-water interface. The edge length of the equilateral
triangle face is 120 $\mu m$, and the thickness of the prism is varied between
2 and 20 $\mu m$. For thickness to length (T/L) ratios of 1/10 or less, pairs
of triangles preferentially bind in either a tip-to-tip or tip-to-midpoint edge
configurations; for pairs of particles of thickness T/L = 1/5, the tip of one
triangle binds to any position along the other triangle's edge. The distinct
binding configurations for small T/L ratios result from physical bowing of the
prisms, a property that arises during their fabrication. When bowed prisms are
placed at the air-water interface, two distinct polarity states arise: prisms
either sit with their center of mass above or below the interface. The
interface pins to the edge of the prism's concave face, resulting in an
interface profile that is similar to that of a capillary hexapole, but with
important deviations close to the particle that enable directed binding. We
present corresponding theoretical and numerical analysis of the capillary
interactions between these prisms and show how particle bowing and contact-line
pinning yield a capillary hexapole-like interaction that results in the two
sets of distinct, highly-directional binding events. Prisms of all T/L ratios
self-assemble into space-spanning open networks; the results suggest design
parameters for the fabrication of building blocks of ordered open structures
such as the Kagome lattice.
| cond-mat.soft physics.flu-dyn | we observe capillarydriven binding between thin equilateral triangular prisms at a flat airwater interface the edge length of the equilateral triangle face is 120 mu m and the thickness of the prism is varied between 2 and 20 mu m for thickness to length tl ratios of 110 or less pairs of triangles preferentially bind in either a tiptotip or tiptomidpoint edge configurations for pairs of particles of thickness tl 15 the tip of one triangle binds to any position along the other triangles edge the distinct binding configurations for small tl ratios result from physical bowing of the prisms a property that arises during their fabrication when bowed prisms are placed at the airwater interface two distinct polarity states arise prisms either sit with their center of mass above or below the interface the interface pins to the edge of the prisms concave face resulting in an interface profile that is similar to that of a capillary hexapole but with important deviations close to the particle that enable directed binding we present corresponding theoretical and numerical analysis of the capillary interactions between these prisms and show how particle bowing and contactline pinning yield a capillary hexapolelike interaction that results in the two sets of distinct highlydirectional binding events prisms of all tl ratios selfassemble into spacespanning open networks the results suggest design parameters for the fabrication of building blocks of ordered open structures such as the kagome lattice | [['we', 'observe', 'capillarydriven', 'binding', 'between', 'thin', 'equilateral', 'triangular', 'prisms', 'at', 'a', 'flat', 'airwater', 'interface', 'the', 'edge', 'length', 'of', 'the', 'equilateral', 'triangle', 'face', 'is', '120', 'mu', 'm', 'and', 'the', 'thickness', 'of', 'the', 'prism', 'is', 'varied', 'between', '2', 'and', '20', 'mu', 'm', 'for', 'thickness', 'to', 'length', 'tl', 'ratios', 'of', '110', 'or', 'less', 'pairs', 'of', 'triangles', 'preferentially', 'bind', 'in', 'either', 'a', 'tiptotip', 'or', 'tiptomidpoint', 'edge', 'configurations', 'for', 'pairs', 'of', 'particles', 'of', 'thickness', 'tl', '15', 'the', 'tip', 'of', 'one', 'triangle', 'binds', 'to', 'any', 'position', 'along', 'the', 'other', 'triangles', 'edge', 'the', 'distinct', 'binding', 'configurations', 'for', 'small', 'tl', 'ratios', 'result', 'from', 'physical', 'bowing', 'of', 'the', 'prisms', 'a', 'property', 'that', 'arises', 'during', 'their', 'fabrication', 'when', 'bowed', 'prisms', 'are', 'placed', 'at', 'the', 'airwater', 'interface', 'two', 'distinct', 'polarity', 'states', 'arise', 'prisms', 'either', 'sit', 'with', 'their', 'center', 'of', 'mass', 'above', 'or', 'below', 'the', 'interface', 'the', 'interface', 'pins', 'to', 'the', 'edge', 'of', 'the', 'prisms', 'concave', 'face', 'resulting', 'in', 'an', 'interface', 'profile', 'that', 'is', 'similar', 'to', 'that', 'of', 'a', 'capillary', 'hexapole', 'but', 'with', 'important', 'deviations', 'close', 'to', 'the', 'particle', 'that', 'enable', 'directed', 'binding', 'we', 'present', 'corresponding', 'theoretical', 'and', 'numerical', 'analysis', 'of', 'the', 'capillary', 'interactions', 'between', 'these', 'prisms', 'and', 'show', 'how', 'particle', 'bowing', 'and', 'contactline', 'pinning', 'yield', 'a', 'capillary', 'hexapolelike', 'interaction', 'that', 'results', 'in', 'the', 'two', 'sets', 'of', 'distinct', 'highlydirectional', 'binding', 'events', 'prisms', 'of', 'all', 'tl', 'ratios', 'selfassemble', 'into', 'spacespanning', 'open', 'networks', 'the', 'results', 'suggest', 'design', 'parameters', 'for', 'the', 'fabrication', 'of', 'building', 'blocks', 'of', 'ordered', 'open', 'structures', 'such', 'as', 'the', 'kagome', 'lattice']] | [-0.15192214746267893, 0.20188741859463427, -0.018495248146561456, 0.011487738096832106, -0.040812531228762765, -0.18720362440561128, 0.03126589562311643, 0.42122315167437624, -0.2730297479318761, -0.31879267609680173, 0.032132705851882416, -0.3537285202163181, -0.09762671040194228, 0.13079404646043474, 0.025039446785778813, -0.00854406434303849, 0.04612155927969968, -0.02270703325696478, -0.03828004326618312, -0.15759202076774484, 0.27094169348948766, 0.004462115014687118, 0.2705559985749502, 0.10505891713325548, 0.030035298885502517, 0.011204465165663558, 0.08845928562254908, 0.060223743089627996, -0.19196299507648254, 0.1278541603095914, 0.21587726872518487, -0.005668457964914635, 0.14828229698112808, -0.45481657361776767, -0.12816682582493197, 0.03224041449094686, 0.13851870303553085, 0.08149038595668107, -0.04858854633288356, -0.23986757608751455, 0.07742809206674676, -0.07683333660424825, -0.1364800973936821, 0.05457662160013201, 0.04580821474338194, 0.05232761702932543, -0.22694463075658322, 0.03677173283438391, 0.0941996526617541, 0.06583557574801492, -0.04029971683684752, -0.17790851901375732, -0.0913600095779584, 0.1280233429973004, 0.02693175695903348, 0.007124579193282731, 0.18601744569531536, -0.11717108973716524, -0.08611422929252628, 0.3923769044230067, -0.0015849806260286128, -0.17334931383581384, 0.19466600946508317, -0.14988811236986976, -0.07548699561479003, 0.1812108280864163, 0.1422480670244036, 0.05993632968409058, -0.08182302774118018, 0.04270929054780529, -0.02920443466314378, 0.18170873037115023, 0.17229019544275972, -0.013314262836118413, 0.26166045179252634, 0.16919513979439432, 0.10069493536409069, 0.16037234352171648, -0.12424074858034084, -0.05960504391391758, -0.257949266781665, -0.1572290167614291, -0.16835732795597733, -0.005614709533959281, -0.13933029260164873, -0.23294723343166998, 0.3369369913297332, 0.05953164310351737, 0.23773563290918678, 0.018187722089044154, 0.23470596244307196, 0.007964991439302857, 0.11789907880701156, 0.01827548518688477, 0.22915958854633103, 0.11214403706437708, 0.05674011953660623, -0.2039830026930033, 0.030507557311209257, 0.042673428564524975] |
1,802.0295 | Rotate your Networks: Better Weight Consolidation and Less Catastrophic
Forgetting | In this paper we propose an approach to avoiding catastrophic forgetting in
sequential task learning scenarios. Our technique is based on a network
reparameterization that approximately diagonalizes the Fisher Information
Matrix of the network parameters. This reparameterization takes the form of a
factorized rotation of parameter space which, when used in conjunction with
Elastic Weight Consolidation (which assumes a diagonal Fisher Information
Matrix), leads to significantly better performance on lifelong learning of
sequential tasks. Experimental results on the MNIST, CIFAR-100, CUB-200 and
Stanford-40 datasets demonstrate that we significantly improve the results of
standard elastic weight consolidation, and that we obtain competitive results
when compared to other state-of-the-art in lifelong learning without
forgetting.
| cs.CV | in this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios our technique is based on a network reparameterization that approximately diagonalizes the fisher information matrix of the network parameters this reparameterization takes the form of a factorized rotation of parameter space which when used in conjunction with elastic weight consolidation which assumes a diagonal fisher information matrix leads to significantly better performance on lifelong learning of sequential tasks experimental results on the mnist cifar100 cub200 and stanford40 datasets demonstrate that we significantly improve the results of standard elastic weight consolidation and that we obtain competitive results when compared to other stateoftheart in lifelong learning without forgetting | [['in', 'this', 'paper', 'we', 'propose', 'an', 'approach', 'to', 'avoiding', 'catastrophic', 'forgetting', 'in', 'sequential', 'task', 'learning', 'scenarios', 'our', 'technique', 'is', 'based', 'on', 'a', 'network', 'reparameterization', 'that', 'approximately', 'diagonalizes', 'the', 'fisher', 'information', 'matrix', 'of', 'the', 'network', 'parameters', 'this', 'reparameterization', 'takes', 'the', 'form', 'of', 'a', 'factorized', 'rotation', 'of', 'parameter', 'space', 'which', 'when', 'used', 'in', 'conjunction', 'with', 'elastic', 'weight', 'consolidation', 'which', 'assumes', 'a', 'diagonal', 'fisher', 'information', 'matrix', 'leads', 'to', 'significantly', 'better', 'performance', 'on', 'lifelong', 'learning', 'of', 'sequential', 'tasks', 'experimental', 'results', 'on', 'the', 'mnist', 'cifar100', 'cub200', 'and', 'stanford40', 'datasets', 'demonstrate', 'that', 'we', 'significantly', 'improve', 'the', 'results', 'of', 'standard', 'elastic', 'weight', 'consolidation', 'and', 'that', 'we', 'obtain', 'competitive', 'results', 'when', 'compared', 'to', 'other', 'stateoftheart', 'in', 'lifelong', 'learning', 'without', 'forgetting']] | [-0.027207156911962165, 0.028289415908018003, -0.09683284907701559, 0.026519343937772128, -0.11588321560910637, -0.1366069553561309, 0.06675696083402727, 0.41324081997403744, -0.26988401415292174, -0.29141936607525815, 0.06332279783340969, -0.24304912658408284, -0.20812198488108283, 0.1965260370301881, -0.1497965406493417, 0.09999804235121701, 0.17508347897715534, 0.07405146780573497, -0.13632158378563222, -0.3275875793281427, 0.3214041063474724, 0.06651112325822137, 0.3600346594882597, 0.018267083071155606, 0.13645557766929933, 0.0229433557791968, 0.007129026250497971, -0.03330532144406918, -0.06482553540984425, 0.16091789370485848, 0.24850343496551172, 0.18156888925087905, 0.29075197695887517, -0.41451573989719953, -0.21987200850604235, 0.12129519900606413, 0.13301292251396393, 0.10080012985846613, -0.0108892317667986, -0.3170185026080747, 0.06963138452348565, -0.1971770587177681, 0.02802534810533481, -0.17269026224883938, -0.05943487535530169, -0.059852652777928075, -0.3601279165928385, 0.09680960729019716, 0.09667148007013436, 0.0005155868724874121, -0.0632024419672754, -0.16325170607264486, 0.05299249862478713, 0.09637423845924786, 0.04837116389327483, 0.07030708227414705, 0.15335551645590126, -0.17026574899292818, -0.16663985061209782, 0.35165534708981533, -0.0920262626729839, -0.20604859170271084, 0.15031803790355167, -0.027170813526026905, -0.14577449769214063, 0.08049384425560545, 0.2304807557957247, 0.08770977153575846, -0.11414408265227394, 0.02347730712062912, -0.05826006782548835, 0.1943318358680699, 0.03279716197201716, -0.03275648265428442, 0.06712256498576608, 0.25950616828881073, 0.04616687774874403, 0.13635379720705845, -0.09732516449003015, -0.12545917727818182, -0.20504441973753273, -0.12090796516609512, -0.18680221416954218, 0.00541054123563559, -0.16605743857274188, -0.13941965812617646, 0.3671937587558724, 0.23558584070997313, 0.24981455864950217, 0.14108646436216077, 0.34852950095332097, 0.03690051750683259, 0.13233739718894608, 0.11389315953575922, 0.2150612661415445, 0.03205344875875328, 0.10606763623322227, -0.2248505471631818, 0.09871384469287088, 0.04991798215944852] |
1,802.02951 | A Separation Logic for Concurrent Randomized Programs | We present Polaris, a concurrent separation logic with support for
probabilistic reasoning. As part of our logic, we extend the idea of coupling,
which underlies recent work on probabilistic relational logics, to the setting
of programs with both probabilistic and non-deterministic choice. To
demonstrate Polaris, we verify a variant of a randomized concurrent counter
algorithm and a two-level concurrent skip list. All of our results have been
mechanized in Coq.
| cs.PL cs.LO | we present polaris a concurrent separation logic with support for probabilistic reasoning as part of our logic we extend the idea of coupling which underlies recent work on probabilistic relational logics to the setting of programs with both probabilistic and nondeterministic choice to demonstrate polaris we verify a variant of a randomized concurrent counter algorithm and a twolevel concurrent skip list all of our results have been mechanized in coq | [['we', 'present', 'polaris', 'a', 'concurrent', 'separation', 'logic', 'with', 'support', 'for', 'probabilistic', 'reasoning', 'as', 'part', 'of', 'our', 'logic', 'we', 'extend', 'the', 'idea', 'of', 'coupling', 'which', 'underlies', 'recent', 'work', 'on', 'probabilistic', 'relational', 'logics', 'to', 'the', 'setting', 'of', 'programs', 'with', 'both', 'probabilistic', 'and', 'nondeterministic', 'choice', 'to', 'demonstrate', 'polaris', 'we', 'verify', 'a', 'variant', 'of', 'a', 'randomized', 'concurrent', 'counter', 'algorithm', 'and', 'a', 'twolevel', 'concurrent', 'skip', 'list', 'all', 'of', 'our', 'results', 'have', 'been', 'mechanized', 'in', 'coq']] | [-0.1077599364731993, 0.005054630758240819, -0.10111026631535164, 0.06572418577436889, -0.18358117639353233, -0.16337440700403283, 0.11181956786063633, 0.40829873265964645, -0.264918379745047, -0.30049885998346976, 0.05126397672076044, -0.18292516940938575, -0.13280472034322363, 0.18764373790472746, -0.11985454271946634, 0.12382532507181168, 0.07531196127778718, 0.00789575752403055, 0.0009322348649480513, -0.23607396778118397, 0.2769851155845182, 0.01620096010821206, 0.21002891270576843, 0.03576065840731774, 0.08542278464883565, 0.07926404315180012, -0.04327033955071654, 0.05352089043174471, -0.05391658753422754, 0.13994301821969982, 0.3257664826831647, 0.26992903075380514, 0.33605398695383754, -0.4354314251669816, -0.14723768179704036, 0.006941753213426896, 0.07189578063386892, 0.1440155993465201, -0.01023653346014076, -0.31614873542317323, 0.08563189949574215, -0.22143491763355477, -0.03453193392072405, -0.12088136398898704, 0.011900011529879911, 0.03178042858905558, -0.2595160634123853, -0.09657756664923259, 0.20273763026509967, 0.11609032845257648, -0.00974978780640023, -0.07731444865390326, 0.07420799806048828, 0.038500818224357705, -0.047485128257955825, 0.02622124079747924, 0.07992935408172863, -0.017848016547837426, -0.29979847756746625, 0.30949485224804707, -0.04096582418839846, -0.13971931653629457, 0.22094147710927894, -0.030361086156751427, -0.2608862524852157, 0.062475530171234694, 0.1480332103823977, 0.14192682565855128, -0.10786652363437627, 0.08706884189076455, -0.0908619833436595, 0.26367553123106646, 0.07646385883646352, 0.08671466668269463, 0.18444666931671755, 0.23583386927577002, 0.0018909083579533867, 0.19038995430206082, -0.013230724037358803, -0.1727206311404838, -0.30644685169681907, -0.21279978386425813, -0.08760169852258903, -0.06055632580869964, -0.06470992690841999, -0.20484353419659393, 0.35946343585050533, 0.21838654231812274, 0.13344531764409373, 0.21697702985423217, 0.3249092774731772, 0.06447381116616141, 0.08075876020094645, 0.08503728746436537, 0.17706876569344396, 0.16448965650717062, 0.18212987331540456, -0.19131319196894764, 0.12975969654009012, 0.0660723821393081] |
1,802.02952 | TSViz: Demystification of Deep Learning Models for Time-Series Analysis | This paper presents a novel framework for demystification of convolutional
deep learning models for time-series analysis. This is a step towards making
informed/explainable decisions in the domain of time-series, powered by deep
learning. There have been numerous efforts to increase the interpretability of
image-centric deep neural network models, where the learned features are more
intuitive to visualize. Visualization in time-series domain is much more
complicated as there is no direct interpretation of the filters and inputs as
compared to the image modality. In addition, little or no concentration has
been devoted for the development of such tools in the domain of time-series in
the past. TSViz provides possibilities to explore and analyze a network from
different dimensions at different levels of abstraction which includes
identification of parts of the input that were responsible for a prediction
(including per filter saliency), importance of different filters present in the
network for a particular prediction, notion of diversity present in the network
through filter clustering, understanding of the main sources of variation
learnt by the network through inverse optimization, and analysis of the
network's robustness against adversarial noise. As a sanity check for the
computed influence values, we demonstrate results regarding pruning of neural
networks based on the computed influence information. These representations
allow to understand the network features so that the acceptability of deep
networks for time-series data can be enhanced. This is extremely important in
domains like finance, industry 4.0, self-driving cars, health-care,
counter-terrorism etc., where reasons for reaching a particular prediction are
equally important as the prediction itself. We assess the proposed framework
for interpretability with a set of desirable properties essential for any
method.
| cs.LG cs.HC | this paper presents a novel framework for demystification of convolutional deep learning models for timeseries analysis this is a step towards making informedexplainable decisions in the domain of timeseries powered by deep learning there have been numerous efforts to increase the interpretability of imagecentric deep neural network models where the learned features are more intuitive to visualize visualization in timeseries domain is much more complicated as there is no direct interpretation of the filters and inputs as compared to the image modality in addition little or no concentration has been devoted for the development of such tools in the domain of timeseries in the past tsviz provides possibilities to explore and analyze a network from different dimensions at different levels of abstraction which includes identification of parts of the input that were responsible for a prediction including per filter saliency importance of different filters present in the network for a particular prediction notion of diversity present in the network through filter clustering understanding of the main sources of variation learnt by the network through inverse optimization and analysis of the networks robustness against adversarial noise as a sanity check for the computed influence values we demonstrate results regarding pruning of neural networks based on the computed influence information these representations allow to understand the network features so that the acceptability of deep networks for timeseries data can be enhanced this is extremely important in domains like finance industry 40 selfdriving cars healthcare counterterrorism etc where reasons for reaching a particular prediction are equally important as the prediction itself we assess the proposed framework for interpretability with a set of desirable properties essential for any method | [['this', 'paper', 'presents', 'a', 'novel', 'framework', 'for', 'demystification', 'of', 'convolutional', 'deep', 'learning', 'models', 'for', 'timeseries', 'analysis', 'this', 'is', 'a', 'step', 'towards', 'making', 'informedexplainable', 'decisions', 'in', 'the', 'domain', 'of', 'timeseries', 'powered', 'by', 'deep', 'learning', 'there', 'have', 'been', 'numerous', 'efforts', 'to', 'increase', 'the', 'interpretability', 'of', 'imagecentric', 'deep', 'neural', 'network', 'models', 'where', 'the', 'learned', 'features', 'are', 'more', 'intuitive', 'to', 'visualize', 'visualization', 'in', 'timeseries', 'domain', 'is', 'much', 'more', 'complicated', 'as', 'there', 'is', 'no', 'direct', 'interpretation', 'of', 'the', 'filters', 'and', 'inputs', 'as', 'compared', 'to', 'the', 'image', 'modality', 'in', 'addition', 'little', 'or', 'no', 'concentration', 'has', 'been', 'devoted', 'for', 'the', 'development', 'of', 'such', 'tools', 'in', 'the', 'domain', 'of', 'timeseries', 'in', 'the', 'past', 'tsviz', 'provides', 'possibilities', 'to', 'explore', 'and', 'analyze', 'a', 'network', 'from', 'different', 'dimensions', 'at', 'different', 'levels', 'of', 'abstraction', 'which', 'includes', 'identification', 'of', 'parts', 'of', 'the', 'input', 'that', 'were', 'responsible', 'for', 'a', 'prediction', 'including', 'per', 'filter', 'saliency', 'importance', 'of', 'different', 'filters', 'present', 'in', 'the', 'network', 'for', 'a', 'particular', 'prediction', 'notion', 'of', 'diversity', 'present', 'in', 'the', 'network', 'through', 'filter', 'clustering', 'understanding', 'of', 'the', 'main', 'sources', 'of', 'variation', 'learnt', 'by', 'the', 'network', 'through', 'inverse', 'optimization', 'and', 'analysis', 'of', 'the', 'networks', 'robustness', 'against', 'adversarial', 'noise', 'as', 'a', 'sanity', 'check', 'for', 'the', 'computed', 'influence', 'values', 'we', 'demonstrate', 'results', 'regarding', 'pruning', 'of', 'neural', 'networks', 'based', 'on', 'the', 'computed', 'influence', 'information', 'these', 'representations', 'allow', 'to', 'understand', 'the', 'network', 'features', 'so', 'that', 'the', 'acceptability', 'of', 'deep', 'networks', 'for', 'timeseries', 'data', 'can', 'be', 'enhanced', 'this', 'is', 'extremely', 'important', 'in', 'domains', 'like', 'finance', 'industry', '40', 'selfdriving', 'cars', 'healthcare', 'counterterrorism', 'etc', 'where', 'reasons', 'for', 'reaching', 'a', 'particular', 'prediction', 'are', 'equally', 'important', 'as', 'the', 'prediction', 'itself', 'we', 'assess', 'the', 'proposed', 'framework', 'for', 'interpretability', 'with', 'a', 'set', 'of', 'desirable', 'properties', 'essential', 'for', 'any', 'method']] | [-0.04317955459867205, -0.0011119600521884996, -0.07600548602606515, 0.08506615011186949, -0.08482474872276133, -0.14388039735983374, 0.03277593847208967, 0.4340793038257858, -0.25660853576078846, -0.3211642628921121, 0.11865913853771651, -0.2581673537196776, -0.21303870374099743, 0.19706891700919657, -0.09571132826981023, 0.0771028416205369, 0.09917738305687505, 0.03717176027729469, -0.02421394140364077, -0.2111557373013083, 0.31271545972245246, 0.060382787307516256, 0.31931728886552546, 0.03250186783756256, 0.10771680162450292, -0.00926734025047703, -0.07796654495284398, 0.0005155739608142292, -0.07105961655405812, 0.1806152507615013, 0.32155208560952514, 0.18859124499724517, 0.355429214364832, -0.43114543930651283, -0.2806983897978467, 0.10749577344420806, 0.1548635798946514, 0.09351865904305076, -0.03251611070475889, -0.3003689853283457, 0.10229937613075224, -0.16014258954554605, -0.042713036122748925, -0.14349311996411682, 0.03053151123437198, -0.0047214805880295375, -0.2697971804568974, 0.016684071455089437, 0.06550606179747034, 0.09555424587296206, -0.04829212899531763, -0.1278841119931649, -0.0051099469897170095, 0.1903756416731961, 0.04986642602440516, 0.023511177260213748, 0.11755215725264488, -0.21477225540468517, -0.13183856026556057, 0.3552309870310537, -0.04461939352216547, -0.1773142537844944, 0.19538257783790539, -0.044825647226722415, -0.1650023269211198, 0.0881421673418647, 0.240531540416512, 0.08623648293206772, -0.169409966563649, 0.004265432554124871, -0.010168008739981568, 0.16449423367797222, 0.03354594924388242, 0.045086708055867133, 0.19559617793006692, 0.28195866503524203, 0.03739749975656006, 0.15503590470418716, -0.12378235705300906, -0.07203607836861041, -0.23006274734091545, -0.12597383204259102, -0.1518619840933972, -0.01660170485120567, -0.09960500845866194, -0.14411522949181818, 0.4227931045836438, 0.22618978853497804, 0.21113348221312525, 0.055116154392072486, 0.3258202016104572, 0.06507981593782235, 0.11873563822024526, 0.048132213086722206, 0.21709149349659967, 0.0696638049600448, 0.14377208769614824, -0.14259357238764067, 0.13175127329645958, 0.021919921246074114] |
1,802.02953 | Open Data, Grey Data, and Stewardship: Universities at the Privacy
Frontier | As universities recognize the inherent value in the data they collect and
hold, they encounter unforeseen challenges in stewarding those data in ways
that balance accountability, transparency, and protection of privacy, academic
freedom, and intellectual property. Two parallel developments in academic data
collection are converging: (1) open access requirements, whereby researchers
must provide access to their data as a condition of obtaining grant funding or
publishing results in journals; and (2) the vast accumulation of 'grey data'
about individuals in their daily activities of research, teaching, learning,
services, and administration. The boundaries between research and grey data are
blurring, making it more difficult to assess the risks and responsibilities
associated with any data collection. Many sets of data, both research and grey,
fall outside privacy regulations such as HIPAA, FERPA, and PII. Universities
are exploiting these data for research, learning analytics, faculty evaluation,
strategic decisions, and other sensitive matters. Commercial entities are
besieging universities with requests for access to data or for partnerships to
mine them. The privacy frontier facing research universities spans open access
practices, uses and misuses of data, public records requests, cyber risk, and
curating data for privacy protection. This paper explores the competing values
inherent in data stewardship and makes recommendations for practice, drawing on
the pioneering work of the University of California in privacy and information
security, data governance, and cyber risk.
| cs.DL cs.CR cs.CY | as universities recognize the inherent value in the data they collect and hold they encounter unforeseen challenges in stewarding those data in ways that balance accountability transparency and protection of privacy academic freedom and intellectual property two parallel developments in academic data collection are converging 1 open access requirements whereby researchers must provide access to their data as a condition of obtaining grant funding or publishing results in journals and 2 the vast accumulation of grey data about individuals in their daily activities of research teaching learning services and administration the boundaries between research and grey data are blurring making it more difficult to assess the risks and responsibilities associated with any data collection many sets of data both research and grey fall outside privacy regulations such as hipaa ferpa and pii universities are exploiting these data for research learning analytics faculty evaluation strategic decisions and other sensitive matters commercial entities are besieging universities with requests for access to data or for partnerships to mine them the privacy frontier facing research universities spans open access practices uses and misuses of data public records requests cyber risk and curating data for privacy protection this paper explores the competing values inherent in data stewardship and makes recommendations for practice drawing on the pioneering work of the university of california in privacy and information security data governance and cyber risk | [['as', 'universities', 'recognize', 'the', 'inherent', 'value', 'in', 'the', 'data', 'they', 'collect', 'and', 'hold', 'they', 'encounter', 'unforeseen', 'challenges', 'in', 'stewarding', 'those', 'data', 'in', 'ways', 'that', 'balance', 'accountability', 'transparency', 'and', 'protection', 'of', 'privacy', 'academic', 'freedom', 'and', 'intellectual', 'property', 'two', 'parallel', 'developments', 'in', 'academic', 'data', 'collection', 'are', 'converging', '1', 'open', 'access', 'requirements', 'whereby', 'researchers', 'must', 'provide', 'access', 'to', 'their', 'data', 'as', 'a', 'condition', 'of', 'obtaining', 'grant', 'funding', 'or', 'publishing', 'results', 'in', 'journals', 'and', '2', 'the', 'vast', 'accumulation', 'of', 'grey', 'data', 'about', 'individuals', 'in', 'their', 'daily', 'activities', 'of', 'research', 'teaching', 'learning', 'services', 'and', 'administration', 'the', 'boundaries', 'between', 'research', 'and', 'grey', 'data', 'are', 'blurring', 'making', 'it', 'more', 'difficult', 'to', 'assess', 'the', 'risks', 'and', 'responsibilities', 'associated', 'with', 'any', 'data', 'collection', 'many', 'sets', 'of', 'data', 'both', 'research', 'and', 'grey', 'fall', 'outside', 'privacy', 'regulations', 'such', 'as', 'hipaa', 'ferpa', 'and', 'pii', 'universities', 'are', 'exploiting', 'these', 'data', 'for', 'research', 'learning', 'analytics', 'faculty', 'evaluation', 'strategic', 'decisions', 'and', 'other', 'sensitive', 'matters', 'commercial', 'entities', 'are', 'besieging', 'universities', 'with', 'requests', 'for', 'access', 'to', 'data', 'or', 'for', 'partnerships', 'to', 'mine', 'them', 'the', 'privacy', 'frontier', 'facing', 'research', 'universities', 'spans', 'open', 'access', 'practices', 'uses', 'and', 'misuses', 'of', 'data', 'public', 'records', 'requests', 'cyber', 'risk', 'and', 'curating', 'data', 'for', 'privacy', 'protection', 'this', 'paper', 'explores', 'the', 'competing', 'values', 'inherent', 'in', 'data', 'stewardship', 'and', 'makes', 'recommendations', 'for', 'practice', 'drawing', 'on', 'the', 'pioneering', 'work', 'of', 'the', 'university', 'of', 'california', 'in', 'privacy', 'and', 'information', 'security', 'data', 'governance', 'and', 'cyber', 'risk']] | [-0.10828971550654387, 0.034138975234652334, -0.03628708295499499, 0.1147660860790763, -0.1777867622814873, -0.17641863202983846, 0.12886685073993118, 0.3854433704213339, -0.23744836428626773, -0.3932638362603029, 0.13596525508507643, -0.4013387523092596, -0.055207058257240406, 0.17452033641373937, -0.18025371701722698, 0.05931773595934179, 0.08048939250875264, -0.0026186398222957257, 0.049992381641849146, -0.32370648194669877, 0.3184608109056301, 0.05736482350870834, 0.41006815582971157, 0.08568271650541906, 0.008666592864236529, -0.008679186329053274, -0.12295991032130717, -0.051248363769056074, -0.08744626143759758, 0.19934774624562124, 0.46935283234883435, 0.3096386872722568, 0.4282350004505133, -0.43293756836958763, -0.11370415122863571, 0.05721189955199536, 0.07796619999654857, 0.028385317603741505, -0.06490544245941367, -0.3587108653175944, 0.014268288706911594, -0.19639640642084746, -0.09330392624022872, -0.11703916061794319, 0.009796904002931634, 0.01677521248971711, -0.24555321768067578, -0.031030583249438286, 7.154899750665728e-05, 0.1920141496333859, -0.03897940305302784, -0.11129976041515224, -0.0359388632755976, 0.2379835058153341, 0.12372318624147738, -0.027215697175311755, 0.17476177725257003, -0.194165617211963, -0.16707558588313987, 0.3888202847364092, 0.08384052403458295, -0.1278278447334742, 0.17872639936129936, -0.08045858343913485, -0.1685377754453969, 0.04098612981657165, 0.25917867233095293, -0.027481270896844632, -0.22799655731484694, 0.030840860776152113, 0.03130204101138848, 0.11608705390582534, 0.09950532580426495, 0.04030096411484659, 0.1843812383511769, 0.15893878590681457, 0.09041825729972126, 0.03674873978811125, -0.03346669108304923, -0.12479898340617572, -0.20659735892279837, -0.14511333405763643, -0.11043012442366619, -0.0006908737019070291, -0.0586333593955065, -0.13844715291426318, 0.32654047790025026, 0.2045898643729223, 0.09580142515811271, -0.005925428077067149, 0.35078324937993394, -0.045287611334580494, 0.11892530648661445, 0.15105266434589534, 0.13452472818400046, -0.03373402585670452, 0.2213711313197564, -0.08394768982127841, 0.15923695989476983, -0.11028221095849793] |
1,802.02954 | Incentive Mechanisms for Motivating Mobile Data Offloading in
Heterogeneous Networks: A Salary-Plus-Bonus Approach | In this paper, a salary-plus-bonus incentive mechanism is proposed to
motivate WiFi Access Points (APs) to provide data offloading service for mobile
network operators (MNOs). Under the proposed salary-plus-bonus scheme, WiFi APs
are rewarded not only based on offloaded data volume but also based on the
quality of their offloading service. The interactions between WiFi APs and the
MNO under this incentive mechanism are then studied using Stackelberg game. By
differentiating whether WiFi APs are of the same type (e.g. offloading cost and
quality), two cases (homogeneous and heterogeneous) are studied. For both
cases, we derive the best response functions for WiFi APs (i.e. the optimal
amount of data to offload), and show that the Nash Equilibrium (NE) always
exists for the subgame. Then, given WiFi APs' strategies, we investigate the
optimal strategy (i.e. the optimal salary and bonus) for the MNO to maximize
its utility. Then, two simple incentive mechanisms, referred to as the
salary-only scheme and the bonus-only scheme, are presented and studied using
Stackelberg game. For both of them, it is shown that the Stackelberg
Equilibrium (SE) exists and is unique. We also show that the salary-only scheme
is more effective in offloading more data, and the bonus-only scheme is more
effective in selecting premium APs (i.e. providing high-quality offloading
service at low cost), while the salary-plus-bonus scheme can strike a well
balance between the offloaded data volume and the offloading quality.
| cs.IT math.IT | in this paper a salaryplusbonus incentive mechanism is proposed to motivate wifi access points aps to provide data offloading service for mobile network operators mnos under the proposed salaryplusbonus scheme wifi aps are rewarded not only based on offloaded data volume but also based on the quality of their offloading service the interactions between wifi aps and the mno under this incentive mechanism are then studied using stackelberg game by differentiating whether wifi aps are of the same type eg offloading cost and quality two cases homogeneous and heterogeneous are studied for both cases we derive the best response functions for wifi aps ie the optimal amount of data to offload and show that the nash equilibrium ne always exists for the subgame then given wifi aps strategies we investigate the optimal strategy ie the optimal salary and bonus for the mno to maximize its utility then two simple incentive mechanisms referred to as the salaryonly scheme and the bonusonly scheme are presented and studied using stackelberg game for both of them it is shown that the stackelberg equilibrium se exists and is unique we also show that the salaryonly scheme is more effective in offloading more data and the bonusonly scheme is more effective in selecting premium aps ie providing highquality offloading service at low cost while the salaryplusbonus scheme can strike a well balance between the offloaded data volume and the offloading quality | [['in', 'this', 'paper', 'a', 'salaryplusbonus', 'incentive', 'mechanism', 'is', 'proposed', 'to', 'motivate', 'wifi', 'access', 'points', 'aps', 'to', 'provide', 'data', 'offloading', 'service', 'for', 'mobile', 'network', 'operators', 'mnos', 'under', 'the', 'proposed', 'salaryplusbonus', 'scheme', 'wifi', 'aps', 'are', 'rewarded', 'not', 'only', 'based', 'on', 'offloaded', 'data', 'volume', 'but', 'also', 'based', 'on', 'the', 'quality', 'of', 'their', 'offloading', 'service', 'the', 'interactions', 'between', 'wifi', 'aps', 'and', 'the', 'mno', 'under', 'this', 'incentive', 'mechanism', 'are', 'then', 'studied', 'using', 'stackelberg', 'game', 'by', 'differentiating', 'whether', 'wifi', 'aps', 'are', 'of', 'the', 'same', 'type', 'eg', 'offloading', 'cost', 'and', 'quality', 'two', 'cases', 'homogeneous', 'and', 'heterogeneous', 'are', 'studied', 'for', 'both', 'cases', 'we', 'derive', 'the', 'best', 'response', 'functions', 'for', 'wifi', 'aps', 'ie', 'the', 'optimal', 'amount', 'of', 'data', 'to', 'offload', 'and', 'show', 'that', 'the', 'nash', 'equilibrium', 'ne', 'always', 'exists', 'for', 'the', 'subgame', 'then', 'given', 'wifi', 'aps', 'strategies', 'we', 'investigate', 'the', 'optimal', 'strategy', 'ie', 'the', 'optimal', 'salary', 'and', 'bonus', 'for', 'the', 'mno', 'to', 'maximize', 'its', 'utility', 'then', 'two', 'simple', 'incentive', 'mechanisms', 'referred', 'to', 'as', 'the', 'salaryonly', 'scheme', 'and', 'the', 'bonusonly', 'scheme', 'are', 'presented', 'and', 'studied', 'using', 'stackelberg', 'game', 'for', 'both', 'of', 'them', 'it', 'is', 'shown', 'that', 'the', 'stackelberg', 'equilibrium', 'se', 'exists', 'and', 'is', 'unique', 'we', 'also', 'show', 'that', 'the', 'salaryonly', 'scheme', 'is', 'more', 'effective', 'in', 'offloading', 'more', 'data', 'and', 'the', 'bonusonly', 'scheme', 'is', 'more', 'effective', 'in', 'selecting', 'premium', 'aps', 'ie', 'providing', 'highquality', 'offloading', 'service', 'at', 'low', 'cost', 'while', 'the', 'salaryplusbonus', 'scheme', 'can', 'strike', 'a', 'well', 'balance', 'between', 'the', 'offloaded', 'data', 'volume', 'and', 'the', 'offloading', 'quality']] | [-0.18001971730911495, -0.023720465804091394, -0.06581919079014499, 0.08347524746040938, -0.07075597280313894, -0.24080929967869089, 0.2037090342789203, 0.4433811285424155, -0.2847218536217475, -0.28911436047985567, 0.08238803200122348, -0.2896545220890135, -0.16349518901035512, 0.1171081846315833, -0.10961997064155046, 0.030252677039495263, 0.026969443871619512, 0.033949740685737244, 0.02846832468186493, -0.3002862198383132, 0.3048417593455305, 0.09802761734805969, 0.40559347210859165, 0.07392528460379207, 0.06532966992283619, -0.014627273323506246, -0.015917961810739685, -0.012174257457658101, -0.0909993757481636, 0.0990763301033833, 0.3169332219527639, 0.18128693114675873, 0.31458897649983825, -0.4451549818166794, -0.15458903484675404, 0.11207377339523786, 0.11458749162330287, 0.0028837962293779694, -0.07006865608634667, -0.22897647083353945, 0.16226537695388385, -0.22351541687045004, -0.02732653729315218, -0.06207006385356381, -0.05214558815527143, 0.066611145546174, -0.3722214840404947, -0.029058556710934325, -0.07214400169360996, 0.03354704883594663, -0.07945909945534146, -0.09223560125716192, -0.06073336891963014, 0.19578316890396727, 0.035447176560977255, -0.038489432124525824, 0.11196328690517451, -0.11810734101825139, -0.1341714635667758, 0.437759345869062, 0.013251832165267496, -0.19989872379057125, 0.16141612164361716, -0.036582198048925665, -0.06868804100592464, 0.0986181046497238, 0.17539272829487082, 0.09323595340154033, -0.2018260971544254, 0.026750477384276956, -0.040856252355880036, 0.11999748538558681, 0.080081137290297, 0.06546670882052992, 0.14286086999395967, 0.19528097975207895, 0.19271245317279614, 0.08257810648574063, -0.03692229533100851, -0.12910862631079825, -0.23182332006512912, -0.13100071452826148, -0.18814892928091834, -0.006173626127593861, -0.07769442899709515, -0.07822191513693302, 0.3397024528688695, 0.1176459275587216, 0.10495671720618939, 0.09726626752549178, 0.3611902672005213, 0.0913409975703072, 0.016819491970112944, 0.16957645494192516, 0.18972758600060946, -0.03878969116488198, 0.18657512958484068, -0.22270202557495855, 0.09245866872934681, 0.030569921695179754] |
1,802.02955 | Ultraviolet phenomena in AdS self-interacting quantum field theory | We study the one-loop corrections to the four-point function in the Anti de
Sitter space-time for a $\phi^4$ field theory. Our calculation shows the
existence of non-local counterterms which however respect the AdS isometry. Our
arguments are quite general and applicable to other (non-conformal) AdS field
theories. We also explain why calculations in Euclidean and Lorentzian
signatures should differ even at the leading order in non globaly hyperbolic
manifolds.
| hep-th | we study the oneloop corrections to the fourpoint function in the anti de sitter spacetime for a phi4 field theory our calculation shows the existence of nonlocal counterterms which however respect the ads isometry our arguments are quite general and applicable to other nonconformal ads field theories we also explain why calculations in euclidean and lorentzian signatures should differ even at the leading order in non globaly hyperbolic manifolds | [['we', 'study', 'the', 'oneloop', 'corrections', 'to', 'the', 'fourpoint', 'function', 'in', 'the', 'anti', 'de', 'sitter', 'spacetime', 'for', 'a', 'phi4', 'field', 'theory', 'our', 'calculation', 'shows', 'the', 'existence', 'of', 'nonlocal', 'counterterms', 'which', 'however', 'respect', 'the', 'ads', 'isometry', 'our', 'arguments', 'are', 'quite', 'general', 'and', 'applicable', 'to', 'other', 'nonconformal', 'ads', 'field', 'theories', 'we', 'also', 'explain', 'why', 'calculations', 'in', 'euclidean', 'and', 'lorentzian', 'signatures', 'should', 'differ', 'even', 'at', 'the', 'leading', 'order', 'in', 'non', 'globaly', 'hyperbolic', 'manifolds']] | [-0.14233305635254667, 0.12931003026407806, -0.13317106354414768, 0.1926235995201421, -0.10862994987679564, -0.15794708033807683, -0.0602546652485414, 0.32131591657905473, -0.10614491906017065, -0.21783412628270604, 0.07826535777101104, -0.33126175152542797, -0.19126213857215707, 0.12607899279522616, -0.0522270786198045, 0.007961675133286179, -0.03880723055614078, 0.05030402932586013, -0.12582604467288416, -0.2525029919123736, 0.3922653744415637, 0.039498613571134, 0.273224135428883, 0.07041618585640537, 0.020936960907841938, 0.0025520039236415987, -0.03183822474185971, 0.06740298842255404, -0.15701609374820322, 0.05043923930244763, 0.28342701316527696, 0.009390490723476894, 0.1246980466319761, -0.4172717579033064, -0.22867550012871515, 0.09452557608323253, 0.16555649710927103, 0.18027111157552217, -0.025256560885927815, -0.2820919927992467, 0.057760622271377106, -0.13100057589295117, -0.21365909939766795, -0.1415441756717105, -0.02554669273018405, -0.13941250606338776, -0.21784870385907698, 0.09227747931710337, 0.020608258136696575, 0.011188204524143552, -0.08300328758491231, -0.03882638426949742, -0.04458158080587569, 0.07466297176248138, 0.13915284297199568, 0.07342560422957699, 0.12374006309614018, -0.11548439252689696, -0.1492739367717202, 0.37088458002477454, -0.11113891042064558, -0.2507403391426888, 0.17953624400863613, -0.22786335136903368, -0.16539442639770932, 0.0955968571614231, 0.114674434946526, 0.2048868959545212, -0.09273197366248655, 0.2292302923152169, 0.036334435671459935, 0.1156431007725389, 0.12883330917363797, 0.05112092605660386, 0.19275638646027748, 0.014346010821021122, 0.018231202193630346, 0.1065658201080531, 0.06048761675323265, -0.16999860010717227, -0.43251034613374784, -0.1449306029016557, -0.09198035247475449, 0.08494513800732144, -0.18975700757194622, -0.2423829400399025, 0.34300663484179456, 0.13675958092283944, 0.11423417188875053, 0.0931326745742716, 0.21329220185272288, 0.0898858497832038, 0.08667627761167461, 0.07585184501173596, 0.2901664224412778, 0.13694032261728484, 0.11266711652548848, -0.24413997988027614, -0.10029173908464989, 0.1359670750553841] |
1,802.02956 | A Molecular Dynamics Study of Self-Diffusion in Stoichiometric B2-NiAl
crystals | Self-diffusion parameters in stoichiometric B2-NiAl solid state crystals were
estimated by molecular statics/dynamics simulations with the study of required
simulation time to stabilise diffusivity results. An extrapolation procedure to
improve the diffusion simulation results was proposed. Calculations of volume
diffusivity for the B2 type NiAl in the 1224 K to 1699 K temperature range were
performed using the embedded atom model potential. The results obtained here
are in much better agreement with the experimental results than the theoretical
estimates obtained with other methods.
| cond-mat.mtrl-sci cond-mat.stat-mech | selfdiffusion parameters in stoichiometric b2nial solid state crystals were estimated by molecular staticsdynamics simulations with the study of required simulation time to stabilise diffusivity results an extrapolation procedure to improve the diffusion simulation results was proposed calculations of volume diffusivity for the b2 type nial in the 1224 k to 1699 k temperature range were performed using the embedded atom model potential the results obtained here are in much better agreement with the experimental results than the theoretical estimates obtained with other methods | [['selfdiffusion', 'parameters', 'in', 'stoichiometric', 'b2nial', 'solid', 'state', 'crystals', 'were', 'estimated', 'by', 'molecular', 'staticsdynamics', 'simulations', 'with', 'the', 'study', 'of', 'required', 'simulation', 'time', 'to', 'stabilise', 'diffusivity', 'results', 'an', 'extrapolation', 'procedure', 'to', 'improve', 'the', 'diffusion', 'simulation', 'results', 'was', 'proposed', 'calculations', 'of', 'volume', 'diffusivity', 'for', 'the', 'b2', 'type', 'nial', 'in', 'the', '1224', 'k', 'to', '1699', 'k', 'temperature', 'range', 'were', 'performed', 'using', 'the', 'embedded', 'atom', 'model', 'potential', 'the', 'results', 'obtained', 'here', 'are', 'in', 'much', 'better', 'agreement', 'with', 'the', 'experimental', 'results', 'than', 'the', 'theoretical', 'estimates', 'obtained', 'with', 'other', 'methods']] | [-0.03843074055706582, 0.10870642656415684, -0.042706145995818984, -0.021644072416919943, 0.008624649339741686, -0.10646650196257525, 0.0570653314111618, 0.41493057586797855, -0.18548709110970177, -0.35604810094597134, 0.06011582076231518, -0.3052712784307759, -0.04988121389831621, 0.24353277750054897, 0.043471596822733195, 0.09764141795543455, 0.08808863128069788, 0.00509380058544438, -0.0902356448691202, -0.2592754610757366, 0.1876789894403617, 0.12083978793106792, 0.26300788532783526, 0.03154209495817379, -0.001714596468046671, -0.08387087107204445, -0.00625038819058185, 0.05608058952521987, -0.2581249796842202, 0.08472229193089666, 0.22778339875101045, -0.01770233867190233, 0.1859560700576389, -0.45091841478900213, -0.2755851824654312, 0.026042228030813176, 0.11849313839793024, 0.10454522964839892, -0.06939693265480966, -0.26711982810619944, 0.09823329107290725, -0.10943531296102375, -0.15392897168185743, -0.11267049920393109, -0.037658498298785675, 0.020531399960618285, -0.3007971360688893, 0.1304036201114153, -0.03727418871130794, 0.07901207078452344, -0.16330820873163912, -0.22372690680800233, -0.03916163671557314, 0.08961014705284204, 0.02464780174962404, 0.06010911774128766, 0.16888836916626954, -0.06851876784320467, -0.11002408570564556, 0.36800312836904353, -0.08441252672065919, -0.15518178405217464, 0.2050215544678816, -0.16967575383804193, -0.08683361634952812, 0.1845316702908859, 0.10287634324475486, 0.11219951413038028, -0.13219424232658816, 0.013228828950626095, -0.04063885721659129, 0.21131801064603212, 0.009544683523794137, -0.045165389771349644, 0.06817732577456342, 0.19697042182087898, -0.05328073971564087, 0.10292863663535838, -0.1142974423539893, -0.12126723517913644, -0.22166976039638606, -0.1372385565986539, -0.19413460833134083, 0.006375775556080043, -0.12031578456574096, -0.08094281841334944, 0.29947962912322, 0.17359307541216656, 0.17293928850941906, 0.05240295982419899, 0.26493167057746975, 0.07995453155202019, 0.04041220010087893, 0.03527976680410708, 0.2600940878207727, 0.17390500527817937, 0.12688981368002006, -0.2716720597591342, 0.08660381049962669, 0.05126796376596137] |
1,802.02957 | A simple descriptor for energetics at fcc-bcc metal interfaces | We have developed a new and user-friendly interface energy calculation method
that avoids problems deriving from numerical differences between bulk and slab
calculations, such as the number of k points along the direction perpendicular
to the interface. We have applied this to 36 bcc-fcc metal interfaces in the
(100) orientation and found a clear dependence of the interface energy on the
difference between the work functions of the two metals, on the one hand, and
the total number of d electrons on the other. Greater mechanical deformations
were observed in fcc crystals than in their bcc counterparts. For each bcc
metal, the interface energy was found to follow the position of its d band,
whereas the same was not observed for fcc.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.chem-ph physics.comp-ph | we have developed a new and userfriendly interface energy calculation method that avoids problems deriving from numerical differences between bulk and slab calculations such as the number of k points along the direction perpendicular to the interface we have applied this to 36 bccfcc metal interfaces in the 100 orientation and found a clear dependence of the interface energy on the difference between the work functions of the two metals on the one hand and the total number of d electrons on the other greater mechanical deformations were observed in fcc crystals than in their bcc counterparts for each bcc metal the interface energy was found to follow the position of its d band whereas the same was not observed for fcc | [['we', 'have', 'developed', 'a', 'new', 'and', 'userfriendly', 'interface', 'energy', 'calculation', 'method', 'that', 'avoids', 'problems', 'deriving', 'from', 'numerical', 'differences', 'between', 'bulk', 'and', 'slab', 'calculations', 'such', 'as', 'the', 'number', 'of', 'k', 'points', 'along', 'the', 'direction', 'perpendicular', 'to', 'the', 'interface', 'we', 'have', 'applied', 'this', 'to', '36', 'bccfcc', 'metal', 'interfaces', 'in', 'the', '100', 'orientation', 'and', 'found', 'a', 'clear', 'dependence', 'of', 'the', 'interface', 'energy', 'on', 'the', 'difference', 'between', 'the', 'work', 'functions', 'of', 'the', 'two', 'metals', 'on', 'the', 'one', 'hand', 'and', 'the', 'total', 'number', 'of', 'd', 'electrons', 'on', 'the', 'other', 'greater', 'mechanical', 'deformations', 'were', 'observed', 'in', 'fcc', 'crystals', 'than', 'in', 'their', 'bcc', 'counterparts', 'for', 'each', 'bcc', 'metal', 'the', 'interface', 'energy', 'was', 'found', 'to', 'follow', 'the', 'position', 'of', 'its', 'd', 'band', 'whereas', 'the', 'same', 'was', 'not', 'observed', 'for', 'fcc']] | [-0.11499680996658738, 0.10190650469577703, -0.05462257915222254, 0.038191181537886074, -0.043379934634402637, -0.13264725183243634, 0.06504157114178553, 0.42191230298065746, -0.24108442813554037, -0.3508620814679832, 0.027140677525837462, -0.3351311835414562, -0.082710843130595, 0.184414833377604, 0.05983313407031361, 0.01351702941121671, -0.006000319927106383, 0.0001980715553413649, -0.12333147884461051, -0.19245579140642505, 0.2698017720468953, 0.047138078161133606, 0.3085884904340062, 0.08596039905315876, 0.04063827642735827, 0.012331468326070148, 0.024614056747895283, 0.03797447940975916, -0.15496103760060428, 0.10351632795006525, 0.21001454575758305, -0.03262640140019357, 0.21187186683909814, -0.4528412777533541, -0.176366281985748, 0.050486259570833844, 0.10159762669163833, 0.11143059932748925, -0.06213523216877652, -0.20174127814482104, 0.09114280017856204, -0.09966891969374732, -0.11465659052740447, 0.018281655008217594, 0.022027661789162847, 0.018748541408386388, -0.18359055378107872, 0.07170811354671223, 0.0249195845137335, 0.09280639141935189, -0.09710369843581203, -0.17057062392352057, -0.12228515932763942, 0.08668564934833128, 0.05443359204171012, 0.04558514710324893, 0.13153277638322505, -0.071060266633915, -0.08385288997812838, 0.41837802646132033, -0.027583820403378922, -0.15494283486814162, 0.2451044817676493, -0.17463598472875405, -0.06314435958877572, 0.16101155570349426, 0.17253040414509654, 0.09108454660039211, -0.11826168415594662, 0.059548028773383894, 0.0007462825351318375, 0.15648700879718802, 0.08483893673897522, -0.0024375057221985743, 0.18460958372404584, 0.11947519152013004, 0.035803502826325474, 0.12694957357741601, -0.12720336036596325, -0.0515021554148588, -0.2558181248910603, -0.2225368485373796, -0.2123359805965399, -0.03332294691838305, -0.0913860688790427, -0.18218424997567276, 0.38845065136852325, 0.11231106557868055, 0.19284389745902086, -0.014909183679026414, 0.23791150464752658, 0.0863636024744769, 0.07619843919585902, 0.08372263359974642, 0.27861586768088525, 0.1303694768595036, 0.1300709267856828, -0.22662972067062911, 0.10197779449794564, 0.02887912398036264] |
1,802.02958 | Deligne's conjecture for automorphic motives over CM-fields | The present paper is devoted to the relations between Deligne's conjecture on
critical values of motivic $L$-functions and the multiplicative relations
between periods of arithmetically normalized automorphic forms on unitary
groups. In the first place, we combine the Ichino--Ikeda--Neal-Harris (IINH)
formula -- which is now a theorem -- with an analysis of cup products of
coherent cohomological automorphic forms on Shimura varieties to establish
relations between certain automorphic periods and critical values of
Rankin-Selberg and Asai $L$-functions of ${\rm GL}(n)\times{\rm GL}(m)$ over CM
fields. By reinterpreting these critical values in terms of automorphic periods
of holomorphic automorphic forms on unitary groups, we show that the
automorphic periods of holomorphic forms can be factored as products of
coherent cohomological forms, compatibly with a motivic factorization predicted
by the Tate conjecture. All of these results are conditional on a conjecture on
non-vanishing of twists of automorphic $L$-functions of ${\rm GL}(n)$ by
anticyclotomic characters of finite order, and are stated under a certain
regularity condition.
| math.NT | the present paper is devoted to the relations between delignes conjecture on critical values of motivic lfunctions and the multiplicative relations between periods of arithmetically normalized automorphic forms on unitary groups in the first place we combine the ichinoikedanealharris iinh formula which is now a theorem with an analysis of cup products of coherent cohomological automorphic forms on shimura varieties to establish relations between certain automorphic periods and critical values of rankinselberg and asai lfunctions of rm glntimesrm glm over cm fields by reinterpreting these critical values in terms of automorphic periods of holomorphic automorphic forms on unitary groups we show that the automorphic periods of holomorphic forms can be factored as products of coherent cohomological forms compatibly with a motivic factorization predicted by the tate conjecture all of these results are conditional on a conjecture on nonvanishing of twists of automorphic lfunctions of rm gln by anticyclotomic characters of finite order and are stated under a certain regularity condition | [['the', 'present', 'paper', 'is', 'devoted', 'to', 'the', 'relations', 'between', 'delignes', 'conjecture', 'on', 'critical', 'values', 'of', 'motivic', 'lfunctions', 'and', 'the', 'multiplicative', 'relations', 'between', 'periods', 'of', 'arithmetically', 'normalized', 'automorphic', 'forms', 'on', 'unitary', 'groups', 'in', 'the', 'first', 'place', 'we', 'combine', 'the', 'ichinoikedanealharris', 'iinh', 'formula', 'which', 'is', 'now', 'a', 'theorem', 'with', 'an', 'analysis', 'of', 'cup', 'products', 'of', 'coherent', 'cohomological', 'automorphic', 'forms', 'on', 'shimura', 'varieties', 'to', 'establish', 'relations', 'between', 'certain', 'automorphic', 'periods', 'and', 'critical', 'values', 'of', 'rankinselberg', 'and', 'asai', 'lfunctions', 'of', 'rm', 'glntimesrm', 'glm', 'over', 'cm', 'fields', 'by', 'reinterpreting', 'these', 'critical', 'values', 'in', 'terms', 'of', 'automorphic', 'periods', 'of', 'holomorphic', 'automorphic', 'forms', 'on', 'unitary', 'groups', 'we', 'show', 'that', 'the', 'automorphic', 'periods', 'of', 'holomorphic', 'forms', 'can', 'be', 'factored', 'as', 'products', 'of', 'coherent', 'cohomological', 'forms', 'compatibly', 'with', 'a', 'motivic', 'factorization', 'predicted', 'by', 'the', 'tate', 'conjecture', 'all', 'of', 'these', 'results', 'are', 'conditional', 'on', 'a', 'conjecture', 'on', 'nonvanishing', 'of', 'twists', 'of', 'automorphic', 'lfunctions', 'of', 'rm', 'gln', 'by', 'anticyclotomic', 'characters', 'of', 'finite', 'order', 'and', 'are', 'stated', 'under', 'a', 'certain', 'regularity', 'condition']] | [-0.271783854098603, 0.0912778447997385, -0.18923462791769188, 0.10568511466749154, -0.07847860206472629, -0.07362022099992897, 0.007976449724681723, 0.26306706609180835, -0.2744475896175526, -0.21390012958782573, 0.09079343643587648, -0.19994477020455761, -0.14290790678122775, 0.30389183303311795, -0.12142894906286575, 0.05452147128656904, 0.018108209879491244, 0.1273916421776425, -0.14406364087952608, -0.3475722844087625, 0.47489799279130146, -0.05679085239461517, 0.2192581150867929, 0.03926520863116153, 0.08475416735303883, 0.014114636636067983, 0.001279537542428397, -0.1950154021924621, -0.11793930415540994, 0.19896402654438455, 0.3766382408499293, -0.0015772182562188068, 0.19617879774592392, -0.4200812374253439, -0.07780193267950104, 0.2139090586371154, 0.07768651683368319, -0.05345396027322623, 0.07129014780173148, -0.3046574693739037, 0.11389913471250594, -0.19816505560604267, -0.13772605283221206, -0.12784243917352037, 0.05930209687109329, 0.04295665987684757, -0.25607469991509674, 0.0504370557285751, 0.07650152131505429, 0.22767614910992073, -0.16523804507053258, -0.1633460578387839, -0.025979612886174758, 0.08674345966693768, 0.08773643683488894, 0.0060361699109802705, 0.09332905016261848, -0.12977538021764706, -0.12281131041766721, 0.30549830540165873, -0.06941063694812098, -0.13885483384438896, 0.06353348346362245, -0.19616153641438844, -0.21932773764209845, 0.10017467441060875, 0.08920650464140728, 0.12589955168976624, 0.016240711206027977, 0.15259782292237623, -0.15883137303392722, 0.05280885226505844, 0.17496878074340616, -0.057581879303177604, 0.19434755434918724, -0.016788151233067997, 0.03255129804911351, 0.11018194026487609, 0.01433311036310477, -0.047920936267657935, -0.364773812185077, -0.19473384452697856, -0.06231911998032887, 0.15321966754405206, -0.12450309321203246, -0.1499989332772697, 0.39615903693970433, 0.06725647328185695, 0.19558933403201495, 0.2225635707315022, 0.1743961794947862, 0.1352878647872624, 0.11017378064644628, 0.022378039284008024, 0.11124752677241753, 0.3091202586744853, -0.03969823272937107, -0.09863562147203786, -0.001932957124177225, 0.2200928763501181] |
1,802.02959 | The geometry of E-manifolds | Motivated by the study of symplectic Lie algebroids, we study a describe a
type of algebroid (called an $E$-tangent bundle) which is particularly
well-suited to study of singular differential forms and their cohomology. This
setting generalizes the study of $b$-symplectic manifolds, foliated manifolds,
and a wide class of Poisson manifolds. We generalize Moser's theorem to this
setting, and use it to construct symplectomorphisms between singular symplectic
forms. We give applications of this machinery (including the study of Poisson
cohomology), and study specific examples of a few of them in depth.
| math.SG | motivated by the study of symplectic lie algebroids we study a describe a type of algebroid called an etangent bundle which is particularly wellsuited to study of singular differential forms and their cohomology this setting generalizes the study of bsymplectic manifolds foliated manifolds and a wide class of poisson manifolds we generalize mosers theorem to this setting and use it to construct symplectomorphisms between singular symplectic forms we give applications of this machinery including the study of poisson cohomology and study specific examples of a few of them in depth | [['motivated', 'by', 'the', 'study', 'of', 'symplectic', 'lie', 'algebroids', 'we', 'study', 'a', 'describe', 'a', 'type', 'of', 'algebroid', 'called', 'an', 'etangent', 'bundle', 'which', 'is', 'particularly', 'wellsuited', 'to', 'study', 'of', 'singular', 'differential', 'forms', 'and', 'their', 'cohomology', 'this', 'setting', 'generalizes', 'the', 'study', 'of', 'bsymplectic', 'manifolds', 'foliated', 'manifolds', 'and', 'a', 'wide', 'class', 'of', 'poisson', 'manifolds', 'we', 'generalize', 'mosers', 'theorem', 'to', 'this', 'setting', 'and', 'use', 'it', 'to', 'construct', 'symplectomorphisms', 'between', 'singular', 'symplectic', 'forms', 'we', 'give', 'applications', 'of', 'this', 'machinery', 'including', 'the', 'study', 'of', 'poisson', 'cohomology', 'and', 'study', 'specific', 'examples', 'of', 'a', 'few', 'of', 'them', 'in', 'depth']] | [-0.19546542146107118, -0.024992202077514826, -0.06913152272195629, 0.1187532816286293, -0.15668660686926894, -0.13060550760017353, -0.021166339422461024, 0.32242361778456174, -0.328461521310376, -0.2385958923508277, 0.10342896215518246, -0.19148706549025152, -0.26046203220200337, 0.2143767975333534, -0.20482350433810373, -0.031460728370741514, 0.07442242814374439, 0.05413150356224414, -0.1308856529466222, -0.2311886648851541, 0.5180301638634017, 0.01591257716455821, 0.19925583392679902, 0.04733842467690368, 0.14377682668083672, 0.002770796910012036, -0.05810519642709346, -0.031698505608678866, -0.19878507564576825, 0.18565596544100077, 0.3225354996792386, 0.009174932840834843, 0.22193147016040396, -0.3649272078417995, -0.1640610282644211, 0.18349775785496564, 0.07758781728805618, 0.043110193154942036, -0.01023793944649482, -0.308945004713167, 0.09104103903715195, -0.16267626418135642, -0.2006804142304267, -0.16205087400386842, -0.0026314985504101835, 0.03454073648795151, -0.17354642963455466, -0.016936570395495783, 0.14093294087274189, 0.12333419618688607, -0.07858291398105996, -0.04222266597600047, -0.016951168562923925, 0.05216277330025528, 0.0003685250308029772, -0.011187741827230188, 0.1360879502196409, -0.05531742297416407, -0.14049951350211762, 0.37453998493951524, -0.038041491720699865, -0.24779528753015767, 0.13215467346350798, -0.11546429846791571, -0.24286728404629765, 0.09366568293045746, 0.1683652259702428, 0.2299440772157539, -0.10220930692896749, 0.16005639859286838, -0.09274546880526154, -0.021567289319852096, 0.10310786530072016, -0.03201364010070147, 0.10818019633840643, 0.16447661710337977, 0.1085924601831128, 0.15469400945389014, -0.011969959795320657, -0.13101962328040867, -0.3296845367366678, -0.24901065995048188, -0.0710642475378438, 0.16620316058188006, -0.0789587181682824, -0.20375164692405234, 0.41230084161075314, 0.08975682304298971, 0.24886759011639972, 0.13772982157102337, 0.2065714715477707, 0.06497063386264477, 0.035571449266202496, 0.025054172335422776, 0.13055768459407466, 0.2938098193413128, 0.04819197573939736, -0.08697233069034063, -0.1183594389546537, 0.15636070535172908] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.