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.0096 | Injective Hulls In a Locally Finite Topos | We show that in a locally finite topos, every object has an essential
extension that is injective, and that this extension is unique up to
isomorphism.
The construction was motivated by work on Bewl, a software project for doing
topos-theoretic calculations.
| math.CT | we show that in a locally finite topos every object has an essential extension that is injective and that this extension is unique up to isomorphism the construction was motivated by work on bewl a software project for doing topostheoretic calculations | [['we', 'show', 'that', 'in', 'a', 'locally', 'finite', 'topos', 'every', 'object', 'has', 'an', 'essential', 'extension', 'that', 'is', 'injective', 'and', 'that', 'this', 'extension', 'is', 'unique', 'up', 'to', 'isomorphism', 'the', 'construction', 'was', 'motivated', 'by', 'work', 'on', 'bewl', 'a', 'software', 'project', 'for', 'doing', 'topostheoretic', 'calculations']] | [-0.09235089952126145, 0.07197256783583725, -0.14190581506118177, 0.05085229917312972, -0.12011914802715182, -0.10838598511181771, -0.02421407476067543, 0.41330574164167044, -0.28392782675800843, -0.231206596782431, 0.09857788088993402, -0.2429024581317208, -0.18395049292739712, 0.20724244028679095, -0.1658778019598685, -0.020873319916427137, 0.07758178373333066, 0.04707622891291976, -0.03533649753662758, -0.23509427388198673, 0.37087042569182815, 0.08152929181233048, 0.22689291145652532, 0.08107052203267813, 0.14185313098714686, 0.006919841829221696, -0.012738604214973748, 0.04190482839476317, -0.138589719819538, 0.13897557104937733, 0.3285878491646145, 0.15568179449765013, 0.29876236310228704, -0.3246279251143278, -0.16206538516198635, 0.14655176053056493, 0.1214201619848609, 0.07880570939742029, -0.08966541433765088, -0.23346032922854648, 0.16021209030877798, -0.22261660355143248, -0.10670656048459932, -0.10246266396716237, 0.10265112165652682, -0.0921564233256504, -0.2286645531654358, -0.11243163186591118, 0.13557256744243204, 0.07826047660619224, -0.08273085565306246, 0.012958620360586792, 0.0023236914537847044, 0.08874315936118364, -0.05904947341186926, 0.14908937992295251, 0.08196148860588437, -0.05527897291467525, -0.1654029711615294, 0.3636260255705565, -0.07813381764572114, -0.17221638238988818, 0.1656028010416776, -0.06747002136253286, -0.2135538156144321, 0.10518267313018441, 0.022806028905324637, 0.1246047556400299, -0.13412114924285562, 0.22988861703634028, -0.15951545878779144, 0.16629445053404196, 0.05698053291998804, -0.052571768464986235, 0.1451970659662038, 0.2053243055474013, 0.11079960945062339, 0.14340242359321564, 0.058902684488566594, -0.022244130610488355, -0.3580572851002216, -0.1960872598523565, -0.18488360222545452, 0.08633378440863453, 0.014040001435569138, -0.14510722253471614, 0.38439839421771466, 0.19320745319128035, 0.13087535228405614, 0.09076241638977081, 0.28795810164883734, 0.03178918526973575, 0.09532520505599677, 0.07411166746169329, 0.16865816982463003, 0.12926576879690402, -0.03222417945507914, -0.14255044418387114, 0.03481468935497105, 0.14710754745174198] |
1,802.00961 | Disjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard
Approach | We add to intuitionistic logic infinitely many classical disjunctive
tautologies and use the Curry--Howard correspondence to obtain typed concurrent
$\lambda$-calculi; each of them features a specific communication mechanism,
including broadcasting and cyclic message-exchange, and enhanced expressive
power with respect to the $\lambda$-calculus. Moreover they all implement forms
of code mobility. Our results provide a first concurrent computational
interpretation for many propositional intermediate logics, classical logic
included.
| math.LO cs.LO | we add to intuitionistic logic infinitely many classical disjunctive tautologies and use the curryhoward correspondence to obtain typed concurrent lambdacalculi each of them features a specific communication mechanism including broadcasting and cyclic messageexchange and enhanced expressive power with respect to the lambdacalculus moreover they all implement forms of code mobility our results provide a first concurrent computational interpretation for many propositional intermediate logics classical logic included | [['we', 'add', 'to', 'intuitionistic', 'logic', 'infinitely', 'many', 'classical', 'disjunctive', 'tautologies', 'and', 'use', 'the', 'curryhoward', 'correspondence', 'to', 'obtain', 'typed', 'concurrent', 'lambdacalculi', 'each', 'of', 'them', 'features', 'a', 'specific', 'communication', 'mechanism', 'including', 'broadcasting', 'and', 'cyclic', 'messageexchange', 'and', 'enhanced', 'expressive', 'power', 'with', 'respect', 'to', 'the', 'lambdacalculus', 'moreover', 'they', 'all', 'implement', 'forms', 'of', 'code', 'mobility', 'our', 'results', 'provide', 'a', 'first', 'concurrent', 'computational', 'interpretation', 'for', 'many', 'propositional', 'intermediate', 'logics', 'classical', 'logic', 'included']] | [-0.1499978060189348, 0.002040782248458037, -0.08319347025110171, 0.17147109206192768, -0.2282374134645439, -0.2657525405431023, 0.09109936925367668, 0.3631194439644997, -0.3701929272653965, -0.2966871476633689, 0.039210086182440415, -0.24016731650783466, -0.07399648333398195, 0.17244890630245208, -0.14150103545532777, 0.06901496290587462, 0.012834194560463611, 0.06114138043530357, -0.019663804040576976, -0.2448851993970143, 0.24240922957228928, -0.030865903485279816, 0.2031763455257393, 0.004935663752257824, 0.07702912120417191, 0.060858967212530285, -0.018362538588161652, 0.0291968978368319, -0.09652641513026677, 0.17121798584524256, 0.41515688947760143, 0.25106380194998706, 0.26176153255196716, -0.46964346032876236, -0.1346050832617598, 0.06562194368945291, 0.08745613903380357, 0.09685141453519464, 0.009566077425216254, -0.27146218095261315, 0.06818866646633698, -0.2648137360882874, -0.010720993091280644, -0.16758778015008338, 0.03730108142615511, 0.0406688928604126, -0.22048718287394597, -0.06465147748016394, 0.2309296793447664, 0.11052547120130979, -0.023338471016345116, -0.06316307844737401, -0.012586856837599324, 0.07124790904613641, -0.05386897414886894, -0.040557063958392696, 0.08910095506132795, -0.0628420582981422, -0.26912880087128055, 0.3279986183660535, 0.010356778006714125, -0.15521624420697872, 0.23649601281907123, -0.030119702918455005, -0.2139688736687486, 0.08740869183809712, 0.0819312828234755, 0.10855587363386383, -0.09818918303801463, 0.10926959939892046, -0.024777534772427036, 0.24432870951982644, 0.17655969222721, 0.14628924572697052, 0.16638389371622067, 0.1515401351910371, -0.025168411206239118, 0.18288829872886148, 0.10060134138508986, -0.15474181785606422, -0.31925599986257464, -0.1679038728444049, -0.016576247406192124, -0.05119916322067953, -0.11554084433032236, -0.1987278470912805, 0.3282093232640853, 0.1839121329385447, 0.09280605602722902, 0.2547472932519248, 0.3541822000764884, 0.08296809833532628, 0.13274235046253754, 0.07217063958613346, 0.09413319386255282, 0.1760972985639595, 0.13518738127671756, -0.1678642875300004, 0.09437691191068062, 0.0518627958457308] |
1,802.00962 | Recursive model for the fragmentation of polarized quarks | We present a model for Monte Carlo simulation of the fragmentation of a
polarized quark. The model is based on string dynamics and the ${}^3P_0$
mechanism of quark pair creation at string breaking. The fragmentation is
treated as a recursive process, where the splitting function of the subprocess
$q \to h + q'$ depends on the spin density matrix of the quark $q$. The
${}^3P_0$ mechanism is parametrized by a complex mass parameter $\mu$, the
imaginary part of which is responsible for single spin asymmetries. The model
has been implemented in a Monte Carlo program to simulate jets made of
pseudoscalar mesons. Results for single hadron and hadron pair transverse-spin
asymmetries are found to be in agreement with experimental data from SIDIS and
$e^+e^-$ annihilation. The model predictions on the jet-handedness are also
discussed.
| hep-ph | we present a model for monte carlo simulation of the fragmentation of a polarized quark the model is based on string dynamics and the 3p_0 mechanism of quark pair creation at string breaking the fragmentation is treated as a recursive process where the splitting function of the subprocess q to h q depends on the spin density matrix of the quark q the 3p_0 mechanism is parametrized by a complex mass parameter mu the imaginary part of which is responsible for single spin asymmetries the model has been implemented in a monte carlo program to simulate jets made of pseudoscalar mesons results for single hadron and hadron pair transversespin asymmetries are found to be in agreement with experimental data from sidis and ee annihilation the model predictions on the jethandedness are also discussed | [['we', 'present', 'a', 'model', 'for', 'monte', 'carlo', 'simulation', 'of', 'the', 'fragmentation', 'of', 'a', 'polarized', 'quark', 'the', 'model', 'is', 'based', 'on', 'string', 'dynamics', 'and', 'the', '3p_0', 'mechanism', 'of', 'quark', 'pair', 'creation', 'at', 'string', 'breaking', 'the', 'fragmentation', 'is', 'treated', 'as', 'a', 'recursive', 'process', 'where', 'the', 'splitting', 'function', 'of', 'the', 'subprocess', 'q', 'to', 'h', 'q', 'depends', 'on', 'the', 'spin', 'density', 'matrix', 'of', 'the', 'quark', 'q', 'the', '3p_0', 'mechanism', 'is', 'parametrized', 'by', 'a', 'complex', 'mass', 'parameter', 'mu', 'the', 'imaginary', 'part', 'of', 'which', 'is', 'responsible', 'for', 'single', 'spin', 'asymmetries', 'the', 'model', 'has', 'been', 'implemented', 'in', 'a', 'monte', 'carlo', 'program', 'to', 'simulate', 'jets', 'made', 'of', 'pseudoscalar', 'mesons', 'results', 'for', 'single', 'hadron', 'and', 'hadron', 'pair', 'transversespin', 'asymmetries', 'are', 'found', 'to', 'be', 'in', 'agreement', 'with', 'experimental', 'data', 'from', 'sidis', 'and', 'ee', 'annihilation', 'the', 'model', 'predictions', 'on', 'the', 'jethandedness', 'are', 'also', 'discussed']] | [-0.08262284753216205, 0.2148285431004214, -0.11174384243151342, 0.12247682474851514, -0.038089007075706664, -0.11161329125576286, 0.029893759558696976, 0.3664643707910948, -0.21648476174750336, -0.22286732809505228, -0.019761878727215597, -0.2862180602299332, -0.004609094842718067, 0.1571674194455034, 0.12482823656561474, 0.09053512754370317, 0.07836526788146743, 0.0038853072540157223, -0.030802480360734713, -0.19044283014866806, 0.3308178121929593, 0.051516449029529184, 0.2218825789838747, 0.12064879741801908, 0.07552006022359076, 0.05074960610892793, -0.03189075871892838, -0.0791520039042966, -0.1037074292738301, 0.042403732605497214, 0.19387559173672786, 0.05952787467641897, 0.12571554654310935, -0.38093747777130565, -0.1541133531489212, 0.11336932022293861, 0.1577893398723311, 0.12139371375705002, -0.06531356467255109, -0.26735248926067445, 0.08190430479942623, -0.243706042405613, -0.10709492732051083, -0.06887851858857286, 0.026455159487809535, -0.029175281168356763, -0.3792963430257232, 0.06755068740136322, -0.04311182032423941, 0.005608496510169723, 0.013790088352944815, -0.17934865048719625, -0.09428805679746086, 0.009262886977839198, 0.06493949474018089, 0.13009671308452997, 0.16831996427340942, -0.1686190878478528, -0.1940829969279355, 0.3934748442702447, -0.051629225416532296, -0.21167574674737724, 0.1113104355066422, -0.17580051261889326, -0.12739808523011478, 0.1413040058475665, 0.20301801424163082, 0.11915199893921839, -0.16856421208693506, 0.13097172624398037, -0.04866033316692196, 0.15402730094325362, 0.031266135798597876, 0.006933795718092976, 0.23497959859951428, 0.22357398318832344, -0.08716794580157677, 0.12108282200290088, -0.10597376584800342, -0.16604058999413004, -0.36328377460383554, -0.11162972026575131, -0.16427953605483653, 0.04051295839334754, -0.053741270220846425, -0.12184693875976584, 0.37355507916601544, 0.09578343010225306, 0.2577891041044936, -0.0026992040987930854, 0.306182846303493, 0.11889109741384869, 0.07506323502765912, 0.03766474273112236, 0.23145925280440485, 0.17840600249738517, 0.10869812610855495, -0.2882901551678184, 0.07910652883230906, 0.08536141076668476] |
1,802.00963 | Coding Theory: the unit-derived methodology | The unit-derived method in coding theory is shown to be a unique optimal
scheme for constructing and analysing codes. In many cases efficient and
practical decoding methods are produced. Codes with efficient decoding
algorithms at maximal distances possible are derived from unit schemes. In
particular unit-derived codes from Vandermonde or Fourier matrices are
particularly commendable giving rise to mds codes of varying rates with
practical and efficient decoding algorithms. For a given rate and given error
correction capability, explicit codes with efficient error correcting
algorithms are designed to these specifications. An explicit constructive proof
with an efficient decoding algorithm is given for Shannon's theorem. For a
given finite field, codes are constructed which are `optimal' for this field.
| cs.IT cs.DM math.IT | the unitderived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes in many cases efficient and practical decoding methods are produced codes with efficient decoding algorithms at maximal distances possible are derived from unit schemes in particular unitderived codes from vandermonde or fourier matrices are particularly commendable giving rise to mds codes of varying rates with practical and efficient decoding algorithms for a given rate and given error correction capability explicit codes with efficient error correcting algorithms are designed to these specifications an explicit constructive proof with an efficient decoding algorithm is given for shannons theorem for a given finite field codes are constructed which are optimal for this field | [['the', 'unitderived', 'method', 'in', 'coding', 'theory', 'is', 'shown', 'to', 'be', 'a', 'unique', 'optimal', 'scheme', 'for', 'constructing', 'and', 'analysing', 'codes', 'in', 'many', 'cases', 'efficient', 'and', 'practical', 'decoding', 'methods', 'are', 'produced', 'codes', 'with', 'efficient', 'decoding', 'algorithms', 'at', 'maximal', 'distances', 'possible', 'are', 'derived', 'from', 'unit', 'schemes', 'in', 'particular', 'unitderived', 'codes', 'from', 'vandermonde', 'or', 'fourier', 'matrices', 'are', 'particularly', 'commendable', 'giving', 'rise', 'to', 'mds', 'codes', 'of', 'varying', 'rates', 'with', 'practical', 'and', 'efficient', 'decoding', 'algorithms', 'for', 'a', 'given', 'rate', 'and', 'given', 'error', 'correction', 'capability', 'explicit', 'codes', 'with', 'efficient', 'error', 'correcting', 'algorithms', 'are', 'designed', 'to', 'these', 'specifications', 'an', 'explicit', 'constructive', 'proof', 'with', 'an', 'efficient', 'decoding', 'algorithm', 'is', 'given', 'for', 'shannons', 'theorem', 'for', 'a', 'given', 'finite', 'field', 'codes', 'are', 'constructed', 'which', 'are', 'optimal', 'for', 'this', 'field']] | [-0.1504945151194125, 0.029782271180627474, -0.06549560527861813, 0.13970406949066289, -0.02035294174043051, -0.2957986343525729, 0.04231131477656348, 0.44751292465538794, -0.29348866089436587, -0.26860958491294185, 0.15137010433965647, -0.2007202167868993, -0.15546977302351556, 0.2944299223601189, -0.13313164753776233, 0.13794424913634182, 0.07346585424324908, 0.014911569757544893, -0.16706542717342232, -0.33143239463600566, 0.2401522067178167, 0.1833386802769629, 0.2723391525905137, -0.004174576799969299, 0.11663679572579971, -0.021057324081469896, -0.07049507135525346, -0.022576154463114124, -0.1465872267016478, 0.14996314664781726, 0.3533444238483306, 0.19997541353864184, 0.22431161106264186, -0.3543256806777948, -0.19132506886844414, 0.09293659192202139, 0.1607910976824114, 0.2389017694296268, -0.10051766745509359, -0.2050814303210384, 0.14671676712094853, -0.1566718124061373, -0.011489339030773963, -0.06535325704489724, 0.008450219122558769, 0.04095305410466331, -0.38545280871754983, 0.006997426433125668, 0.03558106485101142, 0.088124468194526, -0.014118554035075387, -0.16033467732496182, 0.10768244351986479, 0.1244719682628352, -0.010879592382017586, 0.05356397375393406, 0.037164029732378104, -0.04106655889644556, -0.15597596563304128, 0.32820909056749387, 0.028484599506956036, -0.2249883871675485, 0.11833341013032438, -0.003171820161958872, -0.08935561228811867, 0.21675198593461034, 0.22478820774230665, 0.11704300265064684, -0.11387157432490297, 0.08354262688189303, 0.010041186998408856, 0.1292926624291024, 0.08389458983694598, 0.13132326454279344, 0.1353475362283446, 0.08756100460373939, 0.07452911769446396, 0.1461441160043528, -0.00793994328606937, -0.08422103650538425, -0.2748389520635039, -0.10265797651491239, -0.18484170678055892, -0.01463947942287077, -0.13624238216868698, -0.1842158619416542, 0.3291841247741474, 0.11915435364580382, 0.08639255552000161, 0.15101865015359658, 0.3181893269184156, 0.09226594222078131, 0.08038152667291273, 0.21885824030644055, 0.14605437890208184, 0.19169438019063387, -0.022412004474140074, -0.1467645444115032, 0.053196405269742265, 0.14500997689852524] |
1,802.00964 | Spin-specific heat determination of the ratio of competing first- and
second-neighbor exchange interactions in frustrated spin-$\frac{1}{2}$ chains | The magnetic susceptibility $\chi(T)$ of spin-1/2 chains is widely used to
quantify exchange interactions, even though $\chi(T)$ is similar for different
combinations of ferromagnetic $J_1$ between first neighbors and
antiferromagnetic $J_2$ between second neighbors. We point out that the spin
specific heat $C(T)$ directly determines the ratio $\alpha = J_2/|J_1|$ of
competing interactions. The $J_1-J_2$ model is used to fit the isothermal
magnetization $M(T,H)$ and $C(T,H)$ of spin-1/2 Cu(II) chains in LiCuSbO$_4$.
By fixing $\alpha$, $C(T)$ resolves the offsetting $J_1$, $\alpha$ combinations
obtained from $M(T,H)$ in cuprates with frustrated spin chains.
| cond-mat.str-el | the magnetic susceptibility chit of spin12 chains is widely used to quantify exchange interactions even though chit is similar for different combinations of ferromagnetic j_1 between first neighbors and antiferromagnetic j_2 between second neighbors we point out that the spin specific heat ct directly determines the ratio alpha j_2j_1 of competing interactions the j_1j_2 model is used to fit the isothermal magnetization mth and cth of spin12 cuii chains in licusbo_4 by fixing alpha ct resolves the offsetting j_1 alpha combinations obtained from mth in cuprates with frustrated spin chains | [['the', 'magnetic', 'susceptibility', 'chit', 'of', 'spin12', 'chains', 'is', 'widely', 'used', 'to', 'quantify', 'exchange', 'interactions', 'even', 'though', 'chit', 'is', 'similar', 'for', 'different', 'combinations', 'of', 'ferromagnetic', 'j_1', 'between', 'first', 'neighbors', 'and', 'antiferromagnetic', 'j_2', 'between', 'second', 'neighbors', 'we', 'point', 'out', 'that', 'the', 'spin', 'specific', 'heat', 'ct', 'directly', 'determines', 'the', 'ratio', 'alpha', 'j_2j_1', 'of', 'competing', 'interactions', 'the', 'j_1j_2', 'model', 'is', 'used', 'to', 'fit', 'the', 'isothermal', 'magnetization', 'mth', 'and', 'cth', 'of', 'spin12', 'cuii', 'chains', 'in', 'licusbo_4', 'by', 'fixing', 'alpha', 'ct', 'resolves', 'the', 'offsetting', 'j_1', 'alpha', 'combinations', 'obtained', 'from', 'mth', 'in', 'cuprates', 'with', 'frustrated', 'spin', 'chains']] | [-0.2182143941314684, 0.2122449756703443, 0.08485166121455323, 0.07596575509006571, -0.07141517098579142, -0.23090196500221888, 0.05956322279913972, 0.39515270966415605, -0.2816315172240138, -0.24458796681525807, -0.023993379335540035, -0.4282419561718901, -0.03660922970933219, 0.14256402171061686, 0.18775493212872083, -0.05245313586460219, -0.07724002080762551, 0.05189896798175242, -0.12428843569424418, -0.2328092337275545, 0.25016769960315693, 0.002493647930936681, 0.24539380251533455, 0.024343845147329072, 0.05526941141838001, 0.08246299163955781, 0.17212511588198443, 0.017919361912128, -0.2217986690117363, 0.026856660736828214, 0.23311932015025782, -0.11515921239172006, 0.11024469206523564, -0.34306305444543894, -0.14144706510964575, 0.09755403742504616, 0.15213784096348618, 0.05081254383031693, 0.07645411609361569, -0.26568407240427205, 0.01831390543633865, -0.15906619065855113, -0.07485121455004749, -0.17194552625425988, -0.05696182048155202, 0.06400580487291639, -0.32092193170554106, 0.1943146655956904, 0.0939808591061996, 0.13521247308494316, -0.07881477216983007, -0.1940175708486802, -0.09097001469280157, 0.11111747872912221, 0.12385782976764151, 0.08946424876857136, 0.12149609963202643, -0.07014946426885824, -0.12847277155766884, 0.33776582143166, -0.03700435662742368, -0.11944357793933401, 0.12142545790928934, -0.20792757098873457, -0.15232072822853096, 0.12720946986228227, 0.046410523132524556, 0.06556924920943048, -0.16501991637051105, 0.1119655811939285, 0.009654680675723486, 0.24771569722183306, -0.009028772047410408, -0.0834274116146844, 0.255762076853878, 0.1477422941993508, 0.014885140463916792, 0.21234262662215364, -0.12579056601453986, -0.1426439989875588, -0.18603392179227538, -0.15280083509472508, -0.2594077457971353, 0.06892621720520159, -0.18161569137818231, -0.15041112939878884, 0.31705566826793885, 0.1852402632203949, 0.16633218359202145, -0.05379037876716918, 0.2342599256688522, 0.027943519777100946, 0.021695427177473903, 0.0610346330381516, 0.19644979253385422, 0.2319718580822357, 0.10091976087229947, -0.31140501218259387, 0.10232959174964991, 0.07704724552006358] |
1,802.00965 | Robustness of Optimal Energy Thresholds in Photon-counting Spectral CT | An important question when developing photon-counting detectors for computed
tomography is how to select energy thresholds. In this work thresholds are
optimized by maximizing signal-difference-to-noise ratio squared (SDNR2) in an
optimally weighted image and signal-to-noise ratio squared (SNR2) in a
gadolinium basis image in a silicon-strip detector and a cadmium zinc telluride
(CZT) detector, factoring in pileup and imperfect energy response in both
detectors. To investigate to what extent one single set of thresholds could be
applied in various imaging tasks, the robustness of optimal thresholds with 2
to 8 bins is examined with the variation of phantom thicknesses and target
materials. In contrast to previous studies, the optimal threshold locations
don't always increase with increasing attenuation if pileup is included.
Optimizing the thresholds for a 30 cm phantom yields near-optimal SDNR2 or SNR2
regardless of target tissue types and surrounding attenuation for both
detectors. Having more than 3 bins reduces the need for changing the thresholds
depending on anatomies and tissues. Using around 6 bins or 8 bins may give
near-optimal SDNR2 or SNR2 without generating an unnecessarily large amount of
data.
| physics.med-ph | an important question when developing photoncounting detectors for computed tomography is how to select energy thresholds in this work thresholds are optimized by maximizing signaldifferencetonoise ratio squared sdnr2 in an optimally weighted image and signaltonoise ratio squared snr2 in a gadolinium basis image in a siliconstrip detector and a cadmium zinc telluride czt detector factoring in pileup and imperfect energy response in both detectors to investigate to what extent one single set of thresholds could be applied in various imaging tasks the robustness of optimal thresholds with 2 to 8 bins is examined with the variation of phantom thicknesses and target materials in contrast to previous studies the optimal threshold locations dont always increase with increasing attenuation if pileup is included optimizing the thresholds for a 30 cm phantom yields nearoptimal sdnr2 or snr2 regardless of target tissue types and surrounding attenuation for both detectors having more than 3 bins reduces the need for changing the thresholds depending on anatomies and tissues using around 6 bins or 8 bins may give nearoptimal sdnr2 or snr2 without generating an unnecessarily large amount of data | [['an', 'important', 'question', 'when', 'developing', 'photoncounting', 'detectors', 'for', 'computed', 'tomography', 'is', 'how', 'to', 'select', 'energy', 'thresholds', 'in', 'this', 'work', 'thresholds', 'are', 'optimized', 'by', 'maximizing', 'signaldifferencetonoise', 'ratio', 'squared', 'sdnr2', 'in', 'an', 'optimally', 'weighted', 'image', 'and', 'signaltonoise', 'ratio', 'squared', 'snr2', 'in', 'a', 'gadolinium', 'basis', 'image', 'in', 'a', 'siliconstrip', 'detector', 'and', 'a', 'cadmium', 'zinc', 'telluride', 'czt', 'detector', 'factoring', 'in', 'pileup', 'and', 'imperfect', 'energy', 'response', 'in', 'both', 'detectors', 'to', 'investigate', 'to', 'what', 'extent', 'one', 'single', 'set', 'of', 'thresholds', 'could', 'be', 'applied', 'in', 'various', 'imaging', 'tasks', 'the', 'robustness', 'of', 'optimal', 'thresholds', 'with', '2', 'to', '8', 'bins', 'is', 'examined', 'with', 'the', 'variation', 'of', 'phantom', 'thicknesses', 'and', 'target', 'materials', 'in', 'contrast', 'to', 'previous', 'studies', 'the', 'optimal', 'threshold', 'locations', 'dont', 'always', 'increase', 'with', 'increasing', 'attenuation', 'if', 'pileup', 'is', 'included', 'optimizing', 'the', 'thresholds', 'for', 'a', '30', 'cm', 'phantom', 'yields', 'nearoptimal', 'sdnr2', 'or', 'snr2', 'regardless', 'of', 'target', 'tissue', 'types', 'and', 'surrounding', 'attenuation', 'for', 'both', 'detectors', 'having', 'more', 'than', '3', 'bins', 'reduces', 'the', 'need', 'for', 'changing', 'the', 'thresholds', 'depending', 'on', 'anatomies', 'and', 'tissues', 'using', 'around', '6', 'bins', 'or', '8', 'bins', 'may', 'give', 'nearoptimal', 'sdnr2', 'or', 'snr2', 'without', 'generating', 'an', 'unnecessarily', 'large', 'amount', 'of', 'data']] | [-0.058705275014150314, 0.12108476695585113, -0.007995669054542924, 0.08172693251053915, -0.004985152389393649, -0.16592057570712743, 0.038842751939108106, 0.42336263045013606, -0.18383995675645604, -0.39020721720797674, 0.08267352965169146, -0.3272317664027419, -0.05074220821440507, 0.17516133487019891, -0.0926190524536011, 0.08479827309441804, 0.06496582086041959, -0.0038242348275341832, -0.08927396997631269, -0.24911577625911438, 0.25392254391348673, 0.13401857083714516, 0.3114983953950046, 0.02188706319174054, 0.09191891758454514, 0.033714445683961876, -0.01251870369574485, 0.006356776203284715, -0.12769352148061844, 0.05123242555738806, 0.31631908945324777, 0.1401452303935702, 0.23582741473852606, -0.389663905841759, -0.17675796535331756, 0.16435574171143574, 0.16347033543394532, 0.050148486477005615, -0.04196256265189092, -0.21011845228917242, 0.11914444180873253, -0.1224985796175283, -0.07267428252457099, -0.004076139681593894, 0.012037565226149797, 0.016074909009858147, -0.29667023174300955, 0.05657638109207235, -0.007700948354245706, 0.06131310923188761, -0.07942929889259676, -0.16545249016157218, 0.018528297787230297, 0.11161992617113296, -0.006463419204030268, 0.03215140911781198, 0.18242269625297522, -0.18505053252498568, -0.07367356859945826, 0.31996172652221644, -0.012134841477366006, -0.22178132216200477, 0.1378654363932303, -0.15212099013880795, -0.05025681915723688, 0.21600958233018622, 0.1932749557129752, 0.08987137192993291, -0.13778628919257305, -0.014447875681031331, 0.04856871771447074, 0.24087210664152076, 0.13835774787578856, 0.04091470893907392, 0.15983390735953554, 0.18653024243770402, 0.0735764235212048, 0.14412255075780656, -0.17529262551541472, 0.020122907416137693, -0.2511327428222572, -0.13369747982897723, -0.12638244687344183, 0.03576065406809653, -0.11040703671332576, -0.13107534505140322, 0.3395330360885914, 0.11171940149762412, 0.22146848000005234, 0.036207953979680824, 0.29061440464395744, 0.0694920602683931, 0.0710629629390826, 0.019018630630203655, 0.25381030025124385, 0.05176327015390968, 0.08426902121045514, -0.1857075580359938, 0.06906481508349815, -0.01279434510557861] |
1,802.00966 | Persistence of perfect packing in twisted bundles of elastic filaments | It is generally understood that geometric frustration prevents maximal
hexagonal packings in uniform filament bundles upon twist. We demonstrate that
a hexagonal packed elastic filament bundle can preserve its order over a wide
range of twist due to a subtle counteraction of geometric expansion with
elastic contraction. Using x-ray scanning and by locating each filament in the
bundle, we show the remarkable persistence of order even as the twist is
increased well above 360 degrees, by measuring the spatial correlation function
across the bundle crosssection. We introduce a model which analyzes the
combined effects of elasticity including filament stretching, and radial and
hoop compression necessary to explain this generic preservation of order
observed with Hookean filaments.
| cond-mat.soft | it is generally understood that geometric frustration prevents maximal hexagonal packings in uniform filament bundles upon twist we demonstrate that a hexagonal packed elastic filament bundle can preserve its order over a wide range of twist due to a subtle counteraction of geometric expansion with elastic contraction using xray scanning and by locating each filament in the bundle we show the remarkable persistence of order even as the twist is increased well above 360 degrees by measuring the spatial correlation function across the bundle crosssection we introduce a model which analyzes the combined effects of elasticity including filament stretching and radial and hoop compression necessary to explain this generic preservation of order observed with hookean filaments | [['it', 'is', 'generally', 'understood', 'that', 'geometric', 'frustration', 'prevents', 'maximal', 'hexagonal', 'packings', 'in', 'uniform', 'filament', 'bundles', 'upon', 'twist', 'we', 'demonstrate', 'that', 'a', 'hexagonal', 'packed', 'elastic', 'filament', 'bundle', 'can', 'preserve', 'its', 'order', 'over', 'a', 'wide', 'range', 'of', 'twist', 'due', 'to', 'a', 'subtle', 'counteraction', 'of', 'geometric', 'expansion', 'with', 'elastic', 'contraction', 'using', 'xray', 'scanning', 'and', 'by', 'locating', 'each', 'filament', 'in', 'the', 'bundle', 'we', 'show', 'the', 'remarkable', 'persistence', 'of', 'order', 'even', 'as', 'the', 'twist', 'is', 'increased', 'well', 'above', '360', 'degrees', 'by', 'measuring', 'the', 'spatial', 'correlation', 'function', 'across', 'the', 'bundle', 'crosssection', 'we', 'introduce', 'a', 'model', 'which', 'analyzes', 'the', 'combined', 'effects', 'of', 'elasticity', 'including', 'filament', 'stretching', 'and', 'radial', 'and', 'hoop', 'compression', 'necessary', 'to', 'explain', 'this', 'generic', 'preservation', 'of', 'order', 'observed', 'with', 'hookean', 'filaments']] | [-0.18664249863700363, 0.1588624380824983, -0.03148176839599257, 0.03971129566419002, -0.08231751041703633, -0.07642780905509175, 0.009476815332289272, 0.4324639196395232, -0.31896783604190265, -0.2844832664985884, 0.0751437615695538, -0.2169876150578132, -0.1807870203789709, 0.11011881713006758, -0.0470754140467385, 0.03916475691547585, 0.017474247351417255, -0.0035074130864813924, -0.0873966271696002, -0.19401569122043116, 0.2877414514880692, 0.06822979398240367, 0.3006505205653255, 0.09904204377029412, 0.13111427187084637, 0.047655651871725144, 0.00590984753718407, 0.0849444964129863, -0.18311396910438157, 0.1253074477506994, 0.17574107686081772, -0.005951925390600708, 0.18495251203421503, -0.42589835306340507, -0.2174599723657593, 0.058888605008993684, 0.15334274771559084, 0.06239865413276832, 0.024319939824134305, -0.23346125466973874, 0.08616534394115724, -0.15445718183663898, -0.1509446268439582, -0.10980003079046206, 0.024468830521700197, 0.041694852959059565, -0.20370485467017338, 0.1029967963093378, 0.06398970213947529, 0.09547726214955689, -0.08441518780329779, -0.03120213426280253, -0.07230714171450457, 0.06590588807915176, 0.076266227417489, 0.07966191710900226, 0.19555826348770441, -0.12912490282103356, -0.0669286675005549, 0.4099933713642431, -0.0351526231719743, -0.13955407125217006, 0.1462360672888061, -0.16784653839944252, -0.10358961916062981, 0.197076036406135, 0.12525084262296302, 0.058052829130560736, -0.05454139442660782, 0.012356112605253844, -0.06519531837768917, 0.16702918335795403, 0.1242880897901567, -0.025729534073716736, 0.21777908277300442, 0.15607167759223778, 0.085444138879117, 0.1942339573980807, -0.12321041361428797, -0.10705307139493205, -0.30292341585977584, -0.15447734621481907, -0.11706375383675613, 0.05880936299619297, -0.12995726932685697, -0.1938783770752268, 0.3750346826574091, 0.08331633047281026, 0.2648176091707087, 0.04929526876091178, 0.264932987779973, 0.031137355722703746, 0.1472447517785597, 0.030681371331568164, 0.2554756883804783, 0.19508271399235097, 0.08400905545367378, -0.19199226681014586, 0.06078804773679967, 0.07765707664657384] |
1,802.00967 | Which Football Player Bears Most Resemblance to Messi? A Statistical
Analysis | Many pundits and fans ask themselves the same question: Which football player
bears most resemblance to Lionel Messi? Is it Chelsea's Eden Hazard? Is it
Paulo Dybala, the heir to Messi in the national team of Argentina? Or is the
most alike player to Messi someone completely else? In general, the research on
the evaluation of players' performances originated in the context of baseball
in the USA, but, currently, it is of great importance in almost every team
sport on the planet. Specifically, football clubs' managers can use the data on
player's similarity when looking for replacement of their players by other,
presumably similar ones. Also, the research in the presented direction is
certainly interesting both for football pundits and football fans. Therefore,
the aim of this study is to answer the question from the title with the use of
the statistical analysis based on the data from ongoing league season retrieved
from WhoScored (WS) database. WS provides detailed data (up to 24 parameters
such as goals scored, the number of assists, shots on goal, passes, dribbles or
fouls) for players of TOP 5 European leagues, and ranks them with respect to
their overall performance. For this study, 17 parameters (criteria) most
relevant for an attacking player were used, and a set of 28 players, candidates
to be 'most alike to Messi' from WS TOP 100 list were selected. After data
normalization and application of a proper metric function the most similar
player to Lionel Messi was found.
| stat.OT | many pundits and fans ask themselves the same question which football player bears most resemblance to lionel messi is it chelseas eden hazard is it paulo dybala the heir to messi in the national team of argentina or is the most alike player to messi someone completely else in general the research on the evaluation of players performances originated in the context of baseball in the usa but currently it is of great importance in almost every team sport on the planet specifically football clubs managers can use the data on players similarity when looking for replacement of their players by other presumably similar ones also the research in the presented direction is certainly interesting both for football pundits and football fans therefore the aim of this study is to answer the question from the title with the use of the statistical analysis based on the data from ongoing league season retrieved from whoscored ws database ws provides detailed data up to 24 parameters such as goals scored the number of assists shots on goal passes dribbles or fouls for players of top 5 european leagues and ranks them with respect to their overall performance for this study 17 parameters criteria most relevant for an attacking player were used and a set of 28 players candidates to be most alike to messi from ws top 100 list were selected after data normalization and application of a proper metric function the most similar player to lionel messi was found | [['many', 'pundits', 'and', 'fans', 'ask', 'themselves', 'the', 'same', 'question', 'which', 'football', 'player', 'bears', 'most', 'resemblance', 'to', 'lionel', 'messi', 'is', 'it', 'chelseas', 'eden', 'hazard', 'is', 'it', 'paulo', 'dybala', 'the', 'heir', 'to', 'messi', 'in', 'the', 'national', 'team', 'of', 'argentina', 'or', 'is', 'the', 'most', 'alike', 'player', 'to', 'messi', 'someone', 'completely', 'else', 'in', 'general', 'the', 'research', 'on', 'the', 'evaluation', 'of', 'players', 'performances', 'originated', 'in', 'the', 'context', 'of', 'baseball', 'in', 'the', 'usa', 'but', 'currently', 'it', 'is', 'of', 'great', 'importance', 'in', 'almost', 'every', 'team', 'sport', 'on', 'the', 'planet', 'specifically', 'football', 'clubs', 'managers', 'can', 'use', 'the', 'data', 'on', 'players', 'similarity', 'when', 'looking', 'for', 'replacement', 'of', 'their', 'players', 'by', 'other', 'presumably', 'similar', 'ones', 'also', 'the', 'research', 'in', 'the', 'presented', 'direction', 'is', 'certainly', 'interesting', 'both', 'for', 'football', 'pundits', 'and', 'football', 'fans', 'therefore', 'the', 'aim', 'of', 'this', 'study', 'is', 'to', 'answer', 'the', 'question', 'from', 'the', 'title', 'with', 'the', 'use', 'of', 'the', 'statistical', 'analysis', 'based', 'on', 'the', 'data', 'from', 'ongoing', 'league', 'season', 'retrieved', 'from', 'whoscored', 'ws', 'database', 'ws', 'provides', 'detailed', 'data', 'up', 'to', '24', 'parameters', 'such', 'as', 'goals', 'scored', 'the', 'number', 'of', 'assists', 'shots', 'on', 'goal', 'passes', 'dribbles', 'or', 'fouls', 'for', 'players', 'of', 'top', '5', 'european', 'leagues', 'and', 'ranks', 'them', 'with', 'respect', 'to', 'their', 'overall', 'performance', 'for', 'this', 'study', '17', 'parameters', 'criteria', 'most', 'relevant', 'for', 'an', 'attacking', 'player', 'were', 'used', 'and', 'a', 'set', 'of', '28', 'players', 'candidates', 'to', 'be', 'most', 'alike', 'to', 'messi', 'from', 'ws', 'top', '100', 'list', 'were', 'selected', 'after', 'data', 'normalization', 'and', 'application', 'of', 'a', 'proper', 'metric', 'function', 'the', 'most', 'similar', 'player', 'to', 'lionel', 'messi', 'was', 'found']] | [-0.027303894848558944, 0.04273877947629811, -0.09733057691937949, 0.09320035145844145, -0.11536004963051144, -0.1609768575524965, 0.09862102396353128, 0.3671762622019023, -0.2144447748780197, -0.3392513725102243, 0.1105412110526291, -0.37062796798569186, -0.12597357343744348, 0.18780767990260888, -0.11989115075559888, 0.00828916444816845, 0.09094462977768278, 0.08756013217845877, 0.06872577089988799, -0.3293956285246759, 0.29527176254325443, 0.0843445467647671, 0.27035569752194755, 0.006943908086958736, 0.03665041015579254, 0.016272064702251902, -0.07462715349828924, -0.004320337996653324, -0.10204400405203426, 0.09406296248114648, 0.3101408131872859, 0.19511294178281424, 0.3380164978469994, -0.36777919604394627, -0.08901134597371359, 0.09957732696377446, 0.04846143109796745, 0.056414847089257474, -0.005674086557605415, -0.29084306749143474, 0.06233364581647846, -0.16466516015261656, -0.09502121025156, -0.011330206837522349, 0.040812217652483426, 0.00422022489585565, -0.230607997523065, -0.034600125010237445, 0.02675653792871737, 0.09912564805536359, -0.034566404663003335, -0.16780084543411117, -0.029033794994331865, 0.2246438130318837, 0.07275016271378187, 0.056621610631576044, 0.11214958148727715, -0.15732980238028454, -0.1442242613732489, 0.4310420472481491, -0.040164745070228026, -0.11782749474849628, 0.20037885531428587, -0.15214278157072242, -0.14922484938522854, 0.07257460263258789, 0.17467326466271985, 0.08075525183824692, -0.1521486825554142, 0.004473310204197886, -0.06950132852638669, 0.15461647704937362, 0.11731551319323365, -0.048151795114936696, 0.19036533433844338, 0.16474626531849382, 0.06691487599523555, 0.09197614780735462, -0.03666055129676647, -0.12406040826015205, -0.21006437816844922, -0.14865306509589707, -0.12193741914605408, 0.025369128112205968, -0.04807220056427618, -0.1188905257151995, 0.40737778492800797, 0.14130693612765874, 0.12987861712391338, 0.009231124606477901, 0.24547830048887204, -0.014030925257822763, 0.06409057656288616, 0.07829046807225043, 0.22875450654990143, 0.02572208211408476, 0.12003422093696493, -0.13773612086009618, 0.1360316611376089, 0.030003974885380837] |
1,802.00968 | Possible gapless spin liquid in a rare-earth kagom\'{e} lattice magnet
Tm$_{3}$Sb$_{3}$Zn$_{2}$O$_{14}$ | We report the thermodynamic and muon spin relaxation ($\mu$SR) evidences for
a possible gapless spin liquid in Tm$_{3}$Sb$_{3}$Zn$_{2}$O$_{14}$, with the
rare-earth ions Tm$^{3+}$ forming a two-dimensional kagom\'{e} lattice. We
extract the magnetic specific heat of Tm$_{3}$Sb$_{3}$Zn$_{2}$O$_{14}$ by
subtracting the phonon contribution of the non-magnetic isostructural material
La$_{3}$Sb$_{3}$Zn$_{2}$O$_{14}$. We obtain a clear linear-$T$ temperature
dependence of magnetic specific heat at low temperatures, with the
heat-capacity coefficient $\gamma$ = 26.6(1) mJ mol-Tm$^{-1}$ K$^{-2}$ in the
zero temperature limit. No long-range magnetic order was observed down to 0.35
K in the heat capacity measurement. A broad hump around 9 K was observed in the
zero field magnetic specific heat and is gradually suppressed in the magnetic
fields that also create a spin gap in the specific heat. The absence of
magnetic order is further confirmed by the $\mu$SR measurement down to 20 mK.
We find that the spin-lattice relaxation time remains constant down to the
lowest temperatures. We point out that the physics in
Tm$_{3}$Sb$_{3}$Zn$_{2}$O$_{14}$ is fundamentally different from the Cu-based
herbertsmithite and propose spin liquid ground states with non-Kramers doublets
on the kagom\'{e} lattice to account for the experimental results.
| cond-mat.str-el cond-mat.mtrl-sci | we report the thermodynamic and muon spin relaxation musr evidences for a possible gapless spin liquid in tm_3sb_3zn_2o_14 with the rareearth ions tm3 forming a twodimensional kagome lattice we extract the magnetic specific heat of tm_3sb_3zn_2o_14 by subtracting the phonon contribution of the nonmagnetic isostructural material la_3sb_3zn_2o_14 we obtain a clear lineart temperature dependence of magnetic specific heat at low temperatures with the heatcapacity coefficient gamma 2661 mj moltm1 k2 in the zero temperature limit no longrange magnetic order was observed down to 035 k in the heat capacity measurement a broad hump around 9 k was observed in the zero field magnetic specific heat and is gradually suppressed in the magnetic fields that also create a spin gap in the specific heat the absence of magnetic order is further confirmed by the musr measurement down to 20 mk we find that the spinlattice relaxation time remains constant down to the lowest temperatures we point out that the physics in tm_3sb_3zn_2o_14 is fundamentally different from the cubased herbertsmithite and propose spin liquid ground states with nonkramers doublets on the kagome lattice to account for the experimental results | [['we', 'report', 'the', 'thermodynamic', 'and', 'muon', 'spin', 'relaxation', 'musr', 'evidences', 'for', 'a', 'possible', 'gapless', 'spin', 'liquid', 'in', 'tm_3sb_3zn_2o_14', 'with', 'the', 'rareearth', 'ions', 'tm3', 'forming', 'a', 'twodimensional', 'kagome', 'lattice', 'we', 'extract', 'the', 'magnetic', 'specific', 'heat', 'of', 'tm_3sb_3zn_2o_14', 'by', 'subtracting', 'the', 'phonon', 'contribution', 'of', 'the', 'nonmagnetic', 'isostructural', 'material', 'la_3sb_3zn_2o_14', 'we', 'obtain', 'a', 'clear', 'lineart', 'temperature', 'dependence', 'of', 'magnetic', 'specific', 'heat', 'at', 'low', 'temperatures', 'with', 'the', 'heatcapacity', 'coefficient', 'gamma', '2661', 'mj', 'moltm1', 'k2', 'in', 'the', 'zero', 'temperature', 'limit', 'no', 'longrange', 'magnetic', 'order', 'was', 'observed', 'down', 'to', '035', 'k', 'in', 'the', 'heat', 'capacity', 'measurement', 'a', 'broad', 'hump', 'around', '9', 'k', 'was', 'observed', 'in', 'the', 'zero', 'field', 'magnetic', 'specific', 'heat', 'and', 'is', 'gradually', 'suppressed', 'in', 'the', 'magnetic', 'fields', 'that', 'also', 'create', 'a', 'spin', 'gap', 'in', 'the', 'specific', 'heat', 'the', 'absence', 'of', 'magnetic', 'order', 'is', 'further', 'confirmed', 'by', 'the', 'musr', 'measurement', 'down', 'to', '20', 'mk', 'we', 'find', 'that', 'the', 'spinlattice', 'relaxation', 'time', 'remains', 'constant', 'down', 'to', 'the', 'lowest', 'temperatures', 'we', 'point', 'out', 'that', 'the', 'physics', 'in', 'tm_3sb_3zn_2o_14', 'is', 'fundamentally', 'different', 'from', 'the', 'cubased', 'herbertsmithite', 'and', 'propose', 'spin', 'liquid', 'ground', 'states', 'with', 'nonkramers', 'doublets', 'on', 'the', 'kagome', 'lattice', 'to', 'account', 'for', 'the', 'experimental', 'results']] | [-0.14560168745197558, 0.2747270846116432, -0.007023883809813777, 0.021765441230712206, -0.07266486350985164, -0.14699070709128234, 0.12267148861947873, 0.37049829360802433, -0.2493098258177712, -0.28965567470704384, 0.026970924589959148, -0.35375655740499495, -0.022708415925955853, 0.1792491534089267, 0.09814494357419175, -0.0007252701306463898, -0.06881631595661511, 0.03920119850380296, -0.13596103442738436, -0.19683839268982412, 0.2421265902727641, 0.04185592623150631, 0.2913694447158156, 0.1235889325267242, 0.05568680216407252, -0.03415173208970274, 0.12143070960820124, -0.002190902577461423, -0.19138986920191423, -0.01695748915348353, 0.24926614646321615, -0.10402519547103627, 0.1452035614566223, -0.3978136420048572, -0.20747134558151703, 0.04042677661605381, 0.09634630369475565, 0.134695801400655, -0.057964685048933165, -0.22440289194519455, 0.04127703479969421, -0.09927886691246483, -0.1243011313773742, -0.13960095360824787, -0.02137748834085525, -0.046268244991645315, -0.23113161061412177, 0.16736481813068904, 0.11091341406320901, 0.13844698000309133, -0.13305485074131473, -0.17252562560040402, -0.046429167791093524, 0.048340906147417186, 0.07486901148725804, 0.08917254916065046, 0.16577514714964137, -0.08662727866321802, -0.09875173343855233, 0.316613603534328, -0.10054794176343225, -0.05405995174739006, 0.14998275555821286, -0.25702292174856, -0.11986306788953575, 0.20352681853833635, 0.08548534168622683, 0.08560603821360682, -0.16614322792738676, 0.053403897181222515, -0.024455228313249915, 0.19884994992611904, 0.010210900607745389, 0.02921152060436135, 0.2834648267995264, 0.18846238314589436, 0.018646534402678546, 0.18401615809070299, -0.1885469838988659, -0.04441314873197494, -0.21895858054426875, -0.17083517710451743, -0.22365395078385197, 0.11213440437473961, -0.07558892110993494, -0.12253696428095871, 0.3714169180826158, 0.16279733009617525, 0.17829784815375868, -0.05436682245643759, 0.23945572085275843, 0.10247279296635424, 0.08601295861271618, 0.09177420953527798, 0.24885934190541456, 0.21301710357939874, 0.17574281065246544, -0.3598789750535444, 0.022530445451470645, -0.020885280392925584] |
1,802.00969 | Reconstruction of tensor categories from their structure invariants | In this paper, we study tensor (or monoidal) categories of finite rank over
an algebraically closed field $\mathbb F$. Given a tensor category
$\mathcal{C}$, we have two structure invariants of $\mathcal{C}$: the Green
ring (or the representation ring) $r(\mathcal{C})$ and the Auslander algebra
$A(\mathcal{C})$ of $\mathcal{C}$. We show that a Krull-Schmit abelian tensor
category $\mathcal{C}$ of finite rank is uniquely determined (up to tensor
equivalences) by its two structure invariants and the associated associator
system of $\mathcal{C}$. In fact, we can reconstruct the tensor category
$\mathcal{C}$ from its two invarinats and the associator system. More general,
given a quadruple $(R, A, \phi, a)$ satisfying certain conditions, where $R$ is
a $\mathbb{Z}_+$-ring of rank $n$, $A$ is a finite dimensional $\mathbb
F$-algebra with a complete set of $n$ primitive orthogonal idempotents, $\phi$
is an algebra map from $A\otimes_{\mathbb F}A$ to an algebra $M(R, A, n)$
constructed from $A$ and $R$, and $a=\{a_{i,j,l}|1< i,j,l<n\}$ is a family of
"invertible" matrices over $A$, we can construct a Krull-Schmidt and abelian
tensor category $\mathcal C$ over $\mathbb{F}$ such that $R$ is the Green ring
of $\mathcal C$ and $A$ is the Auslander algebra of $\mathcal C$. In this case,
$\mathcal C$ has finitely many indecomposable objects (up to isomorphisms) and
finite dimensional Hom-spaces. Moreover, we will give a necessary and
sufficient condition for such two tensor categories to be tensor equivalent.
| math.CT math.RA | in this paper we study tensor or monoidal categories of finite rank over an algebraically closed field mathbb f given a tensor category mathcalc we have two structure invariants of mathcalc the green ring or the representation ring rmathcalc and the auslander algebra amathcalc of mathcalc we show that a krullschmit abelian tensor category mathcalc of finite rank is uniquely determined up to tensor equivalences by its two structure invariants and the associated associator system of mathcalc in fact we can reconstruct the tensor category mathcalc from its two invarinats and the associator system more general given a quadruple r a phi a satisfying certain conditions where r is a mathbbz_ring of rank n a is a finite dimensional mathbb falgebra with a complete set of n primitive orthogonal idempotents phi is an algebra map from aotimes_mathbb fa to an algebra mr a n constructed from a and r and aa_ijl1 ijln is a family of invertible matrices over a we can construct a krullschmidt and abelian tensor category mathcal c over mathbbf such that r is the green ring of mathcal c and a is the auslander algebra of mathcal c in this case mathcal c has finitely many indecomposable objects up to isomorphisms and finite dimensional homspaces moreover we will give a necessary and sufficient condition for such two tensor categories to be tensor equivalent | [['in', 'this', 'paper', 'we', 'study', 'tensor', 'or', 'monoidal', 'categories', 'of', 'finite', 'rank', 'over', 'an', 'algebraically', 'closed', 'field', 'mathbb', 'f', 'given', 'a', 'tensor', 'category', 'mathcalc', 'we', 'have', 'two', 'structure', 'invariants', 'of', 'mathcalc', 'the', 'green', 'ring', 'or', 'the', 'representation', 'ring', 'rmathcalc', 'and', 'the', 'auslander', 'algebra', 'amathcalc', 'of', 'mathcalc', 'we', 'show', 'that', 'a', 'krullschmit', 'abelian', 'tensor', 'category', 'mathcalc', 'of', 'finite', 'rank', 'is', 'uniquely', 'determined', 'up', 'to', 'tensor', 'equivalences', 'by', 'its', 'two', 'structure', 'invariants', 'and', 'the', 'associated', 'associator', 'system', 'of', 'mathcalc', 'in', 'fact', 'we', 'can', 'reconstruct', 'the', 'tensor', 'category', 'mathcalc', 'from', 'its', 'two', 'invarinats', 'and', 'the', 'associator', 'system', 'more', 'general', 'given', 'a', 'quadruple', 'r', 'a', 'phi', 'a', 'satisfying', 'certain', 'conditions', 'where', 'r', 'is', 'a', 'mathbbz_ring', 'of', 'rank', 'n', 'a', 'is', 'a', 'finite', 'dimensional', 'mathbb', 'falgebra', 'with', 'a', 'complete', 'set', 'of', 'n', 'primitive', 'orthogonal', 'idempotents', 'phi', 'is', 'an', 'algebra', 'map', 'from', 'aotimes_mathbb', 'fa', 'to', 'an', 'algebra', 'mr', 'a', 'n', 'constructed', 'from', 'a', 'and', 'r', 'and', 'aa_ijl1', 'ijln', 'is', 'a', 'family', 'of', 'invertible', 'matrices', 'over', 'a', 'we', 'can', 'construct', 'a', 'krullschmidt', 'and', 'abelian', 'tensor', 'category', 'mathcal', 'c', 'over', 'mathbbf', 'such', 'that', 'r', 'is', 'the', 'green', 'ring', 'of', 'mathcal', 'c', 'and', 'a', 'is', 'the', 'auslander', 'algebra', 'of', 'mathcal', 'c', 'in', 'this', 'case', 'mathcal', 'c', 'has', 'finitely', 'many', 'indecomposable', 'objects', 'up', 'to', 'isomorphisms', 'and', 'finite', 'dimensional', 'homspaces', 'moreover', 'we', 'will', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'such', 'two', 'tensor', 'categories', 'to', 'be', 'tensor', 'equivalent']] | [-0.2248377359900666, 0.07668922105388126, -0.05418164607936933, 0.002990520640050984, -0.07504009129798474, -0.17929760123003427, -0.08697952329952985, 0.36798450889992934, -0.39557305327935577, -0.13757128055424314, 0.09767962717312945, -0.22028487485506015, -0.12094583475699683, 0.13021370753450276, -0.10755291534800372, -0.052877839393148274, 0.061673417985099094, 0.17682499072161506, -0.11707886040304281, -0.27170538805961, 0.4174546592626466, -0.04906165575157834, 0.20802891135139212, 0.034465024375343975, 0.13354182942476991, -0.027033582183034862, 0.004382437486286577, 0.06098166552901727, -0.13308770195975714, 0.11680425436142407, 0.32576398267389434, 0.14059899907907872, 0.1969382131762471, -0.33905967251827185, -0.05255445998510746, 0.23287269516877795, 0.12120155673941861, 0.00911339588004024, 0.006290437924432713, -0.252224875821362, 0.1747311768448937, -0.2795697745088845, -0.08201314802876924, -0.06278218115896803, 0.16086155764299304, -0.0481630958474271, -0.34735758612665973, -0.05676609538091542, 0.09384342358707021, 0.13182848861938573, -0.0740604297466338, -0.08925791297662901, -0.08805494696926751, 0.05439550731730856, -0.08470575419067486, 0.0824131830818696, 0.11167627837951188, -0.09527767091208365, -0.07028570728691201, 0.3590490095044665, -0.07873647031693222, -0.24380873504972414, 0.13153814387557705, -0.15042039334187157, -0.12004768938361986, 0.11819906058810549, 0.050550605561669286, 0.1822088288134506, -0.04079826995273244, 0.2600684777881895, -0.17319033292364583, 0.08370396572900894, 0.07686832115122172, 0.004975998145581295, 0.15791715456483266, 0.06309558957662076, 0.03458231476150968, 0.17011978367043737, 0.03834181609983475, 0.033358324136261795, -0.38789517811784463, -0.2060256084941804, -0.12381605876287548, 0.18650013569117307, -0.11821981213531578, -0.1745753242787331, 0.42378953466251423, 0.07082337766756053, 0.17762963351108915, 0.12478699121883641, 0.20731020384132182, 0.042619646508068584, 0.09482237981360185, 0.07003848863017137, 0.06931824109742427, 0.26570963387624214, -0.03759879599640052, -0.10038997716994395, -0.043401946709172363, 0.20528600815487982] |
1,802.0097 | Numerical verification of the microscopic time reversibility of Newton's
equations of motion: Fighting exponential divergence | Numerical solutions to Newton's equations of motion for chaotic self
gravitating systems of more than 2 bodies are often regarded to be
irreversible. This is due to the exponential growth of errors introduced by the
integration scheme and the numerical round-off in the least significant figure.
This secular growth of error is sometimes attributed to the increase in entropy
of the system even though Newton's equations of motion are strictly time
reversible. We demonstrate that when numerical errors are reduced to below the
physical perturbation and its exponential growth during integration the
microscopic reversibility is retrieved. Time reversibility itself is not a
guarantee for a definitive solution to the chaotic N-body problem. However,
time reversible algorithms may be used to find initial conditions for which
perturbed trajectories converge rather than diverge. The ability to calculate
such a converging pair of solutions is a striking illustration which shows that
it is possible to compute a definitive solution to a highly unstable problem.
This works as follows: If you (i) use a code which is capable of producing a
definitive solution (and which will therefore handle converging pairs of
solutions correctly), (ii) use it to study the statistical result of some other
problem, and then (iii) find that some other code produces a solution S with
statistical properties which are indistinguishable from those of the definitive
solution, then solution S may be deemed veracious.
| astro-ph.IM cs.CC nlin.CD | numerical solutions to newtons equations of motion for chaotic self gravitating systems of more than 2 bodies are often regarded to be irreversible this is due to the exponential growth of errors introduced by the integration scheme and the numerical roundoff in the least significant figure this secular growth of error is sometimes attributed to the increase in entropy of the system even though newtons equations of motion are strictly time reversible we demonstrate that when numerical errors are reduced to below the physical perturbation and its exponential growth during integration the microscopic reversibility is retrieved time reversibility itself is not a guarantee for a definitive solution to the chaotic nbody problem however time reversible algorithms may be used to find initial conditions for which perturbed trajectories converge rather than diverge the ability to calculate such a converging pair of solutions is a striking illustration which shows that it is possible to compute a definitive solution to a highly unstable problem this works as follows if you i use a code which is capable of producing a definitive solution and which will therefore handle converging pairs of solutions correctly ii use it to study the statistical result of some other problem and then iii find that some other code produces a solution s with statistical properties which are indistinguishable from those of the definitive solution then solution s may be deemed veracious | [['numerical', 'solutions', 'to', 'newtons', 'equations', 'of', 'motion', 'for', 'chaotic', 'self', 'gravitating', 'systems', 'of', 'more', 'than', '2', 'bodies', 'are', 'often', 'regarded', 'to', 'be', 'irreversible', 'this', 'is', 'due', 'to', 'the', 'exponential', 'growth', 'of', 'errors', 'introduced', 'by', 'the', 'integration', 'scheme', 'and', 'the', 'numerical', 'roundoff', 'in', 'the', 'least', 'significant', 'figure', 'this', 'secular', 'growth', 'of', 'error', 'is', 'sometimes', 'attributed', 'to', 'the', 'increase', 'in', 'entropy', 'of', 'the', 'system', 'even', 'though', 'newtons', 'equations', 'of', 'motion', 'are', 'strictly', 'time', 'reversible', 'we', 'demonstrate', 'that', 'when', 'numerical', 'errors', 'are', 'reduced', 'to', 'below', 'the', 'physical', 'perturbation', 'and', 'its', 'exponential', 'growth', 'during', 'integration', 'the', 'microscopic', 'reversibility', 'is', 'retrieved', 'time', 'reversibility', 'itself', 'is', 'not', 'a', 'guarantee', 'for', 'a', 'definitive', 'solution', 'to', 'the', 'chaotic', 'nbody', 'problem', 'however', 'time', 'reversible', 'algorithms', 'may', 'be', 'used', 'to', 'find', 'initial', 'conditions', 'for', 'which', 'perturbed', 'trajectories', 'converge', 'rather', 'than', 'diverge', 'the', 'ability', 'to', 'calculate', 'such', 'a', 'converging', 'pair', 'of', 'solutions', 'is', 'a', 'striking', 'illustration', 'which', 'shows', 'that', 'it', 'is', 'possible', 'to', 'compute', 'a', 'definitive', 'solution', 'to', 'a', 'highly', 'unstable', 'problem', 'this', 'works', 'as', 'follows', 'if', 'you', 'i', 'use', 'a', 'code', 'which', 'is', 'capable', 'of', 'producing', 'a', 'definitive', 'solution', 'and', 'which', 'will', 'therefore', 'handle', 'converging', 'pairs', 'of', 'solutions', 'correctly', 'ii', 'use', 'it', 'to', 'study', 'the', 'statistical', 'result', 'of', 'some', 'other', 'problem', 'and', 'then', 'iii', 'find', 'that', 'some', 'other', 'code', 'produces', 'a', 'solution', 's', 'with', 'statistical', 'properties', 'which', 'are', 'indistinguishable', 'from', 'those', 'of', 'the', 'definitive', 'solution', 'then', 'solution', 's', 'may', 'be', 'deemed', 'veracious']] | [-0.11413118931121627, 0.08643280156358177, -0.11840461840419549, 0.09146855885347609, -0.07680334534158866, -0.16853551124423294, 0.021329932856164743, 0.3170089384095326, -0.29708283820494624, -0.2843767667173183, 0.14567952823789052, -0.27300333472546834, -0.1297558202129259, 0.21714134777069155, -0.06846873014402607, 0.07334228837034656, 0.09930525614542822, 0.03849301233803372, -0.06228855670482956, -0.24516434929130904, 0.2771691649084397, 0.06132410610383698, 0.20753675064670146, 0.008603985347094592, 0.0826916445492253, -0.08807787754681315, -0.009460567717504656, 0.05452379854651899, -0.1101749767975544, 0.07566978642466109, 0.23359136593102575, 0.14132772308497304, 0.2882738408616519, -0.4147806001851207, -0.19017750238758865, 0.1216682639838084, 0.15882743276045497, 0.16312709864648461, -0.047580816416139614, -0.23614644413364344, 0.13020099765281914, -0.1404575554183323, -0.16495949744270985, -0.102042754987608, 0.05857803359435036, 0.02204448472059147, -0.28093988701885825, 0.09676162644735023, 0.0897944717756312, -0.005692892629605043, -0.059204382546434724, -0.04373988799363423, -0.017998193795110324, 0.09765569640663231, 0.0794078280721743, 0.033718128971643106, 0.11260337465149671, -0.0897894223353119, -0.08332677374409254, 0.41967575476657404, -0.03960119457958077, -0.2360204412272714, 0.20408642569512675, -0.12370284112041881, -0.09376407742644821, 0.1790803849660984, 0.1377486999448718, 0.12898267674107297, -0.14863603308342513, 0.041024248586397555, 0.006443936395828195, 0.20491174515688004, 0.06769481612016158, 0.009462872742821265, 0.19027147251923954, 0.12180184510913838, 0.10285340876976863, 0.09812449351864352, -0.007384916552711792, -0.13629036608422054, -0.2948186765986912, -0.17478512960148912, -0.168962848710964, 0.09031652248217895, -0.06630486167128326, -0.20505732955662725, 0.3494600119578504, 0.16701190922397252, 0.18006426047790666, 0.07261954116934091, 0.2850813381514384, 0.1432392762984944, 0.04831873171095704, 0.08551217521587738, 0.2499501404840728, 0.08600458502669112, 0.08724912483614453, -0.2174062677066982, 0.09797579265432432, 0.06729855726308447] |
1,802.00971 | Consistency and convergence of simulation schemes in Information field
dynamics | We explore a new simulation scheme for partial differential equations (PDE's)
called Information Field Dynamics (IFD). Information field dynamics attempts to
improve on existing simulation schemes by incorporating Bayesian field
inference, which seeks to preserve the maximum amount of information about the
field being simulated. The field inference is truly Bayesian and thus depends
on a notion of prior belief. Here, we analytically prove that a restricted
subset of simulation schemes in IFD are consistent, and thus deliver valid
predictions in the limit of high resolutions. This has not previously been done
for any IFD schemes. This restricted subset is roughly analogous to traditional
fixed-grid numerical PDE solvers, given the additional restriction of
translational symmetry. Furthermore, given an arbitrary IFD scheme modelling a
PDE, it is a-priori not obvious to what order the scheme is accurate in space
and time. For this subset of models, we also derive an easy rule-of-thumb for
determining the order of accuracy of the simulation. As with all analytic
consistency analysis, an analysis for nontrivial systems is intractable, thus
these results are intended as a general indicator of the validity of the
approach, and it is hoped that the results will generalize.
| astro-ph.IM | we explore a new simulation scheme for partial differential equations pdes called information field dynamics ifd information field dynamics attempts to improve on existing simulation schemes by incorporating bayesian field inference which seeks to preserve the maximum amount of information about the field being simulated the field inference is truly bayesian and thus depends on a notion of prior belief here we analytically prove that a restricted subset of simulation schemes in ifd are consistent and thus deliver valid predictions in the limit of high resolutions this has not previously been done for any ifd schemes this restricted subset is roughly analogous to traditional fixedgrid numerical pde solvers given the additional restriction of translational symmetry furthermore given an arbitrary ifd scheme modelling a pde it is apriori not obvious to what order the scheme is accurate in space and time for this subset of models we also derive an easy ruleofthumb for determining the order of accuracy of the simulation as with all analytic consistency analysis an analysis for nontrivial systems is intractable thus these results are intended as a general indicator of the validity of the approach and it is hoped that the results will generalize | [['we', 'explore', 'a', 'new', 'simulation', 'scheme', 'for', 'partial', 'differential', 'equations', 'pdes', 'called', 'information', 'field', 'dynamics', 'ifd', 'information', 'field', 'dynamics', 'attempts', 'to', 'improve', 'on', 'existing', 'simulation', 'schemes', 'by', 'incorporating', 'bayesian', 'field', 'inference', 'which', 'seeks', 'to', 'preserve', 'the', 'maximum', 'amount', 'of', 'information', 'about', 'the', 'field', 'being', 'simulated', 'the', 'field', 'inference', 'is', 'truly', 'bayesian', 'and', 'thus', 'depends', 'on', 'a', 'notion', 'of', 'prior', 'belief', 'here', 'we', 'analytically', 'prove', 'that', 'a', 'restricted', 'subset', 'of', 'simulation', 'schemes', 'in', 'ifd', 'are', 'consistent', 'and', 'thus', 'deliver', 'valid', 'predictions', 'in', 'the', 'limit', 'of', 'high', 'resolutions', 'this', 'has', 'not', 'previously', 'been', 'done', 'for', 'any', 'ifd', 'schemes', 'this', 'restricted', 'subset', 'is', 'roughly', 'analogous', 'to', 'traditional', 'fixedgrid', 'numerical', 'pde', 'solvers', 'given', 'the', 'additional', 'restriction', 'of', 'translational', 'symmetry', 'furthermore', 'given', 'an', 'arbitrary', 'ifd', 'scheme', 'modelling', 'a', 'pde', 'it', 'is', 'apriori', 'not', 'obvious', 'to', 'what', 'order', 'the', 'scheme', 'is', 'accurate', 'in', 'space', 'and', 'time', 'for', 'this', 'subset', 'of', 'models', 'we', 'also', 'derive', 'an', 'easy', 'ruleofthumb', 'for', 'determining', 'the', 'order', 'of', 'accuracy', 'of', 'the', 'simulation', 'as', 'with', 'all', 'analytic', 'consistency', 'analysis', 'an', 'analysis', 'for', 'nontrivial', 'systems', 'is', 'intractable', 'thus', 'these', 'results', 'are', 'intended', 'as', 'a', 'general', 'indicator', 'of', 'the', 'validity', 'of', 'the', 'approach', 'and', 'it', 'is', 'hoped', 'that', 'the', 'results', 'will', 'generalize']] | [-0.11398879099497808, 0.018528209669089423, -0.11435945924882054, 0.0921400227332204, -0.1219772587360124, -0.13178353406592902, 0.038524849314318245, 0.3742865921343265, -0.25203095647733337, -0.30247651227291317, 0.11976277767645128, -0.21268309556068332, -0.13363423011251513, 0.20912249643606168, -0.07553434576177355, 0.08792407448086793, 0.06395382552508068, 0.0428938716980936, -0.07494007956784994, -0.26505710282906664, 0.30565612368890777, 0.06719195998514893, 0.28509259986724267, 0.02610920281338548, 0.14318567644426514, -0.0017149091773869724, -0.05541442926213155, 0.03698786746383749, -0.1601905323554517, 0.10696004214873868, 0.2595113302485317, 0.15936107674925612, 0.2901112555010897, -0.40704623114336563, -0.23630750765503966, 0.09484882136868303, 0.1635227007761853, 0.15460985595878063, -0.008117252854431795, -0.25697262662694537, 0.107498521510592, -0.1572720995302865, -0.1254996088390158, -0.12851371053313165, -0.013424789466242764, 0.0015196362628511668, -0.30583623073508176, 0.052982245641494605, 0.06041955801559054, 0.059310800204034904, -0.04056274732291169, -0.07070613500182305, 0.01612981838684737, 0.1135096028518064, 0.0161347348842766, 0.047259485933499476, 0.06361949088839049, -0.1158374047065201, -0.11709693062880318, 0.37248527087379946, -0.022778661096667124, -0.2779901051127971, 0.16540069781068883, -0.09908275075757943, -0.14285621969832987, 0.1471114777203479, 0.14767543171641184, 0.13674196056657598, -0.15020274164788613, 0.08848865926242079, -0.06770603758516971, 0.1861664890553944, 0.0023428005010343446, 0.015053502014225945, 0.1406625832134366, 0.16426778909263348, 0.07999191700532882, 0.08223841343840896, -0.031338487773055805, -0.1441631873036607, -0.32388245022198575, -0.15707641440320483, -0.16435079020979876, 0.021557258123084004, -0.09052666058916915, -0.1399621970923192, 0.34341796000355806, 0.23021895427323008, 0.13199414050461827, 0.07254677122579367, 0.3306974853403148, 0.13628536939200223, 0.04358503550496709, 0.08515800022742319, 0.20866282773558711, 0.14447477691674482, 0.06857599159655384, -0.18336722832456762, 0.0892052118557737, 0.04760883517591708] |
1,802.00972 | Unveiling Relationships Between Crime and Property in England and Wales
Via Density Scale-Adjusted Metrics and Network Tools | Scale-adjusted metrics (SAMs) are a significant achievement of the urban
scaling hypothesis. SAMs remove the inherent biases of per capita measures
computed in the absence of isometric allometries. However, this approach is
limited to urban areas, while a large portion of the world's population still
lives outside cities and rural areas dominate land use worldwide. Here, we
extend the concept of SAMs to population density scale-adjusted metrics (DSAMs)
to reveal relationships among different types of crime and property metrics.
Our approach allows all human environments to be considered, avoids problems in
the definition of urban areas, and accounts for the heterogeneity of population
distributions within urban regions. By combining DSAMs, cross-correlation, and
complex network analysis, we find that crime and property types have intricate
and hierarchically organized relationships leading to some striking
conclusions. Drugs and burglary had uncorrelated DSAMs and, to the extent
property transaction values are indicators of affluence, twelve out of fourteen
crime metrics showed no evidence of specifically targeting affluence. Burglary
and robbery were the most connected in our network analysis and the modular
structures suggest an alternative to "zero-tolerance" policies by unveiling the
crime and/or property types most likely to affect each other.
| physics.soc-ph physics.data-an | scaleadjusted metrics sams are a significant achievement of the urban scaling hypothesis sams remove the inherent biases of per capita measures computed in the absence of isometric allometries however this approach is limited to urban areas while a large portion of the worlds population still lives outside cities and rural areas dominate land use worldwide here we extend the concept of sams to population density scaleadjusted metrics dsams to reveal relationships among different types of crime and property metrics our approach allows all human environments to be considered avoids problems in the definition of urban areas and accounts for the heterogeneity of population distributions within urban regions by combining dsams crosscorrelation and complex network analysis we find that crime and property types have intricate and hierarchically organized relationships leading to some striking conclusions drugs and burglary had uncorrelated dsams and to the extent property transaction values are indicators of affluence twelve out of fourteen crime metrics showed no evidence of specifically targeting affluence burglary and robbery were the most connected in our network analysis and the modular structures suggest an alternative to zerotolerance policies by unveiling the crime andor property types most likely to affect each other | [['scaleadjusted', 'metrics', 'sams', 'are', 'a', 'significant', 'achievement', 'of', 'the', 'urban', 'scaling', 'hypothesis', 'sams', 'remove', 'the', 'inherent', 'biases', 'of', 'per', 'capita', 'measures', 'computed', 'in', 'the', 'absence', 'of', 'isometric', 'allometries', 'however', 'this', 'approach', 'is', 'limited', 'to', 'urban', 'areas', 'while', 'a', 'large', 'portion', 'of', 'the', 'worlds', 'population', 'still', 'lives', 'outside', 'cities', 'and', 'rural', 'areas', 'dominate', 'land', 'use', 'worldwide', 'here', 'we', 'extend', 'the', 'concept', 'of', 'sams', 'to', 'population', 'density', 'scaleadjusted', 'metrics', 'dsams', 'to', 'reveal', 'relationships', 'among', 'different', 'types', 'of', 'crime', 'and', 'property', 'metrics', 'our', 'approach', 'allows', 'all', 'human', 'environments', 'to', 'be', 'considered', 'avoids', 'problems', 'in', 'the', 'definition', 'of', 'urban', 'areas', 'and', 'accounts', 'for', 'the', 'heterogeneity', 'of', 'population', 'distributions', 'within', 'urban', 'regions', 'by', 'combining', 'dsams', 'crosscorrelation', 'and', 'complex', 'network', 'analysis', 'we', 'find', 'that', 'crime', 'and', 'property', 'types', 'have', 'intricate', 'and', 'hierarchically', 'organized', 'relationships', 'leading', 'to', 'some', 'striking', 'conclusions', 'drugs', 'and', 'burglary', 'had', 'uncorrelated', 'dsams', 'and', 'to', 'the', 'extent', 'property', 'transaction', 'values', 'are', 'indicators', 'of', 'affluence', 'twelve', 'out', 'of', 'fourteen', 'crime', 'metrics', 'showed', 'no', 'evidence', 'of', 'specifically', 'targeting', 'affluence', 'burglary', 'and', 'robbery', 'were', 'the', 'most', 'connected', 'in', 'our', 'network', 'analysis', 'and', 'the', 'modular', 'structures', 'suggest', 'an', 'alternative', 'to', 'zerotolerance', 'policies', 'by', 'unveiling', 'the', 'crime', 'andor', 'property', 'types', 'most', 'likely', 'to', 'affect', 'each', 'other']] | [-0.08380583358206312, 0.06493882529803716, -0.07410581118655296, 0.135573942382934, -0.05962539733653622, -0.09340545410594465, 0.07451108862094734, 0.3798990115352279, -0.19304717823682466, -0.3411087440944524, 0.0886273657141624, -0.32468970075889064, -0.18807059455584563, 0.18717542596218384, -0.1271487505339105, -0.003197145139206348, 0.03746448797102524, -0.03592649644967739, 0.008440359162371035, -0.2631498621783753, 0.325395621872526, 0.0289268852318447, 0.34467507267551384, 0.058237043629894604, 0.06626275444966954, -0.061112483925357154, -0.12169582513398586, 0.03038109647827603, -0.10179900493828742, 0.13888635523813272, 0.3190657776769735, 0.16289985359602427, 0.31232590471841015, -0.41412583820768917, -0.2442429492972335, 0.12073227600695664, 0.11438572664308, 0.047759827455667286, 0.014558713179917969, -0.2969417400059423, 0.06752053403137584, -0.17553093889253024, -0.13299740046056044, -0.061697138996666526, 0.0275771525740886, 0.02771620809222923, -0.20315202205365865, 0.10065022942001875, 0.012140251277964942, 0.09274247965575862, -0.06274545251074656, -0.1140247136615787, -0.047997905913151194, 0.21576072094363294, 0.08223892761066517, -0.04880622392330242, 0.17849340006157907, -0.11770464540625523, -0.11547812067354764, 0.34946022282517275, 0.021981155964289317, -0.151937882540681, 0.21832693997492578, -0.1455202641260183, -0.18383917717348633, 0.09084241854369032, 0.19817409204165878, 0.05117597209963216, -0.1730020238319412, -0.00840706143074441, -0.009650291546547254, 0.16646551538872942, 0.0774508648639906, 0.034468012082043614, 0.1998254260266846, 0.16647036739967155, 0.07093980139488477, 0.07334745476320528, -0.09441426743715241, -0.11676745173255247, -0.18840927890459153, -0.1288482963739495, -0.08864377220773034, 0.012390738862747212, -0.135382427094351, -0.1647982781952513, 0.3843427811967855, 0.1485358711500766, 0.15222551004381432, 0.06606150273594777, 0.24085271200022604, -0.01861935693946458, 0.1343966254142436, 0.08276582839756216, 0.1595361007584499, 0.04621164641124481, 0.08106105391539595, -0.15156505934238357, 0.14842427390085874, -0.02308586881108753] |
1,802.00973 | Is molecular cloud turbulence driven by external supernova explosions? | We present high-resolution ($\sim$ 0.1 pc), hydrodynamical and
magnetohydrodynamical simulations to investigate whether the observed level of
molecular cloud (MC) turbulence can be generated and maintained by external
supernova (SN) explosions. The MCs are formed self-consistently within their
large-scale galactic environment following the non-equilibrium formation of
H$_2$ and CO including (self-) shielding and important heating and cooling
processes. The MCs inherit their initial level of turbulence from the diffuse
ISM, where turbulence is injected by SN explosions. However, by systematically
exploring the effect of individual SNe going off outside the clouds, we show
that at later stages the importance of SN driven turbulence is decreased
significantly. This holds for different MC masses as well as MCs with and
without magnetic fields. The SN impact also decreases rapidly with larger
distances. Nearby SNe ($d$ $\sim$ 25 pc) boost the turbulent velocity
dispersions of the MC by up to 70 per cent (up to a few km s$^{-1}$). For $d$
$>$ 50 pc, however, their impact decreases fast with increasing $d$ and is
almost negligible. For all probed distances the gain in velocity dispersion
decays rapidly within a few 100 kyr. This is significantly shorter than the
average timescale for a MC to be hit by a nearby SN under solar neighbourhood
conditions ($\sim$ 2 Myr). Hence, at these conditions SNe are not able to
sustain the observed level of MC turbulence. However, in environments with high
gas surface densities and SN rates like the Central Molecular Zone, observed
elevated MC dispersions could be triggered by external SNe.
| astro-ph.GA astro-ph.SR | we present highresolution sim 01 pc hydrodynamical and magnetohydrodynamical simulations to investigate whether the observed level of molecular cloud mc turbulence can be generated and maintained by external supernova sn explosions the mcs are formed selfconsistently within their largescale galactic environment following the nonequilibrium formation of h_2 and co including self shielding and important heating and cooling processes the mcs inherit their initial level of turbulence from the diffuse ism where turbulence is injected by sn explosions however by systematically exploring the effect of individual sne going off outside the clouds we show that at later stages the importance of sn driven turbulence is decreased significantly this holds for different mc masses as well as mcs with and without magnetic fields the sn impact also decreases rapidly with larger distances nearby sne d sim 25 pc boost the turbulent velocity dispersions of the mc by up to 70 per cent up to a few km s1 for d 50 pc however their impact decreases fast with increasing d and is almost negligible for all probed distances the gain in velocity dispersion decays rapidly within a few 100 kyr this is significantly shorter than the average timescale for a mc to be hit by a nearby sn under solar neighbourhood conditions sim 2 myr hence at these conditions sne are not able to sustain the observed level of mc turbulence however in environments with high gas surface densities and sn rates like the central molecular zone observed elevated mc dispersions could be triggered by external sne | [['we', 'present', 'highresolution', 'sim', '01', 'pc', 'hydrodynamical', 'and', 'magnetohydrodynamical', 'simulations', 'to', 'investigate', 'whether', 'the', 'observed', 'level', 'of', 'molecular', 'cloud', 'mc', 'turbulence', 'can', 'be', 'generated', 'and', 'maintained', 'by', 'external', 'supernova', 'sn', 'explosions', 'the', 'mcs', 'are', 'formed', 'selfconsistently', 'within', 'their', 'largescale', 'galactic', 'environment', 'following', 'the', 'nonequilibrium', 'formation', 'of', 'h_2', 'and', 'co', 'including', 'self', 'shielding', 'and', 'important', 'heating', 'and', 'cooling', 'processes', 'the', 'mcs', 'inherit', 'their', 'initial', 'level', 'of', 'turbulence', 'from', 'the', 'diffuse', 'ism', 'where', 'turbulence', 'is', 'injected', 'by', 'sn', 'explosions', 'however', 'by', 'systematically', 'exploring', 'the', 'effect', 'of', 'individual', 'sne', 'going', 'off', 'outside', 'the', 'clouds', 'we', 'show', 'that', 'at', 'later', 'stages', 'the', 'importance', 'of', 'sn', 'driven', 'turbulence', 'is', 'decreased', 'significantly', 'this', 'holds', 'for', 'different', 'mc', 'masses', 'as', 'well', 'as', 'mcs', 'with', 'and', 'without', 'magnetic', 'fields', 'the', 'sn', 'impact', 'also', 'decreases', 'rapidly', 'with', 'larger', 'distances', 'nearby', 'sne', 'd', 'sim', '25', 'pc', 'boost', 'the', 'turbulent', 'velocity', 'dispersions', 'of', 'the', 'mc', 'by', 'up', 'to', '70', 'per', 'cent', 'up', 'to', 'a', 'few', 'km', 's1', 'for', 'd', '50', 'pc', 'however', 'their', 'impact', 'decreases', 'fast', 'with', 'increasing', 'd', 'and', 'is', 'almost', 'negligible', 'for', 'all', 'probed', 'distances', 'the', 'gain', 'in', 'velocity', 'dispersion', 'decays', 'rapidly', 'within', 'a', 'few', '100', 'kyr', 'this', 'is', 'significantly', 'shorter', 'than', 'the', 'average', 'timescale', 'for', 'a', 'mc', 'to', 'be', 'hit', 'by', 'a', 'nearby', 'sn', 'under', 'solar', 'neighbourhood', 'conditions', 'sim', '2', 'myr', 'hence', 'at', 'these', 'conditions', 'sne', 'are', 'not', 'able', 'to', 'sustain', 'the', 'observed', 'level', 'of', 'mc', 'turbulence', 'however', 'in', 'environments', 'with', 'high', 'gas', 'surface', 'densities', 'and', 'sn', 'rates', 'like', 'the', 'central', 'molecular', 'zone', 'observed', 'elevated', 'mc', 'dispersions', 'could', 'be', 'triggered', 'by', 'external', 'sne']] | [-0.0876258365720894, 0.20308854834852266, 0.008039674174734482, 0.09745919636185921, -0.011250965532791965, -0.06881352015862278, 0.06674145894015536, 0.40994357875749177, -0.24671516092676743, -0.347953919580608, 0.04036517027747251, -0.2564873775437602, 0.02438963595229913, 0.2110447775759716, 0.0390895445265022, -0.04668632439684634, 0.08540401255584085, -0.06956262831375296, -0.08463194753481623, -0.2623678099478175, 0.26457871961608237, 0.13885784521972871, 0.2047362791867379, 0.010463279439364651, 0.05887924071090917, -0.15009543774238623, -0.01646283637668353, -0.0012272851212936288, -0.1516760576673037, 0.013846205214412847, 0.17700964922214374, 0.09852299411306341, 0.2573048571745555, -0.4493956632747808, -0.2735363552502046, 0.062182611237307464, 0.2284609977223833, 0.0476717165433893, -0.04279233409895324, -0.2662715934700899, 0.13749395510747883, -0.2030851805637426, -0.17596523286592142, 0.07454266317973973, 0.050007363561285184, 0.06246084219401739, -0.22744720963049023, 0.1715475746141701, 0.00015147155945134514, 0.10938750018237853, -0.06976203056892344, -0.09264299733171641, -0.06876878305703547, 0.062070385949667906, 0.03406876618157862, 0.0852908300618212, 0.22177587921785957, -0.13280239503319358, 0.02072742906782557, 0.4425938458912367, -0.0484897921987759, -0.04142264095226339, 0.249275968682167, -0.22132610280395432, -0.08284186848220142, 0.2058098540696151, 0.15962678893211335, 0.0696444281879082, -0.1325529111978397, -0.02312343841436885, 0.027365551264408757, 0.14739765647511163, 0.053752844059365056, 0.04565787941035381, 0.2524365173068409, 0.14529679218562794, 0.0072849060920085395, 0.05097551226510904, -0.20231212866401263, -0.05256944641324819, -0.21128425341026455, -0.10546400251195712, -0.12020188696801151, 0.1354209125992116, -0.13841951872158212, -0.06934448011018628, 0.2833785917153399, 0.15086311891711518, 0.2127342094028113, 0.012488033370498348, 0.2951032065037711, 0.07585766772675676, 0.11020030427048458, 0.17862574170950193, 0.287072636610737, 0.15505375735479973, 0.10151378898972682, -0.2281209850106297, 0.10039249693280926, -0.011639412868694932] |
1,802.00974 | Parametric Presburger Arithmetic: Complexity of Counting and Quantifier
Elimination | We consider an expansion of Presburger arithmetic which allows multiplication
by $k$ parameters $t_1,\ldots,t_k$. A formula in this language defines a
parametric set $S_\mathbf{t} \subseteq \mathbb{Z}^{d}$ as $\mathbf{t}$ varies
in $\mathbb{Z}^k$, and we examine the counting function $|S_\mathbf{t}|$ as a
function of $\mathbf{t}$. For a single parameter, it is known that $|S_t|$ can
be expressed as an eventual quasi-polynomial (there is a period $m$ such that,
for sufficiently large $t$, the function is polynomial on each of the residue
classes mod $m$). We show that such a nice expression is impossible with 2 or
more parameters. Indeed (assuming \textbf{P} $\neq$ \textbf{NP}) we construct a
parametric set $S_{t_1,t_2}$ such that $|S_{t_1, t_2}|$ is not even
polynomial-time computable on input $(t_1,t_2)$. In contrast, for parametric
sets $S_\mathbf{t} \subseteq \mathbb{Z}^d$ with arbitrarily many parameters,
defined in a similar language without the ordering relation, we show that
$|S_\mathbf{t}|$ is always polynomial-time computable in the size of
$\mathbf{t}$, and in fact can be represented using the gcd and similar
functions.
| math.LO cs.CC math.CO | we consider an expansion of presburger arithmetic which allows multiplication by k parameters t_1ldotst_k a formula in this language defines a parametric set s_mathbft subseteq mathbbzd as mathbft varies in mathbbzk and we examine the counting function s_mathbft as a function of mathbft for a single parameter it is known that s_t can be expressed as an eventual quasipolynomial there is a period m such that for sufficiently large t the function is polynomial on each of the residue classes mod m we show that such a nice expression is impossible with 2 or more parameters indeed assuming textbfp neq textbfnp we construct a parametric set s_t_1t_2 such that s_t_1 t_2 is not even polynomialtime computable on input t_1t_2 in contrast for parametric sets s_mathbft subseteq mathbbzd with arbitrarily many parameters defined in a similar language without the ordering relation we show that s_mathbft is always polynomialtime computable in the size of mathbft and in fact can be represented using the gcd and similar functions | [['we', 'consider', 'an', 'expansion', 'of', 'presburger', 'arithmetic', 'which', 'allows', 'multiplication', 'by', 'k', 'parameters', 't_1ldotst_k', 'a', 'formula', 'in', 'this', 'language', 'defines', 'a', 'parametric', 'set', 's_mathbft', 'subseteq', 'mathbbzd', 'as', 'mathbft', 'varies', 'in', 'mathbbzk', 'and', 'we', 'examine', 'the', 'counting', 'function', 's_mathbft', 'as', 'a', 'function', 'of', 'mathbft', 'for', 'a', 'single', 'parameter', 'it', 'is', 'known', 'that', 's_t', 'can', 'be', 'expressed', 'as', 'an', 'eventual', 'quasipolynomial', 'there', 'is', 'a', 'period', 'm', 'such', 'that', 'for', 'sufficiently', 'large', 't', 'the', 'function', 'is', 'polynomial', 'on', 'each', 'of', 'the', 'residue', 'classes', 'mod', 'm', 'we', 'show', 'that', 'such', 'a', 'nice', 'expression', 'is', 'impossible', 'with', '2', 'or', 'more', 'parameters', 'indeed', 'assuming', 'textbfp', 'neq', 'textbfnp', 'we', 'construct', 'a', 'parametric', 'set', 's_t_1t_2', 'such', 'that', 's_t_1', 't_2', 'is', 'not', 'even', 'polynomialtime', 'computable', 'on', 'input', 't_1t_2', 'in', 'contrast', 'for', 'parametric', 'sets', 's_mathbft', 'subseteq', 'mathbbzd', 'with', 'arbitrarily', 'many', 'parameters', 'defined', 'in', 'a', 'similar', 'language', 'without', 'the', 'ordering', 'relation', 'we', 'show', 'that', 's_mathbft', 'is', 'always', 'polynomialtime', 'computable', 'in', 'the', 'size', 'of', 'mathbft', 'and', 'in', 'fact', 'can', 'be', 'represented', 'using', 'the', 'gcd', 'and', 'similar', 'functions']] | [-0.16850133749256024, 0.13886964214534822, -0.051253066454991336, 0.08688770947344715, -0.06306114873320727, -0.15135880966284654, 0.030006071531338753, 0.37556137888771823, -0.3258815484587103, -0.22380739742344835, 0.05323498540063866, -0.24155118754247157, -0.1500720026201523, 0.21873221423039668, -0.08610828543151444, 0.027624018067954018, 0.024791665379491793, 0.0974835672915527, -0.07209444346428825, -0.2298631165375388, 0.2857639507842023, -0.07011526809982592, 0.1649841953227978, 0.018602047253275154, 0.11774880557729886, 0.02396635672009391, 0.05102676367752748, 0.03149634523802755, -0.1481943154795306, 0.02191072735344855, 0.2764240794732781, 0.18015280402288203, 0.24520267776736035, -0.35130560892157076, -0.1286789533552975, 0.2153769598644874, 0.15254723984271107, 0.04198619645165575, 0.009620173144556736, -0.18716328540567037, 0.12873242274721766, -0.1675918879971993, -0.09573562153353833, -0.07654450143255838, 0.09294140750610429, 0.035048526650714895, -0.3585320654702827, 0.014568460954739371, 0.1291063627478008, 0.06858412181481538, -0.005818541051334384, -0.13020904826159338, -0.00897076447130885, 0.0646222876910143, -0.0385856106032606, 0.11352156257688455, 0.056685071357628104, -0.09694267260322416, -0.0896368627521641, 0.3627698211806469, -0.10803291989808403, -0.2443195983722079, 0.12253507595188438, -0.14052156038957125, -0.16045589984122027, 0.08615442961681544, 0.08235965852012359, 0.14963720307867157, -0.08413832545672294, 0.18111168601012095, -0.13854260912744282, 0.20894627051609682, 0.12707995520563933, -0.004073585517045747, 0.12864324217094336, 0.11643099926253099, 0.08000025608138148, 0.14522249892953124, 0.0059774630424771005, -0.021434448171043542, -0.32957709167811383, -0.13706332803334723, -0.20779717204596837, 0.11071601858308962, -0.12664389010370075, -0.20438503979409978, 0.33367846731846107, 0.09019373191191202, 0.23411942243458214, 0.13550299679840597, 0.2220198064701768, 0.15878989580871747, 0.06777306629471529, 0.0989158621977833, 0.08841169716239475, 0.07422844134980994, -0.035877538492857686, -0.1600880553667638, 0.11493034615101884, 0.10343168370096331] |
1,802.00975 | Origin of the size-dependence of the equilibrium van der Waals binding
between nanostructures | Nanostructures can be bound together at equilibrium by the van der Waals
(vdW) effect, a small but ubiquitous many-body attraction that presents
challenges to density functional theory. How does the binding energy depend
upon the size or number of atoms in one of a pair of identical nanostructures?
To answer this question, we treat each nanostructure properly as a whole
object, not as a collection of atoms. Our calculations start from an accurate
static dipole polarizability for each considered nanostructure, and an accurate
equilibrium center-to-center distance for the pair (the latter from experiment,
or from the vdW-DF-cx functional). We consider the competition in each term
$-C_{2k}/d^{2k}$ ($k=3, 4, 5$) of the long-range vdW series for the interaction
energy, between the size dependence of the vdW coefficient $C_{2k}$ and that of
the $2k$-th power of the center-to-center distance $d$. The damping of these
vdW terms can be negligible, but in any case it does not affect the size
dependence for a given term in the absence of non-vdW binding. To our surprise,
the vdW energy can be size-independent for quasi-spherical nanoclusters bound
to one another by vdW interaction, even with strong nonadditivity of the vdW
coefficient, as demonstrated for fullerenes. We also show that, for
low-dimensional systems, the vdW interaction yields the strongest
size-dependence, in stark contrast to that of fullerenes. We illustrate this
with parallel planar polycyclic aromatic hydrocarbons. Other cases are between,
as shown by sodium clusters.
| physics.chem-ph | nanostructures can be bound together at equilibrium by the van der waals vdw effect a small but ubiquitous manybody attraction that presents challenges to density functional theory how does the binding energy depend upon the size or number of atoms in one of a pair of identical nanostructures to answer this question we treat each nanostructure properly as a whole object not as a collection of atoms our calculations start from an accurate static dipole polarizability for each considered nanostructure and an accurate equilibrium centertocenter distance for the pair the latter from experiment or from the vdwdfcx functional we consider the competition in each term c_2kd2k k3 4 5 of the longrange vdw series for the interaction energy between the size dependence of the vdw coefficient c_2k and that of the 2kth power of the centertocenter distance d the damping of these vdw terms can be negligible but in any case it does not affect the size dependence for a given term in the absence of nonvdw binding to our surprise the vdw energy can be sizeindependent for quasispherical nanoclusters bound to one another by vdw interaction even with strong nonadditivity of the vdw coefficient as demonstrated for fullerenes we also show that for lowdimensional systems the vdw interaction yields the strongest sizedependence in stark contrast to that of fullerenes we illustrate this with parallel planar polycyclic aromatic hydrocarbons other cases are between as shown by sodium clusters | [['nanostructures', 'can', 'be', 'bound', 'together', 'at', 'equilibrium', 'by', 'the', 'van', 'der', 'waals', 'vdw', 'effect', 'a', 'small', 'but', 'ubiquitous', 'manybody', 'attraction', 'that', 'presents', 'challenges', 'to', 'density', 'functional', 'theory', 'how', 'does', 'the', 'binding', 'energy', 'depend', 'upon', 'the', 'size', 'or', 'number', 'of', 'atoms', 'in', 'one', 'of', 'a', 'pair', 'of', 'identical', 'nanostructures', 'to', 'answer', 'this', 'question', 'we', 'treat', 'each', 'nanostructure', 'properly', 'as', 'a', 'whole', 'object', 'not', 'as', 'a', 'collection', 'of', 'atoms', 'our', 'calculations', 'start', 'from', 'an', 'accurate', 'static', 'dipole', 'polarizability', 'for', 'each', 'considered', 'nanostructure', 'and', 'an', 'accurate', 'equilibrium', 'centertocenter', 'distance', 'for', 'the', 'pair', 'the', 'latter', 'from', 'experiment', 'or', 'from', 'the', 'vdwdfcx', 'functional', 'we', 'consider', 'the', 'competition', 'in', 'each', 'term', 'c_2kd2k', 'k3', '4', '5', 'of', 'the', 'longrange', 'vdw', 'series', 'for', 'the', 'interaction', 'energy', 'between', 'the', 'size', 'dependence', 'of', 'the', 'vdw', 'coefficient', 'c_2k', 'and', 'that', 'of', 'the', '2kth', 'power', 'of', 'the', 'centertocenter', 'distance', 'd', 'the', 'damping', 'of', 'these', 'vdw', 'terms', 'can', 'be', 'negligible', 'but', 'in', 'any', 'case', 'it', 'does', 'not', 'affect', 'the', 'size', 'dependence', 'for', 'a', 'given', 'term', 'in', 'the', 'absence', 'of', 'nonvdw', 'binding', 'to', 'our', 'surprise', 'the', 'vdw', 'energy', 'can', 'be', 'sizeindependent', 'for', 'quasispherical', 'nanoclusters', 'bound', 'to', 'one', 'another', 'by', 'vdw', 'interaction', 'even', 'with', 'strong', 'nonadditivity', 'of', 'the', 'vdw', 'coefficient', 'as', 'demonstrated', 'for', 'fullerenes', 'we', 'also', 'show', 'that', 'for', 'lowdimensional', 'systems', 'the', 'vdw', 'interaction', 'yields', 'the', 'strongest', 'sizedependence', 'in', 'stark', 'contrast', 'to', 'that', 'of', 'fullerenes', 'we', 'illustrate', 'this', 'with', 'parallel', 'planar', 'polycyclic', 'aromatic', 'hydrocarbons', 'other', 'cases', 'are', 'between', 'as', 'shown', 'by', 'sodium', 'clusters']] | [-0.11706024534572153, 0.1158826107355831, -0.05921851881479813, 0.058746326982608, -0.013089241455032853, -0.14653849051436568, 0.028553331001973475, 0.3491125184947909, -0.25925273096121815, -0.31561193618947103, -0.06155717235095049, -0.33040423067760166, -0.14401523702900257, 0.1772394703791903, 0.009928148322722923, 0.004663707778722016, 0.036951547358342905, 0.004548141444733335, -0.019572679837376386, -0.2447145258005456, 0.3169985418395392, 0.05981327057618774, 0.2393315653509058, 0.15656327391714173, 0.0201992847368721, 0.02791440737200901, 0.09422788234877448, 0.06244570630858523, -0.14521015736028273, 0.13011743308768126, 0.2534727398037291, -0.030085857920111866, 0.2635950312724779, -0.444468900356126, -0.20419665469424958, 0.06847651073930122, 0.14293649932073618, 0.16438489773318612, -0.02883853515416731, -0.22897058813951088, 0.04783772019633897, -0.18353283629156808, -0.10593136132919719, -0.062384885214900564, 0.06978777464542349, 0.07913361614869939, -0.24294536986380375, 0.11210735268992968, 0.09013275692724797, 0.01180086492817189, -0.0769598508999541, -0.14223165091687529, -0.03049264513538219, 0.11440047538263123, 0.020204721636908722, 0.009353281326307836, 0.1671098698388343, -0.1161568875152517, -0.05385156244165817, 0.41575510580471514, -0.08412276398315552, -0.1550046384647307, 0.19981386202340157, -0.12068752919805188, -0.1029263177967504, 0.12621116976281313, 0.11893502874615586, 0.0958661339600902, -0.12849707447655373, 0.09352671790234665, 0.004241155410655064, 0.2241699257707697, 0.11115683755103373, 0.04515347784479796, 0.21732015194079318, 0.12872333669940295, 0.06856095281792647, 0.11519081405683626, -0.06372713401300242, -0.061466365166687235, -0.26839266667710776, -0.17014298805021347, -0.2515696712919527, 0.05564605217672178, -0.10523927883800983, -0.2127062024392525, 0.33198700659568975, 0.09440383778971825, 0.18411415183948257, 0.019184371112190755, 0.24433468823948623, 0.0777520189442577, 0.09146217148656309, 0.019820148555034826, 0.2834599798750448, 0.09565943943522082, 0.03462295571018516, -0.26747582544537135, 0.09108096997103637, 0.055769272141703165] |
1,802.00976 | Proceedings First Workshop on Architectures, Languages and Paradigms for
IoT | The 1st workshop on Architectures, Languages and Paradigms for IoT (ALP4IoT
2017), was held in Turin on September 19th, 2017. ALP4IoT was a satellite event
of the 13th International Conference on integrated Formal Methods (iFM 2017).
The workshop aimed at critically reviewing the state-of-the-art and the
state-of-the-practice of formal techniques and software methods for the IoT,
presenting open problems and challenges and triggering a discussion among the
participants with different views and backgrounds. The Internet of Things is
ushering a dramatic increase in number and variety of interconnected and smart
objects. Communication capabilities and computational power are growingly
embedded in everyday devices, including personal smart devices, public
displays, cars, drones, and electronic tags. This state of the things opens an
unprecedented range of research opportunities: the inherent distribution,
mobility, situatedness, and heterogeneity of such devices call for proper
scientific understanding of the foundations of such systems as well as for
novel software methods. The workshop solicited original contributions on
architectures, languages, paradigms, and techniques with potential practical
and theoretical impact on software systems targeting the IoT, welcoming
inter-disciplinary approaches.
| cs.DC cs.MA cs.SE | the 1st workshop on architectures languages and paradigms for iot alp4iot 2017 was held in turin on september 19th 2017 alp4iot was a satellite event of the 13th international conference on integrated formal methods ifm 2017 the workshop aimed at critically reviewing the stateoftheart and the stateofthepractice of formal techniques and software methods for the iot presenting open problems and challenges and triggering a discussion among the participants with different views and backgrounds the internet of things is ushering a dramatic increase in number and variety of interconnected and smart objects communication capabilities and computational power are growingly embedded in everyday devices including personal smart devices public displays cars drones and electronic tags this state of the things opens an unprecedented range of research opportunities the inherent distribution mobility situatedness and heterogeneity of such devices call for proper scientific understanding of the foundations of such systems as well as for novel software methods the workshop solicited original contributions on architectures languages paradigms and techniques with potential practical and theoretical impact on software systems targeting the iot welcoming interdisciplinary approaches | [['the', '1st', 'workshop', 'on', 'architectures', 'languages', 'and', 'paradigms', 'for', 'iot', 'alp4iot', '2017', 'was', 'held', 'in', 'turin', 'on', 'september', '19th', '2017', 'alp4iot', 'was', 'a', 'satellite', 'event', 'of', 'the', '13th', 'international', 'conference', 'on', 'integrated', 'formal', 'methods', 'ifm', '2017', 'the', 'workshop', 'aimed', 'at', 'critically', 'reviewing', 'the', 'stateoftheart', 'and', 'the', 'stateofthepractice', 'of', 'formal', 'techniques', 'and', 'software', 'methods', 'for', 'the', 'iot', 'presenting', 'open', 'problems', 'and', 'challenges', 'and', 'triggering', 'a', 'discussion', 'among', 'the', 'participants', 'with', 'different', 'views', 'and', 'backgrounds', 'the', 'internet', 'of', 'things', 'is', 'ushering', 'a', 'dramatic', 'increase', 'in', 'number', 'and', 'variety', 'of', 'interconnected', 'and', 'smart', 'objects', 'communication', 'capabilities', 'and', 'computational', 'power', 'are', 'growingly', 'embedded', 'in', 'everyday', 'devices', 'including', 'personal', 'smart', 'devices', 'public', 'displays', 'cars', 'drones', 'and', 'electronic', 'tags', 'this', 'state', 'of', 'the', 'things', 'opens', 'an', 'unprecedented', 'range', 'of', 'research', 'opportunities', 'the', 'inherent', 'distribution', 'mobility', 'situatedness', 'and', 'heterogeneity', 'of', 'such', 'devices', 'call', 'for', 'proper', 'scientific', 'understanding', 'of', 'the', 'foundations', 'of', 'such', 'systems', 'as', 'well', 'as', 'for', 'novel', 'software', 'methods', 'the', 'workshop', 'solicited', 'original', 'contributions', 'on', 'architectures', 'languages', 'paradigms', 'and', 'techniques', 'with', 'potential', 'practical', 'and', 'theoretical', 'impact', 'on', 'software', 'systems', 'targeting', 'the', 'iot', 'welcoming', 'interdisciplinary', 'approaches']] | [-0.14688767218136822, 0.019535659699365417, -0.047378156312995336, 0.012754652241710573, -0.12700245285999368, -0.14120226773295805, 0.038139840408059004, 0.3409537975888022, -0.21613357127749955, -0.4029363254058725, 0.12319533805798115, -0.34261146921198815, -0.17530027298793852, 0.2725579122012608, -0.13748288041361692, 0.08205969505731693, 0.08565585899023889, -0.02152480713663284, -0.025699577770534564, -0.2921712308578373, 0.2798116553405469, 0.07522763918347085, 0.37907061497786676, 0.11055233527440578, 0.09084047805994157, -0.002525737963548057, -0.09401651900241798, -0.037692108752459964, -0.08099569262280552, 0.1866544760579762, 0.3731738745779942, 0.2056641250515399, 0.35165601067207963, -0.4591808927732266, -0.16607501458598894, 0.0005652655084056526, 0.08904687170235609, 0.03571415577657304, -0.051126026213751175, -0.3668140972731635, 0.022710456549909643, -0.24789752229116857, -0.09664688850013838, -0.033391629508431914, 0.06335372966449623, 0.06842179299035872, -0.14249854442525908, -0.025573549189588943, 0.014740351518081628, 0.16839406235058876, -0.02661488075078854, -0.12343837712383406, 0.0362422523480332, 0.1845998437590879, 0.0263631036386042, -0.008740656475393653, 0.1671951533783365, -0.18079472691037649, -0.21350938103833786, 0.40499197141219734, 0.058902365002061495, -0.037930554297583345, 0.23696715747725897, -0.032611439482107846, -0.1917957498623185, 0.026655617220306092, 0.28391010368200525, 0.03587757757436934, -0.1742438612729364, 0.10668400559271421, 0.08972859774340494, 0.16548561423141192, 0.0370109883462481, 0.05691201295121573, 0.2621488807781134, 0.26359868760383426, 0.04653056099976476, 0.036811568006338675, -0.0375879520473642, -0.10419119917853757, -0.22635187867721965, -0.1718031814221335, -0.11033840379836461, -0.021210051789900965, -0.02161308298499617, -0.12362607222960585, 0.3785137754378163, 0.1818827135244977, 0.0836451236444356, -0.006442984195680104, 0.3596757951573553, 0.0066574027038189924, 0.08781014973481599, 0.10088460643468848, 0.16843371828409462, 0.0321142015481283, 0.2541338062596465, -0.11709004805280446, 0.06077506532495714, 0.01515735741387206] |
1,802.00977 | Pose Flow: Efficient Online Pose Tracking | Multi-person articulated pose tracking in unconstrained videos is an
important while challenging problem. In this paper, going along the road of
top-down approaches, we propose a decent and efficient pose tracker based on
pose flows. First, we design an online optimization framework to build the
association of cross-frame poses and form pose flows (PF-Builder). Second, a
novel pose flow non-maximum suppression (PF-NMS) is designed to robustly reduce
redundant pose flows and re-link temporal disjoint ones. Extensive experiments
show that our method significantly outperforms best-reported results on two
standard Pose Tracking datasets by 13 mAP 25 MOTA and 6 mAP 3 MOTA
respectively. Moreover, in the case of working on detected poses in individual
frames, the extra computation of pose tracker is very minor, guaranteeing
online 10FPS tracking. Our source codes are made publicly
available(https://github.com/YuliangXiu/PoseFlow).
| cs.CV cs.AI | multiperson articulated pose tracking in unconstrained videos is an important while challenging problem in this paper going along the road of topdown approaches we propose a decent and efficient pose tracker based on pose flows first we design an online optimization framework to build the association of crossframe poses and form pose flows pfbuilder second a novel pose flow nonmaximum suppression pfnms is designed to robustly reduce redundant pose flows and relink temporal disjoint ones extensive experiments show that our method significantly outperforms bestreported results on two standard pose tracking datasets by 13 map 25 mota and 6 map 3 mota respectively moreover in the case of working on detected poses in individual frames the extra computation of pose tracker is very minor guaranteeing online 10fps tracking our source codes are made publicly availablehttpsgithubcomyuliangxiuposeflow | [['multiperson', 'articulated', 'pose', 'tracking', 'in', 'unconstrained', 'videos', 'is', 'an', 'important', 'while', 'challenging', 'problem', 'in', 'this', 'paper', 'going', 'along', 'the', 'road', 'of', 'topdown', 'approaches', 'we', 'propose', 'a', 'decent', 'and', 'efficient', 'pose', 'tracker', 'based', 'on', 'pose', 'flows', 'first', 'we', 'design', 'an', 'online', 'optimization', 'framework', 'to', 'build', 'the', 'association', 'of', 'crossframe', 'poses', 'and', 'form', 'pose', 'flows', 'pfbuilder', 'second', 'a', 'novel', 'pose', 'flow', 'nonmaximum', 'suppression', 'pfnms', 'is', 'designed', 'to', 'robustly', 'reduce', 'redundant', 'pose', 'flows', 'and', 'relink', 'temporal', 'disjoint', 'ones', 'extensive', 'experiments', 'show', 'that', 'our', 'method', 'significantly', 'outperforms', 'bestreported', 'results', 'on', 'two', 'standard', 'pose', 'tracking', 'datasets', 'by', '13', 'map', '25', 'mota', 'and', '6', 'map', '3', 'mota', 'respectively', 'moreover', 'in', 'the', 'case', 'of', 'working', 'on', 'detected', 'poses', 'in', 'individual', 'frames', 'the', 'extra', 'computation', 'of', 'pose', 'tracker', 'is', 'very', 'minor', 'guaranteeing', 'online', '10fps', 'tracking', 'our', 'source', 'codes', 'are', 'made', 'publicly', 'availablehttpsgithubcomyuliangxiuposeflow']] | [-0.11884369000864144, -0.02308554842938275, -0.03173003677063836, 0.015179323055781424, -0.05908054332248867, -0.2147393778539621, -0.028741052695729127, 0.4520102984773425, -0.23654192261612758, -0.3901950369015909, 0.1194580913360159, -0.2841008600402767, -0.16382572014386265, 0.1971646708704961, -0.2149042815433439, 0.11475862968766776, 0.1974672488671226, 0.004898417630913452, -0.05719696097971442, -0.2646501997306656, 0.24543839890796404, 0.03699133279016958, 0.2983518045932914, 0.04655232790652147, 0.17822949506270772, 0.0006699042645497964, -0.09589856970571697, 0.010564942926598283, -0.06406004815591866, 0.19728031534468754, 0.2622512766446632, 0.18925441736355425, 0.2688862793362485, -0.4107911150114468, -0.18883655220180606, 0.037841449240938976, 0.13736107556077723, 0.08642792324098991, -0.10960189113662076, -0.34501203306270045, 0.0904355816453552, -0.1619540923418334, -0.010441786935552954, -0.09085342459741066, -0.027029562669877823, -0.06809194368856529, -0.26777824892017704, 0.08260901157493489, 0.030224983909339732, 0.047188390945442596, -0.06196981888407698, -0.10033888176370126, 0.055727282736020595, 0.19813325421956296, 0.043168718987502734, 0.0705971904278088, 0.150414580017185, -0.19907369775733408, -0.15361366867660903, 0.3811305828535786, -0.034639785084157035, -0.23023196644543742, 0.193194130437377, -0.020502479697797053, -0.16933919635171502, 0.1497393521032511, 0.2537614407734229, 0.1565754655462045, -0.1556615505188417, -0.000795841132863783, -0.08095156302532325, 0.20342326105500644, 0.0591220733208152, -0.05323148899389288, 0.16526311856085577, 0.2171634185486115, 0.1308279326010961, 0.1325824872823432, -0.18994986890062976, -0.06404859890373281, -0.23608339950442314, -0.09908979607101243, -0.10324377957015084, -0.05579459123277607, -0.09114610021889138, -0.12207772063288408, 0.37345576332702946, 0.22701511445383613, 0.21782743601988142, 0.09216476784539947, 0.3745245514276366, -0.01296569701964752, 0.06971629261254118, 0.12728827668246456, 0.21385916541688718, -0.013689830243730773, 0.09796181484662857, -0.1804510036897577, 0.05131179257654227, 0.07819312746063448] |
1,802.00978 | A low-frequency variational model for energetic particle effects in the
pressure-coupling scheme | Energetic particle effects in magnetic confinement fusion devices are
commonly studied by hybrid kinetic-fluid simulation codes whose underlying
continuum evolution equations often lack the correct energy balance. While two
different kinetic-fluid coupling options are available (current-coupling and
pressure-coupling), this paper applies the Euler-Poincar\'e variational
approach to formulate a new conservative hybrid model in the pressure-coupling
scheme. In our case the kinetics of the energetic particles are described by
guiding center theory. The interplay between the Lagrangian fluid paths with
phase space particle trajectories reflects an intricate variational structure
which can be approached by letting the 4-dimensional guiding center
trajectories evolve in the full 6-dimensional phase space. Then, the redundant
perpendicular velocity is integrated out to recover a four-dimensional
description. A second equivalent variational approach is also reported, which
involves the use of phase space Lagrangians. Not only do these variational
structures confer on the new model a correct energy balance, but also they
produce a cross-helicity invariant which is lost in the other pressure-coupling
schemes reported in the literature.
| physics.plasm-ph math-ph math.MP | energetic particle effects in magnetic confinement fusion devices are commonly studied by hybrid kineticfluid simulation codes whose underlying continuum evolution equations often lack the correct energy balance while two different kineticfluid coupling options are available currentcoupling and pressurecoupling this paper applies the eulerpoincare variational approach to formulate a new conservative hybrid model in the pressurecoupling scheme in our case the kinetics of the energetic particles are described by guiding center theory the interplay between the lagrangian fluid paths with phase space particle trajectories reflects an intricate variational structure which can be approached by letting the 4dimensional guiding center trajectories evolve in the full 6dimensional phase space then the redundant perpendicular velocity is integrated out to recover a fourdimensional description a second equivalent variational approach is also reported which involves the use of phase space lagrangians not only do these variational structures confer on the new model a correct energy balance but also they produce a crosshelicity invariant which is lost in the other pressurecoupling schemes reported in the literature | [['energetic', 'particle', 'effects', 'in', 'magnetic', 'confinement', 'fusion', 'devices', 'are', 'commonly', 'studied', 'by', 'hybrid', 'kineticfluid', 'simulation', 'codes', 'whose', 'underlying', 'continuum', 'evolution', 'equations', 'often', 'lack', 'the', 'correct', 'energy', 'balance', 'while', 'two', 'different', 'kineticfluid', 'coupling', 'options', 'are', 'available', 'currentcoupling', 'and', 'pressurecoupling', 'this', 'paper', 'applies', 'the', 'eulerpoincare', 'variational', 'approach', 'to', 'formulate', 'a', 'new', 'conservative', 'hybrid', 'model', 'in', 'the', 'pressurecoupling', 'scheme', 'in', 'our', 'case', 'the', 'kinetics', 'of', 'the', 'energetic', 'particles', 'are', 'described', 'by', 'guiding', 'center', 'theory', 'the', 'interplay', 'between', 'the', 'lagrangian', 'fluid', 'paths', 'with', 'phase', 'space', 'particle', 'trajectories', 'reflects', 'an', 'intricate', 'variational', 'structure', 'which', 'can', 'be', 'approached', 'by', 'letting', 'the', '4dimensional', 'guiding', 'center', 'trajectories', 'evolve', 'in', 'the', 'full', '6dimensional', 'phase', 'space', 'then', 'the', 'redundant', 'perpendicular', 'velocity', 'is', 'integrated', 'out', 'to', 'recover', 'a', 'fourdimensional', 'description', 'a', 'second', 'equivalent', 'variational', 'approach', 'is', 'also', 'reported', 'which', 'involves', 'the', 'use', 'of', 'phase', 'space', 'lagrangians', 'not', 'only', 'do', 'these', 'variational', 'structures', 'confer', 'on', 'the', 'new', 'model', 'a', 'correct', 'energy', 'balance', 'but', 'also', 'they', 'produce', 'a', 'crosshelicity', 'invariant', 'which', 'is', 'lost', 'in', 'the', 'other', 'pressurecoupling', 'schemes', 'reported', 'in', 'the', 'literature']] | [-0.12722713826637516, 0.1576955525636619, -0.10488863550842954, 0.12233156523668653, -0.09090380402235039, -0.14589737201131572, 0.002645250548299997, 0.35294222358349686, -0.2866744441035363, -0.3121616493376005, 0.025456212575343497, -0.21831446774744775, -0.13910032310605755, 0.14372040769953237, -0.04995741560151415, 0.035919109772692415, 0.07688168515919669, 0.011744214871418855, -0.06573398779187704, -0.18981653106806678, 0.30463594135890487, 0.06462818603224214, 0.3045003885546556, -0.004881878835341987, 0.12759480027470893, -0.015079426526824927, -0.006096856646548361, 0.035977476782932845, -0.1362904071953897, 0.10751689983512545, 0.21789149033214303, 0.042711978246969, 0.23473276355105435, -0.43330739048921324, -0.2629983213691581, 0.06710196017780543, 0.16100418918418902, 0.13183001231487576, -0.03565382713399629, -0.270953177357335, 0.02305370364503483, -0.15781546873729346, -0.12953955196414196, -0.0855924109570109, -0.03874803065548282, 0.02391251620454934, -0.23156752423886154, 0.08294112408036344, 0.041238711276174296, 0.023811130123157824, -0.08153036469430043, -0.07724631003850861, -0.0721572775313818, 0.06974118442092775, 0.024989038270473832, 0.031558586319649494, 0.1333483764929311, -0.08393784161221743, -0.10457954224413978, 0.4077051594721142, 0.0008234878748478974, -0.2587150742007783, 0.18409057225227443, -0.08137523219782926, -0.13604967523167824, 0.17833334667685294, 0.15186258425768023, 0.13731082572364772, -0.18539697866778015, 0.09436039945367103, -0.017857399686465603, 0.13153045003429142, 0.03661554474548916, 0.018696244639350025, 0.18684231809522273, 0.14327899479588285, 0.05134649810480428, 0.09867533571851446, -0.04146711859774924, -0.19272481186381546, -0.31949463175312126, -0.141311825173163, -0.146223801940393, 0.018434162655402354, -0.06427223327390219, -0.14898973347387723, 0.35397798238127454, 0.13687815774265213, 0.15581000330389516, 0.011062121379034891, 0.3083935787449398, 0.11269316402437529, 0.0526519968813649, 0.08331579312450699, 0.27477136513593015, 0.12931386192230035, 0.10672031858930442, -0.21031864081077503, 0.0322297381460336, 0.1174422244337448] |
1,802.00979 | The Ramsey and the ordering property for classes of lattices and
semilattices | The class of finite distributive lattices, as many other classes of
structures, does not have the Ramsey property. It is quite common, though, that
after expanding the structures with appropriately chosen linear orders the
resulting class has the Ramsey property. So, one might expect that a similar
result holds for the class of all finite distributive lattices. Surprisingly,
Kechris and Soki\'c have proved in 2012 that this is not the case: no expansion
of the class of finite distributive lattices by linear orders satisfies the
Ramsey property.
In this paper we prove that the variety of distributive lattices is not an
exception, but an instance of a more general phenomenon. We show that for
almost all nontrivial locally finite varieties of lattices no "reasonable"
expansion of the finite members of the variety by linear orders gives rise to a
Ramsey class. The responsibility for this lies not with the lattices as
structures, but with the lack of algebraic morphisms: if we consider lattices
as partially ordered sets (and thus switch from algebraic embeddings to
embeddings of relational structures) we show that every variety of lattices
gives rise to a class of linearly ordered posets having both the Ramsey
property and the ordering property. It now comes as no surprise that the same
is true for varieties of semilattices.
| math.CO | the class of finite distributive lattices as many other classes of structures does not have the ramsey property it is quite common though that after expanding the structures with appropriately chosen linear orders the resulting class has the ramsey property so one might expect that a similar result holds for the class of all finite distributive lattices surprisingly kechris and sokic have proved in 2012 that this is not the case no expansion of the class of finite distributive lattices by linear orders satisfies the ramsey property in this paper we prove that the variety of distributive lattices is not an exception but an instance of a more general phenomenon we show that for almost all nontrivial locally finite varieties of lattices no reasonable expansion of the finite members of the variety by linear orders gives rise to a ramsey class the responsibility for this lies not with the lattices as structures but with the lack of algebraic morphisms if we consider lattices as partially ordered sets and thus switch from algebraic embeddings to embeddings of relational structures we show that every variety of lattices gives rise to a class of linearly ordered posets having both the ramsey property and the ordering property it now comes as no surprise that the same is true for varieties of semilattices | [['the', 'class', 'of', 'finite', 'distributive', 'lattices', 'as', 'many', 'other', 'classes', 'of', 'structures', 'does', 'not', 'have', 'the', 'ramsey', 'property', 'it', 'is', 'quite', 'common', 'though', 'that', 'after', 'expanding', 'the', 'structures', 'with', 'appropriately', 'chosen', 'linear', 'orders', 'the', 'resulting', 'class', 'has', 'the', 'ramsey', 'property', 'so', 'one', 'might', 'expect', 'that', 'a', 'similar', 'result', 'holds', 'for', 'the', 'class', 'of', 'all', 'finite', 'distributive', 'lattices', 'surprisingly', 'kechris', 'and', 'sokic', 'have', 'proved', 'in', '2012', 'that', 'this', 'is', 'not', 'the', 'case', 'no', 'expansion', 'of', 'the', 'class', 'of', 'finite', 'distributive', 'lattices', 'by', 'linear', 'orders', 'satisfies', 'the', 'ramsey', 'property', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'variety', 'of', 'distributive', 'lattices', 'is', 'not', 'an', 'exception', 'but', 'an', 'instance', 'of', 'a', 'more', 'general', 'phenomenon', 'we', 'show', 'that', 'for', 'almost', 'all', 'nontrivial', 'locally', 'finite', 'varieties', 'of', 'lattices', 'no', 'reasonable', 'expansion', 'of', 'the', 'finite', 'members', 'of', 'the', 'variety', 'by', 'linear', 'orders', 'gives', 'rise', 'to', 'a', 'ramsey', 'class', 'the', 'responsibility', 'for', 'this', 'lies', 'not', 'with', 'the', 'lattices', 'as', 'structures', 'but', 'with', 'the', 'lack', 'of', 'algebraic', 'morphisms', 'if', 'we', 'consider', 'lattices', 'as', 'partially', 'ordered', 'sets', 'and', 'thus', 'switch', 'from', 'algebraic', 'embeddings', 'to', 'embeddings', 'of', 'relational', 'structures', 'we', 'show', 'that', 'every', 'variety', 'of', 'lattices', 'gives', 'rise', 'to', 'a', 'class', 'of', 'linearly', 'ordered', 'posets', 'having', 'both', 'the', 'ramsey', 'property', 'and', 'the', 'ordering', 'property', 'it', 'now', 'comes', 'as', 'no', 'surprise', 'that', 'the', 'same', 'is', 'true', 'for', 'varieties', 'of', 'semilattices']] | [-0.13809846238705217, 0.16921295869816202, -0.07815742284409838, 0.07699859758824058, -0.10741322394674045, -0.12186737038588169, 0.03540465689462891, 0.4034450849242628, -0.33742490429602084, -0.19868481124178805, 0.10511892902933984, -0.248478533821864, -0.12803401441714907, 0.2075561531317429, -0.08216754658950852, -0.013601861378271986, 0.052398468384309886, 0.06551603488453211, -0.06453052585743743, -0.32334899037986686, 0.3668632566044534, -0.03204152586059794, 0.2819644458241624, 0.05080348878688769, 0.10787522956011218, 0.01240689900421768, 0.04489195158004487, 0.1020903577964001, -0.11275886848617378, 0.1120915991820741, 0.28156046611214175, 0.09939496834130121, 0.24758763782415164, -0.3418990984859977, -0.19520118834617453, 0.19006335216258233, 0.09819226174128301, 0.11827589155458088, -0.03063034625231863, -0.21198070438102384, 0.1310106425870791, -0.1725146943530273, -0.1408353248769161, -0.11789764158017592, 0.06671588767935104, 0.032584006129123204, -0.2361680276947173, -0.025231121161337428, 0.20668652848983526, 0.10912602680477361, -0.01498985967231453, -0.08397228138640399, -0.006330207163262941, 0.08549543943922591, -0.018416446452605786, -0.004321742945974437, 0.0024841926891010667, -0.10060188789326492, -0.16324663185995122, 0.44683439045324236, -0.03265588487062706, -0.15370212938793276, 0.21015319015100223, -0.17157870232247227, -0.16073916482348252, 0.12766922105193446, 0.057375251672256294, 0.1098779159333181, -0.0754191841195346, 0.14719486711124907, -0.16318403672717444, 0.15636244162900048, 0.10161694298218509, 0.09110704435162682, 0.14227146378594424, 0.09716181437924949, 0.1451128396873657, 0.1569473786376216, 0.04252687320668558, -0.07375466643614746, -0.2916125119407448, -0.1150113276842503, -0.15653711442041016, 0.09363065927741737, -0.08077286470793839, -0.24914015408225118, 0.35063981970584174, 0.08597707128528198, 0.18746547814065573, 0.098707688624176, 0.17602776072987722, 0.06341617724243039, 0.11362712265103372, 0.06360971247788023, 0.172829816337897, 0.16926374967175817, 0.01336987766035653, -0.14106451532132752, 0.05517532128131512, 0.11449101237033349] |
1,802.0098 | The first-order flexibility of a crystal framework | Four sets of necessary and sufficient conditions are obtained for the
first-order rigidity of a periodic bond-node framework \C in R^d which is of
crystallographic type. In particular, an extremal rank characterisation is
obtained which incorporates a multi-variable matrix-valued transfer function
\Psi_\C(z) defined on the product space C^d_* = (C\{0})^d. In general the
first-order flex space is shown to be the closed linear span of polynomially
weighted geometric velocity fields whose geometric multi-factors in C^d_* lie
in a finite set. Paradoxically, first-order rigid crystal frameworks may
possess nontrivial nondifferentiable continuous motions. The examples given are
associated with aperiodic displacive phase transitions between periodic states.
| math-ph math.AC math.MP | four sets of necessary and sufficient conditions are obtained for the firstorder rigidity of a periodic bondnode framework c in rd which is of crystallographic type in particular an extremal rank characterisation is obtained which incorporates a multivariable matrixvalued transfer function psi_cz defined on the product space cd_ c0d in general the firstorder flex space is shown to be the closed linear span of polynomially weighted geometric velocity fields whose geometric multifactors in cd_ lie in a finite set paradoxically firstorder rigid crystal frameworks may possess nontrivial nondifferentiable continuous motions the examples given are associated with aperiodic displacive phase transitions between periodic states | [['four', 'sets', 'of', 'necessary', 'and', 'sufficient', 'conditions', 'are', 'obtained', 'for', 'the', 'firstorder', 'rigidity', 'of', 'a', 'periodic', 'bondnode', 'framework', 'c', 'in', 'rd', 'which', 'is', 'of', 'crystallographic', 'type', 'in', 'particular', 'an', 'extremal', 'rank', 'characterisation', 'is', 'obtained', 'which', 'incorporates', 'a', 'multivariable', 'matrixvalued', 'transfer', 'function', 'psi_cz', 'defined', 'on', 'the', 'product', 'space', 'cd_', 'c0d', 'in', 'general', 'the', 'firstorder', 'flex', 'space', 'is', 'shown', 'to', 'be', 'the', 'closed', 'linear', 'span', 'of', 'polynomially', 'weighted', 'geometric', 'velocity', 'fields', 'whose', 'geometric', 'multifactors', 'in', 'cd_', 'lie', 'in', 'a', 'finite', 'set', 'paradoxically', 'firstorder', 'rigid', 'crystal', 'frameworks', 'may', 'possess', 'nontrivial', 'nondifferentiable', 'continuous', 'motions', 'the', 'examples', 'given', 'are', 'associated', 'with', 'aperiodic', 'displacive', 'phase', 'transitions', 'between', 'periodic', 'states']] | [-0.1646374019215653, 0.16674803943763492, -0.051392334009691766, 0.04318072576769533, -0.08899231512593675, -0.12739039952296535, -0.015728580510025198, 0.4076867266273012, -0.31163609011706955, -0.18427586212887295, 0.098829511138468, -0.20397521873279142, -0.16163936758660996, 0.20277639216154206, -0.08394162529813391, 0.06841951460406488, 0.015531639787083378, 0.07825315083681168, -0.14160297008478367, -0.22916570268761444, 0.3388820400803673, -0.07954540442466279, 0.23634196584093936, 0.0029236637839895425, 0.10253770361483401, 0.0017552841716084856, -0.006644006291100261, 0.07702453884388777, -0.16197261488901413, 0.1019504647482215, 0.2743118318862149, 0.06564700317911196, 0.21839657475297547, -0.3729726202662426, -0.19399147894119426, 0.13505538008460888, 0.06974453469548299, 0.05835357750053233, -0.009000117625632532, -0.29337242346409026, 0.06624390584967878, -0.10147573348438861, -0.1448429647871122, -0.11623805221787901, 0.035260066087120116, 0.050315339403341014, -0.29232170438745575, 0.053336361309095304, 0.11530535152699913, 0.10023753687131162, -0.11497916354398642, -0.06991426715251933, -0.061287700424293934, 0.07250880640551295, -0.04182870529962666, 0.05872223278886534, 0.07223447607545068, -0.027879401518754204, -0.11674109454817917, 0.3859755356453967, -0.026136910247055774, -0.23773125042112506, 0.19653464669874887, -0.14662159640075906, -0.15220283647305427, 0.19629816153105728, 0.15878115633291154, 0.123633386030596, -0.12640057047068767, 0.16204720982576112, -0.044828641275894275, 0.11677254175254125, 0.10525375587998756, 0.031203224440699215, 0.17170208471123966, 0.09842972040927152, 0.12575407064494876, 0.1642054000106754, 0.017982377853049725, -0.1435289351573708, -0.3759072783346079, -0.1300441913629825, -0.16435368584198118, 0.035925198113545775, -0.12545007772785874, -0.2727304847767857, 0.37566122036588817, -0.007122355887466776, 0.16959456429930822, 0.045882104546763, 0.18244499275080708, 0.13614472347309894, 0.039954636316052734, 0.03866196916514666, 0.17800806412872458, 0.1845695307283491, 0.037336780770434716, -0.17340421668320363, 0.04932775588858188, 0.136691947348834] |
1,802.00981 | Contextual Bandit with Adaptive Feature Extraction | We consider an online decision making setting known as contextual bandit
problem, and propose an approach for improving contextual bandit performance by
using an adaptive feature extraction (representation learning) based on online
clustering. Our approach starts with an off-line pre-training on unlabeled
history of contexts (which can be exploited by our approach, but not by the
standard contextual bandit), followed by an online selection and adaptation of
encoders. Specifically, given an input sample (context), the proposed approach
selects the most appropriate encoding function to extract a feature vector
which becomes an input for a contextual bandit, and updates both the bandit and
the encoding function based on the context and on the feedback (reward). Our
experiments on a variety of datasets, and both in stationary and non-stationary
environments of several kinds demonstrate clear advantages of the proposed
adaptive representation learning over the standard contextual bandit based on
"raw" input contexts.
| cs.AI cs.LG stat.ML | we consider an online decision making setting known as contextual bandit problem and propose an approach for improving contextual bandit performance by using an adaptive feature extraction representation learning based on online clustering our approach starts with an offline pretraining on unlabeled history of contexts which can be exploited by our approach but not by the standard contextual bandit followed by an online selection and adaptation of encoders specifically given an input sample context the proposed approach selects the most appropriate encoding function to extract a feature vector which becomes an input for a contextual bandit and updates both the bandit and the encoding function based on the context and on the feedback reward our experiments on a variety of datasets and both in stationary and nonstationary environments of several kinds demonstrate clear advantages of the proposed adaptive representation learning over the standard contextual bandit based on raw input contexts | [['we', 'consider', 'an', 'online', 'decision', 'making', 'setting', 'known', 'as', 'contextual', 'bandit', 'problem', 'and', 'propose', 'an', 'approach', 'for', 'improving', 'contextual', 'bandit', 'performance', 'by', 'using', 'an', 'adaptive', 'feature', 'extraction', 'representation', 'learning', 'based', 'on', 'online', 'clustering', 'our', 'approach', 'starts', 'with', 'an', 'offline', 'pretraining', 'on', 'unlabeled', 'history', 'of', 'contexts', 'which', 'can', 'be', 'exploited', 'by', 'our', 'approach', 'but', 'not', 'by', 'the', 'standard', 'contextual', 'bandit', 'followed', 'by', 'an', 'online', 'selection', 'and', 'adaptation', 'of', 'encoders', 'specifically', 'given', 'an', 'input', 'sample', 'context', 'the', 'proposed', 'approach', 'selects', 'the', 'most', 'appropriate', 'encoding', 'function', 'to', 'extract', 'a', 'feature', 'vector', 'which', 'becomes', 'an', 'input', 'for', 'a', 'contextual', 'bandit', 'and', 'updates', 'both', 'the', 'bandit', 'and', 'the', 'encoding', 'function', 'based', 'on', 'the', 'context', 'and', 'on', 'the', 'feedback', 'reward', 'our', 'experiments', 'on', 'a', 'variety', 'of', 'datasets', 'and', 'both', 'in', 'stationary', 'and', 'nonstationary', 'environments', 'of', 'several', 'kinds', 'demonstrate', 'clear', 'advantages', 'of', 'the', 'proposed', 'adaptive', 'representation', 'learning', 'over', 'the', 'standard', 'contextual', 'bandit', 'based', 'on', 'raw', 'input', 'contexts']] | [0.003200950560470422, -0.03313902694741652, -0.07499945015956958, 0.06685402447978656, -0.16387422673093777, -0.1714593394504239, 0.06376559678465128, 0.459972551415364, -0.30892301553763296, -0.31523492163668076, 0.09920019873029863, -0.22981888357549907, -0.202366183794414, 0.20187232674720387, -0.12833257695659994, 0.0629445804321828, 0.06209487450076267, 0.08557791113077352, -0.028482672367244957, -0.2967155426259463, 0.349416006517907, 0.07937288872276743, 0.338834978758047, -0.0707153607563426, 0.19904300919889162, 0.08461148398928345, -0.0756928743616057, 0.01663211823829139, -0.06095545940023536, 0.13773345965193584, 0.32065475085595, 0.2540312954535087, 0.38847058049713573, -0.3693658401380041, -0.23167495302235086, 0.0591880757183147, 0.14775904621928931, 0.10645162144607942, -0.10397330905000368, -0.4012199787671367, 0.016404157735717795, -0.1558562918412887, 0.10146088843544324, -0.1204305919446051, -0.05955358147000273, -0.04345265728134109, -0.3786190251540393, -0.0010758599437152346, 0.08363341367803515, 0.01844333635022243, -0.07478976108366624, -0.11748603939078749, 0.08833848666865379, 0.12826349744262794, 0.020864446916772673, 0.04882412588534256, 0.1549898698894928, -0.19532876737726232, -0.24260315339934702, 0.3350614255045851, -0.03969487148647507, -0.2110815469175577, 0.18241411552609255, 0.01760853111743927, -0.12949483862146735, 0.06916253548115492, 0.2549258019340535, 0.15090317149724192, -0.16549162936396897, 0.036172245184037215, -0.08190105142692725, 0.20736650883530577, 0.028878467028650146, 0.025880716542402902, 0.11878599722404033, 0.2575424412017067, 0.07682040118612349, 0.16470027695720393, -0.08403882476811608, -0.12293217968195677, -0.2587456512947877, -0.07304205669400593, -0.18143526528651516, -0.048054079005087263, -0.17883356121300797, -0.1436091913593312, 0.35715797007083894, 0.19924539123040935, 0.24025566658005118, 0.1274868660311525, 0.3511096290871501, 0.06993254990472147, 0.05404917576039831, 0.12294109986474117, 0.13865622447182735, 0.011315710684284568, 0.11059060361779606, -0.20488618982334933, 0.1508984386920929, 0.061112131215631964] |
1,802.00982 | Malliavin Derivative for the Unknown Parameter in surplus process with
mixed fractional Brownian motion | In this paper, we will construct the Malliavin derivative and the stochastic
integral with respect to the Mixed fractional Brownian motion (mfbm) for H >
1/2. As an application, we try to estimate the drift parameter via Malliavin
derivative for surplus process with mixed fractional Brownian motion
| math.ST stat.TH | in this paper we will construct the malliavin derivative and the stochastic integral with respect to the mixed fractional brownian motion mfbm for h 12 as an application we try to estimate the drift parameter via malliavin derivative for surplus process with mixed fractional brownian motion | [['in', 'this', 'paper', 'we', 'will', 'construct', 'the', 'malliavin', 'derivative', 'and', 'the', 'stochastic', 'integral', 'with', 'respect', 'to', 'the', 'mixed', 'fractional', 'brownian', 'motion', 'mfbm', 'for', 'h', '12', 'as', 'an', 'application', 'we', 'try', 'to', 'estimate', 'the', 'drift', 'parameter', 'via', 'malliavin', 'derivative', 'for', 'surplus', 'process', 'with', 'mixed', 'fractional', 'brownian', 'motion']] | [-0.03475959483615082, 0.08804035317639912, -0.07460635266287009, 0.0504797608935247, -0.183762492571512, -0.04964062198996544, 0.010463300224332868, 0.39534085956604587, -0.3851543165864828, -0.2840776680323356, 0.17397211893694475, -0.274107047478142, -0.14038916658635414, 0.10084649260439303, -0.18643032081182237, 0.05887772922363618, -0.004177601441093113, 0.021087980788687, -0.0005153363935001519, -0.17777673312989267, 0.2810413334214979, -0.02160889152234987, 0.09689951758912724, -0.07517888868713508, 0.1752859661558076, 0.021090522393300806, -0.08517597812106428, -0.03764350068472002, -0.2424066500414325, 0.1654724192643619, 0.17292283329626787, -0.07118721095764119, 0.33493285593779193, -0.4119365790291973, -0.15081178807810394, 0.1533541398568322, 0.10634782157127198, 0.017207576690808586, -0.018188975467953995, -0.33556794330639683, 0.007737556168728549, -0.17725041192834792, -0.2038830061159704, -0.09387650563503089, 0.07216005278346331, 0.0649262705574865, -0.336843583246936, 0.1382256092088621, 0.04465521173551679, -0.019048711689917938, -0.0963301066228229, -0.13922382826390473, 0.00830819700723109, 0.04400483194900596, 0.04434822428827275, 0.017730581147707595, 0.12715369839545176, -0.09214943422146303, -0.21001546582935945, 0.28359701559352485, -0.22799601440277437, -0.3449126541938471, 0.13713291441292866, -0.21283668832367528, -0.14552913245785495, 0.13850039270421446, 0.15106721311483695, 0.148696983769617, -0.21690096627192004, 0.10526688550674843, 0.08044931661013675, 0.07106786205068878, 0.05493963040087534, -0.014270831770061151, 0.0920870860522289, 0.1382246319528507, 0.2105091135321266, 0.162999148035179, -0.1518374017905444, -0.18988858450852011, -0.3932976810180623, -0.28893793728607503, -0.18686042560021515, 0.08062245119261839, -0.12925803966019253, -0.16100011288147906, 0.28795837380153977, 0.1983389254740399, 0.11938038221357958, 0.10688411104796536, 0.2219832976875098, 0.27955149119952694, -0.06734523132605397, 0.017912437223181452, 0.11921591615385335, 0.15578635506655858, 0.1869857082872287, -0.2316668492782375, 0.04288612650302441, 0.11958395875990391] |
1,802.00983 | The negative effects of citing with a national orientation in terms of
recognition: national and international citations in natural-sciences papers
from Germany, the Netherlands, and the UK | Nations can be distinguished in terms of whether domestic or international
research is cited. We analyzed the research output in natural sciences of three
leading European research economies (Germany, the Netherlands, and the UK) and
ask where their researchers look for the knowledge that underpins their most
highly-cited papers. Is one internationally oriented or is citation limited to
national resources? Do the citation patterns reflect a growing differentiation
between the domestic and international research enterprise? To evaluate change
over time, we include natural-sciences papers published in the countries from
three publication years: 2004, 2009, and 2014. The results show that articles
co-authored by researchers from Germany or the Netherlands are less likely to
be among the globally most highly-cited articles if they also cite "domestic"
research (i.e. research authored by authors from the same country). To put this
another way, less well-cited research is more likely to stand on domestic
shoulders and research that becomes more highly-cited is more likely to stand
on international shoulders. A possible reason for the results is that
researchers "over-cite" the papers from their own country - lacking the focus
on quality in citing. However, these differences between domestic and
international shoulders are not visible for the UK.
| cs.DL | nations can be distinguished in terms of whether domestic or international research is cited we analyzed the research output in natural sciences of three leading european research economies germany the netherlands and the uk and ask where their researchers look for the knowledge that underpins their most highlycited papers is one internationally oriented or is citation limited to national resources do the citation patterns reflect a growing differentiation between the domestic and international research enterprise to evaluate change over time we include naturalsciences papers published in the countries from three publication years 2004 2009 and 2014 the results show that articles coauthored by researchers from germany or the netherlands are less likely to be among the globally most highlycited articles if they also cite domestic research ie research authored by authors from the same country to put this another way less wellcited research is more likely to stand on domestic shoulders and research that becomes more highlycited is more likely to stand on international shoulders a possible reason for the results is that researchers overcite the papers from their own country lacking the focus on quality in citing however these differences between domestic and international shoulders are not visible for the uk | [['nations', 'can', 'be', 'distinguished', 'in', 'terms', 'of', 'whether', 'domestic', 'or', 'international', 'research', 'is', 'cited', 'we', 'analyzed', 'the', 'research', 'output', 'in', 'natural', 'sciences', 'of', 'three', 'leading', 'european', 'research', 'economies', 'germany', 'the', 'netherlands', 'and', 'the', 'uk', 'and', 'ask', 'where', 'their', 'researchers', 'look', 'for', 'the', 'knowledge', 'that', 'underpins', 'their', 'most', 'highlycited', 'papers', 'is', 'one', 'internationally', 'oriented', 'or', 'is', 'citation', 'limited', 'to', 'national', 'resources', 'do', 'the', 'citation', 'patterns', 'reflect', 'a', 'growing', 'differentiation', 'between', 'the', 'domestic', 'and', 'international', 'research', 'enterprise', 'to', 'evaluate', 'change', 'over', 'time', 'we', 'include', 'naturalsciences', 'papers', 'published', 'in', 'the', 'countries', 'from', 'three', 'publication', 'years', '2004', '2009', 'and', '2014', 'the', 'results', 'show', 'that', 'articles', 'coauthored', 'by', 'researchers', 'from', 'germany', 'or', 'the', 'netherlands', 'are', 'less', 'likely', 'to', 'be', 'among', 'the', 'globally', 'most', 'highlycited', 'articles', 'if', 'they', 'also', 'cite', 'domestic', 'research', 'ie', 'research', 'authored', 'by', 'authors', 'from', 'the', 'same', 'country', 'to', 'put', 'this', 'another', 'way', 'less', 'wellcited', 'research', 'is', 'more', 'likely', 'to', 'stand', 'on', 'domestic', 'shoulders', 'and', 'research', 'that', 'becomes', 'more', 'highlycited', 'is', 'more', 'likely', 'to', 'stand', 'on', 'international', 'shoulders', 'a', 'possible', 'reason', 'for', 'the', 'results', 'is', 'that', 'researchers', 'overcite', 'the', 'papers', 'from', 'their', 'own', 'country', 'lacking', 'the', 'focus', 'on', 'quality', 'in', 'citing', 'however', 'these', 'differences', 'between', 'domestic', 'and', 'international', 'shoulders', 'are', 'not', 'visible', 'for', 'the', 'uk']] | [-0.03545822606945876, 0.10926477394066751, -0.05510455331997946, 0.09579193959536497, -0.15642436861759051, -0.11449937385041267, 0.07131113800685852, 0.3721885906728858, -0.18064186915406025, -0.3297757763240952, 0.10554409553064033, -0.38152099412865936, -0.13276193115278148, 0.2491354126407532, -0.15188058505940716, -0.06866807337733917, 0.0744629504554905, 0.03542718088021502, 0.04417906511022011, -0.3825438392162323, 0.2706887208821718, 0.10145002323493828, 0.3713697196543217, 0.0761669113287644, -0.02653114747314248, -0.07336955449456582, -0.17702840766170994, -0.004648722750134766, -0.07007860204277677, 0.19983488493831827, 0.4106653432035819, 0.21396131516783498, 0.4030764941428788, -0.42839399417862295, -0.1351548986304988, 0.08702676716726274, 0.05965255863033235, 0.02210694826208055, 0.027012180092933703, -0.29500136360060425, 0.01702188143739477, -0.23679614758410025, -0.08678152847569436, -0.00048160384700167923, 0.11771788036450744, 0.02388754786166828, -0.15713626858545468, 0.036941924396523974, -0.003466223634313792, 0.1616453265491873, -0.008254509004764259, -0.15995098695158957, -0.028786346997367217, 0.2282985649735201, 0.14389299395726993, 0.022749217699747533, 0.1403100313944742, -0.12698207135163103, -0.16480492911767214, 0.4161181673151441, -0.0038347729069937485, -0.08513664012309163, 0.19224187068408355, -0.2022172641986981, -0.17207201883196832, 0.0006152318872045725, 0.2267964008889976, 0.03389357914187713, -0.1833406225008366, 0.023613943088566885, -0.045085088973864915, 0.15519153838977218, 0.16863151497673243, -0.054722041450440885, 0.21379815598018467, 0.12222509157843887, 0.062259513860335576, 0.04146457048249431, -0.022552786257438128, -0.10493697046273155, -0.19649023804580792, -0.12899315404472872, -0.12434993924573064, 0.01568186513039109, 0.0463503371765546, -0.1187785608926788, 0.40263417894951997, 0.1281356443092227, 0.08786303653847426, -0.04626259707845747, 0.2591019208729267, 0.004394599689403549, 0.10863079356582603, 0.11579422852722927, 0.21036405362421648, 0.004972214852459729, 0.21654750002024228, -0.06355105498048942, 0.12336560564581305, -0.019023943583015353] |
1,802.00984 | Numerical Schubert Calculus via the Littlewood-Richardson Homotopy
Algorithm | We develop the Littlewood-Richardson homotopy algorithm, which uses numerical
continuation to compute solutions to Schubert problems on Grassmannians and is
based on the geometric Littlewood-Richardson rule. One key ingredient of this
algorithm is our new optimal formulation of Schubert problems in local Stiefel
coordinates as systems of equations. Our implementation can solve problem
instances with tens of thousands of solutions.
| math.AG cs.NA math.NA | we develop the littlewoodrichardson homotopy algorithm which uses numerical continuation to compute solutions to schubert problems on grassmannians and is based on the geometric littlewoodrichardson rule one key ingredient of this algorithm is our new optimal formulation of schubert problems in local stiefel coordinates as systems of equations our implementation can solve problem instances with tens of thousands of solutions | [['we', 'develop', 'the', 'littlewoodrichardson', 'homotopy', 'algorithm', 'which', 'uses', 'numerical', 'continuation', 'to', 'compute', 'solutions', 'to', 'schubert', 'problems', 'on', 'grassmannians', 'and', 'is', 'based', 'on', 'the', 'geometric', 'littlewoodrichardson', 'rule', 'one', 'key', 'ingredient', 'of', 'this', 'algorithm', 'is', 'our', 'new', 'optimal', 'formulation', 'of', 'schubert', 'problems', 'in', 'local', 'stiefel', 'coordinates', 'as', 'systems', 'of', 'equations', 'our', 'implementation', 'can', 'solve', 'problem', 'instances', 'with', 'tens', 'of', 'thousands', 'of', 'solutions']] | [-0.12516332513963183, -0.10830948099804422, -0.09997941982001066, 0.03447223741289539, -0.16716484430556497, -0.17080133226700128, 0.041094958611453576, 0.29493827776362497, -0.35835472208758196, -0.3042160209889213, 0.13490431328536942, -0.19284614541878303, -0.2117592729628086, 0.22739934381097554, -0.15745225955421727, 0.10528133820431927, 0.10048574564279988, -0.04296774637574951, -0.08793207921553403, -0.311356863946033, 0.3633490747461716, -0.021985346637666225, 0.23134156527115313, 0.03366405282674047, 0.18557492103427647, -0.03556680244704088, -0.0028133783489465714, -0.02656999582735201, -0.10904200737907861, 0.19360740141904292, 0.3142632813192904, 0.1600452897294114, 0.2800839290643732, -0.43424231888105475, -0.09871560530737042, 0.12238415689207613, 0.22470729164779185, 0.12501813251486357, 0.016850296555397413, -0.21526926358540852, 0.0652187381638214, -0.09826261615380645, -0.1525696213822812, -0.14772571423090994, -0.008359184469251582, 0.06859386682820817, -0.28529759487137196, 0.02788815168508639, -0.004798932637398442, 0.031246860278770328, -0.10666932139429264, -0.1673659814056009, 0.10099089809227735, 0.07831978941491495, 0.005534194592231264, 0.0017769157964115342, 0.11535554809185365, -0.04144087751628831, -0.24429293201925853, 0.44129662873844305, 0.02582059654717644, -0.28678276848125583, 0.11179930431535468, -0.06157958344556391, -0.19247299802179138, 0.1713656740107884, 0.16888363159572084, 0.26766514548410975, -0.05358309408960243, 0.0681650195105855, -0.13632826091876873, 0.07048323666676878, 0.0552688962003837, -0.03963180892169475, 0.14053021740789215, 0.15063799144700168, 0.10890759848989547, 0.1475399145972915, 0.003057006843543301, -0.1767586803684632, -0.3185281668479244, -0.15512489584895472, -0.1355203541616599, 0.06528817963165541, -0.16613831965538944, -0.21652061402176817, 0.39896617985020083, 0.16109171392551314, 0.13906983205427725, 0.11104342665251656, 0.2789789604023099, 0.07435734452252897, 0.05813553730355731, 0.05391128339494268, 0.16745118213196594, 0.21165457844423752, 0.08622716497629881, -0.19266591045816311, 0.014359538730544349, 0.304242096740442] |
1,802.00985 | Modeling Text with Graph Convolutional Network for Cross-Modal
Information Retrieval | Cross-modal information retrieval aims to find heterogeneous data of various
modalities from a given query of one modality. The main challenge is to map
different modalities into a common semantic space, in which distance between
concepts in different modalities can be well modeled. For cross-modal
information retrieval between images and texts, existing work mostly uses
off-the-shelf Convolutional Neural Network (CNN) for image feature extraction.
For texts, word-level features such as bag-of-words or word2vec are employed to
build deep learning models to represent texts. Besides word-level semantics,
the semantic relations between words are also informative but less explored. In
this paper, we model texts by graphs using similarity measure based on
word2vec. A dual-path neural network model is proposed for couple feature
learning in cross-modal information retrieval. One path utilizes Graph
Convolutional Network (GCN) for text modeling based on graph representations.
The other path uses a neural network with layers of nonlinearities for image
modeling based on off-the-shelf features. The model is trained by a pairwise
similarity loss function to maximize the similarity of relevant text-image
pairs and minimize the similarity of irrelevant pairs. Experimental results
show that the proposed model outperforms the state-of-the-art methods
significantly, with 17% improvement on accuracy for the best case.
| cs.IR | crossmodal information retrieval aims to find heterogeneous data of various modalities from a given query of one modality the main challenge is to map different modalities into a common semantic space in which distance between concepts in different modalities can be well modeled for crossmodal information retrieval between images and texts existing work mostly uses offtheshelf convolutional neural network cnn for image feature extraction for texts wordlevel features such as bagofwords or word2vec are employed to build deep learning models to represent texts besides wordlevel semantics the semantic relations between words are also informative but less explored in this paper we model texts by graphs using similarity measure based on word2vec a dualpath neural network model is proposed for couple feature learning in crossmodal information retrieval one path utilizes graph convolutional network gcn for text modeling based on graph representations the other path uses a neural network with layers of nonlinearities for image modeling based on offtheshelf features the model is trained by a pairwise similarity loss function to maximize the similarity of relevant textimage pairs and minimize the similarity of irrelevant pairs experimental results show that the proposed model outperforms the stateoftheart methods significantly with 17 improvement on accuracy for the best case | [['crossmodal', 'information', 'retrieval', 'aims', 'to', 'find', 'heterogeneous', 'data', 'of', 'various', 'modalities', 'from', 'a', 'given', 'query', 'of', 'one', 'modality', 'the', 'main', 'challenge', 'is', 'to', 'map', 'different', 'modalities', 'into', 'a', 'common', 'semantic', 'space', 'in', 'which', 'distance', 'between', 'concepts', 'in', 'different', 'modalities', 'can', 'be', 'well', 'modeled', 'for', 'crossmodal', 'information', 'retrieval', 'between', 'images', 'and', 'texts', 'existing', 'work', 'mostly', 'uses', 'offtheshelf', 'convolutional', 'neural', 'network', 'cnn', 'for', 'image', 'feature', 'extraction', 'for', 'texts', 'wordlevel', 'features', 'such', 'as', 'bagofwords', 'or', 'word2vec', 'are', 'employed', 'to', 'build', 'deep', 'learning', 'models', 'to', 'represent', 'texts', 'besides', 'wordlevel', 'semantics', 'the', 'semantic', 'relations', 'between', 'words', 'are', 'also', 'informative', 'but', 'less', 'explored', 'in', 'this', 'paper', 'we', 'model', 'texts', 'by', 'graphs', 'using', 'similarity', 'measure', 'based', 'on', 'word2vec', 'a', 'dualpath', 'neural', 'network', 'model', 'is', 'proposed', 'for', 'couple', 'feature', 'learning', 'in', 'crossmodal', 'information', 'retrieval', 'one', 'path', 'utilizes', 'graph', 'convolutional', 'network', 'gcn', 'for', 'text', 'modeling', 'based', 'on', 'graph', 'representations', 'the', 'other', 'path', 'uses', 'a', 'neural', 'network', 'with', 'layers', 'of', 'nonlinearities', 'for', 'image', 'modeling', 'based', 'on', 'offtheshelf', 'features', 'the', 'model', 'is', 'trained', 'by', 'a', 'pairwise', 'similarity', 'loss', 'function', 'to', 'maximize', 'the', 'similarity', 'of', 'relevant', 'textimage', 'pairs', 'and', 'minimize', 'the', 'similarity', 'of', 'irrelevant', 'pairs', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'model', 'outperforms', 'the', 'stateoftheart', 'methods', 'significantly', 'with', '17', 'improvement', 'on', 'accuracy', 'for', 'the', 'best', 'case']] | [-0.0013490425132890688, -0.029627497657202184, -0.05734864223232566, 0.1049950073219781, -0.1654895802613978, -0.19765143572380217, 0.0055139308410705815, 0.5089138924582478, -0.32155878496054996, -0.3237875472621846, -0.011115878678894802, -0.3467817748303288, -0.20500017235206222, 0.16720609826991087, -0.1178796366376428, 0.09688586918819769, 0.14579643234930129, 0.09963971702496101, -0.07947531006271567, -0.2678761835392352, 0.35082812960757237, 0.009378134600410704, 0.372774979273113, 0.0015775812812624317, 0.15286298614399343, -0.022131308098323643, -0.08107598109898961, -0.04372769811971903, -0.03382502657986348, 0.2297210969212328, 0.37332493728266786, 0.2498463527870127, 0.280393356853393, -0.40077468056195215, -0.28125040579185473, 0.07831889054710593, 0.11063089356963139, 0.07781830137109329, 0.011810589344332031, -0.3705856377685753, 0.07474113707875778, -0.1563842097895366, 0.15398922300094045, -0.1305479936178445, -0.006791495580532059, -0.011180806167734167, -0.2887302341439542, 0.02802267727112813, 0.1057498102197903, 0.07380185159740459, -0.023830960190845837, -0.11523781908452328, 0.01430903574024948, 0.17995923535565062, -0.013257110308782728, 0.09799681345112714, 0.11313109231802325, -0.19144926585517275, -0.16728867999478883, 0.36365606100754994, -0.09497673380731915, -0.23576863821226118, 0.19138050396292122, 0.03536795478715908, -0.13074998322454298, 0.059148402336765736, 0.22735872520042547, 0.09768501186843816, -0.19359629239667864, -0.0323422086746409, -0.04930075723906139, 0.23798226661165245, 0.08107183946241789, 0.0409853436376936, 0.17959877203126476, 0.29750441009288325, -0.012934700327961906, 0.14417948382855256, -0.12789765251435192, -0.05070812295889482, -0.16245446110135128, -0.08986043924118813, -0.2343611154858224, -0.1016676391762517, -0.14848404833302245, -0.13230885276639395, 0.407590787955925, 0.25891515906379725, 0.23485563614624827, 0.11213848151679735, 0.3538130786653389, -0.018693523534559917, 0.15986438223911797, 0.0940237061072634, 0.13817861253468722, 0.0240672813399179, 0.13175013844909914, -0.10711524044232004, 0.10508628002842706, 0.14098548307311812] |
1,802.00986 | Lipid-protein interaction induced domains: kinetics and conformational
changes in multicomponent vesicles | The spatio-temporal organization of proteins and the associated morphological
changes in membranes are of importance in cell signaling. Several mechanisms
that promote the aggregation of proteins at low cell surface concentrations
have been investigated in the past. We show, using Monte Carlo simulations,
that the affinity of proteins for specific lipids can hasten its aggregation
kinetics. The lipid membrane is modeled as a dynamically triangulated surface
with the proteins defined as in-plane fields at the vertices. We show that,
even at low protein concentrations, strong lipid-protein interactions can
result in large protein clusters indicating a route to lipid mediated signal
amplification. At high protein concentrations the domains form buds similar to
that seen in lipid-lipid interaction induced phase separation. Protein
interaction induced domain budding is suppressed when proteins act as
anisotropic inclusions and exhibit nematic orientational order. The kinetics of
protein clustering and resulting conformational changes are shown to be
significantly different for the isotropic and anisotropic curvature inducing
proteins.
| physics.bio-ph cond-mat.soft cond-mat.stat-mech physics.chem-ph | the spatiotemporal organization of proteins and the associated morphological changes in membranes are of importance in cell signaling several mechanisms that promote the aggregation of proteins at low cell surface concentrations have been investigated in the past we show using monte carlo simulations that the affinity of proteins for specific lipids can hasten its aggregation kinetics the lipid membrane is modeled as a dynamically triangulated surface with the proteins defined as inplane fields at the vertices we show that even at low protein concentrations strong lipidprotein interactions can result in large protein clusters indicating a route to lipid mediated signal amplification at high protein concentrations the domains form buds similar to that seen in lipidlipid interaction induced phase separation protein interaction induced domain budding is suppressed when proteins act as anisotropic inclusions and exhibit nematic orientational order the kinetics of protein clustering and resulting conformational changes are shown to be significantly different for the isotropic and anisotropic curvature inducing proteins | [['the', 'spatiotemporal', 'organization', 'of', 'proteins', 'and', 'the', 'associated', 'morphological', 'changes', 'in', 'membranes', 'are', 'of', 'importance', 'in', 'cell', 'signaling', 'several', 'mechanisms', 'that', 'promote', 'the', 'aggregation', 'of', 'proteins', 'at', 'low', 'cell', 'surface', 'concentrations', 'have', 'been', 'investigated', 'in', 'the', 'past', 'we', 'show', 'using', 'monte', 'carlo', 'simulations', 'that', 'the', 'affinity', 'of', 'proteins', 'for', 'specific', 'lipids', 'can', 'hasten', 'its', 'aggregation', 'kinetics', 'the', 'lipid', 'membrane', 'is', 'modeled', 'as', 'a', 'dynamically', 'triangulated', 'surface', 'with', 'the', 'proteins', 'defined', 'as', 'inplane', 'fields', 'at', 'the', 'vertices', 'we', 'show', 'that', 'even', 'at', 'low', 'protein', 'concentrations', 'strong', 'lipidprotein', 'interactions', 'can', 'result', 'in', 'large', 'protein', 'clusters', 'indicating', 'a', 'route', 'to', 'lipid', 'mediated', 'signal', 'amplification', 'at', 'high', 'protein', 'concentrations', 'the', 'domains', 'form', 'buds', 'similar', 'to', 'that', 'seen', 'in', 'lipidlipid', 'interaction', 'induced', 'phase', 'separation', 'protein', 'interaction', 'induced', 'domain', 'budding', 'is', 'suppressed', 'when', 'proteins', 'act', 'as', 'anisotropic', 'inclusions', 'and', 'exhibit', 'nematic', 'orientational', 'order', 'the', 'kinetics', 'of', 'protein', 'clustering', 'and', 'resulting', 'conformational', 'changes', 'are', 'shown', 'to', 'be', 'significantly', 'different', 'for', 'the', 'isotropic', 'and', 'anisotropic', 'curvature', 'inducing', 'proteins']] | [-0.13852987001406955, 0.23485957181561481, -0.008064432998419207, 0.06693417659035222, 0.008477346093024848, -0.12048719485682792, 0.002592427527192254, 0.4422856514933724, -0.3101918575406637, -0.27398840657218637, -0.01564324406450087, -0.25741969026718875, -0.22575312408577627, 0.1022154308384015, 0.009560127680353914, -0.032347941297068375, 0.04414973548121469, 0.0008888953107661046, 0.03456805737062398, -0.17678128229307724, 0.22152160193607118, 0.05599947015713877, 0.2985654644530454, 0.11132968330767544, 0.09868547574868836, -0.061957580093060086, 0.06028100165520918, 0.06830705750481747, -0.17531578676608894, 0.11233016120904321, 0.29867004190129376, 0.005658440436851585, 0.2091410080287254, -0.4760834089474483, -0.28806698334010894, 0.1026171161851746, 0.1937547695717581, 0.16847767259738167, -0.07132256446397459, -0.24985194424132132, 0.1215746903780309, -0.11309815731204156, -0.0783567835617834, -0.08004445343537538, -0.011443735082756798, 0.0964823227973198, -0.22628126536355406, 0.19053251986280553, 0.044646856730141966, 0.100247724675837, -0.13322350211842748, -0.11090940910936245, -0.1148868485195738, 0.1669516059580631, 0.07957424194795086, 0.03905466523419761, 0.3020968714585446, -0.14112432768902267, -0.08366255956239202, 0.3574257507135377, -0.013571868815353879, -0.206390633572877, 0.24579675474537993, -0.12388893787356668, -0.14968007227769062, 0.20772738460855522, 0.15333479462460903, 0.09322820973740716, -0.15566368252172577, 0.02635851876887803, 0.06682792582414435, 0.21390559750978114, 0.14282752857279946, -0.01685368215208346, 0.20444462580735204, 0.20896285183877103, 0.026731072862064408, 0.15511327284701615, -0.0872777509023494, -0.10386375955792156, -0.1575444427263226, -0.15387182586691664, -0.17030329680152284, 0.024631460755184856, -0.1264546520026172, -0.2028279200805067, 0.3295135609820227, 0.03233249952334621, 0.19378187885484513, 0.02884953914903201, 0.16998909326246794, -0.03863258667673869, 0.1059571190051875, -0.04887919059995585, 0.1752018768680077, 0.09910942142266992, 0.08207779738513178, -0.29326721572217607, 0.1559665652884115, 0.02075704687887088] |
1,802.00987 | On the formation of density filaments in the turbulent interstellar
medium | This study is motivated by recent observations on the ubiquitous interstellar
density filaments and guided by the modern theory of magnetohydrodynamic (MHD)
turbulence. The interstellar turbulence shapes the observed density structure.
The perpendicular turbulent mixing, as the fundamental dynamics of MHD
turbulence, naturally entails parallel filaments presented in both the diffuse
medium and molecular clouds (MCs). The minimum width is determined by the
perpendicular neutral-ion decoupling scale in partially ionized media.
Differently, dense perpendicular filaments arise in highly supersonic
turbulence in MCs as a result of shock compression. Their width specifically
depends on the turbulence properties. We demonstrate that different alignments
of filaments with respect to the magnetic field originate from the varying
turbulence properties in the multi-phase interstellar medium.
| astro-ph.GA astro-ph.SR | this study is motivated by recent observations on the ubiquitous interstellar density filaments and guided by the modern theory of magnetohydrodynamic mhd turbulence the interstellar turbulence shapes the observed density structure the perpendicular turbulent mixing as the fundamental dynamics of mhd turbulence naturally entails parallel filaments presented in both the diffuse medium and molecular clouds mcs the minimum width is determined by the perpendicular neutralion decoupling scale in partially ionized media differently dense perpendicular filaments arise in highly supersonic turbulence in mcs as a result of shock compression their width specifically depends on the turbulence properties we demonstrate that different alignments of filaments with respect to the magnetic field originate from the varying turbulence properties in the multiphase interstellar medium | [['this', 'study', 'is', 'motivated', 'by', 'recent', 'observations', 'on', 'the', 'ubiquitous', 'interstellar', 'density', 'filaments', 'and', 'guided', 'by', 'the', 'modern', 'theory', 'of', 'magnetohydrodynamic', 'mhd', 'turbulence', 'the', 'interstellar', 'turbulence', 'shapes', 'the', 'observed', 'density', 'structure', 'the', 'perpendicular', 'turbulent', 'mixing', 'as', 'the', 'fundamental', 'dynamics', 'of', 'mhd', 'turbulence', 'naturally', 'entails', 'parallel', 'filaments', 'presented', 'in', 'both', 'the', 'diffuse', 'medium', 'and', 'molecular', 'clouds', 'mcs', 'the', 'minimum', 'width', 'is', 'determined', 'by', 'the', 'perpendicular', 'neutralion', 'decoupling', 'scale', 'in', 'partially', 'ionized', 'media', 'differently', 'dense', 'perpendicular', 'filaments', 'arise', 'in', 'highly', 'supersonic', 'turbulence', 'in', 'mcs', 'as', 'a', 'result', 'of', 'shock', 'compression', 'their', 'width', 'specifically', 'depends', 'on', 'the', 'turbulence', 'properties', 'we', 'demonstrate', 'that', 'different', 'alignments', 'of', 'filaments', 'with', 'respect', 'to', 'the', 'magnetic', 'field', 'originate', 'from', 'the', 'varying', 'turbulence', 'properties', 'in', 'the', 'multiphase', 'interstellar', 'medium']] | [-0.18344051057550434, 0.22964057897528012, -0.014314427327675124, 0.07536311872633329, -0.03691194453276694, 0.02307830779075933, -0.0806958050748411, 0.3957612463117888, -0.3359213982708752, -0.29083852332405513, -0.004777785857246878, -0.17761094837915153, -0.06057624899161359, 0.14504414630743365, 0.07181439807948967, 0.012581072924270605, 0.01900614518672228, -0.1566596751411756, 0.033665281171367196, -0.14815585533894288, 0.3302161829099835, 0.12090388659271412, 0.30561262792907656, 0.0015627732849679888, 0.03994177541777996, -0.12423307634502029, -0.07442486053526712, 0.054621473094448446, -0.16647959658324302, 0.05532239364498916, 0.14880957501785208, 0.04909087642251204, 0.2240958889965744, -0.5300066352201005, -0.31453226846133475, -0.041771026093435165, 0.22598432247371722, 0.06191490344936028, -0.03978284644933107, -0.276917059882544, 0.05131802982068621, -0.10729879725258798, -0.1554944172501564, 0.05715590425922225, 0.0003303839136303092, 0.09540512756599734, -0.203634611973636, 0.15339261040790006, 0.02498463580850512, 0.08888527847011574, -0.08571377468081967, -0.024553359327061722, -0.04912170379102463, 0.04587561844964512, 0.08566329592916494, 0.06461068006271185, 0.2515896593298142, -0.22569102511236755, -0.02577875962888356, 0.48102561323903503, -0.07176945860070798, -0.1307396164520469, 0.24595091018127277, -0.18616107679360236, -0.13330886696542923, 0.21894393186861028, 0.18551680660651376, 0.05800394378020428, -0.07728857434170398, 0.04408697989128996, -0.14670618882907244, 0.1397571316997831, 0.05756735225828986, 0.006348534630766759, 0.25202833210350944, 0.1200405880304364, 0.024732699058949946, 0.11526466184295714, -0.14181644390143144, -0.10255615584319458, -0.2193751729998136, -0.11098940214142203, -0.15283714251127095, 0.04989303067947427, -0.11942324483510068, -0.17924749467832346, 0.32660445871685323, 0.18240847724179426, 0.19971864920808002, -0.05207624910981394, 0.35978895737013467, 0.0671005598482831, 0.010639322640296692, 0.18478739035781472, 0.2920864690056381, 0.2759341017634142, 0.15732291863144685, -0.24098365720322665, 0.09344982447122069, 0.026676511265880738] |
1,802.00988 | Quotients for sheets of conjugacy classes | We provide a description of the orbit space of a sheet S for the conjugation
action of a complex simple simply connected algebraic group G. This is obtained
by means of a bijection between S/G and the quotient of a shifted torus modulo
the action of a subgroup of the Weyl group and it is the group analogue of a
result due to Borho and Kraft. We also describe the normalisation of the
categorical quotient \overline{S}//G for arbitrary simple G and give a
necessary and sufficient condition for S//G to be normal in analogy to results
of Borho, Kraft and Richardson. The example of G_2 is worked out in detail.
| math.RT | we provide a description of the orbit space of a sheet s for the conjugation action of a complex simple simply connected algebraic group g this is obtained by means of a bijection between sg and the quotient of a shifted torus modulo the action of a subgroup of the weyl group and it is the group analogue of a result due to borho and kraft we also describe the normalisation of the categorical quotient overlinesg for arbitrary simple g and give a necessary and sufficient condition for sg to be normal in analogy to results of borho kraft and richardson the example of g_2 is worked out in detail | [['we', 'provide', 'a', 'description', 'of', 'the', 'orbit', 'space', 'of', 'a', 'sheet', 's', 'for', 'the', 'conjugation', 'action', 'of', 'a', 'complex', 'simple', 'simply', 'connected', 'algebraic', 'group', 'g', 'this', 'is', 'obtained', 'by', 'means', 'of', 'a', 'bijection', 'between', 'sg', 'and', 'the', 'quotient', 'of', 'a', 'shifted', 'torus', 'modulo', 'the', 'action', 'of', 'a', 'subgroup', 'of', 'the', 'weyl', 'group', 'and', 'it', 'is', 'the', 'group', 'analogue', 'of', 'a', 'result', 'due', 'to', 'borho', 'and', 'kraft', 'we', 'also', 'describe', 'the', 'normalisation', 'of', 'the', 'categorical', 'quotient', 'overlinesg', 'for', 'arbitrary', 'simple', 'g', 'and', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'sg', 'to', 'be', 'normal', 'in', 'analogy', 'to', 'results', 'of', 'borho', 'kraft', 'and', 'richardson', 'the', 'example', 'of', 'g_2', 'is', 'worked', 'out', 'in', 'detail']] | [-0.1846942076912906, 0.09112476318681595, -0.13445483624012372, 0.05440256412465706, -0.11140433609178034, -0.10684342309832573, 0.07140120166917802, 0.3429364233252105, -0.27306188923657077, -0.25772542919997776, 0.10413251200118401, -0.19757895733145975, -0.15639394500566253, 0.2064645067070944, -0.11320721538771593, -0.050706045548303415, 0.03860704395749153, 0.1160101934654933, -0.09639185216756316, -0.2331124467544531, 0.34623651273992906, -0.0017649346296120128, 0.20807531445261535, 0.02568350000939238, 0.1209491343844101, -0.009377343362248545, -0.03802843075544667, 0.03690198529912202, -0.12324743335126737, 0.11036563320341733, 0.23547441851125533, 0.05212544141456895, 0.18562774864290285, -0.3630072717221642, -0.13281998908523163, 0.13881559813514763, 0.10382352979136032, 0.0311454542113656, -0.031371539304836084, -0.2740124681315154, 0.119637457474451, -0.20855596406094798, -0.1775033572099146, -0.05758602192642492, 0.09669110276351828, -0.013618677478591237, -0.26510408112710904, 0.02226467896866988, 0.13317080863982167, 0.11572129070041103, -0.016029495968047633, -0.0603052320272807, -0.053240414294456945, 0.10604203505433002, -0.01142440359279035, 0.052294714286615814, 0.04854340119572536, -0.09802911367156295, -0.07863226228333804, 0.4315197516634308, -0.05550417679558517, -0.20078227387040581, 0.13379729456917613, -0.13770390740689745, -0.13172057153093158, 0.10023832221626552, 0.07719099049140281, 0.1355338743332466, -0.06064799687063638, 0.14331193336332643, -0.12075627855358458, 0.05400079703748807, 0.0699138080491898, -0.05717665370587909, 0.12856989441046474, 0.1322876240528368, 0.0821341754219264, 0.14763344151027705, 0.018902801190836167, -0.006773998473830726, -0.35772572420195703, -0.2183521236549345, -0.14040630094390874, 0.12567766119273158, -0.09133870767161395, -0.1573264808607621, 0.41743926995715824, 0.0488458763457698, 0.20104390788618304, 0.05471645591437706, 0.20635629112943324, 0.10506086275910685, 0.04625140269791041, 0.0388437466003821, 0.12302182281577806, 0.2426757092412493, -0.050872671708396267, -0.20770851552161737, -0.04125782631662324, 0.16981151145498413] |
1,802.00989 | Cosmological Tests of Gravity | Modifications to gravity can provide attractive alternatives to the dark
components of the standard model of cosmology. These modifications to general
relativity (GR) must be hidden at small scales where theory is well tested, and
so one naturally looks to the large scales in order to detect any deviations
from GR. One particularly promising avenue in testing gravity at cosmological
scales is within the anisotropy of galaxy clustering in redshift space. This
thesis presents a framework for consistently constructing large scale structure
observables in redshift space for gravitational theories that include an
additional scalar degree of freedom, specifically, the Horndeski class of
theories with a generalized potential term. The relevance of such a framework
in the context of next generation spectroscopic surveys is then investigated
using N-body simulations. The thesis concludes with ongoing and recently
completed extensions to this framework, including interacting dark energy
models and the effective field theory of large scale structure.
| astro-ph.CO | modifications to gravity can provide attractive alternatives to the dark components of the standard model of cosmology these modifications to general relativity gr must be hidden at small scales where theory is well tested and so one naturally looks to the large scales in order to detect any deviations from gr one particularly promising avenue in testing gravity at cosmological scales is within the anisotropy of galaxy clustering in redshift space this thesis presents a framework for consistently constructing large scale structure observables in redshift space for gravitational theories that include an additional scalar degree of freedom specifically the horndeski class of theories with a generalized potential term the relevance of such a framework in the context of next generation spectroscopic surveys is then investigated using nbody simulations the thesis concludes with ongoing and recently completed extensions to this framework including interacting dark energy models and the effective field theory of large scale structure | [['modifications', 'to', 'gravity', 'can', 'provide', 'attractive', 'alternatives', 'to', 'the', 'dark', 'components', 'of', 'the', 'standard', 'model', 'of', 'cosmology', 'these', 'modifications', 'to', 'general', 'relativity', 'gr', 'must', 'be', 'hidden', 'at', 'small', 'scales', 'where', 'theory', 'is', 'well', 'tested', 'and', 'so', 'one', 'naturally', 'looks', 'to', 'the', 'large', 'scales', 'in', 'order', 'to', 'detect', 'any', 'deviations', 'from', 'gr', 'one', 'particularly', 'promising', 'avenue', 'in', 'testing', 'gravity', 'at', 'cosmological', 'scales', 'is', 'within', 'the', 'anisotropy', 'of', 'galaxy', 'clustering', 'in', 'redshift', 'space', 'this', 'thesis', 'presents', 'a', 'framework', 'for', 'consistently', 'constructing', 'large', 'scale', 'structure', 'observables', 'in', 'redshift', 'space', 'for', 'gravitational', 'theories', 'that', 'include', 'an', 'additional', 'scalar', 'degree', 'of', 'freedom', 'specifically', 'the', 'horndeski', 'class', 'of', 'theories', 'with', 'a', 'generalized', 'potential', 'term', 'the', 'relevance', 'of', 'such', 'a', 'framework', 'in', 'the', 'context', 'of', 'next', 'generation', 'spectroscopic', 'surveys', 'is', 'then', 'investigated', 'using', 'nbody', 'simulations', 'the', 'thesis', 'concludes', 'with', 'ongoing', 'and', 'recently', 'completed', 'extensions', 'to', 'this', 'framework', 'including', 'interacting', 'dark', 'energy', 'models', 'and', 'the', 'effective', 'field', 'theory', 'of', 'large', 'scale', 'structure']] | [-0.1046160471237449, 0.11116629587752856, -0.10889708962859948, 0.12650188568914492, -0.11264335471447315, -0.1303057413360757, -0.06945739305493506, 0.29647516841885285, -0.25636921694816706, -0.34711147669714865, 0.05198168528777269, -0.24640713213314, -0.11362719946456226, 0.1578404104394548, 0.012653080817590189, 0.03240254687375159, 0.016939654214573757, -0.0016241707162880157, -0.04991482122927487, -0.2645543482760875, 0.3428667513169832, 0.12725844586119903, 0.21427353925083753, 0.01304336597344705, 0.09980848264070107, -0.0356470008649827, -0.04302619764726464, 0.08446989361727429, -0.13098734979958662, 0.09975736755756782, 0.252658767794572, 0.11669500289460669, 0.2735238110513559, -0.38830297592083934, -0.2843627497355768, 0.10059915940192612, 0.12159032230839956, 0.17362015187595184, -0.05988235647076523, -0.28532716865627117, 0.07100986938752754, -0.19677371903885438, -0.16634550289093675, -0.07101950332123254, 0.005234761945238071, -0.037039678616376664, -0.26265029854507055, 0.10324716039040495, -0.03274144978767454, 0.017146609276049322, -0.040558157785789584, -0.08110392223151594, 0.03750437413880529, 0.06427908726656423, 0.08107285596794667, 0.0565599822953295, 0.10969257006662075, -0.1755447015015094, -0.10166707834192588, 0.45671231565730913, -0.12214808694356084, -0.16613728706286496, 0.19028117826553181, -0.15408643279768913, -0.2137800318690912, 0.04011094180395367, 0.18889691894450647, 0.12225779487340191, -0.1428984089054518, 0.15584784993779385, 0.03171787686289179, 0.17866994120035465, 0.02346888126642141, 0.06714960109102676, 0.31070752212378594, 0.18572632367601738, 0.03805251929158906, 0.08114066905366232, -0.08269949180569935, -0.10534993053622568, -0.3569120702253618, -0.12231310022323598, -0.1326125732913323, 0.028566079223286602, -0.11707026172437261, -0.13543835150186795, 0.3953026894588846, 0.17855411237513938, 0.1369990650110866, 0.07822760405448302, 0.28472295532898084, 0.03394688065723189, 0.13020880904967908, 0.033076079380879926, 0.2829617099237761, 0.11325166774792718, 0.05118050216092401, -0.16588217872588037, -0.026169282937567536, 0.02852685663655594] |
1,802.0099 | Renormalization-Group Equations of Neutrino Masses and Flavor Mixing
Parameters in Matter | We borrow the general idea of renormalization-group equations (RGEs) to
understand how neutrino masses and flavor mixing parameters evolve when
neutrinos propagate in a medium, highlighting a meaningful possibility that the
genuine flavor quantities in vacuum can be extrapolated from their
matter-corrected counterparts to be measured in some realistic neutrino
oscillation experiments. Taking the matter parameter $a \equiv 2\sqrt{2} \
G^{}_{\rm F} N^{}_e E$ to be an arbitrary scale-like variable with $N^{}_e$
being the net electron number density and $E$ being the neutrino beam energy,
we derive a complete set of differential equations for the effective neutrino
mixing matrix $V$ and the effective neutrino masses $\widetilde{m}^{}_i$ (for
$i = 1, 2, 3$). Given the standard parametrization of $V$, the RGEs for
$\{\widetilde{\theta}^{}_{12}, \widetilde{\theta}^{}_{13},
\widetilde{\theta}^{}_{23}, \widetilde{\delta}\}$ in matter are formulated for
the first time. We demonstrate some useful differential invariants which retain
the same form from vacuum to matter, including the well-known Naumov and Toshev
relations. The RGEs of the partial $\mu$-$\tau$ asymmetries, the off-diagonal
asymmetries and the sides of unitarity triangles of $V$ are also obtained as a
by-product.
| hep-ph hep-ex | we borrow the general idea of renormalizationgroup equations rges to understand how neutrino masses and flavor mixing parameters evolve when neutrinos propagate in a medium highlighting a meaningful possibility that the genuine flavor quantities in vacuum can be extrapolated from their mattercorrected counterparts to be measured in some realistic neutrino oscillation experiments taking the matter parameter a equiv 2sqrt2 g_rm f n_e e to be an arbitrary scalelike variable with n_e being the net electron number density and e being the neutrino beam energy we derive a complete set of differential equations for the effective neutrino mixing matrix v and the effective neutrino masses widetildem_i for i 1 2 3 given the standard parametrization of v the rges for widetildetheta_12 widetildetheta_13 widetildetheta_23 widetildedelta in matter are formulated for the first time we demonstrate some useful differential invariants which retain the same form from vacuum to matter including the wellknown naumov and toshev relations the rges of the partial mutau asymmetries the offdiagonal asymmetries and the sides of unitarity triangles of v are also obtained as a byproduct | [['we', 'borrow', 'the', 'general', 'idea', 'of', 'renormalizationgroup', 'equations', 'rges', 'to', 'understand', 'how', 'neutrino', 'masses', 'and', 'flavor', 'mixing', 'parameters', 'evolve', 'when', 'neutrinos', 'propagate', 'in', 'a', 'medium', 'highlighting', 'a', 'meaningful', 'possibility', 'that', 'the', 'genuine', 'flavor', 'quantities', 'in', 'vacuum', 'can', 'be', 'extrapolated', 'from', 'their', 'mattercorrected', 'counterparts', 'to', 'be', 'measured', 'in', 'some', 'realistic', 'neutrino', 'oscillation', 'experiments', 'taking', 'the', 'matter', 'parameter', 'a', 'equiv', '2sqrt2', 'g_rm', 'f', 'n_e', 'e', 'to', 'be', 'an', 'arbitrary', 'scalelike', 'variable', 'with', 'n_e', 'being', 'the', 'net', 'electron', 'number', 'density', 'and', 'e', 'being', 'the', 'neutrino', 'beam', 'energy', 'we', 'derive', 'a', 'complete', 'set', 'of', 'differential', 'equations', 'for', 'the', 'effective', 'neutrino', 'mixing', 'matrix', 'v', 'and', 'the', 'effective', 'neutrino', 'masses', 'widetildem_i', 'for', 'i', '1', '2', '3', 'given', 'the', 'standard', 'parametrization', 'of', 'v', 'the', 'rges', 'for', 'widetildetheta_12', 'widetildetheta_13', 'widetildetheta_23', 'widetildedelta', 'in', 'matter', 'are', 'formulated', 'for', 'the', 'first', 'time', 'we', 'demonstrate', 'some', 'useful', 'differential', 'invariants', 'which', 'retain', 'the', 'same', 'form', 'from', 'vacuum', 'to', 'matter', 'including', 'the', 'wellknown', 'naumov', 'and', 'toshev', 'relations', 'the', 'rges', 'of', 'the', 'partial', 'mutau', 'asymmetries', 'the', 'offdiagonal', 'asymmetries', 'and', 'the', 'sides', 'of', 'unitarity', 'triangles', 'of', 'v', 'are', 'also', 'obtained', 'as', 'a', 'byproduct']] | [-0.12022108115732323, 0.20861641990454383, -0.04360416393827236, 0.15161213396742484, -0.06910843348000632, -0.1260549271625445, 0.03613118424491827, 0.3023138316835515, -0.25080637149729357, -0.313878869150527, 0.04935454926724264, -0.28833068051743643, -0.03726199305979102, 0.15961985794832756, 0.043604476707662605, 0.04301415053250398, 0.0012394124344207865, 0.01580130963499636, -0.1148004186093309, -0.2170542815685283, 0.3038214928968701, 0.00605470119152478, 0.19011515368393428, 0.05307141622680044, 0.09399202455181715, -0.043789802971268936, -0.048318240727260056, -0.01590459634614892, -0.12957887929414302, 0.02450886175041845, 0.20232569624881022, 0.12032991315056786, 0.12715262648931078, -0.41053476487692486, -0.1733106191454152, 0.15407674138022717, 0.13536302716238424, 0.09934471656641447, -0.03860321699446717, -0.30988579274014416, 0.04319581078896082, -0.19881721390384186, -0.16115503240279247, -0.07632226957519929, 0.0256039367414751, -0.015546683353361089, -0.34248980161257436, 0.09385666529851733, -0.025795406053116178, -0.02281865635670202, -0.012256079737833419, -0.18559527038095713, -0.04802793187906879, 0.08975903482428822, 0.082438052147302, -0.002546803798353256, 0.11609041492785002, -0.1546044397806792, -0.03759424603370906, 0.420600047345858, -0.08301202716917709, -0.1900896583710862, 0.09187703974934858, -0.17824066192626434, -0.12118701927017334, 0.11547103803875575, 0.16413287876368782, 0.07449066974655834, -0.15766441740468212, 0.1295637206548722, -0.08445728800109274, 0.13246268552570972, 0.06879547293850242, 0.03174264770343651, 0.21893138451323044, 0.11843312316967397, 0.06519587244838476, -0.014398262995771717, -0.05652456557605589, -0.015704538943895768, -0.37834768466919466, -0.12013033025378231, -0.09501323120960922, 0.10153404217170076, -0.12739876392583407, -0.09258092934980469, 0.41074361056928677, 0.13637123292929298, 0.22244541390344155, 0.03056701738725763, 0.2632172979342719, 0.14001139387534728, 0.04127986103345012, 0.07092942342941844, 0.263282060803545, 0.18025384406927367, 0.08747721996786463, -0.2550861785285781, -0.012523607437520526, 0.07439492507918932] |
1,802.00991 | On the algebraic and arithmetic structure of the monoid of product-one
sequences | Let $G$ be a finite group. A finite unordered sequence $S = g_1
\boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where
repetition is allowed, is a product-one sequence if its terms can be ordered
such that their product equals $1_G$, the identity element of the group. As
usual, we consider sequences as elements of the free abelian monoid $\mathcal F
(G)$ with basis $G$, and we study the submonoid $\mathcal B (G) \subset
\mathcal F (G)$ of all product-one sequences. This is a finitely generated
C-monoid, which is a Krull monoid if and only if $G$ is abelian. In case of
abelian groups, $\mathcal B (G)$ is a well-studied object. In the present paper
we focus on non-abelian groups, and we study the class semigroup and the
arithmetic of $\mathcal B (G)$.
| math.AC math.CO | let g be a finite group a finite unordered sequence s g_1 boldsymbolcdot ldots boldsymbolcdot g_ell of terms from g where repetition is allowed is a productone sequence if its terms can be ordered such that their product equals 1_g the identity element of the group as usual we consider sequences as elements of the free abelian monoid mathcal f g with basis g and we study the submonoid mathcal b g subset mathcal f g of all productone sequences this is a finitely generated cmonoid which is a krull monoid if and only if g is abelian in case of abelian groups mathcal b g is a wellstudied object in the present paper we focus on nonabelian groups and we study the class semigroup and the arithmetic of mathcal b g | [['let', 'g', 'be', 'a', 'finite', 'group', 'a', 'finite', 'unordered', 'sequence', 's', 'g_1', 'boldsymbolcdot', 'ldots', 'boldsymbolcdot', 'g_ell', 'of', 'terms', 'from', 'g', 'where', 'repetition', 'is', 'allowed', 'is', 'a', 'productone', 'sequence', 'if', 'its', 'terms', 'can', 'be', 'ordered', 'such', 'that', 'their', 'product', 'equals', '1_g', 'the', 'identity', 'element', 'of', 'the', 'group', 'as', 'usual', 'we', 'consider', 'sequences', 'as', 'elements', 'of', 'the', 'free', 'abelian', 'monoid', 'mathcal', 'f', 'g', 'with', 'basis', 'g', 'and', 'we', 'study', 'the', 'submonoid', 'mathcal', 'b', 'g', 'subset', 'mathcal', 'f', 'g', 'of', 'all', 'productone', 'sequences', 'this', 'is', 'a', 'finitely', 'generated', 'cmonoid', 'which', 'is', 'a', 'krull', 'monoid', 'if', 'and', 'only', 'if', 'g', 'is', 'abelian', 'in', 'case', 'of', 'abelian', 'groups', 'mathcal', 'b', 'g', 'is', 'a', 'wellstudied', 'object', 'in', 'the', 'present', 'paper', 'we', 'focus', 'on', 'nonabelian', 'groups', 'and', 'we', 'study', 'the', 'class', 'semigroup', 'and', 'the', 'arithmetic', 'of', 'mathcal', 'b', 'g']] | [-0.22604342906216857, 0.18904293927840377, -0.04223069283073299, -0.01987209689860296, -0.10361209336867314, -0.12626826198316599, 0.008409008078938279, 0.381998807988094, -0.35714323215812216, -0.20443857618885733, 0.08954459341697907, -0.27515681406468834, -0.07779216462788918, 0.1444446878713904, -0.13076536909797948, -0.09303104032038974, 0.07927803012705942, 0.1971328751902089, -0.04104881375701032, -0.24556310787860958, 0.3540699394448227, -0.1317723146248751, 0.18098752174476687, -0.010572142337399129, 0.07312601422962114, -0.0053399704860608655, -0.003749573606827104, 0.0069524374850919, -0.15846608036211274, 0.05969391729796433, 0.29543644127272467, 0.09674533534411142, 0.2605402444183599, -0.30883380037711095, -0.11969600710306914, 0.30427690070719665, 0.1268401376988369, -0.09180498296547795, -0.006550205534658188, -0.23318992164305888, 0.19891160903036423, -0.22247355763146384, -0.05398746534830087, -0.012153699126748638, 0.19757353622494764, 0.005324343450452762, -0.34286882816849434, -0.029236377160000892, 0.10311265589975048, 0.10199297510464285, 0.062445020247144156, -0.12433715345238457, -0.1160953872062209, 0.09340792364895856, -0.03018972817506243, 0.1289730503557975, 0.06939797624163614, -0.04845139454652107, -0.09456169014469586, 0.4489200924530284, -0.12139613341601416, -0.18240553339168372, 0.09405008302148403, -0.21645242740748494, -0.15127457858539606, 0.08274571125516454, 0.05544238951313132, 0.2573329643239729, -0.002606877296423639, 0.28221529412424573, -0.20670971267266583, 0.09689380187996244, 0.040321201889398896, 0.022147507538293837, 0.11619556977107894, 0.09905947944396425, 0.06607540532633777, 0.15237581069965114, 0.06898515635767226, 0.14567771400942622, -0.38173042354351694, -0.1289068243132179, -0.16126091224905673, 0.1678325520927897, -0.08898354798176802, -0.17481870832319818, 0.38652487753229287, 0.05766186073692586, 0.12143895705408267, 0.08649247107078244, 0.17540057464182832, 0.06189195643079588, 0.04275936934295402, 0.09897499722304207, -0.023725251123337572, 0.23913869512359498, -0.16472931985053738, -0.18979951431654848, -0.00993235757617095, 0.24561271381400923] |
1,802.00992 | Determining JPEG Image Standard Quality Factor from the Quantization
Tables | Identifying the quality factor of JPEG images is very useful for applications
in digital image forensics. Though several command-line tools exist and are
used in widely used software such as \emph{GIMP} (GNU Image Manipulation
Program), the well-known image editing software, or the \emph{ImageMagick}
suite, we have found that those may provide inaccurate or even wrong results.
This paper presents a simple method for determining the exact quality factor of
a JPEG image from its quantization tables. The method is presented briefly and
a sample program, written in Unix/Linux Shell bash language is provided.
| eess.IV | identifying the quality factor of jpeg images is very useful for applications in digital image forensics though several commandline tools exist and are used in widely used software such as emphgimp gnu image manipulation program the wellknown image editing software or the emphimagemagick suite we have found that those may provide inaccurate or even wrong results this paper presents a simple method for determining the exact quality factor of a jpeg image from its quantization tables the method is presented briefly and a sample program written in unixlinux shell bash language is provided | [['identifying', 'the', 'quality', 'factor', 'of', 'jpeg', 'images', 'is', 'very', 'useful', 'for', 'applications', 'in', 'digital', 'image', 'forensics', 'though', 'several', 'commandline', 'tools', 'exist', 'and', 'are', 'used', 'in', 'widely', 'used', 'software', 'such', 'as', 'emphgimp', 'gnu', 'image', 'manipulation', 'program', 'the', 'wellknown', 'image', 'editing', 'software', 'or', 'the', 'emphimagemagick', 'suite', 'we', 'have', 'found', 'that', 'those', 'may', 'provide', 'inaccurate', 'or', 'even', 'wrong', 'results', 'this', 'paper', 'presents', 'a', 'simple', 'method', 'for', 'determining', 'the', 'exact', 'quality', 'factor', 'of', 'a', 'jpeg', 'image', 'from', 'its', 'quantization', 'tables', 'the', 'method', 'is', 'presented', 'briefly', 'and', 'a', 'sample', 'program', 'written', 'in', 'unixlinux', 'shell', 'bash', 'language', 'is', 'provided']] | [-0.06648035118213066, -0.06880845076271466, -0.09547852727860867, 0.12860770026160465, -0.08846768208748691, -0.17390911486818567, -0.01671162662019564, 0.455046069245417, -0.2456163447759636, -0.35310261017018624, 0.1657432274608924, -0.22883371512436276, -0.14089720942346112, 0.279692349448841, -0.12948381843986911, 0.09547815278906804, 0.13872438522754077, -0.00012722072302834593, -0.0452685550694446, -0.26810004398390486, 0.24329533624452548, 0.06814652935161696, 0.31157339839418263, 0.01649382656214984, 0.04975906540997899, 0.00026269425423099444, -0.10236667118106897, 0.007332471296559651, -0.08277782005973347, 0.10893554028486935, 0.3608364183558049, 0.2566864341778865, 0.2644879390373007, -0.3996320252538151, -0.1416695584635158, 0.010371103012872921, 0.15942605586394995, 0.14052892020381577, -0.13692313521668048, -0.2776473832449743, 0.10275770512992864, -0.18940263219781547, -0.04677486969964006, -0.12011288151984195, -0.014970805310480461, -0.028024371887383225, -0.2327203081938653, 0.02563884998620539, 0.06802794967642423, 0.11174857246454109, 0.011251912165719729, -0.16883576138374898, 0.038644697199892865, 0.17108435423278434, 0.01720007375435351, 0.08756555300615318, 0.16695908592645448, -0.17026558955670795, -0.08226460033188482, 0.47346953524706453, -0.014082293875597335, -0.1924653055113075, 0.17038450875206962, -0.02416708478691302, -0.15801687559092437, 0.11438180815305683, 0.16634481448352664, 0.09441139521384305, -0.18043295251573999, 0.054157059403023795, -0.005797063897281967, 0.20990717924803823, 0.0937086169730749, 0.004924180134516823, 0.16689508047036744, 0.17296548100741027, -0.024112909016516675, 0.18282238267372353, -0.07965471483204145, 0.019510364385096582, -0.24342037834979308, -0.15782313560939057, -0.1666046297587045, -0.014070105616126087, -0.06325467439479665, -0.2080841253583248, 0.37867721643012303, 0.1755750034743879, 0.08238940307317855, 0.001294479009459962, 0.3662685968856849, 0.032362564839166844, 0.10903359060738604, 0.0889995107478411, 0.1488834258660183, 0.019181160901028376, 0.13542819905330192, -0.10093315040045367, 0.08375537308485625, 0.050575360031491455] |
1,802.00993 | A two-parameter extension of the Urbanik semigroup | We prove that s_n(a,b)=\Gamma(an+b)/\Gamma(b), n=0,1,\ldots is an infinitely
divisible Stieltjes moment sequence for arbitrary a,b>0. Its powers s_n(a,b)^c,
c>0 are Stieltjes determinate if and only if ac\le 2. The latter was
conjectured in a paper by Lin (ArXiv: 1711.01536) in the case b=1. We describe
a product convolution semigroup \tau_c(a,b), c>0 of probability measures on the
positive half-line with densities e_c(a,b) and having the moments s_n(a,b)^c.
We determine the asymptotic behaviour of e_c(a,b)(t) for t\to 0 and for
t\to\infty, and the latter implies the Stieltjes indeterminacy when ac>2. The
results extend previous work of the author and J. L. L\'opez and lead to a
convolution semigroup of probability densities (g_c(a,b)(x))_{c>0} on the real
line. The special case (g_c(a,1)(x))_{c>0} are the convolution roots of the
Gumbel distribution with scale parameter a>0. All the densities g_c(a,b)(x)
lead to determinate Hamburger moment problems.
| math.CV | we prove that s_nabgammaanbgammab n01ldots is an infinitely divisible stieltjes moment sequence for arbitrary ab0 its powers s_nabc c0 are stieltjes determinate if and only if acle 2 the latter was conjectured in a paper by lin arxiv 171101536 in the case b1 we describe a product convolution semigroup tau_cab c0 of probability measures on the positive halfline with densities e_cab and having the moments s_nabc we determine the asymptotic behaviour of e_cabt for tto 0 and for ttoinfty and the latter implies the stieltjes indeterminacy when ac2 the results extend previous work of the author and j l lopez and lead to a convolution semigroup of probability densities g_cabx_c0 on the real line the special case g_ca1x_c0 are the convolution roots of the gumbel distribution with scale parameter a0 all the densities g_cabx lead to determinate hamburger moment problems | [['we', 'prove', 'that', 's_nabgammaanbgammab', 'n01ldots', 'is', 'an', 'infinitely', 'divisible', 'stieltjes', 'moment', 'sequence', 'for', 'arbitrary', 'ab0', 'its', 'powers', 's_nabc', 'c0', 'are', 'stieltjes', 'determinate', 'if', 'and', 'only', 'if', 'acle', '2', 'the', 'latter', 'was', 'conjectured', 'in', 'a', 'paper', 'by', 'lin', 'arxiv', '171101536', 'in', 'the', 'case', 'b1', 'we', 'describe', 'a', 'product', 'convolution', 'semigroup', 'tau_cab', 'c0', 'of', 'probability', 'measures', 'on', 'the', 'positive', 'halfline', 'with', 'densities', 'e_cab', 'and', 'having', 'the', 'moments', 's_nabc', 'we', 'determine', 'the', 'asymptotic', 'behaviour', 'of', 'e_cabt', 'for', 'tto', '0', 'and', 'for', 'ttoinfty', 'and', 'the', 'latter', 'implies', 'the', 'stieltjes', 'indeterminacy', 'when', 'ac2', 'the', 'results', 'extend', 'previous', 'work', 'of', 'the', 'author', 'and', 'j', 'l', 'lopez', 'and', 'lead', 'to', 'a', 'convolution', 'semigroup', 'of', 'probability', 'densities', 'g_cabx_c0', 'on', 'the', 'real', 'line', 'the', 'special', 'case', 'g_ca1x_c0', 'are', 'the', 'convolution', 'roots', 'of', 'the', 'gumbel', 'distribution', 'with', 'scale', 'parameter', 'a0', 'all', 'the', 'densities', 'g_cabx', 'lead', 'to', 'determinate', 'hamburger', 'moment', 'problems']] | [-0.11010617657585908, 0.11267369052935979, -0.052729572759557315, 0.07472604777368909, -0.05485657622099264, -0.12288392177527017, 0.022500552374777164, 0.34572208530575266, -0.26181345060112254, -0.18638658157784407, 0.11324137670542504, -0.305510358374836, -0.07429705955486261, 0.13783117878883508, -0.06374839468652965, 0.05752712487863405, 0.029083481022931693, 0.08451317247351674, -0.05971952095691769, -0.250109727202936, 0.35602877011792805, -0.014988002861416294, 0.2036067089681311, 0.07377285671505707, 0.08293863350546826, -0.024967854908193844, -0.010635414564242687, -0.05979104144569799, -0.1717737168876231, 0.06265686740227869, 0.21526640961444332, 0.08277088524027237, 0.248857359835551, -0.33561936967814243, -0.11641675251258807, 0.18282254628094183, 0.12053973360328388, -0.01998954161980282, 0.01742556098873464, -0.2818695195303618, 0.10156433260110953, -0.154972173887632, -0.1867446198256132, -0.08747119754055188, 0.1161579594783883, 0.12678023611767686, -0.3423409129116144, 0.0875512232705382, 0.14047110960854373, 0.023716545997912647, -0.05723393575967296, -0.20153019284004814, 0.019726306356432785, 0.08691110438067388, 0.09575046934294053, 0.04905073193545304, 0.049433110658619696, -0.08039140976647285, -0.06374904584452395, 0.3071786651089219, -0.054174548722377036, -0.22312074160658335, 0.10675919092196318, -0.24003588566592118, -0.19711700703891863, 0.10890712179616804, 0.06170790486805539, 0.17195910447142052, -0.06175245658038202, 0.19721455579065497, -0.07651013631430519, 0.10704019831720996, 0.1384853014619381, -0.043221521098877634, 0.1108663190682312, 0.02586785785743668, 0.08272868176595173, 0.13266639456060494, -0.03124456098729759, -0.07425934090527869, -0.32312614922162913, -0.1834271924875904, -0.2386748179329474, 0.12296115010727965, -0.09983940975929838, -0.16811934449063, 0.3303162755003867, 0.09123678534213482, 0.19620114389295115, 0.14966356466375008, 0.18148288674624138, 0.1856239716316225, -0.019477350857706015, 0.08590273515918165, 0.12021983137979876, 0.18846072572397196, 0.09457289887314932, -0.1621987179618414, 0.07995300566713603, 0.1642555271111827] |
1,802.00994 | A new integer-valued AR(1) process based on power series thinning
operator | In this paper, we introduce the first-order integer-valued autoregressive
(INAR(1)) model, with Poisson-Lindley innovations based on power series
thinning operator. Some mathematical features of this process are given and
estimating the parameters is discussed by three methods; conditional least
squares, Yule-Walker equations and conditional maximum likelihood.Then the
results are studied for three special cases of power series operators. Finally,
some numerical results are presented with a discussion to the obtained results
and Four real data sets are used to show the potentially of the new process.
| stat.AP | in this paper we introduce the firstorder integervalued autoregressive inar1 model with poissonlindley innovations based on power series thinning operator some mathematical features of this process are given and estimating the parameters is discussed by three methods conditional least squares yulewalker equations and conditional maximum likelihoodthen the results are studied for three special cases of power series operators finally some numerical results are presented with a discussion to the obtained results and four real data sets are used to show the potentially of the new process | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'firstorder', 'integervalued', 'autoregressive', 'inar1', 'model', 'with', 'poissonlindley', 'innovations', 'based', 'on', 'power', 'series', 'thinning', 'operator', 'some', 'mathematical', 'features', 'of', 'this', 'process', 'are', 'given', 'and', 'estimating', 'the', 'parameters', 'is', 'discussed', 'by', 'three', 'methods', 'conditional', 'least', 'squares', 'yulewalker', 'equations', 'and', 'conditional', 'maximum', 'likelihoodthen', 'the', 'results', 'are', 'studied', 'for', 'three', 'special', 'cases', 'of', 'power', 'series', 'operators', 'finally', 'some', 'numerical', 'results', 'are', 'presented', 'with', 'a', 'discussion', 'to', 'the', 'obtained', 'results', 'and', 'four', 'real', 'data', 'sets', 'are', 'used', 'to', 'show', 'the', 'potentially', 'of', 'the', 'new', 'process']] | [-0.07749214686234207, 0.06316211712820564, -0.05030885755139239, 0.0585877258606642, -0.0688092731843319, -0.13385650263003568, -0.016285668169696104, 0.38022874457871214, -0.2604259624255492, -0.2343461370369529, 0.1809404781403239, -0.31086404721033484, -0.19200023344772704, 0.23474730772842817, -0.07660323189954986, 0.13509226121446666, 0.04502971255603959, 0.022611962039681043, -0.06287618208238308, -0.30597240336184556, 0.3429396288058556, 0.022747604036361307, 0.24359577636727514, 0.001346876855720492, 0.11172700439004556, -0.03527605429647819, -0.09951987227644114, 0.01660931948450418, -0.1399288415141842, 0.13688993803499377, 0.2378969033851343, 0.145035308747388, 0.2916392261052833, -0.41783579897738116, -0.2078290692256654, 0.08405672429019914, 0.08146407499443739, 0.04771388351424214, -0.027533094213782427, -0.2675858664600288, 0.08415025645278065, -0.15878302511923453, -0.07891696340075749, -0.12956754056298558, -0.03756035268306732, 0.08805460947401383, -0.3435511046144016, 0.05453625159228549, 0.0764491082443034, 0.08163360132671454, -0.03722663301536266, -0.20040182130246917, 0.03139456210329252, 0.05800656476879821, 0.08032130825073075, -0.06657594584805124, 0.0652664976358852, -0.07839143111863557, -0.17876382660230292, 0.31978467676569433, -0.06765452979255797, -0.2375995172516388, 0.1526773376198595, -0.150935130319832, -0.17529036086052657, 0.06635776853106697, 0.17390968118355993, 0.12788724708644783, -0.18264280123745694, 0.01831218893160386, -0.04105925260330824, 0.10122218321022743, 0.02375155061702518, -0.015039374613586594, 0.11630194898256484, 0.14881375139743527, 0.0059602378360817535, 0.15107013527577853, -0.08355199184871334, -0.12937223150340074, -0.34962750706164275, -0.11479733890908606, -0.1597265509340693, -0.04763718169072972, -0.1347527989783831, -0.15994101417634418, 0.42284129235674356, 0.16439903595430008, 0.22368154800223078, 0.10691524192909985, 0.2756520634736208, 0.20527976559584632, -0.020462754998794373, 0.06937817416756469, 0.15802751157556058, 0.1326952696640921, 0.06590960563215263, -0.12645932902198503, 0.06987388616646914, 0.09939747831017218] |
1,802.00995 | Comment on "Energy-time uncertainty relation for driven quantum systems"
and "Quantum Speed Limit for Non-Markovian Dynamics" | Deffner and Lutz [J. Phys. A 46, 335302 (2013) and Phys. Rev. Lett. 111,
010402 (2013).] extended the Mandelstam-Tamm bound and the Margolus-Levitin
bound to time-dependent and non-Markovian systems, respectively. Although the
derivation of the Mandelstam-Tamm bound is correct, we point out that thier
analysis of the Margolus-Levitin bound is incorrect. The Margolus-Levitin bound
has not yet been established in time-dependent quantum systems, except for the
adiabatic case.
| quant-ph | deffner and lutz j phys a 46 335302 2013 and phys rev lett 111 010402 2013 extended the mandelstamtamm bound and the margoluslevitin bound to timedependent and nonmarkovian systems respectively although the derivation of the mandelstamtamm bound is correct we point out that thier analysis of the margoluslevitin bound is incorrect the margoluslevitin bound has not yet been established in timedependent quantum systems except for the adiabatic case | [['deffner', 'and', 'lutz', 'j', 'phys', 'a', '46', '335302', '2013', 'and', 'phys', 'rev', 'lett', '111', '010402', '2013', 'extended', 'the', 'mandelstamtamm', 'bound', 'and', 'the', 'margoluslevitin', 'bound', 'to', 'timedependent', 'and', 'nonmarkovian', 'systems', 'respectively', 'although', 'the', 'derivation', 'of', 'the', 'mandelstamtamm', 'bound', 'is', 'correct', 'we', 'point', 'out', 'that', 'thier', 'analysis', 'of', 'the', 'margoluslevitin', 'bound', 'is', 'incorrect', 'the', 'margoluslevitin', 'bound', 'has', 'not', 'yet', 'been', 'established', 'in', 'timedependent', 'quantum', 'systems', 'except', 'for', 'the', 'adiabatic', 'case']] | [-0.12832836696961478, 0.08317992705573786, -0.10859927337672283, 0.014538849929848047, -0.036690414313282536, -0.1628572822882057, 0.15197836867804682, 0.24914900647170507, -0.0788058788418325, -0.3534735523775887, 0.03471282318950311, -0.264924350152932, -0.16948036424148438, 0.24253525465393244, -0.12565416874669827, 0.0713089652248283, 0.011660722181645792, -0.030375466987824264, -0.06363014998817955, -0.29179291908087124, 0.14357847509099475, 0.11340014436872982, 0.27104745242864575, 0.14404055179416467, 0.027270991087599256, 0.04194403183298992, -0.006264072425885877, -0.07769623804670661, -0.2434422272895402, 0.04074338188311502, 0.18048345203052707, 0.053522161649428864, 0.22249164102154215, -0.35266169344088927, -0.18252843582252068, 0.09779152695311984, 0.0748227941178119, 0.1663321286245291, 0.05417237213965672, -0.3934754460125661, 0.007685795640086394, -0.19980560829723948, -0.10988176618216199, -0.09843997209708193, 0.20199277721790235, -0.043881754974709516, -0.24641737285236925, 0.23971608147692325, 0.15748337016844038, 0.015512659631447117, -0.0035819627810269594, -0.1279199208313627, -0.024885478568499656, -0.029002713254972626, -0.07027520097569744, 0.09415345837070203, 0.0710053524878154, 0.0032322870484038967, -0.1375214485034569, 0.29960304629335655, -0.05522035940814374, -0.14872086170449186, 0.21012714922553233, -0.08563604955074948, -0.17374411419923627, 0.05704141142708597, 0.11539968085794974, 0.14927753915405595, -0.19804046022247024, 0.19596196112306372, -0.12604882807206752, 0.11699817000424365, 0.1262016546731787, 0.029862974235204173, 0.08947761607036661, 0.018771749257401965, 0.004427941891350853, 0.08049227044319929, -0.071746206022243, -0.1686906199902296, -0.31077133795357686, -0.1913651002478897, -0.23305565307834256, 0.12547009987882582, 0.04340609419593977, -0.09084636166191368, 0.2981711933250303, 0.12045284265429894, 0.14432173569811813, -0.010627194481498715, 0.15039687322925277, 0.17787684016485714, -0.06683724826034992, 0.25092177266783233, 0.31775652303068497, 0.2440133394895872, 0.05718502829740964, -0.20811776373424193, 0.014564999751051638, 0.10012051629931179] |
1,802.00996 | Assessing Prediction Error at Interpolation and Extrapolation Points | Common model selection criteria, such as $AIC$ and its variants, are based on
in-sample prediction error estimators. However, in many applications involving
predicting at interpolation and extrapolation points, in-sample error cannot be
used for estimating the prediction error. In this paper new prediction error
estimators, $tAI$ and $Loss(w_{t})$ are introduced. These estimators generalize
previous error estimators, however are also applicable for assessing prediction
error in cases involving interpolation and extrapolation. Based on the
prediction error estimators, two model selection criteria with the same spirit
as $AIC$ are suggested. The advantages of our suggested methods are
demonstrated in simulation and real data analysis of studies involving
interpolation and extrapolation in a Linear Mixed Model framework.
| stat.ME | common model selection criteria such as aic and its variants are based on insample prediction error estimators however in many applications involving predicting at interpolation and extrapolation points insample error cannot be used for estimating the prediction error in this paper new prediction error estimators tai and lossw_t are introduced these estimators generalize previous error estimators however are also applicable for assessing prediction error in cases involving interpolation and extrapolation based on the prediction error estimators two model selection criteria with the same spirit as aic are suggested the advantages of our suggested methods are demonstrated in simulation and real data analysis of studies involving interpolation and extrapolation in a linear mixed model framework | [['common', 'model', 'selection', 'criteria', 'such', 'as', 'aic', 'and', 'its', 'variants', 'are', 'based', 'on', 'insample', 'prediction', 'error', 'estimators', 'however', 'in', 'many', 'applications', 'involving', 'predicting', 'at', 'interpolation', 'and', 'extrapolation', 'points', 'insample', 'error', 'can', 'not', 'be', 'used', 'for', 'estimating', 'the', 'prediction', 'error', 'in', 'this', 'paper', 'new', 'prediction', 'error', 'estimators', 'tai', 'and', 'lossw_t', 'are', 'introduced', 'these', 'estimators', 'generalize', 'previous', 'error', 'estimators', 'however', 'are', 'also', 'applicable', 'for', 'assessing', 'prediction', 'error', 'in', 'cases', 'involving', 'interpolation', 'and', 'extrapolation', 'based', 'on', 'the', 'prediction', 'error', 'estimators', 'two', 'model', 'selection', 'criteria', 'with', 'the', 'same', 'spirit', 'as', 'aic', 'are', 'suggested', 'the', 'advantages', 'of', 'our', 'suggested', 'methods', 'are', 'demonstrated', 'in', 'simulation', 'and', 'real', 'data', 'analysis', 'of', 'studies', 'involving', 'interpolation', 'and', 'extrapolation', 'in', 'a', 'linear', 'mixed', 'model', 'framework']] | [-0.0029552483588064973, -0.05191061121264571, -0.07504616180034518, 0.18460355087473432, -0.026859916852819816, -0.19429187121261893, 0.0819529742257784, 0.39758861512599286, -0.19582110251659496, -0.32893270044996026, 0.20936643707937674, -0.2572288797808844, -0.17005457333697563, 0.2729111148979874, -0.14426176836959234, 0.17539112059054324, 0.09622575338570434, -0.018659384610752266, -0.12130282781078693, -0.2987216962746492, 0.2470869167928437, 0.08034879842511657, 0.3356483102665822, -0.024029821976447444, 0.04812283289573858, 0.010197895901224559, -0.0970818188425415, 0.013750036670978915, -0.13136358202124634, 0.13333996330600298, 0.26409265666938664, 0.12052333545299214, 0.3463679904673706, -0.31808416628515707, -0.27522115887289766, 0.1160749463086719, 0.15843804221061109, 0.09431566360504612, -0.028014152983750887, -0.26278407196105835, 0.05775432248616166, -0.15148375003257553, -0.0077917229858014666, -0.14100181426967315, -0.07085026068032899, 0.07209493293173677, -0.4040071578132675, 0.15501287257020044, 0.02496314857496161, 0.1040719084180238, -0.0713949355249816, -0.2222907065838706, 0.039975172776745206, 0.08944344913113143, 0.10361342611334597, -0.0019240951627133448, 0.09200827457549933, -0.06490098552884567, -0.1922576290426629, 0.34494655930616874, -0.029103915484850865, -0.2627822233592732, 0.17668075596897356, -0.060369819525237144, -0.13933953286450879, 0.043966052398134614, 0.22140325290526738, 0.06926598090879117, -0.12691793947382585, 0.009609378536289003, 0.025196656846163564, 0.10537650289112016, 0.025591983316923705, 0.018394039155457887, 0.12767409666425042, 0.19478535367862174, 0.02664638705921294, 0.04116415312378913, -0.13977995153982192, -0.10524914094569619, -0.3427897051564957, -0.09711803932951991, -0.19941749177840457, -0.0712756070668611, -0.13423743734484447, -0.19413886207621545, 0.3657558446652011, 0.2207608350609805, 0.15741412788874617, 0.10402316800645438, 0.32435657330094264, 0.11837683209083288, 0.042655550435084844, 0.08368070408489489, 0.2508621059823781, 0.12024207385420277, -0.01183987862283462, -0.15410015724084683, 0.13799244069633188, 0.11443938585733504] |
1,802.00997 | Polynomial pseudomonads and dependent type theory | We assemble polynomials in a locally cartesian closed category into a
tricategory, allowing us to define the notion of a polynomial pseudomonad and
polynomial pseudoalgebra. Working in the context of natural models of type
theory, we prove that dependent type theories admitting a unit type and
dependent sum types give rise to polynomial pseudomonads, and that those
admitting dependent product types give rise to polynomial pseudoalgebras.
| math.CT math.LO | we assemble polynomials in a locally cartesian closed category into a tricategory allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra working in the context of natural models of type theory we prove that dependent type theories admitting a unit type and dependent sum types give rise to polynomial pseudomonads and that those admitting dependent product types give rise to polynomial pseudoalgebras | [['we', 'assemble', 'polynomials', 'in', 'a', 'locally', 'cartesian', 'closed', 'category', 'into', 'a', 'tricategory', 'allowing', 'us', 'to', 'define', 'the', 'notion', 'of', 'a', 'polynomial', 'pseudomonad', 'and', 'polynomial', 'pseudoalgebra', 'working', 'in', 'the', 'context', 'of', 'natural', 'models', 'of', 'type', 'theory', 'we', 'prove', 'that', 'dependent', 'type', 'theories', 'admitting', 'a', 'unit', 'type', 'and', 'dependent', 'sum', 'types', 'give', 'rise', 'to', 'polynomial', 'pseudomonads', 'and', 'that', 'those', 'admitting', 'dependent', 'product', 'types', 'give', 'rise', 'to', 'polynomial', 'pseudoalgebras']] | [-0.12859236805304658, 0.07900954370923115, -0.08883717014087421, 0.075576206097718, -0.1815500055778433, -0.18843012159182268, -0.01573153449201279, 0.3081439886326817, -0.35100210994256265, -0.20840503485647566, 0.04734002265754635, -0.16373822600651305, -0.15098706397905268, 0.18517509469706, -0.1108614353632385, -0.10804390478314775, 0.018222770734803016, 0.08150713696059855, -0.13692858274038316, -0.29968940257800347, 0.36891829161058093, -0.06234761685923194, 0.23452333163357142, 0.01903315196095994, 0.16778096053960986, 0.0045502800071104, -0.07134220712451321, 0.06591481619839076, -0.192039248391776, 0.1348600239716964, 0.28015059695798933, 0.11995940823742951, 0.19599031286038968, -0.42707607509907, -0.08830994367599487, 0.21348652356501782, 0.1344936415270874, 0.028938919813795524, 0.022992565434172073, -0.24958054374226116, 0.0679018495279844, -0.22274649354883216, -0.14601761390539733, -0.10253205055403558, 0.07135610437641542, 0.035117240054673995, -0.30027441317074455, 0.0090917751482321, 0.11625001895839832, 0.09193939431288252, -0.08707140013575554, -0.03303821765902368, 0.016579817200897996, 0.05168273370795897, -0.08653318630813649, 0.017658305678968176, 0.05209886368759202, -0.031224422890580063, -0.1463733660621625, 0.37319517050954426, -0.07411935921955967, -0.27878233536400576, 0.1739878683689643, -0.10305658845005161, -0.18568671150415234, 0.09747009332094228, 0.12359457378360358, 0.14190009687886093, -0.042627435448318436, 0.1583411798531994, -0.09782513448347648, 0.07321275556442385, 0.12980779549671392, 0.08835131782600938, 0.16739523779092866, 0.05092929341745647, 0.07610866231279391, 0.18179280200098275, 0.08857586580526197, -0.10991864905262252, -0.3602226140104573, -0.17159898017504902, -0.011788630896868805, 0.1464643404028858, -0.12000528906377661, -0.2715024907762806, 0.41620903397261194, 0.024128872407318064, 0.16942180081439967, 0.16168585799459834, 0.15580685036327463, 0.08876094553676067, 0.09175684777173129, 0.020381794550992323, 0.06756842774550685, 0.22529830648140473, 0.034236709414416866, -0.10575396113210556, 0.01680345764863446, 0.22342116840070847] |
1,802.00998 | nflWAR: A Reproducible Method for Offensive Player Evaluation in
Football | Unlike other major professional sports, American football lacks comprehensive
statistical ratings for player evaluation that are both reproducible and easily
interpretable in terms of game outcomes. Existing methods for player evaluation
in football depend heavily on proprietary data, are not reproducible, and lag
behind those of other major sports. We present four contributions to the study
of football statistics in order to address these issues. First, we develop the
R package nflscrapR to provide easy access to publicly available play-by-play
data from the National Football League (NFL) dating back to 2009. Second, we
introduce a novel multinomial logistic regression approach for estimating the
expected points for each play. Third, we use the expected points as input into
a generalized additive model for estimating the win probability for each play.
Fourth, we introduce our nflWAR framework, using multilevel models to isolate
the contributions of individual offensive skill players, and providing
estimates for their individual wins above replacement (WAR). We estimate the
uncertainty in each player's WAR through a resampling approach specifically
designed for football, and we present these results for the 2017 NFL season. We
discuss how our reproducible WAR framework, built entirely on publicly
available data, can be easily extended to estimate WAR for players at any
position, provided that researchers have access to data specifying which
players are on the field during each play. Finally, we discuss the potential
implications of this work for NFL teams.
| stat.AP | unlike other major professional sports american football lacks comprehensive statistical ratings for player evaluation that are both reproducible and easily interpretable in terms of game outcomes existing methods for player evaluation in football depend heavily on proprietary data are not reproducible and lag behind those of other major sports we present four contributions to the study of football statistics in order to address these issues first we develop the r package nflscrapr to provide easy access to publicly available playbyplay data from the national football league nfl dating back to 2009 second we introduce a novel multinomial logistic regression approach for estimating the expected points for each play third we use the expected points as input into a generalized additive model for estimating the win probability for each play fourth we introduce our nflwar framework using multilevel models to isolate the contributions of individual offensive skill players and providing estimates for their individual wins above replacement war we estimate the uncertainty in each players war through a resampling approach specifically designed for football and we present these results for the 2017 nfl season we discuss how our reproducible war framework built entirely on publicly available data can be easily extended to estimate war for players at any position provided that researchers have access to data specifying which players are on the field during each play finally we discuss the potential implications of this work for nfl teams | [['unlike', 'other', 'major', 'professional', 'sports', 'american', 'football', 'lacks', 'comprehensive', 'statistical', 'ratings', 'for', 'player', 'evaluation', 'that', 'are', 'both', 'reproducible', 'and', 'easily', 'interpretable', 'in', 'terms', 'of', 'game', 'outcomes', 'existing', 'methods', 'for', 'player', 'evaluation', 'in', 'football', 'depend', 'heavily', 'on', 'proprietary', 'data', 'are', 'not', 'reproducible', 'and', 'lag', 'behind', 'those', 'of', 'other', 'major', 'sports', 'we', 'present', 'four', 'contributions', 'to', 'the', 'study', 'of', 'football', 'statistics', 'in', 'order', 'to', 'address', 'these', 'issues', 'first', 'we', 'develop', 'the', 'r', 'package', 'nflscrapr', 'to', 'provide', 'easy', 'access', 'to', 'publicly', 'available', 'playbyplay', 'data', 'from', 'the', 'national', 'football', 'league', 'nfl', 'dating', 'back', 'to', '2009', 'second', 'we', 'introduce', 'a', 'novel', 'multinomial', 'logistic', 'regression', 'approach', 'for', 'estimating', 'the', 'expected', 'points', 'for', 'each', 'play', 'third', 'we', 'use', 'the', 'expected', 'points', 'as', 'input', 'into', 'a', 'generalized', 'additive', 'model', 'for', 'estimating', 'the', 'win', 'probability', 'for', 'each', 'play', 'fourth', 'we', 'introduce', 'our', 'nflwar', 'framework', 'using', 'multilevel', 'models', 'to', 'isolate', 'the', 'contributions', 'of', 'individual', 'offensive', 'skill', 'players', 'and', 'providing', 'estimates', 'for', 'their', 'individual', 'wins', 'above', 'replacement', 'war', 'we', 'estimate', 'the', 'uncertainty', 'in', 'each', 'players', 'war', 'through', 'a', 'resampling', 'approach', 'specifically', 'designed', 'for', 'football', 'and', 'we', 'present', 'these', 'results', 'for', 'the', '2017', 'nfl', 'season', 'we', 'discuss', 'how', 'our', 'reproducible', 'war', 'framework', 'built', 'entirely', 'on', 'publicly', 'available', 'data', 'can', 'be', 'easily', 'extended', 'to', 'estimate', 'war', 'for', 'players', 'at', 'any', 'position', 'provided', 'that', 'researchers', 'have', 'access', 'to', 'data', 'specifying', 'which', 'players', 'are', 'on', 'the', 'field', 'during', 'each', 'play', 'finally', 'we', 'discuss', 'the', 'potential', 'implications', 'of', 'this', 'work', 'for', 'nfl', 'teams']] | [-0.014747567951401815, 0.030714957636999007, -0.11846535103791889, 0.11097432861768422, -0.1290653660516948, -0.19902161453117398, 0.10108495661592547, 0.41625399537622293, -0.2109333432576758, -0.314444853114633, 0.11724648744343442, -0.3262025750940666, -0.1515090811110914, 0.1698972001166499, -0.12361969308273747, -0.0005120101969372084, 0.10694666634254316, 0.025825675811861303, 0.05213422704329516, -0.32252174355287816, 0.29366079684981006, 0.03545768914417304, 0.2814251575341567, 0.029753426555544138, 0.07383706616237759, 0.02587969850035424, -0.08987740889251074, 0.0028602732786353917, -0.14574358688420963, 0.12262201098962984, 0.34213904992033584, 0.2017809301911992, 0.3768103974930784, -0.42188523878799156, -0.12128242738148634, 0.10403997296903361, 0.07072118697143061, 0.09488779701678915, -0.016528635675662217, -0.304017848731514, 0.037087173090177644, -0.2056199553957645, -0.06947616927246464, -0.12559910709870623, -0.026252961845850534, 0.00013206968817146535, -0.2820813917753069, 0.022901459593088067, -0.008336880872462024, 0.09033577467731022, -0.041927800546003945, -0.1882798233594587, 0.024198163994290728, 0.25935448211756473, 0.045988974953565666, -0.0008056899403875812, 0.12758303894463213, -0.12590549401245377, -0.18932625064874029, 0.3799868963163425, -0.05440922329336048, -0.13567315768846805, 0.13657725163676004, -0.11700496103099368, -0.1659928186504329, 0.03577789820128794, 0.26024766354722545, 0.06439882138610242, -0.15642163205812587, -0.016856881725463145, -0.042630474223814746, 0.15624663365628333, 0.054759754218715935, -0.05141636091383531, 0.19191605637563353, 0.1623534699089508, 0.048435994043223005, 0.09609069875590107, -0.07816939853983833, -0.1534020703048148, -0.2911538796618264, -0.11902330362961251, -0.11557572416148763, -0.0284280091346405, -0.06557016017168087, -0.17604722520138355, 0.4057190721141214, 0.23262286520404543, 0.11832878719420827, 0.054821480351420954, 0.3199446599316248, 0.023228756481524, 0.043912098215808694, 0.092849505604542, 0.1968693635228308, -0.025349105208953643, 0.12507425476103387, -0.16658179034550794, 0.13816913018557936, 0.029755462985485794] |
1,802.00999 | Suppressed Far-UV Stellar Activity and Low Planetary Mass Loss in the
WASP-18 System | WASP-18 hosts a massive, very close-in Jupiter-like planet. Despite its young
age ($<$1 Gyr), the star presents an anomalously low stellar activity level:
the measured logR'$_{\rm HK}$ activity parameter lies slightly below the basal
level; there is no significant time-variability in the logR'$_{\rm HK}$ value;
there is no detection of the star in the X-rays. We present results of far-UV
observations of WASP-18 obtained with COS on board of Hubble Space Telescope
aimed at explaining this anomaly. From the star's spectral energy distribution,
we infer the extinction (E(B-V) $\approx$ 0.01 mag) and then the interstellar
medium (ISM) column density for a number of ions, concluding that ISM
absorption is not the origin of the anomaly. We measure the flux of the four
stellar emission features detected in the COS spectrum (CII, CIII, CIV, SiIV).
Comparing the CII/CIV flux ratio measured for WASP-18 with that derived from
spectra of nearby stars with known age, we see that the far-UV spectrum of
WASP-18 resembles that of old ($>$5 Gyr), inactive stars, in stark contrast
with its young age. We conclude that WASP-18 has an intrinsically low activity
level, possibly caused by star-planet tidal interaction, as suggested by
previous studies. Re-scaling the solar irradiance reference spectrum to match
the flux of the SiIV line, yields an XUV integrated flux at the planet orbit of
10.2 erg cm$^{-2}$ s$^{-1}$. We employ the rescaled XUV solar fluxes to models
of the planetary upper atmosphere, deriving an extremely low thermal mass-loss
rate of 10$^{-20}$ $M_{\rm J}$ Gyr$^{-1}$. For such high-mass planets, thermal
escape is not energy limited, but driven by Jeans escape.
| astro-ph.EP | wasp18 hosts a massive very closein jupiterlike planet despite its young age 1 gyr the star presents an anomalously low stellar activity level the measured logr_rm hk activity parameter lies slightly below the basal level there is no significant timevariability in the logr_rm hk value there is no detection of the star in the xrays we present results of faruv observations of wasp18 obtained with cos on board of hubble space telescope aimed at explaining this anomaly from the stars spectral energy distribution we infer the extinction ebv approx 001 mag and then the interstellar medium ism column density for a number of ions concluding that ism absorption is not the origin of the anomaly we measure the flux of the four stellar emission features detected in the cos spectrum cii ciii civ siiv comparing the ciiciv flux ratio measured for wasp18 with that derived from spectra of nearby stars with known age we see that the faruv spectrum of wasp18 resembles that of old 5 gyr inactive stars in stark contrast with its young age we conclude that wasp18 has an intrinsically low activity level possibly caused by starplanet tidal interaction as suggested by previous studies rescaling the solar irradiance reference spectrum to match the flux of the siiv line yields an xuv integrated flux at the planet orbit of 102 erg cm2 s1 we employ the rescaled xuv solar fluxes to models of the planetary upper atmosphere deriving an extremely low thermal massloss rate of 1020 m_rm j gyr1 for such highmass planets thermal escape is not energy limited but driven by jeans escape | [['wasp18', 'hosts', 'a', 'massive', 'very', 'closein', 'jupiterlike', 'planet', 'despite', 'its', 'young', 'age', '1', 'gyr', 'the', 'star', 'presents', 'an', 'anomalously', 'low', 'stellar', 'activity', 'level', 'the', 'measured', 'logr_rm', 'hk', 'activity', 'parameter', 'lies', 'slightly', 'below', 'the', 'basal', 'level', 'there', 'is', 'no', 'significant', 'timevariability', 'in', 'the', 'logr_rm', 'hk', 'value', 'there', 'is', 'no', 'detection', 'of', 'the', 'star', 'in', 'the', 'xrays', 'we', 'present', 'results', 'of', 'faruv', 'observations', 'of', 'wasp18', 'obtained', 'with', 'cos', 'on', 'board', 'of', 'hubble', 'space', 'telescope', 'aimed', 'at', 'explaining', 'this', 'anomaly', 'from', 'the', 'stars', 'spectral', 'energy', 'distribution', 'we', 'infer', 'the', 'extinction', 'ebv', 'approx', '001', 'mag', 'and', 'then', 'the', 'interstellar', 'medium', 'ism', 'column', 'density', 'for', 'a', 'number', 'of', 'ions', 'concluding', 'that', 'ism', 'absorption', 'is', 'not', 'the', 'origin', 'of', 'the', 'anomaly', 'we', 'measure', 'the', 'flux', 'of', 'the', 'four', 'stellar', 'emission', 'features', 'detected', 'in', 'the', 'cos', 'spectrum', 'cii', 'ciii', 'civ', 'siiv', 'comparing', 'the', 'ciiciv', 'flux', 'ratio', 'measured', 'for', 'wasp18', 'with', 'that', 'derived', 'from', 'spectra', 'of', 'nearby', 'stars', 'with', 'known', 'age', 'we', 'see', 'that', 'the', 'faruv', 'spectrum', 'of', 'wasp18', 'resembles', 'that', 'of', 'old', '5', 'gyr', 'inactive', 'stars', 'in', 'stark', 'contrast', 'with', 'its', 'young', 'age', 'we', 'conclude', 'that', 'wasp18', 'has', 'an', 'intrinsically', 'low', 'activity', 'level', 'possibly', 'caused', 'by', 'starplanet', 'tidal', 'interaction', 'as', 'suggested', 'by', 'previous', 'studies', 'rescaling', 'the', 'solar', 'irradiance', 'reference', 'spectrum', 'to', 'match', 'the', 'flux', 'of', 'the', 'siiv', 'line', 'yields', 'an', 'xuv', 'integrated', 'flux', 'at', 'the', 'planet', 'orbit', 'of', '102', 'erg', 'cm2', 's1', 'we', 'employ', 'the', 'rescaled', 'xuv', 'solar', 'fluxes', 'to', 'models', 'of', 'the', 'planetary', 'upper', 'atmosphere', 'deriving', 'an', 'extremely', 'low', 'thermal', 'massloss', 'rate', 'of', '1020', 'm_rm', 'j', 'gyr1', 'for', 'such', 'highmass', 'planets', 'thermal', 'escape', 'is', 'not', 'energy', 'limited', 'but', 'driven', 'by', 'jeans', 'escape']] | [-0.09300791954990688, 0.1675919254855165, -0.0039060528983168724, 0.10936211766279742, -0.05768069756603888, -0.06932935050583251, 0.0674925060217919, 0.43967642094237064, -0.11969839853255455, -0.3747280970988971, 0.018092452724604816, -0.30189727731795873, -0.002881010224656114, 0.19184238240474238, -0.088979275886602, -0.05169397660724397, 0.07723056280300161, -0.06758325474582753, -9.628266078542988e-05, -0.22173340597875277, 0.2642586448185919, 0.10650589944408187, 0.10182793714811164, 0.007399544527508178, 0.05701836934642655, -0.1325249159111167, -0.05490736635753288, -0.06417736313053196, -0.17682162763285647, 0.037900025323736215, 0.20797874443141035, 0.1492669210031207, 0.1926501727311538, -0.33186205753810566, -0.22329016954919217, 0.07152991269776633, 0.20012541949959858, -0.03767052161032861, -0.05643050080200411, -0.2502849500876728, 0.01926497898354494, -0.17212443711886288, -0.188337712841249, 0.10904573592322193, 0.08121561734357251, -0.015468471070294672, -0.2374581281295626, 0.15749307985127606, 0.0011008932883411926, 0.16791977589765458, -0.1607107389850085, -0.13057298012229368, -0.11716136065408377, 0.053304319009887725, 0.04482231113954254, 0.07495886774257018, 0.20451971215178383, -0.13758461644591868, 0.002673724685951558, 0.3813999555275758, -0.14988709286751473, 0.04495212122784787, 0.20930419590166013, -0.2399955813570897, -0.17380409751807885, 0.21598943311650798, 0.08609550028033379, 0.10320048306207612, -0.1575912068123525, 0.009078208213992732, -0.016860537508608036, 0.25231837528705037, 0.042335092441293076, 0.06681011981365956, 0.3198574192622097, 0.09907084376164624, 0.0534921569187405, 0.019692948453550067, -0.27221686954715485, -0.005325447916018091, -0.19560485424315732, -0.08796621323804775, -0.1293575209069048, 0.12841262580653354, -0.1470621239744843, -0.13154203017365257, 0.31932820524176897, 0.151514705296887, 0.23430918563456046, 0.05778369726569234, 0.3058637944630013, 0.16772215251222183, 0.07744060028739766, 0.13280099631849465, 0.34755944466429217, 0.18693178106925257, 0.11383348953787167, -0.27010650635819955, 0.09398821487952516, 0.01124846315415541] |
1,802.01 | A Software Package for Rigorously Calculating Optical Plasma Spectra and
Automatically Rtrieving Plasma Properties | In this article, a software package code named OPSIAL (Optical Plasma
Spectral Calculation And Parameters Retrieval) for rigorously calculating
optical plasma spectra and for automatically retrieving plasma parameters is
presented. OPSIAL calculates the absolute spectral radiance caused by the
bound-bound transitions of elemental species in the plasma by rigorously
solving the equation of radiative transfer using an ultrafast line-by-line
algorithm. OPSIAL supports both the local-thermodynamic-equilibrium (LTE) or
partial LTE conditions and takes account of line broadenings due to the Doppler
effect and collisions with electrons and other pseudo colliders in the plasma.
An algorithm for fully automatically identifying elemental species and
retrieving plasma parameters based on observed plasma emission spectra has been
implemented into OPSIAL. The structure and theoretical framework of OPSIAL,
together with a case study of using OPSIAL to analyze laser-induced breakdown
spectral data of the ChemCam instrument onboard the Mars rover Curiosity, are
presented.
| physics.comp-ph physics.atom-ph physics.data-an physics.plasm-ph | in this article a software package code named opsial optical plasma spectral calculation and parameters retrieval for rigorously calculating optical plasma spectra and for automatically retrieving plasma parameters is presented opsial calculates the absolute spectral radiance caused by the boundbound transitions of elemental species in the plasma by rigorously solving the equation of radiative transfer using an ultrafast linebyline algorithm opsial supports both the localthermodynamicequilibrium lte or partial lte conditions and takes account of line broadenings due to the doppler effect and collisions with electrons and other pseudo colliders in the plasma an algorithm for fully automatically identifying elemental species and retrieving plasma parameters based on observed plasma emission spectra has been implemented into opsial the structure and theoretical framework of opsial together with a case study of using opsial to analyze laserinduced breakdown spectral data of the chemcam instrument onboard the mars rover curiosity are presented | [['in', 'this', 'article', 'a', 'software', 'package', 'code', 'named', 'opsial', 'optical', 'plasma', 'spectral', 'calculation', 'and', 'parameters', 'retrieval', 'for', 'rigorously', 'calculating', 'optical', 'plasma', 'spectra', 'and', 'for', 'automatically', 'retrieving', 'plasma', 'parameters', 'is', 'presented', 'opsial', 'calculates', 'the', 'absolute', 'spectral', 'radiance', 'caused', 'by', 'the', 'boundbound', 'transitions', 'of', 'elemental', 'species', 'in', 'the', 'plasma', 'by', 'rigorously', 'solving', 'the', 'equation', 'of', 'radiative', 'transfer', 'using', 'an', 'ultrafast', 'linebyline', 'algorithm', 'opsial', 'supports', 'both', 'the', 'localthermodynamicequilibrium', 'lte', 'or', 'partial', 'lte', 'conditions', 'and', 'takes', 'account', 'of', 'line', 'broadenings', 'due', 'to', 'the', 'doppler', 'effect', 'and', 'collisions', 'with', 'electrons', 'and', 'other', 'pseudo', 'colliders', 'in', 'the', 'plasma', 'an', 'algorithm', 'for', 'fully', 'automatically', 'identifying', 'elemental', 'species', 'and', 'retrieving', 'plasma', 'parameters', 'based', 'on', 'observed', 'plasma', 'emission', 'spectra', 'has', 'been', 'implemented', 'into', 'opsial', 'the', 'structure', 'and', 'theoretical', 'framework', 'of', 'opsial', 'together', 'with', 'a', 'case', 'study', 'of', 'using', 'opsial', 'to', 'analyze', 'laserinduced', 'breakdown', 'spectral', 'data', 'of', 'the', 'chemcam', 'instrument', 'onboard', 'the', 'mars', 'rover', 'curiosity', 'are', 'presented']] | [-0.043497231852288556, 0.11445658845485657, -0.06369610210772933, 0.05309315472461131, -0.01764755238712366, -0.14744926223746774, -0.001307258865523602, 0.41731768887376, -0.2155927800221787, -0.3371402550818158, 0.046451473872329355, -0.25855501083859883, -0.054230020566824445, 0.18615394978163144, 0.017207862859984643, 0.087315434697686, 0.08347410884793519, -0.09412491283233777, -0.0135104829114054, -0.12661905472838403, 0.2887045816093886, 0.15599976575099483, 0.23992172133836415, 0.0868561614370512, 0.08104877582621337, -0.011521296791073417, -0.08149568573413353, -0.021060375731159636, -0.1181875391801713, 0.08380276616642943, 0.2211621078333127, 0.14043719893904263, 0.19166383428695505, -0.41334514477017786, -0.2674822864648538, 0.024424936847292446, 0.14776005075458867, 0.07625859021684345, -0.052701897957686136, -0.2736611249682424, 0.014515733650448372, -0.16571465779419, -0.08355472276468767, -0.05460952640492089, 0.01048088215012737, 0.010002746511263405, -0.3049916844220268, 0.010550985917398314, 0.005210243110849085, 0.1291054869625008, -0.11498515036584316, -0.12090333578411211, -0.041991409319801394, 0.09989504005006027, -0.005433427542131267, -0.0313061186964592, 0.16138312554614123, -0.07241942172436057, -0.06987797989839448, 0.4269327863696076, -0.10128685401207736, -0.07608369445320548, 0.13583083984275351, -0.12412633083691048, -0.11207431919403932, 0.19803487357436395, 0.15652182652792407, 0.09978219156539968, -0.1984769709150754, 0.06766830389364148, 0.01308405397105075, 0.18028236597421624, 0.04787907770955238, 0.023466179210717985, 0.19955095772149967, 0.13792133052218833, -0.045977754230123194, 0.11797199630832654, -0.14998599880717087, -0.04264190159167866, -0.21576052215457164, -0.14670742494782724, -0.14730953187903478, -0.03192709610943182, -0.03381613312717955, -0.16662103469882691, 0.4300841536170163, 0.17026093846177492, 0.14007593347963426, -0.04025325573328249, 0.3824730132291486, 0.13722584829950818, 0.018037290606951834, 0.09906145973846975, 0.22561640682674589, 0.16582057595278332, 0.15541299404006223, -0.3005686071257861, 0.05858974218238652, 0.10350832043431041] |
1,802.01001 | Equitable partitions of Latin-square graphs | We study equitable partitions of Latin-square graphs, and give a complete
classification of those whose quotient matrix does not have an eigenvalue $-3$.
| math.CO | we study equitable partitions of latinsquare graphs and give a complete classification of those whose quotient matrix does not have an eigenvalue 3 | [['we', 'study', 'equitable', 'partitions', 'of', 'latinsquare', 'graphs', 'and', 'give', 'a', 'complete', 'classification', 'of', 'those', 'whose', 'quotient', 'matrix', 'does', 'not', 'have', 'an', 'eigenvalue', '3']] | [-0.14403232792392373, 0.041389936523707795, -0.10713675414974039, 0.04342548786239191, -0.1373297625475309, -0.09626685834320431, -0.019018091234928845, 0.39444221860983153, -0.21417308835820717, -0.29089856342497195, 0.14760946717367254, -0.2923022149638696, -0.16431380998851222, 0.07915540975095196, -0.13779438494450666, -0.002570679411292076, 0.13047127332538366, 0.14531082549894397, -0.08774468450891701, -0.2824772883799266, 0.34837078336964955, 0.00895523110573942, 0.20617107682946054, 0.11172268467701295, 0.048142582262781536, 0.026127655651759018, -0.05822800861840898, 0.05848258344287222, -0.1990266884677112, 0.06427942217454653, 0.30665603491731663, 0.19421989836899395, 0.2344475423451513, -0.39688209545883263, -0.10237649961544032, 0.31184395106339996, 0.17652361871759323, 0.04544565894386985, 0.026114974297921766, -0.20492323809726673, 0.13573996822180395, -0.16024045790122313, -0.08307132124900818, -0.0710359849141572, 0.046316773292015896, -0.01835511422673748, -0.2655138315167278, -0.015666939064183018, 0.18328129229220477, 0.1200471561275084, 0.01328770596195351, -0.2105409431017258, 0.015668195693499663, 0.12685161989859559, -0.14142811577767134, -0.04285889094568451, 0.005433328809555282, -0.10868021134625781, -0.20807217315516688, 0.38531123101711273, 0.07834420509805734, -0.22503454966301267, 0.10728752274404872, -0.14683554067530416, -0.1542090695690025, 0.14509342814033682, 0.14114250445907767, 0.13816306854344226, -0.07617380169474265, 0.10178049526505427, -0.18439418517730452, 0.11910168724981221, 0.05504311163994399, 0.0030419572510502553, 0.0932656109163707, 0.08423401897942479, 0.14741706203626978, 0.17141104946759614, 0.0678419027985497, 0.015842989383434706, -0.27116271582516754, -0.14500820077955723, -0.2119149500504136, 0.17602709470255914, -0.190448424164391, -0.3426737142726779, 0.4706638496030461, 0.02886081715537743, 0.2132347310808572, 0.16402965991503812, 0.1639165974391455, 0.0804973160424693, 0.0764336662197655, 0.11867460460317406, 0.12088851461356337, 0.18832612995968454, -0.0551690799607472, -0.12213461731814525, 0.005151288795538924, 0.18864507444033568] |
1,802.01002 | Modelling Lobbying Behaviour and Interdisciplinarity Dynamics in
Academia | Disciplinary diversity is being recognized today as the key to establish a
vibrant academic environment with bigger potential for breakthroughs in
research and technology. However, the interaction of several factors including
policies, and behavioral attitudes put significant barriers on advancing
interdisciplinarity. A "cognitive rigidity" may rise due to reactive academic
lobbying favouring inbreeding. Here, we address, analyse and discuss a
mathematical model of lobbying and interdisciplinarity dynamics in Academia.
The model consists of four coupled non-linear Ordinary Differential Equations
simulating the interaction between three types of academic individuals and a
state reflecting the rate of knowledge advancement which is related to the
level of disciplinary diversity. Our model predicts a rich nonlinear behaviour
including multiplicity of states and sustained periodic oscillations resembling
the everlasting struggle between the "new" and the "old". The effect of a
control policy that inhibits lobbying is also studied. By appropriate
adjustment of the model parameters we approximated the jump/phase transitions
in breakthroughs in mathematical and molecular biological sciences resulted by
the increased flow of Russian scientists in the USA after the dissolution of
the Soviet Union starting in 1989, the launch of the Human Genome Project in
1992 and the Internet diffusion starting in 2000.
| physics.soc-ph | disciplinary diversity is being recognized today as the key to establish a vibrant academic environment with bigger potential for breakthroughs in research and technology however the interaction of several factors including policies and behavioral attitudes put significant barriers on advancing interdisciplinarity a cognitive rigidity may rise due to reactive academic lobbying favouring inbreeding here we address analyse and discuss a mathematical model of lobbying and interdisciplinarity dynamics in academia the model consists of four coupled nonlinear ordinary differential equations simulating the interaction between three types of academic individuals and a state reflecting the rate of knowledge advancement which is related to the level of disciplinary diversity our model predicts a rich nonlinear behaviour including multiplicity of states and sustained periodic oscillations resembling the everlasting struggle between the new and the old the effect of a control policy that inhibits lobbying is also studied by appropriate adjustment of the model parameters we approximated the jumpphase transitions in breakthroughs in mathematical and molecular biological sciences resulted by the increased flow of russian scientists in the usa after the dissolution of the soviet union starting in 1989 the launch of the human genome project in 1992 and the internet diffusion starting in 2000 | [['disciplinary', 'diversity', 'is', 'being', 'recognized', 'today', 'as', 'the', 'key', 'to', 'establish', 'a', 'vibrant', 'academic', 'environment', 'with', 'bigger', 'potential', 'for', 'breakthroughs', 'in', 'research', 'and', 'technology', 'however', 'the', 'interaction', 'of', 'several', 'factors', 'including', 'policies', 'and', 'behavioral', 'attitudes', 'put', 'significant', 'barriers', 'on', 'advancing', 'interdisciplinarity', 'a', 'cognitive', 'rigidity', 'may', 'rise', 'due', 'to', 'reactive', 'academic', 'lobbying', 'favouring', 'inbreeding', 'here', 'we', 'address', 'analyse', 'and', 'discuss', 'a', 'mathematical', 'model', 'of', 'lobbying', 'and', 'interdisciplinarity', 'dynamics', 'in', 'academia', 'the', 'model', 'consists', 'of', 'four', 'coupled', 'nonlinear', 'ordinary', 'differential', 'equations', 'simulating', 'the', 'interaction', 'between', 'three', 'types', 'of', 'academic', 'individuals', 'and', 'a', 'state', 'reflecting', 'the', 'rate', 'of', 'knowledge', 'advancement', 'which', 'is', 'related', 'to', 'the', 'level', 'of', 'disciplinary', 'diversity', 'our', 'model', 'predicts', 'a', 'rich', 'nonlinear', 'behaviour', 'including', 'multiplicity', 'of', 'states', 'and', 'sustained', 'periodic', 'oscillations', 'resembling', 'the', 'everlasting', 'struggle', 'between', 'the', 'new', 'and', 'the', 'old', 'the', 'effect', 'of', 'a', 'control', 'policy', 'that', 'inhibits', 'lobbying', 'is', 'also', 'studied', 'by', 'appropriate', 'adjustment', 'of', 'the', 'model', 'parameters', 'we', 'approximated', 'the', 'jumpphase', 'transitions', 'in', 'breakthroughs', 'in', 'mathematical', 'and', 'molecular', 'biological', 'sciences', 'resulted', 'by', 'the', 'increased', 'flow', 'of', 'russian', 'scientists', 'in', 'the', 'usa', 'after', 'the', 'dissolution', 'of', 'the', 'soviet', 'union', 'starting', 'in', '1989', 'the', 'launch', 'of', 'the', 'human', 'genome', 'project', 'in', '1992', 'and', 'the', 'internet', 'diffusion', 'starting', 'in', '2000']] | [-0.10249573935756937, 0.10442299423762715, -0.050608924579228644, 0.07416226140845886, -0.08689033700359153, -0.11990796299370464, 0.06459278912966762, 0.3198240385554619, -0.25618492799048226, -0.34680318969053836, 0.07637664576262311, -0.26966278867424004, -0.17746690622836248, 0.18800788606755697, -0.10184576477265762, -0.004035335635513666, 0.050772540767363566, 0.0054442756575293575, 0.0023276585694776857, -0.23267512026432452, 0.2956659617861873, 0.06034463586697551, 0.3172603296970097, 0.06067964556070054, 0.09230219580036536, -0.04426154302580554, -0.06606812168049613, -0.0011298429950996859, -0.1110347353618334, 0.1629578193106183, 0.30234783232485846, 0.16893196829721033, 0.3776936832553328, -0.43670519491910337, -0.220514134505071, 0.059885732057368635, 0.11794305914175233, 0.09473007957125784, -0.05026350983116663, -0.3149920404308368, -0.018157605765078536, -0.19631872288929533, -0.13873062853294252, -0.01987923771709241, 0.06298891741468866, 0.021371797517517666, -0.20680049522814983, 0.0680022462136311, 0.04006231148802118, 0.1389072661021322, -0.06748976588515967, -0.11217626592556211, -0.024163753285667104, 0.2027078404877541, 0.08391968447518483, 0.006162478471082406, 0.1355856800213194, -0.1893570126998402, -0.14283331787335363, 0.3950448540605642, -0.034380875155797706, -0.10655310382626614, 0.22100376829168006, -0.12887912780226643, -0.12505816985401394, 0.09287392306691457, 0.23231353249925016, 0.024540340455351913, -0.16113997054234822, 0.06824093514640381, 0.014525182524125031, 0.13074851436505383, 0.08949155034965381, -0.020815640985123327, 0.21208776779304347, 0.21538791687569425, 0.025319495376424125, 0.09345786006952725, -0.023936560675829423, -0.1857864372759833, -0.21147235789003982, -0.14331186989593744, -0.0982172509149915, 0.04226117613421163, -0.052893961975675655, -0.14646485810584609, 0.4156744555504665, 0.13609404865261543, 0.12128958666019128, -0.017572294615897065, 0.23934385381713885, 0.03635923935442077, 0.04832983213762317, 0.0485623635049797, 0.23452254965106942, 0.10203112807035933, 0.1693056337465181, -0.21257605971113297, 0.150399671212288, -0.002670662998263935] |
1,802.01003 | Bernstein functions of several semigroup generators on Banach spaces
under bounded perturbations. II | The paper deals with multidimensional Bochner-Phillips functional calculus.
In the previous paper by the author bounded perturbations of Bernstein
functions of several commuting semigroup generators on Banach spaces where
considered, conditions for Lipschitzness and estimates for the norm of
commutators of such functions where proved. Also in the one-dimensional case
the Frechet differentiability of Bernstein functions of semigroup generators on
Banach spaces where proved and a generalization of Livschits-Kre\u{i}n trace
formula derived. The aim of the present paper is to prove the Frechet
differentiability of operator Bernstein functions and the Livschits-Kre\u{i}n
trace formula in the multidimensional setting.
| math.FA | the paper deals with multidimensional bochnerphillips functional calculus in the previous paper by the author bounded perturbations of bernstein functions of several commuting semigroup generators on banach spaces where considered conditions for lipschitzness and estimates for the norm of commutators of such functions where proved also in the onedimensional case the frechet differentiability of bernstein functions of semigroup generators on banach spaces where proved and a generalization of livschitskreuin trace formula derived the aim of the present paper is to prove the frechet differentiability of operator bernstein functions and the livschitskreuin trace formula in the multidimensional setting | [['the', 'paper', 'deals', 'with', 'multidimensional', 'bochnerphillips', 'functional', 'calculus', 'in', 'the', 'previous', 'paper', 'by', 'the', 'author', 'bounded', 'perturbations', 'of', 'bernstein', 'functions', 'of', 'several', 'commuting', 'semigroup', 'generators', 'on', 'banach', 'spaces', 'where', 'considered', 'conditions', 'for', 'lipschitzness', 'and', 'estimates', 'for', 'the', 'norm', 'of', 'commutators', 'of', 'such', 'functions', 'where', 'proved', 'also', 'in', 'the', 'onedimensional', 'case', 'the', 'frechet', 'differentiability', 'of', 'bernstein', 'functions', 'of', 'semigroup', 'generators', 'on', 'banach', 'spaces', 'where', 'proved', 'and', 'a', 'generalization', 'of', 'livschitskreuin', 'trace', 'formula', 'derived', 'the', 'aim', 'of', 'the', 'present', 'paper', 'is', 'to', 'prove', 'the', 'frechet', 'differentiability', 'of', 'operator', 'bernstein', 'functions', 'and', 'the', 'livschitskreuin', 'trace', 'formula', 'in', 'the', 'multidimensional', 'setting']] | [-0.08959455221540957, 0.04027035016777743, -0.052051807929264844, 0.12785788050003005, -0.0608424253440126, -0.05008302917511961, -0.02958935524034554, 0.32062210722528783, -0.3378616435280473, -0.13875769147860637, 0.13250853374874047, -0.25865469216225073, -0.14776496233937053, 0.2204171714478547, -0.15348506730875558, 0.11911202181573506, 0.04080530810385904, 0.06414918884030092, -0.13958647149643794, -0.23271739008577214, 0.4507421845109346, -0.01269766762276593, 0.17456699475722828, 0.05409859850061769, 0.12852958870629214, 0.03608142649370831, -0.09381172422454068, -0.06514928791403156, -0.18571989387081764, 0.1719498278419535, 0.26893533529643543, 0.08511565240896932, 0.3279509876576281, -0.41681153375232954, -0.1434818238077551, 0.18492032070980244, 0.08547297356285385, -0.07742477122894681, -0.018907426342790582, -0.30576582250818996, 0.056072915976233394, -0.17338641377684383, -0.16351746449477433, -0.08205009152939946, 0.030910190204446464, 0.10131092716642108, -0.3394880649278459, 0.06747624010643345, 0.14775416520952256, 0.10223159984251623, -0.1350410638434678, -0.08909557381472022, -0.029517530050781584, 0.009934933587294264, 0.019077254197627458, 0.046924023500154004, 0.03885298304874258, -0.03770720879979355, -0.1292116372010757, 0.2907460529966875, -0.04393213983509958, -0.27260983067075, 0.10706632336380786, -0.21986498990451397, -0.16422553035459414, -0.002557644346901744, 0.12439278778188008, 0.19287898916674337, -0.1421018942768119, 0.2254378452024557, -0.0870461936982483, 0.030598124563297947, 0.1098137206119514, 0.07743550007490768, -0.017900518842579163, 0.04612351322220158, 0.15507596964976683, 0.1914902017787867, 0.06833679596269407, -0.09465980622317335, -0.37958207718797565, -0.1957654119877279, -0.21729100086563027, 0.04930959377898691, -0.12733530479236674, -0.21672225713768264, 0.3780484472391839, 0.08963444199144226, 0.14476663212186283, 0.17173029632144368, 0.1940939928952259, 0.17567391922822242, 0.015578225082189767, 0.0677784746272739, 0.1243196729157773, 0.2413541740310599, 0.08900884665865644, -0.11877653702070994, 0.06665124466700345, 0.2747572075013616] |
1,802.01004 | Holomorphic curves in Shimura varieties | We prove an hyperbolic analogue of the Bloch-Ochiai theorem about the Zariski
closure of holomorphic curves in abelian varieties. We consider the case of non
compact Shimura varieties completing the proof of the result for all Shimura
varieties. The statement analysed was first formulated and proven by Ullmo and
Yafaev for compact Shimura varieties.
| math.AG | we prove an hyperbolic analogue of the blochochiai theorem about the zariski closure of holomorphic curves in abelian varieties we consider the case of non compact shimura varieties completing the proof of the result for all shimura varieties the statement analysed was first formulated and proven by ullmo and yafaev for compact shimura varieties | [['we', 'prove', 'an', 'hyperbolic', 'analogue', 'of', 'the', 'blochochiai', 'theorem', 'about', 'the', 'zariski', 'closure', 'of', 'holomorphic', 'curves', 'in', 'abelian', 'varieties', 'we', 'consider', 'the', 'case', 'of', 'non', 'compact', 'shimura', 'varieties', 'completing', 'the', 'proof', 'of', 'the', 'result', 'for', 'all', 'shimura', 'varieties', 'the', 'statement', 'analysed', 'was', 'first', 'formulated', 'and', 'proven', 'by', 'ullmo', 'and', 'yafaev', 'for', 'compact', 'shimura', 'varieties']] | [-0.22175872427815535, -0.04303119634909617, -0.14477385056890407, 0.15546496804663032, -0.09895802952595195, -0.11690580499367262, -0.009472172197727662, 0.21404491125975014, -0.2602964719089697, -0.1748249758526964, 0.1147940414935737, -0.16523205805218444, -0.11946835776544967, 0.30199222217472094, -0.2746543042572602, 0.012253860152273808, 0.04061134529458183, 0.030203109998080246, -0.09053109506505348, -0.42535019269265795, 0.5184970457361624, -0.09646008327440798, 0.23392034771869769, 0.09967241805257662, 0.10668815646918034, 0.07996809719798137, -0.028978584123388777, -0.14091786174630783, -0.09341830579247677, 0.13440505981023582, 0.4174106827814062, 0.06953713768337555, 0.12978065644285447, -0.4021283579322527, -0.14943262801136611, 0.2804369992787405, 0.0645285908765388, 0.019723929601001007, 0.02873733396782487, -0.29384598827850567, 0.06705938074474205, -0.14238033949766518, -0.328324746735886, -0.09333686245921648, 0.05067548001149915, 0.025763734841262393, -0.1916011234850816, -0.050748794181448106, 0.21862486148920823, 0.25110596894585296, -0.13580822355974959, -0.09239799401037535, -0.04285688632396313, -0.007325886933238439, -0.019629227860725292, 0.033755720768756464, 0.04713439735812398, -0.057599879836417595, -0.10938034466696235, 0.3649087770719011, -0.08960961668207398, -0.16786304021798917, 0.07485235564823631, -0.18956269159526476, -0.23544917550851713, 0.14434536400620104, 0.060220277288331174, 0.1940145434741423, 0.008843704812088102, 0.1852472196574727, -0.1825224458995574, -0.02828440704505961, 0.16179864384444817, -0.07341779847541507, 0.10803655709825316, 0.09294417142710991, 0.022967412400076975, 0.12339731685615163, 0.014347458969942242, -0.006592758685209841, -0.37178398471958235, -0.23314980051989825, -0.0820557751095671, 0.21418537859769785, -0.07704451785561242, -0.1463595786184635, 0.3522176812842207, -0.04049931263621404, 0.12662100572718904, 0.19036093160931794, 0.18840119223338817, 0.0329296729617471, -0.006488298290004989, 0.09735938681746428, 0.16453906696922374, 0.33659926668811097, -0.06875541178017573, -0.08986599666048896, -0.059169664486961544, 0.2739377454590966] |
1,802.01005 | The leptophilic dark matter in the Sun: the minimum testable mass | The physics of the solar dark matter (DM) that are captured and thermalise
through the DM-nucleon interaction has been extensively studied. In this work,
we consider the leptophilic DM scenario where the DM particles interact
exclusively with the electrons through the axial-vector coupling. We
investigate relevant phenomenologies in the Sun, including its capture,
evaporation and thermalisation, and we calculate the equilibrium distribution
using the Monte Carlo methods, rather than adopting a semi-analytic
approximation. Based on the analysis, we then determine the minimum testable
mass for which the DM-electron coupling strength can be probed via the neutrino
observation. Compared to the case of the DM-nucleon interaction, it turns out
that minimum detectable mass of the DM-electron interaction is roughly 1 GeV
smaller, and a cross section about two orders of magnitude larger is required
for the saturation of the annihilation signal.
| hep-ph | the physics of the solar dark matter dm that are captured and thermalise through the dmnucleon interaction has been extensively studied in this work we consider the leptophilic dm scenario where the dm particles interact exclusively with the electrons through the axialvector coupling we investigate relevant phenomenologies in the sun including its capture evaporation and thermalisation and we calculate the equilibrium distribution using the monte carlo methods rather than adopting a semianalytic approximation based on the analysis we then determine the minimum testable mass for which the dmelectron coupling strength can be probed via the neutrino observation compared to the case of the dmnucleon interaction it turns out that minimum detectable mass of the dmelectron interaction is roughly 1 gev smaller and a cross section about two orders of magnitude larger is required for the saturation of the annihilation signal | [['the', 'physics', 'of', 'the', 'solar', 'dark', 'matter', 'dm', 'that', 'are', 'captured', 'and', 'thermalise', 'through', 'the', 'dmnucleon', 'interaction', 'has', 'been', 'extensively', 'studied', 'in', 'this', 'work', 'we', 'consider', 'the', 'leptophilic', 'dm', 'scenario', 'where', 'the', 'dm', 'particles', 'interact', 'exclusively', 'with', 'the', 'electrons', 'through', 'the', 'axialvector', 'coupling', 'we', 'investigate', 'relevant', 'phenomenologies', 'in', 'the', 'sun', 'including', 'its', 'capture', 'evaporation', 'and', 'thermalisation', 'and', 'we', 'calculate', 'the', 'equilibrium', 'distribution', 'using', 'the', 'monte', 'carlo', 'methods', 'rather', 'than', 'adopting', 'a', 'semianalytic', 'approximation', 'based', 'on', 'the', 'analysis', 'we', 'then', 'determine', 'the', 'minimum', 'testable', 'mass', 'for', 'which', 'the', 'dmelectron', 'coupling', 'strength', 'can', 'be', 'probed', 'via', 'the', 'neutrino', 'observation', 'compared', 'to', 'the', 'case', 'of', 'the', 'dmnucleon', 'interaction', 'it', 'turns', 'out', 'that', 'minimum', 'detectable', 'mass', 'of', 'the', 'dmelectron', 'interaction', 'is', 'roughly', '1', 'gev', 'smaller', 'and', 'a', 'cross', 'section', 'about', 'two', 'orders', 'of', 'magnitude', 'larger', 'is', 'required', 'for', 'the', 'saturation', 'of', 'the', 'annihilation', 'signal']] | [-0.10755300812722583, 0.20498254887726425, -0.0719139685119444, 0.17963570108653845, -0.045923548614207124, -0.09567644784027445, 0.004431686235225892, 0.3282697494108496, -0.22461370783858, -0.34874229273492735, 0.02842118882524249, -0.29397227277180976, -0.0381143573139395, 0.17257492979988456, 0.12236959713045507, -0.008391153678115057, 0.033318541192316586, 0.05441379954240152, -0.058973217713979204, -0.24490237113204785, 0.29128619203526923, 0.08311389163635405, 0.1931732714525424, 0.1133315252372995, 0.06750124153415007, 0.02821608039417437, -0.03355730576274384, -0.03515929000984345, -0.16889833117155442, 0.07692641363412674, 0.16916209429161558, 0.07158996964655151, 0.14813124766473526, -0.4273182816803455, -0.1961756454040629, 0.16916424501022057, 0.1820578374467524, 0.0752094126081959, -0.048564268200425434, -0.29302852758638825, 0.05480663218934621, -0.23583204605217492, -0.0798430636259062, -0.0053615754137613944, -0.01379007579359625, -0.026790491305291653, -0.285835967006694, 0.08988433491904288, -0.019280193423453187, -0.037449826100575075, -0.03830741086005998, -0.12505101605451532, -0.03576316043036058, 0.031736526019605145, 0.10612815341176299, -0.011796878105295555, 0.2084012028079347, -0.15873179207389643, -0.07815214777697942, 0.41853699683477835, -0.10445578183498583, -0.13197433408017137, 0.18409657123432097, -0.15979030546067016, -0.08954891029445987, 0.14929247563704848, 0.16470043983260568, 0.12051564213886325, -0.16640802229688104, 0.12852431148723034, -0.046965541008726824, 0.17085834958124907, 0.04903894827168967, 0.009498403174802661, 0.2610863975182708, 0.22243056182217386, 0.0483369354225163, 0.05448692171485163, -0.1380257460321965, -0.11072227830799031, -0.29580712842621976, -0.11082631109789613, -0.1603739790119497, 0.04120221151221943, -0.06562577267135826, -0.06326642675059183, 0.3735267548821867, 0.20372864803898016, 0.21621264097879508, 0.011550679896858387, 0.32642781783028374, 0.13291370071404215, 0.08154541825143886, 0.04500679080707154, 0.37737508322378355, 0.17008225698290128, 0.04669383943297102, -0.23100825464851887, 0.0728232043562457, 0.016601759484702987] |
1,802.01006 | Deuterated silicon nitride photonic devices for broadband optical
frequency comb generation | We report and characterize low-temperature, plasma-deposited deuterated
silicon nitride thin films for nonlinear integrated photonics. With a peak
processing temperature less than 300$^\circ$C, it is back-end compatible with
pre-processed CMOS substrates. We achieve microresonators with a quality factor
of up to $1.6\times 10^6 $ at 1552 nm, and $>1.2\times 10^6$ throughout
$\lambda$ = 1510 -- 1600 nm, without annealing or stress management. We then
demonstrate the immediate utility of this platform in nonlinear photonics by
generating a 1 THz free spectral range, 900-nm-bandwidth modulation-instability
microresonator Kerr comb and octave-spanning, supercontinuum-broadened spectra.
| physics.optics | we report and characterize lowtemperature plasmadeposited deuterated silicon nitride thin films for nonlinear integrated photonics with a peak processing temperature less than 300circc it is backend compatible with preprocessed cmos substrates we achieve microresonators with a quality factor of up to 16times 106 at 1552 nm and 12times 106 throughout lambda 1510 1600 nm without annealing or stress management we then demonstrate the immediate utility of this platform in nonlinear photonics by generating a 1 thz free spectral range 900nmbandwidth modulationinstability microresonator kerr comb and octavespanning supercontinuumbroadened spectra | [['we', 'report', 'and', 'characterize', 'lowtemperature', 'plasmadeposited', 'deuterated', 'silicon', 'nitride', 'thin', 'films', 'for', 'nonlinear', 'integrated', 'photonics', 'with', 'a', 'peak', 'processing', 'temperature', 'less', 'than', '300circc', 'it', 'is', 'backend', 'compatible', 'with', 'preprocessed', 'cmos', 'substrates', 'we', 'achieve', 'microresonators', 'with', 'a', 'quality', 'factor', 'of', 'up', 'to', '16times', '106', 'at', '1552', 'nm', 'and', '12times', '106', 'throughout', 'lambda', '1510', '1600', 'nm', 'without', 'annealing', 'or', 'stress', 'management', 'we', 'then', 'demonstrate', 'the', 'immediate', 'utility', 'of', 'this', 'platform', 'in', 'nonlinear', 'photonics', 'by', 'generating', 'a', '1', 'thz', 'free', 'spectral', 'range', '900nmbandwidth', 'modulationinstability', 'microresonator', 'kerr', 'comb', 'and', 'octavespanning', 'supercontinuumbroadened', 'spectra']] | [-0.0614902863473913, 0.13775747614238562, 0.023774622500939077, -0.10056251218694068, -0.02145264411431759, -0.1782587090355539, 0.03534082706129655, 0.5685968385186306, -0.1807006181510122, -0.3349488435183154, 0.09445767064421806, -0.33144112329843434, -0.02501373349548166, 0.27727501906270463, -0.0077985850769246735, 0.09264192483821061, -0.009999797262554599, -0.12975915192171586, -0.033511295247292364, -0.16219228438134198, 0.14432116190978694, 0.07076066746484748, 0.3357638919097913, 0.05159804949450285, 0.12934521942529395, -0.11270872613978247, 0.07632742274206045, -0.12554050778948464, -0.19889893422856234, 0.09253554750128302, 0.2926796415365886, -0.032376156437622254, 0.24646473705746927, -0.3885999018391378, -0.19410509607066986, 0.026512113437706302, 0.10607253558741514, 0.027980980284641997, -0.08482554662149659, -0.2571450331150879, 0.160815715107547, -0.16263575677565018, -0.0880294488101648, -0.025568141796907713, 0.006224770261364621, -0.06762714713904432, -0.2555535062585773, 0.05307537419071724, 0.003339103022373693, 0.08896189754785494, -0.03846514510359009, -0.10236720104301132, -0.06218812890285843, -0.06220621479469417, -0.1257206338463178, 0.02293473804710693, 0.2525413804958293, -0.08202437226671379, -0.0999903594804278, 0.349192327635666, -0.11652472594480144, 0.01753124417628833, 0.11737757281746802, -0.18042129358049308, 0.009200449093504873, 0.2060266199283475, 0.14230759183031527, 0.0962403176168283, -0.15404929449175334, 0.04620442584192185, 0.08277702275095074, 0.32730531115301476, 0.21207208058128113, 0.13747722297083848, 0.19534462268009437, 0.27264236976111006, 0.006096355357142382, 0.1591060541808432, -0.10465847202143523, 0.06639720093415574, -0.20218506165466077, -0.1833630288886123, -0.15462238326408836, 0.15171977332630737, -0.15425365163655655, -0.15551084566991344, 0.35222048296181613, 0.13960436022797124, 0.13472598537716063, 0.011497820324134515, 0.3003244664909881, 0.09934427457060231, 0.1008444341105344, 0.048185598484218814, 0.24804932567247645, 0.15754181316371488, 0.18089840121226802, -0.17910123445895001, -0.06768835541727238, -0.10201998072308163] |
1,802.01007 | Reduced commutativity of moduli of operators | In this paper, we investigate the question of when the equations
$A^{*s}A^{s}=(A^{*}A)^{s}$ for all $s \in S$, where $S$ is a finite set of
positive integers, imply the quasinormality or normality of $A$. In particular,
it is proved that if $S=\{p,m,m+p,n,n+p\}$, where $2\leq m < n$, then $A$ is
quasinormal. Moreover, if $A$ is invertible and $S=\{m,n,n+m\}$, where $m \leq
n$, then $A$ is normal. Furthermore, the case when $S=\{m,m+n\}$ and $A^{*n}A^n
\leq (A^*A)^n$ is discussed.
| math.FA | in this paper we investigate the question of when the equations asasaas for all s in s where s is a finite set of positive integers imply the quasinormality or normality of a in particular it is proved that if spmmpnnp where 2leq m n then a is quasinormal moreover if a is invertible and smnnm where m leq n then a is normal furthermore the case when smmn and anan leq aan is discussed | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'question', 'of', 'when', 'the', 'equations', 'asasaas', 'for', 'all', 's', 'in', 's', 'where', 's', 'is', 'a', 'finite', 'set', 'of', 'positive', 'integers', 'imply', 'the', 'quasinormality', 'or', 'normality', 'of', 'a', 'in', 'particular', 'it', 'is', 'proved', 'that', 'if', 'spmmpnnp', 'where', '2leq', 'm', 'n', 'then', 'a', 'is', 'quasinormal', 'moreover', 'if', 'a', 'is', 'invertible', 'and', 'smnnm', 'where', 'm', 'leq', 'n', 'then', 'a', 'is', 'normal', 'furthermore', 'the', 'case', 'when', 'smmn', 'and', 'anan', 'leq', 'aan', 'is', 'discussed']] | [-0.1530556634334581, 0.18645975005679896, -0.030430485447868704, 0.01619614746055699, -0.022774329382394043, -0.19174539950410172, 0.015148994288340743, 0.3069984531163105, -0.24937510203037944, -0.1895723151708288, 0.11870023444062099, -0.30695881163701416, -0.15410802449166242, 0.1722879236231425, -0.05143893966451287, -0.04765259668763195, 0.015675322152674198, 0.14671875900988068, -0.06347203967494092, -0.307314997139786, 0.35021511667541094, -0.08497720265627971, 0.16945388315777693, 0.05949348231245365, 0.09869146029065762, -0.014396679314917752, 0.041920992572392735, 0.05364972712205989, -0.16021075262407455, 0.01569094971886703, 0.26740809833364826, 0.1390974758791604, 0.308182531701667, -0.32209718560334294, -0.13757922147799814, 0.20158785303522433, 0.1785193145408162, 0.003560261774275984, -0.0016635798782642399, -0.1848787495300972, 0.25913928767134037, -0.10928636744086231, -0.10288780446031263, -0.00013995358188237462, 0.1905850227656109, 0.010106084682047368, -0.40558586628841503, 0.012232832171555076, 0.15523555532896094, 0.045967543790383, -0.010039723681152931, -0.10032510995598776, -0.03718120225239545, 0.04345417435896317, 0.023541310326462346, 0.045598947235183526, -0.03392341265862342, -0.07427374617795326, -0.0025616947428456376, 0.3637371869092541, -0.07175231726307954, -0.24682722988405398, 0.09705606137535401, -0.21946855333766768, -0.14305417547002436, 0.035995718677129064, 0.08881736109740035, 0.22781920497571784, -0.06931475556131253, 0.2517381200284165, -0.15292601170284406, 0.16776850460363285, 0.09064215002581477, -0.019851917425902293, 0.11393197580639805, 0.11995386605350566, 0.11107155729883483, 0.119062774282481, -0.041098404888595855, 0.05407103336682277, -0.37233268128974095, -0.20869883686370616, -0.22912182090970287, 0.14584856732149742, -0.06416215579249962, -0.11203927107687507, 0.30925393072622165, 0.10019203840721665, 0.22400505469579782, 0.08543199280809079, 0.23601214765970197, 0.0986091583952657, -0.05411893765163508, 0.1505541127507708, 0.12051268627068826, 0.1419675461947918, -0.008382230291941337, -0.1817004763321685, 0.024317866883107594, 0.08392384942022285] |
1,802.01008 | Harnessing functional segregation across brain rhythms as a means to
detect EEG oscillatory multiplexing during music listening | Music, being a multifaceted stimulus evolving at multiple timescales,
modulates brain function in a manifold way that encompasses not only the
distinct stages of auditory perception but also higher cognitive processes like
memory and appraisal. Network theory is apparently a promising approach to
describe the functional reorganization of brain oscillatory dynamics during
music listening. However, the music induced changes have so far been examined
within the functional boundaries of isolated brain rhythms. Using naturalistic
music, we detected the functional segregation patterns associated with
different cortical rhythms, as these were reflected in the surface EEG
measurements. The emerged structure was compared across frequency bands to
quantify the interplay among rhythms. It was also contrasted against the
structure from the rest and noise listening conditions to reveal the specific
components stemming from music listening. Our methodology includes an efficient
graph-partitioning algorithm, which is further utilized for mining prototypical
modular patterns, and a novel algorithmic procedure for identifying switching
nodes that consistently change module during music listening. Our results
suggest the multiplex character of the music-induced functional reorganization
and particularly indicate the dependence between the networks reconstructed
from the {\delta} and {\beta}H rhythms. This dependence is further justified
within the framework of nested neural oscillations and fits perfectly within
the context of recently introduced cortical entrainment to music. Considering
its computational efficiency, and in conjunction with the flexibility of in
situ electroencephalography, it may lead to novel assistive tools for real-life
applications.
| q-bio.NC | music being a multifaceted stimulus evolving at multiple timescales modulates brain function in a manifold way that encompasses not only the distinct stages of auditory perception but also higher cognitive processes like memory and appraisal network theory is apparently a promising approach to describe the functional reorganization of brain oscillatory dynamics during music listening however the music induced changes have so far been examined within the functional boundaries of isolated brain rhythms using naturalistic music we detected the functional segregation patterns associated with different cortical rhythms as these were reflected in the surface eeg measurements the emerged structure was compared across frequency bands to quantify the interplay among rhythms it was also contrasted against the structure from the rest and noise listening conditions to reveal the specific components stemming from music listening our methodology includes an efficient graphpartitioning algorithm which is further utilized for mining prototypical modular patterns and a novel algorithmic procedure for identifying switching nodes that consistently change module during music listening our results suggest the multiplex character of the musicinduced functional reorganization and particularly indicate the dependence between the networks reconstructed from the delta and betah rhythms this dependence is further justified within the framework of nested neural oscillations and fits perfectly within the context of recently introduced cortical entrainment to music considering its computational efficiency and in conjunction with the flexibility of in situ electroencephalography it may lead to novel assistive tools for reallife applications | [['music', 'being', 'a', 'multifaceted', 'stimulus', 'evolving', 'at', 'multiple', 'timescales', 'modulates', 'brain', 'function', 'in', 'a', 'manifold', 'way', 'that', 'encompasses', 'not', 'only', 'the', 'distinct', 'stages', 'of', 'auditory', 'perception', 'but', 'also', 'higher', 'cognitive', 'processes', 'like', 'memory', 'and', 'appraisal', 'network', 'theory', 'is', 'apparently', 'a', 'promising', 'approach', 'to', 'describe', 'the', 'functional', 'reorganization', 'of', 'brain', 'oscillatory', 'dynamics', 'during', 'music', 'listening', 'however', 'the', 'music', 'induced', 'changes', 'have', 'so', 'far', 'been', 'examined', 'within', 'the', 'functional', 'boundaries', 'of', 'isolated', 'brain', 'rhythms', 'using', 'naturalistic', 'music', 'we', 'detected', 'the', 'functional', 'segregation', 'patterns', 'associated', 'with', 'different', 'cortical', 'rhythms', 'as', 'these', 'were', 'reflected', 'in', 'the', 'surface', 'eeg', 'measurements', 'the', 'emerged', 'structure', 'was', 'compared', 'across', 'frequency', 'bands', 'to', 'quantify', 'the', 'interplay', 'among', 'rhythms', 'it', 'was', 'also', 'contrasted', 'against', 'the', 'structure', 'from', 'the', 'rest', 'and', 'noise', 'listening', 'conditions', 'to', 'reveal', 'the', 'specific', 'components', 'stemming', 'from', 'music', 'listening', 'our', 'methodology', 'includes', 'an', 'efficient', 'graphpartitioning', 'algorithm', 'which', 'is', 'further', 'utilized', 'for', 'mining', 'prototypical', 'modular', 'patterns', 'and', 'a', 'novel', 'algorithmic', 'procedure', 'for', 'identifying', 'switching', 'nodes', 'that', 'consistently', 'change', 'module', 'during', 'music', 'listening', 'our', 'results', 'suggest', 'the', 'multiplex', 'character', 'of', 'the', 'musicinduced', 'functional', 'reorganization', 'and', 'particularly', 'indicate', 'the', 'dependence', 'between', 'the', 'networks', 'reconstructed', 'from', 'the', 'delta', 'and', 'betah', 'rhythms', 'this', 'dependence', 'is', 'further', 'justified', 'within', 'the', 'framework', 'of', 'nested', 'neural', 'oscillations', 'and', 'fits', 'perfectly', 'within', 'the', 'context', 'of', 'recently', 'introduced', 'cortical', 'entrainment', 'to', 'music', 'considering', 'its', 'computational', 'efficiency', 'and', 'in', 'conjunction', 'with', 'the', 'flexibility', 'of', 'in', 'situ', 'electroencephalography', 'it', 'may', 'lead', 'to', 'novel', 'assistive', 'tools', 'for', 'reallife', 'applications']] | [-0.08480886541044794, 0.10652528403962995, -0.11339977772186409, 0.08654741947407082, -0.09768804149925239, -0.12616967502785767, 0.025350054902584143, 0.40781639105476003, -0.2796164674610056, -0.3168808389102899, 0.05016117338521578, -0.2634368140598712, -0.2950184768879739, 0.18720007792287388, -0.07797488456243697, 0.01481329943537673, 0.07064496141177516, 0.043478537297592046, -0.006073023843140725, -0.17068154385132778, 0.2696315504007918, 0.06340353023026045, 0.3464908460517093, 0.007519495565622278, 0.08526222064881782, -0.030878196446960715, -0.05026977717511536, -0.008820086426078146, -0.06134462110578873, 0.11255400409477986, 0.323106525014859, 0.15680338116460518, 0.2968776331052278, -0.4758903465679839, -0.26805616998379783, 0.04056714706640385, 0.13417956943940684, 0.06772217184878464, -0.023437228954804105, -0.34455547475098525, 0.09311826469815931, -0.1447497380999144, -0.041172821124616475, -0.08222022104446831, 0.0018695640723033174, 0.013153569062119116, -0.24789327719227308, 0.11029341357183925, 0.022669923153291104, 0.121823655558797, -0.08281211753350393, -0.0727092230011623, -0.014445061631062451, 0.2016729328257008, 0.060159766949721055, 0.026009285982948643, 0.19394877872492397, -0.12647852786041858, -0.12083835996581758, 0.3198288357542718, -0.01885705517737993, -0.1654295462825406, 0.22095046290920406, -0.10044892409624641, -0.1496509553848946, 0.11856819255235448, 0.16242382306010783, 0.05449998830621201, -0.168198905100639, -0.016944962684524896, 0.036645144594934995, 0.21219390452528342, 0.09244955161062046, 0.013725511553626852, 0.18945669281852096, 0.22407664735058025, -0.01544529838248928, 0.12776176474828022, -0.08212425398954362, -0.08016138263594579, -0.2233607204302758, -0.08871651309084523, -0.15048052396717237, -0.020980273396108876, -0.09166772115126716, -0.15634121811369575, 0.45815818185405416, 0.14492525828043792, 0.1468972647562623, 0.04977746216026076, 0.2763426047167741, 0.04867652119841708, 0.09766622352366876, 0.05580809772476366, 0.18813567547745877, 0.08294021773779131, 0.14885543295017936, -0.23120060460661546, 0.13385676764961363, -0.031758945343327245] |
1,802.01009 | Image Posterization Using Fuzzy Logic and Bilateral Filter | Image posterization is converting images with a large number of tones into
synthetic images with distinct flat areas and a fewer number of tones. In this
technical report, we present the implementation and results of using fuzzy
logic in order to generate a posterized image in a simple and fast way. The
image filter is based on fuzzy logic and bilateral filtering; where, the given
image is blurred to remove small details. Then, the fuzzy logic is used to
classify each pixel into one of three specific categories in order to reduce
the number of colors. This filter was developed during building the Specs on
Face dataset in order to add a new level of difficulty to the original face
images in the dataset. This filter does not hurt the human detection
performance; however, it is considered a hindrance evading the face detection
process. This filter can be used generally for posterizing images, especially
those have a high contrast to get images with vivid colors.
| cs.CV | image posterization is converting images with a large number of tones into synthetic images with distinct flat areas and a fewer number of tones in this technical report we present the implementation and results of using fuzzy logic in order to generate a posterized image in a simple and fast way the image filter is based on fuzzy logic and bilateral filtering where the given image is blurred to remove small details then the fuzzy logic is used to classify each pixel into one of three specific categories in order to reduce the number of colors this filter was developed during building the specs on face dataset in order to add a new level of difficulty to the original face images in the dataset this filter does not hurt the human detection performance however it is considered a hindrance evading the face detection process this filter can be used generally for posterizing images especially those have a high contrast to get images with vivid colors | [['image', 'posterization', 'is', 'converting', 'images', 'with', 'a', 'large', 'number', 'of', 'tones', 'into', 'synthetic', 'images', 'with', 'distinct', 'flat', 'areas', 'and', 'a', 'fewer', 'number', 'of', 'tones', 'in', 'this', 'technical', 'report', 'we', 'present', 'the', 'implementation', 'and', 'results', 'of', 'using', 'fuzzy', 'logic', 'in', 'order', 'to', 'generate', 'a', 'posterized', 'image', 'in', 'a', 'simple', 'and', 'fast', 'way', 'the', 'image', 'filter', 'is', 'based', 'on', 'fuzzy', 'logic', 'and', 'bilateral', 'filtering', 'where', 'the', 'given', 'image', 'is', 'blurred', 'to', 'remove', 'small', 'details', 'then', 'the', 'fuzzy', 'logic', 'is', 'used', 'to', 'classify', 'each', 'pixel', 'into', 'one', 'of', 'three', 'specific', 'categories', 'in', 'order', 'to', 'reduce', 'the', 'number', 'of', 'colors', 'this', 'filter', 'was', 'developed', 'during', 'building', 'the', 'specs', 'on', 'face', 'dataset', 'in', 'order', 'to', 'add', 'a', 'new', 'level', 'of', 'difficulty', 'to', 'the', 'original', 'face', 'images', 'in', 'the', 'dataset', 'this', 'filter', 'does', 'not', 'hurt', 'the', 'human', 'detection', 'performance', 'however', 'it', 'is', 'considered', 'a', 'hindrance', 'evading', 'the', 'face', 'detection', 'process', 'this', 'filter', 'can', 'be', 'used', 'generally', 'for', 'posterizing', 'images', 'especially', 'those', 'have', 'a', 'high', 'contrast', 'to', 'get', 'images', 'with', 'vivid', 'colors']] | [-0.04653334844696485, 0.01810397316103824, -0.0706108914182326, 0.051274908884458716, -0.11700889775040847, -0.13753885317598843, 0.0012378606407753663, 0.43808986545528894, -0.2347068025811035, -0.3581031926147306, 0.13935283833775486, -0.27565306748183055, -0.129673939321857, 0.1539231484675389, -0.1975927397545519, 0.03924136641320347, 0.06398969248259141, 0.06363453472142372, -0.003650326787420106, -0.27493780847339905, 0.26972760795040723, 0.018288262533368887, 0.28302958382244714, -0.01780870514002019, 0.11923706939409452, -0.014299647388893558, -0.052083008002811744, 0.01979848881321097, -0.028956100605514453, 0.14460879312195804, 0.30076841920482017, 0.16286138191612232, 0.28781060342113546, -0.426796974648756, -0.15876827220415213, 0.10215029133092841, 0.11606489165174419, 0.11570608328717451, -0.06950063924851287, -0.320612103366408, 0.11346248996926954, -0.13054472044754176, -0.012077602747731474, -0.08090284147679254, 0.012698585398920617, -0.031096032196734243, -0.2768035926065626, 0.0077950664318776055, 0.06763026886619627, 0.05273637462142901, -0.01619037625632812, -0.09797528127702758, 0.008051150196726307, 0.1594062470773488, -0.018818254095543878, 0.032879240696791295, 0.12228451760048852, -0.18800634539213296, -0.10625025997495992, 0.38539744201863624, -0.01924503831419933, -0.23039400045196584, 0.1987029015974797, -0.10897471320550935, -0.11957802474038837, 0.1566810665284226, 0.18384330104576585, 0.0950670154782495, -0.14539729826508757, -0.0020248236028293583, -0.03833389006854023, 0.2384183224072151, 0.08475037388227603, 0.019073207517740904, 0.19298371850990081, 0.20637996424741203, 0.04191536255853458, 0.19333228568997762, -0.16650459866821307, -0.01091518180364352, -0.24098114380153057, -0.13049095307504127, -0.18392163304106138, -0.036422684183541866, -0.06524768537219418, -0.18187759651401494, 0.43305746954578306, 0.23904973670797505, 0.24045109548203555, 0.04672098523695712, 0.37236468785982807, 0.08918486480072232, 0.15575873452909922, -0.013674694794678578, 0.1808386488047279, 0.0402600485659032, 0.08372026888285707, -0.12922547429794284, 0.025245470992277984, 0.06197063778642059] |
1,802.0101 | Some regularity results for $p$-harmonic mappings between Riemannian
manifolds | Let $M$ be a $C^2$-smooth Riemannian manifold with boundary and $N$ a
complete $C^2$-smooth Riemannian manifold. We show that each stationary
$p$-harmonic mapping $u\colon M\to N$, whose image lies in a compact subset of
$N$, is locally $C^{1,\alpha}$ for some $\alpha\in (0,1)$, provided that $N$ is
simply connected and has non-positive sectional curvature. We also prove
similar results for each minimizing $p$-harmonic mapping $u\colon M\to N$ with
$u(M)$ being contained in a regular geodesic ball. Moreover, when $M$ has
non-negative Ricci curvature and $N$ is simply connected and has non-positive
sectional curvature, we deduce a quantitative gradient estimate for each
$C^1$-smooth weakly $p$-harmonic mapping $u\colon M\to N$. Consequently, we
obtain a Liouville-type theorem for $C^1$-smooth weakly $p$-harmonic mappings
in the same setting.
| math.DG math.AP | let m be a c2smooth riemannian manifold with boundary and n a complete c2smooth riemannian manifold we show that each stationary pharmonic mapping ucolon mto n whose image lies in a compact subset of n is locally c1alpha for some alphain 01 provided that n is simply connected and has nonpositive sectional curvature we also prove similar results for each minimizing pharmonic mapping ucolon mto n with um being contained in a regular geodesic ball moreover when m has nonnegative ricci curvature and n is simply connected and has nonpositive sectional curvature we deduce a quantitative gradient estimate for each c1smooth weakly pharmonic mapping ucolon mto n consequently we obtain a liouvilletype theorem for c1smooth weakly pharmonic mappings in the same setting | [['let', 'm', 'be', 'a', 'c2smooth', 'riemannian', 'manifold', 'with', 'boundary', 'and', 'n', 'a', 'complete', 'c2smooth', 'riemannian', 'manifold', 'we', 'show', 'that', 'each', 'stationary', 'pharmonic', 'mapping', 'ucolon', 'mto', 'n', 'whose', 'image', 'lies', 'in', 'a', 'compact', 'subset', 'of', 'n', 'is', 'locally', 'c1alpha', 'for', 'some', 'alphain', '01', 'provided', 'that', 'n', 'is', 'simply', 'connected', 'and', 'has', 'nonpositive', 'sectional', 'curvature', 'we', 'also', 'prove', 'similar', 'results', 'for', 'each', 'minimizing', 'pharmonic', 'mapping', 'ucolon', 'mto', 'n', 'with', 'um', 'being', 'contained', 'in', 'a', 'regular', 'geodesic', 'ball', 'moreover', 'when', 'm', 'has', 'nonnegative', 'ricci', 'curvature', 'and', 'n', 'is', 'simply', 'connected', 'and', 'has', 'nonpositive', 'sectional', 'curvature', 'we', 'deduce', 'a', 'quantitative', 'gradient', 'estimate', 'for', 'each', 'c1smooth', 'weakly', 'pharmonic', 'mapping', 'ucolon', 'mto', 'n', 'consequently', 'we', 'obtain', 'a', 'liouvilletype', 'theorem', 'for', 'c1smooth', 'weakly', 'pharmonic', 'mappings', 'in', 'the', 'same', 'setting']] | [-0.20280349353084065, 0.08023354875450557, -0.05788508085075949, 0.03599571678539372, -0.1103703757885416, -0.2624267785596188, -0.05695549581394546, 0.43001370574729364, -0.2635101547367398, -0.11754929817846564, 0.12378454325600435, -0.3601139424345838, -0.10542439664456398, 0.15253985128136444, -0.13107237158740154, 0.039807858357786156, 0.07317006807071996, 0.13287372758886853, -0.06300599569622732, -0.22173182160944724, 0.42172496471951, -0.13690511773141925, 0.1513545341774455, 0.10279423032780408, 0.12974011627888044, -0.04944728345793412, 0.045002130131699056, 0.06338262301678846, -0.21760526694966667, 0.08535750804766708, 0.2948048834490483, 0.09248327972466645, 0.27755369679605374, -0.33891059194126577, -0.22630607359660943, 0.2561866257675603, 0.12471499882178519, -0.11574076397771962, -0.027810289124914324, -0.32043806850799494, 0.1524856130813905, 0.0301499847154759, -0.185076527285569, -0.05111792169083826, 0.09348711123323587, 0.008498927005795671, -0.2993646809739656, 0.008830444530162152, 0.14988672079472634, 0.038716549574078794, -0.11248454280182353, -0.12050554780747558, -0.10233515093377868, 0.10069793206186331, -0.03703087223044856, 0.2011730363859688, 0.09787420788398166, 0.04615241638766449, 0.02707751205603241, 0.2856911908010723, -0.18558792013018469, -0.3690806355968606, 0.07949789468061606, -0.19766969342914517, -0.17270668002120296, 0.11729180274462542, 0.11799453629813439, 0.2205153424101958, -0.06164008625613651, 0.27495178908728, -0.1178957198080454, 0.14063761024029742, 0.13030213075613634, -0.06243907422834977, 0.0756009235886521, 0.1074857244785249, 0.24363386206000615, 0.12903901412949484, 0.00459343936011867, 0.03166051961664782, -0.3885291633272513, -0.21895667023910972, -0.22763197520866105, 0.2423411137290818, -0.20241818651814608, -0.18461143902930446, 0.26239223984360205, -0.06819355976767838, 0.22968321476803452, 0.21938460382068012, 0.2213879261684955, 0.060173992348117294, -0.03082517069596492, 0.16749057033267178, 0.10103170712383991, 0.19920561778679735, -0.008439720590163756, -0.10538805281117436, -0.07510756028693963, 0.17836707868598034] |
1,802.01011 | Realizing an exact entangling gate using Fibonacci anyons | Fibonacci anyons are attractive for use in topological quantum computation
because any unitary transformation of their state space can be approximated
arbitrarily accurately by braiding. However there is no known braid that
entangles two qubits without leaving the space spanned by the two qubits. In
other words, there is no known "leakage-free" entangling gate made by braiding.
In this paper, we provide a remedy to this problem by supplementing braiding
with measurement operations in order to produce an exact controlled rotation
gate on two qubits.
| quant-ph math.GT math.QA | fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding however there is no known braid that entangles two qubits without leaving the space spanned by the two qubits in other words there is no known leakagefree entangling gate made by braiding in this paper we provide a remedy to this problem by supplementing braiding with measurement operations in order to produce an exact controlled rotation gate on two qubits | [['fibonacci', 'anyons', 'are', 'attractive', 'for', 'use', 'in', 'topological', 'quantum', 'computation', 'because', 'any', 'unitary', 'transformation', 'of', 'their', 'state', 'space', 'can', 'be', 'approximated', 'arbitrarily', 'accurately', 'by', 'braiding', 'however', 'there', 'is', 'no', 'known', 'braid', 'that', 'entangles', 'two', 'qubits', 'without', 'leaving', 'the', 'space', 'spanned', 'by', 'the', 'two', 'qubits', 'in', 'other', 'words', 'there', 'is', 'no', 'known', 'leakagefree', 'entangling', 'gate', 'made', 'by', 'braiding', 'in', 'this', 'paper', 'we', 'provide', 'a', 'remedy', 'to', 'this', 'problem', 'by', 'supplementing', 'braiding', 'with', 'measurement', 'operations', 'in', 'order', 'to', 'produce', 'an', 'exact', 'controlled', 'rotation', 'gate', 'on', 'two', 'qubits']] | [-0.17672348230091087, 0.26890132445174353, 0.0009707091485752779, 0.053211314735167166, -0.021328613556483213, -0.24414103113881805, 0.0905026956634281, 0.41414977452334234, -0.24275008746806312, -0.3225308049719281, 0.06049551610999247, -0.22905820714419378, -0.12164577334461843, 0.2471165682469933, -0.09789438348516877, 0.061870698203497075, 0.06679096720729243, 0.035679685245336525, -0.1338070944239221, -0.2991864711374921, 0.30227663944311, -0.01670182564378004, 0.22846429312930389, -0.04620262116796392, 0.09168178940958836, -0.013172898299115545, -0.00022685284561970654, -0.0328526283511618, -0.06336975792630041, 0.10005635766942492, 0.28646384946563663, 0.06643820785752991, 0.18736261957982445, -0.4750063450020902, -0.1654350510223166, 0.13051419559154, 0.18177048613810365, 0.15615505863200216, -0.044873792457613436, -0.31583224103293, 0.03873225871254416, -0.20984957535915516, -0.05525165293365717, -0.16569565969574102, 0.033081490929950684, -0.07570453338900253, -0.18672145342947366, 0.0018039824634102201, 0.08700751088395277, 0.06174673828132012, 0.042379800145349956, 0.005938714008559199, 0.012794748184216373, 0.14487803642131278, -0.03598161921014681, 0.054783497323446416, 0.11027282722403899, -0.11017600877402241, -0.17506428883575342, 0.3412792888086508, 0.002378461777013453, -0.27549562042250353, 0.15561669934404027, -0.08489087204558446, -0.1030247777207371, 0.05732068777741755, 0.00917272432570291, 0.03506359799819834, -0.1349971916197854, 0.119772682855974, -0.02605794490698506, 0.20162623807349625, 0.11732869521879098, 0.065715765670928, 0.2161105121129795, 0.05672015981639133, 0.12605777816737399, 0.18010208010605044, -0.017696502752711667, -0.10432647361474878, -0.3166701786000939, -0.18988762963974082, -0.29752483664847473, 0.10581643659731045, -0.02494702200569651, -0.17128343000898466, 0.37967368581825317, 0.14745170832200744, 0.18817818672122325, -7.865394410841605e-05, 0.29208196984494433, 0.11141837809015723, 0.10389731264234904, 0.10035894394797437, 0.2036973333095803, 0.13916481788653662, -0.03132244738037972, -0.2337933850036386, 0.07056704634143149, 0.10003105749869172] |
1,802.01012 | A General Algorithm For Compensation Of Trajectory Errors: Application
To Radial Imaging | Purpose: To reconstruct artifact-free images from measured k-space data, when
the actual k-space trajectory deviates from the nominal trajectory due to
gradient imperfections.
Methods: Trajectory errors arising from eddy currents and gradient delays
introduce phase inconsistencies in several fast scanning MR pulse sequences,
resulting in image artifacts. The proposed algorithm provides a novel framework
to compensate for this phase distortion. The algorithm relies on the
construction of a multi-block Hankel matrix, where each block is constructed
from k-space segments with the same phase distortion. In the presence of
spatially smooth phase distortions between the segments, the complete
block-Hankel matrix is known to be highly low-rank. Since each k-space segment
is only acquiring part of the k-space data, the reconstruction of the phase
compensated image from their partially parallel measurements is posed as a
structured low-rank matrix optimization problem, assuming the coil
sensitivities to be known.
Results: The proposed formulation is tested on radial acquisitions in several
settings including partial Fourier and golden-angle acquisitions. The
experiments demonstrate the ability of the algorithm to successfully remove the
artifacts arising from the trajectory errors, without the need for trajectory
or phase calibration. The quality of the reconstruction was comparable to
corrections achieved using the Trajectory Auto-Corrected Image Reconstruction
(TrACR) for radial acquisitions.
Conclusion: The proposed method provides a general framework for the recovery
of artifact-free images from radial trajectories without the need for
trajectory calibration.
| physics.med-ph | purpose to reconstruct artifactfree images from measured kspace data when the actual kspace trajectory deviates from the nominal trajectory due to gradient imperfections methods trajectory errors arising from eddy currents and gradient delays introduce phase inconsistencies in several fast scanning mr pulse sequences resulting in image artifacts the proposed algorithm provides a novel framework to compensate for this phase distortion the algorithm relies on the construction of a multiblock hankel matrix where each block is constructed from kspace segments with the same phase distortion in the presence of spatially smooth phase distortions between the segments the complete blockhankel matrix is known to be highly lowrank since each kspace segment is only acquiring part of the kspace data the reconstruction of the phase compensated image from their partially parallel measurements is posed as a structured lowrank matrix optimization problem assuming the coil sensitivities to be known results the proposed formulation is tested on radial acquisitions in several settings including partial fourier and goldenangle acquisitions the experiments demonstrate the ability of the algorithm to successfully remove the artifacts arising from the trajectory errors without the need for trajectory or phase calibration the quality of the reconstruction was comparable to corrections achieved using the trajectory autocorrected image reconstruction tracr for radial acquisitions conclusion the proposed method provides a general framework for the recovery of artifactfree images from radial trajectories without the need for trajectory calibration | [['purpose', 'to', 'reconstruct', 'artifactfree', 'images', 'from', 'measured', 'kspace', 'data', 'when', 'the', 'actual', 'kspace', 'trajectory', 'deviates', 'from', 'the', 'nominal', 'trajectory', 'due', 'to', 'gradient', 'imperfections', 'methods', 'trajectory', 'errors', 'arising', 'from', 'eddy', 'currents', 'and', 'gradient', 'delays', 'introduce', 'phase', 'inconsistencies', 'in', 'several', 'fast', 'scanning', 'mr', 'pulse', 'sequences', 'resulting', 'in', 'image', 'artifacts', 'the', 'proposed', 'algorithm', 'provides', 'a', 'novel', 'framework', 'to', 'compensate', 'for', 'this', 'phase', 'distortion', 'the', 'algorithm', 'relies', 'on', 'the', 'construction', 'of', 'a', 'multiblock', 'hankel', 'matrix', 'where', 'each', 'block', 'is', 'constructed', 'from', 'kspace', 'segments', 'with', 'the', 'same', 'phase', 'distortion', 'in', 'the', 'presence', 'of', 'spatially', 'smooth', 'phase', 'distortions', 'between', 'the', 'segments', 'the', 'complete', 'blockhankel', 'matrix', 'is', 'known', 'to', 'be', 'highly', 'lowrank', 'since', 'each', 'kspace', 'segment', 'is', 'only', 'acquiring', 'part', 'of', 'the', 'kspace', 'data', 'the', 'reconstruction', 'of', 'the', 'phase', 'compensated', 'image', 'from', 'their', 'partially', 'parallel', 'measurements', 'is', 'posed', 'as', 'a', 'structured', 'lowrank', 'matrix', 'optimization', 'problem', 'assuming', 'the', 'coil', 'sensitivities', 'to', 'be', 'known', 'results', 'the', 'proposed', 'formulation', 'is', 'tested', 'on', 'radial', 'acquisitions', 'in', 'several', 'settings', 'including', 'partial', 'fourier', 'and', 'goldenangle', 'acquisitions', 'the', 'experiments', 'demonstrate', 'the', 'ability', 'of', 'the', 'algorithm', 'to', 'successfully', 'remove', 'the', 'artifacts', 'arising', 'from', 'the', 'trajectory', 'errors', 'without', 'the', 'need', 'for', 'trajectory', 'or', 'phase', 'calibration', 'the', 'quality', 'of', 'the', 'reconstruction', 'was', 'comparable', 'to', 'corrections', 'achieved', 'using', 'the', 'trajectory', 'autocorrected', 'image', 'reconstruction', 'tracr', 'for', 'radial', 'acquisitions', 'conclusion', 'the', 'proposed', 'method', 'provides', 'a', 'general', 'framework', 'for', 'the', 'recovery', 'of', 'artifactfree', 'images', 'from', 'radial', 'trajectories', 'without', 'the', 'need', 'for', 'trajectory', 'calibration']] | [-0.07329314437608801, 0.03717519573907813, -0.08752654402152352, 0.0372663513413104, -0.06963219958377759, -0.10847351273886212, 0.018743149912916125, 0.4039513409299695, -0.3231716376081433, -0.3102956841659287, 0.13535940750684264, -0.2530736054911319, -0.14473466374810137, 0.193589228868444, -0.1279425692592707, 0.10072837411527238, 0.12841479414162915, -0.019389373594490084, -0.1279425176791847, -0.20134096452308334, 0.2757521219126394, 0.047252122177135036, 0.3205164710606408, -0.026341322738596278, 0.13334040716189244, 0.03099197844630512, -0.04645560151775894, 0.018844312178375927, -0.04143468912528909, 0.08755787742759466, 0.25090637877482275, 0.15343696642667054, 0.23773295285778737, -0.4284475653715756, -0.21796046520428955, 0.08965614509019677, 0.1193988409229939, 0.1570957032467603, -0.07556045069865397, -0.34277781586608164, 0.07136329360731432, -0.058203524555859115, -0.06658048611842905, -0.09539561372796965, -0.07503054353368023, -0.02009085745085031, -0.3214607199411029, 0.10517447078701757, 0.01404711802125625, 0.01245014385279754, -0.08629645248014561, -0.09766388859589706, 0.01288343455804431, 0.14235579943469137, 0.04352781009435168, 0.09286722586307998, 0.12188760703834503, -0.07836558758584863, -0.08876479126351035, 0.3888437763423375, -0.018419822906751347, -0.22574062090286096, 0.10533191448826666, -0.1251839213144115, -0.06240323310839417, 0.23114630289315044, 0.17067419174835896, 0.0981902202439454, -0.15326996766032053, 0.05843677086826495, 0.03274526067391929, 0.19021626331074082, 0.05048444741101855, -0.025057443284743425, 0.15659309623702228, 0.12616463686167464, 0.08789207705337068, 0.13398545901291073, -0.1964774069983674, -0.051692731355053735, -0.2476224700044638, -0.096190157165351, -0.22451627100210475, -0.04354922444529265, -0.10210262221719503, -0.18417212513639875, 0.4143005837676237, 0.16498007943712012, 0.22301647725879498, 0.04321959070537401, 0.3967219485050958, 0.04444885895304058, 0.0856256025726907, 0.037362262495267, 0.19964666847625503, 0.10969526654656005, 0.11648818307148759, -0.2200204559138713, 0.09074590365888308, 0.08059245631422686] |
1,802.01013 | Plan Explanations as Model Reconciliation -- An Empirical Study | Recent work in explanation generation for decision making agents has looked
at how unexplained behavior of autonomous systems can be understood in terms of
differences in the model of the system and the human's understanding of the
same, and how the explanation process as a result of this mismatch can be then
seen as a process of reconciliation of these models. Existing algorithms in
such settings, while having been built on contrastive, selective and social
properties of explanations as studied extensively in the psychology literature,
have not, to the best of our knowledge, been evaluated in settings with actual
humans in the loop. As such, the applicability of such explanations to human-AI
and human-robot interactions remains suspect. In this paper, we set out to
evaluate these explanation generation algorithms in a series of studies in a
mock search and rescue scenario with an internal semi-autonomous robot and an
external human commander. We demonstrate to what extent the properties of these
algorithms hold as they are evaluated by humans, and how the dynamics of trust
between the human and the robot evolve during the process of these
interactions.
| cs.AI | recent work in explanation generation for decision making agents has looked at how unexplained behavior of autonomous systems can be understood in terms of differences in the model of the system and the humans understanding of the same and how the explanation process as a result of this mismatch can be then seen as a process of reconciliation of these models existing algorithms in such settings while having been built on contrastive selective and social properties of explanations as studied extensively in the psychology literature have not to the best of our knowledge been evaluated in settings with actual humans in the loop as such the applicability of such explanations to humanai and humanrobot interactions remains suspect in this paper we set out to evaluate these explanation generation algorithms in a series of studies in a mock search and rescue scenario with an internal semiautonomous robot and an external human commander we demonstrate to what extent the properties of these algorithms hold as they are evaluated by humans and how the dynamics of trust between the human and the robot evolve during the process of these interactions | [['recent', 'work', 'in', 'explanation', 'generation', 'for', 'decision', 'making', 'agents', 'has', 'looked', 'at', 'how', 'unexplained', 'behavior', 'of', 'autonomous', 'systems', 'can', 'be', 'understood', 'in', 'terms', 'of', 'differences', 'in', 'the', 'model', 'of', 'the', 'system', 'and', 'the', 'humans', 'understanding', 'of', 'the', 'same', 'and', 'how', 'the', 'explanation', 'process', 'as', 'a', 'result', 'of', 'this', 'mismatch', 'can', 'be', 'then', 'seen', 'as', 'a', 'process', 'of', 'reconciliation', 'of', 'these', 'models', 'existing', 'algorithms', 'in', 'such', 'settings', 'while', 'having', 'been', 'built', 'on', 'contrastive', 'selective', 'and', 'social', 'properties', 'of', 'explanations', 'as', 'studied', 'extensively', 'in', 'the', 'psychology', 'literature', 'have', 'not', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'been', 'evaluated', 'in', 'settings', 'with', 'actual', 'humans', 'in', 'the', 'loop', 'as', 'such', 'the', 'applicability', 'of', 'such', 'explanations', 'to', 'humanai', 'and', 'humanrobot', 'interactions', 'remains', 'suspect', 'in', 'this', 'paper', 'we', 'set', 'out', 'to', 'evaluate', 'these', 'explanation', 'generation', 'algorithms', 'in', 'a', 'series', 'of', 'studies', 'in', 'a', 'mock', 'search', 'and', 'rescue', 'scenario', 'with', 'an', 'internal', 'semiautonomous', 'robot', 'and', 'an', 'external', 'human', 'commander', 'we', 'demonstrate', 'to', 'what', 'extent', 'the', 'properties', 'of', 'these', 'algorithms', 'hold', 'as', 'they', 'are', 'evaluated', 'by', 'humans', 'and', 'how', 'the', 'dynamics', 'of', 'trust', 'between', 'the', 'human', 'and', 'the', 'robot', 'evolve', 'during', 'the', 'process', 'of', 'these', 'interactions']] | [-0.07695586014449357, 0.0705803295220485, -0.08178742286776576, 0.09093868135169227, -0.07548519034675735, -0.10680438602034421, 0.053789516358716004, 0.4306252753825231, -0.2530985378142307, -0.3628462862004252, 0.0922725002597619, -0.24313078533589122, -0.2256080094939048, 0.2031171626413246, -0.08807909389320302, 0.05516577688391933, 0.04758937624538377, 0.05546636573776085, 0.0012234493580841046, -0.2591283569079114, 0.2859208883249505, 0.05970489751687024, 0.25300928461240896, 0.05959877106585206, 0.08704798456896495, -0.032499201479990455, -0.020973512729789246, 0.01669814281494302, -0.0735022482116094, 0.11765927857193936, 0.3011788322255403, 0.19384937178104478, 0.3038089460653457, -0.4388640053809327, -0.22842104811181518, 0.1258802347403159, 0.16950403760314325, 0.09584971801452538, -0.027287406187609116, -0.3093992502149692, 0.0631223152681717, -0.18613180046325878, -0.09628965737756322, -0.09539336846135357, 0.009645738564232453, 0.02119052006064959, -0.22642549931913375, 0.01947112626490746, 0.08752649475665972, 0.10127904218307791, -0.07057613327745647, -0.09304863820910793, 0.02440910939784611, 0.20843341287205563, 0.08970994454883861, 0.007239646794408919, 0.13355946658897577, -0.1978681867248936, -0.21164691875773398, 0.40891922744399406, -0.015691642947046752, -0.1809304216117125, 0.24612869381099034, -0.11500519337032966, -0.14370690477155348, 0.028174613855211413, 0.22293627834355928, 0.10117150008065855, -0.18413924345158958, 0.03657267200088198, -0.03120317476188993, 0.12932776657485945, 0.04247836863346906, 0.018685514505773305, 0.21661061488644762, 0.21054931086821752, -0.00043982481534149555, 0.1075427257567943, -0.025246752736054083, -0.1152340871715211, -0.24635187897925828, -0.14187146079562166, -0.14077984849563774, 7.676163118364996e-05, -0.03580130079330349, -0.12361496092781504, 0.348793189748524, 0.22780499836918025, 0.22797716878613528, 0.015439351860005508, 0.311757218346677, 0.06274654369567519, 0.08255410299482033, 0.022374826976481604, 0.254000785470477, 0.027704565816952343, 0.12066058199080754, -0.20032863152327943, 0.15656652094928278, -0.011313262861222029] |
1,802.01014 | A Graph Theoretic Approach for Training Overhead Reduction in FDD
Massive MIMO Systems | The overheads associated with feedback-based channel acquisition can greatly
compromise the achievable rates of FDD based massive MIMO systems. Indeed,
downlink (DL) training and uplink (UL) feedback overheads scale linearly with
the number of base station (BS) antennas, in sharp contrast to TDD-based
massive MIMO, where a single UL pilot trains the whole BS array. In this work,
we propose a graph-theoretic approach to reducing DL training and UL feedback
overheads in FDD massive MIMO systems. In particular, we consider a single-cell
scenario involving a single BS with a massive antenna array serving to
single-antenna mobile stations (MSs) in the DL. We assume the BS employs
two-stage beamforming in the DL, comprising DFT pre-beamforming followed by
MU-MIMO precoding. The proposed graph-theoretic approach exploits knowledge of
the angular spectra of the BS-MS channels to construct DL training protocols
with reduced overheads. Simulation results reveal that the proposed
training-resources allocation method can provide approximately 35% sum-rate
performance gain compared to conventional orthogonal training. Our analysis
also sheds light into the impact of overhead reduction on channel estimation
quality, and, in turn, achievable rates.
| cs.IT math.IT | the overheads associated with feedbackbased channel acquisition can greatly compromise the achievable rates of fdd based massive mimo systems indeed downlink dl training and uplink ul feedback overheads scale linearly with the number of base station bs antennas in sharp contrast to tddbased massive mimo where a single ul pilot trains the whole bs array in this work we propose a graphtheoretic approach to reducing dl training and ul feedback overheads in fdd massive mimo systems in particular we consider a singlecell scenario involving a single bs with a massive antenna array serving to singleantenna mobile stations mss in the dl we assume the bs employs twostage beamforming in the dl comprising dft prebeamforming followed by mumimo precoding the proposed graphtheoretic approach exploits knowledge of the angular spectra of the bsms channels to construct dl training protocols with reduced overheads simulation results reveal that the proposed trainingresources allocation method can provide approximately 35 sumrate performance gain compared to conventional orthogonal training our analysis also sheds light into the impact of overhead reduction on channel estimation quality and in turn achievable rates | [['the', 'overheads', 'associated', 'with', 'feedbackbased', 'channel', 'acquisition', 'can', 'greatly', 'compromise', 'the', 'achievable', 'rates', 'of', 'fdd', 'based', 'massive', 'mimo', 'systems', 'indeed', 'downlink', 'dl', 'training', 'and', 'uplink', 'ul', 'feedback', 'overheads', 'scale', 'linearly', 'with', 'the', 'number', 'of', 'base', 'station', 'bs', 'antennas', 'in', 'sharp', 'contrast', 'to', 'tddbased', 'massive', 'mimo', 'where', 'a', 'single', 'ul', 'pilot', 'trains', 'the', 'whole', 'bs', 'array', 'in', 'this', 'work', 'we', 'propose', 'a', 'graphtheoretic', 'approach', 'to', 'reducing', 'dl', 'training', 'and', 'ul', 'feedback', 'overheads', 'in', 'fdd', 'massive', 'mimo', 'systems', 'in', 'particular', 'we', 'consider', 'a', 'singlecell', 'scenario', 'involving', 'a', 'single', 'bs', 'with', 'a', 'massive', 'antenna', 'array', 'serving', 'to', 'singleantenna', 'mobile', 'stations', 'mss', 'in', 'the', 'dl', 'we', 'assume', 'the', 'bs', 'employs', 'twostage', 'beamforming', 'in', 'the', 'dl', 'comprising', 'dft', 'prebeamforming', 'followed', 'by', 'mumimo', 'precoding', 'the', 'proposed', 'graphtheoretic', 'approach', 'exploits', 'knowledge', 'of', 'the', 'angular', 'spectra', 'of', 'the', 'bsms', 'channels', 'to', 'construct', 'dl', 'training', 'protocols', 'with', 'reduced', 'overheads', 'simulation', 'results', 'reveal', 'that', 'the', 'proposed', 'trainingresources', 'allocation', 'method', 'can', 'provide', 'approximately', '35', 'sumrate', 'performance', 'gain', 'compared', 'to', 'conventional', 'orthogonal', 'training', 'our', 'analysis', 'also', 'sheds', 'light', 'into', 'the', 'impact', 'of', 'overhead', 'reduction', 'on', 'channel', 'estimation', 'quality', 'and', 'in', 'turn', 'achievable', 'rates']] | [-0.29278175049597244, 0.001702363457944658, 0.029802321398165077, -0.019950612609843828, -0.09664317798774896, -0.2662546388688497, 0.19149626849814214, 0.36069575049655717, -0.22229966513760802, -0.28139935922032844, 0.04656526897063789, -0.2107328460487123, -0.18892327258622066, 0.12428505494479193, -0.1402891324367374, 0.05340123510816031, 0.11617208167186213, 0.016713714599771064, -0.0650128904267654, -0.28432667016309604, 0.26511116247080885, 0.14525978202388312, 0.4154130472491185, -0.07116207040380687, 0.07271839586190051, 0.007648320545235442, -0.05014010864866173, -0.0903085471273193, -0.036479956076113415, 0.08417449242147591, 0.38585480066637196, 0.2561850560259902, 0.26693840405593317, -0.435833895056405, -0.26220671708320475, 0.04683414437911577, 0.25770648827569353, 0.05017076820238597, -0.06260239580684962, -0.25999308802161575, 0.14277627148096347, -0.2729322828973333, 0.014592178643215447, 0.040136782467986146, -0.12840227648201916, 0.03582471203693179, -0.43109692882022094, 0.027705089658492298, -0.021571097900677058, 0.03657614884432405, -0.052799061500506166, -0.1526295820535678, 0.05067371542487915, 0.10770663206931204, 0.024050005053868517, -0.02883450636937697, 0.09631240453648691, -0.06932265170358329, -0.0969651851848337, 0.3307463316816009, 0.005028081204121311, -0.27524278527384416, 0.17087164880876016, -0.12041772016285297, -0.06296460696030408, 0.18716783735176756, 0.30384568551089614, 0.04061000511153705, -0.1828659287498643, 0.03030742405713277, 0.021399381844740776, 0.21529221934421608, 0.09312169638772806, 0.1768039656305013, 0.11911871895426884, 0.2789535895727264, 0.11022738515813317, 0.13811635290427754, -0.18865449670217155, -0.1194175303952458, -0.1634355672673943, -0.1088739761599249, -0.1958996412396017, 0.030275523407100182, -0.10485709881088244, -0.010041302948310557, 0.29784850642705957, 0.11605910379956993, 0.11755657290729384, 0.17075486690478606, 0.4482080053952005, 0.08797785091964114, 0.1193150263955532, 0.15502581473750374, 0.19457373891976507, 0.11696176821133122, 0.1938422172291515, -0.28609828735190806, -0.05320789325697761, -0.04433601822238416] |
1,802.01015 | Positivity-preserving scheme for two-dimensional advection-diffusion
equations including mixed derivatives | In this work, we propose a positivity-preserving scheme for solving
two-dimensional advection-diffusion equations including mixed derivative terms,
in order to improve the accuracy of lower-order methods. The solution to these
equations, in the absence of mixed derivatives, has been studied in detail,
while positivity-preserving solutions to mixed derivative terms have received
much less attention. A two-dimensional diffusion equation, for which the
analytical solution is known, is solved numerically to show the applicability
of the scheme. It is further applied to the Fokker-Planck collision operator in
two-dimensional cylindrical coordinates under the assumption of local thermal
equilibrium. For a thermal equilibration problem, it is shown that the scheme
conserves particle number and energy, while the preservation of positivity is
ensured and the steady-state solution is the Maxwellian distribution.
| physics.comp-ph physics.plasm-ph | in this work we propose a positivitypreserving scheme for solving twodimensional advectiondiffusion equations including mixed derivative terms in order to improve the accuracy of lowerorder methods the solution to these equations in the absence of mixed derivatives has been studied in detail while positivitypreserving solutions to mixed derivative terms have received much less attention a twodimensional diffusion equation for which the analytical solution is known is solved numerically to show the applicability of the scheme it is further applied to the fokkerplanck collision operator in twodimensional cylindrical coordinates under the assumption of local thermal equilibrium for a thermal equilibration problem it is shown that the scheme conserves particle number and energy while the preservation of positivity is ensured and the steadystate solution is the maxwellian distribution | [['in', 'this', 'work', 'we', 'propose', 'a', 'positivitypreserving', 'scheme', 'for', 'solving', 'twodimensional', 'advectiondiffusion', 'equations', 'including', 'mixed', 'derivative', 'terms', 'in', 'order', 'to', 'improve', 'the', 'accuracy', 'of', 'lowerorder', 'methods', 'the', 'solution', 'to', 'these', 'equations', 'in', 'the', 'absence', 'of', 'mixed', 'derivatives', 'has', 'been', 'studied', 'in', 'detail', 'while', 'positivitypreserving', 'solutions', 'to', 'mixed', 'derivative', 'terms', 'have', 'received', 'much', 'less', 'attention', 'a', 'twodimensional', 'diffusion', 'equation', 'for', 'which', 'the', 'analytical', 'solution', 'is', 'known', 'is', 'solved', 'numerically', 'to', 'show', 'the', 'applicability', 'of', 'the', 'scheme', 'it', 'is', 'further', 'applied', 'to', 'the', 'fokkerplanck', 'collision', 'operator', 'in', 'twodimensional', 'cylindrical', 'coordinates', 'under', 'the', 'assumption', 'of', 'local', 'thermal', 'equilibrium', 'for', 'a', 'thermal', 'equilibration', 'problem', 'it', 'is', 'shown', 'that', 'the', 'scheme', 'conserves', 'particle', 'number', 'and', 'energy', 'while', 'the', 'preservation', 'of', 'positivity', 'is', 'ensured', 'and', 'the', 'steadystate', 'solution', 'is', 'the', 'maxwellian', 'distribution']] | [-0.11466035100036404, 0.029647351493911137, -0.09534420540356743, 0.056388587534745474, -0.05714423944138818, -0.1142049944434788, -0.03882434969354007, 0.3289668913265424, -0.2836065021055263, -0.28112418248894666, 0.10978314568314494, -0.24662671842804504, -0.09715367549668169, 0.14705629078098498, -0.02834515849549678, 0.13900944287519132, 0.04552532818966678, 0.02877976761628238, -0.07647757376507221, -0.26235601778737166, 0.2916707231899694, 0.048791966031468105, 0.3109511409531392, 0.06899760605255512, 0.15551790116689287, -0.04756013932083512, 0.00332075545549511, 0.03802019124850631, -0.12303398648631021, 0.06958937336827466, 0.2071132948816133, 0.04209951191423609, 0.28873808181933347, -0.4281133092082446, -0.26526469361805727, 0.10589151838443257, 0.16742980851244832, 0.13307573659149635, -0.05301470559511688, -0.22717981819166905, 0.10235940604396755, -0.17731629150904835, -0.18968429596769432, -0.11686826605970661, 0.01976566102045278, 0.020434552056175316, -0.30655773355817745, 0.13487772287298289, 0.05278863605215318, -0.007037376341897817, -0.11167638843125176, -0.09225158589256424, -0.027826734386118396, 0.03489702938508893, 0.06539128777674502, -0.01525387027493072, 0.0475057273038796, -0.13786010729289422, -0.05497257732268837, 0.42621542303453364, -0.06559818823515097, -0.3287432439170689, 0.15668705129434193, -0.12113066691727865, -0.08378709270249284, 0.16688095814592205, 0.14523301435457098, 0.17870571582193767, -0.17930347689737877, 0.1275135547039099, -0.028294677801785014, 0.12544502438755617, 0.0780620797378351, 0.02093029248025564, 0.08491461935992693, 0.15419357848013676, 0.10967649464931575, 0.1537208894918126, -0.0350365422569984, -0.18211470581110686, -0.26976667079956285, -0.17365759537954414, -0.20166228851673032, 0.024847896241154226, -0.05285191488251763, -0.14799946650104145, 0.38884022255871736, 0.1565214450515452, 0.10072259219097239, 0.03889810753753409, 0.3083868350367993, 0.24718327200158485, 0.02210443639861686, 0.08577128990168964, 0.2347471066602757, 0.16407910413810953, 0.14892087584464914, -0.2766018896289761, 0.07888209067713765, 0.13608588058398002] |
1,802.01016 | An Area and Energy Efficient Design of Domain-Wall Memory-Based Deep
Convolutional Neural Networks using Stochastic Computing | With recent trend of wearable devices and Internet of Things (IoTs), it
becomes attractive to develop hardware-based deep convolutional neural networks
(DCNNs) for embedded applications, which require low power/energy consumptions
and small hardware footprints. Recent works demonstrated that the Stochastic
Computing (SC) technique can radically simplify the hardware implementation of
arithmetic units and has the potential to satisfy the stringent power
requirements in embedded devices. However, in these works, the memory design
optimization is neglected for weight storage, which will inevitably result in
large hardware cost. Moreover, if conventional volatile SRAM or DRAM cells are
utilized for weight storage, the weights need to be re-initialized whenever the
DCNN platform is re-started.
In order to overcome these limitations, in this work we adopt an emerging
non-volatile Domain-Wall Memory (DWM), which can achieve ultra-high density, to
replace SRAM for weight storage in SC-based DCNNs. We propose DW-CNN, the first
comprehensive design optimization framework of DWM-based weight storage method.
We derive the optimal memory type, precision, and organization, as well as
whether to store binary or stochastic numbers. We present effective resource
sharing scheme for DWM-based weight storage in the convolutional and
fully-connected layers of SC-based DCNNs to achieve a desirable balance among
area, power (energy) consumption, and application-level accuracy.
| cs.NE | with recent trend of wearable devices and internet of things iots it becomes attractive to develop hardwarebased deep convolutional neural networks dcnns for embedded applications which require low powerenergy consumptions and small hardware footprints recent works demonstrated that the stochastic computing sc technique can radically simplify the hardware implementation of arithmetic units and has the potential to satisfy the stringent power requirements in embedded devices however in these works the memory design optimization is neglected for weight storage which will inevitably result in large hardware cost moreover if conventional volatile sram or dram cells are utilized for weight storage the weights need to be reinitialized whenever the dcnn platform is restarted in order to overcome these limitations in this work we adopt an emerging nonvolatile domainwall memory dwm which can achieve ultrahigh density to replace sram for weight storage in scbased dcnns we propose dwcnn the first comprehensive design optimization framework of dwmbased weight storage method we derive the optimal memory type precision and organization as well as whether to store binary or stochastic numbers we present effective resource sharing scheme for dwmbased weight storage in the convolutional and fullyconnected layers of scbased dcnns to achieve a desirable balance among area power energy consumption and applicationlevel accuracy | [['with', 'recent', 'trend', 'of', 'wearable', 'devices', 'and', 'internet', 'of', 'things', 'iots', 'it', 'becomes', 'attractive', 'to', 'develop', 'hardwarebased', 'deep', 'convolutional', 'neural', 'networks', 'dcnns', 'for', 'embedded', 'applications', 'which', 'require', 'low', 'powerenergy', 'consumptions', 'and', 'small', 'hardware', 'footprints', 'recent', 'works', 'demonstrated', 'that', 'the', 'stochastic', 'computing', 'sc', 'technique', 'can', 'radically', 'simplify', 'the', 'hardware', 'implementation', 'of', 'arithmetic', 'units', 'and', 'has', 'the', 'potential', 'to', 'satisfy', 'the', 'stringent', 'power', 'requirements', 'in', 'embedded', 'devices', 'however', 'in', 'these', 'works', 'the', 'memory', 'design', 'optimization', 'is', 'neglected', 'for', 'weight', 'storage', 'which', 'will', 'inevitably', 'result', 'in', 'large', 'hardware', 'cost', 'moreover', 'if', 'conventional', 'volatile', 'sram', 'or', 'dram', 'cells', 'are', 'utilized', 'for', 'weight', 'storage', 'the', 'weights', 'need', 'to', 'be', 'reinitialized', 'whenever', 'the', 'dcnn', 'platform', 'is', 'restarted', 'in', 'order', 'to', 'overcome', 'these', 'limitations', 'in', 'this', 'work', 'we', 'adopt', 'an', 'emerging', 'nonvolatile', 'domainwall', 'memory', 'dwm', 'which', 'can', 'achieve', 'ultrahigh', 'density', 'to', 'replace', 'sram', 'for', 'weight', 'storage', 'in', 'scbased', 'dcnns', 'we', 'propose', 'dwcnn', 'the', 'first', 'comprehensive', 'design', 'optimization', 'framework', 'of', 'dwmbased', 'weight', 'storage', 'method', 'we', 'derive', 'the', 'optimal', 'memory', 'type', 'precision', 'and', 'organization', 'as', 'well', 'as', 'whether', 'to', 'store', 'binary', 'or', 'stochastic', 'numbers', 'we', 'present', 'effective', 'resource', 'sharing', 'scheme', 'for', 'dwmbased', 'weight', 'storage', 'in', 'the', 'convolutional', 'and', 'fullyconnected', 'layers', 'of', 'scbased', 'dcnns', 'to', 'achieve', 'a', 'desirable', 'balance', 'among', 'area', 'power', 'energy', 'consumption', 'and', 'applicationlevel', 'accuracy']] | [-0.16340033773112023, 0.05392485459207605, -0.0010352011178802773, 0.01363862738556539, -0.09455304817575048, -0.2413202278914076, 0.06427399125566487, 0.42864145858523744, -0.3123766315619315, -0.3414531345113966, 0.09176554474306256, -0.22558528359285465, -0.16784445770306275, 0.17725056434945002, -0.1540224074395191, 0.12409952491996627, 0.08335413452119146, -0.005544108172020346, -0.03463027537052803, -0.2956434654336715, 0.24573740369055933, 0.12046932851123582, 0.35799733401897055, 0.04849637099901242, 0.08525858249948429, -0.054483816308978326, 0.02987424051531764, -0.04291598650161177, -0.062356660858331095, 0.19805546420484818, 0.3217296718714494, 0.1399194457951714, 0.3087824769067012, -0.540405428046178, -0.22003827164378748, 0.11238789286090098, 0.13794032717437493, 0.06070799045276134, -0.05938081437253619, -0.18494808098458795, 0.13529895546197818, -0.24711807797818133, -0.05742414559647966, -0.15435359590600117, -0.009107579168973161, 0.04228586092244322, -0.2760222587305322, -0.01195100169499318, 0.03422454727971105, 0.00788414675865651, -0.022852323087778025, -0.13490413119514272, 0.04369798177903445, 0.10218168090225435, -0.03825643514374308, 0.01861460568319422, 0.15932832432536445, -0.15935965505195782, -0.10982412733160433, 0.3298337406241426, 0.012224717925681606, -0.16963953525969283, 0.1472600915625591, -0.0032395956690843197, -0.1561071363200123, 0.08029799817150514, 0.2455245123436565, 0.032841573010527474, -0.16889579126647875, 0.06540029503159138, 0.06321291202752322, 0.1835313301839336, 0.06955980502215087, 0.13961809070086947, 0.17107817829317212, 0.2505297673176791, 0.0880087760194917, 0.14318074309552437, -0.09831725233508383, -0.0857747400352987, -0.18536498278434224, -0.16033876282573842, -0.21620800432306259, 0.05107585269177113, -0.06949258620885553, -0.14028858556640425, 0.35432778189464015, 0.19045791309326887, 0.13269652946231267, 0.10799973059785735, 0.4020384759596531, 0.0721384444440642, 0.22137917122032091, 0.14815300135352813, 0.15697425271968776, 0.034232281559311295, 0.20568844885622406, -0.1715545582142202, 0.07412235591973691, 0.024073695841555793] |
1,802.01017 | Mass - radius ratio bounds for compact objects in Lorentz-violating dRGT
Massive Gravity theory | We consider the mass-radius bounds for spherically symmetric static compact
objects in the de Rham-Gabadadze-Tolley (dRGT) Massive Gravity theories, free
of ghosts. In this type of gravitational theories the graviton, the quantum of
gravity, may have a small, but non-vanishing mass. We derive the hydrostatic
equilibrium and mass continuity equations in the Lorentz-violating Massive
gravity in the presence of a cosmological constant and for a non-zero graviton
mass. The case of the constant density stars is also investigated by
numerically solving the equilibrium equations. The influence of the graviton
mass on the global parameters (mass and radius) of these stellar configurations
is also considered. The generalized Buchdahl relations, giving the upper and
lower bounds of the mass-radius ratio are obtained, and discussed in detail. As
an application of our results we obtain gravitational redshift bounds for
compact stellar type objects in the Lorentz-violating dRGT Massive Gravity,
which may (at least in principle) be used for observationally testing this
theory in an astrophysical context.
| gr-qc | we consider the massradius bounds for spherically symmetric static compact objects in the de rhamgabadadzetolley drgt massive gravity theories free of ghosts in this type of gravitational theories the graviton the quantum of gravity may have a small but nonvanishing mass we derive the hydrostatic equilibrium and mass continuity equations in the lorentzviolating massive gravity in the presence of a cosmological constant and for a nonzero graviton mass the case of the constant density stars is also investigated by numerically solving the equilibrium equations the influence of the graviton mass on the global parameters mass and radius of these stellar configurations is also considered the generalized buchdahl relations giving the upper and lower bounds of the massradius ratio are obtained and discussed in detail as an application of our results we obtain gravitational redshift bounds for compact stellar type objects in the lorentzviolating drgt massive gravity which may at least in principle be used for observationally testing this theory in an astrophysical context | [['we', 'consider', 'the', 'massradius', 'bounds', 'for', 'spherically', 'symmetric', 'static', 'compact', 'objects', 'in', 'the', 'de', 'rhamgabadadzetolley', 'drgt', 'massive', 'gravity', 'theories', 'free', 'of', 'ghosts', 'in', 'this', 'type', 'of', 'gravitational', 'theories', 'the', 'graviton', 'the', 'quantum', 'of', 'gravity', 'may', 'have', 'a', 'small', 'but', 'nonvanishing', 'mass', 'we', 'derive', 'the', 'hydrostatic', 'equilibrium', 'and', 'mass', 'continuity', 'equations', 'in', 'the', 'lorentzviolating', 'massive', 'gravity', 'in', 'the', 'presence', 'of', 'a', 'cosmological', 'constant', 'and', 'for', 'a', 'nonzero', 'graviton', 'mass', 'the', 'case', 'of', 'the', 'constant', 'density', 'stars', 'is', 'also', 'investigated', 'by', 'numerically', 'solving', 'the', 'equilibrium', 'equations', 'the', 'influence', 'of', 'the', 'graviton', 'mass', 'on', 'the', 'global', 'parameters', 'mass', 'and', 'radius', 'of', 'these', 'stellar', 'configurations', 'is', 'also', 'considered', 'the', 'generalized', 'buchdahl', 'relations', 'giving', 'the', 'upper', 'and', 'lower', 'bounds', 'of', 'the', 'massradius', 'ratio', 'are', 'obtained', 'and', 'discussed', 'in', 'detail', 'as', 'an', 'application', 'of', 'our', 'results', 'we', 'obtain', 'gravitational', 'redshift', 'bounds', 'for', 'compact', 'stellar', 'type', 'objects', 'in', 'the', 'lorentzviolating', 'drgt', 'massive', 'gravity', 'which', 'may', 'at', 'least', 'in', 'principle', 'be', 'used', 'for', 'observationally', 'testing', 'this', 'theory', 'in', 'an', 'astrophysical', 'context']] | [-0.16650152922196576, 0.16386146367933926, -0.07679647860757184, 0.1579519013354292, -0.09249349610388645, -0.08944436221846316, -0.010337394855750805, 0.2474535072302343, -0.12630205854590149, -0.327807742696644, 0.07387584976657677, -0.21471374857873637, -0.09934463647359902, 0.18596543756919268, -0.040944293358483194, 0.02465485298057641, -0.007106943085983944, 0.06760079601916708, -0.10672346914986626, -0.2696510619752429, 0.400376550467582, 0.05660422737253087, 0.16870282870357386, 0.03623623612045419, 0.07927945961010145, -0.05433129021852203, -0.018810865969220006, 0.03143434077958388, -0.22053796025507288, 0.04776199900779439, 0.19173632431603924, 0.12937284636374083, 0.1901739027573973, -0.3702696643861159, -0.236753287953696, 0.1036795684596398, 0.14218112548521827, 0.13762929313601868, -0.0968975129064481, -0.2929825296988311, 0.066395646571096, -0.20453461361556183, -0.1974245714012282, 0.002636025781333275, 0.03129848535601164, -0.04241691533179005, -0.24727197081719074, 0.14351156326846443, 0.008968256871027449, -0.025864600491220063, -0.14999225212152523, -0.11867827584929878, -0.05008974093572448, 0.057080443565693736, 0.09510048839586438, -0.008330842705752038, 0.11974328112977048, -0.17005161191422516, -0.05686202136788266, 0.4010703108313442, -0.13313261853342453, -0.23324150846345476, 0.1776105467675745, -0.17348737722445576, -0.17238716468889198, 0.04143799685564555, 0.16860034917281266, 0.18771475182983316, -0.18623953501185392, 0.17464021289759699, -0.024720373690596844, 0.13067480333455112, 0.1287873976498248, 0.07412307148662173, 0.33722351517305466, 0.08715145073922499, 0.04642320527306592, 0.0873324116384839, -0.07049616247285558, -0.08474653514467774, -0.3394189560385935, -0.13713884368778828, -0.1172526926966384, 0.053983386825952974, -0.21076904562331572, -0.18391880198264712, 0.28434355100945347, 0.1146755613560897, 0.08797977899452614, 0.09797661276491347, 0.2687582639188854, 0.1590123458356922, 0.06715208110028158, 0.10953114839967774, 0.36837514387900755, 0.21989642131496565, 0.08234895882625247, -0.25632010689833734, -0.042333064580827584, 0.09735374503477585] |
1,802.01018 | Randomization Tests that Condition on Non-Categorical Covariate Balance | A benefit of randomized experiments is that covariate distributions of
treatment and control groups are balanced on average, resulting in simple
unbiased estimators for treatment effects. However, it is possible that a
particular randomization yields covariate imbalances that researchers want to
address in the analysis stage through adjustment or other methods. Here we
present a randomization test that conditions on covariate balance by only
considering treatment assignments that are similar to the observed one in terms
of covariate balance. Previous conditional randomization tests have only
allowed for categorical covariates, while our randomization test allows for any
type of covariate. Through extensive simulation studies, we find that our
conditional randomization test is more powerful than unconditional
randomization tests and other conditional tests. Furthermore, we find that our
conditional randomization test is valid (1) unconditionally across levels of
covariate balance, and (2) conditional on particular levels of covariate
balance. Meanwhile, unconditional randomization tests are valid for (1) but not
(2). Finally, we find that our conditional randomization test is similar to a
randomization test that uses a model-adjusted test statistic.
| stat.ME | a benefit of randomized experiments is that covariate distributions of treatment and control groups are balanced on average resulting in simple unbiased estimators for treatment effects however it is possible that a particular randomization yields covariate imbalances that researchers want to address in the analysis stage through adjustment or other methods here we present a randomization test that conditions on covariate balance by only considering treatment assignments that are similar to the observed one in terms of covariate balance previous conditional randomization tests have only allowed for categorical covariates while our randomization test allows for any type of covariate through extensive simulation studies we find that our conditional randomization test is more powerful than unconditional randomization tests and other conditional tests furthermore we find that our conditional randomization test is valid 1 unconditionally across levels of covariate balance and 2 conditional on particular levels of covariate balance meanwhile unconditional randomization tests are valid for 1 but not 2 finally we find that our conditional randomization test is similar to a randomization test that uses a modeladjusted test statistic | [['a', 'benefit', 'of', 'randomized', 'experiments', 'is', 'that', 'covariate', 'distributions', 'of', 'treatment', 'and', 'control', 'groups', 'are', 'balanced', 'on', 'average', 'resulting', 'in', 'simple', 'unbiased', 'estimators', 'for', 'treatment', 'effects', 'however', 'it', 'is', 'possible', 'that', 'a', 'particular', 'randomization', 'yields', 'covariate', 'imbalances', 'that', 'researchers', 'want', 'to', 'address', 'in', 'the', 'analysis', 'stage', 'through', 'adjustment', 'or', 'other', 'methods', 'here', 'we', 'present', 'a', 'randomization', 'test', 'that', 'conditions', 'on', 'covariate', 'balance', 'by', 'only', 'considering', 'treatment', 'assignments', 'that', 'are', 'similar', 'to', 'the', 'observed', 'one', 'in', 'terms', 'of', 'covariate', 'balance', 'previous', 'conditional', 'randomization', 'tests', 'have', 'only', 'allowed', 'for', 'categorical', 'covariates', 'while', 'our', 'randomization', 'test', 'allows', 'for', 'any', 'type', 'of', 'covariate', 'through', 'extensive', 'simulation', 'studies', 'we', 'find', 'that', 'our', 'conditional', 'randomization', 'test', 'is', 'more', 'powerful', 'than', 'unconditional', 'randomization', 'tests', 'and', 'other', 'conditional', 'tests', 'furthermore', 'we', 'find', 'that', 'our', 'conditional', 'randomization', 'test', 'is', 'valid', '1', 'unconditionally', 'across', 'levels', 'of', 'covariate', 'balance', 'and', '2', 'conditional', 'on', 'particular', 'levels', 'of', 'covariate', 'balance', 'meanwhile', 'unconditional', 'randomization', 'tests', 'are', 'valid', 'for', '1', 'but', 'not', '2', 'finally', 'we', 'find', 'that', 'our', 'conditional', 'randomization', 'test', 'is', 'similar', 'to', 'a', 'randomization', 'test', 'that', 'uses', 'a', 'modeladjusted', 'test', 'statistic']] | [-0.04829213542582225, 0.08719791943407328, -0.14423075816094202, 0.15896281883933472, -0.09402824431989279, -0.21986337177097628, 0.14682400439297622, 0.4172035132424306, -0.16119931711904747, -0.2858010179515781, 0.08234358287224346, -0.21803044748464914, -0.1040554004550338, 0.20342839090548204, -0.10601046629707818, 0.05897096912297657, 0.09592217072781364, -0.022100483232419834, -0.041225358148271184, -0.326510821979514, 0.29979207597693985, 0.07372974379035502, 0.34680990705603343, -0.04045154371083119, 0.11841731906031906, 0.02645203384628656, -0.07316832804242096, 0.06803556635849557, -0.10421473872546129, 0.03915162072359127, 0.24847703456278827, 0.204543021420743, 0.402487394834032, -0.40276538415438373, -0.2238258611526614, 0.12937520941098532, 0.07364792951861512, 0.09430035455731181, -0.04273085869787232, -0.2098083786961049, 0.07899759174719201, -0.1515145850404676, -0.012708528284680646, -0.16737135332919614, -0.034658953093655284, 0.0116279400575322, -0.4085881420947864, 0.11830845633179665, 0.09143482568268638, 0.09809582650998218, -0.025104907021981447, -0.13598153838956212, -0.008910027469408378, 0.10539261608431905, 0.06593940164472929, -0.01376759334293715, 0.11995392646324837, -0.07469812085546848, -0.14264167532177463, 0.31066168063862176, 0.012239314429511285, -0.2674345112482012, 0.19051189892162373, -0.16768781637173083, -0.17100948239492494, 0.02005200185102679, 0.1830259796631875, 0.10588810008313865, -0.1365947132472391, -0.004390550133743255, -0.07777164507615196, 0.19161563077981, 0.04542307416897919, -0.03565129785309151, 0.08901539585411043, 0.12991946669279644, 0.1107882469311083, 0.10328013954307926, -0.09712992830854436, -0.10762497487821285, -0.3497343224468036, -0.1506639909062345, -0.1617568162188334, 0.004908305897438599, -0.1165226686790771, -0.156472610346552, 0.36737454840637174, 0.24412695575758056, 0.13710586648792197, 0.10787126763396906, 0.3295057336826109, 0.07894432940125717, 0.051649355774187604, 0.04832288446062702, 0.19193695025981566, 0.07610892556676126, -0.032067389255073867, -0.18514602324835913, 0.19203151617393865, -0.03212258891639231] |
1,802.01019 | Asymptotically Hyperbolic 3-Metric with Ricci flow foliation | In general relativity, there have been a number of successful constructions
for asymptotically flat metrics with a certain background foliation. In
particular, C. -Y. Lin used a foliation by the Ricci flow on 2-spheres to
establish an asymptotically flat extension and C. Sormani and Lin proved useful
results with this extension. In this paper, we construct asymptotically
hyperbolic 3-metrics with the Ricci flow foliation. We also study the rigid
case when the Hawking mass of the inner surface of the manifold agrees with its
total mass.
| math.DG | in general relativity there have been a number of successful constructions for asymptotically flat metrics with a certain background foliation in particular c y lin used a foliation by the ricci flow on 2spheres to establish an asymptotically flat extension and c sormani and lin proved useful results with this extension in this paper we construct asymptotically hyperbolic 3metrics with the ricci flow foliation we also study the rigid case when the hawking mass of the inner surface of the manifold agrees with its total mass | [['in', 'general', 'relativity', 'there', 'have', 'been', 'a', 'number', 'of', 'successful', 'constructions', 'for', 'asymptotically', 'flat', 'metrics', 'with', 'a', 'certain', 'background', 'foliation', 'in', 'particular', 'c', 'y', 'lin', 'used', 'a', 'foliation', 'by', 'the', 'ricci', 'flow', 'on', '2spheres', 'to', 'establish', 'an', 'asymptotically', 'flat', 'extension', 'and', 'c', 'sormani', 'and', 'lin', 'proved', 'useful', 'results', 'with', 'this', 'extension', 'in', 'this', 'paper', 'we', 'construct', 'asymptotically', 'hyperbolic', '3metrics', 'with', 'the', 'ricci', 'flow', 'foliation', 'we', 'also', 'study', 'the', 'rigid', 'case', 'when', 'the', 'hawking', 'mass', 'of', 'the', 'inner', 'surface', 'of', 'the', 'manifold', 'agrees', 'with', 'its', 'total', 'mass']] | [-0.168994034672979, 0.06930413544411516, -0.08005393586706283, 0.05636109769896626, -0.06643557983862106, -0.1875449426602139, -0.07185823622641566, 0.36311751716163787, -0.18076457612779598, -0.2428187889583019, 0.1047496319177214, -0.27023220785655255, -0.13199666374211394, 0.1761312588053041, -0.17494172298046218, 0.05096604785446056, 0.05218642409268204, 0.08882115733658158, -0.0732851278599958, -0.2585216715260474, 0.39384690135024314, 0.0574814400873905, 0.24533908009843164, 0.061382817223581465, 0.11945983078763929, -0.019113462472464458, -0.0037044707934783642, 0.07298778956972582, -0.2525215944989996, 0.09525732869325682, 0.2242294089803689, 0.07309464549071827, 0.1793864345649084, -0.3277698624662535, -0.23446154387581142, 0.14569660914022214, 0.12472772506081911, 0.06226219812429748, -0.09216978827215255, -0.26047477886069914, 0.09401280543940185, -0.14558860405109997, -0.20367750218327613, -0.04006502868575152, 0.04228628256228254, -0.05811258327746547, -0.18273614933930857, 0.02907692640715246, 0.10599157966194177, 0.04727490943704927, -0.07106159365503117, -0.05071302148416032, -0.09026649938679712, 0.028596390346349435, 0.12628789746397456, 0.0889049808814212, 0.08330431402401002, -0.02462747338604247, -0.06176943160853414, 0.31403574973431436, -0.15868072285923326, -0.3048588089850666, 0.15830158134435066, -0.13938822534996584, -0.14577928276429342, 0.07717972633233944, 0.12657125142597875, 0.2147499525670482, -0.09532131556083778, 0.20735128769559005, -0.09325156338123042, 0.08058943908098479, 0.1466516379678492, -0.045262423216034985, 0.1865905253433211, 0.10420191623162219, 0.14095972341127955, 0.11682076206658208, -0.002482972781953597, -0.06670839751009332, -0.3580908355151498, -0.20828789344793835, -0.10964401734879153, 0.13642180404560858, -0.1366755657035419, -0.1795032660336082, 0.35800888785702545, 0.002484984219420788, 0.21093495407813165, 0.1384214025510605, 0.23934618803282637, 0.027477637851789465, 0.004961330389474021, 0.21253332644051245, 0.2617384716435227, 0.2179179957358513, 0.09654402605604467, -0.15388599400906716, -0.055443500802137474, 0.12156572603339026] |
1,802.0102 | On the Exact Asymptotic of Expected Sum of Displacement of Random
Sensors for Covering a Unit Interval | In this note we essentially simplify the proof of the main result in one
paper from leading computer science conference 25th ACM Symposium on
Parallelism in Algorithms and Architectures (see [3].) We also present direct
method and give exact asymptotic result.
| cs.SY | in this note we essentially simplify the proof of the main result in one paper from leading computer science conference 25th acm symposium on parallelism in algorithms and architectures see 3 we also present direct method and give exact asymptotic result | [['in', 'this', 'note', 'we', 'essentially', 'simplify', 'the', 'proof', 'of', 'the', 'main', 'result', 'in', 'one', 'paper', 'from', 'leading', 'computer', 'science', 'conference', '25th', 'acm', 'symposium', 'on', 'parallelism', 'in', 'algorithms', 'and', 'architectures', 'see', '3', 'we', 'also', 'present', 'direct', 'method', 'and', 'give', 'exact', 'asymptotic', 'result']] | [-0.10173621460250239, -0.021187094698955373, -0.1513303715008788, 0.0031055762040678686, -0.07879703934872295, -0.08874682848137326, 0.040536302025429904, 0.31237188967444546, -0.219842593844344, -0.4075703215671749, 0.12929188328647487, -0.17923661621242035, -0.27767388842909074, 0.2397689923144332, -0.13468602672219276, 0.0024222038322832527, 0.1489940447074066, 0.005178304525410257, -0.03094602187686577, -0.3822735277254407, 0.30205687117285845, 0.06151659198377917, 0.2662890313829227, 0.14058839075449037, 0.047960744239389896, 0.043666819769253094, -0.15452075347576927, -0.0821909616224286, -0.19280251588036373, 0.17232850020206192, 0.3278407254597036, 0.17536572079605808, 0.23767378262993766, -0.44368904465582315, -0.025288053458874544, 0.036791234356691925, 0.12168395831590383, 0.1473260858300619, -0.03352848482715738, -0.23230090839561165, 0.05209515987690992, -0.2122580590317162, -0.10401045837689464, -0.01627945202607207, 0.016995399372606742, 0.009578470186125941, -0.14168076212631492, 0.05790112668963535, 0.17432076129608037, 0.14196363616189578, 0.004168985593246251, -0.15993010523024856, 0.10254863279349194, 0.06202554146236763, 0.014021447337255246, 0.06949713776206098, 0.006613525153115028, -0.06670281086003453, -0.20590318394143406, 0.36752020547211894, -0.028439988859179543, -0.08611232815196783, 0.19436102837505864, -0.10614425616293419, -0.2613728753370574, 0.03991093350256362, 0.26277883960751863, 0.11572573481485383, -0.08654118692729532, 0.17243636833083612, 0.002289474283049746, 0.16701596080348258, 0.11768059280314823, -0.004238364127714459, 0.12894266103280755, 0.14991260651385813, 0.08581527383861745, 0.12242264595030375, 0.008569018625676996, -0.09097963273979542, -0.3434794040896544, -0.20076400315014237, -0.16188162085940924, 0.026815516158665825, 0.0004599789234173552, -0.12552788540175774, 0.3578679997065082, 0.23123182937866305, 0.124676229159643, 0.07778853886738056, 0.31668468292166546, 0.061925382268183476, -0.02335529162253185, 0.1572350232248626, 0.23129173109830334, 0.13280332463271008, 0.2080038071257948, -0.09404271029549219, -0.009014931496051027, 0.1782694407852321] |
1,802.01021 | DeepType: Multilingual Entity Linking by Neural Type System Evolution | The wealth of structured (e.g. Wikidata) and unstructured data about the
world available today presents an incredible opportunity for tomorrow's
Artificial Intelligence. So far, integration of these two different modalities
is a difficult process, involving many decisions concerning how best to
represent the information so that it will be captured or useful, and
hand-labeling large amounts of data. DeepType overcomes this challenge by
explicitly integrating symbolic information into the reasoning process of a
neural network with a type system. First we construct a type system, and
second, we use it to constrain the outputs of a neural network to respect the
symbolic structure. We achieve this by reformulating the design problem into a
mixed integer problem: create a type system and subsequently train a neural
network with it. In this reformulation discrete variables select which
parent-child relations from an ontology are types within the type system, while
continuous variables control a classifier fit to the type system. The original
problem cannot be solved exactly, so we propose a 2-step algorithm: 1)
heuristic search or stochastic optimization over discrete variables that define
a type system informed by an Oracle and a Learnability heuristic, 2) gradient
descent to fit classifier parameters. We apply DeepType to the problem of
Entity Linking on three standard datasets (i.e. WikiDisamb30, CoNLL (YAGO), TAC
KBP 2010) and find that it outperforms all existing solutions by a wide margin,
including approaches that rely on a human-designed type system or recent deep
learning-based entity embeddings, while explicitly using symbolic information
lets it integrate new entities without retraining.
| cs.CL | the wealth of structured eg wikidata and unstructured data about the world available today presents an incredible opportunity for tomorrows artificial intelligence so far integration of these two different modalities is a difficult process involving many decisions concerning how best to represent the information so that it will be captured or useful and handlabeling large amounts of data deeptype overcomes this challenge by explicitly integrating symbolic information into the reasoning process of a neural network with a type system first we construct a type system and second we use it to constrain the outputs of a neural network to respect the symbolic structure we achieve this by reformulating the design problem into a mixed integer problem create a type system and subsequently train a neural network with it in this reformulation discrete variables select which parentchild relations from an ontology are types within the type system while continuous variables control a classifier fit to the type system the original problem cannot be solved exactly so we propose a 2step algorithm 1 heuristic search or stochastic optimization over discrete variables that define a type system informed by an oracle and a learnability heuristic 2 gradient descent to fit classifier parameters we apply deeptype to the problem of entity linking on three standard datasets ie wikidisamb30 conll yago tac kbp 2010 and find that it outperforms all existing solutions by a wide margin including approaches that rely on a humandesigned type system or recent deep learningbased entity embeddings while explicitly using symbolic information lets it integrate new entities without retraining | [['the', 'wealth', 'of', 'structured', 'eg', 'wikidata', 'and', 'unstructured', 'data', 'about', 'the', 'world', 'available', 'today', 'presents', 'an', 'incredible', 'opportunity', 'for', 'tomorrows', 'artificial', 'intelligence', 'so', 'far', 'integration', 'of', 'these', 'two', 'different', 'modalities', 'is', 'a', 'difficult', 'process', 'involving', 'many', 'decisions', 'concerning', 'how', 'best', 'to', 'represent', 'the', 'information', 'so', 'that', 'it', 'will', 'be', 'captured', 'or', 'useful', 'and', 'handlabeling', 'large', 'amounts', 'of', 'data', 'deeptype', 'overcomes', 'this', 'challenge', 'by', 'explicitly', 'integrating', 'symbolic', 'information', 'into', 'the', 'reasoning', 'process', 'of', 'a', 'neural', 'network', 'with', 'a', 'type', 'system', 'first', 'we', 'construct', 'a', 'type', 'system', 'and', 'second', 'we', 'use', 'it', 'to', 'constrain', 'the', 'outputs', 'of', 'a', 'neural', 'network', 'to', 'respect', 'the', 'symbolic', 'structure', 'we', 'achieve', 'this', 'by', 'reformulating', 'the', 'design', 'problem', 'into', 'a', 'mixed', 'integer', 'problem', 'create', 'a', 'type', 'system', 'and', 'subsequently', 'train', 'a', 'neural', 'network', 'with', 'it', 'in', 'this', 'reformulation', 'discrete', 'variables', 'select', 'which', 'parentchild', 'relations', 'from', 'an', 'ontology', 'are', 'types', 'within', 'the', 'type', 'system', 'while', 'continuous', 'variables', 'control', 'a', 'classifier', 'fit', 'to', 'the', 'type', 'system', 'the', 'original', 'problem', 'can', 'not', 'be', 'solved', 'exactly', 'so', 'we', 'propose', 'a', '2step', 'algorithm', '1', 'heuristic', 'search', 'or', 'stochastic', 'optimization', 'over', 'discrete', 'variables', 'that', 'define', 'a', 'type', 'system', 'informed', 'by', 'an', 'oracle', 'and', 'a', 'learnability', 'heuristic', '2', 'gradient', 'descent', 'to', 'fit', 'classifier', 'parameters', 'we', 'apply', 'deeptype', 'to', 'the', 'problem', 'of', 'entity', 'linking', 'on', 'three', 'standard', 'datasets', 'ie', 'wikidisamb30', 'conll', 'yago', 'tac', 'kbp', '2010', 'and', 'find', 'that', 'it', 'outperforms', 'all', 'existing', 'solutions', 'by', 'a', 'wide', 'margin', 'including', 'approaches', 'that', 'rely', 'on', 'a', 'humandesigned', 'type', 'system', 'or', 'recent', 'deep', 'learningbased', 'entity', 'embeddings', 'while', 'explicitly', 'using', 'symbolic', 'information', 'lets', 'it', 'integrate', 'new', 'entities', 'without', 'retraining']] | [-0.056029505083643016, -0.005114589076868015, -0.07524137726613844, 0.08961818138557476, -0.15617648935585748, -0.1950489111513889, 0.07852300375998311, 0.38500360416583135, -0.33117753090846236, -0.3434988644887653, 0.1237515497473396, -0.25600486489020113, -0.17680061818737158, 0.18450938381408832, -0.09968340571185763, 0.056065633684738714, 0.11153303751416388, 0.044267469528676884, -0.03833117168460376, -0.268456911011981, 0.33502738619063166, -0.00434863556131404, 0.2805958519675187, -0.04260693291689677, 0.1694864232558757, 0.004868574695137795, -0.026152312190788507, 0.017108041331539425, -0.06142647982471772, 0.17133404889500525, 0.28241704907759413, 0.23699251711150282, 0.32870263782479014, -0.4264015517910593, -0.21196488454052087, 0.11705682387582783, 0.1351082321128274, 0.1108229753099863, 0.0040151017738025985, -0.30589780710033665, 0.06872093197614504, -0.19203396041848464, -0.040663262303496595, -0.135579949046587, -0.00639822319499217, 0.009318068799757384, -0.2972944363730221, 0.0007370708681264659, 0.08375168926954757, 0.04237859624117846, -0.06512483494589105, -0.0940201304359789, 0.03543096121029521, 0.13537920833459793, -0.009018503615038753, 0.04810223147069337, 0.10579430865436734, -0.1306566027151348, -0.1647637449227659, 0.34771491398987564, -0.025016671563207638, -0.23293534622780498, 0.18022006610726748, -0.0027708929301297758, -0.16432567261290387, 0.10279375081063336, 0.209887005512428, 0.10922148823419775, -0.20662394106898319, 0.041020702039986645, -0.05057099577811641, 0.2258471870145513, 0.042124742946725746, -0.017254361347568192, 0.19063176372401358, 0.21957396693903775, 0.0445529840906147, 0.11678571010907035, -0.048267168629763546, -0.09549674810477882, -0.2279629944368935, -0.12731328690279042, -0.1682215695841478, 0.0275200745036841, -0.09007702545352458, -0.1538698762333297, 0.36802256157989177, 0.19513357939194975, 0.1932663466232043, 0.08147066819901738, 0.311641124381822, 0.053289803638108424, 0.0999637818138126, 0.10800675825703365, 0.16341971900828867, 0.018606927171276766, 0.1422732791065755, -0.14820667489232164, 0.07820698022760553, 0.07834208363419748] |
1,802.01022 | On direct images of twisted pluricanonical sheaves on normal varieties | We study the depth properties of certain direct image sheaves on normal
varieties. Let $f: Y\rightarrow X$ be a proper morphism of relative dimension
$d$ from a smooth variety onto a normal variety such that the preimage $E$ of
the singular locus of $X$ is a divisor. We show that for any integer $m>0$, the
higher direct image $R^df_*\omega^{\otimes m}_Y(aE)$ modulo the torsion
subsheaf is $S_2$, provided that $a$ is sufficiently large. In case $f$ is
birational, we give criteria on $a$ for the direct image $f_*\omega_Y(aE)$ to
coincide with $\omega_X$. We also introduce an index measuring the
singularities of normal varieties.
| math.AG | we study the depth properties of certain direct image sheaves on normal varieties let f yrightarrow x be a proper morphism of relative dimension d from a smooth variety onto a normal variety such that the preimage e of the singular locus of x is a divisor we show that for any integer m0 the higher direct image rdf_omegaotimes m_yae modulo the torsion subsheaf is s_2 provided that a is sufficiently large in case f is birational we give criteria on a for the direct image f_omega_yae to coincide with omega_x we also introduce an index measuring the singularities of normal varieties | [['we', 'study', 'the', 'depth', 'properties', 'of', 'certain', 'direct', 'image', 'sheaves', 'on', 'normal', 'varieties', 'let', 'f', 'yrightarrow', 'x', 'be', 'a', 'proper', 'morphism', 'of', 'relative', 'dimension', 'd', 'from', 'a', 'smooth', 'variety', 'onto', 'a', 'normal', 'variety', 'such', 'that', 'the', 'preimage', 'e', 'of', 'the', 'singular', 'locus', 'of', 'x', 'is', 'a', 'divisor', 'we', 'show', 'that', 'for', 'any', 'integer', 'm0', 'the', 'higher', 'direct', 'image', 'rdf_omegaotimes', 'm_yae', 'modulo', 'the', 'torsion', 'subsheaf', 'is', 's_2', 'provided', 'that', 'a', 'is', 'sufficiently', 'large', 'in', 'case', 'f', 'is', 'birational', 'we', 'give', 'criteria', 'on', 'a', 'for', 'the', 'direct', 'image', 'f_omega_yae', 'to', 'coincide', 'with', 'omega_x', 'we', 'also', 'introduce', 'an', 'index', 'measuring', 'the', 'singularities', 'of', 'normal', 'varieties']] | [-0.21556042115006482, 0.04715972175163739, -0.1136587095644438, 0.03898613519420979, -0.08856437692531582, -0.1555723398735728, -0.0013326673740238855, 0.3588822494928885, -0.33296321085983455, -0.14231951788745142, 0.06826016580982303, -0.2471431360551805, -0.11864147299307991, 0.23095297837874504, -0.15132470315585683, -0.03995810109519898, 0.04323774695659828, 0.090340205487052, -0.12461218445072647, -0.2673710767882923, 0.4253844239495017, -0.09308017575831125, 0.23606930596923287, 0.05608885438943451, 0.13214118823860632, -0.0031774899771794527, 0.02786576205563515, 0.007865448329466009, -0.17349641010830488, 0.100751811041111, 0.30495011821539714, 0.11749109833717647, 0.19027277486248298, -0.3303742101604138, -0.1432427023443384, 0.26055771708864756, 0.07641586849014416, -0.003295799917212189, -0.02487317952703722, -0.22804995242158196, 0.17195130087849167, -0.13867596630007029, -0.14871757941536906, -0.08422695511171237, 0.10039890695344468, 0.01272595891813663, -0.28007033172844337, -0.008486564643034298, 0.10864274919944676, 0.14418542266569354, -0.028427849994088063, -0.1114033883428107, -0.09895893880589442, 0.039646531632781555, -0.0164488574344138, 0.11775273914129068, 0.09697129210307864, -0.13948701586423798, -0.05251714016188576, 0.36658827923567533, -0.10821509796825021, -0.24528981778168618, 0.1540924852638684, -0.17994516635915697, -0.10460236967033283, 0.16004915666211433, 0.09523111770889073, 0.20060599911393542, 0.026913329055815033, 0.1800893788423502, -0.12885665481720787, 0.11366453812918578, 0.09386855287646706, -0.03575230452391987, 0.16341538134035702, 0.09559298865497112, 0.09287874812655376, 0.11119929799748904, -0.09558385541907163, 0.06628071771690039, -0.38673421714191486, -0.2280974697998979, -0.15032586833518563, 0.1975913534547682, -0.13076533676822424, -0.1654016300941808, 0.37418264615340063, 0.034260054904440736, 0.26609610271348494, 0.08430134937769235, 0.261551983494575, 0.0784753720567684, 0.015187629012558832, -0.009044427871515956, 0.11952296346237865, 0.16253047616155158, -0.07937149416580043, -0.13221599528391967, 0.008920580266288133, 0.15914518650941023] |
1,802.01023 | A symplectic Kovacic's algorithm in dimension 4 | Let $L$ be a $4$th order differential operator with coefficients in
$\mathbb{K}(z)$, with $\mathbb{K}$ a computable algebraically closed field. The
operator $L$ is called symplectic when up to rational gauge transformation, the
fundamental matrix of solutions $X$ satisfies $X^t J X=J$ where $J$ is the
standard symplectic matrix. It is called projectively symplectic when it is
projectively equivalent to a symplectic operator. We design an algorithm to
test if $L$ is projectively symplectic. Furthermore, based on Kovacic's
algorithm, we design an algorithm that computes Liouvillian solutions of
projectively symplectic operators of order $4$. Moreover, using Klein's
Theorem, algebraic solutions are given as pullbacks of standard hypergeometric
equations.
| math.DS math.SG | let l be a 4th order differential operator with coefficients in mathbbkz with mathbbk a computable algebraically closed field the operator l is called symplectic when up to rational gauge transformation the fundamental matrix of solutions x satisfies xt j xj where j is the standard symplectic matrix it is called projectively symplectic when it is projectively equivalent to a symplectic operator we design an algorithm to test if l is projectively symplectic furthermore based on kovacics algorithm we design an algorithm that computes liouvillian solutions of projectively symplectic operators of order 4 moreover using kleins theorem algebraic solutions are given as pullbacks of standard hypergeometric equations | [['let', 'l', 'be', 'a', '4th', 'order', 'differential', 'operator', 'with', 'coefficients', 'in', 'mathbbkz', 'with', 'mathbbk', 'a', 'computable', 'algebraically', 'closed', 'field', 'the', 'operator', 'l', 'is', 'called', 'symplectic', 'when', 'up', 'to', 'rational', 'gauge', 'transformation', 'the', 'fundamental', 'matrix', 'of', 'solutions', 'x', 'satisfies', 'xt', 'j', 'xj', 'where', 'j', 'is', 'the', 'standard', 'symplectic', 'matrix', 'it', 'is', 'called', 'projectively', 'symplectic', 'when', 'it', 'is', 'projectively', 'equivalent', 'to', 'a', 'symplectic', 'operator', 'we', 'design', 'an', 'algorithm', 'to', 'test', 'if', 'l', 'is', 'projectively', 'symplectic', 'furthermore', 'based', 'on', 'kovacics', 'algorithm', 'we', 'design', 'an', 'algorithm', 'that', 'computes', 'liouvillian', 'solutions', 'of', 'projectively', 'symplectic', 'operators', 'of', 'order', '4', 'moreover', 'using', 'kleins', 'theorem', 'algebraic', 'solutions', 'are', 'given', 'as', 'pullbacks', 'of', 'standard', 'hypergeometric', 'equations']] | [-0.2083143635459666, 0.05956260305812872, -0.08282751793850143, 0.050751932115812415, -0.1720290970351582, -0.2532078947494123, -0.06789324223942492, 0.34502750574303614, -0.3491458479613769, -0.17339188369641187, 0.08028640630018001, -0.2777630666244494, -0.19260217092562257, 0.17518019547273037, -0.13747172072564937, 0.052700085512731434, 0.03460192073242001, 0.11207296738822786, -0.16568873940202636, -0.29947897595494, 0.40435621232005226, -0.035677726881332555, 0.17311234117369168, -0.010975782100532978, 0.21613109116618223, -0.03566282508314921, 0.009258769434999745, -0.035228146655256594, -0.11766796923970929, 0.042672115742703375, 0.3244313767931055, 0.10271445548882321, 0.19378829042796256, -0.33973439090516205, -0.03264818048183719, 0.19506544362367043, 0.16225704583690836, -0.0347700443312104, 0.04920559218658556, -0.3007560094537319, 0.1262818360975768, -0.11274798478017438, -0.1767124628729433, -0.13772207495475294, 0.07654394370718982, 0.00972268701407988, -0.2907529252247428, -0.018935931189638346, 0.0968760319387997, 0.10147251722947606, -0.022532444842651767, -0.0875395739984804, -0.041691318084046525, -0.031993219178095285, -0.005883375433150609, 0.12350250331614658, 0.08059086009227442, 0.0022155234572600645, -0.09634659045709754, 0.3924535315237799, -0.0925507168043932, -0.3542235525641239, 0.0211149107308988, -0.08978565675118622, -0.13642529048078325, 0.15539116886848547, 0.07381101329986639, 0.15559662236252203, -0.09327627344738983, 0.2575215748950558, -0.12572632358356747, 0.11343312610318568, 0.05861754607374094, -0.04023858193606841, 0.060983458771106766, 0.0608413097512346, 0.12945901391201847, 0.0677547676671068, 0.05051671607498923, -0.09918128617353877, -0.35256806655593637, -0.22394954712340995, -0.14444431276782746, 0.19178673026002593, -0.12422128173276642, -0.18777110620472087, 0.38357908545799974, 0.04950303190282353, 0.11845077753488747, 0.13553758518208028, 0.2313655126699299, 0.15375403030050638, 0.0291740433664395, 0.12696158836753862, 0.09298823577053142, 0.26619832755400324, 0.016230992476438295, -0.1527800399564066, -0.05867407025488199, 0.26105194810321025] |
1,802.01024 | On mapping exoplanet atmospheres with high-dispersion
spectro-polarimetry. Some model predictions | Planets reflect and linearly polarize the radiation that they receive from
their host stars. The emergent polarization is sensitive to aspects of the
planet atmosphere such as the gas composition and the occurrence of condensates
and their optical properties. Extracting this information will represent a
major step in the characterization of exoplanets. The numerical simulations
presented here show that the polarization of a spatially-unresolved exoplanet
may be detected by cross-correlating high-dispersion linear polarization and
intensity (brightness) spectra of the planet-star system. The Doppler shift of
the planet-reflected starlight facilitates the separation of this signal from
the polarization introduced by the interstellar medium and the terrestrial
atmosphere. The selection of the orbital phases and wavelengths at which to
study the planet is critical. An optimal choice however will partly depend on
information about the atmosphere that is a priori unknown. We elaborate on the
cases of close-in giant exoplanets with non-uniform cloud coverage, an outcome
of recent brightness phase curve surveys from space, and for which the
hemispheres east and west of the sub-stellar point will produce different
polarizations. With integration times on the order of hours at a 10-m
telescope, the technique might distinguish amongst some proposed asymmetric
cloud scenarios with fractional polarizations of 10 parts per million for one
such planet orbiting a V-mag=5.5 host star. Future 30-40-m telescopes equipped
with high-dispersion spectro-polarimeters will be able to investigate the
linear polarization of smaller planets orbiting fainter stars and look for
molecular features in their polarization spectra.
| astro-ph.EP | planets reflect and linearly polarize the radiation that they receive from their host stars the emergent polarization is sensitive to aspects of the planet atmosphere such as the gas composition and the occurrence of condensates and their optical properties extracting this information will represent a major step in the characterization of exoplanets the numerical simulations presented here show that the polarization of a spatiallyunresolved exoplanet may be detected by crosscorrelating highdispersion linear polarization and intensity brightness spectra of the planetstar system the doppler shift of the planetreflected starlight facilitates the separation of this signal from the polarization introduced by the interstellar medium and the terrestrial atmosphere the selection of the orbital phases and wavelengths at which to study the planet is critical an optimal choice however will partly depend on information about the atmosphere that is a priori unknown we elaborate on the cases of closein giant exoplanets with nonuniform cloud coverage an outcome of recent brightness phase curve surveys from space and for which the hemispheres east and west of the substellar point will produce different polarizations with integration times on the order of hours at a 10m telescope the technique might distinguish amongst some proposed asymmetric cloud scenarios with fractional polarizations of 10 parts per million for one such planet orbiting a vmag55 host star future 3040m telescopes equipped with highdispersion spectropolarimeters will be able to investigate the linear polarization of smaller planets orbiting fainter stars and look for molecular features in their polarization spectra | [['planets', 'reflect', 'and', 'linearly', 'polarize', 'the', 'radiation', 'that', 'they', 'receive', 'from', 'their', 'host', 'stars', 'the', 'emergent', 'polarization', 'is', 'sensitive', 'to', 'aspects', 'of', 'the', 'planet', 'atmosphere', 'such', 'as', 'the', 'gas', 'composition', 'and', 'the', 'occurrence', 'of', 'condensates', 'and', 'their', 'optical', 'properties', 'extracting', 'this', 'information', 'will', 'represent', 'a', 'major', 'step', 'in', 'the', 'characterization', 'of', 'exoplanets', 'the', 'numerical', 'simulations', 'presented', 'here', 'show', 'that', 'the', 'polarization', 'of', 'a', 'spatiallyunresolved', 'exoplanet', 'may', 'be', 'detected', 'by', 'crosscorrelating', 'highdispersion', 'linear', 'polarization', 'and', 'intensity', 'brightness', 'spectra', 'of', 'the', 'planetstar', 'system', 'the', 'doppler', 'shift', 'of', 'the', 'planetreflected', 'starlight', 'facilitates', 'the', 'separation', 'of', 'this', 'signal', 'from', 'the', 'polarization', 'introduced', 'by', 'the', 'interstellar', 'medium', 'and', 'the', 'terrestrial', 'atmosphere', 'the', 'selection', 'of', 'the', 'orbital', 'phases', 'and', 'wavelengths', 'at', 'which', 'to', 'study', 'the', 'planet', 'is', 'critical', 'an', 'optimal', 'choice', 'however', 'will', 'partly', 'depend', 'on', 'information', 'about', 'the', 'atmosphere', 'that', 'is', 'a', 'priori', 'unknown', 'we', 'elaborate', 'on', 'the', 'cases', 'of', 'closein', 'giant', 'exoplanets', 'with', 'nonuniform', 'cloud', 'coverage', 'an', 'outcome', 'of', 'recent', 'brightness', 'phase', 'curve', 'surveys', 'from', 'space', 'and', 'for', 'which', 'the', 'hemispheres', 'east', 'and', 'west', 'of', 'the', 'substellar', 'point', 'will', 'produce', 'different', 'polarizations', 'with', 'integration', 'times', 'on', 'the', 'order', 'of', 'hours', 'at', 'a', '10m', 'telescope', 'the', 'technique', 'might', 'distinguish', 'amongst', 'some', 'proposed', 'asymmetric', 'cloud', 'scenarios', 'with', 'fractional', 'polarizations', 'of', '10', 'parts', 'per', 'million', 'for', 'one', 'such', 'planet', 'orbiting', 'a', 'vmag55', 'host', 'star', 'future', '3040m', 'telescopes', 'equipped', 'with', 'highdispersion', 'spectropolarimeters', 'will', 'be', 'able', 'to', 'investigate', 'the', 'linear', 'polarization', 'of', 'smaller', 'planets', 'orbiting', 'fainter', 'stars', 'and', 'look', 'for', 'molecular', 'features', 'in', 'their', 'polarization', 'spectra']] | [-0.10786427224658957, 0.15785126308788885, -0.08015910819455309, 0.04616415478121184, -0.10834618731493466, -0.07297973176197256, 0.05339469701971584, 0.3862962686594148, -0.20186881812625243, -0.33319356464127226, 0.09981801044329482, -0.3000022153461688, -0.08923366286345284, 0.19961403368697425, -0.046506844329281295, -0.003173806119164391, 0.09623450339298512, -0.05236383616260146, -0.027539496021163956, -0.2500808603515787, 0.29852950158070957, 0.10350553947119195, 0.1392313029949141, -0.0029386967519817292, 0.06928851537298618, -0.041876936728587055, -0.07572881593349863, -0.051663017374259476, -0.13162189386111706, 0.0739890780346659, 0.2500449680173617, 0.13113936311450833, 0.17700706406679675, -0.3875958319661803, -0.21756371511260933, 0.07173542838284104, 0.12452398561376346, 0.049740804793488726, -0.0309484924230778, -0.2903863189543491, 0.04617092987884134, -0.13408939446120802, -0.18301116225889838, 0.015589368936594301, 0.053038846823524256, 0.038796509975342265, -0.25071120133898295, 0.029396540463375323, 0.031531949449315304, 0.11673605442142541, -0.08667372756629999, -0.14791515578762018, -0.07681206252843858, 0.11435131214179298, 0.0092912823501898, 0.029787548844412457, 0.1627189677454852, -0.10582983660221588, -0.04957949895350659, 0.4145652003334377, -0.08944784608725878, -0.06419988075790346, 0.21686405164082764, -0.2408065396811566, -0.10698788508688878, 0.15721142617603917, 0.20674909514062045, 0.139089921762266, -0.1402369922820906, -0.02348146905008986, -0.00988902642604414, 0.19395315824479692, 0.09386829384307095, 0.10749351179187155, 0.38298467074551423, 0.11870387748082276, 0.09248488905007539, 0.09828094774418221, -0.2362156289917814, -0.03621180223865954, -0.20316161438784577, -0.1287577335520449, -0.1608563811922843, 0.041048498460679456, -0.10520697621666572, -0.11137421449005115, 0.3987204531230582, 0.15485179752157238, 0.15799722459096524, -0.002549903824654423, 0.34749192726649497, 0.07407403787069373, 0.09015005556809273, 0.053894698692363546, 0.3067579963059617, 0.13297991470059717, 0.13369376819054063, -0.2613376050807734, 0.08857121695163202, -0.031772765862473025] |
1,802.01025 | Lyapunov Design for Event-Triggered Exponential Stabilization | Control Lyapunov Functions (CLF) method gives a constructive tool for
stabilization of nonlinear systems. To find a CLF, many methods have been
proposed in the literature, e.g. backstepping for cascaded systems and sum of
squares (SOS) programming for polynomial systems. Dealing with continuous-time
systems, the CLF-based controller is also continuous-time, whereas practical
implementation on a digital platform requires sampled-time control. In this
paper, we show that if the continuous-time controller provides exponential
stabilization, then an exponentially stabilizing event-triggered control
strategy exists with the convergence rate arbitrarily close to the rate of the
continuous-time system.
| cs.SY math.OC | control lyapunov functions clf method gives a constructive tool for stabilization of nonlinear systems to find a clf many methods have been proposed in the literature eg backstepping for cascaded systems and sum of squares sos programming for polynomial systems dealing with continuoustime systems the clfbased controller is also continuoustime whereas practical implementation on a digital platform requires sampledtime control in this paper we show that if the continuoustime controller provides exponential stabilization then an exponentially stabilizing eventtriggered control strategy exists with the convergence rate arbitrarily close to the rate of the continuoustime system | [['control', 'lyapunov', 'functions', 'clf', 'method', 'gives', 'a', 'constructive', 'tool', 'for', 'stabilization', 'of', 'nonlinear', 'systems', 'to', 'find', 'a', 'clf', 'many', 'methods', 'have', 'been', 'proposed', 'in', 'the', 'literature', 'eg', 'backstepping', 'for', 'cascaded', 'systems', 'and', 'sum', 'of', 'squares', 'sos', 'programming', 'for', 'polynomial', 'systems', 'dealing', 'with', 'continuoustime', 'systems', 'the', 'clfbased', 'controller', 'is', 'also', 'continuoustime', 'whereas', 'practical', 'implementation', 'on', 'a', 'digital', 'platform', 'requires', 'sampledtime', 'control', 'in', 'this', 'paper', 'we', 'show', 'that', 'if', 'the', 'continuoustime', 'controller', 'provides', 'exponential', 'stabilization', 'then', 'an', 'exponentially', 'stabilizing', 'eventtriggered', 'control', 'strategy', 'exists', 'with', 'the', 'convergence', 'rate', 'arbitrarily', 'close', 'to', 'the', 'rate', 'of', 'the', 'continuoustime', 'system']] | [-0.17405588604429717, -0.011001839881896803, -0.11540315528550456, 0.032042348229136035, -0.052179571000799056, -0.239863090692789, 0.03847244064578967, 0.3725388440233405, -0.31640764851603775, -0.23055555021029808, 0.18328332843168849, -0.1978802697392561, -0.19798963983613316, 0.2818452717676278, -0.11589167443897716, 0.15940279237705693, 0.024895437652625703, -0.02003370475033999, -0.022712584875363817, -0.2584992434168535, 0.2570296209455738, 0.016002960105036056, 0.25915630769625464, -0.04264096105571396, 0.19117926919372172, 0.028833987253908348, 0.037404498290671134, -0.0220024218802811, -0.08865081125619052, 0.09896568752955445, 0.29109151685430157, 0.1318050850287921, 0.39976255060924637, -0.3637186164356848, -0.17530283182659137, 0.1371900588223931, 0.17578382507984913, 0.13867229474608295, -0.09589600358884381, -0.2425611151021815, 0.10800992681955297, -0.20342055042724935, -0.11407402953914096, -0.08833468280312035, 0.0070855748490430415, 0.0436855666139113, -0.3631427359356675, 0.019278567491827773, 0.06432373651493621, 0.06952859374684511, -0.0707480485315725, -0.09276851441245526, 0.009104026030869253, 0.08997239133903898, -0.03266529077213378, 0.0037886694083691286, 0.12660682793726685, -0.05213592071661986, -0.20666606240825708, 0.30861933077735604, -0.015020886043046591, -0.2373038937127398, 0.1926043532796264, -0.0661226048845277, -0.14487331299491787, 0.13733681877173723, 0.2251226931349725, 0.0983794692301965, -0.19235637918820664, 0.10184647470790271, -0.01143191132434113, 0.23775913978936852, -0.02878420855299199, 0.05684701904594418, 0.13983069007755608, 0.22918232471521904, 0.21082070433992833, 0.15622589600983486, 0.04363310006346994, -0.19252752224283834, -0.24766273802566913, -0.10817337681549372, -0.1397005949790279, -0.013654603372498225, -0.07114414732527083, -0.18456276443095937, 0.33405116064253676, 0.137130699553577, 0.09524671846039352, 0.18040307275750625, 0.34894007860347426, 0.18822706080923077, 0.01583762595089533, 0.06909702765723748, 0.22464686431621592, 0.11688562341144569, 0.12792013992645568, -0.27871651636556755, 0.1000241423826865, 0.11774615736638186] |
1,802.01026 | Free Fall in Gravitational Theory | Einstein's explanation of Mercury's perihelion motion has been verified by
astronomical observations. His formula could also be obtained in Schwarzschild
metric and was published already in 1898. Motion along a straight geodesic,
however, namely, free fall into a gravitational center with vanishing angular
momentum, is incorrectly described both by Einstein's and by Schwarzschild's
equation of motion. A physical solution for free fall may be obtained by taking
into account the dependence of mass on velocity in Newton's gravitational law
as adopted in the physics of accelerators.
| physics.gen-ph | einsteins explanation of mercurys perihelion motion has been verified by astronomical observations his formula could also be obtained in schwarzschild metric and was published already in 1898 motion along a straight geodesic however namely free fall into a gravitational center with vanishing angular momentum is incorrectly described both by einsteins and by schwarzschilds equation of motion a physical solution for free fall may be obtained by taking into account the dependence of mass on velocity in newtons gravitational law as adopted in the physics of accelerators | [['einsteins', 'explanation', 'of', 'mercurys', 'perihelion', 'motion', 'has', 'been', 'verified', 'by', 'astronomical', 'observations', 'his', 'formula', 'could', 'also', 'be', 'obtained', 'in', 'schwarzschild', 'metric', 'and', 'was', 'published', 'already', 'in', '1898', 'motion', 'along', 'a', 'straight', 'geodesic', 'however', 'namely', 'free', 'fall', 'into', 'a', 'gravitational', 'center', 'with', 'vanishing', 'angular', 'momentum', 'is', 'incorrectly', 'described', 'both', 'by', 'einsteins', 'and', 'by', 'schwarzschilds', 'equation', 'of', 'motion', 'a', 'physical', 'solution', 'for', 'free', 'fall', 'may', 'be', 'obtained', 'by', 'taking', 'into', 'account', 'the', 'dependence', 'of', 'mass', 'on', 'velocity', 'in', 'newtons', 'gravitational', 'law', 'as', 'adopted', 'in', 'the', 'physics', 'of', 'accelerators']] | [-0.11121162157884777, 0.13165142911020666, -0.15562247523908004, 0.061015442054350534, -0.1444854661822319, -0.12625999283586997, -0.04241705168211876, 0.3048603044562908, -0.1964050137957688, -0.33128154236650054, 0.07353620923145912, -0.24970403731649005, -0.029090793413478276, 0.2440996637789879, -0.09301817757185808, 0.050096954202799256, 0.058225300462190925, 0.05367825295353785, -0.027087794332548456, -0.18798582955956633, 0.26103776517367466, 0.09374633074066667, 0.19168675866324542, 0.023848172087698828, 0.15028820171692345, 0.011080280606916477, -0.042393925274873887, 0.1005986831150949, -0.12000195269992706, 0.03253705892779561, 0.1838009152128253, 0.12886865257898408, 0.2482291063467084, -0.4221638077436838, -0.2578156270996429, 0.0074702164829643656, 0.16406772055035068, 0.14285114268923915, -0.07429672541708664, -0.37030745905195905, 0.00700170889518462, -0.20145590798279575, -0.1951541522352653, -0.014634113753387747, 0.10552924898518033, 0.02312243970105598, -0.13086215766190096, 0.12061045961799696, 0.05778564762345753, 0.03192631470386025, -0.1739847441528772, -0.1208160616251705, -0.00774035470690145, 0.0789743055816913, 0.13261863804519783, 0.05242319996901896, 0.13285356337410334, -0.05983376354628871, -0.08073195330473747, 0.4765475811869946, -0.09689303905551516, -0.21532118019409652, 0.08939556379499304, -0.20596571557960192, -0.06988264156944053, 0.1416946306532292, 0.12387814615354982, 0.08187398438108069, -0.219778471696732, 0.1308875341973637, 0.010386902654846741, 0.08625263862615061, 0.16690904668770556, -0.04603324101718013, 0.32527005671778003, 0.07181041847459625, -0.01798381744125901, 0.07058072759130926, -0.08059408776137199, -0.11415080984967739, -0.30694831218462176, -0.14819100829177037, -0.18641564645804465, 0.10720577650592827, -0.09597041659283202, -0.09911276675154303, 0.31206506157163966, 0.08517637826247834, 0.16400807907501624, 0.020382267477120772, 0.2766221001700953, 0.1245763813765438, 0.09568818480989268, 0.07775651371691289, 0.37765629095740094, 0.12479649227231654, 0.13212363236193914, -0.18388830079848684, 0.056064590676362776, 0.14885525902473304] |
1,802.01027 | Stochastic dynamics of planar magnetic moments in a three-dimensional
environment | We study the stochastic dynamics of a two-dimensional magnetic moment
embedded in a three-dimensional environment, described by means of the
stochastic Landau-Lifshitz-Gilbert (sLLG) equation. We define a covariant
generalization of this equation, valid in the "generalized Stratonovich
discretization prescription". We present a path integral formulation that
allows to compute any $n-$point correlation function, independently of the
stochastic calculus used. Using this formalism, we show the equivalence between
the cartesian formulation with vectorial noise, with the polar formulation with
just one scalar fluctuation term. In particular, we show that, for isotropic
fluctuations, the system is represented by an {\em additive stochastic
process}, despite of the multiplicative terms appearing in the original
formulation of the sLLG equation, but, for anisotropic fluctuations the noise
turns out to be truly multiplicative.
| cond-mat.stat-mech | we study the stochastic dynamics of a twodimensional magnetic moment embedded in a threedimensional environment described by means of the stochastic landaulifshitzgilbert sllg equation we define a covariant generalization of this equation valid in the generalized stratonovich discretization prescription we present a path integral formulation that allows to compute any npoint correlation function independently of the stochastic calculus used using this formalism we show the equivalence between the cartesian formulation with vectorial noise with the polar formulation with just one scalar fluctuation term in particular we show that for isotropic fluctuations the system is represented by an em additive stochastic process despite of the multiplicative terms appearing in the original formulation of the sllg equation but for anisotropic fluctuations the noise turns out to be truly multiplicative | [['we', 'study', 'the', 'stochastic', 'dynamics', 'of', 'a', 'twodimensional', 'magnetic', 'moment', 'embedded', 'in', 'a', 'threedimensional', 'environment', 'described', 'by', 'means', 'of', 'the', 'stochastic', 'landaulifshitzgilbert', 'sllg', 'equation', 'we', 'define', 'a', 'covariant', 'generalization', 'of', 'this', 'equation', 'valid', 'in', 'the', 'generalized', 'stratonovich', 'discretization', 'prescription', 'we', 'present', 'a', 'path', 'integral', 'formulation', 'that', 'allows', 'to', 'compute', 'any', 'npoint', 'correlation', 'function', 'independently', 'of', 'the', 'stochastic', 'calculus', 'used', 'using', 'this', 'formalism', 'we', 'show', 'the', 'equivalence', 'between', 'the', 'cartesian', 'formulation', 'with', 'vectorial', 'noise', 'with', 'the', 'polar', 'formulation', 'with', 'just', 'one', 'scalar', 'fluctuation', 'term', 'in', 'particular', 'we', 'show', 'that', 'for', 'isotropic', 'fluctuations', 'the', 'system', 'is', 'represented', 'by', 'an', 'em', 'additive', 'stochastic', 'process', 'despite', 'of', 'the', 'multiplicative', 'terms', 'appearing', 'in', 'the', 'original', 'formulation', 'of', 'the', 'sllg', 'equation', 'but', 'for', 'anisotropic', 'fluctuations', 'the', 'noise', 'turns', 'out', 'to', 'be', 'truly', 'multiplicative']] | [-0.1461624955571913, 0.08638382875133677, -0.10423284886756867, 0.08541226163046174, -0.06866757444098709, -0.08611807448598813, -0.020459726256204725, 0.311812151722082, -0.318003628006953, -0.2523015972490855, 0.03177807535829506, -0.2304881773981876, -0.22170746146048617, 0.14332982079001275, -0.045277906746757544, 0.03169800206564191, 0.025915157099393762, 0.009357983728606753, -0.09467697514433736, -0.2030439746243454, 0.32801299176626203, 0.023331856222155938, 0.21867762186278508, -0.030631788287634455, 0.19388008505604634, 0.050798453304432625, -0.05915364555603876, 0.07749861289241065, -0.13441957487950676, 0.08954735215355489, 0.1912886780983673, 0.032037161957971225, 0.2594479670973612, -0.43921773855787094, -0.22499126758367763, 0.09784913673908927, 0.11009540450557567, 0.11280732666413615, 0.0008164009695330004, -0.27449635823997925, 0.0402890829200761, -0.16981982708519955, -0.17380425632439964, -0.10953024969487561, -0.01521178885678372, 0.022727071067435652, -0.28780401308881487, 0.11975840163439161, 0.10716149328261848, -0.009370342571096766, -0.08087589237774817, -0.08111135615333805, 0.019020485156399057, 0.039029255161047216, 0.010135763847061954, 0.049669307267007336, 0.09539223233179196, -0.11061011280087153, -0.11040447735984803, 0.3653798206181331, -0.14384868749652027, -0.3194035886764878, 0.08719598317306167, -0.13550474955957, -0.12411142037228101, 0.11198208561739115, 0.11873502501352566, 0.13570802893460265, -0.21629501721550395, 0.14578087915906796, -0.02210185739879064, 0.1386537423401367, 0.04183412976489644, 0.007209282251089576, 0.14795877266929378, 0.13172975394418315, 0.05570033087677462, 0.19650415163835525, -0.03718307507261047, -0.19846390944531583, -0.3489293417211358, -0.15880785333513447, -0.1701869126115962, 0.11057696294673813, -0.12575556307308758, -0.21474691427598788, 0.3414124720619889, 0.17229050486605232, 0.11726824378990751, 0.06758359653919231, 0.28100921312442384, 0.229721099532422, 0.014201764730043621, 0.09212679307042497, 0.18558430531260184, 0.20467692009158667, 0.1048167358990392, -0.2376719397193877, 0.025571297575521658, 0.14375911378778342] |
1,802.01028 | Structural, elastic, optoelectronic and transport properties of Sr3SnO
under pressure | We have presented the structural, elastic, optoelectronic and transport
properties of Sr3SnO under pressure by using first principles method. The
application of hydrostatic pressure causes charge transfer from Sr(5s) orbital
to Sn(5p) and O(2p) orbitals. The increasing trend of Pughs ratio under
pressure implies that the material tends to be ductile at high pressure. The
semiconductor-metal transition occurs at 14 GPa and the density of states at
the Fermi level is significantly increased at this pressure. The refractive
index, optical conductivity, and absorption of Sr3SnO have been found to be
high and comparable to that for typical materials used in photovoltaic. The
material becomes n-type from 12 GPa and Hall coefficient also confirm it. Large
Seebeck coefficient obtained at 12 GPa. Thus, Sr3SnO is a potential
thermoelectric material possessing both p- and n-type nature. The detail
physics of these changes under pressure has been explained within the available
theory.
| cond-mat.mtrl-sci | we have presented the structural elastic optoelectronic and transport properties of sr3sno under pressure by using first principles method the application of hydrostatic pressure causes charge transfer from sr5s orbital to sn5p and o2p orbitals the increasing trend of pughs ratio under pressure implies that the material tends to be ductile at high pressure the semiconductormetal transition occurs at 14 gpa and the density of states at the fermi level is significantly increased at this pressure the refractive index optical conductivity and absorption of sr3sno have been found to be high and comparable to that for typical materials used in photovoltaic the material becomes ntype from 12 gpa and hall coefficient also confirm it large seebeck coefficient obtained at 12 gpa thus sr3sno is a potential thermoelectric material possessing both p and ntype nature the detail physics of these changes under pressure has been explained within the available theory | [['we', 'have', 'presented', 'the', 'structural', 'elastic', 'optoelectronic', 'and', 'transport', 'properties', 'of', 'sr3sno', 'under', 'pressure', 'by', 'using', 'first', 'principles', 'method', 'the', 'application', 'of', 'hydrostatic', 'pressure', 'causes', 'charge', 'transfer', 'from', 'sr5s', 'orbital', 'to', 'sn5p', 'and', 'o2p', 'orbitals', 'the', 'increasing', 'trend', 'of', 'pughs', 'ratio', 'under', 'pressure', 'implies', 'that', 'the', 'material', 'tends', 'to', 'be', 'ductile', 'at', 'high', 'pressure', 'the', 'semiconductormetal', 'transition', 'occurs', 'at', '14', 'gpa', 'and', 'the', 'density', 'of', 'states', 'at', 'the', 'fermi', 'level', 'is', 'significantly', 'increased', 'at', 'this', 'pressure', 'the', 'refractive', 'index', 'optical', 'conductivity', 'and', 'absorption', 'of', 'sr3sno', 'have', 'been', 'found', 'to', 'be', 'high', 'and', 'comparable', 'to', 'that', 'for', 'typical', 'materials', 'used', 'in', 'photovoltaic', 'the', 'material', 'becomes', 'ntype', 'from', '12', 'gpa', 'and', 'hall', 'coefficient', 'also', 'confirm', 'it', 'large', 'seebeck', 'coefficient', 'obtained', 'at', '12', 'gpa', 'thus', 'sr3sno', 'is', 'a', 'potential', 'thermoelectric', 'material', 'possessing', 'both', 'p', 'and', 'ntype', 'nature', 'the', 'detail', 'physics', 'of', 'these', 'changes', 'under', 'pressure', 'has', 'been', 'explained', 'within', 'the', 'available', 'theory']] | [-0.09991715784932227, 0.17477635384163484, -0.06559851587762688, -0.04487854192511742, 0.007521992916760802, -0.13282720007471183, 0.09219007855233717, 0.4036235255094207, -0.3045146153656905, -0.32867179068476976, 0.03342678116358893, -0.32875934184915356, -0.12533718705189978, 0.184507236923693, 0.019409688232390553, 0.06252929056538459, -0.04125556568646816, -0.03139615672178009, -0.10172322805342106, -0.20127487021378007, 0.2598475633699092, 0.10209740567192131, 0.32779176856334113, 0.1309305179541848, 0.04718410830349237, -0.05568762534760496, 0.10644864168993774, 0.06750377879611083, -0.1430002760232567, 0.030462934414677553, 0.26869314490044555, -0.0834296697047444, 0.21607373148000159, -0.3944267249938582, -0.22814560747312598, -0.012963198963235938, 0.05509298860941234, 0.08819106479688567, -0.07098765323511927, -0.20461159075299898, 0.11317623140556472, -0.16700075875467235, -0.1334510793985457, -0.08333097738182159, 0.035840800816833114, -0.017058833836828085, -0.22781518844216048, 0.15958297488158474, 0.003668157155720555, 0.10401279869533721, -0.15528262029148537, -0.21687734364943745, -0.09204946239922374, 0.03582789681433719, 0.07243862439368275, 0.02485205476005169, 0.2146489699117738, -0.12479342367075587, -0.03036142792869486, 0.42870746270379645, -0.041736140389884956, -0.0411119637440662, 0.19920267455507906, -0.19853189991166195, -0.06797412268779411, 0.2336112068915347, 0.14585969926548653, 0.047431622549486, -0.11060238461371283, 0.06214590491703236, 0.04424112802846547, 0.17901403123044035, 0.09638502315275979, 0.03507992943755167, 0.21572925974488208, 0.1605845628128875, 0.01955403619426854, 0.12269675198207501, -0.11724010006473938, 0.043737867284806914, -0.20184957413446336, -0.20153972446652396, -0.18631409179834257, 0.07126007649610389, -0.09735192181663287, -0.12495121657436549, 0.348320744849336, 0.15485248258527445, 0.13772746203403893, -0.040357548566091625, 0.21660493917012474, 0.16894363344894076, 0.09792917576574144, 0.07796721962648032, 0.30733977058161127, 0.17775083206384917, 0.16660161883424537, -0.2789433342357147, 0.1294891729184306, -0.026897061620933974] |
1,802.01029 | Fairness and Accountability Design Needs for Algorithmic Support in
High-Stakes Public Sector Decision-Making | Calls for heightened consideration of fairness and accountability in
algorithmically-informed public decisions---like taxation, justice, and child
protection---are now commonplace. How might designers support such human
values? We interviewed 27 public sector machine learning practitioners across 5
OECD countries regarding challenges understanding and imbuing public values
into their work. The results suggest a disconnect between organisational and
institutional realities, constraints and needs, and those addressed by current
research into usable, transparent and 'discrimination-aware' machine
learning---absences likely to undermine practical initiatives unless addressed.
We see design opportunities in this disconnect, such as in supporting the
tracking of concept drift in secondary data sources, and in building usable
transparency tools to identify risks and incorporate domain knowledge, aimed
both at managers and at the 'street-level bureaucrats' on the frontlines of
public service. We conclude by outlining ethical challenges and future
directions for collaboration in these high-stakes applications.
| cs.CY cs.HC cs.LG | calls for heightened consideration of fairness and accountability in algorithmicallyinformed public decisionslike taxation justice and child protectionare now commonplace how might designers support such human values we interviewed 27 public sector machine learning practitioners across 5 oecd countries regarding challenges understanding and imbuing public values into their work the results suggest a disconnect between organisational and institutional realities constraints and needs and those addressed by current research into usable transparent and discriminationaware machine learningabsences likely to undermine practical initiatives unless addressed we see design opportunities in this disconnect such as in supporting the tracking of concept drift in secondary data sources and in building usable transparency tools to identify risks and incorporate domain knowledge aimed both at managers and at the streetlevel bureaucrats on the frontlines of public service we conclude by outlining ethical challenges and future directions for collaboration in these highstakes applications | [['calls', 'for', 'heightened', 'consideration', 'of', 'fairness', 'and', 'accountability', 'in', 'algorithmicallyinformed', 'public', 'decisionslike', 'taxation', 'justice', 'and', 'child', 'protectionare', 'now', 'commonplace', 'how', 'might', 'designers', 'support', 'such', 'human', 'values', 'we', 'interviewed', '27', 'public', 'sector', 'machine', 'learning', 'practitioners', 'across', '5', 'oecd', 'countries', 'regarding', 'challenges', 'understanding', 'and', 'imbuing', 'public', 'values', 'into', 'their', 'work', 'the', 'results', 'suggest', 'a', 'disconnect', 'between', 'organisational', 'and', 'institutional', 'realities', 'constraints', 'and', 'needs', 'and', 'those', 'addressed', 'by', 'current', 'research', 'into', 'usable', 'transparent', 'and', 'discriminationaware', 'machine', 'learningabsences', 'likely', 'to', 'undermine', 'practical', 'initiatives', 'unless', 'addressed', 'we', 'see', 'design', 'opportunities', 'in', 'this', 'disconnect', 'such', 'as', 'in', 'supporting', 'the', 'tracking', 'of', 'concept', 'drift', 'in', 'secondary', 'data', 'sources', 'and', 'in', 'building', 'usable', 'transparency', 'tools', 'to', 'identify', 'risks', 'and', 'incorporate', 'domain', 'knowledge', 'aimed', 'both', 'at', 'managers', 'and', 'at', 'the', 'streetlevel', 'bureaucrats', 'on', 'the', 'frontlines', 'of', 'public', 'service', 'we', 'conclude', 'by', 'outlining', 'ethical', 'challenges', 'and', 'future', 'directions', 'for', 'collaboration', 'in', 'these', 'highstakes', 'applications']] | [-0.08519165348464056, 0.07231831011038435, -0.03872143291611818, 0.10922098120225701, -0.15803070745660344, -0.17577980901789514, 0.12654681287813876, 0.4025715287670196, -0.23229666213181033, -0.36362852030973614, 0.13782347136420076, -0.30152795688005374, -0.1259797473296361, 0.21467377907475052, -0.15176683613031672, 0.03501205350651129, 0.07133072466788598, -0.04789502834614393, 0.02505428260327249, -0.28777873224538303, 0.28872158580149215, 0.056302718497623784, 0.3552276395409759, 0.15669057921816906, 0.010322558984626085, 0.0030591577979857507, -0.12152270861881097, -0.029772627521711198, -0.12077240342973644, 0.168344373581931, 0.42562961645856284, 0.274168795062418, 0.40850544513027737, -0.4464684229992006, -0.17756174195602542, 0.04634024482557847, 0.12919152198035433, 0.03346957598367463, -0.07064829281855213, -0.34804528963623865, 0.03778559574772995, -0.21610150596234892, -0.15134840403292057, -0.1014241232052513, -0.007704977212267914, -0.006883881169546774, -0.22315361509032117, -0.036355255056928465, 0.02397109572843149, 0.15201046389689588, -0.04948555849209104, -0.15785997852504227, 0.00811755499444848, 0.2242771782271186, 0.11337489173456561, -0.007941135816719801, 0.1523477059815997, -0.21178074428420243, -0.1648968473157805, 0.3875390644171748, 0.04934295990328858, -0.12025499770390814, 0.18306230795797487, -0.07828370921914399, -0.203190082643667, 0.008356088937337821, 0.2457723044115456, -0.03171946549707133, -0.20118996213220627, 0.012343317397239118, 0.07620257248028951, 0.1265320033914801, 0.06559610644699601, 0.017294011632169502, 0.28484169953246263, 0.18099142832215875, 0.05702335169484866, 0.05203834650666871, 0.013979328079216613, -0.10355541221434723, -0.23596426993068578, -0.13681462784702686, -0.06803329018842214, 0.017476478095530816, -0.03976646103051346, -0.05065471776617705, 0.34167666226773913, 0.22837188562540256, 0.08957592499158952, 0.005729801866581893, 0.3274363966901665, -0.041805601827260376, 0.11341942072866242, 0.11958643137578569, 0.19185377248778832, -0.03938363050532433, 0.19475185696670003, -0.11482890958027185, 0.12758863117019442, -0.1101589447994163] |
1,802.0103 | JobPruner: A Machine Learning Assistant for Exploring Parameter Spaces
in HPC Applications | High Performance Computing (HPC) applications are essential for scientists
and engineers to create and understand models and their properties. These
professionals depend on the execution of large sets of computational jobs that
explore combinations of parameter values. Avoiding the execution of unnecessary
jobs brings not only speed to these experiments, but also reductions in
infrastructure usage---particularly important due to the shift of these
applications to HPC cloud platforms. Our hypothesis is that data generated by
these experiments can help users in identifying such jobs. To address this
hypothesis we need to understand the similarity levels among multiple
experiments necessary for job elimination decisions and the steps required to
automate this process. In this paper we present a study and a machine
learning-based tool called JobPruner to support parameter exploration in HPC
experiments. The tool was evaluated with three real-world use cases from
different domains including seismic analysis and agronomy. We observed the tool
reduced 93% of jobs in a single experiment, while improving quality in most
scenarios. In addition, reduction in job executions was possible even
considering past experiments with low correlations.
| cs.DC | high performance computing hpc applications are essential for scientists and engineers to create and understand models and their properties these professionals depend on the execution of large sets of computational jobs that explore combinations of parameter values avoiding the execution of unnecessary jobs brings not only speed to these experiments but also reductions in infrastructure usageparticularly important due to the shift of these applications to hpc cloud platforms our hypothesis is that data generated by these experiments can help users in identifying such jobs to address this hypothesis we need to understand the similarity levels among multiple experiments necessary for job elimination decisions and the steps required to automate this process in this paper we present a study and a machine learningbased tool called jobpruner to support parameter exploration in hpc experiments the tool was evaluated with three realworld use cases from different domains including seismic analysis and agronomy we observed the tool reduced 93 of jobs in a single experiment while improving quality in most scenarios in addition reduction in job executions was possible even considering past experiments with low correlations | [['high', 'performance', 'computing', 'hpc', 'applications', 'are', 'essential', 'for', 'scientists', 'and', 'engineers', 'to', 'create', 'and', 'understand', 'models', 'and', 'their', 'properties', 'these', 'professionals', 'depend', 'on', 'the', 'execution', 'of', 'large', 'sets', 'of', 'computational', 'jobs', 'that', 'explore', 'combinations', 'of', 'parameter', 'values', 'avoiding', 'the', 'execution', 'of', 'unnecessary', 'jobs', 'brings', 'not', 'only', 'speed', 'to', 'these', 'experiments', 'but', 'also', 'reductions', 'in', 'infrastructure', 'usageparticularly', 'important', 'due', 'to', 'the', 'shift', 'of', 'these', 'applications', 'to', 'hpc', 'cloud', 'platforms', 'our', 'hypothesis', 'is', 'that', 'data', 'generated', 'by', 'these', 'experiments', 'can', 'help', 'users', 'in', 'identifying', 'such', 'jobs', 'to', 'address', 'this', 'hypothesis', 'we', 'need', 'to', 'understand', 'the', 'similarity', 'levels', 'among', 'multiple', 'experiments', 'necessary', 'for', 'job', 'elimination', 'decisions', 'and', 'the', 'steps', 'required', 'to', 'automate', 'this', 'process', 'in', 'this', 'paper', 'we', 'present', 'a', 'study', 'and', 'a', 'machine', 'learningbased', 'tool', 'called', 'jobpruner', 'to', 'support', 'parameter', 'exploration', 'in', 'hpc', 'experiments', 'the', 'tool', 'was', 'evaluated', 'with', 'three', 'realworld', 'use', 'cases', 'from', 'different', 'domains', 'including', 'seismic', 'analysis', 'and', 'agronomy', 'we', 'observed', 'the', 'tool', 'reduced', '93', 'of', 'jobs', 'in', 'a', 'single', 'experiment', 'while', 'improving', 'quality', 'in', 'most', 'scenarios', 'in', 'addition', 'reduction', 'in', 'job', 'executions', 'was', 'possible', 'even', 'considering', 'past', 'experiments', 'with', 'low', 'correlations']] | [-0.11082636505339502, 0.06693202662540393, -0.06359896635533208, 0.06434181817107351, -0.11006390491836808, -0.13135193837030482, 0.10550165448092028, 0.40759414396145277, -0.24071873490659831, -0.39650960783732847, 0.11032595471931725, -0.2634180780344953, -0.11806955183274112, 0.2244733554078266, -0.08811233462765813, 0.12001672463706604, 0.14014732122628226, -0.010823096231453949, -0.019610455270352153, -0.32065422689904355, 0.2710096894297749, 0.08956799623039034, 0.32669314961983925, 0.08442518712642293, 0.032119226291090146, -0.027208627863890594, -0.06762127508409321, -0.010899380742850755, -0.089343654116399, 0.13348264205786917, 0.3661873786512337, 0.21823204618930403, 0.3248261629008792, -0.46888217095078694, -0.16469452502529344, 0.13753149615626575, 0.12554835436296546, 0.05203630835619859, -0.026940847226392686, -0.2626212662137631, 0.11124960047115261, -0.1572544747756587, -0.0871826959385847, -0.14884910224936904, 0.008976728952903714, 0.012846585586602385, -0.2609592004187612, -0.010097689890567887, 0.01940081147606381, 0.08005752892543873, -0.04891220946382317, -0.08734742714118006, 0.0644228602048113, 0.17683045274784995, 0.0838330495893994, -0.0036324240383692084, 0.13891211002030307, -0.1604896413640947, -0.1674380104911203, 0.41974125881161956, 0.01375728676147345, -0.1669838561309411, 0.24855003925751792, -0.08159511992772524, -0.19278996446583835, 0.0576121882820088, 0.2452542217551834, 0.06360575486905873, -0.16518382521527303, 0.03437519537288204, 0.050301043588357665, 0.15994577104380975, 0.07877569937586991, 0.002897083369316533, 0.1774704936180367, 0.2050939198040093, 0.02918340821698722, 0.1282361067728036, -0.04973884684732184, -0.0913683534810035, -0.22386595529484718, -0.17324191253347737, -0.14792466166222262, -0.02393474381266666, -0.06910844092053595, -0.1308100383211341, 0.3760811580914176, 0.23484479780826303, 0.16810915194930406, 0.03442128053995677, 0.3299584558104268, 0.04592485372559167, 0.1305995296855043, 0.11303807486935208, 0.14856382586682837, -0.0017884444354826377, 0.13876583009001076, -0.2019471761654131, 0.10538777113736918, -0.04710896090707845] |
1,802.01031 | Magnetic field topology of the cool, active, short-period binary system
$\sigma^2$ Coronae Borealis | The goal of this work is to study the cool, active binary star $\sigma^2$
CrB, focussing on its magnetic field. We used Stokes $IV$ data from the twin
spectropolarimeters Narval at the TBL and ESPaDOnS at the CFHT. The
least-squares deconvolution multi-line technique was used to increase the
signal-to-noise ratio of the data. We then applied a new binary Zeeman-Doppler
imaging code to reconstruct simultaneously the magnetic topology and brightness
distribution of both components. This analysis was carried out for two
observational epochs in 2014 and 2017. A previously unconfirmed magnetic field
of the primary star has been securely detected. The polarisation signatures of
the secondary appear to have a systematically larger amplitude than that of the
primary. This corresponds to a stronger magnetic field, for which the magnetic
energy of the secondary exceeds that of the primary by a factor of 3.3-5.7.
While the magnetic energy is similar for the secondary star in the two epochs,
the magnetic energy is about twice as high in 2017 for the primary. The
magnetic field topology of the two stars in the earlier epoch (2014) is very
different. In the earlier epoch, the magnetic field at the visible pole appears
to be of opposite polarity for the primary and secondary, suggesting linked
magnetospheres. The apparent rotational periods of both $\sigma^2$ CrB
components are longer than the orbital period, which we interpret as an
evidence of a solar-like differential rotation. Despite their nearly identical
fundamental parameters, the components of $\sigma^2$ CrB system exhibit
different magnetic field properties. This indicates that the magnetic dynamo
process is a very sensitive function of stellar parameters.
| astro-ph.SR | the goal of this work is to study the cool active binary star sigma2 crb focussing on its magnetic field we used stokes iv data from the twin spectropolarimeters narval at the tbl and espadons at the cfht the leastsquares deconvolution multiline technique was used to increase the signaltonoise ratio of the data we then applied a new binary zeemandoppler imaging code to reconstruct simultaneously the magnetic topology and brightness distribution of both components this analysis was carried out for two observational epochs in 2014 and 2017 a previously unconfirmed magnetic field of the primary star has been securely detected the polarisation signatures of the secondary appear to have a systematically larger amplitude than that of the primary this corresponds to a stronger magnetic field for which the magnetic energy of the secondary exceeds that of the primary by a factor of 3357 while the magnetic energy is similar for the secondary star in the two epochs the magnetic energy is about twice as high in 2017 for the primary the magnetic field topology of the two stars in the earlier epoch 2014 is very different in the earlier epoch the magnetic field at the visible pole appears to be of opposite polarity for the primary and secondary suggesting linked magnetospheres the apparent rotational periods of both sigma2 crb components are longer than the orbital period which we interpret as an evidence of a solarlike differential rotation despite their nearly identical fundamental parameters the components of sigma2 crb system exhibit different magnetic field properties this indicates that the magnetic dynamo process is a very sensitive function of stellar parameters | [['the', 'goal', 'of', 'this', 'work', 'is', 'to', 'study', 'the', 'cool', 'active', 'binary', 'star', 'sigma2', 'crb', 'focussing', 'on', 'its', 'magnetic', 'field', 'we', 'used', 'stokes', 'iv', 'data', 'from', 'the', 'twin', 'spectropolarimeters', 'narval', 'at', 'the', 'tbl', 'and', 'espadons', 'at', 'the', 'cfht', 'the', 'leastsquares', 'deconvolution', 'multiline', 'technique', 'was', 'used', 'to', 'increase', 'the', 'signaltonoise', 'ratio', 'of', 'the', 'data', 'we', 'then', 'applied', 'a', 'new', 'binary', 'zeemandoppler', 'imaging', 'code', 'to', 'reconstruct', 'simultaneously', 'the', 'magnetic', 'topology', 'and', 'brightness', 'distribution', 'of', 'both', 'components', 'this', 'analysis', 'was', 'carried', 'out', 'for', 'two', 'observational', 'epochs', 'in', '2014', 'and', '2017', 'a', 'previously', 'unconfirmed', 'magnetic', 'field', 'of', 'the', 'primary', 'star', 'has', 'been', 'securely', 'detected', 'the', 'polarisation', 'signatures', 'of', 'the', 'secondary', 'appear', 'to', 'have', 'a', 'systematically', 'larger', 'amplitude', 'than', 'that', 'of', 'the', 'primary', 'this', 'corresponds', 'to', 'a', 'stronger', 'magnetic', 'field', 'for', 'which', 'the', 'magnetic', 'energy', 'of', 'the', 'secondary', 'exceeds', 'that', 'of', 'the', 'primary', 'by', 'a', 'factor', 'of', '3357', 'while', 'the', 'magnetic', 'energy', 'is', 'similar', 'for', 'the', 'secondary', 'star', 'in', 'the', 'two', 'epochs', 'the', 'magnetic', 'energy', 'is', 'about', 'twice', 'as', 'high', 'in', '2017', 'for', 'the', 'primary', 'the', 'magnetic', 'field', 'topology', 'of', 'the', 'two', 'stars', 'in', 'the', 'earlier', 'epoch', '2014', 'is', 'very', 'different', 'in', 'the', 'earlier', 'epoch', 'the', 'magnetic', 'field', 'at', 'the', 'visible', 'pole', 'appears', 'to', 'be', 'of', 'opposite', 'polarity', 'for', 'the', 'primary', 'and', 'secondary', 'suggesting', 'linked', 'magnetospheres', 'the', 'apparent', 'rotational', 'periods', 'of', 'both', 'sigma2', 'crb', 'components', 'are', 'longer', 'than', 'the', 'orbital', 'period', 'which', 'we', 'interpret', 'as', 'an', 'evidence', 'of', 'a', 'solarlike', 'differential', 'rotation', 'despite', 'their', 'nearly', 'identical', 'fundamental', 'parameters', 'the', 'components', 'of', 'sigma2', 'crb', 'system', 'exhibit', 'different', 'magnetic', 'field', 'properties', 'this', 'indicates', 'that', 'the', 'magnetic', 'dynamo', 'process', 'is', 'a', 'very', 'sensitive', 'function', 'of', 'stellar', 'parameters']] | [-0.14635646367466362, 0.14231458937514055, -0.07944263755361165, 0.07471368308974433, -0.08256716851048089, -0.08014424489707198, 0.00999367573007692, 0.3674607753864451, -0.21826923457770625, -0.36483698151659455, 0.0847848531868842, -0.24324263996744552, -0.07136645790649973, 0.20471483026631176, -0.025802309050131242, -0.011877202976981463, 0.056551844227823625, 0.0570729994691119, -0.030161504793849853, -0.23787978143330843, 0.30012246052177144, 0.1109995068887034, 0.22243273757042392, -0.023607787279737592, 0.04760781849464436, -0.04790878899613582, -0.05081791646718428, 0.003533833345128258, -0.11389430946205568, 0.03476901838147396, 0.19433195718224802, 0.09855466629863201, 0.19972479098292975, -0.3772488892663506, -0.19364150468535724, 0.053826151744611424, 0.1412698741578999, 0.06585751723698911, -0.022887959542293033, -0.23175563026681806, 0.09222110043553337, -0.11783925376029263, -0.13542855821279842, 0.019550259271972, 0.03978232391348254, 0.02644415855090494, -0.2860395630447672, 0.083023835873304, 0.05317873660938946, 0.1362964769022117, -0.12697206203588612, -0.13516281407844052, -0.06507901537412134, 0.11826254335945285, 0.08676293426092462, 0.10819115807807772, 0.09878864232970049, -0.1287957636204974, -0.05381777963331004, 0.3207013200913109, -0.0881858226958079, -0.051789827268314464, 0.19751962944674809, -0.21826933760742992, -0.1642443807761022, 0.17269727632708046, 0.16800043353253497, 0.13920979720339538, -0.1566387088683721, 0.024878937738071642, -0.002099560317496828, 0.1817066892929597, 0.0634833325140289, 0.017142109139251165, 0.30213681342717275, 0.11795013384732546, 0.02956428070831027, 0.12176992456371581, -0.23718819572230226, -0.027106951053174677, -0.21563775322943593, -0.1348230336002095, -0.16757455097574595, 0.02854805005208821, -0.08907533573920641, -0.12013341075321833, 0.4288674850338381, 0.12885302222822015, 0.18493070238047854, -0.02843237862849546, 0.324955265853921, 0.12297950741284454, 0.08658418039165716, 0.08815801467813143, 0.332133100378469, 0.2121740561567219, 0.16203707424174218, -0.26669336974163815, 0.04839114460823227, -0.007765778522595736] |
1,802.01032 | On Markovian random networks | We investigate random Eulerian networks defined by Markov loops and the
associated fields, flows and maps.
| math.PR | we investigate random eulerian networks defined by markov loops and the associated fields flows and maps | [['we', 'investigate', 'random', 'eulerian', 'networks', 'defined', 'by', 'markov', 'loops', 'and', 'the', 'associated', 'fields', 'flows', 'and', 'maps']] | [-0.25492291431874037, 0.24666253343457356, 0.05382661195471883, 0.16185129201039672, 0.008047681069001555, -0.06295898446114734, -0.007466040784493089, 0.457519244402647, -0.31751625519245863, -0.1823515968862921, 0.14628469679155387, -0.19956125726457685, -0.24200112489052117, 0.11355246929451823, -0.014023103634826839, 0.092720344546251, 0.04837805940769613, -0.03547578220604919, -0.003103462455328554, -0.17166216465557227, 0.4011602820828557, 0.03588290937477723, 0.2550253761000931, -0.05504588200710714, 0.23436595872044563, -0.00805324429529719, -0.19093241437803954, 0.16966525290627033, -0.184325689682737, 0.1097550336853601, 0.12755697790998966, 0.08755024243146181, 0.19154987018555403, -0.4648190038278699, -0.3209845455130562, 0.1663341165985912, 0.11717063246760517, 0.04267502890434116, 0.060070190695114434, -0.31784078193595633, 0.08966432663146406, -0.11383688217028975, -0.04610229181707837, -0.10573775396915153, -0.0854937847761903, 0.1717481091618538, -0.2692451426992193, -0.002239455236122012, 0.07188601597590605, 0.15057339397026226, 0.03936072578653693, -0.024160623812349513, -0.08252493583131582, 0.16334753846490457, -0.021992460649926215, 0.05487972134142183, 0.136813491495559, -0.18743085768073797, -0.2549938563024625, 0.3488124832510948, -0.10007900139316916, -0.21037357370369136, 0.2032110821455717, -0.08617605399922468, -0.16700379917165264, 0.09521733625661, 0.24334099830593914, 0.13823277142364532, -0.14874213718576357, 0.11411859327199636, -0.05339689366519451, 0.006347975926473737, 0.07974186644423753, -0.09337374265305698, 0.1922151166945696, -0.02374116308055818, 0.07868637837236747, 0.23283101469860412, -0.033816787941759685, -0.17185848936787806, -0.24060467025265098, -0.10707786149578169, -0.1381844466086477, 0.04764511593384668, -0.14429458879567392, -0.22041196352802217, 0.3938167037558742, 0.1425549117848277, 0.23010215535759926, 0.13910618075169623, 0.19750176253728569, 0.1367969749844633, 0.051489176345057786, 0.19177512524765916, 0.030772767029702663, 0.3633127461798722, 0.13841258408501744, -0.12099968665279448, 0.03693301323801279, 0.19026650045998394] |
1,802.01033 | Reducing the variance in the translocation times by pre-stretching the
polymer | Langevin Dynamics simulations of polymer translocation are performed where
the polymer is stretched via two opposing forces applied on the first and last
monomer before and during translocation. In this setup, polymer translocation
is achieved by imposing a bias between the two pulling forces such that there
is net displacement towards the \textit{trans}-side. Under the influence of
pre-stretching forces, the elongated polymer ensemble contains less variations
in conformations compared to an unstretched ensemble. Simulations demonstrate
that this reduced spread in initial conformations yields a reduced variation in
translocations times relative to the mean translocation time. This effect is
explored for different ratios of the amplitude of thermal fluctuations to
driving forces to control for the relative influence of the thermal path
sampled by the polymer. Since the variance in translocation times is due to
contributions coming from sampling both thermal noise and initial
conformations, our simulations offer independent control over the two main
sources of noise, and allow us to shed light on how they both contribute to
translocation dynamics. Experimentally relevant conditions are highlighted and
shown to correspond to a significant decrease in the spread of translocation
times, thus indicating that stretching DNA prior to translocation could assist
in nanopore-based sequencing and sizing applications.
| cond-mat.soft | langevin dynamics simulations of polymer translocation are performed where the polymer is stretched via two opposing forces applied on the first and last monomer before and during translocation in this setup polymer translocation is achieved by imposing a bias between the two pulling forces such that there is net displacement towards the textittransside under the influence of prestretching forces the elongated polymer ensemble contains less variations in conformations compared to an unstretched ensemble simulations demonstrate that this reduced spread in initial conformations yields a reduced variation in translocations times relative to the mean translocation time this effect is explored for different ratios of the amplitude of thermal fluctuations to driving forces to control for the relative influence of the thermal path sampled by the polymer since the variance in translocation times is due to contributions coming from sampling both thermal noise and initial conformations our simulations offer independent control over the two main sources of noise and allow us to shed light on how they both contribute to translocation dynamics experimentally relevant conditions are highlighted and shown to correspond to a significant decrease in the spread of translocation times thus indicating that stretching dna prior to translocation could assist in nanoporebased sequencing and sizing applications | [['langevin', 'dynamics', 'simulations', 'of', 'polymer', 'translocation', 'are', 'performed', 'where', 'the', 'polymer', 'is', 'stretched', 'via', 'two', 'opposing', 'forces', 'applied', 'on', 'the', 'first', 'and', 'last', 'monomer', 'before', 'and', 'during', 'translocation', 'in', 'this', 'setup', 'polymer', 'translocation', 'is', 'achieved', 'by', 'imposing', 'a', 'bias', 'between', 'the', 'two', 'pulling', 'forces', 'such', 'that', 'there', 'is', 'net', 'displacement', 'towards', 'the', 'textittransside', 'under', 'the', 'influence', 'of', 'prestretching', 'forces', 'the', 'elongated', 'polymer', 'ensemble', 'contains', 'less', 'variations', 'in', 'conformations', 'compared', 'to', 'an', 'unstretched', 'ensemble', 'simulations', 'demonstrate', 'that', 'this', 'reduced', 'spread', 'in', 'initial', 'conformations', 'yields', 'a', 'reduced', 'variation', 'in', 'translocations', 'times', 'relative', 'to', 'the', 'mean', 'translocation', 'time', 'this', 'effect', 'is', 'explored', 'for', 'different', 'ratios', 'of', 'the', 'amplitude', 'of', 'thermal', 'fluctuations', 'to', 'driving', 'forces', 'to', 'control', 'for', 'the', 'relative', 'influence', 'of', 'the', 'thermal', 'path', 'sampled', 'by', 'the', 'polymer', 'since', 'the', 'variance', 'in', 'translocation', 'times', 'is', 'due', 'to', 'contributions', 'coming', 'from', 'sampling', 'both', 'thermal', 'noise', 'and', 'initial', 'conformations', 'our', 'simulations', 'offer', 'independent', 'control', 'over', 'the', 'two', 'main', 'sources', 'of', 'noise', 'and', 'allow', 'us', 'to', 'shed', 'light', 'on', 'how', 'they', 'both', 'contribute', 'to', 'translocation', 'dynamics', 'experimentally', 'relevant', 'conditions', 'are', 'highlighted', 'and', 'shown', 'to', 'correspond', 'to', 'a', 'significant', 'decrease', 'in', 'the', 'spread', 'of', 'translocation', 'times', 'thus', 'indicating', 'that', 'stretching', 'dna', 'prior', 'to', 'translocation', 'could', 'assist', 'in', 'nanoporebased', 'sequencing', 'and', 'sizing', 'applications']] | [-0.11891504119358062, 0.19394732154051228, -0.11259196687480617, 0.014197345516032666, 0.02630202588054589, -0.1326939626984919, 0.018359726718307344, 0.44473937769219574, -0.28718081196112666, -0.278070803551921, 0.038404725977635085, -0.22587783138870315, -0.11122841676057992, 0.191867287631384, -0.051428763973945024, 0.022864158112354867, 0.10069739691600404, -0.02931999028877209, 0.0066073882729089, -0.20561961676724547, 0.18725345066323987, 0.0909828301153931, 0.283669508701446, 0.07127142719742979, 0.09841311156838749, -0.01121215148847185, -0.004606792889307162, 0.04557614605622731, -0.1843956115549101, 0.08820912706227425, 0.17734879743554355, 0.01424984650953311, 0.2637129147336179, -0.4871236633637226, -0.2167835244269786, 0.12175179977088656, 0.18962931741878172, 0.1414685625144664, -0.01010538613213701, -0.2361687813319412, 0.0484829544416154, -0.1088505115864488, -0.07513546934876335, -0.03662545995372485, 0.07155336887922649, 0.09025033022158359, -0.25589229586287676, 0.13077726244113827, -0.006927725976186362, 0.04179032551416872, -0.03537832733983284, -0.11415391668047317, -0.020637498060286995, 0.17534592870152646, 0.130165878275875, 0.020993780312196845, 0.2903649491057092, -0.1264039891880113, -0.07802506224891427, 0.35575484473020863, -0.04033784280809592, -0.22169269142471545, 0.17421160334967734, -0.12373188066332802, -0.12110003723729261, 0.21244476937378445, 0.14023795837591238, 0.056024068512402554, -0.17138452974933327, -0.015999796302126282, 0.07690813851442334, 0.1892843415068152, 0.122572286225691, -0.017484142287524745, 0.19977986924773267, 0.20071014359264688, 0.06480516337529373, 0.16845396127752668, -0.10610861546022124, -0.17348768706912832, -0.24249057173181107, -0.12385048723880056, -0.16718199674049208, 0.08272277533222794, -0.09576901856894883, -0.14088453900188266, 0.37077451160396724, 0.1787861006644865, 0.18578269365517533, 0.07612068660091609, 0.24544931025593542, 0.03893313972637806, 0.06240432940117613, 0.006950699267726319, 0.23258717639620563, 0.12653600093200987, 0.10681458009354423, -0.30170183530985833, 0.10117357212127935, -0.017712290293203814] |
1,802.01034 | Multi-task Learning for Continuous Control | Reliable and effective multi-task learning is a prerequisite for the
development of robotic agents that can quickly learn to accomplish related,
everyday tasks. However, in the reinforcement learning domain, multi-task
learning has not exhibited the same level of success as in other domains, such
as computer vision. In addition, most reinforcement learning research on
multi-task learning has been focused on discrete action spaces, which are not
used for robotic control in the real-world. In this work, we apply multi-task
learning methods to continuous action spaces and benchmark their performance on
a series of simulated continuous control tasks. Most notably, we show that
multi-task learning outperforms our baselines and alternative knowledge sharing
methods.
| cs.LG stat.ML | reliable and effective multitask learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related everyday tasks however in the reinforcement learning domain multitask learning has not exhibited the same level of success as in other domains such as computer vision in addition most reinforcement learning research on multitask learning has been focused on discrete action spaces which are not used for robotic control in the realworld in this work we apply multitask learning methods to continuous action spaces and benchmark their performance on a series of simulated continuous control tasks most notably we show that multitask learning outperforms our baselines and alternative knowledge sharing methods | [['reliable', 'and', 'effective', 'multitask', 'learning', 'is', 'a', 'prerequisite', 'for', 'the', 'development', 'of', 'robotic', 'agents', 'that', 'can', 'quickly', 'learn', 'to', 'accomplish', 'related', 'everyday', 'tasks', 'however', 'in', 'the', 'reinforcement', 'learning', 'domain', 'multitask', 'learning', 'has', 'not', 'exhibited', 'the', 'same', 'level', 'of', 'success', 'as', 'in', 'other', 'domains', 'such', 'as', 'computer', 'vision', 'in', 'addition', 'most', 'reinforcement', 'learning', 'research', 'on', 'multitask', 'learning', 'has', 'been', 'focused', 'on', 'discrete', 'action', 'spaces', 'which', 'are', 'not', 'used', 'for', 'robotic', 'control', 'in', 'the', 'realworld', 'in', 'this', 'work', 'we', 'apply', 'multitask', 'learning', 'methods', 'to', 'continuous', 'action', 'spaces', 'and', 'benchmark', 'their', 'performance', 'on', 'a', 'series', 'of', 'simulated', 'continuous', 'control', 'tasks', 'most', 'notably', 'we', 'show', 'that', 'multitask', 'learning', 'outperforms', 'our', 'baselines', 'and', 'alternative', 'knowledge', 'sharing', 'methods']] | [0.004740059055620804, -0.007572526902159942, -0.0838426642273719, 0.04215849783005459, -0.17559678247198462, -0.1936001334356011, -0.028985475206614604, 0.5391276805728141, -0.2527734083269024, -0.3183864661966384, 0.07603503118714018, -0.22231689466363086, -0.2309657226183585, 0.2724906376887312, -0.2040546550540187, 0.12483533710682033, 0.11764591200127532, 0.10247394680378161, -0.08002840074810333, -0.31212164213814375, 0.3068826773690359, -0.034072093844380494, 0.3672231948003173, 0.033075174516333, 0.1429106238605787, 0.0016026894778146275, 0.012566160509387763, -0.04007748785495226, -0.0278235701455612, 0.20387193140673585, 0.46076705024045495, 0.22493235969990824, 0.42447025556716006, -0.37995963930318666, -0.2819174946531088, 0.1318152690572398, 0.1582688963182071, 0.05489349871952852, -0.05269834242062643, -0.34005634258833844, 0.029852661478798836, -0.1716896842699498, 0.04589537892024964, -0.1957742334717685, -0.03298385383095592, -0.030002087742364632, -0.2965739341535872, -0.02892695993614325, 0.08638485291573618, 0.1095141125344006, -0.08337869772887123, -0.11459824790446353, 0.0824394103526304, 0.20148270660346107, 0.05688033723708941, 0.06247469906442608, 0.20556115793546528, -0.22028800434990053, -0.2360838138016074, 0.3698177739445652, -0.04604788240145093, -0.19468256401679745, 0.2775717131860022, 0.0018234079283761925, -0.23357058086548932, 0.02743829732519641, 0.29478758330723004, 0.17374958826362022, -0.1531206278803958, 0.04906814516133246, -0.04260779153056709, 0.14403141617991164, 0.03212435306133037, -0.03204489412019029, 0.12743551606919418, 0.31544986728944685, 0.07668502706967827, 0.08345347790964297, -0.06543917994609469, -0.14394573116338247, -0.17430904820295318, -0.09941072962828912, -0.22167723511561885, -0.03240828658012366, -0.07191955554260078, -0.10310402196319046, 0.35228929934757097, 0.22321668379923462, 0.1669423638761925, 0.11076567258091277, 0.3403455892943644, 0.009030704946781043, 0.13642458315631042, 0.10511094104315687, 0.20875294238378825, -0.015977242433499277, 0.15063882755098998, -0.20560760237692324, 0.09971060615082804, 0.006816687602882406] |
1,802.01035 | Spin Hall effect in Rashba-Dresselhaus planar strips in the presence of
electron correlations | A model with both Rashba and Dresselhaus spin orbit (SO) couplings and
Hubbard electron-electron interaction is studied on planar strips at quarter
filling at zero temperature in the clean limit. In the absence of Hubbard
repulsion and at equilibrium, within linear response theory, a nonmonotonic
behavior of the spin Hall conductivity as a function of the ratio of the Rashba
(alpha) and Dresselhaus (beta) strengths was found for large enough SO
strengths. This behavior is signalled by a peak or a cusp, depending on the
strip width, at intermediate values of beta/alpha in the interval [0,1]. This
behavior of the spin Hall conductivity was correlated with the one for the
longitudinal spin conductivity. This study was then extended to the
out-of-equilibrium regime that arises by imposing a finite voltage bias between
the two ends of an open strip. This system, in the presence of a Hubbard term
with coupling U, was treated with the density matrix renormalization group
technique and with the Landauer-Buttiker formalism. It was found that relevant
properties to the spin Hall effect, such as the transversal spin current and
the spin accumulation, present a similar nonmonotonic behavior as the one found
for the spin conductivities. More importantly, it was also found that these
properties are enhanced by the repulsive Hubbard interaction up to a moderate
value of U.
| cond-mat.str-el | a model with both rashba and dresselhaus spin orbit so couplings and hubbard electronelectron interaction is studied on planar strips at quarter filling at zero temperature in the clean limit in the absence of hubbard repulsion and at equilibrium within linear response theory a nonmonotonic behavior of the spin hall conductivity as a function of the ratio of the rashba alpha and dresselhaus beta strengths was found for large enough so strengths this behavior is signalled by a peak or a cusp depending on the strip width at intermediate values of betaalpha in the interval 01 this behavior of the spin hall conductivity was correlated with the one for the longitudinal spin conductivity this study was then extended to the outofequilibrium regime that arises by imposing a finite voltage bias between the two ends of an open strip this system in the presence of a hubbard term with coupling u was treated with the density matrix renormalization group technique and with the landauerbuttiker formalism it was found that relevant properties to the spin hall effect such as the transversal spin current and the spin accumulation present a similar nonmonotonic behavior as the one found for the spin conductivities more importantly it was also found that these properties are enhanced by the repulsive hubbard interaction up to a moderate value of u | [['a', 'model', 'with', 'both', 'rashba', 'and', 'dresselhaus', 'spin', 'orbit', 'so', 'couplings', 'and', 'hubbard', 'electronelectron', 'interaction', 'is', 'studied', 'on', 'planar', 'strips', 'at', 'quarter', 'filling', 'at', 'zero', 'temperature', 'in', 'the', 'clean', 'limit', 'in', 'the', 'absence', 'of', 'hubbard', 'repulsion', 'and', 'at', 'equilibrium', 'within', 'linear', 'response', 'theory', 'a', 'nonmonotonic', 'behavior', 'of', 'the', 'spin', 'hall', 'conductivity', 'as', 'a', 'function', 'of', 'the', 'ratio', 'of', 'the', 'rashba', 'alpha', 'and', 'dresselhaus', 'beta', 'strengths', 'was', 'found', 'for', 'large', 'enough', 'so', 'strengths', 'this', 'behavior', 'is', 'signalled', 'by', 'a', 'peak', 'or', 'a', 'cusp', 'depending', 'on', 'the', 'strip', 'width', 'at', 'intermediate', 'values', 'of', 'betaalpha', 'in', 'the', 'interval', '01', 'this', 'behavior', 'of', 'the', 'spin', 'hall', 'conductivity', 'was', 'correlated', 'with', 'the', 'one', 'for', 'the', 'longitudinal', 'spin', 'conductivity', 'this', 'study', 'was', 'then', 'extended', 'to', 'the', 'outofequilibrium', 'regime', 'that', 'arises', 'by', 'imposing', 'a', 'finite', 'voltage', 'bias', 'between', 'the', 'two', 'ends', 'of', 'an', 'open', 'strip', 'this', 'system', 'in', 'the', 'presence', 'of', 'a', 'hubbard', 'term', 'with', 'coupling', 'u', 'was', 'treated', 'with', 'the', 'density', 'matrix', 'renormalization', 'group', 'technique', 'and', 'with', 'the', 'landauerbuttiker', 'formalism', 'it', 'was', 'found', 'that', 'relevant', 'properties', 'to', 'the', 'spin', 'hall', 'effect', 'such', 'as', 'the', 'transversal', 'spin', 'current', 'and', 'the', 'spin', 'accumulation', 'present', 'a', 'similar', 'nonmonotonic', 'behavior', 'as', 'the', 'one', 'found', 'for', 'the', 'spin', 'conductivities', 'more', 'importantly', 'it', 'was', 'also', 'found', 'that', 'these', 'properties', 'are', 'enhanced', 'by', 'the', 'repulsive', 'hubbard', 'interaction', 'up', 'to', 'a', 'moderate', 'value', 'of', 'u']] | [-0.16909784159456628, 0.19098800388977355, -0.03419011626371532, 0.03800994229958102, -0.02908421164521804, -0.1710038395931447, 0.032010553605386745, 0.3583688392594659, -0.2638504996546017, -0.26941518947836096, 0.0407820590097474, -0.29700854532757764, -0.10750076539363561, 0.169956054591165, 0.07304403583342167, 0.006361542083704907, -0.03291044955677037, 0.01329344707937296, -0.1159069442129125, -0.2199850612513856, 0.2835965975797714, 0.005218258782867258, 0.254843996766095, 0.11664095645500726, 0.05120795574123503, 0.05325306893317914, 0.11400321231008195, 0.06991930047420962, -0.13563343539474637, 0.003703100104264207, 0.2144070642571517, -0.12888959031741712, 0.2275549013302472, -0.37551041279089264, -0.17675273728554824, 0.020451861740723654, 0.11573483350547663, 0.12743863921266943, -0.009388969827991724, -0.26338706157545294, 0.023400121033444528, -0.2080621785890918, -0.1645952852746278, -0.024236713566636137, 0.0841156672180643, -0.019700371046082802, -0.2715798995133102, 0.11632763635568906, 0.06944427683810404, 0.0654661580709513, -0.03949982148481373, -0.14900741765509481, -0.0713643821660109, 0.08638920463377724, 0.071569234720111, 0.05194585469374391, 0.1461946104307621, -0.15921554318102438, -0.08154341943216473, 0.3257406756189142, -0.11412824596682926, -0.1773514201004918, 0.1811422963217912, -0.20662690376087484, -0.062287765856920765, 0.13956654785365305, 0.10155313942679921, 0.058296555271835755, -0.15410216143818328, 0.13548358285070577, -0.030250905294443284, 0.16753966480280733, 0.02742435910625223, 0.031815689022345175, 0.25216202953687084, 0.1668612493193662, 0.07274729462247763, 0.15440879952019224, -0.13662421855679396, -0.053245155505279744, -0.25595862839826095, -0.1066735861268706, -0.20293041574399986, 0.08949864853586478, -0.0695070151796162, -0.19412330496103852, 0.41144918877951697, 0.15466083702041974, 0.2015216706312215, 0.019235926680266857, 0.23154261910748494, 0.18413166163702036, 0.08645247490613034, 0.039644438223449756, 0.25956385990613184, 0.1826890814307723, 0.1025499705376938, -0.3396165970632832, 0.06848729513290579, 0.040518347756005824] |
1,802.01036 | Unitarity issues in higher derivative field theories | We analyze the unitarity properties of higher derivative quantum field
theories which are free of ghosts and ultraviolet singularities. We point out
that in spite of the absence of ghosts most of these theories are not unitary.
This result confirms the difficulties of finding a consistent quantum field
theory of quantum gravity.
| hep-th gr-qc hep-ph math-ph math.MP | we analyze the unitarity properties of higher derivative quantum field theories which are free of ghosts and ultraviolet singularities we point out that in spite of the absence of ghosts most of these theories are not unitary this result confirms the difficulties of finding a consistent quantum field theory of quantum gravity | [['we', 'analyze', 'the', 'unitarity', 'properties', 'of', 'higher', 'derivative', 'quantum', 'field', 'theories', 'which', 'are', 'free', 'of', 'ghosts', 'and', 'ultraviolet', 'singularities', 'we', 'point', 'out', 'that', 'in', 'spite', 'of', 'the', 'absence', 'of', 'ghosts', 'most', 'of', 'these', 'theories', 'are', 'not', 'unitary', 'this', 'result', 'confirms', 'the', 'difficulties', 'of', 'finding', 'a', 'consistent', 'quantum', 'field', 'theory', 'of', 'quantum', 'gravity']] | [-0.19389445319449386, 0.15904754808602425, -0.1321173592519839, 0.08789546505431645, -0.06004492247190613, -0.10374583014681076, -0.0009667113257679515, 0.3085492389061703, -0.1813672568255592, -0.25453916016536265, 0.06285985601089823, -0.2635623374953866, -0.19294549410159773, 0.14929069329697925, -0.09815366639612386, 0.06616610768833198, 0.005306326497632723, 0.045709771766828805, -0.10896886377864015, -0.26944022281811786, 0.375447411242371, 0.02643794464529492, 0.20566621225757095, 0.06069391197524965, 0.06395619209461774, -0.0005706658210748663, -0.02491236967034638, 0.042520891373547226, -0.09905092402592484, 0.10129243249237053, 0.23678466436775544, 0.09073429577983916, 0.2536019584020743, -0.4498591605717173, -0.271996326583366, 0.10111247618288662, 0.11267912647543618, 0.17375043321785946, -0.024051380200454824, -0.25773917500359506, 0.08693338573301354, -0.129349275957793, -0.20558221930136475, -0.08071931605585493, -0.09659694426675113, -0.08809187761149727, -0.1554624618908677, 0.11758134253502178, 0.051750199690174595, 0.11454854282335593, -0.043974972128545724, -0.05959456644128435, -0.007860344189863939, 0.08506881265650289, 0.09813607302315247, 0.007029049895488872, 0.10815474894255973, -0.28058910308531126, -0.15222767004385018, 0.3919967884341112, -0.062336231116205454, -0.12193950751008323, 0.2105565020107091, -0.20933562242246878, -0.17217684268073824, 0.09935037988917919, 0.022437503033031065, 0.15197981670140648, -0.13364384228435272, 0.19869648813731217, 0.003561325626483617, 0.11622041363835496, 0.09317674097390129, 0.13499061975520676, 0.2873053436767525, -0.009521068100674221, 0.04182052066048177, 0.079656731014928, -0.020787255480312385, -0.1777683857631368, -0.45562458192356503, -0.1935887485026167, -0.12778094969689846, 0.07796348553949009, -0.0996557930571166, -0.2213436053492702, 0.3511924283364071, 0.2214404016446609, 0.11346438355618514, 0.025219802979756005, 0.199729565029534, 0.16560585464713556, 0.07202985854103015, 0.04735838243952738, 0.3048398241114158, 0.19690804067963305, 0.011614232489731736, -0.26451991853089285, -0.09224520895580869, 0.0746583524876489] |
1,802.01037 | Vector Hamiltonians in Nambu mechanics | We give a generalization of the Nambu mechanics based on vector Hamiltonians
theory. It is shown that any divergence-free phase flow in $\mathbb{R}^n$ can
be represented as a generalized Nambu mechanics with $n-1$ integral invariants.
For the case when the phase flow in $\mathbb{R}^n$ has $n-3$ or less first
integrals, we introduce the Cartan concept of mechanics. As an example we give
the fifth integral invariant of Euler top.
| math.DG math-ph math.DS math.MP nlin.SI | we give a generalization of the nambu mechanics based on vector hamiltonians theory it is shown that any divergencefree phase flow in mathbbrn can be represented as a generalized nambu mechanics with n1 integral invariants for the case when the phase flow in mathbbrn has n3 or less first integrals we introduce the cartan concept of mechanics as an example we give the fifth integral invariant of euler top | [['we', 'give', 'a', 'generalization', 'of', 'the', 'nambu', 'mechanics', 'based', 'on', 'vector', 'hamiltonians', 'theory', 'it', 'is', 'shown', 'that', 'any', 'divergencefree', 'phase', 'flow', 'in', 'mathbbrn', 'can', 'be', 'represented', 'as', 'a', 'generalized', 'nambu', 'mechanics', 'with', 'n1', 'integral', 'invariants', 'for', 'the', 'case', 'when', 'the', 'phase', 'flow', 'in', 'mathbbrn', 'has', 'n3', 'or', 'less', 'first', 'integrals', 'we', 'introduce', 'the', 'cartan', 'concept', 'of', 'mechanics', 'as', 'an', 'example', 'we', 'give', 'the', 'fifth', 'integral', 'invariant', 'of', 'euler', 'top']] | [-0.16655677488660844, 0.14377492125862298, -0.1198863153602334, 0.05646462933720508, -0.0922222363938024, -0.15668255899209474, -0.07575165168078535, 0.2844992967835371, -0.26661456265635247, -0.21573610169192156, 0.09896653997576862, -0.25662528292572906, -0.2375004013116215, 0.15279578063569532, -0.09228524143902073, 0.05984588804236357, 0.03346693556944745, 0.13209987734107004, -0.13196135778992396, -0.24513951953891935, 0.3427199589399, -0.06262942695942963, 0.1916403254845004, 0.04698266501983871, 0.152849563471703, 0.02444117114055848, 0.04530734678838348, 0.003911533473950365, -0.13844562729913826, 0.09622253195477137, 0.2280657668935432, 0.059049880830571055, 0.21402124930983005, -0.426913529391522, -0.21449671039168816, 0.1393089470575037, 0.1480801682109418, 0.06529026684027327, 0.012679896106525068, -0.2936707553082564, 0.05483097202428009, -0.167953011215381, -0.1836266254068123, -0.11496442076041484, 0.027788659179772156, -0.04306159875072215, -0.22207511889923742, 0.07553520088718421, 0.07095144168082354, 0.09042497586726339, -0.08398515489492295, -0.11419357731938362, -0.030869235379108483, 0.04332201087221409, -0.018222523876803294, 0.08925116678321923, 0.0672962081051715, -0.10029536725251355, -0.16139296000904363, 0.4593438338758289, -0.06846488056792135, -0.3452269210871579, 0.06983405041535372, -0.11415751804800137, -0.16044076136650814, 0.07581766432934049, 0.12769964318452537, 0.1461198193534021, -0.10594361719267908, 0.1339631901001153, -0.0968736838819324, 0.07173253271890723, 0.0531534567826252, -0.02652145219642831, 0.14847457223990257, 0.11440239467091211, 0.09287475878912685, 0.1668703325069172, -0.03406722718458353, -0.14909266442924307, -0.41453998222731164, -0.2264658707882399, -0.19558372157558368, 0.13560459359238544, -0.08975849366085469, -0.18530205046155732, 0.3482901481776566, 0.08410649652849289, 0.14003638622175524, 0.0669737976597811, 0.2307365813387045, 0.17919673199387456, 0.043616350416256035, 0.08177680679448489, 0.21300220224952351, 0.1839967162982709, 0.12408034660704974, -0.12828232162544315, -0.03568725647620749, 0.2296617031637309] |
1,802.01038 | Magnon scattering in the transport coefficients of CoFe alloys | Resistivity $\rho$, thermopower ${\cal S}$, and thermal conductivity $\kappa$
were measured simultaneously on a set of CoFe alloy films. Variation of the
Co-content $x_\mathrm{Co}$ allows for a systematic tuning of the Fermi level
through the band structure, and the study of the interplay between electronic
and magnetic contributions to the transport coefficients. While band structure
and magnon effects in $\rho$ and $\kappa$ are rather weak, they turn out to be
very significant in ${\cal S}$. The evolution of Mott and magnon drag
contributions to ${\cal S}$ is traced between the two limiting cases of pure Fe
and pure Co. In addition, we find an interesting sign change of the magnon
drag.
| cond-mat.mes-hall | resistivity rho thermopower cal s and thermal conductivity kappa were measured simultaneously on a set of cofe alloy films variation of the cocontent x_mathrmco allows for a systematic tuning of the fermi level through the band structure and the study of the interplay between electronic and magnetic contributions to the transport coefficients while band structure and magnon effects in rho and kappa are rather weak they turn out to be very significant in cal s the evolution of mott and magnon drag contributions to cal s is traced between the two limiting cases of pure fe and pure co in addition we find an interesting sign change of the magnon drag | [['resistivity', 'rho', 'thermopower', 'cal', 's', 'and', 'thermal', 'conductivity', 'kappa', 'were', 'measured', 'simultaneously', 'on', 'a', 'set', 'of', 'cofe', 'alloy', 'films', 'variation', 'of', 'the', 'cocontent', 'x_mathrmco', 'allows', 'for', 'a', 'systematic', 'tuning', 'of', 'the', 'fermi', 'level', 'through', 'the', 'band', 'structure', 'and', 'the', 'study', 'of', 'the', 'interplay', 'between', 'electronic', 'and', 'magnetic', 'contributions', 'to', 'the', 'transport', 'coefficients', 'while', 'band', 'structure', 'and', 'magnon', 'effects', 'in', 'rho', 'and', 'kappa', 'are', 'rather', 'weak', 'they', 'turn', 'out', 'to', 'be', 'very', 'significant', 'in', 'cal', 's', 'the', 'evolution', 'of', 'mott', 'and', 'magnon', 'drag', 'contributions', 'to', 'cal', 's', 'is', 'traced', 'between', 'the', 'two', 'limiting', 'cases', 'of', 'pure', 'fe', 'and', 'pure', 'co', 'in', 'addition', 'we', 'find', 'an', 'interesting', 'sign', 'change', 'of', 'the', 'magnon', 'drag']] | [-0.15217512556947432, 0.17509247599757458, -0.03796823150142692, 0.005640850491561667, -0.041031341143959274, -0.1142312827108948, 0.11442677256324, 0.3722088324191334, -0.2887850778873775, -0.29958052276256114, -0.01631146878201246, -0.351282813506718, -0.08224521166653381, 0.1634277412164453, 0.05353251622721284, -0.006753832248652035, -0.01978416048275592, -0.05030214455112949, -0.11951147450809577, -0.1828037969021311, 0.28561654764118494, 0.018693507573491818, 0.2629014017429572, 0.12776377627642843, 0.015557447188273744, -0.04540273687290447, 0.04026280391357235, 0.06386461915975782, -0.15077121134612476, 0.06294835929817579, 0.22890034316292218, -0.10034544919911134, 0.14074396689711893, -0.41317995860837065, -0.16498291091982964, 0.03463987557444017, 0.10187755916519342, 0.06977550903343605, 0.044094374276454316, -0.22580067286486025, 0.03502921108575957, -0.15174072873904496, -0.08648947425195025, -0.09569408039788942, 0.08983475978377166, -0.053078719783812414, -0.265864583887034, 0.13153450670526237, 0.06930352025036071, 0.07613046193780663, -0.05340133997588628, -0.17613466266072816, -0.13700984217864168, 0.08621210929610439, 0.09808057996964602, 0.03763239478261361, 0.17368971707869893, -0.13963812035886017, -0.05928500996994878, 0.3712699287948576, -0.11257400170706951, -0.11140561340427077, 0.15467667662924542, -0.21523820523273302, -0.0805800104731912, 0.16292282990138005, 0.11577908591543501, 0.0864687101702575, -0.12969769587672655, 0.1258057796376388, 0.005779546266002161, 0.1849983277990743, 0.055603221616800036, 0.08326944426071269, 0.23806961484857508, 0.12655359608863756, 0.021394566149316594, 0.14201500099404035, -0.1350973381698635, -0.004998444940324302, -0.26570499435629324, -0.1616681779038396, -0.15034357337113302, 0.10213327499291112, -0.10325641229422029, -0.166366160663709, 0.38026765358072145, 0.10416567626803576, 0.21901817722162148, -0.05775932798178883, 0.20615160768130072, 0.13443298224133737, 0.0442158677321565, 0.06526468477320967, 0.24315339585699075, 0.18726867067560488, 0.10093991869750123, -0.3524855730409088, 0.07140826996466196, 0.006113313700634617] |
1,802.01039 | Stochastic simulation of pattern formation in growing tissue: a
multilevel approach | We take up the challenge of designing realistic computational models of large
interacting cell populations. The goal is essentially to bring Gillespie's
celebrated stochastic methodology to the level of an interacting population of
cells. Specifically, we are interested in how the gold standard of single cell
computational modeling, here taken to be spatial stochastic reaction-diffusion
models, may be efficiently coupled with a similar approach at the cell
population level.
Concretely, we target a recently proposed set of pathways for pattern
formation involving Notch-Delta signaling mechanisms. These involve
cell-to-cell communication as mediated both via direct membrane contact sites
as well as via cellular protrusions. We explain how to simulate the process in
growing tissue using a multilevel approach and we discuss implications for
future development of the associated computational methods.
| cs.CE q-bio.TO | we take up the challenge of designing realistic computational models of large interacting cell populations the goal is essentially to bring gillespies celebrated stochastic methodology to the level of an interacting population of cells specifically we are interested in how the gold standard of single cell computational modeling here taken to be spatial stochastic reactiondiffusion models may be efficiently coupled with a similar approach at the cell population level concretely we target a recently proposed set of pathways for pattern formation involving notchdelta signaling mechanisms these involve celltocell communication as mediated both via direct membrane contact sites as well as via cellular protrusions we explain how to simulate the process in growing tissue using a multilevel approach and we discuss implications for future development of the associated computational methods | [['we', 'take', 'up', 'the', 'challenge', 'of', 'designing', 'realistic', 'computational', 'models', 'of', 'large', 'interacting', 'cell', 'populations', 'the', 'goal', 'is', 'essentially', 'to', 'bring', 'gillespies', 'celebrated', 'stochastic', 'methodology', 'to', 'the', 'level', 'of', 'an', 'interacting', 'population', 'of', 'cells', 'specifically', 'we', 'are', 'interested', 'in', 'how', 'the', 'gold', 'standard', 'of', 'single', 'cell', 'computational', 'modeling', 'here', 'taken', 'to', 'be', 'spatial', 'stochastic', 'reactiondiffusion', 'models', 'may', 'be', 'efficiently', 'coupled', 'with', 'a', 'similar', 'approach', 'at', 'the', 'cell', 'population', 'level', 'concretely', 'we', 'target', 'a', 'recently', 'proposed', 'set', 'of', 'pathways', 'for', 'pattern', 'formation', 'involving', 'notchdelta', 'signaling', 'mechanisms', 'these', 'involve', 'celltocell', 'communication', 'as', 'mediated', 'both', 'via', 'direct', 'membrane', 'contact', 'sites', 'as', 'well', 'as', 'via', 'cellular', 'protrusions', 'we', 'explain', 'how', 'to', 'simulate', 'the', 'process', 'in', 'growing', 'tissue', 'using', 'a', 'multilevel', 'approach', 'and', 'we', 'discuss', 'implications', 'for', 'future', 'development', 'of', 'the', 'associated', 'computational', 'methods']] | [-0.06336688543417195, 0.10059110831224284, -0.009747401309423438, 0.07755333062786396, -0.035416110072198304, -0.1608878656492619, 0.08408397020295609, 0.37180037031382457, -0.30806648124067126, -0.3042323723644769, 0.05719919915513186, -0.23000347520975584, -0.22754462467427114, 0.19145555078059204, -0.05541074973740434, 0.017570773481171174, 0.05957620218035209, -0.02434424359654618, 0.056443398637884806, -0.2102797414905341, 0.28386228740605157, 0.08244728995126116, 0.2854089751124902, 0.028006307232056476, 0.09739085470593369, -0.033762643916907815, -0.02256311941169953, 0.024087211348174153, -0.11001475441586335, 0.15820921117937564, 0.2595519293106974, 0.13838699597832854, 0.30602590435061805, -0.5520474842727877, -0.2684550651406884, 0.10728377114815363, 0.19060210680251566, 0.16606660778886934, -0.062459024066437586, -0.2304220178648252, 0.056334568508864605, -0.1628020408837659, -0.14024108905316324, -0.054403157128642, -0.04794061789469606, 0.04377227137587214, -0.26213845207090597, 0.0847861955859229, 0.007033090729829531, 0.05276275311899913, -0.05347014517187639, -0.08817312375880605, -0.00184097029846306, 0.17099342622086694, 0.008385422041905004, -0.020070048433082365, 0.1741791172133571, -0.11479130089499576, -0.16718739656056458, 0.3778311910374855, -0.03946106479135017, -0.23242058804937343, 0.2604927980637019, -0.1070563492307425, -0.15079843602143228, 0.13104621070444353, 0.2512988838287749, 0.08870464162684458, -0.1982109387109215, 0.036746403044937974, 0.02050787261723317, 0.1342776105125514, 0.0379596420603465, 0.01503986670354078, 0.210435824385707, 0.30445495018980995, 0.00620640627859348, 0.1234250804680118, -0.09425449561257306, -0.15070891478496004, -0.23407416313150248, -0.15765496228041864, -0.1142926576670057, 0.042946830260126974, -0.060718556529099604, -0.13878725466224573, 0.36317900884463344, 0.1419780519619483, 0.17309718523553552, 0.0555672625534583, 0.26811372124510563, 0.08214114754753596, 0.08429054409092249, -0.011468418444283018, 0.15773852173845435, 0.10484824506990077, 0.0846215023265704, -0.24917288773238314, 0.06641965335624855, 0.02115283972699224] |
1,802.0104 | TASI Lectures on the Emergence of the Bulk in AdS/CFT | These lectures review recent developments in our understanding of the
emergence of local bulk physics in AdS/CFT. The primary topics are sufficient
conditions for a conformal field theory to have a semiclassical dual, bulk
reconstruction, the quantum error correction interpretation of the
correspondence, tensor network models of holography, and the quantum
Ryu-Takayanagi formula.
| hep-th gr-qc quant-ph | these lectures review recent developments in our understanding of the emergence of local bulk physics in adscft the primary topics are sufficient conditions for a conformal field theory to have a semiclassical dual bulk reconstruction the quantum error correction interpretation of the correspondence tensor network models of holography and the quantum ryutakayanagi formula | [['these', 'lectures', 'review', 'recent', 'developments', 'in', 'our', 'understanding', 'of', 'the', 'emergence', 'of', 'local', 'bulk', 'physics', 'in', 'adscft', 'the', 'primary', 'topics', 'are', 'sufficient', 'conditions', 'for', 'a', 'conformal', 'field', 'theory', 'to', 'have', 'a', 'semiclassical', 'dual', 'bulk', 'reconstruction', 'the', 'quantum', 'error', 'correction', 'interpretation', 'of', 'the', 'correspondence', 'tensor', 'network', 'models', 'of', 'holography', 'and', 'the', 'quantum', 'ryutakayanagi', 'formula']] | [-0.109074851954883, 0.12629170473313556, -0.14142261480227253, 0.09878841075905652, -0.07600900301938208, -0.14559998461660348, -0.05299638870901446, 0.2508091228961382, -0.21277080181072344, -0.27898319550561457, 0.08630732824270315, -0.25349653448101206, -0.21743971314105504, 0.15676798817332624, -0.09058713417429969, 0.0794767986737051, 0.05182709516342378, 0.04324701389754718, -0.17753971114157224, -0.2574493228194286, 0.2816318213271926, 0.09030183458718348, 0.3812138150041958, 0.12710535640494441, 0.043952617091390325, -0.006109248987346326, -0.05733175896863752, 0.00908285602356114, -0.20934226757512903, 0.19831032263782788, 0.3038881163864165, 0.1267538966088257, 0.2204132559445669, -0.5064287194630729, -0.2837017703766249, -0.01185777857196781, 0.06704733789160426, 0.17468976268087918, -0.06631238668946163, -0.27614403867496634, 0.03807586677513033, -0.15425538967521685, -0.12733867061588, -0.07868244445373146, -0.012137707540290957, -0.0995211087448417, -0.19146128536535884, 0.10623185844424199, 0.06073658481099695, 0.0792770834007072, -0.06700405479356084, -0.03616906971371961, 0.024456479204467165, 0.12591691615657424, 0.050826074074479345, 0.07321100014059823, 0.1385626525635708, -0.24357117535019257, -0.17116108042064984, 0.29175222471778123, -0.014251189868686334, -0.14776432015581653, 0.1661182927530048, -0.14871255090495325, -0.1561710070730802, 0.04651001137944887, 0.14333569734656024, 0.14098549022708298, -0.14884919128468577, 0.15642974113513944, -0.032540733064964134, 0.043229455304033354, 0.03907452403339294, 0.12770724484811202, 0.30856235054725745, 0.08507331740111113, -0.04113529446394235, 0.10440041652643385, -0.03653235423800377, -0.16947997192729194, -0.44996367649719965, -0.19540276561143263, -0.19761292017855733, 0.08651428398201769, -0.11500076786148195, -0.17952945111495144, 0.3976425132802073, 0.16302292113371394, 0.14729937470083143, 0.0075490914004028966, 0.2652286376171517, 0.09637913827999618, 0.04929258676140376, 0.007922047432863488, 0.2581423622608747, 0.2632881954382613, 0.1253005606276071, -0.22429453432208524, -0.060660091094795685, 0.23057521594125988] |
1,802.01041 | Distance Metrics for Gamma Distributions | Here I present the analytic form of two common distance metrics, the
symmetrised Kullback-Leibler Divergence and the Kolmogorov-Smirnov statistic,
as well as an extension of the Kolmogorov-Smirnov statistic for comparing
theoretical gamma distributions. In doing so, I also present the analytic
solution to the intersection of two gamma distributions. Lastly, I provide
examples that demonstrate the similarity between these distance metrics and
their usefulness in describing the separability of gamma distributions.
| math.ST stat.TH | here i present the analytic form of two common distance metrics the symmetrised kullbackleibler divergence and the kolmogorovsmirnov statistic as well as an extension of the kolmogorovsmirnov statistic for comparing theoretical gamma distributions in doing so i also present the analytic solution to the intersection of two gamma distributions lastly i provide examples that demonstrate the similarity between these distance metrics and their usefulness in describing the separability of gamma distributions | [['here', 'i', 'present', 'the', 'analytic', 'form', 'of', 'two', 'common', 'distance', 'metrics', 'the', 'symmetrised', 'kullbackleibler', 'divergence', 'and', 'the', 'kolmogorovsmirnov', 'statistic', 'as', 'well', 'as', 'an', 'extension', 'of', 'the', 'kolmogorovsmirnov', 'statistic', 'for', 'comparing', 'theoretical', 'gamma', 'distributions', 'in', 'doing', 'so', 'i', 'also', 'present', 'the', 'analytic', 'solution', 'to', 'the', 'intersection', 'of', 'two', 'gamma', 'distributions', 'lastly', 'i', 'provide', 'examples', 'that', 'demonstrate', 'the', 'similarity', 'between', 'these', 'distance', 'metrics', 'and', 'their', 'usefulness', 'in', 'describing', 'the', 'separability', 'of', 'gamma', 'distributions']] | [-0.05387231677403333, 0.013309255263868155, -0.15253519791532572, 0.18411824886332934, -0.0325634969286883, -0.12115256308617306, 0.05757684396042056, 0.414869225911901, -0.2654595485508022, -0.2874015504887826, 0.04334295693535725, -0.33401601289359617, -0.13749752315679487, 0.17791884019970894, -0.0371821632798971, 0.0728841294390215, 0.021837875676590582, 0.02899202016144532, -0.11547413262092626, -0.19356149361586908, 0.3745401065114518, 0.059226874091570646, 0.28169886041826137, 0.02043387409247143, 0.052479654576786806, -0.03465117775166119, -0.06421918696133604, 0.038864809272050015, -0.1898930789219276, 0.13951628443352143, 0.18144167595687258, 0.2524325830311003, 0.24236926313778254, -0.3082419415988343, -0.1575611408629363, 0.12098141032940066, 0.13695477334861184, -0.02286527452262407, -0.04917896455022651, -0.2770112967708896, 0.013655571398180974, -0.17073960165480073, -0.11158480817406163, -0.08312057441389056, 0.058842015642882654, 0.10386591884110805, -0.2497085937574296, 0.09536350868325877, 0.07064340475612176, 0.09020741198426703, -0.027870504290495122, -0.15919736350401187, 0.03373452604249854, 0.12370444520730788, 0.11336849270467188, -0.0018677994031721437, 0.06496602490308209, -0.07665019875070946, -0.13954235203760926, 0.3387651655980399, -0.05732981376612271, -0.26264493588545085, 0.16793509252356287, -0.16529615109287937, -0.11698978811397519, 0.009610855217340966, 0.15336710720939536, 0.14421029504336103, -0.16583576542653247, 0.06470759709621451, -0.02085046505581745, 0.046423350519854835, 0.06919188242615529, 0.014498193066199901, 0.14682560180589346, 0.08276008670283876, 0.029938908923469797, 0.15818311760700504, -0.16582355211475786, -0.06374702809221099, -0.4352892913763792, -0.20705835481869503, -0.228308912747028, 0.03772389339151937, -0.16989802359234424, -0.20883549612120422, 0.3833436081677833, 0.13712381670894233, 0.21694039324180445, 0.12377834237757808, 0.2654020839803655, 0.08134854303895903, -0.032402088895151525, 0.06586258152735905, 0.24070300505509679, 0.15298506403407475, -0.040582696631760666, -0.1830824085209571, 0.05905934365492471, 0.04510766404195571] |
1,802.01042 | Transportation Emergency Planning Considering Uncertainty in Event
Duration and Drivers' Behavior | Traffic Emergency Management deals with directing the vehicular and
pedestrian traffic around traffic disruptions due to emergencies, such as
accidents or flooded roadways, aiming to ensure the safety of drivers,
pedestrians, and emergency responders. In this study, a scenario involving the
local flooding of the A1 motorway, one of Italy's main highways connecting
north to the south, is studied. The effect of event duration and drivers'
response rate are investigated on the alternative route activation strategies.
The macro and micro itineraries are established, and for different event
durations and response rates, the timelines for effective route activation are
evaluated. According to the results, for events shorter than 1.5 hours, there
is no need for the activation of alternative routes, and the longer the event,
the more alternative routes are needed to minimize the total travel time on the
flooded route. In addition, increase in the response rate of drivers to use the
alternative routes leads to the need to activate the micro itinerary after the
activation of the macro itinerary. Furthermore, the evacuation of an urban
region due to the flood scenario is studied considering different evacuation
strategies and residents response time. The results indicate the importance of
optimal exit point allocation and residents' preparedness to reduce the total
evacuation time.
| cs.CY physics.soc-ph | traffic emergency management deals with directing the vehicular and pedestrian traffic around traffic disruptions due to emergencies such as accidents or flooded roadways aiming to ensure the safety of drivers pedestrians and emergency responders in this study a scenario involving the local flooding of the a1 motorway one of italys main highways connecting north to the south is studied the effect of event duration and drivers response rate are investigated on the alternative route activation strategies the macro and micro itineraries are established and for different event durations and response rates the timelines for effective route activation are evaluated according to the results for events shorter than 15 hours there is no need for the activation of alternative routes and the longer the event the more alternative routes are needed to minimize the total travel time on the flooded route in addition increase in the response rate of drivers to use the alternative routes leads to the need to activate the micro itinerary after the activation of the macro itinerary furthermore the evacuation of an urban region due to the flood scenario is studied considering different evacuation strategies and residents response time the results indicate the importance of optimal exit point allocation and residents preparedness to reduce the total evacuation time | [['traffic', 'emergency', 'management', 'deals', 'with', 'directing', 'the', 'vehicular', 'and', 'pedestrian', 'traffic', 'around', 'traffic', 'disruptions', 'due', 'to', 'emergencies', 'such', 'as', 'accidents', 'or', 'flooded', 'roadways', 'aiming', 'to', 'ensure', 'the', 'safety', 'of', 'drivers', 'pedestrians', 'and', 'emergency', 'responders', 'in', 'this', 'study', 'a', 'scenario', 'involving', 'the', 'local', 'flooding', 'of', 'the', 'a1', 'motorway', 'one', 'of', 'italys', 'main', 'highways', 'connecting', 'north', 'to', 'the', 'south', 'is', 'studied', 'the', 'effect', 'of', 'event', 'duration', 'and', 'drivers', 'response', 'rate', 'are', 'investigated', 'on', 'the', 'alternative', 'route', 'activation', 'strategies', 'the', 'macro', 'and', 'micro', 'itineraries', 'are', 'established', 'and', 'for', 'different', 'event', 'durations', 'and', 'response', 'rates', 'the', 'timelines', 'for', 'effective', 'route', 'activation', 'are', 'evaluated', 'according', 'to', 'the', 'results', 'for', 'events', 'shorter', 'than', '15', 'hours', 'there', 'is', 'no', 'need', 'for', 'the', 'activation', 'of', 'alternative', 'routes', 'and', 'the', 'longer', 'the', 'event', 'the', 'more', 'alternative', 'routes', 'are', 'needed', 'to', 'minimize', 'the', 'total', 'travel', 'time', 'on', 'the', 'flooded', 'route', 'in', 'addition', 'increase', 'in', 'the', 'response', 'rate', 'of', 'drivers', 'to', 'use', 'the', 'alternative', 'routes', 'leads', 'to', 'the', 'need', 'to', 'activate', 'the', 'micro', 'itinerary', 'after', 'the', 'activation', 'of', 'the', 'macro', 'itinerary', 'furthermore', 'the', 'evacuation', 'of', 'an', 'urban', 'region', 'due', 'to', 'the', 'flood', 'scenario', 'is', 'studied', 'considering', 'different', 'evacuation', 'strategies', 'and', 'residents', 'response', 'time', 'the', 'results', 'indicate', 'the', 'importance', 'of', 'optimal', 'exit', 'point', 'allocation', 'and', 'residents', 'preparedness', 'to', 'reduce', 'the', 'total', 'evacuation', 'time']] | [-0.14748195789796323, 0.13501625693293115, -0.045379365410355595, 0.09089807335085123, -0.05314336469953094, -0.10261937997732047, 0.12891404931565914, 0.3771185460036965, -0.22262725315687923, -0.3219772253000129, 0.15125463847390935, -0.31614231459920017, -0.12623515795867765, 0.19500465570039766, -0.10986068192331487, 0.06481083786397537, 0.017628761989360243, 0.057594120761785675, 0.047639949782972195, -0.23700457012007162, 0.22801564280517506, 0.10185502810619983, 0.3396877447249129, 0.08292443372344518, 0.08182943308884852, -0.007997775874078556, -0.06999423863339763, -0.038411160337638556, -0.10707162551458271, 0.07929400645937965, 0.3021958246429879, 0.1476078682195095, 0.2970242246707363, -0.5172516184889875, -0.24963084851519615, 0.11584148864080838, 0.09469567037847387, 0.023940907498011674, -0.0012196139165589815, -0.2738498755569583, 0.09215960002800017, -0.1861078519378546, -0.1443268203858498, 0.04470388665000833, 0.04738660703161599, 0.06003228259731914, -0.2744454455104551, 0.038724259847871104, -0.03510089410177622, 0.05053178395017192, -0.07213361213155868, -0.06068464687482511, -0.023983146920270548, 0.22834321337981564, 0.11201119662474364, 0.008540516168594149, 0.18646468292431845, -0.12919999326863965, -0.1349431812317415, 0.406808680589355, 0.03374744742805021, -0.1125699446582946, 0.2050889509043687, -0.0586059713069685, -0.05678337577386137, 0.14980337051100923, 0.23450395377282213, 0.09734528152806181, -0.18520542704533363, -0.0960597292450036, 0.058038604983141846, 0.0921307579936709, 0.11709193516990514, 0.0030453591557855217, 0.19188387485847797, 0.23498520298344547, 0.1737011574049838, 0.0958424453216415, -0.13568396934074178, -0.13079446281628657, -0.2483943383709, -0.1366929802800842, -0.07990346290833224, 0.00653664883054016, -0.07905854627988533, -0.06444559096892792, 0.3916163592074084, 0.17647971024833867, 0.15037678694462853, 0.07024395744585525, 0.30848515167902996, 0.07481901308078036, 0.059392875795345315, 0.09092027058281993, 0.1634385012513936, -0.03420060498847392, 0.18183363762891616, -0.2505700577743422, 0.16281971718754037, 0.01817988711784448] |
1,802.01043 | Self-Aligned van der Waals Heterojunction Diodes and Transistors | A general self-aligned fabrication scheme is reported here for a diverse
class of electronic devices based on van der Waals materials and
heterojunctions. In particular, self-alignment enables the fabrication of
source-gated transistors in monolayer MoS2 with near-ideal current saturation
characteristics and channel lengths down to 135 nm. Furthermore, self-alignment
of van der Waals p-n heterojunction diodes achieves complete electrostatic
control of both the p-type and n-type constituent semiconductors in a
dual-gated geometry, resulting in gate-tunable mean and variance of
anti-ambipolar Gaussian characteristics. Through finite-element device
simulations, the operating principles of source-gated transistors and
dual-gated anti-ambipolar devices are elucidated, thus providing design rules
for additional devices that employ self-aligned geometries. For example, the
versatility of this scheme is demonstrated via contact-doped MoS2 homojunction
diodes and mixed-dimensional heterojunctions based on organic semiconductors.
The scalability of this approach is also shown by fabricating self-aligned
short-channel transistors with sub-diffraction channel lengths in the range of
150 nm to 800 nm using photolithography on large-area MoS2 films grown by
chemical vapor deposition. Overall, this self-aligned fabrication method
represents an important step towards the scalable integration of van der Waals
heterojunction devices into more sophisticated circuits and systems.
| physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci | a general selfaligned fabrication scheme is reported here for a diverse class of electronic devices based on van der waals materials and heterojunctions in particular selfalignment enables the fabrication of sourcegated transistors in monolayer mos2 with nearideal current saturation characteristics and channel lengths down to 135 nm furthermore selfalignment of van der waals pn heterojunction diodes achieves complete electrostatic control of both the ptype and ntype constituent semiconductors in a dualgated geometry resulting in gatetunable mean and variance of antiambipolar gaussian characteristics through finiteelement device simulations the operating principles of sourcegated transistors and dualgated antiambipolar devices are elucidated thus providing design rules for additional devices that employ selfaligned geometries for example the versatility of this scheme is demonstrated via contactdoped mos2 homojunction diodes and mixeddimensional heterojunctions based on organic semiconductors the scalability of this approach is also shown by fabricating selfaligned shortchannel transistors with subdiffraction channel lengths in the range of 150 nm to 800 nm using photolithography on largearea mos2 films grown by chemical vapor deposition overall this selfaligned fabrication method represents an important step towards the scalable integration of van der waals heterojunction devices into more sophisticated circuits and systems | [['a', 'general', 'selfaligned', 'fabrication', 'scheme', 'is', 'reported', 'here', 'for', 'a', 'diverse', 'class', 'of', 'electronic', 'devices', 'based', 'on', 'van', 'der', 'waals', 'materials', 'and', 'heterojunctions', 'in', 'particular', 'selfalignment', 'enables', 'the', 'fabrication', 'of', 'sourcegated', 'transistors', 'in', 'monolayer', 'mos2', 'with', 'nearideal', 'current', 'saturation', 'characteristics', 'and', 'channel', 'lengths', 'down', 'to', '135', 'nm', 'furthermore', 'selfalignment', 'of', 'van', 'der', 'waals', 'pn', 'heterojunction', 'diodes', 'achieves', 'complete', 'electrostatic', 'control', 'of', 'both', 'the', 'ptype', 'and', 'ntype', 'constituent', 'semiconductors', 'in', 'a', 'dualgated', 'geometry', 'resulting', 'in', 'gatetunable', 'mean', 'and', 'variance', 'of', 'antiambipolar', 'gaussian', 'characteristics', 'through', 'finiteelement', 'device', 'simulations', 'the', 'operating', 'principles', 'of', 'sourcegated', 'transistors', 'and', 'dualgated', 'antiambipolar', 'devices', 'are', 'elucidated', 'thus', 'providing', 'design', 'rules', 'for', 'additional', 'devices', 'that', 'employ', 'selfaligned', 'geometries', 'for', 'example', 'the', 'versatility', 'of', 'this', 'scheme', 'is', 'demonstrated', 'via', 'contactdoped', 'mos2', 'homojunction', 'diodes', 'and', 'mixeddimensional', 'heterojunctions', 'based', 'on', 'organic', 'semiconductors', 'the', 'scalability', 'of', 'this', 'approach', 'is', 'also', 'shown', 'by', 'fabricating', 'selfaligned', 'shortchannel', 'transistors', 'with', 'subdiffraction', 'channel', 'lengths', 'in', 'the', 'range', 'of', '150', 'nm', 'to', '800', 'nm', 'using', 'photolithography', 'on', 'largearea', 'mos2', 'films', 'grown', 'by', 'chemical', 'vapor', 'deposition', 'overall', 'this', 'selfaligned', 'fabrication', 'method', 'represents', 'an', 'important', 'step', 'towards', 'the', 'scalable', 'integration', 'of', 'van', 'der', 'waals', 'heterojunction', 'devices', 'into', 'more', 'sophisticated', 'circuits', 'and', 'systems']] | [-0.16623249231759674, 0.07888894434843069, -0.023555539058355605, -0.10499581599946949, 0.007785015002000316, -0.26077420660660294, 0.08890857488948228, 0.4815886370320829, -0.19444745712022476, -0.3029353891582233, -0.06714895078656385, -0.27628151384665, -0.1888415368373813, 0.32043823656255466, -0.03427994522569204, 0.10387648362178765, 0.007088437446037122, -0.25867343650574925, -0.036535041528651536, -0.1825480905558953, 0.20289207483685687, 0.07140395086970551, 0.38203393982684347, 0.12274989250654852, 0.1011621311260631, -0.0059999517001777265, 0.14542662192877207, -0.02028010138164211, -0.1960277179055631, 0.14806115562925165, 0.28221489796146787, -0.18078393286035557, 0.27372786414404815, -0.5118987554713538, -0.2370653161486484, -0.1109495765690482, 0.12571686332379783, 0.1438200489010818, -0.13083619719558012, -0.2594832976236549, 0.14092550784195845, -0.15691344022594822, -0.04799782435323784, -0.04220430268199032, -0.014078694768280465, 0.06094338640775434, -0.19933138563189806, 0.005118144962403933, 0.01910641484684189, 0.04774847992876281, -0.030334128548710544, -0.186854600260907, -0.03166287360196026, 0.027386227301419444, -0.14478792491398207, -0.06512277708657047, 0.3034200410965674, -0.10911927606388731, -0.13854131488743876, 0.3423563795681087, -0.013951839097161139, -0.08610673730329584, 0.14201164848831876, -0.10458314983193709, 0.019386689824720173, 0.13168966446891037, 0.12117329312254387, 0.1226929171469199, -0.2090558681139693, 0.09769112943502202, 0.09320601679784543, 0.19822227684854096, 0.1545592959865401, 0.1391092027633217, 0.2187542288359352, 0.291708807926625, 0.02175280579602887, 0.10925778842418996, -0.1072910648724308, 0.012327429734862833, -0.16175755482600973, -0.26739660831880196, -0.2198597577020175, 0.15408807843240924, -0.1021913607387361, -0.25750201027788566, 0.38474969053164787, 0.16240911263636074, 0.07723921605435209, -0.008827951606314298, 0.32045182353007506, 0.048013302331780576, 0.1295492215001595, -0.0677025209922168, 0.22869584586042227, 0.18868068889690398, 0.14722844376015423, -0.21145049865840304, 0.09136533700368557, -0.030977117843652896] |
1,802.01044 | Software Fault Isolation for Robust Compilation | Memory corruption vulnerabilities are endemic to unsafe languages, such as C,
and they can even be found in safe languages that themselves are implemented in
unsafe languages or linked with libraries implemented in unsafe languages.
Robust compilation mitigates the threat of linking with memory-unsafe
libraries. The source language is a C-like language, enriched with a notion of
a component which encapsulates data and code, exposing functionality through
well-defined interfaces. Robust compilation defines what security properties a
component still has, even, if one or more components are compromised. The main
contribution of this work is to demonstrate that the compartmentalization
necessary for a compiler that has the robust compilation property can be
realized on a basic RISC processor using software fault isolation.
| cs.CR | memory corruption vulnerabilities are endemic to unsafe languages such as c and they can even be found in safe languages that themselves are implemented in unsafe languages or linked with libraries implemented in unsafe languages robust compilation mitigates the threat of linking with memoryunsafe libraries the source language is a clike language enriched with a notion of a component which encapsulates data and code exposing functionality through welldefined interfaces robust compilation defines what security properties a component still has even if one or more components are compromised the main contribution of this work is to demonstrate that the compartmentalization necessary for a compiler that has the robust compilation property can be realized on a basic risc processor using software fault isolation | [['memory', 'corruption', 'vulnerabilities', 'are', 'endemic', 'to', 'unsafe', 'languages', 'such', 'as', 'c', 'and', 'they', 'can', 'even', 'be', 'found', 'in', 'safe', 'languages', 'that', 'themselves', 'are', 'implemented', 'in', 'unsafe', 'languages', 'or', 'linked', 'with', 'libraries', 'implemented', 'in', 'unsafe', 'languages', 'robust', 'compilation', 'mitigates', 'the', 'threat', 'of', 'linking', 'with', 'memoryunsafe', 'libraries', 'the', 'source', 'language', 'is', 'a', 'clike', 'language', 'enriched', 'with', 'a', 'notion', 'of', 'a', 'component', 'which', 'encapsulates', 'data', 'and', 'code', 'exposing', 'functionality', 'through', 'welldefined', 'interfaces', 'robust', 'compilation', 'defines', 'what', 'security', 'properties', 'a', 'component', 'still', 'has', 'even', 'if', 'one', 'or', 'more', 'components', 'are', 'compromised', 'the', 'main', 'contribution', 'of', 'this', 'work', 'is', 'to', 'demonstrate', 'that', 'the', 'compartmentalization', 'necessary', 'for', 'a', 'compiler', 'that', 'has', 'the', 'robust', 'compilation', 'property', 'can', 'be', 'realized', 'on', 'a', 'basic', 'risc', 'processor', 'using', 'software', 'fault', 'isolation']] | [-0.14964123091097767, 0.04750448351648326, -0.07153754988730725, 0.08892520826484543, -0.12268008949079862, -0.23944139249312382, 0.0532339839181077, 0.4018005103804171, -0.29914771544669444, -0.3059409224583457, 0.13519135338816948, -0.24799378426978363, -0.0782834825416406, 0.21793815767014166, -0.1305233738423946, 0.02949132039017665, 0.10110720517392717, 0.00030547333881258965, -0.016879788271520133, -0.22901745003958543, 0.29105121983836096, 0.012468327265620853, 0.25428639284024634, 0.034148998682697614, 0.02806841955462005, -0.07304289227904519, 0.008730840733430037, 0.029109585397721578, 0.004495862096337078, 0.1278933283179261, 0.3793978353399628, 0.27421637405253324, 0.2848620630024622, -0.4184386373963207, -0.1455371262457144, 0.04466782289479549, 0.136992505864085, 0.11736222521649324, -0.032060473229527514, -0.28011962468735874, 0.13959182359879682, -0.2551661592714178, -0.07104812887652466, -0.10677109711202017, 0.020606097555719315, -0.004218367615249008, -0.1992823246536621, -0.03667815068814283, 0.10578978638707971, 0.11076420256868005, 0.04137574930015641, -0.07497571381585051, -0.09161243596463464, 0.12765052180329803, -0.015492086900242915, 0.04789951837544019, 0.19282490675104783, -0.10806928688737874, -0.13911709284778528, 0.3775187789617727, -0.02275802252891784, -0.18994885677626977, 0.24220428856012102, 0.02242420419982712, -0.18822687833647553, 0.082372913036185, 0.15627329365039866, 0.04236794524282838, -0.2127105887668828, 0.10249205549771431, 0.03132853428057084, 0.26786399742704814, 0.07673605888849125, 0.035692502282715095, 0.2278851668505619, 0.19750055462888363, 0.029943676333095935, 0.1742771907922967, 0.004213919740868733, -0.05375510345135505, -0.27210104128268237, -0.15819247203956668, -0.10212860939791427, -0.034813291020691396, -0.016487208446051227, -0.22011842087376862, 0.35995387645283095, 0.17876959152830144, 0.07762078767797599, 0.07123787063610507, 0.35529441888599345, 0.03382972678179309, 0.19817135208383357, 0.16484054655690367, 0.14323251253032745, 0.01469492113101296, 0.08323217787935087, -0.13309444084394878, 0.22774584220023825, -0.032044896576553586] |
1,802.01045 | Electronic Transport in Two-Dimensional Materials | Two-dimensional (2D) materials have captured the attention of the scientific
community due to the wide range of unique properties at nanometer-scale
thicknesses. While significant exploratory research in 2D materials has been
achieved, the understanding of 2D electronic transport and carrier dynamics
remains in a nascent stage. Furthermore, since prior review articles have
provided general overviews of 2D materials or specifically focused on charge
transport in graphene, here we instead highlight charge transport mechanisms in
post-graphene 2D materials with particular emphasis on transition metal
dichalcogenides and black phosphorus. For these systems, we delineate the
intricacies of electronic transport including bandstructure control with
thickness and external fields, valley polarization, scattering mechanisms,
electrical contacts, and doping. In addition, electronic interactions between
2D materials are considered in the form of van der Waals heterojunctions and
composite films. This review concludes with a perspective on the most promising
future directions in this fast-evolving field.
| cond-mat.mtrl-sci | twodimensional 2d materials have captured the attention of the scientific community due to the wide range of unique properties at nanometerscale thicknesses while significant exploratory research in 2d materials has been achieved the understanding of 2d electronic transport and carrier dynamics remains in a nascent stage furthermore since prior review articles have provided general overviews of 2d materials or specifically focused on charge transport in graphene here we instead highlight charge transport mechanisms in postgraphene 2d materials with particular emphasis on transition metal dichalcogenides and black phosphorus for these systems we delineate the intricacies of electronic transport including bandstructure control with thickness and external fields valley polarization scattering mechanisms electrical contacts and doping in addition electronic interactions between 2d materials are considered in the form of van der waals heterojunctions and composite films this review concludes with a perspective on the most promising future directions in this fastevolving field | [['twodimensional', '2d', 'materials', 'have', 'captured', 'the', 'attention', 'of', 'the', 'scientific', 'community', 'due', 'to', 'the', 'wide', 'range', 'of', 'unique', 'properties', 'at', 'nanometerscale', 'thicknesses', 'while', 'significant', 'exploratory', 'research', 'in', '2d', 'materials', 'has', 'been', 'achieved', 'the', 'understanding', 'of', '2d', 'electronic', 'transport', 'and', 'carrier', 'dynamics', 'remains', 'in', 'a', 'nascent', 'stage', 'furthermore', 'since', 'prior', 'review', 'articles', 'have', 'provided', 'general', 'overviews', 'of', '2d', 'materials', 'or', 'specifically', 'focused', 'on', 'charge', 'transport', 'in', 'graphene', 'here', 'we', 'instead', 'highlight', 'charge', 'transport', 'mechanisms', 'in', 'postgraphene', '2d', 'materials', 'with', 'particular', 'emphasis', 'on', 'transition', 'metal', 'dichalcogenides', 'and', 'black', 'phosphorus', 'for', 'these', 'systems', 'we', 'delineate', 'the', 'intricacies', 'of', 'electronic', 'transport', 'including', 'bandstructure', 'control', 'with', 'thickness', 'and', 'external', 'fields', 'valley', 'polarization', 'scattering', 'mechanisms', 'electrical', 'contacts', 'and', 'doping', 'in', 'addition', 'electronic', 'interactions', 'between', '2d', 'materials', 'are', 'considered', 'in', 'the', 'form', 'of', 'van', 'der', 'waals', 'heterojunctions', 'and', 'composite', 'films', 'this', 'review', 'concludes', 'with', 'a', 'perspective', 'on', 'the', 'most', 'promising', 'future', 'directions', 'in', 'this', 'fastevolving', 'field']] | [-0.13275261040669992, 0.11099505365819896, 0.007843588608257296, -0.026854388999463234, -0.03624308359733707, -0.1590158178194149, 0.04805553715827095, 0.43931195823903624, -0.25219491672013084, -0.2886364772393544, 0.009228818419442914, -0.3353015445487423, -0.20508722507086508, 0.22315444495384204, 0.012460918392281275, 0.07499319980805111, -0.0019663972355349847, -0.13105068150026775, -0.0942779969096788, -0.1913975765842101, 0.3107096516302861, 0.04065714873581168, 0.36189936201176226, 0.12253872906738841, 0.02232313799243924, 0.018437432188137964, 0.034998017363250256, 0.02787693845095566, -0.19161454775048942, 0.11777979918327686, 0.29115619112869623, -0.09098415521785265, 0.27106838838222463, -0.5217839594729043, -0.28208438728659135, -0.032625639639681556, 0.1324058095546993, 0.16052489885525476, -0.17333684005456776, -0.24615402025095112, 0.03400952936617368, -0.13607398763682843, -0.06515687769215957, -0.08759964676259237, 0.036566633020836, 0.040540959135034575, -0.15919992053406187, 0.04661169803600658, 0.023135587561252603, 0.09785754831407119, -0.11653069874532898, -0.17335929624607307, -0.04643141000682639, 0.10971157141722034, 0.05413963220171108, 0.015469811432774656, 0.19563811858628272, -0.2165912640189777, -0.10791890071531934, 0.4136467663873289, 0.018893426001808176, -0.12600524113135966, 0.2168525059996928, -0.1784893226576969, -0.10169678576278023, 0.1043673956395454, 0.20288644532824085, 0.08927822076539332, -0.17977913174576857, 0.10405522401757676, 0.013611299514367774, 0.13478283470848929, 0.04586672924169515, 0.1418512127841225, 0.31952588978487795, 0.254143916924698, -0.0067545087627336586, 0.09056363465827638, -0.07701337179074667, -0.04753517930008899, -0.15316701944558755, -0.21797292970901205, -0.19862610401233305, 0.0889019124788811, -0.03367622328772307, -0.20598058286122978, 0.45698291286228326, 0.17431497188580752, 0.12234768996052947, -0.10530751232668203, 0.2255958922622675, 0.031059012584690307, 0.07136570571467904, -0.0008396343308393969, 0.29486262981112843, 0.12899601626417576, 0.162508615854234, -0.18383672552630054, 0.08996922589486113, -0.01137592362057468] |
1,802.01046 | Smooth centrally symmetric polytopes in dimension 3 are IDP | In 1997 Oda conjectured that every smooth lattice polytope has the integer
decomposition property. We prove Oda's conjecture for centrally symmetric
$3$-dimensional polytopes, by showing they are covered by lattice
parallelepipeds and unimodular simplices.
| math.CO math.AG | in 1997 oda conjectured that every smooth lattice polytope has the integer decomposition property we prove odas conjecture for centrally symmetric 3dimensional polytopes by showing they are covered by lattice parallelepipeds and unimodular simplices | [['in', '1997', 'oda', 'conjectured', 'that', 'every', 'smooth', 'lattice', 'polytope', 'has', 'the', 'integer', 'decomposition', 'property', 'we', 'prove', 'odas', 'conjecture', 'for', 'centrally', 'symmetric', '3dimensional', 'polytopes', 'by', 'showing', 'they', 'are', 'covered', 'by', 'lattice', 'parallelepipeds', 'and', 'unimodular', 'simplices']] | [-0.16158598951776237, 0.13590852686149232, -0.10149172567488517, 0.01613582795321503, -0.06364640388089944, -0.1761195090982844, -0.029539173578514773, 0.4178729486268233, -0.32460546953713193, -0.13763666216982529, 0.15937562533037955, -0.2797410481075263, -0.23165574741056738, 0.08105224929749966, -0.21754526363357024, 0.0144782522419358, 0.09369066042606444, -0.04368960651952554, -0.05730631671887001, -0.45688307948191376, 0.29326105917639594, -0.10602053454803194, 0.19682487998815143, 0.14608551235869527, 0.11140113773153108, 0.06792537420166328, 0.004256055005552138, 0.10578610693268917, -0.2033283203262031, 0.1021465577513856, 0.28752248537014513, 0.08887596879674889, 0.13121327950947864, -0.38865804881360794, -0.1382577940616209, 0.18504064905402415, 0.11183380325982238, 0.0347896986093153, -0.04075815805973595, -0.229891136781696, 0.14690560464035063, -0.07792557388379731, -0.2521393669406226, -0.07738435457405798, 0.14329181732062032, -0.04696646530646831, -0.24875989374841617, 0.016666824436363054, 0.15732225988005452, 0.14121274477528298, -0.022745874956907594, -0.19566346424193504, -0.1217323687091908, -0.02440637574695489, -0.11023181427598876, 0.07454064030967214, -0.05152246178134673, 0.016438927405568605, -0.23082654752344003, 0.43238260662731004, 0.07773019855513293, -0.23832908754839616, 0.039319290848010606, -0.2357162958394517, -0.20364374041502528, 0.1835206848130945, 0.03937576785135795, 0.12807454533108018, 0.0012449006385662977, 0.22385019837597878, -0.27340665826683536, 0.020375188957105446, 0.2418343617772574, -0.06674820292905412, 0.2135030173641794, -0.0022456138942609817, 0.12364800803034622, 0.20256536256741076, 0.11484712493770263, -0.0733075103147284, -0.22503204331459367, -0.12339569407734363, -0.293714901432395, 0.1476703542010749, -0.18834166625225301, -0.11643568607156768, 0.2236008961301516, -0.09358646416598383, 0.08258406007114578, 0.13944501977504628, 0.11528198168996502, 0.016139938386485857, 0.04794474430930089, 0.14295798696248846, 0.11475480652606006, 0.20028565014602945, -0.04118097365340766, -0.0564186453120783, -0.0404303696773508, 0.3146363404195975] |
1,802.01047 | Quantum Schur duality of affine type C with three parameters | We establish a three-parameter Schur duality between the affine Hecke algebra
of type C and a coideal subalgebra of quantum affine $\mathfrak{sl}_n$. At the
equal parameter specializations, we obtain Schur dualities of types BCD.
| math.RT math.QA | we establish a threeparameter schur duality between the affine hecke algebra of type c and a coideal subalgebra of quantum affine mathfraksl_n at the equal parameter specializations we obtain schur dualities of types bcd | [['we', 'establish', 'a', 'threeparameter', 'schur', 'duality', 'between', 'the', 'affine', 'hecke', 'algebra', 'of', 'type', 'c', 'and', 'a', 'coideal', 'subalgebra', 'of', 'quantum', 'affine', 'mathfraksl_n', 'at', 'the', 'equal', 'parameter', 'specializations', 'we', 'obtain', 'schur', 'dualities', 'of', 'types', 'bcd']] | [-0.17520205892951174, 0.007586031823473818, -0.07050398926195853, 0.04894246018546469, -0.14459021794883645, -0.3039905246730675, 0.01735907351351617, 0.31906834650127325, -0.3815767427577692, -0.09491583639208008, 0.07884362151654546, -0.18336535012349486, -0.17412893167313406, 0.16836059094844935, -0.15093739810125792, -0.055104549200383615, -0.010513543370453751, 0.06098215046393521, -0.2642292584402158, -0.2827184491736047, 0.37043689311865496, -0.05999888467725695, 0.2744923846741371, -0.04763074280858478, 0.14207811804269166, 0.009577201186295818, -0.009523023358162712, -0.12319459174485768, -0.2066233053474742, 0.11083481223185492, 0.38191681168973446, 0.07366741930737215, 0.16146098258083358, -0.29212712918353434, 0.0480326350833125, 0.2574545920771711, 0.22188150674200563, -0.031340022324858344, -0.022638068260515436, -0.2825143222204026, -0.01727489014977918, -0.28821075368015203, -0.19066986584049814, -0.02152965749230455, 0.09740149777601748, -0.01923713765298838, -0.3053061715327203, 0.03453646151020246, 0.06313025235773667, 0.188279491274015, -0.058802802416989035, -0.12540603138725548, -0.06100214277531075, 0.028175006319275674, -0.13200862179784215, -0.014581508140134461, 0.14043718080638962, -0.08541801489670486, -0.24736787269905428, 0.28533479406991424, 0.06515234100687153, -0.24068668287466555, 0.13570672525640795, -0.21232529609080622, -0.21780653056852958, -0.014446599052890259, -0.0013667301220052382, 0.07928861858432784, 0.023548691232195672, 0.287107412756407, -0.16466356978258667, -0.051886652979780644, 0.139353520647787, 0.018407394342562732, 0.18264394064488657, -0.042901199804071116, 0.025051669491564527, 0.21888092302662485, 0.08781801739207688, -0.048669440384187246, -0.43892939060049896, -0.2898639613242053, -0.03597059884272954, 0.15520301121560967, -0.22073322001747062, -0.20622827457811901, 0.43860942870378494, 0.022771891863907084, 0.10196731976397774, 0.1799769667251145, 0.08931693259407492, 0.10130412854692515, 0.1494613627471742, 0.0032803340102819834, 0.10020959533422309, 0.3718097459744005, -0.06898078162168317, -0.22495999603587039, -0.12020477979882237, 0.41247635192292575] |
1,802.01048 | Superconductivity in FeSe: the role of nematic order | Bulk FeSe is a special iron-based material in which superconductivity emerges
inside a well-developed nematic phase. We present a microscopic model for this
nematic superconducting state, which takes into account the mixing between
$s-$wave and $d-$wave pairing channels and the changes in the orbital spectral
weight promoted by the sign-changing nematic order parameter. We show that
nematicity gives rise to a $\cos2\theta$ variation of the pairing gap on the
hole pocket that agrees with ARPES and STM data for experimentally-extracted
Fermi surface parameters. We further argue that, in BCS theory, $d_{xz}$ and
$d_{yz}$ orbitals give nearly equal contributions to the pairing glue, i.e.
nematic order alone accounts for the gap anisotropy, but has little effect on
$T_{c}$. This result questions the validity of the concept of orbital-selective
pairing. Self-energy corrections, however, make $d_{xz}$ orbital more
incoherent and reduce its contribution to pairing.
| cond-mat.supr-con | bulk fese is a special ironbased material in which superconductivity emerges inside a welldeveloped nematic phase we present a microscopic model for this nematic superconducting state which takes into account the mixing between swave and dwave pairing channels and the changes in the orbital spectral weight promoted by the signchanging nematic order parameter we show that nematicity gives rise to a cos2theta variation of the pairing gap on the hole pocket that agrees with arpes and stm data for experimentallyextracted fermi surface parameters we further argue that in bcs theory d_xz and d_yz orbitals give nearly equal contributions to the pairing glue ie nematic order alone accounts for the gap anisotropy but has little effect on t_c this result questions the validity of the concept of orbitalselective pairing selfenergy corrections however make d_xz orbital more incoherent and reduce its contribution to pairing | [['bulk', 'fese', 'is', 'a', 'special', 'ironbased', 'material', 'in', 'which', 'superconductivity', 'emerges', 'inside', 'a', 'welldeveloped', 'nematic', 'phase', 'we', 'present', 'a', 'microscopic', 'model', 'for', 'this', 'nematic', 'superconducting', 'state', 'which', 'takes', 'into', 'account', 'the', 'mixing', 'between', 'swave', 'and', 'dwave', 'pairing', 'channels', 'and', 'the', 'changes', 'in', 'the', 'orbital', 'spectral', 'weight', 'promoted', 'by', 'the', 'signchanging', 'nematic', 'order', 'parameter', 'we', 'show', 'that', 'nematicity', 'gives', 'rise', 'to', 'a', 'cos2theta', 'variation', 'of', 'the', 'pairing', 'gap', 'on', 'the', 'hole', 'pocket', 'that', 'agrees', 'with', 'arpes', 'and', 'stm', 'data', 'for', 'experimentallyextracted', 'fermi', 'surface', 'parameters', 'we', 'further', 'argue', 'that', 'in', 'bcs', 'theory', 'd_xz', 'and', 'd_yz', 'orbitals', 'give', 'nearly', 'equal', 'contributions', 'to', 'the', 'pairing', 'glue', 'ie', 'nematic', 'order', 'alone', 'accounts', 'for', 'the', 'gap', 'anisotropy', 'but', 'has', 'little', 'effect', 'on', 't_c', 'this', 'result', 'questions', 'the', 'validity', 'of', 'the', 'concept', 'of', 'orbitalselective', 'pairing', 'selfenergy', 'corrections', 'however', 'make', 'd_xz', 'orbital', 'more', 'incoherent', 'and', 'reduce', 'its', 'contribution', 'to', 'pairing']] | [-0.23386424462185473, 0.21121531552370928, -0.0960339644547314, 0.12049973980236323, -0.11067477575377792, -0.17414548559484225, 0.1140639509515282, 0.32428721284348494, -0.2514024381294635, -0.255058480367223, -0.08275472154388376, -0.3438416061054334, -0.10165692966411564, 0.11042642777501638, 0.03513009915811981, -0.03272557222979566, -0.049948704002940277, -0.04530699211271837, -0.18604578607689246, -0.23971906786863792, 0.3860067134254103, 0.005732115857626794, 0.31158259781308684, 0.12967185081884344, -0.0007395945639673172, 0.030822541934589966, 0.14676571106340022, -0.02348470087460381, -0.17794775767560433, 0.07294087513835633, 0.31890970823876824, -0.10434007907867537, 0.19546992787496842, -0.43550572469037896, -0.23331723993327072, -0.0017180067209645788, 0.13522472435027255, 0.16317710419621398, -0.004773814360473258, -0.24966060808456852, 0.004246003417205726, -0.23489265852601182, -0.12754945408433993, -0.14174080415916174, -0.011051452530429084, -0.09289630480087527, -0.23312223322213965, 0.13411344557501878, 0.10592209957771215, 0.0657432013833631, -0.12727466862440664, -0.15181794163196327, -0.0753365128981412, 0.0216011441880771, 0.1356063580102492, 0.1059902171350038, 0.07411748059060927, -0.10170298253007709, -0.06021871641344318, 0.3584444945717746, 0.001624943006532729, -0.08458755768056139, 0.08109745692382468, -0.15181288468909074, -0.06615138934357158, 0.18256245335937207, 0.06069852153238913, -0.001615650981378986, -0.08297386580866807, 0.07931297362067057, -0.03033637705899722, 0.23537898177267813, -0.0026404015686452152, 0.10308510355373963, 0.24843471411430668, 0.18001670563091518, 0.08635006884628153, 0.09579478858157675, -0.13970661784211794, -0.08165941343490854, -0.26585747376876945, -0.14865719454680035, -0.217879634125964, 0.012123440417084606, -0.040427825129107926, -0.19144086020582535, 0.4016966258327589, 0.14449441018811565, 0.22564244328780061, -0.07183242756840344, 0.21512584862504022, 0.0682851643353562, 0.07874196920385386, 0.04252701481153647, 0.24040750296561852, 0.1587777555018584, 0.08237291818999863, -0.3551679740124052, 0.10328176100874577, 0.05037330624033162] |
1,802.01049 | Blind Joint MIMO Channel Estimation and Decoding | We propose a method for MIMO decoding when channel state information (CSI) is
unknown to both the transmitter and receiver. The proposed method requires some
structure in the transmitted signal for the decoding to be effective, in
particular that the underlying sources are drawn from a hypercubic space. Our
proposed technique fits a minimum volume parallelepiped to the received
samples. This problem can be expressed as a non-convex optimization problem
that can be solved with high probability by gradient descent. Our blind
decoding algorithm can be used when communicating over unknown MIMO wireless
channels using either BPSK or MPAM modulation. We apply our technique to
jointly estimate MIMO channel gain matrices and decode the underlying
transmissions with only knowledge of the transmitted constellation and without
the use of pilot symbols. Our results provide theoretical guarantees that the
proposed algorithm is correct when applied to small MIMO systems. Empirical
results show small sample size requirements, making this algorithm suitable for
block-fading channels with coherence times typically seen in practice. Our
approach has a loss of less than 3dB compared to zero-forcing with perfect CSI,
imposing a similar performance penalty as space-time coding techniques without
the loss of rate incurred by those techniques.
| eess.SP cs.IT math.IT math.OC | we propose a method for mimo decoding when channel state information csi is unknown to both the transmitter and receiver the proposed method requires some structure in the transmitted signal for the decoding to be effective in particular that the underlying sources are drawn from a hypercubic space our proposed technique fits a minimum volume parallelepiped to the received samples this problem can be expressed as a nonconvex optimization problem that can be solved with high probability by gradient descent our blind decoding algorithm can be used when communicating over unknown mimo wireless channels using either bpsk or mpam modulation we apply our technique to jointly estimate mimo channel gain matrices and decode the underlying transmissions with only knowledge of the transmitted constellation and without the use of pilot symbols our results provide theoretical guarantees that the proposed algorithm is correct when applied to small mimo systems empirical results show small sample size requirements making this algorithm suitable for blockfading channels with coherence times typically seen in practice our approach has a loss of less than 3db compared to zeroforcing with perfect csi imposing a similar performance penalty as spacetime coding techniques without the loss of rate incurred by those techniques | [['we', 'propose', 'a', 'method', 'for', 'mimo', 'decoding', 'when', 'channel', 'state', 'information', 'csi', 'is', 'unknown', 'to', 'both', 'the', 'transmitter', 'and', 'receiver', 'the', 'proposed', 'method', 'requires', 'some', 'structure', 'in', 'the', 'transmitted', 'signal', 'for', 'the', 'decoding', 'to', 'be', 'effective', 'in', 'particular', 'that', 'the', 'underlying', 'sources', 'are', 'drawn', 'from', 'a', 'hypercubic', 'space', 'our', 'proposed', 'technique', 'fits', 'a', 'minimum', 'volume', 'parallelepiped', 'to', 'the', 'received', 'samples', 'this', 'problem', 'can', 'be', 'expressed', 'as', 'a', 'nonconvex', 'optimization', 'problem', 'that', 'can', 'be', 'solved', 'with', 'high', 'probability', 'by', 'gradient', 'descent', 'our', 'blind', 'decoding', 'algorithm', 'can', 'be', 'used', 'when', 'communicating', 'over', 'unknown', 'mimo', 'wireless', 'channels', 'using', 'either', 'bpsk', 'or', 'mpam', 'modulation', 'we', 'apply', 'our', 'technique', 'to', 'jointly', 'estimate', 'mimo', 'channel', 'gain', 'matrices', 'and', 'decode', 'the', 'underlying', 'transmissions', 'with', 'only', 'knowledge', 'of', 'the', 'transmitted', 'constellation', 'and', 'without', 'the', 'use', 'of', 'pilot', 'symbols', 'our', 'results', 'provide', 'theoretical', 'guarantees', 'that', 'the', 'proposed', 'algorithm', 'is', 'correct', 'when', 'applied', 'to', 'small', 'mimo', 'systems', 'empirical', 'results', 'show', 'small', 'sample', 'size', 'requirements', 'making', 'this', 'algorithm', 'suitable', 'for', 'blockfading', 'channels', 'with', 'coherence', 'times', 'typically', 'seen', 'in', 'practice', 'our', 'approach', 'has', 'a', 'loss', 'of', 'less', 'than', '3db', 'compared', 'to', 'zeroforcing', 'with', 'perfect', 'csi', 'imposing', 'a', 'similar', 'performance', 'penalty', 'as', 'spacetime', 'coding', 'techniques', 'without', 'the', 'loss', 'of', 'rate', 'incurred', 'by', 'those', 'techniques']] | [-0.15385918972077803, 0.016029554386785376, -0.07634671820114501, 0.0481090918446854, -0.0894429170878706, -0.2500369433841821, 0.10413775941245813, 0.43195473204774604, -0.2735550642402759, -0.30227202736072945, 0.13438055577250058, -0.2258616407559397, -0.18465550379353848, 0.16182373137797104, -0.13663027011580878, 0.09963775924244775, 0.09000195202357437, 0.04383068446510712, -0.09749724733671035, -0.3186726191310462, 0.2490773640320502, 0.10625753394647766, 0.323631813063921, -0.03597599425728419, 0.11405841684355794, 0.03818105036550345, 0.004616049363912635, -0.03241318970960935, -0.057910138975088406, 0.07146536694973966, 0.33483751930310324, 0.22106295272902543, 0.2552273898994763, -0.4036564669936049, -0.2984851949028115, 0.09690918575796248, 0.17986558402010439, 0.12915223464109143, -0.06892226581966773, -0.28728792732651, 0.1486342778656428, -0.17949441749954698, -0.004345323218597998, -0.0035774763117530453, -0.1166665625757347, 0.007730975552503743, -0.3710781879394677, 0.047344284286619444, 0.011694463135544859, 0.015344052091333552, -0.03874268513682544, -0.16568185354059387, 0.0460202249371683, 0.12497258922696201, 0.02933133545966439, 0.04890795937329253, 0.08441606449630501, -0.07296263418028326, -0.10773183382116258, 0.3405255055441915, -0.024238797039415026, -0.2809578460416483, 0.12572346150061922, -0.08553820408750974, -0.05151520454005074, 0.21774437535665372, 0.24720471771897293, 0.09181491536000252, -0.1630893031934326, 0.02141982064824505, -0.010066307404666991, 0.23600299569514038, 0.07223638253221612, 0.10049004698362182, 0.10169592431852993, 0.16471616956706517, 0.11228879215427447, 0.15240266297530355, -0.12581394290996353, -0.07510922743535753, -0.22693019744879867, -0.08879984137764321, -0.26439828510901225, -0.0010068032054221304, -0.11929884174149727, -0.06567758297175864, 0.31515094545896893, 0.15900247934418013, 0.14649570418929506, 0.12884728360888711, 0.4084110981668925, 0.11125040560235636, 0.08321913809686973, 0.13513171515515565, 0.19021476074008953, 0.15358015888287171, 0.08211435410205682, -0.20460102319813261, 0.09913197502642129, -0.006763406030703985] |
1,802.0105 | TaintAssembly: Taint-Based Information Flow Control Tracking for
WebAssembly | WebAssembly (wasm) has recently emerged as a promisingly portable,
size-efficient, fast, and safe binary format for the web. As WebAssembly can
interact freely with JavaScript libraries, this gives rise to a potential for
undesirable behavior to occur. It is therefore important to be able to detect
when this might happen. A way to do this is through taint tracking, where we
follow the flow of information by applying taint labels to data. In this paper,
we describe TaintAssembly, a taint tracking engine for interpreted WebAssembly,
that we have created by modifying the V8 JavaScript engine. We implement basic
taint tracking functionality, taint in linear memory, and a probabilistic
variant of taint. We then benchmark our TaintAssembly engine by incorporating
it into a Chromium build and running it on custom test scripts and various real
world WebAssembly applications. We find that our modifications to the V8 engine
do not incur significant overhead with respect to vanilla V8's interpreted
WebAssembly, making TaintAssembly suitable for development and debugging.
| cs.CR | webassembly wasm has recently emerged as a promisingly portable sizeefficient fast and safe binary format for the web as webassembly can interact freely with javascript libraries this gives rise to a potential for undesirable behavior to occur it is therefore important to be able to detect when this might happen a way to do this is through taint tracking where we follow the flow of information by applying taint labels to data in this paper we describe taintassembly a taint tracking engine for interpreted webassembly that we have created by modifying the v8 javascript engine we implement basic taint tracking functionality taint in linear memory and a probabilistic variant of taint we then benchmark our taintassembly engine by incorporating it into a chromium build and running it on custom test scripts and various real world webassembly applications we find that our modifications to the v8 engine do not incur significant overhead with respect to vanilla v8s interpreted webassembly making taintassembly suitable for development and debugging | [['webassembly', 'wasm', 'has', 'recently', 'emerged', 'as', 'a', 'promisingly', 'portable', 'sizeefficient', 'fast', 'and', 'safe', 'binary', 'format', 'for', 'the', 'web', 'as', 'webassembly', 'can', 'interact', 'freely', 'with', 'javascript', 'libraries', 'this', 'gives', 'rise', 'to', 'a', 'potential', 'for', 'undesirable', 'behavior', 'to', 'occur', 'it', 'is', 'therefore', 'important', 'to', 'be', 'able', 'to', 'detect', 'when', 'this', 'might', 'happen', 'a', 'way', 'to', 'do', 'this', 'is', 'through', 'taint', 'tracking', 'where', 'we', 'follow', 'the', 'flow', 'of', 'information', 'by', 'applying', 'taint', 'labels', 'to', 'data', 'in', 'this', 'paper', 'we', 'describe', 'taintassembly', 'a', 'taint', 'tracking', 'engine', 'for', 'interpreted', 'webassembly', 'that', 'we', 'have', 'created', 'by', 'modifying', 'the', 'v8', 'javascript', 'engine', 'we', 'implement', 'basic', 'taint', 'tracking', 'functionality', 'taint', 'in', 'linear', 'memory', 'and', 'a', 'probabilistic', 'variant', 'of', 'taint', 'we', 'then', 'benchmark', 'our', 'taintassembly', 'engine', 'by', 'incorporating', 'it', 'into', 'a', 'chromium', 'build', 'and', 'running', 'it', 'on', 'custom', 'test', 'scripts', 'and', 'various', 'real', 'world', 'webassembly', 'applications', 'we', 'find', 'that', 'our', 'modifications', 'to', 'the', 'v8', 'engine', 'do', 'not', 'incur', 'significant', 'overhead', 'with', 'respect', 'to', 'vanilla', 'v8s', 'interpreted', 'webassembly', 'making', 'taintassembly', 'suitable', 'for', 'development', 'and', 'debugging']] | [-0.07829931725057247, 0.020611393068305738, -0.08796359371091096, 0.07151393119125782, -0.15494295357915064, -0.19771147107396939, 0.05884335664887641, 0.41845274716615677, -0.25894325061992635, -0.341030694731794, 0.12565263884536282, -0.26552648424667996, -0.11806797880130859, 0.25807630892505906, -0.1025850685753294, 0.041964472462908804, 0.08994044294524395, 0.01656655293385919, -0.019127211719179995, -0.21872092963716278, 0.2259537113596188, 0.09288666394762009, 0.23586138180154234, 0.05208115881891704, 0.07550437718221312, 0.024141100349556084, -0.032532734490011136, 0.024151890530062416, -0.034312910799303466, 0.10183423333029988, 0.3028833270694295, 0.22621803389907888, 0.2599201783926392, -0.45084454871119894, -0.17202285574777681, 0.07963960631779092, 0.144086724759988, 0.11793940526378295, -0.08938545790183833, -0.29462342199860886, 0.12830302082991335, -0.2669839203140578, -0.06732198626568621, -0.1630366906706541, 0.011885320252818883, 0.003982635450612274, -0.2503871123215035, -0.03987345874789485, 0.06912416159896682, 0.037740540784995065, 0.022184214556155487, -0.03411191413921812, 0.019453535032847132, 0.14594851401752357, 0.022693802113359095, 0.04634157013493744, 0.18088053772225976, -0.09057011828469284, -0.1359478059950416, 0.378826706664511, -0.06855681583291046, -0.1732610653903038, 0.21502217813252122, 0.01039319258023259, -0.175166400887952, 0.07615087738837704, 0.23299336165441142, 0.10129267652090525, -0.17963907151653338, 0.05326089277067879, 0.0016487518931093393, 0.20993623451295487, 0.04797573881995139, 0.0018478619788939053, 0.20356350224122313, 0.19434137009741292, 0.014151453310509493, 0.1625433405611287, -0.04062040609508368, -0.09465069257499982, -0.25114411651585367, -0.18867476845582937, -0.11401263439879278, 0.026283544109812138, -0.05010185304390298, -0.19269406014733428, 0.3579071817542512, 0.23180340069054733, 0.1430410057866226, 0.0595759421906954, 0.3440075835007374, 0.03647064682141952, 0.16286332393636457, 0.1405064574174263, 0.16879981609262765, -0.0261809285487294, 0.18437597479534112, -0.15583009488646377, 0.10576691127959297, 0.02477374818640978] |
1,802.01051 | Pressure-tuned magnetic interactions in honeycomb Kitaev materials | A range of honeycomb-lattice compounds has been proposed and investigated in
the search for a topological Kitaev spin liquid. However, sizable Heisenberg
interactions and additional symmetry-allowed exchange anisotropies in the
magnetic Hamiltonian of these potential Kitaev materials push them away from
the pure Kitaev spin-liquid state. Particularly the Kitaev-to-Heisenberg
coupling ratio is essential in this respect. With the help of advanced
quantum-chemistry methods, we explore how the magnetic coupling ratios depend
on pressure in several honeycomb compounds (Na$_2$IrO$_3$,
$\beta$-Li$_2$IrO$_3$, and $\alpha$-RuCl$_3$). We find that the Heisenberg and
Kitaev terms are affected differently by uniform pressure or strain: the Kitaev
component increases more rapidly than the Heisenberg counterpart. This provides
a scenario where applying pressure or strain can stabilize a spin liquid in
such materials.
| cond-mat.str-el | a range of honeycomblattice compounds has been proposed and investigated in the search for a topological kitaev spin liquid however sizable heisenberg interactions and additional symmetryallowed exchange anisotropies in the magnetic hamiltonian of these potential kitaev materials push them away from the pure kitaev spinliquid state particularly the kitaevtoheisenberg coupling ratio is essential in this respect with the help of advanced quantumchemistry methods we explore how the magnetic coupling ratios depend on pressure in several honeycomb compounds na_2iro_3 betali_2iro_3 and alpharucl_3 we find that the heisenberg and kitaev terms are affected differently by uniform pressure or strain the kitaev component increases more rapidly than the heisenberg counterpart this provides a scenario where applying pressure or strain can stabilize a spin liquid in such materials | [['a', 'range', 'of', 'honeycomblattice', 'compounds', 'has', 'been', 'proposed', 'and', 'investigated', 'in', 'the', 'search', 'for', 'a', 'topological', 'kitaev', 'spin', 'liquid', 'however', 'sizable', 'heisenberg', 'interactions', 'and', 'additional', 'symmetryallowed', 'exchange', 'anisotropies', 'in', 'the', 'magnetic', 'hamiltonian', 'of', 'these', 'potential', 'kitaev', 'materials', 'push', 'them', 'away', 'from', 'the', 'pure', 'kitaev', 'spinliquid', 'state', 'particularly', 'the', 'kitaevtoheisenberg', 'coupling', 'ratio', 'is', 'essential', 'in', 'this', 'respect', 'with', 'the', 'help', 'of', 'advanced', 'quantumchemistry', 'methods', 'we', 'explore', 'how', 'the', 'magnetic', 'coupling', 'ratios', 'depend', 'on', 'pressure', 'in', 'several', 'honeycomb', 'compounds', 'na_2iro_3', 'betali_2iro_3', 'and', 'alpharucl_3', 'we', 'find', 'that', 'the', 'heisenberg', 'and', 'kitaev', 'terms', 'are', 'affected', 'differently', 'by', 'uniform', 'pressure', 'or', 'strain', 'the', 'kitaev', 'component', 'increases', 'more', 'rapidly', 'than', 'the', 'heisenberg', 'counterpart', 'this', 'provides', 'a', 'scenario', 'where', 'applying', 'pressure', 'or', 'strain', 'can', 'stabilize', 'a', 'spin', 'liquid', 'in', 'such', 'materials']] | [-0.18603819041849848, 0.2550800931204595, -0.0016246721914181925, 0.06023606622678689, -0.08253709306728428, -0.17902150499536013, 0.045644211011174, 0.38491632783316015, -0.25672217699267513, -0.2736018168994574, 0.042738852549223154, -0.32020296167763995, -0.12112097870331348, 0.16927990290654324, 0.09187847873710883, 0.00034156443392176455, -0.04008047493568402, -0.015288585176070532, -0.13679088678256404, -0.24781784498534068, 0.25067363353446126, 0.045539432116291995, 0.2952072254374502, 0.07835496729618407, 0.012300133474201448, 0.028972211345931802, 0.14426511620754393, 0.027013557001463767, -0.17566197137075062, 0.0403641433174896, 0.2349775390750615, -0.11512113553926168, 0.14997804676735305, -0.4382540779415427, -0.23653759441728422, 0.06321711376369969, 0.11735569666389649, 0.16327601169970463, -0.05781738884802397, -0.31261078495441413, 0.008955490336246123, -0.2384674698038678, -0.10192779558748613, -0.15316144585215707, -0.049141320119786065, -0.006140100596968569, -0.2204888793299111, 0.09518964511031906, 0.09269616896157887, 0.09705970322758686, -0.09855844084234015, -0.15906332512348284, -0.0795824310621171, 0.051360039733259415, 0.08207985759538607, 0.09892767397838274, 0.13431627275346497, -0.15465696874581944, -0.1473515867255628, 0.40893255894988534, -0.06872129142419264, -0.1367621023011038, 0.19352639804223204, -0.13397845733111982, -0.12598661849832699, 0.1028071603306183, 0.10695753772402318, 0.033448645436182256, -0.11799059253246562, 0.12519272749418225, 0.005679818233702241, 0.1762317480155971, -0.023151815986275914, 0.03746870440730023, 0.2838401003112275, 0.1918259079651377, 0.07579583374923474, 0.18317068608977446, -0.09649214655472291, -0.09695913613115142, -0.1601231831269778, -0.18340689870074572, -0.23989524707156498, 0.04561255831362271, -0.10118691751882963, -0.1573971880757088, 0.4001673685719933, 0.198199605803967, 0.11685474780747833, -0.09866542875675893, 0.188797250496057, 0.04161706527816207, 0.06687358959116102, 0.042256627064666756, 0.3049412586658103, 0.18225376714755426, 0.0944988269063576, -0.27703078553966454, 0.08820513517376248, 0.028555459808558226] |
1,802.01052 | Dynamics of Opinions with Social Biases | This paper aims to provide a systemic analysis to social opinion dynamics
subject to individual biases. As a generalization of the classical DeGroot
social interactions, defined by linearly coupled dynamics of peer opinions that
evolve over time, biases add to state-dependent edge weights and therefore lead
to highly nonlinear network dynamics. Previous studies have dealt with
convergence and stability analysis of such systems for a few specific initial
node opinions and network structures, and here we focus on how individual
biases affect social equilibria and their stabilities. First of all, we prove
that when the initial network opinions are polarized towards one side of the
state space, node biases will drive the opinion evolution to the corresponding
interval boundaries. Such polarization attraction effect continues to hold
under even directed and switching network structures. Next, for a few
fundamental network structures, some important interior network equilibria are
presented explicitly for a wide range of system parameters, which are shown to
be locally unstable in general. Particularly, the interval centroid is proven
to be unstable regardless of the bias level and the network topologies.
| cs.SI | this paper aims to provide a systemic analysis to social opinion dynamics subject to individual biases as a generalization of the classical degroot social interactions defined by linearly coupled dynamics of peer opinions that evolve over time biases add to statedependent edge weights and therefore lead to highly nonlinear network dynamics previous studies have dealt with convergence and stability analysis of such systems for a few specific initial node opinions and network structures and here we focus on how individual biases affect social equilibria and their stabilities first of all we prove that when the initial network opinions are polarized towards one side of the state space node biases will drive the opinion evolution to the corresponding interval boundaries such polarization attraction effect continues to hold under even directed and switching network structures next for a few fundamental network structures some important interior network equilibria are presented explicitly for a wide range of system parameters which are shown to be locally unstable in general particularly the interval centroid is proven to be unstable regardless of the bias level and the network topologies | [['this', 'paper', 'aims', 'to', 'provide', 'a', 'systemic', 'analysis', 'to', 'social', 'opinion', 'dynamics', 'subject', 'to', 'individual', 'biases', 'as', 'a', 'generalization', 'of', 'the', 'classical', 'degroot', 'social', 'interactions', 'defined', 'by', 'linearly', 'coupled', 'dynamics', 'of', 'peer', 'opinions', 'that', 'evolve', 'over', 'time', 'biases', 'add', 'to', 'statedependent', 'edge', 'weights', 'and', 'therefore', 'lead', 'to', 'highly', 'nonlinear', 'network', 'dynamics', 'previous', 'studies', 'have', 'dealt', 'with', 'convergence', 'and', 'stability', 'analysis', 'of', 'such', 'systems', 'for', 'a', 'few', 'specific', 'initial', 'node', 'opinions', 'and', 'network', 'structures', 'and', 'here', 'we', 'focus', 'on', 'how', 'individual', 'biases', 'affect', 'social', 'equilibria', 'and', 'their', 'stabilities', 'first', 'of', 'all', 'we', 'prove', 'that', 'when', 'the', 'initial', 'network', 'opinions', 'are', 'polarized', 'towards', 'one', 'side', 'of', 'the', 'state', 'space', 'node', 'biases', 'will', 'drive', 'the', 'opinion', 'evolution', 'to', 'the', 'corresponding', 'interval', 'boundaries', 'such', 'polarization', 'attraction', 'effect', 'continues', 'to', 'hold', 'under', 'even', 'directed', 'and', 'switching', 'network', 'structures', 'next', 'for', 'a', 'few', 'fundamental', 'network', 'structures', 'some', 'important', 'interior', 'network', 'equilibria', 'are', 'presented', 'explicitly', 'for', 'a', 'wide', 'range', 'of', 'system', 'parameters', 'which', 'are', 'shown', 'to', 'be', 'locally', 'unstable', 'in', 'general', 'particularly', 'the', 'interval', 'centroid', 'is', 'proven', 'to', 'be', 'unstable', 'regardless', 'of', 'the', 'bias', 'level', 'and', 'the', 'network', 'topologies']] | [-0.15537044916053783, 0.09591605194273743, -0.07470837652658951, 0.07322416223386037, -0.10756034128992194, -0.15197349058152024, 0.07048426944683152, 0.43485848981232106, -0.31175062120738595, -0.266212711481705, 0.1065668674636182, -0.25078944983421364, -0.16695789250629636, 0.1284593808244668, -0.04128002999750406, 0.04014167063524128, 0.09830069481548699, 0.05668820135290913, 0.027130215775456976, -0.2846156539789473, 0.3593035529695124, 0.05612646252336492, 0.28524049288838854, 0.029448143248433492, 0.06858342316863254, -0.01405747521957792, -0.006504336487153893, 0.07995158478545389, -0.11945890313678659, 0.10131444994828429, 0.27640072912346203, 0.1131173276923249, 0.34756814112763973, -0.4316034763744408, -0.2337170794713669, 0.11432219229147329, 0.13496148777399009, 0.13925111657814482, 0.01485216574504163, -0.29878255837484374, 0.09437880065716844, -0.17914138596433288, -0.11238852924677534, -0.07828399175931545, 0.035916456763356266, 0.0863011452794116, -0.24492320574942852, 0.05105742070552698, 0.061390219147542266, 0.04305434795545867, -0.07382523662738175, -0.09461856982542795, -0.06560597378903857, 0.19512158066528762, 0.03394777366538419, 0.001566860556332548, 0.17035674256948077, -0.13413552150826205, -0.11500537926414316, 0.3705697933053291, -0.0232454052880652, -0.21846207191881079, 0.19276723711256316, -0.11947771507970334, -0.15835110569157854, 0.08861199644225352, 0.24020550031583388, 0.08643670727826328, -0.14551486777981865, -0.00771132475603116, 0.014233112839245042, 0.16390774313073891, 0.045513389174120275, 0.05184557521875671, 0.206732591967211, 0.17455237855556532, 0.13574820050872494, 0.10678827799319361, -0.022021397025897525, -0.15261424941031243, -0.229548993433447, -0.06891180594978792, -0.11569227913463652, 0.055755181076864786, -0.08272859323099781, -0.16018741457658478, 0.41654686152021614, 0.16439212031208636, 0.20787208212109712, 0.06890296130402751, 0.24024779773266106, 0.06891367696980424, 0.011696221191784019, 0.07284060997919149, 0.23071610248399127, 0.10749031450717127, 0.11336723210259371, -0.17969298571831763, 0.13184231549634465, 0.0012860957655932877] |
1,802.01053 | Using Poisson Binomial GLMs to Reveal Voter Preferences | We present a new modeling technique for solving the problem of ecological
inference, in which individual-level associations are inferred from labeled
data available only at the aggregate level. We model aggregate count data as
arising from the Poisson binomial, the distribution of the sum of independent
but not identically distributed Bernoulli random variables. We relate
individual-level probabilities to individual covariates using both a logistic
regression and a neural network. A normal approximation is derived via the
Lyapunov Central Limit Theorem, allowing us to efficiently fit these models on
large datasets. We apply this technique to the problem of revealing voter
preferences in the 2016 presidential election, fitting a model to a sample of
over four million voters from the highly contested swing state of Pennsylvania.
We validate the model at the precinct level via a holdout set, and at the
individual level using weak labels, finding that the model is predictive and it
learns intuitively reasonable associations.
| stat.ML stat.AP stat.CO | we present a new modeling technique for solving the problem of ecological inference in which individuallevel associations are inferred from labeled data available only at the aggregate level we model aggregate count data as arising from the poisson binomial the distribution of the sum of independent but not identically distributed bernoulli random variables we relate individuallevel probabilities to individual covariates using both a logistic regression and a neural network a normal approximation is derived via the lyapunov central limit theorem allowing us to efficiently fit these models on large datasets we apply this technique to the problem of revealing voter preferences in the 2016 presidential election fitting a model to a sample of over four million voters from the highly contested swing state of pennsylvania we validate the model at the precinct level via a holdout set and at the individual level using weak labels finding that the model is predictive and it learns intuitively reasonable associations | [['we', 'present', 'a', 'new', 'modeling', 'technique', 'for', 'solving', 'the', 'problem', 'of', 'ecological', 'inference', 'in', 'which', 'individuallevel', 'associations', 'are', 'inferred', 'from', 'labeled', 'data', 'available', 'only', 'at', 'the', 'aggregate', 'level', 'we', 'model', 'aggregate', 'count', 'data', 'as', 'arising', 'from', 'the', 'poisson', 'binomial', 'the', 'distribution', 'of', 'the', 'sum', 'of', 'independent', 'but', 'not', 'identically', 'distributed', 'bernoulli', 'random', 'variables', 'we', 'relate', 'individuallevel', 'probabilities', 'to', 'individual', 'covariates', 'using', 'both', 'a', 'logistic', 'regression', 'and', 'a', 'neural', 'network', 'a', 'normal', 'approximation', 'is', 'derived', 'via', 'the', 'lyapunov', 'central', 'limit', 'theorem', 'allowing', 'us', 'to', 'efficiently', 'fit', 'these', 'models', 'on', 'large', 'datasets', 'we', 'apply', 'this', 'technique', 'to', 'the', 'problem', 'of', 'revealing', 'voter', 'preferences', 'in', 'the', '2016', 'presidential', 'election', 'fitting', 'a', 'model', 'to', 'a', 'sample', 'of', 'over', 'four', 'million', 'voters', 'from', 'the', 'highly', 'contested', 'swing', 'state', 'of', 'pennsylvania', 'we', 'validate', 'the', 'model', 'at', 'the', 'precinct', 'level', 'via', 'a', 'holdout', 'set', 'and', 'at', 'the', 'individual', 'level', 'using', 'weak', 'labels', 'finding', 'that', 'the', 'model', 'is', 'predictive', 'and', 'it', 'learns', 'intuitively', 'reasonable', 'associations']] | [-0.04580366163170499, 0.02330430089585056, -0.10185370608203255, 0.09990737074467052, -0.09807476531536241, -0.1736769054862107, 0.1718536531241243, 0.3618932189894425, -0.2927656293117032, -0.3313040011621727, 0.07858654595572268, -0.30968851246129553, -0.11559707126995418, 0.16638325976362084, -0.06016387180039647, 0.0573424576858806, 0.09058269483903364, 0.04118635673906393, 0.03188320885673403, -0.294354570293977, 0.29485562039245583, 0.04148684649440537, 0.2905006470265472, -0.04643417661712997, 0.1482938921515041, 0.02961921015054367, -0.05933794791062784, 0.023434442111326583, -0.08091277816462825, 0.15736050315195352, 0.2788787302467722, 0.17685304101808463, 0.3289492680696466, -0.37296706005006064, -0.1774586662086569, 0.1293815997419738, 0.09625550882614983, 0.12066405832592864, 0.0399338337348086, -0.30704469758732494, 0.05959305415600301, -0.19932934713021966, -0.06728731199304104, -0.08842177647922284, -0.03793781530705227, 0.032784435521384145, -0.3274889626943619, 0.12303645132334938, 0.016374885902820144, 0.07408120667941537, -0.06930388369639019, -0.12795246763534512, -0.027728810907893215, 0.15341098458879882, 0.033763253637203935, -0.019292589772535652, 0.12440174860211689, -0.1240691982586364, -0.12920043257415104, 0.34083120720045773, -0.0357193282959615, -0.19701801016808126, 0.1712749109953452, -0.12154289598244533, -0.17702673794405097, 0.09941669879184598, 0.2399793331374883, 0.09151117973456717, -0.20380064252479252, 0.011240875777405847, -0.10758334306916993, 0.18129967978212294, 0.0348757270895609, -0.07441212567960499, 0.20403949262657364, 0.1797812922033155, 0.025533203530914275, 0.12749073485054882, -0.13639055562775085, -0.11800270856233538, -0.25785958060585434, -0.06303942853074734, -0.1826895912100745, 0.03702795687793371, -0.1338893501292862, -0.16818831435695386, 0.3929099960202221, 0.19487736120843774, 0.2228245642481099, 0.14161048597095618, 0.27303726095216835, 0.09735942234377493, 0.04476551069717878, 0.07852574997836617, 0.1324742268874743, 0.08968681053133906, 0.06162995986186656, -0.1567658862443107, 0.14334066899991624, 0.014365221507206654] |
1,802.01054 | Interval Consensus for Multiagent Networks | The constrained consensus problem considered in this paper, denoted interval
consensus, is characterized by the fact that each agent can impose a lower and
upper bound on the achievable consensus value. Such constraints can be encoded
in the consensus dynamics by saturating the values that an agent transmits to
its neighboring nodes. We show in the paper that when the intersection of the
intervals imposed by the agents is nonempty, the resulting constrained
consensus problem must converge to a common value inside that intersection. In
our algorithm, convergence happens in a fully distributed manner, and without
need of sharing any information on the individual constraining intervals. When
the intersection of the intervals is an empty set, the intrinsic nonlinearity
of the network dynamics raises new challenges in understanding the node state
evolution. Using Brouwer fixed-point theorem we prove that in that case there
exists at least one equilibrium, and in fact the possible equilibria are
locally stable if the constraints are satisfied or dissatisfied at the same
time among all nodes. For graphs with sufficient sparsity it is further proven
that there is a unique equilibrium that is globally attractive if the
constraint intervals are pairwise disjoint.
| cs.SY | the constrained consensus problem considered in this paper denoted interval consensus is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value such constraints can be encoded in the consensus dynamics by saturating the values that an agent transmits to its neighboring nodes we show in the paper that when the intersection of the intervals imposed by the agents is nonempty the resulting constrained consensus problem must converge to a common value inside that intersection in our algorithm convergence happens in a fully distributed manner and without need of sharing any information on the individual constraining intervals when the intersection of the intervals is an empty set the intrinsic nonlinearity of the network dynamics raises new challenges in understanding the node state evolution using brouwer fixedpoint theorem we prove that in that case there exists at least one equilibrium and in fact the possible equilibria are locally stable if the constraints are satisfied or dissatisfied at the same time among all nodes for graphs with sufficient sparsity it is further proven that there is a unique equilibrium that is globally attractive if the constraint intervals are pairwise disjoint | [['the', 'constrained', 'consensus', 'problem', 'considered', 'in', 'this', 'paper', 'denoted', 'interval', 'consensus', 'is', 'characterized', 'by', 'the', 'fact', 'that', 'each', 'agent', 'can', 'impose', 'a', 'lower', 'and', 'upper', 'bound', 'on', 'the', 'achievable', 'consensus', 'value', 'such', 'constraints', 'can', 'be', 'encoded', 'in', 'the', 'consensus', 'dynamics', 'by', 'saturating', 'the', 'values', 'that', 'an', 'agent', 'transmits', 'to', 'its', 'neighboring', 'nodes', 'we', 'show', 'in', 'the', 'paper', 'that', 'when', 'the', 'intersection', 'of', 'the', 'intervals', 'imposed', 'by', 'the', 'agents', 'is', 'nonempty', 'the', 'resulting', 'constrained', 'consensus', 'problem', 'must', 'converge', 'to', 'a', 'common', 'value', 'inside', 'that', 'intersection', 'in', 'our', 'algorithm', 'convergence', 'happens', 'in', 'a', 'fully', 'distributed', 'manner', 'and', 'without', 'need', 'of', 'sharing', 'any', 'information', 'on', 'the', 'individual', 'constraining', 'intervals', 'when', 'the', 'intersection', 'of', 'the', 'intervals', 'is', 'an', 'empty', 'set', 'the', 'intrinsic', 'nonlinearity', 'of', 'the', 'network', 'dynamics', 'raises', 'new', 'challenges', 'in', 'understanding', 'the', 'node', 'state', 'evolution', 'using', 'brouwer', 'fixedpoint', 'theorem', 'we', 'prove', 'that', 'in', 'that', 'case', 'there', 'exists', 'at', 'least', 'one', 'equilibrium', 'and', 'in', 'fact', 'the', 'possible', 'equilibria', 'are', 'locally', 'stable', 'if', 'the', 'constraints', 'are', 'satisfied', 'or', 'dissatisfied', 'at', 'the', 'same', 'time', 'among', 'all', 'nodes', 'for', 'graphs', 'with', 'sufficient', 'sparsity', 'it', 'is', 'further', 'proven', 'that', 'there', 'is', 'a', 'unique', 'equilibrium', 'that', 'is', 'globally', 'attractive', 'if', 'the', 'constraint', 'intervals', 'are', 'pairwise', 'disjoint']] | [-0.18840292122375768, 0.10633766812495155, -0.0751172784446422, 0.049329923376615924, -0.05838954736369894, -0.1721258373047003, 0.0854092570196667, 0.3716228836012749, -0.3187881797400828, -0.27507993936311775, 0.1322333583366575, -0.2709105017093875, -0.12219417024153252, 0.11366416129571986, -0.08242040341436334, 0.024674749211422972, 0.09561268647489739, 0.10907637776019817, -0.02383247542645319, -0.29943006830928176, 0.32800096597553224, 0.004071527411263001, 0.26477759892740266, 0.045821338665061793, 0.11881569895283485, -0.011816778827723362, 0.05872760925883413, 0.06859540099545197, -0.12296733795458376, 0.09484447662950243, 0.2610389443662793, 0.18006118718501615, 0.3303922651723254, -0.41727233107962886, -0.16447390125222922, 0.18703660616109877, 0.1666246166258937, 0.07310164538519409, -0.004989101494742832, -0.23878448482054443, 0.13638083299097184, -0.10223343952317832, -0.09844696643729198, -0.02641852589579403, 0.024638100725783006, 0.021690549522751783, -0.29289530691345633, 0.03441801570505991, 0.08268471939139409, 0.020306429630564997, -0.05362282755375759, -0.0660151551089954, -0.05674950089683841, 0.14079186669462196, 0.02351347597429368, 0.030468413733338303, 0.08689195812126707, -0.09811156087904828, -0.11369234231433023, 0.360495796663507, -0.010578081626350504, -0.22477771651941153, 0.1485087912698716, -0.11765660158883565, -0.16011588787660003, 0.10500289397054177, 0.12118991515433727, 0.113396917465072, -0.1482644976351025, 0.09383583494945462, -0.08165927034883103, 0.16228377292414908, 0.06774456754827939, 0.03704207605649221, 0.20156157212000964, 0.1564778978569991, 0.19457824065865295, 0.09794884442285573, -0.009498674954349166, -0.12395088383390185, -0.3170037013691316, -0.08175320692772878, -0.2215044134016371, 0.031125203505404257, -0.1017427149032707, -0.13163151556559777, 0.3526295071968875, 0.13478706831225964, 0.18671196932445852, 0.08803241116557327, 0.29693531200259, 0.13280209819622266, 0.018303653989979986, 0.1803353776408331, 0.24584652002673918, 0.057115947554091245, 0.02257832725470895, -0.18286260892400696, 0.1436284186535983, 0.05248251751651467] |
1,802.01055 | Spatially-resolved Brillouin spectroscopy reveals biomechanical changes
in early ectatic corneal disease and post-crosslinking in vivo | Mounting evidence connects the biomechanical properties of tissues to the
development of eye diseases such as keratoconus, a common disease in which the
cornea thins and bulges into a conical shape. However, measuring biomechanical
changes in vivo with sufficient sensitivity for disease detection has proved
challenging. Here, we present a first large-scale study (~200 subjects,
including normal and keratoconus patients) using Brillouin light-scattering
microscopy to measure longitudinal modulus in corneal tissues with high
sensitivity and spatial resolution. Our results in vivo provide evidence of
biomechanical inhomogeneity at the onset of keratoconus and suggest that
biomechanical asymmetry between the left and right eyes may presage disease
development. We additionally measure the stiffening effect of corneal
crosslinking treatment in vivo for the first time. Our results demonstrate the
promise of Brillouin microscopy for diagnosis and treatment of keratoconus, and
potentially other diseases.
| q-bio.QM physics.med-ph | mounting evidence connects the biomechanical properties of tissues to the development of eye diseases such as keratoconus a common disease in which the cornea thins and bulges into a conical shape however measuring biomechanical changes in vivo with sufficient sensitivity for disease detection has proved challenging here we present a first largescale study 200 subjects including normal and keratoconus patients using brillouin lightscattering microscopy to measure longitudinal modulus in corneal tissues with high sensitivity and spatial resolution our results in vivo provide evidence of biomechanical inhomogeneity at the onset of keratoconus and suggest that biomechanical asymmetry between the left and right eyes may presage disease development we additionally measure the stiffening effect of corneal crosslinking treatment in vivo for the first time our results demonstrate the promise of brillouin microscopy for diagnosis and treatment of keratoconus and potentially other diseases | [['mounting', 'evidence', 'connects', 'the', 'biomechanical', 'properties', 'of', 'tissues', 'to', 'the', 'development', 'of', 'eye', 'diseases', 'such', 'as', 'keratoconus', 'a', 'common', 'disease', 'in', 'which', 'the', 'cornea', 'thins', 'and', 'bulges', 'into', 'a', 'conical', 'shape', 'however', 'measuring', 'biomechanical', 'changes', 'in', 'vivo', 'with', 'sufficient', 'sensitivity', 'for', 'disease', 'detection', 'has', 'proved', 'challenging', 'here', 'we', 'present', 'a', 'first', 'largescale', 'study', '200', 'subjects', 'including', 'normal', 'and', 'keratoconus', 'patients', 'using', 'brillouin', 'lightscattering', 'microscopy', 'to', 'measure', 'longitudinal', 'modulus', 'in', 'corneal', 'tissues', 'with', 'high', 'sensitivity', 'and', 'spatial', 'resolution', 'our', 'results', 'in', 'vivo', 'provide', 'evidence', 'of', 'biomechanical', 'inhomogeneity', 'at', 'the', 'onset', 'of', 'keratoconus', 'and', 'suggest', 'that', 'biomechanical', 'asymmetry', 'between', 'the', 'left', 'and', 'right', 'eyes', 'may', 'presage', 'disease', 'development', 'we', 'additionally', 'measure', 'the', 'stiffening', 'effect', 'of', 'corneal', 'crosslinking', 'treatment', 'in', 'vivo', 'for', 'the', 'first', 'time', 'our', 'results', 'demonstrate', 'the', 'promise', 'of', 'brillouin', 'microscopy', 'for', 'diagnosis', 'and', 'treatment', 'of', 'keratoconus', 'and', 'potentially', 'other', 'diseases']] | [-0.04880258052476815, 0.08108666462025473, -0.07778128255491278, 0.02276080856099725, -0.07334211863843458, -0.11576139598286578, 0.003791292579678286, 0.4152172964265836, -0.2051789094195036, -0.236649301988239, 0.09232353951499266, -0.2917787287662837, -0.2511764133615153, 0.22548618804596895, -0.11520639558522297, 0.043367915642530924, 0.08496983902794975, -0.020846251848810685, 0.029613786042734448, -0.1469709550238414, 0.22450791941955686, 0.021790452502734425, 0.32751489643872317, 0.1301085597436343, 0.12258237877395003, 0.021276788519961492, -0.01955708135750943, 0.004817716448035623, -0.15135751746986767, 0.10418841078441932, 0.32385140828222836, 0.11917987512341434, 0.30560201965272427, -0.46988097442580123, -0.270556557565994, 0.07201514479571156, 0.15501561965460756, 0.06870396888698452, -0.06636304519592419, -0.3153933280280658, 0.07821134732096523, -0.07701137221883983, -0.15203275458853957, -0.0890670414215752, 0.016067056315036358, -0.01044714212933156, -0.24633292097465267, 0.17121275081964477, -0.019011071979600405, 0.19403703224712185, -0.1278249936427788, -0.07046866477799735, -0.03631120667061103, 0.17487066349380517, 0.0906987298679139, 0.01840129836761792, 0.19816219087286818, -0.17760525211093148, -0.10554203391740365, 0.32463964858824124, 0.01602000475728086, -0.12051495157647878, 0.1961370041677063, -0.19526670155381518, -0.10428213246964983, 0.1180398594671195, 0.1660214223233717, 0.07407210763610367, -0.142958605415853, -0.08078998594636297, 0.03397082955676264, 0.15964838796561318, 0.1147115275912386, -0.0026611654653346966, 0.17206533176026173, 0.2485449747315475, -0.0010617231484502554, 0.0800258815887251, -0.18781004038506321, 0.015948429889976978, -0.2393598034063221, -0.21185410413891076, -0.06731775600887237, 0.043387136656695344, -0.10179603883391662, -0.1673901573754847, 0.39363769207681926, 0.15040781670400716, 0.17132078578662394, 0.03585017795890703, 0.2793351290215339, -0.048380380525902315, 0.07653732871736534, -0.062117067385198815, 0.21747312929614315, 0.10475230560717007, 0.09735461485439113, -0.27975483496473835, 0.1426387516565488, -0.0514505598910286] |
1,802.01056 | Uncertainty Quantification of the time averaging of a Statistics
Computed from Numerical Simulation of Turbulent Flow | Rigorous assessment of the uncertainty is crucial to the utility of numerical
simulation of Turbulent flow. The Turbulent flows are often stationary and
ergodic, after some initial transient time. Therefore, the time averaged of a
quantity (velocity, TKE (turbulence kinetic energy), total drag, etc) converges
to a constant as the averaging interval increases. This infinite-time-average
statistic is of particular interest in many problems, such as aerodynamic shape
optimization. Since taking an average over the infinite time horizon is not
possible, some finite-time approximation of the infinite-time-average statistic
of interest is used in practice. However, because of the initial transient
behavior of the turbulence simulations, this estimate is biased. This issue is
solved by deleting the initial transient part of the simulation. The other
important issue is the error of this approximation decreases slowly, like the
reciprocal of the square roots of the averaging time. In this paper, we develop
a framework to first automatically deleted the transient part of a turbulence
simulation, then, quantify precisely the uncertainty of such a
finite-time-average approximation of an infinite-time-average statistic of a
stationary and ergodic process.
| math.ST physics.comp-ph stat.TH | rigorous assessment of the uncertainty is crucial to the utility of numerical simulation of turbulent flow the turbulent flows are often stationary and ergodic after some initial transient time therefore the time averaged of a quantity velocity tke turbulence kinetic energy total drag etc converges to a constant as the averaging interval increases this infinitetimeaverage statistic is of particular interest in many problems such as aerodynamic shape optimization since taking an average over the infinite time horizon is not possible some finitetime approximation of the infinitetimeaverage statistic of interest is used in practice however because of the initial transient behavior of the turbulence simulations this estimate is biased this issue is solved by deleting the initial transient part of the simulation the other important issue is the error of this approximation decreases slowly like the reciprocal of the square roots of the averaging time in this paper we develop a framework to first automatically deleted the transient part of a turbulence simulation then quantify precisely the uncertainty of such a finitetimeaverage approximation of an infinitetimeaverage statistic of a stationary and ergodic process | [['rigorous', 'assessment', 'of', 'the', 'uncertainty', 'is', 'crucial', 'to', 'the', 'utility', 'of', 'numerical', 'simulation', 'of', 'turbulent', 'flow', 'the', 'turbulent', 'flows', 'are', 'often', 'stationary', 'and', 'ergodic', 'after', 'some', 'initial', 'transient', 'time', 'therefore', 'the', 'time', 'averaged', 'of', 'a', 'quantity', 'velocity', 'tke', 'turbulence', 'kinetic', 'energy', 'total', 'drag', 'etc', 'converges', 'to', 'a', 'constant', 'as', 'the', 'averaging', 'interval', 'increases', 'this', 'infinitetimeaverage', 'statistic', 'is', 'of', 'particular', 'interest', 'in', 'many', 'problems', 'such', 'as', 'aerodynamic', 'shape', 'optimization', 'since', 'taking', 'an', 'average', 'over', 'the', 'infinite', 'time', 'horizon', 'is', 'not', 'possible', 'some', 'finitetime', 'approximation', 'of', 'the', 'infinitetimeaverage', 'statistic', 'of', 'interest', 'is', 'used', 'in', 'practice', 'however', 'because', 'of', 'the', 'initial', 'transient', 'behavior', 'of', 'the', 'turbulence', 'simulations', 'this', 'estimate', 'is', 'biased', 'this', 'issue', 'is', 'solved', 'by', 'deleting', 'the', 'initial', 'transient', 'part', 'of', 'the', 'simulation', 'the', 'other', 'important', 'issue', 'is', 'the', 'error', 'of', 'this', 'approximation', 'decreases', 'slowly', 'like', 'the', 'reciprocal', 'of', 'the', 'square', 'roots', 'of', 'the', 'averaging', 'time', 'in', 'this', 'paper', 'we', 'develop', 'a', 'framework', 'to', 'first', 'automatically', 'deleted', 'the', 'transient', 'part', 'of', 'a', 'turbulence', 'simulation', 'then', 'quantify', 'precisely', 'the', 'uncertainty', 'of', 'such', 'a', 'finitetimeaverage', 'approximation', 'of', 'an', 'infinitetimeaverage', 'statistic', 'of', 'a', 'stationary', 'and', 'ergodic', 'process']] | [-0.1485206209874367, 0.11946436932753612, -0.11492770258079987, 0.09397700557378334, -0.033161250892409136, -0.05506282423761833, 0.038544190518213284, 0.3203774771514189, -0.3139488177054989, -0.27466016715567415, 0.14786301412586206, -0.23454977210755176, -0.1101032305519786, 0.1925761611561049, -0.06590271594507095, 0.11517395286239396, 0.06705201989765285, 0.04587356723556861, -0.037838484872279185, -0.23775155186004812, 0.27227892197195175, 0.11768523606765006, 0.26462782011238745, 0.023962216200924463, 0.11814490356096659, -0.021577846571463496, -0.06242360557089894, 0.05468262135432596, -0.15220851237108693, 0.05025607162767517, 0.22331144218976245, 0.10609545017391937, 0.369614115020888, -0.39540927623043565, -0.21771766774829746, 0.13060841715035354, 0.18319744159832843, 0.09346233678142957, -0.009166688287826203, -0.22592276713208845, 0.04559852185437857, -0.17416582812261844, -0.13757594348573338, -0.02010070462839791, 0.054977753369436076, 0.06424187196390344, -0.2826941020189249, 0.14309771097836327, 0.06754260821504653, 0.04319937538885568, -0.04812595155283047, -0.061122408687286287, 0.004145150237526354, 0.14041567912893832, 0.10632301397600406, 0.024967511479089356, 0.15676280547921334, -0.11900771736908312, -0.05129956058612433, 0.38276668822197296, -0.029645527841636488, -0.20931062415159868, 0.12246689081927813, -0.13394687982090847, -0.11049775491955495, 0.1709240484900402, 0.18103170884034767, 0.11485894445654067, -0.1424281590962937, 0.05287292447309035, -0.05478473524794559, 0.14026085467422536, 0.04344452359039563, -0.016474675140163517, 0.16387562511761503, 0.1850604803201058, 0.10155652910541713, 0.1459688362707281, -0.10490418527434832, -0.12322891653851138, -0.32533627168599577, -0.15648746285690457, -0.21855289300708153, 0.07570875192439577, -0.11977962689530182, -0.20668079595477706, 0.38528167963727733, 0.1815845074636337, 0.1510738588236684, 0.06972792991231201, 0.3270944610485056, 0.16084910707820968, -0.028173361139536644, 0.08380540507310215, 0.22684999600532646, 0.11934203961323844, 0.12263742100269899, -0.228941577332331, 0.11761325957814427, 0.055044289296287116] |
1,802.01057 | Falconer's distance set problem via the wave equation | Falconer proved that there are sets $E\subset \mathbb{R}^n$ of Hausdorff
dimension $n/2$ whose distance sets $\{|x-y| : x,y\in E\}$ are null with
respect to Lebesgue measure. This led to the conjecture that distance sets have
positive Lebesgue measure as soon the Hausdorff dimension of $E$ is larger than
$n/2$. The best results in this direction have exploited estimates that
restrict the Fourier transform of measures to the $(n-1)$-dimensional sphere.
Here we show that these estimates can be replaced by estimates that restrict
the Fourier transform of measures to the $n$-dimensional cone. Such estimates
were first considered by Wolff in their adjoint form whereby they bound the
solution to the wave equation in terms of its initial data. The connection with
Falconer's problem, combined with Falconer's counterexample, provides a new
necessary condition for what was considered a plausible conjecture for these
estimates.
| math.CA | falconer proved that there are sets esubset mathbbrn of hausdorff dimension n2 whose distance sets xy xyin e are null with respect to lebesgue measure this led to the conjecture that distance sets have positive lebesgue measure as soon the hausdorff dimension of e is larger than n2 the best results in this direction have exploited estimates that restrict the fourier transform of measures to the n1dimensional sphere here we show that these estimates can be replaced by estimates that restrict the fourier transform of measures to the ndimensional cone such estimates were first considered by wolff in their adjoint form whereby they bound the solution to the wave equation in terms of its initial data the connection with falconers problem combined with falconers counterexample provides a new necessary condition for what was considered a plausible conjecture for these estimates | [['falconer', 'proved', 'that', 'there', 'are', 'sets', 'esubset', 'mathbbrn', 'of', 'hausdorff', 'dimension', 'n2', 'whose', 'distance', 'sets', 'xy', 'xyin', 'e', 'are', 'null', 'with', 'respect', 'to', 'lebesgue', 'measure', 'this', 'led', 'to', 'the', 'conjecture', 'that', 'distance', 'sets', 'have', 'positive', 'lebesgue', 'measure', 'as', 'soon', 'the', 'hausdorff', 'dimension', 'of', 'e', 'is', 'larger', 'than', 'n2', 'the', 'best', 'results', 'in', 'this', 'direction', 'have', 'exploited', 'estimates', 'that', 'restrict', 'the', 'fourier', 'transform', 'of', 'measures', 'to', 'the', 'n1dimensional', 'sphere', 'here', 'we', 'show', 'that', 'these', 'estimates', 'can', 'be', 'replaced', 'by', 'estimates', 'that', 'restrict', 'the', 'fourier', 'transform', 'of', 'measures', 'to', 'the', 'ndimensional', 'cone', 'such', 'estimates', 'were', 'first', 'considered', 'by', 'wolff', 'in', 'their', 'adjoint', 'form', 'whereby', 'they', 'bound', 'the', 'solution', 'to', 'the', 'wave', 'equation', 'in', 'terms', 'of', 'its', 'initial', 'data', 'the', 'connection', 'with', 'falconers', 'problem', 'combined', 'with', 'falconers', 'counterexample', 'provides', 'a', 'new', 'necessary', 'condition', 'for', 'what', 'was', 'considered', 'a', 'plausible', 'conjecture', 'for', 'these', 'estimates']] | [-0.11062351623882673, 0.10066264671373314, -0.09839096927483167, 0.1108913023648451, -0.06594508233081017, -0.14947870627511292, 0.02301895671906615, 0.3428834050228553, -0.26562767205759885, -0.20467413783813493, 0.13019589724135586, -0.325369099364616, -0.1133769150324432, 0.20698315271043352, -0.10629735893037702, 0.09721839803595296, 0.049724177592101376, 0.06599861674143799, -0.0704742409130891, -0.28547895718365907, 0.3534113531499835, -0.01897983107316707, 0.2243531383224763, 0.042549922157611164, 0.07715650518574486, -0.04061243126301893, -0.027607412137357252, 0.027338876512034663, -0.21158326838428496, 0.15516800657496788, 0.21457860300683285, 0.1544229901894661, 0.2623115355814142, -0.3818119155109993, -0.18862423282781882, 0.19592866244326745, 0.13604633829755974, -0.015766087919473648, -0.004346351598256401, -0.3126345895363816, 0.12427228355575477, -0.07919277564422893, -0.20544691670220344, -0.08613736596224564, 0.08623309046462445, 0.011213784438690968, -0.28837865014959657, 0.05975215767643281, 0.10106160038683032, 0.015401595598086714, -0.12027280687969844, -0.12101529505463467, -0.03454024073268686, 0.07910322523509551, 0.040424572801150915, 0.13053154960923297, 0.02939176796020807, -0.0018716634384223392, -0.11773889972828329, 0.35705552583759914, -0.06254998022559448, -0.29269199228812276, 0.1569357591082475, -0.21315063825542374, -0.11366569607718183, 0.09432475496682205, 0.10872393118417156, 0.10199476009833493, -0.11774917424523405, 0.1445595938263328, -0.11245473546389673, 0.10493837233100618, 0.13635092244616576, 0.048653789928981235, 0.10979644309596291, 0.06969365231260391, 0.17997927822039594, 0.12560896652035547, -0.047861162120742456, -0.015940475324168802, -0.31906971611481694, -0.1626884331352942, -0.24018153012231258, 0.10794850406101822, -0.12959571190710578, -0.1648683678026178, 0.2865644982134524, 0.1308932507281757, 0.18941599989442953, 0.10670014393316316, 0.2217658660906766, 0.13461576515193363, 0.03875764956797606, 0.06755064567883633, 0.2036821814054357, 0.16516752468222487, 0.02794107317126223, -0.13118539228536455, 0.04757932460135115, 0.15606214984519673] |
1,802.01058 | Tangent space formulation of the Multi-Configuration Time-Dependent
Hartree equations of motion: The projector-splitting algorithm revisited | The derivation of the time-dependent variational equations of the
Multi-Configuration Time-Dependent Hartree (MCTDH) method for high-dimensional
quantum propagation is revisited from the perspective of tangent space
projection methods. In this context, we focus on a recently introduced
algorithm [C. Lubich, Appl. Math. Res. eXpress 2015, 311 (2015), B. Kloss et
al., J. Chem. Phys. 146, 174107 (2017)] for the integration of the MCTDH
equations, which relies on a suitable splitting of the tangent space
projection. The new integrator circumvents the direct inversion of reduced
density matrices that appears in the standard method, by employing an auxiliary
set of non-orthogonal single-particle functions. Here, we formulate the new
algorithm and the underlying alternative form of the MCTDH equations in
conventional chemical physics notation, in a complementary fashion to the
tensor formalism used in the original work. Further, key features of the
integration scheme are highlighted.
| physics.chem-ph | the derivation of the timedependent variational equations of the multiconfiguration timedependent hartree mctdh method for highdimensional quantum propagation is revisited from the perspective of tangent space projection methods in this context we focus on a recently introduced algorithm c lubich appl math res express 2015 311 2015 b kloss et al j chem phys 146 174107 2017 for the integration of the mctdh equations which relies on a suitable splitting of the tangent space projection the new integrator circumvents the direct inversion of reduced density matrices that appears in the standard method by employing an auxiliary set of nonorthogonal singleparticle functions here we formulate the new algorithm and the underlying alternative form of the mctdh equations in conventional chemical physics notation in a complementary fashion to the tensor formalism used in the original work further key features of the integration scheme are highlighted | [['the', 'derivation', 'of', 'the', 'timedependent', 'variational', 'equations', 'of', 'the', 'multiconfiguration', 'timedependent', 'hartree', 'mctdh', 'method', 'for', 'highdimensional', 'quantum', 'propagation', 'is', 'revisited', 'from', 'the', 'perspective', 'of', 'tangent', 'space', 'projection', 'methods', 'in', 'this', 'context', 'we', 'focus', 'on', 'a', 'recently', 'introduced', 'algorithm', 'c', 'lubich', 'appl', 'math', 'res', 'express', '2015', '311', '2015', 'b', 'kloss', 'et', 'al', 'j', 'chem', 'phys', '146', '174107', '2017', 'for', 'the', 'integration', 'of', 'the', 'mctdh', 'equations', 'which', 'relies', 'on', 'a', 'suitable', 'splitting', 'of', 'the', 'tangent', 'space', 'projection', 'the', 'new', 'integrator', 'circumvents', 'the', 'direct', 'inversion', 'of', 'reduced', 'density', 'matrices', 'that', 'appears', 'in', 'the', 'standard', 'method', 'by', 'employing', 'an', 'auxiliary', 'set', 'of', 'nonorthogonal', 'singleparticle', 'functions', 'here', 'we', 'formulate', 'the', 'new', 'algorithm', 'and', 'the', 'underlying', 'alternative', 'form', 'of', 'the', 'mctdh', 'equations', 'in', 'conventional', 'chemical', 'physics', 'notation', 'in', 'a', 'complementary', 'fashion', 'to', 'the', 'tensor', 'formalism', 'used', 'in', 'the', 'original', 'work', 'further', 'key', 'features', 'of', 'the', 'integration', 'scheme', 'are', 'highlighted']] | [-0.07756327997714757, 0.026111847421435925, -0.07929668824538483, -0.005696356511205858, -0.07385407620380428, -0.09327390405897659, 0.04917623231217186, 0.3135074095483473, -0.24719711981304254, -0.2981950541073126, 0.014200584576564266, -0.19566719932481647, -0.19444834687111318, 0.1728469172743618, -0.050593423657119274, 0.09635009212875144, 0.05481930230810234, -0.0753785750121935, -0.13696224163352438, -0.2431836391061029, 0.28110030466684055, 0.07177001951470416, 0.3023064472336497, -0.01402469017668396, 0.13226606510084202, 0.07147130428265172, -0.0952302684796089, -0.02727005531695995, -0.1339978785330949, 0.1524418993004274, 0.2106739533999076, 0.11308694392416282, 0.30026052908060397, -0.41827078453588784, -0.21072900620890214, 0.016108906084790507, 0.08111614501764271, 0.1407371621392337, 0.006288810519184521, -0.3368749484124243, 0.009238151698422797, -0.18333578971049463, -0.12529341549057751, -0.12640144054396887, 0.041418304518261485, 0.0018074813972603768, -0.2895722637838083, 0.1151694521928827, 0.04263002230581028, 0.02902037737204145, -0.04831027437219436, -0.1544754490560145, 0.005800762072582036, -0.006435668895992034, -0.055065192788317535, 0.07182067350966605, 0.06246322040373446, -0.035004027978787926, -0.1409160763649468, 0.3734911306305452, -0.06111564946563994, -0.23574335115519188, 0.17665767048961145, -0.05088359796906927, -0.15358747893957592, 0.11467663652151294, 0.17587744315395937, 0.1614207320707084, -0.17134971125959583, 0.2041372980997594, -0.051328418522921276, 0.10384767458622232, 0.08011659417393888, -0.028563930127928232, 0.08476702904771247, 0.1204728708922011, 0.032235611104637595, 0.055219956992379, -0.08843536513481051, -0.16708999139740602, -0.31783067850158253, -0.21648851090178645, -0.22617990668228966, 0.05210409316412629, -0.03268051047651312, -0.1481594554815732, 0.39640214417471054, 0.16743093996526712, 0.15512594817815586, -0.02627227741957424, 0.2610766016663521, 0.17115210696771255, 0.007894585999752665, 0.12001280280173565, 0.22331277246203882, 0.19434511200161586, 0.12809390192917475, -0.2178225519386589, -0.02565643109764296, 0.16615804681283627] |
1,802.01059 | Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain
Features | Unsupervised learning of time series data, also known as temporal clustering,
is a challenging problem in machine learning. Here we propose a novel
algorithm, Deep Temporal Clustering (DTC), to naturally integrate
dimensionality reduction and temporal clustering into a single end-to-end
learning framework, fully unsupervised. The algorithm utilizes an autoencoder
for temporal dimensionality reduction and a novel temporal clustering layer for
cluster assignment. Then it jointly optimizes the clustering objective and the
dimensionality reduction objec tive. Based on requirement and application, the
temporal clustering layer can be customized with any temporal similarity
metric. Several similarity metrics and state-of-the-art algorithms are
considered and compared. To gain insight into temporal features that the
network has learned for its clustering, we apply a visualization method that
generates a region of interest heatmap for the time series. The viability of
the algorithm is demonstrated using time series data from diverse domains,
ranging from earthquakes to spacecraft sensor data. In each case, we show that
the proposed algorithm outperforms traditional methods. The superior
performance is attributed to the fully integrated temporal dimensionality
reduction and clustering criterion.
| cs.LG stat.ML | unsupervised learning of time series data also known as temporal clustering is a challenging problem in machine learning here we propose a novel algorithm deep temporal clustering dtc to naturally integrate dimensionality reduction and temporal clustering into a single endtoend learning framework fully unsupervised the algorithm utilizes an autoencoder for temporal dimensionality reduction and a novel temporal clustering layer for cluster assignment then it jointly optimizes the clustering objective and the dimensionality reduction objec tive based on requirement and application the temporal clustering layer can be customized with any temporal similarity metric several similarity metrics and stateoftheart algorithms are considered and compared to gain insight into temporal features that the network has learned for its clustering we apply a visualization method that generates a region of interest heatmap for the time series the viability of the algorithm is demonstrated using time series data from diverse domains ranging from earthquakes to spacecraft sensor data in each case we show that the proposed algorithm outperforms traditional methods the superior performance is attributed to the fully integrated temporal dimensionality reduction and clustering criterion | [['unsupervised', 'learning', 'of', 'time', 'series', 'data', 'also', 'known', 'as', 'temporal', 'clustering', 'is', 'a', 'challenging', 'problem', 'in', 'machine', 'learning', 'here', 'we', 'propose', 'a', 'novel', 'algorithm', 'deep', 'temporal', 'clustering', 'dtc', 'to', 'naturally', 'integrate', 'dimensionality', 'reduction', 'and', 'temporal', 'clustering', 'into', 'a', 'single', 'endtoend', 'learning', 'framework', 'fully', 'unsupervised', 'the', 'algorithm', 'utilizes', 'an', 'autoencoder', 'for', 'temporal', 'dimensionality', 'reduction', 'and', 'a', 'novel', 'temporal', 'clustering', 'layer', 'for', 'cluster', 'assignment', 'then', 'it', 'jointly', 'optimizes', 'the', 'clustering', 'objective', 'and', 'the', 'dimensionality', 'reduction', 'objec', 'tive', 'based', 'on', 'requirement', 'and', 'application', 'the', 'temporal', 'clustering', 'layer', 'can', 'be', 'customized', 'with', 'any', 'temporal', 'similarity', 'metric', 'several', 'similarity', 'metrics', 'and', 'stateoftheart', 'algorithms', 'are', 'considered', 'and', 'compared', 'to', 'gain', 'insight', 'into', 'temporal', 'features', 'that', 'the', 'network', 'has', 'learned', 'for', 'its', 'clustering', 'we', 'apply', 'a', 'visualization', 'method', 'that', 'generates', 'a', 'region', 'of', 'interest', 'heatmap', 'for', 'the', 'time', 'series', 'the', 'viability', 'of', 'the', 'algorithm', 'is', 'demonstrated', 'using', 'time', 'series', 'data', 'from', 'diverse', 'domains', 'ranging', 'from', 'earthquakes', 'to', 'spacecraft', 'sensor', 'data', 'in', 'each', 'case', 'we', 'show', 'that', 'the', 'proposed', 'algorithm', 'outperforms', 'traditional', 'methods', 'the', 'superior', 'performance', 'is', 'attributed', 'to', 'the', 'fully', 'integrated', 'temporal', 'dimensionality', 'reduction', 'and', 'clustering', 'criterion']] | [-0.041928523486583595, -0.034949231999457375, -0.13875915962271393, 0.07490346178787553, -0.130831189883045, -0.16166637156210426, 0.005762406167600097, 0.4742703075197318, -0.3270590727941857, -0.32107129393617573, 0.06240055303529112, -0.24777460736481266, -0.20332486406486067, 0.1664562976349973, -0.09041047611859135, 0.10680100590786121, 0.11001179341951178, 0.04395605099529752, -0.058934149708754074, -0.2642206537149226, 0.2826236766569006, 0.05840500498872846, 0.40770411543004836, -0.009913455982071658, 0.18318104984415792, 0.007679876938669218, -0.05448595707097815, 0.06111006514466782, -0.031887411202599955, 0.16520899077942078, 0.30559239491380547, 0.24389999071136118, 0.3432671826125847, -0.37350494124823147, -0.2755260211945925, 0.0827503262766792, 0.1802510881667129, 0.0905877782859736, -0.03373384583909582, -0.32118010299357896, 0.08368374740045208, -0.1450380245456472, 0.031640426248001556, -0.17708232432552096, -0.033950098143476576, -0.017871217908234233, -0.3033183621346123, 0.0779873853431329, 0.06990409325290885, 0.023915918201156374, -0.08824141704438565, -0.07925839362562531, 0.03765847335776521, 0.11712992215373864, 0.007371508110211127, 0.039137787203071636, 0.10850309229507628, -0.10203014635319252, -0.17476054755970835, 0.34294211759956345, -0.056693381999826264, -0.18404556412933742, 0.18959504136065436, 0.003863540097113906, -0.16921165012495798, 0.12225431394698616, 0.2631473930122512, 0.11157522331405845, -0.15152732651525488, 0.025369884343106403, 0.006625883845198486, 0.2224958058136205, 0.03553937034901335, 0.011611919956178302, 0.11625410420884792, 0.31156828650790785, 0.07450689392992192, 0.15050358705985772, -0.17232022550241607, -0.057567342831235796, -0.18630269260352683, -0.10384283174062148, -0.21035567494885374, -0.06680015634434919, -0.1841571941869107, -0.13465055644822618, 0.418748509304391, 0.20400843043138997, 0.23857280612767984, 0.10652030427526268, 0.3597366430175801, 0.07087416652421881, 0.1051039277912221, 0.08295718762350993, 0.1468747377770746, 0.04353560250407706, 0.1366589075135481, -0.2064460227938576, 0.0757172221925834, 0.08163298941346714] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.