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.0116 | Characterizing the astrophysical S-factor for $^{12}$C+$^{12}$C with
wave-packet dynamics | A quantitative study of the astrophysically important sub-barrier fusion of
$^{12}$C+$^{12}$C is presented. Low-energy collisions are described in the
body-fixed reference frame using wave-packet dynamics within a nuclear
molecular picture. A collective Hamiltonian drives the time propagation of the
wave-packet through the collective potential-energy landscape. The fusion
imaginary potential for specific dinuclear configurations is crucial for
understanding the appearance of resonances in the fusion cross section. The
theoretical sub-barrier fusion cross sections explain some observed resonant
structures in the astrophysical S-factor. These cross sections monotonically
decline towards stellar energies. The structures in the data that are not
explained are possibly due to cluster effects in the nuclear molecule, which
are to be included in the present approach.
| nucl-th | a quantitative study of the astrophysically important subbarrier fusion of 12c12c is presented lowenergy collisions are described in the bodyfixed reference frame using wavepacket dynamics within a nuclear molecular picture a collective hamiltonian drives the time propagation of the wavepacket through the collective potentialenergy landscape the fusion imaginary potential for specific dinuclear configurations is crucial for understanding the appearance of resonances in the fusion cross section the theoretical subbarrier fusion cross sections explain some observed resonant structures in the astrophysical sfactor these cross sections monotonically decline towards stellar energies the structures in the data that are not explained are possibly due to cluster effects in the nuclear molecule which are to be included in the present approach | [['a', 'quantitative', 'study', 'of', 'the', 'astrophysically', 'important', 'subbarrier', 'fusion', 'of', '12c12c', 'is', 'presented', 'lowenergy', 'collisions', 'are', 'described', 'in', 'the', 'bodyfixed', 'reference', 'frame', 'using', 'wavepacket', 'dynamics', 'within', 'a', 'nuclear', 'molecular', 'picture', 'a', 'collective', 'hamiltonian', 'drives', 'the', 'time', 'propagation', 'of', 'the', 'wavepacket', 'through', 'the', 'collective', 'potentialenergy', 'landscape', 'the', 'fusion', 'imaginary', 'potential', 'for', 'specific', 'dinuclear', 'configurations', 'is', 'crucial', 'for', 'understanding', 'the', 'appearance', 'of', 'resonances', 'in', 'the', 'fusion', 'cross', 'section', 'the', 'theoretical', 'subbarrier', 'fusion', 'cross', 'sections', 'explain', 'some', 'observed', 'resonant', 'structures', 'in', 'the', 'astrophysical', 'sfactor', 'these', 'cross', 'sections', 'monotonically', 'decline', 'towards', 'stellar', 'energies', 'the', 'structures', 'in', 'the', 'data', 'that', 'are', 'not', 'explained', 'are', 'possibly', 'due', 'to', 'cluster', 'effects', 'in', 'the', 'nuclear', 'molecule', 'which', 'are', 'to', 'be', 'included', 'in', 'the', 'present', 'approach']] | [-0.09233111971352473, 0.15294063904792324, -0.10800447336348828, 0.14140930461983842, 0.014244514636886425, -0.06303343201915805, -0.01824713889390039, 0.38465598518522376, -0.23417095887339395, -0.24958879137650514, -0.0519691623815009, -0.2642229759436833, -0.07198748164054038, 0.17076431276101586, 0.039640111138824145, 0.054979239598426044, 0.13225847632329688, 0.07096873537406452, 0.018658266448551137, -0.1573403732946668, 0.3158736809029475, 0.1434538580604598, 0.2391387572607551, 0.1483290819839264, 0.02585428120651975, 0.042573731273221664, -0.005194955097479571, -0.054348913098000884, -0.12532571568503292, 0.11587274479545438, 0.33864605139232534, 0.06279183628794271, 0.18930135033308312, -0.44151967795740843, -0.21245403923034573, 0.05254756266442247, 0.17607445530663046, 0.1734132577901961, -0.07815542009559114, -0.29490444283836925, 0.0005635305578446286, -0.18848295697671735, -0.14443932482017538, -0.08442743196406871, 0.045966774893876836, 0.04020797192819544, -0.21736641160588568, 0.1038303507778507, 0.018062541699116558, 0.064890469949788, -0.15625790309192789, -0.1329002326282744, -0.05313865834465011, 0.07000363564803305, 0.0355959467522195, 0.0065469003230747246, 0.25404940254222125, -0.136869592163274, -0.10068546437347929, 0.440232000589315, -0.0041617094499305785, -0.15031346342820898, 0.14901105795278508, -0.18045509060218923, -0.1093164445935852, 0.2181349872555743, 0.19751455831444925, 0.11455256268421872, -0.1870718719636719, 0.056211616897731166, 0.03576369500026489, 0.09682108998561326, 0.07011822795965032, 0.02800547276249426, 0.20363294417595762, 0.20915359741029066, -0.037139190448463984, 0.04031288145113991, -0.14797675891771403, -0.18887011309623972, -0.36188753821656233, -0.07799976519667186, -0.08379151065173185, 0.021265361969618916, -0.0024909795874841194, -0.11048008665506147, 0.3722592479366268, 0.07832409273925074, 0.2867635150726598, -0.07484909043344869, 0.2836310246314567, 0.12466505690851909, 0.08570091348762314, 0.0162376347833719, 0.33548280671283676, 0.19579321179443446, 0.08700820051818195, -0.2773045198673494, 0.0809356809522097, 0.02959943129720851] |
1,802.01161 | A Puzzle about Further Facts | In metaphysics, there are a number of distinct but related questions about
the existence of "further facts" -- facts that are contingent relative to the
physical structure of the universe. These include further facts about qualia,
personal identity, and time. In this article I provide a sequence of examples
involving computer simulations, ranging from one in which the protagonist can
clearly conclude such further facts exist to one that describes our own
condition. This raises the question of where along the sequence (if at all) the
protagonist stops being able to soundly conclude that further facts exist.
| physics.hist-ph | in metaphysics there are a number of distinct but related questions about the existence of further facts facts that are contingent relative to the physical structure of the universe these include further facts about qualia personal identity and time in this article i provide a sequence of examples involving computer simulations ranging from one in which the protagonist can clearly conclude such further facts exist to one that describes our own condition this raises the question of where along the sequence if at all the protagonist stops being able to soundly conclude that further facts exist | [['in', 'metaphysics', 'there', 'are', 'a', 'number', 'of', 'distinct', 'but', 'related', 'questions', 'about', 'the', 'existence', 'of', 'further', 'facts', 'facts', 'that', 'are', 'contingent', 'relative', 'to', 'the', 'physical', 'structure', 'of', 'the', 'universe', 'these', 'include', 'further', 'facts', 'about', 'qualia', 'personal', 'identity', 'and', 'time', 'in', 'this', 'article', 'i', 'provide', 'a', 'sequence', 'of', 'examples', 'involving', 'computer', 'simulations', 'ranging', 'from', 'one', 'in', 'which', 'the', 'protagonist', 'can', 'clearly', 'conclude', 'such', 'further', 'facts', 'exist', 'to', 'one', 'that', 'describes', 'our', 'own', 'condition', 'this', 'raises', 'the', 'question', 'of', 'where', 'along', 'the', 'sequence', 'if', 'at', 'all', 'the', 'protagonist', 'stops', 'being', 'able', 'to', 'soundly', 'conclude', 'that', 'further', 'facts', 'exist']] | [-0.08442526759608882, 0.12121405463888853, -0.08857962744999288, 0.07885440975223901, -0.10986185978981666, -0.13548751153090657, 0.0613954474805117, 0.34669409159202286, -0.3304111443576403, -0.31977316746876266, 0.15016703202491044, -0.29868227247303974, -0.16802704726190618, 0.21490587457083166, -0.09740899235960872, -0.06299540395411896, 0.058451105359078305, 0.07440037069106135, -0.01230881304218201, -0.3017687141521795, 0.36677836244537804, -0.020835274963853106, 0.18877864378737286, 0.08734793168938874, 0.06496757669083308, -0.0737507537851343, -0.03025522159744772, -0.002015219899476506, -0.1386335562746505, 0.13055120464802408, 0.2624873281262505, 0.21772931496767947, 0.3005097248314996, -0.441493005802234, -0.1677511572391571, 0.08328905525922892, 0.12308380717877299, 0.09185218646477249, -0.0488900526688667, -0.23355638964373307, 0.1502895719507554, -0.11478242778927476, -0.15214748800887415, -0.07705551834078506, 0.016732466562340658, 0.02431567829141083, -0.19525983628712615, 0.03972696311150988, 0.1391808274569636, 0.040746920373445995, -0.03998690292792162, -0.091981021357545, 0.0055842499059508555, 0.18058602895689546, 0.11973104261172314, -0.0069224890661037835, 0.0801232503290521, -0.1273691301806442, -0.14743083734356333, 0.3754542163029934, 0.024049458695420373, -0.16135803775978275, 0.2142001412527558, -0.14780512196981968, -0.18788555805804208, 0.08815597135738547, 0.09277032390915944, 0.07328629198794563, -0.11648269836405234, 0.026355082779749257, -0.1269033311982639, 0.19020010167757087, 0.07350534076491992, 0.05532481941918377, 0.24906816110402966, 0.11769707235119616, 0.027097833257964037, 0.06498444637206073, 0.02608653458203965, -0.11333368434861768, -0.35539642147098977, -0.16929960006382316, -0.13220534394228403, 0.07737107208231464, -0.05325105125651438, -0.11793569149449468, 0.38446089159697294, 0.25896362430163816, 0.20897747009682158, 0.0352430739646176, 0.2490708776555645, 0.05134117056756319, 0.033905003675802924, 0.067487534203489, 0.17816295238056531, 0.07910179808580627, 0.09616758037009276, -0.14567140866832537, 0.09000300105738764, -0.017116459038030978] |
1,802.01162 | Information storing yields a point-asymmetry of state space in general
probabilistic theories | It is known that the high-dimensional quantum state space is notoriously
complicated in contrast with the beautiful Bloch ball of the qubit. We examined
the mechanism behind this fact in the frame work of general probabilistic
theory (GPT), and found rather general quantitative relations between the
geometry of the state space and its information storing capability. The main
result is the information-asymmetry identity, which (up to the constant term)
equates the {\it Minkowski measure of asymmetry} with the {\it information
storability} which, in addition to its own operational meaning, serves as an
upper bound to common information measures such as semi-classical capacity. As
a consequence, the asymmetry measure is lower-bounded by information storing
capability of the state space, so the increase in the latter enhances the
former. Coming back to the quantum systems, the $d$-level state space cannot be
symmetric "because" it can store more than a single bit of information. Also,
the Holevo capacity of any quantum channel with point-symmetric image is at
most a single bit. In the course of the research, we applied Shannon theory to
GPT, producing a couple of new results. Also presented is a new geometrical
proof of known upper bounds to information measures.
| quant-ph | it is known that the highdimensional quantum state space is notoriously complicated in contrast with the beautiful bloch ball of the qubit we examined the mechanism behind this fact in the frame work of general probabilistic theory gpt and found rather general quantitative relations between the geometry of the state space and its information storing capability the main result is the informationasymmetry identity which up to the constant term equates the it minkowski measure of asymmetry with the it information storability which in addition to its own operational meaning serves as an upper bound to common information measures such as semiclassical capacity as a consequence the asymmetry measure is lowerbounded by information storing capability of the state space so the increase in the latter enhances the former coming back to the quantum systems the dlevel state space cannot be symmetric because it can store more than a single bit of information also the holevo capacity of any quantum channel with pointsymmetric image is at most a single bit in the course of the research we applied shannon theory to gpt producing a couple of new results also presented is a new geometrical proof of known upper bounds to information measures | [['it', 'is', 'known', 'that', 'the', 'highdimensional', 'quantum', 'state', 'space', 'is', 'notoriously', 'complicated', 'in', 'contrast', 'with', 'the', 'beautiful', 'bloch', 'ball', 'of', 'the', 'qubit', 'we', 'examined', 'the', 'mechanism', 'behind', 'this', 'fact', 'in', 'the', 'frame', 'work', 'of', 'general', 'probabilistic', 'theory', 'gpt', 'and', 'found', 'rather', 'general', 'quantitative', 'relations', 'between', 'the', 'geometry', 'of', 'the', 'state', 'space', 'and', 'its', 'information', 'storing', 'capability', 'the', 'main', 'result', 'is', 'the', 'informationasymmetry', 'identity', 'which', 'up', 'to', 'the', 'constant', 'term', 'equates', 'the', 'it', 'minkowski', 'measure', 'of', 'asymmetry', 'with', 'the', 'it', 'information', 'storability', 'which', 'in', 'addition', 'to', 'its', 'own', 'operational', 'meaning', 'serves', 'as', 'an', 'upper', 'bound', 'to', 'common', 'information', 'measures', 'such', 'as', 'semiclassical', 'capacity', 'as', 'a', 'consequence', 'the', 'asymmetry', 'measure', 'is', 'lowerbounded', 'by', 'information', 'storing', 'capability', 'of', 'the', 'state', 'space', 'so', 'the', 'increase', 'in', 'the', 'latter', 'enhances', 'the', 'former', 'coming', 'back', 'to', 'the', 'quantum', 'systems', 'the', 'dlevel', 'state', 'space', 'can', 'not', 'be', 'symmetric', 'because', 'it', 'can', 'store', 'more', 'than', 'a', 'single', 'bit', 'of', 'information', 'also', 'the', 'holevo', 'capacity', 'of', 'any', 'quantum', 'channel', 'with', 'pointsymmetric', 'image', 'is', 'at', 'most', 'a', 'single', 'bit', 'in', 'the', 'course', 'of', 'the', 'research', 'we', 'applied', 'shannon', 'theory', 'to', 'gpt', 'producing', 'a', 'couple', 'of', 'new', 'results', 'also', 'presented', 'is', 'a', 'new', 'geometrical', 'proof', 'of', 'known', 'upper', 'bounds', 'to', 'information', 'measures']] | [-0.10232237302517205, 0.1159550254309579, -0.10223854130686959, 0.09675381804408971, -0.09224330025055678, -0.1589492345158942, 0.07575370115693658, 0.30113305740989743, -0.30788695282361006, -0.29367160360561684, 0.10420108069723938, -0.2743333788099699, -0.1309210218139924, 0.20067480785073713, -0.10854609094792977, 0.050214072761591524, 0.021847350460011513, 0.12504136716015637, -0.06540328937524464, -0.2501204198668711, 0.3034877886355389, 0.09708023373328616, 0.29979467888595535, 0.06006548288016347, 0.09253401236375794, 0.011778490474098362, -0.008850161691661924, -0.0215402165876003, -0.1162069033681837, 0.14888601437211035, 0.2466250217263587, 0.16827214134857058, 0.24485186486737803, -0.3907588306162506, -0.20666061104624533, 0.09990518778329716, 0.12051661378325662, 0.1415950696764048, -0.023037771349554533, -0.29038815377280114, 0.03816795986611396, -0.14880877781484741, -0.10190347864525393, -0.06991930187679828, 0.019748131853993982, -0.05434846475254744, -0.22952862475649455, 0.047076771121646745, 0.10739456151612103, -0.0029797536521800794, -0.02741839519178029, -0.06357681211200543, -0.019663663835963234, 0.1555613746975723, 0.018288908895337953, 0.08151704685587902, 0.10873897393466905, -0.125922343096463, -0.11438404784305022, 0.3660256633721292, -0.06147784899374528, -0.230567687144503, 0.15142444706667446, -0.15541810248279944, -0.09660921144997701, 0.10787027901271358, 0.11651044272934087, 0.10415886431001127, -0.14341910952003672, 0.07122461216931697, -0.06326190635561943, 0.18128787172492594, 0.05778835442615673, 0.1463373493455583, 0.1801324925851077, 0.12792090470087714, 0.08818946818821133, 0.17199868463736492, -0.07275171048473567, -0.16075541447149588, -0.3038606466911733, -0.20589012989221372, -0.2361303232423961, 0.05396518633358937, -0.08475805054054945, -0.13356119779011352, 0.3454704668093473, 0.12540432080859318, 0.17816637961892412, 0.016824451626744123, 0.32472881304100154, 0.1123881947278278, 0.07387138853780925, 0.08020797381177544, 0.22723676518915453, 0.15856860817060806, 0.10692917639389635, -0.17730305562261492, 0.0966081557040161, 0.03445787428412586] |
1,802.01163 | Emergent Viscosity: An alternative for Dark Matter in Galaxies | We assume that the individual stars which are located at the peripheral parts
of the spiral galaxies are experiencing a drag force acting upon them radially.
Such a force might be produced by some sort of a dynamically generated viscous
medium, and as the stars are in the state of free fall toward the center of the
galaxy, then it would balance the centripetal force acting on the star, thus
resulting in a terminal velocity. We make no attempt to explain the origin of
the assumed drag force or show how it could be generated, but we have tried to
test such an assumption by fitting the calculated velocity curves of 18 spiral
galaxies with rotation curves obtained from actual observations. Results show
remarkable agreements.
| astro-ph.GA | we assume that the individual stars which are located at the peripheral parts of the spiral galaxies are experiencing a drag force acting upon them radially such a force might be produced by some sort of a dynamically generated viscous medium and as the stars are in the state of free fall toward the center of the galaxy then it would balance the centripetal force acting on the star thus resulting in a terminal velocity we make no attempt to explain the origin of the assumed drag force or show how it could be generated but we have tried to test such an assumption by fitting the calculated velocity curves of 18 spiral galaxies with rotation curves obtained from actual observations results show remarkable agreements | [['we', 'assume', 'that', 'the', 'individual', 'stars', 'which', 'are', 'located', 'at', 'the', 'peripheral', 'parts', 'of', 'the', 'spiral', 'galaxies', 'are', 'experiencing', 'a', 'drag', 'force', 'acting', 'upon', 'them', 'radially', 'such', 'a', 'force', 'might', 'be', 'produced', 'by', 'some', 'sort', 'of', 'a', 'dynamically', 'generated', 'viscous', 'medium', 'and', 'as', 'the', 'stars', 'are', 'in', 'the', 'state', 'of', 'free', 'fall', 'toward', 'the', 'center', 'of', 'the', 'galaxy', 'then', 'it', 'would', 'balance', 'the', 'centripetal', 'force', 'acting', 'on', 'the', 'star', 'thus', 'resulting', 'in', 'a', 'terminal', 'velocity', 'we', 'make', 'no', 'attempt', 'to', 'explain', 'the', 'origin', 'of', 'the', 'assumed', 'drag', 'force', 'or', 'show', 'how', 'it', 'could', 'be', 'generated', 'but', 'we', 'have', 'tried', 'to', 'test', 'such', 'an', 'assumption', 'by', 'fitting', 'the', 'calculated', 'velocity', 'curves', 'of', '18', 'spiral', 'galaxies', 'with', 'rotation', 'curves', 'obtained', 'from', 'actual', 'observations', 'results', 'show', 'remarkable', 'agreements']] | [-0.11666723938845099, 0.1553540278460132, -0.14901617814600468, 0.04558936687931418, -0.09938884314149618, -0.07569627735391259, 0.015526352789252997, 0.41443106351792813, -0.24669216907024383, -0.3178361325636506, 0.04717589495144785, -0.2891630032658577, -0.08218128574080766, 0.21032726269774138, -0.029383803533390165, -0.021964861766435206, 0.049083153030369434, 0.04881118340790272, -0.005075069179758429, -0.2431164074204862, 0.3282588746510446, 0.031670652942731976, 0.1894102035574615, -0.003971030909568071, 0.0800803153552115, -0.0717870273962617, -0.05520244769752026, 0.04580001559108496, -0.13447207381977933, 0.04280264826305211, 0.17258738542348145, 0.07378864265605807, 0.2375193513184786, -0.47108273845911025, -0.204735990062356, 0.08735543549060822, 0.1462963233627379, 0.10097290052473545, -0.0969367443183437, -0.267403622046113, 0.04766473797149956, -0.1627508061155677, -0.2047110842913389, -0.0065134700983762745, 0.027556275140494108, 0.07992818498238921, -0.2216956161558628, 0.09171010493673384, 0.06371205617347732, 0.06067573952767998, -0.11256350735016167, -0.07876564680039883, -0.07815693535096943, 0.12267635053955019, 0.07646241901256144, 0.07539634440094233, 0.21976230815052986, -0.13599544459953905, -0.02563451121374965, 0.43175493901968004, -0.05487221379578114, -0.13185774092376232, 0.2243697893321514, -0.1766075239367783, -0.07727944718301297, 0.09743234011530875, 0.14945032666251062, 0.06612649720907211, -0.13714546317234635, -0.02542793607758358, -0.04289426290616393, 0.1549420195352286, 0.0884741571675986, -0.03347868301242124, 0.28178657963871956, 0.05457335177250206, 0.04821875707246363, 0.10282682762853801, -0.1383652484085178, -0.06252243591286243, -0.2886915208026767, -0.11002848667465151, -0.13833146440237762, 0.08035240200068802, -0.06991915034863633, -0.09646099121123553, 0.31495583843812347, 0.11204088752530515, 0.24678018081188202, 0.02445147303363774, 0.3071359864287078, 0.0993462930516107, 0.13525391580350696, 0.11903490540385246, 0.3240238651048858, 0.1059432062804699, 0.05179105102643371, -0.23427983448543818, 0.0870028438421432, 0.011620298273861409] |
1,802.01164 | On operators on $C_0(\alpha\times L)$ under the Ostaszewski's
$\clubsuit$-principle | For an exotic locally compact Hausdorff space $L$, constructed under the
assumption of the Ostaszewski's $\clubsuit$-principle, and a countable ordinal
space $\alpha$, we prove that all operators defined on $C_0(\alpha\times L)$
are as simple as possible. We also investigate the geometry of such space
$C_0(\alpha\times L)$ and we classify up to isomorphisms all its complemented
subspaces.
| math.FA | for an exotic locally compact hausdorff space l constructed under the assumption of the ostaszewskis clubsuitprinciple and a countable ordinal space alpha we prove that all operators defined on c_0alphatimes l are as simple as possible we also investigate the geometry of such space c_0alphatimes l and we classify up to isomorphisms all its complemented subspaces | [['for', 'an', 'exotic', 'locally', 'compact', 'hausdorff', 'space', 'l', 'constructed', 'under', 'the', 'assumption', 'of', 'the', 'ostaszewskis', 'clubsuitprinciple', 'and', 'a', 'countable', 'ordinal', 'space', 'alpha', 'we', 'prove', 'that', 'all', 'operators', 'defined', 'on', 'c_0alphatimes', 'l', 'are', 'as', 'simple', 'as', 'possible', 'we', 'also', 'investigate', 'the', 'geometry', 'of', 'such', 'space', 'c_0alphatimes', 'l', 'and', 'we', 'classify', 'up', 'to', 'isomorphisms', 'all', 'its', 'complemented', 'subspaces']] | [-0.15519174431952146, 0.1362822202972893, -0.014232528395950794, 0.1397313175794597, -0.09939811209019703, -0.09773030852039273, 0.05190778335628028, 0.41184343197024786, -0.32899629509148115, -0.17873480507674125, 0.1308901014003473, -0.2689887357051842, -0.11406430415809155, 0.22303641669098467, -0.06062194645010795, 0.029285894275884718, -0.03262031268185148, 0.10582017082756814, -0.11400759139192254, -0.2651598434537076, 0.4434420101058025, -0.04701757619085793, 0.18582294271058905, -0.02677117306582379, 0.15562796499132395, 0.0007674205564678862, -0.07130558356248702, 0.06834436733501767, -0.20152076413083145, 0.10238257086334321, 0.23261294424390563, 0.12720527129623896, 0.2026762065406029, -0.3455303146575506, -0.18428931982131103, 0.19813554896973073, 0.10644944167086998, -0.03419594943989068, 0.05028012502589263, -0.3123839586041868, 0.1267118738211978, -0.15746812067496088, -0.1525633736477735, -0.17678937980403694, 0.10682007062356345, -0.021746800299017474, -0.2638201295183255, -0.07826522519742586, 0.12098334615047161, 0.06863900336275737, -0.11451853812860253, -0.09272057650825725, -0.07036052871710406, 0.11691231451606235, -0.03151194828275878, 0.041271230859610326, 0.07315079652023716, 0.003729790637197976, -0.10597674603251597, 0.3790407799041042, -0.08064639661461115, -0.248799849444857, 0.20870522810302924, -0.17118402982417208, -0.16811152595059517, 0.08370233246555123, 0.12407473241910338, 0.12856857111462608, -0.04484026176998249, 0.20701863172311838, -0.11807510094681326, 0.08551583302995333, 0.07097133180090728, 0.11997673790364598, 0.0930736594242402, 0.1329576775561481, 0.15482664860498446, 0.1300953139568894, -0.019407677441799585, 0.026379384645574298, -0.3963680158440883, -0.17521827170052207, -0.14917399970671305, 0.09163797876569263, -0.08404427280486114, -0.18482304278474587, 0.297882777862609, 0.049519278932935916, 0.2442964045689083, 0.10529700276226951, 0.18742688381686234, 0.03967635427565815, 0.018613894210340313, 0.11698983250579868, 0.12720074848486826, 0.1357889030343638, -0.053741082934161216, -0.14185155779593445, -0.04194907808246521, 0.12796616864999613] |
1,802.01165 | Ultrametric properties for valuation spaces of normal surface
singularities | Let $L$ be a fixed branch -- that is, an irreducible germ of curve -- on a
normal surface singularity $X$. If $A,B$ are two other branches, define
$u_L(A,B) := \dfrac{(L \cdot A) \: (L \cdot B)}{A \cdot B}$, where $A \cdot B$
denotes the intersection number of $A$ and $B$. Call $X$ arborescent if all the
dual graphs of its resolutions are trees. In a previous paper, the first three
authors extended a 1985 theorem of P{\l}oski by proving that whenever $X$ is
arborescent, the function $u_L$ is an ultrametric on the set of branches on $X$
different from $L$. In the present paper we prove that, conversely, if $u_L$ is
an ultrametric, then $X$ is arborescent. We also show that for any normal
surface singularity, one may find arbitrarily large sets of branches on $X$,
characterized uniquely in terms of the topology of the resolutions of their
sum, in restriction to which $u_L$ is still an ultrametric. Moreover, we
describe the associated tree in terms of the dual graphs of such resolutions.
Then we extend our setting by allowing $L$ to be an arbitrary semivaluation on
$X$ and by defining $u_L$ on a suitable space of semivaluations. We prove that
any such function is again an ultrametric if and only if $X$ is arborescent,
and without any restriction on $X$ we exhibit special subspaces of the space of
semivaluations in restriction to which $u_L$ is still an ultrametric.
| math.AG | let l be a fixed branch that is an irreducible germ of curve on a normal surface singularity x if ab are two other branches define u_lab dfracl cdot a l cdot ba cdot b where a cdot b denotes the intersection number of a and b call x arborescent if all the dual graphs of its resolutions are trees in a previous paper the first three authors extended a 1985 theorem of ploski by proving that whenever x is arborescent the function u_l is an ultrametric on the set of branches on x different from l in the present paper we prove that conversely if u_l is an ultrametric then x is arborescent we also show that for any normal surface singularity one may find arbitrarily large sets of branches on x characterized uniquely in terms of the topology of the resolutions of their sum in restriction to which u_l is still an ultrametric moreover we describe the associated tree in terms of the dual graphs of such resolutions then we extend our setting by allowing l to be an arbitrary semivaluation on x and by defining u_l on a suitable space of semivaluations we prove that any such function is again an ultrametric if and only if x is arborescent and without any restriction on x we exhibit special subspaces of the space of semivaluations in restriction to which u_l is still an ultrametric | [['let', 'l', 'be', 'a', 'fixed', 'branch', 'that', 'is', 'an', 'irreducible', 'germ', 'of', 'curve', 'on', 'a', 'normal', 'surface', 'singularity', 'x', 'if', 'ab', 'are', 'two', 'other', 'branches', 'define', 'u_lab', 'dfracl', 'cdot', 'a', 'l', 'cdot', 'ba', 'cdot', 'b', 'where', 'a', 'cdot', 'b', 'denotes', 'the', 'intersection', 'number', 'of', 'a', 'and', 'b', 'call', 'x', 'arborescent', 'if', 'all', 'the', 'dual', 'graphs', 'of', 'its', 'resolutions', 'are', 'trees', 'in', 'a', 'previous', 'paper', 'the', 'first', 'three', 'authors', 'extended', 'a', '1985', 'theorem', 'of', 'ploski', 'by', 'proving', 'that', 'whenever', 'x', 'is', 'arborescent', 'the', 'function', 'u_l', 'is', 'an', 'ultrametric', 'on', 'the', 'set', 'of', 'branches', 'on', 'x', 'different', 'from', 'l', 'in', 'the', 'present', 'paper', 'we', 'prove', 'that', 'conversely', 'if', 'u_l', 'is', 'an', 'ultrametric', 'then', 'x', 'is', 'arborescent', 'we', 'also', 'show', 'that', 'for', 'any', 'normal', 'surface', 'singularity', 'one', 'may', 'find', 'arbitrarily', 'large', 'sets', 'of', 'branches', 'on', 'x', 'characterized', 'uniquely', 'in', 'terms', 'of', 'the', 'topology', 'of', 'the', 'resolutions', 'of', 'their', 'sum', 'in', 'restriction', 'to', 'which', 'u_l', 'is', 'still', 'an', 'ultrametric', 'moreover', 'we', 'describe', 'the', 'associated', 'tree', 'in', 'terms', 'of', 'the', 'dual', 'graphs', 'of', 'such', 'resolutions', 'then', 'we', 'extend', 'our', 'setting', 'by', 'allowing', 'l', 'to', 'be', 'an', 'arbitrary', 'semivaluation', 'on', 'x', 'and', 'by', 'defining', 'u_l', 'on', 'a', 'suitable', 'space', 'of', 'semivaluations', 'we', 'prove', 'that', 'any', 'such', 'function', 'is', 'again', 'an', 'ultrametric', 'if', 'and', 'only', 'if', 'x', 'is', 'arborescent', 'and', 'without', 'any', 'restriction', 'on', 'x', 'we', 'exhibit', 'special', 'subspaces', 'of', 'the', 'space', 'of', 'semivaluations', 'in', 'restriction', 'to', 'which', 'u_l', 'is', 'still', 'an', 'ultrametric']] | [-0.17319013855456028, 0.12608078647950263, -0.09087500286332527, 0.04077353030533126, -0.0580518118179775, -0.11053902904858788, 0.03669008517202166, 0.37052931505467246, -0.3262054133816031, -0.20303185261953863, 0.0937565272072402, -0.2721698843152562, -0.14191673519969178, 0.18298586310075332, -0.10729475762088515, -0.06534579644092586, 0.03963977536546314, 0.11615247086695767, -0.096590708574488, -0.26135304253728253, 0.37247242563096367, -0.050388313578082, 0.1851865290454289, 0.031874044738358184, 0.15140600123766473, 0.00841984725877035, 0.026774927546058345, 0.03979067698140057, -0.1550045328616285, 0.09097669865384442, 0.23510458440292034, 0.13146465335964613, 0.22513497217114647, -0.34559437654944447, -0.15124260534656278, 0.21195373813473808, 0.14623084216670418, -0.009574451488282835, 0.035053554240338375, -0.24243456773587818, 0.16115017828047914, -0.11869046577680137, -0.11848740013668017, -0.05352165664909927, 0.11645291410506475, 0.014147168634931033, -0.27953402985031256, -0.026564292758708228, 0.11162784932053332, 0.058671328978605025, -0.0023474481482410508, -0.12368246110539899, -0.08142731418481393, 0.07962747941057441, -0.010591790788555159, 0.12190852721837298, 0.03170077965465922, -0.07503599785378227, -0.09215216276679555, 0.35713918445543924, -0.06476228495524165, -0.2365054233966979, 0.13947027900242226, -0.1764712750236204, -0.15255559626127324, 0.10899933018120078, 0.0969785305115798, 0.16172492290075566, -0.07093483594530002, 0.2247944212220849, -0.12788313689997396, 0.13870735430506423, 0.09750583662667468, 0.010589526304695356, 0.14419077443310696, 0.11910958749006298, 0.13884489105558703, 0.11192910830403355, -0.04382308607230507, 0.020293079744304967, -0.3607150502119447, -0.190677993990333, -0.18187746523265916, 0.13172569662000777, -0.13088309532006434, -0.18486291702133265, 0.32586268854003736, 0.06728427765976894, 0.25464961338436526, 0.07683415317911926, 0.21318619258705798, 0.08862254516599558, 0.010378550756832609, 0.10711596213289148, 0.10239524045627356, 0.11556089414951148, -0.03854954107404714, -0.14362129335623441, 0.04809234260137756, 0.13189407017345783] |
1,802.01166 | Privacy-Aware Smart Metering: Progress and Challenges | The next-generation energy network, the so-called smart grid (SG), promises a
tremendous increase in efficiency, safety and flexibility of managing the
electricity grid as compared to the legacy energy network. This is needed today
more than ever, as the global energy consumption is growing at an unprecedented
rate, and renewable energy sources have to be seamlessly integrated into the
grid to assure a sustainable human development. Smart meters (SMs) are among
the crucial enablers of the SG concept; they supply accurate high-frequency
information about users' household energy consumption to a utility provider,
which is essential for time of use pricing, rapid fault detection, energy theft
prevention, while also providing consumers with more flexibility and control
over their consumption. However, highly accurate and granular SM data also
poses a threat to consumer privacy as non-intrusive load monitoring techniques
enable a malicious attacker to infer many details of a user's private life.
This article focuses on privacy-enhancing energy management techniques that
provide accurate energy consumption information to the grid operator, without
sacrificing consumer privacy. In particular, we focus on techniques that shape
and modify the actual user energy consumption by means of physical resources,
such as rechargeable batteries, renewable energy sources or demand shaping. A
rigorous mathematical analysis of privacy is presented under various physical
constraints on the available physical resources. Finally, open questions and
challenges that need to be addressed to pave the way to the effective
protection of users' privacy in future SGs are presented.
| cs.IT math.IT | the nextgeneration energy network the socalled smart grid sg promises a tremendous increase in efficiency safety and flexibility of managing the electricity grid as compared to the legacy energy network this is needed today more than ever as the global energy consumption is growing at an unprecedented rate and renewable energy sources have to be seamlessly integrated into the grid to assure a sustainable human development smart meters sms are among the crucial enablers of the sg concept they supply accurate highfrequency information about users household energy consumption to a utility provider which is essential for time of use pricing rapid fault detection energy theft prevention while also providing consumers with more flexibility and control over their consumption however highly accurate and granular sm data also poses a threat to consumer privacy as nonintrusive load monitoring techniques enable a malicious attacker to infer many details of a users private life this article focuses on privacyenhancing energy management techniques that provide accurate energy consumption information to the grid operator without sacrificing consumer privacy in particular we focus on techniques that shape and modify the actual user energy consumption by means of physical resources such as rechargeable batteries renewable energy sources or demand shaping a rigorous mathematical analysis of privacy is presented under various physical constraints on the available physical resources finally open questions and challenges that need to be addressed to pave the way to the effective protection of users privacy in future sgs are presented | [['the', 'nextgeneration', 'energy', 'network', 'the', 'socalled', 'smart', 'grid', 'sg', 'promises', 'a', 'tremendous', 'increase', 'in', 'efficiency', 'safety', 'and', 'flexibility', 'of', 'managing', 'the', 'electricity', 'grid', 'as', 'compared', 'to', 'the', 'legacy', 'energy', 'network', 'this', 'is', 'needed', 'today', 'more', 'than', 'ever', 'as', 'the', 'global', 'energy', 'consumption', 'is', 'growing', 'at', 'an', 'unprecedented', 'rate', 'and', 'renewable', 'energy', 'sources', 'have', 'to', 'be', 'seamlessly', 'integrated', 'into', 'the', 'grid', 'to', 'assure', 'a', 'sustainable', 'human', 'development', 'smart', 'meters', 'sms', 'are', 'among', 'the', 'crucial', 'enablers', 'of', 'the', 'sg', 'concept', 'they', 'supply', 'accurate', 'highfrequency', 'information', 'about', 'users', 'household', 'energy', 'consumption', 'to', 'a', 'utility', 'provider', 'which', 'is', 'essential', 'for', 'time', 'of', 'use', 'pricing', 'rapid', 'fault', 'detection', 'energy', 'theft', 'prevention', 'while', 'also', 'providing', 'consumers', 'with', 'more', 'flexibility', 'and', 'control', 'over', 'their', 'consumption', 'however', 'highly', 'accurate', 'and', 'granular', 'sm', 'data', 'also', 'poses', 'a', 'threat', 'to', 'consumer', 'privacy', 'as', 'nonintrusive', 'load', 'monitoring', 'techniques', 'enable', 'a', 'malicious', 'attacker', 'to', 'infer', 'many', 'details', 'of', 'a', 'users', 'private', 'life', 'this', 'article', 'focuses', 'on', 'privacyenhancing', 'energy', 'management', 'techniques', 'that', 'provide', 'accurate', 'energy', 'consumption', 'information', 'to', 'the', 'grid', 'operator', 'without', 'sacrificing', 'consumer', 'privacy', 'in', 'particular', 'we', 'focus', 'on', 'techniques', 'that', 'shape', 'and', 'modify', 'the', 'actual', 'user', 'energy', 'consumption', 'by', 'means', 'of', 'physical', 'resources', 'such', 'as', 'rechargeable', 'batteries', 'renewable', 'energy', 'sources', 'or', 'demand', 'shaping', 'a', 'rigorous', 'mathematical', 'analysis', 'of', 'privacy', 'is', 'presented', 'under', 'various', 'physical', 'constraints', 'on', 'the', 'available', 'physical', 'resources', 'finally', 'open', 'questions', 'and', 'challenges', 'that', 'need', 'to', 'be', 'addressed', 'to', 'pave', 'the', 'way', 'to', 'the', 'effective', 'protection', 'of', 'users', 'privacy', 'in', 'future', 'sgs', 'are', 'presented']] | [-0.1424961364415845, 0.027214090577956308, -0.018268652909378312, 0.10265894387753642, -0.13741708124170499, -0.1821240334389066, 0.10888246338320326, 0.37162508629345603, -0.26550829921259866, -0.38795021525108997, 0.13045128458512148, -0.3042088255001118, -0.0620466084599647, 0.23112686114879896, -0.16798081525591943, 0.08457081247197122, 0.047591368836880546, 0.009357188272465743, 0.039553212543607365, -0.25643570958826767, 0.2544114250224084, 0.16283208270158087, 0.37175030109605617, 0.11520853830496686, 0.061184085574362196, -0.026740987598896027, -0.04210030490114373, -0.04112401731331281, -0.07899686203808025, 0.2083208301484737, 0.362536227811432, 0.18439501619574672, 0.37229677511531173, -0.5047709047186132, -0.24414322827895152, 0.1113885693622715, 0.12333654319482608, 0.03817520718593911, -0.09361399884148007, -0.23958322305840496, 0.100094672903295, -0.27120324043861155, -0.12857341903394887, -0.10117382875985789, -0.018255207003379355, 0.06397517905105425, -0.25095673238844324, -0.002971507280908183, -0.02581976281493256, 0.0801545989642642, -0.05516703732725119, -0.07377738575070944, -0.08339475381226108, 0.18639138624053067, 0.038590902960098976, -0.052709955214142644, 0.20437325686881586, -0.1624074489229872, -0.0968948948515427, 0.39935557620162715, 0.05422982936647806, -0.16153116779858057, 0.1302228877639246, -0.021793617095741236, -0.13019281827449106, 0.1128650803456311, 0.24995479116938552, 0.014173295113201045, -0.23311798714810497, 0.01632144429331303, 0.07686478471079347, 0.19574051049433422, 0.03279130094000424, 0.10537709394393831, 0.2216114552919658, 0.2514743360206105, 0.18390469706631551, 0.060275088432149924, -0.036505899463580654, -0.09980934772032256, -0.19926372072326817, -0.1788273167846919, -0.15674488527928385, 0.07272773142571427, -0.08094535947466099, -0.09504561200714196, 0.39269817133567164, 0.20639536695041674, 0.09594584230324063, 0.044080580192218936, 0.42815157821287914, 0.07629216315832978, 0.0896058753750534, 0.12369947320192444, 0.1551067821448669, -0.021771225298051627, 0.24373592404049954, -0.18014998590877773, 0.11243876561674536, -0.049695968551903356] |
1,802.01167 | Industrial Symbiotic Relations as Cooperative Games | In this paper, we introduce a game-theoretical formulation for a specific
form of collaborative industrial relations called "Industrial Symbiotic
Relation (ISR) games" and provide a formal framework to model, verify, and
support collaboration decisions in this new class of two-person operational
games. ISR games are formalized as cooperative cost-allocation games with the
aim to allocate the total ISR-related operational cost to involved industrial
firms in a fair and stable manner by taking into account their contribution to
the total traditional ISR-related cost. We tailor two types of allocation
mechanisms using which firms can implement cost allocations that result in a
collaboration that satisfies the fairness and stability properties. Moreover,
while industries receive a particular ISR proposal, our introduced methodology
is applicable as a managerial decision support to systematically verify the
quality of the ISR in question. This is achievable by analyzing if the
implemented allocation mechanism is a stable/fair allocation.
| cs.MA cs.GT | in this paper we introduce a gametheoretical formulation for a specific form of collaborative industrial relations called industrial symbiotic relation isr games and provide a formal framework to model verify and support collaboration decisions in this new class of twoperson operational games isr games are formalized as cooperative costallocation games with the aim to allocate the total isrrelated operational cost to involved industrial firms in a fair and stable manner by taking into account their contribution to the total traditional isrrelated cost we tailor two types of allocation mechanisms using which firms can implement cost allocations that result in a collaboration that satisfies the fairness and stability properties moreover while industries receive a particular isr proposal our introduced methodology is applicable as a managerial decision support to systematically verify the quality of the isr in question this is achievable by analyzing if the implemented allocation mechanism is a stablefair allocation | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'gametheoretical', 'formulation', 'for', 'a', 'specific', 'form', 'of', 'collaborative', 'industrial', 'relations', 'called', 'industrial', 'symbiotic', 'relation', 'isr', 'games', 'and', 'provide', 'a', 'formal', 'framework', 'to', 'model', 'verify', 'and', 'support', 'collaboration', 'decisions', 'in', 'this', 'new', 'class', 'of', 'twoperson', 'operational', 'games', 'isr', 'games', 'are', 'formalized', 'as', 'cooperative', 'costallocation', 'games', 'with', 'the', 'aim', 'to', 'allocate', 'the', 'total', 'isrrelated', 'operational', 'cost', 'to', 'involved', 'industrial', 'firms', 'in', 'a', 'fair', 'and', 'stable', 'manner', 'by', 'taking', 'into', 'account', 'their', 'contribution', 'to', 'the', 'total', 'traditional', 'isrrelated', 'cost', 'we', 'tailor', 'two', 'types', 'of', 'allocation', 'mechanisms', 'using', 'which', 'firms', 'can', 'implement', 'cost', 'allocations', 'that', 'result', 'in', 'a', 'collaboration', 'that', 'satisfies', 'the', 'fairness', 'and', 'stability', 'properties', 'moreover', 'while', 'industries', 'receive', 'a', 'particular', 'isr', 'proposal', 'our', 'introduced', 'methodology', 'is', 'applicable', 'as', 'a', 'managerial', 'decision', 'support', 'to', 'systematically', 'verify', 'the', 'quality', 'of', 'the', 'isr', 'in', 'question', 'this', 'is', 'achievable', 'by', 'analyzing', 'if', 'the', 'implemented', 'allocation', 'mechanism', 'is', 'a', 'stablefair', 'allocation']] | [-0.10499561714225333, 0.060080518496337616, -0.1185651789993456, 0.09871353700195681, -0.11747202362023192, -0.16664057538193994, 0.13484670838248622, 0.39753513379271255, -0.2467718355689351, -0.3140981433760018, 0.06990461574934347, -0.21671190386325478, -0.14692076357808728, 0.13354491822466202, -0.1421615265513936, 0.05593698032276884, 0.07007119060041102, -0.01762517342445192, 0.061710244023332, -0.27654728206506074, 0.3238846208056601, 0.08272889027394328, 0.3365311751920373, 0.07863623926365008, 0.08539266025405122, 0.017713952567173192, -0.04941769758313543, 0.04338994301370766, -0.1152356433900821, 0.14959891150667243, 0.3715994237804122, 0.2119410456706808, 0.3895993380207721, -0.38894368047277406, -0.16622493159000393, 0.10742822402373772, 0.09025816687331727, 0.013163805670545066, -0.03075226731534588, -0.2357552711443644, 0.09963106762694374, -0.28511786241441556, -0.06519929567600716, -0.08665432901941367, -0.011575735916865173, -0.006884981967805413, -0.33049257017340355, -0.04910772185683353, 0.023914216488140495, 0.0385711201951418, -0.07738872299812836, -0.10543936463264264, 0.000865901483076127, 0.15745030787505515, 0.036621701837459913, -0.03136627490581204, 0.13430274133602388, -0.1315015947481311, -0.2223066603573524, 0.4105003098733978, 0.02090801065787673, -0.18530661938074108, 0.15797381777689498, -0.0327026593875242, -0.16345390252296954, 0.07105795356878782, 0.22574849031572167, 0.07869997541483952, -0.21026614209165007, 0.047991130951543226, -0.04445087115522729, 0.1519521106040896, 0.0575445047962441, 0.04214592278163166, 0.14957612132883236, 0.2086167964009466, 0.09831304631948676, 0.17506937701765396, 0.051548830278166764, -0.15713959274022546, -0.25691909000615604, -0.1388368014284499, -0.11473280804116942, 0.01764428525786745, -0.03867534303691634, -0.08651570767189747, 0.35873493950731083, 0.14679485242600532, 0.11735238354933793, 0.10203986611832826, 0.34455065637960874, 0.10107250451883748, 0.04637824104339752, 0.08690978271555003, 0.20164019195362926, 0.05310579622802261, 0.17658383318076343, -0.20877495870689466, 0.11465126147480963, 0.018681985565918907] |
1,802.01168 | Machine Learning vs. Rules and Out-of-the-Box vs. Retrained: An
Evaluation of Open-Source Bibliographic Reference and Citation Parsers | Bibliographic reference parsing refers to extracting machine-readable
metadata, such as the names of the authors, the title, or journal name, from
bibliographic reference strings. Many approaches to this problem have been
proposed so far, including regular expressions, knowledge bases and supervised
machine learning. Many open source reference parsers based on various
algorithms are also available. In this paper, we apply, evaluate and compare
ten reference parsing tools in a specific business use case. The tools are
Anystyle-Parser, Biblio, CERMINE, Citation, Citation-Parser, GROBID, ParsCit,
PDFSSA4MET, Reference Tagger and Science Parse, and we compare them in both
their out-of-the-box versions and versions tuned to the project-specific data.
According to our evaluation, the best performing out-of-the-box tool is GROBID
(F1 0.89), followed by CERMINE (F1 0.83) and ParsCit (F1 0.75). We also found
that even though machine learning-based tools and tools based on rules or
regular expressions achieve on average similar precision (0.77 for ML-based
tools vs. 0.76 for non-ML-based tools), applying machine learning-based tools
results in a recall three times higher than in the case of non-ML-based tools
(0.66 vs. 0.22). Our study also confirms that tuning the models to the
task-specific data results in the increase in the quality. The retrained
versions of reference parsers are in all cases better than their out-of-the-box
counterparts; for GROBID F1 increased by 3% (0.92 vs. 0.89), for CERMINE by 11%
(0.92 vs. 0.83), and for ParsCit by 16% (0.87 vs. 0.75).
| cs.DL | bibliographic reference parsing refers to extracting machinereadable metadata such as the names of the authors the title or journal name from bibliographic reference strings many approaches to this problem have been proposed so far including regular expressions knowledge bases and supervised machine learning many open source reference parsers based on various algorithms are also available in this paper we apply evaluate and compare ten reference parsing tools in a specific business use case the tools are anystyleparser biblio cermine citation citationparser grobid parscit pdfssa4met reference tagger and science parse and we compare them in both their outofthebox versions and versions tuned to the projectspecific data according to our evaluation the best performing outofthebox tool is grobid f1 089 followed by cermine f1 083 and parscit f1 075 we also found that even though machine learningbased tools and tools based on rules or regular expressions achieve on average similar precision 077 for mlbased tools vs 076 for nonmlbased tools applying machine learningbased tools results in a recall three times higher than in the case of nonmlbased tools 066 vs 022 our study also confirms that tuning the models to the taskspecific data results in the increase in the quality the retrained versions of reference parsers are in all cases better than their outofthebox counterparts for grobid f1 increased by 3 092 vs 089 for cermine by 11 092 vs 083 and for parscit by 16 087 vs 075 | [['bibliographic', 'reference', 'parsing', 'refers', 'to', 'extracting', 'machinereadable', 'metadata', 'such', 'as', 'the', 'names', 'of', 'the', 'authors', 'the', 'title', 'or', 'journal', 'name', 'from', 'bibliographic', 'reference', 'strings', 'many', 'approaches', 'to', 'this', 'problem', 'have', 'been', 'proposed', 'so', 'far', 'including', 'regular', 'expressions', 'knowledge', 'bases', 'and', 'supervised', 'machine', 'learning', 'many', 'open', 'source', 'reference', 'parsers', 'based', 'on', 'various', 'algorithms', 'are', 'also', 'available', 'in', 'this', 'paper', 'we', 'apply', 'evaluate', 'and', 'compare', 'ten', 'reference', 'parsing', 'tools', 'in', 'a', 'specific', 'business', 'use', 'case', 'the', 'tools', 'are', 'anystyleparser', 'biblio', 'cermine', 'citation', 'citationparser', 'grobid', 'parscit', 'pdfssa4met', 'reference', 'tagger', 'and', 'science', 'parse', 'and', 'we', 'compare', 'them', 'in', 'both', 'their', 'outofthebox', 'versions', 'and', 'versions', 'tuned', 'to', 'the', 'projectspecific', 'data', 'according', 'to', 'our', 'evaluation', 'the', 'best', 'performing', 'outofthebox', 'tool', 'is', 'grobid', 'f1', '089', 'followed', 'by', 'cermine', 'f1', '083', 'and', 'parscit', 'f1', '075', 'we', 'also', 'found', 'that', 'even', 'though', 'machine', 'learningbased', 'tools', 'and', 'tools', 'based', 'on', 'rules', 'or', 'regular', 'expressions', 'achieve', 'on', 'average', 'similar', 'precision', '077', 'for', 'mlbased', 'tools', 'vs', '076', 'for', 'nonmlbased', 'tools', 'applying', 'machine', 'learningbased', 'tools', 'results', 'in', 'a', 'recall', 'three', 'times', 'higher', 'than', 'in', 'the', 'case', 'of', 'nonmlbased', 'tools', '066', 'vs', '022', 'our', 'study', 'also', 'confirms', 'that', 'tuning', 'the', 'models', 'to', 'the', 'taskspecific', 'data', 'results', 'in', 'the', 'increase', 'in', 'the', 'quality', 'the', 'retrained', 'versions', 'of', 'reference', 'parsers', 'are', 'in', 'all', 'cases', 'better', 'than', 'their', 'outofthebox', 'counterparts', 'for', 'grobid', 'f1', 'increased', 'by', '3', '092', 'vs', '089', 'for', 'cermine', 'by', '11', '092', 'vs', '083', 'and', 'for', 'parscit', 'by', '16', '087', 'vs', '075']] | [0.01419026742576424, 0.006390020017435541, -0.02795145536462466, 0.11081421782942469, -0.06763169028518068, -0.17900495429914365, 0.09881339160558159, 0.4144004797200104, -0.18179781605122666, -0.391132222361524, 0.08676571374304504, -0.3361627817278913, -0.0905850650258846, 0.25617486826301394, -0.09688904134605031, 0.06014939203447142, 0.10435028940245702, 0.05262098086844662, -0.09801440650508517, -0.2718687292165224, 0.22893359332075303, 0.03541981941643393, 0.36415539343248715, 0.014032154767315282, 0.048225672406260855, -0.015157348303743174, -0.08753740827419929, -0.010277109018763393, -0.14052596006642482, 0.13957116466763458, 0.28961966410995216, 0.2072704950039118, 0.27028274306325945, -0.31544760264278876, -0.12255376841655219, 0.047060052018100595, 0.14411042416412828, 0.06252567617281127, 0.010976477354277103, -0.2971081188517054, 0.11857140737734896, -0.18014822644685513, -0.009897578335306668, -0.11704191414627259, 0.015514839931443591, 0.02280519490351485, -0.24782456474951206, 0.06319665353988636, 0.05694915262329114, 0.14948892540971695, -0.09167747329860054, -0.20716511299309534, 0.026854740610463116, 0.16032461914484836, 0.007208183122540772, 0.1395075871091078, 0.12846766193336867, -0.1483146522208447, -0.17403765368775276, 0.3849644552234931, -0.0953717041077562, -0.21087925544399688, 0.19151592512768228, -0.04609439823195919, -0.16283798056707044, 0.056411066824304204, 0.15270211396676395, 0.0899915800155725, -0.17285093293803466, 0.018580296375179963, 0.0491242693995178, 0.2283832575632985, 0.11844889564617049, -0.01801503253662233, 0.16363648168170156, 0.168072772447677, -0.0431827743229299, 0.1149857182415289, -0.0763499044448599, -0.05420199387356058, -0.18905253136264427, -0.12126865062773937, -0.10478981051975014, -0.017130014948240478, -0.11658216409891183, -0.1183541496566525, 0.370687530980772, 0.18793141363835963, 0.15243048779679022, 0.08595459223462841, 0.29641953427586465, 0.008568523226414698, 0.06481388387637156, 0.11405335916548935, 0.22164443045657015, 0.02092873705581266, 0.14586906604573646, -0.09071174465488739, 0.06971730689671359, 0.030597862217059252] |
1,802.01169 | $\tau$-exceptional sequences | We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional
sequences for any finite dimensional algebra. We prove that for a fixed algebra
of rank $n$, and for any positive integer $t \leq n$, there is a bijection
between the set of signed $\tau$-exceptional sequences of length $t$, and
(basic) ordered support $\tau$-rigid objects with $t$ indecomposable direct
summands. If the algebra is hereditary, our notions coincide with exceptional
and signed exceptional sequences. The latter were recently introduced by Igusa
and Todorov, who constructed a similar bijection in the hereditary setting.
| math.RT | we introduce the notions of tauexceptional and signed tauexceptional sequences for any finite dimensional algebra we prove that for a fixed algebra of rank n and for any positive integer t leq n there is a bijection between the set of signed tauexceptional sequences of length t and basic ordered support taurigid objects with t indecomposable direct summands if the algebra is hereditary our notions coincide with exceptional and signed exceptional sequences the latter were recently introduced by igusa and todorov who constructed a similar bijection in the hereditary setting | [['we', 'introduce', 'the', 'notions', 'of', 'tauexceptional', 'and', 'signed', 'tauexceptional', 'sequences', 'for', 'any', 'finite', 'dimensional', 'algebra', 'we', 'prove', 'that', 'for', 'a', 'fixed', 'algebra', 'of', 'rank', 'n', 'and', 'for', 'any', 'positive', 'integer', 't', 'leq', 'n', 'there', 'is', 'a', 'bijection', 'between', 'the', 'set', 'of', 'signed', 'tauexceptional', 'sequences', 'of', 'length', 't', 'and', 'basic', 'ordered', 'support', 'taurigid', 'objects', 'with', 't', 'indecomposable', 'direct', 'summands', 'if', 'the', 'algebra', 'is', 'hereditary', 'our', 'notions', 'coincide', 'with', 'exceptional', 'and', 'signed', 'exceptional', 'sequences', 'the', 'latter', 'were', 'recently', 'introduced', 'by', 'igusa', 'and', 'todorov', 'who', 'constructed', 'a', 'similar', 'bijection', 'in', 'the', 'hereditary', 'setting']] | [-0.1815844881348312, 0.17011572875910336, -0.03681176323443651, 0.07169542012787941, -0.08563656759086169, -0.1886285306678878, 0.02835806294137405, 0.35085877445009017, -0.3277488768928581, -0.23303709588944913, 0.05462860668776557, -0.2707980889413092, -0.15975930884596892, 0.13504007469034857, -0.1300663167093363, -0.02171204454369015, 0.07143086185161439, 0.11605997015204694, -0.06550074551357991, -0.30007120643923474, 0.3748164604935381, -0.06445671232003304, 0.1875163114215765, 0.022256539741324053, 0.1797046529646549, 0.05796127189468178, -0.03990430806039108, 0.05224094482966595, -0.19013752539734316, 0.07671569047185282, 0.3104215485768186, 0.1253192247900491, 0.22735131891030405, -0.29921247698366643, -0.06734752548444602, 0.2565574002969596, 0.11791685475456891, -0.014962650195553175, -0.018821864670866894, -0.25098510589450596, 0.1791480249311361, -0.1584734317794856, -0.08511717575343533, -0.0563736195391458, 0.16687330704104777, 0.04417879237896866, -0.30874986835858886, -0.008481974941160944, 0.14686339233691495, 0.16983992114611385, -0.03131817048932943, -0.14572153810618652, -0.05756576916513344, 0.10157604922747446, -0.05291996677406132, 0.047348866693209854, 0.005566379314081537, -0.04225817286618015, -0.20823931774745386, 0.27866930635128584, 0.002737217748330699, -0.19594720404388177, 0.16099684302591616, -0.1833096753184994, -0.1637246918398887, 0.09522803690439711, 0.01832021332035462, 0.15990522048054523, -0.0007033007756237768, 0.2000809151026058, -0.17860529425347016, 0.06399587723943923, 0.1787251706338591, 0.00320857976977196, 0.14211341846320363, 0.05343796331435442, 0.07385297986782259, 0.1601480846396751, 0.06497360103142759, 0.019166800995460816, -0.3278522188050879, -0.18633439667108986, -0.15736088793103895, 0.11264710422191355, -0.1589522928285684, -0.19415927761130863, 0.33826162493270306, 0.08642782315081503, 0.18059415453010136, 0.18528926886825098, 0.17474629974458367, 0.048962917763694554, 0.08925863969941727, 0.05331452838662598, 0.041180814797472626, 0.2525882862210791, -0.011764685871700447, -0.11119427623084953, 0.017522488658626875, 0.23273824286750622] |
1,802.0117 | On Higher Inductive Types in Cubical Type Theory | Cubical type theory provides a constructive justification to certain aspects
of homotopy type theory such as Voevodsky's univalence axiom. This makes many
extensionality principles, like function and propositional extensionality,
directly provable in the theory. This paper describes a constructive semantics,
expressed in a presheaf topos with suitable structure inspired by cubical sets,
of some higher inductive types. It also extends cubical type theory by a syntax
for the higher inductive types of spheres, torus, suspensions,truncations, and
pushouts. All of these types are justified by the semantics and have judgmental
computation rules for all constructors, including the higher dimensional ones,
and the universes are closed under these type formers.
| cs.LO math.LO | cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as voevodskys univalence axiom this makes many extensionality principles like function and propositional extensionality directly provable in the theory this paper describes a constructive semantics expressed in a presheaf topos with suitable structure inspired by cubical sets of some higher inductive types it also extends cubical type theory by a syntax for the higher inductive types of spheres torus suspensionstruncations and pushouts all of these types are justified by the semantics and have judgmental computation rules for all constructors including the higher dimensional ones and the universes are closed under these type formers | [['cubical', 'type', 'theory', 'provides', 'a', 'constructive', 'justification', 'to', 'certain', 'aspects', 'of', 'homotopy', 'type', 'theory', 'such', 'as', 'voevodskys', 'univalence', 'axiom', 'this', 'makes', 'many', 'extensionality', 'principles', 'like', 'function', 'and', 'propositional', 'extensionality', 'directly', 'provable', 'in', 'the', 'theory', 'this', 'paper', 'describes', 'a', 'constructive', 'semantics', 'expressed', 'in', 'a', 'presheaf', 'topos', 'with', 'suitable', 'structure', 'inspired', 'by', 'cubical', 'sets', 'of', 'some', 'higher', 'inductive', 'types', 'it', 'also', 'extends', 'cubical', 'type', 'theory', 'by', 'a', 'syntax', 'for', 'the', 'higher', 'inductive', 'types', 'of', 'spheres', 'torus', 'suspensionstruncations', 'and', 'pushouts', 'all', 'of', 'these', 'types', 'are', 'justified', 'by', 'the', 'semantics', 'and', 'have', 'judgmental', 'computation', 'rules', 'for', 'all', 'constructors', 'including', 'the', 'higher', 'dimensional', 'ones', 'and', 'the', 'universes', 'are', 'closed', 'under', 'these', 'type', 'formers']] | [-0.11262867738988912, 0.0631314774052562, -0.06307878864006461, 0.1824693480206253, -0.1640538516602366, -0.16930045091729856, 0.05162883567880561, 0.3222731532894562, -0.3024451134064905, -0.23840825627862572, 0.06127541814495539, -0.18469188627395255, -0.1537977035035527, 0.1719138312183982, -0.1937522451938935, -0.03680938094958802, -0.0032838829151119724, 0.05494545542017043, -0.04434734405775633, -0.22717021104431423, 0.397138884256237, -0.05824084659150549, 0.2674427121570924, 0.028624975461421412, 0.08190197061538418, 0.024815496988594532, -0.005590249749474994, 0.10453346416476035, -0.13649438920422136, 0.1896896835146733, 0.3291929593292352, 0.1999121896322016, 0.27319105456705056, -0.45107329097167354, -0.16946490466699143, 0.04443774844528498, 0.06083846872968373, 0.08378670584828218, 0.036047296990231376, -0.27221161413450384, 0.08949046817860593, -0.21408244694591821, -0.1173742710325484, -0.14414188559123567, 0.0357613973580649, 0.05290050081643232, -0.1976470459218868, -0.02769344986147665, 0.19665071338188844, 0.1777271847545265, -0.07371452407994107, -0.1001939428752619, 0.00594165916859268, 0.03406435305635645, -0.04095600628964255, -0.026462181103546346, 0.10921215816514096, -0.0732638627064559, -0.1776456797547708, 0.3755097057513684, -0.010552965470145797, -0.21016547226381846, 0.23242913972081564, -0.067949235530692, -0.20221807910390546, 0.09866662764493114, -0.035272820130269104, 0.14429869969532103, -0.13287361603389086, 0.1755850660183824, -0.05333032561727216, 0.13356353993588518, 0.164541361914408, 0.10519255032745477, 0.17712232839124642, 0.1413385597858404, 0.011005663992423633, 0.12650145093309823, 0.08837988008701494, -0.13586013758485424, -0.3858535309522369, -0.14421932225017134, -0.040466539920786415, 0.06185195792170468, -0.15236701214387927, -0.23073147361005752, 0.3256965206857666, 0.09321527547044157, 0.10801233196327524, 0.16690856787766695, 0.27554000616421764, 0.07309749952156236, 0.08859523545915836, -0.03125967413935567, 0.14467010344297052, 0.18938685241634043, 0.07820838081833219, -0.06511678523220836, 0.051392556886214795, 0.24056427830516874] |
1,802.01171 | Parameter estimators of random intersection graphs with thinned
communities | This paper studies a statistical network model generated by a large number of
randomly sized overlapping communities, where any pair of nodes sharing a
community is linked with probability $q$ via the community. In the special case
with $q=1$ the model reduces to a random intersection graph which is known to
generate high levels of transitivity also in the sparse context. The parameter
$q$ adds a degree of freedom and leads to a parsimonious and analytically
tractable network model with tunable density, transitivity, and degree
fluctuations. We prove that the parameters of this model can be consistently
estimated in the large and sparse limiting regime using moment estimators based
on partially observed densities of links, 2-stars, and triangles.
| math.PR cs.SI math.ST stat.TH | this paper studies a statistical network model generated by a large number of randomly sized overlapping communities where any pair of nodes sharing a community is linked with probability q via the community in the special case with q1 the model reduces to a random intersection graph which is known to generate high levels of transitivity also in the sparse context the parameter q adds a degree of freedom and leads to a parsimonious and analytically tractable network model with tunable density transitivity and degree fluctuations we prove that the parameters of this model can be consistently estimated in the large and sparse limiting regime using moment estimators based on partially observed densities of links 2stars and triangles | [['this', 'paper', 'studies', 'a', 'statistical', 'network', 'model', 'generated', 'by', 'a', 'large', 'number', 'of', 'randomly', 'sized', 'overlapping', 'communities', 'where', 'any', 'pair', 'of', 'nodes', 'sharing', 'a', 'community', 'is', 'linked', 'with', 'probability', 'q', 'via', 'the', 'community', 'in', 'the', 'special', 'case', 'with', 'q1', 'the', 'model', 'reduces', 'to', 'a', 'random', 'intersection', 'graph', 'which', 'is', 'known', 'to', 'generate', 'high', 'levels', 'of', 'transitivity', 'also', 'in', 'the', 'sparse', 'context', 'the', 'parameter', 'q', 'adds', 'a', 'degree', 'of', 'freedom', 'and', 'leads', 'to', 'a', 'parsimonious', 'and', 'analytically', 'tractable', 'network', 'model', 'with', 'tunable', 'density', 'transitivity', 'and', 'degree', 'fluctuations', 'we', 'prove', 'that', 'the', 'parameters', 'of', 'this', 'model', 'can', 'be', 'consistently', 'estimated', 'in', 'the', 'large', 'and', 'sparse', 'limiting', 'regime', 'using', 'moment', 'estimators', 'based', 'on', 'partially', 'observed', 'densities', 'of', 'links', '2stars', 'and', 'triangles']] | [-0.14233481765614223, 0.13280003753853803, -0.03935463513421305, 0.04195442937425006, -0.05461497413649587, -0.15195983203295205, 0.08254123480953039, 0.34367855410959763, -0.28129654007537636, -0.317085147677463, 0.05911654471202706, -0.2582297621786168, -0.17252224667187213, 0.0933343953042591, -0.06081060918395297, 0.030930690875797834, 0.0690208774186292, 0.05861803463076131, -0.004620233772646131, -0.24190604331300364, 0.3128681005475948, 0.06062840293871902, 0.28147937211413254, 0.020972870345527337, 0.11279896065845328, 0.016696707140338624, -0.0065711582803672525, 0.09593671373825646, -0.10906092975500989, 0.14731222278067557, 0.2416629797238383, 0.1112278968439106, 0.27554929418236773, -0.3763080660601036, -0.22059089951690727, 0.1717971523886278, 0.12629328453439778, 0.09929294867729137, 0.01642326475219738, -0.2680875373968728, 0.10238772685939478, -0.20094618982447005, -0.12818402916556065, -0.07413540634926472, -0.00805272041598998, 0.05914077175518703, -0.33986027994966606, 0.07270632109035524, 0.044837673257846954, 0.04077504537565539, 0.03195156758232832, -0.10796189724104636, -0.04330022644717246, 0.09462966740731213, 0.02610064501058625, 0.019630992193153854, 0.06895084399335338, -0.15468232604128435, -0.09576080663334895, 0.35995010368652264, -0.032671064761925044, -0.22313950617276765, 0.16971729674684358, -0.1463877282113279, -0.16583025025330106, 0.11670728379532978, 0.20202819628530513, 0.09518747886848021, -0.11925146192059678, 0.08605492669424059, -0.09099015003658231, 0.18065443663400108, 0.04699913401282945, 0.008767397509950954, 0.18205448019049936, 0.1644895305320368, 0.08430227633344672, 0.16990197442720598, -0.09036081118442087, -0.08206052360543192, -0.23541998380984544, -0.07139657534682586, -0.23219134167657565, -0.006003187397116069, -0.17263513761195176, -0.16990398579292884, 0.43260337679126, 0.13614381509892232, 0.2372190119043561, 0.09090695316583644, 0.2705670281202864, 0.10212084995109146, 0.06463819052392648, 0.10968174800174153, 0.14811986389222664, 0.14958430767371084, 0.009273536515153818, -0.14005435380090217, 0.10513513641218829, 0.034933979828226366] |
1,802.01172 | Nonequilibrium Kondo effect by equilibrium numerical renormalization
group method: The hybrid Anderson model subject to a finite spin bias | We investigate Kondo correlations in a quantum dot with normal and
superconducting electrodes, where a spin bias voltage is applied across the
device and the local interaction $U$ is either attractive or repulsive. When
the spin current is blockaded in the large-gap regime, this nonequilibrium
strongly-correlated problem maps into an equilibrium model solvable by the
numerical renormalization group method. The Kondo spectra with characteristic
splitting due to the nonequilibrium spin accumulation are thus obtained at high
precision. It is shown that while the bias-induced decoherence of the spin
Kondo effect is partially compensated by the superconductivity, the charge
Kondo effect is enhanced out of equilibrium and undergoes an additional
splitting by the superconducting proximity effect, yielding four Kondo peaks in
the local spectral density. In the charge Kondo regime, we find a universal
scaling of charge conductance in this hybrid device under different spin
biases. The universal conductance as a function of the coupling to the
superconducting lead is peaked at and hence directly measures the Kondo
temperature. Our results are of direct relevance to recent experiments
realizing negative-$U$ charge Kondo effect in hybrid oxide quantum dots [Nat.
Commun. \textbf{8}, 395 (2017)].
| cond-mat.str-el cond-mat.mes-hall | we investigate kondo correlations in a quantum dot with normal and superconducting electrodes where a spin bias voltage is applied across the device and the local interaction u is either attractive or repulsive when the spin current is blockaded in the largegap regime this nonequilibrium stronglycorrelated problem maps into an equilibrium model solvable by the numerical renormalization group method the kondo spectra with characteristic splitting due to the nonequilibrium spin accumulation are thus obtained at high precision it is shown that while the biasinduced decoherence of the spin kondo effect is partially compensated by the superconductivity the charge kondo effect is enhanced out of equilibrium and undergoes an additional splitting by the superconducting proximity effect yielding four kondo peaks in the local spectral density in the charge kondo regime we find a universal scaling of charge conductance in this hybrid device under different spin biases the universal conductance as a function of the coupling to the superconducting lead is peaked at and hence directly measures the kondo temperature our results are of direct relevance to recent experiments realizing negativeu charge kondo effect in hybrid oxide quantum dots nat commun textbf8 395 2017 | [['we', 'investigate', 'kondo', 'correlations', 'in', 'a', 'quantum', 'dot', 'with', 'normal', 'and', 'superconducting', 'electrodes', 'where', 'a', 'spin', 'bias', 'voltage', 'is', 'applied', 'across', 'the', 'device', 'and', 'the', 'local', 'interaction', 'u', 'is', 'either', 'attractive', 'or', 'repulsive', 'when', 'the', 'spin', 'current', 'is', 'blockaded', 'in', 'the', 'largegap', 'regime', 'this', 'nonequilibrium', 'stronglycorrelated', 'problem', 'maps', 'into', 'an', 'equilibrium', 'model', 'solvable', 'by', 'the', 'numerical', 'renormalization', 'group', 'method', 'the', 'kondo', 'spectra', 'with', 'characteristic', 'splitting', 'due', 'to', 'the', 'nonequilibrium', 'spin', 'accumulation', 'are', 'thus', 'obtained', 'at', 'high', 'precision', 'it', 'is', 'shown', 'that', 'while', 'the', 'biasinduced', 'decoherence', 'of', 'the', 'spin', 'kondo', 'effect', 'is', 'partially', 'compensated', 'by', 'the', 'superconductivity', 'the', 'charge', 'kondo', 'effect', 'is', 'enhanced', 'out', 'of', 'equilibrium', 'and', 'undergoes', 'an', 'additional', 'splitting', 'by', 'the', 'superconducting', 'proximity', 'effect', 'yielding', 'four', 'kondo', 'peaks', 'in', 'the', 'local', 'spectral', 'density', 'in', 'the', 'charge', 'kondo', 'regime', 'we', 'find', 'a', 'universal', 'scaling', 'of', 'charge', 'conductance', 'in', 'this', 'hybrid', 'device', 'under', 'different', 'spin', 'biases', 'the', 'universal', 'conductance', 'as', 'a', 'function', 'of', 'the', 'coupling', 'to', 'the', 'superconducting', 'lead', 'is', 'peaked', 'at', 'and', 'hence', 'directly', 'measures', 'the', 'kondo', 'temperature', 'our', 'results', 'are', 'of', 'direct', 'relevance', 'to', 'recent', 'experiments', 'realizing', 'negativeu', 'charge', 'kondo', 'effect', 'in', 'hybrid', 'oxide', 'quantum', 'dots', 'nat', 'commun', 'textbf8', '395', '2017']] | [-0.17355164657480296, 0.1982109220906144, -0.07082104979053838, 0.03647051933724773, 0.007194247807395489, -0.2049022910602313, 0.06517164367930188, 0.3410596862183108, -0.27103287673768744, -0.28140999080884893, -0.027854048673664995, -0.3180794377985876, -0.10604456627455268, 0.17978940918449857, 0.0168980804446619, 0.005690831330866786, -0.03904196037910879, -0.04083540998302245, -0.1152974809265288, -0.2193544610557486, 0.2978912779217353, 0.026102472636315117, 0.3283888160585775, 0.1573394256068544, 0.04791097314364379, -0.0016983002856629052, 0.12748068646518126, 0.04452572503457001, -0.11916089344128977, -0.00862034093188413, 0.2636218354258138, -0.12423310918287218, 0.24140425303509497, -0.41716278754271724, -0.18745970537080817, 0.034597394379792, 0.1155050031884457, 0.1787595654289665, -0.06730379299794247, -0.31597386797269184, 0.039762084340812485, -0.18782861924288832, -0.08688025009905687, -0.06279470787073176, 0.0002774378990579862, -0.03369060456407169, -0.28405000185011886, 0.1571359283880156, 0.06936106728365606, 0.05276313547716427, -0.012523054778284859, -0.09442119303275831, -0.04966217750794991, 0.05114068255898019, -0.005629983312852953, 0.04024796970770694, 0.20543640003400773, -0.12479477183660492, -0.1326513766349914, 0.31077473668847233, -0.05578586892564393, -0.10468570232963732, 0.1682201341330559, -0.1798238203555229, -0.055632040017371764, 0.12990847681733916, 0.05906345912565788, 0.058643646875376966, -0.15219682965872985, 0.11825437281974398, 0.0002822443148033926, 0.1457595270088253, -0.004514961515572698, 0.09466119521675864, 0.28733272385337233, 0.20050216873035728, 0.09544355093870156, 0.13755364305810266, -0.13330533217716342, -0.09128607139306648, -0.22129019684507512, -0.13139546694007245, -0.24924435254069977, 0.10119431718946241, -0.052224613998229565, -0.1612236475161808, 0.43520548777693574, 0.17760521419283273, 0.1862817414851937, -0.06480985551403744, 0.2674934351137684, 0.17144838606812604, 0.0655305361894231, 0.02606939158916551, 0.21758279816034096, 0.17604972841218114, 0.08968594143152586, -0.38891963048323913, 0.036042896934304736, 0.007827595933122211] |
1,802.01173 | Tunneling Neural Perception and Logic Reasoning through Abductive
Learning | Perception and reasoning are basic human abilities that are seamlessly
connected as part of human intelligence. However, in current machine learning
systems, the perception and reasoning modules are incompatible. Tasks requiring
joint perception and reasoning ability are difficult to accomplish autonomously
and still demand human intervention. Inspired by the way language experts
decoded Mayan scripts by joining two abilities in an abductive manner, this
paper proposes the abductive learning framework. The framework learns
perception and reasoning simultaneously with the help of a trial-and-error
abductive process. We present the Neural-Logical Machine as an implementation
of this novel learning framework. We demonstrate that--using human-like
abductive learning--the machine learns from a small set of simple hand-written
equations and then generalizes well to complex equations, a feat that is beyond
the capability of state-of-the-art neural network models. The abductive
learning framework explores a new direction for approaching human-level
learning ability.
| cs.AI | perception and reasoning are basic human abilities that are seamlessly connected as part of human intelligence however in current machine learning systems the perception and reasoning modules are incompatible tasks requiring joint perception and reasoning ability are difficult to accomplish autonomously and still demand human intervention inspired by the way language experts decoded mayan scripts by joining two abilities in an abductive manner this paper proposes the abductive learning framework the framework learns perception and reasoning simultaneously with the help of a trialanderror abductive process we present the neurallogical machine as an implementation of this novel learning framework we demonstrate thatusing humanlike abductive learningthe machine learns from a small set of simple handwritten equations and then generalizes well to complex equations a feat that is beyond the capability of stateoftheart neural network models the abductive learning framework explores a new direction for approaching humanlevel learning ability | [['perception', 'and', 'reasoning', 'are', 'basic', 'human', 'abilities', 'that', 'are', 'seamlessly', 'connected', 'as', 'part', 'of', 'human', 'intelligence', 'however', 'in', 'current', 'machine', 'learning', 'systems', 'the', 'perception', 'and', 'reasoning', 'modules', 'are', 'incompatible', 'tasks', 'requiring', 'joint', 'perception', 'and', 'reasoning', 'ability', 'are', 'difficult', 'to', 'accomplish', 'autonomously', 'and', 'still', 'demand', 'human', 'intervention', 'inspired', 'by', 'the', 'way', 'language', 'experts', 'decoded', 'mayan', 'scripts', 'by', 'joining', 'two', 'abilities', 'in', 'an', 'abductive', 'manner', 'this', 'paper', 'proposes', 'the', 'abductive', 'learning', 'framework', 'the', 'framework', 'learns', 'perception', 'and', 'reasoning', 'simultaneously', 'with', 'the', 'help', 'of', 'a', 'trialanderror', 'abductive', 'process', 'we', 'present', 'the', 'neurallogical', 'machine', 'as', 'an', 'implementation', 'of', 'this', 'novel', 'learning', 'framework', 'we', 'demonstrate', 'thatusing', 'humanlike', 'abductive', 'learningthe', 'machine', 'learns', 'from', 'a', 'small', 'set', 'of', 'simple', 'handwritten', 'equations', 'and', 'then', 'generalizes', 'well', 'to', 'complex', 'equations', 'a', 'feat', 'that', 'is', 'beyond', 'the', 'capability', 'of', 'stateoftheart', 'neural', 'network', 'models', 'the', 'abductive', 'learning', 'framework', 'explores', 'a', 'new', 'direction', 'for', 'approaching', 'humanlevel', 'learning', 'ability']] | [-0.030544868589559983, 0.024516615954477555, -0.0702031504115439, 0.06943363606242453, -0.24632920644297782, -0.22405116319552892, 0.027914808211789932, 0.4474579438360201, -0.2986668902028921, -0.3725599433722285, 0.007514808490264436, -0.23213494178425106, -0.26025007830321556, 0.17070774281374826, -0.22379282551507154, 0.13152167109203422, 0.11090731930663525, 0.08175139616165931, -0.005720972161119183, -0.2353658916674451, 0.2971508764813835, 0.012385937357774109, 0.33182398545128916, -0.004002993809990585, 0.16987254385862294, 0.01597455098332527, 0.0015747817190761755, -0.02707725802853626, -0.00978789185935764, 0.2491919529553949, 0.40767587782902914, 0.32524959195870906, 0.40519610252279864, -0.4543830431713205, -0.19058228894654247, 0.054425327663516834, 0.1427845755840988, 0.08869724605655291, 0.007511551944642431, -0.3925849521894836, 0.06796021342193449, -0.20939929661593246, -0.009417213761480525, -0.19955473328688336, -0.03457404803581691, -0.05549445872909726, -0.24535680843190574, -0.04528485100470587, 0.1433511534358129, 0.13391537185654873, -0.0634350826597559, -0.057624284532115176, 0.09132860011110704, 0.1851517446533156, 0.02481340678160551, 0.043940773240238845, 0.2063353694910701, -0.19266383304137788, -0.24837786940366235, 0.35724064072969164, 0.0021561802520106235, -0.20508105660297182, 0.23350932846531375, 0.014106884951211719, -0.16033669941761117, 0.04908082224493329, 0.21398535662511778, 0.10870057404907937, -0.2275825121582279, 0.0465786969806585, -0.004147776040352053, 0.17126009956700727, 0.026013261022550676, -0.06308017416934793, 0.24758756812015134, 0.2964270475559816, -0.021953715981605153, 0.08046659659238584, -0.02932601516658906, -0.10081990525294612, -0.2235687832548542, -0.13468022831754448, -0.12731657811349983, -0.043073199464642026, -0.07933623276059937, -0.10765593542277606, 0.36153107102371806, 0.26034742482523954, 0.15944754221709445, 0.18989907584343907, 0.3733835410287914, 0.009743604205242364, 0.07860271668242705, 0.10954544495487223, 0.14185896324084346, 0.013692505525088765, 0.17020207527740341, -0.17166621629763135, 0.13349735929578957, 0.027374256652870424] |
1,802.01174 | A Method for Discovering and Extracting Author Contributions Information
from Scientific Biomedical Publications | Creating scientific publications is a complex process, typically composed of
a number of different activities, such as designing the experiments, data
preparation, programming software and writing and editing the manuscript. The
information about the contributions of individual authors of a paper is
important in the context of assessing authors' scientific achievements. Some
publications in biomedical disciplines contain a description of authors' roles
in the form of a short section written in natural language, typically entitled
"Authors' contributions". In this paper, we present an analysis of roles
commonly appearing in the content of these sections, and propose an algorithm
for automatic extraction of authors' roles from natural language text in
scientific publications. During the first part of the study, we used clustering
techniques, as well as Open Information Extraction (OpenIE), to
semi-automatically discover the most popular roles within a corpus of 2,000
contributions sections obtained from PubMed Central resources. The roles
discovered by our approach include: experimenting (1,743 instances, 17% of the
entire role set within the corpus), analysis (1,343, 16%), study design (1,132,
13%), interpretation (879, 10%), conceptualization (865, 10%), paper reading
(823, 10%), paper writing (724, 8%), paper review (501, 6%), paper drafting
(351, 4%), coordination (319, 4%), data collection (76, 1%), paper review (41,
0.5%) and literature review (41, 0.5%). Discovered roles were then used to
automatically build a training set for the supervised role extractor, based on
Naive Bayes algorithm. According to the evaluation we performed, the proposed
role extraction algorithm is able to extract the roles from the text with
precision 0.71, recall 0.49 and F1 0.58.
| cs.DL | creating scientific publications is a complex process typically composed of a number of different activities such as designing the experiments data preparation programming software and writing and editing the manuscript the information about the contributions of individual authors of a paper is important in the context of assessing authors scientific achievements some publications in biomedical disciplines contain a description of authors roles in the form of a short section written in natural language typically entitled authors contributions in this paper we present an analysis of roles commonly appearing in the content of these sections and propose an algorithm for automatic extraction of authors roles from natural language text in scientific publications during the first part of the study we used clustering techniques as well as open information extraction openie to semiautomatically discover the most popular roles within a corpus of 2000 contributions sections obtained from pubmed central resources the roles discovered by our approach include experimenting 1743 instances 17 of the entire role set within the corpus analysis 1343 16 study design 1132 13 interpretation 879 10 conceptualization 865 10 paper reading 823 10 paper writing 724 8 paper review 501 6 paper drafting 351 4 coordination 319 4 data collection 76 1 paper review 41 05 and literature review 41 05 discovered roles were then used to automatically build a training set for the supervised role extractor based on naive bayes algorithm according to the evaluation we performed the proposed role extraction algorithm is able to extract the roles from the text with precision 071 recall 049 and f1 058 | [['creating', 'scientific', 'publications', 'is', 'a', 'complex', 'process', 'typically', 'composed', 'of', 'a', 'number', 'of', 'different', 'activities', 'such', 'as', 'designing', 'the', 'experiments', 'data', 'preparation', 'programming', 'software', 'and', 'writing', 'and', 'editing', 'the', 'manuscript', 'the', 'information', 'about', 'the', 'contributions', 'of', 'individual', 'authors', 'of', 'a', 'paper', 'is', 'important', 'in', 'the', 'context', 'of', 'assessing', 'authors', 'scientific', 'achievements', 'some', 'publications', 'in', 'biomedical', 'disciplines', 'contain', 'a', 'description', 'of', 'authors', 'roles', 'in', 'the', 'form', 'of', 'a', 'short', 'section', 'written', 'in', 'natural', 'language', 'typically', 'entitled', 'authors', 'contributions', 'in', 'this', 'paper', 'we', 'present', 'an', 'analysis', 'of', 'roles', 'commonly', 'appearing', 'in', 'the', 'content', 'of', 'these', 'sections', 'and', 'propose', 'an', 'algorithm', 'for', 'automatic', 'extraction', 'of', 'authors', 'roles', 'from', 'natural', 'language', 'text', 'in', 'scientific', 'publications', 'during', 'the', 'first', 'part', 'of', 'the', 'study', 'we', 'used', 'clustering', 'techniques', 'as', 'well', 'as', 'open', 'information', 'extraction', 'openie', 'to', 'semiautomatically', 'discover', 'the', 'most', 'popular', 'roles', 'within', 'a', 'corpus', 'of', '2000', 'contributions', 'sections', 'obtained', 'from', 'pubmed', 'central', 'resources', 'the', 'roles', 'discovered', 'by', 'our', 'approach', 'include', 'experimenting', '1743', 'instances', '17', 'of', 'the', 'entire', 'role', 'set', 'within', 'the', 'corpus', 'analysis', '1343', '16', 'study', 'design', '1132', '13', 'interpretation', '879', '10', 'conceptualization', '865', '10', 'paper', 'reading', '823', '10', 'paper', 'writing', '724', '8', 'paper', 'review', '501', '6', 'paper', 'drafting', '351', '4', 'coordination', '319', '4', 'data', 'collection', '76', '1', 'paper', 'review', '41', '05', 'and', 'literature', 'review', '41', '05', 'discovered', 'roles', 'were', 'then', 'used', 'to', 'automatically', 'build', 'a', 'training', 'set', 'for', 'the', 'supervised', 'role', 'extractor', 'based', 'on', 'naive', 'bayes', 'algorithm', 'according', 'to', 'the', 'evaluation', 'we', 'performed', 'the', 'proposed', 'role', 'extraction', 'algorithm', 'is', 'able', 'to', 'extract', 'the', 'roles', 'from', 'the', 'text', 'with', 'precision', '071', 'recall', '049', 'and', 'f1', '058']] | [-0.0551982660879563, 0.029034836083169764, -0.02755005726808418, 0.0594701456244031, -0.09019445443313598, -0.06845478442590328, 0.05633527922249574, 0.3320546556635264, -0.20214584102306402, -0.4238430272709307, 0.08166923554002226, -0.32800019676065595, -0.14304718766468524, 0.19598568328281588, -0.07505382733754956, 0.016897109755086515, 0.081037475021424, 0.02027814802838582, -0.011050239269589555, -0.2875035170972404, 0.2856841970197642, 0.05545986358788207, 0.31150280338733444, 0.048183102220461, 0.0608256316268317, 0.014090600872226773, -0.1495855075799614, -0.04241055546304897, -0.1393372445977565, 0.17584274979762088, 0.3570020205459033, 0.19537332973628524, 0.3395898841768396, -0.34975023059195826, -0.1179883303504323, 0.025158793467428834, 0.1537078225693462, 0.07172013711098624, -0.03886980385500831, -0.2730537227968689, 0.06821885458470262, -0.18911301778358233, -0.03491134889124111, -0.05027049482653767, 0.06047796912806223, -0.02676870417691967, -0.20552566964660995, 0.04236592069882418, 0.08107478083227315, 0.15941831631089964, -0.05375641852909863, -0.19317845406610218, 0.06397042432318217, 0.16310608195376464, 0.026728220706269453, 0.09887423508682813, 0.15930705108604898, -0.10978723938890886, -0.1621834788854159, 0.37965415162658783, -0.038663650986201475, -0.13898508408253163, 0.16253365661995306, -0.04534908253842272, -0.21580805664461006, 0.08574464159457448, 0.21125937264800246, 0.10347213889585925, -0.20785829014862064, 0.019221810144738033, 0.00215870822588931, 0.22215245699401145, 0.11959072421715235, 0.014934148513658464, 0.1694429442554113, 0.211655022273147, -0.07058078340358204, 0.10231124139854764, -0.1047815939262545, -0.05676084846036038, -0.2934963919197377, -0.15533787534675664, -0.1165749438560186, 0.028227996985674245, -0.0435532824944422, -0.10389185452769542, 0.412968541507545, 0.19350654944613346, 0.17852240001115505, 0.005152375268717778, 0.247835090130539, -0.007647508742725762, 0.059132180480871675, 0.07953505716518539, 0.18076741473735453, 0.07069108654277478, 0.18537249340108414, -0.0932585001312967, 0.054585433512447955, 0.04152316516184987] |
1,802.01175 | Interaction-disorder-driven characteristic momentum in graphene,
approach of multi-body distribution functions | Multi-point probability measures along with the dielectric function of Dirac
Fermions in mono-layer graphene containing particle-particle and white-noise
(out-plane) disorder interactions on an equal footing in the Thomas-Fermi-Dirac
approximation is investigated. By calculating the one-body carrier density
probability measure of the graphene sheet, we show that the density fluctuation
($\zeta^{-1}$) is related to the disorder strength ($n_i$), the interaction
parameter ($r_s$) and the average density ($\bar{n}$) via the relation
$\zeta^{-1}\propto r_sn_i^2\bar{n}^{-1}$ for which $\bar{n}\rightarrow 0$ leads
to strong density inhomogeneities, i.e. electron-hole puddles (EHPs), in
agreement with the previous works. The general equation governing the two-body
distribution probability is obtained and analyzed. We present the analytical
solution for some limits which is used for calculating density-density response
function. We show that the resulting function shows power-law behaviors in
terms of $\zeta$ with fractional exponents which are reported. The
disorder-averaged polarization operator is shown to be a decreasing function of
momentum like ordinary 2D parabolic band systems. It is seen that a
disorder-driven momentum $q_{\text{ch}}$ emerges in the system which controls
the behaviors of the screened potential. We show that in small densities an
instability occurs in which imaginary part of the dielectric function becomes
negative and the screened potential changes sign. Corresponding to this
instability, some oscillations in charge density along with a
screening-anti-screening transition are observed. These effects become dominant
in very low densities, strong disorders and strong interactions, the state in
which EHPs appear. The total charge probability measure is another quantity
which has been investigated in this paper.
| cond-mat.stat-mech | multipoint probability measures along with the dielectric function of dirac fermions in monolayer graphene containing particleparticle and whitenoise outplane disorder interactions on an equal footing in the thomasfermidirac approximation is investigated by calculating the onebody carrier density probability measure of the graphene sheet we show that the density fluctuation zeta1 is related to the disorder strength n_i the interaction parameter r_s and the average density barn via the relation zeta1propto r_sn_i2barn1 for which barnrightarrow 0 leads to strong density inhomogeneities ie electronhole puddles ehps in agreement with the previous works the general equation governing the twobody distribution probability is obtained and analyzed we present the analytical solution for some limits which is used for calculating densitydensity response function we show that the resulting function shows powerlaw behaviors in terms of zeta with fractional exponents which are reported the disorderaveraged polarization operator is shown to be a decreasing function of momentum like ordinary 2d parabolic band systems it is seen that a disorderdriven momentum q_textch emerges in the system which controls the behaviors of the screened potential we show that in small densities an instability occurs in which imaginary part of the dielectric function becomes negative and the screened potential changes sign corresponding to this instability some oscillations in charge density along with a screeningantiscreening transition are observed these effects become dominant in very low densities strong disorders and strong interactions the state in which ehps appear the total charge probability measure is another quantity which has been investigated in this paper | [['multipoint', 'probability', 'measures', 'along', 'with', 'the', 'dielectric', 'function', 'of', 'dirac', 'fermions', 'in', 'monolayer', 'graphene', 'containing', 'particleparticle', 'and', 'whitenoise', 'outplane', 'disorder', 'interactions', 'on', 'an', 'equal', 'footing', 'in', 'the', 'thomasfermidirac', 'approximation', 'is', 'investigated', 'by', 'calculating', 'the', 'onebody', 'carrier', 'density', 'probability', 'measure', 'of', 'the', 'graphene', 'sheet', 'we', 'show', 'that', 'the', 'density', 'fluctuation', 'zeta1', 'is', 'related', 'to', 'the', 'disorder', 'strength', 'n_i', 'the', 'interaction', 'parameter', 'r_s', 'and', 'the', 'average', 'density', 'barn', 'via', 'the', 'relation', 'zeta1propto', 'r_sn_i2barn1', 'for', 'which', 'barnrightarrow', '0', 'leads', 'to', 'strong', 'density', 'inhomogeneities', 'ie', 'electronhole', 'puddles', 'ehps', 'in', 'agreement', 'with', 'the', 'previous', 'works', 'the', 'general', 'equation', 'governing', 'the', 'twobody', 'distribution', 'probability', 'is', 'obtained', 'and', 'analyzed', 'we', 'present', 'the', 'analytical', 'solution', 'for', 'some', 'limits', 'which', 'is', 'used', 'for', 'calculating', 'densitydensity', 'response', 'function', 'we', 'show', 'that', 'the', 'resulting', 'function', 'shows', 'powerlaw', 'behaviors', 'in', 'terms', 'of', 'zeta', 'with', 'fractional', 'exponents', 'which', 'are', 'reported', 'the', 'disorderaveraged', 'polarization', 'operator', 'is', 'shown', 'to', 'be', 'a', 'decreasing', 'function', 'of', 'momentum', 'like', 'ordinary', '2d', 'parabolic', 'band', 'systems', 'it', 'is', 'seen', 'that', 'a', 'disorderdriven', 'momentum', 'q_textch', 'emerges', 'in', 'the', 'system', 'which', 'controls', 'the', 'behaviors', 'of', 'the', 'screened', 'potential', 'we', 'show', 'that', 'in', 'small', 'densities', 'an', 'instability', 'occurs', 'in', 'which', 'imaginary', 'part', 'of', 'the', 'dielectric', 'function', 'becomes', 'negative', 'and', 'the', 'screened', 'potential', 'changes', 'sign', 'corresponding', 'to', 'this', 'instability', 'some', 'oscillations', 'in', 'charge', 'density', 'along', 'with', 'a', 'screeningantiscreening', 'transition', 'are', 'observed', 'these', 'effects', 'become', 'dominant', 'in', 'very', 'low', 'densities', 'strong', 'disorders', 'and', 'strong', 'interactions', 'the', 'state', 'in', 'which', 'ehps', 'appear', 'the', 'total', 'charge', 'probability', 'measure', 'is', 'another', 'quantity', 'which', 'has', 'been', 'investigated', 'in', 'this', 'paper']] | [-0.18563393191157718, 0.17566859923538344, -0.08478303746817457, 0.07952379170074281, 0.015538078752827266, -0.12067644055894591, 0.020220039712959808, 0.34535309558469024, -0.23153288189138546, -0.25112298269542394, -0.009218372537689588, -0.3262610085400157, -0.16692876005659765, 0.1257099153447255, 0.03470798093228235, 0.04247286530177216, -0.03063482527819569, 0.021438080576042354, -0.09081413251057756, -0.1818184832341923, 0.30859159756467114, 0.03971224684329307, 0.2988298438569592, 0.11691506192866774, 0.039527289283110716, 0.018983986897570714, 0.030283063379131624, 0.05053593867771389, -0.14299637338865337, 0.028689565344840778, 0.22211218766937774, -0.030321861706009957, 0.24572658248734278, -0.4010003326903479, -0.2220863658003509, 0.07423685866953866, 0.15097986710864714, 0.10686833594904709, -0.05478581585243848, -0.2732483528794904, 0.03674128036335355, -0.17221990859681802, -0.16949761421305173, -0.04753685941667769, 0.06311000016571373, 0.0508874401786044, -0.2982171043504572, 0.16875211378467864, 0.012512621381052877, 0.005981274012125052, -0.09516374778825996, -0.12995683441232492, -0.05676402761524574, 0.0858908087305236, 0.09946736929361846, 0.06267193855133793, 0.15123155822471207, -0.1546254655810027, -0.03709002843672471, 0.34528242157901956, -0.09207818685929657, -0.2047240740837163, 0.16124573630494538, -0.21348748829971512, -0.0634169833463632, 0.14972208998620234, 0.11483505283831619, 0.09139336009612918, -0.1360740102593764, 0.09808180245108516, -0.004150792472083579, 0.1622215332358419, 0.0492003010700411, 0.06396899902216825, 0.19708680025813338, 0.1243826375728412, 0.06188977331487981, 0.12899014117390864, -0.0853413304010574, -0.10126904221194354, -0.2714119284503452, -0.1414759429877807, -0.22662689206553013, 0.05731480251081654, -0.07986018192193606, -0.2097925035053717, 0.3962052841728065, 0.14715448176520723, 0.21243271155122545, 0.042897835359088005, 0.24773487132844194, 0.23312673889879199, 0.06502840820591149, 0.04467098953211432, 0.23737562745050947, 0.15054154167615916, 0.08081072727199186, -0.26271024024873574, 0.07600059788115895, 0.0501768067894221] |
1,802.01176 | Valuation of Crypto-Currency Mining Operations | Traditionally, the Net Present Value method is used to compare diverging
investment strategies. However, valuating crypto-projects with fiat-based
currency is confusing due to extreme coin appreciation rates as compared to
fiat interest rates. Here, we provide a net present value method based on using
crypto-coin as the underlying asset. Using this method, we compare HODL vs.
mining, we also provide a sensitivity analysis of profitability
| cs.CY | traditionally the net present value method is used to compare diverging investment strategies however valuating cryptoprojects with fiatbased currency is confusing due to extreme coin appreciation rates as compared to fiat interest rates here we provide a net present value method based on using cryptocoin as the underlying asset using this method we compare hodl vs mining we also provide a sensitivity analysis of profitability | [['traditionally', 'the', 'net', 'present', 'value', 'method', 'is', 'used', 'to', 'compare', 'diverging', 'investment', 'strategies', 'however', 'valuating', 'cryptoprojects', 'with', 'fiatbased', 'currency', 'is', 'confusing', 'due', 'to', 'extreme', 'coin', 'appreciation', 'rates', 'as', 'compared', 'to', 'fiat', 'interest', 'rates', 'here', 'we', 'provide', 'a', 'net', 'present', 'value', 'method', 'based', 'on', 'using', 'cryptocoin', 'as', 'the', 'underlying', 'asset', 'using', 'this', 'method', 'we', 'compare', 'hodl', 'vs', 'mining', 'we', 'also', 'provide', 'a', 'sensitivity', 'analysis', 'of', 'profitability']] | [-0.006338321397722256, -0.010900448534454479, -0.12391881052343572, 0.10016782097251262, -0.11016075358894027, -0.13972550433617634, 0.138906886824025, 0.43109863199537896, -0.2125999157118504, -0.2918824726013375, 0.18185741348253165, -0.2692818423336158, -0.1499887776358786, 0.2231702077523118, -0.14337819261232115, 0.019315281134770542, 0.036879025048530495, 0.01879425436262133, -0.011530180356740097, -0.2470946530582475, 0.28366279082952955, 0.10349027097958033, 0.3461824751642273, 0.049014007999966316, 0.11750448019361623, -0.017643157224796834, -0.07045993334079376, 0.04223940138644004, -0.1535292963924833, 0.16273260394447162, 0.2488064071789506, 0.156148870300013, 0.3473232114290605, -0.40394650637859203, -0.10620639154107356, 0.15080095360391452, 0.0893929288493561, 0.11363909689740079, -0.07879794444926999, -0.20511520021885146, 0.060137172519672114, -0.2561012305868942, -0.09353592747738432, -0.14650867190822714, 0.0011406844986610299, 0.03824937523564049, -0.2904756662634308, 0.1070429530470884, -0.03106679565838126, 0.08752448530104316, -0.051899585892927265, -0.16472841096950358, 0.017422842942025573, 0.1434927448157038, 0.1277214192449436, -0.0010004722223174378, 0.13826738900245458, -0.1037935027356458, -0.2119639405034116, 0.38063251211872845, -0.09365219409104253, -0.1964358409378128, 0.15672980870700395, -0.08214683777301526, -0.08732715486472503, 0.06738879954533987, 0.21510178527840582, 0.10586093824936962, -0.16075641129043747, -0.0077694967526515, 0.005022520955163436, 0.1861844979776222, 0.035960355025456574, 0.04041343475462961, 0.1799292612332301, 0.22147998945848618, 0.10015686335744428, 0.16803703043365575, -0.10291502201456393, -0.1296370827944064, -0.2468591994476184, -0.10811335187344277, -0.1476874605153275, 0.07639932670806092, -0.06207563657863218, -0.13060616083504234, 0.32656449891748973, 0.2694623730924042, 0.1899811209286334, 0.07284558526255556, 0.32046230173990375, 0.13889651297645064, 0.04650985144200872, 0.04923027791998914, 0.204770719976027, 0.05072644862277647, 0.1498405660777429, -0.18428289748300783, 0.18644165555320558, 0.07241457615230905] |
1,802.01177 | A Scheme-Driven Approach to Learning Programs from Input/Output
Equations | We describe an approach to learn, in a term-rewriting setting, function
definitions from input/output equations. By confining ourselves to structurally
recursive definitions we obtain a fairly fast learning algorithm that often
yields definitions close to intuitive expectations. We provide a Prolog
prototype implementation of our approach, and indicate open issues of further
investigation.
| cs.LO cs.AI cs.PL | we describe an approach to learn in a termrewriting setting function definitions from inputoutput equations by confining ourselves to structurally recursive definitions we obtain a fairly fast learning algorithm that often yields definitions close to intuitive expectations we provide a prolog prototype implementation of our approach and indicate open issues of further investigation | [['we', 'describe', 'an', 'approach', 'to', 'learn', 'in', 'a', 'termrewriting', 'setting', 'function', 'definitions', 'from', 'inputoutput', 'equations', 'by', 'confining', 'ourselves', 'to', 'structurally', 'recursive', 'definitions', 'we', 'obtain', 'a', 'fairly', 'fast', 'learning', 'algorithm', 'that', 'often', 'yields', 'definitions', 'close', 'to', 'intuitive', 'expectations', 'we', 'provide', 'a', 'prolog', 'prototype', 'implementation', 'of', 'our', 'approach', 'and', 'indicate', 'open', 'issues', 'of', 'further', 'investigation']] | [-0.055905411670089895, -0.005948772150660724, -0.16632462208563425, 0.11962613615400668, -0.13970161689761676, -0.19295557737701907, 0.09677028420539398, 0.4338755136672056, -0.25232313867693523, -0.32381469232715526, 0.02953516579241896, -0.22232200720189316, -0.19740207844747687, 0.21851548959747097, -0.11857894592795451, 0.04379974825764602, 0.08460748859874483, -0.02287497989040413, -0.12069558835026088, -0.23296656083526476, 0.2862105094036966, 0.0019217110326829945, 0.2554402250339681, 0.034516082971163514, 0.1136066422727451, -0.016578271062517504, -0.032946855928045964, -0.00048589912893356015, -0.15528578733443832, 0.16048305488701137, 0.3263563073046927, 0.212507825634741, 0.31163685481538467, -0.40542385797455627, -0.12943594040154735, -0.010440980066668312, 0.11379307250158405, 0.1405593293086397, -0.04503204893180222, -0.29153004494267254, 0.07403383677263024, -0.1929502274559916, -0.1669327483934192, -0.2000298380922034, -0.028122050107790612, -0.008229887253552113, -0.2761519236121116, -0.025275371125284232, 0.1056774587036585, 0.048059170600026846, -0.07973317512890922, -0.06823158344991927, 0.09559538488206014, 0.04505525755186407, 0.021192662835226587, 0.03095347144342256, 0.13649160259420862, -0.08276658898816919, -0.14406946002734158, 0.32914472441628295, -0.027188905760786444, -0.23728026121960216, 0.21273999951147246, -0.04397863373687526, -0.15538195549633424, 0.07613737396193, 0.1896582531241946, 0.11175713198751493, -0.20580264491293765, 0.051032780756391935, -0.06877831427626452, 0.1760428640530181, 0.023164666235833516, 0.02236658365483273, 0.15700873246697603, 0.21014860989350193, 0.029855930760397383, 0.19991936842155345, 0.08403688984624338, -0.14078913586881925, -0.30825279022233104, -0.11112437952520712, -0.0897035896250943, 0.029277518330106757, -0.06697501139336415, -0.21000379898046134, 0.33763345808915374, 0.26472619295401395, 0.21133713715903038, 0.1250068056572861, 0.33374734245732707, 0.0815756709494997, 0.05642693616309256, 0.11622131805656091, 0.14994968357935268, 0.12143482722096005, 0.11823605162636289, -0.1499068250413984, 0.04988888311990589, 0.08639817198141003] |
1,802.01178 | Smoothly bounded domains covering finite volume manifolds | In this paper we prove: if a bounded domain with $C^2$ boundary covers a
manifold which has finite volume with respect to either the Bergman volume, the
K\"ahler-Einstein volume, or the Kobayashi-Eisenman volume, then the domain is
biholomorphic to the unit ball. This answers an old question of Yau. Further,
when the domain is convex we can assume that the boundary only has
$C^{1,\epsilon}$ regularity.
| math.CV math.DG | in this paper we prove if a bounded domain with c2 boundary covers a manifold which has finite volume with respect to either the bergman volume the kahlereinstein volume or the kobayashieisenman volume then the domain is biholomorphic to the unit ball this answers an old question of yau further when the domain is convex we can assume that the boundary only has c1epsilon regularity | [['in', 'this', 'paper', 'we', 'prove', 'if', 'a', 'bounded', 'domain', 'with', 'c2', 'boundary', 'covers', 'a', 'manifold', 'which', 'has', 'finite', 'volume', 'with', 'respect', 'to', 'either', 'the', 'bergman', 'volume', 'the', 'kahlereinstein', 'volume', 'or', 'the', 'kobayashieisenman', 'volume', 'then', 'the', 'domain', 'is', 'biholomorphic', 'to', 'the', 'unit', 'ball', 'this', 'answers', 'an', 'old', 'question', 'of', 'yau', 'further', 'when', 'the', 'domain', 'is', 'convex', 'we', 'can', 'assume', 'that', 'the', 'boundary', 'only', 'has', 'c1epsilon', 'regularity']] | [-0.11762372292287182, 0.06185738225235582, -0.053331986055127345, -0.0066263983098906465, -0.13939995087275747, -0.09536866248527076, 0.024342608887309325, 0.37410672270925716, -0.31949813329265453, -0.1594370182547209, 0.2084744820222113, -0.2886000017042534, -0.09097861270493013, 0.12276602426936734, -0.2457121372135589, 0.02780110410094494, 0.07100912905298173, 0.11022486101137474, -0.08643504707652028, -0.31925828562816605, 0.44462256459519267, -0.08784510484110797, 0.1904756574658677, 0.18091094285045983, 0.10082646735827439, -0.07936398036690662, 0.039465232723159716, 0.07139456897857599, -0.19157568252251167, 0.12455448829587112, 0.23040185903664678, 0.10590100487388554, 0.30799794555059634, -0.3828639382554684, -0.23357480476261117, 0.21007863414706662, 0.14786784406169318, 0.005745709326220094, -0.029361470458752592, -0.2557995713723358, 0.14019188415113604, -0.04995007094112225, -0.1734849711356219, -0.03382420289244692, 0.028404856158886105, -0.02412118757274584, -0.26300989143783227, 0.026786529888340738, 0.11926427898288239, 0.03136409379658289, -0.11130978230357869, -0.042214283857902046, -0.02856308971240651, 0.07708629982744242, 0.04013255837344332, 0.1976152236238704, 0.08188373129087267, -0.04869554875040194, -0.035279278752568644, 0.33466988732106984, -0.04790607370159705, -0.35076417366508394, 0.17417181939526927, -0.23895795113639906, -0.07323338857349881, 0.11026499076979235, 0.11452566777734319, 0.16049717566784238, -0.10516821262467602, 0.2257865975407185, -0.1271099721743667, 0.19331439472807688, 0.13247220938501414, -0.09094170335811214, 0.1048941267945338, 0.15844286481660674, 0.2010545299272053, 0.15781799721617062, -0.054026139951020014, -0.03328094177413732, -0.3573857994633727, -0.2070937208882242, -0.22188311675563455, 0.12331086491030874, -0.09875870480027515, -0.21695400607131887, 0.3482977694366127, -0.0009856890901573934, 0.21111159553402103, 0.10706943666627922, 0.24844763116561808, 0.05158496386138722, 0.03298042539972812, 0.13648168825602625, 0.13728209256078117, 0.11180864322523121, 0.08251857852155808, -0.17358249733661069, -0.003997841165983118, 0.1457815160035807] |
1,802.01179 | Percolation transition in two dimensional electron gas: A quantum
cellular automaton model | A new type of disorder-driven electronic percolation transition is found for
two-dimensional electron gas (2DEG), based on a quantum cellular automaton
model. This transition is shown to be accompanied with a metal-insulator
transition, as well as a singularity in the electronic compressibility. To this
end, the electronic system which is assumed to be in contact with an electronic
reservoir, is meshed by using of the phase coherence length $\zeta_{\phi}$ as
an extent which divides the spatial dynamics of the electrons into two separate
regimes and controls the localization of electrons. For the scales much smaller
than $\zeta_{\phi}$ the treatment is quantum mechanical, whereas for the scales
much larger than $\zeta_{\phi}$ the picture of semi-classical transport works
and the classical Mote Carlo method is used. Thomas-Fermi-Dirac (TFD) theory is
employed to find the dependence of the free energy of each cell on the
temperature ($T$), the (charged) disorder strength ($\Delta$) and the charge
content of the cell, and a cellular automaton model for transporting the
electrons between the cells is developed. At the transition line (in the
$T-\Delta$ space) the geometrical (e.g. correlation length) quantities also
diverge and some power-law behaviors emerge with some critical exponents in
agreement with the Gaussian free field (GFF) and the percolation theory. In the
percolating side the spanning cluster probability (SCP) (as a realization of
the conductivity) has a decreasing behavior in terms of the temperature which
is the characteristics of the metallic phase. Our simple model yields the
important features of the experimental observations, e.g. the singularity in
the conductivity in some critical density and also the universality
(non-universality) of the metal-insulator transition (MIT) for the small
(large) disorders in 2DEG.
| cond-mat.stat-mech | a new type of disorderdriven electronic percolation transition is found for twodimensional electron gas 2deg based on a quantum cellular automaton model this transition is shown to be accompanied with a metalinsulator transition as well as a singularity in the electronic compressibility to this end the electronic system which is assumed to be in contact with an electronic reservoir is meshed by using of the phase coherence length zeta_phi as an extent which divides the spatial dynamics of the electrons into two separate regimes and controls the localization of electrons for the scales much smaller than zeta_phi the treatment is quantum mechanical whereas for the scales much larger than zeta_phi the picture of semiclassical transport works and the classical mote carlo method is used thomasfermidirac tfd theory is employed to find the dependence of the free energy of each cell on the temperature t the charged disorder strength delta and the charge content of the cell and a cellular automaton model for transporting the electrons between the cells is developed at the transition line in the tdelta space the geometrical eg correlation length quantities also diverge and some powerlaw behaviors emerge with some critical exponents in agreement with the gaussian free field gff and the percolation theory in the percolating side the spanning cluster probability scp as a realization of the conductivity has a decreasing behavior in terms of the temperature which is the characteristics of the metallic phase our simple model yields the important features of the experimental observations eg the singularity in the conductivity in some critical density and also the universality nonuniversality of the metalinsulator transition mit for the small large disorders in 2deg | [['a', 'new', 'type', 'of', 'disorderdriven', 'electronic', 'percolation', 'transition', 'is', 'found', 'for', 'twodimensional', 'electron', 'gas', '2deg', 'based', 'on', 'a', 'quantum', 'cellular', 'automaton', 'model', 'this', 'transition', 'is', 'shown', 'to', 'be', 'accompanied', 'with', 'a', 'metalinsulator', 'transition', 'as', 'well', 'as', 'a', 'singularity', 'in', 'the', 'electronic', 'compressibility', 'to', 'this', 'end', 'the', 'electronic', 'system', 'which', 'is', 'assumed', 'to', 'be', 'in', 'contact', 'with', 'an', 'electronic', 'reservoir', 'is', 'meshed', 'by', 'using', 'of', 'the', 'phase', 'coherence', 'length', 'zeta_phi', 'as', 'an', 'extent', 'which', 'divides', 'the', 'spatial', 'dynamics', 'of', 'the', 'electrons', 'into', 'two', 'separate', 'regimes', 'and', 'controls', 'the', 'localization', 'of', 'electrons', 'for', 'the', 'scales', 'much', 'smaller', 'than', 'zeta_phi', 'the', 'treatment', 'is', 'quantum', 'mechanical', 'whereas', 'for', 'the', 'scales', 'much', 'larger', 'than', 'zeta_phi', 'the', 'picture', 'of', 'semiclassical', 'transport', 'works', 'and', 'the', 'classical', 'mote', 'carlo', 'method', 'is', 'used', 'thomasfermidirac', 'tfd', 'theory', 'is', 'employed', 'to', 'find', 'the', 'dependence', 'of', 'the', 'free', 'energy', 'of', 'each', 'cell', 'on', 'the', 'temperature', 't', 'the', 'charged', 'disorder', 'strength', 'delta', 'and', 'the', 'charge', 'content', 'of', 'the', 'cell', 'and', 'a', 'cellular', 'automaton', 'model', 'for', 'transporting', 'the', 'electrons', 'between', 'the', 'cells', 'is', 'developed', 'at', 'the', 'transition', 'line', 'in', 'the', 'tdelta', 'space', 'the', 'geometrical', 'eg', 'correlation', 'length', 'quantities', 'also', 'diverge', 'and', 'some', 'powerlaw', 'behaviors', 'emerge', 'with', 'some', 'critical', 'exponents', 'in', 'agreement', 'with', 'the', 'gaussian', 'free', 'field', 'gff', 'and', 'the', 'percolation', 'theory', 'in', 'the', 'percolating', 'side', 'the', 'spanning', 'cluster', 'probability', 'scp', 'as', 'a', 'realization', 'of', 'the', 'conductivity', 'has', 'a', 'decreasing', 'behavior', 'in', 'terms', 'of', 'the', 'temperature', 'which', 'is', 'the', 'characteristics', 'of', 'the', 'metallic', 'phase', 'our', 'simple', 'model', 'yields', 'the', 'important', 'features', 'of', 'the', 'experimental', 'observations', 'eg', 'the', 'singularity', 'in', 'the', 'conductivity', 'in', 'some', 'critical', 'density', 'and', 'also', 'the', 'universality', 'nonuniversality', 'of', 'the', 'metalinsulator', 'transition', 'mit', 'for', 'the', 'small', 'large', 'disorders', 'in', '2deg']] | [-0.1143147222527945, 0.1995410772843416, -0.0677372217653252, 0.056182591358472055, 0.008777522091125055, -0.15350154368543076, 0.059552280409665044, 0.3234188006808376, -0.24902981669273874, -0.2441261644569303, 0.046236556300738765, -0.30960768169054376, -0.1400044127577573, 0.1686901138046427, 0.019339177162396564, 0.03674192699979985, -0.03411595723364798, 0.04412336757285554, -0.07901580403441234, -0.17202365029576344, 0.29783609114244364, 0.07040369298581424, 0.31149579770863056, 0.09653089876456475, 0.04585583978971392, -0.018301085871599666, 0.07357084559317047, 0.05428156969950716, -0.15689678478898608, 0.05124207935295999, 0.21764637413014412, 0.002880463070263044, 0.23049507758980248, -0.41342237677478944, -0.26394576887601806, 0.054280989044362724, 0.14503727888212278, 0.12005696409097823, -0.02549250519814286, -0.2675837865670881, 0.036406278485829, -0.14473666533800883, -0.12001493701077527, -0.003610249576184038, 0.018864407141471033, 0.009774736963407497, -0.25307301741172405, 0.11238560958371233, 0.03293549139783902, 0.06966325858715477, -0.07064041362937526, -0.09148818967041865, -0.031331586878661014, 0.1372905875882302, 0.01969516518843505, 0.05384817263254365, 0.17027773919754027, -0.14139845194496778, -0.08750500768025503, 0.3951979472406128, -0.024112566069650232, -0.14943388569595742, 0.1950213776587001, -0.18477535037918938, -0.0861764715779371, 0.16216551636544052, 0.10167993545920558, 0.06815191320167176, -0.12612300259582296, 0.0758543727620646, -0.016456832572992637, 0.17209350132124518, 0.014082847406838883, 0.055340359864741964, 0.20153217323608563, 0.205808449287761, 0.05217805288947231, 0.14587415088664082, -0.10452689090575552, -0.13141027980716058, -0.265369634035578, -0.17366421126024226, -0.215689783334221, 0.05798886500514156, -0.11921887909822268, -0.22122036492893732, 0.41319360649414927, 0.15521502827184058, 0.21683405685685708, 0.024458999350071894, 0.2468144846996057, 0.14376221197558103, 0.07289516411567046, 0.051746956899422575, 0.19657141421591637, 0.1400177316775458, 0.11838500218681103, -0.26582516595933064, 0.07053855511348103, 0.07583551092530577] |
1,802.0118 | Channel Model of Molecular Communication via Diffusion in a Vessel-like
Environment Considering a Partially Covering Receiver | By considering potential health problems that a fully covering receiver may
cause in vessel-like environments, the implementation of a partially covering
receiver is needed. To this end, distribution of hitting location of messenger
molecules (MM) is analyzed within the context of molecular communication via
diffusion with the aim of channel modeling. The distribution of these MMs for a
fully covering receiver is analyzed in two parts: angular and radial
dimensions. For the angular distribution analysis, the receiver is divided into
180 slices to analyze the mean, standard deviation, and coefficient of
variation of these slices. For the axial distance distribution analysis,
Kolmogorov- Smirnov test is applied for different significance levels. Also,
two different implementations of the reflection from the vessel surface (i.e.,
rollback and elastic reflection) are compared and mathematical representation
of elastic reflection is given. The results show that MMs have tendency to
spread uniformly beyond a certain ratio of the distance to the vessel radius.
By utilizing the uniformity, we propose a channel model for the partially
covering receiver in vessel-like environments and validate the proposed model
by simulations.
| cs.ET | by considering potential health problems that a fully covering receiver may cause in vessellike environments the implementation of a partially covering receiver is needed to this end distribution of hitting location of messenger molecules mm is analyzed within the context of molecular communication via diffusion with the aim of channel modeling the distribution of these mms for a fully covering receiver is analyzed in two parts angular and radial dimensions for the angular distribution analysis the receiver is divided into 180 slices to analyze the mean standard deviation and coefficient of variation of these slices for the axial distance distribution analysis kolmogorov smirnov test is applied for different significance levels also two different implementations of the reflection from the vessel surface ie rollback and elastic reflection are compared and mathematical representation of elastic reflection is given the results show that mms have tendency to spread uniformly beyond a certain ratio of the distance to the vessel radius by utilizing the uniformity we propose a channel model for the partially covering receiver in vessellike environments and validate the proposed model by simulations | [['by', 'considering', 'potential', 'health', 'problems', 'that', 'a', 'fully', 'covering', 'receiver', 'may', 'cause', 'in', 'vessellike', 'environments', 'the', 'implementation', 'of', 'a', 'partially', 'covering', 'receiver', 'is', 'needed', 'to', 'this', 'end', 'distribution', 'of', 'hitting', 'location', 'of', 'messenger', 'molecules', 'mm', 'is', 'analyzed', 'within', 'the', 'context', 'of', 'molecular', 'communication', 'via', 'diffusion', 'with', 'the', 'aim', 'of', 'channel', 'modeling', 'the', 'distribution', 'of', 'these', 'mms', 'for', 'a', 'fully', 'covering', 'receiver', 'is', 'analyzed', 'in', 'two', 'parts', 'angular', 'and', 'radial', 'dimensions', 'for', 'the', 'angular', 'distribution', 'analysis', 'the', 'receiver', 'is', 'divided', 'into', '180', 'slices', 'to', 'analyze', 'the', 'mean', 'standard', 'deviation', 'and', 'coefficient', 'of', 'variation', 'of', 'these', 'slices', 'for', 'the', 'axial', 'distance', 'distribution', 'analysis', 'kolmogorov', 'smirnov', 'test', 'is', 'applied', 'for', 'different', 'significance', 'levels', 'also', 'two', 'different', 'implementations', 'of', 'the', 'reflection', 'from', 'the', 'vessel', 'surface', 'ie', 'rollback', 'and', 'elastic', 'reflection', 'are', 'compared', 'and', 'mathematical', 'representation', 'of', 'elastic', 'reflection', 'is', 'given', 'the', 'results', 'show', 'that', 'mms', 'have', 'tendency', 'to', 'spread', 'uniformly', 'beyond', 'a', 'certain', 'ratio', 'of', 'the', 'distance', 'to', 'the', 'vessel', 'radius', 'by', 'utilizing', 'the', 'uniformity', 'we', 'propose', 'a', 'channel', 'model', 'for', 'the', 'partially', 'covering', 'receiver', 'in', 'vessellike', 'environments', 'and', 'validate', 'the', 'proposed', 'model', 'by', 'simulations']] | [-0.13246951026595016, 0.07992603234401312, -0.0831744536983868, 0.04099868342874685, -0.017828452493480886, -0.12894078421030833, 0.028855486456510607, 0.3971985762125879, -0.26704995318583485, -0.3154965800372112, 0.12155919340477732, -0.24488830232725206, -0.0914536807583182, 0.14404969992507147, -0.0529184096514695, 0.05677091618691113, 0.027626066495026386, -0.005876043214570752, -0.041422266819262206, -0.18254912276597932, 0.2985207553224854, 0.06905660278662958, 0.29397661028460736, 0.03670633124195307, 0.11628547750763307, 0.0066496896794199616, -0.043747071021118134, 0.027726390023422504, -0.1114771158505361, 0.12335460902402662, 0.23265724060207976, 0.12554717910841354, 0.2268969917988909, -0.38618768894246097, -0.23720692048744602, 0.049917687528164674, 0.13665484873357986, 0.06056557283916855, -0.030458298131041433, -0.2685884515174731, 0.0923487131113382, -0.14954172617122943, -0.11235762386227757, 0.023611951726154316, 0.0007046768647613447, 0.03689034696339079, -0.2508437877111857, 0.08985898399694041, 0.008909620311836718, 0.07447357398061627, -0.0731379492645723, -0.1397192262457838, -0.009815502994776142, 0.1628543364034595, 0.02564570790340671, -0.009804977847582233, 0.12470541514445982, -0.1112490357440068, -0.06862690530521846, 0.3878004874375479, -0.04618525700334933, -0.21391183245047227, 0.17564356920903662, -0.16234160601856054, -0.06506124535030093, 0.16856719935775955, 0.2132095859195646, 0.06165752818200799, -0.17818818668235423, 0.04444669774773361, -0.02208847912524966, 0.17986013213409244, 0.09853155826969659, 0.0008083098820148252, 0.18722562075628596, 0.15965933136600816, 0.05748584614011835, 0.1523833865523647, -0.17880525380805218, -0.10650093127067782, -0.2961634761803058, -0.15437978285863913, -0.18176527283712707, 0.005061582606851808, -0.09572685669516844, -0.10501767156159413, 0.3887726906841384, 0.13941992035467507, 0.18800610181417585, 0.08666273827525628, 0.31629978093313493, 0.07379609161668885, 0.06830309700344314, 0.08165791229401505, 0.2200581236724428, 0.14969836088483998, 0.07714114125653361, -0.19626698820872324, 0.07540996902292975, 0.012088581472017818] |
1,802.01181 | Effects of unconventional breakup modes on incomplete fusion of weakly
bound nuclei | The incomplete fusion dynamics of $^6$Li + $^{209}$Bi collisions at energies
above the Coulomb barrier is investigated. The classical dynamical model
implemented in the {\sc platypus} code is used to understand and quantify the
impact of both $^6$Li resonance states and transfer-triggered breakup modes
(involving short-lived projectile-like nuclei such as $^8$Be and $^5$Li) on the
formation of incomplete fusion products. Model calculations explain the
experimental incomplete-fusion excitation function fairly well, indicating that
(i) delayed direct breakup of $^6$Li reduces the incomplete fusion
cross-sections, and (ii) the neutron-stripping channel practically determines
those cross-sections.
| nucl-th | the incomplete fusion dynamics of 6li 209bi collisions at energies above the coulomb barrier is investigated the classical dynamical model implemented in the sc platypus code is used to understand and quantify the impact of both 6li resonance states and transfertriggered breakup modes involving shortlived projectilelike nuclei such as 8be and 5li on the formation of incomplete fusion products model calculations explain the experimental incompletefusion excitation function fairly well indicating that i delayed direct breakup of 6li reduces the incomplete fusion crosssections and ii the neutronstripping channel practically determines those crosssections | [['the', 'incomplete', 'fusion', 'dynamics', 'of', '6li', '209bi', 'collisions', 'at', 'energies', 'above', 'the', 'coulomb', 'barrier', 'is', 'investigated', 'the', 'classical', 'dynamical', 'model', 'implemented', 'in', 'the', 'sc', 'platypus', 'code', 'is', 'used', 'to', 'understand', 'and', 'quantify', 'the', 'impact', 'of', 'both', '6li', 'resonance', 'states', 'and', 'transfertriggered', 'breakup', 'modes', 'involving', 'shortlived', 'projectilelike', 'nuclei', 'such', 'as', '8be', 'and', '5li', 'on', 'the', 'formation', 'of', 'incomplete', 'fusion', 'products', 'model', 'calculations', 'explain', 'the', 'experimental', 'incompletefusion', 'excitation', 'function', 'fairly', 'well', 'indicating', 'that', 'i', 'delayed', 'direct', 'breakup', 'of', '6li', 'reduces', 'the', 'incomplete', 'fusion', 'crosssections', 'and', 'ii', 'the', 'neutronstripping', 'channel', 'practically', 'determines', 'those', 'crosssections']] | [-0.0448571715705012, 0.1706865728060207, -0.05773682240661318, 0.1730119056750978, 0.058631501165853646, -0.1320650539141339, 0.03643171592425047, 0.33705209180797363, -0.25654820242198184, -0.26333262464454904, -0.030868231509388847, -0.2875659039815549, -0.01782108354382217, 0.12635456168738363, 0.06765874360412867, 0.06339718426302583, 0.1267826966279906, 0.031978125726296144, -0.02554535168515444, -0.1843465641352602, 0.3329382424285127, 0.1440231131643734, 0.2426089887052182, 0.151546993938444, 0.012460060602858324, 0.050620776500595224, -0.003958299750758504, -0.09973769551354715, -0.1345356266674571, 0.03753613397996312, 0.26482198214084335, 0.06537362434160472, 0.1318686395163902, -0.45334478063424205, -0.18939958666355364, 0.09151048317488114, 0.1785142659421333, 0.15987956163536926, -0.05970937008995944, -0.27882668378614733, 0.011387738219293004, -0.2649836491063153, -0.10652789803465236, -0.06585436343249801, 0.03004637302365154, 0.03666431531945074, -0.3051041614221917, 0.10428805791095576, 0.017151250053840075, 0.04812881423202436, -0.14689118195383344, -0.20146872248204256, -0.06081137394225648, 0.04462842679243873, 0.00893521311015568, -0.03525936796160584, 0.23076220565814187, -0.12725970556163124, -0.10134316923160275, 0.3815482344732366, 0.0017500368796225468, -0.08443060761783272, 0.20867136089641877, -0.1405896938099018, -0.07018994548045819, 0.21192070901055227, 0.14293840290999718, 0.11653627621390941, -0.12035887158179487, 0.04076568113206039, 0.02214027124203064, 0.1436808910855854, 0.09183438940354707, 0.027914663358718495, 0.14151127359020227, 0.20744373604313956, -0.07960295935415408, 0.06885689808140424, -0.16455189609339207, -0.1592978606508537, -0.30597502808086574, -0.07605901926184412, -0.09472760838583451, 0.010793624773875556, 0.027080358299413507, -0.1211477504746819, 0.3045716522071664, 0.04408106799647529, 0.2563137378707655, -0.06942455981731076, 0.2930577174940316, 0.08021794405993371, 0.054136199708657594, 0.02158922320020131, 0.2996710669672625, 0.23362567644852045, 0.039097826774443754, -0.32158866900400346, 0.1109777871064249, 0.007869301416741853] |
1,802.01182 | Irreducible symplectic varieties from moduli spaces of sheaves on K3 and
Abelian surfaces | We show that the moduli spaces of sheaves on a projective K3 surface are
irreducible symplectic varieties, and that the same holds for the fibers of the
Albanese map of moduli spaces of sheaves on an Abelian surface.
| math.AG | we show that the moduli spaces of sheaves on a projective k3 surface are irreducible symplectic varieties and that the same holds for the fibers of the albanese map of moduli spaces of sheaves on an abelian surface | [['we', 'show', 'that', 'the', 'moduli', 'spaces', 'of', 'sheaves', 'on', 'a', 'projective', 'k3', 'surface', 'are', 'irreducible', 'symplectic', 'varieties', 'and', 'that', 'the', 'same', 'holds', 'for', 'the', 'fibers', 'of', 'the', 'albanese', 'map', 'of', 'moduli', 'spaces', 'of', 'sheaves', 'on', 'an', 'abelian', 'surface']] | [-0.2406516042783072, 0.09072006887512735, -0.15910284912311717, 0.11142292354059846, -0.060224757431761214, -0.10921310186141024, -0.06285744380990141, 0.37422663973350273, -0.365548327957329, -0.07574104855915434, 0.10207462982323609, -0.2050762828684559, -0.18250057562009284, 0.2894984869482486, -0.26917313710835417, -0.04288890764215275, 0.029635079872892482, 0.03373893267033916, -0.1584705342599926, -0.4276993313412133, 0.6220884026077232, -0.11365312606243319, 0.32293614794157055, 0.1163336182209222, 0.1926161431168255, 0.022880093329341003, 0.031340929336453736, -0.11592412651761581, -0.11339783167510943, 0.21297137567460978, 0.36062953454491337, -0.02939461046633752, 0.044933051042454805, -0.40160127925245387, -0.21030316082760692, 0.2961133448161969, 0.0779951560237494, 0.006488283213816191, 0.061359261058417984, -0.2469529806587257, 0.06164847341317095, -0.07763631617356288, -0.15390419597296337, -0.11001849846032105, 0.0744065492364921, 0.060379310437527145, -0.12569890671262615, -0.10227702705091551, 0.06872203078513082, 0.2033009046541625, -0.18355561414194344, -0.09608378815219591, -0.24595431571728305, 0.021377387811968986, -0.041772889340982625, 0.0736961112308659, 0.11927955553523804, -0.17052396154031157, -0.0699142695796725, 0.3724659328397952, -0.10553601577779964, -0.25948408770522, 0.08185677151930959, -0.15705660717120687, -0.12532542541770167, 0.19515495501630203, 0.0808535779973394, 0.22500200599039855, 0.16414068225084952, 0.2025193919069256, -0.18550263325634755, 0.07589695553638433, 0.1097356612230406, -0.002608646271064093, 0.09643975304635732, 0.14648949196194544, 0.08697958035688651, 0.060339041201299744, -0.06140670963366957, 0.0444504251905815, -0.4277963224602373, -0.2707553453939526, -0.07780468682023256, 0.20923587042642267, -0.16417560245999516, -0.17264226230939753, 0.4031605133296628, -0.0011558651581014458, 0.19583111354394964, 0.20851182028357135, 0.18701148131176046, -0.10674860480388529, 0.012818931234314254, 0.001201212332632981, 0.17921154387295246, 0.2644980636572367, -0.16422938494207828, -0.10032061460476957, -0.08214922624297048, 0.2836699754391846] |
1,802.01183 | Minimum curvilinear automata with similarity attachment for network
embedding and link prediction in the hyperbolic space | The idea of minimum curvilinearity (MC) is that the hidden geometry of
complex networks, in particular when they are sufficiently sparse, clustered,
small-world and heterogeneous, can be efficiently navigated using the minimum
spanning tree (MST), which is a greedy navigator. The local topological
information drives the global geometrical navigation and the MST can be
interpreted as a growing path that greedily maximizes local similarity between
the nodes attached at each step by globally minimizing their overall distances
in the network. This is also valid in absence of the network structure and in
presence of only the nodes geometrically located over the network generative
manifold in a high-dimensional space. We know that random geometric graphs in
the hyperbolic space are an adequate model for realistic complex networks: the
explanation of this connection is that complex networks exhibit hierarchical,
tree-like organization, and in turn the hyperbolic geometry is the geometry of
trees. Here we show that, according to a mechanism that we define similarity
attachment, the visited node sequence of a network automaton can efficiently
approximate the nodes' angular coordinates in the hyperbolic disk, that
actually represent an ordering of their similarities. This is a consequence of
the fact that the MST, during its greedy growing process, at each step
sequentially attaches the node most similar (less distant) to its own cohort.
Minimum curvilinear automata (MCA) displays embedding accuracy which seems
superior to HyperMap-CN and inferior to coalescent embedding, however its link
prediction performance on real networks is without precedent for methods based
on the hyperbolic space. Finally, depending on the data structure used to build
the MST, the MCA's time complexity can also approach a linear dependence from
the number of edges.
| physics.soc-ph cs.SI | the idea of minimum curvilinearity mc is that the hidden geometry of complex networks in particular when they are sufficiently sparse clustered smallworld and heterogeneous can be efficiently navigated using the minimum spanning tree mst which is a greedy navigator the local topological information drives the global geometrical navigation and the mst can be interpreted as a growing path that greedily maximizes local similarity between the nodes attached at each step by globally minimizing their overall distances in the network this is also valid in absence of the network structure and in presence of only the nodes geometrically located over the network generative manifold in a highdimensional space we know that random geometric graphs in the hyperbolic space are an adequate model for realistic complex networks the explanation of this connection is that complex networks exhibit hierarchical treelike organization and in turn the hyperbolic geometry is the geometry of trees here we show that according to a mechanism that we define similarity attachment the visited node sequence of a network automaton can efficiently approximate the nodes angular coordinates in the hyperbolic disk that actually represent an ordering of their similarities this is a consequence of the fact that the mst during its greedy growing process at each step sequentially attaches the node most similar less distant to its own cohort minimum curvilinear automata mca displays embedding accuracy which seems superior to hypermapcn and inferior to coalescent embedding however its link prediction performance on real networks is without precedent for methods based on the hyperbolic space finally depending on the data structure used to build the mst the mcas time complexity can also approach a linear dependence from the number of edges | [['the', 'idea', 'of', 'minimum', 'curvilinearity', 'mc', 'is', 'that', 'the', 'hidden', 'geometry', 'of', 'complex', 'networks', 'in', 'particular', 'when', 'they', 'are', 'sufficiently', 'sparse', 'clustered', 'smallworld', 'and', 'heterogeneous', 'can', 'be', 'efficiently', 'navigated', 'using', 'the', 'minimum', 'spanning', 'tree', 'mst', 'which', 'is', 'a', 'greedy', 'navigator', 'the', 'local', 'topological', 'information', 'drives', 'the', 'global', 'geometrical', 'navigation', 'and', 'the', 'mst', 'can', 'be', 'interpreted', 'as', 'a', 'growing', 'path', 'that', 'greedily', 'maximizes', 'local', 'similarity', 'between', 'the', 'nodes', 'attached', 'at', 'each', 'step', 'by', 'globally', 'minimizing', 'their', 'overall', 'distances', 'in', 'the', 'network', 'this', 'is', 'also', 'valid', 'in', 'absence', 'of', 'the', 'network', 'structure', 'and', 'in', 'presence', 'of', 'only', 'the', 'nodes', 'geometrically', 'located', 'over', 'the', 'network', 'generative', 'manifold', 'in', 'a', 'highdimensional', 'space', 'we', 'know', 'that', 'random', 'geometric', 'graphs', 'in', 'the', 'hyperbolic', 'space', 'are', 'an', 'adequate', 'model', 'for', 'realistic', 'complex', 'networks', 'the', 'explanation', 'of', 'this', 'connection', 'is', 'that', 'complex', 'networks', 'exhibit', 'hierarchical', 'treelike', 'organization', 'and', 'in', 'turn', 'the', 'hyperbolic', 'geometry', 'is', 'the', 'geometry', 'of', 'trees', 'here', 'we', 'show', 'that', 'according', 'to', 'a', 'mechanism', 'that', 'we', 'define', 'similarity', 'attachment', 'the', 'visited', 'node', 'sequence', 'of', 'a', 'network', 'automaton', 'can', 'efficiently', 'approximate', 'the', 'nodes', 'angular', 'coordinates', 'in', 'the', 'hyperbolic', 'disk', 'that', 'actually', 'represent', 'an', 'ordering', 'of', 'their', 'similarities', 'this', 'is', 'a', 'consequence', 'of', 'the', 'fact', 'that', 'the', 'mst', 'during', 'its', 'greedy', 'growing', 'process', 'at', 'each', 'step', 'sequentially', 'attaches', 'the', 'node', 'most', 'similar', 'less', 'distant', 'to', 'its', 'own', 'cohort', 'minimum', 'curvilinear', 'automata', 'mca', 'displays', 'embedding', 'accuracy', 'which', 'seems', 'superior', 'to', 'hypermapcn', 'and', 'inferior', 'to', 'coalescent', 'embedding', 'however', 'its', 'link', 'prediction', 'performance', 'on', 'real', 'networks', 'is', 'without', 'precedent', 'for', 'methods', 'based', 'on', 'the', 'hyperbolic', 'space', 'finally', 'depending', 'on', 'the', 'data', 'structure', 'used', 'to', 'build', 'the', 'mst', 'the', 'mcas', 'time', 'complexity', 'can', 'also', 'approach', 'a', 'linear', 'dependence', 'from', 'the', 'number', 'of', 'edges']] | [-0.14086617343221275, 0.08385581848311371, -0.0833738668730283, 0.08940167009072866, -0.12266524003020354, -0.12305867010727525, 0.07848371825239156, 0.4107066707176273, -0.3219897110559811, -0.2934155857134361, 0.07863861396742453, -0.2616392649552186, -0.2175172396594592, 0.1252648204140964, -0.08107628638972528, 0.018172704829443578, 0.08713363138397523, 0.08705385897561167, -0.027376788056738276, -0.24963108425436076, 0.31166165515647404, 0.0825846639037731, 0.2965554861992132, -0.02201853794935492, 0.10767910189169924, 0.003068103430060936, 0.0030533465706477207, 0.05914615042428133, -0.06854846665540078, 0.14175311944979643, 0.2565323258143118, 0.14845580023081442, 0.2596456653821016, -0.4333524488511362, -0.21919636338092718, 0.14573628203610756, 0.1541001759752232, 0.09004242484807037, 0.009856505270415384, -0.2566571018874778, 0.10783357821138842, -0.12424188487722339, -0.08991066237815955, -0.04292831233054, 0.010749494987872562, 0.019157650322969337, -0.23410618031339253, 0.01609295522440724, 0.056997045107917595, 0.018508813832886516, -0.01715803223653763, -0.06804867293228328, -0.0785722654312849, 0.15876535538398975, -0.021106497746846538, 0.06016701941636191, 0.1101552463999334, -0.09598933369436834, -0.13894928213807622, 0.3645572037236499, -0.01029481152259645, -0.2202788163708257, 0.1919239672241799, -0.09645604303389388, -0.16214863784428288, 0.14253389817479598, 0.2034138144401368, 0.10159171254241041, -0.13971628813789203, 0.07263198747262192, -0.07390417657360168, 0.14688346785010903, 0.06183595726532595, 0.012080367094105376, 0.18042678728829092, 0.20700066195235456, 0.11933805866699133, 0.12849917265037739, -0.08140771654039522, -0.11770726045443942, -0.23440330675137894, -0.1330687882062713, -0.2401977203387235, 0.014463202118973381, -0.19163744072237543, -0.18721996323937284, 0.3998526275573697, 0.12577384215214157, 0.2329992525129845, 0.0930881796216324, 0.2782278750964906, 0.057717609795924676, 0.07944052094327551, 0.12098669026579176, 0.18295848623466945, 0.07722758189026666, 0.07725624991206652, -0.1840073097372494, 0.13991587499372793, 0.07677924028664296] |
1,802.01184 | On coset leader graphs of structured linear codes | We suggest a new approach to obtain bounds on locally correctable and some
locally testable binary linear codes, by arguing that these codes (or their
subcodes) have coset leader graphs with high discrete Ricci curvature.
The bounds we obtain for locally correctable codes are worse than the best
known bounds obtained using quantum information theory, but are better than
those obtained using other methods, such as the "usual" information theory. (We
remark that our methods are completely elementary.)
The bounds we obtain for a family of locally testable codes improve the best
known bounds.
| math.CO | we suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes by arguing that these codes or their subcodes have coset leader graphs with high discrete ricci curvature the bounds we obtain for locally correctable codes are worse than the best known bounds obtained using quantum information theory but are better than those obtained using other methods such as the usual information theory we remark that our methods are completely elementary the bounds we obtain for a family of locally testable codes improve the best known bounds | [['we', 'suggest', 'a', 'new', 'approach', 'to', 'obtain', 'bounds', 'on', 'locally', 'correctable', 'and', 'some', 'locally', 'testable', 'binary', 'linear', 'codes', 'by', 'arguing', 'that', 'these', 'codes', 'or', 'their', 'subcodes', 'have', 'coset', 'leader', 'graphs', 'with', 'high', 'discrete', 'ricci', 'curvature', 'the', 'bounds', 'we', 'obtain', 'for', 'locally', 'correctable', 'codes', 'are', 'worse', 'than', 'the', 'best', 'known', 'bounds', 'obtained', 'using', 'quantum', 'information', 'theory', 'but', 'are', 'better', 'than', 'those', 'obtained', 'using', 'other', 'methods', 'such', 'as', 'the', 'usual', 'information', 'theory', 'we', 'remark', 'that', 'our', 'methods', 'are', 'completely', 'elementary', 'the', 'bounds', 'we', 'obtain', 'for', 'a', 'family', 'of', 'locally', 'testable', 'codes', 'improve', 'the', 'best', 'known', 'bounds']] | [-0.09560341504650151, 0.11587055245454007, -0.08913271384749641, 0.18414992329347482, -0.10135852222509206, -0.25642529262745, 0.03944453552979579, 0.37755690669601266, -0.26895549277121084, -0.29528699841033273, 0.1789233656055195, -0.26550102297295913, -0.1574299477686006, 0.28529572230020656, -0.08819118385361706, 0.09995290382388741, 0.06527921865648402, 0.09052304825943677, -0.14835594620238593, -0.35816506617405314, 0.30267967529436374, 0.10888440407034843, 0.2219896915646151, 0.019008335434494816, 0.030405911240488925, -0.05699873244528599, -0.0607486525253254, 0.02614870202787062, -0.24502251769414177, 0.1647335382455841, 0.2683755625584262, 0.16972402830984681, 0.1629454769352649, -0.38974000037984646, -0.24849357561981109, 0.11934748655937469, 0.1216481272973358, 0.18786847983496857, -0.06446860379048999, -0.2739606412546214, 0.13414630614545572, -0.13941035665413168, -0.05339978371209346, -0.10893434712148094, -0.08633535453415614, 0.02217303906899302, -0.2776831250657585, 0.039422221288600186, 0.10360080757713382, 0.03375577779506591, -0.04571805146592174, -0.1962974192326928, 0.028933597805394614, 0.11175972227616474, -0.021108818042309994, 0.02424113024174771, 0.07127493834420245, -0.04641083414923954, -0.17749054000732747, 0.33180442019650574, -0.08102160751815896, -0.22320406194875372, 0.15582269488615877, -0.12131891234658976, -0.12078232210416823, 0.06360634907763055, 0.15260553918778896, 0.18240295874668247, -0.09361229046555038, 0.09373448053907425, -0.07767337552975229, 0.14095712576972994, 0.07099992497031518, 0.1535730578916821, 0.12033373927895694, 0.058851492452494644, 0.12498479923282928, 0.12992968672373767, 0.03307494733289399, -0.06485676551435857, -0.2890080623724993, -0.07945196266147367, -0.17123506251881096, 0.03193178706544828, -0.1581207137934782, -0.16545781910919802, 0.3267723163193528, 0.10437866612436607, 0.14954913717674764, 0.20216036605787405, 0.25204634133409315, 0.04775650003191797, 0.08402646616091357, 0.23258273551200934, 0.24999079042011524, 0.15015409060783605, -0.07900728472072552, -0.10534399380737747, 0.08779711976766269, 0.13333258100666423] |
1,802.01185 | IntelliAV: Building an Effective On-Device Android Malware Detector | The importance of employing machine learning for malware detection has become
explicit to the security community. Several anti-malware vendors have claimed
and advertised the application of machine learning in their products in which
the inference phase is performed on servers and high-performance machines, but
the feasibility of such approaches on mobile devices with limited computational
resources has not yet been assessed by the research community, vendors still
being skeptical. In this paper, we aim to show the practicality of devising a
learning-based anti-malware on Android mobile devices, first. Furthermore, we
aim to demonstrate the significance of such a tool to cease new and evasive
malware that can not easily be caught by signature-based or offline
learning-based security tools. To this end, we first propose the extraction of
a set of lightweight yet powerful features from Android applications. Then, we
embed these features in a vector space to build an effective as well as
efficient model. Hence, the model can perform the inference on the device for
detecting potentially harmful applications. We show that without resorting to
any signatures and relying only on a training phase involving a reasonable set
of samples, the proposed system, named IntelliAV, provides more satisfying
performances than the popular major anti-malware products. Moreover, we
evaluate the robustness of IntelliAV against common obfuscation techniques
where most of the anti-malware solutions get affected.
| cs.CR | the importance of employing machine learning for malware detection has become explicit to the security community several antimalware vendors have claimed and advertised the application of machine learning in their products in which the inference phase is performed on servers and highperformance machines but the feasibility of such approaches on mobile devices with limited computational resources has not yet been assessed by the research community vendors still being skeptical in this paper we aim to show the practicality of devising a learningbased antimalware on android mobile devices first furthermore we aim to demonstrate the significance of such a tool to cease new and evasive malware that can not easily be caught by signaturebased or offline learningbased security tools to this end we first propose the extraction of a set of lightweight yet powerful features from android applications then we embed these features in a vector space to build an effective as well as efficient model hence the model can perform the inference on the device for detecting potentially harmful applications we show that without resorting to any signatures and relying only on a training phase involving a reasonable set of samples the proposed system named intelliav provides more satisfying performances than the popular major antimalware products moreover we evaluate the robustness of intelliav against common obfuscation techniques where most of the antimalware solutions get affected | [['the', 'importance', 'of', 'employing', 'machine', 'learning', 'for', 'malware', 'detection', 'has', 'become', 'explicit', 'to', 'the', 'security', 'community', 'several', 'antimalware', 'vendors', 'have', 'claimed', 'and', 'advertised', 'the', 'application', 'of', 'machine', 'learning', 'in', 'their', 'products', 'in', 'which', 'the', 'inference', 'phase', 'is', 'performed', 'on', 'servers', 'and', 'highperformance', 'machines', 'but', 'the', 'feasibility', 'of', 'such', 'approaches', 'on', 'mobile', 'devices', 'with', 'limited', 'computational', 'resources', 'has', 'not', 'yet', 'been', 'assessed', 'by', 'the', 'research', 'community', 'vendors', 'still', 'being', 'skeptical', 'in', 'this', 'paper', 'we', 'aim', 'to', 'show', 'the', 'practicality', 'of', 'devising', 'a', 'learningbased', 'antimalware', 'on', 'android', 'mobile', 'devices', 'first', 'furthermore', 'we', 'aim', 'to', 'demonstrate', 'the', 'significance', 'of', 'such', 'a', 'tool', 'to', 'cease', 'new', 'and', 'evasive', 'malware', 'that', 'can', 'not', 'easily', 'be', 'caught', 'by', 'signaturebased', 'or', 'offline', 'learningbased', 'security', 'tools', 'to', 'this', 'end', 'we', 'first', 'propose', 'the', 'extraction', 'of', 'a', 'set', 'of', 'lightweight', 'yet', 'powerful', 'features', 'from', 'android', 'applications', 'then', 'we', 'embed', 'these', 'features', 'in', 'a', 'vector', 'space', 'to', 'build', 'an', 'effective', 'as', 'well', 'as', 'efficient', 'model', 'hence', 'the', 'model', 'can', 'perform', 'the', 'inference', 'on', 'the', 'device', 'for', 'detecting', 'potentially', 'harmful', 'applications', 'we', 'show', 'that', 'without', 'resorting', 'to', 'any', 'signatures', 'and', 'relying', 'only', 'on', 'a', 'training', 'phase', 'involving', 'a', 'reasonable', 'set', 'of', 'samples', 'the', 'proposed', 'system', 'named', 'intelliav', 'provides', 'more', 'satisfying', 'performances', 'than', 'the', 'popular', 'major', 'antimalware', 'products', 'moreover', 'we', 'evaluate', 'the', 'robustness', 'of', 'intelliav', 'against', 'common', 'obfuscation', 'techniques', 'where', 'most', 'of', 'the', 'antimalware', 'solutions', 'get', 'affected']] | [-0.08956536576788739, -0.0025359944229911085, -0.07671194016983557, 0.06501264808513642, -0.12330021551547096, -0.19788360483568546, 0.08376472105946592, 0.39739242514737383, -0.24708201795985563, -0.32546785379856025, 0.14772596795554585, -0.2666435072181805, -0.14737022891035095, 0.24160691641266938, -0.10907435676734477, 0.10306243221807991, 0.06175004280143054, 0.047217735723120415, -0.029455036459351793, -0.2746554550228248, 0.3188974598230535, 0.06164724008084145, 0.31716712963487537, 0.07383553045483372, 0.06256680571027268, -0.018074091347435598, -0.024789037997573364, 0.009302600023661418, -0.06532397357499772, 0.15786873880536775, 0.31626374978204613, 0.232432587181882, 0.3493385241730264, -0.4431195531975929, -0.20201006560114468, 0.13173716480743491, 0.17908249515622454, 0.11857372611049029, -0.10311300421506636, -0.3251119558135624, 0.14821488958378343, -0.23446904649465208, -0.0667367528667496, -0.1721138601441139, -0.02700639106573395, -0.0071817743926071, -0.21427611762766346, -0.05007222041578007, 0.03343136837202722, 0.07358340742985296, -0.007163747914230468, -0.09592111443113034, 0.037751287928753166, 0.15792059550592216, 0.0462158618217142, -0.01341234119567235, 0.15881991204847434, -0.1529365644903189, -0.1771755614944404, 0.3735832038498379, -0.02443703810399609, -0.1717917505461689, 0.2436549711884772, -0.0016337866694436747, -0.17471574800038886, 0.08200661288240231, 0.22855899945468403, 0.12670134449786938, -0.1816623070958016, 0.03789224324960913, 0.027508468104050297, 0.1879502233256682, 0.033384021586684236, 0.03214992599503342, 0.1874618761068118, 0.22555183532014553, 0.05183683613402928, 0.1409861407813829, -0.07528369477950037, -0.03934513845986315, -0.20485141268835275, -0.17205002479622716, -0.180321426190344, 0.012764943758523793, -0.03463169660042312, -0.16618608808011284, 0.3968823203303321, 0.24722107091183554, 0.13885330520632924, 0.05228034402776276, 0.3901941571301142, 0.032730045162622644, 0.12332268217536767, 0.1178060584793477, 0.21852869225400728, -0.0029902292620140073, 0.1236625574466526, -0.13647140436461236, 0.14376179586507112, 0.006429689742140305] |
1,802.01186 | Personalized Machine Learning for Robot Perception of Affect and
Engagement in Autism Therapy | Robots have great potential to facilitate future therapies for children on
the autism spectrum. However, existing robots lack the ability to automatically
perceive and respond to human affect, which is necessary for establishing and
maintaining engaging interactions. Moreover, their inference challenge is made
harder by the fact that many individuals with autism have atypical and
unusually diverse styles of expressing their affective-cognitive states. To
tackle the heterogeneity in behavioral cues of children with autism, we use the
latest advances in deep learning to formulate a personalized machine learning
(ML) framework for automatic perception of the childrens affective states and
engagement during robot-assisted autism therapy. The key to our approach is a
novel shift from the traditional ML paradigm - instead of using
'one-size-fits-all' ML models, our personalized ML framework is optimized for
each child by leveraging relevant contextual information (demographics and
behavioral assessment scores) and individual characteristics of each child. We
designed and evaluated this framework using a dataset of multi-modal audio,
video and autonomic physiology data of 35 children with autism (age 3-13) and
from 2 cultures (Asia and Europe), participating in a 25-minute child-robot
interaction (~500k datapoints). Our experiments confirm the feasibility of the
robot perception of affect and engagement, showing clear improvements due to
the model personalization. The proposed approach has potential to improve
existing therapies for autism by offering more efficient monitoring and
summarization of the therapy progress.
| cs.RO cs.AI cs.CV cs.HC | robots have great potential to facilitate future therapies for children on the autism spectrum however existing robots lack the ability to automatically perceive and respond to human affect which is necessary for establishing and maintaining engaging interactions moreover their inference challenge is made harder by the fact that many individuals with autism have atypical and unusually diverse styles of expressing their affectivecognitive states to tackle the heterogeneity in behavioral cues of children with autism we use the latest advances in deep learning to formulate a personalized machine learning ml framework for automatic perception of the childrens affective states and engagement during robotassisted autism therapy the key to our approach is a novel shift from the traditional ml paradigm instead of using onesizefitsall ml models our personalized ml framework is optimized for each child by leveraging relevant contextual information demographics and behavioral assessment scores and individual characteristics of each child we designed and evaluated this framework using a dataset of multimodal audio video and autonomic physiology data of 35 children with autism age 313 and from 2 cultures asia and europe participating in a 25minute childrobot interaction 500k datapoints our experiments confirm the feasibility of the robot perception of affect and engagement showing clear improvements due to the model personalization the proposed approach has potential to improve existing therapies for autism by offering more efficient monitoring and summarization of the therapy progress | [['robots', 'have', 'great', 'potential', 'to', 'facilitate', 'future', 'therapies', 'for', 'children', 'on', 'the', 'autism', 'spectrum', 'however', 'existing', 'robots', 'lack', 'the', 'ability', 'to', 'automatically', 'perceive', 'and', 'respond', 'to', 'human', 'affect', 'which', 'is', 'necessary', 'for', 'establishing', 'and', 'maintaining', 'engaging', 'interactions', 'moreover', 'their', 'inference', 'challenge', 'is', 'made', 'harder', 'by', 'the', 'fact', 'that', 'many', 'individuals', 'with', 'autism', 'have', 'atypical', 'and', 'unusually', 'diverse', 'styles', 'of', 'expressing', 'their', 'affectivecognitive', 'states', 'to', 'tackle', 'the', 'heterogeneity', 'in', 'behavioral', 'cues', 'of', 'children', 'with', 'autism', 'we', 'use', 'the', 'latest', 'advances', 'in', 'deep', 'learning', 'to', 'formulate', 'a', 'personalized', 'machine', 'learning', 'ml', 'framework', 'for', 'automatic', 'perception', 'of', 'the', 'childrens', 'affective', 'states', 'and', 'engagement', 'during', 'robotassisted', 'autism', 'therapy', 'the', 'key', 'to', 'our', 'approach', 'is', 'a', 'novel', 'shift', 'from', 'the', 'traditional', 'ml', 'paradigm', 'instead', 'of', 'using', 'onesizefitsall', 'ml', 'models', 'our', 'personalized', 'ml', 'framework', 'is', 'optimized', 'for', 'each', 'child', 'by', 'leveraging', 'relevant', 'contextual', 'information', 'demographics', 'and', 'behavioral', 'assessment', 'scores', 'and', 'individual', 'characteristics', 'of', 'each', 'child', 'we', 'designed', 'and', 'evaluated', 'this', 'framework', 'using', 'a', 'dataset', 'of', 'multimodal', 'audio', 'video', 'and', 'autonomic', 'physiology', 'data', 'of', '35', 'children', 'with', 'autism', 'age', '313', 'and', 'from', '2', 'cultures', 'asia', 'and', 'europe', 'participating', 'in', 'a', '25minute', 'childrobot', 'interaction', '500k', 'datapoints', 'our', 'experiments', 'confirm', 'the', 'feasibility', 'of', 'the', 'robot', 'perception', 'of', 'affect', 'and', 'engagement', 'showing', 'clear', 'improvements', 'due', 'to', 'the', 'model', 'personalization', 'the', 'proposed', 'approach', 'has', 'potential', 'to', 'improve', 'existing', 'therapies', 'for', 'autism', 'by', 'offering', 'more', 'efficient', 'monitoring', 'and', 'summarization', 'of', 'the', 'therapy', 'progress']] | [-0.008538364824700662, 0.06546585455610046, -0.06142800362647499, 0.07395083850603469, -0.14430465325957173, -0.20488550006025613, 0.069508037440795, 0.439630774549294, -0.2010530595021784, -0.3596876237773251, 0.055605246467865584, -0.30383023074889093, -0.22512601491970755, 0.16912085108975494, -0.164878472878738, 0.06230974513691683, 0.11014328970610444, 0.058253330810963455, 0.022857241683302033, -0.26747773585466905, 0.2745283701300507, 0.061991619896707956, 0.37398118725835494, 0.07841395186951718, 0.08168134751869975, 0.035329638107976666, -0.05576615054648386, -0.029304453017247035, -0.038967454349491226, 0.230361857765159, 0.3829476597818057, 0.276523544861809, 0.40551497321372537, -0.4044472969149333, -0.22751574419534412, 0.08518829362214783, 0.12961329109168623, 0.083309881171053, -0.06471372966322383, -0.38117180583290916, 0.1004172945874245, -0.21263280847642618, -0.057874372601102404, -0.1003570550255575, 0.008188590001188805, -0.006913448889804882, -0.2598656944256463, 0.05115883082342558, 0.009920468536616349, 0.17243764088611122, -0.10543011596393832, -0.12306111258369215, 0.007022273399883385, 0.2620077650408427, 0.08778612090602078, 0.04156453793565438, 0.18548507928669322, -0.22050845610307263, -0.15916012720038147, 0.34299915249146296, 0.018718343461440738, -0.13128681667625658, 0.23110269983075396, -0.04739274310179901, -0.14013890402115003, 0.06702073268169399, 0.24077291513780968, 0.07323204723108503, -0.18564436422034641, -0.012320851165939561, 0.057671013127556923, 0.1811422746116092, 0.018875156747844218, -0.021751605084076458, 0.21268937198087312, 0.24336478751324073, -0.014970389249689844, 0.06983066211133285, -0.0652391379587271, -0.04229954992930352, -0.13623479902886634, -0.1286608746696485, -0.10099788417523183, -0.016352685248262177, -0.08424159766029461, -0.12371518710977907, 0.43430556344706156, 0.23679022201820882, 0.13152022382008588, 0.09865826131281845, 0.3129709015313666, -0.013901911452758292, 0.11715957562044653, 0.02616875402336558, 0.17264886075167157, 0.001519490264185326, 0.18376975440456814, -0.23078477017552995, 0.16400797122389923, -0.04655889525166184] |
1,802.01187 | Different regimes of Purcell Effect in Disordered Photonic Crystals | We demonstrate that disorder in photonic crystals could lead to pronounced
modification of spontaneous emission rate in the frequency region corresponding
to the photonic band gap (PBG). Depending on the amount of disorder, two
different regimes of the Purcell effect occurs. For the moderate disorder, an
enhancement of spontaneous emission occurs at the edge of PBG due to
modification of the properties of the edge state. This effect is responsible
for recently observed mirrorless lasing in photonic crystals at the edge of
PBG. When the level of disorder increases, the spontaneous emission rate
enhances within the PBG due to the appearance of the high quality factor
states. This effect is likely responsible for a superlinear dependence of
emissions on the pumping observed in synthetic opals.
| physics.optics cond-mat.dis-nn cond-mat.mes-hall | we demonstrate that disorder in photonic crystals could lead to pronounced modification of spontaneous emission rate in the frequency region corresponding to the photonic band gap pbg depending on the amount of disorder two different regimes of the purcell effect occurs for the moderate disorder an enhancement of spontaneous emission occurs at the edge of pbg due to modification of the properties of the edge state this effect is responsible for recently observed mirrorless lasing in photonic crystals at the edge of pbg when the level of disorder increases the spontaneous emission rate enhances within the pbg due to the appearance of the high quality factor states this effect is likely responsible for a superlinear dependence of emissions on the pumping observed in synthetic opals | [['we', 'demonstrate', 'that', 'disorder', 'in', 'photonic', 'crystals', 'could', 'lead', 'to', 'pronounced', 'modification', 'of', 'spontaneous', 'emission', 'rate', 'in', 'the', 'frequency', 'region', 'corresponding', 'to', 'the', 'photonic', 'band', 'gap', 'pbg', 'depending', 'on', 'the', 'amount', 'of', 'disorder', 'two', 'different', 'regimes', 'of', 'the', 'purcell', 'effect', 'occurs', 'for', 'the', 'moderate', 'disorder', 'an', 'enhancement', 'of', 'spontaneous', 'emission', 'occurs', 'at', 'the', 'edge', 'of', 'pbg', 'due', 'to', 'modification', 'of', 'the', 'properties', 'of', 'the', 'edge', 'state', 'this', 'effect', 'is', 'responsible', 'for', 'recently', 'observed', 'mirrorless', 'lasing', 'in', 'photonic', 'crystals', 'at', 'the', 'edge', 'of', 'pbg', 'when', 'the', 'level', 'of', 'disorder', 'increases', 'the', 'spontaneous', 'emission', 'rate', 'enhances', 'within', 'the', 'pbg', 'due', 'to', 'the', 'appearance', 'of', 'the', 'high', 'quality', 'factor', 'states', 'this', 'effect', 'is', 'likely', 'responsible', 'for', 'a', 'superlinear', 'dependence', 'of', 'emissions', 'on', 'the', 'pumping', 'observed', 'in', 'synthetic', 'opals']] | [-0.15409925004839897, 0.2054170042212354, -0.009215894277007464, 0.009217552843736484, -0.006168371867388487, -0.11034249705821275, 0.0862885918803513, 0.40916876375675204, -0.25566606311500073, -0.2930007567554712, 0.02305925662908703, -0.29469808323681357, -0.12175231755897403, 0.16894736659526824, 0.011337110413005575, 0.013668820241000502, -0.00750588699337095, -0.05206762844324112, -0.022127590982243418, -0.1321013483069837, 0.3126385635435581, 0.08631167282164097, 0.42221319825947284, 0.18671900563687086, 0.03534759408980608, -0.04483038093522191, 0.07782896342873573, -0.04418062802404165, -0.07699800979561405, 0.05916872771224007, 0.20995953088998795, -0.05181748377613258, 0.2555673358738422, -0.4102257587648928, -0.22744713346473872, 0.08415386269241572, 0.1436909506674856, 0.167178973659873, -0.08155843568779528, -0.27813058646023275, 0.05293484099954367, -0.11880761381983757, -0.15358487927820533, 0.03624391515552998, 0.037622977454215285, -0.06235606391727924, -0.2611636628843844, 0.14037333291769027, 0.07796094138827175, 0.06182735326886177, -0.05826206434890628, -0.025096530638635157, -0.08941906116902829, 0.05729583597858436, 0.02394552868232131, -0.03592610367271118, 0.19593706834688782, -0.2008739424161613, -0.13132373686879872, 0.4091587517112493, -0.08957628041878343, -0.06065145708620548, 0.16783444168418646, -0.2208439148813486, -0.0703991566535551, 0.2645251995828003, 0.18165088684856892, 0.04783071928098798, -0.015496465738513506, 0.007887327736709266, 0.034149632439017294, 0.1920926240682602, 0.08268067988939583, 0.18126236591115594, 0.20173333832621573, 0.19332792977057398, 0.019968997854739427, 0.23203643510490657, -0.15986075135599823, -0.04228011984471232, -0.22740176468342543, -0.12162204986810685, -0.2167706350684166, 0.046776285387575625, -0.10401962522044778, -0.16153445453196763, 0.44921008858084677, 0.11987589506804944, 0.18628111590445043, -0.04786325921490788, 0.21757677821815014, 0.1699162458628416, 0.13004298373311757, 0.019411368660628796, 0.3327996987551451, 0.12169350908696651, 0.06597643985599279, -0.34400282354280354, 0.10442570704966783, -0.05211083883047104] |
1,802.01188 | Where is Population II? | The use of roman numerals for stellar populations represents a classification
approach to galaxy formation which is now well behind us. Nevertheless, the
concept of a pristine generation of stars, followed by a protogalactic era, and
finally the mainstream stellar population is a plausible starting point for
testing our physical understanding of early star formation. This will be
observationally driven as never before in the coming decade. In this paper, we
search out observational tests of an idealized coeval and homogeneous
distribution of population II stars. We examine the spatial distribution of
quasars, globular clusters, and the integrated free electron density of the
intergalactic medium, in order to test the assumption of homogeneity. Any
$real$ inhomogeneity implies a population II that is not coeval.
| astro-ph.CO | the use of roman numerals for stellar populations represents a classification approach to galaxy formation which is now well behind us nevertheless the concept of a pristine generation of stars followed by a protogalactic era and finally the mainstream stellar population is a plausible starting point for testing our physical understanding of early star formation this will be observationally driven as never before in the coming decade in this paper we search out observational tests of an idealized coeval and homogeneous distribution of population ii stars we examine the spatial distribution of quasars globular clusters and the integrated free electron density of the intergalactic medium in order to test the assumption of homogeneity any real inhomogeneity implies a population ii that is not coeval | [['the', 'use', 'of', 'roman', 'numerals', 'for', 'stellar', 'populations', 'represents', 'a', 'classification', 'approach', 'to', 'galaxy', 'formation', 'which', 'is', 'now', 'well', 'behind', 'us', 'nevertheless', 'the', 'concept', 'of', 'a', 'pristine', 'generation', 'of', 'stars', 'followed', 'by', 'a', 'protogalactic', 'era', 'and', 'finally', 'the', 'mainstream', 'stellar', 'population', 'is', 'a', 'plausible', 'starting', 'point', 'for', 'testing', 'our', 'physical', 'understanding', 'of', 'early', 'star', 'formation', 'this', 'will', 'be', 'observationally', 'driven', 'as', 'never', 'before', 'in', 'the', 'coming', 'decade', 'in', 'this', 'paper', 'we', 'search', 'out', 'observational', 'tests', 'of', 'an', 'idealized', 'coeval', 'and', 'homogeneous', 'distribution', 'of', 'population', 'ii', 'stars', 'we', 'examine', 'the', 'spatial', 'distribution', 'of', 'quasars', 'globular', 'clusters', 'and', 'the', 'integrated', 'free', 'electron', 'density', 'of', 'the', 'intergalactic', 'medium', 'in', 'order', 'to', 'test', 'the', 'assumption', 'of', 'homogeneity', 'any', 'real', 'inhomogeneity', 'implies', 'a', 'population', 'ii', 'that', 'is', 'not', 'coeval']] | [-0.03587894716991052, 0.1271290848109798, -0.11305034828687748, 0.1213747946340816, -0.10160944590367557, -0.037261996489589014, 0.04510185790282013, 0.38001753978671565, -0.19159968943905928, -0.3322140451881193, 0.06491055453455286, -0.2429398884809005, -0.054677362550019974, 0.17074332568952214, -0.027103170356337702, -0.028247117163940152, 0.07736044547580663, -0.038806286903338566, -0.012485193439774335, -0.30175589490681887, 0.35483815582213746, 0.08516202995463484, 0.21737588213938813, -0.035986548192017985, 0.0711794798253029, -0.08040222450489959, -0.0797058827611768, 0.0029027487297782735, -0.13353542564278365, 0.06114731502443207, 0.23000822044278105, 0.20683090616254166, 0.3005002720897356, -0.3935065227560699, -0.23032465692789805, 0.09928540060777337, 0.21316983607492498, 0.11342080131139336, -0.11224760619863387, -0.2569064691722874, 0.07655223844678051, -0.1850850494548438, -0.202428255586945, 0.06610404216447816, 0.03982324246317148, 0.008093354374831241, -0.24396207253073132, 0.1104756622977044, 0.050440026876223724, 0.0765931385892233, -0.09903294883383017, -0.04626773462458063, -0.022518841309412833, 0.10671640230312703, 0.0032338369994484367, 0.03926865393370991, 0.16809893782098492, -0.154556053551665, -0.056907575496757824, 0.41214888182378584, -0.05655437645374707, -0.04428647798410947, 0.2220481665928908, -0.20089238994349276, -0.17456226093664526, 0.05887881530103304, 0.1589314978975322, 0.10516198609595097, -0.2034805040626276, 0.030273626361797083, -0.029062559840367024, 0.1887517417191937, 0.051542471365762815, 0.009815571467404352, 0.33021829849589734, 0.2082099456775693, 0.024395873334499135, 0.09508156149569268, -0.14349923433450562, -0.07166551883077069, -0.25789315558429204, -0.1625687793693355, -0.16168899297143421, 0.11132753698069381, -0.10348129727196553, -0.18714655271821445, 0.36591416070117583, 0.13639600868637283, 0.16405637327942155, 0.030931841119215073, 0.2781604212378302, 0.06303293298321566, 0.08355022554526166, 0.07720979568811374, 0.250280236509899, 0.14450624780992286, 0.07364223592336319, -0.19942951168970116, 0.12878806166531098, -0.01739223459322426] |
1,802.01189 | Smooth $q$-Gram, and Its Applications to Detection of Overlaps among
Long, Error-Prone Sequencing Reads | We propose smooth $q$-gram, the first variant of $q$-gram that captures
$q$-gram pair within a small edit distance. We apply smooth $q$-gram to the
problem of detecting overlapping pairs of error-prone reads produced by single
molecule real time sequencing (SMRT), which is the first and most critical step
of the de novo fragment assembly of SMRT reads. We have implemented and tested
our algorithm on a set of real world benchmarks. Our empirical results
demonstrated the significant superiority of our algorithm over the existing
$q$-gram based algorithms in accuracy.
| cs.DS | we propose smooth qgram the first variant of qgram that captures qgram pair within a small edit distance we apply smooth qgram to the problem of detecting overlapping pairs of errorprone reads produced by single molecule real time sequencing smrt which is the first and most critical step of the de novo fragment assembly of smrt reads we have implemented and tested our algorithm on a set of real world benchmarks our empirical results demonstrated the significant superiority of our algorithm over the existing qgram based algorithms in accuracy | [['we', 'propose', 'smooth', 'qgram', 'the', 'first', 'variant', 'of', 'qgram', 'that', 'captures', 'qgram', 'pair', 'within', 'a', 'small', 'edit', 'distance', 'we', 'apply', 'smooth', 'qgram', 'to', 'the', 'problem', 'of', 'detecting', 'overlapping', 'pairs', 'of', 'errorprone', 'reads', 'produced', 'by', 'single', 'molecule', 'real', 'time', 'sequencing', 'smrt', 'which', 'is', 'the', 'first', 'and', 'most', 'critical', 'step', 'of', 'the', 'de', 'novo', 'fragment', 'assembly', 'of', 'smrt', 'reads', 'we', 'have', 'implemented', 'and', 'tested', 'our', 'algorithm', 'on', 'a', 'set', 'of', 'real', 'world', 'benchmarks', 'our', 'empirical', 'results', 'demonstrated', 'the', 'significant', 'superiority', 'of', 'our', 'algorithm', 'over', 'the', 'existing', 'qgram', 'based', 'algorithms', 'in', 'accuracy']] | [-0.12100350203808774, -0.008851110417228402, -0.07769109220296312, 0.061939950913368735, -0.0376882933451679, -0.11232858125559902, 0.05221601004785534, 0.3904791157064813, -0.25065991624253225, -0.31910184236227673, 0.025726777094604678, -0.2322232396017467, -0.16387672210373821, 0.22839842313963377, -0.076388461570245, 0.1061130774618137, 0.1611614352029361, 0.019826476891221623, 0.009308686855005813, -0.30109439616541517, 0.28323339465796277, 0.021128994988256627, 0.29058552043658964, 0.04631357204974786, 0.1434124949534706, 0.02318154868743058, -0.04958163190690612, 0.01389661483110839, -0.07840044697881689, 0.17823398667727755, 0.25584701206953675, 0.240596573920188, 0.2845851611084399, -0.39936408025913694, -0.14117064289591705, 0.12588601950242112, 0.14762896710870724, 0.13050156936515123, -0.0744967948070798, -0.3150376731822832, 0.1428224040938311, -0.11185618237267887, 0.008183421431046523, -0.06379058176986455, 0.01476999253997307, 0.037903117528708466, -0.24651308269815497, 0.08278423376130255, 0.0012178691476845088, 0.020271130387535256, -0.02045227619923986, -0.1227024941066845, 0.03857261267898793, 0.14716868668669061, 0.00019092080078684213, 0.08052177380854159, 0.13460568803770656, -0.025445975619629864, -0.18142158363349317, 0.3637896598096979, -0.09419968716925785, -0.15795888482027928, 0.16017105769146275, -0.05325812493775333, -0.17183254464539918, 0.12353250751366023, 0.1792456674169791, 0.20043136517967233, -0.10935179522428452, 0.0844489561113937, -0.02731699633589956, 0.21403437118265736, 0.11315919908046136, -0.04501063504852773, 0.14351877275843886, 0.25155314112479765, 0.023533998018005087, 0.13885225233454468, -0.14262109723601366, -0.10997015501639355, -0.2607236847770662, -0.15546343589379463, -0.21532826359760476, -0.06199487313507857, -0.10517075320861428, -0.21366623876972146, 0.40498398746667286, 0.1663081977108305, 0.18917837481045824, 0.16417553335600898, 0.3492314661068193, -0.01765023876394255, 0.0999504228284729, 0.04522985046771302, 0.13175360586630244, 0.01159390204146588, 0.05567813352707857, -0.22081590576746155, 0.07330739080874521, 0.07153324116272537] |
1,802.0119 | Every classifiable simple C*-algebra has a Cartan subalgebra | We construct Cartan subalgebras in all classifiable stably finite
C*-algebras. Together with known constructions of Cartan subalgebras in all UCT
Kirchberg algebras, this shows that every classifiable simple C*-algebra has a
Cartan subalgebra.
| math.OA | we construct cartan subalgebras in all classifiable stably finite calgebras together with known constructions of cartan subalgebras in all uct kirchberg algebras this shows that every classifiable simple calgebra has a cartan subalgebra | [['we', 'construct', 'cartan', 'subalgebras', 'in', 'all', 'classifiable', 'stably', 'finite', 'calgebras', 'together', 'with', 'known', 'constructions', 'of', 'cartan', 'subalgebras', 'in', 'all', 'uct', 'kirchberg', 'algebras', 'this', 'shows', 'that', 'every', 'classifiable', 'simple', 'calgebra', 'has', 'a', 'cartan', 'subalgebra']] | [-0.16385045297669643, 0.1051736856161645, -0.02995649984840191, 0.030272856929734575, -0.20874929792163047, -0.2640664015162849, -0.08443504918338449, 0.46345126448255597, -0.4167598527150624, -0.018215938386592, 0.11296730421511739, -0.22885932091440103, -0.07576970400458033, 0.1619113331773516, -0.32724557102968294, -0.09061350667792739, 0.20342348753051323, 0.19924685342068021, -0.24679172348767292, -0.2909503981019511, 0.4311903077318813, -0.11071915395035775, 0.21000473754424037, -0.012985943308608099, 0.17107220809680945, -0.08458091456894622, 0.030194404676105038, 0.00863065325415157, -0.13730325660722112, -0.006683277756427274, 0.4888487833298065, 0.08618457756485, 0.19908221224040695, -0.24913668232726527, -0.008324782321737572, 0.32305493702843896, 0.19061196217256965, -0.036354796678730934, -0.07695255608467216, -0.29935710442562896, 0.05905321502888745, -0.38712640163121803, -0.09874438247502301, -0.21678374744387288, 0.1128443876478934, -0.13917110132222826, -0.17328144271265378, -0.014189953182005522, 0.18376486274329099, 0.16147733637780853, -0.14324954329905185, -0.07207433470157963, -0.1509022108758941, 0.03621601215987043, -0.2104540694589642, -0.08350149982354858, 0.16624254939167507, 0.11415917743138518, -0.27319597893140535, 0.3641169403651447, 0.03622364664845394, -0.22713911612377022, 0.14743549218683533, -0.3137635692502513, -0.3313343394265482, 0.12557265551930125, -0.11482322297877434, 0.09038894132456997, -0.05237066392984354, 0.3110684658767599, -0.2935461343237848, -0.0885100570140463, 0.038865314203907146, -0.0526601433556414, 0.006388897358468084, 0.04127442622275063, 0.050065253522585736, 0.11200623964947282, 0.34653771819659707, 0.1141421441835436, -0.3970913209698417, -0.14073954793539914, -0.006037356656496272, 0.2612209274913325, -0.11086566057620627, -0.22456409364487184, 0.4575276587045554, 0.1081096740778197, 0.12849014004071554, 0.15438851317616575, 0.1342134497156649, -0.07504314923602523, 0.2383921838958155, 0.2228094031187621, 0.156480944517887, 0.49669397554614325, -0.1531690449284559, -0.07233635570402398, -0.15477079927751963, 0.3684209923288136] |
1,802.01191 | Heuristic Feature Selection for Clickbait Detection | We study feature selection as a means to optimize the baseline clickbait
detector employed at the Clickbait Challenge 2017. The challenge's task is to
score the "clickbaitiness" of a given Twitter tweet on a scale from 0 (no
clickbait) to 1 (strong clickbait). Unlike most other approaches submitted to
the challenge, the baseline approach is based on manual feature engineering and
does not compete out of the box with many of the deep learning-based
approaches. We show that scaling up feature selection efforts to heuristically
identify better-performing feature subsets catapults the performance of the
baseline classifier to second rank overall, beating 12 other competing
approaches and improving over the baseline performance by 20%. This
demonstrates that traditional classification approaches can still keep up with
deep learning on this task.
| cs.CL | we study feature selection as a means to optimize the baseline clickbait detector employed at the clickbait challenge 2017 the challenges task is to score the clickbaitiness of a given twitter tweet on a scale from 0 no clickbait to 1 strong clickbait unlike most other approaches submitted to the challenge the baseline approach is based on manual feature engineering and does not compete out of the box with many of the deep learningbased approaches we show that scaling up feature selection efforts to heuristically identify betterperforming feature subsets catapults the performance of the baseline classifier to second rank overall beating 12 other competing approaches and improving over the baseline performance by 20 this demonstrates that traditional classification approaches can still keep up with deep learning on this task | [['we', 'study', 'feature', 'selection', 'as', 'a', 'means', 'to', 'optimize', 'the', 'baseline', 'clickbait', 'detector', 'employed', 'at', 'the', 'clickbait', 'challenge', '2017', 'the', 'challenges', 'task', 'is', 'to', 'score', 'the', 'clickbaitiness', 'of', 'a', 'given', 'twitter', 'tweet', 'on', 'a', 'scale', 'from', '0', 'no', 'clickbait', 'to', '1', 'strong', 'clickbait', 'unlike', 'most', 'other', 'approaches', 'submitted', 'to', 'the', 'challenge', 'the', 'baseline', 'approach', 'is', 'based', 'on', 'manual', 'feature', 'engineering', 'and', 'does', 'not', 'compete', 'out', 'of', 'the', 'box', 'with', 'many', 'of', 'the', 'deep', 'learningbased', 'approaches', 'we', 'show', 'that', 'scaling', 'up', 'feature', 'selection', 'efforts', 'to', 'heuristically', 'identify', 'betterperforming', 'feature', 'subsets', 'catapults', 'the', 'performance', 'of', 'the', 'baseline', 'classifier', 'to', 'second', 'rank', 'overall', 'beating', '12', 'other', 'competing', 'approaches', 'and', 'improving', 'over', 'the', 'baseline', 'performance', 'by', '20', 'this', 'demonstrates', 'that', 'traditional', 'classification', 'approaches', 'can', 'still', 'keep', 'up', 'with', 'deep', 'learning', 'on', 'this', 'task']] | [-0.03900205878120128, -0.028823366000016375, -0.06121725508737869, 0.03788413148094702, -0.1337131934009463, -0.17996225885012898, 0.07598139732108107, 0.4227133896715176, -0.23090161354277342, -0.34301341084514075, 0.06361102337002988, -0.3367778142789511, -0.13451586370393048, 0.1909424588115158, -0.11264085064194804, 0.08394836160394649, 0.09880225342427065, 0.06640957373627059, -0.06620286134558392, -0.33025354692367764, 0.2820898354966487, 0.08340614514680228, 0.3930325151208465, 0.05093114624371913, 0.11434984925995016, -0.043959851402378694, -0.08635804424517032, -0.01993708498775959, -0.06105617185246555, 0.11550940204948905, 0.3399503270675626, 0.17352817097942777, 0.3740488890499815, -0.3365951870223434, -0.21177219633218342, 0.08941277499332673, 0.12848644740292875, 0.10391300958837932, 0.02945685160885323, -0.3105178489716445, 0.09563443802047784, -0.18112686552578494, -0.01836435790870368, -0.11207554976301869, -0.007635465895529749, -0.02388590497448747, -0.24838437119821513, 0.03423081760617398, 0.09073919563840224, 0.04680720200087494, -0.01114682659074136, -0.1532649585837865, 0.08661349724582214, 0.15963770558426935, 0.09079953166472865, 0.11050957783975998, 0.12098558846949123, -0.19795114638313183, -0.17378477306988854, 0.3657982754191076, -0.08422114445248574, -0.18452322822408823, 0.257114344811815, -0.028248196526423214, -0.1507931088618054, 0.09488516680778951, 0.20844686384804137, 0.09805719583780197, -0.1422076435598332, -0.021783770007946655, -0.016696817732936756, 0.23018362910640755, 0.053797960538035774, -0.04088406056792688, 0.17288943346751134, 0.2793022442946401, 0.06224932978397206, 0.07285728523834044, -0.1457146944892483, -0.04472995098445594, -0.20684991880342013, -0.06754409034523791, -0.17095580194732102, 0.008684481371411371, -0.04786471522657941, -0.1274874876289973, 0.4081919003153352, 0.2507251710044293, 0.1877115487788371, 0.08128041391238922, 0.3165134545268975, -0.0034586491006404515, 0.12620962572130046, 0.07855005463214929, 0.2474680107827555, -0.052574520100157444, 0.1076501594942547, -0.1970352086453519, 0.07139267011244935, 0.05264867632466508] |
1,802.01192 | MOCCA-SURVEY Database I: Assessing GW kick retention fractions for BH-BH
mergers in globular clusters | Anisotropy of gravitational wave (GW) emission results in a net momentum
gained by the black hole (BH) merger product, leading to a recoil velocity up
to $\sim10^3\text{ km s}^{-1}$, which may kick it out of a globular cluster
(GC). We estimate GW kick retention fractions of merger products assuming
different models for BH spin magnitude and orientation (MS0 - random, MS1 -
spin as a function of mass and metalicity, MS2 - constant value of $0.5$). We
check how they depend on BH-BH merger time and properties of the cluster. We
analyze the implications of GW kick retention fractions on intermediate massive
BH (IMBH) formation by repeated mergers in a GC. We also calculate final spin
of the merger product, and investigate how it correlates with effective spin of
the binary. We used data from MOCCA (MOnte Carlo Cluster simulAtor) GC
simulations to get a realistic sample of BH-BH mergers, assigned each BH spin
value according to a studied model, and calculated recoil velocity and final
spin based on most recent theoretical formulas. We discovered that for
physically motivated models, GW kick retention fractions are about $30\%$ and
display small dependence on assumptions about spin, but are much more prone to
cluster properties. In particular, we discovered a strong dependence of GW kick
retention fractions on cluster density. We also show that GW kick retention
fractions are high in final life stages of the cluster, but low at the
beginning. Finally, we derive formulas connecting final spin with effective
spin for primordial binaries, and with maximal effective spin for dynamical
binaries.
| astro-ph.GA | anisotropy of gravitational wave gw emission results in a net momentum gained by the black hole bh merger product leading to a recoil velocity up to sim103text km s1 which may kick it out of a globular cluster gc we estimate gw kick retention fractions of merger products assuming different models for bh spin magnitude and orientation ms0 random ms1 spin as a function of mass and metalicity ms2 constant value of 05 we check how they depend on bhbh merger time and properties of the cluster we analyze the implications of gw kick retention fractions on intermediate massive bh imbh formation by repeated mergers in a gc we also calculate final spin of the merger product and investigate how it correlates with effective spin of the binary we used data from mocca monte carlo cluster simulator gc simulations to get a realistic sample of bhbh mergers assigned each bh spin value according to a studied model and calculated recoil velocity and final spin based on most recent theoretical formulas we discovered that for physically motivated models gw kick retention fractions are about 30 and display small dependence on assumptions about spin but are much more prone to cluster properties in particular we discovered a strong dependence of gw kick retention fractions on cluster density we also show that gw kick retention fractions are high in final life stages of the cluster but low at the beginning finally we derive formulas connecting final spin with effective spin for primordial binaries and with maximal effective spin for dynamical binaries | [['anisotropy', 'of', 'gravitational', 'wave', 'gw', 'emission', 'results', 'in', 'a', 'net', 'momentum', 'gained', 'by', 'the', 'black', 'hole', 'bh', 'merger', 'product', 'leading', 'to', 'a', 'recoil', 'velocity', 'up', 'to', 'sim103text', 'km', 's1', 'which', 'may', 'kick', 'it', 'out', 'of', 'a', 'globular', 'cluster', 'gc', 'we', 'estimate', 'gw', 'kick', 'retention', 'fractions', 'of', 'merger', 'products', 'assuming', 'different', 'models', 'for', 'bh', 'spin', 'magnitude', 'and', 'orientation', 'ms0', 'random', 'ms1', 'spin', 'as', 'a', 'function', 'of', 'mass', 'and', 'metalicity', 'ms2', 'constant', 'value', 'of', '05', 'we', 'check', 'how', 'they', 'depend', 'on', 'bhbh', 'merger', 'time', 'and', 'properties', 'of', 'the', 'cluster', 'we', 'analyze', 'the', 'implications', 'of', 'gw', 'kick', 'retention', 'fractions', 'on', 'intermediate', 'massive', 'bh', 'imbh', 'formation', 'by', 'repeated', 'mergers', 'in', 'a', 'gc', 'we', 'also', 'calculate', 'final', 'spin', 'of', 'the', 'merger', 'product', 'and', 'investigate', 'how', 'it', 'correlates', 'with', 'effective', 'spin', 'of', 'the', 'binary', 'we', 'used', 'data', 'from', 'mocca', 'monte', 'carlo', 'cluster', 'simulator', 'gc', 'simulations', 'to', 'get', 'a', 'realistic', 'sample', 'of', 'bhbh', 'mergers', 'assigned', 'each', 'bh', 'spin', 'value', 'according', 'to', 'a', 'studied', 'model', 'and', 'calculated', 'recoil', 'velocity', 'and', 'final', 'spin', 'based', 'on', 'most', 'recent', 'theoretical', 'formulas', 'we', 'discovered', 'that', 'for', 'physically', 'motivated', 'models', 'gw', 'kick', 'retention', 'fractions', 'are', 'about', '30', 'and', 'display', 'small', 'dependence', 'on', 'assumptions', 'about', 'spin', 'but', 'are', 'much', 'more', 'prone', 'to', 'cluster', 'properties', 'in', 'particular', 'we', 'discovered', 'a', 'strong', 'dependence', 'of', 'gw', 'kick', 'retention', 'fractions', 'on', 'cluster', 'density', 'we', 'also', 'show', 'that', 'gw', 'kick', 'retention', 'fractions', 'are', 'high', 'in', 'final', 'life', 'stages', 'of', 'the', 'cluster', 'but', 'low', 'at', 'the', 'beginning', 'finally', 'we', 'derive', 'formulas', 'connecting', 'final', 'spin', 'with', 'effective', 'spin', 'for', 'primordial', 'binaries', 'and', 'with', 'maximal', 'effective', 'spin', 'for', 'dynamical', 'binaries']] | [-0.1141832117494087, 0.16597484204925395, -0.06994929310506942, 0.12799943127245406, -0.10281262452558321, -0.05331293952330614, 0.06617939307676911, 0.3948063197389883, -0.15037865637043302, -0.32561400840022686, 0.056151251600337744, -0.2792632515589319, -0.030378544911722278, 0.23524809197852467, 0.031020613828484162, -0.007634016249876049, 0.12147493004900356, 0.020269589114513844, -0.14990745908499184, -0.27968749703915524, 0.2963547315847143, 0.06999388772718869, 0.14976779932467854, -0.012482875280430112, 0.12003316012562655, 0.02750330368067765, -0.015262482192839318, -0.015947427580039992, -0.2014598821814499, 0.0047832357385540055, 0.2048130982897957, 0.1359111938303054, 0.19211885380533303, -0.38420364288381614, -0.16127890478710893, 0.05002873709379126, 0.16544977821507545, 0.15719254124784618, -0.09806044356416638, -0.2586686174744914, 0.0992810988748004, -0.3427109067574694, -0.1445573387723706, -0.006778667223411485, 0.09565525234415076, 0.053655850131187864, -0.21277466314982493, 0.17150147788664635, 0.020795422889621103, -0.047226978404309734, -0.09743944465921982, -0.13529699456566358, -0.07727426335175706, 0.055071371174888535, 0.062218065167041606, 0.06350914144286966, 0.22411381913863615, -0.11392601714777517, -0.11170882811490809, 0.35847620788965273, -0.046130924451876984, -0.10890117727296159, 0.2013720803865112, -0.24441228610844395, -0.16633501689670904, 0.11881020648317984, 0.22036717812338633, 0.11178457021484729, -0.1378473143278103, -0.029796818938855524, 0.05169411211557449, 0.2051747215808467, 0.08428113679455934, 0.05122791423828337, 0.3508317099036178, 0.12778251255221, 0.01946425383615195, 0.08073576446350823, -0.16085951410302826, -0.07588931189574562, -0.2036111931921733, -0.09803830109109037, -0.15883338790756546, 0.14969671021163752, -0.16350665589176655, -0.12135192501659466, 0.3341557607100008, 0.13744349383471846, 0.21103514002994833, 0.0562861080844035, 0.24835527545848593, 0.11757453909172796, 0.05114555490340907, 0.0853658632723187, 0.27663628279742447, 0.2219238053157505, 0.038469286361919416, -0.2598170883589377, 0.09192899361131386, 2.3451267745244364e-05] |
1,802.01193 | GW170814: Gravitational wave polarization analysis | To determine the polarization character of gravitational waves, we use strain
data from the GW170814 binary black hole coalescence event detected by the
three LIGO-Virgo observatories, extracting the gravitational wave strain signal
amplitude ratios directly from those data. Employing a geometric approach that
links those ratios to the gravitational wave polarization properties, we find
that there is a range of source sky locations, partially overlapping the
LIGI-Virgo 90% credible range of GW170814 source locations, for which vector
polarization is consistent with the observed amplitude ratios. A Bayesian
inference analysis indicates that the GW170814 data cannot rule out vector
polarization for gravitational waves. Confirmation of a vector polarization
component of gravitational waves would be a sign of post-general relativity
physics.
| gr-qc | to determine the polarization character of gravitational waves we use strain data from the gw170814 binary black hole coalescence event detected by the three ligovirgo observatories extracting the gravitational wave strain signal amplitude ratios directly from those data employing a geometric approach that links those ratios to the gravitational wave polarization properties we find that there is a range of source sky locations partially overlapping the ligivirgo 90 credible range of gw170814 source locations for which vector polarization is consistent with the observed amplitude ratios a bayesian inference analysis indicates that the gw170814 data cannot rule out vector polarization for gravitational waves confirmation of a vector polarization component of gravitational waves would be a sign of postgeneral relativity physics | [['to', 'determine', 'the', 'polarization', 'character', 'of', 'gravitational', 'waves', 'we', 'use', 'strain', 'data', 'from', 'the', 'gw170814', 'binary', 'black', 'hole', 'coalescence', 'event', 'detected', 'by', 'the', 'three', 'ligovirgo', 'observatories', 'extracting', 'the', 'gravitational', 'wave', 'strain', 'signal', 'amplitude', 'ratios', 'directly', 'from', 'those', 'data', 'employing', 'a', 'geometric', 'approach', 'that', 'links', 'those', 'ratios', 'to', 'the', 'gravitational', 'wave', 'polarization', 'properties', 'we', 'find', 'that', 'there', 'is', 'a', 'range', 'of', 'source', 'sky', 'locations', 'partially', 'overlapping', 'the', 'ligivirgo', '90', 'credible', 'range', 'of', 'gw170814', 'source', 'locations', 'for', 'which', 'vector', 'polarization', 'is', 'consistent', 'with', 'the', 'observed', 'amplitude', 'ratios', 'a', 'bayesian', 'inference', 'analysis', 'indicates', 'that', 'the', 'gw170814', 'data', 'can', 'not', 'rule', 'out', 'vector', 'polarization', 'for', 'gravitational', 'waves', 'confirmation', 'of', 'a', 'vector', 'polarization', 'component', 'of', 'gravitational', 'waves', 'would', 'be', 'a', 'sign', 'of', 'postgeneral', 'relativity', 'physics']] | [-0.21135575549692667, 0.12220017694742928, -0.07057538355442405, 0.11625154135052208, -0.1559484111411231, -0.05122885795920586, 0.048578980554897, 0.35464135821548703, -0.21665553389383213, -0.2972309176786607, 0.07365667693191717, -0.3028632610754556, -0.10836768543989468, 0.2242171431915099, 0.09990187014742684, 0.03132438955695501, 0.09234336088215854, -0.025249372760788733, -0.07290959406028767, -0.1538836387056513, 0.2905842757494259, 0.10894256939000192, 0.2649573436586045, -0.035603183351981475, 0.09107866377996265, 0.04502991442920781, -0.05795503307932189, 0.0037702144859280405, -0.07740413707659234, 0.027800518422614502, 0.2915891836311261, 0.21301605787222125, 0.14947109404920028, -0.3573601585851998, -0.25819071119322495, 0.09557621907677595, 0.09600693988418128, 0.16795043127211162, -0.03431556875300946, -0.3455320389191972, 0.035358148482197725, -0.18128518914772557, -0.13898095419286055, 0.004501926614863782, 0.05755836966823192, 0.01869562754560137, -0.25629060600782516, 0.13185050003543622, 0.007887354731058874, -0.017845642729466704, -0.09450080392083951, -0.09061285213492967, -0.07017075924296715, 0.0219343556991207, 0.0972431478669726, 0.11167890752250907, 0.16771286109290204, -0.10864119618904128, -0.1333843633109907, 0.3574972152944748, -0.09660539095203917, -0.1618109411333038, 0.12801697931815909, -0.22413217012199158, -0.1480793440244904, 0.2128651195338794, 0.19433255845821706, 0.09229016534107573, -0.16930357976073102, -0.020258756145099255, 0.03541908897640489, 0.21621231831798032, 0.13432275667442245, 0.04508597532506375, 0.41342055569050695, 0.08428970077896819, -0.0016194394233973086, 0.07837030751642403, -0.21128411161979394, 0.008856554038259162, -0.2925378887781075, -0.040565529415587415, -0.17721399598355805, 0.061337928565394155, -0.12432583907478247, -0.1375479779163172, 0.36480651610382214, 0.15619956038720093, 0.1364245295422856, 0.05636108706670054, 0.2613951670350272, 0.09589364468667876, 0.06545388427789972, 0.043829337740708296, 0.3972855798994042, 0.15310781707149781, 0.09743318867188792, -0.1585976184549264, 0.06975130315189164, -0.016666733092401458] |
1,802.01194 | Anatomy of Leadership in Collective Behaviour | Understanding the mechanics behind the coordinated movement of mobile animal
groups (collective motion) provides key insights into their biology and
ecology, while also yielding algorithms for bio-inspired technologies and
autonomous systems. It is becoming increasingly clear that many mobile animal
groups are composed of heterogeneous individuals with differential levels and
types of influence over group behaviors. The ability to infer this differential
influence, or leadership, is critical to understanding group functioning in
these collective animal systems. Due to the broad interpretation of leadership,
many different measures and mathematical tools are used to describe and infer
"leadership", e.g., position, causality, influence, information flow. But a key
question remains: which, if any, of these concepts actually describes
leadership? We argue that instead of asserting a single definition or notion of
leadership, the complex interaction rules and dynamics typical of a group
implies that leadership itself is not merely a binary classification (leader or
follower), but rather, a complex combination of many different components. In
this paper we develop an anatomy of leadership, identify several principle
components and provide a general mathematical framework for discussing
leadership. With the intricacies of this taxonomy in mind we present a set of
leadership-oriented toy models that should be used as a proving ground for
leadership inference methods going forward. We believe this multifaceted
approach to leadership will enable a broader understanding of leadership and
its inference from data in mobile animal groups and beyond.
| cs.MA physics.soc-ph | understanding the mechanics behind the coordinated movement of mobile animal groups collective motion provides key insights into their biology and ecology while also yielding algorithms for bioinspired technologies and autonomous systems it is becoming increasingly clear that many mobile animal groups are composed of heterogeneous individuals with differential levels and types of influence over group behaviors the ability to infer this differential influence or leadership is critical to understanding group functioning in these collective animal systems due to the broad interpretation of leadership many different measures and mathematical tools are used to describe and infer leadership eg position causality influence information flow but a key question remains which if any of these concepts actually describes leadership we argue that instead of asserting a single definition or notion of leadership the complex interaction rules and dynamics typical of a group implies that leadership itself is not merely a binary classification leader or follower but rather a complex combination of many different components in this paper we develop an anatomy of leadership identify several principle components and provide a general mathematical framework for discussing leadership with the intricacies of this taxonomy in mind we present a set of leadershiporiented toy models that should be used as a proving ground for leadership inference methods going forward we believe this multifaceted approach to leadership will enable a broader understanding of leadership and its inference from data in mobile animal groups and beyond | [['understanding', 'the', 'mechanics', 'behind', 'the', 'coordinated', 'movement', 'of', 'mobile', 'animal', 'groups', 'collective', 'motion', 'provides', 'key', 'insights', 'into', 'their', 'biology', 'and', 'ecology', 'while', 'also', 'yielding', 'algorithms', 'for', 'bioinspired', 'technologies', 'and', 'autonomous', 'systems', 'it', 'is', 'becoming', 'increasingly', 'clear', 'that', 'many', 'mobile', 'animal', 'groups', 'are', 'composed', 'of', 'heterogeneous', 'individuals', 'with', 'differential', 'levels', 'and', 'types', 'of', 'influence', 'over', 'group', 'behaviors', 'the', 'ability', 'to', 'infer', 'this', 'differential', 'influence', 'or', 'leadership', 'is', 'critical', 'to', 'understanding', 'group', 'functioning', 'in', 'these', 'collective', 'animal', 'systems', 'due', 'to', 'the', 'broad', 'interpretation', 'of', 'leadership', 'many', 'different', 'measures', 'and', 'mathematical', 'tools', 'are', 'used', 'to', 'describe', 'and', 'infer', 'leadership', 'eg', 'position', 'causality', 'influence', 'information', 'flow', 'but', 'a', 'key', 'question', 'remains', 'which', 'if', 'any', 'of', 'these', 'concepts', 'actually', 'describes', 'leadership', 'we', 'argue', 'that', 'instead', 'of', 'asserting', 'a', 'single', 'definition', 'or', 'notion', 'of', 'leadership', 'the', 'complex', 'interaction', 'rules', 'and', 'dynamics', 'typical', 'of', 'a', 'group', 'implies', 'that', 'leadership', 'itself', 'is', 'not', 'merely', 'a', 'binary', 'classification', 'leader', 'or', 'follower', 'but', 'rather', 'a', 'complex', 'combination', 'of', 'many', 'different', 'components', 'in', 'this', 'paper', 'we', 'develop', 'an', 'anatomy', 'of', 'leadership', 'identify', 'several', 'principle', 'components', 'and', 'provide', 'a', 'general', 'mathematical', 'framework', 'for', 'discussing', 'leadership', 'with', 'the', 'intricacies', 'of', 'this', 'taxonomy', 'in', 'mind', 'we', 'present', 'a', 'set', 'of', 'leadershiporiented', 'toy', 'models', 'that', 'should', 'be', 'used', 'as', 'a', 'proving', 'ground', 'for', 'leadership', 'inference', 'methods', 'going', 'forward', 'we', 'believe', 'this', 'multifaceted', 'approach', 'to', 'leadership', 'will', 'enable', 'a', 'broader', 'understanding', 'of', 'leadership', 'and', 'its', 'inference', 'from', 'data', 'in', 'mobile', 'animal', 'groups', 'and', 'beyond']] | [-0.11423726740832546, 0.0857494778146811, -0.12872562597541115, 0.09451481896179496, -0.1283179986298493, -0.17769592987444205, 0.05540055490466314, 0.374696570825822, -0.28857364279661574, -0.3284736086539767, 0.07609941011082523, -0.2249304324463167, -0.21259552150481392, 0.17461289885603207, -0.10965831031166175, -0.02354673928810079, 0.07129834830281541, 0.05495364517663637, 0.026598941047483355, -0.2063722937713664, 0.32018052722535684, 0.037977668126644215, 0.3250887320437842, 0.028351310166070544, 0.10675492468005132, 0.013554092420005723, -0.05982223504718063, 0.03346087206950812, -0.06893960008152587, 0.19134477227297514, 0.3254831326733971, 0.19472290187649713, 0.3607781020126734, -0.44078275800549, -0.20900041121156407, 0.10521053708795033, 0.1546907274040589, 0.11570121718419299, -0.015794241167251255, -0.30212972954727063, 0.04686099680568944, -0.1900660001047993, -0.15344665116013542, -0.1089336757552083, 0.034604877077302414, 0.021503549933439427, -0.1842763786516565, 0.014374419387979119, 0.0830721001686992, 0.14152713580143478, -0.07084466022869595, -0.08555189618115797, 0.027317220172235736, 0.21022735280181254, 0.044250180257360536, -0.04134967758144421, 0.16988050578287822, -0.17663614531656735, -0.16594691315512586, 0.43054129676461095, 0.03736414329025046, -0.17883122665807605, 0.2493125087058934, -0.13272381752811938, -0.20225267707790692, 0.0559795699219852, 0.22487345683675275, 0.06107432211804271, -0.1877041901206354, 0.009061029015594253, -0.03215099713187429, 0.1580475495365853, 0.005769086166634715, 0.01592546455362686, 0.23669194230487578, 0.22276271918183388, 0.08824064775893439, 0.036731058823530276, -0.015144370052224725, -0.14474301767449055, -0.22307079806992636, -0.15978152740585622, -0.08514817940308968, 0.051850555215155185, -0.05767464052505333, -0.16261547469823298, 0.38934985334682376, 0.16060466692834025, 0.12395994204505668, 0.05054067775168955, 0.26410359335190886, 0.02286391307872215, 0.05903935934935661, 0.06455626090613237, 0.18593073328505055, 0.08583455395546864, 0.1268411276155674, -0.16583360074665635, 0.1317185821607984, 0.01313336936261835] |
1,802.01195 | A characterisation of the Gaussian free field | We prove that a random distribution in two dimensions which is conformally
invariant and satisfies a natural domain Markov property is a multiple of the
Gaussian free field. This result holds subject only to a fourth moment
assumption.
| math.PR | we prove that a random distribution in two dimensions which is conformally invariant and satisfies a natural domain markov property is a multiple of the gaussian free field this result holds subject only to a fourth moment assumption | [['we', 'prove', 'that', 'a', 'random', 'distribution', 'in', 'two', 'dimensions', 'which', 'is', 'conformally', 'invariant', 'and', 'satisfies', 'a', 'natural', 'domain', 'markov', 'property', 'is', 'a', 'multiple', 'of', 'the', 'gaussian', 'free', 'field', 'this', 'result', 'holds', 'subject', 'only', 'to', 'a', 'fourth', 'moment', 'assumption']] | [-0.19772665315356694, 0.16863467311486602, -0.12017775654155564, 0.09457482178511686, -0.10387665795554456, -0.14083205423268833, -0.030110350851349433, 0.36004087306240473, -0.2930805134145837, -0.18586133797898105, 0.09213105591295875, -0.21250439136240043, -0.11720849965748034, 0.13599807288693755, -0.07661944282192149, 0.0683412846104291, 0.03318863148237333, 0.11724706567627818, -0.03405502050698392, -0.25757126508917855, 0.3771104749880339, -0.0794682256558812, 0.3100178798562602, 0.03686673314261593, 0.1903188490602923, 0.030468539224545423, 0.035793447916052844, 0.024725499072749364, -0.095349419697557, 0.10119591287710998, 0.15130384678119108, 0.08479244827513437, 0.3063502109756595, -0.3288292461319974, -0.2362872322678174, 0.16265326001877456, 0.0630614758150554, 0.07323469150210976, -0.053236935345921665, -0.24219339345826915, 0.15443291250420244, -0.11501255099612631, -0.1921546306019943, -0.019510087140492703, -0.01951445630249126, -0.015221451482686558, -0.4025185200336732, 0.06151690135562891, 0.2080006084257835, 0.05312454737232704, -0.037171957708012904, -0.036024146161875444, 0.028220806025752897, 0.0642651436164191, 0.077687902290276, 0.07646239137178973, 0.08638386661186814, -0.08548990249217145, -0.08287358931327042, 0.37185880757476153, -0.11676717652498107, -0.3113643721628346, 0.15655137018888796, -0.1742320469531574, -0.23476625667688877, 0.0833030991305254, 0.09870488824028718, 0.13736317828787784, -0.2077989517711103, 0.18480520977142365, -0.12253945614946515, 0.18046818678512386, 0.09767681193587027, 5.505207043729331e-06, 0.15112850290576094, 0.070253467567167, 0.16609107595133155, 0.18770109201585383, -0.04600698040112069, -0.13990091690548548, -0.3363856088605979, -0.2003803940882024, -0.2535734217932546, 0.135270402858671, -0.08006342403601402, -0.23202823979878112, 0.3555379234695513, 0.11378668464328114, 0.1799204080414615, 0.12516223639556157, 0.23900396308224453, 0.14650019807250877, 0.023898755739393988, 0.07069974831354461, 0.12198376307558072, 0.18592246042221391, 0.05547788812729873, -0.07569747383853323, 0.04609687262410788, 0.08348153651642956] |
1,802.01196 | A Parameter Free Double Shear Theory for Lath Martensite | A double shear theory is introduced that predicts the commonly observed {5 5
7} habit planes in low-carbon steels. The novelty of this theory is that no
parameter fitting is necessary. Instead, the shearing systems are chosen in
analogy to the original (single shear) phenomenological theory of martensite
crystallography as those that are macroscopically equivalent to twinning. Out
of all the resulting double shear theories, the ones leading to certain {h h k}
habit planes naturally arise as those having small shape strain magnitude and
satisfying a condition of maximal compatibility, thus making any parameter
fitting unnecessary. An interesting finding is that the precise coordinates of
the predicted {h h k} habit planes depend sensitively on the lattice parameters
of the fcc (face-centered cubic) and bcc (body-centered cubic) phases.
Nonetheless, for various realistic lattice parameters in low carbon steels, the
predicted habit planes are near {5 5 7}. The examples of Fe-0.252C and Fe-0.6C
are analyzed in detail along with the resulting orientation relationships which
are consistently close to the Kurdjumov-Sachs model. Furthermore, a MATLAB app
(available at github.com/AntonMu/LathApp) is provided which allows the
application of this model to any other material undergoing an fcc to bcc
transformation.
| cond-mat.mtrl-sci | a double shear theory is introduced that predicts the commonly observed 5 5 7 habit planes in lowcarbon steels the novelty of this theory is that no parameter fitting is necessary instead the shearing systems are chosen in analogy to the original single shear phenomenological theory of martensite crystallography as those that are macroscopically equivalent to twinning out of all the resulting double shear theories the ones leading to certain h h k habit planes naturally arise as those having small shape strain magnitude and satisfying a condition of maximal compatibility thus making any parameter fitting unnecessary an interesting finding is that the precise coordinates of the predicted h h k habit planes depend sensitively on the lattice parameters of the fcc facecentered cubic and bcc bodycentered cubic phases nonetheless for various realistic lattice parameters in low carbon steels the predicted habit planes are near 5 5 7 the examples of fe0252c and fe06c are analyzed in detail along with the resulting orientation relationships which are consistently close to the kurdjumovsachs model furthermore a matlab app available at githubcomantonmulathapp is provided which allows the application of this model to any other material undergoing an fcc to bcc transformation | [['a', 'double', 'shear', 'theory', 'is', 'introduced', 'that', 'predicts', 'the', 'commonly', 'observed', '5', '5', '7', 'habit', 'planes', 'in', 'lowcarbon', 'steels', 'the', 'novelty', 'of', 'this', 'theory', 'is', 'that', 'no', 'parameter', 'fitting', 'is', 'necessary', 'instead', 'the', 'shearing', 'systems', 'are', 'chosen', 'in', 'analogy', 'to', 'the', 'original', 'single', 'shear', 'phenomenological', 'theory', 'of', 'martensite', 'crystallography', 'as', 'those', 'that', 'are', 'macroscopically', 'equivalent', 'to', 'twinning', 'out', 'of', 'all', 'the', 'resulting', 'double', 'shear', 'theories', 'the', 'ones', 'leading', 'to', 'certain', 'h', 'h', 'k', 'habit', 'planes', 'naturally', 'arise', 'as', 'those', 'having', 'small', 'shape', 'strain', 'magnitude', 'and', 'satisfying', 'a', 'condition', 'of', 'maximal', 'compatibility', 'thus', 'making', 'any', 'parameter', 'fitting', 'unnecessary', 'an', 'interesting', 'finding', 'is', 'that', 'the', 'precise', 'coordinates', 'of', 'the', 'predicted', 'h', 'h', 'k', 'habit', 'planes', 'depend', 'sensitively', 'on', 'the', 'lattice', 'parameters', 'of', 'the', 'fcc', 'facecentered', 'cubic', 'and', 'bcc', 'bodycentered', 'cubic', 'phases', 'nonetheless', 'for', 'various', 'realistic', 'lattice', 'parameters', 'in', 'low', 'carbon', 'steels', 'the', 'predicted', 'habit', 'planes', 'are', 'near', '5', '5', '7', 'the', 'examples', 'of', 'fe0252c', 'and', 'fe06c', 'are', 'analyzed', 'in', 'detail', 'along', 'with', 'the', 'resulting', 'orientation', 'relationships', 'which', 'are', 'consistently', 'close', 'to', 'the', 'kurdjumovsachs', 'model', 'furthermore', 'a', 'matlab', 'app', 'available', 'at', 'githubcomantonmulathapp', 'is', 'provided', 'which', 'allows', 'the', 'application', 'of', 'this', 'model', 'to', 'any', 'other', 'material', 'undergoing', 'an', 'fcc', 'to', 'bcc', 'transformation']] | [-0.12999566125993928, 0.15573064131223455, -0.01522774561905326, 0.03922965406314828, -0.08368236089053635, -0.14933729369718676, 0.031314439108619134, 0.39456984725159905, -0.26702314095380597, -0.31735255933390594, 0.09671307532116771, -0.29017105901931733, -0.12845248243270013, 0.1553079872057797, -0.007173087827574748, 0.027656742491019078, 0.002879221242470428, 0.02825908794855842, -0.11658244909575352, -0.29077579167981943, 0.2465240632971892, 0.06645368289035292, 0.30517499866441655, -0.0054704670776398135, 0.04228892939266725, 0.010471823587058447, 0.023354887569514222, 0.036824293095522966, -0.20381430705654052, 0.08545293793177758, 0.21427690338638897, 0.014633725798473909, 0.1680064410663759, -0.4032384569923847, -0.18714503242801397, 0.07587316071089262, 0.09617426215599363, 0.10565245217189957, -0.01844285766964253, -0.18217640741226765, 0.09479560998913188, -0.10845608666228751, -0.14957407136710407, -0.04955739200903246, 0.01110839075050675, 0.012128812518830483, -0.2562119721697691, 0.092158376910326, 0.06681860727989354, 0.09387657900687116, -0.082292505826813, -0.13280217713222672, -0.12990948170101127, 0.05772449656222493, 0.032141826091668546, 0.05783124465692358, 0.15134254671537722, -0.08049119535881358, -0.07826648952367787, 0.4621165906198514, 0.02489680572196868, -0.15253128095124013, 0.18687575274529175, -0.12782582110159685, -0.12294668453769424, 0.17589465286105108, 0.10828381726661554, 0.08008521957627426, -0.1395248150285811, 0.08037880347752108, -0.016080359608317035, 0.1482527679698064, 0.09379696206261333, -0.03536515452313977, 0.19200382360304968, 0.12361353465135042, 0.028492094868292604, 0.11654043720635132, -0.07329062656977046, -0.09398454727055744, -0.3092712196136395, -0.1315197652217765, -0.13745889571101333, -0.01433189938394114, -0.1606349356661294, -0.20596041400642254, 0.32713641508554037, 0.08557255773817021, 0.21307914714412524, -0.026854521105400264, 0.20912515060283626, 0.04819452242615322, 0.09086848141428513, -0.004310671924255215, 0.25915862925064104, 0.13767059631168077, 0.05888993242660012, -0.18424081733832376, 0.09103235176836069, 0.03921940567401739] |
1,802.01197 | On-the-fly Detection of Autogenerated Tweets | Most previous work related to tweet classification have focused on
identifying a given tweet as a spam, or to classify a Twitter user account as a
spammer or a bot. In most cases the tweet classification has taken place
offline, on a pre-collected dataset of tweets. In this paper we present an
\emph{on-the-fly} approach to classify each newly downloaded tweet as
\emph{autogenerated} or not. We define an autogenerated tweet (AGT) as a tweet
where all or parts of the natural language content is generated automatically
by a bot or other type of program.
Our on-the-fly approach makes use of two classifiers. The first classifies a
tweet solely based on the twitter text and the tweet metadata that comes with
every tweet. It is used for tweets posted by unknown users with no available
tweet history. An unknown user also triggers a batch job to start downloading
the missing user timeline information. The second classifier is used for tweets
posted by a user where the user timeline is downloaded and available.
Initially, it will be the first classifier that handles most of the tweets.
This will gradually change and after an initialization phase where we download
historic data for the most active users, we reach a state where the second
classifier handles a vast majority of all the tweets.
A simulation using our on-the-fly detection mechanism indicates that we can
handle Twitter streams with up to 68,000 unique users each day. The bottleneck
is the time required to download new user timelines. The AGT detection is very
accurate. In a set of 5,000 tweets we correctly classified about 98\% of all
AGTs using a subject-wise cross-validation.
| cs.SI | most previous work related to tweet classification have focused on identifying a given tweet as a spam or to classify a twitter user account as a spammer or a bot in most cases the tweet classification has taken place offline on a precollected dataset of tweets in this paper we present an emphonthefly approach to classify each newly downloaded tweet as emphautogenerated or not we define an autogenerated tweet agt as a tweet where all or parts of the natural language content is generated automatically by a bot or other type of program our onthefly approach makes use of two classifiers the first classifies a tweet solely based on the twitter text and the tweet metadata that comes with every tweet it is used for tweets posted by unknown users with no available tweet history an unknown user also triggers a batch job to start downloading the missing user timeline information the second classifier is used for tweets posted by a user where the user timeline is downloaded and available initially it will be the first classifier that handles most of the tweets this will gradually change and after an initialization phase where we download historic data for the most active users we reach a state where the second classifier handles a vast majority of all the tweets a simulation using our onthefly detection mechanism indicates that we can handle twitter streams with up to 68000 unique users each day the bottleneck is the time required to download new user timelines the agt detection is very accurate in a set of 5000 tweets we correctly classified about 98 of all agts using a subjectwise crossvalidation | [['most', 'previous', 'work', 'related', 'to', 'tweet', 'classification', 'have', 'focused', 'on', 'identifying', 'a', 'given', 'tweet', 'as', 'a', 'spam', 'or', 'to', 'classify', 'a', 'twitter', 'user', 'account', 'as', 'a', 'spammer', 'or', 'a', 'bot', 'in', 'most', 'cases', 'the', 'tweet', 'classification', 'has', 'taken', 'place', 'offline', 'on', 'a', 'precollected', 'dataset', 'of', 'tweets', 'in', 'this', 'paper', 'we', 'present', 'an', 'emphonthefly', 'approach', 'to', 'classify', 'each', 'newly', 'downloaded', 'tweet', 'as', 'emphautogenerated', 'or', 'not', 'we', 'define', 'an', 'autogenerated', 'tweet', 'agt', 'as', 'a', 'tweet', 'where', 'all', 'or', 'parts', 'of', 'the', 'natural', 'language', 'content', 'is', 'generated', 'automatically', 'by', 'a', 'bot', 'or', 'other', 'type', 'of', 'program', 'our', 'onthefly', 'approach', 'makes', 'use', 'of', 'two', 'classifiers', 'the', 'first', 'classifies', 'a', 'tweet', 'solely', 'based', 'on', 'the', 'twitter', 'text', 'and', 'the', 'tweet', 'metadata', 'that', 'comes', 'with', 'every', 'tweet', 'it', 'is', 'used', 'for', 'tweets', 'posted', 'by', 'unknown', 'users', 'with', 'no', 'available', 'tweet', 'history', 'an', 'unknown', 'user', 'also', 'triggers', 'a', 'batch', 'job', 'to', 'start', 'downloading', 'the', 'missing', 'user', 'timeline', 'information', 'the', 'second', 'classifier', 'is', 'used', 'for', 'tweets', 'posted', 'by', 'a', 'user', 'where', 'the', 'user', 'timeline', 'is', 'downloaded', 'and', 'available', 'initially', 'it', 'will', 'be', 'the', 'first', 'classifier', 'that', 'handles', 'most', 'of', 'the', 'tweets', 'this', 'will', 'gradually', 'change', 'and', 'after', 'an', 'initialization', 'phase', 'where', 'we', 'download', 'historic', 'data', 'for', 'the', 'most', 'active', 'users', 'we', 'reach', 'a', 'state', 'where', 'the', 'second', 'classifier', 'handles', 'a', 'vast', 'majority', 'of', 'all', 'the', 'tweets', 'a', 'simulation', 'using', 'our', 'onthefly', 'detection', 'mechanism', 'indicates', 'that', 'we', 'can', 'handle', 'twitter', 'streams', 'with', 'up', 'to', '68000', 'unique', 'users', 'each', 'day', 'the', 'bottleneck', 'is', 'the', 'time', 'required', 'to', 'download', 'new', 'user', 'timelines', 'the', 'agt', 'detection', 'is', 'very', 'accurate', 'in', 'a', 'set', 'of', '5000', 'tweets', 'we', 'correctly', 'classified', 'about', '98', 'of', 'all', 'agts', 'using', 'a', 'subjectwise', 'crossvalidation']] | [-0.0868635719474268, 0.015527566610484534, -0.05578037674935973, 0.09155194567660253, -0.18356063696493868, -0.1814445025537519, 0.1434127549184589, 0.3952427489378298, -0.24075853040695244, -0.32237811393261995, 0.10426051029486082, -0.3886923442238613, -0.11492704212929204, 0.16815050337417609, -0.08845827494652066, -0.01311173231635407, 0.08245424818340004, 0.16610861601657234, 0.014221482124412432, -0.3810409992977785, 0.30376214815666625, 0.05816735684450524, 0.269565520588966, 0.02660372603499769, 0.09949176794179948, 0.003357725144322852, -0.11194142632645226, -0.034946359221876, -0.05342055132985693, 0.11113332737552221, 0.361587085561683, 0.24615557821851006, 0.31953292420503737, -0.3627914548822125, -0.19040324249619836, 0.05492853542091325, 0.14640438099441405, 0.11641180932822275, -0.02222466005332535, -0.3648665615918991, 0.12391249210957218, -0.2301826274214203, 0.025950471122461537, -0.05848657780819956, 0.02219661739689079, -0.01522220772184322, -0.24254032057840103, 0.021988822267838472, 0.023619309544515358, 0.088962760003222, -0.03312158451915499, -0.052604210980729586, -0.019767746092196937, 0.22001350109563003, 0.07107066278010332, 0.039410962810079046, 0.16535207318541806, -0.14350783238136072, -0.1276563138999336, 0.40994443998737123, -0.055028459434705676, -0.15812228715495782, 0.14336123094664585, -0.0332665459239198, -0.17172527494874565, 0.11074816059622475, 0.2302701454335714, 0.11995849864701193, -0.21408037015798448, -0.07935593844804852, -0.09383596278391504, 0.26141695992041875, 0.07004295234047972, -0.06137624688363651, 0.18818084191469311, 0.21824138395844356, 0.026189388239050888, 0.1168138786483991, -0.12289899643099703, 0.017303242943907046, -0.26130415507941507, -0.13611976412566412, -0.2169067894197617, 0.012139821960772679, -0.09006141339924557, -0.13184577437299166, 0.42860807289766584, 0.20312483854393257, 0.20432003426557296, 0.07848962329958073, 0.2903750349937849, 0.009522369895902931, 0.08574336693581085, 0.1269458600667456, 0.0926714458516525, -0.0647597269502619, 0.16958728690138636, -0.09487385359127931, 0.1218901193655363, 0.03657837517333545] |
1,802.01198 | Why do Things Fall? | This is the first of several short notes in which I will describe phenomena
that illustrate GR=QM. In it I explain that the gravitational attraction that a
black hole exerts on a nearby test object is a consequence of a fundamental law
of quantum mechanics---the tendency for complexity to grow. It will also be
shown that the Einstein bound on velocities is closely related to the
quantum-chaos bound of Maldacena, Shenker, and Stanford.
| hep-th | this is the first of several short notes in which i will describe phenomena that illustrate grqm in it i explain that the gravitational attraction that a black hole exerts on a nearby test object is a consequence of a fundamental law of quantum mechanicsthe tendency for complexity to grow it will also be shown that the einstein bound on velocities is closely related to the quantumchaos bound of maldacena shenker and stanford | [['this', 'is', 'the', 'first', 'of', 'several', 'short', 'notes', 'in', 'which', 'i', 'will', 'describe', 'phenomena', 'that', 'illustrate', 'grqm', 'in', 'it', 'i', 'explain', 'that', 'the', 'gravitational', 'attraction', 'that', 'a', 'black', 'hole', 'exerts', 'on', 'a', 'nearby', 'test', 'object', 'is', 'a', 'consequence', 'of', 'a', 'fundamental', 'law', 'of', 'quantum', 'mechanicsthe', 'tendency', 'for', 'complexity', 'to', 'grow', 'it', 'will', 'also', 'be', 'shown', 'that', 'the', 'einstein', 'bound', 'on', 'velocities', 'is', 'closely', 'related', 'to', 'the', 'quantumchaos', 'bound', 'of', 'maldacena', 'shenker', 'and', 'stanford']] | [-0.10753983857182288, 0.12910191512758462, -0.1558412299571398, 0.11332293142544919, -0.10343244574754171, -0.1396444770179584, -0.006504725372995919, 0.28264372395745047, -0.19886031458285494, -0.2648634578717846, 0.08697022131355611, -0.2885344629241547, -0.19994054202147774, 0.25218512758638867, -0.10817169870289278, -0.027929387763667275, 0.04054078342504537, 0.07848993359579587, -0.032407391239219985, -0.2883624673991556, 0.3208441047496359, 0.09169350276392897, 0.2717375588196684, 0.10479197326496663, 0.0900408668102513, -0.08089092158725564, 0.024487876661226784, 0.0572425380454097, -0.14172323087015531, 0.09907784446759123, 0.21367817114986165, 0.15985605488596877, 0.27178111469084526, -0.37531257061366463, -0.16584072618837087, 0.045507324387280036, 0.12939517206551743, 0.15284689151006423, -0.06779432357420069, -0.286111899231836, 0.08770739963986504, -0.19588620624911618, -0.13431539294690314, -0.03180114553034515, 0.11746340461442588, 0.024431164730602587, -0.19914134833174693, 0.05949677719405039, 0.12418866789781711, -0.0382930449518362, -0.0659545559147504, -0.02862407461228505, 0.014238188613835774, 0.0882164280677975, 0.08051580298219768, 0.05106521723136096, 0.10202854132594567, -0.11505363709424478, -0.12138532159823767, 0.3834655865712065, -0.0733908819211778, -0.15303925740939212, 0.22401407025229764, -0.18984947963552157, -0.15949847696112915, 0.06731062678908797, 0.17190390497341124, 0.12073345952161053, -0.1393798009794153, 0.08356153514993732, -0.07391522561702517, 0.16027243952201287, 0.1009990291532234, 0.021323426462657436, 0.2793177251743389, 0.1415366325658602, 0.07072732789756757, 0.12824091513175517, -0.06182012200014482, -0.09135489561922953, -0.32522141970169377, -0.18776103292926358, -0.2193974926641447, 0.09549929479687987, -0.03238833779579809, -0.1334943078260731, 0.32876562603919857, 0.16856370520004085, 0.19581027191893105, 0.03354977490544372, 0.22020782406350048, 0.0663825872855943, 0.06241059148500503, 0.06657364363060661, 0.3069474948176616, 0.12106064453878453, 0.08318684082215941, -0.23617085930563406, 0.005909805946891576, 0.09584593193107088] |
1,802.01199 | Does Nearby Open Flux Affect the Eruptivity of Solar Active Regions? | The most energetic solar flares are typically associated with the ejection of
a cloud of coronal material into the heliosphere in the form of a coronal mass
ejection (CME). However, there exist large flares which are not accompanied by
a CME. The existence of these non-eruptive flares raises the question of
whether such flares suffer from a lack of access to nearby open fields in the
vicinity above the flare (reconnection) site. In this study, we use a sample of
56 flares from Sunspot Cycles 23 and 24 to test whether active regions that
produce eruptive X-class flares are preferentially located near coronal
magnetic field domains that are open to the heliosphere, as inferred from a
potential field source surface model. The study shows that X-class flares
having access to open fields are eruptive at a higher rate than those for which
access is lacking. The significance of this result should be moderated due to
the small number of non-eruptive X-class flares in the sample, based on the
associated Bayes factor.
| astro-ph.SR | the most energetic solar flares are typically associated with the ejection of a cloud of coronal material into the heliosphere in the form of a coronal mass ejection cme however there exist large flares which are not accompanied by a cme the existence of these noneruptive flares raises the question of whether such flares suffer from a lack of access to nearby open fields in the vicinity above the flare reconnection site in this study we use a sample of 56 flares from sunspot cycles 23 and 24 to test whether active regions that produce eruptive xclass flares are preferentially located near coronal magnetic field domains that are open to the heliosphere as inferred from a potential field source surface model the study shows that xclass flares having access to open fields are eruptive at a higher rate than those for which access is lacking the significance of this result should be moderated due to the small number of noneruptive xclass flares in the sample based on the associated bayes factor | [['the', 'most', 'energetic', 'solar', 'flares', 'are', 'typically', 'associated', 'with', 'the', 'ejection', 'of', 'a', 'cloud', 'of', 'coronal', 'material', 'into', 'the', 'heliosphere', 'in', 'the', 'form', 'of', 'a', 'coronal', 'mass', 'ejection', 'cme', 'however', 'there', 'exist', 'large', 'flares', 'which', 'are', 'not', 'accompanied', 'by', 'a', 'cme', 'the', 'existence', 'of', 'these', 'noneruptive', 'flares', 'raises', 'the', 'question', 'of', 'whether', 'such', 'flares', 'suffer', 'from', 'a', 'lack', 'of', 'access', 'to', 'nearby', 'open', 'fields', 'in', 'the', 'vicinity', 'above', 'the', 'flare', 'reconnection', 'site', 'in', 'this', 'study', 'we', 'use', 'a', 'sample', 'of', '56', 'flares', 'from', 'sunspot', 'cycles', '23', 'and', '24', 'to', 'test', 'whether', 'active', 'regions', 'that', 'produce', 'eruptive', 'xclass', 'flares', 'are', 'preferentially', 'located', 'near', 'coronal', 'magnetic', 'field', 'domains', 'that', 'are', 'open', 'to', 'the', 'heliosphere', 'as', 'inferred', 'from', 'a', 'potential', 'field', 'source', 'surface', 'model', 'the', 'study', 'shows', 'that', 'xclass', 'flares', 'having', 'access', 'to', 'open', 'fields', 'are', 'eruptive', 'at', 'a', 'higher', 'rate', 'than', 'those', 'for', 'which', 'access', 'is', 'lacking', 'the', 'significance', 'of', 'this', 'result', 'should', 'be', 'moderated', 'due', 'to', 'the', 'small', 'number', 'of', 'noneruptive', 'xclass', 'flares', 'in', 'the', 'sample', 'based', 'on', 'the', 'associated', 'bayes', 'factor']] | [-0.11356307015541875, 0.21474236770865252, 0.035238639247325954, 0.17477200671210777, -0.06839086799419414, -0.05829520526543608, 0.06462088706549148, 0.4269276554233324, -0.16880881377803544, -0.4002663114963219, 0.08583105526515963, -0.271413651093492, -0.08629865910618277, 0.2529295053222756, -0.056544244655323546, -0.03320428249439802, 0.1346325697857282, -0.004271515721335397, -0.006593655755373034, -0.20440949521664725, 0.27812021389080765, 0.07930193553891099, 0.1680967119135703, -0.01637284789909745, 0.034809754336285484, -0.14376704680749722, -0.005589438246955213, -0.008345759460125227, -0.06631533953844405, 0.07521337744567477, 0.1863554071455279, 0.1250068942637711, 0.27328882212832306, -0.41961332951896696, -0.2538689712936614, 0.03169432257947836, 0.1784494652056097, -0.02643059339641174, -0.03804106437750923, -0.23684032203640507, 0.09318368091678236, -0.12923515569527597, -0.11812236089509917, 0.09680962983017777, 0.029210885054001597, 0.024445298622765343, -0.2778144246212354, 0.1041358508365719, 0.038575401386703574, 0.13198559059235893, -0.11513297441306562, -0.015015232386285363, -0.04126618182823084, 0.13332948268102537, 0.16135746614574537, 0.1108077767064076, 0.19732835572158472, -0.12619575818357934, -0.1069925598860092, 0.3666160987984193, 0.026217699471206883, -0.025200840466988016, 0.22166118558567038, -0.2655741902577489, -0.18507898939577372, 0.2386553025592053, 0.18905907348397444, 0.058446800024439284, -0.1546432652254725, -0.009010021961825132, -0.05347257237118936, 0.1148779572958497, 0.06687875912246997, 0.0264084624611277, 0.292270024464335, 0.10465295429134534, 0.05340425804126681, 0.14086071524853486, -0.1970067578769556, -0.05316811331890916, -0.29083038924251037, -0.11731095148838665, -0.13731425972954964, 0.11292664636594, -0.0506107738861584, -0.26454371517818226, 0.4097469995065173, 0.17776240799841553, 0.23296527845556275, -0.07328518354388401, 0.22027370575488658, 0.07455230465809656, 0.09966187576670744, 0.2008077405877847, 0.29173740250608554, 0.17450767711393142, 0.15122552097595313, -0.18009561971367788, 0.07170241670301783, 0.06716913715745622] |
1,802.012 | Superdiffusion on complex networks: the role of shortcuts and long-range
interactions | This work addresses the superdiffusive motion of a discrete time random
walker on ordered discrete substrates and complex networks with the presence of
long-range interactions (LRIs). In ordered regular lattices, where LRIs have a
clear geometrical meaning, their presence allow for hoppings between more
distant sites, yet with a smaller probability. In such cases, it is found that
LRIs do not affect the dependency of the mean square displacement (MSD)
traveled by the walker: exact analytical results for the the cycle graph within
the Markov chain framework shows that MSD follows the same linearly increasing
behavior with time when LRIs are absent, independently of the strength of LRI.
This contrasts with the superdiffusive scenario in complex networks. When they
have very short diameter ($\sim \log N$), the analysis of the time dependency
of MSD becomes quite difficult, as it saturates very quickly even when LRIs are
absent. The presence of a faster than linearly increasing growth phase can be
noticed, but it can hardly be measured with precision. This effect is
sidestepped on small-world Newman-Watts (NW) networks, where the network
diameter can be controlled by the number of new links (shortcuts) that are
added to the cycle graph. The time duration $t_f$ of the superdiffusive regime
and the power law exponent can be adequately evaluated by numerical methods.
They depend on the number of nodes and shortcuts, as well as the strength of
LRIs. Although the later causes a strong reduction in $t_f$ when shortcuts are
present, their presence by itself is not sufficient to trigger a superdiffusive
behavior.
| physics.soc-ph | this work addresses the superdiffusive motion of a discrete time random walker on ordered discrete substrates and complex networks with the presence of longrange interactions lris in ordered regular lattices where lris have a clear geometrical meaning their presence allow for hoppings between more distant sites yet with a smaller probability in such cases it is found that lris do not affect the dependency of the mean square displacement msd traveled by the walker exact analytical results for the the cycle graph within the markov chain framework shows that msd follows the same linearly increasing behavior with time when lris are absent independently of the strength of lri this contrasts with the superdiffusive scenario in complex networks when they have very short diameter sim log n the analysis of the time dependency of msd becomes quite difficult as it saturates very quickly even when lris are absent the presence of a faster than linearly increasing growth phase can be noticed but it can hardly be measured with precision this effect is sidestepped on smallworld newmanwatts nw networks where the network diameter can be controlled by the number of new links shortcuts that are added to the cycle graph the time duration t_f of the superdiffusive regime and the power law exponent can be adequately evaluated by numerical methods they depend on the number of nodes and shortcuts as well as the strength of lris although the later causes a strong reduction in t_f when shortcuts are present their presence by itself is not sufficient to trigger a superdiffusive behavior | [['this', 'work', 'addresses', 'the', 'superdiffusive', 'motion', 'of', 'a', 'discrete', 'time', 'random', 'walker', 'on', 'ordered', 'discrete', 'substrates', 'and', 'complex', 'networks', 'with', 'the', 'presence', 'of', 'longrange', 'interactions', 'lris', 'in', 'ordered', 'regular', 'lattices', 'where', 'lris', 'have', 'a', 'clear', 'geometrical', 'meaning', 'their', 'presence', 'allow', 'for', 'hoppings', 'between', 'more', 'distant', 'sites', 'yet', 'with', 'a', 'smaller', 'probability', 'in', 'such', 'cases', 'it', 'is', 'found', 'that', 'lris', 'do', 'not', 'affect', 'the', 'dependency', 'of', 'the', 'mean', 'square', 'displacement', 'msd', 'traveled', 'by', 'the', 'walker', 'exact', 'analytical', 'results', 'for', 'the', 'the', 'cycle', 'graph', 'within', 'the', 'markov', 'chain', 'framework', 'shows', 'that', 'msd', 'follows', 'the', 'same', 'linearly', 'increasing', 'behavior', 'with', 'time', 'when', 'lris', 'are', 'absent', 'independently', 'of', 'the', 'strength', 'of', 'lri', 'this', 'contrasts', 'with', 'the', 'superdiffusive', 'scenario', 'in', 'complex', 'networks', 'when', 'they', 'have', 'very', 'short', 'diameter', 'sim', 'log', 'n', 'the', 'analysis', 'of', 'the', 'time', 'dependency', 'of', 'msd', 'becomes', 'quite', 'difficult', 'as', 'it', 'saturates', 'very', 'quickly', 'even', 'when', 'lris', 'are', 'absent', 'the', 'presence', 'of', 'a', 'faster', 'than', 'linearly', 'increasing', 'growth', 'phase', 'can', 'be', 'noticed', 'but', 'it', 'can', 'hardly', 'be', 'measured', 'with', 'precision', 'this', 'effect', 'is', 'sidestepped', 'on', 'smallworld', 'newmanwatts', 'nw', 'networks', 'where', 'the', 'network', 'diameter', 'can', 'be', 'controlled', 'by', 'the', 'number', 'of', 'new', 'links', 'shortcuts', 'that', 'are', 'added', 'to', 'the', 'cycle', 'graph', 'the', 'time', 'duration', 't_f', 'of', 'the', 'superdiffusive', 'regime', 'and', 'the', 'power', 'law', 'exponent', 'can', 'be', 'adequately', 'evaluated', 'by', 'numerical', 'methods', 'they', 'depend', 'on', 'the', 'number', 'of', 'nodes', 'and', 'shortcuts', 'as', 'well', 'as', 'the', 'strength', 'of', 'lris', 'although', 'the', 'later', 'causes', 'a', 'strong', 'reduction', 'in', 't_f', 'when', 'shortcuts', 'are', 'present', 'their', 'presence', 'by', 'itself', 'is', 'not', 'sufficient', 'to', 'trigger', 'a', 'superdiffusive', 'behavior']] | [-0.1393939366147936, 0.2149224361372414, -0.06217598348867659, 0.054680881209124926, -0.04664697708552128, -0.19806989461082863, 0.035914849465655374, 0.4185788459252408, -0.25996267306607157, -0.29856195042636174, 0.09357653775982358, -0.27442389177554016, -0.16015122832036416, 0.17783479787756304, -0.0339968778709, -0.010121803748705442, 0.056044927168939565, 0.04566144135920645, -0.008313039522689972, -0.2605289297511452, 0.23079055462852407, 0.07905806989398242, 0.27056793323861844, 0.030795171143555417, 0.041569420165278044, -0.008351264388433524, 0.01401873493772072, 0.07837512935957175, -0.10272836329684117, 0.009222142752940933, 0.2041200006787007, 0.04441493391130132, 0.26090815429068726, -0.4230008596144473, -0.21461122178222666, 0.13400058226091752, 0.1954737337482338, 0.09279091595078758, 0.021355836945898297, -0.29166712274623885, 0.07884644291769986, -0.13283863043390992, -0.1272168113646892, -0.04717550669081193, 0.06208661335977118, 0.06855321881153646, -0.22018359880355046, 0.12209108282369652, 0.06711013872638474, 0.06900044687049155, 0.010085482745540138, -0.067112403134294, -0.029869706985724075, 0.13871610782452604, 0.058196272558090366, 0.03433172716705208, 0.12698708061024575, -0.12417735176027886, -0.07454044431534283, 0.3563396666148627, -0.05673724987741216, -0.16338999605194654, 0.19736030222092932, -0.16986335286129856, -0.11116485435040992, 0.15797854711042725, 0.14090456435651047, 0.10665982580374819, -0.12022102322958907, 0.06498493080438227, -0.008996810120418955, 0.21414614691485337, 0.04450063632610596, 0.04946353756481041, 0.1629397598505164, 0.1752645738074973, 0.09558474247947939, 0.12045292022348558, -0.10265627005062215, -0.10844130240898565, -0.2543934121625462, -0.10637977978342274, -0.23876943267633757, 0.06490570400505773, -0.15414210933474798, -0.15388375322215805, 0.36116970105781704, 0.12387416221264248, 0.21818607435274048, 0.10615736742065249, 0.25072646365432666, 0.12257293367989426, 0.08378349099592323, 0.09474627995453631, 0.23274023381950024, 0.0987545402080511, 0.13512208488361702, -0.21128889491680908, 0.13680531964079984, 0.015894155062979597] |
1,802.01201 | Moduli of non-standard Nikulin surfaces in low genus | Primitively polarized genus $g$ Nikulin surfaces $(S,M,H)$ are of two types,
that we call standard and non-standard depending on whether the lattice
embedding $\mathbb{Z}[H] \oplus_{\perp} \mathbf{N} \subset \rm{Pic}(S)$ is
primitive. Here $H$ is the genus $g$ polarization and $\mathbf{N}$ is the
Nikulin lattice. We concentrate on the non-standard case, which only occurs in
odd genus. In particular, we study the birational geometry of the moduli space
of non-standard Nikulin surfaces of genus $g$ and prove its rationality for
$g=7,11$ and the existence of a rational double cover of it when $g=9$.
Furthermore, if $(S,M,H)$ is general in the above moduli space and $(C,M|_C)$
is a general Prym curve in $|H|$, we determine the dimension of the family of
non-standard Nikulin surfaces of genus $g$ containing $(C, M|_C)$ for $3\leq
g\leq 11$; this completes the study of the Prym-Nikulin map initiated in our
previous work.
| math.AG | primitively polarized genus g nikulin surfaces smh are of two types that we call standard and nonstandard depending on whether the lattice embedding mathbbzh oplus_perp mathbfn subset rmpics is primitive here h is the genus g polarization and mathbfn is the nikulin lattice we concentrate on the nonstandard case which only occurs in odd genus in particular we study the birational geometry of the moduli space of nonstandard nikulin surfaces of genus g and prove its rationality for g711 and the existence of a rational double cover of it when g9 furthermore if smh is general in the above moduli space and cm_c is a general prym curve in h we determine the dimension of the family of nonstandard nikulin surfaces of genus g containing c m_c for 3leq gleq 11 this completes the study of the prymnikulin map initiated in our previous work | [['primitively', 'polarized', 'genus', 'g', 'nikulin', 'surfaces', 'smh', 'are', 'of', 'two', 'types', 'that', 'we', 'call', 'standard', 'and', 'nonstandard', 'depending', 'on', 'whether', 'the', 'lattice', 'embedding', 'mathbbzh', 'oplus_perp', 'mathbfn', 'subset', 'rmpics', 'is', 'primitive', 'here', 'h', 'is', 'the', 'genus', 'g', 'polarization', 'and', 'mathbfn', 'is', 'the', 'nikulin', 'lattice', 'we', 'concentrate', 'on', 'the', 'nonstandard', 'case', 'which', 'only', 'occurs', 'in', 'odd', 'genus', 'in', 'particular', 'we', 'study', 'the', 'birational', 'geometry', 'of', 'the', 'moduli', 'space', 'of', 'nonstandard', 'nikulin', 'surfaces', 'of', 'genus', 'g', 'and', 'prove', 'its', 'rationality', 'for', 'g711', 'and', 'the', 'existence', 'of', 'a', 'rational', 'double', 'cover', 'of', 'it', 'when', 'g9', 'furthermore', 'if', 'smh', 'is', 'general', 'in', 'the', 'above', 'moduli', 'space', 'and', 'cm_c', 'is', 'a', 'general', 'prym', 'curve', 'in', 'h', 'we', 'determine', 'the', 'dimension', 'of', 'the', 'family', 'of', 'nonstandard', 'nikulin', 'surfaces', 'of', 'genus', 'g', 'containing', 'c', 'm_c', 'for', '3leq', 'gleq', '11', 'this', 'completes', 'the', 'study', 'of', 'the', 'prymnikulin', 'map', 'initiated', 'in', 'our', 'previous', 'work']] | [-0.18988410884381404, 0.1407713309362797, -0.06395734767096915, 0.05997734976200653, -0.08833550517946216, -0.14204001840802707, 0.030257574774857077, 0.3412103243970445, -0.27793957845507455, -0.22340603249945812, 0.07118819954838337, -0.2711884198643799, -0.14046934541381365, 0.21027358044604105, -0.13048526137468539, -0.04908349299512338, 0.03812747469304928, 0.07502875235929553, -0.07494830219574007, -0.3477439182145255, 0.42974464312179145, -0.09801964908838272, 0.17254849264364955, 0.07357886030139135, 0.05477616388151156, 0.024498101201191145, 0.0220593789958262, -0.04021720378701243, -0.19741154998467078, 0.11286188571747126, 0.246075168923874, 0.04982873240785141, 0.12241552969457449, -0.3293121893158449, -0.19590718817697572, 0.21816057469363193, 0.07025244755869997, 0.018842808807468307, 0.03762108635356916, -0.180841291647604, 0.09846069010506783, -0.09956264402218429, -0.17677520612986491, -0.0302073476303901, 0.09994380726878133, -0.01725287788015391, -0.18887528122535774, -0.018327580932860396, 0.10134288524942739, 0.1449164555640891, 0.013325000553491659, -0.15953683981372577, -0.12774850323995843, 0.05868846059830893, 0.009706687000912748, 0.10280560225115291, 0.032992306780735295, -0.11528827819939969, -0.06003157712153292, 0.36959347964854844, -0.09192653979241316, -0.18421329472080938, 0.12449088359384665, -0.18635939760798856, -0.19138405199628322, 0.12541809084276404, 0.14210878454531276, 0.22899734566453844, -0.01446516335178915, 0.2501673954052551, -0.1193834989165355, 0.12056046936694266, 0.12770886588176447, -0.0649219252293863, 0.13230060771207458, 0.13098417894715178, 0.06820651638720716, 0.1314426269348977, -0.06543306190454001, 0.016306933315354398, -0.3925646765955857, -0.21096118686920298, -0.10514179225345807, 0.1537675616431183, -0.0942536404367794, -0.15980933935248426, 0.4111746130444642, 0.03490024451831622, 0.1571109349506774, 0.07206696150907581, 0.19296353551825243, 0.012384910326883464, -0.0009123870279706482, 0.07588766014710667, 0.177804357518575, 0.16691288147786898, -0.07569053004096661, -0.1593827287583346, -0.03107907832766484, 0.1715932010789402] |
1,802.01202 | On the design of random metasurface devices | Metasurfaces are generally designed by placing scatterers in periodic or
pseudo-periodic grids. We propose and discuss design rules for functional
metasurfaces with randomly placed anisotropic elements. By analyzing the
focusing performance of random metasurface lenses as a function of their
density and the density of the phase-maps used to design them, we find that the
performance of 1D metasurfaces is mostly governed by their density while 2D
metasurfaces strongly depend on both the density and the near-field coupling
configuration of the surface. The proposed approach is used to design
all-polarization random metalenses at near infrared frequencies. Challenges, as
well as opportunities of random metasurfaces compared to periodic ones are
discussed. Our results pave the way to new approaches in the design of
nanophotonic structures and devices from lenses to solar energy concentrators.
| physics.optics | metasurfaces are generally designed by placing scatterers in periodic or pseudoperiodic grids we propose and discuss design rules for functional metasurfaces with randomly placed anisotropic elements by analyzing the focusing performance of random metasurface lenses as a function of their density and the density of the phasemaps used to design them we find that the performance of 1d metasurfaces is mostly governed by their density while 2d metasurfaces strongly depend on both the density and the nearfield coupling configuration of the surface the proposed approach is used to design allpolarization random metalenses at near infrared frequencies challenges as well as opportunities of random metasurfaces compared to periodic ones are discussed our results pave the way to new approaches in the design of nanophotonic structures and devices from lenses to solar energy concentrators | [['metasurfaces', 'are', 'generally', 'designed', 'by', 'placing', 'scatterers', 'in', 'periodic', 'or', 'pseudoperiodic', 'grids', 'we', 'propose', 'and', 'discuss', 'design', 'rules', 'for', 'functional', 'metasurfaces', 'with', 'randomly', 'placed', 'anisotropic', 'elements', 'by', 'analyzing', 'the', 'focusing', 'performance', 'of', 'random', 'metasurface', 'lenses', 'as', 'a', 'function', 'of', 'their', 'density', 'and', 'the', 'density', 'of', 'the', 'phasemaps', 'used', 'to', 'design', 'them', 'we', 'find', 'that', 'the', 'performance', 'of', '1d', 'metasurfaces', 'is', 'mostly', 'governed', 'by', 'their', 'density', 'while', '2d', 'metasurfaces', 'strongly', 'depend', 'on', 'both', 'the', 'density', 'and', 'the', 'nearfield', 'coupling', 'configuration', 'of', 'the', 'surface', 'the', 'proposed', 'approach', 'is', 'used', 'to', 'design', 'allpolarization', 'random', 'metalenses', 'at', 'near', 'infrared', 'frequencies', 'challenges', 'as', 'well', 'as', 'opportunities', 'of', 'random', 'metasurfaces', 'compared', 'to', 'periodic', 'ones', 'are', 'discussed', 'our', 'results', 'pave', 'the', 'way', 'to', 'new', 'approaches', 'in', 'the', 'design', 'of', 'nanophotonic', 'structures', 'and', 'devices', 'from', 'lenses', 'to', 'solar', 'energy', 'concentrators']] | [-0.12830151570783146, 0.1299576725782329, -0.037415941828819174, -0.022682245502618093, -0.08571732389022603, -0.14269571898874778, 0.023452563966688423, 0.4851981296794105, -0.20534858057446037, -0.31060046252602613, 0.08004250153294899, -0.2882715507289608, -0.21886521732285336, 0.23632766191584578, -0.035588398230980145, 0.12951440949042733, -0.021764058523761634, -0.08410822004364192, -0.040451231588545536, -0.19446356607803664, 0.3027000242119072, 0.06310442881303206, 0.3295773736890832, 0.015020357643943707, 0.059427702554167454, 0.019268860356199718, -0.005720771172880159, 0.030056294025355625, -0.1022849946466869, 0.17237752309701768, 0.26025706519664243, 0.03057245320804019, 0.2273846516973972, -0.4684847628285412, -0.23251888049297206, -0.0038366662089549405, 0.12721456029942926, 0.08704651146949419, -0.09826975956271253, -0.30011813066729154, 0.07121518736292842, -0.0834138493714783, -0.180555778230209, -0.060166198248399125, -0.05725938263740248, 0.1298881109571973, -0.22988577150981446, -0.019153154849693294, 0.020568854517644654, 0.002071309571673397, -0.049992950065865696, -0.13358591886891322, -0.01572235682552666, 0.08714801480794568, -0.010801243599333609, -0.059121955522044585, 0.16300504501084334, -0.12229694790590753, -0.1249802351346282, 0.4348066579123945, -0.03086592447908439, -0.19496816294338867, 0.16512321659278495, -0.11767970837069718, -0.018717778203226912, 0.11959124495140241, 0.2324614170441077, 0.1174673221219786, -0.14559507635884159, 0.05202007892306979, 0.035394193992047136, 0.14907105546444654, 0.0937787425910471, 0.09535263644758868, 0.26273751599031664, 0.19925694814207787, 0.0929220091557763, 0.11786206632689039, -0.08662561737805186, -0.018135262880730266, -0.24106292324567227, -0.10079297889024019, -0.2086717125460708, -0.01167796103582355, -0.10129487391104496, -0.22766929987075077, 0.38406763157544244, 0.15619344117461156, 0.1509988894546138, 0.032889101341480514, 0.31472316415952023, 0.10953129515343324, 0.11970088676414417, 0.05333074620206847, 0.2815944503118348, 0.15073530821357178, 0.11517658060636969, -0.18872559708827494, 0.0044617874402097845, -0.0025480121235498263] |
1,802.01203 | Chiral fluids: a few theoretical issues | We review briefly a few topics concerning physics of fluids whose
constituents are massless fermions interacting in chiral invariant way.
Macroscopic manifestations of the chral anomaly is one of central issues.
Another topic is ultraviolet vs infrared sensistivity of chiral magnetic and
vortical effects. To clarify dynamical issues involved we rely mostly on a
(well-known) toy model of pionic superfluidity.
| hep-th | we review briefly a few topics concerning physics of fluids whose constituents are massless fermions interacting in chiral invariant way macroscopic manifestations of the chral anomaly is one of central issues another topic is ultraviolet vs infrared sensistivity of chiral magnetic and vortical effects to clarify dynamical issues involved we rely mostly on a wellknown toy model of pionic superfluidity | [['we', 'review', 'briefly', 'a', 'few', 'topics', 'concerning', 'physics', 'of', 'fluids', 'whose', 'constituents', 'are', 'massless', 'fermions', 'interacting', 'in', 'chiral', 'invariant', 'way', 'macroscopic', 'manifestations', 'of', 'the', 'chral', 'anomaly', 'is', 'one', 'of', 'central', 'issues', 'another', 'topic', 'is', 'ultraviolet', 'vs', 'infrared', 'sensistivity', 'of', 'chiral', 'magnetic', 'and', 'vortical', 'effects', 'to', 'clarify', 'dynamical', 'issues', 'involved', 'we', 'rely', 'mostly', 'on', 'a', 'wellknown', 'toy', 'model', 'of', 'pionic', 'superfluidity']] | [-0.16188389842666812, 0.26401862413701366, -0.09262481117048853, 0.12783703243091576, -0.13542484024823723, -0.13295239589958435, 0.002731367639834219, 0.30551346735555235, -0.19433537155381894, -0.28269199684451696, 0.04301288482235839, -0.3233040255036647, -0.16215326747525546, 0.1016755976745764, -0.03274875269981764, 0.031236047193534292, -0.0535362669961306, 0.03867896573649625, -0.05884270740957078, -0.1878944569804027, 0.3789597171185128, -0.008371871020013497, 0.2510859125877841, 0.13703299657899445, 0.06668904890731506, -0.038625196703725447, -0.08921466956420218, -0.018362015612044577, -0.12800909106824862, 0.06509834474349252, 0.2318918676573341, -0.0069226462204577555, 0.21354397971743433, -0.45553522853780604, -0.23728310902429334, 0.04600907723277302, 0.16044577601823515, 0.14370054860551984, -0.05928746857325215, -0.26081820763647556, -0.028687803958684713, -0.1603093393486372, -0.21109278829989292, -0.08194406005115863, 0.009490135328062825, -0.034268921714718056, -0.15472544556073212, 0.14044408752756604, 0.040101031032371164, 0.12056097753693239, -0.02040647050578905, -0.14804433100320147, 0.025646841374494262, 0.07707186257150972, 0.12909945677295012, -0.008273383641962782, 0.21701764085693126, -0.24849111426195478, -0.1576493883789596, 0.4607902648464098, -0.01495571136750849, -0.13861502033768822, 0.23888427916109184, -0.1256977508428617, -0.20054442095333488, 0.0573689337125269, 0.1209713760921258, 0.10834263961059752, -0.18021986915303742, 0.08530477657657654, -0.09095780950797311, 0.12120533057378005, 0.033189337227051544, 0.124824363564662, 0.33416260450573293, 0.21740866607149778, -0.06099040333528893, 0.10433877596209394, -0.03481119156862467, -0.14908907854519152, -0.3428594088083196, -0.07438742750624226, -0.11711002429315852, 0.060268662806789754, 0.009650517058000364, -0.17329361791312062, 0.39010308275662237, 0.18395922039398702, 0.16434051477255585, -0.11161411871297001, 0.2701651375677626, 0.02822194447330499, 0.034621824305188856, 0.027516725212651288, 0.246354009040584, 0.2304724791517355, 0.10787814041852194, -0.23290958718033666, -0.0713519134274605, 0.1284392013893289] |
1,802.01204 | The Category of Crossed Modules of Crossed Modules and Its Associated
Double Groupoids | In this work we study the notion of Whitehead sequence in the category of
crossed modules and actions of crossed modules. As expected, Whitehead
sequences in that context are the same as crossed squares. We investigate under
which conditions a Whitehead sequence of crossed modules gives rise to an
internal groupoid in the category of crossed modules. In other words, we
explicitly investigate the so called "Smith is Huq" condition in the category
of crossed modules.
| math.CT | in this work we study the notion of whitehead sequence in the category of crossed modules and actions of crossed modules as expected whitehead sequences in that context are the same as crossed squares we investigate under which conditions a whitehead sequence of crossed modules gives rise to an internal groupoid in the category of crossed modules in other words we explicitly investigate the so called smith is huq condition in the category of crossed modules | [['in', 'this', 'work', 'we', 'study', 'the', 'notion', 'of', 'whitehead', 'sequence', 'in', 'the', 'category', 'of', 'crossed', 'modules', 'and', 'actions', 'of', 'crossed', 'modules', 'as', 'expected', 'whitehead', 'sequences', 'in', 'that', 'context', 'are', 'the', 'same', 'as', 'crossed', 'squares', 'we', 'investigate', 'under', 'which', 'conditions', 'a', 'whitehead', 'sequence', 'of', 'crossed', 'modules', 'gives', 'rise', 'to', 'an', 'internal', 'groupoid', 'in', 'the', 'category', 'of', 'crossed', 'modules', 'in', 'other', 'words', 'we', 'explicitly', 'investigate', 'the', 'so', 'called', 'smith', 'is', 'huq', 'condition', 'in', 'the', 'category', 'of', 'crossed', 'modules']] | [-0.207560782149238, 0.09609729149183534, -0.06126672965719512, 0.07698396032087897, -0.08322446888594545, -0.07265197220993669, -0.039427642033459914, 0.41780062892327186, -0.3987335816552666, -0.19605324052788906, 0.08950805971337679, -0.18065593778890998, -0.15362753233823337, 0.1598369165049486, -0.22692396522401587, -0.11651740298839286, 0.12261325050463998, 0.16062838693247422, -0.047658713427249734, -0.2569020241498947, 0.4662893327247155, 0.05244945514162904, 0.2636606384951033, 0.01502199769617475, 0.07430262361211996, 0.03449225756584814, -0.03203666744459616, 0.008194267241235235, -0.16725420933356586, 0.07430886481980499, 0.290677606520292, 0.07132896538333673, 0.20591613685706092, -0.3987162014420487, -0.023195041478366443, 0.14115682609477326, 0.1067431470759115, -0.02262232339432414, 0.027217534530025563, -0.30237068326555583, 0.059540179717403496, -0.3223003900554766, -0.04664400514631875, -0.014886422756765234, 0.03170609816075548, 0.021968000700182625, -0.25012949845251187, -0.08986330175723292, 0.11681049989879523, 0.08974164938799252, -0.11776520430698599, -0.030979005224684154, -0.053032093696712856, 0.16227422464075253, -0.043226852084779624, -0.07889228626338177, 0.1284426089321067, -0.1718807696505744, -0.17180497239812548, 0.33601374648156035, -0.08613157316454147, -0.1704861147721347, 0.16144408871064356, -0.1965041864344752, -0.17501029046865083, 0.11822465183764794, 0.00691028586343715, 0.12002294562070777, -0.0769035775385993, 0.1315241041486029, -0.1749861532160522, -0.02606509921851715, 0.14957224676311998, 0.054833855339031866, 0.126099390320872, 0.1274567405037631, 0.08986529669575823, 0.23089941792070595, -0.018306086513851034, 0.009360523146920298, -0.3155878392097197, -0.27828397652697995, -0.04203596945214821, 0.08185995099330812, 0.01747516152394574, -0.190001149661839, 0.43097180561897785, 0.14351362798755107, 0.172377694410419, 0.10798591821558627, 0.23452691959315225, 0.022331150551939283, 0.12412327421770897, 0.008663995320124454, 0.13767235360328892, 0.26776425066207976, -0.02421996367507075, -0.08691517163778802, -0.002906592697591374, 0.2277565972977563] |
1,802.01205 | Formation of eyes in large-scale cyclonic vortices | We present numerical simulations of steady, laminar, axisymmetric convection
of a Boussinesq fluid in a shallow, rotating, cylindrical domain. The flow is
driven by an imposed vertical heat flux and shaped by the background rotation
of the domain. The geometry is inspired by that of tropical cyclones and the
global flow pattern consists of a shallow, swirling vortex combined with a
poloidal flow in the r-z plane which is predominantly inward near the bottom
boundary and outward along the upper surface. Our numerical experiments confirm
that, as suggested by Oruba et al 2017, an eye forms at the centre of the
vortex which is reminiscent of that seen in a tropical cyclone and is
characterised by a local reversal in the direction of the poloidal flow. We
establish scaling laws for the flow and map out the conditions under which an
eye will, or will not, form. We show that, to leading order, the velocity
scales with V=(\alpha g \beta)^{1/2}H, where g is gravity, \alpha the expansion
coefficient, \beta the background temperature gradient, and H is the depth of
the domain. We also show that the two most important parameters controlling the
flow are Re=VH/\nu and Ro=V/\Omega H, where \Omega is the background rotation
rate and \nu the viscosity. The Prandtl number and aspect ratio also play an
important, if secondary, role. Finally, and most importantly, we establish the
criteria required for eye formation. These consist of a lower bound on Re,
upper and lower bounds on Ro, and an upper bound on Ekman number.
| physics.flu-dyn physics.ao-ph | we present numerical simulations of steady laminar axisymmetric convection of a boussinesq fluid in a shallow rotating cylindrical domain the flow is driven by an imposed vertical heat flux and shaped by the background rotation of the domain the geometry is inspired by that of tropical cyclones and the global flow pattern consists of a shallow swirling vortex combined with a poloidal flow in the rz plane which is predominantly inward near the bottom boundary and outward along the upper surface our numerical experiments confirm that as suggested by oruba et al 2017 an eye forms at the centre of the vortex which is reminiscent of that seen in a tropical cyclone and is characterised by a local reversal in the direction of the poloidal flow we establish scaling laws for the flow and map out the conditions under which an eye will or will not form we show that to leading order the velocity scales with valpha g beta12h where g is gravity alpha the expansion coefficient beta the background temperature gradient and h is the depth of the domain we also show that the two most important parameters controlling the flow are revhnu and rovomega h where omega is the background rotation rate and nu the viscosity the prandtl number and aspect ratio also play an important if secondary role finally and most importantly we establish the criteria required for eye formation these consist of a lower bound on re upper and lower bounds on ro and an upper bound on ekman number | [['we', 'present', 'numerical', 'simulations', 'of', 'steady', 'laminar', 'axisymmetric', 'convection', 'of', 'a', 'boussinesq', 'fluid', 'in', 'a', 'shallow', 'rotating', 'cylindrical', 'domain', 'the', 'flow', 'is', 'driven', 'by', 'an', 'imposed', 'vertical', 'heat', 'flux', 'and', 'shaped', 'by', 'the', 'background', 'rotation', 'of', 'the', 'domain', 'the', 'geometry', 'is', 'inspired', 'by', 'that', 'of', 'tropical', 'cyclones', 'and', 'the', 'global', 'flow', 'pattern', 'consists', 'of', 'a', 'shallow', 'swirling', 'vortex', 'combined', 'with', 'a', 'poloidal', 'flow', 'in', 'the', 'rz', 'plane', 'which', 'is', 'predominantly', 'inward', 'near', 'the', 'bottom', 'boundary', 'and', 'outward', 'along', 'the', 'upper', 'surface', 'our', 'numerical', 'experiments', 'confirm', 'that', 'as', 'suggested', 'by', 'oruba', 'et', 'al', '2017', 'an', 'eye', 'forms', 'at', 'the', 'centre', 'of', 'the', 'vortex', 'which', 'is', 'reminiscent', 'of', 'that', 'seen', 'in', 'a', 'tropical', 'cyclone', 'and', 'is', 'characterised', 'by', 'a', 'local', 'reversal', 'in', 'the', 'direction', 'of', 'the', 'poloidal', 'flow', 'we', 'establish', 'scaling', 'laws', 'for', 'the', 'flow', 'and', 'map', 'out', 'the', 'conditions', 'under', 'which', 'an', 'eye', 'will', 'or', 'will', 'not', 'form', 'we', 'show', 'that', 'to', 'leading', 'order', 'the', 'velocity', 'scales', 'with', 'valpha', 'g', 'beta12h', 'where', 'g', 'is', 'gravity', 'alpha', 'the', 'expansion', 'coefficient', 'beta', 'the', 'background', 'temperature', 'gradient', 'and', 'h', 'is', 'the', 'depth', 'of', 'the', 'domain', 'we', 'also', 'show', 'that', 'the', 'two', 'most', 'important', 'parameters', 'controlling', 'the', 'flow', 'are', 'revhnu', 'and', 'rovomega', 'h', 'where', 'omega', 'is', 'the', 'background', 'rotation', 'rate', 'and', 'nu', 'the', 'viscosity', 'the', 'prandtl', 'number', 'and', 'aspect', 'ratio', 'also', 'play', 'an', 'important', 'if', 'secondary', 'role', 'finally', 'and', 'most', 'importantly', 'we', 'establish', 'the', 'criteria', 'required', 'for', 'eye', 'formation', 'these', 'consist', 'of', 'a', 'lower', 'bound', 'on', 're', 'upper', 'and', 'lower', 'bounds', 'on', 'ro', 'and', 'an', 'upper', 'bound', 'on', 'ekman', 'number']] | [-0.15949404409593082, 0.152912153462442, -0.07015478312301326, 0.01762047098843804, -0.06019737316291794, -0.0753221624415828, -0.0008161143331131731, 0.31127673098785, -0.2653890460631272, -0.2900142388082521, 0.13362906837930524, -0.2346058011470563, -0.12742059109120285, 0.23871176513106715, -0.0478075157852836, 0.02570984967561268, 0.016388861957818746, 0.029956706877486163, -0.016953196590666592, -0.1904417244393742, 0.31304045231916394, 0.06152216277170585, 0.2685915097905939, 0.04551841498262609, 0.07088567135949245, -0.08682932498994927, -0.02449529225273852, 0.05922449935613519, -0.19769120159764997, 0.07843757604259953, 0.16729993503902524, 0.05287103278681161, 0.22046811814675946, -0.4487399184015168, -0.20349649192609517, 0.053767855449828254, 0.16511943990195846, 0.057409597661409274, -0.05830538141507789, -0.22969678983804714, 0.07900245175270208, -0.1042874324035996, -0.14180357956820988, -0.004014880863942236, 0.08021998716484889, 0.03342117326133755, -0.3038832367160376, 0.107938504485419, 0.11391522292700779, 0.09404775547478218, -0.0744194307733713, -0.09726286855659845, -0.09399285803333786, 0.09047902135161749, 0.06691509282978927, 0.0678564287427362, 0.13746878227814513, -0.18020872116753037, -0.03329937108439872, 0.3442881578520178, -0.0912922732729142, -0.20221495601734465, 0.17939636431563927, -0.16855003835588872, -0.0707537491371729, 0.13657119983169008, 0.17127053852404553, 0.1174546977562136, -0.0671156867281107, 0.057417121928266854, -0.10064402020274776, 0.15532336437302935, 0.10135122074048031, -0.06901619928068968, 0.2377146442735705, 0.15419685762501747, 0.1350180544960962, 0.12711203886581904, -0.1634855662934961, -0.07004473215285355, -0.31632646280563476, -0.14043338317284917, -0.13331546047999268, 0.021567412337788708, -0.10382923271170301, -0.14295486880900465, 0.3423000447279532, 0.08602969539889777, 0.20745414424575384, 0.01283072631581653, 0.2814145029904655, 0.13751722446112222, 0.030185763870116736, 0.1717718698230917, 0.2690181768169085, 0.16480108745028804, 0.12015864206663522, -0.2743015338205714, 0.04386786577955957, 0.10390609013384201] |
1,802.01206 | In-Situ Self-Monitoring of Real-Time Photovoltaic Degradation Only Using
Maximum Power Point: the Suns-Vmp Method | The uncertainties associated with technology- and geography-specific
degradation rates make it difficult to calculate the levelized cost of energy
(LCOE), and thus the economic viability of solar energy. In this regard,
millions of fielded photovoltaic (PV) modules may serve as a global testbed,
where we can interpret the routinely collected maximum power point (MPP)
time-series data to assess the time-dependent "health" thereof. The existing
characterization methods, however, cannot effectively mine/decode these
datasets to identify various degradation pathways of the corresponding solar
modules. In this paper, we propose a new methodology, i.e., the Suns-Vmp
method, which offers a simple and powerful approach to monitoring and
diagnosing time-dependent degradation of solar modules by physically mining the
MPP data. The algorithm reconstructs "IV" curves by using the natural
illumination- and temperature-dependent daily MPP characteristics as
constraints to fit the physics-based compact model. These synthetic IV
characteristics are then used to determine the time-dependent evolution of
circuit parameters (e.g., series resistance) which in-turn allows one to deduce
the dominant degradation mode (e.g., corrosion) for the modules. The proposed
method has been applied to analyze the MPP data from a test facility at the
National Renewable Energy Laboratory (NREL). Our analysis indicates that the
solar modules degraded at a rate of 0.7 %/year due to discoloration and
weakened solder bonds. These conclusions are independently validated by outdoor
IV measurement and on-site imaging characterization. Integrated with
physics-based degradation models or machine learning algorithms, the method can
also serve to predict the lifetime of PV systems.
| physics.app-ph | the uncertainties associated with technology and geographyspecific degradation rates make it difficult to calculate the levelized cost of energy lcoe and thus the economic viability of solar energy in this regard millions of fielded photovoltaic pv modules may serve as a global testbed where we can interpret the routinely collected maximum power point mpp timeseries data to assess the timedependent health thereof the existing characterization methods however cannot effectively minedecode these datasets to identify various degradation pathways of the corresponding solar modules in this paper we propose a new methodology ie the sunsvmp method which offers a simple and powerful approach to monitoring and diagnosing timedependent degradation of solar modules by physically mining the mpp data the algorithm reconstructs iv curves by using the natural illumination and temperaturedependent daily mpp characteristics as constraints to fit the physicsbased compact model these synthetic iv characteristics are then used to determine the timedependent evolution of circuit parameters eg series resistance which inturn allows one to deduce the dominant degradation mode eg corrosion for the modules the proposed method has been applied to analyze the mpp data from a test facility at the national renewable energy laboratory nrel our analysis indicates that the solar modules degraded at a rate of 07 year due to discoloration and weakened solder bonds these conclusions are independently validated by outdoor iv measurement and onsite imaging characterization integrated with physicsbased degradation models or machine learning algorithms the method can also serve to predict the lifetime of pv systems | [['the', 'uncertainties', 'associated', 'with', 'technology', 'and', 'geographyspecific', 'degradation', 'rates', 'make', 'it', 'difficult', 'to', 'calculate', 'the', 'levelized', 'cost', 'of', 'energy', 'lcoe', 'and', 'thus', 'the', 'economic', 'viability', 'of', 'solar', 'energy', 'in', 'this', 'regard', 'millions', 'of', 'fielded', 'photovoltaic', 'pv', 'modules', 'may', 'serve', 'as', 'a', 'global', 'testbed', 'where', 'we', 'can', 'interpret', 'the', 'routinely', 'collected', 'maximum', 'power', 'point', 'mpp', 'timeseries', 'data', 'to', 'assess', 'the', 'timedependent', 'health', 'thereof', 'the', 'existing', 'characterization', 'methods', 'however', 'can', 'not', 'effectively', 'minedecode', 'these', 'datasets', 'to', 'identify', 'various', 'degradation', 'pathways', 'of', 'the', 'corresponding', 'solar', 'modules', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'methodology', 'ie', 'the', 'sunsvmp', 'method', 'which', 'offers', 'a', 'simple', 'and', 'powerful', 'approach', 'to', 'monitoring', 'and', 'diagnosing', 'timedependent', 'degradation', 'of', 'solar', 'modules', 'by', 'physically', 'mining', 'the', 'mpp', 'data', 'the', 'algorithm', 'reconstructs', 'iv', 'curves', 'by', 'using', 'the', 'natural', 'illumination', 'and', 'temperaturedependent', 'daily', 'mpp', 'characteristics', 'as', 'constraints', 'to', 'fit', 'the', 'physicsbased', 'compact', 'model', 'these', 'synthetic', 'iv', 'characteristics', 'are', 'then', 'used', 'to', 'determine', 'the', 'timedependent', 'evolution', 'of', 'circuit', 'parameters', 'eg', 'series', 'resistance', 'which', 'inturn', 'allows', 'one', 'to', 'deduce', 'the', 'dominant', 'degradation', 'mode', 'eg', 'corrosion', 'for', 'the', 'modules', 'the', 'proposed', 'method', 'has', 'been', 'applied', 'to', 'analyze', 'the', 'mpp', 'data', 'from', 'a', 'test', 'facility', 'at', 'the', 'national', 'renewable', 'energy', 'laboratory', 'nrel', 'our', 'analysis', 'indicates', 'that', 'the', 'solar', 'modules', 'degraded', 'at', 'a', 'rate', 'of', '07', 'year', 'due', 'to', 'discoloration', 'and', 'weakened', 'solder', 'bonds', 'these', 'conclusions', 'are', 'independently', 'validated', 'by', 'outdoor', 'iv', 'measurement', 'and', 'onsite', 'imaging', 'characterization', 'integrated', 'with', 'physicsbased', 'degradation', 'models', 'or', 'machine', 'learning', 'algorithms', 'the', 'method', 'can', 'also', 'serve', 'to', 'predict', 'the', 'lifetime', 'of', 'pv', 'systems']] | [-0.062111604400733225, 0.04374628041838843, -0.04551359505919544, 0.07572567247340704, -0.05774259380713437, -0.16705678629232684, 0.06129858124509137, 0.3548908598781356, -0.28830805917078184, -0.37784431195678375, 0.10925553043618956, -0.25360064457651643, -0.1220438102955896, 0.2504189982652091, -0.10366120388842591, 0.07854944723375473, 0.10292242453075372, -0.016688615941491566, -0.024552520525006404, -0.21693811567522858, 0.2546784755870934, 0.12322525723143538, 0.3393116219285951, 0.05462160933506392, 0.08631142318533425, -0.03530217021178673, -0.04782955823296508, -0.0034106038388256963, -0.09273483211930246, 0.1384806032933536, 0.2903354184422106, 0.15002164824843134, 0.25513671102522595, -0.44233453273773193, -0.23471854592443478, 0.11098821452717006, 0.09118212127800265, 0.0493162074338985, -0.022081052788899956, -0.24842786047370116, 0.07468588863662538, -0.17554408861493864, -0.11691794115559835, -0.0961908973547958, -0.019593243826527586, 0.03733495510629141, -0.3051486974054201, 0.03988670190758079, -0.03289348469304321, 0.07884381656998746, -0.09319335251489488, -0.09542291250262741, -0.05243715949154832, 0.1381702378922687, 0.03461676750752532, -0.02785090153456217, 0.1752593236153395, -0.09459513877914381, -0.12110676142285287, 0.37908661085452416, -0.05204027035907062, -0.1311817383280529, 0.18944026590871665, -0.09894977935669032, -0.11706773740869121, 0.12497590343797342, 0.20127708076189277, 0.06813387351529107, -0.2121434521857604, 0.02293710648916428, 0.04476372300466214, 0.12499377572108229, 0.02817737988124673, 0.0031573466413658156, 0.20376730359608103, 0.19672524944647227, 0.026663767505693534, 0.11076858435966723, -0.1433462539847058, -0.03078419948090999, -0.2466132354833985, -0.1485003180470061, -0.12207569364354161, 0.04438661218877469, -0.07794704992350743, -0.13711170668182102, 0.4247900250562003, 0.2003791435788525, 0.1535918908900683, 0.02568741751502943, 0.3324394396050015, 0.08868450922410755, 0.10655646728891842, 0.0458256663407693, 0.22993591956903608, 0.07697329186313118, 0.15477809391591532, -0.23656895986441448, 0.0917723704400936, 0.00960138108324908] |
1,802.01207 | A Sharp Bound on the $s$-Energy and Its Applications to Averaging
Systems | The {\em $s$-energy} is a generating function of wide applicability in
network-based dynamics. We derive an (essentially) optimal bound of $(3/\rho
s)^{n-1}$ on the $s$-energy of an $n$-agent symmetric averaging system, for any
positive real $s\leq 1$, where~$\rho$ is a lower bound on the nonzero weights.
This is done by introducing the new dynamics of {\em twist systems}. We show
how to use the new bound on the $s$-energy to tighten the convergence rate of
systems in opinion dynamics, flocking, and synchronization.
| cs.MA math.OC | the em senergy is a generating function of wide applicability in networkbased dynamics we derive an essentially optimal bound of 3rho sn1 on the senergy of an nagent symmetric averaging system for any positive real sleq 1 whererho is a lower bound on the nonzero weights this is done by introducing the new dynamics of em twist systems we show how to use the new bound on the senergy to tighten the convergence rate of systems in opinion dynamics flocking and synchronization | [['the', 'em', 'senergy', 'is', 'a', 'generating', 'function', 'of', 'wide', 'applicability', 'in', 'networkbased', 'dynamics', 'we', 'derive', 'an', 'essentially', 'optimal', 'bound', 'of', '3rho', 'sn1', 'on', 'the', 'senergy', 'of', 'an', 'nagent', 'symmetric', 'averaging', 'system', 'for', 'any', 'positive', 'real', 'sleq', '1', 'whererho', 'is', 'a', 'lower', 'bound', 'on', 'the', 'nonzero', 'weights', 'this', 'is', 'done', 'by', 'introducing', 'the', 'new', 'dynamics', 'of', 'em', 'twist', 'systems', 'we', 'show', 'how', 'to', 'use', 'the', 'new', 'bound', 'on', 'the', 'senergy', 'to', 'tighten', 'the', 'convergence', 'rate', 'of', 'systems', 'in', 'opinion', 'dynamics', 'flocking', 'and', 'synchronization']] | [-0.20444405488669873, 0.09831534229779208, -0.08036538743181154, 0.06899847908935045, -0.028262326819822194, -0.10040637076599523, 0.06297087686834857, 0.32287316150031986, -0.269287441225606, -0.2457161501981318, 0.09980406723625493, -0.23728537305723876, -0.18272946076467633, 0.17500801012211015, -0.053719308881227334, 0.046296470798552036, 0.01870297410787316, 0.08028011832793709, -0.04966362665873021, -0.27642032906296665, 0.3415787879494019, 0.041676573536824434, 0.2607786525855772, 0.05337216196348891, 0.10696439703424403, 0.04112114821036812, 0.0557725181337446, -0.03816121923737228, -0.21560219982638956, 0.12637707223184408, 0.1419522452109959, 0.18121998562128283, 0.2971337970346212, -0.3728648862335831, -0.16322600202984178, 0.14182665705448017, 0.15149376816116272, 0.09569453650619834, -0.041898673020477874, -0.2693954961898271, 0.08854603252839297, -0.1537533835391514, -0.12728934938204475, -0.0837519790744409, 0.025883247377350926, 0.07377281193621457, -0.3153575469041243, 0.05014230611268431, 0.10147302334662527, 0.045328256802167746, -0.08742260003928096, -0.12239003512513591, 0.032171844143886116, 0.12844591735629365, -0.012364233445259743, 0.035744715979672034, 0.07157109887339175, -0.10899962939729449, -0.14169306541443802, 0.33317072258796543, -0.10377312116033863, -0.26895430716685953, 0.15818230317672716, -0.12959111278760246, -0.13635644754976967, 0.11416177751962095, 0.21521676061674952, 0.1724453770904802, -0.11738687668694184, 0.11125694020229275, -0.06858065334381536, 0.1791641555071692, 0.03242112379521132, 0.01228350675664842, 0.11861012092558668, 0.16361529158893973, 0.1877447887090966, 0.15452571231289766, -0.03780105111945886, -0.1327248241927009, -0.29932053891243415, -0.13187756827028352, -0.24692991906194947, 0.09291534960502759, -0.11466070890874107, -0.1544792416971177, 0.36559184662182814, 0.13337298355763777, 0.2035142425353115, 0.1231311535986606, 0.25321742858504875, 0.15198414478218183, 0.004876869090367109, 0.09748863081331365, 0.20523559062276037, 0.09681177604361438, 0.036558176622202156, -0.22935349465697072, 0.06043349993997253, 0.11901776760932989] |
1,802.01208 | Toward a Theory of Markov Influence Systems and their Renormalization | We introduce the concept of a Markov influence system (MIS) and analyze its
dynamics. An MIS models a random walk in a graph whose edges and transition
probabilities change endogenously as a function of the current distribution.
This article consists of two independent parts: in the first one, we generalize
the standard classification of Markov chain states to the time-varying case by
showing how to "parse" graph sequences; in the second part, we use this
framework to carry out the bifurcation analysis of a few important MIS
families. We show that, in general, these systems can be chaotic but that
irreducible MIS are almost always asymptotically periodic. We give an example
of "hyper-torpid" mixing, where a stationary distribution is reached in
super-exponential time, a timescale beyond the reach of any Markov chain.
| cs.MA math.PR nlin.AO | we introduce the concept of a markov influence system mis and analyze its dynamics an mis models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution this article consists of two independent parts in the first one we generalize the standard classification of markov chain states to the timevarying case by showing how to parse graph sequences in the second part we use this framework to carry out the bifurcation analysis of a few important mis families we show that in general these systems can be chaotic but that irreducible mis are almost always asymptotically periodic we give an example of hypertorpid mixing where a stationary distribution is reached in superexponential time a timescale beyond the reach of any markov chain | [['we', 'introduce', 'the', 'concept', 'of', 'a', 'markov', 'influence', 'system', 'mis', 'and', 'analyze', 'its', 'dynamics', 'an', 'mis', 'models', 'a', 'random', 'walk', 'in', 'a', 'graph', 'whose', 'edges', 'and', 'transition', 'probabilities', 'change', 'endogenously', 'as', 'a', 'function', 'of', 'the', 'current', 'distribution', 'this', 'article', 'consists', 'of', 'two', 'independent', 'parts', 'in', 'the', 'first', 'one', 'we', 'generalize', 'the', 'standard', 'classification', 'of', 'markov', 'chain', 'states', 'to', 'the', 'timevarying', 'case', 'by', 'showing', 'how', 'to', 'parse', 'graph', 'sequences', 'in', 'the', 'second', 'part', 'we', 'use', 'this', 'framework', 'to', 'carry', 'out', 'the', 'bifurcation', 'analysis', 'of', 'a', 'few', 'important', 'mis', 'families', 'we', 'show', 'that', 'in', 'general', 'these', 'systems', 'can', 'be', 'chaotic', 'but', 'that', 'irreducible', 'mis', 'are', 'almost', 'always', 'asymptotically', 'periodic', 'we', 'give', 'an', 'example', 'of', 'hypertorpid', 'mixing', 'where', 'a', 'stationary', 'distribution', 'is', 'reached', 'in', 'superexponential', 'time', 'a', 'timescale', 'beyond', 'the', 'reach', 'of', 'any', 'markov', 'chain']] | [-0.1520766204859322, 0.14050446110373213, -0.08763714244354602, 0.05385416500423217, -0.03097453687467989, -0.09982085506296681, 0.07237120825025957, 0.3754616646124548, -0.29729091181981426, -0.2549928403423943, 0.131820471384136, -0.24742643358825728, -0.17340770965968152, 0.13987348874220412, -0.05122575928805439, 0.038355770474210925, 0.0841060909087137, 0.062166311015652224, -0.012076696931946141, -0.24511980687095677, 0.3067415856564318, 0.013104161080541729, 0.23797363447174713, -0.010069301915319481, 0.0998912624310958, 0.025321070390988056, 0.006144368805112104, 0.016424953823781195, -0.1438216508997343, 0.07701685418017593, 0.23763325663394216, 0.12722835835296695, 0.2763236408612428, -0.39917342894788804, -0.18056594840791218, 0.17004045801244336, 0.17268141367266537, 0.13636090621913832, 0.003448289105462493, -0.26026025809923486, 0.062309265083398756, -0.17358820603890274, -0.11393911706262361, -0.05001369725916364, 0.022708821170856708, 0.021509711246738453, -0.26924453930616493, 0.029253327412146875, 0.1252495302953793, 0.03893171587802527, 0.006940064369700849, -0.06142690681980368, 0.006023969888715571, 0.15271095371314589, 0.0028452192240337776, 0.001090536142862935, 0.1032691806526357, -0.08855899020261665, -0.16615751024890152, 0.3278468994722339, -0.0900538663827736, -0.21947328354416856, 0.16287417270292934, -0.13950142532032522, -0.18025535191160463, 0.12078685639781579, 0.1824428445467626, 0.14088426307839064, -0.16935885977710932, 0.07568303376830801, -0.07835518932752027, 0.15610663432855415, 0.035700661794972104, -0.005990092274253008, 0.1874172570119889, 0.19179780393988177, 0.12472070202601092, 0.1875668024379433, -0.028427581764928257, -0.14052372740738037, -0.30594764099605665, -0.1374553474064433, -0.19159668654146542, 0.07688617328171199, -0.09147135593429855, -0.2371834598069314, 0.4613888602888652, 0.1876629473235533, 0.2193174591814061, 0.09982136173266207, 0.24155867470069325, 0.12764704710793262, -0.007666137559119015, 0.10974450920217933, 0.18449972561944475, 0.11235586238335392, 0.05775952214048109, -0.15175660219215006, 0.09717225427925942, 0.06577682613843043] |
1,802.01209 | Spectral exterior calculus | A spectral approach to building the exterior calculus in manifold learning
problems is developed. The spectral approach is shown to converge to the true
exterior calculus in the limit of large data. Simultaneously, the spectral
approach decouples the memory requirements from the amount of data points and
ambient space dimension. To achieve this, the exterior calculus is reformulated
entirely in terms of the eigenvalues and eigenfunctions of the Laplacian
operator on functions. The exterior derivatives of these eigenfunctions (and
their wedge products) are shown to form a frame (a type of spanning set) for
appropriate $L^2$ spaces of $k$-forms, as well as higher-order Sobolev spaces.
Formulas are derived to express the Laplace-de Rham operators on forms in terms
of the eigenfunctions and eigenvalues of the Laplacian on functions. By
representing the Laplace-de Rham operators in this frame, spectral convergence
results are obtained via Galerkin approximation techniques. Numerical examples
demonstrate accurate recovery of eigenvalues and eigenforms of the Laplace-de
Rham operator on 1-forms. The correct Betti numbers are obtained from the
kernel of this operator approximated from data sampled on several orientable
and non-orientable manifolds, and the eigenforms are visualized via their
corresponding vector fields. These vector fields form a natural orthonormal
basis for the space of square-integrable vector fields, and are ordered by a
Dirichlet energy functional which measures oscillatory behavior. The spectral
framework also shows promising results on a non-smooth example (the Lorenz 63
attractor), suggesting that a spectral formulation of exterior calculus may be
feasible in spaces with no differentiable structure.
| math.DG | a spectral approach to building the exterior calculus in manifold learning problems is developed the spectral approach is shown to converge to the true exterior calculus in the limit of large data simultaneously the spectral approach decouples the memory requirements from the amount of data points and ambient space dimension to achieve this the exterior calculus is reformulated entirely in terms of the eigenvalues and eigenfunctions of the laplacian operator on functions the exterior derivatives of these eigenfunctions and their wedge products are shown to form a frame a type of spanning set for appropriate l2 spaces of kforms as well as higherorder sobolev spaces formulas are derived to express the laplacede rham operators on forms in terms of the eigenfunctions and eigenvalues of the laplacian on functions by representing the laplacede rham operators in this frame spectral convergence results are obtained via galerkin approximation techniques numerical examples demonstrate accurate recovery of eigenvalues and eigenforms of the laplacede rham operator on 1forms the correct betti numbers are obtained from the kernel of this operator approximated from data sampled on several orientable and nonorientable manifolds and the eigenforms are visualized via their corresponding vector fields these vector fields form a natural orthonormal basis for the space of squareintegrable vector fields and are ordered by a dirichlet energy functional which measures oscillatory behavior the spectral framework also shows promising results on a nonsmooth example the lorenz 63 attractor suggesting that a spectral formulation of exterior calculus may be feasible in spaces with no differentiable structure | [['a', 'spectral', 'approach', 'to', 'building', 'the', 'exterior', 'calculus', 'in', 'manifold', 'learning', 'problems', 'is', 'developed', 'the', 'spectral', 'approach', 'is', 'shown', 'to', 'converge', 'to', 'the', 'true', 'exterior', 'calculus', 'in', 'the', 'limit', 'of', 'large', 'data', 'simultaneously', 'the', 'spectral', 'approach', 'decouples', 'the', 'memory', 'requirements', 'from', 'the', 'amount', 'of', 'data', 'points', 'and', 'ambient', 'space', 'dimension', 'to', 'achieve', 'this', 'the', 'exterior', 'calculus', 'is', 'reformulated', 'entirely', 'in', 'terms', 'of', 'the', 'eigenvalues', 'and', 'eigenfunctions', 'of', 'the', 'laplacian', 'operator', 'on', 'functions', 'the', 'exterior', 'derivatives', 'of', 'these', 'eigenfunctions', 'and', 'their', 'wedge', 'products', 'are', 'shown', 'to', 'form', 'a', 'frame', 'a', 'type', 'of', 'spanning', 'set', 'for', 'appropriate', 'l2', 'spaces', 'of', 'kforms', 'as', 'well', 'as', 'higherorder', 'sobolev', 'spaces', 'formulas', 'are', 'derived', 'to', 'express', 'the', 'laplacede', 'rham', 'operators', 'on', 'forms', 'in', 'terms', 'of', 'the', 'eigenfunctions', 'and', 'eigenvalues', 'of', 'the', 'laplacian', 'on', 'functions', 'by', 'representing', 'the', 'laplacede', 'rham', 'operators', 'in', 'this', 'frame', 'spectral', 'convergence', 'results', 'are', 'obtained', 'via', 'galerkin', 'approximation', 'techniques', 'numerical', 'examples', 'demonstrate', 'accurate', 'recovery', 'of', 'eigenvalues', 'and', 'eigenforms', 'of', 'the', 'laplacede', 'rham', 'operator', 'on', '1forms', 'the', 'correct', 'betti', 'numbers', 'are', 'obtained', 'from', 'the', 'kernel', 'of', 'this', 'operator', 'approximated', 'from', 'data', 'sampled', 'on', 'several', 'orientable', 'and', 'nonorientable', 'manifolds', 'and', 'the', 'eigenforms', 'are', 'visualized', 'via', 'their', 'corresponding', 'vector', 'fields', 'these', 'vector', 'fields', 'form', 'a', 'natural', 'orthonormal', 'basis', 'for', 'the', 'space', 'of', 'squareintegrable', 'vector', 'fields', 'and', 'are', 'ordered', 'by', 'a', 'dirichlet', 'energy', 'functional', 'which', 'measures', 'oscillatory', 'behavior', 'the', 'spectral', 'framework', 'also', 'shows', 'promising', 'results', 'on', 'a', 'nonsmooth', 'example', 'the', 'lorenz', '63', 'attractor', 'suggesting', 'that', 'a', 'spectral', 'formulation', 'of', 'exterior', 'calculus', 'may', 'be', 'feasible', 'in', 'spaces', 'with', 'no', 'differentiable', 'structure']] | [-0.13054096544614216, 0.04743745822501792, -0.09325668146500636, 0.10490815362339957, -0.10569191666820599, -0.06102123857096662, -0.020838031104467664, 0.3406719007775953, -0.28676373372774705, -0.25407240129712777, 0.13840065279095748, -0.2604644501792532, -0.1651149588644416, 0.1963226513664713, -0.09384499493637352, 0.09264110336301061, 0.09394593562437553, 0.0860272115041233, -0.09738789526506404, -0.1983174460989758, 0.4076584989753489, -0.013580799812318484, 0.2375977904261587, 0.020277349771600468, 0.10679213602322231, -0.045336968853532264, -0.03018045151539942, -0.03547022443677928, -0.10310148944395062, 0.19057577502133377, 0.29224301274569536, 0.09550193699077691, 0.24482842494748355, -0.4132841585108296, -0.19080085403436847, 0.1275640397439361, 0.13746746854392788, -0.008443473978612292, 0.0100237508221592, -0.33347412628184253, 0.06684680544612966, -0.09915964268727721, -0.15556355049693774, -0.15141795169591551, -0.004752850010917474, 0.040318597133433366, -0.29683440734412364, 0.06592203850989974, 0.06690476673633125, 0.06341588411759953, -0.1509610544724515, -0.13487063453389192, -0.07460963447383152, 0.06594879535926881, 0.0024613085476195683, 0.013053312774364775, 0.09268251092729007, -0.05999502700039373, -0.11582264080901332, 0.3278906141194283, -0.08579529187800326, -0.29704846109340904, 0.11963259898542092, -0.1598784504918448, -0.10366271135421183, 0.11604836008423138, 0.1418755986753542, 0.171478219772505, -0.08791260786465896, 0.18184494429816428, -0.012646403456320286, 0.08733111156864835, 0.12737174955769093, 0.04749246440384272, 0.11762036871820276, 0.06943819187434294, 0.09322423782943207, 0.10887032298770596, -0.016343128215889687, -0.12268242725146301, -0.334392136029104, -0.1654179519020631, -0.21924056725764257, 0.05290273811922155, -0.16366544412587045, -0.2172013912504086, 0.40229981244641094, 0.06352438313358283, 0.21376321912032695, 0.09729454722743217, 0.26495371099557774, 0.1649269186712736, 0.0793060036008007, 0.08609113731999465, 0.15758644954601428, 0.20305993646317025, 0.11076127054545248, -0.14655205477976974, -0.02348385524490605, 0.18148775527938435] |
1,802.0121 | On two upper bounds for hypersurfaces involving a Thas' invariant | Let $X^n$ be a hypersurface in $\mathbb{P}^{n+1}$ with $n\geq 1$ defined over
a finite field $\mathbb{F}_q$ of $q$ elements. In this note, we classify, up to
projective equivalence, hypersurfaces $X^n$ as above which reach two elementary
upper bounds for the number of $\mathbb{F}_q$-points on $X^n$ which involve a
Thas' invariant.
| math.AG | let xn be a hypersurface in mathbbpn1 with ngeq 1 defined over a finite field mathbbf_q of q elements in this note we classify up to projective equivalence hypersurfaces xn as above which reach two elementary upper bounds for the number of mathbbf_qpoints on xn which involve a thas invariant | [['let', 'xn', 'be', 'a', 'hypersurface', 'in', 'mathbbpn1', 'with', 'ngeq', '1', 'defined', 'over', 'a', 'finite', 'field', 'mathbbf_q', 'of', 'q', 'elements', 'in', 'this', 'note', 'we', 'classify', 'up', 'to', 'projective', 'equivalence', 'hypersurfaces', 'xn', 'as', 'above', 'which', 'reach', 'two', 'elementary', 'upper', 'bounds', 'for', 'the', 'number', 'of', 'mathbbf_qpoints', 'on', 'xn', 'which', 'involve', 'a', 'thas', 'invariant']] | [-0.24305902482941746, 0.13341282365843654, -0.06380809017457068, 0.01149176757549867, 0.013963133543729783, -0.1969805754814297, -0.006163906529545784, 0.2918123643659055, -0.3033381234109402, -0.24177651649340987, 0.060131514468230306, -0.273635095898062, -0.04200756293837912, 0.22128709454089404, -0.09213481860235334, -0.022678246479481457, -0.025517478096298875, 0.16728082217276097, -0.11329825177788734, -0.3607513428106904, 0.35496704310178756, -0.1029292879626155, 0.1420557565242052, 0.04412449855357409, 0.14103756239637733, 0.007324032438918948, 0.06310252213850617, -0.0084626010293141, -0.19559645326808095, 0.09691395621746779, 0.34769273253157734, 0.1020557442959398, 0.2001020634546876, -0.33475124556571245, -0.1492204221431166, 0.28175986850634216, 0.22490328703075646, -0.060181622267700734, 0.040556850887369364, -0.2467355787847191, 0.17615604801103474, -0.14863721825182438, -0.1611291912384331, -0.02799869970418513, 0.08759616474853829, 0.056072800224646925, -0.31594345353543757, -0.04403732798993588, 0.11647599060088396, 0.17328869964403565, 0.0062120052706450225, -0.139749832842499, -0.0027718046028167007, 0.037258761264383794, -0.034051503613591196, 0.1318869294039905, 0.03942476461175829, -0.032856351477093995, -0.07828176431357861, 0.3266480780392885, -0.09854087747633457, -0.24626114862039686, 0.014280794337391853, -0.1809360148757696, -0.14594716781750322, 0.16617788961157204, 0.19919977650977672, 0.20196090564131736, 0.0024881643056869508, 0.21900185205973685, -0.13168024215847254, 0.10677264026366175, 0.12285041626542807, -0.0048873647674918174, 0.1368191964039579, 0.0289848810993135, 0.06529433113522827, 0.10193647216772661, 0.018970397212542595, -0.02612883919849992, -0.4289784798026085, -0.1806047640554607, -0.15380632270127534, 0.2510319347679615, -0.1455131166893989, -0.14704298428958282, 0.3241847013682127, 0.06307946089655161, 0.24086341131944208, 0.13820421660784632, 0.20443373428424821, 0.01442513468908146, 0.01010851627215743, 0.08218116199597716, 0.07264111849479377, 0.2238484261184931, -0.045058512578252705, -0.05998045079410076, -0.02610911861760542, 0.17209694553166627] |
1,802.01211 | Quasi-Monte Carlo methods applied to tau-leaping in stochastic
biological systems | Quasi-Monte Carlo methods have proven to be effective extensions of
traditional Monte Carlo methods in, amongst others, problems of quadrature and
the sample path simulation of stochastic differential equations. By replacing
the random number input stream in a simulation procedure by a low-discrepancy
number input stream, variance reductions of several orders have been observed
in financial applications.
Analysis of stochastic effects in well-mixed chemical reaction networks often
relies on sample path simulation using Monte Carlo methods, even though these
methods suffer from typical slow $\mathcal{O}(N^{-1/2})$ convergence rates as a
function of the number of sample paths $N$. This paper investigates the
combination of (randomised) quasi-Monte Carlo methods with an efficient sample
path simulation procedure, namely $\tau$-leaping. We show that this combination
is often more effective than traditional Monte Carlo simulation in terms of the
decay of statistical errors. The observed convergence rate behaviour is,
however, non-trivial due to the discrete nature of the models of chemical
reactions. We explain how this affects the performance of quasi-Monte Carlo
methods by looking at a test problem in standard quadrature.
| q-bio.QM | quasimonte carlo methods have proven to be effective extensions of traditional monte carlo methods in amongst others problems of quadrature and the sample path simulation of stochastic differential equations by replacing the random number input stream in a simulation procedure by a lowdiscrepancy number input stream variance reductions of several orders have been observed in financial applications analysis of stochastic effects in wellmixed chemical reaction networks often relies on sample path simulation using monte carlo methods even though these methods suffer from typical slow mathcalon12 convergence rates as a function of the number of sample paths n this paper investigates the combination of randomised quasimonte carlo methods with an efficient sample path simulation procedure namely tauleaping we show that this combination is often more effective than traditional monte carlo simulation in terms of the decay of statistical errors the observed convergence rate behaviour is however nontrivial due to the discrete nature of the models of chemical reactions we explain how this affects the performance of quasimonte carlo methods by looking at a test problem in standard quadrature | [['quasimonte', 'carlo', 'methods', 'have', 'proven', 'to', 'be', 'effective', 'extensions', 'of', 'traditional', 'monte', 'carlo', 'methods', 'in', 'amongst', 'others', 'problems', 'of', 'quadrature', 'and', 'the', 'sample', 'path', 'simulation', 'of', 'stochastic', 'differential', 'equations', 'by', 'replacing', 'the', 'random', 'number', 'input', 'stream', 'in', 'a', 'simulation', 'procedure', 'by', 'a', 'lowdiscrepancy', 'number', 'input', 'stream', 'variance', 'reductions', 'of', 'several', 'orders', 'have', 'been', 'observed', 'in', 'financial', 'applications', 'analysis', 'of', 'stochastic', 'effects', 'in', 'wellmixed', 'chemical', 'reaction', 'networks', 'often', 'relies', 'on', 'sample', 'path', 'simulation', 'using', 'monte', 'carlo', 'methods', 'even', 'though', 'these', 'methods', 'suffer', 'from', 'typical', 'slow', 'mathcalon12', 'convergence', 'rates', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'sample', 'paths', 'n', 'this', 'paper', 'investigates', 'the', 'combination', 'of', 'randomised', 'quasimonte', 'carlo', 'methods', 'with', 'an', 'efficient', 'sample', 'path', 'simulation', 'procedure', 'namely', 'tauleaping', 'we', 'show', 'that', 'this', 'combination', 'is', 'often', 'more', 'effective', 'than', 'traditional', 'monte', 'carlo', 'simulation', 'in', 'terms', 'of', 'the', 'decay', 'of', 'statistical', 'errors', 'the', 'observed', 'convergence', 'rate', 'behaviour', 'is', 'however', 'nontrivial', 'due', 'to', 'the', 'discrete', 'nature', 'of', 'the', 'models', 'of', 'chemical', 'reactions', 'we', 'explain', 'how', 'this', 'affects', 'the', 'performance', 'of', 'quasimonte', 'carlo', 'methods', 'by', 'looking', 'at', 'a', 'test', 'problem', 'in', 'standard', 'quadrature']] | [-0.07094115320603642, 0.06843513572178478, -0.10070072712082716, 0.10987446675179684, -0.016788848978705705, -0.08444837849892381, 0.08669939660335664, 0.40754579375945243, -0.297103828492727, -0.3466788069739685, 0.09941382368363566, -0.27352500624170706, -0.13442375003833765, 0.25399416991072776, -0.049123900526829356, 0.1149945358435313, 0.14280224350507315, -0.05569263852838069, -0.08829378190129406, -0.2908504064889404, 0.24411004876635217, 0.09718352346812602, 0.2808510263339948, -0.07615538135481377, 0.09860771700264992, 0.0030877385788339344, -0.08698802312052056, 0.031133157222158155, -0.13531989948371048, 0.08564895045210866, 0.24647482806030482, 0.1083464831571584, 0.3256598270608712, -0.428820731738381, -0.23364614453600815, 0.16672137553282715, 0.1917956574602279, 0.14320728176215528, -0.06290330546015234, -0.22014799481652425, 0.07156145351539013, -0.18244885187069912, -0.09519221608153423, -0.09034950558180357, -0.06351392952091255, 0.08931545181249895, -0.27964508335242877, 0.09355759455284399, 0.002361093426786237, 0.106233244030447, 0.0630636264143859, -0.1707430821343583, 0.027937910257770263, 0.05582096721808621, 0.06417514944559563, -0.002721295388656179, 0.10499326070760098, -0.10646276454188687, -0.20619106420847236, 0.34263782360522593, -0.025027535539163186, -0.2219582584260379, 0.19428537545546806, -0.08594473122782205, -0.14014299895277635, 0.19799359881261228, 0.18279534616733845, 0.1765381494658015, -0.18109677413394307, 0.09707035603610757, 0.02246669265652065, 0.13073050996846397, 0.0027309119343589257, -0.0051761159941680355, 0.09414407573037717, 0.20175996170205585, 0.044229726493884784, 0.12288374673919805, -0.100407367049306, -0.20091490896608113, -0.24248862917677072, -0.1311995312157166, -0.20002030382606353, 0.03263685153994583, -0.14421986266409934, -0.19544830172727842, 0.3034900959665324, 0.24036517465950152, 0.13229143246745237, 0.09339885836260625, 0.3454561007503778, 0.11721740776638759, 0.03518474353924604, 0.060616548720347344, 0.17316085740523993, 0.12815729065108938, 0.06991655326653588, -0.24136549802457566, 0.12791887001860572, 0.10208993196213818] |
1,802.01212 | Non-Gaussian information from weak lensing data via deep learning | Weak lensing maps contain information beyond two-point statistics on small
scales. Much recent work has tried to extract this information through a range
of different observables or via nonlinear transformations of the lensing field.
Here we train and apply a 2D convolutional neural network to simulated
noiseless lensing maps covering 96 different cosmological models over a range
of {$\Omega_m,\sigma_8$}. Using the area of the confidence contour in the
{$\Omega_m,\sigma_8$} plane as a figure-of-merit, derived from simulated
convergence maps smoothed on a scale of 1.0 arcmin, we show that the neural
network yields $\approx 5 \times$ tighter constraints than the power spectrum,
and $\approx 4 \times$ tighter than the lensing peaks. Such gains illustrate
the extent to which weak lensing data encode cosmological information not
accessible to the power spectrum or even other, non-Gaussian statistics such as
lensing peaks.
| astro-ph.CO cs.LG stat.ML | weak lensing maps contain information beyond twopoint statistics on small scales much recent work has tried to extract this information through a range of different observables or via nonlinear transformations of the lensing field here we train and apply a 2d convolutional neural network to simulated noiseless lensing maps covering 96 different cosmological models over a range of omega_msigma_8 using the area of the confidence contour in the omega_msigma_8 plane as a figureofmerit derived from simulated convergence maps smoothed on a scale of 10 arcmin we show that the neural network yields approx 5 times tighter constraints than the power spectrum and approx 4 times tighter than the lensing peaks such gains illustrate the extent to which weak lensing data encode cosmological information not accessible to the power spectrum or even other nongaussian statistics such as lensing peaks | [['weak', 'lensing', 'maps', 'contain', 'information', 'beyond', 'twopoint', 'statistics', 'on', 'small', 'scales', 'much', 'recent', 'work', 'has', 'tried', 'to', 'extract', 'this', 'information', 'through', 'a', 'range', 'of', 'different', 'observables', 'or', 'via', 'nonlinear', 'transformations', 'of', 'the', 'lensing', 'field', 'here', 'we', 'train', 'and', 'apply', 'a', '2d', 'convolutional', 'neural', 'network', 'to', 'simulated', 'noiseless', 'lensing', 'maps', 'covering', '96', 'different', 'cosmological', 'models', 'over', 'a', 'range', 'of', 'omega_msigma_8', 'using', 'the', 'area', 'of', 'the', 'confidence', 'contour', 'in', 'the', 'omega_msigma_8', 'plane', 'as', 'a', 'figureofmerit', 'derived', 'from', 'simulated', 'convergence', 'maps', 'smoothed', 'on', 'a', 'scale', 'of', '10', 'arcmin', 'we', 'show', 'that', 'the', 'neural', 'network', 'yields', 'approx', '5', 'times', 'tighter', 'constraints', 'than', 'the', 'power', 'spectrum', 'and', 'approx', '4', 'times', 'tighter', 'than', 'the', 'lensing', 'peaks', 'such', 'gains', 'illustrate', 'the', 'extent', 'to', 'which', 'weak', 'lensing', 'data', 'encode', 'cosmological', 'information', 'not', 'accessible', 'to', 'the', 'power', 'spectrum', 'or', 'even', 'other', 'nongaussian', 'statistics', 'such', 'as', 'lensing', 'peaks']] | [-0.08123214417002231, 0.02690554372763828, -0.07519412599166558, 0.1375507518448327, -0.07475747542955197, -0.12577815562574382, -0.012020561132121129, 0.3525981485735679, -0.263347389422816, -0.33814524125267303, 0.08254324565759684, -0.3150295177542105, -0.09877620363587757, 0.2599890435880482, 0.013454175733056838, 0.06406169552760928, 0.053881171532312706, -0.007698301509346651, -0.11823569264505869, -0.2787294786657963, 0.28925948229658865, 0.10602750216165314, 0.2773701470519038, 0.0028921667270470357, 0.13031276405377287, -0.02507436551884208, -0.07371055593197841, 0.059180384346594415, -0.17117965131504773, 0.08211799430917355, 0.21217906627200558, 0.15369254980317276, 0.2388054271620037, -0.3724256242773887, -0.2488478629687882, 0.1320823674981037, 0.16658991469117557, 0.11663560806419296, 0.00969266693573445, -0.31693043185236014, 0.08217293347326526, -0.1504087860196613, -0.023240345236642854, -0.06322402204555608, -0.031068699173730514, 0.018570536086200806, -0.2705061768377335, 0.16110403296045042, 0.014896605467504782, 0.07287052908804321, 0.004449348623418938, -0.08653048840283915, -0.03133623304007494, 0.09794219679104677, 0.0016230564405028101, 0.07117146047834388, 0.1908903868727224, -0.16312798040250884, -0.04576819238887317, 0.36733076067057613, -0.09648175046216541, -0.14677907113471758, 0.1419294230569073, -0.18064789185840366, -0.17180671932283734, 0.12234133077393947, 0.2195174812231267, 0.06449376242285919, -0.1337780503022984, 0.04632102169579003, -0.01619229961247386, 0.2554205418682482, 0.1066228126688604, 0.057067737580560475, 0.249442044429589, 0.11028947008341766, 0.11510095326567366, 0.10311320994388433, -0.20031052969220647, -0.04700097038100163, -0.23238306098442146, -0.00802365255177669, -0.18395091679396, 0.10103339092661306, -0.17888946542360287, -0.13115045712396933, 0.41903817393155635, 0.19082069303165528, 0.2508434868464921, 0.15960355965923384, 0.33245828380450554, 0.07576988041367166, 0.11068042490185927, 0.03375895010590877, 0.2720261441975616, 0.13488207451756234, 0.09031354232802583, -0.10469321121522428, -0.0340479780486245, -0.026370642914274788] |
1,802.01213 | Points of constancy of the periodic linearized Korteweg--deVries
equation | We investigate the points of constancy in the piecewise constant solution
profiles of the periodic linearized Korteweg--deVries equation with step
function initial data at rational times. The solution formulas are given by
certain Weyl sums, and we employ number theoretic techniques, including Kummer
sums, in our analysis. These results constitute an initial attempt to
understand the phenomenon of "fractalization" observed at irrational times.
| math.NT hep-th math.AP | we investigate the points of constancy in the piecewise constant solution profiles of the periodic linearized kortewegdevries equation with step function initial data at rational times the solution formulas are given by certain weyl sums and we employ number theoretic techniques including kummer sums in our analysis these results constitute an initial attempt to understand the phenomenon of fractalization observed at irrational times | [['we', 'investigate', 'the', 'points', 'of', 'constancy', 'in', 'the', 'piecewise', 'constant', 'solution', 'profiles', 'of', 'the', 'periodic', 'linearized', 'kortewegdevries', 'equation', 'with', 'step', 'function', 'initial', 'data', 'at', 'rational', 'times', 'the', 'solution', 'formulas', 'are', 'given', 'by', 'certain', 'weyl', 'sums', 'and', 'we', 'employ', 'number', 'theoretic', 'techniques', 'including', 'kummer', 'sums', 'in', 'our', 'analysis', 'these', 'results', 'constitute', 'an', 'initial', 'attempt', 'to', 'understand', 'the', 'phenomenon', 'of', 'fractalization', 'observed', 'at', 'irrational', 'times']] | [-0.16913041327562597, 0.04498259599218034, -0.10521724741787665, 0.0560755722283844, -0.04467041265692503, -0.12512482531250468, 0.036715377451083255, 0.3242314135330537, -0.2893466470940482, -0.28002196591391804, 0.10546234736795582, -0.2951899359800986, -0.14872860498652454, 0.1776296669646861, -0.03956850963189185, 0.11041498179769232, 0.013249136400335128, 0.0351418097252174, -0.09941566930640311, -0.28608088651561137, 0.34195087087296305, -0.03433281535953505, 0.25078843378772336, 0.018444662470193135, 0.1099923240438488, -0.006021595981326841, -0.0476545203654539, -0.05937812733648729, -0.2149024244604839, 0.07689293000906233, 0.2512721925722583, 0.09088088897249055, 0.25433973299842033, -0.46521117348992636, -0.16444294028989379, 0.12214434662804244, 0.14798325972099388, 0.10390747512971597, -0.017384786129234327, -0.2522340054431605, 0.07821748698396343, -0.08849928387632919, -0.2713842103923006, -0.07625683400011252, 0.013531021677726318, 0.09463429935867824, -0.23638524174217193, 0.08873126456247908, 0.03269433814825283, 0.08643605907462419, -0.12589325399566736, -0.12292390757994283, 0.028624291213909313, 0.08108298236592895, 0.09157979015689639, 0.007550115349687754, 0.06012741205770345, -0.09182908966959942, -0.08508550886818696, 0.3620497909566713, -0.09338381470713232, -0.22866998133984107, 0.11267654316884185, -0.15771280581663763, -0.14235872000692382, 0.14367235289324845, 0.14183455463942318, 0.1383455430364443, -0.06252523009306825, 0.08067186655650388, -0.06601885536182968, 0.10717837753084798, 0.1269260728657837, -0.009872597398325092, 0.1809583328782566, 0.06384435403973811, 0.04816249752831128, 0.12439043923384613, -0.030785129400014523, -0.0991774721085907, -0.3487755066109082, -0.1169998124094, -0.15066330723227964, 0.10332747089994392, -0.15899798092926623, -0.19042360587489038, 0.3851325468174995, 0.10872731731820201, 0.20305882165178893, 0.09230762518691046, 0.2376922344639232, 0.203805969179874, 0.020732100879300445, 0.045316157581669, 0.15511610706166792, 0.14140470856283274, 0.09339221605351047, -0.1885064802601904, 0.03886321795335601, 0.16116336851365984] |
1,802.01214 | On Quadratic Embedding Constants of Star Product Graphs | A connected graph $G$ is of QE class if it admits a quadratic embedding in a
Hilbert space, or equivalently if the distance matrix is conditionally negative
definite, or equivalently if the quadratic embedding constant $\mathrm{QEC}(G)$
is non-positive. For a finite star product of (finite or infinite) graphs
$G=G_1\star\dotsb \star G_r$ an estimate of $\mathrm{QEC}(G)$ is obtained after
a detailed analysis of the minimal solution of a certain algebraic equation.
For the path graph $P_n$ an implicit formula for $\mathrm{QEC}(P_n)$ is
derived, and by limit argument
$\mathrm{QEC}(\mathbb{Z})=\mathrm{QEC}(\mathbb{Z}_+)=-1/2$ is shown. During the
discussion a new integer sequence is found.
| math.CO | a connected graph g is of qe class if it admits a quadratic embedding in a hilbert space or equivalently if the distance matrix is conditionally negative definite or equivalently if the quadratic embedding constant mathrmqecg is nonpositive for a finite star product of finite or infinite graphs gg_1stardotsb star g_r an estimate of mathrmqecg is obtained after a detailed analysis of the minimal solution of a certain algebraic equation for the path graph p_n an implicit formula for mathrmqecp_n is derived and by limit argument mathrmqecmathbbzmathrmqecmathbbz_12 is shown during the discussion a new integer sequence is found | [['a', 'connected', 'graph', 'g', 'is', 'of', 'qe', 'class', 'if', 'it', 'admits', 'a', 'quadratic', 'embedding', 'in', 'a', 'hilbert', 'space', 'or', 'equivalently', 'if', 'the', 'distance', 'matrix', 'is', 'conditionally', 'negative', 'definite', 'or', 'equivalently', 'if', 'the', 'quadratic', 'embedding', 'constant', 'mathrmqecg', 'is', 'nonpositive', 'for', 'a', 'finite', 'star', 'product', 'of', 'finite', 'or', 'infinite', 'graphs', 'gg_1stardotsb', 'star', 'g_r', 'an', 'estimate', 'of', 'mathrmqecg', 'is', 'obtained', 'after', 'a', 'detailed', 'analysis', 'of', 'the', 'minimal', 'solution', 'of', 'a', 'certain', 'algebraic', 'equation', 'for', 'the', 'path', 'graph', 'p_n', 'an', 'implicit', 'formula', 'for', 'mathrmqecp_n', 'is', 'derived', 'and', 'by', 'limit', 'argument', 'mathrmqecmathbbzmathrmqecmathbbz_12', 'is', 'shown', 'during', 'the', 'discussion', 'a', 'new', 'integer', 'sequence', 'is', 'found']] | [-0.15530767348239458, 0.13303491504523673, -0.10139744475443838, 0.07557678304146975, -0.14259073816199777, -0.16744215430451498, 0.02408928041701876, 0.34349252125849167, -0.2998257532956139, -0.22812821001054778, 0.13077729364721885, -0.28312794472621655, -0.1299840512351253, 0.17108505302589508, -0.05652807453166573, -0.005523529808758007, 0.12112727985587171, 0.1648320274387476, -0.10285627564555534, -0.24236507353595688, 0.3593000304254313, -0.030834752345277418, 0.17853348588030185, 0.07643683707111225, 0.18192057331563324, 0.031097029736365682, -0.02170440202118248, 0.04182871477647124, -0.1305196252767302, 0.06977926513120052, 0.24339330227925413, 0.12884027396719303, 0.30154770208142134, -0.3491218210828881, -0.18768716366180488, 0.20750754123293264, 0.12879810985353005, 0.025941333092588892, -0.02490366911715878, -0.21336786930138865, 0.13974732310781557, -0.16253922637226562, -0.1254277553819921, -0.008760231910073149, 0.1058659531121012, -0.04096565298956408, -0.31975362706874366, 0.013130353095250265, 0.1281715409669985, 0.06106925942003727, -0.02703015518785324, -0.10080317340125279, -0.0416310580938013, 0.0542274179683137, -0.03407036728145535, 0.08622405130756639, 0.03828067150247354, -0.07955291656456807, -0.09073117121513333, 0.3655976722046973, -0.09594378052517191, -0.2463524765685521, 0.06652022903955351, -0.11310771412606682, -0.10458334328065957, 0.13665559411209116, 0.07473837281827644, 0.17315234295943732, -0.1086544877879562, 0.19084877796128133, -0.08885229532656971, 0.1496194582582722, 0.06631600544337303, -0.04549679006399807, 0.16483110555183825, 0.1201955120514838, 0.151738135800046, 0.15447241216597538, 0.023979196575300028, -0.051564769729250864, -0.33632871324336655, -0.16949956301820054, -0.25161632202485557, 0.14792918440790706, -0.18669372567671016, -0.23096264901875158, 0.33589371258232703, -0.03534372050755767, 0.17985421758625778, 0.12155773544744138, 0.2388578195685661, 0.19407002470125595, 0.030436635260239885, 0.08256593818015229, 0.113503120984802, 0.2012926337499452, -0.025904557677686856, -0.1695525200677014, 0.07840593978862768, 0.1766247627956252] |
1,802.01215 | Prime and M\"obius correlations for very short intervals in
$\mathbb{F}_q[x]$ | We investigate function field analogs of the distribution of primes, and
prime $k$-tuples, in "very short intervals" of the form $I(f) := \{ f(x) + a :
a \in \mathbb{F}_p \}$ for $f(x) \in \mathbb{F}_p[x]$ and $p$ prime, as well as
cancellation in sums of function field analogs of the M\"obius $\mu$ function
and its correlations (similar to sums appearing in Chowla's conjecture). For
generic $f$, i.e., for $f$ a Morse polynomial, the error terms are roughly of
size $O(\sqrt{p})$ (with typical main terms of order $p$).
For non-generic $f$ we prove that independence still holds for "generic" set
of shifts. We can also exhibit examples for which there is no cancellation at
all in M\"obius/Chowla type sums (in fact, it turns out that (square root)
cancellation in M\"obius sums is {\em equivalent} to (square root) cancellation
in Chowla type sums), as well as intervals where the heuristic "primes are
independent" fails badly.
The results are deduced from a general theorem on correlations of arithmetic
class functions; these include characteristic functions on primes, the M\"obius
$\mu$ function, and divisor functions (e.g., function field analogs of the
Titchmarsh divisor problem can be treated.) We also prove analogous, but
slightly weaker, results in the more delicate fixed characteristic setting,
i.e., for $f(x) \in \mathbb{F}_q[x]$ and intervals of the form $f(x) +a$ for $a
\in \mathbb{F}_q$, where $p$ is fixed and $q=p^{l}$ grows.
| math.NT | we investigate function field analogs of the distribution of primes and prime ktuples in very short intervals of the form if fx a a in mathbbf_p for fx in mathbbf_px and p prime as well as cancellation in sums of function field analogs of the mobius mu function and its correlations similar to sums appearing in chowlas conjecture for generic f ie for f a morse polynomial the error terms are roughly of size osqrtp with typical main terms of order p for nongeneric f we prove that independence still holds for generic set of shifts we can also exhibit examples for which there is no cancellation at all in mobiuschowla type sums in fact it turns out that square root cancellation in mobius sums is em equivalent to square root cancellation in chowla type sums as well as intervals where the heuristic primes are independent fails badly the results are deduced from a general theorem on correlations of arithmetic class functions these include characteristic functions on primes the mobius mu function and divisor functions eg function field analogs of the titchmarsh divisor problem can be treated we also prove analogous but slightly weaker results in the more delicate fixed characteristic setting ie for fx in mathbbf_qx and intervals of the form fx a for a in mathbbf_q where p is fixed and qpl grows | [['we', 'investigate', 'function', 'field', 'analogs', 'of', 'the', 'distribution', 'of', 'primes', 'and', 'prime', 'ktuples', 'in', 'very', 'short', 'intervals', 'of', 'the', 'form', 'if', 'fx', 'a', 'a', 'in', 'mathbbf_p', 'for', 'fx', 'in', 'mathbbf_px', 'and', 'p', 'prime', 'as', 'well', 'as', 'cancellation', 'in', 'sums', 'of', 'function', 'field', 'analogs', 'of', 'the', 'mobius', 'mu', 'function', 'and', 'its', 'correlations', 'similar', 'to', 'sums', 'appearing', 'in', 'chowlas', 'conjecture', 'for', 'generic', 'f', 'ie', 'for', 'f', 'a', 'morse', 'polynomial', 'the', 'error', 'terms', 'are', 'roughly', 'of', 'size', 'osqrtp', 'with', 'typical', 'main', 'terms', 'of', 'order', 'p', 'for', 'nongeneric', 'f', 'we', 'prove', 'that', 'independence', 'still', 'holds', 'for', 'generic', 'set', 'of', 'shifts', 'we', 'can', 'also', 'exhibit', 'examples', 'for', 'which', 'there', 'is', 'no', 'cancellation', 'at', 'all', 'in', 'mobiuschowla', 'type', 'sums', 'in', 'fact', 'it', 'turns', 'out', 'that', 'square', 'root', 'cancellation', 'in', 'mobius', 'sums', 'is', 'em', 'equivalent', 'to', 'square', 'root', 'cancellation', 'in', 'chowla', 'type', 'sums', 'as', 'well', 'as', 'intervals', 'where', 'the', 'heuristic', 'primes', 'are', 'independent', 'fails', 'badly', 'the', 'results', 'are', 'deduced', 'from', 'a', 'general', 'theorem', 'on', 'correlations', 'of', 'arithmetic', 'class', 'functions', 'these', 'include', 'characteristic', 'functions', 'on', 'primes', 'the', 'mobius', 'mu', 'function', 'and', 'divisor', 'functions', 'eg', 'function', 'field', 'analogs', 'of', 'the', 'titchmarsh', 'divisor', 'problem', 'can', 'be', 'treated', 'we', 'also', 'prove', 'analogous', 'but', 'slightly', 'weaker', 'results', 'in', 'the', 'more', 'delicate', 'fixed', 'characteristic', 'setting', 'ie', 'for', 'fx', 'in', 'mathbbf_qx', 'and', 'intervals', 'of', 'the', 'form', 'fx', 'a', 'for', 'a', 'in', 'mathbbf_q', 'where', 'p', 'is', 'fixed', 'and', 'qpl', 'grows']] | [-0.20360947999922377, 0.08878979349641927, -0.08868798826629895, 0.14991746516534477, -0.02018725738863785, -0.13415675035503227, 0.01499267951424242, 0.32528884964995086, -0.30955951226808665, -0.22916517316480167, 0.06768560780723679, -0.2764409558866256, -0.1488697028461112, 0.2217983506353838, -0.08050682041773273, 0.029235312600576435, -0.007367893529590219, 0.08099019445944577, -0.09774342051657316, -0.2960948005867457, 0.32715911126225755, -0.057575473386220564, 0.18534398038692806, 0.05868970530614855, 0.05315288656856865, 0.05611620773977068, 0.03055078909736559, 0.004188328184682177, -0.12062844252932337, 0.03188905374190654, 0.2710665882727231, 0.08782856388094322, 0.27735393105467665, -0.3607086840092961, -0.11743133705697671, 0.19839896444838295, 0.15945276360558377, -0.013071618509067255, 0.007638678357644884, -0.18826011148900892, 0.13075587423060955, -0.12562783026286134, -0.15071140802423802, -0.056667810064807, 0.07299779301839797, 0.10226768141313057, -0.34232795438063995, 0.06668107633881196, 0.09256578508211533, 0.12619419217246883, -0.010128287014854973, -0.21116284744545868, 0.047755702092607474, 0.0579697795411838, 0.059851550647830924, 0.08010353198395544, 0.02614120478600463, -0.10841579238227236, -0.06589922911890815, 0.37597801738801145, -0.0752734697255489, -0.22729802054735565, 0.10616673431338443, -0.2003203261473183, -0.15898008377657138, 0.12770538523909636, 0.11483621199658955, 0.13298912143103994, -0.042415422728351714, 0.15473407774542075, -0.10952092129238215, 0.11745380475310542, 0.13756456011781534, 0.05405382627603623, 0.1552593590700521, 0.01950586476388188, 0.08361703445760733, 0.14837173019675123, -0.02283563145777277, -0.042514011139116646, -0.3880240771270889, -0.156820278161961, -0.2019729685276356, 0.13386413567682862, -0.1012800057772308, -0.20307481418006187, 0.36026850726505344, 0.06543421408839224, 0.17120972887745925, 0.1492710559567578, 0.19947100855590957, 0.14661878901155692, 0.0877917632127979, 0.05201391221427392, 0.10418302582028056, 0.1546524316166012, -0.022170100981514094, -0.11426861319965351, 0.04311980810806355, 0.13527488457995268] |
1,802.01216 | Observation of $e^{+}e^{-} \rightarrow K\bar{K}J/\psi$ at center-of-mass
energies from 4.189 to 4.600 GeV | We investigate the process $e^{+}e^{-} \rightarrow K\bar{K}J/\psi$ at
center-of-mass energies from 4.189 to 4.600 GeV using 4.7 fb$^{-1}$ of data
collected by the BESIII detector at the BEPCII collider. The Born cross
sections for the reactions $e^{+}e^{-} \rightarrow K^{+}K^{-}J/\psi$ and
$K_{S}^{0} K_{S}^{0} J/\psi$ are measured as a function of center-of-mass
energy. The energy dependence of the cross section for $e^{+}e^{-} \rightarrow
K^{+}K^{-}J/\psi$ is shown to differ from that for $\pi^{+}\pi^{-}J/\psi$ in
the region around the $Y(4260)$. In addition, there is evidence for a structure
around 4.5 GeV in the $e^{+}e^{-} \rightarrow K^{+}K^{-}J/\psi$ cross section
that is not present in $\pi^{+}\pi^{-}J/\psi$.
| hep-ex | we investigate the process ee rightarrow kbarkjpsi at centerofmass energies from 4189 to 4600 gev using 47 fb1 of data collected by the besiii detector at the bepcii collider the born cross sections for the reactions ee rightarrow kkjpsi and k_s0 k_s0 jpsi are measured as a function of centerofmass energy the energy dependence of the cross section for ee rightarrow kkjpsi is shown to differ from that for pipijpsi in the region around the y4260 in addition there is evidence for a structure around 45 gev in the ee rightarrow kkjpsi cross section that is not present in pipijpsi | [['we', 'investigate', 'the', 'process', 'ee', 'rightarrow', 'kbarkjpsi', 'at', 'centerofmass', 'energies', 'from', '4189', 'to', '4600', 'gev', 'using', '47', 'fb1', 'of', 'data', 'collected', 'by', 'the', 'besiii', 'detector', 'at', 'the', 'bepcii', 'collider', 'the', 'born', 'cross', 'sections', 'for', 'the', 'reactions', 'ee', 'rightarrow', 'kkjpsi', 'and', 'k_s0', 'k_s0', 'jpsi', 'are', 'measured', 'as', 'a', 'function', 'of', 'centerofmass', 'energy', 'the', 'energy', 'dependence', 'of', 'the', 'cross', 'section', 'for', 'ee', 'rightarrow', 'kkjpsi', 'is', 'shown', 'to', 'differ', 'from', 'that', 'for', 'pipijpsi', 'in', 'the', 'region', 'around', 'the', 'y4260', 'in', 'addition', 'there', 'is', 'evidence', 'for', 'a', 'structure', 'around', '45', 'gev', 'in', 'the', 'ee', 'rightarrow', 'kkjpsi', 'cross', 'section', 'that', 'is', 'not', 'present', 'in', 'pipijpsi']] | [-0.04093669637722537, 0.13470377512464318, -0.09165073687568157, 0.11929348006917206, 0.052798634489076304, -0.043546194436423706, 0.014998544981195168, 0.345591157975823, -0.18494891213968095, -0.2354128272884121, -0.10311991664007156, -0.4647071087789355, 0.11604828318825575, 0.19373110737157703, 0.13698225581020146, 0.12349322497976398, 0.13983929869389594, 0.05159983681479582, -0.008872444539170975, -0.1353377259096526, 0.2421935134087548, 0.1436166696796062, 0.22660372038418897, 0.1818639880253209, 0.056515502198975574, 0.06185967250752987, 0.04246885567489597, -0.12983696427986477, -0.19191808070157856, -0.012877789631749343, 0.34458781331730537, 0.10408639738505537, 0.09382272702924004, -0.28329550574599494, 0.012757757622184175, 0.22085304463322208, 0.15492869663814252, -0.009559646512221808, -0.013804034038324548, -0.3705744866394635, 0.20169040754512704, -0.23497843981315994, -0.036517770023724874, 0.01748585311996967, 0.08420860461627293, -0.07820991825575781, -0.32507080702649693, 0.09518846629582571, -0.09297187769352788, 0.08679176448383416, -0.06684547166499977, -0.23971002731434624, -0.08091315148266578, -0.09570882420497712, 0.05016900648244167, 0.10142023348240088, 0.20936402759862818, -0.09694169898225803, -0.18081476168725827, 0.3454318742521785, -0.052369390905957026, -0.10471248210906381, 0.11796041552184357, -0.2541546235284345, -0.11567531940245042, 0.2733422619375316, 0.2965910778841888, 0.053841155986630855, -0.24283714664951814, 0.17104845621442008, 0.03046886698634486, 0.16580013423336282, 0.15786231575872411, 0.03740149870928791, 0.12603957284561762, 0.22482509006901333, -0.016682958196274786, 0.060182683591994295, -0.17855879076935274, -0.025889680951344547, -0.4527293187613138, -0.1436748265693284, -0.062384901375443946, 0.12333677753331633, 0.05909417328589967, 0.03395191943090682, 0.29103869026658513, 0.016602781038576115, 0.40008778505102555, -0.00018928202828674605, 0.2725657797806586, 0.14218595208049836, 0.03026682353781941, 0.09187653190218209, 0.36268432141102924, 0.12079923111249251, 0.18805209839848255, -0.23827987220702748, 0.03389180419176365, -0.02473131807125879] |
1,802.01217 | Balanced diagonals in frequency squares | We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry
occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$;
that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$
occurs $\lambda$ times per row and $\lambda$ times per column. We show that if
$m\leq 3$, $L$ contains a $\lambda$-balanced diagonal, with only one exception
up to equivalence when $m=2$. We give partial results for $m\geq 4$ and suggest
a generalization of Ryser's conjecture, that every latin square of odd order
has a transversal. Our method relies on first identifying a small substructure
with the frequency square that facilitates the task of locating a balanced
diagonal in the entire array.
| math.CO | we say that a diagonal in an array is em lambdabalanced if each entry occurs lambda times let l be a frequency square of type fnlambdam that is an ntimes n array in which each entry from 12dots m occurs lambda times per row and lambda times per column we show that if mleq 3 l contains a lambdabalanced diagonal with only one exception up to equivalence when m2 we give partial results for mgeq 4 and suggest a generalization of rysers conjecture that every latin square of odd order has a transversal our method relies on first identifying a small substructure with the frequency square that facilitates the task of locating a balanced diagonal in the entire array | [['we', 'say', 'that', 'a', 'diagonal', 'in', 'an', 'array', 'is', 'em', 'lambdabalanced', 'if', 'each', 'entry', 'occurs', 'lambda', 'times', 'let', 'l', 'be', 'a', 'frequency', 'square', 'of', 'type', 'fnlambdam', 'that', 'is', 'an', 'ntimes', 'n', 'array', 'in', 'which', 'each', 'entry', 'from', '12dots', 'm', 'occurs', 'lambda', 'times', 'per', 'row', 'and', 'lambda', 'times', 'per', 'column', 'we', 'show', 'that', 'if', 'mleq', '3', 'l', 'contains', 'a', 'lambdabalanced', 'diagonal', 'with', 'only', 'one', 'exception', 'up', 'to', 'equivalence', 'when', 'm2', 'we', 'give', 'partial', 'results', 'for', 'mgeq', '4', 'and', 'suggest', 'a', 'generalization', 'of', 'rysers', 'conjecture', 'that', 'every', 'latin', 'square', 'of', 'odd', 'order', 'has', 'a', 'transversal', 'our', 'method', 'relies', 'on', 'first', 'identifying', 'a', 'small', 'substructure', 'with', 'the', 'frequency', 'square', 'that', 'facilitates', 'the', 'task', 'of', 'locating', 'a', 'balanced', 'diagonal', 'in', 'the', 'entire', 'array']] | [-0.20148226934469352, 0.15853732343643737, 0.025896023907619765, -0.03603232885371515, -0.026004640930095465, -0.19080532217887625, 0.014038482471763834, 0.3554067058583437, -0.2227448798574002, -0.2358541665685075, 0.13285995122159722, -0.30107464577994797, -0.13167888059683333, 0.14084128210699912, -0.012671137496955314, -0.08474080871506515, 0.07515062581179506, 0.11888313146655337, -0.08356064832493094, -0.27349170730291406, 0.2322698573589767, -0.010699711025739878, 0.17178507861819403, 0.01686417140753277, 0.14930927196233454, 0.021682084778765754, 0.010334669770199364, 0.010307607992741642, -0.12308532284861046, 0.06313982356874415, 0.23646497299452707, 0.1338777351390444, 0.27505218324062053, -0.3574264264234906, -0.08665047068409305, 0.17702876047973157, 0.14059005676713474, 0.04183622871789987, 0.005473169445857342, -0.20388928493011302, 0.15436645742590635, -0.14940697236491715, -0.1714401736508234, 0.04016875896713365, 0.13984093873493247, -0.0011203098347631552, -0.3389187929362564, 0.03768159080320432, 0.11032067825011435, 0.019028227723630785, 0.031194880867171718, -0.21075098973430567, 0.002734292801706341, 0.09089217596747558, -0.035498392144691644, 0.07900091050828065, 0.025876585823795522, -0.04739979264435903, -0.08383833372697108, 0.3749109782294323, -0.07711805181550178, -0.20008456408661807, 0.07403732223783509, -0.18330934213600675, -0.14539352035291997, 0.16546640062104848, 0.09361972638516355, 0.10382639736300177, -0.01953147059383948, 0.1320984268874735, -0.15575358696416083, 0.2674065286104204, 0.1340411107087413, -0.023917638605965647, 0.1755932788009424, 0.14340592376982508, 0.15575131435752293, 0.13777439853559265, -0.09763007555393723, 0.00854742849813932, -0.3259497034497622, -0.15575268926193653, -0.21589681996285157, 0.15109832863860084, -0.1321955317881953, -0.13652684565601966, 0.34074140172767436, 0.09798687473886598, 0.21748679824236591, 0.08327223250930497, 0.23355144695418303, 0.06367303035123337, 0.09344587467563481, 0.1109265610812453, 0.08338426628891947, 0.134683931751524, -0.003764226481168515, -0.1579019404953677, -0.01787856950471967, 0.1262245669376926] |
1,802.01218 | Efficient Video Object Segmentation via Network Modulation | Video object segmentation targets at segmenting a specific object throughout
a video sequence, given only an annotated first frame. Recent deep learning
based approaches find it effective by fine-tuning a general-purpose
segmentation model on the annotated frame using hundreds of iterations of
gradient descent. Despite the high accuracy these methods achieve, the
fine-tuning process is inefficient and fail to meet the requirements of real
world applications. We propose a novel approach that uses a single forward pass
to adapt the segmentation model to the appearance of a specific object.
Specifically, a second meta neural network named modulator is learned to
manipulate the intermediate layers of the segmentation network given limited
visual and spatial information of the target object. The experiments show that
our approach is 70times faster than fine-tuning approaches while achieving
similar accuracy.
| cs.CV | video object segmentation targets at segmenting a specific object throughout a video sequence given only an annotated first frame recent deep learning based approaches find it effective by finetuning a generalpurpose segmentation model on the annotated frame using hundreds of iterations of gradient descent despite the high accuracy these methods achieve the finetuning process is inefficient and fail to meet the requirements of real world applications we propose a novel approach that uses a single forward pass to adapt the segmentation model to the appearance of a specific object specifically a second meta neural network named modulator is learned to manipulate the intermediate layers of the segmentation network given limited visual and spatial information of the target object the experiments show that our approach is 70times faster than finetuning approaches while achieving similar accuracy | [['video', 'object', 'segmentation', 'targets', 'at', 'segmenting', 'a', 'specific', 'object', 'throughout', 'a', 'video', 'sequence', 'given', 'only', 'an', 'annotated', 'first', 'frame', 'recent', 'deep', 'learning', 'based', 'approaches', 'find', 'it', 'effective', 'by', 'finetuning', 'a', 'generalpurpose', 'segmentation', 'model', 'on', 'the', 'annotated', 'frame', 'using', 'hundreds', 'of', 'iterations', 'of', 'gradient', 'descent', 'despite', 'the', 'high', 'accuracy', 'these', 'methods', 'achieve', 'the', 'finetuning', 'process', 'is', 'inefficient', 'and', 'fail', 'to', 'meet', 'the', 'requirements', 'of', 'real', 'world', 'applications', 'we', 'propose', 'a', 'novel', 'approach', 'that', 'uses', 'a', 'single', 'forward', 'pass', 'to', 'adapt', 'the', 'segmentation', 'model', 'to', 'the', 'appearance', 'of', 'a', 'specific', 'object', 'specifically', 'a', 'second', 'meta', 'neural', 'network', 'named', 'modulator', 'is', 'learned', 'to', 'manipulate', 'the', 'intermediate', 'layers', 'of', 'the', 'segmentation', 'network', 'given', 'limited', 'visual', 'and', 'spatial', 'information', 'of', 'the', 'target', 'object', 'the', 'experiments', 'show', 'that', 'our', 'approach', 'is', '70times', 'faster', 'than', 'finetuning', 'approaches', 'while', 'achieving', 'similar', 'accuracy']] | [-0.04440249953377269, -0.009448997942976647, -0.05895680451309131, 0.060349020924149954, -0.12496989421240652, -0.1951719748460924, 0.039204916292141234, 0.46523284733490045, -0.258021273115066, -0.37493861840565257, 0.053675640464774264, -0.2472420011216135, -0.13276937628971108, 0.15295902880624548, -0.16810248750470466, 0.0938572655080074, 0.1865363346739436, 0.09412681454542413, -0.07575875998877768, -0.2714254267273971, 0.2771335279572505, 0.051922185712888376, 0.3463553065719055, -0.013383027055359849, 0.21587892084160068, -0.0570675403665084, -0.021625897703551576, -0.03554294440624262, -0.04245517935715494, 0.22001491372000925, 0.27677572334798595, 0.1937070378266777, 0.3298844126358962, -0.4023854289583535, -0.2557425847860859, 0.06240435044712095, 0.15778516782899457, 0.12550904593993423, -0.04853858991935259, -0.3404520077130465, 0.127610303763884, -0.14707635739147523, 0.024788018969346338, -0.13811068199296941, -0.013170147811604747, -0.029683353567457715, -0.28091815297331996, 0.020243565528262616, 0.07399190234631967, 0.03974311816012626, -0.05898391992225548, -0.06695340041404785, 0.03166318394473073, 0.16971075621002646, -0.005823281962196899, 0.11039427937088367, 0.18621156720658277, -0.23096462770073273, -0.11116151826598668, 0.3547719171924044, -0.056724185413014626, -0.2062122477844024, 0.2063314443360319, -0.024133012386789516, -0.15035024010958567, 0.14822576501156523, 0.2116441860366717, 0.19674826413045512, -0.13561573973509358, -0.01824503277042714, -0.02540823621258362, 0.22876099699329752, 0.08067583583413498, -0.034576571755000014, 0.19783203640549596, 0.30720863031537693, 0.04996405684896536, 0.11991621441305128, -0.1759135901229456, -0.04644597529558771, -0.2519311964122662, -0.09714875892525775, -0.207095440279053, -0.06739159919748973, -0.11130036287849818, -0.13067627380386607, 0.38648061784429116, 0.24497964087575708, 0.2574999178551249, 0.10458451038775549, 0.3866371378413777, 0.023783836406898864, 0.13380449558191224, 0.0746500002630333, 0.19646300084944537, -0.025200858642694664, 0.16341388111051394, -0.16299132765257737, 0.07611040099360633, 0.08972570799471838] |
1,802.01219 | A game-theoretic derivation of the $\sqrt{dt}$ effect | We study the origins of the $\sqrt{dt}$ effect in finance and SDE. In
particular, we show, in the game-theoretic framework, that market volatility is
a consequence of the absence of riskless opportunities for making money and
that too high volatility is also incompatible with such opportunities. More
precisely, riskless opportunities for making money arise whenever a traded
security has fractal dimension below or above that of the Brownian motion and
its price is not almost constant and does not become extremely large. This is a
simple observation known in the measure-theoretic mathematical finance. At the
end of the article we also consider the case of non-zero interest rate.
This version of the article was essentially written in March 2005 but remains
a working paper.
| q-fin.MF | we study the origins of the sqrtdt effect in finance and sde in particular we show in the gametheoretic framework that market volatility is a consequence of the absence of riskless opportunities for making money and that too high volatility is also incompatible with such opportunities more precisely riskless opportunities for making money arise whenever a traded security has fractal dimension below or above that of the brownian motion and its price is not almost constant and does not become extremely large this is a simple observation known in the measuretheoretic mathematical finance at the end of the article we also consider the case of nonzero interest rate this version of the article was essentially written in march 2005 but remains a working paper | [['we', 'study', 'the', 'origins', 'of', 'the', 'sqrtdt', 'effect', 'in', 'finance', 'and', 'sde', 'in', 'particular', 'we', 'show', 'in', 'the', 'gametheoretic', 'framework', 'that', 'market', 'volatility', 'is', 'a', 'consequence', 'of', 'the', 'absence', 'of', 'riskless', 'opportunities', 'for', 'making', 'money', 'and', 'that', 'too', 'high', 'volatility', 'is', 'also', 'incompatible', 'with', 'such', 'opportunities', 'more', 'precisely', 'riskless', 'opportunities', 'for', 'making', 'money', 'arise', 'whenever', 'a', 'traded', 'security', 'has', 'fractal', 'dimension', 'below', 'or', 'above', 'that', 'of', 'the', 'brownian', 'motion', 'and', 'its', 'price', 'is', 'not', 'almost', 'constant', 'and', 'does', 'not', 'become', 'extremely', 'large', 'this', 'is', 'a', 'simple', 'observation', 'known', 'in', 'the', 'measuretheoretic', 'mathematical', 'finance', 'at', 'the', 'end', 'of', 'the', 'article', 'we', 'also', 'consider', 'the', 'case', 'of', 'nonzero', 'interest', 'rate', 'this', 'version', 'of', 'the', 'article', 'was', 'essentially', 'written', 'in', 'march', '2005', 'but', 'remains', 'a', 'working', 'paper']] | [-0.10869604096120794, 0.11464898023874528, -0.09226900182153669, 0.10646515191840608, -0.10826960522054803, -0.14056215062361932, 0.09007245963983869, 0.3632845329195862, -0.28830701685059934, -0.2562720489898516, 0.1734092546234493, -0.28592003104765146, -0.18714411562165967, 0.19993832986614096, -0.16171629665674822, -0.0015135458975677348, 0.025269841204487508, 0.023030804117180167, 0.024544312504135194, -0.2715482234357736, 0.2866347736102574, 0.05975100306433535, 0.25568320914810044, 0.0972264064081584, 0.13724179807374434, -0.014679790451942433, -0.037787890181906765, 0.025479582361801856, -0.14167579418068682, 0.12155234476461285, 0.26270858798130986, 0.08572755200551793, 0.35905269754209346, -0.3946342118827987, -0.16539074578172258, 0.1644408416271495, 0.09292690444647544, 0.0863695781201034, -0.040963903924421174, -0.2118168539769437, 0.030942726356912434, -0.22572769269707701, -0.17008452993937798, -0.06577754067597373, 0.061535272045030946, -0.025251147549434173, -0.2656575324719832, 0.08149805779882421, 0.09005947416441021, 0.06327088523492773, -0.026208331532430865, -0.07669846491227227, -0.0008509741314957219, 0.11060323537376168, 0.11998160576519196, -0.018385990806329515, 0.09822986908482327, -0.1499083276815532, -0.12545334331826458, 0.39657100069622, -0.07909333773498092, -0.16130240003938875, 0.1768126742981915, -0.19661227530694655, -0.16929507612686365, 0.10151467708900812, 0.15450793568555626, 0.058410802024281436, -0.1812798664003851, 0.13711298200594743, -0.05703607067135313, 0.15755576973090007, 0.07834285080823447, 0.03529769197977599, 0.1752602737547169, 0.18037942755824676, 0.12126335991178488, 0.09514358682152364, -0.040666274456006866, -0.15237306038879098, -0.3071698698425485, -0.1932278573311182, -0.16960013752630462, 0.09054771036631616, -0.0584141935908138, -0.16145596420392394, 0.34236271452579287, 0.16219179369434114, 0.1293983803160729, 0.07303595976390492, 0.25761502325504776, 0.12793484912253916, -0.02465490442926004, 0.10838359874492932, 0.2187132978316156, 0.0338584168648888, 0.1726056575914094, -0.1058258754755145, 0.15110488220929139, -0.0059268215949076315] |
1,802.0122 | The Effect Race in Fine-Grained Concurrency | Most existed work require knowledge about the effect of program instructions
(or statements) to analyze and verify algorithms. In this paper, by revealing
some findings on executions of object programs, we define two basic concepts --
effect equivalence relation and effect race relation. Further, we show three
effect theorems about the race and histories. The core result is that the
effect race relation is the accurate relation to capture the internal steps, of
which precedence orders are the reason to cause chaotic histories. In addition,
the concept -- linearization points -- widely used in the object verification,
is defined formally as the typical effect race relation. These results provide
a clear basis for analyzing intricate fine-grained executions. We conduct a lot
of experiments on real object algorithms to show the accuracy and efficiency of
these definitions in practice. A simple quantitative analysis method for these
algorithms is also proposed.
| cs.PL | most existed work require knowledge about the effect of program instructions or statements to analyze and verify algorithms in this paper by revealing some findings on executions of object programs we define two basic concepts effect equivalence relation and effect race relation further we show three effect theorems about the race and histories the core result is that the effect race relation is the accurate relation to capture the internal steps of which precedence orders are the reason to cause chaotic histories in addition the concept linearization points widely used in the object verification is defined formally as the typical effect race relation these results provide a clear basis for analyzing intricate finegrained executions we conduct a lot of experiments on real object algorithms to show the accuracy and efficiency of these definitions in practice a simple quantitative analysis method for these algorithms is also proposed | [['most', 'existed', 'work', 'require', 'knowledge', 'about', 'the', 'effect', 'of', 'program', 'instructions', 'or', 'statements', 'to', 'analyze', 'and', 'verify', 'algorithms', 'in', 'this', 'paper', 'by', 'revealing', 'some', 'findings', 'on', 'executions', 'of', 'object', 'programs', 'we', 'define', 'two', 'basic', 'concepts', 'effect', 'equivalence', 'relation', 'and', 'effect', 'race', 'relation', 'further', 'we', 'show', 'three', 'effect', 'theorems', 'about', 'the', 'race', 'and', 'histories', 'the', 'core', 'result', 'is', 'that', 'the', 'effect', 'race', 'relation', 'is', 'the', 'accurate', 'relation', 'to', 'capture', 'the', 'internal', 'steps', 'of', 'which', 'precedence', 'orders', 'are', 'the', 'reason', 'to', 'cause', 'chaotic', 'histories', 'in', 'addition', 'the', 'concept', 'linearization', 'points', 'widely', 'used', 'in', 'the', 'object', 'verification', 'is', 'defined', 'formally', 'as', 'the', 'typical', 'effect', 'race', 'relation', 'these', 'results', 'provide', 'a', 'clear', 'basis', 'for', 'analyzing', 'intricate', 'finegrained', 'executions', 'we', 'conduct', 'a', 'lot', 'of', 'experiments', 'on', 'real', 'object', 'algorithms', 'to', 'show', 'the', 'accuracy', 'and', 'efficiency', 'of', 'these', 'definitions', 'in', 'practice', 'a', 'simple', 'quantitative', 'analysis', 'method', 'for', 'these', 'algorithms', 'is', 'also', 'proposed']] | [-0.1114392133544467, 0.014473393441445818, -0.13864495466169838, 0.1487488194627126, -0.13098246058168478, -0.10556086121854207, 0.07776708296605399, 0.3746365059728492, -0.24501996161316503, -0.38083464131779865, 0.10782526286752665, -0.2437098972716254, -0.18276384777201288, 0.22302551361036882, -0.10300680377188917, 0.06336684867321858, 0.10281054094140354, 0.025450750399414412, -0.06344980850324596, -0.2699179708230475, 0.3331097524791752, 0.012010747764565765, 0.29568275920919157, 0.06969757407763336, 0.08911847766833253, -0.02571723280133271, -0.06133146441784011, 0.033065261402205656, -0.11807702028070782, 0.10292963875291793, 0.2625936383113571, 0.20149981184569124, 0.289484904157253, -0.4459942675973863, -0.13320154738165949, 0.08091315395144541, 0.11490372822848022, 0.1075387942787716, -0.02422264230928754, -0.2767983233908587, 0.09070149905603277, -0.17561839516466, -0.08017409394163486, -0.08996718283503456, 0.034041958800453236, -0.019753395002064206, -0.21585176024611477, 0.05006496902943544, 0.13059396773245033, 0.11628643079654453, -0.025996790194169502, -0.08624527361666567, 0.04238732261200474, 0.1620940589585201, 0.056972018602521046, -0.02818108212572765, 0.15016318468236659, -0.10045129860502552, -0.18593621567172341, 0.3656745917890986, -0.007856128042027967, -0.18804174527559392, 0.22107642660657428, -0.10868743210010333, -0.164180721287067, 0.03930652855412256, 0.15613965285074424, 0.11211339000306308, -0.13221528322901577, -0.00805823950014039, -0.037622657948977324, 0.18280758837888605, 0.055388994682388865, 0.04988064368300089, 0.20594126736579385, 0.17439111115168526, 0.02874861214922307, 0.13950112927545577, -0.04366525829042474, -0.10363129645981507, -0.27104714252565004, -0.17359732796048524, -0.09907989071248328, -0.027522303491722383, -0.07026488799561925, -0.130288417892824, 0.36396717079851315, 0.23351184791591886, 0.17899826605332225, 0.08310680839070438, 0.3315419262539825, 0.09044435033845805, 0.0717970593768644, 0.04931115307558124, 0.20160724694640472, 0.10936137239212707, 0.08753878739981415, -0.21138796505633078, 0.14158411376650304, 0.06845851363103887] |
1,802.01221 | Image Synthesis in Multi-Contrast MRI with Conditional Generative
Adversarial Networks | Acquiring images of the same anatomy with multiple different contrasts
increases the diversity of diagnostic information available in an MR exam. Yet,
scan time limitations may prohibit acquisition of certain contrasts, and images
for some contrast may be corrupted by noise and artifacts. In such cases, the
ability to synthesize unacquired or corrupted contrasts from remaining
contrasts can improve diagnostic utility. For multi-contrast synthesis, current
methods learn a nonlinear intensity transformation between the source and
target images, either via nonlinear regression or deterministic neural
networks. These methods can in turn suffer from loss of high-spatial-frequency
information in synthesized images. Here we propose a new approach for
multi-contrast MRI synthesis based on conditional generative adversarial
networks. The proposed approach preserves high-frequency details via an
adversarial loss; and it offers enhanced synthesis performance via a pixel-wise
loss for registered multi-contrast images and a cycle-consistency loss for
unregistered images. Information from neighboring cross-sections are utilized
to further improved synthesis quality. Demonstrations on T1- and T2-weighted
images from healthy subjects and patients clearly indicate the superior
performance of the proposed approach compared to previous state-of-the-art
methods. Our synthesis approach can help improve quality and versatility of
multi-contrast MRI exams without the need for prolonged examinations.
| cs.CV | acquiring images of the same anatomy with multiple different contrasts increases the diversity of diagnostic information available in an mr exam yet scan time limitations may prohibit acquisition of certain contrasts and images for some contrast may be corrupted by noise and artifacts in such cases the ability to synthesize unacquired or corrupted contrasts from remaining contrasts can improve diagnostic utility for multicontrast synthesis current methods learn a nonlinear intensity transformation between the source and target images either via nonlinear regression or deterministic neural networks these methods can in turn suffer from loss of highspatialfrequency information in synthesized images here we propose a new approach for multicontrast mri synthesis based on conditional generative adversarial networks the proposed approach preserves highfrequency details via an adversarial loss and it offers enhanced synthesis performance via a pixelwise loss for registered multicontrast images and a cycleconsistency loss for unregistered images information from neighboring crosssections are utilized to further improved synthesis quality demonstrations on t1 and t2weighted images from healthy subjects and patients clearly indicate the superior performance of the proposed approach compared to previous stateoftheart methods our synthesis approach can help improve quality and versatility of multicontrast mri exams without the need for prolonged examinations | [['acquiring', 'images', 'of', 'the', 'same', 'anatomy', 'with', 'multiple', 'different', 'contrasts', 'increases', 'the', 'diversity', 'of', 'diagnostic', 'information', 'available', 'in', 'an', 'mr', 'exam', 'yet', 'scan', 'time', 'limitations', 'may', 'prohibit', 'acquisition', 'of', 'certain', 'contrasts', 'and', 'images', 'for', 'some', 'contrast', 'may', 'be', 'corrupted', 'by', 'noise', 'and', 'artifacts', 'in', 'such', 'cases', 'the', 'ability', 'to', 'synthesize', 'unacquired', 'or', 'corrupted', 'contrasts', 'from', 'remaining', 'contrasts', 'can', 'improve', 'diagnostic', 'utility', 'for', 'multicontrast', 'synthesis', 'current', 'methods', 'learn', 'a', 'nonlinear', 'intensity', 'transformation', 'between', 'the', 'source', 'and', 'target', 'images', 'either', 'via', 'nonlinear', 'regression', 'or', 'deterministic', 'neural', 'networks', 'these', 'methods', 'can', 'in', 'turn', 'suffer', 'from', 'loss', 'of', 'highspatialfrequency', 'information', 'in', 'synthesized', 'images', 'here', 'we', 'propose', 'a', 'new', 'approach', 'for', 'multicontrast', 'mri', 'synthesis', 'based', 'on', 'conditional', 'generative', 'adversarial', 'networks', 'the', 'proposed', 'approach', 'preserves', 'highfrequency', 'details', 'via', 'an', 'adversarial', 'loss', 'and', 'it', 'offers', 'enhanced', 'synthesis', 'performance', 'via', 'a', 'pixelwise', 'loss', 'for', 'registered', 'multicontrast', 'images', 'and', 'a', 'cycleconsistency', 'loss', 'for', 'unregistered', 'images', 'information', 'from', 'neighboring', 'crosssections', 'are', 'utilized', 'to', 'further', 'improved', 'synthesis', 'quality', 'demonstrations', 'on', 't1', 'and', 't2weighted', 'images', 'from', 'healthy', 'subjects', 'and', 'patients', 'clearly', 'indicate', 'the', 'superior', 'performance', 'of', 'the', 'proposed', 'approach', 'compared', 'to', 'previous', 'stateoftheart', 'methods', 'our', 'synthesis', 'approach', 'can', 'help', 'improve', 'quality', 'and', 'versatility', 'of', 'multicontrast', 'mri', 'exams', 'without', 'the', 'need', 'for', 'prolonged', 'examinations']] | [0.02804336260451968, -0.010953646146045324, -0.055117038555967446, 0.07938363476792097, -0.0980695767290703, -0.17063184920786154, 0.036967580014811686, 0.46847253216046786, -0.25361610252185535, -0.36490928994675387, 0.09854646737982131, -0.2777124122873267, -0.1777275134013713, 0.2321699692413735, -0.19542282573169742, 0.10173666829491343, 0.13694483007716213, -0.008644327747134781, -0.08694958401581825, -0.25547774811977303, 0.26678611170009114, 0.04192567545096928, 0.36502674408023006, -0.009469412533968836, 0.10685711673779141, -0.0035644196308494062, -0.027302698283713667, 0.013106724077164901, -0.020444774073572015, 0.1442251027048093, 0.30239175222626885, 0.21863790863572652, 0.30473262406464424, -0.45974188869796817, -0.2671315525307428, 0.06220233142106845, 0.15501915569061497, 0.10840737623111088, -0.0884717569192731, -0.34489629136623073, 0.07672710536075897, -0.10276586970722569, 0.03250554650635856, -0.13512265297991397, -0.11432417363557852, -0.013470817763461937, -0.36300844071774, 0.10441870819993335, 0.04048712143789153, 0.08952381234878122, -0.09733121941362194, -0.1374400073847261, -0.018267616628430523, 0.1964919131843551, 0.006756591484250136, 0.05067397380802294, 0.15333197944231294, -0.21065057422872166, -0.13844703609502906, 0.29646583091018336, -0.04107615542328968, -0.1980569449829022, 0.2194603334336621, -0.062175415951498884, -0.07611846923023748, 0.18808853977895693, 0.21469963730158442, 0.12009686770121773, -0.15462452567875123, -0.03203079571254813, 0.038044346962709114, 0.21218283188964554, 0.0785087937864723, 0.03093408041834906, 0.15254047874743867, 0.19877506458392394, -0.011655489720483709, 0.15101124751369877, -0.16852776664332603, 0.009184933159893481, -0.18165735136653208, -0.10694756911571451, -0.17327422664697334, 0.008250432837773209, -0.08773752075828256, -0.10636543339457954, 0.39599450034131506, 0.25069037906710884, 0.1966198948586369, 0.07267740444425287, 0.3801763658786202, 0.008436171495327585, 0.1084721424159402, -0.005117799941656278, 0.19399472594921635, 0.03821280532184258, 0.11300537388902812, -0.21930999647657476, 0.12681924988838597, -0.012577934057250544] |
1,802.01222 | Decays $A \to Z\gamma\gamma$ and $\phi \to Z\gamma\gamma$ ($\phi=h,H$)
in two-Higgs doublet models | The one-loop contributions to the decays of the $CP$-odd and $CP$-even scalar
bosons $A\to Z\gamma\gamma$ and $\phi\to Z\gamma\gamma$ ($\phi=h,H$) are
calculated within the framework of $CP$-conserving THDMs, where they are
induced by box and reducible Feynman diagrams. The behavior of the
corresponding branching ratios are then analyzed within the type-II THDM in a
region of the parameter space around the alignment limit and still consistent
with experimental data. It is found that the $A\to Z\gamma\gamma$ branching
ratio is only relevant when $m_A>m_H+m_Z$, but it is negligible otherwise. For
$m_A>600$ GeV and $t_\beta\simeq O(1)$, $BR(A\to Z\gamma\gamma)$ can reach
values of the order of $10^{-5}-10^{-4}$, but it decreases by about one order
of magnitude as $t_\beta$ increases up to 10. A similar behavior is followed by
the $H\to Z\gamma\gamma$ decay, which only has a non-negligible branching ratio
when $m_H>m_A+m_Z$ and can reach the level of $10^{-4}-10^{-3}$ for $m_H>600$
GeV and $t_\beta\simeq O(1)$. We also estimated the branching ratios of these
rare decays in the type-I THDM, where they can be about one order of magnitude
larger than in type-II THDM. As far as the $h\to Z\gamma\gamma$ decay is
concerned, since the properties of this scalar boson must be nearly identical
to those of the SM Higgs boson, the $h\to Z\gamma\gamma$ branching ratio does
not deviates significantly from the SM prediction, where it is negligibly
small, of the order of $10^{-9}$. This result is in agreement with previous
calculations.
| hep-ph | the oneloop contributions to the decays of the cpodd and cpeven scalar bosons ato zgammagamma and phito zgammagamma phihh are calculated within the framework of cpconserving thdms where they are induced by box and reducible feynman diagrams the behavior of the corresponding branching ratios are then analyzed within the typeii thdm in a region of the parameter space around the alignment limit and still consistent with experimental data it is found that the ato zgammagamma branching ratio is only relevant when m_am_hm_z but it is negligible otherwise for m_a600 gev and t_betasimeq o1 brato zgammagamma can reach values of the order of 105104 but it decreases by about one order of magnitude as t_beta increases up to 10 a similar behavior is followed by the hto zgammagamma decay which only has a nonnegligible branching ratio when m_hm_am_z and can reach the level of 104103 for m_h600 gev and t_betasimeq o1 we also estimated the branching ratios of these rare decays in the typei thdm where they can be about one order of magnitude larger than in typeii thdm as far as the hto zgammagamma decay is concerned since the properties of this scalar boson must be nearly identical to those of the sm higgs boson the hto zgammagamma branching ratio does not deviates significantly from the sm prediction where it is negligibly small of the order of 109 this result is in agreement with previous calculations | [['the', 'oneloop', 'contributions', 'to', 'the', 'decays', 'of', 'the', 'cpodd', 'and', 'cpeven', 'scalar', 'bosons', 'ato', 'zgammagamma', 'and', 'phito', 'zgammagamma', 'phihh', 'are', 'calculated', 'within', 'the', 'framework', 'of', 'cpconserving', 'thdms', 'where', 'they', 'are', 'induced', 'by', 'box', 'and', 'reducible', 'feynman', 'diagrams', 'the', 'behavior', 'of', 'the', 'corresponding', 'branching', 'ratios', 'are', 'then', 'analyzed', 'within', 'the', 'typeii', 'thdm', 'in', 'a', 'region', 'of', 'the', 'parameter', 'space', 'around', 'the', 'alignment', 'limit', 'and', 'still', 'consistent', 'with', 'experimental', 'data', 'it', 'is', 'found', 'that', 'the', 'ato', 'zgammagamma', 'branching', 'ratio', 'is', 'only', 'relevant', 'when', 'm_am_hm_z', 'but', 'it', 'is', 'negligible', 'otherwise', 'for', 'm_a600', 'gev', 'and', 't_betasimeq', 'o1', 'brato', 'zgammagamma', 'can', 'reach', 'values', 'of', 'the', 'order', 'of', '105104', 'but', 'it', 'decreases', 'by', 'about', 'one', 'order', 'of', 'magnitude', 'as', 't_beta', 'increases', 'up', 'to', '10', 'a', 'similar', 'behavior', 'is', 'followed', 'by', 'the', 'hto', 'zgammagamma', 'decay', 'which', 'only', 'has', 'a', 'nonnegligible', 'branching', 'ratio', 'when', 'm_hm_am_z', 'and', 'can', 'reach', 'the', 'level', 'of', '104103', 'for', 'm_h600', 'gev', 'and', 't_betasimeq', 'o1', 'we', 'also', 'estimated', 'the', 'branching', 'ratios', 'of', 'these', 'rare', 'decays', 'in', 'the', 'typei', 'thdm', 'where', 'they', 'can', 'be', 'about', 'one', 'order', 'of', 'magnitude', 'larger', 'than', 'in', 'typeii', 'thdm', 'as', 'far', 'as', 'the', 'hto', 'zgammagamma', 'decay', 'is', 'concerned', 'since', 'the', 'properties', 'of', 'this', 'scalar', 'boson', 'must', 'be', 'nearly', 'identical', 'to', 'those', 'of', 'the', 'sm', 'higgs', 'boson', 'the', 'hto', 'zgammagamma', 'branching', 'ratio', 'does', 'not', 'deviates', 'significantly', 'from', 'the', 'sm', 'prediction', 'where', 'it', 'is', 'negligibly', 'small', 'of', 'the', 'order', 'of', '109', 'this', 'result', 'is', 'in', 'agreement', 'with', 'previous', 'calculations']] | [-0.07721293125912652, 0.2564038699386056, 0.016460494308093945, 0.1263205635053305, -0.03971039487138456, -0.17188510351802128, 0.06915812174927882, 0.3173724525510517, -0.2204860129727124, -0.277708064402783, 0.05293155818827873, -0.3301431940620415, -0.02497739321043853, 0.16422702442330012, 0.03717738016410405, 0.04059131372081752, 0.04037215250064354, 0.06971314560833457, -0.04979695092050936, -0.24652191509358487, 0.23327973545996644, 0.03342069342211865, 0.19852613962832918, 0.0590213003830667, 0.006074559444248448, -0.0193147404591134, 0.011542910809616464, -0.028629171064323805, -0.14495344620567718, 0.02779734997494618, 0.1837656694336278, 0.037095130421221256, 0.14275385467050897, -0.27981673485668596, -0.07624191771399669, 0.18175362616443932, 0.21640356049637055, 0.06405179332443574, 0.02448178661832643, -0.32043991237065417, 0.160073006330424, -0.184617417429342, -0.06333805237363975, -0.03445437561728743, 0.015903984574706796, -0.09542195219343211, -0.3419541997619494, 0.09579522075122893, -0.0062837237410865495, -0.009241319620682132, 0.02169922925531864, -0.19540726135619083, -0.07518653572622411, 0.05597109472156425, 0.1631971795506385, 0.05600110642110225, 0.16333733051079916, -0.171081578781204, -0.11725177712266752, 0.4276224166219932, -0.1275062934995866, -0.16870021886257333, 0.14598951586644168, -0.22005577119652947, -0.14293496051394508, 0.19520415759169574, 0.17217029077834634, 0.08132424844262662, -0.15107520214471595, 0.16627524373925792, -0.011078148762549082, 0.16111555374146125, 0.045544536816826554, 0.060664497792951334, 0.17678531020265642, 0.18116850033402443, 0.005878916559293541, 0.06330673266751244, -0.07032922530896539, -0.09693131193819972, -0.3771001238896467, -0.12038512347371817, -0.07873811065087168, 0.08159033738908625, -0.09322353838374849, -0.09936307208748803, 0.3236644258742997, 0.1185512823524466, 0.2834012490420401, 0.05312237182101357, 0.27953927353020414, 0.16533602530586097, 0.11201528612703215, 0.037805781331248574, 0.3788680946678086, 0.12489953564630422, 0.0838549957355468, -0.1959281340932807, 0.09863239091385856, 0.03889690195189943] |
1,802.01223 | Learning Compact Neural Networks with Regularization | Proper regularization is critical for speeding up training, improving
generalization performance, and learning compact models that are cost
efficient. We propose and analyze regularized gradient descent algorithms for
learning shallow neural networks. Our framework is general and covers
weight-sharing (convolutional networks), sparsity (network pruning), and
low-rank constraints among others. We first introduce covering dimension to
quantify the complexity of the constraint set and provide insights on the
generalization properties. Then, we show that proposed algorithms become
well-behaved and local linear convergence occurs once the amount of data
exceeds the covering dimension. Overall, our results demonstrate that
near-optimal sample complexity is sufficient for efficient learning and
illustrate how regularization can be beneficial to learn over-parameterized
networks.
| cs.LG cs.IT math.IT math.OC stat.ML | proper regularization is critical for speeding up training improving generalization performance and learning compact models that are cost efficient we propose and analyze regularized gradient descent algorithms for learning shallow neural networks our framework is general and covers weightsharing convolutional networks sparsity network pruning and lowrank constraints among others we first introduce covering dimension to quantify the complexity of the constraint set and provide insights on the generalization properties then we show that proposed algorithms become wellbehaved and local linear convergence occurs once the amount of data exceeds the covering dimension overall our results demonstrate that nearoptimal sample complexity is sufficient for efficient learning and illustrate how regularization can be beneficial to learn overparameterized networks | [['proper', 'regularization', 'is', 'critical', 'for', 'speeding', 'up', 'training', 'improving', 'generalization', 'performance', 'and', 'learning', 'compact', 'models', 'that', 'are', 'cost', 'efficient', 'we', 'propose', 'and', 'analyze', 'regularized', 'gradient', 'descent', 'algorithms', 'for', 'learning', 'shallow', 'neural', 'networks', 'our', 'framework', 'is', 'general', 'and', 'covers', 'weightsharing', 'convolutional', 'networks', 'sparsity', 'network', 'pruning', 'and', 'lowrank', 'constraints', 'among', 'others', 'we', 'first', 'introduce', 'covering', 'dimension', 'to', 'quantify', 'the', 'complexity', 'of', 'the', 'constraint', 'set', 'and', 'provide', 'insights', 'on', 'the', 'generalization', 'properties', 'then', 'we', 'show', 'that', 'proposed', 'algorithms', 'become', 'wellbehaved', 'and', 'local', 'linear', 'convergence', 'occurs', 'once', 'the', 'amount', 'of', 'data', 'exceeds', 'the', 'covering', 'dimension', 'overall', 'our', 'results', 'demonstrate', 'that', 'nearoptimal', 'sample', 'complexity', 'is', 'sufficient', 'for', 'efficient', 'learning', 'and', 'illustrate', 'how', 'regularization', 'can', 'be', 'beneficial', 'to', 'learn', 'overparameterized', 'networks']] | [-0.05283171834181184, -0.014218651232026194, -0.06079007494263351, 0.11676551752177107, -0.13323280442020166, -0.19237318563720454, 0.0530602704855087, 0.4492767685295447, -0.30474984276553857, -0.2969777991509308, 0.08865870534563842, -0.21179870755776115, -0.23857249605428912, 0.1985846537772728, -0.14615530180542366, 0.09852450296039815, 0.13400049679305243, 0.0007491760586044225, -0.10671271508529215, -0.36237134103987206, 0.2976949262280908, 0.0651671787318976, 0.34130542022378546, 0.042144351274422974, 0.15195866211864126, -0.04032378219189527, -0.012628172372427323, 0.039014749458748034, -0.09979905267847125, 0.18442576351049153, 0.2961746693886475, 0.2417991160293636, 0.36611310036286066, -0.40022165204326204, -0.24059951583166486, 0.1432992033123889, 0.15990471411901325, 0.1153553341778562, -0.02222113938819941, -0.24716272964749647, 0.1278292933397967, -0.12411189479348453, -0.016040928064562057, -0.24170689799255976, -0.045994659124509146, -0.0033098738883500516, -0.33944166897107725, 0.030250714735492415, 0.07313573145024155, 0.01399722656604591, -0.031030663600920334, -0.14455412173461493, 0.03789036645068099, 0.12340780349002908, 0.009601506499735558, 0.03376121138748915, 0.13388019494064476, -0.14577638037988674, -0.11685561411406682, 0.31075827275281365, -0.04447356716770193, -0.19312372511536208, 0.18663727709942537, -0.007638703699669113, -0.19317738041484162, 0.1194563075657124, 0.294128818826183, 0.10653696957084796, -0.13384635058110175, 0.06780238799477482, -0.03478157342937977, 0.1511600821805389, 0.042858727758183425, 0.05372161484859965, 0.07750950451008976, 0.27285179512818225, 0.1564302486549739, 0.16618201897540333, -0.08698881836000667, -0.08701504226773978, -0.220868631079793, -0.10108039819878405, -0.19021861605427187, -0.003212019501496916, -0.18724200262235094, -0.10307589824597412, 0.3746753305034793, 0.19214938858159533, 0.20101244192894385, 0.20956527614793943, 0.32444703149730747, 0.06875235275631143, 0.09291182475002563, 0.19079154385253788, 0.2146777356326904, 0.0970467300194761, 0.06855631198356961, -0.21209378657538605, 0.07469509069747089, 0.09623413482154516] |
1,802.01224 | Optimal Control of Left-Invariant Multi-Agent Systems with Asymmetric
Formation Constraints | In this work, we study an optimal control problem for a multi-agent system
modeled by an undirected formation graph with nodes describing the kinematics
of each agent, given by a left-invariant control system on a Lie group. The
agents should avoid collision between them in the workspace. Such a task is
done by introducing some potential functions into the cost function for the
optimal control problem, corresponding to fictitious forces, induced by the
formation constraint among agents, that break the symmetry of the individual
agents and the cost functions, and rendering the optimal control problem
partially invariant by a Lie group of symmetries. Reduced necessary conditions
for the existence of normal extremals are obtained using techniques of
variational calculus on manifolds. As an application, we study an optimal
control problem for multiple unicycles.
| math.OC cs.MA cs.SY eess.SY math.DS | in this work we study an optimal control problem for a multiagent system modeled by an undirected formation graph with nodes describing the kinematics of each agent given by a leftinvariant control system on a lie group the agents should avoid collision between them in the workspace such a task is done by introducing some potential functions into the cost function for the optimal control problem corresponding to fictitious forces induced by the formation constraint among agents that break the symmetry of the individual agents and the cost functions and rendering the optimal control problem partially invariant by a lie group of symmetries reduced necessary conditions for the existence of normal extremals are obtained using techniques of variational calculus on manifolds as an application we study an optimal control problem for multiple unicycles | [['in', 'this', 'work', 'we', 'study', 'an', 'optimal', 'control', 'problem', 'for', 'a', 'multiagent', 'system', 'modeled', 'by', 'an', 'undirected', 'formation', 'graph', 'with', 'nodes', 'describing', 'the', 'kinematics', 'of', 'each', 'agent', 'given', 'by', 'a', 'leftinvariant', 'control', 'system', 'on', 'a', 'lie', 'group', 'the', 'agents', 'should', 'avoid', 'collision', 'between', 'them', 'in', 'the', 'workspace', 'such', 'a', 'task', 'is', 'done', 'by', 'introducing', 'some', 'potential', 'functions', 'into', 'the', 'cost', 'function', 'for', 'the', 'optimal', 'control', 'problem', 'corresponding', 'to', 'fictitious', 'forces', 'induced', 'by', 'the', 'formation', 'constraint', 'among', 'agents', 'that', 'break', 'the', 'symmetry', 'of', 'the', 'individual', 'agents', 'and', 'the', 'cost', 'functions', 'and', 'rendering', 'the', 'optimal', 'control', 'problem', 'partially', 'invariant', 'by', 'a', 'lie', 'group', 'of', 'symmetries', 'reduced', 'necessary', 'conditions', 'for', 'the', 'existence', 'of', 'normal', 'extremals', 'are', 'obtained', 'using', 'techniques', 'of', 'variational', 'calculus', 'on', 'manifolds', 'as', 'an', 'application', 'we', 'study', 'an', 'optimal', 'control', 'problem', 'for', 'multiple', 'unicycles']] | [-0.17398136466237388, 0.0449980706833408, -0.05993194691836834, 0.050175434395957993, -0.10660402488166508, -0.12468796219550689, 0.0691636047567612, 0.39706776268724214, -0.3242013949613766, -0.3298458396072002, 0.10664597016241037, -0.2171441669001671, -0.14907971968790307, 0.1484184842556715, -0.09471196824460662, 0.08537534714494377, 0.03961748543328473, 0.05653682649765808, -0.04004795086671619, -0.22557921426592192, 0.37380246539894296, 0.019346171219770173, 0.23743911585385413, 2.7765656464306037e-05, 0.16354796375827232, 0.07885567409063417, 0.026518933079380514, 0.027628779894483268, -0.12987252066282362, 0.11484340013046854, 0.27922887996686413, 0.10951442646100781, 0.33342564199119806, -0.4384795310381884, -0.1814792527908221, 0.12931673939836988, 0.12538702203717111, 0.07407463379064225, -0.034613348622421235, -0.3155460891951072, 0.0675460849415959, -0.14093286228975407, -0.13621445110459862, -0.02711341158605944, -0.006758604454282755, 0.018304495613573862, -0.2863819798720734, 0.007627412865876704, 0.033356868471124006, 0.081817591659807, -0.1347589377835533, -0.04661298297254607, -0.03185406965956344, 0.1671058982190557, -0.0023917675357928176, 0.007878989040767564, 0.15416745949843794, -0.1306607010721796, -0.17429591295890567, 0.38472272398272406, 0.008964577721277798, -0.2678814096222247, 0.13270785256912163, -0.03665349716530707, -0.14724403803579902, 0.10310146760867726, 0.19398834639670035, 0.14848902987148194, -0.20199963790749698, 0.07702605069100268, -0.04729310186803901, 0.11926723220840768, 0.035220949626982884, -0.016019929904154594, 0.1475665586969038, 0.17820750561339738, 0.202506673529296, 0.12902829534535235, 0.04476561998712998, -0.1056463248253961, -0.3092557741788608, -0.11982995212512244, -0.155795580140294, 0.01890034429532917, -0.10881921762746717, -0.11252278792566824, 0.3642351703116096, 0.0832898201581959, 0.20071503816914738, 0.0863519887741011, 0.2689779851921743, 0.13501479675996825, 0.04583352212479016, 0.09287496377089012, 0.17870247287914695, 0.10784899755346036, 0.03522472504414338, -0.2732812259144927, 0.06950058946491015, 0.09000342866559898] |
1,802.01225 | Automorphisms of Weyl Algebra and a Conjecture of Kontsevich | We outline the proof of a conjecture of Kontsevich on the isomorphism between
the group of polynomial symplectomorphisms in $2n$ variables and the group of
automorphisms of the $n$-th Weyl algebra over complex numbers. Our proof uses
lifting of polynomial symplectomorphisms to Weyl algebra automorphisms by means
of approximation by tame symplectomorphisms and gauging of the lifted morphism.
Approximation by tame symplectomorphisms is the symplectic version of the
well-known theorem of D. Anick and is a result of our prior work.
| math.RA | we outline the proof of a conjecture of kontsevich on the isomorphism between the group of polynomial symplectomorphisms in 2n variables and the group of automorphisms of the nth weyl algebra over complex numbers our proof uses lifting of polynomial symplectomorphisms to weyl algebra automorphisms by means of approximation by tame symplectomorphisms and gauging of the lifted morphism approximation by tame symplectomorphisms is the symplectic version of the wellknown theorem of d anick and is a result of our prior work | [['we', 'outline', 'the', 'proof', 'of', 'a', 'conjecture', 'of', 'kontsevich', 'on', 'the', 'isomorphism', 'between', 'the', 'group', 'of', 'polynomial', 'symplectomorphisms', 'in', '2n', 'variables', 'and', 'the', 'group', 'of', 'automorphisms', 'of', 'the', 'nth', 'weyl', 'algebra', 'over', 'complex', 'numbers', 'our', 'proof', 'uses', 'lifting', 'of', 'polynomial', 'symplectomorphisms', 'to', 'weyl', 'algebra', 'automorphisms', 'by', 'means', 'of', 'approximation', 'by', 'tame', 'symplectomorphisms', 'and', 'gauging', 'of', 'the', 'lifted', 'morphism', 'approximation', 'by', 'tame', 'symplectomorphisms', 'is', 'the', 'symplectic', 'version', 'of', 'the', 'wellknown', 'theorem', 'of', 'd', 'anick', 'and', 'is', 'a', 'result', 'of', 'our', 'prior', 'work']] | [-0.2332601422709154, 0.05321071846669333, -0.140224623689313, 0.015686191218893652, -0.12335825605708876, -0.10037364627890012, 0.0217740909644851, 0.24959575945948376, -0.38002223465706647, -0.2728806605424594, 0.060899492857667305, -0.19428689607396077, -0.1926801398448232, 0.1681321908282921, -0.16300011933263805, -0.03153389384452668, 0.04530433272758936, 0.06483335648145941, -0.13381669254697584, -0.31928445525283433, 0.4414680626841239, -0.011185279156276842, 0.1710108409371273, 0.050022149102095466, 0.12724318101220292, 0.05725735145402543, -0.04487918493234449, -0.10382504163332927, -0.11445890684370641, 0.11517155600458752, 0.28044186507777114, 0.05906563010181726, 0.18617618948589137, -0.3550643381306235, -0.08717820918572676, 0.1639933539841922, 0.16568031956522186, 0.013795717032971206, -0.0027655086172514677, -0.33454790632068004, 0.07886537621182212, -0.19673432423273263, -0.20256452167544653, -0.10064253217920109, 0.04869501692829309, 0.008880445871640134, -0.1914116363098592, -0.0005040802406492057, 0.187445936396856, 0.1762545268729697, -0.055662198164672765, -0.07077096887277784, -0.09301845360846248, 0.034392402369391034, 0.0015121460432347693, 0.07606425941174413, 0.09040842578389946, -0.030098831947938897, -0.17228116125535267, 0.3823538326462846, -0.03997764389180107, -0.22902638902082856, 0.09062137227091524, -0.15933158340645426, -0.21544763889669635, 0.11939607491647755, 0.033133928939976076, 0.16359356726393287, 0.0047536201568113435, 0.2422124510724385, -0.16785587614149222, 0.033836741684533565, 0.12487992325820672, -0.05985756519963436, 0.059019451282550525, 0.06545109439491766, 0.11375370275597145, 0.1357045057632121, 0.07258176507232826, -0.06006607241399678, -0.3634843565336785, -0.20733441883859074, -0.16471095810598338, 0.15184624033209718, -0.159421517040306, -0.13175656356745297, 0.45786312307564564, 0.0694258143538954, 0.11895361604789893, 0.15568041834796284, 0.2162089448330211, 0.05375159348729124, 0.09475703544937718, 0.03635507903671191, 0.10216947592059035, 0.31854181160379985, -0.10382818252877275, -0.15782552159586807, -0.032636171500026075, 0.3430166141486462] |
1,802.01226 | Differential Equation Axiomatization: The Impressive Power of
Differential Ghosts | We prove the completeness of an axiomatization for differential equation
invariants. First, we show that the differential equation axioms in
differential dynamic logic are complete for all algebraic invariants. Our proof
exploits differential ghosts, which introduce additional variables that can be
chosen to evolve freely along new differential equations. Cleverly chosen
differential ghosts are the proof-theoretical counterpart of dark matter. They
create new hypothetical state, whose relationship to the original state
variables satisfies invariants that did not exist before. The reflection of
these new invariants in the original system then enables its analysis.
We then show that extending the axiomatization with existence and uniqueness
axioms makes it complete for all local progress properties, and further
extension with a real induction axiom makes it complete for all real arithmetic
invariants. This yields a parsimonious axiomatization, which serves as the
logical foundation for reasoning about invariants of differential equations.
Moreover, our results are purely axiomatic, and so the axiomatization is
suitable for sound implementation in foundational theorem provers.
| cs.LO cs.PL math.CA math.LO | we prove the completeness of an axiomatization for differential equation invariants first we show that the differential equation axioms in differential dynamic logic are complete for all algebraic invariants our proof exploits differential ghosts which introduce additional variables that can be chosen to evolve freely along new differential equations cleverly chosen differential ghosts are the prooftheoretical counterpart of dark matter they create new hypothetical state whose relationship to the original state variables satisfies invariants that did not exist before the reflection of these new invariants in the original system then enables its analysis we then show that extending the axiomatization with existence and uniqueness axioms makes it complete for all local progress properties and further extension with a real induction axiom makes it complete for all real arithmetic invariants this yields a parsimonious axiomatization which serves as the logical foundation for reasoning about invariants of differential equations moreover our results are purely axiomatic and so the axiomatization is suitable for sound implementation in foundational theorem provers | [['we', 'prove', 'the', 'completeness', 'of', 'an', 'axiomatization', 'for', 'differential', 'equation', 'invariants', 'first', 'we', 'show', 'that', 'the', 'differential', 'equation', 'axioms', 'in', 'differential', 'dynamic', 'logic', 'are', 'complete', 'for', 'all', 'algebraic', 'invariants', 'our', 'proof', 'exploits', 'differential', 'ghosts', 'which', 'introduce', 'additional', 'variables', 'that', 'can', 'be', 'chosen', 'to', 'evolve', 'freely', 'along', 'new', 'differential', 'equations', 'cleverly', 'chosen', 'differential', 'ghosts', 'are', 'the', 'prooftheoretical', 'counterpart', 'of', 'dark', 'matter', 'they', 'create', 'new', 'hypothetical', 'state', 'whose', 'relationship', 'to', 'the', 'original', 'state', 'variables', 'satisfies', 'invariants', 'that', 'did', 'not', 'exist', 'before', 'the', 'reflection', 'of', 'these', 'new', 'invariants', 'in', 'the', 'original', 'system', 'then', 'enables', 'its', 'analysis', 'we', 'then', 'show', 'that', 'extending', 'the', 'axiomatization', 'with', 'existence', 'and', 'uniqueness', 'axioms', 'makes', 'it', 'complete', 'for', 'all', 'local', 'progress', 'properties', 'and', 'further', 'extension', 'with', 'a', 'real', 'induction', 'axiom', 'makes', 'it', 'complete', 'for', 'all', 'real', 'arithmetic', 'invariants', 'this', 'yields', 'a', 'parsimonious', 'axiomatization', 'which', 'serves', 'as', 'the', 'logical', 'foundation', 'for', 'reasoning', 'about', 'invariants', 'of', 'differential', 'equations', 'moreover', 'our', 'results', 'are', 'purely', 'axiomatic', 'and', 'so', 'the', 'axiomatization', 'is', 'suitable', 'for', 'sound', 'implementation', 'in', 'foundational', 'theorem', 'provers']] | [-0.13593573377366705, 0.04672826556932442, -0.163989241425711, 0.11792030783527228, -0.2074069620070822, -0.15043431857365172, 0.007342260187149541, 0.3017238935116252, -0.31237285262500064, -0.3007994288780603, 0.08441597481639719, -0.2556814699467406, -0.13750456985232073, 0.1855352001870612, -0.11979354530185775, 0.056116038696007266, 0.047001071134021126, 0.059173813711077605, -0.08438832840267906, -0.2629240869028292, 0.35181199661764617, -0.060210728804659414, 0.2048473722113476, 0.029412236311529057, 0.15916010512653403, 0.05211753179235047, -0.03727888637320531, 0.0318870927832729, -0.15043823625026298, 0.10046273505270302, 0.2996395762661943, 0.1949435313307983, 0.23696628664143338, -0.41114627943003934, -0.13599431944635124, 0.08018367638789027, 0.09533236725276886, 0.13055633510889328, 0.007566294018515801, -0.30266355759049035, 0.11078981297786336, -0.14716414669360292, -0.1659508647792692, -0.17917465515636716, 0.03227336354923984, 0.01754385611064822, -0.22623633267638465, 0.01837242699048695, 0.1445145355004548, 0.0935855833098225, -0.08804673452564257, -0.06976654023880206, -0.04981068785314, 0.053521258548934414, -0.035922631182348785, -0.031086595702344125, 0.09797763864296567, -0.0916572372788137, -0.16457130942011186, 0.33600595135645694, -0.06632812566219279, -0.24254385925582553, 0.14436523905108087, -0.08255681757820793, -0.19678348147153227, 0.121659127998177, 0.08183101131244147, 0.126807078792074, -0.14832491927825095, 0.11298420268892176, -0.08697824944119271, 0.1716787492833942, 0.07977969384280942, 0.07188918662582894, 0.1656738584692848, 0.09707679627505299, 0.08223864169306043, 0.11739735993772678, 0.07730334515806782, -0.1220111370266202, -0.4060036617005805, -0.22849440367482826, -0.05555899806688147, 0.06954812695854694, -0.07344310240602998, -0.18664560912468706, 0.3464999043800677, 0.1810847559315433, 0.09351627362039254, 0.13270439537023251, 0.308516413108053, 0.14219534126775205, 0.04125388022947002, 0.07369014618256275, 0.20231604859995914, 0.19506689507783537, 0.09063051309133599, -0.12505553854195997, 0.06600435620667525, 0.10932533038886691] |
1,802.01227 | Copula-based Partial Correlation Screening: a Joint and Robust Approach | Screening for ultrahigh dimensional features may encounter complicated issues
such as outlying observations, heteroscedasticity or heavy-tailed distribution,
multi-collinearity and confounding effects. Standard correlation-based marginal
screening methods may be a weak solution to these issues. We contribute a novel
robust joint screener to safeguard against outliers and distribution
mis-specification for both the response variable and the covariates, and to
account for external variables at the screening step. Specifically, we
introduce a copula-based partial correlation (CPC) screener. We show that the
empirical process of the estimated CPC converges weakly to a Gaussian process
and establish the sure screening property for CPC screener under very mild
technical conditions, where we need not require any moment condition, weaker
than existing alternatives in the literature. Moreover, our approach allows for
a diverging number of conditional variables from the theoretical point of view.
Extensive simulation studies and two data applications are included to
illustrate our proposal.
| math.ST stat.TH | screening for ultrahigh dimensional features may encounter complicated issues such as outlying observations heteroscedasticity or heavytailed distribution multicollinearity and confounding effects standard correlationbased marginal screening methods may be a weak solution to these issues we contribute a novel robust joint screener to safeguard against outliers and distribution misspecification for both the response variable and the covariates and to account for external variables at the screening step specifically we introduce a copulabased partial correlation cpc screener we show that the empirical process of the estimated cpc converges weakly to a gaussian process and establish the sure screening property for cpc screener under very mild technical conditions where we need not require any moment condition weaker than existing alternatives in the literature moreover our approach allows for a diverging number of conditional variables from the theoretical point of view extensive simulation studies and two data applications are included to illustrate our proposal | [['screening', 'for', 'ultrahigh', 'dimensional', 'features', 'may', 'encounter', 'complicated', 'issues', 'such', 'as', 'outlying', 'observations', 'heteroscedasticity', 'or', 'heavytailed', 'distribution', 'multicollinearity', 'and', 'confounding', 'effects', 'standard', 'correlationbased', 'marginal', 'screening', 'methods', 'may', 'be', 'a', 'weak', 'solution', 'to', 'these', 'issues', 'we', 'contribute', 'a', 'novel', 'robust', 'joint', 'screener', 'to', 'safeguard', 'against', 'outliers', 'and', 'distribution', 'misspecification', 'for', 'both', 'the', 'response', 'variable', 'and', 'the', 'covariates', 'and', 'to', 'account', 'for', 'external', 'variables', 'at', 'the', 'screening', 'step', 'specifically', 'we', 'introduce', 'a', 'copulabased', 'partial', 'correlation', 'cpc', 'screener', 'we', 'show', 'that', 'the', 'empirical', 'process', 'of', 'the', 'estimated', 'cpc', 'converges', 'weakly', 'to', 'a', 'gaussian', 'process', 'and', 'establish', 'the', 'sure', 'screening', 'property', 'for', 'cpc', 'screener', 'under', 'very', 'mild', 'technical', 'conditions', 'where', 'we', 'need', 'not', 'require', 'any', 'moment', 'condition', 'weaker', 'than', 'existing', 'alternatives', 'in', 'the', 'literature', 'moreover', 'our', 'approach', 'allows', 'for', 'a', 'diverging', 'number', 'of', 'conditional', 'variables', 'from', 'the', 'theoretical', 'point', 'of', 'view', 'extensive', 'simulation', 'studies', 'and', 'two', 'data', 'applications', 'are', 'included', 'to', 'illustrate', 'our', 'proposal']] | [-0.06871293046822151, 0.05638804045195381, -0.10643569025831918, 0.14746168659468822, -0.10588551021957149, -0.18135028075737258, 0.09798661637003533, 0.4031354870274663, -0.25395514072229464, -0.27793403956418233, 0.11964653738541528, -0.27480282370166, -0.15596758322169382, 0.14299095424823463, -0.09350260766223073, 0.09103645887536307, 0.08545589321758598, -0.0337775236608771, -0.053073893638017275, -0.26425002395020175, 0.3144841665402055, 0.05662855696398765, 0.32479857323070366, 0.035994981180798885, 0.08460245500396316, 0.040317098101756224, -0.05751252346051236, 0.054214982893317935, -0.0690034598564671, 0.06974049840588123, 0.2408807915324966, 0.13001135888819892, 0.3455287637437383, -0.40835414451081303, -0.23159782133996487, 0.1207653374907871, 0.09878853815452505, 0.09526275728363544, -0.050407242791261526, -0.2792200708761811, 0.08487882335282242, -0.15352532658725976, -0.13072135856219877, -0.1478110376621286, -0.0254098589871622, 0.0195877239604791, -0.4120435108585904, 0.10797495620635648, 0.08850635132752359, 0.04344810096702228, -0.03543625551702765, -0.1584928625418494, 0.05321247009405245, 0.09646186484179149, 0.11951356610865332, -0.02800744361554583, 0.14915199689722308, -0.12385476109790033, -0.08609174875969378, 0.3221231242424498, -0.04358127049995043, -0.2254131179023534, 0.2177431089237022, -0.10959087963526448, -0.18609900193599363, 0.0919973204129686, 0.17915497620434812, 0.09156455835948388, -0.18084092624795933, 0.03386165930967157, 0.005360303943355878, 0.1506232776378359, 0.0020675100036896764, 0.04562309069248537, 0.15374882928095757, 0.13582142656513801, 0.08188550680953388, 0.13557202226307707, -0.13363284347423662, -0.08007698492147028, -0.32256800044172756, -0.11833196602761746, -0.12992152887318903, 0.026170368970779238, -0.1201364881254267, -0.19278131429726877, 0.34919721055155, 0.23595660935427684, 0.17817748659290372, 0.07880601160228252, 0.302459313540409, 0.08921685138174022, 0.04701119026790063, 0.04496182045259047, 0.1724598329886794, 0.08009664463965843, 0.032998165542958306, -0.1849594737511749, 0.1546778623961533, -0.02325392677759131] |
1,802.01228 | Vanishing Viscosity Limit of Short Wave-Long Wave Interactions in Planar
Magnetohydrodynamics | We study several mathematical aspects of a system of equations modelling the
interaction between short waves, described by a nonlinear Schr\"{o}dinger
equation, and long waves, described by the equations of magnetohydrodynamics
for a compressible, heat conductive fluid. The system in question models an
aurora-type phenomenon, where a short wave propagates along the streamlines of
a magnetohydrodynamic medium. We focus on the one dimensional (planar) version
of the model and address the problem of well posedness as well as convergence
of the sequence of solutions as the bulk viscosity tends to zero together with
some other interaction parameters, to a solution of the limit decoupled system
involving the compressible Euler equations and a nonlinear Schr\"{o}dinger
equation. The vanishing viscosity limit serves to justify the SW-LW
interactions in the limit equations as, in this setting, the SW-LW interactions
cannot be defined in a straightforward way, due to the possible occurrence of
vacuum.
| math.AP | we study several mathematical aspects of a system of equations modelling the interaction between short waves described by a nonlinear schrodinger equation and long waves described by the equations of magnetohydrodynamics for a compressible heat conductive fluid the system in question models an auroratype phenomenon where a short wave propagates along the streamlines of a magnetohydrodynamic medium we focus on the one dimensional planar version of the model and address the problem of well posedness as well as convergence of the sequence of solutions as the bulk viscosity tends to zero together with some other interaction parameters to a solution of the limit decoupled system involving the compressible euler equations and a nonlinear schrodinger equation the vanishing viscosity limit serves to justify the swlw interactions in the limit equations as in this setting the swlw interactions cannot be defined in a straightforward way due to the possible occurrence of vacuum | [['we', 'study', 'several', 'mathematical', 'aspects', 'of', 'a', 'system', 'of', 'equations', 'modelling', 'the', 'interaction', 'between', 'short', 'waves', 'described', 'by', 'a', 'nonlinear', 'schrodinger', 'equation', 'and', 'long', 'waves', 'described', 'by', 'the', 'equations', 'of', 'magnetohydrodynamics', 'for', 'a', 'compressible', 'heat', 'conductive', 'fluid', 'the', 'system', 'in', 'question', 'models', 'an', 'auroratype', 'phenomenon', 'where', 'a', 'short', 'wave', 'propagates', 'along', 'the', 'streamlines', 'of', 'a', 'magnetohydrodynamic', 'medium', 'we', 'focus', 'on', 'the', 'one', 'dimensional', 'planar', 'version', 'of', 'the', 'model', 'and', 'address', 'the', 'problem', 'of', 'well', 'posedness', 'as', 'well', 'as', 'convergence', 'of', 'the', 'sequence', 'of', 'solutions', 'as', 'the', 'bulk', 'viscosity', 'tends', 'to', 'zero', 'together', 'with', 'some', 'other', 'interaction', 'parameters', 'to', 'a', 'solution', 'of', 'the', 'limit', 'decoupled', 'system', 'involving', 'the', 'compressible', 'euler', 'equations', 'and', 'a', 'nonlinear', 'schrodinger', 'equation', 'the', 'vanishing', 'viscosity', 'limit', 'serves', 'to', 'justify', 'the', 'swlw', 'interactions', 'in', 'the', 'limit', 'equations', 'as', 'in', 'this', 'setting', 'the', 'swlw', 'interactions', 'can', 'not', 'be', 'defined', 'in', 'a', 'straightforward', 'way', 'due', 'to', 'the', 'possible', 'occurrence', 'of', 'vacuum']] | [-0.1759636683948338, 0.09688293261851262, -0.05654271168091024, 0.06731820173483963, -0.0686083353528132, -0.11295214315255483, -0.020172706264226386, 0.24110600539172689, -0.31881675162818285, -0.2644172039814293, 0.1176409362287571, -0.2796493671787903, -0.11970316838628302, 0.17489976522047074, 0.003274395844588677, 0.08755419313053911, 0.049288053426037856, 0.0029134756807858747, -0.05193291027254115, -0.16357570710591973, 0.3323097385233268, 0.02444205876381602, 0.2262679407497247, 0.03066697347909212, 0.13208523345800738, -0.021409541407289606, 0.02425245043200751, 0.05500931779233118, -0.1471435610561942, 0.019455589769252886, 0.22548522794495512, 0.026993348744387427, 0.28150314731523396, -0.47554012688497704, -0.2641322344650204, 0.029434968642890455, 0.17367893570413193, 0.15274425158898036, -0.0032999830204062165, -0.2834726921344797, -0.007770334277302027, -0.16632542288163676, -0.21632872035416464, -0.03339593744526307, 0.007078580979723483, 0.0756298136881863, -0.24476395537766318, 0.12117122347078596, 0.1046168965054676, -0.0020283519787093005, -0.1348684055490109, -0.033927408954283846, -0.020608754937226574, 0.09334442820089559, 0.09046778402446459, 0.0055779661765942975, 0.04977958158279459, -0.20275870328521706, -0.069374353295813, 0.43421741461381314, -0.13561353511021784, -0.28313604286590516, 0.21433976697114607, -0.1039752547070384, -0.05900548542539279, 0.11660881683230401, 0.19503793506572645, 0.150993659865732, -0.16287907221975426, 0.09140215727083463, -0.05581045014774039, 0.1357841804375251, 0.05794030502438545, -0.004319072055319945, 0.18465295711532234, 0.2030239974024395, 0.049883244795103865, 0.14105104901944288, -0.017048366984042027, -0.11007838692554893, -0.3322116148718245, -0.16211300815766055, -0.1626747202485179, 0.09404949700032982, -0.07630505766069594, -0.209349184948951, 0.3818521667116632, 0.1510043871414382, 0.1699603154246385, 0.029332296952294806, 0.27819805255780616, 0.17258757822525997, -0.0008459529560059309, 0.06471770979464055, 0.24185373960159876, 0.20511968668705474, 0.16417949359243114, -0.2305799243040383, 0.01901512827568998, 0.13825381898010772] |
1,802.01229 | Bessel Identities in the Waldspurger Correspondence over the Complex
Numbers | We prove certain identities between relative Bessel functions attached to
irreducible unitary representations of $\mathrm{PGL}_2(\mathbb{C})$ and Bessel
functions attached to irreducible unitary representations of $\mathrm{SL}_2
(\mathbb{C})$. These identities reflect the Waldspurger correspondence over
$\mathbb{C}$. We also prove several regularity theorems for Bessel and relative
Bessel distributions which appear in the relative trace formula. This paper
constitutes the local spectral theory of Jacquet's relative trace formula over
$\mathbb{C}$.
| math.RT | we prove certain identities between relative bessel functions attached to irreducible unitary representations of mathrmpgl_2mathbbc and bessel functions attached to irreducible unitary representations of mathrmsl_2 mathbbc these identities reflect the waldspurger correspondence over mathbbc we also prove several regularity theorems for bessel and relative bessel distributions which appear in the relative trace formula this paper constitutes the local spectral theory of jacquets relative trace formula over mathbbc | [['we', 'prove', 'certain', 'identities', 'between', 'relative', 'bessel', 'functions', 'attached', 'to', 'irreducible', 'unitary', 'representations', 'of', 'mathrmpgl_2mathbbc', 'and', 'bessel', 'functions', 'attached', 'to', 'irreducible', 'unitary', 'representations', 'of', 'mathrmsl_2', 'mathbbc', 'these', 'identities', 'reflect', 'the', 'waldspurger', 'correspondence', 'over', 'mathbbc', 'we', 'also', 'prove', 'several', 'regularity', 'theorems', 'for', 'bessel', 'and', 'relative', 'bessel', 'distributions', 'which', 'appear', 'in', 'the', 'relative', 'trace', 'formula', 'this', 'paper', 'constitutes', 'the', 'local', 'spectral', 'theory', 'of', 'jacquets', 'relative', 'trace', 'formula', 'over', 'mathbbc']] | [-0.14719212389509403, 0.051199396933192635, -0.1881848341688069, 0.08236509551634706, -0.07833584795580871, -0.09669838189633924, -0.05689034931389476, 0.36683587613168045, -0.34751010686159134, -0.13884612420268022, 0.02416881018686595, -0.23386085019516412, -0.17699699793288956, 0.21983604352754443, -0.11724414025892073, 0.019698885950579573, 0.013369448983402395, 0.08284770257333589, -0.19816263429577283, -0.2725477365415488, 0.37172334375026733, -0.10336055025569539, 0.1943123107081029, 0.04063799140502268, 0.10311023493422501, 0.044812712380523555, -0.10330194678963787, -0.20050250460852437, -0.1687016612363618, 0.19194826475386298, 0.31964214151002357, 0.04459951660915542, 0.21968851420583566, -0.3688664877815033, -0.05826642785096235, 0.2450305457685643, 0.16224720409668203, -0.0597617298229111, 0.0650657987284627, -0.3068548055059874, 0.03404346026077088, -0.20563787544396386, -0.2008868056669164, -0.09660228683766145, 0.027299081760722755, 0.12541747976914605, -0.2544173134018236, 0.06585649898190593, 0.11264994161059287, 0.1085018382699632, -0.10964441653202052, -0.13247891741373868, 0.0011433631098314897, 0.0814048472041292, 0.021127614595774395, 0.027748260793012024, 0.07824845418139402, -0.12545984540370975, -0.08496527544764886, 0.2965475247005251, -0.061740685240435064, -0.26163698364841514, 0.09396081568617652, -0.24482531787188194, -0.14746892307676487, 0.10243592227795231, 0.0777193250329192, 0.15088284338143335, -0.05366544878290994, 0.1511491497356528, -0.1294295664932301, -0.008367112563200184, 0.27728102343685146, 0.06121965153003806, 0.13771262773705312, -0.09345228129775444, 0.04106527330604062, 0.18782748006729047, 0.028680444931361213, -0.06792185345748022, -0.41671946344535743, -0.21757286984417865, -0.12372672802693933, 0.1569505742848364, -0.15279727790516856, -0.19036938461349973, 0.38920027740410906, 0.10117249580190531, 0.17293036228685238, 0.1996213748595858, 0.16655506226998656, 0.1529339546921538, 0.10530627454950739, -0.0013524643597262564, 0.027332762979082208, 0.3209441640595002, -0.005745851466043004, -0.11781845607363911, -0.02326668769124645, 0.25011977640939737] |
1,802.0123 | In Situ STM Observation of Nonmagnetic Impurity Effect in MBE-grown
CeCoIn$_5$ Films | Local electronic effects in the vicinity of an impurity provide pivotal
insight into the origin of unconventional superconductivity, especially when
the materials are located on the edge of magnetic instability. In
high-temperature cuprate superconductors, a strong suppression of
superconductivity and appearance of low-energy bound states are clearly
observed near nonmagnetic impurities. However, whether these features are
common to other strongly correlated superconductors has not been established
experimentally. Here, we report the {$in$} {$situ$} scanning tunneling
microscopy observation of electronic structure around a nonmagnetic Zn impurity
in heavy-fermion CeCo(In$_{1-x}$Zn$_x$)$_5$ films, which are epitaxially grown
by the state-of-the-art molecular beam epitaxy technique. The films have very
wide atomically flat terraces and Zn atoms residing on two different In sites
are clearly resolved. Remarkably, no discernible change is observed for the
superconducting gap at and around the Zn atoms. Moreover, the local density of
states around Zn atoms shows little change inside the $c$-$f$ hybridization
gap, which is consistent with calculations for a periodic Anderson model
without local magnetic order. These results indicate that no nonsuperconducting
region is induced around a Zn impurity and do not support the scenario of
antiferromagnetic droplet formation suggested by indirect measurements in
Cd-doped CeCoIn$_5$. These results also highlight a significant difference of
the impurity effect between cuprates and CeCoIn$_5$, in both of which $d$-wave
superconductivity arises from the non-Fermi liquid normal state near
antiferromagnetic instabilities.
| cond-mat.str-el cond-mat.supr-con | local electronic effects in the vicinity of an impurity provide pivotal insight into the origin of unconventional superconductivity especially when the materials are located on the edge of magnetic instability in hightemperature cuprate superconductors a strong suppression of superconductivity and appearance of lowenergy bound states are clearly observed near nonmagnetic impurities however whether these features are common to other strongly correlated superconductors has not been established experimentally here we report the in situ scanning tunneling microscopy observation of electronic structure around a nonmagnetic zn impurity in heavyfermion cecoin_1xzn_x_5 films which are epitaxially grown by the stateoftheart molecular beam epitaxy technique the films have very wide atomically flat terraces and zn atoms residing on two different in sites are clearly resolved remarkably no discernible change is observed for the superconducting gap at and around the zn atoms moreover the local density of states around zn atoms shows little change inside the cf hybridization gap which is consistent with calculations for a periodic anderson model without local magnetic order these results indicate that no nonsuperconducting region is induced around a zn impurity and do not support the scenario of antiferromagnetic droplet formation suggested by indirect measurements in cddoped cecoin_5 these results also highlight a significant difference of the impurity effect between cuprates and cecoin_5 in both of which dwave superconductivity arises from the nonfermi liquid normal state near antiferromagnetic instabilities | [['local', 'electronic', 'effects', 'in', 'the', 'vicinity', 'of', 'an', 'impurity', 'provide', 'pivotal', 'insight', 'into', 'the', 'origin', 'of', 'unconventional', 'superconductivity', 'especially', 'when', 'the', 'materials', 'are', 'located', 'on', 'the', 'edge', 'of', 'magnetic', 'instability', 'in', 'hightemperature', 'cuprate', 'superconductors', 'a', 'strong', 'suppression', 'of', 'superconductivity', 'and', 'appearance', 'of', 'lowenergy', 'bound', 'states', 'are', 'clearly', 'observed', 'near', 'nonmagnetic', 'impurities', 'however', 'whether', 'these', 'features', 'are', 'common', 'to', 'other', 'strongly', 'correlated', 'superconductors', 'has', 'not', 'been', 'established', 'experimentally', 'here', 'we', 'report', 'the', 'in', 'situ', 'scanning', 'tunneling', 'microscopy', 'observation', 'of', 'electronic', 'structure', 'around', 'a', 'nonmagnetic', 'zn', 'impurity', 'in', 'heavyfermion', 'cecoin_1xzn_x_5', 'films', 'which', 'are', 'epitaxially', 'grown', 'by', 'the', 'stateoftheart', 'molecular', 'beam', 'epitaxy', 'technique', 'the', 'films', 'have', 'very', 'wide', 'atomically', 'flat', 'terraces', 'and', 'zn', 'atoms', 'residing', 'on', 'two', 'different', 'in', 'sites', 'are', 'clearly', 'resolved', 'remarkably', 'no', 'discernible', 'change', 'is', 'observed', 'for', 'the', 'superconducting', 'gap', 'at', 'and', 'around', 'the', 'zn', 'atoms', 'moreover', 'the', 'local', 'density', 'of', 'states', 'around', 'zn', 'atoms', 'shows', 'little', 'change', 'inside', 'the', 'cf', 'hybridization', 'gap', 'which', 'is', 'consistent', 'with', 'calculations', 'for', 'a', 'periodic', 'anderson', 'model', 'without', 'local', 'magnetic', 'order', 'these', 'results', 'indicate', 'that', 'no', 'nonsuperconducting', 'region', 'is', 'induced', 'around', 'a', 'zn', 'impurity', 'and', 'do', 'not', 'support', 'the', 'scenario', 'of', 'antiferromagnetic', 'droplet', 'formation', 'suggested', 'by', 'indirect', 'measurements', 'in', 'cddoped', 'cecoin_5', 'these', 'results', 'also', 'highlight', 'a', 'significant', 'difference', 'of', 'the', 'impurity', 'effect', 'between', 'cuprates', 'and', 'cecoin_5', 'in', 'both', 'of', 'which', 'dwave', 'superconductivity', 'arises', 'from', 'the', 'nonfermi', 'liquid', 'normal', 'state', 'near', 'antiferromagnetic', 'instabilities']] | [-0.16701500816577064, 0.2160023086814219, -0.037800160384108494, 0.06529357475831107, -0.010090302342034289, -0.1809166440098922, 0.11536716849603404, 0.4058802957695566, -0.2262339081120955, -0.28525894641898686, -0.019477377463389484, -0.37071344239857834, -0.10423363958027933, 0.1578485251712233, 0.05650700273371624, -0.0021038042307880366, -0.035052756888928754, -0.06170278859389599, -0.1446767672518546, -0.2316551283522705, 0.31866810636915543, 0.01954431227906689, 0.3346973053616749, 0.11068981965766861, -0.03966714513259368, -0.04205377297496358, 0.13415376360328019, 0.02782964803637904, -0.13885415336153528, 0.031660508721790645, 0.2973263987570821, -0.12597092223273776, 0.19496817546671974, -0.48810567905342106, -0.24273611822884464, -0.00848674918361531, 0.18014335061480666, 0.14195501664883187, -0.14354235608245067, -0.3004246739662465, 0.05659439911955575, -0.07783691820141189, -0.11250254886876894, -0.075336507626752, -0.03555387520157781, -0.02350727929143958, -0.21624945126511688, 0.12342970484748723, 0.07311255614408046, 0.13096696930207194, -0.10309004782200709, -0.12874499364478284, -0.09716663435367018, 0.010054827181304796, 0.044948567579635175, 0.06789264354799678, 0.17605735697176433, -0.10838985444953371, -0.10311898431462939, 0.32564179551902045, -0.03567824859464165, -0.02683321519023657, 0.19688548433610745, -0.2214266779554779, -0.09423783553045309, 0.17782703455611082, 0.07183662403718029, 0.07392358533801152, -0.1271543498902215, 0.08405951791102875, -0.06520848520347244, 0.19546178313535884, 0.05258444980452687, 0.11964493399800472, 0.29028615656129103, 0.20177297158219867, 0.029253617833825973, 0.07735559619169707, -0.15404793832822816, -0.05041459066335831, -0.20178078498135796, -0.1707076969614718, -0.22744425004164345, 0.01587357532384646, -0.0440351175378039, -0.2192917307001424, 0.35017578625896323, 0.1396581105430398, 0.1978764093517767, -0.16656034025047056, 0.19165774945194194, 0.0508025690168755, 0.06312712259833668, 0.04193110595939256, 0.25885965965949653, 0.14993626718294986, 0.09386829553241433, -0.3175243329194991, 0.13590768112171964, -0.005289349422112042] |
1,802.01231 | MIMO with Energy Recycling | We consider a Multiple Input Single Output (MISO) point-to-point
communication system in which the transmitter is designed such that, each
antenna can transmit information or harvest energy at any given point in time.
We evaluate the achievable rate by such an energy-recycling MISO system under
an average transmission power constraint. Our achievable scheme carefully
switches the mode of the antennas between transmission and wireless harvesting,
where most of the harvesting happens from the neighboring antennas'
transmissions, i.e., recycling. We show that, with recycling, it is possible to
exceed the capacity of the classical non-harvesting counterpart. As the
complexity of the achievable algorithm is exponential with the number of
antennas, we also provide an almost linear algorithm that has a minimal
degradation in achievable rate. To address the major questions on the
capability of recycling and the impacts of antenna coupling, we also develop a
hardware setup and experimental results for a 4-antenna transmitter, based on a
uniform linear array (ULA). We demonstrate that the loss in the rate due to
antenna coupling can be made negligible with sufficient antenna spacing and
provide hardware measurements for the power recycled from the transmitting
antennas and the power received at the target receiver, taken simultaneously.
We provide refined performance measurement results, based on our actual
measurements.
| cs.IT math.IT | we consider a multiple input single output miso pointtopoint communication system in which the transmitter is designed such that each antenna can transmit information or harvest energy at any given point in time we evaluate the achievable rate by such an energyrecycling miso system under an average transmission power constraint our achievable scheme carefully switches the mode of the antennas between transmission and wireless harvesting where most of the harvesting happens from the neighboring antennas transmissions ie recycling we show that with recycling it is possible to exceed the capacity of the classical nonharvesting counterpart as the complexity of the achievable algorithm is exponential with the number of antennas we also provide an almost linear algorithm that has a minimal degradation in achievable rate to address the major questions on the capability of recycling and the impacts of antenna coupling we also develop a hardware setup and experimental results for a 4antenna transmitter based on a uniform linear array ula we demonstrate that the loss in the rate due to antenna coupling can be made negligible with sufficient antenna spacing and provide hardware measurements for the power recycled from the transmitting antennas and the power received at the target receiver taken simultaneously we provide refined performance measurement results based on our actual measurements | [['we', 'consider', 'a', 'multiple', 'input', 'single', 'output', 'miso', 'pointtopoint', 'communication', 'system', 'in', 'which', 'the', 'transmitter', 'is', 'designed', 'such', 'that', 'each', 'antenna', 'can', 'transmit', 'information', 'or', 'harvest', 'energy', 'at', 'any', 'given', 'point', 'in', 'time', 'we', 'evaluate', 'the', 'achievable', 'rate', 'by', 'such', 'an', 'energyrecycling', 'miso', 'system', 'under', 'an', 'average', 'transmission', 'power', 'constraint', 'our', 'achievable', 'scheme', 'carefully', 'switches', 'the', 'mode', 'of', 'the', 'antennas', 'between', 'transmission', 'and', 'wireless', 'harvesting', 'where', 'most', 'of', 'the', 'harvesting', 'happens', 'from', 'the', 'neighboring', 'antennas', 'transmissions', 'ie', 'recycling', 'we', 'show', 'that', 'with', 'recycling', 'it', 'is', 'possible', 'to', 'exceed', 'the', 'capacity', 'of', 'the', 'classical', 'nonharvesting', 'counterpart', 'as', 'the', 'complexity', 'of', 'the', 'achievable', 'algorithm', 'is', 'exponential', 'with', 'the', 'number', 'of', 'antennas', 'we', 'also', 'provide', 'an', 'almost', 'linear', 'algorithm', 'that', 'has', 'a', 'minimal', 'degradation', 'in', 'achievable', 'rate', 'to', 'address', 'the', 'major', 'questions', 'on', 'the', 'capability', 'of', 'recycling', 'and', 'the', 'impacts', 'of', 'antenna', 'coupling', 'we', 'also', 'develop', 'a', 'hardware', 'setup', 'and', 'experimental', 'results', 'for', 'a', '4antenna', 'transmitter', 'based', 'on', 'a', 'uniform', 'linear', 'array', 'ula', 'we', 'demonstrate', 'that', 'the', 'loss', 'in', 'the', 'rate', 'due', 'to', 'antenna', 'coupling', 'can', 'be', 'made', 'negligible', 'with', 'sufficient', 'antenna', 'spacing', 'and', 'provide', 'hardware', 'measurements', 'for', 'the', 'power', 'recycled', 'from', 'the', 'transmitting', 'antennas', 'and', 'the', 'power', 'received', 'at', 'the', 'target', 'receiver', 'taken', 'simultaneously', 'we', 'provide', 'refined', 'performance', 'measurement', 'results', 'based', 'on', 'our', 'actual', 'measurements']] | [-0.23070224975346632, 0.06862393877146089, -0.008933459683543159, -0.026978346209285693, -0.05194634682764965, -0.22722078532290954, 0.1142999107772041, 0.3970424802552554, -0.25517679536105353, -0.28689415759207415, 0.09049720065141585, -0.26485615830779785, -0.1442687142440783, 0.20770228269753888, -0.08338902831643022, 0.050643012285166024, 0.04636924453523188, 0.08202834794716356, -0.018199457022222174, -0.25310467505450585, 0.2625552376089174, 0.16632840967338, 0.3278352510361444, 0.040718230040511116, 0.1338981578836129, 0.012552741623394901, 0.01508082096974942, -0.04888142990391879, -0.09886363948365519, 0.0796750231501868, 0.2768400886051712, 0.19708193977407756, 0.23446327808556988, -0.44623514198077224, -0.22353160335194497, 0.09231797594665772, 0.12344822893917029, 0.07417877566296652, -0.08023978139528827, -0.21474596229160114, 0.09285134723121743, -0.19470381925459065, -0.04833310048007185, 0.041856870707124474, -0.0907810112860586, 0.07230803091078997, -0.3522552797615173, -0.01246443762294283, 0.007355931740520256, 0.011959309638699605, -0.04076613374830534, -0.11443877281687621, 0.027076330670111236, 0.1657645604362534, 0.009995556951478302, -0.03161392762115048, 0.10045562273534459, -0.08009599924743746, -0.10035476890673073, 0.3503192150144882, -0.044122539736729645, -0.22480160161475873, 0.14190637919430932, -0.14313827868151877, -0.06308608893194191, 0.15858049643270317, 0.25381135631219615, 0.06145000183508576, -0.14306790676145326, 0.02638212503904166, 0.001215360171738125, 0.23842282305496545, 0.09149946692133588, 0.13019554714361828, 0.17423692836226629, 0.19233335278307398, 0.13152686116712478, 0.16679685865584318, -0.14950427640481698, -0.06836776229569555, -0.25320555336047185, -0.11651149392904094, -0.24906515795779083, 0.056995731658701386, -0.09510132673694031, -0.04744621316148412, 0.3527922077055077, 0.14389728015549258, 0.1435329378826455, 0.10605891049185413, 0.4227886706058468, 0.12843380094134427, 0.07310931912756392, 0.11301660489733054, 0.2577492999982843, 0.09348024432381083, 0.0870789060302611, -0.25461790871673395, 0.043178137700029075, -0.05478772348613434] |
1,802.01232 | Analytic Study of Cosmological Perturbations in a Unified Model of Dark
Matter and Dark Energy with a Sharp Transition | We study cosmological perturbations in a model of unified dark matter and
dark energy with a sharp transition in the late-time universe. The dark sector
is described by a dark fluid which evolves from an early stage at redshifts $z
> z_C$ when it behaves as cold dark matter (CDM) to a late time dark energy
(DE) phase ($z < z_C$) when the equation of state parameter is $w = -1 +
\epsilon$, with a constant $\epsilon$ which must be in the range $0 < \epsilon
< 2/3$. We show that fluctuations in the dark energy phase suffer from an
exponential instability, the mode functions growing both as a function of
comoving momentum $k$ and of conformal time $\eta$. In order that this
exponential instability does not lead to distortions of the energy density
power spectrum on scales for which we have good observational results, the
redshift $z_C$ of transition between the two phases is constrained to be so
close to zero that the model is unable to explain the supernova data.
| astro-ph.CO gr-qc hep-th | we study cosmological perturbations in a model of unified dark matter and dark energy with a sharp transition in the latetime universe the dark sector is described by a dark fluid which evolves from an early stage at redshifts z z_c when it behaves as cold dark matter cdm to a late time dark energy de phase z z_c when the equation of state parameter is w 1 epsilon with a constant epsilon which must be in the range 0 epsilon 23 we show that fluctuations in the dark energy phase suffer from an exponential instability the mode functions growing both as a function of comoving momentum k and of conformal time eta in order that this exponential instability does not lead to distortions of the energy density power spectrum on scales for which we have good observational results the redshift z_c of transition between the two phases is constrained to be so close to zero that the model is unable to explain the supernova data | [['we', 'study', 'cosmological', 'perturbations', 'in', 'a', 'model', 'of', 'unified', 'dark', 'matter', 'and', 'dark', 'energy', 'with', 'a', 'sharp', 'transition', 'in', 'the', 'latetime', 'universe', 'the', 'dark', 'sector', 'is', 'described', 'by', 'a', 'dark', 'fluid', 'which', 'evolves', 'from', 'an', 'early', 'stage', 'at', 'redshifts', 'z', 'z_c', 'when', 'it', 'behaves', 'as', 'cold', 'dark', 'matter', 'cdm', 'to', 'a', 'late', 'time', 'dark', 'energy', 'de', 'phase', 'z', 'z_c', 'when', 'the', 'equation', 'of', 'state', 'parameter', 'is', 'w', '1', 'epsilon', 'with', 'a', 'constant', 'epsilon', 'which', 'must', 'be', 'in', 'the', 'range', '0', 'epsilon', '23', 'we', 'show', 'that', 'fluctuations', 'in', 'the', 'dark', 'energy', 'phase', 'suffer', 'from', 'an', 'exponential', 'instability', 'the', 'mode', 'functions', 'growing', 'both', 'as', 'a', 'function', 'of', 'comoving', 'momentum', 'k', 'and', 'of', 'conformal', 'time', 'eta', 'in', 'order', 'that', 'this', 'exponential', 'instability', 'does', 'not', 'lead', 'to', 'distortions', 'of', 'the', 'energy', 'density', 'power', 'spectrum', 'on', 'scales', 'for', 'which', 'we', 'have', 'good', 'observational', 'results', 'the', 'redshift', 'z_c', 'of', 'transition', 'between', 'the', 'two', 'phases', 'is', 'constrained', 'to', 'be', 'so', 'close', 'to', 'zero', 'that', 'the', 'model', 'is', 'unable', 'to', 'explain', 'the', 'supernova', 'data']] | [-0.13829110072594675, 0.197160983671531, -0.15027812935961746, 0.09857054835631433, -0.06961911296786134, -0.12762985335303897, 0.0035965077281671473, 0.31018833595686396, -0.25013062606582487, -0.3319447692595871, 0.0300714340480325, -0.2688345826814422, -0.02790977622954601, 0.11684320839851287, 0.047322863802672865, 0.012077704201037267, -0.027795866401080626, 0.028133279315745795, -0.02957004514031592, -0.23417447020961757, 0.3174028396922029, 0.09384561766567359, 0.20649592271278028, 0.004978618183431317, 0.07875719698249778, -0.09852742866882269, 0.028684325684535217, -0.020274562558337362, -0.23022403364298208, -0.05250886213090495, 0.23431026226566004, 0.09113546661437905, 0.25344062116451516, -0.35903728854876144, -0.23489783127534103, 0.19570038383209473, 0.1819385564324996, 0.11461583091330389, -0.05993384189261348, -0.2582713106271239, 0.0804062576807407, -0.1796950273922678, -0.1315862807383514, -0.015050423292286065, 0.00469423863329891, -0.0009501857741971511, -0.2667815458753247, 0.1897052058792976, 0.0006614701011700623, -0.0679815179059641, -0.08319479158619442, -0.08289742078604065, -0.04846078494328063, 0.01816169184202003, 0.10450649933457509, 0.08734733162445005, 0.14068824862668583, -0.20545125871767705, -0.03547243062331038, 0.40563225846019496, -0.1454471231989439, -0.1161753165210227, 0.1619683766880645, -0.1732963032709997, -0.11465014878615558, 0.1566843664742086, 0.14680348986378275, 0.06798569262252156, -0.07390245199515569, 0.13110278667998676, 0.022246968367905635, 0.2392617329135986, 0.038197169879855344, 0.03225263171319616, 0.2761322333623307, 0.14167459879395922, 0.050849749876399446, 0.04847844656141677, -0.07006943196160663, -0.0704720998154841, -0.3434060138021876, -0.15214690956545163, -0.19846024463589287, 0.049405725348929466, -0.11616649742624638, -0.15190734853406987, 0.3484206004959341, 0.08638399828592504, 0.26075542389123463, 0.05254687295584232, 0.29219640120134566, 0.11006104975731212, 0.025219340860585582, 0.08346255266145138, 0.3072543249364538, 0.09153939097704568, 0.13140931394419644, -0.21728762850468328, -0.019440402621852166, -0.001863615263354437] |
1,802.01233 | Multidimensional Data Driven Classification of Emission-line Galaxies | We propose a new soft clustering scheme for classifying galaxies in different
activity classes using simultaneously 4 emission-line ratios; log([NII ]/Ha),
log([SII]/Ha), log([OI]/Ha) and log([OIII]/Hb). We fit 20 multivariate Gaussian
distributions to the 4-dimensional distribution of these lines obtained from
the Sloan Digital Sky Survey (SDSS) in order to capture local structures and
subsequently group the multivariate Gaussian distributions to represent the
complex multi-dimensional structure of the joint distribution of galaxy spectra
in the 4 dimensional line ratio space. The main advantages of this method are
the use of all four optical-line ratios simultaneously and the adoption of a
clustering scheme. This maximises the available information, avoids
contradicting classifications, and treats each class as a distribution
resulting in soft classification boundaries and providing the probability for
an object to belong to each class. We also introduce linear multi-dimensional
decision surfaces using support vector machines based on the classification of
our soft clustering scheme. This linear multi-dimensional hard clustering
technique shows high classification accuracy with respect to our
soft-clustering scheme.
| astro-ph.GA | we propose a new soft clustering scheme for classifying galaxies in different activity classes using simultaneously 4 emissionline ratios lognii ha logsiiha logoiha and logoiiihb we fit 20 multivariate gaussian distributions to the 4dimensional distribution of these lines obtained from the sloan digital sky survey sdss in order to capture local structures and subsequently group the multivariate gaussian distributions to represent the complex multidimensional structure of the joint distribution of galaxy spectra in the 4 dimensional line ratio space the main advantages of this method are the use of all four opticalline ratios simultaneously and the adoption of a clustering scheme this maximises the available information avoids contradicting classifications and treats each class as a distribution resulting in soft classification boundaries and providing the probability for an object to belong to each class we also introduce linear multidimensional decision surfaces using support vector machines based on the classification of our soft clustering scheme this linear multidimensional hard clustering technique shows high classification accuracy with respect to our softclustering scheme | [['we', 'propose', 'a', 'new', 'soft', 'clustering', 'scheme', 'for', 'classifying', 'galaxies', 'in', 'different', 'activity', 'classes', 'using', 'simultaneously', '4', 'emissionline', 'ratios', 'lognii', 'ha', 'logsiiha', 'logoiha', 'and', 'logoiiihb', 'we', 'fit', '20', 'multivariate', 'gaussian', 'distributions', 'to', 'the', '4dimensional', 'distribution', 'of', 'these', 'lines', 'obtained', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'in', 'order', 'to', 'capture', 'local', 'structures', 'and', 'subsequently', 'group', 'the', 'multivariate', 'gaussian', 'distributions', 'to', 'represent', 'the', 'complex', 'multidimensional', 'structure', 'of', 'the', 'joint', 'distribution', 'of', 'galaxy', 'spectra', 'in', 'the', '4', 'dimensional', 'line', 'ratio', 'space', 'the', 'main', 'advantages', 'of', 'this', 'method', 'are', 'the', 'use', 'of', 'all', 'four', 'opticalline', 'ratios', 'simultaneously', 'and', 'the', 'adoption', 'of', 'a', 'clustering', 'scheme', 'this', 'maximises', 'the', 'available', 'information', 'avoids', 'contradicting', 'classifications', 'and', 'treats', 'each', 'class', 'as', 'a', 'distribution', 'resulting', 'in', 'soft', 'classification', 'boundaries', 'and', 'providing', 'the', 'probability', 'for', 'an', 'object', 'to', 'belong', 'to', 'each', 'class', 'we', 'also', 'introduce', 'linear', 'multidimensional', 'decision', 'surfaces', 'using', 'support', 'vector', 'machines', 'based', 'on', 'the', 'classification', 'of', 'our', 'soft', 'clustering', 'scheme', 'this', 'linear', 'multidimensional', 'hard', 'clustering', 'technique', 'shows', 'high', 'classification', 'accuracy', 'with', 'respect', 'to', 'our', 'softclustering', 'scheme']] | [-0.047686315462470236, 0.011196885934534693, -0.07890397010558489, 0.07885481995422529, -0.09104091153627761, -0.10211077289053852, 0.04137382259671917, 0.4389873886162915, -0.24950808443401645, -0.3062078017083411, 0.06753751527370386, -0.2528986798474429, -0.10745791997476595, 0.1668985525441424, -0.062143958531456385, 0.07023115139795331, 0.02066798446836268, -0.03141454096014679, -0.05922581324717257, -0.29277043142526343, 0.3490368669409668, 0.022306808932093768, 0.33411285983506456, -0.06483347181560153, 0.10425951441454633, 0.05263149544664818, -0.1279146097878721, 0.016163369633432012, -0.08771145591376031, 0.1604733259627232, 0.25662038619374494, 0.16591301816515625, 0.23510437817511534, -0.2902169318120109, -0.209961053381515, 0.12307895720714884, 0.15572830177446054, 0.07202254253206775, -0.018713842190819133, -0.2687717400173225, 0.10021457798983448, -0.1870334992604401, -0.10945969645115661, -0.08003111247813738, -0.029877386321370467, 0.06242690595979916, -0.2593257267737233, 0.0871278540380001, 0.0449227091015839, 0.060133657950578574, -0.09751970255633861, -0.11443754577464084, -0.0029746917894155514, 0.12585043805231136, -0.013094863593124034, 0.009062794700872562, 0.10095318723413185, -0.13271370644471928, -0.1275631274350794, 0.3756975269089907, -0.05002017051802107, -0.17276789932994444, 0.21242159261884985, -0.1262514284235516, -0.19721412009888942, 0.16656520594800142, 0.22017854113676927, 0.12045051868282337, -0.1383726429481701, 0.0306543192507489, -0.02949851847902542, 0.18051900186507805, 0.03346005769548711, 0.012277707963044011, 0.20211007748162602, 0.1380624567263578, 0.0452985420607303, 0.14049118996786647, -0.19593141306469944, -0.07149850996211171, -0.2801648995373398, -0.12997862728732842, -0.15118102429054178, 0.002825079260041892, -0.13490295654868, -0.17007068705336167, 0.3904352944869393, 0.1114889528902628, 0.27188006699761014, 0.10515818335456638, 0.31437256459782764, 0.07165111861512542, 0.05975508380953858, 0.06655773063450796, 0.17452466674149036, 0.13064610829758572, 0.07940855353968446, -0.15971612090545864, 0.033273271773373934, 0.07282355861034154] |
1,802.01234 | Validating Continuum Lowering Models via Multi-Wavelength Measurements
of Integrated X-ray Emission | X-ray emission spectroscopy is a well-established technique used to study
continuum lowering in dense plasmas. It relies on accurate atomic physics
models to robustly reproduce high-resolution emission spectra, and depends on
our ability to identify spectroscopic signatures such as emission lines or
ionization edges of individual charge states within the plasma. Here we
describe a method that forgoes these requirements, enabling the validation of
different continuum lowering models based solely on the total intensity of
plasma emission in systems driven by narrow-bandwidth x-ray pulses across a
range of wavelengths. The method is tested on published Al spectroscopy data
and applied to the new case of solid-density partially-ionized Fe plasmas,
where extracting ionization edges directly is precluded by the significant
overlap of emission from a wide range of charge states.
| physics.plasm-ph | xray emission spectroscopy is a wellestablished technique used to study continuum lowering in dense plasmas it relies on accurate atomic physics models to robustly reproduce highresolution emission spectra and depends on our ability to identify spectroscopic signatures such as emission lines or ionization edges of individual charge states within the plasma here we describe a method that forgoes these requirements enabling the validation of different continuum lowering models based solely on the total intensity of plasma emission in systems driven by narrowbandwidth xray pulses across a range of wavelengths the method is tested on published al spectroscopy data and applied to the new case of soliddensity partiallyionized fe plasmas where extracting ionization edges directly is precluded by the significant overlap of emission from a wide range of charge states | [['xray', 'emission', 'spectroscopy', 'is', 'a', 'wellestablished', 'technique', 'used', 'to', 'study', 'continuum', 'lowering', 'in', 'dense', 'plasmas', 'it', 'relies', 'on', 'accurate', 'atomic', 'physics', 'models', 'to', 'robustly', 'reproduce', 'highresolution', 'emission', 'spectra', 'and', 'depends', 'on', 'our', 'ability', 'to', 'identify', 'spectroscopic', 'signatures', 'such', 'as', 'emission', 'lines', 'or', 'ionization', 'edges', 'of', 'individual', 'charge', 'states', 'within', 'the', 'plasma', 'here', 'we', 'describe', 'a', 'method', 'that', 'forgoes', 'these', 'requirements', 'enabling', 'the', 'validation', 'of', 'different', 'continuum', 'lowering', 'models', 'based', 'solely', 'on', 'the', 'total', 'intensity', 'of', 'plasma', 'emission', 'in', 'systems', 'driven', 'by', 'narrowbandwidth', 'xray', 'pulses', 'across', 'a', 'range', 'of', 'wavelengths', 'the', 'method', 'is', 'tested', 'on', 'published', 'al', 'spectroscopy', 'data', 'and', 'applied', 'to', 'the', 'new', 'case', 'of', 'soliddensity', 'partiallyionized', 'fe', 'plasmas', 'where', 'extracting', 'ionization', 'edges', 'directly', 'is', 'precluded', 'by', 'the', 'significant', 'overlap', 'of', 'emission', 'from', 'a', 'wide', 'range', 'of', 'charge', 'states']] | [-0.012618404015350018, 0.1202144209735904, -0.03362825243596652, 0.05526254764241852, -0.035886921613051216, -0.10159701590476804, 0.06352280558974938, 0.4310763057126382, -0.20241150995644258, -0.34807337489874324, 0.02674521185464926, -0.2920074690884167, -0.02706581165693933, 0.23330961369779393, 0.02287423758868619, 0.03345265561469304, 0.044516624204179116, -0.11581164791949036, -0.0040402603046896385, -0.13946189366050007, 0.30639417152563037, 0.09416577258587693, 0.2859823880933745, 0.0957063342130548, 0.06647373858366393, -0.015941384714096785, -0.05181970420228534, -0.006991179338692464, -0.09558485348645983, 0.10092124629083501, 0.24405774693872262, 0.1025260269548022, 0.20377117461820907, -0.414385107930663, -0.29065856354107156, 0.03332815207396598, 0.1518377344549973, 0.08703687808353656, -0.03771087538826373, -0.2679628342978454, 0.006569671699084168, -0.13139478594079151, -0.11750928383291692, -0.05475430254997729, 0.026923052432347636, 0.06497218630677305, -0.26723002591856226, 0.0755969765884874, -0.01667883763966952, 0.07419656651715438, -0.07855123694798397, -0.07029706719800714, -0.058603896715907496, 0.07709313385989951, -0.040862470849005635, 0.019450779516040528, 0.21524609726774255, -0.10811221471973226, -0.10460935201669155, 0.37567893344215875, -0.08926809114916612, -0.06320433247141367, 0.2468845808297367, -0.18546826017988022, -0.14533403555162308, 0.22782831917726254, 0.15265403185111953, 0.16538569445599072, -0.12787436490315338, 0.009423480357418862, -0.017224070042111846, 0.22993527511640113, 0.04869015231844066, 0.07663303843064075, 0.25760030265637607, 0.15033113749069704, -0.0031367693450157497, 0.10377844954820985, -0.18672702192191698, -0.023390455308186193, -0.24093775375648727, -0.08077117887606697, -0.195076349817664, 0.042349643570320436, 0.0021000648742675234, -0.17052954895414643, 0.40378176358838874, 0.18433536566043085, 0.1794157839748402, -0.06314676813984312, 0.3290992147801805, 0.10921562106399112, 0.06352221755700749, 0.03595684378321261, 0.26411607099494844, 0.1738443826758411, 0.0991633951144163, -0.2594789844313131, 0.04068173237448169, 0.011499823560187406] |
1,802.01235 | Tracking Multiple Moving Objects Using Unscented Kalman Filtering
Techniques | It is an important task to reliably detect and track multiple moving objects
for video surveillance and monitoring. However, when occlusion occurs in
nonlinear motion scenarios, many existing methods often fail to continuously
track multiple moving objects of interest. In this paper we propose an
effective approach for detection and tracking of multiple moving objects with
occlusion. Moving targets are initially detected using a simple yet efficient
block matching technique, providing rough location information for multiple
object tracking. More accurate location information is then estimated for each
moving object by a nonlinear tracking algorithm. Considering the ambiguity
caused by the occlusion among multiple moving objects, we apply an unscented
Kalman filtering (UKF) technique for reliable object detection and tracking.
Different from conventional Kalman filtering (KF), which cannot achieve the
optimal estimation in nonlinear tracking scenarios, UKF can be used to track
both linear and nonlinear motions due to the unscented transform. Further, it
estimates the velocity information for each object to assist to the object
detection algorithm, effectively delineating multiple moving objects of
occlusion. The experimental results demonstrate that the proposed method can
correctly detect and track multiple moving objects with nonlinear motion
patterns and occlusions.
| cs.CV | it is an important task to reliably detect and track multiple moving objects for video surveillance and monitoring however when occlusion occurs in nonlinear motion scenarios many existing methods often fail to continuously track multiple moving objects of interest in this paper we propose an effective approach for detection and tracking of multiple moving objects with occlusion moving targets are initially detected using a simple yet efficient block matching technique providing rough location information for multiple object tracking more accurate location information is then estimated for each moving object by a nonlinear tracking algorithm considering the ambiguity caused by the occlusion among multiple moving objects we apply an unscented kalman filtering ukf technique for reliable object detection and tracking different from conventional kalman filtering kf which cannot achieve the optimal estimation in nonlinear tracking scenarios ukf can be used to track both linear and nonlinear motions due to the unscented transform further it estimates the velocity information for each object to assist to the object detection algorithm effectively delineating multiple moving objects of occlusion the experimental results demonstrate that the proposed method can correctly detect and track multiple moving objects with nonlinear motion patterns and occlusions | [['it', 'is', 'an', 'important', 'task', 'to', 'reliably', 'detect', 'and', 'track', 'multiple', 'moving', 'objects', 'for', 'video', 'surveillance', 'and', 'monitoring', 'however', 'when', 'occlusion', 'occurs', 'in', 'nonlinear', 'motion', 'scenarios', 'many', 'existing', 'methods', 'often', 'fail', 'to', 'continuously', 'track', 'multiple', 'moving', 'objects', 'of', 'interest', 'in', 'this', 'paper', 'we', 'propose', 'an', 'effective', 'approach', 'for', 'detection', 'and', 'tracking', 'of', 'multiple', 'moving', 'objects', 'with', 'occlusion', 'moving', 'targets', 'are', 'initially', 'detected', 'using', 'a', 'simple', 'yet', 'efficient', 'block', 'matching', 'technique', 'providing', 'rough', 'location', 'information', 'for', 'multiple', 'object', 'tracking', 'more', 'accurate', 'location', 'information', 'is', 'then', 'estimated', 'for', 'each', 'moving', 'object', 'by', 'a', 'nonlinear', 'tracking', 'algorithm', 'considering', 'the', 'ambiguity', 'caused', 'by', 'the', 'occlusion', 'among', 'multiple', 'moving', 'objects', 'we', 'apply', 'an', 'unscented', 'kalman', 'filtering', 'ukf', 'technique', 'for', 'reliable', 'object', 'detection', 'and', 'tracking', 'different', 'from', 'conventional', 'kalman', 'filtering', 'kf', 'which', 'can', 'not', 'achieve', 'the', 'optimal', 'estimation', 'in', 'nonlinear', 'tracking', 'scenarios', 'ukf', 'can', 'be', 'used', 'to', 'track', 'both', 'linear', 'and', 'nonlinear', 'motions', 'due', 'to', 'the', 'unscented', 'transform', 'further', 'it', 'estimates', 'the', 'velocity', 'information', 'for', 'each', 'object', 'to', 'assist', 'to', 'the', 'object', 'detection', 'algorithm', 'effectively', 'delineating', 'multiple', 'moving', 'objects', 'of', 'occlusion', 'the', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'method', 'can', 'correctly', 'detect', 'and', 'track', 'multiple', 'moving', 'objects', 'with', 'nonlinear', 'motion', 'patterns', 'and', 'occlusions']] | [-0.05857780217849011, 0.02591050593712814, -0.1026685317188766, 0.04444438601231798, -0.11886835408037727, -0.2312774780078739, -0.034418674642669254, 0.47080006732175195, -0.28441633802701527, -0.38674203385622596, 0.13399929481234665, -0.24324583793106266, -0.16066030061657205, 0.18020203479844604, -0.1902106267560822, 0.11749730523921512, 0.11538626076322674, 0.052385315715056384, -0.01599405964169897, -0.2056177588354626, 0.22334292289909674, 0.047384947268906887, 0.25774939492496135, -0.05287745449843292, 0.17485951150762777, 0.07786071134570438, -0.10681683631131643, 0.023382001743193357, 0.0055824624713044025, 0.12687433370611237, 0.32414961140957393, 0.13224159330980578, 0.27509074662882965, -0.3879054936055605, -0.24485213672600423, 0.08727728888430268, 0.19562909776684095, 0.1404822170468482, -0.057289099956990865, -0.435770570035778, 0.09386959029267056, -0.1568834448261612, -0.09241200228183895, -0.08492008626678495, 0.00952778095237646, -0.0008281201796681824, -0.2989568815821886, 0.06686687348383895, 0.049516930022669325, 0.012064183280959272, -0.1021794677076171, -0.030883564107914263, 0.05223785734832639, 0.20841114447280165, 0.016753601078133142, 0.006735375092535039, 0.21392635882921934, -0.18525660495027937, -0.11627862406989115, 0.3732407862712927, -0.011140776678759056, -0.2638329339123846, 0.25395798909614986, -0.029985937535724965, -0.10142661817253656, 0.21070166123406914, 0.2364692758239314, 0.20197345639300074, -0.20129353961197313, -0.06895892105985972, -0.0064470580741195814, 0.16703961533848857, 0.08293977568190791, 0.009574659988945964, 0.23334167221605986, 0.162893254535632, 0.12546020578610745, 0.09444929930785681, -0.24792523221420076, -0.06817493007192152, -0.2094792216271044, -0.0985780037438874, -0.12354390131460909, -0.11960427408798913, -0.0933160396396368, -0.1521919158400807, 0.34406484685469474, 0.2675011543058294, 0.19711382860296553, 0.038836389835002046, 0.3841026207611797, 0.07038039632075405, 0.044406450355926594, 0.08615746141055618, 0.17778557096726172, 0.01711806024041802, 0.10527433524957769, -0.21312438122937596, 0.06996626913935174, 0.06579748310058893] |
1,802.01236 | Studies on the high-temperature ferroelectric transition of multiferroic
hexagonal manganite RMnO3 | Hexagonal manganites are multiferroic materials with two highly-dissimilar
phase transitions: a ferroelectric transition (from P63/mmc to P63cm) at a
temperature higher than 1000 K and an antiferromagnetic transition at TN=65 -
130 K. Despite its critical relevance to the intriguing ferroelectric domain
physics, the details of the ferroelectric transition are yet not well known to
date primarily because of the ultra-high transition temperature. Using
high-temperature X-ray diffraction experiments, we show that the ferroelectric
transition is a single transition of abrupt order and R-Op displacement is the
primary order parameter. This structural transition is then simultaneously
accompanied by MnO5 tilting and the subsequent development of electric
polarization.
| cond-mat.str-el | hexagonal manganites are multiferroic materials with two highlydissimilar phase transitions a ferroelectric transition from p63mmc to p63cm at a temperature higher than 1000 k and an antiferromagnetic transition at tn65 130 k despite its critical relevance to the intriguing ferroelectric domain physics the details of the ferroelectric transition are yet not well known to date primarily because of the ultrahigh transition temperature using hightemperature xray diffraction experiments we show that the ferroelectric transition is a single transition of abrupt order and rop displacement is the primary order parameter this structural transition is then simultaneously accompanied by mno5 tilting and the subsequent development of electric polarization | [['hexagonal', 'manganites', 'are', 'multiferroic', 'materials', 'with', 'two', 'highlydissimilar', 'phase', 'transitions', 'a', 'ferroelectric', 'transition', 'from', 'p63mmc', 'to', 'p63cm', 'at', 'a', 'temperature', 'higher', 'than', '1000', 'k', 'and', 'an', 'antiferromagnetic', 'transition', 'at', 'tn65', '130', 'k', 'despite', 'its', 'critical', 'relevance', 'to', 'the', 'intriguing', 'ferroelectric', 'domain', 'physics', 'the', 'details', 'of', 'the', 'ferroelectric', 'transition', 'are', 'yet', 'not', 'well', 'known', 'to', 'date', 'primarily', 'because', 'of', 'the', 'ultrahigh', 'transition', 'temperature', 'using', 'hightemperature', 'xray', 'diffraction', 'experiments', 'we', 'show', 'that', 'the', 'ferroelectric', 'transition', 'is', 'a', 'single', 'transition', 'of', 'abrupt', 'order', 'and', 'rop', 'displacement', 'is', 'the', 'primary', 'order', 'parameter', 'this', 'structural', 'transition', 'is', 'then', 'simultaneously', 'accompanied', 'by', 'mno5', 'tilting', 'and', 'the', 'subsequent', 'development', 'of', 'electric', 'polarization']] | [-0.13786224638862374, 0.26346059497663393, -0.004159050830865948, -0.031973323484123184, -0.11976211610051252, -0.09928751180063734, 0.11116242324831688, 0.4445276886080075, -0.28081893665010776, -0.2949364424188106, 0.08484252413409282, -0.3384588430590421, -0.14138257362002743, 0.11557171563391835, 0.08186471314865698, 0.022413055185857005, -0.10603650939623707, 0.01441692253032211, -0.13186934403962122, -0.15287956881146986, 0.2337260998930167, 0.02296016115731406, 0.3181922720152957, 0.09229292667943315, 0.05511917461397, -0.0864554264727365, 0.16983975034243273, 0.009073639826541677, -0.152252972612366, 0.009089539153049293, 0.3021648466130447, -0.06301574937510983, 0.1806624425050703, -0.38267227524475567, -0.20483856327216893, 0.030495291420945772, 0.10809954769403032, 0.11960566472216934, -0.08657736002661975, -0.269979150773668, 0.06803752504994423, -0.09239954231035652, -0.08523520579373971, -0.11487163002919225, -0.003936996678957372, -0.017453191034230292, -0.25121890225908855, 0.08147201218497623, 0.08057950648763985, 0.13975484754203013, -0.08710627681553111, -0.11896017022901079, -0.0646663378783981, 0.05364943171390197, 0.04383207688297968, 0.12191812340531824, 0.16376231783928658, -0.08190306823574078, -0.13979891174499995, 0.4053814269204452, -0.0012801135671200701, 0.03196161041868109, 0.18013120287107032, -0.27674852746190703, -0.08129289189751432, 0.267139093344579, 0.07578135863764808, 0.11494847125762585, -0.12197454186389223, 0.04675986707149508, 0.10769661236554384, 0.21590457144148142, 0.05373685660735858, 0.03506509168073535, 0.2630555502600172, 0.23273150826401973, -0.008243985336219657, 0.18575471595101492, -0.0988901324041224, -0.0521120377499791, -0.2359048905691982, -0.14648372060291523, -0.2203199568936981, 0.0352898029876405, -0.10430084425208354, -0.19719242437989043, 0.3725839873066045, 0.15110315969304264, 0.18179664111614807, -0.07822195086989878, 0.25166642926610755, 0.05642349812319701, 0.05971309882181796, -0.021113687633419212, 0.2872109477525776, 0.15411296627231086, 0.16778222217848435, -0.2664814364612645, 0.13807285776434158, -0.008177608563519508] |
1,802.01237 | Face Destylization | Numerous style transfer methods which produce artistic styles of portraits
have been proposed to date. However, the inverse problem of converting the
stylized portraits back into realistic faces is yet to be investigated
thoroughly. Reverting an artistic portrait to its original photo-realistic face
image has potential to facilitate human perception and identity analysis. In
this paper, we propose a novel Face Destylization Neural Network (FDNN) to
restore the latent photo-realistic faces from the stylized ones. We develop a
Style Removal Network composed of convolutional, fully-connected and
deconvolutional layers. The convolutional layers are designed to extract facial
components from stylized face images. Consecutively, the fully-connected layer
transfers the extracted feature maps of stylized images into the corresponding
feature maps of real faces and the deconvolutional layers generate real faces
from the transferred feature maps. To enforce the destylized faces to be
similar to authentic face images, we employ a discriminative network, which
consists of convolutional and fully connected layers. We demonstrate the
effectiveness of our network by conducting experiments on an extensive set of
synthetic images. Furthermore, we illustrate our network can recover faces from
stylized portraits and real paintings for which the stylized data was
unavailable during the training phase.
| cs.CV | numerous style transfer methods which produce artistic styles of portraits have been proposed to date however the inverse problem of converting the stylized portraits back into realistic faces is yet to be investigated thoroughly reverting an artistic portrait to its original photorealistic face image has potential to facilitate human perception and identity analysis in this paper we propose a novel face destylization neural network fdnn to restore the latent photorealistic faces from the stylized ones we develop a style removal network composed of convolutional fullyconnected and deconvolutional layers the convolutional layers are designed to extract facial components from stylized face images consecutively the fullyconnected layer transfers the extracted feature maps of stylized images into the corresponding feature maps of real faces and the deconvolutional layers generate real faces from the transferred feature maps to enforce the destylized faces to be similar to authentic face images we employ a discriminative network which consists of convolutional and fully connected layers we demonstrate the effectiveness of our network by conducting experiments on an extensive set of synthetic images furthermore we illustrate our network can recover faces from stylized portraits and real paintings for which the stylized data was unavailable during the training phase | [['numerous', 'style', 'transfer', 'methods', 'which', 'produce', 'artistic', 'styles', 'of', 'portraits', 'have', 'been', 'proposed', 'to', 'date', 'however', 'the', 'inverse', 'problem', 'of', 'converting', 'the', 'stylized', 'portraits', 'back', 'into', 'realistic', 'faces', 'is', 'yet', 'to', 'be', 'investigated', 'thoroughly', 'reverting', 'an', 'artistic', 'portrait', 'to', 'its', 'original', 'photorealistic', 'face', 'image', 'has', 'potential', 'to', 'facilitate', 'human', 'perception', 'and', 'identity', 'analysis', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'face', 'destylization', 'neural', 'network', 'fdnn', 'to', 'restore', 'the', 'latent', 'photorealistic', 'faces', 'from', 'the', 'stylized', 'ones', 'we', 'develop', 'a', 'style', 'removal', 'network', 'composed', 'of', 'convolutional', 'fullyconnected', 'and', 'deconvolutional', 'layers', 'the', 'convolutional', 'layers', 'are', 'designed', 'to', 'extract', 'facial', 'components', 'from', 'stylized', 'face', 'images', 'consecutively', 'the', 'fullyconnected', 'layer', 'transfers', 'the', 'extracted', 'feature', 'maps', 'of', 'stylized', 'images', 'into', 'the', 'corresponding', 'feature', 'maps', 'of', 'real', 'faces', 'and', 'the', 'deconvolutional', 'layers', 'generate', 'real', 'faces', 'from', 'the', 'transferred', 'feature', 'maps', 'to', 'enforce', 'the', 'destylized', 'faces', 'to', 'be', 'similar', 'to', 'authentic', 'face', 'images', 'we', 'employ', 'a', 'discriminative', 'network', 'which', 'consists', 'of', 'convolutional', 'and', 'fully', 'connected', 'layers', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'network', 'by', 'conducting', 'experiments', 'on', 'an', 'extensive', 'set', 'of', 'synthetic', 'images', 'furthermore', 'we', 'illustrate', 'our', 'network', 'can', 'recover', 'faces', 'from', 'stylized', 'portraits', 'and', 'real', 'paintings', 'for', 'which', 'the', 'stylized', 'data', 'was', 'unavailable', 'during', 'the', 'training', 'phase']] | [0.0032061389459278247, -0.021320348983422402, -0.063059148072933, 0.04878899629105522, -0.1010568955927297, -0.154997918312673, -0.027853679378173606, 0.4728732483480314, -0.33413979559290136, -0.3114859817380255, 0.06817895458068116, -0.32785244495843097, -0.2521980050010513, 0.13504320018539073, -0.18596563686033465, 0.07022292117119033, 0.13055776649582754, -0.006195646369091301, -0.013113812472750057, -0.2794247164786088, 0.34574900830700767, -0.015204295437227972, 0.34425132572204065, -0.012169135044178351, 0.18938700086025598, -0.08032646636723192, -0.015870732485758838, -0.040373286275273056, -0.011358618522251044, 0.18244305523900278, 0.299745273849259, 0.18150154840862, 0.24008156812392326, -0.5072188231049839, -0.20978507370396396, 0.06024766712910449, 0.104858370843541, 0.11681575904132309, -0.03864849890956203, -0.3876140966242405, 0.10102832392081525, -0.12660838492482787, 0.03495691386592396, -0.18120760460751076, -0.0388037915355667, -0.06687237459412457, -0.28816914810761435, -0.014010155908622299, 0.06879983242422417, 0.07980213889080767, -0.06079958192710153, -0.08993951288390566, -0.07158328639696154, 0.26331003461588137, -0.00036841521458229933, 0.026045166830899136, 0.12959374660023987, -0.19967385070989935, -0.1048490884372814, 0.37199926138102934, 0.008931344756009903, -0.18535140149690438, 0.17354117788026355, -0.04845554005317013, -0.08261583219846767, 0.1528825527550935, 0.23647760795053058, 0.08790304914006324, -0.1715908071938714, -0.048784007351537415, -0.11880444170850696, 0.18458342624092097, 0.07054629473772954, -0.07030157723247704, 0.2135955843923971, 0.22600149180865942, -0.02842708071697453, 0.2465753404604685, -0.1670219702069939, -0.06855824879915078, -0.17277880325311362, -0.08124921373985332, -0.22884667002316095, -0.034848396902118405, -0.11173976873095569, -0.16288046962334635, 0.5046294932676987, 0.2386392434433366, 0.2746767233657378, 0.08539157337920665, 0.3812314746525101, 0.004731885906067239, 0.15624289163076696, 0.04049216090428709, 0.13944674216239064, 0.01550516631393082, 0.1621257342007764, -0.08971831361020002, 0.10454493919105241, 0.08936044487119135] |
1,802.01238 | Listening to the cohomology of graphs | We prove that the spectrum of the Kirchhoff Laplacian H0 of a finite simple
Barycentric refined graph and the spectrum of the connection Laplacian L of G
determine each other: we prove that L-L^(-1) is similar to the Hodge Laplacian
H of G which is in one dimensions the direct sum of the Kirchhoff Laplacian H0
and its 1-form analog H1. The spectrum of a single choice of H0,H1 or H alone
determines the Betti numbers b0,b1 of G as well as the spectrum of the other
matrices. It follows that b0 is the number of eigenvalues 1 of L and that b1 is
the number of eigenvalues -1 of L. For a general abstract finite simplicial
complex G, we express the matrix entries g(x,y) = w(x) w(y) X( St(x) cap St(y)
) of the inverse of L using stars St(x)= { z in G | x subset of z } of x and
w(x)=(-1)^dim(x) and Euler characteristic X. One can see W+(x)=St(x) and
W-(x)={ z in G | z subset x } as stable and unstable manifolds of a simplex x
in G and g(x,y) =w(x) w(y) X(W+(x) cap W+(y)) as heteroclinic intersection
numbers or curvatures and the identity L g=1 as a collection of Gauss-Bonnet
formulas. The homoclinic energy w(x)=X(W+(x) cap W-(x)) by definition adds up
to X(G). The matrix M(x,y)=w(x) w(y) X(W-(x) cap W-(y)) is similar to
L(x,y)=X(W-(x) cap W-(y)). The sum of the matrix entries of M is the definition
of Wu characteristic. For dimension 2 and higher we don't know yet how to
recover the Betti numbers from the eigenvalues of the matrix H or from L. So
far, it can only be obtained from a collection of block matrices, via the Hodge
relations b_k = dim(H_k). A natural conjecture is that for a Barycentric
refinement of a complex G, the spectrum of L determines the Betti vector. We
know this now in one dimensions.
| cs.DM math.AT math.CO | we prove that the spectrum of the kirchhoff laplacian h0 of a finite simple barycentric refined graph and the spectrum of the connection laplacian l of g determine each other we prove that ll1 is similar to the hodge laplacian h of g which is in one dimensions the direct sum of the kirchhoff laplacian h0 and its 1form analog h1 the spectrum of a single choice of h0h1 or h alone determines the betti numbers b0b1 of g as well as the spectrum of the other matrices it follows that b0 is the number of eigenvalues 1 of l and that b1 is the number of eigenvalues 1 of l for a general abstract finite simplicial complex g we express the matrix entries gxy wx wy x stx cap sty of the inverse of l using stars stx z in g x subset of z of x and wx1dimx and euler characteristic x one can see wxstx and wx z in g z subset x as stable and unstable manifolds of a simplex x in g and gxy wx wy xwx cap wy as heteroclinic intersection numbers or curvatures and the identity l g1 as a collection of gaussbonnet formulas the homoclinic energy wxxwx cap wx by definition adds up to xg the matrix mxywx wy xwx cap wy is similar to lxyxwx cap wy the sum of the matrix entries of m is the definition of wu characteristic for dimension 2 and higher we dont know yet how to recover the betti numbers from the eigenvalues of the matrix h or from l so far it can only be obtained from a collection of block matrices via the hodge relations b_k dimh_k a natural conjecture is that for a barycentric refinement of a complex g the spectrum of l determines the betti vector we know this now in one dimensions | [['we', 'prove', 'that', 'the', 'spectrum', 'of', 'the', 'kirchhoff', 'laplacian', 'h0', 'of', 'a', 'finite', 'simple', 'barycentric', 'refined', 'graph', 'and', 'the', 'spectrum', 'of', 'the', 'connection', 'laplacian', 'l', 'of', 'g', 'determine', 'each', 'other', 'we', 'prove', 'that', 'll1', 'is', 'similar', 'to', 'the', 'hodge', 'laplacian', 'h', 'of', 'g', 'which', 'is', 'in', 'one', 'dimensions', 'the', 'direct', 'sum', 'of', 'the', 'kirchhoff', 'laplacian', 'h0', 'and', 'its', '1form', 'analog', 'h1', 'the', 'spectrum', 'of', 'a', 'single', 'choice', 'of', 'h0h1', 'or', 'h', 'alone', 'determines', 'the', 'betti', 'numbers', 'b0b1', 'of', 'g', 'as', 'well', 'as', 'the', 'spectrum', 'of', 'the', 'other', 'matrices', 'it', 'follows', 'that', 'b0', 'is', 'the', 'number', 'of', 'eigenvalues', '1', 'of', 'l', 'and', 'that', 'b1', 'is', 'the', 'number', 'of', 'eigenvalues', '1', 'of', 'l', 'for', 'a', 'general', 'abstract', 'finite', 'simplicial', 'complex', 'g', 'we', 'express', 'the', 'matrix', 'entries', 'gxy', 'wx', 'wy', 'x', 'stx', 'cap', 'sty', 'of', 'the', 'inverse', 'of', 'l', 'using', 'stars', 'stx', 'z', 'in', 'g', 'x', 'subset', 'of', 'z', 'of', 'x', 'and', 'wx1dimx', 'and', 'euler', 'characteristic', 'x', 'one', 'can', 'see', 'wxstx', 'and', 'wx', 'z', 'in', 'g', 'z', 'subset', 'x', 'as', 'stable', 'and', 'unstable', 'manifolds', 'of', 'a', 'simplex', 'x', 'in', 'g', 'and', 'gxy', 'wx', 'wy', 'xwx', 'cap', 'wy', 'as', 'heteroclinic', 'intersection', 'numbers', 'or', 'curvatures', 'and', 'the', 'identity', 'l', 'g1', 'as', 'a', 'collection', 'of', 'gaussbonnet', 'formulas', 'the', 'homoclinic', 'energy', 'wxxwx', 'cap', 'wx', 'by', 'definition', 'adds', 'up', 'to', 'xg', 'the', 'matrix', 'mxywx', 'wy', 'xwx', 'cap', 'wy', 'is', 'similar', 'to', 'lxyxwx', 'cap', 'wy', 'the', 'sum', 'of', 'the', 'matrix', 'entries', 'of', 'm', 'is', 'the', 'definition', 'of', 'wu', 'characteristic', 'for', 'dimension', '2', 'and', 'higher', 'we', 'dont', 'know', 'yet', 'how', 'to', 'recover', 'the', 'betti', 'numbers', 'from', 'the', 'eigenvalues', 'of', 'the', 'matrix', 'h', 'or', 'from', 'l', 'so', 'far', 'it', 'can', 'only', 'be', 'obtained', 'from', 'a', 'collection', 'of', 'block', 'matrices', 'via', 'the', 'hodge', 'relations', 'b_k', 'dimh_k', 'a', 'natural', 'conjecture', 'is', 'that', 'for', 'a', 'barycentric', 'refinement', 'of', 'a', 'complex', 'g', 'the', 'spectrum', 'of', 'l', 'determines', 'the', 'betti', 'vector', 'we', 'know', 'this', 'now', 'in', 'one', 'dimensions']] | [-0.1875359124599629, 0.09699180535355348, -0.06268127148644073, 0.05013854393892804, -0.10038352047713066, -0.1552585378098024, 0.04186974572702404, 0.31082952311740486, -0.32101676562825676, -0.2300592707069159, 0.09365747485191112, -0.2957936486102863, -0.11695808432811242, 0.12252215110999069, -0.07206003701703473, -0.002307999984165407, 0.04765072531399891, 0.12482099669726429, -0.053679267745557556, -0.21887621095001972, 0.3323885494587166, -0.04830030770972371, 0.13858525431098181, 0.008951826099713412, 0.08520666311266802, -0.0029904913521118905, -0.011795158790954888, -0.013161254729088766, -0.17279148646397613, 0.08518652916062525, 0.21609782723984403, 0.1220860985309712, 0.20133905566994423, -0.32282086406273164, -0.13574187650224995, 0.17526853004538312, 0.12973724444557155, -0.05241570280616585, 0.04661995089651064, -0.21498983545500217, 0.15828156399398746, -0.14209435011463745, -0.15872243356841634, -0.010065479562941643, 0.1367248359370656, 0.02264910801282979, -0.2996755816868895, 0.04488917262199341, 0.09557317416623098, 0.03825718769495258, 0.013941056480930365, -0.21062230854873415, -0.11477132048843341, 0.087204306954225, 0.0024466584444305063, 0.08308778263147402, 0.07265192432643611, -0.07142896023933584, -0.0707534456005727, 0.3880894930388729, -0.08953845376512715, -0.2052826094132731, 0.10308979274874665, -0.2088609685371969, -0.13862968001989587, 0.1159318663065772, 0.08091625115303755, 0.1727632266262682, -0.022407550255256082, 0.21370235833282342, -0.09437817756671749, 0.10612983393809752, 0.10545910581705832, 0.002302220055181225, 0.11866157005281983, 0.06293825560368116, 0.1097636144694607, 0.08536087009602454, -0.07242964168941904, 0.03155968209114913, -0.3544412696154307, -0.19741748045938742, -0.24174799526801075, 0.17385790245807944, -0.13603903941053816, -0.16411657677038222, 0.3682154198578059, 0.0238208912732388, 0.24926265623206148, 0.06681065219924755, 0.22368910389070382, 0.0984071834403744, 0.0331401081681745, 0.0879108787171962, 0.11596884804050013, 0.23652311408081222, 0.06124609412736451, -0.1719601692420597, -0.019617267436384908, 0.17621179778531304] |
1,802.01239 | Counting and Sampling from Markov Equivalent DAGs Using Clique Trees | A directed acyclic graph (DAG) is the most common graphical model for
representing causal relationships among a set of variables. When restricted to
using only observational data, the structure of the ground truth DAG is
identifiable only up to Markov equivalence, based on conditional independence
relations among the variables. Therefore, the number of DAGs equivalent to the
ground truth DAG is an indicator of the causal complexity of the underlying
structure--roughly speaking, it shows how many interventions or how much
additional information is further needed to recover the underlying DAG. In this
paper, we propose a new technique for counting the number of DAGs in a Markov
equivalence class. Our approach is based on the clique tree representation of
chordal graphs. We show that in the case of bounded degree graphs, the proposed
algorithm is polynomial time. We further demonstrate that this technique can be
utilized for uniform sampling from a Markov equivalence class, which provides a
stochastic way to enumerate DAGs in the equivalence class and may be needed for
finding the best DAG or for causal inference given the equivalence class as
input. We also extend our counting and sampling method to the case where prior
knowledge about the underlying DAG is available, and present applications of
this extension in causal experiment design and estimating the causal effect of
joint interventions.
| cs.DS cs.AI cs.LG math.CO stat.ML | a directed acyclic graph dag is the most common graphical model for representing causal relationships among a set of variables when restricted to using only observational data the structure of the ground truth dag is identifiable only up to markov equivalence based on conditional independence relations among the variables therefore the number of dags equivalent to the ground truth dag is an indicator of the causal complexity of the underlying structureroughly speaking it shows how many interventions or how much additional information is further needed to recover the underlying dag in this paper we propose a new technique for counting the number of dags in a markov equivalence class our approach is based on the clique tree representation of chordal graphs we show that in the case of bounded degree graphs the proposed algorithm is polynomial time we further demonstrate that this technique can be utilized for uniform sampling from a markov equivalence class which provides a stochastic way to enumerate dags in the equivalence class and may be needed for finding the best dag or for causal inference given the equivalence class as input we also extend our counting and sampling method to the case where prior knowledge about the underlying dag is available and present applications of this extension in causal experiment design and estimating the causal effect of joint interventions | [['a', 'directed', 'acyclic', 'graph', 'dag', 'is', 'the', 'most', 'common', 'graphical', 'model', 'for', 'representing', 'causal', 'relationships', 'among', 'a', 'set', 'of', 'variables', 'when', 'restricted', 'to', 'using', 'only', 'observational', 'data', 'the', 'structure', 'of', 'the', 'ground', 'truth', 'dag', 'is', 'identifiable', 'only', 'up', 'to', 'markov', 'equivalence', 'based', 'on', 'conditional', 'independence', 'relations', 'among', 'the', 'variables', 'therefore', 'the', 'number', 'of', 'dags', 'equivalent', 'to', 'the', 'ground', 'truth', 'dag', 'is', 'an', 'indicator', 'of', 'the', 'causal', 'complexity', 'of', 'the', 'underlying', 'structureroughly', 'speaking', 'it', 'shows', 'how', 'many', 'interventions', 'or', 'how', 'much', 'additional', 'information', 'is', 'further', 'needed', 'to', 'recover', 'the', 'underlying', 'dag', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'technique', 'for', 'counting', 'the', 'number', 'of', 'dags', 'in', 'a', 'markov', 'equivalence', 'class', 'our', 'approach', 'is', 'based', 'on', 'the', 'clique', 'tree', 'representation', 'of', 'chordal', 'graphs', 'we', 'show', 'that', 'in', 'the', 'case', 'of', 'bounded', 'degree', 'graphs', 'the', 'proposed', 'algorithm', 'is', 'polynomial', 'time', 'we', 'further', 'demonstrate', 'that', 'this', 'technique', 'can', 'be', 'utilized', 'for', 'uniform', 'sampling', 'from', 'a', 'markov', 'equivalence', 'class', 'which', 'provides', 'a', 'stochastic', 'way', 'to', 'enumerate', 'dags', 'in', 'the', 'equivalence', 'class', 'and', 'may', 'be', 'needed', 'for', 'finding', 'the', 'best', 'dag', 'or', 'for', 'causal', 'inference', 'given', 'the', 'equivalence', 'class', 'as', 'input', 'we', 'also', 'extend', 'our', 'counting', 'and', 'sampling', 'method', 'to', 'the', 'case', 'where', 'prior', 'knowledge', 'about', 'the', 'underlying', 'dag', 'is', 'available', 'and', 'present', 'applications', 'of', 'this', 'extension', 'in', 'causal', 'experiment', 'design', 'and', 'estimating', 'the', 'causal', 'effect', 'of', 'joint', 'interventions']] | [-0.0848063706705632, 0.07450474318446484, -0.06295950848793795, 0.1169786917062493, -0.18216934438316604, -0.11052592732599592, 0.08919950992132218, 0.4106297885814497, -0.31857278368169406, -0.34317294904135737, 0.0887599965522846, -0.2108393307976626, -0.16502110208783233, 0.14820246460537115, -0.10098124911425518, 0.06965912755018704, 0.10111407596651498, 0.09918969193565752, -0.015333852557641631, -0.24758862946688528, 0.32711268157639484, 0.021809814086704103, 0.2663833659736393, -0.002144848741171462, 0.11819457965913473, 0.05029274404745314, -0.028028529147860838, 0.07838267233088478, -0.12619600379410847, 0.15621768422676502, 0.2988797306378901, 0.24466266053904956, 0.26145105320972867, -0.38583665761387664, -0.1963473932465186, 0.18809649525294164, 0.09296380850968375, 0.12214125242233193, 0.03530383111200052, -0.2799078116365415, 0.08749218321791305, -0.14350199545603842, -0.031624540223043646, -0.05786691031309667, -0.00020324892305710295, -0.015498619211988675, -0.3233177564308773, 0.02284795407356321, 0.10892792132909636, 0.059391182436196656, 0.009602984551944443, -0.09334620547917176, 0.0016998725194433653, 0.10526734383880089, 0.004377746720156456, 0.039170320264823096, 0.052793536983380046, -0.11226474976603378, -0.17891822917479183, 0.33429266664677776, 0.0010543650022481342, -0.22285247344821524, 0.1494625616285883, -0.08872535930493393, -0.22233527024310115, 0.09019415153123371, 0.16421643209954104, 0.13383037558135888, -0.17638432987403757, 0.07973508333665663, -0.10268645160537851, 0.15358529615778108, 0.0327927789279587, 0.014250908825684944, 0.13581651792287835, 0.19244604584077155, 0.11375782770070096, 0.18590907499861173, -0.06156857002962817, -0.10038452592116219, -0.30531380782826795, -0.1598022173892713, -0.21099826494789775, 0.008234105944457287, -0.16911709901162525, -0.19308519762152018, 0.4007851447163334, 0.2306293400658949, 0.15789817935401187, 0.160304456966539, 0.257108129518996, 0.06317104971323945, 0.041429548268416175, 0.12930260466617272, 0.14007664403693565, 0.16166176915437253, 0.004327181831572775, -0.16317366549078174, 0.19536100265460912, 0.06821431159606856] |
1,802.0124 | Enhancing Multi-Class Classification of Random Forest using Random
Vector Functional Neural Network and Oblique Decision Surfaces | Both neural networks and decision trees are popular machine learning methods
and are widely used to solve problems from diverse domains. These two
classifiers are commonly used base classifiers in an ensemble framework. In
this paper, we first present a new variant of oblique decision tree based on a
linear classifier, then construct an ensemble classifier based on the fusion of
a fast neural network, random vector functional link network and oblique
decision trees. Random Vector Functional Link Network has an elegant closed
form solution with extremely short training time. The neural network partitions
each training bag (obtained using bagging) at the root level into C subsets
where C is the number of classes in the dataset and subsequently, C oblique
decision trees are trained on such partitions. The proposed method provides a
rich insight into the data by grouping the confusing or hard to classify
samples for each class and thus, provides an opportunity to employ fine-grained
classification rule over the data. The performance of the ensemble classifier
is evaluated on several multi-class datasets where it demonstrates a superior
performance compared to other state-of- the-art classifiers.
| cs.LG cs.CV stat.ML | both neural networks and decision trees are popular machine learning methods and are widely used to solve problems from diverse domains these two classifiers are commonly used base classifiers in an ensemble framework in this paper we first present a new variant of oblique decision tree based on a linear classifier then construct an ensemble classifier based on the fusion of a fast neural network random vector functional link network and oblique decision trees random vector functional link network has an elegant closed form solution with extremely short training time the neural network partitions each training bag obtained using bagging at the root level into c subsets where c is the number of classes in the dataset and subsequently c oblique decision trees are trained on such partitions the proposed method provides a rich insight into the data by grouping the confusing or hard to classify samples for each class and thus provides an opportunity to employ finegrained classification rule over the data the performance of the ensemble classifier is evaluated on several multiclass datasets where it demonstrates a superior performance compared to other stateof theart classifiers | [['both', 'neural', 'networks', 'and', 'decision', 'trees', 'are', 'popular', 'machine', 'learning', 'methods', 'and', 'are', 'widely', 'used', 'to', 'solve', 'problems', 'from', 'diverse', 'domains', 'these', 'two', 'classifiers', 'are', 'commonly', 'used', 'base', 'classifiers', 'in', 'an', 'ensemble', 'framework', 'in', 'this', 'paper', 'we', 'first', 'present', 'a', 'new', 'variant', 'of', 'oblique', 'decision', 'tree', 'based', 'on', 'a', 'linear', 'classifier', 'then', 'construct', 'an', 'ensemble', 'classifier', 'based', 'on', 'the', 'fusion', 'of', 'a', 'fast', 'neural', 'network', 'random', 'vector', 'functional', 'link', 'network', 'and', 'oblique', 'decision', 'trees', 'random', 'vector', 'functional', 'link', 'network', 'has', 'an', 'elegant', 'closed', 'form', 'solution', 'with', 'extremely', 'short', 'training', 'time', 'the', 'neural', 'network', 'partitions', 'each', 'training', 'bag', 'obtained', 'using', 'bagging', 'at', 'the', 'root', 'level', 'into', 'c', 'subsets', 'where', 'c', 'is', 'the', 'number', 'of', 'classes', 'in', 'the', 'dataset', 'and', 'subsequently', 'c', 'oblique', 'decision', 'trees', 'are', 'trained', 'on', 'such', 'partitions', 'the', 'proposed', 'method', 'provides', 'a', 'rich', 'insight', 'into', 'the', 'data', 'by', 'grouping', 'the', 'confusing', 'or', 'hard', 'to', 'classify', 'samples', 'for', 'each', 'class', 'and', 'thus', 'provides', 'an', 'opportunity', 'to', 'employ', 'finegrained', 'classification', 'rule', 'over', 'the', 'data', 'the', 'performance', 'of', 'the', 'ensemble', 'classifier', 'is', 'evaluated', 'on', 'several', 'multiclass', 'datasets', 'where', 'it', 'demonstrates', 'a', 'superior', 'performance', 'compared', 'to', 'other', 'stateof', 'theart', 'classifiers']] | [-0.05243564223282956, 0.016303807340455265, -0.06646149078593216, 0.09087655567850439, -0.12706034830995502, -0.20512749803785413, 0.0859685475398901, 0.44973739907942356, -0.2863590526319841, -0.27887544009422405, 0.08070064449177328, -0.2725065072729466, -0.17293488617144764, 0.20193568138627616, -0.07995532768564348, 0.10662349874532238, 0.13736630202007086, 0.11577834765162857, -0.017128811984816018, -0.32232037089506094, 0.32705505639513865, 0.03660724474425941, 0.3699912015089695, -0.049935070003437644, 0.13188944951342269, 0.00872878715107068, -0.020770606247429303, 0.02528016363024054, -0.04047336531703405, 0.1496043582907554, 0.31266517211424116, 0.2171192113359902, 0.32512423597689577, -0.3946699914447764, -0.18678815648915933, 0.10286144611057153, 0.12197825324076993, 0.09734741867375797, 0.012048926132228126, -0.31822071187098555, 0.0869902990936466, -0.15843404397831604, 0.020808707173156707, -0.13942089314786668, -0.03962485201004395, 0.008078828690583535, -0.3153438013704384, -0.026096163349933324, 0.046984525987589586, 0.056919743530972074, -0.04998544840027583, -0.17288166192673984, 0.015518597108038032, 0.10723154101007802, 0.005924415961405969, 0.08015411928371417, 0.09873103349404858, -0.13313732528685526, -0.17915952757728051, 0.33646596788757427, -0.0554536017215746, -0.22720854688287317, 0.22566203132239396, 0.01601694533003763, -0.16624387922537398, 0.11536024148292083, 0.27037378871205814, 0.11239745418097884, -0.19472323576944636, 0.00551095173941965, -0.06526691250952539, 0.138302042248614, 0.04730042875470484, -0.054134456645000106, 0.17339221966380683, 0.2801069814119149, 0.02030978002709979, 0.17888908904764234, -0.12885735467086262, -0.06047564506515821, -0.20824984216036643, -0.08723098797883022, -0.16606649080973696, -0.02951156271292883, -0.16731564655741565, -0.21121795840914995, 0.3762291797777927, 0.17235220275834243, 0.22403383827245332, 0.14419478014171283, 0.31186757890139033, 0.04364329093399851, 0.1011207597090534, 0.11769397864566448, 0.13019037907843523, 0.09354841268626365, 0.06187733768966089, -0.1264613410283657, 0.09913460327870148, 0.10527340932076866] |
1,802.01241 | Semantic projection: recovering human knowledge of multiple, distinct
object features from word embeddings | The words of a language reflect the structure of the human mind, allowing us
to transmit thoughts between individuals. However, language can represent only
a subset of our rich and detailed cognitive architecture. Here, we ask what
kinds of common knowledge (semantic memory) are captured by word meanings
(lexical semantics). We examine a prominent computational model that represents
words as vectors in a multidimensional space, such that proximity between
word-vectors approximates semantic relatedness. Because related words appear in
similar contexts, such spaces - called "word embeddings" - can be learned from
patterns of lexical co-occurrences in natural language. Despite their
popularity, a fundamental concern about word embeddings is that they appear to
be semantically "rigid": inter-word proximity captures only overall similarity,
yet human judgments about object similarities are highly context-dependent and
involve multiple, distinct semantic features. For example, dolphins and
alligators appear similar in size, but differ in intelligence and
aggressiveness. Could such context-dependent relationships be recovered from
word embeddings? To address this issue, we introduce a powerful, domain-general
solution: "semantic projection" of word-vectors onto lines that represent
various object features, like size (the line extending from the word "small" to
"big"), intelligence (from "dumb" to "smart"), or danger (from "safe" to
"dangerous"). This method, which is intuitively analogous to placing objects
"on a mental scale" between two extremes, recovers human judgments across a
range of object categories and properties. We thus show that word embeddings
inherit a wealth of common knowledge from word co-occurrence statistics and can
be flexibly manipulated to express context-dependent meanings.
| cs.CL | the words of a language reflect the structure of the human mind allowing us to transmit thoughts between individuals however language can represent only a subset of our rich and detailed cognitive architecture here we ask what kinds of common knowledge semantic memory are captured by word meanings lexical semantics we examine a prominent computational model that represents words as vectors in a multidimensional space such that proximity between wordvectors approximates semantic relatedness because related words appear in similar contexts such spaces called word embeddings can be learned from patterns of lexical cooccurrences in natural language despite their popularity a fundamental concern about word embeddings is that they appear to be semantically rigid interword proximity captures only overall similarity yet human judgments about object similarities are highly contextdependent and involve multiple distinct semantic features for example dolphins and alligators appear similar in size but differ in intelligence and aggressiveness could such contextdependent relationships be recovered from word embeddings to address this issue we introduce a powerful domaingeneral solution semantic projection of wordvectors onto lines that represent various object features like size the line extending from the word small to big intelligence from dumb to smart or danger from safe to dangerous this method which is intuitively analogous to placing objects on a mental scale between two extremes recovers human judgments across a range of object categories and properties we thus show that word embeddings inherit a wealth of common knowledge from word cooccurrence statistics and can be flexibly manipulated to express contextdependent meanings | [['the', 'words', 'of', 'a', 'language', 'reflect', 'the', 'structure', 'of', 'the', 'human', 'mind', 'allowing', 'us', 'to', 'transmit', 'thoughts', 'between', 'individuals', 'however', 'language', 'can', 'represent', 'only', 'a', 'subset', 'of', 'our', 'rich', 'and', 'detailed', 'cognitive', 'architecture', 'here', 'we', 'ask', 'what', 'kinds', 'of', 'common', 'knowledge', 'semantic', 'memory', 'are', 'captured', 'by', 'word', 'meanings', 'lexical', 'semantics', 'we', 'examine', 'a', 'prominent', 'computational', 'model', 'that', 'represents', 'words', 'as', 'vectors', 'in', 'a', 'multidimensional', 'space', 'such', 'that', 'proximity', 'between', 'wordvectors', 'approximates', 'semantic', 'relatedness', 'because', 'related', 'words', 'appear', 'in', 'similar', 'contexts', 'such', 'spaces', 'called', 'word', 'embeddings', 'can', 'be', 'learned', 'from', 'patterns', 'of', 'lexical', 'cooccurrences', 'in', 'natural', 'language', 'despite', 'their', 'popularity', 'a', 'fundamental', 'concern', 'about', 'word', 'embeddings', 'is', 'that', 'they', 'appear', 'to', 'be', 'semantically', 'rigid', 'interword', 'proximity', 'captures', 'only', 'overall', 'similarity', 'yet', 'human', 'judgments', 'about', 'object', 'similarities', 'are', 'highly', 'contextdependent', 'and', 'involve', 'multiple', 'distinct', 'semantic', 'features', 'for', 'example', 'dolphins', 'and', 'alligators', 'appear', 'similar', 'in', 'size', 'but', 'differ', 'in', 'intelligence', 'and', 'aggressiveness', 'could', 'such', 'contextdependent', 'relationships', 'be', 'recovered', 'from', 'word', 'embeddings', 'to', 'address', 'this', 'issue', 'we', 'introduce', 'a', 'powerful', 'domaingeneral', 'solution', 'semantic', 'projection', 'of', 'wordvectors', 'onto', 'lines', 'that', 'represent', 'various', 'object', 'features', 'like', 'size', 'the', 'line', 'extending', 'from', 'the', 'word', 'small', 'to', 'big', 'intelligence', 'from', 'dumb', 'to', 'smart', 'or', 'danger', 'from', 'safe', 'to', 'dangerous', 'this', 'method', 'which', 'is', 'intuitively', 'analogous', 'to', 'placing', 'objects', 'on', 'a', 'mental', 'scale', 'between', 'two', 'extremes', 'recovers', 'human', 'judgments', 'across', 'a', 'range', 'of', 'object', 'categories', 'and', 'properties', 'we', 'thus', 'show', 'that', 'word', 'embeddings', 'inherit', 'a', 'wealth', 'of', 'common', 'knowledge', 'from', 'word', 'cooccurrence', 'statistics', 'and', 'can', 'be', 'flexibly', 'manipulated', 'to', 'express', 'contextdependent', 'meanings']] | [-0.04053876832744757, 0.07986357440018937, -0.07324719901699277, 0.16773176015334365, -0.20927557186408352, -0.15342980181906438, 0.0700499183952897, 0.45180578831405865, -0.3520977446728105, -0.33381173589141183, -0.0019811173011216204, -0.3078548183945555, -0.18000850421173262, 0.1536445904082881, -0.18636007198790414, -0.009581539853815995, 0.09027366219772144, 0.10799937941400069, -0.04340936148923541, -0.19633390032686293, 0.34026702847294804, -0.020241454607226872, 0.2849105466545249, -0.02540976906357895, 0.10638940497902075, -0.05741021456300847, -0.06892656203403714, 0.01974781311525028, -0.035422324741519996, 0.20510439830555005, 0.3961523824984888, 0.2491866952540087, 0.3078578617506927, -0.40473633843459306, -0.21366938925348222, 0.08939953342298164, 0.14349167838707447, 0.10205180361536184, 0.014300265373007971, -0.38384668366236996, 0.08865680265201566, -0.17899169538462062, 0.023492051673764808, -0.1256008908385411, 0.03546049783564365, 0.008268168979113744, -0.17530728989564406, 0.023394620821197767, 0.1263236109479626, 0.08833325141948456, -0.03767720769835813, -0.0809847818676471, 0.0007975426976502474, 0.2206876738050524, 0.05640455855817501, 0.02357251937907662, 0.15634254929480246, -0.1688640335803881, -0.14228032226344386, 0.411392216038491, -0.0037609266601355065, -0.23368247565517705, 0.25203143438649556, -0.08138983112127919, -0.1473219543436749, 0.06658614426666486, 0.203814058233836, 0.03885918135924767, -0.15221026883620423, 0.02298348381286598, -0.08073332738445421, 0.2505654557866769, 0.153572518420997, 0.08027686795593048, 0.2779832928042327, 0.18807638273204838, -0.006863936953734429, 0.07740085093708272, -0.030288630319571692, -0.07803496560021785, -0.20564602297155135, -0.13872869428601078, -0.1692557025694802, 0.0017593219799603083, -0.12529099461382776, -0.1655843306244129, 0.37495422666515443, 0.2249960257635509, 0.22931947552835538, 0.07375195522047487, 0.24060272036992486, 0.002352047968463647, 0.12350343264240239, 0.06074610591721943, 0.09299763417913623, -0.0055100443423725665, 0.09131926933898488, -0.1298536362241037, 0.16686646223353732, 0.0792504110113008] |
1,802.01242 | Fast Approximations for Metric-TSP via Linear Programming | We develop faster approximation algorithms for Metric-TSP building on recent,
nearly linear time approximation schemes for the LP relaxation [Chekuri and
Quanrud, 2017]. We show that the LP solution can be sparsified via
cut-sparsification techniques such as those of Benczur and Karger [2015]. Given
a weighted graph $G$ with $m$ edges and $n$ vertices, and $\epsilon > 0$, our
randomized algorithm outputs with high probability a $(1+\epsilon)$-approximate
solution to the LP relaxation whose support has $\operatorname{O}(n \log n
/\epsilon^2)$ edges. The running time of the algorithm is
$\operatorname{\~O}(m/\epsilon^2)$. This can be generically used to speed up
algorithms that rely on the LP.
For Metric-TSP, we obtain the following concrete result. For a weighted graph
$G$ with $m$ edges and $n$ vertices, and $\epsilon > 0$, we describe an
algorithm that outputs with high probability a tour of $G$ with cost at most
$(1 + \epsilon) \frac{3}{2}$ times the minimum cost tour of $G$ in time
$\operatorname{\~O}(m/\epsilon^2 + n^{1.5}/\epsilon^3)$. Previous
implementations of Christofides' algorithm [Christofides, 1976] require, for a
$\frac{3}{2}$-optimal tour, $\operatorname{\~O}(n^{2.5})$ time when the metric
is explicitly given, or $\operatorname{\~O}(\min\{m^{1.5}, mn+n^{2.5}\})$ time
when the metric is given implicitly as the shortest path metric of a weighted
graph.
| cs.DS | we develop faster approximation algorithms for metrictsp building on recent nearly linear time approximation schemes for the lp relaxation chekuri and quanrud 2017 we show that the lp solution can be sparsified via cutsparsification techniques such as those of benczur and karger 2015 given a weighted graph g with m edges and n vertices and epsilon 0 our randomized algorithm outputs with high probability a 1epsilonapproximate solution to the lp relaxation whose support has operatornameon log n epsilon2 edges the running time of the algorithm is operatornameomepsilon2 this can be generically used to speed up algorithms that rely on the lp for metrictsp we obtain the following concrete result for a weighted graph g with m edges and n vertices and epsilon 0 we describe an algorithm that outputs with high probability a tour of g with cost at most 1 epsilon frac32 times the minimum cost tour of g in time operatornameomepsilon2 n15epsilon3 previous implementations of christofides algorithm christofides 1976 require for a frac32optimal tour operatornameon25 time when the metric is explicitly given or operatornameominm15 mnn25 time when the metric is given implicitly as the shortest path metric of a weighted graph | [['we', 'develop', 'faster', 'approximation', 'algorithms', 'for', 'metrictsp', 'building', 'on', 'recent', 'nearly', 'linear', 'time', 'approximation', 'schemes', 'for', 'the', 'lp', 'relaxation', 'chekuri', 'and', 'quanrud', '2017', 'we', 'show', 'that', 'the', 'lp', 'solution', 'can', 'be', 'sparsified', 'via', 'cutsparsification', 'techniques', 'such', 'as', 'those', 'of', 'benczur', 'and', 'karger', '2015', 'given', 'a', 'weighted', 'graph', 'g', 'with', 'm', 'edges', 'and', 'n', 'vertices', 'and', 'epsilon', '0', 'our', 'randomized', 'algorithm', 'outputs', 'with', 'high', 'probability', 'a', '1epsilonapproximate', 'solution', 'to', 'the', 'lp', 'relaxation', 'whose', 'support', 'has', 'operatornameon', 'log', 'n', 'epsilon2', 'edges', 'the', 'running', 'time', 'of', 'the', 'algorithm', 'is', 'operatornameomepsilon2', 'this', 'can', 'be', 'generically', 'used', 'to', 'speed', 'up', 'algorithms', 'that', 'rely', 'on', 'the', 'lp', 'for', 'metrictsp', 'we', 'obtain', 'the', 'following', 'concrete', 'result', 'for', 'a', 'weighted', 'graph', 'g', 'with', 'm', 'edges', 'and', 'n', 'vertices', 'and', 'epsilon', '0', 'we', 'describe', 'an', 'algorithm', 'that', 'outputs', 'with', 'high', 'probability', 'a', 'tour', 'of', 'g', 'with', 'cost', 'at', 'most', '1', 'epsilon', 'frac32', 'times', 'the', 'minimum', 'cost', 'tour', 'of', 'g', 'in', 'time', 'operatornameomepsilon2', 'n15epsilon3', 'previous', 'implementations', 'of', 'christofides', 'algorithm', 'christofides', '1976', 'require', 'for', 'a', 'frac32optimal', 'tour', 'operatornameon25', 'time', 'when', 'the', 'metric', 'is', 'explicitly', 'given', 'or', 'operatornameominm15', 'mnn25', 'time', 'when', 'the', 'metric', 'is', 'given', 'implicitly', 'as', 'the', 'shortest', 'path', 'metric', 'of', 'a', 'weighted', 'graph']] | [-0.14417072876147885, 0.072243001048095, -0.07731425294225089, 0.02380157910068545, -0.07660077975380941, -0.1721798143822883, 0.09119019721942583, 0.4055381643680011, -0.26947341985870765, -0.36846185084737715, 0.09654208756868773, -0.28640233865262216, -0.15168685455363792, 0.1549168525586831, -0.06946875954738976, 0.09977045762950626, 0.11413035354490489, 0.0681175989572142, -0.02759321174225541, -0.31669532785003196, 0.22986195237080623, 0.03966089892531923, 0.16248807980923258, 0.024550008929469444, 0.10984306729047513, 0.03629756086350729, 0.02471924489211352, 0.043929361170819387, -0.1679451692393517, 0.05729127356393232, 0.2573090607015406, 0.18918016092607476, 0.2921772601764873, -0.4141700664290883, -0.1429497834366283, 0.1556528572761581, 0.10328249717538393, 0.05642868792180155, 0.018102969900486085, -0.2231340429879524, 0.13205678604894364, -0.07035132837507242, -0.05432727572996719, -0.026123318221939147, 0.09928310847245768, 0.011358525800261688, -0.326601508027706, 0.010876936317740206, 0.08968419380692123, -0.04340718398277795, 0.0031923253503958874, -0.18894185022771603, 0.04005160197600356, 0.07777631971533436, -0.013236241464444585, 0.16065344894864683, 0.035393081562176264, -0.0633418378509235, -0.18824872404338203, 0.34498991475751, -0.10301137094696362, -0.15320401969543898, 0.12295484601626874, -0.08230695010371547, -0.12421934994044484, 0.12275818766914104, 0.1731533225577406, 0.2086141042747214, -0.05490734581686073, 0.15441357921567223, -0.058476661772166934, 0.14332035244149893, 0.10088087930700289, 0.013925544362861276, 0.05520997008251038, 0.15413335044588386, 0.2013306679112501, 0.07818338272538382, -0.019968584352910844, -0.017241516812129425, -0.2842296513682995, -0.15273691061375244, -0.2459921165270212, 0.055108075098852155, -0.195828119065909, -0.15093996152892464, 0.3580242554743678, 0.09911767690559554, 0.22457477037128204, 0.19126026304642277, 0.27419100642519817, 0.13622324909636996, 0.0128362969205272, 0.22812314924677132, 0.12812871615023255, 0.06993642927508781, 0.036889375719277424, -0.19249664615938958, 0.07278146414287245, 0.17720443905519495] |
1,802.01243 | A consensus opinion model based on the evolutionary game | We propose a consensus opinion model based on the evolutionary game. In our
model, both of the two connected agents receive a benefit if they have the same
opinion, otherwise they both pay a cost. Agents update their opinions by
comparing payoffs with neighbors. The opinion of an agent with higher payoff is
more likely to be imitated. We apply this model in scale-free networks with
tunable degree distribution. Interestingly, we find that there exists an
optimal ratio of cost to benefit, leading to the shortest consensus time.
Qualitative analysis is obtained by examining the evolution of the opinion
clusters. Moreover, we find that the consensus time decreases as the average
degree of the network increases, but increases with the noise introduced to
permit irrational choices. The dependence of the consensus time on the network
size is found to be a power-law form. For small or larger ratio of cost to
benefit, the consensus time decreases as the degree exponent increases.
However, for moderate ratio of cost to benefit, the consensus time increases
with the degree exponent. Our results may provide new insights into opinion
dynamics driven by the evolutionary game theory.
| physics.soc-ph | we propose a consensus opinion model based on the evolutionary game in our model both of the two connected agents receive a benefit if they have the same opinion otherwise they both pay a cost agents update their opinions by comparing payoffs with neighbors the opinion of an agent with higher payoff is more likely to be imitated we apply this model in scalefree networks with tunable degree distribution interestingly we find that there exists an optimal ratio of cost to benefit leading to the shortest consensus time qualitative analysis is obtained by examining the evolution of the opinion clusters moreover we find that the consensus time decreases as the average degree of the network increases but increases with the noise introduced to permit irrational choices the dependence of the consensus time on the network size is found to be a powerlaw form for small or larger ratio of cost to benefit the consensus time decreases as the degree exponent increases however for moderate ratio of cost to benefit the consensus time increases with the degree exponent our results may provide new insights into opinion dynamics driven by the evolutionary game theory | [['we', 'propose', 'a', 'consensus', 'opinion', 'model', 'based', 'on', 'the', 'evolutionary', 'game', 'in', 'our', 'model', 'both', 'of', 'the', 'two', 'connected', 'agents', 'receive', 'a', 'benefit', 'if', 'they', 'have', 'the', 'same', 'opinion', 'otherwise', 'they', 'both', 'pay', 'a', 'cost', 'agents', 'update', 'their', 'opinions', 'by', 'comparing', 'payoffs', 'with', 'neighbors', 'the', 'opinion', 'of', 'an', 'agent', 'with', 'higher', 'payoff', 'is', 'more', 'likely', 'to', 'be', 'imitated', 'we', 'apply', 'this', 'model', 'in', 'scalefree', 'networks', 'with', 'tunable', 'degree', 'distribution', 'interestingly', 'we', 'find', 'that', 'there', 'exists', 'an', 'optimal', 'ratio', 'of', 'cost', 'to', 'benefit', 'leading', 'to', 'the', 'shortest', 'consensus', 'time', 'qualitative', 'analysis', 'is', 'obtained', 'by', 'examining', 'the', 'evolution', 'of', 'the', 'opinion', 'clusters', 'moreover', 'we', 'find', 'that', 'the', 'consensus', 'time', 'decreases', 'as', 'the', 'average', 'degree', 'of', 'the', 'network', 'increases', 'but', 'increases', 'with', 'the', 'noise', 'introduced', 'to', 'permit', 'irrational', 'choices', 'the', 'dependence', 'of', 'the', 'consensus', 'time', 'on', 'the', 'network', 'size', 'is', 'found', 'to', 'be', 'a', 'powerlaw', 'form', 'for', 'small', 'or', 'larger', 'ratio', 'of', 'cost', 'to', 'benefit', 'the', 'consensus', 'time', 'decreases', 'as', 'the', 'degree', 'exponent', 'increases', 'however', 'for', 'moderate', 'ratio', 'of', 'cost', 'to', 'benefit', 'the', 'consensus', 'time', 'increases', 'with', 'the', 'degree', 'exponent', 'our', 'results', 'may', 'provide', 'new', 'insights', 'into', 'opinion', 'dynamics', 'driven', 'by', 'the', 'evolutionary', 'game', 'theory']] | [-0.1450937968602375, 0.10395797539861935, -0.09077084532085185, 0.049208665534630804, -0.07122505460150326, -0.17080316033874018, 0.12210856351218051, 0.4118626035633497, -0.2671462199662831, -0.3156324874544225, 0.06302410021210865, -0.27925973140615196, -0.15874424718276714, 0.0939829012932023, -0.062217550541390665, -0.01708231021135968, 0.06130928437657227, 0.08854726318910859, 0.012602851037324095, -0.33129479745790985, 0.2920819203876211, 0.08274601783826559, 0.26250091833450523, 0.02381332653597686, 0.09791310534516622, -0.0068701144846272655, -0.003012156734863917, 0.06966536155838791, -0.13528847772772679, 0.06606404115306456, 0.2368672832805411, 0.16673163071391173, 0.36667487373415497, -0.41707431384323473, -0.17075882014857294, 0.14079339555367673, 0.14210864187164893, 0.11551131730811903, -0.021791695079097433, -0.2526045089847078, 0.07732164133631159, -0.18195470259312665, -0.1300293954892974, -0.031094904279598268, 0.028319441800704226, 0.06362617302208189, -0.2814194345749759, 0.07484629874185582, 0.028562824285472743, 0.042727662235847674, -0.030795153810079984, -0.13480932769501427, -0.05470030325401846, 0.17868831262967433, 0.07503355447200495, 0.05049232458744276, 0.14389210690084533, -0.16155518065716024, -0.15877170629391912, 0.3599245033571303, -0.058052968733439535, -0.1836593011272877, 0.16046734599149204, -0.11408366415222797, -0.11290223528643158, 0.11970386674875044, 0.19469014311592522, 0.08124184835924098, -0.10081126516403553, -0.0045807229677545065, -0.021921816434769426, 0.24459758753558467, 0.006275533276493661, 0.04360983384079494, 0.1563256303415983, 0.19981177593096314, 0.1460854014646126, 0.10965478159414488, -0.01321895194814715, -0.1849653627432417, -0.18599903788708616, -0.10513476627966156, -0.18232873789929727, 0.05323717029326266, -0.18192110469196146, -0.11561378190526739, 0.38177448819502996, 0.16608608641339137, 0.2156000032943363, 0.1652093850862002, 0.25255195782240963, 0.14922183801536448, 0.04823354447701907, 0.10575411560663876, 0.24337571962193275, 0.04120672042942412, 0.11349512171485306, -0.2285953431649735, 0.17802827872643925, 0.002753858990521015] |
1,802.01244 | Some identities involving special numbers and moments of random
variables | In this paper, we derive some identities involving special numbers and
moments of random variables by using the generating functions of the moments of
certain random variables. Here the related special numbers are Stirling numbers
of the first and second kinds, degenerate Stirling numbers of the first and
second kinds, derangement numbers, higher-order Bernoulli numbers and Bernoulli
numbers of the second kind.
| math.NT | in this paper we derive some identities involving special numbers and moments of random variables by using the generating functions of the moments of certain random variables here the related special numbers are stirling numbers of the first and second kinds degenerate stirling numbers of the first and second kinds derangement numbers higherorder bernoulli numbers and bernoulli numbers of the second kind | [['in', 'this', 'paper', 'we', 'derive', 'some', 'identities', 'involving', 'special', 'numbers', 'and', 'moments', 'of', 'random', 'variables', 'by', 'using', 'the', 'generating', 'functions', 'of', 'the', 'moments', 'of', 'certain', 'random', 'variables', 'here', 'the', 'related', 'special', 'numbers', 'are', 'stirling', 'numbers', 'of', 'the', 'first', 'and', 'second', 'kinds', 'degenerate', 'stirling', 'numbers', 'of', 'the', 'first', 'and', 'second', 'kinds', 'derangement', 'numbers', 'higherorder', 'bernoulli', 'numbers', 'and', 'bernoulli', 'numbers', 'of', 'the', 'second', 'kind']] | [-0.25148651205123435, 0.2379080306648487, 0.019737234819800623, 0.10545684964088123, -0.10412328158535304, -0.039921052513584014, 0.08101970726631642, 0.20692589848993287, -0.3023519973202999, -0.3100483511244097, 0.07510699013120405, -0.2527082055401538, -0.19960921792493713, 0.2223940113476748, -0.022039694944396615, 0.06159726366580975, -0.03351759467078673, 0.09516740127676918, -0.0354904466789336, -0.281343060485538, 0.41706432888825096, -0.07632975412472602, 0.17506355626298295, -0.0687706526669283, 0.08721967592775341, -0.0063058725978818635, -0.042961876516440706, -0.007935204933727942, -0.1110231421001616, 0.1279349648243477, 0.17595124073071225, 0.08210291039018382, 0.2994688399466536, -0.4217381631775248, -0.03817765423727612, 0.18519973383855917, 0.0498323189019556, 0.04363514718809916, -0.00913225666379496, -0.2420803127855423, 0.03093103764601232, -0.16952407606426748, -0.15825717088826483, -0.15587264514197746, 0.00811816368161911, 0.29223693316171484, -0.30934612176591353, 0.10294507514505137, 0.07524703130606682, 0.08404455816132887, 0.05925372163314493, -0.22542810894458765, 0.03778929517964923, 0.10718695399531673, 0.061715424090864196, -0.12963680354427667, -0.037503232616150094, -0.13751162291737273, -0.1885732730790492, 0.40028362239020004, 0.057108226382443984, -0.23663277869984026, 0.06651402631353948, -0.22069471273120614, -0.3151484628042747, 0.07577273221461163, 0.172297170505889, 0.21876155119389296, -0.08559129008602712, -0.034205311852987974, -0.09220510773781326, 0.0911476845822988, 0.2211789586055543, 0.039285905358772126, 0.14291489166357824, -0.030546099247951663, -0.05557747045531869, 0.2673958451637337, -0.08072267100214958, -0.1383131653851559, -0.3851404614265888, -0.23011789552026218, -0.2666925772904388, 0.05056937989748774, -0.12615979709117975, -0.17712285287017304, 0.3904004819811352, 0.11439323287096716, 0.1577795421434266, 0.12569391455561404, 0.25226447532974905, 0.19404888153076172, -0.005575860054382394, -0.03681053700969524, 0.0503155523559056, 0.29365680249963677, 0.11183918519095788, -0.05948950844251686, 0.04769481873635443, 0.21838120721100318] |
1,802.01245 | On singular value distribution of large dimensional data matrices whose
columns have different correlations | Suppose $\mathbf Y_n=(\mathbf y_1,\cdots,\mathbf y_n)$ is a $p\times n$ data
matrix whose columns $\mathbf y_j, 1\leq j\leq n$ have different correlations.
The asymptotic spectral property of $\mathbf S_n=\frac1n\mathbf Y_n\mathbf
Y^*_n$ when $p$ increase with $n$ has been considered by some authors recently.
This model has known an increasing popularity due to its widely applications in
multi-user multiple-input single-output (MISO) systems and robust signal
processing. In this paper, for more convenient applications in practice, we
will investigate the spectral distribution of $\mathbf S_n$ under milder moment
conditions than existing work. We also discuss a potential application in
sample classification.
| math.ST math.PR stat.TH | suppose mathbf y_nmathbf y_1cdotsmathbf y_n is a ptimes n data matrix whose columns mathbf y_j 1leq jleq n have different correlations the asymptotic spectral property of mathbf s_nfrac1nmathbf y_nmathbf y_n when p increase with n has been considered by some authors recently this model has known an increasing popularity due to its widely applications in multiuser multipleinput singleoutput miso systems and robust signal processing in this paper for more convenient applications in practice we will investigate the spectral distribution of mathbf s_n under milder moment conditions than existing work we also discuss a potential application in sample classification | [['suppose', 'mathbf', 'y_nmathbf', 'y_1cdotsmathbf', 'y_n', 'is', 'a', 'ptimes', 'n', 'data', 'matrix', 'whose', 'columns', 'mathbf', 'y_j', '1leq', 'jleq', 'n', 'have', 'different', 'correlations', 'the', 'asymptotic', 'spectral', 'property', 'of', 'mathbf', 's_nfrac1nmathbf', 'y_nmathbf', 'y_n', 'when', 'p', 'increase', 'with', 'n', 'has', 'been', 'considered', 'by', 'some', 'authors', 'recently', 'this', 'model', 'has', 'known', 'an', 'increasing', 'popularity', 'due', 'to', 'its', 'widely', 'applications', 'in', 'multiuser', 'multipleinput', 'singleoutput', 'miso', 'systems', 'and', 'robust', 'signal', 'processing', 'in', 'this', 'paper', 'for', 'more', 'convenient', 'applications', 'in', 'practice', 'we', 'will', 'investigate', 'the', 'spectral', 'distribution', 'of', 'mathbf', 's_n', 'under', 'milder', 'moment', 'conditions', 'than', 'existing', 'work', 'we', 'also', 'discuss', 'a', 'potential', 'application', 'in', 'sample', 'classification']] | [-0.18507926976524255, 0.09130230893218319, -0.009642843903551242, -0.009327443562611247, -0.03563316643823745, -0.20106148591610729, -0.04313233240025079, 0.39863536100757796, -0.2501512071665031, -0.189866328650375, 0.10084516323680423, -0.31316656602028103, -0.1560927068060936, 0.11579432968079045, -0.13224348705261946, 0.09930467640575424, 0.014621406368738444, 0.080105610062205, -0.09353860229080946, -0.26759565638416666, 0.27241544532061546, 0.00867750319969101, 0.3093501271262342, -0.015306202937805661, 0.0393871358288548, 0.026007805526083737, 0.02517299481773192, -0.07693092958982457, -0.15788724064615736, 0.057009289989286324, 0.32095855781712485, 0.17565022571463637, 0.3073100359419111, -0.3729254403579878, -0.1980802563796799, 0.2514253567973843, 0.25085835726259603, -0.03008099034735837, -0.07063101804242157, -0.2602847635016306, 0.1486718737251442, -0.2062644553706818, -0.11383876304823867, -0.047579152007904094, 0.11420162109005236, 0.03468723717078413, -0.38741866744017783, 0.032758719966802075, 0.09726597453208313, 0.09410053517515819, 0.022073891072668442, -0.2436541022118373, 0.05892805649044434, 0.04325265111791728, 0.058680621836305666, 0.0413657455877929, 0.029768378003356383, -0.05104291129895707, -0.05129385757447249, 0.35343351368744347, -0.0207542111245332, -0.22266684230609038, 0.11133982303081867, -0.16493663847801687, -0.19442596566892162, 0.08402559831354421, 0.19703372860250554, 0.14142677639179008, -0.15772082266645607, 0.19995700402758995, -0.07837069100825135, 0.14530797948407911, 0.062393930236588124, 0.09838164615992111, 0.10269956610684004, 0.11311447626872699, 0.0912925440784467, 0.12143999138443741, -0.06226661406486228, -0.029059984601227586, -0.2314308749550243, -0.13059767753308274, -0.24155766533726117, 0.12336980217357271, -0.13155276209254602, -0.07823919531764444, 0.30141315319258527, 0.15205200699628474, 0.19551112880413035, 0.07855067594629742, 0.27242632254420485, 0.10410276713982686, 0.015306850808874234, 0.08118864743173429, 0.08210434123889312, 0.20329806076353127, 0.108566358704696, -0.14820080000628746, 0.0762642085091355, 0.01683788716351402] |
1,802.01246 | Traffic-driven epidemic spreading on scale-free networks with tunable
degree distribution | We study the traffic-driven epidemic spreading on scale-free networks with
tunable degree distribution. The heterogeneity of networks is controlled by the
exponent $\gamma$ of power-law degree distribution. It is found that the
epidemic threshold is minimized at about $\gamma=2.2$. Moreover, we find that
nodes with larger algorithmic betweenness are more likely to be infected. We
expect our work to provide new insights into the effect of network structures
on traffic-driven epidemic spreading.
| physics.soc-ph | we study the trafficdriven epidemic spreading on scalefree networks with tunable degree distribution the heterogeneity of networks is controlled by the exponent gamma of powerlaw degree distribution it is found that the epidemic threshold is minimized at about gamma22 moreover we find that nodes with larger algorithmic betweenness are more likely to be infected we expect our work to provide new insights into the effect of network structures on trafficdriven epidemic spreading | [['we', 'study', 'the', 'trafficdriven', 'epidemic', 'spreading', 'on', 'scalefree', 'networks', 'with', 'tunable', 'degree', 'distribution', 'the', 'heterogeneity', 'of', 'networks', 'is', 'controlled', 'by', 'the', 'exponent', 'gamma', 'of', 'powerlaw', 'degree', 'distribution', 'it', 'is', 'found', 'that', 'the', 'epidemic', 'threshold', 'is', 'minimized', 'at', 'about', 'gamma22', 'moreover', 'we', 'find', 'that', 'nodes', 'with', 'larger', 'algorithmic', 'betweenness', 'are', 'more', 'likely', 'to', 'be', 'infected', 'we', 'expect', 'our', 'work', 'to', 'provide', 'new', 'insights', 'into', 'the', 'effect', 'of', 'network', 'structures', 'on', 'trafficdriven', 'epidemic', 'spreading']] | [-0.14113505744899157, 0.13923605744882175, -0.11039417033316568, 0.09598350961944864, -0.060661887346618135, -0.1945138325035158, 0.08566403765386592, 0.4137498512864113, -0.23909785669659162, -0.2582879398121602, 0.03761295745951227, -0.3134448380054285, -0.26537440571054405, 0.14153664026202428, -0.02241046588298761, -0.0011441337539710933, 0.04877479591070571, 0.030347672230062826, 0.08318233024328947, -0.2841123891994357, 0.36153740434545195, 0.10066497380871119, 0.2815262746428036, 0.10268406635279664, 0.022631950268987566, -0.01991185459256586, 0.004917243392103248, 0.03920943477391524, -0.21069274707669036, 0.09325927142829944, 0.22449364552934034, 0.1326716625286887, 0.28670719263350797, -0.3845129027290063, -0.2918750524549978, 0.1575500775167408, 0.1854551002422037, 0.11998281113725777, 0.05335536334536704, -0.2831629513206685, 0.13228659254248973, -0.16983406960732988, -0.15940378392244586, -0.006867857624052299, 0.03618531740115335, 0.03957590685523529, -0.25346867652196026, 0.08560116995876241, 0.006461115424624748, 0.07085320024958087, 0.065533549815882, -0.1187934964351977, -0.08188163330325754, 0.13286902914599827, 0.014891137372210829, 0.0011464061584168423, 0.1661889210744347, -0.13885588386458242, -0.11176283059952159, 0.29068197118532324, 0.0248347879646139, -0.15268354339463663, 0.11251184578415835, -0.14214622603806978, -0.13015962977402118, 0.14347449356379607, 0.2759667783522875, 0.050176642291868724, -0.143599506719814, -0.06520147981225616, -0.02628390635881159, 0.1839891635706105, 0.04230782886992933, 0.01256426737139312, 0.10449442277119185, 0.26283804622168344, 0.14877928411846775, 0.12532733859552536, -0.06716801229534515, -0.12308987407272474, -0.19928372631936023, -0.060766022083246045, -0.1994367739146886, 0.12810701676223996, -0.20046882007995415, -0.14050653039400154, 0.4393836746328614, 0.1777681659700142, 0.188297861850717, 0.14744784425905286, 0.19824730589364967, 0.0971497583749523, 0.04290919972279678, 0.1455528043831388, 0.1862554171950453, 0.08212008594030824, 0.08138140051030657, -0.18857864918795209, 0.2316237395651923, -0.03398251415233568] |
1,802.01247 | Are there really conformal frames? Uniqueness of affine inflation | Here we concisely review the nonminimal coupling dynamics of a single scalar
field in the context of purely affine gravity and extend the study to
multifield dynamics. The coupling is performed via an affine connection and its
associated curvature without referring to any metric tensor. The latter arises
a posteriori and it may gain an emergent character like the scale of gravity.
What is remarkable in affine gravity is the transition from nonminimal to
minimal couplings which is realized by only field redefinition of the scalar
fields. Consequently, the inflationary models gain a unique description in this
context where the observed parameters, like the scalar tilt and the
tensor-to-scalar ratio, are invariant under field reparametrization. Overall,
gravity in its affine approach is expected to reveal interesting and rich
phenomenology in cosmology and astroparticle physics.
| gr-qc astro-ph.HE hep-ph hep-th | here we concisely review the nonminimal coupling dynamics of a single scalar field in the context of purely affine gravity and extend the study to multifield dynamics the coupling is performed via an affine connection and its associated curvature without referring to any metric tensor the latter arises a posteriori and it may gain an emergent character like the scale of gravity what is remarkable in affine gravity is the transition from nonminimal to minimal couplings which is realized by only field redefinition of the scalar fields consequently the inflationary models gain a unique description in this context where the observed parameters like the scalar tilt and the tensortoscalar ratio are invariant under field reparametrization overall gravity in its affine approach is expected to reveal interesting and rich phenomenology in cosmology and astroparticle physics | [['here', 'we', 'concisely', 'review', 'the', 'nonminimal', 'coupling', 'dynamics', 'of', 'a', 'single', 'scalar', 'field', 'in', 'the', 'context', 'of', 'purely', 'affine', 'gravity', 'and', 'extend', 'the', 'study', 'to', 'multifield', 'dynamics', 'the', 'coupling', 'is', 'performed', 'via', 'an', 'affine', 'connection', 'and', 'its', 'associated', 'curvature', 'without', 'referring', 'to', 'any', 'metric', 'tensor', 'the', 'latter', 'arises', 'a', 'posteriori', 'and', 'it', 'may', 'gain', 'an', 'emergent', 'character', 'like', 'the', 'scale', 'of', 'gravity', 'what', 'is', 'remarkable', 'in', 'affine', 'gravity', 'is', 'the', 'transition', 'from', 'nonminimal', 'to', 'minimal', 'couplings', 'which', 'is', 'realized', 'by', 'only', 'field', 'redefinition', 'of', 'the', 'scalar', 'fields', 'consequently', 'the', 'inflationary', 'models', 'gain', 'a', 'unique', 'description', 'in', 'this', 'context', 'where', 'the', 'observed', 'parameters', 'like', 'the', 'scalar', 'tilt', 'and', 'the', 'tensortoscalar', 'ratio', 'are', 'invariant', 'under', 'field', 'reparametrization', 'overall', 'gravity', 'in', 'its', 'affine', 'approach', 'is', 'expected', 'to', 'reveal', 'interesting', 'and', 'rich', 'phenomenology', 'in', 'cosmology', 'and', 'astroparticle', 'physics']] | [-0.16691296230028593, 0.15382531046916892, -0.09209463456228598, 0.09994433482816971, -0.14555074422231026, -0.17814162122989213, -0.05397623043972999, 0.3066586849745363, -0.2838982554993578, -0.29636749825370845, 0.06176916438497172, -0.2162558903114926, -0.19243033891613248, 0.1367922883755319, -0.049248903211373, -0.009699889011298821, -0.01801258573350288, 0.08725022577242787, -0.07355007853136579, -0.21317703326148243, 0.34495596807109496, 0.10663149690033118, 0.25549575304890526, 0.039151770654812096, 0.10017880130419768, -0.04778652421351689, 0.004032449616091465, 0.03747372529747437, -0.14172920131180158, 0.08390900474597714, 0.1899359501830579, 0.1028294892383934, 0.2043905778572575, -0.375374144207297, -0.24972257387838256, 0.1253553227184396, 0.11008636883995149, 0.10855457940010298, -0.048987359330648864, -0.301142930734291, -0.007512515587141432, -0.14733519064568318, -0.1149959182088722, -0.08609178723809101, -0.010358718082260118, -0.09097235636445068, -0.26254706386018045, 0.061771076016211464, 0.013309188333944654, 0.054958662184983936, -0.03467855276713676, -0.04567927831728289, -0.03555328004694641, 0.05995877685178238, 0.11258669807957902, 0.06970732953614875, 0.13036223885311343, -0.2031155498090214, -0.0980922131262261, 0.42537405195910094, -0.14266612233095385, -0.21878986908539907, 0.14454598805116517, -0.14687545486003048, -0.12907886394619275, 0.08911730706650041, 0.15679452764982385, 0.08739948143779452, -0.13235008749249044, 0.21160109960838958, 0.01573120997940649, 0.12866513847387326, 0.040101683278109375, 0.05624422013982019, 0.287287847952111, 0.12549396233855567, 0.018829677386014765, 0.11430222239804023, -0.013564108824444268, -0.15077073263254628, -0.37779402520173966, -0.15859126743214177, -0.1273306136535578, 0.09100788116885988, -0.14917730295673576, -0.16007735662217906, 0.41532940967981496, 0.14895350238353486, 0.14949133339683585, 0.03868973733589692, 0.24392956597973772, 0.09496338776688078, 0.069710838804786, 0.017256503542468174, 0.3273188262837313, 0.1807869069691775, 0.09151102367826779, -0.245656061550922, -0.012861395511887412, 0.04031914160517392] |
1,802.01248 | $^{235}$U(n, f) Independent Fission Product Yield and Isomeric Ratio
Calculated with the Statistical Hauser-Feshbach Theory | We have developed a Hauser-Feshbach fission fragment decay model, HF$^3$D,
which can be applied to the statistical decay of more than 500 primary fission
fragment pairs (1,000 nuclides) produced by the neutron induced fission of
$^{235}$U. The fission fragment yield $Y(A)$ and the total kinetic energy TKE
are model inputs, and we estimate them from available experimental data for the
$^{235}$U(n$\rm_{th}$,f) system. The model parameters in the statistical decay
calculation are adjusted to reproduce some fission observables, such as the
neutron emission multiplicity $\overline{\nu}$, its distribution $P(\nu)$, and
the mass dependence $\overline\nu(A)$. The calculated fission product yield and
isomeric ratio are compared with experimental data. We show that the calculated
independent fission product yield $Y_I(A)$ at the thermal energy reproduces the
experimental data well, while the calculated isomeric ratios tend to be lower
than the Madland-England model prediction. The model is extended to higher
incident neutron energies up to the second chance fission threshold. We
demonstrate for the first time that most of the isomeric ratios stay constant,
although the production of isomeric state itself changes as the incident energy
increases.
| nucl-th | we have developed a hauserfeshbach fission fragment decay model hf3d which can be applied to the statistical decay of more than 500 primary fission fragment pairs 1000 nuclides produced by the neutron induced fission of 235u the fission fragment yield ya and the total kinetic energy tke are model inputs and we estimate them from available experimental data for the 235unrm_thf system the model parameters in the statistical decay calculation are adjusted to reproduce some fission observables such as the neutron emission multiplicity overlinenu its distribution pnu and the mass dependence overlinenua the calculated fission product yield and isomeric ratio are compared with experimental data we show that the calculated independent fission product yield y_ia at the thermal energy reproduces the experimental data well while the calculated isomeric ratios tend to be lower than the madlandengland model prediction the model is extended to higher incident neutron energies up to the second chance fission threshold we demonstrate for the first time that most of the isomeric ratios stay constant although the production of isomeric state itself changes as the incident energy increases | [['we', 'have', 'developed', 'a', 'hauserfeshbach', 'fission', 'fragment', 'decay', 'model', 'hf3d', 'which', 'can', 'be', 'applied', 'to', 'the', 'statistical', 'decay', 'of', 'more', 'than', '500', 'primary', 'fission', 'fragment', 'pairs', '1000', 'nuclides', 'produced', 'by', 'the', 'neutron', 'induced', 'fission', 'of', '235u', 'the', 'fission', 'fragment', 'yield', 'ya', 'and', 'the', 'total', 'kinetic', 'energy', 'tke', 'are', 'model', 'inputs', 'and', 'we', 'estimate', 'them', 'from', 'available', 'experimental', 'data', 'for', 'the', '235unrm_thf', 'system', 'the', 'model', 'parameters', 'in', 'the', 'statistical', 'decay', 'calculation', 'are', 'adjusted', 'to', 'reproduce', 'some', 'fission', 'observables', 'such', 'as', 'the', 'neutron', 'emission', 'multiplicity', 'overlinenu', 'its', 'distribution', 'pnu', 'and', 'the', 'mass', 'dependence', 'overlinenua', 'the', 'calculated', 'fission', 'product', 'yield', 'and', 'isomeric', 'ratio', 'are', 'compared', 'with', 'experimental', 'data', 'we', 'show', 'that', 'the', 'calculated', 'independent', 'fission', 'product', 'yield', 'y_ia', 'at', 'the', 'thermal', 'energy', 'reproduces', 'the', 'experimental', 'data', 'well', 'while', 'the', 'calculated', 'isomeric', 'ratios', 'tend', 'to', 'be', 'lower', 'than', 'the', 'madlandengland', 'model', 'prediction', 'the', 'model', 'is', 'extended', 'to', 'higher', 'incident', 'neutron', 'energies', 'up', 'to', 'the', 'second', 'chance', 'fission', 'threshold', 'we', 'demonstrate', 'for', 'the', 'first', 'time', 'that', 'most', 'of', 'the', 'isomeric', 'ratios', 'stay', 'constant', 'although', 'the', 'production', 'of', 'isomeric', 'state', 'itself', 'changes', 'as', 'the', 'incident', 'energy', 'increases']] | [0.0018379676985205151, 0.21160349922402846, -0.09104530146710617, 0.16516642441340743, 0.014999509312805127, -0.08701672596560622, 0.02536267233319284, 0.35912530788813124, -0.22519672829499046, -0.34638586021240125, -0.009581894508631773, -0.3339769529305737, 0.059059617936203394, 0.1936719373268054, 0.05579802455560474, 0.0763802876334177, 0.11515290724425788, 0.0979388901627813, -0.050333918785327114, -0.16741436146482805, 0.26216284979124216, 0.14033566698939962, 0.2576409139158138, 0.08961533309775405, 0.027716453599251425, -0.03245880946368826, 0.020196045639419357, -0.07737598918505352, -0.166183678372859, 0.0933248551204997, 0.23631822802549737, 0.11346815367633925, 0.12430985882581974, -0.3929484592306174, -0.16272457188990136, 0.15818544703969648, 0.12594728615261952, 0.11040592064289906, -0.05152104841718855, -0.2504627510048026, 0.08737945296507571, -0.27367143919268117, -0.0860784744906017, -0.07239427232045935, 0.025576290552800692, 0.07039270781222678, -0.272033965871246, 0.09163207013096492, -0.030301269803616873, 0.00547124547698662, -0.14960053542017704, -0.2508664771045336, -0.0905081127249022, 0.07071727241220122, 0.12342668737917185, 0.01554806485232389, 0.23510409691318107, -0.05923871002795005, -0.09363496333720502, 0.3770125412424518, -0.03524382194237577, -0.11398581116439098, 0.0800041307547045, -0.1700731835563519, -0.11937862073566728, 0.23871755859793417, 0.12043801116868219, 0.13279408157342748, -0.1233057619339723, -0.025625760276770135, 0.026225531029260972, 0.199834615350648, 0.09576851446763612, 0.028903917982295916, 0.16999187304860575, 0.17993446713411354, -0.025334575577289797, 0.09883984282946172, -0.14652435044875098, -0.12997134351594883, -0.3063576669797344, -0.11395020712503041, -0.11351788854319073, 0.03705850411841476, -0.04138743589547547, -0.10130230826987165, 0.37595300940368115, 0.07586896449951878, 0.2083782995521853, 0.06822816174628149, 0.28423506528700027, 0.14835116418411912, 0.0933197345611089, 0.03481570235982707, 0.2950394703004184, 0.1711750138400186, 0.06924009604236661, -0.27300569291087, 0.1499239138607994, -0.020732625099216504] |
1,802.01249 | On Uniform Connectivity of Algebraic Matrix Sets | In this document we study the uniform local path connectivity of sets of
$m$-tuples of pairwise commuting normal matrices with some additional
constraints.
More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in
${M_n(\mathbb{C})}^m$ induced by the operator norm $\|\cdot\|$, any collection
of $r$ non-constant multivariable polynomials
$p_1(x_1,\ldots,x_m),\ldots,p_r(x_1,\ldots,x_m)$ over $\mathbb{C}$ with finite
zero set $\mathbf{Z}(p_1,\ldots,p_r)\subset \mathbb{C}^m$, and any $m$-tuple
$\mathbf{X}=(X_1,\ldots,X_m)$ in the set
$\mathbb{ZD}_n^m(p_1,\ldots,p_r)\subseteq M_n^m(\mathbb{C})$, of pairwise
commuting normal matrix contractions such that, $\|p_j(Y_1,\ldots,Y_m)\|=0$ for
each $(Y_1,\ldots,Y_m)\in \mathbb{ZD}_n^m(p_1,\ldots,p_r)$ and each $1\leq
j\leq r$. We prove the existence of paths between arbitrary $m$-tuples, that
lie in the intersection of $\mathbb{ZD}_n^m(p_1,\ldots,p_r)$, and the
$\delta$-ball $B_\eth(\mathbf{X},\delta)$ centered at $\mathbf{X}$ for some
$\delta>0$, with respect to $\eth$.
Two of the key features of these matrix paths is that $\delta$ can be chosen
independent of $n$, and that they are contained in the intersection of
$B_\eth(\mathbf{X},\varepsilon)$ and $\mathbb{ZD}_n^m(p_1,\ldots,p_r)$.
Some connections with the approximation theory for matrix functions of
several matrix variables, are studied as well.
| math.NA math.OA | in this document we study the uniform local path connectivity of sets of mtuples of pairwise commuting normal matrices with some additional constraints more specifically given given varepsilon0 a fixed metric eth in m_nmathbbcm induced by the operator norm cdot any collection of r nonconstant multivariable polynomials p_1x_1ldotsx_mldotsp_rx_1ldotsx_m over mathbbc with finite zero set mathbfzp_1ldotsp_rsubset mathbbcm and any mtuple mathbfxx_1ldotsx_m in the set mathbbzd_nmp_1ldotsp_rsubseteq m_nmmathbbc of pairwise commuting normal matrix contractions such that p_jy_1ldotsy_m0 for each y_1ldotsy_min mathbbzd_nmp_1ldotsp_r and each 1leq jleq r we prove the existence of paths between arbitrary mtuples that lie in the intersection of mathbbzd_nmp_1ldotsp_r and the deltaball b_ethmathbfxdelta centered at mathbfx for some delta0 with respect to eth two of the key features of these matrix paths is that delta can be chosen independent of n and that they are contained in the intersection of b_ethmathbfxvarepsilon and mathbbzd_nmp_1ldotsp_r some connections with the approximation theory for matrix functions of several matrix variables are studied as well | [['in', 'this', 'document', 'we', 'study', 'the', 'uniform', 'local', 'path', 'connectivity', 'of', 'sets', 'of', 'mtuples', 'of', 'pairwise', 'commuting', 'normal', 'matrices', 'with', 'some', 'additional', 'constraints', 'more', 'specifically', 'given', 'given', 'varepsilon0', 'a', 'fixed', 'metric', 'eth', 'in', 'm_nmathbbcm', 'induced', 'by', 'the', 'operator', 'norm', 'cdot', 'any', 'collection', 'of', 'r', 'nonconstant', 'multivariable', 'polynomials', 'p_1x_1ldotsx_mldotsp_rx_1ldotsx_m', 'over', 'mathbbc', 'with', 'finite', 'zero', 'set', 'mathbfzp_1ldotsp_rsubset', 'mathbbcm', 'and', 'any', 'mtuple', 'mathbfxx_1ldotsx_m', 'in', 'the', 'set', 'mathbbzd_nmp_1ldotsp_rsubseteq', 'm_nmmathbbc', 'of', 'pairwise', 'commuting', 'normal', 'matrix', 'contractions', 'such', 'that', 'p_jy_1ldotsy_m0', 'for', 'each', 'y_1ldotsy_min', 'mathbbzd_nmp_1ldotsp_r', 'and', 'each', '1leq', 'jleq', 'r', 'we', 'prove', 'the', 'existence', 'of', 'paths', 'between', 'arbitrary', 'mtuples', 'that', 'lie', 'in', 'the', 'intersection', 'of', 'mathbbzd_nmp_1ldotsp_r', 'and', 'the', 'deltaball', 'b_ethmathbfxdelta', 'centered', 'at', 'mathbfx', 'for', 'some', 'delta0', 'with', 'respect', 'to', 'eth', 'two', 'of', 'the', 'key', 'features', 'of', 'these', 'matrix', 'paths', 'is', 'that', 'delta', 'can', 'be', 'chosen', 'independent', 'of', 'n', 'and', 'that', 'they', 'are', 'contained', 'in', 'the', 'intersection', 'of', 'b_ethmathbfxvarepsilon', 'and', 'mathbbzd_nmp_1ldotsp_r', 'some', 'connections', 'with', 'the', 'approximation', 'theory', 'for', 'matrix', 'functions', 'of', 'several', 'matrix', 'variables', 'are', 'studied', 'as', 'well']] | [-0.19208417519849413, 0.1520443176353971, -0.022794859395556463, 0.01027620238251984, -0.017130344983500738, -0.1524439096854379, 0.021121686205733566, 0.36120188639188805, -0.30688151142249503, -0.20108258972604137, 0.08840785781775291, -0.32890490899483366, -0.136842886164474, 0.1423665996423612, -0.05098991728387773, 0.052401041928678754, 0.04753045259664456, 0.10737330200150609, -0.12745962228703622, -0.27425349537283183, 0.3674712647079529, -0.07125400613993406, 0.1665715737082064, 0.01974171936196702, 0.11258084904712935, 0.040532760828112566, -0.021900979693358143, 0.030525970309972762, -0.12120128162923113, 0.11367002801348766, 0.28122807645549375, 0.18444397592330158, 0.2705877856165171, -0.4070612308382988, -0.1317806578055024, 0.22412920141903062, 0.11208476233916978, -0.012709982407589753, 0.02560774834312421, -0.24303522468854985, 0.13541512951254844, -0.11679901780871053, -0.1265097064365788, -0.05647932352808615, 0.07502312509032587, 0.0942990631222104, -0.3231041473522782, 0.017619246020913124, 0.09324367614851023, 0.0826452112197876, -0.040175977846762786, -0.16872295800906917, -0.013806978341502447, 0.10029261277678113, -0.012347232694737613, 0.05196038881782442, 0.04131109538914946, -0.045227379095740615, -0.0877576095991147, 0.3345051361092677, -0.049316951551785074, -0.25177323318552225, 0.11464042835558454, -0.188789989038681, -0.14438472067937255, 0.06946697886722783, 0.10403532214152317, 0.11274172724535068, -0.10537816469247142, 0.16576958972145803, -0.1233847872602443, 0.09165646338835359, 0.11274690963948766, 0.05069009684026241, 0.12325080649912706, 0.04534702042738597, 0.13769820639242727, 0.07602724458634233, 0.0173048554888616, -0.05386122020271917, -0.3963176121562719, -0.1339931589566792, -0.21897428494878113, 0.09005790635322532, -0.20394779597050122, -0.19975504803160826, 0.38448318420598904, 0.09517648152075708, 0.2540970095836868, 0.09664310761416951, 0.19570390753448008, 0.08274643782623267, 0.03407306832571824, 0.11241126247371236, 0.07455934928710728, 0.16274353152917076, -0.03277899146468068, -0.16999677872130026, 0.039440416113163033, 0.1197917320455114] |
1,802.0125 | Suppressing epidemic spreading by risk-averse migration in dynamical
networks | In this paper, we study the interplay between individual behaviors and
epidemic spreading in a dynamical network. We distribute agents on a
square-shaped region with periodic boundary conditions. Every agent is regarded
as a node of the network and a wireless link is established between two agents
if their geographical distance is less than a certain radius. At each time,
every agent assesses the epidemic situation and make decisions on whether it
should stay in or leave its current place. An agent will leave its current
place with a speed if the number of infected neighbors reaches or exceeds a
critical value $E$. Owing to the movement of agents, the network's structure is
dynamical. Interestingly, we find that there exists an optimal value of $E$
leading to the maximum epidemic threshold. This means that epidemic spreading
can be effectively controlled by risk-averse migration. Besides, we find that
the epidemic threshold increases as the recovering rate increases, decreases as
the contact radius increases, and is maximized by an optimal moving speed. Our
findings offer a deeper understanding of epidemic spreading in dynamical
networks.
| physics.soc-ph q-bio.PE | in this paper we study the interplay between individual behaviors and epidemic spreading in a dynamical network we distribute agents on a squareshaped region with periodic boundary conditions every agent is regarded as a node of the network and a wireless link is established between two agents if their geographical distance is less than a certain radius at each time every agent assesses the epidemic situation and make decisions on whether it should stay in or leave its current place an agent will leave its current place with a speed if the number of infected neighbors reaches or exceeds a critical value e owing to the movement of agents the networks structure is dynamical interestingly we find that there exists an optimal value of e leading to the maximum epidemic threshold this means that epidemic spreading can be effectively controlled by riskaverse migration besides we find that the epidemic threshold increases as the recovering rate increases decreases as the contact radius increases and is maximized by an optimal moving speed our findings offer a deeper understanding of epidemic spreading in dynamical networks | [['in', 'this', 'paper', 'we', 'study', 'the', 'interplay', 'between', 'individual', 'behaviors', 'and', 'epidemic', 'spreading', 'in', 'a', 'dynamical', 'network', 'we', 'distribute', 'agents', 'on', 'a', 'squareshaped', 'region', 'with', 'periodic', 'boundary', 'conditions', 'every', 'agent', 'is', 'regarded', 'as', 'a', 'node', 'of', 'the', 'network', 'and', 'a', 'wireless', 'link', 'is', 'established', 'between', 'two', 'agents', 'if', 'their', 'geographical', 'distance', 'is', 'less', 'than', 'a', 'certain', 'radius', 'at', 'each', 'time', 'every', 'agent', 'assesses', 'the', 'epidemic', 'situation', 'and', 'make', 'decisions', 'on', 'whether', 'it', 'should', 'stay', 'in', 'or', 'leave', 'its', 'current', 'place', 'an', 'agent', 'will', 'leave', 'its', 'current', 'place', 'with', 'a', 'speed', 'if', 'the', 'number', 'of', 'infected', 'neighbors', 'reaches', 'or', 'exceeds', 'a', 'critical', 'value', 'e', 'owing', 'to', 'the', 'movement', 'of', 'agents', 'the', 'networks', 'structure', 'is', 'dynamical', 'interestingly', 'we', 'find', 'that', 'there', 'exists', 'an', 'optimal', 'value', 'of', 'e', 'leading', 'to', 'the', 'maximum', 'epidemic', 'threshold', 'this', 'means', 'that', 'epidemic', 'spreading', 'can', 'be', 'effectively', 'controlled', 'by', 'riskaverse', 'migration', 'besides', 'we', 'find', 'that', 'the', 'epidemic', 'threshold', 'increases', 'as', 'the', 'recovering', 'rate', 'increases', 'decreases', 'as', 'the', 'contact', 'radius', 'increases', 'and', 'is', 'maximized', 'by', 'an', 'optimal', 'moving', 'speed', 'our', 'findings', 'offer', 'a', 'deeper', 'understanding', 'of', 'epidemic', 'spreading', 'in', 'dynamical', 'networks']] | [-0.18201339070171574, 0.1329229829347901, -0.06936662942733984, 0.046224566434310485, -0.06748306415949508, -0.18808766336955518, 0.13980952447397343, 0.3950619022413106, -0.27156399365432643, -0.24953659486721505, 0.10417612878014691, -0.30969113864485626, -0.1891844789267282, 0.1256658825920997, -0.07275551973197962, -0.030587913377010927, 0.07348623167298693, 0.11812302580993664, 0.017913424045328502, -0.2553985172864766, 0.2926802120611563, 0.06629505815610653, 0.2536636686111176, 0.07859005080791866, 0.08576497884984077, 0.02651319773304839, 0.0374242686103661, 0.03912571784758756, -0.15716039940933435, 0.0401349212855336, 0.2566933557212066, 0.15700939199938388, 0.36993310865587914, -0.420213749492477, -0.22426072967617394, 0.15736076174365296, 0.16591097925377724, 0.10408507684593672, 0.028828934478512095, -0.25555527775681447, 0.08977712273398149, -0.17937976695279909, -0.15237342117221228, 0.03527906159409783, 0.05906647724063637, 0.022306621199087395, -0.26969430121179966, 0.03997281493214829, 0.014680843492157522, 0.045941823800623734, -0.031098715578471974, -0.05862532609787125, -0.07662459656949268, 0.20072405513089436, 0.03581726757149407, 0.04307432225419229, 0.21429089106207427, -0.1637866733861821, -0.10312516457442153, 0.3415755887188345, -0.00818419582851725, -0.17721349246554322, 0.178711147723044, -0.11966989497439219, -0.052448317196679424, 0.11796208609478896, 0.20914726210041687, 0.06527573234564113, -0.12083295493925267, -0.006793754662714571, -0.024300632517654346, 0.18602055514514046, 0.06729113905700845, -0.008319598496610115, 0.20847663241387396, 0.2619070986472582, 0.19011504120439046, 0.09239887136001405, -0.057665673548939055, -0.1318634422969298, -0.24509205931418954, -0.11215520487422799, -0.15981340857355722, 0.08603176922194537, -0.14464580467652663, -0.13832362205721438, 0.3687533399558391, 0.1752601978509779, 0.2413251798518084, 0.0936099330160337, 0.2496583899374345, 0.12025800834609461, 0.013792276703547891, 0.14949776643406149, 0.2440859325099634, 0.04480350180401129, 0.10045457676892261, -0.22120727574168755, 0.190879218282874, 0.010921963026963308] |
1,802.01251 | Polarization of neural codes | The neural rings and ideals as an algebraic tool for analyzing the intrinsic
structure of neural codes were introduced by C.~Curto et al. in 2013. Since
then they were investigated in several papers, including the 2017 paper by
G\"unt\"urk\"un et al., in which the notion of polarization of neural ideals
was introduced. In this paper we extend their ideas by introducing the notions
of polarization of motifs and neural codes. We show that the notions that we
introduced have very nice properties which could allow the studying of the
intrinsic structure of neural codes of length $n$ via the square free monomial
ideals in $2n$ variables and interpreting the results back in the original
neural code ambient space.
In the last section of the paper we introduce the notions of inactive
neurons, partial neural codes, and partial motifs, as well as the notions of
polarization of these codes and motifs. We use these notions to give a new
proof of a theorem from the paper by G\"unt\"urk\"un et al. that we mentioned
above.
| math.AC | the neural rings and ideals as an algebraic tool for analyzing the intrinsic structure of neural codes were introduced by ccurto et al in 2013 since then they were investigated in several papers including the 2017 paper by gunturkun et al in which the notion of polarization of neural ideals was introduced in this paper we extend their ideas by introducing the notions of polarization of motifs and neural codes we show that the notions that we introduced have very nice properties which could allow the studying of the intrinsic structure of neural codes of length n via the square free monomial ideals in 2n variables and interpreting the results back in the original neural code ambient space in the last section of the paper we introduce the notions of inactive neurons partial neural codes and partial motifs as well as the notions of polarization of these codes and motifs we use these notions to give a new proof of a theorem from the paper by gunturkun et al that we mentioned above | [['the', 'neural', 'rings', 'and', 'ideals', 'as', 'an', 'algebraic', 'tool', 'for', 'analyzing', 'the', 'intrinsic', 'structure', 'of', 'neural', 'codes', 'were', 'introduced', 'by', 'ccurto', 'et', 'al', 'in', '2013', 'since', 'then', 'they', 'were', 'investigated', 'in', 'several', 'papers', 'including', 'the', '2017', 'paper', 'by', 'gunturkun', 'et', 'al', 'in', 'which', 'the', 'notion', 'of', 'polarization', 'of', 'neural', 'ideals', 'was', 'introduced', 'in', 'this', 'paper', 'we', 'extend', 'their', 'ideas', 'by', 'introducing', 'the', 'notions', 'of', 'polarization', 'of', 'motifs', 'and', 'neural', 'codes', 'we', 'show', 'that', 'the', 'notions', 'that', 'we', 'introduced', 'have', 'very', 'nice', 'properties', 'which', 'could', 'allow', 'the', 'studying', 'of', 'the', 'intrinsic', 'structure', 'of', 'neural', 'codes', 'of', 'length', 'n', 'via', 'the', 'square', 'free', 'monomial', 'ideals', 'in', '2n', 'variables', 'and', 'interpreting', 'the', 'results', 'back', 'in', 'the', 'original', 'neural', 'code', 'ambient', 'space', 'in', 'the', 'last', 'section', 'of', 'the', 'paper', 'we', 'introduce', 'the', 'notions', 'of', 'inactive', 'neurons', 'partial', 'neural', 'codes', 'and', 'partial', 'motifs', 'as', 'well', 'as', 'the', 'notions', 'of', 'polarization', 'of', 'these', 'codes', 'and', 'motifs', 'we', 'use', 'these', 'notions', 'to', 'give', 'a', 'new', 'proof', 'of', 'a', 'theorem', 'from', 'the', 'paper', 'by', 'gunturkun', 'et', 'al', 'that', 'we', 'mentioned', 'above']] | [-0.09460287949837307, 0.09214253099164446, -0.05703233737115036, 0.05898151810431634, -0.03519256867687492, -0.0988843891879215, 0.006128652790999588, 0.3488767489571782, -0.3225374085006907, -0.3006570477969944, 0.06001833871020661, -0.24335130964515403, -0.250385333300801, 0.17551715895122685, -0.12839689683716962, 0.06896293276153943, 0.021965808072812197, -0.021626815957236378, -0.07515960728188101, -0.3379638992790954, 0.3687286700176842, 0.12886455414049766, 0.2237860785687671, 0.023884214834748382, 0.11364718795589665, 0.004243706424227532, -0.07977160980705829, 0.03987984618921901, -0.2017198982586492, 0.16111422825385543, 0.27282220557715525, 0.16424936878234697, 0.2630612780312624, -0.424445509412052, -0.1939852780292687, 0.0903450931148494, 0.10946742918287568, 0.1334178774343694, 0.01609534873517559, -0.2728901286280769, 0.11499492523375118, -0.16999962140312966, -0.0747786147862344, -0.07803224316414664, 0.0279751807999085, 0.06345191382090835, -0.21908250440336655, 0.01436384160290746, 0.16688988958827822, 0.12355238190742539, -0.028304095193743706, -0.11428177221609717, -0.02774244025349617, 0.07655762482215377, -0.0009289431823965381, 0.00396366140613442, 0.04637378983418731, -0.09313583675881519, -0.1881703794379171, 0.2981974367709721, -0.021860824324026265, -0.16081626058063087, 0.14685750017353497, -0.06538360409219475, -0.1664583510856199, 0.04628194378045223, 0.1767125531866708, 0.11198960109476877, -0.12185888353748904, 0.11236225668964085, -0.10920932687380734, 0.11113188594360562, 0.12419054480269551, 0.07295866554109927, 0.14500316725495985, 0.11257173645905877, -0.006629301869200872, 0.16909392130533782, -0.06081027467324234, -0.03621087661526604, -0.2648211199187619, -0.14604934871141964, -0.14038700962384396, 0.033035727650584545, -0.047923406272328814, -0.15820637745782734, 0.4437462516649462, 0.14465945630663019, 0.21010554831968073, 0.07920922910767224, 0.23575098528663682, 0.0219875460894614, 0.08370189310072045, 0.11506354612681796, 0.2062243988367674, 0.21081049684503608, 0.09553014464018976, -0.1335497585700496, 0.07587884229279178, 0.1525790324955083] |
1,802.01252 | Jet mixing optimization using machine learning control | We experimentally optimize mixing of a turbulent round jet using machine
learning control (MLC) following Li et al (2017). The jet is manipulated with
one unsteady minijet blowing in wall-normal direction close to the nozzle exit.
The flow is monitored with two hotwire sensors. The first sensor is positioned
on the centerline 5 jet diameters downstream of the nozzle exit, i.e. the end
of the potential core, while the second is located 3 jet diameters downstream
and displaced towards the shear-layer. The mixing performance is monitored with
mean velocity at the first sensor. A reduction of this velocity correlates with
increased entrainment near the potential core. Machine Learning Control (MLC)
is employed to optimize sensor feedback, a general open-loop broadband
frequency actuation and combinations of both. MLC has identified the optimal
periodic forcing with a small duty cycle as the best control policy employing
only 400 actuation measurements, each lasting for 5 seconds. This learning rate
is comparable if not faster than typical optimization of periodic forcing with
two free parameters (frequency and duty cycle). In addition, MLC results
indicate that neither new frequencies nor sensor feedback improves mixing
further-contrary to many of other turbulence control experiments. The
optimality of pure periodic actuation may be attributed to the simple jet
flapping mechanism in the minijet plane. The performance of sensor feedback is
shown to face a challenge for small duty cycles. The jet mixing results
demonstrate the untapped potential of MLC in quickly learning optimal general
control policies, even deciding between open- and closed-loop control.
| physics.flu-dyn | we experimentally optimize mixing of a turbulent round jet using machine learning control mlc following li et al 2017 the jet is manipulated with one unsteady minijet blowing in wallnormal direction close to the nozzle exit the flow is monitored with two hotwire sensors the first sensor is positioned on the centerline 5 jet diameters downstream of the nozzle exit ie the end of the potential core while the second is located 3 jet diameters downstream and displaced towards the shearlayer the mixing performance is monitored with mean velocity at the first sensor a reduction of this velocity correlates with increased entrainment near the potential core machine learning control mlc is employed to optimize sensor feedback a general openloop broadband frequency actuation and combinations of both mlc has identified the optimal periodic forcing with a small duty cycle as the best control policy employing only 400 actuation measurements each lasting for 5 seconds this learning rate is comparable if not faster than typical optimization of periodic forcing with two free parameters frequency and duty cycle in addition mlc results indicate that neither new frequencies nor sensor feedback improves mixing furthercontrary to many of other turbulence control experiments the optimality of pure periodic actuation may be attributed to the simple jet flapping mechanism in the minijet plane the performance of sensor feedback is shown to face a challenge for small duty cycles the jet mixing results demonstrate the untapped potential of mlc in quickly learning optimal general control policies even deciding between open and closedloop control | [['we', 'experimentally', 'optimize', 'mixing', 'of', 'a', 'turbulent', 'round', 'jet', 'using', 'machine', 'learning', 'control', 'mlc', 'following', 'li', 'et', 'al', '2017', 'the', 'jet', 'is', 'manipulated', 'with', 'one', 'unsteady', 'minijet', 'blowing', 'in', 'wallnormal', 'direction', 'close', 'to', 'the', 'nozzle', 'exit', 'the', 'flow', 'is', 'monitored', 'with', 'two', 'hotwire', 'sensors', 'the', 'first', 'sensor', 'is', 'positioned', 'on', 'the', 'centerline', '5', 'jet', 'diameters', 'downstream', 'of', 'the', 'nozzle', 'exit', 'ie', 'the', 'end', 'of', 'the', 'potential', 'core', 'while', 'the', 'second', 'is', 'located', '3', 'jet', 'diameters', 'downstream', 'and', 'displaced', 'towards', 'the', 'shearlayer', 'the', 'mixing', 'performance', 'is', 'monitored', 'with', 'mean', 'velocity', 'at', 'the', 'first', 'sensor', 'a', 'reduction', 'of', 'this', 'velocity', 'correlates', 'with', 'increased', 'entrainment', 'near', 'the', 'potential', 'core', 'machine', 'learning', 'control', 'mlc', 'is', 'employed', 'to', 'optimize', 'sensor', 'feedback', 'a', 'general', 'openloop', 'broadband', 'frequency', 'actuation', 'and', 'combinations', 'of', 'both', 'mlc', 'has', 'identified', 'the', 'optimal', 'periodic', 'forcing', 'with', 'a', 'small', 'duty', 'cycle', 'as', 'the', 'best', 'control', 'policy', 'employing', 'only', '400', 'actuation', 'measurements', 'each', 'lasting', 'for', '5', 'seconds', 'this', 'learning', 'rate', 'is', 'comparable', 'if', 'not', 'faster', 'than', 'typical', 'optimization', 'of', 'periodic', 'forcing', 'with', 'two', 'free', 'parameters', 'frequency', 'and', 'duty', 'cycle', 'in', 'addition', 'mlc', 'results', 'indicate', 'that', 'neither', 'new', 'frequencies', 'nor', 'sensor', 'feedback', 'improves', 'mixing', 'furthercontrary', 'to', 'many', 'of', 'other', 'turbulence', 'control', 'experiments', 'the', 'optimality', 'of', 'pure', 'periodic', 'actuation', 'may', 'be', 'attributed', 'to', 'the', 'simple', 'jet', 'flapping', 'mechanism', 'in', 'the', 'minijet', 'plane', 'the', 'performance', 'of', 'sensor', 'feedback', 'is', 'shown', 'to', 'face', 'a', 'challenge', 'for', 'small', 'duty', 'cycles', 'the', 'jet', 'mixing', 'results', 'demonstrate', 'the', 'untapped', 'potential', 'of', 'mlc', 'in', 'quickly', 'learning', 'optimal', 'general', 'control', 'policies', 'even', 'deciding', 'between', 'open', 'and', 'closedloop', 'control']] | [-0.1490473312295526, 0.1467891346542238, -0.025491204120101422, -0.007005361503716118, -0.09917517648331499, -0.19584378571337543, 0.04341934940788719, 0.4115285610259459, -0.28739922569962, -0.3101895267609507, 0.11925696736975301, -0.2200152896799323, -0.06451862693423273, 0.23120722853886624, -0.12472830736557418, 0.08634448080052307, 0.08892118865436156, 0.007324101149441865, 0.003716742429207629, -0.18759380074907242, 0.23413182080697678, 0.07948251683759965, 0.2911540503158989, 0.02960204869448244, 0.13701108934753758, -0.04025714759903733, 0.008491968074226825, 0.005519010921789876, -0.10406708962107687, 0.06298803273353755, 0.23299053318222882, 0.08162405419321071, 0.29886998435643714, -0.40262513934069966, -0.21716714799807474, 0.06771595492284363, 0.13894177398022894, 0.07267263915122113, -0.037086879472911914, -0.22581666381296328, 0.10288949195464236, -0.18116176341418325, -0.1266356429816627, 0.0008014268205156477, 0.02143597802216935, 0.05265628344198297, -0.2865080651002166, 0.03835662249127388, 0.024106809781409624, 0.06114439496231507, -0.0737799543953376, -0.07260554912591749, -0.0369385321107583, 0.14618551909032565, 0.02024914367916429, 0.07013173649082048, 0.23836556892644056, -0.12428334100615585, -0.14070607295193835, 0.34193606647538155, -0.03276904270963379, -0.1551515929589752, 0.18088358234179638, -0.13494149607564523, -0.07389578241744907, 0.18935898885930205, 0.2060258907332877, 0.08360186265048197, -0.12333697778187458, -0.03600002045277506, 0.0016713838081982896, 0.19570392760490324, 0.1299890781657433, -0.04133849733602622, 0.16027602658324736, 0.2234325275030427, 0.14008156422458728, 0.12880684015493268, -0.1529791132779792, -0.09788565647785596, -0.2764387423297258, -0.06102987328602925, -0.1365222902267284, 0.01905150441420778, -0.11503553108974932, -0.10370802942983802, 0.3839359451965319, 0.12110278309977386, 0.17838931223744248, 0.041719149428742434, 0.3666151229559818, 0.07595287356892322, 0.07203401699497211, 0.14621645188065407, 0.3219309946454284, 0.12314955934819831, 0.14546689700507595, -0.2671625510026109, 0.07698773497928256, 0.01248243083356051] |
1,802.01253 | Promoting cooperation by reputation-driven group formation | In previous studies of spatial public goods game, each player is able to
establish a group. However, in real life, some players cannot successfully
organize groups for various reasons. In this paper, we propose a mechanism of
reputation-driven group formation, in which groups can only be organized by
players whose reputation reaches or exceeds a threshold. We define a player's
reputation as the frequency of cooperation in the last $T$ time steps. We find
that the highest cooperation level can be obtained when groups are only
established by pure cooperators who always cooperate in the last $T$ time
steps. Effects of the memory length $T$ on cooperation are also studied.
| physics.soc-ph econ.TH | in previous studies of spatial public goods game each player is able to establish a group however in real life some players cannot successfully organize groups for various reasons in this paper we propose a mechanism of reputationdriven group formation in which groups can only be organized by players whose reputation reaches or exceeds a threshold we define a players reputation as the frequency of cooperation in the last t time steps we find that the highest cooperation level can be obtained when groups are only established by pure cooperators who always cooperate in the last t time steps effects of the memory length t on cooperation are also studied | [['in', 'previous', 'studies', 'of', 'spatial', 'public', 'goods', 'game', 'each', 'player', 'is', 'able', 'to', 'establish', 'a', 'group', 'however', 'in', 'real', 'life', 'some', 'players', 'can', 'not', 'successfully', 'organize', 'groups', 'for', 'various', 'reasons', 'in', 'this', 'paper', 'we', 'propose', 'a', 'mechanism', 'of', 'reputationdriven', 'group', 'formation', 'in', 'which', 'groups', 'can', 'only', 'be', 'organized', 'by', 'players', 'whose', 'reputation', 'reaches', 'or', 'exceeds', 'a', 'threshold', 'we', 'define', 'a', 'players', 'reputation', 'as', 'the', 'frequency', 'of', 'cooperation', 'in', 'the', 'last', 't', 'time', 'steps', 'we', 'find', 'that', 'the', 'highest', 'cooperation', 'level', 'can', 'be', 'obtained', 'when', 'groups', 'are', 'only', 'established', 'by', 'pure', 'cooperators', 'who', 'always', 'cooperate', 'in', 'the', 'last', 't', 'time', 'steps', 'effects', 'of', 'the', 'memory', 'length', 't', 'on', 'cooperation', 'are', 'also', 'studied']] | [-0.16706162110309708, 0.15558622027324004, -0.10532007172534412, 0.06500480716878718, -0.06263633829287507, -0.18637109949168834, 0.1383205088934946, 0.4274751243604855, -0.25688181658360093, -0.2916846805336801, 0.08927286734000187, -0.22205030515112661, -0.14451970151540908, 0.08423046466566368, -0.11134467471221632, -0.08664875432838347, 0.045303292414808474, 0.11964986516501416, 0.053961600348438055, -0.37341977325691417, 0.31946708729321305, 0.03630218926647848, 0.25364969974722373, 0.016644258201333948, 0.07676556586626579, -0.017085301469672808, -0.02403926772742786, 0.04911391509019516, -0.12406974867739005, 0.020417967227033592, 0.3606769584288651, 0.10880846251119775, 0.40213761289011346, -0.43036053280600095, -0.1936761872144416, 0.1560255328404971, 0.15815809179859405, 0.10247864335754209, -0.011906990709460594, -0.2686550727029416, 0.09729622755072673, -0.19107577868483283, -0.06550406163389033, -0.04187549783594229, 0.019949245177717373, 0.03307078812080859, -0.25092037842100995, 0.007430805348187939, 0.012692473485896532, 0.0662273052656515, -0.04235566190274602, -0.11660182026468895, -0.04919855231948366, 0.23623948942324866, 0.05029945445289327, -0.023568930467114446, 0.13537347010781312, -0.14663701845883306, -0.18537377214736558, 0.3721655449491333, -0.030989939012480053, -0.13337412449446592, 0.17633181221529165, -0.17268191219138151, -0.156187453658574, 0.08250745647078887, 0.17570733357728882, 0.12004283582408044, -0.1289293964537633, 0.0454160334457728, -0.0840271767186509, 0.19061908956447784, 0.08438106695698067, 0.019428716989403422, 0.14450048032978718, 0.15663801745553924, 0.1135895439889282, 0.06469319195444272, 0.025058448532680896, -0.11346702406352216, -0.2449336607686498, -0.15342249862045387, -0.1443804174386473, 0.0419130846584184, -0.051580342011187566, -0.05918809160039845, 0.36939503719860856, 0.12375418823635713, 0.15591848221692173, 0.09231205542085015, 0.2772528243907304, 0.07597442336951975, 0.10696216032162986, 0.0872002977962521, 0.19115080853463787, 0.03646451649785211, 0.10395557812245731, -0.1714582040186294, 0.14834190163422714, 0.050319241966247895] |
1,802.01254 | A Measurement Theory of Locality | Locality is a fundamental principle used extensively in program and system
optimization. It can be measured in many ways. This paper formalizes the
metrics of locality into a measurement theory. The new theory includes the
precise definition of locality metrics based on access frequency, reuse time,
reuse distance, working set, footprint, and the cache miss ratio. It gives the
formal relation between these definitions and the proofs of equivalence or
non-equivalence. It provides the theoretical justification for four successful
locality models in operating systems, programming languages, and computer
architectures which were developed empirically.
| cs.PF | locality is a fundamental principle used extensively in program and system optimization it can be measured in many ways this paper formalizes the metrics of locality into a measurement theory the new theory includes the precise definition of locality metrics based on access frequency reuse time reuse distance working set footprint and the cache miss ratio it gives the formal relation between these definitions and the proofs of equivalence or nonequivalence it provides the theoretical justification for four successful locality models in operating systems programming languages and computer architectures which were developed empirically | [['locality', 'is', 'a', 'fundamental', 'principle', 'used', 'extensively', 'in', 'program', 'and', 'system', 'optimization', 'it', 'can', 'be', 'measured', 'in', 'many', 'ways', 'this', 'paper', 'formalizes', 'the', 'metrics', 'of', 'locality', 'into', 'a', 'measurement', 'theory', 'the', 'new', 'theory', 'includes', 'the', 'precise', 'definition', 'of', 'locality', 'metrics', 'based', 'on', 'access', 'frequency', 'reuse', 'time', 'reuse', 'distance', 'working', 'set', 'footprint', 'and', 'the', 'cache', 'miss', 'ratio', 'it', 'gives', 'the', 'formal', 'relation', 'between', 'these', 'definitions', 'and', 'the', 'proofs', 'of', 'equivalence', 'or', 'nonequivalence', 'it', 'provides', 'the', 'theoretical', 'justification', 'for', 'four', 'successful', 'locality', 'models', 'in', 'operating', 'systems', 'programming', 'languages', 'and', 'computer', 'architectures', 'which', 'were', 'developed', 'empirically']] | [-0.1586142076067977, 0.0040695755079048134, -0.134044486168091, 0.11617694386551457, -0.09948136775644235, -0.20054874514850476, 0.07829845593416042, 0.34883321637427933, -0.28691894194031115, -0.34695314924402904, 0.07493680051242511, -0.21590139419190907, -0.13233292879666933, 0.19830735027539714, -0.10421157560201101, 0.09581075885122822, 0.05866917221396517, -0.006913888561088712, -0.09033192247552897, -0.25047083332213343, 0.2944443303671095, 0.08648679765962786, 0.36132399626677075, 0.05818841817678623, 0.09022332652301718, 0.0156410297664303, -0.06265316517042216, 0.0367295258548311, -0.11761543267877192, 0.15779147151937728, 0.28583588004407195, 0.2677643259296254, 0.2818758318411006, -0.3856665138430613, -0.16397969153839895, 0.03218812787885307, 0.08752264454796527, 0.07416691418151342, 0.01578466017775598, -0.26979581984661277, 0.055145789854108326, -0.19197851926168447, -0.04751670129737386, -0.09709701419921256, 0.015897795405258895, -0.031979123230582926, -0.20935867386319304, -0.0016959393747471353, 0.07856284615607814, 0.10721025182314778, -0.03392633091738467, -0.09200703706567286, 0.06649068875804102, 0.1420392171825252, 0.039299846884684374, 0.009900101375395572, 0.10922468894772151, -0.0298133512110179, -0.17426438198014294, 0.3914693336012543, 0.025070839614096667, -0.2332918725066608, 0.24454359243303458, -0.05756757714815678, -0.1601960398682383, 0.036157920836440975, 0.17334107661079015, 0.08586273709892907, -0.1864194123272193, 0.11764690973695809, -0.005045498681244671, 0.1921428136177197, 0.11307769945211789, 0.12586195915636997, 0.20583334535871062, 0.19162057982932937, 0.056619567325293656, 0.0936623617721301, 0.0032371623386498742, -0.12715441043618866, -0.3002786783361307, -0.14935557027747956, -0.14550000188686954, 0.008862878836851606, -0.101287864333254, -0.1305353006808668, 0.37311233896561846, 0.16630126887892363, 0.10324934662710275, 0.11575198829485735, 0.32571801102610043, 0.08807233371286809, 0.15008380836857263, 0.08866614193945963, 0.21936541821266856, 0.11830140809248131, 0.14611347977532654, -0.16433563902573559, 0.1000156384362008, 0.09356739780094514] |
1,802.01255 | Chemical-protein relation extraction with ensembles of SVM, CNN, and RNN
models | Text mining the relations between chemicals and proteins is an increasingly
important task. The CHEMPROT track at BioCreative VI aims to promote the
development and evaluation of systems that can automatically detect the
chemical-protein relations in running text (PubMed abstracts). This manuscript
describes our submission, which is an ensemble of three systems, including a
Support Vector Machine, a Convolutional Neural Network, and a Recurrent Neural
Network. Their output is combined using a decision based on majority voting or
stacking. Our CHEMPROT system obtained 0.7266 in precision and 0.5735 in recall
for an f-score of 0.6410, demonstrating the effectiveness of machine
learning-based approaches for automatic relation extraction from biomedical
literature. Our submission achieved the highest performance in the task during
the 2017 challenge.
| cs.CL | text mining the relations between chemicals and proteins is an increasingly important task the chemprot track at biocreative vi aims to promote the development and evaluation of systems that can automatically detect the chemicalprotein relations in running text pubmed abstracts this manuscript describes our submission which is an ensemble of three systems including a support vector machine a convolutional neural network and a recurrent neural network their output is combined using a decision based on majority voting or stacking our chemprot system obtained 07266 in precision and 05735 in recall for an fscore of 06410 demonstrating the effectiveness of machine learningbased approaches for automatic relation extraction from biomedical literature our submission achieved the highest performance in the task during the 2017 challenge | [['text', 'mining', 'the', 'relations', 'between', 'chemicals', 'and', 'proteins', 'is', 'an', 'increasingly', 'important', 'task', 'the', 'chemprot', 'track', 'at', 'biocreative', 'vi', 'aims', 'to', 'promote', 'the', 'development', 'and', 'evaluation', 'of', 'systems', 'that', 'can', 'automatically', 'detect', 'the', 'chemicalprotein', 'relations', 'in', 'running', 'text', 'pubmed', 'abstracts', 'this', 'manuscript', 'describes', 'our', 'submission', 'which', 'is', 'an', 'ensemble', 'of', 'three', 'systems', 'including', 'a', 'support', 'vector', 'machine', 'a', 'convolutional', 'neural', 'network', 'and', 'a', 'recurrent', 'neural', 'network', 'their', 'output', 'is', 'combined', 'using', 'a', 'decision', 'based', 'on', 'majority', 'voting', 'or', 'stacking', 'our', 'chemprot', 'system', 'obtained', '07266', 'in', 'precision', 'and', '05735', 'in', 'recall', 'for', 'an', 'fscore', 'of', '06410', 'demonstrating', 'the', 'effectiveness', 'of', 'machine', 'learningbased', 'approaches', 'for', 'automatic', 'relation', 'extraction', 'from', 'biomedical', 'literature', 'our', 'submission', 'achieved', 'the', 'highest', 'performance', 'in', 'the', 'task', 'during', 'the', '2017', 'challenge']] | [-0.06158633226883028, -0.002354135520676962, -0.039135575531339596, 0.01708504790640918, -0.08416874448222847, -0.11996709434957854, 0.06258233959369104, 0.40979787967456827, -0.2544114296244265, -0.33116318797692657, 0.07685212638823251, -0.30596026410509286, -0.19069306414417825, 0.21262363649318636, -0.11690274112986336, 0.09847197704948485, 0.15377087083420363, 0.07577481007420234, -0.019833407980984014, -0.3086156444874961, 0.2922833049669862, 0.052880125618058035, 0.390921241395047, 0.026384225369085846, 0.13207880602266384, -0.011400934796507374, -0.08329595834145258, -0.059875531267607585, -0.02224108422856732, 0.19687059702319576, 0.3377291651599206, 0.2219280091451545, 0.32982380213296236, -0.3602253940711119, -0.17346868138551583, 0.049599786465666415, 0.1566778154529888, 0.10677376686061475, -0.016299617046225366, -0.329981191035617, 0.09603282747838389, -0.19041013775457596, 0.032443079214286186, -0.1213442212982296, 0.024175548179332037, 0.0020148088665807554, -0.24560313278423815, 0.029379070872954768, 0.09221764241650315, 0.12801235324727242, -0.06584697166168742, -0.12856487461249344, 0.03135620222671825, 0.20024241168445361, 0.011153627413822788, 0.0947908391324996, 0.1428577848840585, -0.2204254537284904, -0.18848563214474967, 0.3733521308910487, -0.043149994202520185, -0.15876047597025875, 0.19571062843596307, 0.028580414757517904, -0.21484790550914176, 0.061825986427720636, 0.24446132706863613, 0.08320479652972827, -0.20312786876256095, -0.01533652788052207, 0.0017340268602530505, 0.2528238872965348, 0.041584330739389205, -0.05700411198907612, 0.2125611612272192, 0.2933600041694168, -0.02639791179159335, 0.11152552301465565, -0.10193805707340603, -0.044897459627024766, -0.21535759930025208, -0.16429813544603128, -0.17046855217456047, -0.03687604008531519, -0.06733921012421669, -0.14417545784842864, 0.39771967909523637, 0.22745948427372836, 0.1773062742491863, 0.09181517555783823, 0.2933420308118943, 0.013756301278621761, 0.10146190633732376, 0.08271441455019221, 0.20699030069778834, 0.017285097896217787, 0.1894727057199283, -0.19325632469403428, 0.1157758644248102, 0.07738695322568047] |
1,802.01256 | Phase retrieval with background information | Phase retrieval problem has been studied in various applications. It is an
inverse problem without the standard uniqueness guarantee. To make complete
theoretical analyses and devise efficient algorithms to recover the signal is
sophisticated. In this paper, we come up with a model called \textit{phase
retrieval with background information} which recovers the signal with the known
background information from the intensity of their combinational Fourier
transform spectrum. We prove that the uniqueness of phase retrieval can be
guaranteed even considering those trivial solutions when the background
information is sufficient. Under this condition, we construct a loss function
and utilize the projected gradient descent method to search for the ground
truth. We prove that the stationary point is the global optimum with
probability 1. Numerical simulations demonstrate the projected gradient descent
method performs well both for 1-D and 2-D signals. Furthermore, this method is
quite robust to the Gaussian noise and the bias of the background information.
| cs.IT math.IT | phase retrieval problem has been studied in various applications it is an inverse problem without the standard uniqueness guarantee to make complete theoretical analyses and devise efficient algorithms to recover the signal is sophisticated in this paper we come up with a model called textitphase retrieval with background information which recovers the signal with the known background information from the intensity of their combinational fourier transform spectrum we prove that the uniqueness of phase retrieval can be guaranteed even considering those trivial solutions when the background information is sufficient under this condition we construct a loss function and utilize the projected gradient descent method to search for the ground truth we prove that the stationary point is the global optimum with probability 1 numerical simulations demonstrate the projected gradient descent method performs well both for 1d and 2d signals furthermore this method is quite robust to the gaussian noise and the bias of the background information | [['phase', 'retrieval', 'problem', 'has', 'been', 'studied', 'in', 'various', 'applications', 'it', 'is', 'an', 'inverse', 'problem', 'without', 'the', 'standard', 'uniqueness', 'guarantee', 'to', 'make', 'complete', 'theoretical', 'analyses', 'and', 'devise', 'efficient', 'algorithms', 'to', 'recover', 'the', 'signal', 'is', 'sophisticated', 'in', 'this', 'paper', 'we', 'come', 'up', 'with', 'a', 'model', 'called', 'textitphase', 'retrieval', 'with', 'background', 'information', 'which', 'recovers', 'the', 'signal', 'with', 'the', 'known', 'background', 'information', 'from', 'the', 'intensity', 'of', 'their', 'combinational', 'fourier', 'transform', 'spectrum', 'we', 'prove', 'that', 'the', 'uniqueness', 'of', 'phase', 'retrieval', 'can', 'be', 'guaranteed', 'even', 'considering', 'those', 'trivial', 'solutions', 'when', 'the', 'background', 'information', 'is', 'sufficient', 'under', 'this', 'condition', 'we', 'construct', 'a', 'loss', 'function', 'and', 'utilize', 'the', 'projected', 'gradient', 'descent', 'method', 'to', 'search', 'for', 'the', 'ground', 'truth', 'we', 'prove', 'that', 'the', 'stationary', 'point', 'is', 'the', 'global', 'optimum', 'with', 'probability', '1', 'numerical', 'simulations', 'demonstrate', 'the', 'projected', 'gradient', 'descent', 'method', 'performs', 'well', 'both', 'for', '1d', 'and', '2d', 'signals', 'furthermore', 'this', 'method', 'is', 'quite', 'robust', 'to', 'the', 'gaussian', 'noise', 'and', 'the', 'bias', 'of', 'the', 'background', 'information']] | [-0.07725028784420246, 0.015166472277297335, -0.11471676117239091, 0.10296488768952446, -0.06959435548439312, -0.1469247569747938, 0.01953933877312244, 0.4093954083629144, -0.31199478847310486, -0.29649824935059327, 0.15404912049416453, -0.267041965166871, -0.16697145112527487, 0.16527238024625546, -0.07855748195941441, 0.09748187145958535, 0.06632954101317012, 0.058896152642913736, -0.12514893053762186, -0.23973074448085988, 0.2748366031133068, 0.05743746120387163, 0.31563754466314536, 0.010833937010223357, 0.11617092795681973, 0.0039841324249163075, -0.0369481596571859, 0.006921568759702122, -0.10162213157001623, 0.08335542417495535, 0.24182720595182708, 0.18451893005299214, 0.252826009865086, -0.38686959064589477, -0.22181906827534428, 0.17283160538033535, 0.11676865390304905, 0.17525987662240647, -0.08880639023995265, -0.293532343279833, 0.1245769857076737, -0.09725889469831227, -0.09507778114698923, -0.12441901878441851, -0.0591932603975949, 0.013565059040840238, -0.3297791526390192, 0.08103699155020504, 0.07866100991780584, 0.016473125758915186, -0.06071774072300356, -0.09064393216230644, 0.014044545973704841, 0.1223127242770622, 0.03834288324996566, 0.06173091495517068, 0.1069947179654637, -0.12046977683143595, -0.09831119678878728, 0.36229279799124176, -0.078521434426642, -0.22014221327248004, 0.1567333474253806, -0.09139552971688457, -0.11356247514665413, 0.15922545881655353, 0.14268261674218452, 0.1362061373746166, -0.14944769436605826, 0.08637726310348043, -0.03382527084501747, 0.18415235430811897, 0.031128938832224753, 0.027719155034924954, 0.15121067536305277, 0.15287921076061395, 0.14927544010779223, 0.16295783112395723, -0.12634957958802354, -0.08105139542991917, -0.25476893878247864, -0.11497988142610456, -0.1879502855336819, 0.008145392615682421, -0.08251680693707059, -0.169409307746742, 0.38577682743422115, 0.20281798165375128, 0.18627163749904588, 0.08696548684085241, 0.36214275440822047, 0.13652843085695238, 6.764583164252914e-05, 0.09433532406005841, 0.23627487087819296, 0.12572428606962113, 0.10710852262146102, -0.18794642746573886, 0.04889840347310289, 0.06496496266649607] |
1,802.01257 | Promoting cooperation by punishing minority | Punishment is an effective way to sustain cooperation among selfish
individuals. In most of previous studies, objects of punishment are set to be
defectors. In this paper, we propose a mechanism of punishment, in which
individuals with the majority strategy will punish those with the minority
strategy in a public goods game group. Both theoretical analysis and simulation
show that the cooperation level can be greatly enhanced by punishing minority.
For no punishment or small values of punishment fine, the fraction of
cooperators continuously increases with the multiplication factor. However, for
large values of punishment fine, there exists a critical value of
multiplication factor, at which the fraction of cooperators suddenly jumps from
0 to 1. The density of different types of groups is also studied.
| physics.soc-ph | punishment is an effective way to sustain cooperation among selfish individuals in most of previous studies objects of punishment are set to be defectors in this paper we propose a mechanism of punishment in which individuals with the majority strategy will punish those with the minority strategy in a public goods game group both theoretical analysis and simulation show that the cooperation level can be greatly enhanced by punishing minority for no punishment or small values of punishment fine the fraction of cooperators continuously increases with the multiplication factor however for large values of punishment fine there exists a critical value of multiplication factor at which the fraction of cooperators suddenly jumps from 0 to 1 the density of different types of groups is also studied | [['punishment', 'is', 'an', 'effective', 'way', 'to', 'sustain', 'cooperation', 'among', 'selfish', 'individuals', 'in', 'most', 'of', 'previous', 'studies', 'objects', 'of', 'punishment', 'are', 'set', 'to', 'be', 'defectors', 'in', 'this', 'paper', 'we', 'propose', 'a', 'mechanism', 'of', 'punishment', 'in', 'which', 'individuals', 'with', 'the', 'majority', 'strategy', 'will', 'punish', 'those', 'with', 'the', 'minority', 'strategy', 'in', 'a', 'public', 'goods', 'game', 'group', 'both', 'theoretical', 'analysis', 'and', 'simulation', 'show', 'that', 'the', 'cooperation', 'level', 'can', 'be', 'greatly', 'enhanced', 'by', 'punishing', 'minority', 'for', 'no', 'punishment', 'or', 'small', 'values', 'of', 'punishment', 'fine', 'the', 'fraction', 'of', 'cooperators', 'continuously', 'increases', 'with', 'the', 'multiplication', 'factor', 'however', 'for', 'large', 'values', 'of', 'punishment', 'fine', 'there', 'exists', 'a', 'critical', 'value', 'of', 'multiplication', 'factor', 'at', 'which', 'the', 'fraction', 'of', 'cooperators', 'suddenly', 'jumps', 'from', '0', 'to', '1', 'the', 'density', 'of', 'different', 'types', 'of', 'groups', 'is', 'also', 'studied']] | [-0.15554375844519763, 0.18068483270557378, -0.08154863640961665, 0.054989221754358227, -0.06532229483127594, -0.1809039896331905, 0.19435053176176365, 0.40718953365031335, -0.26082106972841307, -0.32258500946715235, 0.07272934953549079, -0.25341308236261645, -0.15151127232866923, 0.06943372157882781, -0.10476388622237931, -0.100728156960464, 0.034335758982388866, 0.007224960060464958, 0.07496546293675367, -0.3334188014860191, 0.36755637667651864, 0.047585091562867755, 0.28790929688820766, 0.0283668941988181, 0.061629517694994335, -0.0488845464507384, -0.0014926481304601545, 0.05002854767048524, -0.09862147720507762, 0.04890060800659869, 0.31725459672983675, 0.12031914341440868, 0.4293688502133129, -0.38688038827644455, -0.16295222935081083, 0.18869932725035127, 0.14469227660632145, 0.11620215258823471, -0.05622176640105271, -0.27589753807138, 0.10730556524099989, -0.22631602532725545, -0.10494439942496163, -0.07091430690516495, -0.003081470801835022, 0.026615550930959186, -0.27120827253730523, 0.04888022933866725, -0.018808343249099656, 0.08172674279379112, -0.054739879135648525, -0.1362895696675257, -0.058824018717536494, 0.17111875506908825, 0.09628243010772007, -0.018675899956077855, 0.16540570747170094, -0.23673475380351264, -0.12431763544205636, 0.3612287917898761, -0.023307511412967292, -0.13675966149284727, 0.19058431865691783, -0.18735802909063679, -0.12330741363707819, 0.1516497535557146, 0.14130258485018868, 0.10164204443110124, -0.06842524661786026, -0.002676737077611809, -0.06815132737946919, 0.20765834472452602, 0.025411901659228735, 0.027942497906873802, 0.13697918304907425, 0.18743358947898422, 0.14644493622380117, 0.029457337989394244, 0.013376235967457649, -0.13195624926851857, -0.20423938880955417, -0.11960512158527438, -0.11829045957087406, 0.06146540510604927, -0.11484580236800765, -0.11024932425639164, 0.3268042757353258, 0.12325236899963034, 0.1555892118060636, 0.09926459016204471, 0.2606048661326649, 0.09148380700011445, 0.12366734066283301, 0.05825253955960747, 0.2089977711032603, 0.005738744436438003, 0.08113941530852269, -0.2374073569570476, 0.1870729378036534, -0.014661853879852782] |
1,802.01258 | Suppressing traffic-driven epidemic spreading by adaptive routing
strategy | The design of routing strategies for traffic-driven epidemic spreading has
received increasing attention in recent years. In this paper, we propose an
adaptive routing strategy that incorporates topological distance with local
epidemic information through a tunable parameter $h$. In the case where the
traffic is free of congestion, there exists an optimal value of routing
parameter $h$, leading to the maximal epidemic threshold. This means that
epidemic spreading can be more effectively controlled by adaptive routing,
compared to that of the static shortest path routing scheme. Besides, we find
that the optimal value of $h$ can greatly relieve the traffic congestion in the
case of finite node-delivering capacity. We expect our work to provide new
insights into the effects of dynamic routings on traffic-driven epidemic
spreading.
| physics.soc-ph | the design of routing strategies for trafficdriven epidemic spreading has received increasing attention in recent years in this paper we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h in the case where the traffic is free of congestion there exists an optimal value of routing parameter h leading to the maximal epidemic threshold this means that epidemic spreading can be more effectively controlled by adaptive routing compared to that of the static shortest path routing scheme besides we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite nodedelivering capacity we expect our work to provide new insights into the effects of dynamic routings on trafficdriven epidemic spreading | [['the', 'design', 'of', 'routing', 'strategies', 'for', 'trafficdriven', 'epidemic', 'spreading', 'has', 'received', 'increasing', 'attention', 'in', 'recent', 'years', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adaptive', 'routing', 'strategy', 'that', 'incorporates', 'topological', 'distance', 'with', 'local', 'epidemic', 'information', 'through', 'a', 'tunable', 'parameter', 'h', 'in', 'the', 'case', 'where', 'the', 'traffic', 'is', 'free', 'of', 'congestion', 'there', 'exists', 'an', 'optimal', 'value', 'of', 'routing', 'parameter', 'h', 'leading', 'to', 'the', 'maximal', 'epidemic', 'threshold', 'this', 'means', 'that', 'epidemic', 'spreading', 'can', 'be', 'more', 'effectively', 'controlled', 'by', 'adaptive', 'routing', 'compared', 'to', 'that', 'of', 'the', 'static', 'shortest', 'path', 'routing', 'scheme', 'besides', 'we', 'find', 'that', 'the', 'optimal', 'value', 'of', 'h', 'can', 'greatly', 'relieve', 'the', 'traffic', 'congestion', 'in', 'the', 'case', 'of', 'finite', 'nodedelivering', 'capacity', 'we', 'expect', 'our', 'work', 'to', 'provide', 'new', 'insights', 'into', 'the', 'effects', 'of', 'dynamic', 'routings', 'on', 'trafficdriven', 'epidemic', 'spreading']] | [-0.18360660272301174, 0.12568964719050563, -0.08356720436364412, 0.02678690605144948, -0.09684783764369785, -0.1991870746575296, 0.1542650394970551, 0.423373328525573, -0.26940205876156686, -0.25068275848031046, 0.09671613958850503, -0.25159274685382843, -0.21396546549163759, 0.147315588735044, -0.1249663688391447, 0.07019728542864323, 0.054003800917416814, 0.030358917815843597, 0.034008700497448446, -0.26448409774899484, 0.3118145889248699, 0.08213439657352865, 0.30620504373311996, 0.11699031435092912, 0.06038294788822532, 0.05236454327963293, -0.025760703623294832, 0.05091682545095682, -0.22165730523061938, 0.09375127002503723, 0.303247916508466, 0.16653146252408624, 0.32842826991900803, -0.40670309801399707, -0.3139326637238264, 0.1634561257623136, 0.1922170054130256, 0.14011844037100674, -0.032505280160927214, -0.25446598741039633, 0.08114068980515003, -0.2070535734333098, -0.08135969113186002, 0.005541147953830659, 0.020367042802274228, -0.0007653999961912632, -0.29194045548141, 0.001136376490816474, -0.017092606473714113, 0.013082684360444546, 0.018891249913722277, -0.07442417166754603, -0.04832721739076078, 0.1499292668364942, 0.022837385332211853, 0.008989575310610235, 0.12667156210169195, -0.135812301248312, -0.16999540538340807, 0.3442732702642679, -0.018347061751410366, -0.1707016019341536, 0.07921656976640225, -0.026509372152388095, -0.08519089800864459, 0.16813824475742878, 0.2443142545185983, 0.08198325686855241, -0.14669441777840256, 0.01073330982401967, -0.032043766997754575, 0.15423907801602035, 0.04654487538151443, 0.036198160672560334, 0.06363649901543977, 0.2564549978002906, 0.24126605538278817, 0.11661011126916855, -0.07057675751950591, -0.1630913479104638, -0.22620157781243325, -0.10303686942905188, -0.12071389373764396, 0.06376168820727617, -0.16949253562744707, -0.13515903147682548, 0.40189637721618054, 0.22183100868947803, 0.1664871053956449, 0.08002750570327044, 0.2835077210245654, 0.0966232676776126, 0.023087401770055294, 0.1672066660411656, 0.20986945908516647, 0.02267705732770264, 0.13165937703847885, -0.2591121998243034, 0.16721471140161157, 0.039558872723253445] |
1,802.01259 | Immunization of traffic-driven epidemic spreading | In this paper, we study the control of the traffic-driven epidemic spreading
by immunization strategy. We consider the random, degree-based and
betweeness-based immunization strategies, respectively. It is found that the
betweeness-based immunization strategy can most effectively prevent the
outbreak of traffic-driven epidemic. Besides, we find that the critical number
of immune nodes above which epidemic dies out is increased with the enhancement
of the spreading rate and the packet-generation rate.
| physics.soc-ph | in this paper we study the control of the trafficdriven epidemic spreading by immunization strategy we consider the random degreebased and betweenessbased immunization strategies respectively it is found that the betweenessbased immunization strategy can most effectively prevent the outbreak of trafficdriven epidemic besides we find that the critical number of immune nodes above which epidemic dies out is increased with the enhancement of the spreading rate and the packetgeneration rate | [['in', 'this', 'paper', 'we', 'study', 'the', 'control', 'of', 'the', 'trafficdriven', 'epidemic', 'spreading', 'by', 'immunization', 'strategy', 'we', 'consider', 'the', 'random', 'degreebased', 'and', 'betweenessbased', 'immunization', 'strategies', 'respectively', 'it', 'is', 'found', 'that', 'the', 'betweenessbased', 'immunization', 'strategy', 'can', 'most', 'effectively', 'prevent', 'the', 'outbreak', 'of', 'trafficdriven', 'epidemic', 'besides', 'we', 'find', 'that', 'the', 'critical', 'number', 'of', 'immune', 'nodes', 'above', 'which', 'epidemic', 'dies', 'out', 'is', 'increased', 'with', 'the', 'enhancement', 'of', 'the', 'spreading', 'rate', 'and', 'the', 'packetgeneration', 'rate']] | [-0.16645847319333412, 0.13240473490875604, -0.054313243922791375, 0.059968824854551524, 0.002618716755159088, -0.20518436975109933, 0.18105702709802773, 0.33686176820922253, -0.22920483895820745, -0.21975062075835555, 0.14201582801257218, -0.29913370701164677, -0.30561039619036573, 0.09132273161589209, -0.057884538282098164, 0.004712915209594613, 0.035891405209454136, 0.028195285752638063, 0.11385812349756484, -0.35046816409092896, 0.3374785192852923, 0.10638808933740009, 0.3223285789031591, 0.09036956616997052, 0.035786704855289925, 0.0433965489518509, -0.05571728605610221, 0.0040488207587666475, -0.21231829596847582, 0.02436414464383817, 0.2909128410157873, 0.17634532029337402, 0.3458827331439773, -0.3773540116137644, -0.26973733280910484, 0.18964071076279923, 0.20348206119361653, 0.2137693763943389, 0.015689479326134296, -0.23997266123543926, 0.11800495077466676, -0.2021563332249869, -0.1487112730505195, 0.017772566680031927, 0.013195324119236043, 0.044358707140825356, -0.2788850106020917, 0.060702326193229475, 0.02535371368389521, 0.04097368023288784, 0.03296780661652004, -0.08493973932284583, -0.08027201485750612, 0.14045546821721677, 0.05800770812341249, -0.026122460284256445, 0.21459858072226617, -0.15329760129202102, -0.12535687634693599, 0.2807657041434032, -0.008780762386410984, -0.1456032092934961, 0.12378989021405022, -0.09036878633326781, -0.0746237321047863, 0.1756229911055138, 0.24202858803988392, 0.07904183127875648, -0.1554540579638152, -0.06488529756950187, 0.006044323139115056, 0.12648328567278197, 0.03335748052697128, -0.029750017449259758, 0.07065051099035277, 0.25398040539932565, 0.18981202889178225, 0.0985153878399574, -0.12242597802333645, -0.16440201885720243, -0.195271067960716, -0.09128419719914448, -0.12057596132326037, 0.06826968043486574, -0.15129849833128764, -0.13152551085257264, 0.44364823446845386, 0.23364353519794878, 0.13513150576279678, 0.10192167383806307, 0.223920735850263, 0.10223873726912398, 0.013863030320672846, 0.1234263580904078, 0.23568188499158887, 0.029755320389574364, 0.09374993597504808, -0.3044877340878124, 0.2228308703833774, 0.0043746031353375245] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.