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.0396 | Large deviations for the maximum of a branching random walk | We consider real-valued branching random walks and prove a large deviation
result for the position of the rightmost particle. The position of the
rightmost particle is the maximum of a collection of a random number of
dependent random walks. We characterise the rate function as the solution of a
variational problem. We consider the same random number of independent random
walks, and show that the maximum of the branching random walk is dominated by
the maximum of the independent random walks. For the maximum of independent
random walks, we derive a large deviation principle as well. It turns out that
the rate functions for upper large deviations coincide, but in general the rate
functions for lower large deviations do not.
| math.PR | we consider realvalued branching random walks and prove a large deviation result for the position of the rightmost particle the position of the rightmost particle is the maximum of a collection of a random number of dependent random walks we characterise the rate function as the solution of a variational problem we consider the same random number of independent random walks and show that the maximum of the branching random walk is dominated by the maximum of the independent random walks for the maximum of independent random walks we derive a large deviation principle as well it turns out that the rate functions for upper large deviations coincide but in general the rate functions for lower large deviations do not | [['we', 'consider', 'realvalued', 'branching', 'random', 'walks', 'and', 'prove', 'a', 'large', 'deviation', 'result', 'for', 'the', 'position', 'of', 'the', 'rightmost', 'particle', 'the', 'position', 'of', 'the', 'rightmost', 'particle', 'is', 'the', 'maximum', 'of', 'a', 'collection', 'of', 'a', 'random', 'number', 'of', 'dependent', 'random', 'walks', 'we', 'characterise', 'the', 'rate', 'function', 'as', 'the', 'solution', 'of', 'a', 'variational', 'problem', 'we', 'consider', 'the', 'same', 'random', 'number', 'of', 'independent', 'random', 'walks', 'and', 'show', 'that', 'the', 'maximum', 'of', 'the', 'branching', 'random', 'walk', 'is', 'dominated', 'by', 'the', 'maximum', 'of', 'the', 'independent', 'random', 'walks', 'for', 'the', 'maximum', 'of', 'independent', 'random', 'walks', 'we', 'derive', 'a', 'large', 'deviation', 'principle', 'as', 'well', 'it', 'turns', 'out', 'that', 'the', 'rate', 'functions', 'for', 'upper', 'large', 'deviations', 'coincide', 'but', 'in', 'general', 'the', 'rate', 'functions', 'for', 'lower', 'large', 'deviations', 'do', 'not']] | [-0.12664145666155188, 0.22272146230873963, -0.05818743059644475, 0.06769642230162086, -0.031124738588308293, -0.12273673399273927, 0.1206203678312401, 0.3138523907478278, -0.28381533855378316, -0.22777139546039205, 0.11506095739993422, -0.28087050054843227, -0.111448461531351, 0.17825940885134817, -0.04520054480526596, 0.10656773530257245, 0.0582630549169456, 0.06946855639883627, -0.020030416164081542, -0.23793796215225788, 0.24498532377183438, 0.033052537792051834, 0.2742664521094412, 0.030678503188149384, 0.1482316911375771, 0.0960532971114541, -0.048816922031498206, 0.05222091866501918, -0.13038209096472808, 0.0634992695559049, 0.12621478845054904, 0.1109185782351536, 0.28293955385840186, -0.34349423988411826, -0.1636913133629908, 0.20005749504004294, 0.13166957412613556, 0.14306099839353312, -0.0001524146122392267, -0.2387745372019708, 0.09380624551946919, -0.11580970849220952, -0.15774524165705467, 0.04454835154271374, 0.05481230908383926, 0.12039887979626655, -0.3130805340828374, 0.08328529301797971, 0.07248436151324616, 0.020921230702030395, 0.04722362146906865, -0.15388926942347705, 0.024703150914865545, 0.14163740429357857, 0.03354194800097806, -0.00048598597447077434, 0.14264349206350743, -0.10971635162907963, -0.15521218125941233, 0.3864359003802141, -0.12269968744367361, -0.23753648569496968, 0.12414284906699322, -0.22815673967900996, -0.1745659640757367, 0.12840800583168555, 0.22384115708991886, 0.16055009518750013, -0.15106113135504226, 0.10076661481580232, -0.11534373484707126, 0.09851166452281176, 0.05206435415893793, 0.026250446508735575, 0.17204263646854087, 0.10267169293559467, 0.1660995932625762, 0.17971730635811886, -0.08238004751037806, -0.15547205852732685, -0.33940556486874507, -0.14763301679243643, -0.29585835433875524, 0.11009377603780497, -0.23124023007670377, -0.25179341620144746, 0.3641933423001319, 0.13951469762638832, 0.26628890562957774, 0.19935240477013091, 0.1859402489072333, 0.2009524385968689, -0.0063491113561516006, 0.07950257027987391, 0.1902848469093442, 0.16584628855925984, 0.0480399124401932, -0.1511128153069876, 0.12552028854067127, 0.08154693813218425] |
1,802.03961 | Matter Lagrangian of particles and fluids | We consider a model where particles are described as localized concentrations
of energy, with fixed rest mass and structure, which are not significantly
affected by their self-induced gravitational field. We show that the volume
average of the on-shell matter Lagrangian ${\mathcal L_m}$ describing such
particles, in the proper frame, is equal to the volume average of the trace $T$
of the energy-momentum tensor in the same frame, independently of the
particle's structure and constitution. Since both ${\mathcal L_m}$ and $T$ are
scalars, and thus independent of the reference frame, this result is also
applicable to collections of moving particles and, in particular, to those
which can be described by a perfect fluid. Our results are expected to be
particularly relevant in the case of modified theories of gravity with
nonminimal coupling to matter where the matter Lagrangian appears explicitly in
the equations of motion of the gravitational and matter fields, such as
$f(R,{\mathcal L_m})$ and $f(R,T)$ gravity. In particular, they indicate that,
in this context, $f(R,{\mathcal L_m})$ theories may be regarded as a subclass
of $f(R,T)$ gravity.
| gr-qc astro-ph.CO hep-ph hep-th | we consider a model where particles are described as localized concentrations of energy with fixed rest mass and structure which are not significantly affected by their selfinduced gravitational field we show that the volume average of the onshell matter lagrangian mathcal l_m describing such particles in the proper frame is equal to the volume average of the trace t of the energymomentum tensor in the same frame independently of the particles structure and constitution since both mathcal l_m and t are scalars and thus independent of the reference frame this result is also applicable to collections of moving particles and in particular to those which can be described by a perfect fluid our results are expected to be particularly relevant in the case of modified theories of gravity with nonminimal coupling to matter where the matter lagrangian appears explicitly in the equations of motion of the gravitational and matter fields such as frmathcal l_m and frt gravity in particular they indicate that in this context frmathcal l_m theories may be regarded as a subclass of frt gravity | [['we', 'consider', 'a', 'model', 'where', 'particles', 'are', 'described', 'as', 'localized', 'concentrations', 'of', 'energy', 'with', 'fixed', 'rest', 'mass', 'and', 'structure', 'which', 'are', 'not', 'significantly', 'affected', 'by', 'their', 'selfinduced', 'gravitational', 'field', 'we', 'show', 'that', 'the', 'volume', 'average', 'of', 'the', 'onshell', 'matter', 'lagrangian', 'mathcal', 'l_m', 'describing', 'such', 'particles', 'in', 'the', 'proper', 'frame', 'is', 'equal', 'to', 'the', 'volume', 'average', 'of', 'the', 'trace', 't', 'of', 'the', 'energymomentum', 'tensor', 'in', 'the', 'same', 'frame', 'independently', 'of', 'the', 'particles', 'structure', 'and', 'constitution', 'since', 'both', 'mathcal', 'l_m', 'and', 't', 'are', 'scalars', 'and', 'thus', 'independent', 'of', 'the', 'reference', 'frame', 'this', 'result', 'is', 'also', 'applicable', 'to', 'collections', 'of', 'moving', 'particles', 'and', 'in', 'particular', 'to', 'those', 'which', 'can', 'be', 'described', 'by', 'a', 'perfect', 'fluid', 'our', 'results', 'are', 'expected', 'to', 'be', 'particularly', 'relevant', 'in', 'the', 'case', 'of', 'modified', 'theories', 'of', 'gravity', 'with', 'nonminimal', 'coupling', 'to', 'matter', 'where', 'the', 'matter', 'lagrangian', 'appears', 'explicitly', 'in', 'the', 'equations', 'of', 'motion', 'of', 'the', 'gravitational', 'and', 'matter', 'fields', 'such', 'as', 'frmathcal', 'l_m', 'and', 'frt', 'gravity', 'in', 'particular', 'they', 'indicate', 'that', 'in', 'this', 'context', 'frmathcal', 'l_m', 'theories', 'may', 'be', 'regarded', 'as', 'a', 'subclass', 'of', 'frt', 'gravity']] | [-0.12639799963493467, 0.2174966138850708, -0.06658873376127405, 0.07143323292092836, -0.04957160418511153, -0.1128434488434071, -0.056220538745335655, 0.30006250244496907, -0.2459559608040388, -0.31523057659509157, 0.05146910213026097, -0.23864823225412077, -0.09100248672115474, 0.13516525176122238, -0.043543204133751366, 0.0011630635550719196, -0.01127124621432885, 0.10836263669991476, -0.052782101378418336, -0.24019203054992283, 0.31448681482066543, 0.05727364887393969, 0.2007020502377533, 0.020889586258658582, 0.0861299999142434, -0.014122302641981613, -0.03482256400383125, 0.11007642848838099, -0.10713368906065003, 0.055127747682459906, 0.22728769021045606, 0.10475436739762818, 0.17046349892513774, -0.4232555560472995, -0.22435810349586993, 0.12968973248491938, 0.15924496395976445, 0.10361306620682827, -0.02842732693073945, -0.2879095364271237, 0.06962153883414123, -0.175641265204492, -0.11488687455401582, -0.03797261505021048, 0.050915202638265905, 0.025694054504067212, -0.25803304689944234, 0.11148267040554681, 0.05439860013374101, -0.022187150744648946, -0.07420388806945417, -0.08956676358251837, -0.05898440345506168, 0.06689529231154902, 0.10541027292114614, 0.06358884000956044, 0.16134061455979185, -0.1754350652497283, -0.049275670119358676, 0.46781400847906446, -0.12285607275395197, -0.25682310141244175, 0.1760289154494297, -0.1561278149454018, -0.11864836636988584, 0.0677825122121932, 0.14511254715001853, 0.15986259565636052, -0.14466832634910026, 0.1412784727268075, -0.037788059130984514, 0.10485973135478753, 0.08568213081860777, 0.0714072299526615, 0.27019423184295494, 0.10063167692998708, 0.012577124629274936, 0.07744076509307543, -0.019740563643685843, -0.10210121267391001, -0.38214022910359213, -0.18585908270998736, -0.15960063469480448, 0.03384412238829819, -0.11560295013611213, -0.15017309986149607, 0.3380564654635339, 0.12166832490642635, 0.16911317739868537, 0.05687499256399434, 0.21759774081282696, 0.09934033612368134, 0.08913751281824195, 0.08889399997174403, 0.28873576357234587, 0.13501844815331074, 0.06278714576162567, -0.20259232741864766, -0.022014222789219037, 0.07307354332142546] |
1,802.03962 | An extension of Laplace's method | Asymptotic expansions are obtained for contour integrals of the form \[
\int_a^b \exp \left( - zp(t) + z^{\nu /\mu } r(t) \right)q(t)dt, \] in which
$z$ is a large real or complex parameter, $p(t)$, $q(t)$ and $r(t)$ are
analytic functions of $t$, and the positive constants $\mu$ and $\nu$ are
related to the local behaviour of the functions $p(t)$ and $r(t)$ near the
endpoint $a$. Our main theorem includes as special cases several important
asymptotic methods for integrals such as those of Laplace, Watson, Erd\'elyi
and Olver. Asymptotic expansions similar to ours were derived earlier by Dingle
using formal, non-rigorous methods. The results of the paper also serve to
place Dingle's investigations on a rigorous mathematical foundation. The new
results have potential applications in the asymptotic theory of special
functions in transition regions, and we illustrate this by two examples.
| math.CA math.CV | asymptotic expansions are obtained for contour integrals of the form int_ab exp left zpt znu mu rt rightqtdt in which z is a large real or complex parameter pt qt and rt are analytic functions of t and the positive constants mu and nu are related to the local behaviour of the functions pt and rt near the endpoint a our main theorem includes as special cases several important asymptotic methods for integrals such as those of laplace watson erdelyi and olver asymptotic expansions similar to ours were derived earlier by dingle using formal nonrigorous methods the results of the paper also serve to place dingles investigations on a rigorous mathematical foundation the new results have potential applications in the asymptotic theory of special functions in transition regions and we illustrate this by two examples | [['asymptotic', 'expansions', 'are', 'obtained', 'for', 'contour', 'integrals', 'of', 'the', 'form', 'int_ab', 'exp', 'left', 'zpt', 'znu', 'mu', 'rt', 'rightqtdt', 'in', 'which', 'z', 'is', 'a', 'large', 'real', 'or', 'complex', 'parameter', 'pt', 'qt', 'and', 'rt', 'are', 'analytic', 'functions', 'of', 't', 'and', 'the', 'positive', 'constants', 'mu', 'and', 'nu', 'are', 'related', 'to', 'the', 'local', 'behaviour', 'of', 'the', 'functions', 'pt', 'and', 'rt', 'near', 'the', 'endpoint', 'a', 'our', 'main', 'theorem', 'includes', 'as', 'special', 'cases', 'several', 'important', 'asymptotic', 'methods', 'for', 'integrals', 'such', 'as', 'those', 'of', 'laplace', 'watson', 'erdelyi', 'and', 'olver', 'asymptotic', 'expansions', 'similar', 'to', 'ours', 'were', 'derived', 'earlier', 'by', 'dingle', 'using', 'formal', 'nonrigorous', 'methods', 'the', 'results', 'of', 'the', 'paper', 'also', 'serve', 'to', 'place', 'dingles', 'investigations', 'on', 'a', 'rigorous', 'mathematical', 'foundation', 'the', 'new', 'results', 'have', 'potential', 'applications', 'in', 'the', 'asymptotic', 'theory', 'of', 'special', 'functions', 'in', 'transition', 'regions', 'and', 'we', 'illustrate', 'this', 'by', 'two', 'examples']] | [-0.09383016350682627, 0.05318921294317327, -0.10139122399303949, 0.09915491751973715, -0.058412699212291926, -0.11759069895329462, 0.05719289995878088, 0.3148824913836451, -0.20966641857839105, -0.22117300460002187, 0.125281687251779, -0.2959740463587822, -0.17082802791353033, 0.25661223011874507, -0.01198239418833206, 0.10707029716506826, -0.010523548081630108, 0.029425246648095323, -0.08844390905737369, -0.20952153289831724, 0.2971514332739664, 0.01792682428618498, 0.21342442814740492, 0.05268350923716119, 0.027103704509720432, -0.0027874050287981377, -0.04726755038383558, -0.023872336101882836, -0.20987397838193414, 0.07155977878179935, 0.2565443366536673, 0.06215319225818596, 0.26012485219998227, -0.3731649030903072, -0.1682668862799112, 0.05263653734988166, 0.14389426087269164, 0.041822288837107466, -0.009413361585536746, -0.28714503002508235, 0.10236075037568243, -0.14300558840235075, -0.1542133946874828, -0.12002127967372705, 0.04520788166149886, 0.08111869442544764, -0.31846651783438795, 0.08572498040082406, 0.08537434560430208, 0.08211978318550708, -0.041608456592781076, -0.2007917264215366, 0.012139004920644573, 0.12159672569109578, 0.08717235864076595, 0.03048537497207607, 0.08157037086008738, -0.09553477778381696, -0.09425305585362807, 0.32144021695818414, -0.057427266395693136, -0.19897881095389355, 0.18913160023723982, -0.180177896068375, -0.1451548955043439, 0.09752955602192687, 0.12496045135159159, 0.16830610501567594, -0.12880783492106607, 0.17179165640228541, -0.004666966051004376, 0.0504285564053465, 0.10919544503276209, 0.0006347898443257718, 0.11663815565407276, 0.07504376306403146, -0.016466752322175482, 0.1136733615368774, -0.009243279303932055, -0.121888514336509, -0.3636708805676211, -0.1866544112139805, -0.15601877787037555, 0.06266380162119414, -0.13301337212540215, -0.18006230477300106, 0.35751978344474494, 0.07964438817350927, 0.21000357109799303, 0.08458358652723925, 0.24045291692582946, 0.17423306499999439, 0.03949165912556716, 0.040662792973417905, 0.1808455664396399, 0.15232571785048948, 0.1146447198310246, -0.14754647405563004, 0.02119459493339739, 0.1263456324672778] |
1,802.03963 | Asymptotic behavior of ground states of generalized pseudo-relativistic
Hartree equation | With appropriate hypotheses on the nonlinearity $f$, we prove the existence
of a ground state solution $u$ for the problem \[\sqrt{-\Delta+m^2}\,
u+Vu=\left(W*F(u)\right)f(u)\ \ \text{in }\ \mathbb{R}^{N},\] where $V$ is a
bounded potential, not necessarily continuous, and $F$ the primitive of $f$. We
also show that any of this problem is a classical solution. Furthermore, we
prove that the ground state solution has exponential decay.
| math.AP | with appropriate hypotheses on the nonlinearity f we prove the existence of a ground state solution u for the problem sqrtdeltam2 uvuleftwfurightfu textin mathbbrn where v is a bounded potential not necessarily continuous and f the primitive of f we also show that any of this problem is a classical solution furthermore we prove that the ground state solution has exponential decay | [['with', 'appropriate', 'hypotheses', 'on', 'the', 'nonlinearity', 'f', 'we', 'prove', 'the', 'existence', 'of', 'a', 'ground', 'state', 'solution', 'u', 'for', 'the', 'problem', 'sqrtdeltam2', 'uvuleftwfurightfu', 'textin', 'mathbbrn', 'where', 'v', 'is', 'a', 'bounded', 'potential', 'not', 'necessarily', 'continuous', 'and', 'f', 'the', 'primitive', 'of', 'f', 'we', 'also', 'show', 'that', 'any', 'of', 'this', 'problem', 'is', 'a', 'classical', 'solution', 'furthermore', 'we', 'prove', 'that', 'the', 'ground', 'state', 'solution', 'has', 'exponential', 'decay']] | [-0.19436977938061856, 0.05546765617995721, -0.07316807351365197, 0.01009924335168583, -0.05762083497906073, -0.15646302337437623, 0.04457194994768647, 0.32663205495012587, -0.3366528164106803, -0.16238703056559212, 0.1351760506809338, -0.30818066000938416, -0.12468248784358872, 0.14200317935987575, -0.03525796889892367, 0.07565416986519685, 0.09448486514633796, 0.11550334428788209, -0.04934384814295612, -0.21742225355911451, 0.3711056293400585, -0.1590632319022886, 0.19360270758052586, 0.09354980996061789, 0.13383828697451314, -0.04792712394483998, 0.1374397362567118, -0.012693383089709477, -0.1921828174364818, 0.07188325591736519, 0.1895444963554867, 0.1507795657580871, 0.3553400730931765, -0.38027487457042836, -0.19346630499224926, 0.2492391717024758, 0.12473552980933522, 0.0506649016799619, -0.0660791009756141, -0.30341480947175964, 0.13892312476136645, -0.11354532965352057, -0.18624920241504175, -0.04468958075234636, 0.0895786270438159, 0.04060166124559817, -0.3880837907877247, 0.0664651676068716, 0.1287351061654903, -0.020178478039404164, -0.16690678115873064, -0.107492454044643, -0.02688938797619499, 0.04381862336189532, 0.010635981175926377, 0.13707013763334663, 0.005859987711014807, -0.11961770738994122, -0.03593876547958763, 0.35405292581827913, -0.11989614222443006, -0.27514174965317134, 0.1268099700940437, -0.1578762392956214, -0.1095439946416338, 0.08082498760787069, 0.08734571712366382, 0.16387343354767464, -0.09354313853822771, 0.24693973501285416, -0.11970471670148802, 0.20409660688677772, 0.04903529973731178, 0.005794589743628854, 0.0646217684986711, 0.09935271022383307, 0.18315436624631773, 0.14095276789587052, -0.028508148274430243, -0.028218418924657047, -0.35192289343867145, -0.1655578825042629, -0.19127254708685348, 0.13926818805434704, -0.035570593458957224, -0.195802515845929, 0.36026023884044317, 0.09425144826088742, 0.1677179576859611, 0.09308310925624654, 0.21920384881926364, 0.16591035745671537, -0.05248166526072338, 0.09430470066677042, 0.18558727021588653, 0.07139443285900672, 0.05779145332816683, -0.22678584793246673, 0.06876490555978457, 0.10502685563801979] |
1,802.03964 | Linear response approach to active Brownian particles in time-varying
activity fields | In a theoretical and simulation study, active Brownian particles (ABPs) in
three-dimensional bulk systems are exposed to time-varying sinusoidal activity
waves that are running through the system. A linear response (Green-Kubo)
formalism is applied to derive fully analytical expressions for the torque-free
polarization profiles of the particles. The activity waves induce fluxes that
strongly depend on the particle size and may be employed to de-mix mixtures of
ABPs or to drive the particles into selected areas of the system.
Three-dimensional Langevin dynamics simulations are carried out to verify the
accuracy of the linear response formalism, which is shown to work best when the
particles are small (i.e., highly Brownian) or operating at low activity
levels.
| cond-mat.soft | in a theoretical and simulation study active brownian particles abps in threedimensional bulk systems are exposed to timevarying sinusoidal activity waves that are running through the system a linear response greenkubo formalism is applied to derive fully analytical expressions for the torquefree polarization profiles of the particles the activity waves induce fluxes that strongly depend on the particle size and may be employed to demix mixtures of abps or to drive the particles into selected areas of the system threedimensional langevin dynamics simulations are carried out to verify the accuracy of the linear response formalism which is shown to work best when the particles are small ie highly brownian or operating at low activity levels | [['in', 'a', 'theoretical', 'and', 'simulation', 'study', 'active', 'brownian', 'particles', 'abps', 'in', 'threedimensional', 'bulk', 'systems', 'are', 'exposed', 'to', 'timevarying', 'sinusoidal', 'activity', 'waves', 'that', 'are', 'running', 'through', 'the', 'system', 'a', 'linear', 'response', 'greenkubo', 'formalism', 'is', 'applied', 'to', 'derive', 'fully', 'analytical', 'expressions', 'for', 'the', 'torquefree', 'polarization', 'profiles', 'of', 'the', 'particles', 'the', 'activity', 'waves', 'induce', 'fluxes', 'that', 'strongly', 'depend', 'on', 'the', 'particle', 'size', 'and', 'may', 'be', 'employed', 'to', 'demix', 'mixtures', 'of', 'abps', 'or', 'to', 'drive', 'the', 'particles', 'into', 'selected', 'areas', 'of', 'the', 'system', 'threedimensional', 'langevin', 'dynamics', 'simulations', 'are', 'carried', 'out', 'to', 'verify', 'the', 'accuracy', 'of', 'the', 'linear', 'response', 'formalism', 'which', 'is', 'shown', 'to', 'work', 'best', 'when', 'the', 'particles', 'are', 'small', 'ie', 'highly', 'brownian', 'or', 'operating', 'at', 'low', 'activity', 'levels']] | [-0.11631159719140471, 0.19501565942621749, -0.08285296303017632, 0.023465415958882026, -0.027141960313462693, -0.1357065413552134, -0.008396646724608929, 0.3652781169699586, -0.23616088579570793, -0.31334840175898176, 0.07131635432293558, -0.28813314652475325, -0.1310913138071318, 0.19569410873556753, 0.017689158509323455, 0.05996554095055098, 0.026078014699337276, -0.010928447032347322, 0.012799833593485148, -0.1936885201169745, 0.20820769041007303, 0.0978541933324026, 0.2660918013395175, -0.006296246940189082, 0.10730629184728731, -0.022883590889851684, -0.0187077553861815, 0.06278971864477448, -0.11025850279319971, 0.03606877475167098, 0.21717989002961827, 0.02088586370987089, 0.20079421374298956, -0.505117379679628, -0.24029924015959966, 0.07334329877453653, 0.14198291416927847, 0.1123578721039888, -0.030635000448471502, -0.27101912606386064, 0.038362863989870835, -0.12995847464417634, -0.15134107606768932, -0.09314222146311532, 0.043123329843839875, 0.07852349240616288, -0.28337699685083784, 0.08394794492253467, 0.03921610310916667, 0.03614385215484578, -0.07396070513388385, -0.06891769939102232, -0.043255052590013846, 0.1298194076423027, 0.04395792758213761, -0.019429334019229787, 0.24865648228594142, -0.13310703659207437, -0.07907367481080735, 0.38614509831304134, -0.06697547121540359, -0.2794986354571808, 0.2595768647491122, -0.18115861264421887, -0.07615503671619556, 0.1962354634605024, 0.2515242206823567, 0.12388129302745927, -0.1874739570820289, 0.024135915784458832, -0.0136371455438759, 0.18840759952714586, 0.027619605053864096, -0.027874989592996627, 0.24670165648440953, 0.14553651158778888, 0.013561209636416448, 0.16086445176143846, -0.07442498155262159, -0.1447039041850392, -0.2544579566901793, -0.1085252995071958, -0.16419968265716148, 0.0018185156618963684, -0.046327551296132655, -0.15360313012624038, 0.36319683698694344, 0.1362270852520495, 0.1463680561226995, 0.07346210431398661, 0.26805290935115644, 0.14425608007966176, 0.02030795702467794, 0.07578883913710066, 0.27943080043339213, 0.15715511679730337, 0.08851694453345693, -0.2586510451308087, 0.04571065075452561, 0.030742134923196357] |
1,802.03965 | Optimality Conditions in Variational Form for Non-Linear Constrained
Stochastic Control Problems | Optimality conditions in the form of a variational inequality are proved for
a class of constrained optimal control problems of stochastic differential
equations. The cost function and the inequality constraints are functions of
the probability distribution of the state variable at the final time. The
analysis uses in an essential manner a convexity property of the set of
reachable probability distributions. An augmented Lagrangian method based on
the obtained optimality conditions is proposed and analyzed for solving
iteratively the problem. At each iteration of the method, a standard stochastic
optimal control problem is solved by dynamic programming. Two academical
examples are investigated.
| math.OC | optimality conditions in the form of a variational inequality are proved for a class of constrained optimal control problems of stochastic differential equations the cost function and the inequality constraints are functions of the probability distribution of the state variable at the final time the analysis uses in an essential manner a convexity property of the set of reachable probability distributions an augmented lagrangian method based on the obtained optimality conditions is proposed and analyzed for solving iteratively the problem at each iteration of the method a standard stochastic optimal control problem is solved by dynamic programming two academical examples are investigated | [['optimality', 'conditions', 'in', 'the', 'form', 'of', 'a', 'variational', 'inequality', 'are', 'proved', 'for', 'a', 'class', 'of', 'constrained', 'optimal', 'control', 'problems', 'of', 'stochastic', 'differential', 'equations', 'the', 'cost', 'function', 'and', 'the', 'inequality', 'constraints', 'are', 'functions', 'of', 'the', 'probability', 'distribution', 'of', 'the', 'state', 'variable', 'at', 'the', 'final', 'time', 'the', 'analysis', 'uses', 'in', 'an', 'essential', 'manner', 'a', 'convexity', 'property', 'of', 'the', 'set', 'of', 'reachable', 'probability', 'distributions', 'an', 'augmented', 'lagrangian', 'method', 'based', 'on', 'the', 'obtained', 'optimality', 'conditions', 'is', 'proposed', 'and', 'analyzed', 'for', 'solving', 'iteratively', 'the', 'problem', 'at', 'each', 'iteration', 'of', 'the', 'method', 'a', 'standard', 'stochastic', 'optimal', 'control', 'problem', 'is', 'solved', 'by', 'dynamic', 'programming', 'two', 'academical', 'examples', 'are', 'investigated']] | [-0.12609832963961012, 0.005014859105964812, -0.10079352215261143, 0.09602596470401348, -0.047219598875837585, -0.14440549833371358, 0.04976470198244879, 0.32084930595923583, -0.33748142969082384, -0.3077663328891218, 0.14473352815462825, -0.24076764030820308, -0.1254938299603322, 0.19953994938701974, -0.05708872309575478, 0.1751574768100445, 0.07212811200559943, 0.033460236684072255, -0.0911674727896895, -0.25143349660085695, 0.32254589133663103, -0.0009750126514072512, 0.2624723024063689, 0.010408103443207401, 0.20182428047900983, 0.012926596244249274, 0.003084623189494653, 0.05237448130569914, -0.11516456657965832, 0.12778409599445248, 0.24382989926665438, 0.19719115078138807, 0.37398268596050055, -0.4069880397520119, -0.1637992875972379, 0.08248525926405016, 0.0879660224326311, 0.06776985882178825, -0.04041128359648271, -0.27593035090203377, 0.08346754129902989, -0.08563966435544632, -0.14806771965003482, -0.035048943983080484, -0.05890485178222697, 0.04847455546990329, -0.374159512712675, 0.059922645726770744, 0.02467368466336755, 0.01935886934983964, -0.1181988993696138, -0.12950568592321932, -0.01661462755303136, 0.059145878450305875, 0.004823743861040794, 0.0008415739672879378, 0.1077574533136452, -0.1021120076058615, -0.13625623726094252, 0.3352563847678111, -0.012289683508011056, -0.28262326557773587, 0.10155146745919232, -0.04992132177507943, -0.15618484776339256, 0.14762586177162387, 0.1928592469893035, 0.21392421686437493, -0.22556055307059603, 0.11907458210286374, -0.059779039652294516, 0.10529211530571475, 0.03814533342351662, 0.014409298248424688, 0.07563692402532872, 0.16598603295107536, 0.1753858528739097, 0.1627785039052148, -0.016827026242846807, -0.15870379970646373, -0.3364107310315411, -0.12040368965187785, -0.20454214746132493, -0.0394971409125491, -0.12143911387943708, -0.1262678612279249, 0.36847615186079385, 0.09027126395627491, 0.14815950869952382, 0.11602410038604456, 0.27790561183264445, 0.21651392566926397, -0.012128139791243216, 0.09431689110237594, 0.2031555173133372, 0.13606707397026613, 0.09522431299510394, -0.23049786002329534, 0.13171827565769062, 0.1461051684420775] |
1,802.03966 | From the difference of structures to the structure of the difference | When dealing with evolving or multi-dimensional complex systems, network
theory provides with elegant ways of describing their constituting components,
through respectively time-varying and multi-layer complex networks.
Nevertheless, the analysis of how these components are related is still an open
problem. We here propose a framework for analysing the evolution of a (complex)
system, by describing the structure created by the difference between multiple
networks by means of the Information Content metric. As opposed to other
approaches, as for instance the use of global overlap or entropies, the
proposed one allows to understand if the observed changes are due to random
noise, or to structural (targeted) modifications. We validate the framework by
means of sets of synthetic networks, as well as networks representing real
technological, social and biological evolving systems. We further propose a way
of reconstructing network correlograms, which allow to convert the system's
evolution to the frequency domain.
| physics.soc-ph physics.data-an | when dealing with evolving or multidimensional complex systems network theory provides with elegant ways of describing their constituting components through respectively timevarying and multilayer complex networks nevertheless the analysis of how these components are related is still an open problem we here propose a framework for analysing the evolution of a complex system by describing the structure created by the difference between multiple networks by means of the information content metric as opposed to other approaches as for instance the use of global overlap or entropies the proposed one allows to understand if the observed changes are due to random noise or to structural targeted modifications we validate the framework by means of sets of synthetic networks as well as networks representing real technological social and biological evolving systems we further propose a way of reconstructing network correlograms which allow to convert the systems evolution to the frequency domain | [['when', 'dealing', 'with', 'evolving', 'or', 'multidimensional', 'complex', 'systems', 'network', 'theory', 'provides', 'with', 'elegant', 'ways', 'of', 'describing', 'their', 'constituting', 'components', 'through', 'respectively', 'timevarying', 'and', 'multilayer', 'complex', 'networks', 'nevertheless', 'the', 'analysis', 'of', 'how', 'these', 'components', 'are', 'related', 'is', 'still', 'an', 'open', 'problem', 'we', 'here', 'propose', 'a', 'framework', 'for', 'analysing', 'the', 'evolution', 'of', 'a', 'complex', 'system', 'by', 'describing', 'the', 'structure', 'created', 'by', 'the', 'difference', 'between', 'multiple', 'networks', 'by', 'means', 'of', 'the', 'information', 'content', 'metric', 'as', 'opposed', 'to', 'other', 'approaches', 'as', 'for', 'instance', 'the', 'use', 'of', 'global', 'overlap', 'or', 'entropies', 'the', 'proposed', 'one', 'allows', 'to', 'understand', 'if', 'the', 'observed', 'changes', 'are', 'due', 'to', 'random', 'noise', 'or', 'to', 'structural', 'targeted', 'modifications', 'we', 'validate', 'the', 'framework', 'by', 'means', 'of', 'sets', 'of', 'synthetic', 'networks', 'as', 'well', 'as', 'networks', 'representing', 'real', 'technological', 'social', 'and', 'biological', 'evolving', 'systems', 'we', 'further', 'propose', 'a', 'way', 'of', 'reconstructing', 'network', 'correlograms', 'which', 'allow', 'to', 'convert', 'the', 'systems', 'evolution', 'to', 'the', 'frequency', 'domain']] | [-0.10229363017160784, 0.0678222755279006, -0.05258672502541902, 0.0653487277012506, -0.06151087162078627, -0.11925802157641757, 0.02380575291928054, 0.39070008566365544, -0.3025648550711722, -0.3444440832405332, 0.1086670179732594, -0.2520910934436693, -0.23293875344722664, 0.18144457875563444, -0.023244165362252683, 0.06202325443018403, 0.04277654867244247, 0.015912168893663075, -0.035649298257413226, -0.2036905613924758, 0.38491302053912874, 0.034554292717417265, 0.27175399618248314, 0.012865187672135615, 0.09833407313906706, 0.018545129609875532, -0.06621806536357375, 0.051119684037008645, -0.055757497717007595, 0.19174104881237125, 0.24552644866099893, 0.17591307730407724, 0.28795424855826735, -0.45504402569276375, -0.2791436692112244, 0.11488151063223763, 0.1514027290868154, 0.11055296068095395, -0.008876725557047698, -0.29658362079855527, 0.08955869416611725, -0.1429227355105065, -0.12356597503909729, -0.1405603688854049, 0.006468693603880253, 0.043309729543183274, -0.24535447490853163, 0.05066265983057002, 0.034843331697434435, 0.036217057728599254, -0.0539002900028245, -0.0619550179932329, -0.016987172916419054, 0.19935516503287148, 0.013669195052098808, -0.0004079426871612668, 0.1210087299746955, -0.1341365449952474, -0.1387568155003574, 0.41123491514399146, -0.040301482163482165, -0.22644195275618725, 0.2333840369528172, -0.056177923824613125, -0.10703378029467675, 0.06162590081584734, 0.21482669954631953, 0.08605766312325461, -0.18967463869467494, 0.026706914535423603, 0.016733291218269792, 0.15384212642948725, 0.04237319733447477, 0.043946397478298455, 0.2245939342186305, 0.21163317411606694, 0.04255164605508724, 0.15931064545859788, -0.0525209364347129, -0.11852406337700984, -0.21206624421248862, -0.12364819118496806, -0.15352979637119893, 0.04173555281466411, -0.0830762092437792, -0.1809937645831214, 0.3962203273112142, 0.14261137302214869, 0.23005147806162501, 0.04375240099444461, 0.30951421602157214, 0.08678177420218669, 0.057560980162152005, 0.046759715660837725, 0.1535896792626571, 0.13984666092808815, 0.12458778215234712, -0.16919606415579883, 0.09927131063554862, -0.00352947831453893] |
1,802.03967 | Self-exciting Point Processes: Infections and Implementations | This is a comment on Reinhart's "Review of Self-Exciting Spatio-Temporal
Point Processes and Their Applications" (arXiv:1708.02647v1). I contribute some
experiences from modelling the spread of infectious diseases. Furthermore, I
try to complement the review with regard to the availability of software for
the described models, which I think is essential in "paving the way for new
uses".
| stat.ME physics.data-an stat.CO | this is a comment on reinharts review of selfexciting spatiotemporal point processes and their applications arxiv170802647v1 i contribute some experiences from modelling the spread of infectious diseases furthermore i try to complement the review with regard to the availability of software for the described models which i think is essential in paving the way for new uses | [['this', 'is', 'a', 'comment', 'on', 'reinharts', 'review', 'of', 'selfexciting', 'spatiotemporal', 'point', 'processes', 'and', 'their', 'applications', 'arxiv170802647v1', 'i', 'contribute', 'some', 'experiences', 'from', 'modelling', 'the', 'spread', 'of', 'infectious', 'diseases', 'furthermore', 'i', 'try', 'to', 'complement', 'the', 'review', 'with', 'regard', 'to', 'the', 'availability', 'of', 'software', 'for', 'the', 'described', 'models', 'which', 'i', 'think', 'is', 'essential', 'in', 'paving', 'the', 'way', 'for', 'new', 'uses']] | [-0.07016551586037333, 0.060515354522927244, -0.0816842389293015, 0.066835546690378, -0.11349323259835893, -0.1407743788154965, 0.05562419867651029, 0.3666346669874408, -0.2516713763502511, -0.2212745833464644, 0.10807775271506133, -0.2962309666401283, -0.21978147487071428, 0.21386047550053758, -0.11846505699848586, -0.01683629774911837, 0.05297535723921928, 0.019569721507882193, -0.0039616232145239004, -0.2208058210597797, 0.3482436952265826, 0.0636644206856462, 0.2486579859459942, 0.06038741029121659, 0.06626699400896376, 0.019135462010109967, -0.1548810719258406, -0.04395652498033914, -0.15951524041169746, 0.16642467366023497, 0.2962041107290133, 0.21742144906893374, 0.30663896697488696, -0.4274842272427949, -0.2407803323141045, 0.05463327130472118, 0.1639310242438858, 0.13086276786528867, -0.019214253561486573, -0.23882112291387536, 0.029600587129508228, -0.17664391283284533, -0.18200067257169972, -0.05224935397167097, 0.028224990449168465, 0.07929694535295394, -0.19863677080720663, 0.013253643676977267, 0.061125659553164784, 0.08840767983347178, -0.0070258513262326065, -0.14350281994451175, 0.03675101853229783, 0.17268874144012278, 0.07049773288044063, 0.008632859976073218, 0.11761059482497248, -0.17206146584146403, -0.12788442923073573, 0.40373159643601286, -0.006092026342891834, -0.15337792548604987, 0.21799956133419818, -0.08026993111495606, -0.18073623435233127, 0.07187410494820638, 0.21537165437740358, 0.06254031797024337, -0.17069958409463817, 0.06253049322734693, 0.050509619916027246, 0.0952864501228429, -0.01927449313754385, 0.021339556236158717, 0.2356008159928024, 0.2378579315814105, 0.03883624356240034, 0.0727769528769634, -0.05971317275596613, -0.09668237754905766, -0.32623395696282387, -0.18908749683336779, -0.10282687884332105, 0.08266980407590216, -0.024731426626517946, -0.15621293214234439, 0.4401252493516288, 0.29765122219581497, 0.2110069691817361, 0.004948453353294594, 0.2400987862016667, 0.05503080492331223, 0.01624055815098638, 0.05119444445114244, 0.15651214399893598, 0.07680455154993317, 0.14039121581749484, -0.15937499691393564, 0.12117531490088863, -0.004683017265051603] |
1,802.03968 | Analytical model for the uncorrelated emittance evolution of externally
injected beams in plasma-based accelerators | This article introduces an analytical formalism for the calculation of the
evolution of beam moments and the transverse emittance for beams which are
externally injected into plasma wakefield accelerators. This formalism is then
applied to two scenarios with increasing complexity - a single beam slice
without energy gain and a single beam slice with energy gain, both propagating
at a fixed co-moving position behind the driver. The obtained results are then
compared to particle-in-cell (PIC) simulations as well as results obtained
using an semi-analytic numerical approach (SANA). We find excellent agreement
between results from the analytical model and from SANA and PIC.
| physics.acc-ph | this article introduces an analytical formalism for the calculation of the evolution of beam moments and the transverse emittance for beams which are externally injected into plasma wakefield accelerators this formalism is then applied to two scenarios with increasing complexity a single beam slice without energy gain and a single beam slice with energy gain both propagating at a fixed comoving position behind the driver the obtained results are then compared to particleincell pic simulations as well as results obtained using an semianalytic numerical approach sana we find excellent agreement between results from the analytical model and from sana and pic | [['this', 'article', 'introduces', 'an', 'analytical', 'formalism', 'for', 'the', 'calculation', 'of', 'the', 'evolution', 'of', 'beam', 'moments', 'and', 'the', 'transverse', 'emittance', 'for', 'beams', 'which', 'are', 'externally', 'injected', 'into', 'plasma', 'wakefield', 'accelerators', 'this', 'formalism', 'is', 'then', 'applied', 'to', 'two', 'scenarios', 'with', 'increasing', 'complexity', 'a', 'single', 'beam', 'slice', 'without', 'energy', 'gain', 'and', 'a', 'single', 'beam', 'slice', 'with', 'energy', 'gain', 'both', 'propagating', 'at', 'a', 'fixed', 'comoving', 'position', 'behind', 'the', 'driver', 'the', 'obtained', 'results', 'are', 'then', 'compared', 'to', 'particleincell', 'pic', 'simulations', 'as', 'well', 'as', 'results', 'obtained', 'using', 'an', 'semianalytic', 'numerical', 'approach', 'sana', 'we', 'find', 'excellent', 'agreement', 'between', 'results', 'from', 'the', 'analytical', 'model', 'and', 'from', 'sana', 'and', 'pic']] | [-0.06889283185188502, 0.10511024732236049, -0.10128987274169553, 0.05941630532794475, -0.010544466262793924, -0.14307030218902347, -0.01762988980822634, 0.44430555864283355, -0.2236168750810741, -0.33123948375261064, 0.013091779346255088, -0.26000468208025773, -0.03879456470102662, 0.2691943406998779, 0.028562698633142626, 0.06654479222759457, 0.09124163075322562, -0.053497525227099364, -0.05519682977182588, -0.16601627453064344, 0.2610582664959354, 0.17405496551286392, 0.2872103211829568, 0.0309245766389488, 0.1366086584829384, 0.011641509918551339, -0.016153077641040972, 0.019823285824812874, -0.1599833575187719, 0.06148158836104713, 0.18655573420623078, 0.07956650030988241, 0.25394931881882177, -0.45727562839810804, -0.22745866457572078, -0.030978097778625122, 0.1966897217409298, 0.13983965478952753, -0.13416767338899396, -0.23865607925829027, 0.07918877653445643, -0.20492452201387373, -0.1618363564409832, -0.016693642224636998, -0.07551365303299805, 0.08575500388362325, -0.31584023238888176, 0.02480031954733157, -0.012263544022548242, 0.04310663573738962, -0.0589351074788535, -0.09713321957174725, -0.031598281703133245, 0.06854637155867191, 0.05705899651747861, 0.10769342806761956, 0.11660090779037316, -0.10743357789631251, -0.11042250489982047, 0.3743453462340749, -0.026809798323060616, -0.24039526908925854, 0.16659458172461478, -0.17474873482922812, -0.027021111865149865, 0.15833480502156042, 0.1544342723347726, 0.07991069057347751, -0.1312341685671968, 0.015448131218165307, -0.013345442384960923, 0.17144081161108496, 0.09030274435472076, -0.00631972358368699, 0.18558322428956187, 0.16440934712749602, -0.0045220239899388635, 0.15461235229469983, -0.10376755605534752, -0.08432197236077915, -0.33909048619541793, -0.11562235059286065, -0.15205415651792348, -0.006611273158269607, -0.052776969793497004, -0.10052894277147728, 0.4255399844968821, 0.13878514993898938, 0.12451960104010483, 0.06621239245938378, 0.394278290690762, 0.12341750443378223, 0.002329075925679195, 0.07703102951048699, 0.2044593891276434, 0.13783922470128623, 0.12004645631445737, -0.22921827237241635, -0.03016425582976772, 0.03059021948772197] |
1,802.03969 | A framework for epidemic spreading in multiplex networks of
metapopulations | We propose a theoretical framework for the study of epidemics in structured
metapopulations, with heterogeneous agents, subjected to recurrent mobility
patterns. We propose to represent the heterogeneity in the composition of the
metapopulations as layers in a multiplex network, where nodes would correspond
to geographical areas and layers account for the mobility patterns of agents of
the same class. We analyze both the classical Susceptible-Infected-Susceptible
and the Susceptible-Infected-Removed epidemic models within this framework, and
compare macroscopic and microscopic indicators of the spreading process with
extensive Monte Carlo simulations. Our results are in excellent agreement with
the simulations. We also derive an exact expression of the epidemic threshold
on this general framework revealing a non-trivial dependence on the mobility
parameter. Finally, we use this new formalism to address the spread of diseases
in real cities, specifically in the city of Medellin, Colombia, whose
population is divided into six socio-economic classes, each one identified with
a layer in this multiplex formalism.
| physics.soc-ph q-bio.PE | we propose a theoretical framework for the study of epidemics in structured metapopulations with heterogeneous agents subjected to recurrent mobility patterns we propose to represent the heterogeneity in the composition of the metapopulations as layers in a multiplex network where nodes would correspond to geographical areas and layers account for the mobility patterns of agents of the same class we analyze both the classical susceptibleinfectedsusceptible and the susceptibleinfectedremoved epidemic models within this framework and compare macroscopic and microscopic indicators of the spreading process with extensive monte carlo simulations our results are in excellent agreement with the simulations we also derive an exact expression of the epidemic threshold on this general framework revealing a nontrivial dependence on the mobility parameter finally we use this new formalism to address the spread of diseases in real cities specifically in the city of medellin colombia whose population is divided into six socioeconomic classes each one identified with a layer in this multiplex formalism | [['we', 'propose', 'a', 'theoretical', 'framework', 'for', 'the', 'study', 'of', 'epidemics', 'in', 'structured', 'metapopulations', 'with', 'heterogeneous', 'agents', 'subjected', 'to', 'recurrent', 'mobility', 'patterns', 'we', 'propose', 'to', 'represent', 'the', 'heterogeneity', 'in', 'the', 'composition', 'of', 'the', 'metapopulations', 'as', 'layers', 'in', 'a', 'multiplex', 'network', 'where', 'nodes', 'would', 'correspond', 'to', 'geographical', 'areas', 'and', 'layers', 'account', 'for', 'the', 'mobility', 'patterns', 'of', 'agents', 'of', 'the', 'same', 'class', 'we', 'analyze', 'both', 'the', 'classical', 'susceptibleinfectedsusceptible', 'and', 'the', 'susceptibleinfectedremoved', 'epidemic', 'models', 'within', 'this', 'framework', 'and', 'compare', 'macroscopic', 'and', 'microscopic', 'indicators', 'of', 'the', 'spreading', 'process', 'with', 'extensive', 'monte', 'carlo', 'simulations', 'our', 'results', 'are', 'in', 'excellent', 'agreement', 'with', 'the', 'simulations', 'we', 'also', 'derive', 'an', 'exact', 'expression', 'of', 'the', 'epidemic', 'threshold', 'on', 'this', 'general', 'framework', 'revealing', 'a', 'nontrivial', 'dependence', 'on', 'the', 'mobility', 'parameter', 'finally', 'we', 'use', 'this', 'new', 'formalism', 'to', 'address', 'the', 'spread', 'of', 'diseases', 'in', 'real', 'cities', 'specifically', 'in', 'the', 'city', 'of', 'medellin', 'colombia', 'whose', 'population', 'is', 'divided', 'into', 'six', 'socioeconomic', 'classes', 'each', 'one', 'identified', 'with', 'a', 'layer', 'in', 'this', 'multiplex', 'formalism']] | [-0.10315139257237783, 0.07134636875277506, -0.06437662390277446, 0.08652244669020495, -0.010471150820852263, -0.12278075775119869, 0.08134663883785559, 0.3879915008954001, -0.23219481444296738, -0.2914419250925944, 0.04533397644149058, -0.28264333783361895, -0.2360255938761358, 0.12280104952606624, -0.056438494552770314, 0.00883623706645467, 0.055718369002940145, 0.013089152806403362, 0.016250037582321738, -0.23396960133393793, 0.3349825305711923, 0.04126477820956904, 0.30840329890309265, 0.03739967240524367, 0.09196616460879643, -0.0032301260943307817, -0.03900640738290389, 0.04574273355559991, -0.1793702303039484, 0.1414384297358821, 0.29047359978449666, 0.11194095600970418, 0.2909772794740567, -0.474087096247002, -0.2693127510577159, 0.08439520730654586, 0.14923223363910657, 0.13211279729990372, 0.018517744040655548, -0.3064573450869172, 0.05243156653237324, -0.2017635527512047, -0.12039658503896855, -0.0341982198117664, -0.015323738289305812, 0.03798717984771532, -0.26825889288564947, 0.07492841843573476, -0.021263764796298254, 0.08920520649192, -0.05746471342475464, -0.0917438529351281, -0.018282504967536847, 0.19326686639625743, 0.02972814192722329, -0.07144996467040582, 0.12627413490371275, -0.12839311440680293, -0.13837416261015753, 0.3441588605267915, -0.014767877911671458, -0.197500911617429, 0.19841301978021017, -0.12693663874828498, -0.1576707157395698, 0.06125749291342525, 0.2702482502860656, 0.08365079344092112, -0.19036974417303437, 0.005450210386137449, -0.07461317457879584, 0.1401385570398192, -0.0016755737472653577, -0.01875771600728358, 0.1657525396337674, 0.270696148220684, 0.04171760430934388, 0.13593605590973976, -0.11180246427198345, -0.1847991390364631, -0.23682704738358845, -0.12958414613825903, -0.11633410411535429, 0.031198588029317464, -0.16145320985072334, -0.18652980497880084, 0.4568789659899736, 0.200921248979559, 0.20090187711307322, 0.09368530628066393, 0.24039249074698057, 0.05876784350242723, 0.04308196997750293, 0.08678622795971778, 0.14927118880463378, 0.08190065199573694, 0.12343800298096437, -0.20331333407476168, 0.13748064364523352, 0.002671474633180484] |
1,802.0397 | Probing the exchange statistics of one-dimensional anyon models | We propose feasible scenarios for revealing the modified exchange statistics
in one-dimensional anyon models in optical lattices based on an extension of
the multicolor lattice-depth modulation scheme introduced in [{Phys. Rev. A 94,
023615 (2016)}]. We show that the fast modulation of a two-component fermionic
lattice gas in the presence a magnetic field gradient, in combination with
additional resonant microwave fields, allows for the quantum simulation of
hardcore anyon models with periodic boundary conditions. Such a semi-synthetic
ring set-up allows for realizing an interferometric arrangement sensitive to
the anyonic statistics. Moreover, we show as well that simple expansion
experiments may reveal the formation of anomalously bound pairs resulting from
the anyonic exchange.
| cond-mat.quant-gas | we propose feasible scenarios for revealing the modified exchange statistics in onedimensional anyon models in optical lattices based on an extension of the multicolor latticedepth modulation scheme introduced in phys rev a 94 023615 2016 we show that the fast modulation of a twocomponent fermionic lattice gas in the presence a magnetic field gradient in combination with additional resonant microwave fields allows for the quantum simulation of hardcore anyon models with periodic boundary conditions such a semisynthetic ring setup allows for realizing an interferometric arrangement sensitive to the anyonic statistics moreover we show as well that simple expansion experiments may reveal the formation of anomalously bound pairs resulting from the anyonic exchange | [['we', 'propose', 'feasible', 'scenarios', 'for', 'revealing', 'the', 'modified', 'exchange', 'statistics', 'in', 'onedimensional', 'anyon', 'models', 'in', 'optical', 'lattices', 'based', 'on', 'an', 'extension', 'of', 'the', 'multicolor', 'latticedepth', 'modulation', 'scheme', 'introduced', 'in', 'phys', 'rev', 'a', '94', '023615', '2016', 'we', 'show', 'that', 'the', 'fast', 'modulation', 'of', 'a', 'twocomponent', 'fermionic', 'lattice', 'gas', 'in', 'the', 'presence', 'a', 'magnetic', 'field', 'gradient', 'in', 'combination', 'with', 'additional', 'resonant', 'microwave', 'fields', 'allows', 'for', 'the', 'quantum', 'simulation', 'of', 'hardcore', 'anyon', 'models', 'with', 'periodic', 'boundary', 'conditions', 'such', 'a', 'semisynthetic', 'ring', 'setup', 'allows', 'for', 'realizing', 'an', 'interferometric', 'arrangement', 'sensitive', 'to', 'the', 'anyonic', 'statistics', 'moreover', 'we', 'show', 'as', 'well', 'that', 'simple', 'expansion', 'experiments', 'may', 'reveal', 'the', 'formation', 'of', 'anomalously', 'bound', 'pairs', 'resulting', 'from', 'the', 'anyonic', 'exchange']] | [-0.1733669851925476, 0.17092489779046904, -0.060527128058376616, 0.016840483082158422, -0.06593010986332891, -0.15752504661947758, 0.046231588959140146, 0.3791594146625013, -0.21490490942069138, -0.2865841787241332, 0.025242283914095578, -0.21955736413171204, -0.16935225451985994, 0.22075689464874632, -0.018688579100427462, 0.03317850748462989, 0.03903634043259395, -0.019907249081124727, -0.04652699573082967, -0.24801483475475997, 0.23690873579130517, 0.07247022917255054, 0.3157982020429126, 0.05460252346017876, 0.08887282996396492, 0.06235203154905288, 0.005774080925327432, -0.016544581447551783, -0.15753807065453115, 0.08247648771676058, 0.16802359428048302, -0.006241342807943757, 0.1560454513239968, -0.42537373018258057, -0.24928151097920564, 0.09750993026269449, 0.15083060689639669, 0.175483415392411, -0.06977876290565709, -0.296036626472398, -0.0025201098141805814, -0.2247385061304043, -0.14945122227072716, -0.13311837823339948, -0.009907825257385837, 0.04273345021463863, -0.33911631268088344, 0.10596312834201632, 0.036271496203954555, 0.0893436632630927, -0.04473092270908072, -0.037189562010016664, 0.005591190927703907, 0.0019493574519885016, -0.0793390056403639, -0.003531568230608025, 0.09368556640152861, -0.13092316545311128, -0.1580901689542172, 0.35271334690608186, -0.1297308850597154, -0.1651977688443285, 0.2427397635492689, -0.10392334412464553, -0.11151917342532862, 0.0954827173101204, 0.14143060685160594, 0.0687105610698193, -0.12366943856751597, 0.09188951387333365, -0.09154591608586982, 0.17503603070587348, 0.035566102660907144, 0.07066099327225406, 0.2702505968108371, 0.12381023371399187, 0.03450028957019829, 0.20132313146432107, -0.14366616235483806, -0.1272966379618591, -0.30131563550985613, -0.14470535208657803, -0.20816967679976342, 0.042752099317825726, -0.049182620218342486, -0.17914933384068915, 0.3851217128712878, 0.17650258904302005, 0.21954705705446703, -0.04095836529122279, 0.25694002741989724, 0.09172297169104102, 0.04652390559833195, 0.07426899515704864, 0.19695296133385953, 0.16188888526773332, 0.07154745782876538, -0.2606828369867258, -0.04766042072636386, 0.07285368509867506] |
1,802.03971 | Email Classification into Relevant Category Using Neural Networks | In the real world, many online shopping websites or service provider have
single email-id where customers can send their query, concern etc. At the
back-end service provider receive million of emails every week, how they can
identify which email is belonged of a particular department? This paper
presents an artificial neural network (ANN) model that is used to solve this
problem and experiments are carried out on user personal Gmail emails datasets.
This problem can be generalised as typical Text Classification or
Categorization.
| cs.LG cs.IR | in the real world many online shopping websites or service provider have single emailid where customers can send their query concern etc at the backend service provider receive million of emails every week how they can identify which email is belonged of a particular department this paper presents an artificial neural network ann model that is used to solve this problem and experiments are carried out on user personal gmail emails datasets this problem can be generalised as typical text classification or categorization | [['in', 'the', 'real', 'world', 'many', 'online', 'shopping', 'websites', 'or', 'service', 'provider', 'have', 'single', 'emailid', 'where', 'customers', 'can', 'send', 'their', 'query', 'concern', 'etc', 'at', 'the', 'backend', 'service', 'provider', 'receive', 'million', 'of', 'emails', 'every', 'week', 'how', 'they', 'can', 'identify', 'which', 'email', 'is', 'belonged', 'of', 'a', 'particular', 'department', 'this', 'paper', 'presents', 'an', 'artificial', 'neural', 'network', 'ann', 'model', 'that', 'is', 'used', 'to', 'solve', 'this', 'problem', 'and', 'experiments', 'are', 'carried', 'out', 'on', 'user', 'personal', 'gmail', 'emails', 'datasets', 'this', 'problem', 'can', 'be', 'generalised', 'as', 'typical', 'text', 'classification', 'or', 'categorization']] | [-0.10556471047092633, -0.007588656617613251, -0.03225409019042749, 0.06939501352804567, -0.16906929826523467, -0.26066730226984763, 0.10976690112427999, 0.42058827214122535, -0.28545910069797503, -0.35543078967336433, 0.11366804313974971, -0.4102467043123331, -0.15438992277079497, 0.165888218514913, -0.15938639482034436, 0.009866804978529731, 0.10878201626824686, 0.12396918250113187, 0.055896644902707314, -0.43342419082007133, 0.2645872910675335, 0.005535225243677935, 0.3360619050147663, 0.05947423894070538, 0.04836383010001281, 0.006772986714200801, -0.03824197355495115, -0.08778270409324666, 0.0021989663458164186, 0.08891437157388238, 0.41781616722603876, 0.2744494288071362, 0.37384163627558087, -0.4439048709229325, -0.1413652532318809, 0.13605230805430427, 0.17646740736574473, 0.046063199549729664, 0.003987651277636458, -0.37721773587077495, 0.1258330308518047, -0.26640610210036475, -0.014875727683215975, -0.07346262955751988, -0.0009059521807245461, 0.0021557883879854286, -0.2406154946839235, -0.025090883011896027, -0.039776976326906896, 0.11003572154924812, 0.010147338469389332, -0.05372207501835852, 0.00043246405288936143, 0.2587941540910088, 0.07709792573201324, 0.00884263166394758, 0.21967655429209818, -0.12905023848716485, -0.17992449968110724, 0.4293114013565951, 0.03814055919310594, -0.1416788321277351, 0.15488494134785788, 0.027989257048501307, -0.1935490009666656, 0.03914121778244265, 0.32383047398853015, 0.08980055766023066, -0.23639704905315695, -0.006352267831883741, -0.12753199984555144, 0.20677166712661105, 0.12235182403454961, -0.04810134924145931, 0.19851748643061481, 0.1932224449280829, 0.05993667543874156, 0.10538615140901228, -0.046400055732488274, -0.029824167888342256, -0.15735427514616265, -0.13194955825659793, -0.18596206006246158, 0.08081084101584303, -0.06579421364112494, -0.1302608683037695, 0.3703295612730176, 0.2068012986999813, 0.09626712156908519, 0.03968653257470578, 0.3208569583808442, 0.027664993097164095, 0.0981180582635409, 0.13253400453747846, 0.08685657871797321, -0.13618277338703713, 0.28895108988059753, -0.049117707075124764, 0.12178947866883084, -0.003077031817309648] |
1,802.03972 | Quantitatively consistent computation of coherent and incoherent
radiation in particle-in-cell codes - a general form factor formalism for
macro-particles | Quantitative predictions from synthetic radiation diagnostics often have to
consider all accelerated particles. For particle-in-cell (PIC) codes, this not
only means including all macro-particles but also taking into account the
discrete electron distribution associated with them. This paper presents a
general form factor formalism that allows to determine the radiation from this
discrete electron distribution in order to compute the coherent and incoherent
radiation self-consistently. Furthermore, we discuss a memory-efficient
implementation that allows PIC simulations with billions of macro-particles.
The impact on the radiation spectra is demonstrated on a large scale LWFA
simulation.
| physics.comp-ph physics.plasm-ph | quantitative predictions from synthetic radiation diagnostics often have to consider all accelerated particles for particleincell pic codes this not only means including all macroparticles but also taking into account the discrete electron distribution associated with them this paper presents a general form factor formalism that allows to determine the radiation from this discrete electron distribution in order to compute the coherent and incoherent radiation selfconsistently furthermore we discuss a memoryefficient implementation that allows pic simulations with billions of macroparticles the impact on the radiation spectra is demonstrated on a large scale lwfa simulation | [['quantitative', 'predictions', 'from', 'synthetic', 'radiation', 'diagnostics', 'often', 'have', 'to', 'consider', 'all', 'accelerated', 'particles', 'for', 'particleincell', 'pic', 'codes', 'this', 'not', 'only', 'means', 'including', 'all', 'macroparticles', 'but', 'also', 'taking', 'into', 'account', 'the', 'discrete', 'electron', 'distribution', 'associated', 'with', 'them', 'this', 'paper', 'presents', 'a', 'general', 'form', 'factor', 'formalism', 'that', 'allows', 'to', 'determine', 'the', 'radiation', 'from', 'this', 'discrete', 'electron', 'distribution', 'in', 'order', 'to', 'compute', 'the', 'coherent', 'and', 'incoherent', 'radiation', 'selfconsistently', 'furthermore', 'we', 'discuss', 'a', 'memoryefficient', 'implementation', 'that', 'allows', 'pic', 'simulations', 'with', 'billions', 'of', 'macroparticles', 'the', 'impact', 'on', 'the', 'radiation', 'spectra', 'is', 'demonstrated', 'on', 'a', 'large', 'scale', 'lwfa', 'simulation']] | [-0.04300115742847093, 0.1448956187363834, -0.09448416528081702, 0.1012983804503556, -0.05610097246745261, -0.1049054001172584, -0.025083414858497518, 0.4090191128273164, -0.24794781763827609, -0.32562760516039785, 0.007053900413685829, -0.2517769005696004, -0.07131500907682924, 0.2411111062693019, 0.014633990158276853, 0.036826304856046876, 0.10141693622685008, -0.07049707349850445, -0.048506660380661086, -0.18628420565973328, 0.30149768676949285, 0.143428154269694, 0.2625104322709063, 0.035125354585307904, 0.12157828059868626, 0.017141251549405115, -0.08626396573519193, 0.015779874788256744, -0.12883294069897308, 0.07430321892463071, 0.1903934462386514, 0.0836894342034895, 0.2593199725272835, -0.4927281904865497, -0.26493204546271154, 0.06884044335444048, 0.1704730555957799, 0.13624976239147124, -0.1118292695196766, -0.20299358173243462, 0.08308369961006426, -0.2099826353632154, -0.09983444169303902, -0.08905008573946292, -0.025952970739253747, 0.04173012829876395, -0.30265022338097614, 0.011446067286963244, -0.014429510300678591, 0.005268829383997507, -0.06344173189568063, -0.05285876718354762, 0.044328387929326904, 0.09121758697218993, 0.02847235461681961, -0.0012592042305616922, 0.13205198960889492, -0.07208777472667235, -0.073155543912122, 0.440178163509856, -0.031146578386836554, -0.20544556851163306, 0.1933068864858679, -0.2032303362584082, -0.0972973829966479, 0.1968716296357333, 0.19554226998845617, 0.11287890336293507, -0.14846700271065796, 0.07660659233305944, -0.027171487329147197, 0.1652834976958211, 0.03514323617902494, 0.02118207234701502, 0.19286880774363394, 0.11446087221584973, -0.029279232958972615, 0.14764202270476567, -0.11794367700318245, -0.10579124737971572, -0.2917079802662615, -0.13612905828134683, -0.15205456858991534, 0.06264383423217867, -0.06633626446688062, -0.16043340200458162, 0.40978911095198683, 0.20663932264752446, 0.13491553716081126, 0.04543399568446862, 0.3810269534988429, 0.11359016195199984, 0.06225995789532379, 0.11370770439445492, 0.19116333238680355, 0.11215612787993685, 0.06791105520941558, -0.23814009629209998, 0.012326121968667834, 0.02536835468384207] |
1,802.03973 | SSH model with long-range hoppings: topology, driving and disorder | The Su-Schrieffer-Heeger (SSH) model describes a finite one-dimensional dimer
lattice with first-neighbour hoppings populated by non-interacting electrons.
In this work we study a generalization of the SSH model including longer-range
hoppings, what we call the extended SSH model. We show that the presence of odd
and even hoppings has a very different effect on the topology of the chain. On
one hand, even hoppings break particle-hole and sublattice symmetry, making the
system topologically trivial, but the Zak phase is still quantized due to the
presence of inversion symmetry. On the other hand, odd hoppings allow for
phases with a larger topological invariant. This implies that the system
supports more edge states in the band's gap. We propose how to engineer those
topological phases with a high-frequency driving. Finally, we include a
numerical analysis on the effect of diagonal and off-diagonal disorder in the
edge states properties.
| cond-mat.mes-hall | the suschriefferheeger ssh model describes a finite onedimensional dimer lattice with firstneighbour hoppings populated by noninteracting electrons in this work we study a generalization of the ssh model including longerrange hoppings what we call the extended ssh model we show that the presence of odd and even hoppings has a very different effect on the topology of the chain on one hand even hoppings break particlehole and sublattice symmetry making the system topologically trivial but the zak phase is still quantized due to the presence of inversion symmetry on the other hand odd hoppings allow for phases with a larger topological invariant this implies that the system supports more edge states in the bands gap we propose how to engineer those topological phases with a highfrequency driving finally we include a numerical analysis on the effect of diagonal and offdiagonal disorder in the edge states properties | [['the', 'suschriefferheeger', 'ssh', 'model', 'describes', 'a', 'finite', 'onedimensional', 'dimer', 'lattice', 'with', 'firstneighbour', 'hoppings', 'populated', 'by', 'noninteracting', 'electrons', 'in', 'this', 'work', 'we', 'study', 'a', 'generalization', 'of', 'the', 'ssh', 'model', 'including', 'longerrange', 'hoppings', 'what', 'we', 'call', 'the', 'extended', 'ssh', 'model', 'we', 'show', 'that', 'the', 'presence', 'of', 'odd', 'and', 'even', 'hoppings', 'has', 'a', 'very', 'different', 'effect', 'on', 'the', 'topology', 'of', 'the', 'chain', 'on', 'one', 'hand', 'even', 'hoppings', 'break', 'particlehole', 'and', 'sublattice', 'symmetry', 'making', 'the', 'system', 'topologically', 'trivial', 'but', 'the', 'zak', 'phase', 'is', 'still', 'quantized', 'due', 'to', 'the', 'presence', 'of', 'inversion', 'symmetry', 'on', 'the', 'other', 'hand', 'odd', 'hoppings', 'allow', 'for', 'phases', 'with', 'a', 'larger', 'topological', 'invariant', 'this', 'implies', 'that', 'the', 'system', 'supports', 'more', 'edge', 'states', 'in', 'the', 'bands', 'gap', 'we', 'propose', 'how', 'to', 'engineer', 'those', 'topological', 'phases', 'with', 'a', 'highfrequency', 'driving', 'finally', 'we', 'include', 'a', 'numerical', 'analysis', 'on', 'the', 'effect', 'of', 'diagonal', 'and', 'offdiagonal', 'disorder', 'in', 'the', 'edge', 'states', 'properties']] | [-0.2225789564529319, 0.22230676563348212, -0.039761653880442, 0.07923897288417546, -0.04444086300336743, -0.2228388009554617, 0.07773237086016022, 0.37538352738810726, -0.23297229974709247, -0.23352105072252963, 0.04701963036834607, -0.3093839803302329, -0.17688119546502307, 0.08922295509805674, 0.03694124191390248, -0.025282815259830286, 0.010199847254800061, -0.02233854899890976, -0.09668381945612801, -0.2121461074670126, 0.3160639400976672, -0.013096615892184311, 0.2880924528286065, 0.07552760112903094, -0.011890503589051126, 0.03731632738355037, 0.09180510761726597, -0.007694659719549834, -0.10347405375567127, 0.06868079399860669, 0.17124086783478062, -0.09540976283510458, 0.17926850293329216, -0.45151066373115123, -0.21317178163077835, 0.09396499616081176, 0.1509955752615447, 0.17842647591478203, -0.035927731230115834, -0.331640283589902, 0.029876221163510918, -0.22241955579653994, -0.14615166281375472, -0.08786362193744911, -0.007013518108080511, -0.05206035564443071, -0.23356373253763232, 0.07768470200722756, 0.11459257762738798, 0.05642447759102701, -0.061077914760473556, -0.06090072712427235, -0.09438633032729976, 0.08511827859632058, 0.03632429856982414, -0.0206235644315076, 0.05652631617514799, -0.11456580494198795, -0.1301403051841851, 0.41360756942415483, -0.05883250948183608, -0.18544058877438918, 0.21279471931494262, -0.14585659825199201, -0.14568822895980452, 0.09135209342579625, 0.0842530121707855, 0.05012898695055548, -0.05976477263444294, 0.12243936263696188, -0.046405985721782464, 0.18085323498813174, -0.01733483436632238, 0.0678852337910092, 0.2157886934543207, 0.14348774339544446, 0.12197348484067783, 0.220050988961665, -0.09042324376617852, -0.12608673612344756, -0.24751490406845122, -0.13072016546965182, -0.23987645866215382, 0.027329771056267344, -0.04372376859938002, -0.2104027399375448, 0.49775019128590003, 0.18184051099006704, 0.1976048659185611, 0.0029348615773838677, 0.23906304892343916, 0.10723336631023925, 0.07450452841792816, 0.04877544324031763, 0.18859799868867363, 0.10510908418067105, 0.04266713828897767, -0.2657328723197841, 0.02459340138450163, 0.09597800080090353] |
1,802.03974 | McKean-Vlasov SDEs under Measure Dependent Lyapunov Conditions | We prove the existence of weak solutions to McKean-Vlasov SDEs defined on a
domain $D \subseteq \mathbb{R}^d$ with continuous and unbounded coefficients
that satisfy Lyapunov type conditions, where the Lyapunov function may depend
on measure. We propose a new type of {\em integrated} Lyapunov condition, where
the inequality is only required to hold when integrated against the measure on
which the Lyapunov function depends , and we show that this is sufficient for
the existence of weak solutions to McKean-Vlasov SDEs defined on $D$. The main
tool used in the proofs is the concept of a measure derivative due to Lions. We
prove results on uniqueness under weaker assumptions than that of global
Lipschitz continuity of the coefficients.
| math.PR | we prove the existence of weak solutions to mckeanvlasov sdes defined on a domain d subseteq mathbbrd with continuous and unbounded coefficients that satisfy lyapunov type conditions where the lyapunov function may depend on measure we propose a new type of em integrated lyapunov condition where the inequality is only required to hold when integrated against the measure on which the lyapunov function depends and we show that this is sufficient for the existence of weak solutions to mckeanvlasov sdes defined on d the main tool used in the proofs is the concept of a measure derivative due to lions we prove results on uniqueness under weaker assumptions than that of global lipschitz continuity of the coefficients | [['we', 'prove', 'the', 'existence', 'of', 'weak', 'solutions', 'to', 'mckeanvlasov', 'sdes', 'defined', 'on', 'a', 'domain', 'd', 'subseteq', 'mathbbrd', 'with', 'continuous', 'and', 'unbounded', 'coefficients', 'that', 'satisfy', 'lyapunov', 'type', 'conditions', 'where', 'the', 'lyapunov', 'function', 'may', 'depend', 'on', 'measure', 'we', 'propose', 'a', 'new', 'type', 'of', 'em', 'integrated', 'lyapunov', 'condition', 'where', 'the', 'inequality', 'is', 'only', 'required', 'to', 'hold', 'when', 'integrated', 'against', 'the', 'measure', 'on', 'which', 'the', 'lyapunov', 'function', 'depends', 'and', 'we', 'show', 'that', 'this', 'is', 'sufficient', 'for', 'the', 'existence', 'of', 'weak', 'solutions', 'to', 'mckeanvlasov', 'sdes', 'defined', 'on', 'd', 'the', 'main', 'tool', 'used', 'in', 'the', 'proofs', 'is', 'the', 'concept', 'of', 'a', 'measure', 'derivative', 'due', 'to', 'lions', 'we', 'prove', 'results', 'on', 'uniqueness', 'under', 'weaker', 'assumptions', 'than', 'that', 'of', 'global', 'lipschitz', 'continuity', 'of', 'the', 'coefficients']] | [-0.1513166984072568, 0.031015744970108453, -0.1035379185132348, 0.09251309449895898, -0.09387552162481105, -0.15859819367989644, 0.021962763745592445, 0.2955348627625877, -0.29956607604956526, -0.17932463681691477, 0.15246975627871087, -0.24478602541101158, -0.13216507450765014, 0.21309750901264513, -0.11079105790545288, 0.09927233822074616, 0.020378405180497047, 0.02624967802538831, -0.044457166680556714, -0.23600302188872144, 0.39462286791501516, -0.0678330892060175, 0.25861880786589575, 0.0979727982940415, 0.17356495582299608, -0.0012816543507779765, -0.026709601615404345, 0.0072945965708703054, -0.2205248149817697, 0.10117952935556826, 0.17539510742211953, 0.11522714442645128, 0.32894125869736457, -0.39112761258505857, -0.1408225903685531, 0.19890509446700796, 0.0941012358913819, 0.009670347682773493, -0.009362034656855667, -0.3054018960390081, 0.17047388526077709, -0.05419694270906795, -0.19488867887287822, -0.07576748489254974, 0.05065438049471276, 0.11870196906642781, -0.37021126770852214, 0.09136459453063261, 0.09682349716989785, 0.046490395397871226, -0.13130017721818554, -0.058328510230232, -0.04281231600186254, 0.03635864800292975, 0.049528034501430444, 0.02193743681224684, 0.10418745094480422, -0.052719425455802396, -0.09476210066300426, 0.2949930294297444, -0.12500650094064356, -0.3053684210261473, 0.21442160840418875, -0.16260801599575922, -0.14112695442357412, 0.06454598122857136, 0.1722395556190839, 0.15634778689624917, -0.1346749942258456, 0.13584169817781952, -0.07495526835903461, 0.173500858557721, 0.06333686422524798, 0.07518580402685408, 0.04418263966456438, 0.09960240552910309, 0.21922098443361843, 0.12693087561016217, 0.006502157910508064, -0.09862908823654437, -0.38264397560403896, -0.15099403533376116, -0.1971044887561733, 0.127653994374614, -0.10763158492766854, -0.198271058467973, 0.3475751756147171, 0.143525871518864, 0.15264707470201275, 0.13202535833976367, 0.2008897794299146, 0.20491311995812062, 0.01539336666604106, 0.07390825482658468, 0.2265529748943881, 0.15449013943489417, 0.10114671662847838, -0.1936215957045619, 0.14098791766147584, 0.16463839452371448] |
1,802.03975 | Review on the conversion of thermoacoustic power into electricity | Thermoacoustic engines convert heat energy into high amplitude acoustic waves
and subsequently into electric power. This article provides a review of the
four main methods to convert the (thermo)acoustic power into electricity.
First, loudspeakers and linear alternators are discussed in a section on
electromagnetic devices. This is followed by sections on piezoelectric
transducers, magnetohydrodynamic generators, and bidirectional turbines. Each
segment provides a literature review of the given technology for the field of
thermoacoustics, focusing on possible configurations, operating
characteristics, output performance, and analytical and numerical methods to
study the devices. This information is used as an input to discuss the
performance and feasibility of each method, and to identify challenges that
should be overcome for a more successful implementation in thermoacoustic
engines. The work is concluded by a comparison of the four technologies,
concentrating on the possible areas of application, the conversion efficiency,
maximum electrical power output and more generally the suggested focus for
future work in the field.
| physics.flu-dyn | thermoacoustic engines convert heat energy into high amplitude acoustic waves and subsequently into electric power this article provides a review of the four main methods to convert the thermoacoustic power into electricity first loudspeakers and linear alternators are discussed in a section on electromagnetic devices this is followed by sections on piezoelectric transducers magnetohydrodynamic generators and bidirectional turbines each segment provides a literature review of the given technology for the field of thermoacoustics focusing on possible configurations operating characteristics output performance and analytical and numerical methods to study the devices this information is used as an input to discuss the performance and feasibility of each method and to identify challenges that should be overcome for a more successful implementation in thermoacoustic engines the work is concluded by a comparison of the four technologies concentrating on the possible areas of application the conversion efficiency maximum electrical power output and more generally the suggested focus for future work in the field | [['thermoacoustic', 'engines', 'convert', 'heat', 'energy', 'into', 'high', 'amplitude', 'acoustic', 'waves', 'and', 'subsequently', 'into', 'electric', 'power', 'this', 'article', 'provides', 'a', 'review', 'of', 'the', 'four', 'main', 'methods', 'to', 'convert', 'the', 'thermoacoustic', 'power', 'into', 'electricity', 'first', 'loudspeakers', 'and', 'linear', 'alternators', 'are', 'discussed', 'in', 'a', 'section', 'on', 'electromagnetic', 'devices', 'this', 'is', 'followed', 'by', 'sections', 'on', 'piezoelectric', 'transducers', 'magnetohydrodynamic', 'generators', 'and', 'bidirectional', 'turbines', 'each', 'segment', 'provides', 'a', 'literature', 'review', 'of', 'the', 'given', 'technology', 'for', 'the', 'field', 'of', 'thermoacoustics', 'focusing', 'on', 'possible', 'configurations', 'operating', 'characteristics', 'output', 'performance', 'and', 'analytical', 'and', 'numerical', 'methods', 'to', 'study', 'the', 'devices', 'this', 'information', 'is', 'used', 'as', 'an', 'input', 'to', 'discuss', 'the', 'performance', 'and', 'feasibility', 'of', 'each', 'method', 'and', 'to', 'identify', 'challenges', 'that', 'should', 'be', 'overcome', 'for', 'a', 'more', 'successful', 'implementation', 'in', 'thermoacoustic', 'engines', 'the', 'work', 'is', 'concluded', 'by', 'a', 'comparison', 'of', 'the', 'four', 'technologies', 'concentrating', 'on', 'the', 'possible', 'areas', 'of', 'application', 'the', 'conversion', 'efficiency', 'maximum', 'electrical', 'power', 'output', 'and', 'more', 'generally', 'the', 'suggested', 'focus', 'for', 'future', 'work', 'in', 'the', 'field']] | [-0.12361573991719398, 0.05756273574375951, -0.010841874550155636, 0.033371394162679306, -0.10246787535003092, -0.11410148083703898, 0.028607453231381464, 0.3628866906525402, -0.23750086010233323, -0.27824181162374967, 0.1309214339693242, -0.2818934472890783, -0.11861724382903002, 0.3238428321083465, -0.04362006769279796, 0.0694077723435586, 0.046344236895159076, 0.030730650948855697, -0.015179317983167977, -0.190996535101764, 0.2799497959616629, 0.09357549701051056, 0.36091226213788496, 0.06452201423824683, 0.11065866156257217, -0.03345898986179559, -0.04844909556551919, 0.016009995163436035, -0.11228683039725977, 0.14360065171436134, 0.27875201190715726, 0.13743651137964305, 0.2780824911197105, -0.47772455440621964, -0.23232478508725762, 0.04283687914132223, 0.11874274207983472, 0.08611214567046566, -0.07622052713896331, -0.21200425094700878, 0.07563851457391275, -0.1711519740734108, -0.05467165655237652, -0.0592196725597723, 0.022191279660615647, 0.05800103302602951, -0.24225001921877265, -0.015487990319608015, 0.05642727466117402, 0.02278476311895949, -0.053510253020905583, -0.10849417109466807, 0.014800806659497793, 0.11276010592848275, 0.03887498782081176, -0.016363536036437778, 0.15121584416874037, -0.15516480109860672, -0.14534257491313723, 0.3859850316046136, -0.030392228718552315, -0.1838737194797708, 0.14793723345221363, -0.08845602759289779, -0.08594009328686597, 0.10668118962947326, 0.23933714642955722, 0.08244900742864024, -0.19502043282566003, 0.02655131881467149, 0.05547006164428401, 0.16498743238729202, 0.06789503530363399, 0.02622512343657922, 0.2335422392448269, 0.23472404266306776, 0.04148209984473224, 0.18642882188366539, -0.08345298919954951, -0.0343230678368348, -0.2828069842785974, -0.18516188686937565, -0.14808115776321745, 0.03458593294165934, -0.024237468028113194, -0.12039226453892793, 0.44133312975445504, 0.19646563155125663, 0.15276216767150672, -0.0011499314974180034, 0.41020138081917656, 0.11977505673215241, 0.04107511377174266, 0.0655778703144221, 0.2575431609573432, 0.13234855230644205, 0.1687675203680049, -0.21034593809737906, 0.01938393952831909, 0.04022226263798443] |
1,802.03976 | Reinforcement Learning with Wasserstein Distance Regularisation, with
Applications to Multipolicy Learning | We describe an application of Wasserstein distance to Reinforcement Learning.
The Wasserstein distance in question is between the distribution of mappings of
trajectories of a policy into some metric space, and some other fixed
distribution (which may, for example, come from another policy). Different
policies induce different distributions, so given an underlying metric, the
Wasserstein distance quantifies how different policies are. This can be used to
learn multiple polices which are different in terms of such Wasserstein
distances by using a Wasserstein regulariser. Changing the sign of the
regularisation parameter, one can learn a policy for which its trajectory
mapping distribution is attracted to a given fixed distribution.
| cs.LG cs.AI | we describe an application of wasserstein distance to reinforcement learning the wasserstein distance in question is between the distribution of mappings of trajectories of a policy into some metric space and some other fixed distribution which may for example come from another policy different policies induce different distributions so given an underlying metric the wasserstein distance quantifies how different policies are this can be used to learn multiple polices which are different in terms of such wasserstein distances by using a wasserstein regulariser changing the sign of the regularisation parameter one can learn a policy for which its trajectory mapping distribution is attracted to a given fixed distribution | [['we', 'describe', 'an', 'application', 'of', 'wasserstein', 'distance', 'to', 'reinforcement', 'learning', 'the', 'wasserstein', 'distance', 'in', 'question', 'is', 'between', 'the', 'distribution', 'of', 'mappings', 'of', 'trajectories', 'of', 'a', 'policy', 'into', 'some', 'metric', 'space', 'and', 'some', 'other', 'fixed', 'distribution', 'which', 'may', 'for', 'example', 'come', 'from', 'another', 'policy', 'different', 'policies', 'induce', 'different', 'distributions', 'so', 'given', 'an', 'underlying', 'metric', 'the', 'wasserstein', 'distance', 'quantifies', 'how', 'different', 'policies', 'are', 'this', 'can', 'be', 'used', 'to', 'learn', 'multiple', 'polices', 'which', 'are', 'different', 'in', 'terms', 'of', 'such', 'wasserstein', 'distances', 'by', 'using', 'a', 'wasserstein', 'regulariser', 'changing', 'the', 'sign', 'of', 'the', 'regularisation', 'parameter', 'one', 'can', 'learn', 'a', 'policy', 'for', 'which', 'its', 'trajectory', 'mapping', 'distribution', 'is', 'attracted', 'to', 'a', 'given', 'fixed', 'distribution']] | [-0.09597887659307432, 0.08523404125271891, -0.1626457928472923, 0.12986116101469466, -0.11291020591010305, -0.13769830316218926, 0.02876401318590743, 0.43811331168506984, -0.4072393027858602, -0.29837706221129606, 0.03853878733503667, -0.26822403595023964, -0.13800431622399223, 0.17744757787052853, -0.15440317935362044, 0.08912831691419275, 0.026919357819241232, 0.047220408414162834, -0.1124276844267216, -0.1999722278797654, 0.39648196535805863, 0.037867415045319056, 0.28439568609421795, 0.007285045856540954, 0.1579194425398277, -0.03254603520811846, 0.02768781144792835, 0.025457872250020348, -0.11096345224090058, 0.16405098641256768, 0.26726894335243506, 0.21211194003828698, 0.34845162361118664, -0.35408092898972054, -0.22986184035565843, 0.1696539460638262, 0.09074081288848969, 0.06010436327131982, -0.01519146035921208, -0.3135511672244994, 0.05838839245822142, -0.16364380424083383, -0.061114563063407935, -0.07029616619736233, 0.0009199404502632442, 0.05655732861271611, -0.3048819721400462, -0.0277362861411853, 0.030920876194378017, 0.020592871738632244, -0.06496270235813292, -0.10707482784400107, -0.014937434267873565, 0.23848448560090252, 0.10642709551568798, 0.12000606705745061, 0.13903711529672835, -0.07899617673441146, -0.13252485641580145, 0.348795000291257, -0.0529918250006934, -0.27481337199073835, 0.16157170833321288, -0.07995363861684585, -0.07660265691595634, 0.050532897701486945, 0.2574931373302307, 0.15285361907013725, -0.19158370192680094, 0.059797814753471394, -0.034573706091140154, 0.09219003801613494, 0.07215225349689179, 0.03214288276137301, 0.1479145391279383, 0.12938316702773725, 0.1599819321806232, 0.12414315467456752, -0.09159609834077181, -0.1792889956333157, -0.2688815854452076, -0.12890369687401862, -0.22395946328416122, 0.0457195705168016, -0.20719215458814655, -0.1507594599078638, 0.3592078225402575, 0.1451242541176422, 0.29236183479359307, 0.09918467264409021, 0.23710724995126603, 0.1093914184063949, 0.05127727415809339, 0.11591668396377591, 0.1990834999343389, 0.032013738487337295, 0.045362788209415694, -0.15272973343962803, 0.15944464722458548, 0.07936304264391462] |
1,802.03977 | Anosov diffeomorphism with a horseshoe that attracts almost any point | We present an example of a C1 Anosov diffeomorphism of a two-torus with a
physical measure such that its basin has full Lebesgue measure and its support
is a horseshoe of zero measure.
| math.DS | we present an example of a c1 anosov diffeomorphism of a twotorus with a physical measure such that its basin has full lebesgue measure and its support is a horseshoe of zero measure | [['we', 'present', 'an', 'example', 'of', 'a', 'c1', 'anosov', 'diffeomorphism', 'of', 'a', 'twotorus', 'with', 'a', 'physical', 'measure', 'such', 'that', 'its', 'basin', 'has', 'full', 'lebesgue', 'measure', 'and', 'its', 'support', 'is', 'a', 'horseshoe', 'of', 'zero', 'measure']] | [-0.2085629842723861, 0.08192427573896677, -0.20151189765469593, 0.05580884682818909, -0.07557002404196696, -0.11741412253203717, 0.0452905090906742, 0.3246977250797279, -0.2518049476273132, -0.12210449792275374, 0.19354122563857923, -0.30979056938579586, -0.1430061407048594, 0.1613970799936038, -0.13113969881934198, 0.11029167134300664, 0.044794408096508545, 0.12555933904580094, -0.0828984185531171, -0.13339274411908153, 0.36895987572092, -0.00985256458322207, 0.19925069807548867, 0.09953866168066408, 0.2285752228715203, -0.12450889898746302, -0.006853208947700985, 0.019192823328811563, -0.18924023595635928, 0.10273346228694374, 0.1356798569587144, 0.1684815174138004, 0.2994504638693549, -0.2790165999622056, -0.268621337430721, 0.1845716226733092, 0.08637052678474874, -0.020189680046204365, -0.06912927592003887, -0.31760226435620675, 0.09266045435585758, -0.18700938764959574, -0.24939505024954225, -0.13350293940554062, 0.11604758521372621, 0.0075382488695057955, -0.2407129674190373, 0.007759190474947293, 0.1591418840160424, 0.18806164364584468, -0.10624050702476366, -0.0016509968730987925, -0.1383973630427411, 0.1621945583346215, 0.06105746982344003, 0.15572788749793262, 0.16484451591686317, 0.0019493370994248173, -0.10638604480349882, 0.39395985269749706, -0.1650556821771192, -0.29454553449018434, 0.24323495604436507, -0.19809193765236574, -0.13296159297566523, 0.1238025081851943, 0.13887376153390063, 0.08027808244029681, -0.10015457453714176, 0.17675916024900012, -0.13370592092079195, 0.12810013321877428, -0.01186083085044767, 0.010609613011845133, 0.19502961531168583, 0.18220543708990922, 0.251243543387814, 0.14196826037809704, -0.0986178522985993, -0.027841133714625328, -0.3082194801871524, -0.2325746976685795, -0.19113732422843124, 0.1357458367322882, -0.09934492450106931, -0.26556235616744467, 0.4107531528129722, 0.08091116851816575, 0.22537806878487268, 0.10730656724648946, 0.24291252412579276, 0.10859091483959646, 0.051812980475722616, 0.04908450793079806, 0.17185542766343465, 0.1708542906650991, -0.0013150300153277137, -0.15272181910095792, -0.03069606650564255, 0.06762212481011044] |
1,802.03978 | Crossed modules, double group-groupoids and crossed squares | In this paper using split extensions of group-groupoids we obtain the notion
of crossed modules over group-grouoids which are also called 2-groups and we
prove a categorical equivalence of these types of crossed modules and double
group-groupoids which are internal to the category of group-groupoids. This
equivalence enables us to produce more examples of double groupoids.
| math.CT math.AT | in this paper using split extensions of groupgroupoids we obtain the notion of crossed modules over groupgrouoids which are also called 2groups and we prove a categorical equivalence of these types of crossed modules and double groupgroupoids which are internal to the category of groupgroupoids this equivalence enables us to produce more examples of double groupoids | [['in', 'this', 'paper', 'using', 'split', 'extensions', 'of', 'groupgroupoids', 'we', 'obtain', 'the', 'notion', 'of', 'crossed', 'modules', 'over', 'groupgrouoids', 'which', 'are', 'also', 'called', '2groups', 'and', 'we', 'prove', 'a', 'categorical', 'equivalence', 'of', 'these', 'types', 'of', 'crossed', 'modules', 'and', 'double', 'groupgroupoids', 'which', 'are', 'internal', 'to', 'the', 'category', 'of', 'groupgroupoids', 'this', 'equivalence', 'enables', 'us', 'to', 'produce', 'more', 'examples', 'of', 'double', 'groupoids']] | [-0.12894675190433522, 0.08594587817788124, -0.07964040352539582, 0.09534884120168334, -0.12335867790335958, -0.10848844194446097, 0.017999768733385612, 0.4090760041366924, -0.376953004503792, -0.2505090912465345, 0.06413714113348926, -0.18673953919708516, -0.1430070774121718, 0.22377376180480826, -0.17678349571810528, -0.09654744365675882, 0.0763647070323879, 0.08434084884145043, -0.11034931139173833, -0.2740906982936642, 0.4440677863630382, -0.008873611451549964, 0.22463773864914072, 0.017459850986911492, 0.12987755669958212, 0.02699067208873616, -0.04155520341274413, 0.03217448043552312, -0.15647784030615267, 0.20709037161008878, 0.3141022377859124, 0.0733619732401249, 0.20008117194414476, -0.3687922614541921, -0.0627613005651669, 0.1668684647841887, 0.09878315922211517, 0.029446961760351605, 0.026241173077406445, -0.30897376970811324, 0.12837219348346646, -0.31455259465358476, -0.06118252964859659, -0.11706904211843555, 0.0003364391561428254, 0.03229898061941971, -0.24765970754352482, -0.05881147285214287, 0.1303280475803397, 0.07253426404839212, -0.06678352791138671, 0.0007594808639789169, -0.02661376689899374, 0.11505426311526787, -0.05226978077129884, -0.10937151468612931, 0.09504761525683782, -0.06489137616855177, -0.18867335708981212, 0.31941248313947157, -0.00864375370808623, -0.1808216667056761, 0.2113089960407127, -0.12688177994198419, -0.19138673935085534, 0.10388437026942318, 0.06311113625256852, 0.1286135516722094, -0.07678386833180081, 0.12208864360158755, -0.13528611458499323, 0.01625378562603146, 0.1346436134454879, 0.055937829054892065, 0.12192803003232587, 0.10697562379593199, 0.07657776068557393, 0.21464384436099368, -0.025206597987562418, -0.03532800240103494, -0.3597278861159628, -0.24009263854981824, 0.05518071968108416, 0.0894236386668953, -0.007429219121430916, -0.21504412423819302, 0.44472581960938196, 0.1603474984792146, 0.169256848892705, 0.13892507841387255, 0.20558236221020873, 0.03873345253311775, 0.1407239833338694, -0.011924326707693663, 0.1517121605236422, 0.29320122423497114, -0.0481034525860609, -0.057364925526251845, -0.05271085937592116, 0.16033278119496325] |
1,802.03979 | Gyrotropic resonance of individual N\'eel skyrmions in Ir/Fe/Co/Pt
multilayers | Magnetic skyrmions are nanoscale spin structures recently discovered at room
temperature (RT) in multilayer films. Employing their novel topological
properties towards exciting technological prospects requires a mechanistic
understanding of the excitation and relaxation mechanisms governing their
stability and dynamics. Here we report on the magnetization dynamics of RT
N\'eel skyrmions in Ir/Fe/Co/Pt multilayer films. We observe a ubiquitous
excitation mode in the microwave absorption spectrum, arising from the
gyrotropic resonance of topological skyrmions, and robust over a wide range of
temperatures and sample compositions. A combination of simulations and
analytical calculations establish that the spectrum is shaped by the interplay
of interlayer and interfacial magnetic interactions unique to multilayers,
yielding skyrmion resonances strongly renormalized to lower frequencies. Our
work provides fundamental spectroscopic insights on the spatiotemporal dynamics
of topological spin structures, and crucial directions towards their
functionalization in nanoscale devices.
| cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el | magnetic skyrmions are nanoscale spin structures recently discovered at room temperature rt in multilayer films employing their novel topological properties towards exciting technological prospects requires a mechanistic understanding of the excitation and relaxation mechanisms governing their stability and dynamics here we report on the magnetization dynamics of rt neel skyrmions in irfecopt multilayer films we observe a ubiquitous excitation mode in the microwave absorption spectrum arising from the gyrotropic resonance of topological skyrmions and robust over a wide range of temperatures and sample compositions a combination of simulations and analytical calculations establish that the spectrum is shaped by the interplay of interlayer and interfacial magnetic interactions unique to multilayers yielding skyrmion resonances strongly renormalized to lower frequencies our work provides fundamental spectroscopic insights on the spatiotemporal dynamics of topological spin structures and crucial directions towards their functionalization in nanoscale devices | [['magnetic', 'skyrmions', 'are', 'nanoscale', 'spin', 'structures', 'recently', 'discovered', 'at', 'room', 'temperature', 'rt', 'in', 'multilayer', 'films', 'employing', 'their', 'novel', 'topological', 'properties', 'towards', 'exciting', 'technological', 'prospects', 'requires', 'a', 'mechanistic', 'understanding', 'of', 'the', 'excitation', 'and', 'relaxation', 'mechanisms', 'governing', 'their', 'stability', 'and', 'dynamics', 'here', 'we', 'report', 'on', 'the', 'magnetization', 'dynamics', 'of', 'rt', 'neel', 'skyrmions', 'in', 'irfecopt', 'multilayer', 'films', 'we', 'observe', 'a', 'ubiquitous', 'excitation', 'mode', 'in', 'the', 'microwave', 'absorption', 'spectrum', 'arising', 'from', 'the', 'gyrotropic', 'resonance', 'of', 'topological', 'skyrmions', 'and', 'robust', 'over', 'a', 'wide', 'range', 'of', 'temperatures', 'and', 'sample', 'compositions', 'a', 'combination', 'of', 'simulations', 'and', 'analytical', 'calculations', 'establish', 'that', 'the', 'spectrum', 'is', 'shaped', 'by', 'the', 'interplay', 'of', 'interlayer', 'and', 'interfacial', 'magnetic', 'interactions', 'unique', 'to', 'multilayers', 'yielding', 'skyrmion', 'resonances', 'strongly', 'renormalized', 'to', 'lower', 'frequencies', 'our', 'work', 'provides', 'fundamental', 'spectroscopic', 'insights', 'on', 'the', 'spatiotemporal', 'dynamics', 'of', 'topological', 'spin', 'structures', 'and', 'crucial', 'directions', 'towards', 'their', 'functionalization', 'in', 'nanoscale', 'devices']] | [-0.20902729282928964, 0.20128815084296678, -0.0693578484522212, -0.01163591437424267, -0.09552753590313452, -0.10021124336469386, 0.07111647691344843, 0.43159576611859457, -0.2834055554953271, -0.29329773421798433, 0.01421935762835866, -0.2690230746254591, -0.15996203336066434, 0.22021251551840187, 0.09253559689061928, 0.05334832186677626, -0.03257728222025824, -0.11286619720922317, -0.02470891728132431, -0.12354956319821732, 0.2688629410395931, 0.03574640631060382, 0.34358546577527055, 0.12215649206690224, 0.055956408018911524, -0.020667780508353772, 0.08841994376187878, 6.790516365851675e-05, -0.2159263275142231, 0.10891603087075055, 0.2585757169556538, -0.08078434121063245, 0.19174530078250557, -0.49421226227230886, -0.2531372407318226, -0.03455105446451593, 0.16731334434090447, 0.1665947810347591, -0.10953422432732103, -0.27776237744838, 0.07953177900053561, -0.08348754023068718, -0.13568919380351352, -0.17256704954031324, 0.011245613738096186, -0.0012213811976835131, -0.19919071155309212, 0.0818879703725023, 0.07587797003798187, 0.13418013002576898, -0.13538177589954492, -0.11907250487378665, -0.09103338963967482, 0.07711294799394507, 0.0025805418096881893, -0.014982917280368773, 0.19898032996404383, -0.17226383129350975, -0.15669962474743704, 0.34088021154249354, -0.028747535097811902, -0.07650797349799957, 0.21473069138924725, -0.193384114104057, -0.0695495922833548, 0.149064553023449, 0.17215723559992122, 0.13009715788399, -0.1411362045244979, 0.059429016914301816, 0.05273176135628351, 0.16763736763303833, 0.049052009475417435, 0.14317154054130826, 0.3271176504370357, 0.24631105077652526, 0.040636329622274, 0.13900040711741896, -0.10298257410260184, -0.06367075817792543, -0.16619751800317317, -0.13732099310644635, -0.18410877971972306, 0.09303577999151977, -0.08940073736937068, -0.1765047162904271, 0.4516336975486151, 0.15276222078661833, 0.16101485650786865, -0.03172230328034077, 0.24820843484984445, 0.0528510144421099, 0.0536894050160689, -0.008774594014643559, 0.2602322998124042, 0.220460880396422, 0.15802848973960085, -0.29126343854337133, 0.05405402470662791, -0.030073260510939042] |
1,802.0398 | Integration of Absolute Orientation Measurements in the KinectFusion
Reconstruction pipeline | In this paper, we show how absolute orientation measurements provided by
low-cost but high-fidelity IMU sensors can be integrated into the KinectFusion
pipeline. We show that integration improves both runtime, robustness and
quality of the 3D reconstruction. In particular, we use this orientation data
to seed and regularize the ICP registration technique. We also present a
technique to filter the pairs of 3D matched points based on the distribution of
their distances. This filter is implemented efficiently on the GPU. Estimating
the distribution of the distances helps control the number of iterations
necessary for the convergence of the ICP algorithm. Finally, we show
experimental results that highlight improvements in robustness, a speed-up of
almost 12%, and a gain in tracking quality of 53% for the ATE metric on the
Freiburg benchmark.
| cs.CV | in this paper we show how absolute orientation measurements provided by lowcost but highfidelity imu sensors can be integrated into the kinectfusion pipeline we show that integration improves both runtime robustness and quality of the 3d reconstruction in particular we use this orientation data to seed and regularize the icp registration technique we also present a technique to filter the pairs of 3d matched points based on the distribution of their distances this filter is implemented efficiently on the gpu estimating the distribution of the distances helps control the number of iterations necessary for the convergence of the icp algorithm finally we show experimental results that highlight improvements in robustness a speedup of almost 12 and a gain in tracking quality of 53 for the ate metric on the freiburg benchmark | [['in', 'this', 'paper', 'we', 'show', 'how', 'absolute', 'orientation', 'measurements', 'provided', 'by', 'lowcost', 'but', 'highfidelity', 'imu', 'sensors', 'can', 'be', 'integrated', 'into', 'the', 'kinectfusion', 'pipeline', 'we', 'show', 'that', 'integration', 'improves', 'both', 'runtime', 'robustness', 'and', 'quality', 'of', 'the', '3d', 'reconstruction', 'in', 'particular', 'we', 'use', 'this', 'orientation', 'data', 'to', 'seed', 'and', 'regularize', 'the', 'icp', 'registration', 'technique', 'we', 'also', 'present', 'a', 'technique', 'to', 'filter', 'the', 'pairs', 'of', '3d', 'matched', 'points', 'based', 'on', 'the', 'distribution', 'of', 'their', 'distances', 'this', 'filter', 'is', 'implemented', 'efficiently', 'on', 'the', 'gpu', 'estimating', 'the', 'distribution', 'of', 'the', 'distances', 'helps', 'control', 'the', 'number', 'of', 'iterations', 'necessary', 'for', 'the', 'convergence', 'of', 'the', 'icp', 'algorithm', 'finally', 'we', 'show', 'experimental', 'results', 'that', 'highlight', 'improvements', 'in', 'robustness', 'a', 'speedup', 'of', 'almost', '12', 'and', 'a', 'gain', 'in', 'tracking', 'quality', 'of', '53', 'for', 'the', 'ate', 'metric', 'on', 'the', 'freiburg', 'benchmark']] | [-0.09061167024801137, -0.008967969436838313, -0.09473740911459592, 0.014591357183735106, -0.024578633188547295, -0.08857903929866268, 0.04819597168878887, 0.4538180354044183, -0.24533838805038738, -0.3607393359011821, 0.09792328751041689, -0.24961416381731175, -0.14381957322870956, 0.22904422686733875, -0.11889079510490232, 0.10658299824834325, 0.12464382292574826, 0.01413809805966288, -0.08743694972692108, -0.29017456424714044, 0.24886728392714877, 0.07778453953805885, 0.3263721878050279, 0.03815646001265761, 0.13376159556938746, 0.0066002988156983414, -0.0411399592670349, 0.02028156701077259, -0.09572393055847501, 0.17302347317992048, 0.19890494677344805, 0.18540327628107586, 0.2766145166464662, -0.3821722126462788, -0.15320264062495859, 0.0578140422580977, 0.1565911571090003, 0.09937599271478999, -0.08425699850412811, -0.28214078157685185, 0.11466512740198664, -0.12933796151534063, -0.07316357791708171, -0.10215658330507861, -0.04488507361767346, 0.03715360053736745, -0.30934686299043757, 0.038004129803126306, 0.0454789150047706, 0.0380120552322678, -0.05525268744926132, -0.08362885459169803, 0.00954164516976999, 0.16713109394119527, -0.019978404097536307, 0.0366547082520609, 0.13651265822820194, -0.11850225547406794, -0.11316561206947756, 0.34278594485292113, -0.06258721216199635, -0.23626156669565057, 0.16220882274245998, -0.10386822185699494, -0.11058351016276381, 0.10686714858357005, 0.235667931520245, 0.12142593593812967, -0.14109168701115568, 0.04306187365203096, 0.002538488790364438, 0.1902213136430915, 0.04568881467020296, 0.01445937359293226, 0.11571448304839717, 0.19082006254896142, 0.09831228059936913, 0.15482550294970282, -0.17408072019088303, -0.03252035356837659, -0.28081746122405243, -0.186278443502703, -0.19907937368434916, -0.01765860416677617, -0.12942105667447434, -0.14822608671854925, 0.4120366538000357, 0.28044948891828986, 0.21683745052068287, 0.07047299585724605, 0.36936933840162883, 0.047254657108898326, 0.05652997431786062, 0.08578604323618853, 0.23930379602603102, 0.05700138076484018, 0.08120710184115149, -0.2349244903893928, 0.044332626435678195, 0.04586381811643275] |
1,802.03981 | Spectral Filtering for General Linear Dynamical Systems | We give a polynomial-time algorithm for learning latent-state linear
dynamical systems without system identification, and without assumptions on the
spectral radius of the system's transition matrix. The algorithm extends the
recently introduced technique of spectral filtering, previously applied only to
systems with a symmetric transition matrix, using a novel convex relaxation to
allow for the efficient identification of phases.
| cs.LG cs.SY stat.ML | we give a polynomialtime algorithm for learning latentstate linear dynamical systems without system identification and without assumptions on the spectral radius of the systems transition matrix the algorithm extends the recently introduced technique of spectral filtering previously applied only to systems with a symmetric transition matrix using a novel convex relaxation to allow for the efficient identification of phases | [['we', 'give', 'a', 'polynomialtime', 'algorithm', 'for', 'learning', 'latentstate', 'linear', 'dynamical', 'systems', 'without', 'system', 'identification', 'and', 'without', 'assumptions', 'on', 'the', 'spectral', 'radius', 'of', 'the', 'systems', 'transition', 'matrix', 'the', 'algorithm', 'extends', 'the', 'recently', 'introduced', 'technique', 'of', 'spectral', 'filtering', 'previously', 'applied', 'only', 'to', 'systems', 'with', 'a', 'symmetric', 'transition', 'matrix', 'using', 'a', 'novel', 'convex', 'relaxation', 'to', 'allow', 'for', 'the', 'efficient', 'identification', 'of', 'phases']] | [-0.0964788115441294, 0.01409737012838408, -0.12137978656564728, 0.026112795981057618, -0.08214953194482852, -0.2056399443348617, 0.061783600424937274, 0.3895518746921572, -0.2519462714445288, -0.30703140566346504, 0.13263757093572767, -0.18458469682452033, -0.18227615210590725, 0.17733720617400386, -0.02335033474205914, 0.14911274277305198, 0.03707974787675223, 0.01034012063548474, -0.16006256988808765, -0.18529924117739044, 0.32711771316037086, 0.02780265086409399, 0.2437542148439561, 0.0016253672666468862, 0.12124844943567858, 0.07308354753985118, 0.0013850511099069806, 0.015888900006726638, -0.11200093369836271, 0.11731829801258647, 0.23092799413933465, 0.16554831226466823, 0.2506198189773802, -0.3637387555534557, -0.23396131935355774, 0.12339806936333998, 0.12657616941763436, 0.129874396358885, -0.08612424520167948, -0.29245918143098637, 0.08438638094181226, -0.1736984386156171, -0.09362187634332705, -0.11515415932635888, -0.002030632908503383, -0.0031024985394235384, -0.3323324214730222, 0.08103700675133427, 0.11892062015742678, 0.03419517738728831, -0.05608240912384275, -0.12764511982539384, 0.08974959709981488, 0.08093919924665559, -0.06028927071809263, -0.018247195661573085, 0.10911512427758109, -0.05680419750890489, -0.1615567000551244, 0.3453329766516463, -0.04353030020236906, -0.17746809630070703, 0.21468910192912918, -0.050920164129959214, -0.16172357547191618, 0.208125730439768, 0.2148484035189879, 0.16177022390825263, -0.16302640112590486, 0.08204383118831853, -0.007730082504182927, 0.20947740664824022, -0.00857588400969566, 0.010731032757498956, 0.13759733468167862, 0.1763705034124649, 0.13012977028107744, 0.14922158565309088, -0.04154557230787636, -0.08866159920975314, -0.19647415402203294, -0.1320453585378068, -0.20414791725007658, -0.006262374828743227, -0.09343471571431156, -0.18795376903203836, 0.4056164133914952, 0.13111676683578388, 0.19394758872498394, 0.09630697397751954, 0.2806489037989118, 0.12599745908183818, 0.07356891331215532, 0.07912545610156099, 0.21044969833377053, 0.19071462472616615, 0.1022569538662368, -0.25359350120080476, 0.05575376782976722, 0.12987284407303748] |
1,802.03982 | A fallback accretion model for the unusual type II-P supernova iPTF14hls | The Intermediate Palomar Transient Factory reported the discovery of an
unusual type II-P supernova iPTF14hls. Instead of a ~100-day plateau as
observed for ordinary type II-P supernovae, the light curve of iPTF14hls has at
least five distinct peaks, followed by a steep decline at ~1000 days since
discovery. Until 500 days since discovery, the effective temperature of
iPTF14hls is roughly constant at 5000-6000K . In this paper we propose that
iPTF14hls is likely powered by intermittent fallback accretion. It is found
that the light curve of iPTF14hls can be well fit by the usual t^{-5/3}
accretion law until ~1000 days post discovery when the light curve transitions
to a steep decline. To account for this steep decline, we suggest a power-law
density profile for the late accreted material, rather than the constant
profile as appropriated for the t^{-5/3} accretion law. Detailed modeling
indicates that the total fallback mass is ~0.2M_{sun}, with an ejecta mass
M_{ej}~21M_{sun}. We find the third peak of the light curve cannot be well fit
by the fallback model, indicating that there could be some extra rapid energy
injection. We suggest that this extra energy injection may be a result of a
magnetic outburst if the central object is a neutron star. These results
indicate that the progenitor of iPTF14hls could be a massive red supergiant.
| astro-ph.HE | the intermediate palomar transient factory reported the discovery of an unusual type iip supernova iptf14hls instead of a 100day plateau as observed for ordinary type iip supernovae the light curve of iptf14hls has at least five distinct peaks followed by a steep decline at 1000 days since discovery until 500 days since discovery the effective temperature of iptf14hls is roughly constant at 50006000k in this paper we propose that iptf14hls is likely powered by intermittent fallback accretion it is found that the light curve of iptf14hls can be well fit by the usual t53 accretion law until 1000 days post discovery when the light curve transitions to a steep decline to account for this steep decline we suggest a powerlaw density profile for the late accreted material rather than the constant profile as appropriated for the t53 accretion law detailed modeling indicates that the total fallback mass is 02m_sun with an ejecta mass m_ej21m_sun we find the third peak of the light curve cannot be well fit by the fallback model indicating that there could be some extra rapid energy injection we suggest that this extra energy injection may be a result of a magnetic outburst if the central object is a neutron star these results indicate that the progenitor of iptf14hls could be a massive red supergiant | [['the', 'intermediate', 'palomar', 'transient', 'factory', 'reported', 'the', 'discovery', 'of', 'an', 'unusual', 'type', 'iip', 'supernova', 'iptf14hls', 'instead', 'of', 'a', '100day', 'plateau', 'as', 'observed', 'for', 'ordinary', 'type', 'iip', 'supernovae', 'the', 'light', 'curve', 'of', 'iptf14hls', 'has', 'at', 'least', 'five', 'distinct', 'peaks', 'followed', 'by', 'a', 'steep', 'decline', 'at', '1000', 'days', 'since', 'discovery', 'until', '500', 'days', 'since', 'discovery', 'the', 'effective', 'temperature', 'of', 'iptf14hls', 'is', 'roughly', 'constant', 'at', '50006000k', 'in', 'this', 'paper', 'we', 'propose', 'that', 'iptf14hls', 'is', 'likely', 'powered', 'by', 'intermittent', 'fallback', 'accretion', 'it', 'is', 'found', 'that', 'the', 'light', 'curve', 'of', 'iptf14hls', 'can', 'be', 'well', 'fit', 'by', 'the', 'usual', 't53', 'accretion', 'law', 'until', '1000', 'days', 'post', 'discovery', 'when', 'the', 'light', 'curve', 'transitions', 'to', 'a', 'steep', 'decline', 'to', 'account', 'for', 'this', 'steep', 'decline', 'we', 'suggest', 'a', 'powerlaw', 'density', 'profile', 'for', 'the', 'late', 'accreted', 'material', 'rather', 'than', 'the', 'constant', 'profile', 'as', 'appropriated', 'for', 'the', 't53', 'accretion', 'law', 'detailed', 'modeling', 'indicates', 'that', 'the', 'total', 'fallback', 'mass', 'is', '02m_sun', 'with', 'an', 'ejecta', 'mass', 'm_ej21m_sun', 'we', 'find', 'the', 'third', 'peak', 'of', 'the', 'light', 'curve', 'can', 'not', 'be', 'well', 'fit', 'by', 'the', 'fallback', 'model', 'indicating', 'that', 'there', 'could', 'be', 'some', 'extra', 'rapid', 'energy', 'injection', 'we', 'suggest', 'that', 'this', 'extra', 'energy', 'injection', 'may', 'be', 'a', 'result', 'of', 'a', 'magnetic', 'outburst', 'if', 'the', 'central', 'object', 'is', 'a', 'neutron', 'star', 'these', 'results', 'indicate', 'that', 'the', 'progenitor', 'of', 'iptf14hls', 'could', 'be', 'a', 'massive', 'red', 'supergiant']] | [-0.08554813864293255, 0.1729857379661536, -0.1313611492321479, 0.10721993742216687, -0.13605034895442975, -0.18030835375885054, 0.07707312804043791, 0.38123682258041225, -0.20861150121771246, -0.3508535548883666, 0.11636821952732151, -0.2974850106555196, -0.06522440418068852, 0.2210423520987227, -0.06988121277424277, -0.06091693707329783, 0.09739757721161595, -0.03831792623663004, -0.07640508933675214, -0.2523380974913874, 0.2617883768071064, 0.06775376009690459, 0.18712072351234987, 0.003409002263802812, 0.042188279538883176, -0.09467035429316148, -0.005910913241074382, -0.06479678072103981, -0.10551954447800102, -0.017107570041743566, 0.17951975395337813, 0.13036680559322994, 0.2065533865500705, -0.36625269621026957, -0.27406186595063414, 0.12211342960862177, 0.20950671690966813, 0.028816985952440425, -0.09639997209083237, -0.19750671834397357, 0.07402936083936316, -0.24064810668474518, -0.2174007599907262, 0.0650701181529077, 0.09797556017426783, 0.008081175773168489, -0.2281269293969437, 0.16064024250780035, 0.03860503546185448, 0.05193305234177991, -0.09632435292091375, -0.042166711142381075, -0.058172020728566816, -0.027434312489955613, 0.10329240096479757, 0.07151860843974805, 0.1414284940845492, -0.12860630308106233, -0.011599601118735248, 0.3736377801394202, -0.10752928766084262, 0.09086881108444682, 0.15444603927373404, -0.1681146950671269, -0.11372456115709129, 0.20457313410843367, 0.12032529654213085, 0.08992060804064976, -0.15043678858419635, -0.07033592001170194, -0.0028095613839963134, 0.1949709446838958, 0.027871216560417814, 0.012205277238485633, 0.33972747329073155, 0.1709177429961633, -0.020595441449515108, 0.08660965904106348, -0.1744850359960086, -0.014041443084997515, -0.28282267255021887, -0.1085612900417796, -0.13803800613906939, 0.16063204493212957, -0.12926191761059694, -0.11461256890158568, 0.37401984704221564, 0.02761758053042252, 0.2442329017990505, 0.025114870146303203, 0.26706691490580686, 0.16519957781213546, 0.11264445006735795, 0.15261214974761214, 0.3486750099089368, 0.08676956906434029, 0.162010191111452, -0.21972213612766378, 0.1455580341942986, 0.00046495849820291665] |
1,802.03983 | A Projected Entropy Controller for Transition Matrix Calculations | We define the projected entropy S(T) at a given temperature T in the context
of an Ising model transition matrix calculation as the entropy associated with
the distribution of Markov chain realizations in energy-magnetization, E-H,
space. An even sampling of states is achieved by accumulating the results from
multiple Markov chains while decrementing 1/T at a rate proportional to the
inverse of the effective number, exp(S(T)), of accessible projected states.
Such a procedure is both highly accurate and far simpler to implement than a
previously suggested method based on monitoring the evolution of the E-H
distribution at each temperature. [1] We further demonstrate a transition
matrix procedure that instead ensures uniform sampling in physical entropy.
| cond-mat.stat-mech | we define the projected entropy st at a given temperature t in the context of an ising model transition matrix calculation as the entropy associated with the distribution of markov chain realizations in energymagnetization eh space an even sampling of states is achieved by accumulating the results from multiple markov chains while decrementing 1t at a rate proportional to the inverse of the effective number expst of accessible projected states such a procedure is both highly accurate and far simpler to implement than a previously suggested method based on monitoring the evolution of the eh distribution at each temperature 1 we further demonstrate a transition matrix procedure that instead ensures uniform sampling in physical entropy | [['we', 'define', 'the', 'projected', 'entropy', 'st', 'at', 'a', 'given', 'temperature', 't', 'in', 'the', 'context', 'of', 'an', 'ising', 'model', 'transition', 'matrix', 'calculation', 'as', 'the', 'entropy', 'associated', 'with', 'the', 'distribution', 'of', 'markov', 'chain', 'realizations', 'in', 'energymagnetization', 'eh', 'space', 'an', 'even', 'sampling', 'of', 'states', 'is', 'achieved', 'by', 'accumulating', 'the', 'results', 'from', 'multiple', 'markov', 'chains', 'while', 'decrementing', '1t', 'at', 'a', 'rate', 'proportional', 'to', 'the', 'inverse', 'of', 'the', 'effective', 'number', 'expst', 'of', 'accessible', 'projected', 'states', 'such', 'a', 'procedure', 'is', 'both', 'highly', 'accurate', 'and', 'far', 'simpler', 'to', 'implement', 'than', 'a', 'previously', 'suggested', 'method', 'based', 'on', 'monitoring', 'the', 'evolution', 'of', 'the', 'eh', 'distribution', 'at', 'each', 'temperature', '1', 'we', 'further', 'demonstrate', 'a', 'transition', 'matrix', 'procedure', 'that', 'instead', 'ensures', 'uniform', 'sampling', 'in', 'physical', 'entropy']] | [-0.09888357433833574, 0.16534686629203957, -0.0628777581977805, 0.05003040015754666, -0.00031875584503276305, -0.13851892367707924, 0.07785435216174576, 0.366109530359768, -0.26659593611890287, -0.27869353446856204, 0.098855852411872, -0.27469154217754277, -0.08104155281264531, 0.1634163858691688, 0.014279504751851945, 0.06691200865367264, 0.01877634501770923, 0.08448065431755886, -0.11326795639551915, -0.18406985064543652, 0.275167951634023, 0.09995835951300697, 0.3121442504537602, 0.0069966811090381, 0.13251854661492662, 0.035927974970259687, 0.011012784479055227, 0.01581464640427536, -0.12247541655712044, 0.0770750510610493, 0.21412468922177427, 0.10682610717700108, 0.261871399145508, -0.3660913604524052, -0.21752088695862576, 0.10710160355818898, 0.13220133991419794, 0.1259850693372356, -0.02915314672894678, -0.25364505915020247, 0.06324159950548947, -0.19669349709721773, -0.10338030017405879, -0.0489642436109614, 0.0006754518192457525, -0.024585856705303548, -0.306095025020145, 0.07465016788046341, 0.041734905235403984, 0.050082359275078044, -0.03694880037903459, -0.12051637890225832, -0.04350643099710476, 0.07460311698531241, 0.008029299113172385, 0.0485877690289431, 0.13058541735160378, -0.09083870911088429, -0.10917291236763592, 0.3132124148092739, -0.06917562626525371, -0.17963927054753234, 0.18766362634446604, -0.11562376997735874, -0.13593290810138314, 0.16892456577012413, 0.13306945652022892, 0.15177368138214214, -0.13690182406520635, 0.07311758380168804, 0.007101538444035931, 0.15128212713987746, 0.006696123021180954, 0.03083311364038341, 0.1947847831638922, 0.16511253777303195, 0.09711371812757039, 0.17103132418796713, -0.08620077333864429, -0.12932001600009307, -0.2931366035303207, -0.16887569548488132, -0.27810974997108834, 0.03926600163328674, -0.10126598745473689, -0.16294924885426698, 0.3740697485893115, 0.16346946655310826, 0.24563520725228286, 0.09584988268059597, 0.2511966398880376, 0.1454194138110452, 0.03787428409723042, 0.09343892601400353, 0.16373304235585556, 0.1320845389007509, 0.06993314389163922, -0.2332987162966706, 0.09239400083019414, 0.07142068968606875] |
1,802.03984 | SPINE: Structural Identity Preserved Inductive Network Embedding | Recent advances in the field of network embedding have shown that
low-dimensional network representation is playing a critical role in network
analysis. Most existing network embedding methods encode the local proximity of
a node, such as the first- and second-order proximities. While being efficient,
these methods are short of leveraging the global structural information between
nodes distant from each other. In addition, most existing methods learn
embeddings on one single fixed network, and thus cannot be generalized to
unseen nodes or networks without retraining. In this paper we present SPINE, a
method that can jointly capture the local proximity and proximities at any
distance, while being inductive to efficiently deal with unseen nodes or
networks. Extensive experimental results on benchmark datasets demonstrate the
superiority of the proposed framework over the state of the art.
| cs.SI | recent advances in the field of network embedding have shown that lowdimensional network representation is playing a critical role in network analysis most existing network embedding methods encode the local proximity of a node such as the first and secondorder proximities while being efficient these methods are short of leveraging the global structural information between nodes distant from each other in addition most existing methods learn embeddings on one single fixed network and thus cannot be generalized to unseen nodes or networks without retraining in this paper we present spine a method that can jointly capture the local proximity and proximities at any distance while being inductive to efficiently deal with unseen nodes or networks extensive experimental results on benchmark datasets demonstrate the superiority of the proposed framework over the state of the art | [['recent', 'advances', 'in', 'the', 'field', 'of', 'network', 'embedding', 'have', 'shown', 'that', 'lowdimensional', 'network', 'representation', 'is', 'playing', 'a', 'critical', 'role', 'in', 'network', 'analysis', 'most', 'existing', 'network', 'embedding', 'methods', 'encode', 'the', 'local', 'proximity', 'of', 'a', 'node', 'such', 'as', 'the', 'first', 'and', 'secondorder', 'proximities', 'while', 'being', 'efficient', 'these', 'methods', 'are', 'short', 'of', 'leveraging', 'the', 'global', 'structural', 'information', 'between', 'nodes', 'distant', 'from', 'each', 'other', 'in', 'addition', 'most', 'existing', 'methods', 'learn', 'embeddings', 'on', 'one', 'single', 'fixed', 'network', 'and', 'thus', 'can', 'not', 'be', 'generalized', 'to', 'unseen', 'nodes', 'or', 'networks', 'without', 'retraining', 'in', 'this', 'paper', 'we', 'present', 'spine', 'a', 'method', 'that', 'can', 'jointly', 'capture', 'the', 'local', 'proximity', 'and', 'proximities', 'at', 'any', 'distance', 'while', 'being', 'inductive', 'to', 'efficiently', 'deal', 'with', 'unseen', 'nodes', 'or', 'networks', 'extensive', 'experimental', 'results', 'on', 'benchmark', 'datasets', 'demonstrate', 'the', 'superiority', 'of', 'the', 'proposed', 'framework', 'over', 'the', 'state', 'of', 'the', 'art']] | [-0.08538415327030062, -0.015865744846976466, -0.045747846397743736, 0.03746332373401081, -0.10557609396227807, -0.16168951970628567, 0.03343091124099576, 0.4302661755018764, -0.2883796814397943, -0.3330154037758432, 0.07690505828294489, -0.29911853638650093, -0.19948290923472356, 0.16736678643910974, -0.06549974523691668, 0.05104328216812401, 0.11804900784735327, 0.1095887606834165, -0.08478234179524911, -0.2689443852010838, 0.345366805350339, 0.028933672178364185, 0.3295174819865712, 0.023104983043891414, 0.09173162219425042, -0.022160411319109025, -0.024722011053624253, 0.05654268741728393, -0.022530297481959376, 0.19836290818811567, 0.2870657872132681, 0.16468557582961188, 0.3195222930982709, -0.46152304561325797, -0.28504513388292657, 0.14000521613871333, 0.1444199508159525, 0.12570731384362765, -0.002713081356206978, -0.34917097363483024, 0.12648975083397496, -0.15861348572394085, 0.008087152835947495, -0.133080126600409, -0.04940218429029402, 0.027341516611718193, -0.24865577270156117, 0.022568986040574533, 0.07713517084096869, 0.03310840427875519, -0.045812964022021604, -0.09058063187532955, -0.0131559526340829, 0.19899941875978752, 0.0071243069833144546, 0.07419556590331787, 0.11848770817741752, -0.1541516547108552, -0.1718008432192383, 0.32988561078630113, -0.03416612674482167, -0.1911286329471127, 0.23122908574425513, -0.05503510607889405, -0.14703574762162236, 0.09151347846620612, 0.21932310815210695, 0.12774408952229552, -0.14675146808364878, 0.025239246982339494, -0.04312376703515097, 0.15200942263214123, 0.03227725439808435, 0.048670104311572183, 0.18685124465781783, 0.21964041723145378, 0.08034511672298389, 0.10979674142673267, -0.12476889365568274, -0.08935197916882182, -0.22064144570656397, -0.10577969204944869, -0.21989890989606029, -0.03368505454973611, -0.1373060959672633, -0.12065569292268871, 0.4105918223452237, 0.20129249969290364, 0.24553298325519318, 0.069871448252902, 0.35665503320611874, 0.010111472023547523, 0.11563036643934471, 0.13121169460937382, 0.20535010116140323, 0.053889995530523635, 0.08049551098072832, -0.15421564491569167, 0.13819772972190683, 0.0754145369116924] |
1,802.03985 | X-ray counterpart candidates for six new $\gamma$-ray pulsars | Using archival X-ray data we have found point-like X-ray counterpart
candidates positionally coincident with six $\gamma$-ray pulsars discovered
recently in the Fermi Gamma-ray Space Telescope data by the Einstein@Home
project. The candidates for PSRs J0002$+$6216, J0554$+$3107, J1844$-$0346 and
J1105$-$6037 are detected with Swift, and those for PSRs J0359$+$5414 and
J2017$+$3625 are detected with Chandra. Despite a low count statistics for some
candidates, assuming plausible constraints on the absorbing column density
towards the pulsars, we show that X-ray spectral properties for all of them are
consistent with those observed for other pulsars. J0359$+$5414 is the most
reliably identified object. We detect a nebula around it, whose spectrum and
extent suggest that this is a pulsar wind nebula powered by the pulsar.
Associations of J0002$+$6216 and J1844$-$0346 with supernova remnants CTB 1 and
G28.6$-$0.1 are proposed.
| astro-ph.HE | using archival xray data we have found pointlike xray counterpart candidates positionally coincident with six gammaray pulsars discovered recently in the fermi gammaray space telescope data by the einsteinhome project the candidates for psrs j00026216 j05543107 j18440346 and j11056037 are detected with swift and those for psrs j03595414 and j20173625 are detected with chandra despite a low count statistics for some candidates assuming plausible constraints on the absorbing column density towards the pulsars we show that xray spectral properties for all of them are consistent with those observed for other pulsars j03595414 is the most reliably identified object we detect a nebula around it whose spectrum and extent suggest that this is a pulsar wind nebula powered by the pulsar associations of j00026216 and j18440346 with supernova remnants ctb 1 and g28601 are proposed | [['using', 'archival', 'xray', 'data', 'we', 'have', 'found', 'pointlike', 'xray', 'counterpart', 'candidates', 'positionally', 'coincident', 'with', 'six', 'gammaray', 'pulsars', 'discovered', 'recently', 'in', 'the', 'fermi', 'gammaray', 'space', 'telescope', 'data', 'by', 'the', 'einsteinhome', 'project', 'the', 'candidates', 'for', 'psrs', 'j00026216', 'j05543107', 'j18440346', 'and', 'j11056037', 'are', 'detected', 'with', 'swift', 'and', 'those', 'for', 'psrs', 'j03595414', 'and', 'j20173625', 'are', 'detected', 'with', 'chandra', 'despite', 'a', 'low', 'count', 'statistics', 'for', 'some', 'candidates', 'assuming', 'plausible', 'constraints', 'on', 'the', 'absorbing', 'column', 'density', 'towards', 'the', 'pulsars', 'we', 'show', 'that', 'xray', 'spectral', 'properties', 'for', 'all', 'of', 'them', 'are', 'consistent', 'with', 'those', 'observed', 'for', 'other', 'pulsars', 'j03595414', 'is', 'the', 'most', 'reliably', 'identified', 'object', 'we', 'detect', 'a', 'nebula', 'around', 'it', 'whose', 'spectrum', 'and', 'extent', 'suggest', 'that', 'this', 'is', 'a', 'pulsar', 'wind', 'nebula', 'powered', 'by', 'the', 'pulsar', 'associations', 'of', 'j00026216', 'and', 'j18440346', 'with', 'supernova', 'remnants', 'ctb', '1', 'and', 'g28601', 'are', 'proposed']] | [-0.06345500713423825, 0.10931139578670264, -0.03140787009708584, 0.12950181884877385, -0.1671423284020275, -0.1099833480231464, 0.05400659311958589, 0.4815254383087158, -0.14683794752974064, -0.3882421737611294, 0.09926728888880461, -0.3803862990513444, -0.04616157212527469, 0.2857011836394668, 0.008834580958398874, -0.013929423484019935, 0.0988701494669076, -0.05339335760474205, -0.028294500920921565, -0.23055329611687922, 0.26930044354498384, 0.10063574324548244, 0.1354305704087019, -0.08415131015703083, 0.12730006813816727, -0.10835366712510586, -0.06151409300044179, -0.02567916553025134, -0.04491711164324079, 0.0944066200107336, 0.24796137893910053, 0.15352839616313577, 0.10937676420807839, -0.34770052206516266, -0.26504357601329687, 0.07627595607563853, 0.15268561501055955, -0.06227813885267824, -0.06277768644411116, -0.37030975902453067, 0.09654089224850759, -0.2389441351229325, -0.2098360020890832, 0.023104413978755473, 0.04818175218254328, 0.1177461084406823, -0.1379702212724369, 0.10333858893811702, -0.04663506342470646, 0.02712841827142984, -0.19135476133786142, -0.09969190377835184, 0.028982961555942894, 0.015251389637589454, 0.04385921454802155, 0.04276088191568851, 0.0792749296091497, -0.15451521017961203, -0.12571707486361267, 0.36601945240795614, 0.007545747045427561, 0.01058976376056671, 0.21523475633561612, -0.22265422409772873, -0.28084930501133204, 0.1872849902175367, 0.06320287806540728, 0.09488050028681755, -0.1923879289701581, -0.0007487592629622668, -0.05726725506875664, 0.20186974189057946, 0.029282425682991744, 0.08712266648450168, 0.33940765531361106, 0.09904529228433967, 0.017325047167018055, 0.1624401509021409, -0.3445264845455531, 0.030597879610955715, -0.20435059170424938, -0.05408381051523611, -0.17501904868055135, 0.0697268643444404, -0.05669673330639489, -0.08871282513067126, 0.3317508854958578, 0.09023213805258275, 0.1596925707682967, 0.039775384014472365, 0.2662276400923729, 0.09134629948437215, 0.08114068231731653, 0.1946575561389327, 0.33664866904658264, 0.10460880452021956, 0.0670297772642225, -0.16237139816582202, 0.10660398672521114, -0.0383394295591861] |
1,802.03986 | The all-loop conjecture for integrands of reggeon amplitudes in N=4 SYM | In this paper we present the all-loop conjecture for integrands of Wilson
line form factors, also known as reggeon amplitudes, in N=4 SYM. In particular
we present a new gluing operation in momentum twistor space used to obtain
reggeon tree-level amplitudes and loop integrands starting from corresponding
expressions for on-shell amplitudes. The introduced gluing procedure is used to
derive BCFW recursions both for tree-level reggeon amplitudes and their loop
integrands. In addition we provide predictions for reggeon loop integrands
written in the basis of local integrals. As a check of the correctness of
gluing operation at loop level we derive the expression for LO BFKL kernel in
N=4 SYM.
| hep-th hep-ph | in this paper we present the allloop conjecture for integrands of wilson line form factors also known as reggeon amplitudes in n4 sym in particular we present a new gluing operation in momentum twistor space used to obtain reggeon treelevel amplitudes and loop integrands starting from corresponding expressions for onshell amplitudes the introduced gluing procedure is used to derive bcfw recursions both for treelevel reggeon amplitudes and their loop integrands in addition we provide predictions for reggeon loop integrands written in the basis of local integrals as a check of the correctness of gluing operation at loop level we derive the expression for lo bfkl kernel in n4 sym | [['in', 'this', 'paper', 'we', 'present', 'the', 'allloop', 'conjecture', 'for', 'integrands', 'of', 'wilson', 'line', 'form', 'factors', 'also', 'known', 'as', 'reggeon', 'amplitudes', 'in', 'n4', 'sym', 'in', 'particular', 'we', 'present', 'a', 'new', 'gluing', 'operation', 'in', 'momentum', 'twistor', 'space', 'used', 'to', 'obtain', 'reggeon', 'treelevel', 'amplitudes', 'and', 'loop', 'integrands', 'starting', 'from', 'corresponding', 'expressions', 'for', 'onshell', 'amplitudes', 'the', 'introduced', 'gluing', 'procedure', 'is', 'used', 'to', 'derive', 'bcfw', 'recursions', 'both', 'for', 'treelevel', 'reggeon', 'amplitudes', 'and', 'their', 'loop', 'integrands', 'in', 'addition', 'we', 'provide', 'predictions', 'for', 'reggeon', 'loop', 'integrands', 'written', 'in', 'the', 'basis', 'of', 'local', 'integrals', 'as', 'a', 'check', 'of', 'the', 'correctness', 'of', 'gluing', 'operation', 'at', 'loop', 'level', 'we', 'derive', 'the', 'expression', 'for', 'lo', 'bfkl', 'kernel', 'in', 'n4', 'sym']] | [-0.14412060590597606, 0.15041887288840505, -0.10919021922719041, 0.17816661739157974, -0.08341156222233805, -0.08433042246198982, 0.05813262123217242, 0.3675862464609496, -0.12304705358751186, -0.19261355361465468, 0.03142461098769013, -0.21310702264266207, -0.2105142421584679, 0.13397385276546445, -0.050968258120461345, 0.10175914971858536, 0.07718270643477525, 0.020678472733221213, -0.08849493562833431, -0.24493159262309655, 0.31908629991866033, -0.032477133984275916, 0.19209786962478534, 0.08743337919474195, 0.1071146985968797, 0.10625066087418876, -0.0819223733670121, -0.052983481561126394, -0.08948508048549704, 0.13982970983969098, 0.33393405943493776, 0.07839906704398471, 0.030539016715686665, -0.476588731153159, -0.08755102494748634, 0.0001224459377501946, 0.24794995148426965, 0.133589723326881, 0.10129797671186747, -0.212418462820522, -0.012195895750656587, -0.17603752486954588, -0.21079172657529285, -0.17730484014257378, 0.013309390698516861, -0.13695638425169734, -0.314072489166, 0.010765391540523498, -0.0331333604055978, 0.01959111702141412, 0.019449702583663506, -0.1449727787029579, -0.059006549695660486, 0.13427769857535668, 0.057377355794823906, 0.10708941993599441, 0.06349614157486673, -0.20663070695158606, -0.18073603295755292, 0.3014484985791352, -0.09298587900078044, -0.21901665831522998, 0.07088146080186061, -0.18927741777194546, -0.2451014809968343, 0.11156406162066093, 0.12616467950096644, 0.13736567566095992, -0.2243277790417912, 0.2337653347165025, 0.03829580845755585, 0.04448122990001506, 0.23366527380678084, 0.040614004588660296, 0.14471518558475677, 0.055053851770134554, -0.011975410351649337, 0.1847747563205044, -0.020139420898994346, -0.10505828513430619, -0.49420122598904537, -0.12488360042521439, -0.007831330846892585, 0.041659488633206676, -0.17928953531573083, -0.22438361043742763, 0.3198130972909852, 0.12057193302882648, 0.17317728853758868, 0.17840012585009457, 0.2676213719741091, 0.22011275397861427, 0.11693565977028135, 0.08488330542678099, 0.20900785442390438, 0.22255154218046216, 0.1209974096096847, -0.2243284217291298, -0.08429442701963794, 0.31200964772356077] |
1,802.03987 | Latent Variable Time-varying Network Inference | In many applications of finance, biology and sociology, complex systems
involve entities interacting with each other. These processes have the
peculiarity of evolving over time and of comprising latent factors, which
influence the system without being explicitly measured. In this work we present
latent variable time-varying graphical lasso (LTGL), a method for multivariate
time-series graphical modelling that considers the influence of hidden or
unmeasurable factors. The estimation of the contribution of the latent factors
is embedded in the model which produces both sparse and low-rank components for
each time point. In particular, the first component represents the connectivity
structure of observable variables of the system, while the second represents
the influence of hidden factors, assumed to be few with respect to the observed
variables. Our model includes temporal consistency on both components,
providing an accurate evolutionary pattern of the system. We derive a tractable
optimisation algorithm based on alternating direction method of multipliers,
and develop a scalable and efficient implementation which exploits proximity
operators in closed form. LTGL is extensively validated on synthetic data,
achieving optimal performance in terms of accuracy, structure learning and
scalability with respect to ground truth and state-of-the-art methods for
graphical inference. We conclude with the application of LTGL to real case
studies, from biology and finance, to illustrate how our method can be
successfully employed to gain insights on multivariate time-series data.
| stat.ML cs.LG | in many applications of finance biology and sociology complex systems involve entities interacting with each other these processes have the peculiarity of evolving over time and of comprising latent factors which influence the system without being explicitly measured in this work we present latent variable timevarying graphical lasso ltgl a method for multivariate timeseries graphical modelling that considers the influence of hidden or unmeasurable factors the estimation of the contribution of the latent factors is embedded in the model which produces both sparse and lowrank components for each time point in particular the first component represents the connectivity structure of observable variables of the system while the second represents the influence of hidden factors assumed to be few with respect to the observed variables our model includes temporal consistency on both components providing an accurate evolutionary pattern of the system we derive a tractable optimisation algorithm based on alternating direction method of multipliers and develop a scalable and efficient implementation which exploits proximity operators in closed form ltgl is extensively validated on synthetic data achieving optimal performance in terms of accuracy structure learning and scalability with respect to ground truth and stateoftheart methods for graphical inference we conclude with the application of ltgl to real case studies from biology and finance to illustrate how our method can be successfully employed to gain insights on multivariate timeseries data | [['in', 'many', 'applications', 'of', 'finance', 'biology', 'and', 'sociology', 'complex', 'systems', 'involve', 'entities', 'interacting', 'with', 'each', 'other', 'these', 'processes', 'have', 'the', 'peculiarity', 'of', 'evolving', 'over', 'time', 'and', 'of', 'comprising', 'latent', 'factors', 'which', 'influence', 'the', 'system', 'without', 'being', 'explicitly', 'measured', 'in', 'this', 'work', 'we', 'present', 'latent', 'variable', 'timevarying', 'graphical', 'lasso', 'ltgl', 'a', 'method', 'for', 'multivariate', 'timeseries', 'graphical', 'modelling', 'that', 'considers', 'the', 'influence', 'of', 'hidden', 'or', 'unmeasurable', 'factors', 'the', 'estimation', 'of', 'the', 'contribution', 'of', 'the', 'latent', 'factors', 'is', 'embedded', 'in', 'the', 'model', 'which', 'produces', 'both', 'sparse', 'and', 'lowrank', 'components', 'for', 'each', 'time', 'point', 'in', 'particular', 'the', 'first', 'component', 'represents', 'the', 'connectivity', 'structure', 'of', 'observable', 'variables', 'of', 'the', 'system', 'while', 'the', 'second', 'represents', 'the', 'influence', 'of', 'hidden', 'factors', 'assumed', 'to', 'be', 'few', 'with', 'respect', 'to', 'the', 'observed', 'variables', 'our', 'model', 'includes', 'temporal', 'consistency', 'on', 'both', 'components', 'providing', 'an', 'accurate', 'evolutionary', 'pattern', 'of', 'the', 'system', 'we', 'derive', 'a', 'tractable', 'optimisation', 'algorithm', 'based', 'on', 'alternating', 'direction', 'method', 'of', 'multipliers', 'and', 'develop', 'a', 'scalable', 'and', 'efficient', 'implementation', 'which', 'exploits', 'proximity', 'operators', 'in', 'closed', 'form', 'ltgl', 'is', 'extensively', 'validated', 'on', 'synthetic', 'data', 'achieving', 'optimal', 'performance', 'in', 'terms', 'of', 'accuracy', 'structure', 'learning', 'and', 'scalability', 'with', 'respect', 'to', 'ground', 'truth', 'and', 'stateoftheart', 'methods', 'for', 'graphical', 'inference', 'we', 'conclude', 'with', 'the', 'application', 'of', 'ltgl', 'to', 'real', 'case', 'studies', 'from', 'biology', 'and', 'finance', 'to', 'illustrate', 'how', 'our', 'method', 'can', 'be', 'successfully', 'employed', 'to', 'gain', 'insights', 'on', 'multivariate', 'timeseries', 'data']] | [-0.07828572391643135, 0.01718584340767543, -0.07409861748540643, 0.04747769646633761, -0.10867424285047511, -0.12813393628257552, 0.04059296642996305, 0.4103445028640034, -0.27703644912218106, -0.32670723851862477, 0.1093485398220087, -0.23994031567577814, -0.1758589754647797, 0.18822118072946953, -0.05087202435999386, 0.06214746629351561, 0.06988692820987086, 0.0550108344339261, -0.039653868781657074, -0.25147958711766133, 0.2968083429940061, 0.024789479415502712, 0.2886995085010445, -0.018434652601192307, 0.13699799666431475, 0.018066388611283794, -0.07037084958631963, 0.011756940216589145, -0.05911818552098267, 0.1820476281757688, 0.27561202999368506, 0.16883301611431764, 0.29679065083547407, -0.41854895735164643, -0.24819352110183188, 0.09820807564568743, 0.12991998971969151, 0.0638177584408524, -0.013849981650217776, -0.28998033620626357, 0.038360493923311784, -0.1484061443997703, -0.08106825302974506, -0.1310650087064255, -0.014651662416731537, 0.0326027570265173, -0.3140387623493933, 0.08440113607086323, 0.03919785696087971, 0.07987566782563663, -0.06303331318069332, -0.14663811174010047, 0.021680986557959987, 0.15944073159383026, 0.05197833422961181, 0.003930477731110372, 0.11763131617961271, -0.13203496948327656, -0.14426512818497356, 0.3677017144194193, -0.055521382462532805, -0.22770210055404627, 0.20049630575150504, -0.08533865060361866, -0.18486269146802994, 0.11049515141855253, 0.2538368616618282, 0.09880692730062858, -0.17120719680999558, 0.07301564375348882, -0.02005219358965213, 0.17074232581002322, -0.004158297422370722, 0.01172292766921296, 0.15637249626744423, 0.21166180472027116, 0.03879807165346676, 0.14557087979787686, -0.08495097796510626, -0.1387627681774715, -0.24017785701670968, -0.13853384161388269, -0.1625659385417067, -0.035190457849463834, -0.12928519308406014, -0.18148577833622037, 0.4204041689053785, 0.18768872457375907, 0.1898724752199315, 0.043058362419692395, 0.3133246143746481, 0.09696325597056857, 0.04477181223822175, 0.09073800766493896, 0.15918736618488108, 0.13950739419067254, 0.08437299515608655, -0.1871690786965981, 0.13752839743161763, 0.004888940144059482] |
1,802.03988 | First FBK Production of 50$\mu$m Ultra-Fast Silicon Detectors | Fondazione Bruno Kessler (FBK, Trento, Italy) has recently delivered its
first 50 $\mu$m thick production of Ultra-Fast Silicon Detectors (UFSD), based
on the Low-Gain Avalanche Diode design. These sensors use high resistivity
Si-on-Si substrates, and have a variety of gain layer doping profiles and
designs based on Boron, Gallium, Carbonated Boron and Carbonated Gallium to
obtain a controlled multiplication mechanism. Such variety of gain layers will
allow identifying the most radiation hard technology to be employed in the
production of UFSD, to extend their radiation resistance beyond the current
limit of $\phi \sim$ 10$^{15}$ n$_{eq}$/cm$^2$. In this paper, we present the
characterisation, the timing performances, and the results on radiation damage
tolerance of this new FBK production.
| physics.ins-det | fondazione bruno kessler fbk trento italy has recently delivered its first 50 mum thick production of ultrafast silicon detectors ufsd based on the lowgain avalanche diode design these sensors use high resistivity sionsi substrates and have a variety of gain layer doping profiles and designs based on boron gallium carbonated boron and carbonated gallium to obtain a controlled multiplication mechanism such variety of gain layers will allow identifying the most radiation hard technology to be employed in the production of ufsd to extend their radiation resistance beyond the current limit of phi sim 1015 n_eqcm2 in this paper we present the characterisation the timing performances and the results on radiation damage tolerance of this new fbk production | [['fondazione', 'bruno', 'kessler', 'fbk', 'trento', 'italy', 'has', 'recently', 'delivered', 'its', 'first', '50', 'mum', 'thick', 'production', 'of', 'ultrafast', 'silicon', 'detectors', 'ufsd', 'based', 'on', 'the', 'lowgain', 'avalanche', 'diode', 'design', 'these', 'sensors', 'use', 'high', 'resistivity', 'sionsi', 'substrates', 'and', 'have', 'a', 'variety', 'of', 'gain', 'layer', 'doping', 'profiles', 'and', 'designs', 'based', 'on', 'boron', 'gallium', 'carbonated', 'boron', 'and', 'carbonated', 'gallium', 'to', 'obtain', 'a', 'controlled', 'multiplication', 'mechanism', 'such', 'variety', 'of', 'gain', 'layers', 'will', 'allow', 'identifying', 'the', 'most', 'radiation', 'hard', 'technology', 'to', 'be', 'employed', 'in', 'the', 'production', 'of', 'ufsd', 'to', 'extend', 'their', 'radiation', 'resistance', 'beyond', 'the', 'current', 'limit', 'of', 'phi', 'sim', '1015', 'n_eqcm2', 'in', 'this', 'paper', 'we', 'present', 'the', 'characterisation', 'the', 'timing', 'performances', 'and', 'the', 'results', 'on', 'radiation', 'damage', 'tolerance', 'of', 'this', 'new', 'fbk', 'production']] | [-0.048743492556366556, 0.13673581543643476, -0.025681346945679376, -0.05885211468156395, -0.021335778763951284, -0.16328499319256637, 0.05267381210558534, 0.4080893046288864, -0.18805795251532328, -0.3219852972743583, 0.0841256048839443, -0.34940832419557283, -0.0729021778819954, 0.2514034105898363, -0.0879182049860086, 0.06925125982951581, -0.00992240067089683, -0.09945874124893854, -0.008083759052357796, -0.23181266818950275, 0.2110594467878149, 0.16342169153860345, 0.3487693312405287, 0.125522130189046, 0.12233029450450478, -0.03841508311171342, 0.03188052652908011, -0.06627552437692366, -0.1590604813275698, 0.09179605944242714, 0.25476051725704096, 0.029535258160743476, 0.20099235398309498, -0.4895858858101841, -0.18416453246428663, 0.05146898772439052, 0.0534255300580267, 0.017707136700507897, -0.13074414416292585, -0.24701336161875775, 0.10122248315621682, -0.23847567563844396, -0.07165348308877457, 0.007686939140920254, -0.043605231041698875, 0.017191481712306368, -0.21813571199389367, -0.04631639007430781, -0.011592685871211619, 0.05085294474125037, -0.022214536409592256, -0.15687192645694675, -0.007223179760581717, 0.03458162631181165, -0.042341639340457767, 0.006648697276150101, 0.27772693498589995, -0.09540951784684099, -0.13127352178080715, 0.29525146920009165, -0.04575445476301207, -0.07408837858459046, 0.1767124911857536, -0.1820034807836958, -0.07998756184001807, 0.1735536173018145, 0.19061871065260394, 0.11770754627048455, -0.1895723171955665, 0.028945367440083546, 0.055728881266610374, 0.2037268676092559, 0.17880583914189502, 0.0626417270235332, 0.197548546683814, 0.3004427066169165, -0.004844107931572141, 0.11977430669879861, -0.1703285199473612, 0.07071535902675884, -0.24906039632383156, -0.18306129992184839, -0.09087695772478614, 0.11144264244699273, -0.05645475845637426, -0.1670404065336133, 0.36966228755672687, 0.1367488308801669, 0.10296018875268256, -0.041412237429477534, 0.2905263028103569, 0.05714002736555091, 0.10029149396898995, -0.016244722484081084, 0.3058264219234216, 0.1622356024599867, 0.17523514657233166, -0.17780772983578258, 0.07220264872865237, -0.012194252239765021] |
1,802.03989 | Subspace Support Vector Data Description | This paper proposes a novel method for solving one-class classification
problems. The proposed approach, namely Subspace Support Vector Data
Description, maps the data to a subspace that is optimized for one-class
classification. In that feature space, the optimal hypersphere enclosing the
target class is then determined. The method iteratively optimizes the data
mapping along with data description in order to define a compact class
representation in a low-dimensional feature space. We provide both linear and
non-linear mappings for the proposed method. Experiments on 14 publicly
available datasets indicate that the proposed Subspace Support Vector Data
Description provides better performance compared to baselines and other
recently proposed one-class classification methods.
| cs.CV | this paper proposes a novel method for solving oneclass classification problems the proposed approach namely subspace support vector data description maps the data to a subspace that is optimized for oneclass classification in that feature space the optimal hypersphere enclosing the target class is then determined the method iteratively optimizes the data mapping along with data description in order to define a compact class representation in a lowdimensional feature space we provide both linear and nonlinear mappings for the proposed method experiments on 14 publicly available datasets indicate that the proposed subspace support vector data description provides better performance compared to baselines and other recently proposed oneclass classification methods | [['this', 'paper', 'proposes', 'a', 'novel', 'method', 'for', 'solving', 'oneclass', 'classification', 'problems', 'the', 'proposed', 'approach', 'namely', 'subspace', 'support', 'vector', 'data', 'description', 'maps', 'the', 'data', 'to', 'a', 'subspace', 'that', 'is', 'optimized', 'for', 'oneclass', 'classification', 'in', 'that', 'feature', 'space', 'the', 'optimal', 'hypersphere', 'enclosing', 'the', 'target', 'class', 'is', 'then', 'determined', 'the', 'method', 'iteratively', 'optimizes', 'the', 'data', 'mapping', 'along', 'with', 'data', 'description', 'in', 'order', 'to', 'define', 'a', 'compact', 'class', 'representation', 'in', 'a', 'lowdimensional', 'feature', 'space', 'we', 'provide', 'both', 'linear', 'and', 'nonlinear', 'mappings', 'for', 'the', 'proposed', 'method', 'experiments', 'on', '14', 'publicly', 'available', 'datasets', 'indicate', 'that', 'the', 'proposed', 'subspace', 'support', 'vector', 'data', 'description', 'provides', 'better', 'performance', 'compared', 'to', 'baselines', 'and', 'other', 'recently', 'proposed', 'oneclass', 'classification', 'methods']] | [-0.043370366797124575, -0.0555225756583274, -0.06843897027877766, 0.04212231430280612, -0.14521290368289438, -0.1690660384611799, 0.030040700032392842, 0.42033401687860217, -0.26510718672903716, -0.26280438915800747, 0.09995834652543786, -0.28455776463202925, -0.17725570909166283, 0.23458789928107088, -0.07471014289270847, 0.11429327297870309, 0.15646943878467887, 0.04973218770544985, -0.11105181801414818, -0.29267714569588626, 0.34754245792336147, 0.04025150553554023, 0.40952730406964316, -0.014212742738357377, 0.17390587787601003, -0.0026832852478421063, -0.07216705540152386, 0.011368801808219677, -0.06751352070862536, 0.19392089537182533, 0.3454457129428693, 0.2365608427870096, 0.2728185617544372, -0.3052302690291213, -0.2521550308297807, 0.10820736873621514, 0.12162046199408147, 0.09022879482734492, -0.07028260470021926, -0.3223632774273053, 0.11427580680134236, -0.13126578865521546, -0.05762799114945832, -0.21419318403125903, -0.0365880489725312, -0.050675096785982886, -0.3357876137693609, 0.02379478726305341, 0.0750124858256532, 0.03627229681016382, -0.1583867747584409, -0.11022495639450643, 0.03843217643849347, 0.0605191952194335, -0.02287179819060438, 0.1258148770659752, 0.07532170362804734, -0.07432879993495523, -0.15959448685203123, 0.3616157992307199, -0.10555798707875945, -0.2887991527317053, 0.18666014880574214, -0.031923754636300816, -0.14896357785739484, 0.13069313269860428, 0.2593288606870065, 0.11347089213994119, -0.15948906035478647, 0.04669616471254053, -0.08798435750340514, 0.13786552716559225, -0.020888679868054635, -0.014419011143677005, 0.1258719718839905, 0.2432957037753605, 0.08794816892269418, 0.13377201754584858, -0.1545206275277284, -0.05146592997287938, -0.24176111840856596, -0.14141395611158752, -0.2168633035819875, -0.10520313444350837, -0.10101213544119073, -0.13371829570211266, 0.4278222627237166, 0.1718145993478391, 0.24248349261598304, 0.10339169038156339, 0.3303407437206511, 0.03218261410328432, 0.09154655338358988, 0.1451212261897435, 0.15779711084371997, 0.05648063541894112, 0.03549864374254958, -0.16622630507181133, -0.004441609116988854, 0.14835395675084187] |
1,802.0399 | Improving baryon acoustic oscillation measurement with the combination
of cosmic voids and galaxies | We develop a methodology to optimise the measurement of Baryon Acoustic
Oscillation (BAO) from a given galaxy sample. In our previous work, we
demonstrated that one can measure BAO from tracers in under-dense regions
(voids). In this study, we combine the over-dense and under-dense tracers
(galaxies & voids) to obtain better constraints on the BAO scale. To this end,
we modify the de-wiggled BAO model with an additional parameter to describe
both the BAO peak and the underlying exclusion pattern of void 2PCFs. We show
that after applying BAO reconstruction to galaxies, the BAO peak scale of both
galaxies and voids are unbiased using the modified model. Furthermore, we use a
new 2PCF estimator for a multi-tracer analysis with galaxies and voids. In
simulations, the joint sample improves by about 10% the constraint for the
post-reconstruction BAO peak position compared to the result from galaxies
alone, which is equivalent to an enlargement of the survey volume by 20%.
Applying this method to the BOSS DR12 data, we have an 18% improvement for the
low-z sample (0.2<z<0.5), but a worse constraint for the high-z sample
(0.5<z<0.75), which is consistent with statistical fluctuations for the current
survey volume. Future larger samples will give more robust improvements due to
less statistical fluctuations.
| astro-ph.CO | we develop a methodology to optimise the measurement of baryon acoustic oscillation bao from a given galaxy sample in our previous work we demonstrated that one can measure bao from tracers in underdense regions voids in this study we combine the overdense and underdense tracers galaxies voids to obtain better constraints on the bao scale to this end we modify the dewiggled bao model with an additional parameter to describe both the bao peak and the underlying exclusion pattern of void 2pcfs we show that after applying bao reconstruction to galaxies the bao peak scale of both galaxies and voids are unbiased using the modified model furthermore we use a new 2pcf estimator for a multitracer analysis with galaxies and voids in simulations the joint sample improves by about 10 the constraint for the postreconstruction bao peak position compared to the result from galaxies alone which is equivalent to an enlargement of the survey volume by 20 applying this method to the boss dr12 data we have an 18 improvement for the lowz sample 02z05 but a worse constraint for the highz sample 05z075 which is consistent with statistical fluctuations for the current survey volume future larger samples will give more robust improvements due to less statistical fluctuations | [['we', 'develop', 'a', 'methodology', 'to', 'optimise', 'the', 'measurement', 'of', 'baryon', 'acoustic', 'oscillation', 'bao', 'from', 'a', 'given', 'galaxy', 'sample', 'in', 'our', 'previous', 'work', 'we', 'demonstrated', 'that', 'one', 'can', 'measure', 'bao', 'from', 'tracers', 'in', 'underdense', 'regions', 'voids', 'in', 'this', 'study', 'we', 'combine', 'the', 'overdense', 'and', 'underdense', 'tracers', 'galaxies', 'voids', 'to', 'obtain', 'better', 'constraints', 'on', 'the', 'bao', 'scale', 'to', 'this', 'end', 'we', 'modify', 'the', 'dewiggled', 'bao', 'model', 'with', 'an', 'additional', 'parameter', 'to', 'describe', 'both', 'the', 'bao', 'peak', 'and', 'the', 'underlying', 'exclusion', 'pattern', 'of', 'void', '2pcfs', 'we', 'show', 'that', 'after', 'applying', 'bao', 'reconstruction', 'to', 'galaxies', 'the', 'bao', 'peak', 'scale', 'of', 'both', 'galaxies', 'and', 'voids', 'are', 'unbiased', 'using', 'the', 'modified', 'model', 'furthermore', 'we', 'use', 'a', 'new', '2pcf', 'estimator', 'for', 'a', 'multitracer', 'analysis', 'with', 'galaxies', 'and', 'voids', 'in', 'simulations', 'the', 'joint', 'sample', 'improves', 'by', 'about', '10', 'the', 'constraint', 'for', 'the', 'postreconstruction', 'bao', 'peak', 'position', 'compared', 'to', 'the', 'result', 'from', 'galaxies', 'alone', 'which', 'is', 'equivalent', 'to', 'an', 'enlargement', 'of', 'the', 'survey', 'volume', 'by', '20', 'applying', 'this', 'method', 'to', 'the', 'boss', 'dr12', 'data', 'we', 'have', 'an', '18', 'improvement', 'for', 'the', 'lowz', 'sample', '02z05', 'but', 'a', 'worse', 'constraint', 'for', 'the', 'highz', 'sample', '05z075', 'which', 'is', 'consistent', 'with', 'statistical', 'fluctuations', 'for', 'the', 'current', 'survey', 'volume', 'future', 'larger', 'samples', 'will', 'give', 'more', 'robust', 'improvements', 'due', 'to', 'less', 'statistical', 'fluctuations']] | [-0.004912432400143515, 0.039505959202428644, -0.08192322455861976, 0.11833164476262839, -0.1229979388271142, -0.03126594341344209, 0.05774546575786781, 0.38265964504132427, -0.17894153199633311, -0.3406025735272583, 0.03635589526604536, -0.32565104720878946, -0.047873631441848155, 0.2066587574024983, -0.017124887426989605, 0.002980872337679261, 0.05587358809826733, -0.09477840134652459, -0.0703371156795963, -0.31993958584792476, 0.2914545517776487, 0.15971621389961937, 0.31412303347357556, -0.06663667231129067, 0.06669576173180317, -0.0817613385231189, -0.1324627292387694, 0.06279258672837439, -0.22164515197045087, 0.07825230417809295, 0.23003245613851936, 0.1477987387565697, 0.24267633943999348, -0.34792167559484793, -0.19224988571899373, 0.13245547943730449, 0.21737175883761453, 0.1918014644868943, -0.051817583151682146, -0.32579788390221526, 0.08923570313564393, -0.13249994039951454, -0.10684135750623293, -0.018407449980709447, -0.04319700743840302, 0.013929883685546195, -0.25743247062539754, 0.22216042254834426, 0.010866607552918704, 0.04068867462569649, -0.047947535267578965, -0.09511552665165617, -0.0037475901156284134, 0.035253464421754685, -0.01581734346646309, 0.06980362842288954, 0.17771267334171073, -0.11486016844684095, -0.013964718573351471, 0.3932299957095275, -0.08379057069643608, -0.08908279330098948, 0.12608942980154697, -0.18626946251776105, -0.1539031724915704, 0.06317000925197329, 0.19034944282498809, 0.017838449226421058, -0.15290557550157882, 0.017722391465778274, 0.004501134003608632, 0.23121739000091057, 0.04394709829238777, 0.0033460227960920713, 0.20529254749010417, 0.13894131255745254, 0.1593425487364796, 0.07734738338571404, -0.19194073247320914, 0.03996767019807786, -0.2935285763005507, -0.07384582131296324, -0.17459956716262345, 0.04765817483726582, -0.15817399567317497, -0.14360601815521645, 0.39308074968912216, 0.18420916410768856, 0.2796480508353923, 0.11684808986107774, 0.31718667076213414, 0.037807696861174245, 0.11032926524114496, 0.02721784948891264, 0.2811111138084704, 0.1269157012151464, 0.08588105458901851, -0.19880138276578876, 0.017053842239389286, -0.014998037682267503] |
1,802.03991 | Hybrid TDOA/RSS Based Localization for Visible Light Systems | In a visible light positioning (VLP) system, a receiver can estimate its
location based on signals transmitted by light emitting diodes (LEDs). In this
manuscript, we investigate a quasi-synchronous VLP system, in which the LED
transmitters are synchronous among themselves but are not synchronized with the
receiver. In quasi-synchronous VLP systems, position estimation can be
performed by utilizing time difference of arrival (TDOA) information together
with channel attenuation information, leading to a hybrid localization system.
To specify accuracy limits for quasi-synchronous VLP systems, the Cramer-Rao
lower bound (CRLB) on position estimation is derived in a generic
three-dimensional scenario. Then, a direct positioning approach is adopted to
obtain the maximum likelihood (ML) position estimator based directly on
received signals from LED transmitters. In addition, a two-step position
estimator is proposed, where TDOA and received signal strength (RSS) estimates
are obtained in the first step and the position estimation is performed, based
on the TDOA and RSS estimates, in the second step. The performance of the
two-step positioning technique is shown to converge to that of direct
positioning at high signal-to-noise ratios based on asymptotic properties of ML
estimation. Finally, CRLBs and performance of the proposed positioning
techniques are investigated through simulations.
| cs.IT math.IT | in a visible light positioning vlp system a receiver can estimate its location based on signals transmitted by light emitting diodes leds in this manuscript we investigate a quasisynchronous vlp system in which the led transmitters are synchronous among themselves but are not synchronized with the receiver in quasisynchronous vlp systems position estimation can be performed by utilizing time difference of arrival tdoa information together with channel attenuation information leading to a hybrid localization system to specify accuracy limits for quasisynchronous vlp systems the cramerrao lower bound crlb on position estimation is derived in a generic threedimensional scenario then a direct positioning approach is adopted to obtain the maximum likelihood ml position estimator based directly on received signals from led transmitters in addition a twostep position estimator is proposed where tdoa and received signal strength rss estimates are obtained in the first step and the position estimation is performed based on the tdoa and rss estimates in the second step the performance of the twostep positioning technique is shown to converge to that of direct positioning at high signaltonoise ratios based on asymptotic properties of ml estimation finally crlbs and performance of the proposed positioning techniques are investigated through simulations | [['in', 'a', 'visible', 'light', 'positioning', 'vlp', 'system', 'a', 'receiver', 'can', 'estimate', 'its', 'location', 'based', 'on', 'signals', 'transmitted', 'by', 'light', 'emitting', 'diodes', 'leds', 'in', 'this', 'manuscript', 'we', 'investigate', 'a', 'quasisynchronous', 'vlp', 'system', 'in', 'which', 'the', 'led', 'transmitters', 'are', 'synchronous', 'among', 'themselves', 'but', 'are', 'not', 'synchronized', 'with', 'the', 'receiver', 'in', 'quasisynchronous', 'vlp', 'systems', 'position', 'estimation', 'can', 'be', 'performed', 'by', 'utilizing', 'time', 'difference', 'of', 'arrival', 'tdoa', 'information', 'together', 'with', 'channel', 'attenuation', 'information', 'leading', 'to', 'a', 'hybrid', 'localization', 'system', 'to', 'specify', 'accuracy', 'limits', 'for', 'quasisynchronous', 'vlp', 'systems', 'the', 'cramerrao', 'lower', 'bound', 'crlb', 'on', 'position', 'estimation', 'is', 'derived', 'in', 'a', 'generic', 'threedimensional', 'scenario', 'then', 'a', 'direct', 'positioning', 'approach', 'is', 'adopted', 'to', 'obtain', 'the', 'maximum', 'likelihood', 'ml', 'position', 'estimator', 'based', 'directly', 'on', 'received', 'signals', 'from', 'led', 'transmitters', 'in', 'addition', 'a', 'twostep', 'position', 'estimator', 'is', 'proposed', 'where', 'tdoa', 'and', 'received', 'signal', 'strength', 'rss', 'estimates', 'are', 'obtained', 'in', 'the', 'first', 'step', 'and', 'the', 'position', 'estimation', 'is', 'performed', 'based', 'on', 'the', 'tdoa', 'and', 'rss', 'estimates', 'in', 'the', 'second', 'step', 'the', 'performance', 'of', 'the', 'twostep', 'positioning', 'technique', 'is', 'shown', 'to', 'converge', 'to', 'that', 'of', 'direct', 'positioning', 'at', 'high', 'signaltonoise', 'ratios', 'based', 'on', 'asymptotic', 'properties', 'of', 'ml', 'estimation', 'finally', 'crlbs', 'and', 'performance', 'of', 'the', 'proposed', 'positioning', 'techniques', 'are', 'investigated', 'through', 'simulations']] | [-0.15508415338990744, 0.021284473568666726, -0.09281574410153554, 0.005782473561848747, -0.06475894934963435, -0.20503088012337684, 0.08130182422464713, 0.4203197516594082, -0.20954034217633308, -0.301556658456102, 0.13293416053289547, -0.2423379746172577, -0.14165629896597237, 0.21488462287816218, -0.12020022838027217, 0.0828985014706268, 0.06855475849821233, 0.07333241655374877, -0.08293305473634974, -0.21163251980207862, 0.2096368691054522, 0.10762040756642818, 0.3591356485208962, -0.017869871001457795, 0.12930557436309756, 0.04097675173194148, -0.027912490218877792, -0.03333126884419471, -0.10127414217586192, 0.11870046882424504, 0.2508519646106288, 0.13921919618034737, 0.2287504319148138, -0.3773265712428838, -0.21329373689368367, 0.08055258889682591, 0.17807192142296116, 0.09471573044138495, -0.053758456159266645, -0.3428640917642042, 0.08789272752590477, -0.1370043916022405, -0.05174706353340298, 0.04677973583806306, -0.06701137717347593, 0.07090067794488278, -0.2999401453940663, 0.05772337313392199, -0.030244521046988666, 0.04281377737526782, -0.028282366482599172, -0.12166320225398522, 0.008452899216208606, 0.15519199290836697, 0.004882953735068441, -0.02027217595721595, 0.13665613238699734, -0.06474409532616847, -0.08616291461279615, 0.3262419835012406, -0.06549676244045259, -0.22836246943334118, 0.14754996174553525, -0.13653610171866604, -0.10153553000185639, 0.1635539524885826, 0.2587339096982032, 0.09918275328789605, -0.19532637224998325, 0.0061827657592948525, 0.034506328530842435, 0.22034770342172125, 0.05638794193277136, 0.09432156561641022, 0.1706272415467538, 0.18113009533612057, 0.11135461167432367, 0.08074603220855352, -0.1913097725866828, -0.05985989896347746, -0.21404260957089719, -0.10658923920622328, -0.24340345217380674, -0.022635186136394623, -0.07904587102646474, -0.09555510340884212, 0.3617440987878945, 0.18205073141492903, 0.17088265800615773, 0.07679263375990558, 0.3925679104216397, 0.13368594147032126, 0.007515192395076155, 0.061265063202008606, 0.305969777496648, 0.13461611773585902, 0.09174098569201306, -0.2000484512183175, 0.12488664153683203, 0.06358748770318925] |
1,802.03992 | Targeted Damage to Interdependent Networks | The giant mutually connected component (GMCC) of an interdependent or
multiplex network collapses with a discontinuous hybrid transition under random
damage to the network. If the nodes to be damaged are selected in a targeted
way, the collapse of the GMCC may occur significantly sooner. Finding the
minimal damage set which destroys the largest mutually connected component of a
given interdependent network is a computationally prohibitive simultaneous
optimization problem. We introduce a simple heuristic strategy -- Effective
Multiplex Degree -- for targeted attack on interdependent networks that
leverages the indirect damage inherent in multiplex networks to achieve a
damage set smaller than that found by any other non computationally intensive
algorithm. We show that the intuition from single layer networks that decycling
(damage of the $2$-core) is the most effective way to destroy the giant
component, does not carry over to interdependent networks, and in fact such
approaches are worse than simply removing the highest degree nodes.
| physics.soc-ph cond-mat.dis-nn cs.SI | the giant mutually connected component gmcc of an interdependent or multiplex network collapses with a discontinuous hybrid transition under random damage to the network if the nodes to be damaged are selected in a targeted way the collapse of the gmcc may occur significantly sooner finding the minimal damage set which destroys the largest mutually connected component of a given interdependent network is a computationally prohibitive simultaneous optimization problem we introduce a simple heuristic strategy effective multiplex degree for targeted attack on interdependent networks that leverages the indirect damage inherent in multiplex networks to achieve a damage set smaller than that found by any other non computationally intensive algorithm we show that the intuition from single layer networks that decycling damage of the 2core is the most effective way to destroy the giant component does not carry over to interdependent networks and in fact such approaches are worse than simply removing the highest degree nodes | [['the', 'giant', 'mutually', 'connected', 'component', 'gmcc', 'of', 'an', 'interdependent', 'or', 'multiplex', 'network', 'collapses', 'with', 'a', 'discontinuous', 'hybrid', 'transition', 'under', 'random', 'damage', 'to', 'the', 'network', 'if', 'the', 'nodes', 'to', 'be', 'damaged', 'are', 'selected', 'in', 'a', 'targeted', 'way', 'the', 'collapse', 'of', 'the', 'gmcc', 'may', 'occur', 'significantly', 'sooner', 'finding', 'the', 'minimal', 'damage', 'set', 'which', 'destroys', 'the', 'largest', 'mutually', 'connected', 'component', 'of', 'a', 'given', 'interdependent', 'network', 'is', 'a', 'computationally', 'prohibitive', 'simultaneous', 'optimization', 'problem', 'we', 'introduce', 'a', 'simple', 'heuristic', 'strategy', 'effective', 'multiplex', 'degree', 'for', 'targeted', 'attack', 'on', 'interdependent', 'networks', 'that', 'leverages', 'the', 'indirect', 'damage', 'inherent', 'in', 'multiplex', 'networks', 'to', 'achieve', 'a', 'damage', 'set', 'smaller', 'than', 'that', 'found', 'by', 'any', 'other', 'non', 'computationally', 'intensive', 'algorithm', 'we', 'show', 'that', 'the', 'intuition', 'from', 'single', 'layer', 'networks', 'that', 'decycling', 'damage', 'of', 'the', '2core', 'is', 'the', 'most', 'effective', 'way', 'to', 'destroy', 'the', 'giant', 'component', 'does', 'not', 'carry', 'over', 'to', 'interdependent', 'networks', 'and', 'in', 'fact', 'such', 'approaches', 'are', 'worse', 'than', 'simply', 'removing', 'the', 'highest', 'degree', 'nodes']] | [-0.17165381690907863, 0.09792842325808916, -0.024906571993544218, 0.027973457838356076, -0.09505644352325508, -0.1886972488925582, 0.09232896381328183, 0.39380155447570064, -0.2568077144340702, -0.2636579841225138, 0.05696920644446847, -0.28010975608241656, -0.2333637737053176, 0.11135776051500391, -0.06860480816554158, 0.011137263921949442, 0.09483973066052122, 0.04294601531038361, 0.021731173859969262, -0.25980457603300533, 0.3258781914749453, 0.05481223483727644, 0.2970519366764253, 0.005564054470103714, 0.04761793047430054, -0.011685775833264474, 0.014300636701556223, 0.06538999525890235, -0.05546110947484962, 0.11285360784405062, 0.26363362501705845, 0.14892191381884679, 0.3321777142283897, -0.4723725377551971, -0.2565457557651004, 0.21023735325753448, 0.14659367565125708, 0.10063314755492273, 0.05283177932348823, -0.24431172286671016, 0.14283403208058687, -0.1872035731398125, -0.10289186938410444, -0.05646196604976731, -0.021964015565331906, -0.016868991867428827, -0.27179389595384557, 0.05066446858090198, 0.05626566090992832, 0.01585439336636374, 0.03315244143858792, -0.10243910067985135, -0.06156859473896123, 0.10670443595792617, -0.03193613583552501, 0.004686492734829024, 0.17762948160375197, -0.12986838256399477, -0.12459695389674556, 0.3522405466906005, 0.021406954003220062, -0.16920708995312453, 0.1965370274505638, -0.06231444484193719, -0.1621709127129326, 0.19257948975709657, 0.19450958728670112, 0.10820558998253077, -0.1554482930430001, -0.043844829890651686, -0.015063910246376069, 0.18052878361307986, 0.04645489713838023, 0.01316546797714827, 0.17824440319842147, 0.22635710583699326, 0.15852046290172203, 0.13441050106682065, -0.05991566379164015, -0.07888197419984687, -0.211098244667594, -0.07404965368820535, -0.23305274671574513, 0.06408898776496626, -0.12874852375778925, -0.2068556244515123, 0.39077390048412547, 0.1628286339500318, 0.18913711221708404, 0.07879462421556274, 0.3074392728657732, 0.05831545088909596, 0.1420821566495203, 0.1356711387393936, 0.2280622625092585, 0.06981360575995378, 0.03969713705066111, -0.15508350278250874, 0.16852128978127673, -0.0046238502727881554] |
1,802.03993 | Symmetries of Quantified Boolean Formulas | While symmetries are well understood for Boolean formulas and successfully
exploited in practical SAT solving, less is known about symmetries in
quantified Boolean formulas (QBF). There are some works introducing adaptions
of propositional symmetry breaking techniques, with a theory covering only very
specific parts of QBF symmetries. We present a general framework that gives a
concise characterization of symmetries of QBF. Our framework naturally
incorporates the duality of universal and existential symmetries resulting in a
general basis for QBF symmetry breaking.
| cs.LO cs.SC | while symmetries are well understood for boolean formulas and successfully exploited in practical sat solving less is known about symmetries in quantified boolean formulas qbf there are some works introducing adaptions of propositional symmetry breaking techniques with a theory covering only very specific parts of qbf symmetries we present a general framework that gives a concise characterization of symmetries of qbf our framework naturally incorporates the duality of universal and existential symmetries resulting in a general basis for qbf symmetry breaking | [['while', 'symmetries', 'are', 'well', 'understood', 'for', 'boolean', 'formulas', 'and', 'successfully', 'exploited', 'in', 'practical', 'sat', 'solving', 'less', 'is', 'known', 'about', 'symmetries', 'in', 'quantified', 'boolean', 'formulas', 'qbf', 'there', 'are', 'some', 'works', 'introducing', 'adaptions', 'of', 'propositional', 'symmetry', 'breaking', 'techniques', 'with', 'a', 'theory', 'covering', 'only', 'very', 'specific', 'parts', 'of', 'qbf', 'symmetries', 'we', 'present', 'a', 'general', 'framework', 'that', 'gives', 'a', 'concise', 'characterization', 'of', 'symmetries', 'of', 'qbf', 'our', 'framework', 'naturally', 'incorporates', 'the', 'duality', 'of', 'universal', 'and', 'existential', 'symmetries', 'resulting', 'in', 'a', 'general', 'basis', 'for', 'qbf', 'symmetry', 'breaking']] | [-0.1239510355229823, 0.07801006547819225, -0.07259279719473404, 0.12801280222907893, -0.1737135491494871, -0.1757349347534739, 0.060001150487899134, 0.33692053034269237, -0.2799358406552562, -0.3173270210807706, 0.09035128061113488, -0.18493435294999752, -0.14845961102364977, 0.17142457921377005, -0.0787037421045911, 0.09406839950401107, -0.04951316161932033, -0.02120671292513977, -0.13625054785487367, -0.2010663420099903, 0.27078729731686135, -0.07079561757222738, 0.25103284056401914, 0.09309804521179126, 0.09108270500660126, 0.018656516620130452, -0.006322281136188978, 0.041307495803468756, -0.10155638695141533, 0.13012768569356406, 0.35386561633398134, 0.20860978688492818, 0.19435440048138486, -0.4571609584223709, -0.15424973312995316, 0.030664031602223807, 0.13003752790650147, 0.18970530424669477, -0.08699422062915048, -0.3164667480763186, 0.02430172917076651, -0.17643746913031297, -0.11248196291242853, -0.21335451093927763, 0.047868456708750236, -0.049174393352946086, -0.23367646175586146, 0.05953078275477445, 0.18567867331166557, 0.14133686137696108, -0.030005213813166374, -0.13861515325563098, 0.010652420260472062, 0.024479994487109375, 0.012160976391492618, -0.025961537793692615, 0.05312046448608147, -0.1365757251020383, -0.20244179613727295, 0.41480400916878823, 0.07093793687261181, -0.22949564995037186, 0.11357948309339491, -0.037598051671168684, -0.2683904271480846, 0.10455546594788263, 0.09083942903125268, 0.16676470660029646, -0.11703147407603899, 0.16002377133419807, -0.10982746005426218, 0.18582210896743667, 0.11259191786801373, 0.06394713459519187, 0.15079892884916912, 0.14872109313081536, 0.029572315341620532, 0.1739041720068565, 0.09525897378032958, -0.16058700444337762, -0.3665839433670044, -0.11279037006107377, -0.12227799464304598, 0.01423054871459802, -0.09205783747767535, -0.12253192172926149, 0.40696582977694495, 0.10838795105519239, 0.12866653366313305, 0.1522185122076836, 0.25607189659121227, 0.16729356158369532, 0.164800136246615, 0.02236737622477022, 0.15539575745042608, 0.16817263556345377, 0.043650937298266794, -0.17673394555243216, 0.07249085643662163, 0.13053115975847582] |
1,802.03994 | Asymmetry-driven plasmon instabilities in confined hydrodynamic electron
flows | Direct current in confined two-dimensional (2d) electron systems can become
unstable with respect to the excitation of plasmons. Numerous experiments and
simulations hint that structural asymmetry somehow promotes plasmon generation,
but a constitutive relation between asymmetry and instability has been missing.
We provide such relation in the present paper and show that bounded perfect 2d
electron fluids in asymmetric structures are unstable under arbitrarily weak
drive currents. To this end, we develop a perturbation theory for hydrodynamic
plasmons and evaluate corrections to their eigenfrequency induced by carrier
drift, scattering, and viscosity. We show that plasmon gain continuously
increases with degree of plasmon mode asymmetry until it surrenders to viscous
dissipation that also benefits from asymmetry. The developed formalism allows
us to put a lower bound on the instability threshold current, which corresponds
to the Reynolds number $R_{\min} = 2\sqrt{3}$ for one-dimensional plasmons in
2d channel under constant voltage bias.
| cond-mat.mes-hall | direct current in confined twodimensional 2d electron systems can become unstable with respect to the excitation of plasmons numerous experiments and simulations hint that structural asymmetry somehow promotes plasmon generation but a constitutive relation between asymmetry and instability has been missing we provide such relation in the present paper and show that bounded perfect 2d electron fluids in asymmetric structures are unstable under arbitrarily weak drive currents to this end we develop a perturbation theory for hydrodynamic plasmons and evaluate corrections to their eigenfrequency induced by carrier drift scattering and viscosity we show that plasmon gain continuously increases with degree of plasmon mode asymmetry until it surrenders to viscous dissipation that also benefits from asymmetry the developed formalism allows us to put a lower bound on the instability threshold current which corresponds to the reynolds number r_min 2sqrt3 for onedimensional plasmons in 2d channel under constant voltage bias | [['direct', 'current', 'in', 'confined', 'twodimensional', '2d', 'electron', 'systems', 'can', 'become', 'unstable', 'with', 'respect', 'to', 'the', 'excitation', 'of', 'plasmons', 'numerous', 'experiments', 'and', 'simulations', 'hint', 'that', 'structural', 'asymmetry', 'somehow', 'promotes', 'plasmon', 'generation', 'but', 'a', 'constitutive', 'relation', 'between', 'asymmetry', 'and', 'instability', 'has', 'been', 'missing', 'we', 'provide', 'such', 'relation', 'in', 'the', 'present', 'paper', 'and', 'show', 'that', 'bounded', 'perfect', '2d', 'electron', 'fluids', 'in', 'asymmetric', 'structures', 'are', 'unstable', 'under', 'arbitrarily', 'weak', 'drive', 'currents', 'to', 'this', 'end', 'we', 'develop', 'a', 'perturbation', 'theory', 'for', 'hydrodynamic', 'plasmons', 'and', 'evaluate', 'corrections', 'to', 'their', 'eigenfrequency', 'induced', 'by', 'carrier', 'drift', 'scattering', 'and', 'viscosity', 'we', 'show', 'that', 'plasmon', 'gain', 'continuously', 'increases', 'with', 'degree', 'of', 'plasmon', 'mode', 'asymmetry', 'until', 'it', 'surrenders', 'to', 'viscous', 'dissipation', 'that', 'also', 'benefits', 'from', 'asymmetry', 'the', 'developed', 'formalism', 'allows', 'us', 'to', 'put', 'a', 'lower', 'bound', 'on', 'the', 'instability', 'threshold', 'current', 'which', 'corresponds', 'to', 'the', 'reynolds', 'number', 'r_min', '2sqrt3', 'for', 'onedimensional', 'plasmons', 'in', '2d', 'channel', 'under', 'constant', 'voltage', 'bias']] | [-0.16678036320356754, 0.19248174157660655, -0.0874735981641287, 0.05415399558448887, -0.08294605974397445, -0.1664483958974833, 0.028139530536341103, 0.36985595902503543, -0.2613904778719754, -0.2773138028777966, 0.00552835756585606, -0.2738862997441076, -0.14502015482867137, 0.1873357509061493, 0.011364729185761707, 0.06981052716917081, 0.03166141024022993, -0.05236741594126215, -0.007657260313076344, -0.15871813877586377, 0.28073993345370163, 0.06078506601074509, 0.33033630079463927, 0.11797176953955754, 0.06180934058628171, -0.03442558431620332, 0.04510935445983164, 0.040981599412908826, -0.20278966425689146, 0.05763271406632722, 0.23348475086213266, -0.03000655710678296, 0.2347847181875762, -0.46965667132187533, -0.21857522610209984, 0.046198548563454, 0.19000554383367402, 0.15665813277450366, -0.09251936531359821, -0.22675978069546054, 0.062224129233761014, -0.18671470035012652, -0.13779953531795056, -0.0670992990427122, 0.04981524558624605, -0.0026437365072401794, -0.2854540176639283, 0.13390349126181006, 0.06971239772581218, 0.02407298484703878, -0.04554682634212391, -0.05797279064191153, -0.07698295167505716, 0.05280981561254767, 0.08014785802948314, 0.01899573187079482, 0.16448478513307604, -0.1334850761065133, -0.06564212717568955, 0.33481527880035544, -0.09183154146916964, -0.21481355833443436, 0.21273563328675762, -0.19923215689817192, -0.01588601684311839, 0.16425176885457257, 0.19555249165215, 0.05356134994370813, -0.0897775412892303, 0.050886993347966064, -0.012437993767545433, 0.16212333440037313, 0.1161871261318919, 0.05299389028978358, 0.23564724429397266, 0.15261445765389833, 0.09811220538324199, 0.13484305640009256, -0.08984985489508757, -0.05370730076557831, -0.26199522324384666, -0.12009557618662134, -0.14129612670729183, 0.0564804573431674, -0.021311583338919683, -0.1692476923313193, 0.383192526702014, 0.16849191120284535, 0.17018288728856557, 0.04244449530725015, 0.29385247783707075, 0.16122704479415473, 0.06697551729598057, 0.06820646210336063, 0.2987777557903649, 0.18452685728914583, 0.09769846388057025, -0.2717852554884991, 0.02571884626396806, 0.026449501900158892] |
1,802.03995 | First scattered light detection of a nearly edge-on transition disk
around the T Tauri star RY Lup | Transition disks are considered sites of ongoing planet formation, and their
dust and gas distributions could be signposts of embedded planets. The
transition disk around the T Tauri star RY Lup has an inner dust cavity and
displays a strong silicate emission feature. Using high-resolution imaging we
study the disk geometry, including non-axisymmetric features, and its surface
dust grain, to gain a better understanding of the disk evolutionary process.
Moreover, we search for companion candidates, possibly connected to the disk.
We obtained high-contrast and high angular resolution data in the near-infrared
with the VLT/SPHERE extreme adaptive optics instrument whose goal is to study
the planet formation by detecting and characterizing these planets and their
formation environments through direct imaging. We performed polarimetric
imaging of the RY~Lup disk with IRDIS (at 1.6 microns), and obtained intensity
images with the IRDIS dual-band imaging camera simultaneously with the IFS
spectro-imager (0.9-1.3 microns). We resolved for the first time the scattered
light from the nearly edge-on circumstellar disk around RY~Lup, at projected
separations in the 100 \,au range. The shape of the disk and its sharp features
are clearly detectable at wavelengths ranging from 0.9 to 1.6 microns. We show
that the observed morphology can be interpreted as spiral arms in the disk.
This interpretation is supported by in-depth numerical simulations. We also
demonstrate that these features can be produced by one planet interacting with
the disk. We also detect several point sources which are classified as probable
background objects.
| astro-ph.EP | transition disks are considered sites of ongoing planet formation and their dust and gas distributions could be signposts of embedded planets the transition disk around the t tauri star ry lup has an inner dust cavity and displays a strong silicate emission feature using highresolution imaging we study the disk geometry including nonaxisymmetric features and its surface dust grain to gain a better understanding of the disk evolutionary process moreover we search for companion candidates possibly connected to the disk we obtained highcontrast and high angular resolution data in the nearinfrared with the vltsphere extreme adaptive optics instrument whose goal is to study the planet formation by detecting and characterizing these planets and their formation environments through direct imaging we performed polarimetric imaging of the rylup disk with irdis at 16 microns and obtained intensity images with the irdis dualband imaging camera simultaneously with the ifs spectroimager 0913 microns we resolved for the first time the scattered light from the nearly edgeon circumstellar disk around rylup at projected separations in the 100 au range the shape of the disk and its sharp features are clearly detectable at wavelengths ranging from 09 to 16 microns we show that the observed morphology can be interpreted as spiral arms in the disk this interpretation is supported by indepth numerical simulations we also demonstrate that these features can be produced by one planet interacting with the disk we also detect several point sources which are classified as probable background objects | [['transition', 'disks', 'are', 'considered', 'sites', 'of', 'ongoing', 'planet', 'formation', 'and', 'their', 'dust', 'and', 'gas', 'distributions', 'could', 'be', 'signposts', 'of', 'embedded', 'planets', 'the', 'transition', 'disk', 'around', 'the', 't', 'tauri', 'star', 'ry', 'lup', 'has', 'an', 'inner', 'dust', 'cavity', 'and', 'displays', 'a', 'strong', 'silicate', 'emission', 'feature', 'using', 'highresolution', 'imaging', 'we', 'study', 'the', 'disk', 'geometry', 'including', 'nonaxisymmetric', 'features', 'and', 'its', 'surface', 'dust', 'grain', 'to', 'gain', 'a', 'better', 'understanding', 'of', 'the', 'disk', 'evolutionary', 'process', 'moreover', 'we', 'search', 'for', 'companion', 'candidates', 'possibly', 'connected', 'to', 'the', 'disk', 'we', 'obtained', 'highcontrast', 'and', 'high', 'angular', 'resolution', 'data', 'in', 'the', 'nearinfrared', 'with', 'the', 'vltsphere', 'extreme', 'adaptive', 'optics', 'instrument', 'whose', 'goal', 'is', 'to', 'study', 'the', 'planet', 'formation', 'by', 'detecting', 'and', 'characterizing', 'these', 'planets', 'and', 'their', 'formation', 'environments', 'through', 'direct', 'imaging', 'we', 'performed', 'polarimetric', 'imaging', 'of', 'the', 'rylup', 'disk', 'with', 'irdis', 'at', '16', 'microns', 'and', 'obtained', 'intensity', 'images', 'with', 'the', 'irdis', 'dualband', 'imaging', 'camera', 'simultaneously', 'with', 'the', 'ifs', 'spectroimager', '0913', 'microns', 'we', 'resolved', 'for', 'the', 'first', 'time', 'the', 'scattered', 'light', 'from', 'the', 'nearly', 'edgeon', 'circumstellar', 'disk', 'around', 'rylup', 'at', 'projected', 'separations', 'in', 'the', '100', 'au', 'range', 'the', 'shape', 'of', 'the', 'disk', 'and', 'its', 'sharp', 'features', 'are', 'clearly', 'detectable', 'at', 'wavelengths', 'ranging', 'from', '09', 'to', '16', 'microns', 'we', 'show', 'that', 'the', 'observed', 'morphology', 'can', 'be', 'interpreted', 'as', 'spiral', 'arms', 'in', 'the', 'disk', 'this', 'interpretation', 'is', 'supported', 'by', 'indepth', 'numerical', 'simulations', 'we', 'also', 'demonstrate', 'that', 'these', 'features', 'can', 'be', 'produced', 'by', 'one', 'planet', 'interacting', 'with', 'the', 'disk', 'we', 'also', 'detect', 'several', 'point', 'sources', 'which', 'are', 'classified', 'as', 'probable', 'background', 'objects']] | [-0.06781737979004812, 0.07551880664203829, -0.0845932735160726, 0.036456949959048246, -0.07277385395050781, -0.09066430047788031, -0.016400981271738706, 0.47000498028632376, -0.23835378855879066, -0.35258836394412535, 0.1156258560095906, -0.28128905273920507, -0.07553405502475187, 0.17501986994370855, -0.03439298743901194, 0.016998129234111058, 0.08353845575837739, -0.1313779994379729, -0.013603357157811186, -0.21465758989005898, 0.2805551487587957, 0.09714602006477166, 0.07124151824210144, -0.017122521806607543, 0.053002000718137064, -0.08418590013943536, -0.06554079670497201, -0.035633825283825825, -0.1859570934810436, 0.06446652640878427, 0.25305559265629585, 0.09039355825716783, 0.17929930075503062, -0.3796819098919752, -0.21756078295799003, 0.023613021046793484, 0.171476502652322, 0.00473090996689041, -0.058756890404944646, -0.3012174493824055, 0.09216592420220802, -0.11120743783222962, -0.1787091029968235, 0.030375834900817116, 0.029562930388044046, -0.004962266944291559, -0.2558346769150316, 0.06146888602806492, 0.04592681828992189, 0.14051563288352345, -0.1382955582516619, -0.08969412787462447, -0.08335922580769621, 0.08676820689264578, -0.02697498803077071, 0.07243588191626944, 0.21404617804018627, -0.13807104534343587, -0.061387034647403374, 0.3655808059933794, -0.1171607058767237, -0.03164402565052427, 0.29154331310362114, -0.27246071888967877, -0.09445259343311725, 0.20242606381671963, 0.16424704358729794, 0.15911898361022783, -0.12568688194542268, -0.01127919760846617, -0.026335278209146173, 0.2068330779320753, 0.10530890083726739, 0.10071437326488925, 0.3855356276684181, 0.15033611493685176, 0.009693785498517977, 0.14765244013902762, -0.2996454381548082, -0.05282673315282484, -0.21965610330111393, -0.13244725075038913, -0.16324339162359838, 0.040964241776535223, -0.12660768819519855, -0.08365955736586389, 0.32012332195500065, 0.12202587317709704, 0.2154289248597915, 0.008426634224559196, 0.31702348062783847, 0.06159013694011011, 0.1366220234977234, 0.08728684594503558, 0.30956693256845685, 0.1138504209201096, 0.12267628494749365, -0.23203210059751864, 0.03451608542303295, -0.04681658951878609] |
1,802.03996 | Know Your Mind: Adaptive Brain Signal Classification with Reinforced
Attentive Convolutional Neural Networks | Electroencephalography (EEG) signals reflect activities on certain brain
areas. Effective classification of time-varying EEG signals is still
challenging. First, EEG signal processing and feature engineering are
time-consuming and highly rely on expert knowledge. In addition, most existing
studies focus on domain-specific classification algorithms which may not be
applicable to other domains. Moreover, the EEG signal usually has a low
signal-to-noise ratio and can be easily corrupted. In this regard, we propose a
generic EEG signal classification framework that accommodates a wide range of
applications to address the aforementioned issues. The proposed framework
develops a reinforced selective attention model to automatically choose the
distinctive information among the raw EEG signals. A convolutional mapping
operation is employed to dynamically transform the selected information to an
over-complete feature space, wherein implicit spatial dependency of EEG samples
distribution is able to be uncovered. We demonstrate the effectiveness of the
proposed framework using three representative scenarios: intention recognition
with motor imagery EEG, person identification, and neurological diagnosis.
Three widely used public datasets and a local dataset are used for our
evaluation. The experiments show that our framework outperforms the
state-of-the-art baselines and achieves the accuracy of more than 97% on all
the datasets with low latency and good resilience of handling complex EEG
signals across various domains. These results confirm the suitability of the
proposed generic approach for a range of problems in the realm of
Brain-Computer Interface applications.
| cs.HC | electroencephalography eeg signals reflect activities on certain brain areas effective classification of timevarying eeg signals is still challenging first eeg signal processing and feature engineering are timeconsuming and highly rely on expert knowledge in addition most existing studies focus on domainspecific classification algorithms which may not be applicable to other domains moreover the eeg signal usually has a low signaltonoise ratio and can be easily corrupted in this regard we propose a generic eeg signal classification framework that accommodates a wide range of applications to address the aforementioned issues the proposed framework develops a reinforced selective attention model to automatically choose the distinctive information among the raw eeg signals a convolutional mapping operation is employed to dynamically transform the selected information to an overcomplete feature space wherein implicit spatial dependency of eeg samples distribution is able to be uncovered we demonstrate the effectiveness of the proposed framework using three representative scenarios intention recognition with motor imagery eeg person identification and neurological diagnosis three widely used public datasets and a local dataset are used for our evaluation the experiments show that our framework outperforms the stateoftheart baselines and achieves the accuracy of more than 97 on all the datasets with low latency and good resilience of handling complex eeg signals across various domains these results confirm the suitability of the proposed generic approach for a range of problems in the realm of braincomputer interface applications | [['electroencephalography', 'eeg', 'signals', 'reflect', 'activities', 'on', 'certain', 'brain', 'areas', 'effective', 'classification', 'of', 'timevarying', 'eeg', 'signals', 'is', 'still', 'challenging', 'first', 'eeg', 'signal', 'processing', 'and', 'feature', 'engineering', 'are', 'timeconsuming', 'and', 'highly', 'rely', 'on', 'expert', 'knowledge', 'in', 'addition', 'most', 'existing', 'studies', 'focus', 'on', 'domainspecific', 'classification', 'algorithms', 'which', 'may', 'not', 'be', 'applicable', 'to', 'other', 'domains', 'moreover', 'the', 'eeg', 'signal', 'usually', 'has', 'a', 'low', 'signaltonoise', 'ratio', 'and', 'can', 'be', 'easily', 'corrupted', 'in', 'this', 'regard', 'we', 'propose', 'a', 'generic', 'eeg', 'signal', 'classification', 'framework', 'that', 'accommodates', 'a', 'wide', 'range', 'of', 'applications', 'to', 'address', 'the', 'aforementioned', 'issues', 'the', 'proposed', 'framework', 'develops', 'a', 'reinforced', 'selective', 'attention', 'model', 'to', 'automatically', 'choose', 'the', 'distinctive', 'information', 'among', 'the', 'raw', 'eeg', 'signals', 'a', 'convolutional', 'mapping', 'operation', 'is', 'employed', 'to', 'dynamically', 'transform', 'the', 'selected', 'information', 'to', 'an', 'overcomplete', 'feature', 'space', 'wherein', 'implicit', 'spatial', 'dependency', 'of', 'eeg', 'samples', 'distribution', 'is', 'able', 'to', 'be', 'uncovered', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'framework', 'using', 'three', 'representative', 'scenarios', 'intention', 'recognition', 'with', 'motor', 'imagery', 'eeg', 'person', 'identification', 'and', 'neurological', 'diagnosis', 'three', 'widely', 'used', 'public', 'datasets', 'and', 'a', 'local', 'dataset', 'are', 'used', 'for', 'our', 'evaluation', 'the', 'experiments', 'show', 'that', 'our', 'framework', 'outperforms', 'the', 'stateoftheart', 'baselines', 'and', 'achieves', 'the', 'accuracy', 'of', 'more', 'than', '97', 'on', 'all', 'the', 'datasets', 'with', 'low', 'latency', 'and', 'good', 'resilience', 'of', 'handling', 'complex', 'eeg', 'signals', 'across', 'various', 'domains', 'these', 'results', 'confirm', 'the', 'suitability', 'of', 'the', 'proposed', 'generic', 'approach', 'for', 'a', 'range', 'of', 'problems', 'in', 'the', 'realm', 'of', 'braincomputer', 'interface', 'applications']] | [-0.07217444406780534, -0.015745522698591977, -0.06192288615016474, 0.058800082807986334, -0.13318307453698805, -0.19504367989392427, -0.003235518712944423, 0.42817891207643044, -0.2333988241247363, -0.32235195357591295, 0.12309116105455507, -0.26919435263953656, -0.2182463436948661, 0.24652404128723085, -0.12733061561305234, 0.07996525099619418, 0.12331543448823902, 0.04876388212502735, -0.04921660981087301, -0.24364280513573328, 0.25471940055080594, 0.012845324758344736, 0.40802990848946774, 0.03263129524162246, 0.09481958631211175, -0.016461187496017188, -0.05966721294083609, -0.02041550340943345, -0.01568263820523016, 0.14920868116065772, 0.39282757298857707, 0.19794301766231576, 0.30439847433923656, -0.4112864655967897, -0.2764575952459047, 0.10380740457216404, 0.11532118817906763, 0.07845156148867583, -0.06322835159069375, -0.38872257593828136, 0.11594040823093432, -0.13670452072187605, 0.02423379872328578, -0.13793000828427, -0.023567934121546518, -0.025686251847312238, -0.3126162848013461, 0.08034545580125672, 0.023994163723471455, 0.0907137852279533, -0.06285139705894244, -0.10622447244544378, 0.06275492717271161, 0.18507397583582336, 0.03820396068905934, 0.024175263287571188, 0.17862524287068707, -0.14827852371809447, -0.1341187938824933, 0.34992458888242006, -0.027622753498853386, -0.2236708902612599, 0.2568553581089577, -0.053416383673883946, -0.16275313946480155, 0.11773578962510149, 0.23993838714976978, 0.11254084006879224, -0.19026421961915863, -0.006496736455935603, 0.016984249982568953, 0.2129664541118675, 0.03689296244749099, 0.01848805099964524, 0.16653983026711094, 0.2494015524752884, 0.002981821124831963, 0.13026929388004832, -0.15544399419305927, -0.022466590739468224, -0.20890302279601908, -0.07904595352060552, -0.1944084477622826, -0.06918665324406187, -0.11340028803521204, -0.115564252785208, 0.45559656101629203, 0.23329785593206254, 0.17481545332031181, 0.05974422945484517, 0.34296682350831026, 0.019679084584379617, 0.09726142291075145, 0.049231841989084445, 0.17158511862940848, 0.0346016315703527, 0.13712062517357154, -0.1746291792185372, 0.10322727913618522, -0.02853976124817999] |
1,802.03997 | GEMSEC: Graph Embedding with Self Clustering | Modern graph embedding procedures can efficiently process graphs with
millions of nodes. In this paper, we propose GEMSEC -- a graph embedding
algorithm which learns a clustering of the nodes simultaneously with computing
their embedding. GEMSEC is a general extension of earlier work in the domain of
sequence-based graph embedding. GEMSEC places nodes in an abstract feature
space where the vertex features minimize the negative log-likelihood of
preserving sampled vertex neighborhoods, and it incorporates known social
network properties through a machine learning regularization. We present two
new social network datasets and show that by simultaneously considering the
embedding and clustering problems with respect to social properties, GEMSEC
extracts high-quality clusters competitive with or superior to other community
detection algorithms. In experiments, the method is found to be computationally
efficient and robust to the choice of hyperparameters.
| cs.SI | modern graph embedding procedures can efficiently process graphs with millions of nodes in this paper we propose gemsec a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding gemsec is a general extension of earlier work in the domain of sequencebased graph embedding gemsec places nodes in an abstract feature space where the vertex features minimize the negative loglikelihood of preserving sampled vertex neighborhoods and it incorporates known social network properties through a machine learning regularization we present two new social network datasets and show that by simultaneously considering the embedding and clustering problems with respect to social properties gemsec extracts highquality clusters competitive with or superior to other community detection algorithms in experiments the method is found to be computationally efficient and robust to the choice of hyperparameters | [['modern', 'graph', 'embedding', 'procedures', 'can', 'efficiently', 'process', 'graphs', 'with', 'millions', 'of', 'nodes', 'in', 'this', 'paper', 'we', 'propose', 'gemsec', 'a', 'graph', 'embedding', 'algorithm', 'which', 'learns', 'a', 'clustering', 'of', 'the', 'nodes', 'simultaneously', 'with', 'computing', 'their', 'embedding', 'gemsec', 'is', 'a', 'general', 'extension', 'of', 'earlier', 'work', 'in', 'the', 'domain', 'of', 'sequencebased', 'graph', 'embedding', 'gemsec', 'places', 'nodes', 'in', 'an', 'abstract', 'feature', 'space', 'where', 'the', 'vertex', 'features', 'minimize', 'the', 'negative', 'loglikelihood', 'of', 'preserving', 'sampled', 'vertex', 'neighborhoods', 'and', 'it', 'incorporates', 'known', 'social', 'network', 'properties', 'through', 'a', 'machine', 'learning', 'regularization', 'we', 'present', 'two', 'new', 'social', 'network', 'datasets', 'and', 'show', 'that', 'by', 'simultaneously', 'considering', 'the', 'embedding', 'and', 'clustering', 'problems', 'with', 'respect', 'to', 'social', 'properties', 'gemsec', 'extracts', 'highquality', 'clusters', 'competitive', 'with', 'or', 'superior', 'to', 'other', 'community', 'detection', 'algorithms', 'in', 'experiments', 'the', 'method', 'is', 'found', 'to', 'be', 'computationally', 'efficient', 'and', 'robust', 'to', 'the', 'choice', 'of', 'hyperparameters']] | [-0.07358852305225339, -0.0003294200143837198, -0.06496541886073019, 0.049841201084267664, -0.1691036772310596, -0.16723107004331217, 0.0567635500277565, 0.45820415991323965, -0.32297185949153373, -0.3416720392501534, 0.04716705123859423, -0.3104790793938769, -0.2131388257999249, 0.11523126641598841, -0.10059354819391889, 0.055874812120088824, 0.13951123516868663, 0.06139585656562337, -0.015737823743580116, -0.2866329398831887, 0.32305822262057554, 0.04273755008492757, 0.3051755360983036, 0.002985955698898545, 0.1321230174721374, 0.012397282496439638, -0.05123901253531653, 0.06216954797553761, -0.07765711081969871, 0.2016721149410673, 0.32470351867377756, 0.20918692911940592, 0.3174965083323143, -0.383607575662986, -0.23177919013908616, 0.1585042129865744, 0.15262432071138862, 0.08757118578597092, -0.018254690811348458, -0.30480787314612556, 0.10299511857986174, -0.1196640489778171, -0.001575844507250521, -0.12391076774629592, -0.020042409506384973, -0.002858843095600605, -0.29231556438737444, 0.014580085433812605, 0.048053637790252214, 0.007293873811485591, 0.0031702438369393348, -0.10132266921077475, 0.016321811849182404, 0.12432578446309048, -0.006302233768359723, 0.04891216132996811, 0.13170496701021436, -0.1432964876466603, -0.18229301764664274, 0.3635824552150788, -0.025690915694253313, -0.19176256025761917, 0.178339118020678, -0.012852015149676137, -0.1912396287959483, 0.0746846414550587, 0.22413905155155117, 0.12493802056544356, -0.17449175906885, 0.06829993982661378, -0.03489501426229254, 0.1405017905747863, 0.035255384691818444, 0.013265230674382851, 0.11260188668276425, 0.22904461886457822, 0.1246891062706709, 0.154869180543055, -0.05606421651146202, -0.06197949018053434, -0.19518231948216755, -0.1014210687191398, -0.22708585480641988, -0.04035355002205405, -0.1958774128924469, -0.1864942771141176, 0.4339630809681559, 0.16802875586888857, 0.24313070272026516, 0.09721991527497906, 0.30658775305168495, 0.020986178869174588, 0.1010201272468462, 0.15974502909100718, 0.14335478070467986, 0.04855452732665947, 0.07297327742325486, -0.1514905915716318, 0.10336366403778946, 0.08842835532225392] |
1,802.03998 | Erlang Code Evolution Control (Use Cases) | The main goal of this work is to show how SecEr can be used in different
scenarios. Concretely, we demonstrate how a user can run SecEr to obtain
reports about the behaviour preservation between versions as well as how a user
can use SecEr to find the source of a discrepancy. The use cases presented are
three: two completely different versions of the same program, an improvement in
the performance of a function and a program where an error has been introduced.
A complete description of the technique and the tool is available at [1] and
[2].
| cs.PL cs.SE | the main goal of this work is to show how secer can be used in different scenarios concretely we demonstrate how a user can run secer to obtain reports about the behaviour preservation between versions as well as how a user can use secer to find the source of a discrepancy the use cases presented are three two completely different versions of the same program an improvement in the performance of a function and a program where an error has been introduced a complete description of the technique and the tool is available at 1 and 2 | [['the', 'main', 'goal', 'of', 'this', 'work', 'is', 'to', 'show', 'how', 'secer', 'can', 'be', 'used', 'in', 'different', 'scenarios', 'concretely', 'we', 'demonstrate', 'how', 'a', 'user', 'can', 'run', 'secer', 'to', 'obtain', 'reports', 'about', 'the', 'behaviour', 'preservation', 'between', 'versions', 'as', 'well', 'as', 'how', 'a', 'user', 'can', 'use', 'secer', 'to', 'find', 'the', 'source', 'of', 'a', 'discrepancy', 'the', 'use', 'cases', 'presented', 'are', 'three', 'two', 'completely', 'different', 'versions', 'of', 'the', 'same', 'program', 'an', 'improvement', 'in', 'the', 'performance', 'of', 'a', 'function', 'and', 'a', 'program', 'where', 'an', 'error', 'has', 'been', 'introduced', 'a', 'complete', 'description', 'of', 'the', 'technique', 'and', 'the', 'tool', 'is', 'available', 'at', '1', 'and', '2']] | [-0.06276160208316348, 0.02308769258892538, -0.12601287568410494, 0.08991913730398626, -0.05430636875158579, -0.1034783066836061, 0.010010935423761299, 0.3736413802145068, -0.2622040031122562, -0.3577778467274818, 0.12597509594778195, -0.25722108278711586, -0.14879270023714328, 0.2172595922614342, -0.08307539385541812, 0.03213655334158042, 0.04653008084878633, 0.047680546404774656, -0.07214965603131916, -0.27860753000089805, 0.30330088123986404, 0.056598016608160794, 0.2582697512716362, 0.08457133628082336, 0.0763273421007679, -0.00455521982278406, 4.48460383436729e-05, 0.027074530287585, -0.11298095479069911, 0.10476876187531911, 0.26067937983526396, 0.19415109951922804, 0.2818403690381302, -0.3862251812860984, -0.1588845020448117, 0.07445166704542551, 0.15173770327687494, 0.12471553728406884, -0.020828731214032344, -0.23091883838810412, 0.11311533044634829, -0.1931567842659262, -0.09262619488248505, -0.05589287723750644, -0.026149616912775432, 0.016231651600335063, -0.2807825314332299, -0.011475293397826632, 0.05019883966894302, 0.04640746132960332, -0.004057339157371484, -0.09195027328768418, 0.019816506522006748, 0.21361736041138468, 0.05117537763891453, 0.0381639096501869, 0.06829389414183565, -0.10111357578551684, -0.1633155141217807, 0.3894758607001649, -0.08409754900242557, -0.21188190793522546, 0.21191171242269813, -0.0831681370792776, -0.12274598497801374, 0.05719810297722285, 0.1845306951418212, 0.12121885039449967, -0.17126885710341722, 0.04838171237227555, -0.03553440953729693, 0.20433396904623694, 0.028381393219046678, 0.006113373832873155, 0.1670922232796582, 0.17329571220409318, 0.055281011832964404, 0.1890496419557879, -0.07226655831483682, -0.030845340348530523, -0.3185946632407068, -0.168383077007824, -0.15085686601160728, 0.02229336132631474, -0.01949907901181393, -0.07921421906152337, 0.41816928391296837, 0.16608507609110057, 0.21492477498718143, 0.04518299041911192, 0.2941258122169979, 0.08193678453267005, 0.03763055630489109, 0.06877229971446328, 0.20636498313589194, 0.06252578592657582, 0.10437392579756447, -0.16942025319500298, 0.06708913669470198, 0.014654263613995203] |
1,802.03999 | A question of Frohardt on $2$-groups, skew translation quadrangles of
even order and cyclic STGQs | We solve a fundamental question posed in Frohardt's 1988 paper [8] on finite
$2$-groups with Kantor familes, by showing that finite groups $K$ with a Kantor
family $(\mathcal{F},\mathcal{F}^*)$ having distinct members $A, B \in
\mathcal{F}$ such that $A^* \cap B^*$ is a central subgroup of $K$ and the
quotient $K/(A^* \cap B^*)$ is abelian cannot exist if the center of $K$ has
exponent $4$ and the members of $\mathcal{F}$ are elementary abelian. Then we
give a short geometrical proof of a recent result of Ott which says that finite
skew translation quadrangles of even order $(t,t)$ (where $t$ is not a square)
are always translation generalized quadrangles. This is a consequence of a
complete classification of finite cyclic skew translation quadrangles of order
$(t,t)$ that we carry out in the present paper.
| math.GR | we solve a fundamental question posed in frohardts 1988 paper 8 on finite 2groups with kantor familes by showing that finite groups k with a kantor family mathcalfmathcalf having distinct members a b in mathcalf such that a cap b is a central subgroup of k and the quotient ka cap b is abelian cannot exist if the center of k has exponent 4 and the members of mathcalf are elementary abelian then we give a short geometrical proof of a recent result of ott which says that finite skew translation quadrangles of even order tt where t is not a square are always translation generalized quadrangles this is a consequence of a complete classification of finite cyclic skew translation quadrangles of order tt that we carry out in the present paper | [['we', 'solve', 'a', 'fundamental', 'question', 'posed', 'in', 'frohardts', '1988', 'paper', '8', 'on', 'finite', '2groups', 'with', 'kantor', 'familes', 'by', 'showing', 'that', 'finite', 'groups', 'k', 'with', 'a', 'kantor', 'family', 'mathcalfmathcalf', 'having', 'distinct', 'members', 'a', 'b', 'in', 'mathcalf', 'such', 'that', 'a', 'cap', 'b', 'is', 'a', 'central', 'subgroup', 'of', 'k', 'and', 'the', 'quotient', 'ka', 'cap', 'b', 'is', 'abelian', 'can', 'not', 'exist', 'if', 'the', 'center', 'of', 'k', 'has', 'exponent', '4', 'and', 'the', 'members', 'of', 'mathcalf', 'are', 'elementary', 'abelian', 'then', 'we', 'give', 'a', 'short', 'geometrical', 'proof', 'of', 'a', 'recent', 'result', 'of', 'ott', 'which', 'says', 'that', 'finite', 'skew', 'translation', 'quadrangles', 'of', 'even', 'order', 'tt', 'where', 't', 'is', 'not', 'a', 'square', 'are', 'always', 'translation', 'generalized', 'quadrangles', 'this', 'is', 'a', 'consequence', 'of', 'a', 'complete', 'classification', 'of', 'finite', 'cyclic', 'skew', 'translation', 'quadrangles', 'of', 'order', 'tt', 'that', 'we', 'carry', 'out', 'in', 'the', 'present', 'paper']] | [-0.18737213149353976, 0.15312045923512402, -0.08406171147384546, 0.020049080760076016, -0.10120171373079083, -0.166105080140001, 0.05456526602355351, 0.33098661037915533, -0.2909011605145936, -0.2081423559446485, 0.1064364202578289, -0.2782878800728963, -0.11199213890047773, 0.15924673757999283, -0.1188840450015175, -0.05186919620943092, 0.031585236277274845, 0.10231444428013708, -0.07053856547914787, -0.31640344969075146, 0.31800578946944413, -0.07570129413360317, 0.19902534698907515, 0.05396881747372335, 0.09441008023164085, 0.0021888423659518815, -0.02047117880744618, 0.042996721022286036, -0.16456501526542128, 0.08319661225981385, 0.2784736680279251, 0.10445119588074224, 0.2434167570420292, -0.2797045348468059, -0.14916474734369012, 0.18334177940131258, 0.14603996448545853, 0.04806124827316216, -0.04060626904416175, -0.2039436351308841, 0.18261910073516022, -0.22888725614957228, -0.1239506540613832, -0.06017296477611966, 0.11919912978480676, 0.010699220719740136, -0.24244326745508282, 0.038057780454916354, 0.21261327910656466, 0.15030829958930497, -0.0033946804478337976, -0.12857676074548646, -0.012923809873892833, 0.053927727328001995, -0.02668764996022441, 0.08238330174180615, 0.019753211639992153, -0.03978078736113171, -0.1579019402665662, 0.4050742471177408, -0.056792299243628636, -0.17858426341118702, 0.14274497811312836, -0.1607837419270872, -0.17305016765043935, 0.11170898455031614, 0.11907039815559983, 0.1402080661780734, -0.06950607148660276, 0.19570224636451178, -0.19431264577646748, 0.13417040958701995, 0.1191007245317784, -0.0419835880583593, 0.14053165992963632, 0.09273947936034839, 0.08058897574353992, 0.15444339309172092, -0.010319265517413275, -0.0019096837890910283, -0.343322750699941, -0.15879743162165788, -0.1295361499806852, 0.15669017571992355, -0.050044961356982685, -0.1811228302851291, 0.37714640588592024, 0.04116731412523917, 0.17857494632862791, 0.05628395831756265, 0.17131964494083218, 0.0368227330072008, 0.08144914221110974, 0.1106712672617713, 0.10333588069219513, 0.17007744632384078, -0.03432974301434996, -0.13272087418835055, -0.017970264575600567, 0.16132799368920445] |
1,802.04 | Invariant measures for the stochastic one-dimensional compressible
Navier-Stokes equations | We investigate the long-time behavior of solutions to a stochastically forced
one-dimensional Navier-Stokes system, describing the motion of a compressible
viscous fluid, in the case of linear pressure law. We prove existence of an
invariant measure for the Markov process generated by strong solutions. We
overcome the difficulties of working with non-Feller Markov semigroups on
non-complete metric spaces by generalizing the classical Krylov-Bogoliubov
method, and by providing suitable polynomial and exponential moment bounds on
the solution, together with pathwise estimates.
| math.AP math.PR physics.flu-dyn | we investigate the longtime behavior of solutions to a stochastically forced onedimensional navierstokes system describing the motion of a compressible viscous fluid in the case of linear pressure law we prove existence of an invariant measure for the markov process generated by strong solutions we overcome the difficulties of working with nonfeller markov semigroups on noncomplete metric spaces by generalizing the classical krylovbogoliubov method and by providing suitable polynomial and exponential moment bounds on the solution together with pathwise estimates | [['we', 'investigate', 'the', 'longtime', 'behavior', 'of', 'solutions', 'to', 'a', 'stochastically', 'forced', 'onedimensional', 'navierstokes', 'system', 'describing', 'the', 'motion', 'of', 'a', 'compressible', 'viscous', 'fluid', 'in', 'the', 'case', 'of', 'linear', 'pressure', 'law', 'we', 'prove', 'existence', 'of', 'an', 'invariant', 'measure', 'for', 'the', 'markov', 'process', 'generated', 'by', 'strong', 'solutions', 'we', 'overcome', 'the', 'difficulties', 'of', 'working', 'with', 'nonfeller', 'markov', 'semigroups', 'on', 'noncomplete', 'metric', 'spaces', 'by', 'generalizing', 'the', 'classical', 'krylovbogoliubov', 'method', 'and', 'by', 'providing', 'suitable', 'polynomial', 'and', 'exponential', 'moment', 'bounds', 'on', 'the', 'solution', 'together', 'with', 'pathwise', 'estimates']] | [-0.14866388598456978, 0.10387327336811722, -0.0834126566303894, 0.06854989772339196, -0.07086660179775209, -0.1258758001960814, 0.011811239514645421, 0.29337628472130745, -0.32464682942954826, -0.21566652310430073, 0.1443585226603318, -0.26197895141958727, -0.0905448062272626, 0.18934991856804118, -0.07049783451948315, 0.15124692985555158, 0.059462487100972794, -0.004305985450628214, -0.04510304757859558, -0.19797956405527656, 0.37864808529993754, 0.019545280234888197, 0.24551014198223128, -0.008690894697792828, 0.18352647632127628, -0.02856188667647075, -0.0360518499976024, 0.03283708657254465, -0.22223206247435884, 0.09738172866636888, 0.18858330840012058, 0.03918707772099879, 0.29046987952897324, -0.43077097125351427, -0.21606265623122453, 0.12781258463510312, 0.09992095917696134, 0.0827860385295935, -0.032009826730063654, -0.353470617273706, 0.09365444649884011, -0.14269844641676172, -0.196605682693189, -0.1156740937347422, -0.014564017939846963, 0.09852882470295299, -0.2764761350350454, 0.09428369952365756, 0.16085325940703116, 0.05864998497236229, -0.13279990530572833, -0.022021054434299005, 0.030523530574282632, 0.049077608389779925, 0.08730687781317101, -0.025740842244704253, 0.06841111208777875, -0.12689550484064965, -0.10807405214291066, 0.34417684758082034, -0.15037086861848364, -0.28400274384766816, 0.18132435821462423, -0.14632149367243982, -0.09660526950319763, 0.1307397193275392, 0.1517048274166882, 0.14722127065369933, -0.16001168598886578, 0.14035613268351882, -0.04901406051358208, 0.11957788812833314, 0.05970564855961129, -0.046908103748137364, 0.12196251461282373, 0.14692985996371136, 0.13514730164315553, 0.1841913267504424, 0.01569634458846849, -0.1640486032316403, -0.3099832095904276, -0.1626114532002248, -0.1629256399406586, 0.10018614435975906, -0.14980472573915904, -0.208621557544393, 0.34654001959133895, 0.11288681232763338, 0.14846046376042069, 0.14250041067316488, 0.2232264631660655, 0.16712536602353795, -0.06790641799889272, 0.0989803168969047, 0.1715996404425823, 0.18686522867646999, 0.11589270016702358, -0.2272923057898879, 0.07058987771670218, 0.20836016740649937] |
1,802.04001 | Red Giant evolution in Modified Gravity | In this paper, we study the chameleon profile in inhomogeneous density
distributions and find that the fifth force in thin shell near the surface is
weaker from what expected in homogeneous density distributions. Also, we check
the validity of quasi-static approximation for the chameleon scalar field in
the astrophysical time scales. We have investigated the rolling down behaviour
of the scalar field on its effective potential inside a one solar mass red
giant star by using MESA code. We have found that the scalar field is fast
enough to follow the minimum of the potential. This adiabatic behaviour reduces
the fifth force and extends the screened regions to lower densities where the
field has smaller mass and was expected to be unscreened. As a consequence, the
star evolution is similar to what expected from standard general relativity. In
addition, considering the stability of star, an approximate constraint on the
coupling constant $\beta$ is found.
| gr-qc astro-ph.CO | in this paper we study the chameleon profile in inhomogeneous density distributions and find that the fifth force in thin shell near the surface is weaker from what expected in homogeneous density distributions also we check the validity of quasistatic approximation for the chameleon scalar field in the astrophysical time scales we have investigated the rolling down behaviour of the scalar field on its effective potential inside a one solar mass red giant star by using mesa code we have found that the scalar field is fast enough to follow the minimum of the potential this adiabatic behaviour reduces the fifth force and extends the screened regions to lower densities where the field has smaller mass and was expected to be unscreened as a consequence the star evolution is similar to what expected from standard general relativity in addition considering the stability of star an approximate constraint on the coupling constant beta is found | [['in', 'this', 'paper', 'we', 'study', 'the', 'chameleon', 'profile', 'in', 'inhomogeneous', 'density', 'distributions', 'and', 'find', 'that', 'the', 'fifth', 'force', 'in', 'thin', 'shell', 'near', 'the', 'surface', 'is', 'weaker', 'from', 'what', 'expected', 'in', 'homogeneous', 'density', 'distributions', 'also', 'we', 'check', 'the', 'validity', 'of', 'quasistatic', 'approximation', 'for', 'the', 'chameleon', 'scalar', 'field', 'in', 'the', 'astrophysical', 'time', 'scales', 'we', 'have', 'investigated', 'the', 'rolling', 'down', 'behaviour', 'of', 'the', 'scalar', 'field', 'on', 'its', 'effective', 'potential', 'inside', 'a', 'one', 'solar', 'mass', 'red', 'giant', 'star', 'by', 'using', 'mesa', 'code', 'we', 'have', 'found', 'that', 'the', 'scalar', 'field', 'is', 'fast', 'enough', 'to', 'follow', 'the', 'minimum', 'of', 'the', 'potential', 'this', 'adiabatic', 'behaviour', 'reduces', 'the', 'fifth', 'force', 'and', 'extends', 'the', 'screened', 'regions', 'to', 'lower', 'densities', 'where', 'the', 'field', 'has', 'smaller', 'mass', 'and', 'was', 'expected', 'to', 'be', 'unscreened', 'as', 'a', 'consequence', 'the', 'star', 'evolution', 'is', 'similar', 'to', 'what', 'expected', 'from', 'standard', 'general', 'relativity', 'in', 'addition', 'considering', 'the', 'stability', 'of', 'star', 'an', 'approximate', 'constraint', 'on', 'the', 'coupling', 'constant', 'beta', 'is', 'found']] | [-0.11571500918528597, 0.1493664027544913, -0.09606536870819286, 0.10985597837020873, -0.07204915640887792, -0.07777971021419802, 0.0002527786396117276, 0.3325389009044663, -0.2073226273422698, -0.33283347482248754, 0.05052899835516348, -0.22062847298848165, -0.10746843956846308, 0.16288949650192222, 0.0007532700690646451, -0.0009966963428139155, -0.017541200448698425, 0.07478314924791649, -0.06772270345646138, -0.22767588273658382, 0.34168357900328716, 0.09998228027207123, 0.22051827442173108, 0.04606674066419689, 0.010336578968767222, -0.03874985384452459, 0.01651735713269997, 0.03852566766443771, -0.1754349931631753, 0.02755589516494762, 0.1402361979073083, 0.07937328815581156, 0.23834620606662196, -0.41986453721856143, -0.2206015000354148, 0.07652833126485348, 0.1509067022042083, 0.10810682679187845, -0.07961900595896092, -0.22478853032452525, 0.08105601894203573, -0.17797797247646496, -0.18628435332763504, 0.0020494655730178605, 0.05372934540818361, 0.03655073455952156, -0.2723334655985871, 0.10484461931476986, 0.01824993710940728, 0.007540790101077843, -0.09316091983981262, -0.08971412711952172, -0.021046929690357926, 0.09371201965924618, 0.09388052034131311, 0.08212402145916524, 0.16008120788527386, -0.16666938814594617, 0.00043153172500987914, 0.40098190554357194, -0.15236086766129697, -0.14094480281913435, 0.17535027064225794, -0.19620049104106602, -0.0965018447869542, 0.13413790332050632, 0.16219020719857669, 0.1348163234292002, -0.15939889358380785, 0.12725075850204273, -0.005152770745955021, 0.14698784884183316, 0.08501466416886874, -0.02115425901818573, 0.2524327126198581, 0.1509625601087842, 0.07061097523282198, 0.12822017081417506, -0.12750059917762682, -0.1174942498131619, -0.28573618925708744, -0.12981117605050277, -0.1696867375428994, 0.059893759343978746, -0.12105139690217359, -0.1599695638469239, 0.3669154108864824, 0.15028338753860201, 0.15116835289707334, 0.04514273165577007, 0.2887196218498148, 0.14036808284105395, 0.11110496084211854, 0.09437088377761667, 0.3477613683835325, 0.17492540373448767, 0.09848174150867234, -0.2589032672702444, 0.023965152548988917, 0.008063094953510475] |
1,802.04002 | Motion of the vitreous humour in a deforming eye -- fluid-structure
interaction between a nonlinear elastic solid and a nonlinear viscoleastic
fluid | We study the motion of vitreous humour in a deforming eyeball. From the
mechanical and computational perspective this is a task to solve a
fluid-structure interaction problem between a complex viscoelastic fluid
(vitreour humour) and a nonlinear elastic solid (sclera and lens). We propose a
numerical methodology capable of handling the fluid-structure interaction
problem, and we demonstrate its applicability via solving the corresponding
governing equations in a realistic geometrical setting and for realistic
parameter values. It is shown that the choice of the rheological model for the
vitreous humour has a negligible influence on the overall flow pattern in the
domain of interest, whilst it is has a significant impact on the mechanical
stress distribution in the domain of interest.
| physics.flu-dyn | we study the motion of vitreous humour in a deforming eyeball from the mechanical and computational perspective this is a task to solve a fluidstructure interaction problem between a complex viscoelastic fluid vitreour humour and a nonlinear elastic solid sclera and lens we propose a numerical methodology capable of handling the fluidstructure interaction problem and we demonstrate its applicability via solving the corresponding governing equations in a realistic geometrical setting and for realistic parameter values it is shown that the choice of the rheological model for the vitreous humour has a negligible influence on the overall flow pattern in the domain of interest whilst it is has a significant impact on the mechanical stress distribution in the domain of interest | [['we', 'study', 'the', 'motion', 'of', 'vitreous', 'humour', 'in', 'a', 'deforming', 'eyeball', 'from', 'the', 'mechanical', 'and', 'computational', 'perspective', 'this', 'is', 'a', 'task', 'to', 'solve', 'a', 'fluidstructure', 'interaction', 'problem', 'between', 'a', 'complex', 'viscoelastic', 'fluid', 'vitreour', 'humour', 'and', 'a', 'nonlinear', 'elastic', 'solid', 'sclera', 'and', 'lens', 'we', 'propose', 'a', 'numerical', 'methodology', 'capable', 'of', 'handling', 'the', 'fluidstructure', 'interaction', 'problem', 'and', 'we', 'demonstrate', 'its', 'applicability', 'via', 'solving', 'the', 'corresponding', 'governing', 'equations', 'in', 'a', 'realistic', 'geometrical', 'setting', 'and', 'for', 'realistic', 'parameter', 'values', 'it', 'is', 'shown', 'that', 'the', 'choice', 'of', 'the', 'rheological', 'model', 'for', 'the', 'vitreous', 'humour', 'has', 'a', 'negligible', 'influence', 'on', 'the', 'overall', 'flow', 'pattern', 'in', 'the', 'domain', 'of', 'interest', 'whilst', 'it', 'is', 'has', 'a', 'significant', 'impact', 'on', 'the', 'mechanical', 'stress', 'distribution', 'in', 'the', 'domain', 'of', 'interest']] | [-0.11123496980872005, 0.05858243576411408, -0.10200641266688579, -0.0028173342746283326, -0.10949249033025708, -0.09083622653319054, -0.005827723571858486, 0.3537699708777691, -0.28314980170533, -0.2805463228953861, 0.08410835940930836, -0.24378818439460603, -0.2144382209399668, 0.20733113759666869, -0.06445957429926186, 0.10859150539150857, 0.07613957460828814, -0.0014362754691548709, -0.03811114373961229, -0.12915209077783868, 0.3002849910564783, 0.012369657060554047, 0.30954267257754103, 0.08101085132034887, 0.16302973579051866, 0.026594788250865555, 0.015204425998024266, 0.06844521299427171, -0.1499307402275711, 0.11902147718165226, 0.22759370165074855, 0.05968456754085271, 0.32039395428630485, -0.4151519497214746, -0.26885549848539236, 0.07141106194393913, 0.1011956113179316, 0.13221160784175917, -0.05460457006780462, -0.25912329642994314, 0.04597538992559083, -0.17092931429472039, -0.09851144764087155, -0.062451780155426316, 0.04744748919106582, -0.0130398720131107, -0.25146690699733604, 0.09015252107770003, 0.05018358926500092, 0.05755154592055483, -0.11892934640411663, -0.04624236039152103, 0.012766179517146294, 0.11074056998756127, 0.04825411466862067, -0.005409929942449226, 0.14505813602639847, -0.20293021294241378, -0.022534912291663784, 0.4669919558996413, 0.0009853302994195152, -0.2952016425874679, 0.20074002189999995, -0.0772284959098559, -0.07683081663910206, 0.14054759490076735, 0.22022950009075032, 0.11206719587056138, -0.1589561979982908, 0.08769931672913797, -0.04607472584060464, 0.16799539158574672, 0.03134367672116065, -0.06835515286084734, 0.16974718643141082, 0.27908594252056435, 0.021107412092074628, 0.18081869984812596, -0.06051900064447472, -0.1225367789352391, -0.2645936118783194, -0.14744267624435053, -0.17122541785244086, 0.016653297230319566, -0.1137536790043638, -0.15612862320267595, 0.4049823402481921, 0.1424110946910722, 0.15749821797827213, 0.01613924473117129, 0.29415669464388816, 0.06294198702832982, 0.03016335952551566, 0.014948378701766702, 0.2731223413094628, 0.11571144937936749, 0.13382461264009485, -0.28581381097882047, 0.09633287816003215, 0.038385646308169645] |
1,802.04003 | Nuclear magnetic shielding constants of Dirac one-electron atoms in some
low-lying discrete energy eigenstates | We present tabulated data for the nuclear magnetic shielding constants
($\sigma$) of the Dirac one-electron atoms with a pointlike, motionless and
spinless nucleus of charge $Ze$. Utilizing the exact general analytical formula
for $\sigma$ derived by us \mbox{[P. Stefa{\'n}ska, Phys. Rev. A. 94 (2016)
012508/1-15],} valid for an arbitrary discrete energy eigenstate, we have
computed the numerical values of the magnetic shielding factors for the ground
state and for the first and the second set of excited states, i.e.: 2s$_{1/2}$,
2p$_{1/2}$, 2p$_{3/2}$, 3s$_{1/2}$, 3p$_{1/2}$, 3p$_{3/2}$, 3d$_{3/2}$, and
3d$_{5/2}$, of the relativistic hydrogenic ions with the nuclear charge numbers
from the range $1 \leqslant Z \leqslant 137$. The comparisons of our results
with the numerical values reported by other authors for some atomic states are
also presented.
| physics.atom-ph physics.chem-ph | we present tabulated data for the nuclear magnetic shielding constants sigma of the dirac oneelectron atoms with a pointlike motionless and spinless nucleus of charge ze utilizing the exact general analytical formula for sigma derived by us mboxp stefanska phys rev a 94 2016 012508115 valid for an arbitrary discrete energy eigenstate we have computed the numerical values of the magnetic shielding factors for the ground state and for the first and the second set of excited states ie 2s_12 2p_12 2p_32 3s_12 3p_12 3p_32 3d_32 and 3d_52 of the relativistic hydrogenic ions with the nuclear charge numbers from the range 1 leqslant z leqslant 137 the comparisons of our results with the numerical values reported by other authors for some atomic states are also presented | [['we', 'present', 'tabulated', 'data', 'for', 'the', 'nuclear', 'magnetic', 'shielding', 'constants', 'sigma', 'of', 'the', 'dirac', 'oneelectron', 'atoms', 'with', 'a', 'pointlike', 'motionless', 'and', 'spinless', 'nucleus', 'of', 'charge', 'ze', 'utilizing', 'the', 'exact', 'general', 'analytical', 'formula', 'for', 'sigma', 'derived', 'by', 'us', 'mboxp', 'stefanska', 'phys', 'rev', 'a', '94', '2016', '012508115', 'valid', 'for', 'an', 'arbitrary', 'discrete', 'energy', 'eigenstate', 'we', 'have', 'computed', 'the', 'numerical', 'values', 'of', 'the', 'magnetic', 'shielding', 'factors', 'for', 'the', 'ground', 'state', 'and', 'for', 'the', 'first', 'and', 'the', 'second', 'set', 'of', 'excited', 'states', 'ie', '2s_12', '2p_12', '2p_32', '3s_12', '3p_12', '3p_32', '3d_32', 'and', '3d_52', 'of', 'the', 'relativistic', 'hydrogenic', 'ions', 'with', 'the', 'nuclear', 'charge', 'numbers', 'from', 'the', 'range', '1', 'leqslant', 'z', 'leqslant', '137', 'the', 'comparisons', 'of', 'our', 'results', 'with', 'the', 'numerical', 'values', 'reported', 'by', 'other', 'authors', 'for', 'some', 'atomic', 'states', 'are', 'also', 'presented']] | [-0.07042149892635644, 0.19060590563819277, 0.04209850611910224, 0.03903560415841639, 0.052738168958574534, -0.12114792273193598, 0.08753656673803925, 0.3234039170295, -0.11659091211855412, -0.303928877168335, -0.03231179152056575, -0.3339044233188033, 0.01746333647146821, 0.16418107629567386, 0.07810394366178662, 0.051874187028268355, 0.006709405355155468, 0.01870356738567352, -0.09520852509140969, -0.15289385407418013, 0.2801187638789415, 0.057035786136984824, 0.19807768646627666, 0.08411645985866198, 0.07005295279901474, 0.016110481830080972, 0.050235525719821456, -0.050052330181002615, -0.1787476383447647, 0.0995269442005083, 0.2391462297216058, 0.04134141828911379, 0.18159025537222623, -0.42318900126218795, -0.14430371690355243, 0.0493526033051312, 0.10392029836960137, 0.14740357557777314, -0.05853790837898851, -0.3777921138480306, 0.04191173258144409, -0.2154344259882346, -0.1612235784083605, -0.11480238431505858, 0.08468366130627691, 0.047870291349012405, -0.3118453330546618, 0.12514439583173953, 0.0030834379447624086, 0.05815497441589832, -0.15150870339944958, -0.23918548302259296, -0.04278703297302127, 0.06253863675706088, -0.006531832432141528, 0.051767500983551144, 0.1222468487471342, -0.06594984235614539, -0.09700852172123269, 0.3605136880204082, -0.03746059831231832, -0.15246801702678203, 0.13270684877224267, -0.17745322580635547, -0.12727125399187209, 0.1800864706762368, 0.06109931004047394, 0.13540371309965848, -0.10013541987538338, 0.12444586577359587, -0.07823368144780397, 0.1706652969736606, 0.07378813860192895, 0.04508736443379894, 0.12610690135881306, 0.06379429512098432, -0.04674001925624907, 0.0834355534412898, -0.14901853836048395, -0.05105830378271639, -0.3178670234978199, -0.16671038979571312, -0.20072207917273044, 0.07252136421948671, -0.024729285433422774, -0.09751529486849904, 0.3639624205902219, 0.06575532801449299, 0.15482377015799284, -0.012091996658593417, 0.21854212771356105, 0.12580908318248113, -0.03045846140757203, 0.09602545799594372, 0.26210257699829526, 0.20804077760130166, 0.0595166019462049, -0.2850022355320398, -0.03588027388229966, 0.07544693821668624] |
1,802.04004 | Correlation of ICME Magnetic Fields at Radially Aligned Spacecraft | The B-field structures of two ICMEs each observed by a pair of spacecraft
close to radial alignment have been analysed. The ICMEs were observed in situ
by MESSENGER and STEREO-B in Nov. 2010 and Nov. 2011, while the spacecraft were
separated by more than 0.6 AU in heliocentric distance, less than 4{\deg} in
heliographic longitude, and less than 7{\deg} in heliographic latitude. Both
ICMEs took around 2 days to travel between the spacecraft. The ICME B-field
profiles observed by MESSENGER have been mapped to the heliocentric distance of
STEREO-B and compared directly to the profiles observed by STEREO-B. Figures
that result from this mapping allow for easy qualitative assessment of
similarity in the profiles. Macroscale features in the profiles that varied on
timescales of 1 hour, and which corresponded to the underlying flux rope
structure of the ICMEs, were well correlated in the solar east-west and
north-south directions, with Pearson's correlation coefficients of around 0.85
and 0.95, respectively; microscale features with timescales of 1 minute were
uncorrelated. Overall correlation values in the profiles of one ICME were
increased when an apparent change in the flux rope axis direction between the
observing spacecraft was taken into account. The high degree of similarity seen
in the B-field profiles may be interpreted in in two ways. If the spacecraft
sampled the same region of each ICME (i.e. if the spacecraft angular
separations can be neglected), the similarity indicates that there was little
evolution in the underlying structure of the sampled region during propagation.
Alternatively, if the spacecraft observed different, nearby regions within the
ICMEs, it indicates that there was spatial homogeneity across those different
regions. The field structure similarity observed in these ICMEs points to the
value of placing in situ space weather monitors well upstream of the Earth.
| physics.space-ph | the bfield structures of two icmes each observed by a pair of spacecraft close to radial alignment have been analysed the icmes were observed in situ by messenger and stereob in nov 2010 and nov 2011 while the spacecraft were separated by more than 06 au in heliocentric distance less than 4deg in heliographic longitude and less than 7deg in heliographic latitude both icmes took around 2 days to travel between the spacecraft the icme bfield profiles observed by messenger have been mapped to the heliocentric distance of stereob and compared directly to the profiles observed by stereob figures that result from this mapping allow for easy qualitative assessment of similarity in the profiles macroscale features in the profiles that varied on timescales of 1 hour and which corresponded to the underlying flux rope structure of the icmes were well correlated in the solar eastwest and northsouth directions with pearsons correlation coefficients of around 085 and 095 respectively microscale features with timescales of 1 minute were uncorrelated overall correlation values in the profiles of one icme were increased when an apparent change in the flux rope axis direction between the observing spacecraft was taken into account the high degree of similarity seen in the bfield profiles may be interpreted in in two ways if the spacecraft sampled the same region of each icme ie if the spacecraft angular separations can be neglected the similarity indicates that there was little evolution in the underlying structure of the sampled region during propagation alternatively if the spacecraft observed different nearby regions within the icmes it indicates that there was spatial homogeneity across those different regions the field structure similarity observed in these icmes points to the value of placing in situ space weather monitors well upstream of the earth | [['the', 'bfield', 'structures', 'of', 'two', 'icmes', 'each', 'observed', 'by', 'a', 'pair', 'of', 'spacecraft', 'close', 'to', 'radial', 'alignment', 'have', 'been', 'analysed', 'the', 'icmes', 'were', 'observed', 'in', 'situ', 'by', 'messenger', 'and', 'stereob', 'in', 'nov', '2010', 'and', 'nov', '2011', 'while', 'the', 'spacecraft', 'were', 'separated', 'by', 'more', 'than', '06', 'au', 'in', 'heliocentric', 'distance', 'less', 'than', '4deg', 'in', 'heliographic', 'longitude', 'and', 'less', 'than', '7deg', 'in', 'heliographic', 'latitude', 'both', 'icmes', 'took', 'around', '2', 'days', 'to', 'travel', 'between', 'the', 'spacecraft', 'the', 'icme', 'bfield', 'profiles', 'observed', 'by', 'messenger', 'have', 'been', 'mapped', 'to', 'the', 'heliocentric', 'distance', 'of', 'stereob', 'and', 'compared', 'directly', 'to', 'the', 'profiles', 'observed', 'by', 'stereob', 'figures', 'that', 'result', 'from', 'this', 'mapping', 'allow', 'for', 'easy', 'qualitative', 'assessment', 'of', 'similarity', 'in', 'the', 'profiles', 'macroscale', 'features', 'in', 'the', 'profiles', 'that', 'varied', 'on', 'timescales', 'of', '1', 'hour', 'and', 'which', 'corresponded', 'to', 'the', 'underlying', 'flux', 'rope', 'structure', 'of', 'the', 'icmes', 'were', 'well', 'correlated', 'in', 'the', 'solar', 'eastwest', 'and', 'northsouth', 'directions', 'with', 'pearsons', 'correlation', 'coefficients', 'of', 'around', '085', 'and', '095', 'respectively', 'microscale', 'features', 'with', 'timescales', 'of', '1', 'minute', 'were', 'uncorrelated', 'overall', 'correlation', 'values', 'in', 'the', 'profiles', 'of', 'one', 'icme', 'were', 'increased', 'when', 'an', 'apparent', 'change', 'in', 'the', 'flux', 'rope', 'axis', 'direction', 'between', 'the', 'observing', 'spacecraft', 'was', 'taken', 'into', 'account', 'the', 'high', 'degree', 'of', 'similarity', 'seen', 'in', 'the', 'bfield', 'profiles', 'may', 'be', 'interpreted', 'in', 'in', 'two', 'ways', 'if', 'the', 'spacecraft', 'sampled', 'the', 'same', 'region', 'of', 'each', 'icme', 'ie', 'if', 'the', 'spacecraft', 'angular', 'separations', 'can', 'be', 'neglected', 'the', 'similarity', 'indicates', 'that', 'there', 'was', 'little', 'evolution', 'in', 'the', 'underlying', 'structure', 'of', 'the', 'sampled', 'region', 'during', 'propagation', 'alternatively', 'if', 'the', 'spacecraft', 'observed', 'different', 'nearby', 'regions', 'within', 'the', 'icmes', 'it', 'indicates', 'that', 'there', 'was', 'spatial', 'homogeneity', 'across', 'those', 'different', 'regions', 'the', 'field', 'structure', 'similarity', 'observed', 'in', 'these', 'icmes', 'points', 'to', 'the', 'value', 'of', 'placing', 'in', 'situ', 'space', 'weather', 'monitors', 'well', 'upstream', 'of', 'the', 'earth']] | [-0.11857002761216545, 0.18921304579453135, -0.05669072869932279, 0.09138907673194488, -0.029535332601045485, -0.07141812719527406, 0.007929586114678878, 0.45768392440938466, -0.22858655813301132, -0.42079118130149673, 0.04382626128043174, -0.27519660486644637, -0.07505634190464341, 0.17895601706599384, -0.039590997249163325, -0.007371877039445649, 0.08210424684157998, -0.005311955234532975, -0.08503936226062817, -0.20166222226721034, 0.21128133660405748, 0.10396164221035449, 0.20244093193685184, -0.018653367273981456, 0.08746675077772297, -0.06818943567422803, -0.035557344958588886, 0.04289769850082529, -0.10525736534966838, 0.05141523873631691, 0.19466461028079377, 0.11472970059470311, 0.2067181411587847, -0.4434757159292899, -0.21344262284332513, 0.01691363739066858, 0.14908784784288523, -0.035680517866166085, 0.030647804071909254, -0.32307830063399634, 0.05447869426869737, -0.10867597877699449, -0.1304137177334318, 0.07745622398569312, 0.09585621189192328, 0.032600619745436064, -0.21271580705600884, 0.1250270968570525, -0.026333919057317356, 0.16072731019193195, -0.11732454287482903, -0.10394662981727035, -0.10214099484004986, 0.16676021023660134, 0.13847397855558508, 0.09025987339004674, 0.16602413155015786, -0.04819398277322762, -0.06384734692236069, 0.36421167704208307, -0.029091835919029405, -0.08941744410863926, 0.17634468463625494, -0.2766949507124475, -0.11926294301284125, 0.18204393913274053, 0.13649041591702984, 0.06019322536451147, -0.13619087786596415, -0.02723843892355846, -0.021660338365158217, 0.1805810094669436, 0.17003310317050893, -0.04330087267177028, 0.2531083791038474, 0.05568826434790861, 0.054815323884139545, 0.08020664188665545, -0.2558903181398401, -0.08435220293137496, -0.2268704987411085, -0.11327452602125886, -0.1141595978675665, -0.004748242652370922, -0.1482031584424427, -0.08080079866704182, 0.41152727309885007, 0.16448952230613842, 0.25255896546091333, -0.05542346903422259, 0.2602714177054303, 0.049390430463481114, 0.11165282924304011, 0.13680804787027473, 0.3377713056759456, 0.09590643152871446, 0.16878054922563024, -0.16437232429047613, 0.13867377602838207, 0.03266961818460275] |
1,802.04005 | Merits of the Incremental Method for modeling Piecewise Linear functions | Several techniques were proposed to model the Piecewise linear (PWL)
functions, including convex combination, incremental and multiple choice
methods. Although the incremental method was proved to be very efficient, the
attention of the authors in this field was drawn to the convex combination
method, especially for discontinuous PWL functions. In this work, we modify the
incremental method to make it suitable for discontinuous functions. The
numerical results indicate that the modified incremental method could have
considerable reduction in computational time, mainly due to the reduction in
the number of the required variables. Further, we propose a tighter formulation
for optimization problems over separable univariate PWL functions with binary
indicators by using the incremental method.
| math.OC | several techniques were proposed to model the piecewise linear pwl functions including convex combination incremental and multiple choice methods although the incremental method was proved to be very efficient the attention of the authors in this field was drawn to the convex combination method especially for discontinuous pwl functions in this work we modify the incremental method to make it suitable for discontinuous functions the numerical results indicate that the modified incremental method could have considerable reduction in computational time mainly due to the reduction in the number of the required variables further we propose a tighter formulation for optimization problems over separable univariate pwl functions with binary indicators by using the incremental method | [['several', 'techniques', 'were', 'proposed', 'to', 'model', 'the', 'piecewise', 'linear', 'pwl', 'functions', 'including', 'convex', 'combination', 'incremental', 'and', 'multiple', 'choice', 'methods', 'although', 'the', 'incremental', 'method', 'was', 'proved', 'to', 'be', 'very', 'efficient', 'the', 'attention', 'of', 'the', 'authors', 'in', 'this', 'field', 'was', 'drawn', 'to', 'the', 'convex', 'combination', 'method', 'especially', 'for', 'discontinuous', 'pwl', 'functions', 'in', 'this', 'work', 'we', 'modify', 'the', 'incremental', 'method', 'to', 'make', 'it', 'suitable', 'for', 'discontinuous', 'functions', 'the', 'numerical', 'results', 'indicate', 'that', 'the', 'modified', 'incremental', 'method', 'could', 'have', 'considerable', 'reduction', 'in', 'computational', 'time', 'mainly', 'due', 'to', 'the', 'reduction', 'in', 'the', 'number', 'of', 'the', 'required', 'variables', 'further', 'we', 'propose', 'a', 'tighter', 'formulation', 'for', 'optimization', 'problems', 'over', 'separable', 'univariate', 'pwl', 'functions', 'with', 'binary', 'indicators', 'by', 'using', 'the', 'incremental', 'method']] | [-0.05003548701183478, 0.0016194493305591638, -0.1212443061450725, 0.04091465330004627, -0.09654001546247552, -0.14810069581379362, 0.05481174179320142, 0.42613605797094734, -0.30779785030161994, -0.27720035408345756, 0.10885732426009909, -0.19572451967223173, -0.2091966660595254, 0.23529536693495812, -0.10229976954788231, 0.14301287869743087, 0.07797085970799487, -0.04416229137119412, -0.12338220376701078, -0.309487835746136, 0.2827825067123692, 0.03861352673061846, 0.27199167512324557, 0.02892884091278048, 0.10812254330110654, 0.016969002280874473, -0.08897953811755176, 0.06662501198578659, -0.07550702858012907, 0.1553132334997747, 0.3000644611321357, 0.1579229380004108, 0.35648228230134565, -0.41796616510602463, -0.23509347086706966, 0.12119023172438079, 0.10294330755469243, 0.12551112046563312, -0.036940138276437655, -0.22856401804560927, 0.09945166428785837, -0.1789536281619548, -0.08149143977916856, -0.129031605438509, -0.031012911354034594, 0.052655824157817846, -0.3098728705581539, 0.060406144283581195, 0.053718559337747204, 0.03591038984360925, -0.08794026216492057, -0.14985369877040125, 0.03517628009349369, 0.024272985854431203, 0.053442637827206534, 0.06969873546908625, 0.07090116283660264, -0.06599128399179072, -0.11507339004157602, 0.3348690884865886, -0.06263848751162489, -0.27180046732578295, 0.20862209883502178, -0.0672338549088556, -0.17279830314586625, 0.14992774728064737, 0.22826012501721843, 0.1714281603742979, -0.13905645200263775, 0.07931210611193244, -0.014261542978234948, 0.1376211738148541, 0.03758509887643812, -0.040686966463302575, 0.09234427544492575, 0.1377058640518634, 0.09673098716966547, 0.17395396614059186, -0.04070164032051699, -0.10308627787519965, -0.23221453548492782, -0.11248479951826627, -0.1962807893083153, -0.07487395607964381, -0.13485034870526552, -0.18703026747282006, 0.393225399082886, 0.14683947342513293, 0.14976506982521529, 0.08193030271254349, 0.3125311717750472, 0.15600500676552193, 0.10127214246772621, 0.06852840825000353, 0.2274504458223339, 0.09713667830893476, 0.11012218264646403, -0.2171499233012774, 0.10423608333395239, 0.12556122419048557] |
1,802.04006 | On the mu and lambda invariants of the logarithmic class group | Let $\ell$ be a rational prime number. Assuming the Gross-Kuz'min conjecture
along a $\Zl$-extension $K\_{\infty}$ of a number field $K$, we show that there
exist integers $\mut$, $\lat$ and $\widetilde{\nu}$ such that the exponent
$\tilde{e}\_{n}$ of the order $\ell^{\tilde{e}\_{n}}$ of the logarithmic class
group $\Clog{n}$ for the $n$-th layer $K\_{n}$ of $K\_{\infty}$ is given by
$\tilde{e}\_{n}=\widetilde{\mu}\ell^{n}+\widetilde{\lambda} n +
\widetilde{\nu}$, for $n$ big enough. We show some relations between the
classical invariants $\mu$ and $\lambda$, and their logarithmic counterparts
$\mut$ and $\lat$ for some class of $\Zl$-extensions. Additionally, we provide
numerical examples for the cyclotomic and the non-cyclotomic case.
| math.NT | let ell be a rational prime number assuming the grosskuzmin conjecture along a zlextension k_infty of a number field k we show that there exist integers mut lat and widetildenu such that the exponent tildee_n of the order elltildee_n of the logarithmic class group clogn for the nth layer k_n of k_infty is given by tildee_nwidetildemuellnwidetildelambda n widetildenu for n big enough we show some relations between the classical invariants mu and lambda and their logarithmic counterparts mut and lat for some class of zlextensions additionally we provide numerical examples for the cyclotomic and the noncyclotomic case | [['let', 'ell', 'be', 'a', 'rational', 'prime', 'number', 'assuming', 'the', 'grosskuzmin', 'conjecture', 'along', 'a', 'zlextension', 'k_infty', 'of', 'a', 'number', 'field', 'k', 'we', 'show', 'that', 'there', 'exist', 'integers', 'mut', 'lat', 'and', 'widetildenu', 'such', 'that', 'the', 'exponent', 'tildee_n', 'of', 'the', 'order', 'elltildee_n', 'of', 'the', 'logarithmic', 'class', 'group', 'clogn', 'for', 'the', 'nth', 'layer', 'k_n', 'of', 'k_infty', 'is', 'given', 'by', 'tildee_nwidetildemuellnwidetildelambda', 'n', 'widetildenu', 'for', 'n', 'big', 'enough', 'we', 'show', 'some', 'relations', 'between', 'the', 'classical', 'invariants', 'mu', 'and', 'lambda', 'and', 'their', 'logarithmic', 'counterparts', 'mut', 'and', 'lat', 'for', 'some', 'class', 'of', 'zlextensions', 'additionally', 'we', 'provide', 'numerical', 'examples', 'for', 'the', 'cyclotomic', 'and', 'the', 'noncyclotomic', 'case']] | [-0.21243278173294486, 0.1331112901174018, -0.046803327181133565, 0.06776438897055492, -0.05616961759780837, -0.1486658156576121, 0.05615486381335042, 0.3113013846779485, -0.28498371951686946, -0.2765562875277322, 0.041103945940014215, -0.3195252142740292, -0.12615762210106882, 0.23793686966857183, 0.0007928919259701734, 0.028837332119861538, -0.00669509862833049, 0.11825248946052339, -0.016905849040283458, -0.3104446888698832, 0.3200085173935488, -0.04605829397864316, 0.1370132309080952, 0.059476847228918064, 0.06309320101306935, -0.008863399940310046, 0.02629819677879467, 0.035023016235082534, -0.19764643791716915, 0.08831215835158693, 0.2600831792730352, 0.09220976950904436, 0.25177306968354335, -0.3294254281234158, -0.14254087572360574, 0.24871797456770486, 0.13795295884356956, -0.01589279785833281, -0.03689109007625476, -0.23478242205506514, 0.18913803402962082, -0.17363196449435275, -0.17967443919801357, -0.08681125072357447, 0.10248528977314456, 0.04751604458104576, -0.31387662652717985, 0.009733980400082857, 0.07494418567006031, 0.1135165930988834, -0.014714476293074373, -0.16158311021433253, 0.0030256542680866046, 0.0825833773959185, 0.04261461055948925, 0.05657223940057599, 0.030192279636495463, -0.13629256477377014, -0.08281469468594245, 0.35941634157105634, -0.05067976266171014, -0.15058768322974767, 0.07670037929252115, -0.21197553811868167, -0.16765411611160505, 0.12025174659514881, 0.06576235401924983, 0.1289078116659885, 0.024917383217657713, 0.22059027959134572, -0.10756792081140346, 0.15635232408480396, 0.1043746818120227, 0.01767194903779613, 0.1382994349266443, 0.030735545265285866, 0.07125590471854515, 0.13558117162471678, -0.08152624273308269, -0.016747727661150628, -0.3884549020870548, -0.1942665550918521, -0.16298884441620548, 0.13466194948768648, -0.154628673056362, -0.1246809205090951, 0.3342202011920998, 0.07986925396772163, 0.1996298339622824, 0.18055387115632388, 0.18325344905884855, 0.09180029654500844, 0.04385413400292316, 0.0903550071955618, 0.10405079645178099, 0.16686401345372281, -0.005479322270611706, -0.17328793003727458, -0.006990179627040482, 0.1236832424512376] |
1,802.04007 | ProofWatch: Watchlist Guidance for Large Theories in E | Watchlist (also hint list) is a mechanism that allows related proofs to guide
a proof search for a new conjecture. This mechanism has been used with the
Otter and Prover9 theorem provers, both for interactive formalizations and for
human-assisted proving of open conjectures in small theories. In this work we
explore the use of watchlists in large theories coming from first-order
translations of large ITP libraries, aiming at improving hammer-style
automation by smarter internal guidance of the ATP systems. In particular, we
(i) design watchlist-based clause evaluation heuristics inside the E ATP
system, and (ii) develop new proof guiding algorithms that load many previous
proofs inside the ATP and focus the proof search using a dynamically updated
notion of proof matching. The methods are evaluated on a large set of problems
coming from the Mizar library, showing significant improvement of E's standard
portfolio of strategies, and also of the previous best set of strategies
invented for Mizar by evolutionary methods.
| cs.AI cs.LG cs.LO | watchlist also hint list is a mechanism that allows related proofs to guide a proof search for a new conjecture this mechanism has been used with the otter and prover9 theorem provers both for interactive formalizations and for humanassisted proving of open conjectures in small theories in this work we explore the use of watchlists in large theories coming from firstorder translations of large itp libraries aiming at improving hammerstyle automation by smarter internal guidance of the atp systems in particular we i design watchlistbased clause evaluation heuristics inside the e atp system and ii develop new proof guiding algorithms that load many previous proofs inside the atp and focus the proof search using a dynamically updated notion of proof matching the methods are evaluated on a large set of problems coming from the mizar library showing significant improvement of es standard portfolio of strategies and also of the previous best set of strategies invented for mizar by evolutionary methods | [['watchlist', 'also', 'hint', 'list', 'is', 'a', 'mechanism', 'that', 'allows', 'related', 'proofs', 'to', 'guide', 'a', 'proof', 'search', 'for', 'a', 'new', 'conjecture', 'this', 'mechanism', 'has', 'been', 'used', 'with', 'the', 'otter', 'and', 'prover9', 'theorem', 'provers', 'both', 'for', 'interactive', 'formalizations', 'and', 'for', 'humanassisted', 'proving', 'of', 'open', 'conjectures', 'in', 'small', 'theories', 'in', 'this', 'work', 'we', 'explore', 'the', 'use', 'of', 'watchlists', 'in', 'large', 'theories', 'coming', 'from', 'firstorder', 'translations', 'of', 'large', 'itp', 'libraries', 'aiming', 'at', 'improving', 'hammerstyle', 'automation', 'by', 'smarter', 'internal', 'guidance', 'of', 'the', 'atp', 'systems', 'in', 'particular', 'we', 'i', 'design', 'watchlistbased', 'clause', 'evaluation', 'heuristics', 'inside', 'the', 'e', 'atp', 'system', 'and', 'ii', 'develop', 'new', 'proof', 'guiding', 'algorithms', 'that', 'load', 'many', 'previous', 'proofs', 'inside', 'the', 'atp', 'and', 'focus', 'the', 'proof', 'search', 'using', 'a', 'dynamically', 'updated', 'notion', 'of', 'proof', 'matching', 'the', 'methods', 'are', 'evaluated', 'on', 'a', 'large', 'set', 'of', 'problems', 'coming', 'from', 'the', 'mizar', 'library', 'showing', 'significant', 'improvement', 'of', 'es', 'standard', 'portfolio', 'of', 'strategies', 'and', 'also', 'of', 'the', 'previous', 'best', 'set', 'of', 'strategies', 'invented', 'for', 'mizar', 'by', 'evolutionary', 'methods']] | [-0.06805336816906692, 0.03244020239372922, -0.11181550225314156, 0.08173714066814085, -0.10882367941129739, -0.18585574544616235, 0.12908859339477435, 0.32104704892084857, -0.24590771170451667, -0.3473916458037154, 0.09937534830310518, -0.22206352522997497, -0.11321198650499344, 0.25053728471219444, -0.10941472305222207, 0.05814677070096657, 0.09489503699787863, -0.029742354558258775, -0.0006530880483140232, -0.24971574789304643, 0.3005765562218608, 0.027116111583509454, 0.2617305844761194, 0.09836860466155277, 0.06799274435634636, 0.020702887042484894, -0.08954927015005593, -0.012465184005748505, -0.13212296789985487, 0.1934459551584545, 0.2722056940610218, 0.23625580032332355, 0.32943843415149365, -0.4122054740478089, -0.12388022917850762, 0.08189541202892733, 0.12876771364643189, 0.15625903536535943, -0.07656807886587848, -0.2790835434096349, 0.09470714663917637, -0.16551901469493557, -0.10488500083043317, -0.09275079448855701, 0.025267422329753066, 0.045863487378836484, -0.2348982701404317, -0.04299464869605093, 0.1297628955357963, 0.12045445274205724, -0.060304203996461504, -0.15891379975805736, 0.036677165599065316, 0.10607852583608715, 0.03954718551883225, 0.04595021934954414, 0.11988924824258988, -0.12153381045765368, -0.21443368152234774, 0.3542732442655025, -0.047844143680765464, -0.14593273140104476, 0.20985804887482554, -0.031615193636648976, -0.2078022172357175, 0.08566984943570985, 0.1840018294751644, 0.15104249852062884, -0.1465101301919218, 0.10042529315709961, -0.04529112475537873, 0.17910597071119816, 0.08514911248304163, 0.0023335992294856033, 0.18275072660510708, 0.18391211747761319, 0.06588630501001444, 0.11769714398950243, 0.03124224928587343, -0.10728880982537559, -0.30035065312923237, -0.17445458865770477, -0.11379242144157267, -0.015434806516904171, -0.07279502613138879, -0.14545381189602766, 0.3483970543950986, 0.17344105859126918, 0.11027072019026775, 0.1063614071249127, 0.29855037867061934, 0.065385663423837, 0.08918634363580613, 0.06563610173346605, 0.19008246775876708, 0.07615219730183861, 0.13656272823109653, -0.15662217866718342, 0.08195701514086745, 0.12421105297246746] |
1,802.04008 | Decay of local energy for solutions of the free Schr\"odinger equation
in exterior domains | In this article, we study the decay of the solutions of Schr\"odinger
equations in the exterior of an obstacle. The main situations we are interested
in are the general case (no non-trapping assumptions) or some weakly trapping
situations
| math.AP math-ph math.MP | in this article we study the decay of the solutions of schrodinger equations in the exterior of an obstacle the main situations we are interested in are the general case no nontrapping assumptions or some weakly trapping situations | [['in', 'this', 'article', 'we', 'study', 'the', 'decay', 'of', 'the', 'solutions', 'of', 'schrodinger', 'equations', 'in', 'the', 'exterior', 'of', 'an', 'obstacle', 'the', 'main', 'situations', 'we', 'are', 'interested', 'in', 'are', 'the', 'general', 'case', 'no', 'nontrapping', 'assumptions', 'or', 'some', 'weakly', 'trapping', 'situations']] | [-0.16959198667226652, 0.08500237190999446, -0.02770588574563398, 0.09433407288375556, -0.05697624306929739, -0.09412787070399836, -0.07525425365096644, 0.3430040708105815, -0.23395140939637235, -0.17862285629503036, 0.16043080358557696, -0.3248253697529435, -0.157863141852431, 0.19069580522390375, -0.10662320996389578, 0.061673857908892, 0.07901038675519981, 0.08219066056373872, -0.04375550417094737, -0.23699736240240254, 0.4362663450087176, -0.06152465909498891, 0.18687148688753186, 0.05490919988063213, -0.007840204371237442, -0.024598170542862806, 0.01514171556520619, -0.024686446119295925, -0.22692217035709242, 0.11222934727802088, 0.2280995834520773, 0.07676272643239875, 0.31824133231451635, -0.4876830566086267, -0.20358514030905148, 0.17428947748665355, 0.1540839781641568, 0.1547538769970599, -0.08582528086538475, -0.2930555978581603, 0.04766034859379655, -0.07866621958582025, -0.23687706915906778, -0.004974233991417445, 0.01282872112565919, 0.08101430167076423, -0.260454846300969, 0.08270864012209993, 0.13882641124195957, 0.024751405966909307, -0.14137953233071848, -0.0484134431064472, 0.09822948007403236, 0.07577320709702019, 0.11329515557123446, -0.07267952168139775, 0.057588337136334496, -0.1806136897556778, -0.06120530099264885, 0.41688255289275394, -0.039569851844326445, -0.3155034722662286, 0.2063099628216342, -0.19612809855147803, -0.12758401122042223, 0.07087935151924428, 0.17812952500964074, 0.2360102438711022, -0.18105910943919107, 0.17564907089169873, -0.06074042343779614, 0.09325755865460164, 0.11428734194487333, 0.009478300091455151, 0.1081504188477993, 0.12713017782784605, 0.1233888256277791, 0.1360845457713463, 0.001621744007264313, -0.12285626031409361, -0.4279269729005663, -0.14785407968845807, -0.11371950981648345, 0.056551337242126465, -0.06119586546954356, -0.1647131372439234, 0.3603846596455888, 0.14854207906970068, 0.1567673324362228, 0.0022391075464455704, 0.27304758249144806, 0.18205978191384165, -0.06037447018254744, 0.09374153511108536, 0.24979723278374877, 0.12104766708063452, 0.11279664008486036, -0.1798992351334738, 0.021542466478422284, 0.01975375440241279] |
1,802.04009 | Distinguishing Question Subjectivity from Difficulty for Improved
Crowdsourcing | The questions in a crowdsourcing task typically exhibit varying degrees of
difficulty and subjectivity. Their joint effects give rise to the variation in
responses to the same question by different crowd-workers. This variation is
low when the question is easy to answer and objective, and high when it is
difficult and subjective. Unfortunately, current quality control methods for
crowdsourcing consider only the question difficulty to account for the
variation. As a result,these methods cannot distinguish workers personal
preferences for different correct answers of a partially subjective question
from their ability/expertise to avoid objectively wrong answers for that
question. To address this issue, we present a probabilistic model which (i)
explicitly encodes question difficulty as a model parameter and (ii) implicitly
encodes question subjectivity via latent preference factors for crowd-workers.
We show that question subjectivity induces grouping of crowd-workers, revealed
through clustering of their latent preferences. Moreover, we develop a
quantitative measure of the subjectivity of a question. Experiments show that
our model(1) improves the performance of both quality control for crowd-sourced
answers and next answer prediction for crowd-workers,and (2) can potentially
provide coherent rankings of questions in terms of their difficulty and
subjectivity, so that task providers can refine their designs of the
crowdsourcing tasks, e.g. by removing highly subjective questions or
inappropriately difficult questions.
| cs.AI | the questions in a crowdsourcing task typically exhibit varying degrees of difficulty and subjectivity their joint effects give rise to the variation in responses to the same question by different crowdworkers this variation is low when the question is easy to answer and objective and high when it is difficult and subjective unfortunately current quality control methods for crowdsourcing consider only the question difficulty to account for the variation as a resultthese methods cannot distinguish workers personal preferences for different correct answers of a partially subjective question from their abilityexpertise to avoid objectively wrong answers for that question to address this issue we present a probabilistic model which i explicitly encodes question difficulty as a model parameter and ii implicitly encodes question subjectivity via latent preference factors for crowdworkers we show that question subjectivity induces grouping of crowdworkers revealed through clustering of their latent preferences moreover we develop a quantitative measure of the subjectivity of a question experiments show that our model1 improves the performance of both quality control for crowdsourced answers and next answer prediction for crowdworkersand 2 can potentially provide coherent rankings of questions in terms of their difficulty and subjectivity so that task providers can refine their designs of the crowdsourcing tasks eg by removing highly subjective questions or inappropriately difficult questions | [['the', 'questions', 'in', 'a', 'crowdsourcing', 'task', 'typically', 'exhibit', 'varying', 'degrees', 'of', 'difficulty', 'and', 'subjectivity', 'their', 'joint', 'effects', 'give', 'rise', 'to', 'the', 'variation', 'in', 'responses', 'to', 'the', 'same', 'question', 'by', 'different', 'crowdworkers', 'this', 'variation', 'is', 'low', 'when', 'the', 'question', 'is', 'easy', 'to', 'answer', 'and', 'objective', 'and', 'high', 'when', 'it', 'is', 'difficult', 'and', 'subjective', 'unfortunately', 'current', 'quality', 'control', 'methods', 'for', 'crowdsourcing', 'consider', 'only', 'the', 'question', 'difficulty', 'to', 'account', 'for', 'the', 'variation', 'as', 'a', 'resultthese', 'methods', 'can', 'not', 'distinguish', 'workers', 'personal', 'preferences', 'for', 'different', 'correct', 'answers', 'of', 'a', 'partially', 'subjective', 'question', 'from', 'their', 'abilityexpertise', 'to', 'avoid', 'objectively', 'wrong', 'answers', 'for', 'that', 'question', 'to', 'address', 'this', 'issue', 'we', 'present', 'a', 'probabilistic', 'model', 'which', 'i', 'explicitly', 'encodes', 'question', 'difficulty', 'as', 'a', 'model', 'parameter', 'and', 'ii', 'implicitly', 'encodes', 'question', 'subjectivity', 'via', 'latent', 'preference', 'factors', 'for', 'crowdworkers', 'we', 'show', 'that', 'question', 'subjectivity', 'induces', 'grouping', 'of', 'crowdworkers', 'revealed', 'through', 'clustering', 'of', 'their', 'latent', 'preferences', 'moreover', 'we', 'develop', 'a', 'quantitative', 'measure', 'of', 'the', 'subjectivity', 'of', 'a', 'question', 'experiments', 'show', 'that', 'our', 'model1', 'improves', 'the', 'performance', 'of', 'both', 'quality', 'control', 'for', 'crowdsourced', 'answers', 'and', 'next', 'answer', 'prediction', 'for', 'crowdworkersand', '2', 'can', 'potentially', 'provide', 'coherent', 'rankings', 'of', 'questions', 'in', 'terms', 'of', 'their', 'difficulty', 'and', 'subjectivity', 'so', 'that', 'task', 'providers', 'can', 'refine', 'their', 'designs', 'of', 'the', 'crowdsourcing', 'tasks', 'eg', 'by', 'removing', 'highly', 'subjective', 'questions', 'or', 'inappropriately', 'difficult', 'questions']] | [-0.049842710386767124, 0.05006618161921875, -0.05306632597843281, 0.14848012770821248, -0.16851137318219903, -0.16910505280042934, 0.1289937039651414, 0.40708453361679553, -0.31069667553179353, -0.40380672416146934, 0.06374991474456718, -0.27470774562513467, -0.1642094420918434, 0.15150962030939197, -0.19381615991962137, 0.04093502986926953, 0.09443791048872359, 0.020175939557134905, -0.003062785834843564, -0.3321148178861542, 0.3576951446754972, 0.04083737965778146, 0.29864263823999204, 0.11092846012267639, 0.12221397576195586, -0.011388884587847396, -0.08304091732721654, 0.02569396714045898, -0.07351449596547487, 0.15374535252695395, 0.3433484855881879, 0.23013768141144808, 0.39664452718002413, -0.36394417519842936, -0.18467606328856287, 0.07337740127067191, 0.13605226285898012, 0.08945992215538721, -0.0048199735194916875, -0.3104885603987695, 0.08892002335570298, -0.129603980942039, -0.03383102319574972, -0.14156385439110836, 0.014994121134770867, -0.05335206337745341, -0.27839274819231996, 0.0680905400355622, 0.10547165449259435, 0.07651023692641344, -0.05295452931152543, -0.06317335723116645, 0.06045991917766036, 0.23903577205503115, 0.10902066092409636, 0.006729783227955791, 0.1114868727182541, -0.2093073676620116, -0.1772903614415691, 0.41352804207151206, 0.001971871994365829, -0.24833393051669422, 0.16490404332437042, -0.08495563469136334, -0.13970855075457164, 0.06797880863556595, 0.17013132790794394, 0.10168650499304556, -0.14880923838576, 0.023080905032985814, -0.04809990686587465, 0.2018990649813305, 0.070985769467131, 0.005474231223370268, 0.21475379053665053, 0.12863068530301044, 0.04025572346536521, 0.10124461259310322, 0.019751806290898944, -0.014571341943922737, -0.18741976363778973, -0.12172582373350964, -0.13958741293371843, 0.04661533905925861, -0.053136808692301106, -0.15706264749256799, 0.3788344118713528, 0.23404634934784452, 0.25262982678980056, 0.052468063067666694, 0.3037463361922074, 0.043164159625466963, -0.020954872125720368, 0.010721110432198875, 0.13690319867119272, 0.011522453306723789, 0.09156155127467928, -0.20815029907468793, 0.15721800162767371, 0.0073265655954399015] |
1,802.0401 | On the occurrence of thermal non-equilibrium in coronal loops | Long-period EUV pulsations, recently discovered to be common in active
regions, are understood to be the coronal manifestation of thermal
non-equilibrium (TNE). The active regions previously studied with EIT/SOHO and
AIA/SDO indicated that long-period intensity pulsations are localized in only
one or two loop bundles. The basic idea of this study is to understand why. For
this purpose, we tested the response of different loop systems, using different
magnetic configurations, to different stratifications and strengths of the
heating. We present an extensive parameter-space study using 1D hydrodynamic
simulations (1,020 in total) and conclude that the occurrence of TNE requires
specific combinations of parameters. Our study shows that the TNE cycles are
confined to specific ranges in parameter space. This naturally explains why
only some loops undergo constant periodic pulsations over several days: since
the loop geometry and the heating properties generally vary from one loop to
another in an active region, only the ones in which these parameters are
compatible exhibits TNE cycles. Furthermore, these parameters (heating and
geometry) are likely to vary significantly over the duration of a cycle, which
potentially limits the possibilities of periodic behavior. This study also
confirms that long-period intensity pulsations and coronal rain are two aspects
of the same phenomenon: both phenomena can occur for similar heating conditions
and can appear simultaneously in the simulations.
| astro-ph.SR | longperiod euv pulsations recently discovered to be common in active regions are understood to be the coronal manifestation of thermal nonequilibrium tne the active regions previously studied with eitsoho and aiasdo indicated that longperiod intensity pulsations are localized in only one or two loop bundles the basic idea of this study is to understand why for this purpose we tested the response of different loop systems using different magnetic configurations to different stratifications and strengths of the heating we present an extensive parameterspace study using 1d hydrodynamic simulations 1020 in total and conclude that the occurrence of tne requires specific combinations of parameters our study shows that the tne cycles are confined to specific ranges in parameter space this naturally explains why only some loops undergo constant periodic pulsations over several days since the loop geometry and the heating properties generally vary from one loop to another in an active region only the ones in which these parameters are compatible exhibits tne cycles furthermore these parameters heating and geometry are likely to vary significantly over the duration of a cycle which potentially limits the possibilities of periodic behavior this study also confirms that longperiod intensity pulsations and coronal rain are two aspects of the same phenomenon both phenomena can occur for similar heating conditions and can appear simultaneously in the simulations | [['longperiod', 'euv', 'pulsations', 'recently', 'discovered', 'to', 'be', 'common', 'in', 'active', 'regions', 'are', 'understood', 'to', 'be', 'the', 'coronal', 'manifestation', 'of', 'thermal', 'nonequilibrium', 'tne', 'the', 'active', 'regions', 'previously', 'studied', 'with', 'eitsoho', 'and', 'aiasdo', 'indicated', 'that', 'longperiod', 'intensity', 'pulsations', 'are', 'localized', 'in', 'only', 'one', 'or', 'two', 'loop', 'bundles', 'the', 'basic', 'idea', 'of', 'this', 'study', 'is', 'to', 'understand', 'why', 'for', 'this', 'purpose', 'we', 'tested', 'the', 'response', 'of', 'different', 'loop', 'systems', 'using', 'different', 'magnetic', 'configurations', 'to', 'different', 'stratifications', 'and', 'strengths', 'of', 'the', 'heating', 'we', 'present', 'an', 'extensive', 'parameterspace', 'study', 'using', '1d', 'hydrodynamic', 'simulations', '1020', 'in', 'total', 'and', 'conclude', 'that', 'the', 'occurrence', 'of', 'tne', 'requires', 'specific', 'combinations', 'of', 'parameters', 'our', 'study', 'shows', 'that', 'the', 'tne', 'cycles', 'are', 'confined', 'to', 'specific', 'ranges', 'in', 'parameter', 'space', 'this', 'naturally', 'explains', 'why', 'only', 'some', 'loops', 'undergo', 'constant', 'periodic', 'pulsations', 'over', 'several', 'days', 'since', 'the', 'loop', 'geometry', 'and', 'the', 'heating', 'properties', 'generally', 'vary', 'from', 'one', 'loop', 'to', 'another', 'in', 'an', 'active', 'region', 'only', 'the', 'ones', 'in', 'which', 'these', 'parameters', 'are', 'compatible', 'exhibits', 'tne', 'cycles', 'furthermore', 'these', 'parameters', 'heating', 'and', 'geometry', 'are', 'likely', 'to', 'vary', 'significantly', 'over', 'the', 'duration', 'of', 'a', 'cycle', 'which', 'potentially', 'limits', 'the', 'possibilities', 'of', 'periodic', 'behavior', 'this', 'study', 'also', 'confirms', 'that', 'longperiod', 'intensity', 'pulsations', 'and', 'coronal', 'rain', 'are', 'two', 'aspects', 'of', 'the', 'same', 'phenomenon', 'both', 'phenomena', 'can', 'occur', 'for', 'similar', 'heating', 'conditions', 'and', 'can', 'appear', 'simultaneously', 'in', 'the', 'simulations']] | [-0.15159065475983716, 0.2172429286873508, -0.030800451358399268, 0.11582622580198486, -0.06532862763957713, -0.0900527834945189, 0.040606104252881116, 0.40094020120820706, -0.24579036858948794, -0.3201359948651357, 0.10121882773343135, -0.22408546759238976, -0.15374602578389882, 0.24038701880040622, -0.055524306491530624, -0.023842349906705997, 0.05718831333374096, -0.00606219923409464, -0.04021848879585212, -0.21704041143582964, 0.29152215899772604, 0.05373487544671992, 0.2099496359344233, 0.00112319348964692, 0.02631435030859641, -0.0980274607660249, -0.02540392847202549, 0.035218972007781055, -0.12789763414409455, 0.03824967631371692, 0.22382351827215063, 0.07365957110569897, 0.20405750685498458, -0.4436547540424561, -0.3021853864489293, 0.07111853441138836, 0.16536933748919347, 0.04900526364098451, 0.013196376213719222, -0.2089461199939251, 0.05544673435559327, -0.12752891267141836, -0.14629524004518646, -0.047256925670345395, 0.04188052279218523, 0.028258131210565227, -0.24149387213824824, 0.07550218409358588, 0.05364938947393305, 0.07655785450796512, -0.09076181706252762, -0.06697299511764537, -0.03481470589547164, 0.13933209678877823, 0.08862388039071283, -0.008373103078073737, 0.1554206666028635, -0.09649045581807679, -0.11123421462252736, 0.3401549044319174, -0.04041331706314601, -0.09614734417270732, 0.2505764814432372, -0.19824916405328127, -0.1693823538085615, 0.17780742125522175, 0.1448869258186526, 0.1192005914466625, -0.14498940440482164, -0.017816862183231436, -0.018353603765982288, 0.16776021668285301, 0.08315653021299195, 0.04883907667403533, 0.2545602949336171, 0.13284171715124765, -0.0038158553567799653, 0.1344661043216051, -0.13791047209577464, -0.12013589598884045, -0.28634522550009106, -0.09524378439792516, -0.06417786474762992, 0.007809143839403987, -0.0679154442597461, -0.17720437560664407, 0.4289899810619483, 0.17432283024443843, 0.22023754891918296, -0.0420737264169888, 0.27228886159560217, 0.10781960379258222, 0.06923757239895746, 0.0800638696686788, 0.30791060774737905, 0.137580035536931, 0.09422136486232789, -0.24922276399500498, 0.06556908172020816, 0.035244382854117164] |
1,802.04011 | The $B=5$ Skyrmion as a two-cluster system | The classical $B=5$ Skyrmion can be approximated by a two-cluster system
where a $B=1$ Skyrmion is attached to a core $B=4$ Skyrmion. We quantise this
system, allowing the $B=1$ to freely orbit the core. The configuration space is
11-dimensional but simplifies significantly after factoring out the overall
spin and isospin degrees of freedom. We exactly solve the free quantum problem
and then include an interaction potential between the Skyrmions numerically.
The resulting energy spectrum is compared to the corresponding nuclei -- the
Helium-5/Lithium-5 isodoublet. We find approximate parity doubling not seen in
the experimental data. In addition, we fail to obtain the correct ground state
spin. The framework laid out for this two-cluster system can readily be
modified for other clusters and in particular for other $B=4n+1$ nuclei, of
which the $B=5$ is the simplest example.
| hep-th nucl-th | the classical b5 skyrmion can be approximated by a twocluster system where a b1 skyrmion is attached to a core b4 skyrmion we quantise this system allowing the b1 to freely orbit the core the configuration space is 11dimensional but simplifies significantly after factoring out the overall spin and isospin degrees of freedom we exactly solve the free quantum problem and then include an interaction potential between the skyrmions numerically the resulting energy spectrum is compared to the corresponding nuclei the helium5lithium5 isodoublet we find approximate parity doubling not seen in the experimental data in addition we fail to obtain the correct ground state spin the framework laid out for this twocluster system can readily be modified for other clusters and in particular for other b4n1 nuclei of which the b5 is the simplest example | [['the', 'classical', 'b5', 'skyrmion', 'can', 'be', 'approximated', 'by', 'a', 'twocluster', 'system', 'where', 'a', 'b1', 'skyrmion', 'is', 'attached', 'to', 'a', 'core', 'b4', 'skyrmion', 'we', 'quantise', 'this', 'system', 'allowing', 'the', 'b1', 'to', 'freely', 'orbit', 'the', 'core', 'the', 'configuration', 'space', 'is', '11dimensional', 'but', 'simplifies', 'significantly', 'after', 'factoring', 'out', 'the', 'overall', 'spin', 'and', 'isospin', 'degrees', 'of', 'freedom', 'we', 'exactly', 'solve', 'the', 'free', 'quantum', 'problem', 'and', 'then', 'include', 'an', 'interaction', 'potential', 'between', 'the', 'skyrmions', 'numerically', 'the', 'resulting', 'energy', 'spectrum', 'is', 'compared', 'to', 'the', 'corresponding', 'nuclei', 'the', 'helium5lithium5', 'isodoublet', 'we', 'find', 'approximate', 'parity', 'doubling', 'not', 'seen', 'in', 'the', 'experimental', 'data', 'in', 'addition', 'we', 'fail', 'to', 'obtain', 'the', 'correct', 'ground', 'state', 'spin', 'the', 'framework', 'laid', 'out', 'for', 'this', 'twocluster', 'system', 'can', 'readily', 'be', 'modified', 'for', 'other', 'clusters', 'and', 'in', 'particular', 'for', 'other', 'b4n1', 'nuclei', 'of', 'which', 'the', 'b5', 'is', 'the', 'simplest', 'example']] | [-0.1265948602940215, 0.14276328983314465, -0.08343027188456652, 0.07751382912046983, -0.07489534039435473, -0.14319285580580285, 0.048547555435154786, 0.3473583851394741, -0.2711043832228428, -0.2850189045897888, 0.06526990537181553, -0.24396328681981877, -0.062275774276262165, 0.15908998468386612, 0.015122129228246167, 0.0101209739608256, 0.032872383671819716, 0.07314727662124187, -0.055605726978300435, -0.22337874402624688, 0.2807577750960687, 0.032871148793229873, 0.22455221240205647, 0.032951692154252886, 0.058139212026008705, 0.000540230650790876, 0.0724202176815081, 0.013603642176533873, -0.1057990160683184, 0.06385058369898916, 0.22061570094157837, 0.05208345140939705, 0.1530378687062434, -0.4302564022880524, -0.18703515260809458, 0.12381561494369368, 0.2050314274147377, 0.1895200440868441, -0.0076351227261532185, -0.3015197019856003, 0.07560648222250822, -0.2026325572681214, -0.1942465750507562, -0.10496013664073289, 0.013466779436720045, -0.0036798306089594847, -0.2396580476525653, 0.06017676121870378, 0.045156945525213404, -0.004688075030243543, -0.09658425826320242, -0.14138542457844333, -0.05378571084063304, 0.10866457159119777, 0.029151849926596408, 0.07572933037317169, 0.12446720624006444, -0.11256749821560723, -0.08290178948117041, 0.41375151887199935, -0.007385293443694263, -0.2248867486106386, 0.15218973437086084, -0.11584151702883996, -0.1266013485855682, 0.11138585075399929, 0.11032386391626713, 0.12460972282587361, -0.12033152083789271, 0.09903623044877698, -0.046809180919781215, 0.18593166368712383, 0.031236053318401475, 0.014529872384566562, 0.2289537180047062, 0.12256021803258953, 0.0727268523445591, 0.18527989783341808, -0.10350715746766978, -0.15338196266526566, -0.2826684753785148, -0.15850115423195793, -0.1597511776463878, 0.043087890317520874, -0.06304165388641729, -0.09675368312326141, 0.39194989586739165, 0.09771481274558876, 0.17135050617634578, -0.015025474690426057, 0.25559489609659614, 0.1154288891317757, 0.07898114323554757, 0.08666184547342382, 0.27059322129234786, 0.12680408621339925, 0.08291147919800623, -0.27740890195565227, -0.021980177947229014, 0.041223536042454545] |
1,802.04012 | Radiation in Bent Asymmetric Coupled Waveguides | A numerical study of the radiation in coupled bent waveguides is presented.
Such arrangements of curved waveguides in reduced radiation-loss configurations
can be used to enhance the quality factor of integrated micro-resonators. 3D
full vector computations of the complex modal fields (and propagation
constants) and the transient propagation effects have been performed. The
results obtained agree qualitatively with former 2D FDTD analyses. At the same
time, the calculations presented meet the accuracy requirements for the design
of practical implementations that are unattainable with 2D approaches.
| physics.optics physics.comp-ph | a numerical study of the radiation in coupled bent waveguides is presented such arrangements of curved waveguides in reduced radiationloss configurations can be used to enhance the quality factor of integrated microresonators 3d full vector computations of the complex modal fields and propagation constants and the transient propagation effects have been performed the results obtained agree qualitatively with former 2d fdtd analyses at the same time the calculations presented meet the accuracy requirements for the design of practical implementations that are unattainable with 2d approaches | [['a', 'numerical', 'study', 'of', 'the', 'radiation', 'in', 'coupled', 'bent', 'waveguides', 'is', 'presented', 'such', 'arrangements', 'of', 'curved', 'waveguides', 'in', 'reduced', 'radiationloss', 'configurations', 'can', 'be', 'used', 'to', 'enhance', 'the', 'quality', 'factor', 'of', 'integrated', 'microresonators', '3d', 'full', 'vector', 'computations', 'of', 'the', 'complex', 'modal', 'fields', 'and', 'propagation', 'constants', 'and', 'the', 'transient', 'propagation', 'effects', 'have', 'been', 'performed', 'the', 'results', 'obtained', 'agree', 'qualitatively', 'with', 'former', '2d', 'fdtd', 'analyses', 'at', 'the', 'same', 'time', 'the', 'calculations', 'presented', 'meet', 'the', 'accuracy', 'requirements', 'for', 'the', 'design', 'of', 'practical', 'implementations', 'that', 'are', 'unattainable', 'with', '2d', 'approaches']] | [-0.117755718024758, 0.07805564920307093, -0.02230068588063919, 0.01061013137638968, -0.05207926516665057, -0.12841081158036277, -0.04536225895086924, 0.46209859631822575, -0.19989419309422374, -0.2832901346569304, 0.08443522263994618, -0.2624890674127355, -0.1128581765061383, 0.2434625142070997, 0.022525436328058795, 0.15213953868840777, 0.09238066043083866, -0.044259246721464605, -0.10133267149406795, -0.2391450457230565, 0.2353984364557878, 0.08190947357520816, 0.3606876161038166, 0.03223846661248466, 0.05345289134198711, -0.015723784293402873, -0.023396809380279764, 0.06353624170047364, -0.1595971475614663, 0.11805437773554808, 0.2687356765825479, 0.04663759169246381, 0.1976550394403083, -0.480069191084199, -0.251693762362092, 0.007341674529016018, 0.15701828694658443, 0.11754730602149807, -0.05304159997918066, -0.2893352903968965, 0.07620159162962366, -0.09972668522303658, -0.1720232323499485, -0.07774032055333789, -0.06523902656044811, 0.055467211782732714, -0.23901748334589815, 0.021188220097905115, 0.014757260802157578, 0.03667785999165235, -0.03845982264084298, -0.0991133220072481, -0.015540859989067983, 0.11726401523975212, -0.0013873422438856714, -0.009035884279347513, 0.12796529970087467, -0.1268768980212155, -0.1761074887361333, 0.42555502176816973, -0.03449348275760366, -0.2484740011970557, 0.1919303840314526, -0.13530706510798718, -0.06106170963695539, 0.18990925446407692, 0.2160100540301452, 0.09216966753869894, -0.08664168694217335, 0.05817228140880443, 0.013675320192262353, 0.16676844951386252, 0.08999802982933554, 0.053483975130975955, 0.15466742907162934, 0.18837696409207724, -0.05581802309080515, 0.11499740180720221, -0.031853252378780214, -0.059212599972462546, -0.28295579133555293, -0.14882075723393687, -0.15530373327921898, -0.02278069056947494, -0.10076741314281078, -0.16685646539554, 0.40548008405381725, 0.1510008410051731, 0.12453135262642588, 0.020210050323623278, 0.3200838973834401, 0.14882349804975092, 0.11379290983313695, 0.04259369750174561, 0.32302214276222957, 0.13616434496916122, 0.10663083794948068, -0.23192849065110618, 0.001651163925305896, -0.0014100809127003664] |
1,802.04013 | Dilute Bose gas in classical environment at low temperatures | The properties of a dilute Bose gas with the non-Gaussian quenched disorder
are analysed. Being more specific we have considered a system of bosons
immersed in the classical bath consisting of the non-interacting particles with
infinite mass. Making use of perturbation theory up to second order we have
studied the impact of environment on the ground-state thermodynamic and
superfluid characteristics of the Bose component.
| cond-mat.quant-gas | the properties of a dilute bose gas with the nongaussian quenched disorder are analysed being more specific we have considered a system of bosons immersed in the classical bath consisting of the noninteracting particles with infinite mass making use of perturbation theory up to second order we have studied the impact of environment on the groundstate thermodynamic and superfluid characteristics of the bose component | [['the', 'properties', 'of', 'a', 'dilute', 'bose', 'gas', 'with', 'the', 'nongaussian', 'quenched', 'disorder', 'are', 'analysed', 'being', 'more', 'specific', 'we', 'have', 'considered', 'a', 'system', 'of', 'bosons', 'immersed', 'in', 'the', 'classical', 'bath', 'consisting', 'of', 'the', 'noninteracting', 'particles', 'with', 'infinite', 'mass', 'making', 'use', 'of', 'perturbation', 'theory', 'up', 'to', 'second', 'order', 'we', 'have', 'studied', 'the', 'impact', 'of', 'environment', 'on', 'the', 'groundstate', 'thermodynamic', 'and', 'superfluid', 'characteristics', 'of', 'the', 'bose', 'component']] | [-0.14343007402840158, 0.2243275854671083, -0.08466364882769994, 0.02067653632366273, 0.04690602692426182, -0.12242432999482844, 0.012430874956407933, 0.3307241594156949, -0.15421002164657693, -0.24881175700829772, 0.04252344798442209, -0.34534019575221464, -0.031118310434976593, 0.10078057768987492, 0.060576964053325355, 0.07384959531191271, -0.010688406153349206, 0.06064801377578988, -0.101909861446984, -0.29446072870632634, 0.36556211831702967, 0.014518632859108038, 0.21480552846333012, 0.02948342980380403, 0.06956294174597133, 0.0017182448027597275, 0.031609337404916005, 0.030479160144750495, -0.14585878947400488, 0.061814885659259744, 0.1703164768696297, -0.045785355679981876, 0.24016479526471812, -0.42211962927831337, -0.2397246379259741, 0.11957581237220438, 0.15235694597504335, 0.1298856702633202, -0.053330523732483925, -0.3118430544855073, -0.006409287801943719, -0.2444176883509499, -0.21549689676612616, -0.10738910542568192, 0.0018312154279556125, 0.06289992931851884, -0.1870157859812025, 0.14198140919324942, 0.06643510321737267, 0.07300862319243606, -0.06380422462825663, -0.05704531627088727, -0.014634970764745958, 0.11189945122168865, 0.025535087419484626, -0.03175023858057102, 0.2011442605726188, -0.17764111145515926, -0.010003241444792366, 0.4411135768168606, -0.12669067603383155, -0.18355192244416685, 0.2630332554526831, -0.16948811340262182, -0.13248140707582934, 0.14217439572530566, 0.16351435850083362, 0.08038302203203784, -0.18605337174085435, 0.09136946994021855, -0.05635427625384182, 0.16370006171382556, 0.02061832229810534, 0.06803633781237295, 0.24139576716697775, 0.20038409886547015, -0.008051934688410256, 0.22798011706618126, -0.07791951328908908, -0.15072399750351906, -0.23715652870305348, -0.1556962406684761, -0.21852062639663927, 0.06568554652039893, -0.05591211227124404, -0.21960497788677458, 0.35717571154236794, 0.158242779172042, 0.16433806755230762, -0.005040056072175503, 0.26456273725489154, 0.13779964861168992, 0.01807208790705772, 0.04792524321237579, 0.24963918888897751, 0.2175822599674575, 0.07242649325780803, -0.2551300125492162, -0.01873163174604997, 0.06458442020084476] |
1,802.04014 | From expanders to hitting distributions and simulation theorems | Recently, Chattopadhyay et al. (\cite{chattopadhyay2017simulation}) proved
that any gadget having so called \emph{hitting distributions} admits
deterministic "query-to-communication" simulation theorem. They applied this
result to Inner Product, Gap Hamming Distance and Indexing Function. They also
demonstrated that previous works used hitting distributions implicitly
(\cite{goos2015deterministic} for Indexing Function and \cite{wu2017raz} for
Inner Product).
In this paper we show that any expander in which any two distinct vertices
have at most one common neighbor can be transformed into a gadget possessing
good hitting distributions. We demonstrate that this result is applicable to
affine plane expanders and to Lubotzky-Phillips-Sarnak construction of
Ramanujan graphs . In particular, from affine plane expanders we extract a
gadget achieving the best known trade-off between the arity of outer function
and the size of gadget. More specifically, when this gadget has $k$ bits on
input, it admits a simulation theorem for all outer function of arity roughly
$2^{k/2}$ or less (the same was also known for $k$-bit Inner Product,
(\cite{chattopadhyay2017simulation})). In addition we show that, unlike Inner
Product, underlying hitting distributions in our new gadget are
"polynomial-time listable" in the sense that their supports can be written down
in time $2^{O(k)}$, i.e, in time polynomial in size of gadget's matrix.
| cs.CC | recently chattopadhyay et al citechattopadhyay2017simulation proved that any gadget having so called emphhitting distributions admits deterministic querytocommunication simulation theorem they applied this result to inner product gap hamming distance and indexing function they also demonstrated that previous works used hitting distributions implicitly citegoos2015deterministic for indexing function and citewu2017raz for inner product in this paper we show that any expander in which any two distinct vertices have at most one common neighbor can be transformed into a gadget possessing good hitting distributions we demonstrate that this result is applicable to affine plane expanders and to lubotzkyphillipssarnak construction of ramanujan graphs in particular from affine plane expanders we extract a gadget achieving the best known tradeoff between the arity of outer function and the size of gadget more specifically when this gadget has k bits on input it admits a simulation theorem for all outer function of arity roughly 2k2 or less the same was also known for kbit inner product citechattopadhyay2017simulation in addition we show that unlike inner product underlying hitting distributions in our new gadget are polynomialtime listable in the sense that their supports can be written down in time 2ok ie in time polynomial in size of gadgets matrix | [['recently', 'chattopadhyay', 'et', 'al', 'citechattopadhyay2017simulation', 'proved', 'that', 'any', 'gadget', 'having', 'so', 'called', 'emphhitting', 'distributions', 'admits', 'deterministic', 'querytocommunication', 'simulation', 'theorem', 'they', 'applied', 'this', 'result', 'to', 'inner', 'product', 'gap', 'hamming', 'distance', 'and', 'indexing', 'function', 'they', 'also', 'demonstrated', 'that', 'previous', 'works', 'used', 'hitting', 'distributions', 'implicitly', 'citegoos2015deterministic', 'for', 'indexing', 'function', 'and', 'citewu2017raz', 'for', 'inner', 'product', 'in', 'this', 'paper', 'we', 'show', 'that', 'any', 'expander', 'in', 'which', 'any', 'two', 'distinct', 'vertices', 'have', 'at', 'most', 'one', 'common', 'neighbor', 'can', 'be', 'transformed', 'into', 'a', 'gadget', 'possessing', 'good', 'hitting', 'distributions', 'we', 'demonstrate', 'that', 'this', 'result', 'is', 'applicable', 'to', 'affine', 'plane', 'expanders', 'and', 'to', 'lubotzkyphillipssarnak', 'construction', 'of', 'ramanujan', 'graphs', 'in', 'particular', 'from', 'affine', 'plane', 'expanders', 'we', 'extract', 'a', 'gadget', 'achieving', 'the', 'best', 'known', 'tradeoff', 'between', 'the', 'arity', 'of', 'outer', 'function', 'and', 'the', 'size', 'of', 'gadget', 'more', 'specifically', 'when', 'this', 'gadget', 'has', 'k', 'bits', 'on', 'input', 'it', 'admits', 'a', 'simulation', 'theorem', 'for', 'all', 'outer', 'function', 'of', 'arity', 'roughly', '2k2', 'or', 'less', 'the', 'same', 'was', 'also', 'known', 'for', 'kbit', 'inner', 'product', 'citechattopadhyay2017simulation', 'in', 'addition', 'we', 'show', 'that', 'unlike', 'inner', 'product', 'underlying', 'hitting', 'distributions', 'in', 'our', 'new', 'gadget', 'are', 'polynomialtime', 'listable', 'in', 'the', 'sense', 'that', 'their', 'supports', 'can', 'be', 'written', 'down', 'in', 'time', '2ok', 'ie', 'in', 'time', 'polynomial', 'in', 'size', 'of', 'gadgets', 'matrix']] | [-0.11099733482416564, 0.08637779975042152, -0.09597324042392827, 0.06776736038248417, -0.07923638578649089, -0.14711726633735348, 0.028383289396864183, 0.39780270927368516, -0.2925363721095576, -0.33333706807277597, 0.05380173945266251, -0.245861686225691, -0.13266081112398345, 0.18600178256008407, -0.0935253730964234, 0.04588932468775428, 0.06348269649689602, 0.02794994259707948, -0.094176683315544, -0.3088951390236616, 0.3160244869792091, 0.022643355686468473, 0.20142457918915416, 0.024390591207138924, 0.07572152281247581, 0.018459023417991834, -0.015115056677909635, 0.01176281047893273, -0.15115968626102017, 0.057236057002859796, 0.27706209241431884, 0.17128691625168518, 0.22274352142037196, -0.3922395548482252, -0.168575427093069, 0.14448882004974767, 0.17149745112941286, 0.07915649600411462, -0.03552923096867744, -0.19818456197118897, 0.09785604835041543, -0.17282299426205727, -0.09602872666195904, -0.017487454666017792, 0.07883284989035076, 0.004399641783705339, -0.2685246603114656, 0.021220625725326278, 0.1335507656177361, -0.01514700638043448, 0.03258210957385696, -0.1584626647976705, -0.00684517618495527, 0.11895363077529165, -0.056163005237684735, 0.08033337238017914, 0.05166522347352617, -0.051637370264823575, -0.14396022712942116, 0.329034991615447, -0.03650494263726986, -0.2134459642657209, 0.1784404185371367, -0.14236221205530003, -0.16470495196435736, 0.11535656283406898, 0.14713340560022567, 0.13974182664144089, -0.07999001164388918, 0.1177461072935245, -0.12164671171861918, 0.1732625563585542, 0.16733059382374962, 0.03161299222877606, 0.11073171436410262, 0.09262354423682848, 0.11426265108389443, 0.18215915196758595, 0.009430181872644921, -0.09474531639460233, -0.2686043205704791, -0.16123923641123442, -0.23172802798187003, 0.05585776014528551, -0.15239228889161546, -0.18959182651395007, 0.35055236231747994, 0.12215825711700273, 0.19037105860185588, 0.138009869018835, 0.2784355497035956, 0.07022923533503121, 0.11186934873302481, 0.19129569376601688, 0.1687667386104483, 0.10811025492480228, 0.012776706966093785, -0.1103645978384492, 0.09608045680728292, 0.1065616276515696] |
1,802.04015 | Toward Architectural Knowledge Sustainability. New Opportunities to
Extend the Longevity of Systems | Complex software systems must be maintained for years or decades, and the
effort and cost to maintain them are often high, involving continuous
refactoring to ensure their longevity in the face of changing requirements. In
this article, we introduce the notion of architectural knowledge (AK)
sustainability as a new concept to support architects dealing with the
evolution of long-lived systems. Architecture sustainability refers to the
ability of the architecture to endure over time with the minimum number of
refactoring cycles possible. We suggest that sustainability of the AK is a
function of how stable the decisions are, and we discuss a set of
sustainability criteria and metrics useful to estimate the sustainability of
this AK.
| cs.SE | complex software systems must be maintained for years or decades and the effort and cost to maintain them are often high involving continuous refactoring to ensure their longevity in the face of changing requirements in this article we introduce the notion of architectural knowledge ak sustainability as a new concept to support architects dealing with the evolution of longlived systems architecture sustainability refers to the ability of the architecture to endure over time with the minimum number of refactoring cycles possible we suggest that sustainability of the ak is a function of how stable the decisions are and we discuss a set of sustainability criteria and metrics useful to estimate the sustainability of this ak | [['complex', 'software', 'systems', 'must', 'be', 'maintained', 'for', 'years', 'or', 'decades', 'and', 'the', 'effort', 'and', 'cost', 'to', 'maintain', 'them', 'are', 'often', 'high', 'involving', 'continuous', 'refactoring', 'to', 'ensure', 'their', 'longevity', 'in', 'the', 'face', 'of', 'changing', 'requirements', 'in', 'this', 'article', 'we', 'introduce', 'the', 'notion', 'of', 'architectural', 'knowledge', 'ak', 'sustainability', 'as', 'a', 'new', 'concept', 'to', 'support', 'architects', 'dealing', 'with', 'the', 'evolution', 'of', 'longlived', 'systems', 'architecture', 'sustainability', 'refers', 'to', 'the', 'ability', 'of', 'the', 'architecture', 'to', 'endure', 'over', 'time', 'with', 'the', 'minimum', 'number', 'of', 'refactoring', 'cycles', 'possible', 'we', 'suggest', 'that', 'sustainability', 'of', 'the', 'ak', 'is', 'a', 'function', 'of', 'how', 'stable', 'the', 'decisions', 'are', 'and', 'we', 'discuss', 'a', 'set', 'of', 'sustainability', 'criteria', 'and', 'metrics', 'useful', 'to', 'estimate', 'the', 'sustainability', 'of', 'this', 'ak']] | [-0.14673739512167547, 0.07486626799015896, -0.05083899761793082, 0.044807800386384454, -0.09129879227636949, -0.10400679946026724, 0.07442211308719024, 0.39720175078989045, -0.2637268865481019, -0.3472464544293673, 0.15030965958721937, -0.2120188100789876, -0.13790442718486504, 0.15362548205961027, -0.1515642788471229, 0.07675099738509111, 0.05950386004279489, 0.026384448070767456, -0.04820018959859305, -0.2913994762459365, 0.3295506293713318, 0.06570471758529058, 0.26514162862592416, 0.09274732101020282, 0.06814286543218338, -0.05574796521611026, -0.03346144580889655, -0.012943544894780801, -0.10019178385068106, 0.19973585403969754, 0.29500823624675043, 0.286024005929737, 0.3535723978248627, -0.4170395347249249, -0.1729826152972553, 0.1329349323945201, 0.09612846189461972, 0.043277567979353275, 0.007745759497882555, -0.22633833307772874, 0.11170494134244306, -0.2236249675569327, -0.16651684620579624, -0.13180704444403882, 0.03939796000233163, 0.04668944350484273, -0.22568562736167855, -0.02705901155511484, 0.05624414986029834, 0.09351447962386453, -0.07217944452296132, -0.08969327908657167, -0.04486854248477713, 0.17550132748792352, 0.04698202432457196, 0.016402976320165654, 0.13429434265050552, -0.1438210184782055, -0.12875009486856667, 0.4066994011240161, -0.018011325387203174, -0.1654088883579749, 0.23794874627467083, -0.07924145457699247, -0.15524294888195783, 0.0702294020589603, 0.22230046200363532, 0.07671262887508973, -0.16165312988602598, 0.027937575007545883, 0.04347232850066022, 0.1758982355179994, 0.026082206339291904, 0.06335224502355508, 0.23942626222320226, 0.22983418136187223, 0.09623641493811232, 0.1187714778241175, -0.005484849524572896, -0.07110529295421894, -0.2340127031683274, -0.21629332240023044, -0.10768560197447305, 0.0370739157554572, -0.040015034526890224, -0.17055518570477549, 0.4212739405505683, 0.2059412349663351, 0.14453992403881705, 0.04963274400924211, 0.28964337917125743, 0.07876965581735536, 0.09536525390143177, 0.07126326786516153, 0.17864974356539873, 0.06587139572340833, 0.1363511382875478, -0.2103063260488536, 0.11319473590296895, 0.002795801003989966] |
1,802.04016 | Geodesic Convolutional Shape Optimization | Aerodynamic shape optimization has many industrial applications. Existing
methods, however, are so computationally demanding that typical engineering
practices are to either simply try a limited number of hand-designed shapes or
restrict oneself to shapes that can be parameterized using only few degrees of
freedom. In this work, we introduce a new way to optimize complex shapes fast
and accurately. To this end, we train Geodesic Convolutional Neural Networks to
emulate a fluidynamics simulator. The key to making this approach practical is
remeshing the original shape using a polycube map, which makes it possible to
perform the computations on GPUs instead of CPUs. The neural net is then used
to formulate an objective function that is differentiable with respect to the
shape parameters, which can then be optimized using a gradient-based technique.
This outperforms state- of-the-art methods by 5 to 20% for standard problems
and, even more importantly, our approach applies to cases that previous methods
cannot handle.
| cs.CE | aerodynamic shape optimization has many industrial applications existing methods however are so computationally demanding that typical engineering practices are to either simply try a limited number of handdesigned shapes or restrict oneself to shapes that can be parameterized using only few degrees of freedom in this work we introduce a new way to optimize complex shapes fast and accurately to this end we train geodesic convolutional neural networks to emulate a fluidynamics simulator the key to making this approach practical is remeshing the original shape using a polycube map which makes it possible to perform the computations on gpus instead of cpus the neural net is then used to formulate an objective function that is differentiable with respect to the shape parameters which can then be optimized using a gradientbased technique this outperforms state oftheart methods by 5 to 20 for standard problems and even more importantly our approach applies to cases that previous methods cannot handle | [['aerodynamic', 'shape', 'optimization', 'has', 'many', 'industrial', 'applications', 'existing', 'methods', 'however', 'are', 'so', 'computationally', 'demanding', 'that', 'typical', 'engineering', 'practices', 'are', 'to', 'either', 'simply', 'try', 'a', 'limited', 'number', 'of', 'handdesigned', 'shapes', 'or', 'restrict', 'oneself', 'to', 'shapes', 'that', 'can', 'be', 'parameterized', 'using', 'only', 'few', 'degrees', 'of', 'freedom', 'in', 'this', 'work', 'we', 'introduce', 'a', 'new', 'way', 'to', 'optimize', 'complex', 'shapes', 'fast', 'and', 'accurately', 'to', 'this', 'end', 'we', 'train', 'geodesic', 'convolutional', 'neural', 'networks', 'to', 'emulate', 'a', 'fluidynamics', 'simulator', 'the', 'key', 'to', 'making', 'this', 'approach', 'practical', 'is', 'remeshing', 'the', 'original', 'shape', 'using', 'a', 'polycube', 'map', 'which', 'makes', 'it', 'possible', 'to', 'perform', 'the', 'computations', 'on', 'gpus', 'instead', 'of', 'cpus', 'the', 'neural', 'net', 'is', 'then', 'used', 'to', 'formulate', 'an', 'objective', 'function', 'that', 'is', 'differentiable', 'with', 'respect', 'to', 'the', 'shape', 'parameters', 'which', 'can', 'then', 'be', 'optimized', 'using', 'a', 'gradientbased', 'technique', 'this', 'outperforms', 'state', 'oftheart', 'methods', 'by', '5', 'to', '20', 'for', 'standard', 'problems', 'and', 'even', 'more', 'importantly', 'our', 'approach', 'applies', 'to', 'cases', 'that', 'previous', 'methods', 'can', 'not', 'handle']] | [-0.03224419749261823, 0.021858983622084573, -0.09766192314108228, 0.06780402690608196, -0.1601140469158436, -0.19345961706594203, 0.009434297112866667, 0.47380317415401435, -0.3026220550030992, -0.3457480868799938, 0.0873515113771472, -0.20921202108136433, -0.19627721779564525, 0.23256835723325467, -0.1399810071649018, 0.10608166108607867, 0.0957220743534861, 0.004214671610967274, -0.109520480872034, -0.281295065152619, 0.268659437948743, 0.04191227827909266, 0.2685612070961458, 0.010739973488198534, 0.08362297920412295, -0.029082054067640358, 0.025895049840739814, 0.033540434494049115, -0.06844898186728601, 0.1731110870939009, 0.2836567222535207, 0.17864523265528592, 0.3074381647032395, -0.4499453810002109, -0.22728405568387602, 0.1384939355034215, 0.16760362600863193, 0.12802123757536008, 0.032548927076462696, -0.2282601627491557, 0.11474335900134151, -0.17174478490083556, -0.09769611708541062, -0.1753615312705374, -0.0229304884708706, 0.012351200840981666, -0.2725423071147862, 0.007333934440568185, 0.034516203565712854, -0.002967669073919392, 0.016950824335039517, -0.09424129935058581, 0.027223054854982314, 0.12189181380650135, 0.015174760910262321, 0.07200628418177307, 0.17079975985429563, -0.12967074396545483, -0.11506310175988634, 0.38984533042237635, -0.006992481120233276, -0.28252149193405296, 0.21326295916246144, -0.023647404560570125, -0.144129363028036, 0.13025157090134112, 0.2089975129358417, 0.15627052210520503, -0.1641897507950628, 0.03649627247003684, -0.0071318910033056505, 0.2062478959041345, 0.03809124437771785, -0.04347369358231607, 0.15886232247843057, 0.19236297303904146, 0.08418470836032454, 0.14025569878144867, -0.08078114772482425, -0.08836283584334442, -0.21499774948349756, -0.09795111246335848, -0.20133636251186868, 0.012407569856932357, -0.04459283747068891, -0.15371637472847274, 0.4005421853214977, 0.2257553460217336, 0.19098793905655478, 0.09106788349302283, 0.3887717389400787, 0.059564139534553195, 0.14254719969352328, 0.08917423027899757, 0.20793464662697, 0.043064772095056665, 0.09077765633037706, -0.1396411446332457, 0.06307302456598278, 0.020369537931030534] |
1,802.04017 | Crack initiation in viscoelastic materials | In viscoelastic materials, individually short-lived bonds collectively result
in a mechanical resistance which is long-lived but finite, as ultimately cracks
appear. Here we provide a microscopic mechanism by which cracks emerge from the
nonlinear local bond dynamics. This mechanism is different from crack
initiation in solids, which is governed by a competition between elastic and
adhesion energy. We provide and numerically verify analytical equations for the
dependence of the critical crack length on the bond kinetics and applied
stress.
| cond-mat.soft cond-mat.stat-mech | in viscoelastic materials individually shortlived bonds collectively result in a mechanical resistance which is longlived but finite as ultimately cracks appear here we provide a microscopic mechanism by which cracks emerge from the nonlinear local bond dynamics this mechanism is different from crack initiation in solids which is governed by a competition between elastic and adhesion energy we provide and numerically verify analytical equations for the dependence of the critical crack length on the bond kinetics and applied stress | [['in', 'viscoelastic', 'materials', 'individually', 'shortlived', 'bonds', 'collectively', 'result', 'in', 'a', 'mechanical', 'resistance', 'which', 'is', 'longlived', 'but', 'finite', 'as', 'ultimately', 'cracks', 'appear', 'here', 'we', 'provide', 'a', 'microscopic', 'mechanism', 'by', 'which', 'cracks', 'emerge', 'from', 'the', 'nonlinear', 'local', 'bond', 'dynamics', 'this', 'mechanism', 'is', 'different', 'from', 'crack', 'initiation', 'in', 'solids', 'which', 'is', 'governed', 'by', 'a', 'competition', 'between', 'elastic', 'and', 'adhesion', 'energy', 'we', 'provide', 'and', 'numerically', 'verify', 'analytical', 'equations', 'for', 'the', 'dependence', 'of', 'the', 'critical', 'crack', 'length', 'on', 'the', 'bond', 'kinetics', 'and', 'applied', 'stress']] | [-0.1226193578177002, 0.2383688171217336, -0.11675030973009011, 0.032047227107554296, -0.04028047885321363, -0.15716519377590746, 0.057265739548285316, 0.3504528041598918, -0.3444778230748599, -0.23299959940906567, 0.039962141174834834, -0.2525621738426293, -0.2266184912546526, 0.14831876001450456, 0.03556463418858526, 0.04048192787832946, 0.008194219089655464, -0.06387915745704682, 0.054221162425141925, -0.17278898719556723, 0.2614680525575635, 0.03641190420529699, 0.33524174096440024, 0.13448706477338188, 0.07441960454364366, -0.011658118563244425, 0.06565891243988954, 0.04134322085736107, -0.20971593597927426, 0.0656816158031078, 0.23954491914379633, -0.03685290560338505, 0.24659439862434623, -0.5558336187342677, -0.2269476717455855, 0.013733155076403785, 0.13248144092533407, 0.18917716624763428, -0.016207227753062697, -0.21319247310674644, 0.04131623915149064, -0.12948706233873963, -0.11988811050924839, -0.04244425385907481, 0.05349916179629066, 0.07867257956627614, -0.2225024608093538, 0.1746059442764219, 0.04176986429183095, 0.09627107931654665, -0.13213124780184765, -0.02145538276910216, -0.06579720137841245, 0.08800827381731588, 0.08548205740796992, -0.024262050779748568, 0.20425448819546949, -0.1283757934859612, -0.08659655137482701, 0.43189961833384216, 0.011194459834619414, -0.19204016740999738, 0.2060264590125578, -0.0833871303998594, -0.04106963043914565, 0.19694941998989898, 0.17310525368474708, 0.06899000541601755, -0.16841001091878624, -0.026044436084265713, 0.0263122229385956, 0.1328692492569172, 0.08867193879913303, -0.03327080348058592, 0.21271703876790743, 0.2382922970595522, 0.02909472541105521, 0.1578413384577519, -0.035291461330025066, -0.10387525433391522, -0.3206564018597143, -0.13890962262602546, -0.17649447946231575, 0.0863682309495686, -0.11306755364923354, -0.21645557411203656, 0.364082464783252, 0.09651707881425, 0.16071186917303484, 0.02959283353330544, 0.18427952559358335, 0.06250465849467518, 0.05615071107668779, 0.029792298844284554, 0.28677627406542816, 0.12050738395633813, 0.09579041166396081, -0.2707079368278007, 0.1640000478195062, 0.07432962163009599] |
1,802.04018 | Resonant-light diffusion in a disordered atomic layer | Light scattering in dense media is a fundamental problem of many-body
physics, which is also relevant for the development of optical devices. In this
work we investigate experimentally light propagation in a dense sample of
randomly positioned resonant scatterers confined in a layer of sub-wavelength
thickness. We locally illuminate the atomic cloud and monitor
spatially-resolved fluorescence away from the excitation region. We show that
light spreading is well described by a diffusion process, involving many
scattering events in the dense regime. For light detuned from resonance we find
evidence that the atomic layer behaves as a graded-index planar waveguide.
These features are reproduced by a simple geometrical model and numerical
simulations of coupled dipoles.
| physics.atom-ph cond-mat.quant-gas | light scattering in dense media is a fundamental problem of manybody physics which is also relevant for the development of optical devices in this work we investigate experimentally light propagation in a dense sample of randomly positioned resonant scatterers confined in a layer of subwavelength thickness we locally illuminate the atomic cloud and monitor spatiallyresolved fluorescence away from the excitation region we show that light spreading is well described by a diffusion process involving many scattering events in the dense regime for light detuned from resonance we find evidence that the atomic layer behaves as a gradedindex planar waveguide these features are reproduced by a simple geometrical model and numerical simulations of coupled dipoles | [['light', 'scattering', 'in', 'dense', 'media', 'is', 'a', 'fundamental', 'problem', 'of', 'manybody', 'physics', 'which', 'is', 'also', 'relevant', 'for', 'the', 'development', 'of', 'optical', 'devices', 'in', 'this', 'work', 'we', 'investigate', 'experimentally', 'light', 'propagation', 'in', 'a', 'dense', 'sample', 'of', 'randomly', 'positioned', 'resonant', 'scatterers', 'confined', 'in', 'a', 'layer', 'of', 'subwavelength', 'thickness', 'we', 'locally', 'illuminate', 'the', 'atomic', 'cloud', 'and', 'monitor', 'spatiallyresolved', 'fluorescence', 'away', 'from', 'the', 'excitation', 'region', 'we', 'show', 'that', 'light', 'spreading', 'is', 'well', 'described', 'by', 'a', 'diffusion', 'process', 'involving', 'many', 'scattering', 'events', 'in', 'the', 'dense', 'regime', 'for', 'light', 'detuned', 'from', 'resonance', 'we', 'find', 'evidence', 'that', 'the', 'atomic', 'layer', 'behaves', 'as', 'a', 'gradedindex', 'planar', 'waveguide', 'these', 'features', 'are', 'reproduced', 'by', 'a', 'simple', 'geometrical', 'model', 'and', 'numerical', 'simulations', 'of', 'coupled', 'dipoles']] | [-0.11294757214113417, 0.1994594496004937, -0.04706559251389352, 0.03122136792790754, -0.0076543409704116355, -0.13897653457528927, 0.037165901262166075, 0.4586315214258145, -0.29582475965205385, -0.24684185545336, 0.034407753398307, -0.31825707700887795, -0.17200257650805278, 0.20253560517857408, 0.023639127115561757, 0.057315073784832894, 0.05889619476357965, -0.05296029558143856, 0.023230316215439847, -0.11443335168664098, 0.2982243253408294, 0.01798197331740276, 0.2795237476300252, 0.07283331109864409, 0.06672607199084667, 0.029534360902943535, 0.022210891849745326, -0.0025766716060931223, -0.09514871182743759, 0.0965791959346174, 0.23772969551939974, 0.01949748064374976, 0.20197534871598086, -0.47662764876689545, -0.2804931912146378, 0.015154636203589146, 0.22077306767255722, 0.14081723949148958, -0.10836572547059245, -0.28609627755685596, -0.0014263616319288288, -0.08899117705591938, -0.1937283179946111, -0.022935500940340654, -0.014567600220049682, 0.0460574124253502, -0.2525417291510262, 0.048171884320796825, 0.03466984860112956, 0.05142467495119363, -0.028488242095606933, -0.0054402726767748075, 0.015144353473085192, 0.05688308073277177, -0.048961491339580616, -0.010651924577950124, 0.20699511762920833, -0.16489964362137885, -0.05166096844007833, 0.39488006633677797, -0.06717059858094312, -0.12562878325320126, 0.19110609697823397, -0.17043103565326115, -0.04545923065610655, 0.16728467052279597, 0.23356817719085435, 0.141655858753151, -0.15780084963740879, 0.04633704140653942, -0.10685412332480937, 0.19766091669270394, 0.09780890471301973, 0.07940937157132123, 0.23672733996104317, 0.24399533265744122, -0.009042551850781596, 0.16707619772243656, -0.12508415358279945, -0.07454159394674525, -0.28108381429327683, -0.11294076079502702, -0.19840367286457894, 0.04199349542205598, -0.058809291522106434, -0.1600291522548727, 0.3659817457868995, 0.12426068606018498, 0.2013171842942635, -0.04996276107563621, 0.3141617249542226, 0.0891546227411661, 0.05759730418784577, 0.0590445122991999, 0.3080957675262828, 0.15195809835322985, 0.0846775415386155, -0.2272379491151425, 0.001020502135680433, -0.011282436036261763] |
1,802.04019 | High-resolution observations of IRAS 08544-4431. Detection of a disk
orbiting a post-AGB star and of a slow disk wind | We are studying a class of binary post-AGB stars that seem to be
systematically surrounded by equatorial disks and slow outflows. Although the
rotating dynamics had only been well identified in three cases, the study of
such structures is thought to be fundamental to the understanding of the
formation of nebulae around evolved stars. We present ALMA maps of 12CO and
13CO J=3-2 lines in one of these sources, IRAS08544-4431. We analyzed the data
by means of nebula models, which account for the expectedly composite source
and can reproduce the data. From our modeling, we estimated the main nebula
parameters, including the structure and dynamics and the density and
temperature distributions. We discuss the uncertainties of the derived values
and, in particular, their dependence on the distance.
Our observations reveal the presence of an equatorial disk in rotation; a
low-velocity outflow is also found, probably formed of gas expelled from the
disk. The main characteristics of our observations and modeling of
IRAS08544-4431 are similar to those of better studied objects, confirming our
interpretation. The disk rotation indicates a total central mass of about 1.8
Mo, for a distance of 1100 pc. The disk is found to be relatively extended and
has a typical diameter of ~ 4 10^16 cm. The total nebular mass is ~ 2 10^-2 Mo,
of which ~ 90% corresponds to the disk. Assuming that the outflow is due to
mass loss from the disk, we derive a disk lifetime of ~ 10000 yr. The disk
angular momentum is found to be comparable to that of the binary system at
present. Assuming that the disk angular momentum was transferred from the
binary system, as expected, the high values of the disk angular momentum in
this and other similar disks suggest that the size of the stellar orbits has
significantly decreased as a consequence of disk formation.
| astro-ph.SR | we are studying a class of binary postagb stars that seem to be systematically surrounded by equatorial disks and slow outflows although the rotating dynamics had only been well identified in three cases the study of such structures is thought to be fundamental to the understanding of the formation of nebulae around evolved stars we present alma maps of 12co and 13co j32 lines in one of these sources iras085444431 we analyzed the data by means of nebula models which account for the expectedly composite source and can reproduce the data from our modeling we estimated the main nebula parameters including the structure and dynamics and the density and temperature distributions we discuss the uncertainties of the derived values and in particular their dependence on the distance our observations reveal the presence of an equatorial disk in rotation a lowvelocity outflow is also found probably formed of gas expelled from the disk the main characteristics of our observations and modeling of iras085444431 are similar to those of better studied objects confirming our interpretation the disk rotation indicates a total central mass of about 18 mo for a distance of 1100 pc the disk is found to be relatively extended and has a typical diameter of 4 1016 cm the total nebular mass is 2 102 mo of which 90 corresponds to the disk assuming that the outflow is due to mass loss from the disk we derive a disk lifetime of 10000 yr the disk angular momentum is found to be comparable to that of the binary system at present assuming that the disk angular momentum was transferred from the binary system as expected the high values of the disk angular momentum in this and other similar disks suggest that the size of the stellar orbits has significantly decreased as a consequence of disk formation | [['we', 'are', 'studying', 'a', 'class', 'of', 'binary', 'postagb', 'stars', 'that', 'seem', 'to', 'be', 'systematically', 'surrounded', 'by', 'equatorial', 'disks', 'and', 'slow', 'outflows', 'although', 'the', 'rotating', 'dynamics', 'had', 'only', 'been', 'well', 'identified', 'in', 'three', 'cases', 'the', 'study', 'of', 'such', 'structures', 'is', 'thought', 'to', 'be', 'fundamental', 'to', 'the', 'understanding', 'of', 'the', 'formation', 'of', 'nebulae', 'around', 'evolved', 'stars', 'we', 'present', 'alma', 'maps', 'of', '12co', 'and', '13co', 'j32', 'lines', 'in', 'one', 'of', 'these', 'sources', 'iras085444431', 'we', 'analyzed', 'the', 'data', 'by', 'means', 'of', 'nebula', 'models', 'which', 'account', 'for', 'the', 'expectedly', 'composite', 'source', 'and', 'can', 'reproduce', 'the', 'data', 'from', 'our', 'modeling', 'we', 'estimated', 'the', 'main', 'nebula', 'parameters', 'including', 'the', 'structure', 'and', 'dynamics', 'and', 'the', 'density', 'and', 'temperature', 'distributions', 'we', 'discuss', 'the', 'uncertainties', 'of', 'the', 'derived', 'values', 'and', 'in', 'particular', 'their', 'dependence', 'on', 'the', 'distance', 'our', 'observations', 'reveal', 'the', 'presence', 'of', 'an', 'equatorial', 'disk', 'in', 'rotation', 'a', 'lowvelocity', 'outflow', 'is', 'also', 'found', 'probably', 'formed', 'of', 'gas', 'expelled', 'from', 'the', 'disk', 'the', 'main', 'characteristics', 'of', 'our', 'observations', 'and', 'modeling', 'of', 'iras085444431', 'are', 'similar', 'to', 'those', 'of', 'better', 'studied', 'objects', 'confirming', 'our', 'interpretation', 'the', 'disk', 'rotation', 'indicates', 'a', 'total', 'central', 'mass', 'of', 'about', '18', 'mo', 'for', 'a', 'distance', 'of', '1100', 'pc', 'the', 'disk', 'is', 'found', 'to', 'be', 'relatively', 'extended', 'and', 'has', 'a', 'typical', 'diameter', 'of', '4', '1016', 'cm', 'the', 'total', 'nebular', 'mass', 'is', '2', '102', 'mo', 'of', 'which', '90', 'corresponds', 'to', 'the', 'disk', 'assuming', 'that', 'the', 'outflow', 'is', 'due', 'to', 'mass', 'loss', 'from', 'the', 'disk', 'we', 'derive', 'a', 'disk', 'lifetime', 'of', '10000', 'yr', 'the', 'disk', 'angular', 'momentum', 'is', 'found', 'to', 'be', 'comparable', 'to', 'that', 'of', 'the', 'binary', 'system', 'at', 'present', 'assuming', 'that', 'the', 'disk', 'angular', 'momentum', 'was', 'transferred', 'from', 'the', 'binary', 'system', 'as', 'expected', 'the', 'high', 'values', 'of', 'the', 'disk', 'angular', 'momentum', 'in', 'this', 'and', 'other', 'similar', 'disks', 'suggest', 'that', 'the', 'size', 'of', 'the', 'stellar', 'orbits', 'has', 'significantly', 'decreased', 'as', 'a', 'consequence', 'of', 'disk', 'formation']] | [-0.08535727491882844, 0.08654873164596807, -0.05011141799146035, 0.07560847665786316, -0.04505731514712307, -0.024607419561533655, 0.004174475480237457, 0.3794906413518503, -0.21262040513598163, -0.34985099054956964, 0.08699059872697183, -0.24830754055626325, -0.03632711493174, 0.20866595750911254, -0.03559081594261234, -0.021820773249091274, 0.057229909533634785, -0.046574628544345374, -0.06621293139445489, -0.20926080025380886, 0.32441302190809584, 0.08410998680705174, 0.13052288624801536, 0.0060109679923072215, 0.07094452939545888, -0.11302606095788909, -0.03589467304896136, -0.011676481540547923, -0.14676464658183308, 0.09137834125641184, 0.180716692589638, 0.10831811635632861, 0.18506990630622402, -0.36506826039251, -0.22401073826190665, 0.02826104144275677, 0.1839100954748812, 0.05924816210525202, -0.025114251476651455, -0.24448163402839335, 0.09758301941109211, -0.19265921724746463, -0.18406534584002476, 0.034495137623018875, 0.07242210885265567, 0.03434887854802254, -0.232772382675693, 0.10131698714819218, 0.07259373893449847, 0.06897468305360831, -0.11863479507995434, -0.13168530531426068, -0.10349076976465275, 0.09215630910962393, 0.05868479094628367, 0.07590662845502012, 0.18638961371416074, -0.11434591098413727, -0.032586540011536394, 0.41644102892624674, -0.061148336464081146, -0.08537942638361186, 0.23652141992781373, -0.2372588530640866, -0.1310395563647273, 0.1714993788540119, 0.16450900729501344, 0.1304073574704683, -0.1300956334951181, 0.00224427699882415, -0.05893973792467999, 0.21191531960837176, 0.06090065196889346, 0.050881300762784284, 0.32103963846676664, 0.12097652096732626, 0.0052411066707925965, 0.1424284221173157, -0.20773339200169458, -0.09560906350856922, -0.22843397581552874, -0.13160894307781193, -0.15084903053366808, 0.09165219219981646, -0.11539830885833267, -0.08998448550834733, 0.3395955897226441, 0.11161202957746802, 0.2740429446559216, 0.007976037886024254, 0.2853289952669598, 0.10414186029152975, 0.12702370790352466, 0.14389589811068365, 0.30890289029930945, 0.17840637847185745, 0.09453294195662268, -0.23665003420357578, 0.08926131862268658, -0.022274259006467144] |
1,802.0402 | Efficient Bias-Span-Constrained Exploration-Exploitation in
Reinforcement Learning | We introduce SCAL, an algorithm designed to perform efficient
exploration-exploitation in any unknown weakly-communicating Markov decision
process (MDP) for which an upper bound $c$ on the span of the optimal bias
function is known. For an MDP with $S$ states, $A$ actions and $\Gamma \leq S$
possible next states, we prove a regret bound of $\widetilde{O}(c\sqrt{\Gamma
SAT})$, which significantly improves over existing algorithms (e.g., UCRL and
PSRL), whose regret scales linearly with the MDP diameter $D$. In fact, the
optimal bias span is finite and often much smaller than $D$ (e.g., $D=\infty$
in non-communicating MDPs). A similar result was originally derived by Bartlett
and Tewari (2009) for REGAL.C, for which no tractable algorithm is available.
In this paper, we relax the optimization problem at the core of REGAL.C, we
carefully analyze its properties, and we provide the first computationally
efficient algorithm to solve it. Finally, we report numerical simulations
supporting our theoretical findings and showing how SCAL significantly
outperforms UCRL in MDPs with large diameter and small span.
| cs.LG stat.ML | we introduce scal an algorithm designed to perform efficient explorationexploitation in any unknown weaklycommunicating markov decision process mdp for which an upper bound c on the span of the optimal bias function is known for an mdp with s states a actions and gamma leq s possible next states we prove a regret bound of widetildeocsqrtgamma sat which significantly improves over existing algorithms eg ucrl and psrl whose regret scales linearly with the mdp diameter d in fact the optimal bias span is finite and often much smaller than d eg dinfty in noncommunicating mdps a similar result was originally derived by bartlett and tewari 2009 for regalc for which no tractable algorithm is available in this paper we relax the optimization problem at the core of regalc we carefully analyze its properties and we provide the first computationally efficient algorithm to solve it finally we report numerical simulations supporting our theoretical findings and showing how scal significantly outperforms ucrl in mdps with large diameter and small span | [['we', 'introduce', 'scal', 'an', 'algorithm', 'designed', 'to', 'perform', 'efficient', 'explorationexploitation', 'in', 'any', 'unknown', 'weaklycommunicating', 'markov', 'decision', 'process', 'mdp', 'for', 'which', 'an', 'upper', 'bound', 'c', 'on', 'the', 'span', 'of', 'the', 'optimal', 'bias', 'function', 'is', 'known', 'for', 'an', 'mdp', 'with', 's', 'states', 'a', 'actions', 'and', 'gamma', 'leq', 's', 'possible', 'next', 'states', 'we', 'prove', 'a', 'regret', 'bound', 'of', 'widetildeocsqrtgamma', 'sat', 'which', 'significantly', 'improves', 'over', 'existing', 'algorithms', 'eg', 'ucrl', 'and', 'psrl', 'whose', 'regret', 'scales', 'linearly', 'with', 'the', 'mdp', 'diameter', 'd', 'in', 'fact', 'the', 'optimal', 'bias', 'span', 'is', 'finite', 'and', 'often', 'much', 'smaller', 'than', 'd', 'eg', 'dinfty', 'in', 'noncommunicating', 'mdps', 'a', 'similar', 'result', 'was', 'originally', 'derived', 'by', 'bartlett', 'and', 'tewari', '2009', 'for', 'regalc', 'for', 'which', 'no', 'tractable', 'algorithm', 'is', 'available', 'in', 'this', 'paper', 'we', 'relax', 'the', 'optimization', 'problem', 'at', 'the', 'core', 'of', 'regalc', 'we', 'carefully', 'analyze', 'its', 'properties', 'and', 'we', 'provide', 'the', 'first', 'computationally', 'efficient', 'algorithm', 'to', 'solve', 'it', 'finally', 'we', 'report', 'numerical', 'simulations', 'supporting', 'our', 'theoretical', 'findings', 'and', 'showing', 'how', 'scal', 'significantly', 'outperforms', 'ucrl', 'in', 'mdps', 'with', 'large', 'diameter', 'and', 'small', 'span']] | [-0.07398234728131105, 0.09458992351931308, -0.07467560045646898, 0.08661604470360158, -0.08943329059702317, -0.1667403056399163, 0.10586967971317018, 0.4385136622540427, -0.26440172966456776, -0.3412567336140483, 0.10881848345355441, -0.2214219356881751, -0.13443564577733702, 0.20501039577930263, -0.0822980638946209, 0.08774315627312965, 0.06652629241827085, 0.020860809939569496, -0.047923781454301206, -0.29382209654079017, 0.2582340932564076, 0.07339672538959845, 0.22627109839637397, 0.027564598682026067, 0.1062092122664167, 0.017350766418332404, -0.0028638568756198792, 0.032334363013929265, -0.17688887097139025, 0.0954345989422026, 0.2716346698587365, 0.1890725210210252, 0.301982775426498, -0.36076825467982526, -0.14303793768243242, 0.13021984946787019, 0.14155494346279848, 0.0913708095713942, 0.015644316524655248, -0.26662524781669633, 0.0988363444889811, -0.15739815224978057, -0.0468989762943238, -0.05401713577748248, 0.04584431420680079, -0.027755555331135506, -0.331140705175472, 0.020389645025980743, 0.08914165474248655, 0.005847516233828201, -0.03977933758658103, -0.188688644996816, 0.046583063331799526, 0.06135785311926156, 0.011050732801915288, 0.04281435166009363, 0.07347318061317007, -0.08048233793004218, -0.1716935604161611, 0.30297568338838493, -0.05784075310476703, -0.1699661979395332, 0.17849610666744412, -0.08298716054467314, -0.1588596337418439, 0.14744108925629973, 0.20089927824834983, 0.20620567403225737, -0.10258253799807844, 0.11986518978374079, -0.08535071729371944, 0.18457003763001978, 0.03173252336793777, 0.017480732497025395, 0.06030182952033074, 0.2023821185695741, 0.1536993215230971, 0.1551674781310739, -0.026907896119254558, -0.08789969252627061, -0.258673010659263, -0.12478357191889011, -0.18874483575310672, 0.020633087713610044, -0.11281610442489512, -0.14401924000544983, 0.30170234354833764, 0.17709061494097114, 0.19044016326749416, 0.18002172905288524, 0.27722972022990383, 0.10119263415831621, 0.026026339523818796, 0.19946783517741346, 0.2058587636869175, 0.0645685631922926, 0.04146168642945475, -0.22652895736056522, 0.12809038668814482, 0.04136513583220993] |
1,802.04021 | Field theoretical derivation of L\"uscher's formula and calculation of
finite volume form factors | We initiate a systematic method to calculate both the finite volume energy
levels and form factors from the momentum space finite volume two-point
function. By expanding the two point function in the volume we extracted the
leading exponential volume correction both to the energy of a moving particle
state and to the simplest non-diagonal form factor. The form factor corrections
are given in terms of a regularized infinite volume 3-particle form factor and
terms related to the L\"usher correction of the momentum quantization. We
tested these results against second order Lagrangian and Hamiltonian
perturbation theory in the sinh-Gordon theory and we obtained perfect
agreement.
| hep-th | we initiate a systematic method to calculate both the finite volume energy levels and form factors from the momentum space finite volume twopoint function by expanding the two point function in the volume we extracted the leading exponential volume correction both to the energy of a moving particle state and to the simplest nondiagonal form factor the form factor corrections are given in terms of a regularized infinite volume 3particle form factor and terms related to the lusher correction of the momentum quantization we tested these results against second order lagrangian and hamiltonian perturbation theory in the sinhgordon theory and we obtained perfect agreement | [['we', 'initiate', 'a', 'systematic', 'method', 'to', 'calculate', 'both', 'the', 'finite', 'volume', 'energy', 'levels', 'and', 'form', 'factors', 'from', 'the', 'momentum', 'space', 'finite', 'volume', 'twopoint', 'function', 'by', 'expanding', 'the', 'two', 'point', 'function', 'in', 'the', 'volume', 'we', 'extracted', 'the', 'leading', 'exponential', 'volume', 'correction', 'both', 'to', 'the', 'energy', 'of', 'a', 'moving', 'particle', 'state', 'and', 'to', 'the', 'simplest', 'nondiagonal', 'form', 'factor', 'the', 'form', 'factor', 'corrections', 'are', 'given', 'in', 'terms', 'of', 'a', 'regularized', 'infinite', 'volume', '3particle', 'form', 'factor', 'and', 'terms', 'related', 'to', 'the', 'lusher', 'correction', 'of', 'the', 'momentum', 'quantization', 'we', 'tested', 'these', 'results', 'against', 'second', 'order', 'lagrangian', 'and', 'hamiltonian', 'perturbation', 'theory', 'in', 'the', 'sinhgordon', 'theory', 'and', 'we', 'obtained', 'perfect', 'agreement']] | [-0.12215689370014633, 0.11860545807016584, -0.06770062020111184, 0.09171555003222938, -0.00712210500988966, -0.03744941144787635, 0.037425190002977615, 0.29139104873264354, -0.24362021821658486, -0.2744419740584607, 0.048958046092033886, -0.30566897088339406, -0.11053692190594469, 0.13403746581193096, 0.0014818048803135753, 0.06881070091912989, 0.017904538817954466, 0.057778236733821146, -0.13061923259654298, -0.23261412105057389, 0.34569394962790495, 0.05706774363688265, 0.2752589032215138, 0.08421487162391153, 0.1118965540618564, 0.007437063358688297, -0.05834769956373538, 0.08752402823050104, -0.1719078842926627, 0.10822857775761244, 0.20159973024139896, 0.02262548573064403, 0.21712998213031545, -0.4041481897808038, -0.175563111260999, 0.10616163853914119, 0.11027110382565297, 0.13311417769965864, -0.027259536597949382, -0.24018467906325197, 0.05558119929180695, -0.2257649549193537, -0.18382886469883558, -0.11248041831780799, -0.03743134573764669, -0.02112626674799965, -0.2569857344049244, 0.13243527930283633, -0.006914450095232146, -0.008779450798801217, -0.07716061041439669, -0.13148958717759412, 0.006403844013290767, 0.1260592131024728, 0.04677871078064737, 0.0743514462866677, 0.12045695433894602, -0.1511366496964071, -0.05044187979701047, 0.38428242943728735, -0.1041947559021467, -0.2645406293002172, 0.08865673223940226, -0.16727739204921258, -0.07292970577971293, 0.15771386510011956, 0.1750698086599676, 0.08423759463151398, -0.12473991547281352, 0.09943361324426056, 0.03181432443223177, 0.14800957767790981, 0.08283337987869835, 0.021263817042521484, 0.12420201638283637, 0.05532997918467467, 0.006695220394668957, 0.15011252142665818, -0.06362636550329626, -0.17813375192277958, -0.38438573996245395, -0.13819743500341877, -0.16108705006571164, 0.058957440089076184, -0.14287769156348637, -0.19836061062344995, 0.3902999156002457, 0.04431160966543338, 0.2046440101157014, 0.05087233679548193, 0.28489298194360274, 0.18850192059135923, 0.07704690651735291, 0.08748471773532611, 0.20382294515506005, 0.1389372335420026, 0.0357479248330212, -0.25528257728868853, -0.028891308510747667, 0.16592672554095492] |
1,802.04022 | Controllability Analysis of Threshold Graphs and Cographs | In this paper, we investigate the controllability of a linear time-invariant
network following a Laplacian dynamics defined on a threshold graph. In this
direction, an algorithm for deriving the modal matrix associated with the
Laplacian matrix for this class of graphs is presented. Then, based on the
Popov-Belevitch-Hautus criteria, a procedure for the selection of control nodes
is proposed. The procedure involves partitioning the nodes of the graph into
cells with the same degree; one node from each cell is then selected. We show
that the remaining nodes can be chosen as the control nodes rendering the
network controllable. Finally, we consider a wider class of graphs, namely
cographs, and examine their controllability properties.
| math.OC | in this paper we investigate the controllability of a linear timeinvariant network following a laplacian dynamics defined on a threshold graph in this direction an algorithm for deriving the modal matrix associated with the laplacian matrix for this class of graphs is presented then based on the popovbelevitchhautus criteria a procedure for the selection of control nodes is proposed the procedure involves partitioning the nodes of the graph into cells with the same degree one node from each cell is then selected we show that the remaining nodes can be chosen as the control nodes rendering the network controllable finally we consider a wider class of graphs namely cographs and examine their controllability properties | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'controllability', 'of', 'a', 'linear', 'timeinvariant', 'network', 'following', 'a', 'laplacian', 'dynamics', 'defined', 'on', 'a', 'threshold', 'graph', 'in', 'this', 'direction', 'an', 'algorithm', 'for', 'deriving', 'the', 'modal', 'matrix', 'associated', 'with', 'the', 'laplacian', 'matrix', 'for', 'this', 'class', 'of', 'graphs', 'is', 'presented', 'then', 'based', 'on', 'the', 'popovbelevitchhautus', 'criteria', 'a', 'procedure', 'for', 'the', 'selection', 'of', 'control', 'nodes', 'is', 'proposed', 'the', 'procedure', 'involves', 'partitioning', 'the', 'nodes', 'of', 'the', 'graph', 'into', 'cells', 'with', 'the', 'same', 'degree', 'one', 'node', 'from', 'each', 'cell', 'is', 'then', 'selected', 'we', 'show', 'that', 'the', 'remaining', 'nodes', 'can', 'be', 'chosen', 'as', 'the', 'control', 'nodes', 'rendering', 'the', 'network', 'controllable', 'finally', 'we', 'consider', 'a', 'wider', 'class', 'of', 'graphs', 'namely', 'cographs', 'and', 'examine', 'their', 'controllability', 'properties']] | [-0.15343051557058254, 0.05660194966777751, -0.020677848100925968, 0.0013476351278100525, -0.08457935626198233, -0.14299144170997022, 0.07170326108693978, 0.38516010624249425, -0.30714315940848497, -0.25895862962094557, 0.10343659912911862, -0.24185774507479066, -0.1986599205810251, 0.11934269270736032, -0.08166606453313302, 0.055318773802435765, 0.08963042824215924, 0.10222994242753602, -0.019293607437191943, -0.21840945895466607, 0.35481402171627346, 0.021616530579935133, 0.2560867335929626, 0.015319338999688625, 0.12546549975435226, 0.03748347368750688, -0.013015430482450576, 0.07928923213549485, -0.12811847417070624, 0.12441074742268013, 0.23735501200982692, 0.15713471326713277, 0.31761109898180034, -0.4036689544574613, -0.20485375604007097, 0.15369164775562497, 0.11966952480029612, 0.11510798297163131, -0.004081527993033549, -0.2705220192077413, 0.1431895078188715, -0.12290161308578516, -0.08996368849864311, -0.002388436870600006, -0.020800896947049594, 0.05107538723304406, -0.2925164350102433, -0.000236168639750871, 0.06863102151814486, 0.018637709822340878, -0.03388404047561694, -0.10082962794385983, -0.030502368003723367, 0.12472169862779896, -0.05421571799788822, -0.04572083047010103, 0.10356911496811472, -0.10037377542832586, -0.1524453052294861, 0.36556187468226503, 0.028740575416034204, -0.2388909086502627, 0.11712381604902314, -0.07066067342803015, -0.16426217904421542, 0.04741417422305496, 0.21516289510681763, 0.1360130761337953, -0.17386858913206818, 0.06511285254037404, -0.06858147682407789, 0.14675752369406742, 0.04040180993126293, 0.021282458125687805, 0.11500193048021302, 0.21464396941483813, 0.163042189116565, 0.20105926901724322, -0.06710083157996508, -0.058009627250443514, -0.2932185525717461, -0.1453269561835095, -0.23543014814067567, 0.010448371098310877, -0.1599782336526705, -0.1891801332543909, 0.5161861995218602, 0.1244287146554139, 0.2326768826594395, 0.11579603806500678, 0.2508762615807025, 0.13598677831335174, 0.05824057279904533, 0.1282110273285843, 0.17643696264223716, 0.15814909478237407, 0.050257922611735034, -0.21492690674494952, 0.09116552515054303, 0.10816205422336285] |
1,802.04023 | Fair and Diverse DPP-based Data Summarization | Sampling methods that choose a subset of the data proportional to its
diversity in the feature space are popular for data summarization. However,
recent studies have noted the occurrence of bias (under- or over-representation
of a certain gender or race) in such data summarization methods. In this paper
we initiate a study of the problem of outputting a diverse and fair summary of
a given dataset. We work with a well-studied determinantal measure of diversity
and corresponding distributions (DPPs) and present a framework that allows us
to incorporate a general class of fairness constraints into such distributions.
Coming up with efficient algorithms to sample from these constrained
determinantal distributions, however, suffers from a complexity barrier and we
present a fast sampler that is provably good when the input vectors satisfy a
natural property. Our experimental results on a real-world and an image dataset
show that the diversity of the samples produced by adding fairness constraints
is not too far from the unconstrained case, and we also provide a theoretical
explanation of it.
| cs.LG cs.CY cs.IR stat.ML | sampling methods that choose a subset of the data proportional to its diversity in the feature space are popular for data summarization however recent studies have noted the occurrence of bias under or overrepresentation of a certain gender or race in such data summarization methods in this paper we initiate a study of the problem of outputting a diverse and fair summary of a given dataset we work with a wellstudied determinantal measure of diversity and corresponding distributions dpps and present a framework that allows us to incorporate a general class of fairness constraints into such distributions coming up with efficient algorithms to sample from these constrained determinantal distributions however suffers from a complexity barrier and we present a fast sampler that is provably good when the input vectors satisfy a natural property our experimental results on a realworld and an image dataset show that the diversity of the samples produced by adding fairness constraints is not too far from the unconstrained case and we also provide a theoretical explanation of it | [['sampling', 'methods', 'that', 'choose', 'a', 'subset', 'of', 'the', 'data', 'proportional', 'to', 'its', 'diversity', 'in', 'the', 'feature', 'space', 'are', 'popular', 'for', 'data', 'summarization', 'however', 'recent', 'studies', 'have', 'noted', 'the', 'occurrence', 'of', 'bias', 'under', 'or', 'overrepresentation', 'of', 'a', 'certain', 'gender', 'or', 'race', 'in', 'such', 'data', 'summarization', 'methods', 'in', 'this', 'paper', 'we', 'initiate', 'a', 'study', 'of', 'the', 'problem', 'of', 'outputting', 'a', 'diverse', 'and', 'fair', 'summary', 'of', 'a', 'given', 'dataset', 'we', 'work', 'with', 'a', 'wellstudied', 'determinantal', 'measure', 'of', 'diversity', 'and', 'corresponding', 'distributions', 'dpps', 'and', 'present', 'a', 'framework', 'that', 'allows', 'us', 'to', 'incorporate', 'a', 'general', 'class', 'of', 'fairness', 'constraints', 'into', 'such', 'distributions', 'coming', 'up', 'with', 'efficient', 'algorithms', 'to', 'sample', 'from', 'these', 'constrained', 'determinantal', 'distributions', 'however', 'suffers', 'from', 'a', 'complexity', 'barrier', 'and', 'we', 'present', 'a', 'fast', 'sampler', 'that', 'is', 'provably', 'good', 'when', 'the', 'input', 'vectors', 'satisfy', 'a', 'natural', 'property', 'our', 'experimental', 'results', 'on', 'a', 'realworld', 'and', 'an', 'image', 'dataset', 'show', 'that', 'the', 'diversity', 'of', 'the', 'samples', 'produced', 'by', 'adding', 'fairness', 'constraints', 'is', 'not', 'too', 'far', 'from', 'the', 'unconstrained', 'case', 'and', 'we', 'also', 'provide', 'a', 'theoretical', 'explanation', 'of', 'it']] | [-0.056600108608024106, 0.02453236675797217, -0.11280856922615407, 0.09228926067454415, -0.09899551715690989, -0.12842874254978554, 0.09608289478468536, 0.40405871803590726, -0.2692588831048979, -0.3306672896994928, 0.08773693295201114, -0.28588354253613857, -0.1408530427982251, 0.19684906170681812, -0.10978291364289214, 0.05936592705189088, 0.11763336383439817, 0.03310874440902871, -0.06692689039939365, -0.26365752660582753, 0.32638788492916976, 0.052342704134495106, 0.3082631233183472, 0.021918000589425373, 0.13016366801525162, -0.0249371362720118, -0.04379821450958505, 0.052388471670192935, -0.1300802124551833, 0.15079544272563464, 0.26467229642223045, 0.23000362646755176, 0.3125006170336937, -0.36782441130644866, -0.19692801443933033, 0.14282185880488954, 0.1191536343499455, 0.1177869430515742, -0.10475404489430772, -0.25454554246429917, 0.0811020498777209, -0.16366982495081936, -0.04860405197778587, -0.09523020014924885, -0.008941770734287105, 0.02888745795339779, -0.3329332249190355, 0.04549687968273945, 0.09035163517225112, 0.05877899050950831, -0.026559604663160888, -0.12940677870701198, 0.02583327331054999, 0.11031141202456216, 0.07762389891438436, 0.03435021782494258, 0.07956742522371717, -0.14459571925020331, -0.13149656182517797, 0.4000258262845861, -0.031056645483341673, -0.2026819607054613, 0.20432211182805773, -0.10050314452315053, -0.17975917104415076, 0.12345288137818665, 0.20175961254578798, 0.1312914873706177, -0.15735569527431265, 0.04507355471913226, -0.0957767008072805, 0.1316131802876805, 0.021796297382151837, 0.045548385747256254, 0.17493188414765998, 0.19560912904616576, 0.07432682723278007, 0.15327278554993196, -0.08586871799834203, -0.0756731023511113, -0.26616449884225635, -0.11735538880172901, -0.18135389319734735, 0.02056048691841614, -0.0802690520671773, -0.16061743550262478, 0.3863945699941237, 0.20290652486403624, 0.24222844270556126, 0.10490538025556435, 0.29328228069637186, 0.059198451946559906, 0.0749897853421253, 0.06071926605668417, 0.15158173173387146, 0.05162137048454349, 0.06889351239958562, -0.15578574569202785, 0.09579128708465696, -0.022587294035136353] |
1,802.04024 | Universal Noise in Continuous Transport Measurements of Interacting
Fermions | We propose and analyze continuous measurements of atom number and atomic
currents using dispersive probing in an optical cavity. For an atom-number
measurement in a closed system, we relate both the detection noise and the
heating rate due to measurement back-action to Tan's contact, and identify an
emergent universal quantum non-demolition (QND) regime in the good-cavity
limit. We then show that such a continuous QND measurement of atom number
serves as a quantum-limited current transducer in a two-terminal setup. We
derive a universal bound on the precision of current measurement, which results
from a tradeoff between detection noise and back-action of the atomic current
measurement. Our results apply regardless of the strength of interaction or the
state of matter and set fundamental bounds on future precision measurements of
transport properties in cold-atom quantum simulators.
| cond-mat.quant-gas | we propose and analyze continuous measurements of atom number and atomic currents using dispersive probing in an optical cavity for an atomnumber measurement in a closed system we relate both the detection noise and the heating rate due to measurement backaction to tans contact and identify an emergent universal quantum nondemolition qnd regime in the goodcavity limit we then show that such a continuous qnd measurement of atom number serves as a quantumlimited current transducer in a twoterminal setup we derive a universal bound on the precision of current measurement which results from a tradeoff between detection noise and backaction of the atomic current measurement our results apply regardless of the strength of interaction or the state of matter and set fundamental bounds on future precision measurements of transport properties in coldatom quantum simulators | [['we', 'propose', 'and', 'analyze', 'continuous', 'measurements', 'of', 'atom', 'number', 'and', 'atomic', 'currents', 'using', 'dispersive', 'probing', 'in', 'an', 'optical', 'cavity', 'for', 'an', 'atomnumber', 'measurement', 'in', 'a', 'closed', 'system', 'we', 'relate', 'both', 'the', 'detection', 'noise', 'and', 'the', 'heating', 'rate', 'due', 'to', 'measurement', 'backaction', 'to', 'tans', 'contact', 'and', 'identify', 'an', 'emergent', 'universal', 'quantum', 'nondemolition', 'qnd', 'regime', 'in', 'the', 'goodcavity', 'limit', 'we', 'then', 'show', 'that', 'such', 'a', 'continuous', 'qnd', 'measurement', 'of', 'atom', 'number', 'serves', 'as', 'a', 'quantumlimited', 'current', 'transducer', 'in', 'a', 'twoterminal', 'setup', 'we', 'derive', 'a', 'universal', 'bound', 'on', 'the', 'precision', 'of', 'current', 'measurement', 'which', 'results', 'from', 'a', 'tradeoff', 'between', 'detection', 'noise', 'and', 'backaction', 'of', 'the', 'atomic', 'current', 'measurement', 'our', 'results', 'apply', 'regardless', 'of', 'the', 'strength', 'of', 'interaction', 'or', 'the', 'state', 'of', 'matter', 'and', 'set', 'fundamental', 'bounds', 'on', 'future', 'precision', 'measurements', 'of', 'transport', 'properties', 'in', 'coldatom', 'quantum', 'simulators']] | [-0.16417283564110968, 0.17595055705201795, -0.038627259829429106, -0.028027802104575197, 0.012384632817789246, -0.16956167674359324, 0.1197382784717883, 0.3306896575490263, -0.26310893098663873, -0.2958771973681539, 0.04713629180853909, -0.2759459434674858, -0.08759263526637857, 0.273939836353286, -0.036768257895957175, 0.10605491985872721, 0.050891848107271674, 0.03828108318170894, -0.06558048861872738, -0.1599274200713957, 0.2789015598289335, 0.06146777351213091, 0.30731650324427146, 0.07949350100469345, 0.13569589502372736, 0.03805023685980366, 0.009380540827900838, -0.0015914107954351983, -0.14509056071902204, 0.06356293932587315, 0.2320353790910032, 0.061847034744473534, 0.21125102005273438, -0.4360590902115427, -0.17502336629054774, 0.11078076327998024, 0.11273992666279647, 0.19895975397284657, -0.051032488712165223, -0.32870828678636854, -0.039766105328453705, -0.17859141197778397, -0.07796081912064397, -0.1183272562087027, -0.01681618794187236, 0.015225339090145791, -0.2807159479481599, 0.06172511093761535, 0.04664001818364069, 0.04920688796260241, -0.0405013731640847, -0.01680103125339096, 0.0761488320535299, 0.10725254029793137, -0.08420694088771828, 0.005943541686092295, 0.22067533343432666, -0.18150629839032834, -0.1477990932727872, 0.33487279641914613, -0.14362408970908344, -0.18493430932928154, 0.18859217077521467, -0.1562546093343521, -0.08607719181480804, 0.044890203181334506, 0.16528162715692463, 0.061626626816300205, -0.13811090077732258, 0.03345470636155206, -0.023995190358428814, 0.20985456763196791, 0.03696063464966172, 0.14880830480772725, 0.2123433627855422, 0.19147102604967667, 0.1024241855076111, 0.12738633840761857, -0.14626426808188545, -0.04576652264222503, -0.3289733391149042, -0.18688880736155977, -0.20898611179149862, 0.11344223758275274, -0.05452977465887019, -0.13171945619240485, 0.36722225439387246, 0.21089309949858753, 0.19099030644809914, 0.01456864870504351, 0.36506346752172086, 0.13651072028983097, -0.006852169521152973, 0.001045620490261701, 0.3103307056902741, 0.2077970205486488, 0.04073006522827851, -0.30940071864699975, 0.025650066688462203, -0.0019348668222968926] |
1,802.04025 | Can effective muon g-2 depend on the gravitational potential? | Contrary to the claim in a series of recent papers, we show that it cannot. A
source of the error in those papers is misinterpretation of coordinate time as
a physical time.
| hep-ph gr-qc | contrary to the claim in a series of recent papers we show that it cannot a source of the error in those papers is misinterpretation of coordinate time as a physical time | [['contrary', 'to', 'the', 'claim', 'in', 'a', 'series', 'of', 'recent', 'papers', 'we', 'show', 'that', 'it', 'can', 'not', 'a', 'source', 'of', 'the', 'error', 'in', 'those', 'papers', 'is', 'misinterpretation', 'of', 'coordinate', 'time', 'as', 'a', 'physical', 'time']] | [-0.1381468131686702, 0.03111586214579416, -0.15370588986711067, 0.02532349314159629, -0.07309048684934775, -0.0407185049473562, 0.0723949975588105, 0.3685405532067472, -0.23115692310261005, -0.2864073407695149, 0.11443917029255042, -0.2808140639328595, -0.15315208121231108, 0.21843858469616284, -0.13864474467030077, 0.05650896076677424, 0.07621081382261985, 0.07046848038832347, -0.0737568715121597, -0.3119420234226819, 0.2884323828373895, 0.09572997243341172, 0.24615490047091787, 0.02618947220176007, 0.02685739506374706, -0.08091547688695067, -0.09827388134418112, 0.058938568965955215, -0.05359923391656731, 0.05790134375406937, 0.2627741436502247, 0.14381807620608897, 0.3481277853927829, -0.42260616557729064, -0.23303771284267757, 0.0768839493111679, 0.13733236841631657, 0.17592792117008657, -0.017953703095289795, -0.23854264938695866, 0.03621350254186175, -0.17968474909888976, -0.10149750693447211, -0.015600326527474504, 0.08018232125676039, 0.05826734109414798, -0.23458443826177355, 0.10467939138073813, 0.09786497654788422, 0.03585883699865504, -0.019405594152031524, -0.05284125927948591, 0.034297913905571804, 0.0978715275978726, 0.1363531015460577, 0.07708261622059526, 0.0819669566399446, -0.07048470786575114, -0.15840393022605867, 0.38958930715241213, -0.10393151765068372, -0.19253195353755445, 0.1909583561178861, -0.1723403608652227, -0.16803870948426652, 0.07701245304479291, 0.1473502443369591, 0.11356757694121564, -0.1490792925046249, 0.05596003345580715, -0.10114670341665094, 0.1917612524703145, 0.05188288248962525, 0.028667404810248903, 0.16052166045163618, 0.11990694679094083, 0.0038022671289967766, 0.06381240351633592, -0.04737999070097099, -0.06364118951288136, -0.3619243829990878, -0.2082057147653717, -0.24166754641654817, 0.07156473029251421, 0.010830513864868519, -0.15704566133067463, 0.39808445954413124, 0.19580858566262055, 0.22435604174141632, 0.02610317485011888, 0.2469327917153185, 0.09654884360321431, 0.07590545028109442, 0.05510745605340961, 0.2423321484503421, 0.026997349500148135, 0.1434393809035872, -0.12867163597239237, 0.11252269170345795, 0.048674790358001534] |
1,802.04026 | Multipliers between range spaces of co-analytic Toeplitz operators | In this paper we discuss the multipliers between range spaces of co-analytic
Toeplitz operators.
| math.CV math.FA | in this paper we discuss the multipliers between range spaces of coanalytic toeplitz operators | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'multipliers', 'between', 'range', 'spaces', 'of', 'coanalytic', 'toeplitz', 'operators']] | [-0.17142029006832413, 0.13109800079837441, 0.05821969572986875, 0.1542921233506474, -0.0681687746629385, 0.0203195506972926, 0.0017547554951826377, 0.4602144828864506, -0.3611572714788573, -0.1367275608437402, 0.17661613371456042, -0.25908157003245186, -0.19908165080206736, 0.20335587187271034, -0.21343544857310398, 0.016195417514869144, 0.02439850116414683, -0.055205053250704496, -0.33218781077968224, -0.2019912994333676, 0.5564094364110913, -0.03788052179983684, 0.14741893511797702, 0.08641814600144114, 0.05514457988153611, 0.03753029711411467, -0.03491688799113035, -0.15661255243633473, -0.1470235479729516, 0.18295612412371806, 0.37309344937758787, 0.11287033651024103, 0.3225322280611311, -0.3705769452665533, -0.10508547483810357, 0.2886023726314306, 0.2147503847123257, -0.11228874937764236, -0.062479528465441296, -0.30901878007820677, 0.044100784097931216, -0.2599014764917748, -0.07292277938021081, -0.10696483270398208, 0.015516785771719046, 0.044984382178102224, -0.2990218475461006, 0.004866549911509667, 0.1282121944906456, 0.08970094532040614, -0.1687642051173108, -0.08693686074444226, 0.09379415001188006, 0.06887684868914741, 0.021928449161350727, -0.07183209716874574, 0.04181827195653958, 0.08314408869149961, -0.0986201096592205, 0.269698364926236, -0.0371525984789644, -0.2809760086238384, 0.13526952213474683, -0.284331351518631, -0.16877621758197034, -0.1028691546193191, 0.17502373696437903, 0.20722881970661028, -0.11958444517638002, 0.23483948802043283, -0.1486895114316472, 0.10563790505485875, 0.08087297775117415, 0.16102104341345175, 0.06514873914420605, 0.07979590232883181, 0.20025683204377337, 0.17601659015261767, 0.0561335634972368, -0.011526173192708353, -0.35867251668657574, -0.19965611211955547, -0.13243522295462234, -0.05644518296633448, -0.1410478071442672, -0.21231692031558072, 0.46261426380702425, 0.24757976721905703, 0.19151920106794154, 0.13006901468283363, 0.1841371865676982, 0.1087235300136464, 0.033184828502791267, 0.05441099112587316, 0.14632821907954557, 0.2425903600773641, 0.16650677166346992, -0.13009300914459995, -0.11373198880547923, 0.2920978568893458] |
1,802.04027 | Cosmological simulation with dust formation and destruction | To investigate the evolution of dust in a cosmological volume, we perform
hydrodynamic simulations, in which the enrichment of metals and dust is treated
self-consistently with star formation and stellar feedback. We consider dust
evolution driven by dust production in stellar ejecta, dust destruction by
sputtering, grain growth by accretion and coagulation, and grain disruption by
shattering, and treat small and large grains separately to trace the grain size
distribution. After confirming that our model nicely reproduces the observed
relation between dust-to-gas ratio and metallicity for nearby galaxies, we
concentrate on the dust abundance over the cosmological volume in this paper.
The comoving dust mass density has a peak at redshift $z\sim 1$--2, coincident
with the observationally suggested dustiest epoch in the Universe. {In the
local Universe}, roughly 10 per cent of the dust is contained in the
intergalactic medium (IGM), where only 1/3--1/4 of the dust survives against
dust destruction by sputtering. We also show that the dust mass function is
roughly reproduced at $\lesssim 10^8$ M$_\odot$, while the massive end still
has a discrepancy, which indicates {the necessity of stronger feedback in
massive galaxies}. %%The relation showed that accretion is essential for dusty
galaxies. In addition, our model broadly reproduces the observed radial profile
of dust surface density in the circum-galactic medium (CGM). While our model
satisfies the observational constraints for the dust extinction {on
cosmological scales}, it predicts that the dust in the CGM and IGM is dominated
by large ($> 0.03~\mu$m) grains, which is in tension with the steep reddening
curves {observed} in the CGM.
| astro-ph.GA astro-ph.CO | to investigate the evolution of dust in a cosmological volume we perform hydrodynamic simulations in which the enrichment of metals and dust is treated selfconsistently with star formation and stellar feedback we consider dust evolution driven by dust production in stellar ejecta dust destruction by sputtering grain growth by accretion and coagulation and grain disruption by shattering and treat small and large grains separately to trace the grain size distribution after confirming that our model nicely reproduces the observed relation between dusttogas ratio and metallicity for nearby galaxies we concentrate on the dust abundance over the cosmological volume in this paper the comoving dust mass density has a peak at redshift zsim 12 coincident with the observationally suggested dustiest epoch in the universe in the local universe roughly 10 per cent of the dust is contained in the intergalactic medium igm where only 1314 of the dust survives against dust destruction by sputtering we also show that the dust mass function is roughly reproduced at lesssim 108 m_odot while the massive end still has a discrepancy which indicates the necessity of stronger feedback in massive galaxies the relation showed that accretion is essential for dusty galaxies in addition our model broadly reproduces the observed radial profile of dust surface density in the circumgalactic medium cgm while our model satisfies the observational constraints for the dust extinction on cosmological scales it predicts that the dust in the cgm and igm is dominated by large 003mum grains which is in tension with the steep reddening curves observed in the cgm | [['to', 'investigate', 'the', 'evolution', 'of', 'dust', 'in', 'a', 'cosmological', 'volume', 'we', 'perform', 'hydrodynamic', 'simulations', 'in', 'which', 'the', 'enrichment', 'of', 'metals', 'and', 'dust', 'is', 'treated', 'selfconsistently', 'with', 'star', 'formation', 'and', 'stellar', 'feedback', 'we', 'consider', 'dust', 'evolution', 'driven', 'by', 'dust', 'production', 'in', 'stellar', 'ejecta', 'dust', 'destruction', 'by', 'sputtering', 'grain', 'growth', 'by', 'accretion', 'and', 'coagulation', 'and', 'grain', 'disruption', 'by', 'shattering', 'and', 'treat', 'small', 'and', 'large', 'grains', 'separately', 'to', 'trace', 'the', 'grain', 'size', 'distribution', 'after', 'confirming', 'that', 'our', 'model', 'nicely', 'reproduces', 'the', 'observed', 'relation', 'between', 'dusttogas', 'ratio', 'and', 'metallicity', 'for', 'nearby', 'galaxies', 'we', 'concentrate', 'on', 'the', 'dust', 'abundance', 'over', 'the', 'cosmological', 'volume', 'in', 'this', 'paper', 'the', 'comoving', 'dust', 'mass', 'density', 'has', 'a', 'peak', 'at', 'redshift', 'zsim', '12', 'coincident', 'with', 'the', 'observationally', 'suggested', 'dustiest', 'epoch', 'in', 'the', 'universe', 'in', 'the', 'local', 'universe', 'roughly', '10', 'per', 'cent', 'of', 'the', 'dust', 'is', 'contained', 'in', 'the', 'intergalactic', 'medium', 'igm', 'where', 'only', '1314', 'of', 'the', 'dust', 'survives', 'against', 'dust', 'destruction', 'by', 'sputtering', 'we', 'also', 'show', 'that', 'the', 'dust', 'mass', 'function', 'is', 'roughly', 'reproduced', 'at', 'lesssim', '108', 'm_odot', 'while', 'the', 'massive', 'end', 'still', 'has', 'a', 'discrepancy', 'which', 'indicates', 'the', 'necessity', 'of', 'stronger', 'feedback', 'in', 'massive', 'galaxies', 'the', 'relation', 'showed', 'that', 'accretion', 'is', 'essential', 'for', 'dusty', 'galaxies', 'in', 'addition', 'our', 'model', 'broadly', 'reproduces', 'the', 'observed', 'radial', 'profile', 'of', 'dust', 'surface', 'density', 'in', 'the', 'circumgalactic', 'medium', 'cgm', 'while', 'our', 'model', 'satisfies', 'the', 'observational', 'constraints', 'for', 'the', 'dust', 'extinction', 'on', 'cosmological', 'scales', 'it', 'predicts', 'that', 'the', 'dust', 'in', 'the', 'cgm', 'and', 'igm', 'is', 'dominated', 'by', 'large', '003mum', 'grains', 'which', 'is', 'in', 'tension', 'with', 'the', 'steep', 'reddening', 'curves', 'observed', 'in', 'the', 'cgm']] | [-0.029876256183822197, 0.14657771001031167, -0.049086952679465674, 0.09998286688066803, -0.006147110232336143, -0.022465599653881417, -0.00021053087137740597, 0.40097268575950445, -0.15832620470012113, -0.3321534374569969, 0.008170139058511126, -0.2711006814213253, 0.006096993939402376, 0.12554473218114598, -0.0206528940425767, -0.030405447813939456, -0.009907888005805282, -0.15970258687103037, 0.011611856149327707, -0.31804801321447673, 0.35255203222722364, 0.11112543666923, 0.1438646747465805, 0.03441604267031517, 0.07145405919814497, -0.1257299849102021, -0.10486920186487214, -0.009940145020156579, -0.20444343638457016, -0.0019041788121306358, 0.16898343220800738, 0.09564089115579115, 0.20172431561446122, -0.40109370911652725, -0.3043628685481399, 0.06591475969758029, 0.19995107650558297, 0.08240910069592831, -0.09733476653305251, -0.19620801723118178, 0.05446874405629211, -0.18365961496263397, -0.18041942552338505, 0.12046218154565684, 0.06943056889802449, -0.015714224913044604, -0.25581571142984033, 0.21568652311267328, 0.015348157095506267, 0.04599106250883102, -0.11349462749627816, -0.04386774101475066, -0.12822970159734462, 0.0051194746394699455, 0.039812434855451474, 0.05897624039834784, 0.2551645951295026, -0.1408047841910576, 0.07832466005961332, 0.4447946754219227, -0.1301770873328079, -0.0013920426117833848, 0.20317442520961973, -0.2713661849532139, -0.14897567519282764, 0.17038627569888568, 0.1408549522951267, 0.06620447920786954, -0.15373700373362056, 0.036958631665929574, -0.04482147425626109, 0.2174848002704698, 0.06660817000949971, 0.022248065286828565, 0.3485492508454147, 0.14395810278536852, 0.007939267057524778, 0.07734338165253632, -0.14649756900720703, -0.04696430421304391, -0.2496516803358934, -0.12568907154942394, -0.1598993671824253, 0.1010738037681828, -0.2159381867472133, -0.10195150768001701, 0.2627646697598488, 0.14165894585380026, 0.2641673943233386, 0.0966643093522934, 0.32537295418798695, 0.059782358790682846, 0.10382704223621665, 0.17276861118026396, 0.2934036787649862, 0.1769439690744562, 0.10673363388483521, -0.2871154427380381, 0.15017121705017233, 0.016473883587430238] |
1,802.04028 | Automatic Generation of Language-Independent Features for Cross-Lingual
Classification | Many applications require categorization of text documents using predefined
categories. The main approach to performing text categorization is learning
from labeled examples. For many tasks, it may be difficult to find examples in
one language but easy in others. The problem of learning from examples in one
or more languages and classifying (categorizing) in another is called
cross-lingual learning. In this work, we present a novel approach that solves
the general cross-lingual text categorization problem. Our method generates,
for each training document, a set of language-independent features. Using these
features for training yields a language-independent classifier. At the
classification stage, we generate language-independent features for the
unlabeled document, and apply the classifier on the new representation.
To build the feature generator, we utilize a hierarchical
language-independent ontology, where each concept has a set of support
documents for each language involved. In the preprocessing stage, we use the
support documents to build a set of language-independent feature generators,
one for each language. The collection of these generators is used to map any
document into the language-independent feature space.
Our methodology works on the most general cross-lingual text categorization
problems, being able to learn from any mix of languages and classify documents
in any other language. We also present a method for exploiting the hierarchical
structure of the ontology to create virtual supporting documents for languages
that do not have them. We tested our method, using Wikipedia as our ontology,
on the most commonly used test collections in cross-lingual text
categorization, and found that it outperforms existing methods.
| cs.CL | many applications require categorization of text documents using predefined categories the main approach to performing text categorization is learning from labeled examples for many tasks it may be difficult to find examples in one language but easy in others the problem of learning from examples in one or more languages and classifying categorizing in another is called crosslingual learning in this work we present a novel approach that solves the general crosslingual text categorization problem our method generates for each training document a set of languageindependent features using these features for training yields a languageindependent classifier at the classification stage we generate languageindependent features for the unlabeled document and apply the classifier on the new representation to build the feature generator we utilize a hierarchical languageindependent ontology where each concept has a set of support documents for each language involved in the preprocessing stage we use the support documents to build a set of languageindependent feature generators one for each language the collection of these generators is used to map any document into the languageindependent feature space our methodology works on the most general crosslingual text categorization problems being able to learn from any mix of languages and classify documents in any other language we also present a method for exploiting the hierarchical structure of the ontology to create virtual supporting documents for languages that do not have them we tested our method using wikipedia as our ontology on the most commonly used test collections in crosslingual text categorization and found that it outperforms existing methods | [['many', 'applications', 'require', 'categorization', 'of', 'text', 'documents', 'using', 'predefined', 'categories', 'the', 'main', 'approach', 'to', 'performing', 'text', 'categorization', 'is', 'learning', 'from', 'labeled', 'examples', 'for', 'many', 'tasks', 'it', 'may', 'be', 'difficult', 'to', 'find', 'examples', 'in', 'one', 'language', 'but', 'easy', 'in', 'others', 'the', 'problem', 'of', 'learning', 'from', 'examples', 'in', 'one', 'or', 'more', 'languages', 'and', 'classifying', 'categorizing', 'in', 'another', 'is', 'called', 'crosslingual', 'learning', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'approach', 'that', 'solves', 'the', 'general', 'crosslingual', 'text', 'categorization', 'problem', 'our', 'method', 'generates', 'for', 'each', 'training', 'document', 'a', 'set', 'of', 'languageindependent', 'features', 'using', 'these', 'features', 'for', 'training', 'yields', 'a', 'languageindependent', 'classifier', 'at', 'the', 'classification', 'stage', 'we', 'generate', 'languageindependent', 'features', 'for', 'the', 'unlabeled', 'document', 'and', 'apply', 'the', 'classifier', 'on', 'the', 'new', 'representation', 'to', 'build', 'the', 'feature', 'generator', 'we', 'utilize', 'a', 'hierarchical', 'languageindependent', 'ontology', 'where', 'each', 'concept', 'has', 'a', 'set', 'of', 'support', 'documents', 'for', 'each', 'language', 'involved', 'in', 'the', 'preprocessing', 'stage', 'we', 'use', 'the', 'support', 'documents', 'to', 'build', 'a', 'set', 'of', 'languageindependent', 'feature', 'generators', 'one', 'for', 'each', 'language', 'the', 'collection', 'of', 'these', 'generators', 'is', 'used', 'to', 'map', 'any', 'document', 'into', 'the', 'languageindependent', 'feature', 'space', 'our', 'methodology', 'works', 'on', 'the', 'most', 'general', 'crosslingual', 'text', 'categorization', 'problems', 'being', 'able', 'to', 'learn', 'from', 'any', 'mix', 'of', 'languages', 'and', 'classify', 'documents', 'in', 'any', 'other', 'language', 'we', 'also', 'present', 'a', 'method', 'for', 'exploiting', 'the', 'hierarchical', 'structure', 'of', 'the', 'ontology', 'to', 'create', 'virtual', 'supporting', 'documents', 'for', 'languages', 'that', 'do', 'not', 'have', 'them', 'we', 'tested', 'our', 'method', 'using', 'wikipedia', 'as', 'our', 'ontology', 'on', 'the', 'most', 'commonly', 'used', 'test', 'collections', 'in', 'crosslingual', 'text', 'categorization', 'and', 'found', 'that', 'it', 'outperforms', 'existing', 'methods']] | [0.010089501065067452, -0.017821514603383548, -0.06757894992006186, 0.10952453723893996, -0.1907001083582145, -0.16048914050224994, 0.05907658764044754, 0.44018103876442183, -0.2877057103205516, -0.307740109079532, 0.029432905298563128, -0.2907072530733785, -0.1404041829673588, 0.23125208491262583, -0.11675532755270979, 0.028564872302467847, 0.14838082335108993, 0.10137248622595507, -0.03339769707145024, -0.2888352638192373, 0.3701332457276294, -0.03599376750935335, 0.3398344680390437, -0.023914271550893318, 0.11296630326341983, -0.03627807410157402, -0.08466897908124338, -0.029785123812075653, -0.032806433156537196, 0.20379092645362107, 0.42124359557510616, 0.2878029879866517, 0.2989802194715594, -0.3516183965621167, -0.1818851242423989, 0.07236552857648348, 0.13706569897476584, 0.16179366785945604, -0.038521995346684434, -0.34829590527442633, 0.11693483519957226, -0.17929459844890516, 0.045546039149485296, -0.17916620127334681, 0.00849315164714426, -0.038753597397089834, -0.2618381555560063, -0.024179518824098523, 0.13695781467140478, 0.08209102911132504, -0.0401109678832654, -0.10219720065742877, 0.04326970254714979, 0.17164257515196368, 0.015504999658332963, 0.06685380727776646, 0.11956911080142163, -0.14243329149371675, -0.18332647923307377, 0.4133216925911256, -0.02630945687633357, -0.24772427865536883, 0.2317341423513426, 0.0033520095348649193, -0.23340324728633277, 0.06188118415593635, 0.21949787679022847, 0.11618383536915644, -0.18269461377190055, 0.013520066718228918, -0.05859161151965964, 0.23303267010987838, 0.07736221671439125, -0.04068558655808374, 0.1797657508395787, 0.27188273611682234, -0.0006714620526508952, 0.13570196373598264, -0.07417054988047767, -0.0009288840524277475, -0.26896962757655274, -0.15893645734831807, -0.19936967819012352, -0.07418863615652072, -0.09093406670194781, -0.1995505952625649, 0.4191165868387543, 0.26533754900674467, 0.1894880393292624, 0.08487711943757859, 0.2960133056185441, -0.0002473261664022175, 0.13954700407268206, 0.10638135100271029, 0.08792631409232854, -0.035734926039367565, 0.13183177230712317, -0.09527751814857766, 0.08326214964017709, 0.10933756775784786] |
1,802.04029 | Growth Modes and Chiral Selectivity of Single-Walled Carbon Nanotubes | Chemical vapor deposition synthesis of single-walled carbon nanotubes
experiments, using Fe catalyst, and alternating methane and carbon monoxide as
carbon feedstocks, lead to the reversible formation of junctions between tubes
of different diameters. Combined with an atomistic modeling of the tube /
catalyst interface, this shows that the ratio of diameters of the tube and its
seeding particle, denoting the growth mode, depends on the carbon fraction
inside the catalyst. With carbon monoxide, nanoparticles are strongly carbon
enriched, and tend to dewet the tube, in a perpendicular growth mode.
Cross-checking our results with available reports from the literature of the
last decade strongly suggests that these latter conditions should favor the
near armchair chiral selectivity observed empirically.
| physics.chem-ph physics.app-ph | chemical vapor deposition synthesis of singlewalled carbon nanotubes experiments using fe catalyst and alternating methane and carbon monoxide as carbon feedstocks lead to the reversible formation of junctions between tubes of different diameters combined with an atomistic modeling of the tube catalyst interface this shows that the ratio of diameters of the tube and its seeding particle denoting the growth mode depends on the carbon fraction inside the catalyst with carbon monoxide nanoparticles are strongly carbon enriched and tend to dewet the tube in a perpendicular growth mode crosschecking our results with available reports from the literature of the last decade strongly suggests that these latter conditions should favor the near armchair chiral selectivity observed empirically | [['chemical', 'vapor', 'deposition', 'synthesis', 'of', 'singlewalled', 'carbon', 'nanotubes', 'experiments', 'using', 'fe', 'catalyst', 'and', 'alternating', 'methane', 'and', 'carbon', 'monoxide', 'as', 'carbon', 'feedstocks', 'lead', 'to', 'the', 'reversible', 'formation', 'of', 'junctions', 'between', 'tubes', 'of', 'different', 'diameters', 'combined', 'with', 'an', 'atomistic', 'modeling', 'of', 'the', 'tube', 'catalyst', 'interface', 'this', 'shows', 'that', 'the', 'ratio', 'of', 'diameters', 'of', 'the', 'tube', 'and', 'its', 'seeding', 'particle', 'denoting', 'the', 'growth', 'mode', 'depends', 'on', 'the', 'carbon', 'fraction', 'inside', 'the', 'catalyst', 'with', 'carbon', 'monoxide', 'nanoparticles', 'are', 'strongly', 'carbon', 'enriched', 'and', 'tend', 'to', 'dewet', 'the', 'tube', 'in', 'a', 'perpendicular', 'growth', 'mode', 'crosschecking', 'our', 'results', 'with', 'available', 'reports', 'from', 'the', 'literature', 'of', 'the', 'last', 'decade', 'strongly', 'suggests', 'that', 'these', 'latter', 'conditions', 'should', 'favor', 'the', 'near', 'armchair', 'chiral', 'selectivity', 'observed', 'empirically']] | [-0.06783333060267413, 0.18073022132952685, 0.005168954424303153, -0.07984574287748446, 0.025043823942943508, -0.11717988808181715, 0.07863928595204549, 0.48213238586222046, -0.22267223386383006, -0.27985380699151546, 0.05351863686167956, -0.2832161042967747, -0.05293399543934983, 0.14629181927363066, 0.009419874741760051, -0.010873529550735839, 0.10818435470091886, -0.09773386423154895, -0.014124617927932534, -0.21233113401304482, 0.20810180774022793, 0.09419390162581513, 0.36719658363265273, 0.12127686092822716, 0.006149330172398737, -0.0877662878122245, 0.028997037423260767, 0.014015681005950117, -0.19035483798444178, 0.15015924165836309, 0.18466394711566833, -0.025519907197529643, 0.160418371706077, -0.5333866646256427, -0.2030140738286969, 0.018483862228659463, 0.14901713653997486, 0.10840018977539549, -0.08848457682801507, -0.19979466535632723, 0.05850717819954172, -0.12077114151405363, -0.14422900989202075, 0.052659051091378105, 0.012671744293364665, 0.07549076022857254, -0.2098421914711723, 0.05538702115179682, 0.054004999983590096, 0.07204338009388925, -0.09840161695670947, -0.20568060086526233, -0.16208046914182667, 0.06206293846079116, 0.06603766322449042, -0.03521311563311209, 0.3153559050316007, -0.07564507721690461, -0.06030538352607782, 0.3828156771086124, -0.11801998819031849, -0.0888181238451266, 0.2427459860276752, -0.14870028225614706, -0.10105527892853294, 0.2039716590741842, 0.08770494043610283, 0.13820669504689406, -0.1507488313002576, -0.015705452692004497, -0.020190608904472197, 0.18088197691570806, 0.13307715470477105, 0.007411231720370465, 0.292399441032542, 0.2650106088659758, 0.027252727657845564, 0.1442259036562534, -0.14256955844807792, -0.04759493185175133, -0.18010926778139225, -0.23062292849323873, -0.1338254387218481, 0.07303507019492701, -0.10212230923182154, -0.23048884126534364, 0.33538315188268136, 0.05901470805261413, 0.14812084669568415, -0.018646420939054727, 0.23346097930334508, 0.030347394242136064, 0.10977939608836032, -0.037510121201068676, 0.27382664339905927, 0.2091511560138315, 0.13680144507289416, -0.2870159467164395, 0.12727863066087092, -0.0035485005997731513] |
1,802.0403 | Introducer Concepts in n-Dimensional Contexts | Concept lattices are well-known conceptual structures that organise
interesting patterns-the concepts-extracted from data. In some applications,
such as software engineering or data mining, the size of the lattice can be a
problem, as it is often too large to be efficiently computed, and too complex
to be browsed. For this reason, the Galois Sub-Hierarchy, a restriction of the
concept lattice to introducer concepts, has been introduced as a smaller
alternative. In this paper, we generalise the Galois Sub-Hierarchy to
n-lattices, conceptual structures obtained from multidimensional data in the
same way that concept lattices are obtained from binary relations.
| cs.AI cs.CC cs.DB | concept lattices are wellknown conceptual structures that organise interesting patternsthe conceptsextracted from data in some applications such as software engineering or data mining the size of the lattice can be a problem as it is often too large to be efficiently computed and too complex to be browsed for this reason the galois subhierarchy a restriction of the concept lattice to introducer concepts has been introduced as a smaller alternative in this paper we generalise the galois subhierarchy to nlattices conceptual structures obtained from multidimensional data in the same way that concept lattices are obtained from binary relations | [['concept', 'lattices', 'are', 'wellknown', 'conceptual', 'structures', 'that', 'organise', 'interesting', 'patternsthe', 'conceptsextracted', 'from', 'data', 'in', 'some', 'applications', 'such', 'as', 'software', 'engineering', 'or', 'data', 'mining', 'the', 'size', 'of', 'the', 'lattice', 'can', 'be', 'a', 'problem', 'as', 'it', 'is', 'often', 'too', 'large', 'to', 'be', 'efficiently', 'computed', 'and', 'too', 'complex', 'to', 'be', 'browsed', 'for', 'this', 'reason', 'the', 'galois', 'subhierarchy', 'a', 'restriction', 'of', 'the', 'concept', 'lattice', 'to', 'introducer', 'concepts', 'has', 'been', 'introduced', 'as', 'a', 'smaller', 'alternative', 'in', 'this', 'paper', 'we', 'generalise', 'the', 'galois', 'subhierarchy', 'to', 'nlattices', 'conceptual', 'structures', 'obtained', 'from', 'multidimensional', 'data', 'in', 'the', 'same', 'way', 'that', 'concept', 'lattices', 'are', 'obtained', 'from', 'binary', 'relations']] | [-0.058998421067371964, 0.1133578654398468, -0.13293497056323797, 0.1307230071657575, -0.17607624246243467, -0.10080694889233625, 0.01200719034185316, 0.37061086709194996, -0.36540223255832777, -0.31213634833693504, 0.16100386718035417, -0.24075067383633492, -0.1827483913994969, 0.22864716573608446, -0.10748646393953327, 0.04571047413380856, 0.06281418943817312, 0.0238955478441525, -0.05342854811448326, -0.24606489158294936, 0.3061634952876162, 0.03487204283753291, 0.2624567755339469, 0.02685806784342895, 0.04231700646824778, -0.024694343112369486, -0.012027151436802554, 0.07015467545096861, -0.09549550181877071, 0.16842977285380178, 0.3496518819097509, 0.14462978336117924, 0.2582578410424213, -0.4030664367204968, -0.19916933875387297, 0.12658402966731724, 0.13943066143807262, 0.15142327525276453, -0.03943256979828027, -0.281812263076798, 0.10373041509809171, -0.17178915966391325, -0.12951808542191506, -0.10419030118352199, 0.020788685894234382, 0.029675816767849028, -0.21933732838667136, -0.015699266545236745, 0.07493170765922108, 0.10516463562925445, -0.01895872324189924, -0.11699939101062556, 0.008266271171259118, 0.11639862156106516, 0.020901795850690217, 0.028910045566512867, 0.06201513313212769, -0.09837529903644339, -0.1415181408854241, 0.45195905075586856, -0.008204210247408519, -0.20434540942152765, 0.19170961357118127, -0.0729479390454102, -0.1728373861802306, 0.09689268689513444, 0.16607028199359775, 0.07136476648218454, -0.15719725012264035, 0.08621964622425173, -0.08409303109696571, 0.13638265494584165, 0.0888573092289586, 0.037273357647094635, 0.19163317630622298, 0.15938065596360793, 0.036367775694011374, 0.15999111304916638, -0.014859012471749745, -0.07426074916060935, -0.2454520833066744, -0.13287411176381594, -0.1989174990820639, 0.049551276787322886, -0.052587422393503884, -0.15681169656764202, 0.314674464708313, 0.17388860884300888, 0.21922844453179774, 0.01728925891616877, 0.27621286976933873, 0.06912626661583186, 0.16109713447835058, 0.02484818417182628, 0.1613345449914824, 0.11154875203848202, 0.096735767673384, -0.11672962929290581, 0.028038062601092647, 0.05428280898350033] |
1,802.04031 | Rack-Aware Regenerating Codes for Data Centers | Erasure coding is widely used for massive storage in data centers to achieve
high fault tolerance and low storage redundancy. Since the cross-rack
communication cost is often high, it is critical to design erasure codes that
minimize the cross-rack repair bandwidth during failure repair. In this paper,
we analyze the optimal trade-off between storage redundancy and cross-rack
repair bandwidth specifically for data centers, subject to the condition that
the original data can be reconstructed from a sufficient number of any
non-failed nodes. We characterize the optimal trade-off curve under functional
repair, and propose a general family of erasure codes called rack-aware
regenerating codes (RRC), which achieve the optimal trade-off. We further
propose exact repair constructions of RRC that have minimum storage redundancy
and minimum cross-rack repair bandwidth, respectively. We show that (i) the
minimum storage redundancy constructions support a wide range of parameters and
have cross-rack repair bandwidth that is strictly less than that of the
classical minimum storage regenerating codes in most cases, and (ii) the
minimum cross-rack repair bandwidth constructions support all the parameters
and have less cross-rack repair bandwidth than that of the minimum bandwidth
regenerating codes for almost all of the parameters.
| cs.IT math.IT | erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy since the crossrack communication cost is often high it is critical to design erasure codes that minimize the crossrack repair bandwidth during failure repair in this paper we analyze the optimal tradeoff between storage redundancy and crossrack repair bandwidth specifically for data centers subject to the condition that the original data can be reconstructed from a sufficient number of any nonfailed nodes we characterize the optimal tradeoff curve under functional repair and propose a general family of erasure codes called rackaware regenerating codes rrc which achieve the optimal tradeoff we further propose exact repair constructions of rrc that have minimum storage redundancy and minimum crossrack repair bandwidth respectively we show that i the minimum storage redundancy constructions support a wide range of parameters and have crossrack repair bandwidth that is strictly less than that of the classical minimum storage regenerating codes in most cases and ii the minimum crossrack repair bandwidth constructions support all the parameters and have less crossrack repair bandwidth than that of the minimum bandwidth regenerating codes for almost all of the parameters | [['erasure', 'coding', 'is', 'widely', 'used', 'for', 'massive', 'storage', 'in', 'data', 'centers', 'to', 'achieve', 'high', 'fault', 'tolerance', 'and', 'low', 'storage', 'redundancy', 'since', 'the', 'crossrack', 'communication', 'cost', 'is', 'often', 'high', 'it', 'is', 'critical', 'to', 'design', 'erasure', 'codes', 'that', 'minimize', 'the', 'crossrack', 'repair', 'bandwidth', 'during', 'failure', 'repair', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'optimal', 'tradeoff', 'between', 'storage', 'redundancy', 'and', 'crossrack', 'repair', 'bandwidth', 'specifically', 'for', 'data', 'centers', 'subject', 'to', 'the', 'condition', 'that', 'the', 'original', 'data', 'can', 'be', 'reconstructed', 'from', 'a', 'sufficient', 'number', 'of', 'any', 'nonfailed', 'nodes', 'we', 'characterize', 'the', 'optimal', 'tradeoff', 'curve', 'under', 'functional', 'repair', 'and', 'propose', 'a', 'general', 'family', 'of', 'erasure', 'codes', 'called', 'rackaware', 'regenerating', 'codes', 'rrc', 'which', 'achieve', 'the', 'optimal', 'tradeoff', 'we', 'further', 'propose', 'exact', 'repair', 'constructions', 'of', 'rrc', 'that', 'have', 'minimum', 'storage', 'redundancy', 'and', 'minimum', 'crossrack', 'repair', 'bandwidth', 'respectively', 'we', 'show', 'that', 'i', 'the', 'minimum', 'storage', 'redundancy', 'constructions', 'support', 'a', 'wide', 'range', 'of', 'parameters', 'and', 'have', 'crossrack', 'repair', 'bandwidth', 'that', 'is', 'strictly', 'less', 'than', 'that', 'of', 'the', 'classical', 'minimum', 'storage', 'regenerating', 'codes', 'in', 'most', 'cases', 'and', 'ii', 'the', 'minimum', 'crossrack', 'repair', 'bandwidth', 'constructions', 'support', 'all', 'the', 'parameters', 'and', 'have', 'less', 'crossrack', 'repair', 'bandwidth', 'than', 'that', 'of', 'the', 'minimum', 'bandwidth', 'regenerating', 'codes', 'for', 'almost', 'all', 'of', 'the', 'parameters']] | [-0.23572266315705306, 0.06599489834697284, 0.03132684721333003, 0.06825105563831065, -0.008359406711101608, -0.2793847735246317, 0.17696727410177268, 0.37757412204278884, -0.2962837853791797, -0.3180275109702164, 0.1592358260777942, -0.2608519776978712, -0.12878433752267324, 0.14575492788931912, -0.2171438215636485, 0.12975125759179926, 0.09291296765697608, 0.03357533287717817, -0.0752776383482923, -0.3195857126937853, 0.22712645565757297, 0.21833019258848094, 0.3422705330597909, 0.03893911685961414, 0.008494820793221714, 0.023800343524703046, 0.04083682950610084, -0.05027421635206582, -0.19197927357294547, 0.14894758479324044, 0.34996050317560506, 0.25238331086866406, 0.2604453690618891, -0.4048629057780868, -0.2565035920628567, 0.1490927387038534, 0.11758811422383662, 0.12490052789072842, -0.022290505060791662, -0.06498019242678414, 0.20576999557310158, -0.21087684542583973, 0.025861998079056592, -0.032903796432722246, 0.025391882388689314, 0.03725144799952347, -0.3217254127807838, 0.0002842885514087591, -0.002868232605306758, 0.07211716195145987, -0.08937852590083212, -0.07581705161185513, -0.0037128080364278297, 0.07774645308291867, -0.025747823744973877, 0.016084985100044916, 0.07499193234042716, -0.041923600770461075, -0.11083319363815557, 0.3425863926516745, 0.08413510513416919, -0.1455172855555819, 0.13422093699811047, -0.011132141246373966, -0.09451511339044448, 0.1736424797224769, 0.21556886430522523, 0.05401133930973094, -0.1795850835222098, 0.04766087358281588, 0.014104569335612133, 0.22089781013999096, 0.15541278443553666, 0.20775940750885188, 0.09672963316072278, 0.13545060118980773, 0.13154431917889467, 0.1961077112199249, -0.09200522529210933, -0.0587594894663498, -0.28235299000036473, -0.11790557735366747, -0.20593337306978432, -0.014932798056085547, -0.16499830222487288, -0.12658462642701632, 0.36614382189708117, 0.15971607022010242, 0.119550430837577, 0.16476404602632178, 0.3036333517334664, 0.02378914691117765, 0.2064721907027541, 0.2695924048888084, 0.1683873589889905, 0.04973094747161742, 0.019542990650828044, -0.251789463913193, 0.10648016223789568, 0.0007893713323168995] |
1,802.04032 | Average Size of Implicational Bases | Implicational bases are objects of interest in formal concept analysis and
its applications. Unfortunately, even the smallest base, the Duquenne-Guigues
base, has an exponential size in the worst case. In this paper, we use results
on the average number of minimal transversals in random hypergraphs to show
that the base of proper premises is, on average, of quasi-polynomial size.
| cs.AI cs.CC cs.DB math.CO | implicational bases are objects of interest in formal concept analysis and its applications unfortunately even the smallest base the duquenneguigues base has an exponential size in the worst case in this paper we use results on the average number of minimal transversals in random hypergraphs to show that the base of proper premises is on average of quasipolynomial size | [['implicational', 'bases', 'are', 'objects', 'of', 'interest', 'in', 'formal', 'concept', 'analysis', 'and', 'its', 'applications', 'unfortunately', 'even', 'the', 'smallest', 'base', 'the', 'duquenneguigues', 'base', 'has', 'an', 'exponential', 'size', 'in', 'the', 'worst', 'case', 'in', 'this', 'paper', 'we', 'use', 'results', 'on', 'the', 'average', 'number', 'of', 'minimal', 'transversals', 'in', 'random', 'hypergraphs', 'to', 'show', 'that', 'the', 'base', 'of', 'proper', 'premises', 'is', 'on', 'average', 'of', 'quasipolynomial', 'size']] | [-0.16483294858661449, 0.04381478767554027, -0.03924507567466333, 0.04021687439546503, -0.08310503861064027, -0.03659602284335114, 0.09032644111671131, 0.3489922206158397, -0.22996875137925663, -0.27534004628401376, 0.10761285975479104, -0.25173688525783605, -0.13565524346355734, 0.19984533364788212, -0.16978897045141664, 0.03616149127704155, 0.06657195320866745, 0.1201756813980896, -0.027943250225407296, -0.3227703289835361, 0.2996324255404159, 0.05486101914068748, 0.2750958454562351, 0.03725832837216299, 0.049008527401320896, 0.01832129368719099, -0.034958165925766886, 0.057225177578371145, -0.10869196385352427, 0.13469230476766825, 0.25653601174467594, 0.19457532399623045, 0.2919739631871725, -0.41403801035906734, -0.13691664588284388, 0.1732516516770782, 0.1370063291637805, 0.07946898858865788, 0.014887032444299808, -0.16982586142719433, 0.14243909603402274, -0.16337775234293578, -0.1299871993251145, -0.01013490498459352, 0.09229090931857455, 0.06330843472146783, -0.24810890551528025, -0.03835051537266579, 0.1406092386339502, 0.11031035970543222, -0.01846186785581361, -0.16185049386695027, 0.018548336889642966, 0.12207411901607852, 0.025384940732880657, -0.036565551349636294, 0.0853586757218401, -0.12182795769807979, -0.15330284522396737, 0.37904921263970176, -0.03862144322744731, -0.2329572495434369, 0.1674333620527438, -0.15435622939197668, -0.16914932334249647, 0.09859599391448087, 0.188685843432001, 0.1550128217465405, -0.0629507289749795, 0.16627345887586828, -0.14296059066365505, 0.19354408321067176, 0.13137678052941015, 0.056146190333148015, 0.12864097633302726, 0.17646623198906408, 0.11529074076177745, 0.16038955926718512, -0.04578062582054529, -0.09731561745163696, -0.3153660964192662, -0.17134477702322706, -0.22991401302339187, 0.05115218131586203, -0.16054490206192112, -0.1819697867051281, 0.3765746825374663, 0.1525903781875968, 0.20075313348708482, 0.11826541154356353, 0.2886408376507461, 0.0608095474187927, 0.04348464190542441, 0.09459761347747629, 0.17496260156822874, 0.13379578447322651, 0.025571014242375206, -0.14917761560304668, 0.1002208738716255, 0.07735846320102954] |
1,802.04033 | Extension of holomorphic functions defined on singular complex
hypersurfaces with growth estimates in strictly pseudoconvex domains of $C^n$ | Let $D$ be a strictly pseudoconvex domain and $X$ be a singular analytic set
of pure dimension $n-1$ in $C^n$ such that $X\cap D\neq \emptyset$ and $X\cap
bD$ is transverse. We give sufficient conditions for a function holomorphic on
$D\cap X$ to admit a holomorphic extension which belongs to $L^q(D),$ $q\in
[1,+\infty[$, or to $BMO(D)$. The extension is given by mean of integral
representation formulas and residue currents.
| math.CV | let d be a strictly pseudoconvex domain and x be a singular analytic set of pure dimension n1 in cn such that xcap dneq emptyset and xcap bd is transverse we give sufficient conditions for a function holomorphic on dcap x to admit a holomorphic extension which belongs to lqd qin 1infty or to bmod the extension is given by mean of integral representation formulas and residue currents | [['let', 'd', 'be', 'a', 'strictly', 'pseudoconvex', 'domain', 'and', 'x', 'be', 'a', 'singular', 'analytic', 'set', 'of', 'pure', 'dimension', 'n1', 'in', 'cn', 'such', 'that', 'xcap', 'dneq', 'emptyset', 'and', 'xcap', 'bd', 'is', 'transverse', 'we', 'give', 'sufficient', 'conditions', 'for', 'a', 'function', 'holomorphic', 'on', 'dcap', 'x', 'to', 'admit', 'a', 'holomorphic', 'extension', 'which', 'belongs', 'to', 'lqd', 'qin', '1infty', 'or', 'to', 'bmod', 'the', 'extension', 'is', 'given', 'by', 'mean', 'of', 'integral', 'representation', 'formulas', 'and', 'residue', 'currents']] | [-0.18370507660267107, 0.06430192619069096, -0.0747611346476547, 0.051297582675675475, -0.10855994071222513, -0.2083198868066949, -0.02286690361592371, 0.3533401494736181, -0.26211580267066464, -0.10425378195941448, 0.07570762834203539, -0.28918832052937327, -0.10616156505078406, 0.14408667118336513, -0.0935803580648687, -0.008965869324610513, 0.014915670336717191, 0.10929221350370961, -0.08548589091515169, -0.23752203956246376, 0.35284865754382577, -0.15966358361765742, 0.13204407696064344, 0.08281231279012419, 0.11247941942693775, 0.009486430947778417, 0.07882938637767974, -0.020790673953289276, -0.2198225719592515, 0.0707645569654072, 0.3139457427074804, 0.1187083347912823, 0.21393125650116845, -0.3377555253477219, -0.14824170547345764, 0.2783358885687502, 0.14031512992155246, -0.11545267339063096, 0.0469489565687528, -0.2585117988226771, 0.1844029338167542, -0.0802052011987304, -0.20334875078269227, -0.09635605751399827, 0.14316515545086825, 0.0006641606964609202, -0.4433198854984606, 0.04130135755985975, 0.154387739377425, 0.12034256737131406, -0.08170121655498139, -0.17423210968263447, -0.07592657832634252, -0.01569591774707934, -0.054824686759863704, 0.23823394902351805, 0.07350731315776049, -0.03859573482152294, -0.08514664686449311, 0.2936912327285801, -0.08794456805266879, -0.3576895896454944, 0.11654532241963726, -0.21689528062758173, -0.1303663301445982, 0.15641409939374118, 0.0947057792731999, 0.19235862139612436, -0.05510383555391694, 0.2876706523110282, -0.11759571474292041, 0.09776947369305965, 0.12761481949949965, -0.010879454511108206, 0.10391697020489066, 0.0529153229915263, 0.12966951017733663, 0.1011403796968379, 0.00483041097451111, 0.022667862913187814, -0.4078442720586763, -0.18768620644422138, -0.15579730819787502, 0.24317992552567055, -0.09738051552973476, -0.17129061304662815, 0.3328253559713416, 0.02276041776434902, 0.19499787213434877, 0.11492732105783515, 0.16830226116101532, 0.0930741472139369, 0.04493805774323204, 0.0815166606745847, 0.01742709181545412, 0.18441551199922449, -0.01341516139013145, -0.11198067867799717, -0.016531915311455068, 0.18644341010846854] |
1,802.04034 | Lipschitz-Margin Training: Scalable Certification of Perturbation
Invariance for Deep Neural Networks | High sensitivity of neural networks against malicious perturbations on inputs
causes security concerns. To take a steady step towards robust classifiers, we
aim to create neural network models provably defended from perturbations. Prior
certification work requires strong assumptions on network structures and
massive computational costs, and thus the range of their applications was
limited. From the relationship between the Lipschitz constants and prediction
margins, we present a computationally efficient calculation technique to
lower-bound the size of adversarial perturbations that can deceive networks,
and that is widely applicable to various complicated networks. Moreover, we
propose an efficient training procedure that robustifies networks and
significantly improves the provably guarded areas around data points. In
experimental evaluations, our method showed its ability to provide a
non-trivial guarantee and enhance robustness for even large networks.
| cs.CV cs.LG stat.ML | high sensitivity of neural networks against malicious perturbations on inputs causes security concerns to take a steady step towards robust classifiers we aim to create neural network models provably defended from perturbations prior certification work requires strong assumptions on network structures and massive computational costs and thus the range of their applications was limited from the relationship between the lipschitz constants and prediction margins we present a computationally efficient calculation technique to lowerbound the size of adversarial perturbations that can deceive networks and that is widely applicable to various complicated networks moreover we propose an efficient training procedure that robustifies networks and significantly improves the provably guarded areas around data points in experimental evaluations our method showed its ability to provide a nontrivial guarantee and enhance robustness for even large networks | [['high', 'sensitivity', 'of', 'neural', 'networks', 'against', 'malicious', 'perturbations', 'on', 'inputs', 'causes', 'security', 'concerns', 'to', 'take', 'a', 'steady', 'step', 'towards', 'robust', 'classifiers', 'we', 'aim', 'to', 'create', 'neural', 'network', 'models', 'provably', 'defended', 'from', 'perturbations', 'prior', 'certification', 'work', 'requires', 'strong', 'assumptions', 'on', 'network', 'structures', 'and', 'massive', 'computational', 'costs', 'and', 'thus', 'the', 'range', 'of', 'their', 'applications', 'was', 'limited', 'from', 'the', 'relationship', 'between', 'the', 'lipschitz', 'constants', 'and', 'prediction', 'margins', 'we', 'present', 'a', 'computationally', 'efficient', 'calculation', 'technique', 'to', 'lowerbound', 'the', 'size', 'of', 'adversarial', 'perturbations', 'that', 'can', 'deceive', 'networks', 'and', 'that', 'is', 'widely', 'applicable', 'to', 'various', 'complicated', 'networks', 'moreover', 'we', 'propose', 'an', 'efficient', 'training', 'procedure', 'that', 'robustifies', 'networks', 'and', 'significantly', 'improves', 'the', 'provably', 'guarded', 'areas', 'around', 'data', 'points', 'in', 'experimental', 'evaluations', 'our', 'method', 'showed', 'its', 'ability', 'to', 'provide', 'a', 'nontrivial', 'guarantee', 'and', 'enhance', 'robustness', 'for', 'even', 'large', 'networks']] | [-0.11168104800829337, -0.006197657568432668, -0.053467327956366176, 0.10017199199628939, -0.09181302484437709, -0.19725976468469122, 0.1041520667628506, 0.4232624838597902, -0.2521605375009582, -0.3223910186837875, 0.08899656443533181, -0.2340406272116025, -0.2146106096516001, 0.19874909940133056, -0.15656960525906582, 0.14293641282400144, 0.12255243507732871, -0.02236251953526272, -0.029808555846991203, -0.2787403967107099, 0.2993318632834555, 0.0956223584100149, 0.35877114174445873, 0.06508162730010866, 0.08352320594801958, -0.052822732784294786, -0.0025036699398072394, 0.007396730359617926, -0.07829903048246109, 0.15822465070843242, 0.2905889578818849, 0.1907619843970387, 0.35184430845707426, -0.46927156073275866, -0.22791755273369432, 0.14111411814108663, 0.12132668502465288, 0.16685437424222135, -0.01630162797736729, -0.30203343441404173, 0.13719512014614263, -0.16267356124194696, -0.0674195921347114, -0.20366907473084808, -0.011977458790385427, -0.01035747222445962, -0.31081294394382597, 0.029052680336962674, 0.07625529472182953, 0.02902696892363197, -0.02264302722373906, -0.09303169378669549, -0.004979772510127882, 0.1464039866513935, 0.03683049330942845, 0.022774559634076503, 0.15797725089697723, -0.14995519905031182, -0.12754349595021086, 0.3202806902153574, -0.03940927954426192, -0.19970425751543683, 0.22460507019067483, -0.01628317641990103, -0.15992844100501247, 0.13339456788598353, 0.264233328950794, 0.11195956829594064, -0.12987556181961799, 0.023761805780551874, 0.03562472345670045, 0.21079147856270197, 0.030962283461788344, 0.03739288643727662, 0.13726385737563135, 0.2020222309564475, 0.10821952622646878, 0.1520705608027198, -0.07092505361074368, -0.08001074502919979, -0.20428431609233144, -0.07077033700819575, -0.18419165050127465, 0.004049809862866656, -0.11732292566239613, -0.16442748774838356, 0.38452899939814256, 0.24482069437512916, 0.1932258161557092, 0.16517904406512968, 0.35714292024326233, 0.013805282857617406, 0.09153747693493337, 0.12777068126477473, 0.22782296540912325, 0.08999017893002574, 0.1385930187801141, -0.15227438545544128, 0.16122575227228056, -0.0017842423412522286] |
1,802.04035 | Orientation of plastic rearrangements in two-dimensional model glasses
under shear | The plastic deformation of amorphous solids is mediated by localized shear
transformations involving small groups of particles rearranging irreversibly in
an elastic background. We introduce and compare three different computational
methods to extract the size and orientation of these shear transformations in
simulations of a two-dimensional (2D) athermal model glass under simple shear.
We find that the shear angles are broadly distributed around the macroscopic
shear direction, with a more or less Gaussian distribution with a standard
deviation of around 20 $\bullet$ about the direction of maximal local shear.
The distributions of sizes and orientations of shear transformations display no
substantial sensitivity to the shear rate. These results can notably be used to
refine the description of rearrangements in elastoplastic models.
| cond-mat.soft cond-mat.dis-nn | the plastic deformation of amorphous solids is mediated by localized shear transformations involving small groups of particles rearranging irreversibly in an elastic background we introduce and compare three different computational methods to extract the size and orientation of these shear transformations in simulations of a twodimensional 2d athermal model glass under simple shear we find that the shear angles are broadly distributed around the macroscopic shear direction with a more or less gaussian distribution with a standard deviation of around 20 bullet about the direction of maximal local shear the distributions of sizes and orientations of shear transformations display no substantial sensitivity to the shear rate these results can notably be used to refine the description of rearrangements in elastoplastic models | [['the', 'plastic', 'deformation', 'of', 'amorphous', 'solids', 'is', 'mediated', 'by', 'localized', 'shear', 'transformations', 'involving', 'small', 'groups', 'of', 'particles', 'rearranging', 'irreversibly', 'in', 'an', 'elastic', 'background', 'we', 'introduce', 'and', 'compare', 'three', 'different', 'computational', 'methods', 'to', 'extract', 'the', 'size', 'and', 'orientation', 'of', 'these', 'shear', 'transformations', 'in', 'simulations', 'of', 'a', 'twodimensional', '2d', 'athermal', 'model', 'glass', 'under', 'simple', 'shear', 'we', 'find', 'that', 'the', 'shear', 'angles', 'are', 'broadly', 'distributed', 'around', 'the', 'macroscopic', 'shear', 'direction', 'with', 'a', 'more', 'or', 'less', 'gaussian', 'distribution', 'with', 'a', 'standard', 'deviation', 'of', 'around', '20', 'bullet', 'about', 'the', 'direction', 'of', 'maximal', 'local', 'shear', 'the', 'distributions', 'of', 'sizes', 'and', 'orientations', 'of', 'shear', 'transformations', 'display', 'no', 'substantial', 'sensitivity', 'to', 'the', 'shear', 'rate', 'these', 'results', 'can', 'notably', 'be', 'used', 'to', 'refine', 'the', 'description', 'of', 'rearrangements', 'in', 'elastoplastic', 'models']] | [-0.12106714249407673, 0.2274763169632272, -0.09901036238990539, -0.004980963323850277, -0.020699936580990463, -0.08600736818130104, -0.023885289087799216, 0.38337823671619753, -0.3258007016799736, -0.27356392342197006, 0.05255294241846254, -0.254953864222962, -0.1349721395214327, 0.17290998496931076, -0.015331106057533924, 0.05675858296410658, 0.0004492976648871564, -0.023658492765966647, -0.10667952555539625, -0.20748170750592798, 0.23379209750689844, 0.04742882263939058, 0.34025587758033976, -0.028085685583805156, 0.06069522538638004, 0.003305753311988982, -0.04492153176529841, 0.09479619610346546, -0.19811190090923664, 0.08660002090113837, 0.1974100885456796, 0.003599269704292875, 0.20114716065832036, -0.46398769936347306, -0.2076115541021563, 0.0915778945950591, 0.10066838121264865, 0.13661977467665926, -0.019205632293043652, -0.2183900389547098, 0.0747156539116024, -0.1299672267545969, -0.12678650510112546, -0.08414167123230959, 0.024904131639194638, 0.061173096936088335, -0.2393422905136331, 0.19888845323161644, 0.06526253580246583, 0.08414907308972695, -0.10452780173706615, -0.06915240478509467, -0.0663940341208007, 0.08361967459748199, 0.10482922837634624, 0.017716090341121697, 0.25135847809916934, -0.1739653733612831, -0.06237654020328629, 0.41567493297837, -0.022781581523605, -0.2245039081408773, 0.24376119094446672, -0.1467290792416027, -0.12355224907875431, 0.19882140998259062, 0.21806922737385862, 0.07569745662602911, -0.14882397868483874, -0.019035937835573995, -0.011120066880864237, 0.16488718207202052, 0.09652030341373372, -0.033811084711577837, 0.22043867386138635, 0.16312721922747359, 0.05473659507072077, 0.17292456677874304, -0.1449259201772819, -0.07223808439063632, -0.3050162539902059, -0.12772537318966543, -0.14618169386247712, 0.04032627272242603, -0.16916825824327217, -0.19129382219542712, 0.3581686943138311, 0.1093196610646892, 0.20374018608107547, 0.08142801900278808, 0.23653991368776264, 0.017833052306967086, 0.08564652047554909, 0.047535953712303285, 0.2962399454775828, 0.1626134916912949, 0.04800811964125672, -0.18497724779150335, 0.06417175574412892, 0.030950831141599938] |
1,802.04036 | Inferring the time-varying functional connectivity of large-scale
computer networks from emitted events | We consider the problem of inferring the functional connectivity of a
large-scale computer network from sparse time series of events emitted by its
nodes. We do so under the following three domain-specific constraints: (a)
non-stationarity of the functional connectivity due to unknown temporal changes
in the network, (b) sparsity of the time-series of events that limits the
effectiveness of classical correlation-based analysis, and (c) lack of an
explicit model describing how events propagate through the network. Under the
assumption that the probability of two nodes being functionally connected
correlates with the mean delay between their respective events, we develop an
inference method whose output is an undirected weighted network where the
weight of an edge between two nodes denotes the probability of these nodes
being functionally connected. Using a combination of windowing and convolution
to calculate at each time window a score quantifying the likelihood of a pair
of nodes emitting events in quick succession, we develop a model of
time-varying connectivity whose parameters are determined by maximising the
model's predictive power from one time window to the next. To assess the
effectiveness of our inference method, we construct synthetic data for which
ground truth is available and use these data to benchmark our approach against
three state-of-the-art inference methods. We conclude by discussing its
application to data from a real-world large-scale computer network.
| cs.LG cs.SI math.OC | we consider the problem of inferring the functional connectivity of a largescale computer network from sparse time series of events emitted by its nodes we do so under the following three domainspecific constraints a nonstationarity of the functional connectivity due to unknown temporal changes in the network b sparsity of the timeseries of events that limits the effectiveness of classical correlationbased analysis and c lack of an explicit model describing how events propagate through the network under the assumption that the probability of two nodes being functionally connected correlates with the mean delay between their respective events we develop an inference method whose output is an undirected weighted network where the weight of an edge between two nodes denotes the probability of these nodes being functionally connected using a combination of windowing and convolution to calculate at each time window a score quantifying the likelihood of a pair of nodes emitting events in quick succession we develop a model of timevarying connectivity whose parameters are determined by maximising the models predictive power from one time window to the next to assess the effectiveness of our inference method we construct synthetic data for which ground truth is available and use these data to benchmark our approach against three stateoftheart inference methods we conclude by discussing its application to data from a realworld largescale computer network | [['we', 'consider', 'the', 'problem', 'of', 'inferring', 'the', 'functional', 'connectivity', 'of', 'a', 'largescale', 'computer', 'network', 'from', 'sparse', 'time', 'series', 'of', 'events', 'emitted', 'by', 'its', 'nodes', 'we', 'do', 'so', 'under', 'the', 'following', 'three', 'domainspecific', 'constraints', 'a', 'nonstationarity', 'of', 'the', 'functional', 'connectivity', 'due', 'to', 'unknown', 'temporal', 'changes', 'in', 'the', 'network', 'b', 'sparsity', 'of', 'the', 'timeseries', 'of', 'events', 'that', 'limits', 'the', 'effectiveness', 'of', 'classical', 'correlationbased', 'analysis', 'and', 'c', 'lack', 'of', 'an', 'explicit', 'model', 'describing', 'how', 'events', 'propagate', 'through', 'the', 'network', 'under', 'the', 'assumption', 'that', 'the', 'probability', 'of', 'two', 'nodes', 'being', 'functionally', 'connected', 'correlates', 'with', 'the', 'mean', 'delay', 'between', 'their', 'respective', 'events', 'we', 'develop', 'an', 'inference', 'method', 'whose', 'output', 'is', 'an', 'undirected', 'weighted', 'network', 'where', 'the', 'weight', 'of', 'an', 'edge', 'between', 'two', 'nodes', 'denotes', 'the', 'probability', 'of', 'these', 'nodes', 'being', 'functionally', 'connected', 'using', 'a', 'combination', 'of', 'windowing', 'and', 'convolution', 'to', 'calculate', 'at', 'each', 'time', 'window', 'a', 'score', 'quantifying', 'the', 'likelihood', 'of', 'a', 'pair', 'of', 'nodes', 'emitting', 'events', 'in', 'quick', 'succession', 'we', 'develop', 'a', 'model', 'of', 'timevarying', 'connectivity', 'whose', 'parameters', 'are', 'determined', 'by', 'maximising', 'the', 'models', 'predictive', 'power', 'from', 'one', 'time', 'window', 'to', 'the', 'next', 'to', 'assess', 'the', 'effectiveness', 'of', 'our', 'inference', 'method', 'we', 'construct', 'synthetic', 'data', 'for', 'which', 'ground', 'truth', 'is', 'available', 'and', 'use', 'these', 'data', 'to', 'benchmark', 'our', 'approach', 'against', 'three', 'stateoftheart', 'inference', 'methods', 'we', 'conclude', 'by', 'discussing', 'its', 'application', 'to', 'data', 'from', 'a', 'realworld', 'largescale', 'computer', 'network']] | [-0.12906968712117564, 0.04216719075572785, -0.04395278146070528, 0.050563105767001355, -0.07304798307034487, -0.11133469975694814, 0.0859110579206442, 0.40431817630139577, -0.30410847161796745, -0.3316979612905665, 0.08597981473660964, -0.2784926144538206, -0.16965935675294272, 0.1627822159482873, -0.04278566346017344, 0.06064910897683668, 0.10036752824505259, 0.08199878916119425, -0.03829989938822109, -0.23979664670332568, 0.32359011323569575, 0.059542227536439896, 0.2889989187928482, -0.0021949124462220687, 0.11468342746073697, -0.004950665827241859, -0.07027039407018622, 0.0265922351313098, -0.08627102330897937, 0.16748806743092765, 0.2457422348865066, 0.20951374989609967, 0.317837686841293, -0.45796374069842777, -0.21593692897295114, 0.1318129953225642, 0.08779258790517426, 0.06103505057529089, 0.022450078623868257, -0.3178472973605884, 0.09716681239972656, -0.16548979173655556, -0.05177852773834145, -0.06196214402630825, 0.004331550483974362, 0.04863102137876142, -0.2955528748009653, 0.06490423441157743, 0.006902972237315096, 0.04508027556104415, -0.03390807082489898, -0.06636983526862293, -0.024971957070062802, 0.16873826569852618, 0.04828257000813859, 0.002458615432260558, 0.12661268487655825, -0.1417055518572202, -0.1527461805297727, 0.3363150063752463, -0.036794276654420956, -0.18253816852705182, 0.17316933380477298, -0.07227195545692666, -0.14508106310469365, 0.11185933751611239, 0.21828232807560458, 0.10356227276289635, -0.1834117082263609, 0.025869035206986673, -0.018707397300334248, 0.15906960271448561, 0.017811467923041033, 0.003733426950150585, 0.17404912385453436, 0.2127778844972324, 0.05916987704508107, 0.13228973704307073, -0.14987312478985718, -0.07236849209220964, -0.2853880589827895, -0.10366202891704493, -0.21963507157384551, -0.012636546951398486, -0.1430081003385177, -0.18341952872911602, 0.45145437374178854, 0.1826225492246262, 0.2240816085354059, 0.11114481915189701, 0.30800052288187935, 0.0937240122948424, 0.04534132090261015, 0.10188013999192792, 0.16085733642311034, 0.10479384641283625, 0.05218441429315135, -0.19586804261780344, 0.11497966324389251, 0.019583671087665216] |
1,802.04037 | Extinction time for the weaker of two competing SIS epidemics | We consider a simple stochastic model for the spread of a disease caused by
two virus strains in a closed homogeneously mixing population of size N. The
spread of each strain in the absence of the other one is described by the
stochastic logistic SIS epidemic process, and we assume that there is perfect
cross-immunity between the two strains, that is, individuals infected by one
are temporarily immune to re-infections and infections by the other. For the
case where one strain has a strictly larger basic reproductive ratio than the
other, and the stronger strain on its own is supercritical (that is, its basic
reproductive ratio is larger than 1), we derive precise asymptotic results for
the distribution of the time when the weaker strain disappears from the
population, that is, its extinction time. We further extend our results to
certain parameter values where the difference between the two reproductive
ratios may tend to 0 as $N \to \infty$.
In proving our results, we illustrate a new approach to a fluid limit
approximation for a sequence of Markov chains in the vicinity of a stable fixed
point of the limit.
| math.PR | we consider a simple stochastic model for the spread of a disease caused by two virus strains in a closed homogeneously mixing population of size n the spread of each strain in the absence of the other one is described by the stochastic logistic sis epidemic process and we assume that there is perfect crossimmunity between the two strains that is individuals infected by one are temporarily immune to reinfections and infections by the other for the case where one strain has a strictly larger basic reproductive ratio than the other and the stronger strain on its own is supercritical that is its basic reproductive ratio is larger than 1 we derive precise asymptotic results for the distribution of the time when the weaker strain disappears from the population that is its extinction time we further extend our results to certain parameter values where the difference between the two reproductive ratios may tend to 0 as n to infty in proving our results we illustrate a new approach to a fluid limit approximation for a sequence of markov chains in the vicinity of a stable fixed point of the limit | [['we', 'consider', 'a', 'simple', 'stochastic', 'model', 'for', 'the', 'spread', 'of', 'a', 'disease', 'caused', 'by', 'two', 'virus', 'strains', 'in', 'a', 'closed', 'homogeneously', 'mixing', 'population', 'of', 'size', 'n', 'the', 'spread', 'of', 'each', 'strain', 'in', 'the', 'absence', 'of', 'the', 'other', 'one', 'is', 'described', 'by', 'the', 'stochastic', 'logistic', 'sis', 'epidemic', 'process', 'and', 'we', 'assume', 'that', 'there', 'is', 'perfect', 'crossimmunity', 'between', 'the', 'two', 'strains', 'that', 'is', 'individuals', 'infected', 'by', 'one', 'are', 'temporarily', 'immune', 'to', 'reinfections', 'and', 'infections', 'by', 'the', 'other', 'for', 'the', 'case', 'where', 'one', 'strain', 'has', 'a', 'strictly', 'larger', 'basic', 'reproductive', 'ratio', 'than', 'the', 'other', 'and', 'the', 'stronger', 'strain', 'on', 'its', 'own', 'is', 'supercritical', 'that', 'is', 'its', 'basic', 'reproductive', 'ratio', 'is', 'larger', 'than', '1', 'we', 'derive', 'precise', 'asymptotic', 'results', 'for', 'the', 'distribution', 'of', 'the', 'time', 'when', 'the', 'weaker', 'strain', 'disappears', 'from', 'the', 'population', 'that', 'is', 'its', 'extinction', 'time', 'we', 'further', 'extend', 'our', 'results', 'to', 'certain', 'parameter', 'values', 'where', 'the', 'difference', 'between', 'the', 'two', 'reproductive', 'ratios', 'may', 'tend', 'to', '0', 'as', 'n', 'to', 'infty', 'in', 'proving', 'our', 'results', 'we', 'illustrate', 'a', 'new', 'approach', 'to', 'a', 'fluid', 'limit', 'approximation', 'for', 'a', 'sequence', 'of', 'markov', 'chains', 'in', 'the', 'vicinity', 'of', 'a', 'stable', 'fixed', 'point', 'of', 'the', 'limit']] | [-0.12451691906776671, 0.16659578047692775, -0.05770828138644758, 0.06587369169058212, -0.009354871463667798, -0.1673148835739611, 0.0829329603872458, 0.3418843199940104, -0.2600046837224478, -0.21696093609850658, 0.10278646777825136, -0.283139603793327, -0.15064125530985428, 0.16393723600347967, -0.0566330994871494, -0.02696324081587495, 0.024147226918782842, 0.05105192649031156, 0.004039143503790623, -0.2563278695286595, 0.31394693303828763, 0.01820812851778771, 0.25113853013118437, 0.013697035997909935, 0.07344622892315353, 0.0010012190519390922, 0.03141376353542958, 0.03741903786890601, -0.15589592573554623, 0.07635306378728465, 0.21726008535617056, 0.10988773357270187, 0.3301549309153894, -0.4007753463952165, -0.2059343574764697, 0.14961829818049935, 0.15434223742585776, 0.14273092994852432, 0.010542584320309719, -0.2305787904898783, 0.10743762960927071, -0.14329565458281554, -0.1607069347200817, 0.02477167682771228, 0.04607312708700958, 0.046959797390981724, -0.2921923708835445, 0.09780149411066974, 0.06079049693959716, 0.05497497272751245, -0.050991814254513504, -0.1357831183428827, -0.0763494646887442, 0.1409390907117325, 0.09845385735250985, -0.0019544277070580344, 0.14948197251528894, -0.12350828894168923, -0.0625393490258016, 0.34147389119638033, -0.06868308275328386, -0.19404960895986542, 0.17965116394242567, -0.16482095601233213, -0.11137629863070814, 0.13915626714006066, 0.14240682084162376, 0.10913696243231626, -0.13104372431415343, 0.02815906545794477, -0.02043675786806393, 0.1472624127515653, 0.050958948795634666, -0.026076270007577382, 0.14785532235462023, 0.20357182953188097, 0.10605575538387424, 0.11617260877208441, -0.10081428033912457, -0.12091348633954399, -0.2616191524424051, -0.148824041114973, -0.16783735999518906, 0.09105138730282258, -0.15724026402435573, -0.1507598862370574, 0.36974061025110516, 0.15041804266419556, 0.20221405036021392, 0.12324846410927803, 0.2621869829630381, 0.12381924696229889, 0.03544130103515559, 0.045292250015527794, 0.23581125365178052, 0.12110497620106846, 0.060411838319544726, -0.21464626523543542, 0.14959142137024747, 0.014799948078335116] |
1,802.04038 | Empirical measures: regularity is a counter-curse to dimensionality | We propose a "decomposition method" to prove non-asymptotic bound for the
convergence of empirical measures in various dual norms. The main point is to
show that if one measures convergence in duality with sufficiently regular
observables, the convergence is much faster than for, say, merely Lipschitz
observables. Actually, assuming $s$ derivatives with $s < d/2$ ($d$ the
dimension) ensures an optimal rate of convergence of $1/\sqrt{n}$ ($n$ the
number of samples). The method is flexible enough to apply to Markov chains
which satisfy a geometric contraction hypothesis, assuming neither stationarity
nor reversibility, with the same convergence speed up to a power of logarithm
factor. Our results are stated as controls of the expected distance between the
empirical measure and its limit, but we explain briefly how the classical
method of bounded difference can be used to deduce concentration estimates.
| math.PR | we propose a decomposition method to prove nonasymptotic bound for the convergence of empirical measures in various dual norms the main point is to show that if one measures convergence in duality with sufficiently regular observables the convergence is much faster than for say merely lipschitz observables actually assuming s derivatives with s d2 d the dimension ensures an optimal rate of convergence of 1sqrtn n the number of samples the method is flexible enough to apply to markov chains which satisfy a geometric contraction hypothesis assuming neither stationarity nor reversibility with the same convergence speed up to a power of logarithm factor our results are stated as controls of the expected distance between the empirical measure and its limit but we explain briefly how the classical method of bounded difference can be used to deduce concentration estimates | [['we', 'propose', 'a', 'decomposition', 'method', 'to', 'prove', 'nonasymptotic', 'bound', 'for', 'the', 'convergence', 'of', 'empirical', 'measures', 'in', 'various', 'dual', 'norms', 'the', 'main', 'point', 'is', 'to', 'show', 'that', 'if', 'one', 'measures', 'convergence', 'in', 'duality', 'with', 'sufficiently', 'regular', 'observables', 'the', 'convergence', 'is', 'much', 'faster', 'than', 'for', 'say', 'merely', 'lipschitz', 'observables', 'actually', 'assuming', 's', 'derivatives', 'with', 's', 'd2', 'd', 'the', 'dimension', 'ensures', 'an', 'optimal', 'rate', 'of', 'convergence', 'of', '1sqrtn', 'n', 'the', 'number', 'of', 'samples', 'the', 'method', 'is', 'flexible', 'enough', 'to', 'apply', 'to', 'markov', 'chains', 'which', 'satisfy', 'a', 'geometric', 'contraction', 'hypothesis', 'assuming', 'neither', 'stationarity', 'nor', 'reversibility', 'with', 'the', 'same', 'convergence', 'speed', 'up', 'to', 'a', 'power', 'of', 'logarithm', 'factor', 'our', 'results', 'are', 'stated', 'as', 'controls', 'of', 'the', 'expected', 'distance', 'between', 'the', 'empirical', 'measure', 'and', 'its', 'limit', 'but', 'we', 'explain', 'briefly', 'how', 'the', 'classical', 'method', 'of', 'bounded', 'difference', 'can', 'be', 'used', 'to', 'deduce', 'concentration', 'estimates']] | [-0.08422197616301423, 0.08675160381929911, -0.13218399025904742, 0.11523160443175584, -0.029004996220675715, -0.15212223540984796, 0.06496805600498033, 0.35298455050350097, -0.3131795727202426, -0.24703454190213064, 0.12493023077326328, -0.24358363060172702, -0.08669036317724681, 0.18936822342051976, -0.09264720329657143, 0.062087307857481115, 0.035260010929103344, 0.08574493659619728, -0.10250899043656292, -0.27894149687600095, 0.26571021786388144, 0.03212538034236734, 0.28849450862406334, 0.060338041324175196, 0.1032045911018993, -0.04393387425933843, 0.005289312560057295, 0.009938804338267748, -0.16861497715945006, 0.13111240369186777, 0.19726826532986824, 0.1537003791384885, 0.28841710106834123, -0.3677802039175362, -0.1635812269979278, 0.17598327324536722, 0.14822834431939502, 0.05549393454482239, -0.00011861440662355365, -0.23199226188918817, 0.13442817741357113, -0.10856235530598601, -0.18139125657288116, -0.11121262493205891, 0.017925178605145302, 0.07431235856484568, -0.3476836178856699, 0.09381792030256728, 0.1126600671019675, 0.036940089497796216, -0.023743759916649888, -0.08852529993442737, 0.001554061700016314, 0.08649717409086104, 0.10817733148376094, 0.042541805722251316, 0.10850685356210991, -0.044427738656573325, -0.09164197410902251, 0.3355900288080338, -0.08852552342706485, -0.23729459233447045, 0.18980275260527496, -0.20222266530618072, -0.1271532913113175, 0.10079105131064905, 0.13178994689825113, 0.1358797108700526, -0.11198646350817727, 0.10227315313059607, -0.03129834782980059, 0.18220465472478425, 0.08053024459049861, 0.05805868048565057, 0.07931659595477328, 0.12079090768120428, 0.1791599150274651, 0.13559461111688745, -0.03273183367876471, -0.10414096751871209, -0.35375807200140064, -0.14461036087764575, -0.2167259194176185, 0.09160978780615235, -0.16608135127856824, -0.1465168736767078, 0.2968718756084749, 0.14831778320418063, 0.2043458480063988, 0.16147518123456184, 0.253092766729305, 0.1355899202559764, 0.03427952910398902, 0.12705845191764334, 0.22231172698050522, 0.17580292030386085, 0.03704901057484465, -0.19264982837805714, 0.11676050474583778, 0.13771103155506906] |
1,802.04039 | Separation for the stationary Prandtl equation | In this paper, we prove that separation occurs for the stationary Prandtl
equation, in the case of adverse pressure gradient, for a large class of
boundary data at $x=0$.We justify the Goldstein singularity: more precisely, we
prove that under suitable assumptions on the boundary data at $x=0$, there
exists $x^*>0$ such that $\p\_y u\_{y=0}(x)\sim C \sqrt{x^* -x}$ as $x\to x^*$
for some positive constant $C$, where $u$ is the solution of the stationary
Prandtl equation in the domain $\{0<x<x^*,\ y>0\}$. Our proof relies on three
main ingredients: the computation of a "stable" approximate solution, using
modulation theory arguments, a new formulation of the Prandtl equation, for
which we derive energy estimates, relying heavily on the structure of the
equation, and maximum principle techniques to handle nonlinear terms.
| math.AP | in this paper we prove that separation occurs for the stationary prandtl equation in the case of adverse pressure gradient for a large class of boundary data at x0we justify the goldstein singularity more precisely we prove that under suitable assumptions on the boundary data at x0 there exists x0 such that p_y u_y0xsim c sqrtx x as xto x for some positive constant c where u is the solution of the stationary prandtl equation in the domain 0xx y0 our proof relies on three main ingredients the computation of a stable approximate solution using modulation theory arguments a new formulation of the prandtl equation for which we derive energy estimates relying heavily on the structure of the equation and maximum principle techniques to handle nonlinear terms | [['in', 'this', 'paper', 'we', 'prove', 'that', 'separation', 'occurs', 'for', 'the', 'stationary', 'prandtl', 'equation', 'in', 'the', 'case', 'of', 'adverse', 'pressure', 'gradient', 'for', 'a', 'large', 'class', 'of', 'boundary', 'data', 'at', 'x0we', 'justify', 'the', 'goldstein', 'singularity', 'more', 'precisely', 'we', 'prove', 'that', 'under', 'suitable', 'assumptions', 'on', 'the', 'boundary', 'data', 'at', 'x0', 'there', 'exists', 'x0', 'such', 'that', 'p_y', 'u_y0xsim', 'c', 'sqrtx', 'x', 'as', 'xto', 'x', 'for', 'some', 'positive', 'constant', 'c', 'where', 'u', 'is', 'the', 'solution', 'of', 'the', 'stationary', 'prandtl', 'equation', 'in', 'the', 'domain', '0xx', 'y0', 'our', 'proof', 'relies', 'on', 'three', 'main', 'ingredients', 'the', 'computation', 'of', 'a', 'stable', 'approximate', 'solution', 'using', 'modulation', 'theory', 'arguments', 'a', 'new', 'formulation', 'of', 'the', 'prandtl', 'equation', 'for', 'which', 'we', 'derive', 'energy', 'estimates', 'relying', 'heavily', 'on', 'the', 'structure', 'of', 'the', 'equation', 'and', 'maximum', 'principle', 'techniques', 'to', 'handle', 'nonlinear', 'terms']] | [-0.17001483326443592, 0.05394816771900702, -0.10273060474484678, 0.057977595026679936, -0.07261144981584361, -0.1601161968841728, 0.07602543441668874, 0.28230755068662183, -0.27892474565775166, -0.2258399873971939, 0.13464386313834467, -0.2695922133693051, -0.09548183557795241, 0.1914099215834041, -0.053409595598021685, 0.05908706023417894, 0.05734543071969623, 0.04118619282774988, -0.08851327215914705, -0.20784245801135717, 0.38738034566819307, -0.07514051236813107, 0.26533367432233307, 0.06264544145960826, 0.15500074636844557, -0.01052814771819319, 0.05154259822654327, -0.0014857568838182956, -0.2194876327627548, 0.07307285184581433, 0.23491204276327945, 0.060621474373845324, 0.28574161487443733, -0.40839249330371874, -0.2136722882315817, 0.08467850757897982, 0.09802843275341025, 0.06936265766759583, -0.049923759981480076, -0.23099874433002346, 0.1380185928916739, -0.08639499812477058, -0.18081950897636312, -0.06806061199055083, 0.04530297967064525, 0.034107553006540385, -0.3419976789234844, 0.11311099713202566, 0.10629909597956876, 0.04835150559102335, -0.09847334312085408, -0.14046099640038465, -0.040543216624252136, 0.02979480098902939, 0.0922253437006035, 0.045112200194947244, 0.044991616294869495, -0.12207094188441613, -0.011029567321642272, 0.338576277312372, -0.08549609877950241, -0.2499724889414445, 0.14201988120217837, -0.13455509244193953, -0.16001375873888574, 0.11023383651157811, 0.14207845310410183, 0.19389818706399492, -0.10291048994845516, 0.16814201559088449, -0.062102638374668576, 0.16923449776555982, 0.09803373880323864, -0.01884964553298027, 0.10463628125604198, 0.13384926515150694, 0.13195392832670721, 0.08713319564656323, -0.07030458140164433, -0.07919697769572057, -0.3753534508869052, -0.1726595557204658, -0.18807066525633057, 0.1025394315027722, -0.12702240073720591, -0.1891496377666631, 0.30306611751626816, 0.148138162039686, 0.17632822765998782, 0.04892863084716091, 0.2562585680458259, 0.1741491469982711, -0.025283309048973024, 0.10361939397520356, 0.1729928080178891, 0.14528513760230835, 0.12933016705867503, -0.2100638816660766, 0.060145924701505614, 0.13491914357854834] |
1,802.0404 | Yield precursor dislocation avalanches in small crystals: the
irreversibility transition | The transition from elastic to plastic deformation in crystalline metals
shares history dependence and scale-invariant avalanche signature with other
non-equilibrium systems under external loading: dilute colloidal suspensions,
plastically-deformed amorphous solids, granular materials, and
dislocation-based simulations of crystals. These other systems exhibit
transitions with clear analogies to work hardening and yield stress, with many
typically undergoing purely elastic behavior only after 'training' through
repeated cyclic loading; studies in these other systems show a power law
scaling of the hysteresis loop extent and of the training time as the peak load
approaches a so-called reversible-irreversible transition (RIT). We discover
here that deformation of small crystals shares these key characteristics:
yielding and hysteresis in uniaxial compression experiments of
single-crystalline Cu nano- and micro-pillars decay under repeated cyclic
loading. The amplitude and decay time of the yield precursor avalanches diverge
as the peak stress approaches failure stress for each pillar, with a power law
scaling virtually equivalent to RITs in other nonequilibrium systems.
| cond-mat.mtrl-sci cond-mat.stat-mech | the transition from elastic to plastic deformation in crystalline metals shares history dependence and scaleinvariant avalanche signature with other nonequilibrium systems under external loading dilute colloidal suspensions plasticallydeformed amorphous solids granular materials and dislocationbased simulations of crystals these other systems exhibit transitions with clear analogies to work hardening and yield stress with many typically undergoing purely elastic behavior only after training through repeated cyclic loading studies in these other systems show a power law scaling of the hysteresis loop extent and of the training time as the peak load approaches a socalled reversibleirreversible transition rit we discover here that deformation of small crystals shares these key characteristics yielding and hysteresis in uniaxial compression experiments of singlecrystalline cu nano and micropillars decay under repeated cyclic loading the amplitude and decay time of the yield precursor avalanches diverge as the peak stress approaches failure stress for each pillar with a power law scaling virtually equivalent to rits in other nonequilibrium systems | [['the', 'transition', 'from', 'elastic', 'to', 'plastic', 'deformation', 'in', 'crystalline', 'metals', 'shares', 'history', 'dependence', 'and', 'scaleinvariant', 'avalanche', 'signature', 'with', 'other', 'nonequilibrium', 'systems', 'under', 'external', 'loading', 'dilute', 'colloidal', 'suspensions', 'plasticallydeformed', 'amorphous', 'solids', 'granular', 'materials', 'and', 'dislocationbased', 'simulations', 'of', 'crystals', 'these', 'other', 'systems', 'exhibit', 'transitions', 'with', 'clear', 'analogies', 'to', 'work', 'hardening', 'and', 'yield', 'stress', 'with', 'many', 'typically', 'undergoing', 'purely', 'elastic', 'behavior', 'only', 'after', 'training', 'through', 'repeated', 'cyclic', 'loading', 'studies', 'in', 'these', 'other', 'systems', 'show', 'a', 'power', 'law', 'scaling', 'of', 'the', 'hysteresis', 'loop', 'extent', 'and', 'of', 'the', 'training', 'time', 'as', 'the', 'peak', 'load', 'approaches', 'a', 'socalled', 'reversibleirreversible', 'transition', 'rit', 'we', 'discover', 'here', 'that', 'deformation', 'of', 'small', 'crystals', 'shares', 'these', 'key', 'characteristics', 'yielding', 'and', 'hysteresis', 'in', 'uniaxial', 'compression', 'experiments', 'of', 'singlecrystalline', 'cu', 'nano', 'and', 'micropillars', 'decay', 'under', 'repeated', 'cyclic', 'loading', 'the', 'amplitude', 'and', 'decay', 'time', 'of', 'the', 'yield', 'precursor', 'avalanches', 'diverge', 'as', 'the', 'peak', 'stress', 'approaches', 'failure', 'stress', 'for', 'each', 'pillar', 'with', 'a', 'power', 'law', 'scaling', 'virtually', 'equivalent', 'to', 'rits', 'in', 'other', 'nonequilibrium', 'systems']] | [-0.13476066959173053, 0.23244101172710968, -0.10850260220468044, -0.03447721567950978, -0.012959022192826753, -0.1930945060846596, 0.03173166208994822, 0.40035818288503566, -0.29239177911765607, -0.2635249775986164, 0.059432492232616235, -0.2846604766489207, -0.15724947063334851, 0.19090911680744088, -0.0021040639339038464, 0.10971076232734832, 0.01828506188702923, -0.033147366864818936, -0.06801419848019163, -0.19925611236285937, 0.24041784399106533, 0.05337297184322076, 0.37962809727892655, 0.012925187310740304, 0.052934989015589455, -0.025520215093900886, 0.06013872003465702, 0.06447715052297409, -0.16910503877355765, 0.0018439079587689684, 0.2400374240875598, -0.04832112910579654, 0.19414877277339185, -0.49346720914156, -0.25053680050511007, 0.09611078138651821, 0.10070940693309885, 0.0787477818246978, -0.04971671825911425, -0.18778938578612678, 0.03312119783810045, -0.16046854995096785, -0.08996122839633681, -0.08818106613228027, 0.037585515287245, 0.0807614061315367, -0.2187487301895619, 0.15411325495637057, 0.10075148818955486, 0.10605754854475867, -0.10041243460359453, -0.06533648875907441, -0.004017723621093208, 0.07353697293747476, 0.10309381091589981, -0.04123413502135538, 0.28585348527324445, -0.141941871068181, -0.09060587919880106, 0.41074798226097153, -0.008695742721032776, -0.06296851679894931, 0.20507186259580718, -0.1470576625632688, -0.12757006230251275, 0.20563887589599325, 0.16467868630911364, 0.02353552110757328, -0.12989444974618317, -0.01889001351119538, 0.03789999865178208, 0.1821270617818507, 0.09754576903172545, 0.024437532819147352, 0.20635827089648082, 0.19700391958998162, -0.03194413542831494, 0.16187024517485848, -0.06395087143571317, -0.09104520558450324, -0.2652253565257651, -0.14941757802757186, -0.1596313979523846, 0.08331056591123343, -0.12274161064225511, -0.2216396420255386, 0.3143801913166395, 0.07211472536142491, 0.16979136808386333, 0.04902071547930282, 0.22305714865391957, 0.0482982600172628, 0.10233819487289514, 0.009231872575157144, 0.2514620945844917, 0.14203413415264007, 0.15617674201449874, -0.2655930905381831, 0.09427576569274446, 0.014679851658830914] |
1,802.04041 | Cooperative Passive Coherent Location: A Promising 5G Service to Support
Road Safety | 5G promises many new vertical service areas beyond simple communication and
data transfer. We propose CPCL (cooperative passive coherent location), a
distributed MIMO radar service, which can be offered by mobile radio network
operators as a service for public user groups. CPCL comes as an inherent part
of the radio network and takes advantage of the most important key features
proposed for 5G. It extends the well-known idea of passive radar (also known as
passive coherent location, PCL) by introducing cooperative principles. These
range from cooperative, synchronous radio signaling, and MAC up to radar data
fusion on sensor and scenario levels. By using software-defined radio and
network paradigms, as well as real-time mobile edge computing facilities
intended for 5G, CPCL promises to become a ubiquitous radar service which may
be adaptive, reconfigurable, and perhaps cognitive. As CPCL makes double use of
radio resources (both in terms of frequency bands and hardware), it can be
considered a green technology. Although we introduce the CPCL idea from the
viewpoint of vehicle-to-vehicle/infrastructure (V2X) communication, it can
definitely also be applied to many other applications in industry, transport,
logistics, and for safety and security applications.
| eess.SP | 5g promises many new vertical service areas beyond simple communication and data transfer we propose cpcl cooperative passive coherent location a distributed mimo radar service which can be offered by mobile radio network operators as a service for public user groups cpcl comes as an inherent part of the radio network and takes advantage of the most important key features proposed for 5g it extends the wellknown idea of passive radar also known as passive coherent location pcl by introducing cooperative principles these range from cooperative synchronous radio signaling and mac up to radar data fusion on sensor and scenario levels by using softwaredefined radio and network paradigms as well as realtime mobile edge computing facilities intended for 5g cpcl promises to become a ubiquitous radar service which may be adaptive reconfigurable and perhaps cognitive as cpcl makes double use of radio resources both in terms of frequency bands and hardware it can be considered a green technology although we introduce the cpcl idea from the viewpoint of vehicletovehicleinfrastructure v2x communication it can definitely also be applied to many other applications in industry transport logistics and for safety and security applications | [['5g', 'promises', 'many', 'new', 'vertical', 'service', 'areas', 'beyond', 'simple', 'communication', 'and', 'data', 'transfer', 'we', 'propose', 'cpcl', 'cooperative', 'passive', 'coherent', 'location', 'a', 'distributed', 'mimo', 'radar', 'service', 'which', 'can', 'be', 'offered', 'by', 'mobile', 'radio', 'network', 'operators', 'as', 'a', 'service', 'for', 'public', 'user', 'groups', 'cpcl', 'comes', 'as', 'an', 'inherent', 'part', 'of', 'the', 'radio', 'network', 'and', 'takes', 'advantage', 'of', 'the', 'most', 'important', 'key', 'features', 'proposed', 'for', '5g', 'it', 'extends', 'the', 'wellknown', 'idea', 'of', 'passive', 'radar', 'also', 'known', 'as', 'passive', 'coherent', 'location', 'pcl', 'by', 'introducing', 'cooperative', 'principles', 'these', 'range', 'from', 'cooperative', 'synchronous', 'radio', 'signaling', 'and', 'mac', 'up', 'to', 'radar', 'data', 'fusion', 'on', 'sensor', 'and', 'scenario', 'levels', 'by', 'using', 'softwaredefined', 'radio', 'and', 'network', 'paradigms', 'as', 'well', 'as', 'realtime', 'mobile', 'edge', 'computing', 'facilities', 'intended', 'for', '5g', 'cpcl', 'promises', 'to', 'become', 'a', 'ubiquitous', 'radar', 'service', 'which', 'may', 'be', 'adaptive', 'reconfigurable', 'and', 'perhaps', 'cognitive', 'as', 'cpcl', 'makes', 'double', 'use', 'of', 'radio', 'resources', 'both', 'in', 'terms', 'of', 'frequency', 'bands', 'and', 'hardware', 'it', 'can', 'be', 'considered', 'a', 'green', 'technology', 'although', 'we', 'introduce', 'the', 'cpcl', 'idea', 'from', 'the', 'viewpoint', 'of', 'vehicletovehicleinfrastructure', 'v2x', 'communication', 'it', 'can', 'definitely', 'also', 'be', 'applied', 'to', 'many', 'other', 'applications', 'in', 'industry', 'transport', 'logistics', 'and', 'for', 'safety', 'and', 'security', 'applications']] | [-0.1862504423510185, 0.052077316242885946, -0.009439278329036346, 0.033048414527193495, -0.10075347760790272, -0.22942505942069386, 0.06803038511425256, 0.4088473041198756, -0.2964861759309363, -0.2899440637201463, 0.11942642377076769, -0.19924200484284052, -0.22255973250629674, 0.23739977861803613, -0.1393275379656667, 0.07066553194676281, 0.01752352954354137, -0.033235543044774156, 0.04892478028900529, -0.16448819452994748, 0.26201380783091544, 0.11183478470009409, 0.3719697488692442, 0.06077247064217533, 0.03905323658898277, 0.02372057780525402, -0.03379693480551635, -0.06564758300572927, -0.0011937648278514022, 0.13928590656049844, 0.399980149176707, 0.22734285020514539, 0.2899283762629095, -0.4470097299077009, -0.2758990557227088, 0.0645598913426511, 0.1991358473005484, 0.04185199558391775, -0.06541677951310321, -0.31659076423629334, 0.09611861907484892, -0.298939192391883, -0.10948987499149027, -0.020114638976826284, -0.04549254752254408, 0.05753928232741983, -0.27706923175505116, -0.03634658127955749, -0.024556693598309434, 0.049315474648028615, -0.04470694975584353, -0.07944443578292665, 0.020900672374562803, 0.2056116628405442, -0.00830120347152268, -0.0020389693544099205, 0.1737834800702618, -0.13318648112839773, -0.16528795685275996, 0.43241209130440106, 0.01570572062383259, -0.11484150946949069, 0.22310531767036176, -0.021759047185217862, -0.15401864454738404, 0.08018233980983495, 0.23686077557994348, 0.021376368881350284, -0.20175653811678976, 0.029196274358668905, 0.011166826611090648, 0.13311272544332928, 0.05424038549198916, 0.1547011228302788, 0.21852507472565202, 0.20074485537326453, 0.1540994556320488, 0.09761762749189266, -0.12086054580217215, -0.11171066247441462, -0.18370247996645048, -0.13360802958057702, -0.2020115845187224, 0.03598678976566972, -0.06187941772353186, -0.08702501503652647, 0.35766738794351877, 0.1419478714521239, 0.06111831203054049, 0.07466951152432318, 0.42114300184736125, 0.05738401060899426, 0.1511790029508503, 0.11741719303750678, 0.1827728682932885, 0.054933167545517025, 0.22556192576885223, -0.11939935726481245, 0.06696459993989648, -0.028960297223621687] |
1,802.04042 | Equilibrium contact angle and adsorption layer properties with
surfactants | The three-phase contact line of a droplet on a smooth surface can be
characterized by the Young-Dupr\'e equation. It relates the interfacial
energies with the macroscopic contact angle $\theta_e$. On the mesoscale,
wettability is modeled by a film-height-dependent wetting energy $f(h)$. Macro-
and mesoscale description are consistent if $\gamma \cos \theta_\mathrm{e}
=\gamma+f(h_\mathrm{a})$ where $\gamma$ and $h_\mathrm{a}$ are the liquid-gas
interface energy and the thickness of the equilibrium liquid adsorption layer,
respectively.
Here, we derive a similar consistency condition for the case of a liquid
covered by an insoluble surfactant. At equilibrium, the surfactant is spatially
inhomogeneously distributed implying a non-trivial dependence of
$\theta_\mathrm{e}$ on surfactant concentration. We derive macroscopic and
mesoscopic descriptions of a contact line at equilibrium and show that they are
only consistent if a particular dependence of the wetting energy on the
surfactant concentration is imposed.This is illustrated by a simple example of
dilute surfactants, for which we show excellent agreement between theory and
time-dependent numerical simulations.
| physics.flu-dyn | the threephase contact line of a droplet on a smooth surface can be characterized by the youngdupre equation it relates the interfacial energies with the macroscopic contact angle theta_e on the mesoscale wettability is modeled by a filmheightdependent wetting energy fh macro and mesoscale description are consistent if gamma cos theta_mathrme gammafh_mathrma where gamma and h_mathrma are the liquidgas interface energy and the thickness of the equilibrium liquid adsorption layer respectively here we derive a similar consistency condition for the case of a liquid covered by an insoluble surfactant at equilibrium the surfactant is spatially inhomogeneously distributed implying a nontrivial dependence of theta_mathrme on surfactant concentration we derive macroscopic and mesoscopic descriptions of a contact line at equilibrium and show that they are only consistent if a particular dependence of the wetting energy on the surfactant concentration is imposedthis is illustrated by a simple example of dilute surfactants for which we show excellent agreement between theory and timedependent numerical simulations | [['the', 'threephase', 'contact', 'line', 'of', 'a', 'droplet', 'on', 'a', 'smooth', 'surface', 'can', 'be', 'characterized', 'by', 'the', 'youngdupre', 'equation', 'it', 'relates', 'the', 'interfacial', 'energies', 'with', 'the', 'macroscopic', 'contact', 'angle', 'theta_e', 'on', 'the', 'mesoscale', 'wettability', 'is', 'modeled', 'by', 'a', 'filmheightdependent', 'wetting', 'energy', 'fh', 'macro', 'and', 'mesoscale', 'description', 'are', 'consistent', 'if', 'gamma', 'cos', 'theta_mathrme', 'gammafh_mathrma', 'where', 'gamma', 'and', 'h_mathrma', 'are', 'the', 'liquidgas', 'interface', 'energy', 'and', 'the', 'thickness', 'of', 'the', 'equilibrium', 'liquid', 'adsorption', 'layer', 'respectively', 'here', 'we', 'derive', 'a', 'similar', 'consistency', 'condition', 'for', 'the', 'case', 'of', 'a', 'liquid', 'covered', 'by', 'an', 'insoluble', 'surfactant', 'at', 'equilibrium', 'the', 'surfactant', 'is', 'spatially', 'inhomogeneously', 'distributed', 'implying', 'a', 'nontrivial', 'dependence', 'of', 'theta_mathrme', 'on', 'surfactant', 'concentration', 'we', 'derive', 'macroscopic', 'and', 'mesoscopic', 'descriptions', 'of', 'a', 'contact', 'line', 'at', 'equilibrium', 'and', 'show', 'that', 'they', 'are', 'only', 'consistent', 'if', 'a', 'particular', 'dependence', 'of', 'the', 'wetting', 'energy', 'on', 'the', 'surfactant', 'concentration', 'is', 'imposedthis', 'is', 'illustrated', 'by', 'a', 'simple', 'example', 'of', 'dilute', 'surfactants', 'for', 'which', 'we', 'show', 'excellent', 'agreement', 'between', 'theory', 'and', 'timedependent', 'numerical', 'simulations']] | [-0.13583269719189653, 0.17920509249784233, -0.10603008488228974, 0.011476430785245238, 0.004518663412174926, -0.18247277517385113, 0.027164204046876434, 0.3606076050812426, -0.24059515905220252, -0.28470184085875727, 0.04553214608966254, -0.28582792330342227, -0.11934387300294848, 0.15897246798536238, 0.0002368041992341228, 0.027400438548423924, 0.011806313927548055, -0.008820045423001433, -0.04770437467064207, -0.1390105445499126, 0.2974603892795037, 0.03456186864357919, 0.2746130101090202, 0.16479132797580975, 0.10734075128745574, -0.03260062174507393, 0.05632737611318962, 0.11900510668802337, -0.2562828130040333, 0.04166527904976064, 0.2274943341826423, -0.07882975650509486, 0.18004768626549497, -0.44409166872262573, -0.23768142629892397, 0.0204659428459425, 0.0896296814436284, 0.09306476485112515, -0.04744741440756629, -0.2517633258875531, 0.041169422171198025, -0.1250113486058604, -0.1573662534579993, -0.020946058734224584, 0.003156599170791033, 0.09846361020978432, -0.24245414603352308, 0.13786659195335607, 0.037180488248570606, 0.08325018212557413, -0.08438631305650163, -0.08735763816795765, -0.11979652056470513, 0.06009971882136037, 0.029829707426520493, -0.024900739781188373, 0.22304308213866675, -0.12138800757328191, 0.026887641556990836, 0.372820369564952, -0.06019409906002693, -0.19691843063069078, 0.20431653809590408, -0.12665855613513252, -0.06314350645977986, 0.20309465219123432, 0.11993152643210636, 0.12007492784267434, -0.14044519846375364, 0.0745278679988144, -0.08435167572222269, 0.221324409931325, 0.10170402783804978, -0.0877134468953908, 0.2395297016005199, 0.2190630641237546, 0.07133627981574346, 0.11337300076877746, -0.09350253489966957, -0.1232605891642519, -0.31409537228636253, -0.2016527309971981, -0.1903755772867813, 0.06049129182102684, -0.13278987583982646, -0.19014581841512176, 0.32496502104764563, 0.04329737426581769, 0.15282411315741065, 0.05731641841852345, 0.2225720141079644, 0.10082640366528768, -0.03814280799437816, 0.057153356088420905, 0.24262325044196004, 0.14760972382142568, 0.08876253127639827, -0.26453883159243, 0.12315257450935836, 0.05680554502834685] |
1,802.04043 | The HIX galaxy survey II: HI kinematics of HI eXtreme galaxies | By analysing a sample of galaxies selected from the HI Parkes All Sky Survey
(HIPASS) to contain more than 2.5 times their expected HI content based on
their optical properties, we investigate what drives these HI eXtreme (HIX)
galaxies to be so HI-rich. We model the HI kinematics with the Tilted Ring
Fitting Code TiRiFiC and compare the observed HIX galaxies to a control sample
of galaxies from HIPASS as well as simulated galaxies built with the
semi-analytic model Dark Sage. We find that (1) HI discs in HIX galaxies are
more likely to be warped and more likely to host HI arms and tails than in the
control galaxies, (2) the average HI and average stellar column density of HIX
galaxies is comparable to the control sample, (3) HIX galaxies have higher HI
and baryonic specific angular momenta than control galaxies, (4) most HIX
galaxies live in higher-spin haloes than most control galaxies. These results
suggest that HIX galaxies are HI-rich because they can support more HI against
gravitational instability due to their high specific angular momentum. The
majority of the HIX galaxies inherits their high specific angular momentum from
their halo. The HI content of HIX galaxies might be further increased by
gas-rich minor mergers. This paper is based on data obtained with the Australia
Telescope Compact Array (ATCA) through the large program C 2705.
| astro-ph.GA | by analysing a sample of galaxies selected from the hi parkes all sky survey hipass to contain more than 25 times their expected hi content based on their optical properties we investigate what drives these hi extreme hix galaxies to be so hirich we model the hi kinematics with the tilted ring fitting code tirific and compare the observed hix galaxies to a control sample of galaxies from hipass as well as simulated galaxies built with the semianalytic model dark sage we find that 1 hi discs in hix galaxies are more likely to be warped and more likely to host hi arms and tails than in the control galaxies 2 the average hi and average stellar column density of hix galaxies is comparable to the control sample 3 hix galaxies have higher hi and baryonic specific angular momenta than control galaxies 4 most hix galaxies live in higherspin haloes than most control galaxies these results suggest that hix galaxies are hirich because they can support more hi against gravitational instability due to their high specific angular momentum the majority of the hix galaxies inherits their high specific angular momentum from their halo the hi content of hix galaxies might be further increased by gasrich minor mergers this paper is based on data obtained with the australia telescope compact array atca through the large program c 2705 | [['by', 'analysing', 'a', 'sample', 'of', 'galaxies', 'selected', 'from', 'the', 'hi', 'parkes', 'all', 'sky', 'survey', 'hipass', 'to', 'contain', 'more', 'than', '25', 'times', 'their', 'expected', 'hi', 'content', 'based', 'on', 'their', 'optical', 'properties', 'we', 'investigate', 'what', 'drives', 'these', 'hi', 'extreme', 'hix', 'galaxies', 'to', 'be', 'so', 'hirich', 'we', 'model', 'the', 'hi', 'kinematics', 'with', 'the', 'tilted', 'ring', 'fitting', 'code', 'tirific', 'and', 'compare', 'the', 'observed', 'hix', 'galaxies', 'to', 'a', 'control', 'sample', 'of', 'galaxies', 'from', 'hipass', 'as', 'well', 'as', 'simulated', 'galaxies', 'built', 'with', 'the', 'semianalytic', 'model', 'dark', 'sage', 'we', 'find', 'that', '1', 'hi', 'discs', 'in', 'hix', 'galaxies', 'are', 'more', 'likely', 'to', 'be', 'warped', 'and', 'more', 'likely', 'to', 'host', 'hi', 'arms', 'and', 'tails', 'than', 'in', 'the', 'control', 'galaxies', '2', 'the', 'average', 'hi', 'and', 'average', 'stellar', 'column', 'density', 'of', 'hix', 'galaxies', 'is', 'comparable', 'to', 'the', 'control', 'sample', '3', 'hix', 'galaxies', 'have', 'higher', 'hi', 'and', 'baryonic', 'specific', 'angular', 'momenta', 'than', 'control', 'galaxies', '4', 'most', 'hix', 'galaxies', 'live', 'in', 'higherspin', 'haloes', 'than', 'most', 'control', 'galaxies', 'these', 'results', 'suggest', 'that', 'hix', 'galaxies', 'are', 'hirich', 'because', 'they', 'can', 'support', 'more', 'hi', 'against', 'gravitational', 'instability', 'due', 'to', 'their', 'high', 'specific', 'angular', 'momentum', 'the', 'majority', 'of', 'the', 'hix', 'galaxies', 'inherits', 'their', 'high', 'specific', 'angular', 'momentum', 'from', 'their', 'halo', 'the', 'hi', 'content', 'of', 'hix', 'galaxies', 'might', 'be', 'further', 'increased', 'by', 'gasrich', 'minor', 'mergers', 'this', 'paper', 'is', 'based', 'on', 'data', 'obtained', 'with', 'the', 'australia', 'telescope', 'compact', 'array', 'atca', 'through', 'the', 'large', 'program', 'c', '2705']] | [-0.0547190520631371, 0.0557166743943558, -0.04527117211642441, 0.1281680184552889, -0.13300453272693286, -0.033184606442433096, -0.006722652332319792, 0.47425985954997296, -0.061728074823584125, -0.3373327437903125, 0.052848385702839146, -0.3097298489452754, -0.029893750406900167, 0.1969677762852547, 0.001957968295867748, -0.018535993096833056, 0.008003889843062518, -0.16488859758380028, -0.05070326230816937, -0.35696620238731547, 0.3142122206286351, 0.10435269048256955, 0.16298198545226492, -0.12633420959820701, 0.07998494318653604, -0.13473729902697884, -0.14433810172606637, -0.0393245839175362, -0.1577178691845261, 0.03659439242818282, 0.2901575939590317, 0.15075221322969193, 0.203069390763943, -0.3817005716351752, -0.1296996224147477, 0.0970926176682771, 0.24336262323200245, 0.06792493669227964, -0.0904997441107879, -0.3095916481319372, 0.11034283926838698, -0.22324125860489158, -0.16828596563640538, 0.046469053286353396, 0.033674912219497866, 0.07823045578854987, -0.15670945420491997, 0.17081317886308098, 0.012135238602597447, 0.1120360039076091, -0.07986221795015463, -0.13705026935827036, -0.13457697750703074, 0.03864932123013661, -0.0021863167598794343, 0.09253498341730233, 0.29433187227778235, -0.1855970196587973, 0.03324851611145005, 0.43151046216204797, -0.02756418548406426, -0.022504118677343567, 0.2524067659237697, -0.2569494339748232, -0.1712437277000258, 0.10136694167607303, 0.1863098582637492, 0.08066910823872764, -0.135539819888508, 0.0034068242791888306, -0.062724621099264, 0.23053001020604227, 0.028154822464392312, 0.0909298711255324, 0.3274122573012724, 0.009242818703144657, 0.12200501730877368, 0.058640503658428954, -0.18888804712845628, -0.0031060193531858298, -0.1687461775583974, -0.08815999307755856, -0.12668002315177398, 0.1159427050615985, -0.15095921185877664, -0.04675803929649392, 0.32001099165217206, 0.10616822224970658, 0.2622856704142798, 0.12834740338779346, 0.3412804068907242, 0.0544039813913446, 0.18786710098648388, 0.14151501478134995, 0.25995181761025593, 0.1579590464577013, 0.04931203359820047, -0.21859074068575737, 0.04416579211803588, -0.055696829700112215] |
1,802.04044 | Estimation of the masses of selected stars of Pulkovo program by means
of astrometry methods | Stars of Pulkovo observatory program are observed on 65-cm refractor during
many years for study their positions and movement. We represent example of two
visual binary stars, for which orbits and masses of components were determined,
and two astrometric stars, for which masses of their unseen companions have
been estimated. The first stars are: ADS 14636 (61 Cygni) and ADS 7251 and
others are: Gliese 623 and ADS 8035 (Alpha UMa). The direct astrometric methods
were used for estimation of mass-ratio and masses.
| astro-ph.SR | stars of pulkovo observatory program are observed on 65cm refractor during many years for study their positions and movement we represent example of two visual binary stars for which orbits and masses of components were determined and two astrometric stars for which masses of their unseen companions have been estimated the first stars are ads 14636 61 cygni and ads 7251 and others are gliese 623 and ads 8035 alpha uma the direct astrometric methods were used for estimation of massratio and masses | [['stars', 'of', 'pulkovo', 'observatory', 'program', 'are', 'observed', 'on', '65cm', 'refractor', 'during', 'many', 'years', 'for', 'study', 'their', 'positions', 'and', 'movement', 'we', 'represent', 'example', 'of', 'two', 'visual', 'binary', 'stars', 'for', 'which', 'orbits', 'and', 'masses', 'of', 'components', 'were', 'determined', 'and', 'two', 'astrometric', 'stars', 'for', 'which', 'masses', 'of', 'their', 'unseen', 'companions', 'have', 'been', 'estimated', 'the', 'first', 'stars', 'are', 'ads', '14636', '61', 'cygni', 'and', 'ads', '7251', 'and', 'others', 'are', 'gliese', '623', 'and', 'ads', '8035', 'alpha', 'uma', 'the', 'direct', 'astrometric', 'methods', 'were', 'used', 'for', 'estimation', 'of', 'massratio', 'and', 'masses']] | [-0.09966668046545238, 0.13606373804504984, -0.06524687523487956, 0.08258129390160321, -0.14013654141454027, -0.11173427653266117, 0.0583836630161386, 0.4365933847613633, -0.08140806567389518, -0.40827690145233647, 0.12254001141118351, -0.33868494600756094, -0.03890499332919717, 0.26229884729254993, -0.059192430577240884, 0.0799214782367926, 0.160790305637056, 0.010622206913831178, -0.05373410243191756, -0.3065571281593293, 0.2996542623382993, -0.009589274605968968, 0.07203648104332387, -0.11202729878714308, 0.07845576715189964, -0.07456795805483125, -0.10478182657971047, -0.04522245298139751, -0.139200484380126, 0.04998906099935994, 0.26340214628726244, 0.17548740387137512, 0.16718305376707576, -0.284509706730023, -0.15637892541126347, 0.03521199333481491, 0.15651113272760994, 0.03355426802008878, -0.037098629711545074, -0.3588924876137753, 0.10771026902366429, -0.19402719824574888, -0.12174708717502654, -0.028688008677272593, 0.11201813241932541, 0.0539253556256881, -0.2297172196675092, 0.06575287807900168, 0.01980267537292093, 0.13735973928123713, -0.20642448664293625, -0.19199560414999722, -0.07236361758259591, 0.18836177482735367, 0.07133504820521921, 0.0008770918851951137, 0.09073531897156499, -0.07442020578600932, -0.08736298550793435, 0.40443479937966914, -0.031628317781724036, -0.029928954505521688, 0.24694406667840668, -0.18163875048048794, -0.16772485901019535, 0.09994483325281181, 0.23823422668792774, 0.21083211518707684, -0.22711388629395515, 0.0038567961375520097, 0.03774902030127123, 0.1519806171534583, 0.16952300604316406, 0.049022804840933534, 0.3628618433140218, 0.0792196926777251, -0.048410733653963686, 0.014667529915459453, -0.2617630692460807, -0.040060134837403893, -0.16323068090714515, -0.15559263313189148, -0.09081135863089003, 0.0019460853189229965, -0.11186877265736257, -0.11369451966311317, 0.32710620637517424, 0.09650270075071603, 0.1576086907996796, 0.02552672219098895, 0.2353808788349852, 0.049278227853938004, 0.05527454447001219, 0.09643753233831376, 0.386159194476204, 0.1338451412098948, 0.10920864821528084, -0.2134940248215571, 0.04836592712672427, 0.06053380743251182] |
1,802.04045 | Spectroscopic evidence of topological phase transition in 3D Dirac
semimetal Cd$_3$(As$_{1-x}$P$_x$)$_2$ | We study the low-energy electronic structure of three-dimensional Dirac
semimetal, Cd$_3$(As$_{1-x}$P$_x$)$_2$ [$x$ = 0 and 0.34(3)], by employing the
angle-resolved photoemission spectroscopy (ARPES). We observe that the bulk
Dirac states in Cd$_3$(As$_{0.66}$P$_{0.34}$)$_2$ are gapped out with an energy
of 0.23 eV, contrary to the parent Cd$_3$As$_2$ in which the gapless Dirac
states have been observed. Thus, our results confirm the earlier predicted
topological phase transition in Cd$_3$As$_2$ with perturbation. We further
notice that the critical P substitution concentration, at which the two Dirac
points that are spread along the $c$-axis in Cd$_3$As$_2$ form a single Dirac
point at $\Gamma$, is much lower [x$_c$(P)$<$ 0.34(3)] than the predicted value
of x$_c$(P)=0.9. Therefore, our results suggest that the nontrivial band
topology of Cd$_3$As$_2$ is remarkably sensitive to the P substitution and can
only survive over a narrow substitution range, i.e., 0 $\leq$ x (P) $<$
0.34(3).
| cond-mat.mtrl-sci | we study the lowenergy electronic structure of threedimensional dirac semimetal cd_3as_1xp_x_2 x 0 and 0343 by employing the angleresolved photoemission spectroscopy arpes we observe that the bulk dirac states in cd_3as_066p_034_2 are gapped out with an energy of 023 ev contrary to the parent cd_3as_2 in which the gapless dirac states have been observed thus our results confirm the earlier predicted topological phase transition in cd_3as_2 with perturbation we further notice that the critical p substitution concentration at which the two dirac points that are spread along the caxis in cd_3as_2 form a single dirac point at gamma is much lower x_cp 0343 than the predicted value of x_cp09 therefore our results suggest that the nontrivial band topology of cd_3as_2 is remarkably sensitive to the p substitution and can only survive over a narrow substitution range ie 0 leq x p 0343 | [['we', 'study', 'the', 'lowenergy', 'electronic', 'structure', 'of', 'threedimensional', 'dirac', 'semimetal', 'cd_3as_1xp_x_2', 'x', '0', 'and', '0343', 'by', 'employing', 'the', 'angleresolved', 'photoemission', 'spectroscopy', 'arpes', 'we', 'observe', 'that', 'the', 'bulk', 'dirac', 'states', 'in', 'cd_3as_066p_034_2', 'are', 'gapped', 'out', 'with', 'an', 'energy', 'of', '023', 'ev', 'contrary', 'to', 'the', 'parent', 'cd_3as_2', 'in', 'which', 'the', 'gapless', 'dirac', 'states', 'have', 'been', 'observed', 'thus', 'our', 'results', 'confirm', 'the', 'earlier', 'predicted', 'topological', 'phase', 'transition', 'in', 'cd_3as_2', 'with', 'perturbation', 'we', 'further', 'notice', 'that', 'the', 'critical', 'p', 'substitution', 'concentration', 'at', 'which', 'the', 'two', 'dirac', 'points', 'that', 'are', 'spread', 'along', 'the', 'caxis', 'in', 'cd_3as_2', 'form', 'a', 'single', 'dirac', 'point', 'at', 'gamma', 'is', 'much', 'lower', 'x_cp', '0343', 'than', 'the', 'predicted', 'value', 'of', 'x_cp09', 'therefore', 'our', 'results', 'suggest', 'that', 'the', 'nontrivial', 'band', 'topology', 'of', 'cd_3as_2', 'is', 'remarkably', 'sensitive', 'to', 'the', 'p', 'substitution', 'and', 'can', 'only', 'survive', 'over', 'a', 'narrow', 'substitution', 'range', 'ie', '0', 'leq', 'x', 'p', '0343']] | [-0.16145137735251067, 0.21590780143963892, -0.08231478566101388, 0.02670748550546072, -0.03583644480997886, -0.16807544859720097, 0.14260511887867167, 0.39638831532573787, -0.24372230514047155, -0.28868758498920477, -0.03434993426882378, -0.38804078382520896, -0.11981114732654954, 0.15326918726044614, 0.053910268856165254, 0.021350987005870844, -0.0183758738592429, -6.0978212285840854e-05, -0.18737979224491594, -0.20169337713193364, 0.3039966496787425, 0.008482797840691132, 0.2845391058025585, 0.0649926387299986, -0.03499098648013466, -0.028266695454595207, 0.12761821432639778, 0.011379504650561274, -0.16782721835108427, 0.022090474497088217, 0.2607440466729357, -0.10196810603256513, 0.1779625528724864, -0.34274317232379015, -0.23713843481264252, 0.027788229062275936, 0.1640920823547935, 0.06587602421675093, -0.07124887122030275, -0.31194257268520154, 0.1455988381509298, -0.10506367019337157, -0.13883222450934135, -0.0841691461391747, -0.015054123938434583, -0.08242070700710072, -0.20054958105480392, 0.09646037653378764, 0.021250115855988384, 0.07625829578930701, -0.0858486269928002, -0.16851576994024758, -0.15315856780026757, 0.021477114449700584, 0.05290012956475434, 0.07392844911394776, 0.07581535944431696, -0.06531423347304013, -0.09718533239556827, 0.3937319696786395, -0.043330308055506, -0.08734133705982695, 0.13114988005996775, -0.25024345606578974, -0.12902459440806854, 0.21094023152524471, 0.05640094830195649, 0.12534785794391148, -0.05870158552990187, 0.12702153666380225, -0.07902393520613997, 0.17849451597831448, 0.05580505966951234, 0.06234703554166143, 0.23058852525023016, 0.12334744665144093, 0.0679730458026482, 0.036978914455571416, -0.14985186407895948, -0.007882850929635806, -0.2508599484555315, -0.18721168810346475, -0.22386304053572426, 0.12795231786920971, -0.05052908990794516, -0.1500491948015448, 0.38606808400030446, 0.1381865552039412, 0.2272061676873515, -0.02565798467612299, 0.1749696889048631, 0.13279430817414506, 0.048568660015429276, 0.05702558695676102, 0.25604608671172807, 0.10213620133488777, 0.09866337017023319, -0.23750140529254155, 0.041505552325532706, 0.0007594475772339797] |
1,802.04046 | Beyond Hammersley's Last-Passage Percolation: a discussion on possible
local and global constraints | Hammersley's Last-Passage Percolation (LPP), also known as Ulam's problem, is
a well-studied model that can be described as follows: consider $m$ points
chosen uniformly and independently in $[0,1]^2$, then what is the maximal
number $\mathcal{L}_m$ of points that can be collected by an up-right path? We
introduce here a generalization of this standard LPP, in order to allow for
more general constraints than the up-right condition (a $1$-Lipschitz condition
after rotation by $45^{\circ}$). We focus more specifically on two cases: (i)
when the constraint is a $\gamma$-H\"older (local) condition, we call it H-LPP;
(ii) when the constraint is a path-entropy (global) condition, we call it
E-LPP. These generalizations also allows us to deal with non-directed LPP. We
develop motivations for directed and non-directed constrained LPP, and we give
the correct order of $\mathcal{L}_m$ in a general manner.
| math.PR | hammersleys lastpassage percolation lpp also known as ulams problem is a wellstudied model that can be described as follows consider m points chosen uniformly and independently in 012 then what is the maximal number mathcall_m of points that can be collected by an upright path we introduce here a generalization of this standard lpp in order to allow for more general constraints than the upright condition a 1lipschitz condition after rotation by 45circ we focus more specifically on two cases i when the constraint is a gammaholder local condition we call it hlpp ii when the constraint is a pathentropy global condition we call it elpp these generalizations also allows us to deal with nondirected lpp we develop motivations for directed and nondirected constrained lpp and we give the correct order of mathcall_m in a general manner | [['hammersleys', 'lastpassage', 'percolation', 'lpp', 'also', 'known', 'as', 'ulams', 'problem', 'is', 'a', 'wellstudied', 'model', 'that', 'can', 'be', 'described', 'as', 'follows', 'consider', 'm', 'points', 'chosen', 'uniformly', 'and', 'independently', 'in', '012', 'then', 'what', 'is', 'the', 'maximal', 'number', 'mathcall_m', 'of', 'points', 'that', 'can', 'be', 'collected', 'by', 'an', 'upright', 'path', 'we', 'introduce', 'here', 'a', 'generalization', 'of', 'this', 'standard', 'lpp', 'in', 'order', 'to', 'allow', 'for', 'more', 'general', 'constraints', 'than', 'the', 'upright', 'condition', 'a', '1lipschitz', 'condition', 'after', 'rotation', 'by', '45circ', 'we', 'focus', 'more', 'specifically', 'on', 'two', 'cases', 'i', 'when', 'the', 'constraint', 'is', 'a', 'gammaholder', 'local', 'condition', 'we', 'call', 'it', 'hlpp', 'ii', 'when', 'the', 'constraint', 'is', 'a', 'pathentropy', 'global', 'condition', 'we', 'call', 'it', 'elpp', 'these', 'generalizations', 'also', 'allows', 'us', 'to', 'deal', 'with', 'nondirected', 'lpp', 'we', 'develop', 'motivations', 'for', 'directed', 'and', 'nondirected', 'constrained', 'lpp', 'and', 'we', 'give', 'the', 'correct', 'order', 'of', 'mathcall_m', 'in', 'a', 'general', 'manner']] | [-0.0967938308276374, 0.13632289131648442, -0.08958799745542584, 0.0936880096439617, -0.12041926780646597, -0.18722511867958086, 0.045882038635857124, 0.3751180290623947, -0.2808458987864907, -0.267834873466442, 0.13655918873242895, -0.24764213571853125, -0.15514781006646378, 0.1530934043608054, -0.11158737244291438, 0.028221255682270834, 0.04307468818776585, 0.06937519429699966, -0.056729961398782, -0.22299712263737564, 0.30572747862035476, 0.02343808726614548, 0.22989549820000926, 0.034550371717799594, 0.08149564716344078, 0.04893839111275695, 0.017684745370125814, 0.07732626653234076, -0.18260426923031142, 0.0898915032123181, 0.19513601645551346, 0.13936296716953317, 0.27366437150372397, -0.4053473677486181, -0.15750405585255337, 0.14011540602702924, 0.12326438074448594, 0.10242242214390664, 0.0023015077189214666, -0.23989072200600747, 0.12097807463724167, -0.13435492892922074, -0.15112392542478456, -0.03832715701449801, 0.014163287242667542, 0.011038010294928595, -0.3337161632401317, 0.03619516878173238, 0.09389235287628792, 0.009643835371416234, -0.021056601966955458, -0.06531519381915805, -0.0030607646848592493, 0.07254626252731584, 0.009488302676214113, 0.060942572151759154, 0.05665341324897276, -0.08053761423496461, -0.11376288766903733, 0.40366808391279646, -0.037869798794444826, -0.23906189725924007, 0.13494170949690873, -0.09860596736479137, -0.169833850601895, 0.05866281149425992, 0.15731779135832633, 0.15749746746452595, -0.17103925064934797, 0.07030776364397887, -0.10374698629257856, 0.11002064326571094, 0.06918361631946432, -0.020612725217964638, 0.15220016957313487, 0.15185485086834954, 0.18471310565299873, 0.1653876407917037, -0.06966041799298384, -0.0831734581678002, -0.31137014110055233, -0.11917960829342956, -0.13778477601741476, 0.06373941841776724, -0.07930233173936829, -0.12696806954163886, 0.35996058474260345, 0.15708254292883256, 0.23750354750599298, 0.10772667017040981, 0.23416579640987847, 0.13663416775805806, 0.017443135187581733, 0.08117934386159673, 0.17023540018298836, 0.10626162241247517, 0.060674318771257445, -0.1197095170798194, 0.06822946805989853, 0.10599809265523046] |
1,802.04047 | Entropy Inflection and Invisible Low-Energy States: Defensive Alliance
Example | Lower temperature leads to a higher probability of visiting low-energy
states. This intuitive belief underlies most physics-inspired strategies for
addressing hard optimization problems. For instance, the popular simulated
annealing (SA) dynamics is expected to approach a ground state if the
temperature is lowered appropriately. Here we demonstrate that this belief is
not always justified. Specifically, we employ the cavity method to analyze the
minimum strong defensive alliance problem and discover a bifurcation in the
solution space, induced by an inflection point in the entropy--energy profile.
While easily accessible configurations are associated with the
lower-free-energy branch, the low-energy configurations are associated with the
higher-free-energy branch within the same temperature range. There is a
discontinuous phase transition between the high-energy configurations and the
ground states, which generally cannot be followed by SA. We introduce an
energy-clamping strategy to obtain superior solutions by following the
higher-free-energy branch, overcoming the limitations of SA.
| cond-mat.stat-mech physics.comp-ph | lower temperature leads to a higher probability of visiting lowenergy states this intuitive belief underlies most physicsinspired strategies for addressing hard optimization problems for instance the popular simulated annealing sa dynamics is expected to approach a ground state if the temperature is lowered appropriately here we demonstrate that this belief is not always justified specifically we employ the cavity method to analyze the minimum strong defensive alliance problem and discover a bifurcation in the solution space induced by an inflection point in the entropyenergy profile while easily accessible configurations are associated with the lowerfreeenergy branch the lowenergy configurations are associated with the higherfreeenergy branch within the same temperature range there is a discontinuous phase transition between the highenergy configurations and the ground states which generally cannot be followed by sa we introduce an energyclamping strategy to obtain superior solutions by following the higherfreeenergy branch overcoming the limitations of sa | [['lower', 'temperature', 'leads', 'to', 'a', 'higher', 'probability', 'of', 'visiting', 'lowenergy', 'states', 'this', 'intuitive', 'belief', 'underlies', 'most', 'physicsinspired', 'strategies', 'for', 'addressing', 'hard', 'optimization', 'problems', 'for', 'instance', 'the', 'popular', 'simulated', 'annealing', 'sa', 'dynamics', 'is', 'expected', 'to', 'approach', 'a', 'ground', 'state', 'if', 'the', 'temperature', 'is', 'lowered', 'appropriately', 'here', 'we', 'demonstrate', 'that', 'this', 'belief', 'is', 'not', 'always', 'justified', 'specifically', 'we', 'employ', 'the', 'cavity', 'method', 'to', 'analyze', 'the', 'minimum', 'strong', 'defensive', 'alliance', 'problem', 'and', 'discover', 'a', 'bifurcation', 'in', 'the', 'solution', 'space', 'induced', 'by', 'an', 'inflection', 'point', 'in', 'the', 'entropyenergy', 'profile', 'while', 'easily', 'accessible', 'configurations', 'are', 'associated', 'with', 'the', 'lowerfreeenergy', 'branch', 'the', 'lowenergy', 'configurations', 'are', 'associated', 'with', 'the', 'higherfreeenergy', 'branch', 'within', 'the', 'same', 'temperature', 'range', 'there', 'is', 'a', 'discontinuous', 'phase', 'transition', 'between', 'the', 'highenergy', 'configurations', 'and', 'the', 'ground', 'states', 'which', 'generally', 'can', 'not', 'be', 'followed', 'by', 'sa', 'we', 'introduce', 'an', 'energyclamping', 'strategy', 'to', 'obtain', 'superior', 'solutions', 'by', 'following', 'the', 'higherfreeenergy', 'branch', 'overcoming', 'the', 'limitations', 'of', 'sa']] | [-0.10111823972244428, 0.13885698637989674, -0.11375714293266455, 0.10403654321052185, -0.05508380711767567, -0.14009433701532345, 0.09558895958606664, 0.382215503620762, -0.2640028538781199, -0.28589169177655704, 0.10190598781209452, -0.2614303197207771, -0.14857626178824943, 0.16041098820836577, -0.046476266204940844, 0.021407985623626113, 0.04743453370541181, 0.033237131912108156, -0.06117543413651444, -0.20055123669580135, 0.32344760946061923, 0.05118790854483026, 0.31606935519304075, 0.049061097332263645, 0.07323079514763739, -0.00919298615867961, 0.08911140183025129, 0.044485229325651396, -0.12917343966292308, 0.07183085775085764, 0.2692782516425399, 0.14352196956305344, 0.2851513005691032, -0.39848621296760156, -0.19756538160655596, 0.12705938036598213, 0.14471712502434034, 0.14590480433671724, -0.03859124040113099, -0.2640716532015637, 0.08914154092143353, -0.1243530897430004, -0.1553040527250643, -0.08520705395135773, -0.02465324327732398, -0.004085213085875706, -0.25629104938268765, 0.02988754481089952, 0.03553374535372251, 0.03170692793744272, -0.05260200250801337, -0.11364658716316527, -0.026040351719990987, 0.08312284957764236, 0.026338139628634266, 0.04606747859451052, 0.11192954589344867, -0.13386301277524293, -0.12221531757099349, 0.35292334181945517, -0.04617717971846665, -0.15166654663434737, 0.2067638905782712, -0.07281909197447695, -0.09579021494503911, 0.17375798394611705, 0.10216183074246071, 0.13987440261543307, -0.14467264955212705, 0.0699504328252148, 0.017695663464957313, 0.16380660568642244, 0.04607944157491247, -0.00016257640178481193, 0.2026984652437346, 0.17822811432973776, 0.12409593598049594, 0.1602233273849491, -0.07299990810482597, -0.13633634423365026, -0.2621665249884843, -0.10329227886889895, -0.17478780543482672, -0.006737777666461476, -0.0625341964807052, -0.17401686101539493, 0.3912791543742259, 0.16754554704865057, 0.19164654952218782, 0.018901000396597315, 0.2731685419790192, 0.15705278682166054, 0.031336943787994655, 0.10661011288972724, 0.250699225602646, 0.06565374019555748, 0.07450432566549527, -0.2405146277088621, 0.07994533092906214, 0.062328967259405815] |
1,802.04048 | Kinematical Lie algebras in 2+1 dimensions | We classify kinematical Lie algebras in dimension 2+1. This is approached via
the classification of deformations of the static kinematical Lie algebra. In
addition, we determine which kinematical Lie algebras admit invariant symmetric
inner products.
| hep-th math.RT | we classify kinematical lie algebras in dimension 21 this is approached via the classification of deformations of the static kinematical lie algebra in addition we determine which kinematical lie algebras admit invariant symmetric inner products | [['we', 'classify', 'kinematical', 'lie', 'algebras', 'in', 'dimension', '21', 'this', 'is', 'approached', 'via', 'the', 'classification', 'of', 'deformations', 'of', 'the', 'static', 'kinematical', 'lie', 'algebra', 'in', 'addition', 'we', 'determine', 'which', 'kinematical', 'lie', 'algebras', 'admit', 'invariant', 'symmetric', 'inner', 'products']] | [-0.1861022422356265, 0.024253751616925, -0.08059452196050967, 0.07255184075662068, -0.1620026197151414, -0.08996076312448298, -0.0931683607931648, 0.42071052220250876, -0.3076894574399505, -0.18501357372317995, 0.15762063679285349, -0.13331851842147963, -0.1028384154795536, 0.0954987910842257, -0.09995548299380712, -0.08750381759767022, 0.016636640352330038, 0.17950970812567643, -0.2503894450941256, -0.2529830333643726, 0.4988225000777415, -0.040872463331158675, 0.19718327351978848, -0.05037472971848079, 0.08631406272096294, 0.047150363932762826, -0.09870450762765748, 0.0027115355378815108, -0.18660133840250118, 0.06024664068328483, 0.36864920013717245, 0.0406392748135009, 0.07110501430662615, -0.2603305163926312, -0.07083526871034078, 0.180513685675604, 0.2341575787934874, 0.032656705156633895, 0.015500807975019728, -0.30373971605939526, 0.026432303472289018, -0.2645150298518794, -0.18277855973158563, -0.09758965905223574, 0.04168440933738436, -0.12007483882563455, -0.18067059798964433, 0.11569771327610527, 0.08350853027243699, 0.1770124008080789, -0.18565987332590989, -0.068527561891824, -0.10485254193523101, 0.09242253071695034, -0.12018188216191317, -0.04715865608304739, 0.23702610256150364, -0.05192573805605727, -0.19438877523477588, 0.3863190685931061, 0.0896915606622185, -0.2585089619670595, 0.19694847730653628, -0.2618717562673347, -0.2549385640238013, 0.13167284803598056, 0.1451008229915585, 0.13993324073297636, -0.11079211543713297, 0.24413806862596954, -0.1217951497595225, -0.061060846986116045, 0.15697296634316443, -0.0011901898043496268, 0.17324618867465427, 0.12043302769639662, 0.003920606257660049, 0.1354623741337231, 0.018958517696176257, -0.05367881868566785, -0.4065217948917832, -0.11868233365405884, 0.01080525420340044, 0.13163495272664086, -0.15076821534229176, -0.16515847678695406, 0.37950706013611385, 0.0958562610404832, 0.21934943827135223, 0.053110208924460625, 0.15861170206751143, 0.05131756514310837, 0.21739212133522545, 0.09917709767552359, 0.2415071792368378, 0.2995887402977262, -0.01970331051519939, -0.14655122146276492, -0.14708941169083117, 0.18084572050720454] |
1,802.04049 | Zitterbewegung of exciton-polaritons | Macroscopic wave packets of spin-polarized exciton-polaritons in
two-dimensional microcavities experience the zitterbewegung, the effect
manifested by the appearance of the oscillatory motion of polaritons in the
direction normal to the initial propagation direction. The oscillating
trajectories of exciton-polaritons are adjustable by the control parameters:
the splitting of the longitudinal and transverse exciton-polariton modes, the
wave vector and the width of the resonant cw pump. Our theoretical analysis
supported by the numerical calculations allowed to optimize values of the
control parameters suitable for a direct experimental observation of the
zitterbewegung effect.
| cond-mat.mes-hall | macroscopic wave packets of spinpolarized excitonpolaritons in twodimensional microcavities experience the zitterbewegung the effect manifested by the appearance of the oscillatory motion of polaritons in the direction normal to the initial propagation direction the oscillating trajectories of excitonpolaritons are adjustable by the control parameters the splitting of the longitudinal and transverse excitonpolariton modes the wave vector and the width of the resonant cw pump our theoretical analysis supported by the numerical calculations allowed to optimize values of the control parameters suitable for a direct experimental observation of the zitterbewegung effect | [['macroscopic', 'wave', 'packets', 'of', 'spinpolarized', 'excitonpolaritons', 'in', 'twodimensional', 'microcavities', 'experience', 'the', 'zitterbewegung', 'the', 'effect', 'manifested', 'by', 'the', 'appearance', 'of', 'the', 'oscillatory', 'motion', 'of', 'polaritons', 'in', 'the', 'direction', 'normal', 'to', 'the', 'initial', 'propagation', 'direction', 'the', 'oscillating', 'trajectories', 'of', 'excitonpolaritons', 'are', 'adjustable', 'by', 'the', 'control', 'parameters', 'the', 'splitting', 'of', 'the', 'longitudinal', 'and', 'transverse', 'excitonpolariton', 'modes', 'the', 'wave', 'vector', 'and', 'the', 'width', 'of', 'the', 'resonant', 'cw', 'pump', 'our', 'theoretical', 'analysis', 'supported', 'by', 'the', 'numerical', 'calculations', 'allowed', 'to', 'optimize', 'values', 'of', 'the', 'control', 'parameters', 'suitable', 'for', 'a', 'direct', 'experimental', 'observation', 'of', 'the', 'zitterbewegung', 'effect']] | [-0.23404514663852752, 0.2330448338554965, -0.06186349054951784, 0.01165247518300829, -0.10632168781012297, -0.08444663899329802, 0.04958082512538466, 0.37644880074593756, -0.25870732903066607, -0.24910007638132406, -0.018230569458359644, -0.2311629168016629, -0.10249009007174108, 0.2248910427171116, 0.07429859478854471, 0.1267031144391189, 0.06794965958429708, -0.01911142247522043, -0.018596895090821717, -0.13490946036375437, 0.29735062076684293, 0.014880129648372532, 0.3635350683497058, 0.0341031019265453, 0.08788812583208912, 0.05321653661214643, 0.044748505774057576, -0.03455834785062406, -0.1497007632214162, 0.08677576683306445, 0.18667679118613403, -0.04091631008761599, 0.25891186914717157, -0.4592915585057603, -0.24408035958185792, 0.0011329818723930254, 0.1794817405183696, 0.17204221618982654, -0.06307922962846027, -0.37623386792838576, -0.019988999091502695, -0.10020891900025566, -0.18871521459788912, -0.03090177835321002, 0.02454080551655756, 0.07013956550508738, -0.25280814750327, 0.08191033514320023, 0.049776476249098776, 0.02676988144901568, -0.0932909422657556, -0.05213921329834395, -0.07545534612403976, 0.04561019093962386, 0.08539844556815095, 0.0021640148867542544, 0.16195843981469, -0.12939103746579753, -0.15773957622134024, 0.3629097207721012, -0.10841711264672793, -0.2139537700555391, 0.10733521698663633, -0.19958025060380655, 0.04835116622659067, 0.17977308960010607, 0.17258078528361187, 0.09096594223649138, -0.07580744232982398, 0.024681368458550422, -0.031886554954043175, 0.13485696243329182, 0.09285216229747878, 0.09126165628743668, 0.2304354749413, 0.15059515987005498, 0.01719841384846303, 0.10870939921911081, -0.11323671282993422, -0.09129397997943063, -0.2935580013733771, -0.1151221779466141, -0.19719400929494035, 0.03121462770343189, -0.03182681492439264, -0.1613611338763601, 0.5053031823908289, 0.12336716070979795, 0.16648764367111854, -0.043507982542117435, 0.3416349260343446, 0.17453976794689272, 0.03408518019649717, -0.006122967254163491, 0.32367593536360395, 0.18006926897861478, 0.12422191624840101, -0.3589691062975261, 0.028298655969815123, -0.017503109517403775] |
1,802.0405 | Exact and efficient inference for Partial Bayes problems | Bayesian methods are useful for statistical inference. However, real-world
problems can be challenging using Bayesian methods when the data analyst has
only limited prior knowledge. In this paper we consider a class of problems,
called Partial Bayes problems, in which the prior information is only partially
available. Taking the recently proposed Inferential Model approach, we develop
a general inference framework for Partial Bayes problems, and derive both exact
and efficient solutions. In addition to the theoretical investigation,
numerical results and real applications are used to demonstrate the superior
performance of the proposed method.
| stat.ME | bayesian methods are useful for statistical inference however realworld problems can be challenging using bayesian methods when the data analyst has only limited prior knowledge in this paper we consider a class of problems called partial bayes problems in which the prior information is only partially available taking the recently proposed inferential model approach we develop a general inference framework for partial bayes problems and derive both exact and efficient solutions in addition to the theoretical investigation numerical results and real applications are used to demonstrate the superior performance of the proposed method | [['bayesian', 'methods', 'are', 'useful', 'for', 'statistical', 'inference', 'however', 'realworld', 'problems', 'can', 'be', 'challenging', 'using', 'bayesian', 'methods', 'when', 'the', 'data', 'analyst', 'has', 'only', 'limited', 'prior', 'knowledge', 'in', 'this', 'paper', 'we', 'consider', 'a', 'class', 'of', 'problems', 'called', 'partial', 'bayes', 'problems', 'in', 'which', 'the', 'prior', 'information', 'is', 'only', 'partially', 'available', 'taking', 'the', 'recently', 'proposed', 'inferential', 'model', 'approach', 'we', 'develop', 'a', 'general', 'inference', 'framework', 'for', 'partial', 'bayes', 'problems', 'and', 'derive', 'both', 'exact', 'and', 'efficient', 'solutions', 'in', 'addition', 'to', 'the', 'theoretical', 'investigation', 'numerical', 'results', 'and', 'real', 'applications', 'are', 'used', 'to', 'demonstrate', 'the', 'superior', 'performance', 'of', 'the', 'proposed', 'method']] | [-0.0016677926184349163, -0.08009365323670609, -0.07478747064227699, 0.12052723096923963, -0.15804420643916695, -0.158911370512058, 0.05966230272690976, 0.42245687344061433, -0.25649146980265536, -0.3340563072894339, 0.16248716596108412, -0.22553009455723147, -0.19646508800446666, 0.2324411820329886, -0.11218906615570348, 0.1548608157117801, 0.15415204226249649, 0.012702851085573114, -0.07581358007906426, -0.2845233728012611, 0.28215911889809275, 0.02707799090453053, 0.3505365117102541, 0.05016295126168638, 0.13120232882624072, -0.014765265698154126, -0.03192278569544195, 0.060892300780421946, -0.13686605621509815, 0.19233179677988813, 0.3377815873427216, 0.2213792092747666, 0.36930619091075917, -0.4111362360618127, -0.2784789528983134, 0.106776430592021, 0.14790821839524534, 0.1402148938605121, -0.036969140527509554, -0.30552821392093293, 0.09642004704613599, -0.17143455861757198, -0.021061805016811815, -0.1885033999519643, -0.07527547690676906, -0.020007206954472567, -0.3538944206591095, 0.09007849699507157, 0.05182334131208218, 0.03519807290786537, -0.039170068478392016, -0.14763530604516267, 0.07825567939829442, 0.10590144306307368, 0.05565216731760771, -0.04122596368398918, 0.0672312338375837, -0.10827220644631613, -0.17035476606018762, 0.3585130870442397, 0.0027159247822779163, -0.2607576945716495, 0.15865276038887038, -0.039136824768877795, -0.19956286280586194, 0.10966787032622805, 0.23047286135792952, 0.1860114395448197, -0.19783672018265178, 0.10644686141274168, -0.05059638637824044, 0.13357088513552182, -0.027975961596014037, -0.04689252959571839, 0.12677315551717516, 0.21040272260315077, 0.044116697704759976, 0.13114761688961818, -0.09426374110062757, -0.1306391004472971, -0.24271006541707182, -0.11002248411832918, -0.17880252498872978, -0.042350073360026844, -0.10203517834491332, -0.16502942550446717, 0.34973265822496147, 0.25706278387036535, 0.14094158891408193, 0.06660509101610872, 0.36051845093888624, 0.1179670728683617, 4.116433762734936e-05, 0.10728940910219105, 0.20974400475551125, 0.11189404442425697, 0.0806612113230331, -0.13269634962943133, 0.11543893245028793, -0.006386862917532844] |
1,802.04051 | One Deep Music Representation to Rule Them All? : A comparative analysis
of different representation learning strategies | Inspired by the success of deploying deep learning in the fields of Computer
Vision and Natural Language Processing, this learning paradigm has also found
its way into the field of Music Information Retrieval. In order to benefit from
deep learning in an effective, but also efficient manner, deep transfer
learning has become a common approach. In this approach, it is possible to
reuse the output of a pre-trained neural network as the basis for a new
learning task. The underlying hypothesis is that if the initial and new
learning tasks show commonalities and are applied to the same type of input
data (e.g. music audio), the generated deep representation of the data is also
informative for the new task. Since, however, most of the networks used to
generate deep representations are trained using a single initial learning
source, their representation is unlikely to be informative for all possible
future tasks. In this paper, we present the results of our investigation of
what are the most important factors to generate deep representations for the
data and learning tasks in the music domain. We conducted this investigation
via an extensive empirical study that involves multiple learning sources, as
well as multiple deep learning architectures with varying levels of information
sharing between sources, in order to learn music representations. We then
validate these representations considering multiple target datasets for
evaluation. The results of our experiments yield several insights on how to
approach the design of methods for learning widely deployable deep data
representations in the music domain.
| cs.NE cs.SD eess.AS | inspired by the success of deploying deep learning in the fields of computer vision and natural language processing this learning paradigm has also found its way into the field of music information retrieval in order to benefit from deep learning in an effective but also efficient manner deep transfer learning has become a common approach in this approach it is possible to reuse the output of a pretrained neural network as the basis for a new learning task the underlying hypothesis is that if the initial and new learning tasks show commonalities and are applied to the same type of input data eg music audio the generated deep representation of the data is also informative for the new task since however most of the networks used to generate deep representations are trained using a single initial learning source their representation is unlikely to be informative for all possible future tasks in this paper we present the results of our investigation of what are the most important factors to generate deep representations for the data and learning tasks in the music domain we conducted this investigation via an extensive empirical study that involves multiple learning sources as well as multiple deep learning architectures with varying levels of information sharing between sources in order to learn music representations we then validate these representations considering multiple target datasets for evaluation the results of our experiments yield several insights on how to approach the design of methods for learning widely deployable deep data representations in the music domain | [['inspired', 'by', 'the', 'success', 'of', 'deploying', 'deep', 'learning', 'in', 'the', 'fields', 'of', 'computer', 'vision', 'and', 'natural', 'language', 'processing', 'this', 'learning', 'paradigm', 'has', 'also', 'found', 'its', 'way', 'into', 'the', 'field', 'of', 'music', 'information', 'retrieval', 'in', 'order', 'to', 'benefit', 'from', 'deep', 'learning', 'in', 'an', 'effective', 'but', 'also', 'efficient', 'manner', 'deep', 'transfer', 'learning', 'has', 'become', 'a', 'common', 'approach', 'in', 'this', 'approach', 'it', 'is', 'possible', 'to', 'reuse', 'the', 'output', 'of', 'a', 'pretrained', 'neural', 'network', 'as', 'the', 'basis', 'for', 'a', 'new', 'learning', 'task', 'the', 'underlying', 'hypothesis', 'is', 'that', 'if', 'the', 'initial', 'and', 'new', 'learning', 'tasks', 'show', 'commonalities', 'and', 'are', 'applied', 'to', 'the', 'same', 'type', 'of', 'input', 'data', 'eg', 'music', 'audio', 'the', 'generated', 'deep', 'representation', 'of', 'the', 'data', 'is', 'also', 'informative', 'for', 'the', 'new', 'task', 'since', 'however', 'most', 'of', 'the', 'networks', 'used', 'to', 'generate', 'deep', 'representations', 'are', 'trained', 'using', 'a', 'single', 'initial', 'learning', 'source', 'their', 'representation', 'is', 'unlikely', 'to', 'be', 'informative', 'for', 'all', 'possible', 'future', 'tasks', 'in', 'this', 'paper', 'we', 'present', 'the', 'results', 'of', 'our', 'investigation', 'of', 'what', 'are', 'the', 'most', 'important', 'factors', 'to', 'generate', 'deep', 'representations', 'for', 'the', 'data', 'and', 'learning', 'tasks', 'in', 'the', 'music', 'domain', 'we', 'conducted', 'this', 'investigation', 'via', 'an', 'extensive', 'empirical', 'study', 'that', 'involves', 'multiple', 'learning', 'sources', 'as', 'well', 'as', 'multiple', 'deep', 'learning', 'architectures', 'with', 'varying', 'levels', 'of', 'information', 'sharing', 'between', 'sources', 'in', 'order', 'to', 'learn', 'music', 'representations', 'we', 'then', 'validate', 'these', 'representations', 'considering', 'multiple', 'target', 'datasets', 'for', 'evaluation', 'the', 'results', 'of', 'our', 'experiments', 'yield', 'several', 'insights', 'on', 'how', 'to', 'approach', 'the', 'design', 'of', 'methods', 'for', 'learning', 'widely', 'deployable', 'deep', 'data', 'representations', 'in', 'the', 'music', 'domain']] | [-0.025776232259098704, 0.017281412094850717, -0.11231504722065695, 0.07760685036054218, -0.14130654858698424, -0.13368780959551552, 0.0007282475034310299, 0.4591512707920056, -0.30665019361426465, -0.33165850368416394, 0.0894931874028957, -0.24890082864838792, -0.2185944261718688, 0.23644634200751372, -0.08666586303922134, 0.06993847711476513, 0.13022684396471917, 0.07444360531274391, -0.05348961916614661, -0.2898554374045861, 0.34629777860351085, 0.04022514057349355, 0.3533871758877718, 0.011325260677455566, 0.12663766853401334, -0.023223061343713654, -0.040133423794919854, -0.05828946196578634, -0.045419761827217846, 0.23184846800396322, 0.3782719526408739, 0.24699273301420485, 0.3408585405444697, -0.40716926004567117, -0.24315081637602035, 0.09931688597352487, 0.15824025964168933, 0.11789176655585161, -0.06903562693275496, -0.3295736562251663, 0.08687338771002448, -0.14876878572495902, 0.022666621779084323, -0.15812188293234863, -0.012147083447230466, -0.015323007888138646, -0.28809351040239217, -0.010846297466562783, 0.08004154579019115, 0.07071941167365496, -0.061914585136137464, -0.11806855469531431, 0.05339153331253443, 0.21319759599167823, 0.057731516093682995, 0.07187434376903083, 0.12012105741112779, -0.23534568332504174, -0.14817779236124815, 0.36135107528154303, -0.05430324170115133, -0.1917250260223055, 0.2092554907013816, -0.014382373321596094, -0.1784826591620075, 0.07334134526785434, 0.25236652829632983, 0.10450061190003478, -0.18075220407478101, 0.0002688210811392646, -0.048609542623748926, 0.16683110755301764, 0.026818637593143332, 0.008921947084572605, 0.2037689317092043, 0.2698736562811601, -0.011216611590412423, 0.13470370180338373, -0.11483606620218263, -0.06812285489630042, -0.21126733659322036, -0.11038705457999247, -0.20909610901469747, -0.023449853048879858, -0.0897127792739225, -0.12328697153025418, 0.39159545989149785, 0.2348156001594827, 0.20059091428214113, 0.08076921228216741, 0.33772995577773124, 0.03993397223805334, 0.13916955864346608, 0.09357925395684787, 0.18272279773831485, 0.03174225542159003, 0.1429766105564942, -0.15289058113987666, 0.05252570905090185, -0.008499066448059138] |
1,802.04052 | Quasi-fredholm and saphar spectrums for the {\alpha}-times integrated
semigroups | We continue to study $\alpha$-times integrated semigroups. Essentially, we
characterize the different spectrums of $\alpha$-times integrated semigroups by
the spectrums of their generators. Particulary quasi-Fredholm, Kato,
essentially Kato, Saphar and essentially Saphar spectrums.
| math.SP | we continue to study alphatimes integrated semigroups essentially we characterize the different spectrums of alphatimes integrated semigroups by the spectrums of their generators particulary quasifredholm kato essentially kato saphar and essentially saphar spectrums | [['we', 'continue', 'to', 'study', 'alphatimes', 'integrated', 'semigroups', 'essentially', 'we', 'characterize', 'the', 'different', 'spectrums', 'of', 'alphatimes', 'integrated', 'semigroups', 'by', 'the', 'spectrums', 'of', 'their', 'generators', 'particulary', 'quasifredholm', 'kato', 'essentially', 'kato', 'saphar', 'and', 'essentially', 'saphar', 'spectrums']] | [-0.08823338647683461, 0.1342704433270476, -0.05120110221711608, 0.16398980378201514, -0.03269802135500041, -0.04443118551915342, -0.028117540094888573, 0.37769440403490356, -0.3188698435710235, -0.20347930987675986, 0.11298847777035201, -0.362454215008201, -0.0893605516263933, 0.22800918194380673, -0.09818948319915569, 0.12321679413346856, -0.00952204398697976, -0.023131992526803955, -0.09616152109634696, -0.2236802814824676, 0.35171725242539786, 0.14242037396990892, 0.23539385464832638, -0.013075270294917353, 0.03871610690134041, 0.009412835662563642, -0.11120240692275041, -0.08238171602627545, -0.2385339083954353, 0.1568514631750683, 0.2663194030297525, 0.06840088026541652, 0.164953752872393, -0.37150057856783725, -0.08961525940420953, 0.1917697378631794, 0.1174602596597238, -0.05391139827781555, 0.027135047356061863, -0.26667463634812244, 0.13440270259073286, -0.13105360892685977, -0.1580006773301372, -0.061958816523353256, 0.045698595543702446, 0.07444632171201661, -0.2062256418055657, -0.01902528273675478, 0.17205583360610585, 0.07119450015086455, -0.13477565590856652, -0.11584066802805121, -0.0673815891372435, 0.05649475008249283, -0.05832115995387236, -0.16430433795462843, 0.08719258873977444, 0.005394159399932532, -0.17065452146484997, 0.2421115505875963, -0.06562769342439645, -0.09441001381668629, 0.13862511392146576, -0.1731090948804084, -0.039697473530064926, 0.10087612130199418, 0.09390973209431677, 0.1009916744448922, -0.15317209395156664, 0.18300568464628392, -0.03136006457674684, 0.06599392008149263, 0.10046594070665764, 0.07404953117171924, 0.03514503687620163, 0.014998523236224146, 0.013591593752304712, 0.17599827070918048, 0.15489032808126826, 0.014410135872436293, -0.3523479445244778, -0.11606191996146333, -0.11449929669668729, 0.10866199117718321, 0.0011670620072188533, -0.17143775708973408, 0.41873421452262183, 0.12824436460593433, 0.155274211570169, 0.11558030703754137, 0.0921780349630298, 0.17252505601694187, 0.03438242606000241, 0.08658683697947046, 0.19251135290797913, 0.25733758137335605, 0.10160861146692751, -0.2152913741090081, -0.10933320447238105, 0.18483541815569907] |
1,802.04053 | Knife edge skimming for improved separation of molecular species by the
deflector | A knife edge for shaping a molecular beam is described to improve the spatial
separation of the species in a molecular beam by the electrostatic deflector.
The spatial separation of different molecular species from each other as well
as from atomic seed gas is improved. The column density of the selected
molecular-beam part in the interaction zone, which corresponds to higher signal
rates, was enhanced by a factor of 1.5, limited by the virtual source size of
the molecular beam.
| physics.atm-clus physics.atom-ph physics.chem-ph | a knife edge for shaping a molecular beam is described to improve the spatial separation of the species in a molecular beam by the electrostatic deflector the spatial separation of different molecular species from each other as well as from atomic seed gas is improved the column density of the selected molecularbeam part in the interaction zone which corresponds to higher signal rates was enhanced by a factor of 15 limited by the virtual source size of the molecular beam | [['a', 'knife', 'edge', 'for', 'shaping', 'a', 'molecular', 'beam', 'is', 'described', 'to', 'improve', 'the', 'spatial', 'separation', 'of', 'the', 'species', 'in', 'a', 'molecular', 'beam', 'by', 'the', 'electrostatic', 'deflector', 'the', 'spatial', 'separation', 'of', 'different', 'molecular', 'species', 'from', 'each', 'other', 'as', 'well', 'as', 'from', 'atomic', 'seed', 'gas', 'is', 'improved', 'the', 'column', 'density', 'of', 'the', 'selected', 'molecularbeam', 'part', 'in', 'the', 'interaction', 'zone', 'which', 'corresponds', 'to', 'higher', 'signal', 'rates', 'was', 'enhanced', 'by', 'a', 'factor', 'of', '15', 'limited', 'by', 'the', 'virtual', 'source', 'size', 'of', 'the', 'molecular', 'beam']] | [-0.0861501230399881, 0.14971285443170929, -0.034925979271065444, 0.017740796392899938, 0.05012598199537024, -0.08535038066620473, 0.06267961296252907, 0.37785242558456955, -0.27545370341977105, -0.34195759100839496, 0.04330226799065713, -0.21267909911694005, -0.011381542799063027, 0.13866363281849772, 0.040390873231808656, 0.0312644800520502, -0.002396771902567707, -0.03305421031545848, -0.017137850658036767, -0.14284221034613437, 0.3050929751247168, 0.15922468489734456, 0.27927336819120685, 0.05759337116032839, 0.12585501225548795, -0.012919980677543208, -0.04024131708429195, -0.011626932374201714, -0.08099260907620191, 0.12819284552824683, 0.21050940038476257, 0.0802781912352657, 0.2386228090035729, -0.4206952180247754, -0.2606452378677204, -0.005592131509911269, 0.18305132559034973, 0.13703971124923556, -0.043566340254619716, -0.26021740792202763, 0.05264595184125938, -0.16610002701636403, -0.17021774382446891, 0.08033762944396586, 0.010962552926503121, 0.11358796346466989, -0.25847660603758416, 0.09030610290355981, 0.008196166370908031, 0.07071330816252157, -0.027192760357866063, -0.16005658851354382, -0.053747778772958554, 0.13217622360680253, -0.040041435247985646, 0.09711528782645473, 0.2509519633080345, -0.15909947465406732, -0.050235369917936624, 0.40852961548953315, -0.0808999101158406, -0.15947543698421213, 0.2193173723469954, -0.1460753067047335, -0.06578908677620347, 0.22964544093701988, 0.1523331073047302, 0.08320822216337546, -0.14766148397629877, 0.009569780099309356, -0.030376802054524886, 0.21553625599481166, 0.1403742836380843, 0.025179252191446722, 0.21470646188245154, 0.17561766255530528, 0.07107128434581682, 0.1740439766093914, -0.1768566939572338, -0.059594513213960455, -0.20622590659186243, -0.14025697991019115, -0.22012313634040764, 0.014060974906897172, -0.08603999633924105, -0.08211815826361998, 0.38326879462692887, 0.06948453926161165, 0.2142268347175559, -0.06331410126731499, 0.33974995841272176, 0.1016772960399976, 0.10590867960709147, -0.004218576018320164, 0.22734720394946634, 0.12940103616565465, 0.08000288945622742, -0.2625570423377212, 0.08423856192966923, 0.02891135665413458] |
1,802.04054 | A continuous adjoint for photo-acoustic tomography of the brain | We present an optimization framework for photo-acoustic tomography of brain
based on a system of coupled equations that describe the propagation of sound
waves in linear isotropic inhomogeneous and lossy elastic media with the
absorption and physical dispersion following a frequency power law using
fractional Laplacian operators. The adjoint of the associated continuous
forward operator is derived, and a numerical framework for computing this
adjoint based on a k- space pseudospectral method is presented. We analytically
show that the derived continuous adjoint matches the adjoint of an associated
discretised operator. We include this adjoint in a first-order positivity
constrained optimization algorithm that is regularized by total variation
minimization, and show that the iterates monotonically converge to a minimizer
of an objective function, even in the presence of some error in estimating the
physical parameters of the medium.
| math.NA | we present an optimization framework for photoacoustic tomography of brain based on a system of coupled equations that describe the propagation of sound waves in linear isotropic inhomogeneous and lossy elastic media with the absorption and physical dispersion following a frequency power law using fractional laplacian operators the adjoint of the associated continuous forward operator is derived and a numerical framework for computing this adjoint based on a k space pseudospectral method is presented we analytically show that the derived continuous adjoint matches the adjoint of an associated discretised operator we include this adjoint in a firstorder positivity constrained optimization algorithm that is regularized by total variation minimization and show that the iterates monotonically converge to a minimizer of an objective function even in the presence of some error in estimating the physical parameters of the medium | [['we', 'present', 'an', 'optimization', 'framework', 'for', 'photoacoustic', 'tomography', 'of', 'brain', 'based', 'on', 'a', 'system', 'of', 'coupled', 'equations', 'that', 'describe', 'the', 'propagation', 'of', 'sound', 'waves', 'in', 'linear', 'isotropic', 'inhomogeneous', 'and', 'lossy', 'elastic', 'media', 'with', 'the', 'absorption', 'and', 'physical', 'dispersion', 'following', 'a', 'frequency', 'power', 'law', 'using', 'fractional', 'laplacian', 'operators', 'the', 'adjoint', 'of', 'the', 'associated', 'continuous', 'forward', 'operator', 'is', 'derived', 'and', 'a', 'numerical', 'framework', 'for', 'computing', 'this', 'adjoint', 'based', 'on', 'a', 'k', 'space', 'pseudospectral', 'method', 'is', 'presented', 'we', 'analytically', 'show', 'that', 'the', 'derived', 'continuous', 'adjoint', 'matches', 'the', 'adjoint', 'of', 'an', 'associated', 'discretised', 'operator', 'we', 'include', 'this', 'adjoint', 'in', 'a', 'firstorder', 'positivity', 'constrained', 'optimization', 'algorithm', 'that', 'is', 'regularized', 'by', 'total', 'variation', 'minimization', 'and', 'show', 'that', 'the', 'iterates', 'monotonically', 'converge', 'to', 'a', 'minimizer', 'of', 'an', 'objective', 'function', 'even', 'in', 'the', 'presence', 'of', 'some', 'error', 'in', 'estimating', 'the', 'physical', 'parameters', 'of', 'the', 'medium']] | [-0.11842721121140966, 0.0640084610526054, -0.08185786317292955, 0.04622565308861081, -0.08644215423566201, -0.0994675930174761, -0.010801783761172726, 0.3764946364532531, -0.3099043532172694, -0.21165854566778144, 0.1270344490729218, -0.25791319286583303, -0.18252714737114517, 0.16613958920794028, -0.04060305741336877, 0.11583848369994411, 0.03679707800004169, 0.04006540607898938, -0.09940226086632886, -0.1644147385292462, 0.32866781951186597, 0.0013026345629979224, 0.25369412914924594, 0.02931135800415582, 0.1708168254334167, 0.01798884585384198, -0.030986506580273167, 0.018403089424913043, -0.09513392444656665, 0.15408112162071533, 0.21956824602977285, 0.11566319099770192, 0.30174285538467394, -0.4157474885956405, -0.23683488915545226, 0.10407986714212346, 0.14431909083415936, 0.037700093915536456, -0.06429851843200515, -0.2687468018967414, 0.07087724659605509, -0.13454894021316602, -0.13883227913089805, -0.06606595793630193, -0.008680407943571136, 0.03648134997202913, -0.31789570033761, 0.11573102204197079, 0.03173830536241731, 0.04199883475709353, -0.13739177893955995, -0.07874312543014512, -0.00279508615218538, 0.04559946180164923, 0.010275479118133866, 0.020183511136140486, 0.09726882554645086, -0.13423720894408595, -0.0867803771546736, 0.3695494143265116, -0.11102794537177976, -0.2545602727463863, 0.11925784880499335, -0.08925730468306765, -0.083564758912599, 0.14425925047809843, 0.19663504035089735, 0.14476930697213383, -0.14381268855955887, 0.104633377146071, -0.08121218729210188, 0.1746135997674326, 0.0359412938760879, -0.0027985803759146997, 0.0962642450905303, 0.14731925167228319, 0.11644651474308794, 0.15138127304355267, -0.028411964108372094, -0.10222176586474924, -0.35150993899544225, -0.1589324664066199, -0.20157557325335695, 0.019021291332064455, -0.12279157994449288, -0.18662054740898584, 0.39161080813687976, 0.15708806252712043, 0.1679767342012403, 0.09523903875421379, 0.3285316548575341, 0.24112693204061827, -0.0047536469370561794, 0.10573451230166493, 0.2287328670756895, 0.18599941372449924, 0.09628035264755905, -0.2938120363409339, 0.010055402151043833, 0.1287475374670033] |
1,802.04055 | Gravitational lensing of photons coupled to massive particles | The gravitational deflection of massless and massive particles, both with and
without spin, has been extensively studied. This paper discusses the lensing of
a particle which oscillates between two interaction eigenstates. The deflection
angle, lens equation and time delay between images are derived in a model of
photon to hidden-photon oscillations. In the case of coherent oscillations, the
coupled photon behaves as a massive particle with a mass equal to the product
of the coupling constant and hidden photon mass. The conditions for observing
coherent photon-hidden photon lensing are discussed.
| astro-ph.HE hep-ph | the gravitational deflection of massless and massive particles both with and without spin has been extensively studied this paper discusses the lensing of a particle which oscillates between two interaction eigenstates the deflection angle lens equation and time delay between images are derived in a model of photon to hiddenphoton oscillations in the case of coherent oscillations the coupled photon behaves as a massive particle with a mass equal to the product of the coupling constant and hidden photon mass the conditions for observing coherent photonhidden photon lensing are discussed | [['the', 'gravitational', 'deflection', 'of', 'massless', 'and', 'massive', 'particles', 'both', 'with', 'and', 'without', 'spin', 'has', 'been', 'extensively', 'studied', 'this', 'paper', 'discusses', 'the', 'lensing', 'of', 'a', 'particle', 'which', 'oscillates', 'between', 'two', 'interaction', 'eigenstates', 'the', 'deflection', 'angle', 'lens', 'equation', 'and', 'time', 'delay', 'between', 'images', 'are', 'derived', 'in', 'a', 'model', 'of', 'photon', 'to', 'hiddenphoton', 'oscillations', 'in', 'the', 'case', 'of', 'coherent', 'oscillations', 'the', 'coupled', 'photon', 'behaves', 'as', 'a', 'massive', 'particle', 'with', 'a', 'mass', 'equal', 'to', 'the', 'product', 'of', 'the', 'coupling', 'constant', 'and', 'hidden', 'photon', 'mass', 'the', 'conditions', 'for', 'observing', 'coherent', 'photonhidden', 'photon', 'lensing', 'are', 'discussed']] | [-0.19206372970301244, 0.24029958785201114, -0.045002116149084434, 0.09195571564939908, -0.03443454096042034, -0.14528179379800957, -0.030663312628813503, 0.33818512187442845, -0.19671147940680384, -0.3527739824520217, 0.007771636118801931, -0.30550805148151183, -0.061119941177053584, 0.1905713452336689, 0.04042625526587169, 0.05592330992221832, 0.05620355853655686, 0.046829657070338725, -0.06710895194361607, -0.1782625993455036, 0.32461036719097236, 0.0666101484455996, 0.23768928901602823, 0.03875715683938728, 0.17115197448163397, 0.044524858840223815, -0.03261778332396514, -0.007675771345384419, -0.09967373418783407, 0.017241923852513233, 0.15248914057350096, 0.04686612552807977, 0.18502218001004722, -0.37736305677228504, -0.18019094868666596, 0.11594898936649163, 0.1654434205867195, 0.11576031143647722, -0.0968135654538249, -0.32033933841675105, -0.018988364127775034, -0.1756450227384145, -0.14987441697675322, 0.04218061626888812, 0.0187034590751864, 0.023442916101258662, -0.26998534940390123, 0.1473713957057852, -0.022816480768637525, -0.03854016492971116, -0.036462407150409284, -0.018178487210793213, -0.047775629043786065, 0.0907180853601959, 0.11347247372355519, 0.011033922392461036, 0.14056028603679604, -0.17311212389678177, -0.09905674870953791, 0.40395680748754076, -0.11444927825488978, -0.2055539039067096, 0.15128735174787128, -0.17635738822735017, -0.07738395886909631, 0.11959563145000074, 0.17455076820527513, 0.10797773024274243, -0.16301482079046156, 0.07706985710343967, -0.01218970176867313, 0.17325270225086975, 0.1373906506328947, 0.09586614608350727, 0.269811266184681, 0.14341977927833796, 0.022764801751408312, 0.12468791557475925, -0.1571866562590003, -0.0941183738100032, -0.2723099724286132, -0.14672582236946458, -0.1667623770268013, 0.079593013615037, -0.09223742063299546, -0.14458194147381517, 0.40140692905212444, 0.09444401406993469, 0.16203201073739265, 0.03170116847096425, 0.3440014872079094, 0.13625235399231314, 0.04266637295432803, 0.007813291510360108, 0.3779518725867901, 0.21535549890249966, 0.10330968629059498, -0.24482901541309224, -0.036004765145480636, -0.01195298805574162] |
1,802.04056 | Solomon-Terao algebra of hyperplane arrangements | We introduce a new algebra associated with a hyperplane arrangement
$\mathcal{A}$, called the Solomon-Terao algebra $\mbox{ST}(\mathcal{A},\eta)$,
where $\eta$ is a homogeneous polynomial. It is shown by Solomon and Terao that
$\mbox{ST}(\mathcal{A},\eta)$ is Artinian when $\eta$ is generic. This algebra
can be considered as a generalization of coinvariant algebras in the setting of
hyperplane arrangements. The class of Solomon-Terao algebras contains
cohomology rings of regular nilpotent Hessenberg varieties. We show that
$\mbox{ST}(\mathcal{A},\eta)$ is a complete intersection if and only if
$\mathcal{A}$ is free. We also give a factorization formula of the Hilbert
polynomials when $\mathcal{A}$ is free, and pose several related questions,
problems and conjectures.
| math.AC math.AG math.CV | we introduce a new algebra associated with a hyperplane arrangement mathcala called the solomonterao algebra mboxstmathcalaeta where eta is a homogeneous polynomial it is shown by solomon and terao that mboxstmathcalaeta is artinian when eta is generic this algebra can be considered as a generalization of coinvariant algebras in the setting of hyperplane arrangements the class of solomonterao algebras contains cohomology rings of regular nilpotent hessenberg varieties we show that mboxstmathcalaeta is a complete intersection if and only if mathcala is free we also give a factorization formula of the hilbert polynomials when mathcala is free and pose several related questions problems and conjectures | [['we', 'introduce', 'a', 'new', 'algebra', 'associated', 'with', 'a', 'hyperplane', 'arrangement', 'mathcala', 'called', 'the', 'solomonterao', 'algebra', 'mboxstmathcalaeta', 'where', 'eta', 'is', 'a', 'homogeneous', 'polynomial', 'it', 'is', 'shown', 'by', 'solomon', 'and', 'terao', 'that', 'mboxstmathcalaeta', 'is', 'artinian', 'when', 'eta', 'is', 'generic', 'this', 'algebra', 'can', 'be', 'considered', 'as', 'a', 'generalization', 'of', 'coinvariant', 'algebras', 'in', 'the', 'setting', 'of', 'hyperplane', 'arrangements', 'the', 'class', 'of', 'solomonterao', 'algebras', 'contains', 'cohomology', 'rings', 'of', 'regular', 'nilpotent', 'hessenberg', 'varieties', 'we', 'show', 'that', 'mboxstmathcalaeta', 'is', 'a', 'complete', 'intersection', 'if', 'and', 'only', 'if', 'mathcala', 'is', 'free', 'we', 'also', 'give', 'a', 'factorization', 'formula', 'of', 'the', 'hilbert', 'polynomials', 'when', 'mathcala', 'is', 'free', 'and', 'pose', 'several', 'related', 'questions', 'problems', 'and', 'conjectures']] | [-0.19291167126749104, 0.0635049310708732, -0.0732385282440541, 0.061695691948093906, -0.11880493982104011, -0.21783552253439736, -0.08871859620110346, 0.3329953426101173, -0.37467364544192183, -0.12009005660029988, 0.12976922180902106, -0.22827263900007194, -0.1742643847672018, 0.18114788147011915, -0.1899709128237401, -0.06181000628007146, 0.09355762342658216, 0.11354306112759961, -0.07717212590684469, -0.30466988303277714, 0.4267432076516203, -0.023778855258849665, 0.19466280144675133, 0.07213365656878942, 0.11676253150485885, 0.031731576922958575, 0.023321371373290625, 0.019874840782274708, -0.15893952185447582, 0.1182056502528632, 0.3328579995924464, 0.12807431276619005, 0.21501261381154807, -0.30198185188839066, -0.035002520778037324, 0.21373460383620113, 0.17281704083269198, 0.011319763042802852, -0.020450566241589304, -0.2287956377885376, 0.11413252123076326, -0.21277757429589444, -0.14445027446401162, -0.054943014813873634, 0.11635219392617448, -0.0020150001196620557, -0.3023946131713903, -0.001348511654214235, 0.10806135654162902, 0.13507083263497266, -0.04970311843611013, -0.08856875663178261, -0.0477292683477012, -0.0037837657700247993, -0.09234193302108906, 0.03971136344010189, 0.10687199157053748, -0.06572218394649099, -0.17068678045716995, 0.3910068222858871, 0.03176745432126783, -0.27436682344593394, 0.08944020038828827, -0.18673774810919824, -0.18291712479773337, 0.11146912478412, 0.027837518813052717, 0.17509968968359038, -0.013540354491571914, 0.22232908359504877, -0.24812802742235363, 0.046369678555772856, 0.1012331592814567, -0.035385816456535116, 0.11024599805331001, 0.08203270805713075, 0.0711248921803557, 0.174882405534915, 0.046321337531620745, 0.0035958824804625832, -0.351409298242428, -0.19637964948868522, -0.11874975800254525, 0.1320797873284811, -0.10052343339674945, -0.1716316396898317, 0.3816761923953891, 0.07311666946267135, 0.19490291419116637, 0.08641819490227275, 0.20066041213711008, 0.07779842859487801, 0.09691614924500194, 0.05710066373621185, 0.0807758414079077, 0.26498446339750303, -0.03722130224531821, -0.0945490454267621, 0.011119763031064604, 0.24402193876001269] |
1,802.04057 | Search for the rare decay of $\psi(3686) \rightarrow \Lambda_c^+
\overline{p} e^+ e^- + c.c.$ at BESIII | Based on a data sample of $(448.1\pm2.9)\times10^6~\psi(3686)$ decays
collected with the BESIII experiment, a search for the flavor changing neutral
current transition $\psi(3686)\rightarrow \Lambda_c^+ \overline{p} e^+ e^- +
c.c.$ is performed for the first time. No signal candidates are observed and
the upper limit on the branching fraction of $\psi(3686)\rightarrow \Lambda_c^+
\overline{p} e^+ e^-$ is determined to be $1.7\times10^{-6}$ at the 90\%
confidence level. The result is consistent with expectations from the Standard
Model, and no evidence for new physics is found.
| hep-ex | based on a data sample of 4481pm29times106psi3686 decays collected with the besiii experiment a search for the flavor changing neutral current transition psi3686rightarrow lambda_c overlinep e e cc is performed for the first time no signal candidates are observed and the upper limit on the branching fraction of psi3686rightarrow lambda_c overlinep e e is determined to be 17times106 at the 90 confidence level the result is consistent with expectations from the standard model and no evidence for new physics is found | [['based', 'on', 'a', 'data', 'sample', 'of', '4481pm29times106psi3686', 'decays', 'collected', 'with', 'the', 'besiii', 'experiment', 'a', 'search', 'for', 'the', 'flavor', 'changing', 'neutral', 'current', 'transition', 'psi3686rightarrow', 'lambda_c', 'overlinep', 'e', 'e', 'cc', 'is', 'performed', 'for', 'the', 'first', 'time', 'no', 'signal', 'candidates', 'are', 'observed', 'and', 'the', 'upper', 'limit', 'on', 'the', 'branching', 'fraction', 'of', 'psi3686rightarrow', 'lambda_c', 'overlinep', 'e', 'e', 'is', 'determined', 'to', 'be', '17times106', 'at', 'the', '90', 'confidence', 'level', 'the', 'result', 'is', 'consistent', 'with', 'expectations', 'from', 'the', 'standard', 'model', 'and', 'no', 'evidence', 'for', 'new', 'physics', 'is', 'found']] | [-0.09797438437228173, 0.17165187640186352, -0.07230298087307357, 0.0864398684057914, -0.0313151420294484, -0.118859368193706, 0.14095429521602212, 0.27975397685519127, -0.16160437973404798, -0.3138805297999112, 0.02515857040740644, -0.3768148249651812, 0.04132885603776461, 0.1991663557194362, 0.097008162914905, 0.060808783161300645, 0.09105882098120224, 0.0783304146673719, 0.01746983474851409, -0.16588021335899358, 0.21094866353676572, 0.08386095794790153, 0.2679140982453865, 0.05416310592731343, 0.02003393447339016, -0.03738334190241898, -0.07026074592118399, -0.035092419484936736, -0.1607123577637197, 0.04679916418287196, 0.20232303719967604, 0.15023282358918008, 0.13464087500130828, -0.33457910869507446, -0.05896124679630599, 0.19845341967972868, 0.100049793926551, 0.039570068622220164, -0.05899199341936626, -0.3608671710649623, 0.1348242028911091, -0.11340900583051239, -0.08203843995174274, 0.010934011362304416, 0.10627606541767151, -0.07265342061136719, -0.3342990137377306, 0.08382081071834398, -0.019209818442976926, 0.05839408281122193, -0.029590483194900843, -0.21910630059841124, -0.04938198254101827, 0.005052729008742903, 0.035139140118903754, 0.11959675479204324, 0.16538561857010745, -0.09380885454696379, -0.172681293108418, 0.38063916005194187, -0.09579353722967679, -0.13548125629129087, 0.17062928178937092, -0.21320120392874167, -0.1283161458146723, 0.20018810533647297, 0.18466942751823623, 0.0522485256454424, -0.16821075039856795, 0.147059649345465, -0.05718190550562466, 0.1875946376755645, 0.024410710245653798, -0.010162757229224979, 0.20123933401854732, 0.23863528783822172, 0.016550959877764122, 0.03443513437958222, -0.1121736106203421, -0.026231554637462656, -0.3679743278064305, -0.12058906991600613, -0.1251065233852007, 0.07245613353421228, -0.002460721390590048, -0.062095898775313095, 0.32020961819806054, 0.08613975162181674, 0.3130904131000154, 0.062417163080358995, 0.2467871488519956, 0.154748454847656, 0.011599610197133844, 0.05296197923230408, 0.30390084672224105, 0.1222263616450791, 0.07422072433165121, -0.21311758430026284, 0.10747789991194312, -0.01364445159966244] |
1,802.04058 | The Spinning Equations of Motion for Objects in AP-Geometry | Equations of spinning objects are obtained in Absolute Parallelism Geometry
[AP], a special class of non-Riemannian geometry admitting an alternative
non-vanishing curvature and torsion simultaneously. This new set of equations
is the counterpart of the Papapetrou equations in the Riemannian geometry.
Applying, the concept of geometerization of physics, it may give rise to
describe the spin tensor as parameterized commutation relation between path and
path deviation equations in both Riemannian and non-Riemannian geometries.
| gr-qc | equations of spinning objects are obtained in absolute parallelism geometry ap a special class of nonriemannian geometry admitting an alternative nonvanishing curvature and torsion simultaneously this new set of equations is the counterpart of the papapetrou equations in the riemannian geometry applying the concept of geometerization of physics it may give rise to describe the spin tensor as parameterized commutation relation between path and path deviation equations in both riemannian and nonriemannian geometries | [['equations', 'of', 'spinning', 'objects', 'are', 'obtained', 'in', 'absolute', 'parallelism', 'geometry', 'ap', 'a', 'special', 'class', 'of', 'nonriemannian', 'geometry', 'admitting', 'an', 'alternative', 'nonvanishing', 'curvature', 'and', 'torsion', 'simultaneously', 'this', 'new', 'set', 'of', 'equations', 'is', 'the', 'counterpart', 'of', 'the', 'papapetrou', 'equations', 'in', 'the', 'riemannian', 'geometry', 'applying', 'the', 'concept', 'of', 'geometerization', 'of', 'physics', 'it', 'may', 'give', 'rise', 'to', 'describe', 'the', 'spin', 'tensor', 'as', 'parameterized', 'commutation', 'relation', 'between', 'path', 'and', 'path', 'deviation', 'equations', 'in', 'both', 'riemannian', 'and', 'nonriemannian', 'geometries']] | [-0.1803271339836288, 0.10023788940213295, -0.09791609699748559, 0.07642066500417583, -0.20068080876379796, -0.14742212979225058, -0.08603294493713455, 0.3023396675053933, -0.2750500497242359, -0.30926124632919894, 0.030520024816250452, -0.25189175952085585, -0.1582967541754654, 0.19874064528625712, -0.11867711802765932, -0.0059096218558819325, 0.03182575830628406, 0.03847381840013478, -0.15260246927747886, -0.1866214154670908, 0.3799145308367857, 0.03453236167663581, 0.2520306878149101, -0.0025965868023364513, 0.20641213478456724, -0.011521161202188225, -0.027533307748093996, 0.09129911152110116, -0.14843670114211432, 0.12021653107941559, 0.23711775574348357, 0.09337690014915209, 0.1336616500638017, -0.41220556931850844, -0.19158794161264006, 0.09365717650786655, 0.07541060281840906, 0.1035594249348322, -0.02665999946375824, -0.28733586414066487, 0.005147311745581459, -0.14935844572745774, -0.19716817109322507, -0.09623390168417245, 0.04603781553674234, -0.024319458956996054, -0.15923349770130463, 0.057448335505435114, 0.10727522727612356, 0.04268000299136524, -0.11719869660239106, -0.09338681548132166, -0.023975800528280335, 0.06679619046897717, 0.057432450516761775, 0.007320338598618361, 0.05961105189196868, -0.12093392299322335, -0.14816989711396497, 0.38502066199706025, -0.06769408360889105, -0.32927106787795074, 0.09966945708793117, -0.10657103076475123, -0.09410261992390638, 0.0972010779389091, 0.16652137902884245, 0.1895155664597166, -0.1780417886600919, 0.1814266224814362, -0.003260828643935184, 0.029506064849357083, 0.11006919269398978, 0.025806532904811916, 0.19717139926079616, 0.07941316645464873, 0.09270014920692941, 0.12802785433261107, -0.020822170704016336, -0.15633874353378602, -0.38641081592195653, -0.21543100605119173, -0.1223434226568278, 0.16233161741178737, -0.1984860015299876, -0.2119217498151407, 0.33737403144804784, 0.04800277613645598, 0.12389059863786839, 0.07832558976154622, 0.2293374217817024, 0.09100756532379445, 0.04488266133129189, 0.08221580967791889, 0.2523145305171405, 0.27900397234073243, 0.08832190670583347, -0.19942137629610218, -0.04446797713969056, 0.1522961157782335] |
1,802.04059 | Electromagnetic wave propagating along a space curve | Using the thin-layer approach, we derive the effective equation for the
electromagnetic wave propagating along a space curve. We find intrinsic
spin-orbit, extrinsic spin-orbit and extrinsic orbital angular momentum and
intrinsic orbital angular momentum couplings induced by torsion, which can lead
to geometric phase, spin and orbital Hall effects. And we show the helicity
inversion induced by curvature that can convert the right-handed circularly
polarized electromagnetic wave into left-handed polarized one, vice verse.
Finally, we demonstrate that the gauge invariance of the effective dynamics is
protected by the geometrically induced gauge potential.
| physics.optics gr-qc | using the thinlayer approach we derive the effective equation for the electromagnetic wave propagating along a space curve we find intrinsic spinorbit extrinsic spinorbit and extrinsic orbital angular momentum and intrinsic orbital angular momentum couplings induced by torsion which can lead to geometric phase spin and orbital hall effects and we show the helicity inversion induced by curvature that can convert the righthanded circularly polarized electromagnetic wave into lefthanded polarized one vice verse finally we demonstrate that the gauge invariance of the effective dynamics is protected by the geometrically induced gauge potential | [['using', 'the', 'thinlayer', 'approach', 'we', 'derive', 'the', 'effective', 'equation', 'for', 'the', 'electromagnetic', 'wave', 'propagating', 'along', 'a', 'space', 'curve', 'we', 'find', 'intrinsic', 'spinorbit', 'extrinsic', 'spinorbit', 'and', 'extrinsic', 'orbital', 'angular', 'momentum', 'and', 'intrinsic', 'orbital', 'angular', 'momentum', 'couplings', 'induced', 'by', 'torsion', 'which', 'can', 'lead', 'to', 'geometric', 'phase', 'spin', 'and', 'orbital', 'hall', 'effects', 'and', 'we', 'show', 'the', 'helicity', 'inversion', 'induced', 'by', 'curvature', 'that', 'can', 'convert', 'the', 'righthanded', 'circularly', 'polarized', 'electromagnetic', 'wave', 'into', 'lefthanded', 'polarized', 'one', 'vice', 'verse', 'finally', 'we', 'demonstrate', 'that', 'the', 'gauge', 'invariance', 'of', 'the', 'effective', 'dynamics', 'is', 'protected', 'by', 'the', 'geometrically', 'induced', 'gauge', 'potential']] | [-0.2310815537000409, 0.2838119723753113, -0.07565918888734735, 0.11276104053325506, -0.1616048441147027, -0.09814410429427643, -0.013189115951283147, 0.4260457740570216, -0.29602194334248727, -0.28901867600886716, -0.026090673418999042, -0.2380947563291082, -0.16730279030035372, 0.14509328362866022, 0.05301933413442305, -0.006998941142861124, -0.02051121377102707, -0.07243831415215264, -0.11014617821100452, -0.15217886826671337, 0.34970282872571895, -0.02406983967597151, 0.2576288078688895, 0.07819890951783315, 0.16483263167269205, 0.07199687748367939, 0.009185651863884666, 0.0011198159111739622, -0.09949117346300425, 0.07840498218707659, 0.1296397140730456, -0.06051417804100429, 0.08404667858343126, -0.44281941812242503, -0.19620799664003047, 0.033708322059322636, 0.12882850349516325, 0.1844156913132832, -0.05616049655794125, -0.33281058020403853, 0.004332680862558925, -0.15326017388345106, -0.16897617396139336, -0.15884436170934982, 0.01780023677881969, -0.05782304370127942, -0.24980422695997453, 0.09153362122078365, 0.10434166202321649, 0.023736617376056056, -0.07036322044998246, -0.11411443784195201, -0.18900964924377267, 0.0166901776354517, 0.1353218347800936, 0.08072205404649772, 0.12377745954259096, -0.11893208632650583, -0.10686727227015502, 0.36598211632150673, -0.13279023977393872, -0.2736174197482836, 0.07178234910774652, -0.1688984800509744, 0.0034415036055218916, 0.15590030476754613, 0.18978529369822986, 0.09277762294463489, -0.10545839320706285, 0.11943450696897977, 0.004331184197128649, 0.11663282333630258, 0.07043026307719233, 0.09716922011347892, 0.32343345113179606, 0.035423063207417727, 0.045158759711067316, 0.12045560307476831, -0.14937283238396049, -0.05138187023618704, -0.2869008490410836, -0.15511682565050686, -0.18277312324220396, 0.1539791246667965, -0.0811655232502507, -0.07776833938070289, 0.43522418148147507, 0.1284285545065675, 0.13100693964288043, -0.03465998032341937, 0.32722662061290897, 0.1422517239925978, 0.0494244114657783, 0.06927549234166255, 0.3137049671545949, 0.18516471245801885, 0.05491849958754914, -0.3675134833193506, -0.01860084449847067, 0.06232818074362433] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.