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.1056 | Novelty Detection with GAN | The ability of a classifier to recognize unknown inputs is important for many
classification-based systems. We discuss the problem of simultaneous
classification and novelty detection, i.e. determining whether an input is from
the known set of classes and from which specific class, or from an unknown
domain and does not belong to any of the known classes. We propose a method
based on the Generative Adversarial Networks (GAN) framework. We show that a
multi-class discriminator trained with a generator that generates samples from
a mixture of nominal and novel data distributions is the optimal novelty
detector. We approximate that generator with a mixture generator trained with
the Feature Matching loss and empirically show that the proposed method
outperforms conventional methods for novelty detection. Our findings
demonstrate a simple, yet powerful new application of the GAN framework for the
task of novelty detection.
| cs.CV | the ability of a classifier to recognize unknown inputs is important for many classificationbased systems we discuss the problem of simultaneous classification and novelty detection ie determining whether an input is from the known set of classes and from which specific class or from an unknown domain and does not belong to any of the known classes we propose a method based on the generative adversarial networks gan framework we show that a multiclass discriminator trained with a generator that generates samples from a mixture of nominal and novel data distributions is the optimal novelty detector we approximate that generator with a mixture generator trained with the feature matching loss and empirically show that the proposed method outperforms conventional methods for novelty detection our findings demonstrate a simple yet powerful new application of the gan framework for the task of novelty detection | [['the', 'ability', 'of', 'a', 'classifier', 'to', 'recognize', 'unknown', 'inputs', 'is', 'important', 'for', 'many', 'classificationbased', 'systems', 'we', 'discuss', 'the', 'problem', 'of', 'simultaneous', 'classification', 'and', 'novelty', 'detection', 'ie', 'determining', 'whether', 'an', 'input', 'is', 'from', 'the', 'known', 'set', 'of', 'classes', 'and', 'from', 'which', 'specific', 'class', 'or', 'from', 'an', 'unknown', 'domain', 'and', 'does', 'not', 'belong', 'to', 'any', 'of', 'the', 'known', 'classes', 'we', 'propose', 'a', 'method', 'based', 'on', 'the', 'generative', 'adversarial', 'networks', 'gan', 'framework', 'we', 'show', 'that', 'a', 'multiclass', 'discriminator', 'trained', 'with', 'a', 'generator', 'that', 'generates', 'samples', 'from', 'a', 'mixture', 'of', 'nominal', 'and', 'novel', 'data', 'distributions', 'is', 'the', 'optimal', 'novelty', 'detector', 'we', 'approximate', 'that', 'generator', 'with', 'a', 'mixture', 'generator', 'trained', 'with', 'the', 'feature', 'matching', 'loss', 'and', 'empirically', 'show', 'that', 'the', 'proposed', 'method', 'outperforms', 'conventional', 'methods', 'for', 'novelty', 'detection', 'our', 'findings', 'demonstrate', 'a', 'simple', 'yet', 'powerful', 'new', 'application', 'of', 'the', 'gan', 'framework', 'for', 'the', 'task', 'of', 'novelty', 'detection']] | [-0.00019423343228097532, -0.02035987280570725, -0.05878446322642791, 0.06240279203146355, -0.10644652060902035, -0.1668715186180993, 0.03796952813994926, 0.4227729835088404, -0.2665975713925305, -0.32536356820082163, 0.0673032905660491, -0.261386785400428, -0.22474523153792228, 0.21019403401442105, -0.13044262452552777, 0.09415138032759579, 0.10801961403407224, 0.08047006897215114, -0.060724799914783995, -0.2227858643729607, 0.36284852002970347, 0.008678954356992749, 0.3573561298665443, -0.0002517833761398641, 0.18595883425761303, -0.010681420794202827, -0.004886420072272787, -0.016559886116482004, -0.04192108219070524, 0.16552887378755668, 0.2513322712309186, 0.20828803213851027, 0.2961288242974699, -0.3431805242771204, -0.23974764116869215, 0.12784721651672004, 0.08772498867015394, 0.14018744956882356, -0.09499305197608356, -0.31244004132803266, 0.12680369665400243, -0.16138737280787507, -0.026842150674857408, -0.09549289067525049, -0.039986579016533116, 0.008088473581895888, -0.3550475887252464, 0.01623691821431505, 0.12974931495768366, -0.003801432923531868, -0.06992050253254899, -0.11418514968958539, 0.02536955275441664, 0.12544964129452815, 0.010833333723548748, 0.03469773595103286, 0.10254671156052238, -0.15175512571110797, -0.1702132788749123, 0.342075473917517, -0.07708595454378027, -0.2180003260764864, 0.2208447167961399, -0.043305962772803824, -0.1459552490178653, 0.1025393715810398, 0.23572917118616088, 0.18030996170078575, -0.16038946428952713, 0.01592621001747804, -0.05528084384146291, 0.2093391103774939, -0.01877495553344488, -0.026352770403552224, 0.16694199453553998, 0.2542083133241608, 0.043141275614378714, 0.18162110121920705, -0.14824903468293152, -0.03637956604230362, -0.2964536532444853, -0.11010525915378207, -0.24207098170636143, -0.013778181557939553, -0.05773132679355577, -0.18301918805891673, 0.4190519743559646, 0.22017544988080823, 0.23608731122156212, 0.11742214096995385, 0.31240493269033837, 0.040167645157850186, 0.09564462201145123, 0.11442136107640616, 0.18332491837717382, 0.039417553260187865, 0.016949337868603656, -0.17321341630058285, 0.12628846950697856, 0.050828359617759854] |
1,802.10561 | Entropy ratio for infinite sequences with positive entropy | The complexity function of an infinite word $w$ on a finite alphabet $A$ is
the sequence counting, for each non-negative $n$, the number of words of length
$n$ on the alphabet $A$ that are factors of the infinite word $w$. For any
given function $f$ with exponential growth, we introduced in [MM17] the notion
of {\it word entropy} $E_W(f)$ associated to $f$ and we described the
combinatorial structure of sets of infinite words with a complexity function
bounded by $f$. The goal of this work is to give estimates on the word entropy
$E_W(f)$ in terms of the limiting lower exponential growth rate of $f$.
| math.DS | the complexity function of an infinite word w on a finite alphabet a is the sequence counting for each nonnegative n the number of words of length n on the alphabet a that are factors of the infinite word w for any given function f with exponential growth we introduced in mm17 the notion of it word entropy e_wf associated to f and we described the combinatorial structure of sets of infinite words with a complexity function bounded by f the goal of this work is to give estimates on the word entropy e_wf in terms of the limiting lower exponential growth rate of f | [['the', 'complexity', 'function', 'of', 'an', 'infinite', 'word', 'w', 'on', 'a', 'finite', 'alphabet', 'a', 'is', 'the', 'sequence', 'counting', 'for', 'each', 'nonnegative', 'n', 'the', 'number', 'of', 'words', 'of', 'length', 'n', 'on', 'the', 'alphabet', 'a', 'that', 'are', 'factors', 'of', 'the', 'infinite', 'word', 'w', 'for', 'any', 'given', 'function', 'f', 'with', 'exponential', 'growth', 'we', 'introduced', 'in', 'mm17', 'the', 'notion', 'of', 'it', 'word', 'entropy', 'e_wf', 'associated', 'to', 'f', 'and', 'we', 'described', 'the', 'combinatorial', 'structure', 'of', 'sets', 'of', 'infinite', 'words', 'with', 'a', 'complexity', 'function', 'bounded', 'by', 'f', 'the', 'goal', 'of', 'this', 'work', 'is', 'to', 'give', 'estimates', 'on', 'the', 'word', 'entropy', 'e_wf', 'in', 'terms', 'of', 'the', 'limiting', 'lower', 'exponential', 'growth', 'rate', 'of', 'f']] | [-0.15058476275477845, 0.15679324007844395, -0.051300840416493326, 0.06272218948288355, -0.050029943083735325, -0.08516280960219984, 0.10035384796635928, 0.3083516800185092, -0.33091876180752966, -0.2415717152851777, 0.05277623273454642, -0.2913192374846683, -0.09234711875727114, 0.19652238702334357, -0.0885757882721149, 0.09084973959453727, 0.01840010237020369, 0.17056766250439417, -0.07069762706942129, -0.3305920481731076, 0.3417722551384941, 0.0010779409651429607, 0.2221813251156933, 0.012391855138748024, 0.13561919941835535, -0.0025334478817127934, -0.04749073631291349, -0.01077008604680976, -0.19303256771427885, 0.14603981522332804, 0.25199138885363936, 0.17095664541613168, 0.3124964515199491, -0.31502314913086593, -0.1718520395269689, 0.176859445637092, 0.13187527480700878, 0.04851772052307542, -0.013342424715609433, -0.21009503978376204, 0.14348321773846132, -0.17680385513925173, -0.07225392782577099, 0.04403445969980497, 0.11437036288687243, 0.06170941135832646, -0.2664171785699392, 0.02868713672237041, 0.1480366390493985, 0.052067957272251636, -0.043770938113224335, -0.1292884387478877, 0.003727160416579304, 0.09589701447671709, 0.041971622549821265, 0.09248980728443712, 0.05367069301428273, -0.1168200331449043, -0.12198628015959492, 0.3153095175601685, -0.1238874777739581, -0.29455019977803415, 0.13607773536261028, -0.1663514991837124, -0.11859227410213162, 0.12279490728038721, 0.1519777643530128, 0.09282217593863606, -0.044577683161500875, 0.18679917948786448, -0.10509898098937881, 0.21084418373021224, 0.13145161140262365, 0.05625084385974333, 0.09728343097510962, 0.13728080177679658, 0.07379968636758769, 0.19868310450468785, 0.021122370373632293, -0.0008967773845562568, -0.33288010032489324, -0.16656851883117968, -0.23527432609206209, 0.08297341042914642, -0.16587388610381681, -0.26651205444851744, 0.3819871708535804, 0.04967374476389243, 0.2372759296111046, 0.16464750930810204, 0.2046453710399174, 0.16189726763584006, 0.041415163911341764, 0.06198820985152382, 0.02740114994454556, 0.13115948111450193, -0.018807010263956796, -0.22393279508329356, 0.12402708695019381, 0.18279674105262808] |
1,802.10562 | Splitting of integer polynomials over fields of prime order | It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree
$d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We
prove in this paper the existence of infinitely many primes $q$ so that the
given polynomial $\phi$(X) splits into exactly $d$ linear factors in
$\mathbb{F}_q$ by using only elementary results in field theory and some
elementary number theory by proving that $\phi$ splits in $\mathbb{F}_q$ iff
$P$ has a root in $\mathbb{F}_q$ for all sufficiently large primes $q$, where
$P\in \mathbb{Z}[X]$ is any polynomial such that $P$ has a root $\beta \in
\mathbb{C}$ for which $\mathbb{Q}(\beta)$ is the splitting field of $\phi$ over
$\mathbb{Q}$. Furthermore, we prove that any such $P$ splits in $\mathbb{F}_r$
iff it has a root in $\mathbb{F}_r$, for all sufficiently large primes $r$.
Existence of infinitely many such $P$ for any given $\phi$ is also proven.
| math.NT | it is well known that a polynomial phixin mathbbzx of given degree d factors into at most d factors in mathbbf_p for any prime p we prove in this paper the existence of infinitely many primes q so that the given polynomial phix splits into exactly d linear factors in mathbbf_q by using only elementary results in field theory and some elementary number theory by proving that phi splits in mathbbf_q iff p has a root in mathbbf_q for all sufficiently large primes q where pin mathbbzx is any polynomial such that p has a root beta in mathbbc for which mathbbqbeta is the splitting field of phi over mathbbq furthermore we prove that any such p splits in mathbbf_r iff it has a root in mathbbf_r for all sufficiently large primes r existence of infinitely many such p for any given phi is also proven | [['it', 'is', 'well', 'known', 'that', 'a', 'polynomial', 'phixin', 'mathbbzx', 'of', 'given', 'degree', 'd', 'factors', 'into', 'at', 'most', 'd', 'factors', 'in', 'mathbbf_p', 'for', 'any', 'prime', 'p', 'we', 'prove', 'in', 'this', 'paper', 'the', 'existence', 'of', 'infinitely', 'many', 'primes', 'q', 'so', 'that', 'the', 'given', 'polynomial', 'phix', 'splits', 'into', 'exactly', 'd', 'linear', 'factors', 'in', 'mathbbf_q', 'by', 'using', 'only', 'elementary', 'results', 'in', 'field', 'theory', 'and', 'some', 'elementary', 'number', 'theory', 'by', 'proving', 'that', 'phi', 'splits', 'in', 'mathbbf_q', 'iff', 'p', 'has', 'a', 'root', 'in', 'mathbbf_q', 'for', 'all', 'sufficiently', 'large', 'primes', 'q', 'where', 'pin', 'mathbbzx', 'is', 'any', 'polynomial', 'such', 'that', 'p', 'has', 'a', 'root', 'beta', 'in', 'mathbbc', 'for', 'which', 'mathbbqbeta', 'is', 'the', 'splitting', 'field', 'of', 'phi', 'over', 'mathbbq', 'furthermore', 'we', 'prove', 'that', 'any', 'such', 'p', 'splits', 'in', 'mathbbf_r', 'iff', 'it', 'has', 'a', 'root', 'in', 'mathbbf_r', 'for', 'all', 'sufficiently', 'large', 'primes', 'r', 'existence', 'of', 'infinitely', 'many', 'such', 'p', 'for', 'any', 'given', 'phi', 'is', 'also', 'proven']] | [-0.23675643232944485, 0.1554395969963492, -0.11287544041629625, 0.026121789011434485, -0.01683077393920952, -0.20431005108897407, -0.03812938805251727, 0.29403031207876257, -0.336755934781363, -0.19063163061039395, 0.004739650267603718, -0.26671532456673785, -0.13105971381875164, 0.21370448127439987, -0.03433523028259714, 0.022196618654312286, 0.005140044388348517, 0.178939137110257, -0.01323689548585768, -0.3390256972761812, 0.2950684731022442, -0.12291773536867678, 0.12564276388450846, 0.06398063905741254, 0.10504729440435767, 0.04974980984036237, 0.08300070831080107, 0.01326107002845774, -0.14733965082492956, 0.0062882029778349585, 0.3597824446624145, 0.1441704775111061, 0.3149071041469092, -0.3380986437750087, -0.13516785172515944, 0.26605778115511275, 0.20473927912168358, -0.02265424777399621, -0.019911052030830146, -0.16077738754731946, 0.22607019056617092, -0.15259017145880321, -0.1581183644553825, -0.07066165953587536, 0.18835902012954786, 0.04380209534429014, -0.3526861624256389, -0.03859614350770007, 0.1367644728679682, 0.14686603884193536, -0.001574566386869713, -0.2204928070064379, 0.03482669063250547, 0.046895766381990826, 0.03010829796453249, 0.12574582928408906, -0.005327757157717054, -0.11004039207122557, -0.06775244563971072, 0.35709530015616386, -0.05220377567855718, -0.22065769641162597, 0.06978146469201382, -0.22117358203084297, -0.18108855738234386, 0.15887800096980717, 0.09534389378936732, 0.10344230756163597, 0.001993553712964058, 0.2895530062302634, -0.16849445977745808, 0.1671753493743655, 0.1519587148580547, -0.02495552726370627, 0.10807550507151101, 0.014802022728660744, 0.07826810100471461, 0.09041602182846312, 0.011790208856587948, 0.025098794643856483, -0.39319893758590907, -0.1600640389226275, -0.19023235346216943, 0.15503553358506258, -0.11378132296103764, -0.15815197656645555, 0.34360036699177876, 0.05075411457083609, 0.18574074304292668, 0.09025808853457669, 0.22613378553587485, 0.0977964088741741, 0.08568734517926987, 0.12645521731600676, 0.06756211524890665, 0.13561744661682784, -0.066828257051035, -0.1284011416105324, 0.03981968232634643, 0.11400902900551382] |
1,802.10563 | Marstrand type projection theorems for normed spaces | We consider Marstrand type projection theorems for closest-point projections
in the normed space $\mathbb{R}^2$. We prove that if a norm on $\mathbb{R}^2$
is regular enough, then the analogues of the well-known statements from the
Euclidean setting hold, while they fail for norms whose unit balls have
corners. We establish our results by verifying Peres and Schlag's
transversality property and thereby also obtain a Besicovitch-Federer type
characterization of purely unrectifiable sets.
| math.MG | we consider marstrand type projection theorems for closestpoint projections in the normed space mathbbr2 we prove that if a norm on mathbbr2 is regular enough then the analogues of the wellknown statements from the euclidean setting hold while they fail for norms whose unit balls have corners we establish our results by verifying peres and schlags transversality property and thereby also obtain a besicovitchfederer type characterization of purely unrectifiable sets | [['we', 'consider', 'marstrand', 'type', 'projection', 'theorems', 'for', 'closestpoint', 'projections', 'in', 'the', 'normed', 'space', 'mathbbr2', 'we', 'prove', 'that', 'if', 'a', 'norm', 'on', 'mathbbr2', 'is', 'regular', 'enough', 'then', 'the', 'analogues', 'of', 'the', 'wellknown', 'statements', 'from', 'the', 'euclidean', 'setting', 'hold', 'while', 'they', 'fail', 'for', 'norms', 'whose', 'unit', 'balls', 'have', 'corners', 'we', 'establish', 'our', 'results', 'by', 'verifying', 'peres', 'and', 'schlags', 'transversality', 'property', 'and', 'thereby', 'also', 'obtain', 'a', 'besicovitchfederer', 'type', 'characterization', 'of', 'purely', 'unrectifiable', 'sets']] | [-0.08048147210628605, 0.05360477067449171, -0.09065834979865821, 0.13596360174351899, -0.04718317230488511, -0.12312545401948517, 0.03982923834658889, 0.34529856700396194, -0.28871675793999346, -0.13914099615742115, 0.19502493228756593, -0.2868772580058894, -0.11995899528804896, 0.21199940082252675, -0.16824105182203694, 0.04507906900793044, 0.08018746491575586, 0.03318240007628565, -0.09280952898130847, -0.28815752260076505, 0.3778970189244095, -0.1243433601162194, 0.23210010114733293, 0.0503621659093145, 0.08132715615700337, 0.063875544404584, -0.0006556894184778566, 0.04767143566699604, -0.20890894192458634, 0.12747070007701067, 0.2161424973493685, 0.13766453871705933, 0.25899928982329107, -0.415438923039946, -0.16217558734132437, 0.21484063763468378, 0.10710810951591618, -0.0046371142076247415, -0.03793921067710102, -0.31249422949833283, 0.12280639445584646, -0.022431289051672902, -0.1965564698709742, -0.13625916193468848, 0.030585638564619898, 0.04511982925570286, -0.29069734164986055, 0.021573983540714624, 0.21594422723612058, 0.046417117753214596, -0.11393071621305485, -0.08220800306594027, 0.014096160922064513, 0.0721603826471213, -0.018209078091034746, 0.04804204636509868, 0.03939493195545198, 0.012165721640854643, -0.13895615490754068, 0.34574022613789723, -0.008360799820418808, -0.2805355040329522, 0.17801151223956485, -0.19595407503589557, -0.15393605233723487, 0.04615113657453786, 0.10728524237925159, 0.12249280461042687, -0.06219939850743158, 0.19958822809638915, -0.1486704297552722, 0.06461369487173531, 0.1565208737400995, 0.07968592782423872, 0.09836096370565718, 0.05311329761752859, 0.16896866749553685, 0.14820082319994876, -0.006856299002074461, -0.0598839308216196, -0.3549323006570204, -0.16989522804236173, -0.17625145871948072, 0.11267466027883516, -0.13152083410312881, -0.18240584470871565, 0.28958620691833936, 0.06931607235067834, 0.20515096604662098, 0.1726353364672674, 0.2164997726516879, 0.0524889998951171, 0.038619641106629715, 0.09118695964064935, 0.1872259176781644, 0.1882090040421842, 0.042198348213392106, -0.07400947275733494, 0.018459128215909004, 0.2425641683942598] |
1,802.10564 | Evaluation of an Integral | The Moll-Arias de Reyna integral [1]
$$\int_0^{\infty}\frac{dx}{(x^2+1)^{3/2}}\frac{1}{\sqrt{\varphi(x)+\sqrt{\varphi(x)}}}$$
$$\varphi(x)=1+\frac{4}{3}\left(\frac{x}{x^2+1}\right)^2$$ is generalised and
several values are given.
| math.CA | the mollarias de reyna integral 1 int_0inftyfracdxx2132frac1sqrtvarphixsqrtvarphix varphix1frac43leftfracxx21right2 is generalised and several values are given | [['the', 'mollarias', 'de', 'reyna', 'integral', '1', 'int_0inftyfracdxx2132frac1sqrtvarphixsqrtvarphix', 'varphix1frac43leftfracxx21right2', 'is', 'generalised', 'and', 'several', 'values', 'are', 'given']] | [-0.18206001290430626, 0.1318400107945005, -0.10117083904333413, 0.12956944361212663, -0.12514555163215846, -0.09801456735779841, -0.1847309684380889, 0.29433632642030716, -0.19055634240309396, -0.3248864859342575, 0.195703963128229, -0.3119018040597439, -0.12261172073582809, 0.2554111698021491, -0.07432635718335708, 0.03558454161126671, -0.06290477118454874, 0.0534383860649541, -0.024689037430410583, -0.28147321691115695, 0.36128229772051174, 0.02271489449776709, 0.19539876476240656, -0.019724050847192604, 0.14963825171192488, 0.012788882517876724, -0.04878605855628848, 0.005301377425591151, -0.21823189531763396, 0.11339818526175804, 0.23954732064157724, 0.11791634125014146, 0.25300633162260056, -0.28001673069472116, -0.12418044017006953, 0.14288754970766604, 0.0669442161063974, 0.04836942053710421, 0.0467584653912733, -0.30005860363598913, 0.1119403465030094, -0.17092395666986704, -0.09888208975705008, -0.04352585691958666, 0.03680714343984922, 0.10298667002158861, -0.25565064139664173, 0.04325036207834879, -0.009173681338628134, 0.013741356320679188, -0.12215684117594112, -0.24479243904352188, 0.011651387438178062, 0.07468006076912086, -0.04821119839713598, 0.04927636477320144, 0.050585639740650855, -0.03714798491758605, -0.0974211433591942, 0.27607291378080845, -0.05764469364657998, -0.22338453276703754, 0.12032283089744548, -0.12252130957009892, -0.17386096137731025, 0.13199234132965407, -0.10236009280197322, 0.14828647238512835, -0.06229738836797575, 0.21504972327481178, 0.0010480231915911038, 0.03345874208025634, 0.1861507425783202, -0.06406652616957824, 0.11101031272361676, 0.01338164679085215, -0.008106230719325444, 0.014930073792735735, -0.10107894148677588, -0.13782644116630158, -0.33897131960839033, -0.22495727396259704, -0.16651501397912702, 0.027410517213866115, -0.15597908225875776, -0.1386284145216147, 0.2804464733538528, 0.04560112161561847, 0.21201548616712293, 0.0893674964706103, 0.1448844315794607, 0.18517436156980693, -0.014691059788068136, 0.051835318988499544, 0.1394098475575447, 0.12310210630918543, 0.10632584771762292, -0.12564463172263154, -0.029966860078275204, 0.13728540732214847] |
1,802.10565 | An illumination effect and an eccentric orbit for the symbiotic binary
PU Vul revealed by 32 years of optical spectroscopy | We analyze $\sim$32 years of optical spectra and photometry for the symbiotic
binary PU Vul. Light curves for the He I $\lambda$4471, He II $\lambda$4686 and
H$\beta$ $\lambda$4861 emission lines reveal an illumination effect, where the
hot white dwarf ionizes the outflowing wind of the red giant, and evidence for
an eccentric orbit with e $\approx$ 0.16. Along with the gradual appearance of
high ionization emission from [Fe VII] and O VI, the relative fluxes of these
lines suggest an increase in the effective temperature of the hot component,
from roughly $10^5$ K on JD 2448000 (1990) to roughly $2\times 10^5$ K on JD
2455000 (2009). During this period, the luminosity of the hot component dropped
by a factor of 4$-$6 to a current value of roughly 1000 L$_{\odot}$.
| astro-ph.SR | we analyze sim32 years of optical spectra and photometry for the symbiotic binary pu vul light curves for the he i lambda4471 he ii lambda4686 and hbeta lambda4861 emission lines reveal an illumination effect where the hot white dwarf ionizes the outflowing wind of the red giant and evidence for an eccentric orbit with e approx 016 along with the gradual appearance of high ionization emission from fe vii and o vi the relative fluxes of these lines suggest an increase in the effective temperature of the hot component from roughly 105 k on jd 2448000 1990 to roughly 2times 105 k on jd 2455000 2009 during this period the luminosity of the hot component dropped by a factor of 46 to a current value of roughly 1000 l_odot | [['we', 'analyze', 'sim32', 'years', 'of', 'optical', 'spectra', 'and', 'photometry', 'for', 'the', 'symbiotic', 'binary', 'pu', 'vul', 'light', 'curves', 'for', 'the', 'he', 'i', 'lambda4471', 'he', 'ii', 'lambda4686', 'and', 'hbeta', 'lambda4861', 'emission', 'lines', 'reveal', 'an', 'illumination', 'effect', 'where', 'the', 'hot', 'white', 'dwarf', 'ionizes', 'the', 'outflowing', 'wind', 'of', 'the', 'red', 'giant', 'and', 'evidence', 'for', 'an', 'eccentric', 'orbit', 'with', 'e', 'approx', '016', 'along', 'with', 'the', 'gradual', 'appearance', 'of', 'high', 'ionization', 'emission', 'from', 'fe', 'vii', 'and', 'o', 'vi', 'the', 'relative', 'fluxes', 'of', 'these', 'lines', 'suggest', 'an', 'increase', 'in', 'the', 'effective', 'temperature', 'of', 'the', 'hot', 'component', 'from', 'roughly', '105', 'k', 'on', 'jd', '2448000', '1990', 'to', 'roughly', '2times', '105', 'k', 'on', 'jd', '2455000', '2009', 'during', 'this', 'period', 'the', 'luminosity', 'of', 'the', 'hot', 'component', 'dropped', 'by', 'a', 'factor', 'of', '46', 'to', 'a', 'current', 'value', 'of', 'roughly', '1000', 'l_odot']] | [-0.05101803771033883, 0.1256762868332444, 0.006753375244526978, 0.012141399740241468, -0.02705026888474822, -0.11523576240614057, 0.11658557677268983, 0.4199906769096851, -0.170159748069942, -0.35944166032969954, 0.04277840696554631, -0.3543305556103587, 0.0029845710415393116, 0.17428570144623518, -0.0701687439084053, -0.09797361151129007, 0.05727168710529804, -0.05800872395047918, -0.06515533133223653, -0.2519173431826639, 0.2552845045477152, 0.06699716863641515, 0.14583400654792786, 0.006849971000105142, 0.03855549408867955, -0.06034071959555149, -0.03708014596370049, -0.07189443203806876, -0.11174408363737166, 0.05481270066648722, 0.18011499850451945, 0.13866466076590586, 0.19070583131164312, -0.3288835867866874, -0.19438845592690632, 0.027961516794515775, 0.14378855424374343, -0.023523929549381137, -0.0010570484669879079, -0.253889111106284, 0.023131428690161555, -0.18474437610246242, -0.14134553227201105, 0.11274124393006786, 0.17083964677900076, 0.008301015771925449, -0.253097551882267, 0.10533044049772435, 0.07147667678102153, 0.14748142617940901, -0.09863862309604883, -0.1331428563669324, -0.07668733322992921, -0.023570290707051755, 0.03499888263642788, 0.07474736240319908, 0.14649938238039611, -0.07928108173422516, -0.0037380156875588, 0.3716595162120648, -0.18568328867480158, 0.12952304933499545, 0.2015906263180077, -0.17217793989926578, -0.10460096806287765, 0.28485432352125645, 0.13468755707517266, 0.13204384836740793, -0.10602805997245014, -0.01584530515410006, 0.0006139074938837439, 0.213988721575588, 0.046801427602767946, 0.03330009461194277, 0.3165076768323779, 0.05186383739858866, 0.004442667482420802, 0.0424413288589567, -0.27725453188642857, 0.0011028558686375619, -0.2376408005915582, -0.13945270368270576, -0.08976949730888009, 0.14035129273310304, -0.1304252692745067, -0.11772239571809769, 0.36399361580610273, 0.08271713155508041, 0.2839416705146432, -0.03684681449085474, 0.2640530470497906, 0.14305724856071175, 0.022272365513839758, 0.18512123031914235, 0.3107680597305298, 0.22172148356726393, 0.1373330288156867, -0.27375119051709773, 0.0334902619458735, 0.005403941921889782] |
1,802.10566 | Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner
Network | We consider the Shallow-Light Steiner Network problem from a fixed-parameter
perspective. Given a graph $G$, a distance bound $L$, and $p$ pairs of vertices
$(s_1,t_1),\cdots,(s_p,t_p)$, the objective is to find a minimum-cost subgraph
$G'$ such that $s_i$ and $t_i$ have distance at most $L$ in $G'$ (for every $i
\in [p]$). Our main result is on the fixed-parameter tractability of this
problem with parameter $p$. We exactly characterize the demand structures that
make the problem "easy", and give FPT algorithms for those cases. In all other
cases, we show that the problem is W$[1]$-hard. We also extend our results to
handle general edge lengths and costs, precisely characterizing which demands
allow for good FPT approximation algorithms and which demands remain
W$[1]$-hard even to approximate.
| cs.DS | we consider the shallowlight steiner network problem from a fixedparameter perspective given a graph g a distance bound l and p pairs of vertices s_1t_1cdotss_pt_p the objective is to find a minimumcost subgraph g such that s_i and t_i have distance at most l in g for every i in p our main result is on the fixedparameter tractability of this problem with parameter p we exactly characterize the demand structures that make the problem easy and give fpt algorithms for those cases in all other cases we show that the problem is w1hard we also extend our results to handle general edge lengths and costs precisely characterizing which demands allow for good fpt approximation algorithms and which demands remain w1hard even to approximate | [['we', 'consider', 'the', 'shallowlight', 'steiner', 'network', 'problem', 'from', 'a', 'fixedparameter', 'perspective', 'given', 'a', 'graph', 'g', 'a', 'distance', 'bound', 'l', 'and', 'p', 'pairs', 'of', 'vertices', 's_1t_1cdotss_pt_p', 'the', 'objective', 'is', 'to', 'find', 'a', 'minimumcost', 'subgraph', 'g', 'such', 'that', 's_i', 'and', 't_i', 'have', 'distance', 'at', 'most', 'l', 'in', 'g', 'for', 'every', 'i', 'in', 'p', 'our', 'main', 'result', 'is', 'on', 'the', 'fixedparameter', 'tractability', 'of', 'this', 'problem', 'with', 'parameter', 'p', 'we', 'exactly', 'characterize', 'the', 'demand', 'structures', 'that', 'make', 'the', 'problem', 'easy', 'and', 'give', 'fpt', 'algorithms', 'for', 'those', 'cases', 'in', 'all', 'other', 'cases', 'we', 'show', 'that', 'the', 'problem', 'is', 'w1hard', 'we', 'also', 'extend', 'our', 'results', 'to', 'handle', 'general', 'edge', 'lengths', 'and', 'costs', 'precisely', 'characterizing', 'which', 'demands', 'allow', 'for', 'good', 'fpt', 'approximation', 'algorithms', 'and', 'which', 'demands', 'remain', 'w1hard', 'even', 'to', 'approximate']] | [-0.16644598343561032, 0.054582646841607324, -0.025053407198075597, 0.07931746310191001, -0.1294683627935687, -0.2096746536804651, 0.10422089596362255, 0.4176117109392232, -0.32392174929732503, -0.3259972640411641, 0.05709033536940541, -0.2875254381205735, -0.15024507610596777, 0.16793350224776904, -0.08596845951529478, 0.06972787357825119, 0.1356410112779027, 0.05778577672961221, 0.00043441638032474167, -0.29325452245458605, 0.29247790524296885, -0.03337508500591526, 0.16465197025033518, 0.09693436403342379, 0.038467175364153595, 0.032400808183521757, 0.02456674100528282, 0.09675469140190801, -0.22176779859136872, 0.06527934549376369, 0.33932460329639236, 0.17919573088259838, 0.2637861404204514, -0.38048660363202225, -0.1450924941497605, 0.2179539542062193, 0.10770239183921518, 0.06641086206839579, 0.038723503764741485, -0.18569349256775727, 0.10034691726947885, -0.08982534924658334, -0.09045142243517851, -0.011259020366743812, 0.13452255428670262, -0.006839891009759612, -0.3146774463537263, -0.008379912093079202, 0.11526695002869862, -0.034035138740881946, 0.008194963531038626, -0.18427651964139374, 0.029703234034643426, 0.08674259848014368, -0.01595712134641088, 0.10225582133781741, 0.027214042716981406, -0.11363329042158113, -0.151315104110333, 0.3955201205865639, 0.01290208658362489, -0.17855258100491955, 0.13061193831840423, -0.10164918915966784, -0.21946907682132308, 0.09677263449241476, 0.13738394842096946, 0.1700997540833262, -0.08412225383174855, 0.14849449166927745, -0.10333995851195925, 0.0916378130280693, 0.08543666018877269, -0.005998989729597839, 0.0964817888088282, 0.13411332961035574, 0.20462662122795375, 0.17147194932080517, 0.008066798198771307, 0.008255546679720283, -0.2896983598442218, -0.07384864151396418, -0.18829747961126117, 0.006282355352418452, -0.13949019286146944, -0.1518268565253574, 0.3586707867878845, 0.17915614886678816, 0.21896893235455395, 0.17607177235375393, 0.271631323251631, 0.08319208511847972, 0.0005873568030452825, 0.22236467294803844, 0.14531291145888134, 0.10748831740754648, -0.0013248141991292557, -0.2055552432491497, 0.09532987679794007, 0.08479271875694394] |
1,802.10567 | Learning by Playing - Solving Sparse Reward Tasks from Scratch | We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in
the context of Reinforcement Learning (RL). SAC-X enables learning of complex
behaviors - from scratch - in the presence of multiple sparse reward signals.
To this end, the agent is equipped with a set of general auxiliary tasks, that
it attempts to learn simultaneously via off-policy RL. The key idea behind our
method is that active (learned) scheduling and execution of auxiliary policies
allows the agent to efficiently explore its environment - enabling it to excel
at sparse reward RL. Our experiments in several challenging robotic
manipulation settings demonstrate the power of our approach.
| cs.LG cs.RO stat.ML | we propose scheduled auxiliary control sacx a new learning paradigm in the context of reinforcement learning rl sacx enables learning of complex behaviors from scratch in the presence of multiple sparse reward signals to this end the agent is equipped with a set of general auxiliary tasks that it attempts to learn simultaneously via offpolicy rl the key idea behind our method is that active learned scheduling and execution of auxiliary policies allows the agent to efficiently explore its environment enabling it to excel at sparse reward rl our experiments in several challenging robotic manipulation settings demonstrate the power of our approach | [['we', 'propose', 'scheduled', 'auxiliary', 'control', 'sacx', 'a', 'new', 'learning', 'paradigm', 'in', 'the', 'context', 'of', 'reinforcement', 'learning', 'rl', 'sacx', 'enables', 'learning', 'of', 'complex', 'behaviors', 'from', 'scratch', 'in', 'the', 'presence', 'of', 'multiple', 'sparse', 'reward', 'signals', 'to', 'this', 'end', 'the', 'agent', 'is', 'equipped', 'with', 'a', 'set', 'of', 'general', 'auxiliary', 'tasks', 'that', 'it', 'attempts', 'to', 'learn', 'simultaneously', 'via', 'offpolicy', 'rl', 'the', 'key', 'idea', 'behind', 'our', 'method', 'is', 'that', 'active', 'learned', 'scheduling', 'and', 'execution', 'of', 'auxiliary', 'policies', 'allows', 'the', 'agent', 'to', 'efficiently', 'explore', 'its', 'environment', 'enabling', 'it', 'to', 'excel', 'at', 'sparse', 'reward', 'rl', 'our', 'experiments', 'in', 'several', 'challenging', 'robotic', 'manipulation', 'settings', 'demonstrate', 'the', 'power', 'of', 'our', 'approach']] | [-0.04791852776426822, 0.02006523545831442, -0.09601286535616964, 0.025429825698956847, -0.19984786862507462, -0.20661696665454657, 0.08164702659472824, 0.5006919504702091, -0.3216721828002483, -0.3548920537624508, 0.05989258851041086, -0.18842817079057567, -0.2259708606568165, 0.19146375741809607, -0.14267620200291276, 0.09677079242595937, 0.06641995920799673, 0.04164255167823285, -0.009740181053057313, -0.2758409009501338, 0.3047227636864409, 0.036494516134262085, 0.2922076372546144, -0.06560194412246347, 0.2027314966963604, 0.03093780138529837, 0.008525949465110897, -0.04940810069441795, 0.010574407153035282, 0.20939250327181072, 0.4075909115280956, 0.24363207291811706, 0.43676747918128966, -0.4031929622218013, -0.2066879702382721, 0.1024391138087958, 0.10593560198321939, 0.07352520355954767, -0.04623217415297404, -0.3422189922258258, 0.05065638971980661, -0.17389148663729428, -0.03737960252445191, -0.14982920104637742, -0.08064178406493738, -0.03917500754352659, -0.3363768995180726, -0.08228114388184622, 0.05130686947493814, -0.0159071892965585, -0.03711122939072084, -0.04916920324205421, 0.08355029209051282, 0.18487156154587864, 0.05053134714718908, 0.051465950426645576, 0.19848230448085816, -0.17167058317922057, -0.19356093073263764, 0.3244535529054701, -0.009692830913700164, -0.16131956501863898, 0.24828893427737056, -0.026053692381829023, -0.15531371595803647, 0.11044881693087519, 0.28150829834397884, 0.16539967243967113, -0.1655379511648789, 0.060346239325008356, -0.04852008134592325, 0.16237300403416158, -0.04126583201112226, -0.025935593410977162, 0.16199276828672737, 0.2540734185371548, 0.08027224944904447, 0.15753851597430185, -0.06446087072603404, -0.13913403660990298, -0.22999881240772083, -0.09125102159101516, -0.18477181386202574, -0.0020101236179471014, -0.11993678793762229, -0.06233416673450847, 0.37838884472846984, 0.2664533875323832, 0.19522527305642143, 0.13731589326635002, 0.3984789794217795, 0.0253878542293387, 0.0967291062278673, 0.1334050729474984, 0.1784910764778033, 0.006866593845188618, 0.17363954482600094, -0.26003067701589316, 0.1200692654796876, 0.005990623575635254] |
1,802.10568 | Machine learning and genomics: precision medicine vs. patient privacy | Machine learning can have major societal impact in computational biology
applications. In particular, it plays a central role in the development of
precision medicine, whereby treatment is tailored to the clinical or genetic
features of the patient. However, these advances require collecting and sharing
among researchers large amounts of genomic data, which generates much concern
about privacy. Researchers, study participants and governing bodies should be
aware of the ways in which the privacy of participants might be compromised, as
well as of the large body of research on technical solutions to these issues.
We review how breaches in patient privacy can occur, present recent
developments in computational data protection, and discuss how they can be
combined with legal and ethical perspectives to provide secure frameworks for
genomic data sharing.
| cs.CY | machine learning can have major societal impact in computational biology applications in particular it plays a central role in the development of precision medicine whereby treatment is tailored to the clinical or genetic features of the patient however these advances require collecting and sharing among researchers large amounts of genomic data which generates much concern about privacy researchers study participants and governing bodies should be aware of the ways in which the privacy of participants might be compromised as well as of the large body of research on technical solutions to these issues we review how breaches in patient privacy can occur present recent developments in computational data protection and discuss how they can be combined with legal and ethical perspectives to provide secure frameworks for genomic data sharing | [['machine', 'learning', 'can', 'have', 'major', 'societal', 'impact', 'in', 'computational', 'biology', 'applications', 'in', 'particular', 'it', 'plays', 'a', 'central', 'role', 'in', 'the', 'development', 'of', 'precision', 'medicine', 'whereby', 'treatment', 'is', 'tailored', 'to', 'the', 'clinical', 'or', 'genetic', 'features', 'of', 'the', 'patient', 'however', 'these', 'advances', 'require', 'collecting', 'and', 'sharing', 'among', 'researchers', 'large', 'amounts', 'of', 'genomic', 'data', 'which', 'generates', 'much', 'concern', 'about', 'privacy', 'researchers', 'study', 'participants', 'and', 'governing', 'bodies', 'should', 'be', 'aware', 'of', 'the', 'ways', 'in', 'which', 'the', 'privacy', 'of', 'participants', 'might', 'be', 'compromised', 'as', 'well', 'as', 'of', 'the', 'large', 'body', 'of', 'research', 'on', 'technical', 'solutions', 'to', 'these', 'issues', 'we', 'review', 'how', 'breaches', 'in', 'patient', 'privacy', 'can', 'occur', 'present', 'recent', 'developments', 'in', 'computational', 'data', 'protection', 'and', 'discuss', 'how', 'they', 'can', 'be', 'combined', 'with', 'legal', 'and', 'ethical', 'perspectives', 'to', 'provide', 'secure', 'frameworks', 'for', 'genomic', 'data', 'sharing']] | [-0.08664377791041783, 0.05528329885560232, -0.04355951351322984, 0.0802892352573487, -0.1261843202650085, -0.167700952366572, 0.05381936688055537, 0.3675733627534883, -0.28122434516025835, -0.35743995608631957, 0.1435656319679187, -0.30682835919248275, -0.14884393011732389, 0.21713344858013556, -0.21201017425150084, 0.06618940142207136, 0.10872719158840821, 0.008659904922201667, 0.026113792621285128, -0.3025473072807225, 0.313782962558921, 0.07431356657238662, 0.32723779535975106, 0.09545215386301713, 0.02529284470559408, -0.004239504756189363, -0.07009295062631253, 0.002333202031116153, -0.10055566428034285, 0.22142481001079545, 0.4439132329646873, 0.2839394652883905, 0.4262833429803682, -0.4853905810245363, -0.21110876621642374, 0.08679389669523799, 0.17150952901091976, 0.13734743428820845, -0.11211147966935452, -0.2760382722485666, 0.07068958144468912, -0.1732985348613976, -0.10759737729383705, -0.15184097281519987, -0.007041391310130441, 0.028370915140501808, -0.21306356846791685, 0.03610957330525961, -0.0006736131238772772, 0.15385330012862303, 0.0015059888774399148, -0.1341783955057924, 0.010653642119926423, 0.23462659412771175, 0.14917698042474456, -0.001082946605937079, 0.19144849542640294, -0.18952923543866754, -0.16235742771406045, 0.40243854313049204, 0.06881656536161034, -0.17283130538209465, 0.1801886808221019, -0.08090733528108329, -0.20898979026535452, 0.03253316659076038, 0.28804939450667233, 0.020485649619959006, -0.18311556279948055, 0.028528808556540414, 0.03913301142842271, 0.16556493941939962, 0.0619980599225838, 0.07819750962793365, 0.21989452277938293, 0.18531052988968327, 0.04447007383799267, 0.06335267022183497, -0.03885597184610864, -0.11753227035767695, -0.23715575759176366, -0.15256305096143957, -0.09136799313561168, 0.05976625691464012, -0.05417169347114847, -0.11384374165017241, 0.34792928718925675, 0.20838883661758878, 0.13394350436508887, -0.050959630589571224, 0.30810396448355315, 0.013980842778430314, 0.13874744894632765, 0.039826014920231675, 0.18454795501866314, 0.014151809105375248, 0.17748480455141313, -0.16299519283956912, 0.17571902308024667, -0.08109953972085039] |
1,802.10569 | Simultaneously Self-Attending to All Mentions for Full-Abstract
Biological Relation Extraction | Most work in relation extraction forms a prediction by looking at a short
span of text within a single sentence containing a single entity pair mention.
This approach often does not consider interactions across mentions, requires
redundant computation for each mention pair, and ignores relationships
expressed across sentence boundaries. These problems are exacerbated by the
document- (rather than sentence-) level annotation common in biological text.
In response, we propose a model which simultaneously predicts relationships
between all mention pairs in a document. We form pairwise predictions over
entire paper abstracts using an efficient self-attention encoder. All-pairs
mention scores allow us to perform multi-instance learning by aggregating over
mentions to form entity pair representations. We further adapt to settings
without mention-level annotation by jointly training to predict named entities
and adding a corpus of weakly labeled data. In experiments on two Biocreative
benchmark datasets, we achieve state of the art performance on the Biocreative
V Chemical Disease Relation dataset for models without external KB resources.
We also introduce a new dataset an order of magnitude larger than existing
human-annotated biological information extraction datasets and more accurate
than distantly supervised alternatives.
| cs.CL | most work in relation extraction forms a prediction by looking at a short span of text within a single sentence containing a single entity pair mention this approach often does not consider interactions across mentions requires redundant computation for each mention pair and ignores relationships expressed across sentence boundaries these problems are exacerbated by the document rather than sentence level annotation common in biological text in response we propose a model which simultaneously predicts relationships between all mention pairs in a document we form pairwise predictions over entire paper abstracts using an efficient selfattention encoder allpairs mention scores allow us to perform multiinstance learning by aggregating over mentions to form entity pair representations we further adapt to settings without mentionlevel annotation by jointly training to predict named entities and adding a corpus of weakly labeled data in experiments on two biocreative benchmark datasets we achieve state of the art performance on the biocreative v chemical disease relation dataset for models without external kb resources we also introduce a new dataset an order of magnitude larger than existing humanannotated biological information extraction datasets and more accurate than distantly supervised alternatives | [['most', 'work', 'in', 'relation', 'extraction', 'forms', 'a', 'prediction', 'by', 'looking', 'at', 'a', 'short', 'span', 'of', 'text', 'within', 'a', 'single', 'sentence', 'containing', 'a', 'single', 'entity', 'pair', 'mention', 'this', 'approach', 'often', 'does', 'not', 'consider', 'interactions', 'across', 'mentions', 'requires', 'redundant', 'computation', 'for', 'each', 'mention', 'pair', 'and', 'ignores', 'relationships', 'expressed', 'across', 'sentence', 'boundaries', 'these', 'problems', 'are', 'exacerbated', 'by', 'the', 'document', 'rather', 'than', 'sentence', 'level', 'annotation', 'common', 'in', 'biological', 'text', 'in', 'response', 'we', 'propose', 'a', 'model', 'which', 'simultaneously', 'predicts', 'relationships', 'between', 'all', 'mention', 'pairs', 'in', 'a', 'document', 'we', 'form', 'pairwise', 'predictions', 'over', 'entire', 'paper', 'abstracts', 'using', 'an', 'efficient', 'selfattention', 'encoder', 'allpairs', 'mention', 'scores', 'allow', 'us', 'to', 'perform', 'multiinstance', 'learning', 'by', 'aggregating', 'over', 'mentions', 'to', 'form', 'entity', 'pair', 'representations', 'we', 'further', 'adapt', 'to', 'settings', 'without', 'mentionlevel', 'annotation', 'by', 'jointly', 'training', 'to', 'predict', 'named', 'entities', 'and', 'adding', 'a', 'corpus', 'of', 'weakly', 'labeled', 'data', 'in', 'experiments', 'on', 'two', 'biocreative', 'benchmark', 'datasets', 'we', 'achieve', 'state', 'of', 'the', 'art', 'performance', 'on', 'the', 'biocreative', 'v', 'chemical', 'disease', 'relation', 'dataset', 'for', 'models', 'without', 'external', 'kb', 'resources', 'we', 'also', 'introduce', 'a', 'new', 'dataset', 'an', 'order', 'of', 'magnitude', 'larger', 'than', 'existing', 'humanannotated', 'biological', 'information', 'extraction', 'datasets', 'and', 'more', 'accurate', 'than', 'distantly', 'supervised', 'alternatives']] | [-0.0656513108325716, 0.029648982227607777, 0.009982030184510996, 0.10753060733599766, -0.1597706803140488, -0.18824778084563923, 0.08879437033109308, 0.441980219941507, -0.2619794744935055, -0.3567807291574935, -0.016616839703117954, -0.3470379702393597, -0.1022123893527215, 0.17488275170995002, -0.08381326522964841, 0.004525034301394121, 0.17469958197994237, 0.10954679596668823, -0.06510777015764108, -0.2825151949927726, 0.32651057329643124, 0.0028625906846347325, 0.3247394235234985, 0.019016708046423293, 0.1325517822003755, 0.005703171260625204, -0.09466203822670108, -0.037141136671515536, -0.06597312756918093, 0.18325770645962156, 0.37459065249782103, 0.22545393963810056, 0.32779433192719926, -0.39492716927309224, -0.213116292493725, 0.09036493656706025, 0.15672220361290223, 0.11630727703502883, 0.02112023116414809, -0.3275816681041838, 0.060466623950521756, -0.19252216454194065, 0.06841482919209854, -0.1526006285616375, 0.0229491758100847, -0.03109702784964379, -0.2638267755974084, 0.10245505702775343, 0.07687581697493752, 0.08962096963969475, -0.040328629162568755, -0.09160670838157765, 0.0523045532197315, 0.15255692852611474, 0.011607930099497489, 0.05595740826275358, 0.11500745783361824, -0.18442940086923895, -0.1618582230269354, 0.37651714535945274, -0.061588231897018134, -0.25309118751604903, 0.18773298553052417, -0.02460119310280982, -0.15623429504054737, 0.0683377693454299, 0.20282738783614748, 0.10380851178667805, -0.21217360117403355, -0.03208154164833026, -0.04791888820321393, 0.24941926734816738, 0.1197411211237232, -0.01052939310481653, 0.20603371799571757, 0.25288695073191153, -0.016028969380211956, 0.124005073752066, -0.07458355307004395, -0.06006517968551712, -0.23547236077200145, -0.10986025818365693, -0.15946939387148187, -0.026702032356316775, -0.10719396447630641, -0.1503593363251755, 0.3887718290912899, 0.24409940684749248, 0.22835652937399262, 0.10079242627692478, 0.2871941414740967, -0.04178799463911576, 0.12011588427877212, 0.1011990013549679, 0.10076188030801317, -0.03613114965125359, 0.10813851935784036, -0.10736409258691872, 0.11637693277728606, 0.07533927629110428] |
1,802.1057 | Statistical shape analysis in a Bayesian framework for shapes in two and
three dimensions | In this paper, we describe a novel shape classification method which is
embedded in the Bayesian paradigm. We discuss the modelling and the resulting
shape classification algorithm for two and three dimensional data shapes. We
conclude by evaluating the efficiency and efficacy of the proposed algorithm on
the Kimia shape database for the two dimensional case.
| stat.ME math.ST stat.AP stat.ML stat.TH | in this paper we describe a novel shape classification method which is embedded in the bayesian paradigm we discuss the modelling and the resulting shape classification algorithm for two and three dimensional data shapes we conclude by evaluating the efficiency and efficacy of the proposed algorithm on the kimia shape database for the two dimensional case | [['in', 'this', 'paper', 'we', 'describe', 'a', 'novel', 'shape', 'classification', 'method', 'which', 'is', 'embedded', 'in', 'the', 'bayesian', 'paradigm', 'we', 'discuss', 'the', 'modelling', 'and', 'the', 'resulting', 'shape', 'classification', 'algorithm', 'for', 'two', 'and', 'three', 'dimensional', 'data', 'shapes', 'we', 'conclude', 'by', 'evaluating', 'the', 'efficiency', 'and', 'efficacy', 'of', 'the', 'proposed', 'algorithm', 'on', 'the', 'kimia', 'shape', 'database', 'for', 'the', 'two', 'dimensional', 'case']] | [-0.04580126639588603, -0.038807103327209394, -0.07238240291813522, 0.03769430295298142, -0.019542102893215736, -0.09544014018527898, -0.0023319965174388407, 0.4348120096671794, -0.23389549492692044, -0.3287992334392454, 0.10458891563134134, -0.2072031665926001, -0.22164960983874543, 0.22862739544195523, -0.08526551276112773, 0.057781410769426396, 0.073244341516069, 0.013932114566809364, -0.06819787638128869, -0.25149717720757636, 0.35983129031956196, 0.007849450339563191, 0.3467378903213622, 0.03479875757225922, 0.08832626804983842, 0.03518112568417564, -0.06763407953881792, 0.054574365727603436, -0.13010483865426586, 0.18241030504993563, 0.20314258050971798, 0.19358380344263942, 0.249528392987226, -0.3510513741057366, -0.19663467568118773, 0.10547735711692699, 0.13722260444358522, 0.11455568490574868, -0.09243981215279616, -0.26713168549135197, 0.07239911690287824, -0.17691517168922083, -0.09588487743167207, -0.12092046848764378, -0.0254802786262839, -0.028944293602502773, -0.2430305480624416, 0.05679037664750857, 0.0982973137870431, 0.024698413991635398, -0.1097199011461011, -0.10468464394632195, 0.043415732931212654, 0.09181273265442412, -0.012073943977676598, -0.03272286831634119, 0.07324986166453787, -0.136500276105705, -0.13517685919837927, 0.35821474010923077, -0.018311527923547795, -0.22660186208252395, 0.1868558344264914, -0.06659462125805606, -0.177372947002628, 0.07690268428996205, 0.25759149961439626, 0.14264045739608783, -0.1446983084814357, 0.06195766051886104, -0.015035887365229428, 0.1393137389594423, 0.02040028215872423, -0.0700810197408178, 0.17982671090534755, 0.25503165341797285, -0.010002372279164515, 0.19189058244228363, -0.19757808323733375, -0.09031379261120621, -0.26485429068894256, -0.1695729526192216, -0.16459663250134327, -0.059802823450549374, -0.12145170526933466, -0.14389364735689014, 0.4734895769506693, 0.18234852789776465, 0.22715755480541183, 0.06998805639990938, 0.35484417014023556, 0.0732756836639185, 0.00908252053029303, 0.07521707327604028, 0.19604270040456737, 0.03692483147356792, 0.051689489370411526, -0.23599000330848088, 0.02289065343627174, 0.10275499220006168] |
1,802.10571 | Spatially-correlated Site Occupancy in the Nonstoichiometric Meta-stable
{\epsilon}-Al60Sm11 Phase during Devitrification of Al-10.2 at.% Sm Glasses | A metastable {\epsilon}-Al60Sm11 phase appears during the initial
devitrification of as-quenched Al-10.2 at.% Sm glasses. The {\epsilon} phase is
nonstoichiometric in nature since Al occupation is observed on the 16f Sm
lattice sites. Scanning transmission electron microscopic images reveal
profound spatial correlation of Sm content on these sites, which cannot be
explained by the "average crystal" description from Rietveld analysis of
diffraction data. Thermodynamically favorable configurations, established by
Monte Carlo (MC) simulations based on a cluster-expansion model, also give
qualitatively different correlation functions from experimental observations.
On the other hand, molecular dynamics simulations of the growth of
{\epsilon}-Al60Sm11 in undercooled liquid show that when the diffusion range of
Sm is limited to ~ 4 {\AA}, the correlation function of the as-grown crystal
structure agrees well with that of the STEM images. Our results show that
kinetic effects, especially the limited diffusivity of Sm atoms plays the
fundamental role in determining the nonstoichiometric site occupancies of the
{\epsilon}-Al60Sm11 phase during the crystallization process.
| cond-mat.mtrl-sci | a metastable epsilonal60sm11 phase appears during the initial devitrification of asquenched al102 at sm glasses the epsilon phase is nonstoichiometric in nature since al occupation is observed on the 16f sm lattice sites scanning transmission electron microscopic images reveal profound spatial correlation of sm content on these sites which cannot be explained by the average crystal description from rietveld analysis of diffraction data thermodynamically favorable configurations established by monte carlo mc simulations based on a clusterexpansion model also give qualitatively different correlation functions from experimental observations on the other hand molecular dynamics simulations of the growth of epsilonal60sm11 in undercooled liquid show that when the diffusion range of sm is limited to 4 aa the correlation function of the asgrown crystal structure agrees well with that of the stem images our results show that kinetic effects especially the limited diffusivity of sm atoms plays the fundamental role in determining the nonstoichiometric site occupancies of the epsilonal60sm11 phase during the crystallization process | [['a', 'metastable', 'epsilonal60sm11', 'phase', 'appears', 'during', 'the', 'initial', 'devitrification', 'of', 'asquenched', 'al102', 'at', 'sm', 'glasses', 'the', 'epsilon', 'phase', 'is', 'nonstoichiometric', 'in', 'nature', 'since', 'al', 'occupation', 'is', 'observed', 'on', 'the', '16f', 'sm', 'lattice', 'sites', 'scanning', 'transmission', 'electron', 'microscopic', 'images', 'reveal', 'profound', 'spatial', 'correlation', 'of', 'sm', 'content', 'on', 'these', 'sites', 'which', 'can', 'not', 'be', 'explained', 'by', 'the', 'average', 'crystal', 'description', 'from', 'rietveld', 'analysis', 'of', 'diffraction', 'data', 'thermodynamically', 'favorable', 'configurations', 'established', 'by', 'monte', 'carlo', 'mc', 'simulations', 'based', 'on', 'a', 'clusterexpansion', 'model', 'also', 'give', 'qualitatively', 'different', 'correlation', 'functions', 'from', 'experimental', 'observations', 'on', 'the', 'other', 'hand', 'molecular', 'dynamics', 'simulations', 'of', 'the', 'growth', 'of', 'epsilonal60sm11', 'in', 'undercooled', 'liquid', 'show', 'that', 'when', 'the', 'diffusion', 'range', 'of', 'sm', 'is', 'limited', 'to', '4', 'aa', 'the', 'correlation', 'function', 'of', 'the', 'asgrown', 'crystal', 'structure', 'agrees', 'well', 'with', 'that', 'of', 'the', 'stem', 'images', 'our', 'results', 'show', 'that', 'kinetic', 'effects', 'especially', 'the', 'limited', 'diffusivity', 'of', 'sm', 'atoms', 'plays', 'the', 'fundamental', 'role', 'in', 'determining', 'the', 'nonstoichiometric', 'site', 'occupancies', 'of', 'the', 'epsilonal60sm11', 'phase', 'during', 'the', 'crystallization', 'process']] | [-0.07414902623465157, 0.20530552848716563, -0.07732546002812313, 0.07189100374790028, 0.012831890164521633, -0.11924841327546454, 0.06814428593570031, 0.37999429576596394, -0.25938588822468744, -0.2988096348296342, 0.033228530702528236, -0.3093939634439136, -0.11663842096531428, 0.13939404885591186, 0.05645501805087609, 0.0009887569966459914, 0.05578224656480037, -0.02815886414378465, -0.08132020062882661, -0.23860636002452637, 0.25587730079322407, 0.11080950045935023, 0.32965384670084935, 0.05721343217290336, 0.06164695354112025, 0.02809550384961948, 0.02723024525066479, 0.00847057976777324, -0.17897066255225705, 0.03224313028156034, 0.21037473279392774, 0.01562794577908812, 0.15627680549915787, -0.4478463008594902, -0.24839881194830635, 0.016756071677281065, 0.13871115677836726, 0.09957635878825341, -0.08671337097698117, -0.25315196225665487, 0.03665005275401177, -0.09501385182628165, -0.0984371288635071, -0.06216736691282637, -0.043264774414739623, 0.014963452283601039, -0.2664735096189344, 0.14357532539838053, 0.000591784424252623, 0.10912971645853951, -0.08460203573535781, -0.14412517599441163, -0.09496603819674679, 0.06467243608015717, 0.05159504950008216, 0.02625983562002317, 0.18216266577068416, -0.10168630807943967, -0.10765472108459169, 0.401901303368233, -0.02459604700489305, -0.09582632363582991, 0.1942906710015529, -0.2319451452851851, -0.12423909653543266, 0.20065588646955926, 0.08331405113867675, 0.08599947588894262, -0.1242561971745056, 0.07623305482940274, -0.0363897444220818, 0.22983091213214007, 0.03500153962956591, 0.023616859862893264, 0.20671966516916057, 0.20899690686933325, -0.02760066876986197, 0.11043622803994345, -0.11605095564133215, -0.1456728376934785, -0.22363376163050347, -0.1457347898217647, -0.2142488271148401, 0.04297455629091262, -0.11889914353233502, -0.15455897123500797, 0.3406657860006975, 0.13862969324600838, 0.17109538532608415, -0.03934008904706733, 0.2273954896383589, 0.036647690975639434, 0.056222877201988646, -0.04020269786337425, 0.23830086689280428, 0.12047642000129458, 0.11713899853089767, -0.29287677483274516, 0.13900401443243027, 0.050325055690540105] |
1,802.10572 | Optimal work extraction from quantum states by photo-assisted Cooper
pair tunneling | The theory of quantum thermodynamics predicts fundamental bounds on work
extraction from quantum states. As these bounds are derived in a very general
and abstract setting, it is unclear how relevant they are in an experimental
context, where control is typically limited. Here we address this question by
showing that optimal work extraction is possible for a realistic engine. The
latter consists of a superconducting circuit, where a LC-resonator is coupled
to a Josephson junction. The oscillator state fuels the engine, providing
energy absorbed by Cooper pairs, thus producing work in the form of an
electrical current against an external voltage bias. We show that this machine
can extract the maximal amount of work from all Gaussian and Fock states.
Furthermore, we consider work extraction from a continuously stabilized
oscillator state. In both scenarios, coherence between energy eigenstates is
beneficial, increasing the power output of the machine. This is possible
because the phase difference across the Josephson junction provides a phase
reference.
| quant-ph cond-mat.mes-hall | the theory of quantum thermodynamics predicts fundamental bounds on work extraction from quantum states as these bounds are derived in a very general and abstract setting it is unclear how relevant they are in an experimental context where control is typically limited here we address this question by showing that optimal work extraction is possible for a realistic engine the latter consists of a superconducting circuit where a lcresonator is coupled to a josephson junction the oscillator state fuels the engine providing energy absorbed by cooper pairs thus producing work in the form of an electrical current against an external voltage bias we show that this machine can extract the maximal amount of work from all gaussian and fock states furthermore we consider work extraction from a continuously stabilized oscillator state in both scenarios coherence between energy eigenstates is beneficial increasing the power output of the machine this is possible because the phase difference across the josephson junction provides a phase reference | [['the', 'theory', 'of', 'quantum', 'thermodynamics', 'predicts', 'fundamental', 'bounds', 'on', 'work', 'extraction', 'from', 'quantum', 'states', 'as', 'these', 'bounds', 'are', 'derived', 'in', 'a', 'very', 'general', 'and', 'abstract', 'setting', 'it', 'is', 'unclear', 'how', 'relevant', 'they', 'are', 'in', 'an', 'experimental', 'context', 'where', 'control', 'is', 'typically', 'limited', 'here', 'we', 'address', 'this', 'question', 'by', 'showing', 'that', 'optimal', 'work', 'extraction', 'is', 'possible', 'for', 'a', 'realistic', 'engine', 'the', 'latter', 'consists', 'of', 'a', 'superconducting', 'circuit', 'where', 'a', 'lcresonator', 'is', 'coupled', 'to', 'a', 'josephson', 'junction', 'the', 'oscillator', 'state', 'fuels', 'the', 'engine', 'providing', 'energy', 'absorbed', 'by', 'cooper', 'pairs', 'thus', 'producing', 'work', 'in', 'the', 'form', 'of', 'an', 'electrical', 'current', 'against', 'an', 'external', 'voltage', 'bias', 'we', 'show', 'that', 'this', 'machine', 'can', 'extract', 'the', 'maximal', 'amount', 'of', 'work', 'from', 'all', 'gaussian', 'and', 'fock', 'states', 'furthermore', 'we', 'consider', 'work', 'extraction', 'from', 'a', 'continuously', 'stabilized', 'oscillator', 'state', 'in', 'both', 'scenarios', 'coherence', 'between', 'energy', 'eigenstates', 'is', 'beneficial', 'increasing', 'the', 'power', 'output', 'of', 'the', 'machine', 'this', 'is', 'possible', 'because', 'the', 'phase', 'difference', 'across', 'the', 'josephson', 'junction', 'provides', 'a', 'phase', 'reference']] | [-0.13501599158539815, 0.1669396767273285, -0.03880097221778591, 0.04830582011246732, -0.04468602422383373, -0.16392772470853856, 0.08960079629316259, 0.35094795376637283, -0.2609203558581893, -0.291738813684069, 0.04125082419817278, -0.2795104426073117, -0.1171286850679022, 0.2502953543983124, -0.0643799254860453, 0.044361233458290864, 0.0400699438645079, 0.032261076337301436, -0.03324055904019509, -0.18091178452811651, 0.3292998476313243, 0.05751989437353418, 0.33867432629793054, 0.06120488901599598, 0.08368820092284385, -0.04480444494473897, 0.03367705596323459, -0.005096252174059182, -0.09935320170000152, 0.1138423112397841, 0.2910062542392148, 0.07887142493941442, 0.262257549837361, -0.4308035747251577, -0.21224382540992934, 0.11039411090601833, 0.14358913616196792, 0.17429578300841428, -0.04920344243047437, -0.2516637902482654, 0.03789082178587301, -0.18171260351772178, -0.05587053580933975, -0.0913451184155017, 0.013955831642688057, -0.01275157440384781, -0.2536684694630956, 0.06179420292854631, 0.08871035020975224, 0.021836276804269465, -0.03993453560282051, -0.043701470427123114, 0.0014394210384911456, 0.11108640631115392, -0.01853709761125185, 0.03591860572083129, 0.15832696390269255, -0.15399628089321202, -0.1025604375201151, 0.335932921178432, -0.03310801652777526, -0.18325692424435674, 0.14540471011962466, -0.08023281407508033, -0.09411150484811515, 0.05590673640692308, 0.12717971298089079, 0.09742058145621056, -0.18060214537552294, 0.08640094379604116, -0.029887689608091742, 0.20389879414923834, 0.04562448235631081, 0.05686169725815467, 0.23763170403163927, 0.19704515044864865, 0.06350013357012269, 0.1969033741581909, -0.0535758231063359, -0.12004231868662446, -0.31542454698456474, -0.1389739015225873, -0.21559117530992852, 0.07585785039959268, -0.022366813671262073, -0.13882561819484157, 0.4179617234773037, 0.17837241587062355, 0.19596605161262423, 0.0071724686945176305, 0.3268935578461323, 0.14987103837861301, 0.028498951230704048, 0.06449605440534076, 0.24774657982907453, 0.12134620309002514, 0.10213774258420331, -0.2457896927960884, 0.06648498604844474, 0.004119666028813815] |
1,802.10573 | Modelling the diffuse dust emission around Orion | We have studied the diffuse radiation in the surroundings of M42 using
photometric data from the Galaxy Evolution Explorer (GALEX) in the
far-ultraviolet (FUV) and infrared observations of the AKARI space telescope.
The main source of the FUV diffuse emission is the starlight from the Trapezium
stars scattered by dust in front of the nebula. We initially compare the
diffuse FUV with the far-infrared (FIR) observations at the same locations. The
FUV-IR correlations enable us to determine the type of dust contributing to
this emission. We then use an existing model for studying the FUV dust
scattering in Orion to check if it can be extended to regions away from the
centre in a 10 deg radius. We obtain an albedo, {\alpha} = 0.7 and scattering
phase function asymmetry factor, g = 0.6 as the median values for our dust
locations on different sides of the central Orion region. We find a uniform
value of optical parameters across our sample of locations with the dust
properties varying significantly from those at the centre of the nebula.
| astro-ph.GA | we have studied the diffuse radiation in the surroundings of m42 using photometric data from the galaxy evolution explorer galex in the farultraviolet fuv and infrared observations of the akari space telescope the main source of the fuv diffuse emission is the starlight from the trapezium stars scattered by dust in front of the nebula we initially compare the diffuse fuv with the farinfrared fir observations at the same locations the fuvir correlations enable us to determine the type of dust contributing to this emission we then use an existing model for studying the fuv dust scattering in orion to check if it can be extended to regions away from the centre in a 10 deg radius we obtain an albedo alpha 07 and scattering phase function asymmetry factor g 06 as the median values for our dust locations on different sides of the central orion region we find a uniform value of optical parameters across our sample of locations with the dust properties varying significantly from those at the centre of the nebula | [['we', 'have', 'studied', 'the', 'diffuse', 'radiation', 'in', 'the', 'surroundings', 'of', 'm42', 'using', 'photometric', 'data', 'from', 'the', 'galaxy', 'evolution', 'explorer', 'galex', 'in', 'the', 'farultraviolet', 'fuv', 'and', 'infrared', 'observations', 'of', 'the', 'akari', 'space', 'telescope', 'the', 'main', 'source', 'of', 'the', 'fuv', 'diffuse', 'emission', 'is', 'the', 'starlight', 'from', 'the', 'trapezium', 'stars', 'scattered', 'by', 'dust', 'in', 'front', 'of', 'the', 'nebula', 'we', 'initially', 'compare', 'the', 'diffuse', 'fuv', 'with', 'the', 'farinfrared', 'fir', 'observations', 'at', 'the', 'same', 'locations', 'the', 'fuvir', 'correlations', 'enable', 'us', 'to', 'determine', 'the', 'type', 'of', 'dust', 'contributing', 'to', 'this', 'emission', 'we', 'then', 'use', 'an', 'existing', 'model', 'for', 'studying', 'the', 'fuv', 'dust', 'scattering', 'in', 'orion', 'to', 'check', 'if', 'it', 'can', 'be', 'extended', 'to', 'regions', 'away', 'from', 'the', 'centre', 'in', 'a', '10', 'deg', 'radius', 'we', 'obtain', 'an', 'albedo', 'alpha', '07', 'and', 'scattering', 'phase', 'function', 'asymmetry', 'factor', 'g', '06', 'as', 'the', 'median', 'values', 'for', 'our', 'dust', 'locations', 'on', 'different', 'sides', 'of', 'the', 'central', 'orion', 'region', 'we', 'find', 'a', 'uniform', 'value', 'of', 'optical', 'parameters', 'across', 'our', 'sample', 'of', 'locations', 'with', 'the', 'dust', 'properties', 'varying', 'significantly', 'from', 'those', 'at', 'the', 'centre', 'of', 'the', 'nebula']] | [0.022326956939316172, 0.07802353389497617, -0.07906403725206766, 0.056925262270987716, -0.057947161457576286, 0.009729627926630536, 0.03272517063472977, 0.4664725647361457, -0.2301294875770122, -0.31392627493237496, 0.03149249674631925, -0.32993051070912643, -0.025594513812477047, 0.15898369285599168, -0.029274063614557026, -0.05112343458731421, 0.0085709683473982, -0.1140795543832683, -0.014222366315257152, -0.23008592974999384, 0.31256927782669663, 0.10073099477516337, 0.15991075192685186, 0.004336945763414447, 0.036020647858178524, -0.06519938470667293, -0.08963521318403127, -0.04963906028795714, -0.17976386009463932, 0.06663954379063784, 0.2065484964625974, 0.1148110271709832, 0.161419426374025, -0.3668502833017723, -0.2333435990858352, 0.06923836169245214, 0.15782087375463424, 0.01351334280521748, 0.0018391494181585208, -0.2896607636003059, 0.035493894659475174, -0.13733660074181042, -0.20389227204870475, 0.1451194063471309, 0.04928546751603142, 0.029224467193493725, -0.2611342726647319, 0.06663122316407596, -0.05503369745900105, 0.09786232136693065, -0.16586888495875501, -0.11504719657395249, -0.06770746182481727, 0.13427445761011056, -0.01375201143171831, 0.09282472272585521, 0.19567729906585796, -0.1745366597047675, 0.015166506028049037, 0.354715059092536, -0.08373763424949185, -0.009812130266934333, 0.20051983041132146, -0.25821278943016523, -0.14099587041392236, 0.21066209052732193, 0.13460741960711178, 0.1197529416379951, -0.16712490962711216, 0.06447747287583998, -0.05850504752283316, 0.21662041825381503, 0.08079801412063768, 0.09338243917072654, 0.3121644349008713, 0.06782442823068463, 0.05188926238293663, 0.19180950001564584, -0.3100028488016955, -0.020575510066313047, -0.26659382794898046, -0.08312766229795378, -0.13937626501957448, 0.07255761101360209, -0.1668521845872158, -0.09658055753239207, 0.32905411763898174, 0.1670157926708417, 0.21418781711414842, 0.040176663077911415, 0.34141788266642, 0.07494826781384155, 0.11787323830328111, 0.13730597261863964, 0.3182422517927299, 0.13839436053624912, 0.11284633131494382, -0.23883107176650015, 0.04272415409474794, -0.0035842544119537474] |
1,802.10574 | Sparse Tensor Algebra Optimizations with Workspaces | This paper shows how to optimize sparse tensor algebraic expressions by
introducing temporary tensors, called workspaces, into the resulting loop
nests. We develop a new intermediate language for tensor operations called
concrete index notation that extends tensor index notation. Concrete index
notation expresses when and where sub-computations occur and what tensor they
are stored into. We then describe the workspace optimization in this language,
and how to compile it to sparse code by building on prior work in the
literature.
We demonstrate the importance of the optimization on several important sparse
tensor kernels, including sparse matrix-matrix multiplication (SpMM), sparse
tensor addition (SpAdd), and the matricized tensor times Khatri-Rao product
(MTTKRP) used to factorize tensors. Our results show improvements over prior
work on tensor algebra compilation and brings the performance of these kernels
on par with state-of-the-art hand-optimized implementations. For example, SpMM
was not supported by prior tensor algebra compilers, the performance of MTTKRP
on the nell-2 data set improves by 35%, and MTTKRP can for the first time have
sparse results.
| cs.MS cs.PL | this paper shows how to optimize sparse tensor algebraic expressions by introducing temporary tensors called workspaces into the resulting loop nests we develop a new intermediate language for tensor operations called concrete index notation that extends tensor index notation concrete index notation expresses when and where subcomputations occur and what tensor they are stored into we then describe the workspace optimization in this language and how to compile it to sparse code by building on prior work in the literature we demonstrate the importance of the optimization on several important sparse tensor kernels including sparse matrixmatrix multiplication spmm sparse tensor addition spadd and the matricized tensor times khatrirao product mttkrp used to factorize tensors our results show improvements over prior work on tensor algebra compilation and brings the performance of these kernels on par with stateoftheart handoptimized implementations for example spmm was not supported by prior tensor algebra compilers the performance of mttkrp on the nell2 data set improves by 35 and mttkrp can for the first time have sparse results | [['this', 'paper', 'shows', 'how', 'to', 'optimize', 'sparse', 'tensor', 'algebraic', 'expressions', 'by', 'introducing', 'temporary', 'tensors', 'called', 'workspaces', 'into', 'the', 'resulting', 'loop', 'nests', 'we', 'develop', 'a', 'new', 'intermediate', 'language', 'for', 'tensor', 'operations', 'called', 'concrete', 'index', 'notation', 'that', 'extends', 'tensor', 'index', 'notation', 'concrete', 'index', 'notation', 'expresses', 'when', 'and', 'where', 'subcomputations', 'occur', 'and', 'what', 'tensor', 'they', 'are', 'stored', 'into', 'we', 'then', 'describe', 'the', 'workspace', 'optimization', 'in', 'this', 'language', 'and', 'how', 'to', 'compile', 'it', 'to', 'sparse', 'code', 'by', 'building', 'on', 'prior', 'work', 'in', 'the', 'literature', 'we', 'demonstrate', 'the', 'importance', 'of', 'the', 'optimization', 'on', 'several', 'important', 'sparse', 'tensor', 'kernels', 'including', 'sparse', 'matrixmatrix', 'multiplication', 'spmm', 'sparse', 'tensor', 'addition', 'spadd', 'and', 'the', 'matricized', 'tensor', 'times', 'khatrirao', 'product', 'mttkrp', 'used', 'to', 'factorize', 'tensors', 'our', 'results', 'show', 'improvements', 'over', 'prior', 'work', 'on', 'tensor', 'algebra', 'compilation', 'and', 'brings', 'the', 'performance', 'of', 'these', 'kernels', 'on', 'par', 'with', 'stateoftheart', 'handoptimized', 'implementations', 'for', 'example', 'spmm', 'was', 'not', 'supported', 'by', 'prior', 'tensor', 'algebra', 'compilers', 'the', 'performance', 'of', 'mttkrp', 'on', 'the', 'nell2', 'data', 'set', 'improves', 'by', '35', 'and', 'mttkrp', 'can', 'for', 'the', 'first', 'time', 'have', 'sparse', 'results']] | [-0.06973198402316912, 0.06111705632989897, -0.03751218218958991, 0.022764352986290332, -0.1380578323294792, -0.12003498131080585, -0.01939684974426842, 0.4137283239951905, -0.2833038765991874, -0.2872119899291326, 0.13199593089931808, -0.21729939737321247, -0.21911927537773462, 0.17248202889733127, -0.08130849368103286, 0.05082825115909252, 0.09815491199192097, 0.031232375581748784, -0.11399500910261208, -0.27297356309547255, 0.32472273513318645, 0.06989138966754956, 0.2797428518698058, 0.034465533327859114, 0.09677030844271511, 0.012003879588754738, -0.07702865764526103, -0.012876973610700053, -0.06422360341483213, 0.16519345890881273, 0.30159431293278055, 0.23194874839802437, 0.21963365308885627, -0.45312906952903553, -0.14758812504108337, 0.06334942897562595, 0.11630099893492811, 0.03444292502861251, 0.003970720383564613, -0.2560029892196112, 0.1230371386559187, -0.23658679066609373, 0.0232732108575018, -0.19041485399117364, -0.006000368412145797, -0.05050429844242685, -0.27106974779162557, 0.012073994458050413, 0.08902843710076173, 0.02103296074030154, -0.042060954227824424, -0.19677545431220686, 0.04932930453625672, 0.08896154692030156, 0.005309603078400387, 0.01592476678026073, 0.12091869845822015, -0.08419814288123127, -0.134446392070009, 0.34810618260765774, -0.06960918540956781, -0.23716057708815616, 0.12617824500810135, -0.049892459642689894, -0.1722849548164317, 0.06355495893341653, 0.2069790964578073, 0.09305899460690424, -0.08466019605685313, 0.13222766557831647, -0.02923078967997914, 0.1465356432586251, 0.09765603725990171, -0.01043825691072818, 0.08957183577996843, 0.11892889281734824, 0.01944426390041104, 0.17195592118591507, 0.005882383104043958, -0.08816454679129974, -0.2572999719338601, -0.1689921341913492, -0.1842120121630347, 0.011885024311435273, -0.15317869871967774, -0.17564894103938167, 0.41685478478012716, 0.15876869013779524, 0.171404449151733, 0.11537674777757595, 0.33437485163894426, 0.051336615973730876, 0.1285090834580307, 0.13849651150624542, 0.15796705344486434, 0.14542637793621158, 0.10192530263585094, -0.12416219395201872, 0.057262759390013185, 0.10016102193142562] |
1,802.10575 | Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation
of Multivariate Log-concave Densities | We study the problem of learning multivariate log-concave densities with
respect to a global loss function. We obtain the first upper bound on the
sample complexity of the maximum likelihood estimator (MLE) for a log-concave
density on $\mathbb{R}^d$, for all $d \geq 4$. Prior to this work, no finite
sample upper bound was known for this estimator in more than $3$ dimensions.
In more detail, we prove that for any $d \geq 1$ and $\epsilon>0$, given
$\tilde{O}_d((1/\epsilon)^{(d+3)/2})$ samples drawn from an unknown log-concave
density $f_0$ on $\mathbb{R}^d$, the MLE outputs a hypothesis $h$ that with
high probability is $\epsilon$-close to $f_0$, in squared Hellinger loss. A
sample complexity lower bound of $\Omega_d((1/\epsilon)^{(d+1)/2})$ was
previously known for any learning algorithm that achieves this guarantee. We
thus establish that the sample complexity of the log-concave MLE is
near-optimal, up to an $\tilde{O}(1/\epsilon)$ factor.
| math.ST cs.IT cs.LG math.IT stat.TH | we study the problem of learning multivariate logconcave densities with respect to a global loss function we obtain the first upper bound on the sample complexity of the maximum likelihood estimator mle for a logconcave density on mathbbrd for all d geq 4 prior to this work no finite sample upper bound was known for this estimator in more than 3 dimensions in more detail we prove that for any d geq 1 and epsilon0 given tildeo_d1epsilond32 samples drawn from an unknown logconcave density f_0 on mathbbrd the mle outputs a hypothesis h that with high probability is epsilonclose to f_0 in squared hellinger loss a sample complexity lower bound of omega_d1epsilond12 was previously known for any learning algorithm that achieves this guarantee we thus establish that the sample complexity of the logconcave mle is nearoptimal up to an tildeo1epsilon factor | [['we', 'study', 'the', 'problem', 'of', 'learning', 'multivariate', 'logconcave', 'densities', 'with', 'respect', 'to', 'a', 'global', 'loss', 'function', 'we', 'obtain', 'the', 'first', 'upper', 'bound', 'on', 'the', 'sample', 'complexity', 'of', 'the', 'maximum', 'likelihood', 'estimator', 'mle', 'for', 'a', 'logconcave', 'density', 'on', 'mathbbrd', 'for', 'all', 'd', 'geq', '4', 'prior', 'to', 'this', 'work', 'no', 'finite', 'sample', 'upper', 'bound', 'was', 'known', 'for', 'this', 'estimator', 'in', 'more', 'than', '3', 'dimensions', 'in', 'more', 'detail', 'we', 'prove', 'that', 'for', 'any', 'd', 'geq', '1', 'and', 'epsilon0', 'given', 'tildeo_d1epsilond32', 'samples', 'drawn', 'from', 'an', 'unknown', 'logconcave', 'density', 'f_0', 'on', 'mathbbrd', 'the', 'mle', 'outputs', 'a', 'hypothesis', 'h', 'that', 'with', 'high', 'probability', 'is', 'epsilonclose', 'to', 'f_0', 'in', 'squared', 'hellinger', 'loss', 'a', 'sample', 'complexity', 'lower', 'bound', 'of', 'omega_d1epsilond12', 'was', 'previously', 'known', 'for', 'any', 'learning', 'algorithm', 'that', 'achieves', 'this', 'guarantee', 'we', 'thus', 'establish', 'that', 'the', 'sample', 'complexity', 'of', 'the', 'logconcave', 'mle', 'is', 'nearoptimal', 'up', 'to', 'an', 'tildeo1epsilon', 'factor']] | [-0.06173983438144833, 0.06865869882778707, -0.08026488717283597, 0.09209203931399146, -0.018117627668321777, -0.15036324381144892, 0.09231920361899094, 0.39639607389464226, -0.19400882339373016, -0.31066140867376085, 0.06593541226520626, -0.28234571459696445, -0.11868777441483983, 0.17300628858832842, -0.11719467284546482, 0.12464492855821367, 0.021027595392703047, 0.07351390815092076, -0.11350240274550219, -0.34986103791073503, 0.27578811234586853, 0.01970303070852064, 0.26307191110715245, 0.0010517200391418, 0.11457705115832442, -0.015122185211642075, 0.03331735565347208, -0.023297675520520013, -0.22095129368830935, 0.12963752329212164, 0.23423169166680505, 0.2228107638740845, 0.3135112869961978, -0.28988410131700115, -0.17978337226207736, 0.21684537329644019, 0.13829300753695206, 0.051507703350227085, -0.01909073359327116, -0.2206030168315972, 0.13468342366219638, -0.11491234111264616, -0.12710860506262925, -0.027601186447381545, 0.058666350124499105, -0.02532135431400145, -0.3948439623986324, 0.11378125398647602, 0.11587637846472024, 0.03136075052504743, -0.040646615485064416, -0.2207259217598777, 0.04327790283685108, 0.034264295975000955, 0.030154665513299136, 0.1252791024091245, 0.05659218265661608, -0.10803205965642931, -0.07271407432720173, 0.24292741978554416, -0.07036900741984924, -0.22379595472765484, 0.13994308756898902, -0.20103081215588417, -0.15879651094391514, 0.16115366159636768, 0.21664184049817084, 0.14877738023056186, -0.12921265183726874, 0.11477587382407967, -0.096567054213822, 0.193817420363453, 0.08576583843544233, 0.017609980006755847, 0.052357277243311025, 0.14388432386900774, 0.20940999220051676, 0.1592037373242511, -0.08911948037884874, -0.007655714973539328, -0.3085057883918714, -0.15628591985249116, -0.31199044438176154, 0.06902600846273436, -0.2000042755262911, -0.1521181853005676, 0.2797692088182453, 0.13065575141620508, 0.21315407306759906, 0.2149331431547783, 0.2600172545439262, 0.11947031759342058, -0.03395827769857945, 0.17763775614887584, 0.17093000236711056, 0.14272949163694765, -0.03537277864558595, -0.14680680542641567, 0.12418222467904147, 0.034838889139242095] |
1,802.10576 | Modeling Activity Tracker Data Using Deep Boltzmann Machines | Commercial activity trackers are set to become an essential tool in health
research, due to increasing availability in the general population. The
corresponding vast amounts of mostly unlabeled data pose a challenge to
statistical modeling approaches. To investigate the feasibility of deep
learning approaches for unsupervised learning with such data, we examine weekly
usage patterns of Fitbit activity trackers with deep Boltzmann machines (DBMs).
This method is particularly suitable for modeling complex joint distributions
via latent variables. We also chose this specific procedure because it is a
generative approach, i.e., artificial samples can be generated to explore the
learned structure. We describe how the data can be preprocessed to be
compatible with binary DBMs. The results reveal two distinct usage patterns in
which one group frequently uses trackers on Mondays and Tuesdays, whereas the
other uses trackers during the entire week. This exemplary result shows that
DBMs are feasible and can be useful for modeling activity tracker data.
| stat.ML cs.LG | commercial activity trackers are set to become an essential tool in health research due to increasing availability in the general population the corresponding vast amounts of mostly unlabeled data pose a challenge to statistical modeling approaches to investigate the feasibility of deep learning approaches for unsupervised learning with such data we examine weekly usage patterns of fitbit activity trackers with deep boltzmann machines dbms this method is particularly suitable for modeling complex joint distributions via latent variables we also chose this specific procedure because it is a generative approach ie artificial samples can be generated to explore the learned structure we describe how the data can be preprocessed to be compatible with binary dbms the results reveal two distinct usage patterns in which one group frequently uses trackers on mondays and tuesdays whereas the other uses trackers during the entire week this exemplary result shows that dbms are feasible and can be useful for modeling activity tracker data | [['commercial', 'activity', 'trackers', 'are', 'set', 'to', 'become', 'an', 'essential', 'tool', 'in', 'health', 'research', 'due', 'to', 'increasing', 'availability', 'in', 'the', 'general', 'population', 'the', 'corresponding', 'vast', 'amounts', 'of', 'mostly', 'unlabeled', 'data', 'pose', 'a', 'challenge', 'to', 'statistical', 'modeling', 'approaches', 'to', 'investigate', 'the', 'feasibility', 'of', 'deep', 'learning', 'approaches', 'for', 'unsupervised', 'learning', 'with', 'such', 'data', 'we', 'examine', 'weekly', 'usage', 'patterns', 'of', 'fitbit', 'activity', 'trackers', 'with', 'deep', 'boltzmann', 'machines', 'dbms', 'this', 'method', 'is', 'particularly', 'suitable', 'for', 'modeling', 'complex', 'joint', 'distributions', 'via', 'latent', 'variables', 'we', 'also', 'chose', 'this', 'specific', 'procedure', 'because', 'it', 'is', 'a', 'generative', 'approach', 'ie', 'artificial', 'samples', 'can', 'be', 'generated', 'to', 'explore', 'the', 'learned', 'structure', 'we', 'describe', 'how', 'the', 'data', 'can', 'be', 'preprocessed', 'to', 'be', 'compatible', 'with', 'binary', 'dbms', 'the', 'results', 'reveal', 'two', 'distinct', 'usage', 'patterns', 'in', 'which', 'one', 'group', 'frequently', 'uses', 'trackers', 'on', 'mondays', 'and', 'tuesdays', 'whereas', 'the', 'other', 'uses', 'trackers', 'during', 'the', 'entire', 'week', 'this', 'exemplary', 'result', 'shows', 'that', 'dbms', 'are', 'feasible', 'and', 'can', 'be', 'useful', 'for', 'modeling', 'activity', 'tracker', 'data']] | [-0.029102122687710934, 0.050662444830389404, -0.09467481316814709, 0.09550246908284937, -0.13186229906299976, -0.16880117235171377, 0.020284255975442138, 0.45112166681570137, -0.2952754717723579, -0.3522734978965893, 0.11122863183530629, -0.3031736795440506, -0.14723855444485215, 0.22093882075077884, -0.12211476983784277, 0.05029439929854955, 0.1443776234859826, 0.040483947832932236, -0.027340943510584817, -0.2746057634407882, 0.30285673192257334, 0.05204266176527888, 0.35818625291346745, -0.017339021323402974, 0.08310210929329323, 0.011041487350609083, -0.07076514266864367, -0.010421848731340876, -0.04134704831382, 0.16820866733627798, 0.34318869723196904, 0.22218715430053462, 0.30805201723928427, -0.4268366045016012, -0.21325610117811805, 0.10148448442482645, 0.12717515998371656, 0.09921596627637957, -0.04427451543453606, -0.29260077849875804, 0.08264856137371379, -0.1794671080873057, -0.06336097243230102, -0.15888523719730271, -0.016085651124253645, 0.011988593113036222, -0.26016560951907747, 0.028812348597740848, 0.021455429666037938, 0.074662432602494, -0.05820671232286722, -0.0966844208009102, 0.018692168168379528, 0.16255836191759176, 0.0669399839292049, 0.030889066817108422, 0.14816490189427403, -0.1536005967857233, -0.11480909300623995, 0.3341940406733637, -0.0439906359404017, -0.18141164883354288, 0.220101120095006, -0.0534704457590309, -0.1834359080664173, 0.09087725697903876, 0.24970901127872028, 0.10807485629027341, -0.19747259652362187, -0.00147211370518087, -0.028029177225177074, 0.19715252663987648, -0.01780342866049688, -0.0051100106697060926, 0.2034250012006474, 0.26030398143313016, -2.417535740573695e-05, 0.13692979377755232, -0.11843770249023038, -0.08445140030709611, -0.18600142738265787, -0.11152822724958751, -0.17520233006127606, -0.009562881129562476, -0.07836021960154621, -0.15485396146608196, 0.37669328389693774, 0.21945496498924832, 0.2037901281665382, 0.020140427147678937, 0.325756483272335, 0.04394393214285982, 0.1562710809521377, 0.09900311101672898, 0.17132813605341976, 0.010572321014478803, 0.12949425746407953, -0.16052983818682515, 0.12003227509558201, -0.010391788683226629] |
1,802.10577 | Constraining Baryon--Dark Matter Scattering with the Cosmic Dawn 21-cm
Signal | The recent detection of an anomalously strong 21-cm signal of neutral
hydrogen from Cosmic Dawn by the EDGES Low-Band radio experiment can be
explained if cold dark matter particles scattered off the baryons draining
excess energy from the gas. In this Letter we explore the expanded range of the
21-cm signal that is opened up by this interaction, varying the astrophysical
parameters as well as the properties of dark matter particles in the widest
possible range. We identify models consistent with current data by comparing to
both the detection in the Low-Band and the upper limits from the EDGES
High-Band antenna. We find that consistent models predict a 21-cm fluctuation
during Cosmic Dawn that is between 3 and 30 times larger than the largest
previously expected without dark matter scattering. The expected power spectrum
exhibits strong Baryon Acoustic Oscillations imprinted by the
velocity-dependent cross-section. The latter signature is a smoking gun of the
velocity-dependent scattering and could be used by interferometers to verify
the dark matter explanation of the EDGES detection.
| astro-ph.CO | the recent detection of an anomalously strong 21cm signal of neutral hydrogen from cosmic dawn by the edges lowband radio experiment can be explained if cold dark matter particles scattered off the baryons draining excess energy from the gas in this letter we explore the expanded range of the 21cm signal that is opened up by this interaction varying the astrophysical parameters as well as the properties of dark matter particles in the widest possible range we identify models consistent with current data by comparing to both the detection in the lowband and the upper limits from the edges highband antenna we find that consistent models predict a 21cm fluctuation during cosmic dawn that is between 3 and 30 times larger than the largest previously expected without dark matter scattering the expected power spectrum exhibits strong baryon acoustic oscillations imprinted by the velocitydependent crosssection the latter signature is a smoking gun of the velocitydependent scattering and could be used by interferometers to verify the dark matter explanation of the edges detection | [['the', 'recent', 'detection', 'of', 'an', 'anomalously', 'strong', '21cm', 'signal', 'of', 'neutral', 'hydrogen', 'from', 'cosmic', 'dawn', 'by', 'the', 'edges', 'lowband', 'radio', 'experiment', 'can', 'be', 'explained', 'if', 'cold', 'dark', 'matter', 'particles', 'scattered', 'off', 'the', 'baryons', 'draining', 'excess', 'energy', 'from', 'the', 'gas', 'in', 'this', 'letter', 'we', 'explore', 'the', 'expanded', 'range', 'of', 'the', '21cm', 'signal', 'that', 'is', 'opened', 'up', 'by', 'this', 'interaction', 'varying', 'the', 'astrophysical', 'parameters', 'as', 'well', 'as', 'the', 'properties', 'of', 'dark', 'matter', 'particles', 'in', 'the', 'widest', 'possible', 'range', 'we', 'identify', 'models', 'consistent', 'with', 'current', 'data', 'by', 'comparing', 'to', 'both', 'the', 'detection', 'in', 'the', 'lowband', 'and', 'the', 'upper', 'limits', 'from', 'the', 'edges', 'highband', 'antenna', 'we', 'find', 'that', 'consistent', 'models', 'predict', 'a', '21cm', 'fluctuation', 'during', 'cosmic', 'dawn', 'that', 'is', 'between', '3', 'and', '30', 'times', 'larger', 'than', 'the', 'largest', 'previously', 'expected', 'without', 'dark', 'matter', 'scattering', 'the', 'expected', 'power', 'spectrum', 'exhibits', 'strong', 'baryon', 'acoustic', 'oscillations', 'imprinted', 'by', 'the', 'velocitydependent', 'crosssection', 'the', 'latter', 'signature', 'is', 'a', 'smoking', 'gun', 'of', 'the', 'velocitydependent', 'scattering', 'and', 'could', 'be', 'used', 'by', 'interferometers', 'to', 'verify', 'the', 'dark', 'matter', 'explanation', 'of', 'the', 'edges', 'detection']] | [-0.11379016884936194, 0.18734708256627725, -0.05720352589517658, 0.10861269894194904, -0.07190539798160132, -0.0759154665658294, 0.010969156321759025, 0.3144343056667008, -0.22212414115623771, -0.36843304443908365, 0.04086578612921117, -0.3178591629904177, -0.06670569742850044, 0.17692465478369193, 0.0709454802638301, -0.0013508667453016531, -0.00743735369297605, -0.01649265971622969, 0.007290692907030972, -0.1877836062020094, 0.26710813010536266, 0.1505246088916316, 0.23866114954665651, 0.06961042827202214, 0.07449260682523882, -0.043126813221820874, -0.09007956781179498, -0.01645500005334507, -0.12167195513527411, 0.043237470411722774, 0.21677330544863302, 0.10725716627284623, 0.1375314526270792, -0.4373833650276501, -0.256414767605258, 0.1832071080673159, 0.17855655614624333, 0.1187047463111928, -0.08430319534320581, -0.34543700155676804, 0.04708482625442203, -0.1934455387152688, -0.11884964864744603, 0.029335493663031804, 0.01875443399709524, 0.012502810838822907, -0.2087631154892563, 0.11604756314432717, -0.011123845510985376, -0.027999069579306455, -0.07560869920399715, -0.10105125032765627, -0.017097014709163392, 0.027647445353472397, 0.04953882154975936, 0.014477222018237961, 0.19897704288003998, -0.19638939290334695, -0.08798933700026607, 0.40528850730682847, -0.18617024142419367, -0.04163207784220195, 0.16738968497763076, -0.1960351155901992, -0.09858733149550376, 0.18855438295653776, 0.1565175316710439, 0.038618262394941386, -0.1352544990558809, 0.0641253492090312, -0.04448874391702532, 0.20652999333514457, 0.08769143825500375, 0.04382118929452562, 0.36439160406807364, 0.15947058408082687, 0.05660843123186227, 0.07983155489479851, -0.17091869612562072, 0.025479491584599345, -0.28506383921866635, -0.09287624750068488, -0.18461279525307187, 0.037977956808635104, -0.08799037125687678, -0.0638018495005648, 0.3774928573017929, 0.1610160370858397, 0.23756542488556812, 0.014896450325988277, 0.36058245732704974, 0.09429685023820235, 0.07611529595267616, 0.05011610376338164, 0.34168837576756006, 0.13724428132225416, 0.09359608556835623, -0.2254599967524845, 0.054145351935270626, -0.05743931663326091] |
1,802.10578 | Rings of constants of linear derivations on Fermat rings | In this paper we characterize all the linear $\mathbb{C}$-derivations of the
Fermat ring. We show that the Fermat ring has linear $\mathbb{C}$-derivations
with trivial ring of constants and construct some examples.
| math.AC | in this paper we characterize all the linear mathbbcderivations of the fermat ring we show that the fermat ring has linear mathbbcderivations with trivial ring of constants and construct some examples | [['in', 'this', 'paper', 'we', 'characterize', 'all', 'the', 'linear', 'mathbbcderivations', 'of', 'the', 'fermat', 'ring', 'we', 'show', 'that', 'the', 'fermat', 'ring', 'has', 'linear', 'mathbbcderivations', 'with', 'trivial', 'ring', 'of', 'constants', 'and', 'construct', 'some', 'examples']] | [-0.2240081575281661, -0.00603663083165884, -0.06967899415256648, -0.028569138500486212, -0.07951211706125016, -0.13651811543466716, -0.0943348677467619, 0.3258513664377147, -0.3784729727897151, -0.1387772624348772, 0.12200673879525656, -0.26899211545442714, -0.21780106354633283, 0.20958262656269402, -0.08623250605988092, -0.0020913964073205815, -0.008863341737667034, 0.13126286228412185, -0.11695061909066963, -0.35195411035212976, 0.4095131739460189, -0.018936921167990256, 0.1337078957465188, 0.028619758511797107, 0.11191393605208602, -0.008523567178254497, -0.016977517994056487, 0.023396329697349977, -0.26430897328903263, 0.14157000010640458, 0.30256143250855905, 0.07531196090938716, 0.18724983159838052, -0.41493926120215446, -0.11366149638618889, 0.214625912108298, 0.08900362368801544, 0.1129912615850054, -0.044071936947775295, -0.15589279798662353, 0.16974073789756874, -0.2060897639342423, -0.2057160757931656, -0.1292525084432343, 0.07238879234626375, 0.1341536638551745, -0.20976907419490404, -0.055326050243757925, 0.12481906425593228, 0.14767416531284308, -0.026282587666706794, -0.07701722699506529, 0.02041812302095109, 0.019246730070304256, -0.0013736731790263078, -0.05608476696792861, 0.045191749031173775, -0.05059203208456266, -0.11432701471293795, 0.3902413336367443, -0.1387634052702322, -0.13843799949270383, 0.1203818083580198, -0.22209369416894584, -0.10929403519900195, 0.10479341106938905, 0.09936121536483025, 0.13316102415837092, -0.04796635080128908, 0.2142785584277088, -0.21316447648508796, 0.13926482072164273, 0.1428528094086154, 0.03763175359124254, 0.13563396511920567, 0.059131643445841195, 0.033548568908309824, 0.18318481573128495, -0.034794832403161405, -0.0264420702186381, -0.375028295667264, -0.2101788730842286, -0.15338444016504518, 0.09982266855137102, -0.08142357921691466, -0.14499970949415503, 0.4730027974422636, 0.09339684450292382, 0.1800007917757692, 0.07741411113790397, 0.20108692123201385, 0.08069662659846503, 0.05551000633116426, 0.07201061661130395, 0.21990037689101882, 0.14077488663766918, -0.02871780243605889, -0.2182729266712378, -0.06081282061621033, 0.08367794620451229] |
1,802.10579 | Renormalization group analysis for the quasi-1D superconductor
BaFe$_2$S$_3$ | Motivated by the discovery of superconductivity in the two-leg, quasi-one
dimensional ladder compound, BaFe$_2$S$_3$ we present a renormalization group
study of electrons moving on a two leg, two orbital ladder, subjected to
Hubbard repulsion $U$ and Hund's coupling $J$. In our calculations, we adopt
tightbinding parameters obtained from ab-initio studies on this material. At
incommensurate filling, the long wavelength analysis displays four phases as a
function of $0 \leq J/U <1$. We show that a fully gapped superconductor is
stabilized at sufficiently large Hund's coupling, the relative phases at the
three Fermi points are "+,-,-". By contrast, when the system is tuned to half
filling, Umklapp scattering gives rise to Mott insulating phases. We discuss
the general implications of our study for the broad class of iron-based
superconductors.
| cond-mat.supr-con cond-mat.str-el | motivated by the discovery of superconductivity in the twoleg quasione dimensional ladder compound bafe_2s_3 we present a renormalization group study of electrons moving on a two leg two orbital ladder subjected to hubbard repulsion u and hunds coupling j in our calculations we adopt tightbinding parameters obtained from abinitio studies on this material at incommensurate filling the long wavelength analysis displays four phases as a function of 0 leq ju 1 we show that a fully gapped superconductor is stabilized at sufficiently large hunds coupling the relative phases at the three fermi points are by contrast when the system is tuned to half filling umklapp scattering gives rise to mott insulating phases we discuss the general implications of our study for the broad class of ironbased superconductors | [['motivated', 'by', 'the', 'discovery', 'of', 'superconductivity', 'in', 'the', 'twoleg', 'quasione', 'dimensional', 'ladder', 'compound', 'bafe_2s_3', 'we', 'present', 'a', 'renormalization', 'group', 'study', 'of', 'electrons', 'moving', 'on', 'a', 'two', 'leg', 'two', 'orbital', 'ladder', 'subjected', 'to', 'hubbard', 'repulsion', 'u', 'and', 'hunds', 'coupling', 'j', 'in', 'our', 'calculations', 'we', 'adopt', 'tightbinding', 'parameters', 'obtained', 'from', 'abinitio', 'studies', 'on', 'this', 'material', 'at', 'incommensurate', 'filling', 'the', 'long', 'wavelength', 'analysis', 'displays', 'four', 'phases', 'as', 'a', 'function', 'of', '0', 'leq', 'ju', '1', 'we', 'show', 'that', 'a', 'fully', 'gapped', 'superconductor', 'is', 'stabilized', 'at', 'sufficiently', 'large', 'hunds', 'coupling', 'the', 'relative', 'phases', 'at', 'the', 'three', 'fermi', 'points', 'are', 'by', 'contrast', 'when', 'the', 'system', 'is', 'tuned', 'to', 'half', 'filling', 'umklapp', 'scattering', 'gives', 'rise', 'to', 'mott', 'insulating', 'phases', 'we', 'discuss', 'the', 'general', 'implications', 'of', 'our', 'study', 'for', 'the', 'broad', 'class', 'of', 'ironbased', 'superconductors']] | [-0.24248067505188345, 0.21047732493964824, -0.002601797833642739, 0.03149716557263888, -0.029644907151502888, -0.20638085403076306, 0.12402566549378286, 0.3887849588856453, -0.22498995388718687, -0.22314672160336352, -0.0004598260728833009, -0.34725898353925605, -0.10515823181513256, 0.12660203917560672, 0.0924862480876366, -0.046803867745059215, -0.026171893424053832, -0.07565944015752436, -0.16168951154246516, -0.24195230876894916, 0.3350067198291186, -0.04740506570921903, 0.2584205398211846, 0.07552538882559678, 0.030351036123740745, 0.04545408678236491, 0.12452391122181819, 0.009711384296593234, -0.19676689913811019, 0.03532898390856315, 0.2738083493932495, -0.16986107202173453, 0.22464551358652396, -0.38473984980442394, -0.20267948603961528, -0.025862389772133097, 0.15696159081797548, 0.13692668230661492, -0.022089638090834543, -0.30429631636998666, -0.01822015388656085, -0.21384644414129572, -0.1541867574542123, -0.11661702050922776, -0.015652014298261855, -0.02786984875079567, -0.24890735482166368, 0.08478986429266895, 0.026261835318073853, 0.1006210168761611, -0.10487132650382054, -0.156894500288511, -0.048137451639384266, 0.032733710038367524, 0.06203297662409389, 0.07852218649350107, 0.07306036596575122, -0.11287413945763719, -0.0875394194878227, 0.3767630312239795, -0.05769598667553853, -0.0796202480844332, 0.20255017169479897, -0.18852141471137385, -0.12247338898362607, 0.16138946661710973, 0.08134988979179794, 0.05552500365008637, -0.11622536323075898, 0.1277691678077122, -0.060492605154263225, 0.17250482795217376, -0.009179865967071666, 0.049824189827832446, 0.2447057702307274, 0.22671946933251022, 0.036441988583038175, 0.14980605839362998, -0.12885543286404388, -0.07166076379674156, -0.2569197443291897, -0.13261292460484533, -0.24308439058171014, 0.06809271111631561, -0.06863810046835836, -0.1775582749763225, 0.42367873566709163, 0.17225374088771128, 0.1983679749500593, -0.05387319797488648, 0.17159071644240126, 0.09815315776926238, 0.03659152525007783, 0.046029845097718215, 0.24314689741095924, 0.13782337411145468, 0.062408145446528306, -0.2869587186118954, 0.015126667099117528, 0.10684945172512002] |
1,802.1058 | The Coulomb problem in iron based superconductors | We discuss the role of strong Coulomb interactions in iron-based
superconductors (FeSCs). The presumed $s^{\pm}$ character of these
superconductors means that the condensate is not symmetry protected against
Coulomb repulsion. Remarkably, the transition temperatures and the excitation
gap are quite robust across the large family of iron based superconductors,
despite drastic changes in Fermi surface geometry. The Coulomb problem is to
understand how these superconductors avoid the strong onsite Coulomb
interaction at the iron atoms, while maintaining a robust transition
temperature. Within the dominant space of $t_{2g}$ orbitals, on-site repulsion
in the FeSCs enforces two linearly independent components of the condensate to
vanish. This raises the possibility that iron-based superconductors might adapt
their condensate to the Coulomb constraints by rotating the pairing state
within the large manifold of entangled, extended s-wave gap functions with
different orbital and momentum space structure. We examine this "orbital and
k-space flexibility" (OKF) mechanism using both Landau theory and microscopic
calculations within a multi-orbital t-J model. Based on our results, we
conclude that OKF necessitates a large condensate degeneracy. One interesting
possibility raised by our results, is that a resolution to the Coulomb problem
in FeSC might require a reconsideration of triplet pairing.
| cond-mat.supr-con cond-mat.str-el | we discuss the role of strong coulomb interactions in ironbased superconductors fescs the presumed spm character of these superconductors means that the condensate is not symmetry protected against coulomb repulsion remarkably the transition temperatures and the excitation gap are quite robust across the large family of iron based superconductors despite drastic changes in fermi surface geometry the coulomb problem is to understand how these superconductors avoid the strong onsite coulomb interaction at the iron atoms while maintaining a robust transition temperature within the dominant space of t_2g orbitals onsite repulsion in the fescs enforces two linearly independent components of the condensate to vanish this raises the possibility that ironbased superconductors might adapt their condensate to the coulomb constraints by rotating the pairing state within the large manifold of entangled extended swave gap functions with different orbital and momentum space structure we examine this orbital and kspace flexibility okf mechanism using both landau theory and microscopic calculations within a multiorbital tj model based on our results we conclude that okf necessitates a large condensate degeneracy one interesting possibility raised by our results is that a resolution to the coulomb problem in fesc might require a reconsideration of triplet pairing | [['we', 'discuss', 'the', 'role', 'of', 'strong', 'coulomb', 'interactions', 'in', 'ironbased', 'superconductors', 'fescs', 'the', 'presumed', 'spm', 'character', 'of', 'these', 'superconductors', 'means', 'that', 'the', 'condensate', 'is', 'not', 'symmetry', 'protected', 'against', 'coulomb', 'repulsion', 'remarkably', 'the', 'transition', 'temperatures', 'and', 'the', 'excitation', 'gap', 'are', 'quite', 'robust', 'across', 'the', 'large', 'family', 'of', 'iron', 'based', 'superconductors', 'despite', 'drastic', 'changes', 'in', 'fermi', 'surface', 'geometry', 'the', 'coulomb', 'problem', 'is', 'to', 'understand', 'how', 'these', 'superconductors', 'avoid', 'the', 'strong', 'onsite', 'coulomb', 'interaction', 'at', 'the', 'iron', 'atoms', 'while', 'maintaining', 'a', 'robust', 'transition', 'temperature', 'within', 'the', 'dominant', 'space', 'of', 't_2g', 'orbitals', 'onsite', 'repulsion', 'in', 'the', 'fescs', 'enforces', 'two', 'linearly', 'independent', 'components', 'of', 'the', 'condensate', 'to', 'vanish', 'this', 'raises', 'the', 'possibility', 'that', 'ironbased', 'superconductors', 'might', 'adapt', 'their', 'condensate', 'to', 'the', 'coulomb', 'constraints', 'by', 'rotating', 'the', 'pairing', 'state', 'within', 'the', 'large', 'manifold', 'of', 'entangled', 'extended', 'swave', 'gap', 'functions', 'with', 'different', 'orbital', 'and', 'momentum', 'space', 'structure', 'we', 'examine', 'this', 'orbital', 'and', 'kspace', 'flexibility', 'okf', 'mechanism', 'using', 'both', 'landau', 'theory', 'and', 'microscopic', 'calculations', 'within', 'a', 'multiorbital', 'tj', 'model', 'based', 'on', 'our', 'results', 'we', 'conclude', 'that', 'okf', 'necessitates', 'a', 'large', 'condensate', 'degeneracy', 'one', 'interesting', 'possibility', 'raised', 'by', 'our', 'results', 'is', 'that', 'a', 'resolution', 'to', 'the', 'coulomb', 'problem', 'in', 'fesc', 'might', 'require', 'a', 'reconsideration', 'of', 'triplet', 'pairing']] | [-0.20007645362012694, 0.21163814862122327, -0.04546612167097111, 0.12898476578993723, -0.07073609191910223, -0.16399520040358032, 0.10661241946320962, 0.36066937329003, -0.23257232478095424, -0.27420845369319197, -0.05512953837486831, -0.3088808050167493, -0.0911664326999788, 0.10111390712031286, 0.018633659591550254, -0.012480672157247259, -0.010471622791197715, -0.06625128958069701, -0.14887248603344866, -0.2522789563906069, 0.3826542126856782, 0.012532261944013752, 0.32221486520097414, 0.13494609155917936, 0.01686048126224466, 0.0335130848230399, 0.12884434365126923, 0.002515346620577585, -0.11101934785623635, 0.09360851202430727, 0.273061507714576, -0.060895667179475005, 0.2339950492217516, -0.4398979451036965, -0.22517675842920487, 0.021702663168061825, 0.16382779594219168, 0.17449130040165414, -0.05163758711694185, -0.2989294013441211, -0.008642342193240319, -0.19608914679048037, -0.16576171247288585, -0.1393205144400285, -0.009788435131236159, -0.025281013062781174, -0.2182398809051268, 0.08841249220440107, 0.07219880417746614, 0.0634710150026711, -0.10414547383822877, -0.11512305961470261, -0.06436489686379303, 0.01550717674186359, 0.10107011900864298, 0.044313037382307074, 0.1047102585605421, -0.13716548946309798, -0.05344488956457512, 0.3822019054502075, -0.035485457892369746, -0.1109000350809609, 0.19128240620943182, -0.13727419335639687, -0.09877023152416722, 0.1584619839091884, 0.0807806386193731, 0.06069843456704132, -0.11146328706003848, 0.12072000102812631, -0.032600372749841726, 0.18704261073626277, -0.0023585286736958707, 0.11176495269326625, 0.2800416123178421, 0.17947583691207597, 0.042361308562690145, 0.08603960186457073, -0.11696391766702738, -0.11604092154190923, -0.25005192900396356, -0.10265963878559015, -0.21669431792506288, 0.008264014025344019, -0.06445630106662231, -0.18229404717067613, 0.3928627344245218, 0.1767784479624507, 0.20619524489250976, -0.07968893580769561, 0.21569799088327346, 0.08962221941181618, 0.09965165937877957, 0.02045961452478712, 0.26158542746226443, 0.12626657843110012, 0.06832694463464761, -0.3421852777175831, 0.04763460641425818, 0.05522485988713199] |
1,802.10581 | Orbifolds of Lattice Vertex Operator Algebras at $d=48$ and $d=72$ | Motivated by the notion of extremal vertex operator algebras, we investigate
cyclic orbifolds of vertex operator algebras coming from extremal even
self-dual lattices in $d=48$ and $d=72$. In this way we construct about one
hundred new examples of holomorphic VOAs with a small number of low weight
states.
| math.QA hep-th math-ph math.MP | motivated by the notion of extremal vertex operator algebras we investigate cyclic orbifolds of vertex operator algebras coming from extremal even selfdual lattices in d48 and d72 in this way we construct about one hundred new examples of holomorphic voas with a small number of low weight states | [['motivated', 'by', 'the', 'notion', 'of', 'extremal', 'vertex', 'operator', 'algebras', 'we', 'investigate', 'cyclic', 'orbifolds', 'of', 'vertex', 'operator', 'algebras', 'coming', 'from', 'extremal', 'even', 'selfdual', 'lattices', 'in', 'd48', 'and', 'd72', 'in', 'this', 'way', 'we', 'construct', 'about', 'one', 'hundred', 'new', 'examples', 'of', 'holomorphic', 'voas', 'with', 'a', 'small', 'number', 'of', 'low', 'weight', 'states']] | [-0.16098043958966932, 0.1477852618554607, 0.0131463777506724, 0.09435549443151103, -0.10656846146351502, -0.1813663428668709, 0.0073884779994841665, 0.33291813645822305, -0.32502123682449263, -0.22982519795186818, 0.11097095502676287, -0.32506175083108246, -0.15702227489479506, 0.1309431521416021, -0.14485536471086866, 0.0165081584903722, 0.08587782477843575, 0.1075417137471959, -0.11905336029303726, -0.26244614882549894, 0.456959190312773, 0.007510834557857986, 0.13371814403217286, 0.06519683583367926, 0.11231978745975842, 0.028791033420323704, -0.03778431189857656, -0.001840323015737037, -0.17659552486535782, 0.14257862817976275, 0.3086963092209771, 0.061361219763057306, 0.20850049362828335, -0.3954712082631886, -0.11886890222861742, 0.19708758301567286, 0.1199028104262349, 0.0921935459676509, -0.043771879960938044, -0.21571789775043726, 0.09049816108017694, -0.22668649062203863, -0.19206008222924234, -0.0796296547438639, 0.04435403811900566, -0.02808169062094142, -0.1928157354122959, 0.016860486794030294, 0.08105464661881949, 0.12182732209718476, -0.04922442446695641, -0.1359302912799952, -0.05776720789435785, 0.042347022254640855, -0.03024331897419567, 0.025042313839852188, 0.06828928018997733, -0.12766399829464112, -0.20199339340130487, 0.2779973818687722, -0.022248685942031443, -0.17773821476536492, 0.09461308088308822, -0.21381817861887006, -0.17536507303399654, 0.07577590233025451, 0.09659011876404595, 0.2064641851466149, -0.07678225844089563, 0.17173776475283375, -0.12127084779785946, 0.022073907156785328, 0.16147519659716636, 0.07255480150342919, 0.17531460461517176, 0.06799531655754738, 0.10166255792137235, 0.2323031647974858, 0.05292186010046862, -0.06744167025317438, -0.3440134788591725, -0.07512535366549855, -0.10866523980318259, 0.1833924069069326, -0.1591804098858726, -0.19938739819917828, 0.463074319200435, 0.10204232078588878, 0.23837711479670057, 0.07728532836578476, 0.12053459566474582, 0.040869637101422995, 0.15885155083378777, 0.0809383056233249, 0.12600641402726373, 0.2429578862162695, -0.0416797026215742, -0.1255172782645483, -0.11909831567694103, 0.22447375131499334] |
1,802.10582 | Evaluating Overfit and Underfit in Models of Network Community Structure | A common data mining task on networks is community detection, which seeks an
unsupervised decomposition of a network into structural groups based on
statistical regularities in the network's connectivity. Although many methods
exist, the No Free Lunch theorem for community detection implies that each
makes some kind of tradeoff, and no algorithm can be optimal on all inputs.
Thus, different algorithms will over or underfit on different inputs, finding
more, fewer, or just different communities than is optimal, and evaluation
methods that use a metadata partition as a ground truth will produce misleading
conclusions about general accuracy. Here, we present a broad evaluation of over
and underfitting in community detection, comparing the behavior of 16
state-of-the-art community detection algorithms on a novel and structurally
diverse corpus of 406 real-world networks. We find that (i) algorithms vary
widely both in the number of communities they find and in their corresponding
composition, given the same input, (ii) algorithms can be clustered into
distinct high-level groups based on similarities of their outputs on real-world
networks, and (iii) these differences induce wide variation in accuracy on link
prediction and link description tasks. We introduce a new diagnostic for
evaluating overfitting and underfitting in practice, and use it to roughly
divide community detection methods into general and specialized learning
algorithms. Across methods and inputs, Bayesian techniques based on the
stochastic block model and a minimum description length approach to
regularization represent the best general learning approach, but can be
outperformed under specific circumstances. These results introduce both a
theoretically principled approach to evaluate over and underfitting in models
of network community structure and a realistic benchmark by which new methods
may be evaluated and compared.
| stat.ML cs.SI physics.data-an q-bio.MN | a common data mining task on networks is community detection which seeks an unsupervised decomposition of a network into structural groups based on statistical regularities in the networks connectivity although many methods exist the no free lunch theorem for community detection implies that each makes some kind of tradeoff and no algorithm can be optimal on all inputs thus different algorithms will over or underfit on different inputs finding more fewer or just different communities than is optimal and evaluation methods that use a metadata partition as a ground truth will produce misleading conclusions about general accuracy here we present a broad evaluation of over and underfitting in community detection comparing the behavior of 16 stateoftheart community detection algorithms on a novel and structurally diverse corpus of 406 realworld networks we find that i algorithms vary widely both in the number of communities they find and in their corresponding composition given the same input ii algorithms can be clustered into distinct highlevel groups based on similarities of their outputs on realworld networks and iii these differences induce wide variation in accuracy on link prediction and link description tasks we introduce a new diagnostic for evaluating overfitting and underfitting in practice and use it to roughly divide community detection methods into general and specialized learning algorithms across methods and inputs bayesian techniques based on the stochastic block model and a minimum description length approach to regularization represent the best general learning approach but can be outperformed under specific circumstances these results introduce both a theoretically principled approach to evaluate over and underfitting in models of network community structure and a realistic benchmark by which new methods may be evaluated and compared | [['a', 'common', 'data', 'mining', 'task', 'on', 'networks', 'is', 'community', 'detection', 'which', 'seeks', 'an', 'unsupervised', 'decomposition', 'of', 'a', 'network', 'into', 'structural', 'groups', 'based', 'on', 'statistical', 'regularities', 'in', 'the', 'networks', 'connectivity', 'although', 'many', 'methods', 'exist', 'the', 'no', 'free', 'lunch', 'theorem', 'for', 'community', 'detection', 'implies', 'that', 'each', 'makes', 'some', 'kind', 'of', 'tradeoff', 'and', 'no', 'algorithm', 'can', 'be', 'optimal', 'on', 'all', 'inputs', 'thus', 'different', 'algorithms', 'will', 'over', 'or', 'underfit', 'on', 'different', 'inputs', 'finding', 'more', 'fewer', 'or', 'just', 'different', 'communities', 'than', 'is', 'optimal', 'and', 'evaluation', 'methods', 'that', 'use', 'a', 'metadata', 'partition', 'as', 'a', 'ground', 'truth', 'will', 'produce', 'misleading', 'conclusions', 'about', 'general', 'accuracy', 'here', 'we', 'present', 'a', 'broad', 'evaluation', 'of', 'over', 'and', 'underfitting', 'in', 'community', 'detection', 'comparing', 'the', 'behavior', 'of', '16', 'stateoftheart', 'community', 'detection', 'algorithms', 'on', 'a', 'novel', 'and', 'structurally', 'diverse', 'corpus', 'of', '406', 'realworld', 'networks', 'we', 'find', 'that', 'i', 'algorithms', 'vary', 'widely', 'both', 'in', 'the', 'number', 'of', 'communities', 'they', 'find', 'and', 'in', 'their', 'corresponding', 'composition', 'given', 'the', 'same', 'input', 'ii', 'algorithms', 'can', 'be', 'clustered', 'into', 'distinct', 'highlevel', 'groups', 'based', 'on', 'similarities', 'of', 'their', 'outputs', 'on', 'realworld', 'networks', 'and', 'iii', 'these', 'differences', 'induce', 'wide', 'variation', 'in', 'accuracy', 'on', 'link', 'prediction', 'and', 'link', 'description', 'tasks', 'we', 'introduce', 'a', 'new', 'diagnostic', 'for', 'evaluating', 'overfitting', 'and', 'underfitting', 'in', 'practice', 'and', 'use', 'it', 'to', 'roughly', 'divide', 'community', 'detection', 'methods', 'into', 'general', 'and', 'specialized', 'learning', 'algorithms', 'across', 'methods', 'and', 'inputs', 'bayesian', 'techniques', 'based', 'on', 'the', 'stochastic', 'block', 'model', 'and', 'a', 'minimum', 'description', 'length', 'approach', 'to', 'regularization', 'represent', 'the', 'best', 'general', 'learning', 'approach', 'but', 'can', 'be', 'outperformed', 'under', 'specific', 'circumstances', 'these', 'results', 'introduce', 'both', 'a', 'theoretically', 'principled', 'approach', 'to', 'evaluate', 'over', 'and', 'underfitting', 'in', 'models', 'of', 'network', 'community', 'structure', 'and', 'a', 'realistic', 'benchmark', 'by', 'which', 'new', 'methods', 'may', 'be', 'evaluated', 'and', 'compared']] | [-0.06195362031035724, 0.006356526005765773, -0.08083694206018532, 0.11262720975542574, -0.10900416324397416, -0.1738317559351604, 0.07617973912939695, 0.44848890738545116, -0.2416258954193576, -0.3512379042538149, 0.08985504216689151, -0.2452088825080344, -0.19659630931647762, 0.22272000852057577, -0.10310723908312086, 0.04637950537061053, 0.13595294890359844, 0.06054574415154223, -0.08240038644954828, -0.2675108878183112, 0.29474856752785855, 0.021297063286017093, 0.34356654354872135, 0.039931792187728986, 0.0737934946598086, -0.027522099854624164, -0.05508053663735544, 0.05880159274285168, -0.09437333491719722, 0.15850260868568772, 0.3085600372941891, 0.23596998303796032, 0.3263419562376969, -0.40425210247184235, -0.22408218905994934, 0.1397435855702497, 0.1413131213380049, 0.11240954033149007, 0.006294827522599787, -0.3079158736683894, 0.0925377968149925, -0.1580620712513337, 0.020782676708352352, -0.1391535984967569, -0.018393923911831474, 0.014250358078944763, -0.2633099998632263, 0.04056314004618408, 0.03507337613097791, 0.07221086520003155, -0.0489653945750823, -0.15181338523689192, 0.042716180237143166, 0.1609811627962959, 0.017603788385999256, 0.007651598812662997, 0.13112074708333238, -0.15872057028274347, -0.17017038273292462, 0.3724728551393907, -0.0359237839511999, -0.19332467333042586, 0.2350316096388269, -0.018862295122484544, -0.19302762855409777, 0.11303667631748665, 0.2501792772174148, 0.11108050249250871, -0.1555462861934627, 0.005151119895786645, -0.03975274255332936, 0.18252425562656885, 0.0582888119854033, -0.0001230234230336334, 0.18407685975149174, 0.20765266061311455, 0.07552326739013161, 0.09385465898750615, -0.07207534959639555, -0.09644132085418927, -0.2190113260452303, -0.10468115906696766, -0.16937433010607492, -0.028195993801896944, -0.1274544314007861, -0.17908500460741508, 0.4148214731797842, 0.2126169701710231, 0.18642714522097126, 0.09028134871654661, 0.3085053558290903, 0.025990424030793033, 0.0905137925778815, 0.10042716577237505, 0.1749945700493949, 0.04959995044669735, 0.06020050979194431, -0.14023941326574588, 0.12261710206678669, 0.014764230432254928] |
1,802.10583 | Reducing Lambda Terms with Traversals | We introduce a method to evaluate untyped lambda terms by combining the
theory of traversals, a term-tree traversing technique inspired from Game
Semantics, with judicious use of the eta-conversion rule of the lambda
calculus.
The traversal theory of the simply-typed lambda calculus relies on the
eta-long transform to ensure that when traversing an application, there is a
subterm representing every possible operator's argument. In the untyped
setting, we instead exhibit the missing operand via ad-hoc instantiation of the
eta-expansion rule, which allows the traversal to proceed as if the operand
existed in the original term. This gives rise to a more generic concept of
traversals for lambda terms. A notable improvement, in addition to handling
untyped terms, is that no preliminary transformation is required: the original
unaltered lambda term is traversed.
We show that by bounding the non-determinism of the traversal rule for free
variables, one can effectively compute a set of traversals characterizing the
paths in the tree representation of the beta-normal form, when it exists. This
yields an evaluation algorithm for untyped lambda-terms. We prove correctness
by showing that traversals implement leftmost linear reduction, a
generalization of the head linear reduction of Danos et. al.
| cs.PL cs.LO | we introduce a method to evaluate untyped lambda terms by combining the theory of traversals a termtree traversing technique inspired from game semantics with judicious use of the etaconversion rule of the lambda calculus the traversal theory of the simplytyped lambda calculus relies on the etalong transform to ensure that when traversing an application there is a subterm representing every possible operators argument in the untyped setting we instead exhibit the missing operand via adhoc instantiation of the etaexpansion rule which allows the traversal to proceed as if the operand existed in the original term this gives rise to a more generic concept of traversals for lambda terms a notable improvement in addition to handling untyped terms is that no preliminary transformation is required the original unaltered lambda term is traversed we show that by bounding the nondeterminism of the traversal rule for free variables one can effectively compute a set of traversals characterizing the paths in the tree representation of the betanormal form when it exists this yields an evaluation algorithm for untyped lambdaterms we prove correctness by showing that traversals implement leftmost linear reduction a generalization of the head linear reduction of danos et al | [['we', 'introduce', 'a', 'method', 'to', 'evaluate', 'untyped', 'lambda', 'terms', 'by', 'combining', 'the', 'theory', 'of', 'traversals', 'a', 'termtree', 'traversing', 'technique', 'inspired', 'from', 'game', 'semantics', 'with', 'judicious', 'use', 'of', 'the', 'etaconversion', 'rule', 'of', 'the', 'lambda', 'calculus', 'the', 'traversal', 'theory', 'of', 'the', 'simplytyped', 'lambda', 'calculus', 'relies', 'on', 'the', 'etalong', 'transform', 'to', 'ensure', 'that', 'when', 'traversing', 'an', 'application', 'there', 'is', 'a', 'subterm', 'representing', 'every', 'possible', 'operators', 'argument', 'in', 'the', 'untyped', 'setting', 'we', 'instead', 'exhibit', 'the', 'missing', 'operand', 'via', 'adhoc', 'instantiation', 'of', 'the', 'etaexpansion', 'rule', 'which', 'allows', 'the', 'traversal', 'to', 'proceed', 'as', 'if', 'the', 'operand', 'existed', 'in', 'the', 'original', 'term', 'this', 'gives', 'rise', 'to', 'a', 'more', 'generic', 'concept', 'of', 'traversals', 'for', 'lambda', 'terms', 'a', 'notable', 'improvement', 'in', 'addition', 'to', 'handling', 'untyped', 'terms', 'is', 'that', 'no', 'preliminary', 'transformation', 'is', 'required', 'the', 'original', 'unaltered', 'lambda', 'term', 'is', 'traversed', 'we', 'show', 'that', 'by', 'bounding', 'the', 'nondeterminism', 'of', 'the', 'traversal', 'rule', 'for', 'free', 'variables', 'one', 'can', 'effectively', 'compute', 'a', 'set', 'of', 'traversals', 'characterizing', 'the', 'paths', 'in', 'the', 'tree', 'representation', 'of', 'the', 'betanormal', 'form', 'when', 'it', 'exists', 'this', 'yields', 'an', 'evaluation', 'algorithm', 'for', 'untyped', 'lambdaterms', 'we', 'prove', 'correctness', 'by', 'showing', 'that', 'traversals', 'implement', 'leftmost', 'linear', 'reduction', 'a', 'generalization', 'of', 'the', 'head', 'linear', 'reduction', 'of', 'danos', 'et', 'al']] | [-0.11257804149747394, 0.06867069454600233, -0.10522746055905428, 0.06033089748744555, -0.1328465020219248, -0.12627765979166575, 0.10604864946379297, 0.32545772923598276, -0.3105214407797135, -0.2864735319840808, 0.047903763924511726, -0.24199078864900733, -0.15096185953577154, 0.1410973136452478, -0.1038915281491258, 0.010278373222183628, 0.08628503839154103, 0.05657906319523595, -0.03065836846200778, -0.2294364702544588, 0.31827173854609786, 0.01848322303951286, 0.2215857431148515, 0.03891844904175047, 0.13840816540345935, 0.07752031179567434, -0.05292729164483314, 0.02888040635350746, -0.0963941984817436, 0.1291086528232422, 0.2404849221209813, 0.20414623641288965, 0.29807068377771634, -0.4095257302359426, -0.1409864808229031, 0.10720323443355173, 0.1155731128048651, 0.11067150884665568, 0.013801782345384258, -0.2467426570209185, 0.11625874760805524, -0.1685973516156532, -0.10102693754915609, -0.10011216327992085, 0.039624390296743625, -0.020169118769135633, -0.27957822925881626, -0.004503999151396427, 0.115345589214091, 0.04280569540739081, -0.021282833012255368, -0.07633023963552256, -0.00925847307476455, 0.07152837602398839, -0.012486612090610505, 0.042682073121355156, 0.0902975294207938, -0.10407748630058984, -0.18198475824457774, 0.378020977502996, -0.07550674982635382, -0.22553806424323355, 0.13768578251612554, -0.03002615323885507, -0.15096468543729832, 0.10979927741663204, 0.0733725761649074, 0.13177775458724372, -0.11190882685114797, 0.14359292088402914, -0.0490936782185862, 0.17676768416164385, 0.14329142211552365, 0.015375285884053399, 0.13181869656486034, 0.1799322191965478, 0.08387157567728733, 0.17650771044079483, -0.013435570338318489, -0.10640226624913264, -0.3580119716622819, -0.17369457050562673, -0.13778576032575413, -0.0034846955089417007, -0.12341391205182779, -0.21490230942481034, 0.34394398358885736, 0.15818040538099162, 0.19786147806390197, 0.12070423902610086, 0.2975411591829358, 0.14986489006906528, 0.10171447171092744, 0.07576487926627058, 0.139920886332342, 0.08006069003772374, 0.08844688602605566, -0.1951870282232214, 0.11448961898286049, 0.13837139268652368] |
1,802.10584 | Three-Dimensional Shapes of Spinning Helium Nanodroplets | A significant fraction of superfluid helium nanodroplets produced in a
free-jet expansion have been observed to gain high angular momentum resulting
in large centrifugal deformation. We measured single-shot diffraction patterns
of individual rotating helium nanodroplets up to large scattering angles using
intense extreme ultraviolet light pulses from the FERMI free-electron laser.
Distinct asymmetric features in the wide-angle diffraction patterns enable the
unique and systematic identification of the three-dimensional droplet shapes.
The analysis of a large dataset allows us to follow the evolution from
axisymmetric oblate to triaxial prolate and two-lobed droplets. We find that
the shapes of spinning superfluid helium droplets exhibit the same stages as
classical rotating droplets while the previously reported metastable, oblate
shapes of quantum droplets are not observed. Our three-dimensional analysis
represents a valuable landmark for clarifying the interrelation between
morphology and superfluidity on the nanometer scale.
| physics.atm-clus cond-mat.mes-hall | a significant fraction of superfluid helium nanodroplets produced in a freejet expansion have been observed to gain high angular momentum resulting in large centrifugal deformation we measured singleshot diffraction patterns of individual rotating helium nanodroplets up to large scattering angles using intense extreme ultraviolet light pulses from the fermi freeelectron laser distinct asymmetric features in the wideangle diffraction patterns enable the unique and systematic identification of the threedimensional droplet shapes the analysis of a large dataset allows us to follow the evolution from axisymmetric oblate to triaxial prolate and twolobed droplets we find that the shapes of spinning superfluid helium droplets exhibit the same stages as classical rotating droplets while the previously reported metastable oblate shapes of quantum droplets are not observed our threedimensional analysis represents a valuable landmark for clarifying the interrelation between morphology and superfluidity on the nanometer scale | [['a', 'significant', 'fraction', 'of', 'superfluid', 'helium', 'nanodroplets', 'produced', 'in', 'a', 'freejet', 'expansion', 'have', 'been', 'observed', 'to', 'gain', 'high', 'angular', 'momentum', 'resulting', 'in', 'large', 'centrifugal', 'deformation', 'we', 'measured', 'singleshot', 'diffraction', 'patterns', 'of', 'individual', 'rotating', 'helium', 'nanodroplets', 'up', 'to', 'large', 'scattering', 'angles', 'using', 'intense', 'extreme', 'ultraviolet', 'light', 'pulses', 'from', 'the', 'fermi', 'freeelectron', 'laser', 'distinct', 'asymmetric', 'features', 'in', 'the', 'wideangle', 'diffraction', 'patterns', 'enable', 'the', 'unique', 'and', 'systematic', 'identification', 'of', 'the', 'threedimensional', 'droplet', 'shapes', 'the', 'analysis', 'of', 'a', 'large', 'dataset', 'allows', 'us', 'to', 'follow', 'the', 'evolution', 'from', 'axisymmetric', 'oblate', 'to', 'triaxial', 'prolate', 'and', 'twolobed', 'droplets', 'we', 'find', 'that', 'the', 'shapes', 'of', 'spinning', 'superfluid', 'helium', 'droplets', 'exhibit', 'the', 'same', 'stages', 'as', 'classical', 'rotating', 'droplets', 'while', 'the', 'previously', 'reported', 'metastable', 'oblate', 'shapes', 'of', 'quantum', 'droplets', 'are', 'not', 'observed', 'our', 'threedimensional', 'analysis', 'represents', 'a', 'valuable', 'landmark', 'for', 'clarifying', 'the', 'interrelation', 'between', 'morphology', 'and', 'superfluidity', 'on', 'the', 'nanometer', 'scale']] | [-0.08106735070302551, 0.22081983072151032, -0.15123921811381089, 0.06592263143642672, -0.0398544895728784, -0.11132996893720701, 0.003377687057945877, 0.3986809887125024, -0.19747356578217087, -0.33686199357200947, -0.021461756436370445, -0.29293148714693545, -0.04958976303184629, 0.17930197652562388, -0.011918700483095433, 0.08626967069825955, 0.05538376363859113, -0.08621833728227232, -0.07894929904474078, -0.14547701919717448, 0.27969511623959986, 0.06651630640345892, 0.31116459019083, 0.015081812497893615, 0.07679947957263461, -0.03967257739443864, 0.0036719191985737, 0.0009875957937245923, -0.16858194031213186, 0.056585536493262874, 0.23005603682582398, 0.0012081859417126647, 0.1677459571477292, -0.47259515210587, -0.20763424131374839, 0.05720751730134777, 0.20161771701449263, 0.17971646998776122, -0.11480212388310715, -0.2904733529513968, -0.02733321999299473, -0.1589870901379202, -0.22923422646043556, -0.08336820704197245, 0.06483654068184218, 0.07792462808304533, -0.17830468657360013, 0.10628914686385542, 0.04919910457891612, 0.08449510944441758, -0.08164896765166695, -0.06873010983025389, -0.04411482814133966, 0.0932675460819155, 0.05731045816126945, 0.01448712373717821, 0.2139422814095659, -0.144526467059872, -0.022709340662030238, 0.4101694205775857, -0.04576945633494428, -0.08527962494242404, 0.1785956690753145, -0.25624262098489065, -0.07049901910192732, 0.27528234245089284, 0.18923590119395936, 0.13077622813704823, -0.07847569115193827, -0.05136821211573468, -0.060511922357337815, 0.20951961427261787, 0.1632560078154451, 0.010780210237550948, 0.32274636284481467, 0.2259391526966023, -0.059662039922217705, 0.13831910500884986, -0.21267569147416257, -0.09753356478177011, -0.2163908621894994, -0.08497941415158233, -0.13863675550424626, 0.03817967734160318, -0.10180069497821803, -0.18319114463270775, 0.3400453874176102, 0.053149170188615764, 0.18056150412386548, -0.046765270353561005, 0.28979942458016533, 0.008945500597058396, 0.07593284357239359, 0.025667961770003394, 0.31311267466683473, 0.1481284235637369, 0.11867286381394869, -0.2885502412748922, 0.016325730082046772, -0.01066231483460537] |
1,802.10585 | A staggered semi-implicit hybrid FV/FE projection method for weakly
compressible flows | In this article we present a novel staggered semi-implicit hybrid
finite-volume/finite-element (FV/FE) method for the resolution of weakly
compressible flows in two and three space dimensions. The pressure-based
methodology introduced in Berm\'udez et al. 2014 and Busto et al. 2018 for
viscous incompressible flows is extended here to solve the compressible
Navier-Stokes equations. Instead of considering the classical system including
the energy conservation equation, we replace it by the pressure evolution
equation written in non-conservative form. To ease the discretization of
complex spatial domains, face-type unstructured staggered meshes are
considered. A projection method allows the decoupling of the computation of the
density and linear momentum variables from the pressure. Then, an explicit
finite volume scheme is used for the resolution of the transport diffusion
equations on the dual mesh, whereas the pressure system is solved implicitly by
using continuous finite elements defined on the primal simplex mesh.
Consequently, the CFL stability condition depends only on the flow velocity,
avoiding the severe time restrictions that might be imposed by the sound
velocity in the weakly compressible regime. High order of accuracy in space and
time of the transport diffusion stage is attained using a local ADER (LADER)
methodology. Moreover, also the CVC Kolgan-type second order in space and first
order in time scheme is considered. To prevent spurious oscillations in the
presence of shocks, an ENO-based reconstruction, the minmod limiter or the
Barth-Jespersen limiter are employed. To show the validity and robustness of
our novel staggered semi-implicit hybrid FV/FE scheme, several benchmarks are
analysed, showing a good agreement with available exact solutions and numerical
reference data from low Mach numbers, up to Mach numbers of the order of unity.
| math.NA cs.NA math.AP | in this article we present a novel staggered semiimplicit hybrid finitevolumefiniteelement fvfe method for the resolution of weakly compressible flows in two and three space dimensions the pressurebased methodology introduced in bermudez et al 2014 and busto et al 2018 for viscous incompressible flows is extended here to solve the compressible navierstokes equations instead of considering the classical system including the energy conservation equation we replace it by the pressure evolution equation written in nonconservative form to ease the discretization of complex spatial domains facetype unstructured staggered meshes are considered a projection method allows the decoupling of the computation of the density and linear momentum variables from the pressure then an explicit finite volume scheme is used for the resolution of the transport diffusion equations on the dual mesh whereas the pressure system is solved implicitly by using continuous finite elements defined on the primal simplex mesh consequently the cfl stability condition depends only on the flow velocity avoiding the severe time restrictions that might be imposed by the sound velocity in the weakly compressible regime high order of accuracy in space and time of the transport diffusion stage is attained using a local ader lader methodology moreover also the cvc kolgantype second order in space and first order in time scheme is considered to prevent spurious oscillations in the presence of shocks an enobased reconstruction the minmod limiter or the barthjespersen limiter are employed to show the validity and robustness of our novel staggered semiimplicit hybrid fvfe scheme several benchmarks are analysed showing a good agreement with available exact solutions and numerical reference data from low mach numbers up to mach numbers of the order of unity | [['in', 'this', 'article', 'we', 'present', 'a', 'novel', 'staggered', 'semiimplicit', 'hybrid', 'finitevolumefiniteelement', 'fvfe', 'method', 'for', 'the', 'resolution', 'of', 'weakly', 'compressible', 'flows', 'in', 'two', 'and', 'three', 'space', 'dimensions', 'the', 'pressurebased', 'methodology', 'introduced', 'in', 'bermudez', 'et', 'al', '2014', 'and', 'busto', 'et', 'al', '2018', 'for', 'viscous', 'incompressible', 'flows', 'is', 'extended', 'here', 'to', 'solve', 'the', 'compressible', 'navierstokes', 'equations', 'instead', 'of', 'considering', 'the', 'classical', 'system', 'including', 'the', 'energy', 'conservation', 'equation', 'we', 'replace', 'it', 'by', 'the', 'pressure', 'evolution', 'equation', 'written', 'in', 'nonconservative', 'form', 'to', 'ease', 'the', 'discretization', 'of', 'complex', 'spatial', 'domains', 'facetype', 'unstructured', 'staggered', 'meshes', 'are', 'considered', 'a', 'projection', 'method', 'allows', 'the', 'decoupling', 'of', 'the', 'computation', 'of', 'the', 'density', 'and', 'linear', 'momentum', 'variables', 'from', 'the', 'pressure', 'then', 'an', 'explicit', 'finite', 'volume', 'scheme', 'is', 'used', 'for', 'the', 'resolution', 'of', 'the', 'transport', 'diffusion', 'equations', 'on', 'the', 'dual', 'mesh', 'whereas', 'the', 'pressure', 'system', 'is', 'solved', 'implicitly', 'by', 'using', 'continuous', 'finite', 'elements', 'defined', 'on', 'the', 'primal', 'simplex', 'mesh', 'consequently', 'the', 'cfl', 'stability', 'condition', 'depends', 'only', 'on', 'the', 'flow', 'velocity', 'avoiding', 'the', 'severe', 'time', 'restrictions', 'that', 'might', 'be', 'imposed', 'by', 'the', 'sound', 'velocity', 'in', 'the', 'weakly', 'compressible', 'regime', 'high', 'order', 'of', 'accuracy', 'in', 'space', 'and', 'time', 'of', 'the', 'transport', 'diffusion', 'stage', 'is', 'attained', 'using', 'a', 'local', 'ader', 'lader', 'methodology', 'moreover', 'also', 'the', 'cvc', 'kolgantype', 'second', 'order', 'in', 'space', 'and', 'first', 'order', 'in', 'time', 'scheme', 'is', 'considered', 'to', 'prevent', 'spurious', 'oscillations', 'in', 'the', 'presence', 'of', 'shocks', 'an', 'enobased', 'reconstruction', 'the', 'minmod', 'limiter', 'or', 'the', 'barthjespersen', 'limiter', 'are', 'employed', 'to', 'show', 'the', 'validity', 'and', 'robustness', 'of', 'our', 'novel', 'staggered', 'semiimplicit', 'hybrid', 'fvfe', 'scheme', 'several', 'benchmarks', 'are', 'analysed', 'showing', 'a', 'good', 'agreement', 'with', 'available', 'exact', 'solutions', 'and', 'numerical', 'reference', 'data', 'from', 'low', 'mach', 'numbers', 'up', 'to', 'mach', 'numbers', 'of', 'the', 'order', 'of', 'unity']] | [-0.15146071584248502, 0.10326328069689529, -0.08027142469891933, 0.015537389624148124, -0.06620156496797723, -0.09200522509162072, 0.012380504051085423, 0.31301670370416507, -0.2820652321722634, -0.3123188757924018, 0.10625696651016672, -0.21877285957221088, -0.07255767960601521, 0.16645003010225654, -0.06457996603987542, 0.1116643740858072, 0.05086765395761985, -0.03852218739360709, -0.07674273273226356, -0.26527048192952796, 0.31750250598760665, 0.04818216882025202, 0.2961414389019073, 0.02285597439061988, 0.14875299401782857, -0.06480160638457164, -0.05199216242396721, 0.07153795738629048, -0.12696650387884734, 0.06512643221024147, 0.19820634476383459, 0.03268255125343179, 0.2662907633137096, -0.4415597563609481, -0.2376541789414154, 0.02815920965470098, 0.13446127564335864, 0.10910268937479015, -0.03697182599765559, -0.2619273115535853, 0.0819034166323642, -0.17083991625587697, -0.14450337695199306, -0.10392758377862198, -0.025815391975144545, 0.05383641655832805, -0.29660006808117034, 0.1382941128676369, 0.04908286186487035, 0.046582210819340414, -0.07178724093246273, -0.08179670838311452, -0.04075841770563447, 0.06929617027872828, 0.007300192324220444, 0.01955632073632269, 0.03685730032243387, -0.1153429893526697, -0.05872407662854703, 0.41590223054712017, -0.06159944175613216, -0.2762353619957274, 0.20081815250321394, -0.11238805158581171, -0.07853235633595398, 0.16231646492076968, 0.1934266496518696, 0.1583338602135579, -0.10543027219828219, 0.09114210439093531, -0.023424399817897075, 0.1746720151704115, 0.08289093341143733, -0.04072571482223187, 0.10513398852199315, 0.16226451055026025, 0.08500649486323474, 0.08602256533534576, -0.09073073776806403, -0.12817813426782204, -0.31469407641087416, -0.1736011422868749, -0.1946791656125613, -0.017048862587695043, -0.10733672619794056, -0.160259455356195, 0.34283067546926355, 0.16600055504154793, 0.1326115581758872, 0.027879379725911552, 0.3311571260664129, 0.1544453510691205, 0.014233937989963495, 0.12410052733806272, 0.20542790695197052, 0.14647914884198043, 0.15590241014638365, -0.2730492977607624, 0.02859719459105421, 0.17093353700755096] |
1,802.10586 | Dynamic vorticity banding in discontinuously shear thickening
suspensions | It has recently been argued that steady-state vorticity bands cannot arise in
shear thickening suspensions, because the normal stress imbalance across the
interface between the bands will set up particle migrations. In this Letter, we
develop a simple continuum model that couples shear thickening to particle
migration. We show by linear stability analysis that homogeneous flow is
unstable towards vorticity banding, as expected, in the regime of negative
constitutive slope. In full nonlinear computations, we show however that the
resulting vorticity bands are unsteady, with spatiotemporal patterns governed
by stress-concentration coupling. We furthermore show that these dynamical
bands also arise in direct particle simulations, in good agreement with the
continuum model.
| cond-mat.soft physics.flu-dyn | it has recently been argued that steadystate vorticity bands cannot arise in shear thickening suspensions because the normal stress imbalance across the interface between the bands will set up particle migrations in this letter we develop a simple continuum model that couples shear thickening to particle migration we show by linear stability analysis that homogeneous flow is unstable towards vorticity banding as expected in the regime of negative constitutive slope in full nonlinear computations we show however that the resulting vorticity bands are unsteady with spatiotemporal patterns governed by stressconcentration coupling we furthermore show that these dynamical bands also arise in direct particle simulations in good agreement with the continuum model | [['it', 'has', 'recently', 'been', 'argued', 'that', 'steadystate', 'vorticity', 'bands', 'can', 'not', 'arise', 'in', 'shear', 'thickening', 'suspensions', 'because', 'the', 'normal', 'stress', 'imbalance', 'across', 'the', 'interface', 'between', 'the', 'bands', 'will', 'set', 'up', 'particle', 'migrations', 'in', 'this', 'letter', 'we', 'develop', 'a', 'simple', 'continuum', 'model', 'that', 'couples', 'shear', 'thickening', 'to', 'particle', 'migration', 'we', 'show', 'by', 'linear', 'stability', 'analysis', 'that', 'homogeneous', 'flow', 'is', 'unstable', 'towards', 'vorticity', 'banding', 'as', 'expected', 'in', 'the', 'regime', 'of', 'negative', 'constitutive', 'slope', 'in', 'full', 'nonlinear', 'computations', 'we', 'show', 'however', 'that', 'the', 'resulting', 'vorticity', 'bands', 'are', 'unsteady', 'with', 'spatiotemporal', 'patterns', 'governed', 'by', 'stressconcentration', 'coupling', 'we', 'furthermore', 'show', 'that', 'these', 'dynamical', 'bands', 'also', 'arise', 'in', 'direct', 'particle', 'simulations', 'in', 'good', 'agreement', 'with', 'the', 'continuum', 'model']] | [-0.1377354524364429, 0.1799360003413832, -0.1080078320976879, 0.036190299414946434, -0.03581603823529024, -0.11049808834650321, -0.016797192203479687, 0.39000565009025323, -0.31440694646776784, -0.2431864207610488, 0.03973915303504327, -0.23292394804801525, -0.21678636828437448, 0.15958912189047883, -0.032812585249124435, 0.04661927678846821, 0.08350930586831444, -0.09050537115295551, -0.01423092568022964, -0.1612837307080294, 0.28376194098382257, 0.02457039286543607, 0.3332751424833467, 0.04024922829246082, 0.06353451686611931, -0.05414390029285902, -0.021979310142342, 0.11049712154947754, -0.19464006555251348, 0.020824663883623935, 0.24546731749433093, -0.02562313428123681, 0.23423202683417393, -0.4365698351757601, -0.25997456275425584, 0.07923333500678252, 0.1797024919069372, 0.13672961444327875, -0.042953399294024815, -0.19968534306307056, 0.07889616570485357, -0.17165714973400878, -0.1232412255984465, -0.09623587343542438, 0.04018770040628234, 0.031417501245284384, -0.2566919225126704, 0.20093196550416387, 0.059363064350691275, 0.05588440234506769, -0.09008812267815561, -0.041261184469996284, -0.1137571553969922, 0.06965126290430947, 0.11492048819484678, -0.0018933371840310948, 0.14017107816757093, -0.1644388036698469, -0.056793120142953867, 0.3905336131158817, -0.10086387072286536, -0.20731015703807185, 0.24862477745045908, -0.17917911452241242, -0.1126380401318394, 0.18129535552413603, 0.1862369466949271, 0.03393292877340822, -0.10101691364044589, 0.04173572756865594, -0.07976860651563454, 0.15764646352285386, 0.06060131010807319, -0.04671676936784154, 0.25585650561177836, 0.15333208417723654, 0.06402511289343238, 0.12361667937199984, -0.10383341817318328, -0.11920627864310518, -0.3044113863725215, -0.12225272532253127, -0.15324574977941147, 0.020384799465708574, -0.06651479862167824, -0.16658132743655837, 0.34299318936453865, 0.12469499851951175, 0.16781454700269802, 0.06308576349459015, 0.25488336246261106, 0.14224641898817936, 0.051208976306952536, 0.10469855150690169, 0.34161312690204276, 0.11808782875388195, 0.13213915432736809, -0.23994787584940372, 0.0393936618846575, 0.039656898543138856] |
1,802.10587 | Quasi-hereditary covers of higher zigzag-algebras | The aim of this paper is to define and study some quasi-hereditary covers for
higher zigzag algebras. We will show how these algebras satisfy three different
Koszul properties: they are Koszul in the classical sense, standard Koszul and
Koszul with respect to the standard module $\Delta$, according with the
definition given in \cite{Madsen1}. This last property gives rise to a well
defined duality and the $\Delta$-Koszul dual will be computed as the path
algebra of a quiver with relations.
| math.RT math.RA | the aim of this paper is to define and study some quasihereditary covers for higher zigzag algebras we will show how these algebras satisfy three different koszul properties they are koszul in the classical sense standard koszul and koszul with respect to the standard module delta according with the definition given in citemadsen1 this last property gives rise to a well defined duality and the deltakoszul dual will be computed as the path algebra of a quiver with relations | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'define', 'and', 'study', 'some', 'quasihereditary', 'covers', 'for', 'higher', 'zigzag', 'algebras', 'we', 'will', 'show', 'how', 'these', 'algebras', 'satisfy', 'three', 'different', 'koszul', 'properties', 'they', 'are', 'koszul', 'in', 'the', 'classical', 'sense', 'standard', 'koszul', 'and', 'koszul', 'with', 'respect', 'to', 'the', 'standard', 'module', 'delta', 'according', 'with', 'the', 'definition', 'given', 'in', 'citemadsen1', 'this', 'last', 'property', 'gives', 'rise', 'to', 'a', 'well', 'defined', 'duality', 'and', 'the', 'deltakoszul', 'dual', 'will', 'be', 'computed', 'as', 'the', 'path', 'algebra', 'of', 'a', 'quiver', 'with', 'relations']] | [-0.12451450346419826, 0.061482869948332124, -0.07639015628359257, 0.10709759271076809, -0.1315442300185215, -0.16620598105379406, -0.0749751797098165, 0.39673193835486203, -0.409095775646468, -0.21613311920186673, 0.10743642604509847, -0.20016603379581982, -0.17878765674928823, 0.1543544520958303, -0.2030470043850633, -0.061088544877771385, 0.07239731746869019, 0.09999117771020302, -0.13836838686629796, -0.28470272589952517, 0.3825884063083392, 0.04637308902919102, 0.24393271980807185, 0.04144927110666266, 0.0757900301176004, 0.022730492377797, -0.0481856685394469, 0.051134539606069805, -0.2029181576739901, 0.13960171273002067, 0.3134883742970534, 0.09061160754078092, 0.1794421927143748, -0.38592378177847236, -0.041699672440210216, 0.1566171164576633, 0.16480428091913032, 0.025895311950873107, 0.024257585931664858, -0.20491876128392342, 0.1169124360790309, -0.21382487854227805, -0.14096177266970372, -0.05182337689285095, 0.024635111778759614, 0.043311263455483966, -0.23909367710495225, -0.002217919762747792, 0.059550219864691965, 0.10467376470422515, -0.0671221821461446, -0.07905133164081818, -0.09463661068226568, 0.08261738371892044, -0.02938319737605082, 0.05138858095802462, 0.09207722163186051, -0.08929952793420316, -0.18414644445352352, 0.37133836025037825, -0.030098168071932517, -0.22043512789054942, 0.19734498413685614, -0.20732600360105818, -0.16855421354874778, 0.04118479585621315, 0.008714276067434978, 0.11689746914765774, -0.09336346049960224, 0.13707431524959154, -0.09138102496329409, 0.008107489646555712, 0.0806354408761343, 0.09333047135852468, 0.18751519862594135, 0.12184383542253038, 0.05850816763435992, 0.16480185677004883, 0.054487156932457134, -0.05979441449595376, -0.34069114139017004, -0.21254829093455696, -0.04546057881536679, 0.0867035542256557, -0.08596178883248612, -0.1415023397630415, 0.40898245100218517, 0.1761746198820989, 0.19149918529467705, 0.1596896725718696, 0.18158721471002373, 0.10641263813252011, 0.12834107240614218, 0.00963267665475798, 0.17653222194796678, 0.26002686105381984, 0.08881952302554288, -0.1087318382357271, -0.02371692970299568, 0.18578766695020768] |
1,802.10588 | IntLIM: Integration using Linear Models of metabolomics and gene
expression data | Integration of transcriptomic and metabolomic data improves functional
interpretation of disease-related metabolomic phenotypes, and facilitates
discovery of putative metabolite biomarkers and gene targets. For this reason,
these data are increasingly collected in large cohorts, driving a need for the
development of novel methods for their integration. Of note,
clinical/translational studies typically provide snapshot gene and metabolite
profiles and, oftentimes, most metabolites are not identified. Thus, in these
types of studies, pathway/network approaches that take into account the
complexity of gene-metabolite relationships may neither be applicable nor
readily uncover novel relationships. With this in mind, we propose a simple
linear modeling approach to capture phenotype-specific gene-metabolite
associations, with the assumption that co-regulation patterns reflect
functionally related genes and metabolites. The proposed linear model,
metabolite ~ gene + phenotype + gene:phenotype, specifically evaluates whether
gene-metabolite relationships differ by phenotype, by testing whether the
relationship in one phenotype is significantly different from the relationship
in another phenotype (via an interaction gene:phenotype p-value). Interaction
p-values for all possible gene-metabolite pairs are computed and significant
pairs are clustered by the directionality of associations. We implemented our
approach as an R package, IntLIM, which includes a user-friendly Shiny app. We
applied IntLIM to two published datasets, collected in NCI-60 cell lines and in
human breast tumor and non-tumor tissue. We demonstrate that IntLIM captures
relevant tumor-specific gene-metabolite associations involved in cancer-related
pathways. and also uncover novel relationships that could be tested
experimentally. The IntLIM R package is publicly available in GitHub
(https://github.com/mathelab/IntLIM).
| q-bio.GN q-bio.QM | integration of transcriptomic and metabolomic data improves functional interpretation of diseaserelated metabolomic phenotypes and facilitates discovery of putative metabolite biomarkers and gene targets for this reason these data are increasingly collected in large cohorts driving a need for the development of novel methods for their integration of note clinicaltranslational studies typically provide snapshot gene and metabolite profiles and oftentimes most metabolites are not identified thus in these types of studies pathwaynetwork approaches that take into account the complexity of genemetabolite relationships may neither be applicable nor readily uncover novel relationships with this in mind we propose a simple linear modeling approach to capture phenotypespecific genemetabolite associations with the assumption that coregulation patterns reflect functionally related genes and metabolites the proposed linear model metabolite gene phenotype genephenotype specifically evaluates whether genemetabolite relationships differ by phenotype by testing whether the relationship in one phenotype is significantly different from the relationship in another phenotype via an interaction genephenotype pvalue interaction pvalues for all possible genemetabolite pairs are computed and significant pairs are clustered by the directionality of associations we implemented our approach as an r package intlim which includes a userfriendly shiny app we applied intlim to two published datasets collected in nci60 cell lines and in human breast tumor and nontumor tissue we demonstrate that intlim captures relevant tumorspecific genemetabolite associations involved in cancerrelated pathways and also uncover novel relationships that could be tested experimentally the intlim r package is publicly available in github httpsgithubcommathelabintlim | [['integration', 'of', 'transcriptomic', 'and', 'metabolomic', 'data', 'improves', 'functional', 'interpretation', 'of', 'diseaserelated', 'metabolomic', 'phenotypes', 'and', 'facilitates', 'discovery', 'of', 'putative', 'metabolite', 'biomarkers', 'and', 'gene', 'targets', 'for', 'this', 'reason', 'these', 'data', 'are', 'increasingly', 'collected', 'in', 'large', 'cohorts', 'driving', 'a', 'need', 'for', 'the', 'development', 'of', 'novel', 'methods', 'for', 'their', 'integration', 'of', 'note', 'clinicaltranslational', 'studies', 'typically', 'provide', 'snapshot', 'gene', 'and', 'metabolite', 'profiles', 'and', 'oftentimes', 'most', 'metabolites', 'are', 'not', 'identified', 'thus', 'in', 'these', 'types', 'of', 'studies', 'pathwaynetwork', 'approaches', 'that', 'take', 'into', 'account', 'the', 'complexity', 'of', 'genemetabolite', 'relationships', 'may', 'neither', 'be', 'applicable', 'nor', 'readily', 'uncover', 'novel', 'relationships', 'with', 'this', 'in', 'mind', 'we', 'propose', 'a', 'simple', 'linear', 'modeling', 'approach', 'to', 'capture', 'phenotypespecific', 'genemetabolite', 'associations', 'with', 'the', 'assumption', 'that', 'coregulation', 'patterns', 'reflect', 'functionally', 'related', 'genes', 'and', 'metabolites', 'the', 'proposed', 'linear', 'model', 'metabolite', 'gene', 'phenotype', 'genephenotype', 'specifically', 'evaluates', 'whether', 'genemetabolite', 'relationships', 'differ', 'by', 'phenotype', 'by', 'testing', 'whether', 'the', 'relationship', 'in', 'one', 'phenotype', 'is', 'significantly', 'different', 'from', 'the', 'relationship', 'in', 'another', 'phenotype', 'via', 'an', 'interaction', 'genephenotype', 'pvalue', 'interaction', 'pvalues', 'for', 'all', 'possible', 'genemetabolite', 'pairs', 'are', 'computed', 'and', 'significant', 'pairs', 'are', 'clustered', 'by', 'the', 'directionality', 'of', 'associations', 'we', 'implemented', 'our', 'approach', 'as', 'an', 'r', 'package', 'intlim', 'which', 'includes', 'a', 'userfriendly', 'shiny', 'app', 'we', 'applied', 'intlim', 'to', 'two', 'published', 'datasets', 'collected', 'in', 'nci60', 'cell', 'lines', 'and', 'in', 'human', 'breast', 'tumor', 'and', 'nontumor', 'tissue', 'we', 'demonstrate', 'that', 'intlim', 'captures', 'relevant', 'tumorspecific', 'genemetabolite', 'associations', 'involved', 'in', 'cancerrelated', 'pathways', 'and', 'also', 'uncover', 'novel', 'relationships', 'that', 'could', 'be', 'tested', 'experimentally', 'the', 'intlim', 'r', 'package', 'is', 'publicly', 'available', 'in', 'github', 'httpsgithubcommathelabintlim']] | [-0.06509138651535103, 0.05608060596246276, -0.047328050541555096, 0.13676995960566912, -0.09739208741651295, -0.18172249082421346, 0.06625148564748559, 0.40067000700371286, -0.23183920929864998, -0.30376582881864395, 0.029158310567722442, -0.2793814146055384, -0.21626996428990214, 0.20610024287778433, -0.06679302122576404, -0.01596959526543447, 0.12457518932208902, -0.01336829796534277, 0.0662375699338322, -0.23370726709936016, 0.28194343621519136, 0.04276573641623164, 0.30600329105465607, 0.028805095356573433, 0.07426865342673242, -0.03924952653941998, -0.10850681954211551, 0.015060783999048517, -0.11497767808202705, 0.1853817484446774, 0.3663576178444612, 0.2690401961559344, 0.2803241154763489, -0.4483433896665964, -0.2070367213837397, 0.08923252491440203, 0.16550224342979647, 0.09426537759327593, -0.02965961876188923, -0.284875496769924, 0.06473112320644336, -0.15462807450145405, -0.037118053549869474, -0.12172217963060762, 0.030261741436980898, 0.02898330818403855, -0.2774172305600975, 0.14104915254885256, -0.025971870727166845, 0.15073604935879534, -0.08743233342945311, -0.12716825883913488, -0.04461394814544486, 0.19706978423669, 0.053199590692320005, -0.019042421436272404, 0.15581791058755537, -0.09752307514071652, -0.13437559881888594, 0.2945841035228924, 0.015136698054375758, -0.21679234513662227, 0.22916732208216836, -0.09787906509157754, -0.17697405333243013, 0.10657456232367325, 0.17301113231698925, 0.09089591323444815, -0.2736210227246439, 0.009297861902249752, 0.011926205226738458, 0.21079910357548975, 0.05756938996701404, -0.024802134966547894, 0.17938831159903446, 0.1851699023651715, -0.03859897551835986, 0.0887994284404999, -0.10494793395202015, -0.04872942974018401, -0.20629906203820872, -0.1535782975867531, -0.10415953048261342, -0.03134427577959545, -0.10255504627826538, -0.1580536174753517, 0.3685551861137401, 0.15433034127447598, 0.17072299029288432, 0.050629578518124, 0.23836210419260215, -0.010697777705728837, 0.13394846163873236, 0.006178336416733564, 0.1369493410301056, 0.04310844120156472, 0.05074397619681191, -0.21417783665233078, 0.18279847099687357, -0.022519299670835668] |
1,802.10589 | Entanglement and diagonal entropies after a quench with no pair
structure | A typical working condition in the study of quantum quenches is that the
initial state produces a distribution of quasiparticle excitations with an
opposite-momentum-pair structure. In this work we investigate the dynamical and
stationary properties of the entanglement entropy after a quench from initial
states which do not have such structure: instead of pairs of excitations they
generate $\nu$-plets of correlated excitations with $\nu>2$. Our study is
carried out focusing on a system of non-interacting fermions on the lattice. We
study the time evolution of the entanglement entropy showing that the standard
semiclassical formula is not applicable. We propose a suitable generalisation
which correctly describes the entanglement entropy evolution and perfectly
matches numerical data. We finally consider the relation between the
thermodynamic entropy of the stationary state and the diagonal entropy, showing
that when there is no pair structure their ratio depends on the details of the
initial state and lies generically between $1/2$ and $1$.
| cond-mat.stat-mech | a typical working condition in the study of quantum quenches is that the initial state produces a distribution of quasiparticle excitations with an oppositemomentumpair structure in this work we investigate the dynamical and stationary properties of the entanglement entropy after a quench from initial states which do not have such structure instead of pairs of excitations they generate nuplets of correlated excitations with nu2 our study is carried out focusing on a system of noninteracting fermions on the lattice we study the time evolution of the entanglement entropy showing that the standard semiclassical formula is not applicable we propose a suitable generalisation which correctly describes the entanglement entropy evolution and perfectly matches numerical data we finally consider the relation between the thermodynamic entropy of the stationary state and the diagonal entropy showing that when there is no pair structure their ratio depends on the details of the initial state and lies generically between 12 and 1 | [['a', 'typical', 'working', 'condition', 'in', 'the', 'study', 'of', 'quantum', 'quenches', 'is', 'that', 'the', 'initial', 'state', 'produces', 'a', 'distribution', 'of', 'quasiparticle', 'excitations', 'with', 'an', 'oppositemomentumpair', 'structure', 'in', 'this', 'work', 'we', 'investigate', 'the', 'dynamical', 'and', 'stationary', 'properties', 'of', 'the', 'entanglement', 'entropy', 'after', 'a', 'quench', 'from', 'initial', 'states', 'which', 'do', 'not', 'have', 'such', 'structure', 'instead', 'of', 'pairs', 'of', 'excitations', 'they', 'generate', 'nuplets', 'of', 'correlated', 'excitations', 'with', 'nu2', 'our', 'study', 'is', 'carried', 'out', 'focusing', 'on', 'a', 'system', 'of', 'noninteracting', 'fermions', 'on', 'the', 'lattice', 'we', 'study', 'the', 'time', 'evolution', 'of', 'the', 'entanglement', 'entropy', 'showing', 'that', 'the', 'standard', 'semiclassical', 'formula', 'is', 'not', 'applicable', 'we', 'propose', 'a', 'suitable', 'generalisation', 'which', 'correctly', 'describes', 'the', 'entanglement', 'entropy', 'evolution', 'and', 'perfectly', 'matches', 'numerical', 'data', 'we', 'finally', 'consider', 'the', 'relation', 'between', 'the', 'thermodynamic', 'entropy', 'of', 'the', 'stationary', 'state', 'and', 'the', 'diagonal', 'entropy', 'showing', 'that', 'when', 'there', 'is', 'no', 'pair', 'structure', 'their', 'ratio', 'depends', 'on', 'the', 'details', 'of', 'the', 'initial', 'state', 'and', 'lies', 'generically', 'between', '12', 'and', '1']] | [-0.15915858865316426, 0.1797623678403279, -0.1304256306755562, 0.07586104429459997, 0.024330061375066735, -0.11649932026411045, 0.05527422962371598, 0.33025156235467495, -0.2267725374700816, -0.23743132780027854, 0.06714077393506206, -0.30033217124828415, -0.11332258612957674, 0.15046232386096078, 0.003358228925869546, 0.05135230709157594, 0.07445927371434238, 0.0735617173463711, -0.11132135163832384, -0.2135151970357477, 0.3828911251727153, 0.03705708415915754, 0.3154073223931255, 0.06550532921108526, 0.08041695921225231, 0.02071127404803531, 0.020534991841557642, 0.014497607656113513, -0.15368862913889536, 0.06170636173995369, 0.17230736639640934, 0.10253848170849507, 0.22762527035144098, -0.3982989097909107, -0.19787525072959916, 0.0942233165532544, 0.11597663742889251, 0.15383845975610438, -0.0339910903478392, -0.24476688685328035, 0.04768767901061272, -0.16861048462050784, -0.13158169354300026, -0.08791087497475136, 0.010925651983019303, 0.0056069351654195404, -0.2261457392139294, 0.13075561545087727, 0.09869429480150084, 0.03204268459990385, -0.06755973074990385, -0.030806764906617004, -0.06075019949394, 0.12183412261758537, 0.01617653296531674, 0.0012776912666264582, 0.11099228298581847, -0.14272704777457484, -0.0992790905323315, 0.3583102429696879, -0.06791353112505447, -0.1997833615773684, 0.19830402964272525, -0.15518758606238217, -0.1127790742789625, 0.07583984937942163, 0.10561490788800315, 0.13362778635852812, -0.11309053906091782, 0.08713327309641346, -0.06436871492920758, 0.20694470938670073, 0.008048730287035661, 0.07616297341807589, 0.22967582530426708, 0.1284927786615157, 0.04327489921895714, 0.20020952991923535, -0.07518252423607635, -0.17381154744305297, -0.33967966221079426, -0.1753199342668492, -0.23444453539710805, 0.10075399862748251, -0.04733993613428373, -0.18978378132882215, 0.426079358755877, 0.14273977722646064, 0.2331264380353515, 0.03534622694454126, 0.22687457395149033, 0.14405331479547268, 0.01358948966530575, 0.10439973753913269, 0.23401359635913235, 0.11576681106968166, 0.0676162940338133, -0.28809990794639795, 0.047351898722253837, 0.05358637261125803] |
1,802.1059 | Integration of external electric fields in molecular dynamics simulation
models for resistive switching devices | Resistive switching devices emerged a huge amount of interest as promising
candidates for non-volatile memories as well as artificial synapses due to
their memristive behavior. The main physical and chemical phenomena which
define their functionality are driven by externally applied voltages, and the
resulting electric fields. Although molecular dynamics simulations are widely
used in order to describe the dynamics on the corresponding atomic length and
time scales, there is a lack of models which allow for the actual driving force
of the dynamics, i.e. externally applied electric fields. This is due to the
restriction of currently applied models to either solely conductive,
non-reactive or insulating materials, with thicknesses in the order of the
potential cutoff radius, i.e., 10 \r{A}. In this work, we propose a generic
model, which can be applied in particular to describe the resistive switching
phenomena of metal-insulator-metal systems. It has been shown that the
calculated electric field and force distribution in case of the chosen example
system Cu/a-SiO$_2$/Cu are in agreement with fundamental field theoretical
expectations.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.comp-ph | resistive switching devices emerged a huge amount of interest as promising candidates for nonvolatile memories as well as artificial synapses due to their memristive behavior the main physical and chemical phenomena which define their functionality are driven by externally applied voltages and the resulting electric fields although molecular dynamics simulations are widely used in order to describe the dynamics on the corresponding atomic length and time scales there is a lack of models which allow for the actual driving force of the dynamics ie externally applied electric fields this is due to the restriction of currently applied models to either solely conductive nonreactive or insulating materials with thicknesses in the order of the potential cutoff radius ie 10 ra in this work we propose a generic model which can be applied in particular to describe the resistive switching phenomena of metalinsulatormetal systems it has been shown that the calculated electric field and force distribution in case of the chosen example system cuasio_2cu are in agreement with fundamental field theoretical expectations | [['resistive', 'switching', 'devices', 'emerged', 'a', 'huge', 'amount', 'of', 'interest', 'as', 'promising', 'candidates', 'for', 'nonvolatile', 'memories', 'as', 'well', 'as', 'artificial', 'synapses', 'due', 'to', 'their', 'memristive', 'behavior', 'the', 'main', 'physical', 'and', 'chemical', 'phenomena', 'which', 'define', 'their', 'functionality', 'are', 'driven', 'by', 'externally', 'applied', 'voltages', 'and', 'the', 'resulting', 'electric', 'fields', 'although', 'molecular', 'dynamics', 'simulations', 'are', 'widely', 'used', 'in', 'order', 'to', 'describe', 'the', 'dynamics', 'on', 'the', 'corresponding', 'atomic', 'length', 'and', 'time', 'scales', 'there', 'is', 'a', 'lack', 'of', 'models', 'which', 'allow', 'for', 'the', 'actual', 'driving', 'force', 'of', 'the', 'dynamics', 'ie', 'externally', 'applied', 'electric', 'fields', 'this', 'is', 'due', 'to', 'the', 'restriction', 'of', 'currently', 'applied', 'models', 'to', 'either', 'solely', 'conductive', 'nonreactive', 'or', 'insulating', 'materials', 'with', 'thicknesses', 'in', 'the', 'order', 'of', 'the', 'potential', 'cutoff', 'radius', 'ie', '10', 'ra', 'in', 'this', 'work', 'we', 'propose', 'a', 'generic', 'model', 'which', 'can', 'be', 'applied', 'in', 'particular', 'to', 'describe', 'the', 'resistive', 'switching', 'phenomena', 'of', 'metalinsulatormetal', 'systems', 'it', 'has', 'been', 'shown', 'that', 'the', 'calculated', 'electric', 'field', 'and', 'force', 'distribution', 'in', 'case', 'of', 'the', 'chosen', 'example', 'system', 'cuasio_2cu', 'are', 'in', 'agreement', 'with', 'fundamental', 'field', 'theoretical', 'expectations']] | [-0.1373034501138292, 0.15339945288328177, -0.034343288792572785, 0.021714974091093457, -0.0409094509393109, -0.13692476542269777, 0.021910471301205516, 0.3954620037128675, -0.28433325264007736, -0.3422881001661691, 0.09084478728528295, -0.21340667402382785, -0.14669499120994653, 0.2191515867873894, -0.020263160350208982, 0.0671052850380584, -0.027345723081269913, 0.022148865908157865, 0.019291365331541004, -0.18280134126736877, 0.25557412370796917, 0.042550840707132095, 0.32187389664506244, 0.03772765981893127, 0.07316297935817898, -0.06716977808343456, 0.04760430382355254, 0.0548378946907135, -0.09773217259029501, 0.08634497012430527, 0.2503062984181555, -0.00242357118986547, 0.24923016251059327, -0.5045518963515053, -0.24314995020209157, 0.08384601350807579, 0.12421985533771783, 0.13567361818177395, -0.08190846057490242, -0.2474934537137291, 0.07492447792712224, -0.15280865921126402, -0.13012153194167103, -0.10651338426396251, 0.061027022405836136, 0.09224224222869441, -0.27301429434729046, 0.024254015434709703, 0.04078712316778262, 0.06211519222045262, -0.07695712239080943, -0.10294976631749818, -0.008861043537483336, 0.12524543198296723, 0.0515627533151939, 0.05757437563038392, 0.1990646834226226, -0.143323643075181, -0.12613466415917995, 0.40002779828483714, -0.03849672801660363, -0.17950870959327925, 0.2337044906904425, -0.11488939615065706, -0.042125861543456655, 0.1070454143119987, 0.18045842161363532, 0.10253886995319078, -0.1665086547276501, 0.07069002710332399, 0.039435852498791495, 0.1604750544816454, 0.03491011294178092, 0.04418394996156226, 0.2471070700551014, 0.18827843427597463, 0.008546343837870209, 0.14026507857247372, -0.08014279862000613, -0.11869267558337317, -0.24970073122017983, -0.11394029686547066, -0.17834509231050957, 0.08340821536974265, -0.037753524955502604, -0.18282640136460795, 0.3797555222064422, 0.20048834151621445, 0.170460051371986, -0.0408426388628373, 0.3150228036267231, 0.12756265304809072, 0.13470695522398904, 0.03274827360679442, 0.25403630561829055, 0.169917748105084, 0.14571731319628964, -0.21306470962869523, 0.1113499672229253, -0.005820005999867027] |
1,802.10591 | Stereoscopic Neural Style Transfer | This paper presents the first attempt at stereoscopic neural style transfer,
which responds to the emerging demand for 3D movies or AR/VR. We start with a
careful examination of applying existing monocular style transfer methods to
left and right views of stereoscopic images separately. This reveals that the
original disparity consistency cannot be well preserved in the final
stylization results, which causes 3D fatigue to the viewers. To address this
issue, we incorporate a new disparity loss into the widely adopted style loss
function by enforcing the bidirectional disparity constraint in non-occluded
regions. For a practical real-time solution, we propose the first feed-forward
network by jointly training a stylization sub-network and a disparity
sub-network, and integrate them in a feature level middle domain. Our disparity
sub-network is also the first end-to-end network for simultaneous bidirectional
disparity and occlusion mask estimation. Finally, our network is effectively
extended to stereoscopic videos, by considering both temporal coherence and
disparity consistency. We will show that the proposed method clearly
outperforms the baseline algorithms both quantitatively and qualitatively.
| cs.CV | this paper presents the first attempt at stereoscopic neural style transfer which responds to the emerging demand for 3d movies or arvr we start with a careful examination of applying existing monocular style transfer methods to left and right views of stereoscopic images separately this reveals that the original disparity consistency cannot be well preserved in the final stylization results which causes 3d fatigue to the viewers to address this issue we incorporate a new disparity loss into the widely adopted style loss function by enforcing the bidirectional disparity constraint in nonoccluded regions for a practical realtime solution we propose the first feedforward network by jointly training a stylization subnetwork and a disparity subnetwork and integrate them in a feature level middle domain our disparity subnetwork is also the first endtoend network for simultaneous bidirectional disparity and occlusion mask estimation finally our network is effectively extended to stereoscopic videos by considering both temporal coherence and disparity consistency we will show that the proposed method clearly outperforms the baseline algorithms both quantitatively and qualitatively | [['this', 'paper', 'presents', 'the', 'first', 'attempt', 'at', 'stereoscopic', 'neural', 'style', 'transfer', 'which', 'responds', 'to', 'the', 'emerging', 'demand', 'for', '3d', 'movies', 'or', 'arvr', 'we', 'start', 'with', 'a', 'careful', 'examination', 'of', 'applying', 'existing', 'monocular', 'style', 'transfer', 'methods', 'to', 'left', 'and', 'right', 'views', 'of', 'stereoscopic', 'images', 'separately', 'this', 'reveals', 'that', 'the', 'original', 'disparity', 'consistency', 'can', 'not', 'be', 'well', 'preserved', 'in', 'the', 'final', 'stylization', 'results', 'which', 'causes', '3d', 'fatigue', 'to', 'the', 'viewers', 'to', 'address', 'this', 'issue', 'we', 'incorporate', 'a', 'new', 'disparity', 'loss', 'into', 'the', 'widely', 'adopted', 'style', 'loss', 'function', 'by', 'enforcing', 'the', 'bidirectional', 'disparity', 'constraint', 'in', 'nonoccluded', 'regions', 'for', 'a', 'practical', 'realtime', 'solution', 'we', 'propose', 'the', 'first', 'feedforward', 'network', 'by', 'jointly', 'training', 'a', 'stylization', 'subnetwork', 'and', 'a', 'disparity', 'subnetwork', 'and', 'integrate', 'them', 'in', 'a', 'feature', 'level', 'middle', 'domain', 'our', 'disparity', 'subnetwork', 'is', 'also', 'the', 'first', 'endtoend', 'network', 'for', 'simultaneous', 'bidirectional', 'disparity', 'and', 'occlusion', 'mask', 'estimation', 'finally', 'our', 'network', 'is', 'effectively', 'extended', 'to', 'stereoscopic', 'videos', 'by', 'considering', 'both', 'temporal', 'coherence', 'and', 'disparity', 'consistency', 'we', 'will', 'show', 'that', 'the', 'proposed', 'method', 'clearly', 'outperforms', 'the', 'baseline', 'algorithms', 'both', 'quantitatively', 'and', 'qualitatively']] | [-0.05952252954613931, 0.00747071316160647, -0.06053579736222652, 0.0738727093069418, -0.09446699047011548, -0.16196207880395755, 0.03402385852084196, 0.4853882944189954, -0.3038116261823338, -0.33472431901489097, 0.05631088744915872, -0.26027923579402695, -0.2052146419628534, 0.10858727448710893, -0.17740020181732144, 0.08314215125590992, 0.1532187058072505, -0.011066566927936571, -0.07781947895532591, -0.22799680648029022, 0.3020821407881576, 0.05465535380898964, 0.35471906565429495, 0.05802801198422395, 0.1668984512557629, 0.0011634247768242125, -0.025984462711226796, 0.015121102293594688, -0.04565296186531972, 0.15903823999634506, 0.28798134039937595, 0.18687366609108344, 0.30533002600630466, -0.43625652081408034, -0.2434824423853779, 0.029756882284157748, 0.17891158185492473, 0.09183014987234625, -0.030695055829543065, -0.33994165756579103, 0.07497457819509096, -0.18090833862172975, 0.033565677362547695, -0.08973542020934495, -0.036694956551996415, -0.03329605085711027, -0.3305771244574745, 0.05995628951320119, 0.07242998561668665, 0.0400215612306934, -0.05961982920316273, -0.041646311968168905, -0.003160456115187242, 0.23560651757449297, 0.04961953137669413, 0.06292576970744626, 0.08887162667849026, -0.17958930451503216, -0.0820469652374821, 0.33939870810885536, -0.03789287202372001, -0.2045839627175699, 0.16220836687683202, -0.04715829455138495, -0.1107328084281421, 0.09102111840727685, 0.1712839637090848, 0.0918350064238512, -0.1647730874862447, -0.05044607212164857, -0.043993623672995245, 0.2052198950864974, 0.059395198965841244, -0.02632551027017635, 0.2071864459631515, 0.22236258391626768, 0.06698520450943803, 0.16904459051298107, -0.193936283270803, -0.046286170659907935, -0.22891902604043998, -0.11016158923043752, -0.16290281017728406, -0.055916685549289406, -0.07674235758728257, -0.09959160123186336, 0.4533082353828967, 0.2438598096895235, 0.22218359117837752, 0.11448021833089063, 0.3967937911705424, 0.03361460277088115, 0.09265809668724467, 0.07506682094582624, 0.2079285347992126, -0.032412020335691155, 0.19219627664906197, -0.18852968359012798, 0.0888555932565239, 0.09256165758733391] |
1,802.10592 | Model-Ensemble Trust-Region Policy Optimization | Model-free reinforcement learning (RL) methods are succeeding in a growing
number of tasks, aided by recent advances in deep learning. However, they tend
to suffer from high sample complexity, which hinders their use in real-world
domains. Alternatively, model-based reinforcement learning promises to reduce
sample complexity, but tends to require careful tuning and to date have
succeeded mainly in restrictive domains where simple models are sufficient for
learning. In this paper, we analyze the behavior of vanilla model-based
reinforcement learning methods when deep neural networks are used to learn both
the model and the policy, and show that the learned policy tends to exploit
regions where insufficient data is available for the model to be learned,
causing instability in training. To overcome this issue, we propose to use an
ensemble of models to maintain the model uncertainty and regularize the
learning process. We further show that the use of likelihood ratio derivatives
yields much more stable learning than backpropagation through time. Altogether,
our approach Model-Ensemble Trust-Region Policy Optimization (ME-TRPO)
significantly reduces the sample complexity compared to model-free deep RL
methods on challenging continuous control benchmark tasks.
| cs.LG cs.AI cs.RO | modelfree reinforcement learning rl methods are succeeding in a growing number of tasks aided by recent advances in deep learning however they tend to suffer from high sample complexity which hinders their use in realworld domains alternatively modelbased reinforcement learning promises to reduce sample complexity but tends to require careful tuning and to date have succeeded mainly in restrictive domains where simple models are sufficient for learning in this paper we analyze the behavior of vanilla modelbased reinforcement learning methods when deep neural networks are used to learn both the model and the policy and show that the learned policy tends to exploit regions where insufficient data is available for the model to be learned causing instability in training to overcome this issue we propose to use an ensemble of models to maintain the model uncertainty and regularize the learning process we further show that the use of likelihood ratio derivatives yields much more stable learning than backpropagation through time altogether our approach modelensemble trustregion policy optimization metrpo significantly reduces the sample complexity compared to modelfree deep rl methods on challenging continuous control benchmark tasks | [['modelfree', 'reinforcement', 'learning', 'rl', 'methods', 'are', 'succeeding', 'in', 'a', 'growing', 'number', 'of', 'tasks', 'aided', 'by', 'recent', 'advances', 'in', 'deep', 'learning', 'however', 'they', 'tend', 'to', 'suffer', 'from', 'high', 'sample', 'complexity', 'which', 'hinders', 'their', 'use', 'in', 'realworld', 'domains', 'alternatively', 'modelbased', 'reinforcement', 'learning', 'promises', 'to', 'reduce', 'sample', 'complexity', 'but', 'tends', 'to', 'require', 'careful', 'tuning', 'and', 'to', 'date', 'have', 'succeeded', 'mainly', 'in', 'restrictive', 'domains', 'where', 'simple', 'models', 'are', 'sufficient', 'for', 'learning', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'behavior', 'of', 'vanilla', 'modelbased', 'reinforcement', 'learning', 'methods', 'when', 'deep', 'neural', 'networks', 'are', 'used', 'to', 'learn', 'both', 'the', 'model', 'and', 'the', 'policy', 'and', 'show', 'that', 'the', 'learned', 'policy', 'tends', 'to', 'exploit', 'regions', 'where', 'insufficient', 'data', 'is', 'available', 'for', 'the', 'model', 'to', 'be', 'learned', 'causing', 'instability', 'in', 'training', 'to', 'overcome', 'this', 'issue', 'we', 'propose', 'to', 'use', 'an', 'ensemble', 'of', 'models', 'to', 'maintain', 'the', 'model', 'uncertainty', 'and', 'regularize', 'the', 'learning', 'process', 'we', 'further', 'show', 'that', 'the', 'use', 'of', 'likelihood', 'ratio', 'derivatives', 'yields', 'much', 'more', 'stable', 'learning', 'than', 'backpropagation', 'through', 'time', 'altogether', 'our', 'approach', 'modelensemble', 'trustregion', 'policy', 'optimization', 'metrpo', 'significantly', 'reduces', 'the', 'sample', 'complexity', 'compared', 'to', 'modelfree', 'deep', 'rl', 'methods', 'on', 'challenging', 'continuous', 'control', 'benchmark', 'tasks']] | [0.019410255209217103, 0.002217501552748148, -0.06775343464305777, 0.08259154731111197, -0.16473539333912682, -0.179350595542133, 0.08039916018749298, 0.4864671302441179, -0.3081338432836321, -0.3479623591089672, 0.09159720718702861, -0.23110527814177623, -0.17700818653696831, 0.1988737930256181, -0.1796840285141876, 0.10610686526048542, 0.10193893742426986, -0.007504289906186973, -0.08206802614470893, -0.2991819676378223, 0.2920893523562191, 0.04374962315663741, 0.36430085102818865, -0.03709339294989741, 0.11377995162553413, -0.053399597415496984, -0.0009427309504460767, -0.007994818149383888, -0.07944658777176827, 0.17102341161140042, 0.34883856295489185, 0.21236119384475338, 0.40880662227772135, -0.4470809953423777, -0.24364702618945533, 0.1658288723778977, 0.20656376031527673, 0.11475330556277186, -0.0186061263132918, -0.27735033123550396, 0.06978177945918398, -0.16526213418845026, -0.005841802824746634, -0.18728703702672747, -0.05187882843193257, -0.03342937865444647, -0.30280322417085026, 0.028621570331863855, 0.06488566850744636, 0.026640052797751185, -0.030006705364721314, -0.12524819554241953, 0.05075520141269055, 0.11793741422448985, 0.08933196288627022, 0.058944115440661464, 0.1467101965048681, -0.20139275215148844, -0.14737940836657104, 0.32072478598950666, -0.02403864901981385, -0.18529931904463087, 0.2430766248347777, -0.025940083304440472, -0.158872313537925, 0.12251495275152796, 0.29756298822305, 0.15524253994480916, -0.1389921409771504, 0.03835974984720879, 0.03311712609838104, 0.1718272585218233, -0.016589428919057052, -0.03851643130132328, 0.11769498534159623, 0.26271998238892297, 0.07240755755652781, 0.12932356035074757, -0.08944166504874662, -0.12426844739121044, -0.16596967903795382, -0.07369674413714333, -0.17524769559662912, -0.024815805967581647, -0.10848575296571294, -0.12451781192452512, 0.30628812860422694, 0.28089323860995186, 0.21741584796570446, 0.15813683213658447, 0.34493766624297273, 0.08458697015471767, 0.12647527323837285, 0.11598931088320952, 0.2576171893198959, 0.04155073888457375, 0.14967300291453065, -0.20527701544361648, 0.12441808026210185, -0.0013423356013830567] |
1,802.10593 | Absence of Dirac states in BaZnBi$_{2}$ induced by spin-orbit coupling | We report magnetotransport properties of BaZnBi$_{2}$ single crystals.
Whereas electronic structure features Dirac states, such states are removed
from the Fermi level by spin-orbit coupling (SOC) and consequently electronic
transport is dominated by the small hole and electron pockets. Our results are
consistent with three dimensional (3D) but also with quasi two dimensional (2D)
portions of the Fermi surface. The spin-orbit coupling-induced gap in Dirac
states is much larger when compared to isostructural SrMnBi$_{2}$. This
suggests that not only long range magnetic order but also mass of the alkaline
earth atoms A in ABX$_{2}$ (A = alkaine earth, B = transition metal and
X=Bi/Sb) are important for the presence of low-energy states obeying the
relativistic Dirac equation at the Fermi surface
| cond-mat.mes-hall cond-mat.mtrl-sci | we report magnetotransport properties of baznbi_2 single crystals whereas electronic structure features dirac states such states are removed from the fermi level by spinorbit coupling soc and consequently electronic transport is dominated by the small hole and electron pockets our results are consistent with three dimensional 3d but also with quasi two dimensional 2d portions of the fermi surface the spinorbit couplinginduced gap in dirac states is much larger when compared to isostructural srmnbi_2 this suggests that not only long range magnetic order but also mass of the alkaline earth atoms a in abx_2 a alkaine earth b transition metal and xbisb are important for the presence of lowenergy states obeying the relativistic dirac equation at the fermi surface | [['we', 'report', 'magnetotransport', 'properties', 'of', 'baznbi_2', 'single', 'crystals', 'whereas', 'electronic', 'structure', 'features', 'dirac', 'states', 'such', 'states', 'are', 'removed', 'from', 'the', 'fermi', 'level', 'by', 'spinorbit', 'coupling', 'soc', 'and', 'consequently', 'electronic', 'transport', 'is', 'dominated', 'by', 'the', 'small', 'hole', 'and', 'electron', 'pockets', 'our', 'results', 'are', 'consistent', 'with', 'three', 'dimensional', '3d', 'but', 'also', 'with', 'quasi', 'two', 'dimensional', '2d', 'portions', 'of', 'the', 'fermi', 'surface', 'the', 'spinorbit', 'couplinginduced', 'gap', 'in', 'dirac', 'states', 'is', 'much', 'larger', 'when', 'compared', 'to', 'isostructural', 'srmnbi_2', 'this', 'suggests', 'that', 'not', 'only', 'long', 'range', 'magnetic', 'order', 'but', 'also', 'mass', 'of', 'the', 'alkaline', 'earth', 'atoms', 'a', 'in', 'abx_2', 'a', 'alkaine', 'earth', 'b', 'transition', 'metal', 'and', 'xbisb', 'are', 'important', 'for', 'the', 'presence', 'of', 'lowenergy', 'states', 'obeying', 'the', 'relativistic', 'dirac', 'equation', 'at', 'the', 'fermi', 'surface']] | [-0.15460889293121752, 0.2551396557457087, 0.0009867763186901294, 0.051493235467707316, -0.020206679746604943, -0.17114376683783686, 0.07092986233002538, 0.3541409694429102, -0.22787190105059538, -0.3133089267167038, -0.02497509507871843, -0.37056295324422034, -0.1149244771784589, 0.18286496673204838, 0.060875781489624484, 0.02652718800376972, 0.03683663607607114, -0.03160440442874899, -0.15129411124006106, -0.19551281959966532, 0.35882452677871135, 0.04604492347751712, 0.27019105163996976, 0.07579059229264486, 0.02170137746813045, -0.044208560452057885, 0.14211755722423952, 0.032754507887273514, -0.08103535792637057, 0.07523339858945009, 0.23434941335942533, -0.14900837147383597, 0.17856001535406466, -0.4453030199470833, -0.2217460305104835, -0.0433212257500192, 0.1251447041065368, 0.1462895142813695, -0.08567303004032321, -0.32565872661833617, 0.01183234692294279, -0.14827546302694827, -0.1312216154444192, -0.09411762391441855, -0.013108539631879279, -0.05189343464785609, -0.1931637022870087, 0.1245742017159375, 0.045941953672746456, 0.0698012515525173, -0.127931560357583, -0.14670806216750423, -0.12743318555194177, 0.0382132855485342, 0.06587693047436789, 0.007804404483788952, 0.13056428828035835, -0.11323690281115605, -0.05722309028376536, 0.4473551506947341, -0.06845697157731248, -0.1350043255891972, 0.22014033350820555, -0.24184097454818929, -0.08310795269489031, 0.1875511238648524, 0.11539501125185654, 0.08184635003021083, -0.1158792234201773, 0.11187068063711571, -0.058210682673861494, 0.15532587007780013, 0.03241765223331107, 0.10753888139453043, 0.2989949691591078, 0.1600770944677261, 0.05355072259935069, 0.05580394140019178, -0.1667200093476728, -0.0349553491948333, -0.21237194558990927, -0.18404076629968616, -0.24255419418954388, 0.0745350897879438, -0.015432986894101587, -0.18960143866595522, 0.4103732133035323, 0.1013509860565356, 0.19270522373824797, -0.07695851543243847, 0.20990942345113203, 0.0938510008423252, 0.06925993713255217, 0.10996495795050829, 0.2806047911972514, 0.10836276222734936, 0.06288261207699744, -0.2710291643763475, 0.03631262525570868, 0.040892515929640626] |
1,803.00001 | The Alpha-Beta-Symetric Divergence and their Positive Definite Kernel | In this article we study the field of Hilbertian metrics and positive definit
(pd) kernels on probability measures, they have a real interest in kernel
methods. Firstly we will make a study based on the Alpha-Beta-divergence to
have a Hilbercan metric by proposing an improvement of this divergence by
constructing it so that its is symmetrical the Alpha-Beta-Symmetric-divergence
(ABS-divergence) and also do some studies on these properties but also propose
the kernels associated with this divergence. Secondly we will do mumerical
studies incorporating all proposed metrics/kernels into support vector machine
(SVM). Finally we presented a algorithm for image classification by using our
divergence.
| stat.ME cs.LG | in this article we study the field of hilbertian metrics and positive definit pd kernels on probability measures they have a real interest in kernel methods firstly we will make a study based on the alphabetadivergence to have a hilbercan metric by proposing an improvement of this divergence by constructing it so that its is symmetrical the alphabetasymmetricdivergence absdivergence and also do some studies on these properties but also propose the kernels associated with this divergence secondly we will do mumerical studies incorporating all proposed metricskernels into support vector machine svm finally we presented a algorithm for image classification by using our divergence | [['in', 'this', 'article', 'we', 'study', 'the', 'field', 'of', 'hilbertian', 'metrics', 'and', 'positive', 'definit', 'pd', 'kernels', 'on', 'probability', 'measures', 'they', 'have', 'a', 'real', 'interest', 'in', 'kernel', 'methods', 'firstly', 'we', 'will', 'make', 'a', 'study', 'based', 'on', 'the', 'alphabetadivergence', 'to', 'have', 'a', 'hilbercan', 'metric', 'by', 'proposing', 'an', 'improvement', 'of', 'this', 'divergence', 'by', 'constructing', 'it', 'so', 'that', 'its', 'is', 'symmetrical', 'the', 'alphabetasymmetricdivergence', 'absdivergence', 'and', 'also', 'do', 'some', 'studies', 'on', 'these', 'properties', 'but', 'also', 'propose', 'the', 'kernels', 'associated', 'with', 'this', 'divergence', 'secondly', 'we', 'will', 'do', 'mumerical', 'studies', 'incorporating', 'all', 'proposed', 'metricskernels', 'into', 'support', 'vector', 'machine', 'svm', 'finally', 'we', 'presented', 'a', 'algorithm', 'for', 'image', 'classification', 'by', 'using', 'our', 'divergence']] | [-0.06903055493393433, 0.03989728893883666, -0.11527587561964144, 0.074476803036061, -0.08009494850219986, -0.10398757423648668, 0.03562546755456049, 0.46588644151067, -0.2145668950661556, -0.22715794614794635, 0.13449246327623188, -0.2853799993460326, -0.24037544508032577, 0.19953103079076512, -0.10843816531351623, 0.06706791944242534, 0.08046891447636731, 0.0737074222607711, -0.11213846538652733, -0.2862265334109363, 0.4164465696925355, 0.0627565162217955, 0.27431764637273687, 0.07537765060455452, 0.10901989860306542, -0.008024735227419236, -0.06291545731658787, 0.07349340573490895, -0.15741067310381435, 0.1787363472826702, 0.22360476846422656, 0.18598380990652846, 0.3318736318489249, -0.3639957594310807, -0.22697962970789715, 0.14681055484166772, 0.12490013875451285, 0.07695134317252747, -0.07862868954873999, -0.2924490320525065, 0.1198070401760279, -0.14451692884634296, -0.05018397935272492, -0.16407173883515536, -0.024759328082808743, 0.03125599081167164, -0.24702137149870396, 0.011064272171688103, 0.11680543137541444, 0.06274506473702561, -0.07083256103304819, -0.12666169561916174, 0.0714273721666181, 0.07899308759123855, 0.056910264159351125, 0.04983387897439186, 0.06587766649047892, -0.10385575478106794, -0.1559710836916509, 0.3083431141201368, -0.08509681904124403, -0.28393786550336275, 0.1876237441103944, -0.10282660323223963, -0.1467748931136532, 0.05131972911491625, 0.22488002913053504, 0.11529334144878019, -0.15915391525042424, 0.06207105688169867, -0.06094824593062945, 0.1159963661939213, 0.029929317653985675, -0.011090111933149321, 0.14233827746482855, 0.12139265774989251, 0.04245306924945608, 0.13614053149544394, -0.09370481789642561, -0.06254793656029806, -0.29559884533842967, -0.1920908913736414, -0.16460127034104555, 0.02865617053064796, -0.055442339447554986, -0.17031865841565058, 0.40228733366604935, 0.19406026063640555, 0.21778257870230555, 0.076948558477224, 0.2841448704760099, 0.11970033323435478, 0.10391061763115919, 0.09967265154244666, 0.2114201619727273, 0.08247498336689758, 0.09031671182415688, -0.15594191619281456, 0.04333680630517528, 0.06269010062300667] |
1,803.00002 | High-order functional derivatives of the diffracted field according to
the permittivity-contrast function | In this work, we propose to extend an approach to calculate at any order
$(n)$, the functional derivative of the diffracted field with respect to the
permittivity-contrast function. These derivatives obtained for different orders
are used to perform an expansion of the data according to the studied model
parameter. Its convergence is discussed throughout some numerical results,
obtained in the case where the forward model used to simulate the diffracted
field is built in the framework of the volume integral formulation. In
particular, we show that taking into account higher order derivatives improve
drastically the data-fitting. The numerical application considered consists of
a cylindrical object illuminated by an incident field under a ${\rm TE}$
polarisation (electric component parallel to the invariance axis).
| physics.class-ph | in this work we propose to extend an approach to calculate at any order n the functional derivative of the diffracted field with respect to the permittivitycontrast function these derivatives obtained for different orders are used to perform an expansion of the data according to the studied model parameter its convergence is discussed throughout some numerical results obtained in the case where the forward model used to simulate the diffracted field is built in the framework of the volume integral formulation in particular we show that taking into account higher order derivatives improve drastically the datafitting the numerical application considered consists of a cylindrical object illuminated by an incident field under a rm te polarisation electric component parallel to the invariance axis | [['in', 'this', 'work', 'we', 'propose', 'to', 'extend', 'an', 'approach', 'to', 'calculate', 'at', 'any', 'order', 'n', 'the', 'functional', 'derivative', 'of', 'the', 'diffracted', 'field', 'with', 'respect', 'to', 'the', 'permittivitycontrast', 'function', 'these', 'derivatives', 'obtained', 'for', 'different', 'orders', 'are', 'used', 'to', 'perform', 'an', 'expansion', 'of', 'the', 'data', 'according', 'to', 'the', 'studied', 'model', 'parameter', 'its', 'convergence', 'is', 'discussed', 'throughout', 'some', 'numerical', 'results', 'obtained', 'in', 'the', 'case', 'where', 'the', 'forward', 'model', 'used', 'to', 'simulate', 'the', 'diffracted', 'field', 'is', 'built', 'in', 'the', 'framework', 'of', 'the', 'volume', 'integral', 'formulation', 'in', 'particular', 'we', 'show', 'that', 'taking', 'into', 'account', 'higher', 'order', 'derivatives', 'improve', 'drastically', 'the', 'datafitting', 'the', 'numerical', 'application', 'considered', 'consists', 'of', 'a', 'cylindrical', 'object', 'illuminated', 'by', 'an', 'incident', 'field', 'under', 'a', 'rm', 'te', 'polarisation', 'electric', 'component', 'parallel', 'to', 'the', 'invariance', 'axis']] | [-0.11177763720004519, 0.0549627005651522, -0.07449808221960763, 0.029069033722693392, -0.05367065790255577, -0.04316821170793769, -0.021915756204465696, 0.383106856907079, -0.26751699329022904, -0.28883553433187753, 0.07227777792448717, -0.24626293899260523, -0.09790737116478446, 0.180058419946889, -0.024073616759312792, 0.03589434509525414, -0.012859592445133147, 0.05058868988301636, -0.080962050311683, -0.2614182950053287, 0.29065881151521256, 0.04081837864484915, 0.2763300722653493, 0.024673427061143154, 0.11029784516036927, 0.03141277575526725, -0.029040729399955223, 0.034720849112474285, -0.14169195879565616, 0.11709251372944102, 0.2176972326229919, 0.06495751316990118, 0.23321393741417892, -0.47052576688449244, -0.2044278609081487, 0.058645560044395036, 0.12955673341062074, 0.07463117671961134, -0.028676223240731175, -0.2698267920285248, 0.08280502992666765, -0.15437452879172464, -0.18479770002886653, -0.08274518419057131, -0.027685912582861676, 0.004459667619902733, -0.29407675988579646, 0.01437603850071588, 0.031801306353958926, 0.012735529231246222, -0.08121704501542455, -0.10902414937726845, -0.00852142735230467, 0.09665505422956565, 0.09342537250962447, 0.07231046910944187, 0.09812467912604556, -0.1086595396007111, -0.08646743077292177, 0.3958591193437946, -0.09935070127672092, -0.24081440598603862, 0.12319296380612722, -0.16631620560872776, -0.09821301799128987, 0.1540104929550159, 0.1817151086312557, 0.14476779062485645, -0.1227632082521546, 0.08615913923275619, 0.026534380652934068, 0.14777373091879586, 0.06450008566699121, -0.02495218931181618, 0.1455718269013638, 0.12695144133282488, 0.0497782001779838, 0.19229952714835055, -0.09203149798934247, -0.09532328470309903, -0.32779520754663904, -0.15620566385005377, -0.16328782164530198, -0.007673695868204448, -0.09618312609574396, -0.13694219228095753, 0.402963893842106, 0.19765471992629371, 0.1868924122642387, 0.03238496593630696, 0.3266866741286329, 0.1847168191159067, 0.07333828963739566, 0.04373529105280547, 0.2429456407531869, 0.154474554344827, 0.1027174119776007, -0.21542344773996405, 0.030038622088637973, 0.05557683037116754] |
1,803.00003 | Exact gravitational potential of a homogeneous torus in toroidal
coordinates and a surface integral approach to Poisson's equation | New exact solutions are derived for the gravitational potential inside and
outside a homogeneous torus as rapidly converging series of toroidal harmonics.
The approach consists of splitting the inter- nal potential into a known
solution to Poisson's equation plus some solution to Laplace's equation. The
full solutions are then obtained using two equivalent methods, applying
differential boundary conditions at the surface, or evaluating a surface
integral derived from Green's third identity. This surface integral may not
have been published before and is general to all geometries and volume density
distributions, reducing the problem for the gravitational potential of any
object from a volume to a surface integral.
| physics.class-ph astro-ph.GA gr-qc | new exact solutions are derived for the gravitational potential inside and outside a homogeneous torus as rapidly converging series of toroidal harmonics the approach consists of splitting the inter nal potential into a known solution to poissons equation plus some solution to laplaces equation the full solutions are then obtained using two equivalent methods applying differential boundary conditions at the surface or evaluating a surface integral derived from greens third identity this surface integral may not have been published before and is general to all geometries and volume density distributions reducing the problem for the gravitational potential of any object from a volume to a surface integral | [['new', 'exact', 'solutions', 'are', 'derived', 'for', 'the', 'gravitational', 'potential', 'inside', 'and', 'outside', 'a', 'homogeneous', 'torus', 'as', 'rapidly', 'converging', 'series', 'of', 'toroidal', 'harmonics', 'the', 'approach', 'consists', 'of', 'splitting', 'the', 'inter', 'nal', 'potential', 'into', 'a', 'known', 'solution', 'to', 'poissons', 'equation', 'plus', 'some', 'solution', 'to', 'laplaces', 'equation', 'the', 'full', 'solutions', 'are', 'then', 'obtained', 'using', 'two', 'equivalent', 'methods', 'applying', 'differential', 'boundary', 'conditions', 'at', 'the', 'surface', 'or', 'evaluating', 'a', 'surface', 'integral', 'derived', 'from', 'greens', 'third', 'identity', 'this', 'surface', 'integral', 'may', 'not', 'have', 'been', 'published', 'before', 'and', 'is', 'general', 'to', 'all', 'geometries', 'and', 'volume', 'density', 'distributions', 'reducing', 'the', 'problem', 'for', 'the', 'gravitational', 'potential', 'of', 'any', 'object', 'from', 'a', 'volume', 'to', 'a', 'surface', 'integral']] | [-0.12153228901535551, 0.015110634336961764, -0.11688364791100687, 0.06972205454035375, -0.1064732092036648, -0.11190617494894384, -0.007576987347522071, 0.317132759386691, -0.25312294347089864, -0.27095447043305104, 0.13595897654750358, -0.2798250608764171, -0.11530391784672077, 0.2315209136784042, -0.011724725822596071, 0.06300349603624683, 0.04713237145045233, 0.0278189845261312, -0.11422604530893057, -0.20978573890333282, 0.35680575226651173, -0.01985856231789444, 0.2327129284320312, 0.049955698948736506, 0.1228104251813335, -0.02135785721529658, -0.027265312711525463, 0.07898749702688411, -0.13666429447889258, 0.11953714002842065, 0.19707479255021523, 0.07742630376123658, 0.2507528040479764, -0.4366240372063122, -0.2406385552364393, 0.06254778859079337, 0.14325655207351268, 0.1327431587432729, -0.04820176690520945, -0.28533520121736644, 0.06718498768250102, -0.14800700067464156, -0.20918030126420695, -0.04418851136639018, 0.05131290606266566, 0.06298841806737898, -0.25556932626918794, 0.07755139656364918, 0.007511145561480912, -0.0009944917673297296, -0.16000264148428062, -0.13410925417899144, -0.0421009886679109, 0.1200533736449292, 0.032679562089163984, 0.048567594464206804, 0.09842321506448995, -0.1430598700997881, -0.023550662934501594, 0.36006960191842274, -0.08630568554154902, -0.26351189900572614, 0.17308096277362137, -0.1413958156002668, -0.07535059120784575, 0.22150637305158877, 0.12627850132602675, 0.14195802504910487, -0.19534232761606435, 0.11205417045585758, 0.010706144567822741, 0.11076734037950164, 0.11525198947812353, -0.05475220415974036, 0.2221822977919027, 0.07323641504082724, 0.0815711120104365, 0.1290323416774257, -0.08038045161960769, -0.07835869272631184, -0.3250381780753487, -0.1718200080512335, -0.18687224032239833, 0.0608565803274793, -0.07335774499499217, -0.20499346483168063, 0.3425089406354405, 0.04165253870485124, 0.14457833704268822, 0.03756832761910883, 0.30413140192906435, 0.18233060500057954, 0.06744944093592256, 0.06691018602088372, 0.20072435470712457, 0.15325758065897796, 0.08785940300255457, -0.19679476853860456, -0.011371138231463242, 0.1545058892469714] |
1,803.00004 | Speeding Up the Bilateral Filter: A Joint Acceleration Way | Computational complexity of the brute-force implementation of the bilateral
filter (BF) depends on its filter kernel size. To achieve the constant-time BF
whose complexity is irrelevant to the kernel size, many techniques have been
proposed, such as 2D box filtering, dimension promotion, and shiftability
property. Although each of the above techniques suffers from accuracy and
efficiency problems, previous algorithm designers were used to take only one of
them to assemble fast implementations due to the hardness of combining them
together. Hence, no joint exploitation of these techniques has been proposed to
construct a new cutting edge implementation that solves these problems. Jointly
employing five techniques: kernel truncation, best N -term approximation as
well as previous 2D box filtering, dimension promotion, and shiftability
property, we propose a unified framework to transform BF with arbitrary spatial
and range kernels into a set of 3D box filters that can be computed in linear
time. To the best of our knowledge, our algorithm is the first method that can
integrate all these acceleration techniques and, therefore, can draw upon one
another's strong point to overcome deficiencies. The strength of our method has
been corroborated by several carefully designed experiments. In particular, the
filtering accuracy is significantly improved without sacrificing the efficiency
at running time.
| cs.CV | computational complexity of the bruteforce implementation of the bilateral filter bf depends on its filter kernel size to achieve the constanttime bf whose complexity is irrelevant to the kernel size many techniques have been proposed such as 2d box filtering dimension promotion and shiftability property although each of the above techniques suffers from accuracy and efficiency problems previous algorithm designers were used to take only one of them to assemble fast implementations due to the hardness of combining them together hence no joint exploitation of these techniques has been proposed to construct a new cutting edge implementation that solves these problems jointly employing five techniques kernel truncation best n term approximation as well as previous 2d box filtering dimension promotion and shiftability property we propose a unified framework to transform bf with arbitrary spatial and range kernels into a set of 3d box filters that can be computed in linear time to the best of our knowledge our algorithm is the first method that can integrate all these acceleration techniques and therefore can draw upon one anothers strong point to overcome deficiencies the strength of our method has been corroborated by several carefully designed experiments in particular the filtering accuracy is significantly improved without sacrificing the efficiency at running time | [['computational', 'complexity', 'of', 'the', 'bruteforce', 'implementation', 'of', 'the', 'bilateral', 'filter', 'bf', 'depends', 'on', 'its', 'filter', 'kernel', 'size', 'to', 'achieve', 'the', 'constanttime', 'bf', 'whose', 'complexity', 'is', 'irrelevant', 'to', 'the', 'kernel', 'size', 'many', 'techniques', 'have', 'been', 'proposed', 'such', 'as', '2d', 'box', 'filtering', 'dimension', 'promotion', 'and', 'shiftability', 'property', 'although', 'each', 'of', 'the', 'above', 'techniques', 'suffers', 'from', 'accuracy', 'and', 'efficiency', 'problems', 'previous', 'algorithm', 'designers', 'were', 'used', 'to', 'take', 'only', 'one', 'of', 'them', 'to', 'assemble', 'fast', 'implementations', 'due', 'to', 'the', 'hardness', 'of', 'combining', 'them', 'together', 'hence', 'no', 'joint', 'exploitation', 'of', 'these', 'techniques', 'has', 'been', 'proposed', 'to', 'construct', 'a', 'new', 'cutting', 'edge', 'implementation', 'that', 'solves', 'these', 'problems', 'jointly', 'employing', 'five', 'techniques', 'kernel', 'truncation', 'best', 'n', 'term', 'approximation', 'as', 'well', 'as', 'previous', '2d', 'box', 'filtering', 'dimension', 'promotion', 'and', 'shiftability', 'property', 'we', 'propose', 'a', 'unified', 'framework', 'to', 'transform', 'bf', 'with', 'arbitrary', 'spatial', 'and', 'range', 'kernels', 'into', 'a', 'set', 'of', '3d', 'box', 'filters', 'that', 'can', 'be', 'computed', 'in', 'linear', 'time', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'our', 'algorithm', 'is', 'the', 'first', 'method', 'that', 'can', 'integrate', 'all', 'these', 'acceleration', 'techniques', 'and', 'therefore', 'can', 'draw', 'upon', 'one', 'anothers', 'strong', 'point', 'to', 'overcome', 'deficiencies', 'the', 'strength', 'of', 'our', 'method', 'has', 'been', 'corroborated', 'by', 'several', 'carefully', 'designed', 'experiments', 'in', 'particular', 'the', 'filtering', 'accuracy', 'is', 'significantly', 'improved', 'without', 'sacrificing', 'the', 'efficiency', 'at', 'running', 'time']] | [-0.03921701809768343, -0.005111271967845304, -0.07405168754935619, 0.039687795745807566, -0.12031828015155735, -0.15581641901586582, 0.05319977876275689, 0.4366242025136238, -0.27443533600529746, -0.3445344339967484, 0.11924638456243666, -0.23653671057961348, -0.1396788757970734, 0.20648278922197363, -0.06977191152428056, 0.1259051258503903, 0.054885582715672045, -0.00964752896467135, -0.08533801447745298, -0.30400780951604245, 0.2551535894318173, 0.08433333982247859, 0.2992853199808104, 0.028332823781030518, 0.11953672491169225, 0.0004091281222090835, -0.05363065353372977, 0.03892071277257942, -0.06762980098078732, 0.10557334771645921, 0.23984162790612096, 0.16364074697152578, 0.3227178903651379, -0.4203611453196832, -0.23530583544856026, 0.09496445751283318, 0.17048170906269833, 0.10403143738706906, -0.01853881588571572, -0.2680356529873929, 0.12570010553158464, -0.14339356684968585, -0.08679047131334387, -0.13019856940400565, -0.024269607109904643, 0.002438914203750236, -0.28208983708173035, 0.028029441153852357, 0.09177685092935073, -0.015207447619953502, 0.004404904313629405, -0.15514103909510943, 0.03293408630083182, 0.14682911585550756, 0.011624523975132476, 0.044140789820258285, 0.10996711029826353, -0.10001810736277894, -0.16940712150563264, 0.34128538117123147, -0.023414203479132128, -0.22018718554283537, 0.23153075972305878, -0.06098910049934472, -0.10870572958208088, 0.14700000150617035, 0.1874075669628967, 0.09236720643627147, -0.12083985569576422, 0.11646120456529648, -0.006612430490730774, 0.20013434065774727, 0.0805499265946093, 0.032270214872412564, 0.10764737248509412, 0.16111798691341564, 0.07963738119939254, 0.13017097652745654, -0.08023940281681938, -0.07656541452521369, -0.22566810895278605, -0.1337367623179619, -0.2040316492080733, -0.029955783632716962, -0.10162004886293462, -0.14960659833048426, 0.39007815309090627, 0.2062554242222437, 0.19706657240610748, 0.06333376403809303, 0.33737502063491515, 0.12013418593927608, 0.12048581331726468, 0.09390081823803484, 0.1993318923732399, 0.058313594082193006, 0.06889268417753988, -0.20894955236608873, 0.04639775212854147, 0.11716046369568045] |
1,803.00005 | Hardware-Efficient Guided Image Filtering For Multi-Label Problem | The Guided Filter (GF) is well-known for its linear complexity. However, when
filtering an image with an n-channel guidance, GF needs to invert an n x n
matrix for each pixel. To the best of our knowledge existing matrix inverse
algorithms are inefficient on current hardwares. This shortcoming limits
applications of multichannel guidance in computation intensive system such as
multi-label system. We need a new GF-like filter that can perform fast
multichannel image guided filtering. Since the optimal linear complexity of GF
cannot be minimized further, the only way thus is to bring all potentialities
of current parallel computing hardwares into full play. In this paper we
propose a hardware-efficient Guided Filter (HGF), which solves the efficiency
problem of multichannel guided image filtering and yields competent results
when applying it to multi-label problems with synthesized polynomial
multichannel guidance. Specifically, in order to boost the filtering
performance, HGF takes a new matrix inverse algorithm which only involves two
hardware-efficient operations: element-wise arithmetic calculations and box
filtering. In order to break the linear model restriction, HGF synthesizes a
polynomial multichannel guidance to introduce nonlinearity. Benefiting from our
polynomial guidance and hardware-efficient matrix inverse algorithm, HGF not
only is more sensitive to the underlying structure of guidance but also
achieves the fastest computing speed. Due to these merits, HGF obtains
state-of-the-art results in terms of accuracy and efficiency in the computation
intensive multi-label
| cs.CV | the guided filter gf is wellknown for its linear complexity however when filtering an image with an nchannel guidance gf needs to invert an n x n matrix for each pixel to the best of our knowledge existing matrix inverse algorithms are inefficient on current hardwares this shortcoming limits applications of multichannel guidance in computation intensive system such as multilabel system we need a new gflike filter that can perform fast multichannel image guided filtering since the optimal linear complexity of gf cannot be minimized further the only way thus is to bring all potentialities of current parallel computing hardwares into full play in this paper we propose a hardwareefficient guided filter hgf which solves the efficiency problem of multichannel guided image filtering and yields competent results when applying it to multilabel problems with synthesized polynomial multichannel guidance specifically in order to boost the filtering performance hgf takes a new matrix inverse algorithm which only involves two hardwareefficient operations elementwise arithmetic calculations and box filtering in order to break the linear model restriction hgf synthesizes a polynomial multichannel guidance to introduce nonlinearity benefiting from our polynomial guidance and hardwareefficient matrix inverse algorithm hgf not only is more sensitive to the underlying structure of guidance but also achieves the fastest computing speed due to these merits hgf obtains stateoftheart results in terms of accuracy and efficiency in the computation intensive multilabel | [['the', 'guided', 'filter', 'gf', 'is', 'wellknown', 'for', 'its', 'linear', 'complexity', 'however', 'when', 'filtering', 'an', 'image', 'with', 'an', 'nchannel', 'guidance', 'gf', 'needs', 'to', 'invert', 'an', 'n', 'x', 'n', 'matrix', 'for', 'each', 'pixel', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'existing', 'matrix', 'inverse', 'algorithms', 'are', 'inefficient', 'on', 'current', 'hardwares', 'this', 'shortcoming', 'limits', 'applications', 'of', 'multichannel', 'guidance', 'in', 'computation', 'intensive', 'system', 'such', 'as', 'multilabel', 'system', 'we', 'need', 'a', 'new', 'gflike', 'filter', 'that', 'can', 'perform', 'fast', 'multichannel', 'image', 'guided', 'filtering', 'since', 'the', 'optimal', 'linear', 'complexity', 'of', 'gf', 'can', 'not', 'be', 'minimized', 'further', 'the', 'only', 'way', 'thus', 'is', 'to', 'bring', 'all', 'potentialities', 'of', 'current', 'parallel', 'computing', 'hardwares', 'into', 'full', 'play', 'in', 'this', 'paper', 'we', 'propose', 'a', 'hardwareefficient', 'guided', 'filter', 'hgf', 'which', 'solves', 'the', 'efficiency', 'problem', 'of', 'multichannel', 'guided', 'image', 'filtering', 'and', 'yields', 'competent', 'results', 'when', 'applying', 'it', 'to', 'multilabel', 'problems', 'with', 'synthesized', 'polynomial', 'multichannel', 'guidance', 'specifically', 'in', 'order', 'to', 'boost', 'the', 'filtering', 'performance', 'hgf', 'takes', 'a', 'new', 'matrix', 'inverse', 'algorithm', 'which', 'only', 'involves', 'two', 'hardwareefficient', 'operations', 'elementwise', 'arithmetic', 'calculations', 'and', 'box', 'filtering', 'in', 'order', 'to', 'break', 'the', 'linear', 'model', 'restriction', 'hgf', 'synthesizes', 'a', 'polynomial', 'multichannel', 'guidance', 'to', 'introduce', 'nonlinearity', 'benefiting', 'from', 'our', 'polynomial', 'guidance', 'and', 'hardwareefficient', 'matrix', 'inverse', 'algorithm', 'hgf', 'not', 'only', 'is', 'more', 'sensitive', 'to', 'the', 'underlying', 'structure', 'of', 'guidance', 'but', 'also', 'achieves', 'the', 'fastest', 'computing', 'speed', 'due', 'to', 'these', 'merits', 'hgf', 'obtains', 'stateoftheart', 'results', 'in', 'terms', 'of', 'accuracy', 'and', 'efficiency', 'in', 'the', 'computation', 'intensive', 'multilabel']] | [-0.06683709707728627, -0.005556995488776643, -0.05731260766801627, 0.026817651474139774, -0.14792165687996084, -0.17782737574256632, 0.02720610722038976, 0.4377505291091359, -0.3164009552448988, -0.3195636271883774, 0.1084108445186006, -0.21401649585155688, -0.1883696266875157, 0.20932686715386808, -0.09442311900683031, 0.13192758125065746, 0.10853280008811017, 0.025802754493349272, -0.10105754004933103, -0.2620110424761863, 0.22872835636523592, 0.0935389238693144, 0.30576874255506403, 0.01539131058987392, 0.12101453546353656, 0.04083479360434348, -0.032246777761484616, -0.021958013947891153, -0.028845797801224524, 0.13749984062388135, 0.3041849729159604, 0.1603815397126195, 0.3142135396670631, -0.4373440531203928, -0.17544316575994068, 0.08712367888782983, 0.17778741039700158, 0.1082795736602629, -0.05875354474188973, -0.2753360870608088, 0.10635246141287295, -0.13057423714831795, -0.016758203751448056, -0.12070656951678836, -0.027870480513767056, -0.03820793553225129, -0.34482625113400306, 0.024912819947475445, 0.07804177669079407, -0.000557897596540304, -0.0028546072735005745, -0.14909416201990097, 0.07066013851891394, 0.11618337608372752, -0.03020516642845114, 0.03680622220828967, 0.13715316082107956, -0.15468038243909732, -0.13109593614480336, 0.37758165580099046, -0.03378636204009957, -0.23320060161691483, 0.14548623267632058, -0.04496870715596268, -0.12773321309916513, 0.14701453605843912, 0.1942972757317045, 0.08881209600190429, -0.12754290331770038, 0.0901433008439515, -0.008977198216092327, 0.21087178280172142, 0.03928986928810406, 0.02068222409428057, 0.11676761400177264, 0.2004034441349137, 0.10768769307709906, 0.1373310776078142, -0.07293381330749506, -0.06727961032276811, -0.23493645288677806, -0.15956368870506793, -0.18329667199008248, -0.00897246480327221, -0.08862274588546311, -0.1490013338341985, 0.3882810344028732, 0.21400172852546626, 0.17616317289800423, 0.06353063342546153, 0.36451464629853547, 0.1333906658849193, 0.08002010834243264, 0.08859503857750932, 0.1803137748775518, 0.08092106877542708, 0.07606112985978024, -0.21653947312860627, 0.036602073098006456, 0.0869156343244907] |
1,803.00006 | Multi-part balanced incomplete-block designs | We consider designs for cancer trials which allow each medical centre to
treat only a limited number of cancer types with only a limited number of
drugs. We specify desirable properties of these designs, and prove some
consequences. Then we give several different constructions. Finally we
generalise this to three or more types of object, such as biomarkers.
| stat.AP math.CO | we consider designs for cancer trials which allow each medical centre to treat only a limited number of cancer types with only a limited number of drugs we specify desirable properties of these designs and prove some consequences then we give several different constructions finally we generalise this to three or more types of object such as biomarkers | [['we', 'consider', 'designs', 'for', 'cancer', 'trials', 'which', 'allow', 'each', 'medical', 'centre', 'to', 'treat', 'only', 'a', 'limited', 'number', 'of', 'cancer', 'types', 'with', 'only', 'a', 'limited', 'number', 'of', 'drugs', 'we', 'specify', 'desirable', 'properties', 'of', 'these', 'designs', 'and', 'prove', 'some', 'consequences', 'then', 'we', 'give', 'several', 'different', 'constructions', 'finally', 'we', 'generalise', 'this', 'to', 'three', 'or', 'more', 'types', 'of', 'object', 'such', 'as', 'biomarkers']] | [-0.05976483041765811, 0.07072836918563678, 0.011968364794578018, 0.0976028030593719, -0.12506723808574266, -0.20454750457328968, 0.06195864195790913, 0.38361965686660904, -0.22136544217837267, -0.27692544840854305, 0.12959021622122363, -0.2454788759029631, -0.19031572379252135, 0.2410452154681793, -0.15504324026325525, 0.02539509697817266, 0.05940332527047601, 0.06154626438891965, -0.02474025068483476, -0.31688943264829317, 0.3073215343716458, -0.056148297233699726, 0.22842369509603958, 0.013066336938083685, 0.08420441754098082, 0.009564031862878594, -0.03985894425643672, 0.06223971475365347, -0.17674533968213305, 0.13196663053481486, 0.3407135908973628, 0.22468093022752297, 0.3487522813716325, -0.47323027201767626, -0.23456758846014994, 0.18030086907975632, 0.1049404822306001, 0.1583295008388412, -0.034060868724893605, -0.21820648984405502, 0.10949377117052289, -0.20459473396426645, -0.11074383608226118, -0.11749504136367186, -0.01514488194491072, 0.0823966727816853, -0.2789934370024451, -0.013353362944426721, 0.02118968003397358, 0.09489732235268658, -0.0661569216674001, -0.17940912266855996, 0.046569453006417585, 0.18364354042769893, 0.07125850973032608, -0.11556559033563425, 0.13629933386430915, -0.13034790866317805, -0.1489093520694637, 0.3296598345041275, 0.10003804258805507, -0.2350996581050728, 0.27667467923561945, -0.11899190738893531, -0.20777798230470768, 0.05344815663832786, 0.17763748817780087, 0.15768152073924913, -0.1503578307396122, -0.047073729546010044, -0.01586569269219863, 0.15189125162452974, 0.12882444177400962, 0.08506731255429573, 0.16071458510926057, 0.15088765533512521, 0.06808317409314472, 0.18319704733660508, -0.11209020247393899, 0.01621313709444527, -0.3018022169326914, -0.1768266399198308, -0.06399074959135133, 0.06462752196440023, -0.06748231840776561, -0.21368262235372296, 0.4011666726899044, 0.19676039648916702, 0.2054105072185911, 0.04397757083442512, 0.2620995325229034, -0.024352334522048075, 0.09629024949791873, -0.000490048354298904, 0.12341373647685597, 0.07642758311703801, 0.01624189028195266, -0.15784216391982447, 0.0545833222728608, 0.02153929271574678] |
1,803.00007 | How galaxies form stars: the connection between local and global star
formation in galaxy simulations | Using a suite of isolated $L_\star$ galaxy simulations, we show that global
depletion times and star-forming gas mass fractions in simulated galaxies
exhibit systematic and well-defined trends as a function of the local star
formation efficiency per freefall time, $\epsilon_{\rm ff}$, strength of
stellar feedback, and star formation threshold. We demonstrate that these
trends can be reproduced and explained by a simple physical model of global
star formation in galaxies. Our model is based on mass conservation and the
idea of gas cycling between star-forming and non-star-forming states on certain
characteristic time scales under the influence of dynamical and feedback
processes. Both the simulation results and our model predictions exhibit two
limiting regimes with rather different dependencies of global galactic
properties on the local parameters. When $\epsilon_{\rm ff}$ is small and
feedback is inefficient, the total star-forming mass fraction, $f_{\rm sf}$, is
independent of $\epsilon_{\rm ff}$ and the global depletion time, $\tau_{\rm
dep}$, scales inversely with $\epsilon_{\rm ff}$. When $\epsilon_{\rm ff}$ is
large or feedback is very efficient, these trends are reversed: $f_{\rm sf}
\propto \epsilon_{\rm ff}^{-1}$ and $\tau_{\rm dep}$ is independent of
$\epsilon_{\rm ff}$ but scales linearly with the feedback strength. We also
compare our results with the observed depletion times and mass fractions of
star-forming and molecular gas and show that they provide complementary
constraints on $\epsilon_{\rm ff}$ and the feedback strength. We show that
useful constraints on $\epsilon_{\rm ff}$ can also be obtained using
measurements of the depletion time and its scatter on different spatial scales.
| astro-ph.GA | using a suite of isolated l_star galaxy simulations we show that global depletion times and starforming gas mass fractions in simulated galaxies exhibit systematic and welldefined trends as a function of the local star formation efficiency per freefall time epsilon_rm ff strength of stellar feedback and star formation threshold we demonstrate that these trends can be reproduced and explained by a simple physical model of global star formation in galaxies our model is based on mass conservation and the idea of gas cycling between starforming and nonstarforming states on certain characteristic time scales under the influence of dynamical and feedback processes both the simulation results and our model predictions exhibit two limiting regimes with rather different dependencies of global galactic properties on the local parameters when epsilon_rm ff is small and feedback is inefficient the total starforming mass fraction f_rm sf is independent of epsilon_rm ff and the global depletion time tau_rm dep scales inversely with epsilon_rm ff when epsilon_rm ff is large or feedback is very efficient these trends are reversed f_rm sf propto epsilon_rm ff1 and tau_rm dep is independent of epsilon_rm ff but scales linearly with the feedback strength we also compare our results with the observed depletion times and mass fractions of starforming and molecular gas and show that they provide complementary constraints on epsilon_rm ff and the feedback strength we show that useful constraints on epsilon_rm ff can also be obtained using measurements of the depletion time and its scatter on different spatial scales | [['using', 'a', 'suite', 'of', 'isolated', 'l_star', 'galaxy', 'simulations', 'we', 'show', 'that', 'global', 'depletion', 'times', 'and', 'starforming', 'gas', 'mass', 'fractions', 'in', 'simulated', 'galaxies', 'exhibit', 'systematic', 'and', 'welldefined', 'trends', 'as', 'a', 'function', 'of', 'the', 'local', 'star', 'formation', 'efficiency', 'per', 'freefall', 'time', 'epsilon_rm', 'ff', 'strength', 'of', 'stellar', 'feedback', 'and', 'star', 'formation', 'threshold', 'we', 'demonstrate', 'that', 'these', 'trends', 'can', 'be', 'reproduced', 'and', 'explained', 'by', 'a', 'simple', 'physical', 'model', 'of', 'global', 'star', 'formation', 'in', 'galaxies', 'our', 'model', 'is', 'based', 'on', 'mass', 'conservation', 'and', 'the', 'idea', 'of', 'gas', 'cycling', 'between', 'starforming', 'and', 'nonstarforming', 'states', 'on', 'certain', 'characteristic', 'time', 'scales', 'under', 'the', 'influence', 'of', 'dynamical', 'and', 'feedback', 'processes', 'both', 'the', 'simulation', 'results', 'and', 'our', 'model', 'predictions', 'exhibit', 'two', 'limiting', 'regimes', 'with', 'rather', 'different', 'dependencies', 'of', 'global', 'galactic', 'properties', 'on', 'the', 'local', 'parameters', 'when', 'epsilon_rm', 'ff', 'is', 'small', 'and', 'feedback', 'is', 'inefficient', 'the', 'total', 'starforming', 'mass', 'fraction', 'f_rm', 'sf', 'is', 'independent', 'of', 'epsilon_rm', 'ff', 'and', 'the', 'global', 'depletion', 'time', 'tau_rm', 'dep', 'scales', 'inversely', 'with', 'epsilon_rm', 'ff', 'when', 'epsilon_rm', 'ff', 'is', 'large', 'or', 'feedback', 'is', 'very', 'efficient', 'these', 'trends', 'are', 'reversed', 'f_rm', 'sf', 'propto', 'epsilon_rm', 'ff1', 'and', 'tau_rm', 'dep', 'is', 'independent', 'of', 'epsilon_rm', 'ff', 'but', 'scales', 'linearly', 'with', 'the', 'feedback', 'strength', 'we', 'also', 'compare', 'our', 'results', 'with', 'the', 'observed', 'depletion', 'times', 'and', 'mass', 'fractions', 'of', 'starforming', 'and', 'molecular', 'gas', 'and', 'show', 'that', 'they', 'provide', 'complementary', 'constraints', 'on', 'epsilon_rm', 'ff', 'and', 'the', 'feedback', 'strength', 'we', 'show', 'that', 'useful', 'constraints', 'on', 'epsilon_rm', 'ff', 'can', 'also', 'be', 'obtained', 'using', 'measurements', 'of', 'the', 'depletion', 'time', 'and', 'its', 'scatter', 'on', 'different', 'spatial', 'scales']] | [-0.11822917457295014, 0.17826722464318495, -0.05140306412739806, 0.09075159135313862, 0.011353384873579186, -0.07275857191661889, 0.06400980674998319, 0.40652574251693896, -0.20854628130973105, -0.3415429679598345, 0.017619386153579896, -0.226968683964427, -0.026918371255700308, 0.22733236214213343, 0.033246019482051574, -0.03772093667873148, -0.005189192535572621, -0.07194751042797395, -0.0764362451561491, -0.2672163214381171, 0.2890026169421383, 0.06152509319330435, 0.21089335611692245, 0.057882921931747135, 0.06582240984367439, -0.1317584239354125, -0.04907943636092944, 0.018207222284060944, -0.19051341187027956, -0.03229635523517156, 0.17347922109733205, 0.1243243774578109, 0.2344124773068421, -0.4218735465832264, -0.1882789121434863, 0.07508770106865251, 0.17839158392122323, 0.016701353422130447, -0.06082154449026837, -0.21791636762040925, 0.05183123230156171, -0.1878187844069697, -0.06189555341721958, -0.0013491227151264987, 0.07742473092977421, 0.11338823008638034, -0.3073187301610503, 0.2162529117309481, 0.010485783343817702, 0.035972993207504474, -0.09765549328310946, -0.07612609440819865, -0.0967297493480146, 0.07560340794299852, -0.00642425728911332, 0.11059072479441104, 0.2714393083903804, -0.15354042793960726, 0.003861671048085613, 0.3851640817707397, -0.08832478001723103, -0.10119785874311524, 0.24724598827652156, -0.18371845175695406, -0.1456492146753882, 0.08307538399974027, 0.1453851827800865, 0.09515286121801679, -0.0738838465056096, 0.015419786152650553, 0.006749313146092865, 0.2462124973498135, -0.026734128113776207, 0.07464901960730023, 0.22309747356809226, 0.17651432738396297, 0.039776358992818846, 0.05929976722307832, -0.14808829175401853, -0.09979964839294553, -0.26889090302557384, -0.08121498611785591, -0.1241582642313108, 0.05169345299015757, -0.15092232725844834, -0.052987469801582004, 0.33282158489200664, 0.10803973254930961, 0.25981939894644673, 0.14032205670251957, 0.32213779855669145, 0.15981310362138423, 0.10182443822558267, 0.12790564946684402, 0.23576680267506456, 0.12993855578787475, 0.03073515900622036, -0.33546252136518917, 0.10403209678495834, 0.010603472885926325] |
1,803.00008 | INSPECTRE: Privately Estimating the Unseen | We develop differentially private methods for estimating various
distributional properties. Given a sample from a discrete distribution $p$,
some functional $f$, and accuracy and privacy parameters $\alpha$ and
$\varepsilon$, the goal is to estimate $f(p)$ up to accuracy $\alpha$, while
maintaining $\varepsilon$-differential privacy of the sample.
We prove almost-tight bounds on the sample size required for this problem for
several functionals of interest, including support size, support coverage, and
entropy. We show that the cost of privacy is negligible in a variety of
settings, both theoretically and experimentally. Our methods are based on a
sensitivity analysis of several state-of-the-art methods for estimating these
properties with sublinear sample complexities.
| cs.DS cs.CR cs.IT cs.LG math.IT math.ST stat.TH | we develop differentially private methods for estimating various distributional properties given a sample from a discrete distribution p some functional f and accuracy and privacy parameters alpha and varepsilon the goal is to estimate fp up to accuracy alpha while maintaining varepsilondifferential privacy of the sample we prove almosttight bounds on the sample size required for this problem for several functionals of interest including support size support coverage and entropy we show that the cost of privacy is negligible in a variety of settings both theoretically and experimentally our methods are based on a sensitivity analysis of several stateoftheart methods for estimating these properties with sublinear sample complexities | [['we', 'develop', 'differentially', 'private', 'methods', 'for', 'estimating', 'various', 'distributional', 'properties', 'given', 'a', 'sample', 'from', 'a', 'discrete', 'distribution', 'p', 'some', 'functional', 'f', 'and', 'accuracy', 'and', 'privacy', 'parameters', 'alpha', 'and', 'varepsilon', 'the', 'goal', 'is', 'to', 'estimate', 'fp', 'up', 'to', 'accuracy', 'alpha', 'while', 'maintaining', 'varepsilondifferential', 'privacy', 'of', 'the', 'sample', 'we', 'prove', 'almosttight', 'bounds', 'on', 'the', 'sample', 'size', 'required', 'for', 'this', 'problem', 'for', 'several', 'functionals', 'of', 'interest', 'including', 'support', 'size', 'support', 'coverage', 'and', 'entropy', 'we', 'show', 'that', 'the', 'cost', 'of', 'privacy', 'is', 'negligible', 'in', 'a', 'variety', 'of', 'settings', 'both', 'theoretically', 'and', 'experimentally', 'our', 'methods', 'are', 'based', 'on', 'a', 'sensitivity', 'analysis', 'of', 'several', 'stateoftheart', 'methods', 'for', 'estimating', 'these', 'properties', 'with', 'sublinear', 'sample', 'complexities']] | [-0.08946976000098167, -0.012411195776183848, -0.05302523721561388, 0.08848414855202902, -0.043076317735809694, -0.1070627902927636, 0.11473682412394771, 0.39115162452475893, -0.25171479027442356, -0.3561160766036698, 0.10106321696959505, -0.29786834972738113, -0.08023869231423035, 0.2522004316819625, -0.10033440775306965, 0.1671292631179784, 0.03373806166497094, 0.02992819561795504, -0.0632624577249064, -0.30361139138026544, 0.2901516929085591, 0.012947342753048159, 0.3022218491554398, 0.024626410406738245, 0.07660126781599873, -0.030238253586166712, -0.023153896176221746, 0.06412458470677612, -0.17797474319114473, 0.16655543603378142, 0.26035176190823595, 0.18121964161077309, 0.3605421293716602, -0.33820831811317476, -0.18221379555244413, 0.11185177656632193, 0.0998611391955314, 0.08070652368607828, -0.09902948241560133, -0.2458983109186024, 0.1395079648139438, -0.11964127193725828, -0.08224666185884012, -0.1360273734791446, 0.018705823481367487, 0.05569203247055325, -0.32431603440394, 0.06133924169396913, 0.0690520169618712, 0.08239014744241205, -0.06557744515723446, -0.1665294747196, 0.017393276057663134, 0.11682269373839652, 0.052334205099786806, -0.01681549630679742, 0.12068867499733137, -0.1471129696561817, -0.10108045067776132, 0.3340817366347269, -0.060169607073206594, -0.23311919216239066, 0.17816876425381956, -0.13398357754771564, -0.16435987150072362, 0.10671984104232655, 0.24277507752628513, 0.13728191245226534, -0.12832078318697987, 0.13210558795307642, -0.007059605223023229, 0.19449765852617998, 0.023587191455859552, 0.08946916445900031, 0.07331773314487051, 0.1732348596237393, 0.11239494165595344, 0.10754396201594284, -0.11277225658112136, -0.056474752810404254, -0.28829262115781334, -0.15768647579372758, -0.17305230064731505, 0.005764949916974055, -0.1391934980502238, -0.13860751456404277, 0.36105904179728693, 0.18922022952594691, 0.21853649745160644, 0.15408304871353148, 0.3072646744031873, 0.08273108482589359, 0.005681515740299666, 0.11669963606355951, 0.17768903591166707, 0.10725208626266707, 0.016725684414807433, -0.20691184640680957, 0.1518836858406387, 0.01671524289176213] |
1,803.00009 | Storm in a Teacup: X-ray view of an obscured quasar and superbubble | We present the X-ray properties of the 'Teacup AGN' (SDSS J1430+1339), a
$z=0.085$ type 2 quasar which is interacting dramatically with its host galaxy.
Spectral modelling of the central quasar reveals a powerful, highly obscured
AGN with a column density of $N_{\rm H}=(4.2$-$6.5)\times 10^{23}$ cm$^{-2}$
and an intrinsic luminosity of $L_{\rm 2\mbox{-}10\,keV}=(0.8$-$1.4)\times
10^{44}$ erg s$^{-1}$. The current high bolometric luminosity inferred ($L_{\rm
bol}\approx 10^{45}$-$10^{46}$ erg s$^{-1}$) has ramifications for previous
interpretations of the Teacup as a fading/dying quasar. High resolution Chandra
imaging data reveal a $\approx 10$ kpc loop of X-ray emission, co-spatial with
the 'eastern bubble' previously identified in luminous radio and ionised gas
(e.g., [OIII] line) emission. The X-ray emission from this structure is in good
agreement with a shocked thermal gas, with $T=(4$-$8)\times 10^{6}$ K, and
there is evidence for an additional hot component with $T\gtrsim 3\times
10^{7}$ K. Although the Teacup is a radiatively dominated AGN, the estimated
ratio between the bubble power and the X-ray luminosity is in remarkable
agreement with observations of ellipticals, groups, and clusters of galaxies
undergoing AGN feedback.
| astro-ph.GA astro-ph.HE | we present the xray properties of the teacup agn sdss j14301339 a z0085 type 2 quasar which is interacting dramatically with its host galaxy spectral modelling of the central quasar reveals a powerful highly obscured agn with a column density of n_rm h4265times 1023 cm2 and an intrinsic luminosity of l_rm 2mbox10kev0814times 1044 erg s1 the current high bolometric luminosity inferred l_rm bolapprox 10451046 erg s1 has ramifications for previous interpretations of the teacup as a fadingdying quasar high resolution chandra imaging data reveal a approx 10 kpc loop of xray emission cospatial with the eastern bubble previously identified in luminous radio and ionised gas eg oiii line emission the xray emission from this structure is in good agreement with a shocked thermal gas with t48times 106 k and there is evidence for an additional hot component with tgtrsim 3times 107 k although the teacup is a radiatively dominated agn the estimated ratio between the bubble power and the xray luminosity is in remarkable agreement with observations of ellipticals groups and clusters of galaxies undergoing agn feedback | [['we', 'present', 'the', 'xray', 'properties', 'of', 'the', 'teacup', 'agn', 'sdss', 'j14301339', 'a', 'z0085', 'type', '2', 'quasar', 'which', 'is', 'interacting', 'dramatically', 'with', 'its', 'host', 'galaxy', 'spectral', 'modelling', 'of', 'the', 'central', 'quasar', 'reveals', 'a', 'powerful', 'highly', 'obscured', 'agn', 'with', 'a', 'column', 'density', 'of', 'n_rm', 'h4265times', '1023', 'cm2', 'and', 'an', 'intrinsic', 'luminosity', 'of', 'l_rm', '2mbox10kev0814times', '1044', 'erg', 's1', 'the', 'current', 'high', 'bolometric', 'luminosity', 'inferred', 'l_rm', 'bolapprox', '10451046', 'erg', 's1', 'has', 'ramifications', 'for', 'previous', 'interpretations', 'of', 'the', 'teacup', 'as', 'a', 'fadingdying', 'quasar', 'high', 'resolution', 'chandra', 'imaging', 'data', 'reveal', 'a', 'approx', '10', 'kpc', 'loop', 'of', 'xray', 'emission', 'cospatial', 'with', 'the', 'eastern', 'bubble', 'previously', 'identified', 'in', 'luminous', 'radio', 'and', 'ionised', 'gas', 'eg', 'oiii', 'line', 'emission', 'the', 'xray', 'emission', 'from', 'this', 'structure', 'is', 'in', 'good', 'agreement', 'with', 'a', 'shocked', 'thermal', 'gas', 'with', 't48times', '106', 'k', 'and', 'there', 'is', 'evidence', 'for', 'an', 'additional', 'hot', 'component', 'with', 'tgtrsim', '3times', '107', 'k', 'although', 'the', 'teacup', 'is', 'a', 'radiatively', 'dominated', 'agn', 'the', 'estimated', 'ratio', 'between', 'the', 'bubble', 'power', 'and', 'the', 'xray', 'luminosity', 'is', 'in', 'remarkable', 'agreement', 'with', 'observations', 'of', 'ellipticals', 'groups', 'and', 'clusters', 'of', 'galaxies', 'undergoing', 'agn', 'feedback']] | [-0.04935368781348928, 0.09409919115839943, 0.00367785656694756, 0.11243231267990479, -0.08533645137199634, -0.08390765808262797, 0.03704538098725945, 0.49991935916071717, -0.058459745097342274, -0.33668343672463885, 0.06157349371743865, -0.37343904760945046, 0.06597273357125909, 0.20700286638154022, 0.013755673190665453, -0.07689460834554603, -0.016773364650150543, -0.14663544241447263, -0.04907668388426997, -0.2144582461002523, 0.23266157792098713, 0.10554646591785861, 0.17421576246581322, 0.003538066670190283, 0.12138890414458137, -0.1325955105848004, -0.08021087297996463, -0.02284288446508283, -0.12406896908366837, 0.04287492818988286, 0.285994496608023, 0.11512472980579924, 0.2028152692350992, -0.3225555023135141, -0.20944416861125636, 0.0492346148856213, 0.2060958612942899, -0.08007090569942171, -0.042816937874006325, -0.22831833368535479, 0.0098192501355634, -0.25561740641417197, -0.1849943635129738, 0.137983099660338, 0.0706262055345876, 0.008196478357424281, -0.1933556160775181, 0.22695246477053652, -0.02345741680365727, 0.09707620817637287, -0.1210386261843459, -0.040299485765836134, -0.08107421874355655, -0.04388801726176902, 0.021327213307052072, 0.14494261478052237, 0.23514765095463847, -0.1835323490275525, -0.03394739659974178, 0.3937661733023476, -0.025455337166677902, 0.13371146112940338, 0.23258237030660345, -0.21823359518122404, -0.20972918004588073, 0.25686432500904544, 0.0709313997717271, 0.060259017722442916, -0.09753657242880193, -0.00861658048200107, -0.07333030184016151, 0.3186608941367351, -0.03950235818859276, 0.0995608744337386, 0.32966894437667243, 0.0902917224218051, 0.0136560978134248, 0.10306728074630332, -0.25303675993724706, 0.06299135999396703, -0.22167423289258378, -0.053155270816628325, -0.1108035760238805, 0.19511580948046472, -0.20458041779589664, -0.10010448134190209, 0.2937291651479575, 0.06971806577991607, 0.28340427630830034, 0.031354825643871286, 0.3262587677156769, 0.12255867421667654, 0.07398664906653467, 0.17798691949547205, 0.32343647592744335, 0.23077142113538154, 0.06695297139231116, -0.258568062294724, 0.04421653729378852, 0.005734892119382789] |
1,803.0001 | Tangos: the agile numerical galaxy organization system | We present Tangos, a Python framework and web interface for database-driven
analysis of numerical structure formation simulations. To understand the role
that such a tool can play, consider constructing a history for the absolute
magnitude of each galaxy within a simulation. The magnitudes must first be
calculated for all halos at all timesteps and then linked using a merger tree;
folding the required information into a final analysis can entail significant
effort. Tangos is a generic solution to this information organization problem,
aiming to free users from the details of data management. At the querying
stage, our example of gathering properties over history is reduced to a few
clicks or a simple, single-line Python command. The framework is highly
extensible; in particular, users are expected to define their own properties
which tangos will write into the database. A variety of parallelization options
are available and the raw simulation data can be read using existing libraries
such as pynbody or yt. Finally, tangos-based databases and analysis pipelines
can easily be shared with collaborators or the broader community to ensure
reproducibility. User documentation is provided separately.
| astro-ph.IM astro-ph.GA | we present tangos a python framework and web interface for databasedriven analysis of numerical structure formation simulations to understand the role that such a tool can play consider constructing a history for the absolute magnitude of each galaxy within a simulation the magnitudes must first be calculated for all halos at all timesteps and then linked using a merger tree folding the required information into a final analysis can entail significant effort tangos is a generic solution to this information organization problem aiming to free users from the details of data management at the querying stage our example of gathering properties over history is reduced to a few clicks or a simple singleline python command the framework is highly extensible in particular users are expected to define their own properties which tangos will write into the database a variety of parallelization options are available and the raw simulation data can be read using existing libraries such as pynbody or yt finally tangosbased databases and analysis pipelines can easily be shared with collaborators or the broader community to ensure reproducibility user documentation is provided separately | [['we', 'present', 'tangos', 'a', 'python', 'framework', 'and', 'web', 'interface', 'for', 'databasedriven', 'analysis', 'of', 'numerical', 'structure', 'formation', 'simulations', 'to', 'understand', 'the', 'role', 'that', 'such', 'a', 'tool', 'can', 'play', 'consider', 'constructing', 'a', 'history', 'for', 'the', 'absolute', 'magnitude', 'of', 'each', 'galaxy', 'within', 'a', 'simulation', 'the', 'magnitudes', 'must', 'first', 'be', 'calculated', 'for', 'all', 'halos', 'at', 'all', 'timesteps', 'and', 'then', 'linked', 'using', 'a', 'merger', 'tree', 'folding', 'the', 'required', 'information', 'into', 'a', 'final', 'analysis', 'can', 'entail', 'significant', 'effort', 'tangos', 'is', 'a', 'generic', 'solution', 'to', 'this', 'information', 'organization', 'problem', 'aiming', 'to', 'free', 'users', 'from', 'the', 'details', 'of', 'data', 'management', 'at', 'the', 'querying', 'stage', 'our', 'example', 'of', 'gathering', 'properties', 'over', 'history', 'is', 'reduced', 'to', 'a', 'few', 'clicks', 'or', 'a', 'simple', 'singleline', 'python', 'command', 'the', 'framework', 'is', 'highly', 'extensible', 'in', 'particular', 'users', 'are', 'expected', 'to', 'define', 'their', 'own', 'properties', 'which', 'tangos', 'will', 'write', 'into', 'the', 'database', 'a', 'variety', 'of', 'parallelization', 'options', 'are', 'available', 'and', 'the', 'raw', 'simulation', 'data', 'can', 'be', 'read', 'using', 'existing', 'libraries', 'such', 'as', 'pynbody', 'or', 'yt', 'finally', 'tangosbased', 'databases', 'and', 'analysis', 'pipelines', 'can', 'easily', 'be', 'shared', 'with', 'collaborators', 'or', 'the', 'broader', 'community', 'to', 'ensure', 'reproducibility', 'user', 'documentation', 'is', 'provided', 'separately']] | [-0.08089354915216893, 0.02665007024860153, -0.104068969092383, 0.07181696705251503, -0.1512213527879954, -0.13379467243506513, 0.03448582329444464, 0.4056406012284672, -0.2893542935867067, -0.3527972773075677, 0.13454185425019874, -0.28205911781649096, -0.08133500200506955, 0.20599281090531743, -0.023570071575794736, 0.01572881427153454, 0.12818741441799, 0.021354938117828178, -0.036262470517553144, -0.2600540890675652, 0.2450789530412294, 0.09515198442450427, 0.2432654916697724, 0.03944750560529448, 0.06174113143588529, -0.005484028054135186, -0.08647730275169833, 0.009846105867456953, -0.12410723109964497, 0.1172496218453059, 0.33994087957838487, 0.22345297384267074, 0.2971530400260075, -0.42378850296973813, -0.16936566818833024, 0.06772059141419978, 0.1669597918126773, 0.12057674912528575, -0.06268870221977992, -0.2791878845962276, 0.11778022733435117, -0.20970580903915587, -0.08090517514866295, -0.10187456421656432, -0.016631679880627238, 0.019781504093566334, -0.2682455628333168, -0.004859304713471039, -0.0009368586348840496, 0.06293548753607896, -0.027191396114406186, -0.07629946589976508, -0.04311136493157432, 0.1909754561218126, -0.002455397256378821, 0.027277586443073393, 0.17097760265140416, -0.10307881394068577, -0.09540740529537088, 0.409555841314064, -0.023461972382802333, -0.17855261535905712, 0.18213984984802184, -0.06139195639803842, -0.14936936051830405, 0.10215889394493098, 0.20673864613450899, 0.08175476831588689, -0.21290989633128918, 0.048729927938528726, 0.014137904672719703, 0.20820017211819783, 0.03549825098105849, 0.005136513964936347, 0.24643674826474635, 0.19654524821025615, 0.01833827781828714, 0.11885800461251554, -0.037796066191231645, -0.07820636083264478, -0.2728116004881296, -0.16194098736005988, -0.13686371606053108, 0.019360501208671388, -0.08618649420716062, -0.13750918720356972, 0.3942891304063928, 0.1629314725850146, 0.13856496703350446, 0.05836751167137933, 0.3418914946039197, 0.04289926166625714, 0.10544828148328464, 0.09721090727751809, 0.12684047924883018, 0.025418861253586198, 0.11554242387493295, -0.14081096538639332, 0.12214712892559224, 0.01274202159698029] |
1,803.00011 | Percolation of functionalized colloids on patterned substrates | We study the percolation properties for a system of functionalized colloids
on patterned substrates via Monte Carlo simulations. The colloidal particles
are modeled as hard disks with three equally-distributed attractive patches on
their perimeter. We describe the patterns on the substrate as circular
potential wells of radius $R_p$ arranged in a regular square or hexagonal
lattice. We find a nonmonotonic behavior of the percolation threshold (packing
fraction) as a function of $R_p$. For attractive wells, the percolation
threshold is higher than the one for clean (non-patterned) substrates if the
circular wells are non-overlapping and can only be lower if the wells overlap.
For repulsive wells we find the opposite behavior. In addition, at high packing
fractions the formation of both structural and bond defects suppress
percolation. As a result, the percolation diagram is reentrant with the
non-percolated state occurring at very low and intermediate densities.
| cond-mat.soft cond-mat.mtrl-sci | we study the percolation properties for a system of functionalized colloids on patterned substrates via monte carlo simulations the colloidal particles are modeled as hard disks with three equallydistributed attractive patches on their perimeter we describe the patterns on the substrate as circular potential wells of radius r_p arranged in a regular square or hexagonal lattice we find a nonmonotonic behavior of the percolation threshold packing fraction as a function of r_p for attractive wells the percolation threshold is higher than the one for clean nonpatterned substrates if the circular wells are nonoverlapping and can only be lower if the wells overlap for repulsive wells we find the opposite behavior in addition at high packing fractions the formation of both structural and bond defects suppress percolation as a result the percolation diagram is reentrant with the nonpercolated state occurring at very low and intermediate densities | [['we', 'study', 'the', 'percolation', 'properties', 'for', 'a', 'system', 'of', 'functionalized', 'colloids', 'on', 'patterned', 'substrates', 'via', 'monte', 'carlo', 'simulations', 'the', 'colloidal', 'particles', 'are', 'modeled', 'as', 'hard', 'disks', 'with', 'three', 'equallydistributed', 'attractive', 'patches', 'on', 'their', 'perimeter', 'we', 'describe', 'the', 'patterns', 'on', 'the', 'substrate', 'as', 'circular', 'potential', 'wells', 'of', 'radius', 'r_p', 'arranged', 'in', 'a', 'regular', 'square', 'or', 'hexagonal', 'lattice', 'we', 'find', 'a', 'nonmonotonic', 'behavior', 'of', 'the', 'percolation', 'threshold', 'packing', 'fraction', 'as', 'a', 'function', 'of', 'r_p', 'for', 'attractive', 'wells', 'the', 'percolation', 'threshold', 'is', 'higher', 'than', 'the', 'one', 'for', 'clean', 'nonpatterned', 'substrates', 'if', 'the', 'circular', 'wells', 'are', 'nonoverlapping', 'and', 'can', 'only', 'be', 'lower', 'if', 'the', 'wells', 'overlap', 'for', 'repulsive', 'wells', 'we', 'find', 'the', 'opposite', 'behavior', 'in', 'addition', 'at', 'high', 'packing', 'fractions', 'the', 'formation', 'of', 'both', 'structural', 'and', 'bond', 'defects', 'suppress', 'percolation', 'as', 'a', 'result', 'the', 'percolation', 'diagram', 'is', 'reentrant', 'with', 'the', 'nonpercolated', 'state', 'occurring', 'at', 'very', 'low', 'and', 'intermediate', 'densities']] | [-0.13233400307081897, 0.21467510370601867, -0.057312761266426794, 0.06956149096408024, 0.03295451247711377, -0.1821933402808319, 0.06841585791894587, 0.4372288517140109, -0.22449603467408952, -0.27181516657101695, 0.07211301374762993, -0.33734311263622907, -0.1346341822135808, 0.12398538008364367, 0.04905298428031905, 0.031864414877932644, -0.006955821564870662, -0.030421338183805345, -0.06421948133743015, -0.2243244278581877, 0.2437993775764159, 0.001020662753104136, 0.2541695667109613, 0.11012525988646366, 0.034085587771802116, 0.045143017553371086, 0.14144376900894085, 0.07669309572284591, -0.23533562478320352, 0.034011359053567565, 0.1751184075813869, -0.08626496790956449, 0.2119363479958526, -0.4254135911834651, -0.18639172507000382, 0.09122636942353485, 0.1674612064910089, 0.11232049687412278, -0.08019684779794951, -0.24877724567235543, 0.07430045876716232, -0.13150669869420858, -0.13593271858026756, 0.01267085515348048, 0.03383570096359171, 0.08867790706712624, -0.23050879236182262, 0.11584993330440645, 0.03228874213126456, 0.052807208625920886, -0.049389338230007684, -0.12099981370847672, -0.06676866978021531, 0.09562315610638852, -0.035078445055265105, 0.014200493762398075, 0.22903092531808492, -0.15065185047027752, -0.11077702728357038, 0.4026961963431075, -0.018103527213980702, -0.143402553375425, 0.23524813379064716, -0.19775652040502634, -0.09669465111118966, 0.16873616034743086, 0.18298719846482936, 0.1100777217443904, -0.0879369521011791, 0.047673510914820985, -0.033835179740081316, 0.17454304407382834, 0.10815383788551493, 0.0017240924150522413, 0.28798851061548136, 0.21296367106702307, 0.10448338177841927, 0.19772085133088946, -0.12740382451628302, -0.10907780015519981, -0.20894660053309053, -0.12630785092358188, -0.23485927596519668, 0.016926076849280245, -0.14289703875878457, -0.2545012504087183, 0.2958076038044588, 0.06348893278728014, 0.23065154263428572, 0.0774449841681354, 0.20400343817931696, 0.07218310504686087, 0.07790375560489965, -0.006657069362699985, 0.22868035907760775, 0.14224257219486452, 0.053092536319785846, -0.1917556435704745, 0.06292274506634166, 0.05441920153860902] |
1,803.00012 | Galactic Dark Matter Population as the Source of Neutrino Masses | We propose that neutrino masses can be zero $in ~vacuo$ and may be generated
by the local distribution of dark matter through a feeble long range scalar
force. We discuss potential phenomenological constraints and implications of
this framework. Our model typically implies that the relic neutrino background
left over from the Big Bang is mostly absent in our Galactic neighborhood.
Hence, a positive detection signal from future proposed experiments, such as
PTOLEMY, could in principle falsify our scenario.
| hep-ph astro-ph.GA | we propose that neutrino masses can be zero in vacuo and may be generated by the local distribution of dark matter through a feeble long range scalar force we discuss potential phenomenological constraints and implications of this framework our model typically implies that the relic neutrino background left over from the big bang is mostly absent in our galactic neighborhood hence a positive detection signal from future proposed experiments such as ptolemy could in principle falsify our scenario | [['we', 'propose', 'that', 'neutrino', 'masses', 'can', 'be', 'zero', 'in', 'vacuo', 'and', 'may', 'be', 'generated', 'by', 'the', 'local', 'distribution', 'of', 'dark', 'matter', 'through', 'a', 'feeble', 'long', 'range', 'scalar', 'force', 'we', 'discuss', 'potential', 'phenomenological', 'constraints', 'and', 'implications', 'of', 'this', 'framework', 'our', 'model', 'typically', 'implies', 'that', 'the', 'relic', 'neutrino', 'background', 'left', 'over', 'from', 'the', 'big', 'bang', 'is', 'mostly', 'absent', 'in', 'our', 'galactic', 'neighborhood', 'hence', 'a', 'positive', 'detection', 'signal', 'from', 'future', 'proposed', 'experiments', 'such', 'as', 'ptolemy', 'could', 'in', 'principle', 'falsify', 'our', 'scenario']] | [-0.0939236103067509, 0.16812431270208877, -0.09155101692065215, 0.11467429529875517, -0.10775019808744009, -0.10209774544749123, 0.015034582298726607, 0.341661385129182, -0.27157074408247495, -0.316051876023173, 0.07342022425907019, -0.25210295147143114, -0.11193603937490246, 0.21447281423920336, -0.014168038379209928, -0.00066870539329755, 0.03947958230034997, 0.02838914052177316, -0.020458714260409277, -0.20889236538623196, 0.3023451331596917, 0.0851695069995446, 0.19565174273119715, 0.1012408790918879, 0.07507537382069784, -0.04949965591554363, -0.027315977548893828, -0.001932191686370434, -0.06750335139039611, 0.03376807607949162, 0.21572681301488325, 0.19853496355100128, 0.20174595796300146, -0.4398389221049654, -0.29574284236878157, 0.22936572062854582, 0.1702928272052071, 0.11505397727402548, -0.14296127459667146, -0.34308070700185805, 0.11630193261319222, -0.21421588968652755, -0.10789498822309841, -0.04364232360668934, -0.04420351330190897, -0.02775435355038215, -0.2581837324377818, 0.10919639098798282, -0.008814183636926688, -0.048612885571156554, -0.06955550520274884, -0.11021573143676879, 0.015589436972871996, 0.02269351290156826, 0.11820333641625415, 0.006984423677353427, 0.17975260282102495, -0.13681882498964953, -0.0880844228533813, 0.4108426937570748, -0.16078318638476327, -0.13234066418431795, 0.16283871019736695, -0.1523451558791865, -0.13258759037424356, 0.06305271439636365, 0.1456926740356721, 0.09337336058991078, -0.1618115323691223, 0.12703729049416068, -0.055834894438680165, 0.17011317611039162, 0.06175023897921141, 0.002238784212236985, 0.37044770523714715, 0.19092266340381825, 0.07769717864142969, 0.004150468924751458, -0.11324024248796587, -0.052174471384391956, -0.3844082130608746, -0.10802993130010481, -0.1325485483289529, 0.0588940229648963, -0.08316932180381488, -0.08320529306999958, 0.36361164934201856, 0.19747004519628647, 0.21960753031994384, 0.025771767826368794, 0.31286117900162935, 0.04881887274901741, 0.05737348939650334, 0.025826269515957206, 0.3148153131851592, 0.09263238430512735, 0.08795775376851313, -0.1898984307757555, 0.04444663470181135, -0.012865930819549622] |
1,803.00013 | Scaling and data collapse from local moments in frustrated disordered
quantum spin systems | Recently measurements on various spin-1/2 quantum magnets such as
H$_3$LiIr$_2$O$_6$, LiZn$_2$Mo$_3$O$_8$, ZnCu$_3$(OH)$_6$Cl$_2$ and 1T-TaS$_2$
-- all described by magnetic frustration and quenched disorder but with no
other common relation -- nevertheless showed apparently universal scaling
features at low temperature. In particular the heat capacity C[H,T] in
temperature T and magnetic field H exhibits T/H data collapse reminiscent of
scaling near a critical point. Here we propose a theory for this scaling
collapse based on an emergent random-singlet regime extended to include
spin-orbit coupling and antisymmetric Dzyaloshinskii-Moriya (DM) interactions.
We derive the scaling $C[H,T]/T \sim H^{-\gamma} F_q[T/H]$ with $F_q[x] =
x^{q}$ at small $x$, with $q \in$ (0,1,2) an integer exponent whose value
depends on spatial symmetries. The agreement with experiments indicates that a
fraction of spins form random valence bonds and that these are surrounded by a
quantum paramagnetic phase. We also discuss distinct scaling for magnetization
with a $q$-dependent subdominant term enforced by Maxwell's relations.
| cond-mat.str-el cond-mat.dis-nn | recently measurements on various spin12 quantum magnets such as h_3liir_2o_6 lizn_2mo_3o_8 zncu_3oh_6cl_2 and 1ttas_2 all described by magnetic frustration and quenched disorder but with no other common relation nevertheless showed apparently universal scaling features at low temperature in particular the heat capacity cht in temperature t and magnetic field h exhibits th data collapse reminiscent of scaling near a critical point here we propose a theory for this scaling collapse based on an emergent randomsinglet regime extended to include spinorbit coupling and antisymmetric dzyaloshinskiimoriya dm interactions we derive the scaling chtt sim hgamma f_qth with f_qx xq at small x with q in 012 an integer exponent whose value depends on spatial symmetries the agreement with experiments indicates that a fraction of spins form random valence bonds and that these are surrounded by a quantum paramagnetic phase we also discuss distinct scaling for magnetization with a qdependent subdominant term enforced by maxwells relations | [['recently', 'measurements', 'on', 'various', 'spin12', 'quantum', 'magnets', 'such', 'as', 'h_3liir_2o_6', 'lizn_2mo_3o_8', 'zncu_3oh_6cl_2', 'and', '1ttas_2', 'all', 'described', 'by', 'magnetic', 'frustration', 'and', 'quenched', 'disorder', 'but', 'with', 'no', 'other', 'common', 'relation', 'nevertheless', 'showed', 'apparently', 'universal', 'scaling', 'features', 'at', 'low', 'temperature', 'in', 'particular', 'the', 'heat', 'capacity', 'cht', 'in', 'temperature', 't', 'and', 'magnetic', 'field', 'h', 'exhibits', 'th', 'data', 'collapse', 'reminiscent', 'of', 'scaling', 'near', 'a', 'critical', 'point', 'here', 'we', 'propose', 'a', 'theory', 'for', 'this', 'scaling', 'collapse', 'based', 'on', 'an', 'emergent', 'randomsinglet', 'regime', 'extended', 'to', 'include', 'spinorbit', 'coupling', 'and', 'antisymmetric', 'dzyaloshinskiimoriya', 'dm', 'interactions', 'we', 'derive', 'the', 'scaling', 'chtt', 'sim', 'hgamma', 'f_qth', 'with', 'f_qx', 'xq', 'at', 'small', 'x', 'with', 'q', 'in', '012', 'an', 'integer', 'exponent', 'whose', 'value', 'depends', 'on', 'spatial', 'symmetries', 'the', 'agreement', 'with', 'experiments', 'indicates', 'that', 'a', 'fraction', 'of', 'spins', 'form', 'random', 'valence', 'bonds', 'and', 'that', 'these', 'are', 'surrounded', 'by', 'a', 'quantum', 'paramagnetic', 'phase', 'we', 'also', 'discuss', 'distinct', 'scaling', 'for', 'magnetization', 'with', 'a', 'qdependent', 'subdominant', 'term', 'enforced', 'by', 'maxwells', 'relations']] | [-0.191282513941521, 0.2381486621061232, -0.033620582864965186, 0.03326293537069408, -0.041048878400250406, -0.20159555306127727, 0.07092688505349694, 0.3514556829873102, -0.23352574367871792, -0.28430873304698, 0.027199268067372804, -0.3347716145155742, -0.12095492484436574, 0.16522979239211572, 0.060603479706737774, 0.003652585857310363, -0.06295183462103125, 0.029772408750673003, -0.09842471264931836, -0.17787545762142007, 0.3005639936878856, 0.01438982662010864, 0.2847704370907008, 0.0693832341826749, 0.06268098334001612, -0.00048333671505236076, 0.08610549820463685, 0.05164533979043562, -0.17478250266588216, -0.004025301025619126, 0.20979070232561264, -0.0650794172685729, 0.16170601557866232, -0.3933298502253085, -0.19044909824845413, 0.07978215479347485, 0.15526868188938756, 0.07168896949621818, -0.08908857997207724, -0.2743151666880246, 0.030389898570735527, -0.16050827522478406, -0.14528943217588458, -0.1224694196273579, 0.044201928941033385, -0.005939419934871477, -0.2797475427586511, 0.14132926796408007, 0.0831988074906195, 0.10909774761480458, -0.04194795053655787, -0.12527205281897097, -0.04211356837552238, 0.023477618499282774, 0.04713683306865567, 0.08011107368757855, 0.1352168563599174, -0.1366180838147388, -0.09810496037610072, 0.3465284185101654, -0.06948540576260277, -0.1198880999281213, 0.15986158411228252, -0.18663491696637396, -0.17059615760461877, 0.12156479591997155, 0.09955476609826557, 0.04464311329863768, -0.11376914847025413, 0.11247453528337084, -0.0268218337515036, 0.19806936808606604, 0.025599163281577113, 0.07120660320112276, 0.26192151359745014, 0.12470073084615245, 0.0059857158859982, 0.13843714729273718, -0.08771732489467407, -0.11258503213113895, -0.27796693830226626, -0.10747810984446686, -0.22639720877462888, 0.10557610065435731, -0.1572879476202706, -0.16439490835394382, 0.29341932007308974, 0.13286264570559442, 0.20350398710179313, 0.022303101076244912, 0.18947788162329635, 0.1274643575569109, 0.07801364650271389, 0.10512341319472338, 0.22180730984114505, 0.18052113593235267, 0.10320911297978623, -0.27585266604526154, 0.0430006149707463, 0.047703837285077336] |
1,803.00014 | Horndeski dark matter and beyond | Starting from the Gleyzes-Langlois-Piazza-Vernizzi action, we derive the most
general effective theory that is invariant under internal shifts and a
$\mathbb{Z}_2$ mirror symmetry in the scalar sector. Contrary to what one may
think, this model presents a dark matter tracker previous to the dark energy
domination. We show that, in an empty universe and to linear order in
perturbations, the scalar mode clusters in exactly the same way as standard
nonrelativistic cold dark matter. This also holds for the subsector of the
theory where the speed of propagation of gravitational waves equals that of
light, in agreement with the recent multimessenger observation. However, the
inclusion of standard model particles introduces nontrivial couplings of the
gravitational scalar mode to baryons, modifying their clustering properties. We
argue that no arrangement of the parameters of the model can reduce the extra
scalar to precisely behave as cold dark matter.
| gr-qc astro-ph.CO hep-th | starting from the gleyzeslangloispiazzavernizzi action we derive the most general effective theory that is invariant under internal shifts and a mathbbz_2 mirror symmetry in the scalar sector contrary to what one may think this model presents a dark matter tracker previous to the dark energy domination we show that in an empty universe and to linear order in perturbations the scalar mode clusters in exactly the same way as standard nonrelativistic cold dark matter this also holds for the subsector of the theory where the speed of propagation of gravitational waves equals that of light in agreement with the recent multimessenger observation however the inclusion of standard model particles introduces nontrivial couplings of the gravitational scalar mode to baryons modifying their clustering properties we argue that no arrangement of the parameters of the model can reduce the extra scalar to precisely behave as cold dark matter | [['starting', 'from', 'the', 'gleyzeslangloispiazzavernizzi', 'action', 'we', 'derive', 'the', 'most', 'general', 'effective', 'theory', 'that', 'is', 'invariant', 'under', 'internal', 'shifts', 'and', 'a', 'mathbbz_2', 'mirror', 'symmetry', 'in', 'the', 'scalar', 'sector', 'contrary', 'to', 'what', 'one', 'may', 'think', 'this', 'model', 'presents', 'a', 'dark', 'matter', 'tracker', 'previous', 'to', 'the', 'dark', 'energy', 'domination', 'we', 'show', 'that', 'in', 'an', 'empty', 'universe', 'and', 'to', 'linear', 'order', 'in', 'perturbations', 'the', 'scalar', 'mode', 'clusters', 'in', 'exactly', 'the', 'same', 'way', 'as', 'standard', 'nonrelativistic', 'cold', 'dark', 'matter', 'this', 'also', 'holds', 'for', 'the', 'subsector', 'of', 'the', 'theory', 'where', 'the', 'speed', 'of', 'propagation', 'of', 'gravitational', 'waves', 'equals', 'that', 'of', 'light', 'in', 'agreement', 'with', 'the', 'recent', 'multimessenger', 'observation', 'however', 'the', 'inclusion', 'of', 'standard', 'model', 'particles', 'introduces', 'nontrivial', 'couplings', 'of', 'the', 'gravitational', 'scalar', 'mode', 'to', 'baryons', 'modifying', 'their', 'clustering', 'properties', 'we', 'argue', 'that', 'no', 'arrangement', 'of', 'the', 'parameters', 'of', 'the', 'model', 'can', 'reduce', 'the', 'extra', 'scalar', 'to', 'precisely', 'behave', 'as', 'cold', 'dark', 'matter']] | [-0.1521955441192354, 0.2005962577995514, -0.12088618700213935, 0.10729817232381782, -0.12041829562305843, -0.1120092009372805, -0.030190381522877268, 0.2933918144809057, -0.2359568852546931, -0.32770869091204174, 0.009808941347977428, -0.28176722420405037, -0.10704506946446961, 0.1105642861922667, 0.007135866343821973, 0.01085503129543711, -0.006765772990423114, 0.08540459762467709, -0.04206166632014186, -0.23836254311904106, 0.3201315990475338, 0.06354894896503538, 0.23687882283830072, 0.014785183698484318, 0.0787114151689696, 0.009037482221323792, -0.0027299937393439754, -0.018141844322624272, -0.12044331094043566, 0.0876240417901873, 0.17616496710391788, 0.1007012172708964, 0.181831237735635, -0.44724058469578826, -0.24999778322263122, 0.1705411935722685, 0.14526533117946014, 0.15043413523131702, -0.06873073738884844, -0.2817928215220877, 0.0642681997085998, -0.18524856886456478, -0.17820337126414254, -0.029551334462243402, -0.007361245236346779, -0.051315931779530206, -0.23175853332791682, 0.10648882320893878, 0.02411757678922572, -0.05939558816895093, -0.06967182316313408, -0.07539915519029744, -0.035061428846459686, 0.024763764041692834, 0.1246875974577724, 0.02085855197837602, 0.15781689981996935, -0.21263505102052316, -0.09288258169943543, 0.45056419272919834, -0.16237966681604132, -0.1776776991279043, 0.16520948447159503, -0.14805494592431773, -0.1505894914272637, 0.08213943562610712, 0.13854889153209451, 0.07995404294781285, -0.1176361178864457, 0.14173081284947056, -0.0646211863367831, 0.1777278401901665, 0.07791036223890642, 0.0649916877106852, 0.2777137849862649, 0.1289864501832946, 0.07102030372782929, 0.09828019925562205, -0.027509461584411664, -0.1108346006576664, -0.36956074701188363, -0.15124850505715784, -0.12428404053646037, 0.023657480222874717, -0.09502360461680824, -0.14711213362888012, 0.38898350721965097, 0.16268351337990455, 0.16390355435129866, 0.032558834258377654, 0.30242193777318277, 0.08323432537025377, 0.04858855469860392, 0.0666165904186615, 0.3210889418252221, 0.13686006455299482, 0.07835698917457094, -0.23050931696492974, -0.039676555469855414, 0.03137838980183005] |
1,803.00015 | Theta in new QCD-like sectors | New QCD-like `hypercolor' sectors can generate a broad class of new
signatures at hadron colliders and furnish a variety of dark matter candidates.
Paired diboson resonances are a particularly important collider signature,
arising both from $CP$-conserving vector hypermeson decays of the form
$\widetilde\rho \rightarrow\widetilde\pi\widetilde\pi\rightarrow 4V$ and from
$CP$-violating pseudoscalar hypermeson decays of the form
$\widetilde\eta\rightarrow \widetilde\pi\widetilde\pi\rightarrow 4V$. The
latter are sensitive to the vacuum angle $\widetilde \theta$ in the hypercolor
sector. We study single- and paired-diboson resonance signatures in final
states involving gluons and photons at the LHC and a future 100 TeV $pp$
collider, illustrating the discovery potential at both colliders in simple
benchmark models. We also describe some of the theoretical and cosmological
consequences of $\widetilde \theta$. If $CP$-violating hypermeson decays are
observable at hadron colliders, ordinary QCD must have an axion. Such scenarios
also provide a natural setting for a dark pion component of dark matter, with
its relic abundance set by $CP$-violating annihilations. If the new vacuum
angle is relaxed to zero by a dark axion, the relic density can instead be a
mixture of axions and dark axions. Overproduction of dark axions is most easily
avoided if the universe underwent a period of early matter domination.
| hep-ph astro-ph.CO hep-ex | new qcdlike hypercolor sectors can generate a broad class of new signatures at hadron colliders and furnish a variety of dark matter candidates paired diboson resonances are a particularly important collider signature arising both from cpconserving vector hypermeson decays of the form widetilderho rightarrowwidetildepiwidetildepirightarrow 4v and from cpviolating pseudoscalar hypermeson decays of the form widetildeetarightarrow widetildepiwidetildepirightarrow 4v the latter are sensitive to the vacuum angle widetilde theta in the hypercolor sector we study single and paireddiboson resonance signatures in final states involving gluons and photons at the lhc and a future 100 tev pp collider illustrating the discovery potential at both colliders in simple benchmark models we also describe some of the theoretical and cosmological consequences of widetilde theta if cpviolating hypermeson decays are observable at hadron colliders ordinary qcd must have an axion such scenarios also provide a natural setting for a dark pion component of dark matter with its relic abundance set by cpviolating annihilations if the new vacuum angle is relaxed to zero by a dark axion the relic density can instead be a mixture of axions and dark axions overproduction of dark axions is most easily avoided if the universe underwent a period of early matter domination | [['new', 'qcdlike', 'hypercolor', 'sectors', 'can', 'generate', 'a', 'broad', 'class', 'of', 'new', 'signatures', 'at', 'hadron', 'colliders', 'and', 'furnish', 'a', 'variety', 'of', 'dark', 'matter', 'candidates', 'paired', 'diboson', 'resonances', 'are', 'a', 'particularly', 'important', 'collider', 'signature', 'arising', 'both', 'from', 'cpconserving', 'vector', 'hypermeson', 'decays', 'of', 'the', 'form', 'widetilderho', 'rightarrowwidetildepiwidetildepirightarrow', '4v', 'and', 'from', 'cpviolating', 'pseudoscalar', 'hypermeson', 'decays', 'of', 'the', 'form', 'widetildeetarightarrow', 'widetildepiwidetildepirightarrow', '4v', 'the', 'latter', 'are', 'sensitive', 'to', 'the', 'vacuum', 'angle', 'widetilde', 'theta', 'in', 'the', 'hypercolor', 'sector', 'we', 'study', 'single', 'and', 'paireddiboson', 'resonance', 'signatures', 'in', 'final', 'states', 'involving', 'gluons', 'and', 'photons', 'at', 'the', 'lhc', 'and', 'a', 'future', '100', 'tev', 'pp', 'collider', 'illustrating', 'the', 'discovery', 'potential', 'at', 'both', 'colliders', 'in', 'simple', 'benchmark', 'models', 'we', 'also', 'describe', 'some', 'of', 'the', 'theoretical', 'and', 'cosmological', 'consequences', 'of', 'widetilde', 'theta', 'if', 'cpviolating', 'hypermeson', 'decays', 'are', 'observable', 'at', 'hadron', 'colliders', 'ordinary', 'qcd', 'must', 'have', 'an', 'axion', 'such', 'scenarios', 'also', 'provide', 'a', 'natural', 'setting', 'for', 'a', 'dark', 'pion', 'component', 'of', 'dark', 'matter', 'with', 'its', 'relic', 'abundance', 'set', 'by', 'cpviolating', 'annihilations', 'if', 'the', 'new', 'vacuum', 'angle', 'is', 'relaxed', 'to', 'zero', 'by', 'a', 'dark', 'axion', 'the', 'relic', 'density', 'can', 'instead', 'be', 'a', 'mixture', 'of', 'axions', 'and', 'dark', 'axions', 'overproduction', 'of', 'dark', 'axions', 'is', 'most', 'easily', 'avoided', 'if', 'the', 'universe', 'underwent', 'a', 'period', 'of', 'early', 'matter', 'domination']] | [-0.12370509508704976, 0.28733869933005607, -0.13648018974226386, 0.17543277409217528, -0.13486143386131627, -0.16145311106870675, -0.01515007818447977, 0.2868115192814374, -0.21871594133684696, -0.29610796034459635, 0.02201111665962511, -0.2921362959765544, 0.010440672122949392, 0.1503340722526761, 0.09195308230237617, 0.03937088199255617, 0.06366682506810246, 0.0018205861479331435, -0.02339001538526571, -0.2398130651967296, 0.2911015923077963, 0.021817658669125214, 0.13451560100003582, 0.0980805174675675, 0.04749822845844058, -0.04171958447633577, 0.0067544544657053215, -0.08286632053382999, -0.10705973771599725, 0.030078288062287933, 0.23534102123124154, 0.11546555806749634, 0.12824877425072725, -0.35402890513365975, -0.1292726225326579, 0.23603190772463473, 0.15433009690605104, 0.09309546189021548, -0.11705595184811296, -0.35735167217041763, 0.07806192271082367, -0.2257752883704189, -0.11295949384731678, -0.0753162600603715, -0.020027648025591458, -0.10388846532827747, -0.31921379254864796, 0.09023553129655014, -0.1267099348134456, -0.038206873794219325, 0.008282110991303295, -0.20617957033183693, -0.030171600149051115, -0.07576160587617481, 0.13182805012139415, 0.0020098486114578434, 0.2061883818586262, -0.2503510469541652, -0.14914610164182984, 0.434701926236478, -0.12404977818606516, -0.11033630379646713, 0.1726032324748266, -0.1725980442525743, -0.1763580271223446, 0.15371987990422023, 0.21286882873510524, 0.07141187303160242, -0.13912708685752384, 0.19253422230884804, -0.04698792640036637, 0.1545995093088559, 0.08939296921966977, 0.09174525401286533, 0.37229020135211094, 0.17146025714464486, 0.048374170016934524, 0.045657644199791875, -0.06595222459516811, -0.023042878164548655, -0.4582134148733196, -0.1291738509233775, -0.08509514618151802, 0.03480232886171767, -0.06252858887151257, -0.09791969486966026, 0.3690588495299714, 0.06566514148452908, 0.23893630716769138, -0.027083353861710246, 0.2932582679204643, 0.04904797347032344, 0.010820377317607065, 0.02520539645715593, 0.3262379958054671, 0.15259473363046858, 0.12639416602193093, -0.21200104835870848, -0.02169459637691628, 0.029891594197857668] |
1,803.00016 | On the intrinsic shape of gamma-ray spectrum for Fermi blazars | The curvature of the $\gamma$-ray spectrum in blazars may reflect the
intrinsic distribution of the emitting electron distribution, which will
further give some information on the possible acceleration and cooling
processes in the emitting region. The $\gamma$-ray spectra of Fermi blazars are
normally fitted either by a single power-law (PL) or a log-normal (call
Logarithmic Parabola, LP) form. The possible reason for this differnece is not
unclear. We statistically explore this issue based on the different
observational properties of 1419 Fermi blazars in the 3LAC Clean sample. We
find that the $\gamma$-ray flux (100 MeV-100 GeV) and variability index follow
bimodal distributions for PL and LP blazars, where $\gamma$-ray flux and
variability index show {a positive correlation}. However, the distributions of
the $\gamma$-ray luminosity and redshift follow a unimodal distribution. Our
results suggest that the bimodal distribution of $\gamma$-ray flux for LP and
PL blazars may be not intrinsic and all blazars may have an intrinsic curved
$\gamma$-ray spectrum and the PL spectrum is just caused by the fitting effect
due to the less photons.
| astro-ph.HE | the curvature of the gammaray spectrum in blazars may reflect the intrinsic distribution of the emitting electron distribution which will further give some information on the possible acceleration and cooling processes in the emitting region the gammaray spectra of fermi blazars are normally fitted either by a single powerlaw pl or a lognormal call logarithmic parabola lp form the possible reason for this differnece is not unclear we statistically explore this issue based on the different observational properties of 1419 fermi blazars in the 3lac clean sample we find that the gammaray flux 100 mev100 gev and variability index follow bimodal distributions for pl and lp blazars where gammaray flux and variability index show a positive correlation however the distributions of the gammaray luminosity and redshift follow a unimodal distribution our results suggest that the bimodal distribution of gammaray flux for lp and pl blazars may be not intrinsic and all blazars may have an intrinsic curved gammaray spectrum and the pl spectrum is just caused by the fitting effect due to the less photons | [['the', 'curvature', 'of', 'the', 'gammaray', 'spectrum', 'in', 'blazars', 'may', 'reflect', 'the', 'intrinsic', 'distribution', 'of', 'the', 'emitting', 'electron', 'distribution', 'which', 'will', 'further', 'give', 'some', 'information', 'on', 'the', 'possible', 'acceleration', 'and', 'cooling', 'processes', 'in', 'the', 'emitting', 'region', 'the', 'gammaray', 'spectra', 'of', 'fermi', 'blazars', 'are', 'normally', 'fitted', 'either', 'by', 'a', 'single', 'powerlaw', 'pl', 'or', 'a', 'lognormal', 'call', 'logarithmic', 'parabola', 'lp', 'form', 'the', 'possible', 'reason', 'for', 'this', 'differnece', 'is', 'not', 'unclear', 'we', 'statistically', 'explore', 'this', 'issue', 'based', 'on', 'the', 'different', 'observational', 'properties', 'of', '1419', 'fermi', 'blazars', 'in', 'the', '3lac', 'clean', 'sample', 'we', 'find', 'that', 'the', 'gammaray', 'flux', '100', 'mev100', 'gev', 'and', 'variability', 'index', 'follow', 'bimodal', 'distributions', 'for', 'pl', 'and', 'lp', 'blazars', 'where', 'gammaray', 'flux', 'and', 'variability', 'index', 'show', 'a', 'positive', 'correlation', 'however', 'the', 'distributions', 'of', 'the', 'gammaray', 'luminosity', 'and', 'redshift', 'follow', 'a', 'unimodal', 'distribution', 'our', 'results', 'suggest', 'that', 'the', 'bimodal', 'distribution', 'of', 'gammaray', 'flux', 'for', 'lp', 'and', 'pl', 'blazars', 'may', 'be', 'not', 'intrinsic', 'and', 'all', 'blazars', 'may', 'have', 'an', 'intrinsic', 'curved', 'gammaray', 'spectrum', 'and', 'the', 'pl', 'spectrum', 'is', 'just', 'caused', 'by', 'the', 'fitting', 'effect', 'due', 'to', 'the', 'less', 'photons']] | [-0.03438535303776634, 0.1672893455768059, -0.11985871147487484, 0.22797639389126295, -0.10593598596644642, -0.127782650869982, 0.04852456301962555, 0.4896973720269984, -0.2214515949813542, -0.3367943562842884, 0.003032205688590505, -0.3197425227483799, -0.012247130822058467, 0.24444037403285118, -0.034658410464816235, 0.004832966033711858, 0.011562450688557121, -0.09772385494655063, -0.025559640641979225, -0.1929700478788294, 0.3267024185497785, 0.11053214360820665, 0.26356040214585813, 0.041374621883398674, 0.04966615047573444, -0.050976674837841726, -0.047320317930773424, -0.04734121101919091, -0.08623216177871111, 0.0826717986104389, 0.18711282643917734, 0.07765144220521224, 0.16801636462667208, -0.3063020817558706, -0.27167706208399917, 0.13819238953238847, 0.16979907379196635, -0.044084679201545046, -0.03280422955232234, -0.24383513573503615, 0.01895559969694011, -0.14959837412247542, -0.15096385221949768, 0.03564156855231729, 0.03566130607699355, 0.0586812207930261, -0.164952607370442, 0.1214678808618551, 0.08725456173274794, 0.04053496208239946, -0.11089201632555275, -0.07957012779293475, -0.030569442008266053, 0.0353226096505813, 0.08978593792370253, 0.040121264947075186, 0.14334830296247256, -0.10860774831996224, -0.10404804604223009, 0.37291796433193414, -0.04585004924935685, -0.07690002546570766, 0.12820068391270123, -0.2454901835024785, -0.1876108865387438, 0.17183866537839773, 0.15038239465352018, 0.07539843850844037, -0.16050682584862172, 0.03849276077489358, -0.017918378874745178, 0.22218259719960476, 0.012950343020988265, 0.0854192577729312, 0.26901645865558976, 0.09295568595929392, 0.0539513199346611, 0.11242422430532524, -0.2451720395227145, 0.0012505207332546941, -0.30832708813250065, -0.06461329049104289, -0.20222617704862858, 0.14844293156976612, -0.10680246039162572, -0.15791346895476355, 0.4246534881805573, 0.058091072474697324, 0.24256105672022135, 0.08061061148871614, 0.24396308255649504, 0.13440373576655662, 0.043167353182196104, 0.14952730967652525, 0.32287599787403076, 0.07592121965316093, 0.08516128244542184, -0.19774350707001728, 0.0939504158543958, -0.0533523123079761] |
1,803.00017 | Roles of chiral renormalization on magnetization dynamics in chiral
magnets | In metallic ferromagnets, the interaction between local magnetic moments and
conduction electrons renormalizes parameters of the Landau-Lifshitz-Gilbert
equation such as the gyromagnetic ratio and the Gilbert damping, and makes them
dependent on the magnetic configurations. Although the effects of the
renormalization for nonchiral ferromagnets are usually minor and hardly
detectable, we show that the renormalization does play a crucial role for
chiral magnets. Here the renormalization is chiral and as such we predict
experimentally identifiable effects on the phenomenology of magnetization
dynamics. In particular, our theory for the self-consistent magnetization
dynamics of chiral magnets allows for a concise interpretation of domain wall
creep motion. We also argue that the conventional creep theory of the domain
wall motion, which assumes Markovian dynamics, needs critical reexamination
since the gyromagnetic ratio makes the motion non-Markovian. The non-Markovian
nature of the domain wall dynamics is experimentally checkable by the chirality
of the renormalization.
| cond-mat.mes-hall cond-mat.mtrl-sci | in metallic ferromagnets the interaction between local magnetic moments and conduction electrons renormalizes parameters of the landaulifshitzgilbert equation such as the gyromagnetic ratio and the gilbert damping and makes them dependent on the magnetic configurations although the effects of the renormalization for nonchiral ferromagnets are usually minor and hardly detectable we show that the renormalization does play a crucial role for chiral magnets here the renormalization is chiral and as such we predict experimentally identifiable effects on the phenomenology of magnetization dynamics in particular our theory for the selfconsistent magnetization dynamics of chiral magnets allows for a concise interpretation of domain wall creep motion we also argue that the conventional creep theory of the domain wall motion which assumes markovian dynamics needs critical reexamination since the gyromagnetic ratio makes the motion nonmarkovian the nonmarkovian nature of the domain wall dynamics is experimentally checkable by the chirality of the renormalization | [['in', 'metallic', 'ferromagnets', 'the', 'interaction', 'between', 'local', 'magnetic', 'moments', 'and', 'conduction', 'electrons', 'renormalizes', 'parameters', 'of', 'the', 'landaulifshitzgilbert', 'equation', 'such', 'as', 'the', 'gyromagnetic', 'ratio', 'and', 'the', 'gilbert', 'damping', 'and', 'makes', 'them', 'dependent', 'on', 'the', 'magnetic', 'configurations', 'although', 'the', 'effects', 'of', 'the', 'renormalization', 'for', 'nonchiral', 'ferromagnets', 'are', 'usually', 'minor', 'and', 'hardly', 'detectable', 'we', 'show', 'that', 'the', 'renormalization', 'does', 'play', 'a', 'crucial', 'role', 'for', 'chiral', 'magnets', 'here', 'the', 'renormalization', 'is', 'chiral', 'and', 'as', 'such', 'we', 'predict', 'experimentally', 'identifiable', 'effects', 'on', 'the', 'phenomenology', 'of', 'magnetization', 'dynamics', 'in', 'particular', 'our', 'theory', 'for', 'the', 'selfconsistent', 'magnetization', 'dynamics', 'of', 'chiral', 'magnets', 'allows', 'for', 'a', 'concise', 'interpretation', 'of', 'domain', 'wall', 'creep', 'motion', 'we', 'also', 'argue', 'that', 'the', 'conventional', 'creep', 'theory', 'of', 'the', 'domain', 'wall', 'motion', 'which', 'assumes', 'markovian', 'dynamics', 'needs', 'critical', 'reexamination', 'since', 'the', 'gyromagnetic', 'ratio', 'makes', 'the', 'motion', 'nonmarkovian', 'the', 'nonmarkovian', 'nature', 'of', 'the', 'domain', 'wall', 'dynamics', 'is', 'experimentally', 'checkable', 'by', 'the', 'chirality', 'of', 'the', 'renormalization']] | [-0.1782555953168229, 0.20845568383225058, -0.07640166206741643, 0.05677664090704248, -0.13356254690939298, -0.10354205592216661, 0.009654450947543818, 0.37612879281276024, -0.26160310795093145, -0.26443382960137907, 0.019849446249403834, -0.24899886174906036, -0.15977148413845657, 0.16071564941698271, 0.042647759802014434, 0.038722554579443194, -0.015802343836172964, 0.004904971595528542, -0.05073807388231558, -0.1404132598748543, 0.28215888817638357, -0.0071585087993201, 0.3249083389903125, 0.12736329014238046, 0.07420646947427284, 0.02132274350463944, 0.07411119373727765, 0.03577830624647889, -0.13731712843865726, 0.018769824549230752, 0.18305404420399837, -0.0801098675173301, 0.19334405888147002, -0.49289979943193046, -0.21325171473061028, 0.005612201082376426, 0.15995551308151335, 0.17109797323269507, -0.03130338977844198, -0.28197181931596826, 0.008394787544322093, -0.13320010709232533, -0.1428532899660527, -0.13981662309672307, 0.045467248403673506, -0.013436557078146494, -0.2645911317753868, 0.14795193146979094, 0.09167437198503106, 0.040153317653492795, -0.07240150048242781, -0.08664689531577939, -0.04110589925662283, 0.0924435219029746, 0.09488141221063048, 0.016204987205689986, 0.20580304854380704, -0.18981440358321752, -0.11138805722655266, 0.3993596428217704, -0.04846660634065234, -0.21403024617688818, 0.16170516008223662, -0.16240626845302547, -0.10627031618074495, 0.10385197651964743, 0.1052321550630083, 0.12138457688184193, -0.15955859872093736, 0.10421812095040231, -0.0001675675266841114, 0.14247167247328782, 0.0018106524820045737, 0.04338917188696413, 0.23758419620610724, 0.18871469169717608, 0.017726833688332732, 0.11629595965398601, -0.10588662135793715, -0.14042839955463504, -0.3158319440339036, -0.1272797081619501, -0.21676428104757062, 0.07963000736125095, -0.10861618483809038, -0.18454335298039168, 0.40321800804028174, 0.1981628770571227, 0.1377358588565066, -0.016301869305363238, 0.26340796826907353, 0.10498162631754882, 0.05721844839332188, 0.059958290772812575, 0.2812283227357688, 0.16864376089648161, 0.11133850069447802, -0.3626195750630542, 0.09832980036860545, 0.05504185202431509] |
1,803.00018 | The Magnetic Response of the Solar Atmosphere to Umbral Flashes | Chromospheric observations of sunspot umbrae offer an exceptional view of
magneto-acoustic shock phenomena and the impact they have on the surrounding
magnetically-dominated plasma. We employ simultaneous slit-based
spectro-polarimetry and spectral imaging observations of the chromospheric He I
10830{\AA} and Ca II 8542{\AA} lines to examine fluctuations in the umbral
magnetic field caused by the steepening of magneto-acoustic waves into umbral
flashes. Following the application of modern inversion routines, we find
evidence to support the scenario that umbral shock events cause expansion of
the embedded magnetic field lines due to the increased adiabatic pressure. The
large number statistics employed allow us to calculate the adiabatic index,
gamma = 1.12 +/- 0.01, for chromospheric umbral locations. Examination of the
vector magnetic field fluctuations perpendicular to the solar normal revealed
changes up to ~200 G at the locations of umbral flashes. Such transversal
magnetic field fluctuations have not been described before. Through comparisons
with non-linear force-free field extrapolations, we find that the perturbations
of the transverse field components are orientated in the same direction as the
quiescent field geometries. This implies that magnetic field enhancements
produced by umbral flashes are directed along the motion path of the developing
shock, hence producing relatively small changes, up to a maximum of ~8 degrees,
in the inclination and/or azimuthal directions of the magnetic field.
Importantly, this work highlights that umbral flashes are able to modify the
full vector magnetic field, with the detection of the weaker transverse
magnetic field components made possible by high-resolution data combined with
modern inversion routines.
| astro-ph.SR | chromospheric observations of sunspot umbrae offer an exceptional view of magnetoacoustic shock phenomena and the impact they have on the surrounding magneticallydominated plasma we employ simultaneous slitbased spectropolarimetry and spectral imaging observations of the chromospheric he i 10830aa and ca ii 8542aa lines to examine fluctuations in the umbral magnetic field caused by the steepening of magnetoacoustic waves into umbral flashes following the application of modern inversion routines we find evidence to support the scenario that umbral shock events cause expansion of the embedded magnetic field lines due to the increased adiabatic pressure the large number statistics employed allow us to calculate the adiabatic index gamma 112 001 for chromospheric umbral locations examination of the vector magnetic field fluctuations perpendicular to the solar normal revealed changes up to 200 g at the locations of umbral flashes such transversal magnetic field fluctuations have not been described before through comparisons with nonlinear forcefree field extrapolations we find that the perturbations of the transverse field components are orientated in the same direction as the quiescent field geometries this implies that magnetic field enhancements produced by umbral flashes are directed along the motion path of the developing shock hence producing relatively small changes up to a maximum of 8 degrees in the inclination andor azimuthal directions of the magnetic field importantly this work highlights that umbral flashes are able to modify the full vector magnetic field with the detection of the weaker transverse magnetic field components made possible by highresolution data combined with modern inversion routines | [['chromospheric', 'observations', 'of', 'sunspot', 'umbrae', 'offer', 'an', 'exceptional', 'view', 'of', 'magnetoacoustic', 'shock', 'phenomena', 'and', 'the', 'impact', 'they', 'have', 'on', 'the', 'surrounding', 'magneticallydominated', 'plasma', 'we', 'employ', 'simultaneous', 'slitbased', 'spectropolarimetry', 'and', 'spectral', 'imaging', 'observations', 'of', 'the', 'chromospheric', 'he', 'i', '10830aa', 'and', 'ca', 'ii', '8542aa', 'lines', 'to', 'examine', 'fluctuations', 'in', 'the', 'umbral', 'magnetic', 'field', 'caused', 'by', 'the', 'steepening', 'of', 'magnetoacoustic', 'waves', 'into', 'umbral', 'flashes', 'following', 'the', 'application', 'of', 'modern', 'inversion', 'routines', 'we', 'find', 'evidence', 'to', 'support', 'the', 'scenario', 'that', 'umbral', 'shock', 'events', 'cause', 'expansion', 'of', 'the', 'embedded', 'magnetic', 'field', 'lines', 'due', 'to', 'the', 'increased', 'adiabatic', 'pressure', 'the', 'large', 'number', 'statistics', 'employed', 'allow', 'us', 'to', 'calculate', 'the', 'adiabatic', 'index', 'gamma', '112', '001', 'for', 'chromospheric', 'umbral', 'locations', 'examination', 'of', 'the', 'vector', 'magnetic', 'field', 'fluctuations', 'perpendicular', 'to', 'the', 'solar', 'normal', 'revealed', 'changes', 'up', 'to', '200', 'g', 'at', 'the', 'locations', 'of', 'umbral', 'flashes', 'such', 'transversal', 'magnetic', 'field', 'fluctuations', 'have', 'not', 'been', 'described', 'before', 'through', 'comparisons', 'with', 'nonlinear', 'forcefree', 'field', 'extrapolations', 'we', 'find', 'that', 'the', 'perturbations', 'of', 'the', 'transverse', 'field', 'components', 'are', 'orientated', 'in', 'the', 'same', 'direction', 'as', 'the', 'quiescent', 'field', 'geometries', 'this', 'implies', 'that', 'magnetic', 'field', 'enhancements', 'produced', 'by', 'umbral', 'flashes', 'are', 'directed', 'along', 'the', 'motion', 'path', 'of', 'the', 'developing', 'shock', 'hence', 'producing', 'relatively', 'small', 'changes', 'up', 'to', 'a', 'maximum', 'of', '8', 'degrees', 'in', 'the', 'inclination', 'andor', 'azimuthal', 'directions', 'of', 'the', 'magnetic', 'field', 'importantly', 'this', 'work', 'highlights', 'that', 'umbral', 'flashes', 'are', 'able', 'to', 'modify', 'the', 'full', 'vector', 'magnetic', 'field', 'with', 'the', 'detection', 'of', 'the', 'weaker', 'transverse', 'magnetic', 'field', 'components', 'made', 'possible', 'by', 'highresolution', 'data', 'combined', 'with', 'modern', 'inversion', 'routines']] | [-0.14981811150394764, 0.21865367922717788, -0.02920842188639596, 0.0934102425470926, -0.11525223084766092, -0.0645925615699814, -0.006982978107222903, 0.4299859498804879, -0.23670504156625755, -0.354684256756353, 0.05871844410920323, -0.22992612321728043, -0.0841214645225259, 0.20700093379820741, 0.005257018957294465, -0.02656208440783389, 0.07311016943958026, -0.014331544453780803, -0.030572785177875112, -0.15956225503043878, 0.2484880195679291, 0.08816619343419987, 0.2540904671242017, 0.007370937127797376, 0.024356896950011437, -0.04592899661067696, -0.038094575513183834, 0.0496099806655871, -0.11533416742774232, 0.07020548801266982, 0.18930218266968807, 0.09345378595337804, 0.22530073578384455, -0.5199072271038497, -0.2347575060557574, 0.024866532859584643, 0.1703917516643987, 0.05550755570191772, -0.03191211657914599, -0.26951985670686035, 0.04274841130060691, -0.08450006871412154, -0.17367293214007828, 0.011742347463344535, 0.039347435261348325, 0.06734812438547139, -0.24251977411017472, 0.06199540821872356, 0.044295198499481006, 0.16689230312061096, -0.052842854926099775, -0.05555796798869288, -0.04248633928733715, 0.07652403580880399, 0.1236014144221646, 0.060374887039264045, 0.1876884040953767, -0.1404342240213217, -0.0870553370858986, 0.33334025113828597, -0.08475948370751067, -0.04101601277574128, 0.1457752518832595, -0.21282142504037077, -0.11869954688974382, 0.22811431122468165, 0.15322368396196648, 0.07676191823021139, -0.05369945187749903, 0.027932816810933882, 0.003394246018687559, 0.12428042909642312, 0.07888049171638808, 0.006270302140841349, 0.2823858952762373, 0.0330977700622974, 0.010694612979383988, 0.11231893395274205, -0.24210732079957362, -0.03557978602082816, -0.29592482203669435, -0.14472064444063498, -0.08820654153602109, 0.04713661500696501, -0.09763440330535227, -0.22410084852082138, 0.4265402101261157, 0.18367054469196037, 0.1603794211867295, -0.04631974529715196, 0.27613562324439134, 0.1270475461612463, 0.10133364477327891, 0.1422011053488989, 0.2983672089786047, 0.28155492173252805, 0.17506223071795252, -0.23296207205821123, 0.007019471452896675, 0.004657019423099146] |
1,803.00019 | Floquet Quantum Criticality | We study transitions between distinct phases of one-dimensional periodically
driven (Floquet) systems. We argue that these are generically controlled by
infinite-randomness fixed points of a strong-disorder renormalization group
procedure. Working in the fermionic representation of the prototypical Floquet
Ising chain, we leverage infinite randomness physics to provide a simple
description of Floquet (multi)criticality in terms of a new type of domain wall
associated with time-translational symmetry-breaking and the formation of
`Floquet time crystals'. We validate our analysis via numerical simulations of
free-fermion models sufficient to capture the critical physics.
| cond-mat.dis-nn cond-mat.stat-mech cond-mat.str-el | we study transitions between distinct phases of onedimensional periodically driven floquet systems we argue that these are generically controlled by infiniterandomness fixed points of a strongdisorder renormalization group procedure working in the fermionic representation of the prototypical floquet ising chain we leverage infinite randomness physics to provide a simple description of floquet multicriticality in terms of a new type of domain wall associated with timetranslational symmetrybreaking and the formation of floquet time crystals we validate our analysis via numerical simulations of freefermion models sufficient to capture the critical physics | [['we', 'study', 'transitions', 'between', 'distinct', 'phases', 'of', 'onedimensional', 'periodically', 'driven', 'floquet', 'systems', 'we', 'argue', 'that', 'these', 'are', 'generically', 'controlled', 'by', 'infiniterandomness', 'fixed', 'points', 'of', 'a', 'strongdisorder', 'renormalization', 'group', 'procedure', 'working', 'in', 'the', 'fermionic', 'representation', 'of', 'the', 'prototypical', 'floquet', 'ising', 'chain', 'we', 'leverage', 'infinite', 'randomness', 'physics', 'to', 'provide', 'a', 'simple', 'description', 'of', 'floquet', 'multicriticality', 'in', 'terms', 'of', 'a', 'new', 'type', 'of', 'domain', 'wall', 'associated', 'with', 'timetranslational', 'symmetrybreaking', 'and', 'the', 'formation', 'of', 'floquet', 'time', 'crystals', 'we', 'validate', 'our', 'analysis', 'via', 'numerical', 'simulations', 'of', 'freefermion', 'models', 'sufficient', 'to', 'capture', 'the', 'critical', 'physics']] | [-0.19566926526512657, 0.20257101860943805, -0.10360552704882588, 0.041126902434933055, -0.04765960224380905, -0.1818410352636338, 0.10267520787487372, 0.3489088187977839, -0.26366623018585733, -0.22812341904958314, 0.07139080025784127, -0.2428784745227378, -0.19156781097434544, 0.1671138328991914, 0.027592908015495604, 0.06037244570096222, 0.006663593390349592, -0.03176002012103995, -0.12871626091419897, -0.18283789904181208, 0.3336179533219907, -0.04403009052974371, 0.2826219495344028, 0.013072614626059036, 0.03196179102896975, -0.003148435845217678, 0.021361473510878977, -0.0056745957771546385, -0.1986755795618735, 0.07789614974793173, 0.25886487244194917, -0.022472651445128944, 0.2257046045577206, -0.4611787235552675, -0.22553451069410932, 0.09846386267133894, 0.1690570037717816, 0.15483734014789374, -0.06498796517013708, -0.3296955536130104, 0.04705295788668347, -0.19848641598325098, -0.16623478477527753, -0.15227880294312424, -0.03115251741445299, 0.01747371021689575, -0.2303472162496424, 0.09231745555416127, 0.057138750980117, 0.13049175658556267, -0.050373523479740896, 0.007894213102088215, -0.0441262136302428, 0.10514550369489269, 0.01991855784246091, -0.042773628154811394, 0.11808209490617004, -0.11469084684726562, -0.1960813949365964, 0.3782266695680243, -0.045556820929050446, -0.15925316531420425, 0.2500460823432783, -0.1350018995556669, -0.15464931204810403, 0.1190163946679134, 0.14116899147917505, 0.06579829437469834, -0.12325936237355338, 0.10899101780515603, -0.04553111040901937, 0.15044001306588972, -0.023558109810345628, 0.007533644289406163, 0.2339299482010891, 0.17782167507482044, 0.026381935735934236, 0.17896596899025896, -0.014177680528968615, -0.1847139463833209, -0.3400905796201125, -0.12731370860396812, -0.2433749106451032, 0.04409722343029643, -0.1050795301521299, -0.2149511464201751, 0.46355520521573135, 0.17904106443297627, 0.17167263795108942, 0.010079574759780125, 0.1834613618681605, 0.15387096770207156, -0.005334842374569245, 0.03306491489344266, 0.16346968996359476, 0.1282358997294763, 0.041819322187181436, -0.2947853212611059, -0.04923857240205149, 0.13836332828622688] |
1,803.0002 | X-ray scaling relations of early-type galaxies | X-ray luminosity, temperature, gas mass, total mass, and their scaling
relations are derived for 94 early-type galaxies using archival $Chandra$ X-ray
Observatory observations. Consistent with earlier studies, the scaling
relations, $L_X \propto T^{4.5\pm0.2}$, $M \propto T^{2.4\pm0.2}$, and $L_X
\propto M^{2.8\pm0.3}$, are significantly steeper than expected from self
similarity. This steepening indicates that their atmospheres are heated above
the level expected from gravitational infall alone. Energetic feedback from
nuclear black holes and supernova explosions are likely heating agents. The
tight $L_X - T$ correlation for low-luminosities systems (i.e., below 10$^{40}$
erg/s) are at variance with hydrodynamical simulations which generally predict
higher temperatures for low luminosity galaxies. We also investigate the
relationship between total mass and pressure, $Y_X = M_g \times T$, finding $M
\propto Y_{X}^{0.45\pm0.04}$. We explore the gas mass to total mass fraction in
early-type galaxies and find a range of $0.1-1.0\%$. We find no correlation
between the gas-to-total mass fraction with temperature or total mass. Higher
stellar velocity dispersions and higher metallicities are found in hotter,
brighter, and more massive atmospheres. X-ray core radii derived from
$\beta$-model fitting are used to characterize the degree of core and cuspiness
of hot atmospheres.
| astro-ph.GA astro-ph.CO | xray luminosity temperature gas mass total mass and their scaling relations are derived for 94 earlytype galaxies using archival chandra xray observatory observations consistent with earlier studies the scaling relations l_x propto t45pm02 m propto t24pm02 and l_x propto m28pm03 are significantly steeper than expected from self similarity this steepening indicates that their atmospheres are heated above the level expected from gravitational infall alone energetic feedback from nuclear black holes and supernova explosions are likely heating agents the tight l_x t correlation for lowluminosities systems ie below 1040 ergs are at variance with hydrodynamical simulations which generally predict higher temperatures for low luminosity galaxies we also investigate the relationship between total mass and pressure y_x m_g times t finding m propto y_x045pm004 we explore the gas mass to total mass fraction in earlytype galaxies and find a range of 0110 we find no correlation between the gastototal mass fraction with temperature or total mass higher stellar velocity dispersions and higher metallicities are found in hotter brighter and more massive atmospheres xray core radii derived from betamodel fitting are used to characterize the degree of core and cuspiness of hot atmospheres | [['xray', 'luminosity', 'temperature', 'gas', 'mass', 'total', 'mass', 'and', 'their', 'scaling', 'relations', 'are', 'derived', 'for', '94', 'earlytype', 'galaxies', 'using', 'archival', 'chandra', 'xray', 'observatory', 'observations', 'consistent', 'with', 'earlier', 'studies', 'the', 'scaling', 'relations', 'l_x', 'propto', 't45pm02', 'm', 'propto', 't24pm02', 'and', 'l_x', 'propto', 'm28pm03', 'are', 'significantly', 'steeper', 'than', 'expected', 'from', 'self', 'similarity', 'this', 'steepening', 'indicates', 'that', 'their', 'atmospheres', 'are', 'heated', 'above', 'the', 'level', 'expected', 'from', 'gravitational', 'infall', 'alone', 'energetic', 'feedback', 'from', 'nuclear', 'black', 'holes', 'and', 'supernova', 'explosions', 'are', 'likely', 'heating', 'agents', 'the', 'tight', 'l_x', 't', 'correlation', 'for', 'lowluminosities', 'systems', 'ie', 'below', '1040', 'ergs', 'are', 'at', 'variance', 'with', 'hydrodynamical', 'simulations', 'which', 'generally', 'predict', 'higher', 'temperatures', 'for', 'low', 'luminosity', 'galaxies', 'we', 'also', 'investigate', 'the', 'relationship', 'between', 'total', 'mass', 'and', 'pressure', 'y_x', 'm_g', 'times', 't', 'finding', 'm', 'propto', 'y_x045pm004', 'we', 'explore', 'the', 'gas', 'mass', 'to', 'total', 'mass', 'fraction', 'in', 'earlytype', 'galaxies', 'and', 'find', 'a', 'range', 'of', '0110', 'we', 'find', 'no', 'correlation', 'between', 'the', 'gastototal', 'mass', 'fraction', 'with', 'temperature', 'or', 'total', 'mass', 'higher', 'stellar', 'velocity', 'dispersions', 'and', 'higher', 'metallicities', 'are', 'found', 'in', 'hotter', 'brighter', 'and', 'more', 'massive', 'atmospheres', 'xray', 'core', 'radii', 'derived', 'from', 'betamodel', 'fitting', 'are', 'used', 'to', 'characterize', 'the', 'degree', 'of', 'core', 'and', 'cuspiness', 'of', 'hot', 'atmospheres']] | [-0.05533440809156145, 0.20168837102165105, -0.015524460052851068, 0.2005356374035229, -0.06833599786329213, -0.06369400949728105, 0.05202767712261868, 0.45343673859112044, -0.09744879914327495, -0.4134861239061881, -0.01063015459540991, -0.3750646333059957, 0.035260293050669134, 0.22855816398101347, 0.016705727818990327, -0.020596714934424287, -0.0032655736681834985, -0.08617422386524468, -0.12482940877402221, -0.2388129149787679, 0.2878621458313778, 0.09137116028221264, 0.15291510430735447, -0.019162077263938964, 0.021014848686454278, -0.1310987343726259, -0.06985304539682724, -0.012354123430521858, -0.20873450115530393, -0.0434451841934514, 0.21177007318626132, 0.09322270659369326, 0.17953334488375214, -0.3410126326145023, -0.20761655556834152, 0.09332792425868652, 0.19787921421029556, -0.0666374451986524, -0.04735930633935539, -0.1774046516085985, 0.036454771815608904, -0.23523689126691302, -0.16708114981821548, 0.07432379010033303, 0.0874175537022091, 0.02607620403312232, -0.2260094537620022, 0.2657810900851981, -0.02790763228380632, 0.0711510408349255, -0.16037421355584777, -0.13322520809140437, -0.14974415382984976, 0.013290896300121301, 0.031868902220320634, 0.08279420046704716, 0.2384605066430184, -0.12916556995184292, 0.055504337424457435, 0.3852297846348055, -0.04343664974529078, 0.05970987023895867, 0.24758421844722683, -0.25213875095059557, -0.14709734735992908, 0.1631478422812076, 0.17402082466475305, 0.07521548296415037, -0.1689039695624923, -0.015277277902162994, -0.02336266940780064, 0.2607701785414309, 0.058017914644092, 0.06889945632072889, 0.35404521881061934, 0.07660778756290974, 0.011869181262990159, 0.04513592953463235, -0.17194679788293776, 0.01227540548350061, -0.18019337640194003, -0.05897477687016049, -0.10569340287537504, 0.12454745603565087, -0.18496382249686968, -0.06427766248065557, 0.22341816472790896, 0.11248794779862448, 0.24279451420811074, 0.1786744346515456, 0.30137020376143914, 0.16037119086831808, 0.10950416547586761, 0.21148749612902681, 0.2938132688968933, 0.22103302429119745, 0.07585131119240716, -0.2862377263585566, 0.018440841223984476, 0.016287039626159416] |
1,803.00021 | Common exotic decays of top partners | Many standard model extensions that address the hierarchy problem contain
Dirac-fermion partners of the top quark, which are typically expected around
the TeV scale. Searches for these vector-like quarks mostly focus on their
decay into electroweak gauge bosons and Higgs plus a standard model quark. In
this article, backed by models of composite Higgs, we propose a set of
simplified scenarios, with effective Lagrangians and benchmarks, that include
more exotic decay channels, which modify the search strategies and affect the
bounds. Analysing several classes of underlying models, we show that exotic
decays are the norm and commonly appear with significant rates. All these
models contain light new scalars that couple to top partners with charge $5/3$,
$2/3$, and $-1/3$.
| hep-ph hep-ex | many standard model extensions that address the hierarchy problem contain diracfermion partners of the top quark which are typically expected around the tev scale searches for these vectorlike quarks mostly focus on their decay into electroweak gauge bosons and higgs plus a standard model quark in this article backed by models of composite higgs we propose a set of simplified scenarios with effective lagrangians and benchmarks that include more exotic decay channels which modify the search strategies and affect the bounds analysing several classes of underlying models we show that exotic decays are the norm and commonly appear with significant rates all these models contain light new scalars that couple to top partners with charge 53 23 and 13 | [['many', 'standard', 'model', 'extensions', 'that', 'address', 'the', 'hierarchy', 'problem', 'contain', 'diracfermion', 'partners', 'of', 'the', 'top', 'quark', 'which', 'are', 'typically', 'expected', 'around', 'the', 'tev', 'scale', 'searches', 'for', 'these', 'vectorlike', 'quarks', 'mostly', 'focus', 'on', 'their', 'decay', 'into', 'electroweak', 'gauge', 'bosons', 'and', 'higgs', 'plus', 'a', 'standard', 'model', 'quark', 'in', 'this', 'article', 'backed', 'by', 'models', 'of', 'composite', 'higgs', 'we', 'propose', 'a', 'set', 'of', 'simplified', 'scenarios', 'with', 'effective', 'lagrangians', 'and', 'benchmarks', 'that', 'include', 'more', 'exotic', 'decay', 'channels', 'which', 'modify', 'the', 'search', 'strategies', 'and', 'affect', 'the', 'bounds', 'analysing', 'several', 'classes', 'of', 'underlying', 'models', 'we', 'show', 'that', 'exotic', 'decays', 'are', 'the', 'norm', 'and', 'commonly', 'appear', 'with', 'significant', 'rates', 'all', 'these', 'models', 'contain', 'light', 'new', 'scalars', 'that', 'couple', 'to', 'top', 'partners', 'with', 'charge', '53', '23', 'and', '13']] | [-0.049839445247956624, 0.2513603536909086, -0.046619117851104945, 0.17973732477261395, -0.06383019456827715, -0.22038883628801076, 0.04649395664015143, 0.31905192391899956, -0.21111702494237164, -0.3438574557560457, 0.06432033593848567, -0.30431906231718153, -0.06027285794594458, 0.1470644666809401, 0.042164330163328836, 0.061816656288980434, 0.08801786909505975, -0.009963778645864554, -0.04967581579352126, -0.2823692184145085, 0.32242772400285263, -0.03898565087686567, 0.19268026576620065, 0.08050878912194812, 0.02425052612010358, -0.02561322909568538, -0.059286825339302046, -0.0805123509181773, -0.08928682728198029, 0.13048750602252812, 0.13910557159748854, 0.08062354710829608, 0.15080034629512235, -0.3984582419781124, -0.16943763348688723, 0.18511447862197622, 0.14553230586109542, 0.10505603079903214, -0.07738153613722754, -0.31317491142055753, 0.1257853406489271, -0.21583327511325479, -0.0741966640813464, -0.10035824814044378, -0.05603559553415804, -0.034006375529873775, -0.2903960977618371, 0.06080941104857415, -0.00484901767991045, 0.02493009585109461, -0.016227528043952184, -0.2183346633404149, -0.04961961109245963, 0.01227656948309736, 0.1579287545188103, -0.012633891414729644, 0.17134595564527422, -0.21637623493966623, -0.21141483708472625, 0.402776313812605, -0.1033866680814188, -0.21908422701154687, 0.23179314795787595, -0.09839796081200994, -0.15582832191609033, 0.11883930102804628, 0.2565527392488693, 0.09574661488417818, -0.1774893672667256, 0.14873364569859954, -0.06339829007531476, 0.17384961052962086, 0.043129704720458066, 0.1062843615850512, 0.2641813241164474, 0.17131638500307286, 0.000945055449847132, 0.04333637112422901, -0.030927255849487016, -0.1422069647991169, -0.39467215275063233, -0.11800469202772096, -0.022617343332845437, 0.004392589960920335, -0.04925047481731422, -0.13447607302658668, 0.43913979975491013, 0.151771107376964, 0.23225596129205547, 0.03228535273742369, 0.24926135378318423, 0.061595461263928855, 0.1285535868222066, 0.08187450427061119, 0.293937244497537, 0.1063574651948826, 0.0864494629947766, -0.14187334642252503, -0.030088818601250428, 0.06963182045851185] |
1,803.00022 | Fitting the radial acceleration relation to individual SPARC galaxies | Galaxies follow a tight radial acceleration relation (RAR): the acceleration
observed at every radius correlates with that expected from the distribution of
baryons. We use the Markov Chain Monte Carlo method to fit the mean RAR to 175
individual galaxies in the SPARC database, marginalizing over stellar
mass-to-light ratio ($\Upsilon_{\star}$), galaxy distance, and disk
inclination. Acceptable fits with astrophysically reasonable parameters are
found for the vast majority of galaxies. The residuals around these fits have
an rms scatter of only 0.057 dex ($\sim$13$\%$). This is in agreement with the
predictions of modified Newtonian dynamics (MOND). We further consider a
generalized version of the RAR that, unlike MOND, permits galaxy-to-galaxy
variation in the critical acceleration scale. The fits are not improved with
this additional freedom: there is no credible indication of variation in the
critical acceleration scale. The data are consistent with the action of a
single effective force law. The apparent universality of the acceleration scale
and the small residual scatter are key to understanding galaxies.
| astro-ph.GA astro-ph.CO | galaxies follow a tight radial acceleration relation rar the acceleration observed at every radius correlates with that expected from the distribution of baryons we use the markov chain monte carlo method to fit the mean rar to 175 individual galaxies in the sparc database marginalizing over stellar masstolight ratio upsilon_star galaxy distance and disk inclination acceptable fits with astrophysically reasonable parameters are found for the vast majority of galaxies the residuals around these fits have an rms scatter of only 0057 dex sim13 this is in agreement with the predictions of modified newtonian dynamics mond we further consider a generalized version of the rar that unlike mond permits galaxytogalaxy variation in the critical acceleration scale the fits are not improved with this additional freedom there is no credible indication of variation in the critical acceleration scale the data are consistent with the action of a single effective force law the apparent universality of the acceleration scale and the small residual scatter are key to understanding galaxies | [['galaxies', 'follow', 'a', 'tight', 'radial', 'acceleration', 'relation', 'rar', 'the', 'acceleration', 'observed', 'at', 'every', 'radius', 'correlates', 'with', 'that', 'expected', 'from', 'the', 'distribution', 'of', 'baryons', 'we', 'use', 'the', 'markov', 'chain', 'monte', 'carlo', 'method', 'to', 'fit', 'the', 'mean', 'rar', 'to', '175', 'individual', 'galaxies', 'in', 'the', 'sparc', 'database', 'marginalizing', 'over', 'stellar', 'masstolight', 'ratio', 'upsilon_star', 'galaxy', 'distance', 'and', 'disk', 'inclination', 'acceptable', 'fits', 'with', 'astrophysically', 'reasonable', 'parameters', 'are', 'found', 'for', 'the', 'vast', 'majority', 'of', 'galaxies', 'the', 'residuals', 'around', 'these', 'fits', 'have', 'an', 'rms', 'scatter', 'of', 'only', '0057', 'dex', 'sim13', 'this', 'is', 'in', 'agreement', 'with', 'the', 'predictions', 'of', 'modified', 'newtonian', 'dynamics', 'mond', 'we', 'further', 'consider', 'a', 'generalized', 'version', 'of', 'the', 'rar', 'that', 'unlike', 'mond', 'permits', 'galaxytogalaxy', 'variation', 'in', 'the', 'critical', 'acceleration', 'scale', 'the', 'fits', 'are', 'not', 'improved', 'with', 'this', 'additional', 'freedom', 'there', 'is', 'no', 'credible', 'indication', 'of', 'variation', 'in', 'the', 'critical', 'acceleration', 'scale', 'the', 'data', 'are', 'consistent', 'with', 'the', 'action', 'of', 'a', 'single', 'effective', 'force', 'law', 'the', 'apparent', 'universality', 'of', 'the', 'acceleration', 'scale', 'and', 'the', 'small', 'residual', 'scatter', 'are', 'key', 'to', 'understanding', 'galaxies']] | [-0.08968230035487024, 0.10659905190024517, -0.10795778698913461, 0.14791242829986836, -0.07829626093629792, -0.1007308085317196, 0.01628054819681334, 0.40537095052773603, -0.19383286810423955, -0.3659429518864995, -0.012252155040581542, -0.2870793617442699, -0.015979846473783255, 0.19239620422293624, -0.04277406351820352, 0.0378858891662199, 0.04838809017681079, -0.03248900114712922, -0.07863587982032492, -0.2348477324998253, 0.2473818445185491, 0.12177534594483876, 0.22153498110058437, -0.04819155696019283, 0.07143813145069226, -0.06822926703425326, -0.043272435120924053, 0.021064704946096403, -0.1815593119894599, 0.04887181151299232, 0.17162017272616995, 0.10819935240973551, 0.22222254159916416, -0.31685212333542884, -0.20006235328265212, 0.11860499465389245, 0.19730789596018528, 0.06810465941904463, -0.06389793525842657, -0.21295097896952675, 0.05308369348801852, -0.1710722330419055, -0.1676861773475062, 0.015112224335120205, 0.035591498421258236, 0.02878643591966794, -0.2584229133243347, 0.19894403309742947, 0.013356889338591641, 0.09648508929748492, -0.08631903045047748, -0.1302942314510604, -0.004312522445681943, 0.06597162150295384, 0.08192013280819653, 0.10822679071283214, 0.18052812349801625, -0.10730197789927338, -0.006645224098163848, 0.4322656208133123, -0.09523096275431699, -0.10378144114805632, 0.14130887919363666, -0.19407466668246387, -0.15330635618519442, 0.11374813229608607, 0.14002588545028344, 0.029857809813379335, -0.14883197656080846, 0.06474900720514784, -0.036970246637223224, 0.24462760848565454, 0.025517343745794126, -0.0001287558588956017, 0.2774401541900294, 0.11096663747830682, 0.02242254371143294, 0.013214061730990118, -0.16485789647965457, -0.12579174293345402, -0.29337187047419416, -0.07911378086238807, -0.11619372545153811, 0.050804559990054655, -0.20847297405402584, -0.12001884310416518, 0.3409385328484048, 0.17407554769534914, 0.24532184746755983, 0.14901942978837493, 0.3035428504773741, 0.1065359811147069, 0.12071080285289987, 0.1256857852013894, 0.3108195921585682, 0.12489132265032954, 0.02805539165239175, -0.26440794095088427, 0.10070881918100752, -0.015099918433319193] |
1,803.00023 | Criteria for protected edge modes with $\mathbb{Z}_2$ symmetry | We derive a necessary and sufficient criterion for when a two dimensional
gapped many-body system with Abelian anyons and a unitary $\mathbb{Z}_2$
symmetry has a protected gapless edge mode. Our criterion is phrased in terms
of edge theories --- or more specifically, chiral boson edge theories with
$\mathbb{Z}_2$ symmetry --- and it applies to any bosonic or fermionic system
whose boundary can be described by such an edge theory. At an operational
level, our criterion takes as input a chiral boson edge theory with
$\mathbb{Z}_2$ symmetry, and then produces as output a prediction as to whether
this edge theory can be gapped without breaking the symmetry. Like previous
work, much of our derivation involves constructing explicit perturbations that
gap chiral boson edge theories. Interestingly, however, we find that the
standard class of gapping perturbations --- namely cosine terms constructed
from null-vectors --- is not sufficient to gap some edge theories with
$\mathbb{Z}_2$ symmetry, and thus we are forced to go beyond the usual
null-vector analysis to establish our results.
| cond-mat.str-el | we derive a necessary and sufficient criterion for when a two dimensional gapped manybody system with abelian anyons and a unitary mathbbz_2 symmetry has a protected gapless edge mode our criterion is phrased in terms of edge theories or more specifically chiral boson edge theories with mathbbz_2 symmetry and it applies to any bosonic or fermionic system whose boundary can be described by such an edge theory at an operational level our criterion takes as input a chiral boson edge theory with mathbbz_2 symmetry and then produces as output a prediction as to whether this edge theory can be gapped without breaking the symmetry like previous work much of our derivation involves constructing explicit perturbations that gap chiral boson edge theories interestingly however we find that the standard class of gapping perturbations namely cosine terms constructed from nullvectors is not sufficient to gap some edge theories with mathbbz_2 symmetry and thus we are forced to go beyond the usual nullvector analysis to establish our results | [['we', 'derive', 'a', 'necessary', 'and', 'sufficient', 'criterion', 'for', 'when', 'a', 'two', 'dimensional', 'gapped', 'manybody', 'system', 'with', 'abelian', 'anyons', 'and', 'a', 'unitary', 'mathbbz_2', 'symmetry', 'has', 'a', 'protected', 'gapless', 'edge', 'mode', 'our', 'criterion', 'is', 'phrased', 'in', 'terms', 'of', 'edge', 'theories', 'or', 'more', 'specifically', 'chiral', 'boson', 'edge', 'theories', 'with', 'mathbbz_2', 'symmetry', 'and', 'it', 'applies', 'to', 'any', 'bosonic', 'or', 'fermionic', 'system', 'whose', 'boundary', 'can', 'be', 'described', 'by', 'such', 'an', 'edge', 'theory', 'at', 'an', 'operational', 'level', 'our', 'criterion', 'takes', 'as', 'input', 'a', 'chiral', 'boson', 'edge', 'theory', 'with', 'mathbbz_2', 'symmetry', 'and', 'then', 'produces', 'as', 'output', 'a', 'prediction', 'as', 'to', 'whether', 'this', 'edge', 'theory', 'can', 'be', 'gapped', 'without', 'breaking', 'the', 'symmetry', 'like', 'previous', 'work', 'much', 'of', 'our', 'derivation', 'involves', 'constructing', 'explicit', 'perturbations', 'that', 'gap', 'chiral', 'boson', 'edge', 'theories', 'interestingly', 'however', 'we', 'find', 'that', 'the', 'standard', 'class', 'of', 'gapping', 'perturbations', 'namely', 'cosine', 'terms', 'constructed', 'from', 'nullvectors', 'is', 'not', 'sufficient', 'to', 'gap', 'some', 'edge', 'theories', 'with', 'mathbbz_2', 'symmetry', 'and', 'thus', 'we', 'are', 'forced', 'to', 'go', 'beyond', 'the', 'usual', 'nullvector', 'analysis', 'to', 'establish', 'our', 'results']] | [-0.15795321285541197, 0.21929351107771225, -0.09725704302475083, 0.056970053155567836, -0.10961206607294804, -0.23607752485144318, 0.038667356558002984, 0.3300497002448096, -0.22377941054292022, -0.2744265962830854, 0.102571018952453, -0.25118091347712007, -0.1777853236914697, 0.07654994267434108, -0.03312904540957375, 0.0769602717267293, -0.0038455969301249946, 0.061511320586908946, -0.11418237086018604, -0.22729671769211013, 0.3064511352839569, -0.017935399078961575, 0.2801132062506495, 0.06140431302853606, 0.010721489153387886, 0.03230703780992013, 0.05162121781684233, 0.004244820243029883, -0.12491227734144283, 0.06768259049523763, 0.2453266553190946, 0.019018035280433568, 0.17412306328699217, -0.4616627760683045, -0.23376719374068533, 0.08481497258568803, 0.15097600296421937, 0.1600684873378751, -0.01940199617255888, -0.3290957244564638, 0.13083031845533036, -0.22473037955633393, -0.145944138907009, -0.11960784803201077, -0.018779230225041056, -0.13886436435436322, -0.2963587940148445, 0.08202835082104712, 0.10824890034555486, 0.07657796073789623, -0.029326411307380167, -0.051300924190912735, -0.11792823905971918, 0.07348738961771949, 0.058604762928602706, 0.03303070450854262, 0.10051200529348782, -0.17030985290241943, -0.17484728908236843, 0.40763435964331485, -0.05672512570621841, -0.2183508730183045, 0.2113382624744466, -0.08367247313091701, -0.1359490860874454, 0.09130184408277273, 0.07756369547410445, 0.06551881013579215, -0.08023621183299727, 0.11791716333532487, -0.07713753483752071, 0.14530015800105917, 0.03336337048729712, 0.08618841729775974, 0.25664845977514755, 0.09090617858578987, 0.13299814331994364, 0.1498614758648204, -0.01766055074615658, -0.1054476005145151, -0.3730062949442954, -0.14930241061092325, -0.19324716037671985, 0.0652219262447695, -0.030253206443475476, -0.18616206239005834, 0.4213260046403968, 0.12720382556029963, 0.18864318443688027, 0.062170634034908176, 0.2362482244064185, 0.17363794147121636, 0.0833299739963629, 0.06586091782559048, 0.1829868786497338, 0.11852566615791257, -0.021848579067172427, -0.19537342071046376, -0.04120125899825132, 0.1441326116889038] |
1,803.00024 | The Progenitor Age and Mass of the Black-Hole-Formation Candidate
N6946-BH1 | The failed supernova N6946-BH1 likely formed a black hole (BH); we age-date
the surrounding population and infer an age and initial mass for the progenitor
of this BH formation candidate. First, we use archival Hubble Space Telescope
imaging to extract broadband photometry of the resolved stellar populations
surrounding this event. Using this photometry, we fit stellar evolution models
to the color-magnitude diagrams to measure the recent star formation history
(SFH). Modeling the photometry requires an accurate distance; therefore, we
measure the tip of the red giant branch (TRGB) and infer a distance modulus of
$29.47 \pm 0.079$ to NGC~6946, or a metric distance of $7.83 \pm 0.29$ Mpc. To
estimate the stellar population's age, we convert the SFH and uncertainties
into a probabilistic distribution for the progenitor's age. The region in the
immediate vicinity of N6946-BH1 exhibits the youngest and most vigorous star
formation for several hundred pc. This suggests that the progenitor is not a
runaway star. From these measurements, we infer an age for the BH progenitor of
$10.6^{+14.5}_{-5.9}$ Myr. Assuming that the progenitor evolved effectively as
a single star, this corresponds to an initial mass of $17.9^{+29.9}_{-7.6}$
$M_{\odot}$. Previous spectral energy distribution (SED) modeling of the
progenitor suggests a mass of $\sim$27 $M_{\odot}$. Formally, the SED-derived
mass falls within our narrowest 68\% confidence interval; however, $91\%$ of
the probability distribtuion function we measure lies below that mass, putting
some tension between the age and the direct-imaging results.
| astro-ph.SR astro-ph.GA | the failed supernova n6946bh1 likely formed a black hole bh we agedate the surrounding population and infer an age and initial mass for the progenitor of this bh formation candidate first we use archival hubble space telescope imaging to extract broadband photometry of the resolved stellar populations surrounding this event using this photometry we fit stellar evolution models to the colormagnitude diagrams to measure the recent star formation history sfh modeling the photometry requires an accurate distance therefore we measure the tip of the red giant branch trgb and infer a distance modulus of 2947 pm 0079 to ngc6946 or a metric distance of 783 pm 029 mpc to estimate the stellar populations age we convert the sfh and uncertainties into a probabilistic distribution for the progenitors age the region in the immediate vicinity of n6946bh1 exhibits the youngest and most vigorous star formation for several hundred pc this suggests that the progenitor is not a runaway star from these measurements we infer an age for the bh progenitor of 106145_59 myr assuming that the progenitor evolved effectively as a single star this corresponds to an initial mass of 179299_76 m_odot previous spectral energy distribution sed modeling of the progenitor suggests a mass of sim27 m_odot formally the sedderived mass falls within our narrowest 68 confidence interval however 91 of the probability distribtuion function we measure lies below that mass putting some tension between the age and the directimaging results | [['the', 'failed', 'supernova', 'n6946bh1', 'likely', 'formed', 'a', 'black', 'hole', 'bh', 'we', 'agedate', 'the', 'surrounding', 'population', 'and', 'infer', 'an', 'age', 'and', 'initial', 'mass', 'for', 'the', 'progenitor', 'of', 'this', 'bh', 'formation', 'candidate', 'first', 'we', 'use', 'archival', 'hubble', 'space', 'telescope', 'imaging', 'to', 'extract', 'broadband', 'photometry', 'of', 'the', 'resolved', 'stellar', 'populations', 'surrounding', 'this', 'event', 'using', 'this', 'photometry', 'we', 'fit', 'stellar', 'evolution', 'models', 'to', 'the', 'colormagnitude', 'diagrams', 'to', 'measure', 'the', 'recent', 'star', 'formation', 'history', 'sfh', 'modeling', 'the', 'photometry', 'requires', 'an', 'accurate', 'distance', 'therefore', 'we', 'measure', 'the', 'tip', 'of', 'the', 'red', 'giant', 'branch', 'trgb', 'and', 'infer', 'a', 'distance', 'modulus', 'of', '2947', 'pm', '0079', 'to', 'ngc6946', 'or', 'a', 'metric', 'distance', 'of', '783', 'pm', '029', 'mpc', 'to', 'estimate', 'the', 'stellar', 'populations', 'age', 'we', 'convert', 'the', 'sfh', 'and', 'uncertainties', 'into', 'a', 'probabilistic', 'distribution', 'for', 'the', 'progenitors', 'age', 'the', 'region', 'in', 'the', 'immediate', 'vicinity', 'of', 'n6946bh1', 'exhibits', 'the', 'youngest', 'and', 'most', 'vigorous', 'star', 'formation', 'for', 'several', 'hundred', 'pc', 'this', 'suggests', 'that', 'the', 'progenitor', 'is', 'not', 'a', 'runaway', 'star', 'from', 'these', 'measurements', 'we', 'infer', 'an', 'age', 'for', 'the', 'bh', 'progenitor', 'of', '106145_59', 'myr', 'assuming', 'that', 'the', 'progenitor', 'evolved', 'effectively', 'as', 'a', 'single', 'star', 'this', 'corresponds', 'to', 'an', 'initial', 'mass', 'of', '179299_76', 'm_odot', 'previous', 'spectral', 'energy', 'distribution', 'sed', 'modeling', 'of', 'the', 'progenitor', 'suggests', 'a', 'mass', 'of', 'sim27', 'm_odot', 'formally', 'the', 'sedderived', 'mass', 'falls', 'within', 'our', 'narrowest', '68', 'confidence', 'interval', 'however', '91', 'of', 'the', 'probability', 'distribtuion', 'function', 'we', 'measure', 'lies', 'below', 'that', 'mass', 'putting', 'some', 'tension', 'between', 'the', 'age', 'and', 'the', 'directimaging', 'results']] | [-0.052721430457533656, 0.0677054819776657, -0.11238579315665577, 0.12771516520835208, -0.12824004428742938, -0.03670693212580092, 0.09650420421585754, 0.4172207724626818, -0.16720161184804522, -0.3648718872905842, 0.05119000358591169, -0.27413694226347346, 0.012722896851996398, 0.1718421876760681, -0.08879557319492701, -0.054640364669803376, 0.12612447951051617, -0.029482789521551683, -0.09182891794595331, -0.2293445815825287, 0.2996229837852053, 0.056874668579783384, 0.13445991206867228, -0.027161124633906894, 0.07996752217633087, -0.09027766520568334, -0.036169833844104986, -0.09146304143910167, -0.23700925122558, 0.03941375555807114, 0.17554625541417423, 0.1902596955657193, 0.23715352290896935, -0.2978665948172389, -0.21634944070995385, 0.07879508883954503, 0.23933830234112546, 0.03160214907758255, -0.08222487064747594, -0.2710924596743885, 0.05783518578098038, -0.23479975563153124, -0.18933131141948098, 0.15036266197121756, 0.07711000339041989, -0.015311108829214886, -0.24597838496546723, 0.18784872917536677, -0.02937710883111513, 0.041252938931354934, -0.1528355250215283, -0.09151127907259687, -0.09827168117924946, 0.12002785365437667, 0.011487078403921, 0.1180358998900076, 0.1703889750628028, -0.11202512602537025, 0.017830047782847046, 0.33851616176925287, -0.06232845856384531, 0.007405293497898686, 0.2078126805038152, -0.20112184482967058, -0.16181114394836002, 0.08661674980285476, 0.1404738418480084, 0.12852475857763246, -0.2209742814468752, -0.02917527743691516, 0.018853741834926253, 0.24666410794152932, 0.042559080073382986, 0.04728955356639584, 0.35652659977825374, 0.17096823739952274, 0.01651075328631765, 0.048748712001579715, -0.26473643167820926, -0.0645390521263422, -0.21554910615008294, -0.10140042861148534, -0.13872864720129854, 0.13718640560827447, -0.20406044866782594, -0.1513244413483121, 0.3326554603810117, 0.14417483986104926, 0.2503988758327993, 0.081651998578156, 0.275579068754964, 0.06770997734822552, 0.11292624026448897, 0.11296413773049585, 0.30878659493684624, 0.20517769235014102, 0.042646615517505704, -0.26125189689542716, 0.08704243219964315, 0.006686629831180477] |
1,803.00025 | On theorems of Brauer-Nesbitt and Brandt for characterizations of small
block algebras | In 1941, Brauer-Nesbitt established a characterization of a block with
trivial defect group as a block $B$ with $k(B) = 1$ where $k(B)$ is the number
of irreducible ordinary characters of $B$. In 1982, Brandt established a
characterization of a block with defect group of order two as a block $B$ with
$k(B) = 2$. These correspond to the cases when the block is Morita equivalent
to the one-dimensional algebra and to the non-semisimple two-dimensional
algebra, respectively.
In this paper, we redefine $k(A)$ to be the codimension of the commutator
subspace $K(A)$ of a finite-dimensional algebra $A$ and prove analogous
statements for arbitrary (not necessarily symmetric) finite-dimensional
algebras. This is achieved by extending the Okuyama refinement of the Brandt
result to this setting. To this end, we study the codimension of the sum of the
commutator subspace $K(A)$ and $n$th Jacobson radical
$\operatorname{Rad}^n(A)$. We prove that this is Morita invariant and give an
upper bound for the codimension as well.
| math.RT math.GR math.RA | in 1941 brauernesbitt established a characterization of a block with trivial defect group as a block b with kb 1 where kb is the number of irreducible ordinary characters of b in 1982 brandt established a characterization of a block with defect group of order two as a block b with kb 2 these correspond to the cases when the block is morita equivalent to the onedimensional algebra and to the nonsemisimple twodimensional algebra respectively in this paper we redefine ka to be the codimension of the commutator subspace ka of a finitedimensional algebra a and prove analogous statements for arbitrary not necessarily symmetric finitedimensional algebras this is achieved by extending the okuyama refinement of the brandt result to this setting to this end we study the codimension of the sum of the commutator subspace ka and nth jacobson radical operatornameradna we prove that this is morita invariant and give an upper bound for the codimension as well | [['in', '1941', 'brauernesbitt', 'established', 'a', 'characterization', 'of', 'a', 'block', 'with', 'trivial', 'defect', 'group', 'as', 'a', 'block', 'b', 'with', 'kb', '1', 'where', 'kb', 'is', 'the', 'number', 'of', 'irreducible', 'ordinary', 'characters', 'of', 'b', 'in', '1982', 'brandt', 'established', 'a', 'characterization', 'of', 'a', 'block', 'with', 'defect', 'group', 'of', 'order', 'two', 'as', 'a', 'block', 'b', 'with', 'kb', '2', 'these', 'correspond', 'to', 'the', 'cases', 'when', 'the', 'block', 'is', 'morita', 'equivalent', 'to', 'the', 'onedimensional', 'algebra', 'and', 'to', 'the', 'nonsemisimple', 'twodimensional', 'algebra', 'respectively', 'in', 'this', 'paper', 'we', 'redefine', 'ka', 'to', 'be', 'the', 'codimension', 'of', 'the', 'commutator', 'subspace', 'ka', 'of', 'a', 'finitedimensional', 'algebra', 'a', 'and', 'prove', 'analogous', 'statements', 'for', 'arbitrary', 'not', 'necessarily', 'symmetric', 'finitedimensional', 'algebras', 'this', 'is', 'achieved', 'by', 'extending', 'the', 'okuyama', 'refinement', 'of', 'the', 'brandt', 'result', 'to', 'this', 'setting', 'to', 'this', 'end', 'we', 'study', 'the', 'codimension', 'of', 'the', 'sum', 'of', 'the', 'commutator', 'subspace', 'ka', 'and', 'nth', 'jacobson', 'radical', 'operatornameradna', 'we', 'prove', 'that', 'this', 'is', 'morita', 'invariant', 'and', 'give', 'an', 'upper', 'bound', 'for', 'the', 'codimension', 'as', 'well']] | [-0.15516347002882797, 0.0562681612340011, -0.024035914445845172, 0.007353170365184689, -0.04712736223173591, -0.16073730477513984, 0.004915750413112199, 0.3169392153011778, -0.32780498412187, -0.1949178706526231, 0.1460617859079204, -0.2279062862507999, -0.10931120292008974, 0.1378101769428796, -0.11182381127340098, -0.02684235136406735, 0.029852160682471898, 0.13002567815904817, -0.09710828957404607, -0.2745259816113573, 0.35555763204152196, 0.023783791319240268, 0.21237075965230665, 0.020854784975735806, 0.0789393947716468, 0.017755830944038164, -0.026320565838175707, 0.01479562231607372, -0.1475868092640247, 0.14543319971730503, 0.324426249266626, 0.07820680850627235, 0.23628879589243576, -0.34117014654792654, -0.112878440034528, 0.15575782970905167, 0.16398020267474633, 0.07584520150871518, 0.012086967001101958, -0.25876968695770186, 0.15087350531636426, -0.2277354207009268, -0.12865072944595551, -0.02335311833004921, 0.08216164785867128, -0.027110317866735827, -0.2808876290577106, 0.03665216508894586, 0.18312493868796034, 0.10786362334870202, -0.05742127867863299, -0.10000891680530725, -0.02003484736614598, 0.06446716592304605, -0.009289174824236678, 0.04876937530113933, 0.08028611140803267, -0.05095025518974767, -0.16272123775277764, 0.36024113740019786, -0.050907178851328075, -0.18526163915745342, 0.15474161326897162, -0.14815131492009526, -0.14529765077914375, 0.08712107088649645, 0.061432664413960315, 0.12277569414940305, -0.07208394198217623, 0.16600158972552237, -0.14458136461699048, 0.08513981274695535, 0.08871534947329798, -0.005395115565102643, 0.11323691436794037, 0.10110638218257242, 0.08295364030980124, 0.13338578318600924, 0.029917728275251694, 0.008019636338688612, -0.3387924121358456, -0.2525727834290592, -0.15386552547510618, 0.14103494526212812, -0.07850420577056073, -0.17190429305665952, 0.3995399503395535, 0.10008988099602553, 0.20725588593930483, 0.11498916842258321, 0.19486954376005974, 0.08086005757780722, 0.08154260208613824, 0.09115651155260797, 0.15725918457610533, 0.25252443097848204, -0.018309840145938765, -0.15078276201175192, -0.037824957756898724, 0.2154575867148546] |
1,803.00026 | Efficient variational simulation of non-trivial quantum states | We provide an efficient and general route for preparing non-trivial quantum
states that are not adiabatically connected to unentangled product states. Our
approach is a hybrid quantum-classical variational protocol that incorporates a
feedback loop between a quantum simulator and a classical computer, and is
experimentally realizable on near-term quantum devices of synthetic quantum
systems. We find explicit protocols which prepare with perfect fidelities (i)
the Greenberger-Horne-Zeilinger (GHZ) state, (ii) a quantum critical state, and
(iii) a topologically ordered state, with $L$ variational parameters and
physical runtimes $T$ that scale linearly with the system size $L$. We
furthermore conjecture and support numerically that our protocol can prepare,
with perfect fidelity and similar operational costs, the ground state of every
point in the one dimensional transverse field Ising model phase diagram.
Besides being practically useful, our results also illustrate the utility of
such variational ans\"atze as good descriptions of non-trivial states of
matter.
| cond-mat.str-el quant-ph | we provide an efficient and general route for preparing nontrivial quantum states that are not adiabatically connected to unentangled product states our approach is a hybrid quantumclassical variational protocol that incorporates a feedback loop between a quantum simulator and a classical computer and is experimentally realizable on nearterm quantum devices of synthetic quantum systems we find explicit protocols which prepare with perfect fidelities i the greenbergerhornezeilinger ghz state ii a quantum critical state and iii a topologically ordered state with l variational parameters and physical runtimes t that scale linearly with the system size l we furthermore conjecture and support numerically that our protocol can prepare with perfect fidelity and similar operational costs the ground state of every point in the one dimensional transverse field ising model phase diagram besides being practically useful our results also illustrate the utility of such variational ansatze as good descriptions of nontrivial states of matter | [['we', 'provide', 'an', 'efficient', 'and', 'general', 'route', 'for', 'preparing', 'nontrivial', 'quantum', 'states', 'that', 'are', 'not', 'adiabatically', 'connected', 'to', 'unentangled', 'product', 'states', 'our', 'approach', 'is', 'a', 'hybrid', 'quantumclassical', 'variational', 'protocol', 'that', 'incorporates', 'a', 'feedback', 'loop', 'between', 'a', 'quantum', 'simulator', 'and', 'a', 'classical', 'computer', 'and', 'is', 'experimentally', 'realizable', 'on', 'nearterm', 'quantum', 'devices', 'of', 'synthetic', 'quantum', 'systems', 'we', 'find', 'explicit', 'protocols', 'which', 'prepare', 'with', 'perfect', 'fidelities', 'i', 'the', 'greenbergerhornezeilinger', 'ghz', 'state', 'ii', 'a', 'quantum', 'critical', 'state', 'and', 'iii', 'a', 'topologically', 'ordered', 'state', 'with', 'l', 'variational', 'parameters', 'and', 'physical', 'runtimes', 't', 'that', 'scale', 'linearly', 'with', 'the', 'system', 'size', 'l', 'we', 'furthermore', 'conjecture', 'and', 'support', 'numerically', 'that', 'our', 'protocol', 'can', 'prepare', 'with', 'perfect', 'fidelity', 'and', 'similar', 'operational', 'costs', 'the', 'ground', 'state', 'of', 'every', 'point', 'in', 'the', 'one', 'dimensional', 'transverse', 'field', 'ising', 'model', 'phase', 'diagram', 'besides', 'being', 'practically', 'useful', 'our', 'results', 'also', 'illustrate', 'the', 'utility', 'of', 'such', 'variational', 'ansatze', 'as', 'good', 'descriptions', 'of', 'nontrivial', 'states', 'of', 'matter']] | [-0.14904239987769466, 0.20071993303719973, -0.08594310213349118, 0.03820543436565597, -0.02399081364910069, -0.25758644269427766, 0.09472903161963435, 0.3946770654362164, -0.23047852370616617, -0.2818495852669195, 0.055098330185730134, -0.2311010744734143, -0.12665546206227005, 0.22393971976719254, -0.009935183148362383, 0.12030157047040169, 0.09913903636401457, 0.021255730811293724, -0.0713245280253522, -0.2550011596963155, 0.30236208692828304, 0.004911009404987146, 0.30813694858787866, 0.03374258995315196, 0.10532980350567805, -0.0231025486703444, 0.11319137322647028, 0.022947865255355884, -0.12835977617084568, 0.08542327203561201, 0.27996740204633663, 0.11599791184721502, 0.22158691187123983, -0.4055920176179879, -0.19214654540402556, 0.07933195173394995, 0.08774130144742447, 0.19496832049948268, -0.03692817231964024, -0.329677057654492, 0.043049320874624694, -0.21265227477442447, -0.13018025867538818, -0.14909114433908896, -0.0011476381760497658, -0.03684854308560879, -0.26245840575811236, 0.061113493543061184, 0.03728606454089025, 0.018829900281047387, -0.026501783679894, -0.07643817994429034, -0.03287580599221987, 0.11516956999490889, -0.11004741655258672, 0.03664085451692392, 0.09476714800320109, -0.137946077780376, -0.21482705889541087, 0.3292061612996834, -0.013298512209786584, -0.1876249211834164, 0.205395990197812, -0.05322359640163598, -0.1050955429118102, 0.06639918839460277, 0.10369036039059969, 0.1083425843181545, -0.079951606252977, 0.0784106901110557, -0.034069091238895594, 0.21455352081603446, -0.02116206738888132, 0.10446049855745995, 0.1944318889325719, 0.11542068695840703, 0.0905831370037049, 0.1913800114936917, -0.03236654109247522, -0.19526997387766937, -0.3272035885540559, -0.22599386269942123, -0.23171706479782891, 0.10238979122339707, -0.07603267774223223, -0.16196868994692648, 0.3889891490192208, 0.15324737182093648, 0.15217894704014814, 0.0419281180416055, 0.31113641768299194, 0.08673149992793563, -0.002446518827766328, 0.12845713628798303, 0.19375820628472215, 0.14092602195921322, 0.05604991628109965, -0.22495078478804142, 0.03194572113219969, 0.011001014724275135] |
1,803.00027 | Dependence of the Quantum Speed Limit on System Size and Control
Complexity | We extend the work in New J. Phys. 19, 103015 (2017) by deriving a lower
bound for the minimum time necessary to implement a unitary transformation on a
generic, closed quantum system with an arbitrary number of classical control
fields. This bound is explicitly analyzed for a specific N-level system similar
to those used to represent simple models of an atom, or the first excitation
sector of a Heisenberg spin chain, both of which are of interest in quantum
control for quantum computation. Specifically, it is shown that the resultant
bound depends on the dimension of the system, and on the number of controls
used to implement a specific target unitary operation. The value of the bound
determined numerically, and an estimate of the true minimum gate time are
systematically compared for a range of system dimension and number of controls;
special attention is drawn to the relationship between these two variables. It
is seen that the bound captures the scaling of the minimum time well for the
systems studied, and quantitatively is correct in the order of magnitude.
| quant-ph math-ph math.MP | we extend the work in new j phys 19 103015 2017 by deriving a lower bound for the minimum time necessary to implement a unitary transformation on a generic closed quantum system with an arbitrary number of classical control fields this bound is explicitly analyzed for a specific nlevel system similar to those used to represent simple models of an atom or the first excitation sector of a heisenberg spin chain both of which are of interest in quantum control for quantum computation specifically it is shown that the resultant bound depends on the dimension of the system and on the number of controls used to implement a specific target unitary operation the value of the bound determined numerically and an estimate of the true minimum gate time are systematically compared for a range of system dimension and number of controls special attention is drawn to the relationship between these two variables it is seen that the bound captures the scaling of the minimum time well for the systems studied and quantitatively is correct in the order of magnitude | [['we', 'extend', 'the', 'work', 'in', 'new', 'j', 'phys', '19', '103015', '2017', 'by', 'deriving', 'a', 'lower', 'bound', 'for', 'the', 'minimum', 'time', 'necessary', 'to', 'implement', 'a', 'unitary', 'transformation', 'on', 'a', 'generic', 'closed', 'quantum', 'system', 'with', 'an', 'arbitrary', 'number', 'of', 'classical', 'control', 'fields', 'this', 'bound', 'is', 'explicitly', 'analyzed', 'for', 'a', 'specific', 'nlevel', 'system', 'similar', 'to', 'those', 'used', 'to', 'represent', 'simple', 'models', 'of', 'an', 'atom', 'or', 'the', 'first', 'excitation', 'sector', 'of', 'a', 'heisenberg', 'spin', 'chain', 'both', 'of', 'which', 'are', 'of', 'interest', 'in', 'quantum', 'control', 'for', 'quantum', 'computation', 'specifically', 'it', 'is', 'shown', 'that', 'the', 'resultant', 'bound', 'depends', 'on', 'the', 'dimension', 'of', 'the', 'system', 'and', 'on', 'the', 'number', 'of', 'controls', 'used', 'to', 'implement', 'a', 'specific', 'target', 'unitary', 'operation', 'the', 'value', 'of', 'the', 'bound', 'determined', 'numerically', 'and', 'an', 'estimate', 'of', 'the', 'true', 'minimum', 'gate', 'time', 'are', 'systematically', 'compared', 'for', 'a', 'range', 'of', 'system', 'dimension', 'and', 'number', 'of', 'controls', 'special', 'attention', 'is', 'drawn', 'to', 'the', 'relationship', 'between', 'these', 'two', 'variables', 'it', 'is', 'seen', 'that', 'the', 'bound', 'captures', 'the', 'scaling', 'of', 'the', 'minimum', 'time', 'well', 'for', 'the', 'systems', 'studied', 'and', 'quantitatively', 'is', 'correct', 'in', 'the', 'order', 'of', 'magnitude']] | [-0.1357658922435517, 0.13358789328523332, -0.05318108797230329, 0.048218362812957404, -0.025840530962044937, -0.14548090951820689, 0.06589928777427988, 0.31693647913974865, -0.23005712665146572, -0.3407626323025213, 0.08954550655757527, -0.2264545642250228, -0.1321106169512103, 0.2420263986111085, -0.04634782406903693, 0.0842457131948322, -0.0018759430595412013, 0.10041791743996521, -0.06824371403114599, -0.27320429072532215, 0.29954539823314447, 0.04962699909058787, 0.27795270826681284, 0.03495112805773787, 0.10456857774171224, 0.025831169619491806, 0.01509035944813088, -0.002871064142208923, -0.1397565131189643, 0.1252642225289686, 0.2033563269556049, 0.10479235176645806, 0.2316805412364977, -0.4004417246709881, -0.17754092566103916, 0.10603089716999656, 0.11448395225936232, 0.1340498534793798, -0.009987814756753866, -0.25519210647979984, 0.07725880150630902, -0.1723795706168173, -0.1262801912471945, -0.0702756388646582, 0.06443866929522925, -0.006354515419833446, -0.28332092692837474, 0.042551389397078636, 0.07519326559817313, 0.03734957078063672, -0.05166710355761199, -0.08180059100961669, -0.004234543882488283, 0.15431457924724587, -0.010426075125814237, 0.03896074329523809, 0.09206929888440234, -0.12616577375748225, -0.10196148025053763, 0.35903596646267544, -0.046121834754404935, -0.19773603109639593, 0.191647816527886, -0.11533683436409978, -0.10097044962850724, 0.08743588652349275, 0.17907360710433862, 0.1350421241610154, -0.15728307682811543, 0.09216528956574294, -0.05506604448061572, 0.1812892426956403, 0.03394421079167259, 0.04797051317356736, 0.14569191150681188, 0.14341542485243317, 0.10258952600965171, 0.16007054750179725, -0.06530372071304892, -0.13925490929650958, -0.30505906597297805, -0.17140903998345525, -0.2345854962673666, 0.030036431781717398, -0.06501704101480826, -0.13436401561160932, 0.4085788777977061, 0.13958131217462355, 0.21182936074714478, 0.054540904968050884, 0.24851586546204732, 0.18574118820866675, 0.04676981887968487, 0.08121736089991971, 0.23233902228870587, 0.16181658917980457, 0.026809897171752004, -0.2531446185449578, 0.05854031335290396, 0.060231255215338925] |
1,803.00028 | Magnetically regulated collapse in the B335 protostar ? I. ALMA
observations of the polarized dust emission | The role of the magnetic field during protostellar collapse is poorly
constrained from an observational point of view, although it could be
significant if we believe state-of-the-art models of protostellar formation. We
present polarimetric observations of the 233 GHz thermal dust continuum
emission obtained with ALMA in the B335 Class 0 protostar. Linearly polarized
dust emission arising from the circumstellar material in the envelope of B335
is detected at all scales probed by our observations, from radii of 50 to 1000
au. The magnetic field structure producing the dust polarization has a very
ordered topology in the inner envelope, with a transition from a large-scale
poloidal magnetic field, in the outflow direction, to strongly pinched in the
equatorial direction. This is probably due to magnetic field lines being
dragged along the dominating infall direction since B335 does not exhibit
prominent rotation. Our data and their qualitative comparison to a family of
magnetized protostellar collapse models show that, during the magnetized
collapse in B335, the magnetic field is maintaining a high level of
organization from scales 1000 au to 50 au: this suggests the field is
dynamically relevant and capable of influencing the typical outcome of
protostellar collapse, such as regulating the disk size in B335.
| astro-ph.GA astro-ph.SR | the role of the magnetic field during protostellar collapse is poorly constrained from an observational point of view although it could be significant if we believe stateoftheart models of protostellar formation we present polarimetric observations of the 233 ghz thermal dust continuum emission obtained with alma in the b335 class 0 protostar linearly polarized dust emission arising from the circumstellar material in the envelope of b335 is detected at all scales probed by our observations from radii of 50 to 1000 au the magnetic field structure producing the dust polarization has a very ordered topology in the inner envelope with a transition from a largescale poloidal magnetic field in the outflow direction to strongly pinched in the equatorial direction this is probably due to magnetic field lines being dragged along the dominating infall direction since b335 does not exhibit prominent rotation our data and their qualitative comparison to a family of magnetized protostellar collapse models show that during the magnetized collapse in b335 the magnetic field is maintaining a high level of organization from scales 1000 au to 50 au this suggests the field is dynamically relevant and capable of influencing the typical outcome of protostellar collapse such as regulating the disk size in b335 | [['the', 'role', 'of', 'the', 'magnetic', 'field', 'during', 'protostellar', 'collapse', 'is', 'poorly', 'constrained', 'from', 'an', 'observational', 'point', 'of', 'view', 'although', 'it', 'could', 'be', 'significant', 'if', 'we', 'believe', 'stateoftheart', 'models', 'of', 'protostellar', 'formation', 'we', 'present', 'polarimetric', 'observations', 'of', 'the', '233', 'ghz', 'thermal', 'dust', 'continuum', 'emission', 'obtained', 'with', 'alma', 'in', 'the', 'b335', 'class', '0', 'protostar', 'linearly', 'polarized', 'dust', 'emission', 'arising', 'from', 'the', 'circumstellar', 'material', 'in', 'the', 'envelope', 'of', 'b335', 'is', 'detected', 'at', 'all', 'scales', 'probed', 'by', 'our', 'observations', 'from', 'radii', 'of', '50', 'to', '1000', 'au', 'the', 'magnetic', 'field', 'structure', 'producing', 'the', 'dust', 'polarization', 'has', 'a', 'very', 'ordered', 'topology', 'in', 'the', 'inner', 'envelope', 'with', 'a', 'transition', 'from', 'a', 'largescale', 'poloidal', 'magnetic', 'field', 'in', 'the', 'outflow', 'direction', 'to', 'strongly', 'pinched', 'in', 'the', 'equatorial', 'direction', 'this', 'is', 'probably', 'due', 'to', 'magnetic', 'field', 'lines', 'being', 'dragged', 'along', 'the', 'dominating', 'infall', 'direction', 'since', 'b335', 'does', 'not', 'exhibit', 'prominent', 'rotation', 'our', 'data', 'and', 'their', 'qualitative', 'comparison', 'to', 'a', 'family', 'of', 'magnetized', 'protostellar', 'collapse', 'models', 'show', 'that', 'during', 'the', 'magnetized', 'collapse', 'in', 'b335', 'the', 'magnetic', 'field', 'is', 'maintaining', 'a', 'high', 'level', 'of', 'organization', 'from', 'scales', '1000', 'au', 'to', '50', 'au', 'this', 'suggests', 'the', 'field', 'is', 'dynamically', 'relevant', 'and', 'capable', 'of', 'influencing', 'the', 'typical', 'outcome', 'of', 'protostellar', 'collapse', 'such', 'as', 'regulating', 'the', 'disk', 'size', 'in', 'b335']] | [-0.12981941723832632, 0.1579853455576529, -0.020782774982110758, 0.025658500945570355, -0.0848470225203328, -0.04291515629511417, -0.038838652324317616, 0.4312035209158572, -0.24726172527710044, -0.3225453533254927, 0.07026495176833122, -0.20720114357309508, -0.021818643944655977, 0.15505424603456405, 0.01733028756727169, -0.05529973477170598, 0.060980911138921796, -0.07246265893620325, -0.03274180638921879, -0.17412966499672974, 0.3302573120971097, 0.10177163326226901, 0.15825856100887106, 0.025628468462425034, 0.04850563915821201, -0.14742164385431197, -0.007814012041099641, 0.019756136294000033, -0.11698896435594112, 0.03836089038040216, 0.22748565031148113, 0.0972744487430446, 0.2304600272670164, -0.407738762708926, -0.2270498843261654, 0.019729994858683247, 0.1686929892476012, 0.08777708897094537, -0.0396250498867253, -0.2542031921684833, 0.07971243035650198, -0.14577814968268774, -0.18193695648550623, 0.04737069131806493, 0.06090440745351881, 0.008843717154785536, -0.25105982506562524, 0.10652212257207394, 0.06951324894865293, 0.1077712015027362, -0.12689969886503205, -0.09087211537379317, -0.09965463238881855, 0.046451755127551536, 0.06576510102419955, 0.15184480283713173, 0.2506704395364334, -0.15494079568150748, -0.04237901410031155, 0.3981164620868385, -0.09455527326648647, -0.05004911831148514, 0.21839462581385927, -0.2612219179336268, -0.16104086788098623, 0.24880347552641136, 0.1448115652989278, 0.15469577563472273, -0.0800560873345381, 0.003930662836447904, -0.025848752314724572, 0.20756338685254067, 0.05397742381546555, 0.026723279705180264, 0.37785400278502845, 0.14830256338094974, 0.019036386298333725, 0.16450840747750523, -0.2198244450318559, -0.10415317919786747, -0.24190431210416846, -0.10886228631091555, -0.15629862228964977, 0.12123854428582269, -0.13501334075529198, -0.13970035428590163, 0.3363914771596106, 0.16053644322276275, 0.2081642684322305, -0.005068001194456706, 0.29943749247482276, 0.04074865635086941, 0.12534289729736017, 0.16425023627603744, 0.32179980259161534, 0.19094423341746555, 0.14520060507716928, -0.23207777547763614, 0.0955133491503813, -0.053202353860819486] |
1,803.00029 | The radius of the quiescent neutron star in the globular cluster M13 | X-ray spectra of quiescent low-mass X-ray binaries containing neutron stars
can be fit with atmosphere models to constrain the mass and the radius.
Mass-radius constraints can be used to place limits on the equation of state of
dense matter. We perform fits to the X-ray spectrum of a quiescent neutron star
in the globular cluster M13, utilizing data from ROSAT, Chandra and XMM-Newton,
and constrain the mass-radius relation. Assuming an atmosphere composed of
hydrogen and a 1.4${\rm M}_{\odot}$ neutron star, we find the radius to be
$R_{\rm NS}=12.2^{+1.5}_{-1.1}$ km, a significant improvement in precision over
previous measurements. Incorporating an uncertainty on the distance to M13
relaxes the radius constraints slightly and we find $R_{\rm
NS}=12.3^{+1.9}_{-1.7}$ km (for a 1.4${\rm M}_{\odot}$ neutron star with a
hydrogen atmosphere), which is still an improvement in precision over previous
measurements, some of which do not consider distance uncertainty. We also
discuss how the composition of the atmosphere affects the derived radius,
finding that a helium atmosphere implies a significantly larger radius.
| astro-ph.HE | xray spectra of quiescent lowmass xray binaries containing neutron stars can be fit with atmosphere models to constrain the mass and the radius massradius constraints can be used to place limits on the equation of state of dense matter we perform fits to the xray spectrum of a quiescent neutron star in the globular cluster m13 utilizing data from rosat chandra and xmmnewton and constrain the massradius relation assuming an atmosphere composed of hydrogen and a 14rm m_odot neutron star we find the radius to be r_rm ns12215_11 km a significant improvement in precision over previous measurements incorporating an uncertainty on the distance to m13 relaxes the radius constraints slightly and we find r_rm ns12319_17 km for a 14rm m_odot neutron star with a hydrogen atmosphere which is still an improvement in precision over previous measurements some of which do not consider distance uncertainty we also discuss how the composition of the atmosphere affects the derived radius finding that a helium atmosphere implies a significantly larger radius | [['xray', 'spectra', 'of', 'quiescent', 'lowmass', 'xray', 'binaries', 'containing', 'neutron', 'stars', 'can', 'be', 'fit', 'with', 'atmosphere', 'models', 'to', 'constrain', 'the', 'mass', 'and', 'the', 'radius', 'massradius', 'constraints', 'can', 'be', 'used', 'to', 'place', 'limits', 'on', 'the', 'equation', 'of', 'state', 'of', 'dense', 'matter', 'we', 'perform', 'fits', 'to', 'the', 'xray', 'spectrum', 'of', 'a', 'quiescent', 'neutron', 'star', 'in', 'the', 'globular', 'cluster', 'm13', 'utilizing', 'data', 'from', 'rosat', 'chandra', 'and', 'xmmnewton', 'and', 'constrain', 'the', 'massradius', 'relation', 'assuming', 'an', 'atmosphere', 'composed', 'of', 'hydrogen', 'and', 'a', '14rm', 'm_odot', 'neutron', 'star', 'we', 'find', 'the', 'radius', 'to', 'be', 'r_rm', 'ns12215_11', 'km', 'a', 'significant', 'improvement', 'in', 'precision', 'over', 'previous', 'measurements', 'incorporating', 'an', 'uncertainty', 'on', 'the', 'distance', 'to', 'm13', 'relaxes', 'the', 'radius', 'constraints', 'slightly', 'and', 'we', 'find', 'r_rm', 'ns12319_17', 'km', 'for', 'a', '14rm', 'm_odot', 'neutron', 'star', 'with', 'a', 'hydrogen', 'atmosphere', 'which', 'is', 'still', 'an', 'improvement', 'in', 'precision', 'over', 'previous', 'measurements', 'some', 'of', 'which', 'do', 'not', 'consider', 'distance', 'uncertainty', 'we', 'also', 'discuss', 'how', 'the', 'composition', 'of', 'the', 'atmosphere', 'affects', 'the', 'derived', 'radius', 'finding', 'that', 'a', 'helium', 'atmosphere', 'implies', 'a', 'significantly', 'larger', 'radius']] | [-0.054451095676896245, 0.13390832374844291, -0.09057411723064654, 0.09598789817131491, -0.11216434582531679, -0.03361061081346689, 0.09389680368317799, 0.38043571713690955, -0.16694898696785623, -0.3834168493183273, 0.05168735445406514, -0.3263555233733672, 0.058262911303476855, 0.23776144686253797, -0.048957288157985064, -0.02497022706436727, 0.13778577370315112, 0.025962476200903906, -0.14100204782250028, -0.2444352492210314, 0.28208430533607803, 0.09214379629966887, 0.1291941111060706, 0.024325217707364847, 0.020299193760464816, -0.07090207831651875, -0.010686242061130929, -0.009035445320786852, -0.2243597412723995, 0.03919853251039361, 0.1950975299568778, 0.16037108131656141, 0.1252551649443128, -0.37881255345136833, -0.25513435627587816, 0.08047823722643609, 0.1806677571582523, -0.004026800130183498, -0.015372756779701872, -0.24657561729916116, 0.058609145135040196, -0.2550501810316222, -0.16938912799638328, 0.040021154645717504, 0.03805209585098606, 0.014943168607229988, -0.260396151775212, 0.13213865567954736, 0.023006441772943646, 0.017262823179815756, -0.15605091959181608, -0.1316021161577241, -0.021923423264965866, 0.04792607987694668, 0.009447502399173876, 0.07364135913437966, 0.18254257976783045, -0.11393683564030763, 0.013670182297232025, 0.3871473003969048, -0.10288067638986942, -0.01480866815669067, 0.15648509864413152, -0.1875907633284276, -0.1891880314514944, 0.10575933301482689, 0.16098054681311955, 0.11051372800756133, -0.1735297215763818, 0.009520071946352607, -0.04747552161570638, 0.31711558652759503, 0.08546945089192101, 0.033902538412561016, 0.35501926560695707, 0.17997741682497276, 0.044567344348990554, 0.062245746998991255, -0.24825989051975988, -0.02466382539520661, -0.1949877064900868, -0.0775935514237393, -0.08456079198442626, 0.0841671523794172, -0.14774623263837192, -0.11540718722072514, 0.2668130783618174, 0.09663617479417361, 0.22296677818804075, 0.046732378504097914, 0.3164900782433423, 0.09911371217617257, 0.07579119280545098, 0.13483484320229652, 0.342872244208014, 0.23702324005690487, 0.06475981360894036, -0.2671341524656975, 0.056052759219186774, -0.012155701674408081] |
1,803.0003 | Geometric quench and nonequilibrium dynamics of fractional quantum Hall
states | We introduce a quench of the geometry of Landau level orbitals as a probe of
nonequilibrium dynamics of fractional quantum Hall (FQH) states. We show that
such geometric quenches induce coherent many-body dynamics of neutral degrees
of freedom of FQH fluids. The simplest case of mass anisotropy quench can be
experimentally implemented as a sudden tilt of the magnetic field, and the
resulting dynamics reduces to the harmonic motion of the spin-$2$ "graviton"
mode, i.e., the long wavelength limit of the Girvin-MacDonald-Platzman
magnetoroton. We derive an analytical description of the graviton dynamics
using the bimetric theory of FQH states, and find agreement with exact
numerical simulations at short times. We show that certain types of geometric
quenches excite higher-spin collective modes, thus establishing their existence
in a microscopic model and motivating an extension of geometric theories of FQH
states.
| cond-mat.str-el quant-ph | we introduce a quench of the geometry of landau level orbitals as a probe of nonequilibrium dynamics of fractional quantum hall fqh states we show that such geometric quenches induce coherent manybody dynamics of neutral degrees of freedom of fqh fluids the simplest case of mass anisotropy quench can be experimentally implemented as a sudden tilt of the magnetic field and the resulting dynamics reduces to the harmonic motion of the spin2 graviton mode ie the long wavelength limit of the girvinmacdonaldplatzman magnetoroton we derive an analytical description of the graviton dynamics using the bimetric theory of fqh states and find agreement with exact numerical simulations at short times we show that certain types of geometric quenches excite higherspin collective modes thus establishing their existence in a microscopic model and motivating an extension of geometric theories of fqh states | [['we', 'introduce', 'a', 'quench', 'of', 'the', 'geometry', 'of', 'landau', 'level', 'orbitals', 'as', 'a', 'probe', 'of', 'nonequilibrium', 'dynamics', 'of', 'fractional', 'quantum', 'hall', 'fqh', 'states', 'we', 'show', 'that', 'such', 'geometric', 'quenches', 'induce', 'coherent', 'manybody', 'dynamics', 'of', 'neutral', 'degrees', 'of', 'freedom', 'of', 'fqh', 'fluids', 'the', 'simplest', 'case', 'of', 'mass', 'anisotropy', 'quench', 'can', 'be', 'experimentally', 'implemented', 'as', 'a', 'sudden', 'tilt', 'of', 'the', 'magnetic', 'field', 'and', 'the', 'resulting', 'dynamics', 'reduces', 'to', 'the', 'harmonic', 'motion', 'of', 'the', 'spin2', 'graviton', 'mode', 'ie', 'the', 'long', 'wavelength', 'limit', 'of', 'the', 'girvinmacdonaldplatzman', 'magnetoroton', 'we', 'derive', 'an', 'analytical', 'description', 'of', 'the', 'graviton', 'dynamics', 'using', 'the', 'bimetric', 'theory', 'of', 'fqh', 'states', 'and', 'find', 'agreement', 'with', 'exact', 'numerical', 'simulations', 'at', 'short', 'times', 'we', 'show', 'that', 'certain', 'types', 'of', 'geometric', 'quenches', 'excite', 'higherspin', 'collective', 'modes', 'thus', 'establishing', 'their', 'existence', 'in', 'a', 'microscopic', 'model', 'and', 'motivating', 'an', 'extension', 'of', 'geometric', 'theories', 'of', 'fqh', 'states']] | [-0.20077146101314172, 0.22933253665180817, -0.11760584852262902, 0.0673370411947852, 0.0002821883682509978, -0.12898173093420567, 0.004077086964682441, 0.27191364526641454, -0.23719841485219947, -0.2763664334905233, -0.0020951731373361655, -0.21509702184418444, -0.1524039014215789, 0.14416605647881148, 0.02788775107277249, 0.028408302000904682, 0.022574533259482693, -0.009361246543795727, -0.06885308479465604, -0.18477562123829191, 0.28225522907115785, 0.02390129717063534, 0.2474689333424937, 0.037920425340312154, 0.107751092391102, 0.03157539501210018, 0.0802158986606883, 0.008803514736912233, -0.19182649911634655, 0.0544360125133359, 0.22653047940626794, -0.011651143160306935, 0.21404162302559657, -0.4754354145860286, -0.20255108115182882, 0.040954807253969876, 0.15982617484594078, 0.2246926702180435, 0.0023693552562337127, -0.31551088621712575, -0.0248024479063938, -0.18369239876750293, -0.19587612227308931, -0.14004136580746057, 0.009689098301933234, -0.03740997405106322, -0.2309383139878565, 0.15935022246658723, 0.05156291488611655, 0.08094452766001412, -0.07107635868860664, -0.05078675137604955, -0.08225046171766552, 0.09449850939961298, 0.0459371901396997, 0.0043983730387441786, 0.17395584110385007, -0.2225950715473766, -0.18992048646691892, 0.37226729115417645, -0.07024817582782653, -0.1845482583392224, 0.199046994402013, -0.1747811699400006, -0.10520338128059567, 0.12224664307608128, 0.12486706509944989, 0.10701958874990936, -0.08452169714066729, 0.10773254811082023, -0.06286953090482371, 0.1579698757703999, 0.06351319751400741, 0.13321766000622742, 0.2845053237949987, 0.1425838106455911, 0.03971780295879077, 0.1738918309171999, -0.08690749092710962, -0.1407069874505082, -0.34947908456309984, -0.14975872045138303, -0.18818472201241643, 0.1203372100109139, -0.07717325191297016, -0.1981452463766126, 0.4376489732200079, 0.1283257426635409, 0.1400732455956046, 0.04237723851864555, 0.2071291025553783, 0.16226207729422307, -0.004072328830948569, 0.04131935296995606, 0.2607203756539459, 0.18742933896832542, 0.04259598553984714, -0.3352791725811984, -0.06938157285556948, 0.07854468713467605] |
1,803.00031 | A Feature Clustering Approach Based on Histogram of Oriented Optical
Flow and Superpixels | Visual feature clustering is one of the cost-effective approaches to segment
objects in videos. However, the assumptions made for developing the existing
algorithms prevent them from being used in situations like segmenting an
unknown number of static and moving objects under heavy camera movements. This
paper addresses the problem by introducing a clustering approach based on
superpixels and short-term Histogram of Oriented Optical Flow (HOOF). Salient
Dither Pattern Feature (SDPF) is used as the visual feature to track the flow
and Simple Linear Iterative Clustering (SLIC) is used for obtaining the
superpixels. This new clustering approach is based on merging superpixels by
comparing short term local HOOF and a color cue to form high-level semantic
segments. The new approach was compared with one of the latest feature
clustering approaches based on K-Means in eight-dimensional space and the
results revealed that the new approach is better by means of consistency,
completeness, and spatial accuracy. Further, the new approach completely solved
the problem of not knowing the number of objects in a scene.
| cs.CV | visual feature clustering is one of the costeffective approaches to segment objects in videos however the assumptions made for developing the existing algorithms prevent them from being used in situations like segmenting an unknown number of static and moving objects under heavy camera movements this paper addresses the problem by introducing a clustering approach based on superpixels and shortterm histogram of oriented optical flow hoof salient dither pattern feature sdpf is used as the visual feature to track the flow and simple linear iterative clustering slic is used for obtaining the superpixels this new clustering approach is based on merging superpixels by comparing short term local hoof and a color cue to form highlevel semantic segments the new approach was compared with one of the latest feature clustering approaches based on kmeans in eightdimensional space and the results revealed that the new approach is better by means of consistency completeness and spatial accuracy further the new approach completely solved the problem of not knowing the number of objects in a scene | [['visual', 'feature', 'clustering', 'is', 'one', 'of', 'the', 'costeffective', 'approaches', 'to', 'segment', 'objects', 'in', 'videos', 'however', 'the', 'assumptions', 'made', 'for', 'developing', 'the', 'existing', 'algorithms', 'prevent', 'them', 'from', 'being', 'used', 'in', 'situations', 'like', 'segmenting', 'an', 'unknown', 'number', 'of', 'static', 'and', 'moving', 'objects', 'under', 'heavy', 'camera', 'movements', 'this', 'paper', 'addresses', 'the', 'problem', 'by', 'introducing', 'a', 'clustering', 'approach', 'based', 'on', 'superpixels', 'and', 'shortterm', 'histogram', 'of', 'oriented', 'optical', 'flow', 'hoof', 'salient', 'dither', 'pattern', 'feature', 'sdpf', 'is', 'used', 'as', 'the', 'visual', 'feature', 'to', 'track', 'the', 'flow', 'and', 'simple', 'linear', 'iterative', 'clustering', 'slic', 'is', 'used', 'for', 'obtaining', 'the', 'superpixels', 'this', 'new', 'clustering', 'approach', 'is', 'based', 'on', 'merging', 'superpixels', 'by', 'comparing', 'short', 'term', 'local', 'hoof', 'and', 'a', 'color', 'cue', 'to', 'form', 'highlevel', 'semantic', 'segments', 'the', 'new', 'approach', 'was', 'compared', 'with', 'one', 'of', 'the', 'latest', 'feature', 'clustering', 'approaches', 'based', 'on', 'kmeans', 'in', 'eightdimensional', 'space', 'and', 'the', 'results', 'revealed', 'that', 'the', 'new', 'approach', 'is', 'better', 'by', 'means', 'of', 'consistency', 'completeness', 'and', 'spatial', 'accuracy', 'further', 'the', 'new', 'approach', 'completely', 'solved', 'the', 'problem', 'of', 'not', 'knowing', 'the', 'number', 'of', 'objects', 'in', 'a', 'scene']] | [-0.03949085001820802, 0.0009895987075662284, -0.12872045646998242, 0.06775657342384672, -0.11867666658972613, -0.1498711866718766, 0.014682813468409637, 0.43589201946443284, -0.27399758149444925, -0.33449523317578594, 0.07379755843566915, -0.2610579746055733, -0.1435964264122671, 0.15933125911618184, -0.11916559510585192, 0.09921616734834715, 0.0802037406818974, 0.048038747586440625, -0.04125621894610044, -0.25274436653500465, 0.32185460556821344, 0.04329016984696364, 0.322676371303741, -0.01990655407327233, 0.1353168484417188, 0.02503912837914469, -0.09587818989564245, 0.05557828487495467, -0.042059137117145214, 0.186308749503036, 0.2596590161045784, 0.17711768514675508, 0.27009974454110214, -0.4071660934217623, -0.21780963389581473, 0.05660475286442721, 0.16508165121960797, 0.1104063179904911, -0.05581175424744054, -0.355542023007197, 0.1069973010572534, -0.11185386792718492, -0.04694031854568605, -0.09370898266938346, 0.0011597442936304716, -0.011110109597041506, -0.24991987413340058, 0.06898649635572227, 0.07805889707646872, 0.056090348413791395, -0.07175992864145957, -0.09812776148809414, 0.046304358792615845, 0.157119580808338, 0.028223284722403867, 0.05670228766070472, 0.13822276086127114, -0.17523313989612269, -0.11748620044243963, 0.4008966577048713, -0.021762751271588762, -0.2209726403816603, 0.1850498957179585, -0.011006830118552984, -0.14780267637103187, 0.1304850140463953, 0.16710082429041814, 0.1697000154154171, -0.1660166751492594, 0.004549409662460506, -0.022262832934134884, 0.17915256241437222, 0.06147026802189866, -0.00807329134917573, 0.2070115678208439, 0.23942577990850336, 0.07717560159249438, 0.1298366849595267, -0.156697873589998, -0.04062879714047351, -0.22116572842306909, -0.09974158270426138, -0.19436796820226904, -0.08432954553865667, -0.13891947573498137, -0.15670109571931934, 0.4119213461639, 0.1913664596242427, 0.23530748563856757, 0.05899124959625347, 0.358773616126232, 0.03691734510000076, 0.09969625755673416, 0.07150950174702451, 0.1795107543002814, 0.036280954998716364, 0.09466231078704634, -0.17958997145815267, 0.0827914593926473, 0.15268939136042756] |
1,803.00032 | Mesons and diquarks in a color superconducting regime | The behavior of the mesons and diquarks is studied at finite temperatures, chemical potentials and densities, notably when the color superconductivity is taken into account. The Nambu and Jona-Lasinio model complemented by a Polyakov loop (PNJL description) has been adapted in order to model these composite particles in this regime. This paper focuses on the scalar and pseudo-scalar mesons and diquarks, in a three-flavor and three-color description, with the isospin symmetry and at null strangeness. A finality of this work is to underline the modifications carried out by the color superconducting regime on the used equations and on the obtained results. It has been observed that the two-flavor color-superconducting (2SC) phase affects the masses of the mesons and diquarks in a non-negligible way. This observation is particularly true at high densities and low temperatures for the pions, $\eta$ and the diquarks [ud] whose color is rg. This reveals that the inclusion of the color superconductivity is relevant to describe the mesons and diquarks near the first order chiral phase transition. | hep-ph | the behavior of the mesons and diquarks is studied at finite temperatures chemical potentials and densities notably when the color superconductivity is taken into account the nambu and jonalasinio model complemented by a polyakov loop pnjl description has been adapted in order to model these composite particles in this regime this paper focuses on the scalar and pseudoscalar mesons and diquarks in a threeflavor and threecolor description with the isospin symmetry and at null strangeness a finality of this work is to underline the modifications carried out by the color superconducting regime on the used equations and on the obtained results it has been observed that the twoflavor colorsuperconducting 2sc phase affects the masses of the mesons and diquarks in a nonnegligible way this observation is particularly true at high densities and low temperatures for the pions eta and the diquarks ud whose color is rg this reveals that the inclusion of the color superconductivity is relevant to describe the mesons and diquarks near the first order chiral phase transition | [['the', 'behavior', 'of', 'the', 'mesons', 'and', 'diquarks', 'is', 'studied', 'at', 'finite', 'temperatures', 'chemical', 'potentials', 'and', 'densities', 'notably', 'when', 'the', 'color', 'superconductivity', 'is', 'taken', 'into', 'account', 'the', 'nambu', 'and', 'jonalasinio', 'model', 'complemented', 'by', 'a', 'polyakov', 'loop', 'pnjl', 'description', 'has', 'been', 'adapted', 'in', 'order', 'to', 'model', 'these', 'composite', 'particles', 'in', 'this', 'regime', 'this', 'paper', 'focuses', 'on', 'the', 'scalar', 'and', 'pseudoscalar', 'mesons', 'and', 'diquarks', 'in', 'a', 'threeflavor', 'and', 'threecolor', 'description', 'with', 'the', 'isospin', 'symmetry', 'and', 'at', 'null', 'strangeness', 'a', 'finality', 'of', 'this', 'work', 'is', 'to', 'underline', 'the', 'modifications', 'carried', 'out', 'by', 'the', 'color', 'superconducting', 'regime', 'on', 'the', 'used', 'equations', 'and', 'on', 'the', 'obtained', 'results', 'it', 'has', 'been', 'observed', 'that', 'the', 'twoflavor', 'colorsuperconducting', '2sc', 'phase', 'affects', 'the', 'masses', 'of', 'the', 'mesons', 'and', 'diquarks', 'in', 'a', 'nonnegligible', 'way', 'this', 'observation', 'is', 'particularly', 'true', 'at', 'high', 'densities', 'and', 'low', 'temperatures', 'for', 'the', 'pions', 'eta', 'and', 'the', 'diquarks', 'ud', 'whose', 'color', 'is', 'rg', 'this', 'reveals', 'that', 'the', 'inclusion', 'of', 'the', 'color', 'superconductivity', 'is', 'relevant', 'to', 'describe', 'the', 'mesons', 'and', 'diquarks', 'near', 'the', 'first', 'order', 'chiral', 'phase', 'transition']] | [-0.09354631262557471, 0.2685351112501367, -0.11575870876310064, 0.09513184907914632, -0.015375371363616603, -0.11051924887168056, 0.06324782950173626, 0.3630978107781095, -0.13545023829347508, -0.21537568295264944, -0.006940158675698673, -0.3180029576123856, -0.050515425884548354, 0.03371113920310403, 0.03494591788005303, 0.03676814006843522, -0.012898061104694053, 0.06392245286158012, -0.0856205990209299, -0.23429135301095597, 0.34139482111272895, -0.022414016225101318, 0.2541745261131676, 0.16782233765732277, 0.06166532927137964, -0.016522985494092982, 0.015315800466958214, -0.0056916183792054655, -0.104849025413055, 0.018303605157416313, 0.21714166243028182, -0.006692366664270487, 0.13892122167162596, -0.3637566040763084, -0.225626939810429, 0.10204900850897984, 0.14769503202508477, 0.1315099749221083, -0.030901338263442192, -0.3254652453791898, 0.0956584713954191, -0.15715104755671586, -0.1520758100826403, -0.11943829246961019, -0.0007266383344197975, -0.0700969288851518, -0.29632319562849313, 0.0772075183716986, 0.02112408580039354, 0.062167486142168535, -0.04705764980548445, -0.19500461958129617, -0.05010825739077786, 0.03655249189588871, 0.0806749735137119, 0.09217941112788942, 0.10362479471368716, -0.19048699672498248, -0.05680719238829196, 0.44093707026913764, -0.0425565166371491, -0.1327582356355646, 0.1530452935038792, -0.13579366937663187, -0.12416842569912072, 0.09911376410985694, 0.15829538814175656, 0.07538528957349412, -0.19319568005131954, 0.10479168400240323, -0.026159411099027186, 0.15522871945697048, 0.048711235842475775, 0.04736882406286895, 0.25784274147385183, 0.19594750010326287, -0.05047643308199066, 0.10430247801876462, -0.0490190088392838, -0.11732686045305694, -0.3641439375084113, -0.1155717380978304, -0.1399571675245705, -0.01241635967984193, -0.07908967570435968, -0.08726084967801238, 0.42215301662354787, 0.12490072757971254, 0.21231627557084293, -0.02824370586724185, 0.292125376793282, 0.0969003562541569, 0.07907107225619256, 0.0872330928056994, 0.2795063455369981, 0.223217000245281, 0.15866709059268674, -0.3232516175300321, -0.016988680147401552, 0.0806270378669176] |
1,803.00033 | Project VeSElkA: Search for vertical stratification of element
abundances in HD157087 | The new spectropolarimetric spectra of HD157087 obtained recently with
ESPaDOnS at CFHT are analysed to verify the nature of this object. The
fundamental stellar parameters $T_{\rm eff}$ = 8882 K, $\log{g}$=3.57 have been
obtained for HD157087 from the analysis of nine Balmer line profiles in two
available spectra. Comparison of the results of our abundance analysis with the
previously published data shows a variability of average abundance with time
for some chemical species, while the abundance of other elements remains almost
the same. The abundance analysis also reveals evidence of a significant
abundance increase towards the deeper atmospheric layers for C, S, Ca, Sc, V,
Cr, Mn, Co, Ni and Zr. Together with the found enhanced abundance of Ca and Sc
this fact contradicts the classification of HD157087 as a marginal Am star.
Analysis of the available measurements of radial velocity results in detection
of long periodic and short periodic variations. The long periodic variation
supports the idea that HD157087 is an astrometric binary system with a period
higher than 6 years. The presence of short periodic variation of $V_{\rm r}$,
as well as the detection of temporal variation of average abundance suggest
that HD157087 may be a triple system, where a short periodic binary rotates
around a third star. In this case, the short periodic binary may consist of
slowly rotating Am and A (or Ap with weak magnetic field) stars that have
similar effective temperature and surface gravity, but different abundance
peculiarities.
| astro-ph.SR | the new spectropolarimetric spectra of hd157087 obtained recently with espadons at cfht are analysed to verify the nature of this object the fundamental stellar parameters t_rm eff 8882 k logg357 have been obtained for hd157087 from the analysis of nine balmer line profiles in two available spectra comparison of the results of our abundance analysis with the previously published data shows a variability of average abundance with time for some chemical species while the abundance of other elements remains almost the same the abundance analysis also reveals evidence of a significant abundance increase towards the deeper atmospheric layers for c s ca sc v cr mn co ni and zr together with the found enhanced abundance of ca and sc this fact contradicts the classification of hd157087 as a marginal am star analysis of the available measurements of radial velocity results in detection of long periodic and short periodic variations the long periodic variation supports the idea that hd157087 is an astrometric binary system with a period higher than 6 years the presence of short periodic variation of v_rm r as well as the detection of temporal variation of average abundance suggest that hd157087 may be a triple system where a short periodic binary rotates around a third star in this case the short periodic binary may consist of slowly rotating am and a or ap with weak magnetic field stars that have similar effective temperature and surface gravity but different abundance peculiarities | [['the', 'new', 'spectropolarimetric', 'spectra', 'of', 'hd157087', 'obtained', 'recently', 'with', 'espadons', 'at', 'cfht', 'are', 'analysed', 'to', 'verify', 'the', 'nature', 'of', 'this', 'object', 'the', 'fundamental', 'stellar', 'parameters', 't_rm', 'eff', '8882', 'k', 'logg357', 'have', 'been', 'obtained', 'for', 'hd157087', 'from', 'the', 'analysis', 'of', 'nine', 'balmer', 'line', 'profiles', 'in', 'two', 'available', 'spectra', 'comparison', 'of', 'the', 'results', 'of', 'our', 'abundance', 'analysis', 'with', 'the', 'previously', 'published', 'data', 'shows', 'a', 'variability', 'of', 'average', 'abundance', 'with', 'time', 'for', 'some', 'chemical', 'species', 'while', 'the', 'abundance', 'of', 'other', 'elements', 'remains', 'almost', 'the', 'same', 'the', 'abundance', 'analysis', 'also', 'reveals', 'evidence', 'of', 'a', 'significant', 'abundance', 'increase', 'towards', 'the', 'deeper', 'atmospheric', 'layers', 'for', 'c', 's', 'ca', 'sc', 'v', 'cr', 'mn', 'co', 'ni', 'and', 'zr', 'together', 'with', 'the', 'found', 'enhanced', 'abundance', 'of', 'ca', 'and', 'sc', 'this', 'fact', 'contradicts', 'the', 'classification', 'of', 'hd157087', 'as', 'a', 'marginal', 'am', 'star', 'analysis', 'of', 'the', 'available', 'measurements', 'of', 'radial', 'velocity', 'results', 'in', 'detection', 'of', 'long', 'periodic', 'and', 'short', 'periodic', 'variations', 'the', 'long', 'periodic', 'variation', 'supports', 'the', 'idea', 'that', 'hd157087', 'is', 'an', 'astrometric', 'binary', 'system', 'with', 'a', 'period', 'higher', 'than', '6', 'years', 'the', 'presence', 'of', 'short', 'periodic', 'variation', 'of', 'v_rm', 'r', 'as', 'well', 'as', 'the', 'detection', 'of', 'temporal', 'variation', 'of', 'average', 'abundance', 'suggest', 'that', 'hd157087', 'may', 'be', 'a', 'triple', 'system', 'where', 'a', 'short', 'periodic', 'binary', 'rotates', 'around', 'a', 'third', 'star', 'in', 'this', 'case', 'the', 'short', 'periodic', 'binary', 'may', 'consist', 'of', 'slowly', 'rotating', 'am', 'and', 'a', 'or', 'ap', 'with', 'weak', 'magnetic', 'field', 'stars', 'that', 'have', 'similar', 'effective', 'temperature', 'and', 'surface', 'gravity', 'but', 'different', 'abundance', 'peculiarities']] | [-0.13169649127035687, 0.11022304506614768, -0.04071350974869753, 0.025030638225480514, -0.0495342372489462, -0.1255737023912986, 0.053446684432916405, 0.37958115842655177, -0.19967586184998065, -0.3493340988268244, 0.07254987751847626, -0.28909330339409595, -0.05271803168579936, 0.18344038224313408, -0.030319861259263874, -0.010231099371564543, 0.10695832725306434, 0.03215786938801839, -0.09379699417391854, -0.24904289910346578, 0.26832661825744053, 0.058364489548724176, 0.2036439764374975, -0.011225194129554078, -0.00588779601466665, -0.05284837227144417, -0.07201296472327864, 0.039802236799516305, -0.10364327934511802, 0.08338182694701986, 0.2002680166027978, 0.109130100577046, 0.18148157963806316, -0.35331585301540425, -0.240688127377032, 0.03927424436142622, 0.16102418217236514, 0.08220572330438616, -0.07567722684163061, -0.2530567240694438, 0.086982842665868, -0.14596333444079534, -0.15288591943921767, 0.012785730440427419, 0.10887727754677391, 0.07270028639160489, -0.24951516141083616, 0.09658680981783242, 0.07407069091987219, 0.16032229999392025, -0.11623588228003653, -0.16049386233607046, -0.08770247721036296, 0.08948451896248123, 0.05778847581924378, 0.044743884833960614, 0.07134302612105461, -0.06469969406881762, -0.03248472946064839, 0.36866965689042136, -0.17339264252060718, -0.026414937963170453, 0.2128522525371191, -0.16288357741518855, -0.17989283039961934, 0.15818549747471045, 0.12090810381399453, 0.13744242305767315, -0.1328310254453258, 0.02910116819394483, -0.0406901452070764, 0.23338873357288847, 0.07681909862719091, 0.04043817508115225, 0.2732482904179622, 0.1426934965863085, 0.036003333189301504, 0.06571487242462737, -0.20111824392941435, -0.03922887027171279, -0.22491210856867477, -0.1465646623102717, -0.10697311219809315, 0.0464177221687095, -0.11131433658040858, -0.16571645335725332, 0.3722519214757649, 0.10187955308741166, 0.22568487431921358, 0.009890858370672204, 0.26590370547703723, 0.09086160195562296, 0.077039862848534, 0.06415864421932166, 0.25735661147360994, 0.16845004423906304, 0.14709888145900984, -0.26711964166303714, 0.08930859550802915, 0.01285789709361193] |
1,803.00034 | Field spheroid-dominated galaxies in a {\Lambda}-CDM Universe | Understanding the formation and evolution of early-type, spheroid-dominated
galaxies is an open question within the context of the hierarchical clustering
scenario, particularly, in low-density environments. Our goal is to study the
main structural, dynamical, and stellar population properties and assembly
histories of field spheroid-dominated galaxies formed in a LCDM scenario to
assess to what extend they are consistent with observations. We selected
spheroid-dominated systems from a LCDM simulation that includes star formation,
chemical evolution and Supernova feedback. A sample of 18 field systems with
Mstar <= 6x10^10 Msun that are dominated by the spheroid component. For this
sample we estimate the fundamental relations of ellipticals and then compared
with current observations. The simulated spheroid galaxies have sizes in good
agreement with observations. The bulges follow a Sersic law with Sersic indexes
that correlate with the bulge-to-total mass ratios. The structural-dynamical
properties of the simulated galaxies are consistent with observed
Faber-Jackson, Fundamental Plane, and Tully-Fisher relations. However, the
simulated galaxies are bluer and with higher star formation rates than observed
isolated early-type galaxies. The archaeological mass growth histories show a
slightly delayed formation and more prominent inside-out growth mode than
observational inferences based on the fossil record method. The main structural
and dynamical properties of the simulated spheroid-dominated galaxies are
consistent with observations. This is remarkable since none of them has been
tuned to be reproduced. However, the simulated galaxies are blue and
star-forming, and with later stellar mass growth histories as compared to
observational inferences. This is mainly due to the persistence of extended
discs in the simulations. Abridged
| astro-ph.GA | understanding the formation and evolution of earlytype spheroiddominated galaxies is an open question within the context of the hierarchical clustering scenario particularly in lowdensity environments our goal is to study the main structural dynamical and stellar population properties and assembly histories of field spheroiddominated galaxies formed in a lcdm scenario to assess to what extend they are consistent with observations we selected spheroiddominated systems from a lcdm simulation that includes star formation chemical evolution and supernova feedback a sample of 18 field systems with mstar 6x1010 msun that are dominated by the spheroid component for this sample we estimate the fundamental relations of ellipticals and then compared with current observations the simulated spheroid galaxies have sizes in good agreement with observations the bulges follow a sersic law with sersic indexes that correlate with the bulgetototal mass ratios the structuraldynamical properties of the simulated galaxies are consistent with observed faberjackson fundamental plane and tullyfisher relations however the simulated galaxies are bluer and with higher star formation rates than observed isolated earlytype galaxies the archaeological mass growth histories show a slightly delayed formation and more prominent insideout growth mode than observational inferences based on the fossil record method the main structural and dynamical properties of the simulated spheroiddominated galaxies are consistent with observations this is remarkable since none of them has been tuned to be reproduced however the simulated galaxies are blue and starforming and with later stellar mass growth histories as compared to observational inferences this is mainly due to the persistence of extended discs in the simulations abridged | [['understanding', 'the', 'formation', 'and', 'evolution', 'of', 'earlytype', 'spheroiddominated', 'galaxies', 'is', 'an', 'open', 'question', 'within', 'the', 'context', 'of', 'the', 'hierarchical', 'clustering', 'scenario', 'particularly', 'in', 'lowdensity', 'environments', 'our', 'goal', 'is', 'to', 'study', 'the', 'main', 'structural', 'dynamical', 'and', 'stellar', 'population', 'properties', 'and', 'assembly', 'histories', 'of', 'field', 'spheroiddominated', 'galaxies', 'formed', 'in', 'a', 'lcdm', 'scenario', 'to', 'assess', 'to', 'what', 'extend', 'they', 'are', 'consistent', 'with', 'observations', 'we', 'selected', 'spheroiddominated', 'systems', 'from', 'a', 'lcdm', 'simulation', 'that', 'includes', 'star', 'formation', 'chemical', 'evolution', 'and', 'supernova', 'feedback', 'a', 'sample', 'of', '18', 'field', 'systems', 'with', 'mstar', '6x1010', 'msun', 'that', 'are', 'dominated', 'by', 'the', 'spheroid', 'component', 'for', 'this', 'sample', 'we', 'estimate', 'the', 'fundamental', 'relations', 'of', 'ellipticals', 'and', 'then', 'compared', 'with', 'current', 'observations', 'the', 'simulated', 'spheroid', 'galaxies', 'have', 'sizes', 'in', 'good', 'agreement', 'with', 'observations', 'the', 'bulges', 'follow', 'a', 'sersic', 'law', 'with', 'sersic', 'indexes', 'that', 'correlate', 'with', 'the', 'bulgetototal', 'mass', 'ratios', 'the', 'structuraldynamical', 'properties', 'of', 'the', 'simulated', 'galaxies', 'are', 'consistent', 'with', 'observed', 'faberjackson', 'fundamental', 'plane', 'and', 'tullyfisher', 'relations', 'however', 'the', 'simulated', 'galaxies', 'are', 'bluer', 'and', 'with', 'higher', 'star', 'formation', 'rates', 'than', 'observed', 'isolated', 'earlytype', 'galaxies', 'the', 'archaeological', 'mass', 'growth', 'histories', 'show', 'a', 'slightly', 'delayed', 'formation', 'and', 'more', 'prominent', 'insideout', 'growth', 'mode', 'than', 'observational', 'inferences', 'based', 'on', 'the', 'fossil', 'record', 'method', 'the', 'main', 'structural', 'and', 'dynamical', 'properties', 'of', 'the', 'simulated', 'spheroiddominated', 'galaxies', 'are', 'consistent', 'with', 'observations', 'this', 'is', 'remarkable', 'since', 'none', 'of', 'them', 'has', 'been', 'tuned', 'to', 'be', 'reproduced', 'however', 'the', 'simulated', 'galaxies', 'are', 'blue', 'and', 'starforming', 'and', 'with', 'later', 'stellar', 'mass', 'growth', 'histories', 'as', 'compared', 'to', 'observational', 'inferences', 'this', 'is', 'mainly', 'due', 'to', 'the', 'persistence', 'of', 'extended', 'discs', 'in', 'the', 'simulations', 'abridged']] | [-0.04807294720506607, 0.08662954986179003, -0.10661734242340122, 0.14343270952115741, -0.08741688051039954, -0.04055514215158321, -0.004449972703487608, 0.44022982572803293, -0.10984249568475475, -0.36877660407659374, 0.06510807927389872, -0.2780695001808528, -0.06723731203407415, 0.19962337336698655, -0.04876026731973753, -0.018483543720509466, 0.05100863404365452, -0.11342878660625608, -0.04392366542015225, -0.3252041401497382, 0.3210352097442265, 0.06600632762730281, 0.19915013778311516, -0.13299075209314606, 0.010221989274546794, -0.11177503493349955, -0.09921694415393159, 0.0035230663939332047, -0.20203899735661748, 0.028160737238548957, 0.23280753774536955, 0.14078785371395908, 0.21963138054106893, -0.37525275129985003, -0.2069888532375518, 0.07864312262180105, 0.22508310796538955, 0.04788597328823915, -0.15310567395440222, -0.2377535246089753, 0.09726866343419216, -0.15849158513370598, -0.15262478954749406, 0.07520832055781022, 0.02458847167195955, 0.045034659821324104, -0.2166052559600846, 0.21142897553604226, 0.020087592882432174, 0.09432444332261726, -0.12505316760586682, -0.0716112519973157, -0.1267232537316702, 0.08067263641842216, 0.01774526694209717, 0.06197506430647644, 0.22334388332760347, -0.15660667311126578, -0.0432228251479943, 0.4377998972297121, -0.023616213735273645, -0.01555539136716248, 0.28416075619528297, -0.22234941810072337, -0.16561708132433342, 0.05920454778231532, 0.1508230816297494, 0.06708941256672399, -0.15883019929643039, -0.010061881462146495, -0.015279756679565642, 0.223195618632293, 0.0034794251313106906, 0.027233660903397825, 0.3389660903872788, 0.15817312160977942, -0.009194596629799977, 0.06008556360878949, -0.09139202319048001, -0.10076461233930654, -0.16785063042943202, -0.07041912854437132, -0.1133377228387684, 0.07064010250084972, -0.16948094164549712, -0.1082364648602294, 0.3289086176879733, 0.11145012518868905, 0.26590039734710513, 0.14422803868608483, 0.3099691720130393, 0.07553643106522785, 0.14853772483693603, 0.0879244447689402, 0.2688140417689255, 0.21264812641537925, 0.045712321541899026, -0.26193785702661115, 0.10294991592760651, -0.04279842665092838] |
1,803.00035 | Proton decay and light sterile neutrinos | Within the standard model, non-renormalizable operators at dimension six
($d=6$) violate baryon and lepton number by one unit and thus lead to proton
decay. Here, we point out that the proton decay mode with a charged pion and
missing energy can be a characteristic signature of $d=6$ operators containing
a light sterile neutrino, if it is not accompanied by the standard $\pi^0e^+$
final state. We discuss this effect first at the level of effective operators
and then provide a concrete model with new physics at the TeV scale, in which
the lightness of the active neutrinos and the stability of the proton are
related.
| hep-ph | within the standard model nonrenormalizable operators at dimension six d6 violate baryon and lepton number by one unit and thus lead to proton decay here we point out that the proton decay mode with a charged pion and missing energy can be a characteristic signature of d6 operators containing a light sterile neutrino if it is not accompanied by the standard pi0e final state we discuss this effect first at the level of effective operators and then provide a concrete model with new physics at the tev scale in which the lightness of the active neutrinos and the stability of the proton are related | [['within', 'the', 'standard', 'model', 'nonrenormalizable', 'operators', 'at', 'dimension', 'six', 'd6', 'violate', 'baryon', 'and', 'lepton', 'number', 'by', 'one', 'unit', 'and', 'thus', 'lead', 'to', 'proton', 'decay', 'here', 'we', 'point', 'out', 'that', 'the', 'proton', 'decay', 'mode', 'with', 'a', 'charged', 'pion', 'and', 'missing', 'energy', 'can', 'be', 'a', 'characteristic', 'signature', 'of', 'd6', 'operators', 'containing', 'a', 'light', 'sterile', 'neutrino', 'if', 'it', 'is', 'not', 'accompanied', 'by', 'the', 'standard', 'pi0e', 'final', 'state', 'we', 'discuss', 'this', 'effect', 'first', 'at', 'the', 'level', 'of', 'effective', 'operators', 'and', 'then', 'provide', 'a', 'concrete', 'model', 'with', 'new', 'physics', 'at', 'the', 'tev', 'scale', 'in', 'which', 'the', 'lightness', 'of', 'the', 'active', 'neutrinos', 'and', 'the', 'stability', 'of', 'the', 'proton', 'are', 'related']] | [-0.04480513161979616, 0.27306172532002326, -0.03956893911512876, 0.15537411394501918, -0.03012129615142363, -0.16173272754248794, 0.06505299098021125, 0.2742111704592566, -0.22201636851340242, -0.2944293170534436, 0.06115378869258916, -0.31531977290920554, -0.03468340931876192, 0.1371698740155445, 0.058782710460945964, 0.02420257349742703, 0.03167821781583203, 0.06482408896599472, -0.05454621065941467, -0.222644203704176, 0.3658526438170845, 0.08600905654246657, 0.20817601783381937, 0.117991043006079, 0.08159249601885676, -0.0336618759529213, -0.019592397439393026, -0.030814718744419153, -0.05316514352448703, 0.09104031148972441, 0.17100743841813895, 0.08066622156297192, 0.1554500212061029, -0.4109843434964858, -0.16033714115890918, 0.1713272130514667, 0.15187999981826225, 0.11190729451397416, -0.06476714448478904, -0.268782135804446, 0.09536627054811248, -0.18623779963213696, -0.1683269820438282, -0.07691867970997124, -0.030412348335409917, -0.0499981305204802, -0.30623629161617855, 0.10016608059047992, -0.008230399383340501, 0.016187564632629308, -0.03858801928231294, -0.14569602582097343, -0.028292556198368086, 0.05181602095095531, 0.13314484324740264, 0.026269940131861555, 0.13128639534070582, -0.1309332595211318, -0.14585280341991377, 0.37219210283252074, -0.062457938753158866, -0.19753038953736568, 0.1325049060193406, -0.19126720926317486, -0.1280632859629407, 0.14552571657068522, 0.1665880580215706, 0.07465041306737846, -0.15755721723244895, 0.10715215502801867, -0.05413563022371924, 0.18510311781524824, 0.05884403934096465, 0.07844203842116647, 0.2593902683030199, 0.20547203187948293, 0.06106892010667226, 0.04659631910611812, -0.0924250501302948, -0.02356728917503169, -0.41863194592658753, -0.13784241336352618, -0.09412411710295998, 0.08887212607092382, -0.06605884869901116, -0.10988045350458582, 0.4554524679568786, 0.09387012854562078, 0.23222961413303336, -0.01482954759544069, 0.2695006064130265, 0.09532015598876384, 0.11004993951092791, 0.08039842508462014, 0.30364391026403575, 0.10249362985865729, 0.12820483022143395, -0.23863785418238745, -0.02568954841496007, 0.10611548567263102] |
1,803.00036 | A Retinal Image Enhancement Technique for Blood Vessel Segmentation
Algorithm | The morphology of blood vessels in retinal fundus images is an important
indicator of diseases like glaucoma, hypertension and diabetic retinopathy. The
accuracy of retinal blood vessels segmentation affects the quality of retinal
image analysis which is used in diagnosis methods in modern ophthalmology.
Contrast enhancement is one of the crucial steps in any of retinal blood vessel
segmentation approaches. The reliability of the segmentation depends on the
consistency of the contrast over the image. This paper presents an assessment
of the suitability of a recently invented spatially adaptive contrast
enhancement technique for enhancing retinal fundus images for blood vessel
segmentation. The enhancement technique was integrated with a variant of Tyler
Coye algorithm, which has been improved with Hough line transformation based
vessel reconstruction method. The proposed approach was evaluated on two public
datasets STARE and DRIVE. The assessment was done by comparing the segmentation
performance with five widely used contrast enhancement techniques based on
wavelet transform, contrast limited histogram equalization, local
normalization, linear un-sharp masking and contourlet transform. The results
revealed that the assessed enhancement technique is well suited for the
application and also outperforms all compared techniques.
| cs.CV | the morphology of blood vessels in retinal fundus images is an important indicator of diseases like glaucoma hypertension and diabetic retinopathy the accuracy of retinal blood vessels segmentation affects the quality of retinal image analysis which is used in diagnosis methods in modern ophthalmology contrast enhancement is one of the crucial steps in any of retinal blood vessel segmentation approaches the reliability of the segmentation depends on the consistency of the contrast over the image this paper presents an assessment of the suitability of a recently invented spatially adaptive contrast enhancement technique for enhancing retinal fundus images for blood vessel segmentation the enhancement technique was integrated with a variant of tyler coye algorithm which has been improved with hough line transformation based vessel reconstruction method the proposed approach was evaluated on two public datasets stare and drive the assessment was done by comparing the segmentation performance with five widely used contrast enhancement techniques based on wavelet transform contrast limited histogram equalization local normalization linear unsharp masking and contourlet transform the results revealed that the assessed enhancement technique is well suited for the application and also outperforms all compared techniques | [['the', 'morphology', 'of', 'blood', 'vessels', 'in', 'retinal', 'fundus', 'images', 'is', 'an', 'important', 'indicator', 'of', 'diseases', 'like', 'glaucoma', 'hypertension', 'and', 'diabetic', 'retinopathy', 'the', 'accuracy', 'of', 'retinal', 'blood', 'vessels', 'segmentation', 'affects', 'the', 'quality', 'of', 'retinal', 'image', 'analysis', 'which', 'is', 'used', 'in', 'diagnosis', 'methods', 'in', 'modern', 'ophthalmology', 'contrast', 'enhancement', 'is', 'one', 'of', 'the', 'crucial', 'steps', 'in', 'any', 'of', 'retinal', 'blood', 'vessel', 'segmentation', 'approaches', 'the', 'reliability', 'of', 'the', 'segmentation', 'depends', 'on', 'the', 'consistency', 'of', 'the', 'contrast', 'over', 'the', 'image', 'this', 'paper', 'presents', 'an', 'assessment', 'of', 'the', 'suitability', 'of', 'a', 'recently', 'invented', 'spatially', 'adaptive', 'contrast', 'enhancement', 'technique', 'for', 'enhancing', 'retinal', 'fundus', 'images', 'for', 'blood', 'vessel', 'segmentation', 'the', 'enhancement', 'technique', 'was', 'integrated', 'with', 'a', 'variant', 'of', 'tyler', 'coye', 'algorithm', 'which', 'has', 'been', 'improved', 'with', 'hough', 'line', 'transformation', 'based', 'vessel', 'reconstruction', 'method', 'the', 'proposed', 'approach', 'was', 'evaluated', 'on', 'two', 'public', 'datasets', 'stare', 'and', 'drive', 'the', 'assessment', 'was', 'done', 'by', 'comparing', 'the', 'segmentation', 'performance', 'with', 'five', 'widely', 'used', 'contrast', 'enhancement', 'techniques', 'based', 'on', 'wavelet', 'transform', 'contrast', 'limited', 'histogram', 'equalization', 'local', 'normalization', 'linear', 'unsharp', 'masking', 'and', 'contourlet', 'transform', 'the', 'results', 'revealed', 'that', 'the', 'assessed', 'enhancement', 'technique', 'is', 'well', 'suited', 'for', 'the', 'application', 'and', 'also', 'outperforms', 'all', 'compared', 'techniques']] | [0.009715421823784709, -0.045925406467737975, -0.09189871918320894, 0.04704865905582568, -0.039391811862786084, -0.12027613304436524, -0.023704840076537406, 0.41996882695387655, -0.15791034418594171, -0.30261484366108443, 0.14553921844716125, -0.27297298788548785, -0.239881352897352, 0.2486561649538418, -0.19863647135083584, 0.12801487387425484, 0.12048923118446181, 0.03128495786656091, -0.0058071686647228025, -0.2632022191710929, 0.22319320632897793, 0.05468780153054506, 0.4528550511037812, 0.03599765093779152, 0.13081233601375022, 0.006101160832839285, -0.12820205464277992, 0.008367069606778231, -0.0690260617463169, 0.14491586338609774, 0.2827584635010584, 0.14244668652982193, 0.3088565705854327, -0.38537476627166045, -0.24543675785869398, 0.07004310859818051, 0.2039766840418761, 0.06393180982690574, -0.050480404109235835, -0.32463326777747653, 0.08690453417589293, -0.0892552449646594, -0.02122861804054218, -0.05782899683826861, -0.04433526760313977, -0.03273473812287, -0.28761935850111225, 0.13139849988315389, 0.0278950944806677, 0.1537568017226109, -0.08438042663731316, -0.10582069500641739, 0.021851890241452294, 0.19463515274741866, -0.012425044643137841, 0.09911600151285034, 0.23234453390196383, -0.19233884838127352, -0.10703494784699634, 0.3514768647604642, -0.05224814669952351, -0.1931102711969288, 0.1679008938570289, -0.034891805978135224, -0.11189826875999372, 0.15747201802615235, 0.14484942144376195, 0.11934655485798586, -0.1435550807031216, -0.047932851714072154, 0.0131571177551721, 0.20222546666503904, 0.14027257005069801, -0.0392423346242372, 0.11413218174872801, 0.28679735583074867, -0.0062114314892591825, 0.16853830440061543, -0.24482269298800446, 0.024256308818176548, -0.16560591527439178, -0.1697156223099421, -0.14168048333104186, -0.09736361584757415, -0.099517622896646, -0.1923884177788537, 0.4147336245167683, 0.19582393026088385, 0.15089620455128558, -0.0007175530264887245, 0.4037826906944169, 0.03974747174528447, 0.13288488279609506, -0.025633206376756364, 0.19186193555558814, 0.08793513930496819, 0.12723731286415058, -0.26574413623398246, 0.1250257331523747, 0.1098481916446001] |
1,803.00037 | Invariant properties of a locally salient dither pattern with a
spatial-chromatic histogram | Compacted Dither Pattern Code (CDPC) is a recently found feature which is
successful in irregular shapes based visual depiction. Locally salient dither
pattern feature is an attempt to expand the capability of CDPC for both regular
and irregular shape based visual depiction. This paper presents an analysis of
rotational and scale invariance property of locally salient dither pattern
feature with a two dimensional spatialchromatic histogram, which expands the
applicability of the visual feature. Experiments were conducted to exhibit
rotational and scale invariance of the feature. These experiments were
conducted by combining linear Support Vector Machine (SVM) classifier to the
new feature. The experimental results revealed that the locally salient dither
pattern feature with the spatialchromatic histogram is rotationally and scale
invariant.
| cs.CV | compacted dither pattern code cdpc is a recently found feature which is successful in irregular shapes based visual depiction locally salient dither pattern feature is an attempt to expand the capability of cdpc for both regular and irregular shape based visual depiction this paper presents an analysis of rotational and scale invariance property of locally salient dither pattern feature with a two dimensional spatialchromatic histogram which expands the applicability of the visual feature experiments were conducted to exhibit rotational and scale invariance of the feature these experiments were conducted by combining linear support vector machine svm classifier to the new feature the experimental results revealed that the locally salient dither pattern feature with the spatialchromatic histogram is rotationally and scale invariant | [['compacted', 'dither', 'pattern', 'code', 'cdpc', 'is', 'a', 'recently', 'found', 'feature', 'which', 'is', 'successful', 'in', 'irregular', 'shapes', 'based', 'visual', 'depiction', 'locally', 'salient', 'dither', 'pattern', 'feature', 'is', 'an', 'attempt', 'to', 'expand', 'the', 'capability', 'of', 'cdpc', 'for', 'both', 'regular', 'and', 'irregular', 'shape', 'based', 'visual', 'depiction', 'this', 'paper', 'presents', 'an', 'analysis', 'of', 'rotational', 'and', 'scale', 'invariance', 'property', 'of', 'locally', 'salient', 'dither', 'pattern', 'feature', 'with', 'a', 'two', 'dimensional', 'spatialchromatic', 'histogram', 'which', 'expands', 'the', 'applicability', 'of', 'the', 'visual', 'feature', 'experiments', 'were', 'conducted', 'to', 'exhibit', 'rotational', 'and', 'scale', 'invariance', 'of', 'the', 'feature', 'these', 'experiments', 'were', 'conducted', 'by', 'combining', 'linear', 'support', 'vector', 'machine', 'svm', 'classifier', 'to', 'the', 'new', 'feature', 'the', 'experimental', 'results', 'revealed', 'that', 'the', 'locally', 'salient', 'dither', 'pattern', 'feature', 'with', 'the', 'spatialchromatic', 'histogram', 'is', 'rotationally', 'and', 'scale', 'invariant']] | [-0.07503290687345414, 0.056412839554857194, -0.1461641593860128, 0.014202509615689708, -0.13684500131405827, -0.17474238989022997, -0.029445863781600363, 0.4567967958939381, -0.28427886752746045, -0.269793048604495, 0.0922195921626149, -0.23425464598764467, -0.21387229533468047, 0.13031026226820117, -0.0672453895656981, 0.13949839842036113, 0.05825505771427455, 0.053434126357683256, -0.051309845655058056, -0.23380706919771102, 0.3422461795087299, 0.12489131311925812, 0.3903164015804282, -0.007875263953629212, 0.10840051146582343, -0.04261903810259114, -0.1239981990840891, 0.010094554664996954, -0.040625929146217536, 0.15582441363451827, 0.2711155527613611, 0.1479610894034561, 0.2136718130264527, -0.37214163724237526, -0.22972041879791535, 0.027901180502441194, 0.1342858247514655, 0.11666923732015216, -0.0857149351778257, -0.34096027495196235, 0.1276627381423759, -0.07675758510445937, -0.09171029369736838, -0.13336474660975048, 0.042391142079558894, -0.028836404188321188, -0.2583208421850179, 0.06664274884467451, 0.14268082166170207, 0.1303513051989751, -0.05779384656880911, -0.06832612669652599, -0.02323018567254528, 0.09901291840614225, 0.03262532093267665, 0.06573382062980762, 0.13949775952511492, -0.12057517355778821, -0.117226057085925, 0.3885288575751723, -0.06392676889514312, -0.18954900195563418, 0.20106983193570477, -0.08463533014520748, -0.14341582962248123, 0.1589535747009974, 0.1873376936911462, 0.09871466919724058, -0.1142907785012936, 0.02551072452846182, -0.05942388584550757, 0.2114957899778572, 0.06698895079426022, 0.02300425639583005, 0.2271351827145355, 0.21104726190559375, 0.023197350203672536, 0.15898079502507725, -0.18486041012100685, -0.07135370207361431, -0.23436809028299826, -0.08327487085719043, -0.16329210307886904, -0.09261513151861249, -0.10940322274308349, -0.15525149229245308, 0.43747058043527043, 0.15708402073573974, 0.28209746781832135, 0.05193053671700132, 0.2692496372609694, 0.009270904406618614, 0.14860955199712297, 0.05990368256377231, 0.1861677499822317, 0.036975392104627997, 0.06378362679647075, -0.20306417199138266, 0.045846015413920596, 0.10089997525135867] |
1,803.00038 | Visual thinking and simplicity in proof | This paper studies how spatial thinking interacts with simplicity in
[informal] proof, by analysing a set of example proofs mainly concerned with
Ferrers diagrams (visual representations of partitions of integers, and
comparing them to proofs that do not use spatial thinking. The analysis shows
that using diagrams and spatial thinking can contribute to simplicity by (for
example) avoiding technical calculations, division into cases, and induction,
and creating a more surveyable and explanatory proof (both of which are
connected to simplicity). In response to one part of Hilbert's 24th Problem,
the area between two proofs is explored in one example, showing that between a
proof that uses spatial reasoning and one that does not, there is a proof that
is less simple than either.
| math.HO | this paper studies how spatial thinking interacts with simplicity in informal proof by analysing a set of example proofs mainly concerned with ferrers diagrams visual representations of partitions of integers and comparing them to proofs that do not use spatial thinking the analysis shows that using diagrams and spatial thinking can contribute to simplicity by for example avoiding technical calculations division into cases and induction and creating a more surveyable and explanatory proof both of which are connected to simplicity in response to one part of hilberts 24th problem the area between two proofs is explored in one example showing that between a proof that uses spatial reasoning and one that does not there is a proof that is less simple than either | [['this', 'paper', 'studies', 'how', 'spatial', 'thinking', 'interacts', 'with', 'simplicity', 'in', 'informal', 'proof', 'by', 'analysing', 'a', 'set', 'of', 'example', 'proofs', 'mainly', 'concerned', 'with', 'ferrers', 'diagrams', 'visual', 'representations', 'of', 'partitions', 'of', 'integers', 'and', 'comparing', 'them', 'to', 'proofs', 'that', 'do', 'not', 'use', 'spatial', 'thinking', 'the', 'analysis', 'shows', 'that', 'using', 'diagrams', 'and', 'spatial', 'thinking', 'can', 'contribute', 'to', 'simplicity', 'by', 'for', 'example', 'avoiding', 'technical', 'calculations', 'division', 'into', 'cases', 'and', 'induction', 'and', 'creating', 'a', 'more', 'surveyable', 'and', 'explanatory', 'proof', 'both', 'of', 'which', 'are', 'connected', 'to', 'simplicity', 'in', 'response', 'to', 'one', 'part', 'of', 'hilberts', '24th', 'problem', 'the', 'area', 'between', 'two', 'proofs', 'is', 'explored', 'in', 'one', 'example', 'showing', 'that', 'between', 'a', 'proof', 'that', 'uses', 'spatial', 'reasoning', 'and', 'one', 'that', 'does', 'not', 'there', 'is', 'a', 'proof', 'that', 'is', 'less', 'simple', 'than', 'either']] | [-0.0900453696878271, 0.07004682050366712, -0.12247971861009918, 0.09627491731870526, -0.16691549140505674, -0.17422193686318835, 0.047919496865962, 0.3720218820130165, -0.2165829517378858, -0.3082659579510611, 0.10456219554511542, -0.2651925290503153, -0.17730017601535086, 0.2256409088594506, -0.11535792201908866, -0.08659803314414632, 0.05478959369314153, -0.0022842345410973076, -0.04621841255726853, -0.23455062442614386, 0.3167418527144303, -0.015356523582969255, 0.24510297629361352, 0.06627503606468076, 0.09970049514261083, 0.03218527618280756, -0.0781684112697234, 0.026757736659212567, -0.07260251017956998, 0.17520547516519067, 0.29195227552530906, 0.17354042236731063, 0.32059352805391256, -0.4155615842409008, -0.14427762665990285, 0.10074601290232646, 0.18851161671601752, 0.08427545387294083, -0.031117723621186665, -0.24121252481439492, 0.0918519688851571, -0.12889748600470582, -0.12846562368189537, -0.10240598415910471, 0.037597481963959165, -0.01207349257074236, -0.20771683275139308, -0.004636559684617006, 0.17398290437593208, 0.13288935988792927, -0.01103416150360088, -0.11143501069608742, 0.001004182088105538, 0.10335595381438611, 0.042698844754311245, -0.011606257015127477, 0.08588459512703424, -0.134926279569499, -0.140923161756217, 0.35412176632950826, 0.008913009167564616, -0.23176786401242822, 0.2303046237949918, -0.12723224563902713, -0.1372724431794046, 0.07981664933476264, 0.09546075044654129, 0.06580085190376495, -0.11942458359100591, 0.043794027169053326, -0.04429272523649582, 0.2243176596267603, 0.12325696565013955, 0.00897686041104115, 0.17690770698491695, 0.15028520479298582, 0.03351663025398928, 0.126972755243078, 0.03514907278996709, -0.14386937355175916, -0.30432361172042727, -0.15683209831727957, -0.17575552427527927, 0.025392260127256025, -0.07089922491132615, -0.15536479095405922, 0.38555767712736033, 0.16329362393334146, 0.15975649162087727, 0.0937336965783961, 0.34436631457107825, 0.06569566565475378, 0.07765195565676786, 0.056675949614737334, 0.1567514720865018, 0.1306444939142623, 0.09150510311232714, -0.11115953404592668, 0.08583638239727635, 0.11967975023861338] |
1,803.00039 | Super-Efficient Spatially Adaptive Contrast Enhancement Algorithm for
Superficial Vein Imaging | This paper presents a super-efficient spatially adaptive contrast enhancement
algorithm for enhancing infrared (IR) radiation based superficial vein images
in real-time. The super-efficiency permits the algorithm to run in
consumer-grade handheld devices, which ultimately reduces the cost of vein
imaging equipment. The proposed method utilizes the response from the
low-frequency range of the IR image signal to adjust the boundaries of the
reference dynamic range in a linear contrast stretching process with a tunable
contrast enhancement parameter, as opposed to traditional approaches which use
costly adaptive histogram equalization based methods. The algorithm has been
implemented and deployed in a consumer grade Android-based mobile device to
evaluate the performance. The results revealed that the proposed algorithm can
process IR images of veins in real-time on low-performance computers. It was
compared with several well-performed traditional methods and the results
revealed that the new algorithm stands out with several beneficial features,
namely, the fastest processing, the ability to enhance the desired details, the
excellent illumination normalization capability and the ability to enhance
details where the traditional methods failed.
| cs.CV | this paper presents a superefficient spatially adaptive contrast enhancement algorithm for enhancing infrared ir radiation based superficial vein images in realtime the superefficiency permits the algorithm to run in consumergrade handheld devices which ultimately reduces the cost of vein imaging equipment the proposed method utilizes the response from the lowfrequency range of the ir image signal to adjust the boundaries of the reference dynamic range in a linear contrast stretching process with a tunable contrast enhancement parameter as opposed to traditional approaches which use costly adaptive histogram equalization based methods the algorithm has been implemented and deployed in a consumer grade androidbased mobile device to evaluate the performance the results revealed that the proposed algorithm can process ir images of veins in realtime on lowperformance computers it was compared with several wellperformed traditional methods and the results revealed that the new algorithm stands out with several beneficial features namely the fastest processing the ability to enhance the desired details the excellent illumination normalization capability and the ability to enhance details where the traditional methods failed | [['this', 'paper', 'presents', 'a', 'superefficient', 'spatially', 'adaptive', 'contrast', 'enhancement', 'algorithm', 'for', 'enhancing', 'infrared', 'ir', 'radiation', 'based', 'superficial', 'vein', 'images', 'in', 'realtime', 'the', 'superefficiency', 'permits', 'the', 'algorithm', 'to', 'run', 'in', 'consumergrade', 'handheld', 'devices', 'which', 'ultimately', 'reduces', 'the', 'cost', 'of', 'vein', 'imaging', 'equipment', 'the', 'proposed', 'method', 'utilizes', 'the', 'response', 'from', 'the', 'lowfrequency', 'range', 'of', 'the', 'ir', 'image', 'signal', 'to', 'adjust', 'the', 'boundaries', 'of', 'the', 'reference', 'dynamic', 'range', 'in', 'a', 'linear', 'contrast', 'stretching', 'process', 'with', 'a', 'tunable', 'contrast', 'enhancement', 'parameter', 'as', 'opposed', 'to', 'traditional', 'approaches', 'which', 'use', 'costly', 'adaptive', 'histogram', 'equalization', 'based', 'methods', 'the', 'algorithm', 'has', 'been', 'implemented', 'and', 'deployed', 'in', 'a', 'consumer', 'grade', 'androidbased', 'mobile', 'device', 'to', 'evaluate', 'the', 'performance', 'the', 'results', 'revealed', 'that', 'the', 'proposed', 'algorithm', 'can', 'process', 'ir', 'images', 'of', 'veins', 'in', 'realtime', 'on', 'lowperformance', 'computers', 'it', 'was', 'compared', 'with', 'several', 'wellperformed', 'traditional', 'methods', 'and', 'the', 'results', 'revealed', 'that', 'the', 'new', 'algorithm', 'stands', 'out', 'with', 'several', 'beneficial', 'features', 'namely', 'the', 'fastest', 'processing', 'the', 'ability', 'to', 'enhance', 'the', 'desired', 'details', 'the', 'excellent', 'illumination', 'normalization', 'capability', 'and', 'the', 'ability', 'to', 'enhance', 'details', 'where', 'the', 'traditional', 'methods', 'failed']] | [-0.05034648627841047, -0.027191999364378196, -0.0967161091696471, 0.010789721422001354, -0.09822799693526967, -0.16734706342636074, 0.03739055200746017, 0.4240570242490087, -0.24531243427922683, -0.336112916740988, 0.10506537101564131, -0.2515318653014089, -0.19705945292886878, 0.22116686571522484, -0.12677644376243863, 0.12443158420867154, 0.05996914362202265, 0.01494118362132992, -0.03761055228549854, -0.23629828612719264, 0.21408276768800402, 0.11984290848885264, 0.39618428250508647, 0.01065110334860427, 0.09866099894445922, 0.013334961731369341, -0.06939823303371667, 0.009437013348298414, -0.05774050709234351, 0.12495131822835122, 0.278000086077622, 0.11581421713876937, 0.2989329910145274, -0.42490198022020714, -0.20733479217759201, 0.08269051049569888, 0.1686141919291445, 0.08436793910206429, -0.05959698176344058, -0.2718702470032232, 0.08656885386311582, -0.14958658919403595, -0.07244406686688308, -0.06405368325566607, -0.06483380165350225, 0.013939789897776791, -0.30158200701964755, 0.018896455128810236, 0.017471654723797525, 0.03633598045579025, -0.03886209152613966, -0.09846751963453633, 0.03524991145889674, 0.14862989965826273, 0.004586650329708521, 0.04275661511745836, 0.20410425798169204, -0.14399441886921913, -0.14317854611070027, 0.3671578658052853, -0.06825499210506678, -0.1589650525012985, 0.22878605854830572, -0.06542898752726614, -0.08834166988198246, 0.18101307519046322, 0.16693669811822473, 0.11961680107616952, -0.14352498445659875, 0.049124368968353205, 0.04931993190199137, 0.20839435216571603, 0.05019490495124566, 0.0595346995230232, 0.14293794918406222, 0.21523427287382738, 0.046593515826389195, 0.14234012882890446, -0.1699535895531465, -0.05975031190152679, -0.1750820677860507, -0.14774566867787922, -0.18207061280829034, -0.0635514612163284, -0.07805565920533679, -0.13607958458297487, 0.38957366710262636, 0.25807760971731375, 0.16109077963978052, 0.03463190102284508, 0.38828284007630176, 0.04755267806949892, 0.14247481793165206, 0.059152083243908624, 0.219908978374941, 0.03195135629968718, 0.19284777456428856, -0.24085274614792848, 0.07032526909639793, 0.028774607673819577] |
1,803.0004 | An integral control formulation of Mean-field game based large scale
coordination of loads in smart grids | Pressure on ancillary reserves, i.e.frequency preserving, in power systems
has significantly mounted due to the recent generalized increase of the
fraction of (highly fluctuating) wind and solar energy sources in grid
generation mixes. The energy storage associated with millions of individual
customer electric thermal (heating-cooling) loads is considered as a tool for
smoothing power demand/generation imbalances. The piecewise constant level
tracking problem of their collective energy content is formulated as a linear
quadratic mean field game problem with integral control in the cost
coefficients. The introduction of integral control brings with it a robustness
potential to mismodeling, but also the potential of cost coefficient
unboundedness. A suitable Banach space is introduced to establish the existence
of Nash equilibria for the corresponding infinite population game, and
algorithms are proposed for reliably computing a class of desirable near Nash
equilibria. Numerical simulations illustrate the flexibility and robustness of
the approach.
| cs.SY math.OC | pressure on ancillary reserves iefrequency preserving in power systems has significantly mounted due to the recent generalized increase of the fraction of highly fluctuating wind and solar energy sources in grid generation mixes the energy storage associated with millions of individual customer electric thermal heatingcooling loads is considered as a tool for smoothing power demandgeneration imbalances the piecewise constant level tracking problem of their collective energy content is formulated as a linear quadratic mean field game problem with integral control in the cost coefficients the introduction of integral control brings with it a robustness potential to mismodeling but also the potential of cost coefficient unboundedness a suitable banach space is introduced to establish the existence of nash equilibria for the corresponding infinite population game and algorithms are proposed for reliably computing a class of desirable near nash equilibria numerical simulations illustrate the flexibility and robustness of the approach | [['pressure', 'on', 'ancillary', 'reserves', 'iefrequency', 'preserving', 'in', 'power', 'systems', 'has', 'significantly', 'mounted', 'due', 'to', 'the', 'recent', 'generalized', 'increase', 'of', 'the', 'fraction', 'of', 'highly', 'fluctuating', 'wind', 'and', 'solar', 'energy', 'sources', 'in', 'grid', 'generation', 'mixes', 'the', 'energy', 'storage', 'associated', 'with', 'millions', 'of', 'individual', 'customer', 'electric', 'thermal', 'heatingcooling', 'loads', 'is', 'considered', 'as', 'a', 'tool', 'for', 'smoothing', 'power', 'demandgeneration', 'imbalances', 'the', 'piecewise', 'constant', 'level', 'tracking', 'problem', 'of', 'their', 'collective', 'energy', 'content', 'is', 'formulated', 'as', 'a', 'linear', 'quadratic', 'mean', 'field', 'game', 'problem', 'with', 'integral', 'control', 'in', 'the', 'cost', 'coefficients', 'the', 'introduction', 'of', 'integral', 'control', 'brings', 'with', 'it', 'a', 'robustness', 'potential', 'to', 'mismodeling', 'but', 'also', 'the', 'potential', 'of', 'cost', 'coefficient', 'unboundedness', 'a', 'suitable', 'banach', 'space', 'is', 'introduced', 'to', 'establish', 'the', 'existence', 'of', 'nash', 'equilibria', 'for', 'the', 'corresponding', 'infinite', 'population', 'game', 'and', 'algorithms', 'are', 'proposed', 'for', 'reliably', 'computing', 'a', 'class', 'of', 'desirable', 'near', 'nash', 'equilibria', 'numerical', 'simulations', 'illustrate', 'the', 'flexibility', 'and', 'robustness', 'of', 'the', 'approach']] | [-0.15178362492528952, 0.06689477350078143, -0.04752252080800886, 0.046156243334815765, -0.06698136409541884, -0.15066511941627048, 0.06509448385157553, 0.34642600343518315, -0.3013585280424275, -0.3315895983987317, 0.10050942150632008, -0.27444223960430747, -0.09960901906054949, 0.1802019015303813, -0.10103787144101194, 0.09474702317863196, 0.058492768261277556, 0.025235233524320076, 0.00839817643935355, -0.2531579619330563, 0.287353992786854, 0.1161324103595689, 0.2839934359222245, 0.04980700821568239, 0.13929833094811156, -0.024335479092955286, -0.02002136829328172, 0.05779750218522279, -0.07484103512766511, 0.12935997480304823, 0.26095031818286296, 0.09517824776046181, 0.35545998064763085, -0.40928865331826975, -0.2151549735667222, 0.14946837336787966, 0.08206718408369593, 0.04104244943429418, -0.07404199379201674, -0.20705125252177722, 0.060045798538018294, -0.19580640277641564, -0.17643276742361738, -0.10164459822319295, 7.144826207766119e-05, 0.08405932735296942, -0.31815072241378634, 0.06284222395462617, 0.00897319239348832, 0.0666224870016659, -0.11366839828005308, -0.10164710435838926, -0.06676056871878072, 0.1138362721136144, 0.031082413509348723, -0.014086507128347282, 0.16595513821891542, -0.14797716442381545, -0.09958256540192785, 0.3955531847365454, -0.05214298453790193, -0.20998510855193042, 0.15240698622390755, -0.08064779230285765, -0.0963033984659151, 0.1582168279355075, 0.20841923442852944, 0.10579784290839722, -0.13090572257203106, 0.0981219035757826, 0.01077231866478616, 0.14592580739123634, 0.042628060928134086, 0.061942545928339775, 0.1845123963493879, 0.150537527688988, 0.16891628599465908, 0.1617691966318557, -0.04480415199238642, -0.1629680102979321, -0.2457405929105217, -0.13180862940835203, -0.16149687062834903, 0.049209962702723736, -0.11485143664713116, -0.1697859438124341, 0.38143941629234523, 0.11631986894803185, 0.1082650037279644, 0.08649461515418881, 0.3275114699222502, 0.16098892832211326, 0.022213693294392226, 0.09448460114765025, 0.2087427504585587, 0.12907242918146306, 0.15596520458110513, -0.2756014632355726, 0.0766638038269336, 0.05489117106055321] |
1,803.00041 | Supersymmetric Janus solutions of dyonic $ISO(7)$-gauged
$\mathcal{N}\,=\,8$ supergravity | We study supersymmetric Janus solutions of dyonic $ISO(7)$-gauged
$\mathcal{N}$ = 8 supergravity. We mostly find Janus solutions flowing to 3d
$\mathcal{N}$ = 8 SYM phase which is the worldvolume theory on D2-branes and
non-conformal. There are also solutions flowing from the critical points which
are dual to 3d SCFTs from deformations of the D2-brane theory.
| hep-th | we study supersymmetric janus solutions of dyonic iso7gauged mathcaln 8 supergravity we mostly find janus solutions flowing to 3d mathcaln 8 sym phase which is the worldvolume theory on d2branes and nonconformal there are also solutions flowing from the critical points which are dual to 3d scfts from deformations of the d2brane theory | [['we', 'study', 'supersymmetric', 'janus', 'solutions', 'of', 'dyonic', 'iso7gauged', 'mathcaln', '8', 'supergravity', 'we', 'mostly', 'find', 'janus', 'solutions', 'flowing', 'to', '3d', 'mathcaln', '8', 'sym', 'phase', 'which', 'is', 'the', 'worldvolume', 'theory', 'on', 'd2branes', 'and', 'nonconformal', 'there', 'are', 'also', 'solutions', 'flowing', 'from', 'the', 'critical', 'points', 'which', 'are', 'dual', 'to', '3d', 'scfts', 'from', 'deformations', 'of', 'the', 'd2brane', 'theory']] | [-0.14283569094438392, 0.1574504619750839, -0.003971535443829803, 0.022156687858604036, -0.030746536132378075, -0.1831913421002145, -0.0842642119879691, 0.28984240503408587, -0.11136409683296314, -0.24599308176682547, 0.12745549731726685, -0.4191487715221368, -0.2520322927918572, 0.046288060382581674, -0.09231188242287877, 0.08011108185522832, -0.027736058324360505, -0.001875558272541429, -0.14199443496405506, -0.2519655924003858, 0.300619456720037, -0.11848566013101774, 0.2995022367327832, 0.021517592052427623, 0.08841769003237669, -0.08265866313349061, 0.06941705320675212, 0.039651451632380486, -0.20867940991257244, 0.13168954722081813, 0.25319828293644464, 0.06780910949545124, -0.025687971367285803, -0.5216534744160106, -0.18996196997781786, 0.07100317096158576, 0.2667120665562554, 0.18297117066909918, -0.01596512831075905, -0.27007506920311314, 0.0821596088532645, -0.16034942195535853, -0.14721697343226808, -0.05146787852908556, 0.03995437059515657, -0.08434886485785963, -0.22996979878427318, 0.048930657073259894, -0.06284407156412132, 0.07812735835949962, -0.10057374217117634, -0.006982802113410658, -0.1806845718708176, 0.0683918957097026, 0.18894375510997355, 0.10365758910148333, 0.19266409880051819, -0.257302389265253, -0.13191954042905799, 0.3119732304834403, 0.01136631566959505, -0.27054048451380086, 0.2246262019034475, -0.17108410677442756, -0.15748642560524437, 0.17203054231448242, 0.10249217896041675, 0.265033017033532, -0.11641263259718052, 0.2627401394185234, -0.06487295631534205, 0.1610738755776905, 0.11760414321906865, -0.0244617275087736, 0.3439539559901907, 0.1073530344113421, 0.07695685005455744, 0.18800140190153167, -0.018199401115103122, -0.14447420597291336, -0.45087254846182007, -0.0962510151305021, -0.049497695156158164, 0.1894615251893321, -0.19107230662232794, -0.21048227325081825, 0.32268165017908007, 0.12319976141980778, 0.11076045867342216, 0.03365197147762116, 0.12164608321080987, 0.057637080030802354, 0.06734148092353, 0.08646455499379394, 0.26773741363117903, 0.1295227373842723, 0.11530752398539335, -0.20800117064768878, -0.3255579258995847, 0.29806150839878964] |
1,803.00042 | Jet properties in PbPb and pp collisions at $\sqrt{s_\mathrm{NN}} =$
5.02 TeV | Modifications of the properties of jets in PbPb collisions, relative to those
in pp collisions, are studied at a nucleon-nucleon center-of-mass energy of
$\sqrt{s_\mathrm{NN}} =$ 5.02 TeV via correlations of charged particles with
the jet axis in relative pseudorapidity ($\Delta \eta$), relative azimuth
($\Delta \phi$), and relative angular distance from the jet axis $\Delta
\mathrm{r} = \sqrt{{(\Delta\eta)^{2}+(\Delta\phi)^{2}}}$. This analysis uses
data collected with the CMS detector at the LHC, corresponding to integrated
luminosities of 404 $\mu$b$^{-1}$ and 27.4 pb$^{-1}$ for PbPb and pp
collisions, respectively. Charged particle number densities, jet fragmentation
functions, and jet shapes are presented as a function of PbPb collision
centrality and charged-particle track transverse momentum, providing a
differential description of jet modifications due to interactions with the
quark-gluon plasma.
| nucl-ex hep-ex | modifications of the properties of jets in pbpb collisions relative to those in pp collisions are studied at a nucleonnucleon centerofmass energy of sqrts_mathrmnn 502 tev via correlations of charged particles with the jet axis in relative pseudorapidity delta eta relative azimuth delta phi and relative angular distance from the jet axis delta mathrmr sqrtdeltaeta2deltaphi2 this analysis uses data collected with the cms detector at the lhc corresponding to integrated luminosities of 404 mub1 and 274 pb1 for pbpb and pp collisions respectively charged particle number densities jet fragmentation functions and jet shapes are presented as a function of pbpb collision centrality and chargedparticle track transverse momentum providing a differential description of jet modifications due to interactions with the quarkgluon plasma | [['modifications', 'of', 'the', 'properties', 'of', 'jets', 'in', 'pbpb', 'collisions', 'relative', 'to', 'those', 'in', 'pp', 'collisions', 'are', 'studied', 'at', 'a', 'nucleonnucleon', 'centerofmass', 'energy', 'of', 'sqrts_mathrmnn', '502', 'tev', 'via', 'correlations', 'of', 'charged', 'particles', 'with', 'the', 'jet', 'axis', 'in', 'relative', 'pseudorapidity', 'delta', 'eta', 'relative', 'azimuth', 'delta', 'phi', 'and', 'relative', 'angular', 'distance', 'from', 'the', 'jet', 'axis', 'delta', 'mathrmr', 'sqrtdeltaeta2deltaphi2', 'this', 'analysis', 'uses', 'data', 'collected', 'with', 'the', 'cms', 'detector', 'at', 'the', 'lhc', 'corresponding', 'to', 'integrated', 'luminosities', 'of', '404', 'mub1', 'and', '274', 'pb1', 'for', 'pbpb', 'and', 'pp', 'collisions', 'respectively', 'charged', 'particle', 'number', 'densities', 'jet', 'fragmentation', 'functions', 'and', 'jet', 'shapes', 'are', 'presented', 'as', 'a', 'function', 'of', 'pbpb', 'collision', 'centrality', 'and', 'chargedparticle', 'track', 'transverse', 'momentum', 'providing', 'a', 'differential', 'description', 'of', 'jet', 'modifications', 'due', 'to', 'interactions', 'with', 'the', 'quarkgluon', 'plasma']] | [-0.08679387077184704, 0.20705869558635945, -0.17241066444985337, 0.12713363935763483, 0.00993116267103081, -0.07891110681618253, -0.16418040475497644, 0.38823440054353947, -0.17725665592976536, -0.36804846129380164, -0.12227099137283706, -0.41384935611858964, 0.21973597149675092, 0.1275776717957342, 0.09015695054937775, 0.14246927702333778, 0.1754496149214295, -0.02475157696462702, -0.07117897011036499, -0.12497408887914692, 0.25358957273031896, 0.14560166572531064, 0.17165864133276046, 0.16931781268600996, 0.10447037671789682, 0.1012489138811361, -0.06183534926967695, 0.011768553483610352, -0.15231479725662211, 0.050414379817326944, 0.2885153692453362, 0.016503045376157387, 0.11592653654164072, -0.30467912211703757, -0.015045515077993817, 0.13140957454840343, 0.1427593442145735, -0.007730159741671135, -0.04217372991067047, -0.2900695753089773, 0.13057832801277983, -0.29404977504940083, -0.15000097397714854, 0.05267730990890414, 0.08739408207669233, 0.0889818410621956, -0.296747087163385, 0.1892713690409437, -0.04914950220724374, 0.13826140080345795, -0.0022523425441856185, -0.1962883168676247, -0.14695605011268828, -0.07681816001034653, 0.10918499072237561, 0.17382771304401104, 0.2744801379740238, -0.15276776319466687, -0.19744010587843755, 0.36737176328121374, 0.09386149435692157, -0.14674330299409727, 0.22042175277601928, -0.22634709505364298, -0.08093610336460794, 0.20460263308680926, 0.3566336866468191, 0.06768127457859616, -0.22325587847541709, 0.012567780428313805, 0.02810132526792586, 0.17007696525348973, 0.14404871938750147, 0.09718235676991753, 0.14505885507872637, 0.1462382080188642, -0.01796181734680431, 0.0818529950765272, -0.18168643197665613, -0.06406695072849591, -0.45606401972472665, -0.06391026115355393, -0.08085788819783678, 0.03614803005572564, -0.11956768262449866, -0.004673317261040211, 0.36707499356319506, 0.030047244810217914, 0.38237642402915906, -0.022589174999545016, 0.2731467637854318, 0.047562232278869486, 0.03363615163446714, 0.16220534841607634, 0.30110475689483185, 0.1996664842920533, 0.28929733329763013, -0.2608430449249378, 0.0027303210343234243, 0.08808107648510485] |
1,803.00043 | A Data-Driven McMillan Degree Lower Bound | Given measurements of a linear time-invariant system, the McMillan degree is
the dimension of the smallest such system that reproduces these observed
dynamics. Using impulse response measurements where the system has been started
in some (unknown) state and then allowed to evolve freely, a classical result
by Ho and Kalman reveals the McMillan degree as the rank of a Hankel matrix
built from these measurements. However, if measurements are contaminated by
noise, this Hankel matrix will almost surely be full rank. Hence practitioners
often estimate the rank of this matrix---and thus the McMillan degree---by
manually setting a threshold between the large singular values that correspond
to the non-zero singular values of the noise-free Hankel matrix and the small
singular values that are pertubations of the zero singular values. Here we
introduce a probabilistic upper bound on the perturbation of the singular
values of this Hankel matrix when measurements are corrupted by additive
Gaussian noise, and hence provide guidance on setting the threshold to obtain a
lower bound on the McMillan degree. This result is powered by a new,
probabilistic bound on the 2-norm of a random Hankel matrix with normally
distributed entries. Unlike existing results for random Hankel matrices, this
bound features no unknown constants and, moreover, is within a small factor of
the empirically observed bound when entries are independent and identically
distributed. This bound on the McMillan degree provides an inexpensive
alternative to more general model order selection techniques such as the Akaike
Information Criteria (AIC).
| math.NA cs.NA | given measurements of a linear timeinvariant system the mcmillan degree is the dimension of the smallest such system that reproduces these observed dynamics using impulse response measurements where the system has been started in some unknown state and then allowed to evolve freely a classical result by ho and kalman reveals the mcmillan degree as the rank of a hankel matrix built from these measurements however if measurements are contaminated by noise this hankel matrix will almost surely be full rank hence practitioners often estimate the rank of this matrixand thus the mcmillan degreeby manually setting a threshold between the large singular values that correspond to the nonzero singular values of the noisefree hankel matrix and the small singular values that are pertubations of the zero singular values here we introduce a probabilistic upper bound on the perturbation of the singular values of this hankel matrix when measurements are corrupted by additive gaussian noise and hence provide guidance on setting the threshold to obtain a lower bound on the mcmillan degree this result is powered by a new probabilistic bound on the 2norm of a random hankel matrix with normally distributed entries unlike existing results for random hankel matrices this bound features no unknown constants and moreover is within a small factor of the empirically observed bound when entries are independent and identically distributed this bound on the mcmillan degree provides an inexpensive alternative to more general model order selection techniques such as the akaike information criteria aic | [['given', 'measurements', 'of', 'a', 'linear', 'timeinvariant', 'system', 'the', 'mcmillan', 'degree', 'is', 'the', 'dimension', 'of', 'the', 'smallest', 'such', 'system', 'that', 'reproduces', 'these', 'observed', 'dynamics', 'using', 'impulse', 'response', 'measurements', 'where', 'the', 'system', 'has', 'been', 'started', 'in', 'some', 'unknown', 'state', 'and', 'then', 'allowed', 'to', 'evolve', 'freely', 'a', 'classical', 'result', 'by', 'ho', 'and', 'kalman', 'reveals', 'the', 'mcmillan', 'degree', 'as', 'the', 'rank', 'of', 'a', 'hankel', 'matrix', 'built', 'from', 'these', 'measurements', 'however', 'if', 'measurements', 'are', 'contaminated', 'by', 'noise', 'this', 'hankel', 'matrix', 'will', 'almost', 'surely', 'be', 'full', 'rank', 'hence', 'practitioners', 'often', 'estimate', 'the', 'rank', 'of', 'this', 'matrixand', 'thus', 'the', 'mcmillan', 'degreeby', 'manually', 'setting', 'a', 'threshold', 'between', 'the', 'large', 'singular', 'values', 'that', 'correspond', 'to', 'the', 'nonzero', 'singular', 'values', 'of', 'the', 'noisefree', 'hankel', 'matrix', 'and', 'the', 'small', 'singular', 'values', 'that', 'are', 'pertubations', 'of', 'the', 'zero', 'singular', 'values', 'here', 'we', 'introduce', 'a', 'probabilistic', 'upper', 'bound', 'on', 'the', 'perturbation', 'of', 'the', 'singular', 'values', 'of', 'this', 'hankel', 'matrix', 'when', 'measurements', 'are', 'corrupted', 'by', 'additive', 'gaussian', 'noise', 'and', 'hence', 'provide', 'guidance', 'on', 'setting', 'the', 'threshold', 'to', 'obtain', 'a', 'lower', 'bound', 'on', 'the', 'mcmillan', 'degree', 'this', 'result', 'is', 'powered', 'by', 'a', 'new', 'probabilistic', 'bound', 'on', 'the', '2norm', 'of', 'a', 'random', 'hankel', 'matrix', 'with', 'normally', 'distributed', 'entries', 'unlike', 'existing', 'results', 'for', 'random', 'hankel', 'matrices', 'this', 'bound', 'features', 'no', 'unknown', 'constants', 'and', 'moreover', 'is', 'within', 'a', 'small', 'factor', 'of', 'the', 'empirically', 'observed', 'bound', 'when', 'entries', 'are', 'independent', 'and', 'identically', 'distributed', 'this', 'bound', 'on', 'the', 'mcmillan', 'degree', 'provides', 'an', 'inexpensive', 'alternative', 'to', 'more', 'general', 'model', 'order', 'selection', 'techniques', 'such', 'as', 'the', 'akaike', 'information', 'criteria', 'aic']] | [-0.11065672713897864, 0.12471970016704882, -0.05787465924101814, 0.05032713444452975, -0.07051781874445336, -0.16930115664646606, 0.06651928095995047, 0.32043617459135204, -0.2639696625992656, -0.2539828805332413, 0.1566612720763977, -0.28325497998848437, -0.1846287752943193, 0.16624836644916832, -0.06799421951504106, 0.08959526943244708, 0.039908243361098605, 0.087208580432154, -0.08860041315258457, -0.2822559302610277, 0.3308927176058353, 0.07291004536919508, 0.23203000694520892, -0.0055189379036608265, 0.09450484476737465, 0.0066445583252357394, -0.02182763756813133, -0.009812972985389756, -0.11396033112079779, 0.10766416836276317, 0.25943007959882025, 0.12416825242402914, 0.2724434759891857, -0.37073608970731436, -0.16666604608024765, 0.15994090394578814, 0.10699116077455806, 0.0886153110238625, -0.002926400406496709, -0.28351450808217554, 0.10798556419710319, -0.14851708712216705, -0.12706126017227193, -0.09135058075965692, 0.010474758367981701, 0.016233551877690856, -0.34901970615459044, 0.08744912462619443, 0.08036918581247603, 0.04951873107714393, -0.037102106867293726, -0.19984352295249094, 0.03664228724641347, 0.08257504709219235, 0.010009613293658457, -0.005117037681374335, 0.10876731577374768, -0.08086167862335962, -0.05802031842389757, 0.291099757428387, -0.07462133721749457, -0.23830389362434304, 0.1290176757119172, -0.1332734883762896, -0.10601831853817542, 0.12913166185106506, 0.15997216811903367, 0.09490786173711702, -0.13535368672207213, 0.10830365355189027, -0.091856626450175, 0.184445067054717, 0.06343734458919872, 0.04913424527555575, 0.12793119321387958, 0.07994603608238958, 0.10472697204516489, 0.11296024574089901, -0.04959632751694691, -0.055689604556362134, -0.2791722088340458, -0.09037958843798218, -0.2710660341923595, 0.07949696470627456, -0.1658668349610833, -0.19218557431434502, 0.36973751446217884, 0.13425496074714607, 0.24189171418396196, 0.0979867843235275, 0.31055018060833095, 0.14590274615495322, 0.03102961694382496, 0.08568027819794549, 0.21547156136932052, 0.1800658244647207, 0.04952096743357739, -0.15372190349669068, 0.117666987715501, 0.0789511629429502] |
1,803.00044 | Inferring the phase response curve from observation of a continuously
perturbed oscillator | Phase response curves are important for analysis and modeling of oscillatory
dynamics in various applications, particularly in neuroscience. Standard
experimental technique for determining them requires isolation of the system
and application of a specifically designed input. However, isolation is not
always feasible and we are compelled to observe the system in its natural
environment under free-running conditions. To that end we propose an approach
relying only on passive observations of the system and its input. We illustrate
it with simulation results of an oscillator driven by a stochastic force.
| nlin.AO q-bio.NC | phase response curves are important for analysis and modeling of oscillatory dynamics in various applications particularly in neuroscience standard experimental technique for determining them requires isolation of the system and application of a specifically designed input however isolation is not always feasible and we are compelled to observe the system in its natural environment under freerunning conditions to that end we propose an approach relying only on passive observations of the system and its input we illustrate it with simulation results of an oscillator driven by a stochastic force | [['phase', 'response', 'curves', 'are', 'important', 'for', 'analysis', 'and', 'modeling', 'of', 'oscillatory', 'dynamics', 'in', 'various', 'applications', 'particularly', 'in', 'neuroscience', 'standard', 'experimental', 'technique', 'for', 'determining', 'them', 'requires', 'isolation', 'of', 'the', 'system', 'and', 'application', 'of', 'a', 'specifically', 'designed', 'input', 'however', 'isolation', 'is', 'not', 'always', 'feasible', 'and', 'we', 'are', 'compelled', 'to', 'observe', 'the', 'system', 'in', 'its', 'natural', 'environment', 'under', 'freerunning', 'conditions', 'to', 'that', 'end', 'we', 'propose', 'an', 'approach', 'relying', 'only', 'on', 'passive', 'observations', 'of', 'the', 'system', 'and', 'its', 'input', 'we', 'illustrate', 'it', 'with', 'simulation', 'results', 'of', 'an', 'oscillator', 'driven', 'by', 'a', 'stochastic', 'force']] | [-0.12839474405287607, 0.07541471940309614, -0.09310845179964652, 0.02177684318818403, -0.05082350120398352, -0.15367135146025862, 0.03487326043888173, 0.4370076696524459, -0.24786946547918776, -0.30065678388633754, 0.1464123772104072, -0.23198968438389764, -0.22823031462226692, 0.26321730336823157, -0.07660548111654064, 0.0852972991186393, 0.07972820375138061, 0.03176323750077255, -0.010812896322145054, -0.19923784829718008, 0.3100374467733703, 0.058795856688632055, 0.2905001899049607, 0.003521815310572431, 0.12234164738316047, 0.006921991279474303, -0.014126953271249037, 0.012022282739871003, -0.09019874603779571, 0.1042586892968818, 0.21818517387080727, 0.14822118948580007, 0.2883522046960137, -0.4651385083417879, -0.19712499905838055, 0.09975398566477063, 0.12142134356551824, 0.1317577408992926, -0.07512785246323668, -0.25478340750246237, 0.07056956595919106, -0.14041053412712357, -0.11116149675707972, -0.12319701587456917, 0.014531723600341363, 0.026753594359812023, -0.28742247821470157, 0.03168657397997848, 0.0695590665982513, 0.0712267186053181, -0.0722746613286331, -0.044072484258782074, 0.019067292409070003, 0.154212576138337, -0.0016600324725208992, -0.01842592300303029, 0.16749979560315775, -0.15686086068855953, -0.08508181177587196, 0.3889207349294859, -0.06296120493233287, -0.19460818129643964, 0.2512433833097307, -0.10217289135822755, -0.11381429150763354, 0.09083034735947346, 0.19558441571451807, 0.10789403328776695, -0.17848536803313855, 0.03797482437286735, 0.014490325338719936, 0.1810616935404499, 0.0038162333618723945, 0.030773773407458925, 0.1704334082223182, 0.22086057079474578, 0.06010969849159481, 0.1608994241510884, -0.06376628940068238, -0.09927354083302316, -0.2865804128683685, -0.12503937399799653, -0.16045466674428976, 0.00429678580797607, -0.03412434006086289, -0.13609244687001357, 0.39048931599081904, 0.20206060565045375, 0.17156096610104601, 0.019952836718535826, 0.3455244864473182, 0.13343109478232232, 0.029748045431261652, 0.02699158587126752, 0.2457804155190674, 0.09973723992046095, 0.11199381878976239, -0.21594195772129832, 0.05874892177709033, -0.01972449089536506] |
1,803.00045 | Resource-Aware Min-Min (RAMM) Algorithm for Resource Allocation in Cloud
Computing Environment | Resource allocation (RA) is a significant aspect in Cloud Computing which
facilitates the Cloud resources to Cloud consumers as a metered service. The
Cloud resource manager is responsible to assign available resources to the
tasks for execution in an effective way that improves system performance,
reduce response time, reduce makespan and utilize resources efficiently. To
fulfil these objectives, an effective Tasks Scheduling algorithm is required.
The standard Min-Min and Max-Min Task Scheduling Algorithms are available, but
these algorithms are not able to produce better makespan and effective resource
utilization. This paper proposed a Resource-Aware Min-Min (RAMM) Algorithm
based on classic Min-Min Algorithm. The RAMM Algorithm selects shortest
execution time task and assign it to the resource which takes shortest
completion time. If minimum completion time resource is busy then the RAMM
Algorithm selects next minimum completion time resource to reduce waiting time
of task and better resource utilization. The experiment results show that the
RAMM Algorithm produces better makespan and load balance than standard Min-Min,
Max-Min and improved Max-Min Algorithms.
| cs.DC | resource allocation ra is a significant aspect in cloud computing which facilitates the cloud resources to cloud consumers as a metered service the cloud resource manager is responsible to assign available resources to the tasks for execution in an effective way that improves system performance reduce response time reduce makespan and utilize resources efficiently to fulfil these objectives an effective tasks scheduling algorithm is required the standard minmin and maxmin task scheduling algorithms are available but these algorithms are not able to produce better makespan and effective resource utilization this paper proposed a resourceaware minmin ramm algorithm based on classic minmin algorithm the ramm algorithm selects shortest execution time task and assign it to the resource which takes shortest completion time if minimum completion time resource is busy then the ramm algorithm selects next minimum completion time resource to reduce waiting time of task and better resource utilization the experiment results show that the ramm algorithm produces better makespan and load balance than standard minmin maxmin and improved maxmin algorithms | [['resource', 'allocation', 'ra', 'is', 'a', 'significant', 'aspect', 'in', 'cloud', 'computing', 'which', 'facilitates', 'the', 'cloud', 'resources', 'to', 'cloud', 'consumers', 'as', 'a', 'metered', 'service', 'the', 'cloud', 'resource', 'manager', 'is', 'responsible', 'to', 'assign', 'available', 'resources', 'to', 'the', 'tasks', 'for', 'execution', 'in', 'an', 'effective', 'way', 'that', 'improves', 'system', 'performance', 'reduce', 'response', 'time', 'reduce', 'makespan', 'and', 'utilize', 'resources', 'efficiently', 'to', 'fulfil', 'these', 'objectives', 'an', 'effective', 'tasks', 'scheduling', 'algorithm', 'is', 'required', 'the', 'standard', 'minmin', 'and', 'maxmin', 'task', 'scheduling', 'algorithms', 'are', 'available', 'but', 'these', 'algorithms', 'are', 'not', 'able', 'to', 'produce', 'better', 'makespan', 'and', 'effective', 'resource', 'utilization', 'this', 'paper', 'proposed', 'a', 'resourceaware', 'minmin', 'ramm', 'algorithm', 'based', 'on', 'classic', 'minmin', 'algorithm', 'the', 'ramm', 'algorithm', 'selects', 'shortest', 'execution', 'time', 'task', 'and', 'assign', 'it', 'to', 'the', 'resource', 'which', 'takes', 'shortest', 'completion', 'time', 'if', 'minimum', 'completion', 'time', 'resource', 'is', 'busy', 'then', 'the', 'ramm', 'algorithm', 'selects', 'next', 'minimum', 'completion', 'time', 'resource', 'to', 'reduce', 'waiting', 'time', 'of', 'task', 'and', 'better', 'resource', 'utilization', 'the', 'experiment', 'results', 'show', 'that', 'the', 'ramm', 'algorithm', 'produces', 'better', 'makespan', 'and', 'load', 'balance', 'than', 'standard', 'minmin', 'maxmin', 'and', 'improved', 'maxmin', 'algorithms']] | [-0.16135794389308156, -0.010131029405131223, -0.09933619284454515, 0.07537626579116263, -0.1407668069443282, -0.23669503900112912, 0.15925802960238583, 0.4431302674963851, -0.28911312934668626, -0.40487314716310185, 0.08129618198624539, -0.19216939503984415, -0.09966310286510954, 0.15564585550249938, -0.1646134337684249, 0.12223887034034465, 0.13632919963873813, 0.02980923368184663, 0.016858260551303187, -0.34475497606429545, 0.1746031968470882, 0.15657663206186365, 0.38624364271869555, 0.04581083480255021, 0.05668232029523043, -0.0016374650479787413, -0.02483879499246969, -0.03850062340497971, -0.058092254103479825, 0.1195084825884003, 0.32755788832026367, 0.2986488017554888, 0.3274489456349436, -0.42413916961454295, -0.13890872437589089, 0.15583090867080232, 0.14171454574885395, 0.012511438902412705, 0.03522028843529851, -0.20319088791661402, 0.09211549023714136, -0.18057993847109816, 0.01930664056802497, -0.0817188809516237, 0.026327479723840953, -0.01899012970560066, -0.3440814179395709, -0.011789864285075216, -0.037544869348023306, -0.05187976789825103, -0.08587326617391013, -0.13956549938644885, 0.07021718802040114, 0.155604967274977, 0.017836384929935722, 0.08048185238559895, 0.1667142717332086, -0.09897656552082694, -0.19960638660773197, 0.46113810806589967, 0.00807702110708787, -0.15174002130241954, 0.13531518434585235, 0.04513025070704958, -0.15886553231256959, 0.1277209849589888, 0.21643057291889015, 0.10548000008086948, -0.18943372343885986, 0.007810201608534793, -0.025618712045252325, 0.18668316148550196, 0.047534073634511405, 0.07202453389763833, 0.10243946924285197, 0.25340879432418767, 0.20553051165085942, 0.14859365207992276, -0.014430255288093843, -0.12839726233197485, -0.17845154631170718, -0.16835665141150136, -0.22407206659588744, -0.0441065119482707, -0.08624326239334872, -0.07442648093599608, 0.3656593837282237, 0.18855243306059172, 0.09712062360280577, 0.21245981140527875, 0.4233536312685293, 0.10950412483926972, 0.09631775652661043, 0.24443264192018166, 0.08937045737744911, -0.06161309695419143, 0.1856838799876106, -0.2992463945520713, 0.0883646449265892, 0.06930497080525931] |
1,803.00046 | Continuum contact models for coupled adhesion and friction | We develop two new continuum contact models for coupled adhesion and
friction, and discuss them in the context of existing models proposed in the
literature. Our new models are able to describe sliding friction even under
tensile normal forces, which seems reasonable for certain adhesion mechanisms.
In contrast, existing continuum models for combined adhesion and friction
typically include sliding friction only if local contact stresses are
compressive. Although such models work well for structures with sufficiently
strong local compression, they fail to capture sliding friction for soft and
compliant systems (like adhesive pads), for which the resistance to bending is
low. This can be overcome with our new models. For further motivation, we
additionally present experimental results for the onset of sliding of a smooth
glass plate on a smooth elastomer cap under low normal loads. As shown, the
findings from these experiments agree well with the results from our models. In
this paper we focus on the motivation and derivation of our continuum contact
models, and provide a corresponding literature survey. Their implementation in
a nonlinear finite element framework as well as the algorithmic treatment of
adhesion and friction will be discussed in future work.
| cs.CE | we develop two new continuum contact models for coupled adhesion and friction and discuss them in the context of existing models proposed in the literature our new models are able to describe sliding friction even under tensile normal forces which seems reasonable for certain adhesion mechanisms in contrast existing continuum models for combined adhesion and friction typically include sliding friction only if local contact stresses are compressive although such models work well for structures with sufficiently strong local compression they fail to capture sliding friction for soft and compliant systems like adhesive pads for which the resistance to bending is low this can be overcome with our new models for further motivation we additionally present experimental results for the onset of sliding of a smooth glass plate on a smooth elastomer cap under low normal loads as shown the findings from these experiments agree well with the results from our models in this paper we focus on the motivation and derivation of our continuum contact models and provide a corresponding literature survey their implementation in a nonlinear finite element framework as well as the algorithmic treatment of adhesion and friction will be discussed in future work | [['we', 'develop', 'two', 'new', 'continuum', 'contact', 'models', 'for', 'coupled', 'adhesion', 'and', 'friction', 'and', 'discuss', 'them', 'in', 'the', 'context', 'of', 'existing', 'models', 'proposed', 'in', 'the', 'literature', 'our', 'new', 'models', 'are', 'able', 'to', 'describe', 'sliding', 'friction', 'even', 'under', 'tensile', 'normal', 'forces', 'which', 'seems', 'reasonable', 'for', 'certain', 'adhesion', 'mechanisms', 'in', 'contrast', 'existing', 'continuum', 'models', 'for', 'combined', 'adhesion', 'and', 'friction', 'typically', 'include', 'sliding', 'friction', 'only', 'if', 'local', 'contact', 'stresses', 'are', 'compressive', 'although', 'such', 'models', 'work', 'well', 'for', 'structures', 'with', 'sufficiently', 'strong', 'local', 'compression', 'they', 'fail', 'to', 'capture', 'sliding', 'friction', 'for', 'soft', 'and', 'compliant', 'systems', 'like', 'adhesive', 'pads', 'for', 'which', 'the', 'resistance', 'to', 'bending', 'is', 'low', 'this', 'can', 'be', 'overcome', 'with', 'our', 'new', 'models', 'for', 'further', 'motivation', 'we', 'additionally', 'present', 'experimental', 'results', 'for', 'the', 'onset', 'of', 'sliding', 'of', 'a', 'smooth', 'glass', 'plate', 'on', 'a', 'smooth', 'elastomer', 'cap', 'under', 'low', 'normal', 'loads', 'as', 'shown', 'the', 'findings', 'from', 'these', 'experiments', 'agree', 'well', 'with', 'the', 'results', 'from', 'our', 'models', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'motivation', 'and', 'derivation', 'of', 'our', 'continuum', 'contact', 'models', 'and', 'provide', 'a', 'corresponding', 'literature', 'survey', 'their', 'implementation', 'in', 'a', 'nonlinear', 'finite', 'element', 'framework', 'as', 'well', 'as', 'the', 'algorithmic', 'treatment', 'of', 'adhesion', 'and', 'friction', 'will', 'be', 'discussed', 'in', 'future', 'work']] | [-0.0741991013596167, 0.10781610194220664, -0.0947400436888696, 0.029595867781163365, -0.07354235392520014, -0.1883586982113062, 0.02004898351983034, 0.4020732150232533, -0.2743671971221207, -0.2761760149887592, 0.10449992817213606, -0.23404895913863213, -0.2031376375365356, 0.22154996491379428, -0.09047912094951133, 0.0844563694851359, 0.055494201939187145, -0.027604489483750588, -0.013133202412769161, -0.20534518783394135, 0.2924244668790881, 0.04706046159132099, 0.2843631673366668, 0.10095244124519867, 0.06838724861510706, -0.015233575984151388, 0.0005513268537173161, 0.09439225010847084, -0.18373783673049895, 0.10487800647922772, 0.24217086715569686, -0.00780380377283313, 0.23751177500021092, -0.49332739854687635, -0.2641185217023808, 0.03747025760703207, 0.09104916358328595, 0.13132414605221426, -0.034689970767839425, -0.23693693644006034, 0.07799763910380923, -0.17038237815722823, -0.09140271265587958, -0.10060370374917604, -0.0006708045756178242, 0.07895976509595984, -0.24563560772649184, 0.0942949643441742, 0.07848935595378564, 0.05337260692494408, -0.136158990483655, -0.11319878052834574, 0.006530404978251199, 0.11998344628539469, 0.06737433517784146, 0.0064033538065090476, 0.17199601047364663, -0.1585247816033281, -0.07796898042802147, 0.4087055381482505, -0.03955162189691803, -0.2060984342135679, 0.2905865617497938, -0.07773024904095016, -0.11877063713606675, 0.10372500530769574, 0.2029087668028185, 0.08156995449276945, -0.14104880733244426, 0.01427965323329067, 0.007654440109332909, 0.13483716217724948, 0.050824101931149404, -0.04798594605158634, 0.21323284434572776, 0.22144905369543488, 0.03990007292868911, 0.12660223755591113, -0.09195627561400345, -0.07249918244351462, -0.33558829108785304, -0.13129549618211708, -0.12063907783796858, 0.008970740168089313, -0.0823997612942363, -0.1772436804703273, 0.31530672787660163, 0.16872554560006614, 0.20624452061732584, 0.12391124391685981, 0.30330730307067993, 0.04805142406732965, 0.0865946191693276, 0.03288413284641063, 0.29178056109230965, 0.11151500027721786, 0.08513083175651501, -0.18777519524363534, 0.07448227926185924, 0.014864155201821074] |
1,803.00047 | Analyzing Uncertainty in Neural Machine Translation | Machine translation is a popular test bed for research in neural
sequence-to-sequence models but despite much recent research, there is still a
lack of understanding of these models. Practitioners report performance
degradation with large beams, the under-estimation of rare words and a lack of
diversity in the final translations. Our study relates some of these issues to
the inherent uncertainty of the task, due to the existence of multiple valid
translations for a single source sentence, and to the extrinsic uncertainty
caused by noisy training data. We propose tools and metrics to assess how
uncertainty in the data is captured by the model distribution and how it
affects search strategies that generate translations. Our results show that
search works remarkably well but that models tend to spread too much
probability mass over the hypothesis space. Next, we propose tools to assess
model calibration and show how to easily fix some shortcomings of current
models. As part of this study, we release multiple human reference translations
for two popular benchmarks.
| cs.CL | machine translation is a popular test bed for research in neural sequencetosequence models but despite much recent research there is still a lack of understanding of these models practitioners report performance degradation with large beams the underestimation of rare words and a lack of diversity in the final translations our study relates some of these issues to the inherent uncertainty of the task due to the existence of multiple valid translations for a single source sentence and to the extrinsic uncertainty caused by noisy training data we propose tools and metrics to assess how uncertainty in the data is captured by the model distribution and how it affects search strategies that generate translations our results show that search works remarkably well but that models tend to spread too much probability mass over the hypothesis space next we propose tools to assess model calibration and show how to easily fix some shortcomings of current models as part of this study we release multiple human reference translations for two popular benchmarks | [['machine', 'translation', 'is', 'a', 'popular', 'test', 'bed', 'for', 'research', 'in', 'neural', 'sequencetosequence', 'models', 'but', 'despite', 'much', 'recent', 'research', 'there', 'is', 'still', 'a', 'lack', 'of', 'understanding', 'of', 'these', 'models', 'practitioners', 'report', 'performance', 'degradation', 'with', 'large', 'beams', 'the', 'underestimation', 'of', 'rare', 'words', 'and', 'a', 'lack', 'of', 'diversity', 'in', 'the', 'final', 'translations', 'our', 'study', 'relates', 'some', 'of', 'these', 'issues', 'to', 'the', 'inherent', 'uncertainty', 'of', 'the', 'task', 'due', 'to', 'the', 'existence', 'of', 'multiple', 'valid', 'translations', 'for', 'a', 'single', 'source', 'sentence', 'and', 'to', 'the', 'extrinsic', 'uncertainty', 'caused', 'by', 'noisy', 'training', 'data', 'we', 'propose', 'tools', 'and', 'metrics', 'to', 'assess', 'how', 'uncertainty', 'in', 'the', 'data', 'is', 'captured', 'by', 'the', 'model', 'distribution', 'and', 'how', 'it', 'affects', 'search', 'strategies', 'that', 'generate', 'translations', 'our', 'results', 'show', 'that', 'search', 'works', 'remarkably', 'well', 'but', 'that', 'models', 'tend', 'to', 'spread', 'too', 'much', 'probability', 'mass', 'over', 'the', 'hypothesis', 'space', 'next', 'we', 'propose', 'tools', 'to', 'assess', 'model', 'calibration', 'and', 'show', 'how', 'to', 'easily', 'fix', 'some', 'shortcomings', 'of', 'current', 'models', 'as', 'part', 'of', 'this', 'study', 'we', 'release', 'multiple', 'human', 'reference', 'translations', 'for', 'two', 'popular', 'benchmarks']] | [-0.05752773070707917, 0.05639745301522932, -0.057733279349800395, 0.13829242053011861, -0.09874089053947721, -0.1335673054250387, 0.07086364870075379, 0.41538512225114027, -0.2771695925132234, -0.35940551850669217, 0.10608015304566333, -0.2717405404487746, -0.1418121342337828, 0.20632870992151028, -0.13029846900622166, 0.0616624437647282, 0.12892393826799103, 0.0025945630189053407, -0.058949188168777825, -0.2662483230481178, 0.308689987179465, 0.07826683686539178, 0.340967312909817, 0.04483589639104682, 0.08914970925777665, -0.04748819629557034, -0.07500845829807443, -0.019018498032881477, -0.08297367516787793, 0.15725210949002913, 0.2671999659196552, 0.19645409962746518, 0.32439327459319456, -0.39187060621671777, -0.2328014495347202, 0.12136616299105202, 0.13206776350560273, 0.1300282964149501, -0.05356474148010361, -0.2957422653662272, 0.0765145334219505, -0.16546980569348532, -0.07839477223415788, -0.13291319728603024, 0.014892749517285349, -0.0007677708546487758, -0.2330458451175412, 0.04874280356311587, 0.09661380066908345, 0.06404777472430961, -0.04686282691270245, -0.10301106768390218, 0.018001421469059833, 0.15201802323599892, 0.13762114187836863, 0.06031152087445619, 0.11603839437273392, -0.15958641919227504, -0.14664916144739065, 0.4180253756910386, -0.051653942828254015, -0.24137919558730175, 0.2135881191703695, -0.1102200371913127, -0.15298542325638412, 0.05299301662746839, 0.21897052494621666, 0.07470180996357513, -0.17420749696930485, 0.016519124065140074, -0.009765483631846116, 0.19722763414786765, 0.027125058180415596, 0.013256184598320776, 0.21491721075320253, 0.1994063105412136, 0.004970697456689761, 0.125754625275428, -0.09171152626820041, -0.08694926938923771, -0.26104995714756796, -0.10841477577011073, -0.13048496975745322, 0.0062253433383020335, -0.046697898388591584, -0.15974958534710682, 0.3784945131687326, 0.26325966478408086, 0.18799987902104326, 0.08676685710277783, 0.31630783037629706, 0.02811296397789806, 0.09920334095306166, 0.06006564347303511, 0.1883398023177043, 0.034643670504075096, 0.08636790374225038, -0.17136957264125083, 0.11494941635335625, -0.015883061877099147] |
1,803.00048 | Automatic Labeling of the Object-oriented Source Code: The Lotus
Approach | Most of open-source software systems become available on the internet today.
Thus, we need automatic methods to label software code. Software code can be
labeled with a set of keywords. These keywords in this paper referred as
software labels. The goal of this paper is to provide a quick view of the
software code vocabulary. This paper proposes an automatic approach to document
the object-oriented software by labeling its code. The approach exploits all
software identifiers to label software code. The paper presents the results of
study conducted on the ArgoUML and drawing shapes case studies. Results showed
that all code labels were correctly identified.
| cs.SE | most of opensource software systems become available on the internet today thus we need automatic methods to label software code software code can be labeled with a set of keywords these keywords in this paper referred as software labels the goal of this paper is to provide a quick view of the software code vocabulary this paper proposes an automatic approach to document the objectoriented software by labeling its code the approach exploits all software identifiers to label software code the paper presents the results of study conducted on the argouml and drawing shapes case studies results showed that all code labels were correctly identified | [['most', 'of', 'opensource', 'software', 'systems', 'become', 'available', 'on', 'the', 'internet', 'today', 'thus', 'we', 'need', 'automatic', 'methods', 'to', 'label', 'software', 'code', 'software', 'code', 'can', 'be', 'labeled', 'with', 'a', 'set', 'of', 'keywords', 'these', 'keywords', 'in', 'this', 'paper', 'referred', 'as', 'software', 'labels', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'quick', 'view', 'of', 'the', 'software', 'code', 'vocabulary', 'this', 'paper', 'proposes', 'an', 'automatic', 'approach', 'to', 'document', 'the', 'objectoriented', 'software', 'by', 'labeling', 'its', 'code', 'the', 'approach', 'exploits', 'all', 'software', 'identifiers', 'to', 'label', 'software', 'code', 'the', 'paper', 'presents', 'the', 'results', 'of', 'study', 'conducted', 'on', 'the', 'argouml', 'and', 'drawing', 'shapes', 'case', 'studies', 'results', 'showed', 'that', 'all', 'code', 'labels', 'were', 'correctly', 'identified']] | [-0.09025604349937147, -0.03655907280993303, -0.04580633834792444, 0.03986227619372165, -0.12363945628301455, -0.16914026998431206, 0.011430537771397771, 0.4524455233835257, -0.2390220481689679, -0.37425254949798376, 0.10009877329419116, -0.2607143871450367, -0.1457738166477961, 0.22330001797168875, -0.13449463925252741, 0.10889497882957445, 0.18317370474911654, 0.021102667882727334, -0.010033794016075822, -0.2834891305358794, 0.3306203682620365, 0.11329434389391771, 0.2867747127870993, 0.04874070812589847, 0.034223693915499516, -0.02703037934015111, -0.14937183254649147, -0.01761940251946306, -0.1214212076271836, 0.17179646542689836, 0.3766171449365524, 0.3103626804569593, 0.3335140691622375, -0.36029375444811124, -0.1533762356207612, 0.02284101452320241, 0.1578501208423404, 0.16165315109090164, -0.013054374616611032, -0.2871718375491372, 0.12960471037345436, -0.2487643716583709, -0.0604756641237495, -0.05869266543931399, -0.05814715006496184, -0.0021269452744700876, -0.2034484202740714, -0.08658532087261286, 0.05847325639535064, 0.14818881848791185, -0.018170470030432064, -0.08740152883379218, -0.0026836424098851588, 0.1922120300049965, 0.05507053199107759, 0.09205643243219058, 0.09378918967782877, -0.08347741377432473, -0.15842769239456034, 0.4076823534157414, 0.02997866053528224, -0.19836760027884828, 0.19819639843794554, 0.019382013782608107, -0.19093198382044926, 0.09789275977975474, 0.24083993808464862, 0.08992738717307265, -0.24541298383085702, 0.07103359944113226, -0.00635432789567858, 0.24255760709862584, -0.007591841455835562, -0.031475026679870025, 0.18599408701993525, 0.19008185731273933, -0.04075366822787775, 0.1729751644564273, -0.03294787588618839, 0.007572504165671909, -0.26395749372806254, -0.18199397093401506, -0.17469361674962924, -0.04435878495076814, -0.020447220921806338, -0.26729530470374113, 0.4255822555591854, 0.26161176145811066, 0.07992252462113705, 0.08176804233405094, 0.35805734089360786, -0.04382458519704904, 0.1188627307688316, 0.1617832115645377, 0.06796099859862946, -0.026268644316587597, 0.1340515231176351, -0.14139430259372324, 0.12106547347502783, 0.07215172853410387] |
1,803.00049 | Autonomous Reconfiguration Procedures for EJB-based Enterprise
Applications | Enterprise Applications (EA) are complex software systems for supporting the
business of companies. Evolution of an EA should not affect its availability,
e.g., because of a temporal shutdown, business operations may be affected. One
possibility to address this problem is the seamless reconfiguration of the
affected EA, i.e., applying the relevant changes while the system is running.
Our approach to seamless reconfiguration focuses on component-oriented EAs. It
is based on the Autonomic Computing infrastructure mKernel that enables the
management of EAs that are realized using Enterprise Java Beans (EJB) 3.0
technology. In contrast to other approaches that provide no or only limited
reconfiguration facilities, our approach consists of a comprehensive set of
steps, that perform fine-grained reconfiguration tasks. These steps can be
combined into generic and autonomous reconfiguration procedures for EJB-based
EAs. The procedures are not limited to a certain reconfiguration strategy.
Instead, our approach provides several reusable strategies and is extensible
w.r.t. the opportunity to integrate new ones.
| cs.SE | enterprise applications ea are complex software systems for supporting the business of companies evolution of an ea should not affect its availability eg because of a temporal shutdown business operations may be affected one possibility to address this problem is the seamless reconfiguration of the affected ea ie applying the relevant changes while the system is running our approach to seamless reconfiguration focuses on componentoriented eas it is based on the autonomic computing infrastructure mkernel that enables the management of eas that are realized using enterprise java beans ejb 30 technology in contrast to other approaches that provide no or only limited reconfiguration facilities our approach consists of a comprehensive set of steps that perform finegrained reconfiguration tasks these steps can be combined into generic and autonomous reconfiguration procedures for ejbbased eas the procedures are not limited to a certain reconfiguration strategy instead our approach provides several reusable strategies and is extensible wrt the opportunity to integrate new ones | [['enterprise', 'applications', 'ea', 'are', 'complex', 'software', 'systems', 'for', 'supporting', 'the', 'business', 'of', 'companies', 'evolution', 'of', 'an', 'ea', 'should', 'not', 'affect', 'its', 'availability', 'eg', 'because', 'of', 'a', 'temporal', 'shutdown', 'business', 'operations', 'may', 'be', 'affected', 'one', 'possibility', 'to', 'address', 'this', 'problem', 'is', 'the', 'seamless', 'reconfiguration', 'of', 'the', 'affected', 'ea', 'ie', 'applying', 'the', 'relevant', 'changes', 'while', 'the', 'system', 'is', 'running', 'our', 'approach', 'to', 'seamless', 'reconfiguration', 'focuses', 'on', 'componentoriented', 'eas', 'it', 'is', 'based', 'on', 'the', 'autonomic', 'computing', 'infrastructure', 'mkernel', 'that', 'enables', 'the', 'management', 'of', 'eas', 'that', 'are', 'realized', 'using', 'enterprise', 'java', 'beans', 'ejb', '30', 'technology', 'in', 'contrast', 'to', 'other', 'approaches', 'that', 'provide', 'no', 'or', 'only', 'limited', 'reconfiguration', 'facilities', 'our', 'approach', 'consists', 'of', 'a', 'comprehensive', 'set', 'of', 'steps', 'that', 'perform', 'finegrained', 'reconfiguration', 'tasks', 'these', 'steps', 'can', 'be', 'combined', 'into', 'generic', 'and', 'autonomous', 'reconfiguration', 'procedures', 'for', 'ejbbased', 'eas', 'the', 'procedures', 'are', 'not', 'limited', 'to', 'a', 'certain', 'reconfiguration', 'strategy', 'instead', 'our', 'approach', 'provides', 'several', 'reusable', 'strategies', 'and', 'is', 'extensible', 'wrt', 'the', 'opportunity', 'to', 'integrate', 'new', 'ones']] | [-0.15476024315164538, 0.05673412808632718, -0.06905129922636945, 0.03270915551422532, -0.1121581899221678, -0.15775050693280568, 0.03846137237491881, 0.4272534438604667, -0.24955736133299625, -0.3460184735880726, 0.11715405047233483, -0.21922955869335184, -0.12087458105176498, 0.2327108385655317, -0.10067264653169876, 0.05835740145401151, 0.1107471769313761, -0.028190555724064717, -0.024607856395345917, -0.2613732651903763, 0.2632048249387058, 0.05932728272483085, 0.3196630947852424, 0.06895176820741718, 0.05028477683959968, 0.0034585263873717397, -0.06270547971651433, 0.0032474367914923055, -0.02427369668567405, 0.15904371871559764, 0.3226025354304013, 0.25328458017806055, 0.3180727994864344, -0.4671495525273168, -0.1683095407903574, 0.07225089340773262, 0.1477682293695064, 0.048011345904510304, 0.013832755073916856, -0.26005065778958475, 0.12470265529800657, -0.21179396615832285, -0.10013292079856678, -0.11369872782201429, -0.016535021472576957, 0.023060892957372438, -0.2758575454591566, -0.05881969300899536, 0.04435456129811277, 0.06333888500964471, -0.030431069194184986, -0.086070813406941, 0.01768714096693761, 0.1676588903083377, 0.004361958969621712, 0.027877659008950943, 0.19871548932285943, -0.10796711870371276, -0.1662807289057168, 0.390435646222845, 0.04244919301227186, -0.1486028094603947, 0.22814588059944094, -0.006437267494168441, -0.18292772896872583, 0.11789956268228614, 0.18053097826588876, 0.1066662705589418, -0.21931359468170317, 0.07344729786629012, 0.06349005702487044, 0.18819233826153978, 0.004151741170270997, 0.009442545173268552, 0.21158189861590315, 0.2769300816284054, 0.12764116944923143, 0.10334656016706863, -0.003122332452493868, -0.10827035755571571, -0.23650197956524197, -0.14264875742351743, -0.1360547254128963, 0.0012279322082072994, -0.04894017068662526, -0.16871442792827418, 0.39468039321908904, 0.21904173988780706, 0.10381766145894672, 0.036617194478856814, 0.3676869497177707, 0.059850100278175895, 0.13291668902287723, 0.10402823962674589, 0.16248859099711582, -0.021194103971764352, 0.1797152751252933, -0.21167072766626574, 0.1436007795277034, -0.015403429003266297] |
1,803.0005 | N=1 Supercurrents of Eleven-dimensional Supergravity | Eleven-dimensional supergravity can be formulated in superspaces locally of
the form $\mathbf X\times Y$ where $\mathbf X$ is 4D $N=1$ conformal superspace
and $Y$ is an arbitrary 7-manifold admitting a $G_2$-structure. The
eleven-dimensional 3-form and the stable 3-form on $Y$ define the lowest
component of a gauge superfield on $\mathbf X \times Y$ that is chiral as a
superfield on $\mathbf X$. This chiral field is part of a tensor hierarchy
giving rise to a superspace Chern-Simons action and its real field strength
defines a lifting of the Hitchin functional on $Y$ to the $G_2$ superspace
$\mathbf X\times Y$. These terms are those of lowest order in a superspace
Noether expansion in seven $N=1$ conformal gravitino superfields $\Psi$. In
this paper, we compute the $O(\Psi)$ action to all orders in the remaining
fields. The eleven-dimensional origin of the resulting non-linear structures is
parameterized by the choice of a complex spinor on $Y$ encoding the off-shell
4D $N=1$ subalgebra of the eleven-dimensional super-Poincare algebra.
| hep-th | elevendimensional supergravity can be formulated in superspaces locally of the form mathbf xtimes y where mathbf x is 4d n1 conformal superspace and y is an arbitrary 7manifold admitting a g_2structure the elevendimensional 3form and the stable 3form on y define the lowest component of a gauge superfield on mathbf x times y that is chiral as a superfield on mathbf x this chiral field is part of a tensor hierarchy giving rise to a superspace chernsimons action and its real field strength defines a lifting of the hitchin functional on y to the g_2 superspace mathbf xtimes y these terms are those of lowest order in a superspace noether expansion in seven n1 conformal gravitino superfields psi in this paper we compute the opsi action to all orders in the remaining fields the elevendimensional origin of the resulting nonlinear structures is parameterized by the choice of a complex spinor on y encoding the offshell 4d n1 subalgebra of the elevendimensional superpoincare algebra | [['elevendimensional', 'supergravity', 'can', 'be', 'formulated', 'in', 'superspaces', 'locally', 'of', 'the', 'form', 'mathbf', 'xtimes', 'y', 'where', 'mathbf', 'x', 'is', '4d', 'n1', 'conformal', 'superspace', 'and', 'y', 'is', 'an', 'arbitrary', '7manifold', 'admitting', 'a', 'g_2structure', 'the', 'elevendimensional', '3form', 'and', 'the', 'stable', '3form', 'on', 'y', 'define', 'the', 'lowest', 'component', 'of', 'a', 'gauge', 'superfield', 'on', 'mathbf', 'x', 'times', 'y', 'that', 'is', 'chiral', 'as', 'a', 'superfield', 'on', 'mathbf', 'x', 'this', 'chiral', 'field', 'is', 'part', 'of', 'a', 'tensor', 'hierarchy', 'giving', 'rise', 'to', 'a', 'superspace', 'chernsimons', 'action', 'and', 'its', 'real', 'field', 'strength', 'defines', 'a', 'lifting', 'of', 'the', 'hitchin', 'functional', 'on', 'y', 'to', 'the', 'g_2', 'superspace', 'mathbf', 'xtimes', 'y', 'these', 'terms', 'are', 'those', 'of', 'lowest', 'order', 'in', 'a', 'superspace', 'noether', 'expansion', 'in', 'seven', 'n1', 'conformal', 'gravitino', 'superfields', 'psi', 'in', 'this', 'paper', 'we', 'compute', 'the', 'opsi', 'action', 'to', 'all', 'orders', 'in', 'the', 'remaining', 'fields', 'the', 'elevendimensional', 'origin', 'of', 'the', 'resulting', 'nonlinear', 'structures', 'is', 'parameterized', 'by', 'the', 'choice', 'of', 'a', 'complex', 'spinor', 'on', 'y', 'encoding', 'the', 'offshell', '4d', 'n1', 'subalgebra', 'of', 'the', 'elevendimensional', 'superpoincare', 'algebra']] | [-0.21755590664084862, 0.1434534633357723, 0.002910663572824158, 0.01803009083026008, -0.14359539525330434, -0.12870357804471788, -0.08170443992231065, 0.33949737057354257, -0.2107814363071718, -0.17234231061000307, 0.054461295040249595, -0.27503493172978916, -0.1641551064712536, 0.046977158480634294, -0.10314276428709243, -0.040768732207922126, -0.05526533381823726, 0.12397279148996106, -0.1580131705146122, -0.3164836659360631, 0.3447591156158366, -0.09876257841141871, 0.22392520932681906, -0.03718802729251623, 0.21807839974824247, -0.0170123141379682, 0.053688659269454674, -0.06437662636493276, -0.08322393746614883, 0.1382580409789412, 0.27019567807193523, 0.07634523309918874, 0.08223645285887207, -0.3941131647285304, -0.16145352681201916, 0.1299548492476597, 0.20231687044724822, 0.012768659441743367, 0.06872139364713803, -0.29579389432192216, 0.045495225011693015, -0.1468955822095683, -0.1320741566618111, -0.1225712152203706, 0.0787504866681878, -0.1325553864942013, -0.27876912808350435, 0.03679360207716394, 0.05037322776452466, 0.06512073094289704, -0.0680272088186344, -0.10972832133533594, -0.18670532527885594, 0.016442789762269382, 0.07500255868028573, 0.1925618103849069, 0.13506863846078537, -0.13925666724515642, -0.10551814199137835, 0.3738724383307092, -0.10727827175431252, -0.3081153258336363, 0.048065677707738896, -0.1551077890606528, -0.20223003865886527, 0.12309245147992408, 0.075633689387483, 0.2191379984817755, -0.10482001762706383, 0.3468311429659715, -0.04946968903338226, 0.0913475143685822, 0.09511162649213487, 0.0002061653117660755, 0.19460228260266624, 0.07787320666434819, 0.07720600716722267, 0.06155038911225504, 0.02952757546028559, -0.023325326345878205, -0.48043458765073693, -0.18441251523355828, -0.08317280111383119, 0.2220823088126188, -0.18193737078247157, -0.14416861820701557, 0.39376614085128414, 0.0571880360034418, 0.18058933638629826, 0.04405979683082321, 0.18806887882974366, 0.11622689425137561, 0.050628061948867265, 0.0054943446274041945, 0.16393746039075605, 0.25132280507090465, 0.02703853017207879, -0.20568541855907735, -0.16581073827052742, 0.24162718401140287] |
1,803.00051 | Time-Dependent Strain in Graphene | We will analyse the effect of time-dependent strain on a sheet of graphene by
using the field theory approach. It will be demonstrated that in the continuum
limit, such a strain will induce a non-abelian gauge field in graphene. We will
analyse the effective field theory of such system near the Dirac points and
study its topological properties.
| cond-mat.mes-hall hep-th | we will analyse the effect of timedependent strain on a sheet of graphene by using the field theory approach it will be demonstrated that in the continuum limit such a strain will induce a nonabelian gauge field in graphene we will analyse the effective field theory of such system near the dirac points and study its topological properties | [['we', 'will', 'analyse', 'the', 'effect', 'of', 'timedependent', 'strain', 'on', 'a', 'sheet', 'of', 'graphene', 'by', 'using', 'the', 'field', 'theory', 'approach', 'it', 'will', 'be', 'demonstrated', 'that', 'in', 'the', 'continuum', 'limit', 'such', 'a', 'strain', 'will', 'induce', 'a', 'nonabelian', 'gauge', 'field', 'in', 'graphene', 'we', 'will', 'analyse', 'the', 'effective', 'field', 'theory', 'of', 'such', 'system', 'near', 'the', 'dirac', 'points', 'and', 'study', 'its', 'topological', 'properties']] | [-0.1879196167473906, 0.16336958463592777, -0.11619538990459566, 0.044104265731534566, -0.019215931473621006, -0.0608719759781299, 0.05587661670569073, 0.39323497647098427, -0.2568832886052029, -0.25406683660272894, 0.07712516278943754, -0.24745882732857918, -0.24879330345268907, 0.17717202797788997, -0.027044560575600844, 0.003573698054894741, 0.01663791513520068, 0.023943911993009007, -0.07797012225612356, -0.2061961051718942, 0.30781599196830184, 0.02770872308134005, 0.3018373774629536, 0.08059047972622874, 0.047121248818163215, 0.01707189209389918, 0.030156593882189744, 0.1188672321270509, -0.1523778969227539, 0.08278284131966789, 0.17552678175832562, -0.02010239414260562, 0.23548327081290812, -0.47048405037614804, -0.2270407511146161, 0.03085940220425355, 0.11142399131545219, 0.1870817069991909, -0.03612049270204493, -0.3024162769895689, 0.10042615745473525, -0.1411799135906943, -0.18613251037132958, -0.10658907628586066, -0.013110838439074698, -0.02011238549563006, -0.21718008662092275, 0.013802297972845202, 0.0011935959939427417, 0.06635347207815483, -0.06904140159142493, -0.04360333332141604, -0.07519323156407938, 0.06531055482778826, 0.06762636828653772, 0.050672540557570755, 0.20907702963349634, -0.1859140197650112, -0.10621695445272429, 0.3986144716498153, -0.13073038653037028, -0.1693614101486987, 0.1568140303073772, -0.16688606281893265, -0.09993287211219812, 0.08445756120510914, 0.18529881052030572, 0.10131146315613697, -0.13861923576493201, 0.17407391825590507, -0.024995630141347647, 0.10889701079577208, 0.02616296260585559, 0.04145861901182296, 0.2985167468030905, 0.17333189838019938, 0.08394038317532375, 0.12868199530780186, -0.11425815496577657, -0.010190800518793022, -0.31800362043853464, -0.2048340138401194, -0.1964517550559008, 0.12754259905993642, -0.056076530910825664, -0.20401879611168186, 0.43759330240046157, 0.21400755984259062, 0.11455792612556753, -0.04607533649059719, 0.19647361729936352, 0.17392058904957156, 0.06459841420392282, -0.007866207124858067, 0.2957005477189247, 0.1755004019099127, 0.09430295644038968, -0.22715580823092624, -0.09672874086215322, 0.05703827745184816] |
1,803.00052 | Evolving Chaos: Identifying New Attractors of the Generalised Lorenz
Family | In a recent paper, we presented an intelligent evolutionary search technique
through genetic programming (GP) for finding new analytical expressions of
nonlinear dynamical systems, similar to the classical Lorenz attractor's which
also exhibit chaotic behaviour in the phase space. In this paper, we extend our
previous finding to explore yet another gallery of new chaotic attractors which
are derived from the original Lorenz system of equations. Compared to the
previous exploration with sinusoidal type transcendental nonlinearity, here we
focus on only cross-product and higher-power type nonlinearities in the three
state equations. We here report over 150 different structures of chaotic
attractors along with their one set of parameter values, phase space dynamics
and the Largest Lyapunov Exponents (LLE). The expressions of these new
Lorenz-like nonlinear dynamical systems have been automatically evolved through
multi-gene genetic programming (MGGP). In the past two decades, there have been
many claims of designing new chaotic attractors as an incremental extension of
the Lorenz family. We provide here a large family of chaotic systems whose
structure closely resemble the original Lorenz system but with drastically
different phase space dynamics. This advances the state of the art knowledge of
discovering new chaotic systems which can find application in many real-world
problems. This work may also find its archival value in future in the domain of
new chaotic system discovery.
| nlin.CD cs.NE | in a recent paper we presented an intelligent evolutionary search technique through genetic programming gp for finding new analytical expressions of nonlinear dynamical systems similar to the classical lorenz attractors which also exhibit chaotic behaviour in the phase space in this paper we extend our previous finding to explore yet another gallery of new chaotic attractors which are derived from the original lorenz system of equations compared to the previous exploration with sinusoidal type transcendental nonlinearity here we focus on only crossproduct and higherpower type nonlinearities in the three state equations we here report over 150 different structures of chaotic attractors along with their one set of parameter values phase space dynamics and the largest lyapunov exponents lle the expressions of these new lorenzlike nonlinear dynamical systems have been automatically evolved through multigene genetic programming mggp in the past two decades there have been many claims of designing new chaotic attractors as an incremental extension of the lorenz family we provide here a large family of chaotic systems whose structure closely resemble the original lorenz system but with drastically different phase space dynamics this advances the state of the art knowledge of discovering new chaotic systems which can find application in many realworld problems this work may also find its archival value in future in the domain of new chaotic system discovery | [['in', 'a', 'recent', 'paper', 'we', 'presented', 'an', 'intelligent', 'evolutionary', 'search', 'technique', 'through', 'genetic', 'programming', 'gp', 'for', 'finding', 'new', 'analytical', 'expressions', 'of', 'nonlinear', 'dynamical', 'systems', 'similar', 'to', 'the', 'classical', 'lorenz', 'attractors', 'which', 'also', 'exhibit', 'chaotic', 'behaviour', 'in', 'the', 'phase', 'space', 'in', 'this', 'paper', 'we', 'extend', 'our', 'previous', 'finding', 'to', 'explore', 'yet', 'another', 'gallery', 'of', 'new', 'chaotic', 'attractors', 'which', 'are', 'derived', 'from', 'the', 'original', 'lorenz', 'system', 'of', 'equations', 'compared', 'to', 'the', 'previous', 'exploration', 'with', 'sinusoidal', 'type', 'transcendental', 'nonlinearity', 'here', 'we', 'focus', 'on', 'only', 'crossproduct', 'and', 'higherpower', 'type', 'nonlinearities', 'in', 'the', 'three', 'state', 'equations', 'we', 'here', 'report', 'over', '150', 'different', 'structures', 'of', 'chaotic', 'attractors', 'along', 'with', 'their', 'one', 'set', 'of', 'parameter', 'values', 'phase', 'space', 'dynamics', 'and', 'the', 'largest', 'lyapunov', 'exponents', 'lle', 'the', 'expressions', 'of', 'these', 'new', 'lorenzlike', 'nonlinear', 'dynamical', 'systems', 'have', 'been', 'automatically', 'evolved', 'through', 'multigene', 'genetic', 'programming', 'mggp', 'in', 'the', 'past', 'two', 'decades', 'there', 'have', 'been', 'many', 'claims', 'of', 'designing', 'new', 'chaotic', 'attractors', 'as', 'an', 'incremental', 'extension', 'of', 'the', 'lorenz', 'family', 'we', 'provide', 'here', 'a', 'large', 'family', 'of', 'chaotic', 'systems', 'whose', 'structure', 'closely', 'resemble', 'the', 'original', 'lorenz', 'system', 'but', 'with', 'drastically', 'different', 'phase', 'space', 'dynamics', 'this', 'advances', 'the', 'state', 'of', 'the', 'art', 'knowledge', 'of', 'discovering', 'new', 'chaotic', 'systems', 'which', 'can', 'find', 'application', 'in', 'many', 'realworld', 'problems', 'this', 'work', 'may', 'also', 'find', 'its', 'archival', 'value', 'in', 'future', 'in', 'the', 'domain', 'of', 'new', 'chaotic', 'system', 'discovery']] | [-0.16237613099086023, 0.09310833721850088, -0.10150289346367228, 0.031198213731152686, -0.0910093792554763, -0.14090837807885395, 0.022093561871778557, 0.2944588047582845, -0.2958550631207087, -0.28832821206290377, 0.12090537145991835, -0.24821734183828706, -0.2569719710311777, 0.24333205386924953, -0.05295685998128458, 0.10660658911122785, 0.05733342963870749, -0.0030870643568378328, -0.057206411500931253, -0.25308029576905305, 0.3267438873430496, -0.016460012610968168, 0.22998838764636334, -0.07172090490558394, 0.07978942531983259, -0.06050862495993004, -0.01194884312162931, 0.0069262735344530375, -0.14459513775311592, 0.10626625608409511, 0.23047103969850116, 0.1393986268289941, 0.2763599090305417, -0.40025436907989886, -0.24531643428244032, 0.13048600709602773, 0.18200932369097597, 0.13358885775842527, -0.05794584343675524, -0.30817814715844283, 0.04348910582615776, -0.14948179515661789, -0.15044816407408598, -0.12405171824686297, 0.04566548051111199, 0.04305187994110826, -0.20085109669902898, 0.04413572993094882, 0.05652489013071088, 0.0983367290773622, -0.07896274895992482, -0.10316841527955976, -0.01817932217759458, 0.09381280255688539, 0.027257289731170278, 0.002302494772651174, 0.07988246957799536, -0.10557180136412818, -0.16428742650057282, 0.3266002102602936, -0.05885393387975742, -0.18939390905025238, 0.2568057727997888, -0.13182206721640788, -0.18830383533972675, 0.13674962839430516, 0.219705390922205, 0.11308139401513177, -0.19154435643105064, 0.08258776013007355, -0.04570304484500944, 0.17235172353265388, 0.04259362054762204, 0.060191316445681126, 0.1844416161976033, 0.19622000279917112, 0.04616846614108245, 0.15222683527951572, -0.02263980687948296, -0.1815049176876274, -0.23838089205962312, -0.1166611161210935, -0.12341624340420035, 0.023192608721663354, -0.09249440093746572, -0.20014044632799588, 0.44310313029642645, 0.1739255818110987, 0.18720821560117173, 0.044359534791658155, 0.25570643881990296, 0.10620114283783305, 0.02584588233861854, 0.06651168418544773, 0.266793304110399, 0.06185164614706426, 0.14903896620973256, -0.21869801687651422, 0.042094747163040715, 0.06651355843135756] |
1,803.00053 | Hybrid Wavelet and EMD/ICA Approach for Artifact Suppression in
Pervasive EEG | Electroencephalogram (EEG) signals are often corrupted with unintended
artifacts which need to be removed for extracting meaningful clinical
information from them. Typically a priori knowledge of the nature of the
artifacts is needed for such purpose. Artifact contamination of EEG is even
more prominent for pervasive EEG systems where the subjects are free to move
and thereby introducing a wide variety of motion-related artifacts. This makes
hard to get a priori knowledge about their characteristics rendering
conventional artifact removal techniques often ineffective. In this paper, we
explore the performance of two hybrid artifact removal algorithms: Wavelet
packet transform followed by Independent Component Analysis (WPTICA) and
Wavelet Packet Transform followed by Empirical Mode Decomposition (WPTEMD) in
pervasive EEG recording scenario, assuming existence of no a priori knowledge
about the artifacts and compare their performance with two existing artifact
removal algorithms. Artifact cleaning performance has been measured using Root
Mean Square Error (RMSE) and Artifact to Signal Ratio (ASR) - an index similar
to traditional Signal to Noise Ratio (SNR), and also by observing normalized
power distribution topography over the scalp. Comparison has been made first
using semi-simulated signals and then with real experimentally acquired EEG
data with commercially available 19-channel pervasive EEG system Enobio
corrupted by eight types of artifact. Our explorations show that WPTEMD
consistently gives best artifact cleaning performance not only in
semi-simulated scenario but also in the case of real EEG data containing
artifacts.
| physics.med-ph cs.CE physics.bio-ph stat.AP | electroencephalogram eeg signals are often corrupted with unintended artifacts which need to be removed for extracting meaningful clinical information from them typically a priori knowledge of the nature of the artifacts is needed for such purpose artifact contamination of eeg is even more prominent for pervasive eeg systems where the subjects are free to move and thereby introducing a wide variety of motionrelated artifacts this makes hard to get a priori knowledge about their characteristics rendering conventional artifact removal techniques often ineffective in this paper we explore the performance of two hybrid artifact removal algorithms wavelet packet transform followed by independent component analysis wptica and wavelet packet transform followed by empirical mode decomposition wptemd in pervasive eeg recording scenario assuming existence of no a priori knowledge about the artifacts and compare their performance with two existing artifact removal algorithms artifact cleaning performance has been measured using root mean square error rmse and artifact to signal ratio asr an index similar to traditional signal to noise ratio snr and also by observing normalized power distribution topography over the scalp comparison has been made first using semisimulated signals and then with real experimentally acquired eeg data with commercially available 19channel pervasive eeg system enobio corrupted by eight types of artifact our explorations show that wptemd consistently gives best artifact cleaning performance not only in semisimulated scenario but also in the case of real eeg data containing artifacts | [['electroencephalogram', 'eeg', 'signals', 'are', 'often', 'corrupted', 'with', 'unintended', 'artifacts', 'which', 'need', 'to', 'be', 'removed', 'for', 'extracting', 'meaningful', 'clinical', 'information', 'from', 'them', 'typically', 'a', 'priori', 'knowledge', 'of', 'the', 'nature', 'of', 'the', 'artifacts', 'is', 'needed', 'for', 'such', 'purpose', 'artifact', 'contamination', 'of', 'eeg', 'is', 'even', 'more', 'prominent', 'for', 'pervasive', 'eeg', 'systems', 'where', 'the', 'subjects', 'are', 'free', 'to', 'move', 'and', 'thereby', 'introducing', 'a', 'wide', 'variety', 'of', 'motionrelated', 'artifacts', 'this', 'makes', 'hard', 'to', 'get', 'a', 'priori', 'knowledge', 'about', 'their', 'characteristics', 'rendering', 'conventional', 'artifact', 'removal', 'techniques', 'often', 'ineffective', 'in', 'this', 'paper', 'we', 'explore', 'the', 'performance', 'of', 'two', 'hybrid', 'artifact', 'removal', 'algorithms', 'wavelet', 'packet', 'transform', 'followed', 'by', 'independent', 'component', 'analysis', 'wptica', 'and', 'wavelet', 'packet', 'transform', 'followed', 'by', 'empirical', 'mode', 'decomposition', 'wptemd', 'in', 'pervasive', 'eeg', 'recording', 'scenario', 'assuming', 'existence', 'of', 'no', 'a', 'priori', 'knowledge', 'about', 'the', 'artifacts', 'and', 'compare', 'their', 'performance', 'with', 'two', 'existing', 'artifact', 'removal', 'algorithms', 'artifact', 'cleaning', 'performance', 'has', 'been', 'measured', 'using', 'root', 'mean', 'square', 'error', 'rmse', 'and', 'artifact', 'to', 'signal', 'ratio', 'asr', 'an', 'index', 'similar', 'to', 'traditional', 'signal', 'to', 'noise', 'ratio', 'snr', 'and', 'also', 'by', 'observing', 'normalized', 'power', 'distribution', 'topography', 'over', 'the', 'scalp', 'comparison', 'has', 'been', 'made', 'first', 'using', 'semisimulated', 'signals', 'and', 'then', 'with', 'real', 'experimentally', 'acquired', 'eeg', 'data', 'with', 'commercially', 'available', '19channel', 'pervasive', 'eeg', 'system', 'enobio', 'corrupted', 'by', 'eight', 'types', 'of', 'artifact', 'our', 'explorations', 'show', 'that', 'wptemd', 'consistently', 'gives', 'best', 'artifact', 'cleaning', 'performance', 'not', 'only', 'in', 'semisimulated', 'scenario', 'but', 'also', 'in', 'the', 'case', 'of', 'real', 'eeg', 'data', 'containing', 'artifacts']] | [-0.08253383988982212, 0.027492845009027374, -0.08525420736184279, 0.06869690704316499, -0.11431380202853249, -0.15789618847313627, 0.04400747716637601, 0.42862311239225853, -0.2582910318963294, -0.3332729537345084, 0.15882051366798836, -0.29795153286500736, -0.18052802942612947, 0.19909394774606035, -0.13615679366570288, 0.06899322509757597, 0.11862496298874312, 0.0329124315948916, -0.04389673701471424, -0.23469896949948102, 0.2679794277967725, 0.06120289211936199, 0.3197266234020735, -0.012888703498274794, 0.06504502864042698, 0.012154818218701182, -0.11981557917395799, -0.0278533817668333, -0.004941336781641816, 0.06716895836670402, 0.3121780124111583, 0.17470337291458768, 0.2690219696418479, -0.42208341295140445, -0.2463515267651207, 0.12599326968032482, 0.15311649608714828, 0.07700866802368747, -0.06849360502665464, -0.3449517409387446, 0.13038893221277376, -0.12390498077428642, -0.05451958348215879, -0.09204351493350134, -0.009803424521092454, -0.03915330832763896, -0.2873288843869071, 0.12806205144392904, 0.027531176520479393, 0.1342178453843848, -0.03693637176685774, -0.15102028773830609, 0.05334153819471951, 0.14991211755690967, 0.07051011997802938, 0.03041540368576534, 0.16123573617319223, -0.1010553233163905, -0.09799384144496108, 0.342334739819715, -0.03115129068790903, -0.2175061841433113, 0.19511016200101886, -0.07154411239376902, -0.09548017786261787, 0.19659049112895696, 0.14600599964213526, 0.006614289142127181, -0.20333176862562863, -0.013411956764496703, 0.08373035161639564, 0.23364877723085148, 0.1003853953323038, 0.03828588048004192, 0.15283098818878804, 0.1621324825135726, 0.0010938968987139906, 0.12840056287752993, -0.1323718221945706, -0.005901261339172849, -0.21503037057269028, -0.062325860118264624, -0.20263290315892063, 0.020358733533330137, -0.08978301979029844, -0.16914187753492774, 0.3729717550991938, 0.19632619750123484, 0.15431626021645256, 0.003959928749125162, 0.4115915792544597, 0.05351193541418038, 0.0769461635480121, 0.04109552117257283, 0.17856322050722845, 0.050821384601696426, 0.10409552446147026, -0.15595804864052956, 0.0990837079087465, -0.020057627054107987] |
1,803.00054 | Resolved Millimeter Observations of the HR 8799 Debris Disk | We present 1.3 millimeter observations of the debris disk surrounding the HR
8799 multi-planet system from the Submillimeter Array to complement archival
ALMA observations that spatially filtered away the bulk of the emission. The
image morphology at $3.8$ arcsecond (150 AU) resolution indicates an optically
thin circumstellar belt, which we associate with a population of dust-producing
planetesimals within the debris disk. The interferometric visibilities are fit
well by an axisymmetric radial power-law model characterized by a broad width,
$\Delta R/R\gtrsim 1$. The belt inclination and orientation parameters are
consistent with the planet orbital parameters within the mutual uncertainties.
The models constrain the radial location of the inner edge of the belt to
$R_\text{in}= 104_{-12}^{+8}$ AU. In a simple scenario where the chaotic zone
of the outermost planet b truncates the planetesimal distribution, this inner
edge location translates into a constraint on the planet~b mass of $M_\text{pl}
= 5.8_{-3.1}^{+7.9}$ M$_{\rm Jup}$. This mass estimate is consistent with
infrared observations of the planet luminosity and standard hot-start
evolutionary models, with the uncertainties allowing for a range of initial
conditions. We also present new 9 millimeter observations of the debris disk
from the Very Large Array and determine a millimeter spectral index of
$2.41\pm0.17$. This value is typical of debris disks and indicates a power-law
index of the grain size distribution $q=3.27\pm0.10$, close to predictions for
a classical collisional cascade.
| astro-ph.EP astro-ph.SR | we present 13 millimeter observations of the debris disk surrounding the hr 8799 multiplanet system from the submillimeter array to complement archival alma observations that spatially filtered away the bulk of the emission the image morphology at 38 arcsecond 150 au resolution indicates an optically thin circumstellar belt which we associate with a population of dustproducing planetesimals within the debris disk the interferometric visibilities are fit well by an axisymmetric radial powerlaw model characterized by a broad width delta rrgtrsim 1 the belt inclination and orientation parameters are consistent with the planet orbital parameters within the mutual uncertainties the models constrain the radial location of the inner edge of the belt to r_textin 104_128 au in a simple scenario where the chaotic zone of the outermost planet b truncates the planetesimal distribution this inner edge location translates into a constraint on the planetb mass of m_textpl 58_3179 m_rm jup this mass estimate is consistent with infrared observations of the planet luminosity and standard hotstart evolutionary models with the uncertainties allowing for a range of initial conditions we also present new 9 millimeter observations of the debris disk from the very large array and determine a millimeter spectral index of 241pm017 this value is typical of debris disks and indicates a powerlaw index of the grain size distribution q327pm010 close to predictions for a classical collisional cascade | [['we', 'present', '13', 'millimeter', 'observations', 'of', 'the', 'debris', 'disk', 'surrounding', 'the', 'hr', '8799', 'multiplanet', 'system', 'from', 'the', 'submillimeter', 'array', 'to', 'complement', 'archival', 'alma', 'observations', 'that', 'spatially', 'filtered', 'away', 'the', 'bulk', 'of', 'the', 'emission', 'the', 'image', 'morphology', 'at', '38', 'arcsecond', '150', 'au', 'resolution', 'indicates', 'an', 'optically', 'thin', 'circumstellar', 'belt', 'which', 'we', 'associate', 'with', 'a', 'population', 'of', 'dustproducing', 'planetesimals', 'within', 'the', 'debris', 'disk', 'the', 'interferometric', 'visibilities', 'are', 'fit', 'well', 'by', 'an', 'axisymmetric', 'radial', 'powerlaw', 'model', 'characterized', 'by', 'a', 'broad', 'width', 'delta', 'rrgtrsim', '1', 'the', 'belt', 'inclination', 'and', 'orientation', 'parameters', 'are', 'consistent', 'with', 'the', 'planet', 'orbital', 'parameters', 'within', 'the', 'mutual', 'uncertainties', 'the', 'models', 'constrain', 'the', 'radial', 'location', 'of', 'the', 'inner', 'edge', 'of', 'the', 'belt', 'to', 'r_textin', '104_128', 'au', 'in', 'a', 'simple', 'scenario', 'where', 'the', 'chaotic', 'zone', 'of', 'the', 'outermost', 'planet', 'b', 'truncates', 'the', 'planetesimal', 'distribution', 'this', 'inner', 'edge', 'location', 'translates', 'into', 'a', 'constraint', 'on', 'the', 'planetb', 'mass', 'of', 'm_textpl', '58_3179', 'm_rm', 'jup', 'this', 'mass', 'estimate', 'is', 'consistent', 'with', 'infrared', 'observations', 'of', 'the', 'planet', 'luminosity', 'and', 'standard', 'hotstart', 'evolutionary', 'models', 'with', 'the', 'uncertainties', 'allowing', 'for', 'a', 'range', 'of', 'initial', 'conditions', 'we', 'also', 'present', 'new', '9', 'millimeter', 'observations', 'of', 'the', 'debris', 'disk', 'from', 'the', 'very', 'large', 'array', 'and', 'determine', 'a', 'millimeter', 'spectral', 'index', 'of', '241pm017', 'this', 'value', 'is', 'typical', 'of', 'debris', 'disks', 'and', 'indicates', 'a', 'powerlaw', 'index', 'of', 'the', 'grain', 'size', 'distribution', 'q327pm010', 'close', 'to', 'predictions', 'for', 'a', 'classical', 'collisional', 'cascade']] | [-0.09411394630439715, 0.10127765780963859, -0.06512500723339107, 0.037542932711490624, -0.08433868318315613, -0.0688798062345991, 0.011758490947190009, 0.37261379474442297, -0.2087306714527411, -0.3520835688678956, 0.09079849155466646, -0.24144450514114857, -0.011681551048074973, 0.13762063760051002, -0.05492290939081069, 0.04183468707362998, 0.12450076644968021, -0.12211609126885153, -0.027162732632477773, -0.14977440356168487, 0.2956006235674823, 0.10827786432787538, 0.04863529170110618, -0.03802755237299844, 0.027462208958249114, -0.09780698535261148, -0.043629552769266305, -0.07563044281344708, -0.24036753678723738, 0.06223689618660775, 0.2071367924777883, 0.09744928008557795, 0.1891981279961212, -0.36909125715102914, -0.20464619059013586, 0.024264816794391363, 0.1568437791450723, 0.008672690627666946, 0.01851611420752472, -0.2752981115564211, 0.07473345980785477, -0.20992334274315705, -0.23059948925439216, 0.13784422268070382, 0.09023838530893419, -0.01157070389421461, -0.3061736022554376, 0.11013141287090449, 0.04258862952382801, 0.10912541241691232, -0.15380952307304843, -0.13324451711630558, -0.09901649136517247, 0.045173523963012274, 0.005477082003684093, 0.04759142312569944, 0.20275582793300553, -0.10029281906626233, -0.02603925114335943, 0.35894544222434666, -0.09838143338398268, -0.054778460761931935, 0.24002523057494465, -0.2491427230915548, -0.09969560078187892, 0.18988159574040947, 0.1582469877140537, 0.11492408502030454, -0.13348766684757554, 0.03891666606174927, -0.07544152639363999, 0.2665200803331078, 0.07017760581579315, 0.06824024464003742, 0.40773762781258044, 0.1488311609049162, 0.04819971240353112, 0.12535292270580586, -0.29446014554716105, -0.08623444760477672, -0.2274477670169074, -0.09283193999999224, -0.1955460723421481, 0.04396694876598067, -0.18477804111035065, -0.13361598697340688, 0.3552611104210575, 0.1267854692528692, 0.2679284448782195, 0.07138293789706053, 0.31483136255243055, 0.061447698840888465, 0.115619908579096, 0.12666504506604345, 0.3131039136357299, 0.13499252756921465, 0.09404938418922369, -0.2425157775641015, 0.06272213082530931, -0.04072472698918488] |
1,803.00055 | Deep Reinforcement Learning for Join Order Enumeration | Join order selection plays a significant role in query performance. However,
modern query optimizers typically employ static join enumeration algorithms
that do not receive any feedback about the quality of the resulting plan.
Hence, optimizers often repeatedly choose the same bad plan, as they do not
have a mechanism for "learning from their mistakes". In this paper, we argue
that existing deep reinforcement learning techniques can be applied to address
this challenge. These techniques, powered by artificial neural networks, can
automatically improve decision making by incorporating feedback from their
successes and failures. Towards this goal, we present ReJOIN, a
proof-of-concept join enumerator, and present preliminary results indicating
that ReJOIN can match or outperform the PostgreSQL optimizer in terms of plan
quality and join enumeration efficiency.
| cs.DB cs.LG | join order selection plays a significant role in query performance however modern query optimizers typically employ static join enumeration algorithms that do not receive any feedback about the quality of the resulting plan hence optimizers often repeatedly choose the same bad plan as they do not have a mechanism for learning from their mistakes in this paper we argue that existing deep reinforcement learning techniques can be applied to address this challenge these techniques powered by artificial neural networks can automatically improve decision making by incorporating feedback from their successes and failures towards this goal we present rejoin a proofofconcept join enumerator and present preliminary results indicating that rejoin can match or outperform the postgresql optimizer in terms of plan quality and join enumeration efficiency | [['join', 'order', 'selection', 'plays', 'a', 'significant', 'role', 'in', 'query', 'performance', 'however', 'modern', 'query', 'optimizers', 'typically', 'employ', 'static', 'join', 'enumeration', 'algorithms', 'that', 'do', 'not', 'receive', 'any', 'feedback', 'about', 'the', 'quality', 'of', 'the', 'resulting', 'plan', 'hence', 'optimizers', 'often', 'repeatedly', 'choose', 'the', 'same', 'bad', 'plan', 'as', 'they', 'do', 'not', 'have', 'a', 'mechanism', 'for', 'learning', 'from', 'their', 'mistakes', 'in', 'this', 'paper', 'we', 'argue', 'that', 'existing', 'deep', 'reinforcement', 'learning', 'techniques', 'can', 'be', 'applied', 'to', 'address', 'this', 'challenge', 'these', 'techniques', 'powered', 'by', 'artificial', 'neural', 'networks', 'can', 'automatically', 'improve', 'decision', 'making', 'by', 'incorporating', 'feedback', 'from', 'their', 'successes', 'and', 'failures', 'towards', 'this', 'goal', 'we', 'present', 'rejoin', 'a', 'proofofconcept', 'join', 'enumerator', 'and', 'present', 'preliminary', 'results', 'indicating', 'that', 'rejoin', 'can', 'match', 'or', 'outperform', 'the', 'postgresql', 'optimizer', 'in', 'terms', 'of', 'plan', 'quality', 'and', 'join', 'enumeration', 'efficiency']] | [-0.056006357062608, 0.015021188940852881, -0.07942414959892631, 0.07483134252671152, -0.15704119867831468, -0.15902244238555432, 0.12876222595293074, 0.4669096499085426, -0.27595814544707536, -0.3719004429578781, 0.11761912631895394, -0.2567909882068634, -0.18936313924752177, 0.16845156538579614, -0.18146804627725213, 0.06349313522875309, 0.13875125693134033, 0.02629479292035103, -0.06758023254480212, -0.32743420714139937, 0.2761722243949771, 0.07988615241437219, 0.3042640700116754, 0.012291200645267963, 0.04291804746980779, 0.0032069613710045816, -0.03649821291863918, 0.024367450626567005, -0.0632561535918503, 0.11619379683211446, 0.36163622673600915, 0.24926659168303014, 0.35487948745116593, -0.47161794708669186, -0.17643308894708754, 0.14825050630420447, 0.2039997591516003, 0.10157042284682392, -0.06560146852955222, -0.23294213359057903, 0.1019731854274869, -0.18038522096001544, -0.019570353895425798, -0.15590204732352866, -0.06492418109998108, 0.026220559296110876, -0.2510024935901165, -0.05619622699450701, 0.11129392439778894, 0.014975801719352602, -0.01008908835798502, -0.11715986099676229, 0.047117840874940156, 0.18922237230651082, -0.00495398684591055, 0.08079823322966695, 0.1725624341480434, -0.16511508576804773, -0.2366307197958231, 0.3642441774457693, 0.006127365904860198, -0.18257807913795113, 0.17964334194362164, -0.011847456760704518, -0.1741651516482234, 0.11405782936513424, 0.23168073063716293, 0.10974098210409283, -0.14376520124077796, 0.02756608698749915, 0.005616105020046234, 0.16794731330499052, 0.06871691281348467, 0.014088265772908925, 0.23156714611686766, 0.17243450776673852, 0.052085285691544414, 0.12122056044731289, 0.0006780348625034094, -0.06666474807634949, -0.21027531011402606, -0.09562286291271448, -0.13360591101646424, 0.020463639423483983, -0.092665673356154, -0.1437441825605929, 0.32848242775531256, 0.2615904881376773, 0.16743545090407133, 0.09721533518284559, 0.34617889174073935, 0.028819974032230675, 0.12470719711109995, 0.14332112377882003, 0.22610517735406757, -0.03781266973447055, 0.14696762597188354, -0.19507899753190577, 0.14595738033950328, 0.053389060359448196] |
1,803.00056 | Davydov-Type Excitonic Effects on the Absorption Spectra of
Parallel-Stacked and Herringbone Aggregates of Pentacene: Time-Dependent
Density-Functional Theory and Time-Dependent Density-Functional Tight Binding | Exciton formation leads to J-bands in solid pentacene. Describing these
exciton bands represents a challenge for both time-dependent (TD)
density-functional theory (DFT) and for its semiempirical analogue, namely for
TD density-functional tight binding (DFTB) for three reasons (i) solid
pentacene and pentacene aggregates are bound only by van der Waals forces which
are notoriously difficult to describe with DFT and DFTB, (ii) the proper
description of the long-range coupling between molecules, needed to describe
Davydov splitting, is not easy to include in TD-DFT with traditional
functionals and in TD-DFTB, and (iii) mixing may occur between local and charge
transfer excitons, which may, in turn, require special functionals. We assess
how far TD-DFT and TD-DFTB have progressed towards a correct description of
this type of exciton by including both a dispersion correction for the ground
state and a range-separated hybrid functional for the excited state. Analytic
results for parallel-stacked ethylene are derived which go beyond Kasha's
exciton model in that we are able to make a clear distinction between charge
transfer and energy transfer excitons. This is further confirmed when it is
shown that range-separated hybrids have a markedly greater effect on
charge-transfer excitons than on energy-transfer excitons in the case of
parallel-stacked pentacenes. TD-DFT calculations with the CAM-B3LYP functional
and TD-lc-DFT calculations lead to negligeable excitonic corrections for the
herringbone crystal structure, possibly because of an overcorrection of
charge-transfer effects. In this case, TD-DFT calculations with the B3LYP
functional or TD-DFTB calculations parameterized to B3LYP give the best results
for excitonic corrections for the herringbone crystal structure as judged from
comparison with experimental spectra and with Bethe-Salpeter equation
calculations from the literature.
| physics.chem-ph quant-ph | exciton formation leads to jbands in solid pentacene describing these exciton bands represents a challenge for both timedependent td densityfunctional theory dft and for its semiempirical analogue namely for td densityfunctional tight binding dftb for three reasons i solid pentacene and pentacene aggregates are bound only by van der waals forces which are notoriously difficult to describe with dft and dftb ii the proper description of the longrange coupling between molecules needed to describe davydov splitting is not easy to include in tddft with traditional functionals and in tddftb and iii mixing may occur between local and charge transfer excitons which may in turn require special functionals we assess how far tddft and tddftb have progressed towards a correct description of this type of exciton by including both a dispersion correction for the ground state and a rangeseparated hybrid functional for the excited state analytic results for parallelstacked ethylene are derived which go beyond kashas exciton model in that we are able to make a clear distinction between charge transfer and energy transfer excitons this is further confirmed when it is shown that rangeseparated hybrids have a markedly greater effect on chargetransfer excitons than on energytransfer excitons in the case of parallelstacked pentacenes tddft calculations with the camb3lyp functional and tdlcdft calculations lead to negligeable excitonic corrections for the herringbone crystal structure possibly because of an overcorrection of chargetransfer effects in this case tddft calculations with the b3lyp functional or tddftb calculations parameterized to b3lyp give the best results for excitonic corrections for the herringbone crystal structure as judged from comparison with experimental spectra and with bethesalpeter equation calculations from the literature | [['exciton', 'formation', 'leads', 'to', 'jbands', 'in', 'solid', 'pentacene', 'describing', 'these', 'exciton', 'bands', 'represents', 'a', 'challenge', 'for', 'both', 'timedependent', 'td', 'densityfunctional', 'theory', 'dft', 'and', 'for', 'its', 'semiempirical', 'analogue', 'namely', 'for', 'td', 'densityfunctional', 'tight', 'binding', 'dftb', 'for', 'three', 'reasons', 'i', 'solid', 'pentacene', 'and', 'pentacene', 'aggregates', 'are', 'bound', 'only', 'by', 'van', 'der', 'waals', 'forces', 'which', 'are', 'notoriously', 'difficult', 'to', 'describe', 'with', 'dft', 'and', 'dftb', 'ii', 'the', 'proper', 'description', 'of', 'the', 'longrange', 'coupling', 'between', 'molecules', 'needed', 'to', 'describe', 'davydov', 'splitting', 'is', 'not', 'easy', 'to', 'include', 'in', 'tddft', 'with', 'traditional', 'functionals', 'and', 'in', 'tddftb', 'and', 'iii', 'mixing', 'may', 'occur', 'between', 'local', 'and', 'charge', 'transfer', 'excitons', 'which', 'may', 'in', 'turn', 'require', 'special', 'functionals', 'we', 'assess', 'how', 'far', 'tddft', 'and', 'tddftb', 'have', 'progressed', 'towards', 'a', 'correct', 'description', 'of', 'this', 'type', 'of', 'exciton', 'by', 'including', 'both', 'a', 'dispersion', 'correction', 'for', 'the', 'ground', 'state', 'and', 'a', 'rangeseparated', 'hybrid', 'functional', 'for', 'the', 'excited', 'state', 'analytic', 'results', 'for', 'parallelstacked', 'ethylene', 'are', 'derived', 'which', 'go', 'beyond', 'kashas', 'exciton', 'model', 'in', 'that', 'we', 'are', 'able', 'to', 'make', 'a', 'clear', 'distinction', 'between', 'charge', 'transfer', 'and', 'energy', 'transfer', 'excitons', 'this', 'is', 'further', 'confirmed', 'when', 'it', 'is', 'shown', 'that', 'rangeseparated', 'hybrids', 'have', 'a', 'markedly', 'greater', 'effect', 'on', 'chargetransfer', 'excitons', 'than', 'on', 'energytransfer', 'excitons', 'in', 'the', 'case', 'of', 'parallelstacked', 'pentacenes', 'tddft', 'calculations', 'with', 'the', 'camb3lyp', 'functional', 'and', 'tdlcdft', 'calculations', 'lead', 'to', 'negligeable', 'excitonic', 'corrections', 'for', 'the', 'herringbone', 'crystal', 'structure', 'possibly', 'because', 'of', 'an', 'overcorrection', 'of', 'chargetransfer', 'effects', 'in', 'this', 'case', 'tddft', 'calculations', 'with', 'the', 'b3lyp', 'functional', 'or', 'tddftb', 'calculations', 'parameterized', 'to', 'b3lyp', 'give', 'the', 'best', 'results', 'for', 'excitonic', 'corrections', 'for', 'the', 'herringbone', 'crystal', 'structure', 'as', 'judged', 'from', 'comparison', 'with', 'experimental', 'spectra', 'and', 'with', 'bethesalpeter', 'equation', 'calculations', 'from', 'the', 'literature']] | [-0.037572476292227104, 0.09154986396590256, -0.08108737090330592, 0.12046164217191738, 0.011196698532724291, -0.1665695515381339, 0.06777880946348018, 0.41425171964662844, -0.19900546532631208, -0.30598024045353506, -0.06140321839093439, -0.31764645538633385, -0.1368661531131652, 0.15267802987516155, 0.03827294967258335, 0.027238288388453744, 0.047942355842896, -0.07598587547501882, -0.09077529176251281, -0.16801762225196712, 0.2793206011827813, 0.04831350385558916, 0.24447604724112204, 0.14152429246347148, -0.010293897891194741, 0.012739678798113089, 0.07674023729606545, -0.014199333663320919, -0.18624889629106983, 0.166211287603095, 0.30712261535366303, -0.057887656966905426, 0.2604722498547731, -0.5059532789833177, -0.21408717771957336, -0.0027206154147496643, 0.11351244574944391, 0.2102037554380046, -0.046596656299766094, -0.25338190490920304, 0.03646321496413673, -0.19616801602376707, -0.06441701962716821, -0.16751304249246188, 0.017606702657527666, 0.039815334789976196, -0.23730760344013974, 0.12523040616795345, -0.01843713759618408, 0.003578227081955298, -0.14594339257073172, -0.16431693108396173, -0.06459125672960515, 0.05978467409577613, 0.020962462246412787, 0.04199375807648219, 0.1507744170871299, -0.10496198455716219, -0.090639680761274, 0.4225536239691384, -0.08283694028454083, -0.1559753071498508, 0.19173360175936163, -0.10062121363693792, -0.10789552284925898, 0.14665576785589124, 0.06291209500623561, 0.11060518743842797, -0.11973531459964883, 0.09124963981062069, 0.03872578795443275, 0.1990437532406745, 0.05060096088850718, 0.08739838786266828, 0.1595986188848072, 0.14259623219658718, 0.01535725530754747, 0.051746304659520403, -0.0815113965763885, -0.14686824755270533, -0.2341594902777683, -0.17647429847496443, -0.20250139589275498, 0.0717822625701956, -0.016897820289268024, -0.21848730015281306, 0.37658035383062827, 0.09655701686582986, 0.12497220287940451, 0.03429854056214107, 0.23313235210293015, 0.12158300323410084, 0.06145088080709467, 0.00919941789948437, 0.27346223819159915, 0.1717137334852674, 0.03982962926053928, -0.2696713028256712, 0.06021608301671222, 0.044268798315028814] |
1,803.00057 | A Neural Multi-sequence Alignment TeCHnique (NeuMATCH) | The alignment of heterogeneous sequential data (video to text) is an
important and challenging problem. Standard techniques for this task, including
Dynamic Time Warping (DTW) and Conditional Random Fields (CRFs), suffer from
inherent drawbacks. Mainly, the Markov assumption implies that, given the
immediate past, future alignment decisions are independent of further history.
The separation between similarity computation and alignment decision also
prevents end-to-end training. In this paper, we propose an end-to-end neural
architecture where alignment actions are implemented as moving data between
stacks of Long Short-term Memory (LSTM) blocks. This flexible architecture
supports a large variety of alignment tasks, including one-to-one, one-to-many,
skipping unmatched elements, and (with extensions) non-monotonic alignment.
Extensive experiments on semi-synthetic and real datasets show that our
algorithm outperforms state-of-the-art baselines.
| cs.CV cs.CL cs.LG | the alignment of heterogeneous sequential data video to text is an important and challenging problem standard techniques for this task including dynamic time warping dtw and conditional random fields crfs suffer from inherent drawbacks mainly the markov assumption implies that given the immediate past future alignment decisions are independent of further history the separation between similarity computation and alignment decision also prevents endtoend training in this paper we propose an endtoend neural architecture where alignment actions are implemented as moving data between stacks of long shortterm memory lstm blocks this flexible architecture supports a large variety of alignment tasks including onetoone onetomany skipping unmatched elements and with extensions nonmonotonic alignment extensive experiments on semisynthetic and real datasets show that our algorithm outperforms stateoftheart baselines | [['the', 'alignment', 'of', 'heterogeneous', 'sequential', 'data', 'video', 'to', 'text', 'is', 'an', 'important', 'and', 'challenging', 'problem', 'standard', 'techniques', 'for', 'this', 'task', 'including', 'dynamic', 'time', 'warping', 'dtw', 'and', 'conditional', 'random', 'fields', 'crfs', 'suffer', 'from', 'inherent', 'drawbacks', 'mainly', 'the', 'markov', 'assumption', 'implies', 'that', 'given', 'the', 'immediate', 'past', 'future', 'alignment', 'decisions', 'are', 'independent', 'of', 'further', 'history', 'the', 'separation', 'between', 'similarity', 'computation', 'and', 'alignment', 'decision', 'also', 'prevents', 'endtoend', 'training', 'in', 'this', 'paper', 'we', 'propose', 'an', 'endtoend', 'neural', 'architecture', 'where', 'alignment', 'actions', 'are', 'implemented', 'as', 'moving', 'data', 'between', 'stacks', 'of', 'long', 'shortterm', 'memory', 'lstm', 'blocks', 'this', 'flexible', 'architecture', 'supports', 'a', 'large', 'variety', 'of', 'alignment', 'tasks', 'including', 'onetoone', 'onetomany', 'skipping', 'unmatched', 'elements', 'and', 'with', 'extensions', 'nonmonotonic', 'alignment', 'extensive', 'experiments', 'on', 'semisynthetic', 'and', 'real', 'datasets', 'show', 'that', 'our', 'algorithm', 'outperforms', 'stateoftheart', 'baselines']] | [-0.14707300522469827, 0.015273011201521337, -0.023351804165530107, 0.06633478383375932, -0.13040038334175705, -0.1673477225629012, 0.032149810465794404, 0.5185479483597221, -0.325992688356388, -0.32714863755034224, 0.06969644567617515, -0.22043192576647044, -0.20051125431012723, 0.1518262996499787, -0.12313194703963218, 0.07466643252560208, 0.17732323591987934, 0.00828322752908383, -0.09087319023866815, -0.29121019051507896, 0.25747287683301573, 0.04215505185176528, 0.38834955347251265, 0.00920179186599149, 0.15689456441266944, 0.041244181624102975, -0.052028170100510904, -0.02293178289678068, -0.021213549670304224, 0.1409735285410387, 0.29887829067546035, 0.19402349617790135, 0.3014150051355001, -0.4533289284069812, -0.21759420328195236, 0.08964648454510156, 0.15789482058889623, 0.09112040053092173, -0.03746056337484099, -0.3362483975417431, 0.08224682929510656, -0.15314258748455153, 0.05404012002831986, -0.10398059755924248, 0.015572969021553534, 0.02122893795791653, -0.314088765629417, 0.059747461684662176, 0.10371998398688682, 0.08814106661555988, -0.031541513720332016, -0.09934169875698225, 0.053718510389913834, 0.17093675885154236, 0.08356495352739829, 0.06944966141224629, 0.11690153498127456, -0.1446402976984128, -0.20385649031208408, 0.35688368454124897, -0.05688727233322307, -0.19752641915599065, 0.22788588648226352, 0.037971036512434726, -0.1761377610438954, 0.07570741416495894, 0.22833887151923152, 0.11454866727769014, -0.14708207336614929, 0.04646532318785772, -0.03752565028656635, 0.19313694388725824, 0.06574808766937724, 0.04252091222893326, 0.20335971235087322, 0.2742695257015106, 0.03400253036600207, 0.12780368585710325, -0.13278990876372723, -0.14644202307963203, -0.21404916857699713, -0.08078680756772237, -0.1765243669093076, -0.030597509765591953, -0.15230989390399755, -0.17447609472418985, 0.3311225488601673, 0.24450152349327842, 0.1981607135385275, 0.1603749510156171, 0.4056540780941085, -0.03089919637122582, 0.12096728601553026, 0.06029040915957246, 0.13311689394815343, 0.006476141369691299, 0.10313019807630729, -0.1886884296179614, 0.12285947730772258, 0.018423881764794068] |
1,803.00058 | PDE-constrained optimization in medical image analysis | PDE-constrained optimization problems find many applications in medical image
analysis, for example, neuroimaging, cardiovascular imaging, and oncological
imaging. We review related literature and give examples on the formulation,
discretization, and numerical solution of PDE-constrained optimization problems
for medical imaging. We discuss three examples. The first one is image
registration. The second one is data assimilation for brain tumor patients, and
the third one data assimilation in cardiovascular imaging. The image
registration problem is a classical task in medical image analysis and seeks to
find pointwise correspondences between two or more images. The data
assimilation problems use a PDE-constrained formulation to link a biophysical
model to patient-specific data obtained from medical images. The associated
optimality systems turn out to be sets of nonlinear, multicomponent PDEs that
are challenging to solve in an efficient way.
The ultimate goal of our work is the design of inversion methods that
integrate complementary data, and rigorously follow mathematical and physical
principles, in an attempt to support clinical decision making. This requires
reliable, high-fidelity algorithms with a short time-to-solution. This task is
complicated by model and data uncertainties, and by the fact that
PDE-constrained optimization problems are ill-posed in nature, and in general
yield high-dimensional, severely ill-conditioned systems after discretization.
These features make regularization, effective preconditioners, and iterative
solvers that, in many cases, have to be implemented on distributed-memory
architectures to be practical, a prerequisite. We showcase state-of-the-art
techniques in scientific computing to tackle these challenges.
| math.OC cs.CV | pdeconstrained optimization problems find many applications in medical image analysis for example neuroimaging cardiovascular imaging and oncological imaging we review related literature and give examples on the formulation discretization and numerical solution of pdeconstrained optimization problems for medical imaging we discuss three examples the first one is image registration the second one is data assimilation for brain tumor patients and the third one data assimilation in cardiovascular imaging the image registration problem is a classical task in medical image analysis and seeks to find pointwise correspondences between two or more images the data assimilation problems use a pdeconstrained formulation to link a biophysical model to patientspecific data obtained from medical images the associated optimality systems turn out to be sets of nonlinear multicomponent pdes that are challenging to solve in an efficient way the ultimate goal of our work is the design of inversion methods that integrate complementary data and rigorously follow mathematical and physical principles in an attempt to support clinical decision making this requires reliable highfidelity algorithms with a short timetosolution this task is complicated by model and data uncertainties and by the fact that pdeconstrained optimization problems are illposed in nature and in general yield highdimensional severely illconditioned systems after discretization these features make regularization effective preconditioners and iterative solvers that in many cases have to be implemented on distributedmemory architectures to be practical a prerequisite we showcase stateoftheart techniques in scientific computing to tackle these challenges | [['pdeconstrained', 'optimization', 'problems', 'find', 'many', 'applications', 'in', 'medical', 'image', 'analysis', 'for', 'example', 'neuroimaging', 'cardiovascular', 'imaging', 'and', 'oncological', 'imaging', 'we', 'review', 'related', 'literature', 'and', 'give', 'examples', 'on', 'the', 'formulation', 'discretization', 'and', 'numerical', 'solution', 'of', 'pdeconstrained', 'optimization', 'problems', 'for', 'medical', 'imaging', 'we', 'discuss', 'three', 'examples', 'the', 'first', 'one', 'is', 'image', 'registration', 'the', 'second', 'one', 'is', 'data', 'assimilation', 'for', 'brain', 'tumor', 'patients', 'and', 'the', 'third', 'one', 'data', 'assimilation', 'in', 'cardiovascular', 'imaging', 'the', 'image', 'registration', 'problem', 'is', 'a', 'classical', 'task', 'in', 'medical', 'image', 'analysis', 'and', 'seeks', 'to', 'find', 'pointwise', 'correspondences', 'between', 'two', 'or', 'more', 'images', 'the', 'data', 'assimilation', 'problems', 'use', 'a', 'pdeconstrained', 'formulation', 'to', 'link', 'a', 'biophysical', 'model', 'to', 'patientspecific', 'data', 'obtained', 'from', 'medical', 'images', 'the', 'associated', 'optimality', 'systems', 'turn', 'out', 'to', 'be', 'sets', 'of', 'nonlinear', 'multicomponent', 'pdes', 'that', 'are', 'challenging', 'to', 'solve', 'in', 'an', 'efficient', 'way', 'the', 'ultimate', 'goal', 'of', 'our', 'work', 'is', 'the', 'design', 'of', 'inversion', 'methods', 'that', 'integrate', 'complementary', 'data', 'and', 'rigorously', 'follow', 'mathematical', 'and', 'physical', 'principles', 'in', 'an', 'attempt', 'to', 'support', 'clinical', 'decision', 'making', 'this', 'requires', 'reliable', 'highfidelity', 'algorithms', 'with', 'a', 'short', 'timetosolution', 'this', 'task', 'is', 'complicated', 'by', 'model', 'and', 'data', 'uncertainties', 'and', 'by', 'the', 'fact', 'that', 'pdeconstrained', 'optimization', 'problems', 'are', 'illposed', 'in', 'nature', 'and', 'in', 'general', 'yield', 'highdimensional', 'severely', 'illconditioned', 'systems', 'after', 'discretization', 'these', 'features', 'make', 'regularization', 'effective', 'preconditioners', 'and', 'iterative', 'solvers', 'that', 'in', 'many', 'cases', 'have', 'to', 'be', 'implemented', 'on', 'distributedmemory', 'architectures', 'to', 'be', 'practical', 'a', 'prerequisite', 'we', 'showcase', 'stateoftheart', 'techniques', 'in', 'scientific', 'computing', 'to', 'tackle', 'these', 'challenges']] | [-0.03793449996398219, -0.051758572357236216, -0.06694137838009434, 0.10508155771773696, -0.11745983834456032, -0.1687774816780196, -0.020814489806070924, 0.41376890502870084, -0.3092820666264743, -0.3338734871901882, 0.19851597877568566, -0.2677400530054001, -0.1945553255606986, 0.25522717798497374, -0.15148039346871275, 0.13569680638902354, 0.17618804985734945, -0.0524797788549525, -0.06737875469031375, -0.26149204375299934, 0.2743253648125877, 0.001430339195455114, 0.3143588008242659, 0.013830037681327668, 0.09795758757099975, -0.024468158007463596, -0.04766765932727139, -0.015136169401686553, -0.08216987878270933, 0.18228888279166616, 0.4153206015752706, 0.2140672246910981, 0.35758424634501956, -0.447411279558825, -0.23416844983876217, 0.08237617243236552, 0.14674374794897935, 0.11186007452391399, -0.05572796285493193, -0.27060976220915717, 0.04166388974990696, -0.08711448531151594, -0.06283707548185097, -0.15863001686520875, -0.026658338336468055, -0.04866413428195907, -0.3152242566580147, 0.09187538710284571, -0.007296386733651161, 0.07887675591628067, -0.09744735415782392, -0.10019239771402984, 0.05774213925857718, 0.12295011690584942, 0.056935971004713794, 0.028484298715678355, 0.11379275708459317, -0.16919176718705178, -0.14191402432722194, 0.3917668161370481, 0.05739889312632537, -0.2488980003244554, 0.20054930381884334, -0.017524783643117794, -0.18950712610967457, 0.12834243064086573, 0.22459246737756378, 0.12594719520032716, -0.20260046261973913, 0.03666168093065304, 0.00927711886082155, 0.15613925004921234, 0.015908335670246743, -0.03236741193565346, 0.13711288729682564, 0.22764304053319695, 0.08722317942495768, 0.11972568484440368, -0.09689623545103435, -0.08573173563345335, -0.232186020767161, -0.13939058279890257, -0.1683361871885912, -0.012065300855465467, -0.09034096338976573, -0.16050692290494528, 0.3529068851513633, 0.252101632780735, 0.14135195048438617, 0.005696737682834889, 0.3702749499430259, 0.07359482877121384, 0.06252762316847414, 0.0318579161563927, 0.18088666907230314, 0.10882934562493271, 0.14187985870521516, -0.19726388923748647, 0.023748283886622326, 0.054322775286467125] |
1,803.00059 | Lagrangian Lie subalgebroids generating dynamics for second-order
mechanical systems on Lie algebroids | The study of mechanical systems on Lie algebroids permits an understanding of
the dynamics described by a Lagrangian or Hamiltonian function for a wide range
of mechanical systems in a unified framework. Systems defined in tangent
bundles, Lie algebras, principal bundles, reduced systems and constrained are
included in such description.
In this paper, we investigate how to derive the dynamics associated with a
Lagrangian system defined on the set of admissible elements of a given Lie
algebroid using Tulczyjew's triple on Lie algebroids and constructing a
Lagrangian Lie subalgebroid of a symplectic Lie algebroid, by building on the
geometric formalism for mechanics on Lie algebroids developed by M. de Le\'on,
J.C. Marrero and E. Mart\'inez on "Lagrangian submanifolds and dynamics on Lie
algebroids".
| math-ph math.MP math.SG | the study of mechanical systems on lie algebroids permits an understanding of the dynamics described by a lagrangian or hamiltonian function for a wide range of mechanical systems in a unified framework systems defined in tangent bundles lie algebras principal bundles reduced systems and constrained are included in such description in this paper we investigate how to derive the dynamics associated with a lagrangian system defined on the set of admissible elements of a given lie algebroid using tulczyjews triple on lie algebroids and constructing a lagrangian lie subalgebroid of a symplectic lie algebroid by building on the geometric formalism for mechanics on lie algebroids developed by m de leon jc marrero and e martinez on lagrangian submanifolds and dynamics on lie algebroids | [['the', 'study', 'of', 'mechanical', 'systems', 'on', 'lie', 'algebroids', 'permits', 'an', 'understanding', 'of', 'the', 'dynamics', 'described', 'by', 'a', 'lagrangian', 'or', 'hamiltonian', 'function', 'for', 'a', 'wide', 'range', 'of', 'mechanical', 'systems', 'in', 'a', 'unified', 'framework', 'systems', 'defined', 'in', 'tangent', 'bundles', 'lie', 'algebras', 'principal', 'bundles', 'reduced', 'systems', 'and', 'constrained', 'are', 'included', 'in', 'such', 'description', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'to', 'derive', 'the', 'dynamics', 'associated', 'with', 'a', 'lagrangian', 'system', 'defined', 'on', 'the', 'set', 'of', 'admissible', 'elements', 'of', 'a', 'given', 'lie', 'algebroid', 'using', 'tulczyjews', 'triple', 'on', 'lie', 'algebroids', 'and', 'constructing', 'a', 'lagrangian', 'lie', 'subalgebroid', 'of', 'a', 'symplectic', 'lie', 'algebroid', 'by', 'building', 'on', 'the', 'geometric', 'formalism', 'for', 'mechanics', 'on', 'lie', 'algebroids', 'developed', 'by', 'm', 'de', 'leon', 'jc', 'marrero', 'and', 'e', 'martinez', 'on', 'lagrangian', 'submanifolds', 'and', 'dynamics', 'on', 'lie', 'algebroids']] | [-0.2508350439611974, 0.002704427344842844, -0.05712878173292895, 0.0668617776260007, -0.1368040886397163, -0.10992946055891915, -0.023256342758697163, 0.34747024081889694, -0.2806417836667591, -0.27726934641993384, 0.0594018261086544, -0.1687540872234518, -0.2155973852585577, 0.20130627082728939, -0.14416449462116612, -0.014444710648944223, 0.06672547021275008, 0.09501064865380465, -0.12576816860980133, -0.18152659510572752, 0.436966611212498, 0.043705855369401296, 0.19931689115634899, -0.01865281167201607, 0.19260175273246397, 0.058295810441827266, 0.022916411428250433, -0.004312960106815113, -0.17478741872279593, 0.1323385472689581, 0.30586757834024003, 0.021973408194546535, 0.19675174509970153, -0.3717721214260512, -0.1675155878339599, 0.09080132219667841, 0.13434656737826584, -0.016130407094743435, 0.010541841305406174, -0.34459181532748345, 0.03690369471120156, -0.18053379594310512, -0.12786287711403235, -0.11158509104232478, 0.023114171886165453, 0.007002619698991984, -0.12321528636025099, -0.004448076426165133, 0.08126104053496043, 0.1820245320658858, -0.10634600477126556, -0.08654679926358376, -0.10136612963756712, -0.007675249979460264, -0.12011695808420579, 0.020430871320517387, 0.20800865625175155, -0.03839744872231854, -0.16195955812056526, 0.44211169192946054, -0.042565560581662304, -0.28947537587728445, 0.13696326945749362, -0.09127339768806488, -0.20019886997429942, 0.10274762999478394, 0.16374524119423656, 0.16475215431575368, -0.14553030428847646, 0.1978080358746773, -0.04236755685145376, -0.03599170668096077, 0.04461005850642071, -0.046710065035982344, 0.19960013172793678, 0.19964068658400055, 0.03346038800172084, 0.00038063690081481045, 0.07196983516857983, -0.11505823833981484, -0.35286359119463745, -0.17946911513466673, -0.07299369907127769, 0.14461845381382277, -0.051461397631877535, -0.16117850977670006, 0.4091161281718471, 0.10712644878805168, 0.2240504511382158, 0.11330470913544116, 0.15738149239621088, 0.0961315165591148, 0.09566289971665881, 0.04680417914216111, 0.2093647598190521, 0.2975522662717395, 0.018141857155303403, -0.1318898890557892, -0.14132529813266262, 0.20219388916119327] |
1,803.0006 | Neutrino-Electron Scattering: General Constraints on Z' and Dark Photon
Models | We study the framework of $U(1)_X$ models with kinetic mixing and/or mass
mixing terms. We give general and exact analytic formulas and derive limits on
a variety of $U(1)_X$ models that induce new physics contributions to
neutrino-electron scattering, taking into account interference between the new
physics and Standard Model contributions. Data from TEXONO, CHARM-II and GEMMA
are analyzed and shown to be complementary to each other to provide the most
restrictive bounds on masses of the new vector bosons. In particular, we
demonstrate the validity of our results to dark photon-like as well as light
$Z^\prime$ models.
| hep-ph astro-ph.HE hep-ex | we study the framework of u1_x models with kinetic mixing andor mass mixing terms we give general and exact analytic formulas and derive limits on a variety of u1_x models that induce new physics contributions to neutrinoelectron scattering taking into account interference between the new physics and standard model contributions data from texono charmii and gemma are analyzed and shown to be complementary to each other to provide the most restrictive bounds on masses of the new vector bosons in particular we demonstrate the validity of our results to dark photonlike as well as light zprime models | [['we', 'study', 'the', 'framework', 'of', 'u1_x', 'models', 'with', 'kinetic', 'mixing', 'andor', 'mass', 'mixing', 'terms', 'we', 'give', 'general', 'and', 'exact', 'analytic', 'formulas', 'and', 'derive', 'limits', 'on', 'a', 'variety', 'of', 'u1_x', 'models', 'that', 'induce', 'new', 'physics', 'contributions', 'to', 'neutrinoelectron', 'scattering', 'taking', 'into', 'account', 'interference', 'between', 'the', 'new', 'physics', 'and', 'standard', 'model', 'contributions', 'data', 'from', 'texono', 'charmii', 'and', 'gemma', 'are', 'analyzed', 'and', 'shown', 'to', 'be', 'complementary', 'to', 'each', 'other', 'to', 'provide', 'the', 'most', 'restrictive', 'bounds', 'on', 'masses', 'of', 'the', 'new', 'vector', 'bosons', 'in', 'particular', 'we', 'demonstrate', 'the', 'validity', 'of', 'our', 'results', 'to', 'dark', 'photonlike', 'as', 'well', 'as', 'light', 'zprime', 'models']] | [-0.04520725110334527, 0.15369231560622754, -0.06644703153179977, 0.15006638842529244, -0.10368305312219969, -0.15374150420491076, 0.04477925420037864, 0.3085456572607467, -0.22771056581495003, -0.33456325019258504, 0.05308213552817721, -0.26571767850174116, -0.0968656570352998, 0.21206561906128815, 0.015761212379336788, 0.018395431748994617, 0.02695763065988563, -0.021854385159628887, -0.058324775084872375, -0.22021361137980344, 0.2903731931000948, 0.014783732290619734, 0.24893311111582922, 0.13832860739095157, 0.10109773539990839, 0.001460220573527604, -0.042939352615707624, -0.05949477287796662, -0.17527875861372935, 0.10708140839310124, 0.17301642013855187, 0.11321435799610984, 0.11469138854605712, -0.4405623336044169, -0.2104343870971544, 0.11707716471678817, 0.13173386290400607, 0.126219219796974, -0.07525194943498474, -0.345226745994896, 0.04880292655554475, -0.18953910693718293, -0.07022633115501747, -0.127919223337175, -0.05794709800867383, -0.008005761769456193, -0.33171730564388724, 0.061837166965430235, -0.006899710642605943, -0.008551571431771382, -0.05991861092877219, -0.1795157119811791, -0.017441381018647215, 0.07048383765594707, 0.15453448511309653, -0.03377793575445017, 0.09533960421416025, -0.15483635776320992, -0.13009339205671064, 0.4210427804254763, -0.12315074328006696, -0.2081771951994484, 0.2178820090118757, -0.13603195800570791, -0.15433432212694712, 0.08350704414481969, 0.2546542893228668, 0.062140208127135506, -0.19490274047651857, 0.12079004872021429, -0.053391657923300244, 0.11319249044124459, -0.0002899423443241832, 0.09046202688057878, 0.21890765364214623, 0.17327707522721558, 0.0030739502309216665, 0.07941084200715569, -0.07524624184828933, -0.09711890359476362, -0.366096047127677, -0.12591627407603004, -0.07491136388853192, 0.028102899740597705, -0.07346297222589858, -0.09964778596150074, 0.3785385808993861, 0.17710077917184106, 0.22872033567388647, 0.0724758318020511, 0.3116319971831189, 0.1158029539642625, 0.07394304226354226, 0.02288516916181009, 0.2751311903492999, 0.17618927694665096, 0.022167481045171467, -0.17868963453064182, -0.004167143424694455, 0.06223905328949241] |
1,803.00061 | Glass transition temperature of PMMA/modified alumina nanocomposite:
Molecular dynamic study | In this study, the effect of alumina and modified alumina nanoparticles in a
PMMA/alumina nanocomposite was investigated. To attain this goal, the glass
transition behavior of poly methyl methacrylate (PMMA), PMMA/alumina and
PMMA/hydroxylated alumina nanocomposites were investigated by molecular dynamic
simulations (MD). All the MD simulations were performed using the Materials
Studio 6.0 software package of Accelrys. To obtain the glass transition
temperature, the variation of density vs. temperature was obtained. The
temperature at which the slope of the density-temperature curve observably
changes is defined as the glass transition temperature (Tg). The effect of
alumina nanoparticles on the Tg was related to the free volume and the mobility
of chain segments and the interaction between the alumina nanoparticles and the
polymer. The mobility of the chain segments was investigated based on the mean
square displacement and radius gyration. The results show that the increasement
the Tg of the PMMA/hydroxylated alumina nanocomposite is more than that of the
PMMA/alumina nanocomposite due to the modification of the alumina
nanoparticles.
| cond-mat.mtrl-sci physics.app-ph | in this study the effect of alumina and modified alumina nanoparticles in a pmmaalumina nanocomposite was investigated to attain this goal the glass transition behavior of poly methyl methacrylate pmma pmmaalumina and pmmahydroxylated alumina nanocomposites were investigated by molecular dynamic simulations md all the md simulations were performed using the materials studio 60 software package of accelrys to obtain the glass transition temperature the variation of density vs temperature was obtained the temperature at which the slope of the densitytemperature curve observably changes is defined as the glass transition temperature tg the effect of alumina nanoparticles on the tg was related to the free volume and the mobility of chain segments and the interaction between the alumina nanoparticles and the polymer the mobility of the chain segments was investigated based on the mean square displacement and radius gyration the results show that the increasement the tg of the pmmahydroxylated alumina nanocomposite is more than that of the pmmaalumina nanocomposite due to the modification of the alumina nanoparticles | [['in', 'this', 'study', 'the', 'effect', 'of', 'alumina', 'and', 'modified', 'alumina', 'nanoparticles', 'in', 'a', 'pmmaalumina', 'nanocomposite', 'was', 'investigated', 'to', 'attain', 'this', 'goal', 'the', 'glass', 'transition', 'behavior', 'of', 'poly', 'methyl', 'methacrylate', 'pmma', 'pmmaalumina', 'and', 'pmmahydroxylated', 'alumina', 'nanocomposites', 'were', 'investigated', 'by', 'molecular', 'dynamic', 'simulations', 'md', 'all', 'the', 'md', 'simulations', 'were', 'performed', 'using', 'the', 'materials', 'studio', '60', 'software', 'package', 'of', 'accelrys', 'to', 'obtain', 'the', 'glass', 'transition', 'temperature', 'the', 'variation', 'of', 'density', 'vs', 'temperature', 'was', 'obtained', 'the', 'temperature', 'at', 'which', 'the', 'slope', 'of', 'the', 'densitytemperature', 'curve', 'observably', 'changes', 'is', 'defined', 'as', 'the', 'glass', 'transition', 'temperature', 'tg', 'the', 'effect', 'of', 'alumina', 'nanoparticles', 'on', 'the', 'tg', 'was', 'related', 'to', 'the', 'free', 'volume', 'and', 'the', 'mobility', 'of', 'chain', 'segments', 'and', 'the', 'interaction', 'between', 'the', 'alumina', 'nanoparticles', 'and', 'the', 'polymer', 'the', 'mobility', 'of', 'the', 'chain', 'segments', 'was', 'investigated', 'based', 'on', 'the', 'mean', 'square', 'displacement', 'and', 'radius', 'gyration', 'the', 'results', 'show', 'that', 'the', 'increasement', 'the', 'tg', 'of', 'the', 'pmmahydroxylated', 'alumina', 'nanocomposite', 'is', 'more', 'than', 'that', 'of', 'the', 'pmmaalumina', 'nanocomposite', 'due', 'to', 'the', 'modification', 'of', 'the', 'alumina', 'nanoparticles']] | [-0.07342287154354314, 0.1866747963656785, -0.08931583427063121, -0.06115771401332828, 0.02589457168346044, -0.0883715685156015, 0.01598745600814454, 0.4433561970434356, -0.19337930367328227, -0.2950195316338866, 0.07243192362139092, -0.32037112800824663, -0.12305826826089221, 0.11091663515217966, 0.02236525996420646, 0.054015644949508786, -0.03193669977296916, -0.01094357608306426, -0.06020044962160017, -0.19354128977425805, 0.20596493267107802, 0.11131780937018736, 0.3213525421508565, 0.1226417995945312, 0.06014794817046339, -0.006706819335771043, 0.06837565187654435, 0.0654341329816195, -0.24275282278088015, 0.08190385317228481, 0.1906725303259275, -0.05805105794836602, 0.16507035502936782, -0.4280566482055115, -0.22711454353454272, 0.02509811111277242, 0.08863473755077504, 0.05188954043664924, -0.030389535437191115, -0.24078890412091847, 0.09584175154180606, -0.1219860221423981, -0.11061535881500033, 0.02560262404603702, 0.011034929806866297, 0.06329720239325358, -0.2156178967476391, 0.08057726283625859, 0.04108658637397173, 0.1105815414339304, -0.07415384045665765, -0.160219087095068, -0.06088443961641865, 0.07706419455750686, 0.0318650216994262, -0.017691849828868105, 0.3204921064444068, -0.08114767778187809, -0.02160805068546679, 0.38504368122439925, -0.07473807848988899, -0.06848095310851932, 0.17944998016563904, -0.144040193468355, -0.013701829965589794, 0.2215190695644152, 0.12640572422774646, 0.1405120675435017, -0.18932168370839664, 0.027091542605975096, 0.026128819314535798, 0.2423887376605374, 0.1362105283329672, -0.0665420268991644, 0.1721429355050687, 0.24067120789550245, -0.0659427804611169, 0.22226971818138447, -0.1290599847462301, -0.04011535508098171, -0.1482947219344901, -0.235178979698614, -0.2347769739834603, 0.02328225573604336, -0.14825273333944342, -0.21366714664291953, 0.35617331317739515, 0.08789609009280445, 0.14205999563096045, 0.04030232625039544, 0.21431722560976973, 0.015822832724618974, 0.0856374337649535, -0.007750877883376145, 0.24146763679128502, 0.19288122581201605, 0.14568319104657304, -0.3142656640479023, 0.10845054944170775, 0.03625067961884935] |
1,803.00062 | Four Aspects of Superoscillations | A function f is said to possess superoscillations if, in a finite region, f
oscillates faster than the shortest wavelength that occurs in the Fourier
transform of f. I will discuss four aspects of superoscillations: 1.
Superoscillations can be generated efficiently and stably through
multiplication. 2. There is a win-win situation in the sense that even in
circumstances where superoscillations cannot be used for superresolution, they
can be useful for what may be called superabsorption, an effective
up-conversion of low frequencies 3. The study of superoscillations may be
useful for generalizing the Shannon Hartley noisy channel capacity theorem. 4.
The phenomenon of superoscillations naturally generalizes beyond bandlimited
functions.
| math-ph math.MP physics.bio-ph physics.class-ph quant-ph | a function f is said to possess superoscillations if in a finite region f oscillates faster than the shortest wavelength that occurs in the fourier transform of f i will discuss four aspects of superoscillations 1 superoscillations can be generated efficiently and stably through multiplication 2 there is a winwin situation in the sense that even in circumstances where superoscillations cannot be used for superresolution they can be useful for what may be called superabsorption an effective upconversion of low frequencies 3 the study of superoscillations may be useful for generalizing the shannon hartley noisy channel capacity theorem 4 the phenomenon of superoscillations naturally generalizes beyond bandlimited functions | [['a', 'function', 'f', 'is', 'said', 'to', 'possess', 'superoscillations', 'if', 'in', 'a', 'finite', 'region', 'f', 'oscillates', 'faster', 'than', 'the', 'shortest', 'wavelength', 'that', 'occurs', 'in', 'the', 'fourier', 'transform', 'of', 'f', 'i', 'will', 'discuss', 'four', 'aspects', 'of', 'superoscillations', '1', 'superoscillations', 'can', 'be', 'generated', 'efficiently', 'and', 'stably', 'through', 'multiplication', '2', 'there', 'is', 'a', 'winwin', 'situation', 'in', 'the', 'sense', 'that', 'even', 'in', 'circumstances', 'where', 'superoscillations', 'can', 'not', 'be', 'used', 'for', 'superresolution', 'they', 'can', 'be', 'useful', 'for', 'what', 'may', 'be', 'called', 'superabsorption', 'an', 'effective', 'upconversion', 'of', 'low', 'frequencies', '3', 'the', 'study', 'of', 'superoscillations', 'may', 'be', 'useful', 'for', 'generalizing', 'the', 'shannon', 'hartley', 'noisy', 'channel', 'capacity', 'theorem', '4', 'the', 'phenomenon', 'of', 'superoscillations', 'naturally', 'generalizes', 'beyond', 'bandlimited', 'functions']] | [-0.1359012600615484, 0.19024251165723433, -0.12446505125236074, 0.13854040471418255, -0.08039098171038775, -0.1867795673267352, 0.005616651034119342, 0.3741523118608486, -0.319245424356585, -0.21276993529204655, 0.1145017146081621, -0.20632470938910563, -0.17621936042656386, 0.2506406715998443, -0.1382613026244895, -0.015340918999746305, 0.033777044932229806, 0.06047679567624123, -0.051854122783604226, -0.21558822082449605, 0.245535741451222, 0.033023637209200825, 0.2245179191733702, 0.03922565496866292, 0.033439907706727126, 0.001905543037579147, 0.052868139652381525, 0.004191039993060292, -0.09107468340616917, 0.038531066285907675, 0.3331876341424404, 0.157688353398661, 0.28337753931521825, -0.3920217016711831, -0.23452770359677458, 0.17118909389395778, 0.21370787552874024, 0.040589608482743074, 0.005500513337202233, -0.2287297983260808, 0.12334662145794019, -0.12605068024777627, -0.10720645266354357, -0.051569021507721705, 0.02950797959256473, 0.0028815897792543567, -0.3180454507717914, 0.05571620100377546, 0.09628542938051797, 0.013208177009033501, -0.0021039462870482456, -0.07933562258343904, 0.023465090572520015, 0.10362095463969702, -0.016459642647265738, 0.07464033407543641, 0.11080120506038496, -0.09982923350356725, -0.08284771210543913, 0.3628191225692083, -0.09989238307032192, -0.21929793111985835, 0.14984062954905195, -0.19356477148660006, -0.08152171529385202, 0.16898361195323117, 0.12203530155959616, 0.1287054045963178, -0.10724964226572561, 0.09562426033710693, -0.04215991428258632, 0.15904898253491645, 0.1531197559003026, 0.08582331192489594, 0.18371821493294876, 0.08352439883891322, 0.09088900145741367, 0.14416067656279122, -0.04541582308299498, -0.024817279510097493, -0.2730713059373815, -0.14029999680757319, -0.21653287244935032, 0.08304539857522494, -0.05097412252187229, -0.10688440080271785, 0.3824331712302402, 0.14072090311514196, 0.15452357095350092, 0.02046382907615684, 0.2471177917349776, 0.16517677946750997, 0.09379978234871128, 0.0870762048118295, 0.21843970273279611, 0.11761796136318338, 0.07050857453290886, -0.11799298732866183, 0.03991432996987955, 0.049452832199359704] |
1,803.00063 | Correlated random walks of human embryonic stem cell in-vitro | We perform a detailed analysis of the migratory motion of human embryonic
stem cells in two-dimensions, both when isolated and in close proximity to
another cell, recorded with time-lapse microscopic imaging. We show that
isolated cells tend to perform an unusual locally anisotropic walk, moving
backwards and forwards along a preferred local direction correlated over a
timescale of around 50 minutes and aligned with the axis of the cell
elongation. Increasing elongation of the cell shape is associated with
increased instantaneous migration speed. We also show that two cells in close
proximity tend to move in the same direction, with the average separation of 70
um or less and the correlation length of around 25 um, a typical cell diameter.
These results can be used as a basis for the mathematical modelling of the
formation of clonal hESC colonies.
| q-bio.CB physics.bio-ph q-bio.TO | we perform a detailed analysis of the migratory motion of human embryonic stem cells in twodimensions both when isolated and in close proximity to another cell recorded with timelapse microscopic imaging we show that isolated cells tend to perform an unusual locally anisotropic walk moving backwards and forwards along a preferred local direction correlated over a timescale of around 50 minutes and aligned with the axis of the cell elongation increasing elongation of the cell shape is associated with increased instantaneous migration speed we also show that two cells in close proximity tend to move in the same direction with the average separation of 70 um or less and the correlation length of around 25 um a typical cell diameter these results can be used as a basis for the mathematical modelling of the formation of clonal hesc colonies | [['we', 'perform', 'a', 'detailed', 'analysis', 'of', 'the', 'migratory', 'motion', 'of', 'human', 'embryonic', 'stem', 'cells', 'in', 'twodimensions', 'both', 'when', 'isolated', 'and', 'in', 'close', 'proximity', 'to', 'another', 'cell', 'recorded', 'with', 'timelapse', 'microscopic', 'imaging', 'we', 'show', 'that', 'isolated', 'cells', 'tend', 'to', 'perform', 'an', 'unusual', 'locally', 'anisotropic', 'walk', 'moving', 'backwards', 'and', 'forwards', 'along', 'a', 'preferred', 'local', 'direction', 'correlated', 'over', 'a', 'timescale', 'of', 'around', '50', 'minutes', 'and', 'aligned', 'with', 'the', 'axis', 'of', 'the', 'cell', 'elongation', 'increasing', 'elongation', 'of', 'the', 'cell', 'shape', 'is', 'associated', 'with', 'increased', 'instantaneous', 'migration', 'speed', 'we', 'also', 'show', 'that', 'two', 'cells', 'in', 'close', 'proximity', 'tend', 'to', 'move', 'in', 'the', 'same', 'direction', 'with', 'the', 'average', 'separation', 'of', '70', 'um', 'or', 'less', 'and', 'the', 'correlation', 'length', 'of', 'around', '25', 'um', 'a', 'typical', 'cell', 'diameter', 'these', 'results', 'can', 'be', 'used', 'as', 'a', 'basis', 'for', 'the', 'mathematical', 'modelling', 'of', 'the', 'formation', 'of', 'clonal', 'hesc', 'colonies']] | [-0.10772804925117722, 0.14588506321898886, -0.0357236379033906, 0.020567886327835565, -0.03432465119876986, -0.11557060053149948, 0.0604753308054713, 0.434316825691155, -0.2822801003219198, -0.2774300945239316, 0.06671664325424918, -0.2771634181296426, -0.13718507384794276, 0.15794859222042634, -0.053972253287814076, -0.043359384021098665, 0.05916119810016223, 0.04863087736445365, -0.026021470895318463, -0.19028908965720548, 0.1830487687747068, 0.0580504864138943, 0.28862880958954423, -0.02816506119766574, 0.083631176727643, -0.014531364216362025, -0.02593378197039953, 0.06494352249964642, -0.12001131094119884, 0.12506390478890791, 0.1683120310051943, 0.05882709423455296, 0.26919126729547926, -0.4864375041998762, -0.17564006985279082, 0.05113391511195855, 0.23567714883932064, 0.0902735013548258, -0.02820724445368371, -0.22678327101128673, 0.10793261405536168, -0.11192462240553482, -0.1977655072529003, 0.048005467970862234, 0.058979086802347744, 0.06834652952903467, -0.22579034748855684, 0.13745032791060852, 0.024581124518642857, 0.1129699273892551, -0.09259558196527977, -0.07561506385573273, -0.07777324428433459, 0.17176886501645824, 0.03592497112879382, 0.0662021136795767, 0.21138688993955151, -0.08785463329203588, -0.10211649903543495, 0.3631022531512401, -0.02273859887169473, -0.16973548034614744, 0.25063457825763835, -0.205738609189774, -0.0675625287016465, 0.19416155521221887, 0.18330580219224418, 0.09113415375874519, -0.11679359845929736, -0.047088893956216654, -0.008036404623643315, 0.18588306701896215, 0.12259064599362424, -0.0064185561441394276, 0.24324438567172815, 0.20387430176668192, 0.04829594425910668, 0.09293572812109999, -0.19416227435614417, -0.11860108957793429, -0.23042311857407577, -0.16313384567126096, -0.11316498004322162, 0.05243749323672876, -0.11414617161047075, -0.16200047927044278, 0.3753392556146216, 0.1085545434080493, 0.23488493320672846, 0.05952190608958707, 0.24609414945698257, 0.023134747398648705, 0.11717536805613006, 0.034597083177457716, 0.20559453855355758, 0.09265445461814968, 0.1245274502380329, -0.26324471550249906, 0.06939165045594355, -0.011395780451716386] |
1,803.00064 | Hamiltonian cycles in hypercubes with faulty edges | Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2n-4$
faulty edges, Information Sciences, 215 (2012) 75--82] observed that the
hypercube $Q_n$ is not Hamiltonian if it contains a trap disconnected halfway.
A proper subgraph $T$ is disconnected halfway if at least half of its nodes
have parity 0 (or 1, resp.) and the edges joining all nodes of parity 0 (or 1,
resp.) in $T$ with nodes outside $T$, are faulty. The simplest examples of such
traps are: (1) a vertex with $n-1$ incident faulty edges, or (2) a cycle
$(u,v,w,x)$, where all edges going out of the cycle from $u$ and $w$ are
faulty. In this paper we describe all traps disconnected halfway $T$ with the
size $|T|\le8$, and discuss the problem whether there exist small sets of
faulty edges which preclude Hamiltonian cycles and are not based on sets
disconnected halfway. We describe heuristic which detects sets of faulty edges
which preclude HC also those sets that are not based on subgraphs disconnected
halfway. We describe all $Q_4$ cubes that are not Hamiltonian, and all $Q_5$
cubes with 8 or 9 faulty edges that are not Hamiltonian.
| cs.DM math.CO | szepietowski a szepietowski hamiltonian cycles in hypercubes with 2n4 faulty edges information sciences 215 2012 7582 observed that the hypercube q_n is not hamiltonian if it contains a trap disconnected halfway a proper subgraph t is disconnected halfway if at least half of its nodes have parity 0 or 1 resp and the edges joining all nodes of parity 0 or 1 resp in t with nodes outside t are faulty the simplest examples of such traps are 1 a vertex with n1 incident faulty edges or 2 a cycle uvwx where all edges going out of the cycle from u and w are faulty in this paper we describe all traps disconnected halfway t with the size tle8 and discuss the problem whether there exist small sets of faulty edges which preclude hamiltonian cycles and are not based on sets disconnected halfway we describe heuristic which detects sets of faulty edges which preclude hc also those sets that are not based on subgraphs disconnected halfway we describe all q_4 cubes that are not hamiltonian and all q_5 cubes with 8 or 9 faulty edges that are not hamiltonian | [['szepietowski', 'a', 'szepietowski', 'hamiltonian', 'cycles', 'in', 'hypercubes', 'with', '2n4', 'faulty', 'edges', 'information', 'sciences', '215', '2012', '7582', 'observed', 'that', 'the', 'hypercube', 'q_n', 'is', 'not', 'hamiltonian', 'if', 'it', 'contains', 'a', 'trap', 'disconnected', 'halfway', 'a', 'proper', 'subgraph', 't', 'is', 'disconnected', 'halfway', 'if', 'at', 'least', 'half', 'of', 'its', 'nodes', 'have', 'parity', '0', 'or', '1', 'resp', 'and', 'the', 'edges', 'joining', 'all', 'nodes', 'of', 'parity', '0', 'or', '1', 'resp', 'in', 't', 'with', 'nodes', 'outside', 't', 'are', 'faulty', 'the', 'simplest', 'examples', 'of', 'such', 'traps', 'are', '1', 'a', 'vertex', 'with', 'n1', 'incident', 'faulty', 'edges', 'or', '2', 'a', 'cycle', 'uvwx', 'where', 'all', 'edges', 'going', 'out', 'of', 'the', 'cycle', 'from', 'u', 'and', 'w', 'are', 'faulty', 'in', 'this', 'paper', 'we', 'describe', 'all', 'traps', 'disconnected', 'halfway', 't', 'with', 'the', 'size', 'tle8', 'and', 'discuss', 'the', 'problem', 'whether', 'there', 'exist', 'small', 'sets', 'of', 'faulty', 'edges', 'which', 'preclude', 'hamiltonian', 'cycles', 'and', 'are', 'not', 'based', 'on', 'sets', 'disconnected', 'halfway', 'we', 'describe', 'heuristic', 'which', 'detects', 'sets', 'of', 'faulty', 'edges', 'which', 'preclude', 'hc', 'also', 'those', 'sets', 'that', 'are', 'not', 'based', 'on', 'subgraphs', 'disconnected', 'halfway', 'we', 'describe', 'all', 'q_4', 'cubes', 'that', 'are', 'not', 'hamiltonian', 'and', 'all', 'q_5', 'cubes', 'with', '8', 'or', '9', 'faulty', 'edges', 'that', 'are', 'not', 'hamiltonian']] | [-0.20047175161102238, 0.2029815405058764, 0.029502526642804477, 0.015533569879595808, -0.05394918892911092, -0.20574192989139475, 0.09261755460566956, 0.37986689385644257, -0.22969470114601567, -0.2787746911296337, 0.10771091866623211, -0.3956176043129501, -0.10993149413921458, 0.05808603236909936, -0.07230013021003993, -0.03003377273191952, 0.14390169127401023, 0.10757561194595885, 0.031043936682735536, -0.2773664856658262, 0.2846543306701463, -0.08672761652502854, 0.129592449355741, 0.044165715921001276, 0.03993268639725797, 0.020016282763242483, 0.03773466000373271, 0.08191758781337842, -0.12135312625752977, 0.014540512405490294, 0.2531633078255118, 0.1376336381676044, 0.23478190885684927, -0.4529735063486558, -0.10720401120192824, 0.18448314961434448, 0.12106380357038489, 0.05101131202147546, 0.06727412839440061, -0.2145346788985824, 0.1445435018124268, -0.10538987436625648, -0.1035807308862932, -0.005193993035843347, 0.08747266477423989, 0.00843890764835206, -0.22444619651246359, -0.00023556367589414796, 0.11247770316751902, 0.06439328211593755, 0.023970012002086694, -0.1782311195168983, -0.09760275694173089, 0.13008774433753148, -0.06658992247486656, 0.06397009132937952, 0.11000775301799098, -0.040835010632218914, -0.16233855582036597, 0.34406915815039113, 0.061496421918870614, -0.15077536658229515, 0.18265760410701568, -0.17419904646374046, -0.16879798907706922, 0.15542905216409084, 0.0731908433627397, 0.1115839286921496, -0.1292049024928919, 0.12059851549939317, -0.05184128946241211, 0.10841711684046712, 0.1593088109213062, 0.020618270644370246, 0.16621177982822818, 0.06608831248978242, 0.15791178657424282, 0.1020035443249791, -0.05942498810058908, -0.03693709589595742, -0.33085701632547504, -0.0798538069733802, -0.22234287246735518, 0.08023061244139998, -0.10918431356261338, -0.20496270491836224, 0.38576012268104654, 0.11839462497475792, 0.24340882156054205, 0.04151801585984282, 0.2665140903131528, 0.031735060544794094, 0.09603339889701387, 0.221465458371303, 0.1649532491991167, 0.09591994072400273, -0.03761202314766472, -0.14082401098507918, 0.017498196212246138, 0.07382689238610593] |
1,803.00065 | Magnetic Reconnection May Control the Ion-Scale Spectral Break of Solar
Wind Turbulence | The power spectral density of magnetic fluctuations in the solar wind
exhibits several power-law-like frequency ranges with a well defined break
between approximately 0.1 and 1 Hz in the spacecraft frame. The exact
dependence of this break scale on solar wind parameters has been extensively
studied but is not yet fully understood. Recent studies have suggested that
reconnection may induce a break in the spectrum at a "disruption scale"
$\lambda_D$, which may be larger than the fundamental ion kinetic scales,
producing an unusually steep spectrum just below the break. We present a
statistical investigation of the dependence of the break scale on the proton
gyroradius $\rho_i$, ion inertial length $d_i$, ion sound radius $\rho_s$,
proton-cyclotron resonance scale $\rho_c$ and disruption scale $\lambda_D$ as a
function of $\beta_{\perp i}$. We find that the steepest spectral indices of
the dissipation range occur when $\beta_e$ is in the range of 0.1-1 and the
break scale is only slightly larger than the ion sound scale (a situation
occurring 41% of the time at 1 AU), in qualitative agreement with the
reconnection model. In this range the break scale shows remarkably good
correlation with $\lambda_D$. Our findings suggest that, at least at low
$\beta_e$, reconnection may play an important role in the development of the
dissipation range turbulent cascade and causes unusually steep (steeper than
-3) spectral indices.
| physics.space-ph | the power spectral density of magnetic fluctuations in the solar wind exhibits several powerlawlike frequency ranges with a well defined break between approximately 01 and 1 hz in the spacecraft frame the exact dependence of this break scale on solar wind parameters has been extensively studied but is not yet fully understood recent studies have suggested that reconnection may induce a break in the spectrum at a disruption scale lambda_d which may be larger than the fundamental ion kinetic scales producing an unusually steep spectrum just below the break we present a statistical investigation of the dependence of the break scale on the proton gyroradius rho_i ion inertial length d_i ion sound radius rho_s protoncyclotron resonance scale rho_c and disruption scale lambda_d as a function of beta_perp i we find that the steepest spectral indices of the dissipation range occur when beta_e is in the range of 011 and the break scale is only slightly larger than the ion sound scale a situation occurring 41 of the time at 1 au in qualitative agreement with the reconnection model in this range the break scale shows remarkably good correlation with lambda_d our findings suggest that at least at low beta_e reconnection may play an important role in the development of the dissipation range turbulent cascade and causes unusually steep steeper than 3 spectral indices | [['the', 'power', 'spectral', 'density', 'of', 'magnetic', 'fluctuations', 'in', 'the', 'solar', 'wind', 'exhibits', 'several', 'powerlawlike', 'frequency', 'ranges', 'with', 'a', 'well', 'defined', 'break', 'between', 'approximately', '01', 'and', '1', 'hz', 'in', 'the', 'spacecraft', 'frame', 'the', 'exact', 'dependence', 'of', 'this', 'break', 'scale', 'on', 'solar', 'wind', 'parameters', 'has', 'been', 'extensively', 'studied', 'but', 'is', 'not', 'yet', 'fully', 'understood', 'recent', 'studies', 'have', 'suggested', 'that', 'reconnection', 'may', 'induce', 'a', 'break', 'in', 'the', 'spectrum', 'at', 'a', 'disruption', 'scale', 'lambda_d', 'which', 'may', 'be', 'larger', 'than', 'the', 'fundamental', 'ion', 'kinetic', 'scales', 'producing', 'an', 'unusually', 'steep', 'spectrum', 'just', 'below', 'the', 'break', 'we', 'present', 'a', 'statistical', 'investigation', 'of', 'the', 'dependence', 'of', 'the', 'break', 'scale', 'on', 'the', 'proton', 'gyroradius', 'rho_i', 'ion', 'inertial', 'length', 'd_i', 'ion', 'sound', 'radius', 'rho_s', 'protoncyclotron', 'resonance', 'scale', 'rho_c', 'and', 'disruption', 'scale', 'lambda_d', 'as', 'a', 'function', 'of', 'beta_perp', 'i', 'we', 'find', 'that', 'the', 'steepest', 'spectral', 'indices', 'of', 'the', 'dissipation', 'range', 'occur', 'when', 'beta_e', 'is', 'in', 'the', 'range', 'of', '011', 'and', 'the', 'break', 'scale', 'is', 'only', 'slightly', 'larger', 'than', 'the', 'ion', 'sound', 'scale', 'a', 'situation', 'occurring', '41', 'of', 'the', 'time', 'at', '1', 'au', 'in', 'qualitative', 'agreement', 'with', 'the', 'reconnection', 'model', 'in', 'this', 'range', 'the', 'break', 'scale', 'shows', 'remarkably', 'good', 'correlation', 'with', 'lambda_d', 'our', 'findings', 'suggest', 'that', 'at', 'least', 'at', 'low', 'beta_e', 'reconnection', 'may', 'play', 'an', 'important', 'role', 'in', 'the', 'development', 'of', 'the', 'dissipation', 'range', 'turbulent', 'cascade', 'and', 'causes', 'unusually', 'steep', 'steeper', 'than', '3', 'spectral', 'indices']] | [-0.13782313299550977, 0.2201960237859591, -0.06142647244190369, 0.12035930974918695, -0.017461773000766633, -0.11644361716740227, -0.03845792727624611, 0.36461515752346935, -0.2307785525288735, -0.3808849165971215, 0.059151436890756526, -0.25181953929708684, -0.015416577861115738, 0.20240065376594168, 0.029117659132860532, 0.0031650690241246944, 0.004733361916297728, -0.001964458660851862, -0.07057266601682263, -0.11020943456274869, 0.25206070804238523, 0.1464993514095408, 0.26263429444736325, 0.08240697221101057, 0.04337160584206382, -0.0890579643042607, 0.03335280846101693, 0.023596326245817246, -0.16301382479447582, 0.033961837755742706, 0.19505575342263254, 0.020884384483996744, 0.2842320076437449, -0.4014932305828945, -0.25506186241552503, 0.0712831138385678, 0.21955573635054165, 0.039686236474432285, -0.02809721875572913, -0.15476324645433207, 0.07983039192690698, -0.17754773637290355, -0.1408752035297168, 0.025175878740343695, 0.07810601971305169, 0.012569420390210726, -0.27500627370475716, 0.18497548512495668, 0.05286023177275736, 0.12100427047777418, -0.058538036783821544, -0.10958063482466313, -0.023847134242690093, 0.058592676847511356, 0.11382093156010399, 0.05866756927649919, 0.19561344606231326, -0.10662233713921998, -0.01627855696114984, 0.3830896497972578, -0.05847910608301046, -0.06000942585419293, 0.18915663639855412, -0.2371448213444301, -0.14034478577181092, 0.17238710034923913, 0.1284072613688385, 0.08150541030399099, -0.054022686812737725, 0.03023653148753707, -0.010551160335150623, 0.247250244626369, 0.09056340723176831, 0.06180696132359371, 0.2294796461856668, 0.17424928839134918, 0.056632780297952996, 0.055147466037384664, -0.15079160831786842, -0.05295373927822823, -0.2932965238243006, -0.06836307041403661, -0.16006439184740623, 0.06652782405823625, -0.12371890380037823, -0.1326355117327022, 0.39323707592048524, 0.16280491220469057, 0.2476701236220899, 0.04737395976370133, 0.23775706902148436, 0.1735411729424487, 0.10883429797517287, 0.12839126028225398, 0.297187516348319, 0.09141981595579686, 0.15155375824385398, -0.2450899838738412, 0.051645495445857684, 0.006533669581561274] |
1,803.00066 | Gluing methods for vortex dynamics in Euler flows | A classical problem for the two-dimensional Euler flow for an incompressible
fluid confined to a smooth domain. is that of finding regular solutions with
highly concentrated vorticities around $N$ moving {\em vortices}. The formal
dynamic law for such objects was first derived in the 19th century by Kirkhoff
and Routh. In this paper we devise a {\em gluing approach} for the construction
of smooth $N$-vortex solutions. We capture in high precision the core of each
vortex as a scaled finite mass solution of Liouville's equation plus small,
more regular terms. Gluing methods have been a powerful tool in geometric
constructions by {\em desingularization}. We succeed in applying those ideas in
this highly challenging setting.
| math.AP | a classical problem for the twodimensional euler flow for an incompressible fluid confined to a smooth domain is that of finding regular solutions with highly concentrated vorticities around n moving em vortices the formal dynamic law for such objects was first derived in the 19th century by kirkhoff and routh in this paper we devise a em gluing approach for the construction of smooth nvortex solutions we capture in high precision the core of each vortex as a scaled finite mass solution of liouvilles equation plus small more regular terms gluing methods have been a powerful tool in geometric constructions by em desingularization we succeed in applying those ideas in this highly challenging setting | [['a', 'classical', 'problem', 'for', 'the', 'twodimensional', 'euler', 'flow', 'for', 'an', 'incompressible', 'fluid', 'confined', 'to', 'a', 'smooth', 'domain', 'is', 'that', 'of', 'finding', 'regular', 'solutions', 'with', 'highly', 'concentrated', 'vorticities', 'around', 'n', 'moving', 'em', 'vortices', 'the', 'formal', 'dynamic', 'law', 'for', 'such', 'objects', 'was', 'first', 'derived', 'in', 'the', '19th', 'century', 'by', 'kirkhoff', 'and', 'routh', 'in', 'this', 'paper', 'we', 'devise', 'a', 'em', 'gluing', 'approach', 'for', 'the', 'construction', 'of', 'smooth', 'nvortex', 'solutions', 'we', 'capture', 'in', 'high', 'precision', 'the', 'core', 'of', 'each', 'vortex', 'as', 'a', 'scaled', 'finite', 'mass', 'solution', 'of', 'liouvilles', 'equation', 'plus', 'small', 'more', 'regular', 'terms', 'gluing', 'methods', 'have', 'been', 'a', 'powerful', 'tool', 'in', 'geometric', 'constructions', 'by', 'em', 'desingularization', 'we', 'succeed', 'in', 'applying', 'those', 'ideas', 'in', 'this', 'highly', 'challenging', 'setting']] | [-0.13588852560522643, 0.07291443415711926, -0.11321599364478503, 0.06075422372565959, -0.09531774541231251, -0.14485825867334431, -0.030877200388236267, 0.30721304049731885, -0.27416602795762296, -0.2749564334733692, 0.10682105418682032, -0.23195868498332534, -0.13735675548236256, 0.1912094507679607, -0.12512287751779752, 0.08794803704769738, 0.0587235571243759, 0.003604498821665096, -0.062209832665419816, -0.21645902295440303, 0.33289614719940364, -0.0064256819525519305, 0.2520375165231196, -0.020496900011043567, 0.10825446802315063, -0.004869153043172792, -0.011820419382435821, 0.07995582585000491, -0.1623494997366246, 0.12460908406121508, 0.26759966023150933, 0.06718270566798148, 0.2778829156165629, -0.44162662820148785, -0.19685955361676385, 0.08530480791897044, 0.17030294901543025, 0.11499389150155197, -0.07588677261958611, -0.25750246333716587, 0.10211919110054068, -0.15875634758741455, -0.19966046879710878, -0.08169598787594422, 0.06304881982999828, 0.041849193752504295, -0.22269596808911424, 0.06008580795270844, 0.09428051864188494, 0.054586735805414156, -0.06834583544889383, -0.05724776851886933, 0.024874565841638344, 0.07274712755270632, 0.017706761637339946, 0.045928655678521745, 0.056902001072050984, -0.15869539264492707, -0.08933121128939092, 0.38584316502102706, -0.0626221037123649, -0.24540742840288224, 0.17368592343919506, -0.09270824906539864, -0.1400329599824561, 0.16881078262854599, 0.1448690620687815, 0.21276849418791244, -0.13466412267458122, 0.09843546374591759, -0.08441812415871011, 0.09205298813109376, 0.11706771787288969, -0.05006988506879559, 0.19528770218479685, 0.17773637389846608, 0.0954019053843268, 0.12705783307577062, -0.058096583776044104, -0.1310530646283806, -0.2864667034287632, -0.16560452745684456, -0.17365946050164643, 0.061380587961211534, -0.08656668181279241, -0.20951163495140793, 0.35794734054006044, 0.0748935474337293, 0.17170810405205136, 0.06202897792208149, 0.2963805267900492, 0.11756231646420252, 0.014885603540898424, 0.11490359184161175, 0.20995900230441011, 0.1440926421520226, 0.12546302557848724, -0.13910440423122022, -0.006587229333241034, 0.17373021145194636] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.