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.0226 | Second order backward SDE with random terminal time | Backward stochastic differential equations extend the martingale
representation theorem to the nonlinear setting. This can be seen as
path-dependent counterpart of the extension from the heat equation to fully
nonlinear parabolic equations in the Markov setting. This paper extends such a
nonlinear representation to the context where the random variable of interest
is measurable with respect to the information at a finite stopping time. We
provide a complete wellposedness theory which covers the semilinear case
(backward SDE), the semilinear case with obstacle (reflected backward SDE), and
the fully nonlinear case (second order backward SDE).
| math.PR math.OC | backward stochastic differential equations extend the martingale representation theorem to the nonlinear setting this can be seen as pathdependent counterpart of the extension from the heat equation to fully nonlinear parabolic equations in the markov setting this paper extends such a nonlinear representation to the context where the random variable of interest is measurable with respect to the information at a finite stopping time we provide a complete wellposedness theory which covers the semilinear case backward sde the semilinear case with obstacle reflected backward sde and the fully nonlinear case second order backward sde | [['backward', 'stochastic', 'differential', 'equations', 'extend', 'the', 'martingale', 'representation', 'theorem', 'to', 'the', 'nonlinear', 'setting', 'this', 'can', 'be', 'seen', 'as', 'pathdependent', 'counterpart', 'of', 'the', 'extension', 'from', 'the', 'heat', 'equation', 'to', 'fully', 'nonlinear', 'parabolic', 'equations', 'in', 'the', 'markov', 'setting', 'this', 'paper', 'extends', 'such', 'a', 'nonlinear', 'representation', 'to', 'the', 'context', 'where', 'the', 'random', 'variable', 'of', 'interest', 'is', 'measurable', 'with', 'respect', 'to', 'the', 'information', 'at', 'a', 'finite', 'stopping', 'time', 'we', 'provide', 'a', 'complete', 'wellposedness', 'theory', 'which', 'covers', 'the', 'semilinear', 'case', 'backward', 'sde', 'the', 'semilinear', 'case', 'with', 'obstacle', 'reflected', 'backward', 'sde', 'and', 'the', 'fully', 'nonlinear', 'case', 'second', 'order', 'backward', 'sde']] | [-0.08305963849589387, 0.032496418130207566, -0.08029332656433132, 0.08083424798802454, -0.18456754596170752, -0.11422784565551643, -0.011398619927584808, 0.2950844038773249, -0.4094528760364715, -0.16865604674812665, 0.1538155934404324, -0.31130751404673496, -0.1209759269345631, 0.17968814795281976, -0.09676831133633931, 0.12513688105614262, 0.05026631458523743, 0.020487789369616757, -0.04024773135662396, -0.19848265494108497, 0.33179397386637455, -0.05113925794733966, 0.20154243729453772, -0.04539044062666436, 0.2050316873343384, 0.047812331348974654, -0.04643377071206874, 0.003533144293234069, -0.11152932546695972, 0.07959157916063324, 0.33386045762714234, -0.011993102669874404, 0.34491236943056797, -0.399612748720485, -0.2472484343526687, 0.1308476572578892, 0.10146997174454922, 0.14660734103056305, -0.019714399468787808, -0.3328919194049222, 0.04596670927539309, -0.13225083255228845, -0.18400684288366043, -0.010446276218491667, -0.041016949360516475, 0.0579426642309161, -0.3078938120619414, 0.11272177255113035, 0.14339067343067616, 0.005642518907676431, -0.062871041692833, -0.01323127905600407, -0.021026215496215413, 0.012917602400077468, 0.04275413725693571, 0.02040679633810601, 0.02348016595784971, -0.08433783092496401, -0.14247378647485945, 0.3330547812969444, -0.16893836205324872, -0.3176858011593527, 0.1369649589190537, -0.19934191742040058, -0.10800996750216693, 0.17148325318827273, 0.21387697578942838, 0.20178798756542357, -0.21510888572703016, 0.1364548704382577, -0.058331360059611974, 0.13665840247685604, 0.04949941267160342, -0.0019303695397808196, 0.04372040489490362, 0.2057233815319202, 0.1713195030101912, 0.13585918260356808, 0.009260829706537597, -0.19433463015593588, -0.39929372217615156, -0.1506818450610847, -0.06452736173300667, 0.10575106157921255, -0.09781776376033297, -0.16670168583538938, 0.3430490395192929, 0.1637521190370651, 0.1364029465253128, 0.12564720889241335, 0.2441261587664485, 0.3148121740953858, -0.05827394067408874, 0.07833976498055718, 0.16229620937040037, 0.23244758096630092, 0.22322094964329153, -0.2121741842887825, 0.09038778009051655, 0.15446673506781697] |
1,802.02261 | Dynamic regulation of resource transport induces criticality in
interdependent networks of excitable units | Various functions of a network of excitable units can be enhanced if the
network is in the `critical regime', where excitations are, on average, neither
damped nor amplified. An important question is how can such networks
self-organize to operate in the critical regime. Previously it was shown that
regulation via resource transport on a secondary network can robustly maintain
the primary network dynamics in a balanced state where activity doesn't grow or
decay. Here we show that this inter-network regulation process robustly
produces a power-law distribution of activity avalanches, as observed in
experiments, over ranges of model parameters spanning orders of magnitude. We
also show that the resource transport over the secondary network protects the
system against the destabilizing effect of local variations in parameters and
heterogeneity in network structure. For homogeneous networks, we derive a
reduced 3-dimensional map which reproduces the behavior of the full system.
| cond-mat.dis-nn nlin.AO physics.soc-ph | various functions of a network of excitable units can be enhanced if the network is in the critical regime where excitations are on average neither damped nor amplified an important question is how can such networks selforganize to operate in the critical regime previously it was shown that regulation via resource transport on a secondary network can robustly maintain the primary network dynamics in a balanced state where activity doesnt grow or decay here we show that this internetwork regulation process robustly produces a powerlaw distribution of activity avalanches as observed in experiments over ranges of model parameters spanning orders of magnitude we also show that the resource transport over the secondary network protects the system against the destabilizing effect of local variations in parameters and heterogeneity in network structure for homogeneous networks we derive a reduced 3dimensional map which reproduces the behavior of the full system | [['various', 'functions', 'of', 'a', 'network', 'of', 'excitable', 'units', 'can', 'be', 'enhanced', 'if', 'the', 'network', 'is', 'in', 'the', 'critical', 'regime', 'where', 'excitations', 'are', 'on', 'average', 'neither', 'damped', 'nor', 'amplified', 'an', 'important', 'question', 'is', 'how', 'can', 'such', 'networks', 'selforganize', 'to', 'operate', 'in', 'the', 'critical', 'regime', 'previously', 'it', 'was', 'shown', 'that', 'regulation', 'via', 'resource', 'transport', 'on', 'a', 'secondary', 'network', 'can', 'robustly', 'maintain', 'the', 'primary', 'network', 'dynamics', 'in', 'a', 'balanced', 'state', 'where', 'activity', 'doesnt', 'grow', 'or', 'decay', 'here', 'we', 'show', 'that', 'this', 'internetwork', 'regulation', 'process', 'robustly', 'produces', 'a', 'powerlaw', 'distribution', 'of', 'activity', 'avalanches', 'as', 'observed', 'in', 'experiments', 'over', 'ranges', 'of', 'model', 'parameters', 'spanning', 'orders', 'of', 'magnitude', 'we', 'also', 'show', 'that', 'the', 'resource', 'transport', 'over', 'the', 'secondary', 'network', 'protects', 'the', 'system', 'against', 'the', 'destabilizing', 'effect', 'of', 'local', 'variations', 'in', 'parameters', 'and', 'heterogeneity', 'in', 'network', 'structure', 'for', 'homogeneous', 'networks', 'we', 'derive', 'a', 'reduced', '3dimensional', 'map', 'which', 'reproduces', 'the', 'behavior', 'of', 'the', 'full', 'system']] | [-0.17079657412428714, 0.14437079101852, -0.04960172419075151, 0.058843594373560286, -0.009113635859914681, -0.12094960194777976, 0.03695983238847685, 0.3739237051051693, -0.30725311625235696, -0.29476698532345746, 0.0777491228971757, -0.2470023974991676, -0.22579706322598164, 0.17877074018862021, -0.037073593409288494, 0.0034883134003703287, 0.04295820754249485, 0.04372894955913023, 0.011490522777712365, -0.21139858509603965, 0.3069163030900416, 0.08790135558783299, 0.32619163033799553, 0.02500781092692173, 0.08922206472009928, -0.04476623183914593, 0.03664155124502928, 0.05077711190730587, -0.08849790880410437, 0.05371113734788635, 0.21485404470035818, 0.10609775274710058, 0.24373579649476423, -0.45647894221098245, -0.2950051248795828, 0.1308148945998527, 0.20868060043949607, 0.09409970096011526, 0.02366650191319435, -0.23067462122143836, 0.10549802685213484, -0.17947103273833082, -0.07523186964641775, -0.07863182378109215, 0.024727532111082962, 0.043665028337173825, -0.3041249119417685, 0.07687869864071681, 0.05152837546434583, 0.03152808632549583, -0.07255021436456717, -0.028484559729600286, -0.07860560860994849, 0.1934868953108382, -0.001205246734985651, 0.008289677426725829, 0.19392456984793655, -0.15881834641656503, -0.09173734313618316, 0.34436547972236564, -0.07670919522706444, -0.1785827613242452, 0.17614335010183, -0.15297181152288808, -0.13554913741473082, 0.13452717569042125, 0.20506126441411535, 0.08752120884933642, -0.1341092702904938, 0.012026495955366527, -0.052500287052655754, 0.2203093402778261, 0.00943087646896083, 0.04115071808159047, 0.193141762829278, 0.22651818564136317, 0.09908819958238171, 0.1425653782152083, -0.08185440945743146, -0.10558560308303405, -0.2366662205760779, -0.08292507968184089, -0.14996421032388801, 0.06083596517364764, -0.06934441086591846, -0.14024537597956344, 0.4220691825560972, 0.14489129573094095, 0.2053908228709483, 0.0530533160591422, 0.26051013561624553, 0.11350408245628814, 0.09657030728753327, 0.10977815758741023, 0.2360936257953369, 0.07704751312631328, 0.0999157656242336, -0.24037643988318994, 0.1306572376503324, 0.006605781947395631] |
1,802.02262 | Unitarity and Universality in non relativistic Conformal Field theory | We relate the notion of unitarity of a $SL(2,\mathbf{R})$ invariant field
theory with that of a Schrodinger field theory using the fact that
$SL(2,\mathbf{R})$ is a subgroup of Schrodinger group. Exploiting
$SL(2,\mathbf{R})$ unitarity, we derive the unitarity bounds and null
conditions for a Schr\"odinger field theory (for the neutral as well as the
charged sector). In non integer dimensions the theory is shown to be
non-unitary. Furthermore, the use of $SL(2,\mathbf{R})$ subgroup opens up the
possibility of borrowing results from 1D $SL(2,\mathbf{R})$ invariant field
theory to explore Schrodinger field theory, in particular, the sector with zero
charge. We explore the consequences of $SL(2,\mathbf{R})$ symmetry e.g. the
convergence of operator product expansion in the kinematic limit, where all the
operators (neutral and/or charged) are on same temporal slice ($x=constant$),
the universal behavior of weighted spectral density function, existence of
infinite number of $SL(2,\mathbf{R})$ primaries, the analytic behavior of three
point function as a function of spatial separation. We discuss the implication
of imposing parity invariance ($\tau\to-\tau$) in addition to Schrodinger
invariance and emphasize its difference from time reversal ($\tau \to-\tau$
with charge conjugation).
| hep-th cond-mat.quant-gas cond-mat.str-el hep-ph | we relate the notion of unitarity of a sl2mathbfr invariant field theory with that of a schrodinger field theory using the fact that sl2mathbfr is a subgroup of schrodinger group exploiting sl2mathbfr unitarity we derive the unitarity bounds and null conditions for a schrodinger field theory for the neutral as well as the charged sector in non integer dimensions the theory is shown to be nonunitary furthermore the use of sl2mathbfr subgroup opens up the possibility of borrowing results from 1d sl2mathbfr invariant field theory to explore schrodinger field theory in particular the sector with zero charge we explore the consequences of sl2mathbfr symmetry eg the convergence of operator product expansion in the kinematic limit where all the operators neutral andor charged are on same temporal slice xconstant the universal behavior of weighted spectral density function existence of infinite number of sl2mathbfr primaries the analytic behavior of three point function as a function of spatial separation we discuss the implication of imposing parity invariance tautotau in addition to schrodinger invariance and emphasize its difference from time reversal tau totau with charge conjugation | [['we', 'relate', 'the', 'notion', 'of', 'unitarity', 'of', 'a', 'sl2mathbfr', 'invariant', 'field', 'theory', 'with', 'that', 'of', 'a', 'schrodinger', 'field', 'theory', 'using', 'the', 'fact', 'that', 'sl2mathbfr', 'is', 'a', 'subgroup', 'of', 'schrodinger', 'group', 'exploiting', 'sl2mathbfr', 'unitarity', 'we', 'derive', 'the', 'unitarity', 'bounds', 'and', 'null', 'conditions', 'for', 'a', 'schrodinger', 'field', 'theory', 'for', 'the', 'neutral', 'as', 'well', 'as', 'the', 'charged', 'sector', 'in', 'non', 'integer', 'dimensions', 'the', 'theory', 'is', 'shown', 'to', 'be', 'nonunitary', 'furthermore', 'the', 'use', 'of', 'sl2mathbfr', 'subgroup', 'opens', 'up', 'the', 'possibility', 'of', 'borrowing', 'results', 'from', '1d', 'sl2mathbfr', 'invariant', 'field', 'theory', 'to', 'explore', 'schrodinger', 'field', 'theory', 'in', 'particular', 'the', 'sector', 'with', 'zero', 'charge', 'we', 'explore', 'the', 'consequences', 'of', 'sl2mathbfr', 'symmetry', 'eg', 'the', 'convergence', 'of', 'operator', 'product', 'expansion', 'in', 'the', 'kinematic', 'limit', 'where', 'all', 'the', 'operators', 'neutral', 'andor', 'charged', 'are', 'on', 'same', 'temporal', 'slice', 'xconstant', 'the', 'universal', 'behavior', 'of', 'weighted', 'spectral', 'density', 'function', 'existence', 'of', 'infinite', 'number', 'of', 'sl2mathbfr', 'primaries', 'the', 'analytic', 'behavior', 'of', 'three', 'point', 'function', 'as', 'a', 'function', 'of', 'spatial', 'separation', 'we', 'discuss', 'the', 'implication', 'of', 'imposing', 'parity', 'invariance', 'tautotau', 'in', 'addition', 'to', 'schrodinger', 'invariance', 'and', 'emphasize', 'its', 'difference', 'from', 'time', 'reversal', 'tau', 'totau', 'with', 'charge', 'conjugation']] | [-0.1540624218434876, 0.1644247681066373, -0.104300495352877, 0.08081466892042181, -0.0629182187294036, -0.10930189112066058, 0.020039784619272503, 0.3088695553844201, -0.2683583296374964, -0.2522542522127568, 0.08981210625712245, -0.27057177282599265, -0.1260898353684142, 0.10242352179022683, 0.002558054542949413, 0.06833526558325985, -0.021319179142716044, 0.06993147380670856, -0.14316057593317172, -0.1643598236081154, 0.3783560038112395, 0.00023957297977257792, 0.256718630282021, 0.07577382526282408, 0.07715391548215178, 0.047343569812911185, -0.012330198205237449, 0.0071769248838562455, -0.11027502039664974, 0.09383524811238717, 0.16287230786752976, 0.09082144877142351, 0.20334153924158166, -0.41579108819490374, -0.19909112366676, 0.11239515594076678, 0.13459229470234216, 0.11197352890112547, -0.061201970881844904, -0.3076607555192609, 0.06506200058531411, -0.1636014172609625, -0.2267108516190097, -0.0813630464442553, 0.009792170355320184, -0.014002286358190149, -0.27102860858320527, 0.10328976345617928, 0.038262297301136956, 0.08432073957630168, -0.07046154659962042, -0.06793985053033219, -0.03530564224191385, 0.09088557395126733, 0.11084564329598452, 0.012249239278155999, 0.11006952590093162, -0.15904082825365762, -0.12889557403730822, 0.3749194665546607, -0.10690122528532364, -0.22261522111987603, 0.14142883037523934, -0.21003186952013148, -0.15208471315397815, 0.06966785644181073, 0.12487222033282273, 0.12377665386347922, -0.11391090862869217, 0.21452863177729448, -0.07123021806223453, 0.11540442923238038, 0.09715835106762012, 0.08072784997382353, 0.1742403436472962, 0.08810075453492974, 0.10566976350893438, 0.1266924997007308, -0.01651238931431409, -0.1100363004250275, -0.3847448393057345, -0.17378597683143182, -0.13644718336703662, 0.09957609157593057, -0.10908918209649056, -0.164274801630052, 0.4058688279220512, 0.13231674133380159, 0.18424924154500555, 0.07855722400250548, 0.21408690211451586, 0.1763742528628173, 0.060199421190516245, 0.04256490113307311, 0.19852018237436533, 0.21338852443836379, 0.04899367725888954, -0.2582666196797938, -0.05892843046542986, 0.13767567037555323] |
1,802.02263 | Algorithms for the explicit computation of Penrose diagrams | An algorithm is given for explicitly computing Penrose diagrams for
spacetimes of the form $ds^2 = -f(r)\, dt^2 + f(r)^{-1} \, dr^2 + r^2 \,
d\Omega^2$. The resulting diagram coordinates are shown to extend the metric
continuously and nondegenerately across an arbitrary number of horizons. The
method is extended to include piecewise approximations to dynamically evolving
spacetimes using a standard hypersurface junction procedure. Examples generated
by an implementation of the algorithm are shown for standard and new cases. In
the appendix, this algorithm is compared to existing methods.
| gr-qc | an algorithm is given for explicitly computing penrose diagrams for spacetimes of the form ds2 fr dt2 fr1 dr2 r2 domega2 the resulting diagram coordinates are shown to extend the metric continuously and nondegenerately across an arbitrary number of horizons the method is extended to include piecewise approximations to dynamically evolving spacetimes using a standard hypersurface junction procedure examples generated by an implementation of the algorithm are shown for standard and new cases in the appendix this algorithm is compared to existing methods | [['an', 'algorithm', 'is', 'given', 'for', 'explicitly', 'computing', 'penrose', 'diagrams', 'for', 'spacetimes', 'of', 'the', 'form', 'ds2', 'fr', 'dt2', 'fr1', 'dr2', 'r2', 'domega2', 'the', 'resulting', 'diagram', 'coordinates', 'are', 'shown', 'to', 'extend', 'the', 'metric', 'continuously', 'and', 'nondegenerately', 'across', 'an', 'arbitrary', 'number', 'of', 'horizons', 'the', 'method', 'is', 'extended', 'to', 'include', 'piecewise', 'approximations', 'to', 'dynamically', 'evolving', 'spacetimes', 'using', 'a', 'standard', 'hypersurface', 'junction', 'procedure', 'examples', 'generated', 'by', 'an', 'implementation', 'of', 'the', 'algorithm', 'are', 'shown', 'for', 'standard', 'and', 'new', 'cases', 'in', 'the', 'appendix', 'this', 'algorithm', 'is', 'compared', 'to', 'existing', 'methods']] | [-0.11144000742436819, 0.028322451903233476, -0.08043529082475821, 0.07729662113493627, -0.07737365989695962, -0.152445075141902, -0.04244264641708535, 0.3955494029810879, -0.22678401398972223, -0.27695190377260853, 0.08777186024519501, -0.25800366181789375, -0.1565259071085609, 0.25188138481320405, -0.10096749160211624, 0.03717333846157644, 0.017257319308999108, 0.03126860450862384, -0.09245531232573273, -0.3034239058587246, 0.31737296007539534, 0.039268578561704334, 0.23856033088366796, -0.03032131590198998, 0.09976336727963715, -0.0569320195794628, -0.039849620942798696, 0.07886647190289517, -0.16068961285622563, 0.07469932308914594, 0.20489472073287043, 0.15736706384525792, 0.18527718145036842, -0.3439873188688624, -0.19375229837009456, 0.09671369727726503, 0.18604150732479444, 0.12861563728713407, -0.00924932901043354, -0.32426339133483606, 0.0906014228977899, -0.172572801843649, -0.16280506563191188, -0.09828554286916809, 0.03368675084103171, 0.003615868891157755, -0.29178748141247324, 0.027182545901912197, 0.0467095649290103, -0.0003835113673675351, -0.07892391782412987, -0.0750165430526533, 0.006365903460125371, 0.0694091139679275, 0.03608244801473963, 0.10176115825476988, 0.08566101284970234, -0.0554707511015827, -0.12238775717631187, 0.35784764992209467, -0.029632190276482482, -0.25993515053627697, 0.1234391584038371, -0.08106358261301932, -0.09945542232428746, 0.13478037503706972, 0.13287297585161356, 0.17734988304082214, -0.17223236278244636, 0.18691410918623527, 0.026762263974311147, 0.09779249344066512, 0.07347304824875986, -0.04135787330295255, 0.16805608495615604, 0.07415574868834328, 0.0715211402928661, 0.1568875547680186, -0.03470964613938477, -0.11821384098034397, -0.3350621264473331, -0.16365757041572446, -0.15786907232434647, -0.010897035239173508, -0.16616446046100464, -0.22822404459967824, 0.34313379905879404, 0.10462603087412058, 0.1518244833537099, 0.07726477606065157, 0.30100656957819877, 0.08413123278225568, 0.03933944927369494, 0.15796988613608226, 0.18248066170390967, 0.11886230923473926, 0.07787236924533074, -0.15338946087853755, -0.01265506005935405, 0.13690607844306746] |
1,802.02264 | $\mathfrak F$-categories and $\mathfrak F$-functors in Representation
Theory II | This is a partial derivative of \cite{MR94g:17044}. We give a list of
examples/problems that some will find amusing.
| math.RT | this is a partial derivative of citemr94g17044 we give a list of examplesproblems that some will find amusing | [['this', 'is', 'a', 'partial', 'derivative', 'of', 'citemr94g17044', 'we', 'give', 'a', 'list', 'of', 'examplesproblems', 'that', 'some', 'will', 'find', 'amusing']] | [-0.23211606382392347, 0.0713689232361503, -0.12504303643800085, 0.07915453746682033, -0.20858622784726322, -0.056480817671399564, 0.0668078389717266, 0.36968316696584225, -0.2301605176180601, -0.2263755090534687, 0.16926642737234943, -0.292982418788597, -0.21639632538426667, 0.14739560894668102, -0.11357824818696827, -0.10171039946726523, 0.0717138260952197, 0.1518417070619762, -0.13243187170883175, -0.3209123434498906, 0.3313960521481931, -0.02605887537356466, 0.041712504287716, 0.13962313393130898, 0.10797327320324257, -0.07666332862572744, -0.07304593233857304, 0.011423566844314337, -0.18660258235695437, 0.12923103879438713, 0.24803077126853168, 0.17786352714756504, 0.3217694852501154, -0.34623393102083355, -0.16773376970377285, 0.08866986518842168, 0.08565515515510924, 0.1914474058430642, -0.11949209542945027, -0.20357433753088117, 0.1132895442424342, -0.17962269799318165, -0.15701832209015265, -0.09822287689894438, 0.06906705175060779, 0.06028916937066242, -0.2645240114070475, 0.024059705378022045, 0.10012506297789514, 0.009774065707460977, 0.0039043606957420707, -0.1217901524505578, 0.04067078756634146, 0.04286800653790124, -0.0009494140540482476, 0.03703181556193158, 0.009410489408764988, -0.09662583003228065, -0.106340576778166, 0.39228992629796267, -0.05637451261281967, -0.18220110097900033, 0.11701742035802454, -0.16782492416677997, -0.2093021273612976, 0.10748331263891941, 0.11367376311682165, 0.10620579402893782, -0.15784669946879148, 0.03825048400904052, -0.1682288497686386, 0.157511709141545, 0.026781647466123104, 0.044666301837423816, 0.18020726891700178, 0.10914876870810986, 0.1450964590185322, 0.21091762322248542, -0.04664188122842461, 0.019394204718992114, -0.44560607615858316, -0.25286121014505625, -0.05051891799666919, 0.13304705853806809, -0.026814938983079628, -0.21405910095199943, 0.41779862507246435, 0.19763780024368316, 0.22230509901419282, 0.10530334334180225, 0.18031977396458387, 0.17078485654201359, -0.018619004185893573, -0.0031061484769452363, 0.20340291606589744, 0.04925144906155765, 0.09652108896989375, -0.14709644162212498, 0.035913111350964755, 0.07285629323450848] |
1,802.02265 | Hierarchical Erasure Correction of Linear Codes | Linear codes over finite extension fields have widespread applications in
theory and practice. In some scenarios, the decoder has a sequential access to
the codeword symbols, giving rise to a hierarchical erasure structure. In this
paper we develop a mathematical framework for hierarchical erasures over
extension fields, provide several bounds and constructions, and discuss
potential applications in distributed storage and flash memories. Our results
show intimate connection to Universally Decodable Matrices, as well as to
Reed-Solomon and Gabidulin codes.
| cs.IT math.IT | linear codes over finite extension fields have widespread applications in theory and practice in some scenarios the decoder has a sequential access to the codeword symbols giving rise to a hierarchical erasure structure in this paper we develop a mathematical framework for hierarchical erasures over extension fields provide several bounds and constructions and discuss potential applications in distributed storage and flash memories our results show intimate connection to universally decodable matrices as well as to reedsolomon and gabidulin codes | [['linear', 'codes', 'over', 'finite', 'extension', 'fields', 'have', 'widespread', 'applications', 'in', 'theory', 'and', 'practice', 'in', 'some', 'scenarios', 'the', 'decoder', 'has', 'a', 'sequential', 'access', 'to', 'the', 'codeword', 'symbols', 'giving', 'rise', 'to', 'a', 'hierarchical', 'erasure', 'structure', 'in', 'this', 'paper', 'we', 'develop', 'a', 'mathematical', 'framework', 'for', 'hierarchical', 'erasures', 'over', 'extension', 'fields', 'provide', 'several', 'bounds', 'and', 'constructions', 'and', 'discuss', 'potential', 'applications', 'in', 'distributed', 'storage', 'and', 'flash', 'memories', 'our', 'results', 'show', 'intimate', 'connection', 'to', 'universally', 'decodable', 'matrices', 'as', 'well', 'as', 'to', 'reedsolomon', 'and', 'gabidulin', 'codes']] | [-0.17534948870704709, 0.05977902142331004, -0.07108685610037815, 0.11495843908566793, -0.061413508403716205, -0.24509627886611637, 0.07963161342305757, 0.39609275945709854, -0.34618940732524367, -0.26813090838421183, 0.16107214713775658, -0.21647991376186285, -0.22153595159466885, 0.18738873282895435, -0.14949603872137923, 0.07817858323171924, 0.037419554877649, 0.025766148801106087, -0.1264204422389216, -0.32842227282250136, 0.24494709382039978, 0.15459305144657817, 0.28299061976420353, 0.024284304638357856, 0.06890011053455734, 0.020460155214878577, -0.02256655262759592, -0.06104535760381554, -0.13339234999369218, 0.10992446507598404, 0.376357327274318, 0.1906008173393298, 0.2283750367675071, -0.4185449609745152, -0.29620573304805764, 0.06252751851607632, 0.16029192163620756, 0.17814828558011522, -0.11711290919610971, -0.19898744557005696, 0.14790119105784955, -0.28972420181793196, -0.011355790887263757, -0.075724569962749, 0.002017577909687652, 0.01282257218904133, -0.3068939704496614, -0.051709262937118736, 0.08225042241348449, 0.06066246551779818, -0.041831525154647574, -0.09276014114022726, 0.14207991470783193, 0.0626932696639737, 0.011986348330031467, 0.017805173993110657, 0.046628070299666896, -0.03926275939609902, -0.21242473124160985, 0.34118535536152744, -0.01256583744212042, -0.19481970065662377, 0.1635906613207882, -0.03133505639985581, -0.11982689434485629, 0.07414473234852657, 0.2684603903731449, 0.07043541380781916, -0.1081631985615314, 0.14369022783372387, -0.05113672073694724, 0.1338644063842919, 0.1057593019537722, 0.17035156504038862, 0.1739517254401234, 0.09283446269463512, 0.04431719662727717, 0.17739883162187342, -0.018541493806752223, -0.15282798222490127, -0.2822040909358972, -0.15099730112448428, -0.14671694766140625, 0.013392999214179154, -0.11772245396266816, -0.20095757302928338, 0.3826170989512643, 0.1495891797203052, 0.16163811702399125, 0.13306400676175387, 0.2896175604855901, -0.012827784891381765, 0.1491991915280306, 0.18267436311403407, 0.1061068888406617, 0.2582291055918683, 0.06734963073513081, -0.08553844962056868, 0.052740500261417675, 0.061392217980627016] |
1,802.02266 | Imaging Orbital-selective Quasiparticles in the Hund's Metal State of
FeSe | Strong electronic correlations, emerging from the parent Mott insulator
phase, are key to copper-based high temperature superconductivity (HTS). By
contrast, the parent phase of iron-based HTS is never a correlated insulator.
But this distinction may be deceptive because Fe has five active d-orbitals
while Cu has only one. In theory, such orbital multiplicity can generate a
Hund's Metal state, in which alignment of the Fe spins suppresses inter-orbital
fluctuations producing orbitally selective strong correlations. The spectral
weights $Z_m$ of quasiparticles associated with different Fe orbitals m should
then be radically different. Here we use quasiparticle scattering interference
resolved by orbital content to explore these predictions in FeSe. Signatures of
strong, orbitally selective differences of quasiparticle $Z_m$ appear on all
detectable bands over a wide energy range. Further, the quasiparticle
interference amplitudes reveal that $Z_{xy}<Z_{xz}<<Z_{yz}$, consistent with
earlier orbital-selective Cooper pairing studies. Thus, orbital-selective
strong correlations dominate the parent state of iron-based HTS in FeSe.
| cond-mat.str-el | strong electronic correlations emerging from the parent mott insulator phase are key to copperbased high temperature superconductivity hts by contrast the parent phase of ironbased hts is never a correlated insulator but this distinction may be deceptive because fe has five active dorbitals while cu has only one in theory such orbital multiplicity can generate a hunds metal state in which alignment of the fe spins suppresses interorbital fluctuations producing orbitally selective strong correlations the spectral weights z_m of quasiparticles associated with different fe orbitals m should then be radically different here we use quasiparticle scattering interference resolved by orbital content to explore these predictions in fese signatures of strong orbitally selective differences of quasiparticle z_m appear on all detectable bands over a wide energy range further the quasiparticle interference amplitudes reveal that z_xyz_xzz_yz consistent with earlier orbitalselective cooper pairing studies thus orbitalselective strong correlations dominate the parent state of ironbased hts in fese | [['strong', 'electronic', 'correlations', 'emerging', 'from', 'the', 'parent', 'mott', 'insulator', 'phase', 'are', 'key', 'to', 'copperbased', 'high', 'temperature', 'superconductivity', 'hts', 'by', 'contrast', 'the', 'parent', 'phase', 'of', 'ironbased', 'hts', 'is', 'never', 'a', 'correlated', 'insulator', 'but', 'this', 'distinction', 'may', 'be', 'deceptive', 'because', 'fe', 'has', 'five', 'active', 'dorbitals', 'while', 'cu', 'has', 'only', 'one', 'in', 'theory', 'such', 'orbital', 'multiplicity', 'can', 'generate', 'a', 'hunds', 'metal', 'state', 'in', 'which', 'alignment', 'of', 'the', 'fe', 'spins', 'suppresses', 'interorbital', 'fluctuations', 'producing', 'orbitally', 'selective', 'strong', 'correlations', 'the', 'spectral', 'weights', 'z_m', 'of', 'quasiparticles', 'associated', 'with', 'different', 'fe', 'orbitals', 'm', 'should', 'then', 'be', 'radically', 'different', 'here', 'we', 'use', 'quasiparticle', 'scattering', 'interference', 'resolved', 'by', 'orbital', 'content', 'to', 'explore', 'these', 'predictions', 'in', 'fese', 'signatures', 'of', 'strong', 'orbitally', 'selective', 'differences', 'of', 'quasiparticle', 'z_m', 'appear', 'on', 'all', 'detectable', 'bands', 'over', 'a', 'wide', 'energy', 'range', 'further', 'the', 'quasiparticle', 'interference', 'amplitudes', 'reveal', 'that', 'z_xyz_xzz_yz', 'consistent', 'with', 'earlier', 'orbitalselective', 'cooper', 'pairing', 'studies', 'thus', 'orbitalselective', 'strong', 'correlations', 'dominate', 'the', 'parent', 'state', 'of', 'ironbased', 'hts', 'in', 'fese']] | [-0.20719911750509507, 0.2831946461456919, -0.033420560295614445, 0.12685318475169147, -0.055760600479331866, -0.19285938719263165, 0.12303540195883221, 0.4009103553333119, -0.2504036347046981, -0.26567464362330784, -0.08457561551282804, -0.357729854698299, -0.06977279940498324, 0.08251087589750943, 0.05496833580576516, -0.04605514306903762, -0.012741579031236957, -0.09845200775866854, -0.16564391723992242, -0.22174850902671345, 0.3263982217270977, -0.0005213511876421037, 0.31871509308214574, 0.06168985790481754, -0.055960332275728934, 0.014892289431741328, 0.11128469020298688, 0.012609342874021701, -0.10378207569338688, 0.040912400985903596, 0.3397658665427098, -0.0776993493013863, 0.2108569818859299, -0.4248125566400928, -0.23740179408410125, 0.01072104202486039, 0.19851148132161767, 0.15990098981031528, -0.059094464577570116, -0.29506463301634367, 0.027385489984713737, -0.20732773291677528, -0.08736781887725312, -0.12563203563502826, -0.015514895179270146, -0.002017120609297326, -0.21803674406183313, 0.1027129401237509, 0.06425931721657904, 0.10179582873079317, -0.08202325710965917, -0.15534063777125445, -0.12815476148358845, 0.01915266151765203, 0.07596786940025982, 0.09275797372790406, 0.11016841673176565, -0.09123300579551522, -0.09126678700832759, 0.33563073316217684, -0.00566531928085716, -0.01886597404171244, 0.19866231363875414, -0.21119788893516742, -0.10063894025470112, 0.23453920407013762, 0.06806031191033719, 0.05515620736040029, -0.13157334941701074, 0.05412152424771217, -0.031784143591044, 0.21243892985569568, 0.00749979558662554, 0.21749882153281028, 0.31443150566846706, 0.14484877311784372, 0.011801776141415234, 0.06779378207455225, -0.14456432652271664, -0.06925897417571761, -0.18493734291005953, -0.1454279496231013, -0.22724641466382403, 0.049180216294427224, -0.04489152922958525, -0.1864824158541274, 0.39028693495768735, 0.16552530316212916, 0.18639099138356696, -0.1242528349378761, 0.19441974145402902, 0.07262331187067662, 0.08958544472865516, -0.0002970464567172956, 0.2525925589238409, 0.16622578404582064, 0.08152723821409631, -0.3229875543529131, 0.14739276633979875, 0.019090576763903976] |
1,802.02267 | Learning interacting particle systems: diffusion parameter estimation
for aggregation equations | In this article, we study the parameter estimation of interacting particle
systems subject to the Newtonian aggregation and Brownian diffusion.
Specifically, we construct an estimator $\widehat{\nu}$ with partial observed
data to approximate the diffusion parameter $\nu$, and the estimation error is
achieved. Furthermore, we extend this result to general aggregation equations
with a bounded Lipschitz interaction field.
| math.AP math.PR | in this article we study the parameter estimation of interacting particle systems subject to the newtonian aggregation and brownian diffusion specifically we construct an estimator widehatnu with partial observed data to approximate the diffusion parameter nu and the estimation error is achieved furthermore we extend this result to general aggregation equations with a bounded lipschitz interaction field | [['in', 'this', 'article', 'we', 'study', 'the', 'parameter', 'estimation', 'of', 'interacting', 'particle', 'systems', 'subject', 'to', 'the', 'newtonian', 'aggregation', 'and', 'brownian', 'diffusion', 'specifically', 'we', 'construct', 'an', 'estimator', 'widehatnu', 'with', 'partial', 'observed', 'data', 'to', 'approximate', 'the', 'diffusion', 'parameter', 'nu', 'and', 'the', 'estimation', 'error', 'is', 'achieved', 'furthermore', 'we', 'extend', 'this', 'result', 'to', 'general', 'aggregation', 'equations', 'with', 'a', 'bounded', 'lipschitz', 'interaction', 'field']] | [-0.1168179375485384, 0.0764900872124729, -0.05560207784791211, 0.041919531178012094, -0.07981960433867893, -0.1433864235794837, 0.01597903559117445, 0.34578528055655106, -0.32092273737570004, -0.27011397880102905, 0.0892646429274464, -0.2661902170096125, -0.15666847079825988, 0.10648160448805097, -0.08117946448536324, 0.09782823940206851, 0.04634357531488474, 0.019944907309504094, -0.04793308994599751, -0.24779353457103884, 0.3111623961678041, 0.038637402783414085, 0.2104886037164501, 0.00984457038742091, 0.1528665048889317, 0.01118790271825024, -0.047671322777335136, 0.04881659362997327, -0.2875116369520713, 0.1383327453763091, 0.2169736646891189, 0.03276158057685409, 0.29019448726571034, -0.3563176433589043, -0.22132513695396483, 0.15559259852826862, 0.17334041272157005, 0.12646858527192048, -0.04378805878306074, -0.3076018785026723, 0.02629284838414086, -0.17547005152196757, -0.13591966399690136, -0.04503085515794477, 0.002054142177387673, 0.026097929234051014, -0.37517598292989923, 0.14616657048463821, 0.08164400096783149, 0.03860442523728125, -0.10375584304607141, -0.05435651835744336, 0.05871961610059121, 0.05951540199540822, 0.0798528385764387, 0.043758188237136765, 0.1452805991367703, -0.11629614344565198, -0.09878869908737085, 0.33841284607271, -0.10727637217080753, -0.3280318444594741, 0.1918914602138102, -0.1659142157628334, -0.1236608165781945, 0.1110257058337863, 0.22680781495624355, 0.10273923260891545, -0.1844867119299514, 0.10459541469338417, -0.02424517031093793, 0.15342796306192344, 0.012482724734582007, -0.02685060706634041, 0.05445595508873729, 0.1906862189851901, 0.1218417555459642, 0.1416836556745693, -0.09979039280109905, -0.13908878267310293, -0.28943373588845134, -0.15782747755292803, -0.17794059601146728, 0.052415099942923656, -0.1107747716409254, -0.18407421953244402, 0.34177567683426396, 0.21511860105342098, 0.18250504158537037, 0.1342551349371206, 0.2667386592199494, 0.17975806860652352, -0.046779084451762695, 0.07210165899180408, 0.21948561341767864, 0.14893405325710773, 0.0891810304518523, -0.21147286763880402, 0.03214648009244619, 0.05606701384775598] |
1,802.02268 | Unified Bayesian estimator of EEG reference at infinity: rREST | The choice of reference for electroencephalogram (EEG) is a long-lasting
unsolved issue resulting in inconsistent usages and endless debates. Currently,
both average reference (AR) and reference electrode standardization technique
(REST) are two primary, irreconcilable contenders. We propose a theoretical
framework to resolve this issue by formulating both a) estimation of potentials
at infinity, and, b) determination of the reference, as a unified Bayesian
linear inverse problem. We find that AR and REST are very particular cases of
this unified framework: AR results from biophysically non-informative prior;
while REST utilizes the prior of EEG generative model. We develop the
regularized versions of AR and REST, named rAR, and rREST, respectively. Both
depend on a regularization parameter that is the noise to signal ratio.
Traditional and new estimators are evaluated with this framework, by both
simulations and analysis of real EEGs. Generated artificial EEGs, show that
relative error in estimating the EEG potentials at infinity is lowest for
rREST. It also reveals that realistic volume conductor models improve the
performances of REST and rREST. For practical applications, it is shown that
average lead field gives the results comparable to the individual lead field.
Finally, it is shown that the selection of the regularization parameter with
Generalized Cross-Validation (GCV) is close to the 'oracle' choice based on the
ground truth. When evaluated with the real 89 resting state EEGs, rREST
consistently yields the lowest GCV. This study provides a novel perspective on
the EEG reference problem by means of a unified inverse solution framework. It
may allow additional principled theoretical formulations and numerical
evaluation of performance.
| q-bio.QM | the choice of reference for electroencephalogram eeg is a longlasting unsolved issue resulting in inconsistent usages and endless debates currently both average reference ar and reference electrode standardization technique rest are two primary irreconcilable contenders we propose a theoretical framework to resolve this issue by formulating both a estimation of potentials at infinity and b determination of the reference as a unified bayesian linear inverse problem we find that ar and rest are very particular cases of this unified framework ar results from biophysically noninformative prior while rest utilizes the prior of eeg generative model we develop the regularized versions of ar and rest named rar and rrest respectively both depend on a regularization parameter that is the noise to signal ratio traditional and new estimators are evaluated with this framework by both simulations and analysis of real eegs generated artificial eegs show that relative error in estimating the eeg potentials at infinity is lowest for rrest it also reveals that realistic volume conductor models improve the performances of rest and rrest for practical applications it is shown that average lead field gives the results comparable to the individual lead field finally it is shown that the selection of the regularization parameter with generalized crossvalidation gcv is close to the oracle choice based on the ground truth when evaluated with the real 89 resting state eegs rrest consistently yields the lowest gcv this study provides a novel perspective on the eeg reference problem by means of a unified inverse solution framework it may allow additional principled theoretical formulations and numerical evaluation of performance | [['the', 'choice', 'of', 'reference', 'for', 'electroencephalogram', 'eeg', 'is', 'a', 'longlasting', 'unsolved', 'issue', 'resulting', 'in', 'inconsistent', 'usages', 'and', 'endless', 'debates', 'currently', 'both', 'average', 'reference', 'ar', 'and', 'reference', 'electrode', 'standardization', 'technique', 'rest', 'are', 'two', 'primary', 'irreconcilable', 'contenders', 'we', 'propose', 'a', 'theoretical', 'framework', 'to', 'resolve', 'this', 'issue', 'by', 'formulating', 'both', 'a', 'estimation', 'of', 'potentials', 'at', 'infinity', 'and', 'b', 'determination', 'of', 'the', 'reference', 'as', 'a', 'unified', 'bayesian', 'linear', 'inverse', 'problem', 'we', 'find', 'that', 'ar', 'and', 'rest', 'are', 'very', 'particular', 'cases', 'of', 'this', 'unified', 'framework', 'ar', 'results', 'from', 'biophysically', 'noninformative', 'prior', 'while', 'rest', 'utilizes', 'the', 'prior', 'of', 'eeg', 'generative', 'model', 'we', 'develop', 'the', 'regularized', 'versions', 'of', 'ar', 'and', 'rest', 'named', 'rar', 'and', 'rrest', 'respectively', 'both', 'depend', 'on', 'a', 'regularization', 'parameter', 'that', 'is', 'the', 'noise', 'to', 'signal', 'ratio', 'traditional', 'and', 'new', 'estimators', 'are', 'evaluated', 'with', 'this', 'framework', 'by', 'both', 'simulations', 'and', 'analysis', 'of', 'real', 'eegs', 'generated', 'artificial', 'eegs', 'show', 'that', 'relative', 'error', 'in', 'estimating', 'the', 'eeg', 'potentials', 'at', 'infinity', 'is', 'lowest', 'for', 'rrest', 'it', 'also', 'reveals', 'that', 'realistic', 'volume', 'conductor', 'models', 'improve', 'the', 'performances', 'of', 'rest', 'and', 'rrest', 'for', 'practical', 'applications', 'it', 'is', 'shown', 'that', 'average', 'lead', 'field', 'gives', 'the', 'results', 'comparable', 'to', 'the', 'individual', 'lead', 'field', 'finally', 'it', 'is', 'shown', 'that', 'the', 'selection', 'of', 'the', 'regularization', 'parameter', 'with', 'generalized', 'crossvalidation', 'gcv', 'is', 'close', 'to', 'the', 'oracle', 'choice', 'based', 'on', 'the', 'ground', 'truth', 'when', 'evaluated', 'with', 'the', 'real', '89', 'resting', 'state', 'eegs', 'rrest', 'consistently', 'yields', 'the', 'lowest', 'gcv', 'this', 'study', 'provides', 'a', 'novel', 'perspective', 'on', 'the', 'eeg', 'reference', 'problem', 'by', 'means', 'of', 'a', 'unified', 'inverse', 'solution', 'framework', 'it', 'may', 'allow', 'additional', 'principled', 'theoretical', 'formulations', 'and', 'numerical', 'evaluation', 'of', 'performance']] | [-0.04026166763399664, 0.03442402437201811, -0.08557226038945152, 0.07710432650887906, -0.07143306336631226, -0.18445393882033206, 0.051598404728924366, 0.39453401272769434, -0.2114235008323119, -0.3160147148719192, 0.08315211945007991, -0.2605501019932372, -0.16292957235092276, 0.18137576734955235, -0.09511204607193376, 0.0652904328589147, 0.09618374748428143, 0.04383920901454985, -0.07141861983596173, -0.21541182073576823, 0.27192942507763324, 0.07309719208696992, 0.3549375671950017, 0.026440367518486843, 0.10296124553647841, -0.006286344708726094, -0.04682122691031616, 0.010814222581148714, -0.08939962529486795, 0.12133111109861489, 0.2547299914022213, 0.16382167426720545, 0.31971511272040726, -0.3864431853623912, -0.21411252103590125, 0.08344616409844433, 0.11297636063828774, 0.0887324701288198, -0.04395411010546532, -0.29448791943887115, 0.10250404643597782, -0.15209083002471868, -0.058583007245448494, -0.09294421595128204, -0.0025798939938653444, -0.01197716581348344, -0.32490659042300496, 0.10168135454849439, 0.017149855029649063, 0.06872030902129843, -0.10739926776597311, -0.14631796602209315, 0.05615110860025588, 0.11766297232278644, 0.0814407563342504, 0.043927864863859495, 0.12895499183636994, -0.10798185302773243, -0.09949940983374238, 0.34853357979992383, -0.04832265316884957, -0.21993551044211415, 0.18086355953024055, -0.07193030213880505, -0.1021440393227673, 0.09439191028135811, 0.14912575338046447, 0.0983290892809686, -0.1611017335422391, 0.048567606452803794, -0.0216415680607625, 0.1574625371638402, 0.03126823477723243, -0.010265089516366828, 0.1618693393872902, 0.1791701262361749, 0.03139588976200996, 0.1336458270761588, -0.11857930261609871, -0.09620278202061021, -0.3000632500481356, -0.11725626215551176, -0.15996112643622443, -0.00245477783913324, -0.09929593911156777, -0.15972656425077136, 0.39628770683994763, 0.1841611544696345, 0.1876543202223221, 0.06469685832010193, 0.30894824486409983, 0.09590505000102925, 0.01828772364429485, 0.06709130322302828, 0.24372513547978814, 0.09701858422658742, 0.07989401372323103, -0.20658015803001933, 0.07916985176762162, 0.018664062425968707] |
1,802.02269 | Pressure dependence of coherence-incoherence crossover behavior in
KFe2As2 observed by resistivity and 75As-NMR/NQR | We present the results of $^{75}$As nuclear magnetic resonance (NMR), nuclear
quadrupole resonance (NQR), and resistivity measurements in KFe$_2$As$_2$ under
pressure ($p$). The temperature dependence of the NMR shift, nuclear
spin-lattice relaxation time ($T_1$) and resistivity show a crossover between a
high-temperature incoherent, local-moment behavior and a low-temperature
coherent behavior at a crossover temperature ($T^*$). $T^*$ is found to
increase monotonically with pressure, consistent with increasing hybridization
between localized $3d$ orbital-derived bands with the itinerant electron bands.
No anomaly in $T^*$ is seen at the critical pressure $p_{\rm c}=1.8$ GPa where
a change of slope of the superconducting (SC) transition temperature $T_{\rm
c}(p)$ has been observed. In contrast, $T_{\rm c}(p)$ seems to correlate with
antiferromagnetic spin fluctuations in the normal state as measured by the NQR
$1/T_1$ data, although such a correlation cannot be seen in the replacement
effects of A in the AFe$_2$As$_2$ (A= K, Rb, Cs) family. In the superconducting
state, two $T_1$ components are observed at low temperatures, suggesting the
existence of two distinct local electronic environments. The temperature
dependence of the short $T_{\rm 1s}$ indicates nearly gapless state below
$T_{\rm c}$. On the other hand, the temperature dependence of the long
component 1/$T_{\rm 1L}$ implies a large reduction in the density of states at
the Fermi level due to the SC gap formation. These results suggest a real-space
modulation of the local SC gap structure in KFe$_2$As$_2$ under pressure.
| cond-mat.supr-con cond-mat.str-el | we present the results of 75as nuclear magnetic resonance nmr nuclear quadrupole resonance nqr and resistivity measurements in kfe_2as_2 under pressure p the temperature dependence of the nmr shift nuclear spinlattice relaxation time t_1 and resistivity show a crossover between a hightemperature incoherent localmoment behavior and a lowtemperature coherent behavior at a crossover temperature t t is found to increase monotonically with pressure consistent with increasing hybridization between localized 3d orbitalderived bands with the itinerant electron bands no anomaly in t is seen at the critical pressure p_rm c18 gpa where a change of slope of the superconducting sc transition temperature t_rm cp has been observed in contrast t_rm cp seems to correlate with antiferromagnetic spin fluctuations in the normal state as measured by the nqr 1t_1 data although such a correlation cannot be seen in the replacement effects of a in the afe_2as_2 a k rb cs family in the superconducting state two t_1 components are observed at low temperatures suggesting the existence of two distinct local electronic environments the temperature dependence of the short t_rm 1s indicates nearly gapless state below t_rm c on the other hand the temperature dependence of the long component 1t_rm 1l implies a large reduction in the density of states at the fermi level due to the sc gap formation these results suggest a realspace modulation of the local sc gap structure in kfe_2as_2 under pressure | [['we', 'present', 'the', 'results', 'of', '75as', 'nuclear', 'magnetic', 'resonance', 'nmr', 'nuclear', 'quadrupole', 'resonance', 'nqr', 'and', 'resistivity', 'measurements', 'in', 'kfe_2as_2', 'under', 'pressure', 'p', 'the', 'temperature', 'dependence', 'of', 'the', 'nmr', 'shift', 'nuclear', 'spinlattice', 'relaxation', 'time', 't_1', 'and', 'resistivity', 'show', 'a', 'crossover', 'between', 'a', 'hightemperature', 'incoherent', 'localmoment', 'behavior', 'and', 'a', 'lowtemperature', 'coherent', 'behavior', 'at', 'a', 'crossover', 'temperature', 't', 't', 'is', 'found', 'to', 'increase', 'monotonically', 'with', 'pressure', 'consistent', 'with', 'increasing', 'hybridization', 'between', 'localized', '3d', 'orbitalderived', 'bands', 'with', 'the', 'itinerant', 'electron', 'bands', 'no', 'anomaly', 'in', 't', 'is', 'seen', 'at', 'the', 'critical', 'pressure', 'p_rm', 'c18', 'gpa', 'where', 'a', 'change', 'of', 'slope', 'of', 'the', 'superconducting', 'sc', 'transition', 'temperature', 't_rm', 'cp', 'has', 'been', 'observed', 'in', 'contrast', 't_rm', 'cp', 'seems', 'to', 'correlate', 'with', 'antiferromagnetic', 'spin', 'fluctuations', 'in', 'the', 'normal', 'state', 'as', 'measured', 'by', 'the', 'nqr', '1t_1', 'data', 'although', 'such', 'a', 'correlation', 'can', 'not', 'be', 'seen', 'in', 'the', 'replacement', 'effects', 'of', 'a', 'in', 'the', 'afe_2as_2', 'a', 'k', 'rb', 'cs', 'family', 'in', 'the', 'superconducting', 'state', 'two', 't_1', 'components', 'are', 'observed', 'at', 'low', 'temperatures', 'suggesting', 'the', 'existence', 'of', 'two', 'distinct', 'local', 'electronic', 'environments', 'the', 'temperature', 'dependence', 'of', 'the', 'short', 't_rm', '1s', 'indicates', 'nearly', 'gapless', 'state', 'below', 't_rm', 'c', 'on', 'the', 'other', 'hand', 'the', 'temperature', 'dependence', 'of', 'the', 'long', 'component', '1t_rm', '1l', 'implies', 'a', 'large', 'reduction', 'in', 'the', 'density', 'of', 'states', 'at', 'the', 'fermi', 'level', 'due', 'to', 'the', 'sc', 'gap', 'formation', 'these', 'results', 'suggest', 'a', 'realspace', 'modulation', 'of', 'the', 'local', 'sc', 'gap', 'structure', 'in', 'kfe_2as_2', 'under', 'pressure']] | [-0.1805178006657232, 0.26468669035587394, -0.061772723807346344, 0.016829063596987985, -0.0035537887358655916, -0.14731303987921113, 0.0972630706621716, 0.35869015547104627, -0.2585099528854092, -0.2764344692039184, -0.004205019998813892, -0.34815657389963156, -0.022054865629945554, 0.15087177553890735, 0.0903612734992694, -0.006082885602138873, -0.08065495626308405, 0.047227213516160764, -0.1980871511459088, -0.16831078684120637, 0.2733273745801013, 0.0280702431123051, 0.32249404306515544, 0.11262430275868003, -0.0016693041443976008, -0.05338206365664736, 0.13316378795490083, 0.04022385409046124, -0.14182005861065644, -0.050019591622120246, 0.3167280956871935, -0.0476765339810035, 0.17340558017982155, -0.3712835854444748, -0.21572193664669767, 0.04772529868472718, 0.11844642253199086, 0.09343411553945616, -0.05552174918488878, -0.23823077925361502, 0.010842055801459406, -0.12443494805110952, -0.09394729106650195, -0.09106774618709858, 0.013407429413567496, -0.032485217108733505, -0.27026573846511676, 0.18747957192438966, 0.07875051967895184, 0.15771613714213556, -0.12324554530573356, -0.1670577585325043, -0.043083056508022174, 0.005607050229620157, 0.060488083559032686, 0.11832491457962299, 0.17157151459745612, -0.06502841342972894, -0.06867055870113997, 0.30791483744735126, -0.11177415781232536, 0.030693432274393927, 0.17714631762932667, -0.2517373490179133, -0.11853187783366531, 0.20190225615022847, 0.07613705164249429, 0.05976148122030064, -0.09830552182044898, 0.07873928010437348, 0.020714325383086648, 0.23354771627813706, 0.02879347213699172, 0.07706619324172552, 0.22757941444850185, 0.18527943243791994, 0.04244973493859239, 0.10775182171974482, -0.163764446020588, -0.03408318158024205, -0.23195599254945087, -0.12537213317994186, -0.20553881138300475, 0.052135619899105284, -0.06479655163101185, -0.1438482282205652, 0.37956838557719547, 0.09234345176070133, 0.2689742132619374, -0.039093043866097674, 0.2299684323788358, 0.10838047817645945, 0.0905768081300064, 0.11180468822598584, 0.22688276221394602, 0.1929261095644747, 0.15164080085471654, -0.4029420681146539, 0.10478588596233127, -0.03552860888537083] |
1,802.0227 | Error correction in fast matrix multiplication and inverse | We present new algorithms to detect and correct errors in the product of two
matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms
do not require any additional information or encoding other than the original
inputs and the erroneous output. Their running time is softly linear in the
number of nonzero entries in these matrices when the number of errors is
sufficiently small, and they also incorporate fast matrix multiplication so
that the cost scales well when the number of errors is large. These algorithms
build on the recent result of Gasieniec et al (2017) on correcting matrix
products, as well as existing work on verification algorithms, sparse low-rank
linear algebra, and sparse polynomial interpolation.
| cs.SC cs.DS | we present new algorithms to detect and correct errors in the product of two matrices or the inverse of a matrix over an arbitrary field our algorithms do not require any additional information or encoding other than the original inputs and the erroneous output their running time is softly linear in the number of nonzero entries in these matrices when the number of errors is sufficiently small and they also incorporate fast matrix multiplication so that the cost scales well when the number of errors is large these algorithms build on the recent result of gasieniec et al 2017 on correcting matrix products as well as existing work on verification algorithms sparse lowrank linear algebra and sparse polynomial interpolation | [['we', 'present', 'new', 'algorithms', 'to', 'detect', 'and', 'correct', 'errors', 'in', 'the', 'product', 'of', 'two', 'matrices', 'or', 'the', 'inverse', 'of', 'a', 'matrix', 'over', 'an', 'arbitrary', 'field', 'our', 'algorithms', 'do', 'not', 'require', 'any', 'additional', 'information', 'or', 'encoding', 'other', 'than', 'the', 'original', 'inputs', 'and', 'the', 'erroneous', 'output', 'their', 'running', 'time', 'is', 'softly', 'linear', 'in', 'the', 'number', 'of', 'nonzero', 'entries', 'in', 'these', 'matrices', 'when', 'the', 'number', 'of', 'errors', 'is', 'sufficiently', 'small', 'and', 'they', 'also', 'incorporate', 'fast', 'matrix', 'multiplication', 'so', 'that', 'the', 'cost', 'scales', 'well', 'when', 'the', 'number', 'of', 'errors', 'is', 'large', 'these', 'algorithms', 'build', 'on', 'the', 'recent', 'result', 'of', 'gasieniec', 'et', 'al', '2017', 'on', 'correcting', 'matrix', 'products', 'as', 'well', 'as', 'existing', 'work', 'on', 'verification', 'algorithms', 'sparse', 'lowrank', 'linear', 'algebra', 'and', 'sparse', 'polynomial', 'interpolation']] | [-0.09803094187220206, 0.08882046414711885, -0.016144332035734246, 0.05455208327053819, -0.08903697211326671, -0.1414664894060678, 0.028066784209970917, 0.3809015623160771, -0.29911191861669556, -0.34648456188513577, 0.17768192465882748, -0.23234164090071385, -0.1759504196742753, 0.17570312986122993, -0.11510147713516064, 0.1257189739761608, 0.0812388916867746, 0.04540139513418955, -0.11776580238282415, -0.3248325825645393, 0.2877581244336535, 0.07658347834152084, 0.21490494130123525, -0.006230580229155657, 0.09417506748372141, 0.03269467664737755, -0.10509796496167653, 0.007569490282839367, -0.014462903347719918, 0.09070607244444057, 0.2530497961615001, 0.17758591287229367, 0.2722022250106856, -0.46196747150178213, -0.14364333761985093, 0.16064733567064582, 0.1284725929829566, 0.16094269962715252, -0.015750630618808714, -0.2577966636813739, 0.08154758052634341, -0.17159871060886428, -0.025571840712526703, -0.10314950216248506, 0.022010700508146037, 0.021214842315011917, -0.32999648074736865, 0.050624180101631056, 0.08511447768801228, 0.026173299593271828, 0.017686051441779156, -0.208535656767326, 0.062022925125622824, 0.11798219031609297, 0.02616539868494856, 0.014432581481054238, 0.10996309177903067, -0.09256850788271946, -0.11493277248237752, 0.32108442518202696, -0.03265830090706248, -0.2225356476866648, 0.17683038036652035, -0.09894534965053577, -0.14430539758813357, 0.1301365074302469, 0.2117014009849865, 0.09547954838380057, -0.06187286651072077, 0.12212093736772903, -0.07390431678626969, 0.20290446098690398, 0.04662909300825676, 0.048270221106989794, 0.10895764192237574, 0.06771541880042597, 0.09608416331485853, 0.05778232753177041, -0.030536365490592625, -0.03989225996711033, -0.2800650505129905, -0.12578396190411778, -0.23988351161677798, 0.009265516377998195, -0.14626569732458197, -0.2095230372325212, 0.3812483296330486, 0.14960388456933013, 0.2503177745839064, 0.11043425978497923, 0.33964135245803523, 0.08023702200920861, 0.09124494300902813, 0.13360188583287746, 0.18043650033249825, 0.13507684789003194, 0.07294297513457607, -0.185262816586383, 0.09016517682114475, 0.08342793210166968] |
1,802.02271 | Universal Deep Neural Network Compression | In this paper, we investigate lossy compression of deep neural networks
(DNNs) by weight quantization and lossless source coding for memory-efficient
deployment. Whereas the previous work addressed non-universal scalar
quantization and entropy coding of DNN weights, we for the first time introduce
universal DNN compression by universal vector quantization and universal source
coding. In particular, we examine universal randomized lattice quantization of
DNNs, which randomizes DNN weights by uniform random dithering before lattice
quantization and can perform near-optimally on any source without relying on
knowledge of its probability distribution. Moreover, we present a method of
fine-tuning vector quantized DNNs to recover the performance loss after
quantization. Our experimental results show that the proposed universal DNN
compression scheme compresses the 32-layer ResNet (trained on CIFAR-10) and the
AlexNet (trained on ImageNet) with compression ratios of $47.1$ and $42.5$,
respectively.
| cs.CV cs.LG cs.NE | in this paper we investigate lossy compression of deep neural networks dnns by weight quantization and lossless source coding for memoryefficient deployment whereas the previous work addressed nonuniversal scalar quantization and entropy coding of dnn weights we for the first time introduce universal dnn compression by universal vector quantization and universal source coding in particular we examine universal randomized lattice quantization of dnns which randomizes dnn weights by uniform random dithering before lattice quantization and can perform nearoptimally on any source without relying on knowledge of its probability distribution moreover we present a method of finetuning vector quantized dnns to recover the performance loss after quantization our experimental results show that the proposed universal dnn compression scheme compresses the 32layer resnet trained on cifar10 and the alexnet trained on imagenet with compression ratios of 471 and 425 respectively | [['in', 'this', 'paper', 'we', 'investigate', 'lossy', 'compression', 'of', 'deep', 'neural', 'networks', 'dnns', 'by', 'weight', 'quantization', 'and', 'lossless', 'source', 'coding', 'for', 'memoryefficient', 'deployment', 'whereas', 'the', 'previous', 'work', 'addressed', 'nonuniversal', 'scalar', 'quantization', 'and', 'entropy', 'coding', 'of', 'dnn', 'weights', 'we', 'for', 'the', 'first', 'time', 'introduce', 'universal', 'dnn', 'compression', 'by', 'universal', 'vector', 'quantization', 'and', 'universal', 'source', 'coding', 'in', 'particular', 'we', 'examine', 'universal', 'randomized', 'lattice', 'quantization', 'of', 'dnns', 'which', 'randomizes', 'dnn', 'weights', 'by', 'uniform', 'random', 'dithering', 'before', 'lattice', 'quantization', 'and', 'can', 'perform', 'nearoptimally', 'on', 'any', 'source', 'without', 'relying', 'on', 'knowledge', 'of', 'its', 'probability', 'distribution', 'moreover', 'we', 'present', 'a', 'method', 'of', 'finetuning', 'vector', 'quantized', 'dnns', 'to', 'recover', 'the', 'performance', 'loss', 'after', 'quantization', 'our', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'universal', 'dnn', 'compression', 'scheme', 'compresses', 'the', '32layer', 'resnet', 'trained', 'on', 'cifar10', 'and', 'the', 'alexnet', 'trained', 'on', 'imagenet', 'with', 'compression', 'ratios', 'of', '471', 'and', '425', 'respectively']] | [-0.09942142932635287, 0.06526367258671942, -0.02791410077876155, 0.029528496647759785, -0.07400055132482362, -0.24162959917515947, 0.11329931971546181, 0.4612192797569045, -0.2707803843482195, -0.2423764558836305, 0.05451091652756314, -0.19357838765448093, -0.22068982476206578, 0.16182662500068545, -0.13953502508609192, 0.15741450205889018, 0.1288953076886094, 0.05984584713165743, -0.11506853300733896, -0.36401112198127783, 0.31248620407237415, 0.11518498395204349, 0.39093473144854163, 0.012731707263467968, 0.1387293960319569, -0.013621442078990673, -0.013554233031860296, -0.07863950885940289, -0.07194972294915267, 0.13745961209887342, 0.2292399102943423, 0.14724687320193736, 0.24839980838199457, -0.401921969069087, -0.26205030308051064, 0.05702865712067949, 0.14640867855210882, 0.11990300913938605, -0.03810202291545769, -0.2936463855760361, 0.17712358525529018, -0.18419224251081925, 0.07841495388740863, -0.14576718921476192, -0.05113191065122036, -0.010866630530538227, -0.2754533582348444, 0.05674689680344654, 0.11307784917248088, 0.02502191294848487, -0.08741188268628532, -0.15242312534752747, 0.061270239714033684, 0.07375168806090411, -0.030236839647472338, 0.0898740018947401, 0.14561519813993812, -0.17970742856277208, -0.12837270244473484, 0.31367236309671315, -0.08109238563591371, -0.21040804742201083, 0.09370727752051923, 0.01858874034150031, -0.1422477307445977, 0.05431299081976539, 0.23336788021328359, 0.05623632773379053, -0.09047973302422442, 0.032165672887366374, -0.035716135351770165, 0.21367039622830064, 0.13465348403711896, 0.032589988516427686, 0.10377731855513285, 0.18948563854918693, 0.004817523811336445, 0.21239001032781613, -0.16513814666119497, -0.10395723729448365, -0.2630099224979463, -0.06255800969412793, -0.24608114688400773, 0.07423084078228398, -0.1760007282004074, -0.1421589441023821, 0.38369193889016256, 0.1687334856605562, 0.24481690736470424, 0.1855806274739418, 0.34214312791743356, 0.05070879381652786, 0.11546817062881545, 0.15856343335168355, 0.20512357589694252, 0.09139549307207968, 0.10310489376770683, -0.176652252468267, 0.04204944870708868, 0.0859275055607187] |
1,802.02272 | Quantum Phase Transitions in Proximitized Josephson Junctions | We study fermion-parity-changing quantum phase transitions (QPTs) in platform
Josephson junctions. These QPTs, associated with zero-energy bound states, are
rather widely observed experimentally. They emerge from numerical calculations
frequently without detailed microscopic insight. Importantly, they may
incorrectly lend support to claims for the observations of Majorana zero modes.
In this paper we present a fully consistent solution of the Bogoliubov-de
Gennes equations for a multi-component Josephson junction. This provides
insights into the origin of the QPTs. It also makes it possible to assess the
standard self energy approximations which are widely used to understand
proximity coupling in topological systems. The junctions we consider are
complex and chosen to mirror experiments. Our full proximity calculations
associate the mechanism behind the QPT as deriving from a spatially extended,
proximity-induced magnetic "defect". This defect arises because of the
insulating region which effects a local reorganization of the bulk
magnetization in the proximitized superconductor. Our results suggest more
generally that QPTs in Josephson junctions generally do not require the
existence of spin-orbit coupling and should not be confused with, nor are they
indicators of, Majorana physics.
| cond-mat.supr-con | we study fermionparitychanging quantum phase transitions qpts in platform josephson junctions these qpts associated with zeroenergy bound states are rather widely observed experimentally they emerge from numerical calculations frequently without detailed microscopic insight importantly they may incorrectly lend support to claims for the observations of majorana zero modes in this paper we present a fully consistent solution of the bogoliubovde gennes equations for a multicomponent josephson junction this provides insights into the origin of the qpts it also makes it possible to assess the standard self energy approximations which are widely used to understand proximity coupling in topological systems the junctions we consider are complex and chosen to mirror experiments our full proximity calculations associate the mechanism behind the qpt as deriving from a spatially extended proximityinduced magnetic defect this defect arises because of the insulating region which effects a local reorganization of the bulk magnetization in the proximitized superconductor our results suggest more generally that qpts in josephson junctions generally do not require the existence of spinorbit coupling and should not be confused with nor are they indicators of majorana physics | [['we', 'study', 'fermionparitychanging', 'quantum', 'phase', 'transitions', 'qpts', 'in', 'platform', 'josephson', 'junctions', 'these', 'qpts', 'associated', 'with', 'zeroenergy', 'bound', 'states', 'are', 'rather', 'widely', 'observed', 'experimentally', 'they', 'emerge', 'from', 'numerical', 'calculations', 'frequently', 'without', 'detailed', 'microscopic', 'insight', 'importantly', 'they', 'may', 'incorrectly', 'lend', 'support', 'to', 'claims', 'for', 'the', 'observations', 'of', 'majorana', 'zero', 'modes', 'in', 'this', 'paper', 'we', 'present', 'a', 'fully', 'consistent', 'solution', 'of', 'the', 'bogoliubovde', 'gennes', 'equations', 'for', 'a', 'multicomponent', 'josephson', 'junction', 'this', 'provides', 'insights', 'into', 'the', 'origin', 'of', 'the', 'qpts', 'it', 'also', 'makes', 'it', 'possible', 'to', 'assess', 'the', 'standard', 'self', 'energy', 'approximations', 'which', 'are', 'widely', 'used', 'to', 'understand', 'proximity', 'coupling', 'in', 'topological', 'systems', 'the', 'junctions', 'we', 'consider', 'are', 'complex', 'and', 'chosen', 'to', 'mirror', 'experiments', 'our', 'full', 'proximity', 'calculations', 'associate', 'the', 'mechanism', 'behind', 'the', 'qpt', 'as', 'deriving', 'from', 'a', 'spatially', 'extended', 'proximityinduced', 'magnetic', 'defect', 'this', 'defect', 'arises', 'because', 'of', 'the', 'insulating', 'region', 'which', 'effects', 'a', 'local', 'reorganization', 'of', 'the', 'bulk', 'magnetization', 'in', 'the', 'proximitized', 'superconductor', 'our', 'results', 'suggest', 'more', 'generally', 'that', 'qpts', 'in', 'josephson', 'junctions', 'generally', 'do', 'not', 'require', 'the', 'existence', 'of', 'spinorbit', 'coupling', 'and', 'should', 'not', 'be', 'confused', 'with', 'nor', 'are', 'they', 'indicators', 'of', 'majorana', 'physics']] | [-0.19094344387950057, 0.14842965638069489, -0.09333079169087564, 0.12123847280008955, -0.0954105438489611, -0.18365717751812705, 0.0806317985069408, 0.36864635130153833, -0.215836758213375, -0.29127434999051693, 0.021393881664992162, -0.2806962296850362, -0.15863526709640183, 0.1735978850622749, 0.016481122849554143, 0.011022022102048713, 0.004769964751437594, -0.03896595543129524, -0.08114052318436614, -0.18468198343566028, 0.3180773172846568, 0.0039409932735741384, 0.31653810100300617, 0.07703407930251396, -0.032402603398205825, -0.0818695692353218, 0.07353275037693498, 0.0188340825266372, -0.15838565848381367, 0.0515826827938442, 0.30792085697246685, -0.04393059994963651, 0.1954964062312196, -0.5278419107301624, -0.22531590055036282, 0.06881464163300668, 0.19180918868003383, 0.18438998782024488, -0.02688597164604651, -0.34080910261766084, 0.06368619701870105, -0.13723090816757422, -0.13812609506225554, -0.12460615971120517, -0.04837448586766397, -0.027239483808172423, -0.2207916624746311, 0.07006340698343547, 0.05443647327428962, 0.03881740956160418, -0.04374527400719691, -0.06391973131257804, -0.061807686949241394, 0.0716455146485106, 0.009292873405357463, -0.01584952136177508, 0.12107100599903346, -0.09979743124448916, -0.1341745600796392, 0.3580323547036104, -0.012433628747188254, -0.15758146422025002, 0.22869051400139845, -0.13990898039809413, -0.11185605244618424, 0.12174179014178682, 0.0962050113066753, 0.07537497346191693, -0.16294857305191582, 0.05109282753504916, -0.02466925880125626, 0.16794149636983027, -0.02098729085043402, 0.10317922978872918, 0.2997678425780482, 0.16398101229251502, 0.022672350573718796, 0.10037162001128952, -0.07717511360565694, -0.1262508225759095, -0.30798875899645833, -0.15632654437943214, -0.20192380347263417, 0.06573165700277597, -0.01377256845239195, -0.21566186826779038, 0.384217858937111, 0.2097639414663195, 0.17331800770364414, -0.03251114165158273, 0.24585071495651828, 0.12572838447393736, 0.08811196479792012, 0.018053173709490968, 0.2641024001904902, 0.16242120554284784, 0.0952148076471003, -0.26620659664870133, 0.07268190268975122, 0.009827877699721667] |
1,802.02273 | Why is Interstellar Object 1I/2017 U1 (`Oumuamua) Rocky, Tumbling and
Very Prolate? | The recently discovered first interstellar object 1I/2017 U1 (`Oumuamua) has
brightness that varies by a factor of 10, a range greater than that of any
Solar System asteroid, a spectrum characteristic of Type D asteroids, and no
evidence of evaporating volatiles, contrary to expectation for exo-Oort clouds.
This object was the first example of the proposed "Jurads", objects depleted in
volatiles and ejected from planetary systems during the post-main sequence
evolution of their parent star. I suggest that heating by the star's giant
stage fluidized a precursor cometary object as volatiles escaped, causing it to
assume the Jacobi ellipsoidal shape of a self-gravitating incompressible
liquid. The collision that produced the inferred tumbling motion must have
occurred thousands of years after the formation of 1I/2017 U1 `Oumuamua. Jacobi
ellipsoids have a unique relation among rotation rate, density and axial ratio.
The inferred axial ratio $\gtrapprox 5$ implies a lower bound on the density of
1.6 g/cm$^3$, excluding an icy interior unless it is almost entirely frozen
CO$_2$. This object is the first Jurad to be discovered and may be related to
accreting objects that pollute white dwarf atmospheres and may make Soft Gamma
Repeaters.
| astro-ph.EP astro-ph.HE | the recently discovered first interstellar object 1i2017 u1 oumuamua has brightness that varies by a factor of 10 a range greater than that of any solar system asteroid a spectrum characteristic of type d asteroids and no evidence of evaporating volatiles contrary to expectation for exooort clouds this object was the first example of the proposed jurads objects depleted in volatiles and ejected from planetary systems during the postmain sequence evolution of their parent star i suggest that heating by the stars giant stage fluidized a precursor cometary object as volatiles escaped causing it to assume the jacobi ellipsoidal shape of a selfgravitating incompressible liquid the collision that produced the inferred tumbling motion must have occurred thousands of years after the formation of 1i2017 u1 oumuamua jacobi ellipsoids have a unique relation among rotation rate density and axial ratio the inferred axial ratio gtrapprox 5 implies a lower bound on the density of 16 gcm3 excluding an icy interior unless it is almost entirely frozen co_2 this object is the first jurad to be discovered and may be related to accreting objects that pollute white dwarf atmospheres and may make soft gamma repeaters | [['the', 'recently', 'discovered', 'first', 'interstellar', 'object', '1i2017', 'u1', 'oumuamua', 'has', 'brightness', 'that', 'varies', 'by', 'a', 'factor', 'of', '10', 'a', 'range', 'greater', 'than', 'that', 'of', 'any', 'solar', 'system', 'asteroid', 'a', 'spectrum', 'characteristic', 'of', 'type', 'd', 'asteroids', 'and', 'no', 'evidence', 'of', 'evaporating', 'volatiles', 'contrary', 'to', 'expectation', 'for', 'exooort', 'clouds', 'this', 'object', 'was', 'the', 'first', 'example', 'of', 'the', 'proposed', 'jurads', 'objects', 'depleted', 'in', 'volatiles', 'and', 'ejected', 'from', 'planetary', 'systems', 'during', 'the', 'postmain', 'sequence', 'evolution', 'of', 'their', 'parent', 'star', 'i', 'suggest', 'that', 'heating', 'by', 'the', 'stars', 'giant', 'stage', 'fluidized', 'a', 'precursor', 'cometary', 'object', 'as', 'volatiles', 'escaped', 'causing', 'it', 'to', 'assume', 'the', 'jacobi', 'ellipsoidal', 'shape', 'of', 'a', 'selfgravitating', 'incompressible', 'liquid', 'the', 'collision', 'that', 'produced', 'the', 'inferred', 'tumbling', 'motion', 'must', 'have', 'occurred', 'thousands', 'of', 'years', 'after', 'the', 'formation', 'of', '1i2017', 'u1', 'oumuamua', 'jacobi', 'ellipsoids', 'have', 'a', 'unique', 'relation', 'among', 'rotation', 'rate', 'density', 'and', 'axial', 'ratio', 'the', 'inferred', 'axial', 'ratio', 'gtrapprox', '5', 'implies', 'a', 'lower', 'bound', 'on', 'the', 'density', 'of', '16', 'gcm3', 'excluding', 'an', 'icy', 'interior', 'unless', 'it', 'is', 'almost', 'entirely', 'frozen', 'co_2', 'this', 'object', 'is', 'the', 'first', 'jurad', 'to', 'be', 'discovered', 'and', 'may', 'be', 'related', 'to', 'accreting', 'objects', 'that', 'pollute', 'white', 'dwarf', 'atmospheres', 'and', 'may', 'make', 'soft', 'gamma', 'repeaters']] | [-0.11700409005215655, 0.20611731417750492, -0.09584430463524311, 0.04865047145215551, -0.06817833108203339, -0.05672087473124363, 0.027472865724502162, 0.34512100380196853, -0.18027155245203252, -0.34308379235633535, 0.084278153027932, -0.2648985605706407, -0.08958736948269122, 0.1394438574514815, -0.0869537677069765, -0.005672099164453047, 0.09471267883797513, -0.007983001742904509, -0.05045916834914403, -0.24707506617521427, 0.2648905156879974, 0.05484457444326455, 0.10199971165976131, -0.026200165555212665, 0.08662530119958729, -0.112155168267279, 0.0060269066110662925, -0.06541586425447964, -0.14659099354679453, 0.04642047876058176, 0.17815747416909802, 0.1268662473806107, 0.18145220570207735, -0.4019093784376862, -0.25757265056322537, 0.10364622659923348, 0.1807553575798401, 0.022045866815441566, -0.0837762757766436, -0.28308231170966985, 0.0872579637987427, -0.24416834076181423, -0.20438618483588694, 0.04754453921064013, 0.14529069799549527, -0.01455113519222661, -0.21578577052892053, 0.1007209534717831, 0.11553290179297962, 0.07304841859744013, -0.15978105647577198, -0.13844741555845064, -0.09254780115501185, 0.07017722461099556, 0.0896134935636366, 0.0576974685247183, 0.24226045866462728, -0.11812949693074246, -0.008220638945718242, 0.42121868668378853, -0.07390656768192272, -0.0378384878157994, 0.2263688502799115, -0.19615604861637, -0.16303656802205516, 0.2425287482889457, 0.14862730325515386, 0.13732947081971075, -0.15845983205230588, -0.007674155133613019, -0.06565192940581531, 0.19186508228895083, 0.1222011595135506, 0.018072004453766683, 0.3559708227574123, 0.13267411231136447, 0.03157952817703027, 0.09673212381221198, -0.19140563295125299, -0.042550405487418175, -0.20325091812291537, -0.16756872314970736, -0.17810681474447515, 0.09486666210641821, -0.09895162230882616, -0.12588519397001538, 0.28245301708196296, 0.10001809486061218, 0.19577187217993866, -0.01429825370731466, 0.2583776243464992, 0.0469700860033904, 0.09746338350269261, 0.12904492608778648, 0.3185479591493324, 0.14193893796934975, 0.08622037098348062, -0.21975994474956698, 0.14972050323672786, 0.04069121407237664] |
1,802.02274 | A Critical Investigation of Deep Reinforcement Learning for Navigation | The navigation problem is classically approached in two steps: an exploration
step, where map-information about the environment is gathered; and an
exploitation step, where this information is used to navigate efficiently. Deep
reinforcement learning (DRL) algorithms, alternatively, approach the problem of
navigation in an end-to-end fashion. Inspired by the classical approach, we ask
whether DRL algorithms are able to inherently explore, gather and exploit
map-information over the course of navigation. We build upon Mirowski et al.
[2017] work and introduce a systematic suite of experiments that vary three
parameters: the agent's starting location, the agent's target location, and the
maze structure. We choose evaluation metrics that explicitly measure the
algorithm's ability to gather and exploit map-information. Our experiments show
that when trained and tested on the same maps, the algorithm successfully
gathers and exploits map-information. However, when trained and tested on
different sets of maps, the algorithm fails to transfer the ability to gather
and exploit map-information to unseen maps. Furthermore, we find that when the
goal location is randomized and the map is kept static, the algorithm is able
to gather and exploit map-information but the exploitation is far from optimal.
We open-source our experimental suite in the hopes that it serves as a
framework for the comparison of future algorithms and leads to the discovery of
robust alternatives to classical navigation methods.
| cs.RO cs.AI | the navigation problem is classically approached in two steps an exploration step where mapinformation about the environment is gathered and an exploitation step where this information is used to navigate efficiently deep reinforcement learning drl algorithms alternatively approach the problem of navigation in an endtoend fashion inspired by the classical approach we ask whether drl algorithms are able to inherently explore gather and exploit mapinformation over the course of navigation we build upon mirowski et al 2017 work and introduce a systematic suite of experiments that vary three parameters the agents starting location the agents target location and the maze structure we choose evaluation metrics that explicitly measure the algorithms ability to gather and exploit mapinformation our experiments show that when trained and tested on the same maps the algorithm successfully gathers and exploits mapinformation however when trained and tested on different sets of maps the algorithm fails to transfer the ability to gather and exploit mapinformation to unseen maps furthermore we find that when the goal location is randomized and the map is kept static the algorithm is able to gather and exploit mapinformation but the exploitation is far from optimal we opensource our experimental suite in the hopes that it serves as a framework for the comparison of future algorithms and leads to the discovery of robust alternatives to classical navigation methods | [['the', 'navigation', 'problem', 'is', 'classically', 'approached', 'in', 'two', 'steps', 'an', 'exploration', 'step', 'where', 'mapinformation', 'about', 'the', 'environment', 'is', 'gathered', 'and', 'an', 'exploitation', 'step', 'where', 'this', 'information', 'is', 'used', 'to', 'navigate', 'efficiently', 'deep', 'reinforcement', 'learning', 'drl', 'algorithms', 'alternatively', 'approach', 'the', 'problem', 'of', 'navigation', 'in', 'an', 'endtoend', 'fashion', 'inspired', 'by', 'the', 'classical', 'approach', 'we', 'ask', 'whether', 'drl', 'algorithms', 'are', 'able', 'to', 'inherently', 'explore', 'gather', 'and', 'exploit', 'mapinformation', 'over', 'the', 'course', 'of', 'navigation', 'we', 'build', 'upon', 'mirowski', 'et', 'al', '2017', 'work', 'and', 'introduce', 'a', 'systematic', 'suite', 'of', 'experiments', 'that', 'vary', 'three', 'parameters', 'the', 'agents', 'starting', 'location', 'the', 'agents', 'target', 'location', 'and', 'the', 'maze', 'structure', 'we', 'choose', 'evaluation', 'metrics', 'that', 'explicitly', 'measure', 'the', 'algorithms', 'ability', 'to', 'gather', 'and', 'exploit', 'mapinformation', 'our', 'experiments', 'show', 'that', 'when', 'trained', 'and', 'tested', 'on', 'the', 'same', 'maps', 'the', 'algorithm', 'successfully', 'gathers', 'and', 'exploits', 'mapinformation', 'however', 'when', 'trained', 'and', 'tested', 'on', 'different', 'sets', 'of', 'maps', 'the', 'algorithm', 'fails', 'to', 'transfer', 'the', 'ability', 'to', 'gather', 'and', 'exploit', 'mapinformation', 'to', 'unseen', 'maps', 'furthermore', 'we', 'find', 'that', 'when', 'the', 'goal', 'location', 'is', 'randomized', 'and', 'the', 'map', 'is', 'kept', 'static', 'the', 'algorithm', 'is', 'able', 'to', 'gather', 'and', 'exploit', 'mapinformation', 'but', 'the', 'exploitation', 'is', 'far', 'from', 'optimal', 'we', 'opensource', 'our', 'experimental', 'suite', 'in', 'the', 'hopes', 'that', 'it', 'serves', 'as', 'a', 'framework', 'for', 'the', 'comparison', 'of', 'future', 'algorithms', 'and', 'leads', 'to', 'the', 'discovery', 'of', 'robust', 'alternatives', 'to', 'classical', 'navigation', 'methods']] | [-0.04043298048664703, 0.006385443577291799, -0.10583410288036003, 0.06579721643695934, -0.12820273074384095, -0.15827450114030875, 0.060832470896624594, 0.4384002907727866, -0.29332352424825586, -0.3538613053949157, 0.08291202778729606, -0.26496716254628827, -0.19958580197137885, 0.19203604133841434, -0.09774763343413047, 0.07562311448004397, 0.0854975961100711, 0.024710662571103582, -0.03519780606119121, -0.30043174228850217, 0.2988143316052453, 0.07788729369773471, 0.2945863332332116, 0.006745155681459225, 0.15720231684380015, -0.005405382958247071, -0.03682269773241383, 0.0012570704341836841, -0.12001028220914331, 0.1404153777692559, 0.2985800414642678, 0.22820708643636695, 0.3040599718078085, -0.4148786121670307, -0.1729533643797959, 0.11289211517959967, 0.13348091940130336, 0.12310744094821069, -0.02382910681675468, -0.3239857263094641, 0.08667541084724432, -0.12130859043582806, -0.06096584133432151, -0.12410270629843254, -0.024390824448166943, -0.014495724207103553, -0.2855284454944677, -0.05159227853518756, 0.052272153519210926, 0.021343861276392446, -0.06773360447922613, -0.05351578756005842, 0.04137489690775294, 0.2223445109890162, 0.00998260883766857, 0.0661492333491646, 0.14971288900421473, -0.11623473272052272, -0.15583765506144037, 0.37580030957746396, -0.01910438948293162, -0.17911651900931858, 0.22581733966683717, -0.04921521116444849, -0.1321820410713971, 0.06718632055763907, 0.2308244904912507, 0.13759811609438433, -0.14907097316266407, 0.055416236718231184, -0.030036493367411096, 0.19281396668377196, 0.01691114595118125, -0.04550765567269143, 0.16281392687676902, 0.19134497531531003, 0.11367190463652191, 0.11836085251152449, -0.09769686250195676, -0.11430543660256184, -0.214151140618777, -0.12331789277594185, -0.19371233453489672, -0.02274293658812217, -0.04220794513952112, -0.09579810271490649, 0.35568954123000324, 0.2751099793089036, 0.22218531953805698, 0.08927769191989116, 0.3404105320330626, 0.010500087833445469, 0.058299917742848026, 0.12452695338523241, 0.22141834961108428, 0.0177769378347598, 0.1273609370994486, -0.19363667606793744, 0.09257891260070784, 0.033284152793226086] |
1,802.02275 | Orthogonal abelian Cartan subalgebra decomposition of $\mathfrak{sl}_n$
over a finite commutative ring | Orthogonal decomposition of the special linear Lie algebra over the complex
numbers was studied in the early 1980s and attracted further attentions in the
past decade due to its application in quantum information theory. In this
paper, we study this decomposition problem of the special linear Lie algebra
over a finite commutative ring with identity.
| math.RA | orthogonal decomposition of the special linear lie algebra over the complex numbers was studied in the early 1980s and attracted further attentions in the past decade due to its application in quantum information theory in this paper we study this decomposition problem of the special linear lie algebra over a finite commutative ring with identity | [['orthogonal', 'decomposition', 'of', 'the', 'special', 'linear', 'lie', 'algebra', 'over', 'the', 'complex', 'numbers', 'was', 'studied', 'in', 'the', 'early', '1980s', 'and', 'attracted', 'further', 'attentions', 'in', 'the', 'past', 'decade', 'due', 'to', 'its', 'application', 'in', 'quantum', 'information', 'theory', 'in', 'this', 'paper', 'we', 'study', 'this', 'decomposition', 'problem', 'of', 'the', 'special', 'linear', 'lie', 'algebra', 'over', 'a', 'finite', 'commutative', 'ring', 'with', 'identity']] | [-0.14519090241837232, 0.028600816407494924, -0.07687261549925262, -0.02119680804369802, -0.1576046884906563, -0.0925696234811436, -0.049282471560449764, 0.3513351450250907, -0.3654387425292622, -0.20377767597409813, 0.168129483779723, -0.19258444672450423, -0.19983313483270732, 0.1718118493360552, -0.13477484753186053, 0.009080250864975494, 0.04518619481982155, 0.12214988414198161, -0.14465354933318766, -0.3023728528398682, 0.3168297111395408, 0.05795124202585694, 0.2853929911697791, 0.016350128654051912, 0.08739958787336946, 0.08027495853814551, -0.07334714208475568, 0.012037472816353494, -0.11554237266748467, 0.1202502441317351, 0.3555257028138096, 0.09124140231446787, 0.330921989611604, -0.41845933605324137, -0.17196177808059887, 0.19019949451427567, 0.16143507415598088, 0.07062143087387085, -0.067430108260702, -0.2399090945890004, 0.08975479721345685, -0.27144424136389383, -0.10207578845491463, 0.008453981324353002, 0.08639261377128687, -0.06218280757100068, -0.1797347559000958, 0.019243113899772818, 0.06962435621217909, 0.1533994902009991, -0.05533739159264686, -0.08348610481585969, 0.012431883524087342, 0.0648972946557809, 0.0038243529810146853, 0.02172241562511772, 0.054392520871690726, -0.09096648841249672, -0.14999089028516954, 0.3751595225523819, -0.018932463290085168, -0.16545272218910131, 0.13749841734428297, -0.2080547142096541, -0.18482972126962108, 0.10153248264792968, 0.17249806848439303, 0.14629887532950803, -0.0574671223251657, 0.24019170311935753, -0.1315174954350699, -0.0010243992913853037, 0.10645713606341319, 0.03964774935421619, 0.16909985356456178, 0.12190744907341221, 0.026979017588415775, 0.16164816580712796, 0.0365227818150412, -0.142594143578952, -0.22014840611002662, -0.17295804049142383, -0.1376532470299439, 0.10647536737167022, -0.06553588391847866, -0.14671463021500544, 0.4663577049631964, 0.10812434037639336, 0.1632385771298273, 0.0010657474567944353, 0.2598574034192345, 0.12190224579112097, 0.11017156605693428, 0.017479432564736767, 0.17441623817113314, 0.29519776519049296, 0.11105222025970844, -0.14996206479316407, -0.040238688056441874, 0.12218182540752671] |
1,802.02276 | Twelve Inequivalent Dirac Cones in Two-Dimensional ZrB2 | Theoretical evidence of the existence of 12 inequivalent Dirac cones at the
vicinity of the Fermi energy in monolayered ZrB$_2$ is presented.
Two-dimensional ZrB$_2$ is a mechanically stable d- and p-orbital compound
exhibiting a unique electronic structure with two Dirac cones out of
high-symmetry points in the irreducible Brillouin zone with a small
electron-pocket compensation. First-principles calculations demonstrate that
while one of the cones is insensitive to lattice expansion, the second cone
vanishes for small perturbation of the vertical Zr position. Internal symmetry
breaking with external physical stimuli, along with the relativistic effect of
SOC, is able to remove selectively the Dirac cones. A rational explanation in
terms of d- and p-orbital mixing is provided to elucidate the origin of the
infrequent amount of Dirac cones in a flat structure. The versatility of
transition metal d-orbitals combined with the honeycomb lattice provided by the
B atoms yields novel features never observed in a two-dimensional material.
| cond-mat.mtrl-sci | theoretical evidence of the existence of 12 inequivalent dirac cones at the vicinity of the fermi energy in monolayered zrb_2 is presented twodimensional zrb_2 is a mechanically stable d and porbital compound exhibiting a unique electronic structure with two dirac cones out of highsymmetry points in the irreducible brillouin zone with a small electronpocket compensation firstprinciples calculations demonstrate that while one of the cones is insensitive to lattice expansion the second cone vanishes for small perturbation of the vertical zr position internal symmetry breaking with external physical stimuli along with the relativistic effect of soc is able to remove selectively the dirac cones a rational explanation in terms of d and porbital mixing is provided to elucidate the origin of the infrequent amount of dirac cones in a flat structure the versatility of transition metal dorbitals combined with the honeycomb lattice provided by the b atoms yields novel features never observed in a twodimensional material | [['theoretical', 'evidence', 'of', 'the', 'existence', 'of', '12', 'inequivalent', 'dirac', 'cones', 'at', 'the', 'vicinity', 'of', 'the', 'fermi', 'energy', 'in', 'monolayered', 'zrb_2', 'is', 'presented', 'twodimensional', 'zrb_2', 'is', 'a', 'mechanically', 'stable', 'd', 'and', 'porbital', 'compound', 'exhibiting', 'a', 'unique', 'electronic', 'structure', 'with', 'two', 'dirac', 'cones', 'out', 'of', 'highsymmetry', 'points', 'in', 'the', 'irreducible', 'brillouin', 'zone', 'with', 'a', 'small', 'electronpocket', 'compensation', 'firstprinciples', 'calculations', 'demonstrate', 'that', 'while', 'one', 'of', 'the', 'cones', 'is', 'insensitive', 'to', 'lattice', 'expansion', 'the', 'second', 'cone', 'vanishes', 'for', 'small', 'perturbation', 'of', 'the', 'vertical', 'zr', 'position', 'internal', 'symmetry', 'breaking', 'with', 'external', 'physical', 'stimuli', 'along', 'with', 'the', 'relativistic', 'effect', 'of', 'soc', 'is', 'able', 'to', 'remove', 'selectively', 'the', 'dirac', 'cones', 'a', 'rational', 'explanation', 'in', 'terms', 'of', 'd', 'and', 'porbital', 'mixing', 'is', 'provided', 'to', 'elucidate', 'the', 'origin', 'of', 'the', 'infrequent', 'amount', 'of', 'dirac', 'cones', 'in', 'a', 'flat', 'structure', 'the', 'versatility', 'of', 'transition', 'metal', 'dorbitals', 'combined', 'with', 'the', 'honeycomb', 'lattice', 'provided', 'by', 'the', 'b', 'atoms', 'yields', 'novel', 'features', 'never', 'observed', 'in', 'a', 'twodimensional', 'material']] | [-0.20469679876470998, 0.1781121917189129, -0.040161690674722195, 0.006113299906944796, -0.06119663496651957, -0.14617705939397696, 0.10743264757216939, 0.37053388428664014, -0.2792186335510304, -0.22285514021097053, -0.02011823437079006, -0.338770142762411, -0.13656779838305327, 0.09782826071680192, 0.041281183126322445, 0.0006497097201645374, 0.004532334736488279, -0.038489751577858, -0.13279910938243472, -0.20423788333071335, 0.3250731933869482, 0.04806637674900553, 0.2824724885965547, 0.06746347609366621, 0.07028882658830093, -0.01576972509539055, 0.09089442987235323, 0.008557086173565157, -0.10299543360301722, 0.10643023524072863, 0.21553006014606405, -0.09230191924519116, 0.21113937444564315, -0.4117032394263773, -0.18682329047831797, -0.0016254574225674713, 0.11339793304702447, 0.11212191676285359, -0.09344781776589732, -0.28358285061774713, 0.07253221925047616, -0.09351432459849504, -0.22937786632683127, -0.09879369654602581, -0.00924236182538387, -0.0436875460372727, -0.20459165955168915, 0.05897636485413738, 0.05802873684273612, 0.10121087010592154, -0.083827304311337, -0.122813640920926, -0.164669296346725, 0.04033038297728185, 0.051500881149343425, 0.014753989307510276, 0.09202433391474188, -0.07278722158723301, -0.09743134752666999, 0.4791097120171593, -0.052429778465340214, -0.15930021912340195, 0.16658665347513893, -0.2136772066234581, -0.06959079471566985, 0.22041596375375747, 0.10930209883278416, 0.08130200859459658, -0.09677171550706148, 0.12493662221822888, -0.06852210564482507, 0.10585003159189176, 0.06534287041623986, 0.05650664167178254, 0.2670211806893349, 0.15227724942979554, 0.06148422458960164, 0.10347291541195684, -0.11679496196729522, -0.07526873008408133, -0.29283549940634157, -0.16906188799428842, -0.22547474780810936, 0.07015311294685929, -0.0686645892461867, -0.19939332259818912, 0.41433062640829915, 0.07561794455133138, 0.2324508278780887, -0.07398869765531872, 0.2104986207199193, 0.06601516324425898, 0.05898388789613701, 0.05464818915652652, 0.2645972571891522, 0.14738248978861637, 0.03931442386350564, -0.26342633878981186, 0.023223059657480446, 0.06767687260984413] |
1,802.02277 | From Game-theoretic Multi-agent Log Linear Learning to Reinforcement
Learning | The main focus of this paper is on enhancement of two types of game-theoretic
learning algorithms: log-linear learning and reinforcement learning. The
standard analysis of log-linear learning needs a highly structured environment,
i.e. strong assumptions about the game from an implementation perspective. In
this paper, we introduce a variant of log-linear learning that provides
asymptotic guarantees while relaxing the structural assumptions to include
synchronous updates and limitations in information available to the players. On
the other hand, model-free reinforcement learning is able to perform even under
weaker assumptions on players' knowledge about the environment and other
players' strategies. We propose a reinforcement algorithm that uses a
double-aggregation scheme in order to deepen players' insight about the
environment and constant learning step-size which achieves a higher convergence
rate. Numerical experiments are conducted to verify each algorithm's robustness
and performance.
| cs.LG cs.MA | the main focus of this paper is on enhancement of two types of gametheoretic learning algorithms loglinear learning and reinforcement learning the standard analysis of loglinear learning needs a highly structured environment ie strong assumptions about the game from an implementation perspective in this paper we introduce a variant of loglinear learning that provides asymptotic guarantees while relaxing the structural assumptions to include synchronous updates and limitations in information available to the players on the other hand modelfree reinforcement learning is able to perform even under weaker assumptions on players knowledge about the environment and other players strategies we propose a reinforcement algorithm that uses a doubleaggregation scheme in order to deepen players insight about the environment and constant learning stepsize which achieves a higher convergence rate numerical experiments are conducted to verify each algorithms robustness and performance | [['the', 'main', 'focus', 'of', 'this', 'paper', 'is', 'on', 'enhancement', 'of', 'two', 'types', 'of', 'gametheoretic', 'learning', 'algorithms', 'loglinear', 'learning', 'and', 'reinforcement', 'learning', 'the', 'standard', 'analysis', 'of', 'loglinear', 'learning', 'needs', 'a', 'highly', 'structured', 'environment', 'ie', 'strong', 'assumptions', 'about', 'the', 'game', 'from', 'an', 'implementation', 'perspective', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'variant', 'of', 'loglinear', 'learning', 'that', 'provides', 'asymptotic', 'guarantees', 'while', 'relaxing', 'the', 'structural', 'assumptions', 'to', 'include', 'synchronous', 'updates', 'and', 'limitations', 'in', 'information', 'available', 'to', 'the', 'players', 'on', 'the', 'other', 'hand', 'modelfree', 'reinforcement', 'learning', 'is', 'able', 'to', 'perform', 'even', 'under', 'weaker', 'assumptions', 'on', 'players', 'knowledge', 'about', 'the', 'environment', 'and', 'other', 'players', 'strategies', 'we', 'propose', 'a', 'reinforcement', 'algorithm', 'that', 'uses', 'a', 'doubleaggregation', 'scheme', 'in', 'order', 'to', 'deepen', 'players', 'insight', 'about', 'the', 'environment', 'and', 'constant', 'learning', 'stepsize', 'which', 'achieves', 'a', 'higher', 'convergence', 'rate', 'numerical', 'experiments', 'are', 'conducted', 'to', 'verify', 'each', 'algorithms', 'robustness', 'and', 'performance']] | [-0.05726492718154442, -0.02330364427182154, -0.13105625380170496, 0.07528361155104273, -0.1624524718028133, -0.2221112351925758, 0.10009925022048291, 0.46152467014145676, -0.26100367230845845, -0.31531841182115955, 0.08283783310776183, -0.22275343019324934, -0.1726994694620167, 0.1545960075446289, -0.15973103325389135, 0.04778352274430277, 0.10488384945001997, 0.05031890002670732, -0.06537851602872358, -0.3128030775896661, 0.32607430785241787, 0.047591932743352695, 0.3073845274583267, 0.0009272211672309922, 0.14993759477511048, -0.001601607746097946, -0.002630184567703383, -0.001565326793785513, -0.12943868614772733, 0.1775890381575093, 0.2721770720889479, 0.21696298056533628, 0.41991096489593716, -0.4166582327261295, -0.1707172427805698, 0.12450330166730784, 0.11897457732834316, 0.0969788818305739, -0.041664830595084947, -0.2985270708564832, 0.09140896376555473, -0.1504653130868708, -0.0063862117214713, -0.1381415550828143, -0.0913820966762103, 0.016172922637405378, -0.33729342586721167, -0.02327279126387171, 0.12651915706517378, 0.06087071890432904, -0.028515577409756337, -0.13137884173936543, 0.09385363604825833, 0.13742031214459643, 0.08638022450838972, -0.0006549078639746256, 0.18963726699338668, -0.16883755327426714, -0.1874089341297963, 0.35065847262740135, -0.05601136486409708, -0.1803818101566421, 0.23208509223114182, -0.03755176244609493, -0.17840483694942327, 0.06875352219578192, 0.2509569570041486, 0.11974205853023233, -0.1556784522508944, 0.05758484067645155, -0.03944542658019022, 0.21555679421328064, 0.007328032395278994, 0.02231136924607584, 0.09114175829798472, 0.24669583270965267, 0.11830406071767754, 0.11474325386790328, -0.017918275165317212, -0.17386600699778781, -0.2414821366045325, -0.0987714305961926, -0.1434946858721792, -0.013356371139461705, -0.14363527322733133, -0.09514889224384823, 0.35301917889520307, 0.23207316039143688, 0.16266398109753963, 0.145487624982773, 0.37711080639490546, 0.022950523410563486, 0.015272314621162785, 0.1419925111325553, 0.21407125465041638, 0.08810492042098603, 0.13164413475174877, -0.21059989509594212, 0.17220302284729197, 0.03203225957848349] |
1,802.02278 | Positivity-Preserving Analysis of Numerical Schemes for Ideal
Magnetohydrodynamics | Numerical schemes provably preserving the positivity of density and pressure
are highly desirable for MHD, but the rigorous positivity-preserving (PP)
analysis remains challenging. The difficulties mainly arise from the intrinsic
complexity of the MHD equations as well as the indeterminate relation between
the PP property and the divergence-free condition on magnetic field. We present
the first rigorous PP analysis of conservative schemes with Lax-Friedrichs (LF)
flux for ideal MHD. The significant innovation is the discovery of theoretical
connection between PP property and a discrete divergence-free (DDF) condition.
This connection is established through the generalized LF splitting properties,
which are alternatives of the usually-expected LF splitting property that does
not hold for ideal MHD. The generalized LF splitting properties involve a
number of admissible states strongly coupled by DDF condition, making their
derivation very difficult. We derive these properties via a novel equivalent
form of the admissible state set and an important inequality skillfully
constructed by technical estimates. Rigorous PP analysis is presented for
finite volume and discontinuous Galerkin schemes with LF flux on uniform
Cartesian meshes. In 1D case, PP property is proved for the first-order scheme
with proper numerical viscosity, and also for arbitrarily high-order schemes
under conditions accessible by a PP limiter. In 2D case, we show that the DDF
condition is necessary and crucial for achieving PP property. It is observed
that even slightly violating the proposed DDF condition may cause failure to
preserve the positivity of pressure. We prove that the 2D LF type scheme with
proper numerical viscosity preserves the positivity and DDF condition.
Sufficient conditions are derived for 2D PP high-order schemes, and extension
to 3D is discussed. Numerical examples confirm the theoretical findings.
| math.NA | numerical schemes provably preserving the positivity of density and pressure are highly desirable for mhd but the rigorous positivitypreserving pp analysis remains challenging the difficulties mainly arise from the intrinsic complexity of the mhd equations as well as the indeterminate relation between the pp property and the divergencefree condition on magnetic field we present the first rigorous pp analysis of conservative schemes with laxfriedrichs lf flux for ideal mhd the significant innovation is the discovery of theoretical connection between pp property and a discrete divergencefree ddf condition this connection is established through the generalized lf splitting properties which are alternatives of the usuallyexpected lf splitting property that does not hold for ideal mhd the generalized lf splitting properties involve a number of admissible states strongly coupled by ddf condition making their derivation very difficult we derive these properties via a novel equivalent form of the admissible state set and an important inequality skillfully constructed by technical estimates rigorous pp analysis is presented for finite volume and discontinuous galerkin schemes with lf flux on uniform cartesian meshes in 1d case pp property is proved for the firstorder scheme with proper numerical viscosity and also for arbitrarily highorder schemes under conditions accessible by a pp limiter in 2d case we show that the ddf condition is necessary and crucial for achieving pp property it is observed that even slightly violating the proposed ddf condition may cause failure to preserve the positivity of pressure we prove that the 2d lf type scheme with proper numerical viscosity preserves the positivity and ddf condition sufficient conditions are derived for 2d pp highorder schemes and extension to 3d is discussed numerical examples confirm the theoretical findings | [['numerical', 'schemes', 'provably', 'preserving', 'the', 'positivity', 'of', 'density', 'and', 'pressure', 'are', 'highly', 'desirable', 'for', 'mhd', 'but', 'the', 'rigorous', 'positivitypreserving', 'pp', 'analysis', 'remains', 'challenging', 'the', 'difficulties', 'mainly', 'arise', 'from', 'the', 'intrinsic', 'complexity', 'of', 'the', 'mhd', 'equations', 'as', 'well', 'as', 'the', 'indeterminate', 'relation', 'between', 'the', 'pp', 'property', 'and', 'the', 'divergencefree', 'condition', 'on', 'magnetic', 'field', 'we', 'present', 'the', 'first', 'rigorous', 'pp', 'analysis', 'of', 'conservative', 'schemes', 'with', 'laxfriedrichs', 'lf', 'flux', 'for', 'ideal', 'mhd', 'the', 'significant', 'innovation', 'is', 'the', 'discovery', 'of', 'theoretical', 'connection', 'between', 'pp', 'property', 'and', 'a', 'discrete', 'divergencefree', 'ddf', 'condition', 'this', 'connection', 'is', 'established', 'through', 'the', 'generalized', 'lf', 'splitting', 'properties', 'which', 'are', 'alternatives', 'of', 'the', 'usuallyexpected', 'lf', 'splitting', 'property', 'that', 'does', 'not', 'hold', 'for', 'ideal', 'mhd', 'the', 'generalized', 'lf', 'splitting', 'properties', 'involve', 'a', 'number', 'of', 'admissible', 'states', 'strongly', 'coupled', 'by', 'ddf', 'condition', 'making', 'their', 'derivation', 'very', 'difficult', 'we', 'derive', 'these', 'properties', 'via', 'a', 'novel', 'equivalent', 'form', 'of', 'the', 'admissible', 'state', 'set', 'and', 'an', 'important', 'inequality', 'skillfully', 'constructed', 'by', 'technical', 'estimates', 'rigorous', 'pp', 'analysis', 'is', 'presented', 'for', 'finite', 'volume', 'and', 'discontinuous', 'galerkin', 'schemes', 'with', 'lf', 'flux', 'on', 'uniform', 'cartesian', 'meshes', 'in', '1d', 'case', 'pp', 'property', 'is', 'proved', 'for', 'the', 'firstorder', 'scheme', 'with', 'proper', 'numerical', 'viscosity', 'and', 'also', 'for', 'arbitrarily', 'highorder', 'schemes', 'under', 'conditions', 'accessible', 'by', 'a', 'pp', 'limiter', 'in', '2d', 'case', 'we', 'show', 'that', 'the', 'ddf', 'condition', 'is', 'necessary', 'and', 'crucial', 'for', 'achieving', 'pp', 'property', 'it', 'is', 'observed', 'that', 'even', 'slightly', 'violating', 'the', 'proposed', 'ddf', 'condition', 'may', 'cause', 'failure', 'to', 'preserve', 'the', 'positivity', 'of', 'pressure', 'we', 'prove', 'that', 'the', '2d', 'lf', 'type', 'scheme', 'with', 'proper', 'numerical', 'viscosity', 'preserves', 'the', 'positivity', 'and', 'ddf', 'condition', 'sufficient', 'conditions', 'are', 'derived', 'for', '2d', 'pp', 'highorder', 'schemes', 'and', 'extension', 'to', '3d', 'is', 'discussed', 'numerical', 'examples', 'confirm', 'the', 'theoretical', 'findings']] | [-0.1380646011907287, 0.07227500095362833, -0.09918432660053708, 0.08635822452494614, -0.08401918833187404, -0.15286503299923887, 0.004890254828461369, 0.35480123232152166, -0.24341646036697304, -0.25050075392624344, 0.0729754518385389, -0.18981153449197183, -0.09474153420095095, 0.19864754078118632, -0.041839090709392596, 0.12542240807409383, 0.09003933072490718, -0.058107570019019866, -0.0803995859361918, -0.23360263186842403, 0.31429369603433915, 0.050351764645434144, 0.33349368751957, 0.08250460364688088, 0.10341538397735485, -0.019410483355510405, -0.04810565443272205, 0.03869472975395353, -0.1522113994825014, 0.060637164548436664, 0.2438121278529092, 0.08881979143517392, 0.24573815322571224, -0.40959724099613143, -0.1894918044479931, 0.07269966500305561, 0.10392648046235403, 0.07611432450357825, -0.05600586600808634, -0.24901656743421097, 0.1581807383077426, -0.1489333891640267, -0.15792821031597887, -0.10656129946101016, -0.01384279682629785, 0.03255273343425238, -0.3315596476927029, 0.1253001800291599, 0.12139049888960683, 0.07819758321819527, -0.06905659968884642, -0.0926928756271212, -0.06255433509647045, 0.03762854285217741, 0.029948426103453055, 0.00727533194900734, 0.05284679864719343, -0.11510003904109374, -0.07310679690172983, 0.39988300303084023, -0.007978403497250304, -0.25108341157009095, 0.22550788030047536, -0.09951946458622386, -0.12806683636393973, 0.135531099463102, 0.12728293336457222, 0.11130942399680321, -0.13190664798955978, 0.1085782309709948, -0.05637191265352458, 0.13315851467629847, 0.047302663855348114, 0.04862296387034144, 0.08027264246679333, 0.09280010910477743, 0.11858381407993002, 0.09658476275451962, -0.04294425837810762, -0.10150031835728703, -0.3909140158992087, -0.15106195544299927, -0.14351708738560584, 0.04147577674699134, -0.07106207050069104, -0.16337222345407024, 0.32423853744279846, 0.12101040275535449, 0.1348718623914439, 0.07162186250843335, 0.3023907600411324, 0.17496002612492165, 0.005498457116685728, 0.09934195299969993, 0.24856770403873457, 0.22470758874620242, 0.10829171514902998, -0.2317052970660807, 0.06960893999163469, 0.16254116088322174] |
1,802.02279 | Towards a Simple, and Yet Accurate, Transistor Equivalent Circuit and
Its Application to the Analysis and Design of Discrete and Integrated
Electronic Circuits | Transistors are the cornerstone of modern electronics. Yet, their relatively
complex characteristics, allied with often observed great parameter variation,
remain a challenge for discrete and integrated electronics. Much of transistor
research and applications have relied on transistor models, as well as
respective equivalent circuits, to be employed for circuit analysis and
simulations. Here, a simple and yet accurate transistor equivalent circuit is
derived, based on the Early effect, which involves only the voltage $V_a$ and a
companion parameter $s$. Equations are obtained for currents and voltages in a
common-emitter circuit, allowing the derivation of respective gain functions.
These functions are found to exhibit interesting mathematical structure, with
gain values varying almost linearly with the base current, allowing the gains
to be well characterized in terms of their average and variation values. These
results are applied to deriving a prototypic Early space summarizing the
characteristics of transistors, enriched with recently experimentally obtained
prototypes of NPN and PNP silicon BJTs and alloy germanium transistors. Though
a trade-off between gain and linearity is revealed, a band characterized by
small values of $V_a$ stands out when aiming at both high gain and low
distortion. The Early equivalent model was used also for studying the stability
of circuits under voltage supply oscillations, as well as parallel combinations
of transistors. In the former case, it was verified that more traditional
approaches assuming constant current gain can yield stability factors that
deviate substantially from those derived for the more accurate Early approach.
The equivalent circuit obtained for parallel combinations of transistors was
shown also to closely follow the Early formulation.
| physics.app-ph | transistors are the cornerstone of modern electronics yet their relatively complex characteristics allied with often observed great parameter variation remain a challenge for discrete and integrated electronics much of transistor research and applications have relied on transistor models as well as respective equivalent circuits to be employed for circuit analysis and simulations here a simple and yet accurate transistor equivalent circuit is derived based on the early effect which involves only the voltage v_a and a companion parameter s equations are obtained for currents and voltages in a commonemitter circuit allowing the derivation of respective gain functions these functions are found to exhibit interesting mathematical structure with gain values varying almost linearly with the base current allowing the gains to be well characterized in terms of their average and variation values these results are applied to deriving a prototypic early space summarizing the characteristics of transistors enriched with recently experimentally obtained prototypes of npn and pnp silicon bjts and alloy germanium transistors though a tradeoff between gain and linearity is revealed a band characterized by small values of v_a stands out when aiming at both high gain and low distortion the early equivalent model was used also for studying the stability of circuits under voltage supply oscillations as well as parallel combinations of transistors in the former case it was verified that more traditional approaches assuming constant current gain can yield stability factors that deviate substantially from those derived for the more accurate early approach the equivalent circuit obtained for parallel combinations of transistors was shown also to closely follow the early formulation | [['transistors', 'are', 'the', 'cornerstone', 'of', 'modern', 'electronics', 'yet', 'their', 'relatively', 'complex', 'characteristics', 'allied', 'with', 'often', 'observed', 'great', 'parameter', 'variation', 'remain', 'a', 'challenge', 'for', 'discrete', 'and', 'integrated', 'electronics', 'much', 'of', 'transistor', 'research', 'and', 'applications', 'have', 'relied', 'on', 'transistor', 'models', 'as', 'well', 'as', 'respective', 'equivalent', 'circuits', 'to', 'be', 'employed', 'for', 'circuit', 'analysis', 'and', 'simulations', 'here', 'a', 'simple', 'and', 'yet', 'accurate', 'transistor', 'equivalent', 'circuit', 'is', 'derived', 'based', 'on', 'the', 'early', 'effect', 'which', 'involves', 'only', 'the', 'voltage', 'v_a', 'and', 'a', 'companion', 'parameter', 's', 'equations', 'are', 'obtained', 'for', 'currents', 'and', 'voltages', 'in', 'a', 'commonemitter', 'circuit', 'allowing', 'the', 'derivation', 'of', 'respective', 'gain', 'functions', 'these', 'functions', 'are', 'found', 'to', 'exhibit', 'interesting', 'mathematical', 'structure', 'with', 'gain', 'values', 'varying', 'almost', 'linearly', 'with', 'the', 'base', 'current', 'allowing', 'the', 'gains', 'to', 'be', 'well', 'characterized', 'in', 'terms', 'of', 'their', 'average', 'and', 'variation', 'values', 'these', 'results', 'are', 'applied', 'to', 'deriving', 'a', 'prototypic', 'early', 'space', 'summarizing', 'the', 'characteristics', 'of', 'transistors', 'enriched', 'with', 'recently', 'experimentally', 'obtained', 'prototypes', 'of', 'npn', 'and', 'pnp', 'silicon', 'bjts', 'and', 'alloy', 'germanium', 'transistors', 'though', 'a', 'tradeoff', 'between', 'gain', 'and', 'linearity', 'is', 'revealed', 'a', 'band', 'characterized', 'by', 'small', 'values', 'of', 'v_a', 'stands', 'out', 'when', 'aiming', 'at', 'both', 'high', 'gain', 'and', 'low', 'distortion', 'the', 'early', 'equivalent', 'model', 'was', 'used', 'also', 'for', 'studying', 'the', 'stability', 'of', 'circuits', 'under', 'voltage', 'supply', 'oscillations', 'as', 'well', 'as', 'parallel', 'combinations', 'of', 'transistors', 'in', 'the', 'former', 'case', 'it', 'was', 'verified', 'that', 'more', 'traditional', 'approaches', 'assuming', 'constant', 'current', 'gain', 'can', 'yield', 'stability', 'factors', 'that', 'deviate', 'substantially', 'from', 'those', 'derived', 'for', 'the', 'more', 'accurate', 'early', 'approach', 'the', 'equivalent', 'circuit', 'obtained', 'for', 'parallel', 'combinations', 'of', 'transistors', 'was', 'shown', 'also', 'to', 'closely', 'follow', 'the', 'early', 'formulation']] | [-0.10031154343924123, 0.09255669619741437, -0.041621925688261174, 0.03724162642602304, -0.03535557865300251, -0.20528384548867876, 0.044809373554627885, 0.40094760213516484, -0.22318561307247017, -0.3446137568085163, 0.09322383284092461, -0.23532948026945458, -0.15495615182817693, 0.2897853027035674, -0.04331664824396201, 0.06497127048995387, 0.02591421056755655, -0.01814104839786176, -0.0769618445036947, -0.23407389654667748, 0.21863198373911064, 0.09459337602433471, 0.32781800486765916, 0.02350981631525081, 0.11081376280899974, -0.060315588171032206, 0.0016688442884994145, 0.07356588208844854, -0.09267729657552408, 0.10177251324413046, 0.2692368059071655, 0.043090506027566394, 0.22634427220549946, -0.45818412063451386, -0.21465112235688583, 0.045527595450803066, 0.1298673340432232, 0.08122113816580515, -0.04148175350698298, -0.2508139301594418, 0.11864926266076953, -0.15348067695278503, -0.07424656682441594, -0.06161870786347889, 0.03872111360969036, 0.05335962441518818, -0.24365672067661756, 0.04100061588692266, 0.024381717000039337, 0.058251204978646214, -0.045794711050129576, -0.18274051965505794, -0.014623425222883527, 0.11887706770552305, 0.005461095473711301, -0.00022742150925483755, 0.17048989549698665, -0.12726379684101477, -0.09586762671557944, 0.35395447967773064, -0.045094068740665176, -0.18315058446778978, 0.17839258122577809, -0.12757368418117027, -0.05605306048195041, 0.11999801011713407, 0.11648836316370213, 0.08143252849966316, -0.1581885103089757, 0.06841552425351417, 0.04163830111137385, 0.16305082065998824, 0.08580500108922143, 0.08576233186652414, 0.21548326312429236, 0.1877517179925464, 0.03804055423802831, 0.13004068176098565, -0.03336869235255379, -0.07435518695852002, -0.2482386399451501, -0.12474030687885611, -0.13181511389148484, 0.07493820550757326, -0.06169338373207169, -0.1706166901621916, 0.3944227956288729, 0.12205760387298545, 0.1701321844971305, 0.04407844228895722, 0.2956906220219622, 0.16910300468528316, 0.100122288938075, 0.01759100875737037, 0.2469567453101249, 0.1812540791628399, 0.10941694108840391, -0.19310469088768445, 0.11439647857821368, -0.023276681507020506] |
1,802.0228 | Loop currents and anomalous Hall effect from time-reversal
symmetry-breaking superconductivity on the honeycomb lattice | We study a tight-binding model on the honeycomb lattice of chiral $d$-wave
superconductivity that breaks time-reversal symmetry. Due to its nontrivial
sublattice structure, we show that it is possible to construct a
gauge-invariant time-reversal-odd bilinear of the pairing potential. The
existence of this bilinear reflects the sublattice polarization of the pairing
state. We show that it generates persistent loop current correlations around
each lattice site and opens a topological mass gap at the Dirac points,
resembling Haldane's model of the anomalous quantum Hall effect. In addition to
the usual chiral $d$-wave edge states, there also exist electron-like edge
resonances due to the topological mass gap. We show that the presence of
loop-current correlations directly leads to a nonzero intrinsic ac Hall
conductivity, which produces the polar Kerr effect without an external magnetic
field. Similar results also hold for the nearest-neighbor chiral $p$-wave
pairing. We briefly discuss the relevance of our results to superconductivity
in twisted bilayer graphene.
| cond-mat.supr-con | we study a tightbinding model on the honeycomb lattice of chiral dwave superconductivity that breaks timereversal symmetry due to its nontrivial sublattice structure we show that it is possible to construct a gaugeinvariant timereversalodd bilinear of the pairing potential the existence of this bilinear reflects the sublattice polarization of the pairing state we show that it generates persistent loop current correlations around each lattice site and opens a topological mass gap at the dirac points resembling haldanes model of the anomalous quantum hall effect in addition to the usual chiral dwave edge states there also exist electronlike edge resonances due to the topological mass gap we show that the presence of loopcurrent correlations directly leads to a nonzero intrinsic ac hall conductivity which produces the polar kerr effect without an external magnetic field similar results also hold for the nearestneighbor chiral pwave pairing we briefly discuss the relevance of our results to superconductivity in twisted bilayer graphene | [['we', 'study', 'a', 'tightbinding', 'model', 'on', 'the', 'honeycomb', 'lattice', 'of', 'chiral', 'dwave', 'superconductivity', 'that', 'breaks', 'timereversal', 'symmetry', 'due', 'to', 'its', 'nontrivial', 'sublattice', 'structure', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'construct', 'a', 'gaugeinvariant', 'timereversalodd', 'bilinear', 'of', 'the', 'pairing', 'potential', 'the', 'existence', 'of', 'this', 'bilinear', 'reflects', 'the', 'sublattice', 'polarization', 'of', 'the', 'pairing', 'state', 'we', 'show', 'that', 'it', 'generates', 'persistent', 'loop', 'current', 'correlations', 'around', 'each', 'lattice', 'site', 'and', 'opens', 'a', 'topological', 'mass', 'gap', 'at', 'the', 'dirac', 'points', 'resembling', 'haldanes', 'model', 'of', 'the', 'anomalous', 'quantum', 'hall', 'effect', 'in', 'addition', 'to', 'the', 'usual', 'chiral', 'dwave', 'edge', 'states', 'there', 'also', 'exist', 'electronlike', 'edge', 'resonances', 'due', 'to', 'the', 'topological', 'mass', 'gap', 'we', 'show', 'that', 'the', 'presence', 'of', 'loopcurrent', 'correlations', 'directly', 'leads', 'to', 'a', 'nonzero', 'intrinsic', 'ac', 'hall', 'conductivity', 'which', 'produces', 'the', 'polar', 'kerr', 'effect', 'without', 'an', 'external', 'magnetic', 'field', 'similar', 'results', 'also', 'hold', 'for', 'the', 'nearestneighbor', 'chiral', 'pwave', 'pairing', 'we', 'briefly', 'discuss', 'the', 'relevance', 'of', 'our', 'results', 'to', 'superconductivity', 'in', 'twisted', 'bilayer', 'graphene']] | [-0.25520086413617155, 0.22002180818415315, -0.04555301204216993, 0.08252011568754151, -0.10718288366344704, -0.1518911744444186, 0.0858178006886997, 0.36426855977268735, -0.26243342371408346, -0.21351227151811314, -0.043500893024110775, -0.30374545178666806, -0.17670077830034006, 0.10397230086931188, 0.031212512691428138, 0.01549431342953389, -0.036646882712746125, 0.0011517715389739462, -0.13005017294959242, -0.2338914114086159, 0.3612212264364597, -0.035823587809428334, 0.3228364295524895, 0.14059659802343008, 0.0020918735713775084, 0.01576382575473588, 0.13259713325774072, 0.011188814834733107, -0.1209309205072146, 0.061394093128493664, 0.19289021164321216, -0.1281853665502825, 0.1251651625116326, -0.43645036032506423, -0.19100307509344616, 0.0479252096547324, 0.09708844564349396, 0.2026634115531483, -0.07657529068828982, -0.3065738097473884, 0.08923420388322727, -0.20781918555782858, -0.17838202257919464, -0.14084873652192437, -0.0041079033028251334, -0.10625558146824289, -0.24607261271656425, 0.11417920009201915, 0.11584576897791758, 0.05367474040241948, -0.08682113056290586, -0.1182910425315617, -0.1107276308359163, 0.04769586885620834, 0.07959042466097292, 0.07009780137491217, 0.10658939538158738, -0.15177914420006333, -0.17861600880730588, 0.37965679970706345, -0.048746941462870994, -0.12767253339195708, 0.14406306704300142, -0.17589047520753637, -0.09548578824800481, 0.10087993795609777, 0.08301020642092961, 0.020187576626172397, -0.09010632170970807, 0.10921494391632629, -0.10166427796739183, 0.15129648917280494, 0.02107724066894905, 0.10051940474955803, 0.28878449629784625, 0.128854794754012, 0.10321948086178512, 0.16622515825056441, -0.11907377131179474, -0.09958673854229473, -0.2947499814805142, -0.15173177558121978, -0.2242047658166403, 0.0738598689864016, -0.044963436548143575, -0.2161630131259774, 0.4518376336563497, 0.20909107286649145, 0.2106863364820505, -0.06992595253592346, 0.22064515486786698, 0.12229646716020692, 0.10302919428498977, 0.05768813395421881, 0.23544719953210075, 0.16450463210834654, 0.07395136581472815, -0.3549517637565821, 0.0021526750909745883, 0.05405666520166549] |
1,802.02281 | Structure formation in $f(T)$ gravity and a solution for $H_0$ tension | We investigate the evolution of scalar perturbations in $f(T)$ teleparallel
gravity and its effects on the cosmic microwave background (CMB) anisotropy.
The $f(T)$ gravity generalizes the teleparallel gravity which is formulated on
the Weitzenb\"ock spacetime, characterized by the vanishing curvature tensor
(absolute parallelism) and the non-vanishing torsion tensor. For the first
time, we derive the observational constraints on the modified teleparallel
gravity using the CMB temperature power spectrum from Planck's estimation, in
addition to data from baryonic acoustic oscillations (BAO) and local Hubble
constant measurements. We find that a small deviation of the $f(T)$ gravity
model from the $\Lambda$CDM cosmology is slightly favored. Besides that, the
$f(T)$ gravity model does not show tension on the Hubble constant that prevails
in the $\Lambda$CDM cosmology. It is clear that $f(T)$ gravity is also
consistent with the CMB observations, and undoubtedly it can serve as a viable
candidate amongst other modified gravity theories.
| gr-qc astro-ph.CO | we investigate the evolution of scalar perturbations in ft teleparallel gravity and its effects on the cosmic microwave background cmb anisotropy the ft gravity generalizes the teleparallel gravity which is formulated on the weitzenbock spacetime characterized by the vanishing curvature tensor absolute parallelism and the nonvanishing torsion tensor for the first time we derive the observational constraints on the modified teleparallel gravity using the cmb temperature power spectrum from plancks estimation in addition to data from baryonic acoustic oscillations bao and local hubble constant measurements we find that a small deviation of the ft gravity model from the lambdacdm cosmology is slightly favored besides that the ft gravity model does not show tension on the hubble constant that prevails in the lambdacdm cosmology it is clear that ft gravity is also consistent with the cmb observations and undoubtedly it can serve as a viable candidate amongst other modified gravity theories | [['we', 'investigate', 'the', 'evolution', 'of', 'scalar', 'perturbations', 'in', 'ft', 'teleparallel', 'gravity', 'and', 'its', 'effects', 'on', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'anisotropy', 'the', 'ft', 'gravity', 'generalizes', 'the', 'teleparallel', 'gravity', 'which', 'is', 'formulated', 'on', 'the', 'weitzenbock', 'spacetime', 'characterized', 'by', 'the', 'vanishing', 'curvature', 'tensor', 'absolute', 'parallelism', 'and', 'the', 'nonvanishing', 'torsion', 'tensor', 'for', 'the', 'first', 'time', 'we', 'derive', 'the', 'observational', 'constraints', 'on', 'the', 'modified', 'teleparallel', 'gravity', 'using', 'the', 'cmb', 'temperature', 'power', 'spectrum', 'from', 'plancks', 'estimation', 'in', 'addition', 'to', 'data', 'from', 'baryonic', 'acoustic', 'oscillations', 'bao', 'and', 'local', 'hubble', 'constant', 'measurements', 'we', 'find', 'that', 'a', 'small', 'deviation', 'of', 'the', 'ft', 'gravity', 'model', 'from', 'the', 'lambdacdm', 'cosmology', 'is', 'slightly', 'favored', 'besides', 'that', 'the', 'ft', 'gravity', 'model', 'does', 'not', 'show', 'tension', 'on', 'the', 'hubble', 'constant', 'that', 'prevails', 'in', 'the', 'lambdacdm', 'cosmology', 'it', 'is', 'clear', 'that', 'ft', 'gravity', 'is', 'also', 'consistent', 'with', 'the', 'cmb', 'observations', 'and', 'undoubtedly', 'it', 'can', 'serve', 'as', 'a', 'viable', 'candidate', 'amongst', 'other', 'modified', 'gravity', 'theories']] | [-0.15742658252517383, 0.12659983490904173, -0.1288354700213919, 0.12818157976415628, -0.17683786500866214, -0.17394233861006797, -0.09111239007208496, 0.2485350472604235, -0.2292279592558043, -0.2820393958874047, 0.026165169661398976, -0.26395211059600115, -0.09780700914561749, 0.17383936484809964, -0.029588616906354826, -0.013338636377593503, -0.034079743220160406, 0.05806504253298044, -0.06453821439606448, -0.2578658278208847, 0.3316908228645722, 0.17655350279062987, 0.258140083947607, -0.025478461862852176, 0.11371586419719582, -0.11078610116926332, -0.042454546218117076, 0.09087123363045975, -0.2225235890118832, -0.008726661940260479, 0.16440934138867305, 0.1402623820429047, 0.15437606111789742, -0.39013538723190627, -0.3140578741681141, 0.12340709896447757, 0.08207863204025974, 0.15134732097309703, -0.03951802166023602, -0.295847065175573, -0.012622170007477203, -0.14011964313065012, -0.059024251106505596, -0.05124523810887088, -0.022033048731585344, -0.12957531077166398, -0.21801664616291722, 0.18305502846041538, -0.029319366918255884, -0.038984910007566216, -0.12437356051445628, -0.0993428650467346, -0.027772683976218106, -0.003023183299228549, 0.11228866249788552, 0.07048103421305617, 0.13264685176390534, -0.12793355009829005, -0.024325372661308697, 0.4423579799508055, -0.23613642660280068, -0.17493215203129997, 0.09156978448852897, -0.20845700746712587, -0.18074592568911613, -0.014344498788317044, 0.06722071723702053, 0.0656605491321534, -0.1336601667695989, 0.22187349170291176, 0.04928674471875032, 0.16137805373718342, 0.12686047658324243, 0.022180052182326715, 0.3479342235706281, 0.0841709401862075, 0.057002837947802615, 0.05221506700967438, -0.10097971450847884, -0.03899863369452457, -0.4016938645858318, -0.11837024009476105, -0.18667129333441457, 0.060952053396516326, -0.22497851132997312, -0.164205164910915, 0.36348751038933796, 0.14439541573015352, 0.10549064580428724, 0.13104851386277006, 0.3209663031095018, 0.04334933444081495, 0.0819021007604897, 0.06453412989464899, 0.37926951139544446, 0.16932848695199937, 0.13230201365426184, -0.28453927287366243, -0.030365876151869694, 0.009901779000647365] |
1,802.02282 | Four-coloring $P_6$-free graphs. I. Extending an excellent precoloring | This is the first paper in a series whose goal is to give a polynomial time
algorithm for the $4$-coloring problem and the $4$-precoloring extension
problem restricted to the class of graphs with no induced six-vertex path, thus
proving a conjecture of Huang. Combined with previously known results this
completes the classification of the complexity of the $4$-coloring problem for
graphs with a connected forbidden induced subgraph.
In this paper we give a polynomial time algorithm that determines if a
special kind of precoloring of a $P_6$-free graph has a precoloring extension,
and constructs such an extension if one exists. Combined with the main result
of the second paper of the series, this gives a complete solution to the
problem.
| math.CO cs.DM | this is the first paper in a series whose goal is to give a polynomial time algorithm for the 4coloring problem and the 4precoloring extension problem restricted to the class of graphs with no induced sixvertex path thus proving a conjecture of huang combined with previously known results this completes the classification of the complexity of the 4coloring problem for graphs with a connected forbidden induced subgraph in this paper we give a polynomial time algorithm that determines if a special kind of precoloring of a p_6free graph has a precoloring extension and constructs such an extension if one exists combined with the main result of the second paper of the series this gives a complete solution to the problem | [['this', 'is', 'the', 'first', 'paper', 'in', 'a', 'series', 'whose', 'goal', 'is', 'to', 'give', 'a', 'polynomial', 'time', 'algorithm', 'for', 'the', '4coloring', 'problem', 'and', 'the', '4precoloring', 'extension', 'problem', 'restricted', 'to', 'the', 'class', 'of', 'graphs', 'with', 'no', 'induced', 'sixvertex', 'path', 'thus', 'proving', 'a', 'conjecture', 'of', 'huang', 'combined', 'with', 'previously', 'known', 'results', 'this', 'completes', 'the', 'classification', 'of', 'the', 'complexity', 'of', 'the', '4coloring', 'problem', 'for', 'graphs', 'with', 'a', 'connected', 'forbidden', 'induced', 'subgraph', 'in', 'this', 'paper', 'we', 'give', 'a', 'polynomial', 'time', 'algorithm', 'that', 'determines', 'if', 'a', 'special', 'kind', 'of', 'precoloring', 'of', 'a', 'p_6free', 'graph', 'has', 'a', 'precoloring', 'extension', 'and', 'constructs', 'such', 'an', 'extension', 'if', 'one', 'exists', 'combined', 'with', 'the', 'main', 'result', 'of', 'the', 'second', 'paper', 'of', 'the', 'series', 'this', 'gives', 'a', 'complete', 'solution', 'to', 'the', 'problem']] | [-0.1435767932096496, 0.028877033977308505, -0.06245044778722028, 0.005527110401696215, -0.12806220419394473, -0.09578833976993337, 0.04170080008916557, 0.3329541269612188, -0.30538595678905645, -0.2865675307267035, 0.10906713537406176, -0.23462876606111724, -0.18231323506915942, 0.16920256153680385, -0.10374420258643416, 0.03373489354271442, 0.09437315654940903, 0.08956475311424583, -0.01839983067669285, -0.27273829926004206, 0.32036137316608804, 0.0017638162108293423, 0.1617132406992217, 0.09069784282085797, 0.12182715898767735, 0.03342565732309595, -0.0225105219714654, 0.063068294711411, -0.1551720721863603, 0.12824471106675142, 0.2501558443938848, 0.15213466512504964, 0.2901064682286233, -0.3532964342351382, -0.15127759065362625, 0.2273765777402635, 0.1168035094771767, 0.11334443709347397, -0.0351580509217456, -0.2189997053084274, 0.11510262965360502, -0.12635764064228472, -0.14656797292797516, 0.030037382000591605, 0.041943242016714066, -0.04937235976879795, -0.2988131595387434, 0.006295350698443751, 0.16851822269770006, 0.030427466123364867, -0.0181069542770274, -0.06714244683195526, 0.05871058162301779, 0.0786505216693816, -0.008595314470585435, 0.10258717372004564, -0.038974581858686484, -0.0903564186883159, -0.1979385146095107, 0.39843564730059977, -0.048744737597492836, -0.18073756486798326, 0.12497122613349347, -0.09667956914830332, -0.21965649847406893, 0.13237536372325848, 0.10354479701491073, 0.177162522644115, -0.11610976715261738, 0.1517816968174884, -0.15066020861268042, 0.13085217450667794, 0.08385536125861108, -0.028262749532586895, 0.09500465174041892, 0.19208729693200438, 0.16204412357183173, 0.22875794819362152, 0.020681075868196785, -0.019899933697888627, -0.3122748838737607, -0.1711996357732763, -0.2047453263774514, 0.04098607174431284, -0.0830443993130757, -0.2263861544507866, 0.4651745151417951, 0.10721025377085122, 0.2082303199490222, 0.1529478570368762, 0.2626852266441953, 0.11499549385237819, 0.022376783484166177, 0.12091571174096316, 0.13485702840456118, 0.15200310473446735, 0.03788332984161873, -0.18807803418239927, 0.08180445632703291, 0.1514889686795262] |
1,802.02283 | Four-coloring $P_6$-free graphs. II. Finding an excellent precoloring | This is the second paper in a series of two. The goal of the series is to
give a polynomial time algorithm for the $4$-coloring problem and the
$4$-precoloring extension problem restricted to the class of graphs with no
induced six-vertex path, thus proving a conjecture of Huang. Combined with
previously known results this completes the classification of the complexity of
the $4$-coloring problem for graphs with a connected forbidden induced
subgraph.
In this paper we give a polynomial time algorithm that starts with a
$4$-precoloring of a graph with no induced six-vertex path, and outputs a
polynomial-size collection of so-called excellent precolorings. Excellent
precolorings are easier to handle than general ones, and, in addition, in order
to determine whether the initial precoloring can be extended to the whole
graph, it is enough to answer the same question for each of the excellent
precolorings in the collection. The first paper in the series deals with
excellent precolorings, thus providing a complete solution to the problem.
| math.CO cs.DM | this is the second paper in a series of two the goal of the series is to give a polynomial time algorithm for the 4coloring problem and the 4precoloring extension problem restricted to the class of graphs with no induced sixvertex path thus proving a conjecture of huang combined with previously known results this completes the classification of the complexity of the 4coloring problem for graphs with a connected forbidden induced subgraph in this paper we give a polynomial time algorithm that starts with a 4precoloring of a graph with no induced sixvertex path and outputs a polynomialsize collection of socalled excellent precolorings excellent precolorings are easier to handle than general ones and in addition in order to determine whether the initial precoloring can be extended to the whole graph it is enough to answer the same question for each of the excellent precolorings in the collection the first paper in the series deals with excellent precolorings thus providing a complete solution to the problem | [['this', 'is', 'the', 'second', 'paper', 'in', 'a', 'series', 'of', 'two', 'the', 'goal', 'of', 'the', 'series', 'is', 'to', 'give', 'a', 'polynomial', 'time', 'algorithm', 'for', 'the', '4coloring', 'problem', 'and', 'the', '4precoloring', 'extension', 'problem', 'restricted', 'to', 'the', 'class', 'of', 'graphs', 'with', 'no', 'induced', 'sixvertex', 'path', 'thus', 'proving', 'a', 'conjecture', 'of', 'huang', 'combined', 'with', 'previously', 'known', 'results', 'this', 'completes', 'the', 'classification', 'of', 'the', 'complexity', 'of', 'the', '4coloring', 'problem', 'for', 'graphs', 'with', 'a', 'connected', 'forbidden', 'induced', 'subgraph', 'in', 'this', 'paper', 'we', 'give', 'a', 'polynomial', 'time', 'algorithm', 'that', 'starts', 'with', 'a', '4precoloring', 'of', 'a', 'graph', 'with', 'no', 'induced', 'sixvertex', 'path', 'and', 'outputs', 'a', 'polynomialsize', 'collection', 'of', 'socalled', 'excellent', 'precolorings', 'excellent', 'precolorings', 'are', 'easier', 'to', 'handle', 'than', 'general', 'ones', 'and', 'in', 'addition', 'in', 'order', 'to', 'determine', 'whether', 'the', 'initial', 'precoloring', 'can', 'be', 'extended', 'to', 'the', 'whole', 'graph', 'it', 'is', 'enough', 'to', 'answer', 'the', 'same', 'question', 'for', 'each', 'of', 'the', 'excellent', 'precolorings', 'in', 'the', 'collection', 'the', 'first', 'paper', 'in', 'the', 'series', 'deals', 'with', 'excellent', 'precolorings', 'thus', 'providing', 'a', 'complete', 'solution', 'to', 'the', 'problem']] | [-0.11446330022405495, 0.039699691830372266, -0.05596528676564269, 0.04091940140633872, -0.11678472508986791, -0.10082932283650294, 0.03880250790565642, 0.3655006833543832, -0.27630536276847123, -0.3110468805457155, 0.10698488601624515, -0.2601873698319788, -0.13752771743262807, 0.18210254885312735, -0.09381048768956327, 0.0731680321478934, 0.0952667782562926, 0.07288343808754827, -0.026431545199628807, -0.2805492053051818, 0.2843969848959453, 0.03506846686994487, 0.1897365732231375, 0.06282150764864954, 0.08994649966162714, 0.012966116698402346, -0.030189895463373626, 0.07790584605977391, -0.13218484786643372, 0.14617893960270467, 0.2717482878798337, 0.12422097665398861, 0.2579019110988487, -0.3831501841827324, -0.14515307045711034, 0.19311795435690632, 0.12431355862892374, 0.11567382748877263, -0.022067042688528698, -0.2307017198679122, 0.12403269392635786, -0.12351576800768574, -0.13313018711791796, 0.003723832174684062, 0.034995911307068486, -0.0280923331438592, -0.30600654041451036, 0.01859330154786056, 0.12155399950729175, 0.018740655267328928, -0.03204594261831406, -0.06485991924366152, 0.04046353641615221, 0.11553612626016592, -0.015578137591943562, 0.0940361904347259, -0.023230656907385724, -0.12237797675400296, -0.16558334144453207, 0.3878581563829247, -0.04850013368793015, -0.18057262845563166, 0.15569247154159133, -0.12221974252977154, -0.16713333208057465, 0.14285790460663988, 0.10429500840942968, 0.14288963073808136, -0.1350852855848092, 0.11726203801738325, -0.09929687576086232, 0.13915927286231608, 0.08221856636474982, -0.01646431625624907, 0.1297778731720896, 0.1760911106922184, 0.1269890150676171, 0.21459357464813034, 0.024656919164187982, -0.05761054864463707, -0.2831459439839378, -0.17654612900999686, -0.18901629093469996, 0.02795316655132355, -0.08710050604025707, -0.20641517906633178, 0.4475409795163256, 0.1398770621907192, 0.22391053656624121, 0.1299972249138536, 0.2521758753721687, 0.08893722406955379, 0.017347428796700003, 0.09746155389725711, 0.14419931560529, 0.13850703408066747, 0.056526137075640935, -0.20072117952054902, 0.07559913221012914, 0.09946093499716936] |
1,802.02284 | $\infty$-topoi and Natural Phenomena: Generation | We show that the Segal topos of derived stacks over simplicial commutative
$k$-algebras, which can be used to model natural phenomena, has a subobject
classifier, something we regard as being a source from which dynamics is
generated. This is done by considering the $\infty$-category associated to such
a Segal topos, which turns out to be an $\infty$-topos. At this point we have
the formalism of Higher topoi at our disposal to deal with Higher Category
Theory concepts in a transparent manner.
| math.AG math-ph math.CT math.MP | we show that the segal topos of derived stacks over simplicial commutative kalgebras which can be used to model natural phenomena has a subobject classifier something we regard as being a source from which dynamics is generated this is done by considering the inftycategory associated to such a segal topos which turns out to be an inftytopos at this point we have the formalism of higher topoi at our disposal to deal with higher category theory concepts in a transparent manner | [['we', 'show', 'that', 'the', 'segal', 'topos', 'of', 'derived', 'stacks', 'over', 'simplicial', 'commutative', 'kalgebras', 'which', 'can', 'be', 'used', 'to', 'model', 'natural', 'phenomena', 'has', 'a', 'subobject', 'classifier', 'something', 'we', 'regard', 'as', 'being', 'a', 'source', 'from', 'which', 'dynamics', 'is', 'generated', 'this', 'is', 'done', 'by', 'considering', 'the', 'inftycategory', 'associated', 'to', 'such', 'a', 'segal', 'topos', 'which', 'turns', 'out', 'to', 'be', 'an', 'inftytopos', 'at', 'this', 'point', 'we', 'have', 'the', 'formalism', 'of', 'higher', 'topoi', 'at', 'our', 'disposal', 'to', 'deal', 'with', 'higher', 'category', 'theory', 'concepts', 'in', 'a', 'transparent', 'manner']] | [-0.06317876565074663, 0.06703330799064133, -0.16815194486996826, 0.1155153017629076, -0.10523914863114003, -0.13345198002126482, -0.004259853056103083, 0.4100726658915296, -0.36955218566696585, -0.23062863079026158, 0.03627925948958476, -0.2333697308268812, -0.13014778008477557, 0.17754138269038428, -0.20741139133288353, -0.08321465625870329, 0.02735913138733142, 0.10065202963434988, -0.021544794560651535, -0.26475382971370387, 0.3837807746201662, 0.06758248617435679, 0.24347040963209707, 0.008812783757385648, 0.10341583935681868, -0.03384443869768285, 0.03029436710970419, 0.0816235596107112, -0.08637921854375392, 0.11386974691700788, 0.36742301811866557, 0.09960666082132562, 0.23606628676399266, -0.38824738651790003, -0.20368721563782957, 0.12617559639024145, 0.06394179132019664, 0.10525181064134992, 0.011633242296491876, -0.33594035419325036, 0.14773607356933716, -0.24153237548415307, -0.09547328211390126, -0.10309669086824597, 0.024494422438703936, -0.06730179220724011, -0.23581046346046122, -0.07648096886969367, 0.07379110319608892, 0.11474445695632401, -0.05452364180122077, -0.029050422685772733, -0.06088049987756452, 0.08273534975761984, -0.04857729658352234, 0.09041867132103186, 0.14037235121438166, -0.09265649781769349, -0.12789798293400695, 0.4017426193358354, -0.06148481135613021, -0.20520385320263881, 0.18368290843051158, -0.1167541656838615, -0.153391043736059, 0.12693373948611594, 0.0343183861459019, 0.17508687190481542, -0.10664714368083227, 0.1088780747887529, -0.09758889093351217, 0.11389183650047656, 0.0977754797556518, 0.030985963456102727, 0.21302131915258038, 0.17041736443377573, 0.027140459600537094, 0.15236576270300572, 0.02029602099598075, -0.07659388995832866, -0.31165017157701064, -0.14156968870318248, -0.10188273616411068, 0.14232292725060733, -0.01598660389168395, -0.14694784710436692, 0.34739901525554834, 0.18772948363703895, 0.1903633570059973, 0.1001155733599408, 0.2600425671280166, 0.10355186257166443, 0.11235950465808496, -0.005429879037870301, 0.16611293734649174, 0.15207006771621914, 0.03939178178839983, -0.04305519430070288, 0.007225217194192939, 0.16395402612325585] |
1,802.02285 | Universal Approach to Quantum Adiabaticity via Ancilla Cavity | A central challenge in the successful implementation of adiabatic quantum
algorithms is to maintain the quantum adiabaticity during the entire evolution.
However, the energy gap between the ground and the excited states of
interacting many-body systems often decreases quickly with the number of
qubits, and the quantum adiabaticity can be severely impaired. Despite numerous
previous efforts, a practical method to preserve the quantum adiabaticity has
yet to be developed. Here we present a universal approach to enhancing the
quantum adiabaticity via cavity or circuit QED. By coupling an adiabatic
quantum computer to an ancilla cavity, the coupled system can exhibit a
bistable regime with bifurcation points, where the time evolution becomes very
slow. Utilizing these generic nonlinear features, we show that the energy gap
of the adiabatic quantum computer can be positioned between the bifurcation
points, which results in strongly-enhanced quantum adiabaticity. We then apply
this method to a quantum two-level system, an Exact Cover problem, and a
transverse field Ising model. In contrast to previous works, this approach does
not require the spectral knowledge of the quantum system or the construction of
unphysical interactions and can be applied to a vast variety of adiabatic
quantum processes.
| quant-ph cond-mat.mes-hall | a central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution however the energy gap between the ground and the excited states of interacting manybody systems often decreases quickly with the number of qubits and the quantum adiabaticity can be severely impaired despite numerous previous efforts a practical method to preserve the quantum adiabaticity has yet to be developed here we present a universal approach to enhancing the quantum adiabaticity via cavity or circuit qed by coupling an adiabatic quantum computer to an ancilla cavity the coupled system can exhibit a bistable regime with bifurcation points where the time evolution becomes very slow utilizing these generic nonlinear features we show that the energy gap of the adiabatic quantum computer can be positioned between the bifurcation points which results in stronglyenhanced quantum adiabaticity we then apply this method to a quantum twolevel system an exact cover problem and a transverse field ising model in contrast to previous works this approach does not require the spectral knowledge of the quantum system or the construction of unphysical interactions and can be applied to a vast variety of adiabatic quantum processes | [['a', 'central', 'challenge', 'in', 'the', 'successful', 'implementation', 'of', 'adiabatic', 'quantum', 'algorithms', 'is', 'to', 'maintain', 'the', 'quantum', 'adiabaticity', 'during', 'the', 'entire', 'evolution', 'however', 'the', 'energy', 'gap', 'between', 'the', 'ground', 'and', 'the', 'excited', 'states', 'of', 'interacting', 'manybody', 'systems', 'often', 'decreases', 'quickly', 'with', 'the', 'number', 'of', 'qubits', 'and', 'the', 'quantum', 'adiabaticity', 'can', 'be', 'severely', 'impaired', 'despite', 'numerous', 'previous', 'efforts', 'a', 'practical', 'method', 'to', 'preserve', 'the', 'quantum', 'adiabaticity', 'has', 'yet', 'to', 'be', 'developed', 'here', 'we', 'present', 'a', 'universal', 'approach', 'to', 'enhancing', 'the', 'quantum', 'adiabaticity', 'via', 'cavity', 'or', 'circuit', 'qed', 'by', 'coupling', 'an', 'adiabatic', 'quantum', 'computer', 'to', 'an', 'ancilla', 'cavity', 'the', 'coupled', 'system', 'can', 'exhibit', 'a', 'bistable', 'regime', 'with', 'bifurcation', 'points', 'where', 'the', 'time', 'evolution', 'becomes', 'very', 'slow', 'utilizing', 'these', 'generic', 'nonlinear', 'features', 'we', 'show', 'that', 'the', 'energy', 'gap', 'of', 'the', 'adiabatic', 'quantum', 'computer', 'can', 'be', 'positioned', 'between', 'the', 'bifurcation', 'points', 'which', 'results', 'in', 'stronglyenhanced', 'quantum', 'adiabaticity', 'we', 'then', 'apply', 'this', 'method', 'to', 'a', 'quantum', 'twolevel', 'system', 'an', 'exact', 'cover', 'problem', 'and', 'a', 'transverse', 'field', 'ising', 'model', 'in', 'contrast', 'to', 'previous', 'works', 'this', 'approach', 'does', 'not', 'require', 'the', 'spectral', 'knowledge', 'of', 'the', 'quantum', 'system', 'or', 'the', 'construction', 'of', 'unphysical', 'interactions', 'and', 'can', 'be', 'applied', 'to', 'a', 'vast', 'variety', 'of', 'adiabatic', 'quantum', 'processes']] | [-0.15409529408402173, 0.17171076228533372, -0.08492331585502914, 0.02772677496494016, -0.030677429119096645, -0.18344774655761376, 0.06429589245832397, 0.34422202741840696, -0.279512855886165, -0.3121290382477668, 0.05320312588435461, -0.21396790938877364, -0.15452510263146785, 0.21990292737388104, -0.056270650161759986, 0.130796482060861, 0.07869337424919538, 0.020980736974692965, -0.059828518810658364, -0.2249597966160417, 0.2896604975070899, 0.06042119796532041, 0.27907149401271175, 0.056118598777202766, 0.06022175583695322, -0.02560022194293058, 0.08651929391491307, -0.018560104502298808, -0.09819881717319427, 0.07809205628195211, 0.2799296803337517, 0.08425770710260243, 0.29507082481372177, -0.47063402509137153, -0.2205257842417388, 0.11799435197909926, 0.17998849696049532, 0.22626632084859638, -0.029851513550744443, -0.30098504008167437, 0.03405358170296259, -0.18213963621475635, -0.13305752019535014, -0.11970796979264106, -0.027646356344407395, -0.021728748209221372, -0.23242641931286243, 0.048713369455736906, 0.08389480364849308, 0.030927791049807963, 0.01730959207471933, 0.029667845018902975, 0.03878164295400233, 0.12480433692276327, -0.02965528992309618, 0.027996236359142713, 0.17636108292540922, -0.14381144035768312, -0.14530589067504793, 0.3621252018929965, -0.031167341087741524, -0.1720807707424129, 0.21420136099529977, -0.07744161375717917, -0.08442905201543557, 0.114767338643276, 0.13462702580254884, 0.0860836597745718, -0.12447822664162324, 0.11920224854292415, 0.027742547053976108, 0.19780587621487034, 0.007678954386941824, 0.06210805205297349, 0.20981462598839765, 0.13677098990127273, 0.060558408390030946, 0.14602322389400058, -0.06234238707923761, -0.19536587230501895, -0.2717881194944612, -0.1549402382950178, -0.2319945646024446, 0.09547096723757109, -0.05480726317326458, -0.1757100158593225, 0.41796254591902876, 0.18018377182809023, 0.18197742343270384, -0.013640415601238494, 0.30620273605442894, 0.16961326332039525, 0.06274371017668831, 0.08803584176496257, 0.28197138270642136, 0.13902092573166763, 0.09368257820228029, -0.2953130806852983, 0.0070429487688098156, 0.02381970775597327] |
1,802.02286 | An MCMC Algorithm for Estimating the Q-matrix in a Bayesian Framework | The purpose of this research is to develop an MCMC algorithm for estimating
the Q-matrix. Based on the DINA model, the algorithm starts with estimating
correlated attributes. Using a saturated model and a binary decimal conversion,
the algorithm transforms possible attribute patterns to a Multinomial
distribution. Along with the likelihood of an attribute pattern, a Dirichlet
distribution, constructed using Gamma distributions, is used as the prior to
sample from the posterior. Correlated attributes of examinees are generated
using inverse transform sampling. Closed form posteriors for sampling guess and
slip parameters are found. A distribution for sampling the Q-matrix is derived.
A relabeling algorithm that accounts for potential label switching is
presented. A method for simulating data with correlated attributes for the DINA
model is offered. Three simulation studies are conducted to evaluate the
performance of the algorithm. An empirical study using the ECPE data is
performed. The algorithm is implemented using customized R codes.
| stat.AP | the purpose of this research is to develop an mcmc algorithm for estimating the qmatrix based on the dina model the algorithm starts with estimating correlated attributes using a saturated model and a binary decimal conversion the algorithm transforms possible attribute patterns to a multinomial distribution along with the likelihood of an attribute pattern a dirichlet distribution constructed using gamma distributions is used as the prior to sample from the posterior correlated attributes of examinees are generated using inverse transform sampling closed form posteriors for sampling guess and slip parameters are found a distribution for sampling the qmatrix is derived a relabeling algorithm that accounts for potential label switching is presented a method for simulating data with correlated attributes for the dina model is offered three simulation studies are conducted to evaluate the performance of the algorithm an empirical study using the ecpe data is performed the algorithm is implemented using customized r codes | [['the', 'purpose', 'of', 'this', 'research', 'is', 'to', 'develop', 'an', 'mcmc', 'algorithm', 'for', 'estimating', 'the', 'qmatrix', 'based', 'on', 'the', 'dina', 'model', 'the', 'algorithm', 'starts', 'with', 'estimating', 'correlated', 'attributes', 'using', 'a', 'saturated', 'model', 'and', 'a', 'binary', 'decimal', 'conversion', 'the', 'algorithm', 'transforms', 'possible', 'attribute', 'patterns', 'to', 'a', 'multinomial', 'distribution', 'along', 'with', 'the', 'likelihood', 'of', 'an', 'attribute', 'pattern', 'a', 'dirichlet', 'distribution', 'constructed', 'using', 'gamma', 'distributions', 'is', 'used', 'as', 'the', 'prior', 'to', 'sample', 'from', 'the', 'posterior', 'correlated', 'attributes', 'of', 'examinees', 'are', 'generated', 'using', 'inverse', 'transform', 'sampling', 'closed', 'form', 'posteriors', 'for', 'sampling', 'guess', 'and', 'slip', 'parameters', 'are', 'found', 'a', 'distribution', 'for', 'sampling', 'the', 'qmatrix', 'is', 'derived', 'a', 'relabeling', 'algorithm', 'that', 'accounts', 'for', 'potential', 'label', 'switching', 'is', 'presented', 'a', 'method', 'for', 'simulating', 'data', 'with', 'correlated', 'attributes', 'for', 'the', 'dina', 'model', 'is', 'offered', 'three', 'simulation', 'studies', 'are', 'conducted', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'algorithm', 'an', 'empirical', 'study', 'using', 'the', 'ecpe', 'data', 'is', 'performed', 'the', 'algorithm', 'is', 'implemented', 'using', 'customized', 'r', 'codes']] | [-0.061824175854840506, 0.04871122704564329, -0.13680520823554082, 0.08606669522998428, -0.08015369893404735, -0.1568253841585924, 0.05750012516007558, 0.4353516538158741, -0.2772214324791837, -0.32924018900086677, 0.09428513552871795, -0.2665641817935359, -0.11383825651479557, 0.20574727106163754, -0.03767193722374299, 0.10057275335675751, 0.08335418605361304, 0.03861192189266577, -0.07170141844540755, -0.23357896977926002, 0.2765792079294234, 0.09788185477049814, 0.31763394226721836, -0.07210181179925118, 0.12755227330737304, 0.016560958853612345, -0.07150924828183515, -0.011715011892602871, -0.11264497451994947, 0.1281833873446909, 0.21513806728591375, 0.18812640843109465, 0.2635931222200442, -0.3416663101640605, -0.19350001049757587, 0.09735222084423394, 0.12871181937178072, 0.08571510893457077, -0.06975905000448251, -0.2756628532463295, 0.07980230471934953, -0.15475185494869947, -0.07385479356314427, -0.07825008472975563, -0.012485060999109074, 0.03495236305944179, -0.3802976319140274, 0.053311232031548236, 0.0046697203252537576, 0.06535163281783705, -0.05268708987045863, -0.14990628166185097, 0.011126257521800355, 0.11231182917976885, 0.022332408032501787, 0.02977407031564736, 0.10931923916240777, -0.09965267926229132, -0.14359317865037036, 0.36508827360675616, -0.03049000988720484, -0.23316567411853206, 0.10909131785635562, -0.0422423347919035, -0.12316514569292077, 0.1525668582540033, 0.19304248147638015, 0.13895908153761982, -0.19498792112640598, 0.04208364328171668, -0.049834823894034465, 0.1547048586136144, -0.009068858459762304, -0.07972748608638842, 0.15536573799053097, 0.2057443822937975, 0.01305384692900321, 0.1839043832797971, -0.1588766314637135, -0.0943082561172405, -0.24790842164828278, -0.11882052316750381, -0.2619822999170306, -0.047321758001701894, -0.1062681439020321, -0.18664568374116047, 0.38414976722560823, 0.19677820156657083, 0.20541032873629744, 0.09852838104901214, 0.286941013843722, 0.12894748939778367, 0.03353904875671016, 0.09591976543766709, 0.1150102623695739, 0.1112640751221406, 0.02301011658486685, -0.17471862450779227, 0.14945111457361943, 0.04895376785067854] |
1,802.02287 | On sums and convex combinations of projectors onto convex sets | The projector onto the Minkowski sum of closed convex sets is generally not
equal to the sum of individual projectors. In this work, we provide a complete
answer to the question of characterizing the instances where such an equality
holds. Our results unify and extend the case of linear subspaces and
Zarantonello's results for projectors onto cones. A detailed analysis in the
case of convex combinations is also carried out. We establish the partial sum
property for projectors onto convex cones, and we also present various examples
as well as a detailed analysis in the univariate case.
| math.OC math.FA | the projector onto the minkowski sum of closed convex sets is generally not equal to the sum of individual projectors in this work we provide a complete answer to the question of characterizing the instances where such an equality holds our results unify and extend the case of linear subspaces and zarantonellos results for projectors onto cones a detailed analysis in the case of convex combinations is also carried out we establish the partial sum property for projectors onto convex cones and we also present various examples as well as a detailed analysis in the univariate case | [['the', 'projector', 'onto', 'the', 'minkowski', 'sum', 'of', 'closed', 'convex', 'sets', 'is', 'generally', 'not', 'equal', 'to', 'the', 'sum', 'of', 'individual', 'projectors', 'in', 'this', 'work', 'we', 'provide', 'a', 'complete', 'answer', 'to', 'the', 'question', 'of', 'characterizing', 'the', 'instances', 'where', 'such', 'an', 'equality', 'holds', 'our', 'results', 'unify', 'and', 'extend', 'the', 'case', 'of', 'linear', 'subspaces', 'and', 'zarantonellos', 'results', 'for', 'projectors', 'onto', 'cones', 'a', 'detailed', 'analysis', 'in', 'the', 'case', 'of', 'convex', 'combinations', 'is', 'also', 'carried', 'out', 'we', 'establish', 'the', 'partial', 'sum', 'property', 'for', 'projectors', 'onto', 'convex', 'cones', 'and', 'we', 'also', 'present', 'various', 'examples', 'as', 'well', 'as', 'a', 'detailed', 'analysis', 'in', 'the', 'univariate', 'case']] | [-0.07332223211415112, 0.019840287206079665, -0.05826027882479442, 0.06165223041534773, -0.05129117461910937, -0.06831885490585894, 0.05923798525812648, 0.3358283091026048, -0.2794967743830057, -0.1962183169234777, 0.12944530423677256, -0.30515608767746016, -0.14506589394780653, 0.21280656531841183, -0.06843153974720433, 0.04326394097491478, 0.06575073947897181, -0.0035998941769624557, -0.13844631196601162, -0.2918746701713341, 0.3513807037767644, -0.011876413419183033, 0.21548613709940886, 0.08876898104305535, 0.08622405803665363, 0.07720110062412762, -0.04964806504237155, 0.0402279416739475, -0.14539597198988, 0.11156308341802894, 0.28754777597108233, 0.18681009168115756, 0.2598765468525623, -0.406256408362727, -0.15398671345125572, 0.13343877665465698, 0.12596322545869043, 0.047215239804548524, -0.0014027087308932096, -0.2283438216666885, 0.06842347005537401, -0.10801153911355262, -0.14072317598523418, -0.1243982666443723, -0.02202630138587362, -0.0034609446690107384, -0.30069554307556245, 0.039714395460881256, 0.14282547464608797, 0.061130315475262854, -0.09105722829068934, -0.14632214695060006, 0.0036896553877644087, 0.10820451658704162, 0.029195250412527685, 0.009529717979603447, 0.06496909395597565, -0.03546675072720973, -0.11715127536081127, 0.39104011675711564, -0.03616077537299134, -0.31134052962685627, 0.17438796959322644, -0.170696720975684, -0.1307200532828574, 0.05819015173377314, 0.16069083486218005, 0.2021951564044381, -0.11151878244709224, 0.09293524034546863, -0.1647239320736844, 0.08319463617226575, 0.07592202643475805, 0.06182154641040446, 0.19186522841240125, 0.09788645929074846, 0.13126597945180643, 0.209235631399982, 0.012868745026935358, -0.08313333244101766, -0.350402330038681, -0.19207774024592558, -0.19916240080298545, 0.07782199129981866, -0.07358394143481443, -0.14777128214094168, 0.4026478729210794, 0.0551490192883648, 0.21517192965742046, 0.10113361583595785, 0.30003225886806223, 0.0996053916690774, 0.013831391406711191, 0.044992196887809165, 0.19078662513978392, 0.1651778023224324, -0.007675583309416349, -0.16124974640357928, -0.025982494844356552, 0.10332008238765411] |
1,802.02288 | Spatial Modulation Assisted Multi-Antenna Non-Orthogonal Multiple Access | Multi-antenna non-orthogonal multiple access (NOMA) is a promising technique
to significantly improve the spectral efficiency and support massive access,
which has received considerable interests from academic and industry. This
article first briefly introduces the basic idea of conventional multi-antenna
NOMA technique, and then discusses the key limitations, namely, the high
complexity of successive interference cancellation(SIC) and the lack of
fairness between the user with a strong channel gain and the user with a weak
channel gain. To address these problems, this article proposes a novel spatial
modulation (SM) assisted multi-antenna NOMA technique, which avoids the use of
SIC and is able to completely cancel intra-cluster interference. Furthermore,
simulation results are provided to validate the effectiveness of the proposed
novel technique compared to the conventional multi-antenna NOMA. Finally, this
article points out the key challenges and sheds light on the future research
directions of the SM assisted multi-antenna NOMA technique.
| cs.IT math.IT | multiantenna nonorthogonal multiple access noma is a promising technique to significantly improve the spectral efficiency and support massive access which has received considerable interests from academic and industry this article first briefly introduces the basic idea of conventional multiantenna noma technique and then discusses the key limitations namely the high complexity of successive interference cancellationsic and the lack of fairness between the user with a strong channel gain and the user with a weak channel gain to address these problems this article proposes a novel spatial modulation sm assisted multiantenna noma technique which avoids the use of sic and is able to completely cancel intracluster interference furthermore simulation results are provided to validate the effectiveness of the proposed novel technique compared to the conventional multiantenna noma finally this article points out the key challenges and sheds light on the future research directions of the sm assisted multiantenna noma technique | [['multiantenna', 'nonorthogonal', 'multiple', 'access', 'noma', 'is', 'a', 'promising', 'technique', 'to', 'significantly', 'improve', 'the', 'spectral', 'efficiency', 'and', 'support', 'massive', 'access', 'which', 'has', 'received', 'considerable', 'interests', 'from', 'academic', 'and', 'industry', 'this', 'article', 'first', 'briefly', 'introduces', 'the', 'basic', 'idea', 'of', 'conventional', 'multiantenna', 'noma', 'technique', 'and', 'then', 'discusses', 'the', 'key', 'limitations', 'namely', 'the', 'high', 'complexity', 'of', 'successive', 'interference', 'cancellationsic', 'and', 'the', 'lack', 'of', 'fairness', 'between', 'the', 'user', 'with', 'a', 'strong', 'channel', 'gain', 'and', 'the', 'user', 'with', 'a', 'weak', 'channel', 'gain', 'to', 'address', 'these', 'problems', 'this', 'article', 'proposes', 'a', 'novel', 'spatial', 'modulation', 'sm', 'assisted', 'multiantenna', 'noma', 'technique', 'which', 'avoids', 'the', 'use', 'of', 'sic', 'and', 'is', 'able', 'to', 'completely', 'cancel', 'intracluster', 'interference', 'furthermore', 'simulation', 'results', 'are', 'provided', 'to', 'validate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'novel', 'technique', 'compared', 'to', 'the', 'conventional', 'multiantenna', 'noma', 'finally', 'this', 'article', 'points', 'out', 'the', 'key', 'challenges', 'and', 'sheds', 'light', 'on', 'the', 'future', 'research', 'directions', 'of', 'the', 'sm', 'assisted', 'multiantenna', 'noma', 'technique']] | [-0.20770590101381312, -0.0008814782541358491, -0.03415475991346899, 0.004552692172158434, -0.12752410459310143, -0.2555816314825033, 0.1438101175920786, 0.3554798642022384, -0.2833493724968788, -0.24829197717465562, 0.013687040316998153, -0.24802341329789646, -0.21457358478644006, 0.13843191332715513, -0.11653726007097175, 0.06476632514032472, 0.04734786601644324, -0.019279213068453042, -0.049128709181614626, -0.2945792495219566, 0.3316025673160078, 0.1615318568404512, 0.4369777566879182, 0.10910860719662663, 0.06954449585110352, 0.035074499272112106, -0.07830690491214595, -0.07385066157282405, -0.06388254491340942, 0.14524400103019197, 0.3161186369409709, 0.19886802485750713, 0.3305987180714068, -0.4049574607681181, -0.2913395042493436, 0.03584563170836584, 0.21309015849240226, 0.06233026638113409, -0.1226120413748258, -0.2962875597012179, 0.14050624287188543, -0.24186150041861912, -0.0542043154505459, -0.015804457188760106, -0.1709679645844861, 0.04002721113077289, -0.32934103998657616, -0.008821695910867405, 0.011769737909875205, 0.04301677718978828, 0.0016136448020178421, -0.14938371964711444, 0.08572855466234221, 0.14763522379075153, 0.0928146766508124, 0.00551360977712918, 0.057537405893231766, -0.0457917748104051, -0.16974666010198258, 0.39046142226387115, 0.028958065080931537, -0.19008443525809846, 0.214450472205204, -0.08523320591681309, -0.11234874251700554, 0.13878598922275234, 0.2371320225690913, 0.05160873352449287, -0.19833375870665484, 0.04134752530002073, 0.009692781047920722, 0.14716447082370193, 0.07284776824589416, 0.1480539795640554, 0.1818790520113465, 0.2007886259564878, 0.11230431779640147, 0.1349459859633793, -0.1411564947244384, -0.10965524238811152, -0.19600755669769668, -0.15285615033998684, -0.1821291923799829, -0.002201959619776824, -0.07503881797478047, -0.040075194096897505, 0.40111820335260817, 0.20755551011628798, 0.07618483548002267, 0.02679955164077566, 0.4550411381028794, 0.06685426201973413, 0.0581671575751357, 0.06704571101864851, 0.19636770726080882, 0.1454507877194398, 0.18179926912086336, -0.23965613150062995, 0.00022722963665335164, -0.023754783802212694] |
1,802.02289 | Turbulent Cascade Direction and Lagrangian Time-Asymmetry | We establish Lagrangian formulae for energy conservation anomalies involving
the discrepancy between short-time two-particle dispersion forward and backward
in time. These results are facilitated by a rigorous version of the
Ott-Mann-Gaw\c{e}dzki relation, sometimes described as a "Lagrangian analogue
of the 4/5ths law". In particular, we prove that for any space-time $L^3$ weak
solution of the Euler equations, the Lagrangian forward/backward dispersion
measure matches on to the energy defect in the sense of distributions. For
strong limits of $d\geq3$ dimensional Navier-Stokes solutions the defect
distribution coincides with the viscous dissipation anomaly. The Lagrangian
formula shows that particles released into a $3d$ turbulent flow will initially
disperse faster backward-in-time than forward, in agreement with recent
theoretical predictions of Jucha et. al (2014). In two dimensions, we consider
strong limits of solutions of the forced Euler equations with increasingly
high-wavenumber forcing as a model of an ideal inverse cascade regime. We show
that the same Lagrangian dispersion measure matches onto the anomalous input
from the infinite-frequency force. As forcing typically acts as an energy
source, this leads to the prediction that particles in $2d$ typically disperse
faster forward in time than backward, which is opposite to what occurs in $3d$.
Time-asymmetry of the Lagrangian dispersion is thereby closely tied to the
direction of the turbulent cascade, downscale in $d\geq 3$ and upscale in
$d=2$. These conclusions lend support to the conjecture of Eyink & Drivas
(2015) that a similar connection holds for time-asymmetry of Richardson
two-particle dispersion and cascade direction, albeit at longer times.
| math.AP physics.flu-dyn | we establish lagrangian formulae for energy conservation anomalies involving the discrepancy between shorttime twoparticle dispersion forward and backward in time these results are facilitated by a rigorous version of the ottmanngawcedzki relation sometimes described as a lagrangian analogue of the 45ths law in particular we prove that for any spacetime l3 weak solution of the euler equations the lagrangian forwardbackward dispersion measure matches on to the energy defect in the sense of distributions for strong limits of dgeq3 dimensional navierstokes solutions the defect distribution coincides with the viscous dissipation anomaly the lagrangian formula shows that particles released into a 3d turbulent flow will initially disperse faster backwardintime than forward in agreement with recent theoretical predictions of jucha et al 2014 in two dimensions we consider strong limits of solutions of the forced euler equations with increasingly highwavenumber forcing as a model of an ideal inverse cascade regime we show that the same lagrangian dispersion measure matches onto the anomalous input from the infinitefrequency force as forcing typically acts as an energy source this leads to the prediction that particles in 2d typically disperse faster forward in time than backward which is opposite to what occurs in 3d timeasymmetry of the lagrangian dispersion is thereby closely tied to the direction of the turbulent cascade downscale in dgeq 3 and upscale in d2 these conclusions lend support to the conjecture of eyink drivas 2015 that a similar connection holds for timeasymmetry of richardson twoparticle dispersion and cascade direction albeit at longer times | [['we', 'establish', 'lagrangian', 'formulae', 'for', 'energy', 'conservation', 'anomalies', 'involving', 'the', 'discrepancy', 'between', 'shorttime', 'twoparticle', 'dispersion', 'forward', 'and', 'backward', 'in', 'time', 'these', 'results', 'are', 'facilitated', 'by', 'a', 'rigorous', 'version', 'of', 'the', 'ottmanngawcedzki', 'relation', 'sometimes', 'described', 'as', 'a', 'lagrangian', 'analogue', 'of', 'the', '45ths', 'law', 'in', 'particular', 'we', 'prove', 'that', 'for', 'any', 'spacetime', 'l3', 'weak', 'solution', 'of', 'the', 'euler', 'equations', 'the', 'lagrangian', 'forwardbackward', 'dispersion', 'measure', 'matches', 'on', 'to', 'the', 'energy', 'defect', 'in', 'the', 'sense', 'of', 'distributions', 'for', 'strong', 'limits', 'of', 'dgeq3', 'dimensional', 'navierstokes', 'solutions', 'the', 'defect', 'distribution', 'coincides', 'with', 'the', 'viscous', 'dissipation', 'anomaly', 'the', 'lagrangian', 'formula', 'shows', 'that', 'particles', 'released', 'into', 'a', '3d', 'turbulent', 'flow', 'will', 'initially', 'disperse', 'faster', 'backwardintime', 'than', 'forward', 'in', 'agreement', 'with', 'recent', 'theoretical', 'predictions', 'of', 'jucha', 'et', 'al', '2014', 'in', 'two', 'dimensions', 'we', 'consider', 'strong', 'limits', 'of', 'solutions', 'of', 'the', 'forced', 'euler', 'equations', 'with', 'increasingly', 'highwavenumber', 'forcing', 'as', 'a', 'model', 'of', 'an', 'ideal', 'inverse', 'cascade', 'regime', 'we', 'show', 'that', 'the', 'same', 'lagrangian', 'dispersion', 'measure', 'matches', 'onto', 'the', 'anomalous', 'input', 'from', 'the', 'infinitefrequency', 'force', 'as', 'forcing', 'typically', 'acts', 'as', 'an', 'energy', 'source', 'this', 'leads', 'to', 'the', 'prediction', 'that', 'particles', 'in', '2d', 'typically', 'disperse', 'faster', 'forward', 'in', 'time', 'than', 'backward', 'which', 'is', 'opposite', 'to', 'what', 'occurs', 'in', '3d', 'timeasymmetry', 'of', 'the', 'lagrangian', 'dispersion', 'is', 'thereby', 'closely', 'tied', 'to', 'the', 'direction', 'of', 'the', 'turbulent', 'cascade', 'downscale', 'in', 'dgeq', '3', 'and', 'upscale', 'in', 'd2', 'these', 'conclusions', 'lend', 'support', 'to', 'the', 'conjecture', 'of', 'eyink', 'drivas', '2015', 'that', 'a', 'similar', 'connection', 'holds', 'for', 'timeasymmetry', 'of', 'richardson', 'twoparticle', 'dispersion', 'and', 'cascade', 'direction', 'albeit', 'at', 'longer', 'times']] | [-0.14288029135621297, 0.14167464142114541, -0.10544554469272886, 0.09640645541864015, -0.056515575072357084, -0.11894535710012949, -0.020726990111350135, 0.31292763339522167, -0.2599628542973925, -0.279778790088537, 0.03591005032507294, -0.28049700286682333, -0.0952219467523046, 0.19261616969961914, -0.026966388148020923, 0.0650049352254605, 0.05219289705789519, -0.0029430468595109697, -0.047479377632650234, -0.16528254050697103, 0.3011727204576619, 0.05942274407839509, 0.28220644052617433, 0.035960489853731986, 0.11754135364227421, -0.014252669226219197, -0.028059525498590334, 0.03661311602284299, -0.15601678553198364, 0.07523160626684937, 0.1934997325354233, 0.019992263924720418, 0.2181633664806169, -0.4528114563573485, -0.2166305879004133, 0.0639564496582389, 0.18110052696845638, 0.11128996041408415, -0.01915544294515564, -0.25186461256438397, 0.06940625515166382, -0.13866411947372664, -0.17989992819597747, -0.027066350130864034, 0.05217249737768548, 0.024628650304781865, -0.2636594592519786, 0.14650736322694616, 0.1138198106971804, 0.03662459070726139, -0.06599042767174239, -0.0673799844003449, -0.058865509190922226, 0.06264027988356424, 0.08653369605090712, 0.045531980850453665, 0.07511937632452606, -0.1531590017601831, -0.10081398821808776, 0.3795410370581019, -0.1098103274874497, -0.22306420125173237, 0.19909537243335015, -0.15155176737164033, -0.10176817344868844, 0.15921256403302456, 0.16196823112545458, 0.07912155794518895, -0.11111518571615159, 0.06692036544094056, -0.0823293899562649, 0.13584760776001628, 0.09533149572997922, -0.0038804119025800487, 0.14847489324875357, 0.12220529853309528, 0.09963902944700823, 0.10173465333911173, -0.07707851097406299, -0.1435445036686582, -0.3110446991584438, -0.17946762601632957, -0.15730404324651642, 0.06695095210230144, -0.0942382955916223, -0.1384851288020126, 0.32418618148866646, 0.153531109690581, 0.20442129382712207, 0.09610731436206572, 0.2704445962089954, 0.17341271626864319, 0.03820643638264448, 0.11535800926361756, 0.2707388790256185, 0.14889535689570305, 0.12989279734247838, -0.21291045639881623, 0.020596058174638394, 0.14225508094239012] |
1,802.0229 | Spectral Image Visualization Using Generative Adversarial Networks | Spectral images captured by satellites and radio-telescopes are analyzed to
obtain information about geological compositions distributions, distant asters
as well as undersea terrain. Spectral images usually contain tens to hundreds
of continuous narrow spectral bands and are widely used in various fields. But
the vast majority of those image signals are beyond the visible range, which
calls for special visualization technique. The visualizations of spectral
images shall convey as much information as possible from the original signal
and facilitate image interpretation. However, most of the existing visualizatio
methods display spectral images in false colors, which contradict with human's
experience and expectation. In this paper, we present a novel visualization
generative adversarial network (GAN) to display spectral images in natural
colors. To achieve our goal, we propose a loss function which consists of an
adversarial loss and a structure loss. The adversarial loss pushes our solution
to the natural image distribution using a discriminator network that is trained
to differentiate between false-color images and natural-color images. We also
use a cycle loss as the structure constraint to guarantee structure
consistency. Experimental results show that our method is able to generate
structure-preserved and natural-looking visualizations.
| cs.CV cs.LG stat.ML | spectral images captured by satellites and radiotelescopes are analyzed to obtain information about geological compositions distributions distant asters as well as undersea terrain spectral images usually contain tens to hundreds of continuous narrow spectral bands and are widely used in various fields but the vast majority of those image signals are beyond the visible range which calls for special visualization technique the visualizations of spectral images shall convey as much information as possible from the original signal and facilitate image interpretation however most of the existing visualizatio methods display spectral images in false colors which contradict with humans experience and expectation in this paper we present a novel visualization generative adversarial network gan to display spectral images in natural colors to achieve our goal we propose a loss function which consists of an adversarial loss and a structure loss the adversarial loss pushes our solution to the natural image distribution using a discriminator network that is trained to differentiate between falsecolor images and naturalcolor images we also use a cycle loss as the structure constraint to guarantee structure consistency experimental results show that our method is able to generate structurepreserved and naturallooking visualizations | [['spectral', 'images', 'captured', 'by', 'satellites', 'and', 'radiotelescopes', 'are', 'analyzed', 'to', 'obtain', 'information', 'about', 'geological', 'compositions', 'distributions', 'distant', 'asters', 'as', 'well', 'as', 'undersea', 'terrain', 'spectral', 'images', 'usually', 'contain', 'tens', 'to', 'hundreds', 'of', 'continuous', 'narrow', 'spectral', 'bands', 'and', 'are', 'widely', 'used', 'in', 'various', 'fields', 'but', 'the', 'vast', 'majority', 'of', 'those', 'image', 'signals', 'are', 'beyond', 'the', 'visible', 'range', 'which', 'calls', 'for', 'special', 'visualization', 'technique', 'the', 'visualizations', 'of', 'spectral', 'images', 'shall', 'convey', 'as', 'much', 'information', 'as', 'possible', 'from', 'the', 'original', 'signal', 'and', 'facilitate', 'image', 'interpretation', 'however', 'most', 'of', 'the', 'existing', 'visualizatio', 'methods', 'display', 'spectral', 'images', 'in', 'false', 'colors', 'which', 'contradict', 'with', 'humans', 'experience', 'and', 'expectation', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'visualization', 'generative', 'adversarial', 'network', 'gan', 'to', 'display', 'spectral', 'images', 'in', 'natural', 'colors', 'to', 'achieve', 'our', 'goal', 'we', 'propose', 'a', 'loss', 'function', 'which', 'consists', 'of', 'an', 'adversarial', 'loss', 'and', 'a', 'structure', 'loss', 'the', 'adversarial', 'loss', 'pushes', 'our', 'solution', 'to', 'the', 'natural', 'image', 'distribution', 'using', 'a', 'discriminator', 'network', 'that', 'is', 'trained', 'to', 'differentiate', 'between', 'falsecolor', 'images', 'and', 'naturalcolor', 'images', 'we', 'also', 'use', 'a', 'cycle', 'loss', 'as', 'the', 'structure', 'constraint', 'to', 'guarantee', 'structure', 'consistency', 'experimental', 'results', 'show', 'that', 'our', 'method', 'is', 'able', 'to', 'generate', 'structurepreserved', 'and', 'naturallooking', 'visualizations']] | [-0.014271306402478662, 0.008908382097148908, -0.08936837942600645, 0.12482546478147721, -0.11714487757272624, -0.12302290183299827, 0.005073625655356972, 0.4735470576256159, -0.25326101800177997, -0.39534492241760727, 0.07509757002332697, -0.28712846034837186, -0.18447608181285283, 0.16861586298340211, -0.15550712923406593, 0.0620321484963858, 0.10239603062820615, 0.003409574696518205, -0.03011483330034439, -0.22365777943561732, 0.2943858599558808, 0.03052646799811295, 0.2986793245198747, 0.005749700221395682, 0.09696055873649481, -0.028573516872095524, -0.012983894143155011, -0.013626821128782081, -0.07033418798019984, 0.15020493761187903, 0.2937668825723921, 0.21261049694228898, 0.254337962151372, -0.42065612258261476, -0.26421325830693443, 0.08627146580527542, 0.13120859507877852, 0.07815869006749597, -0.07799135787639196, -0.30091214630624685, 0.10151320503121944, -0.11862320181908746, -0.023421737382671347, -0.11484693381541147, -0.03815118139104612, 0.014152915280117659, -0.2996348938753794, 0.04929096989993317, 0.05746828574347236, 0.07133539974265707, -0.059924045959536834, -0.0830311391486604, -0.04559190053968301, 0.17842397877759247, 0.030785429717205395, 0.044453308436829875, 0.1252907219616371, -0.17524469342197577, -0.09737741473998145, 0.38413745619198947, -0.06782632706706565, -0.15865620547704148, 0.21218050001854344, -0.09615413121701706, -0.08858214105324198, 0.15141906625795715, 0.2005115614701358, 0.13104757417496, -0.15440835692967836, -0.036862100087409276, -0.03796060076081958, 0.1900792843132482, 0.07482671197325179, 0.09239059580716664, 0.20346186484799045, 0.15850924385222484, 0.050968639547665597, 0.160892146249011, -0.16291317877620853, -0.03778837771504802, -0.2354509135195123, -0.10519361662772045, -0.21276408128277768, 0.00760836479199863, -0.07742721495465264, -0.16140405193252105, 0.41235304468129047, 0.22608449040399617, 0.2746592199691034, 0.0835794264976694, 0.3457269096875159, 0.022393116704065096, 0.13982601060067604, 0.04038631298367387, 0.1933541851679957, 0.05623306241379213, 0.11869380330893571, -0.10742245526693604, 0.061285355746765774, 0.0029672346701204934] |
1,802.02291 | Neighborhood Contingency Logic: A New Perspective | In this paper, we propose a new neighborhood semantics for contingency logic,
by introducing a simple property in standard neighborhood models. This
simplifies the neighborhood semantics given in (Fan and van Ditmarsch, 2015),
but does not change the set of valid formulas. Under this perspective, among
various notions of bisimulation and respective Hennessy-Milner Theorems, we
show that $c$-bisimulation is equivalent to nbh-$\Delta$-bisimulation in the
literature, which guides us to understand the essence of the latter notion.
This perspective also provides various frame definability and axiomatization
results.
| math.LO cs.LO | in this paper we propose a new neighborhood semantics for contingency logic by introducing a simple property in standard neighborhood models this simplifies the neighborhood semantics given in fan and van ditmarsch 2015 but does not change the set of valid formulas under this perspective among various notions of bisimulation and respective hennessymilner theorems we show that cbisimulation is equivalent to nbhdeltabisimulation in the literature which guides us to understand the essence of the latter notion this perspective also provides various frame definability and axiomatization results | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'neighborhood', 'semantics', 'for', 'contingency', 'logic', 'by', 'introducing', 'a', 'simple', 'property', 'in', 'standard', 'neighborhood', 'models', 'this', 'simplifies', 'the', 'neighborhood', 'semantics', 'given', 'in', 'fan', 'and', 'van', 'ditmarsch', '2015', 'but', 'does', 'not', 'change', 'the', 'set', 'of', 'valid', 'formulas', 'under', 'this', 'perspective', 'among', 'various', 'notions', 'of', 'bisimulation', 'and', 'respective', 'hennessymilner', 'theorems', 'we', 'show', 'that', 'cbisimulation', 'is', 'equivalent', 'to', 'nbhdeltabisimulation', 'in', 'the', 'literature', 'which', 'guides', 'us', 'to', 'understand', 'the', 'essence', 'of', 'the', 'latter', 'notion', 'this', 'perspective', 'also', 'provides', 'various', 'frame', 'definability', 'and', 'axiomatization', 'results']] | [-0.07901845356017086, 0.011405654356903619, -0.09744819166302304, 0.10274690461838396, -0.1556881172582507, -0.10681130562997646, 0.11841765357807855, 0.34905862398556475, -0.3030908416424479, -0.27986675094524843, 0.009924651716747099, -0.20846285418208158, -0.17836287586639324, 0.15883006180437015, -0.19605784328190826, 0.0099955637983623, 0.03955222591979518, 0.0312722939776168, -0.11147025857852506, -0.23014318578255674, 0.34087186322237056, 0.03468575286457226, 0.2920216596130991, 0.06433953532957405, 0.09596035393354084, 0.05246270298846953, -0.01885871752165258, 0.0865109635827442, -0.18652453215647602, 0.15499381704804754, 0.2907249363313981, 0.23170183275249742, 0.29941880241745994, -0.3901513613028718, -0.15401768874809413, 0.12124531015398957, 0.07538604242394545, 0.11319737497251481, 0.01806413692732652, -0.29755092851285425, 0.10165571583257545, -0.17503022064366155, -0.09715525668469213, -0.10735405224771793, 0.03844794901531367, -0.007860649221887192, -0.2246991483594424, -0.020141315233818853, 0.2222963648160831, 0.08792495110537857, -0.04512433696349728, -0.05837174348111841, 0.043138981910444615, 0.0660772968272102, 0.003266131181070315, -0.005583301419392228, 0.09240574304879244, -0.060846945082414006, -0.14631390157072538, 0.3612055591795416, -0.02841127845126071, -0.19935554578634246, 0.19357763800126987, -0.11659335866681345, -0.19511997486863816, 0.050188605496216385, 0.09180401729065038, 0.08769163971633784, -0.19556893322927257, 0.13493630141255425, -0.09431264887652582, 0.13121714231203355, 0.11960601249787335, 0.07029527553822845, 0.16656864845814803, 0.14341365115805751, 0.05391309429736187, 0.15314406436213868, 0.02405421052216774, -0.14486952423162403, -0.3527049529477067, -0.1650697327096991, -0.06209135732413935, -0.022208241723655237, -0.0734569296911927, -0.20651586103763075, 0.4000669405352147, 0.23796134246956735, 0.1680414380638727, 0.14113223331098976, 0.25997298190625207, 0.08486362845914777, 0.0164213954426703, 0.053564815340255985, 0.18995765836111136, 0.14259178764907465, 0.1332867908114124, -0.1122778356019851, 0.10735015904286965, 0.1504012191130425] |
1,802.02292 | Predictions for isobaric collisions at $\sqrt{s_{_{\rm NN}}}$ = 200 GeV
from a multiphase transport model | The isobaric collisions of $^{96}_{44}$Ru + $^{96}_{44}$Ru and $^{96}_{40}$Zr
+ $^{96}_{40}$Zr have recently been proposed to discern the charge separation
signal of the chiral magnetic effect (CME). In this article, we employ the
string melting version of a multiphase transport model to predict various
charged-particle observables, including $dN/d\eta$, $p_T$ spectra, elliptic
flow ($v_2$), and particularly possible CME signals in Ru + Ru and Zr + Zr
collisions at $\sqrt{s_{_{\rm NN}}}$ = 200 GeV. Two sets of the nuclear
structure parametrization have been explored, and the difference between the
two isobaric collisions appears to be small, in terms of $dN/d\eta$, $p_T$
spectra, and $v_2$ for charged particles. We mimic the CME by introducing an
initial charge separation that is proportional to the magnetic field produced
in the collision, and study how the final-state interactions affect the CME
observables. The relative difference in the CME signal between the two isobaric
collisions is found to be robust, insensitive to the final-state interactions.
| nucl-th hep-ph nucl-ex | the isobaric collisions of 96_44ru 96_44ru and 96_40zr 96_40zr have recently been proposed to discern the charge separation signal of the chiral magnetic effect cme in this article we employ the string melting version of a multiphase transport model to predict various chargedparticle observables including dndeta p_t spectra elliptic flow v_2 and particularly possible cme signals in ru ru and zr zr collisions at sqrts__rm nn 200 gev two sets of the nuclear structure parametrization have been explored and the difference between the two isobaric collisions appears to be small in terms of dndeta p_t spectra and v_2 for charged particles we mimic the cme by introducing an initial charge separation that is proportional to the magnetic field produced in the collision and study how the finalstate interactions affect the cme observables the relative difference in the cme signal between the two isobaric collisions is found to be robust insensitive to the finalstate interactions | [['the', 'isobaric', 'collisions', 'of', '96_44ru', '96_44ru', 'and', '96_40zr', '96_40zr', 'have', 'recently', 'been', 'proposed', 'to', 'discern', 'the', 'charge', 'separation', 'signal', 'of', 'the', 'chiral', 'magnetic', 'effect', 'cme', 'in', 'this', 'article', 'we', 'employ', 'the', 'string', 'melting', 'version', 'of', 'a', 'multiphase', 'transport', 'model', 'to', 'predict', 'various', 'chargedparticle', 'observables', 'including', 'dndeta', 'p_t', 'spectra', 'elliptic', 'flow', 'v_2', 'and', 'particularly', 'possible', 'cme', 'signals', 'in', 'ru', 'ru', 'and', 'zr', 'zr', 'collisions', 'at', 'sqrts__rm', 'nn', '200', 'gev', 'two', 'sets', 'of', 'the', 'nuclear', 'structure', 'parametrization', 'have', 'been', 'explored', 'and', 'the', 'difference', 'between', 'the', 'two', 'isobaric', 'collisions', 'appears', 'to', 'be', 'small', 'in', 'terms', 'of', 'dndeta', 'p_t', 'spectra', 'and', 'v_2', 'for', 'charged', 'particles', 'we', 'mimic', 'the', 'cme', 'by', 'introducing', 'an', 'initial', 'charge', 'separation', 'that', 'is', 'proportional', 'to', 'the', 'magnetic', 'field', 'produced', 'in', 'the', 'collision', 'and', 'study', 'how', 'the', 'finalstate', 'interactions', 'affect', 'the', 'cme', 'observables', 'the', 'relative', 'difference', 'in', 'the', 'cme', 'signal', 'between', 'the', 'two', 'isobaric', 'collisions', 'is', 'found', 'to', 'be', 'robust', 'insensitive', 'to', 'the', 'finalstate', 'interactions']] | [-0.0835787589017713, 0.22701901431861046, -0.1355012324540392, 0.14656928238268432, 0.025563166017172397, -0.08276534956190493, -0.11338954109565488, 0.37135919464098943, -0.24340549594565453, -0.32380539255349766, -0.06332682045977925, -0.35338840762745927, 0.011985952554681859, 0.10799121521390648, 0.05481287082294365, 0.051025253835484966, 0.07518205997782046, 0.02778849760811268, -0.0745411327387684, -0.16823503793770592, 0.29319925384608087, 0.09261807183698788, 0.21095633266082445, 0.15134331312441787, 0.06351212998126428, 0.017394436298047083, 0.009472613395252204, 0.013839922694174887, -0.14543685473845824, 0.026656885864969053, 0.2438189417710407, 0.018800892428700606, 0.12379074518345054, -0.389604454956852, -0.15694675448217563, 0.13522282186835133, 0.15404161575322897, 0.10225495884751344, -0.08046960652588153, -0.24296803898918864, 0.10022383620478696, -0.2262911612361476, -0.09252039332989023, -0.04525943542651109, 0.02563142265546946, 0.048339863106693054, -0.3039087167953885, 0.1404830258182407, 0.024863514324127433, 0.10904896901557584, -0.04990030078870523, -0.1549048340741799, -0.08471890104187701, 0.05239715666945588, 0.12431819322624836, 0.08392202984632367, 0.17980614071711898, -0.09981684317334567, -0.10701557534577494, 0.3947270471941341, 0.025127254474859733, -0.13306795401716387, 0.19075164595292277, -0.18260362232406321, -0.10780767450266361, 0.1689494389091171, 0.23796118452975695, 0.07689287436539428, -0.18884802872183515, 0.021991153469145926, 0.0020803919533727232, 0.15385847419497328, 0.10378146421333606, 0.025155710531156752, 0.1703786257784451, 0.1350888735614717, -0.016161902151493865, 0.08228317151479604, -0.15708371295061493, -0.0724106653802877, -0.3041132467374804, -0.10200728981773817, -0.1306404612411128, 0.0032590826748047845, -0.09305583940181646, -0.08973056599255894, 0.3718871788844442, 0.13778725251942486, 0.2752160768556808, -0.10477080793942434, 0.24802110881647457, 0.09136287791219044, 0.042012161286487305, 0.08373225978333745, 0.31131588087368806, 0.21908150912812827, 0.20720490053078378, -0.3177017084649437, 0.05070979161756476, 0.09116458087288715] |
1,802.02293 | Evolution of Magnetic Rayleigh-Taylor Instability into the Outer Solar
Corona and Low Inter Planetary Space | We analyze the observations from Solar TErrestrial RElations Observatory
(STEREO)-A\&B/COR-1 of an eruptive prominence in the intermediate corona on 7
June 2011 at 08:45 UT, which consists of magnetic Rayleigh-Taylor (MRT)
unstable plasma segments. Its upper northward segment shows spatio-temporal
evolution of MRT instability in form of finger structures upto the outer corona
and low inter-planetary space. Using method of Dolei et al.(2014), It is
estimated that the density in each bright finger is greater than corresponding
dark region lying below of it in the surrounding intermediate corona. The
instability is evolved due to wave perturbations that are parallel to the
magnetic field at the density interface. We conjecture that the prominence
plasma is supported by tension component of the magnetic field against gravity.
Using linear stability theory, magnetic field is estimated as 21-40 mG to
suppress growth of MRT in the observed finger structures. In the southward
plasma segment, a horn-like structure is observed at 11:55 UT in the
intermediate corona that also indicates MRT instability. Falling blobs are also
observed in both the plasma segments. In the outer corona upto 6-13 solar
radii, the mushroom-like plasma structures have been identified in the upper
northward MRT unstable plasma segment using STEREO-A/COR-2. These structures
most likely grew due to the breaking and twisting of fingers at large spatial
scales in weaker magnetic fields. In the lower inter-planetary space upto 20
solar radii, these structures are fragmented into various small-scale localized
plasma spikes most likely due to turbulent mixing.
| astro-ph.SR | we analyze the observations from solar terrestrial relations observatory stereoabcor1 of an eruptive prominence in the intermediate corona on 7 june 2011 at 0845 ut which consists of magnetic rayleightaylor mrt unstable plasma segments its upper northward segment shows spatiotemporal evolution of mrt instability in form of finger structures upto the outer corona and low interplanetary space using method of dolei et al2014 it is estimated that the density in each bright finger is greater than corresponding dark region lying below of it in the surrounding intermediate corona the instability is evolved due to wave perturbations that are parallel to the magnetic field at the density interface we conjecture that the prominence plasma is supported by tension component of the magnetic field against gravity using linear stability theory magnetic field is estimated as 2140 mg to suppress growth of mrt in the observed finger structures in the southward plasma segment a hornlike structure is observed at 1155 ut in the intermediate corona that also indicates mrt instability falling blobs are also observed in both the plasma segments in the outer corona upto 613 solar radii the mushroomlike plasma structures have been identified in the upper northward mrt unstable plasma segment using stereoacor2 these structures most likely grew due to the breaking and twisting of fingers at large spatial scales in weaker magnetic fields in the lower interplanetary space upto 20 solar radii these structures are fragmented into various smallscale localized plasma spikes most likely due to turbulent mixing | [['we', 'analyze', 'the', 'observations', 'from', 'solar', 'terrestrial', 'relations', 'observatory', 'stereoabcor1', 'of', 'an', 'eruptive', 'prominence', 'in', 'the', 'intermediate', 'corona', 'on', '7', 'june', '2011', 'at', '0845', 'ut', 'which', 'consists', 'of', 'magnetic', 'rayleightaylor', 'mrt', 'unstable', 'plasma', 'segments', 'its', 'upper', 'northward', 'segment', 'shows', 'spatiotemporal', 'evolution', 'of', 'mrt', 'instability', 'in', 'form', 'of', 'finger', 'structures', 'upto', 'the', 'outer', 'corona', 'and', 'low', 'interplanetary', 'space', 'using', 'method', 'of', 'dolei', 'et', 'al2014', 'it', 'is', 'estimated', 'that', 'the', 'density', 'in', 'each', 'bright', 'finger', 'is', 'greater', 'than', 'corresponding', 'dark', 'region', 'lying', 'below', 'of', 'it', 'in', 'the', 'surrounding', 'intermediate', 'corona', 'the', 'instability', 'is', 'evolved', 'due', 'to', 'wave', 'perturbations', 'that', 'are', 'parallel', 'to', 'the', 'magnetic', 'field', 'at', 'the', 'density', 'interface', 'we', 'conjecture', 'that', 'the', 'prominence', 'plasma', 'is', 'supported', 'by', 'tension', 'component', 'of', 'the', 'magnetic', 'field', 'against', 'gravity', 'using', 'linear', 'stability', 'theory', 'magnetic', 'field', 'is', 'estimated', 'as', '2140', 'mg', 'to', 'suppress', 'growth', 'of', 'mrt', 'in', 'the', 'observed', 'finger', 'structures', 'in', 'the', 'southward', 'plasma', 'segment', 'a', 'hornlike', 'structure', 'is', 'observed', 'at', '1155', 'ut', 'in', 'the', 'intermediate', 'corona', 'that', 'also', 'indicates', 'mrt', 'instability', 'falling', 'blobs', 'are', 'also', 'observed', 'in', 'both', 'the', 'plasma', 'segments', 'in', 'the', 'outer', 'corona', 'upto', '613', 'solar', 'radii', 'the', 'mushroomlike', 'plasma', 'structures', 'have', 'been', 'identified', 'in', 'the', 'upper', 'northward', 'mrt', 'unstable', 'plasma', 'segment', 'using', 'stereoacor2', 'these', 'structures', 'most', 'likely', 'grew', 'due', 'to', 'the', 'breaking', 'and', 'twisting', 'of', 'fingers', 'at', 'large', 'spatial', 'scales', 'in', 'weaker', 'magnetic', 'fields', 'in', 'the', 'lower', 'interplanetary', 'space', 'upto', '20', 'solar', 'radii', 'these', 'structures', 'are', 'fragmented', 'into', 'various', 'smallscale', 'localized', 'plasma', 'spikes', 'most', 'likely', 'due', 'to', 'turbulent', 'mixing']] | [-0.16189598708071423, 0.23021208472099697, -0.026838369108736514, 0.09706010304258338, -0.05063006692299885, -0.061713741179935784, -0.04089138150756837, 0.38222569980449517, -0.22322808992193668, -0.3392235665144969, 0.08632417012348163, -0.23727197999761876, -0.08944214158596434, 0.18379761623978919, 0.009021920781957973, -0.01312177200820677, 0.03319659337724502, -0.014636003916931092, -0.014667351142626864, -0.17222671160350878, 0.2581777804170032, 0.11237786533691141, 0.24333328863852943, 0.0020743545943072866, 0.029865623280710102, -0.11470023529337985, 0.004441529877331792, 0.02984294224630243, -0.13704027256694365, 0.038878666262655535, 0.1794859131239236, 0.061285469693854, 0.2399428019585202, -0.47159378951681513, -0.2336664369881001, -0.041512911468364146, 0.1873209871646321, 0.029033958670036983, -0.000717445660373006, -0.2581666639454815, 0.10300393452278661, -0.10995668736429011, -0.13574676096774352, 0.08161469843542697, 0.0521988783958273, -0.006967111801186919, -0.2668197200075267, 0.12115092269710398, 0.030054537895401672, 0.08987781623050532, -0.1303186582064028, -0.07268549083299669, -0.10303411790768482, 0.07625679176500333, 0.09535379914604887, 0.08924650297671252, 0.20548371577834976, -0.1171926241748187, -0.01321608760555712, 0.3404476994078378, -0.05756152588618701, -0.05608380008298828, 0.2045772202008841, -0.24310242943655774, -0.12595490640497348, 0.2474699634982615, 0.18105141647654224, 0.0627013849631446, -0.06940055338247698, 0.029530151361927427, -0.04852195742025696, 0.1443345783268843, 0.15335617178328792, -0.013406167270815266, 0.27990609396401106, 0.13196546145695812, 0.04045550524903347, 0.13632144026496276, -0.19067754728092376, -0.06367011417311673, -0.25252654643311184, -0.0987119730248957, -0.10980528871984963, -0.012623970272383007, -0.10586460624638545, -0.19147323309111275, 0.3555588178593209, 0.14808688790784502, 0.1894435715709566, -0.06391239682573598, 0.28534580530522735, 0.0867071361680116, 0.08050460295789703, 0.18560776804687873, 0.30142064584913303, 0.2023500118604196, 0.1679711863236996, -0.23471086562269045, 0.04389045732285903, 0.07570694437991751] |
1,802.02294 | Nullity of the Levi-form and the associated subvarieties for
pseudo-convex CR structures of hypersurface type | Let $M^{2n+1}$, $n\ge 1$, be a smooth manifold with a pseudo-convex
integrable CR structure of hypersurface type. We consider a sequence of CR
invariant subsets $ M=\mathcal S_0 \supset \mathcal S_1 \supset \cdots \supset
\mathcal S_{n}, $ where $\mathcal S_q$ is the set of points where the Levi-form
has nullity $\ge q$. We prove that $\mathcal S_q$'s are locally given as common
zero sets of the coefficients $A_j,$ $j=0,1,\ldots, q-1,$ of the characteristic
polynomial of the Levi-form. Some sufficient conditions for local existence of
complex submanifolds are presented in terms of the coefficients $A_j$.
| math.DG | let m2n1 nge 1 be a smooth manifold with a pseudoconvex integrable cr structure of hypersurface type we consider a sequence of cr invariant subsets mmathcal s_0 supset mathcal s_1 supset cdots supset mathcal s_n where mathcal s_q is the set of points where the leviform has nullity ge q we prove that mathcal s_qs are locally given as common zero sets of the coefficients a_j j01ldots q1 of the characteristic polynomial of the leviform some sufficient conditions for local existence of complex submanifolds are presented in terms of the coefficients a_j | [['let', 'm2n1', 'nge', '1', 'be', 'a', 'smooth', 'manifold', 'with', 'a', 'pseudoconvex', 'integrable', 'cr', 'structure', 'of', 'hypersurface', 'type', 'we', 'consider', 'a', 'sequence', 'of', 'cr', 'invariant', 'subsets', 'mmathcal', 's_0', 'supset', 'mathcal', 's_1', 'supset', 'cdots', 'supset', 'mathcal', 's_n', 'where', 'mathcal', 's_q', 'is', 'the', 'set', 'of', 'points', 'where', 'the', 'leviform', 'has', 'nullity', 'ge', 'q', 'we', 'prove', 'that', 'mathcal', 's_qs', 'are', 'locally', 'given', 'as', 'common', 'zero', 'sets', 'of', 'the', 'coefficients', 'a_j', 'j01ldots', 'q1', 'of', 'the', 'characteristic', 'polynomial', 'of', 'the', 'leviform', 'some', 'sufficient', 'conditions', 'for', 'local', 'existence', 'of', 'complex', 'submanifolds', 'are', 'presented', 'in', 'terms', 'of', 'the', 'coefficients', 'a_j']] | [-0.27893494827051957, 0.1250642122907771, 0.01981578055355284, 0.002015053896078219, -0.020573097733884223, -0.20121318605314525, -0.11437832713515188, 0.31366004058056407, -0.3112811788502667, -0.07952734544200615, 0.07483537246136823, -0.31270100366738107, -0.08415089368095828, 0.1308911320856876, -0.09765272353672319, -0.004498681217794203, 0.023611165136874963, 0.1463926869082368, -0.1206096545767246, -0.25543424101649886, 0.3991266463158859, -0.13712625052365993, 0.16350144039218625, 0.0250905799989899, 0.10875627041225218, -0.05375645386262073, 0.106782032453662, -0.05580748801261911, -0.252691159079566, 0.06828967926040706, 0.2954546656045649, 0.1382834012594281, 0.19055389228225167, -0.34453501306060286, -0.11863027251222068, 0.3212949772779312, 0.1921561273953153, -0.14154714892307918, 0.03611736445972282, -0.26884757639943724, 0.19419568816148158, -0.08842071338634318, -0.18847048484409848, -0.0594249261646635, 0.12554513073733284, 0.032647074376129445, -0.38868532063659383, 0.06139890110223657, 0.1314305706208365, 0.12716977050941852, -0.04275690062075026, -0.20320773399952385, -0.13848980701166308, 0.014364052139636542, -0.03969263450837591, 0.13680506757357055, 0.06714487697851533, 0.016622790031962924, -0.04895783270088335, 0.3595868300129142, -0.03545189478124181, -0.29774722443738333, 0.06241016721145974, -0.2130200135935512, -0.18296260117656654, 0.09850659652923545, 0.08168089334956474, 0.20826162234362627, -0.02814664746595857, 0.3056964204698387, -0.14025465267606907, 0.0532997692314287, 0.09311266896418399, 0.03590908434448971, 0.09116355568791429, 0.04891464151442051, 0.10573113131750789, 0.08337016807636247, 0.021444745786074134, 0.018632683985763124, -0.43323222945133844, -0.16271653196050062, -0.1898395675829508, 0.21722109569236636, -0.1746296445839107, -0.15060800909996033, 0.34808751351924405, -0.01912387597064177, 0.250780387489552, 0.10624410087863605, 0.13523008815116352, 0.05714344056792066, -0.03115954712136752, 0.10193844545218679, -0.0018165647398240658, 0.1871449613180529, -0.07990550028367174, -0.1747926904173154, -0.024816464415440956, 0.20502083736161392] |
1,802.02295 | DeepRoad: GAN-based Metamorphic Autonomous Driving System Testing | While Deep Neural Networks (DNNs) have established the fundamentals of
DNN-based autonomous driving systems, they may exhibit erroneous behaviors and
cause fatal accidents. To resolve the safety issues of autonomous driving
systems, a recent set of testing techniques have been designed to automatically
generate test cases, e.g., new input images transformed from the original ones.
Unfortunately, many such generated input images often render inferior
authenticity, lacking accurate semantic information of the driving scenes and
hence compromising the resulting efficacy and reliability.
In this paper, we propose DeepRoad, an unsupervised framework to
automatically generate large amounts of accurate driving scenes to test the
consistency of DNN-based autonomous driving systems across different scenes. In
particular, DeepRoad delivers driving scenes with various weather conditions
(including those with rather extreme conditions) by applying the Generative
Adversarial Networks (GANs) along with the corresponding real-world weather
scenes. Moreover, we have implemented DeepRoad to test three well-recognized
DNN-based autonomous driving systems. Experimental results demonstrate that
DeepRoad can detect thousands of behavioral inconsistencies in these systems.
| cs.SE | while deep neural networks dnns have established the fundamentals of dnnbased autonomous driving systems they may exhibit erroneous behaviors and cause fatal accidents to resolve the safety issues of autonomous driving systems a recent set of testing techniques have been designed to automatically generate test cases eg new input images transformed from the original ones unfortunately many such generated input images often render inferior authenticity lacking accurate semantic information of the driving scenes and hence compromising the resulting efficacy and reliability in this paper we propose deeproad an unsupervised framework to automatically generate large amounts of accurate driving scenes to test the consistency of dnnbased autonomous driving systems across different scenes in particular deeproad delivers driving scenes with various weather conditions including those with rather extreme conditions by applying the generative adversarial networks gans along with the corresponding realworld weather scenes moreover we have implemented deeproad to test three wellrecognized dnnbased autonomous driving systems experimental results demonstrate that deeproad can detect thousands of behavioral inconsistencies in these systems | [['while', 'deep', 'neural', 'networks', 'dnns', 'have', 'established', 'the', 'fundamentals', 'of', 'dnnbased', 'autonomous', 'driving', 'systems', 'they', 'may', 'exhibit', 'erroneous', 'behaviors', 'and', 'cause', 'fatal', 'accidents', 'to', 'resolve', 'the', 'safety', 'issues', 'of', 'autonomous', 'driving', 'systems', 'a', 'recent', 'set', 'of', 'testing', 'techniques', 'have', 'been', 'designed', 'to', 'automatically', 'generate', 'test', 'cases', 'eg', 'new', 'input', 'images', 'transformed', 'from', 'the', 'original', 'ones', 'unfortunately', 'many', 'such', 'generated', 'input', 'images', 'often', 'render', 'inferior', 'authenticity', 'lacking', 'accurate', 'semantic', 'information', 'of', 'the', 'driving', 'scenes', 'and', 'hence', 'compromising', 'the', 'resulting', 'efficacy', 'and', 'reliability', 'in', 'this', 'paper', 'we', 'propose', 'deeproad', 'an', 'unsupervised', 'framework', 'to', 'automatically', 'generate', 'large', 'amounts', 'of', 'accurate', 'driving', 'scenes', 'to', 'test', 'the', 'consistency', 'of', 'dnnbased', 'autonomous', 'driving', 'systems', 'across', 'different', 'scenes', 'in', 'particular', 'deeproad', 'delivers', 'driving', 'scenes', 'with', 'various', 'weather', 'conditions', 'including', 'those', 'with', 'rather', 'extreme', 'conditions', 'by', 'applying', 'the', 'generative', 'adversarial', 'networks', 'gans', 'along', 'with', 'the', 'corresponding', 'realworld', 'weather', 'scenes', 'moreover', 'we', 'have', 'implemented', 'deeproad', 'to', 'test', 'three', 'wellrecognized', 'dnnbased', 'autonomous', 'driving', 'systems', 'experimental', 'results', 'demonstrate', 'that', 'deeproad', 'can', 'detect', 'thousands', 'of', 'behavioral', 'inconsistencies', 'in', 'these', 'systems']] | [-0.11040001047980955, 0.0284219409140427, -0.052465284088005625, 0.10122005926054303, -0.07829944657472272, -0.17142932480367432, -0.004634894069611272, 0.4299990538773792, -0.22308355031002844, -0.3881107065992962, 0.1079319582599315, -0.24286791114580064, -0.2061778258232932, 0.24146794695739768, -0.20322413582609788, 0.13335628010861997, 0.15256350553855078, -0.004740785689569921, -0.016696537078609082, -0.25786676084958127, 0.2887959951656826, 0.004730277113897803, 0.350988343047599, -0.031311372200781035, 0.13210334815639294, -0.07023007235312391, -0.021228914756128297, -0.01002238931194673, 0.014975660643878135, 0.1475646606635391, 0.3433436543675184, 0.19359715841156208, 0.32605530891478773, -0.4741221396696, -0.27753147371445913, 0.12701921732514165, 0.11770671795403316, 0.10802254459260785, -0.03810031067474656, -0.4095846485170547, 0.10000880188280939, -0.17257212572821162, -0.06155883960378733, -0.19088466563040302, -0.029306616079598564, 0.043218549046113844, -0.2755791168504705, 0.012548195383888447, 0.05603517065312536, 0.12181855123379223, -0.06931796405946702, -0.054140427870498525, 0.007629470864360753, 0.23266458190378866, 0.049288974819882286, 0.0024299106277924564, 0.16654480520325401, -0.21446748862356235, -0.140071780418068, 0.3937151758831793, 0.0019442903049778017, -0.1797607258777134, 0.2820220156129272, -0.030813704109667533, -0.169266564020377, 0.11069250649251487, 0.25095378597385815, 0.08270125913882762, -0.20942428714451602, -0.04121418030193863, 0.009226054903202956, 0.14838165303115688, 0.07890438194763624, 0.02461426110017956, 0.20244702190844, 0.20667940739734886, 0.015185480550003592, 0.12351471671995352, -0.10521965787657314, -0.07450898515803385, -0.18060389499338012, -0.02710706486011207, -0.12699980202818378, -0.005556173676658156, -0.0754071015285479, -0.1480594134364288, 0.37000868856419056, 0.3452818880399545, 0.17603808730962642, 0.05674225537898435, 0.3653679157141596, 0.02557819701082952, 0.09242824429592085, 0.07017210389797886, 0.19901111094527768, -0.010514806606806815, 0.16864721696696333, -0.15800392299605023, 0.11205380230690241, 0.0029491086024791002] |
1,802.02296 | High Pressure and Road to Room Temperature Superconductivity | High pressure serves as a path finding tool towards novel structures,
including those with very high Tc.The superconductivity in sulfur hydrides with
record value (203 K) is caused by the phonon mechanism. However, the picture
differs from the conventional one in important ways. The phonon spectrum in
sulfur hydride is both broad and has a complex structure. High value of Tc is
mainly due to strong coupling to the high-frequency optical modes, although the
acoustic phonons also make a noticeable contribution. New approach is
described;it generalizes the standard treatment of the phonon mechanism and
makes it possible to obtain an analytical expression for Tc . It turns out
that, unlike in the conventional case, the value of the isotope coefficient
varies with the pressure and reflects the impact of the optical modes. The
phase diagram, that is the pressure dependence of Tc, is rather peculiar. A
crucial feature is that increasing pressure results in a series of structural
transitions, including the one, which yields the superconducting phase with the
record Tc.In a narrow region near 150GPa the critical temperature rises sharply
from 120K to 200K. The sharp structural transition, which produces the high Tc
phase, is a first-order phase transition caused by interaction between the
order parameter and lattice deformations.Remarkable feature of the electronic
spectrum in the high Tc phase is the appearance of small pockets at the Fermi
level. Their presence leads to a two-gap spectrum, which can, in principle, be
observed, with the future use of tunneling spectroscopy. This feature leads to
non-monotonic and strongly asymmetric pressure dependence of Tc. Other hydrides
can be expected to display even higher values of Tc, up to room temperature.
The fundamental challenge lays in creation a structure capable of displaying
high Tc at ambient pressure.
| cond-mat.supr-con | high pressure serves as a path finding tool towards novel structures including those with very high tcthe superconductivity in sulfur hydrides with record value 203 k is caused by the phonon mechanism however the picture differs from the conventional one in important ways the phonon spectrum in sulfur hydride is both broad and has a complex structure high value of tc is mainly due to strong coupling to the highfrequency optical modes although the acoustic phonons also make a noticeable contribution new approach is describedit generalizes the standard treatment of the phonon mechanism and makes it possible to obtain an analytical expression for tc it turns out that unlike in the conventional case the value of the isotope coefficient varies with the pressure and reflects the impact of the optical modes the phase diagram that is the pressure dependence of tc is rather peculiar a crucial feature is that increasing pressure results in a series of structural transitions including the one which yields the superconducting phase with the record tcin a narrow region near 150gpa the critical temperature rises sharply from 120k to 200k the sharp structural transition which produces the high tc phase is a firstorder phase transition caused by interaction between the order parameter and lattice deformationsremarkable feature of the electronic spectrum in the high tc phase is the appearance of small pockets at the fermi level their presence leads to a twogap spectrum which can in principle be observed with the future use of tunneling spectroscopy this feature leads to nonmonotonic and strongly asymmetric pressure dependence of tc other hydrides can be expected to display even higher values of tc up to room temperature the fundamental challenge lays in creation a structure capable of displaying high tc at ambient pressure | [['high', 'pressure', 'serves', 'as', 'a', 'path', 'finding', 'tool', 'towards', 'novel', 'structures', 'including', 'those', 'with', 'very', 'high', 'tcthe', 'superconductivity', 'in', 'sulfur', 'hydrides', 'with', 'record', 'value', '203', 'k', 'is', 'caused', 'by', 'the', 'phonon', 'mechanism', 'however', 'the', 'picture', 'differs', 'from', 'the', 'conventional', 'one', 'in', 'important', 'ways', 'the', 'phonon', 'spectrum', 'in', 'sulfur', 'hydride', 'is', 'both', 'broad', 'and', 'has', 'a', 'complex', 'structure', 'high', 'value', 'of', 'tc', 'is', 'mainly', 'due', 'to', 'strong', 'coupling', 'to', 'the', 'highfrequency', 'optical', 'modes', 'although', 'the', 'acoustic', 'phonons', 'also', 'make', 'a', 'noticeable', 'contribution', 'new', 'approach', 'is', 'describedit', 'generalizes', 'the', 'standard', 'treatment', 'of', 'the', 'phonon', 'mechanism', 'and', 'makes', 'it', 'possible', 'to', 'obtain', 'an', 'analytical', 'expression', 'for', 'tc', 'it', 'turns', 'out', 'that', 'unlike', 'in', 'the', 'conventional', 'case', 'the', 'value', 'of', 'the', 'isotope', 'coefficient', 'varies', 'with', 'the', 'pressure', 'and', 'reflects', 'the', 'impact', 'of', 'the', 'optical', 'modes', 'the', 'phase', 'diagram', 'that', 'is', 'the', 'pressure', 'dependence', 'of', 'tc', 'is', 'rather', 'peculiar', 'a', 'crucial', 'feature', 'is', 'that', 'increasing', 'pressure', 'results', 'in', 'a', 'series', 'of', 'structural', 'transitions', 'including', 'the', 'one', 'which', 'yields', 'the', 'superconducting', 'phase', 'with', 'the', 'record', 'tcin', 'a', 'narrow', 'region', 'near', '150gpa', 'the', 'critical', 'temperature', 'rises', 'sharply', 'from', '120k', 'to', '200k', 'the', 'sharp', 'structural', 'transition', 'which', 'produces', 'the', 'high', 'tc', 'phase', 'is', 'a', 'firstorder', 'phase', 'transition', 'caused', 'by', 'interaction', 'between', 'the', 'order', 'parameter', 'and', 'lattice', 'deformationsremarkable', 'feature', 'of', 'the', 'electronic', 'spectrum', 'in', 'the', 'high', 'tc', 'phase', 'is', 'the', 'appearance', 'of', 'small', 'pockets', 'at', 'the', 'fermi', 'level', 'their', 'presence', 'leads', 'to', 'a', 'twogap', 'spectrum', 'which', 'can', 'in', 'principle', 'be', 'observed', 'with', 'the', 'future', 'use', 'of', 'tunneling', 'spectroscopy', 'this', 'feature', 'leads', 'to', 'nonmonotonic', 'and', 'strongly', 'asymmetric', 'pressure', 'dependence', 'of', 'tc', 'other', 'hydrides', 'can', 'be', 'expected', 'to', 'display', 'even', 'higher', 'values', 'of', 'tc', 'up', 'to', 'room', 'temperature', 'the', 'fundamental', 'challenge', 'lays', 'in', 'creation', 'a', 'structure', 'capable', 'of', 'displaying', 'high', 'tc', 'at', 'ambient', 'pressure']] | [-0.1377363020305297, 0.19769865240433038, -0.08012278972000315, -0.003004302940299285, -0.07975629447509759, -0.12923989806420588, 0.11502203562473558, 0.3633576779529966, -0.2599782111751446, -0.30234146611604457, 0.02349735228344798, -0.3257277507543692, -0.11554489730664626, 0.18662944372165305, 0.007584527488224608, -5.361508966447657e-05, -0.030715447706009806, 0.0376251392656584, -0.09831261978954366, -0.16908904794314555, 0.3012532055779392, 0.09969777426008007, 0.3573095900167165, 0.10981645461709784, 0.03890646142515771, -0.06237139301856273, 0.06507094891677642, 0.02657917919287715, -0.09734020255421236, 0.05419934321965637, 0.28595556209911593, -0.009439386417717946, 0.22406675940668533, -0.34878099416543185, -0.2403375155276394, 0.05411330980072119, 0.09770894897218536, 0.13745856202922055, -0.05215929180608484, -0.2228345496732549, 0.0543109219270389, -0.10973322438959289, -0.14830569710084718, -0.08138289029292506, -0.009030125635387055, -0.04495404948488456, -0.24428420249143903, 0.13600258777823282, 0.045298288557036166, 0.0877005042700932, -0.07627267411725339, -0.11746575394886193, -0.04704357574790202, 0.06762993826113384, 0.05625416766129562, 0.0717406792157723, 0.14409505014693172, -0.14176566560836362, -0.027292139121684534, 0.40681016618257454, -0.08725916004924361, -0.030591966323393942, 0.2081322035117974, -0.1729676248923201, -0.0733987201886364, 0.23523853830672029, 0.09422399621499011, 0.07519310210381859, -0.11181347429439233, 0.044311237358287424, 0.03346165908050948, 0.18779755689781802, 0.0463220544416329, 0.0665956252856694, 0.23483010100851595, 0.19477241171668444, 0.04461132639553398, 0.1542992936063895, -0.11290877855960922, -0.06517157807869933, -0.2332289807097023, -0.15649934215150002, -0.1419990934319152, 0.019029445071897372, -0.09753121232492488, -0.18170308640571953, 0.37767516707455545, 0.15251844253146155, 0.25171016989564843, -0.045270388977650296, 0.25611219899006316, 0.15710128692303912, 0.10280681986708981, 0.040021716541578545, 0.27037328386775633, 0.1364070831284184, 0.136580135037416, -0.2732501718448475, 0.1107612448021898, 0.008973550298582393] |
1,802.02297 | 3D Point Cloud Descriptors in Hand-crafted and Deep Learning Age:
State-of-the-Art | The introduction of inexpensive 3D data acquisition devices has promisingly
facilitated the wide availability and popularity of 3D point cloud, which
attracts more attention to the effective extraction of novel 3D point cloud
descriptors for accuracy of the efficiency of 3D computer vision tasks in
recent years. However, how to develop discriminative and robust feature
descriptors from 3D point cloud remains a challenging task due to their
intrinsic characteristics. In this paper, we give a comprehensively insightful
investigation of the existing 3D point cloud descriptors. These methods can
principally be divided into two categories according to the advancement of
descriptors: hand-crafted based and deep learning-based apporaches, which will
be further discussed from the perspective of elaborate classification, their
advantages, and limitations. Finally, we present the future research direction
of the extraction of 3D point cloud descriptors.
| cs.CV | the introduction of inexpensive 3d data acquisition devices has promisingly facilitated the wide availability and popularity of 3d point cloud which attracts more attention to the effective extraction of novel 3d point cloud descriptors for accuracy of the efficiency of 3d computer vision tasks in recent years however how to develop discriminative and robust feature descriptors from 3d point cloud remains a challenging task due to their intrinsic characteristics in this paper we give a comprehensively insightful investigation of the existing 3d point cloud descriptors these methods can principally be divided into two categories according to the advancement of descriptors handcrafted based and deep learningbased apporaches which will be further discussed from the perspective of elaborate classification their advantages and limitations finally we present the future research direction of the extraction of 3d point cloud descriptors | [['the', 'introduction', 'of', 'inexpensive', '3d', 'data', 'acquisition', 'devices', 'has', 'promisingly', 'facilitated', 'the', 'wide', 'availability', 'and', 'popularity', 'of', '3d', 'point', 'cloud', 'which', 'attracts', 'more', 'attention', 'to', 'the', 'effective', 'extraction', 'of', 'novel', '3d', 'point', 'cloud', 'descriptors', 'for', 'accuracy', 'of', 'the', 'efficiency', 'of', '3d', 'computer', 'vision', 'tasks', 'in', 'recent', 'years', 'however', 'how', 'to', 'develop', 'discriminative', 'and', 'robust', 'feature', 'descriptors', 'from', '3d', 'point', 'cloud', 'remains', 'a', 'challenging', 'task', 'due', 'to', 'their', 'intrinsic', 'characteristics', 'in', 'this', 'paper', 'we', 'give', 'a', 'comprehensively', 'insightful', 'investigation', 'of', 'the', 'existing', '3d', 'point', 'cloud', 'descriptors', 'these', 'methods', 'can', 'principally', 'be', 'divided', 'into', 'two', 'categories', 'according', 'to', 'the', 'advancement', 'of', 'descriptors', 'handcrafted', 'based', 'and', 'deep', 'learningbased', 'apporaches', 'which', 'will', 'be', 'further', 'discussed', 'from', 'the', 'perspective', 'of', 'elaborate', 'classification', 'their', 'advantages', 'and', 'limitations', 'finally', 'we', 'present', 'the', 'future', 'research', 'direction', 'of', 'the', 'extraction', 'of', '3d', 'point', 'cloud', 'descriptors']] | [-0.05620372339292183, -0.030934209788135963, -0.10487722674631239, 0.008480521743288538, -0.09199974743087831, -0.14897369385203896, 0.03730226247759728, 0.4271140768096837, -0.2844837482279057, -0.3095790083992624, 0.09974604934412877, -0.24927239685648067, -0.18084991022067912, 0.18124410389539072, -0.13139037616201676, 0.10280224054312224, 0.1182582439539735, -0.018650659710949508, -0.12729856398586623, -0.24570453852784874, 0.33455418839174156, 0.06515545321791946, 0.38697047609671514, 0.076351789993864, 0.0786489228348193, -0.034417958952390644, -0.08995105276870377, 0.002375067291669599, -0.07579209905281245, 0.26260938325568156, 0.3195500149158761, 0.1948333139619482, 0.2728015539537677, -0.4496340062126846, -0.2449577744855025, 0.05414327685995137, 0.18547021247350665, 0.11001221900155275, -0.09840518110724909, -0.34248476525467325, 0.10172124742316288, -0.16678387326571872, -0.05659820538804685, -0.15639033074480455, 0.05978635315927129, -0.00416218901398893, -0.20182516554589658, 0.01305310602658531, 0.04694202491458889, 0.10339935484123142, -0.04209902646225066, -0.12610808855285593, 0.009809374038869625, 0.18968233340488308, 0.03467688654028975, 0.07925989053140203, 0.19528282290625879, -0.2343185989319703, -0.10275931477800067, 0.4342906796099508, 0.013468356305298478, -0.17521759360234307, 0.2379435693129541, -0.03943245436761679, -0.14837643434464767, 0.1395915543895064, 0.248365242523826, 0.11781741122317993, -0.15872753074611812, 0.025194903433336604, 0.004471443970139851, 0.12791170346441932, -0.0044311686999261675, 0.04923082402434803, 0.29131236540920596, 0.2533713062567746, 0.02197824346469989, 0.13266058054903304, -0.18130327268804916, -0.0893521168447264, -0.1608089651528965, -0.13722422153017866, -0.1907788345364251, 0.008591668334488264, -0.08043868120319744, -0.12953041036791332, 0.43070311002049816, 0.2714280337471898, 0.2132263700443539, -0.0008320818442906089, 0.37984626570387797, 0.021085050569929403, 0.10307593386652811, 0.04716130209742593, 0.1950431166572825, -0.006020936983130763, 0.16618227869998115, -0.13463437638368786, 0.02815027297594283, 0.07210869929814875] |
1,802.02298 | Surface reconstruction, premelting, and collapse of open-cell nanoporous
Cu via thermal annealing | We systematic investigate the collapse of a set of open-cell nanoporous Cu
(np-Cu) with the same porosity and shapes, but different specific surface area,
during thermal annealing, via performing large-scale molecular dynamics
simulations. Surface premelting is dominated in their collapses, and surface
premelting temperatures reduce linearly with the increase of specific surface
area. The collapse mechanisms are different for np-Cu with different specific
surface area. If the specific surface area less than a critical value ($\sim$
2.38 nm$^{-1}$), direct surface premelting, giving rise to the transition of
ligaments from solid to liquid states, is the cause to facilitate falling-down
of np-Cu during thermal annealing. While surface premelting and following
recrystallization, accelerating the sloughing of ligaments and annihilation of
pores, is the other mechanism, as exceeding the critical specific surface area.
The recrystallization occurs at the temperatures below supercooling, where
liquid is instable and instantaneous. Thermal-induced surface reconstruction
prompts surface premelting via facilitating local "disordering" and "chaotic"
at the surface, which are the preferred sites for surface premelting.
| cond-mat.mtrl-sci | we systematic investigate the collapse of a set of opencell nanoporous cu npcu with the same porosity and shapes but different specific surface area during thermal annealing via performing largescale molecular dynamics simulations surface premelting is dominated in their collapses and surface premelting temperatures reduce linearly with the increase of specific surface area the collapse mechanisms are different for npcu with different specific surface area if the specific surface area less than a critical value sim 238 nm1 direct surface premelting giving rise to the transition of ligaments from solid to liquid states is the cause to facilitate fallingdown of npcu during thermal annealing while surface premelting and following recrystallization accelerating the sloughing of ligaments and annihilation of pores is the other mechanism as exceeding the critical specific surface area the recrystallization occurs at the temperatures below supercooling where liquid is instable and instantaneous thermalinduced surface reconstruction prompts surface premelting via facilitating local disordering and chaotic at the surface which are the preferred sites for surface premelting | [['we', 'systematic', 'investigate', 'the', 'collapse', 'of', 'a', 'set', 'of', 'opencell', 'nanoporous', 'cu', 'npcu', 'with', 'the', 'same', 'porosity', 'and', 'shapes', 'but', 'different', 'specific', 'surface', 'area', 'during', 'thermal', 'annealing', 'via', 'performing', 'largescale', 'molecular', 'dynamics', 'simulations', 'surface', 'premelting', 'is', 'dominated', 'in', 'their', 'collapses', 'and', 'surface', 'premelting', 'temperatures', 'reduce', 'linearly', 'with', 'the', 'increase', 'of', 'specific', 'surface', 'area', 'the', 'collapse', 'mechanisms', 'are', 'different', 'for', 'npcu', 'with', 'different', 'specific', 'surface', 'area', 'if', 'the', 'specific', 'surface', 'area', 'less', 'than', 'a', 'critical', 'value', 'sim', '238', 'nm1', 'direct', 'surface', 'premelting', 'giving', 'rise', 'to', 'the', 'transition', 'of', 'ligaments', 'from', 'solid', 'to', 'liquid', 'states', 'is', 'the', 'cause', 'to', 'facilitate', 'fallingdown', 'of', 'npcu', 'during', 'thermal', 'annealing', 'while', 'surface', 'premelting', 'and', 'following', 'recrystallization', 'accelerating', 'the', 'sloughing', 'of', 'ligaments', 'and', 'annihilation', 'of', 'pores', 'is', 'the', 'other', 'mechanism', 'as', 'exceeding', 'the', 'critical', 'specific', 'surface', 'area', 'the', 'recrystallization', 'occurs', 'at', 'the', 'temperatures', 'below', 'supercooling', 'where', 'liquid', 'is', 'instable', 'and', 'instantaneous', 'thermalinduced', 'surface', 'reconstruction', 'prompts', 'surface', 'premelting', 'via', 'facilitating', 'local', 'disordering', 'and', 'chaotic', 'at', 'the', 'surface', 'which', 'are', 'the', 'preferred', 'sites', 'for', 'surface', 'premelting']] | [-0.09719192074950446, 0.2406194448527513, -0.06389389782015122, -0.006017040667321646, -0.021603942929174412, -0.1301794589468927, 0.06193856605413285, 0.3532643396068703, -0.2606626499274915, -0.333896136849018, 0.087718334749595, -0.282745244191381, -0.10215091883966869, 0.19349853035387105, -0.004057183918176275, 0.01758474802993464, -0.01172000313967918, -0.03420620632682447, -0.10752321333821976, -0.20794211150231687, 0.2935618163679134, 0.10499402844544613, 0.3184543782196036, 0.1458519898355007, 0.03590223648105607, -0.05184188215344241, 0.06576188735974332, 0.025282744448067565, -0.21625226469654024, 0.03749025465354366, 0.21136112242485539, -0.017569474714356617, 0.19083920237149649, -0.5044405995106155, -0.27221288593171983, 0.06624772024736034, 0.09110726741227236, 0.13262307823452196, -0.04068391661681799, -0.20539110649701658, 0.0648556589036051, -0.0814422071032988, -0.1180649956942282, 0.011574056953417532, 0.042929235865559544, -0.0011293413308025762, -0.17466272800158936, 0.14066907838551385, 0.04820837915564577, 0.10542385597346407, -0.09824810389457553, -0.10838454615776286, -0.14881516844457524, 0.09928409455583967, 0.050579958979153274, 0.06615983777058622, 0.2977310665290464, -0.13403837395775497, 0.0146370308812369, 0.35569252727383915, -0.024581954033188098, -0.08904049583202736, 0.2567039602344404, -0.18591188597633984, -0.017057379998379585, 0.2756977776107802, 0.14788310397275245, 0.09304011681568668, -0.11542414704507048, 0.009975945634174753, 0.07168963225840619, 0.14472764510604919, 0.119952187574271, -0.03754187636359623, 0.29622565822562935, 0.2525176171664939, 0.07493410976321409, 0.14051463231126862, -0.15319307993702364, -0.08029512483167998, -0.26107556756980943, -0.21761120324107733, -0.16475577658945412, 0.018936636716578945, -0.1006176456498603, -0.21043764038406537, 0.3322665924488595, 0.05318259325938539, 0.17592978427243053, -0.004727892315360915, 0.21458420151576513, 0.04741366643777865, 0.06631470139157804, 0.04743388147290909, 0.21173070271809896, 0.1076027892671074, 0.07579129430408957, -0.27997023477360156, 0.11141858581510006, 0.009615756808356805] |
1,802.02299 | Random taste heterogeneity in discrete choice models: Flexible
nonparametric finite mixture distributions | This study proposes a mixed logit model with multivariate nonparametric
finite mixture distributions. The support of the distribution is specified as a
high-dimensional grid over the coefficient space, with equal or unequal
intervals between successive points along the same dimension; the location of
each point on the grid and the probability mass at that point are model
parameters that need to be estimated. The framework does not require the
analyst to specify the shape of the distribution prior to model estimation, but
can approximate any multivariate probability distribution function to any
arbitrary degree of accuracy. The grid with unequal intervals, in particular,
offers greater flexibility than existing multivariate nonparametric
specifications, while requiring the estimation of a small number of additional
parameters. An expectation maximization algorithm is developed for the
estimation of these models. Multiple synthetic datasets and a case study on
travel mode choice behavior are used to demonstrate the value of the model
framework and estimation algorithm. Compared to extant models that incorporate
random taste heterogeneity through continuous mixture distributions, the
proposed model provides better out-of-sample predictive ability. Findings
reveal significant differences in willingness to pay measures between the
proposed model and extant specifications. The case study further demonstrates
the ability of the proposed model to endogenously recover patterns of attribute
non-attendance and choice set formation.
| econ.EM stat.AP | this study proposes a mixed logit model with multivariate nonparametric finite mixture distributions the support of the distribution is specified as a highdimensional grid over the coefficient space with equal or unequal intervals between successive points along the same dimension the location of each point on the grid and the probability mass at that point are model parameters that need to be estimated the framework does not require the analyst to specify the shape of the distribution prior to model estimation but can approximate any multivariate probability distribution function to any arbitrary degree of accuracy the grid with unequal intervals in particular offers greater flexibility than existing multivariate nonparametric specifications while requiring the estimation of a small number of additional parameters an expectation maximization algorithm is developed for the estimation of these models multiple synthetic datasets and a case study on travel mode choice behavior are used to demonstrate the value of the model framework and estimation algorithm compared to extant models that incorporate random taste heterogeneity through continuous mixture distributions the proposed model provides better outofsample predictive ability findings reveal significant differences in willingness to pay measures between the proposed model and extant specifications the case study further demonstrates the ability of the proposed model to endogenously recover patterns of attribute nonattendance and choice set formation | [['this', 'study', 'proposes', 'a', 'mixed', 'logit', 'model', 'with', 'multivariate', 'nonparametric', 'finite', 'mixture', 'distributions', 'the', 'support', 'of', 'the', 'distribution', 'is', 'specified', 'as', 'a', 'highdimensional', 'grid', 'over', 'the', 'coefficient', 'space', 'with', 'equal', 'or', 'unequal', 'intervals', 'between', 'successive', 'points', 'along', 'the', 'same', 'dimension', 'the', 'location', 'of', 'each', 'point', 'on', 'the', 'grid', 'and', 'the', 'probability', 'mass', 'at', 'that', 'point', 'are', 'model', 'parameters', 'that', 'need', 'to', 'be', 'estimated', 'the', 'framework', 'does', 'not', 'require', 'the', 'analyst', 'to', 'specify', 'the', 'shape', 'of', 'the', 'distribution', 'prior', 'to', 'model', 'estimation', 'but', 'can', 'approximate', 'any', 'multivariate', 'probability', 'distribution', 'function', 'to', 'any', 'arbitrary', 'degree', 'of', 'accuracy', 'the', 'grid', 'with', 'unequal', 'intervals', 'in', 'particular', 'offers', 'greater', 'flexibility', 'than', 'existing', 'multivariate', 'nonparametric', 'specifications', 'while', 'requiring', 'the', 'estimation', 'of', 'a', 'small', 'number', 'of', 'additional', 'parameters', 'an', 'expectation', 'maximization', 'algorithm', 'is', 'developed', 'for', 'the', 'estimation', 'of', 'these', 'models', 'multiple', 'synthetic', 'datasets', 'and', 'a', 'case', 'study', 'on', 'travel', 'mode', 'choice', 'behavior', 'are', 'used', 'to', 'demonstrate', 'the', 'value', 'of', 'the', 'model', 'framework', 'and', 'estimation', 'algorithm', 'compared', 'to', 'extant', 'models', 'that', 'incorporate', 'random', 'taste', 'heterogeneity', 'through', 'continuous', 'mixture', 'distributions', 'the', 'proposed', 'model', 'provides', 'better', 'outofsample', 'predictive', 'ability', 'findings', 'reveal', 'significant', 'differences', 'in', 'willingness', 'to', 'pay', 'measures', 'between', 'the', 'proposed', 'model', 'and', 'extant', 'specifications', 'the', 'case', 'study', 'further', 'demonstrates', 'the', 'ability', 'of', 'the', 'proposed', 'model', 'to', 'endogenously', 'recover', 'patterns', 'of', 'attribute', 'nonattendance', 'and', 'choice', 'set', 'formation']] | [-0.05568177333959654, 0.02913862527451851, -0.09734177336536555, 0.08012312817165232, -0.08262923048567716, -0.16512376793091083, 0.07678717690847676, 0.4025898099600993, -0.23786633914278354, -0.3459793481548938, 0.07340543124647175, -0.24590145960165602, -0.11528148275640517, 0.14353244549015975, -0.09025426216302784, 0.08816781460902551, 0.05662317246552212, 0.03192126410000061, -0.06358978248209934, -0.25538806014766896, 0.28300214476917906, 0.07709759890739978, 0.34908490747006404, -0.007212023218421059, 0.11709416922800571, 0.03444658517535707, -0.05263151759518897, -0.0037137155694061358, -0.09648024042174559, 0.13401890794436136, 0.2141235682026861, 0.16260157789629712, 0.3116887273672209, -0.3747356734411032, -0.2651186252133576, 0.18541588171393852, 0.12165644994604884, 0.07280066975396983, 0.03128248226453757, -0.26000611787377337, 0.06580275926454407, -0.19207610125030677, -0.11791822734866636, -0.08673545561247954, -0.03862909230412225, 0.03839138757030014, -0.34960764291894586, 0.07043560600356648, 0.033152249648184, 0.05162187579265231, -0.05672188112145738, -0.1489807927228631, -0.033579834567650256, 0.1366227493406903, 0.06943437010664234, 0.0019038284434053046, 0.09987498777142416, -0.10532602914975507, -0.12345857708283735, 0.354087701677431, -0.04346540992406113, -0.27834695499580075, 0.18362569612401314, -0.15613345821664013, -0.1001423843877597, 0.10565191746314263, 0.22386957863582885, 0.08325504199213658, -0.12772113846019945, 0.04539148247864365, -0.03325118452495964, 0.19573824727908853, 0.007700174251416077, -0.01862581023413912, 0.21118405689183553, 0.16321899813354118, 0.07504192722909567, 0.12152859495890206, -0.11446620636033239, -0.14204849252753235, -0.27706203088449977, -0.10312877599520746, -0.1890310667441992, -0.04260369611431627, -0.17188666617308895, -0.18665910734422073, 0.4073575866921736, 0.2201857555903391, 0.2245511196206617, 0.12186090694309247, 0.30997017345011785, 0.09896605119778272, 0.03337440115002984, 0.06541399084704204, 0.13003454465824352, 0.06717716273528317, 0.037867363301403306, -0.19613883158416245, 0.17147067334089014, 0.013219952348326505] |
1,802.023 | Quantum-optimal detection of one-versus-two incoherent optical sources
with arbitrary separation | We analyze the fundamental quantum limit of the resolution of an optical
imaging system from the perspective of the detection problem of deciding
whether the optical field in the image plane is generated by one incoherent
on-axis source with brightness $\epsilon$ or by two $\epsilon/2$-brightness
incoherent sources that are symmetrically disposed about the optical axis.
Using the exact thermal-state model of the field, we derive the quantum
Chernoff bound for the detection problem, which specifies the optimum rate of
decay of the error probability with increasing number of collected photons that
is allowed by quantum mechanics. We then show that recently proposed
linear-optic schemes approach the quantum Chernoff bound---the method of binary
spatial-mode demultiplexing (B-SPADE) is quantum-optimal for all values of
separation, while a method using image-inversion interferometry (SLIVER) is
near-optimal for sub-Rayleigh separations. We then simplify our model using a
low-brightness approximation that is very accurate for optical microscopy and
astronomy, derive quantum Chernoff bounds conditional on the number of photons
detected, and show the optimality of our schemes in this conditional detection
paradigm. For comparison, we analytically demonstrate the superior scaling of
the Chernoff bound for our schemes with source separation relative to that of
spatially-resolved direct imaging. Our schemes have the advantages over the
quantum-optimal (Helstrom) measurement in that they do not involve joint
measurements over multiple modes, and that they do not require the angular
separation for the two-source hypothesis to be given \emph{a priori} and can
offer that information as a bonus in the event of a successful detection.
| quant-ph physics.optics | we analyze the fundamental quantum limit of the resolution of an optical imaging system from the perspective of the detection problem of deciding whether the optical field in the image plane is generated by one incoherent onaxis source with brightness epsilon or by two epsilon2brightness incoherent sources that are symmetrically disposed about the optical axis using the exact thermalstate model of the field we derive the quantum chernoff bound for the detection problem which specifies the optimum rate of decay of the error probability with increasing number of collected photons that is allowed by quantum mechanics we then show that recently proposed linearoptic schemes approach the quantum chernoff boundthe method of binary spatialmode demultiplexing bspade is quantumoptimal for all values of separation while a method using imageinversion interferometry sliver is nearoptimal for subrayleigh separations we then simplify our model using a lowbrightness approximation that is very accurate for optical microscopy and astronomy derive quantum chernoff bounds conditional on the number of photons detected and show the optimality of our schemes in this conditional detection paradigm for comparison we analytically demonstrate the superior scaling of the chernoff bound for our schemes with source separation relative to that of spatiallyresolved direct imaging our schemes have the advantages over the quantumoptimal helstrom measurement in that they do not involve joint measurements over multiple modes and that they do not require the angular separation for the twosource hypothesis to be given empha priori and can offer that information as a bonus in the event of a successful detection | [['we', 'analyze', 'the', 'fundamental', 'quantum', 'limit', 'of', 'the', 'resolution', 'of', 'an', 'optical', 'imaging', 'system', 'from', 'the', 'perspective', 'of', 'the', 'detection', 'problem', 'of', 'deciding', 'whether', 'the', 'optical', 'field', 'in', 'the', 'image', 'plane', 'is', 'generated', 'by', 'one', 'incoherent', 'onaxis', 'source', 'with', 'brightness', 'epsilon', 'or', 'by', 'two', 'epsilon2brightness', 'incoherent', 'sources', 'that', 'are', 'symmetrically', 'disposed', 'about', 'the', 'optical', 'axis', 'using', 'the', 'exact', 'thermalstate', 'model', 'of', 'the', 'field', 'we', 'derive', 'the', 'quantum', 'chernoff', 'bound', 'for', 'the', 'detection', 'problem', 'which', 'specifies', 'the', 'optimum', 'rate', 'of', 'decay', 'of', 'the', 'error', 'probability', 'with', 'increasing', 'number', 'of', 'collected', 'photons', 'that', 'is', 'allowed', 'by', 'quantum', 'mechanics', 'we', 'then', 'show', 'that', 'recently', 'proposed', 'linearoptic', 'schemes', 'approach', 'the', 'quantum', 'chernoff', 'boundthe', 'method', 'of', 'binary', 'spatialmode', 'demultiplexing', 'bspade', 'is', 'quantumoptimal', 'for', 'all', 'values', 'of', 'separation', 'while', 'a', 'method', 'using', 'imageinversion', 'interferometry', 'sliver', 'is', 'nearoptimal', 'for', 'subrayleigh', 'separations', 'we', 'then', 'simplify', 'our', 'model', 'using', 'a', 'lowbrightness', 'approximation', 'that', 'is', 'very', 'accurate', 'for', 'optical', 'microscopy', 'and', 'astronomy', 'derive', 'quantum', 'chernoff', 'bounds', 'conditional', 'on', 'the', 'number', 'of', 'photons', 'detected', 'and', 'show', 'the', 'optimality', 'of', 'our', 'schemes', 'in', 'this', 'conditional', 'detection', 'paradigm', 'for', 'comparison', 'we', 'analytically', 'demonstrate', 'the', 'superior', 'scaling', 'of', 'the', 'chernoff', 'bound', 'for', 'our', 'schemes', 'with', 'source', 'separation', 'relative', 'to', 'that', 'of', 'spatiallyresolved', 'direct', 'imaging', 'our', 'schemes', 'have', 'the', 'advantages', 'over', 'the', 'quantumoptimal', 'helstrom', 'measurement', 'in', 'that', 'they', 'do', 'not', 'involve', 'joint', 'measurements', 'over', 'multiple', 'modes', 'and', 'that', 'they', 'do', 'not', 'require', 'the', 'angular', 'separation', 'for', 'the', 'twosource', 'hypothesis', 'to', 'be', 'given', 'empha', 'priori', 'and', 'can', 'offer', 'that', 'information', 'as', 'a', 'bonus', 'in', 'the', 'event', 'of', 'a', 'successful', 'detection']] | [-0.10690679768379778, 0.08107748615654418, -0.11544583850167692, 0.047888132989406584, -0.02865074139274657, -0.16309227539692073, 0.08136943053244614, 0.3848890287587419, -0.24504299445450306, -0.31918117744498886, 0.09224937976524233, -0.2577801305963658, -0.117429029812105, 0.25413177036307755, -0.045748242678120735, 0.08808226633962477, 0.07706967915780842, 0.029405058161355555, -0.06332936745788902, -0.2296664735469967, 0.2851916313767433, 0.06451308456016705, 0.2953184410445392, 0.04433424503915012, 0.1381604973934591, 0.0426580419393722, -0.013530766261741519, -0.010325757399201394, -0.10551365141873248, 0.12193060774821789, 0.24849575047614053, 0.17020301858521997, 0.240917311379686, -0.3795720339566469, -0.21251837652549146, 0.1084430785421282, 0.16324934997968377, 0.13263222769636196, -0.04500269990460947, -0.292294939389918, 0.08337128965975717, -0.15255764331296087, -0.07656307996623218, -0.05677209184505046, -0.015437758083455265, 0.02674242001841776, -0.2761796505562961, 0.09087335312296636, 0.05072595059822197, 0.02714398178085685, -0.03510150084085763, -0.08421193222282454, 0.05097022999636829, 0.1254001934491098, -0.01797461021524214, 0.021333736057858915, 0.09272001580521465, -0.12763570422073825, -0.14547557259723545, 0.32121405337378384, -0.052829886057414115, -0.1896042798550334, 0.15583977974765004, -0.1332940815880429, -0.09958713004738093, 0.13900191025063396, 0.15097095777280628, 0.13597299708309582, -0.1166927287131548, 0.03795342529844493, -0.04368833244591951, 0.20255378303583713, 0.08568747235648334, 0.11831387822609395, 0.20166936444910244, 0.11190747559070587, 0.09040013249777258, 0.1332367133772932, -0.16964824979379772, -0.08133232693001628, -0.2920471400229726, -0.15419689992483473, -0.2321569113889709, 0.03733265452284831, -0.09672468249837403, -0.12321668539312668, 0.3404114996623248, 0.18106080310977996, 0.1536877900119871, 0.07493096301006154, 0.35008554930239916, 0.11739778597373515, 0.04509422364830971, 0.06203784909844399, 0.3006249232981354, 0.1289003333831206, 0.05083018567261752, -0.22281381945870818, 0.05831327665533172, 0.04644802740775049] |
1,802.02301 | Game Data Mining Competition on Churn Prediction and Survival Analysis
using Commercial Game Log Data | Game companies avoid sharing their game data with external researchers. Only
a few research groups have been granted limited access to game data so far. The
reluctance of these companies to make data publicly available limits the wide
use and development of data mining techniques and artificial intelligence
research specific to the game industry. In this work, we developed and
implemented an international competition on game data mining using commercial
game log data from one of the major game companies in South Korea: NCSOFT. Our
approach enabled researchers to develop and apply state-of-the-art data mining
techniques to game log data by making the data open. For the competition, data
were collected from Blade & Soul, an action role-playing game, from NCSOFT. The
data comprised approximately 100 GB of game logs from 10,000 players. The main
aim of the competition was to predict whether a player would churn and when the
player would churn during two periods between which the business model was
changed to a free-to-play model from a monthly subscription. The results of the
competition revealed that highly ranked competitors used deep learning, tree
boosting, and linear regression.
| cs.DB | game companies avoid sharing their game data with external researchers only a few research groups have been granted limited access to game data so far the reluctance of these companies to make data publicly available limits the wide use and development of data mining techniques and artificial intelligence research specific to the game industry in this work we developed and implemented an international competition on game data mining using commercial game log data from one of the major game companies in south korea ncsoft our approach enabled researchers to develop and apply stateoftheart data mining techniques to game log data by making the data open for the competition data were collected from blade soul an action roleplaying game from ncsoft the data comprised approximately 100 gb of game logs from 10000 players the main aim of the competition was to predict whether a player would churn and when the player would churn during two periods between which the business model was changed to a freetoplay model from a monthly subscription the results of the competition revealed that highly ranked competitors used deep learning tree boosting and linear regression | [['game', 'companies', 'avoid', 'sharing', 'their', 'game', 'data', 'with', 'external', 'researchers', 'only', 'a', 'few', 'research', 'groups', 'have', 'been', 'granted', 'limited', 'access', 'to', 'game', 'data', 'so', 'far', 'the', 'reluctance', 'of', 'these', 'companies', 'to', 'make', 'data', 'publicly', 'available', 'limits', 'the', 'wide', 'use', 'and', 'development', 'of', 'data', 'mining', 'techniques', 'and', 'artificial', 'intelligence', 'research', 'specific', 'to', 'the', 'game', 'industry', 'in', 'this', 'work', 'we', 'developed', 'and', 'implemented', 'an', 'international', 'competition', 'on', 'game', 'data', 'mining', 'using', 'commercial', 'game', 'log', 'data', 'from', 'one', 'of', 'the', 'major', 'game', 'companies', 'in', 'south', 'korea', 'ncsoft', 'our', 'approach', 'enabled', 'researchers', 'to', 'develop', 'and', 'apply', 'stateoftheart', 'data', 'mining', 'techniques', 'to', 'game', 'log', 'data', 'by', 'making', 'the', 'data', 'open', 'for', 'the', 'competition', 'data', 'were', 'collected', 'from', 'blade', 'soul', 'an', 'action', 'roleplaying', 'game', 'from', 'ncsoft', 'the', 'data', 'comprised', 'approximately', '100', 'gb', 'of', 'game', 'logs', 'from', '10000', 'players', 'the', 'main', 'aim', 'of', 'the', 'competition', 'was', 'to', 'predict', 'whether', 'a', 'player', 'would', 'churn', 'and', 'when', 'the', 'player', 'would', 'churn', 'during', 'two', 'periods', 'between', 'which', 'the', 'business', 'model', 'was', 'changed', 'to', 'a', 'freetoplay', 'model', 'from', 'a', 'monthly', 'subscription', 'the', 'results', 'of', 'the', 'competition', 'revealed', 'that', 'highly', 'ranked', 'competitors', 'used', 'deep', 'learning', 'tree', 'boosting', 'and', 'linear', 'regression']] | [-0.04147949946890285, 0.02393410030282378, -0.11300893299286605, 0.094613618046541, -0.15328408556900197, -0.18780519622277908, 0.13364297052174406, 0.3870323530889006, -0.2839710098485993, -0.38575306377794233, 0.13731040196713581, -0.3556482449171737, -0.11505573007568556, 0.15379394023799367, -0.132865013860126, 0.03200243393419891, 0.11797849392838856, 0.05503233323394451, 0.10607292594920759, -0.34665775865376475, 0.29057929909697944, 0.05546315332673745, 0.33876954259661335, 0.028938283117973716, 0.07443572039483115, -0.014315983502104158, -0.07835574902378784, -0.012900887556644458, -0.10248589818886142, 0.14735067890214068, 0.3696965952992179, 0.2371251726515531, 0.3951049085295889, -0.4513853180212199, -0.1181486862544496, 0.0987601455511345, 0.09033334506575459, 0.07694384488164477, -0.0296056588907646, -0.31695680916860136, 0.04140850581273797, -0.23728995475797884, -0.046959812242177226, -0.05130070280684258, 0.011224163192955236, -0.013579791778215377, -0.28961713495413943, -0.08633123043428866, -0.04355088958982378, 0.14771663879234626, -0.027494516526599243, -0.1352570926881976, -0.01675132031036761, 0.225091774884883, 0.0865464359959988, 0.01787150909520826, 0.14975855779027947, -0.14744829513528135, -0.2159640247243837, 0.3763476934143773, -0.060728276581553525, -0.047750994327768526, 0.17807761086676752, -0.06127383779003335, -0.15841654275408795, 0.08193247608079385, 0.23583894286784143, 0.08039901136315518, -0.21443544324371344, 0.014679120713970073, -0.014259049789078774, 0.19771184895365368, 0.06030587871528922, -0.08565100641190125, 0.16886386935228623, 0.2349003005750297, 0.06411296019195428, 0.08800611456340399, -0.0593764245202164, -0.15697614183168737, -0.15914102154408372, -0.05858447094277669, -0.14043455401695865, 0.003443859940675157, -0.07606403720868696, -0.1196223246046312, 0.3439601035738584, 0.1935018527119512, 0.10021484828233639, 0.03253874440942841, 0.3161579514603301, -0.014218877887688778, 0.12350492076873179, 0.10235999574414104, 0.18057564122387038, 0.02424891995546478, 0.22442643993574204, -0.14979517474390006, 0.10503920599297491, -0.03740453665452679] |
1,802.02302 | An example showing that A-lower semi-continuity is essential for minimax
continuity theorems | Recently Feinberg et al. [arXiv:1609.03990] established results on continuity
properties of minimax values and solution sets for a function of two variables
depending on a parameter. Such minimax problems appear in games with perfect
information, when the second player knows the move of the first one, in
turn-based games, and in robust optimization. Some of the results in
[arXiv:1609.03990] are proved under the assumption that the multifunction,
defining the domains of the second variable, is $A$-lower semi-continuous. The
$A$-lower semi-continuity property is stronger than lower semi-continuity, but
in several important cases these properties coincide. This note provides an
example demonstrating that in general the $A$-lower semi-continuity assumption
cannot be relaxed to lower semi-continuity.
| math.OC | recently feinberg et al arxiv160903990 established results on continuity properties of minimax values and solution sets for a function of two variables depending on a parameter such minimax problems appear in games with perfect information when the second player knows the move of the first one in turnbased games and in robust optimization some of the results in arxiv160903990 are proved under the assumption that the multifunction defining the domains of the second variable is alower semicontinuous the alower semicontinuity property is stronger than lower semicontinuity but in several important cases these properties coincide this note provides an example demonstrating that in general the alower semicontinuity assumption cannot be relaxed to lower semicontinuity | [['recently', 'feinberg', 'et', 'al', 'arxiv160903990', 'established', 'results', 'on', 'continuity', 'properties', 'of', 'minimax', 'values', 'and', 'solution', 'sets', 'for', 'a', 'function', 'of', 'two', 'variables', 'depending', 'on', 'a', 'parameter', 'such', 'minimax', 'problems', 'appear', 'in', 'games', 'with', 'perfect', 'information', 'when', 'the', 'second', 'player', 'knows', 'the', 'move', 'of', 'the', 'first', 'one', 'in', 'turnbased', 'games', 'and', 'in', 'robust', 'optimization', 'some', 'of', 'the', 'results', 'in', 'arxiv160903990', 'are', 'proved', 'under', 'the', 'assumption', 'that', 'the', 'multifunction', 'defining', 'the', 'domains', 'of', 'the', 'second', 'variable', 'is', 'alower', 'semicontinuous', 'the', 'alower', 'semicontinuity', 'property', 'is', 'stronger', 'than', 'lower', 'semicontinuity', 'but', 'in', 'several', 'important', 'cases', 'these', 'properties', 'coincide', 'this', 'note', 'provides', 'an', 'example', 'demonstrating', 'that', 'in', 'general', 'the', 'alower', 'semicontinuity', 'assumption', 'can', 'not', 'be', 'relaxed', 'to', 'lower', 'semicontinuity']] | [-0.10961484067333263, 0.04657006301269056, -0.10957892053660803, 0.10817766369707117, -0.06327415633547519, -0.14902475028897502, 0.03916403154809294, 0.34667285120979485, -0.2629281304502261, -0.27389954168133307, 0.1385461663157912, -0.23534596752558304, -0.14313075386910765, 0.21824800406050468, -0.17711709984827653, 0.05721253977299057, 0.023930261826275716, 0.05811306385190359, -0.06808486373587844, -0.31324914393085884, 0.3396827350370586, -0.00900579841774223, 0.24807792874552043, 0.05699633205482054, 0.0729285312824816, -0.014807361920247786, 0.032495308825413564, 0.03611738065032049, -0.18679272379774506, 0.09759651294111141, 0.2372597071974139, 0.12797095571295358, 0.34027459818337646, -0.38289426649030894, -0.17701410480159602, 0.15106199181172997, 0.05692392824234308, 0.04677263683074021, -0.03845260245933397, -0.26838027875471326, 0.10055300996256326, -0.07963405055592634, -0.10469550908393492, -0.04744932734008346, 0.0009761516620138926, 0.050652218442077616, -0.3197379645467403, 0.046899493771239316, 0.15009834261062288, 0.051024971114072414, -0.11558664234845699, -0.15243004819473885, -0.035444510439577116, 0.078233975263564, 0.051510725249370025, 0.01601234816293332, 0.0921847853959272, -0.1268755870800565, -0.12245280183456739, 0.3246263438819109, -0.04429903021978784, -0.21112332251089225, 0.1928181111538184, -0.13483185839140788, -0.2228448188605918, 0.07749010838909141, 0.10386541358145353, 0.16156619587231294, -0.1263980991047252, 0.10629058248326016, -0.12231002778987334, 0.14055897159102773, 0.11448048533722092, 0.09783398036389761, 0.06820730332193696, 0.11579774310770777, 0.20061443365557352, 0.15535251779095102, 0.01786022112979221, -0.11075565246210317, -0.2980725685816391, -0.14796219828505336, -0.1758010238388254, 0.027912405275986072, -0.09973673187752345, -0.1511008428632132, 0.3291407026523042, 0.14017787777369708, 0.1566201316306563, 0.09257097317770656, 0.25565466572464046, 0.15480615983999865, 0.0019521582871675491, 0.11504551341308147, 0.28042136349462715, 0.14250119180568227, 0.06836689825701926, -0.11274244332837823, 0.157058961011249, 0.11277454432066795] |
1,802.02303 | Optical Photometric Variable Stars towards the Galactic \hii region NGC
2282 | We report here CCD $I$-band time-series photometry of a young (2$-$5 Myr)
cluster NGC 2282 to identify and understand the variability of
pre-main-sequence (PMS) stars. The $I$-band photometry, down to $\sim$ 20.5
mag, enables us to probe the variability towards the lower mass end ($\sim$ 0.1
M$_\odot$) of the PMS stars. From the light curves of 1627 stars, we identified
62 new photometric variable candidates. Their association with the region was
established from H$\alpha$ emission and infrared (IR) excess. Among 62
variables, 30 young variables exhibit H$\alpha$ emission, near-IR (NIR)/mid-IR
(MIR) excess or both, and they are candidate members of the cluster. Out of 62
variables, 41 are periodic variables with the rotation rate ranging from 0.2 to
7 days. The period distribution exhibits a median period at $\sim$ 1-day as in
many young clusters (e.g., NGC~2264, ONC, etc.), but it follows a uni-modal
distribution unlike others having bimodality with the slow rotators peaking at
$\sim$ 6$-$8 days. To investigate the rotation-disk and variability-disk
connection, we derived NIR excess from $\Delta$(I$-$K) and MIR excess from
$Spitzer$ [3.6]$-$[4.5] $\mu$m data. No conclusive evidence of slow rotation
with the presence of disks around stars and fast rotation for diskless stars is
obtained from our periodic variables. A clear increasing trend of the
variability amplitude with the IR excess is found for all variables.
| astro-ph.GA astro-ph.SR | we report here ccd iband timeseries photometry of a young 25 myr cluster ngc 2282 to identify and understand the variability of premainsequence pms stars the iband photometry down to sim 205 mag enables us to probe the variability towards the lower mass end sim 01 m_odot of the pms stars from the light curves of 1627 stars we identified 62 new photometric variable candidates their association with the region was established from halpha emission and infrared ir excess among 62 variables 30 young variables exhibit halpha emission nearir nirmidir mir excess or both and they are candidate members of the cluster out of 62 variables 41 are periodic variables with the rotation rate ranging from 02 to 7 days the period distribution exhibits a median period at sim 1day as in many young clusters eg ngc2264 onc etc but it follows a unimodal distribution unlike others having bimodality with the slow rotators peaking at sim 68 days to investigate the rotationdisk and variabilitydisk connection we derived nir excess from deltaik and mir excess from spitzer 3645 mum data no conclusive evidence of slow rotation with the presence of disks around stars and fast rotation for diskless stars is obtained from our periodic variables a clear increasing trend of the variability amplitude with the ir excess is found for all variables | [['we', 'report', 'here', 'ccd', 'iband', 'timeseries', 'photometry', 'of', 'a', 'young', '25', 'myr', 'cluster', 'ngc', '2282', 'to', 'identify', 'and', 'understand', 'the', 'variability', 'of', 'premainsequence', 'pms', 'stars', 'the', 'iband', 'photometry', 'down', 'to', 'sim', '205', 'mag', 'enables', 'us', 'to', 'probe', 'the', 'variability', 'towards', 'the', 'lower', 'mass', 'end', 'sim', '01', 'm_odot', 'of', 'the', 'pms', 'stars', 'from', 'the', 'light', 'curves', 'of', '1627', 'stars', 'we', 'identified', '62', 'new', 'photometric', 'variable', 'candidates', 'their', 'association', 'with', 'the', 'region', 'was', 'established', 'from', 'halpha', 'emission', 'and', 'infrared', 'ir', 'excess', 'among', '62', 'variables', '30', 'young', 'variables', 'exhibit', 'halpha', 'emission', 'nearir', 'nirmidir', 'mir', 'excess', 'or', 'both', 'and', 'they', 'are', 'candidate', 'members', 'of', 'the', 'cluster', 'out', 'of', '62', 'variables', '41', 'are', 'periodic', 'variables', 'with', 'the', 'rotation', 'rate', 'ranging', 'from', '02', 'to', '7', 'days', 'the', 'period', 'distribution', 'exhibits', 'a', 'median', 'period', 'at', 'sim', '1day', 'as', 'in', 'many', 'young', 'clusters', 'eg', 'ngc2264', 'onc', 'etc', 'but', 'it', 'follows', 'a', 'unimodal', 'distribution', 'unlike', 'others', 'having', 'bimodality', 'with', 'the', 'slow', 'rotators', 'peaking', 'at', 'sim', '68', 'days', 'to', 'investigate', 'the', 'rotationdisk', 'and', 'variabilitydisk', 'connection', 'we', 'derived', 'nir', 'excess', 'from', 'deltaik', 'and', 'mir', 'excess', 'from', 'spitzer', '3645', 'mum', 'data', 'no', 'conclusive', 'evidence', 'of', 'slow', 'rotation', 'with', 'the', 'presence', 'of', 'disks', 'around', 'stars', 'and', 'fast', 'rotation', 'for', 'diskless', 'stars', 'is', 'obtained', 'from', 'our', 'periodic', 'variables', 'a', 'clear', 'increasing', 'trend', 'of', 'the', 'variability', 'amplitude', 'with', 'the', 'ir', 'excess', 'is', 'found', 'for', 'all', 'variables']] | [-0.036698990059298796, 0.1413580193077513, -0.08872256558089422, 0.10276587120441019, -0.10295664217246167, -0.08413079840669391, 0.15032762100433059, 0.46998109544334726, -0.17333847122603852, -0.40128450213136885, 0.0742867608194735, -0.33527029874743125, -0.009140128702343946, 0.18584754472436094, -0.10683805837361267, -0.029961336391268793, 0.07246773224430791, -0.0868331833289714, -0.023271756488594884, -0.2649857984479824, 0.21000334282764532, -0.014968922078703453, 0.12829051196891303, -0.10916011140536551, 0.048709787832628595, -0.08782638360131019, -0.124424726004849, -0.08428793203154016, -0.14078405371508262, 0.022707644323743625, 0.20185016447874726, 0.10507373021965752, 0.1993195628709963, -0.2504496723402787, -0.16129280268342808, 0.08024735151925723, 0.2104038692502291, -0.02835028432950446, -0.03335888562254061, -0.24763178907403158, 0.07301061094841074, -0.1500619319865668, -0.2038812772370875, 0.06950454263512147, 0.138868903303348, 0.03218238760926547, -0.2319403991547473, 0.18304335863976698, -0.010390767796657159, 0.21615485072460608, -0.15530457991867438, -0.14598288233477383, -0.07481638684659478, 0.052158667178346066, 0.040238640806544254, 0.1354322082228497, 0.13866228778171566, -0.12324396913033833, -0.03823230493228472, 0.3600263316825101, -0.10077561301963164, 0.08262026207008903, 0.25962655789244476, -0.2129750382582392, -0.17176817855642842, 0.20008109941002017, 0.11992797069398392, 0.11551081271171398, -0.20201905269534626, -0.0347712831459555, 0.024030280915738313, 0.27787916026496834, 0.07974605596786656, 0.12981427018477265, 0.32843945451815604, 0.08796686871583924, -0.008749566019305516, 0.096536784172763, -0.34775579955275043, -0.07107148842924539, -0.22615212690215472, -0.07538670401725439, -0.07342628475199582, 0.10662084350436114, -0.1749725838640647, -0.10660044823927002, 0.33227776194743197, 0.08629915898654038, 0.2084834382926977, 0.08239059305377092, 0.21662788912803446, 0.09481243203127641, 0.14631985423890467, 0.14839308630726342, 0.31097461649327784, 0.20129864002442321, 0.11775555436439607, -0.2071865396763715, 0.04224589366440174, -0.0755586014956945] |
1,802.02304 | The equivariant cohomology ring of a cohomogeneity-one action | We compute the rational Borel equivariant cohomology ring of a
cohomogeneity-one action of a compact Lie group.
| math.AT math.DG | we compute the rational borel equivariant cohomology ring of a cohomogeneityone action of a compact lie group | [['we', 'compute', 'the', 'rational', 'borel', 'equivariant', 'cohomology', 'ring', 'of', 'a', 'cohomogeneityone', 'action', 'of', 'a', 'compact', 'lie', 'group']] | [-0.3570668210878092, -0.022242131204727816, -0.1975758446051794, 0.08439200448200983, -0.2131347266738029, -0.09673357617986553, -0.009766371372868033, 0.35434406688984704, -0.3300598934292793, -0.07823963748181567, 0.11537357197855325, -0.14781267765690298, -0.14234260688809788, 0.15988342151703203, -0.20485324730329654, -0.08578845814746969, -0.00424497840268647, 0.2561084189835717, -0.17969372320701094, -0.22985852456836522, 0.5054406304569805, -0.07847090550314854, 0.1691831027102821, -0.008514499182210249, 0.20237199896398714, -0.06238161660183002, -0.08423917650875143, -0.04598586194162421, -0.11344106021501563, 0.20013994635904536, 0.38355166432173815, -0.04665183232111089, 0.14602202396182454, -0.3297042412792935, -0.035292049102923446, 0.272071231594857, 0.09002409963046804, -0.057447537231971234, -0.02680660170667312, -0.3343159144415575, 0.11423781032071394, -0.3342330898432171, -0.24393744772190556, -0.09026150690282092, 0.15832349132089055, -0.016922159230007845, -0.19741754409144907, -0.09872082297635429, 0.034431755049702, 0.20283105038106441, -0.1100702358628897, 0.031780802699572896, -0.09483582718188271, 0.122423098751289, -0.13020954074283295, 0.10021865803419668, 0.26309795001083436, -0.04042372200638056, -0.17344261012861834, 0.46224044351016774, -0.15593847807715921, -0.24147114332984476, 0.05059739958275767, -0.285520505379228, -0.2563384438262266, 0.16159526954459794, 0.052900307976147705, 0.2770366407930851, 0.10037289384533377, 0.298641141723184, -0.21142951174474814, -0.027170626241165924, 0.06313184933627353, -0.03324990697643336, 0.16746432679321835, 0.06018809431835132, 0.05457692147020305, 0.07799786134787343, 0.08885594534085077, -0.023823708295822144, -0.3903493802337086, -0.22791520144571276, -0.07325902142945458, 0.26346917650388446, -0.14191542176858468, -0.21861780500587294, 0.4630455968572813, 0.01147530074505245, 0.14737756695488796, 0.2392922728048528, 0.19205420201315598, 0.0475755292127895, 0.0772993967813604, 0.028973737841143328, 0.03343002454322927, 0.2581331668531193, -0.2471983357168296, -0.18287258770535975, -0.22642952910460093, 0.364181427832912] |
1,802.02305 | Self-Supervised Video Hashing with Hierarchical Binary Auto-encoder | Existing video hash functions are built on three isolated stages: frame
pooling, relaxed learning, and binarization, which have not adequately explored
the temporal order of video frames in a joint binary optimization model,
resulting in severe information loss. In this paper, we propose a novel
unsupervised video hashing framework dubbed Self-Supervised Video Hashing
(SSVH), that is able to capture the temporal nature of videos in an end-to-end
learning-to-hash fashion. We specifically address two central problems: 1) how
to design an encoder-decoder architecture to generate binary codes for videos;
and 2) how to equip the binary codes with the ability of accurate video
retrieval. We design a hierarchical binary autoencoder to model the temporal
dependencies in videos with multiple granularities, and embed the videos into
binary codes with less computations than the stacked architecture. Then, we
encourage the binary codes to simultaneously reconstruct the visual content and
neighborhood structure of the videos. Experiments on two real-world datasets
(FCVID and YFCC) show that our SSVH method can significantly outperform the
state-of-the-art methods and achieve the currently best performance on the task
of unsupervised video retrieval.
| cs.CV | existing video hash functions are built on three isolated stages frame pooling relaxed learning and binarization which have not adequately explored the temporal order of video frames in a joint binary optimization model resulting in severe information loss in this paper we propose a novel unsupervised video hashing framework dubbed selfsupervised video hashing ssvh that is able to capture the temporal nature of videos in an endtoend learningtohash fashion we specifically address two central problems 1 how to design an encoderdecoder architecture to generate binary codes for videos and 2 how to equip the binary codes with the ability of accurate video retrieval we design a hierarchical binary autoencoder to model the temporal dependencies in videos with multiple granularities and embed the videos into binary codes with less computations than the stacked architecture then we encourage the binary codes to simultaneously reconstruct the visual content and neighborhood structure of the videos experiments on two realworld datasets fcvid and yfcc show that our ssvh method can significantly outperform the stateoftheart methods and achieve the currently best performance on the task of unsupervised video retrieval | [['existing', 'video', 'hash', 'functions', 'are', 'built', 'on', 'three', 'isolated', 'stages', 'frame', 'pooling', 'relaxed', 'learning', 'and', 'binarization', 'which', 'have', 'not', 'adequately', 'explored', 'the', 'temporal', 'order', 'of', 'video', 'frames', 'in', 'a', 'joint', 'binary', 'optimization', 'model', 'resulting', 'in', 'severe', 'information', 'loss', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'unsupervised', 'video', 'hashing', 'framework', 'dubbed', 'selfsupervised', 'video', 'hashing', 'ssvh', 'that', 'is', 'able', 'to', 'capture', 'the', 'temporal', 'nature', 'of', 'videos', 'in', 'an', 'endtoend', 'learningtohash', 'fashion', 'we', 'specifically', 'address', 'two', 'central', 'problems', '1', 'how', 'to', 'design', 'an', 'encoderdecoder', 'architecture', 'to', 'generate', 'binary', 'codes', 'for', 'videos', 'and', '2', 'how', 'to', 'equip', 'the', 'binary', 'codes', 'with', 'the', 'ability', 'of', 'accurate', 'video', 'retrieval', 'we', 'design', 'a', 'hierarchical', 'binary', 'autoencoder', 'to', 'model', 'the', 'temporal', 'dependencies', 'in', 'videos', 'with', 'multiple', 'granularities', 'and', 'embed', 'the', 'videos', 'into', 'binary', 'codes', 'with', 'less', 'computations', 'than', 'the', 'stacked', 'architecture', 'then', 'we', 'encourage', 'the', 'binary', 'codes', 'to', 'simultaneously', 'reconstruct', 'the', 'visual', 'content', 'and', 'neighborhood', 'structure', 'of', 'the', 'videos', 'experiments', 'on', 'two', 'realworld', 'datasets', 'fcvid', 'and', 'yfcc', 'show', 'that', 'our', 'ssvh', 'method', 'can', 'significantly', 'outperform', 'the', 'stateoftheart', 'methods', 'and', 'achieve', 'the', 'currently', 'best', 'performance', 'on', 'the', 'task', 'of', 'unsupervised', 'video', 'retrieval']] | [-0.06472370716321735, -0.01024937946411167, -0.0923573565757157, 0.08488629761479753, -0.0928916153719118, -0.19524472160785142, -0.02178231713117501, 0.5090688062134568, -0.2968077025058882, -0.32686504726324167, 0.05762992841880977, -0.2676618907746323, -0.19085560817864602, 0.13158279486447988, -0.1750885874563672, 0.08597481056954191, 0.16476102762493985, 0.0662492856424947, -0.11964257157475339, -0.3580158519117661, 0.322348143227721, 0.06303569506957878, 0.3204555486396538, -0.034654112072276505, 0.15677891148894235, -0.004615915801334481, -0.046461497871829564, -0.03864403189206756, -0.0701425975653136, 0.20284338913566574, 0.34537008024918636, 0.2294680935268254, 0.2754556607135036, -0.4060468256744093, -0.2518309043049188, 0.05701479477601063, 0.15616448182552825, 0.09643123908413577, -0.06533113999653857, -0.3151785068372629, 0.13135634850991587, -0.2004257120899648, 0.12006823662096146, -0.13389199479793942, -0.043520991687855407, -0.02440541691059642, -0.3052018784450279, 0.005855815711446814, 0.09231934705280892, 0.00914098455065955, -0.08128191083611129, -0.05762796898960401, 0.05918171792030959, 0.17657688835781463, 0.004126903952147184, 0.08115589247649671, 0.09802387687689806, -0.15988738470653582, -0.1585413355922701, 0.39850267182577753, -0.057081254811221914, -0.21272381719633646, 0.19258004934500966, -0.00611769563294739, -0.15649315183097756, 0.10944249034552268, 0.29964251516844725, 0.16106573556024353, -0.1786765037023192, -0.0481080890993468, -0.05440214539581504, 0.2635271507445411, 0.07341334537353221, 0.05239408596434407, 0.2031821272493335, 0.2520759459181725, -0.000577346943370873, 0.14910899950503553, -0.15178754058791397, -0.08291524429103182, -0.15826945310470247, -0.06053494681874433, -0.17706243021221177, -0.09169421626855528, -0.1281262112297859, -0.13486857101901345, 0.4138936217010604, 0.2549076470918433, 0.21010054406507056, 0.1221010501466577, 0.36566462518657716, -0.054579051551617186, 0.12699890374492168, 0.11384373705791226, 0.13956326932006374, -0.018898262431605736, 0.14954157257725761, -0.173812797867827, 0.04337521739220819, 0.08935278052641027] |
1,802.02306 | Retrieving nonlinear refractive index of nanocomposites using
finite-difference time-domain simulations | In this Letter, it is proposed a method which utilizes three-dimensional
finite-difference time-domain (FDTD) simulations of light propagation for
restoring the effective Kerr nonlinearity of nanocomposite media. In this
approach, a dependence of the phase shift of the transmitted light on the input
irradiance is exploited. The reconstructed values of the real parts of the
nonlinear refractive index of a structure of randomly arranged spheres are in
good agreement with the predictions of the effective medium approximations.
| physics.optics physics.app-ph | in this letter it is proposed a method which utilizes threedimensional finitedifference timedomain fdtd simulations of light propagation for restoring the effective kerr nonlinearity of nanocomposite media in this approach a dependence of the phase shift of the transmitted light on the input irradiance is exploited the reconstructed values of the real parts of the nonlinear refractive index of a structure of randomly arranged spheres are in good agreement with the predictions of the effective medium approximations | [['in', 'this', 'letter', 'it', 'is', 'proposed', 'a', 'method', 'which', 'utilizes', 'threedimensional', 'finitedifference', 'timedomain', 'fdtd', 'simulations', 'of', 'light', 'propagation', 'for', 'restoring', 'the', 'effective', 'kerr', 'nonlinearity', 'of', 'nanocomposite', 'media', 'in', 'this', 'approach', 'a', 'dependence', 'of', 'the', 'phase', 'shift', 'of', 'the', 'transmitted', 'light', 'on', 'the', 'input', 'irradiance', 'is', 'exploited', 'the', 'reconstructed', 'values', 'of', 'the', 'real', 'parts', 'of', 'the', 'nonlinear', 'refractive', 'index', 'of', 'a', 'structure', 'of', 'randomly', 'arranged', 'spheres', 'are', 'in', 'good', 'agreement', 'with', 'the', 'predictions', 'of', 'the', 'effective', 'medium', 'approximations']] | [-0.13853069330722867, 0.11017618846003112, -0.10951675516371796, 0.0006787660017657977, -0.061597145114142396, -0.07608801902380663, -0.005564929228034112, 0.42228289708108097, -0.2227514832244291, -0.3120280740443956, 0.04204287545229369, -0.2892540895029322, -0.2026705806167772, 0.19895849956876852, -0.0050114044048762945, 0.10333339548114137, 0.03924629958225535, -0.013905526568218097, -0.04834220080043782, -0.19850765274801327, 0.27839563974457515, 0.051751999511056905, 0.3215897579665308, 0.0035206401273124403, 0.10239067072556778, 0.03039063929350345, -0.0425395571623699, 0.026012459032044008, -0.0803522093451352, 0.15358733626493773, 0.20995555404428537, -0.007695180877994794, 0.21609139382270734, -0.4127401068637317, -0.27783586640007696, 0.04091696118310021, 0.12056729487179742, 0.11813105515041086, -0.09366713896811057, -0.2705915383510775, 0.05483692152086984, -0.10066925660803817, -0.14566852796865118, -0.013618826781484213, -0.018237343191036155, 0.020710382489608478, -0.3033544625459517, 0.06635198498964189, 0.0015880914598509863, 0.031186968596144157, -0.0636688839680479, -0.04000065424298117, 0.0011763468675025097, 0.1020989355089917, 0.015265338370794213, 0.0013127036138691685, 0.10145320596366927, -0.10301347612100956, -0.0395547179263327, 0.4465008984960906, -0.09243511975605484, -0.21364171828170514, 0.1076293263173142, -0.14843167765058468, 0.009537132039617795, 0.18849377435716716, 0.21236115078405512, 0.1455085308037021, -0.09601079321287984, 0.05876151272156215, -0.053808999217611245, 0.24562657603921442, 0.09337844793358213, 0.025526667811190437, 0.17140226600715866, 0.19888436171837007, -0.025308370989348208, 0.1289115026895586, -0.07473745621898055, -0.057119369023032, -0.2905316308969269, -0.13172621479524033, -0.2271493547535562, -0.0019397166188709534, -0.16561397841780798, -0.20298811622786445, 0.4477492874705946, 0.14673003348727504, 0.15690301834037165, 0.00532675314507169, 0.3698355991925512, 0.12076093254054522, 0.03872771107579594, 0.027108097086092093, 0.2978520066803926, 0.1741036611137452, 0.163706622104608, -0.2472496654040047, 0.027877758202663104, 0.04660510962720138] |
1,802.02307 | An unexpected detection of bifurcated blue straggler sequences in the
young globular cluster NGC 2173 | Bifurcated patterns of blue straggler stars in their color--magnitude
diagrams have atracted significant attention. This type of special (but rare)
pattern of two distinct blue straggler sequences is commonly interpreted as
evidence of cluster core-collapse-driven stellar collisions as an efficient
formation mechanism. Here, we report the detection of a bifurcated blue
straggler distribution in a young Large MagellanicCloud cluster, NGC 2173.
Because of the cluster's low central stellar number density and its young age,
dynamical analysis shows that stellar collisions alone cannot explain the
observed blue straggler stars. Therefore, binary evolution is instead the most
viable explanation of the origin of these blue straggler stars. However, the
reason why binary evolution would render the color--magnitude distribution of
blue straggler stars bifurcated remains unclear.
| astro-ph.SR astro-ph.GA | bifurcated patterns of blue straggler stars in their colormagnitude diagrams have atracted significant attention this type of special but rare pattern of two distinct blue straggler sequences is commonly interpreted as evidence of cluster corecollapsedriven stellar collisions as an efficient formation mechanism here we report the detection of a bifurcated blue straggler distribution in a young large magellaniccloud cluster ngc 2173 because of the clusters low central stellar number density and its young age dynamical analysis shows that stellar collisions alone cannot explain the observed blue straggler stars therefore binary evolution is instead the most viable explanation of the origin of these blue straggler stars however the reason why binary evolution would render the colormagnitude distribution of blue straggler stars bifurcated remains unclear | [['bifurcated', 'patterns', 'of', 'blue', 'straggler', 'stars', 'in', 'their', 'colormagnitude', 'diagrams', 'have', 'atracted', 'significant', 'attention', 'this', 'type', 'of', 'special', 'but', 'rare', 'pattern', 'of', 'two', 'distinct', 'blue', 'straggler', 'sequences', 'is', 'commonly', 'interpreted', 'as', 'evidence', 'of', 'cluster', 'corecollapsedriven', 'stellar', 'collisions', 'as', 'an', 'efficient', 'formation', 'mechanism', 'here', 'we', 'report', 'the', 'detection', 'of', 'a', 'bifurcated', 'blue', 'straggler', 'distribution', 'in', 'a', 'young', 'large', 'magellaniccloud', 'cluster', 'ngc', '2173', 'because', 'of', 'the', 'clusters', 'low', 'central', 'stellar', 'number', 'density', 'and', 'its', 'young', 'age', 'dynamical', 'analysis', 'shows', 'that', 'stellar', 'collisions', 'alone', 'can', 'not', 'explain', 'the', 'observed', 'blue', 'straggler', 'stars', 'therefore', 'binary', 'evolution', 'is', 'instead', 'the', 'most', 'viable', 'explanation', 'of', 'the', 'origin', 'of', 'these', 'blue', 'straggler', 'stars', 'however', 'the', 'reason', 'why', 'binary', 'evolution', 'would', 'render', 'the', 'colormagnitude', 'distribution', 'of', 'blue', 'straggler', 'stars', 'bifurcated', 'remains', 'unclear']] | [-0.10550609983496184, 0.16540250534176937, -0.14888996566783208, 0.18781498147529688, -0.16482436834819247, -0.055520852101149924, 0.11098710935349103, 0.45312165007850186, -0.13798187062483983, -0.32237726986431137, 0.003487719606501279, -0.21196650973421935, -0.1311679220525548, 0.14177576671583486, -0.1544540910676244, -0.07920761032699851, 0.1633808487667473, -0.038271961378727536, 0.0394144357128649, -0.26784794963132896, 0.2987848207446151, -0.030641777975270984, 0.1708300913756591, -0.08927202968262747, -0.028876509677740882, -0.105107056961746, -0.07692092689532848, -0.06729334426784246, -0.09009404422661155, -0.00707283673319416, 0.2519467618377482, 0.176092737873436, 0.26689215841107683, -0.31850080550877286, -0.17644558565669166, 0.12397695525900507, 0.342101601150925, 0.03796056854981379, -0.1602675377345476, -0.20685091463001598, 0.13122630277724906, -0.18155010462906518, -0.2128972577992216, 0.09096052975882395, 0.10943767924976276, 0.044147070213869884, -0.1546313392922099, 0.16126728844523552, 0.054408274379847035, 0.08739205920061127, -0.10434063108824956, -0.18167151793929154, -0.10811075448491764, 0.08786004632100707, 0.004932400079627261, 0.04291816235932171, 0.11757358452534211, -0.1465036094486408, -0.04496785560928163, 0.41034575960919506, -0.005299563470991237, 0.037266654420460836, 0.244398044380283, -0.16849893772379174, -0.2129600197382149, 0.07327152585293945, 0.14456663853736962, 0.16816917286239197, -0.20843405125006179, -0.05953874361255687, -0.0015481980565217796, 0.20158011640696863, 0.08971909497536291, 0.12738598694979045, 0.39234687736807544, 0.15094879644609926, -0.023365154274601917, 0.1296053068849762, -0.26093309237545387, -0.13844714316417325, -0.1805985782784028, -0.05868234858680211, -0.10115880859046258, 0.04443102374925282, -0.17112025570830036, -0.2485602020713516, 0.3024214003158764, 0.05103392266958463, 0.23192073026797008, -0.02780706695945109, 0.3004130292340319, 0.11333950460682334, 0.13881142067123722, 0.10475078806830723, 0.2534295224172414, 0.21953832620724303, 0.08378858070393078, -0.3050535251920829, 0.14189774532168797, -0.0522535781807373] |
1,802.02308 | Computer-Aided Annotation for Video Tampering Dataset of Forensic
Research | The annotation of video tampering dataset is a boring task that takes a lot
of manpower and financial resources. At present, there is no published
literature which is capable to improve the annotation efficiency of forged
videos. We presented a computer-aided annotation method for video tampering
dataset in this paper. This annotation method can be utilized to label the
frames of forged video sequences. By means of comparing the original video
frames with the forged video frames, we can locate the position and the
trajectory of the forged areas of the forged video frames. Then, we select
several key points on the temporal domain according to the trajectory of the
forged areas, and mark the forged area of the forged frames in the key point
with a mouse. Finally, we use the linear prediction algorithm based on the
coordinates of the key positions in the temporal domain to generate the
annotation information of forged areas in other video frames which without
manually labeled. If the bounding box generated by the computer-aided algorithm
deviates from the actual location of the forged area, we can use the mouse to
change the position of the bounding box during the preview period. This method
combines the manual annotation with computer-aided annotation. It solves the
problems of the inaccuracy of annotation by computer-aided as well as the low
efficiency of annotation manually, and meet the needs of annotation for an
enormous amount of forged videos in the research of video passive forensics.
| cs.MM | the annotation of video tampering dataset is a boring task that takes a lot of manpower and financial resources at present there is no published literature which is capable to improve the annotation efficiency of forged videos we presented a computeraided annotation method for video tampering dataset in this paper this annotation method can be utilized to label the frames of forged video sequences by means of comparing the original video frames with the forged video frames we can locate the position and the trajectory of the forged areas of the forged video frames then we select several key points on the temporal domain according to the trajectory of the forged areas and mark the forged area of the forged frames in the key point with a mouse finally we use the linear prediction algorithm based on the coordinates of the key positions in the temporal domain to generate the annotation information of forged areas in other video frames which without manually labeled if the bounding box generated by the computeraided algorithm deviates from the actual location of the forged area we can use the mouse to change the position of the bounding box during the preview period this method combines the manual annotation with computeraided annotation it solves the problems of the inaccuracy of annotation by computeraided as well as the low efficiency of annotation manually and meet the needs of annotation for an enormous amount of forged videos in the research of video passive forensics | [['the', 'annotation', 'of', 'video', 'tampering', 'dataset', 'is', 'a', 'boring', 'task', 'that', 'takes', 'a', 'lot', 'of', 'manpower', 'and', 'financial', 'resources', 'at', 'present', 'there', 'is', 'no', 'published', 'literature', 'which', 'is', 'capable', 'to', 'improve', 'the', 'annotation', 'efficiency', 'of', 'forged', 'videos', 'we', 'presented', 'a', 'computeraided', 'annotation', 'method', 'for', 'video', 'tampering', 'dataset', 'in', 'this', 'paper', 'this', 'annotation', 'method', 'can', 'be', 'utilized', 'to', 'label', 'the', 'frames', 'of', 'forged', 'video', 'sequences', 'by', 'means', 'of', 'comparing', 'the', 'original', 'video', 'frames', 'with', 'the', 'forged', 'video', 'frames', 'we', 'can', 'locate', 'the', 'position', 'and', 'the', 'trajectory', 'of', 'the', 'forged', 'areas', 'of', 'the', 'forged', 'video', 'frames', 'then', 'we', 'select', 'several', 'key', 'points', 'on', 'the', 'temporal', 'domain', 'according', 'to', 'the', 'trajectory', 'of', 'the', 'forged', 'areas', 'and', 'mark', 'the', 'forged', 'area', 'of', 'the', 'forged', 'frames', 'in', 'the', 'key', 'point', 'with', 'a', 'mouse', 'finally', 'we', 'use', 'the', 'linear', 'prediction', 'algorithm', 'based', 'on', 'the', 'coordinates', 'of', 'the', 'key', 'positions', 'in', 'the', 'temporal', 'domain', 'to', 'generate', 'the', 'annotation', 'information', 'of', 'forged', 'areas', 'in', 'other', 'video', 'frames', 'which', 'without', 'manually', 'labeled', 'if', 'the', 'bounding', 'box', 'generated', 'by', 'the', 'computeraided', 'algorithm', 'deviates', 'from', 'the', 'actual', 'location', 'of', 'the', 'forged', 'area', 'we', 'can', 'use', 'the', 'mouse', 'to', 'change', 'the', 'position', 'of', 'the', 'bounding', 'box', 'during', 'the', 'preview', 'period', 'this', 'method', 'combines', 'the', 'manual', 'annotation', 'with', 'computeraided', 'annotation', 'it', 'solves', 'the', 'problems', 'of', 'the', 'inaccuracy', 'of', 'annotation', 'by', 'computeraided', 'as', 'well', 'as', 'the', 'low', 'efficiency', 'of', 'annotation', 'manually', 'and', 'meet', 'the', 'needs', 'of', 'annotation', 'for', 'an', 'enormous', 'amount', 'of', 'forged', 'videos', 'in', 'the', 'research', 'of', 'video', 'passive', 'forensics']] | [-0.055889014629406764, 0.0058383536907426654, -0.04657880134356438, 0.048346260705819495, -0.08650227692374123, -0.12032153813907431, 0.08758499463765622, 0.4105537898823438, -0.2522752090180029, -0.35400438138664614, 0.09794280995277363, -0.3063745705923631, -0.10698549038596708, 0.18722132055714788, -0.24346370198177117, 0.08244641264523511, 0.1306857257989058, 0.10016415789270931, -0.017306011553800963, -0.28841595038835727, 0.2887081810921762, 0.0482404803082362, 0.2915585913736871, 0.029919908975858077, 0.12260406575569137, -0.01934031145420936, -0.11436386646946557, -0.022499265078803277, -0.05635018249317228, 0.19325164361076377, 0.33513827308982247, 0.25436389487357397, 0.34536196280135073, -0.415285556007795, -0.1935319857538003, 0.07783564628452545, 0.15173435877812536, 0.1326018217861509, -0.07401522663553897, -0.38937084377471826, 0.10944034303783585, -0.12163842416289243, -0.004251488542885554, -0.06737633001225198, 0.013086709731186811, 0.0016031573987980695, -0.23735720250446365, 0.041746172933322695, 0.031519942717562595, 0.10792398396577792, -0.04159717542224899, -0.010898340400119843, 0.001483461070548449, 0.2674109392067953, 0.06165701874177375, 0.08481426372028782, 0.16552905285700795, -0.18441902204517555, -0.12621976071987528, 0.4083995028975823, -0.0011917010615655195, -0.21012571955930162, 0.16557544449943792, -0.05528227199031123, -0.10653053387445266, 0.15562533455979086, 0.18425605644666126, 0.12847730058136014, -0.15864733506657697, -0.007748361417589151, -0.041012159846572256, 0.22951180057711842, 0.13959728253944984, 0.0056767152289592246, 0.1903217832019613, 0.2017463006327581, 0.01683276526814681, 0.15880129164294998, -0.1633390504470932, -0.02868465385079263, -0.3028064625397106, -0.16654737662855792, -0.23492028617756328, -0.07224828857732446, -0.08301040788227315, -0.14648965653032064, 0.4110988301077956, 0.2229825213838082, 0.16283058877002168, 0.030180281515493387, 0.35648785557160495, -0.022863263055976284, 0.10661238068477312, 0.05384897229875351, 0.12991857441587124, -0.06817954226758949, 0.18705996336709513, -0.1702588887457257, 0.09415023671161489, 0.10485357573625409] |
1,802.02309 | Asymptotic Behavior of SIRS Models in State-dependent Random
Environments | The extinction and persistence of infective individuals are closely related
to the random change of the environment. In this paper, via the
random/stochastic SIRS models, we analyze qualitatively and quantitatively the
impact caused by the random change of the environment. Our contributions
consist in (i) giving some sufficient conditions on extinction (persistence) of
the infectious individuals even though they are persistent (resp. extinct) in
certain fixed environments; (ii) revealing the influence of random switching of
incidence functions on extinction for the infectious individuals, which has not
been studied before; (iii) establishing a criterion to judge extinction of the
infectious individuals for a range of random/stochastic SIRS models with
state-dependent switching via a stochastic comparison for functionals of jump
processes. Moreover, some examples are set to illustrate the applications of
our theory.
| math.PR | the extinction and persistence of infective individuals are closely related to the random change of the environment in this paper via the randomstochastic sirs models we analyze qualitatively and quantitatively the impact caused by the random change of the environment our contributions consist in i giving some sufficient conditions on extinction persistence of the infectious individuals even though they are persistent resp extinct in certain fixed environments ii revealing the influence of random switching of incidence functions on extinction for the infectious individuals which has not been studied before iii establishing a criterion to judge extinction of the infectious individuals for a range of randomstochastic sirs models with statedependent switching via a stochastic comparison for functionals of jump processes moreover some examples are set to illustrate the applications of our theory | [['the', 'extinction', 'and', 'persistence', 'of', 'infective', 'individuals', 'are', 'closely', 'related', 'to', 'the', 'random', 'change', 'of', 'the', 'environment', 'in', 'this', 'paper', 'via', 'the', 'randomstochastic', 'sirs', 'models', 'we', 'analyze', 'qualitatively', 'and', 'quantitatively', 'the', 'impact', 'caused', 'by', 'the', 'random', 'change', 'of', 'the', 'environment', 'our', 'contributions', 'consist', 'in', 'i', 'giving', 'some', 'sufficient', 'conditions', 'on', 'extinction', 'persistence', 'of', 'the', 'infectious', 'individuals', 'even', 'though', 'they', 'are', 'persistent', 'resp', 'extinct', 'in', 'certain', 'fixed', 'environments', 'ii', 'revealing', 'the', 'influence', 'of', 'random', 'switching', 'of', 'incidence', 'functions', 'on', 'extinction', 'for', 'the', 'infectious', 'individuals', 'which', 'has', 'not', 'been', 'studied', 'before', 'iii', 'establishing', 'a', 'criterion', 'to', 'judge', 'extinction', 'of', 'the', 'infectious', 'individuals', 'for', 'a', 'range', 'of', 'randomstochastic', 'sirs', 'models', 'with', 'statedependent', 'switching', 'via', 'a', 'stochastic', 'comparison', 'for', 'functionals', 'of', 'jump', 'processes', 'moreover', 'some', 'examples', 'are', 'set', 'to', 'illustrate', 'the', 'applications', 'of', 'our', 'theory']] | [-0.10001417790185804, 0.12839392071604266, -0.0727691272346532, 0.111281091254385, -0.012735015236187813, -0.17041609614957556, 0.09687104492715394, 0.38979377053215986, -0.2595270115398448, -0.25231430913473285, 0.1256178010827248, -0.27306111439225056, -0.1985067916463685, 0.14998972410870384, -0.10757510987103217, -0.009562534020217351, 0.0366412103645388, 0.02117563556029656, 0.035107841196311135, -0.3162906607540772, 0.3308192349775413, 0.016132063773828885, 0.23633139317696408, 0.024253495293849892, 0.09807574798711964, 0.014287516343418162, -0.06509823758739891, 0.03917315674859077, -0.14534292760658865, 0.09698848668919054, 0.24196433094259065, 0.11087307293155743, 0.28758540536572996, -0.41191445721327796, -0.24244705935608046, 0.14941356602384773, 0.1265811124185277, 0.13642835063957284, 0.014427761267509687, -0.30419378518307394, 0.06750631490234979, -0.15405775686160142, -0.13893718491922052, -0.011716746075382067, 0.04291351496552428, 0.12067317987192971, -0.2741597679501414, 0.0738083464188263, 0.02459748552808928, 0.12600340898502474, -0.05319566454001984, -0.09068968607286035, -0.052455782563634964, 0.16463059255882173, 0.07616302057696406, -0.06990909053720246, 0.1644491408554505, -0.14214714959646438, -0.09900533214803467, 0.33450084570939687, -0.02543878038016747, -0.17221066369422416, 0.22445453463714252, -0.13505641532007806, -0.11241645612862221, 0.14007688572182675, 0.1955685370219077, 0.08692924609762444, -0.19008809481133787, 0.02163996094704223, 0.008695832612498323, 0.08726193789797004, 0.052814699106582604, 0.012513600838507792, 0.15484355285027346, 0.16209215088205975, 0.0728511048242623, 0.09498565512990882, -0.05521061460220421, -0.15597324475082894, -0.2818445840258469, -0.10023156412364553, -0.11232849451994827, 0.09222015152631649, -0.1297794209985882, -0.19392497130749067, 0.4099826062885077, 0.16398712814706126, 0.19646040202919826, 0.1093552545545074, 0.20997930118857427, 0.12179588285230132, 0.005359671800577825, 0.03741316774556803, 0.17262290784405082, 0.13025737619713354, 0.08634946279249392, -0.21881114175658703, 0.24114652492048205, -0.005212979717902088] |
1,802.0231 | Triggering the formation of the supergiant H II region NGC 604 in M33 | Formation mechanism of a supergiant H II region NGC 604 is discussed in terms
of collision of H I clouds in M33. An analysis of the archival H I data
obtained with the Very Large Array (VLA) reveals complex velocity distributions
around NGC 604. The H I clouds are composed of two velocity components
separated by ~ 20 km s^-1 for an extent of ~ 700 pc, beyond the size of the the
H II region. Although the H I clouds are not easily separated in velocity with
some mixed component represented by merged line profiles, the atomic gas mass
amounts to 6 x 10^6 M_Sol and 9 x 10^6 M_Sol for each component. These
characteristics of H I gas and the distributions of dense molecular gas in the
overlapping regions of the two velocity components suggest that the formation
of giant molecular clouds and the following massive cluster formation have been
induced by the collision of H I clouds with different velocities. Referring to
the existence of gas bridging feature connecting M33 with M31 reported by
large-scale HI surveys, the disturbed atomic gas possibly represent the result
of past tidal interaction between the two galaxies, which is analogous to the
formation of the R136 cluster in the LMC.
| astro-ph.GA | formation mechanism of a supergiant h ii region ngc 604 is discussed in terms of collision of h i clouds in m33 an analysis of the archival h i data obtained with the very large array vla reveals complex velocity distributions around ngc 604 the h i clouds are composed of two velocity components separated by 20 km s1 for an extent of 700 pc beyond the size of the the h ii region although the h i clouds are not easily separated in velocity with some mixed component represented by merged line profiles the atomic gas mass amounts to 6 x 106 m_sol and 9 x 106 m_sol for each component these characteristics of h i gas and the distributions of dense molecular gas in the overlapping regions of the two velocity components suggest that the formation of giant molecular clouds and the following massive cluster formation have been induced by the collision of h i clouds with different velocities referring to the existence of gas bridging feature connecting m33 with m31 reported by largescale hi surveys the disturbed atomic gas possibly represent the result of past tidal interaction between the two galaxies which is analogous to the formation of the r136 cluster in the lmc | [['formation', 'mechanism', 'of', 'a', 'supergiant', 'h', 'ii', 'region', 'ngc', '604', 'is', 'discussed', 'in', 'terms', 'of', 'collision', 'of', 'h', 'i', 'clouds', 'in', 'm33', 'an', 'analysis', 'of', 'the', 'archival', 'h', 'i', 'data', 'obtained', 'with', 'the', 'very', 'large', 'array', 'vla', 'reveals', 'complex', 'velocity', 'distributions', 'around', 'ngc', '604', 'the', 'h', 'i', 'clouds', 'are', 'composed', 'of', 'two', 'velocity', 'components', 'separated', 'by', '20', 'km', 's1', 'for', 'an', 'extent', 'of', '700', 'pc', 'beyond', 'the', 'size', 'of', 'the', 'the', 'h', 'ii', 'region', 'although', 'the', 'h', 'i', 'clouds', 'are', 'not', 'easily', 'separated', 'in', 'velocity', 'with', 'some', 'mixed', 'component', 'represented', 'by', 'merged', 'line', 'profiles', 'the', 'atomic', 'gas', 'mass', 'amounts', 'to', '6', 'x', '106', 'm_sol', 'and', '9', 'x', '106', 'm_sol', 'for', 'each', 'component', 'these', 'characteristics', 'of', 'h', 'i', 'gas', 'and', 'the', 'distributions', 'of', 'dense', 'molecular', 'gas', 'in', 'the', 'overlapping', 'regions', 'of', 'the', 'two', 'velocity', 'components', 'suggest', 'that', 'the', 'formation', 'of', 'giant', 'molecular', 'clouds', 'and', 'the', 'following', 'massive', 'cluster', 'formation', 'have', 'been', 'induced', 'by', 'the', 'collision', 'of', 'h', 'i', 'clouds', 'with', 'different', 'velocities', 'referring', 'to', 'the', 'existence', 'of', 'gas', 'bridging', 'feature', 'connecting', 'm33', 'with', 'm31', 'reported', 'by', 'largescale', 'hi', 'surveys', 'the', 'disturbed', 'atomic', 'gas', 'possibly', 'represent', 'the', 'result', 'of', 'past', 'tidal', 'interaction', 'between', 'the', 'two', 'galaxies', 'which', 'is', 'analogous', 'to', 'the', 'formation', 'of', 'the', 'r136', 'cluster', 'in', 'the', 'lmc']] | [-0.11982140605420027, 0.10434251876251552, -0.019341669630277274, 0.012828672017929131, -0.018648473152233926, -0.05176159583149109, 0.011417703059668414, 0.41266699956846986, -0.19486762843306227, -0.3247588619877751, 0.03599807830102256, -0.266763472371422, 0.015043063896847664, 0.1301905000846662, 0.035526211838888065, -0.08154965607687867, 0.07567932110297795, -0.06206876534073285, -0.027701814770293626, -0.26254066333606624, 0.3205066416401344, 0.020725942392280136, 0.1499449468964648, -0.024938602932113852, 0.0534234231474004, -0.1289091286584645, -0.08106151618882294, -0.007633313446661125, -0.16984438877412852, 0.10985898961434545, 0.2143909079452936, 0.12191538924715765, 0.24512767450263104, -0.37445065683734735, -0.19644656541176897, 0.04355167176637457, 0.2273219844578329, -0.0005733396364195983, -0.026929552909796654, -0.320108086924667, 0.0471949009182593, -0.19179945118086422, -0.21603653967101577, 0.10006912288161507, 0.11215330710508613, 0.06075846276961375, -0.2149816156212569, 0.16310664083682685, 0.010375044919361455, 0.10681923999842527, -0.09004842847302232, -0.12386778475388273, -0.07282148312736789, 0.05793062583340899, -0.025157144783876817, 0.06203164088152853, 0.2033649824474205, -0.13926758243621368, 0.017257447602510776, 0.4029863907231225, -0.07926186774339941, -0.026643941088935027, 0.2715006706390332, -0.19491577182743464, -0.17758387065794012, 0.18907311366160134, 0.10350973527442106, 0.08186458259739954, -0.14698471161784324, 0.02445435292646514, -0.07226411431379941, 0.161539608468684, 0.0757698212403822, 0.05030661859608071, 0.27886612133622385, 0.0709982377326269, 0.03509307057299518, 0.09380890227908241, -0.26455974952961153, -0.08092218756693717, -0.2496872635036347, -0.12440637755545153, -0.1403141498412703, 0.04912921418566628, -0.1440600975198533, -0.0935637598209407, 0.28778814039404554, 0.06685289454416952, 0.2888534346793369, -0.05187669748458382, 0.2736198549127377, 0.04750267879650501, 0.11248662630012422, 0.15542631033484056, 0.24113647748700992, 0.20029153692387586, 0.0675897906952794, -0.23525035124078644, 0.0652049738454862, 0.006709555372064888] |
1,802.02311 | An Empirical Evaluation of Deep Learning for ICD-9 Code Assignment using
MIMIC-III Clinical Notes | Background and Objective: Code assignment is of paramount importance in many
levels in modern hospitals, from ensuring accurate billing process to creating
a valid record of patient care history. However, the coding process is tedious
and subjective, and it requires medical coders with extensive training. This
study aims to evaluate the performance of deep-learning-based systems to
automatically map clinical notes to ICD-9 medical codes. Methods: The
evaluations of this research are focused on end-to-end learning methods without
manually defined rules. Traditional machine learning algorithms, as well as
state-of-the-art deep learning methods such as Recurrent Neural Networks and
Convolution Neural Networks, were applied to the Medical Information Mart for
Intensive Care (MIMIC-III) dataset. An extensive number of experiments was
applied to different settings of the tested algorithm. Results: Findings showed
that the deep learning-based methods outperformed other conventional machine
learning methods. From our assessment, the best models could predict the top 10
ICD-9 codes with 0.6957 F1 and 0.8967 accuracy and could estimate the top 10
ICD-9 categories with 0.7233 F1 and 0.8588 accuracy. Our implementation also
outperformed existing work under certain evaluation metrics. Conclusion: A set
of standard metrics was utilized in assessing the performance of ICD-9 code
assignment on MIMIC-III dataset. All the developed evaluation tools and
resources are available online, which can be used as a baseline for further
research.
| cs.CL | background and objective code assignment is of paramount importance in many levels in modern hospitals from ensuring accurate billing process to creating a valid record of patient care history however the coding process is tedious and subjective and it requires medical coders with extensive training this study aims to evaluate the performance of deeplearningbased systems to automatically map clinical notes to icd9 medical codes methods the evaluations of this research are focused on endtoend learning methods without manually defined rules traditional machine learning algorithms as well as stateoftheart deep learning methods such as recurrent neural networks and convolution neural networks were applied to the medical information mart for intensive care mimiciii dataset an extensive number of experiments was applied to different settings of the tested algorithm results findings showed that the deep learningbased methods outperformed other conventional machine learning methods from our assessment the best models could predict the top 10 icd9 codes with 06957 f1 and 08967 accuracy and could estimate the top 10 icd9 categories with 07233 f1 and 08588 accuracy our implementation also outperformed existing work under certain evaluation metrics conclusion a set of standard metrics was utilized in assessing the performance of icd9 code assignment on mimiciii dataset all the developed evaluation tools and resources are available online which can be used as a baseline for further research | [['background', 'and', 'objective', 'code', 'assignment', 'is', 'of', 'paramount', 'importance', 'in', 'many', 'levels', 'in', 'modern', 'hospitals', 'from', 'ensuring', 'accurate', 'billing', 'process', 'to', 'creating', 'a', 'valid', 'record', 'of', 'patient', 'care', 'history', 'however', 'the', 'coding', 'process', 'is', 'tedious', 'and', 'subjective', 'and', 'it', 'requires', 'medical', 'coders', 'with', 'extensive', 'training', 'this', 'study', 'aims', 'to', 'evaluate', 'the', 'performance', 'of', 'deeplearningbased', 'systems', 'to', 'automatically', 'map', 'clinical', 'notes', 'to', 'icd9', 'medical', 'codes', 'methods', 'the', 'evaluations', 'of', 'this', 'research', 'are', 'focused', 'on', 'endtoend', 'learning', 'methods', 'without', 'manually', 'defined', 'rules', 'traditional', 'machine', 'learning', 'algorithms', 'as', 'well', 'as', 'stateoftheart', 'deep', 'learning', 'methods', 'such', 'as', 'recurrent', 'neural', 'networks', 'and', 'convolution', 'neural', 'networks', 'were', 'applied', 'to', 'the', 'medical', 'information', 'mart', 'for', 'intensive', 'care', 'mimiciii', 'dataset', 'an', 'extensive', 'number', 'of', 'experiments', 'was', 'applied', 'to', 'different', 'settings', 'of', 'the', 'tested', 'algorithm', 'results', 'findings', 'showed', 'that', 'the', 'deep', 'learningbased', 'methods', 'outperformed', 'other', 'conventional', 'machine', 'learning', 'methods', 'from', 'our', 'assessment', 'the', 'best', 'models', 'could', 'predict', 'the', 'top', '10', 'icd9', 'codes', 'with', '06957', 'f1', 'and', '08967', 'accuracy', 'and', 'could', 'estimate', 'the', 'top', '10', 'icd9', 'categories', 'with', '07233', 'f1', 'and', '08588', 'accuracy', 'our', 'implementation', 'also', 'outperformed', 'existing', 'work', 'under', 'certain', 'evaluation', 'metrics', 'conclusion', 'a', 'set', 'of', 'standard', 'metrics', 'was', 'utilized', 'in', 'assessing', 'the', 'performance', 'of', 'icd9', 'code', 'assignment', 'on', 'mimiciii', 'dataset', 'all', 'the', 'developed', 'evaluation', 'tools', 'and', 'resources', 'are', 'available', 'online', 'which', 'can', 'be', 'used', 'as', 'a', 'baseline', 'for', 'further', 'research']] | [-0.010023576052327546, -0.03958476582960463, -0.03848115665378001, 0.09536570505676761, -0.0893141774379503, -0.1856467473179683, 0.04989245143097424, 0.462070361189886, -0.19969387244595505, -0.3570803789797863, 0.12367940030472968, -0.2848170825660468, -0.15453876921006718, 0.27068810378641334, -0.15002074398296894, 0.1505774369275351, 0.1951613452599529, 0.054946558882157666, -0.05972085328700038, -0.35323240678573725, 0.2544642203377098, 0.09435117941263234, 0.41144764842038306, 0.055983777621754556, 0.0762997428594753, -0.02864068945647653, -0.06884877284809332, -0.013016240550389347, -0.04373212844318814, 0.17385263144414564, 0.371459638239251, 0.2628819180883194, 0.3673811517954898, -0.3936630197706709, -0.22998121042881126, 0.07813780691256798, 0.12664384612762328, 0.08562085369586893, -0.010245879926748675, -0.32986975788916334, 0.08451706872731789, -0.1781106646335043, 0.03070290156516221, -0.1570510526407732, -0.056371205827592946, 0.010223250860431651, -0.31132584265134206, 0.01099254495937937, 0.020238925589124646, 0.13977724672060188, -0.058761057035929154, -0.19209497593131789, 0.04618332713389547, 0.2102426321314084, 0.05259009278801253, 0.10118267969751663, 0.17058278558510911, -0.1657495964347551, -0.18940452267810992, 0.364530543301152, -0.04740039318471019, -0.19491687425894988, 0.2083281059450376, 0.019458293649923363, -0.14907178168551924, 0.08300190062022879, 0.24124097557516272, 0.11534261693451725, -0.18994622093565558, -0.008151796568449962, 0.022786509847669507, 0.1793857402437358, 0.03333165116475707, -0.040300873612585573, 0.14505189342569524, 0.24665153901938588, -0.05133195042876108, 0.11390376095142037, -0.10061751287152837, -0.05551975297500217, -0.19463770908096362, -0.11012348883464632, -0.15542201402035347, -0.011615673186889755, -0.0623610494588929, -0.15841850167174543, 0.38349414777775387, 0.23959212892458115, 0.11203018762825437, 0.07647018364807932, 0.35322449094009234, -0.023832898347148856, 0.14586341789487853, 0.09642963702021458, 0.15945023030081099, 0.0055545142183182844, 0.12099508631658322, -0.15040601262824882, 0.11255111583773422, 0.0253377313119009] |
1,802.02312 | Machine Learning-Based Prototyping of Graphical User Interfaces for
Mobile Apps | It is common practice for developers of user-facing software to transform a
mock-up of a graphical user interface (GUI) into code. This process takes place
both at an application's inception and in an evolutionary context as GUI
changes keep pace with evolving features. Unfortunately, this practice is
challenging and time-consuming. In this paper, we present an approach that
automates this process by enabling accurate prototyping of GUIs via three
tasks: detection, classification, and assembly. First, logical components of a
GUI are detected from a mock-up artifact using either computer vision
techniques or mock-up metadata. Then, software repository mining, automated
dynamic analysis, and deep convolutional neural networks are utilized to
accurately classify GUI-components into domain-specific types (e.g.,
toggle-button). Finally, a data-driven, K-nearest-neighbors algorithm generates
a suitable hierarchical GUI structure from which a prototype application can be
automatically assembled. We implemented this approach for Android in a system
called ReDraw. Our evaluation illustrates that ReDraw achieves an average
GUI-component classification accuracy of 91% and assembles prototype
applications that closely mirror target mock-ups in terms of visual affinity
while exhibiting reasonable code structure. Interviews with industrial
practitioners illustrate ReDraw's potential to improve real development
workflows.
| cs.SE cs.CV cs.LG | it is common practice for developers of userfacing software to transform a mockup of a graphical user interface gui into code this process takes place both at an applications inception and in an evolutionary context as gui changes keep pace with evolving features unfortunately this practice is challenging and timeconsuming in this paper we present an approach that automates this process by enabling accurate prototyping of guis via three tasks detection classification and assembly first logical components of a gui are detected from a mockup artifact using either computer vision techniques or mockup metadata then software repository mining automated dynamic analysis and deep convolutional neural networks are utilized to accurately classify guicomponents into domainspecific types eg togglebutton finally a datadriven knearestneighbors algorithm generates a suitable hierarchical gui structure from which a prototype application can be automatically assembled we implemented this approach for android in a system called redraw our evaluation illustrates that redraw achieves an average guicomponent classification accuracy of 91 and assembles prototype applications that closely mirror target mockups in terms of visual affinity while exhibiting reasonable code structure interviews with industrial practitioners illustrate redraws potential to improve real development workflows | [['it', 'is', 'common', 'practice', 'for', 'developers', 'of', 'userfacing', 'software', 'to', 'transform', 'a', 'mockup', 'of', 'a', 'graphical', 'user', 'interface', 'gui', 'into', 'code', 'this', 'process', 'takes', 'place', 'both', 'at', 'an', 'applications', 'inception', 'and', 'in', 'an', 'evolutionary', 'context', 'as', 'gui', 'changes', 'keep', 'pace', 'with', 'evolving', 'features', 'unfortunately', 'this', 'practice', 'is', 'challenging', 'and', 'timeconsuming', 'in', 'this', 'paper', 'we', 'present', 'an', 'approach', 'that', 'automates', 'this', 'process', 'by', 'enabling', 'accurate', 'prototyping', 'of', 'guis', 'via', 'three', 'tasks', 'detection', 'classification', 'and', 'assembly', 'first', 'logical', 'components', 'of', 'a', 'gui', 'are', 'detected', 'from', 'a', 'mockup', 'artifact', 'using', 'either', 'computer', 'vision', 'techniques', 'or', 'mockup', 'metadata', 'then', 'software', 'repository', 'mining', 'automated', 'dynamic', 'analysis', 'and', 'deep', 'convolutional', 'neural', 'networks', 'are', 'utilized', 'to', 'accurately', 'classify', 'guicomponents', 'into', 'domainspecific', 'types', 'eg', 'togglebutton', 'finally', 'a', 'datadriven', 'knearestneighbors', 'algorithm', 'generates', 'a', 'suitable', 'hierarchical', 'gui', 'structure', 'from', 'which', 'a', 'prototype', 'application', 'can', 'be', 'automatically', 'assembled', 'we', 'implemented', 'this', 'approach', 'for', 'android', 'in', 'a', 'system', 'called', 'redraw', 'our', 'evaluation', 'illustrates', 'that', 'redraw', 'achieves', 'an', 'average', 'guicomponent', 'classification', 'accuracy', 'of', '91', 'and', 'assembles', 'prototype', 'applications', 'that', 'closely', 'mirror', 'target', 'mockups', 'in', 'terms', 'of', 'visual', 'affinity', 'while', 'exhibiting', 'reasonable', 'code', 'structure', 'interviews', 'with', 'industrial', 'practitioners', 'illustrate', 'redraws', 'potential', 'to', 'improve', 'real', 'development', 'workflows']] | [-0.05212373754871573, -0.023905702146758485, -0.09312196074236628, 0.04356950211492036, -0.14531023452241726, -0.19700446495033325, 0.005740897259996966, 0.4567172354473633, -0.2637977922592867, -0.36834249500323957, 0.10573103031926254, -0.22100557850926442, -0.2124379709699845, 0.22546942459117186, -0.10259096141894684, 0.07031314103477733, 0.14855556421358376, 0.00018845632439479232, -0.04466213151503558, -0.26366189054487166, 0.24939524788939532, 0.056213876037911684, 0.32904332321374974, 0.01762924634447777, 0.09496320883664204, 0.014332847311805457, -0.049495613811775405, -0.032974144676700234, -0.04894739442731426, 0.15902000162327085, 0.3640415550325997, 0.2533464535917255, 0.3275813600618115, -0.4182515948257865, -0.16866062068444815, 0.008692136497553835, 0.1741585076523869, 0.07243535614558842, -0.07108985841586353, -0.35054881437780694, 0.11113721561281288, -0.22666831650682032, -0.044094813066197835, -0.13329779836497804, 0.0008611125426312432, -0.01965434516271071, -0.2712637235917042, -0.040006581272811016, 0.0379050731772874, 0.1290121508720133, -0.013777054573825382, -0.06869979628096731, 0.00789905105658034, 0.19351166169817977, -0.025006922494751362, 0.05859010312285155, 0.1943308378277505, -0.1296846963306691, -0.13528312165215808, 0.3596048393742518, -0.001903345615496522, -0.17198652017643637, 0.22520651023815128, 0.04299900651305042, -0.18489455890549505, 0.11967133676900746, 0.2515291673195687, 0.06949039026624226, -0.2301705637804302, 0.04707812946481739, 0.04893976416280295, 0.22333300508870843, 0.0354278390915034, -0.07264719770458389, 0.22381117262882477, 0.2681682988842751, -0.018809610296963736, 0.1602756193055068, -0.033927123800435284, -0.050771916158834196, -0.23183565838027131, -0.17710988515883652, -0.14313575298713638, -0.036900742118187405, -0.07210448373595507, -0.20264258594351245, 0.3972077142556218, 0.22613643449384402, 0.11974079350004607, 0.05694280873471376, 0.3770905941962562, -0.0028741807773451696, 0.12195302663430413, 0.09888692435491434, 0.09733501722493725, -0.017418914325931605, 0.1740216862727972, -0.13671481121112244, 0.11126292292078203, 0.025513241307790133] |
1,802.02313 | A performance comparison between \b{eta}-Ga2O3 and GaN High Electron
Mobility Transistors | In this letter, we report on the quantitative estimates of various metrics of
performance for \b{eta}-Ga2O3 based High Electron Mobility Transistor (HEMT)
for radio frequency (RF) and power applications and compare them with
III-nitride devices. It is found that despite a lower cut-off frequency,
\b{eta}- Ga2O3 HEMT is likely to provide higher RF output power compared to
GaN-HEMT in the low-frequency regime although a poor thermal conductivity will
impose limitations in heat dissipation. On the other hand, a much lower
electron mobility will limit the DC switching performance in terms of
efficiency and loss although their blocking voltage can be much higher than in
GaN.
| physics.app-ph | in this letter we report on the quantitative estimates of various metrics of performance for betaga2o3 based high electron mobility transistor hemt for radio frequency rf and power applications and compare them with iiinitride devices it is found that despite a lower cutoff frequency beta ga2o3 hemt is likely to provide higher rf output power compared to ganhemt in the lowfrequency regime although a poor thermal conductivity will impose limitations in heat dissipation on the other hand a much lower electron mobility will limit the dc switching performance in terms of efficiency and loss although their blocking voltage can be much higher than in gan | [['in', 'this', 'letter', 'we', 'report', 'on', 'the', 'quantitative', 'estimates', 'of', 'various', 'metrics', 'of', 'performance', 'for', 'betaga2o3', 'based', 'high', 'electron', 'mobility', 'transistor', 'hemt', 'for', 'radio', 'frequency', 'rf', 'and', 'power', 'applications', 'and', 'compare', 'them', 'with', 'iiinitride', 'devices', 'it', 'is', 'found', 'that', 'despite', 'a', 'lower', 'cutoff', 'frequency', 'beta', 'ga2o3', 'hemt', 'is', 'likely', 'to', 'provide', 'higher', 'rf', 'output', 'power', 'compared', 'to', 'ganhemt', 'in', 'the', 'lowfrequency', 'regime', 'although', 'a', 'poor', 'thermal', 'conductivity', 'will', 'impose', 'limitations', 'in', 'heat', 'dissipation', 'on', 'the', 'other', 'hand', 'a', 'much', 'lower', 'electron', 'mobility', 'will', 'limit', 'the', 'dc', 'switching', 'performance', 'in', 'terms', 'of', 'efficiency', 'and', 'loss', 'although', 'their', 'blocking', 'voltage', 'can', 'be', 'much', 'higher', 'than', 'in', 'gan']] | [-0.12682533489379028, 0.10395997789321253, -0.015094069325221846, 0.019225652644168943, -0.06883677394272616, -0.18083202611887828, 0.11259333269061664, 0.4446526804509071, -0.16477372186580816, -0.3164651960922548, 0.08615751465437754, -0.294235782769437, -0.10555403190217195, 0.327021028739042, -0.1115980102868679, 0.04542319264370375, 0.009567437317365637, 0.006454355994859585, -0.06946742239121634, -0.18172689850549573, 0.1988519585977953, 0.16052829775995073, 0.4142276640229214, 0.131010248097412, 0.053239003459636405, -0.08958352965195306, 0.06883416795440447, 0.025211492872376066, -0.09398759262393679, 0.10412226709573028, 0.26173167631853944, -0.028318918632486693, 0.26015885708889425, -0.4487195575896364, -0.2678403317874584, 0.02113603186668255, 0.13432116917045697, 0.059703444014303386, -0.07529448074637912, -0.176192321939967, 0.11896758719992179, -0.2127105332284163, -0.04078316938144921, -0.030187965348327104, -0.00734655241159579, 0.05652865176447309, -0.2579071943272048, 0.09065168284667799, 0.041078754696242795, 0.034499531952091135, -0.05158595663068319, -0.1595571388830789, -0.004555523875751533, 0.08315832926830179, 0.012963488147271654, 0.003511015370559807, 0.20158307569979045, -0.14733831187690016, -0.1076110480980088, 0.34005624578835875, -0.08347808254298937, -0.16516976292237254, 0.2104977326010927, -0.21193771136817163, -0.06171323339311549, 0.11713885240225444, 0.18066470105371152, 0.05907201971142338, -0.15043864266436474, 0.033569527358430114, 0.08517800793365146, 0.18702871645935096, 0.10939582915922913, 0.14880797045323282, 0.18632243030543366, 0.20711974227742758, 0.11145739190172978, 0.15877024670603881, -0.11874859934547342, 0.023458634898326218, -0.16116146341216966, -0.1279046722019512, -0.18981509252737921, 0.10644957905997916, -0.07372087590318607, -0.13475857950890294, 0.40517010787264623, 0.19959925835987982, 0.1575246902469259, 0.05119077631612667, 0.3827801157827847, 0.20245035144930276, 0.06343356349568169, 0.05401292861922859, 0.26271478354465216, 0.11038642470689061, 0.16265047455313975, -0.25441603988516504, 0.055120521887707025, -0.05472402879072783] |
1,802.02314 | Variability of Disk Emission in Pre-Main Sequence and Related Stars IV.
Investigating the Structural Changes in the Inner Disk Region of MWC 480 | We present five epochs of near IR observations of the protoplanetary disk
around MWC 480 (HD31648) obtained with the SpeX spectrograph on NASA's Infrared
Telescope Facility (IRTF) between 2007 and 2013, inclusive. Using the measured
line fluxes in the Pa beta and Br gamma lines, we found the mass accretion
rates to be (1.43 - 2.61)x10^-8 Msun y^-1 and (1.81 - 2.41)x10^-8 Msun y^-1
respectively, but which varied by more than 50% from epoch to epoch. The
spectral energy distribution (SED)reveals a variability of about 30% between
1.5 and 10 microns during this same period of time. We investigated the
variability using of the continuum emission of the disk in using the
Monte-Carlo Radiative Transfer Code (MCRT) HOCHUNK3D. We find that varying the
height of the inner rim successfully produces a change in the NIR flux, but
lowers the far IR emission to levels below all measured fluxes. Because the
star exhibits bipolar flows, we utilized a structure that simulates an inner
disk wind to model the variability in the near IR, without producing flux
levels in the far IR that are inconsistent with existing data. For this object,
variable near IR emission due to such an outflow is more consistent with the
data than changing the scale height of the inner rim of the disk.
| astro-ph.SR | we present five epochs of near ir observations of the protoplanetary disk around mwc 480 hd31648 obtained with the spex spectrograph on nasas infrared telescope facility irtf between 2007 and 2013 inclusive using the measured line fluxes in the pa beta and br gamma lines we found the mass accretion rates to be 143 261x108 msun y1 and 181 241x108 msun y1 respectively but which varied by more than 50 from epoch to epoch the spectral energy distribution sedreveals a variability of about 30 between 15 and 10 microns during this same period of time we investigated the variability using of the continuum emission of the disk in using the montecarlo radiative transfer code mcrt hochunk3d we find that varying the height of the inner rim successfully produces a change in the nir flux but lowers the far ir emission to levels below all measured fluxes because the star exhibits bipolar flows we utilized a structure that simulates an inner disk wind to model the variability in the near ir without producing flux levels in the far ir that are inconsistent with existing data for this object variable near ir emission due to such an outflow is more consistent with the data than changing the scale height of the inner rim of the disk | [['we', 'present', 'five', 'epochs', 'of', 'near', 'ir', 'observations', 'of', 'the', 'protoplanetary', 'disk', 'around', 'mwc', '480', 'hd31648', 'obtained', 'with', 'the', 'spex', 'spectrograph', 'on', 'nasas', 'infrared', 'telescope', 'facility', 'irtf', 'between', '2007', 'and', '2013', 'inclusive', 'using', 'the', 'measured', 'line', 'fluxes', 'in', 'the', 'pa', 'beta', 'and', 'br', 'gamma', 'lines', 'we', 'found', 'the', 'mass', 'accretion', 'rates', 'to', 'be', '143', '261x108', 'msun', 'y1', 'and', '181', '241x108', 'msun', 'y1', 'respectively', 'but', 'which', 'varied', 'by', 'more', 'than', '50', 'from', 'epoch', 'to', 'epoch', 'the', 'spectral', 'energy', 'distribution', 'sedreveals', 'a', 'variability', 'of', 'about', '30', 'between', '15', 'and', '10', 'microns', 'during', 'this', 'same', 'period', 'of', 'time', 'we', 'investigated', 'the', 'variability', 'using', 'of', 'the', 'continuum', 'emission', 'of', 'the', 'disk', 'in', 'using', 'the', 'montecarlo', 'radiative', 'transfer', 'code', 'mcrt', 'hochunk3d', 'we', 'find', 'that', 'varying', 'the', 'height', 'of', 'the', 'inner', 'rim', 'successfully', 'produces', 'a', 'change', 'in', 'the', 'nir', 'flux', 'but', 'lowers', 'the', 'far', 'ir', 'emission', 'to', 'levels', 'below', 'all', 'measured', 'fluxes', 'because', 'the', 'star', 'exhibits', 'bipolar', 'flows', 'we', 'utilized', 'a', 'structure', 'that', 'simulates', 'an', 'inner', 'disk', 'wind', 'to', 'model', 'the', 'variability', 'in', 'the', 'near', 'ir', 'without', 'producing', 'flux', 'levels', 'in', 'the', 'far', 'ir', 'that', 'are', 'inconsistent', 'with', 'existing', 'data', 'for', 'this', 'object', 'variable', 'near', 'ir', 'emission', 'due', 'to', 'such', 'an', 'outflow', 'is', 'more', 'consistent', 'with', 'the', 'data', 'than', 'changing', 'the', 'scale', 'height', 'of', 'the', 'inner', 'rim', 'of', 'the', 'disk']] | [-0.039364448227431806, 0.09758258919533719, -0.04489826356349069, 0.06632300626619586, -0.038463859385367304, -0.07949871622535977, 0.046265676374813276, 0.4556486387648398, -0.20286001847790822, -0.3647915877889664, 0.09172780788891638, -0.28479823023247136, 0.0044187078052865605, 0.19690732843508676, -0.03514894166118687, -0.014054765218558411, 0.04769131539779621, -0.07550313130597629, -0.047243043679987926, -0.17506296013792355, 0.28167270147463397, 0.14847680711453515, 0.1665510889342321, 0.015278755939964738, 0.060291810348142114, -0.08429411419173924, -0.05857015451973504, -0.03952772764688624, -0.14832936827744042, 0.07815081318175154, 0.19608390449346708, 0.10700587736043547, 0.16882964472031398, -0.3716531536297961, -0.2087635938965139, 0.055442394186476514, 0.1412299924463566, -0.00406938748755714, -0.008362414651977209, -0.2205037866464062, 0.06350437819159456, -0.15214541407490503, -0.14823058365312006, 0.0952864011217441, 0.04815463354101493, -0.02402571662373486, -0.2580948768707458, 0.07792788235293258, -0.002454743480553762, 0.13300512128265662, -0.12786210242969295, -0.12231773737862352, -0.11885922852559902, 0.08249571627183329, 0.04704104911680112, 0.08914065906290142, 0.1800401138940028, -0.12737920931429558, -0.04433102676467526, 0.34563387301861354, -0.12892385846339277, -0.004378847853236255, 0.19829472361930778, -0.2365493621560745, -0.12341028301133997, 0.25216026635330524, 0.13019373906399345, 0.13917154734067264, -0.13900370063465312, 0.02453257018877637, -0.007936710064920286, 0.26055113949447073, 0.0880335956756469, 0.03895509918996443, 0.2881509071349033, 0.10256934978311792, -0.011110429362660008, 0.127054533614899, -0.2817119604386833, -0.08238873731433635, -0.25581145358792995, -0.08461459277272557, -0.11407125087155562, 0.07372702265801352, -0.10817822945232149, -0.09433519234215575, 0.35624376802394786, 0.1337696870921978, 0.25378636938431076, 0.04014127051091886, 0.2814838454082963, 0.09679852668085091, 0.1109686778457087, 0.15587764940934168, 0.32023510738065286, 0.09241304143575862, 0.15915400466792995, -0.2547049433669253, 0.0252741197279344, -0.010979494405910372] |
1,802.02315 | EMC design for the actuators of FAST reflector | The active reflector is one of the three main innovations of the
Five-hundred-meter Aperture Spherical radio Telescope (FAST). The deformation
of such a huge spherically shaped reflector into different transient parabolic
shapes is achieved by using 2225 hydraulic actuators which change the position
of the 2225 nodes through the connected down tied cables. For each different
tracking process of the telescope, more than 1/3 of these 2225 actuators must
be in operation to tune the parabolic aperture accurately to meet the surface
error restriction. It means that some of these actuators are inevitably located
within the main beam of the receiver, and the Electromagnetic Interference
(EMI) from the actuators must be mitigated to ensure the scientific output of
the telescope. Based on the threshold level of interference detrimental to
radio astronomy presented in ITU-R Recommendation RA.769 and EMI measurements,
the shielding efficiency (SE) requirement of each actuator is set to be 80dB in
the frequency range from 70MHz to 3GHz. Therefore, Electromagnetic
Compatibility (EMC) was taken into account in the actuator design by measures
such as power line filters, optical fibers, shielding enclosures and other
structural measures. In 2015, all the actuators had been installed at the FAST
site. Till now, no apparent EMI from the actuators has been detected by the
receiver, which proves the effectiveness of these EMC measures.
| astro-ph.IM | the active reflector is one of the three main innovations of the fivehundredmeter aperture spherical radio telescope fast the deformation of such a huge spherically shaped reflector into different transient parabolic shapes is achieved by using 2225 hydraulic actuators which change the position of the 2225 nodes through the connected down tied cables for each different tracking process of the telescope more than 13 of these 2225 actuators must be in operation to tune the parabolic aperture accurately to meet the surface error restriction it means that some of these actuators are inevitably located within the main beam of the receiver and the electromagnetic interference emi from the actuators must be mitigated to ensure the scientific output of the telescope based on the threshold level of interference detrimental to radio astronomy presented in itur recommendation ra769 and emi measurements the shielding efficiency se requirement of each actuator is set to be 80db in the frequency range from 70mhz to 3ghz therefore electromagnetic compatibility emc was taken into account in the actuator design by measures such as power line filters optical fibers shielding enclosures and other structural measures in 2015 all the actuators had been installed at the fast site till now no apparent emi from the actuators has been detected by the receiver which proves the effectiveness of these emc measures | [['the', 'active', 'reflector', 'is', 'one', 'of', 'the', 'three', 'main', 'innovations', 'of', 'the', 'fivehundredmeter', 'aperture', 'spherical', 'radio', 'telescope', 'fast', 'the', 'deformation', 'of', 'such', 'a', 'huge', 'spherically', 'shaped', 'reflector', 'into', 'different', 'transient', 'parabolic', 'shapes', 'is', 'achieved', 'by', 'using', '2225', 'hydraulic', 'actuators', 'which', 'change', 'the', 'position', 'of', 'the', '2225', 'nodes', 'through', 'the', 'connected', 'down', 'tied', 'cables', 'for', 'each', 'different', 'tracking', 'process', 'of', 'the', 'telescope', 'more', 'than', '13', 'of', 'these', '2225', 'actuators', 'must', 'be', 'in', 'operation', 'to', 'tune', 'the', 'parabolic', 'aperture', 'accurately', 'to', 'meet', 'the', 'surface', 'error', 'restriction', 'it', 'means', 'that', 'some', 'of', 'these', 'actuators', 'are', 'inevitably', 'located', 'within', 'the', 'main', 'beam', 'of', 'the', 'receiver', 'and', 'the', 'electromagnetic', 'interference', 'emi', 'from', 'the', 'actuators', 'must', 'be', 'mitigated', 'to', 'ensure', 'the', 'scientific', 'output', 'of', 'the', 'telescope', 'based', 'on', 'the', 'threshold', 'level', 'of', 'interference', 'detrimental', 'to', 'radio', 'astronomy', 'presented', 'in', 'itur', 'recommendation', 'ra769', 'and', 'emi', 'measurements', 'the', 'shielding', 'efficiency', 'se', 'requirement', 'of', 'each', 'actuator', 'is', 'set', 'to', 'be', '80db', 'in', 'the', 'frequency', 'range', 'from', '70mhz', 'to', '3ghz', 'therefore', 'electromagnetic', 'compatibility', 'emc', 'was', 'taken', 'into', 'account', 'in', 'the', 'actuator', 'design', 'by', 'measures', 'such', 'as', 'power', 'line', 'filters', 'optical', 'fibers', 'shielding', 'enclosures', 'and', 'other', 'structural', 'measures', 'in', '2015', 'all', 'the', 'actuators', 'had', 'been', 'installed', 'at', 'the', 'fast', 'site', 'till', 'now', 'no', 'apparent', 'emi', 'from', 'the', 'actuators', 'has', 'been', 'detected', 'by', 'the', 'receiver', 'which', 'proves', 'the', 'effectiveness', 'of', 'these', 'emc', 'measures']] | [-0.1281609987428634, 0.11121982739793813, -0.03382849228907038, -0.008091479014108865, -0.09052494042341343, -0.17015943241686646, 0.028115954889323225, 0.415048047284257, -0.23330508549274367, -0.3396890596060654, 0.12480969862769019, -0.2706303397172385, -0.10517307313751768, 0.22832200827119364, -0.08452357801698698, 0.06341373850803145, 0.03353118427462918, -0.016447806856806645, -0.004690582788845693, -0.1933021151545373, 0.25291483287001026, 0.12019974228777838, 0.30270631900903855, 0.018943569673733278, 0.13512108971745793, -0.015212337259965186, -0.0436900760687422, 0.023872782946140928, -0.051584983129478956, 0.05909794450695203, 0.2855231538954699, 0.11186588212466714, 0.24479349260218441, -0.4259789441881532, -0.18285098598254, 0.07943335633185185, 0.09023779103934595, 0.02563541635384106, -0.005821987156642452, -0.32455213139764966, 0.08583015017634765, -0.16029692868363452, -0.13531047169288452, 0.04729355456392196, -0.013294743122109636, 0.09431273868646134, -0.20562168480722573, -0.031683024078268895, 0.009073772471906109, 0.05124314469735096, -0.05304100442762402, -0.12340332721307112, -0.022932347653708843, 0.1671064176194539, 0.018105396569907582, -0.005486535248531833, 0.17625924422807823, -0.09109679804268209, -0.04827763227671808, 0.3711108394792642, 0.02438767029164989, -0.14025781691413033, 0.1368884149049832, -0.17427860757875765, -0.06926521592646498, 0.19666781912303782, 0.20813258808550678, 0.04024922058875249, -0.18868664941718719, 0.024308584974377566, 0.04017835272984071, 0.19520025183552536, 0.11400117333396338, 0.0344704663629686, 0.21157107187477364, 0.1587188724806765, 0.09049082335867835, 0.13649037494244773, -0.16092873687990836, -0.012372428013159978, -0.2777621145169674, -0.1283440121597695, -0.1937938126912658, 0.033287007400279185, -0.07091237054998849, -0.10909272952809591, 0.3799541485109578, 0.10351971550209617, 0.11800618304193697, -0.004826018779369241, 0.3557027414859146, 0.08269984397080737, 0.15155136943900618, 0.048440951814568096, 0.3353957095655708, 0.12318820044377142, 0.11369046056854792, -0.2184576531903903, 0.06035877508852123, -0.006430367338576947] |
1,802.02316 | From one-dimensional charge conserving superconductors to the gapless
Haldane phase | We develop a framework to analyze one-dimensional topological superconductors
with charge conservation. In particular, we consider models with $N$ flavors of
fermions and $(\mathbb{Z}_2)^N$ symmetry, associated with the conservation of
the fermionic parity of each flavor. For a single flavor, we recover the result
that a distinct topological phase with exponentially localized zero modes does
not exist due to absence of a gap to single particles in the bulk. For $N>1$,
however, we show that the ends of the system can host low-energy,
exponentially-localized modes. The analysis can readily be generalized to
systems in other symmetry classes. To illustrate these ideas, we focus on
lattice models with $SO\left(N\right)$ symmetric interactions, and study the
phase transition between the trivial and the topological gapless phases using
bosonization and a weak-coupling renormalization group analysis. As a concrete
example, we study in detail the case of $N=3$. We show that in this case, the
topologically non-trivial superconducting phase corresponds to a gapless
analogue of the Haldane phase in spin-1 chains. In this phase, although the
bulk is gapless to single particle excitations, the ends host spin-$1/2$
degrees of freedom which are exponentially localized and protected by the spin
gap in the bulk. We obtain the full phase diagram of the model numerically,
using density matrix renormalization group calculations. Within this model, we
identify the self-dual line studied by Andrei and Destri [Nucl. Phys. B,
231(3), 445-480 (1984)], as a first-order transition line between the gapless
Haldane phase and a trivial gapless phase. This allows us to identify the
propagating spin-$1/2$ kinks in the Andrei-Destri model as the topological
end-modes present at the domain walls between the two phases.
| cond-mat.mes-hall cond-mat.str-el cond-mat.supr-con | we develop a framework to analyze onedimensional topological superconductors with charge conservation in particular we consider models with n flavors of fermions and mathbbz_2n symmetry associated with the conservation of the fermionic parity of each flavor for a single flavor we recover the result that a distinct topological phase with exponentially localized zero modes does not exist due to absence of a gap to single particles in the bulk for n1 however we show that the ends of the system can host lowenergy exponentiallylocalized modes the analysis can readily be generalized to systems in other symmetry classes to illustrate these ideas we focus on lattice models with soleftnright symmetric interactions and study the phase transition between the trivial and the topological gapless phases using bosonization and a weakcoupling renormalization group analysis as a concrete example we study in detail the case of n3 we show that in this case the topologically nontrivial superconducting phase corresponds to a gapless analogue of the haldane phase in spin1 chains in this phase although the bulk is gapless to single particle excitations the ends host spin12 degrees of freedom which are exponentially localized and protected by the spin gap in the bulk we obtain the full phase diagram of the model numerically using density matrix renormalization group calculations within this model we identify the selfdual line studied by andrei and destri nucl phys b 2313 445480 1984 as a firstorder transition line between the gapless haldane phase and a trivial gapless phase this allows us to identify the propagating spin12 kinks in the andreidestri model as the topological endmodes present at the domain walls between the two phases | [['we', 'develop', 'a', 'framework', 'to', 'analyze', 'onedimensional', 'topological', 'superconductors', 'with', 'charge', 'conservation', 'in', 'particular', 'we', 'consider', 'models', 'with', 'n', 'flavors', 'of', 'fermions', 'and', 'mathbbz_2n', 'symmetry', 'associated', 'with', 'the', 'conservation', 'of', 'the', 'fermionic', 'parity', 'of', 'each', 'flavor', 'for', 'a', 'single', 'flavor', 'we', 'recover', 'the', 'result', 'that', 'a', 'distinct', 'topological', 'phase', 'with', 'exponentially', 'localized', 'zero', 'modes', 'does', 'not', 'exist', 'due', 'to', 'absence', 'of', 'a', 'gap', 'to', 'single', 'particles', 'in', 'the', 'bulk', 'for', 'n1', 'however', 'we', 'show', 'that', 'the', 'ends', 'of', 'the', 'system', 'can', 'host', 'lowenergy', 'exponentiallylocalized', 'modes', 'the', 'analysis', 'can', 'readily', 'be', 'generalized', 'to', 'systems', 'in', 'other', 'symmetry', 'classes', 'to', 'illustrate', 'these', 'ideas', 'we', 'focus', 'on', 'lattice', 'models', 'with', 'soleftnright', 'symmetric', 'interactions', 'and', 'study', 'the', 'phase', 'transition', 'between', 'the', 'trivial', 'and', 'the', 'topological', 'gapless', 'phases', 'using', 'bosonization', 'and', 'a', 'weakcoupling', 'renormalization', 'group', 'analysis', 'as', 'a', 'concrete', 'example', 'we', 'study', 'in', 'detail', 'the', 'case', 'of', 'n3', 'we', 'show', 'that', 'in', 'this', 'case', 'the', 'topologically', 'nontrivial', 'superconducting', 'phase', 'corresponds', 'to', 'a', 'gapless', 'analogue', 'of', 'the', 'haldane', 'phase', 'in', 'spin1', 'chains', 'in', 'this', 'phase', 'although', 'the', 'bulk', 'is', 'gapless', 'to', 'single', 'particle', 'excitations', 'the', 'ends', 'host', 'spin12', 'degrees', 'of', 'freedom', 'which', 'are', 'exponentially', 'localized', 'and', 'protected', 'by', 'the', 'spin', 'gap', 'in', 'the', 'bulk', 'we', 'obtain', 'the', 'full', 'phase', 'diagram', 'of', 'the', 'model', 'numerically', 'using', 'density', 'matrix', 'renormalization', 'group', 'calculations', 'within', 'this', 'model', 'we', 'identify', 'the', 'selfdual', 'line', 'studied', 'by', 'andrei', 'and', 'destri', 'nucl', 'phys', 'b', '2313', '445480', '1984', 'as', 'a', 'firstorder', 'transition', 'line', 'between', 'the', 'gapless', 'haldane', 'phase', 'and', 'a', 'trivial', 'gapless', 'phase', 'this', 'allows', 'us', 'to', 'identify', 'the', 'propagating', 'spin12', 'kinks', 'in', 'the', 'andreidestri', 'model', 'as', 'the', 'topological', 'endmodes', 'present', 'at', 'the', 'domain', 'walls', 'between', 'the', 'two', 'phases']] | [-0.18951334697366864, 0.23314732268400903, -0.06172960943529486, 0.024123231132290566, -0.04412837087142247, -0.16920178954972437, 0.08369982643570337, 0.33746707717784574, -0.21563493578729254, -0.2569749625382462, 0.05316830379888415, -0.30290951625087204, -0.1428495941028275, 0.08026505749957222, 0.013402824482397624, 0.017386302948687916, -0.026342961512057592, 0.0161483376942299, -0.1489888863267239, -0.19038830457375971, 0.3022098531084204, -0.045060320141190595, 0.29282385503390324, 0.05424961058802351, 0.013102581814207412, 0.011073217341348666, 0.06884417793221978, -0.004657304880243761, -0.16540914835638465, 0.041757611150818844, 0.2459007801275961, -0.033885795130670346, 0.14423222591307153, -0.4221383559138135, -0.21998358727605255, 0.09769625506025342, 0.16338455536816682, 0.16120302624940114, -0.04360364743905073, -0.32328888028687625, 0.06490213136550867, -0.19514980418952527, -0.1650494160009893, -0.09696674349381484, -0.021879677922913322, -0.06337787833590819, -0.2031108543785565, 0.10167637802261635, 0.057070207164657334, 0.04864200469625454, -0.031468660546104525, -0.06106504901200188, -0.09040933438680238, 0.08585666880287506, 0.05876222444370527, 0.013955730422296458, 0.05739602800372436, -0.12384332044360538, -0.1459540961180917, 0.38483812458192307, -0.06469978863390645, -0.17691011556199993, 0.21391025724372378, -0.1446236717455408, -0.14074828374130582, 0.12214494407590892, 0.11646271245661881, 0.10171493791686198, -0.09085787892367483, 0.12225940775630685, -0.06112494884895299, 0.16557129735021456, -0.007669567669465862, 0.047118846440894736, 0.25162661700440503, 0.12973933181449496, 0.04607799273605148, 0.19381426401690718, -0.07291742535502028, -0.1276947085900853, -0.3233606477337027, -0.19333541293249087, -0.20452584120341474, 0.025965118164216015, -0.04144109418681452, -0.1882012433303451, 0.4566733318932906, 0.13860403337662489, 0.197947087061281, -0.007227286258798644, 0.21977241271589365, 0.11016692816046998, 0.03705827397298654, 0.07498748957770186, 0.22623533083953792, 0.15726692378348497, 0.058838124908032585, -0.27266576626419986, -0.06094026194661166, 0.11027235852433713] |
1,802.02317 | MAGNETO: Covert Channel between Air-Gapped Systems and Nearby
Smartphones via CPU-Generated Magnetic Fields | In this paper, we show that attackers can leak data from isolated, air-gapped
computers to nearby smartphones via covert magnetic signals. The proposed
covert channel works even if a smartphone is kept inside a Faraday shielding
case, which aims to block any type of inbound and outbound wireless
communication (Wi-Fi, cellular, Bluetooth, etc.). The channel also works if the
smartphone is set in airplane mode in order to block any communication with the
device. We implement a malware that controls the magnetic fields emanating from
the computer by regulating workloads on the CPU cores. Sensitive data such as
encryption keys, passwords, or keylogging data is encoded and transmitted over
the magnetic signals. A smartphone located near the computer receives the
covert signals with its magnetic sensor. We present technical background, and
discuss signal generation, data encoding, and signal reception. We show that
the proposed covert channel works from a user-level process, without requiring
special privileges, and can successfully operate from within an isolated
virtual machine (VM).
| cs.CR | in this paper we show that attackers can leak data from isolated airgapped computers to nearby smartphones via covert magnetic signals the proposed covert channel works even if a smartphone is kept inside a faraday shielding case which aims to block any type of inbound and outbound wireless communication wifi cellular bluetooth etc the channel also works if the smartphone is set in airplane mode in order to block any communication with the device we implement a malware that controls the magnetic fields emanating from the computer by regulating workloads on the cpu cores sensitive data such as encryption keys passwords or keylogging data is encoded and transmitted over the magnetic signals a smartphone located near the computer receives the covert signals with its magnetic sensor we present technical background and discuss signal generation data encoding and signal reception we show that the proposed covert channel works from a userlevel process without requiring special privileges and can successfully operate from within an isolated virtual machine vm | [['in', 'this', 'paper', 'we', 'show', 'that', 'attackers', 'can', 'leak', 'data', 'from', 'isolated', 'airgapped', 'computers', 'to', 'nearby', 'smartphones', 'via', 'covert', 'magnetic', 'signals', 'the', 'proposed', 'covert', 'channel', 'works', 'even', 'if', 'a', 'smartphone', 'is', 'kept', 'inside', 'a', 'faraday', 'shielding', 'case', 'which', 'aims', 'to', 'block', 'any', 'type', 'of', 'inbound', 'and', 'outbound', 'wireless', 'communication', 'wifi', 'cellular', 'bluetooth', 'etc', 'the', 'channel', 'also', 'works', 'if', 'the', 'smartphone', 'is', 'set', 'in', 'airplane', 'mode', 'in', 'order', 'to', 'block', 'any', 'communication', 'with', 'the', 'device', 'we', 'implement', 'a', 'malware', 'that', 'controls', 'the', 'magnetic', 'fields', 'emanating', 'from', 'the', 'computer', 'by', 'regulating', 'workloads', 'on', 'the', 'cpu', 'cores', 'sensitive', 'data', 'such', 'as', 'encryption', 'keys', 'passwords', 'or', 'keylogging', 'data', 'is', 'encoded', 'and', 'transmitted', 'over', 'the', 'magnetic', 'signals', 'a', 'smartphone', 'located', 'near', 'the', 'computer', 'receives', 'the', 'covert', 'signals', 'with', 'its', 'magnetic', 'sensor', 'we', 'present', 'technical', 'background', 'and', 'discuss', 'signal', 'generation', 'data', 'encoding', 'and', 'signal', 'reception', 'we', 'show', 'that', 'the', 'proposed', 'covert', 'channel', 'works', 'from', 'a', 'userlevel', 'process', 'without', 'requiring', 'special', 'privileges', 'and', 'can', 'successfully', 'operate', 'from', 'within', 'an', 'isolated', 'virtual', 'machine', 'vm']] | [-0.23490521818938026, 0.05996474352777804, -0.03468415303245546, 0.016743144144271926, -0.10694046666795186, -0.24580373890495982, 0.10652550199161653, 0.37020324638494884, -0.2939169720959771, -0.3030570640441883, 0.12827255423475303, -0.31830895759574845, -0.14414650717250868, 0.20991398519955587, -0.12347972301727003, 0.03837504196128, 0.06516020600887364, 0.09421515782610569, 0.0331706876546728, -0.23066765240657267, 0.2782060600794762, 0.06310777312161468, 0.310034134106834, 0.02566054186514433, 0.073508464751263, 0.035344555898266565, -0.010744587077860194, -0.08326470555109253, -0.04304848060341298, 0.039929532217344334, 0.3175123855696026, 0.19838166343755123, 0.24198948439345302, -0.4955739465441151, -0.21980726491401803, 0.11590500841624136, 0.15547584162036893, 0.11255891874351213, -0.09455706508541255, -0.3425290381510641, 0.16624469431089126, -0.21100511157700053, -0.044151153749258945, -0.0048392556778839736, -0.046873147756489646, 0.024482966761149645, -0.2895782100743648, -0.028791872741190258, -0.008386700786509922, 0.08020132356772132, -0.010721188072951129, -0.0032032193400033087, -0.0011366453941866576, 0.19368700937687766, 0.030846215532696387, 0.0191867113287325, 0.2607316308095911, -0.11986315196957888, -0.14094121872267898, 0.3477404578308384, -0.018667515589580703, -0.15017184157328434, 0.17237163634047878, -0.059144343932563195, -0.08209895905870271, 0.12051097407210506, 0.2312491909342717, 0.04732613449534738, -0.17215062783896384, 0.03261290434768973, -0.0003279615053345999, 0.2300979151020208, 0.09150985344902175, 0.07532146208672728, 0.17239377783339313, 0.16055211149077547, 0.05595793353193103, 0.11669482330858977, -0.17817508721449243, -0.02806612779614263, -0.22656279696882367, -0.1244891532079642, -0.2378949276513507, 0.04762304075067885, -0.05675005499813187, -0.09061668653332863, 0.3464350822404117, 0.1942191614835321, 0.09902058349198561, 0.04421211673642497, 0.46162637630589753, -0.011695572591568372, 0.16989158972233803, 0.19546044754048147, 0.16973385080717593, 0.046694075291785576, 0.1936871634778028, -0.14314700021543147, 0.09607944773588643, -0.05414039754615227] |
1,802.02318 | Scalar products of the elliptic Felderhof model and elliptic Cauchy
formula | We analyze the scalar products of the elliptic Felderhof model introduced by
Foda-Wheeler-Zuparic as an elliptic extension of the trigonometric face-type
Felderhof model by Deguchi-Akutsu. We derive the determinant formula for the
scalar products by applying the Izergin-Korepin technique developed by Wheeler
to investigate the scalar products of integrable lattice models. By combining
the determinant formula for the scalar products with the recently-developed
Izergin-Korepin technique to analyze the wavefunctions, we derive a Cauchy
formula for elliptic Schur functions.
| math-ph hep-th math.MP | we analyze the scalar products of the elliptic felderhof model introduced by fodawheelerzuparic as an elliptic extension of the trigonometric facetype felderhof model by deguchiakutsu we derive the determinant formula for the scalar products by applying the izerginkorepin technique developed by wheeler to investigate the scalar products of integrable lattice models by combining the determinant formula for the scalar products with the recentlydeveloped izerginkorepin technique to analyze the wavefunctions we derive a cauchy formula for elliptic schur functions | [['we', 'analyze', 'the', 'scalar', 'products', 'of', 'the', 'elliptic', 'felderhof', 'model', 'introduced', 'by', 'fodawheelerzuparic', 'as', 'an', 'elliptic', 'extension', 'of', 'the', 'trigonometric', 'facetype', 'felderhof', 'model', 'by', 'deguchiakutsu', 'we', 'derive', 'the', 'determinant', 'formula', 'for', 'the', 'scalar', 'products', 'by', 'applying', 'the', 'izerginkorepin', 'technique', 'developed', 'by', 'wheeler', 'to', 'investigate', 'the', 'scalar', 'products', 'of', 'integrable', 'lattice', 'models', 'by', 'combining', 'the', 'determinant', 'formula', 'for', 'the', 'scalar', 'products', 'with', 'the', 'recentlydeveloped', 'izerginkorepin', 'technique', 'to', 'analyze', 'the', 'wavefunctions', 'we', 'derive', 'a', 'cauchy', 'formula', 'for', 'elliptic', 'schur', 'functions']] | [-0.10328133208187003, 0.05856862486095787, -0.10351047030110892, 0.11405400739443537, -0.06596643186027282, -0.14547468070553518, -0.026180161478757662, 0.27111801813895764, -0.2504583949554025, -0.2391730181529726, 0.11808887151633635, -0.24250751437227192, -0.17586063417164902, 0.19809835237499915, -0.0019516769986550667, 0.097763915374679, 0.03362280432147121, 0.023197960696722333, -0.1336502148524711, -0.2066000565261531, 0.4135181469303605, 0.019478841206843133, 0.19748856080695987, 0.0529453507195668, 0.10018708177008911, 0.12353868929571227, -0.09324023523980654, -0.09921973465794795, -0.20481000022693097, 0.17339151540133907, 0.16656441891805834, 0.08401600621934784, 0.1744475995656103, -0.3737816704118526, -0.1773094475440877, 0.1351117159999711, 0.13180224731025336, 0.0636003534309566, -0.0057415960871271396, -0.30152158152410075, 0.02320670244578076, -0.2613160573436241, -0.23984390316457538, -0.14470717322240634, -0.043187962299653965, 0.02078398012274288, -0.3017127462172587, 0.07396879686826938, 0.008679834497773922, 0.0371552176565226, -0.07914550983543067, -0.1457402439738967, 0.014657841352010635, 0.028878273473023193, 0.04982690819796469, -0.026208535504625423, 0.03509511038244359, -0.10937409496277962, -0.14192729094678438, 0.33336738213945766, -0.15414420659286215, -0.277112557258653, 0.006158309498507725, -0.08129355549738791, -0.08398279150653827, 0.069872688036412, 0.13338794421992803, 0.164080812411971, -0.1832564179050295, 0.17320788735033651, -0.07765479117484861, 0.045740410562996804, 0.09356349526512388, -0.08257280548078645, 0.13820723306975866, 0.013958483664809089, -0.025681179041337026, 0.24738834117000041, 0.017250879128512583, -0.12879751305904633, -0.29475141132838634, -0.21918848920368442, -0.16454795917103948, 0.08450431776796713, -0.12794487979140526, -0.19717616283972011, 0.41128971310038315, 0.06538313849963934, 0.14515331691425098, 0.10070413081465583, 0.22571997245540842, 0.2016206822146686, 0.10012054746498746, 0.017304539037133127, 0.1453860756254902, 0.2663647861030002, 0.1188138104043901, -0.21477331362640192, -0.04158515976374283, 0.28873831237127123] |
1,802.02319 | A structural test for the conformal invariance of the critical 3d Ising
model | How can a renormalization group fixed point be scale invariant without being
conformal? Polchinski (1988) showed that this may happen if the theory contains
a virial current -- a non-conserved vector operator of dimension exactly
$(d-1)$, whose divergence expresses the trace of the stress tensor. We point
out that this scenario can be probed via lattice Monte Carlo simulations, using
the critical 3d Ising model as an example. Our results put a lower bound
$\Delta_V>5.0$ on the scaling dimension of the lowest virial current candidate
$V$, well above 2 expected for the true virial current. This implies that the
critical 3d Ising model has no virial current, providing a structural
explanation for the conformal invariance of the model.
| hep-th cond-mat.stat-mech hep-lat | how can a renormalization group fixed point be scale invariant without being conformal polchinski 1988 showed that this may happen if the theory contains a virial current a nonconserved vector operator of dimension exactly d1 whose divergence expresses the trace of the stress tensor we point out that this scenario can be probed via lattice monte carlo simulations using the critical 3d ising model as an example our results put a lower bound delta_v50 on the scaling dimension of the lowest virial current candidate v well above 2 expected for the true virial current this implies that the critical 3d ising model has no virial current providing a structural explanation for the conformal invariance of the model | [['how', 'can', 'a', 'renormalization', 'group', 'fixed', 'point', 'be', 'scale', 'invariant', 'without', 'being', 'conformal', 'polchinski', '1988', 'showed', 'that', 'this', 'may', 'happen', 'if', 'the', 'theory', 'contains', 'a', 'virial', 'current', 'a', 'nonconserved', 'vector', 'operator', 'of', 'dimension', 'exactly', 'd1', 'whose', 'divergence', 'expresses', 'the', 'trace', 'of', 'the', 'stress', 'tensor', 'we', 'point', 'out', 'that', 'this', 'scenario', 'can', 'be', 'probed', 'via', 'lattice', 'monte', 'carlo', 'simulations', 'using', 'the', 'critical', '3d', 'ising', 'model', 'as', 'an', 'example', 'our', 'results', 'put', 'a', 'lower', 'bound', 'delta_v50', 'on', 'the', 'scaling', 'dimension', 'of', 'the', 'lowest', 'virial', 'current', 'candidate', 'v', 'well', 'above', '2', 'expected', 'for', 'the', 'true', 'virial', 'current', 'this', 'implies', 'that', 'the', 'critical', '3d', 'ising', 'model', 'has', 'no', 'virial', 'current', 'providing', 'a', 'structural', 'explanation', 'for', 'the', 'conformal', 'invariance', 'of', 'the', 'model']] | [-0.12210967090253814, 0.1383803681625256, -0.09442922594788453, 0.08893203056228732, -0.062478953364289144, -0.14960633128166906, 0.0370703153683531, 0.3059739361452902, -0.2319409688372679, -0.25925176467039973, 0.10272347298049336, -0.27203293217763563, -0.13306145853330864, 0.1467270571517694, 0.05085035569259319, 0.05935332957847879, -0.010260163730106735, 0.07587412628746623, -0.12458470921586107, -0.24457660639570256, 0.3000499707132835, 0.06301098356649665, 0.2700511303304791, 0.07499877300418528, 0.09481232821668402, -0.004458716384070958, 0.029082176913326638, 0.047708439154967926, -0.14954289132702828, 0.07200044480248771, 0.19329242297179258, 0.06564542978945799, 0.2190476665353595, -0.37642972034819683, -0.23669880617345715, 0.13062011852764108, 0.1677901933716353, 0.11953735305799236, -0.030499543513950154, -0.2598562893730685, 0.09517653019103253, -0.1928360297119823, -0.19083925893787165, -0.0768457638653766, -0.011784727821640414, -0.06598097399069831, -0.27039304870614334, 0.14147446024360072, 0.07164797539409282, 0.07064666109890196, -0.049510604200146066, -0.10657379969729688, -0.06416521204137725, 0.09581708987464262, 0.01766723266337067, 0.10627547014556857, 0.1718443503025277, -0.15259099274382984, -0.12344824897470595, 0.37424482447737506, -0.06325760596142761, -0.19236187492738124, 0.16940898110022254, -0.16405791769623115, -0.14840565103102185, 0.07689712498666204, 0.07857934852805117, 0.08649106341382039, -0.14148677986693278, 0.1390688083825055, -0.11149242931398852, 0.16230355704891705, 0.014595078763046205, -0.07732653140254993, 0.24140662321387307, 0.1064253880497839, 0.07719890941496424, 0.12499472004329336, -0.0597524721123246, -0.121551380882136, -0.3585281252282961, -0.16064823322361416, -0.22456145514172085, 0.12192543836135883, -0.17365686281519974, -0.15933507749939274, 0.3359180432021746, 0.20888128393537422, 0.20640854133495756, 0.07486284084132358, 0.24483203977759896, 0.17119473976821736, 0.09719209909310629, 0.10249944611308004, 0.25382953799522384, 0.11975728056457793, 0.05575787128503274, -0.19671658198911182, 0.025408890363278574, 0.15412890347491565] |
1,802.0232 | A focus on L dwarfs with trigonometric parallaxes | We report new parallax measurements for ten L and early T type dwarfs, five
of which have no previous published values, using observations over 3 years at
the robotic Liverpool Telescope. The resulting parallaxes and proper motions
have median errors of 2\,mas and 1.5\,mas/year respectively. Their space
motions indicate they are all Galactic disk members. We combined this sample
with other objects with astrometry from the Liverpool Telescope and with
published literature astrometry to construct a sample of 260 L and early T type
dwarfs with measured parallaxes, designated the Astrometry Sample. We study the
kinematics of the Astrometry Sample, and derived a solar motion of
$(U,V,W)_{\bigodot} = (7.9\pm1.7,13.2\pm1.2,7.2\pm1.0)$\,\kms~ with respect to
the local standard of rest, in agreement with recent literature. We derive a
kinematic age of 1.5-1.7\,Gyr for the Astrometry Sample assuming the age
increases monotonically with the total velocity for a given disk sample. This
kinematic age is less than half literature values for other low mass dwarf
samples. We believe this difference arises for two reasons (1) the sample is
mainly composed of mid to late L dwarfs which are expected to be relatively
young and (2) the requirement that objects have a measured parallax biases the
sample to the brighter examples which tend to be younger.
| astro-ph.SR | we report new parallax measurements for ten l and early t type dwarfs five of which have no previous published values using observations over 3 years at the robotic liverpool telescope the resulting parallaxes and proper motions have median errors of 2mas and 15masyear respectively their space motions indicate they are all galactic disk members we combined this sample with other objects with astrometry from the liverpool telescope and with published literature astrometry to construct a sample of 260 l and early t type dwarfs with measured parallaxes designated the astrometry sample we study the kinematics of the astrometry sample and derived a solar motion of uvw_bigodot 79pm17132pm1272pm10kms with respect to the local standard of rest in agreement with recent literature we derive a kinematic age of 1517gyr for the astrometry sample assuming the age increases monotonically with the total velocity for a given disk sample this kinematic age is less than half literature values for other low mass dwarf samples we believe this difference arises for two reasons 1 the sample is mainly composed of mid to late l dwarfs which are expected to be relatively young and 2 the requirement that objects have a measured parallax biases the sample to the brighter examples which tend to be younger | [['we', 'report', 'new', 'parallax', 'measurements', 'for', 'ten', 'l', 'and', 'early', 't', 'type', 'dwarfs', 'five', 'of', 'which', 'have', 'no', 'previous', 'published', 'values', 'using', 'observations', 'over', '3', 'years', 'at', 'the', 'robotic', 'liverpool', 'telescope', 'the', 'resulting', 'parallaxes', 'and', 'proper', 'motions', 'have', 'median', 'errors', 'of', '2mas', 'and', '15masyear', 'respectively', 'their', 'space', 'motions', 'indicate', 'they', 'are', 'all', 'galactic', 'disk', 'members', 'we', 'combined', 'this', 'sample', 'with', 'other', 'objects', 'with', 'astrometry', 'from', 'the', 'liverpool', 'telescope', 'and', 'with', 'published', 'literature', 'astrometry', 'to', 'construct', 'a', 'sample', 'of', '260', 'l', 'and', 'early', 't', 'type', 'dwarfs', 'with', 'measured', 'parallaxes', 'designated', 'the', 'astrometry', 'sample', 'we', 'study', 'the', 'kinematics', 'of', 'the', 'astrometry', 'sample', 'and', 'derived', 'a', 'solar', 'motion', 'of', 'uvw_bigodot', '79pm17132pm1272pm10kms', 'with', 'respect', 'to', 'the', 'local', 'standard', 'of', 'rest', 'in', 'agreement', 'with', 'recent', 'literature', 'we', 'derive', 'a', 'kinematic', 'age', 'of', '1517gyr', 'for', 'the', 'astrometry', 'sample', 'assuming', 'the', 'age', 'increases', 'monotonically', 'with', 'the', 'total', 'velocity', 'for', 'a', 'given', 'disk', 'sample', 'this', 'kinematic', 'age', 'is', 'less', 'than', 'half', 'literature', 'values', 'for', 'other', 'low', 'mass', 'dwarf', 'samples', 'we', 'believe', 'this', 'difference', 'arises', 'for', 'two', 'reasons', '1', 'the', 'sample', 'is', 'mainly', 'composed', 'of', 'mid', 'to', 'late', 'l', 'dwarfs', 'which', 'are', 'expected', 'to', 'be', 'relatively', 'young', 'and', '2', 'the', 'requirement', 'that', 'objects', 'have', 'a', 'measured', 'parallax', 'biases', 'the', 'sample', 'to', 'the', 'brighter', 'examples', 'which', 'tend', 'to', 'be', 'younger']] | [-0.0545968204076646, 0.11980086911777124, -0.08109796916821845, 0.03654109636147606, -0.14243900072783486, -0.0697191291368901, 0.08485503481402631, 0.42828939314389114, -0.16712652218812915, -0.4117501110047016, 0.09745651681498325, -0.31854771492433126, 0.011813540807337437, 0.22808365537293337, -0.09824527342107545, -0.016468538198415508, 0.1338436699119731, -0.029550162528288886, -0.08235310600986885, -0.2813528261816545, 0.2656186204951808, 0.041713593074446095, 0.14091490164344894, -0.13233980626202396, 0.08111658830942192, -0.105743477399036, -0.1425150923653578, 0.03364586443354905, -0.1737599936281786, 0.07098136448699222, 0.2378893159273379, 0.09760386556459283, 0.2262419057214289, -0.2956470526713602, -0.16382293486899868, 0.09934259651373457, 0.13051885245277464, 0.044121917147863, -0.034873110286267564, -0.292426565637161, 0.10024972075711737, -0.16960346851118127, -0.1694319695957656, 0.05176404914174464, 0.10930212296644967, 0.02422812452666389, -0.21728405595567185, 0.10292204917810893, 0.007827143835862286, 0.16249221717956866, -0.13104667916704077, -0.20955929035338963, -0.030761570356632538, 0.13113756573451593, 0.009529379718638594, 0.09404976695727385, 0.11195359777860361, -0.09330307690593984, -0.05172394466297068, 0.3749334355635406, -0.07252751864659322, -0.0635444692446787, 0.23232675731087157, -0.23139161905963246, -0.14588670883380278, 0.10292715668334688, 0.15952759162574845, 0.1362037163883198, -0.20185188371326448, 0.002597254571404299, -0.01046265956484577, 0.16990527869609084, 0.030355087161014416, 0.08233617097322317, 0.21561699729521297, 0.11350581266078646, 0.05845984151175481, 0.04951559273058151, -0.24076967472346156, -0.040473810609574744, -0.26915086056128396, -0.12284297951117375, -0.11500649745248312, 0.06776136054953524, -0.10808021641677998, -0.09754715502958347, 0.30539713569609356, 0.12420214439114416, 0.22322329232758545, 0.10271127084982175, 0.2759278068879565, 0.05326678214913451, 0.14070823228832116, 0.11259809135712538, 0.31488345364488446, 0.14142292095981177, 0.0983760391437738, -0.1956705208856486, 0.06425459711028046, 0.006816533536568863] |
1,802.02321 | On recovering Sturm-Liouville differential operators with deviating
argument | We consider second-order functional differential operators with a constant
delay. Properties of their spectral characteristics are obtained and a
nonlinear inverse problem is studied, which consists in recovering the
operators from their spectra. We establish the uniqueness and develop a
constructive algorithm for solution of the inverse problem.
| math.SP | we consider secondorder functional differential operators with a constant delay properties of their spectral characteristics are obtained and a nonlinear inverse problem is studied which consists in recovering the operators from their spectra we establish the uniqueness and develop a constructive algorithm for solution of the inverse problem | [['we', 'consider', 'secondorder', 'functional', 'differential', 'operators', 'with', 'a', 'constant', 'delay', 'properties', 'of', 'their', 'spectral', 'characteristics', 'are', 'obtained', 'and', 'a', 'nonlinear', 'inverse', 'problem', 'is', 'studied', 'which', 'consists', 'in', 'recovering', 'the', 'operators', 'from', 'their', 'spectra', 'we', 'establish', 'the', 'uniqueness', 'and', 'develop', 'a', 'constructive', 'algorithm', 'for', 'solution', 'of', 'the', 'inverse', 'problem']] | [-0.12764099618652835, -0.0025269147105670222, -0.06981382328861703, 0.09763235938104724, -0.07948359087458812, -0.11441780763561837, 0.00738000008277595, 0.3637604520966609, -0.3348802444525063, -0.2714598028299709, 0.1471161951267277, -0.2971457380723829, -0.18621953786350787, 0.17147402085053423, -0.029437336158783484, 0.11479310212113585, 0.032642052217852324, 0.026230095458837848, -0.11758082818899614, -0.1463373075700171, 0.38132954435423017, -0.018859226489439607, 0.21413445356301963, 0.022984328049157437, 0.16201378170323247, 0.03900602955642777, -0.0900290064746514, 0.023331924763624556, -0.1372401827320573, 0.15216442832024768, 0.2676447673293296, 0.1201763948968922, 0.28956100236003596, -0.39639409907006967, -0.20123633994565657, 0.10818005587983255, 0.0776314311757839, 0.09745439018540007, -0.07699531528245036, -0.266872825033109, 0.12708395756878113, -0.06674502842361107, -0.14011257184514156, -0.03377411555266008, -0.013840185905185839, 0.0527016306684042, -0.3090063762307788, 0.11189094542836149, 0.06851503260744114, 0.03608542036575576, -0.1405449170367016, -0.09310026579381277, 0.059546874389828496, 0.10450430164928548, 0.005795448070178584, -0.10870636511632863, 0.04187787338742055, -0.12251957642729394, -0.1275501741717259, 0.36208965761276585, -0.081299363131014, -0.208688146318309, 0.1147399887170953, -0.08437222151163344, -0.0855582881195005, 0.10276311080087908, 0.1829705312071989, 0.21386354827942947, -0.18468208651756868, 0.17106641196248043, -0.04387569949418927, 0.13229208813087703, 0.0293568355749206, 0.05467342736907691, 0.09212216350715607, 0.13958793377969414, 0.1325724278576672, 0.18620655307313427, -0.005750781885581091, -0.07251933459580566, -0.2858267875077824, -0.1261705953559916, -0.11987621123747279, 0.05120939883636311, -0.07830278409467913, -0.19734520544686043, 0.42714569228701293, 0.0730918351133975, 0.23260063549969345, 0.11646157183228449, 0.25084088028719026, 0.26758060841045034, -0.016209181878366508, 0.057244509390632935, 0.2277745868001754, 0.21527629661432002, 0.1522830355000527, -0.2561956737044966, 0.03139667181919018, 0.1591285789424243] |
1,802.02322 | Cyclicity and indecomposability in the Brauer group of a $p$-adic curve | For a $p$-adic curve $X$, we study conditions under which all classes in the
$n$-torsion of $Br(X)$ are $\mathbb{Z}/n$-cyclic. We show that in general not
all classes are $\mathbb{Z}/n$-cyclic classes. On the other hand, if $X$ has
good reduction and $n$ is prime to $p$, of if $X$ is an elliptic curve over
$\mathbb{Q}_p$ with split multiplicative reduction and $n$ is a power of $p$,
then we prove that all order $n$ elements of $Br(X)$ are $\mathbb{Z}/n$-cyclic.
Finally, if $X$ has good reduction and its function field $K(X)$ contains all
$p^2$-th roots of $1$, we show the existence of indecomposable division
algebras over $K(X)$ with period $p^2$ and index $p^3$.
| math.RA | for a padic curve x we study conditions under which all classes in the ntorsion of brx are mathbbzncyclic we show that in general not all classes are mathbbzncyclic classes on the other hand if x has good reduction and n is prime to p of if x is an elliptic curve over mathbbq_p with split multiplicative reduction and n is a power of p then we prove that all order n elements of brx are mathbbzncyclic finally if x has good reduction and its function field kx contains all p2th roots of 1 we show the existence of indecomposable division algebras over kx with period p2 and index p3 | [['for', 'a', 'padic', 'curve', 'x', 'we', 'study', 'conditions', 'under', 'which', 'all', 'classes', 'in', 'the', 'ntorsion', 'of', 'brx', 'are', 'mathbbzncyclic', 'we', 'show', 'that', 'in', 'general', 'not', 'all', 'classes', 'are', 'mathbbzncyclic', 'classes', 'on', 'the', 'other', 'hand', 'if', 'x', 'has', 'good', 'reduction', 'and', 'n', 'is', 'prime', 'to', 'p', 'of', 'if', 'x', 'is', 'an', 'elliptic', 'curve', 'over', 'mathbbq_p', 'with', 'split', 'multiplicative', 'reduction', 'and', 'n', 'is', 'a', 'power', 'of', 'p', 'then', 'we', 'prove', 'that', 'all', 'order', 'n', 'elements', 'of', 'brx', 'are', 'mathbbzncyclic', 'finally', 'if', 'x', 'has', 'good', 'reduction', 'and', 'its', 'function', 'field', 'kx', 'contains', 'all', 'p2th', 'roots', 'of', '1', 'we', 'show', 'the', 'existence', 'of', 'indecomposable', 'division', 'algebras', 'over', 'kx', 'with', 'period', 'p2', 'and', 'index', 'p3']] | [-0.21567115990275687, 0.08401456194445597, -0.10235858219252392, -0.003247488028666174, -0.047904673165811054, -0.15785010977309535, -0.03180375812913884, 0.3831229411742904, -0.3066444600085643, -0.2068678979433819, 0.08035143225133652, -0.3046653405509212, -0.11047147759077647, 0.24538357267579572, -0.09938036466906355, -0.046634794046192175, 0.012101176599125293, 0.14925241143527357, -0.07897042091089217, -0.3767161847684871, 0.33700483517975294, -0.09688937472052533, 0.17676069079686635, 0.02006405518887649, 0.10633560938083313, 0.019399470078166236, 0.04645148778455967, 0.0019510116682133892, -0.1402524839796983, 0.0613362663065676, 0.29845634245059705, 0.1015573175475848, 0.2063236006958918, -0.30875218439508567, -0.14888249446045268, 0.27793371300636366, 0.11354927850294519, -0.041873835455837914, 0.0037846670602448285, -0.13310007359832526, 0.22664351776580918, -0.15154536026106638, -0.12989203195426274, -0.07494186894248493, 0.14988912518072703, 0.06469997602133927, -0.3086420495105399, -0.014929861693897031, 0.10104821072044698, 0.1441052235493606, -0.052697107051393355, -0.1724030995667404, -0.0529454860963266, 0.07331741025502031, 0.013018519505435092, 0.05525175723226063, 0.03478566008958627, -0.07363958962192886, -0.08509410041045737, 0.363898305086927, -0.07320775036774152, -0.17660560285757212, 0.10868056852539831, -0.21499616457996043, -0.1553623091471805, 0.15958279303529047, 0.08450018282641064, 0.14007659911770712, -0.009461640946260145, 0.21881208429324694, -0.15030501699075102, 0.16666153898695485, 0.08966507032428953, -0.0012551859037061646, 0.09886362117461182, 0.07140306929465044, 0.07355995936059943, 0.09980318305897526, -0.036459578207524664, 0.029841121709482235, -0.3734968212263828, -0.1812328548170626, -0.09113055801188404, 0.13931223312617724, -0.1057799368625803, -0.11938126399605112, 0.3716218929568475, 0.058613093654540455, 0.18033828839067031, 0.07442332417386668, 0.19437387820163912, 0.10497921122746035, 0.024813005276982124, 0.09971275719915204, 0.08701433411545374, 0.15203014772427692, -0.0598718923241408, -0.1417083027349277, -0.0006386315534737977, 0.12038460721854459] |
1,802.02323 | Intermittency spectra of current helicity in solar active regions | We analyse the spatial distribution of current helicity in solar active
regions. A comparison of current helicity maps derived from three different
instruments (Helioseismic and Magnetc Imager on board the Solar Dynamics
Observatory, SDO/HMI, Spectro-Polarimeter on board the Hinode, and Solar
Magnetic Field Telescope at the Huairou Solar Observing Station, China,
HSOS/SMFT) is carried out. The comparison showed an excellent correlation
between the maps derived from the spaceborne instruments and moderate
correlation between the maps derived from SDO/HMI and HSOS/SMFT vector
magnetograms. The results suggest that the obtained maps characterize real
spatial distribution of current helicity over an active region. To analyse
intermittency of current helicity, we traditionally use the high-order
structure functions and flatness function approach. The slope of a flatness
function within some range of scales - the flatness exponent - is a measure of
the degree of intermittency. SDO/HMI vector magnetograms for 3 ARs (NOAA 11158,
12494, and 12673) were used to calculate the flatness exponent time variations.
All three ARs exhibited emergence of a new magnetic flux during the
observational interval. The flatness exponent indicated the increase of
intermittency 12-20 hours before the emergence of a new flux. We suppose that
this behaviour can indicate subphotospheric fragmentation or distortion of the
pre-existed electric current system by emerging magnetic flux.
| astro-ph.SR | we analyse the spatial distribution of current helicity in solar active regions a comparison of current helicity maps derived from three different instruments helioseismic and magnetc imager on board the solar dynamics observatory sdohmi spectropolarimeter on board the hinode and solar magnetic field telescope at the huairou solar observing station china hsossmft is carried out the comparison showed an excellent correlation between the maps derived from the spaceborne instruments and moderate correlation between the maps derived from sdohmi and hsossmft vector magnetograms the results suggest that the obtained maps characterize real spatial distribution of current helicity over an active region to analyse intermittency of current helicity we traditionally use the highorder structure functions and flatness function approach the slope of a flatness function within some range of scales the flatness exponent is a measure of the degree of intermittency sdohmi vector magnetograms for 3 ars noaa 11158 12494 and 12673 were used to calculate the flatness exponent time variations all three ars exhibited emergence of a new magnetic flux during the observational interval the flatness exponent indicated the increase of intermittency 1220 hours before the emergence of a new flux we suppose that this behaviour can indicate subphotospheric fragmentation or distortion of the preexisted electric current system by emerging magnetic flux | [['we', 'analyse', 'the', 'spatial', 'distribution', 'of', 'current', 'helicity', 'in', 'solar', 'active', 'regions', 'a', 'comparison', 'of', 'current', 'helicity', 'maps', 'derived', 'from', 'three', 'different', 'instruments', 'helioseismic', 'and', 'magnetc', 'imager', 'on', 'board', 'the', 'solar', 'dynamics', 'observatory', 'sdohmi', 'spectropolarimeter', 'on', 'board', 'the', 'hinode', 'and', 'solar', 'magnetic', 'field', 'telescope', 'at', 'the', 'huairou', 'solar', 'observing', 'station', 'china', 'hsossmft', 'is', 'carried', 'out', 'the', 'comparison', 'showed', 'an', 'excellent', 'correlation', 'between', 'the', 'maps', 'derived', 'from', 'the', 'spaceborne', 'instruments', 'and', 'moderate', 'correlation', 'between', 'the', 'maps', 'derived', 'from', 'sdohmi', 'and', 'hsossmft', 'vector', 'magnetograms', 'the', 'results', 'suggest', 'that', 'the', 'obtained', 'maps', 'characterize', 'real', 'spatial', 'distribution', 'of', 'current', 'helicity', 'over', 'an', 'active', 'region', 'to', 'analyse', 'intermittency', 'of', 'current', 'helicity', 'we', 'traditionally', 'use', 'the', 'highorder', 'structure', 'functions', 'and', 'flatness', 'function', 'approach', 'the', 'slope', 'of', 'a', 'flatness', 'function', 'within', 'some', 'range', 'of', 'scales', 'the', 'flatness', 'exponent', 'is', 'a', 'measure', 'of', 'the', 'degree', 'of', 'intermittency', 'sdohmi', 'vector', 'magnetograms', 'for', '3', 'ars', 'noaa', '11158', '12494', 'and', '12673', 'were', 'used', 'to', 'calculate', 'the', 'flatness', 'exponent', 'time', 'variations', 'all', 'three', 'ars', 'exhibited', 'emergence', 'of', 'a', 'new', 'magnetic', 'flux', 'during', 'the', 'observational', 'interval', 'the', 'flatness', 'exponent', 'indicated', 'the', 'increase', 'of', 'intermittency', '1220', 'hours', 'before', 'the', 'emergence', 'of', 'a', 'new', 'flux', 'we', 'suppose', 'that', 'this', 'behaviour', 'can', 'indicate', 'subphotospheric', 'fragmentation', 'or', 'distortion', 'of', 'the', 'preexisted', 'electric', 'current', 'system', 'by', 'emerging', 'magnetic', 'flux']] | [-0.15279408282114434, 0.18127733998910012, -0.04417963403137626, 0.1372341566099358, -0.036293278225294906, -0.038758879521825676, 0.0034842204779458505, 0.39479531115595845, -0.22452370969101715, -0.3537946337483067, 0.07389622586295638, -0.2602113494919478, -0.12763530907788032, 0.23323279438238897, -0.005531681987377118, 0.028429482987595966, 0.05942955489747298, -0.03899067549759315, -0.04263569804466361, -0.15926824175023838, 0.2983333066461275, 0.12348388464545498, 0.3189255786221137, -0.0238892013254319, 0.12456986484523994, -0.08868822141422256, -0.08647636557672767, 0.04091044872153352, -0.11904427259835665, 0.05295811920845206, 0.15105571085362188, 0.12697856898356571, 0.2018876292794529, -0.42471294831664524, -0.23967130718401808, 0.03356261247406817, 0.10945178904899076, -0.07704709277005758, 0.005715589874181087, -0.2991540500273307, 0.03809480110362199, -0.10336007591026806, -0.10820167923598113, -0.0027340675078800333, 0.015202777177333867, 0.03625316931000024, -0.31083202359726614, 0.044651562432929476, -0.05301198968663812, 0.19431409117392295, -0.15069512641822227, -0.08339388721120872, -0.08932482038010452, 0.17353016030547266, 0.08713497967652725, 0.07267040736379399, 0.14837464055351257, -0.1196037686119477, -0.09977655946828227, 0.2637039592201655, -0.07133416419934284, -0.061200149463048734, 0.10636084179668395, -0.27532533058392755, -0.13248176983634127, 0.1568614155827945, 0.15767175983187656, 0.07092728860370347, -0.09995008157234378, 0.04967657577613108, -0.04599284265383826, 0.1900963856127779, 0.060446807499390076, -0.0015292402845020023, 0.23567551935028627, 0.09646034032637299, 0.07833019834588809, 0.10675342249513069, -0.2877056639065633, -0.09894105854808637, -0.2903454308015641, -0.12942125759388945, -0.1130332006642073, 0.07809752278740784, -0.1218567725878652, -0.14551192210258349, 0.4587950445351681, 0.1750233061319208, 0.1834555612893883, 0.007574409811087133, 0.3066604331873609, 0.0997874156722646, 0.07232819692679379, 0.09767271466508219, 0.3085161516706376, 0.17884713643936864, 0.24232656568241562, -0.22666262173102852, 0.027938251217134332, 0.0752297304165752] |
1,802.02324 | Hadronic model for the non-thermal radiation from the binary system
AR~Scorpii | AR Scorpii is a close binary system containing a rotation powered white dwarf
and a low mass M type companion star. This system shows non-thermal emission
extending up to the X-ray energy range. We consider hybrid (lepto-hadronic) and
pure hadronic models for the high energy non-thermal processes in this binary
system. Relativistic electrons and hadrons are assumed to be accelerated in a
strongly magnetised, turbulent region formed in collision of a rotating white
dwarf magnetosphere and a magnetosphere/dense atmosphere of the M dwarf star.
We propose that the non-thermal X-ray emission is produced either by the
primary electrons or the secondary $e^\pm$ pairs from decay of charged pions
created in collisions of hadrons with the companion star atmosphere. We show
that the accompanying $\gamma$-ray emission from decay of neutral pions, that
are produced by these same protons, is expected to be on the detectability
level of the present and/or the future satellite and Cherenkov telescopes. The
$\gamma$-ray observations of the binary system AR Sco should allow to constrain
the efficiency of hadron and electron acceleration and also the details of the
radiation processes.
| astro-ph.HE | ar scorpii is a close binary system containing a rotation powered white dwarf and a low mass m type companion star this system shows nonthermal emission extending up to the xray energy range we consider hybrid leptohadronic and pure hadronic models for the high energy nonthermal processes in this binary system relativistic electrons and hadrons are assumed to be accelerated in a strongly magnetised turbulent region formed in collision of a rotating white dwarf magnetosphere and a magnetospheredense atmosphere of the m dwarf star we propose that the nonthermal xray emission is produced either by the primary electrons or the secondary epm pairs from decay of charged pions created in collisions of hadrons with the companion star atmosphere we show that the accompanying gammaray emission from decay of neutral pions that are produced by these same protons is expected to be on the detectability level of the present andor the future satellite and cherenkov telescopes the gammaray observations of the binary system ar sco should allow to constrain the efficiency of hadron and electron acceleration and also the details of the radiation processes | [['ar', 'scorpii', 'is', 'a', 'close', 'binary', 'system', 'containing', 'a', 'rotation', 'powered', 'white', 'dwarf', 'and', 'a', 'low', 'mass', 'm', 'type', 'companion', 'star', 'this', 'system', 'shows', 'nonthermal', 'emission', 'extending', 'up', 'to', 'the', 'xray', 'energy', 'range', 'we', 'consider', 'hybrid', 'leptohadronic', 'and', 'pure', 'hadronic', 'models', 'for', 'the', 'high', 'energy', 'nonthermal', 'processes', 'in', 'this', 'binary', 'system', 'relativistic', 'electrons', 'and', 'hadrons', 'are', 'assumed', 'to', 'be', 'accelerated', 'in', 'a', 'strongly', 'magnetised', 'turbulent', 'region', 'formed', 'in', 'collision', 'of', 'a', 'rotating', 'white', 'dwarf', 'magnetosphere', 'and', 'a', 'magnetospheredense', 'atmosphere', 'of', 'the', 'm', 'dwarf', 'star', 'we', 'propose', 'that', 'the', 'nonthermal', 'xray', 'emission', 'is', 'produced', 'either', 'by', 'the', 'primary', 'electrons', 'or', 'the', 'secondary', 'epm', 'pairs', 'from', 'decay', 'of', 'charged', 'pions', 'created', 'in', 'collisions', 'of', 'hadrons', 'with', 'the', 'companion', 'star', 'atmosphere', 'we', 'show', 'that', 'the', 'accompanying', 'gammaray', 'emission', 'from', 'decay', 'of', 'neutral', 'pions', 'that', 'are', 'produced', 'by', 'these', 'same', 'protons', 'is', 'expected', 'to', 'be', 'on', 'the', 'detectability', 'level', 'of', 'the', 'present', 'andor', 'the', 'future', 'satellite', 'and', 'cherenkov', 'telescopes', 'the', 'gammaray', 'observations', 'of', 'the', 'binary', 'system', 'ar', 'sco', 'should', 'allow', 'to', 'constrain', 'the', 'efficiency', 'of', 'hadron', 'and', 'electron', 'acceleration', 'and', 'also', 'the', 'details', 'of', 'the', 'radiation', 'processes']] | [-0.07730487137546783, 0.246246918365564, -0.05831346695137384, 0.13278825975110842, -0.06232827818686409, -0.08589262633608746, 0.014955037379647595, 0.37354803223490385, -0.19640131272723552, -0.3118333508296368, -0.014185073088271195, -0.3248063922184264, 0.031934860514241506, 0.18239417553567175, 0.00590417218496281, -0.017294645093248358, 0.14825973835000436, -0.028732328319405257, -0.02257163695105771, -0.19277887755575088, 0.32382266129274945, 0.1510664968198718, 0.11081714366414266, 0.023099826096178413, 0.05360063232461011, -0.05288404379050237, -0.030281786635456668, -0.06107496279854696, -0.0805527130964997, 0.04391068984785726, 0.19249559933880417, 0.11602179421710648, 0.12532201544688706, -0.3947422120024215, -0.25036122199982036, 0.08677015978085635, 0.17000049815748583, -0.0049980105525189705, -0.10652704844519925, -0.2807847095114834, 0.07904645702740878, -0.250434785240821, -0.14711742812337783, 0.06625392653590458, 0.00763529812876176, 0.06949261692973747, -0.2904810372044097, 0.07562885063065211, 0.06495626109964368, 0.006571273756940122, -0.127137620495837, -0.07621301878192513, -0.029986138877735196, 0.01833510318525381, 0.07191314909333404, 0.05436714842821507, 0.1942444515547582, -0.12014678068737919, -0.07394677087163123, 0.4013179651529344, -0.08473746886778787, -0.056763684818429035, 0.25765787056841694, -0.2355924475001642, -0.13398675802214952, 0.22780152180380506, 0.20663884622147205, 0.12591099010903264, -0.19861335027451207, 0.017045214404268854, 0.00013373208815579886, 0.17101263508180176, 0.04806716678725494, 0.04500568584170561, 0.3540488830614057, 0.16005712164985528, -0.026621984031337958, 0.13151528968112441, -0.22824068083704893, -0.007816973494770067, -0.2594571465851514, -0.13129966188053305, -0.14200148166535975, 0.11046921514719213, -0.03793837274765342, -0.11770488173927303, 0.35850701998572404, 0.06613104518728105, 0.18679410545667122, -0.055242384579237344, 0.31772083410440566, 0.10980072586572023, 0.0027389818070722477, 0.16112861984184237, 0.3279788435493074, 0.16612916077732795, 0.14624220943897143, -0.26765014545398425, 0.027889524197594804, 0.023646707380456582] |
1,802.02325 | On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner
Product | In this paper we study the (Bichromatic) Maximum Inner Product Problem
(Max-IP), in which we are given sets $A$ and $B$ of vectors, and the goal is to
find $a \in A$ and $b \in B$ maximizing inner product $a \cdot b$. Max-IP is
very basic and serves as the base problem in the recent breakthrough of [Abboud
et al., FOCS 2017] on hardness of approximation for polynomial-time problems.
It is also used (implicitly) in the argument for hardness of exact
$\ell_2$-Furthest Pair (and other important problems in computational geometry)
in poly-log-log dimensions in [Williams, SODA 2018]. We have three main results
regarding this problem.
First, we study the best multiplicative approximation ratio for Boolean
Max-IP in sub-quadratic time. We show that, for Max-IP with two sets of $n$
vectors from $\{0,1\}^{d}$, there is an $n^{2 - \Omega(1)}$ time $\left( d/\log
n \right)^{\Omega(1)}$-multiplicative-approximating algorithm, and we show this
is conditionally optimal, as such a $\left(d/\log
n\right)^{o(1)}$-approximating algorithm would refute SETH.
Second, we achieve a similar characterization for the best additive
approximation error to Boolean Max-IP. We show that, for Max-IP with two sets
of $n$ vectors from $\{0,1\}^{d}$, there is an $n^{2 - \Omega(1)}$ time
$\Omega(d)$-additive-approximating algorithm, and this is conditionally
optimal, as such an $o(d)$-approximating algorithm would refute SETH
[Rubinstein, STOC 2018].
Last, we revisit the hardness of solving Max-IP exactly for vectors with
integer entries. We show that, under SETH, for Max-IP with sets of $n$ vectors
from $\mathbb{Z}^{d}$ for some $d = 2^{O(\log^{*} n)}$, every exact algorithm
requires $n^{2 - o(1)}$ time. With the reduction from [Williams, SODA 2018], it
follows that $\ell_2$-Furthest Pair and Bichromatic $\ell_2$-Closest Pair in
$2^{O(\log^{*} n)}$ dimensions require $n^{2 - o(1)}$ time.
| cs.CC cs.DS | in this paper we study the bichromatic maximum inner product problem maxip in which we are given sets a and b of vectors and the goal is to find a in a and b in b maximizing inner product a cdot b maxip is very basic and serves as the base problem in the recent breakthrough of abboud et al focs 2017 on hardness of approximation for polynomialtime problems it is also used implicitly in the argument for hardness of exact ell_2furthest pair and other important problems in computational geometry in polyloglog dimensions in williams soda 2018 we have three main results regarding this problem first we study the best multiplicative approximation ratio for boolean maxip in subquadratic time we show that for maxip with two sets of n vectors from 01d there is an n2 omega1 time left dlog n rightomega1multiplicativeapproximating algorithm and we show this is conditionally optimal as such a leftdlog nrighto1approximating algorithm would refute seth second we achieve a similar characterization for the best additive approximation error to boolean maxip we show that for maxip with two sets of n vectors from 01d there is an n2 omega1 time omegadadditiveapproximating algorithm and this is conditionally optimal as such an odapproximating algorithm would refute seth rubinstein stoc 2018 last we revisit the hardness of solving maxip exactly for vectors with integer entries we show that under seth for maxip with sets of n vectors from mathbbzd for some d 2olog n every exact algorithm requires n2 o1 time with the reduction from williams soda 2018 it follows that ell_2furthest pair and bichromatic ell_2closest pair in 2olog n dimensions require n2 o1 time | [['in', 'this', 'paper', 'we', 'study', 'the', 'bichromatic', 'maximum', 'inner', 'product', 'problem', 'maxip', 'in', 'which', 'we', 'are', 'given', 'sets', 'a', 'and', 'b', 'of', 'vectors', 'and', 'the', 'goal', 'is', 'to', 'find', 'a', 'in', 'a', 'and', 'b', 'in', 'b', 'maximizing', 'inner', 'product', 'a', 'cdot', 'b', 'maxip', 'is', 'very', 'basic', 'and', 'serves', 'as', 'the', 'base', 'problem', 'in', 'the', 'recent', 'breakthrough', 'of', 'abboud', 'et', 'al', 'focs', '2017', 'on', 'hardness', 'of', 'approximation', 'for', 'polynomialtime', 'problems', 'it', 'is', 'also', 'used', 'implicitly', 'in', 'the', 'argument', 'for', 'hardness', 'of', 'exact', 'ell_2furthest', 'pair', 'and', 'other', 'important', 'problems', 'in', 'computational', 'geometry', 'in', 'polyloglog', 'dimensions', 'in', 'williams', 'soda', '2018', 'we', 'have', 'three', 'main', 'results', 'regarding', 'this', 'problem', 'first', 'we', 'study', 'the', 'best', 'multiplicative', 'approximation', 'ratio', 'for', 'boolean', 'maxip', 'in', 'subquadratic', 'time', 'we', 'show', 'that', 'for', 'maxip', 'with', 'two', 'sets', 'of', 'n', 'vectors', 'from', '01d', 'there', 'is', 'an', 'n2', 'omega1', 'time', 'left', 'dlog', 'n', 'rightomega1multiplicativeapproximating', 'algorithm', 'and', 'we', 'show', 'this', 'is', 'conditionally', 'optimal', 'as', 'such', 'a', 'leftdlog', 'nrighto1approximating', 'algorithm', 'would', 'refute', 'seth', 'second', 'we', 'achieve', 'a', 'similar', 'characterization', 'for', 'the', 'best', 'additive', 'approximation', 'error', 'to', 'boolean', 'maxip', 'we', 'show', 'that', 'for', 'maxip', 'with', 'two', 'sets', 'of', 'n', 'vectors', 'from', '01d', 'there', 'is', 'an', 'n2', 'omega1', 'time', 'omegadadditiveapproximating', 'algorithm', 'and', 'this', 'is', 'conditionally', 'optimal', 'as', 'such', 'an', 'odapproximating', 'algorithm', 'would', 'refute', 'seth', 'rubinstein', 'stoc', '2018', 'last', 'we', 'revisit', 'the', 'hardness', 'of', 'solving', 'maxip', 'exactly', 'for', 'vectors', 'with', 'integer', 'entries', 'we', 'show', 'that', 'under', 'seth', 'for', 'maxip', 'with', 'sets', 'of', 'n', 'vectors', 'from', 'mathbbzd', 'for', 'some', 'd', '2olog', 'n', 'every', 'exact', 'algorithm', 'requires', 'n2', 'o1', 'time', 'with', 'the', 'reduction', 'from', 'williams', 'soda', '2018', 'it', 'follows', 'that', 'ell_2furthest', 'pair', 'and', 'bichromatic', 'ell_2closest', 'pair', 'in', '2olog', 'n', 'dimensions', 'require', 'n2', 'o1', 'time']] | [-0.13657520104667054, 0.08352758508926207, -0.03258975538379802, 0.032982249027868026, -0.020278470153826174, -0.1556351427156705, 0.0749754271987121, 0.37635170561627723, -0.2551893377851011, -0.32495985144560924, 0.07594307806832919, -0.26977682158295135, -0.18300760649353937, 0.16981294331200114, -0.09736434987324119, 0.0999495286933994, 0.04183635411065505, 0.015468916227894553, -0.024462420543941776, -0.35210039161759593, 0.2543656544599417, 0.022649032953683607, 0.17083690195145568, 0.030704349634099806, 0.079394444329699, 0.03231405309307274, -0.004053509420512962, 0.0034863452382615946, -0.12887191192531688, 0.0671650065507649, 0.2638742583856154, 0.20489647431117708, 0.2798752122269141, -0.40556992835411887, -0.10562468000185372, 0.15116408040087795, 0.1111589121808427, 0.08742812648143057, -0.011088112853589549, -0.19149836216275387, 0.10579224332795593, -0.09405103211477747, -0.07788024497591657, -0.021025018037509606, 0.13118178588564922, -0.019416272439662548, -0.35817633428931767, 0.05782575733610429, 0.13578095835065015, -0.010791403196110261, -0.04814460084377701, -0.1776572965811031, 0.0940302906676513, 0.059807743027820236, -0.005227046941096584, 0.11671329373650755, -0.01318613786711654, -0.061311606997937966, -0.19193991568385996, 0.3409384663080734, -0.07180760747470548, -0.17226756059770448, 0.14471714259631066, -0.11451833815338293, -0.20786403903165615, 0.09912261361960838, 0.15039157747964232, 0.14915483219597894, -0.05134209287300538, 0.17808049236867257, -0.1553578963276515, 0.18675813606280958, 0.1549024195759121, -0.01544100707327103, 0.08824164149689763, 0.13175979267268648, 0.12005499308346335, 0.1530039505084736, -0.009405209979370293, -0.03530340939555282, -0.30420361431699233, -0.16387095472388222, -0.21404533704685236, 0.07428938440964575, -0.12409603216882432, -0.13128455085784532, 0.30669573464252975, 0.1302336538663964, 0.22155799754382519, 0.12463426999861116, 0.24955043958479098, 0.10200613963178774, -0.04315590122383269, 0.1814331732470584, 0.16931641341000883, 0.10201167086294542, 0.03327588626263796, -0.1814532684789463, 0.07165645067675967, 0.13320887090519684] |
1,802.02326 | A Novel Co-design Peta-scale Heterogeneous Cluster for Deep Learning
Training | Large scale deep Convolution Neural Networks (CNNs) increasingly demands the
computing power. It is key for researchers to own a great powerful computing
platform to leverage deep learning (DL) advancing.On the other hand, as the
commonly-used accelerator, the commodity GPUs cards of new generations are more
and more expensive. Consequently, it is of importance to design an affordable
distributed heterogeneous system that provides powerful computational capacity
and develop a well-suited software that efficiently utilizes its computational
capacity. In this paper, we present our co-design distributed system including
a peta-scale GPU cluster, called "Manoa". Based on properties and topology of
Manoa, we first propose job server framework and implement it, named
"MiMatrix". The central node of MiMatrix, referred to as the job server,
undertakes all of controlling, scheduling and monitoring, and I/O tasks without
weight data transfer for AllReduce processing in each iteration. Therefore,
MiMatrix intrinsically solves the bandwidth bottleneck of central node in
parameter server framework that is widely used in distributed DL tasks.
Meanwhile, we also propose a new AllReduce algorithm, GPUDirect RDMA-Aware
AllReduce~(GDRAA), in which both computation and handshake message are O(1) and
the number of synchronization is two in each iteration that is a theoretical
minimum number. Owe to the dedicated co-design distributed system, MiMatrix
efficiently makes use of the Manoa's computational capacity and bandwidth. We
benchmark Manoa Resnet50 and Resenet101 on Imagenet-1K dataset. Some of results
have demonstrated state-of-the-art.
| cs.CV | large scale deep convolution neural networks cnns increasingly demands the computing power it is key for researchers to own a great powerful computing platform to leverage deep learning dl advancingon the other hand as the commonlyused accelerator the commodity gpus cards of new generations are more and more expensive consequently it is of importance to design an affordable distributed heterogeneous system that provides powerful computational capacity and develop a wellsuited software that efficiently utilizes its computational capacity in this paper we present our codesign distributed system including a petascale gpu cluster called manoa based on properties and topology of manoa we first propose job server framework and implement it named mimatrix the central node of mimatrix referred to as the job server undertakes all of controlling scheduling and monitoring and io tasks without weight data transfer for allreduce processing in each iteration therefore mimatrix intrinsically solves the bandwidth bottleneck of central node in parameter server framework that is widely used in distributed dl tasks meanwhile we also propose a new allreduce algorithm gpudirect rdmaaware allreducegdraa in which both computation and handshake message are o1 and the number of synchronization is two in each iteration that is a theoretical minimum number owe to the dedicated codesign distributed system mimatrix efficiently makes use of the manoas computational capacity and bandwidth we benchmark manoa resnet50 and resenet101 on imagenet1k dataset some of results have demonstrated stateoftheart | [['large', 'scale', 'deep', 'convolution', 'neural', 'networks', 'cnns', 'increasingly', 'demands', 'the', 'computing', 'power', 'it', 'is', 'key', 'for', 'researchers', 'to', 'own', 'a', 'great', 'powerful', 'computing', 'platform', 'to', 'leverage', 'deep', 'learning', 'dl', 'advancingon', 'the', 'other', 'hand', 'as', 'the', 'commonlyused', 'accelerator', 'the', 'commodity', 'gpus', 'cards', 'of', 'new', 'generations', 'are', 'more', 'and', 'more', 'expensive', 'consequently', 'it', 'is', 'of', 'importance', 'to', 'design', 'an', 'affordable', 'distributed', 'heterogeneous', 'system', 'that', 'provides', 'powerful', 'computational', 'capacity', 'and', 'develop', 'a', 'wellsuited', 'software', 'that', 'efficiently', 'utilizes', 'its', 'computational', 'capacity', 'in', 'this', 'paper', 'we', 'present', 'our', 'codesign', 'distributed', 'system', 'including', 'a', 'petascale', 'gpu', 'cluster', 'called', 'manoa', 'based', 'on', 'properties', 'and', 'topology', 'of', 'manoa', 'we', 'first', 'propose', 'job', 'server', 'framework', 'and', 'implement', 'it', 'named', 'mimatrix', 'the', 'central', 'node', 'of', 'mimatrix', 'referred', 'to', 'as', 'the', 'job', 'server', 'undertakes', 'all', 'of', 'controlling', 'scheduling', 'and', 'monitoring', 'and', 'io', 'tasks', 'without', 'weight', 'data', 'transfer', 'for', 'allreduce', 'processing', 'in', 'each', 'iteration', 'therefore', 'mimatrix', 'intrinsically', 'solves', 'the', 'bandwidth', 'bottleneck', 'of', 'central', 'node', 'in', 'parameter', 'server', 'framework', 'that', 'is', 'widely', 'used', 'in', 'distributed', 'dl', 'tasks', 'meanwhile', 'we', 'also', 'propose', 'a', 'new', 'allreduce', 'algorithm', 'gpudirect', 'rdmaaware', 'allreducegdraa', 'in', 'which', 'both', 'computation', 'and', 'handshake', 'message', 'are', 'o1', 'and', 'the', 'number', 'of', 'synchronization', 'is', 'two', 'in', 'each', 'iteration', 'that', 'is', 'a', 'theoretical', 'minimum', 'number', 'owe', 'to', 'the', 'dedicated', 'codesign', 'distributed', 'system', 'mimatrix', 'efficiently', 'makes', 'use', 'of', 'the', 'manoas', 'computational', 'capacity', 'and', 'bandwidth', 'we', 'benchmark', 'manoa', 'resnet50', 'and', 'resenet101', 'on', 'imagenet1k', 'dataset', 'some', 'of', 'results', 'have', 'demonstrated', 'stateoftheart']] | [-0.15456247877272403, 0.004855806033064207, -0.05934631965519337, 0.02060301131127505, -0.12371266061356373, -0.24082594832891532, 0.08542147927494768, 0.4101190959917036, -0.29145202909089757, -0.33347981609404087, 0.11526454609600223, -0.2296330423274061, -0.14564426043663142, 0.2210352951599481, -0.11431338617834977, 0.12214971417862423, 0.11146343165289677, 0.025915452741748213, 0.012272321146283821, -0.2715024163067267, 0.2431510754589302, 0.1043428867519731, 0.3311325657424484, 0.04437102671899514, 0.09101214461847312, -0.012876115055150237, -0.013841190819604028, -0.040287359139734975, -0.03693889757363522, 0.1781734399836543, 0.3020713882247117, 0.22336095590001429, 0.3537845072222122, -0.45648931712729107, -0.1609701737638955, 0.07816921751803245, 0.16320778591034468, 0.038296214671981146, -0.06303107620458417, -0.21746428366015225, 0.12033778054255731, -0.23189892653547423, -0.006845408484846223, -0.11989292080040302, -0.0017731208977158786, 0.02625587599029307, -0.2598578893779185, -0.012815081156109125, 0.0013385238687573164, 0.019158237197093274, 0.004377378611886678, -0.11383878423785382, 0.052507494509898195, 0.15149478779251999, -0.024029548339680525, 0.03702694362666654, 0.13911247229317955, -0.13630079815731988, -0.13631046315034231, 0.38403095797484477, 0.005271405511098636, -0.1695653279945091, 0.19407237329409996, -0.0016303171573223121, -0.21259957458619683, 0.0665536890528369, 0.2460784513287332, 0.096417238039226, -0.18392344124680549, 0.05948203403794762, 0.0041525596752762794, 0.18724437790367296, 0.013535844757458554, 0.037860395915789956, 0.14545513524085676, 0.27357685541031523, 0.10027574082497474, 0.16593496562640403, -0.10892615522147696, -0.1265158186107057, -0.18731205158595307, -0.17589487237937487, -0.2213933101509036, -0.027759735453927487, -0.10460779560960139, -0.132082072942387, 0.36964441025057776, 0.20663075495650174, 0.14350655342027413, 0.11753117608513046, 0.38457798042841124, 0.05284025400632935, 0.1502436061663614, 0.2090545687405801, 0.12404400088812588, 0.0400746555886527, 0.17167248500035176, -0.1862308754015861, 0.05306975265289351, 0.013863844130563002] |
1,802.02327 | Discontinuous Galerkin methods for fractional elliptic problems | We provide a mathematical framework for studying different versions of
discontinuous Galerkin (DG) approaches for solving 2D Riemann-Liouville
fractional elliptic problems on a finite domain. The boundedness and stability
analysis of the primal bilinear form are provided. A priori error estimate
under energy norm and optimal error estimate under $L^{2}$ norm are obtained
for DG methods of the different formulations. Finally, the performed numerical
examples confirm the optimal convergence order of the different formulations.
| math.NA | we provide a mathematical framework for studying different versions of discontinuous galerkin dg approaches for solving 2d riemannliouville fractional elliptic problems on a finite domain the boundedness and stability analysis of the primal bilinear form are provided a priori error estimate under energy norm and optimal error estimate under l2 norm are obtained for dg methods of the different formulations finally the performed numerical examples confirm the optimal convergence order of the different formulations | [['we', 'provide', 'a', 'mathematical', 'framework', 'for', 'studying', 'different', 'versions', 'of', 'discontinuous', 'galerkin', 'dg', 'approaches', 'for', 'solving', '2d', 'riemannliouville', 'fractional', 'elliptic', 'problems', 'on', 'a', 'finite', 'domain', 'the', 'boundedness', 'and', 'stability', 'analysis', 'of', 'the', 'primal', 'bilinear', 'form', 'are', 'provided', 'a', 'priori', 'error', 'estimate', 'under', 'energy', 'norm', 'and', 'optimal', 'error', 'estimate', 'under', 'l2', 'norm', 'are', 'obtained', 'for', 'dg', 'methods', 'of', 'the', 'different', 'formulations', 'finally', 'the', 'performed', 'numerical', 'examples', 'confirm', 'the', 'optimal', 'convergence', 'order', 'of', 'the', 'different', 'formulations']] | [-0.08483739873092319, -0.038959556617899925, -0.08933977560042655, 0.12938326073659434, -0.07022883873936292, -0.14598038167743063, 0.004495886657890436, 0.3547457259249043, -0.31658969794374864, -0.24842571039256212, 0.20834204131057737, -0.22889918581632948, -0.0897045766484823, 0.2266415953195679, -0.11128408862340793, 0.156025679039492, 0.10599482903647162, -0.016163226861641993, -0.21009491386546478, -0.23257654705839986, 0.3266470026149339, -0.06084432392506986, 0.2597690416953048, 0.025367175202149695, 0.14323275055534937, -0.09981127750015238, -0.05355210351833218, 0.027776236394168558, -0.19593226578640374, 0.1572269285664063, 0.2580621416202268, 0.03619622244700991, 0.3680627796849286, -0.43490360770374537, -0.2052879772224539, 0.10959149855566588, 0.11070768508314457, 0.04022158478462213, -0.07383980636950582, -0.29099856755016623, 0.13906337766958451, -0.11238201379121558, -0.09957112764587274, -0.13209396056717615, -0.05004090402980108, 0.09184969762793264, -0.40477305011056064, 0.12224149754321254, 0.035456464147648296, 0.07971593691036105, -0.17227493099415223, -0.19622308891455367, 0.0430282863939332, 0.08200383105164243, 0.05834822571911925, -0.041333540198015606, 0.04645328757957228, -0.06268605579169013, -0.13079454331986, 0.34500936912121, -0.027038006551683303, -0.32995843333569735, 0.15585080302647641, -0.05564730862356924, -0.0949652445552921, 0.09617975023197564, 0.19867908194459774, 0.20476897775094854, -0.10497683850494591, 0.10994883471741215, -0.03072918950882111, 0.11733632617806261, 0.05813665759774882, 0.04644448432215565, 0.02621786407276837, 0.14752392381165377, 0.17633042339789304, 0.10570811311638839, -0.0473422656886632, -0.15512396505958326, -0.3933927918708808, -0.14439913608461014, -0.17100077126225507, -0.015810696664580924, -0.18676308320946927, -0.16629043166097757, 0.3932827327847229, 0.11912639066576958, 0.06173597336620898, 0.11537327018969164, 0.2895396069648701, 0.19058955292141921, -0.03804174814738233, 0.09474499454419757, 0.21653301059897687, 0.17991966552831032, 0.10811708525855195, -0.2553169578565536, 0.02708863320672331, 0.26156875128681595] |
1,802.02328 | Reduced basis approximation and a~posteriori error bounds for 4D-Var
data assimilation | We propose a certified reduced basis approach for the strong- and
weak-constraint four-dimensional variational (4D-Var) data assimilation problem
for a parametrized PDE model. While the standard strong-constraint 4D-Var
approach uses the given observational data to estimate only the unknown initial
condition of the model, the weak-constraint 4D-Var formulation additionally
provides an estimate for the model error and thus can deal with imperfect
models. Since the model error is a distributed function in both space and time,
the 4D-Var formulation leads to a large-scale optimization problem for every
given parameter instance of the PDE model. To solve the problem efficiently,
various reduced order approaches have therefore been proposed in the recent
past. Here, we employ the reduced basis method to generate reduced order
approximations for the state, adjoint, initial condition, and model error. Our
main contribution is the development of efficiently computable
\textit{a~posteriori} upper bounds for the error of the reduced basis
approximation with respect to the underlying high-dimensional 4D-Var problem.
Numerical results are conducted to test the validity of our approach.
| math.OC | we propose a certified reduced basis approach for the strong and weakconstraint fourdimensional variational 4dvar data assimilation problem for a parametrized pde model while the standard strongconstraint 4dvar approach uses the given observational data to estimate only the unknown initial condition of the model the weakconstraint 4dvar formulation additionally provides an estimate for the model error and thus can deal with imperfect models since the model error is a distributed function in both space and time the 4dvar formulation leads to a largescale optimization problem for every given parameter instance of the pde model to solve the problem efficiently various reduced order approaches have therefore been proposed in the recent past here we employ the reduced basis method to generate reduced order approximations for the state adjoint initial condition and model error our main contribution is the development of efficiently computable textitaposteriori upper bounds for the error of the reduced basis approximation with respect to the underlying highdimensional 4dvar problem numerical results are conducted to test the validity of our approach | [['we', 'propose', 'a', 'certified', 'reduced', 'basis', 'approach', 'for', 'the', 'strong', 'and', 'weakconstraint', 'fourdimensional', 'variational', '4dvar', 'data', 'assimilation', 'problem', 'for', 'a', 'parametrized', 'pde', 'model', 'while', 'the', 'standard', 'strongconstraint', '4dvar', 'approach', 'uses', 'the', 'given', 'observational', 'data', 'to', 'estimate', 'only', 'the', 'unknown', 'initial', 'condition', 'of', 'the', 'model', 'the', 'weakconstraint', '4dvar', 'formulation', 'additionally', 'provides', 'an', 'estimate', 'for', 'the', 'model', 'error', 'and', 'thus', 'can', 'deal', 'with', 'imperfect', 'models', 'since', 'the', 'model', 'error', 'is', 'a', 'distributed', 'function', 'in', 'both', 'space', 'and', 'time', 'the', '4dvar', 'formulation', 'leads', 'to', 'a', 'largescale', 'optimization', 'problem', 'for', 'every', 'given', 'parameter', 'instance', 'of', 'the', 'pde', 'model', 'to', 'solve', 'the', 'problem', 'efficiently', 'various', 'reduced', 'order', 'approaches', 'have', 'therefore', 'been', 'proposed', 'in', 'the', 'recent', 'past', 'here', 'we', 'employ', 'the', 'reduced', 'basis', 'method', 'to', 'generate', 'reduced', 'order', 'approximations', 'for', 'the', 'state', 'adjoint', 'initial', 'condition', 'and', 'model', 'error', 'our', 'main', 'contribution', 'is', 'the', 'development', 'of', 'efficiently', 'computable', 'textitaposteriori', 'upper', 'bounds', 'for', 'the', 'error', 'of', 'the', 'reduced', 'basis', 'approximation', 'with', 'respect', 'to', 'the', 'underlying', 'highdimensional', '4dvar', 'problem', 'numerical', 'results', 'are', 'conducted', 'to', 'test', 'the', 'validity', 'of', 'our', 'approach']] | [-0.04980200224558784, -0.001249310730583828, -0.08786306381170478, 0.09421292226348271, -0.07677954995244213, -0.13216199653123964, 0.043373069142476385, 0.31837895475107536, -0.2910997850831444, -0.3450526046093427, 0.13833083018809336, -0.21435690993138662, -0.12967515752661818, 0.2056431644045081, -0.07260054733174351, 0.15243265739801895, 0.12458149736510182, 0.01106348477810974, -0.0973227680371468, -0.27542754398113306, 0.28181901906504014, 0.05563714215256406, 0.2912690417084033, 0.008534716793539874, 0.14709290057646673, -0.023917224090794355, -0.0253104186897888, 0.011971717741520877, -0.1206273523368735, 0.16993756758974943, 0.2348142936504792, 0.16403541671382207, 0.3232644861674256, -0.41997402710423354, -0.24038189137078955, 0.11567199483173542, 0.11963608220478619, 0.15548282938998348, -0.012519531569184636, -0.28019347219017043, 0.08361208050982949, -0.17281649579547523, -0.13668902219443985, -0.1025935898496378, -0.03681309842477007, -0.04898731667374828, -0.3723718416188243, 0.09595449313041947, 0.030639268698986376, -0.010981667986774774, -0.1147396728939228, -0.10635829813084041, 0.023031168874937315, 0.08755743602489138, 0.04591265681596506, 0.06643392038035631, 0.0378445317860577, -0.09618852840365909, -0.09955444726707226, 0.37050846601511245, -0.057891790657276676, -0.28435901924967766, 0.13367074124581185, -0.05847963792707264, -0.11397639989092417, 0.11794101368889388, 0.21735042770608112, 0.1168140416645263, -0.14197974787617224, 0.11936690662877314, -0.04330665100167489, 0.17756510210724977, -0.024551781321484487, -0.0265397766671149, 0.07822830999440916, 0.20058684356885373, 0.10326302426966381, 0.12420390685882486, -0.08268811384811116, -0.12667813935157288, -0.30074950207311374, -0.11998456912721403, -0.19063062268755668, -0.0313211562092686, -0.10836991993365974, -0.17153986617743683, 0.3760733013179087, 0.23047778387581544, 0.15582007745876025, 0.09090114511086567, 0.33797121512532763, 0.1685672414033762, 0.007212899384548965, 0.06437834016716978, 0.21030929604043755, 0.1340136256553894, 0.0613356461244244, -0.2191724523436278, 0.09771967335595864, 0.11130051421739999] |
1,802.02329 | Additive Decompositions in Primitive Extensions | This paper extends the classical Ostrogradsky-Hermite reduction for rational
functions to more general functions in primitive extensions of certain types.
For an element $f$ in such an extension $K$, the extended reduction decomposes
$f$ as the sum of a derivative in $K$ and another element $r$ such that $f$ has
an antiderivative in $K$ if and only if $r=0$; and $f$ has an elementary
antiderivative over $K$ if and only if $r$ is a linear combination of
logarithmic derivatives over the constants when $K$ is a logarithmic extension.
Moreover, $r$ is minimal in some sense. Additive decompositions may lead to
reduction-based creative-telescoping methods for nested logarithmic functions,
which are not necessarily $D$-finite.
| cs.SC | this paper extends the classical ostrogradskyhermite reduction for rational functions to more general functions in primitive extensions of certain types for an element f in such an extension k the extended reduction decomposes f as the sum of a derivative in k and another element r such that f has an antiderivative in k if and only if r0 and f has an elementary antiderivative over k if and only if r is a linear combination of logarithmic derivatives over the constants when k is a logarithmic extension moreover r is minimal in some sense additive decompositions may lead to reductionbased creativetelescoping methods for nested logarithmic functions which are not necessarily dfinite | [['this', 'paper', 'extends', 'the', 'classical', 'ostrogradskyhermite', 'reduction', 'for', 'rational', 'functions', 'to', 'more', 'general', 'functions', 'in', 'primitive', 'extensions', 'of', 'certain', 'types', 'for', 'an', 'element', 'f', 'in', 'such', 'an', 'extension', 'k', 'the', 'extended', 'reduction', 'decomposes', 'f', 'as', 'the', 'sum', 'of', 'a', 'derivative', 'in', 'k', 'and', 'another', 'element', 'r', 'such', 'that', 'f', 'has', 'an', 'antiderivative', 'in', 'k', 'if', 'and', 'only', 'if', 'r0', 'and', 'f', 'has', 'an', 'elementary', 'antiderivative', 'over', 'k', 'if', 'and', 'only', 'if', 'r', 'is', 'a', 'linear', 'combination', 'of', 'logarithmic', 'derivatives', 'over', 'the', 'constants', 'when', 'k', 'is', 'a', 'logarithmic', 'extension', 'moreover', 'r', 'is', 'minimal', 'in', 'some', 'sense', 'additive', 'decompositions', 'may', 'lead', 'to', 'reductionbased', 'creativetelescoping', 'methods', 'for', 'nested', 'logarithmic', 'functions', 'which', 'are', 'not', 'necessarily', 'dfinite']] | [-0.14700067063571293, 0.07066749534622596, -0.09524507146984847, 0.01733592168893665, -0.08177900751206008, -0.15746635221029548, 0.0017662679869152437, 0.3381746987261894, -0.3509051858701489, -0.18542402506890623, 0.09321276181038808, -0.2835376471535049, -0.13904004857335664, 0.20259811007311906, -0.06833062781317328, -0.016901739877225323, -0.026271330870010635, 0.1253666003658013, -0.10499447953929616, -0.3033469029278918, 0.2830775746991011, -0.02224509524266151, 0.13863366120071574, 0.056458654576404525, 0.09530029717663473, 0.02303245992992412, -0.004208750972016291, 0.021656924520026554, -0.13287835201831927, 0.0861434828151356, 0.29562952759760347, 0.11064770520156757, 0.31511204458286307, -0.3346519905142486, -0.20189146301285787, 0.20015426339920273, 0.1507117815442722, -0.007475914510855959, 0.015367139895335474, -0.14081876894713125, 0.16664861539294096, -0.17444533624008976, -0.1273526264015924, -0.09444642092355272, 0.1328876301910813, 0.011591678790070795, -0.34922684946266763, 0.015823937063528734, 0.13477151112376967, 0.09644835943525487, -0.012642536697570574, -0.16278246115702627, -0.0013225285590372303, 0.027197412739306773, 0.0023938838074999778, 0.08519496446030891, 0.04905747884291817, -0.10092000478497622, -0.07409584028752182, 0.3532485891556875, -0.14512376858514142, -0.26513013667003676, 0.1566237035038119, -0.1473023143596947, -0.1170289348154752, 0.13888198571279314, 0.08150518432428891, 0.15551052219657735, -0.10129821462072539, 0.23052089512983168, -0.10491133075715466, 0.1737242700934241, 0.10687242984687063, 0.009734942643924362, 0.11788344739682295, 0.03164140750357712, 0.14794232927008785, 0.11071726293633798, 0.028473067198964683, -0.03654082196087322, -0.38795758203010666, -0.18816779458112168, -0.1545053790111772, 0.0792423654941641, -0.10851515076408924, -0.20518081745302136, 0.3506290455772118, 0.028293747791956942, 0.186492029403929, 0.08860515983542427, 0.2416635457299311, 0.15320562805705282, 0.09640742785889994, 0.0961458789057691, 0.10911547203722875, 0.1384016523523976, -0.039014620805921205, -0.13494964592920786, 0.06645298180678351, 0.11242281217551367] |
1,802.0233 | Two Dimensional Plane, Modified Symplectic Structure and Quantization | Noncommutative quantum mechanics on the plane has been widely studied in the
literature. Here, we consider the problem using Isham's canonical group
quantization scheme for which the primary object is the symmetry group that
underlies the phase space. The noncommutativity of the configuration space
coordinates requires us to introduce the noncommutative term in the symplectic
structure of the system. This modified symplectic structure will modify the
group acting on the configuration space from abelian $\mathbb{R}^2$ to a
nonabelian one. As a result, the canonical group obtained is a deformed
Heisenberg group and the canonical commutation relation (CCR) corresponds to
what is usually found in noncommutative quantum mechanics.
| math-ph math.MP | noncommutative quantum mechanics on the plane has been widely studied in the literature here we consider the problem using ishams canonical group quantization scheme for which the primary object is the symmetry group that underlies the phase space the noncommutativity of the configuration space coordinates requires us to introduce the noncommutative term in the symplectic structure of the system this modified symplectic structure will modify the group acting on the configuration space from abelian mathbbr2 to a nonabelian one as a result the canonical group obtained is a deformed heisenberg group and the canonical commutation relation ccr corresponds to what is usually found in noncommutative quantum mechanics | [['noncommutative', 'quantum', 'mechanics', 'on', 'the', 'plane', 'has', 'been', 'widely', 'studied', 'in', 'the', 'literature', 'here', 'we', 'consider', 'the', 'problem', 'using', 'ishams', 'canonical', 'group', 'quantization', 'scheme', 'for', 'which', 'the', 'primary', 'object', 'is', 'the', 'symmetry', 'group', 'that', 'underlies', 'the', 'phase', 'space', 'the', 'noncommutativity', 'of', 'the', 'configuration', 'space', 'coordinates', 'requires', 'us', 'to', 'introduce', 'the', 'noncommutative', 'term', 'in', 'the', 'symplectic', 'structure', 'of', 'the', 'system', 'this', 'modified', 'symplectic', 'structure', 'will', 'modify', 'the', 'group', 'acting', 'on', 'the', 'configuration', 'space', 'from', 'abelian', 'mathbbr2', 'to', 'a', 'nonabelian', 'one', 'as', 'a', 'result', 'the', 'canonical', 'group', 'obtained', 'is', 'a', 'deformed', 'heisenberg', 'group', 'and', 'the', 'canonical', 'commutation', 'relation', 'ccr', 'corresponds', 'to', 'what', 'is', 'usually', 'found', 'in', 'noncommutative', 'quantum', 'mechanics']] | [-0.14450001048150463, 0.12998619182992763, -0.1315837028418955, 0.0900746984701064, -0.13716120539215682, -0.08758552036047956, -0.01911409558275732, 0.33102819175572595, -0.30505067278047865, -0.2451557477514007, 0.053167997492764525, -0.2150688518239098, -0.16958809560425928, 0.1616147585979132, -0.12036179561846863, 0.006107611777522018, 0.0011626828655548324, 0.12315455925320144, -0.1717793845487802, -0.21476779094566462, 0.40053968336085016, 0.0546229687262605, 0.2957914162287924, -0.07355446753605643, 0.1452136967661921, 0.05282631360438313, 0.003493410404597487, -0.005901605788146137, -0.122059460311911, 0.08986574136021017, 0.21491609730270353, 0.037751717995591114, 0.18229928079156954, -0.3878490323044151, -0.21966787002911078, 0.1260985802667581, 0.11771933331424109, 0.08721474206584254, -0.006641766189153645, -0.3069485393222247, 0.01640167278517799, -0.19761989105527647, -0.14215290647600648, -0.05739805234648357, 0.021026353882712737, -0.08299095680171223, -0.1708182450307742, 0.016866762208465103, 0.06928486536283081, 0.05071725464582652, -0.0367174294872958, -0.042779277008087764, -0.015895755926721565, 0.1124888142771044, -0.017777937028130568, 0.08579153650022486, 0.13351795090488636, -0.06157319772788367, -0.12171591208185827, 0.46838586269138016, -0.006172127488600177, -0.27686193992087843, 0.09622208183962051, -0.1545072044202379, -0.18980653459972172, 0.0691813913252309, 0.0881651912284928, 0.11173081797521527, -0.08072817048044857, 0.21553536327762493, -0.10765302567264047, 0.13107933184984966, 0.029823130196848204, 0.017860188292530933, 0.1511579087965852, 0.10099479442061944, 0.0718994980556107, 0.13891798891910465, -0.041646265215893215, -0.20180140070564975, -0.33290246059404355, -0.19750829577167459, -0.162180915243149, 0.10234337476317153, -0.07200199635642272, -0.15068613193824748, 0.3642064774982241, 0.08392434311752146, 0.15206947028647813, -0.013051113032161424, 0.2270372831654326, 0.11055828172987693, 0.09198241481975278, 0.0005612588584396953, 0.2364185250877777, 0.20559675995016766, 0.04026033892078656, -0.22584420078973694, -0.05199621588200609, 0.19466969957488162] |
1,802.02331 | Post-Newtonian light propagation in Kerr-Newman spacetime | The second-order post-Newtonian solution for the light propagation in the
field of Kerr-Newman black hole is achieved via an iterative method. Based on
this result, we further obtain the second-order post-Newtonian light deflection
in Kerr-Newman spacetime, which is formulated in an united form for any
arbitrarily incident directions. All results are exhibited in the coordinate
system constituted by the initial light-direction vector, the impact vector,
and their cross-product.
| gr-qc | the secondorder postnewtonian solution for the light propagation in the field of kerrnewman black hole is achieved via an iterative method based on this result we further obtain the secondorder postnewtonian light deflection in kerrnewman spacetime which is formulated in an united form for any arbitrarily incident directions all results are exhibited in the coordinate system constituted by the initial lightdirection vector the impact vector and their crossproduct | [['the', 'secondorder', 'postnewtonian', 'solution', 'for', 'the', 'light', 'propagation', 'in', 'the', 'field', 'of', 'kerrnewman', 'black', 'hole', 'is', 'achieved', 'via', 'an', 'iterative', 'method', 'based', 'on', 'this', 'result', 'we', 'further', 'obtain', 'the', 'secondorder', 'postnewtonian', 'light', 'deflection', 'in', 'kerrnewman', 'spacetime', 'which', 'is', 'formulated', 'in', 'an', 'united', 'form', 'for', 'any', 'arbitrarily', 'incident', 'directions', 'all', 'results', 'are', 'exhibited', 'in', 'the', 'coordinate', 'system', 'constituted', 'by', 'the', 'initial', 'lightdirection', 'vector', 'the', 'impact', 'vector', 'and', 'their', 'crossproduct']] | [-0.1849407440941058, 0.09477691064326357, -0.07774067700687629, 0.013403679030502576, -0.0649117028076591, -0.09721771291276413, -0.03426139299938483, 0.3393897837055708, -0.21514509793426564, -0.269206426175895, 0.04727500565211052, -0.26358234482025034, -0.13822293178692682, 0.2311026616849061, -0.02244224626685618, 0.08288402643416133, 0.01886557413390212, 0.05775613961532823, -0.08943692405722034, -0.2678827767941489, 0.35255085790891255, 0.05236132053741768, 0.24639542785876278, 0.005753565579652786, 0.13036785537460402, 0.08967053129532333, 0.0351937553887047, 0.008824109002502996, -0.06964316387285492, 0.09385435102479671, 0.2089636315827939, 0.15391343116496148, 0.20723745268561058, -0.4001572511867801, -0.2051223020361208, 0.03884891121050538, 0.14282291477768502, 0.17130252093931578, -0.09277762096799187, -0.32945110704471814, 0.05901486785220566, -0.17192048892212003, -0.1940922572889101, -0.06385324192024878, -0.0015375171353651294, 0.010811609077031043, -0.25433969184923083, 0.04983635894509394, 0.0918710661996434, -0.009463191129712027, -0.12246705008559484, -0.07403288553503634, -0.008503219710468357, 0.06927754743886527, 0.11935264783313693, 0.08053755160393332, 0.08920280470116648, -0.10084496673592713, -0.10603560494787212, 0.3877111264685197, -0.09565373986556347, -0.2839054984054459, 0.059390362200966634, -0.18519972339263813, -0.04971217207694009, 0.13329701929061272, 0.20704498130188725, 0.22412797355496172, -0.17347011004866503, 0.1139636210768845, 0.014473820285899426, 0.14428035194860467, 0.13941640082274132, 0.021388652247946654, 0.2692567048066143, 0.08228180301028179, 0.04403775480033746, 0.14174925320809567, -0.07030629815964667, -0.09541315697967562, -0.3312777694064512, -0.1408933053321358, -0.1621941242405255, 0.041559243887496086, -0.17547384679379158, -0.1581771300633007, 0.37751856969961367, 0.11053879018316963, 0.15297277677637428, -0.001259708024714309, 0.2845457330790918, 0.15142594387671396, -0.03195157817064492, 0.14371590301005252, 0.37831173826064635, 0.12503083689666505, 0.11128471547793319, -0.2160964823508663, 0.01825528072693677, 0.13715158185379497] |
1,802.02332 | Star-formation rate in compact star-forming galaxies | We use the data for the Hbeta emission-line, far-ultraviolet (FUV) and
mid-infrared 22 micron continuum luminosities to estimate star formation rates
<SFR> averaged over the galaxy lifetime for a sample of about 14000 bursting
compact star-forming galaxies (CSFGs) selected from the Data Release 12 (DR12)
of the Sloan Digital Sky Survey (SDSS). The average coefficient linking <SFR>
and the star formation rate SFR_0 derived from the Hbeta luminosity at zero
starburst age is found to be 0.04. We compare <SFR>s with some commonly used
SFRs which are derived adopting a continuous star formation during a period of
~100 Myr, and find that the latter ones are 2-3 times higher. It is shown that
the relations between SFRs derived using a geometric mean of two star-formation
indicators in the UV and IR ranges and reduced to zero starburst age have
considerably lower dispersion compared to those with single star-formation
indicators. We suggest that our relations for <SFR> determination are more
appropriate for CSFGs because they take into account a proper temporal
evolution of their luminosities. On the other hand, we show that commonly used
SFR relations can be applied for approximate estimation within a factor of ~2
of the <SFR> averaged over the lifetime of the bursting compact galaxy.
| astro-ph.GA | we use the data for the hbeta emissionline farultraviolet fuv and midinfrared 22 micron continuum luminosities to estimate star formation rates sfr averaged over the galaxy lifetime for a sample of about 14000 bursting compact starforming galaxies csfgs selected from the data release 12 dr12 of the sloan digital sky survey sdss the average coefficient linking sfr and the star formation rate sfr_0 derived from the hbeta luminosity at zero starburst age is found to be 004 we compare sfrs with some commonly used sfrs which are derived adopting a continuous star formation during a period of 100 myr and find that the latter ones are 23 times higher it is shown that the relations between sfrs derived using a geometric mean of two starformation indicators in the uv and ir ranges and reduced to zero starburst age have considerably lower dispersion compared to those with single starformation indicators we suggest that our relations for sfr determination are more appropriate for csfgs because they take into account a proper temporal evolution of their luminosities on the other hand we show that commonly used sfr relations can be applied for approximate estimation within a factor of 2 of the sfr averaged over the lifetime of the bursting compact galaxy | [['we', 'use', 'the', 'data', 'for', 'the', 'hbeta', 'emissionline', 'farultraviolet', 'fuv', 'and', 'midinfrared', '22', 'micron', 'continuum', 'luminosities', 'to', 'estimate', 'star', 'formation', 'rates', 'sfr', 'averaged', 'over', 'the', 'galaxy', 'lifetime', 'for', 'a', 'sample', 'of', 'about', '14000', 'bursting', 'compact', 'starforming', 'galaxies', 'csfgs', 'selected', 'from', 'the', 'data', 'release', '12', 'dr12', 'of', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'the', 'average', 'coefficient', 'linking', 'sfr', 'and', 'the', 'star', 'formation', 'rate', 'sfr_0', 'derived', 'from', 'the', 'hbeta', 'luminosity', 'at', 'zero', 'starburst', 'age', 'is', 'found', 'to', 'be', '004', 'we', 'compare', 'sfrs', 'with', 'some', 'commonly', 'used', 'sfrs', 'which', 'are', 'derived', 'adopting', 'a', 'continuous', 'star', 'formation', 'during', 'a', 'period', 'of', '100', 'myr', 'and', 'find', 'that', 'the', 'latter', 'ones', 'are', '23', 'times', 'higher', 'it', 'is', 'shown', 'that', 'the', 'relations', 'between', 'sfrs', 'derived', 'using', 'a', 'geometric', 'mean', 'of', 'two', 'starformation', 'indicators', 'in', 'the', 'uv', 'and', 'ir', 'ranges', 'and', 'reduced', 'to', 'zero', 'starburst', 'age', 'have', 'considerably', 'lower', 'dispersion', 'compared', 'to', 'those', 'with', 'single', 'starformation', 'indicators', 'we', 'suggest', 'that', 'our', 'relations', 'for', 'sfr', 'determination', 'are', 'more', 'appropriate', 'for', 'csfgs', 'because', 'they', 'take', 'into', 'account', 'a', 'proper', 'temporal', 'evolution', 'of', 'their', 'luminosities', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'commonly', 'used', 'sfr', 'relations', 'can', 'be', 'applied', 'for', 'approximate', 'estimation', 'within', 'a', 'factor', 'of', '2', 'of', 'the', 'sfr', 'averaged', 'over', 'the', 'lifetime', 'of', 'the', 'bursting', 'compact', 'galaxy']] | [0.005387886270997677, 0.07367862659564989, -0.058328148917911424, 0.16521273764662425, -0.06881502137973833, -0.04183201413097733, 0.05744838546331666, 0.5085053817877447, -0.13149933670737426, -0.3165304993553726, 0.07662787180616641, -0.28782271596396136, 0.012833811701241664, 0.2567896821225683, -0.0471499366775731, -0.055854988799560905, 0.023043695407591148, -0.0659224819616923, -0.08119560347460571, -0.3332138152878534, 0.28948150825313324, 0.0258976839143099, 0.23367030579812717, -0.044010961026595546, 0.05946466207823711, -0.12694801781596482, -0.13897530875207545, -0.034090938812553664, -0.2253100674579444, 0.06263471136526497, 0.26949926796324264, 0.14889447241211715, 0.2211251440592974, -0.31619579887566923, -0.20447875181626943, 0.07662291508162358, 0.200496023574817, 0.026033491712257013, -0.04431141142100422, -0.2416986059633664, 0.06755144793651593, -0.22184626925691675, -0.08856641862469451, 0.08715935890531339, 0.07456434183924994, 0.06604195230219802, -0.2544751588096572, 0.2059119715578044, -0.03242654074208388, 0.12216304757987748, -0.1438312375544602, -0.08492335758131483, -0.12224501661015989, 0.12559462356232648, -0.01216809873374692, 0.0933839904660683, 0.2226827629259225, -0.1454160700570162, -0.008811410858435332, 0.3677949094065074, -0.09127148929623446, 0.008078951091654058, 0.20945773815515717, -0.2006580204554442, -0.14693727942210608, 0.14079097173444405, 0.14379688937066276, 0.09617459267413847, -0.1976024606175145, -0.052540284240953535, 0.020523056535951226, 0.2535367418926407, 0.039094730572784, 0.10413426096713652, 0.2790575241242594, 0.07916380313409556, 0.058203492906385504, 0.06698800084335226, -0.2183202794485316, -0.05529994102406365, -0.23516764449729508, -0.057873717984994466, -0.10743561348369444, 0.14525978463917863, -0.17937221309665877, -0.06416603898928176, 0.32875483723330323, 0.11310766534885427, 0.24095272075425347, 0.1606350382739354, 0.265916472894774, 0.12925983775589292, 0.16644122447361012, 0.10807171938400986, 0.2884212147770956, 0.1759778910950906, 0.0594945927347385, -0.2424116332366824, 0.06744690800022676, 0.035900043423741985] |
1,802.02333 | Perturbative matching of continuum and lattice quasi-distributions | Matching of the quasi parton distribution functions between continuum and
lattice is addressed using lattice perturbation theory specifically with
Wilson-type fermions. The matching is done for nonlocal quark bilinear
operators with a straight Wilson line in a spatial direction. We also
investigate operator mixing in the renormalization and possible O(a) operators
for the nonlocal operators based on a symmetry argument on lattice.
| hep-lat hep-ph nucl-th | matching of the quasi parton distribution functions between continuum and lattice is addressed using lattice perturbation theory specifically with wilsontype fermions the matching is done for nonlocal quark bilinear operators with a straight wilson line in a spatial direction we also investigate operator mixing in the renormalization and possible oa operators for the nonlocal operators based on a symmetry argument on lattice | [['matching', 'of', 'the', 'quasi', 'parton', 'distribution', 'functions', 'between', 'continuum', 'and', 'lattice', 'is', 'addressed', 'using', 'lattice', 'perturbation', 'theory', 'specifically', 'with', 'wilsontype', 'fermions', 'the', 'matching', 'is', 'done', 'for', 'nonlocal', 'quark', 'bilinear', 'operators', 'with', 'a', 'straight', 'wilson', 'line', 'in', 'a', 'spatial', 'direction', 'we', 'also', 'investigate', 'operator', 'mixing', 'in', 'the', 'renormalization', 'and', 'possible', 'oa', 'operators', 'for', 'the', 'nonlocal', 'operators', 'based', 'on', 'a', 'symmetry', 'argument', 'on', 'lattice']] | [-0.1253759839737247, 0.18627532068339567, -0.09535212745709766, 0.10379131272390124, -0.06632336113046133, -0.12684113843246334, 0.07879117597457802, 0.4504604194193117, -0.19428765434291093, -0.16705819234372146, 0.07654414218174474, -0.30942135829959183, -0.08815918460247978, 0.055174197881452496, 0.037082363085280505, 0.13511114033228236, 0.032806729041640795, -0.011323809693191921, -0.15418129669776517, -0.1769925643719973, 0.41713429687755005, -0.005344985676328501, 0.2764551671852748, 0.15311953152770236, 0.05852935400851551, 0.06396619909473004, -0.08982686888456586, -0.01834095709566628, -0.07125093310981268, 0.13594277308326244, 0.10996408943714003, -0.02449564732077922, 0.15919636337146645, -0.43560140177367196, -0.2029181728402393, 0.05450665992834876, 0.13845491273358704, 0.10700660986044715, -0.009767338321844657, -0.2818955562768444, 0.01604908937588334, -0.15749286355510836, -0.1744462082823438, -0.08873244242802743, -0.03255221438068416, -0.05082248295507123, -0.35459335381165147, 0.08892311964272297, -0.027069139977796905, 0.11309825495306042, 0.016538331253198726, -0.11205349207645462, -0.028604427450186303, 0.05077412823635724, 0.02829374490876592, 0.06900848373920927, 0.04336878144550287, -0.12936927810792, -0.1700666059698579, 0.4243164616937359, -0.12333163442353028, -0.2665747633624461, 0.09600352583407995, -0.14758537181337633, -0.1451209932791009, 0.010933848832440075, 0.1479301122618058, 0.13315026175921724, -0.17336825844681553, 0.14950120448502863, -0.12295497409368475, 0.15352936210711637, 0.08832507750259773, 0.03114115335272565, 0.17062537409102305, 0.1186554892506871, 0.10894947152044024, 0.09443708352984921, 0.01909254828558093, -0.16153930072886719, -0.34988781416247927, -0.07230084021425535, -0.18109247525553068, 0.033872084722163215, -0.12238434404688663, -0.21719602810879868, 0.42549189675839677, 0.11603780363446041, 0.20138228463099128, 0.025868597815954877, 0.2270799241659622, 0.18321135559029156, 0.1374134794703775, 0.054934569228921204, 0.17668399391245218, 0.1819466336089517, 0.09612581996066917, -0.2729551929740175, -0.08257727315574284, 0.24670052765718392] |
1,802.02334 | Strong Lensing of a Regular Black Hole with an Electrodynamics Source | In this paper we have investigated the gravitational lensing phenomenon in
the strong field regime for a regular, charged, static, non-linear black hole
having a electrodynamics source. We have obtained the angle of deflection and
compared it to a Schwarzschild black hole and Reissner Nordstrom black hole
with similar properties. We have also done a graphical study of the
relativistic image positions and magnifications. We hope that this method may
be useful in the detection of non-luminous bodies like this current black hole.
| gr-qc | in this paper we have investigated the gravitational lensing phenomenon in the strong field regime for a regular charged static nonlinear black hole having a electrodynamics source we have obtained the angle of deflection and compared it to a schwarzschild black hole and reissner nordstrom black hole with similar properties we have also done a graphical study of the relativistic image positions and magnifications we hope that this method may be useful in the detection of nonluminous bodies like this current black hole | [['in', 'this', 'paper', 'we', 'have', 'investigated', 'the', 'gravitational', 'lensing', 'phenomenon', 'in', 'the', 'strong', 'field', 'regime', 'for', 'a', 'regular', 'charged', 'static', 'nonlinear', 'black', 'hole', 'having', 'a', 'electrodynamics', 'source', 'we', 'have', 'obtained', 'the', 'angle', 'of', 'deflection', 'and', 'compared', 'it', 'to', 'a', 'schwarzschild', 'black', 'hole', 'and', 'reissner', 'nordstrom', 'black', 'hole', 'with', 'similar', 'properties', 'we', 'have', 'also', 'done', 'a', 'graphical', 'study', 'of', 'the', 'relativistic', 'image', 'positions', 'and', 'magnifications', 'we', 'hope', 'that', 'this', 'method', 'may', 'be', 'useful', 'in', 'the', 'detection', 'of', 'nonluminous', 'bodies', 'like', 'this', 'current', 'black', 'hole']] | [-0.13678238844689744, 0.025527671663965804, -0.09942958399748811, 0.14472961271916662, -0.0770649354545826, -0.1402679354356355, -0.017844933627947538, 0.3614837284906801, -0.15012903062133007, -0.304708374955927, 0.06226901936832905, -0.3156434775116932, -0.13395216108961816, 0.22624960355460644, -0.06211141395348921, 0.05262606505708522, 0.022822085184505188, 0.02522597886083356, -0.11151273101175496, -0.19694789156530906, 0.36553803462176077, 0.10853052904432449, 0.19725509216806975, -0.007295379106583725, 0.08322584567344692, 0.025334802860147262, 0.031320310279121064, 0.15977620037205248, -0.16058045229918383, 0.06171426458104727, 0.1952985798917621, 0.11605779653280435, 0.20586141226925406, -0.3872233208672828, -0.23992103985679078, 0.062350312360079894, 0.14402267909103847, 0.20842385933599827, -0.19529978006079524, -0.3141055548541158, 0.08788319623254869, -0.25352013982125526, -0.14678037350615822, -0.011545731509328786, 0.0574095970404009, -0.005000405100522092, -0.18649904829371405, 0.12638716226554453, 0.09275703037828095, -0.07173725657434349, -0.09517163910106363, -0.029609835240989923, 0.016555652056024016, 0.0985137844480664, 0.1272604806146708, 0.0593708244373977, 0.16640997276338468, -0.12066741587021892, -0.09527898739170597, 0.37440870818962535, -0.07228638411005847, -0.1995929144776962, 0.16898253757551493, -0.2783932749361518, -0.13737020395129515, 0.09775048318313412, 0.21207633666716605, 0.2393595350103969, -0.1704387118680829, 0.08865536045050249, -0.03639025475650308, 0.15070902069200234, 0.15532958004848066, 0.07912454970674701, 0.4108001083270254, 0.11092380395563073, -0.018790329719545792, 0.17388462111303382, -0.12301782835050519, -0.004245338927819787, -0.24680175146379743, -0.13814153145393496, -0.13069374195905964, 0.10040009006049978, -0.1485980685391107, -0.18692468336824727, 0.33434744934966587, 0.1520055525456499, 0.14488749035230153, -0.006939027716506676, 0.25953382958310195, 0.07994115498640675, 0.020465791107615434, 0.09155017469661782, 0.4130513164024037, 0.11039022466515651, 0.16714110826450704, -0.22004193612318262, -0.056605166750006285, 0.06605796622538782] |
1,802.02335 | Catalysis by metallic nanoparticles in solution: Thermosensitive
microgels as nanoreactors | Metallic nanoparticles have been used as catalysts for various reactions, and
the huge literature on the subject is hard to overlook. In many applications,
the nanoparticles must be affixed to a colloidal carrier for easy handling
during catalysis. These "passive carriers" (e.g., dendrimers) serve for a
controlled synthesis of the nanoparticles and prevent coagulation during
catalysis. Recently, hybrids from nanoparticles and polymers have been
developed that allow us to change the catalytic activity of the nanoparticles
by external triggers. In particular, single nanoparticles embedded in a
thermosensitive network made from poly(N-isopropylacrylamide) (PNIPAM) have
become the most-studied examples of such hybrids: Immersed in cold water, the
PNIPAM network is hydrophilic and fully swollen. In this state, hydrophilic
substrates can diffuse easily through the network, and react at the surface of
the nanoparticles. Above the volume transition located at 32{\deg}C, the
network becomes hydrophobic and shrinks. Now hydrophobic substrates will
preferably diffuse through the network and react with other substrates in the
reaction catalyzed by the enclosed nanoparticle. Such "active carriers", may
thus be viewed as true nanoreactors that open new ways for the use of
nanoparticles in catalysis.
| physics.chem-ph cond-mat.mtrl-sci | metallic nanoparticles have been used as catalysts for various reactions and the huge literature on the subject is hard to overlook in many applications the nanoparticles must be affixed to a colloidal carrier for easy handling during catalysis these passive carriers eg dendrimers serve for a controlled synthesis of the nanoparticles and prevent coagulation during catalysis recently hybrids from nanoparticles and polymers have been developed that allow us to change the catalytic activity of the nanoparticles by external triggers in particular single nanoparticles embedded in a thermosensitive network made from polynisopropylacrylamide pnipam have become the moststudied examples of such hybrids immersed in cold water the pnipam network is hydrophilic and fully swollen in this state hydrophilic substrates can diffuse easily through the network and react at the surface of the nanoparticles above the volume transition located at 32degc the network becomes hydrophobic and shrinks now hydrophobic substrates will preferably diffuse through the network and react with other substrates in the reaction catalyzed by the enclosed nanoparticle such active carriers may thus be viewed as true nanoreactors that open new ways for the use of nanoparticles in catalysis | [['metallic', 'nanoparticles', 'have', 'been', 'used', 'as', 'catalysts', 'for', 'various', 'reactions', 'and', 'the', 'huge', 'literature', 'on', 'the', 'subject', 'is', 'hard', 'to', 'overlook', 'in', 'many', 'applications', 'the', 'nanoparticles', 'must', 'be', 'affixed', 'to', 'a', 'colloidal', 'carrier', 'for', 'easy', 'handling', 'during', 'catalysis', 'these', 'passive', 'carriers', 'eg', 'dendrimers', 'serve', 'for', 'a', 'controlled', 'synthesis', 'of', 'the', 'nanoparticles', 'and', 'prevent', 'coagulation', 'during', 'catalysis', 'recently', 'hybrids', 'from', 'nanoparticles', 'and', 'polymers', 'have', 'been', 'developed', 'that', 'allow', 'us', 'to', 'change', 'the', 'catalytic', 'activity', 'of', 'the', 'nanoparticles', 'by', 'external', 'triggers', 'in', 'particular', 'single', 'nanoparticles', 'embedded', 'in', 'a', 'thermosensitive', 'network', 'made', 'from', 'polynisopropylacrylamide', 'pnipam', 'have', 'become', 'the', 'moststudied', 'examples', 'of', 'such', 'hybrids', 'immersed', 'in', 'cold', 'water', 'the', 'pnipam', 'network', 'is', 'hydrophilic', 'and', 'fully', 'swollen', 'in', 'this', 'state', 'hydrophilic', 'substrates', 'can', 'diffuse', 'easily', 'through', 'the', 'network', 'and', 'react', 'at', 'the', 'surface', 'of', 'the', 'nanoparticles', 'above', 'the', 'volume', 'transition', 'located', 'at', '32degc', 'the', 'network', 'becomes', 'hydrophobic', 'and', 'shrinks', 'now', 'hydrophobic', 'substrates', 'will', 'preferably', 'diffuse', 'through', 'the', 'network', 'and', 'react', 'with', 'other', 'substrates', 'in', 'the', 'reaction', 'catalyzed', 'by', 'the', 'enclosed', 'nanoparticle', 'such', 'active', 'carriers', 'may', 'thus', 'be', 'viewed', 'as', 'true', 'nanoreactors', 'that', 'open', 'new', 'ways', 'for', 'the', 'use', 'of', 'nanoparticles', 'in', 'catalysis']] | [-0.0435670166306438, 0.2238263372815044, -0.0392317904163495, 0.002111263811633351, -0.009789885521205443, -0.16800361269614308, 0.050749463319618215, 0.45594344917003826, -0.23501801562385374, -0.30148361305836385, 0.074743433793511, -0.29852086272571354, -0.14212043075672082, 0.15754907130375154, -0.033848344263250146, 0.04238910383848575, 0.0017355890341869166, -0.047166738875700984, 0.04704129802794146, -0.17053001558440062, 0.23832004179837563, 0.04684590560043611, 0.2715527760941455, 0.14766001653036362, 0.02758891240353145, -0.024601260828535244, 0.09740270833705142, 0.028890983065745484, -0.11390862333932854, 0.11097800379408704, 0.2932587157013596, -0.020254067547108616, 0.2191037746329081, -0.5664837054647905, -0.28454075664562245, 0.08499257094714971, 0.16963885777893725, 0.12228322020726859, -0.1261202796138272, -0.2851960232020706, 0.07325560438086189, -0.1420991684908488, -0.10833374475834952, -0.05755076925420473, 0.0033475031377747655, 0.05823429137147883, -0.21169407047852074, 0.02772407177385063, 0.023722338582819667, 0.04869699857187688, -0.07431943892245932, -0.11668956213660779, -0.06118702382332475, 0.16459363096353588, 0.048999030140518984, 0.005008559394408749, 0.3179114902372001, -0.1194843798462722, -0.03602618464113524, 0.37377670136911256, -0.01639850339877309, -0.15915608287899083, 0.26659987802286783, -0.08441651495040885, -0.10368899690396946, 0.2190854566657455, 0.19570472059390878, 0.14631243494995844, -0.2040950506975654, 0.031870329703432156, 0.021221932769823138, 0.19098611785567074, 0.12303176103222374, -0.010224429181694323, 0.26096368712242896, 0.24725406311367268, 0.01830663161711537, 0.18391735221744987, -0.08381282287194164, -0.06191648201521246, -0.1324455775420672, -0.23729704256151973, -0.18823881128111913, 0.027054089246698283, -0.08103738673807745, -0.19628061214211567, 0.2860968813759535, 0.060263074229105866, 0.1509387519070378, -0.032347926098893406, 0.21976057310859043, -0.030571520885562784, 0.14190751332188806, -0.0017716917259398327, 0.26210606764371114, 0.12663747421816313, 0.16183510692339512, -0.19633964249133182, 0.15279052252831157, -0.01884199825981732] |
1,802.02336 | A Schematic Definition of Quantum Polynomial Time Computability | In the past four decades, the notion of quantum polynomial-time computability
has been mathematically modeled by quantum Turing machines as well as quantum
circuits. This paper seeks the third model, which is a quantum analogue of the
schematic (inductive or constructive) definition of (primitive) recursive
functions. For quantum functions mapping finite-dimensional Hilbert spaces to
themselves, we present such a schematic definition, composed of a small set of
initial quantum functions and a few construction rules that dictate how to
build a new quantum function from the existing ones. We prove that our
schematic definition precisely characterizes all functions that can be
computable with high success probabilities on well-formed quantum Turing
machines in polynomial time, or equivalently uniform families of
polynomial-size quantum circuits. Our new, schematic definition is quite simple
and intuitive and, more importantly, it avoids the cumbersome introduction of
the well-formedness condition imposed on a quantum Turing machine model as well
as of the uniformity condition necessary for a quantum circuit model. Our new
approach can further open a door to the descriptional complexity of quantum
functions, to the theory of higher-type quantum functionals, to the development
of new first-order theories for quantum computing, and to the designing of
programming languages for real-life quantum computers.
| cs.CC math.LO quant-ph | in the past four decades the notion of quantum polynomialtime computability has been mathematically modeled by quantum turing machines as well as quantum circuits this paper seeks the third model which is a quantum analogue of the schematic inductive or constructive definition of primitive recursive functions for quantum functions mapping finitedimensional hilbert spaces to themselves we present such a schematic definition composed of a small set of initial quantum functions and a few construction rules that dictate how to build a new quantum function from the existing ones we prove that our schematic definition precisely characterizes all functions that can be computable with high success probabilities on wellformed quantum turing machines in polynomial time or equivalently uniform families of polynomialsize quantum circuits our new schematic definition is quite simple and intuitive and more importantly it avoids the cumbersome introduction of the wellformedness condition imposed on a quantum turing machine model as well as of the uniformity condition necessary for a quantum circuit model our new approach can further open a door to the descriptional complexity of quantum functions to the theory of highertype quantum functionals to the development of new firstorder theories for quantum computing and to the designing of programming languages for reallife quantum computers | [['in', 'the', 'past', 'four', 'decades', 'the', 'notion', 'of', 'quantum', 'polynomialtime', 'computability', 'has', 'been', 'mathematically', 'modeled', 'by', 'quantum', 'turing', 'machines', 'as', 'well', 'as', 'quantum', 'circuits', 'this', 'paper', 'seeks', 'the', 'third', 'model', 'which', 'is', 'a', 'quantum', 'analogue', 'of', 'the', 'schematic', 'inductive', 'or', 'constructive', 'definition', 'of', 'primitive', 'recursive', 'functions', 'for', 'quantum', 'functions', 'mapping', 'finitedimensional', 'hilbert', 'spaces', 'to', 'themselves', 'we', 'present', 'such', 'a', 'schematic', 'definition', 'composed', 'of', 'a', 'small', 'set', 'of', 'initial', 'quantum', 'functions', 'and', 'a', 'few', 'construction', 'rules', 'that', 'dictate', 'how', 'to', 'build', 'a', 'new', 'quantum', 'function', 'from', 'the', 'existing', 'ones', 'we', 'prove', 'that', 'our', 'schematic', 'definition', 'precisely', 'characterizes', 'all', 'functions', 'that', 'can', 'be', 'computable', 'with', 'high', 'success', 'probabilities', 'on', 'wellformed', 'quantum', 'turing', 'machines', 'in', 'polynomial', 'time', 'or', 'equivalently', 'uniform', 'families', 'of', 'polynomialsize', 'quantum', 'circuits', 'our', 'new', 'schematic', 'definition', 'is', 'quite', 'simple', 'and', 'intuitive', 'and', 'more', 'importantly', 'it', 'avoids', 'the', 'cumbersome', 'introduction', 'of', 'the', 'wellformedness', 'condition', 'imposed', 'on', 'a', 'quantum', 'turing', 'machine', 'model', 'as', 'well', 'as', 'of', 'the', 'uniformity', 'condition', 'necessary', 'for', 'a', 'quantum', 'circuit', 'model', 'our', 'new', 'approach', 'can', 'further', 'open', 'a', 'door', 'to', 'the', 'descriptional', 'complexity', 'of', 'quantum', 'functions', 'to', 'the', 'theory', 'of', 'highertype', 'quantum', 'functionals', 'to', 'the', 'development', 'of', 'new', 'firstorder', 'theories', 'for', 'quantum', 'computing', 'and', 'to', 'the', 'designing', 'of', 'programming', 'languages', 'for', 'reallife', 'quantum', 'computers']] | [-0.10748663658075017, 0.14487400435327183, -0.11013832614413525, 0.10596009574037099, -0.1018678552801133, -0.18677756736434778, 0.07395481887314179, 0.3076536530641233, -0.31141920936366235, -0.2676504356865726, 0.048105250936661605, -0.19249793918954788, -0.197661522557751, 0.25796063275876663, -0.09016679991172283, 0.14856883963497663, 0.02559662287268173, 0.023750063607206984, -0.07220219693020058, -0.272486908822456, 0.3202734057796052, 0.0018616263484537096, 0.2571384233549165, 0.05643152641934949, 0.11473035076587886, -0.00400477930003759, 0.041196890826364164, 0.02750267002288505, -0.11820585947893916, 0.14125135553733997, 0.287834242723195, 0.21124064561106193, 0.3020312027102653, -0.4507496251534779, -0.1730729079593676, 0.09466705384248307, 0.10535701278606159, 0.1467920065539871, -0.004325443457541377, -0.27822782032788523, 0.08674031193255112, -0.18031680857642887, -0.11103336144582306, -0.13759464162483231, 0.008824090306642602, -0.015896852758884864, -0.2139546532608858, -0.007648268901037722, 0.12467933019953192, 0.10465901142474517, 0.003705921994710965, -0.07175106321262575, 0.07856777520484101, 0.08897368448732186, -0.10521529129767357, 0.03384569112564102, 0.11289443015753861, -0.1355724140416234, -0.2234942393187542, 0.36623644166472324, -0.008359118617643846, -0.22824310379111867, 0.20546122593805194, -0.05832683662228395, -0.15327972332490336, 0.04325501958713008, 0.14277268592177808, 0.10475540527784565, -0.12960200486433449, 0.12561262987703264, -0.052356060505030874, 0.15949824381138208, 0.05867526867399806, 0.08459815945339534, 0.18025689392612831, 0.1389171607629622, 0.056517364666345125, 0.16874941414870884, 0.04355059577450518, -0.19471207118533254, -0.3542658435768511, -0.1966070429750015, -0.18353395931958447, 0.0899377481252389, -0.07104216858002049, -0.25727927730841454, 0.39084211463398, 0.12345470315595926, 0.14249252386007444, 0.1314390547425504, 0.30451010516618643, 0.13525382740525088, 0.0889992697457715, 0.04210237299150887, 0.15209257582799324, 0.14718650790718069, 0.062498832245818474, -0.15479410743652797, 0.08518412815337974, 0.10747729976055692] |
1,802.02337 | Double-passage ground-state cooling induced by quantum interference in
the hybrid optomechanical system | We propose a quantum interference cooling scheme for a nano-mechanical
resonator (NAMR) in a hybrid optomechanical system, where the atoms are trapped
in an optomechanical cavity, coupling to an additional optical cavity. The
absorption of the optomechanical resonator can be modified by quantum
interference effects induced by the atom-cavity and cavity-cavity couplings
independently. With the employment of the quantum interference, the desired
transition for cooling is enhanced, along with the heating suppression due to
the undesired transition. As a result, the NAMR vibration can be cooled down to
its ground state. Particularly, with the assistance of the atoms, our scheme is
experimentally feasible even for lower qualities cavities, which much reduces
the experimental difficulty.
| quant-ph | we propose a quantum interference cooling scheme for a nanomechanical resonator namr in a hybrid optomechanical system where the atoms are trapped in an optomechanical cavity coupling to an additional optical cavity the absorption of the optomechanical resonator can be modified by quantum interference effects induced by the atomcavity and cavitycavity couplings independently with the employment of the quantum interference the desired transition for cooling is enhanced along with the heating suppression due to the undesired transition as a result the namr vibration can be cooled down to its ground state particularly with the assistance of the atoms our scheme is experimentally feasible even for lower qualities cavities which much reduces the experimental difficulty | [['we', 'propose', 'a', 'quantum', 'interference', 'cooling', 'scheme', 'for', 'a', 'nanomechanical', 'resonator', 'namr', 'in', 'a', 'hybrid', 'optomechanical', 'system', 'where', 'the', 'atoms', 'are', 'trapped', 'in', 'an', 'optomechanical', 'cavity', 'coupling', 'to', 'an', 'additional', 'optical', 'cavity', 'the', 'absorption', 'of', 'the', 'optomechanical', 'resonator', 'can', 'be', 'modified', 'by', 'quantum', 'interference', 'effects', 'induced', 'by', 'the', 'atomcavity', 'and', 'cavitycavity', 'couplings', 'independently', 'with', 'the', 'employment', 'of', 'the', 'quantum', 'interference', 'the', 'desired', 'transition', 'for', 'cooling', 'is', 'enhanced', 'along', 'with', 'the', 'heating', 'suppression', 'due', 'to', 'the', 'undesired', 'transition', 'as', 'a', 'result', 'the', 'namr', 'vibration', 'can', 'be', 'cooled', 'down', 'to', 'its', 'ground', 'state', 'particularly', 'with', 'the', 'assistance', 'of', 'the', 'atoms', 'our', 'scheme', 'is', 'experimentally', 'feasible', 'even', 'for', 'lower', 'qualities', 'cavities', 'which', 'much', 'reduces', 'the', 'experimental', 'difficulty']] | [-0.174208998659691, 0.26083427457278796, -0.02075936822955938, -0.04773030215501581, -0.02919226297863612, -0.23107793896557077, 0.08545541121591732, 0.38624699470145923, -0.260289457185488, -0.28495070411774676, 0.016009659810694295, -0.2728543860813309, -0.08011099763761945, 0.2142622225280655, -0.02054944588994738, 0.07154642811745585, 0.04881068937104653, -0.00579958437868443, 0.011179851602942666, -0.1735081030719652, 0.2663444710870911, 0.0821600379024044, 0.3136855170984442, 0.06563431473873686, 0.0917769398319682, -0.06157766428039299, 0.1572479011262195, -0.040267571864094125, -0.0811072312634471, 0.08010706278952982, 0.24518176502744227, -0.002505403984207333, 0.2743752534591119, -0.4438678143513307, -0.20448019386579594, 0.07482548069061809, 0.1779842398317302, 0.2230896288886454, -0.04461091155545753, -0.3374179331749155, -0.02491156275694569, -0.16727451010394775, -0.10323049117843702, -0.06169959144634113, -0.07487042531730574, -0.015798150671016947, -0.3093848201903727, 0.02889065279854102, 0.05783399715488613, 0.025740178048676045, -0.007732188967342505, 0.01058563494568756, 0.02094782118710052, 0.06937242675025788, -0.07874051511712503, 0.014051238234203896, 0.21146730266576796, -0.13056831662298032, -0.09774933710874043, 0.39677588532172275, -0.09814819987565115, -0.14643555202341654, 0.16394471687575182, -0.09951274670464427, -0.0010951510834785406, 0.1666728970676399, 0.13689782033396655, 0.03664715829673744, -0.12620290888375357, 0.012810311222493877, 0.04272339468527781, 0.1956454141784394, 0.07891211288229547, 0.1602356276529016, 0.2007193911918684, 0.16867529246711024, 0.062810124318818, 0.22933206919441818, -0.07127978187054396, -0.06862321593635307, -0.26154058429069427, -0.14683671289056197, -0.20214618009253682, 0.051674902030642615, -0.07566661315777629, -0.10740572663448882, 0.3558362842143157, 0.14161529740841503, 0.1455618506705944, -0.058763774633693526, 0.3752453559274344, 0.17345184032609196, 0.09430900178727154, -0.01213042030066023, 0.3666533841189863, 0.16892283211315148, 0.0481601927731709, -0.40824164870897667, 0.015138958094706922, -0.037483758862914614] |
1,802.02338 | LBT/MODS spectroscopy of globular clusters in the irregular galaxy NGC
4449 | We present intermediate-resolution (R$\sim$1000) spectra in the
$\sim$3500-10,000 A range of 14 globular clusters in the magellanic irregular
galaxy NGC 4449 acquired with the Multi Object Double Spectrograph on the Large
Binocular Telescope. We derived Lick indices in the optical and the
CaII-triplet index in the near-infrared in order to infer the clusters' stellar
population properties. The inferred cluster ages are typically older than
$\sim$9 Gyr, although ages are derived with large uncertainties. The clusters
exhibit intermediate metallicities, in the range
$-1.2\lesssim$[Fe/H]$\lesssim-0.7$, and typically sub-solar [$\alpha/Fe$]
ratios, with a peak at $\sim-0.4$. These properties suggest that i) during the
first few Gyrs NGC 4449 formed stars slowly and inefficiently, with galactic
winds having possibly contributed to the expulsion of the $\alpha$-elements,
and ii) globular clusters in NGC 4449 formed relatively "late", from a medium
already enriched in the products of type Ia supernovae. The majority of
clusters appear also under-abundant in CN compared to Milky Way halo globular
clusters, perhaps because of the lack of a conspicuous N-enriched,
second-generation of stars like that observed in Galactic globular clusters.
Using the cluster velocities, we infer the dynamical mass of NGC 4449 inside
2.88 kpc to be M($<$2.88 kpc)=$3.15^{+3.16}_{-0.75} \times 10^9~M_\odot$. We
also report the serendipitous discovery of a planetary nebula within one of the
targeted clusters, a rather rare event.
| astro-ph.GA | we present intermediateresolution rsim1000 spectra in the sim350010000 a range of 14 globular clusters in the magellanic irregular galaxy ngc 4449 acquired with the multi object double spectrograph on the large binocular telescope we derived lick indices in the optical and the caiitriplet index in the nearinfrared in order to infer the clusters stellar population properties the inferred cluster ages are typically older than sim9 gyr although ages are derived with large uncertainties the clusters exhibit intermediate metallicities in the range 12lesssimfehlesssim07 and typically subsolar alphafe ratios with a peak at sim04 these properties suggest that i during the first few gyrs ngc 4449 formed stars slowly and inefficiently with galactic winds having possibly contributed to the expulsion of the alphaelements and ii globular clusters in ngc 4449 formed relatively late from a medium already enriched in the products of type ia supernovae the majority of clusters appear also underabundant in cn compared to milky way halo globular clusters perhaps because of the lack of a conspicuous nenriched secondgeneration of stars like that observed in galactic globular clusters using the cluster velocities we infer the dynamical mass of ngc 4449 inside 288 kpc to be m288 kpc315316_075 times 109m_odot we also report the serendipitous discovery of a planetary nebula within one of the targeted clusters a rather rare event | [['we', 'present', 'intermediateresolution', 'rsim1000', 'spectra', 'in', 'the', 'sim350010000', 'a', 'range', 'of', '14', 'globular', 'clusters', 'in', 'the', 'magellanic', 'irregular', 'galaxy', 'ngc', '4449', 'acquired', 'with', 'the', 'multi', 'object', 'double', 'spectrograph', 'on', 'the', 'large', 'binocular', 'telescope', 'we', 'derived', 'lick', 'indices', 'in', 'the', 'optical', 'and', 'the', 'caiitriplet', 'index', 'in', 'the', 'nearinfrared', 'in', 'order', 'to', 'infer', 'the', 'clusters', 'stellar', 'population', 'properties', 'the', 'inferred', 'cluster', 'ages', 'are', 'typically', 'older', 'than', 'sim9', 'gyr', 'although', 'ages', 'are', 'derived', 'with', 'large', 'uncertainties', 'the', 'clusters', 'exhibit', 'intermediate', 'metallicities', 'in', 'the', 'range', '12lesssimfehlesssim07', 'and', 'typically', 'subsolar', 'alphafe', 'ratios', 'with', 'a', 'peak', 'at', 'sim04', 'these', 'properties', 'suggest', 'that', 'i', 'during', 'the', 'first', 'few', 'gyrs', 'ngc', '4449', 'formed', 'stars', 'slowly', 'and', 'inefficiently', 'with', 'galactic', 'winds', 'having', 'possibly', 'contributed', 'to', 'the', 'expulsion', 'of', 'the', 'alphaelements', 'and', 'ii', 'globular', 'clusters', 'in', 'ngc', '4449', 'formed', 'relatively', 'late', 'from', 'a', 'medium', 'already', 'enriched', 'in', 'the', 'products', 'of', 'type', 'ia', 'supernovae', 'the', 'majority', 'of', 'clusters', 'appear', 'also', 'underabundant', 'in', 'cn', 'compared', 'to', 'milky', 'way', 'halo', 'globular', 'clusters', 'perhaps', 'because', 'of', 'the', 'lack', 'of', 'a', 'conspicuous', 'nenriched', 'secondgeneration', 'of', 'stars', 'like', 'that', 'observed', 'in', 'galactic', 'globular', 'clusters', 'using', 'the', 'cluster', 'velocities', 'we', 'infer', 'the', 'dynamical', 'mass', 'of', 'ngc', '4449', 'inside', '288', 'kpc', 'to', 'be', 'm288', 'kpc315316_075', 'times', '109m_odot', 'we', 'also', 'report', 'the', 'serendipitous', 'discovery', 'of', 'a', 'planetary', 'nebula', 'within', 'one', 'of', 'the', 'targeted', 'clusters', 'a', 'rather', 'rare', 'event']] | [-0.044223232645139166, 0.10449125628864847, -0.07878652373503701, 0.10336122097843217, -0.0976533268648309, -0.02244427189189381, 0.06774881040839208, 0.45117746982636026, -0.15021875093607975, -0.3934198676503565, 0.006294293943921021, -0.28357706285418477, 0.0036867318211446904, 0.20148344430389284, -0.05253064179875119, -0.118006720556331, 0.13831587548546947, -0.07429568307745345, -0.03232318545257708, -0.3189824085568948, 0.2762758457063623, 0.036616758911262655, 0.10521436415660794, -0.13060249175281732, 0.03462593249338264, -0.14771950190904345, -0.05396759122973002, -0.039870718245923586, -0.14281276525841302, 0.05553215884979587, 0.24932717547113592, 0.1281570118993448, 0.22104308540832268, -0.3508368866789229, -0.1743579821124402, 0.06169524179513844, 0.2884539217740612, 0.02078278208773981, -0.13009945483180857, -0.3049525858204759, 0.09235906705534645, -0.2143540379630638, -0.22373753492917184, 0.16983048841160472, 0.0637970756686909, 0.06497986989637985, -0.17123326638392652, 0.19526851655447533, -0.045775700144785644, 0.13735006674752515, -0.1576464475638631, -0.15867488135850416, -0.03530089695830808, 0.06959326333309493, -0.024331687862149707, 0.027904153156570844, 0.18222018887678013, -0.13035606182652565, 0.04296092902410758, 0.42030763724259157, -0.05315756836356519, 0.11649827561625432, 0.2666687534454152, -0.24266893675790208, -0.2571983890358726, 0.09249501897485603, 0.1522911220888428, 0.14381086927436362, -0.2064953832908975, 0.015111274076101015, -0.006620210467536055, 0.22981377271279482, 0.06504576348157451, 0.07836045504706429, 0.30212486603083044, 0.0995342937350588, 0.012537727584983682, 0.06531689185026089, -0.27326973716229935, -0.06038829956221189, -0.15686497469722324, -0.06735382123933362, -0.07104053736135293, 0.08309072139782245, -0.19295659291797357, -0.15386456133963916, 0.29322330642845745, 0.06180991578143213, 0.24982965878809982, 0.02340582651993426, 0.2603175517853717, 0.02372212828893407, 0.18726475523268812, 0.13262706095169127, 0.31947142100879844, 0.2102665973678581, 0.09448121499025346, -0.23281972916652513, 0.10451371220958161, -0.010234772828910412] |
1,802.02339 | Improved Oracle Complexity of Variance Reduced Methods for Nonsmooth
Convex Stochastic Composition Optimization | We consider the nonsmooth convex composition optimization problem where the
objective is a composition of two finite-sum functions and analyze stochastic
compositional variance reduced gradient (SCVRG) methods for them. SCVRG and its
variants have recently drawn much attention given their edge over stochastic
compositional gradient descent (SCGD); but the theoretical analysis exclusively
assumes strong convexity of the objective, which excludes several important
examples such as Lasso, logistic regression, principle component analysis and
deep neural nets. In contrast, we prove non-asymptotic incremental first-order
oracle (IFO) complexity of SCVRG or its novel variants for nonsmooth convex
composition optimization and show that they are provably faster than SCGD and
gradient descent. More specifically, our method achieves the total IFO
complexity of $O\left((m+n)\log\left(1/\epsilon\right)+1/\epsilon^3\right)$
which improves that of $O\left(1/\epsilon^{3.5}\right)$ and
$O\left((m+n)/\sqrt{\epsilon}\right)$ obtained by SCGD and accelerated gradient
descent (AGD) respectively. Experimental results confirm that our methods
outperform several existing methods, e.g., SCGD and AGD, on sparse
mean-variance optimization problem.
| math.OC cs.LG | we consider the nonsmooth convex composition optimization problem where the objective is a composition of two finitesum functions and analyze stochastic compositional variance reduced gradient scvrg methods for them scvrg and its variants have recently drawn much attention given their edge over stochastic compositional gradient descent scgd but the theoretical analysis exclusively assumes strong convexity of the objective which excludes several important examples such as lasso logistic regression principle component analysis and deep neural nets in contrast we prove nonasymptotic incremental firstorder oracle ifo complexity of scvrg or its novel variants for nonsmooth convex composition optimization and show that they are provably faster than scgd and gradient descent more specifically our method achieves the total ifo complexity of oleftmnlogleft1epsilonright1epsilon3right which improves that of oleft1epsilon35right and oleftmnsqrtepsilonright obtained by scgd and accelerated gradient descent agd respectively experimental results confirm that our methods outperform several existing methods eg scgd and agd on sparse meanvariance optimization problem | [['we', 'consider', 'the', 'nonsmooth', 'convex', 'composition', 'optimization', 'problem', 'where', 'the', 'objective', 'is', 'a', 'composition', 'of', 'two', 'finitesum', 'functions', 'and', 'analyze', 'stochastic', 'compositional', 'variance', 'reduced', 'gradient', 'scvrg', 'methods', 'for', 'them', 'scvrg', 'and', 'its', 'variants', 'have', 'recently', 'drawn', 'much', 'attention', 'given', 'their', 'edge', 'over', 'stochastic', 'compositional', 'gradient', 'descent', 'scgd', 'but', 'the', 'theoretical', 'analysis', 'exclusively', 'assumes', 'strong', 'convexity', 'of', 'the', 'objective', 'which', 'excludes', 'several', 'important', 'examples', 'such', 'as', 'lasso', 'logistic', 'regression', 'principle', 'component', 'analysis', 'and', 'deep', 'neural', 'nets', 'in', 'contrast', 'we', 'prove', 'nonasymptotic', 'incremental', 'firstorder', 'oracle', 'ifo', 'complexity', 'of', 'scvrg', 'or', 'its', 'novel', 'variants', 'for', 'nonsmooth', 'convex', 'composition', 'optimization', 'and', 'show', 'that', 'they', 'are', 'provably', 'faster', 'than', 'scgd', 'and', 'gradient', 'descent', 'more', 'specifically', 'our', 'method', 'achieves', 'the', 'total', 'ifo', 'complexity', 'of', 'oleftmnlogleft1epsilonright1epsilon3right', 'which', 'improves', 'that', 'of', 'oleft1epsilon35right', 'and', 'oleftmnsqrtepsilonright', 'obtained', 'by', 'scgd', 'and', 'accelerated', 'gradient', 'descent', 'agd', 'respectively', 'experimental', 'results', 'confirm', 'that', 'our', 'methods', 'outperform', 'several', 'existing', 'methods', 'eg', 'scgd', 'and', 'agd', 'on', 'sparse', 'meanvariance', 'optimization', 'problem']] | [-0.033709710233363735, -0.0407582680426464, -0.09817955801448483, 0.11734898298106076, -0.10460490211906122, -0.18475647071154405, 0.03420729937250819, 0.44827318615866024, -0.35167114806071614, -0.26409858608593706, 0.13723265012920471, -0.24369793775065846, -0.20318003852130068, 0.2066747974527272, -0.14012378103728867, 0.12978375600018718, 0.0945168635530385, -0.016746944428301287, -0.1239498319182952, -0.3238357106371727, 0.23732182305824284, 0.014185421845516412, 0.2701350033043464, -0.019993676329093265, 0.1457352828441052, 0.010892917738228246, -0.010338441542787662, 0.07363796083639, -0.05889768843030802, 0.18520300665605097, 0.2574580872110677, 0.2204502992631115, 0.3928352225362169, -0.4073695226492274, -0.23035431643624155, 0.13631744059542847, 0.13328254316300878, 0.05200513321382074, -0.06545944096004384, -0.2429351902980086, 0.08283107344289341, -0.10677522424892183, 0.003104308968570256, -0.1450462294372403, -0.09079951624377243, 0.08089372005609684, -0.31100841508006416, 0.09139197951935182, 0.13259168572736202, 0.05380051206205262, -0.06434023859895248, -0.2412697625228332, 0.01710870578601364, -0.01309606792954173, 0.09126418132091324, 0.059127720430592036, 0.14668949284657853, -0.0849632185206144, -0.14555876154918224, 0.299549073529806, -0.07516567136628619, -0.18882096199849188, 0.20307806614678067, -0.0010511996779615515, -0.17555426458044854, 0.11264396052181548, 0.22583407210494508, 0.19836443569973752, -0.13629338221427129, 0.08564181527159861, -0.04479460781810201, 0.11849411596414565, 0.03649733617704436, -0.021446988739023936, 0.04729310189534151, 0.16080964321504956, 0.2000939432170785, 0.150098956131842, -0.04920860357749868, -0.16661196621597454, -0.2233064824604238, -0.10531630386314694, -0.1676223831427043, -0.054830754806429446, -0.1712150153301545, -0.19197350086039858, 0.359157812883399, 0.15153652747833965, 0.18126505880696786, 0.1909353156051358, 0.3339586008389462, 0.08229251861933076, 0.04903130810430261, 0.14641264443970378, 0.2200831560763401, 0.1370375542886037, 0.08789677215109437, -0.24233286301389534, 0.14161185301309884, 0.12393760737278406] |
1,802.0234 | Natural Orbital-Based Lanczos Method for Anderson Impurity Models | We implement the Lanczos algorithm on natural orbital basis to solve the
zero-temperature Green's function of Anderson impurity models, following the
work of Y. Lu, M. H\"{o}ppner, O. Gunnarsson, and M. W. Haverkort, Phys. Rev. B
{\bf 90} (2014) 085102. We present the technical details, generalize the
algorithm to the cases of particle-hole asymmetry, with local magnetic field,
and of two impurities. The results are benchmarked with conventional Lanczos,
quantum Monte Carlo, and numerical renormalization group methods, demonstrating
its potential as a powerful impurity solver for the dynamical mean-field
theory.
| cond-mat.str-el | we implement the lanczos algorithm on natural orbital basis to solve the zerotemperature greens function of anderson impurity models following the work of y lu m hoppner o gunnarsson and m w haverkort phys rev b bf 90 2014 085102 we present the technical details generalize the algorithm to the cases of particlehole asymmetry with local magnetic field and of two impurities the results are benchmarked with conventional lanczos quantum monte carlo and numerical renormalization group methods demonstrating its potential as a powerful impurity solver for the dynamical meanfield theory | [['we', 'implement', 'the', 'lanczos', 'algorithm', 'on', 'natural', 'orbital', 'basis', 'to', 'solve', 'the', 'zerotemperature', 'greens', 'function', 'of', 'anderson', 'impurity', 'models', 'following', 'the', 'work', 'of', 'y', 'lu', 'm', 'hoppner', 'o', 'gunnarsson', 'and', 'm', 'w', 'haverkort', 'phys', 'rev', 'b', 'bf', '90', '2014', '085102', 'we', 'present', 'the', 'technical', 'details', 'generalize', 'the', 'algorithm', 'to', 'the', 'cases', 'of', 'particlehole', 'asymmetry', 'with', 'local', 'magnetic', 'field', 'and', 'of', 'two', 'impurities', 'the', 'results', 'are', 'benchmarked', 'with', 'conventional', 'lanczos', 'quantum', 'monte', 'carlo', 'and', 'numerical', 'renormalization', 'group', 'methods', 'demonstrating', 'its', 'potential', 'as', 'a', 'powerful', 'impurity', 'solver', 'for', 'the', 'dynamical', 'meanfield', 'theory']] | [-0.11263975176144014, 0.07219101151639826, -0.06780511385687951, 0.0376227133216734, -0.03283088641722551, -0.18178788493871376, 0.09456767455617154, 0.36815861172011394, -0.2079958665195141, -0.30169657936968497, -0.005882289836162262, -0.2791489100481352, -0.1447878581879849, 0.15215202870391561, 0.013475434875555253, 0.0665860644828141, 0.03335016781694434, -0.05796707917548967, -0.15257123380041357, -0.3017994440840871, 0.21744759375585265, 0.07350532268566404, 0.2208097833182579, 0.03810555408342501, 0.03915219645675146, 0.07360644251359312, -0.0049850097543486715, -0.010780996228215904, -0.15265510461863466, 0.03084540730237626, 0.199278702375257, 0.02972660196442785, 0.2511109256007698, -0.4230694294582759, -0.16002720933449402, 0.0123694051852387, 0.11557435725712259, 0.15331249384293227, -0.04258677032723855, -0.3407427884083702, 0.04706722712719792, -0.19441007851005604, -0.13351801978790442, -0.14606750787895048, 0.04724411850172524, 0.018708878575728633, -0.2998099318820606, 0.11761068532327085, 0.03168989422703633, 0.05725317087359308, -0.005776928608263895, -0.1736403327184112, -0.029215322067082095, -0.017147389151616378, 0.0008834039130551594, 0.1018975061191811, 0.1394266312525953, -0.03708140612736847, -0.14429287472478208, 0.3390935417055414, -0.06585849784288472, -0.1558840941203486, 0.21527618123741632, -0.10274816567622376, -0.12894707003587416, 0.0856078186803602, 0.11161570754059161, 0.17120878172912793, -0.13267165722764945, 0.2183130791527219, -0.0744685695671445, 0.10154810544689384, -0.016342290059736607, -0.019000478591142077, 0.10683186633219377, 0.1080086041932528, 0.0012941456732099479, 0.07339473094090065, -0.10263925626235648, -0.1267889366181714, -0.26540415840788506, -0.15719655982815148, -0.2273338114753826, 0.05828538048865922, -0.04589135860033422, -0.1854985802901354, 0.4011725147328015, 0.21238741212723294, 0.15759845390874014, 0.014986568203802859, 0.25000668752394367, 0.12075681169124927, -0.030201254500170353, 0.13376834847326025, 0.15695159711738985, 0.23764429575491572, 0.07746628714264946, -0.32299085572529374, -0.04821219100104122, 0.16812066459770608] |
1,802.02341 | Outlier Detection for Robust Multi-dimensional Scaling | Multi-dimensional scaling (MDS) plays a central role in data-exploration,
dimensionality reduction and visualization. State-of-the-art MDS algorithms are
not robust to outliers, yielding significant errors in the embedding even when
only a handful of outliers are present. In this paper, we introduce a technique
to detect and filter outliers based on geometric reasoning. We test the
validity of triangles formed by three points, and mark a triangle as broken if
its triangle inequality does not hold. The premise of our work is that unlike
inliers, outlier distances tend to break many triangles. Our method is tested
and its performance is evaluated on various datasets and distributions of
outliers. We demonstrate that for a reasonable amount of outliers, e.g., under
$20\%$, our method is effective, and leads to a high embedding quality.
| cs.CV | multidimensional scaling mds plays a central role in dataexploration dimensionality reduction and visualization stateoftheart mds algorithms are not robust to outliers yielding significant errors in the embedding even when only a handful of outliers are present in this paper we introduce a technique to detect and filter outliers based on geometric reasoning we test the validity of triangles formed by three points and mark a triangle as broken if its triangle inequality does not hold the premise of our work is that unlike inliers outlier distances tend to break many triangles our method is tested and its performance is evaluated on various datasets and distributions of outliers we demonstrate that for a reasonable amount of outliers eg under 20 our method is effective and leads to a high embedding quality | [['multidimensional', 'scaling', 'mds', 'plays', 'a', 'central', 'role', 'in', 'dataexploration', 'dimensionality', 'reduction', 'and', 'visualization', 'stateoftheart', 'mds', 'algorithms', 'are', 'not', 'robust', 'to', 'outliers', 'yielding', 'significant', 'errors', 'in', 'the', 'embedding', 'even', 'when', 'only', 'a', 'handful', 'of', 'outliers', 'are', 'present', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'technique', 'to', 'detect', 'and', 'filter', 'outliers', 'based', 'on', 'geometric', 'reasoning', 'we', 'test', 'the', 'validity', 'of', 'triangles', 'formed', 'by', 'three', 'points', 'and', 'mark', 'a', 'triangle', 'as', 'broken', 'if', 'its', 'triangle', 'inequality', 'does', 'not', 'hold', 'the', 'premise', 'of', 'our', 'work', 'is', 'that', 'unlike', 'inliers', 'outlier', 'distances', 'tend', 'to', 'break', 'many', 'triangles', 'our', 'method', 'is', 'tested', 'and', 'its', 'performance', 'is', 'evaluated', 'on', 'various', 'datasets', 'and', 'distributions', 'of', 'outliers', 'we', 'demonstrate', 'that', 'for', 'a', 'reasonable', 'amount', 'of', 'outliers', 'eg', 'under', '20', 'our', 'method', 'is', 'effective', 'and', 'leads', 'to', 'a', 'high', 'embedding', 'quality']] | [-0.09819262145856908, 0.006466376710711985, -0.10584444657343534, 0.10661250077704214, -0.07264661121492584, -0.16749858772093357, 0.07800759181611297, 0.4092676332220435, -0.2130506259042683, -0.3415126825877747, 0.12370731047076686, -0.3035195386470404, -0.1481821050708608, 0.18747509816704794, -0.14511825147426918, 0.06910802262596959, 0.10372013244200354, -0.003197739927762354, -0.07682079371685784, -0.2996089696115273, 0.30074324700512106, 0.035456474480587384, 0.31548068730175033, 0.036065199086171854, 0.0776509624001635, -0.0114971841992305, -0.04154625703407408, 0.08120449111876331, -0.03264635307554159, 0.1427816994083944, 0.24191373397773058, 0.15711902658086876, 0.2822171589937206, -0.3591976646593837, -0.19411275583470977, 0.14811598908791476, 0.1671277530776299, 0.10857189048721018, -0.0760986377817196, -0.2712310222591194, 0.12107467736196957, -0.12445859458701786, -0.08169772271103001, -0.13890905899190625, 0.0071450315791276075, -0.009475925648512766, -0.27776783336560396, 0.10537469387663594, 0.1137659657104013, 0.053270645158062145, 0.013613848808012152, -0.11812183121580255, 0.044896343451980576, 0.1084250945342044, 0.03288811489997446, 0.02983576832555754, 0.12971694433209738, -0.10962281912355865, -0.08491668398329598, 0.4046669965321126, -0.01199048814226606, -0.22468022559227985, 0.19910304155967798, -0.09522243873974265, -0.1830238531553006, 0.10097008271056206, 0.18362522575744364, 0.09899035078480609, -0.12610727407693836, 0.05819554748320447, -0.04187278676229392, 0.19026113565029332, 0.06758150833752728, 0.009070612064223419, 0.1501220733436301, 0.16273641721850854, 0.09580944483881354, 0.14138052897512474, -0.150584069328823, -0.05055674468708593, -0.27202765237767423, -0.1337530933096716, -0.19765471454074449, -0.016116930146353292, -0.1325193978189545, -0.17917592754558653, 0.36094746905443975, 0.20441303096978758, 0.23073629032127385, 0.0666021566401243, 0.29233618796795835, 0.04472886682343633, 0.10006957658559315, 0.1043317519316031, 0.22175270397497646, 0.0669922562624696, 0.019604921333722828, -0.16120869304999247, 0.08709680660115193, 0.04143490856729968] |
1,802.02342 | Energy-Efficient CMOS Memristive Synapses for Mixed-Signal Neuromorphic
System-on-a-Chip | Emerging non-volatile memory (NVM), or memristive, devices promise
energy-efficient realization of deep learning, when efficiently integrated with
mixed-signal integrated circuits on a CMOS substrate. Even though several
algorithmic challenges need to be addressed to turn the vision of memristive
Neuromorphic Systems-on-a-Chip (NeuSoCs) into reality, issues at the device and
circuit interface need immediate attention from the community. In this work, we
perform energy-estimation of a NeuSoC system and predict the desirable circuit
and device parameters for energy-efficiency optimization. Also, CMOS synapse
circuits based on the concept of CMOS memristor emulator are presented as a
system prototyping methodology, while practical memristor devices are being
developed and integrated with general-purpose CMOS. The proposed mixed-signal
memristive synapse can be designed and fabricated using standard CMOS
technologies and open doors to interesting applications in cognitive computing
circuits.
| cs.NE | emerging nonvolatile memory nvm or memristive devices promise energyefficient realization of deep learning when efficiently integrated with mixedsignal integrated circuits on a cmos substrate even though several algorithmic challenges need to be addressed to turn the vision of memristive neuromorphic systemsonachip neusocs into reality issues at the device and circuit interface need immediate attention from the community in this work we perform energyestimation of a neusoc system and predict the desirable circuit and device parameters for energyefficiency optimization also cmos synapse circuits based on the concept of cmos memristor emulator are presented as a system prototyping methodology while practical memristor devices are being developed and integrated with generalpurpose cmos the proposed mixedsignal memristive synapse can be designed and fabricated using standard cmos technologies and open doors to interesting applications in cognitive computing circuits | [['emerging', 'nonvolatile', 'memory', 'nvm', 'or', 'memristive', 'devices', 'promise', 'energyefficient', 'realization', 'of', 'deep', 'learning', 'when', 'efficiently', 'integrated', 'with', 'mixedsignal', 'integrated', 'circuits', 'on', 'a', 'cmos', 'substrate', 'even', 'though', 'several', 'algorithmic', 'challenges', 'need', 'to', 'be', 'addressed', 'to', 'turn', 'the', 'vision', 'of', 'memristive', 'neuromorphic', 'systemsonachip', 'neusocs', 'into', 'reality', 'issues', 'at', 'the', 'device', 'and', 'circuit', 'interface', 'need', 'immediate', 'attention', 'from', 'the', 'community', 'in', 'this', 'work', 'we', 'perform', 'energyestimation', 'of', 'a', 'neusoc', 'system', 'and', 'predict', 'the', 'desirable', 'circuit', 'and', 'device', 'parameters', 'for', 'energyefficiency', 'optimization', 'also', 'cmos', 'synapse', 'circuits', 'based', 'on', 'the', 'concept', 'of', 'cmos', 'memristor', 'emulator', 'are', 'presented', 'as', 'a', 'system', 'prototyping', 'methodology', 'while', 'practical', 'memristor', 'devices', 'are', 'being', 'developed', 'and', 'integrated', 'with', 'generalpurpose', 'cmos', 'the', 'proposed', 'mixedsignal', 'memristive', 'synapse', 'can', 'be', 'designed', 'and', 'fabricated', 'using', 'standard', 'cmos', 'technologies', 'and', 'open', 'doors', 'to', 'interesting', 'applications', 'in', 'cognitive', 'computing', 'circuits']] | [-0.10705982743440053, 0.015586777977072275, -0.0006041341210500552, -0.03923593035702092, -0.0968343396169635, -0.3277602297218087, 0.03527806903092334, 0.48548892959952356, -0.2581274955175244, -0.3606534706571927, 0.11074983462727127, -0.2200439528365118, -0.24715494957143583, 0.32075554292040087, -0.11353207330147808, 0.18216289794788912, 0.06428984250479307, -0.07885882824730987, 0.0055380415269890085, -0.21506129236256058, 0.16434061739665384, 0.07352391984112239, 0.36586756384573305, 0.014268692505832474, 0.12851609556147686, -0.13280919671345215, 0.06811842881456519, -0.03110369093214663, -0.027118149439159495, 0.2027764314499039, 0.35966059821120533, 0.12836207686027942, 0.2995342991708849, -0.5743464031758216, -0.19919445153612356, 0.03249355426702935, 0.1460251295222686, 0.05271931338804559, -0.11295165246030173, -0.2919147503920473, 0.14969135374188997, -0.21771398489721694, -0.02640295397252955, -0.08587269035544103, 0.023213608392800848, 0.011878955564372098, -0.19975801459871806, -0.12701640052635832, 0.05433049348648637, 0.03890238841995597, 0.019235654987278396, -0.15341649718063238, 0.05270515347298127, 0.08205606661347421, -0.14919739150298902, -0.01783570044297868, 0.29807867631674384, -0.14189836299942377, -0.22238152269273997, 0.29570396749410205, 0.06066650626106331, -0.13912391807310856, 0.13119903769559013, -0.015895200440158637, -0.0950349648662198, 0.041426318344803384, 0.22609468986495182, -0.035020243437387626, -0.2383321907547025, 0.09159138520481065, 0.12924476369069174, 0.2104880474651089, 0.0037480934917067106, 0.11740971676145609, 0.2505651983307101, 0.37244115272501055, 0.025855011307150844, 0.1471561240730807, -0.035145263696232665, -0.07068740488030016, -0.21434408218170015, -0.21114728945988015, -0.20497417918478067, 0.07326110147987493, -0.0540240327767186, -0.19039963922248437, 0.3723639147893454, 0.23891491330801867, 0.063487118941087, 0.07504572455699628, 0.4137042206926988, 0.09696461063218662, 0.2266716172775397, 0.055324922774273616, 0.16201305341405364, 0.11790545279733264, 0.26717297877005947, -0.17410139897659135, 0.062349275258692126, -0.07340317665635107] |
1,802.02343 | Multi-View Bayesian Correlated Component Analysis | Correlated component analysis as proposed by Dmochowski et al. (2012) is a
tool for investigating brain process similarity in the responses to multiple
views of a given stimulus. Correlated components are identified under the
assumption that the involved spatial networks are identical. Here we propose a
hierarchical probabilistic model that can infer the level of universality in
such multi-view data, from completely unrelated representations, corresponding
to canonical correlation analysis, to identical representations as in
correlated component analysis. This new model, which we denote Bayesian
correlated component analysis, evaluates favourably against three relevant
algorithms in simulated data. A well-established benchmark EEG dataset is used
to further validate the new model and infer the variability of spatial
representations across multiple subjects.
| stat.ML | correlated component analysis as proposed by dmochowski et al 2012 is a tool for investigating brain process similarity in the responses to multiple views of a given stimulus correlated components are identified under the assumption that the involved spatial networks are identical here we propose a hierarchical probabilistic model that can infer the level of universality in such multiview data from completely unrelated representations corresponding to canonical correlation analysis to identical representations as in correlated component analysis this new model which we denote bayesian correlated component analysis evaluates favourably against three relevant algorithms in simulated data a wellestablished benchmark eeg dataset is used to further validate the new model and infer the variability of spatial representations across multiple subjects | [['correlated', 'component', 'analysis', 'as', 'proposed', 'by', 'dmochowski', 'et', 'al', '2012', 'is', 'a', 'tool', 'for', 'investigating', 'brain', 'process', 'similarity', 'in', 'the', 'responses', 'to', 'multiple', 'views', 'of', 'a', 'given', 'stimulus', 'correlated', 'components', 'are', 'identified', 'under', 'the', 'assumption', 'that', 'the', 'involved', 'spatial', 'networks', 'are', 'identical', 'here', 'we', 'propose', 'a', 'hierarchical', 'probabilistic', 'model', 'that', 'can', 'infer', 'the', 'level', 'of', 'universality', 'in', 'such', 'multiview', 'data', 'from', 'completely', 'unrelated', 'representations', 'corresponding', 'to', 'canonical', 'correlation', 'analysis', 'to', 'identical', 'representations', 'as', 'in', 'correlated', 'component', 'analysis', 'this', 'new', 'model', 'which', 'we', 'denote', 'bayesian', 'correlated', 'component', 'analysis', 'evaluates', 'favourably', 'against', 'three', 'relevant', 'algorithms', 'in', 'simulated', 'data', 'a', 'wellestablished', 'benchmark', 'eeg', 'dataset', 'is', 'used', 'to', 'further', 'validate', 'the', 'new', 'model', 'and', 'infer', 'the', 'variability', 'of', 'spatial', 'representations', 'across', 'multiple', 'subjects']] | [-0.05392236621671562, 0.05454372911875815, -0.11313750859156599, 0.10037589257825534, -0.0628594709126184, -0.1608210485586423, 0.012748914936525841, 0.39522606986811604, -0.2806291806480011, -0.3420056786893283, 0.04702167569312377, -0.2900144172303568, -0.20215968753732108, 0.166521123667658, -0.05478999178098925, 0.059271337864012855, 0.07263691034720485, 0.009370236965369875, -0.043894760338273844, -0.21078795065187803, 0.3178351309418805, 0.05310896938366784, 0.35912902443669736, -0.04460793420508646, 0.09729587888321445, -0.0005241292686659401, -0.11922463171491873, 0.01930911271335652, -0.033054352053899866, 0.13714773136475203, 0.29328702699977083, 0.1745053072069314, 0.2570558332431651, -0.3824502291252552, -0.25024800224750604, 0.1037024873371978, 0.14567707013338804, 0.04609629879528025, 0.02095807201260606, -0.32387953699108657, 0.08517085106328615, -0.14046059119499335, -0.06036293394153275, -0.11880020583364165, 0.0077176807449254505, -0.013675592674960588, -0.32323001835779364, 0.12029322906657737, 0.027248367501454332, 0.0855912883702855, -0.08253117145623191, -0.1052611255347413, 0.005583428288415327, 0.1585377136845205, 0.031065894598368223, 0.029140841465697908, 0.11987354415784574, -0.10383631935208973, -0.1519402118584228, 0.3221795565717049, -0.06391382984564466, -0.20064547673751743, 0.24129680483759838, -0.059097318879478625, -0.2051656212000634, 0.07832642948112876, 0.23449712487379626, 0.08648114733524241, -0.21631287035958494, -0.015985234506858386, -0.08495461364213566, 0.19867217516126032, -0.009382413408198094, -0.012514645036436239, 0.1991945097037449, 0.19272152103199544, -0.03805614752805707, 0.15364788585516104, -0.13142410611489125, -0.09871735267777201, -0.24597005453059387, -0.085030242974349, -0.1840007120518456, -0.029684417639855073, -0.0876568306109945, -0.14527616695642975, 0.439405222707507, 0.2277642973043593, 0.21750568660860092, 0.05965869207111763, 0.2906096322240971, 0.049904414099420154, 0.05562410193448097, 0.05740606345993988, 0.16326642380208486, 0.09842629383231308, 0.04666819410809016, -0.16319517010301984, 0.10669487191095822, -0.0019420562627709519] |
1,802.02344 | Shift invariant subspaces of slice $L^2$ functions | In this paper we characterize the closed invariant subspaces for the
($*$-)multiplier operator of the quaternionic space of slice $L^2$ functions.
As a consequence, we obtain the inner-outer factorization theorem for the
quaternionic Hardy space on the unit ball and we provide a characterization of
quaternionic outer functions in terms of cyclicity.
| math.CV | in this paper we characterize the closed invariant subspaces for the multiplier operator of the quaternionic space of slice l2 functions as a consequence we obtain the innerouter factorization theorem for the quaternionic hardy space on the unit ball and we provide a characterization of quaternionic outer functions in terms of cyclicity | [['in', 'this', 'paper', 'we', 'characterize', 'the', 'closed', 'invariant', 'subspaces', 'for', 'the', 'multiplier', 'operator', 'of', 'the', 'quaternionic', 'space', 'of', 'slice', 'l2', 'functions', 'as', 'a', 'consequence', 'we', 'obtain', 'the', 'innerouter', 'factorization', 'theorem', 'for', 'the', 'quaternionic', 'hardy', 'space', 'on', 'the', 'unit', 'ball', 'and', 'we', 'provide', 'a', 'characterization', 'of', 'quaternionic', 'outer', 'functions', 'in', 'terms', 'of', 'cyclicity']] | [-0.150407765705425, 0.029529237537644804, -0.09239682689524041, 0.1265299851321078, -0.04991704936569127, -0.0222050106833474, 0.01595048312894785, 0.3255752709049445, -0.3030097610675372, -0.11765777341161783, 0.14314953662687913, -0.20946363163574672, -0.1754629254932157, 0.20445799154157823, -0.12211762830758324, 0.06268913399141568, 0.034015857157870553, 0.07110545880557485, -0.2081948191536447, -0.2132081135104482, 0.4514269865332888, -0.01574907910365325, 0.1508074086249018, 0.05493434848120579, 0.1197682107404734, 0.0668965731210147, -0.04253119046692378, -0.08561583832376457, -0.19016241350282842, 0.17043834258444035, 0.23782696302693623, 0.10077571767704704, 0.2642855348217731, -0.4039886019980678, -0.1357865016728353, 0.19825923955067992, 0.16948851158555883, -0.0959004367558429, -0.03111656136640634, -0.2763416108030539, 0.050282930149338566, -0.10124627235703744, -0.17973485184260285, -0.12070417939685285, -0.004289508752453213, -0.011671172119139765, -0.28670776155419075, 0.06901762023783074, 0.1318558809490731, 0.08059071907057212, -0.16983670995642358, -0.08021414330085883, 0.037326981116516084, 0.10717572380179682, -0.04875396901311783, 0.0819787398303071, 0.1092005999526009, -0.012736989677740404, -0.09356083545403984, 0.3243449436357388, -0.07702201169628936, -0.34099865791638595, 0.07860648463695095, -0.23765222794519594, -0.14799473416776612, 0.03323287430864114, 0.16447702179161403, 0.15818337626898518, -0.0699029064271599, 0.21706102559087762, -0.18270886320477495, 0.049620552834732316, 0.12998945935844228, 0.12169930962577033, 0.06424916246368621, 0.08444174228665921, 0.1921220429850599, 0.2157029713718937, -0.0267991193862914, -0.08336395150623642, -0.4020402148688355, -0.30042078037961173, -0.16350855650559354, 0.08458758613023047, -0.14334882227138643, -0.25112179555715275, 0.464249608035271, -0.019641006629591666, 0.2191579012634555, 0.10761644617797664, 0.24730605392072064, 0.10093984929307435, 0.08224559584274314, 0.062420108991388515, 0.17573634006727773, 0.2243491174035276, 0.06663172929368627, -0.10953587071540263, -0.058873594228106625, 0.24998395033897117] |
1,802.02345 | Stability of boron-doped graphene/copper interface: DFT, XPS and OSEE
studies | Two different types of boron-doped graphene/copper interfaces synthesized
using two different flow rates of Ar through the bubbler containing the boron
source were studied. X-ray photoelectron spectra (XPS) and optically stimulated
electron emission (OSEE) measurements have demonstrated that boron-doped
graphene coating provides a high corrosion resistivity of Cu-substrate with the
light traces of the oxidation of carbon cover. The density functional theory
calculations suggest that for the case of substitutional (graphitic)
boron-defect only the oxidation near boron impurity is energetically favorable
and creation of the vacancies that can induce the oxidation of copper substrate
is energetically unfavorable. In the case of non-graphitic boron defects
oxidation of the area, a nearby impurity is metastable that not only prevent
oxidation but makes boron-doped graphene. Modeling of oxygen reduction reaction
demonstrates high catalytic performance of these materials.
| cond-mat.mtrl-sci physics.app-ph physics.chem-ph | two different types of borondoped graphenecopper interfaces synthesized using two different flow rates of ar through the bubbler containing the boron source were studied xray photoelectron spectra xps and optically stimulated electron emission osee measurements have demonstrated that borondoped graphene coating provides a high corrosion resistivity of cusubstrate with the light traces of the oxidation of carbon cover the density functional theory calculations suggest that for the case of substitutional graphitic borondefect only the oxidation near boron impurity is energetically favorable and creation of the vacancies that can induce the oxidation of copper substrate is energetically unfavorable in the case of nongraphitic boron defects oxidation of the area a nearby impurity is metastable that not only prevent oxidation but makes borondoped graphene modeling of oxygen reduction reaction demonstrates high catalytic performance of these materials | [['two', 'different', 'types', 'of', 'borondoped', 'graphenecopper', 'interfaces', 'synthesized', 'using', 'two', 'different', 'flow', 'rates', 'of', 'ar', 'through', 'the', 'bubbler', 'containing', 'the', 'boron', 'source', 'were', 'studied', 'xray', 'photoelectron', 'spectra', 'xps', 'and', 'optically', 'stimulated', 'electron', 'emission', 'osee', 'measurements', 'have', 'demonstrated', 'that', 'borondoped', 'graphene', 'coating', 'provides', 'a', 'high', 'corrosion', 'resistivity', 'of', 'cusubstrate', 'with', 'the', 'light', 'traces', 'of', 'the', 'oxidation', 'of', 'carbon', 'cover', 'the', 'density', 'functional', 'theory', 'calculations', 'suggest', 'that', 'for', 'the', 'case', 'of', 'substitutional', 'graphitic', 'borondefect', 'only', 'the', 'oxidation', 'near', 'boron', 'impurity', 'is', 'energetically', 'favorable', 'and', 'creation', 'of', 'the', 'vacancies', 'that', 'can', 'induce', 'the', 'oxidation', 'of', 'copper', 'substrate', 'is', 'energetically', 'unfavorable', 'in', 'the', 'case', 'of', 'nongraphitic', 'boron', 'defects', 'oxidation', 'of', 'the', 'area', 'a', 'nearby', 'impurity', 'is', 'metastable', 'that', 'not', 'only', 'prevent', 'oxidation', 'but', 'makes', 'borondoped', 'graphene', 'modeling', 'of', 'oxygen', 'reduction', 'reaction', 'demonstrates', 'high', 'catalytic', 'performance', 'of', 'these', 'materials']] | [-0.06577080301037996, 0.16780880540825946, -0.00032170621029375653, -0.03971999920742197, 0.06506715588769767, -0.19373525289977475, 0.1136842452796436, 0.4725983576748029, -0.2171712027602764, -0.29050679136674074, -0.009031194180084119, -0.3780621728361693, -0.099970802693635, 0.1594104815631845, 0.014746227265559426, 0.006573201922425466, 0.06447550518683685, -0.1275210227138659, -0.0621357135196729, -0.25953242989516884, 0.24713470008180932, 0.08220036177672158, 0.36117187623194486, 0.14627993231018385, 0.011457100810208756, -0.03566721222876001, 0.10544354877571842, -0.01043319774343986, -0.10392957486599402, 0.11581240153452743, 0.28314449075905446, -0.08157767917123414, 0.17650392268921516, -0.5312135606108941, -0.26905257150877354, -0.025660749907468177, 0.10666293027096016, 0.14853402478403824, -0.14530656317631577, -0.2088295220733122, 0.07353259825153104, -0.10426129947430923, -0.10581057389129618, -0.047019679128199585, -0.02484725522556046, 0.006065104279464992, -0.22176346077056702, 0.07863181105331164, 0.011408496787952072, 0.08026740562242714, -0.16640968223160146, -0.12976158998704465, -0.21399422893084066, 0.02814035935240776, 0.042163084385656684, -0.0522257765173432, 0.3304933507226465, -0.055156818952035995, -0.0760911043495113, 0.3613719856583102, -0.031165192593177852, -0.04127611224034209, 0.22332075231730245, -0.17018407333440097, -0.10500402893336822, 0.2537256578171207, 0.044280757275662684, 0.15916952772008242, -0.17003430258627086, 0.04932938326897403, 0.023319905501963615, 0.16676273355224394, 0.14740553928553596, 0.04171888224054994, 0.19479047842937441, 0.2563659995225756, 0.028309408201684438, 0.15390459694646935, -0.1792244388822957, 0.022749642263953537, -0.15675400383409488, -0.24872295865283686, -0.18612811672176385, 0.11207548574212389, -0.09516794920394507, -0.24949113886745633, 0.3499789522462633, 0.06532472282893552, 0.11406855908937233, -0.1517886337643677, 0.2151654362822919, 0.04724600664141422, 0.05355827870973667, -0.028890200511574052, 0.2676612541310547, 0.16900572476388756, 0.09367584960549608, -0.29832025629273334, 0.1810010924236849, -0.009765991118065146] |
1,802.02346 | On Synthesis of Reversible Circuits with Small Number of Additional
Inputs Consisting of NOT, CNOT and 2-CNOT Gates | The paper discusses the gate complexity of reversible circuits with the small
number of additional inputs consisting of NOT, CNOT and 2-CNOT gates. We study
Shannon's gate complexity function $L(n, q)$ for a reversible circuit
implementing a Boolean transformation $f\colon \mathbb Z_2^n \to \mathbb Z_2^n$
with $q \leqslant O(n^2)$ additional inputs. The general bound $L(n,q) \asymp
n2^n \mathop / \log_2 n$ is proved for this case.
| cs.CC | the paper discusses the gate complexity of reversible circuits with the small number of additional inputs consisting of not cnot and 2cnot gates we study shannons gate complexity function ln q for a reversible circuit implementing a boolean transformation fcolon mathbb z_2n to mathbb z_2n with q leqslant on2 additional inputs the general bound lnq asymp n2n mathop log_2 n is proved for this case | [['the', 'paper', 'discusses', 'the', 'gate', 'complexity', 'of', 'reversible', 'circuits', 'with', 'the', 'small', 'number', 'of', 'additional', 'inputs', 'consisting', 'of', 'not', 'cnot', 'and', '2cnot', 'gates', 'we', 'study', 'shannons', 'gate', 'complexity', 'function', 'ln', 'q', 'for', 'a', 'reversible', 'circuit', 'implementing', 'a', 'boolean', 'transformation', 'fcolon', 'mathbb', 'z_2n', 'to', 'mathbb', 'z_2n', 'with', 'q', 'leqslant', 'on2', 'additional', 'inputs', 'the', 'general', 'bound', 'lnq', 'asymp', 'n2n', 'mathop', 'log_2', 'n', 'is', 'proved', 'for', 'this', 'case']] | [-0.2355108075417005, 0.151647593267262, 0.09117287102227027, -0.010491460812493013, 0.03573620723417172, -0.32024118254104483, 0.10748585007834033, 0.34224519431591033, -0.28280424825274025, -0.26221300182290946, 0.022882904871725118, -0.28267715533908744, -0.14000860556172065, 0.2093853201538038, -0.1250342637873613, 0.1598821688300142, -0.07532178564713551, 0.02239144636461368, -0.09543619903091055, -0.34560111296864654, 0.18567177564478837, -0.06541633780759115, 0.1890067504136823, -0.034717913659719324, 0.08675125311128795, -0.004568974659419977, 0.08952816240489483, -0.0913295787687485, -0.17696625994375118, 0.03437888029103096, 0.2656154535710812, 0.16331892798726375, 0.22214780002832413, -0.4483514086844829, -0.09521539642547186, 0.2034283655910538, 0.15342567349927358, 0.04180487577731793, -0.02217842177846111, -0.20892240956354027, 0.09422525593187087, -0.13881904574540946, -0.05040230925839681, -0.06295263431966305, 0.15339694149219074, -0.015276419417932629, -0.3747221413211754, -0.04984467426799641, 0.18956123280983705, 0.08195030816759054, 0.09968147093000321, -0.16370673801284283, 0.03678844330402521, 0.037461603683634444, -0.13633946382727188, 0.18421756862662733, 0.14120682770959458, -0.02357785114302085, -0.11885865382277049, 0.259029291340938, -0.012340717046306683, -0.21963727861069715, 0.023416232475294518, -0.12084025211202411, -0.16703369425466427, 0.06620226276035492, 0.1048701627824742, 0.11513024087135608, -0.06827890851463263, 0.3051045321062422, -0.05153616936160968, 0.29990123931605084, 0.12465724794623943, 0.0934415973481149, 0.01064440245525195, 0.10351306038120618, 0.07077087162492367, 0.2367354619101836, 0.05519183386976902, -0.028541175276041032, -0.3982448609975668, -0.21831721919678296, -0.22316383983796606, 0.19805346514264013, -0.13893239481996997, -0.14498196237792188, 0.29719215887956896, 0.05200971294767581, 0.15567328184843063, 0.2090582592985951, 0.2892078009237034, 0.10186366403761965, 0.07124526191216249, 0.10756831780219307, 0.010909921346375575, 0.1992889884322022, -0.046758107998623295, -0.228880600265872, 0.05174222260247916, 0.12505397888330314] |
1,802.02347 | SlideRunner - A Tool for Massive Cell Annotations in Whole Slide Images | Large-scale image data such as digital whole-slide histology images pose a
challenging task at annotation software solutions. Today, a number of good
solutions with varying scopes exist. For cell annotation, however, we find that
many do not match the prerequisites for fast annotations. Especially in the
field of mitosis detection, it is assumed that detection accuracy could
significantly benefit from larger annotation databases that are currently
however very troublesome to produce. Further, multiple independent (blind)
expert labels are a big asset for such databases, yet there is currently no
tool for this kind of annotation available.
To ease this tedious process of expert annotation and grading, we introduce
SlideRunner, an open source annotation and visualization tool for digital
histopathology, developed in close cooperation with two pathologists.
SlideRunner is capable of setting annotations like object centers (for e.g.
cells) as well as object boundaries (e.g. for tumor outlines). It provides
single-click annotations as well as a blind mode for multi-annotations, where
the expert is directly shown the microscopy image containing the cells that he
has not yet rated.
| cs.CV | largescale image data such as digital wholeslide histology images pose a challenging task at annotation software solutions today a number of good solutions with varying scopes exist for cell annotation however we find that many do not match the prerequisites for fast annotations especially in the field of mitosis detection it is assumed that detection accuracy could significantly benefit from larger annotation databases that are currently however very troublesome to produce further multiple independent blind expert labels are a big asset for such databases yet there is currently no tool for this kind of annotation available to ease this tedious process of expert annotation and grading we introduce sliderunner an open source annotation and visualization tool for digital histopathology developed in close cooperation with two pathologists sliderunner is capable of setting annotations like object centers for eg cells as well as object boundaries eg for tumor outlines it provides singleclick annotations as well as a blind mode for multiannotations where the expert is directly shown the microscopy image containing the cells that he has not yet rated | [['largescale', 'image', 'data', 'such', 'as', 'digital', 'wholeslide', 'histology', 'images', 'pose', 'a', 'challenging', 'task', 'at', 'annotation', 'software', 'solutions', 'today', 'a', 'number', 'of', 'good', 'solutions', 'with', 'varying', 'scopes', 'exist', 'for', 'cell', 'annotation', 'however', 'we', 'find', 'that', 'many', 'do', 'not', 'match', 'the', 'prerequisites', 'for', 'fast', 'annotations', 'especially', 'in', 'the', 'field', 'of', 'mitosis', 'detection', 'it', 'is', 'assumed', 'that', 'detection', 'accuracy', 'could', 'significantly', 'benefit', 'from', 'larger', 'annotation', 'databases', 'that', 'are', 'currently', 'however', 'very', 'troublesome', 'to', 'produce', 'further', 'multiple', 'independent', 'blind', 'expert', 'labels', 'are', 'a', 'big', 'asset', 'for', 'such', 'databases', 'yet', 'there', 'is', 'currently', 'no', 'tool', 'for', 'this', 'kind', 'of', 'annotation', 'available', 'to', 'ease', 'this', 'tedious', 'process', 'of', 'expert', 'annotation', 'and', 'grading', 'we', 'introduce', 'sliderunner', 'an', 'open', 'source', 'annotation', 'and', 'visualization', 'tool', 'for', 'digital', 'histopathology', 'developed', 'in', 'close', 'cooperation', 'with', 'two', 'pathologists', 'sliderunner', 'is', 'capable', 'of', 'setting', 'annotations', 'like', 'object', 'centers', 'for', 'eg', 'cells', 'as', 'well', 'as', 'object', 'boundaries', 'eg', 'for', 'tumor', 'outlines', 'it', 'provides', 'singleclick', 'annotations', 'as', 'well', 'as', 'a', 'blind', 'mode', 'for', 'multiannotations', 'where', 'the', 'expert', 'is', 'directly', 'shown', 'the', 'microscopy', 'image', 'containing', 'the', 'cells', 'that', 'he', 'has', 'not', 'yet', 'rated']] | [-0.034384306646674745, 0.013674864203661772, 0.008012847982925075, 0.10178786286475258, -0.13149632103527073, -0.19998123426118802, 0.03292558139863146, 0.4515200800305211, -0.21793712745688257, -0.37727985063824676, 0.13903386160415523, -0.2802300193522998, -0.12326496017925527, 0.2387017414994784, -0.16863510410044472, 0.060072608399151385, 0.15415570707443096, 0.06206186483185953, 0.049697091901974605, -0.2355804464140179, 0.2751147382512646, 0.036085299854487954, 0.31818915229162265, 0.03256954310124676, 0.09664536353760003, -0.048417139019624425, -0.0702841972300633, -0.004803147600514108, -0.046527180020013645, 0.11609715616180637, 0.41086809957351794, 0.23937973007455238, 0.3152049960268811, -0.4158742593965311, -0.18643407625997246, 0.07621345369027521, 0.20512414932161993, 0.1187842807601388, -0.11187646162278693, -0.3026238585843694, 0.09637924409993313, -0.15204154051828261, -0.027500369121894595, -0.1360768466845326, 0.0371803789420974, -0.0362954725659902, -0.27531714249273825, 0.060313456867093586, 0.01749005696325477, 0.12125296973430648, -0.04623449390523949, -0.08650275928268729, 0.026388994739230336, 0.23726908650366996, 0.03175677233171548, 0.07715440314562841, 0.13830614096388735, -0.23865767599661544, -0.10586296753882933, 0.38819457641428057, 0.022505472756750966, -0.23639355029846573, 0.24227613791215888, -0.06603311306941484, -0.16649206092142255, 0.14589363887328013, 0.11620642463395629, 0.09077136900848655, -0.19054843130489363, 0.004617147382493292, -0.019839788230414362, 0.2443231507492166, 0.08517931647941299, 0.0034659256798686222, 0.2045502572376602, 0.23573816914396392, 0.029115043477163295, 0.09165640098334493, -0.11189245159641423, -0.017620674768013173, -0.22730693162516583, -0.17385010710307236, -0.19342233244668902, -0.004422709551718803, -0.05100268300541746, -0.24075468820864307, 0.3016195343111524, 0.19173211886429753, 0.1387881187122615, 0.041945848988647436, 0.3484557019171958, -0.030904429252179146, 0.15575812857373264, 0.025726648836715105, 0.16429309546412235, -0.04949814321917492, 0.14272522812323837, -0.12993423710276117, 0.12667795907018234, 0.01822240785267418] |
1,802.02348 | Structure of even-even Cadmium isotopes from the beyond-mean-field
interacting boson model | The structure of even-even $^{108-116}$Cd isotopes is investigated based on
the self-consistent mean-field approach. By mapping the
quadrupole-$(\beta,\gamma)$ deformation energy surface, obtained from the
constrained self-consistent mean-field calculations with a choice of the Skyrme
force and pairing property, onto the Hamiltonian of the interacting boson model
with configuration mixing, the strength parameters of the Hamiltonian are
determined. The low-lying excitation spectra and electric quadrupole transition
rates for the considered Cd nuclei are computed by the resultant Hamiltonian,
and are compared in detail with the experimental data. Our semi-microscopic
prediction identifies several intruder states as suggested empirically, and
overall, provides a reasonable qualitative description of the experimental
energy levels and transition rates.
| nucl-th nucl-ex | the structure of eveneven 108116cd isotopes is investigated based on the selfconsistent meanfield approach by mapping the quadrupolebetagamma deformation energy surface obtained from the constrained selfconsistent meanfield calculations with a choice of the skyrme force and pairing property onto the hamiltonian of the interacting boson model with configuration mixing the strength parameters of the hamiltonian are determined the lowlying excitation spectra and electric quadrupole transition rates for the considered cd nuclei are computed by the resultant hamiltonian and are compared in detail with the experimental data our semimicroscopic prediction identifies several intruder states as suggested empirically and overall provides a reasonable qualitative description of the experimental energy levels and transition rates | [['the', 'structure', 'of', 'eveneven', '108116cd', 'isotopes', 'is', 'investigated', 'based', 'on', 'the', 'selfconsistent', 'meanfield', 'approach', 'by', 'mapping', 'the', 'quadrupolebetagamma', 'deformation', 'energy', 'surface', 'obtained', 'from', 'the', 'constrained', 'selfconsistent', 'meanfield', 'calculations', 'with', 'a', 'choice', 'of', 'the', 'skyrme', 'force', 'and', 'pairing', 'property', 'onto', 'the', 'hamiltonian', 'of', 'the', 'interacting', 'boson', 'model', 'with', 'configuration', 'mixing', 'the', 'strength', 'parameters', 'of', 'the', 'hamiltonian', 'are', 'determined', 'the', 'lowlying', 'excitation', 'spectra', 'and', 'electric', 'quadrupole', 'transition', 'rates', 'for', 'the', 'considered', 'cd', 'nuclei', 'are', 'computed', 'by', 'the', 'resultant', 'hamiltonian', 'and', 'are', 'compared', 'in', 'detail', 'with', 'the', 'experimental', 'data', 'our', 'semimicroscopic', 'prediction', 'identifies', 'several', 'intruder', 'states', 'as', 'suggested', 'empirically', 'and', 'overall', 'provides', 'a', 'reasonable', 'qualitative', 'description', 'of', 'the', 'experimental', 'energy', 'levels', 'and', 'transition', 'rates']] | [-0.09418005531294904, 0.14542884388596777, -0.05834672430214054, 0.09792959431737422, 0.03681774777488424, -0.11012975244201856, 0.06382452653626988, 0.3691467373469554, -0.2018006269033964, -0.32418378237464013, -0.04314824770986521, -0.2806150223376281, -0.08248706373445895, 0.1433197369653766, 0.08207297332824097, 0.058092471989674856, 0.0718971156758692, 0.05281133828855573, -0.10094890977392708, -0.1534276467944504, 0.3149982141501723, 0.11342637278054149, 0.2919292712515784, 0.040355995233350116, 0.04046234833995103, 0.014199925445601207, 0.039500993052753834, 0.005985982643457454, -0.16045583838408967, 0.10961833834987766, 0.20834827447019585, 0.040220543460219825, 0.17133903624959837, -0.4343229011897374, -0.2332236649502718, 0.022816434976807156, 0.11362439872047633, 0.15422459182953205, -0.07796384916115347, -0.32203206809989493, 0.0088097975555158, -0.20378351866036926, -0.1477073688196753, -0.15404258522956948, -0.01201917187720879, 0.08090613033930096, -0.2840661645440786, 0.0848182522085145, -0.010107547121652223, 0.08157142665424895, -0.18274206829411105, -0.17169472797765234, -0.10583331101625269, 0.08357539185997817, 0.08199772197612211, 0.028151704758884163, 0.17078460082240882, -0.09765992270902209, -0.06684669168930876, 0.40598297156735297, -0.03984558483833498, -0.15829855516000754, 0.13703037442323332, -0.10049078468267524, -0.10399757640184236, 0.16128428539244133, 0.08606183470799289, 0.10411064098631843, -0.13995081266236636, 0.10933878172964387, -0.01325045005202618, 0.15425332211205786, -0.022072315753016776, 0.01293096495279615, 0.1487261464118684, 0.19622501266966447, -0.033803308450984296, 0.08037887340937015, -0.11608428607370123, -0.18586269637287825, -0.29498668930091715, -0.03310817059710485, -0.18068729422200436, 0.010109296538482566, -0.06557510273118286, -0.1183251838262274, 0.4451184329841662, 0.07993978442231175, 0.20768420338425614, 0.012578032712170154, 0.2729633313031235, 0.14380618428743078, 0.042632371101767645, 0.024494851144765496, 0.32790184454189253, 0.18882735025291458, 0.00503472874470807, -0.31887178152902135, 0.04150928713705972, 0.08850504034369705] |
1,802.02349 | Algorithm implementation and numerical analysis for the two-dimensional
tempered fractional Laplacian | Tempered fractional Laplacian is the generator of the tempered isotropic
L\'evy process [W.H. Deng, B.Y. Li, W.Y. Tian, and P.W. Zhang, Multiscale
Model. Simul., 16(1), 125-149, 2018]. This paper provides the finite difference
discretization for the two dimensional tempered fractional Laplacian
$(\Delta+\lambda)^{\frac{\beta}{2}}$. Then we use it to solve the tempered
fractional Poisson equation with Dirichlet boundary conditions and derive the
error estimates. Numerical experiments verify the convergence rates and
effectiveness of the schemes.
| math.NA | tempered fractional laplacian is the generator of the tempered isotropic levy process wh deng by li wy tian and pw zhang multiscale model simul 161 125149 2018 this paper provides the finite difference discretization for the two dimensional tempered fractional laplacian deltalambdafracbeta2 then we use it to solve the tempered fractional poisson equation with dirichlet boundary conditions and derive the error estimates numerical experiments verify the convergence rates and effectiveness of the schemes | [['tempered', 'fractional', 'laplacian', 'is', 'the', 'generator', 'of', 'the', 'tempered', 'isotropic', 'levy', 'process', 'wh', 'deng', 'by', 'li', 'wy', 'tian', 'and', 'pw', 'zhang', 'multiscale', 'model', 'simul', '161', '125149', '2018', 'this', 'paper', 'provides', 'the', 'finite', 'difference', 'discretization', 'for', 'the', 'two', 'dimensional', 'tempered', 'fractional', 'laplacian', 'deltalambdafracbeta2', 'then', 'we', 'use', 'it', 'to', 'solve', 'the', 'tempered', 'fractional', 'poisson', 'equation', 'with', 'dirichlet', 'boundary', 'conditions', 'and', 'derive', 'the', 'error', 'estimates', 'numerical', 'experiments', 'verify', 'the', 'convergence', 'rates', 'and', 'effectiveness', 'of', 'the', 'schemes']] | [-0.03816736204234857, 0.06293602291704484, -0.12297281362181924, 0.0740271520016776, -0.12273220246014985, -0.11028905992042011, -0.007614582253974193, 0.3263513438902061, -0.2981262421596166, -0.23310913701712246, 0.10921495840032126, -0.244369584004539, -0.1445398285565242, 0.17005296738844522, -0.13694391617367804, 0.15573982525170899, 0.07959848621361693, -0.06318837648231379, -0.06107239449777129, -0.2707995885694531, 0.31426543163948917, 0.028281619759197806, 0.27261173924509907, -0.013757221315475836, 0.1402584566131339, -0.07230784773538021, -0.13665665084050155, -0.1100938813961734, -0.23792235300102285, 0.11776676017817267, 0.20456902882162953, -0.0633442010763298, 0.30761360891268286, -0.350240957057497, -0.2456985830237538, 0.1332207036624387, 0.0583557036252771, -0.013029935310634089, -0.01602559607528465, -0.36087752498594494, 0.14857953458919493, -0.17126072171918102, -0.15490806843219718, -0.055131274970694324, 0.06850046751050043, 0.0637038559341331, -0.36921971015842026, 0.18759675826024735, 0.12830609911528063, -0.018946603609537576, -0.08110184091287599, -0.1653975097882286, -0.03484833634025614, -0.006640890744370474, -0.011805341164597874, -0.034799061125328004, 0.031345564694943984, -0.039895798366301215, -0.16142208807983657, 0.318342252713169, -0.08752328136437376, -0.29165733967658497, 0.1431664113335731, -0.1310702426634519, -0.09522563873619681, 0.08957315557701907, 0.12983154171371084, 0.1396549715935974, -0.14024710665706178, 0.18379243609944726, -0.003741354601208488, 0.06313259249002161, 0.1393392307808439, -0.07670898924411183, -0.012017743347186438, 0.1450630786474532, 0.10610244130637024, 0.08532894103669784, -0.12462256005702829, -0.13837500516010423, -0.33988226582886466, -0.24229724446810047, -0.19179286894021214, 0.05457343022719446, -0.14707003559029339, -0.1331808674641111, 0.36298383116512234, 0.15029638759631164, 0.12998407469196638, 0.09337707817502006, 0.19543125652904872, 0.2382614914275391, -0.1537088039421319, 0.13800232216033717, 0.09021283983921921, 0.24508051409281162, 0.14714582702538498, -0.25407220311725226, -0.009497721364695422, 0.2405333950931967] |
1,802.0235 | Large-deviation Properties of Linear-programming Computational Hardness
of the Vertex Cover Problem | The distribution of the computational cost of linear-programming (LP)
relaxation for vertex cover problems on Erdos-Renyi random graphs is evaluated
by using the rare-event sampling method. As a large-deviation property,
differences of the distribution for "easy" and "hard" problems are found
reflecting the hardness of approximation by LP relaxation. In particular, by
evaluating the total variation distance between conditional distributions with
respect to the hardness, it is suggested that those distributions are almost
indistinguishable in the replica symmetric (RS) phase while they asymptotically
differ in the replica symmetry breaking (RSB) phase. In addition, we seek for a
relation to graph structure by investigating a similarity to bipartite graphs,
which exhibits a quantitative difference between the RS and RSB phase. These
results indicate the nontrivial relation of the typical computational cost of
LP relaxation to the RS-RSB phase transition as present in the spin-glass
theory of models on the corresponding random graph structure.
| cond-mat.dis-nn cond-mat.stat-mech cs.DS | the distribution of the computational cost of linearprogramming lp relaxation for vertex cover problems on erdosrenyi random graphs is evaluated by using the rareevent sampling method as a largedeviation property differences of the distribution for easy and hard problems are found reflecting the hardness of approximation by lp relaxation in particular by evaluating the total variation distance between conditional distributions with respect to the hardness it is suggested that those distributions are almost indistinguishable in the replica symmetric rs phase while they asymptotically differ in the replica symmetry breaking rsb phase in addition we seek for a relation to graph structure by investigating a similarity to bipartite graphs which exhibits a quantitative difference between the rs and rsb phase these results indicate the nontrivial relation of the typical computational cost of lp relaxation to the rsrsb phase transition as present in the spinglass theory of models on the corresponding random graph structure | [['the', 'distribution', 'of', 'the', 'computational', 'cost', 'of', 'linearprogramming', 'lp', 'relaxation', 'for', 'vertex', 'cover', 'problems', 'on', 'erdosrenyi', 'random', 'graphs', 'is', 'evaluated', 'by', 'using', 'the', 'rareevent', 'sampling', 'method', 'as', 'a', 'largedeviation', 'property', 'differences', 'of', 'the', 'distribution', 'for', 'easy', 'and', 'hard', 'problems', 'are', 'found', 'reflecting', 'the', 'hardness', 'of', 'approximation', 'by', 'lp', 'relaxation', 'in', 'particular', 'by', 'evaluating', 'the', 'total', 'variation', 'distance', 'between', 'conditional', 'distributions', 'with', 'respect', 'to', 'the', 'hardness', 'it', 'is', 'suggested', 'that', 'those', 'distributions', 'are', 'almost', 'indistinguishable', 'in', 'the', 'replica', 'symmetric', 'rs', 'phase', 'while', 'they', 'asymptotically', 'differ', 'in', 'the', 'replica', 'symmetry', 'breaking', 'rsb', 'phase', 'in', 'addition', 'we', 'seek', 'for', 'a', 'relation', 'to', 'graph', 'structure', 'by', 'investigating', 'a', 'similarity', 'to', 'bipartite', 'graphs', 'which', 'exhibits', 'a', 'quantitative', 'difference', 'between', 'the', 'rs', 'and', 'rsb', 'phase', 'these', 'results', 'indicate', 'the', 'nontrivial', 'relation', 'of', 'the', 'typical', 'computational', 'cost', 'of', 'lp', 'relaxation', 'to', 'the', 'rsrsb', 'phase', 'transition', 'as', 'present', 'in', 'the', 'spinglass', 'theory', 'of', 'models', 'on', 'the', 'corresponding', 'random', 'graph', 'structure']] | [-0.10280252001432114, 0.11778039117052685, -0.12174389912060608, 0.12449160499626917, -0.04616242522177728, -0.11744282805164785, 0.08249304322357363, 0.4168847921721049, -0.2865863456697154, -0.32063104278342125, 0.0995417163595496, -0.2750700712939234, -0.14877296106179097, 0.11544813782644556, -0.028550664220299376, 0.09574333771965221, 0.014902234864788816, 0.023686449355935973, -0.13203122916533366, -0.20230780254419906, 0.28955039364671775, 0.022975161322392523, 0.2939505784429218, 0.021624639789622865, 0.04179881274697101, 0.027180702508255643, 0.03555878031980492, 0.04319245617309781, -0.11996526169571696, 0.09644086671208865, 0.2498819539533351, 0.10562408071525983, 0.20878614082711897, -0.3708786986749864, -0.21172790545480033, 0.11536885273955322, 0.09634546524543303, 0.06854760494484492, -0.04338397436291225, -0.2454987930097176, 0.07845449062848561, -0.10758765000087135, -0.07645760884042829, -0.040773999898718966, 0.005035304544052403, 0.030045172670246468, -0.2631055041404723, 0.1073403715364341, 0.07559202679151081, 0.031567547602064316, -0.016334572149820526, -0.14305641857208684, -0.008798807329424707, 0.09433995502523, 0.052601200911388, 0.037238865357051655, 0.06851014679092546, -0.11100812324768508, -0.1589206060169473, 0.3869108589071977, -0.0163283574358119, -0.15540508340774595, 0.17115270474689742, -0.12376285754573091, -0.15194508048558705, 0.14400837371297376, 0.1456902302789355, 0.11064449439474724, -0.13315685130242186, 0.09983390799071028, -0.011387799227745026, 0.14564151637214787, 0.0541475677118318, 0.030766124196816236, 0.1250894056437047, 0.15239791397930516, 0.10412840964885331, 0.2115634307249964, -0.03882524246766575, -0.18443111666649775, -0.28286787826494364, -0.10325531243334378, -0.25732458888332504, 0.005063655433906733, -0.19268350378211166, -0.18765366911018072, 0.38678058280339955, 0.11406321607769075, 0.19812055334822568, 0.1364898430405638, 0.2265973063338989, 0.12120934836658355, 0.027293281764478275, 0.09811600117092512, 0.2228695111545293, 0.1648446670978477, 0.07154218769957017, -0.25904833488656503, 0.11877591458247289, 0.09477431486562923] |
1,802.02351 | Road Network Fusion for Incremental Map Updates | In the recent years a number of novel, automatic map-inference techniques
have been proposed, which derive road-network from a cohort of GPS traces
collected by a fleet of vehicles. In spite of considerable attention, these
maps are imperfect in many ways: they create an abundance of spurious
connections, have poor coverage, and are visually confusing. Hence, commercial
and crowd-sourced mapping services heavily use human annotation to minimize the
mapping errors. Consequently, their response to changes in the road network is
inevitably slow. In this paper we describe \mapfuse, a system which fuses a
human-annotated map (e.g., OpenStreetMap) with any automatically inferred map,
thus effectively enabling quick map updates. In addition to new road creation,
we study in depth road closure, which have not been examined in the past. By
leveraging solid, human-annotated maps with minor corrections, we derive maps
which minimize the trajectory matching errors due to both road network change
and imperfect map inference of fully-automatic approaches.
| cs.OH | in the recent years a number of novel automatic mapinference techniques have been proposed which derive roadnetwork from a cohort of gps traces collected by a fleet of vehicles in spite of considerable attention these maps are imperfect in many ways they create an abundance of spurious connections have poor coverage and are visually confusing hence commercial and crowdsourced mapping services heavily use human annotation to minimize the mapping errors consequently their response to changes in the road network is inevitably slow in this paper we describe mapfuse a system which fuses a humanannotated map eg openstreetmap with any automatically inferred map thus effectively enabling quick map updates in addition to new road creation we study in depth road closure which have not been examined in the past by leveraging solid humanannotated maps with minor corrections we derive maps which minimize the trajectory matching errors due to both road network change and imperfect map inference of fullyautomatic approaches | [['in', 'the', 'recent', 'years', 'a', 'number', 'of', 'novel', 'automatic', 'mapinference', 'techniques', 'have', 'been', 'proposed', 'which', 'derive', 'roadnetwork', 'from', 'a', 'cohort', 'of', 'gps', 'traces', 'collected', 'by', 'a', 'fleet', 'of', 'vehicles', 'in', 'spite', 'of', 'considerable', 'attention', 'these', 'maps', 'are', 'imperfect', 'in', 'many', 'ways', 'they', 'create', 'an', 'abundance', 'of', 'spurious', 'connections', 'have', 'poor', 'coverage', 'and', 'are', 'visually', 'confusing', 'hence', 'commercial', 'and', 'crowdsourced', 'mapping', 'services', 'heavily', 'use', 'human', 'annotation', 'to', 'minimize', 'the', 'mapping', 'errors', 'consequently', 'their', 'response', 'to', 'changes', 'in', 'the', 'road', 'network', 'is', 'inevitably', 'slow', 'in', 'this', 'paper', 'we', 'describe', 'mapfuse', 'a', 'system', 'which', 'fuses', 'a', 'humanannotated', 'map', 'eg', 'openstreetmap', 'with', 'any', 'automatically', 'inferred', 'map', 'thus', 'effectively', 'enabling', 'quick', 'map', 'updates', 'in', 'addition', 'to', 'new', 'road', 'creation', 'we', 'study', 'in', 'depth', 'road', 'closure', 'which', 'have', 'not', 'been', 'examined', 'in', 'the', 'past', 'by', 'leveraging', 'solid', 'humanannotated', 'maps', 'with', 'minor', 'corrections', 'we', 'derive', 'maps', 'which', 'minimize', 'the', 'trajectory', 'matching', 'errors', 'due', 'to', 'both', 'road', 'network', 'change', 'and', 'imperfect', 'map', 'inference', 'of', 'fullyautomatic', 'approaches']] | [-0.08734288562540037, 0.02607525371014701, -0.06410749850699761, 0.03507996162779297, -0.0960849653284368, -0.11077943792014983, 0.08422887470546493, 0.4221141229140436, -0.27086918606796556, -0.3623090462676089, 0.11816479155651419, -0.29502390418498287, -0.17409361209453433, 0.17829423084570345, -0.18933075270467217, 0.07591935196686773, 0.10868223318177614, 0.005562326397782393, -0.058222337060157135, -0.23626509054555042, 0.2820188397167927, 0.037529391088303485, 0.31373069804921083, 0.02974831373359419, 0.10327545051664265, -0.02270432303075317, -0.12402609803945205, 0.020611036508077173, -0.07611876508743046, 0.17364669498023733, 0.3008724307748163, 0.17971672298932437, 0.28397986087592164, -0.46089091190510684, -0.2528841095519768, 0.13609601796694043, 0.1287063659500786, 0.12676906125667464, -0.033647677136709686, -0.3510354147025734, 0.07493199346658246, -0.20583556612484916, -0.027625839329386948, -0.10167674709832189, 0.026418239352809396, 0.033294122406595926, -0.23193790343335005, -0.00022842358370685274, 0.01772012574016858, 0.11133970639810772, -0.010263942764882164, -0.049567617786674505, -0.007782971404142867, 0.23274434299154836, 0.035251179429743984, 0.052293187085906884, 0.15406982183966572, -0.15329879564292445, -0.09767835962609833, 0.36062075360826434, -0.027926830905578605, -0.17789190767220203, 0.18368728094657136, -0.06990592298246208, -0.1597073682892332, 0.15747191970218805, 0.23092548369287638, 0.06726211406569335, -0.222708081589288, 0.015268811849642924, -0.026231437546325623, 0.16198391481866217, 0.08201004962947006, 0.010388059490419639, 0.21489883774400623, 0.15181591521479948, 0.10541938372055709, 0.10920761628884668, -0.11346228562212389, -0.056970582478590735, -0.19364248768865444, -0.12226988919372937, -0.1213974030732895, -0.006270014695659321, -0.059398916273865, -0.17755978131536276, 0.3694907121618344, 0.21223766302132302, 0.22127675610612246, 0.061037811062114825, 0.3404878301806985, 0.04871453708452973, 0.09553532373118599, 0.08364280587163084, 0.17619655130410294, 0.03012500438174814, 0.12972189217826624, -0.16824941359056977, 0.12315224192719194, 0.015275193418370216] |
1,802.02352 | Wishart laws and variance function on homogeneous cones | We present a systematic study of Riesz measures and their natural exponential
families of Wishart laws on a homogeneous cone. We compute explicitly the
inverse of the mean map and the variance function of a Wishart exponential
family.
| math.ST stat.TH | we present a systematic study of riesz measures and their natural exponential families of wishart laws on a homogeneous cone we compute explicitly the inverse of the mean map and the variance function of a wishart exponential family | [['we', 'present', 'a', 'systematic', 'study', 'of', 'riesz', 'measures', 'and', 'their', 'natural', 'exponential', 'families', 'of', 'wishart', 'laws', 'on', 'a', 'homogeneous', 'cone', 'we', 'compute', 'explicitly', 'the', 'inverse', 'of', 'the', 'mean', 'map', 'and', 'the', 'variance', 'function', 'of', 'a', 'wishart', 'exponential', 'family']] | [-0.08061935468331764, 0.06682672738832862, -0.14519114027682103, 0.17271686649244083, -0.03606889151821011, -0.0503302660256036, 0.0584996038784371, 0.3564857154300338, -0.3107568323612213, -0.20379817613253468, 0.07628941984455052, -0.3007049844355175, -0.19555234610054054, 0.16154993732312792, -0.0678046053324483, 0.10540982012293841, -0.021926198007636948, 0.0036725842050815884, -0.15692417121394292, -0.21272372121089383, 0.38952951270498726, 0.04742927317458548, 0.2430055378936231, -0.018511027836020252, 0.1725748377410989, -0.014701940974000058, -0.09784560410403892, -0.0334387812885995, -0.20235008523358325, 0.18482652855240495, 0.15293289877866445, 0.11266529186334658, 0.27672354793666226, -0.31815348330296966, -0.1651729518841756, 0.27568551349012477, 0.09846784624479417, 0.015423528654010673, -0.02638854508251442, -0.240557515074646, 0.03512744209729135, -0.17994472796195432, -0.19554967982204338, -0.09050755281197398, 0.03443356417119503, 0.09574154861835077, -0.30345647586019414, 0.11120398673474004, 0.15023092004029373, 0.12078279028891732, -0.041440879582966626, -0.1666846322876058, 0.060687525124338115, 0.05276670957621383, 0.047477135581797676, -0.08229091000669685, 0.10799504333714906, -0.05486047601229266, -0.10533209199140976, 0.3065569968694993, -0.08623668061275232, -0.24850364318607668, 0.08884729153329604, -0.19714117996198566, -0.09094562224651638, 0.07304683817844641, 0.24874325518153215, 0.1456513160251473, -0.16032349033967444, 0.16520937427719073, -0.08947067411224309, 0.08011070702617105, 0.03098799467184826, 0.0002202328637634453, 0.1304538653869378, 0.07269649531104062, 0.11926954506749385, 0.21110622182880578, -0.042737979509279524, -0.14794033040341578, -0.3558722745235029, -0.2164513614567879, -0.22077252196246072, 0.13841468522839837, -0.19961507027083394, -0.2948620261526422, 0.47394690652819055, 0.02525521921435077, 0.20685890581654875, 0.1687648477106306, 0.17893895075509422, 0.1766801791167573, -0.007607510601366429, 0.023465019866355425, 0.10306155549264268, 0.19522594859652026, 0.030207321525698428, -0.19496982603480942, 0.027674291189453613, 0.1113173147957576] |
1,802.02353 | Recent Advances in Neural Program Synthesis | In recent years, deep learning has made tremendous progress in a number of
fields that were previously out of reach for artificial intelligence. The
successes in these problems has led researchers to consider the possibilities
for intelligent systems to tackle a problem that humans have only recently
themselves considered: program synthesis. This challenge is unlike others such
as object recognition and speech translation, since its abstract nature and
demand for rigor make it difficult even for human minds to attempt. While it is
still far from being solved or even competitive with most existing methods,
neural program synthesis is a rapidly growing discipline which holds great
promise if completely realized. In this paper, we start with exploring the
problem statement and challenges of program synthesis. Then, we examine the
fascinating evolution of program induction models, along with how they have
succeeded, failed and been reimagined since. Finally, we conclude with a
contrastive look at program synthesis and future research recommendations for
the field.
| cs.AI cs.PL | in recent years deep learning has made tremendous progress in a number of fields that were previously out of reach for artificial intelligence the successes in these problems has led researchers to consider the possibilities for intelligent systems to tackle a problem that humans have only recently themselves considered program synthesis this challenge is unlike others such as object recognition and speech translation since its abstract nature and demand for rigor make it difficult even for human minds to attempt while it is still far from being solved or even competitive with most existing methods neural program synthesis is a rapidly growing discipline which holds great promise if completely realized in this paper we start with exploring the problem statement and challenges of program synthesis then we examine the fascinating evolution of program induction models along with how they have succeeded failed and been reimagined since finally we conclude with a contrastive look at program synthesis and future research recommendations for the field | [['in', 'recent', 'years', 'deep', 'learning', 'has', 'made', 'tremendous', 'progress', 'in', 'a', 'number', 'of', 'fields', 'that', 'were', 'previously', 'out', 'of', 'reach', 'for', 'artificial', 'intelligence', 'the', 'successes', 'in', 'these', 'problems', 'has', 'led', 'researchers', 'to', 'consider', 'the', 'possibilities', 'for', 'intelligent', 'systems', 'to', 'tackle', 'a', 'problem', 'that', 'humans', 'have', 'only', 'recently', 'themselves', 'considered', 'program', 'synthesis', 'this', 'challenge', 'is', 'unlike', 'others', 'such', 'as', 'object', 'recognition', 'and', 'speech', 'translation', 'since', 'its', 'abstract', 'nature', 'and', 'demand', 'for', 'rigor', 'make', 'it', 'difficult', 'even', 'for', 'human', 'minds', 'to', 'attempt', 'while', 'it', 'is', 'still', 'far', 'from', 'being', 'solved', 'or', 'even', 'competitive', 'with', 'most', 'existing', 'methods', 'neural', 'program', 'synthesis', 'is', 'a', 'rapidly', 'growing', 'discipline', 'which', 'holds', 'great', 'promise', 'if', 'completely', 'realized', 'in', 'this', 'paper', 'we', 'start', 'with', 'exploring', 'the', 'problem', 'statement', 'and', 'challenges', 'of', 'program', 'synthesis', 'then', 'we', 'examine', 'the', 'fascinating', 'evolution', 'of', 'program', 'induction', 'models', 'along', 'with', 'how', 'they', 'have', 'succeeded', 'failed', 'and', 'been', 'reimagined', 'since', 'finally', 'we', 'conclude', 'with', 'a', 'contrastive', 'look', 'at', 'program', 'synthesis', 'and', 'future', 'research', 'recommendations', 'for', 'the', 'field']] | [-0.037354587082877574, 0.059915622851500906, -0.07001985532208634, 0.05682507970077158, -0.1469339495352297, -0.20022468556603992, 0.0258495871999508, 0.4344743342312372, -0.27981336075413027, -0.36113377978894456, 0.1501124473813243, -0.2601037523076858, -0.191171493928845, 0.22422348016177385, -0.1128160677789883, 0.1106344085063837, 0.11276402547567461, 0.023926728008383955, -0.025460520455251552, -0.3074804370673833, 0.2780478211050784, 0.03924040954087912, 0.2764750764328687, 0.02832187653409984, 0.09133620332656313, -0.024650209027494846, -0.021310987700147693, 0.022948092063112806, -0.06516100048728181, 0.1577383253966274, 0.3445852561174063, 0.23259321461793864, 0.37650389899212267, -0.46767300904303055, -0.24879079457533396, 0.12427917899805363, 0.1558372481980499, 0.15586057946985635, -0.10841018639872839, -0.2607063013071447, 0.0763751188617194, -0.164946144271389, -0.10061230474830042, -0.09544283204229066, 0.07510678774036214, -0.045221132828486096, -0.17104936782615604, -0.04362708588280244, 0.0910455159042433, 0.10046985806799551, -0.03218399608050714, -0.14341669606855484, 0.050042500042494525, 0.16328726868564838, 0.08941347789620106, 0.07579828329660275, 0.06744414701321978, -0.21409493817855824, -0.14778571489933925, 0.37937646240777806, 0.001997134899418732, -0.14752576018562885, 0.23123648287699683, -0.07810926940407098, -0.23058518089848445, 0.0836677695825742, 0.18115296052987284, 0.09938171726111093, -0.1719765265006572, 0.10225770682963128, -0.024045943489505187, 0.14945089749569349, 0.0399167121367897, -0.008798016298470306, 0.28020187995661006, 0.22431169186120875, 0.04508438012217758, 0.10013957158662379, -0.01892303591766567, -0.06918867291411224, -0.16087799693492275, -0.13382607426229912, -0.12306298552379932, 0.02880096659179271, 0.06271253634335108, -0.1054691550836404, 0.3529087686523174, 0.21351032717337395, 0.13686768002923072, 0.0738329452920251, 0.29804877828113896, 0.0613473697686223, 0.11819364611967755, 0.0700145287203522, 0.26556625690549773, 0.045943473912718025, 0.17829963244227579, -0.14721931292701307, 0.11338493093290584, -0.01079687527179672] |
1,802.02354 | On fractional Hardy inequalities in convex sets | We prove a Hardy inequality on convex sets, for fractional
Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the
fact that in a convex set the distance from the boundary is a superharmonic
function, in a suitable sense. The result holds for every $1<p<\infty$ and
$0<s<1$, with a constant which is stable as $s$ goes to $1$.
| math.AP math.FA | we prove a hardy inequality on convex sets for fractional sobolevslobodeckiui spaces of order sp the proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function in a suitable sense the result holds for every 1pinfty and 0s1 with a constant which is stable as s goes to 1 | [['we', 'prove', 'a', 'hardy', 'inequality', 'on', 'convex', 'sets', 'for', 'fractional', 'sobolevslobodeckiui', 'spaces', 'of', 'order', 'sp', 'the', 'proof', 'is', 'based', 'on', 'the', 'fact', 'that', 'in', 'a', 'convex', 'set', 'the', 'distance', 'from', 'the', 'boundary', 'is', 'a', 'superharmonic', 'function', 'in', 'a', 'suitable', 'sense', 'the', 'result', 'holds', 'for', 'every', '1pinfty', 'and', '0s1', 'with', 'a', 'constant', 'which', 'is', 'stable', 'as', 's', 'goes', 'to', '1']] | [-0.12757597942599805, 0.07588320059733371, -0.09488605890991324, 0.08906072400060434, -0.05895839484755771, -0.12378850341695598, 0.03850894813599475, 0.32895001939545243, -0.3232496553810976, -0.16259971629607223, 0.15068725892342627, -0.28803017388208435, -0.11510237486306894, 0.24254790945294297, -0.11404776647371256, 0.05549520872912164, 0.04851910805179722, 0.0699022025248762, -0.06978480295293917, -0.22053629169398445, 0.3857518373278238, -0.119901096906071, 0.18929229402062248, 0.08457101723652775, 0.10530774153263892, 0.015548716196632487, 0.05609105760231614, 0.02412640382890921, -0.18163409477587636, 0.15609221036991863, 0.21063193643339356, 0.10864988442557721, 0.37266036476624215, -0.3221379474838367, -0.17487823428049432, 0.15567664941772819, 0.06947280987465786, -0.005555262578004119, -0.016540437250129752, -0.26733326246583106, 0.10460573690548791, -0.047955040188537815, -0.15708382629742057, -0.03683226486131296, 0.08292428577729201, 0.046434329222824616, -0.4016721496137522, 0.062282421720861375, 0.12406151530222367, 0.0020190312890178068, -0.13650904387488202, -0.11619514617595379, -0.009135802485585466, 0.04085455072443869, 0.005277227835287735, 0.15036705483966586, 0.051435092202648205, -0.014236288003118361, -0.10613976640161127, 0.3560766095011416, -0.08046633255533811, -0.25270519904413463, 0.14173422599511254, -0.16516061340285054, -0.11049271487015283, 0.04139999382324138, 0.09079938566596327, 0.17764473046665474, -0.06000656972765544, 0.20686199556211388, -0.11089735970461458, 0.15354416257370326, 0.10921452295477108, 0.03801176778309173, 0.05315099306152028, 0.14876917758325148, 0.25001914425105864, 0.13073506073678953, -0.03487083524582963, -0.0419262723979477, -0.39295192706888005, -0.20318236191741237, -0.2561756325096397, 0.10342117261646663, -0.12217894937597429, -0.1866344736920575, 0.31795031829910764, 0.05146410908171181, 0.18692461181218908, 0.14355936599303415, 0.21831148869152797, 0.12520159908468734, 0.031606492393066066, 0.09714619800353706, 0.17721309260291568, 0.1313778948299271, 0.0738820508595998, -0.11387460530830264, 0.044188667428127285, 0.17950024484198981] |
1,802.02355 | On the influence of gravity on density-dependent incompressible periodic
fluids | The present work is devoted to the analysis of density-dependent,
incompressible fluids in a 3D torus, when the Froude number $\varepsilon$ goes
to zero. We consider the very general case where the initial data do not have a
zero horizontal average, where we only have smoothing effect on the velocity
but not on the density and where we can have resonant phenomena on the domain.
We explicitly determine the limit system when $\varepsilon \to 0$ and prove its
global wellposedness. Finally, we prove that for large initial data, the
density-dependent, incompressible fluid system is globally wellposed, provided
that $\varepsilon$ is small enough.
| math.AP | the present work is devoted to the analysis of densitydependent incompressible fluids in a 3d torus when the froude number varepsilon goes to zero we consider the very general case where the initial data do not have a zero horizontal average where we only have smoothing effect on the velocity but not on the density and where we can have resonant phenomena on the domain we explicitly determine the limit system when varepsilon to 0 and prove its global wellposedness finally we prove that for large initial data the densitydependent incompressible fluid system is globally wellposed provided that varepsilon is small enough | [['the', 'present', 'work', 'is', 'devoted', 'to', 'the', 'analysis', 'of', 'densitydependent', 'incompressible', 'fluids', 'in', 'a', '3d', 'torus', 'when', 'the', 'froude', 'number', 'varepsilon', 'goes', 'to', 'zero', 'we', 'consider', 'the', 'very', 'general', 'case', 'where', 'the', 'initial', 'data', 'do', 'not', 'have', 'a', 'zero', 'horizontal', 'average', 'where', 'we', 'only', 'have', 'smoothing', 'effect', 'on', 'the', 'velocity', 'but', 'not', 'on', 'the', 'density', 'and', 'where', 'we', 'can', 'have', 'resonant', 'phenomena', 'on', 'the', 'domain', 'we', 'explicitly', 'determine', 'the', 'limit', 'system', 'when', 'varepsilon', 'to', '0', 'and', 'prove', 'its', 'global', 'wellposedness', 'finally', 'we', 'prove', 'that', 'for', 'large', 'initial', 'data', 'the', 'densitydependent', 'incompressible', 'fluid', 'system', 'is', 'globally', 'wellposed', 'provided', 'that', 'varepsilon', 'is', 'small', 'enough']] | [-0.16223143861747766, 0.12569331598705522, -0.07915008489005998, 0.048160928848208676, -0.055522285091380276, -0.15439076429945142, 0.0012098797071980788, 0.3206574447343455, -0.2663405264782555, -0.2696206401668343, 0.13935591781616904, -0.2706408763039565, -0.09527602682218832, 0.1506579175931584, -0.05982273759311248, 0.06652389043958072, 0.06725250452062954, 0.050549042150926066, -0.028117206011551852, -0.23491579667875068, 0.373527870475835, -0.028049818897510275, 0.24931485916478743, 0.05568292947924312, 0.12050145842801488, -0.04684344100122176, 0.03665517463677508, 0.05694241105469272, -0.22432101966756712, 0.0030418001012602713, 0.2137958304682637, 0.021912792304932486, 0.3026787486548225, -0.4458121507446848, -0.20845468380652807, 0.13067576428875327, 0.18457477814837486, 0.14247922432453683, -0.00022982352175841144, -0.2294463255218979, 0.13501642125558255, -0.12957641429406352, -0.15203386360742882, -0.10571901916581042, 0.08596900821316476, 0.04994148353808651, -0.28105965064491567, 0.09714639229773014, 0.07878003423056547, 0.052184637298113574, -0.12120734260065992, -0.08417964609243962, -0.02925462487573717, 0.11282739175458475, 0.09816028243136209, 0.02900797034403784, 0.07819575027051363, -0.14077113168861935, 0.04399350800439624, 0.37490725327926855, -0.11067566414210744, -0.2950413469225168, 0.2058619712251147, -0.2019665950690122, -0.11584915169606022, 0.09782305246620786, 0.20450009769011362, 0.14320214940965467, -0.06052696535634288, 0.14851253935679173, -0.09191664653104346, 0.18793577338824524, 0.021676203537294093, -0.035093390640195496, 0.10199839587085972, 0.14619579189457, 0.13252210498367453, 0.09454789313980762, -0.1267261550397676, -0.05973587219384225, -0.3363889483552353, -0.12460408971402977, -0.2169877634949836, 0.0815939036778325, -0.06910062788422995, -0.17309643751850315, 0.3076007535096769, 0.16695639128595882, 0.19953595730932613, 0.08897880143594389, 0.28608147838317294, 0.1452488424256444, -0.004052872427136582, 0.12672534438452737, 0.25843966914815647, 0.09050843673849515, 0.13464600854443715, -0.2114110186641269, 0.04124035124265242, 0.06051750597315749] |
1,802.02356 | On Strichartz estimates for a dispersion modulated by a time-dependent
deterministic noise | We address the Cauchy problem for a nonlinear Schr{\"o}dinger equation where
the dispersion is modulated by a deterministic noise. The noise is understood
as the derivative of a self-affine function of order H $\in$ (0, 1). Due to the
self-similarity of the noise, we obtain modified Strichartz estimates which
enables us to prove the global well-posedness of the equation for
L2-supercritical nonlinearities. This is an occurence of regularization by
noise in a purely deterministic context.
| math.AP | we address the cauchy problem for a nonlinear schrodinger equation where the dispersion is modulated by a deterministic noise the noise is understood as the derivative of a selfaffine function of order h in 0 1 due to the selfsimilarity of the noise we obtain modified strichartz estimates which enables us to prove the global wellposedness of the equation for l2supercritical nonlinearities this is an occurence of regularization by noise in a purely deterministic context | [['we', 'address', 'the', 'cauchy', 'problem', 'for', 'a', 'nonlinear', 'schrodinger', 'equation', 'where', 'the', 'dispersion', 'is', 'modulated', 'by', 'a', 'deterministic', 'noise', 'the', 'noise', 'is', 'understood', 'as', 'the', 'derivative', 'of', 'a', 'selfaffine', 'function', 'of', 'order', 'h', 'in', '0', '1', 'due', 'to', 'the', 'selfsimilarity', 'of', 'the', 'noise', 'we', 'obtain', 'modified', 'strichartz', 'estimates', 'which', 'enables', 'us', 'to', 'prove', 'the', 'global', 'wellposedness', 'of', 'the', 'equation', 'for', 'l2supercritical', 'nonlinearities', 'this', 'is', 'an', 'occurence', 'of', 'regularization', 'by', 'noise', 'in', 'a', 'purely', 'deterministic', 'context']] | [-0.1365876870478193, 0.05843869156689228, -0.09035281574198355, 0.11511591944222649, -0.08784009092176955, -0.11900852347413698, -0.01597928779820601, 0.279169124464194, -0.3326109326134125, -0.21312531312306723, 0.12513405330168703, -0.27731766251226264, -0.17203946591665348, 0.14619635042346393, -0.09442827738666286, 0.10514649583026767, -0.01634704483052095, -0.008202147906025251, -0.06836636029804746, -0.21184351269776622, 0.36588331567744414, -0.012355821765959263, 0.19693725197265546, -0.00032082099467515944, 0.12200120051701864, -0.002478498329098026, -0.01150298730780681, -0.0208526945921282, -0.17930061274208128, 0.06844879666188111, 0.18916053739686808, 0.01943350941874087, 0.345557626641045, -0.38804005379478135, -0.2724765659372012, 0.13295595768839122, 0.13496706663320462, 0.13486479945946483, -0.01267192161642015, -0.3250991368852556, 0.05397434857363502, -0.0895491977284352, -0.19232531724808116, -0.06644882841656606, 0.0292234289397796, 0.04823414550473293, -0.35493498284369707, 0.17158018016256393, 0.13785783057411513, -0.007723930329084396, -0.11225896346072356, -0.030965134960909683, 0.02110642890135447, 0.051759348089496296, 0.019172868781412642, 0.026633387319743632, 0.013304613133271536, -0.16113698469785354, -0.08370166486750047, 0.36972379152973495, -0.13161464888136834, -0.27278129015117886, 0.110254629496485, -0.13474164873361588, -0.08841225763161976, 0.13040532152602585, 0.17108144780620932, 0.09846128003050883, -0.17483376208692789, 0.15290012765054903, -0.0027978634027143318, 0.18842127037545045, 0.08940033915142219, 0.02081834270308415, 0.046291699707508085, 0.17284374549984932, 0.15781942568719387, 0.16103518966585398, -0.06978885950598245, -0.03747013875593742, -0.3313732460513711, -0.1335986764729023, -0.1990165115892887, 0.13041481806586186, -0.11234963075568279, -0.1972425970559319, 0.39043908988436066, 0.16992289766669275, 0.1830690513799588, 0.0783975116799896, 0.26528355409080784, 0.24986103907072296, -0.021406994772454103, 0.03837393562619885, 0.2094163925262789, 0.17151696875380973, 0.14073313927898803, -0.23551733748676876, 0.046909574288874864, 0.1092142678052187] |
1,802.02357 | Clustering in complex ionic liquids in two dimensions | Two-dimensional ionic liquids with single site anion and cation-neutral dimer
are studied by computer simulations and integral equation techniques, with the
aim of characterizing differences with single site anion-cation mixtures, and
also with three dimensional equivalents of both models, in order to see the
competition between the Coulomb interactions and the clustering restrictions
due to reduced dimension. We find that the addition of the neutral site to the
cation suppresses the liquid-gas transition which occurs in the case of the
monomeric Coulomb system. Instead, bilayer membrane type ordering is found at
low temperatures. The agreement between the structural correlations predicted
by theory and the simulation is excellent until very close to the no-solution
region predicted by the theory. These findings suggest various relations
between the nature of the clustering at low temperatures, and the inability of
the theory to enter this region
| physics.chem-ph cond-mat.soft | twodimensional ionic liquids with single site anion and cationneutral dimer are studied by computer simulations and integral equation techniques with the aim of characterizing differences with single site anioncation mixtures and also with three dimensional equivalents of both models in order to see the competition between the coulomb interactions and the clustering restrictions due to reduced dimension we find that the addition of the neutral site to the cation suppresses the liquidgas transition which occurs in the case of the monomeric coulomb system instead bilayer membrane type ordering is found at low temperatures the agreement between the structural correlations predicted by theory and the simulation is excellent until very close to the nosolution region predicted by the theory these findings suggest various relations between the nature of the clustering at low temperatures and the inability of the theory to enter this region | [['twodimensional', 'ionic', 'liquids', 'with', 'single', 'site', 'anion', 'and', 'cationneutral', 'dimer', 'are', 'studied', 'by', 'computer', 'simulations', 'and', 'integral', 'equation', 'techniques', 'with', 'the', 'aim', 'of', 'characterizing', 'differences', 'with', 'single', 'site', 'anioncation', 'mixtures', 'and', 'also', 'with', 'three', 'dimensional', 'equivalents', 'of', 'both', 'models', 'in', 'order', 'to', 'see', 'the', 'competition', 'between', 'the', 'coulomb', 'interactions', 'and', 'the', 'clustering', 'restrictions', 'due', 'to', 'reduced', 'dimension', 'we', 'find', 'that', 'the', 'addition', 'of', 'the', 'neutral', 'site', 'to', 'the', 'cation', 'suppresses', 'the', 'liquidgas', 'transition', 'which', 'occurs', 'in', 'the', 'case', 'of', 'the', 'monomeric', 'coulomb', 'system', 'instead', 'bilayer', 'membrane', 'type', 'ordering', 'is', 'found', 'at', 'low', 'temperatures', 'the', 'agreement', 'between', 'the', 'structural', 'correlations', 'predicted', 'by', 'theory', 'and', 'the', 'simulation', 'is', 'excellent', 'until', 'very', 'close', 'to', 'the', 'nosolution', 'region', 'predicted', 'by', 'the', 'theory', 'these', 'findings', 'suggest', 'various', 'relations', 'between', 'the', 'nature', 'of', 'the', 'clustering', 'at', 'low', 'temperatures', 'and', 'the', 'inability', 'of', 'the', 'theory', 'to', 'enter', 'this', 'region']] | [-0.08732279435997563, 0.16092218111402223, -0.031418900513173344, 0.0620939990414107, 0.038402109460106915, -0.14588446346377687, 0.061989144655776075, 0.3423068893674229, -0.2680683329900993, -0.34166295968794397, 0.030754813583501215, -0.32119775442406534, -0.15175749199198826, 0.11157463621680758, 0.05405687555030454, -0.022417557898110577, -0.0022685462376102806, 0.01583768112468533, -0.10849143116834707, -0.21870693578551123, 0.2983254289487377, 0.08840659072489611, 0.30081205634799385, 0.09606026660019, 0.061241086581555595, -0.00857266817807353, 0.029950403408812627, 0.037966776240084855, -0.17447855230945736, 0.10089566111730944, 0.2425801347853069, -0.03325812203111127, 0.215900429911978, -0.4363196897719588, -0.20234592653578148, 0.06240489844266059, 0.11913040070046138, 0.1305030698979473, -0.04356458374033017, -0.2574459188068951, 0.044372472630597515, -0.15001536038388233, -0.12794366394103104, -0.04754996490207434, 0.00756831908199404, 0.03959285870036443, -0.23131905528716742, 0.1293791561634862, 0.028579205055055873, 0.054019492767318815, -0.08806260471298759, -0.10883038283708239, -0.07205457620605427, 0.1304945238799389, 0.05593542499783715, 0.013372560344370349, 0.13618321967577296, -0.15611303801150436, -0.07630301803749587, 0.40430590354371815, -0.03256842589305182, -0.1273949695618025, 0.2835555764048227, -0.19612054483233285, -0.10036997530343277, 0.16368937808687667, 0.09117980495627437, 0.06775299367540616, -0.11170785839536361, 0.0633962908373048, 0.012468070126072104, 0.1668398148995558, 0.04069697068937655, 0.008892954283458364, 0.2297637987382976, 0.15660186199072215, -0.004171295018334474, 0.14168397807682465, -0.10902856897196865, -0.14798881125337046, -0.23762820214033126, -0.10971375813907279, -0.16357145657363747, -0.02669475545907127, -0.09910169716729017, -0.14034068411814848, 0.3288891955000249, 0.1350530522056423, 0.1920269900034847, 0.004543635432907779, 0.21965390371374918, 0.09916113037616014, 0.056591689250698046, 0.007105447608046234, 0.24841658185385831, 0.16063274665835447, 0.11011096435998168, -0.28546489880370374, 0.07684407808119431, 0.07892818681762687] |
1,802.02358 | Adaptive transform via quantum signal processing: application to signal
and image denoising | The main scope of this paper is to show how tools from quantum mechanics, in
particular the Schroedinger equation, can be used to construct an adaptive
transform suitable for signal and image processing applications. The proposed
dictionary is obtained by considering the signal or image as a discrete
potential in Schroedinger equation, further used to construct the Hamiltonien
operator. In order to illustrate its practical interest in signal and image
processing, we provide denoising results in the case of signal-dependent noise,
which is the noise type the most adapted to the proposed approach.
| eess.SP | the main scope of this paper is to show how tools from quantum mechanics in particular the schroedinger equation can be used to construct an adaptive transform suitable for signal and image processing applications the proposed dictionary is obtained by considering the signal or image as a discrete potential in schroedinger equation further used to construct the hamiltonien operator in order to illustrate its practical interest in signal and image processing we provide denoising results in the case of signaldependent noise which is the noise type the most adapted to the proposed approach | [['the', 'main', 'scope', 'of', 'this', 'paper', 'is', 'to', 'show', 'how', 'tools', 'from', 'quantum', 'mechanics', 'in', 'particular', 'the', 'schroedinger', 'equation', 'can', 'be', 'used', 'to', 'construct', 'an', 'adaptive', 'transform', 'suitable', 'for', 'signal', 'and', 'image', 'processing', 'applications', 'the', 'proposed', 'dictionary', 'is', 'obtained', 'by', 'considering', 'the', 'signal', 'or', 'image', 'as', 'a', 'discrete', 'potential', 'in', 'schroedinger', 'equation', 'further', 'used', 'to', 'construct', 'the', 'hamiltonien', 'operator', 'in', 'order', 'to', 'illustrate', 'its', 'practical', 'interest', 'in', 'signal', 'and', 'image', 'processing', 'we', 'provide', 'denoising', 'results', 'in', 'the', 'case', 'of', 'signaldependent', 'noise', 'which', 'is', 'the', 'noise', 'type', 'the', 'most', 'adapted', 'to', 'the', 'proposed', 'approach']] | [-0.019342285813763738, -0.021038621581639112, -0.10392671681778587, 0.060425477049252746, -0.0834139754044135, -0.13235930475892257, -0.03713338754934502, 0.3750796463623967, -0.320003862347221, -0.2649559073109666, 0.1412291695381535, -0.24650312802227942, -0.221821042944414, 0.21845213644479847, -0.14155226485277322, 0.11152644309217778, 0.054246193506633456, 0.07433770962961717, -0.045757739840115864, -0.2478894869715947, 0.290448912743317, 0.05029881559691959, 0.2897519840499508, 0.004232845385558903, 0.08841049674210018, 0.004900877045103065, -0.03733795289071682, -0.035100079546480076, -0.0788520224513891, 0.13461495437102555, 0.3183433029638684, 0.16938055515208322, 0.2773446277360958, -0.42928363299807126, -0.2562381645421619, 0.119280406987578, 0.14679405739045012, 0.12976541543131412, -0.10617535564360088, -0.3448157452385994, 0.0860572411759716, -0.11848802144801163, -0.08763201980669376, -0.10890393307351548, -0.02158936856152571, -0.004376932654691779, -0.30624547313250927, 0.06136515616115345, 0.08018833192308313, -0.02648477905186946, -0.05763797300903167, -0.07650217982312746, 0.04674213761767453, 0.12051618374307113, 0.007952425074662366, 0.04005591364061136, 0.11593705123168943, -0.11977860909815796, -0.12735174873175667, 0.4243928485185556, -0.08607879328748981, -0.2743305162445683, 0.15445350139887762, -0.08454865502173324, -0.12037467651332365, 0.08585434406995773, 0.19961970826894368, 0.0742324978194159, -0.17525933984206463, 0.0980759207855242, 0.04346166542508518, 0.17248016043120754, 0.05011646178773726, 0.0343887394334635, 0.11099347959110595, 0.16225061358873855, 0.06886403202382929, 0.19436138198311118, -0.11474992658401353, -0.06064510120726798, -0.2962538192210638, -0.15128898626679313, -0.24716370395364481, 0.016348549707681344, -0.0826766311197982, -0.122203154631121, 0.4133941295516232, 0.24847065978784763, 0.16323469117607758, 0.0024183435408580726, 0.32198932681880565, 0.18040973766904284, 0.04317645859175726, 0.016138020341041618, 0.18247302761301398, 0.158899057891888, 0.131817447377216, -0.1823604048619492, -0.01853489258286098, 0.06605528690852225] |
1,802.02359 | New Use Cases for Snort: Cloud and Mobile Environments | First, this case study explores an Intrusion Detection System package called
Snort (provided by Cisco Systems) in a cloud environment. Snort is an open
source and highly scalable signature-based intrusion detection system. Here,
Snort is deployed on Ubuntu Server 16.0.4 running on a virtual machine within a
Microsoft Azure cloud system. This paper provides details on installing Snort
on the virtual machine and configuring it for intrusion detection. The
architecture here is based on a VM integrated IDS on Azure and demonstrates how
a VM instance in the cloud can be secured through an IDS. Firewalls may be
considered the first line of defense but they fail to secure systems from
inside attacks. Next, two other areas (where Snort is less widely used) are
briefly explored, namely library systems and mobile devices. Finally, this
paper makes further recommendations on how a cloud network can be secured by
distributed placement of the IDS and on each VM instances.
| cs.CR | first this case study explores an intrusion detection system package called snort provided by cisco systems in a cloud environment snort is an open source and highly scalable signaturebased intrusion detection system here snort is deployed on ubuntu server 1604 running on a virtual machine within a microsoft azure cloud system this paper provides details on installing snort on the virtual machine and configuring it for intrusion detection the architecture here is based on a vm integrated ids on azure and demonstrates how a vm instance in the cloud can be secured through an ids firewalls may be considered the first line of defense but they fail to secure systems from inside attacks next two other areas where snort is less widely used are briefly explored namely library systems and mobile devices finally this paper makes further recommendations on how a cloud network can be secured by distributed placement of the ids and on each vm instances | [['first', 'this', 'case', 'study', 'explores', 'an', 'intrusion', 'detection', 'system', 'package', 'called', 'snort', 'provided', 'by', 'cisco', 'systems', 'in', 'a', 'cloud', 'environment', 'snort', 'is', 'an', 'open', 'source', 'and', 'highly', 'scalable', 'signaturebased', 'intrusion', 'detection', 'system', 'here', 'snort', 'is', 'deployed', 'on', 'ubuntu', 'server', '1604', 'running', 'on', 'a', 'virtual', 'machine', 'within', 'a', 'microsoft', 'azure', 'cloud', 'system', 'this', 'paper', 'provides', 'details', 'on', 'installing', 'snort', 'on', 'the', 'virtual', 'machine', 'and', 'configuring', 'it', 'for', 'intrusion', 'detection', 'the', 'architecture', 'here', 'is', 'based', 'on', 'a', 'vm', 'integrated', 'ids', 'on', 'azure', 'and', 'demonstrates', 'how', 'a', 'vm', 'instance', 'in', 'the', 'cloud', 'can', 'be', 'secured', 'through', 'an', 'ids', 'firewalls', 'may', 'be', 'considered', 'the', 'first', 'line', 'of', 'defense', 'but', 'they', 'fail', 'to', 'secure', 'systems', 'from', 'inside', 'attacks', 'next', 'two', 'other', 'areas', 'where', 'snort', 'is', 'less', 'widely', 'used', 'are', 'briefly', 'explored', 'namely', 'library', 'systems', 'and', 'mobile', 'devices', 'finally', 'this', 'paper', 'makes', 'further', 'recommendations', 'on', 'how', 'a', 'cloud', 'network', 'can', 'be', 'secured', 'by', 'distributed', 'placement', 'of', 'the', 'ids', 'and', 'on', 'each', 'vm', 'instances']] | [-0.19439342330287027, -0.01606013548790676, -0.04581291492061488, 0.007444836765788733, -0.05727787729601856, -0.23820471285010397, 0.09121249327999628, 0.3876294136658358, -0.23376328193517343, -0.3095868989754065, 0.1703950515191907, -0.27400156811983056, -0.14577596512093702, 0.2557646007674515, -0.11676581927047223, 0.06668542819038319, 0.06858655743917842, 0.048950175857052775, 0.0585172934269319, -0.29787672663427844, 0.3190288375566304, 0.07405049742976572, 0.30463599583881484, 0.10903807145478145, 0.04622709179581825, -0.010368557808517366, -0.02608949393271261, -0.027778101431733815, -0.010688092749399743, 0.1384255999616187, 0.2967469404528665, 0.2510167166418663, 0.29567072904226815, -0.41906980317750364, -0.1562522566568842, 0.0409323952611607, 0.19523115465298865, 0.04522522672370171, -0.05118378966744206, -0.3720170151676603, 0.14342522004969227, -0.2862558034841849, -0.06311013816793191, -0.06268495282715862, 0.03390705714797138, 0.033472040143675885, -0.1972239349648404, -0.1000422752791553, -0.04711699481329815, 0.06908239999928387, -0.05075687381105607, -0.06813052637653817, 0.06002491574354802, 0.12133041399703094, -0.08571374829217887, 0.013300305473392794, 0.25366727532937555, -0.12446483676425614, -0.15662887425511884, 0.39693605562577106, -0.02230789229180367, -0.1653115931515742, 0.23346354347315562, 0.0927190872452038, -0.19319095267398154, 0.04117694913534222, 0.2867332036150204, 0.1112375119671368, -0.23245614226966813, 0.03494031937714298, -0.030206448149016116, 0.2265170576432008, 0.012862284690034902, -0.02159042855143357, 0.21014338352118328, 0.25211004414566, 0.08628326465592981, 0.135057281778019, -0.13370590540404345, -0.06941385738326201, -0.20884434196647186, -0.19902988722114853, -0.20166747615476893, -0.0004939459365122257, -0.01067624653933887, -0.1405025946390133, 0.33438754310107727, 0.23005823328405928, 0.11160792745976074, 0.012564104743699312, 0.4149185065358023, 0.05063900262544489, 0.13354552194926958, 0.19146092921854324, 0.17599479940713972, -0.04955870441196688, 0.2015272964201393, -0.13550041809049287, 0.12937764463364887, 0.01259261020310935] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.