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.0316 | Distributed Spanner Approximation | We address the fundamental network design problem of constructing approximate
minimum spanners. Our contributions are for the distributed setting, providing
both algorithmic and hardness results.
Our main hardness result shows that an $\alpha$-approximation for the minimum
directed $k$-spanner problem for $k \geq 5$ requires $\Omega(n
/\sqrt{\alpha}\log{n})$ rounds using deterministic algorithms or
$\Omega(\sqrt{n }/\sqrt{\alpha}\log{n})$ rounds using randomized ones, in the
CONGEST model of distributed computing. Combined with the constant-round
$O(n^{\epsilon})$-approximation algorithm in the LOCAL model of [Barenboim,
Elkin and Gavoille, 2016], as well as a polylog-round
$(1+\epsilon)$-approximation algorithm in the LOCAL model that we show here,
our lower bounds for the CONGEST model imply a strict separation between the
LOCAL and CONGEST models. Notably, to the best of our knowledge, this is the
first separation between these models for a local approximation problem.
Similarly, a separation between the directed and undirected cases is implied.
We also prove a nearly-linear lower bound for the minimum weighted $k$-spanner
problem for $k \geq 4$, and we show lower bounds for the weighted 2-spanner
problem.
On the algorithmic side, apart from the aforementioned
$(1+\epsilon)$-approximation algorithm for minimum $k$-spanners, our main
contribution is a new distributed construction of minimum 2-spanners that uses
only polynomial local computations. Our algorithm has a guaranteed
approximation ratio of $O(\log(m/n))$ for a graph with $n$ vertices and $m$
edges, which matches the best known ratio for polynomial time sequential
algorithms [Kortsarz and Peleg, 1994], and is tight if we restrict ourselves to
polynomial local computations. Our approach allows us to extend our algorithm
to work also for the directed, weighted, and client-server variants of the
problem.
| cs.DS cs.DC | we address the fundamental network design problem of constructing approximate minimum spanners our contributions are for the distributed setting providing both algorithmic and hardness results our main hardness result shows that an alphaapproximation for the minimum directed kspanner problem for k geq 5 requires omegan sqrtalphalogn rounds using deterministic algorithms or omegasqrtn sqrtalphalogn rounds using randomized ones in the congest model of distributed computing combined with the constantround onepsilonapproximation algorithm in the local model of barenboim elkin and gavoille 2016 as well as a polyloground 1epsilonapproximation algorithm in the local model that we show here our lower bounds for the congest model imply a strict separation between the local and congest models notably to the best of our knowledge this is the first separation between these models for a local approximation problem similarly a separation between the directed and undirected cases is implied we also prove a nearlylinear lower bound for the minimum weighted kspanner problem for k geq 4 and we show lower bounds for the weighted 2spanner problem on the algorithmic side apart from the aforementioned 1epsilonapproximation algorithm for minimum kspanners our main contribution is a new distributed construction of minimum 2spanners that uses only polynomial local computations our algorithm has a guaranteed approximation ratio of ologmn for a graph with n vertices and m edges which matches the best known ratio for polynomial time sequential algorithms kortsarz and peleg 1994 and is tight if we restrict ourselves to polynomial local computations our approach allows us to extend our algorithm to work also for the directed weighted and clientserver variants of the problem | [['we', 'address', 'the', 'fundamental', 'network', 'design', 'problem', 'of', 'constructing', 'approximate', 'minimum', 'spanners', 'our', 'contributions', 'are', 'for', 'the', 'distributed', 'setting', 'providing', 'both', 'algorithmic', 'and', 'hardness', 'results', 'our', 'main', 'hardness', 'result', 'shows', 'that', 'an', 'alphaapproximation', 'for', 'the', 'minimum', 'directed', 'kspanner', 'problem', 'for', 'k', 'geq', '5', 'requires', 'omegan', 'sqrtalphalogn', 'rounds', 'using', 'deterministic', 'algorithms', 'or', 'omegasqrtn', 'sqrtalphalogn', 'rounds', 'using', 'randomized', 'ones', 'in', 'the', 'congest', 'model', 'of', 'distributed', 'computing', 'combined', 'with', 'the', 'constantround', 'onepsilonapproximation', 'algorithm', 'in', 'the', 'local', 'model', 'of', 'barenboim', 'elkin', 'and', 'gavoille', '2016', 'as', 'well', 'as', 'a', 'polyloground', '1epsilonapproximation', 'algorithm', 'in', 'the', 'local', 'model', 'that', 'we', 'show', 'here', 'our', 'lower', 'bounds', 'for', 'the', 'congest', 'model', 'imply', 'a', 'strict', 'separation', 'between', 'the', 'local', 'and', 'congest', 'models', 'notably', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'separation', 'between', 'these', 'models', 'for', 'a', 'local', 'approximation', 'problem', 'similarly', 'a', 'separation', 'between', 'the', 'directed', 'and', 'undirected', 'cases', 'is', 'implied', 'we', 'also', 'prove', 'a', 'nearlylinear', 'lower', 'bound', 'for', 'the', 'minimum', 'weighted', 'kspanner', 'problem', 'for', 'k', 'geq', '4', 'and', 'we', 'show', 'lower', 'bounds', 'for', 'the', 'weighted', '2spanner', 'problem', 'on', 'the', 'algorithmic', 'side', 'apart', 'from', 'the', 'aforementioned', '1epsilonapproximation', 'algorithm', 'for', 'minimum', 'kspanners', 'our', 'main', 'contribution', 'is', 'a', 'new', 'distributed', 'construction', 'of', 'minimum', '2spanners', 'that', 'uses', 'only', 'polynomial', 'local', 'computations', 'our', 'algorithm', 'has', 'a', 'guaranteed', 'approximation', 'ratio', 'of', 'ologmn', 'for', 'a', 'graph', 'with', 'n', 'vertices', 'and', 'm', 'edges', 'which', 'matches', 'the', 'best', 'known', 'ratio', 'for', 'polynomial', 'time', 'sequential', 'algorithms', 'kortsarz', 'and', 'peleg', '1994', 'and', 'is', 'tight', 'if', 'we', 'restrict', 'ourselves', 'to', 'polynomial', 'local', 'computations', 'our', 'approach', 'allows', 'us', 'to', 'extend', 'our', 'algorithm', 'to', 'work', 'also', 'for', 'the', 'directed', 'weighted', 'and', 'clientserver', 'variants', 'of', 'the', 'problem']] | [-0.11646755161794713, 0.024415594388391797, -0.05917971899141095, 0.07048912173384118, -0.06315582455402483, -0.1673634450417012, 0.13230415673052023, 0.3549367873742821, -0.2812786785572881, -0.382967057348165, 0.07717604592010621, -0.24898002047953952, -0.1696705772214434, 0.17968962312309883, -0.07940256912865541, 0.07247219557113206, 0.06012226299574698, 0.014193080852647092, -0.020068108286346018, -0.3112924161305134, 0.22494148164285518, 0.044012359873558754, 0.21061593612775079, 0.07972497356129554, 0.07622438440639667, 0.03368429813661989, -0.004829870743094055, 0.01696160291895182, -0.15593546281436182, 0.13060610111312274, 0.22868664890389648, 0.1891480868936424, 0.2682010345907441, -0.39505349632836023, -0.1480331706208175, 0.18004134937044222, 0.1485034905272742, 0.11144129895313665, 0.0003653048081785611, -0.19479144731436976, 0.13847084761284406, -0.10217707785457827, -0.04568259698518317, -0.01126806109340307, 0.04135008428053831, -0.0035009219467583047, -0.33961889405649526, 0.04616962977883207, 0.12669908546154807, -0.01544128559069452, -0.038794799538316806, -0.18189665305122504, 0.07913250556457362, 0.10757447392608657, -0.05281935522750683, 0.07940769497081211, 0.026394498924180894, -0.09026156208844045, -0.18502472467784492, 0.34503205894058897, -0.061339943145423105, -0.13658309754744913, 0.13434012077450183, -0.03500976835871613, -0.19001886691144518, 0.08694913516617345, 0.17543092530304283, 0.18191367666646288, -0.08003159169555786, 0.1317700406495137, -0.12515727749346747, 0.15788935072042887, 0.0708100407442988, -0.0002709756647983125, 0.06920677805603802, 0.15869660284334638, 0.2007946454940314, 0.16070693868518104, -0.00793282315401602, -0.09678113498397968, -0.28400277593421913, -0.11528656051619927, -0.2165531194391163, -0.016082482879896085, -0.17907158140832236, -0.14221340666199814, 0.3651797419008692, 0.141401925377498, 0.1963796115334622, 0.2208037907439853, 0.32420368436439573, 0.07595521364363714, -0.004107549950082339, 0.21399148752315694, 0.19640712107821987, 0.12871439373547225, 0.0541462934032111, -0.19106265436235872, 0.101796121855501, 0.13373345354365768] |
1,802.03161 | The affine property of quasi-free states on self-dual CAR algebras | We study conditions for which the correspondence between quasi-free states on
self-dual CAR algebras and covariant operators is affine.
| math.OA | we study conditions for which the correspondence between quasifree states on selfdual car algebras and covariant operators is affine | [['we', 'study', 'conditions', 'for', 'which', 'the', 'correspondence', 'between', 'quasifree', 'states', 'on', 'selfdual', 'car', 'algebras', 'and', 'covariant', 'operators', 'is', 'affine']] | [-0.17579175713226983, 0.14541610060749868, -0.11341024356845178, 0.10510907795794897, -0.06891434600478724, -0.19971204343202867, -0.0008575804531574249, 0.3843422165434611, -0.2694690066732858, -0.1287343302055409, 0.06846505283427082, -0.2799036749883702, -0.16145085896316327, 0.16650947149058706, -0.1248312861119446, 0.02594187973361266, 0.10289537887039937, 0.11058282685515128, -0.231472160716198, -0.19542394656884043, 0.499339264474417, -0.020463904917338176, 0.2931409642884606, 0.09653552131433236, 0.1401443536834497, 0.07672260704107191, 0.013586579460503631, -0.10560597494048507, -0.128387709491347, 0.07815243047355723, 0.31583222237072495, 0.03452431143408543, 0.07485199307924822, -0.4001758970124157, -0.11619302566702429, 0.14643561070490824, 0.07180268288050827, 0.032436557328573576, 0.023213085785851274, -0.3629991580781184, 0.03689353308838786, -0.1905881262531406, -0.07929009351095087, -0.08714033418187969, 0.10371348820626736, -0.10505635116102272, -0.29636076759350927, 0.061027749564106525, 0.03340185423822779, 0.13426481133424922, -0.19769929506276784, -0.05383160778958546, -0.09058316816624842, 0.09701009795657899, -0.0656718475082399, -0.0069588308443168274, 0.08441362358433635, -0.11023244742108018, -0.18823736263929228, 0.2653230500260466, 0.009828175761197743, -0.29201777102915866, 0.19497964903712273, -0.1527217960377273, -0.15140890859459577, -0.04433628269716313, 0.1299520505494193, 0.17801381333878166, -0.1276206790322536, 0.16847045748727396, -0.17410614699321358, -0.022496111102794345, 0.1168024900712465, 0.041021137424793686, 0.15990282305957457, 0.028866382903958623, 0.07273386497246592, 0.14494100820861364, 0.051929715493890014, -0.17707034141609543, -0.43496748422713655, -0.20054554159900076, -0.010767335366261633, 0.0990946518845464, -0.029800331415332806, -0.17439002161355396, 0.3738083774714093, 0.06880492128823933, 0.1420180068694447, 0.08060288145574496, 0.13445842550381235, 0.1353612298538026, 0.10494126011862566, 0.0658095296423294, 0.15688395933983357, 0.32312264028740556, -0.03976883068313136, -0.22847320460469314, -0.07708792658032555, 0.22606867865512245] |
1,802.03162 | URLNet: Learning a URL Representation with Deep Learning for Malicious
URL Detection | Malicious URLs host unsolicited content and are used to perpetrate
cybercrimes. It is imperative to detect them in a timely manner. Traditionally,
this is done through the usage of blacklists, which cannot be exhaustive, and
cannot detect newly generated malicious URLs. To address this, recent years
have witnessed several efforts to perform Malicious URL Detection using Machine
Learning. The most popular and scalable approaches use lexical properties of
the URL string by extracting Bag-of-words like features, followed by applying
machine learning models such as SVMs. There are also other features designed by
experts to improve the prediction performance of the model. These approaches
suffer from several limitations: (i) Inability to effectively capture semantic
meaning and sequential patterns in URL strings; (ii) Requiring substantial
manual feature engineering; and (iii) Inability to handle unseen features and
generalize to test data. To address these challenges, we propose URLNet, an
end-to-end deep learning framework to learn a nonlinear URL embedding for
Malicious URL Detection directly from the URL. Specifically, we apply
Convolutional Neural Networks to both characters and words of the URL String to
learn the URL embedding in a jointly optimized framework. This approach allows
the model to capture several types of semantic information, which was not
possible by the existing models. We also propose advanced word-embeddings to
solve the problem of too many rare words observed in this task. We conduct
extensive experiments on a large-scale dataset and show a significant
performance gain over existing methods. We also conduct ablation studies to
evaluate the performance of various components of URLNet.
| cs.CR cs.LG | malicious urls host unsolicited content and are used to perpetrate cybercrimes it is imperative to detect them in a timely manner traditionally this is done through the usage of blacklists which cannot be exhaustive and cannot detect newly generated malicious urls to address this recent years have witnessed several efforts to perform malicious url detection using machine learning the most popular and scalable approaches use lexical properties of the url string by extracting bagofwords like features followed by applying machine learning models such as svms there are also other features designed by experts to improve the prediction performance of the model these approaches suffer from several limitations i inability to effectively capture semantic meaning and sequential patterns in url strings ii requiring substantial manual feature engineering and iii inability to handle unseen features and generalize to test data to address these challenges we propose urlnet an endtoend deep learning framework to learn a nonlinear url embedding for malicious url detection directly from the url specifically we apply convolutional neural networks to both characters and words of the url string to learn the url embedding in a jointly optimized framework this approach allows the model to capture several types of semantic information which was not possible by the existing models we also propose advanced wordembeddings to solve the problem of too many rare words observed in this task we conduct extensive experiments on a largescale dataset and show a significant performance gain over existing methods we also conduct ablation studies to evaluate the performance of various components of urlnet | [['malicious', 'urls', 'host', 'unsolicited', 'content', 'and', 'are', 'used', 'to', 'perpetrate', 'cybercrimes', 'it', 'is', 'imperative', 'to', 'detect', 'them', 'in', 'a', 'timely', 'manner', 'traditionally', 'this', 'is', 'done', 'through', 'the', 'usage', 'of', 'blacklists', 'which', 'can', 'not', 'be', 'exhaustive', 'and', 'can', 'not', 'detect', 'newly', 'generated', 'malicious', 'urls', 'to', 'address', 'this', 'recent', 'years', 'have', 'witnessed', 'several', 'efforts', 'to', 'perform', 'malicious', 'url', 'detection', 'using', 'machine', 'learning', 'the', 'most', 'popular', 'and', 'scalable', 'approaches', 'use', 'lexical', 'properties', 'of', 'the', 'url', 'string', 'by', 'extracting', 'bagofwords', 'like', 'features', 'followed', 'by', 'applying', 'machine', 'learning', 'models', 'such', 'as', 'svms', 'there', 'are', 'also', 'other', 'features', 'designed', 'by', 'experts', 'to', 'improve', 'the', 'prediction', 'performance', 'of', 'the', 'model', 'these', 'approaches', 'suffer', 'from', 'several', 'limitations', 'i', 'inability', 'to', 'effectively', 'capture', 'semantic', 'meaning', 'and', 'sequential', 'patterns', 'in', 'url', 'strings', 'ii', 'requiring', 'substantial', 'manual', 'feature', 'engineering', 'and', 'iii', 'inability', 'to', 'handle', 'unseen', 'features', 'and', 'generalize', 'to', 'test', 'data', 'to', 'address', 'these', 'challenges', 'we', 'propose', 'urlnet', 'an', 'endtoend', 'deep', 'learning', 'framework', 'to', 'learn', 'a', 'nonlinear', 'url', 'embedding', 'for', 'malicious', 'url', 'detection', 'directly', 'from', 'the', 'url', 'specifically', 'we', 'apply', 'convolutional', 'neural', 'networks', 'to', 'both', 'characters', 'and', 'words', 'of', 'the', 'url', 'string', 'to', 'learn', 'the', 'url', 'embedding', 'in', 'a', 'jointly', 'optimized', 'framework', 'this', 'approach', 'allows', 'the', 'model', 'to', 'capture', 'several', 'types', 'of', 'semantic', 'information', 'which', 'was', 'not', 'possible', 'by', 'the', 'existing', 'models', 'we', 'also', 'propose', 'advanced', 'wordembeddings', 'to', 'solve', 'the', 'problem', 'of', 'too', 'many', 'rare', 'words', 'observed', 'in', 'this', 'task', 'we', 'conduct', 'extensive', 'experiments', 'on', 'a', 'largescale', 'dataset', 'and', 'show', 'a', 'significant', 'performance', 'gain', 'over', 'existing', 'methods', 'we', 'also', 'conduct', 'ablation', 'studies', 'to', 'evaluate', 'the', 'performance', 'of', 'various', 'components', 'of', 'urlnet']] | [-0.031565234396478535, -0.01201064757621024, -0.06441532205266863, 0.0985018659505791, -0.18522395527842203, -0.19515990727046836, 0.06460959283687362, 0.4412900390493315, -0.31069355879417554, -0.3591080598024175, 0.09145645122946233, -0.32485791382204077, -0.1566012462656566, 0.16491605210264193, -0.11799235210768416, 0.10292902495215697, 0.09589678922112194, 0.05219036575213667, -0.05852457348960308, -0.30884232538817236, 0.28927490366947683, 0.06435738790447755, 0.34342665168954883, 0.0426916013410416, 0.07037286544826117, -0.046510059783567294, -0.09342342867507408, -0.007865189053497255, -0.06916511494507507, 0.1686101336787498, 0.3817541200378894, 0.26311646239983655, 0.3140119981641571, -0.4486216357367676, -0.25207265047897953, 0.10804539970338864, 0.16161463260307707, 0.12773878109468104, -0.026862296756346125, -0.3594181275089062, 0.12356304877993557, -0.20965277491942366, 0.02231085834512126, -0.17489936398820546, -0.02596715754150709, 0.009609410302377804, -0.21516959456178222, -0.005751229256239012, 0.07488307710773087, 0.052511821318663256, -0.009191088785206206, -0.0524510486266222, 0.05604842937481048, 0.16895257343191566, 0.08502468085385743, 0.03977160933364342, 0.148944714343511, -0.16600279888571234, -0.1876085765507296, 0.3640514752546022, -0.06720087524591908, -0.18875351212124608, 0.2365720296827282, 0.025632342812785692, -0.16217262614807187, 0.09636832792140443, 0.26481877146072164, 0.11194244031018268, -0.19414419660619062, -0.011660613892545794, -0.004445692352849499, 0.20358976552916272, 0.053452031877317806, -0.004111616795599666, 0.2050007503838892, 0.21497057336779643, -0.028470804707523726, 0.13522611093926676, -0.12937743600664114, -0.02486001039054714, -0.16508749264198563, -0.09194029282504158, -0.144769469707439, -0.02749197634981355, -0.032222852783635, -0.14490544287248266, 0.404950196143644, 0.2715001936871992, 0.20538434510345097, 0.06294586117444344, 0.3368642310153462, -0.01669976600786931, 0.15448814173984385, 0.10672757548235841, 0.1577682334066968, -0.01835032957678213, 0.14099484089854022, -0.14194553805011606, 0.11429075048848365, 0.043899487962137704] |
1,802.03163 | Topological algebras of bounded operators with locally solid Riesz
spaces | Let $X$ be a vector lattice and $(E,\tau)$ be a locally solid vector lattice.
An operator $T:X\to E$ is said to be $ob$-bounded if, for each order bounded
set $B$ in $X$, $T(B)$ is topologically bounded in $E$. In this paper, we study
on algebraic properties of $ob$-bounded operators with respect to the topology
of uniform convergence and equicontinuous convergence.
| math.FA | let x be a vector lattice and etau be a locally solid vector lattice an operator txto e is said to be obbounded if for each order bounded set b in x tb is topologically bounded in e in this paper we study on algebraic properties of obbounded operators with respect to the topology of uniform convergence and equicontinuous convergence | [['let', 'x', 'be', 'a', 'vector', 'lattice', 'and', 'etau', 'be', 'a', 'locally', 'solid', 'vector', 'lattice', 'an', 'operator', 'txto', 'e', 'is', 'said', 'to', 'be', 'obbounded', 'if', 'for', 'each', 'order', 'bounded', 'set', 'b', 'in', 'x', 'tb', 'is', 'topologically', 'bounded', 'in', 'e', 'in', 'this', 'paper', 'we', 'study', 'on', 'algebraic', 'properties', 'of', 'obbounded', 'operators', 'with', 'respect', 'to', 'the', 'topology', 'of', 'uniform', 'convergence', 'and', 'equicontinuous', 'convergence']] | [-0.1655500488644787, 0.18800299450306518, -0.05497638540792054, -0.011241248814822656, -0.07026942431172035, -0.13878388039703513, 0.05613207873478853, 0.3878198515238433, -0.3543964860768154, -0.09412152904732121, 0.1215548112302023, -0.3152054414666932, -0.0798500838914308, 0.13737820607513704, -0.09592998801762688, 0.02052442209217055, 0.02153449033483349, 0.12682329323785058, -0.09893648718194716, -0.27352348356989437, 0.311980039395135, -0.049607355677490604, 0.1989823743251377, 0.055839513428509235, 0.06960473300744618, -0.021405747336945658, 0.053141766484698344, 0.0682843056274578, -0.157607134174684, 0.12759596526879688, 0.24052695136774202, 0.06859947262123099, 0.23200565987619862, -0.3560219235750365, -0.1264001246670197, 0.2438861070489832, 0.12699735908094664, -0.06616905697717748, 0.006449416165384625, -0.28674221604034816, 0.22745983272084389, -0.1368151312886641, -0.1298448617554045, -0.1307112906963147, 0.07693823860508614, 0.02826952192017102, -0.35671031571410855, -0.020018921595002556, 0.10163479070339737, 0.11394443958676581, -0.0671368925270207, -0.055351429103054746, -0.10173007018526951, 0.016603125339566635, -0.016368959010739266, 0.20554377558111245, 0.03720169118204122, -0.010407238729009083, -0.11076826197576933, 0.40918760171866625, -0.11362764714004729, -0.3332887540475048, 0.1345793540621626, -0.21304696496447612, -0.09491985305694156, 0.09719864869137006, 0.20934417492164106, 0.13624444663331942, -0.12627876774761185, 0.24910551571118614, -0.09049629220028473, 0.13179914849200125, 0.018120400687872337, 0.0471654855646193, 0.12225424784139313, 0.13362161770206074, 0.19371098244626975, 0.10516462533871226, 0.036225161840336334, -0.005239170430035427, -0.3636644454110928, -0.15595893352292478, -0.17648732176869467, 0.17293083296831827, -0.07983369525503929, -0.19376677550889296, 0.37946471340697385, 0.04901302247789913, 0.24863590810704847, 0.04046622434117157, 0.18866039722644048, 0.12047506305655055, -0.03361402978169218, 0.1264840985873136, 0.11648705897146258, 0.21817597647293888, -0.00786421601339404, -0.1583056915912713, 0.04292653245722939, 0.15741535192827197] |
1,802.03164 | Global weak Besov solutions of the Navier-Stokes equations and
applications | We introduce a notion of global weak solution to the Navier-Stokes equations
in three dimensions with initial values in the critical homogeneous Besov
spaces $\dot{B}^{-1+\frac{3}{p}}_{p,\infty}$, $p > 3$. These solutions satisfy
a certain stability property with respect to the weak-$\ast$ convergence of
initial conditions. To illustrate this property, we provide applications to
blow-up criteria, minimal blow-up initial data, and forward self-similar
solutions. Our proof relies on a new splitting result in homogeneous Besov
spaces that may be of independent interest.
| math.AP | we introduce a notion of global weak solution to the navierstokes equations in three dimensions with initial values in the critical homogeneous besov spaces dotb1frac3p_pinfty p 3 these solutions satisfy a certain stability property with respect to the weakast convergence of initial conditions to illustrate this property we provide applications to blowup criteria minimal blowup initial data and forward selfsimilar solutions our proof relies on a new splitting result in homogeneous besov spaces that may be of independent interest | [['we', 'introduce', 'a', 'notion', 'of', 'global', 'weak', 'solution', 'to', 'the', 'navierstokes', 'equations', 'in', 'three', 'dimensions', 'with', 'initial', 'values', 'in', 'the', 'critical', 'homogeneous', 'besov', 'spaces', 'dotb1frac3p_pinfty', 'p', '3', 'these', 'solutions', 'satisfy', 'a', 'certain', 'stability', 'property', 'with', 'respect', 'to', 'the', 'weakast', 'convergence', 'of', 'initial', 'conditions', 'to', 'illustrate', 'this', 'property', 'we', 'provide', 'applications', 'to', 'blowup', 'criteria', 'minimal', 'blowup', 'initial', 'data', 'and', 'forward', 'selfsimilar', 'solutions', 'our', 'proof', 'relies', 'on', 'a', 'new', 'splitting', 'result', 'in', 'homogeneous', 'besov', 'spaces', 'that', 'may', 'be', 'of', 'independent', 'interest']] | [-0.16474057004476586, 0.06275756992638493, -0.12808574141504672, 0.10408481538074855, -0.09357108220828171, -0.12076861946843565, 0.004389816680206702, 0.29920719743658525, -0.287520872715574, -0.19317423011167334, 0.1666275256399949, -0.22188434437012824, -0.06500478348551461, 0.19745107416588908, -0.11023490256271683, 0.13094517426100374, 0.08423420153438854, -0.015726111282651216, -0.11698638271385182, -0.2961707135814672, 0.4422749830171084, -0.05926059425259248, 0.30403224345392144, 0.028419069145830013, 0.09672489610220043, -0.05856113174619774, 0.013402942926264726, 0.029795422391870465, -0.2690572300124563, 0.10076549262381516, 0.2501968114326398, 0.10946686785936412, 0.312080249715692, -0.3643219727927294, -0.18667282801694596, 0.1632574996493088, 0.1253737133139601, 0.07454437491161606, -0.05487004791249115, -0.29329635998090875, 0.16114343920101723, -0.08672813019261529, -0.23620802329148716, -0.1167021170974924, 0.013043427427944083, 0.11123254121496128, -0.35147266321254367, 0.0443520539929756, 0.11492828286300676, 0.05922669020648568, -0.18440357514788422, -0.04232442577799352, -0.008421181462323055, 0.044751775659955084, 0.05749052193147154, 0.004151250122306056, 0.04128598744192949, -0.0833801664501572, -0.07720957767182532, 0.32479905163964784, -0.06711696286518605, -0.31628989786482775, 0.21683919777234012, -0.14007934517203233, -0.15190560934253228, 0.11127423020437933, 0.1565640234412291, 0.11791666720707256, -0.09348259566542812, 0.12067611000831956, -0.061129841953516006, 0.13273873125226834, 0.11234671872061415, 0.05646239784068595, 0.06536586702061005, 0.13853153757727107, 0.20492616895801172, 0.13543271409938684, 0.02355765250663703, -0.1160374501442465, -0.38432812217312556, -0.14747575453172126, -0.12197091505946353, 0.12968448581150135, -0.1778908270492908, -0.21153734309168962, 0.3458992751936118, 0.14648001725361562, 0.20064623893883365, 0.07458418855168976, 0.19596574219086996, 0.10860050334266792, -0.010500118986060559, 0.0656419970238438, 0.19971418666104093, 0.1453753985100402, 0.16545555022401878, -0.13285132967389357, 0.038918459113352954, 0.19320727556418532] |
1,802.03165 | Static strain tuning of quantum dots embedded in a photonic wire | We use strain to statically tune the semiconductor band gap of individual
InAs quantum dots (QDs) embedded in a GaAs photonic wire featuring very
efficient single photon collection efficiency. Thanks to the geometry of the
structure, we are able to shift the QD excitonic transition by more than 20 meV
by using nano-manipulators to apply the stress. Moreover, owing to the strong
transverse strain gradient generated in the structure, we can relatively tune
two QDs located in the wire waveguide and bring them in resonance, opening the
way to the observation of collective effects such as superradiance.
| cond-mat.mes-hall | we use strain to statically tune the semiconductor band gap of individual inas quantum dots qds embedded in a gaas photonic wire featuring very efficient single photon collection efficiency thanks to the geometry of the structure we are able to shift the qd excitonic transition by more than 20 mev by using nanomanipulators to apply the stress moreover owing to the strong transverse strain gradient generated in the structure we can relatively tune two qds located in the wire waveguide and bring them in resonance opening the way to the observation of collective effects such as superradiance | [['we', 'use', 'strain', 'to', 'statically', 'tune', 'the', 'semiconductor', 'band', 'gap', 'of', 'individual', 'inas', 'quantum', 'dots', 'qds', 'embedded', 'in', 'a', 'gaas', 'photonic', 'wire', 'featuring', 'very', 'efficient', 'single', 'photon', 'collection', 'efficiency', 'thanks', 'to', 'the', 'geometry', 'of', 'the', 'structure', 'we', 'are', 'able', 'to', 'shift', 'the', 'qd', 'excitonic', 'transition', 'by', 'more', 'than', '20', 'mev', 'by', 'using', 'nanomanipulators', 'to', 'apply', 'the', 'stress', 'moreover', 'owing', 'to', 'the', 'strong', 'transverse', 'strain', 'gradient', 'generated', 'in', 'the', 'structure', 'we', 'can', 'relatively', 'tune', 'two', 'qds', 'located', 'in', 'the', 'wire', 'waveguide', 'and', 'bring', 'them', 'in', 'resonance', 'opening', 'the', 'way', 'to', 'the', 'observation', 'of', 'collective', 'effects', 'such', 'as', 'superradiance']] | [-0.12826939596925513, 0.18284802320825597, -0.025270691626550008, 0.025922644838525837, -0.039308168046469895, -0.19786311000643764, 0.07194404998396446, 0.5023186810237045, -0.2841157061823954, -0.3442087582322226, -0.021058730722870678, -0.2850230842692933, -0.09208411226548681, 0.19957741074176738, 0.029561624585767277, 0.04516020049535049, 0.03181033847249637, -0.07545910857394726, -0.0619875289266929, -0.14584271361430487, 0.2936216704438266, 0.06126938539697827, 0.3173984349608266, 0.08434995606633795, 0.02457714199651188, 0.001867257747411107, 0.12740325657553817, -0.0027357958897482604, -0.12255503618022583, 0.14930425441707484, 0.26382763391544967, -0.09504398102217237, 0.2526243029545488, -0.467262092900152, -0.1419818875438068, 0.024860858711084195, 0.1836828516049233, 0.1660504864533626, -0.06692607523609695, -0.2994747095508501, 0.08619303931724669, -0.1447251038722849, -0.09607427890296094, -0.055155192773478724, -0.0518696953173882, -0.029056070479176316, -0.18296165746990786, 0.03486608791960558, 0.013684726696131596, 0.0005812003639675822, -0.0003956709309325864, -0.03233978638794118, -0.03841030708281323, 0.08285724312978952, -0.010924413664421687, 0.01326829289610032, 0.2520076707927122, -0.08545635820822402, -0.12297149164927153, 0.3790594185993541, -0.06420302171636649, -0.13993176362661566, 0.14141158075168883, -0.1867030907063357, 0.005927220496232621, 0.15684837981825694, 0.1673832628002856, 0.05868153482394215, -0.11280811810259668, 0.048544894820831054, 0.07320153725352914, 0.20116866520644786, 0.08304560267364043, 0.123247845719258, 0.2223672011459712, 0.1857576501982597, 0.05993160400854928, 0.18266523224641182, -0.1421947000747726, -0.07188666031773512, -0.22345745852605128, -0.16839971705273152, -0.21191968925025625, 0.10450459702648611, -0.06687838215035906, -0.18633437852258794, 0.4310094054817455, 0.13855820497459112, 0.181205769952309, -0.04997372814492943, 0.24089022344075298, 0.09538127633156061, 0.14096085309089781, 0.02270932192914188, 0.31670890046552813, 0.19898478082905058, 0.0889332498870014, -0.2591661583974201, -0.0010119701764779165, -0.06876702157508892] |
1,802.03166 | Photon absorption and electron scattering by endohedrals | We concentrate here on photon absorption as well as electron and positron
scattering upon endohedrals that consist of a fullerenes shell and an inner
atom A. The aim is to understand the effect of fullerene electron shell in
formation of corresponding cross-section. We consider the problem substituting
the action of a complex multiatomic fullerenes shell by a combination of static
pseudopotential and dynamic polarization potential. The electron correlations
in the atom A are taken into account in the frame of the random phase
approximation with exchange (RPAE). We demonstrate that the fullerenes shell
strongly affects the cross-sections, bringing in a number of peculiarities,
such as confinement resonances and giant-endohedral resonances and partial wave
Ramsauer-type minima. Numerical data are obtained for endohedrals A@C60 and
A@C60@C240, where A are noble gas atoms He, Ar and Xe.
| physics.atm-clus | we concentrate here on photon absorption as well as electron and positron scattering upon endohedrals that consist of a fullerenes shell and an inner atom a the aim is to understand the effect of fullerene electron shell in formation of corresponding crosssection we consider the problem substituting the action of a complex multiatomic fullerenes shell by a combination of static pseudopotential and dynamic polarization potential the electron correlations in the atom a are taken into account in the frame of the random phase approximation with exchange rpae we demonstrate that the fullerenes shell strongly affects the crosssections bringing in a number of peculiarities such as confinement resonances and giantendohedral resonances and partial wave ramsauertype minima numerical data are obtained for endohedrals ac60 and ac60c240 where a are noble gas atoms he ar and xe | [['we', 'concentrate', 'here', 'on', 'photon', 'absorption', 'as', 'well', 'as', 'electron', 'and', 'positron', 'scattering', 'upon', 'endohedrals', 'that', 'consist', 'of', 'a', 'fullerenes', 'shell', 'and', 'an', 'inner', 'atom', 'a', 'the', 'aim', 'is', 'to', 'understand', 'the', 'effect', 'of', 'fullerene', 'electron', 'shell', 'in', 'formation', 'of', 'corresponding', 'crosssection', 'we', 'consider', 'the', 'problem', 'substituting', 'the', 'action', 'of', 'a', 'complex', 'multiatomic', 'fullerenes', 'shell', 'by', 'a', 'combination', 'of', 'static', 'pseudopotential', 'and', 'dynamic', 'polarization', 'potential', 'the', 'electron', 'correlations', 'in', 'the', 'atom', 'a', 'are', 'taken', 'into', 'account', 'in', 'the', 'frame', 'of', 'the', 'random', 'phase', 'approximation', 'with', 'exchange', 'rpae', 'we', 'demonstrate', 'that', 'the', 'fullerenes', 'shell', 'strongly', 'affects', 'the', 'crosssections', 'bringing', 'in', 'a', 'number', 'of', 'peculiarities', 'such', 'as', 'confinement', 'resonances', 'and', 'giantendohedral', 'resonances', 'and', 'partial', 'wave', 'ramsauertype', 'minima', 'numerical', 'data', 'are', 'obtained', 'for', 'endohedrals', 'ac60', 'and', 'ac60c240', 'where', 'a', 'are', 'noble', 'gas', 'atoms', 'he', 'ar', 'and', 'xe']] | [-0.07194861995841853, 0.14414261574761406, -0.019096223183797372, 0.06275336275620116, 0.01878294670236304, -0.09505173119979392, 0.04427073351356364, 0.4117853531741914, -0.20050966284657254, -0.27627631212861936, -0.005114347721940575, -0.349102879227459, -0.0793307998327837, 0.10163060542309785, 0.05278452085188896, 0.023103502752323358, 0.04944876505360576, -0.010114598738470378, -0.03258081917643888, -0.1800242578628551, 0.31024359079888303, 0.07770470063067006, 0.19133706461595557, 0.14352516320939282, 0.05604405773053557, 0.04695123990727518, 0.03516026722082428, 0.028111720638961054, -0.08504525250242045, 0.10492084758224691, 0.21209366610344813, 0.03751262214447137, 0.19536276985642337, -0.5144951505202601, -0.20661960541491062, 0.008231609260160404, 0.1676841600023153, 0.13639243778893512, -0.08500227292747244, -0.27042199447324483, -0.043332533795343894, -0.1736911212586005, -0.14330736387748527, -0.03679441316195458, 0.04801530917779408, 0.07337197003786573, -0.2722755524841713, 0.04440306954597699, 0.04389406408748468, 0.021745805367329764, -0.10718023306014769, -0.13368793682529384, -0.02811613212915436, 0.02940307554028189, 0.01754497650047437, -0.022936896833356556, 0.1980173447514166, -0.09529303811412333, -0.07111652125782184, 0.45386591506766455, -0.07473394809333422, -0.13199363345322945, 0.15836443674203207, -0.17593437544148388, -0.0525836848355261, 0.19185341905823816, 0.1484857779449449, 0.11767608119718702, -0.11190108461874246, 0.09162040114738687, -0.042811658535439716, 0.13858235043025655, 0.11020153051398637, 0.06658390115143177, 0.20898839294908653, 0.17424236292389172, -0.0034125116689287067, 0.11946157746031198, -0.15571144292706923, -0.07966041079729454, -0.26122343416489263, -0.19246555228525672, -0.17253169550325806, 0.023777398817887253, -0.027289328333199244, -0.17354546645158575, 0.3610369971000682, 0.049559609274884675, 0.22215327452726036, -0.08335793552962878, 0.27150357935136854, 0.09959643495265565, 0.03679674483466012, 0.01316597533078139, 0.2767520776971151, 0.17975125909882478, 0.0550498153875717, -0.2959951999213348, 0.03125104698430718, 0.02108084153782093] |
1,802.03167 | Equivalence of One Loop Diagrams in Covariant and Light Front QED
Revisited | We revisit the proof of equivalence of one loop expressions for fermion
self-energy and vertex correction in light-front QED and Covariant QED at the
Feynman diagram level and generalize, to all components, the proof of
equivalence for the one loop vertex correction diagram which was presented
earlier by us only for the $+$ component of $\Lambda^\mu$. We demonstrate, in
the general case also, that the equivalence cannot be established without the
third term in the three-term photon propagator in light cone gauge.
| hep-th hep-ph | we revisit the proof of equivalence of one loop expressions for fermion selfenergy and vertex correction in lightfront qed and covariant qed at the feynman diagram level and generalize to all components the proof of equivalence for the one loop vertex correction diagram which was presented earlier by us only for the component of lambdamu we demonstrate in the general case also that the equivalence cannot be established without the third term in the threeterm photon propagator in light cone gauge | [['we', 'revisit', 'the', 'proof', 'of', 'equivalence', 'of', 'one', 'loop', 'expressions', 'for', 'fermion', 'selfenergy', 'and', 'vertex', 'correction', 'in', 'lightfront', 'qed', 'and', 'covariant', 'qed', 'at', 'the', 'feynman', 'diagram', 'level', 'and', 'generalize', 'to', 'all', 'components', 'the', 'proof', 'of', 'equivalence', 'for', 'the', 'one', 'loop', 'vertex', 'correction', 'diagram', 'which', 'was', 'presented', 'earlier', 'by', 'us', 'only', 'for', 'the', 'component', 'of', 'lambdamu', 'we', 'demonstrate', 'in', 'the', 'general', 'case', 'also', 'that', 'the', 'equivalence', 'can', 'not', 'be', 'established', 'without', 'the', 'third', 'term', 'in', 'the', 'threeterm', 'photon', 'propagator', 'in', 'light', 'cone', 'gauge']] | [-0.1183214386095997, 0.1598880879876272, -0.10034408688931386, 0.12069288085828103, -0.10553891347471352, -0.15584094050090488, 0.05778147806072744, 0.3207041436306587, -0.1939350607941245, -0.24632004317373218, 0.0170434317949069, -0.27416927446951955, -0.11683442406129183, 0.15597475697172852, -0.03499616997134758, 0.017040502688870196, 0.05499557587999578, 0.058868668087553686, -0.07852447070692462, -0.2361801134155518, 0.3790149348901539, -0.019645311517595517, 0.22554913702670756, 0.13037997330595716, 0.12024196429836859, 0.07447576065967995, -0.030638373048022027, -0.01498993383947669, -0.06730234372280836, 0.052983626402437506, 0.213737653596781, 0.06342820548338861, 0.13665117231969973, -0.3733256736361399, -0.1570914543841443, 0.06140106167962275, 0.15795822343902616, 0.12777112570176719, 0.008345612199840749, -0.2628401322489059, 0.051025658289379466, -0.2019035239681238, -0.1875164852628098, -0.07575550027441506, -0.00030253241520102433, -0.09232288097008699, -0.23817263797447993, 0.03816455911252954, 0.06648891998409498, 0.01883404701948166, 0.0005427194850110426, -0.11329265962576313, 0.010301827015809534, 0.12043829233862641, 0.016232127664474454, 0.06756739884156382, 0.04763753682620917, -0.1614275827958453, -0.1473139428942487, 0.37919897762149934, -0.08924225272565353, -0.20612067607708456, 0.07755012124231676, -0.19638670328436647, -0.16749375157921417, 0.09586543586991, 0.07147132713211382, 0.09576830790355438, -0.19394450123626283, 0.16194415301235007, -0.009632462215405412, 0.11943187722481968, 0.11980386361445687, 0.03538511341747192, 0.12967752005973057, 0.02771590261084096, 0.012326285432475454, 0.1752495603826147, 0.010080952617544226, -0.14329567807726562, -0.43139164072529573, -0.1776410311442039, -0.11886577221434336, 0.013712952515605848, -0.1255767981107588, -0.17414434981055377, 0.41848095982312794, 0.1492005791231172, 0.1252358185309099, 0.07949663141157433, 0.3048015278451735, 0.18921601259229115, 0.1324324062798263, 0.046909622189293544, 0.2881416100951866, 0.1819354021586705, 0.03358023217737266, -0.26221943291176747, -0.02529488484483076, 0.2324168085995153] |
1,802.03168 | Hierarchical Cloth Simulation using Deep Neural Networks | Fast and reliable physically-based simulation techniques are essential for
providing flexible visual effects for computer graphics content. In this paper,
we propose a fast and reliable hierarchical cloth simulation method, which
combines conventional physically-based simulation with deep neural networks
(DNN). Simulations of the coarsest level of the hierarchical model are
calculated using conventional physically-based simulations, and more detailed
levels are generated by inference using DNN models. We demonstrate that our
method generates reliable and fast cloth simulation results through experiments
under various conditions.
| cs.GR | fast and reliable physicallybased simulation techniques are essential for providing flexible visual effects for computer graphics content in this paper we propose a fast and reliable hierarchical cloth simulation method which combines conventional physicallybased simulation with deep neural networks dnn simulations of the coarsest level of the hierarchical model are calculated using conventional physicallybased simulations and more detailed levels are generated by inference using dnn models we demonstrate that our method generates reliable and fast cloth simulation results through experiments under various conditions | [['fast', 'and', 'reliable', 'physicallybased', 'simulation', 'techniques', 'are', 'essential', 'for', 'providing', 'flexible', 'visual', 'effects', 'for', 'computer', 'graphics', 'content', 'in', 'this', 'paper', 'we', 'propose', 'a', 'fast', 'and', 'reliable', 'hierarchical', 'cloth', 'simulation', 'method', 'which', 'combines', 'conventional', 'physicallybased', 'simulation', 'with', 'deep', 'neural', 'networks', 'dnn', 'simulations', 'of', 'the', 'coarsest', 'level', 'of', 'the', 'hierarchical', 'model', 'are', 'calculated', 'using', 'conventional', 'physicallybased', 'simulations', 'and', 'more', 'detailed', 'levels', 'are', 'generated', 'by', 'inference', 'using', 'dnn', 'models', 'we', 'demonstrate', 'that', 'our', 'method', 'generates', 'reliable', 'and', 'fast', 'cloth', 'simulation', 'results', 'through', 'experiments', 'under', 'various', 'conditions']] | [-0.033499775419337116, 0.023448041690715467, -0.08476222302001643, 0.06570845006836062, -0.06763546563494187, -0.15663052543840675, -0.008577848793742392, 0.48808825056416444, -0.2433719833280487, -0.3507124611501952, 0.06260435819395829, -0.20019530177295927, -0.25082002136946085, 0.29202783845802655, -0.026783523685579378, 0.14079691627320934, 0.17922570894707937, -0.09492339285831135, -0.0672310419487262, -0.20318819863542195, 0.25380976473441325, 0.1452707136803761, 0.35679973159209794, -0.005160656087914011, 0.16029924269294343, -0.03500706856756146, -0.08676439395780305, 0.004946480634207108, -0.11386761793360768, 0.17538556751671686, 0.23417830287328262, 0.18087972967649799, 0.286778155826481, -0.5369274649454887, -0.27739208763751416, 0.007832433489790881, 0.1407743328256555, 0.1385329919516569, -0.13145325109955197, -0.28215181831402303, 0.1685599763821586, -0.20091818982219123, -0.018513027550540417, -0.23440892254956155, -0.09029147452927273, 0.021887441322835814, -0.3489081371934658, 0.08721427239915244, -0.00019598230495151267, 0.08326376666011939, -0.011510212585913488, -0.09964674379093101, 0.0262712490063228, 0.1589565588335271, -0.05591540069863515, -0.011708926918274016, 0.16356419288856258, -0.13554489854667112, -0.11133482750415442, 0.36341090387025154, -0.024222122398710036, -0.2241181999063456, 0.2595333178213472, 0.010008172927345767, -0.14257710728323064, 0.11285451512940857, 0.2170097502158865, 0.13522643479799112, -0.16087340172492418, -0.008390050283240446, -0.018053811525993318, 0.18687374273831225, -0.055616902824244405, -0.06137218937300235, 0.19290529617882637, 0.31057445303233994, -0.04709923450262791, 0.12422585831001311, -0.14358473551201534, -0.11894515656349978, -0.21771617343716593, -0.07713651443910167, -0.1259933424866702, -0.07733367963593049, -0.1241085153088501, -0.13550219188881926, 0.39093541160943995, 0.26978204939907124, 0.1447177157591445, 0.13571125961396932, 0.41881863909762307, 0.050895668954745565, 0.07672550203839698, 0.0915939697030797, 0.1445460695428325, 0.04557035216242524, 0.09506033647087324, -0.15137437470565854, 0.05138938391513853, 0.055919965734727774] |
1,802.03169 | Thermal disorder in finite-length carbon nanowire | Chemisorption is one of the active research areas in carbon materials. The
occurrence of the monoatomic carbon chain can be made by surrounding the double
walled carbon nanotube and meanwhile worldwide efforts have been made to create
the extraction technique for unlashing the carbon chains from the enclosure.
Here we report an extensive study of the kink structure in the free standing
carbon nanowires. Our Monte Carlo simulation considers the multi-monoatomic
carbon chains laterally interacted by the Van der Waal force. Despite the
linearity of the carbon nanowires is independent of chain length at low
temperatures, the same situation does not hold at high temperatures. Disordered
kink structure is observed in the short carbon chains especially above Peierls
transition temperature. For instance, the average kink angle of 50-atoms carbon
nanowire is as large as 35 degree at 800K. We have provided an important
inspection that any physical property of the finite-length carbon chain
predicted by ab-initio calculation should reconsider the atomic rearrangement
due to the thermal instability. Apart from this, the kink structure in the
nanowires likely increases the probability of attaching negatively charged
atoms which is an encouragement to find the next generation materials for
chemisorption.
| cond-mat.mtrl-sci | chemisorption is one of the active research areas in carbon materials the occurrence of the monoatomic carbon chain can be made by surrounding the double walled carbon nanotube and meanwhile worldwide efforts have been made to create the extraction technique for unlashing the carbon chains from the enclosure here we report an extensive study of the kink structure in the free standing carbon nanowires our monte carlo simulation considers the multimonoatomic carbon chains laterally interacted by the van der waal force despite the linearity of the carbon nanowires is independent of chain length at low temperatures the same situation does not hold at high temperatures disordered kink structure is observed in the short carbon chains especially above peierls transition temperature for instance the average kink angle of 50atoms carbon nanowire is as large as 35 degree at 800k we have provided an important inspection that any physical property of the finitelength carbon chain predicted by abinitio calculation should reconsider the atomic rearrangement due to the thermal instability apart from this the kink structure in the nanowires likely increases the probability of attaching negatively charged atoms which is an encouragement to find the next generation materials for chemisorption | [['chemisorption', 'is', 'one', 'of', 'the', 'active', 'research', 'areas', 'in', 'carbon', 'materials', 'the', 'occurrence', 'of', 'the', 'monoatomic', 'carbon', 'chain', 'can', 'be', 'made', 'by', 'surrounding', 'the', 'double', 'walled', 'carbon', 'nanotube', 'and', 'meanwhile', 'worldwide', 'efforts', 'have', 'been', 'made', 'to', 'create', 'the', 'extraction', 'technique', 'for', 'unlashing', 'the', 'carbon', 'chains', 'from', 'the', 'enclosure', 'here', 'we', 'report', 'an', 'extensive', 'study', 'of', 'the', 'kink', 'structure', 'in', 'the', 'free', 'standing', 'carbon', 'nanowires', 'our', 'monte', 'carlo', 'simulation', 'considers', 'the', 'multimonoatomic', 'carbon', 'chains', 'laterally', 'interacted', 'by', 'the', 'van', 'der', 'waal', 'force', 'despite', 'the', 'linearity', 'of', 'the', 'carbon', 'nanowires', 'is', 'independent', 'of', 'chain', 'length', 'at', 'low', 'temperatures', 'the', 'same', 'situation', 'does', 'not', 'hold', 'at', 'high', 'temperatures', 'disordered', 'kink', 'structure', 'is', 'observed', 'in', 'the', 'short', 'carbon', 'chains', 'especially', 'above', 'peierls', 'transition', 'temperature', 'for', 'instance', 'the', 'average', 'kink', 'angle', 'of', '50atoms', 'carbon', 'nanowire', 'is', 'as', 'large', 'as', '35', 'degree', 'at', '800k', 'we', 'have', 'provided', 'an', 'important', 'inspection', 'that', 'any', 'physical', 'property', 'of', 'the', 'finitelength', 'carbon', 'chain', 'predicted', 'by', 'abinitio', 'calculation', 'should', 'reconsider', 'the', 'atomic', 'rearrangement', 'due', 'to', 'the', 'thermal', 'instability', 'apart', 'from', 'this', 'the', 'kink', 'structure', 'in', 'the', 'nanowires', 'likely', 'increases', 'the', 'probability', 'of', 'attaching', 'negatively', 'charged', 'atoms', 'which', 'is', 'an', 'encouragement', 'to', 'find', 'the', 'next', 'generation', 'materials', 'for', 'chemisorption']] | [-0.12197348358560853, 0.20766501914979543, 0.007432794135985608, 0.007127110411883476, 0.014868542866435708, -0.1442556834309218, 0.0655944957289864, 0.44547176773938324, -0.2604939856316856, -0.28905374006627454, 0.04613831186590275, -0.32428033256029576, -0.06596876134239041, 0.160408611932635, 0.023750200020341377, 0.0070897951996981255, 0.08635642784575634, -0.01870836484361171, -0.04415035308650743, -0.1997664276973738, 0.24364475585213027, 0.14953229359840764, 0.33844952246164617, 0.11128545929131713, 0.019065642795410277, -0.0059501278530998325, 0.0643506623665351, -0.005171773334744281, -0.17805608487394717, 0.11124622102793229, 0.2286449411941558, -0.058986661799431156, 0.23996738963592412, -0.4821463594232331, -0.22010981621335923, 0.03168899627263207, 0.1537031111374651, 0.1802170532341499, -0.05166212736374516, -0.22567518038396753, 0.05733078441669032, -0.1496043744570961, -0.16621710588155222, 0.007755300505374817, 0.02199952559036769, 0.03843963814577683, -0.1723923855170142, 0.03807000000721093, 0.05131574382179791, 0.07631339554401287, -0.04081191294634542, -0.13536014411233596, -0.08362484941158213, 0.09469927029837806, 0.04706410163372621, 0.0021511181257665157, 0.2199477582144402, -0.09486391483902086, -0.08705442600773129, 0.3781782857132788, -0.06422624292245768, -0.08660676088256128, 0.19020916702203, -0.14269401708056131, -0.12858404416291488, 0.1965130008226232, 0.08433961628134526, 0.09641093288826727, -0.1629700000123625, 0.0463482879170339, -0.01994077569670668, 0.16029212356679448, 0.09698624458864868, 0.013590224677716027, 0.2814016139144366, 0.2289613573475904, 0.020864783817441345, 0.16802970847995838, -0.12287029674751972, -0.05818783496770547, -0.19925860696731462, -0.20988737870672042, -0.17926156271930746, 0.07903869862294068, -0.055573569027363136, -0.23044610581091923, 0.34012327754159566, 0.10891467861285922, 0.14127402285536386, -0.03503024119694151, 0.2338714341179362, 0.0702482286292205, 0.10010104055141973, -0.0065237771204826375, 0.2544318706987752, 0.178744083243427, 0.08300609325092363, -0.23883662679827936, 0.10407187177478, 0.023682563466058335] |
1,802.0317 | Adversarial Metric Learning | In the past decades, intensive efforts have been put to design various loss
functions and metric forms for metric learning problem. These improvements have
shown promising results when the test data is similar to the training data.
However, the trained models often fail to produce reliable distances on the
ambiguous test pairs due to the distribution bias between training set and test
set. To address this problem, the Adversarial Metric Learning (AML) is proposed
in this paper, which automatically generates adversarial pairs to remedy the
distribution bias and facilitate robust metric learning. Specifically, AML
consists of two adversarial stages, i.e. confusion and distinguishment. In
confusion stage, the ambiguous but critical adversarial data pairs are
adaptively generated to mislead the learned metric. In distinguishment stage, a
metric is exhaustively learned to try its best to distinguish both the
adversarial pairs and the original training pairs. Thanks to the challenges
posed by the confusion stage in such competing process, the AML model is able
to grasp plentiful difficult knowledge that has not been contained by the
original training pairs, so the discriminability of AML can be significantly
improved. The entire model is formulated into optimization framework, of which
the global convergence is theoretically proved. The experimental results on toy
data and practical datasets clearly demonstrate the superiority of AML to the
representative state-of-the-art metric learning methodologies.
| cs.LG stat.ML | in the past decades intensive efforts have been put to design various loss functions and metric forms for metric learning problem these improvements have shown promising results when the test data is similar to the training data however the trained models often fail to produce reliable distances on the ambiguous test pairs due to the distribution bias between training set and test set to address this problem the adversarial metric learning aml is proposed in this paper which automatically generates adversarial pairs to remedy the distribution bias and facilitate robust metric learning specifically aml consists of two adversarial stages ie confusion and distinguishment in confusion stage the ambiguous but critical adversarial data pairs are adaptively generated to mislead the learned metric in distinguishment stage a metric is exhaustively learned to try its best to distinguish both the adversarial pairs and the original training pairs thanks to the challenges posed by the confusion stage in such competing process the aml model is able to grasp plentiful difficult knowledge that has not been contained by the original training pairs so the discriminability of aml can be significantly improved the entire model is formulated into optimization framework of which the global convergence is theoretically proved the experimental results on toy data and practical datasets clearly demonstrate the superiority of aml to the representative stateoftheart metric learning methodologies | [['in', 'the', 'past', 'decades', 'intensive', 'efforts', 'have', 'been', 'put', 'to', 'design', 'various', 'loss', 'functions', 'and', 'metric', 'forms', 'for', 'metric', 'learning', 'problem', 'these', 'improvements', 'have', 'shown', 'promising', 'results', 'when', 'the', 'test', 'data', 'is', 'similar', 'to', 'the', 'training', 'data', 'however', 'the', 'trained', 'models', 'often', 'fail', 'to', 'produce', 'reliable', 'distances', 'on', 'the', 'ambiguous', 'test', 'pairs', 'due', 'to', 'the', 'distribution', 'bias', 'between', 'training', 'set', 'and', 'test', 'set', 'to', 'address', 'this', 'problem', 'the', 'adversarial', 'metric', 'learning', 'aml', 'is', 'proposed', 'in', 'this', 'paper', 'which', 'automatically', 'generates', 'adversarial', 'pairs', 'to', 'remedy', 'the', 'distribution', 'bias', 'and', 'facilitate', 'robust', 'metric', 'learning', 'specifically', 'aml', 'consists', 'of', 'two', 'adversarial', 'stages', 'ie', 'confusion', 'and', 'distinguishment', 'in', 'confusion', 'stage', 'the', 'ambiguous', 'but', 'critical', 'adversarial', 'data', 'pairs', 'are', 'adaptively', 'generated', 'to', 'mislead', 'the', 'learned', 'metric', 'in', 'distinguishment', 'stage', 'a', 'metric', 'is', 'exhaustively', 'learned', 'to', 'try', 'its', 'best', 'to', 'distinguish', 'both', 'the', 'adversarial', 'pairs', 'and', 'the', 'original', 'training', 'pairs', 'thanks', 'to', 'the', 'challenges', 'posed', 'by', 'the', 'confusion', 'stage', 'in', 'such', 'competing', 'process', 'the', 'aml', 'model', 'is', 'able', 'to', 'grasp', 'plentiful', 'difficult', 'knowledge', 'that', 'has', 'not', 'been', 'contained', 'by', 'the', 'original', 'training', 'pairs', 'so', 'the', 'discriminability', 'of', 'aml', 'can', 'be', 'significantly', 'improved', 'the', 'entire', 'model', 'is', 'formulated', 'into', 'optimization', 'framework', 'of', 'which', 'the', 'global', 'convergence', 'is', 'theoretically', 'proved', 'the', 'experimental', 'results', 'on', 'toy', 'data', 'and', 'practical', 'datasets', 'clearly', 'demonstrate', 'the', 'superiority', 'of', 'aml', 'to', 'the', 'representative', 'stateoftheart', 'metric', 'learning', 'methodologies']] | [-0.02863041885419599, 0.014014725351963924, -0.06575783076342694, 0.1307789266346861, -0.12562585294654127, -0.16025064194192445, 0.02615509521742102, 0.4134028563442241, -0.27274178801703136, -0.35359011706896126, 0.06881493918886658, -0.2798669932277075, -0.1631692012638918, 0.16636688271579, -0.16382887336294516, 0.11046128933412547, 0.134679633685924, 0.029312254132362017, -0.04713685485330643, -0.35723720852391644, 0.3503585211344346, 0.0664024573509648, 0.3759807184739787, 0.016040701730941822, 0.12334065476066566, -0.07588857772498159, -0.020609561234388302, 0.004071742253602549, -0.05318967601192526, 0.12980678222395778, 0.3156242860762859, 0.23983780468656082, 0.34200228720458525, -0.38786323288721697, -0.22713670342428877, 0.1470567044611276, 0.12244735160025552, 0.10263757746471518, -0.04500800501513628, -0.3315765479284372, 0.1171299442898349, -0.14428458166159025, -0.0099871842020158, -0.13570772666883255, -0.006586352947384252, -0.03138216849609827, -0.3028808631289784, 0.01617222403833044, 0.10591852239200047, 0.004519254236324092, -0.051336965588104376, -0.09984377476835757, -0.010059221388343888, 0.16193351595016534, 0.09726294703939077, 0.09001066082081317, 0.08700483992340326, -0.1271178617742927, -0.12484777421351671, 0.3461909249728186, -0.00800383030062741, -0.21980350154418765, 0.19711197552741005, -0.04030348931915536, -0.08455434316419996, 0.10026728878853776, 0.2210786619148816, 0.12374150759673544, -0.20411610260927254, 0.01366475246790547, 0.014468821048337435, 0.13295287454301224, 0.041096130861011, -0.022872190504910708, 0.17999201823165226, 0.18850132114156232, 0.018242244910132804, 0.15514440966269052, -0.11033565680996357, -0.08709404334539224, -0.22511369318401972, -0.06561885144453429, -0.1942326037138368, -0.0112499381419054, -0.07246807375966975, -0.13139310894868167, 0.39579692652686, 0.24315258003896037, 0.23138469048769497, 0.05838027447134664, 0.3379026542367813, 0.018405555355717036, 0.11206394539944345, 0.08042836383018377, 0.25273929490815916, 0.02842969286263854, 0.06721708396643018, -0.17421778973584878, 0.13020610525563825, 0.011344839062076062] |
1,802.03171 | A Unified Approach for Multi-step Temporal-Difference Learning with
Eligibility Traces in Reinforcement Learning | Recently, a new multi-step temporal learning algorithm, called $Q(\sigma)$,
unifies $n$-step Tree-Backup (when $\sigma=0$) and $n$-step Sarsa (when
$\sigma=1$) by introducing a sampling parameter $\sigma$. However, similar to
other multi-step temporal-difference learning algorithms, $Q(\sigma)$ needs
much memory consumption and computation time. Eligibility trace is an important
mechanism to transform the off-line updates into efficient on-line ones which
consume less memory and computation time. In this paper, we further develop the
original $Q(\sigma)$, combine it with eligibility traces and propose a new
algorithm, called $Q(\sigma ,\lambda)$, in which $\lambda$ is trace-decay
parameter. This idea unifies Sarsa$(\lambda)$ (when $\sigma =1$) and
$Q^{\pi}(\lambda)$ (when $\sigma =0$). Furthermore, we give an upper error
bound of $Q(\sigma ,\lambda)$ policy evaluation algorithm. We prove that
$Q(\sigma,\lambda)$ control algorithm can converge to the optimal value
function exponentially. We also empirically compare it with conventional
temporal-difference learning methods. Results show that, with an intermediate
value of $\sigma$, $Q(\sigma ,\lambda)$ creates a mixture of the existing
algorithms that can learn the optimal value significantly faster than the
extreme end ($\sigma=0$, or $1$).
| cs.AI cs.LG stat.ML | recently a new multistep temporal learning algorithm called qsigma unifies nstep treebackup when sigma0 and nstep sarsa when sigma1 by introducing a sampling parameter sigma however similar to other multistep temporaldifference learning algorithms qsigma needs much memory consumption and computation time eligibility trace is an important mechanism to transform the offline updates into efficient online ones which consume less memory and computation time in this paper we further develop the original qsigma combine it with eligibility traces and propose a new algorithm called qsigma lambda in which lambda is tracedecay parameter this idea unifies sarsalambda when sigma 1 and qpilambda when sigma 0 furthermore we give an upper error bound of qsigma lambda policy evaluation algorithm we prove that qsigmalambda control algorithm can converge to the optimal value function exponentially we also empirically compare it with conventional temporaldifference learning methods results show that with an intermediate value of sigma qsigma lambda creates a mixture of the existing algorithms that can learn the optimal value significantly faster than the extreme end sigma0 or 1 | [['recently', 'a', 'new', 'multistep', 'temporal', 'learning', 'algorithm', 'called', 'qsigma', 'unifies', 'nstep', 'treebackup', 'when', 'sigma0', 'and', 'nstep', 'sarsa', 'when', 'sigma1', 'by', 'introducing', 'a', 'sampling', 'parameter', 'sigma', 'however', 'similar', 'to', 'other', 'multistep', 'temporaldifference', 'learning', 'algorithms', 'qsigma', 'needs', 'much', 'memory', 'consumption', 'and', 'computation', 'time', 'eligibility', 'trace', 'is', 'an', 'important', 'mechanism', 'to', 'transform', 'the', 'offline', 'updates', 'into', 'efficient', 'online', 'ones', 'which', 'consume', 'less', 'memory', 'and', 'computation', 'time', 'in', 'this', 'paper', 'we', 'further', 'develop', 'the', 'original', 'qsigma', 'combine', 'it', 'with', 'eligibility', 'traces', 'and', 'propose', 'a', 'new', 'algorithm', 'called', 'qsigma', 'lambda', 'in', 'which', 'lambda', 'is', 'tracedecay', 'parameter', 'this', 'idea', 'unifies', 'sarsalambda', 'when', 'sigma', '1', 'and', 'qpilambda', 'when', 'sigma', '0', 'furthermore', 'we', 'give', 'an', 'upper', 'error', 'bound', 'of', 'qsigma', 'lambda', 'policy', 'evaluation', 'algorithm', 'we', 'prove', 'that', 'qsigmalambda', 'control', 'algorithm', 'can', 'converge', 'to', 'the', 'optimal', 'value', 'function', 'exponentially', 'we', 'also', 'empirically', 'compare', 'it', 'with', 'conventional', 'temporaldifference', 'learning', 'methods', 'results', 'show', 'that', 'with', 'an', 'intermediate', 'value', 'of', 'sigma', 'qsigma', 'lambda', 'creates', 'a', 'mixture', 'of', 'the', 'existing', 'algorithms', 'that', 'can', 'learn', 'the', 'optimal', 'value', 'significantly', 'faster', 'than', 'the', 'extreme', 'end', 'sigma0', 'or', '1']] | [-0.04130747550051417, 0.09171703628899142, -0.11448755323853807, 0.10293115558620741, -0.11975522666684622, -0.2375622483358867, 0.07364737561603556, 0.4296703738981538, -0.3022593307424579, -0.285440831483733, 0.0828638641017671, -0.2242565262517148, -0.18625750423260254, 0.16762837780689127, -0.08450624573191892, 0.059263504799124754, 0.05224003934869047, 0.08637603716759464, -0.060358068774889646, -0.26668392745061564, 0.2701452758256897, 0.0542301409078773, 0.2696783188785586, -0.032925554722018496, 0.12363764718615797, -0.011849213832405192, 0.016714582622007153, -0.02016205203267553, -0.15691525721573787, 0.11288800257941455, 0.2488509838430751, 0.19793051499570308, 0.3537902950513116, -0.36306335179124183, -0.15928461648711173, 0.17068429294279253, 0.19382189405729344, 0.07867458719379936, -0.0059061265762719, -0.2601548830119062, 0.12026625916571218, -0.1675476144059677, -0.0291576469881934, -0.11439539084883307, 0.029508420764937027, -0.018392728950921998, -0.3480889384728476, 0.04292309670085666, 0.07995917536483625, -0.023702862445360115, -0.03910773425340961, -0.19460628546785408, 0.0659632154550271, 0.03919789553192835, 0.05130726254556174, 0.09760727945538844, 0.11711850432822338, -0.12776928944458094, -0.1660414166616265, 0.29221898200508406, -0.09940100479886534, -0.18161374126897145, 0.11762379829843457, -0.03720210638233411, -0.14305675820001132, 0.1387321762985153, 0.17011620430551336, 0.16033744989458978, -0.08023545437405635, 0.10266166762001096, -0.03650454490324317, 0.20145629914532576, 0.018651496045864545, -0.01553629159434153, 0.030417359246701532, 0.1917255631652826, 0.13306967445136703, 0.12181291727730784, -0.05378777891350635, -0.12274232576738976, -0.24579032798181977, -0.1583119532463317, -0.12601451210666603, 0.02678899171337838, -0.14080988511278847, -0.1360284957939865, 0.30708814519264643, 0.2027734672132681, 0.22844260614144907, 0.1969384896092271, 0.33510792005212, 0.1481440670584389, 0.05097981592049249, 0.1761348114580401, 0.14467831459943448, 0.024536950367684725, 0.09999307278700768, -0.21705292906479898, 0.08449984822124684, 0.08652598567075542] |
1,802.03172 | Probability distribution of intensity fluctuations of vortex laser beams
in the turbulent atmosphere | Numerical simulation is used to analyze statistical characteristics of vortex
beams propagating in the atmosphere. The cumulative distribution function and
the probability density function of intensity fluctuations are compared for
Gaussian beams and vortex beams. It is shown that for propagation conditions in
the turbulent atmosphere corresponding to weak fluctuations (Rytov parameter
much smaller than unity), intensity fluctuations at the axis of the Gaussian
beam have the lognormal distribution, whereas the probability density
distribution of the radiation intensity fluctuations at the axis of the vortex
beams is well approximated by the exponential distribution characteristic of
conditions of saturated fluctuations (Rytov parameter much larger than unity)
| physics.optics | numerical simulation is used to analyze statistical characteristics of vortex beams propagating in the atmosphere the cumulative distribution function and the probability density function of intensity fluctuations are compared for gaussian beams and vortex beams it is shown that for propagation conditions in the turbulent atmosphere corresponding to weak fluctuations rytov parameter much smaller than unity intensity fluctuations at the axis of the gaussian beam have the lognormal distribution whereas the probability density distribution of the radiation intensity fluctuations at the axis of the vortex beams is well approximated by the exponential distribution characteristic of conditions of saturated fluctuations rytov parameter much larger than unity | [['numerical', 'simulation', 'is', 'used', 'to', 'analyze', 'statistical', 'characteristics', 'of', 'vortex', 'beams', 'propagating', 'in', 'the', 'atmosphere', 'the', 'cumulative', 'distribution', 'function', 'and', 'the', 'probability', 'density', 'function', 'of', 'intensity', 'fluctuations', 'are', 'compared', 'for', 'gaussian', 'beams', 'and', 'vortex', 'beams', 'it', 'is', 'shown', 'that', 'for', 'propagation', 'conditions', 'in', 'the', 'turbulent', 'atmosphere', 'corresponding', 'to', 'weak', 'fluctuations', 'rytov', 'parameter', 'much', 'smaller', 'than', 'unity', 'intensity', 'fluctuations', 'at', 'the', 'axis', 'of', 'the', 'gaussian', 'beam', 'have', 'the', 'lognormal', 'distribution', 'whereas', 'the', 'probability', 'density', 'distribution', 'of', 'the', 'radiation', 'intensity', 'fluctuations', 'at', 'the', 'axis', 'of', 'the', 'vortex', 'beams', 'is', 'well', 'approximated', 'by', 'the', 'exponential', 'distribution', 'characteristic', 'of', 'conditions', 'of', 'saturated', 'fluctuations', 'rytov', 'parameter', 'much', 'larger', 'than', 'unity']] | [-0.12392763274034396, 0.21695755795863944, -0.1342995512520983, 0.14395480884926481, 0.01233940546267799, -0.0587902607972778, -0.04679617578429835, 0.3700822643580891, -0.24684993912066733, -0.26884096077687686, 0.03495176596611384, -0.27484613022811355, -0.017950290286292633, 0.18707027316448235, 0.035536158599314235, 0.1110856788388143, -0.014336993924475142, -0.003818202160653614, -0.04512952624354512, -0.16611517967567557, 0.29520831153772414, 0.17946663476482388, 0.37727835827640127, -0.016456457267382315, 0.06987020286420981, -0.027746313318078007, 0.00577541927673987, -0.002452289548126005, -0.15255193014530788, 0.01590654396540707, 0.15068401906949777, 0.05226366784246195, 0.22642326839268206, -0.4153917770477987, -0.26663695131095927, 0.10882330485841347, 0.1939218680995206, 0.08168349021247455, 0.018426665007358504, -0.24117809679536592, 0.0392336005478033, -0.12261501473951197, -0.22363223871216178, 0.01365338729783183, 0.048887254599304424, 0.11436557081485392, -0.3149369580405099, 0.1284253924020699, 0.034178121233846816, 0.07133120204809876, 0.004581304196090925, -0.16436548072489954, -0.06647075065411627, 0.009940651564725808, 0.07716201331155996, 0.04923202788368577, 0.2126247954510507, -0.1770518310811548, 0.0005586011246556328, 0.3537720150269923, -0.08021400228192631, -0.20142345203175432, 0.08264739274801243, -0.2801065656630921, 0.008745369918289638, 0.2672178908295575, 0.16570162088388488, 0.07812353634231148, -0.05462508500509319, -0.02422396224989955, -0.014227088268047998, 0.16462270442751192, 0.11877086854850252, 0.037007426368516116, 0.2278748362901665, 0.09952314361220314, 0.07206381782224136, 0.1430663299081581, -0.172238261733825, -0.14689349462943418, -0.2799532469894205, -0.09243285582134766, -0.22132860917065825, 0.01927517909290535, -0.09679693276300982, -0.15151652901383517, 0.3922028899946738, 0.16149540818518116, 0.16087976930180697, 0.06790484437009409, 0.3226508939904826, 0.1974862836123932, 0.017948564354862487, 0.07416370493447175, 0.23544698015210175, 0.21249325361901095, 0.10457341431063555, -0.21915589215544362, 0.10350387903329517, -0.04068387840830144] |
1,802.03173 | Arithmetic and dynamical degrees of self-morphisms of semi-abelian
varieties | We prove a conjecture by Kawaguchi-Silverman on arithmetic and dynamical
degrees, for self-morphisms of semi-abelian varieties. Moreover, we determine
the set of the arithmetic degrees of orbits and the (first) dynamical degrees
of self-morphisms of semi-abelian varieties.
| math.AG math.NT | we prove a conjecture by kawaguchisilverman on arithmetic and dynamical degrees for selfmorphisms of semiabelian varieties moreover we determine the set of the arithmetic degrees of orbits and the first dynamical degrees of selfmorphisms of semiabelian varieties | [['we', 'prove', 'a', 'conjecture', 'by', 'kawaguchisilverman', 'on', 'arithmetic', 'and', 'dynamical', 'degrees', 'for', 'selfmorphisms', 'of', 'semiabelian', 'varieties', 'moreover', 'we', 'determine', 'the', 'set', 'of', 'the', 'arithmetic', 'degrees', 'of', 'orbits', 'and', 'the', 'first', 'dynamical', 'degrees', 'of', 'selfmorphisms', 'of', 'semiabelian', 'varieties']] | [-0.2812038251274341, 0.08621318459611486, -0.13450101813351786, 0.04718869249965694, -0.018836171391445236, -0.07921214569737581, 0.06564828959872594, 0.2433340358170303, -0.3033574812013555, -0.2219442678363742, 0.07556270146616609, -0.16095251085966625, -0.13484934344887733, 0.22366083413362503, -0.18072194986146045, -0.009279867407639284, 0.014261526684906031, 0.06594511598814279, -0.07167369075673255, -0.3895596835158161, 0.4350345797232679, -0.1252487671838419, 0.09603590810218372, 0.07783231023396994, 0.17802922810251648, 0.07415122935246374, 0.014833835331169335, -0.03953660168760532, -0.1643620286690625, 0.17684520746430232, 0.26294186308577255, 0.09947716553594817, 0.18486418066596663, -0.3585298236811886, -0.14301005317326132, 0.1532216700599403, 0.09075762006781392, 0.08004382278493329, 0.06513936732379669, -0.25822738598327377, 0.13582736331768133, -0.18191422109265584, -0.2520264742040151, -0.1061288914013956, 0.07974429257415436, 0.08498378241642353, -0.2144246229247467, -0.010878969487306234, 0.14877429321829885, 0.2977458292970786, -0.029016431144161803, -0.12884062357448242, -0.05589247129328952, 0.04521177220787551, 0.004182643282252389, -0.029196814747174848, 0.08111829142010696, -0.12618945725262165, -0.1490795679289747, 0.3759869558585657, 0.007606759094759016, -0.16019907447736007, 0.137090649405444, -0.18303154807890187, -0.18946778143730922, 0.11754313156612821, 0.15479876282247337, 0.19461035104216756, -0.001943129882518504, 0.17162975275926795, -0.15219540055841208, 0.10259242748489251, 0.15325704083551425, 0.036764423186714586, 0.16219008912810604, 0.047582711086835004, 0.030344799009932054, 0.15234955611663895, -0.008982612191372225, -0.04907822634492265, -0.32621873109727295, -0.16070588003541972, -0.06405631256465977, 0.17386449774651713, -0.14193223770377478, -0.15565401829175046, 0.43883798029777166, 0.10473276649576586, 0.1043344180326204, 0.17131655859584743, 0.1896775596447893, 0.006243085838316285, 0.00992858545804346, 0.05420156173105981, 0.1471444677460838, 0.2944118467700743, -0.12024283211527241, -0.16200222890522029, -0.03411024128011352, 0.18713558364558863] |
1,802.03174 | Surrogate Models for Direct Dark Matter Detection | In this work we introduce RAPIDD, a surrogate model that speeds up the
computation of the expected spectrum of dark matter particles in direct
detection experiments. RAPIDD replaces the exact calculation of the dark matter
differential rate (which in general involves up to three nested integrals) with
a much faster parametrization in terms of ordinary polynomials of the dark
matter mass and couplings, obtained in an initial training phase. In this
article, we validate our surrogate model on the multi-dimensional parameter
space resulting from the effective field theory description of dark matter
interactions with nuclei, including also astrophysical uncertainties in the
description of the dark matter halo. As a concrete example, we use this tool to
study the complementarity of different targets to discriminate simplified dark
matter models. We demonstrate that RAPIDD is fast and accurate, and
particularly well-suited to explore a multi-dimensional parameter space, such
as the one in effective field theory approach, and scans with a large number of
evaluations.
| hep-ph astro-ph.CO | in this work we introduce rapidd a surrogate model that speeds up the computation of the expected spectrum of dark matter particles in direct detection experiments rapidd replaces the exact calculation of the dark matter differential rate which in general involves up to three nested integrals with a much faster parametrization in terms of ordinary polynomials of the dark matter mass and couplings obtained in an initial training phase in this article we validate our surrogate model on the multidimensional parameter space resulting from the effective field theory description of dark matter interactions with nuclei including also astrophysical uncertainties in the description of the dark matter halo as a concrete example we use this tool to study the complementarity of different targets to discriminate simplified dark matter models we demonstrate that rapidd is fast and accurate and particularly wellsuited to explore a multidimensional parameter space such as the one in effective field theory approach and scans with a large number of evaluations | [['in', 'this', 'work', 'we', 'introduce', 'rapidd', 'a', 'surrogate', 'model', 'that', 'speeds', 'up', 'the', 'computation', 'of', 'the', 'expected', 'spectrum', 'of', 'dark', 'matter', 'particles', 'in', 'direct', 'detection', 'experiments', 'rapidd', 'replaces', 'the', 'exact', 'calculation', 'of', 'the', 'dark', 'matter', 'differential', 'rate', 'which', 'in', 'general', 'involves', 'up', 'to', 'three', 'nested', 'integrals', 'with', 'a', 'much', 'faster', 'parametrization', 'in', 'terms', 'of', 'ordinary', 'polynomials', 'of', 'the', 'dark', 'matter', 'mass', 'and', 'couplings', 'obtained', 'in', 'an', 'initial', 'training', 'phase', 'in', 'this', 'article', 'we', 'validate', 'our', 'surrogate', 'model', 'on', 'the', 'multidimensional', 'parameter', 'space', 'resulting', 'from', 'the', 'effective', 'field', 'theory', 'description', 'of', 'dark', 'matter', 'interactions', 'with', 'nuclei', 'including', 'also', 'astrophysical', 'uncertainties', 'in', 'the', 'description', 'of', 'the', 'dark', 'matter', 'halo', 'as', 'a', 'concrete', 'example', 'we', 'use', 'this', 'tool', 'to', 'study', 'the', 'complementarity', 'of', 'different', 'targets', 'to', 'discriminate', 'simplified', 'dark', 'matter', 'models', 'we', 'demonstrate', 'that', 'rapidd', 'is', 'fast', 'and', 'accurate', 'and', 'particularly', 'wellsuited', 'to', 'explore', 'a', 'multidimensional', 'parameter', 'space', 'such', 'as', 'the', 'one', 'in', 'effective', 'field', 'theory', 'approach', 'and', 'scans', 'with', 'a', 'large', 'number', 'of', 'evaluations']] | [-0.08582443002622897, 0.11066154057361591, -0.10482175345568527, 0.13445597308268195, -0.07644854960848152, -0.0804173442977768, 0.009750649687995053, 0.30174961571731135, -0.22767485295893786, -0.3786875088699162, 0.036141240460522195, -0.23876344141216926, -0.11420131158399867, 0.2012214599792374, 0.007092687462486706, 0.047407543095530094, 0.03541329596766535, 0.025144541785580878, -0.078612033814554, -0.22583453453729435, 0.3188219273232464, 0.05869520835888883, 0.21650253302981087, 0.021568193514313962, 0.11829072326985131, 0.00803198622263692, -0.06737181523895282, -0.022366732294347144, -0.16100280983044757, 0.12146961393501655, 0.23154482595942052, 0.11251960301852244, 0.2147187615290606, -0.41934519988933094, -0.22285747457939534, 0.15702257127742525, 0.15046496749395666, 0.13625592686146798, -0.09381810363858542, -0.2833009925096031, 0.016145578140024968, -0.22821392327328616, -0.12703668197507706, -0.11375103630039289, -0.010243826019750149, 0.0036624828971531472, -0.2820990097961952, 0.08957831864622508, -0.011026747409760215, -0.028824736914643444, -0.05714215517595962, -0.09658588756114406, 0.026072290917157116, 0.020709686475679463, 0.08495654972028677, 0.015358486326330882, 0.1406798024495121, -0.20839227048930264, -0.07515838447768518, 0.4181003495907112, -0.11542354019166166, -0.1950703943953102, 0.1927457014673654, -0.11673251562464385, -0.1459363384494259, 0.1243181457961507, 0.1990638991607997, 0.14014770735607104, -0.12566690235168754, 0.0931240576017579, -0.04551594312026821, 0.16549928787302365, 0.014651842603609426, 0.014689285756177901, 0.2350371755446871, 0.2056717717413572, 0.03901748256297943, 0.09622125794973087, -0.08535234642036857, -0.12059542574678306, -0.33131628739935015, -0.1828771400204134, -0.1480607554305023, -0.019691741125612162, -0.10313601407131186, -0.1451105233511807, 0.3899407657150777, 0.1618418249224002, 0.2034490120002172, 0.049036216399672636, 0.33917149685806147, 0.07270567650535938, 0.030818691896849576, 0.019601452905960656, 0.2570346153433216, 0.1277568756152134, 0.06392088357393665, -0.19898245962448763, -0.014359804137644393, 0.030178223230680565] |
1,802.03175 | The modality of a Borel subgroup in a simple algebraic group of type
$E_8$ | Let $G$ be a simple algebraic group over an algebraically closed field $k$,
where $\mathrm{char}\, k$ is either 0 or a good prime for $G$. We consider the
modality $\mathrm{mod}(B : \mathfrak u)$ of the action of a Borel subgroup $B$
of $G$ on the Lie algebra $\mathfrak u$ of the unipotent radical of $B$, and
report on computer calculations used to show that $\mathrm{mod}(B:\mathfrak u)
= 20$, when $G$ is of type $\mathrm E_8$. This completes the determination of
the values for $\mathrm{mod}(B:\mathfrak u)$ for $G$ of exceptional type.
| math.GR | let g be a simple algebraic group over an algebraically closed field k where mathrmchar k is either 0 or a good prime for g we consider the modality mathrmmodb mathfrak u of the action of a borel subgroup b of g on the lie algebra mathfrak u of the unipotent radical of b and report on computer calculations used to show that mathrmmodbmathfrak u 20 when g is of type mathrm e_8 this completes the determination of the values for mathrmmodbmathfrak u for g of exceptional type | [['let', 'g', 'be', 'a', 'simple', 'algebraic', 'group', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'where', 'mathrmchar', 'k', 'is', 'either', '0', 'or', 'a', 'good', 'prime', 'for', 'g', 'we', 'consider', 'the', 'modality', 'mathrmmodb', 'mathfrak', 'u', 'of', 'the', 'action', 'of', 'a', 'borel', 'subgroup', 'b', 'of', 'g', 'on', 'the', 'lie', 'algebra', 'mathfrak', 'u', 'of', 'the', 'unipotent', 'radical', 'of', 'b', 'and', 'report', 'on', 'computer', 'calculations', 'used', 'to', 'show', 'that', 'mathrmmodbmathfrak', 'u', '20', 'when', 'g', 'is', 'of', 'type', 'mathrm', 'e_8', 'this', 'completes', 'the', 'determination', 'of', 'the', 'values', 'for', 'mathrmmodbmathfrak', 'u', 'for', 'g', 'of', 'exceptional', 'type']] | [-0.24550684000201084, 0.06866080031939098, -0.03902463377179469, -0.053929056398406186, -0.11739201284397174, -0.17830429327509859, 0.04692150183460292, 0.3497958325945279, -0.3253374297829235, -0.20598872450782973, 0.05501099874758545, -0.25096439432681483, -0.030109226295505376, 0.20057928713915102, -0.07363226725993788, -0.11704317572619082, 0.08023931516663116, 0.23992570135468508, -0.08429825514938463, -0.24344588987673085, 0.3479429722927949, -0.12751273496953003, 0.16414218390470042, 0.020900743262951865, 0.0756443537223865, 0.02544113491278361, 0.040057029706590315, -0.02101619089131846, -0.1793720802104765, 0.067239752198186, 0.2933375725084368, 0.05089311443050118, 0.2721842323375099, -0.34049913245527186, -0.1285202166887329, 0.22257646492079777, 0.15795037272002768, -0.0792656928739127, 0.009165821665459695, -0.267719040679581, 0.1637875162092421, -0.17386714398641798, -0.1386346137151122, -0.02940373669433243, 0.19602234843050076, -0.03525026352966533, -0.3317888709771283, 0.022111026614027866, 0.054342349963810516, 0.18063667205304443, -0.014511546070742256, -0.19744540061664712, -0.0511368086150683, 0.06693276588921435, -0.05526745979098932, 0.15970110841752852, 0.07552216268308899, -0.11534874629612793, -0.07429379373104038, 0.451710218059666, -0.11567813858718556, -0.14709973546183286, 0.10514136055922683, -0.23105256514733327, -0.13854802669409444, 0.09487012621453579, 0.08256954165613827, 0.18192654332584318, -0.01410817926585236, 0.27453128380961167, -0.13857381634195062, 0.050886074502897616, -0.00790340441333897, -0.05791313084773719, 0.10525033142801155, 0.09604147635948132, 0.0509848267880871, 0.04800640919711441, 0.02375286875621361, 0.1506168969492565, -0.3994396252448068, -0.1491377006010974, -0.1195485471172587, 0.2187927760402946, -0.10379325727750684, -0.16038408710018676, 0.4039825353114044, 0.07368709935861475, 0.16356150512857473, 0.06223431598833379, 0.14838282163528835, 0.05974754429257968, 0.05731414672781659, 0.08853199080947567, 0.07192373575971407, 0.24347889629357, -0.10592183047385119, -0.2400116460836109, -0.05000556850915446, 0.1840402993866626] |
1,802.03176 | Monocrystalline free standing 3D yttrium iron garnet magnon nano
resonators | Nano resonators in which mechanical vibrations and spin waves can be coupled
are an intriguing concept that can be used in quantum information processing to
transfer information between different states of excitation. Until now, the
fabrication of free standing magnetic nanostructures which host long lived spin
wave excitatons and may be suitable as mechanical resonators seemed elusive. We
demonstrate the fabrication of free standing monocrystalline yttrium iron
garnet (YIG) 3D nanoresonators with nearly ideal magnetic properties. The
freestanding 3D structures are obtained using a complex lithography process
including room temperature deposition and lift-off of amorphous YIG and
subsequent crystallization by annealing. The crystallization nucleates from the
substrate and propagates across the structure even around bends over distances
of several micrometers to form e.g. monocrystalline resonators as shown by
transmission electron microscopy. Spin wave excitations in individual
nanostructures are imaged by time resolved scanning Kerr microscopy. The narrow
linewidth of the magnetic excitations indicates a Gilbert damping constant of
only $\alpha = 2.6 \times 10^{-4}$ rivalling the best values obtained for
epitaxial YIG thin film material. The new fabrication process represents a leap
forward in magnonics and magnon mechanics as it provides 3D YIG structures of
unprecedented quality. At the same time it demonstrates a completely new route
towards the fabrication of free standing crystalline nano structures which may
be applicable also to other material systems.
| cond-mat.mes-hall | nano resonators in which mechanical vibrations and spin waves can be coupled are an intriguing concept that can be used in quantum information processing to transfer information between different states of excitation until now the fabrication of free standing magnetic nanostructures which host long lived spin wave excitatons and may be suitable as mechanical resonators seemed elusive we demonstrate the fabrication of free standing monocrystalline yttrium iron garnet yig 3d nanoresonators with nearly ideal magnetic properties the freestanding 3d structures are obtained using a complex lithography process including room temperature deposition and liftoff of amorphous yig and subsequent crystallization by annealing the crystallization nucleates from the substrate and propagates across the structure even around bends over distances of several micrometers to form eg monocrystalline resonators as shown by transmission electron microscopy spin wave excitations in individual nanostructures are imaged by time resolved scanning kerr microscopy the narrow linewidth of the magnetic excitations indicates a gilbert damping constant of only alpha 26 times 104 rivalling the best values obtained for epitaxial yig thin film material the new fabrication process represents a leap forward in magnonics and magnon mechanics as it provides 3d yig structures of unprecedented quality at the same time it demonstrates a completely new route towards the fabrication of free standing crystalline nano structures which may be applicable also to other material systems | [['nano', 'resonators', 'in', 'which', 'mechanical', 'vibrations', 'and', 'spin', 'waves', 'can', 'be', 'coupled', 'are', 'an', 'intriguing', 'concept', 'that', 'can', 'be', 'used', 'in', 'quantum', 'information', 'processing', 'to', 'transfer', 'information', 'between', 'different', 'states', 'of', 'excitation', 'until', 'now', 'the', 'fabrication', 'of', 'free', 'standing', 'magnetic', 'nanostructures', 'which', 'host', 'long', 'lived', 'spin', 'wave', 'excitatons', 'and', 'may', 'be', 'suitable', 'as', 'mechanical', 'resonators', 'seemed', 'elusive', 'we', 'demonstrate', 'the', 'fabrication', 'of', 'free', 'standing', 'monocrystalline', 'yttrium', 'iron', 'garnet', 'yig', '3d', 'nanoresonators', 'with', 'nearly', 'ideal', 'magnetic', 'properties', 'the', 'freestanding', '3d', 'structures', 'are', 'obtained', 'using', 'a', 'complex', 'lithography', 'process', 'including', 'room', 'temperature', 'deposition', 'and', 'liftoff', 'of', 'amorphous', 'yig', 'and', 'subsequent', 'crystallization', 'by', 'annealing', 'the', 'crystallization', 'nucleates', 'from', 'the', 'substrate', 'and', 'propagates', 'across', 'the', 'structure', 'even', 'around', 'bends', 'over', 'distances', 'of', 'several', 'micrometers', 'to', 'form', 'eg', 'monocrystalline', 'resonators', 'as', 'shown', 'by', 'transmission', 'electron', 'microscopy', 'spin', 'wave', 'excitations', 'in', 'individual', 'nanostructures', 'are', 'imaged', 'by', 'time', 'resolved', 'scanning', 'kerr', 'microscopy', 'the', 'narrow', 'linewidth', 'of', 'the', 'magnetic', 'excitations', 'indicates', 'a', 'gilbert', 'damping', 'constant', 'of', 'only', 'alpha', '26', 'times', '104', 'rivalling', 'the', 'best', 'values', 'obtained', 'for', 'epitaxial', 'yig', 'thin', 'film', 'material', 'the', 'new', 'fabrication', 'process', 'represents', 'a', 'leap', 'forward', 'in', 'magnonics', 'and', 'magnon', 'mechanics', 'as', 'it', 'provides', '3d', 'yig', 'structures', 'of', 'unprecedented', 'quality', 'at', 'the', 'same', 'time', 'it', 'demonstrates', 'a', 'completely', 'new', 'route', 'towards', 'the', 'fabrication', 'of', 'free', 'standing', 'crystalline', 'nano', 'structures', 'which', 'may', 'be', 'applicable', 'also', 'to', 'other', 'material', 'systems']] | [-0.13947639642377288, 0.23466020974184693, -0.029169627945586172, -0.04958182438153702, -0.06444474677304683, -0.16502733271143027, 0.003790700432819402, 0.4689355091287884, -0.2865350861258955, -0.322440173084359, 0.04872007405979459, -0.2954417171349306, -0.07916533454392323, 0.25060188451143933, 0.03998669301503542, 0.09814715412119873, 0.006963111203364326, -0.10779213634916819, -0.04304611401302498, -0.1514636493144941, 0.19901720412919138, 0.062380499414778044, 0.3390702994481865, 0.055385791182918934, 0.07645675855283646, -0.02049680470907643, 0.13491011722088528, -0.005418285225296702, -0.16718361328472514, 0.06475054481951102, 0.2787841171738295, -0.0716553290662744, 0.20998604424327044, -0.5220284085896184, -0.2661234835041906, -0.06203505870439279, 0.1957552915309413, 0.1739611062644083, -0.0807822120236024, -0.26965904667672824, 0.03088456460884501, -0.10421022397623661, -0.11370641388408338, -0.06949723467508523, -0.010312115787131704, -0.0277100987377422, -0.18184199264939171, 0.058071652667846474, 0.07567756708435748, 0.07229285541558512, -0.0862439315528045, -0.08100675192276316, -0.07181916562104264, 0.05537483849115837, -0.0014221136141860766, 0.01963119625819705, 0.24765350698125904, -0.09940342098758721, -0.13077206215654152, 0.37291561414992996, -0.04030568348744993, -0.09618503342261496, 0.1719611506311916, -0.19105443220915516, -0.0002707585200642323, 0.19725899430171423, 0.13294296462825947, 0.13196369757220117, -0.16265687447447422, 0.016075984022012105, 0.02825789054505414, 0.22772137208052415, 0.18456259018829252, 0.09078717625578824, 0.2907866368325001, 0.23290683975184312, 0.015411548813462525, 0.15112451597893686, -0.11947488211849161, 0.01979485017794598, -0.16663839621260562, -0.20990747161159468, -0.2181943548809854, 0.13511406455537192, -0.08734486153573236, -0.21780507204333224, 0.35947964509485514, 0.13221705903407738, 0.14650127072839458, -0.07806439537332067, 0.27170591793052284, 0.03803254145139102, 0.10597479161587146, -0.016829633818012182, 0.27054003425226486, 0.195338570710163, 0.1272486738914508, -0.23564582445550158, 0.07225789546741031, -0.044619888426410244] |
1,802.03177 | Multipartite entanglement, quantum coherence, and quantum criticality in
triangular and Sierpi\'nski fractal lattices | We investigate the quantum phase transitions of the transverse-field quantum
Ising model on the triangular lattice and Sierpi\'nski fractal lattices by
employing multipartite entanglement and quantum coherence along with the
quantum renormalization group method. It is shown that the quantum
criticalities of these high-dimensional models closely relate to the behaviors
of the multipartite entanglement and quantum coherence. As the thermodynamic
limit is approached, the first derivatives of multipartite entanglement and
quantum coherence exhibit singular behaviors and the consistent finite-size
scaling behaviors for each lattice are also obtained from the first
derivatives. The multipartite entanglement and quantum coherence are
demonstrated to be good indicators for detecting the quantum phase transitions
in the triangular lattice and Sierpi\'nski fractal lattices. Furthermore, the
factors that determine the relations between the critical exponents and the
correlation length exponents for these models are diverse. For the triangular
lattice, the decisive factor is the spatial dimension, while for the
Sierpi\'nski fractal lattices, it is the Hausdorff dimension.
| quant-ph | we investigate the quantum phase transitions of the transversefield quantum ising model on the triangular lattice and sierpinski fractal lattices by employing multipartite entanglement and quantum coherence along with the quantum renormalization group method it is shown that the quantum criticalities of these highdimensional models closely relate to the behaviors of the multipartite entanglement and quantum coherence as the thermodynamic limit is approached the first derivatives of multipartite entanglement and quantum coherence exhibit singular behaviors and the consistent finitesize scaling behaviors for each lattice are also obtained from the first derivatives the multipartite entanglement and quantum coherence are demonstrated to be good indicators for detecting the quantum phase transitions in the triangular lattice and sierpinski fractal lattices furthermore the factors that determine the relations between the critical exponents and the correlation length exponents for these models are diverse for the triangular lattice the decisive factor is the spatial dimension while for the sierpinski fractal lattices it is the hausdorff dimension | [['we', 'investigate', 'the', 'quantum', 'phase', 'transitions', 'of', 'the', 'transversefield', 'quantum', 'ising', 'model', 'on', 'the', 'triangular', 'lattice', 'and', 'sierpinski', 'fractal', 'lattices', 'by', 'employing', 'multipartite', 'entanglement', 'and', 'quantum', 'coherence', 'along', 'with', 'the', 'quantum', 'renormalization', 'group', 'method', 'it', 'is', 'shown', 'that', 'the', 'quantum', 'criticalities', 'of', 'these', 'highdimensional', 'models', 'closely', 'relate', 'to', 'the', 'behaviors', 'of', 'the', 'multipartite', 'entanglement', 'and', 'quantum', 'coherence', 'as', 'the', 'thermodynamic', 'limit', 'is', 'approached', 'the', 'first', 'derivatives', 'of', 'multipartite', 'entanglement', 'and', 'quantum', 'coherence', 'exhibit', 'singular', 'behaviors', 'and', 'the', 'consistent', 'finitesize', 'scaling', 'behaviors', 'for', 'each', 'lattice', 'are', 'also', 'obtained', 'from', 'the', 'first', 'derivatives', 'the', 'multipartite', 'entanglement', 'and', 'quantum', 'coherence', 'are', 'demonstrated', 'to', 'be', 'good', 'indicators', 'for', 'detecting', 'the', 'quantum', 'phase', 'transitions', 'in', 'the', 'triangular', 'lattice', 'and', 'sierpinski', 'fractal', 'lattices', 'furthermore', 'the', 'factors', 'that', 'determine', 'the', 'relations', 'between', 'the', 'critical', 'exponents', 'and', 'the', 'correlation', 'length', 'exponents', 'for', 'these', 'models', 'are', 'diverse', 'for', 'the', 'triangular', 'lattice', 'the', 'decisive', 'factor', 'is', 'the', 'spatial', 'dimension', 'while', 'for', 'the', 'sierpinski', 'fractal', 'lattices', 'it', 'is', 'the', 'hausdorff', 'dimension']] | [-0.1312672603460669, 0.23985701738856732, -0.09144883989711161, 0.09987805052951444, 0.03014678979816381, -0.17981960511242506, 0.0192241911237943, 0.3649758452156675, -0.2573844063095748, -0.17538201073475648, 0.08379279927394237, -0.34004580534237905, -0.1662318612681702, 0.18701340837724273, 0.03935636260430329, 0.17613385969489173, -0.015183114139654208, 0.05760704342101235, -0.08256502751028165, -0.2735435953945853, 0.3406152827607002, 0.01043421497088275, 0.34994431809755044, 0.09585415717592696, 0.05482730705407448, -0.03468348471506033, 0.056007527446490714, 0.03865651460073423, -0.1950271741193319, 0.10957003818475641, 0.229885092763152, 0.02294216419904842, 0.14813729602610692, -0.35484211188741027, -0.23698800566489808, 0.09392949295870494, 0.11369332784233847, 0.13644444419187493, 0.05323156303129508, -0.34795969726983456, 0.020924268267845037, -0.11978881852701306, -0.12276543669286184, -0.14048892752616665, 0.020972094337048476, -0.025279072876219288, -0.21529097805614583, 0.12242112466319668, 0.08391304449032759, 0.12401538471167442, 0.01630287759762723, -0.047595150285633284, 0.0010691511211916803, 0.1758805620818748, -0.06789294534901273, -0.04198303463927004, 0.08634823053434956, -0.11663638931058813, -0.20510371303498687, 0.40225006019027204, 0.02232104243594222, -0.17532442884503324, 0.16775104970438406, -0.17086132323311176, -0.13412393002654427, 0.05414127891126554, 0.11260554391192272, 0.032270527497166766, -0.09905161448114086, 0.09023745494196192, -0.03705829602258746, 0.17128937972011044, 0.047967098720255306, 0.12174930956680327, 0.1801645235507749, 0.09386401299561839, 0.07799487391021102, 0.22449706817787957, -0.04253515516902553, -0.23236090118589345, -0.271603198433877, -0.18853643945185466, -0.2858951281348709, 0.08661059357982595, -0.2144812227888906, -0.18129774998578796, 0.40178313535870985, 0.12977377521747258, 0.17999686077819205, 0.05518561204662546, 0.19217243209131993, 0.13189827891692402, 0.07669070858391933, 0.07860770336264977, 0.20494379776646382, 0.17457433107701945, 0.04835424783377675, -0.29780117838818115, 0.019057411706307904, 0.13506079812068492] |
1,802.03178 | Architectural Tactics for Big Data Cybersecurity Analytic Systems: A
Review | Context: Big Data Cybersecurity Analytics is aimed at protecting networks,
computers, and data from unauthorized access by analysing security event data
using big data tools and technologies. Whilst a plethora of Big Data
Cybersecurity Analytic Systems have been reported in the literature, there is a
lack of a systematic and comprehensive review of the literature from an
architectural perspective. Objective: This paper reports a systematic review
aimed at identifying the most frequently reported quality attributes and
architectural tactics for Big Data Cybersecurity Analytic Systems. Method: We
used Systematic Literature Review (SLR) method for reviewing 74 primary studies
selected using well-defined criteria. Results: Our findings are twofold: (i)
identification of 12 most frequently reported quality attributes and the
justification for their significance for Big Data Cybersecurity Analytic
Systems; and (ii) identification and codification of 17 architectural tactics
for addressing the quality attributes that are commonly associated with Big
Data Cybersecurity Analytic systems. The identified tactics include six
performance tactics, four accuracy tactics, two scalability tactics, three
reliability tactics, and one security and usability tactic each. Conclusion:
Our findings have revealed that (a) despite the significance of
interoperability, modifiability, adaptability, generality, stealthiness, and
privacy assurance, these quality attributes lack explicit architectural support
in the literature (b) empirical investigation is required to evaluate the
impact of codified architectural tactics (c) a good deal of research effort
should be invested to explore the trade-offs and dependencies among the
identified tactics and (d) there is a general lack of effective collaboration
between academia and industry for supporting the field of Big Data
Cybersecurity Analytic Systems.
| cs.CR cs.SE | context big data cybersecurity analytics is aimed at protecting networks computers and data from unauthorized access by analysing security event data using big data tools and technologies whilst a plethora of big data cybersecurity analytic systems have been reported in the literature there is a lack of a systematic and comprehensive review of the literature from an architectural perspective objective this paper reports a systematic review aimed at identifying the most frequently reported quality attributes and architectural tactics for big data cybersecurity analytic systems method we used systematic literature review slr method for reviewing 74 primary studies selected using welldefined criteria results our findings are twofold i identification of 12 most frequently reported quality attributes and the justification for their significance for big data cybersecurity analytic systems and ii identification and codification of 17 architectural tactics for addressing the quality attributes that are commonly associated with big data cybersecurity analytic systems the identified tactics include six performance tactics four accuracy tactics two scalability tactics three reliability tactics and one security and usability tactic each conclusion our findings have revealed that a despite the significance of interoperability modifiability adaptability generality stealthiness and privacy assurance these quality attributes lack explicit architectural support in the literature b empirical investigation is required to evaluate the impact of codified architectural tactics c a good deal of research effort should be invested to explore the tradeoffs and dependencies among the identified tactics and d there is a general lack of effective collaboration between academia and industry for supporting the field of big data cybersecurity analytic systems | [['context', 'big', 'data', 'cybersecurity', 'analytics', 'is', 'aimed', 'at', 'protecting', 'networks', 'computers', 'and', 'data', 'from', 'unauthorized', 'access', 'by', 'analysing', 'security', 'event', 'data', 'using', 'big', 'data', 'tools', 'and', 'technologies', 'whilst', 'a', 'plethora', 'of', 'big', 'data', 'cybersecurity', 'analytic', 'systems', 'have', 'been', 'reported', 'in', 'the', 'literature', 'there', 'is', 'a', 'lack', 'of', 'a', 'systematic', 'and', 'comprehensive', 'review', 'of', 'the', 'literature', 'from', 'an', 'architectural', 'perspective', 'objective', 'this', 'paper', 'reports', 'a', 'systematic', 'review', 'aimed', 'at', 'identifying', 'the', 'most', 'frequently', 'reported', 'quality', 'attributes', 'and', 'architectural', 'tactics', 'for', 'big', 'data', 'cybersecurity', 'analytic', 'systems', 'method', 'we', 'used', 'systematic', 'literature', 'review', 'slr', 'method', 'for', 'reviewing', '74', 'primary', 'studies', 'selected', 'using', 'welldefined', 'criteria', 'results', 'our', 'findings', 'are', 'twofold', 'i', 'identification', 'of', '12', 'most', 'frequently', 'reported', 'quality', 'attributes', 'and', 'the', 'justification', 'for', 'their', 'significance', 'for', 'big', 'data', 'cybersecurity', 'analytic', 'systems', 'and', 'ii', 'identification', 'and', 'codification', 'of', '17', 'architectural', 'tactics', 'for', 'addressing', 'the', 'quality', 'attributes', 'that', 'are', 'commonly', 'associated', 'with', 'big', 'data', 'cybersecurity', 'analytic', 'systems', 'the', 'identified', 'tactics', 'include', 'six', 'performance', 'tactics', 'four', 'accuracy', 'tactics', 'two', 'scalability', 'tactics', 'three', 'reliability', 'tactics', 'and', 'one', 'security', 'and', 'usability', 'tactic', 'each', 'conclusion', 'our', 'findings', 'have', 'revealed', 'that', 'a', 'despite', 'the', 'significance', 'of', 'interoperability', 'modifiability', 'adaptability', 'generality', 'stealthiness', 'and', 'privacy', 'assurance', 'these', 'quality', 'attributes', 'lack', 'explicit', 'architectural', 'support', 'in', 'the', 'literature', 'b', 'empirical', 'investigation', 'is', 'required', 'to', 'evaluate', 'the', 'impact', 'of', 'codified', 'architectural', 'tactics', 'c', 'a', 'good', 'deal', 'of', 'research', 'effort', 'should', 'be', 'invested', 'to', 'explore', 'the', 'tradeoffs', 'and', 'dependencies', 'among', 'the', 'identified', 'tactics', 'and', 'd', 'there', 'is', 'a', 'general', 'lack', 'of', 'effective', 'collaboration', 'between', 'academia', 'and', 'industry', 'for', 'supporting', 'the', 'field', 'of', 'big', 'data', 'cybersecurity', 'analytic', 'systems']] | [-0.1288828892375862, -0.04795648513777101, -0.04991128744844061, 0.10635832531619459, -0.14112784734461456, -0.1467543293023482, 0.0975712132152134, 0.3780064032592166, -0.17988172738741223, -0.37593351163041705, 0.138395112323521, -0.3230766973619421, -0.13059407039903678, 0.1932142367443213, -0.12950924527114974, 0.1202333524720206, 0.0840819285931782, -0.04396713096827555, -0.015390888702733299, -0.276343441564733, 0.33046693535467897, 0.048167719256777604, 0.3726514348796067, 0.0604470926659325, 5.798188145630635e-05, -0.03944620775666688, -0.12103171435256417, -0.012081803592781607, -0.10627368075998114, 0.1918983187777205, 0.3806002666296151, 0.2712920231789422, 0.3693935056360295, -0.3981776263743926, -0.17262908121226175, 0.05506785683190593, 0.13215763866543195, 0.06365855618216582, -0.09652827833062755, -0.32346423669145086, 0.10048319301567972, -0.19915414195901787, -0.1145806779870047, -0.13017568377813754, 0.02431358194421941, 0.0002166677830525889, -0.19319298213276154, -0.025026236231497023, 0.028046332329260903, 0.19977744799107314, -0.03551296119381172, -0.15399440616825955, -0.01013233778783335, 0.19320103900256352, 0.09291315394310425, 0.01828978708363138, 0.125617378575799, -0.1448201287275599, -0.18678068436073283, 0.3632520166082451, 0.03985175086149516, -0.11843244034008911, 0.22810858557976854, -0.04346483536333275, -0.23013449570414826, 0.08320799011271447, 0.19313781940279742, 0.0032383363398436745, -0.229367313036122, 0.05210302010953176, 0.09078009101123406, 0.18156228521480583, 0.045919500683577585, 0.048960901379289753, 0.18882111998794313, 0.22904253975273325, -0.02872868849036212, 0.062351124139520556, -0.02313416816424041, -0.0874243963867999, -0.25905534498608457, -0.14633725739348358, -0.10941717779586235, -0.02556670462900701, -0.08218668503972228, -0.10317496957902152, 0.37082303223612073, 0.21109368909651843, 0.14664568069319311, 0.021393989675561897, 0.3630587152733754, -0.0001378069809736469, 0.08312074707544245, 0.0560698387463792, 0.21659619690975748, 0.008244563741251253, 0.1621072560083121, -0.13622477727118307, 0.1197420708118723, -0.02831148037400383] |
1,802.03179 | Time-reversal symmetry breaking Abelian chiral spin liquid in Mott
phases of three-component fermions on the triangular lattice | We provide numerical evidence in favor of spontaneous chiral symmetry
breaking and the concomitant appearance of an Abelian chiral spin liquid for
three-component fermions on the triangular lattice described by an SU(3)
symmetric Hubbard model with hopping amplitude $-t$ ($t>0$) and on-site
interaction $U$. This chiral phase is stabilized in the Mott phase with one
particle per site in the presence of a uniform $\pi$-flux per plaquette, and in
the Mott phase with two particles per site without any flux. Our approach
relies on effective spin models derived in the strong-coupling limit in powers
of $t/U$ for general SU$(N)$ and arbitrary uniform charge flux per plaquette,
which are subsequently studied using exact diagonalizations and variational
Monte Carlo simulations for $N=3$, as well as exact diagonalizations of the
SU($3$) Hubbard model on small clusters. Up to third order in $t/U$, and for
the time-reversal symmetric cases (flux $0$ or $\pi$), the low-energy
description is given by the $J$-$K$ model with Heisenberg coupling $J$ and real
ring exchange $K$. The phase diagram in the full $J$-$K$ parameter range
contains, apart from three already known, magnetically long-range ordered
phases, two previously unreported phases: i) a lattice nematic phase breaking
the lattice rotation symmetry and ii) a spontaneous time-reversal and parity
symmetry breaking Abelian chiral spin liquid. For the Hubbard model, an
investigation that includes higher-order itinerancy effects supports the
presence of a phase transition inside the insulating region, occurring at
$(t/U)_{\rm c}\approx 0.07$ [$(U/t)_{\rm c} \approx 13$] between the
three-sublattice magnetically ordered phase at small $t/U$ and this Abelian
chiral spin liquid.
| cond-mat.str-el | we provide numerical evidence in favor of spontaneous chiral symmetry breaking and the concomitant appearance of an abelian chiral spin liquid for threecomponent fermions on the triangular lattice described by an su3 symmetric hubbard model with hopping amplitude t t0 and onsite interaction u this chiral phase is stabilized in the mott phase with one particle per site in the presence of a uniform piflux per plaquette and in the mott phase with two particles per site without any flux our approach relies on effective spin models derived in the strongcoupling limit in powers of tu for general sun and arbitrary uniform charge flux per plaquette which are subsequently studied using exact diagonalizations and variational monte carlo simulations for n3 as well as exact diagonalizations of the su3 hubbard model on small clusters up to third order in tu and for the timereversal symmetric cases flux 0 or pi the lowenergy description is given by the jk model with heisenberg coupling j and real ring exchange k the phase diagram in the full jk parameter range contains apart from three already known magnetically longrange ordered phases two previously unreported phases i a lattice nematic phase breaking the lattice rotation symmetry and ii a spontaneous timereversal and parity symmetry breaking abelian chiral spin liquid for the hubbard model an investigation that includes higherorder itinerancy effects supports the presence of a phase transition inside the insulating region occurring at tu_rm capprox 007 ut_rm c approx 13 between the threesublattice magnetically ordered phase at small tu and this abelian chiral spin liquid | [['we', 'provide', 'numerical', 'evidence', 'in', 'favor', 'of', 'spontaneous', 'chiral', 'symmetry', 'breaking', 'and', 'the', 'concomitant', 'appearance', 'of', 'an', 'abelian', 'chiral', 'spin', 'liquid', 'for', 'threecomponent', 'fermions', 'on', 'the', 'triangular', 'lattice', 'described', 'by', 'an', 'su3', 'symmetric', 'hubbard', 'model', 'with', 'hopping', 'amplitude', 't', 't0', 'and', 'onsite', 'interaction', 'u', 'this', 'chiral', 'phase', 'is', 'stabilized', 'in', 'the', 'mott', 'phase', 'with', 'one', 'particle', 'per', 'site', 'in', 'the', 'presence', 'of', 'a', 'uniform', 'piflux', 'per', 'plaquette', 'and', 'in', 'the', 'mott', 'phase', 'with', 'two', 'particles', 'per', 'site', 'without', 'any', 'flux', 'our', 'approach', 'relies', 'on', 'effective', 'spin', 'models', 'derived', 'in', 'the', 'strongcoupling', 'limit', 'in', 'powers', 'of', 'tu', 'for', 'general', 'sun', 'and', 'arbitrary', 'uniform', 'charge', 'flux', 'per', 'plaquette', 'which', 'are', 'subsequently', 'studied', 'using', 'exact', 'diagonalizations', 'and', 'variational', 'monte', 'carlo', 'simulations', 'for', 'n3', 'as', 'well', 'as', 'exact', 'diagonalizations', 'of', 'the', 'su3', 'hubbard', 'model', 'on', 'small', 'clusters', 'up', 'to', 'third', 'order', 'in', 'tu', 'and', 'for', 'the', 'timereversal', 'symmetric', 'cases', 'flux', '0', 'or', 'pi', 'the', 'lowenergy', 'description', 'is', 'given', 'by', 'the', 'jk', 'model', 'with', 'heisenberg', 'coupling', 'j', 'and', 'real', 'ring', 'exchange', 'k', 'the', 'phase', 'diagram', 'in', 'the', 'full', 'jk', 'parameter', 'range', 'contains', 'apart', 'from', 'three', 'already', 'known', 'magnetically', 'longrange', 'ordered', 'phases', 'two', 'previously', 'unreported', 'phases', 'i', 'a', 'lattice', 'nematic', 'phase', 'breaking', 'the', 'lattice', 'rotation', 'symmetry', 'and', 'ii', 'a', 'spontaneous', 'timereversal', 'and', 'parity', 'symmetry', 'breaking', 'abelian', 'chiral', 'spin', 'liquid', 'for', 'the', 'hubbard', 'model', 'an', 'investigation', 'that', 'includes', 'higherorder', 'itinerancy', 'effects', 'supports', 'the', 'presence', 'of', 'a', 'phase', 'transition', 'inside', 'the', 'insulating', 'region', 'occurring', 'at', 'tu_rm', 'capprox', '007', 'ut_rm', 'c', 'approx', '13', 'between', 'the', 'threesublattice', 'magnetically', 'ordered', 'phase', 'at', 'small', 'tu', 'and', 'this', 'abelian', 'chiral', 'spin', 'liquid']] | [-0.18739678413726765, 0.2853956523206758, 0.0068809541578246265, 0.03992782435506756, -0.020407204167439026, -0.16984173667830949, 0.09123844990202368, 0.38133332975469675, -0.2034967284185761, -0.27078328791331746, 0.05452576829283589, -0.30080988907512524, -0.0745658563180004, 0.058265979044367686, 0.08839833714574818, -0.022940694073628243, -0.06737393657278255, 0.015555638235704683, -0.14392403026241882, -0.21360170502480164, 0.24370995428275447, -0.04216632697593551, 0.2604430801909397, 0.06468679795969379, 0.04048211593090299, 0.049019466011136305, 0.08644300453267006, -0.034795620904892334, -0.15966894561239697, -0.0029930357849823333, 0.1993193653708892, -0.12066862122109862, 0.1106857430558572, -0.432574293021736, -0.18921174276221528, 0.06121885931755304, 0.12877495181728663, 0.160320273533025, -0.0575598867158025, -0.33126663808721746, 0.011205906490523528, -0.2371752383006222, -0.17722842728190036, -0.10811173382979829, 0.022921115585787636, -0.038311646180748324, -0.29659720927527616, 0.14372256048626614, 0.07200954000806212, 0.13092570295484904, -0.05316494901008643, -0.13428588843667075, -0.10700810534366795, 0.05458248050358864, 0.03954820747619517, 0.10047044609591785, 0.06875251630159884, -0.13632889010692975, -0.13906829436273396, 0.3962692350705411, -0.05021242275227093, -0.1221950611404002, 0.15132973214578796, -0.16522316861155276, -0.1342282086820976, 0.20073712181699904, 0.06428871937603454, 0.08084542759248428, -0.08576318086940317, 0.12378415338297448, -0.044338283304565365, 0.19281141672705587, -0.013277757972667305, 0.02086796936445873, 0.25277458735767044, 0.15871671230282186, 0.04595383344698745, 0.1528545614161641, -0.12223448048048817, -0.18579673984519238, -0.3179486792376953, -0.09673288532855272, -0.231827994924517, 0.03841312463324633, -0.12062794113736001, -0.1580063199120708, 0.374906378834425, 0.1077897016009758, 0.15442786487870294, -0.033457574955050036, 0.20847198616483173, 0.0823326422121731, 0.03929424117063807, 0.0366545642385484, 0.19978664557953232, 0.1762114373735127, 0.07144908511631574, -0.2923935617262258, -0.028908908530229028, 0.14696292224582938] |
1,802.0318 | In a One-Bit Rush: Low-Latency Wireless Spectrum Monitoring with Binary
Sensor Arrays | Detecting the presence of a random wireless source with minimum latency
utilizing an array of radio sensors is considered. The problem is studied under
the constraint that the analog-to-digital conversion at each sensor is
restricted to reading the sign of the analog received signal. We formulate the
resulting digital signal processing task as a sequential hypothesis test in
simple form. To circumvent the intractable probabilistic model of the
multivariate binary array data, a reduced model representation within the
exponential family in conjunction with a log-likelihood ratio approximation is
employed. This approach allows us to design a likelihood-based sequential test
and to analyze its analytic performance along Wald's classical arguments. In
the context of wireless spectrum monitoring for satellite-based navigation and
synchronization systems, we study the achievable processing latency,
characterized by the average sample number, as a function of the binary sensors
in use. The practical feasibility and potential of the discussed low-complexity
sensing and decision-making technology is demonstrated via simulations.
| eess.SP cs.IT math.IT | detecting the presence of a random wireless source with minimum latency utilizing an array of radio sensors is considered the problem is studied under the constraint that the analogtodigital conversion at each sensor is restricted to reading the sign of the analog received signal we formulate the resulting digital signal processing task as a sequential hypothesis test in simple form to circumvent the intractable probabilistic model of the multivariate binary array data a reduced model representation within the exponential family in conjunction with a loglikelihood ratio approximation is employed this approach allows us to design a likelihoodbased sequential test and to analyze its analytic performance along walds classical arguments in the context of wireless spectrum monitoring for satellitebased navigation and synchronization systems we study the achievable processing latency characterized by the average sample number as a function of the binary sensors in use the practical feasibility and potential of the discussed lowcomplexity sensing and decisionmaking technology is demonstrated via simulations | [['detecting', 'the', 'presence', 'of', 'a', 'random', 'wireless', 'source', 'with', 'minimum', 'latency', 'utilizing', 'an', 'array', 'of', 'radio', 'sensors', 'is', 'considered', 'the', 'problem', 'is', 'studied', 'under', 'the', 'constraint', 'that', 'the', 'analogtodigital', 'conversion', 'at', 'each', 'sensor', 'is', 'restricted', 'to', 'reading', 'the', 'sign', 'of', 'the', 'analog', 'received', 'signal', 'we', 'formulate', 'the', 'resulting', 'digital', 'signal', 'processing', 'task', 'as', 'a', 'sequential', 'hypothesis', 'test', 'in', 'simple', 'form', 'to', 'circumvent', 'the', 'intractable', 'probabilistic', 'model', 'of', 'the', 'multivariate', 'binary', 'array', 'data', 'a', 'reduced', 'model', 'representation', 'within', 'the', 'exponential', 'family', 'in', 'conjunction', 'with', 'a', 'loglikelihood', 'ratio', 'approximation', 'is', 'employed', 'this', 'approach', 'allows', 'us', 'to', 'design', 'a', 'likelihoodbased', 'sequential', 'test', 'and', 'to', 'analyze', 'its', 'analytic', 'performance', 'along', 'walds', 'classical', 'arguments', 'in', 'the', 'context', 'of', 'wireless', 'spectrum', 'monitoring', 'for', 'satellitebased', 'navigation', 'and', 'synchronization', 'systems', 'we', 'study', 'the', 'achievable', 'processing', 'latency', 'characterized', 'by', 'the', 'average', 'sample', 'number', 'as', 'a', 'function', 'of', 'the', 'binary', 'sensors', 'in', 'use', 'the', 'practical', 'feasibility', 'and', 'potential', 'of', 'the', 'discussed', 'lowcomplexity', 'sensing', 'and', 'decisionmaking', 'technology', 'is', 'demonstrated', 'via', 'simulations']] | [-0.1741265209224366, 0.00483002923656386, -0.03991791684529744, 0.046143379807472226, -0.07579110527731245, -0.16859489823982585, 0.09100936285540229, 0.37812168456439393, -0.2713428514543921, -0.3157145530334674, 0.12568223844646126, -0.22862673475910925, -0.16224427925772034, 0.19869987850288454, -0.09737467516242759, 0.11561170029417553, 0.06371440974035067, 0.03405220480490243, -0.061715987052593846, -0.2062628279119963, 0.21050026830635032, 0.13322085976833478, 0.3439090310552274, -0.02595131120797305, 0.11755549546287511, 0.068205353472149, -0.03630093404790387, -0.015404673398006708, -0.06952603062986781, 0.12443700762742083, 0.2907686948776245, 0.20396221366245298, 0.28818962904042567, -0.4090601648376378, -0.21948340031376573, 0.13092839510063642, 0.11937044537298788, 0.06400268322904594, -0.07731147485028486, -0.2702785899644368, 0.1007198490173323, -0.20315154629352036, -0.07890526814444457, -0.01398834879291826, -0.02685755132115446, 0.014650143073231448, -0.31273493593907914, 0.04075370533391833, 0.01133264346717624, 0.0372717082966119, -0.04042875999366515, -0.06808449082018342, 0.08007059399678837, 0.10970366515321076, 0.014525751685141586, 0.005203754334070254, 0.13315203723032026, -0.12609076762164478, -0.14117142542090733, 0.3716219485326292, -0.0334925498929806, -0.2097349828822189, 0.1636476843210403, -0.07623267731105443, -0.14105758770892862, 0.11754829144701943, 0.22963952829595655, 0.08041791615396505, -0.20491753689202596, 0.07166653164094897, 0.009051230494515039, 0.1794006658870785, 0.0788532407808816, 0.048056814828305504, 0.20185931822088604, 0.2208020255100564, 0.07596900119096972, 0.20268020636285655, -0.152281411943477, -0.09448229089175583, -0.2420408294245135, -0.12605788777582347, -0.2395378003238875, 0.025932378962170332, -0.09906198614444292, -0.13754799370071852, 0.3605373364742263, 0.16762826227895858, 0.14735358910984359, 0.09062712610320886, 0.3751961345318705, 0.13497661314177095, 0.04993911218189169, 0.0388216159617059, 0.194616170916197, 0.1494593143041129, 0.11438099041988607, -0.2168646266698488, 0.07821131078671897, 0.017591996835835743] |
1,802.03181 | Storage of RF photons in minimal conditions | We investigate the minimal conditions to store coherently a RF pulse in a
material medium. We choose a commercial quartz as memory support because it is
a widely available component with a high Q-factor. Pulse storage is obtained by
varying dynamically the light-matter coupling with an analog switch. This
parametric driving of the quartz dynamics can be alternatively interpreted as a
stopped light experiment. We obtain an efficiency of 26%, a storage time of
209$\mu$s and a time-to-bandwidth product of 98 by optimizing the pulse
temporal shape. The coherent character of the storage is demonstrated. Our goal
is to connect different types of memories in the RF and optical domain for
quantum information processing. Our motivation is essentially fundamental.
| physics.class-ph physics.atom-ph quant-ph | we investigate the minimal conditions to store coherently a rf pulse in a material medium we choose a commercial quartz as memory support because it is a widely available component with a high qfactor pulse storage is obtained by varying dynamically the lightmatter coupling with an analog switch this parametric driving of the quartz dynamics can be alternatively interpreted as a stopped light experiment we obtain an efficiency of 26 a storage time of 209mus and a timetobandwidth product of 98 by optimizing the pulse temporal shape the coherent character of the storage is demonstrated our goal is to connect different types of memories in the rf and optical domain for quantum information processing our motivation is essentially fundamental | [['we', 'investigate', 'the', 'minimal', 'conditions', 'to', 'store', 'coherently', 'a', 'rf', 'pulse', 'in', 'a', 'material', 'medium', 'we', 'choose', 'a', 'commercial', 'quartz', 'as', 'memory', 'support', 'because', 'it', 'is', 'a', 'widely', 'available', 'component', 'with', 'a', 'high', 'qfactor', 'pulse', 'storage', 'is', 'obtained', 'by', 'varying', 'dynamically', 'the', 'lightmatter', 'coupling', 'with', 'an', 'analog', 'switch', 'this', 'parametric', 'driving', 'of', 'the', 'quartz', 'dynamics', 'can', 'be', 'alternatively', 'interpreted', 'as', 'a', 'stopped', 'light', 'experiment', 'we', 'obtain', 'an', 'efficiency', 'of', '26', 'a', 'storage', 'time', 'of', '209mus', 'and', 'a', 'timetobandwidth', 'product', 'of', '98', 'by', 'optimizing', 'the', 'pulse', 'temporal', 'shape', 'the', 'coherent', 'character', 'of', 'the', 'storage', 'is', 'demonstrated', 'our', 'goal', 'is', 'to', 'connect', 'different', 'types', 'of', 'memories', 'in', 'the', 'rf', 'and', 'optical', 'domain', 'for', 'quantum', 'information', 'processing', 'our', 'motivation', 'is', 'essentially', 'fundamental']] | [-0.15014205417887402, 0.16343962050139563, -0.07400393459754877, -0.010429865266713832, -0.06588670658942662, -0.14876675577913848, 0.05743694972270765, 0.4368059495563468, -0.297224869665045, -0.30838798847781795, 0.11836409018152098, -0.2247222113188229, -0.06507938924747017, 0.22852794819662714, -0.06326396212093213, 0.0490173594150533, 0.03921753812071859, 0.03537809754857141, 0.0047938470682925265, -0.18377516814706546, 0.22606078890335357, 0.08823120204282081, 0.33216817061711323, 0.03708474824412002, 0.1208808612333149, -0.010668084614424624, 0.014735106303173507, -0.06113229332985277, -0.05623912117165378, 0.1318741587516016, 0.26064294612415245, 0.10643182836600348, 0.2687725896358044, -0.45759665359480256, -0.24205188364045233, 0.07393868863741812, 0.11207401441956441, 0.11762095632779802, -0.08140725755574515, -0.23941380589499942, 0.05816562169303115, -0.17839915617408916, -0.11448350983361404, -0.051203810394956514, 0.015362273161418928, 0.05881225995910473, -0.28216652167785883, -0.03130703850482137, 0.04871544605280217, 0.03899066943504139, -0.04384112443663498, -0.02798603342957476, 0.023007834320251122, 0.10479529734509878, -0.044378307331592225, 0.030701422107676603, 0.1656954877683495, -0.12412946126383977, -0.1083331079954584, 0.3835237529521816, -0.07948910378707716, -0.1565946750342846, 0.15977632461322677, -0.08510322779870759, -0.024354318496631857, 0.12038739046288861, 0.15994069878007963, 0.09094763438577533, -0.16835176429719242, 0.022797024119287156, 0.0027465023753097933, 0.2573583699508101, 0.10245014711195587, 0.09274649199148223, 0.21282977731818828, 0.2257722579062176, 0.029605793105995554, 0.22069733155170917, -0.0771459840097799, -0.04124437099020196, -0.25565419080229396, -0.16572154002885023, -0.22072848750071394, 0.07648850218034707, -0.08274291437810773, -0.12563022774341714, 0.4141734285104988, 0.1030634942695371, 0.18265803371213823, -0.016706232373920094, 0.33682855234568954, 0.12035562876516427, 0.09109536849005093, 0.046474314151475064, 0.243179147111841, 0.1300182705705301, 0.13040980961945894, -0.23885793796477792, 0.04485809258966404, -0.03055887300775856] |
1,802.03182 | Single-molecule force spectroscopy with photoluminescent semiconducting
polymers: Harnessing entropy | We discuss implications of a recent experimental breakthrough which uses a
fluorescence-doped flexible semiconducting polymer to construct a
single-molecule sensor which can detect ultra-weak forces in the molecular
environment, with a grey scale down to 300 femtonewtons.
| cond-mat.soft cond-mat.mes-hall cond-mat.mtrl-sci physics.chem-ph | we discuss implications of a recent experimental breakthrough which uses a fluorescencedoped flexible semiconducting polymer to construct a singlemolecule sensor which can detect ultraweak forces in the molecular environment with a grey scale down to 300 femtonewtons | [['we', 'discuss', 'implications', 'of', 'a', 'recent', 'experimental', 'breakthrough', 'which', 'uses', 'a', 'fluorescencedoped', 'flexible', 'semiconducting', 'polymer', 'to', 'construct', 'a', 'singlemolecule', 'sensor', 'which', 'can', 'detect', 'ultraweak', 'forces', 'in', 'the', 'molecular', 'environment', 'with', 'a', 'grey', 'scale', 'down', 'to', '300', 'femtonewtons']] | [-0.0923314816659383, 0.12829237061419657, -0.10094910889331783, -0.011281072058981018, -0.10206423545522349, -0.16294130523955183, 0.04149532212343599, 0.39904854467936923, -0.2786607405969075, -0.3168449927653585, 0.04584013782109001, -0.21887993000979936, -0.15485331102141311, 0.15688486362674406, -0.034581122201468265, 0.05808886193803379, 0.020708592808140174, -0.05092662993286337, -0.03218455619311759, -0.11001763635181955, 0.16579919888504913, 0.05053349339536258, 0.2363451240318162, 0.1442480279398816, 0.17676081934145518, -0.05170076299857881, 0.02482170170572187, 0.017029709475381034, -0.14402430717434203, 0.20138530635407992, 0.2725445467978716, -0.03685659891260522, 0.28046706531729015, -0.5071869994912829, -0.2593385174870491, 0.08850362082677228, 0.11607899753642933, 0.18118506044016353, -0.09178369254139918, -0.30171834294285094, 0.09545500149418201, -0.18887153381614813, -0.15014842088733402, -0.06760243078294609, 0.03185304730598416, 0.04718301956142698, -0.26778697751994646, 0.02374726132755833, -0.031039232201874257, 0.01470646353471758, -0.01049473128680672, -0.06297067608684301, 0.0654319637322, 0.06872074199574334, -0.02982048291180815, 0.05746592554662909, 0.28318290836842996, -0.11351619511842728, -0.12806030796574694, 0.3855084090360573, -0.08922685445618948, -0.13449425771832466, 0.2575740032430206, -0.0772552415728569, -0.15741776544600725, 0.13411263136991433, 0.16667690968939236, 0.10919996305767979, -0.17972725821392876, 0.04607247984302895, -0.014382439692105566, 0.22984632264290536, 0.027796215430966446, 0.01644694222403424, 0.24334478969020504, 0.26729792132973673, 0.04128311555167394, 0.16809627804905175, -0.1730801251849958, -0.08000247459858656, -0.20990890434810094, -0.1931502384266683, -0.1617248497903347, 0.11807760406019432, -0.042211088498256034, -0.149644614223923, 0.3730340304119246, 0.21206716454720922, 0.24251006173768214, 0.04309998652897775, 0.27734213886516434, -0.015013547560998371, 0.10013346065367972, -0.010677952000073024, 0.26740132815071516, 0.12266627794929913, 0.1174405286354678, -0.17906670453292983, 0.02267967381714178, -0.03303577923881156] |
1,802.03183 | Optically transparent solid electrodes for precision Penning traps | We have conceived, built, and operated a cryogenic Penning trap with an
electrically conducting yet optically transparent solid electrode. The trap,
dedicated to spectroscopy and imaging of confined particles under large solid
angles is of 'half-open' design with one open endcap and one closed endcap that
mainly consists of a glass window coated with a highly transparent conductive
layer. This arrangement allows for trapping of externally or internally
produced particles, yields flexible access for optical excitation and efficient
light collection from the trapping region. At the same time, it is electrically
closed and ensures long-term ion confinement under well-defined conditions.
With its superior surface quality and its high as well as homogeneous optical
transmission, the window electrode is an excellent replacement for partially
transmissive electrodes that use holes, slits, metallic meshes and the like.
| physics.atom-ph | we have conceived built and operated a cryogenic penning trap with an electrically conducting yet optically transparent solid electrode the trap dedicated to spectroscopy and imaging of confined particles under large solid angles is of halfopen design with one open endcap and one closed endcap that mainly consists of a glass window coated with a highly transparent conductive layer this arrangement allows for trapping of externally or internally produced particles yields flexible access for optical excitation and efficient light collection from the trapping region at the same time it is electrically closed and ensures longterm ion confinement under welldefined conditions with its superior surface quality and its high as well as homogeneous optical transmission the window electrode is an excellent replacement for partially transmissive electrodes that use holes slits metallic meshes and the like | [['we', 'have', 'conceived', 'built', 'and', 'operated', 'a', 'cryogenic', 'penning', 'trap', 'with', 'an', 'electrically', 'conducting', 'yet', 'optically', 'transparent', 'solid', 'electrode', 'the', 'trap', 'dedicated', 'to', 'spectroscopy', 'and', 'imaging', 'of', 'confined', 'particles', 'under', 'large', 'solid', 'angles', 'is', 'of', 'halfopen', 'design', 'with', 'one', 'open', 'endcap', 'and', 'one', 'closed', 'endcap', 'that', 'mainly', 'consists', 'of', 'a', 'glass', 'window', 'coated', 'with', 'a', 'highly', 'transparent', 'conductive', 'layer', 'this', 'arrangement', 'allows', 'for', 'trapping', 'of', 'externally', 'or', 'internally', 'produced', 'particles', 'yields', 'flexible', 'access', 'for', 'optical', 'excitation', 'and', 'efficient', 'light', 'collection', 'from', 'the', 'trapping', 'region', 'at', 'the', 'same', 'time', 'it', 'is', 'electrically', 'closed', 'and', 'ensures', 'longterm', 'ion', 'confinement', 'under', 'welldefined', 'conditions', 'with', 'its', 'superior', 'surface', 'quality', 'and', 'its', 'high', 'as', 'well', 'as', 'homogeneous', 'optical', 'transmission', 'the', 'window', 'electrode', 'is', 'an', 'excellent', 'replacement', 'for', 'partially', 'transmissive', 'electrodes', 'that', 'use', 'holes', 'slits', 'metallic', 'meshes', 'and', 'the', 'like']] | [-0.09308260888445066, 0.213155185072483, -0.027491573153981076, -0.053571092470465646, -0.02608563635609488, -0.2558012557521796, 0.030610731236442035, 0.4734921579374306, -0.20641644855738797, -0.2906626791110325, 0.08855086680390496, -0.2739654330541284, -0.006496471577018166, 0.19651693950664365, -0.03958775147594991, 0.0663103287848544, 0.06066683098263761, -0.06707147263171179, -0.0024890028993223806, -0.14790474179412808, 0.23224960789153937, 0.10022760719867117, 0.31935820164708, 0.07023293306658378, 0.14159315122541652, 0.030072200178071412, 0.06348292489706386, 0.026626358931161352, -0.10283291356261462, 0.09896137453997925, 0.24727454910805421, -0.025256117256775276, 0.19275443996789296, -0.5085526737314996, -0.17845496331921903, 0.018119998769695635, 0.14849501583419406, 0.0821179346417758, -0.14833996943267647, -0.2593701521956376, 0.02606653620370789, -0.1257087171595516, -0.19542355511559925, -0.04139121126300141, 0.0012202639560173474, 0.01887553285306959, -0.29191444609870215, -0.02351560147910087, 0.03439740929014133, 0.07410526187367626, -0.08890405307921803, -0.06442262221878367, 0.006985409875094557, 0.0957711636572694, -0.059029615412938836, 0.019441121360356573, 0.2347493391143464, -0.08622609277528627, -0.014958328348514972, 0.34935866413054184, -0.0564297000293745, -0.16968661577287894, 0.24235080720495378, -0.1693293156811217, 0.027155602096281112, 0.21022133326328207, 0.12373789139230972, 0.1367085804109837, -0.19767154213875088, 0.03663601299813851, -0.03193208979748523, 0.16502393303416107, 0.14866213739411765, 0.06672780106090437, 0.2953249707734629, 0.2704050988623518, 0.07831331074355977, 0.20970765277910577, -0.1249805653863934, -0.014673088107313683, -0.2531458774975539, -0.19380259653336174, -0.1662803777100852, 0.017480468300150345, -0.044929911155855706, -0.22636894198349997, 0.3523897662786628, 0.03899699171532446, 0.12611308197296267, -0.054938148165472656, 0.35552852185336725, 0.006443339224501666, 0.11253245795013578, 0.0562631188850127, 0.25685110330970873, 0.14036482983066156, 0.1336916593014638, -0.19310367471927695, 0.03588305935680644, -0.02748894328668491] |
1,802.03184 | Self-Bounded Prediction Suffix Tree via Approximate String Matching | Prediction suffix trees (PST) provide an effective tool for sequence
modelling and prediction. Current prediction techniques for PSTs rely on exact
matching between the suffix of the current sequence and the previously observed
sequence. We present a provably correct algorithm for learning a PST with
approximate suffix matching by relaxing the exact matching condition. We then
present a self-bounded enhancement of our algorithm where the depth of suffix
tree grows automatically in response to the model performance on a training
sequence. Through experiments on synthetic datasets as well as three real-world
datasets, we show that the approximate matching PST results in better
predictive performance than the other variants of PST.
| cs.LG stat.ML | prediction suffix trees pst provide an effective tool for sequence modelling and prediction current prediction techniques for psts rely on exact matching between the suffix of the current sequence and the previously observed sequence we present a provably correct algorithm for learning a pst with approximate suffix matching by relaxing the exact matching condition we then present a selfbounded enhancement of our algorithm where the depth of suffix tree grows automatically in response to the model performance on a training sequence through experiments on synthetic datasets as well as three realworld datasets we show that the approximate matching pst results in better predictive performance than the other variants of pst | [['prediction', 'suffix', 'trees', 'pst', 'provide', 'an', 'effective', 'tool', 'for', 'sequence', 'modelling', 'and', 'prediction', 'current', 'prediction', 'techniques', 'for', 'psts', 'rely', 'on', 'exact', 'matching', 'between', 'the', 'suffix', 'of', 'the', 'current', 'sequence', 'and', 'the', 'previously', 'observed', 'sequence', 'we', 'present', 'a', 'provably', 'correct', 'algorithm', 'for', 'learning', 'a', 'pst', 'with', 'approximate', 'suffix', 'matching', 'by', 'relaxing', 'the', 'exact', 'matching', 'condition', 'we', 'then', 'present', 'a', 'selfbounded', 'enhancement', 'of', 'our', 'algorithm', 'where', 'the', 'depth', 'of', 'suffix', 'tree', 'grows', 'automatically', 'in', 'response', 'to', 'the', 'model', 'performance', 'on', 'a', 'training', 'sequence', 'through', 'experiments', 'on', 'synthetic', 'datasets', 'as', 'well', 'as', 'three', 'realworld', 'datasets', 'we', 'show', 'that', 'the', 'approximate', 'matching', 'pst', 'results', 'in', 'better', 'predictive', 'performance', 'than', 'the', 'other', 'variants', 'of', 'pst']] | [-0.05480244350196286, 0.023902803381232927, -0.052337150104259225, 0.10804883211173795, -0.09500646595843136, -0.14884204872121864, 0.09343541905453259, 0.4568449746478688, -0.27774553073739466, -0.37242677622390064, 0.12002498719441726, -0.25857245886105706, -0.18588697288016026, 0.19580777229698884, -0.06615219817242839, 0.09966201600195332, 0.1695822807452218, 0.08103525128707671, -0.05164565938228572, -0.24678016657179053, 0.24661269199780442, 0.06422306327149271, 0.3464442348107696, 0.010420031727037647, 0.12247955288145353, 0.01484787669879469, -0.028171378776261753, -0.015355985120616176, -0.10006302646367905, 0.11427197756923058, 0.24398178061978384, 0.21655764690261672, 0.1915476251562888, -0.39797904601913286, -0.1618600276806815, 0.09914210359989242, 0.15001897007565607, 0.15371519288032273, -0.06526881254553286, -0.26369173258373685, 0.11382668982259929, -0.12472967866554178, 0.020003313482315703, -0.10152408708394929, -0.005035026219080795, -0.000419827433176, -0.3491019098088145, 0.02553602318697482, 0.0628547623975795, 0.01939449810676954, -0.029704875380478123, -0.16973230313848364, 0.03629997514018958, 0.13561042245816102, 0.02154245480619879, 0.06404109351675619, 0.056002851198850706, -0.1401641732229936, -0.2324758166150952, 0.3283003249120983, -0.12918597624745665, -0.2044897322881628, 0.152021130153232, -0.027092065700245173, -0.17728404922580177, 0.09685585751536895, 0.15422250581905245, 0.1318806486881592, -0.11844498775476082, 0.04132556876231154, -0.08039542657577178, 0.18604156614746897, 0.08559243058235469, 0.0014069877437908542, 0.15919352908280085, 0.290770002302121, 0.08981360892595892, 0.15884655806426468, -0.05578824562332805, -0.06362803779881109, -0.20435432894155384, -0.08363333982415497, -0.20628695935857566, -0.037669192808045246, -0.20849851294902197, -0.20663903563452715, 0.4074193411422047, 0.23148250599307094, 0.19418113671073858, 0.18837794635698876, 0.36099203648892314, 0.035214317567773504, 0.04726309205659411, 0.10794677036729726, 0.14399822495814243, 0.05105158685156229, 0.04571419917893681, -0.22669463749678637, 0.09017114673148502, 0.10141924231059173] |
1,802.03185 | On the detection of coronal dimmings and the extraction of their
characteristic properties | Coronal dimmings are distinct phenomena associated to coronal mass ejections
(CMEs). The study of coronal dimmings and the extraction of their
characteristic parameters helps us to obtain additional information of CMEs,
especially on the initiation and early evolution of Earth-directed CMEs. We
present a new approach to detect coronal dimming regions based on a
thresholding technique applied on logarithmic base-ratio images. Characteristic
dimming parameters describing the dynamics, morphology, magnetic properties and
the brightness of coronal dimming regions are extracted by cumulatively summing
newly dimmed pixels over time. It is also demonstrated how core dimming regions
are identified as a subset of the overall identified dimming region. We
successfully apply our method to two well-observed coronal dimming events. For
both events the core dimming regions are identified and the spatial evolution
of the dimming area reveals the expansion of the dimming region around these
footpoints. We also show that in the early impulsive phase of the dimming
expansion the total unsigned magnetic flux involved in the dimming regions is
balanced and that up to 30% of this flux results from the localized core
dimming regions. Furthermore, the onset in the profile of the area growth rate
is co-temporal with the start of the associated flares and in one case also
with the fast rise of the CME, indicating a strong relationship of coronal
dimmings with both flare and CMEs.
| astro-ph.SR | coronal dimmings are distinct phenomena associated to coronal mass ejections cmes the study of coronal dimmings and the extraction of their characteristic parameters helps us to obtain additional information of cmes especially on the initiation and early evolution of earthdirected cmes we present a new approach to detect coronal dimming regions based on a thresholding technique applied on logarithmic baseratio images characteristic dimming parameters describing the dynamics morphology magnetic properties and the brightness of coronal dimming regions are extracted by cumulatively summing newly dimmed pixels over time it is also demonstrated how core dimming regions are identified as a subset of the overall identified dimming region we successfully apply our method to two wellobserved coronal dimming events for both events the core dimming regions are identified and the spatial evolution of the dimming area reveals the expansion of the dimming region around these footpoints we also show that in the early impulsive phase of the dimming expansion the total unsigned magnetic flux involved in the dimming regions is balanced and that up to 30 of this flux results from the localized core dimming regions furthermore the onset in the profile of the area growth rate is cotemporal with the start of the associated flares and in one case also with the fast rise of the cme indicating a strong relationship of coronal dimmings with both flare and cmes | [['coronal', 'dimmings', 'are', 'distinct', 'phenomena', 'associated', 'to', 'coronal', 'mass', 'ejections', 'cmes', 'the', 'study', 'of', 'coronal', 'dimmings', 'and', 'the', 'extraction', 'of', 'their', 'characteristic', 'parameters', 'helps', 'us', 'to', 'obtain', 'additional', 'information', 'of', 'cmes', 'especially', 'on', 'the', 'initiation', 'and', 'early', 'evolution', 'of', 'earthdirected', 'cmes', 'we', 'present', 'a', 'new', 'approach', 'to', 'detect', 'coronal', 'dimming', 'regions', 'based', 'on', 'a', 'thresholding', 'technique', 'applied', 'on', 'logarithmic', 'baseratio', 'images', 'characteristic', 'dimming', 'parameters', 'describing', 'the', 'dynamics', 'morphology', 'magnetic', 'properties', 'and', 'the', 'brightness', 'of', 'coronal', 'dimming', 'regions', 'are', 'extracted', 'by', 'cumulatively', 'summing', 'newly', 'dimmed', 'pixels', 'over', 'time', 'it', 'is', 'also', 'demonstrated', 'how', 'core', 'dimming', 'regions', 'are', 'identified', 'as', 'a', 'subset', 'of', 'the', 'overall', 'identified', 'dimming', 'region', 'we', 'successfully', 'apply', 'our', 'method', 'to', 'two', 'wellobserved', 'coronal', 'dimming', 'events', 'for', 'both', 'events', 'the', 'core', 'dimming', 'regions', 'are', 'identified', 'and', 'the', 'spatial', 'evolution', 'of', 'the', 'dimming', 'area', 'reveals', 'the', 'expansion', 'of', 'the', 'dimming', 'region', 'around', 'these', 'footpoints', 'we', 'also', 'show', 'that', 'in', 'the', 'early', 'impulsive', 'phase', 'of', 'the', 'dimming', 'expansion', 'the', 'total', 'unsigned', 'magnetic', 'flux', 'involved', 'in', 'the', 'dimming', 'regions', 'is', 'balanced', 'and', 'that', 'up', 'to', '30', 'of', 'this', 'flux', 'results', 'from', 'the', 'localized', 'core', 'dimming', 'regions', 'furthermore', 'the', 'onset', 'in', 'the', 'profile', 'of', 'the', 'area', 'growth', 'rate', 'is', 'cotemporal', 'with', 'the', 'start', 'of', 'the', 'associated', 'flares', 'and', 'in', 'one', 'case', 'also', 'with', 'the', 'fast', 'rise', 'of', 'the', 'cme', 'indicating', 'a', 'strong', 'relationship', 'of', 'coronal', 'dimmings', 'with', 'both', 'flare', 'and', 'cmes']] | [-0.09670935253551668, 0.1665266177951387, -0.019383239116733033, 0.17556443029198188, -0.07543943463599039, -0.026680203569060118, 0.02636165835416162, 0.43105858030815153, -0.1738319847453796, -0.3776123883132925, 0.09121981146232541, -0.2637383411823062, -0.15194865985720168, 0.21207730233539018, -0.06666407456835896, -0.005010516514298034, 0.1011136782556641, -0.029650039504187813, -0.0675427669450017, -0.23442933030040844, 0.29032604129664963, 0.10777037921423166, 0.20256030276860829, -0.00022157742170050805, 0.0911239974081746, -0.13875967174120216, -0.09256782801206416, 0.014837355529356108, -0.10260457315592204, 0.04764737796842527, 0.16402452357835445, 0.14920185808049277, 0.23053361827072724, -0.39542590952704, -0.2880819017756812, -0.01861321474610118, 0.21446085582376512, -0.03217103874868824, -0.011356603264083494, -0.2852710411393613, 0.06319438568049722, -0.10430805090946117, -0.09551732766245583, 0.07230423442841946, 0.04512198080205141, -0.004331100091803819, -0.2709329377281344, 0.13693575950255843, 0.019693874273990743, 0.069203667696909, -0.11860053266074493, 0.021467823471611424, -0.04164359122535238, 0.13242469219150357, 0.11744740386165285, 0.0631643140628023, 0.19147574684750862, -0.10561002597175867, -0.07934174367887202, 0.3070668482061656, -0.00901820683966715, -0.00671679772321742, 0.19112693527939068, -0.23607877299798824, -0.12144884313066953, 0.24473750129514393, 0.17710483122241605, 0.08157571278807875, -0.12122235040663483, -0.05842845494082476, 0.00759430578294403, 0.12851849536099655, 0.08793044427721576, 0.018150832055040148, 0.2834578467089896, 0.09777289243427306, 0.041290794261259395, 0.16190179554839917, -0.27399990612400965, -0.05199185295629475, -0.3189231284287869, -0.10432897321059315, -0.060663219307454934, -0.001328975663803485, -0.13180496811920353, -0.24055911498021187, 0.46925646547301947, 0.15826807345062627, 0.2623327047346644, -0.041454022204593675, 0.25727600193611194, 0.07914956516098018, 0.09857228292164594, 0.15718636219492305, 0.27322973722042226, 0.1828629401838612, 0.18814602168020483, -0.2547350774574533, 0.08446889653358822, 0.10377139304785082] |
1,802.03186 | A simplification problem in manifold theory | Two smooth manifolds M and N are called R-diffeomorphic if their product with
the real line are diffeomorphic. We consider the following simplification
problem: does R-diffeomorphism imply diffeomorphism or homeomorphism? For
compact manifolds, analysis of this problem relies on some of the main
achievements of the theory of manifolds, in particular the h- and s-cobordism
theorems in high dimensions and the spectacular more recent classification
results in dimensions 3 and 4. This paper presents what is currently known
about the subject as well as some new results about classifications of
R-diffeomorphisms.
| math.GT | two smooth manifolds m and n are called rdiffeomorphic if their product with the real line are diffeomorphic we consider the following simplification problem does rdiffeomorphism imply diffeomorphism or homeomorphism for compact manifolds analysis of this problem relies on some of the main achievements of the theory of manifolds in particular the h and scobordism theorems in high dimensions and the spectacular more recent classification results in dimensions 3 and 4 this paper presents what is currently known about the subject as well as some new results about classifications of rdiffeomorphisms | [['two', 'smooth', 'manifolds', 'm', 'and', 'n', 'are', 'called', 'rdiffeomorphic', 'if', 'their', 'product', 'with', 'the', 'real', 'line', 'are', 'diffeomorphic', 'we', 'consider', 'the', 'following', 'simplification', 'problem', 'does', 'rdiffeomorphism', 'imply', 'diffeomorphism', 'or', 'homeomorphism', 'for', 'compact', 'manifolds', 'analysis', 'of', 'this', 'problem', 'relies', 'on', 'some', 'of', 'the', 'main', 'achievements', 'of', 'the', 'theory', 'of', 'manifolds', 'in', 'particular', 'the', 'h', 'and', 'scobordism', 'theorems', 'in', 'high', 'dimensions', 'and', 'the', 'spectacular', 'more', 'recent', 'classification', 'results', 'in', 'dimensions', '3', 'and', '4', 'this', 'paper', 'presents', 'what', 'is', 'currently', 'known', 'about', 'the', 'subject', 'as', 'well', 'as', 'some', 'new', 'results', 'about', 'classifications', 'of', 'rdiffeomorphisms']] | [-0.12925151360766243, 0.05832975537685508, -0.02331637068312954, 0.0514597568425498, -0.07211529253982008, -0.13706647374783643, -0.028850825646341862, 0.3573095293249935, -0.1973880298583853, -0.30772769199260935, 0.19153699403316501, -0.28659071678041736, -0.19488672972974283, 0.22827868442717855, -0.16954657611098478, 0.029631134186109357, 0.0734389463905245, 0.07923680686772885, -0.08730037702480331, -0.2915832654768813, 0.4324471882004714, -0.03798384428426454, 0.2114417939010309, 0.11852212285686453, 0.08049893719461662, -0.016322562616551295, -0.07217373347190335, 0.007131261264228008, -0.14315742437875914, 0.1477912667032797, 0.23536897313103758, 0.14074685046216473, 0.23337042636492036, -0.40208193814297294, -0.18336649841247973, 0.12448783016324425, 0.14394411104942925, 0.044013706808486444, -0.02719517829460859, -0.2606440575962717, 0.0999708699726563, -0.0865165935935114, -0.15416774261658164, -0.07090108760960655, 0.03801658839008517, 0.005740160842172124, -0.1811755707445131, 0.04579934716192921, 0.15919023326899728, 0.07751128988721492, -0.06910992257127707, -0.12945494491776283, 0.004159664240432903, 0.13109480874581178, 0.0697516277763167, 0.06704024270452051, 0.06534995341842825, -0.10716651545689357, -0.13859295002078975, 0.39571597503328865, -0.029328469324603, -0.21156373529414518, 0.22369680474300616, -0.14945665842440742, -0.21690154522234065, 0.10530103961090473, 0.1361239989346359, 0.16599869101562284, -0.08075269364582544, 0.11966983231567693, -0.07665324351877313, 0.1057730962479995, 0.06917657052293759, 0.023441566471857102, 0.13510976058155807, 0.154981082736578, 0.11670648945834149, 0.09495925673135472, -0.025407241511857137, -0.056789152783246456, -0.3386803782195784, -0.1690366510830989, -0.13425735778185877, 0.12928297276084777, -0.08882708888201953, -0.14458664995618165, 0.3550017900256948, 0.07477510654875501, 0.22514944729945538, 0.08291661369995298, 0.2619514756582, 0.032010942390611904, 0.011162622553952546, 0.08029930862407623, 0.1936751197400471, 0.1749146340880543, 0.05346175402254713, -0.08633521864645775, -0.02617281607473904, 0.08672881525920027] |
1,802.03187 | Noise-Induced Limitations to the Scalability of Distributed Integral
Control | We study performance limitations of distributed feedback control in
large-scale networked dynamical systems. Specifically, we address the question
of how the performance of distributed integral control is affected by
measurement noise. We consider second-order consensus-like problems modeled
over a toric lattice network, and study asymptotic scalings (in network size)
of H2 performance metrics that quantify the variance of nodal state
fluctuations. While previous studies have shown that distributed integral
control fundamentally improves these performance scalings compared to
distributed proportional feedback control, our results show that an explicit
inclusion of measurement noise leads to the opposite conclusion. The noise's
impact on performance is shown to decrease with an increased inter-nodal
alignment of the local integral states. However, even though the controller can
be tuned for acceptable performance for any given network size, performance
will degrade as the network grows, limiting the scalability of any such
controller tuning. In particular, the requirement for inter-nodal alignment
increases with network size. We show that this in practice implies that large
and sparse networks will require any integral control to be centralized, rather
than distributed. In this case, the best-achievable performance scaling, which
is shown to be that of proportional feedback control, is retrieved.
| math.OC | we study performance limitations of distributed feedback control in largescale networked dynamical systems specifically we address the question of how the performance of distributed integral control is affected by measurement noise we consider secondorder consensuslike problems modeled over a toric lattice network and study asymptotic scalings in network size of h2 performance metrics that quantify the variance of nodal state fluctuations while previous studies have shown that distributed integral control fundamentally improves these performance scalings compared to distributed proportional feedback control our results show that an explicit inclusion of measurement noise leads to the opposite conclusion the noises impact on performance is shown to decrease with an increased internodal alignment of the local integral states however even though the controller can be tuned for acceptable performance for any given network size performance will degrade as the network grows limiting the scalability of any such controller tuning in particular the requirement for internodal alignment increases with network size we show that this in practice implies that large and sparse networks will require any integral control to be centralized rather than distributed in this case the bestachievable performance scaling which is shown to be that of proportional feedback control is retrieved | [['we', 'study', 'performance', 'limitations', 'of', 'distributed', 'feedback', 'control', 'in', 'largescale', 'networked', 'dynamical', 'systems', 'specifically', 'we', 'address', 'the', 'question', 'of', 'how', 'the', 'performance', 'of', 'distributed', 'integral', 'control', 'is', 'affected', 'by', 'measurement', 'noise', 'we', 'consider', 'secondorder', 'consensuslike', 'problems', 'modeled', 'over', 'a', 'toric', 'lattice', 'network', 'and', 'study', 'asymptotic', 'scalings', 'in', 'network', 'size', 'of', 'h2', 'performance', 'metrics', 'that', 'quantify', 'the', 'variance', 'of', 'nodal', 'state', 'fluctuations', 'while', 'previous', 'studies', 'have', 'shown', 'that', 'distributed', 'integral', 'control', 'fundamentally', 'improves', 'these', 'performance', 'scalings', 'compared', 'to', 'distributed', 'proportional', 'feedback', 'control', 'our', 'results', 'show', 'that', 'an', 'explicit', 'inclusion', 'of', 'measurement', 'noise', 'leads', 'to', 'the', 'opposite', 'conclusion', 'the', 'noises', 'impact', 'on', 'performance', 'is', 'shown', 'to', 'decrease', 'with', 'an', 'increased', 'internodal', 'alignment', 'of', 'the', 'local', 'integral', 'states', 'however', 'even', 'though', 'the', 'controller', 'can', 'be', 'tuned', 'for', 'acceptable', 'performance', 'for', 'any', 'given', 'network', 'size', 'performance', 'will', 'degrade', 'as', 'the', 'network', 'grows', 'limiting', 'the', 'scalability', 'of', 'any', 'such', 'controller', 'tuning', 'in', 'particular', 'the', 'requirement', 'for', 'internodal', 'alignment', 'increases', 'with', 'network', 'size', 'we', 'show', 'that', 'this', 'in', 'practice', 'implies', 'that', 'large', 'and', 'sparse', 'networks', 'will', 'require', 'any', 'integral', 'control', 'to', 'be', 'centralized', 'rather', 'than', 'distributed', 'in', 'this', 'case', 'the', 'bestachievable', 'performance', 'scaling', 'which', 'is', 'shown', 'to', 'be', 'that', 'of', 'proportional', 'feedback', 'control', 'is', 'retrieved']] | [-0.17057304934805595, 0.056399424200153314, -0.03899324077284479, 0.027017071303775786, -0.052985844197659636, -0.1511737667872388, 0.031180465879414847, 0.38992255980712853, -0.28619129703047885, -0.30605785244252137, 0.10191450375143962, -0.2403332466343254, -0.15752092136266693, 0.20820225276820473, -0.15582264167251975, 0.06298903372178519, 0.08805400531051034, 0.02321875947714788, -0.07002952944630074, -0.29427547053078273, 0.29314121117185915, 0.09020920556878681, 0.3453669799304563, 0.02714011063752462, 0.0788534357207804, -0.022314798208561974, -0.010318756294811153, 0.06384144938461969, -0.08431691718315554, 0.08347086686887849, 0.26237901833186855, 0.10477414488179337, 0.3019036594263498, -0.4084876717335016, -0.2210291800318501, 0.1332947593732227, 0.1909295413362321, 0.07799577773567676, -0.03018632054214258, -0.24579489345301936, 0.1151893593934856, -0.17403145774674775, -0.10473789646285563, -0.07998171430528656, -0.022592882967984593, 0.055480757757240595, -0.31408367444522417, 0.04261471164511077, 0.0664419119072851, 0.022751744446957756, -0.05496634871771456, -0.09052570176839679, 0.014112788474833096, 0.15849793060734194, 0.014510719759048118, 0.015641821457082452, 0.17778021509960368, -0.14429116648428514, -0.13455908216276305, 0.337118232014341, -0.04420248695496229, -0.24954342754234807, 0.14798169990477325, -0.10113639103005355, -0.12376703230746619, 0.13512043800993576, 0.20756647428357272, 0.054589432383414786, -0.13138124315845007, 0.05078968153178374, -0.007522511186578952, 0.22928863928077658, 0.022961140292621775, 0.07944384723990669, 0.11745843518965284, 0.2064578737022271, 0.1509564636899954, 0.15160310598635512, -0.045804691263451124, -0.1311842295055713, -0.24098494298868442, -0.09634905600049837, -0.1989282642552002, 0.049005189346589484, -0.11432657784465865, -0.13463889772962223, 0.33975393724646513, 0.21463830232030556, 0.17693255862207083, 0.10005937693067288, 0.32442007148310764, 0.12822389882116406, 0.08056791723429707, 0.11542507708096063, 0.2607266997354545, 0.07044187455026236, 0.08905869368615855, -0.29013622238829584, 0.10996392126143653, -0.030023511508526515] |
1,802.03188 | Quantum Relational Hoare Logic | We present a logic for reasoning about pairs of interactive quantum programs
- quantum relational Hoare logic (qRHL). This logic follows the spirit of
probabilistic relational Hoare logic (Barthe et al. 2009) and allows us to
formulate how the outputs of two quantum programs relate given the relationship
of their inputs. Probabilistic RHL was used extensively for computer-verified
security proofs of classical cryptographic protocols. Since pRHL is not
suitable for analyzing quantum cryptography, we present qRHL as a replacement,
suitable for the security analysis of post-quantum cryptography and quantum
protocols. The design of qRHL poses some challenges unique to the quantum
setting, e.g., the definition of equality on quantum registers. Finally, we
implemented a tool for verifying proofs in qRHL and developed several example
security proofs in it.
| quant-ph cs.LO | we present a logic for reasoning about pairs of interactive quantum programs quantum relational hoare logic qrhl this logic follows the spirit of probabilistic relational hoare logic barthe et al 2009 and allows us to formulate how the outputs of two quantum programs relate given the relationship of their inputs probabilistic rhl was used extensively for computerverified security proofs of classical cryptographic protocols since prhl is not suitable for analyzing quantum cryptography we present qrhl as a replacement suitable for the security analysis of postquantum cryptography and quantum protocols the design of qrhl poses some challenges unique to the quantum setting eg the definition of equality on quantum registers finally we implemented a tool for verifying proofs in qrhl and developed several example security proofs in it | [['we', 'present', 'a', 'logic', 'for', 'reasoning', 'about', 'pairs', 'of', 'interactive', 'quantum', 'programs', 'quantum', 'relational', 'hoare', 'logic', 'qrhl', 'this', 'logic', 'follows', 'the', 'spirit', 'of', 'probabilistic', 'relational', 'hoare', 'logic', 'barthe', 'et', 'al', '2009', 'and', 'allows', 'us', 'to', 'formulate', 'how', 'the', 'outputs', 'of', 'two', 'quantum', 'programs', 'relate', 'given', 'the', 'relationship', 'of', 'their', 'inputs', 'probabilistic', 'rhl', 'was', 'used', 'extensively', 'for', 'computerverified', 'security', 'proofs', 'of', 'classical', 'cryptographic', 'protocols', 'since', 'prhl', 'is', 'not', 'suitable', 'for', 'analyzing', 'quantum', 'cryptography', 'we', 'present', 'qrhl', 'as', 'a', 'replacement', 'suitable', 'for', 'the', 'security', 'analysis', 'of', 'postquantum', 'cryptography', 'and', 'quantum', 'protocols', 'the', 'design', 'of', 'qrhl', 'poses', 'some', 'challenges', 'unique', 'to', 'the', 'quantum', 'setting', 'eg', 'the', 'definition', 'of', 'equality', 'on', 'quantum', 'registers', 'finally', 'we', 'implemented', 'a', 'tool', 'for', 'verifying', 'proofs', 'in', 'qrhl', 'and', 'developed', 'several', 'example', 'security', 'proofs', 'in', 'it']] | [-0.130348232895596, -0.008586900303184632, -0.12276040652530297, 0.1506518435827087, -0.11062200471670144, -0.25672276304399094, 0.07357667049666541, 0.3129467634070251, -0.2701860056406567, -0.31342644562264754, 0.08037594183106049, -0.2001983669110886, -0.13998139684369404, 0.2566563848938261, -0.17846657100894917, 0.18299902780424981, 0.0008882137074593514, -0.017597674813476346, -0.028779070895758367, -0.27637227579382145, 0.2841294515759699, 0.002719902689383912, 0.2520851569196176, 0.0482746495843111, 0.08818484982290851, 0.11741634523348203, -0.02647298713222087, -0.008989193609782628, -0.14267679761230415, 0.17327310312317595, 0.3546818369973658, 0.269661235832794, 0.3135884463314026, -0.42701521561673234, -0.12003387537570523, 0.04102190617944986, 0.06270544140242569, 0.16087564293088186, -0.03236367379865861, -0.32282866418568623, 0.08060829662015691, -0.20793930196114593, -0.0519033871029341, -0.12025034940609383, 0.02501095012791218, -0.021242137273980513, -0.20608710254069476, -0.0578243606723845, 0.16264373586431796, 0.12440798612725404, 0.053427902964546185, -0.05303259127697582, 0.07400621645270831, 0.10891611705578509, -0.1020635753031081, -0.029208597747446406, 0.13564333083137634, -0.07642120804216358, -0.2816798439053523, 0.34164002791993203, 0.04751865526371162, -0.148982910158497, 0.15910040522142063, 0.0010686420931643437, -0.23283614481370601, -0.02513698935656557, 0.11781296888661999, 0.09974866474808622, -0.13495908601446047, 0.14020214609604048, -0.0400054880181357, 0.22054207160152375, 0.08779938481119831, 0.1332244148167471, 0.17041807218144336, 0.11639617958534805, 0.008522026440394776, 0.16515756203951906, 0.02171675709357101, -0.21396325218596585, -0.31475371435018523, -0.24823191639272466, -0.1341696184143306, 0.048715469384097515, -0.05251495856461429, -0.16256006629139716, 0.34803812026179265, 0.20965796859245672, 0.06724844875168942, 0.1151033661638697, 0.32318409513460383, 0.06815392786308029, 0.04812245994680635, 0.073741961924714, 0.1538265361471401, 0.20011706364577606, 0.18372620162110598, -0.11625699110450186, 0.13659881819630898, 0.0790450415455751] |
1,802.03189 | Effects of Alfvenic Drift on Diffusive Shock Acceleration at Weak
Cluster Shocks | Non-detection of $\gamma$-ray emission from galaxy clusters has challenged
diffusive shock acceleration (DSA) of cosmic-ray (CR) protons at weak
collisionless shocks that are expected to form in the intracluster medium. As
an effort to address this problem, we here explore possible roles of Alfv\'en
waves self-excited via resonant streaming instability during the CR
acceleration at parallel shocks. The mean drift of Alfv\'en waves may either
increase or decrease the scattering center compression ratio, depending on the
postshock cross-helicity, leading to either flatter or steeper CR spectra. We
first examine such effects at planar shocks, based on the transport of Alfv\'en
waves in the small amplitude limit. For the shock parameters relevant to
cluster shocks, Alfv\'enic drift flattens the CR spectrum slightly, resulting
in a small increase of the CR acceleration efficiency, $\eta$. We then consider
two additional, physically motivated cases: (1) postshock waves are isotropized
via MHD and plasma processes across the shock transition and (2) postshock
waves contain only forward waves propagating along with the flow due to a
possible gradient of CR pressure behind the shock. In these cases, Alfv\'enic
drift could reduce $\eta$ by as much as a factor of 5 for weak cluster shocks.
For the canonical parameters adopted here, we suggest $\eta\sim10^{-4}-10^{-2}$
for shocks with sonic Mach number $M_{\rm s}\approx2-3$. The possible reduction
of $\eta$ may help ease the tension between non-detection of $\gamma$-rays from
galaxy clusters and DSA predictions.
| astro-ph.HE | nondetection of gammaray emission from galaxy clusters has challenged diffusive shock acceleration dsa of cosmicray cr protons at weak collisionless shocks that are expected to form in the intracluster medium as an effort to address this problem we here explore possible roles of alfven waves selfexcited via resonant streaming instability during the cr acceleration at parallel shocks the mean drift of alfven waves may either increase or decrease the scattering center compression ratio depending on the postshock crosshelicity leading to either flatter or steeper cr spectra we first examine such effects at planar shocks based on the transport of alfven waves in the small amplitude limit for the shock parameters relevant to cluster shocks alfvenic drift flattens the cr spectrum slightly resulting in a small increase of the cr acceleration efficiency eta we then consider two additional physically motivated cases 1 postshock waves are isotropized via mhd and plasma processes across the shock transition and 2 postshock waves contain only forward waves propagating along with the flow due to a possible gradient of cr pressure behind the shock in these cases alfvenic drift could reduce eta by as much as a factor of 5 for weak cluster shocks for the canonical parameters adopted here we suggest etasim104102 for shocks with sonic mach number m_rm sapprox23 the possible reduction of eta may help ease the tension between nondetection of gammarays from galaxy clusters and dsa predictions | [['nondetection', 'of', 'gammaray', 'emission', 'from', 'galaxy', 'clusters', 'has', 'challenged', 'diffusive', 'shock', 'acceleration', 'dsa', 'of', 'cosmicray', 'cr', 'protons', 'at', 'weak', 'collisionless', 'shocks', 'that', 'are', 'expected', 'to', 'form', 'in', 'the', 'intracluster', 'medium', 'as', 'an', 'effort', 'to', 'address', 'this', 'problem', 'we', 'here', 'explore', 'possible', 'roles', 'of', 'alfven', 'waves', 'selfexcited', 'via', 'resonant', 'streaming', 'instability', 'during', 'the', 'cr', 'acceleration', 'at', 'parallel', 'shocks', 'the', 'mean', 'drift', 'of', 'alfven', 'waves', 'may', 'either', 'increase', 'or', 'decrease', 'the', 'scattering', 'center', 'compression', 'ratio', 'depending', 'on', 'the', 'postshock', 'crosshelicity', 'leading', 'to', 'either', 'flatter', 'or', 'steeper', 'cr', 'spectra', 'we', 'first', 'examine', 'such', 'effects', 'at', 'planar', 'shocks', 'based', 'on', 'the', 'transport', 'of', 'alfven', 'waves', 'in', 'the', 'small', 'amplitude', 'limit', 'for', 'the', 'shock', 'parameters', 'relevant', 'to', 'cluster', 'shocks', 'alfvenic', 'drift', 'flattens', 'the', 'cr', 'spectrum', 'slightly', 'resulting', 'in', 'a', 'small', 'increase', 'of', 'the', 'cr', 'acceleration', 'efficiency', 'eta', 'we', 'then', 'consider', 'two', 'additional', 'physically', 'motivated', 'cases', '1', 'postshock', 'waves', 'are', 'isotropized', 'via', 'mhd', 'and', 'plasma', 'processes', 'across', 'the', 'shock', 'transition', 'and', '2', 'postshock', 'waves', 'contain', 'only', 'forward', 'waves', 'propagating', 'along', 'with', 'the', 'flow', 'due', 'to', 'a', 'possible', 'gradient', 'of', 'cr', 'pressure', 'behind', 'the', 'shock', 'in', 'these', 'cases', 'alfvenic', 'drift', 'could', 'reduce', 'eta', 'by', 'as', 'much', 'as', 'a', 'factor', 'of', '5', 'for', 'weak', 'cluster', 'shocks', 'for', 'the', 'canonical', 'parameters', 'adopted', 'here', 'we', 'suggest', 'etasim104102', 'for', 'shocks', 'with', 'sonic', 'mach', 'number', 'm_rm', 'sapprox23', 'the', 'possible', 'reduction', 'of', 'eta', 'may', 'help', 'ease', 'the', 'tension', 'between', 'nondetection', 'of', 'gammarays', 'from', 'galaxy', 'clusters', 'and', 'dsa', 'predictions']] | [-0.14001453002762898, 0.21170204564337688, -0.001974868086514427, 0.12820405580149363, -0.10748830148620458, -0.06832669592010808, 0.009729910777809794, 0.367988564313865, -0.29717665921912684, -0.28937449362608625, -0.007160434871112584, -0.27769917514287096, -0.006217271270422273, 0.2180686683489945, 0.06682653316244674, -0.010916210985677556, 0.05299970574922812, -0.06948234672885979, 0.00037981914741071064, -0.15411149688732567, 0.3123442044085923, 0.177438466367012, 0.21898184253738256, 0.03657266390140172, 0.0634347205152715, -0.09611597361818532, -0.011010758273999003, 0.005854153911824325, -0.12795461475375872, 0.011387724158565949, 0.19004722526736653, 0.09765960121139597, 0.24187262549940416, -0.5077328391676936, -0.30309831981383295, 0.042880278203612426, 0.2551965297943245, 0.05854707906750139, -0.038855243601152764, -0.22666715535179355, 0.040732128898073046, -0.17570103471074452, -0.16381148391407255, 0.07754846790389762, 0.030082420472959018, 0.07596712344418012, -0.25214519896024895, 0.17711900744490752, 0.050941060772345524, 0.023738717412488144, -0.08513637613445169, -0.05622496493080783, -0.048745808001735565, 0.012984411323307153, 0.14620466647387878, 0.046731947281681674, 0.19614554033514767, -0.14154536329717435, -0.051587685972628035, 0.4218501379626479, -0.0624486430030508, -0.11379047331166385, 0.25694668142408805, -0.19648563561065707, -0.12460708112931558, 0.22261262956563016, 0.22531978036536807, 0.035124258419784594, -0.059124143450429, 0.005741553654136784, 0.01883416716509015, 0.12269816469289202, 0.1294268488668129, -0.020394807510940326, 0.23463827523411862, 0.1091321225152171, 0.06393382401613303, 0.08470130544115866, -0.17037192716507057, 0.01947234088056341, -0.27920657540211863, -0.1179845419446558, -0.10725323151139535, 0.06565598097665819, -0.14355290061955353, -0.14673142094372935, 0.323272722982102, 0.14617081175562266, 0.1708661316985928, -0.014025701657702044, 0.30918228378631335, 0.155576948628585, -0.01320089213350236, 0.20000713574700058, 0.32643274256615806, 0.18707736506718392, 0.13515713449183836, -0.24998439482089468, 0.08228956967144566, 0.028178931802487234] |
1,802.0319 | Non-Markovian quantum control as coherent stochastic trajectories | We develop a notion of stochastic quantum trajectories. First, we construct a
basis set of trajectories, called elementary trajectories, and go on to show
that any quantum dynamical process, including those that are non-Markovian, can
be expressed as a linear combination of this set. We then show that the set of
processes divide into two natural classes: those that can be expressed as
convex mixture of elementary trajectories and those that cannot be. The former
are shown to be entanglement breaking processes (in each step), while the
latter are dubbed coherent processes. This division of processes is analogous
to separable and entangled states. In the second half of the paper, we show,
with an information theoretic game, that when a process is non-Markovian,
coherent trajectories allow for decoupling from the environment while
preserving arbitrary quantum information encoded into the system. We give
explicit expressions for the temporal correlations (quantifying
non-Markovianity) and show that, in general, there are more quantum
correlations than classical ones. This shows that non-Markovian quantum
processes are indeed fundamentally different from their classical counterparts.
Furthermore, we demonstrate how coherent trajectories (with the aid of coherent
control) could turn non-Markovianity into a resource. In the final section of
the paper we explore this phenomenon in a geometric picture with a convenient
set of basis trajectories.
| quant-ph | we develop a notion of stochastic quantum trajectories first we construct a basis set of trajectories called elementary trajectories and go on to show that any quantum dynamical process including those that are nonmarkovian can be expressed as a linear combination of this set we then show that the set of processes divide into two natural classes those that can be expressed as convex mixture of elementary trajectories and those that cannot be the former are shown to be entanglement breaking processes in each step while the latter are dubbed coherent processes this division of processes is analogous to separable and entangled states in the second half of the paper we show with an information theoretic game that when a process is nonmarkovian coherent trajectories allow for decoupling from the environment while preserving arbitrary quantum information encoded into the system we give explicit expressions for the temporal correlations quantifying nonmarkovianity and show that in general there are more quantum correlations than classical ones this shows that nonmarkovian quantum processes are indeed fundamentally different from their classical counterparts furthermore we demonstrate how coherent trajectories with the aid of coherent control could turn nonmarkovianity into a resource in the final section of the paper we explore this phenomenon in a geometric picture with a convenient set of basis trajectories | [['we', 'develop', 'a', 'notion', 'of', 'stochastic', 'quantum', 'trajectories', 'first', 'we', 'construct', 'a', 'basis', 'set', 'of', 'trajectories', 'called', 'elementary', 'trajectories', 'and', 'go', 'on', 'to', 'show', 'that', 'any', 'quantum', 'dynamical', 'process', 'including', 'those', 'that', 'are', 'nonmarkovian', 'can', 'be', 'expressed', 'as', 'a', 'linear', 'combination', 'of', 'this', 'set', 'we', 'then', 'show', 'that', 'the', 'set', 'of', 'processes', 'divide', 'into', 'two', 'natural', 'classes', 'those', 'that', 'can', 'be', 'expressed', 'as', 'convex', 'mixture', 'of', 'elementary', 'trajectories', 'and', 'those', 'that', 'can', 'not', 'be', 'the', 'former', 'are', 'shown', 'to', 'be', 'entanglement', 'breaking', 'processes', 'in', 'each', 'step', 'while', 'the', 'latter', 'are', 'dubbed', 'coherent', 'processes', 'this', 'division', 'of', 'processes', 'is', 'analogous', 'to', 'separable', 'and', 'entangled', 'states', 'in', 'the', 'second', 'half', 'of', 'the', 'paper', 'we', 'show', 'with', 'an', 'information', 'theoretic', 'game', 'that', 'when', 'a', 'process', 'is', 'nonmarkovian', 'coherent', 'trajectories', 'allow', 'for', 'decoupling', 'from', 'the', 'environment', 'while', 'preserving', 'arbitrary', 'quantum', 'information', 'encoded', 'into', 'the', 'system', 'we', 'give', 'explicit', 'expressions', 'for', 'the', 'temporal', 'correlations', 'quantifying', 'nonmarkovianity', 'and', 'show', 'that', 'in', 'general', 'there', 'are', 'more', 'quantum', 'correlations', 'than', 'classical', 'ones', 'this', 'shows', 'that', 'nonmarkovian', 'quantum', 'processes', 'are', 'indeed', 'fundamentally', 'different', 'from', 'their', 'classical', 'counterparts', 'furthermore', 'we', 'demonstrate', 'how', 'coherent', 'trajectories', 'with', 'the', 'aid', 'of', 'coherent', 'control', 'could', 'turn', 'nonmarkovianity', 'into', 'a', 'resource', 'in', 'the', 'final', 'section', 'of', 'the', 'paper', 'we', 'explore', 'this', 'phenomenon', 'in', 'a', 'geometric', 'picture', 'with', 'a', 'convenient', 'set', 'of', 'basis', 'trajectories']] | [-0.10960571895008522, 0.17091710454793144, -0.15343311413216892, 0.10367484976985898, -0.0325626032277429, -0.12982105113482614, 0.022517866694257347, 0.3651504452477013, -0.30326119558928416, -0.2331499265412877, 0.05865774223198601, -0.24639481128462581, -0.17531771695299006, 0.21541534655582195, -0.0596597283446324, 0.03302883940167862, 0.08100508891180619, 0.045498639152923584, -0.026486602299974873, -0.21618999379907025, 0.3449436515620952, -0.015100573139225663, 0.2460803245706911, 0.011329126059410905, 0.11200786224318617, 0.01811088289779295, 0.0017620640029327585, 0.040947350723908704, -0.0933719866115006, 0.11922085502290662, 0.2629881373845861, 0.17094493888045123, 0.268108099160733, -0.43966321857355606, -0.21331265772299823, 0.12512928339729615, 0.1610490420865004, 0.17251695010494952, -0.017591300616780436, -0.31258655440728733, 0.06602017936689797, -0.15347962854472802, -0.07996947443702283, -0.11918441297213009, 0.0005251249990537079, 0.007663487755253467, -0.25904560585318287, 0.05561523923411145, 0.09946405233047932, 0.027486148984555942, -0.02391112562474034, -0.045644848587187946, -0.004042064846085316, 0.15068673497077117, -0.03724470911702406, -0.015346383751763048, 0.13254681959483397, -0.10352311758837159, -0.17837358872542894, 0.3744237846353117, -0.04244512451019345, -0.23774868882187256, 0.2004909425922627, -0.15247857718890823, -0.12241719938801823, 0.09998143961174635, 0.16832031069511394, 0.11085405588521699, -0.19571959120660665, 0.052509828748335256, -0.04619090698676508, 0.14806857734593912, 0.03925473467925341, 0.12599604639279177, 0.18929070558766364, 0.11038828522785045, 0.07224820083041393, 0.18416811417737003, -0.0018787384599259277, -0.18651663758920148, -0.3384805287730051, -0.19198678563340404, -0.1442719353715368, 0.07975342566658232, -0.06164493735632945, -0.13838068811944365, 0.38817917594660517, 0.14850707348263095, 0.2152962943308329, 0.06666539409176506, 0.2681409015401412, 0.15137575912570214, 0.024504510511712537, 0.05707379133085968, 0.20275921558687857, 0.08770050691363804, 0.022235505210252804, -0.19582786438068153, 0.07511122066126026, 0.03870540912425436] |
1,802.03191 | An extended version of a Branch-Price-and-Cut Procedure for the Discrete
Ordered Median Problem | The Discrete Ordered Median Problem (DOMP) is formulated as a set
partitioning problem using an exponential number of variables. Each variable
corresponds to a set of demand points allocated to the same facility with the
information of the sorting position of their corresponding costs. We develop a
column generation approach to solve the continuous relaxation of this model.
Then, we apply a branch-price-and-cut algorithm to solve to optimality small to
moderate size of DOMP in competitive computational time.
| math.OC | the discrete ordered median problem domp is formulated as a set partitioning problem using an exponential number of variables each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs we develop a column generation approach to solve the continuous relaxation of this model then we apply a branchpriceandcut algorithm to solve to optimality small to moderate size of domp in competitive computational time | [['the', 'discrete', 'ordered', 'median', 'problem', 'domp', 'is', 'formulated', 'as', 'a', 'set', 'partitioning', 'problem', 'using', 'an', 'exponential', 'number', 'of', 'variables', 'each', 'variable', 'corresponds', 'to', 'a', 'set', 'of', 'demand', 'points', 'allocated', 'to', 'the', 'same', 'facility', 'with', 'the', 'information', 'of', 'the', 'sorting', 'position', 'of', 'their', 'corresponding', 'costs', 'we', 'develop', 'a', 'column', 'generation', 'approach', 'to', 'solve', 'the', 'continuous', 'relaxation', 'of', 'this', 'model', 'then', 'we', 'apply', 'a', 'branchpriceandcut', 'algorithm', 'to', 'solve', 'to', 'optimality', 'small', 'to', 'moderate', 'size', 'of', 'domp', 'in', 'competitive', 'computational', 'time']] | [-0.0922716781258201, 0.056965008545375895, -0.07846704631064756, 0.046914709221500046, -0.09303793532606693, -0.12863398752867794, 0.12972955024228072, 0.37059822091116357, -0.3491800928918215, -0.3287912449047256, 0.12300330504195955, -0.21964109795263562, -0.06522222169531652, 0.11896920857879405, -0.10907687760220888, 0.1055816029293988, 0.022107449982566044, 0.03591955235848824, -0.040020150114567235, -0.29063553077718, 0.23185189353385702, 0.042290208383630484, 0.2592519773647953, -0.014390207850971283, 0.16355224107750332, 0.005210055651005883, -0.017248820680647325, 0.06882398524799217, -0.08919829387480441, 0.14467269419513357, 0.2636010241903699, 0.1882306731138856, 0.34701126976273, -0.4062796212786522, -0.1302167505790026, 0.15185248779538923, 0.09967450328613034, 0.09184578120803986, 0.006940982531374082, -0.19765247410843864, 0.09558308203943455, -0.14108494866209534, -0.13515921248696172, -0.017055385280400515, 0.01983040356889176, 0.02194002498454677, -0.32993144567052907, 0.03859906124237638, -0.0032374781514637363, -0.012924203037236555, -0.10258439222040276, -0.11518884892575443, 0.023073915207089905, 0.10992876357004906, 0.02882343803633912, 0.046755954794860326, 0.07795495565052335, -0.09466542759372924, -0.14760978255444804, 0.4102858253874076, -0.03413487839488647, -0.22206107834174943, 0.15325503408735713, -0.0739401920626943, -0.1457918445006586, 0.15472128961342746, 0.24961061884338656, 0.14584811755384391, -0.13507727382537454, 0.05018919078298868, -0.08505559150272837, 0.1996106183848893, 0.060791118580919616, 0.011877892992626399, 0.13579184007950318, 0.20536381634585082, 0.15938080048475128, 0.2066670659547433, -0.08742323408697326, -0.10527033853129698, -0.2670924644200848, -0.13063991448292747, -0.225697274486988, 0.01364936912432313, -0.11050423440069725, -0.1855519715195092, 0.3788093780525602, 0.1623023988511891, 0.231254067595075, 0.1258195909934166, 0.29240256204054904, 0.15940990846623512, 0.03452881307562049, 0.08724636188363104, 0.1060315534973947, 0.10641890157682773, 0.0826266781391146, -0.25262629169111067, 0.0474859696203986, 0.10126419136157402] |
1,802.03192 | Tracking all members of a honey bee colony over their lifetime | Computational approaches to the analysis of collective behavior in social
insects increasingly rely on motion paths as an intermediate data layer from
which one can infer individual behaviors or social interactions. Honey bees are
a popular model for learning and memory. Previous experience has been shown to
affect and modulate future social interactions. So far, no lifetime history
observations have been reported for all bees of a colony. In a previous work we
introduced a tracking system customized to track up to $4000$ bees over several
weeks. In this contribution we present an in-depth description of the
underlying multi-step algorithm which both produces the motion paths, and also
improves the marker decoding accuracy significantly. We automatically tracked
${\sim}2000$ marked honey bees over 10 weeks with inexpensive recording
hardware using markers without any error correction bits. We found that the
proposed two-step tracking reduced incorrect ID decodings from initially
${\sim}13\%$ to around $2\%$ post-tracking. Alongside this paper, we publish
the first trajectory dataset for all bees in a colony, extracted from ${\sim}
4$ million images. We invite researchers to join the collective scientific
effort to investigate this intriguing animal system. All components of our
system are open-source.
| cs.CV | computational approaches to the analysis of collective behavior in social insects increasingly rely on motion paths as an intermediate data layer from which one can infer individual behaviors or social interactions honey bees are a popular model for learning and memory previous experience has been shown to affect and modulate future social interactions so far no lifetime history observations have been reported for all bees of a colony in a previous work we introduced a tracking system customized to track up to 4000 bees over several weeks in this contribution we present an indepth description of the underlying multistep algorithm which both produces the motion paths and also improves the marker decoding accuracy significantly we automatically tracked sim2000 marked honey bees over 10 weeks with inexpensive recording hardware using markers without any error correction bits we found that the proposed twostep tracking reduced incorrect id decodings from initially sim13 to around 2 posttracking alongside this paper we publish the first trajectory dataset for all bees in a colony extracted from sim 4 million images we invite researchers to join the collective scientific effort to investigate this intriguing animal system all components of our system are opensource | [['computational', 'approaches', 'to', 'the', 'analysis', 'of', 'collective', 'behavior', 'in', 'social', 'insects', 'increasingly', 'rely', 'on', 'motion', 'paths', 'as', 'an', 'intermediate', 'data', 'layer', 'from', 'which', 'one', 'can', 'infer', 'individual', 'behaviors', 'or', 'social', 'interactions', 'honey', 'bees', 'are', 'a', 'popular', 'model', 'for', 'learning', 'and', 'memory', 'previous', 'experience', 'has', 'been', 'shown', 'to', 'affect', 'and', 'modulate', 'future', 'social', 'interactions', 'so', 'far', 'no', 'lifetime', 'history', 'observations', 'have', 'been', 'reported', 'for', 'all', 'bees', 'of', 'a', 'colony', 'in', 'a', 'previous', 'work', 'we', 'introduced', 'a', 'tracking', 'system', 'customized', 'to', 'track', 'up', 'to', '4000', 'bees', 'over', 'several', 'weeks', 'in', 'this', 'contribution', 'we', 'present', 'an', 'indepth', 'description', 'of', 'the', 'underlying', 'multistep', 'algorithm', 'which', 'both', 'produces', 'the', 'motion', 'paths', 'and', 'also', 'improves', 'the', 'marker', 'decoding', 'accuracy', 'significantly', 'we', 'automatically', 'tracked', 'sim2000', 'marked', 'honey', 'bees', 'over', '10', 'weeks', 'with', 'inexpensive', 'recording', 'hardware', 'using', 'markers', 'without', 'any', 'error', 'correction', 'bits', 'we', 'found', 'that', 'the', 'proposed', 'twostep', 'tracking', 'reduced', 'incorrect', 'id', 'decodings', 'from', 'initially', 'sim13', 'to', 'around', '2', 'posttracking', 'alongside', 'this', 'paper', 'we', 'publish', 'the', 'first', 'trajectory', 'dataset', 'for', 'all', 'bees', 'in', 'a', 'colony', 'extracted', 'from', 'sim', '4', 'million', 'images', 'we', 'invite', 'researchers', 'to', 'join', 'the', 'collective', 'scientific', 'effort', 'to', 'investigate', 'this', 'intriguing', 'animal', 'system', 'all', 'components', 'of', 'our', 'system', 'are', 'opensource']] | [-0.0784842742768188, 0.07539309634101721, -0.08946189304563001, 0.029590812048170333, -0.10679914437664242, -0.15488506999487678, 0.06388052696159158, 0.43010712527216244, -0.24828006700311864, -0.38154866833192036, 0.06797138332413175, -0.3299794681561299, -0.18871313023160044, 0.1789876987094967, -0.09348875708543719, 0.03954621572823574, 0.1093991194302455, 0.04404405965469778, 0.021353790941289984, -0.27114951444240526, 0.19961911693628795, 0.06828481454330568, 0.26596487521205864, -0.009974183416805971, 0.10463321490619236, -0.010322874614921136, -0.04937076560484293, -0.014386441472631234, -0.11522126300383556, 0.10803265871408467, 0.26013188257885095, 0.16785074689258367, 0.3161124086055236, -0.4397709629808863, -0.21489321315565552, 0.0980787628592971, 0.215243752914457, 0.13120290642628113, -0.03483352816651743, -0.317972453048405, 0.08449986935563338, -0.19728870238058077, -0.08309930629837207, -0.07778336438768281, 0.030401918458609054, 0.01644370725067953, -0.22056164743187717, 0.01845240272172631, 0.017533111377643087, 0.127683541062885, -0.07422140939638783, -0.12349740900636579, 0.0198543552798816, 0.20624598622537002, 0.05129076525724183, 0.041705673228567226, 0.17722570520216743, -0.12289687908517244, -0.15741796295803326, 0.3405212484968778, -0.02439887490338431, -0.13360662737216514, 0.2133271924040925, -0.06579863819030997, -0.13078290273507054, 0.16164454360767147, 0.23764193882353796, 0.11380630757253712, -0.19686421071752333, -0.03635445380290875, -0.0017272127529558462, 0.2106817437031378, 0.060161320134722744, -0.026706063633975693, 0.16588692060456825, 0.20493878762070566, 0.033133230439218606, 0.07548489343219747, -0.1039144935647551, -0.10105113048846714, -0.17154469965264582, -0.13424987435443117, -0.1171132990738186, 0.024244242403298043, -0.06293674152417598, -0.12944531263589548, 0.4086156404362275, 0.21803322258429267, 0.17957621640645158, 0.07078950006084947, 0.30486135699260886, -0.013942781386849208, 0.12009885092250978, 0.1007228982873643, 0.21869953600212166, -0.03739720855788059, 0.13964816026079158, -0.19926133323102616, 0.11734118166331871, 0.01977803374473483] |
1,802.03193 | Young differential delay equations driven by H\"older continuous paths | In this paper we prove the existence and uniqueness of the solution of Young
differential delay equations under weaker conditions than it is known in the
literature. We also prove the continuity and differentiability of the solution
with respect to the initial function and give an estimate for the growth of the
solution. The proofs use techniques of stopping times, Shauder-Tychonoff fixed
point theorem and a Gronwall-type lemma.
| math.DS | in this paper we prove the existence and uniqueness of the solution of young differential delay equations under weaker conditions than it is known in the literature we also prove the continuity and differentiability of the solution with respect to the initial function and give an estimate for the growth of the solution the proofs use techniques of stopping times shaudertychonoff fixed point theorem and a gronwalltype lemma | [['in', 'this', 'paper', 'we', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'solution', 'of', 'young', 'differential', 'delay', 'equations', 'under', 'weaker', 'conditions', 'than', 'it', 'is', 'known', 'in', 'the', 'literature', 'we', 'also', 'prove', 'the', 'continuity', 'and', 'differentiability', 'of', 'the', 'solution', 'with', 'respect', 'to', 'the', 'initial', 'function', 'and', 'give', 'an', 'estimate', 'for', 'the', 'growth', 'of', 'the', 'solution', 'the', 'proofs', 'use', 'techniques', 'of', 'stopping', 'times', 'shaudertychonoff', 'fixed', 'point', 'theorem', 'and', 'a', 'gronwalltype', 'lemma']] | [-0.11240620415834988, -0.016188892547810908, -0.1442278977483511, 0.08497411617314193, -0.04062206455186677, -0.08213082779504692, 0.0514339885427686, 0.3037454507508273, -0.28982057494681274, -0.2508862946267629, 0.18560270116831273, -0.2602583341015531, -0.11204608214007858, 0.188068054894458, -0.10745901971666226, 0.06339464984389383, 0.06262012812962282, 0.03818958151195921, -0.10736128482133594, -0.2516717847937079, 0.3643178400486263, -0.02191668123340429, 0.23615232421391047, 0.0814200582133898, 0.13405292046798475, 0.007847526777924886, -0.02597928703276079, -0.03799437540027299, -0.23512130829595976, 0.1007795101031661, 0.17537645556366266, 0.13454731408534432, 0.2916923612356186, -0.4072011486529859, -0.1276171999260672, 0.13501535217215155, 0.08436256754142579, 0.09669056395763781, -0.0651758908738952, -0.26952712732686923, 0.14907776663052058, -0.09198564671869598, -0.23855428314253466, -0.03447161307697421, 0.025426377257360005, 0.08733143222799747, -0.3048469179323805, 0.09210994140611642, 0.13343383822200902, 0.050604106663767974, -0.15148882947361736, -0.0708535621359722, 0.00904218663822915, 0.06922823677895897, 0.10234708382066951, 0.023537459317594767, 0.05123108907588827, -0.13648709003924767, -0.08418163112295207, 0.3316958043446292, -0.0705599218388453, -0.2284578226173102, 0.1894529905698415, -0.12460919020614072, -0.13106418257829414, 0.09310473181974532, 0.12185794411838721, 0.19644047521443955, -0.15999767288510033, 0.09866373458835505, -0.07778677257097591, 0.14136050607003062, 0.13475488141568295, 0.060631763370735434, 0.04970607185152484, 0.11770292983126285, 0.2323749448492456, 0.16559619526726319, -0.009343081098327885, -0.08649162293425691, -0.358485171904982, -0.19119459921285623, -0.11564415726991398, 0.10507654700317044, -0.132765786033367, -0.1850004081628216, 0.3413062422282632, 0.17473822236478107, 0.1559475507316138, 0.135604635103425, 0.2432636484058935, 0.2128121016213476, 0.0038206533514964047, 0.09130559236839858, 0.21554152669781235, 0.1917367008151556, 0.12773792693780653, -0.16743869967445899, 0.10334752570253922, 0.14371230389311243] |
1,802.03194 | Ambrosetti-Prodi problem with degenerate potential and Neumann boundary
condition | We study the degenerate elliptic equation $-\mathop{\rm div}(|x|^\alpha\nabla
u) =f(u)+t\phi(x)+h(x)$ in a bounded open set $\Omega$ with homogeneous Neumann
boundary condition, where $\alpha\in(0,2)$ and $f$ has a linear growth. The
main result establishes the existence of real numbers $t_*$ and $t^*$ such that
the problem has at least two solutions if $t\leq t_*$, there is at least one
solution if $t_*<t\leq t^*$, and no solution exists for all $t>t^*$. The proof
combines a priori estimates with topological degree arguments.
| math.AP | we study the degenerate elliptic equation mathoprm divxalphanabla u futphixhx in a bounded open set omega with homogeneous neumann boundary condition where alphain02 and f has a linear growth the main result establishes the existence of real numbers t_ and t such that the problem has at least two solutions if tleq t_ there is at least one solution if t_tleq t and no solution exists for all tt the proof combines a priori estimates with topological degree arguments | [['we', 'study', 'the', 'degenerate', 'elliptic', 'equation', 'mathoprm', 'divxalphanabla', 'u', 'futphixhx', 'in', 'a', 'bounded', 'open', 'set', 'omega', 'with', 'homogeneous', 'neumann', 'boundary', 'condition', 'where', 'alphain02', 'and', 'f', 'has', 'a', 'linear', 'growth', 'the', 'main', 'result', 'establishes', 'the', 'existence', 'of', 'real', 'numbers', 't_', 'and', 't', 'such', 'that', 'the', 'problem', 'has', 'at', 'least', 'two', 'solutions', 'if', 'tleq', 't_', 'there', 'is', 'at', 'least', 'one', 'solution', 'if', 't_tleq', 't', 'and', 'no', 'solution', 'exists', 'for', 'all', 'tt', 'the', 'proof', 'combines', 'a', 'priori', 'estimates', 'with', 'topological', 'degree', 'arguments']] | [-0.1998597193558357, 0.1285695549235434, -0.07726430075586234, 0.010945559107073533, -0.06719791668001562, -0.22460432863475657, -6.889183025218939e-05, 0.29172545400950567, -0.30287591610594017, -0.19555432180334864, 0.16431764321322062, -0.36301926498938547, -0.06720575621645701, 0.17764503145927416, -0.012184523358499925, 0.04990685813275999, 0.06367326961021479, 0.09864610820812614, -0.057666977876674776, -0.22890045991976207, 0.3632831438383284, -0.15537444631703884, 0.16479532739245578, 0.0897955530764241, 0.15114976117681517, -0.029612273253549478, 0.04954967775847763, -0.009404647586818197, -0.24786777869159873, 0.006535218359204009, 0.24790295936461343, 0.09735396296080005, 0.33530477235877987, -0.33362205755455715, -0.16150190993702332, 0.2015682307537645, 0.09789398443689079, 0.001099968586411131, -0.04755898657573485, -0.19134449948997875, 0.15984761207609585, -0.0698331938859299, -0.20349688228146223, -0.014372100339785806, 0.08550804311495372, 0.005814812459376347, -0.3355041568682186, 0.10393754394087744, 0.12566292545249635, 0.060245584855836476, -0.08414141018491998, -0.13371376459805392, -0.08128898073367677, 0.05057454818712646, 0.024876226943696997, 0.09444552140714797, -0.030729191880183, -0.08078420998553108, -0.06977474620859873, 0.3097512063472287, -0.11437972948433046, -0.22924017680710868, 0.19002091750735417, -0.18741511617860707, -0.1323196533546587, 0.0846764575613442, 0.05504354588705801, 0.15492702431143507, -0.08845398602026858, 0.22237746387882476, -0.08939366378227102, 0.16824432166360662, 0.14043990665997722, -0.0238624171700059, 0.08393678177871104, 0.13209732114199524, 0.19641461307918162, 0.09538390606911362, 0.024491357754940463, -0.041218740044553816, -0.4064016061785974, -0.1255318161198183, -0.19793014700285552, 0.1406393316942022, -0.10218086131594885, -0.18617940473517305, 0.305968702991346, 0.05453492310449579, 0.19708851498772242, 0.06658323383645008, 0.2093526494220561, 0.18821725025516475, -0.0093195961702517, 0.17869369424174933, 0.10606896607695442, 0.15828757385698786, 0.08055609959104147, -0.18893402949049087, 0.056407317978722095, 0.16177686242027497] |
1,802.03195 | Limits on Sparse Data Acquisition: RIC Analysis of Finite Gaussian
Matrices | One of the key issues in the acquisition of sparse data by means of
compressed sensing (CS) is the design of the measurement matrix. Gaussian
matrices have been proven to be information-theoretically optimal in terms of
minimizing the required number of measurements for sparse recovery. In this
paper we provide a new approach for the analysis of the restricted isometry
constant (RIC) of finite dimensional Gaussian measurement matrices. The
proposed method relies on the exact distributions of the extreme eigenvalues
for Wishart matrices. First, we derive the probability that the restricted
isometry property is satisfied for a given sufficient recovery condition on the
RIC, and propose a probabilistic framework to study both the symmetric and
asymmetric RICs. Then, we analyze the recovery of compressible signals in noise
through the statistical characterization of stability and robustness. The
presented framework determines limits on various sparse recovery algorithms for
finite size problems. In particular, it provides a tight lower bound on the
maximum sparsity order of the acquired data allowing signal recovery with a
given target probability. Also, we derive simple approximations for the RICs
based on the Tracy-Widom distribution.
| cs.IT eess.SP math.IT math.ST stat.TH | one of the key issues in the acquisition of sparse data by means of compressed sensing cs is the design of the measurement matrix gaussian matrices have been proven to be informationtheoretically optimal in terms of minimizing the required number of measurements for sparse recovery in this paper we provide a new approach for the analysis of the restricted isometry constant ric of finite dimensional gaussian measurement matrices the proposed method relies on the exact distributions of the extreme eigenvalues for wishart matrices first we derive the probability that the restricted isometry property is satisfied for a given sufficient recovery condition on the ric and propose a probabilistic framework to study both the symmetric and asymmetric rics then we analyze the recovery of compressible signals in noise through the statistical characterization of stability and robustness the presented framework determines limits on various sparse recovery algorithms for finite size problems in particular it provides a tight lower bound on the maximum sparsity order of the acquired data allowing signal recovery with a given target probability also we derive simple approximations for the rics based on the tracywidom distribution | [['one', 'of', 'the', 'key', 'issues', 'in', 'the', 'acquisition', 'of', 'sparse', 'data', 'by', 'means', 'of', 'compressed', 'sensing', 'cs', 'is', 'the', 'design', 'of', 'the', 'measurement', 'matrix', 'gaussian', 'matrices', 'have', 'been', 'proven', 'to', 'be', 'informationtheoretically', 'optimal', 'in', 'terms', 'of', 'minimizing', 'the', 'required', 'number', 'of', 'measurements', 'for', 'sparse', 'recovery', 'in', 'this', 'paper', 'we', 'provide', 'a', 'new', 'approach', 'for', 'the', 'analysis', 'of', 'the', 'restricted', 'isometry', 'constant', 'ric', 'of', 'finite', 'dimensional', 'gaussian', 'measurement', 'matrices', 'the', 'proposed', 'method', 'relies', 'on', 'the', 'exact', 'distributions', 'of', 'the', 'extreme', 'eigenvalues', 'for', 'wishart', 'matrices', 'first', 'we', 'derive', 'the', 'probability', 'that', 'the', 'restricted', 'isometry', 'property', 'is', 'satisfied', 'for', 'a', 'given', 'sufficient', 'recovery', 'condition', 'on', 'the', 'ric', 'and', 'propose', 'a', 'probabilistic', 'framework', 'to', 'study', 'both', 'the', 'symmetric', 'and', 'asymmetric', 'rics', 'then', 'we', 'analyze', 'the', 'recovery', 'of', 'compressible', 'signals', 'in', 'noise', 'through', 'the', 'statistical', 'characterization', 'of', 'stability', 'and', 'robustness', 'the', 'presented', 'framework', 'determines', 'limits', 'on', 'various', 'sparse', 'recovery', 'algorithms', 'for', 'finite', 'size', 'problems', 'in', 'particular', 'it', 'provides', 'a', 'tight', 'lower', 'bound', 'on', 'the', 'maximum', 'sparsity', 'order', 'of', 'the', 'acquired', 'data', 'allowing', 'signal', 'recovery', 'with', 'a', 'given', 'target', 'probability', 'also', 'we', 'derive', 'simple', 'approximations', 'for', 'the', 'rics', 'based', 'on', 'the', 'tracywidom', 'distribution']] | [-0.10075567648226251, 0.05648314765340743, -0.0785245622214388, 0.042349364621599606, -0.03651986795074162, -0.1492907144154178, 0.0684093080472231, 0.3439574487666714, -0.25676182715003104, -0.2604286872313662, 0.17172160288094876, -0.20564374548786465, -0.15847794962349662, 0.1628374938584147, -0.09402150725995634, 0.1502908222641258, 0.058096099674781375, 0.07890667816027028, -0.12845697549151824, -0.2379803642540931, 0.2969161797113179, 0.0759861454477205, 0.32626702644324357, 0.02343132838676559, 0.12902686717910045, 0.05178928488297736, -0.047967585106255775, -0.03110863522247954, -0.1388366283180972, 0.15760437274516068, 0.2448764604200076, 0.19909448373470118, 0.26029621476785625, -0.40492533157295724, -0.19217694023335202, 0.16024979028662786, 0.116617123883362, 0.0915302817590216, -0.08409027291591314, -0.28568835812122784, 0.12636777113644995, -0.12067817150052378, -0.07818296774076347, -0.08640822734469597, -0.035117041025768944, 0.0072134988479575215, -0.36113522829298667, 0.09616184677853358, 0.08314745918035826, 0.025088833371067747, -0.07452050734181853, -0.13019902900329486, 0.09589318450687224, 0.11693650902682208, 0.009361024266158674, -0.06706022109990731, 0.0814672213391386, -0.08440029382990345, -0.07129109091247447, 0.3589323266772902, -0.05106005945833111, -0.24746479682704026, 0.1356307967568444, -0.13544572107145253, -0.15320587654119946, 0.13239776719122487, 0.2219847394900526, 0.1103766881256927, -0.15025061509885732, 0.11703933899839941, -0.07291896358869451, 0.13890546267755072, 0.05679261366796884, 0.05437413294535668, 0.09299037169807038, 0.1552446869408642, 0.13475506575834156, 0.1587113939408701, -0.09757022271654942, -0.058013593075787004, -0.29958023239558385, -0.12647977471445004, -0.2600401366567787, 0.014294501337382125, -0.16078350816912174, -0.17095519308458995, 0.40663051384097754, 0.1404158954846643, 0.20624227176375567, 0.10134909703909235, 0.3147095782423322, 0.12505414280424113, -0.014603155939018024, 0.08195003521389622, 0.2122886487893526, 0.2229730025528965, 0.036351026055766615, -0.18549152337174046, 0.09856693566413248, 0.07912485812476931] |
1,802.03196 | The Classification Problem for 2-Forms in Four Variables | The notion of type of a differential 2-form in four variables is introduced
and for 2-forms of type < 4, local normal models are given. If the type of a
2-form $\Omega$ is 4, then the equivalence under diffeomorphisms of $\Omega$ is
reduced to the equivalence of a symplectic linear frame functorially attached
to $\Omega$. As the equivalence problem for linear parallelisms is known, the
present work solves generically the equivalence problem under diffeomorphisms
of germs of 2-forms in 4 variables.
| math.DG | the notion of type of a differential 2form in four variables is introduced and for 2forms of type 4 local normal models are given if the type of a 2form omega is 4 then the equivalence under diffeomorphisms of omega is reduced to the equivalence of a symplectic linear frame functorially attached to omega as the equivalence problem for linear parallelisms is known the present work solves generically the equivalence problem under diffeomorphisms of germs of 2forms in 4 variables | [['the', 'notion', 'of', 'type', 'of', 'a', 'differential', '2form', 'in', 'four', 'variables', 'is', 'introduced', 'and', 'for', '2forms', 'of', 'type', '4', 'local', 'normal', 'models', 'are', 'given', 'if', 'the', 'type', 'of', 'a', '2form', 'omega', 'is', '4', 'then', 'the', 'equivalence', 'under', 'diffeomorphisms', 'of', 'omega', 'is', 'reduced', 'to', 'the', 'equivalence', 'of', 'a', 'symplectic', 'linear', 'frame', 'functorially', 'attached', 'to', 'omega', 'as', 'the', 'equivalence', 'problem', 'for', 'linear', 'parallelisms', 'is', 'known', 'the', 'present', 'work', 'solves', 'generically', 'the', 'equivalence', 'problem', 'under', 'diffeomorphisms', 'of', 'germs', 'of', '2forms', 'in', '4', 'variables']] | [-0.2437529187765904, 0.09973973175510764, -0.04436916546183056, 0.053612826130120084, -0.10261834415141494, -0.15667415718198754, -0.027479953577858394, 0.28979456685483457, -0.32596569473971615, -0.23469331330852583, 0.07116898061649408, -0.2497231115354225, -0.14060791474184953, 0.15298848945385543, -0.14004191443091257, 0.01567766207153909, 0.035455120692495255, 0.11995850945822895, -0.1319941722380463, -0.25418089439626784, 0.4552139835897833, -0.07303859794628806, 0.21735453586588846, -0.02835177349188598, 0.19192880186019465, -0.034725018177414316, 0.0016585404751822352, 0.03648487069876864, -0.09440359927830286, 0.0968815880965849, 0.2501406257294093, 0.12799956419039518, 0.21683989835437387, -0.3460131915286183, -0.12594998184358702, 0.1449022795786732, 0.09849323570379057, -0.011086522706318647, 0.03729796008847188, -0.2980088375974447, 0.11555982729187235, -0.10236418144777418, -0.16937194557394833, -0.028813995746895672, 0.1002435348520521, 0.008495800325181335, -0.26722828260390086, 0.056315561465453357, 0.14562657106434926, 0.13359936346532778, -0.12062173531739973, -0.029718466056510805, -0.05346352759806905, 0.05554832321940921, 0.048995504691265526, 0.0866183663601987, 0.097082406440677, -0.0696059937006794, -0.10445710037020035, 0.4055811230093241, -0.09643474188633264, -0.34007899123535024, 0.12644693014444783, -0.11355044977390208, -0.19030002114595845, 0.10257473298697732, 0.08701724246202502, 0.16851593577302992, -0.12909943065023982, 0.2340443049724854, -0.08163693661335855, 0.09715868370258249, 0.09883184267091565, -0.02697151078027673, 0.10376034415094182, 0.10749212225491647, 0.11430763371172362, 0.12834061054745688, 0.007336766680236906, -0.042784509979537685, -0.3989830699385493, -0.18227943626698107, -0.04072142856894061, 0.13190851788967847, -0.07854761989419785, -0.1505282269208692, 0.3705097622703761, 0.03366100434213877, 0.1537891865009442, 0.12923889575758948, 0.1914437273022486, 0.10716137196795898, 0.060752833969945644, 0.04080437761731446, 0.17157044004416094, 0.25614577806554734, -0.014188177324831486, -0.1690830546140205, -0.037556893774308264, 0.18404834510292858] |
1,802.03197 | Overdetermined problems and constant mean curvature surfaces in cones | We consider a partially overdetermined problem in a sector-like domain
$\Omega$ in a cone $\Sigma$ in $\mathbb{R}^N$, $N\geq 2$, and prove a rigidity
result of Serrin type by showing that the existence of a solution implies that
$\Omega$ is a spherical sector, under a convexity assumption on the cone. We
also consider the related question of characterizing constant mean curvature
compact surfaces $\Gamma$ with boundary which satisfy a "gluing" condition with
respect to the cone $\Sigma$. We prove that if either the cone is convex or the
surface is a radial graph then $\Gamma$ must be a spherical cap. Finally we
show that, under the condition that the relative boundary of the domain or the
surface intersects orthogonally the cone, no other assumptions are needed.
| math.AP | we consider a partially overdetermined problem in a sectorlike domain omega in a cone sigma in mathbbrn ngeq 2 and prove a rigidity result of serrin type by showing that the existence of a solution implies that omega is a spherical sector under a convexity assumption on the cone we also consider the related question of characterizing constant mean curvature compact surfaces gamma with boundary which satisfy a gluing condition with respect to the cone sigma we prove that if either the cone is convex or the surface is a radial graph then gamma must be a spherical cap finally we show that under the condition that the relative boundary of the domain or the surface intersects orthogonally the cone no other assumptions are needed | [['we', 'consider', 'a', 'partially', 'overdetermined', 'problem', 'in', 'a', 'sectorlike', 'domain', 'omega', 'in', 'a', 'cone', 'sigma', 'in', 'mathbbrn', 'ngeq', '2', 'and', 'prove', 'a', 'rigidity', 'result', 'of', 'serrin', 'type', 'by', 'showing', 'that', 'the', 'existence', 'of', 'a', 'solution', 'implies', 'that', 'omega', 'is', 'a', 'spherical', 'sector', 'under', 'a', 'convexity', 'assumption', 'on', 'the', 'cone', 'we', 'also', 'consider', 'the', 'related', 'question', 'of', 'characterizing', 'constant', 'mean', 'curvature', 'compact', 'surfaces', 'gamma', 'with', 'boundary', 'which', 'satisfy', 'a', 'gluing', 'condition', 'with', 'respect', 'to', 'the', 'cone', 'sigma', 'we', 'prove', 'that', 'if', 'either', 'the', 'cone', 'is', 'convex', 'or', 'the', 'surface', 'is', 'a', 'radial', 'graph', 'then', 'gamma', 'must', 'be', 'a', 'spherical', 'cap', 'finally', 'we', 'show', 'that', 'under', 'the', 'condition', 'that', 'the', 'relative', 'boundary', 'of', 'the', 'domain', 'or', 'the', 'surface', 'intersects', 'orthogonally', 'the', 'cone', 'no', 'other', 'assumptions', 'are', 'needed']] | [-0.17629073625057937, 0.10899059414491058, -0.10583622850477696, 0.038587110354565086, -0.10881435492634774, -0.15000511795282365, 0.012841013066470622, 0.372534228220582, -0.3062760676294565, -0.1660531959407963, 0.17290488401148468, -0.2598848301768303, -0.1389397615995258, 0.14897864025272428, -0.11100580580811947, 0.005349071459844709, 0.07352314615622163, 0.08165828255936504, -0.10061402176879346, -0.18928895603236742, 0.42268765352293847, -0.10704665671475232, 0.20091561353951692, 0.109492442490533, 0.08420010207593441, -0.010457318175584079, 0.054923231482505795, 0.08466778469085694, -0.1810544364019879, 0.10260068503674119, 0.1625774585828185, 0.10960522705316543, 0.24770177134871482, -0.39089023922383787, -0.2120468955412507, 0.15859293537214397, 0.06389859702065587, -0.0015274918684735894, -0.04356503454875201, -0.24097381007671356, 0.14800848035886885, -0.042051787570118904, -0.22995411698892712, 0.027550783954560756, 0.011377468049526215, -0.0021781163439154624, -0.2973941239416599, 0.05552061550109647, 0.1533192819490214, 0.024021090656518935, -0.10380717750266194, -0.088043212832883, -0.05902712403982878, 0.01618679356202483, 0.050056900158524514, 0.09226581272855401, 0.07789869750663637, -0.09640363360568881, -0.04750187566876411, 0.3924887529015541, -0.09098156008543447, -0.3110068204253912, 0.13432616063207387, -0.19808037378638982, -0.11420020153746009, 0.11695166473090648, 0.13218563799932598, 0.1603903976008296, -0.09245870824996381, 0.19537583949090914, -0.1303525637295097, 0.1603137327954173, 0.1414888957552612, -0.042189886697568, 0.1495047997906804, 0.09676202014461159, 0.2013986881002784, 0.14607690656511113, -0.07019307459332048, 0.007697413373738527, -0.40469422686100004, -0.18054512498527767, -0.1598572473619133, 0.11035290629044175, -0.08892677081178409, -0.17122017547674478, 0.31679898434877396, 0.01519471736252308, 0.2082844310849905, 0.09654010631609708, 0.23329859563708305, 0.09324770914204418, 0.004260940534994006, 0.1392216508174315, 0.19194891186058521, 0.14280875672399998, -0.01225742418691516, -0.19099791481345893, 0.03018312577344477, 0.09994331327080727] |
1,802.03198 | Natural Language Inference over Interaction Space: ICLR 2018
Reproducibility Report | We have tried to reproduce the results of the paper "Natural Language
Inference over Interaction Space" submitted to ICLR 2018 conference as part of
the ICLR 2018 Reproducibility Challenge. Initially, we were not aware that the
code was available, so we started to implement the network from scratch. We
have evaluated our version of the model on Stanford NLI dataset and reached
86.38% accuracy on the test set, while the paper claims 88.0% accuracy. The
main difference, as we understand it, comes from the optimizers and the way
model selection is performed.
| cs.CL | we have tried to reproduce the results of the paper natural language inference over interaction space submitted to iclr 2018 conference as part of the iclr 2018 reproducibility challenge initially we were not aware that the code was available so we started to implement the network from scratch we have evaluated our version of the model on stanford nli dataset and reached 8638 accuracy on the test set while the paper claims 880 accuracy the main difference as we understand it comes from the optimizers and the way model selection is performed | [['we', 'have', 'tried', 'to', 'reproduce', 'the', 'results', 'of', 'the', 'paper', 'natural', 'language', 'inference', 'over', 'interaction', 'space', 'submitted', 'to', 'iclr', '2018', 'conference', 'as', 'part', 'of', 'the', 'iclr', '2018', 'reproducibility', 'challenge', 'initially', 'we', 'were', 'not', 'aware', 'that', 'the', 'code', 'was', 'available', 'so', 'we', 'started', 'to', 'implement', 'the', 'network', 'from', 'scratch', 'we', 'have', 'evaluated', 'our', 'version', 'of', 'the', 'model', 'on', 'stanford', 'nli', 'dataset', 'and', 'reached', '8638', 'accuracy', 'on', 'the', 'test', 'set', 'while', 'the', 'paper', 'claims', '880', 'accuracy', 'the', 'main', 'difference', 'as', 'we', 'understand', 'it', 'comes', 'from', 'the', 'optimizers', 'and', 'the', 'way', 'model', 'selection', 'is', 'performed']] | [-0.022800766699179843, -0.04199843864458112, -0.08021544805308292, 0.04782699168516466, -0.08450310888116831, -0.09355691481627278, 0.05175329737907664, 0.4034164003454722, -0.1946223721952065, -0.4002519007465178, 0.1119083866456544, -0.30844509549398014, -0.13288150689857922, 0.1951407685333474, -0.11110031695340525, 0.07403654596451056, 0.13325007957314233, 0.03583210011800894, -0.0023563044468084206, -0.35247178191503326, 0.3009478478503137, 0.12851685223138923, 0.30877702214990504, 0.06310845771804452, 0.11372433243841343, -0.054871335139518584, -0.06891760607710579, -0.005656638250821833, -0.10675032493943964, 0.10269018111924468, 0.2318213867070921, 0.19410630596985856, 0.30341066767533237, -0.4049177786724253, -0.15237888397014404, 0.0609493651376157, 0.08831504787635672, 0.12690039961035926, 0.006220854064040295, -0.2977709871931718, 0.0818960036018065, -0.20386621311523154, -0.03939525960627329, -0.07577913227890219, 0.0018128412417494333, -0.05541696786371336, -0.21059587088561935, 0.0152907285962131, 0.08309694052070052, 0.08235261461359787, -0.0453382608235128, -0.13172008643172436, 0.00643143819767859, 0.18095666342056715, 0.02839413025815572, 0.10279553836457185, 0.09385456788036359, -0.07745416156159571, -0.13164940477440973, 0.40318490594246803, -0.08856797699335513, -0.12436894576095946, 0.23195236978366726, -0.08257765063995516, -0.1623481768081067, 0.03650490740048034, 0.23901441391393707, 0.08692233423589842, -0.16399674279267315, 0.07698109526325345, -0.05062473882603776, 0.20033711784488553, 0.0702006976058768, -0.07765008549072913, 0.16352786188740487, 0.21565891817662414, -0.03513525200721163, 0.13175714522303378, -0.09884855787239068, -0.07718815365908566, -0.2904011081689252, -0.10367038083559536, -0.18459433203071848, -0.010049816988412404, 0.05145885048281903, -0.08410381783403784, 0.40564086075851713, 0.2772423832339572, 0.16173659782385924, 0.07887155368698986, 0.2674875934045393, 0.02914103162030377, 0.07395713698825093, 0.10523755787001861, 0.24779780376907234, 0.03606404549094265, 0.16414117770765876, -0.1615563593497807, 0.08151215930459099, 0.04386352744704409] |
1,802.03199 | N\'{e}el Spin Orbit Torque driven antiferromagnetic resonance in
Mn$_{2}$Au probed by time-domain THz spectroscopy | We observe the excitation of collective modes in the THz range driven by the
recently discovered N\'{e}el spin-orbit torques (NSOT) in the metallic
antiferromagnet Mn$_{2}$Au. Temperature dependent THz spectroscopy reveals a
strong absorption mode centered near 1 THz, which upon heating from 4 K to 450
K softens and looses intensity. Comparison with the estimated eigenmode
frequencies implies that the observed mode is an in-plane antiferromagnetic
resonance (AFMR) mode. The AFMR absorption strength exceeds those found in
antiferromagnetic insulators, driven by the magnetic field of the THz
radiation, by three orders of magnitude. Based on this and the agreement with
our theory modelling, we infer that the driving mechanism for the observed mode
is the current induced NSOT. This electric manipulation of the Ne\'{e}l order
parameter at high frequencies makes Mn$_{2}$Au a prime candidate for AFM
ultrafast memory applications.
| cond-mat.str-el cond-mat.mtrl-sci | we observe the excitation of collective modes in the thz range driven by the recently discovered neel spinorbit torques nsot in the metallic antiferromagnet mn_2au temperature dependent thz spectroscopy reveals a strong absorption mode centered near 1 thz which upon heating from 4 k to 450 k softens and looses intensity comparison with the estimated eigenmode frequencies implies that the observed mode is an inplane antiferromagnetic resonance afmr mode the afmr absorption strength exceeds those found in antiferromagnetic insulators driven by the magnetic field of the thz radiation by three orders of magnitude based on this and the agreement with our theory modelling we infer that the driving mechanism for the observed mode is the current induced nsot this electric manipulation of the neel order parameter at high frequencies makes mn_2au a prime candidate for afm ultrafast memory applications | [['we', 'observe', 'the', 'excitation', 'of', 'collective', 'modes', 'in', 'the', 'thz', 'range', 'driven', 'by', 'the', 'recently', 'discovered', 'neel', 'spinorbit', 'torques', 'nsot', 'in', 'the', 'metallic', 'antiferromagnet', 'mn_2au', 'temperature', 'dependent', 'thz', 'spectroscopy', 'reveals', 'a', 'strong', 'absorption', 'mode', 'centered', 'near', '1', 'thz', 'which', 'upon', 'heating', 'from', '4', 'k', 'to', '450', 'k', 'softens', 'and', 'looses', 'intensity', 'comparison', 'with', 'the', 'estimated', 'eigenmode', 'frequencies', 'implies', 'that', 'the', 'observed', 'mode', 'is', 'an', 'inplane', 'antiferromagnetic', 'resonance', 'afmr', 'mode', 'the', 'afmr', 'absorption', 'strength', 'exceeds', 'those', 'found', 'in', 'antiferromagnetic', 'insulators', 'driven', 'by', 'the', 'magnetic', 'field', 'of', 'the', 'thz', 'radiation', 'by', 'three', 'orders', 'of', 'magnitude', 'based', 'on', 'this', 'and', 'the', 'agreement', 'with', 'our', 'theory', 'modelling', 'we', 'infer', 'that', 'the', 'driving', 'mechanism', 'for', 'the', 'observed', 'mode', 'is', 'the', 'current', 'induced', 'nsot', 'this', 'electric', 'manipulation', 'of', 'the', 'neel', 'order', 'parameter', 'at', 'high', 'frequencies', 'makes', 'mn_2au', 'a', 'prime', 'candidate', 'for', 'afm', 'ultrafast', 'memory', 'applications']] | [-0.20227119099879026, 0.23213517907626643, 0.0064068262764409075, -0.02406392036427329, -0.07729136001447855, -0.11040199420883925, 0.07568325622799214, 0.41576508236845044, -0.24476492344435766, -0.3014743275750075, 0.01436636910729627, -0.31227033832076473, -0.081810531209828, 0.21790977394255898, 0.11605031336963612, -0.03191206128484982, -0.05551073168417996, 0.0013612833581049077, -0.012036773128040733, -0.11912880099997142, 0.24049464274320181, 0.04281626615641863, 0.33087402959711115, 0.056688570764160506, 0.06891889705315885, 0.003383743476860198, 0.08330074816017691, -0.04216823955984229, -0.15913560522780124, 0.03739319560219989, 0.2693290264909937, -0.10055294795383285, 0.2228414602611676, -0.38660289460358066, -0.2104868592395291, 0.009633670912810812, 0.1380654475787641, 0.11293439897045793, -0.03923809172731763, -0.27649271844743484, 0.044884758980190176, -0.11193431486260064, -0.1397470275091388, -0.08649997854007095, 0.01860946525707433, -0.02778598687944621, -0.30685046171755903, 0.10942429852592045, 0.08111860614990557, 0.13842444814891167, -0.11978131994931367, -0.11972862624828398, -0.0680824566418373, 0.0013134037888010651, 0.06201535579918401, 0.09911689456606651, 0.17978536420889255, -0.11945730852673551, -0.14124333785751658, 0.32302039359308726, -0.10502192640700887, 0.003802722865498088, 0.1623986017478997, -0.2283391088050158, -0.024180682115154818, 0.23226088152205857, 0.07446212940135577, 0.09829233236692465, -0.07786206294694085, 0.044890297659210536, 0.058417762989980464, 0.2407968770202766, 0.08899966944145025, 0.08900116714023276, 0.2808710426010572, 0.1813436106491467, 0.014559655988174252, 0.15310742972880928, -0.17067336513878384, -0.011328876174877595, -0.20613171071167627, -0.07074945981539514, -0.220911267657941, 0.05113173701781711, -0.08215953514339355, -0.11491858062715045, 0.40510586786838454, 0.19613737103794396, 0.14174891811843118, -0.05298925038634453, 0.28894207733989197, 0.16357283178720297, 0.08177422445240247, 0.04877248849638187, 0.3439919008893797, 0.18775808144816244, 0.14068458812569615, -0.3252371796355821, 0.016423474805239233, -0.03820764144413499] |
1,802.032 | Reducing cavity-pulling shift in Ramsey-operated compact clocks | We describe a method to stabilize the amplitude of the interrogating
microwave field in compact atomic clocks working in a Ramsey approach. In this
technique, we take advantage of the pulsed regime to use the atoms themselves
as microwave amplitude discriminators. Specifically, in addition to the
dependence on the microwave detuning, the atomic signal after the Ramsey
interrogation acquires a dependence on the microwave pulse area (amplitude
times duration) that can be exploited to implement an active stabilization of
the microwave field amplitude, in a similar way in which the Ramsey clock
signal is used to lock the local oscillator frequency to the atomic reference.
This stabilization results in a reduced sensitivity of the clock frequency to
microwave amplitude fluctuations that are transferred to the atoms through the
cavity-pulling effect. The proposed technique is then effective to improve the
clock stability and drift on medium and long term. We demonstrate the method
for a vapor-cell clock working with a hot sample of atoms but it can be
extended to cold-atom compact clocks.
| physics.atom-ph | we describe a method to stabilize the amplitude of the interrogating microwave field in compact atomic clocks working in a ramsey approach in this technique we take advantage of the pulsed regime to use the atoms themselves as microwave amplitude discriminators specifically in addition to the dependence on the microwave detuning the atomic signal after the ramsey interrogation acquires a dependence on the microwave pulse area amplitude times duration that can be exploited to implement an active stabilization of the microwave field amplitude in a similar way in which the ramsey clock signal is used to lock the local oscillator frequency to the atomic reference this stabilization results in a reduced sensitivity of the clock frequency to microwave amplitude fluctuations that are transferred to the atoms through the cavitypulling effect the proposed technique is then effective to improve the clock stability and drift on medium and long term we demonstrate the method for a vaporcell clock working with a hot sample of atoms but it can be extended to coldatom compact clocks | [['we', 'describe', 'a', 'method', 'to', 'stabilize', 'the', 'amplitude', 'of', 'the', 'interrogating', 'microwave', 'field', 'in', 'compact', 'atomic', 'clocks', 'working', 'in', 'a', 'ramsey', 'approach', 'in', 'this', 'technique', 'we', 'take', 'advantage', 'of', 'the', 'pulsed', 'regime', 'to', 'use', 'the', 'atoms', 'themselves', 'as', 'microwave', 'amplitude', 'discriminators', 'specifically', 'in', 'addition', 'to', 'the', 'dependence', 'on', 'the', 'microwave', 'detuning', 'the', 'atomic', 'signal', 'after', 'the', 'ramsey', 'interrogation', 'acquires', 'a', 'dependence', 'on', 'the', 'microwave', 'pulse', 'area', 'amplitude', 'times', 'duration', 'that', 'can', 'be', 'exploited', 'to', 'implement', 'an', 'active', 'stabilization', 'of', 'the', 'microwave', 'field', 'amplitude', 'in', 'a', 'similar', 'way', 'in', 'which', 'the', 'ramsey', 'clock', 'signal', 'is', 'used', 'to', 'lock', 'the', 'local', 'oscillator', 'frequency', 'to', 'the', 'atomic', 'reference', 'this', 'stabilization', 'results', 'in', 'a', 'reduced', 'sensitivity', 'of', 'the', 'clock', 'frequency', 'to', 'microwave', 'amplitude', 'fluctuations', 'that', 'are', 'transferred', 'to', 'the', 'atoms', 'through', 'the', 'cavitypulling', 'effect', 'the', 'proposed', 'technique', 'is', 'then', 'effective', 'to', 'improve', 'the', 'clock', 'stability', 'and', 'drift', 'on', 'medium', 'and', 'long', 'term', 'we', 'demonstrate', 'the', 'method', 'for', 'a', 'vaporcell', 'clock', 'working', 'with', 'a', 'hot', 'sample', 'of', 'atoms', 'but', 'it', 'can', 'be', 'extended', 'to', 'coldatom', 'compact', 'clocks']] | [-0.14012607958487255, 0.20226289390467533, -0.07354606865082196, 0.00971927849012752, -0.04859241675098189, -0.10467029554325394, 0.10015693216497988, 0.4199545355621985, -0.2512628645311261, -0.2765115164815946, 0.06648128229696953, -0.21161072979529583, -0.07724411631555318, 0.23788317168797474, -0.04397294327595033, 0.01673619870941133, -0.0038651675432595576, 0.048240353255857564, 0.002657136842635525, -0.197467430968509, 0.22013355673529034, 0.11540590396738439, 0.320999858538122, -0.01408837822558315, 0.11765931326040435, -0.022684643204800438, 0.02699143928475678, -0.0052974763607909515, -0.08885413766501886, 0.08718637870841248, 0.22206727188990213, 0.07328263659918205, 0.2306341658248891, -0.44345412535983275, -0.21621779892133375, 0.12915031046086792, 0.13010958287875754, 0.21500353212789822, -0.029521861260480703, -0.3105248832306283, -0.0022107276193754273, -0.14775569534449037, -0.13066587712599484, -0.086650088799848, 0.017440908465285374, 0.04517028328616086, -0.27533286282735836, 0.0180544264621012, 0.04637143845396823, 0.03703684703078727, -0.03785487055591697, -0.0026527363075983038, 0.07447600422621986, 0.09051689425440029, -0.03844722797065367, 0.05684488115637282, 0.17859990506021436, -0.05333198980985989, -0.09085592402072168, 0.361859854213287, -0.17965725202351635, -0.1395503162138359, 0.1422580784754584, -0.16153211646908244, -0.07684500241614228, 0.11437950901643829, 0.17136568835866095, 0.0558998984268455, -0.11693309084376927, 0.059358005860663386, 0.056994548007889195, 0.26758692881531015, 0.13700239697124722, 0.11236093239858747, 0.19490073129892088, 0.1780902098994269, 0.08496987840924196, 0.1560826534594864, -0.11931263034768012, -0.03706508441719898, -0.2418345682712835, -0.08392567069118782, -0.19009530288844131, 0.0352075164271302, -0.05762856795576396, -0.14378648574009192, 0.4157572576916928, 0.18918181570560866, 0.16223968788683632, -0.03318634790640465, 0.3757716164312347, 0.12355396152016447, 0.09677594443674871, -0.02382023582711469, 0.2930845924339062, 0.1844233901478177, 0.11383689297796336, -0.29627597739995826, -0.021376014901000228, 0.021966363996948214] |
1,802.03201 | Freestyle, a randomized version of ChaCha for resisting offline
brute-force and dictionary attacks | This paper introduces Freestyle, a randomized and variable round version of
the ChaCha cipher. Freestyle uses the concept of hash based halting condition
where a decryption attempt with an incorrect key is likely to take longer time
to halt. This makes Freestyle resistant to key-guessing attacks i.e.
brute-force and dictionary based attacks. Freestyle demonstrates a novel
approach for ciphertext randomization by using random number of rounds for each
block, where the exact number of rounds are unknown to the receiver in advance.
Freestyle provides the possibility of generating $2^{128}$ different
ciphertexts for a given key, nonce, and message; thus resisting key and nonce
reuse attacks. Due to its inherent random behavior, Freestyle makes
cryptanalysis through known-plaintext, chosen-plaintext, and chosen-ciphertext
attacks difficult in practice. On the other hand, Freestyle has costlier cipher
initialization process, typically generates 3.125% larger ciphertext, and was
found to be 1.6 to 3.2 times slower than ChaCha20. Freestyle is suitable for
applications that favor ciphertext randomization and resistance to key-guessing
and key reuse attacks over performance and ciphertext size. Freestyle is ideal
for applications where ciphertext can be assumed to be in full control of an
adversary, and an offline key-guessing attack can be carried out.
| cs.CR | this paper introduces freestyle a randomized and variable round version of the chacha cipher freestyle uses the concept of hash based halting condition where a decryption attempt with an incorrect key is likely to take longer time to halt this makes freestyle resistant to keyguessing attacks ie bruteforce and dictionary based attacks freestyle demonstrates a novel approach for ciphertext randomization by using random number of rounds for each block where the exact number of rounds are unknown to the receiver in advance freestyle provides the possibility of generating 2128 different ciphertexts for a given key nonce and message thus resisting key and nonce reuse attacks due to its inherent random behavior freestyle makes cryptanalysis through knownplaintext chosenplaintext and chosenciphertext attacks difficult in practice on the other hand freestyle has costlier cipher initialization process typically generates 3125 larger ciphertext and was found to be 16 to 32 times slower than chacha20 freestyle is suitable for applications that favor ciphertext randomization and resistance to keyguessing and key reuse attacks over performance and ciphertext size freestyle is ideal for applications where ciphertext can be assumed to be in full control of an adversary and an offline keyguessing attack can be carried out | [['this', 'paper', 'introduces', 'freestyle', 'a', 'randomized', 'and', 'variable', 'round', 'version', 'of', 'the', 'chacha', 'cipher', 'freestyle', 'uses', 'the', 'concept', 'of', 'hash', 'based', 'halting', 'condition', 'where', 'a', 'decryption', 'attempt', 'with', 'an', 'incorrect', 'key', 'is', 'likely', 'to', 'take', 'longer', 'time', 'to', 'halt', 'this', 'makes', 'freestyle', 'resistant', 'to', 'keyguessing', 'attacks', 'ie', 'bruteforce', 'and', 'dictionary', 'based', 'attacks', 'freestyle', 'demonstrates', 'a', 'novel', 'approach', 'for', 'ciphertext', 'randomization', 'by', 'using', 'random', 'number', 'of', 'rounds', 'for', 'each', 'block', 'where', 'the', 'exact', 'number', 'of', 'rounds', 'are', 'unknown', 'to', 'the', 'receiver', 'in', 'advance', 'freestyle', 'provides', 'the', 'possibility', 'of', 'generating', '2128', 'different', 'ciphertexts', 'for', 'a', 'given', 'key', 'nonce', 'and', 'message', 'thus', 'resisting', 'key', 'and', 'nonce', 'reuse', 'attacks', 'due', 'to', 'its', 'inherent', 'random', 'behavior', 'freestyle', 'makes', 'cryptanalysis', 'through', 'knownplaintext', 'chosenplaintext', 'and', 'chosenciphertext', 'attacks', 'difficult', 'in', 'practice', 'on', 'the', 'other', 'hand', 'freestyle', 'has', 'costlier', 'cipher', 'initialization', 'process', 'typically', 'generates', '3125', 'larger', 'ciphertext', 'and', 'was', 'found', 'to', 'be', '16', 'to', '32', 'times', 'slower', 'than', 'chacha20', 'freestyle', 'is', 'suitable', 'for', 'applications', 'that', 'favor', 'ciphertext', 'randomization', 'and', 'resistance', 'to', 'keyguessing', 'and', 'key', 'reuse', 'attacks', 'over', 'performance', 'and', 'ciphertext', 'size', 'freestyle', 'is', 'ideal', 'for', 'applications', 'where', 'ciphertext', 'can', 'be', 'assumed', 'to', 'be', 'in', 'full', 'control', 'of', 'an', 'adversary', 'and', 'an', 'offline', 'keyguessing', 'attack', 'can', 'be', 'carried', 'out']] | [-0.15601579905463958, 0.048539017534771633, -0.09217817189767578, 0.03489751091703123, -0.11426757406892472, -0.30368371830005103, 0.11688230768009207, 0.33847680920262246, -0.270626831605917, -0.271821200166862, 0.1578143076494875, -0.23975034225093872, -0.123150871618093, 0.1917504589758851, -0.1934550644783776, 0.10552212337787183, -0.010865302869889336, 0.003631551674363879, 0.015031935864596198, -0.334861797954282, 0.27028552607897915, 0.10986840053636411, 0.2983179849532296, -0.01441019911999781, 0.08858129511830198, 0.03401115268166295, -0.017542006154804664, -0.07152682279477718, -0.041712125431373065, 0.0374683712202545, 0.27787021856499733, 0.204485661735484, 0.34692066506988506, -0.4118449882755463, -0.1236897987280476, 0.0953260145928985, 0.15861524126449894, 0.16859260573037688, -0.04789409735700976, -0.28712774526214385, 0.18244884073081885, -0.20109220467351832, -0.04734399844537759, -0.06783008780791354, 0.028415305979625525, -0.015808746404236722, -0.31756502847059576, -0.008067780164859924, 0.051052612710069285, 0.02934820308506035, 0.06848053372320885, -0.062916999942798, 0.06353455828975527, 0.11973063487838481, 0.03952682905267276, 0.05281734879147545, 0.15469688419630837, -0.06066786920708524, -0.126576773140362, 0.36673434400637894, 0.0007645743599883635, -0.15418056475925188, 0.14632609674380856, -0.01070928603628187, -0.10727734261559947, 0.14087482576310484, 0.18303083093732897, 0.11095513751597952, -0.11633498720389786, -0.01630499909412078, -0.020573462725990466, 0.27352089721882045, 0.09489904169990743, 0.048975498185062846, 0.11329461169325118, 0.1375577007597643, 0.09683658196449015, 0.1551005916039431, -0.07002826869076467, -0.08566181327046136, -0.20860483049743614, -0.15951967183713267, -0.20485621313848132, 0.055395655057435565, -0.07946122826835221, -0.12575236249355798, 0.33601227743896245, 0.23035098998074605, 0.16771473358787103, 0.06927755811171332, 0.3797707044836228, 0.0068348355893858796, 0.09865481841087172, 0.14772002884248261, 0.13422509655356407, 0.043265210749430176, 0.052395087792107456, -0.14407714380088457, 0.22646120869729497, 0.041553869240723434] |
1,802.03202 | On the completeness and orthonormality of the Volkov states and the
Volkov propagator in configuration space | Volkov states and Volkov propagator are the basic analytical tools to
investigate QED processes occurring in the presence of an intense plane-wave
electromagnetic field. In the present paper we provide alternative and
relatively simple proofs of the completeness and of the orthonormality at a
fixed time of the Volkov states. Concerning the completeness, we exploit some
known properties of the Green's function of the Dirac operator in a plane wave,
whereas the orthonormality of the Volkov states is proved, relying only on a
geometric argument based on the Gauss theorem in four dimensions. In relation
with the completeness of the Volkov states, we also study some analytical
properties of the Green's function of the Dirac operator in a plane wave, which
we explicitly prove to coincide with the Volkov propagator in configuration
space. In particular, a closed-form expression in terms of modified Bessel
functions and Hankel functions is derived by means of the operator technique in
a plane wave and different asymptotic forms are determined. Finally, the
transformation properties of the Volkov propagator under general gauge
transformations and a general gauge-invariant expression of the so-called
dressed mass in configuration space are presented.
| hep-ph | volkov states and volkov propagator are the basic analytical tools to investigate qed processes occurring in the presence of an intense planewave electromagnetic field in the present paper we provide alternative and relatively simple proofs of the completeness and of the orthonormality at a fixed time of the volkov states concerning the completeness we exploit some known properties of the greens function of the dirac operator in a plane wave whereas the orthonormality of the volkov states is proved relying only on a geometric argument based on the gauss theorem in four dimensions in relation with the completeness of the volkov states we also study some analytical properties of the greens function of the dirac operator in a plane wave which we explicitly prove to coincide with the volkov propagator in configuration space in particular a closedform expression in terms of modified bessel functions and hankel functions is derived by means of the operator technique in a plane wave and different asymptotic forms are determined finally the transformation properties of the volkov propagator under general gauge transformations and a general gaugeinvariant expression of the socalled dressed mass in configuration space are presented | [['volkov', 'states', 'and', 'volkov', 'propagator', 'are', 'the', 'basic', 'analytical', 'tools', 'to', 'investigate', 'qed', 'processes', 'occurring', 'in', 'the', 'presence', 'of', 'an', 'intense', 'planewave', 'electromagnetic', 'field', 'in', 'the', 'present', 'paper', 'we', 'provide', 'alternative', 'and', 'relatively', 'simple', 'proofs', 'of', 'the', 'completeness', 'and', 'of', 'the', 'orthonormality', 'at', 'a', 'fixed', 'time', 'of', 'the', 'volkov', 'states', 'concerning', 'the', 'completeness', 'we', 'exploit', 'some', 'known', 'properties', 'of', 'the', 'greens', 'function', 'of', 'the', 'dirac', 'operator', 'in', 'a', 'plane', 'wave', 'whereas', 'the', 'orthonormality', 'of', 'the', 'volkov', 'states', 'is', 'proved', 'relying', 'only', 'on', 'a', 'geometric', 'argument', 'based', 'on', 'the', 'gauss', 'theorem', 'in', 'four', 'dimensions', 'in', 'relation', 'with', 'the', 'completeness', 'of', 'the', 'volkov', 'states', 'we', 'also', 'study', 'some', 'analytical', 'properties', 'of', 'the', 'greens', 'function', 'of', 'the', 'dirac', 'operator', 'in', 'a', 'plane', 'wave', 'which', 'we', 'explicitly', 'prove', 'to', 'coincide', 'with', 'the', 'volkov', 'propagator', 'in', 'configuration', 'space', 'in', 'particular', 'a', 'closedform', 'expression', 'in', 'terms', 'of', 'modified', 'bessel', 'functions', 'and', 'hankel', 'functions', 'is', 'derived', 'by', 'means', 'of', 'the', 'operator', 'technique', 'in', 'a', 'plane', 'wave', 'and', 'different', 'asymptotic', 'forms', 'are', 'determined', 'finally', 'the', 'transformation', 'properties', 'of', 'the', 'volkov', 'propagator', 'under', 'general', 'gauge', 'transformations', 'and', 'a', 'general', 'gaugeinvariant', 'expression', 'of', 'the', 'socalled', 'dressed', 'mass', 'in', 'configuration', 'space', 'are', 'presented']] | [-0.1613662707051541, 0.10096269132744358, -0.112718379990838, 0.11199781033428735, -0.06485527282954233, -0.04893009130076583, 0.05289090210802291, 0.3378352524887305, -0.1919059401601165, -0.23721479723584102, 0.0563289476006806, -0.26439415953548934, -0.18919888243059782, 0.1699703207317119, 0.003937483084882842, 0.07101631944048374, 0.010744338497412778, 0.050720873818894084, -0.12919076696562115, -0.20060580219615076, 0.3735436200161833, 0.00139780952304136, 0.24307845403867154, 0.05618503565498637, 0.09387799723238761, 0.07785438324269005, -0.023639080580323935, -0.040436858464393786, -0.1193865971096481, 0.10211374123718997, 0.1844736805287539, 0.1132602159268572, 0.22751990280812606, -0.4214577379170805, -0.16739281345022997, 0.03354106529695855, 0.1297545607746239, 0.11429323187606617, -0.04212987272815857, -0.31522278595366515, 0.02454665411884586, -0.12393159223089849, -0.22551004904441166, -0.07143275436828844, 0.001721751042471927, 0.04714608441402864, -0.2567831105892158, 0.06691985163212166, 0.06010571704731168, 0.030371825026425842, -0.08206767059103488, -0.11295510205915586, -0.03599909922437897, 0.05985623582091648, 0.025213801223192906, 0.03891486434319328, 0.05126914533286708, -0.13532602024497464, -0.10169120943737653, 0.34941625711508095, -0.07011573419761892, -0.26510706106197784, 0.1441700246699232, -0.18169483279052656, -0.11522454253281467, 0.1017986602385766, 0.11341241742290246, 0.1566816270375663, -0.18513022367066392, 0.15968885437723657, -0.06690045213789138, 0.09267434721550671, 0.14798058738476053, 0.09136970386862231, 0.12581884535272062, 0.054941389491432346, 0.029658864897404175, 0.17832815501606092, -0.00708571065479191, -0.104050116831786, -0.36205676246026997, -0.1629119058343349, -0.19294450396834387, 0.0491258321424084, -0.08793427244813756, -0.20638294364713752, 0.43825729329303914, 0.11938202092035984, 0.13402427260158825, 0.04536531149096845, 0.2526896689475204, 0.22082119292220645, 0.013536048621366112, 0.06149619538822056, 0.24007268072606772, 0.18614916607475607, 0.0712001922026199, -0.21407510015948597, -0.02858603376080282, 0.14500525220743535] |
1,802.03203 | Curve Registered Coupled Low Rank Factorization | We propose an extension of the canonical polyadic (CP) tensor model where one
of the latent factors is allowed to vary through data slices in a constrained
way. The components of the latent factors, which we want to retrieve from data,
can vary from one slice to another up to a diffeomorphism. We suppose that the
diffeomorphisms are also unknown, thus merging curve registration and tensor
decomposition in one model, which we call registered CP. We present an
algorithm to retrieve both the latent factors and the diffeomorphism, which is
assumed to be in a parametrized form. At the end of the paper, we show
simulation results comparing registered CP with other models from the
literature.
| stat.ML cs.LG | we propose an extension of the canonical polyadic cp tensor model where one of the latent factors is allowed to vary through data slices in a constrained way the components of the latent factors which we want to retrieve from data can vary from one slice to another up to a diffeomorphism we suppose that the diffeomorphisms are also unknown thus merging curve registration and tensor decomposition in one model which we call registered cp we present an algorithm to retrieve both the latent factors and the diffeomorphism which is assumed to be in a parametrized form at the end of the paper we show simulation results comparing registered cp with other models from the literature | [['we', 'propose', 'an', 'extension', 'of', 'the', 'canonical', 'polyadic', 'cp', 'tensor', 'model', 'where', 'one', 'of', 'the', 'latent', 'factors', 'is', 'allowed', 'to', 'vary', 'through', 'data', 'slices', 'in', 'a', 'constrained', 'way', 'the', 'components', 'of', 'the', 'latent', 'factors', 'which', 'we', 'want', 'to', 'retrieve', 'from', 'data', 'can', 'vary', 'from', 'one', 'slice', 'to', 'another', 'up', 'to', 'a', 'diffeomorphism', 'we', 'suppose', 'that', 'the', 'diffeomorphisms', 'are', 'also', 'unknown', 'thus', 'merging', 'curve', 'registration', 'and', 'tensor', 'decomposition', 'in', 'one', 'model', 'which', 'we', 'call', 'registered', 'cp', 'we', 'present', 'an', 'algorithm', 'to', 'retrieve', 'both', 'the', 'latent', 'factors', 'and', 'the', 'diffeomorphism', 'which', 'is', 'assumed', 'to', 'be', 'in', 'a', 'parametrized', 'form', 'at', 'the', 'end', 'of', 'the', 'paper', 'we', 'show', 'simulation', 'results', 'comparing', 'registered', 'cp', 'with', 'other', 'models', 'from', 'the', 'literature']] | [-0.08208250120916435, 0.09428500082039731, -0.10975045946442746, 0.03800932621254168, -0.1254643307966662, -0.1289909683240192, 0.043946254421386804, 0.37340771721611765, -0.3360658648427865, -0.2973888531038216, 0.09734928583152239, -0.2769983633027958, -0.1410856443850709, 0.1449323647358487, -0.05490123917918716, -0.0028201673372552313, 0.02006873442060796, 0.0669970794757507, -0.10808601607528419, -0.22477929246740352, 0.34664191670137745, 0.007870168694102302, 0.23462881800590146, -0.008555097152189961, 0.11685474511388497, -0.04199897193606814, -0.06656185646364786, 0.015454530017450452, -0.1014847553494825, 0.12611609562460718, 0.24702424190051936, 0.17785018488186702, 0.19214376460375457, -0.3905719750448419, -0.18398097811812728, 0.14993247973074303, 0.13256907102788382, 0.08588975320413612, 0.00222042183680781, -0.27686938115170806, 0.07550429502401224, -0.1653356135377243, -0.07926878823641816, -0.09158130767273492, -0.040563688468958796, -0.054867922733859, -0.3098782841999341, 0.05393252852307592, 0.012184700872427944, 0.008585514496722868, -0.08609119706369679, -0.08147101870994887, -0.013607774511910975, 0.1655280496242681, 0.09225164785186343, 0.059040180937354934, 0.10667113117183205, -0.11001790671585256, -0.10024401511101791, 0.4141937003406728, -0.0818861635915678, -0.2518955624972446, 0.14569603880979762, -0.13211142937733053, -0.19687258895759568, 0.1083555618052146, 0.1885522512542405, 0.1144777044958981, -0.1657067678571711, 0.05584870975821857, -0.0731274239831315, 0.1660939201507878, 0.0350374827956267, -0.04229920406039033, 0.16576703565580578, 0.10066007047185097, 0.05568142022262879, 0.15887576880902934, -0.09454333414684916, -0.0681646010087771, -0.30251244301426, -0.16157727794529037, -0.15068737671566035, 0.024256825792314165, -0.0921862038042585, -0.13182904428384942, 0.4280216291863953, 0.17483019800294705, 0.2484455181873837, 0.0428996966651978, 0.2892939214241402, 0.08493634261158776, 0.09723604568440852, 0.11146957695419932, 0.17738180904617085, 0.10596448935945679, 0.049290097740093436, -0.15531391292561553, 0.04895430461078047, 0.03323102956798313] |
1,802.03204 | The Betti map associated to a section of an abelian scheme (with an
appendix by Z. Gao) | Given a point $\xi$ on a complex abelian variety $A$, its abelian logarithm
can be expressed as a linear combination of the periods of $A$ with real
coefficients, the Betti coordinates of $\xi$. When $(A, \xi)$ varies in an
algebraic family, these coordinates define a system of multivalued
real-analytic functions. Computing its rank (in the sense of differential
geometry) becomes important when one is interested about how often $\xi$ takes
a torsion value (for instance, Manin's theorem of the kernel implies that this
coordinate system is constant in a family without fixed part only when $\xi$ is
a torsion section).
We compute this rank in terms of the rank of a certain contracted form of the
Kodaira-Spencer map associated to $(A, \xi)$ (assuming $A$ without fixed part,
and $\mathbb{Z} \xi$ Zariski-dense in $A$), and deduce some explicit lower
bounds in special situations. For instance, we determine this rank in relative
dimension $\leq 3$, and study in detail the case of jacobians of families of
hyperelliptic curves.
Our main application, obtained in collaboration with Z. Gao, states that if
$A\to S$ is a principally polarized abelian scheme of relative dimension $g$
which has no non-trivial endomorphism (on any finite covering), and if the
image of $S$ in the moduli space $\mathcal{A}_g$ has dimension at least $g$,
then the Betti map of any non-torsion section $\xi$ is generically a
submersion, so that $\xi^{-1}A_{tors}$ is dense in $S(\mathbb{C})$.
| math.AG math.NT | given a point xi on a complex abelian variety a its abelian logarithm can be expressed as a linear combination of the periods of a with real coefficients the betti coordinates of xi when a xi varies in an algebraic family these coordinates define a system of multivalued realanalytic functions computing its rank in the sense of differential geometry becomes important when one is interested about how often xi takes a torsion value for instance manins theorem of the kernel implies that this coordinate system is constant in a family without fixed part only when xi is a torsion section we compute this rank in terms of the rank of a certain contracted form of the kodairaspencer map associated to a xi assuming a without fixed part and mathbbz xi zariskidense in a and deduce some explicit lower bounds in special situations for instance we determine this rank in relative dimension leq 3 and study in detail the case of jacobians of families of hyperelliptic curves our main application obtained in collaboration with z gao states that if ato s is a principally polarized abelian scheme of relative dimension g which has no nontrivial endomorphism on any finite covering and if the image of s in the moduli space mathcala_g has dimension at least g then the betti map of any nontorsion section xi is generically a submersion so that xi1a_tors is dense in smathbbc | [['given', 'a', 'point', 'xi', 'on', 'a', 'complex', 'abelian', 'variety', 'a', 'its', 'abelian', 'logarithm', 'can', 'be', 'expressed', 'as', 'a', 'linear', 'combination', 'of', 'the', 'periods', 'of', 'a', 'with', 'real', 'coefficients', 'the', 'betti', 'coordinates', 'of', 'xi', 'when', 'a', 'xi', 'varies', 'in', 'an', 'algebraic', 'family', 'these', 'coordinates', 'define', 'a', 'system', 'of', 'multivalued', 'realanalytic', 'functions', 'computing', 'its', 'rank', 'in', 'the', 'sense', 'of', 'differential', 'geometry', 'becomes', 'important', 'when', 'one', 'is', 'interested', 'about', 'how', 'often', 'xi', 'takes', 'a', 'torsion', 'value', 'for', 'instance', 'manins', 'theorem', 'of', 'the', 'kernel', 'implies', 'that', 'this', 'coordinate', 'system', 'is', 'constant', 'in', 'a', 'family', 'without', 'fixed', 'part', 'only', 'when', 'xi', 'is', 'a', 'torsion', 'section', 'we', 'compute', 'this', 'rank', 'in', 'terms', 'of', 'the', 'rank', 'of', 'a', 'certain', 'contracted', 'form', 'of', 'the', 'kodairaspencer', 'map', 'associated', 'to', 'a', 'xi', 'assuming', 'a', 'without', 'fixed', 'part', 'and', 'mathbbz', 'xi', 'zariskidense', 'in', 'a', 'and', 'deduce', 'some', 'explicit', 'lower', 'bounds', 'in', 'special', 'situations', 'for', 'instance', 'we', 'determine', 'this', 'rank', 'in', 'relative', 'dimension', 'leq', '3', 'and', 'study', 'in', 'detail', 'the', 'case', 'of', 'jacobians', 'of', 'families', 'of', 'hyperelliptic', 'curves', 'our', 'main', 'application', 'obtained', 'in', 'collaboration', 'with', 'z', 'gao', 'states', 'that', 'if', 'ato', 's', 'is', 'a', 'principally', 'polarized', 'abelian', 'scheme', 'of', 'relative', 'dimension', 'g', 'which', 'has', 'no', 'nontrivial', 'endomorphism', 'on', 'any', 'finite', 'covering', 'and', 'if', 'the', 'image', 'of', 's', 'in', 'the', 'moduli', 'space', 'mathcala_g', 'has', 'dimension', 'at', 'least', 'g', 'then', 'the', 'betti', 'map', 'of', 'any', 'nontorsion', 'section', 'xi', 'is', 'generically', 'a', 'submersion', 'so', 'that', 'xi1a_tors', 'is', 'dense', 'in', 'smathbbc']] | [-0.2082984707548048, 0.10820983950896318, -0.08243764935724852, 0.05894973481927355, -0.06098623762242976, -0.14816685338792404, 0.005871806518562426, 0.31766714486633246, -0.2940252265641106, -0.20528077276207732, 0.08880545598676612, -0.252090318380908, -0.13305903024283985, 0.20606615735112255, -0.08783434886213536, -0.02495795674472168, 0.02844775455720051, 0.14221742718436559, -0.09309293037153532, -0.2907657779757205, 0.4019566981477639, -0.03006518742593221, 0.18737483909753322, 0.05008060283571194, 0.1354415084179411, 0.017983216798340685, -0.006724086671052381, 0.01070257779717937, -0.13817469050551046, 0.10856150328496456, 0.2826524056442274, 0.07053515550859328, 0.22126514012545603, -0.31074345612282916, -0.16612286913676325, 0.21931708591906235, 0.10871209847928692, 0.019688235626300166, 0.01735018984584014, -0.21968358231792345, 0.1223199723164507, -0.15642510944989393, -0.18485851244913024, -0.05562762399663741, 0.12341467581305637, -0.0013114473134950763, -0.26334329898860864, -0.003170108520565754, 0.08875835525670614, 0.11889634409303829, -0.023158254724419614, -0.11919897438107906, -0.06157988641718842, 0.05309377430951674, 0.02886861043506554, 0.08407755085474976, 0.08391771813087133, -0.1395004315685497, -0.054516941731168125, 0.3713319424410898, -0.0928091604678288, -0.2422751180403926, 0.11809288402804466, -0.15907769947804415, -0.1591974987324663, 0.13639123958051844, 0.14088279703759904, 0.17092437207321096, -0.03184382409818397, 0.22581242249435204, -0.117538081534015, 0.16938488418898393, 0.1087407958074253, -0.02241458016289838, 0.12523414926951185, 0.0801775150886405, 0.09771251918592135, 0.12052948585343687, -0.01590189705088199, -0.03004413624713797, -0.38600523830211597, -0.1995896487616706, -0.1547516276740145, 0.14486904261441894, -0.14259036722899787, -0.1622853472488113, 0.38001375157408734, 0.035440009085325595, 0.24837195222134115, 0.06823695028178761, 0.2489857399394504, 0.11320229788893402, 0.03267069112273661, 0.08078659543161262, 0.13645783473965872, 0.1728391943953116, -0.0006087908996948613, -0.1329788581084444, 0.04453648705422167, 0.15621389007763417] |
1,802.03205 | Transport of hydrogen isotopes through interlayer spacing in van der
Waals crystals | Atoms start behaving as waves rather than classical particles if confined in
spaces commensurate with their de Broglie wavelength. At room temperature this
length is only about one angstrom even for the lightest atom, hydrogen. This
restricts quantum-confinement phenomena for atomic species to the realm of very
low temperatures. Here we show that van der Waals gaps between atomic planes of
layered crystals provide angstrom-size channels that make quantum confinement
of protons apparent even at room temperature. Our transport measurements show
that thermal protons experience a notably higher barrier than deuterons when
entering van der Waals gaps in hexagonal boron nitride and molybdenum
disulfide. This is attributed to the difference in de Broglie wavelength of the
isotopes. Once inside the crystals, transport of both isotopes can be described
by classical diffusion, albeit with unexpectedly fast rates, comparable to that
of protons in water. The demonstrated angstrom-size channels can be exploited
for further studies of atomistic quantum confinement and, if the technology can
be scaled up, for sieving hydrogen isotopes.
| cond-mat.mes-hall | atoms start behaving as waves rather than classical particles if confined in spaces commensurate with their de broglie wavelength at room temperature this length is only about one angstrom even for the lightest atom hydrogen this restricts quantumconfinement phenomena for atomic species to the realm of very low temperatures here we show that van der waals gaps between atomic planes of layered crystals provide angstromsize channels that make quantum confinement of protons apparent even at room temperature our transport measurements show that thermal protons experience a notably higher barrier than deuterons when entering van der waals gaps in hexagonal boron nitride and molybdenum disulfide this is attributed to the difference in de broglie wavelength of the isotopes once inside the crystals transport of both isotopes can be described by classical diffusion albeit with unexpectedly fast rates comparable to that of protons in water the demonstrated angstromsize channels can be exploited for further studies of atomistic quantum confinement and if the technology can be scaled up for sieving hydrogen isotopes | [['atoms', 'start', 'behaving', 'as', 'waves', 'rather', 'than', 'classical', 'particles', 'if', 'confined', 'in', 'spaces', 'commensurate', 'with', 'their', 'de', 'broglie', 'wavelength', 'at', 'room', 'temperature', 'this', 'length', 'is', 'only', 'about', 'one', 'angstrom', 'even', 'for', 'the', 'lightest', 'atom', 'hydrogen', 'this', 'restricts', 'quantumconfinement', 'phenomena', 'for', 'atomic', 'species', 'to', 'the', 'realm', 'of', 'very', 'low', 'temperatures', 'here', 'we', 'show', 'that', 'van', 'der', 'waals', 'gaps', 'between', 'atomic', 'planes', 'of', 'layered', 'crystals', 'provide', 'angstromsize', 'channels', 'that', 'make', 'quantum', 'confinement', 'of', 'protons', 'apparent', 'even', 'at', 'room', 'temperature', 'our', 'transport', 'measurements', 'show', 'that', 'thermal', 'protons', 'experience', 'a', 'notably', 'higher', 'barrier', 'than', 'deuterons', 'when', 'entering', 'van', 'der', 'waals', 'gaps', 'in', 'hexagonal', 'boron', 'nitride', 'and', 'molybdenum', 'disulfide', 'this', 'is', 'attributed', 'to', 'the', 'difference', 'in', 'de', 'broglie', 'wavelength', 'of', 'the', 'isotopes', 'once', 'inside', 'the', 'crystals', 'transport', 'of', 'both', 'isotopes', 'can', 'be', 'described', 'by', 'classical', 'diffusion', 'albeit', 'with', 'unexpectedly', 'fast', 'rates', 'comparable', 'to', 'that', 'of', 'protons', 'in', 'water', 'the', 'demonstrated', 'angstromsize', 'channels', 'can', 'be', 'exploited', 'for', 'further', 'studies', 'of', 'atomistic', 'quantum', 'confinement', 'and', 'if', 'the', 'technology', 'can', 'be', 'scaled', 'up', 'for', 'sieving', 'hydrogen', 'isotopes']] | [-0.09255336266914768, 0.2836913367576302, -0.05246270884974645, 0.050851319156746934, 0.0247223947717968, -0.1963525327258694, 0.06003744678141979, 0.3892289056076211, -0.25580346265245646, -0.26921171307034747, -0.056445023131738666, -0.32510574797399827, -0.0635985942535411, 0.20105945151409454, 0.0233134973970567, -0.00234339730924315, 0.04281559429743145, -0.0691317068800377, -0.056633109673196395, -0.22187834368748646, 0.239965831589666, 0.1241684936044859, 0.2651351555085262, 0.10819567374322982, 0.05614194766337261, -0.009888320549573067, 0.12198687244045477, 0.0016671726190810197, -0.17407009729749753, 0.07705856769858203, 0.30584452839667453, -0.0941598914789598, 0.20490903722276613, -0.48818949511902926, -0.23518632083511967, 0.04483413036234853, 0.18036492586069736, 0.17967449009594832, -0.062345372358634625, -0.258165740844733, 0.042710924774584685, -0.151019450368018, -0.13588323610829267, -0.04220984339198792, 0.031814810210982196, 0.05137909863684216, -0.18525274378969472, 0.09967147620097244, 0.034471726529961506, 0.04814043408810828, -0.06551793723824549, -0.15780933333571845, -0.03738461364165345, 0.031325916571786475, -0.001261812849686696, -0.029138281277364352, 0.21116984118128845, -0.09698759799219735, -0.05176660629573482, 0.44521474725285753, -0.06745242028853293, -0.07702351776475208, 0.19046841900707526, -0.18814678209938507, -0.04479342719096382, 0.19014949933763528, 0.07760160527682516, 0.07206003903824637, -0.1176518036835977, 0.07635175596087236, 0.00828934050876008, 0.21683154390028198, 0.22558210371027718, 0.09980427484529522, 0.24579926946382286, 0.1716147320132879, 0.04475861672069547, 0.05648593092888329, -0.07418388765327324, -0.05419479272591457, -0.1944914364893838, -0.22884269991404646, -0.18677827661075855, 0.07426710054416143, -0.06233587346336606, -0.1847476076626442, 0.27266608360471456, 0.1133371481183536, 0.1435671440716943, -0.03057373093562366, 0.24368528650313087, 0.05154703699462887, 0.08291449989798375, 0.015954390901124337, 0.30598560706354105, 0.1576555262494711, 0.12511922109365112, -0.22887230210540782, 0.059226738955114676, 0.02106377770352734] |
1,802.03206 | Perturbative corrections to technicolor | The full solution of technicolor (TC) Schwinger-Dyson equations should
include radiative corrections induced by extended technicolor (ETC) (or other)
interactions. We verify that when TC is embedded into a larger theory including
also QCD, these radiative corrections couple the different strongly interacting
Schwinger-Dyson equations, providing a tiny mass to technifermions and changing
the ultraviolet behavior of the gap equation solution. We argue about the
origin of the different quark masses without appealing for different ETC boson
masses, in one scenario where most of the new physics will appear in
interactions with the third fermion generation and with a TC scalar boson
possibly lighter than the TC characteristic scale ($\Lambda_{\tt{TC}}$)
| hep-ph hep-lat hep-th | the full solution of technicolor tc schwingerdyson equations should include radiative corrections induced by extended technicolor etc or other interactions we verify that when tc is embedded into a larger theory including also qcd these radiative corrections couple the different strongly interacting schwingerdyson equations providing a tiny mass to technifermions and changing the ultraviolet behavior of the gap equation solution we argue about the origin of the different quark masses without appealing for different etc boson masses in one scenario where most of the new physics will appear in interactions with the third fermion generation and with a tc scalar boson possibly lighter than the tc characteristic scale lambda_tttc | [['the', 'full', 'solution', 'of', 'technicolor', 'tc', 'schwingerdyson', 'equations', 'should', 'include', 'radiative', 'corrections', 'induced', 'by', 'extended', 'technicolor', 'etc', 'or', 'other', 'interactions', 'we', 'verify', 'that', 'when', 'tc', 'is', 'embedded', 'into', 'a', 'larger', 'theory', 'including', 'also', 'qcd', 'these', 'radiative', 'corrections', 'couple', 'the', 'different', 'strongly', 'interacting', 'schwingerdyson', 'equations', 'providing', 'a', 'tiny', 'mass', 'to', 'technifermions', 'and', 'changing', 'the', 'ultraviolet', 'behavior', 'of', 'the', 'gap', 'equation', 'solution', 'we', 'argue', 'about', 'the', 'origin', 'of', 'the', 'different', 'quark', 'masses', 'without', 'appealing', 'for', 'different', 'etc', 'boson', 'masses', 'in', 'one', 'scenario', 'where', 'most', 'of', 'the', 'new', 'physics', 'will', 'appear', 'in', 'interactions', 'with', 'the', 'third', 'fermion', 'generation', 'and', 'with', 'a', 'tc', 'scalar', 'boson', 'possibly', 'lighter', 'than', 'the', 'tc', 'characteristic', 'scale', 'lambda_tttc']] | [-0.1111614205400218, 0.27276753037585877, -0.04617139267308327, 0.14245702607095828, -0.1165751446409289, -0.18829155028409636, 0.03823596943510455, 0.2990004240569693, -0.20808274713366431, -0.30905121504501615, 0.03325745276891178, -0.32154073922343, -0.051705223552912856, 0.12982612978710137, 0.06304104376963719, 0.03482835570940989, 0.0027896287523348023, 0.03352196476663704, -0.10563734416737808, -0.23730735276735182, 0.36010295091007183, -0.031232250694840872, 0.18772795735168513, 0.10715375968720764, 0.029314064968342858, -0.03427360520085872, 0.010262378888135706, -0.02568802890298819, -0.09805440247584085, 0.05824569825118589, 0.16981758207839448, 0.011220414924469811, 0.20089586353558977, -0.3889402320987924, -0.2326533231793696, 0.08557855971674952, 0.18005056879741865, 0.12615060081481244, -0.09497218533242294, -0.29163552413660065, 0.0780912996399113, -0.18346099731408888, -0.18050217383144493, -0.05147066737387191, -0.05711680966325932, -0.08167174479415364, -0.2913971742209806, 0.07570920815487625, -0.008665422335508521, 0.016601121018606203, -0.041837765522628884, -0.16822860637438242, -0.0756278583150426, 0.04736653809070251, 0.11719445698178822, 0.0011835540170539861, 0.14880439975779694, -0.22529482222334654, -0.10220829908697245, 0.43832436400569147, -0.11628494020489463, -0.14072221725385775, 0.2031965425833025, -0.14442052599473823, -0.12792427309236867, 0.16176132013572864, 0.1689076652293335, 0.11296040080142794, -0.19393650442213617, 0.11258223198065362, -0.010220632146767996, 0.18766112247895864, 0.026571915383640402, 0.0777998126965637, 0.2779827657742081, 0.18264532179994233, -0.026816297106927744, 0.06324707982356711, 0.004330371488187531, -0.14735484144788374, -0.3316863059600884, -0.1368314138240681, -0.07471314870269487, 0.06542772655720236, -0.1197245762512601, -0.13831290058550183, 0.3511049161164987, 0.20297612147017693, 0.18851983539665257, 0.010491040021103496, 0.2553094820253103, 0.13143336319330115, 0.15201353931937506, 0.06047727029201471, 0.2817471934206508, 0.13337031809432018, 0.12734084270239152, -0.2638233360054006, -0.034265300759687776, 0.10539373647663053] |
1,802.03207 | Preliminary investigation of a new state estimation technique using
device-independent maximum likelihood estimation | In quantum state tomography, the estimated frequencies do not correspond
directly to a physical quantum state, due to statistical fluctuations. Thus,
one resorts to point estimators that return the state that matches observations
the best, and a variety of estimators have been proposed -- linear inversion,
least squares, maximum likelihood (ML) -- each making different trade-offs. In
this short note, we investigate an alternative approach inspired by
device-independent quantum information protocols. We embed a tomographic
complete set of measurement operators within the framework of a Bell scenario,
and first regularize the estimated frequencies using a device-independent
maximum likelihood algorithm. We then run the standard maximum likelihood
algorithm to estimate the underlying quantum state. In this preliminary
investigation, we do not observe significant differences in the reconstructed
state when using the new algorithm.
| quant-ph | in quantum state tomography the estimated frequencies do not correspond directly to a physical quantum state due to statistical fluctuations thus one resorts to point estimators that return the state that matches observations the best and a variety of estimators have been proposed linear inversion least squares maximum likelihood ml each making different tradeoffs in this short note we investigate an alternative approach inspired by deviceindependent quantum information protocols we embed a tomographic complete set of measurement operators within the framework of a bell scenario and first regularize the estimated frequencies using a deviceindependent maximum likelihood algorithm we then run the standard maximum likelihood algorithm to estimate the underlying quantum state in this preliminary investigation we do not observe significant differences in the reconstructed state when using the new algorithm | [['in', 'quantum', 'state', 'tomography', 'the', 'estimated', 'frequencies', 'do', 'not', 'correspond', 'directly', 'to', 'a', 'physical', 'quantum', 'state', 'due', 'to', 'statistical', 'fluctuations', 'thus', 'one', 'resorts', 'to', 'point', 'estimators', 'that', 'return', 'the', 'state', 'that', 'matches', 'observations', 'the', 'best', 'and', 'a', 'variety', 'of', 'estimators', 'have', 'been', 'proposed', 'linear', 'inversion', 'least', 'squares', 'maximum', 'likelihood', 'ml', 'each', 'making', 'different', 'tradeoffs', 'in', 'this', 'short', 'note', 'we', 'investigate', 'an', 'alternative', 'approach', 'inspired', 'by', 'deviceindependent', 'quantum', 'information', 'protocols', 'we', 'embed', 'a', 'tomographic', 'complete', 'set', 'of', 'measurement', 'operators', 'within', 'the', 'framework', 'of', 'a', 'bell', 'scenario', 'and', 'first', 'regularize', 'the', 'estimated', 'frequencies', 'using', 'a', 'deviceindependent', 'maximum', 'likelihood', 'algorithm', 'we', 'then', 'run', 'the', 'standard', 'maximum', 'likelihood', 'algorithm', 'to', 'estimate', 'the', 'underlying', 'quantum', 'state', 'in', 'this', 'preliminary', 'investigation', 'we', 'do', 'not', 'observe', 'significant', 'differences', 'in', 'the', 'reconstructed', 'state', 'when', 'using', 'the', 'new', 'algorithm']] | [-0.06291855211154773, 0.06188605414947513, -0.13103724076018597, 0.10862852482017703, -0.07749873887066944, -0.17844036237265054, 0.08603034713842835, 0.3732717860776644, -0.2629454522193835, -0.3021593765498927, 0.10700028430169019, -0.24777840203247392, -0.12975560199478284, 0.17347974663492866, -0.0821010017928739, 0.1297435160493478, 0.08241503715443496, 0.014589964376332669, -0.1138525049157369, -0.2531377819474213, 0.2616324288573546, 0.06370656162392921, 0.3182085092466038, -0.01827342030771363, 0.11817382022899647, 0.01119332445713763, 0.0008042899139512043, 0.007032470516144083, -0.1533981213495001, 0.0990332763033131, 0.268553983918033, 0.20649577777725286, 0.2961959226343494, -0.3954631191893266, -0.20116023141174363, 0.161999768185286, 0.13494614810557462, 0.15971884296920438, 0.0009449362038419797, -0.26492916573412145, 0.055383477374338186, -0.17539539920578065, -0.06393450535833836, -0.08046849654056132, -0.07205737414053426, -0.05761768182184404, -0.27539240343926047, 0.07801256861824256, 0.029827378306967706, 0.027490106432770306, -0.00813694888448271, -0.11342705111377514, 0.049207605000656955, 0.09806055819118718, -0.017210555825239192, 0.015461927321918595, 0.10567869372450961, -0.09335577711194323, -0.18778518116316542, 0.30128074187355547, -0.05306065574180908, -0.1881817515169342, 0.13431576372554097, -0.13508477022226614, -0.1440792970198135, 0.10280974697536574, 0.1876332744382895, 0.10801865868270397, -0.17544915110752649, 0.025674158247868315, -0.028900755784259394, 0.20601308632467408, 0.023309381175428055, 0.044426190242386206, 0.19785574790663443, 0.1054987356532365, 0.07531587722747085, 0.13021533300813573, -0.11653883713297546, -0.12898373289857634, -0.3080400544290359, -0.17745948137285616, -0.2578002654087658, 0.04297766685866428, -0.09715278387951772, -0.14704807478074844, 0.40422345384095726, 0.22293462097071684, 0.20529150718357414, 0.04973370514344424, 0.327707603530815, 0.10886411193608253, 0.025132568893381037, 0.11879422763326707, 0.2737349707346696, 0.12201719512052547, 0.03267041355586396, -0.20425750331666606, 0.10776124018996668, 0.031293089370816374] |
1,802.03208 | Rotational spectroscopy of cold, trapped molecular ions in the
Lamb-Dicke regime | Sympathetic cooling of trapped ions has been established as a powerful
technique for manipulation of non-laser-coolable ions
(Raizen1992,Waki1992,Bowe1999,Barrett2003). For molecular ions, it promises
vastly enhanced spectroscopic resolution and accuracy. However, this potential
remains untapped so far, with the best resolution achieved being not better
than $5\times10^{-8}$ fractionally, due to residual Doppler broadening being
present in ion clusters even at the lowest achievable translational
temperatures (Bressel2012). Here we introduce a general and accessible approach
that enables Doppler-free rotational spectroscopy. It makes use of the strong
radial spatial confinement of molecular ions when trapped and crystallized in a
linear quadrupole trap, providing the Lamb-Dicke regime for rotational
transitions. We achieve a line width of $1\times10^{-9}$ fractionally and
$1.3~\textrm{kHz}$ absolute, an improvement by $50$ and nearly $3\times10^{3}$,
respectively, over other methods. The systematic uncertainty is
$2.5\times10^{-10}$. As an application, we demonstrate the most precise test of
$\textit{ab initio}$ molecular theory and the most precise ($1.3~\textrm{PPB}$)
spectroscopic determination of the proton mass. The results represent the long
overdue extension of Doppler-free microwave spectroscopy of laser-cooled atomic
ion clusters (Berkeland1998) to higher spectroscopy frequencies and to
molecules. This approach enables a vast range of high-precision measurements on
molecules, both on rotational and, as we project, vibrational transitions.
| quant-ph physics.atom-ph | sympathetic cooling of trapped ions has been established as a powerful technique for manipulation of nonlasercoolable ions raizen1992waki1992bowe1999barrett2003 for molecular ions it promises vastly enhanced spectroscopic resolution and accuracy however this potential remains untapped so far with the best resolution achieved being not better than 5times108 fractionally due to residual doppler broadening being present in ion clusters even at the lowest achievable translational temperatures bressel2012 here we introduce a general and accessible approach that enables dopplerfree rotational spectroscopy it makes use of the strong radial spatial confinement of molecular ions when trapped and crystallized in a linear quadrupole trap providing the lambdicke regime for rotational transitions we achieve a line width of 1times109 fractionally and 13textrmkhz absolute an improvement by 50 and nearly 3times103 respectively over other methods the systematic uncertainty is 25times1010 as an application we demonstrate the most precise test of textitab initio molecular theory and the most precise 13textrmppb spectroscopic determination of the proton mass the results represent the long overdue extension of dopplerfree microwave spectroscopy of lasercooled atomic ion clusters berkeland1998 to higher spectroscopy frequencies and to molecules this approach enables a vast range of highprecision measurements on molecules both on rotational and as we project vibrational transitions | [['sympathetic', 'cooling', 'of', 'trapped', 'ions', 'has', 'been', 'established', 'as', 'a', 'powerful', 'technique', 'for', 'manipulation', 'of', 'nonlasercoolable', 'ions', 'raizen1992waki1992bowe1999barrett2003', 'for', 'molecular', 'ions', 'it', 'promises', 'vastly', 'enhanced', 'spectroscopic', 'resolution', 'and', 'accuracy', 'however', 'this', 'potential', 'remains', 'untapped', 'so', 'far', 'with', 'the', 'best', 'resolution', 'achieved', 'being', 'not', 'better', 'than', '5times108', 'fractionally', 'due', 'to', 'residual', 'doppler', 'broadening', 'being', 'present', 'in', 'ion', 'clusters', 'even', 'at', 'the', 'lowest', 'achievable', 'translational', 'temperatures', 'bressel2012', 'here', 'we', 'introduce', 'a', 'general', 'and', 'accessible', 'approach', 'that', 'enables', 'dopplerfree', 'rotational', 'spectroscopy', 'it', 'makes', 'use', 'of', 'the', 'strong', 'radial', 'spatial', 'confinement', 'of', 'molecular', 'ions', 'when', 'trapped', 'and', 'crystallized', 'in', 'a', 'linear', 'quadrupole', 'trap', 'providing', 'the', 'lambdicke', 'regime', 'for', 'rotational', 'transitions', 'we', 'achieve', 'a', 'line', 'width', 'of', '1times109', 'fractionally', 'and', '13textrmkhz', 'absolute', 'an', 'improvement', 'by', '50', 'and', 'nearly', '3times103', 'respectively', 'over', 'other', 'methods', 'the', 'systematic', 'uncertainty', 'is', '25times1010', 'as', 'an', 'application', 'we', 'demonstrate', 'the', 'most', 'precise', 'test', 'of', 'textitab', 'initio', 'molecular', 'theory', 'and', 'the', 'most', 'precise', '13textrmppb', 'spectroscopic', 'determination', 'of', 'the', 'proton', 'mass', 'the', 'results', 'represent', 'the', 'long', 'overdue', 'extension', 'of', 'dopplerfree', 'microwave', 'spectroscopy', 'of', 'lasercooled', 'atomic', 'ion', 'clusters', 'berkeland1998', 'to', 'higher', 'spectroscopy', 'frequencies', 'and', 'to', 'molecules', 'this', 'approach', 'enables', 'a', 'vast', 'range', 'of', 'highprecision', 'measurements', 'on', 'molecules', 'both', 'on', 'rotational', 'and', 'as', 'we', 'project', 'vibrational', 'transitions']] | [-0.056650551570560405, 0.15774330584945903, -0.015277973427294696, 0.026395579547578544, -0.009575937986278869, -0.1429024764454843, 0.09233877478388366, 0.44678297054203114, -0.20290120171349763, -0.3245538509716945, 0.029954251036171477, -0.25952510576581167, -0.011885455857347032, 0.22260717050010834, 0.020522089226038327, 0.054865660462160216, 0.05688344890237501, -0.03893131461874724, -0.056942308045999736, -0.16843843972429215, 0.20874772639707567, 0.12832159678242644, 0.2591995451509078, 0.10526727197919877, 0.10786987616138875, -0.03625548731509539, 0.012551364472862904, -0.015182156519660232, -0.14628681892961085, 0.15855911973809197, 0.23960239861406415, 0.04297510376829673, 0.25588798598975554, -0.39662263770967876, -0.22026209328834404, 0.05861263464523327, 0.2063296109067314, 0.20450476397197737, -0.043335912237181425, -0.2596669514539975, 0.0056032152693215, -0.15041963051415372, -0.15426347260981113, -0.15129301980332643, 0.02233247764940773, 0.013998331073243931, -0.25361685923595284, 0.09572509513414769, 0.014381974510259318, 0.1560056285115377, -0.10363261983729899, -0.126844049654117, 0.016656522608210086, 0.07402521231029377, -0.031592564150092324, 0.05772998557326251, 0.17259708413027455, -0.0919163468892553, -0.08297812123307768, 0.412902453548408, -0.09852932813306807, -0.085531199942533, 0.2181481002777701, -0.19277825993271924, -0.13394773803171417, 0.19124549904087446, 0.11804795361596768, 0.14930415370297256, -0.1344951470089246, 0.019114271879590555, 0.0013484437617340258, 0.21568136187633338, 0.10021255014711344, 0.11236642747291849, 0.21328117816628203, 0.18031749175267522, 0.06158429348000268, 0.0866770508726738, -0.1762477141443868, -0.04113517027842451, -0.19861179119337122, -0.15724280483222433, -0.1694255699819353, 0.038690524321950484, -0.02224111930901964, -0.10575346127437542, 0.34473209609800226, 0.12985569697552912, 0.15004498347858614, -0.007529036163314417, 0.34144736932856695, 0.07655806597369742, 0.07528029136568765, 0.01539597222914121, 0.2844596804423752, 0.18386439595262197, 0.09080847002725041, -0.2857686458488128, 0.02315796337004903, -0.017750836669453134] |
1,802.03209 | Drift Theory in Continuous Search Spaces: Expected Hitting Time of the
(1+1)-ES with 1/5 Success Rule | This paper explores the use of the standard approach for proving runtime
bounds in discrete domains---often referred to as drift analysis---in the
context of optimization on a continuous domain. Using this framework we analyze
the (1+1) Evolution Strategy with one-fifth success rule on the sphere
function. To deal with potential functions that are not lower-bounded, we
formulate novel drift theorems. We then use the theorems to prove bounds on the
expected hitting time to reach a certain target fitness in finite dimension
$d$. The bounds are akin to linear convergence. We then study the dependency of
the different terms on $d$ proving a convergence rate dependency of
$\Theta(1/d)$. Our results constitute the first non-asymptotic analysis for the
algorithm considered as well as the first explicit application of drift
analysis to a randomized search heuristic with continuous domain.
| cs.NE | this paper explores the use of the standard approach for proving runtime bounds in discrete domainsoften referred to as drift analysisin the context of optimization on a continuous domain using this framework we analyze the 11 evolution strategy with onefifth success rule on the sphere function to deal with potential functions that are not lowerbounded we formulate novel drift theorems we then use the theorems to prove bounds on the expected hitting time to reach a certain target fitness in finite dimension d the bounds are akin to linear convergence we then study the dependency of the different terms on d proving a convergence rate dependency of theta1d our results constitute the first nonasymptotic analysis for the algorithm considered as well as the first explicit application of drift analysis to a randomized search heuristic with continuous domain | [['this', 'paper', 'explores', 'the', 'use', 'of', 'the', 'standard', 'approach', 'for', 'proving', 'runtime', 'bounds', 'in', 'discrete', 'domainsoften', 'referred', 'to', 'as', 'drift', 'analysisin', 'the', 'context', 'of', 'optimization', 'on', 'a', 'continuous', 'domain', 'using', 'this', 'framework', 'we', 'analyze', 'the', '11', 'evolution', 'strategy', 'with', 'onefifth', 'success', 'rule', 'on', 'the', 'sphere', 'function', 'to', 'deal', 'with', 'potential', 'functions', 'that', 'are', 'not', 'lowerbounded', 'we', 'formulate', 'novel', 'drift', 'theorems', 'we', 'then', 'use', 'the', 'theorems', 'to', 'prove', 'bounds', 'on', 'the', 'expected', 'hitting', 'time', 'to', 'reach', 'a', 'certain', 'target', 'fitness', 'in', 'finite', 'dimension', 'd', 'the', 'bounds', 'are', 'akin', 'to', 'linear', 'convergence', 'we', 'then', 'study', 'the', 'dependency', 'of', 'the', 'different', 'terms', 'on', 'd', 'proving', 'a', 'convergence', 'rate', 'dependency', 'of', 'theta1d', 'our', 'results', 'constitute', 'the', 'first', 'nonasymptotic', 'analysis', 'for', 'the', 'algorithm', 'considered', 'as', 'well', 'as', 'the', 'first', 'explicit', 'application', 'of', 'drift', 'analysis', 'to', 'a', 'randomized', 'search', 'heuristic', 'with', 'continuous', 'domain']] | [-0.06275745875327222, 0.021600456890969802, -0.09590417537977224, 0.08709409844248431, -0.08027834595014244, -0.10839208102534845, 0.09260065408176812, 0.3520626621737854, -0.28350715872956744, -0.2797388776983899, 0.1504919709387555, -0.2149339468746599, -0.15616409286662047, 0.18949813199222587, -0.0806896731521545, 0.09172408462766168, 0.026256479858942052, 0.0466569803425792, -0.08881132549140602, -0.26739032760457093, 0.3000580633385802, 0.023811555182589077, 0.26193561908135665, 0.06271720314815418, 0.11289502967691133, 0.021550388426829215, -0.05360078427301192, 0.005691421065312713, -0.1782175656184906, 0.1302851547813738, 0.22123876028457906, 0.1582430934710706, 0.32544102089535165, -0.3887083269586203, -0.1651689380628001, 0.1425295370846375, 0.1397457424857056, 0.10745010467388653, -0.03872405897057963, -0.2725348011521039, 0.10738816202632082, -0.13344302248737927, -0.126303625126272, -0.08123217484872065, -0.020214816577968867, 0.0723076982253384, -0.2994706363820318, 0.0462523687060978, 0.1001710520454321, 0.033122654502113255, -0.07737593670069838, -0.12050673862530002, 0.0593986597794817, 0.10718378612907159, 0.05899640217201033, 0.03637754452699767, 0.09582745004249842, -0.059903910956971014, -0.16496353813641662, 0.3362050282233742, -0.11607272656453746, -0.24588538467911863, 0.18979114432360478, -0.12742926611099392, -0.15643080516106714, 0.07692946467215, 0.2454209309835821, 0.153989447586572, -0.13016365567889454, 0.0953751338937723, -0.04558205938856326, 0.12539832977796975, 0.07317237846497725, 0.040681851916571164, 0.09328043741980262, 0.19670269129300552, 0.14649931124911936, 0.17570268502632685, -0.06169567448729927, -0.1129697534158381, -0.3566153001304327, -0.1526586526184718, -0.1964174337101294, 0.018013597400133575, -0.10793657411835086, -0.17290459915651565, 0.3779902127084892, 0.14839619138875781, 0.2061236253522559, 0.17465577801123067, 0.2861634898407788, 0.1533355693586532, 0.019173193069647498, 0.0801506186470584, 0.19361372972289517, 0.11307969743059253, 0.08407236281921392, -0.18845824357087432, 0.08828820799800581, 0.12283003093924985] |
1,802.0321 | Quantitative aspects of acyclicity | We study several aspects of the $k$-th Cheeger constant of a complex X, a
parameter that quantifies the distance of $X$ from a complex $Y$ with
nontrivial $k$-th cohomology over $\mathbb{Z}_2$. Our results include general
methods for bounding the cosystolic norm of a cochain and for bounding the
Cheeger constant of a complex, a discussion of expansion of pseudomanifolds and
geometric lattices, probabilistic upper bounds on Cheeger constants, and
application of non-Abelian expansion to random complexes.
| math.CO | we study several aspects of the kth cheeger constant of a complex x a parameter that quantifies the distance of x from a complex y with nontrivial kth cohomology over mathbbz_2 our results include general methods for bounding the cosystolic norm of a cochain and for bounding the cheeger constant of a complex a discussion of expansion of pseudomanifolds and geometric lattices probabilistic upper bounds on cheeger constants and application of nonabelian expansion to random complexes | [['we', 'study', 'several', 'aspects', 'of', 'the', 'kth', 'cheeger', 'constant', 'of', 'a', 'complex', 'x', 'a', 'parameter', 'that', 'quantifies', 'the', 'distance', 'of', 'x', 'from', 'a', 'complex', 'y', 'with', 'nontrivial', 'kth', 'cohomology', 'over', 'mathbbz_2', 'our', 'results', 'include', 'general', 'methods', 'for', 'bounding', 'the', 'cosystolic', 'norm', 'of', 'a', 'cochain', 'and', 'for', 'bounding', 'the', 'cheeger', 'constant', 'of', 'a', 'complex', 'a', 'discussion', 'of', 'expansion', 'of', 'pseudomanifolds', 'and', 'geometric', 'lattices', 'probabilistic', 'upper', 'bounds', 'on', 'cheeger', 'constants', 'and', 'application', 'of', 'nonabelian', 'expansion', 'to', 'random', 'complexes']] | [-0.19362241030964805, 0.07825043861827764, -0.04924161019957146, 0.0706151039094517, -0.11291553333744798, -0.11755936069561071, 0.07171081534684881, 0.312062802614252, -0.2999136007366408, -0.23345005713207156, 0.10310778017523453, -0.24798548152964367, -0.1626191531847182, 0.19399760519062462, -0.0852024111480109, 0.004123590739541932, 0.03220094826170489, 0.11502984349039923, -0.10726616758007654, -0.27022250032199446, 0.36519115701268773, -0.019254575792920628, 0.18969416297285965, 0.12819163835956715, 0.1172767503517925, -0.04585188257164861, -0.015746828608251617, 0.031241052600212003, -0.26326217124053647, 0.25068157019191667, 0.2012986046090526, 0.054405770676614916, 0.240761154386411, -0.3354694173230152, -0.20130024101634167, 0.14098509761357778, 0.07858721343616612, 0.026461308527933925, 0.0313493177512244, -0.2910818769902873, 0.08774516040361241, -0.11475670075436172, -0.09100070106184208, -0.10423896000352934, 0.0422697229752023, 0.05387685043234868, -0.2937583523882112, 0.05159022085564701, 0.09854898259876982, 0.09025330375535352, -0.051397254604748206, -0.13988993533635757, 0.011845834170296592, 0.09081275414332356, 0.01141914168960954, 0.055526611998701764, 0.10245865047296607, -0.12478072756264162, -0.17606700613089887, 0.36491455537218015, -0.13228031904681734, -0.22447769941860124, 0.10122368227396357, -0.15116992223958828, -0.1844042913044656, 0.13759099295068727, 0.14096608091341822, 0.19326655506646553, -0.005845177171163653, 0.2066463430536188, -0.07690952304064443, 0.08950761274287575, 0.10646359258527427, 0.02219716571715636, 0.09823347637613647, 0.10701507858711441, 0.14699121681042016, 0.15146097880604334, -0.011948512631198881, -0.10113713115845856, -0.3529775836750081, -0.2155383580921855, -0.22941105588535338, 0.1330775749428492, -0.2382675021311259, -0.24331387417470596, 0.38219836464543877, 0.032153646357504555, 0.24613427790494538, 0.13089025047252348, 0.2690782154861249, 0.00601788144099134, 0.015139880179623632, 0.03801684005884454, 0.10494119883285173, 0.2435390958194866, 0.0036245151836498592, -0.13270804043062717, 0.019572036659443064, 0.2079092608029513] |
1,802.03211 | Towards realistic HPC models of the neuromuscular system | Realistic simulations of detailed, biophysics-based, multi-scale models
require very high resolution and, thus, large-scale compute facilities.
Existing simulation environments, especially for biomedical applications, are
designed to allow for a high flexibility and generality in model development.
Flexibility and model development, however, are often a limiting factor for
large-scale simulations. Therefore, new models are typically tested and run on
small-scale compute facilities. By using a detailed biophysics-based,
chemo-electromechanical skeletal muscle model and the international open-source
software library OpenCMISS as an example, we present an approach to upgrade an
existing muscle simulation framework from a moderately parallel version towards
a massively parallel one that scales both in terms of problem size and in terms
of the number of parallel processes. For this purpose, we investigate different
modeling, algorithmic and implementational aspects. We present improvements
addressing both numerical and parallel scalability. In addition, our approach
includes a novel visualization environment, which is based on the MegaMol
environment capable of handling large amounts of simulated data. It offers a
platform for fast visualization prototyping, distributed rendering, and
advanced visualization techniques. We present results of a variety of scaling
studies at the Tier-1 supercomputer HazelHen at the High Performance Computing
Center Stuttgart (HLRS). We improve the overall runtime by a factor of up to
2.6 and achieved good scalability on up to 768 cores, where the previous
implementation used only 4 cores.
| cs.CE physics.comp-ph | realistic simulations of detailed biophysicsbased multiscale models require very high resolution and thus largescale compute facilities existing simulation environments especially for biomedical applications are designed to allow for a high flexibility and generality in model development flexibility and model development however are often a limiting factor for largescale simulations therefore new models are typically tested and run on smallscale compute facilities by using a detailed biophysicsbased chemoelectromechanical skeletal muscle model and the international opensource software library opencmiss as an example we present an approach to upgrade an existing muscle simulation framework from a moderately parallel version towards a massively parallel one that scales both in terms of problem size and in terms of the number of parallel processes for this purpose we investigate different modeling algorithmic and implementational aspects we present improvements addressing both numerical and parallel scalability in addition our approach includes a novel visualization environment which is based on the megamol environment capable of handling large amounts of simulated data it offers a platform for fast visualization prototyping distributed rendering and advanced visualization techniques we present results of a variety of scaling studies at the tier1 supercomputer hazelhen at the high performance computing center stuttgart hlrs we improve the overall runtime by a factor of up to 26 and achieved good scalability on up to 768 cores where the previous implementation used only 4 cores | [['realistic', 'simulations', 'of', 'detailed', 'biophysicsbased', 'multiscale', 'models', 'require', 'very', 'high', 'resolution', 'and', 'thus', 'largescale', 'compute', 'facilities', 'existing', 'simulation', 'environments', 'especially', 'for', 'biomedical', 'applications', 'are', 'designed', 'to', 'allow', 'for', 'a', 'high', 'flexibility', 'and', 'generality', 'in', 'model', 'development', 'flexibility', 'and', 'model', 'development', 'however', 'are', 'often', 'a', 'limiting', 'factor', 'for', 'largescale', 'simulations', 'therefore', 'new', 'models', 'are', 'typically', 'tested', 'and', 'run', 'on', 'smallscale', 'compute', 'facilities', 'by', 'using', 'a', 'detailed', 'biophysicsbased', 'chemoelectromechanical', 'skeletal', 'muscle', 'model', 'and', 'the', 'international', 'opensource', 'software', 'library', 'opencmiss', 'as', 'an', 'example', 'we', 'present', 'an', 'approach', 'to', 'upgrade', 'an', 'existing', 'muscle', 'simulation', 'framework', 'from', 'a', 'moderately', 'parallel', 'version', 'towards', 'a', 'massively', 'parallel', 'one', 'that', 'scales', 'both', 'in', 'terms', 'of', 'problem', 'size', 'and', 'in', 'terms', 'of', 'the', 'number', 'of', 'parallel', 'processes', 'for', 'this', 'purpose', 'we', 'investigate', 'different', 'modeling', 'algorithmic', 'and', 'implementational', 'aspects', 'we', 'present', 'improvements', 'addressing', 'both', 'numerical', 'and', 'parallel', 'scalability', 'in', 'addition', 'our', 'approach', 'includes', 'a', 'novel', 'visualization', 'environment', 'which', 'is', 'based', 'on', 'the', 'megamol', 'environment', 'capable', 'of', 'handling', 'large', 'amounts', 'of', 'simulated', 'data', 'it', 'offers', 'a', 'platform', 'for', 'fast', 'visualization', 'prototyping', 'distributed', 'rendering', 'and', 'advanced', 'visualization', 'techniques', 'we', 'present', 'results', 'of', 'a', 'variety', 'of', 'scaling', 'studies', 'at', 'the', 'tier1', 'supercomputer', 'hazelhen', 'at', 'the', 'high', 'performance', 'computing', 'center', 'stuttgart', 'hlrs', 'we', 'improve', 'the', 'overall', 'runtime', 'by', 'a', 'factor', 'of', 'up', 'to', '26', 'and', 'achieved', 'good', 'scalability', 'on', 'up', 'to', '768', 'cores', 'where', 'the', 'previous', 'implementation', 'used', 'only', '4', 'cores']] | [-0.08106789672580202, 0.009469395534397988, -0.03671272142660791, 0.024236844238123518, -0.0630556556840966, -0.11811762631791456, 0.01476676026129502, 0.40527196101543617, -0.21524517175077457, -0.379732472208149, 0.1286682109264949, -0.22045725443235478, -0.11717251379193212, 0.2765415686688014, -0.031847638823224125, 0.08496373953953419, 0.14640205492570396, -0.06879840601097809, -0.04504415081947574, -0.22459737205749478, 0.23157067881895005, 0.13808095301480572, 0.33886685591105437, 0.0635009903785451, 0.10754058280732115, -0.031355230553251075, -0.07398062781117556, 0.025689628029517797, -0.08395209405462246, 0.1514671893363334, 0.27500989194949615, 0.17102344226898133, 0.30840197477005254, -0.46523804708713906, -0.18732498753231203, 0.03807556062452328, 0.1569828126368618, 0.08693114808194691, -0.09037318957015254, -0.23984926508117316, 0.11082272725848005, -0.20742343829197166, -0.11636670556918075, -0.14454116342555848, -0.008186994989156189, 0.017046623195066314, -0.2638335945042928, 0.011908992128906094, -0.0013157389598643834, 0.09859413418275692, -0.015169961991899484, -0.11313301838533493, 0.07179277963652338, 0.12470071539261918, -0.03856735541683626, 0.02388595304589702, 0.1396691941263597, -0.16148775220105233, -0.13771457398924225, 0.3989819314314111, -0.03059676065080436, -0.1754465610156412, 0.26002242079530863, -0.05330424414089653, -0.17632125711669902, 0.10705880415855569, 0.2527772648982503, 0.1084445022482993, -0.14474452174197666, 0.06763160008584221, 0.041787123587400124, 0.1810583452330777, 0.0014823545668391101, -0.013019717609584999, 0.18039894848957558, 0.2669742982709288, 0.0192833363745182, 0.14402370079788024, -0.08381017086497036, -0.10270372891408128, -0.2521306642183967, -0.158799189831978, -0.1271564372420528, -0.01817376926048521, -0.1045731090027745, -0.13918712369120376, 0.37302339913724447, 0.20533600200026092, 0.15489450268000532, 0.07886089538297128, 0.3689791163316857, 0.014885713147013051, 0.09872901343611057, 0.11355359283914881, 0.16062536313889691, 0.04195630847530715, 0.147664835641052, -0.18832251860868737, 0.036816042941898906, -0.014701672762866245] |
1,802.03212 | Deep clustering of longitudinal data | Deep neural networks are a family of computational models that have led to a
dramatical improvement of the state of the art in several domains such as
image, voice or text analysis. These methods provide a framework to model
complex, non-linear interactions in large datasets, and are naturally suited to
the analysis of hierarchical data such as, for instance, longitudinal data with
the use of recurrent neural networks. In the other hand, cohort studies have
become a tool of importance in the research field of epidemiology. In such
studies, variables are measured repeatedly over time, to allow the practitioner
to study their temporal evolution as trajectories, and, as such, as
longitudinal data. This paper investigates the application of the advanced
modelling techniques provided by the deep learning framework in the analysis of
the longitudinal data provided by cohort studies. Methods: A method for
visualizing and clustering longitudinal dataset is proposed, and compared to
other widely used approaches to the problem on both real and simulated
datasets. Results: The proposed method is shown to be coherent with the
preexisting procedures on simple tasks, and to outperform them on more complex
tasks such as the partitioning of longitudinal datasets into non-spherical
clusters. Conclusion: Deep artificial neural networks can be used to visualize
longitudinal data in a low dimensional manifold that is much simpler to
interpret than traditional longitudinal plots are. Consequently, practitioners
should start considering the use of deep artificial neural networks for the
analysis of their longitudinal data in studies to come.
| stat.ML cs.LG | deep neural networks are a family of computational models that have led to a dramatical improvement of the state of the art in several domains such as image voice or text analysis these methods provide a framework to model complex nonlinear interactions in large datasets and are naturally suited to the analysis of hierarchical data such as for instance longitudinal data with the use of recurrent neural networks in the other hand cohort studies have become a tool of importance in the research field of epidemiology in such studies variables are measured repeatedly over time to allow the practitioner to study their temporal evolution as trajectories and as such as longitudinal data this paper investigates the application of the advanced modelling techniques provided by the deep learning framework in the analysis of the longitudinal data provided by cohort studies methods a method for visualizing and clustering longitudinal dataset is proposed and compared to other widely used approaches to the problem on both real and simulated datasets results the proposed method is shown to be coherent with the preexisting procedures on simple tasks and to outperform them on more complex tasks such as the partitioning of longitudinal datasets into nonspherical clusters conclusion deep artificial neural networks can be used to visualize longitudinal data in a low dimensional manifold that is much simpler to interpret than traditional longitudinal plots are consequently practitioners should start considering the use of deep artificial neural networks for the analysis of their longitudinal data in studies to come | [['deep', 'neural', 'networks', 'are', 'a', 'family', 'of', 'computational', 'models', 'that', 'have', 'led', 'to', 'a', 'dramatical', 'improvement', 'of', 'the', 'state', 'of', 'the', 'art', 'in', 'several', 'domains', 'such', 'as', 'image', 'voice', 'or', 'text', 'analysis', 'these', 'methods', 'provide', 'a', 'framework', 'to', 'model', 'complex', 'nonlinear', 'interactions', 'in', 'large', 'datasets', 'and', 'are', 'naturally', 'suited', 'to', 'the', 'analysis', 'of', 'hierarchical', 'data', 'such', 'as', 'for', 'instance', 'longitudinal', 'data', 'with', 'the', 'use', 'of', 'recurrent', 'neural', 'networks', 'in', 'the', 'other', 'hand', 'cohort', 'studies', 'have', 'become', 'a', 'tool', 'of', 'importance', 'in', 'the', 'research', 'field', 'of', 'epidemiology', 'in', 'such', 'studies', 'variables', 'are', 'measured', 'repeatedly', 'over', 'time', 'to', 'allow', 'the', 'practitioner', 'to', 'study', 'their', 'temporal', 'evolution', 'as', 'trajectories', 'and', 'as', 'such', 'as', 'longitudinal', 'data', 'this', 'paper', 'investigates', 'the', 'application', 'of', 'the', 'advanced', 'modelling', 'techniques', 'provided', 'by', 'the', 'deep', 'learning', 'framework', 'in', 'the', 'analysis', 'of', 'the', 'longitudinal', 'data', 'provided', 'by', 'cohort', 'studies', 'methods', 'a', 'method', 'for', 'visualizing', 'and', 'clustering', 'longitudinal', 'dataset', 'is', 'proposed', 'and', 'compared', 'to', 'other', 'widely', 'used', 'approaches', 'to', 'the', 'problem', 'on', 'both', 'real', 'and', 'simulated', 'datasets', 'results', 'the', 'proposed', 'method', 'is', 'shown', 'to', 'be', 'coherent', 'with', 'the', 'preexisting', 'procedures', 'on', 'simple', 'tasks', 'and', 'to', 'outperform', 'them', 'on', 'more', 'complex', 'tasks', 'such', 'as', 'the', 'partitioning', 'of', 'longitudinal', 'datasets', 'into', 'nonspherical', 'clusters', 'conclusion', 'deep', 'artificial', 'neural', 'networks', 'can', 'be', 'used', 'to', 'visualize', 'longitudinal', 'data', 'in', 'a', 'low', 'dimensional', 'manifold', 'that', 'is', 'much', 'simpler', 'to', 'interpret', 'than', 'traditional', 'longitudinal', 'plots', 'are', 'consequently', 'practitioners', 'should', 'start', 'considering', 'the', 'use', 'of', 'deep', 'artificial', 'neural', 'networks', 'for', 'the', 'analysis', 'of', 'their', 'longitudinal', 'data', 'in', 'studies', 'to', 'come']] | [-0.04024507592230909, 0.021981009422936865, -0.09015812809171853, 0.09975203441314963, -0.10558190701930112, -0.12764353127556433, -0.0036023291921525066, 0.43370312901744357, -0.2575458070908885, -0.33128198731942954, 0.11855690953028629, -0.28278807966053426, -0.18429103970668645, 0.2698805352628409, -0.055262901070731806, 0.08514456705290424, 0.12390025882458544, 0.031239988963306136, -0.01748873047397075, -0.26175302963154723, 0.3056020600762055, 0.034220917993113845, 0.3621039798156733, 0.007201119813979028, 0.07766890997085414, -0.004487549598547686, -0.06663834619283884, 0.042348567334716154, -0.058599658326472646, 0.15768105497716395, 0.3204800587810746, 0.1937894594328723, 0.3123774345671068, -0.45392890475631, -0.2712191735205066, 0.10473393342843598, 0.1611057682988091, 0.13625257312517522, -0.0011682699672043865, -0.3067550300972989, 0.06947688972605282, -0.14387689696706504, -0.06550577798101354, -0.1623893667947486, -0.0071522631803972725, 0.021610807331067426, -0.2658446505294734, 0.06221758860137418, 0.04230549824479745, 0.09425024090119567, -0.05035776877129359, -0.13644829983693135, 0.00389472400469045, 0.15508439601213483, 0.08571756593335747, 0.05603596927186259, 0.10761258395321935, -0.16459687914021812, -0.16145067351250594, 0.3513927314533904, -0.06306648228357618, -0.21246439240412765, 0.22149656548264968, -0.06173128245836235, -0.1546686658324058, 0.0737996593904329, 0.27796645492753125, 0.10299390615279456, -0.15367821075645577, 0.005027678928387154, -0.012636478081720314, 0.1227146281018497, -0.004153330086830603, -0.0043537396700140014, 0.16723818209094637, 0.25624883443811, -0.009267485357331209, 0.11506645543829155, -0.12469314057317347, -0.08965222920435834, -0.16896005242365408, -0.11634105328559519, -0.16327521825520938, -0.006050586116043814, -0.08340389189364637, -0.16371646468595794, 0.39332865463825784, 0.19396845521256922, 0.20605157599209314, 0.042153441012313816, 0.3402101137263485, 0.03692561564725857, 0.14280831952768552, 0.03686885687520735, 0.18322200594568233, 0.09139469608615117, 0.14981362764701336, -0.15622113874521612, 0.05971616082379513, -0.020293803119719348] |
1,802.03213 | MULTIGRAIN: A smoothed particle hydrodynamics algorithm for multiple
small dust grains and gas | We present a new algorithm, MULTIGRAIN, for modelling the dynamics of an
entire population of small dust grains immersed in gas, typical of conditions
that are found in molecular clouds and protoplanetary discs. The MULTIGRAIN
method is more accurate than single-phase simulations because the gas
experiences a backreaction from each dust phase and communicates this change to
the other phases, thereby indirectly coupling the dust phases together. The
MULTIGRAIN method is fast, explicit and low storage, requiring only an array of
dust fractions and their derivatives defined for each resolution element.
| astro-ph.IM astro-ph.EP | we present a new algorithm multigrain for modelling the dynamics of an entire population of small dust grains immersed in gas typical of conditions that are found in molecular clouds and protoplanetary discs the multigrain method is more accurate than singlephase simulations because the gas experiences a backreaction from each dust phase and communicates this change to the other phases thereby indirectly coupling the dust phases together the multigrain method is fast explicit and low storage requiring only an array of dust fractions and their derivatives defined for each resolution element | [['we', 'present', 'a', 'new', 'algorithm', 'multigrain', 'for', 'modelling', 'the', 'dynamics', 'of', 'an', 'entire', 'population', 'of', 'small', 'dust', 'grains', 'immersed', 'in', 'gas', 'typical', 'of', 'conditions', 'that', 'are', 'found', 'in', 'molecular', 'clouds', 'and', 'protoplanetary', 'discs', 'the', 'multigrain', 'method', 'is', 'more', 'accurate', 'than', 'singlephase', 'simulations', 'because', 'the', 'gas', 'experiences', 'a', 'backreaction', 'from', 'each', 'dust', 'phase', 'and', 'communicates', 'this', 'change', 'to', 'the', 'other', 'phases', 'thereby', 'indirectly', 'coupling', 'the', 'dust', 'phases', 'together', 'the', 'multigrain', 'method', 'is', 'fast', 'explicit', 'and', 'low', 'storage', 'requiring', 'only', 'an', 'array', 'of', 'dust', 'fractions', 'and', 'their', 'derivatives', 'defined', 'for', 'each', 'resolution', 'element']] | [-0.10280243909641446, 0.125745748643377, -0.07374746935534199, 0.029064610739914024, -0.034856100843011675, -0.09964694147213148, 0.01850743437503147, 0.4051940897991369, -0.2264350437774108, -0.29098480686054123, 0.09458758808150478, -0.24570321505070553, -0.039430614453382216, 0.16275249318229956, -0.018430838021091543, 0.000467977578659634, 0.03643599517930012, -0.10200534547566549, -0.04645532025101052, -0.2337541566076842, 0.2673246751611049, 0.08719636713778907, 0.1785816198296763, 0.011836311955818558, 0.10872826387512159, -0.10390602422693929, -0.05087456266539028, -0.013538768596865319, -0.14581760849362652, 0.08602841150343091, 0.19677920080721378, 0.06766329012852121, 0.20472592717179885, -0.4749045747403915, -0.24082413829535573, 0.08702237281825516, 0.1629555921177738, 0.12069126565500603, -0.08521916335375064, -0.22803381706618672, 0.03247858412502395, -0.181847442716749, -0.1567000667922772, -0.02441531479880623, 0.048709362059585995, 0.016427423231876813, -0.29042452953469294, 0.08158641330549841, 0.010788183720720993, 0.07452918207886947, -0.09779146981968002, -0.10585229831317869, -0.04997877714193457, 0.09871824180507767, -0.02699032200725524, 0.011514603907426636, 0.2203331955114973, -0.14368844186569882, 0.018920692159784036, 0.4142547164644514, -0.06909040768280918, -0.14739642591103091, 0.2555619135683218, -0.17916204252793289, -0.12232712528970256, 0.2395432105103692, 0.1598772805268559, 0.15164774953090882, -0.14971976347042473, 0.027830374698668902, -0.025895062486057753, 0.2146645766979718, 0.021534979348531463, 0.03992186648934916, 0.2988391006058389, 0.16542443929874634, 0.03760634666656727, 0.13646561010794428, -0.12275709782901047, -0.10525673143770341, -0.23233047305161114, -0.19614716155750672, -0.1775366933299945, -0.015532052963153346, -0.1544360600323621, -0.14701630035927007, 0.3047005207492755, 0.1350598612488094, 0.1892770818219735, 0.03132114730069189, 0.36355657363822175, 0.03525234834587836, 0.06195392185095493, 0.11129340552213182, 0.20429611805273773, 0.10788641128034054, 0.12236626258447439, -0.24944996077741322, 0.1065123649416389, 0.03975249163724564] |
1,802.03214 | Vector-Interaction-Enhanced Bag Model | A commonly applied quark matter model in astrophysics is the thermodynamic
bag model (tdBAG). The original MIT bag model approximates the effect of quark
confinement, but does not explicitly account for the breaking of chiral
symmetry, an important property of Quantum Chromodynamics (QCD). It further
ignores vector repulsion. The vector-interaction-enhanced bag model (vBag)
improves the tdBAG approach by accounting for both dynamical chiral symmetry
breaking and repulsive vector interactions. The latter is of particular
importance to studies of dense matter in beta-equilibriumto explain the two
solar mass maximum mass constraint for neutron stars. The model is motivated by
analyses of QCD based Dyson-Schwinger equations (DSE), assuming a simple
quark-quark contact interaction. Here, we focus on the study of hybrid neutron
star properties resulting from the application of vBag and will discuss
possible extensions.
| nucl-th astro-ph.HE hep-ph | a commonly applied quark matter model in astrophysics is the thermodynamic bag model tdbag the original mit bag model approximates the effect of quark confinement but does not explicitly account for the breaking of chiral symmetry an important property of quantum chromodynamics qcd it further ignores vector repulsion the vectorinteractionenhanced bag model vbag improves the tdbag approach by accounting for both dynamical chiral symmetry breaking and repulsive vector interactions the latter is of particular importance to studies of dense matter in betaequilibriumto explain the two solar mass maximum mass constraint for neutron stars the model is motivated by analyses of qcd based dysonschwinger equations dse assuming a simple quarkquark contact interaction here we focus on the study of hybrid neutron star properties resulting from the application of vbag and will discuss possible extensions | [['a', 'commonly', 'applied', 'quark', 'matter', 'model', 'in', 'astrophysics', 'is', 'the', 'thermodynamic', 'bag', 'model', 'tdbag', 'the', 'original', 'mit', 'bag', 'model', 'approximates', 'the', 'effect', 'of', 'quark', 'confinement', 'but', 'does', 'not', 'explicitly', 'account', 'for', 'the', 'breaking', 'of', 'chiral', 'symmetry', 'an', 'important', 'property', 'of', 'quantum', 'chromodynamics', 'qcd', 'it', 'further', 'ignores', 'vector', 'repulsion', 'the', 'vectorinteractionenhanced', 'bag', 'model', 'vbag', 'improves', 'the', 'tdbag', 'approach', 'by', 'accounting', 'for', 'both', 'dynamical', 'chiral', 'symmetry', 'breaking', 'and', 'repulsive', 'vector', 'interactions', 'the', 'latter', 'is', 'of', 'particular', 'importance', 'to', 'studies', 'of', 'dense', 'matter', 'in', 'betaequilibriumto', 'explain', 'the', 'two', 'solar', 'mass', 'maximum', 'mass', 'constraint', 'for', 'neutron', 'stars', 'the', 'model', 'is', 'motivated', 'by', 'analyses', 'of', 'qcd', 'based', 'dysonschwinger', 'equations', 'dse', 'assuming', 'a', 'simple', 'quarkquark', 'contact', 'interaction', 'here', 'we', 'focus', 'on', 'the', 'study', 'of', 'hybrid', 'neutron', 'star', 'properties', 'resulting', 'from', 'the', 'application', 'of', 'vbag', 'and', 'will', 'discuss', 'possible', 'extensions']] | [-0.08966894568484418, 0.20660278023825338, -0.10932451787889928, 0.12653999050696138, -0.13889867570677786, -0.09755815099302736, 0.04029050833218596, 0.3197831422488653, -0.19527531479208068, -0.2704400841310222, 0.00794450965894827, -0.2681425834813987, -0.09561592661455728, 0.08280177555359786, 0.024072700770187923, 0.07343682796047389, 0.04258506617132034, 0.06682644333363376, -0.0996924041710858, -0.20717500252044896, 0.34806516445917257, -0.001948501030516363, 0.2662881380195893, 0.16036734289582108, 0.06893314274013725, 0.03806151852512889, -0.013229207540968901, -0.01905660183730585, -0.117766868522149, 0.02120803147892091, 0.16360625242130147, 0.06323166726555192, 0.1743953101166332, -0.40143173072088995, -0.28737894961439814, 0.07520356202028862, 0.12351707825774881, 0.13633281655453203, -0.07121023985838076, -0.281912101987209, 0.056953610162755464, -0.24006516395406868, -0.1582384106582244, -0.0976769002723216, -0.02851564158731716, -0.02978564531521033, -0.29649373267969215, 0.10276772507078917, 0.05873853080076848, -0.0057294763862830765, -0.09224640554748476, -0.15614874682652244, -0.035359389212636545, 0.05620148071294068, 0.0713172018028554, 0.0474252664139281, 0.13614858989070616, -0.2290583726032886, -0.07845242256396415, 0.4877506873876084, -0.04562005875827674, -0.16517684483573636, 0.13935232861856184, -0.09762679072068507, -0.16317835402895361, 0.06525604045445113, 0.16062327903759388, 0.0911550096063768, -0.19814387481403714, 0.14547205954445314, -0.05962893205431809, 0.16506090752943953, 0.02778787024404484, 3.147365806183515e-05, 0.27881263930329214, 0.23870599625822342, -0.044639572575830545, 0.09202842114365282, -0.044602671145809854, -0.17844770701632315, -0.333965472372263, -0.06036437108032121, -0.16485215825888946, -0.012436773398609383, -0.1214519819804158, -0.1608265173329993, 0.36077287518739243, 0.18026208954699735, 0.16568771970479657, -0.0167211446118406, 0.30619170419686964, 0.08756415495108671, 0.07741219840209775, 0.0361582554613759, 0.27639939854248563, 0.20895060290802867, 0.08042420649844158, -0.31458218262232274, 0.019228146734953155, 0.12909454272931997] |
1,802.03215 | Passive tracer in non-Markovian, Gaussian velocity field | We consider the trajectory of a tracer that is the solution of an ordinary
differential equation $\dot\bbX(t)=\bbV(t, \bbX(t)),\ X(0)=0$, with the right
hand side, that is a stationary, zero-mean, Gaussian vector field with
incompressible realizations. It is known, see [K-F;C-X;K-L-O], that
$\bbX(t)/\sqrt{t}$ converges in law, as $t\to+\infty$, to a normal, zero mean
vector, provided that the field $V(t,x)$ is Markovian and has the spectral gap
property. We wish to extend this result to the case when the field is not
Markovian and its covariance matrix is given by a completely monotone Bernstein
function.
| math.PR | we consider the trajectory of a tracer that is the solution of an ordinary differential equation dotbbxtbbvt bbxt x00 with the right hand side that is a stationary zeromean gaussian vector field with incompressible realizations it is known see kfcxklo that bbxtsqrtt converges in law as ttoinfty to a normal zero mean vector provided that the field vtx is markovian and has the spectral gap property we wish to extend this result to the case when the field is not markovian and its covariance matrix is given by a completely monotone bernstein function | [['we', 'consider', 'the', 'trajectory', 'of', 'a', 'tracer', 'that', 'is', 'the', 'solution', 'of', 'an', 'ordinary', 'differential', 'equation', 'dotbbxtbbvt', 'bbxt', 'x00', 'with', 'the', 'right', 'hand', 'side', 'that', 'is', 'a', 'stationary', 'zeromean', 'gaussian', 'vector', 'field', 'with', 'incompressible', 'realizations', 'it', 'is', 'known', 'see', 'kfcxklo', 'that', 'bbxtsqrtt', 'converges', 'in', 'law', 'as', 'ttoinfty', 'to', 'a', 'normal', 'zero', 'mean', 'vector', 'provided', 'that', 'the', 'field', 'vtx', 'is', 'markovian', 'and', 'has', 'the', 'spectral', 'gap', 'property', 'we', 'wish', 'to', 'extend', 'this', 'result', 'to', 'the', 'case', 'when', 'the', 'field', 'is', 'not', 'markovian', 'and', 'its', 'covariance', 'matrix', 'is', 'given', 'by', 'a', 'completely', 'monotone', 'bernstein', 'function']] | [-0.10913729194284867, 0.11895845913909653, -0.11314368733529294, 0.03335093833595054, -0.0964064832745392, -0.16833340101927685, -0.01321110354338804, 0.36116267410054637, -0.3151276054153784, -0.172694712437773, 0.12076712326340251, -0.2941656864635395, -0.152853170598156, 0.13504793072705357, -0.07729614812755183, 0.05397258762183882, 0.01385680776549859, 0.10455157036443105, -0.05315740179437935, -0.2257001317273616, 0.3382458241886637, 0.0096652473773012, 0.24049373035151722, -0.022111696828146246, 0.14065431059976474, 0.010328943412123101, 0.024713309943477174, 0.013820646529535898, -0.13249483162679793, 0.020008546977795746, 0.21910667266654835, 0.11168563468486406, 0.30079504734512125, -0.34489806548932966, -0.18798411844737745, 0.15151384856494332, 0.1264189329584328, 0.08708814196707157, -0.03217434711503179, -0.2557094845831855, 0.11237059229346558, -0.12527947030501085, -0.2008543127750078, -0.02856942541698475, 0.02320931312298465, 0.04769838439154156, -0.3355270182776652, 0.09113127427447713, 0.12555898807477206, -0.008498710281937645, -0.04447474683441347, -0.09411343869889217, -0.019035599560717518, 0.08477059587361448, 0.08026718859838092, 0.09355623086160991, 0.10554173628091969, -0.13207139696120127, -0.06333512777928263, 0.33025660193159007, -0.14882443740105863, -0.29412587357454756, 0.14054350487448358, -0.18614523199104357, -0.054806864140241336, 0.11986810776792216, 0.08938726324462488, 0.11003001489628465, -0.1711843848063969, 0.17346479473609394, -0.11754345274373387, 0.1540977409909992, 0.014339234889223335, -0.022778618348281036, 0.12064850843103414, 0.10609005308144967, 0.1590524902619589, 0.13989446637130099, -0.0679055180052672, -0.12194613180531377, -0.3340779376226697, -0.18902412535141358, -0.22198140654180545, 0.12140045018397073, -0.06723525944352934, -0.21387836000662339, 0.3463329908233973, 0.10900515910196171, 0.19287560433358625, 0.09390162908880229, 0.28271723288540423, 0.23602576253888605, -0.011499947214268901, 0.1020466811599189, 0.19065808619927155, 0.21498561544040365, 0.10726260980381892, -0.16777967985750836, 0.059801588473276476, 0.057377199108680985] |
1,802.03216 | Balancing Two-Player Stochastic Games with Soft Q-Learning | Within the context of video games the notion of perfectly rational agents can
be undesirable as it leads to uninteresting situations, where humans face tough
adversarial decision makers. Current frameworks for stochastic games and
reinforcement learning prohibit tuneable strategies as they seek optimal
performance. In this paper, we enable such tuneable behaviour by generalising
soft Q-learning to stochastic games, where more than one agent interact
strategically. We contribute both theoretically and empirically. On the theory
side, we show that games with soft Q-learning exhibit a unique value and
generalise team games and zero-sum games far beyond these two extremes to cover
a continuous spectrum of gaming behaviour. Experimentally, we show how tuning
agents' constraints affect performance and demonstrate, through a neural
network architecture, how to reliably balance games with high-dimensional
representations.
| cs.AI | within the context of video games the notion of perfectly rational agents can be undesirable as it leads to uninteresting situations where humans face tough adversarial decision makers current frameworks for stochastic games and reinforcement learning prohibit tuneable strategies as they seek optimal performance in this paper we enable such tuneable behaviour by generalising soft qlearning to stochastic games where more than one agent interact strategically we contribute both theoretically and empirically on the theory side we show that games with soft qlearning exhibit a unique value and generalise team games and zerosum games far beyond these two extremes to cover a continuous spectrum of gaming behaviour experimentally we show how tuning agents constraints affect performance and demonstrate through a neural network architecture how to reliably balance games with highdimensional representations | [['within', 'the', 'context', 'of', 'video', 'games', 'the', 'notion', 'of', 'perfectly', 'rational', 'agents', 'can', 'be', 'undesirable', 'as', 'it', 'leads', 'to', 'uninteresting', 'situations', 'where', 'humans', 'face', 'tough', 'adversarial', 'decision', 'makers', 'current', 'frameworks', 'for', 'stochastic', 'games', 'and', 'reinforcement', 'learning', 'prohibit', 'tuneable', 'strategies', 'as', 'they', 'seek', 'optimal', 'performance', 'in', 'this', 'paper', 'we', 'enable', 'such', 'tuneable', 'behaviour', 'by', 'generalising', 'soft', 'qlearning', 'to', 'stochastic', 'games', 'where', 'more', 'than', 'one', 'agent', 'interact', 'strategically', 'we', 'contribute', 'both', 'theoretically', 'and', 'empirically', 'on', 'the', 'theory', 'side', 'we', 'show', 'that', 'games', 'with', 'soft', 'qlearning', 'exhibit', 'a', 'unique', 'value', 'and', 'generalise', 'team', 'games', 'and', 'zerosum', 'games', 'far', 'beyond', 'these', 'two', 'extremes', 'to', 'cover', 'a', 'continuous', 'spectrum', 'of', 'gaming', 'behaviour', 'experimentally', 'we', 'show', 'how', 'tuning', 'agents', 'constraints', 'affect', 'performance', 'and', 'demonstrate', 'through', 'a', 'neural', 'network', 'architecture', 'how', 'to', 'reliably', 'balance', 'games', 'with', 'highdimensional', 'representations']] | [-0.05758107173743565, 0.06878759035172353, -0.1182772764004767, 0.11788407768983081, -0.12318465489723528, -0.24543877791449825, 0.09396430938140284, 0.49565774237537996, -0.3006992950744017, -0.3177925831378786, 0.061335034891056565, -0.257716960860203, -0.2596617953723851, 0.11987214362717995, -0.19166607047672887, 0.047785279895569986, 0.06926551753413358, 0.012920601901292574, 0.06179918321818184, -0.28200318950107534, 0.2988271711728329, -0.007702950281553141, 0.23686590217558653, 0.02121123804831664, 0.1307561056624444, 0.018460660935592843, 0.06176259175995152, 0.07293596716494591, -0.10447814842564532, 0.10562414634183674, 0.37862513664548236, 0.1766521373109622, 0.39853857473100585, -0.44592535181525556, -0.1928959579175011, 0.18179855470808634, 0.1361866369696853, 0.07237053073885787, 0.01286665610433645, -0.3132661240440189, 0.05884045073389296, -0.21952866026171916, -0.02866497528490447, -0.13678048189573047, -0.07217293436184014, 0.030201576294676038, -0.2918452816226214, -0.057993885858396765, 0.03075202949032301, 0.0539455434968624, -0.049248624813408796, -0.08251108936894372, 0.032699207274975495, 0.1783930716239883, 0.032809095474525235, -0.03351040373961548, 0.20278775323011722, -0.22358233846176614, -0.242621889064188, 0.35354175151304434, -0.053961927716941076, -0.18635300069848318, 0.19912296159989165, -0.04352091824571879, -0.12810676407694588, 0.07250222829277166, 0.2265220705334467, 0.14762029677401972, -0.12679522577673197, 0.030544333216353883, -0.06712134236484084, 0.1924077448042337, 0.06173982526858174, 0.05109938162642012, 0.17836797746068989, 0.1954319786266175, 0.15017766317793432, 0.12888606635494626, 0.03811987437030571, -0.2050726388168756, -0.2063327186620076, -0.060925780784850586, -0.1044419930771505, 0.016977553981007965, -0.09672275704155296, -0.14151460170934246, 0.3308500273825018, 0.22946186961591927, 0.1414607388912949, 0.15808295324188834, 0.30705836263862046, 0.04683398372113335, 0.04144903694329257, 0.08241241825086897, 0.235194711892631, 0.02722848261322627, 0.16342135742377803, -0.19359016636713544, 0.13677227881004791, 0.004569504493563116] |
1,802.03217 | Diffusion of Elements in the Interstellar Medium in Early-Type Galaxies | We consider the role of diffusion in the redistribution of elements in the
hot interstellar medium (ISM) of early-type galaxies. It is well known that
gravitational sedimentation can affect significantly the abundances of helium
and heavy elements in the intracluster gas of massive galaxy clusters. The
self-similarity of the temperature profiles and tight mass--temperature
relation of relaxed cool-core clusters suggest that the maximum effect of
sedimentation take place in the most massive virialized objects in the
Universe. However, Chandra and XMM-Newton observations demonstrate more complex
scaling relations between the masses of early-type galaxies and other
parameters, such as the ISM temperature and gas mass fraction. An important
fact is that early-type galaxies can show both decreasing and increasing radial
temperature profiles. We have calculated the diffusion based on the observed
gas density and temperature distributions for 13 early-type galaxies that
belonging to the different environments and cover a wide range of X-ray
luminosities. To estimate the maximum effect of sedimentation and thermal
diffusion, we have solved the full set of Burgers' equations for a
non-magnetized ISM plasma. The results obtained demonstrate a considerable
increase of the He/H ratio within one effective radius for all galaxies of our
sample. For galaxies with a flat or declining radial temperature profile the
average increase of the helium abundance is 60\% in one billion years of
diffusion. The revealed effect can introduce a significant bias in the metal
abundance measurements based on X-ray spectroscopy and can affect the evolution
of stars that could be formed from a gas with a high helium abundance.
| astro-ph.HE astro-ph.GA | we consider the role of diffusion in the redistribution of elements in the hot interstellar medium ism of earlytype galaxies it is well known that gravitational sedimentation can affect significantly the abundances of helium and heavy elements in the intracluster gas of massive galaxy clusters the selfsimilarity of the temperature profiles and tight masstemperature relation of relaxed coolcore clusters suggest that the maximum effect of sedimentation take place in the most massive virialized objects in the universe however chandra and xmmnewton observations demonstrate more complex scaling relations between the masses of earlytype galaxies and other parameters such as the ism temperature and gas mass fraction an important fact is that earlytype galaxies can show both decreasing and increasing radial temperature profiles we have calculated the diffusion based on the observed gas density and temperature distributions for 13 earlytype galaxies that belonging to the different environments and cover a wide range of xray luminosities to estimate the maximum effect of sedimentation and thermal diffusion we have solved the full set of burgers equations for a nonmagnetized ism plasma the results obtained demonstrate a considerable increase of the heh ratio within one effective radius for all galaxies of our sample for galaxies with a flat or declining radial temperature profile the average increase of the helium abundance is 60 in one billion years of diffusion the revealed effect can introduce a significant bias in the metal abundance measurements based on xray spectroscopy and can affect the evolution of stars that could be formed from a gas with a high helium abundance | [['we', 'consider', 'the', 'role', 'of', 'diffusion', 'in', 'the', 'redistribution', 'of', 'elements', 'in', 'the', 'hot', 'interstellar', 'medium', 'ism', 'of', 'earlytype', 'galaxies', 'it', 'is', 'well', 'known', 'that', 'gravitational', 'sedimentation', 'can', 'affect', 'significantly', 'the', 'abundances', 'of', 'helium', 'and', 'heavy', 'elements', 'in', 'the', 'intracluster', 'gas', 'of', 'massive', 'galaxy', 'clusters', 'the', 'selfsimilarity', 'of', 'the', 'temperature', 'profiles', 'and', 'tight', 'masstemperature', 'relation', 'of', 'relaxed', 'coolcore', 'clusters', 'suggest', 'that', 'the', 'maximum', 'effect', 'of', 'sedimentation', 'take', 'place', 'in', 'the', 'most', 'massive', 'virialized', 'objects', 'in', 'the', 'universe', 'however', 'chandra', 'and', 'xmmnewton', 'observations', 'demonstrate', 'more', 'complex', 'scaling', 'relations', 'between', 'the', 'masses', 'of', 'earlytype', 'galaxies', 'and', 'other', 'parameters', 'such', 'as', 'the', 'ism', 'temperature', 'and', 'gas', 'mass', 'fraction', 'an', 'important', 'fact', 'is', 'that', 'earlytype', 'galaxies', 'can', 'show', 'both', 'decreasing', 'and', 'increasing', 'radial', 'temperature', 'profiles', 'we', 'have', 'calculated', 'the', 'diffusion', 'based', 'on', 'the', 'observed', 'gas', 'density', 'and', 'temperature', 'distributions', 'for', '13', 'earlytype', 'galaxies', 'that', 'belonging', 'to', 'the', 'different', 'environments', 'and', 'cover', 'a', 'wide', 'range', 'of', 'xray', 'luminosities', 'to', 'estimate', 'the', 'maximum', 'effect', 'of', 'sedimentation', 'and', 'thermal', 'diffusion', 'we', 'have', 'solved', 'the', 'full', 'set', 'of', 'burgers', 'equations', 'for', 'a', 'nonmagnetized', 'ism', 'plasma', 'the', 'results', 'obtained', 'demonstrate', 'a', 'considerable', 'increase', 'of', 'the', 'heh', 'ratio', 'within', 'one', 'effective', 'radius', 'for', 'all', 'galaxies', 'of', 'our', 'sample', 'for', 'galaxies', 'with', 'a', 'flat', 'or', 'declining', 'radial', 'temperature', 'profile', 'the', 'average', 'increase', 'of', 'the', 'helium', 'abundance', 'is', '60', 'in', 'one', 'billion', 'years', 'of', 'diffusion', 'the', 'revealed', 'effect', 'can', 'introduce', 'a', 'significant', 'bias', 'in', 'the', 'metal', 'abundance', 'measurements', 'based', 'on', 'xray', 'spectroscopy', 'and', 'can', 'affect', 'the', 'evolution', 'of', 'stars', 'that', 'could', 'be', 'formed', 'from', 'a', 'gas', 'with', 'a', 'high', 'helium', 'abundance']] | [-0.06119346631013044, 0.15969780226680585, -0.06999218225853093, 0.07373345626156748, -0.04861897121149414, -0.025416079166068417, 0.03795595018329768, 0.3904967699343749, -0.169392160239313, -0.35966651468280647, 0.014434955088677008, -0.3087246192818774, -0.017088898531526227, 0.18088745821580204, 0.01104983375551589, -0.011866725604571257, 0.04663069241250502, -0.06714671930571493, -0.06185602756310614, -0.29243189715384776, 0.3149268088437991, 0.05875546841892957, 0.2211311127681242, 0.01948919615790996, 0.057389585737050886, -0.09806504934620457, -0.060457713538816765, 0.041869043280428064, -0.14718315595107284, 0.018274868270795806, 0.21196420049307416, 0.10123318706056585, 0.22110256674415413, -0.395369346577059, -0.26682818824835264, 0.08530788214986922, 0.2216584472134925, 0.06604767398833222, -0.11819147768873824, -0.22730465930739138, 0.03858450573260454, -0.183661830093726, -0.1669392689809016, 0.04804499880599512, 0.05608198800911717, 0.05345516498461294, -0.22910308312538394, 0.19685371666524154, 0.008323789082025268, 0.06859948752901039, -0.13084987800075712, -0.11941857036952878, -0.08088460797533882, 0.08264289417081157, 0.014600841472588137, 0.006936654144211252, 0.23587832874240908, -0.13745688266771697, 0.03282369306746108, 0.43475481281668293, -0.11453745395132128, -0.021848765776302077, 0.22431934908037812, -0.22009551940435493, -0.15715219830720178, 0.12359510183345138, 0.18845467125227439, 0.10125301443813477, -0.1393047552951342, 0.006531466022007973, -0.04667644090069508, 0.2112737669228328, 0.051389721695074816, 0.05039553998518442, 0.2878196224476782, 0.1342549238283849, 0.0355483473572542, 0.0844055513694476, -0.17342467691109276, -0.03324736314951568, -0.18636913396935895, -0.15862414275581901, -0.12401857535160618, 0.06040054779593261, -0.17871818666265016, -0.1355405432818472, 0.3144630167011215, 0.12567117263411953, 0.22803614757286247, 0.04225109321241443, 0.300679797752541, 0.11344158067014005, 0.10035971050693664, 0.12100846670086146, 0.2905259817473691, 0.21016595830141233, 0.0967452601798447, -0.28695741899645955, 0.10207285752706949, -0.015202970894837471] |
1,802.03218 | Concentration and energy invariance for a class of fully nonlinear
elliptic equations | We study the asymptotic behaviour of positive solutions of fully nonlinear
elliptic equations in a ball, as the exponent of the power nonlinearity
approaches a critical value. We show that solutions concentrate and blow up at
the center of the ball, while a suitable associated energy remains invariant.
| math.AP | we study the asymptotic behaviour of positive solutions of fully nonlinear elliptic equations in a ball as the exponent of the power nonlinearity approaches a critical value we show that solutions concentrate and blow up at the center of the ball while a suitable associated energy remains invariant | [['we', 'study', 'the', 'asymptotic', 'behaviour', 'of', 'positive', 'solutions', 'of', 'fully', 'nonlinear', 'elliptic', 'equations', 'in', 'a', 'ball', 'as', 'the', 'exponent', 'of', 'the', 'power', 'nonlinearity', 'approaches', 'a', 'critical', 'value', 'we', 'show', 'that', 'solutions', 'concentrate', 'and', 'blow', 'up', 'at', 'the', 'center', 'of', 'the', 'ball', 'while', 'a', 'suitable', 'associated', 'energy', 'remains', 'invariant']] | [-0.17986676459743953, 0.05562014212288583, -0.0991858410416171, 0.04255395895355226, -0.041416892574488884, -0.137541234716385, 0.03234739470644854, 0.27554753919442493, -0.2867871797643602, -0.19000780097364137, 0.1720180080034576, -0.33985147640729946, -0.1156320374769469, 0.18460465385578573, -0.025198474492450867, 0.15466358444731063, 0.035910661720360317, 0.09680486751797919, -0.09062190637632739, -0.19402396849667033, 0.41446880872050923, -0.006552033281574647, 0.25828587252181023, 0.060434562677983195, 0.15251390209111074, -0.09657108950098821, 0.042624760166897126, 0.04549510126040938, -0.20671879463846685, 0.09120445239629286, 0.20572372124297544, 0.01787486480801211, 0.334742480268081, -0.35227501299232244, -0.19858222646871582, 0.13388048811854483, 0.14606682261607298, 0.05983363452348082, -0.06818440833982702, -0.20028882819072655, 0.1314199867483694, -0.1078261628135806, -0.26902388552358997, -0.05223786975936188, 0.034480715597358845, 0.07559976869742968, -0.26828671390345943, 0.11142746863576274, 0.08758530073100701, 0.031278881787632905, -0.13149999838788062, -0.05209153988592637, 0.010034428031455414, 0.08922349532561687, 0.07959254006952203, 0.00874680627748603, 0.10224517747216548, -0.1974358962615952, -0.05493842775467783, 0.3612525916347901, -0.08927295027145495, -0.22439634592349952, 0.11659798685771723, -0.19716279067021483, -0.09280890327257414, 0.1537765065440908, 0.22005711478414014, 0.16262322575009117, -0.08098400991487627, 0.17038543961704514, -0.023020319708545383, 0.16629318236179338, 0.09845361702415782, -0.008120057512617981, 0.15150953617800647, 0.13351235527079552, 0.12817209802354532, 0.14296525697379062, -0.003934275786984169, -0.11581911201938055, -0.3549184125343648, -0.16140685500189042, -0.12744848768731268, 0.12538987421430647, -0.10301315143169631, -0.16302941335986057, 0.41541429826368886, 0.07669329185349245, 0.24759464691548297, 0.08417508328178276, 0.21930569844941297, 0.18247901902213925, 0.029872739367419854, 0.12002649195104216, 0.242381761665456, 0.07432364540485044, 0.1407796934605964, -0.2649750128233184, -0.0241901302797487, 0.09660309423149253] |
1,802.03219 | An LTE effective temperature scale for red supergiants in the Magellanic
clouds | We present a self-consistent study of cool supergiants (CSGs) belonging to
the Magellanic clouds. We calculated stellar atmospheric parameters using LTE
KURUCZ and MARCS atmospheric models for more than 400 individual targets by
fitting a careful selection of weak metallic lines. We explore the existence of
a T eff scale and its implications in two different metallicity environments
(each Magellanic cloud). Critical and in-depth tests have been performed to
assess the reliability of our stellar parameters (i.e. internal error budget,
NLTE systematics). In addition, several Montercarlo tests have been carried out
to infer the significance of the Teff scale found. Our findingspoint towards a
unique Teff scale that seems to be independent of the environment.
| astro-ph.SR | we present a selfconsistent study of cool supergiants csgs belonging to the magellanic clouds we calculated stellar atmospheric parameters using lte kurucz and marcs atmospheric models for more than 400 individual targets by fitting a careful selection of weak metallic lines we explore the existence of a t eff scale and its implications in two different metallicity environments each magellanic cloud critical and indepth tests have been performed to assess the reliability of our stellar parameters ie internal error budget nlte systematics in addition several montercarlo tests have been carried out to infer the significance of the teff scale found our findingspoint towards a unique teff scale that seems to be independent of the environment | [['we', 'present', 'a', 'selfconsistent', 'study', 'of', 'cool', 'supergiants', 'csgs', 'belonging', 'to', 'the', 'magellanic', 'clouds', 'we', 'calculated', 'stellar', 'atmospheric', 'parameters', 'using', 'lte', 'kurucz', 'and', 'marcs', 'atmospheric', 'models', 'for', 'more', 'than', '400', 'individual', 'targets', 'by', 'fitting', 'a', 'careful', 'selection', 'of', 'weak', 'metallic', 'lines', 'we', 'explore', 'the', 'existence', 'of', 'a', 't', 'eff', 'scale', 'and', 'its', 'implications', 'in', 'two', 'different', 'metallicity', 'environments', 'each', 'magellanic', 'cloud', 'critical', 'and', 'indepth', 'tests', 'have', 'been', 'performed', 'to', 'assess', 'the', 'reliability', 'of', 'our', 'stellar', 'parameters', 'ie', 'internal', 'error', 'budget', 'nlte', 'systematics', 'in', 'addition', 'several', 'montercarlo', 'tests', 'have', 'been', 'carried', 'out', 'to', 'infer', 'the', 'significance', 'of', 'the', 'teff', 'scale', 'found', 'our', 'findingspoint', 'towards', 'a', 'unique', 'teff', 'scale', 'that', 'seems', 'to', 'be', 'independent', 'of', 'the', 'environment']] | [-0.06884628561824, 0.07534441100103798, -0.0751505434117486, 0.11023176977291406, -0.07968551357095419, -0.09421154444798234, 0.13861816666352736, 0.41233416516498655, -0.14605308645528503, -0.38320718127904474, 0.0497243359403693, -0.24883967074277127, 0.01468091309317841, 0.1880876123781555, -0.014518252564071955, 0.04985845443491043, 0.08671949969695271, -0.08649706918400078, -0.057662930073777, -0.2522258138762111, 0.29440315039539955, 0.1040906730309887, 0.1715217948277209, -0.01813526992249278, 0.022821110568165912, -0.16936912153439546, -0.10353004258637012, 0.02242146897030813, -0.17446594069274277, 0.022789911634857413, 0.23889768382563875, 0.11360732197551113, 0.2696907925460718, -0.3683508536902017, -0.28104386444871143, 0.06677523675885678, 0.17861045731346956, 0.04675008251591363, -0.03392359205334657, -0.24585629828208316, 0.08067522266574731, -0.17664380626679826, -0.15926547641495029, -0.02504961373515229, 0.022570331688080213, 0.018581385709823366, -0.28558852207750096, 0.028563400573896624, -0.03318983989569927, 0.1987543657455033, -0.07539485496431754, -0.20777819450507848, -0.06992723261607828, 0.1558015104548066, 0.018793321523683525, -0.005506027512565519, 0.16256443567654383, -0.09456573158453128, 0.019817040948840105, 0.43233078658844515, -0.10772426741620612, -0.06779818367048175, 0.22637367991326723, -0.09595801691582377, -0.19384952825782573, 0.07410895988444048, 0.1648140126402465, 0.13462243064727009, -0.2420860798370126, 0.03432973305564951, -0.020608106479708073, 0.22504470076008115, 0.029358300413375935, 0.038733166744479235, 0.2804771340740597, 0.14116064574058473, 0.0057212382068742166, 0.08550253734806454, -0.22303835790093363, -0.07574827673193892, -0.22319724193188997, -0.10982662363933911, -0.080849079580038, 0.0514880659458417, -0.14369435916591408, -0.15294949114873832, 0.3782426923965681, 0.24493611650541425, 0.19588094381141616, 0.04220949180951688, 0.31676695363975205, 0.055963121496750846, 0.08555033550581244, 0.10153228894238715, 0.2936973030085519, 0.1700040789844419, 0.06870623171922907, -0.28540490467134305, 0.09153486316842316, -0.009280182998132916] |
1,802.0322 | Stabilization of the arrival time of a relativistic electron beam to the
50 fs level | We report the results of a low-latency beam phase feed-forward system built
to stabilize the arrival time of a relativistic electron beam. The system was
operated at the Compact Linear Collider (CLIC) Test Facility (CTF3) at CERN
where the beam arrival time was stabilized to approximately 50 fs. The system
latency was 350 ns and the correction bandwidth >23 MHz. The system meets the
requirements for CLIC.
| physics.acc-ph | we report the results of a lowlatency beam phase feedforward system built to stabilize the arrival time of a relativistic electron beam the system was operated at the compact linear collider clic test facility ctf3 at cern where the beam arrival time was stabilized to approximately 50 fs the system latency was 350 ns and the correction bandwidth 23 mhz the system meets the requirements for clic | [['we', 'report', 'the', 'results', 'of', 'a', 'lowlatency', 'beam', 'phase', 'feedforward', 'system', 'built', 'to', 'stabilize', 'the', 'arrival', 'time', 'of', 'a', 'relativistic', 'electron', 'beam', 'the', 'system', 'was', 'operated', 'at', 'the', 'compact', 'linear', 'collider', 'clic', 'test', 'facility', 'ctf3', 'at', 'cern', 'where', 'the', 'beam', 'arrival', 'time', 'was', 'stabilized', 'to', 'approximately', '50', 'fs', 'the', 'system', 'latency', 'was', '350', 'ns', 'and', 'the', 'correction', 'bandwidth', '23', 'mhz', 'the', 'system', 'meets', 'the', 'requirements', 'for', 'clic']] | [-0.20010293875351798, 0.17066616800599801, -0.036142674941958775, 0.016405859586796655, -0.018055308825656105, -0.2153928272857039, 0.039517218205355, 0.40478449831925223, -0.21911012244049405, -0.3292956815393113, 0.10508156083385224, -0.27002007371759906, 0.0914414210606422, 0.24413015167993396, 0.039923265326156546, 0.15200483611326165, 0.09906500402782391, -0.0187994004227221, -0.08811181638732556, -0.23785560191678468, 0.19412513105059737, 0.262498041364684, 0.306544608895236, 0.035978679030911245, 0.20373511650780243, -0.034838558966120176, 0.07276556971984648, -0.11566530555875888, -0.03566220290819878, -0.0205311663796319, 0.26561971620392444, 0.10436870419044993, 0.22359972258112323, -0.4050075870646692, -0.13560870884736972, 0.019883531448083806, 0.028519174723482844, 0.05402122165507345, -0.028723086730868957, -0.283147092338707, 0.09578957542109845, -0.2182891439340675, -0.16437789216748813, 0.09522014417087854, -0.02795173716383861, 0.02666851156043695, -0.294744423076288, -0.021272303453132288, -0.022652687310282863, 0.04399504294313157, -0.042307949824773, -0.10537287619298519, 0.03139757540132573, 0.010353620191897029, -0.05748337302912972, 0.12802069322136578, 0.19112339825716926, -0.0454728207759448, -0.12043290690227008, 0.37957705993816926, -0.03893623288387238, -0.060997194272584154, 0.14122960106956203, -0.24851078915395844, -0.08079929489628482, 0.20212512780258904, 0.27456011375718153, 0.03599032776346847, -0.1882059531870173, 0.03338147940221868, 0.06719683916933501, 0.26575083691459983, 0.14773334229170387, 0.025588574530834806, 0.1768563119138577, 0.29732549451847573, 0.10541637061831, 0.13304430974383297, -0.2001566350974365, 0.01450617287530383, -0.35064741633415447, -0.099409973068135, -0.11139774511554348, 0.0016177933447674585, 0.017395724445353818, -0.01322619045681473, 0.4409137648433002, 0.09007257138597849, 0.08806367960772407, 0.04825507565192989, 0.32009568849383896, 0.10771159766200207, 0.07160452650312626, 0.1012983846158022, 0.2780497517825952, 0.06812959529959889, 0.2170941966182705, -0.26836753456589224, -0.003580118307093186, -0.0012054152981336437] |
1,802.03221 | Research and Implementation of Global Path Planning for Unmanned Surface
Vehicle Based on Electronic Chart | Unmanned Surface Vehicle (USV) is a new type of intelligent surface craft,
and global path planning is the key technology of USV research, which can
reflect the intelligent level of USV. In order to solve the problem of global
path planning of USV, this paper proposes an improved A* algorithm for sailing
cost optimization based on electronic charts. This paper uses the S-57
electronic chart to realize the establishment of the octree grid environment
model, and proposes an improved A* algorithm based on sailing safety weight,
pilot quantity and path curve smoothing to ensure the safety of the route,
reduce the planning time, and improve path smoothness. The simulation results
show that the environmental model construction method and the improved A*
algorithm can generate safe and reasonable global path.
| cs.RO | unmanned surface vehicle usv is a new type of intelligent surface craft and global path planning is the key technology of usv research which can reflect the intelligent level of usv in order to solve the problem of global path planning of usv this paper proposes an improved a algorithm for sailing cost optimization based on electronic charts this paper uses the s57 electronic chart to realize the establishment of the octree grid environment model and proposes an improved a algorithm based on sailing safety weight pilot quantity and path curve smoothing to ensure the safety of the route reduce the planning time and improve path smoothness the simulation results show that the environmental model construction method and the improved a algorithm can generate safe and reasonable global path | [['unmanned', 'surface', 'vehicle', 'usv', 'is', 'a', 'new', 'type', 'of', 'intelligent', 'surface', 'craft', 'and', 'global', 'path', 'planning', 'is', 'the', 'key', 'technology', 'of', 'usv', 'research', 'which', 'can', 'reflect', 'the', 'intelligent', 'level', 'of', 'usv', 'in', 'order', 'to', 'solve', 'the', 'problem', 'of', 'global', 'path', 'planning', 'of', 'usv', 'this', 'paper', 'proposes', 'an', 'improved', 'a', 'algorithm', 'for', 'sailing', 'cost', 'optimization', 'based', 'on', 'electronic', 'charts', 'this', 'paper', 'uses', 'the', 's57', 'electronic', 'chart', 'to', 'realize', 'the', 'establishment', 'of', 'the', 'octree', 'grid', 'environment', 'model', 'and', 'proposes', 'an', 'improved', 'a', 'algorithm', 'based', 'on', 'sailing', 'safety', 'weight', 'pilot', 'quantity', 'and', 'path', 'curve', 'smoothing', 'to', 'ensure', 'the', 'safety', 'of', 'the', 'route', 'reduce', 'the', 'planning', 'time', 'and', 'improve', 'path', 'smoothness', 'the', 'simulation', 'results', 'show', 'that', 'the', 'environmental', 'model', 'construction', 'method', 'and', 'the', 'improved', 'a', 'algorithm', 'can', 'generate', 'safe', 'and', 'reasonable', 'global', 'path']] | [-0.1449809150362853, 0.04029912895225607, -0.1369957819697447, 0.022729255738340726, -0.10783535819609824, -0.13148432646266883, 0.0837607957309956, 0.39606820230255835, -0.27787111315410584, -0.3597842008166481, 0.10909329540936596, -0.19553792352962773, -0.19657775684754597, 0.20531603868448656, -0.19050341441470664, 0.11425835573027143, 0.0990692703089735, 0.018416685750707984, -0.022347967602854624, -0.22186648922797758, 0.24978420698334958, 0.09606617224198999, 0.3254695858049672, 0.06092144691683643, 0.17403575087155332, 0.04342895822264836, -0.031339490560640115, 0.013459478665026836, -0.1197223689817406, 0.18240394563417794, 0.24938208543971996, 0.19423098774677783, 0.30034265243739355, -0.4517619039688725, -0.22103484399463014, 0.11217427294468507, 0.12537792582588736, 0.07954198498464393, -0.012944689859068603, -0.2874058430461446, 0.07504889174742857, -0.19158658279047813, -0.1603540638134291, -0.05048051731318992, -0.05480016132059973, 0.010799155555559992, -0.2890830910400837, -0.04782677503226296, 0.009154930870863609, 0.06932826633783407, -0.08893622949199198, -0.06255209321534494, -0.01228964926849585, 0.17073820096993586, 0.0015868782975303475, 0.11026977570622876, 0.13835247974020604, -0.11334214932639952, -0.1513383118872298, 0.3726455512951361, 0.01467475416848174, -0.17490723553783027, 0.12209751934642554, -0.001678748278209241, -0.10060457394502009, 0.1271423752696137, 0.25794912264609593, 0.1199819739376835, -0.20947301022533793, 0.055205074294462975, 0.011297275428660214, 0.15893240128207253, -0.0010325636467314325, 0.0018611107989272568, 0.14505702943921506, 0.25778076917049475, 0.22726938658888685, 0.09224983883814275, -0.09027597920749031, -0.0915692994458368, -0.248317608020443, -0.19591078823054886, -0.1421740677797061, -0.03643746895977529, -0.07977075333042194, -0.16590102363170445, 0.407225584553089, 0.22438524220342515, 0.10471944911842002, 0.06300596079836396, 0.3637395992263919, 0.09001221233484102, 0.0392474794921327, 0.1107745510089444, 0.15120369005944667, -0.010074827754579019, 0.12048310480895452, -0.269346576067619, 0.10988819059025445, 0.11510645118323737] |
1,802.03222 | Unitarity violation in non-integer dimensional Gross-Neveu-Yukawa model | We construct an explicit example of unitarity violation in fermionic quantum
field theories in non-integer dimensions. We study the two-point correlation
function of four-fermion operators. We compute the one-loop anomalous
dimensions of these operators in the Gross-Neveu-Yukawa Model. We find that at
one loop order, the four-fermion operators split into three classes with one
class having negative norms. This implies that the theory violates unitarity
following the definition in arXiv:1512.00013 [hep-th].
| hep-th | we construct an explicit example of unitarity violation in fermionic quantum field theories in noninteger dimensions we study the twopoint correlation function of fourfermion operators we compute the oneloop anomalous dimensions of these operators in the grossneveuyukawa model we find that at one loop order the fourfermion operators split into three classes with one class having negative norms this implies that the theory violates unitarity following the definition in arxiv151200013 hepth | [['we', 'construct', 'an', 'explicit', 'example', 'of', 'unitarity', 'violation', 'in', 'fermionic', 'quantum', 'field', 'theories', 'in', 'noninteger', 'dimensions', 'we', 'study', 'the', 'twopoint', 'correlation', 'function', 'of', 'fourfermion', 'operators', 'we', 'compute', 'the', 'oneloop', 'anomalous', 'dimensions', 'of', 'these', 'operators', 'in', 'the', 'grossneveuyukawa', 'model', 'we', 'find', 'that', 'at', 'one', 'loop', 'order', 'the', 'fourfermion', 'operators', 'split', 'into', 'three', 'classes', 'with', 'one', 'class', 'having', 'negative', 'norms', 'this', 'implies', 'that', 'the', 'theory', 'violates', 'unitarity', 'following', 'the', 'definition', 'in', 'arxiv151200013', 'hepth']] | [-0.16936854626318174, 0.1958538270574146, -0.04677705834619701, 0.14057026435454775, -0.0240831477534292, -0.15882077316886611, -0.012608593740567033, 0.28467628319880794, -0.16979034229048662, -0.2300082961629544, 0.01099923413047301, -0.33803351354519173, -0.1840286158557449, 0.07854782719763793, 0.042505501423563276, 0.04460872315934726, -0.05468303174711764, 0.03840234229075057, -0.15571804075235768, -0.2725467233253377, 0.4310444269395832, -0.05785742759471759, 0.215780205439244, 0.10654953141430659, 0.07163590196120952, 0.017920287804944174, -0.027482770187115032, -0.0026805809299860683, -0.13288243066033048, 0.10891773756427159, 0.2080138989724219, 0.04774614585829633, 0.17460422393466746, -0.40359173794942244, -0.17363342999015002, 0.13959039555463407, 0.12874082645534404, 0.12666008725230182, 0.015699263768536705, -0.2622312045789191, 0.015396175560142313, -0.20965989013202488, -0.1995044740449105, -0.1332946836017072, -0.022463663220072965, -0.16243290312122555, -0.2875678295801793, 0.09069994724954346, 0.023201222478279045, 0.055699931297983445, -0.051455888660192226, -0.09218314057216048, 0.015363921690732241, 0.10413483103205051, 0.0781554792857995, -0.007070871625494744, 0.05953430018520781, -0.1751051587485043, -0.18150211873248087, 0.3198090508364008, -0.08535828084319032, -0.2384767088240811, 0.13419849477442247, -0.22774586238914968, -0.22723577429673503, 0.02533410449645349, 0.1388347570085898, 0.10514302122007524, -0.14815408268145153, 0.2162339277166341, -0.07157721708395652, 0.12278925125054749, 0.09311598527378269, 0.0729798955044576, 0.1720094465850187, 0.03900712967318084, 0.07940457222451057, 0.16073804308793374, 0.02557881895585784, -0.1365288711818201, -0.445729518362454, -0.16600643238717958, -0.11633173627778888, 0.09385603002072977, -0.14661593183076807, -0.17766545957752636, 0.4018024604567992, 0.17683646949008108, 0.16592833318614533, 0.08133836878197534, 0.2198954108171165, 0.20104580075879183, 0.15259809007069894, 0.054016833579433814, 0.24060435336349265, 0.12569780460492308, 0.05767665352406246, -0.2550038795386042, -0.09320527813397347, 0.24681680242397955] |
1,802.03223 | Maximum Lyapunov exponent revisited: Long-term attractor divergence of
gait dynamics is highly sensitive to the noise structure of stride intervals | The local dynamic stability method (maximum Lyapunov exponent) can assess
gait stability. Two variants of the method exist: the short-term divergence
exponent (DE), and the long-term DE. Only the short-term DE can predict fall
risk. The significance of long-term DE has been unclear so far. Some studies
have suggested that the complex, fractal-like structure of fluctuations among
consecutive strides correlates with long-term DE. The aim, therefore, was to
assess whether the long-term DE is a gait complexity index. The study
reanalyzed a dataset of trunk accelerations from 100 healthy adults walking at
preferred speed on a treadmill for 10 minutes. By interpolation, the stride
intervals were modified within the acceleration signals for the purpose of
conserving the original shape of the signal, while imposing a known
stride-to-stride fluctuation structure. 4 types of hybrid signals with
different noise structures were built: constant, anti-correlated, random, and
correlated (fractal). Short- and long-term DEs were then computed. The results
show that long-term DEs, but not short-term DEs, are sensitive to the noise
structure of stride intervals. It was that observed that random hybrid signals
exhibited significantly lower long-term DEs than hybrid correlated signals did
(0.100 vs 0.144, i.e. a 44% difference). Long-term DEs from constant hybrid
signals were close to zero (0.006). Short-term DEs of anti-correlated, random,
and correlated hybrid signals were closely grouped (2.49, 2.50, and 2.51). The
short- and long-term DEs, although they are both computed from divergence
curves, should not be interpreted in a similar way. The long-term DE is very
likely an index of gait complexity, which may be associated with gait
automaticity or cautiousness. To better differentiate between short- and
long-term DEs, the use of the term attractor complexity index (ACI) is proposed
for the latter.
| q-bio.QM | the local dynamic stability method maximum lyapunov exponent can assess gait stability two variants of the method exist the shortterm divergence exponent de and the longterm de only the shortterm de can predict fall risk the significance of longterm de has been unclear so far some studies have suggested that the complex fractallike structure of fluctuations among consecutive strides correlates with longterm de the aim therefore was to assess whether the longterm de is a gait complexity index the study reanalyzed a dataset of trunk accelerations from 100 healthy adults walking at preferred speed on a treadmill for 10 minutes by interpolation the stride intervals were modified within the acceleration signals for the purpose of conserving the original shape of the signal while imposing a known stridetostride fluctuation structure 4 types of hybrid signals with different noise structures were built constant anticorrelated random and correlated fractal short and longterm des were then computed the results show that longterm des but not shortterm des are sensitive to the noise structure of stride intervals it was that observed that random hybrid signals exhibited significantly lower longterm des than hybrid correlated signals did 0100 vs 0144 ie a 44 difference longterm des from constant hybrid signals were close to zero 0006 shortterm des of anticorrelated random and correlated hybrid signals were closely grouped 249 250 and 251 the short and longterm des although they are both computed from divergence curves should not be interpreted in a similar way the longterm de is very likely an index of gait complexity which may be associated with gait automaticity or cautiousness to better differentiate between short and longterm des the use of the term attractor complexity index aci is proposed for the latter | [['the', 'local', 'dynamic', 'stability', 'method', 'maximum', 'lyapunov', 'exponent', 'can', 'assess', 'gait', 'stability', 'two', 'variants', 'of', 'the', 'method', 'exist', 'the', 'shortterm', 'divergence', 'exponent', 'de', 'and', 'the', 'longterm', 'de', 'only', 'the', 'shortterm', 'de', 'can', 'predict', 'fall', 'risk', 'the', 'significance', 'of', 'longterm', 'de', 'has', 'been', 'unclear', 'so', 'far', 'some', 'studies', 'have', 'suggested', 'that', 'the', 'complex', 'fractallike', 'structure', 'of', 'fluctuations', 'among', 'consecutive', 'strides', 'correlates', 'with', 'longterm', 'de', 'the', 'aim', 'therefore', 'was', 'to', 'assess', 'whether', 'the', 'longterm', 'de', 'is', 'a', 'gait', 'complexity', 'index', 'the', 'study', 'reanalyzed', 'a', 'dataset', 'of', 'trunk', 'accelerations', 'from', '100', 'healthy', 'adults', 'walking', 'at', 'preferred', 'speed', 'on', 'a', 'treadmill', 'for', '10', 'minutes', 'by', 'interpolation', 'the', 'stride', 'intervals', 'were', 'modified', 'within', 'the', 'acceleration', 'signals', 'for', 'the', 'purpose', 'of', 'conserving', 'the', 'original', 'shape', 'of', 'the', 'signal', 'while', 'imposing', 'a', 'known', 'stridetostride', 'fluctuation', 'structure', '4', 'types', 'of', 'hybrid', 'signals', 'with', 'different', 'noise', 'structures', 'were', 'built', 'constant', 'anticorrelated', 'random', 'and', 'correlated', 'fractal', 'short', 'and', 'longterm', 'des', 'were', 'then', 'computed', 'the', 'results', 'show', 'that', 'longterm', 'des', 'but', 'not', 'shortterm', 'des', 'are', 'sensitive', 'to', 'the', 'noise', 'structure', 'of', 'stride', 'intervals', 'it', 'was', 'that', 'observed', 'that', 'random', 'hybrid', 'signals', 'exhibited', 'significantly', 'lower', 'longterm', 'des', 'than', 'hybrid', 'correlated', 'signals', 'did', '0100', 'vs', '0144', 'ie', 'a', '44', 'difference', 'longterm', 'des', 'from', 'constant', 'hybrid', 'signals', 'were', 'close', 'to', 'zero', '0006', 'shortterm', 'des', 'of', 'anticorrelated', 'random', 'and', 'correlated', 'hybrid', 'signals', 'were', 'closely', 'grouped', '249', '250', 'and', '251', 'the', 'short', 'and', 'longterm', 'des', 'although', 'they', 'are', 'both', 'computed', 'from', 'divergence', 'curves', 'should', 'not', 'be', 'interpreted', 'in', 'a', 'similar', 'way', 'the', 'longterm', 'de', 'is', 'very', 'likely', 'an', 'index', 'of', 'gait', 'complexity', 'which', 'may', 'be', 'associated', 'with', 'gait', 'automaticity', 'or', 'cautiousness', 'to', 'better', 'differentiate', 'between', 'short', 'and', 'longterm', 'des', 'the', 'use', 'of', 'the', 'term', 'attractor', 'complexity', 'index', 'aci', 'is', 'proposed', 'for', 'the', 'latter']] | [-0.1354895594390926, 0.1446955856953425, -0.1334817702624142, 0.13769055155826848, -0.06602264935060878, -0.14469598729098052, 0.0050338593654726685, 0.36623960527542393, -0.25993727213588724, -0.3463666802558133, 0.12491800460368067, -0.2857036968758493, -0.1481473640653125, 0.1921829479076622, -0.12494972537786357, 0.05929120077277746, 0.047166862029974395, 0.020380843072933585, -0.019022887418038426, -0.24819405553127197, 0.2038144706437985, 0.11171113552950453, 0.30636364008144784, -0.06667597538611868, 0.07706621219766563, -0.026293325584316463, -0.06285242987633274, 0.018888343197881782, -0.10472706269131761, 0.08046307344734567, 0.2189150805719883, 0.11487974822112734, 0.26961247553934525, -0.3810962685955721, -0.22256581796529262, 0.12616867419013655, 0.126474360505266, 0.03767287564390388, 0.019363120622655147, -0.2849510012946108, 0.15332283560807505, -0.14511656533117945, -0.08422538494168405, -0.025847385586811263, 0.0386380153528431, 0.06555813655212293, -0.21188819890559993, 0.1398171146155188, 0.020916233572234776, 0.1097426480564632, -0.10194496911411223, -0.12678171039452743, -0.05999117649826395, 0.14744307037459262, 0.045813522868577324, 0.028632095055001087, 0.11492314244734875, -0.0464646900767101, -0.10734395771369076, 0.33908885485705054, -0.10212124497410147, -0.11938832036317572, 0.2018190391222832, -0.13319268673137566, -0.13176458145271203, 0.14078587671709164, 0.15994838833923272, 0.07246171913386461, -0.12861904811273378, 0.01252058934310059, 0.06836196474012053, 0.2518054252461808, 0.10599315644470615, 0.03420558220925414, 0.2196629625042541, 0.12445888512731089, 0.03389571142840411, 0.05702074487783472, -0.14187458134276726, -0.09373537726504239, -0.21492839883400225, -0.1117823727543286, -0.11247900669348605, 0.013387476817986585, -0.10307234685603538, -0.16060056104079673, 0.4027539239836889, 0.10734251418861708, 0.17071098753153102, 0.09160337953444309, 0.23006006845256738, 0.05557276732043216, 0.047324645022346984, 0.06379244661514173, 0.26652660699644976, 0.049909054459758885, 0.13463104463737915, -0.2314474430300802, 0.1101966449108563, 0.017790169827640055] |
1,802.03224 | Unification nets: canonical proof net quantifiers | Proof nets for MLL (unit-free Multiplicative Linear Logic) are concise
graphical representations of proofs which are canonical in the sense that they
abstract away syntactic redundancy such as the order of non-interacting rules.
We argue that Girard's extension to MLL1 (first-order MLL) fails to be
canonical because of redundant existential witnesses, and present canonical
MLL1 proof nets called unification nets without them. For example, while there
are infinitely many cut-free Girard nets $\forall x Px \vdash \exists xPx$, one
per arbitrary choice of witness for $\exists x$, there is a unique cut-free
unification net, with no specified witness.
Redundant existential witnesses cause Girard's MLL1 nets to suffer from
severe complexity issues: (1) cut elimination is non-local and exponential-time
(and -space), and (2) some sequents require exponentially large cut-free Girard
nets. Unification nets solve both problems: (1) cut elimination is local and
linear-time, and (2) cut-free unification nets grow linearly with the size of
the sequent. Since some unification nets are exponentially smaller than
corresponding Girard nets and sequent proofs, technical delicacy is required to
ensure correctness is polynomial-time (quadratic).
These results extend beyond MLL1 via a broader methodological insight: for
canonical quantifiers, the standard parallel/sequential dichotomy of proof nets
fails; an implicit/explicit witness dichotomy is also needed. Work in progress
extends unification nets to additives and uses them to extend combinatorial
proofs [Proofs without syntax, Annals of Mathematics, 2006] to classical
first-order logic.
| math.LO cs.LO | proof nets for mll unitfree multiplicative linear logic are concise graphical representations of proofs which are canonical in the sense that they abstract away syntactic redundancy such as the order of noninteracting rules we argue that girards extension to mll1 firstorder mll fails to be canonical because of redundant existential witnesses and present canonical mll1 proof nets called unification nets without them for example while there are infinitely many cutfree girard nets forall x px vdash exists xpx one per arbitrary choice of witness for exists x there is a unique cutfree unification net with no specified witness redundant existential witnesses cause girards mll1 nets to suffer from severe complexity issues 1 cut elimination is nonlocal and exponentialtime and space and 2 some sequents require exponentially large cutfree girard nets unification nets solve both problems 1 cut elimination is local and lineartime and 2 cutfree unification nets grow linearly with the size of the sequent since some unification nets are exponentially smaller than corresponding girard nets and sequent proofs technical delicacy is required to ensure correctness is polynomialtime quadratic these results extend beyond mll1 via a broader methodological insight for canonical quantifiers the standard parallelsequential dichotomy of proof nets fails an implicitexplicit witness dichotomy is also needed work in progress extends unification nets to additives and uses them to extend combinatorial proofs proofs without syntax annals of mathematics 2006 to classical firstorder logic | [['proof', 'nets', 'for', 'mll', 'unitfree', 'multiplicative', 'linear', 'logic', 'are', 'concise', 'graphical', 'representations', 'of', 'proofs', 'which', 'are', 'canonical', 'in', 'the', 'sense', 'that', 'they', 'abstract', 'away', 'syntactic', 'redundancy', 'such', 'as', 'the', 'order', 'of', 'noninteracting', 'rules', 'we', 'argue', 'that', 'girards', 'extension', 'to', 'mll1', 'firstorder', 'mll', 'fails', 'to', 'be', 'canonical', 'because', 'of', 'redundant', 'existential', 'witnesses', 'and', 'present', 'canonical', 'mll1', 'proof', 'nets', 'called', 'unification', 'nets', 'without', 'them', 'for', 'example', 'while', 'there', 'are', 'infinitely', 'many', 'cutfree', 'girard', 'nets', 'forall', 'x', 'px', 'vdash', 'exists', 'xpx', 'one', 'per', 'arbitrary', 'choice', 'of', 'witness', 'for', 'exists', 'x', 'there', 'is', 'a', 'unique', 'cutfree', 'unification', 'net', 'with', 'no', 'specified', 'witness', 'redundant', 'existential', 'witnesses', 'cause', 'girards', 'mll1', 'nets', 'to', 'suffer', 'from', 'severe', 'complexity', 'issues', '1', 'cut', 'elimination', 'is', 'nonlocal', 'and', 'exponentialtime', 'and', 'space', 'and', '2', 'some', 'sequents', 'require', 'exponentially', 'large', 'cutfree', 'girard', 'nets', 'unification', 'nets', 'solve', 'both', 'problems', '1', 'cut', 'elimination', 'is', 'local', 'and', 'lineartime', 'and', '2', 'cutfree', 'unification', 'nets', 'grow', 'linearly', 'with', 'the', 'size', 'of', 'the', 'sequent', 'since', 'some', 'unification', 'nets', 'are', 'exponentially', 'smaller', 'than', 'corresponding', 'girard', 'nets', 'and', 'sequent', 'proofs', 'technical', 'delicacy', 'is', 'required', 'to', 'ensure', 'correctness', 'is', 'polynomialtime', 'quadratic', 'these', 'results', 'extend', 'beyond', 'mll1', 'via', 'a', 'broader', 'methodological', 'insight', 'for', 'canonical', 'quantifiers', 'the', 'standard', 'parallelsequential', 'dichotomy', 'of', 'proof', 'nets', 'fails', 'an', 'implicitexplicit', 'witness', 'dichotomy', 'is', 'also', 'needed', 'work', 'in', 'progress', 'extends', 'unification', 'nets', 'to', 'additives', 'and', 'uses', 'them', 'to', 'extend', 'combinatorial', 'proofs', 'proofs', 'without', 'syntax', 'annals', 'of', 'mathematics', '2006', 'to', 'classical', 'firstorder', 'logic']] | [-0.09010638981690687, 0.06472334289300664, -0.05788490168339053, 0.19651751354784258, -0.188268528122342, -0.24183576618567174, 0.06834382176282312, 0.33600280431474183, -0.3217592019092864, -0.2729169025964777, 0.08023108296611374, -0.26367558617330283, -0.08410310639810317, 0.12820493414377174, -0.17162058131216956, 0.0652868418281019, 0.02025194745813194, -0.021065556375688806, -0.07238657223067657, -0.25471488118486163, 0.26500366637946887, -0.047292026986460727, 0.19257732937959107, 0.049989092697941766, 0.12630879933324954, 0.03008012636766257, -0.0007935896197341995, 0.001460212135049454, -0.08981809952606001, 0.09688530902144422, 0.34663423909241275, 0.22145606992258268, 0.3232257058148502, -0.4377993313682334, -0.08971337514004199, 0.1569718396033108, 0.11500637030903778, 0.12204000049470258, 0.04248048864946059, -0.26543076187563713, 0.10417250755320613, -0.1551127920319826, -0.06440512659391026, -0.1482612339036894, 0.051667379001679614, -0.00893213529693108, -0.23979726651667324, -0.013570206042896207, 0.29649631177716246, 0.1235122803187409, 0.05129982691129178, -0.12505923327611904, 0.0012494421864404177, -0.018594020062420533, -0.028013202261222017, 0.05532256913677793, 0.07788002393027017, -0.08108118568543038, -0.20983093140850417, 0.3059286679185572, 0.021541602286856393, -0.19780571714801576, 0.19724412587797874, -0.034576143949742136, -0.19230587231849514, 0.12741782535794816, 0.05026782057762098, 0.11068413177105997, -0.09745008421273604, 0.1687198622289287, -0.06593170980655778, 0.23496162308555388, 0.16814583843952907, 0.08122193329268058, 0.1477561639057416, 0.13969667249427728, 0.06558638019260479, 0.12656154387854282, 0.08870426930050725, -0.15471608518699417, -0.3857059663008431, -0.13965147231943356, -0.07291183441079088, 0.022238826360533346, -0.11388575020034543, -0.19600844689500865, 0.2809369399341315, 0.13930088347423766, 0.12846741354452282, 0.23144869910587368, 0.24898995069516783, 0.09903967022811147, 0.14053126923801393, 0.06725466786934167, 0.1613551567893705, 0.17500879132346092, 0.07969195066721409, -0.09064926221478908, 0.08086203497449476, 0.18601601996592113] |
1,802.03225 | Extreme-ultraviolet-initiated High-harmonic Generation in Ar$^{+}$ | We employ the R-matrix with time-dependence method to investigate
extreme-ultraviolet-initiated high-harmonic generation (XIHHG) in Ar$^{+}$.
Using a combination of extreme-ultraviolet (XUV, $92\textrm{ nm}$, $3\times
10^{12}\,\textrm{Wcm}^{-2}$) and time-delayed, infrared (IR, $800\textrm{ nm}$,
$3\times 10^{14}\,\textrm{Wcm}^{-2}$) laser pulses, we demonstrate that control
over both the mechanism, and timing, of ionization can afford significant
enhancements in the yield of plateau, and sub-threshold, harmonics alike. The
presence of the XUV pulse is also shown to alter the relative contribution of
different electron emission pathways. Manifestation of the Ar$^{+}$ electronic
structure is found in the appearance of a pronounced Cooper minimum.
Interferences amongst the outer-valence $3p$, and inner-valence $3s$, electrons
are found to incur only a minor suppression of the harmonic intensities, at
least for the present combination of XUV and IR laser light. Additionally, the
dependence of the XIHHG efficiency on time delay is discussed, and rationalized
with the aid of classical trajectory simulations.
| physics.atom-ph | we employ the rmatrix with timedependence method to investigate extremeultravioletinitiated highharmonic generation xihhg in ar using a combination of extremeultraviolet xuv 92textrm nm 3times 1012textrmwcm2 and timedelayed infrared ir 800textrm nm 3times 1014textrmwcm2 laser pulses we demonstrate that control over both the mechanism and timing of ionization can afford significant enhancements in the yield of plateau and subthreshold harmonics alike the presence of the xuv pulse is also shown to alter the relative contribution of different electron emission pathways manifestation of the ar electronic structure is found in the appearance of a pronounced cooper minimum interferences amongst the outervalence 3p and innervalence 3s electrons are found to incur only a minor suppression of the harmonic intensities at least for the present combination of xuv and ir laser light additionally the dependence of the xihhg efficiency on time delay is discussed and rationalized with the aid of classical trajectory simulations | [['we', 'employ', 'the', 'rmatrix', 'with', 'timedependence', 'method', 'to', 'investigate', 'extremeultravioletinitiated', 'highharmonic', 'generation', 'xihhg', 'in', 'ar', 'using', 'a', 'combination', 'of', 'extremeultraviolet', 'xuv', '92textrm', 'nm', '3times', '1012textrmwcm2', 'and', 'timedelayed', 'infrared', 'ir', '800textrm', 'nm', '3times', '1014textrmwcm2', 'laser', 'pulses', 'we', 'demonstrate', 'that', 'control', 'over', 'both', 'the', 'mechanism', 'and', 'timing', 'of', 'ionization', 'can', 'afford', 'significant', 'enhancements', 'in', 'the', 'yield', 'of', 'plateau', 'and', 'subthreshold', 'harmonics', 'alike', 'the', 'presence', 'of', 'the', 'xuv', 'pulse', 'is', 'also', 'shown', 'to', 'alter', 'the', 'relative', 'contribution', 'of', 'different', 'electron', 'emission', 'pathways', 'manifestation', 'of', 'the', 'ar', 'electronic', 'structure', 'is', 'found', 'in', 'the', 'appearance', 'of', 'a', 'pronounced', 'cooper', 'minimum', 'interferences', 'amongst', 'the', 'outervalence', '3p', 'and', 'innervalence', '3s', 'electrons', 'are', 'found', 'to', 'incur', 'only', 'a', 'minor', 'suppression', 'of', 'the', 'harmonic', 'intensities', 'at', 'least', 'for', 'the', 'present', 'combination', 'of', 'xuv', 'and', 'ir', 'laser', 'light', 'additionally', 'the', 'dependence', 'of', 'the', 'xihhg', 'efficiency', 'on', 'time', 'delay', 'is', 'discussed', 'and', 'rationalized', 'with', 'the', 'aid', 'of', 'classical', 'trajectory', 'simulations']] | [-0.10452655888397024, 0.15451741338097555, -0.04121209641582834, 0.06362119733444481, 0.04369532402840928, -0.1167398534590562, 0.03970784806600496, 0.4598646196454737, -0.21770589670386087, -0.32983498232976965, -0.015012078146240346, -0.28092562331011334, -0.10352786328040169, 0.2129177862834054, -0.014017010048608964, 0.0042111397733990575, 0.04269087759115484, -0.054280561621261526, -0.03864232804068744, -0.1503347441292545, 0.27183761596876443, 0.10243722972866724, 0.2396289789262162, 0.09819138012039409, 0.08251962609856363, -0.012362885302011396, -0.009600278447565794, -0.07008450697700848, -0.06505267604519195, 0.09145891612303823, 0.2160734077374464, 0.04780765729359905, 0.22227144174517172, -0.45790096990186985, -0.23097698753256954, 0.04414528202344204, 0.1530176035594195, 0.09179312017300284, -0.07701167815551818, -0.23321018649042177, 0.027126306372786492, -0.13185602943019442, -0.11841879456064625, -0.036112808773267856, 0.007437543331934008, 0.06530344135105007, -0.28392435641652697, 0.05963377028348705, 0.005671224915383557, 0.05758173907057605, -0.06532931823322785, -0.06983419368699403, -0.07030832483170843, 0.057881359715165545, 0.023313734347564757, 0.0289524719151865, 0.15954069890906628, -0.12056877961526559, -0.13195157864026097, 0.36049407640550757, -0.09772795898361053, -0.034618116372501034, 0.16258844555827828, -0.21200510793247482, -0.04048447271900803, 0.24463403638465409, 0.13090169820180295, 0.13160300537497854, -0.07387060348090427, 0.023445215819790487, 0.0338375734683441, 0.2360063172535787, 0.1475957571496059, 0.14069869880512043, 0.19690433958164927, 0.13845411072891783, 0.014651338153348212, 0.12611438750131973, -0.19013609747815563, -0.05582070271615726, -0.26943274521478777, -0.09617809060646194, -0.11495674322818367, 0.05265661290335193, -0.059540343356300734, -0.11459571796016027, 0.42948227943721373, 0.13549037909743533, 0.1444089874989209, -0.029450170610519782, 0.2853795510362571, 0.1738851282079081, 0.032842150361368984, 0.020096914541028753, 0.3030382639820307, 0.14957992565280326, 0.10812771871184249, -0.34195101879287876, 0.04979351840742772, 0.01783655496465016] |
1,802.03226 | Sub-arcsecond imaging of Arp\,299-A at 150 MHz with LOFAR: Evidence for
a starburst-driven outflow | We report on the first sub-arcsecond (0.44 $\times$ 0.41 arcsec$\rm ^2$)
angular resolution image at 150 MHz of the A-nucleus in the Luminous Infrared
Galaxy Arp$\,$299, from International Low Frequency Array (LOFAR) Telescope
observations. The most remarkable finding is that of an intriguing two-sided,
filamentary structure emanating from A-nucleus, which we interpret as an
outflow that extends up to at least 14 arcseconds from the A-nucleus in the N-S
direction ($\approx$ 5 kpc deprojected size) and accounts for almost 40% of the
extended emission of the entire galaxy system. We also discuss HST/NICMOS
[FeII] 1.64 $\rm \mu m$ and H$\rm_2$ 2.12 $\rm \mu m$ images of Arp$\,$299-A,
which show similar features to those unveiled by our 150 MHz LOFAR
observations, thus giving string morphological support for the outflow
scenario. Finally, we discuss unpublished NaI D spectra that confirm the
outflow nature of this structure. From energetic arguments, we rule out the
low-luminosity active galactic nucleus in Arp$\,$299-A as a driver for the
outflow. On the contrary, the powerful, compact starburst in the central
regions of Arp$\,$299-A provides plenty of mechanical energy to sustain an
outflow, and we conclude that the intense supernova (SN) activity in the
nuclear region of Arp299-A is driving the observed outflow. We estimate that
the starburst wind can support a mass-outflow rate in the range (11-63) $\rm
M_{\odot} yr^{-1}$ at speeds of up to (370 - 890) $\rm km \, s^{-1}$, and is
relatively young, with an estimated kinematic age of (3 - 7) Myr. Those results
open an avenue to the use of low-frequency (150 MHz), sub-arcsecond imaging
with LOFAR to detect outflows in the central regions of local luminous infrared
galaxies.
| astro-ph.GA | we report on the first subarcsecond 044 times 041 arcsecrm 2 angular resolution image at 150 mhz of the anucleus in the luminous infrared galaxy arp299 from international low frequency array lofar telescope observations the most remarkable finding is that of an intriguing twosided filamentary structure emanating from anucleus which we interpret as an outflow that extends up to at least 14 arcseconds from the anucleus in the ns direction approx 5 kpc deprojected size and accounts for almost 40 of the extended emission of the entire galaxy system we also discuss hstnicmos feii 164 rm mu m and hrm_2 212 rm mu m images of arp299a which show similar features to those unveiled by our 150 mhz lofar observations thus giving string morphological support for the outflow scenario finally we discuss unpublished nai d spectra that confirm the outflow nature of this structure from energetic arguments we rule out the lowluminosity active galactic nucleus in arp299a as a driver for the outflow on the contrary the powerful compact starburst in the central regions of arp299a provides plenty of mechanical energy to sustain an outflow and we conclude that the intense supernova sn activity in the nuclear region of arp299a is driving the observed outflow we estimate that the starburst wind can support a massoutflow rate in the range 1163 rm m_odot yr1 at speeds of up to 370 890 rm km s1 and is relatively young with an estimated kinematic age of 3 7 myr those results open an avenue to the use of lowfrequency 150 mhz subarcsecond imaging with lofar to detect outflows in the central regions of local luminous infrared galaxies | [['we', 'report', 'on', 'the', 'first', 'subarcsecond', '044', 'times', '041', 'arcsecrm', '2', 'angular', 'resolution', 'image', 'at', '150', 'mhz', 'of', 'the', 'anucleus', 'in', 'the', 'luminous', 'infrared', 'galaxy', 'arp299', 'from', 'international', 'low', 'frequency', 'array', 'lofar', 'telescope', 'observations', 'the', 'most', 'remarkable', 'finding', 'is', 'that', 'of', 'an', 'intriguing', 'twosided', 'filamentary', 'structure', 'emanating', 'from', 'anucleus', 'which', 'we', 'interpret', 'as', 'an', 'outflow', 'that', 'extends', 'up', 'to', 'at', 'least', '14', 'arcseconds', 'from', 'the', 'anucleus', 'in', 'the', 'ns', 'direction', 'approx', '5', 'kpc', 'deprojected', 'size', 'and', 'accounts', 'for', 'almost', '40', 'of', 'the', 'extended', 'emission', 'of', 'the', 'entire', 'galaxy', 'system', 'we', 'also', 'discuss', 'hstnicmos', 'feii', '164', 'rm', 'mu', 'm', 'and', 'hrm_2', '212', 'rm', 'mu', 'm', 'images', 'of', 'arp299a', 'which', 'show', 'similar', 'features', 'to', 'those', 'unveiled', 'by', 'our', '150', 'mhz', 'lofar', 'observations', 'thus', 'giving', 'string', 'morphological', 'support', 'for', 'the', 'outflow', 'scenario', 'finally', 'we', 'discuss', 'unpublished', 'nai', 'd', 'spectra', 'that', 'confirm', 'the', 'outflow', 'nature', 'of', 'this', 'structure', 'from', 'energetic', 'arguments', 'we', 'rule', 'out', 'the', 'lowluminosity', 'active', 'galactic', 'nucleus', 'in', 'arp299a', 'as', 'a', 'driver', 'for', 'the', 'outflow', 'on', 'the', 'contrary', 'the', 'powerful', 'compact', 'starburst', 'in', 'the', 'central', 'regions', 'of', 'arp299a', 'provides', 'plenty', 'of', 'mechanical', 'energy', 'to', 'sustain', 'an', 'outflow', 'and', 'we', 'conclude', 'that', 'the', 'intense', 'supernova', 'sn', 'activity', 'in', 'the', 'nuclear', 'region', 'of', 'arp299a', 'is', 'driving', 'the', 'observed', 'outflow', 'we', 'estimate', 'that', 'the', 'starburst', 'wind', 'can', 'support', 'a', 'massoutflow', 'rate', 'in', 'the', 'range', '1163', 'rm', 'm_odot', 'yr1', 'at', 'speeds', 'of', 'up', 'to', '370', '890', 'rm', 'km', 's1', 'and', 'is', 'relatively', 'young', 'with', 'an', 'estimated', 'kinematic', 'age', 'of', '3', '7', 'myr', 'those', 'results', 'open', 'an', 'avenue', 'to', 'the', 'use', 'of', 'lowfrequency', '150', 'mhz', 'subarcsecond', 'imaging', 'with', 'lofar', 'to', 'detect', 'outflows', 'in', 'the', 'central', 'regions', 'of', 'local', 'luminous', 'infrared', 'galaxies']] | [-0.08506258817739282, 0.09123945034260782, -0.011956593859769568, 0.07160765829800819, -0.08549962862932314, -0.06302515947754728, 0.03034267278823844, 0.4580982489483979, -0.17511210240969804, -0.32843425812761246, 0.08816481914297636, -0.2817658548429951, 0.00041275115247973353, 0.21685662473312142, 0.0035371652765581315, -0.07297913277237539, 0.032762933821205105, -0.06934045895554043, -0.03661682368050713, -0.17657102983642237, 0.2345098404236042, 0.12154509977228693, 0.16671032228452318, 0.006008009379670779, 0.12131057687656721, -0.14549018157926827, -0.051803176226231325, -0.08481102820437894, -0.16473453842993824, 0.057830341809141615, 0.25496120421929147, 0.12096335799330571, 0.22661186052017215, -0.31927007798324614, -0.16893819409340402, 0.02667215728005805, 0.19264931601077584, -0.0001851049592540435, -0.0299830875295918, -0.2986628273202394, 0.10928500604281641, -0.1979625749593063, -0.20231279991618495, 0.07637206311611568, 0.055607381035609735, 0.013697825153084361, -0.21391529731943806, 0.1552541280662434, 0.010336409664459471, 0.11874442363349612, -0.12075249749549959, -0.10699944826003904, -0.02198287234033855, 0.05401110727860428, 0.012090383277716362, 0.1406885972178048, 0.18531945154844673, -0.1297998380554525, -0.04989338102955919, 0.3768159232978873, -0.07018518953148434, 0.03894528948362944, 0.2402567736511735, -0.24834233731106745, -0.18698402727707564, 0.2118489816010183, 0.13946812605375752, 0.08901734578231459, -0.12268566198540878, -0.0071378642288062325, -0.05506188623899909, 0.25187030794169163, 0.05532582351759843, 0.07319174864655639, 0.2757410489892423, 0.11039081403792164, 0.06942022020452629, 0.1074596628174785, -0.27708332476836134, 0.009422542601789567, -0.2628315801771618, -0.07796684519416885, -0.11106278847985189, 0.1448862024493899, -0.15464880635687117, -0.031613985681735145, 0.3279845868768034, 0.12852631876017662, 0.23080338284832097, 0.032868973256828374, 0.2604607124758064, 0.02298255941037924, 0.11179308451177991, 0.1488240636724239, 0.2960453703057925, 0.171324588746168, 0.0998622925262145, -0.2203445745362842, -0.011237410567392705, -0.01555725175079287] |
1,802.03227 | Thermodynamic perturbation theory for non-interacting quantum particles
with application to spin-spin interactions in solids | The determination of the Landau free energy (the grand thermodynamic
potential) by a perturbation theory is advanced to arbitrary order for the
specific case of non-interacting fermionic systems perturbed by a one-particle
potential. Peculiar features of the formalism are highlighted, and its
applicability for bosons is indicated. The results are employed to develop a
more explicit approach describing exchange interactions between spins of
Anderson's magnetic impurities in metals, semiconductors, and insulators.
Within the fourth order our theory provides on the equal footing formulae for
the Ruderman-Kittel-Kasuya-Yosida, Bloembergen-Rowland, superexchange, and
two-electron exchange integrals at non-zero temperature.
| cond-mat.stat-mech cond-mat.mtrl-sci | the determination of the landau free energy the grand thermodynamic potential by a perturbation theory is advanced to arbitrary order for the specific case of noninteracting fermionic systems perturbed by a oneparticle potential peculiar features of the formalism are highlighted and its applicability for bosons is indicated the results are employed to develop a more explicit approach describing exchange interactions between spins of andersons magnetic impurities in metals semiconductors and insulators within the fourth order our theory provides on the equal footing formulae for the rudermankittelkasuyayosida bloembergenrowland superexchange and twoelectron exchange integrals at nonzero temperature | [['the', 'determination', 'of', 'the', 'landau', 'free', 'energy', 'the', 'grand', 'thermodynamic', 'potential', 'by', 'a', 'perturbation', 'theory', 'is', 'advanced', 'to', 'arbitrary', 'order', 'for', 'the', 'specific', 'case', 'of', 'noninteracting', 'fermionic', 'systems', 'perturbed', 'by', 'a', 'oneparticle', 'potential', 'peculiar', 'features', 'of', 'the', 'formalism', 'are', 'highlighted', 'and', 'its', 'applicability', 'for', 'bosons', 'is', 'indicated', 'the', 'results', 'are', 'employed', 'to', 'develop', 'a', 'more', 'explicit', 'approach', 'describing', 'exchange', 'interactions', 'between', 'spins', 'of', 'andersons', 'magnetic', 'impurities', 'in', 'metals', 'semiconductors', 'and', 'insulators', 'within', 'the', 'fourth', 'order', 'our', 'theory', 'provides', 'on', 'the', 'equal', 'footing', 'formulae', 'for', 'the', 'rudermankittelkasuyayosida', 'bloembergenrowland', 'superexchange', 'and', 'twoelectron', 'exchange', 'integrals', 'at', 'nonzero', 'temperature']] | [-0.16368084647325112, 0.19299120170372158, -0.02990654771473553, 0.1297009460701558, -0.0023292958711911187, -0.14500672624838587, 0.04696269900734095, 0.3165264687059741, -0.1990922475723844, -0.28752796202898023, -0.03124420578763085, -0.34239569879382065, -0.12224688368702405, 0.1506551902545126, 0.08845156803482065, 0.009941153923711298, -0.0327307757774466, 0.02666452508664837, -0.11174877670495525, -0.23881734030223206, 0.30441463920027384, 0.036731983760469836, 0.24265512411580667, 0.11170638797216509, 0.039592382718661896, 0.08130928238510693, 0.05499923641940481, -0.01981489717176086, -0.13571277956821418, 0.13486849995035874, 0.24235147751475636, -0.07721427848966989, 0.23895073695794533, -0.4409216412392102, -0.20399556112916847, 0.020293168542220404, 0.1305804687846256, 0.17415029034018517, -0.043827808937088486, -0.291695420309215, 0.00028099714729346725, -0.22343082533855188, -0.18666253899665256, -0.1593698740299595, 0.009597388576520116, -0.004559300369337985, -0.28279578902415536, 0.13976960438058564, 0.0403202010024535, 0.06511050283167462, -0.11411675333204728, -0.11843395965958112, -0.03737210676956334, 0.08505864300103368, 0.06771280741515129, 0.014676322788000106, 0.12754813534648796, -0.1197085593189848, -0.11711506423981566, 0.4177677970379591, -0.06116087753203158, -0.18728158065411998, 0.18236256806964152, -0.12916695086383506, -0.06312287650316169, 0.10108344960761698, 0.08450067636409872, 0.10316487782585777, -0.17521573897255094, 0.15475078760217384, 0.04662684403163822, 0.09964266121387481, 3.98589518705481e-05, 0.05425770082756093, 0.24411284759591675, 0.12092110282116521, 0.030063912890067226, 0.10471292101091852, -0.046042407987835376, -0.1588903093612508, -0.2976833036071376, -0.15276547948263836, -0.23794047283498865, 0.03648069522490627, -0.09370279435610619, -0.17938283360318133, 0.417227220848987, 0.16724900638601914, 0.10184791671406282, -0.00590130572305306, 0.2671279070016585, 0.16737507236263666, 0.05498092946057257, -0.013047055998130849, 0.23468103820556088, 0.22161272403440976, 0.08015544015813104, -0.2652257028084837, 0.009737215534244713, 0.12883626247118962] |
1,802.03228 | Electroweak interaction beyond the Standard Model and Dark Matter in the
Tangent Bundle Quantum Field Theory | A generalized theory of electroweak interaction is developed based on the
underlying geometrical structure of the tangent bundle with symmetries arising
from transformations of tangent vectors along the fiber axis at a fixed
space-time point, leaving the scalar product invariant. Transformations with
this property are given by the $SO(3,1)$ group with the little groups
$SU(2),E^{c}(2)$ and $SU(1,1)$ where the group $E^{c}(2)$ is the central
extended group of the Euclidian group $E(2).$ Electroweak interaction beyond
the standard model (SM) is described by the transformation group $SU(2)\otimes
E^{c}\mathbf{(}2)$ without a priori introduction of a phenomenologically
determined gauge group. The Laplacian on this group yields the known internal
quantum numbers of isospin and hypercharge, but in addition the extra
$E^{c}$-charge $\varkappa $ and the family quantum number $n$ which explains
the existence of families in the SM. The connection coefficients deliver the SM
gauge potentials but also hypothetical gauge bosons and other hypothetical
particles as well as candidate Dark Matter particles are predicted. It is shown
that the interpretation of the $SO(3,1)$ connection coefficients as elctroweak
gauge potentials is compatible with teleparallel gauge gravity theory based on
the translational group.
| hep-ph hep-th | a generalized theory of electroweak interaction is developed based on the underlying geometrical structure of the tangent bundle with symmetries arising from transformations of tangent vectors along the fiber axis at a fixed spacetime point leaving the scalar product invariant transformations with this property are given by the so31 group with the little groups su2ec2 and su11 where the group ec2 is the central extended group of the euclidian group e2 electroweak interaction beyond the standard model sm is described by the transformation group su2otimes ecmathbf2 without a priori introduction of a phenomenologically determined gauge group the laplacian on this group yields the known internal quantum numbers of isospin and hypercharge but in addition the extra eccharge varkappa and the family quantum number n which explains the existence of families in the sm the connection coefficients deliver the sm gauge potentials but also hypothetical gauge bosons and other hypothetical particles as well as candidate dark matter particles are predicted it is shown that the interpretation of the so31 connection coefficients as elctroweak gauge potentials is compatible with teleparallel gauge gravity theory based on the translational group | [['a', 'generalized', 'theory', 'of', 'electroweak', 'interaction', 'is', 'developed', 'based', 'on', 'the', 'underlying', 'geometrical', 'structure', 'of', 'the', 'tangent', 'bundle', 'with', 'symmetries', 'arising', 'from', 'transformations', 'of', 'tangent', 'vectors', 'along', 'the', 'fiber', 'axis', 'at', 'a', 'fixed', 'spacetime', 'point', 'leaving', 'the', 'scalar', 'product', 'invariant', 'transformations', 'with', 'this', 'property', 'are', 'given', 'by', 'the', 'so31', 'group', 'with', 'the', 'little', 'groups', 'su2ec2', 'and', 'su11', 'where', 'the', 'group', 'ec2', 'is', 'the', 'central', 'extended', 'group', 'of', 'the', 'euclidian', 'group', 'e2', 'electroweak', 'interaction', 'beyond', 'the', 'standard', 'model', 'sm', 'is', 'described', 'by', 'the', 'transformation', 'group', 'su2otimes', 'ecmathbf2', 'without', 'a', 'priori', 'introduction', 'of', 'a', 'phenomenologically', 'determined', 'gauge', 'group', 'the', 'laplacian', 'on', 'this', 'group', 'yields', 'the', 'known', 'internal', 'quantum', 'numbers', 'of', 'isospin', 'and', 'hypercharge', 'but', 'in', 'addition', 'the', 'extra', 'eccharge', 'varkappa', 'and', 'the', 'family', 'quantum', 'number', 'n', 'which', 'explains', 'the', 'existence', 'of', 'families', 'in', 'the', 'sm', 'the', 'connection', 'coefficients', 'deliver', 'the', 'sm', 'gauge', 'potentials', 'but', 'also', 'hypothetical', 'gauge', 'bosons', 'and', 'other', 'hypothetical', 'particles', 'as', 'well', 'as', 'candidate', 'dark', 'matter', 'particles', 'are', 'predicted', 'it', 'is', 'shown', 'that', 'the', 'interpretation', 'of', 'the', 'so31', 'connection', 'coefficients', 'as', 'elctroweak', 'gauge', 'potentials', 'is', 'compatible', 'with', 'teleparallel', 'gauge', 'gravity', 'theory', 'based', 'on', 'the', 'translational', 'group']] | [-0.1665147134329315, 0.20510783751116513, -0.09577981578899358, 0.07628209729087897, -0.13292270235507495, -0.16063422155931112, -0.005521432335416858, 0.3311075282047738, -0.2506324804981577, -0.2855296372640673, 0.04406173748174007, -0.2514188540383027, -0.1344230484516759, 0.09028906509367196, -0.009443577102661789, 0.008047731828000806, -0.037666310499944206, 0.1368135165750653, -0.09984495030117355, -0.22728783206740436, 0.3359377246649404, 0.038885461796551, 0.25452755635686136, -0.007946053661846116, 0.13486386911820744, 0.026834069497264145, -0.019522875785356858, -0.046016669259048425, -0.07926716064609067, 0.08420887705614115, 0.17130713399491979, 0.01601988902816979, 0.132507361109814, -0.3791000273303835, -0.21161905472463632, 0.12422343155488776, 0.12032201661278012, 0.07768114988633258, -0.07939494535222057, -0.3521718585679492, 0.05427826111522186, -0.1767567155197017, -0.17330452477480132, -0.06830614350818015, -0.018369828440392248, -0.06278610630677296, -0.22967463547708006, 0.05990042084828259, 0.002968680000336902, 0.08270632604055189, -0.03754573097343142, -0.10197605416920691, -0.08999776951124339, 0.03725655647352911, 0.1265816551612071, 0.04589096953258287, 0.17058238593481193, -0.13301247554565115, -0.1295022077840538, 0.48654775456160787, -0.06803015055093956, -0.24672060271332957, 0.15131346361614395, -0.1302764861445342, -0.16580822311284515, 0.10412011058632653, 0.09786982260961699, 0.07370431617076335, -0.10497303500772802, 0.2308227395841351, -0.08348738796149309, 0.12714428785285825, 0.050306230246161036, 0.04096203441936318, 0.20093413480751954, 0.08303560833907225, 0.05458424564010904, 0.05556027129437048, 0.010342413550600983, -0.1418593487303172, -0.41731637184109005, -0.16559361000634873, -0.13595508845717452, 0.07404712625749788, -0.13085669917303935, -0.12515675717792704, 0.3758110023438828, 0.06707748115973568, 0.17864846560981248, 0.046807844803929535, 0.21620063292845101, 0.07592844264261978, 0.11525909345472937, 0.026522141239083894, 0.23645222869670982, 0.22322620504540852, 0.003487017961311062, -0.21515366570495714, -0.05146572609837576, 0.16230587434032573] |
1,802.03229 | Plasma acceleration limitations due to betatron radiation | High energy spread caused by the longitudinal size of the beam is well known
in wake-field acceleration. Usually this issue can be solved with beam loading
effect that allows to keep accelerating field nearly constant, along the whole
duration of the beam. In this work, however, we would like to address another
source of energy spread that arises at high energy, due to betatron radiation.
| physics.acc-ph | high energy spread caused by the longitudinal size of the beam is well known in wakefield acceleration usually this issue can be solved with beam loading effect that allows to keep accelerating field nearly constant along the whole duration of the beam in this work however we would like to address another source of energy spread that arises at high energy due to betatron radiation | [['high', 'energy', 'spread', 'caused', 'by', 'the', 'longitudinal', 'size', 'of', 'the', 'beam', 'is', 'well', 'known', 'in', 'wakefield', 'acceleration', 'usually', 'this', 'issue', 'can', 'be', 'solved', 'with', 'beam', 'loading', 'effect', 'that', 'allows', 'to', 'keep', 'accelerating', 'field', 'nearly', 'constant', 'along', 'the', 'whole', 'duration', 'of', 'the', 'beam', 'in', 'this', 'work', 'however', 'we', 'would', 'like', 'to', 'address', 'another', 'source', 'of', 'energy', 'spread', 'that', 'arises', 'at', 'high', 'energy', 'due', 'to', 'betatron', 'radiation']] | [-0.11870649954160818, 0.22031929302387512, -0.04144187688182753, 0.06499925879582476, -0.07608818762864057, -0.11969547902162259, -0.007417711558250281, 0.43177897208012067, -0.3266419577412307, -0.37331423409856285, 0.05481004587804469, -0.21573046216978511, 0.01955342458990904, 0.220487651329201, -0.09072600961304628, 0.02949206529615017, 0.03574454528458703, -0.018628546237372434, -0.017807143095594186, -0.1803091480396688, 0.30075129841525966, 0.2328942544471759, 0.3086992933773077, 0.10850291389685411, 0.127982047214531, 0.016019570404806963, -0.002341810893267393, 0.026662629326948753, -0.06460243006205509, 0.03818316242585962, 0.22047530631176554, 0.07489541029163564, 0.30491434880174123, -0.41564646383317616, -0.2444738403822367, 0.11426844261765767, 0.21147628743201494, 0.15678789968100879, -0.05882551733117837, -0.15863620422852154, 0.03305600110728007, -0.1443677432405261, -0.230582055170089, 0.0075535408579386195, -0.03352854976681276, 0.048841906967572866, -0.23078587168397813, 0.0811014909368868, 0.015633114987912658, -0.011013093734016785, -0.04486071091378108, -0.05992904702344766, 0.02265103580071949, 0.07516537351677051, 0.13015653635375202, 0.11062824424141302, 0.15561815617032923, -0.13337551629743896, -0.03577494051020879, 0.4110625024025257, -0.04044766030274331, -0.14127033616487797, 0.13175145348247427, -0.18893004887235854, -0.03850032462953375, 0.2127435421714416, 0.21066596611188007, 0.05413344780054803, -0.13910450930348955, 0.0162191682566817, 0.06932370172670255, 0.18443355182758892, 0.1541260711239794, 0.01186309469720492, 0.20697782580525828, 0.15070001093599086, 0.07288853308329216, 0.1455323643104818, -0.12610390204936267, -0.05130744818598032, -0.25871512366888616, -0.09566302643372462, -0.16823549186810852, 0.07326044619369965, 0.005787753098859236, -0.14108785168948368, 0.4177143642822137, 0.16354141646711817, 0.17537556790316908, -0.05226635942951991, 0.3441803429992153, 0.14340793672375954, 0.09111996629418662, 0.0771131556839324, 0.27339855335079705, 0.06058436427981807, 0.16607641895444922, -0.26501391467709956, 0.06994607638424406, -0.05094651191566999] |
1,802.0323 | Iterative Coupling of Mixed and Discontinuous Galerkin Methods for
Poroelasticity | We analyze an iterative coupling of mixed and discontinuous Galerkin methods
for numerical modelling of coupled flow and mechanical deformation in porous
media. The iteration is based on an optimized fixed-stress split along with a
discontinuous variational time discretization. For the spatial discretization
of the subproblem of flow mixed finite element techniques are applied. The
discretization of the subproblem of mechanical deformation uses discontinuous
Galerkin methods. They have shown their ability to eliminate locking that
sometimes arises in numerical algorithms for poroelasticity and causes
nonphysical pressure oscillations.
| math.NA | we analyze an iterative coupling of mixed and discontinuous galerkin methods for numerical modelling of coupled flow and mechanical deformation in porous media the iteration is based on an optimized fixedstress split along with a discontinuous variational time discretization for the spatial discretization of the subproblem of flow mixed finite element techniques are applied the discretization of the subproblem of mechanical deformation uses discontinuous galerkin methods they have shown their ability to eliminate locking that sometimes arises in numerical algorithms for poroelasticity and causes nonphysical pressure oscillations | [['we', 'analyze', 'an', 'iterative', 'coupling', 'of', 'mixed', 'and', 'discontinuous', 'galerkin', 'methods', 'for', 'numerical', 'modelling', 'of', 'coupled', 'flow', 'and', 'mechanical', 'deformation', 'in', 'porous', 'media', 'the', 'iteration', 'is', 'based', 'on', 'an', 'optimized', 'fixedstress', 'split', 'along', 'with', 'a', 'discontinuous', 'variational', 'time', 'discretization', 'for', 'the', 'spatial', 'discretization', 'of', 'the', 'subproblem', 'of', 'flow', 'mixed', 'finite', 'element', 'techniques', 'are', 'applied', 'the', 'discretization', 'of', 'the', 'subproblem', 'of', 'mechanical', 'deformation', 'uses', 'discontinuous', 'galerkin', 'methods', 'they', 'have', 'shown', 'their', 'ability', 'to', 'eliminate', 'locking', 'that', 'sometimes', 'arises', 'in', 'numerical', 'algorithms', 'for', 'poroelasticity', 'and', 'causes', 'nonphysical', 'pressure', 'oscillations']] | [-0.11465502459550513, 0.07839685480743272, -0.14493081848212014, -0.020876353549043082, -0.09332279474528014, -0.16447350849001402, 0.0021209604850831046, 0.40628884322727205, -0.3656853283916054, -0.22382172643496046, 0.13310391429394228, -0.2162406339427863, -0.11552730481001153, 0.15123778214442662, -0.10766997248276897, 0.12255747091017086, 0.07027940916689648, -0.0644633042915114, -0.12331121946262175, -0.16892546024601693, 0.27912265005061165, -0.019134878448542506, 0.30481918577918377, 0.01269861644778893, 0.15742076359068355, -0.08252653697419954, -0.0645061820831107, 0.07607632957869905, -0.09032524430021395, 0.08749734274186623, 0.28310649944121424, 0.019311871362218482, 0.34446988828565883, -0.48326453654331036, -0.2632244246123337, 0.05429634482910236, 0.17078658002268138, 0.1409077742939879, -0.06286725603932536, -0.24417924686153045, 0.05899507543286202, -0.13950490640561986, -0.11899863759954941, -0.14826062084550315, -0.0664179936779299, 0.04968593262093163, -0.3052602664877971, 0.12487658695585427, 0.007928040977192765, 0.07580519970720527, -0.09195569650023833, -0.11198677473712242, -0.036440950562781384, 0.06529313210269501, 0.033452505039736284, -0.06313690655575745, 0.08014104273919573, -0.060756727566021955, -0.08286995622704084, 0.41968069559541243, -0.043177813532408967, -0.3003479653284296, 0.2059717989799663, -0.019346635253436262, -0.09562996375085465, 0.20779644802812186, 0.23865937488722272, 0.18629310143062439, -0.0700548827037986, 0.04895237276408201, 0.048717318391748546, 0.16433663169944382, 0.06591733107771511, -0.06995392572027685, 0.060614651465124784, 0.19054219081740956, 0.13124080916770317, 0.09183562601563232, -0.08313813639387231, -0.1637141123981397, -0.32525274345929595, -0.13046735156348896, -0.17863283655338588, -0.05112599201457596, -0.16375536474766578, -0.2622364816726212, 0.35017830167693653, 0.14291018845470643, 0.07436946045136315, -0.0034936458038316034, 0.29669021998114625, 0.17136854851008232, 0.04482892202481028, 0.0744405678773149, 0.23329563280326668, 0.19405636302698617, 0.14883933769239263, -0.3490850895003619, 0.03839833173772384, 0.1943432042300273] |
1,802.03231 | Self-stabilizing processes based on random signs | A self-stabilizing processes $\{Z(t), t\in [t_0,t_1)\}$ is a random process
which when localized, that is scaled to a fine limit near a given $t\in
[t_0,t_1)$, has the distribution of an $\alpha(Z(t))$-stable process, where
$\alpha: \mathbb{R}\to (0,2)$ is a given continuous function. Thus the
stability index near $t$ depends on the value of the process at $t$. In an
earlier paper we constructed self-stabilizing processes using sums over plane
Poisson point processes in the case of $\alpha: \mathbb{R}\to (0,1)$ which
depended on the almost sure absolute convergence of the sums. Here we construct
pure jump self-stabilizing processes when $\alpha$ may take values greater than
1 when convergence may no longer be absolute. We do this in two stages, firstly
by setting up a process based on a fixed point set but taking random signs of
the summands, and then randomizing the point set to get a process with the
desired local properties.
| math.PR | a selfstabilizing processes zt tin t_0t_1 is a random process which when localized that is scaled to a fine limit near a given tin t_0t_1 has the distribution of an alphaztstable process where alpha mathbbrto 02 is a given continuous function thus the stability index near t depends on the value of the process at t in an earlier paper we constructed selfstabilizing processes using sums over plane poisson point processes in the case of alpha mathbbrto 01 which depended on the almost sure absolute convergence of the sums here we construct pure jump selfstabilizing processes when alpha may take values greater than 1 when convergence may no longer be absolute we do this in two stages firstly by setting up a process based on a fixed point set but taking random signs of the summands and then randomizing the point set to get a process with the desired local properties | [['a', 'selfstabilizing', 'processes', 'zt', 'tin', 't_0t_1', 'is', 'a', 'random', 'process', 'which', 'when', 'localized', 'that', 'is', 'scaled', 'to', 'a', 'fine', 'limit', 'near', 'a', 'given', 'tin', 't_0t_1', 'has', 'the', 'distribution', 'of', 'an', 'alphaztstable', 'process', 'where', 'alpha', 'mathbbrto', '02', 'is', 'a', 'given', 'continuous', 'function', 'thus', 'the', 'stability', 'index', 'near', 't', 'depends', 'on', 'the', 'value', 'of', 'the', 'process', 'at', 't', 'in', 'an', 'earlier', 'paper', 'we', 'constructed', 'selfstabilizing', 'processes', 'using', 'sums', 'over', 'plane', 'poisson', 'point', 'processes', 'in', 'the', 'case', 'of', 'alpha', 'mathbbrto', '01', 'which', 'depended', 'on', 'the', 'almost', 'sure', 'absolute', 'convergence', 'of', 'the', 'sums', 'here', 'we', 'construct', 'pure', 'jump', 'selfstabilizing', 'processes', 'when', 'alpha', 'may', 'take', 'values', 'greater', 'than', '1', 'when', 'convergence', 'may', 'no', 'longer', 'be', 'absolute', 'we', 'do', 'this', 'in', 'two', 'stages', 'firstly', 'by', 'setting', 'up', 'a', 'process', 'based', 'on', 'a', 'fixed', 'point', 'set', 'but', 'taking', 'random', 'signs', 'of', 'the', 'summands', 'and', 'then', 'randomizing', 'the', 'point', 'set', 'to', 'get', 'a', 'process', 'with', 'the', 'desired', 'local', 'properties']] | [-0.10401238370531549, 0.14372253343637567, -0.09887608926122388, 0.00779609521143963, -0.003840407857981821, -0.10716594799732168, 0.12466221422034626, 0.41023705184459686, -0.3060504692917069, -0.21073261552490294, 0.11753528974096601, -0.2742967813881114, -0.096697841056933, 0.1734550200907203, -0.03822423044592142, 0.030392333405034153, 0.017113689503942927, 0.07016595482205351, -0.0644643197224165, -0.2556873832332591, 0.31337756088313956, 0.03701994716655463, 0.2305500324908644, -0.007400361026326815, 0.11478404442158838, 0.006642430624439536, 0.013116691826532285, -0.017305571213364603, -0.16060367022199595, 0.01630455520624916, 0.18115646082752696, 0.052327765848021957, 0.3025388007859389, -0.3605329189791034, -0.16351394937063257, 0.19195028913711817, 0.15652306818092862, 0.030926510652837653, 0.0003924020372020702, -0.2313024230192726, 0.14640981382069487, -0.09798522259729604, -0.13363936553088326, -0.01118575028454264, 0.05901046426966786, 0.04333231813895206, -0.3530529999081045, 0.019775941303620734, 0.13268237571542463, 0.04879661049538602, -0.026225376800478747, -0.14227749850290516, -0.007801039932916562, 0.1126096114840281, 0.01250549356356108, 0.04504161014221609, 0.15212350768968463, -0.08060446825964997, -0.1102853931610783, 0.33998321935844916, -0.0817693572465214, -0.21592053522821517, 0.14682197780969242, -0.19393503150592248, -0.149641420536985, 0.17028551954504412, 0.13637177808889342, 0.15298736676884195, -0.14544584471528652, 0.12215759339703558, -0.01475425233443578, 0.16023779763820736, 0.1014994426521783, -0.0015853640817416212, 0.15197851588328679, 0.1455226650244246, 0.13764167399766544, 0.10887275958977019, -0.03828922402579337, -0.0971573251967008, -0.3338948329041402, -0.14306275091910114, -0.19032488259719685, 0.1218501757690683, -0.14724279555482403, -0.1969060605050375, 0.34331828081359467, 0.12995370027453948, 0.2384478002010534, 0.0766052364371717, 0.23149704260751605, 0.19273194890023054, 0.001017177812755108, 0.06515372591403623, 0.16313930171231428, 0.08139601910797258, 0.07344441194320098, -0.11558901884321433, 0.12193066490503648, 0.07301036693931867] |
1,802.03232 | Twisted Flato-Fronsdal Theorem for Higher-Spin Algebras | We explore the relation between the singleton and adjoint modules of
higher-spin algebras via so(2,d) characters. In order to relate the tensor
product of the singleton and its dual to the adjoint module, we consider a
heuristic formula involving symmetrization over the variables of the character.
We show that our formula reproduces correctly the adjoint-module character for
type-A (and its high-order extensions) and type-B higher-spin gravity theories
in any dimension. Implications and subtleties of this symmetrization
prescription in other models are discussed.
| hep-th | we explore the relation between the singleton and adjoint modules of higherspin algebras via so2d characters in order to relate the tensor product of the singleton and its dual to the adjoint module we consider a heuristic formula involving symmetrization over the variables of the character we show that our formula reproduces correctly the adjointmodule character for typea and its highorder extensions and typeb higherspin gravity theories in any dimension implications and subtleties of this symmetrization prescription in other models are discussed | [['we', 'explore', 'the', 'relation', 'between', 'the', 'singleton', 'and', 'adjoint', 'modules', 'of', 'higherspin', 'algebras', 'via', 'so2d', 'characters', 'in', 'order', 'to', 'relate', 'the', 'tensor', 'product', 'of', 'the', 'singleton', 'and', 'its', 'dual', 'to', 'the', 'adjoint', 'module', 'we', 'consider', 'a', 'heuristic', 'formula', 'involving', 'symmetrization', 'over', 'the', 'variables', 'of', 'the', 'character', 'we', 'show', 'that', 'our', 'formula', 'reproduces', 'correctly', 'the', 'adjointmodule', 'character', 'for', 'typea', 'and', 'its', 'highorder', 'extensions', 'and', 'typeb', 'higherspin', 'gravity', 'theories', 'in', 'any', 'dimension', 'implications', 'and', 'subtleties', 'of', 'this', 'symmetrization', 'prescription', 'in', 'other', 'models', 'are', 'discussed']] | [-0.1271441927133703, 0.09818121260028465, -0.07543890710552166, 0.11797185239157881, -0.11718958523699347, -0.1317599295799471, -0.0011354292869383907, 0.31584153000127385, -0.2768087692696739, -0.21756429793198168, 0.08345607231963242, -0.23414456878248371, -0.20831384932921257, 0.15716985145721724, -0.08623296891649564, -0.01941179133589483, 0.012405994848382694, 0.10004122869146091, -0.1265230441701679, -0.2432873939641142, 0.37618537270176555, -0.00021662063218285272, 0.24357206695770592, 0.053336677293833575, 0.12716647558328179, 0.032190748338047186, -0.04307336007233387, -0.03794255376689964, -0.10825713680466754, 0.14483974713050288, 0.24240720649969363, 0.11369745383027619, 0.15842772891492019, -0.4094767547729943, -0.1675966885515753, 0.12169456513408848, 0.11421386227816527, 0.0866612906648237, 0.028195837984022535, -0.25965530965707184, 0.09007021486701697, -0.24421541224935173, -0.12624629052286898, -0.11709267728858525, 0.03643991616065902, -0.03746132336464929, -0.250414731061477, 0.07958762368681714, 0.09167433431785968, 0.04688553828286168, -0.13425019634945065, -0.10806369110022063, -0.050540417084976294, 0.09492522177292195, 0.05731241804415383, -0.04402468198289474, 0.05627206405394791, -0.16362148142465746, -0.1925068162611605, 0.35291890600512243, -0.0613319109507296, -0.255579571918021, 0.1991842066478214, -0.1678429370355091, -0.15229533454633237, 0.009244206706406894, 0.07060803161405119, 0.14243355425028706, -0.062114549041898164, 0.17457504779672434, -0.050530995046834885, 0.05969331656111243, 0.09296230735533216, 0.04157014785156252, 0.20886218225882378, 0.03547674331262156, -0.012949184905507682, 0.19302076166912477, 0.006544943783938149, -0.09331626894727153, -0.39606548229485383, -0.23765493155583556, -0.10401417217274875, -0.006131349427533554, -0.14455784217330173, -0.1654518886992455, 0.41172859376227416, 0.18605342769512423, 0.15888873118128236, 0.11619743679500656, 0.21078733178890413, 0.14090524246645977, 0.12473811320730566, 0.04474892587987361, 0.1772706424702465, 0.2430461068281237, 0.0065212340947861476, -0.24169953861331314, -0.04041994288333772, 0.21106602490396686] |
1,802.03233 | Periods of $t$-modules as special values | In this article we show that all periods of uniformizable $t$-modules (resp.
their coordinates) can be obtained via specializing a rigid analytic
trivialization of a related dual $t$-motive at $t=\theta$. The proof is even
constructive. The central object in the construction is a subset $H$ of the
Tate algebra points of $E$ which turns out to be isomorphic to the period
lattice of $E$ via kind of generating series in one direction and residues in
the other. This isomorphism even holds for arbitrary $t$-modules $E$, even
non-abelian ones.
| math.NT math.AC | in this article we show that all periods of uniformizable tmodules resp their coordinates can be obtained via specializing a rigid analytic trivialization of a related dual tmotive at ttheta the proof is even constructive the central object in the construction is a subset h of the tate algebra points of e which turns out to be isomorphic to the period lattice of e via kind of generating series in one direction and residues in the other this isomorphism even holds for arbitrary tmodules e even nonabelian ones | [['in', 'this', 'article', 'we', 'show', 'that', 'all', 'periods', 'of', 'uniformizable', 'tmodules', 'resp', 'their', 'coordinates', 'can', 'be', 'obtained', 'via', 'specializing', 'a', 'rigid', 'analytic', 'trivialization', 'of', 'a', 'related', 'dual', 'tmotive', 'at', 'ttheta', 'the', 'proof', 'is', 'even', 'constructive', 'the', 'central', 'object', 'in', 'the', 'construction', 'is', 'a', 'subset', 'h', 'of', 'the', 'tate', 'algebra', 'points', 'of', 'e', 'which', 'turns', 'out', 'to', 'be', 'isomorphic', 'to', 'the', 'period', 'lattice', 'of', 'e', 'via', 'kind', 'of', 'generating', 'series', 'in', 'one', 'direction', 'and', 'residues', 'in', 'the', 'other', 'this', 'isomorphism', 'even', 'holds', 'for', 'arbitrary', 'tmodules', 'e', 'even', 'nonabelian', 'ones']] | [-0.20302562779662284, 0.11533111174040558, -0.11923343251956711, 0.060398601767453576, -0.08627422083571384, -0.15066866678799587, 0.025776089052669704, 0.32416041840968485, -0.316777981098064, -0.20300773531198502, 0.09685085998551751, -0.22985260804687807, -0.11924690901915627, 0.2138943750813434, -0.10739369384563444, -0.05984472098167647, 0.06887769673961554, 0.11441873320886357, -0.039459150056989696, -0.29280933031854645, 0.3162017731863836, -0.014852141638667408, 0.1952683396150612, 0.01776517768898471, 0.07033023948315531, 0.0485201827197505, -0.020021190958438885, -0.005462377332150936, -0.10485230187598725, 0.12363679098581831, 0.313376511066136, 0.03706497668860142, 0.18370083315874747, -0.3650033326650208, -0.0949438965680284, 0.19630949253174054, 0.1383851963645694, 0.047491178491988896, 0.011418099181768908, -0.2375084539367394, 0.13475562307047023, -0.1705735752528364, -0.1606876605550166, -0.07154786507387391, 0.0929586781183554, -0.00368941392199221, -0.27354543593669817, 0.012742895111759108, 0.12056762286969884, 0.09425407349904576, -0.054285059312612495, -0.09171220615760169, -0.0695741640308618, 0.06620258865983818, 0.01664844652722505, 0.10459788101831112, 0.08229248329404402, -0.09936763514468278, -0.12482197743586519, 0.38767571721903304, -0.03249252724477132, -0.20579873302697457, 0.15411049095035362, -0.17970639649270612, -0.15429077371002428, 0.12789618596434593, 0.04969002785880796, 0.17762122914957051, -0.05679586900144138, 0.18540019785326545, -0.11302072774064569, 0.07067690158940175, 0.1492941142271527, -0.03170012223894115, 0.18427235194989902, 0.04047604430128227, 0.07749296989641152, 0.14357798941107996, 0.00831825290383263, -0.046539501313501125, -0.36116491665598005, -0.1916069263643294, -0.15647823092083193, 0.1354436983820051, -0.06966925622741242, -0.1292714864499761, 0.39042570492760703, 0.08116287067109211, 0.21843890493354676, 0.07194812727208376, 0.18385013878684153, 0.0910939255898649, 0.06253919284741145, 0.04788500874895941, 0.16134542249016126, 0.16077136494938962, -0.010583145009480755, -0.14857997923602603, -0.018066079482774843, 0.185155029874295] |
1,802.03234 | A revised distance to IRAS 16293$-$2422 from VLBA astrometry of
associated water masers | IRAS 16293-2422 is a very well studied young stellar system seen in
projection towards the L1689N cloud in the Ophiuchus complex. However, its
distance is still uncertain with a range of values from 120 pc to 180 pc. Our
goal is to measure the trigonometric parallax of this young star by means of
H$_2$O maser emission. We use archival data from 15 epochs of VLBA observations
of the 22.2 GHz water maser line. By modeling the displacement on the sky of
the H$_2$O maser spots, we derived a trigonometric parallax of $7.1\pm1.3$ mas,
corresponding to a distance of $141_{-21}^{+30}$ pc. This new distance is in
good agreement with recent values obtained for other magnetically active young
stars in the L1689 cloud. We relate the kinematics of these masers with the
outflows and the recent ejections powered by source A in the system.
| astro-ph.SR astro-ph.GA | iras 162932422 is a very well studied young stellar system seen in projection towards the l1689n cloud in the ophiuchus complex however its distance is still uncertain with a range of values from 120 pc to 180 pc our goal is to measure the trigonometric parallax of this young star by means of h_2o maser emission we use archival data from 15 epochs of vlba observations of the 222 ghz water maser line by modeling the displacement on the sky of the h_2o maser spots we derived a trigonometric parallax of 71pm13 mas corresponding to a distance of 141_2130 pc this new distance is in good agreement with recent values obtained for other magnetically active young stars in the l1689 cloud we relate the kinematics of these masers with the outflows and the recent ejections powered by source a in the system | [['iras', '162932422', 'is', 'a', 'very', 'well', 'studied', 'young', 'stellar', 'system', 'seen', 'in', 'projection', 'towards', 'the', 'l1689n', 'cloud', 'in', 'the', 'ophiuchus', 'complex', 'however', 'its', 'distance', 'is', 'still', 'uncertain', 'with', 'a', 'range', 'of', 'values', 'from', '120', 'pc', 'to', '180', 'pc', 'our', 'goal', 'is', 'to', 'measure', 'the', 'trigonometric', 'parallax', 'of', 'this', 'young', 'star', 'by', 'means', 'of', 'h_2o', 'maser', 'emission', 'we', 'use', 'archival', 'data', 'from', '15', 'epochs', 'of', 'vlba', 'observations', 'of', 'the', '222', 'ghz', 'water', 'maser', 'line', 'by', 'modeling', 'the', 'displacement', 'on', 'the', 'sky', 'of', 'the', 'h_2o', 'maser', 'spots', 'we', 'derived', 'a', 'trigonometric', 'parallax', 'of', '71pm13', 'mas', 'corresponding', 'to', 'a', 'distance', 'of', '141_2130', 'pc', 'this', 'new', 'distance', 'is', 'in', 'good', 'agreement', 'with', 'recent', 'values', 'obtained', 'for', 'other', 'magnetically', 'active', 'young', 'stars', 'in', 'the', 'l1689', 'cloud', 'we', 'relate', 'the', 'kinematics', 'of', 'these', 'masers', 'with', 'the', 'outflows', 'and', 'the', 'recent', 'ejections', 'powered', 'by', 'source', 'a', 'in', 'the', 'system']] | [-0.0878391577756182, 0.05395492957821781, -0.02759915433291878, 0.011137801723089069, -0.09104084116739354, -0.05059967176888936, 0.08097778870724141, 0.4553582226724497, -0.20728447897708974, -0.3170648042644773, 0.08351347380168071, -0.2598332476070417, 0.009353229576455695, 0.1934740042588341, -0.06154613438948218, -5.477970553329215e-05, 0.09799577651345837, -0.08708052675439311, -0.05221001646880593, -0.1576923011602568, 0.2783281773461827, 0.09982173528655298, 0.10865342895932761, -0.02347321083735941, 0.09997659163366604, -0.17334524309595248, -0.09010806260963104, -0.0328463843674399, -0.12723981999526066, 0.13542389879876282, 0.26413810104464314, 0.12172788220923395, 0.19114712803358477, -0.29901703792482814, -0.21567169573723471, 0.02478383144230715, 0.13474906065551165, 0.023663017865536467, -0.008015635913138145, -0.354858564119786, 0.051430296059697865, -0.18946496044684732, -0.20852751343710615, 0.10378711444791407, 0.1112181942909956, 0.08317811783386528, -0.20304804373964933, 0.1433602851341545, -0.03449569372127631, 0.17046202756464482, -0.13078249862633778, -0.16199517583840395, -0.003909478439683361, 0.10832510191082423, -0.012116155946361166, 0.16464592632837594, 0.15106696751900017, -0.11183629899585087, -0.06823514738768738, 0.43085167889948933, -0.07756396162107454, -0.05230142312689817, 0.25560143610429287, -0.2436430829427471, -0.2013114515525688, 0.16390054042983268, 0.12198785054663729, 0.15816556527279318, -0.18520318550623155, -0.04223834960929318, -0.07347340741793491, 0.21817409270443022, 0.05926888475327619, 0.0527971214410562, 0.3200652573523777, 0.09774976072200973, 0.05316093135957739, 0.14337709632361242, -0.28962225262574587, -0.09332064248280533, -0.22454359737457708, -0.08713730113314731, -0.16547296970384195, 0.08840637607499957, -0.1345511036017602, -0.05711450118771089, 0.30825614961291387, 0.10492041476120773, 0.20882664590275712, 0.017183103904660258, 0.2821414191275835, 0.03612829215375574, 0.11352072285704448, 0.13274962033943405, 0.32429505907597816, 0.1932760832798002, 0.14371581253529128, -0.22880803752091847, 0.07509003239517499, -0.0016633008174332124] |
1,802.03235 | The $b$-bibranching Problem: TDI System, Packing, and Discrete Convexity | In this paper, we introduce the $b$-bibranching problem in digraphs, which is
a common generalization of the bibranching and $b$-branching problems. The
bibranching problem, introduced by Schrijver (1982), is a common generalization
of the branching and bipartite edge cover problems. Previous results on
bibranchings include polynomial algorithms, a linear programming formulation
with total dual integrality, a packing theorem, and an M-convex submodular flow
formulation. The $b$-branching problem, recently introduced by Kakimura,
Kamiyama, and Takazawa (2018), is a generalization of the branching problem
admitting higher indegree, i.e., each vertex $v$ can have indegree at most
$b(v)$. For $b$-branchings, a combinatorial algorithm, a linear programming
formulation with total dual integrality, and a packing theorem for branchings
are extended. A main contribution of this paper is to extend those previous
results on bibranchings and $b$-branchings to $b$-bibranchings. That is, we
present a linear programming formulation with total dual integrality, a packing
theorem, and an M-convex submodular flow formulation for $b$-bibranchings. In
particular, the linear program and M-convex submodular flow formulations
respectively imply polynomial algorithms for finding a shortest
$b$-bibranching.
| cs.DM cs.DS math.CO | in this paper we introduce the bbibranching problem in digraphs which is a common generalization of the bibranching and bbranching problems the bibranching problem introduced by schrijver 1982 is a common generalization of the branching and bipartite edge cover problems previous results on bibranchings include polynomial algorithms a linear programming formulation with total dual integrality a packing theorem and an mconvex submodular flow formulation the bbranching problem recently introduced by kakimura kamiyama and takazawa 2018 is a generalization of the branching problem admitting higher indegree ie each vertex v can have indegree at most bv for bbranchings a combinatorial algorithm a linear programming formulation with total dual integrality and a packing theorem for branchings are extended a main contribution of this paper is to extend those previous results on bibranchings and bbranchings to bbibranchings that is we present a linear programming formulation with total dual integrality a packing theorem and an mconvex submodular flow formulation for bbibranchings in particular the linear program and mconvex submodular flow formulations respectively imply polynomial algorithms for finding a shortest bbibranching | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'bbibranching', 'problem', 'in', 'digraphs', 'which', 'is', 'a', 'common', 'generalization', 'of', 'the', 'bibranching', 'and', 'bbranching', 'problems', 'the', 'bibranching', 'problem', 'introduced', 'by', 'schrijver', '1982', 'is', 'a', 'common', 'generalization', 'of', 'the', 'branching', 'and', 'bipartite', 'edge', 'cover', 'problems', 'previous', 'results', 'on', 'bibranchings', 'include', 'polynomial', 'algorithms', 'a', 'linear', 'programming', 'formulation', 'with', 'total', 'dual', 'integrality', 'a', 'packing', 'theorem', 'and', 'an', 'mconvex', 'submodular', 'flow', 'formulation', 'the', 'bbranching', 'problem', 'recently', 'introduced', 'by', 'kakimura', 'kamiyama', 'and', 'takazawa', '2018', 'is', 'a', 'generalization', 'of', 'the', 'branching', 'problem', 'admitting', 'higher', 'indegree', 'ie', 'each', 'vertex', 'v', 'can', 'have', 'indegree', 'at', 'most', 'bv', 'for', 'bbranchings', 'a', 'combinatorial', 'algorithm', 'a', 'linear', 'programming', 'formulation', 'with', 'total', 'dual', 'integrality', 'and', 'a', 'packing', 'theorem', 'for', 'branchings', 'are', 'extended', 'a', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'extend', 'those', 'previous', 'results', 'on', 'bibranchings', 'and', 'bbranchings', 'to', 'bbibranchings', 'that', 'is', 'we', 'present', 'a', 'linear', 'programming', 'formulation', 'with', 'total', 'dual', 'integrality', 'a', 'packing', 'theorem', 'and', 'an', 'mconvex', 'submodular', 'flow', 'formulation', 'for', 'bbibranchings', 'in', 'particular', 'the', 'linear', 'program', 'and', 'mconvex', 'submodular', 'flow', 'formulations', 'respectively', 'imply', 'polynomial', 'algorithms', 'for', 'finding', 'a', 'shortest', 'bbibranching']] | [-0.10893019653615608, 0.010628847501114555, -0.08818726194745284, 0.05510584476689387, -0.1345702538133732, -0.15612652712678982, 0.03824586562612759, 0.3244433349768986, -0.31892072423596846, -0.3004900589751612, 0.1061240773172661, -0.25326906414037303, -0.19018426165885535, 0.15118344639250564, -0.14964297166651314, 0.10040026586267188, 0.07937059432013138, -0.004103714716620743, -0.06327845263110378, -0.2892591576244394, 0.25992483357411056, -0.020039897506302667, 0.187384128257344, 0.11891632927463866, 0.11245517103123434, 0.06962534471226502, -0.010406731600163593, 0.11948771214312208, -0.1723273258805334, 0.14392180175110253, 0.2956464429402591, 0.15929410066400168, 0.31675202515907586, -0.337565250905408, -0.13521599638763637, 0.1409951478015587, 0.05843597185698205, 0.06177897903294901, 0.0018701583751299907, -0.185009927012115, 0.10395767575772923, -0.12258375083495464, -0.056469255250357536, 0.01137414226763039, 0.05808147998704087, -0.02132323370564596, -0.3079452623981827, 0.048783977238123215, 0.11281161449594601, 0.011136798601000919, -0.056700706200596564, -0.1828377126560857, 0.021096598110272594, -0.016291057580106315, -0.017499908590079508, 0.10474563069320061, 0.03512649103954789, -0.09852437421934501, -0.2443348700901316, 0.38265042199054733, -0.010350627403351523, -0.22082047863486445, 0.14754540305737118, -0.02011709321578521, -0.21827634854985045, 0.113870847370154, 0.2108701115569905, 0.18491539508492374, -0.12312889713904865, 0.1365683343804752, -0.19476850800371417, 0.09899823871784888, 0.10262639520390492, 0.021551096260303722, 0.1288507196226246, 0.1343637119488059, 0.1890024631796959, 0.213486130712443, 0.04156659824296921, -0.09837812719689239, -0.2674003398334164, -0.1184587476856818, -0.17206491537148222, 0.02337121184072679, -0.11987633012869905, -0.15399713303694235, 0.37435299572756603, 0.059767279313832876, 0.1616081613215751, 0.2179052770044932, 0.25464221863408704, 0.15668619597584307, 0.043501459242266026, 0.16439254383745028, 0.16312850706578633, 0.20796590303126278, 0.09050445844020162, -0.2010616063122316, 0.04031695943835768, 0.2087599075374393] |
1,802.03236 | Learning Robust Options | Robust reinforcement learning aims to produce policies that have strong
guarantees even in the face of environments/transition models whose parameters
have strong uncertainty. Existing work uses value-based methods and the usual
primitive action setting. In this paper, we propose robust methods for learning
temporally abstract actions, in the framework of options. We present a Robust
Options Policy Iteration (ROPI) algorithm with convergence guarantees, which
learns options that are robust to model uncertainty. We utilize ROPI to learn
robust options with the Robust Options Deep Q Network (RO-DQN) that solves
multiple tasks and mitigates model misspecification due to model uncertainty.
We present experimental results which suggest that policy iteration with linear
features may have an inherent form of robustness when using coarse feature
representations. In addition, we present experimental results which demonstrate
that robustness helps policy iteration implemented on top of deep neural
networks to generalize over a much broader range of dynamics than non-robust
policy iteration.
| cs.AI cs.LG stat.ML | robust reinforcement learning aims to produce policies that have strong guarantees even in the face of environmentstransition models whose parameters have strong uncertainty existing work uses valuebased methods and the usual primitive action setting in this paper we propose robust methods for learning temporally abstract actions in the framework of options we present a robust options policy iteration ropi algorithm with convergence guarantees which learns options that are robust to model uncertainty we utilize ropi to learn robust options with the robust options deep q network rodqn that solves multiple tasks and mitigates model misspecification due to model uncertainty we present experimental results which suggest that policy iteration with linear features may have an inherent form of robustness when using coarse feature representations in addition we present experimental results which demonstrate that robustness helps policy iteration implemented on top of deep neural networks to generalize over a much broader range of dynamics than nonrobust policy iteration | [['robust', 'reinforcement', 'learning', 'aims', 'to', 'produce', 'policies', 'that', 'have', 'strong', 'guarantees', 'even', 'in', 'the', 'face', 'of', 'environmentstransition', 'models', 'whose', 'parameters', 'have', 'strong', 'uncertainty', 'existing', 'work', 'uses', 'valuebased', 'methods', 'and', 'the', 'usual', 'primitive', 'action', 'setting', 'in', 'this', 'paper', 'we', 'propose', 'robust', 'methods', 'for', 'learning', 'temporally', 'abstract', 'actions', 'in', 'the', 'framework', 'of', 'options', 'we', 'present', 'a', 'robust', 'options', 'policy', 'iteration', 'ropi', 'algorithm', 'with', 'convergence', 'guarantees', 'which', 'learns', 'options', 'that', 'are', 'robust', 'to', 'model', 'uncertainty', 'we', 'utilize', 'ropi', 'to', 'learn', 'robust', 'options', 'with', 'the', 'robust', 'options', 'deep', 'q', 'network', 'rodqn', 'that', 'solves', 'multiple', 'tasks', 'and', 'mitigates', 'model', 'misspecification', 'due', 'to', 'model', 'uncertainty', 'we', 'present', 'experimental', 'results', 'which', 'suggest', 'that', 'policy', 'iteration', 'with', 'linear', 'features', 'may', 'have', 'an', 'inherent', 'form', 'of', 'robustness', 'when', 'using', 'coarse', 'feature', 'representations', 'in', 'addition', 'we', 'present', 'experimental', 'results', 'which', 'demonstrate', 'that', 'robustness', 'helps', 'policy', 'iteration', 'implemented', 'on', 'top', 'of', 'deep', 'neural', 'networks', 'to', 'generalize', 'over', 'a', 'much', 'broader', 'range', 'of', 'dynamics', 'than', 'nonrobust', 'policy', 'iteration']] | [-0.03624857840125179, -0.0037956690486776338, -0.12244749237709728, 0.08775940484376502, -0.13372695158652373, -0.23125231718816058, 0.08115843133265643, 0.4949052511518331, -0.297294070867601, -0.2919782288985229, 0.08361802583921847, -0.2109351803144244, -0.19757191281716682, 0.18416916335608172, -0.17954834126622268, 0.10358643561822216, 0.12759811923636957, -0.0152450665788676, -0.05875095713054179, -0.27180902056984213, 0.311861877102944, 0.06397954491541513, 0.31633420794050354, -0.010626658173829415, 0.15337009397702978, -0.03468214823959371, 0.014484230579048591, 0.01397978720227624, -0.07774709049260166, 0.19122681154036208, 0.3291859943078156, 0.170994009142305, 0.3816618696552101, -0.4169748390114891, -0.2220887096819321, 0.11040232594744961, 0.10576164605261415, 0.12775338640188383, -0.0451050182401607, -0.30676671021961066, 0.10824684027427697, -0.20361490478420533, -0.036833680047972224, -0.19690473660394722, -0.0687487534811034, -0.01783492993931041, -0.3528252870861539, 0.02376828457253348, 0.07615583676746801, 0.023564952235717914, -0.06869610310470882, -0.13925981459109799, 0.04211213836127794, 0.09146919278799415, 0.07277841098670922, 0.021974239360516595, 0.1257681350658746, -0.12990436751524134, -0.18687350142404044, 0.34597183435567114, -0.06188399220196803, -0.20830498032247355, 0.17989598351261138, -0.023034882207866758, -0.16324766486497155, 0.10076039442087915, 0.2576461856944278, 0.12132053394912203, -0.1348309040987308, 0.04926678816723564, -0.06309801809593889, 0.18667381532462682, -0.027682903774946584, 0.03191582555882633, 0.11588298175545213, 0.2210954823638435, 0.12618541710329928, 0.1406853640969769, -0.08693604289376373, -0.14072834935933842, -0.23295107144689323, -0.050704486612965796, -0.0870943865432453, -0.061022817665760065, -0.11539737677709413, -0.12729492325764258, 0.39475135130066374, 0.2976665272673065, 0.1856721240788159, 0.1734928199492922, 0.34648022194098876, 0.09168515696901043, 0.0813455547157374, 0.13581157377063247, 0.1956718564768763, 0.007682934789428194, 0.08599476404656582, -0.17617074013871484, 0.15527035926137805, 0.058022747845634035] |
1,802.03237 | Full-Frame Scene Coordinate Regression for Image-Based Localization | Image-based localization, or camera relocalization, is a fundamental problem
in computer vision and robotics, and it refers to estimating camera pose from
an image. Recent state-of-the-art approaches use learning based methods, such
as Random Forests (RFs) and Convolutional Neural Networks (CNNs), to regress
for each pixel in the image its corresponding position in the scene's world
coordinate frame, and solve the final pose via a RANSAC-based optimization
scheme using the predicted correspondences. In this paper, instead of in a
patch-based manner, we propose to perform the scene coordinate regression in a
full-frame manner to make the computation efficient at test time and, more
importantly, to add more global context to the regression process to improve
the robustness. To do so, we adopt a fully convolutional encoder-decoder neural
network architecture which accepts a whole image as input and produces scene
coordinate predictions for all pixels in the image. However, using more global
context is prone to overfitting. To alleviate this issue, we propose to use
data augmentation to generate more data for training. In addition to the data
augmentation in 2D image space, we also augment the data in 3D space. We
evaluate our approach on the publicly available 7-Scenes dataset, and
experiments show that it has better scene coordinate predictions and achieves
state-of-the-art results in localization with improved robustness on the
hardest frames (e.g., frames with repeated structures).
| cs.CV | imagebased localization or camera relocalization is a fundamental problem in computer vision and robotics and it refers to estimating camera pose from an image recent stateoftheart approaches use learning based methods such as random forests rfs and convolutional neural networks cnns to regress for each pixel in the image its corresponding position in the scenes world coordinate frame and solve the final pose via a ransacbased optimization scheme using the predicted correspondences in this paper instead of in a patchbased manner we propose to perform the scene coordinate regression in a fullframe manner to make the computation efficient at test time and more importantly to add more global context to the regression process to improve the robustness to do so we adopt a fully convolutional encoderdecoder neural network architecture which accepts a whole image as input and produces scene coordinate predictions for all pixels in the image however using more global context is prone to overfitting to alleviate this issue we propose to use data augmentation to generate more data for training in addition to the data augmentation in 2d image space we also augment the data in 3d space we evaluate our approach on the publicly available 7scenes dataset and experiments show that it has better scene coordinate predictions and achieves stateoftheart results in localization with improved robustness on the hardest frames eg frames with repeated structures | [['imagebased', 'localization', 'or', 'camera', 'relocalization', 'is', 'a', 'fundamental', 'problem', 'in', 'computer', 'vision', 'and', 'robotics', 'and', 'it', 'refers', 'to', 'estimating', 'camera', 'pose', 'from', 'an', 'image', 'recent', 'stateoftheart', 'approaches', 'use', 'learning', 'based', 'methods', 'such', 'as', 'random', 'forests', 'rfs', 'and', 'convolutional', 'neural', 'networks', 'cnns', 'to', 'regress', 'for', 'each', 'pixel', 'in', 'the', 'image', 'its', 'corresponding', 'position', 'in', 'the', 'scenes', 'world', 'coordinate', 'frame', 'and', 'solve', 'the', 'final', 'pose', 'via', 'a', 'ransacbased', 'optimization', 'scheme', 'using', 'the', 'predicted', 'correspondences', 'in', 'this', 'paper', 'instead', 'of', 'in', 'a', 'patchbased', 'manner', 'we', 'propose', 'to', 'perform', 'the', 'scene', 'coordinate', 'regression', 'in', 'a', 'fullframe', 'manner', 'to', 'make', 'the', 'computation', 'efficient', 'at', 'test', 'time', 'and', 'more', 'importantly', 'to', 'add', 'more', 'global', 'context', 'to', 'the', 'regression', 'process', 'to', 'improve', 'the', 'robustness', 'to', 'do', 'so', 'we', 'adopt', 'a', 'fully', 'convolutional', 'encoderdecoder', 'neural', 'network', 'architecture', 'which', 'accepts', 'a', 'whole', 'image', 'as', 'input', 'and', 'produces', 'scene', 'coordinate', 'predictions', 'for', 'all', 'pixels', 'in', 'the', 'image', 'however', 'using', 'more', 'global', 'context', 'is', 'prone', 'to', 'overfitting', 'to', 'alleviate', 'this', 'issue', 'we', 'propose', 'to', 'use', 'data', 'augmentation', 'to', 'generate', 'more', 'data', 'for', 'training', 'in', 'addition', 'to', 'the', 'data', 'augmentation', 'in', '2d', 'image', 'space', 'we', 'also', 'augment', 'the', 'data', 'in', '3d', 'space', 'we', 'evaluate', 'our', 'approach', 'on', 'the', 'publicly', 'available', '7scenes', 'dataset', 'and', 'experiments', 'show', 'that', 'it', 'has', 'better', 'scene', 'coordinate', 'predictions', 'and', 'achieves', 'stateoftheart', 'results', 'in', 'localization', 'with', 'improved', 'robustness', 'on', 'the', 'hardest', 'frames', 'eg', 'frames', 'with', 'repeated', 'structures']] | [-0.01180007976373625, -0.04751796984483167, -0.07042003736250192, 0.051267256779817874, -0.10673985193065355, -0.176246783996344, 0.0003461151229617954, 0.4905041382860458, -0.2709766128488506, -0.33289014746582035, 0.08587466584459323, -0.2572938715385502, -0.19086207138688974, 0.16475126651685537, -0.2038186678106094, 0.11651907173182464, 0.16798448977428243, 0.040526320031443776, -0.09151865934172906, -0.27790006035438475, 0.2831849993120781, 0.05892643110832738, 0.3401810817937203, -0.04410726793535184, 0.15035187335543973, 0.01650847758068458, -0.05377708313697663, -0.009996068049906427, -0.04496088728177583, 0.18529867510190806, 0.3202813943713217, 0.1989458729390447, 0.279587699159604, -0.4497539994517227, -0.22627195472044773, 0.09447192750041977, 0.15509313116535053, 0.1397948824211326, -0.025873982773574472, -0.33967485311522816, 0.10061018597416319, -0.144517360128495, 0.01586912078537831, -0.1441815747744649, -0.017034668401864014, -0.06455689536028729, -0.30625408807189386, 0.039781414716695475, 0.04468045613152514, 0.049155547747208754, -0.05682318526169183, -0.04833953097981417, 0.02317157596770445, 0.17313662856886686, 0.010596859511758993, 0.11684349088790712, 0.13499920654086103, -0.21285193530776156, -0.13033151561128825, 0.39890650377951953, -0.04958889746309356, -0.25352213499871523, 0.19029023362887337, -0.042906326175924686, -0.1509562947178717, 0.08592878136142533, 0.2551650395780279, 0.11464708350831643, -0.14822000796955667, 0.0055574921384584485, -0.03967013352718041, 0.17350618458116068, 0.04567155463257478, -0.01989780700246787, 0.14869927536193772, 0.24902843364122274, 0.07848295517237204, 0.13775894247105738, -0.19900392453653917, -0.04801457292776097, -0.20014121360962459, -0.10513191474928406, -0.18918109842190078, -0.05113058114371246, -0.08556519411637023, -0.1555276109036385, 0.406316522563541, 0.3022356568427201, 0.2596952222152858, 0.1064080343624626, 0.38464094867741916, 0.0072362834006637795, 0.13259789558242915, 0.08451938403263819, 0.1789995280968581, 0.005938570942370254, 0.14383078615713185, -0.1306153292529767, 0.0384539906869912, 0.08429609517476995] |
1,802.03238 | Recurrent Neural Network-Based Semantic Variational Autoencoder for
Sequence-to-Sequence Learning | Sequence-to-sequence (Seq2seq) models have played an important role in the
recent success of various natural language processing methods, such as machine
translation, text summarization, and speech recognition. However, current
Seq2seq models have trouble preserving global latent information from a long
sequence of words. Variational autoencoder (VAE) alleviates this problem by
learning a continuous semantic space of the input sentence. However, it does
not solve the problem completely. In this paper, we propose a new recurrent
neural network (RNN)-based Seq2seq model, RNN semantic variational autoencoder
(RNN--SVAE), to better capture the global latent information of a sequence of
words. To reflect the meaning of words in a sentence properly, without regard
to its position within the sentence, we construct a document information vector
using the attention information between the final state of the encoder and
every prior hidden state. Then, the mean and standard deviation of the
continuous semantic space are learned by using this vector to take advantage of
the variational method. By using the document information vector to find the
semantic space of the sentence, it becomes possible to better capture the
global latent feature of the sentence. Experimental results of three natural
language tasks (i.e., language modeling, missing word imputation, paraphrase
identification) confirm that the proposed RNN--SVAE yields higher performance
than two benchmark models.
| cs.CL | sequencetosequence seq2seq models have played an important role in the recent success of various natural language processing methods such as machine translation text summarization and speech recognition however current seq2seq models have trouble preserving global latent information from a long sequence of words variational autoencoder vae alleviates this problem by learning a continuous semantic space of the input sentence however it does not solve the problem completely in this paper we propose a new recurrent neural network rnnbased seq2seq model rnn semantic variational autoencoder rnnsvae to better capture the global latent information of a sequence of words to reflect the meaning of words in a sentence properly without regard to its position within the sentence we construct a document information vector using the attention information between the final state of the encoder and every prior hidden state then the mean and standard deviation of the continuous semantic space are learned by using this vector to take advantage of the variational method by using the document information vector to find the semantic space of the sentence it becomes possible to better capture the global latent feature of the sentence experimental results of three natural language tasks ie language modeling missing word imputation paraphrase identification confirm that the proposed rnnsvae yields higher performance than two benchmark models | [['sequencetosequence', 'seq2seq', 'models', 'have', 'played', 'an', 'important', 'role', 'in', 'the', 'recent', 'success', 'of', 'various', 'natural', 'language', 'processing', 'methods', 'such', 'as', 'machine', 'translation', 'text', 'summarization', 'and', 'speech', 'recognition', 'however', 'current', 'seq2seq', 'models', 'have', 'trouble', 'preserving', 'global', 'latent', 'information', 'from', 'a', 'long', 'sequence', 'of', 'words', 'variational', 'autoencoder', 'vae', 'alleviates', 'this', 'problem', 'by', 'learning', 'a', 'continuous', 'semantic', 'space', 'of', 'the', 'input', 'sentence', 'however', 'it', 'does', 'not', 'solve', 'the', 'problem', 'completely', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'recurrent', 'neural', 'network', 'rnnbased', 'seq2seq', 'model', 'rnn', 'semantic', 'variational', 'autoencoder', 'rnnsvae', 'to', 'better', 'capture', 'the', 'global', 'latent', 'information', 'of', 'a', 'sequence', 'of', 'words', 'to', 'reflect', 'the', 'meaning', 'of', 'words', 'in', 'a', 'sentence', 'properly', 'without', 'regard', 'to', 'its', 'position', 'within', 'the', 'sentence', 'we', 'construct', 'a', 'document', 'information', 'vector', 'using', 'the', 'attention', 'information', 'between', 'the', 'final', 'state', 'of', 'the', 'encoder', 'and', 'every', 'prior', 'hidden', 'state', 'then', 'the', 'mean', 'and', 'standard', 'deviation', 'of', 'the', 'continuous', 'semantic', 'space', 'are', 'learned', 'by', 'using', 'this', 'vector', 'to', 'take', 'advantage', 'of', 'the', 'variational', 'method', 'by', 'using', 'the', 'document', 'information', 'vector', 'to', 'find', 'the', 'semantic', 'space', 'of', 'the', 'sentence', 'it', 'becomes', 'possible', 'to', 'better', 'capture', 'the', 'global', 'latent', 'feature', 'of', 'the', 'sentence', 'experimental', 'results', 'of', 'three', 'natural', 'language', 'tasks', 'ie', 'language', 'modeling', 'missing', 'word', 'imputation', 'paraphrase', 'identification', 'confirm', 'that', 'the', 'proposed', 'rnnsvae', 'yields', 'higher', 'performance', 'than', 'two', 'benchmark', 'models']] | [-0.00853406441367358, 0.017276440940082988, -0.06022470823200551, 0.15061255230498938, -0.1853512423419057, -0.15817308067584612, 0.04431367703514532, 0.44971203533801396, -0.3480178406768142, -0.3070292360263553, 0.023142072307098954, -0.2700930741416649, -0.1515181476661297, 0.11794173747422436, -0.12798076520286972, 0.12011757796327474, 0.15094281819172448, 0.14557312808476144, -0.08600639364656996, -0.27570152075134846, 0.3433264569322548, 0.027630655521290824, 0.33844827198720767, -0.028552200737575445, 0.1904034771554242, -0.025648045733990803, -0.05013685140806849, -0.08422363534317781, -0.05003589976753437, 0.20151557723834165, 0.33981395458066854, 0.24641243193053725, 0.3564603447240773, -0.40023673765791445, -0.29024348933547034, 0.10241939136190034, 0.13006252623895542, 0.1264950609918981, 0.015726793465584938, -0.3693943317857147, 0.0760763154970154, -0.18609144613737058, 0.12173161129226708, -0.13448113440251755, -0.018841912895615952, -0.04649936133217364, -0.25185383497704555, 0.04016345138322702, 0.20508222609207455, 0.0668393401341609, -0.063994068394966, -0.10444393011953401, -0.02955549496702605, 0.1774721583395217, 0.07582366660984993, 0.146141345072166, 0.08475922541053389, -0.20467385123571286, -0.17333176430367248, 0.3704061610842814, -0.09385048614044514, -0.2683640203062672, 0.14167723993163014, -0.021627216182316833, -0.19119586957347506, 0.07127149438730358, 0.19487603375264073, 0.06517121441085154, -0.1811805130529082, 0.024519114987378143, -0.07853030963656558, 0.22504628610582977, 0.05806194425193252, 0.018918684990901692, 0.20665247377965756, 0.27319524678545937, -0.013693920543259928, 0.1270603907388578, -0.10642204186939219, -0.07832720114531415, -0.20696678531614127, -0.13381943247442793, -0.18792521454691188, -0.05844613037091525, -0.1280701521021219, -0.17572310351342524, 0.4248030187557736, 0.24962225381695957, 0.22291463934663386, 0.12399608717724121, 0.3088045365181467, 0.02905517431061295, 0.09498111853138828, 0.08300773999456998, 0.12496709743046809, 0.032956754424753536, 0.1380594858195755, -0.15118268700513307, 0.12706674276053154, 0.10954894118247108] |
1,802.03239 | Using Discretization for Extending the Set of Predictive Features | To date, attribute discretization is typically performed by replacing the
original set of continuous features with a transposed set of discrete ones.
This paper provides support for a new idea that discretized features should
often be used in addition to existing features and as such, datasets should be
extended, and not replaced, by discretization. We also claim that
discretization algorithms should be developed with the explicit purpose of
enriching a non-discretized dataset with discretized values. We present such an
algorithm, D-MIAT, a supervised algorithm that discretizes data based on
Minority Interesting Attribute Thresholds. D-MIAT only generates new features
when strong indications exist for one of the target values needing to be
learned and thus is intended to be used in addition to the original data. We
present extensive empirical results demonstrating the success of using D-MIAT
on $ 28 $ benchmark datasets. We also demonstrate that $ 10 $ other
discretization algorithms can also be used to generate features that yield
improved performance when used in combination with the original non-discretized
data. Our results show that the best predictive performance is attained using a
combination of the original dataset with added features from a "standard"
supervised discretization algorithm and D-MIAT.
| cs.LG cs.AI stat.ML | to date attribute discretization is typically performed by replacing the original set of continuous features with a transposed set of discrete ones this paper provides support for a new idea that discretized features should often be used in addition to existing features and as such datasets should be extended and not replaced by discretization we also claim that discretization algorithms should be developed with the explicit purpose of enriching a nondiscretized dataset with discretized values we present such an algorithm dmiat a supervised algorithm that discretizes data based on minority interesting attribute thresholds dmiat only generates new features when strong indications exist for one of the target values needing to be learned and thus is intended to be used in addition to the original data we present extensive empirical results demonstrating the success of using dmiat on 28 benchmark datasets we also demonstrate that 10 other discretization algorithms can also be used to generate features that yield improved performance when used in combination with the original nondiscretized data our results show that the best predictive performance is attained using a combination of the original dataset with added features from a standard supervised discretization algorithm and dmiat | [['to', 'date', 'attribute', 'discretization', 'is', 'typically', 'performed', 'by', 'replacing', 'the', 'original', 'set', 'of', 'continuous', 'features', 'with', 'a', 'transposed', 'set', 'of', 'discrete', 'ones', 'this', 'paper', 'provides', 'support', 'for', 'a', 'new', 'idea', 'that', 'discretized', 'features', 'should', 'often', 'be', 'used', 'in', 'addition', 'to', 'existing', 'features', 'and', 'as', 'such', 'datasets', 'should', 'be', 'extended', 'and', 'not', 'replaced', 'by', 'discretization', 'we', 'also', 'claim', 'that', 'discretization', 'algorithms', 'should', 'be', 'developed', 'with', 'the', 'explicit', 'purpose', 'of', 'enriching', 'a', 'nondiscretized', 'dataset', 'with', 'discretized', 'values', 'we', 'present', 'such', 'an', 'algorithm', 'dmiat', 'a', 'supervised', 'algorithm', 'that', 'discretizes', 'data', 'based', 'on', 'minority', 'interesting', 'attribute', 'thresholds', 'dmiat', 'only', 'generates', 'new', 'features', 'when', 'strong', 'indications', 'exist', 'for', 'one', 'of', 'the', 'target', 'values', 'needing', 'to', 'be', 'learned', 'and', 'thus', 'is', 'intended', 'to', 'be', 'used', 'in', 'addition', 'to', 'the', 'original', 'data', 'we', 'present', 'extensive', 'empirical', 'results', 'demonstrating', 'the', 'success', 'of', 'using', 'dmiat', 'on', '28', 'benchmark', 'datasets', 'we', 'also', 'demonstrate', 'that', '10', 'other', 'discretization', 'algorithms', 'can', 'also', 'be', 'used', 'to', 'generate', 'features', 'that', 'yield', 'improved', 'performance', 'when', 'used', 'in', 'combination', 'with', 'the', 'original', 'nondiscretized', 'data', 'our', 'results', 'show', 'that', 'the', 'best', 'predictive', 'performance', 'is', 'attained', 'using', 'a', 'combination', 'of', 'the', 'original', 'dataset', 'with', 'added', 'features', 'from', 'a', 'standard', 'supervised', 'discretization', 'algorithm', 'and', 'dmiat']] | [0.004243065148701283, 0.021567881201843525, -0.12224645515766033, 0.060242065153683404, -0.10650986104928033, -0.15795022298163752, 0.05510342606326698, 0.4194302420721066, -0.25769736099874185, -0.34342678962275386, 0.12550042549895696, -0.2604413182422405, -0.1427030970641811, 0.22570182488546991, -0.09963254411395982, 0.06624569569382346, 0.14245791293737686, 0.030958092643770065, -0.06703075623420086, -0.2832379073263336, 0.2930257585462734, 0.03881351439025709, 0.2826440309991642, 0.02242257795771774, 0.10371955792236674, -0.06707341756495856, -0.04288335299067085, 0.06821349636670582, -0.048983607510011525, 0.14786191153214123, 0.2690755653988608, 0.15822886859247348, 0.2754119948735841, -0.39696096884542886, -0.20080355053045312, 0.09318177220981796, 0.1552496433628685, 0.11821877515096127, -0.06680698818360854, -0.31964864248139024, 0.10741488885684461, -0.1395133020990642, -0.07655860634392356, -0.15642527583689542, -0.05089587095070022, 0.012113772719630458, -0.32358712799210404, 0.04360321438137789, 0.045146613734612734, 0.03911553546596242, -0.050869661708818556, -0.14291887993126043, 0.00033253414570639026, 0.11490919472969241, 0.02144387183409203, 0.040973880995844245, 0.07989674528623569, -0.09189875108606838, -0.14086687974916884, 0.38235320452106547, -0.12103888397556445, -0.24621411576054572, 0.19026153286436706, -0.04621765873399658, -0.14505960060430842, 0.1260015773491896, 0.18036198337061676, 0.10719889210185454, -0.13661666109053802, 0.016049166029433206, -0.052912775092112015, 0.2255303827589568, 0.01749809147619015, 0.013841542660030631, 0.12687488235010558, 0.202171803365357, 0.021606874488275116, 0.13356305409266794, -0.10362942012713519, -0.06670307657296522, -0.2732573796077917, -0.11183501827995036, -0.2031831272298052, -0.013864653781267259, -0.07991273160899125, -0.12157768499978096, 0.3743814602517998, 0.24086896329880597, 0.2101191136064198, 0.07205078522294607, 0.3038746607608675, 0.08462064506676718, 0.11054539867458218, 0.09701997092069715, 0.19815799067918288, 0.011459534172900021, 0.06605147162680419, -0.16166588366616694, 0.07434915982623946, 0.07107908122730916] |
1,802.0324 | Compressibility effects on quasistationary vortex and transient hole
patterns through vortex merger | The effect of compressibility in hydrodynamic vortex merging has been
discussed. In the past, in incompressible limit it has been observed that the
merging of a collection of intense point-like vortices arranged uniformly
outside a circular vortex, can lead to quasistationary vortex patch and
transient hole pattern inside the patch via nonlinear merger process. These
patterns are akin to \textquoteleft vortex crystals\textquoteright.
Compressibility can introduce a natural acoustic scale to the problem. We find
that the natural mode is independent of the number of point-like vortices and
the amplitude scales linearly with compressibility. Further it has been
identified that after merging, the system exhibits oscillation at a natural
frequency together with its harmonics and beats with its own harmonics. The
power of the frequency is found to scale as $M^{-2}$, where $M$ is the Mach
number. Also the vortex crystals formed out of the merging process are found to
melt faster as compressibility is increased.
| physics.flu-dyn nlin.PS | the effect of compressibility in hydrodynamic vortex merging has been discussed in the past in incompressible limit it has been observed that the merging of a collection of intense pointlike vortices arranged uniformly outside a circular vortex can lead to quasistationary vortex patch and transient hole pattern inside the patch via nonlinear merger process these patterns are akin to textquoteleft vortex crystalstextquoteright compressibility can introduce a natural acoustic scale to the problem we find that the natural mode is independent of the number of pointlike vortices and the amplitude scales linearly with compressibility further it has been identified that after merging the system exhibits oscillation at a natural frequency together with its harmonics and beats with its own harmonics the power of the frequency is found to scale as m2 where m is the mach number also the vortex crystals formed out of the merging process are found to melt faster as compressibility is increased | [['the', 'effect', 'of', 'compressibility', 'in', 'hydrodynamic', 'vortex', 'merging', 'has', 'been', 'discussed', 'in', 'the', 'past', 'in', 'incompressible', 'limit', 'it', 'has', 'been', 'observed', 'that', 'the', 'merging', 'of', 'a', 'collection', 'of', 'intense', 'pointlike', 'vortices', 'arranged', 'uniformly', 'outside', 'a', 'circular', 'vortex', 'can', 'lead', 'to', 'quasistationary', 'vortex', 'patch', 'and', 'transient', 'hole', 'pattern', 'inside', 'the', 'patch', 'via', 'nonlinear', 'merger', 'process', 'these', 'patterns', 'are', 'akin', 'to', 'textquoteleft', 'vortex', 'crystalstextquoteright', 'compressibility', 'can', 'introduce', 'a', 'natural', 'acoustic', 'scale', 'to', 'the', 'problem', 'we', 'find', 'that', 'the', 'natural', 'mode', 'is', 'independent', 'of', 'the', 'number', 'of', 'pointlike', 'vortices', 'and', 'the', 'amplitude', 'scales', 'linearly', 'with', 'compressibility', 'further', 'it', 'has', 'been', 'identified', 'that', 'after', 'merging', 'the', 'system', 'exhibits', 'oscillation', 'at', 'a', 'natural', 'frequency', 'together', 'with', 'its', 'harmonics', 'and', 'beats', 'with', 'its', 'own', 'harmonics', 'the', 'power', 'of', 'the', 'frequency', 'is', 'found', 'to', 'scale', 'as', 'm2', 'where', 'm', 'is', 'the', 'mach', 'number', 'also', 'the', 'vortex', 'crystals', 'formed', 'out', 'of', 'the', 'merging', 'process', 'are', 'found', 'to', 'melt', 'faster', 'as', 'compressibility', 'is', 'increased']] | [-0.15772180119529366, 0.1989164354956963, -0.10028207256736887, 0.01898891572752539, -0.0709015726317446, -0.06301480242619653, -0.013665800814383797, 0.35700549866834824, -0.2615681725142935, -0.2699253929509818, 0.09309599740663543, -0.2772187603238438, -0.08106140026750115, 0.19621597476116104, 0.01286688556761614, 0.0471047795212876, 0.01964739718861491, 0.0686451457939776, -0.022147071280202213, -0.21159863723109343, 0.28499044532669926, 0.08229994497491748, 0.3003768416684024, -0.0052776621993292465, 0.09547368021887521, -0.06624795394109005, -0.002062226911740644, 0.06213771222331622, -0.09968663308864524, -0.003556189436447359, 0.2171579310549544, 0.04534569388748163, 0.2434685446273584, -0.44817248934444476, -0.21309059903924443, 0.07520795668862373, 0.22094127246444778, 0.13287752184430257, -0.0439504383369228, -0.2593931659221552, 0.0959385516236887, -0.14009588506441661, -0.15407658340681538, -0.03276092086785606, 0.09033267102627592, 0.05744647638654554, -0.2332008758011008, 0.12685028684016336, 0.07440160655162552, -0.003083243929817305, -0.014005428109039831, -0.06254875231095795, -0.07946648099459708, 0.06371728500786733, 0.09155761233308692, 0.0459768973508632, 0.16399370327700752, -0.12152522092370631, -0.0935293785114954, 0.38887805150604093, -0.0375604411789712, -0.13924243859039595, 0.1960965524678566, -0.17736930271925092, -0.06771250968411952, 0.2059067964686879, 0.14831203810701316, 0.07269223151704321, -0.06624714301312463, 0.010521851128115404, -0.08576231890104034, 0.17902310243119823, 0.14865967944149508, 0.025889319630775166, 0.30675940592954687, 0.20975825338709084, 0.04762538647666186, 0.17132053175160974, -0.15900732881341179, -0.07691853468808309, -0.22898752271959727, -0.09428010151915059, -0.1842106564713917, 0.01590079565338984, -0.056517058692879325, -0.1796284704650571, 0.36691197450575114, 0.0946897269504798, 0.2006747741197378, -0.022991682380111282, 0.2564160399163118, 0.1323559629812522, 0.10098532371392305, 0.06431312814457704, 0.2715225338394596, 0.13027631069757287, 0.12344109564233426, -0.2656513981947482, 0.005763586970384826, 0.050266493004504836] |
1,802.03241 | Extraordinary supernova iPTF14hls: An attempt at interpretation | It is shown that the H$\alpha$ luminosity and the Thomson optical depth of
the iPTF14hls on day 600 after the detection provide us with the estimate of
the envelope age which turns to be about 1000 days. I propose a model that
suggests an explosion of a massive star with the radius of $\sim
2\times10^{13}$ cm at 450 days prior to the discovery. For the optimal model
the ejected mass is $30\,M_{\odot}$, and the kinetic energy is $8\times10^{51}$
erg. The energy source at the dominant luminosity stage is presumably related
to the relativistic bipolar outflow originated from a disk accretion onto the
black hole. The [O\,I] 6300, 6364 \AA\ doublet in the spectrum on day 600 is
shown to be the result of the emission of at least $1-3\,M_{\odot}$ of oxygen
in the ejecta inner zone. The oxygen distribution is non-spherical and can be
represented either by two components with blue and red shifts (in the optically
thin case), or by one blue shifted component, in the case of optically thick
lines for the filling factor of $\sim 2\times10^{-3}$.
| astro-ph.HE | it is shown that the halpha luminosity and the thomson optical depth of the iptf14hls on day 600 after the detection provide us with the estimate of the envelope age which turns to be about 1000 days i propose a model that suggests an explosion of a massive star with the radius of sim 2times1013 cm at 450 days prior to the discovery for the optimal model the ejected mass is 30m_odot and the kinetic energy is 8times1051 erg the energy source at the dominant luminosity stage is presumably related to the relativistic bipolar outflow originated from a disk accretion onto the black hole the oi 6300 6364 aa doublet in the spectrum on day 600 is shown to be the result of the emission of at least 13m_odot of oxygen in the ejecta inner zone the oxygen distribution is nonspherical and can be represented either by two components with blue and red shifts in the optically thin case or by one blue shifted component in the case of optically thick lines for the filling factor of sim 2times103 | [['it', 'is', 'shown', 'that', 'the', 'halpha', 'luminosity', 'and', 'the', 'thomson', 'optical', 'depth', 'of', 'the', 'iptf14hls', 'on', 'day', '600', 'after', 'the', 'detection', 'provide', 'us', 'with', 'the', 'estimate', 'of', 'the', 'envelope', 'age', 'which', 'turns', 'to', 'be', 'about', '1000', 'days', 'i', 'propose', 'a', 'model', 'that', 'suggests', 'an', 'explosion', 'of', 'a', 'massive', 'star', 'with', 'the', 'radius', 'of', 'sim', '2times1013', 'cm', 'at', '450', 'days', 'prior', 'to', 'the', 'discovery', 'for', 'the', 'optimal', 'model', 'the', 'ejected', 'mass', 'is', '30m_odot', 'and', 'the', 'kinetic', 'energy', 'is', '8times1051', 'erg', 'the', 'energy', 'source', 'at', 'the', 'dominant', 'luminosity', 'stage', 'is', 'presumably', 'related', 'to', 'the', 'relativistic', 'bipolar', 'outflow', 'originated', 'from', 'a', 'disk', 'accretion', 'onto', 'the', 'black', 'hole', 'the', 'oi', '6300', '6364', 'aa', 'doublet', 'in', 'the', 'spectrum', 'on', 'day', '600', 'is', 'shown', 'to', 'be', 'the', 'result', 'of', 'the', 'emission', 'of', 'at', 'least', '13m_odot', 'of', 'oxygen', 'in', 'the', 'ejecta', 'inner', 'zone', 'the', 'oxygen', 'distribution', 'is', 'nonspherical', 'and', 'can', 'be', 'represented', 'either', 'by', 'two', 'components', 'with', 'blue', 'and', 'red', 'shifts', 'in', 'the', 'optically', 'thin', 'case', 'or', 'by', 'one', 'blue', 'shifted', 'component', 'in', 'the', 'case', 'of', 'optically', 'thick', 'lines', 'for', 'the', 'filling', 'factor', 'of', 'sim', '2times103']] | [-0.04542353191397289, 0.1349037241177101, -0.02687998065526147, 0.05244877038319501, -0.04671275562847431, -0.09283799257422432, 0.01728019927199302, 0.42758541967552366, -0.20705751962227265, -0.318554778030048, 0.09669242960563076, -0.30744275653713876, 0.02822126950408081, 0.17788059963567412, -0.014062412363068943, -0.08824652410373929, 0.05100953740099173, -0.01782257850867241, -0.04259224854974767, -0.20528661563411732, 0.3093507853179668, 0.08874918733529873, 0.15844499784929866, 0.036325045175892245, 0.04457801693443502, -0.091698448076907, -0.0029206445906311274, -0.07301786132261492, -0.12125645163823821, 0.06763470993806305, 0.1942108622961416, 0.10628623617983037, 0.22885811068326906, -0.35251379800369187, -0.1949595755955016, 0.04418644455249756, 0.16930553927138614, 0.03493542603695807, -0.013675978490978145, -0.23418092277434685, 0.06753719761821159, -0.20410595185468705, -0.18243902454184097, 0.13441142795628377, 0.07119968565955256, -0.03750233423864741, -0.2598885182782437, 0.136403347009772, 0.039551917080940115, 0.04668897749291042, -0.08718428906220733, -0.10117334428274732, -0.10115829607984575, 0.02031659136991948, 0.0541792347035737, 0.06857377223230982, 0.1814829368861078, -0.11501988507493326, 0.007859204120782276, 0.39889779500140066, -0.09511104293083877, 0.009598792917775304, 0.18257531873735316, -0.17104331608547757, -0.07979366147179115, 0.2364337067145938, 0.12521513741400636, 0.12846439401619136, -0.12634409073572817, -0.013802496057783326, -0.024279985366928068, 0.2264942941517475, 0.07942190282491528, 0.028702088028684344, 0.33554711648304897, 0.11859500356635937, 0.023180870630598843, 0.11117706105101258, -0.2194755647640173, -0.037503626974550695, -0.25364840251466864, -0.1214464940706247, -0.14235772737668137, 0.12095608948494485, -0.12840163672645052, -0.1160252481248371, 0.36861056302088113, 0.09440274401358591, 0.2578944149335553, -0.016262983873858, 0.2819293180606171, 0.1462800492417444, 0.11412081325928984, 0.13390151542229473, 0.31796032840679034, 0.17032077025198325, 0.10703716144952308, -0.23039215869921667, 0.057845586561597884, 0.025768220371022568] |
1,802.03242 | Projecting UK Mortality using Bayesian Generalised Additive Models | Forecasts of mortality provide vital information about future populations,
with implications for pension and health-care policy as well as for decisions
made by private companies about life insurance and annuity pricing. Stochastic
mortality forecasts allow the uncertainty in mortality predictions to be taken
into consideration when making policy decisions and setting product prices.
Longer lifespans imply that forecasts of mortality at ages 90 and above will
become more important in such calculations.
This paper presents a Bayesian approach to the forecasting of mortality that
jointly estimates a Generalised Additive Model (GAM) for mortality for the
majority of the age-range and a parametric model for older ages where the data
are sparser. The GAM allows smooth components to be estimated for age, cohort
and age-specific improvement rates, together with a non-smoothed period effect.
Forecasts for the United Kingdom are produced using data from the Human
Mortality Database spanning the period 1961-2013. A metric that approximates
predictive accuracy under Leave-One-Out cross-validation is used to estimate
weights for the `stacking' of forecasts with different points of transition
between the GAM and parametric elements.
Mortality for males and females are estimated separately at first, but a
joint model allows the asymptotic limit of mortality at old ages to be shared
between sexes, and furthermore provides for forecasts accounting for
correlations in period innovations. The joint and single sex model forecasts
estimated using data from 1961-2003 are compared against observed data from
2004-2013 to facilitate model assessment.
| stat.AP | forecasts of mortality provide vital information about future populations with implications for pension and healthcare policy as well as for decisions made by private companies about life insurance and annuity pricing stochastic mortality forecasts allow the uncertainty in mortality predictions to be taken into consideration when making policy decisions and setting product prices longer lifespans imply that forecasts of mortality at ages 90 and above will become more important in such calculations this paper presents a bayesian approach to the forecasting of mortality that jointly estimates a generalised additive model gam for mortality for the majority of the agerange and a parametric model for older ages where the data are sparser the gam allows smooth components to be estimated for age cohort and agespecific improvement rates together with a nonsmoothed period effect forecasts for the united kingdom are produced using data from the human mortality database spanning the period 19612013 a metric that approximates predictive accuracy under leaveoneout crossvalidation is used to estimate weights for the stacking of forecasts with different points of transition between the gam and parametric elements mortality for males and females are estimated separately at first but a joint model allows the asymptotic limit of mortality at old ages to be shared between sexes and furthermore provides for forecasts accounting for correlations in period innovations the joint and single sex model forecasts estimated using data from 19612003 are compared against observed data from 20042013 to facilitate model assessment | [['forecasts', 'of', 'mortality', 'provide', 'vital', 'information', 'about', 'future', 'populations', 'with', 'implications', 'for', 'pension', 'and', 'healthcare', 'policy', 'as', 'well', 'as', 'for', 'decisions', 'made', 'by', 'private', 'companies', 'about', 'life', 'insurance', 'and', 'annuity', 'pricing', 'stochastic', 'mortality', 'forecasts', 'allow', 'the', 'uncertainty', 'in', 'mortality', 'predictions', 'to', 'be', 'taken', 'into', 'consideration', 'when', 'making', 'policy', 'decisions', 'and', 'setting', 'product', 'prices', 'longer', 'lifespans', 'imply', 'that', 'forecasts', 'of', 'mortality', 'at', 'ages', '90', 'and', 'above', 'will', 'become', 'more', 'important', 'in', 'such', 'calculations', 'this', 'paper', 'presents', 'a', 'bayesian', 'approach', 'to', 'the', 'forecasting', 'of', 'mortality', 'that', 'jointly', 'estimates', 'a', 'generalised', 'additive', 'model', 'gam', 'for', 'mortality', 'for', 'the', 'majority', 'of', 'the', 'agerange', 'and', 'a', 'parametric', 'model', 'for', 'older', 'ages', 'where', 'the', 'data', 'are', 'sparser', 'the', 'gam', 'allows', 'smooth', 'components', 'to', 'be', 'estimated', 'for', 'age', 'cohort', 'and', 'agespecific', 'improvement', 'rates', 'together', 'with', 'a', 'nonsmoothed', 'period', 'effect', 'forecasts', 'for', 'the', 'united', 'kingdom', 'are', 'produced', 'using', 'data', 'from', 'the', 'human', 'mortality', 'database', 'spanning', 'the', 'period', '19612013', 'a', 'metric', 'that', 'approximates', 'predictive', 'accuracy', 'under', 'leaveoneout', 'crossvalidation', 'is', 'used', 'to', 'estimate', 'weights', 'for', 'the', 'stacking', 'of', 'forecasts', 'with', 'different', 'points', 'of', 'transition', 'between', 'the', 'gam', 'and', 'parametric', 'elements', 'mortality', 'for', 'males', 'and', 'females', 'are', 'estimated', 'separately', 'at', 'first', 'but', 'a', 'joint', 'model', 'allows', 'the', 'asymptotic', 'limit', 'of', 'mortality', 'at', 'old', 'ages', 'to', 'be', 'shared', 'between', 'sexes', 'and', 'furthermore', 'provides', 'for', 'forecasts', 'accounting', 'for', 'correlations', 'in', 'period', 'innovations', 'the', 'joint', 'and', 'single', 'sex', 'model', 'forecasts', 'estimated', 'using', 'data', 'from', '19612003', 'are', 'compared', 'against', 'observed', 'data', 'from', '20042013', 'to', 'facilitate', 'model', 'assessment']] | [0.002950426609504765, 0.08523038741496829, -0.10290649124259464, 0.1556604422344417, -0.06566648813798462, -0.1471388006863422, 0.1418579506822258, 0.41480765432493455, -0.20419773778578104, -0.3112612535619804, 0.15740849973642895, -0.28832934544057387, -0.07769344893657255, 0.244996664706602, -0.14262777885274033, 0.012559142575509628, 0.1185377430663713, 0.02651595478990918, 0.023808016067674718, -0.29655347690453837, 0.24359810579992894, 0.09081197875088166, 0.29246308505690993, -0.026037367796961308, 0.09893146797293255, -0.008890947515522928, -0.06699027350183603, -0.03480298252908755, -0.12230992932079011, 0.15126093931322737, 0.3448760291487446, 0.18448338452064156, 0.35571583904419485, -0.3957301387446445, -0.21443168351146155, 0.12434531245127352, 0.08872865800924548, 0.06480525807812654, 0.023262022132973115, -0.2877178164610589, 0.010989104185465755, -0.24821339921721852, -0.08109930939348921, -0.06680551572375498, 0.030686281183072088, 0.008998867615309221, -0.37866528571493707, 0.1585439610488374, -0.05206967160036538, 0.1289292436146855, -0.1296325194104828, -0.18310385705342042, -0.06903680672218329, 0.19048248009649535, 0.13266478397076847, -0.0026873023313505255, 0.11472998155771938, -0.11062186190987076, -0.11331246873762295, 0.3284731939465205, -0.08155389634452012, -0.12882787552048455, 0.11466604054449554, -0.12330540532984666, -0.13217841151119775, 0.0785552273790847, 0.24139466048237793, 0.005014829959128068, -0.19909247494855298, -0.05016777130422498, 0.044672978695123516, 0.16720000578862104, 0.05900824722706313, -0.054891966246302284, 0.2162633457712568, 0.20597396162143716, 0.05662240160827765, 0.03977609575661795, -0.12446690265237349, -0.12322484287623292, -0.221865013654336, -0.10118516692677396, -0.0726927667739314, 0.02614422479428148, -0.1630295257849539, -0.1366899193665909, 0.3601698061669534, 0.18893577640673542, 0.13100386164287517, 0.14498003193461745, 0.27355404856914817, 0.07526097381896647, 0.050028117572746014, 0.09728780486250771, 0.1763463584125572, 0.06554174335297415, 0.07638861516648397, -0.15397191201200297, 0.21116954927375564, -0.023777506213876805] |
1,802.03243 | RSDNet: Learning to Predict Remaining Surgery Duration from Laparoscopic
Videos Without Manual Annotations | Accurate surgery duration estimation is necessary for optimal OR planning,
which plays an important role in patient comfort and safety as well as resource
optimization. It is, however, challenging to preoperatively predict surgery
duration since it varies significantly depending on the patient condition,
surgeon skills, and intraoperative situation. In this paper, we propose a deep
learning pipeline, referred to as RSDNet, which automatically estimates the
remaining surgery duration (RSD) intraoperatively by using only visual
information from laparoscopic videos. Previous state-of-the-art approaches for
RSD prediction are dependent on manual annotation, whose generation requires
expensive expert knowledge and is time-consuming, especially considering the
numerous types of surgeries performed in a hospital and the large number of
laparoscopic videos available. A crucial feature of RSDNet is that it does not
depend on any manual annotation during training, making it easily scalable to
many kinds of surgeries. The generalizability of our approach is demonstrated
by testing the pipeline on two large datasets containing different types of
surgeries: 120 cholecystectomy and 170 gastric bypass videos. The experimental
results also show that the proposed network significantly outperforms a
traditional method of estimating RSD without utilizing manual annotation.
Further, this work provides a deeper insight into the deep learning network
through visualization and interpretation of the features that are automatically
learned.
| cs.CV | accurate surgery duration estimation is necessary for optimal or planning which plays an important role in patient comfort and safety as well as resource optimization it is however challenging to preoperatively predict surgery duration since it varies significantly depending on the patient condition surgeon skills and intraoperative situation in this paper we propose a deep learning pipeline referred to as rsdnet which automatically estimates the remaining surgery duration rsd intraoperatively by using only visual information from laparoscopic videos previous stateoftheart approaches for rsd prediction are dependent on manual annotation whose generation requires expensive expert knowledge and is timeconsuming especially considering the numerous types of surgeries performed in a hospital and the large number of laparoscopic videos available a crucial feature of rsdnet is that it does not depend on any manual annotation during training making it easily scalable to many kinds of surgeries the generalizability of our approach is demonstrated by testing the pipeline on two large datasets containing different types of surgeries 120 cholecystectomy and 170 gastric bypass videos the experimental results also show that the proposed network significantly outperforms a traditional method of estimating rsd without utilizing manual annotation further this work provides a deeper insight into the deep learning network through visualization and interpretation of the features that are automatically learned | [['accurate', 'surgery', 'duration', 'estimation', 'is', 'necessary', 'for', 'optimal', 'or', 'planning', 'which', 'plays', 'an', 'important', 'role', 'in', 'patient', 'comfort', 'and', 'safety', 'as', 'well', 'as', 'resource', 'optimization', 'it', 'is', 'however', 'challenging', 'to', 'preoperatively', 'predict', 'surgery', 'duration', 'since', 'it', 'varies', 'significantly', 'depending', 'on', 'the', 'patient', 'condition', 'surgeon', 'skills', 'and', 'intraoperative', 'situation', 'in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'learning', 'pipeline', 'referred', 'to', 'as', 'rsdnet', 'which', 'automatically', 'estimates', 'the', 'remaining', 'surgery', 'duration', 'rsd', 'intraoperatively', 'by', 'using', 'only', 'visual', 'information', 'from', 'laparoscopic', 'videos', 'previous', 'stateoftheart', 'approaches', 'for', 'rsd', 'prediction', 'are', 'dependent', 'on', 'manual', 'annotation', 'whose', 'generation', 'requires', 'expensive', 'expert', 'knowledge', 'and', 'is', 'timeconsuming', 'especially', 'considering', 'the', 'numerous', 'types', 'of', 'surgeries', 'performed', 'in', 'a', 'hospital', 'and', 'the', 'large', 'number', 'of', 'laparoscopic', 'videos', 'available', 'a', 'crucial', 'feature', 'of', 'rsdnet', 'is', 'that', 'it', 'does', 'not', 'depend', 'on', 'any', 'manual', 'annotation', 'during', 'training', 'making', 'it', 'easily', 'scalable', 'to', 'many', 'kinds', 'of', 'surgeries', 'the', 'generalizability', 'of', 'our', 'approach', 'is', 'demonstrated', 'by', 'testing', 'the', 'pipeline', 'on', 'two', 'large', 'datasets', 'containing', 'different', 'types', 'of', 'surgeries', '120', 'cholecystectomy', 'and', '170', 'gastric', 'bypass', 'videos', 'the', 'experimental', 'results', 'also', 'show', 'that', 'the', 'proposed', 'network', 'significantly', 'outperforms', 'a', 'traditional', 'method', 'of', 'estimating', 'rsd', 'without', 'utilizing', 'manual', 'annotation', 'further', 'this', 'work', 'provides', 'a', 'deeper', 'insight', 'into', 'the', 'deep', 'learning', 'network', 'through', 'visualization', 'and', 'interpretation', 'of', 'the', 'features', 'that', 'are', 'automatically', 'learned']] | [-0.05624316404090386, 0.04210261328488792, -0.068227086346904, 0.06925950277451742, -0.16145742598060026, -0.1857605747931268, 0.049735211949567044, 0.42944740059451675, -0.20675355120878317, -0.3906064695362353, 0.13042269018094302, -0.2327545891990358, -0.177248630188087, 0.26075945334522194, -0.179213639155452, 0.07054266315129287, 0.18697275895074028, 0.03613692291414822, -0.02870151173336572, -0.2886391087261661, 0.27184070556925366, 0.03846911701537396, 0.3460966974830712, 0.06582145304704648, 0.12014714173669487, 0.04041265897323237, -0.08849353532862568, -0.006779072388901182, -0.08660479694137976, 0.12714446465405724, 0.33067736320773067, 0.21593169451972363, 0.3393268570400564, -0.4151377065078672, -0.23865679942427273, 0.08298639527891043, 0.1560266360394516, 0.07957202697153266, -0.013034865425274716, -0.3357004327084518, 0.06697461878626063, -0.12651934752675686, 0.0178146996393411, -0.15206410476656737, -0.018054253314094583, -0.03678517883153685, -0.28190820639154585, 0.06131635487718257, 0.03444290393798718, 0.10330754053506579, -0.060696301508457666, -0.08533013828443627, -0.0001615937535633456, 0.2242841360404679, 0.06760952554924309, 0.08077790086291607, 0.1713330698974391, -0.1946103886903246, -0.10526844293795051, 0.3749596806405604, 0.017420867035156645, -0.2075928565474965, 0.18958774927722397, -0.02657836594372847, -0.17263797855110102, 0.1597805986442287, 0.17160370897167837, 0.13445829007695517, -0.16515607346191932, -0.03905061583796885, 0.01833199650347936, 0.20969141290615365, 0.05853928165193999, -0.03390965880474673, 0.1486874217011544, 0.2663464969735733, 0.026408638667045074, 0.10570897716470941, -0.11203845597381862, -0.02346125215002037, -0.2428455350575705, -0.147272292215348, -0.17893774602078955, 0.007384485137972317, -0.09967299963098858, -0.1477085570255646, 0.3814280844196888, 0.2162866887800123, 0.14722592330247797, 0.0823924736359227, 0.38440342506345465, -0.01919815444304028, 0.13596371964459256, 0.05368238752971421, 0.16796916369392695, -0.0587477944373979, 0.12576317461866462, -0.18876327508247792, 0.11598420650742175, 0.04165326138378455] |
1,802.03244 | Production of $W^+ W^-$ pairs via $\gamma^*\gamma^* \to W^+ W^-$
subprocess with photon transverse momenta | We discuss production of $W^+ W^-$ pairs in proton-proton collisions induced
by two-photon fusion including, for a first time, transverse momenta of
incoming photons. The unintegrated inelastic fluxes (related to proton
dissociation) of photons are calculated based on modern parametrizations of
deep inelastic structure functions in a broad range of their arguments ($x$ and
$Q^2$). In our approach we can get separate contributions of different $W$
helicities states. Several one- and two-dimensional differential distributions
are shown and discussed. The present results are compared to the results of
previous calculations within collinear factorization approach. Similar results
are found except of some observables such as e.g. transverse momentum of the
pair of $W^+$ and $W^-$. We find large contributions to the cross section from
the region of large photon virtualities. We show decomposition of the total
cross section as well as invariant mass distribution into polarisation states
of both W bosons. The role of the longitudinal $F_L$ structure function is
quantified. Its inclusion leads to a 4-5 % decrease of the cross section,
almost independent of $M_{WW}$.
| hep-ph | we discuss production of w w pairs in protonproton collisions induced by twophoton fusion including for a first time transverse momenta of incoming photons the unintegrated inelastic fluxes related to proton dissociation of photons are calculated based on modern parametrizations of deep inelastic structure functions in a broad range of their arguments x and q2 in our approach we can get separate contributions of different w helicities states several one and twodimensional differential distributions are shown and discussed the present results are compared to the results of previous calculations within collinear factorization approach similar results are found except of some observables such as eg transverse momentum of the pair of w and w we find large contributions to the cross section from the region of large photon virtualities we show decomposition of the total cross section as well as invariant mass distribution into polarisation states of both w bosons the role of the longitudinal f_l structure function is quantified its inclusion leads to a 45 decrease of the cross section almost independent of m_ww | [['we', 'discuss', 'production', 'of', 'w', 'w', 'pairs', 'in', 'protonproton', 'collisions', 'induced', 'by', 'twophoton', 'fusion', 'including', 'for', 'a', 'first', 'time', 'transverse', 'momenta', 'of', 'incoming', 'photons', 'the', 'unintegrated', 'inelastic', 'fluxes', 'related', 'to', 'proton', 'dissociation', 'of', 'photons', 'are', 'calculated', 'based', 'on', 'modern', 'parametrizations', 'of', 'deep', 'inelastic', 'structure', 'functions', 'in', 'a', 'broad', 'range', 'of', 'their', 'arguments', 'x', 'and', 'q2', 'in', 'our', 'approach', 'we', 'can', 'get', 'separate', 'contributions', 'of', 'different', 'w', 'helicities', 'states', 'several', 'one', 'and', 'twodimensional', 'differential', 'distributions', 'are', 'shown', 'and', 'discussed', 'the', 'present', 'results', 'are', 'compared', 'to', 'the', 'results', 'of', 'previous', 'calculations', 'within', 'collinear', 'factorization', 'approach', 'similar', 'results', 'are', 'found', 'except', 'of', 'some', 'observables', 'such', 'as', 'eg', 'transverse', 'momentum', 'of', 'the', 'pair', 'of', 'w', 'and', 'w', 'we', 'find', 'large', 'contributions', 'to', 'the', 'cross', 'section', 'from', 'the', 'region', 'of', 'large', 'photon', 'virtualities', 'we', 'show', 'decomposition', 'of', 'the', 'total', 'cross', 'section', 'as', 'well', 'as', 'invariant', 'mass', 'distribution', 'into', 'polarisation', 'states', 'of', 'both', 'w', 'bosons', 'the', 'role', 'of', 'the', 'longitudinal', 'f_l', 'structure', 'function', 'is', 'quantified', 'its', 'inclusion', 'leads', 'to', 'a', '45', 'decrease', 'of', 'the', 'cross', 'section', 'almost', 'independent', 'of', 'm_ww']] | [-0.10359640178423182, 0.18693829910366677, -0.08006188531684551, 0.10031598900918495, 0.0030023914737755367, -0.057305071744786835, -0.0038154191403093093, 0.3909482768383519, -0.2345849416893104, -0.2898259150913392, -0.04437406694492454, -0.32597933853066513, -0.0032992011535613016, 0.19412343948477365, 0.06594367101022454, 0.08367433282513247, 0.08915245416841802, 0.0035064946244545707, -0.06526268635951411, -0.21169394556895949, 0.3517843398945299, 0.012064805970060233, 0.26469218581727566, 0.14373523932506985, 0.10560747774384097, 0.09013095175065956, -0.09103709208242457, -0.02350694138085705, -0.12278800793380167, 0.0952856564881272, 0.24788259694770234, 0.04777926477852335, 0.14659434274888072, -0.35241099706872353, -0.11470062894768071, 0.057652868124410166, 0.13886143127615208, 0.09268565430712683, -0.009930485213876584, -0.24459848639651618, 0.05741218304938647, -0.2143492324160005, -0.10858975389661889, -0.0879859270142584, 0.026534351563059735, 0.03659766235913353, -0.2699843876354193, 0.09242802385733216, 0.01966852038876614, -0.014700132971149454, -0.03817039967719305, -0.21825901307058573, -0.09995215995526262, 0.05212118661823286, 0.0885659136913781, 0.05133376357375762, 0.15454481352099228, -0.17480443767874085, -0.15727944158943605, 0.3674052249072869, -0.059721517076865696, -0.18166716321874624, 0.1472493865080285, -0.2087371967540219, -0.11024438209922706, 0.17415685416266172, 0.22442397310655435, 0.1304037067206207, -0.1376998602772592, 0.08218907612113646, -0.02538588129240891, 0.12897279648305635, 0.08960424007141385, 0.09403563203188409, 0.14495161831132725, 0.1374246718538604, -0.02791391411293084, 0.11234129769272631, -0.13669176899624624, -0.08078739128942633, -0.3908768262307363, -0.138094381466722, -0.10905979379433496, 0.0798320303371326, -0.05598695363398459, -0.11544620469209187, 0.3592992106013685, 0.06690083205053113, 0.31785041660514674, 0.0018361076129193622, 0.2881379560754774, 0.14619077447448567, 0.0802187927631961, 0.03470707686963202, 0.2649815651066615, 0.20424772268054128, 0.09099940619773991, -0.17462525625268918, 0.028402763935362643, 0.02411119884078059] |
1,802.03245 | Ordered topographically patterned silicon by insect-inspired capillary
submicron stamping | Insect-inspired capillary submicron stamping and subsequent surface-limited
metal-assisted chemical etching (MACE) with ammonium bifluoride as HF source is
employed for high-throughput production of ordered topographically patterned
silicon (tpSi). Insect feet often possess hairy contact elements through which
adhesive secretion is deployed. Thus, arrays of adhesive secretion drops remain
as footprints on contact surfaces. Stamps for insect-inspired capillary
submicron stamping having surfaces topographically patterned with contact
elements mimic the functional principles of such insect feet. They contain
spongy continuous nanopore networks penetrating the entire stamps. Any ink
(organic, aqueous) may be supplied from the backside of the nanoporous stamps
to the contact elements. We generated ordered arrays of AgNO3 dots extending
mm^2 on Si by manual stamping with cycle times of a few seconds under ambient
conditions; at higher load ordered holey AgNO3 films were obtained.
Surface-limited MACE correspondingly yielded either macroporous tpSi or Si
pillar arrays. Inkjet printing of polymer solutions onto tpSi yielded patterns
of polymer blots conformally covering the tpSi. Such blot patterns could
potentially represent a starting point for the development of persistent and
scratch-resistant identity labels or QR codes on silicon surfaces.
| physics.app-ph | insectinspired capillary submicron stamping and subsequent surfacelimited metalassisted chemical etching mace with ammonium bifluoride as hf source is employed for highthroughput production of ordered topographically patterned silicon tpsi insect feet often possess hairy contact elements through which adhesive secretion is deployed thus arrays of adhesive secretion drops remain as footprints on contact surfaces stamps for insectinspired capillary submicron stamping having surfaces topographically patterned with contact elements mimic the functional principles of such insect feet they contain spongy continuous nanopore networks penetrating the entire stamps any ink organic aqueous may be supplied from the backside of the nanoporous stamps to the contact elements we generated ordered arrays of agno3 dots extending mm2 on si by manual stamping with cycle times of a few seconds under ambient conditions at higher load ordered holey agno3 films were obtained surfacelimited mace correspondingly yielded either macroporous tpsi or si pillar arrays inkjet printing of polymer solutions onto tpsi yielded patterns of polymer blots conformally covering the tpsi such blot patterns could potentially represent a starting point for the development of persistent and scratchresistant identity labels or qr codes on silicon surfaces | [['insectinspired', 'capillary', 'submicron', 'stamping', 'and', 'subsequent', 'surfacelimited', 'metalassisted', 'chemical', 'etching', 'mace', 'with', 'ammonium', 'bifluoride', 'as', 'hf', 'source', 'is', 'employed', 'for', 'highthroughput', 'production', 'of', 'ordered', 'topographically', 'patterned', 'silicon', 'tpsi', 'insect', 'feet', 'often', 'possess', 'hairy', 'contact', 'elements', 'through', 'which', 'adhesive', 'secretion', 'is', 'deployed', 'thus', 'arrays', 'of', 'adhesive', 'secretion', 'drops', 'remain', 'as', 'footprints', 'on', 'contact', 'surfaces', 'stamps', 'for', 'insectinspired', 'capillary', 'submicron', 'stamping', 'having', 'surfaces', 'topographically', 'patterned', 'with', 'contact', 'elements', 'mimic', 'the', 'functional', 'principles', 'of', 'such', 'insect', 'feet', 'they', 'contain', 'spongy', 'continuous', 'nanopore', 'networks', 'penetrating', 'the', 'entire', 'stamps', 'any', 'ink', 'organic', 'aqueous', 'may', 'be', 'supplied', 'from', 'the', 'backside', 'of', 'the', 'nanoporous', 'stamps', 'to', 'the', 'contact', 'elements', 'we', 'generated', 'ordered', 'arrays', 'of', 'agno3', 'dots', 'extending', 'mm2', 'on', 'si', 'by', 'manual', 'stamping', 'with', 'cycle', 'times', 'of', 'a', 'few', 'seconds', 'under', 'ambient', 'conditions', 'at', 'higher', 'load', 'ordered', 'holey', 'agno3', 'films', 'were', 'obtained', 'surfacelimited', 'mace', 'correspondingly', 'yielded', 'either', 'macroporous', 'tpsi', 'or', 'si', 'pillar', 'arrays', 'inkjet', 'printing', 'of', 'polymer', 'solutions', 'onto', 'tpsi', 'yielded', 'patterns', 'of', 'polymer', 'blots', 'conformally', 'covering', 'the', 'tpsi', 'such', 'blot', 'patterns', 'could', 'potentially', 'represent', 'a', 'starting', 'point', 'for', 'the', 'development', 'of', 'persistent', 'and', 'scratchresistant', 'identity', 'labels', 'or', 'qr', 'codes', 'on', 'silicon', 'surfaces']] | [-0.1137246904593702, 0.2180672033087901, -0.005603546069585075, -0.08254133658457898, -0.012792702968803476, -0.2308600546627496, 0.021199788161146954, 0.4606316730699075, -0.23150120046277894, -0.2792946273635929, 0.10074905566716803, -0.3203437390443946, -0.10925493823642231, 0.18914751712559563, -0.06708434955052933, 0.05856691816730363, 0.07116024477538545, -0.10380001649522938, -0.023416472488926796, -0.1742833282525821, 0.18009753384272367, 0.03640738620489671, 0.27274236936657303, 0.04397340147988871, 0.12402744302641888, -0.03420949713146901, 0.06298262221276894, 0.025517446737612973, -0.15585810918803455, 0.09823490468751721, 0.26354225872416376, -0.028901378539241646, 0.14055303785530593, -0.5688794105781952, -0.23494832096261214, 0.012156805781858526, 0.10675374748351217, 0.06616577286677157, -0.06683859686966656, -0.28275144707864325, 0.10109589840033033, -0.10571400800755876, -0.10772394355995425, 0.03547931552571322, -0.0071255300317515325, 0.08181803457655054, -0.19115970437659352, -0.010091702932316954, 0.021777933429044192, 0.10451738356267878, -0.03622216944201999, -0.13629735027985307, -0.09274358110687597, 0.12244241248085601, -0.03757189730830614, -0.026195619113805052, 0.3262939892544601, -0.07016364108894577, -0.03886311859386402, 0.34077208815399784, -0.022136863789299903, -0.1376767138415402, 0.19969560168149691, -0.09542838752318626, -0.038423696029879856, 0.2602420062320667, 0.1459240950052292, 0.11010330842321646, -0.15927295322087465, 0.014365347577593397, 0.020991817749625084, 0.20936718892942194, 0.24855514491769326, -0.020875801705338513, 0.24995335363088309, 0.2548309297671346, 0.018261563727498382, 0.12703041745625046, -0.10917695296943723, 0.0005771107695101456, -0.18414734491759407, -0.2198261826721056, -0.14644098446642703, 0.11754773027978796, -0.10735117148550727, -0.28461519667868457, 0.2934748411888658, 0.009381687107176948, 0.12306136090967043, 0.0012767141747921293, 0.21325100482652448, -0.07563977755055613, 0.15600510067190687, -0.023150559061963255, 0.14219503578066167, 0.12362218575516087, 0.1460679132563386, -0.14254298224757062, 0.136664058403395, 0.048256030111980125] |
1,802.03246 | RF assisted switching in magnetic Josephson junctions | We test the effect of an external RF field on the switching processes of
magnetic Josephson junctions (MJJs) suitable for the realization of fast,
scalable cryogenic memories compatible with Single Flux Quantum logic. We show
that the combined application of microwaves and magnetic field pulses can
improve the performances of the device, increasing the separation between the
critical current levels corresponding to logical '0' and '1'. The enhancement
of the current level separation can be as high as 80% using an optimal set of
parameters. We demonstrate that external RF fields can be used as an additional
tool to manipulate the memory states, and we expect that this approach may lead
to the development of new methods of selecting MJJs and manipulating their
states in memory arrays for various applications.
| cond-mat.supr-con | we test the effect of an external rf field on the switching processes of magnetic josephson junctions mjjs suitable for the realization of fast scalable cryogenic memories compatible with single flux quantum logic we show that the combined application of microwaves and magnetic field pulses can improve the performances of the device increasing the separation between the critical current levels corresponding to logical 0 and 1 the enhancement of the current level separation can be as high as 80 using an optimal set of parameters we demonstrate that external rf fields can be used as an additional tool to manipulate the memory states and we expect that this approach may lead to the development of new methods of selecting mjjs and manipulating their states in memory arrays for various applications | [['we', 'test', 'the', 'effect', 'of', 'an', 'external', 'rf', 'field', 'on', 'the', 'switching', 'processes', 'of', 'magnetic', 'josephson', 'junctions', 'mjjs', 'suitable', 'for', 'the', 'realization', 'of', 'fast', 'scalable', 'cryogenic', 'memories', 'compatible', 'with', 'single', 'flux', 'quantum', 'logic', 'we', 'show', 'that', 'the', 'combined', 'application', 'of', 'microwaves', 'and', 'magnetic', 'field', 'pulses', 'can', 'improve', 'the', 'performances', 'of', 'the', 'device', 'increasing', 'the', 'separation', 'between', 'the', 'critical', 'current', 'levels', 'corresponding', 'to', 'logical', '0', 'and', '1', 'the', 'enhancement', 'of', 'the', 'current', 'level', 'separation', 'can', 'be', 'as', 'high', 'as', '80', 'using', 'an', 'optimal', 'set', 'of', 'parameters', 'we', 'demonstrate', 'that', 'external', 'rf', 'fields', 'can', 'be', 'used', 'as', 'an', 'additional', 'tool', 'to', 'manipulate', 'the', 'memory', 'states', 'and', 'we', 'expect', 'that', 'this', 'approach', 'may', 'lead', 'to', 'the', 'development', 'of', 'new', 'methods', 'of', 'selecting', 'mjjs', 'and', 'manipulating', 'their', 'states', 'in', 'memory', 'arrays', 'for', 'various', 'applications']] | [-0.16992956187862615, 0.15664818581549647, -0.021240905371422952, 0.03354952397595088, -0.060046212708290955, -0.1321090988170069, 0.06964802561650196, 0.4130369459780363, -0.26711887097559295, -0.3578571799139564, 0.07619558529695496, -0.21791579025940827, -0.09645260716743696, 0.2785795515188231, -0.03895392051289001, 0.05398520176934723, 0.013062267302750395, 0.005895575762798006, -0.044272187526803466, -0.19090544195989004, 0.259017284715978, 0.0664822490984359, 0.33965741405979943, 0.05276596950940215, 0.10304980995849922, -0.013983388671364921, 0.07591235332499939, 0.028203070169995324, -0.05574931741167138, 0.11774022470568665, 0.23557694733966716, 0.08878134003697107, 0.23670822701130348, -0.5053859003076259, -0.1825691636848765, 0.06317394686719546, 0.13723191717961947, 0.14526883080028571, -0.05535948976892262, -0.28454789196570907, 0.10260773132770107, -0.16512898625805975, -0.10105007997928904, -0.13087692689866973, -0.003119418685897612, 0.07460050233281576, -0.2846468442549499, -0.014108846920470779, 0.06913549905248846, 0.055269592957427865, -0.047334614517883615, -0.10436421491993735, 0.0176519758757562, 0.14393909019059858, -0.02364138316972038, 0.04625536071857473, 0.1829932918637776, -0.1705631621164055, -0.18437727625266864, 0.28609399606402103, -0.08773263842225648, -0.1533916398954506, 0.18958309892779932, -0.097178375799782, -0.08249706599431542, 0.0824440440754048, 0.17633830733024158, 0.0909068995441955, -0.13386514393899304, 0.035238258255860556, 0.06178576803694551, 0.18756429987171522, 0.0621918331974974, 0.10161340003654074, 0.23676501975860448, 0.19268646542556012, 0.062138192165786255, 0.1804573795131336, -0.1297640240446736, -0.018803489116880182, -0.29309241134100233, -0.1815297559566366, -0.1753820875301384, 0.07087859956261057, -0.08129955447377422, -0.15764606670082476, 0.3941929819313093, 0.23289341397959595, 0.15432604358603175, -0.012329344695004133, 0.30459682700725704, 0.15285106510150048, 0.0923801075362672, 0.020822021085768937, 0.21813724456140055, 0.13982053123271235, 0.10489198775030673, -0.25397927466278464, 0.03369224702921481, -0.07021556668735754] |
1,802.03247 | Structural and electronic properties of V2O5 and their tuning by doping
with 3d elements - Modelling with DFT+U method and dispersion correction | New electrode materials for alkaline-ion batteries are a timely topic. Among
many promising candidates, V2O5 is one of the most interesting cathode
materials. While having very high theoretical capacity, in practice, its
performance is hindered by low stability and poor conductivity. As regards
theoretical descriptions of V2O5, common DFT-GGA calculations fail to reproduce
both the electronic and crystal structure. While the band gap is
underestimated, the interlayer spacing is overestimated as weak dispersion
interactions are not properly described within GGA. Here we show that the
combination of the DFT+U method and semi-empirical D2 correction can compensate
for the drawbacks of the GGA approximation when it comes to the modelling of
V2O5. When compared to common PBE calculations, with a modest increase of the
computational cost, PBE+U+D2 fully reproduced the experimental band gap of
V2O5, while the errors in the lattice parameters are only a few percent. Using
the proposed PBE+U+D2 methodology we studied V2O5 doped with 3d elements (from
Sc to Zn). We show that both the structural and electronic parameters are
affected by doping. Most importantly, a significant increase of conductivity is
expected upon doping, which is of great importance for the application of V2O5
in metal-ion batteries.
| cond-mat.mtrl-sci | new electrode materials for alkalineion batteries are a timely topic among many promising candidates v2o5 is one of the most interesting cathode materials while having very high theoretical capacity in practice its performance is hindered by low stability and poor conductivity as regards theoretical descriptions of v2o5 common dftgga calculations fail to reproduce both the electronic and crystal structure while the band gap is underestimated the interlayer spacing is overestimated as weak dispersion interactions are not properly described within gga here we show that the combination of the dftu method and semiempirical d2 correction can compensate for the drawbacks of the gga approximation when it comes to the modelling of v2o5 when compared to common pbe calculations with a modest increase of the computational cost pbeud2 fully reproduced the experimental band gap of v2o5 while the errors in the lattice parameters are only a few percent using the proposed pbeud2 methodology we studied v2o5 doped with 3d elements from sc to zn we show that both the structural and electronic parameters are affected by doping most importantly a significant increase of conductivity is expected upon doping which is of great importance for the application of v2o5 in metalion batteries | [['new', 'electrode', 'materials', 'for', 'alkalineion', 'batteries', 'are', 'a', 'timely', 'topic', 'among', 'many', 'promising', 'candidates', 'v2o5', 'is', 'one', 'of', 'the', 'most', 'interesting', 'cathode', 'materials', 'while', 'having', 'very', 'high', 'theoretical', 'capacity', 'in', 'practice', 'its', 'performance', 'is', 'hindered', 'by', 'low', 'stability', 'and', 'poor', 'conductivity', 'as', 'regards', 'theoretical', 'descriptions', 'of', 'v2o5', 'common', 'dftgga', 'calculations', 'fail', 'to', 'reproduce', 'both', 'the', 'electronic', 'and', 'crystal', 'structure', 'while', 'the', 'band', 'gap', 'is', 'underestimated', 'the', 'interlayer', 'spacing', 'is', 'overestimated', 'as', 'weak', 'dispersion', 'interactions', 'are', 'not', 'properly', 'described', 'within', 'gga', 'here', 'we', 'show', 'that', 'the', 'combination', 'of', 'the', 'dftu', 'method', 'and', 'semiempirical', 'd2', 'correction', 'can', 'compensate', 'for', 'the', 'drawbacks', 'of', 'the', 'gga', 'approximation', 'when', 'it', 'comes', 'to', 'the', 'modelling', 'of', 'v2o5', 'when', 'compared', 'to', 'common', 'pbe', 'calculations', 'with', 'a', 'modest', 'increase', 'of', 'the', 'computational', 'cost', 'pbeud2', 'fully', 'reproduced', 'the', 'experimental', 'band', 'gap', 'of', 'v2o5', 'while', 'the', 'errors', 'in', 'the', 'lattice', 'parameters', 'are', 'only', 'a', 'few', 'percent', 'using', 'the', 'proposed', 'pbeud2', 'methodology', 'we', 'studied', 'v2o5', 'doped', 'with', '3d', 'elements', 'from', 'sc', 'to', 'zn', 'we', 'show', 'that', 'both', 'the', 'structural', 'and', 'electronic', 'parameters', 'are', 'affected', 'by', 'doping', 'most', 'importantly', 'a', 'significant', 'increase', 'of', 'conductivity', 'is', 'expected', 'upon', 'doping', 'which', 'is', 'of', 'great', 'importance', 'for', 'the', 'application', 'of', 'v2o5', 'in', 'metalion', 'batteries']] | [-0.0754226873779066, 0.079295434011384, 0.0033706954133349985, 0.057063147308345295, -0.029200054418856317, -0.1718979380402372, 0.10430623191332787, 0.43929074881408287, -0.2537385685516673, -0.3279669307866039, 0.03337916158310765, -0.3408737361991816, -0.12348480848465572, 0.18343821940563468, -0.05999942231158327, 0.053593214171551336, 0.04766465889346995, -0.057120217345369866, -0.11819014752346652, -0.230776991247323, 0.23254314267221476, 0.10244462435722959, 0.30562882350486875, 0.12056413620867178, -0.010708535106719605, -0.04513829943666957, 0.06826661903605967, 0.07973969790476318, -0.09442806464647553, 0.1239829716529241, 0.2989692124193629, -0.03121479944211944, 0.26229315376911805, -0.4431008036647524, -0.2652663575884487, -0.004450921828107794, 0.10609062255612023, 0.14306691802541574, -0.08998780038649673, -0.19847654970837947, 0.10539820797002532, -0.17299435201709215, -0.10208671873112266, -0.12280153290829526, -0.026112736896516716, 0.04169103441129163, -0.21757145919890514, 0.09887590470999404, 0.01387030325891754, 0.05510123346494784, -0.08839468634509177, -0.22056838153856712, -0.07769146684690245, 0.09748107988098684, 0.06215421833592106, 0.03635330036596148, 0.13476193679629692, -0.1230366668207761, -0.04397120810593763, 0.44270567250038895, -0.03980145629789984, -0.11791476333627895, 0.17542647245359055, -0.13567664974597188, -0.1075158072896872, 0.16572396920005583, 0.09308456632692358, 0.07078115702416672, -0.14170775045887257, 0.07324131968588128, 0.036056413494611195, 0.1983167464436241, 0.02474214369312347, 0.07366603834326474, 0.17253812594690873, 0.22200069844257087, 0.0149033789695787, 0.07987456162441142, -0.08251087229855701, -0.05898953701977675, -0.21300749288757845, -0.15103222847184433, -0.22594718244615752, -0.0007731249063407613, -0.09171518811460688, -0.1867984679016185, 0.38612274460646573, 0.1621719496609757, 0.14025192322893715, -0.03407507272002439, 0.2830961787668104, 0.10475785519846963, 0.09409557164133507, 0.036695831208204736, 0.2837025199432344, 0.14252535911509767, 0.07070242011282897, -0.25184845670283185, 0.1353867737462326, -0.011719322931472858] |
1,802.03248 | Piecewise Flat Embedding for Image Segmentation | We introduce a new multi-dimensional nonlinear embedding -- Piecewise Flat
Embedding (PFE) -- for image segmentation. Based on the theory of sparse signal
recovery, piecewise flat embedding with diverse channels attempts to recover a
piecewise constant image representation with sparse region boundaries and
sparse cluster value scattering. The resultant piecewise flat embedding
exhibits interesting properties such as suppressing slowly varying signals, and
offers an image representation with higher region identifiability which is
desirable for image segmentation or high-level semantic analysis tasks. We
formulate our embedding as a variant of the Laplacian Eigenmap embedding with
an $L_{1,p} (0<p\leq1)$ regularization term to promote sparse solutions. First,
we devise a two-stage numerical algorithm based on Bregman iterations to
compute $L_{1,1}$-regularized piecewise flat embeddings. We further generalize
this algorithm through iterative reweighting to solve the general
$L_{1,p}$-regularized problem. To demonstrate its efficacy, we integrate PFE
into two existing image segmentation frameworks, segmentation based on
clustering and hierarchical segmentation based on contour detection.
Experiments on four major benchmark datasets, BSDS500, MSRC, Stanford
Background Dataset, and PASCAL Context, show that segmentation algorithms
incorporating our embedding achieve significantly improved results.
| cs.CV eess.IV stat.ML | we introduce a new multidimensional nonlinear embedding piecewise flat embedding pfe for image segmentation based on the theory of sparse signal recovery piecewise flat embedding with diverse channels attempts to recover a piecewise constant image representation with sparse region boundaries and sparse cluster value scattering the resultant piecewise flat embedding exhibits interesting properties such as suppressing slowly varying signals and offers an image representation with higher region identifiability which is desirable for image segmentation or highlevel semantic analysis tasks we formulate our embedding as a variant of the laplacian eigenmap embedding with an l_1p 0pleq1 regularization term to promote sparse solutions first we devise a twostage numerical algorithm based on bregman iterations to compute l_11regularized piecewise flat embeddings we further generalize this algorithm through iterative reweighting to solve the general l_1pregularized problem to demonstrate its efficacy we integrate pfe into two existing image segmentation frameworks segmentation based on clustering and hierarchical segmentation based on contour detection experiments on four major benchmark datasets bsds500 msrc stanford background dataset and pascal context show that segmentation algorithms incorporating our embedding achieve significantly improved results | [['we', 'introduce', 'a', 'new', 'multidimensional', 'nonlinear', 'embedding', 'piecewise', 'flat', 'embedding', 'pfe', 'for', 'image', 'segmentation', 'based', 'on', 'the', 'theory', 'of', 'sparse', 'signal', 'recovery', 'piecewise', 'flat', 'embedding', 'with', 'diverse', 'channels', 'attempts', 'to', 'recover', 'a', 'piecewise', 'constant', 'image', 'representation', 'with', 'sparse', 'region', 'boundaries', 'and', 'sparse', 'cluster', 'value', 'scattering', 'the', 'resultant', 'piecewise', 'flat', 'embedding', 'exhibits', 'interesting', 'properties', 'such', 'as', 'suppressing', 'slowly', 'varying', 'signals', 'and', 'offers', 'an', 'image', 'representation', 'with', 'higher', 'region', 'identifiability', 'which', 'is', 'desirable', 'for', 'image', 'segmentation', 'or', 'highlevel', 'semantic', 'analysis', 'tasks', 'we', 'formulate', 'our', 'embedding', 'as', 'a', 'variant', 'of', 'the', 'laplacian', 'eigenmap', 'embedding', 'with', 'an', 'l_1p', '0pleq1', 'regularization', 'term', 'to', 'promote', 'sparse', 'solutions', 'first', 'we', 'devise', 'a', 'twostage', 'numerical', 'algorithm', 'based', 'on', 'bregman', 'iterations', 'to', 'compute', 'l_11regularized', 'piecewise', 'flat', 'embeddings', 'we', 'further', 'generalize', 'this', 'algorithm', 'through', 'iterative', 'reweighting', 'to', 'solve', 'the', 'general', 'l_1pregularized', 'problem', 'to', 'demonstrate', 'its', 'efficacy', 'we', 'integrate', 'pfe', 'into', 'two', 'existing', 'image', 'segmentation', 'frameworks', 'segmentation', 'based', 'on', 'clustering', 'and', 'hierarchical', 'segmentation', 'based', 'on', 'contour', 'detection', 'experiments', 'on', 'four', 'major', 'benchmark', 'datasets', 'bsds500', 'msrc', 'stanford', 'background', 'dataset', 'and', 'pascal', 'context', 'show', 'that', 'segmentation', 'algorithms', 'incorporating', 'our', 'embedding', 'achieve', 'significantly', 'improved', 'results']] | [-0.017286524067336287, -0.06754009526950702, -0.06929379811526053, 0.052249876663931674, -0.13844864554547148, -0.18729300125548876, 0.0020091802723362375, 0.4754856395842143, -0.2996351762737184, -0.2941417661079273, 0.11929366275845044, -0.26025482470835637, -0.21228677650273636, 0.16578471125233607, -0.13127827241934847, 0.09408552061171953, 0.13451996871514776, 0.01233735124908346, -0.1142657817583323, -0.2658629510070421, 0.28560997005656114, 0.03444259986801687, 0.3411551962760095, 0.009885850212895753, 0.17044521260007633, 0.012286127750454835, -0.06505139347675709, 0.006113743140913713, -0.09793514854752872, 0.17630212098898565, 0.2853253144619976, 0.18444555816786914, 0.270959844349691, -0.3858007138449303, -0.2603358341583868, 0.09243805692713271, 0.17104495648169818, 0.07773332379105717, -0.09634783550423463, -0.3586925936189048, 0.08348112301471743, -0.10435089201656009, 0.031015670617688552, -0.17016584196845955, -0.05528841001975387, -0.05996978596144215, -0.3170247826954173, 0.07594802850914609, 0.07166204829674276, -0.013660941496699549, -0.11648963312956624, -0.12352375589589479, 0.060189475838677675, 0.10619662009965233, -0.012187543390813028, 0.08396658186368935, 0.14235424640323113, -0.14922585711013214, -0.1498878760219099, 0.34393900362826757, -0.09584029311022861, -0.2686510640166423, 0.18296075844616946, -0.01660694258662159, -0.17937601735170244, 0.11413626396877681, 0.23933623102883803, 0.1300149810963503, -0.10129098964116261, 0.07127311566516799, -0.04927406267798896, 0.18008418662301864, 0.10836358737543891, -0.039328469505583004, 0.11956449264826971, 0.2537175764110802, 0.09703303554665048, 0.17529280400931233, -0.1438970410878973, -0.0693410707679291, -0.21756336025432904, -0.07607398030943856, -0.15437637225142029, -0.04758629446404378, -0.19324142895814542, -0.22470910386208381, 0.3969900925596916, 0.17913754194111214, 0.22646168517547155, 0.12730247156197652, 0.367643429679203, 0.040719612371488655, 0.051304542527510655, 0.09466907971502182, 0.1455440145992679, 0.07194128011056748, 0.04884759455336539, -0.1588658742273653, 0.010579891361077655, 0.17248064196959928] |
1,802.03249 | Analysis of the Robustness of Conventional and Topologically Protected
Edge States in Phononic Crystal Plates | In this work we theoretically study the interface acoustic states of
resonators on a thin plate with topologically protected and conventional
designs. Topologically protected interface state is first analyzed by employing
the conception of breaking inversion symmetry within the unit cell of a
honeycomb lattice for cylindrical and spherical resonators; we further
demonstrate the robustness of the wave propagation along a zig-zag path
containing sharp corners, defect and disorder. The wave propagation ceases to
be preserved if we increase the degree of disorder along the zig-zag path. In
parallel, the conventional interface state is also designed and compared to the
same situations. We found that the conventional interface state suffers back
scattering in the zig-zag path while it can show a more confined wave transport
in some cases. The presence of a defect along the propagation path scatters the
conventional interface wave and in particular can prohibit a full propagation
in presence of a localized state at the defect. If the zig-zag path is made
disordered, the propagation of the conventional interface mode can be conserved
at given frequencies for a low random degree and disappears for higher random
degree as the interface bands become flat in dispersion and turn to localized
states. Finally, we show that the immunity of the topologically protected
design needs the interface to be surrounded by at least two hexagons of the
phononic crystals on both sides, especially at the sharp corners in the zig-zag
path, while the conventional design only needs one hexagon bulk media with the
advantage of compact wave transport. This work puts a step forward for the
interface states in micro-/nano-scale characterization and figures out the
behaviors for both topologically protected and conventional interface states.
| cond-mat.mtrl-sci | in this work we theoretically study the interface acoustic states of resonators on a thin plate with topologically protected and conventional designs topologically protected interface state is first analyzed by employing the conception of breaking inversion symmetry within the unit cell of a honeycomb lattice for cylindrical and spherical resonators we further demonstrate the robustness of the wave propagation along a zigzag path containing sharp corners defect and disorder the wave propagation ceases to be preserved if we increase the degree of disorder along the zigzag path in parallel the conventional interface state is also designed and compared to the same situations we found that the conventional interface state suffers back scattering in the zigzag path while it can show a more confined wave transport in some cases the presence of a defect along the propagation path scatters the conventional interface wave and in particular can prohibit a full propagation in presence of a localized state at the defect if the zigzag path is made disordered the propagation of the conventional interface mode can be conserved at given frequencies for a low random degree and disappears for higher random degree as the interface bands become flat in dispersion and turn to localized states finally we show that the immunity of the topologically protected design needs the interface to be surrounded by at least two hexagons of the phononic crystals on both sides especially at the sharp corners in the zigzag path while the conventional design only needs one hexagon bulk media with the advantage of compact wave transport this work puts a step forward for the interface states in micronanoscale characterization and figures out the behaviors for both topologically protected and conventional interface states | [['in', 'this', 'work', 'we', 'theoretically', 'study', 'the', 'interface', 'acoustic', 'states', 'of', 'resonators', 'on', 'a', 'thin', 'plate', 'with', 'topologically', 'protected', 'and', 'conventional', 'designs', 'topologically', 'protected', 'interface', 'state', 'is', 'first', 'analyzed', 'by', 'employing', 'the', 'conception', 'of', 'breaking', 'inversion', 'symmetry', 'within', 'the', 'unit', 'cell', 'of', 'a', 'honeycomb', 'lattice', 'for', 'cylindrical', 'and', 'spherical', 'resonators', 'we', 'further', 'demonstrate', 'the', 'robustness', 'of', 'the', 'wave', 'propagation', 'along', 'a', 'zigzag', 'path', 'containing', 'sharp', 'corners', 'defect', 'and', 'disorder', 'the', 'wave', 'propagation', 'ceases', 'to', 'be', 'preserved', 'if', 'we', 'increase', 'the', 'degree', 'of', 'disorder', 'along', 'the', 'zigzag', 'path', 'in', 'parallel', 'the', 'conventional', 'interface', 'state', 'is', 'also', 'designed', 'and', 'compared', 'to', 'the', 'same', 'situations', 'we', 'found', 'that', 'the', 'conventional', 'interface', 'state', 'suffers', 'back', 'scattering', 'in', 'the', 'zigzag', 'path', 'while', 'it', 'can', 'show', 'a', 'more', 'confined', 'wave', 'transport', 'in', 'some', 'cases', 'the', 'presence', 'of', 'a', 'defect', 'along', 'the', 'propagation', 'path', 'scatters', 'the', 'conventional', 'interface', 'wave', 'and', 'in', 'particular', 'can', 'prohibit', 'a', 'full', 'propagation', 'in', 'presence', 'of', 'a', 'localized', 'state', 'at', 'the', 'defect', 'if', 'the', 'zigzag', 'path', 'is', 'made', 'disordered', 'the', 'propagation', 'of', 'the', 'conventional', 'interface', 'mode', 'can', 'be', 'conserved', 'at', 'given', 'frequencies', 'for', 'a', 'low', 'random', 'degree', 'and', 'disappears', 'for', 'higher', 'random', 'degree', 'as', 'the', 'interface', 'bands', 'become', 'flat', 'in', 'dispersion', 'and', 'turn', 'to', 'localized', 'states', 'finally', 'we', 'show', 'that', 'the', 'immunity', 'of', 'the', 'topologically', 'protected', 'design', 'needs', 'the', 'interface', 'to', 'be', 'surrounded', 'by', 'at', 'least', 'two', 'hexagons', 'of', 'the', 'phononic', 'crystals', 'on', 'both', 'sides', 'especially', 'at', 'the', 'sharp', 'corners', 'in', 'the', 'zigzag', 'path', 'while', 'the', 'conventional', 'design', 'only', 'needs', 'one', 'hexagon', 'bulk', 'media', 'with', 'the', 'advantage', 'of', 'compact', 'wave', 'transport', 'this', 'work', 'puts', 'a', 'step', 'forward', 'for', 'the', 'interface', 'states', 'in', 'micronanoscale', 'characterization', 'and', 'figures', 'out', 'the', 'behaviors', 'for', 'both', 'topologically', 'protected', 'and', 'conventional', 'interface', 'states']] | [-0.19453694604535612, 0.18238319358731042, -0.04562229193537168, 0.004948121714028596, -0.06151857620173193, -0.1610887872602817, 0.04606574600313226, 0.4151531048709343, -0.28339985063181483, -0.2157356883378693, 0.08401852099406927, -0.3032842080713853, -0.1451718024056877, 0.14040150021942346, 0.017714508828620138, 0.04516644528033999, 0.03749310683531188, -0.0006720215290404437, -0.07756640331415479, -0.16912442821481358, 0.2844879054005297, 0.01843143443734398, 0.3595344581096892, 0.07541573246855708, 0.04230399673327502, 0.04050908952748115, 0.08922067962744286, 0.05231097262540829, -0.1096436328705647, 0.09276135480211734, 0.23262257715785534, -0.026790097526366442, 0.20808969823558304, -0.5005138409586335, -0.22824042069669945, 0.0004269720160100662, 0.16680606700148776, 0.16395597398677894, -0.06623322462309915, -0.2972514069439109, 0.08952066198345536, -0.10471422627008099, -0.1669393659965504, 0.007791077180845092, -0.0366185278456304, -0.0456696439023674, -0.19926844540639932, 0.06468646940650193, 0.052561079586026405, 0.04126896214930498, -0.022824904556766574, -0.07008930386952453, -0.11753244702146769, 0.09827262397960458, 0.016581561440982346, 0.020224641263320988, 0.09745106466063692, -0.13930837921966294, -0.11471403045965109, 0.38538119798152326, -0.03254802416682958, -0.20147166249807924, 0.20764052777462574, -0.1493964725800972, -0.047108204556550355, 0.17039330020869925, 0.14187705141990642, 0.08062791490835518, -0.1013081215537632, 0.05745381617965341, 0.010561460160421171, 0.1499055383077652, 0.10424225479544758, 0.05885197331843583, 0.22432639448804917, 0.15330303608092258, 0.11023880822586493, 0.1826934141888198, -0.11355713940501003, -0.07120591538472915, -0.28947353147422816, -0.21373015611668603, -0.20274696224498232, 0.004708275763745482, -0.06551969736054315, -0.20125676399346074, 0.43585183274682976, 0.11284563681077947, 0.16094700539645307, 0.008750941406797722, 0.26099147371337816, 0.11491127668397869, 0.06920200983770716, 0.09926259720002786, 0.24800600571294304, 0.10875313540241799, 0.07455299782135702, -0.22287128813905824, 0.05290197130074068, 0.013250439279404481] |
1,802.0325 | Exponential mixing for a class of dissipative PDEs with bounded
degenerate noise | We study a class of discrete-time random dynamical systems with compact phase
space. Assuming that the deterministic counterpart of the system in question
possesses a dissipation property, its linearisation is approximately
controllable, and the driving noise is bounded and has a decomposable
structure, we prove that the corresponding family of Markov processes has a
unique stationary measure, which is exponentially mixing in the dual-Lipschitz
metric. The abstract result is applicable to nonlinear dissipative PDEs
perturbed by a bounded random force which affects only a few Fourier modes. We
assume that the nonlinear PDE in question is well posed, its nonlinearity is
non-degenerate in the sense of the control theory, and the random force is a
regular and bounded function of time which satisfies some decomposability and
observability hypotheses. This class of forces includes random Haar series,
where the coefficients for high Haar modes decay sufficiently fast. In
particular, the result applies to the 2D Navier-Stokes system and the nonlinear
complex Ginzburg-Landau equations. The proof of the abstract theorem uses the
coupling method, enhanced by the Newton-Kantorovich-Kolmogorov fast
convergence.
| math.AP math-ph math.MP math.OC math.PR | we study a class of discretetime random dynamical systems with compact phase space assuming that the deterministic counterpart of the system in question possesses a dissipation property its linearisation is approximately controllable and the driving noise is bounded and has a decomposable structure we prove that the corresponding family of markov processes has a unique stationary measure which is exponentially mixing in the duallipschitz metric the abstract result is applicable to nonlinear dissipative pdes perturbed by a bounded random force which affects only a few fourier modes we assume that the nonlinear pde in question is well posed its nonlinearity is nondegenerate in the sense of the control theory and the random force is a regular and bounded function of time which satisfies some decomposability and observability hypotheses this class of forces includes random haar series where the coefficients for high haar modes decay sufficiently fast in particular the result applies to the 2d navierstokes system and the nonlinear complex ginzburglandau equations the proof of the abstract theorem uses the coupling method enhanced by the newtonkantorovichkolmogorov fast convergence | [['we', 'study', 'a', 'class', 'of', 'discretetime', 'random', 'dynamical', 'systems', 'with', 'compact', 'phase', 'space', 'assuming', 'that', 'the', 'deterministic', 'counterpart', 'of', 'the', 'system', 'in', 'question', 'possesses', 'a', 'dissipation', 'property', 'its', 'linearisation', 'is', 'approximately', 'controllable', 'and', 'the', 'driving', 'noise', 'is', 'bounded', 'and', 'has', 'a', 'decomposable', 'structure', 'we', 'prove', 'that', 'the', 'corresponding', 'family', 'of', 'markov', 'processes', 'has', 'a', 'unique', 'stationary', 'measure', 'which', 'is', 'exponentially', 'mixing', 'in', 'the', 'duallipschitz', 'metric', 'the', 'abstract', 'result', 'is', 'applicable', 'to', 'nonlinear', 'dissipative', 'pdes', 'perturbed', 'by', 'a', 'bounded', 'random', 'force', 'which', 'affects', 'only', 'a', 'few', 'fourier', 'modes', 'we', 'assume', 'that', 'the', 'nonlinear', 'pde', 'in', 'question', 'is', 'well', 'posed', 'its', 'nonlinearity', 'is', 'nondegenerate', 'in', 'the', 'sense', 'of', 'the', 'control', 'theory', 'and', 'the', 'random', 'force', 'is', 'a', 'regular', 'and', 'bounded', 'function', 'of', 'time', 'which', 'satisfies', 'some', 'decomposability', 'and', 'observability', 'hypotheses', 'this', 'class', 'of', 'forces', 'includes', 'random', 'haar', 'series', 'where', 'the', 'coefficients', 'for', 'high', 'haar', 'modes', 'decay', 'sufficiently', 'fast', 'in', 'particular', 'the', 'result', 'applies', 'to', 'the', '2d', 'navierstokes', 'system', 'and', 'the', 'nonlinear', 'complex', 'ginzburglandau', 'equations', 'the', 'proof', 'of', 'the', 'abstract', 'theorem', 'uses', 'the', 'coupling', 'method', 'enhanced', 'by', 'the', 'newtonkantorovichkolmogorov', 'fast', 'convergence']] | [-0.1668886153917302, 0.13759353448108028, -0.08482237247024048, 0.04732200417860913, -0.08954916409437813, -0.14879250032945646, -0.001491380358867263, 0.3189059414093167, -0.3420087668971069, -0.19071263347431427, 0.1267120486160209, -0.25096695347936393, -0.17300912070661614, 0.1861968094083128, -0.06803451986762427, 0.10746989773236489, 0.04937572457753964, 0.0448043452191698, -0.038607216669025564, -0.20745565334734858, 0.35334730652913365, -0.02254073648045292, 0.24375097767455178, 0.0004918350717105435, 0.15477988142046636, -0.008990116227328735, -0.01043270766606165, 0.010192139272671456, -0.1054264007571221, 0.07213888243156469, 0.19268659206165137, 0.07172542315707832, 0.3151720519280219, -0.3658262422771356, -0.21031515090331687, 0.13363183164800713, 0.10221265068298764, 0.08592055205553033, -0.026977095528016404, -0.29290800194892674, 0.0848902850490758, -0.1167682852480287, -0.17748762274852897, -0.07809258871027769, 0.028667596091205876, 0.04449643848442846, -0.3315149612430783, 0.08437096455665884, 0.16549169565771318, 0.02499949897371106, -0.07272378090074506, -0.004927615589057069, -0.017871947728865648, 0.06264249404029405, 0.00892102947763804, 0.0322629753539686, 0.11221663348145236, -0.08550397412309496, -0.08087104965806387, 0.3700506383941856, -0.10821563037741129, -0.2650145931632421, 0.19700897234560405, -0.1479439843777504, -0.12773946827898422, 0.13781178082302634, 0.1635031492073131, 0.1341401032977185, -0.13960673620083797, 0.17386105374661984, -0.06687227219059053, 0.15647216407992579, 0.046362031303809184, 0.05257966797430552, 0.10407466721578927, 0.17299760774825043, 0.1307331461322594, 0.1510295492023398, -0.010180451459972198, -0.12087080436679772, -0.300289188469576, -0.13371108495367237, -0.21161740301124288, 0.08492772526365552, -0.10229263191803958, -0.21260628380844274, 0.3965676981787392, 0.10349872948542319, 0.15470165991366414, 0.10246469206268778, 0.2542254436092904, 0.19889905809761568, 0.002011407133176039, 0.08461698899992694, 0.21467845709971414, 0.19483414658682033, 0.1002595783553302, -0.19432680811706698, 0.06581991144961094, 0.11619587638620932] |
1,802.03251 | Projective lines in the affine flag manifold with given tangent root
vector | We first describe the tangent space to the affine flag manifold associated to
a simple algebraic group over $\mathbb{C}$ at the distinguished point starting
from standard definitions. We then construct projective lines in the affine
flag manifold tangent to given root vectors associated to imaginary roots of
the corresponding affine Kac-Moody algebra and describe in which Schubert
varieties they lie.
| math.AG math.RT | we first describe the tangent space to the affine flag manifold associated to a simple algebraic group over mathbbc at the distinguished point starting from standard definitions we then construct projective lines in the affine flag manifold tangent to given root vectors associated to imaginary roots of the corresponding affine kacmoody algebra and describe in which schubert varieties they lie | [['we', 'first', 'describe', 'the', 'tangent', 'space', 'to', 'the', 'affine', 'flag', 'manifold', 'associated', 'to', 'a', 'simple', 'algebraic', 'group', 'over', 'mathbbc', 'at', 'the', 'distinguished', 'point', 'starting', 'from', 'standard', 'definitions', 'we', 'then', 'construct', 'projective', 'lines', 'in', 'the', 'affine', 'flag', 'manifold', 'tangent', 'to', 'given', 'root', 'vectors', 'associated', 'to', 'imaginary', 'roots', 'of', 'the', 'corresponding', 'affine', 'kacmoody', 'algebra', 'and', 'describe', 'in', 'which', 'schubert', 'varieties', 'they', 'lie']] | [-0.16977312870634098, -0.015285349367574478, -0.06531206938282898, 0.034461843885947016, -0.21734419821295886, -0.14796715173967337, -0.019139075372368097, 0.3552457236374418, -0.4270326108982166, -0.086778770495827, 0.1070836516941199, -0.2132106908907493, -0.1759363849957784, 0.17261416380448888, -0.18387283619182807, -0.05757730111945421, 0.002708616484111796, 0.15859279367141427, -0.20564860531788628, -0.293156051216647, 0.48048264750589925, -0.05495850124085943, 0.23672639719831448, -0.044902128741766016, 0.23316784668713808, -0.03485860324775179, -0.011357830798563858, -0.025890002477778278, -0.1393912033798794, 0.12570664066200454, 0.41456033911866447, 0.06881986879743636, 0.13571273327494662, -0.377961309440434, -0.058713563329850636, 0.2604620607104152, 0.19575740568495045, 0.01897919425391592, 0.06634235889650882, -0.29921109036076815, 0.04984650722083946, -0.12542389867982517, -0.23838300841550034, -0.04223021622747183, 0.03095400147140026, -0.026509308776197334, -0.1637176112427066, -0.06611413261853158, 0.013011182316889365, 0.1928823547437787, -0.10561397440421084, -0.1256334254653969, -0.1096693403708438, 0.04671956365151952, -0.09993197184521704, 0.08759894114142905, 0.16057675669435412, 0.0028536174601564803, -0.1797046594399338, 0.3947231169169148, -0.013482371810823679, -0.301875129279991, 0.08311955366904537, -0.22392362247531614, -0.15197123961988837, 0.18749792023251455, 0.1598471564318364, 0.07299367872377237, 0.03287731198797701, 0.16770926934259478, -0.08333177585154772, -0.08635114454421758, 0.09375474575596551, -0.08959702817179883, 0.14402737584896386, 0.0035008262687673173, 0.028979457425884904, 0.08119797858428986, 0.018332533513118202, -0.1271030756412074, -0.42827210761606693, -0.22245462459201615, -0.08878483228230229, 0.21027059541471924, -0.1532742588079903, -0.18409384465776385, 0.42917274999587485, 0.0739680116996169, 0.23309966226418813, 0.13788472945064617, 0.18807286266237497, 0.03360135459030668, 0.10388598209246994, 0.050994496505700225, 0.10289131749887019, 0.25894671720452606, -0.0621587045044483, -0.12237429685968285, -0.086761676093253, 0.23375281281769275] |
1,802.03252 | Multiple Target Tracking by Learning Feature Representation and Distance
Metric Jointly | Designing a robust affinity model is the key issue in multiple target
tracking (MTT). This paper proposes a novel affinity model by learning feature
representation and distance metric jointly in a unified deep architecture.
Specifically, we design a CNN network to obtain appearance cue tailored towards
person Re-ID, and an LSTM network for motion cue to predict target position,
respectively. Both cues are combined with a triplet loss function, which
performs end-to-end learning of the fused features in a desired embedding
space. Experiments in the challenging MOT benchmark demonstrate, that even by a
simple Linear Assignment strategy fed with affinity scores of our method, very
competitive results are achieved when compared with the most recent
state-of-theart approaches.
| cs.CV | designing a robust affinity model is the key issue in multiple target tracking mtt this paper proposes a novel affinity model by learning feature representation and distance metric jointly in a unified deep architecture specifically we design a cnn network to obtain appearance cue tailored towards person reid and an lstm network for motion cue to predict target position respectively both cues are combined with a triplet loss function which performs endtoend learning of the fused features in a desired embedding space experiments in the challenging mot benchmark demonstrate that even by a simple linear assignment strategy fed with affinity scores of our method very competitive results are achieved when compared with the most recent stateoftheart approaches | [['designing', 'a', 'robust', 'affinity', 'model', 'is', 'the', 'key', 'issue', 'in', 'multiple', 'target', 'tracking', 'mtt', 'this', 'paper', 'proposes', 'a', 'novel', 'affinity', 'model', 'by', 'learning', 'feature', 'representation', 'and', 'distance', 'metric', 'jointly', 'in', 'a', 'unified', 'deep', 'architecture', 'specifically', 'we', 'design', 'a', 'cnn', 'network', 'to', 'obtain', 'appearance', 'cue', 'tailored', 'towards', 'person', 'reid', 'and', 'an', 'lstm', 'network', 'for', 'motion', 'cue', 'to', 'predict', 'target', 'position', 'respectively', 'both', 'cues', 'are', 'combined', 'with', 'a', 'triplet', 'loss', 'function', 'which', 'performs', 'endtoend', 'learning', 'of', 'the', 'fused', 'features', 'in', 'a', 'desired', 'embedding', 'space', 'experiments', 'in', 'the', 'challenging', 'mot', 'benchmark', 'demonstrate', 'that', 'even', 'by', 'a', 'simple', 'linear', 'assignment', 'strategy', 'fed', 'with', 'affinity', 'scores', 'of', 'our', 'method', 'very', 'competitive', 'results', 'are', 'achieved', 'when', 'compared', 'with', 'the', 'most', 'recent', 'stateoftheart', 'approaches']] | [-0.026101303406250782, -0.024320427461802904, -0.06976986963889462, 0.03603657701402966, -0.07490766496580635, -0.28284720140787906, 0.00456421188890743, 0.5076027930610709, -0.2691938905254341, -0.3229146193171668, -0.0024647929578319066, -0.252728441483381, -0.2224462811425169, 0.12863259910183966, -0.14140719683929737, 0.09901361558168457, 0.16888531203517038, 0.06729847574845338, -0.06608461077189726, -0.2391405280999855, 0.28311779495909745, 0.085914083503527, 0.37339508673574173, 0.009241385982395748, 0.16960739952504125, -0.010476300059683407, -0.008436437098221837, 0.0060730523001462314, -0.015539103339171996, 0.22624830702497847, 0.31171620400765765, 0.16938862426549248, 0.3504513503712976, -0.3677153773128222, -0.2409295090693089, 0.038911109312604636, 0.130030729334292, 0.10911932143354867, -0.07931781894901496, -0.3657836439485988, 0.06391512193820542, -0.16307000003150132, 0.004226706965834412, -0.13095953159082013, -0.036009353983542346, -0.04181439979559081, -0.34763800960957497, 0.023146892812214475, 0.070538266048504, 0.015767855275199454, -0.09669016667693439, -0.13496578337015727, 0.06093944493943873, 0.1656042138807591, -0.022853469520878907, 0.09954467710728447, 0.1419489056749556, -0.21429271928560084, -0.13228432778527754, 0.3617237178911256, -0.11482867087102216, -0.25248949881643057, 0.1807942117890741, 0.009460429645055888, -0.11842279559853049, 0.09830033044434255, 0.24667688915267205, 0.14959009589167693, -0.1784846523333128, -0.04479570294288584, -0.058090851785471805, 0.17310521710250112, 0.027454856982152175, -0.016043507310951877, 0.20819404922250626, 0.31221413248393715, 0.06560600142673247, 0.12749421325687352, -0.15874422688244116, -0.0543966608790633, -0.18357730782481357, -0.09157498040371853, -0.1819837104815703, -0.061499858625296853, -0.1041482839507994, -0.09476619421128327, 0.41576933175818914, 0.2043235495001969, 0.2865376761143342, 0.13718150897671938, 0.35441671560208005, 0.021542273013072454, 0.09035515614076813, 0.07358782678349023, 0.18399339799697584, -0.002922484414397269, 0.08315653974811237, -0.19016613364299265, 0.08971705722013631, 0.09980119501726113] |
1,802.03253 | Recent studies on single-shot diagnostics for plasma accelerators at
SPARC_LAB | Plasma wakefield acceleration is the most promising acceleration technique
for compact and cheap accelerators, thanks to the high accelerating gradients
achievable. Nevertheless, this approach still suffers of shot-to-shot
instabilities, mostly related to experimental parameters fluctuations.
Therefore, the use of single shot diagnostics is needed to properly understand
the acceleration mechanism. In this work, we present two diagnostics to probe
electron beams from laser-plasma interactions, one relying on Electro Optical
Sampling (EOS) for laser-solid matter interactions, the other one based on
Optical Transition Radiation (OTR) for single shot measurements of the
transverse emittance of plasma accelerated electron beams, both developed at
the SPARC_LAB Test Facility.
| physics.plasm-ph physics.acc-ph | plasma wakefield acceleration is the most promising acceleration technique for compact and cheap accelerators thanks to the high accelerating gradients achievable nevertheless this approach still suffers of shottoshot instabilities mostly related to experimental parameters fluctuations therefore the use of single shot diagnostics is needed to properly understand the acceleration mechanism in this work we present two diagnostics to probe electron beams from laserplasma interactions one relying on electro optical sampling eos for lasersolid matter interactions the other one based on optical transition radiation otr for single shot measurements of the transverse emittance of plasma accelerated electron beams both developed at the sparc_lab test facility | [['plasma', 'wakefield', 'acceleration', 'is', 'the', 'most', 'promising', 'acceleration', 'technique', 'for', 'compact', 'and', 'cheap', 'accelerators', 'thanks', 'to', 'the', 'high', 'accelerating', 'gradients', 'achievable', 'nevertheless', 'this', 'approach', 'still', 'suffers', 'of', 'shottoshot', 'instabilities', 'mostly', 'related', 'to', 'experimental', 'parameters', 'fluctuations', 'therefore', 'the', 'use', 'of', 'single', 'shot', 'diagnostics', 'is', 'needed', 'to', 'properly', 'understand', 'the', 'acceleration', 'mechanism', 'in', 'this', 'work', 'we', 'present', 'two', 'diagnostics', 'to', 'probe', 'electron', 'beams', 'from', 'laserplasma', 'interactions', 'one', 'relying', 'on', 'electro', 'optical', 'sampling', 'eos', 'for', 'lasersolid', 'matter', 'interactions', 'the', 'other', 'one', 'based', 'on', 'optical', 'transition', 'radiation', 'otr', 'for', 'single', 'shot', 'measurements', 'of', 'the', 'transverse', 'emittance', 'of', 'plasma', 'accelerated', 'electron', 'beams', 'both', 'developed', 'at', 'the', 'sparc_lab', 'test', 'facility']] | [-0.06806241089585595, 0.2059733561025216, -0.0928853910266368, 0.09871502377959238, -0.06021958940590803, -0.18381808499375787, -0.022170548647409305, 0.42103160667018247, -0.23524622416880447, -0.30180169604360485, 0.031507765362710834, -0.25755756919702083, 0.028740953761511125, 0.2815344051744502, 0.0013526947094270815, 0.07168736435638633, 0.03708908260943225, -0.06976075776709387, 0.004653087563033646, -0.15792498196690127, 0.26518545713490593, 0.19609592319466174, 0.34800750653868395, 0.0893236431830491, 0.14828360036391622, -0.01156358212588552, -0.01539563573896885, -0.04278131922742782, -0.10001626070180254, 0.07624596621798656, 0.2112218455877155, 0.06716588139422058, 0.26298211902702373, -0.474615189855775, -0.253569271406517, 0.05817680822936101, 0.15565213633593744, 0.12464365334017202, -0.14994195481771244, -0.1935834728870899, -0.029036154361585013, -0.16531106440099672, -0.14066137697619313, -0.07179959680741796, -0.0595531498413318, 0.06979851531258856, -0.28639486846693146, 0.05715491528658626, -0.023624928786795445, 0.0013483614893630147, -0.025956906855124265, -0.05353429721435532, 0.08127198675748122, 0.023500630128322743, 0.033957364194345876, 0.09465177771366703, 0.2241362926344244, -0.16504557491190588, -0.09880254254676402, 0.40127804147330326, -0.025263889309896443, -0.1307875351407207, 0.21913476260781933, -0.2282762086341301, -0.10237345821671905, 0.1704286226662449, 0.19093772996431932, 0.1091878755340496, -0.16752239140175965, -0.01461267800578543, 0.09735367278447554, 0.14229411786296764, 0.09943004861438218, 0.06618150695262906, 0.23575344334284848, 0.2189561577889925, 0.019319571868086662, 0.08345521399986375, -0.15500793245603114, 0.0004510647491910137, -0.27241229924682275, -0.07194110378175257, -0.17319154986090815, 0.003925375686916455, -0.026985660013871475, -0.1370458808602192, 0.40474629787226707, 0.22385528608440206, 0.09152810683008283, -0.10052531935686532, 0.43186121645759645, 0.06269122542737303, 0.02934990122090452, 0.050429664884667054, 0.3173405548665099, 0.14177884394302964, 0.14690870378847018, -0.275013951215302, 0.019743970057998713, 0.03594479884934397] |
1,802.03254 | Triplet-based Deep Similarity Learning for Person Re-Identification | In recent years, person re-identification (re-id) catches great attention in
both computer vision community and industry. In this paper, we propose a new
framework for person re-identification with a triplet-based deep similarity
learning using convolutional neural networks (CNNs). The network is trained
with triplet input: two of them have the same class labels and the other one is
different. It aims to learn the deep feature representation, with which the
distance within the same class is decreased, while the distance between the
different classes is increased as much as possible. Moreover, we trained the
model jointly on six different datasets, which differs from common practice -
one model is just trained on one dataset and tested also on the same one.
However, the enormous number of possible triplet data among the large number of
training samples makes the training impossible. To address this challenge, a
double-sampling scheme is proposed to generate triplets of images as effective
as possible. The proposed framework is evaluated on several benchmark datasets.
The experimental results show that, our method is effective for the task of
person re-identification and it is comparable or even outperforms the
state-of-the-art methods.
| cs.CV | in recent years person reidentification reid catches great attention in both computer vision community and industry in this paper we propose a new framework for person reidentification with a tripletbased deep similarity learning using convolutional neural networks cnns the network is trained with triplet input two of them have the same class labels and the other one is different it aims to learn the deep feature representation with which the distance within the same class is decreased while the distance between the different classes is increased as much as possible moreover we trained the model jointly on six different datasets which differs from common practice one model is just trained on one dataset and tested also on the same one however the enormous number of possible triplet data among the large number of training samples makes the training impossible to address this challenge a doublesampling scheme is proposed to generate triplets of images as effective as possible the proposed framework is evaluated on several benchmark datasets the experimental results show that our method is effective for the task of person reidentification and it is comparable or even outperforms the stateoftheart methods | [['in', 'recent', 'years', 'person', 'reidentification', 'reid', 'catches', 'great', 'attention', 'in', 'both', 'computer', 'vision', 'community', 'and', 'industry', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'framework', 'for', 'person', 'reidentification', 'with', 'a', 'tripletbased', 'deep', 'similarity', 'learning', 'using', 'convolutional', 'neural', 'networks', 'cnns', 'the', 'network', 'is', 'trained', 'with', 'triplet', 'input', 'two', 'of', 'them', 'have', 'the', 'same', 'class', 'labels', 'and', 'the', 'other', 'one', 'is', 'different', 'it', 'aims', 'to', 'learn', 'the', 'deep', 'feature', 'representation', 'with', 'which', 'the', 'distance', 'within', 'the', 'same', 'class', 'is', 'decreased', 'while', 'the', 'distance', 'between', 'the', 'different', 'classes', 'is', 'increased', 'as', 'much', 'as', 'possible', 'moreover', 'we', 'trained', 'the', 'model', 'jointly', 'on', 'six', 'different', 'datasets', 'which', 'differs', 'from', 'common', 'practice', 'one', 'model', 'is', 'just', 'trained', 'on', 'one', 'dataset', 'and', 'tested', 'also', 'on', 'the', 'same', 'one', 'however', 'the', 'enormous', 'number', 'of', 'possible', 'triplet', 'data', 'among', 'the', 'large', 'number', 'of', 'training', 'samples', 'makes', 'the', 'training', 'impossible', 'to', 'address', 'this', 'challenge', 'a', 'doublesampling', 'scheme', 'is', 'proposed', 'to', 'generate', 'triplets', 'of', 'images', 'as', 'effective', 'as', 'possible', 'the', 'proposed', 'framework', 'is', 'evaluated', 'on', 'several', 'benchmark', 'datasets', 'the', 'experimental', 'results', 'show', 'that', 'our', 'method', 'is', 'effective', 'for', 'the', 'task', 'of', 'person', 'reidentification', 'and', 'it', 'is', 'comparable', 'or', 'even', 'outperforms', 'the', 'stateoftheart', 'methods']] | [-0.03015567050683067, -0.0017424153360097031, -0.0319116197832811, 0.07703905608688824, -0.10664508674097689, -0.21346740047447382, -0.007715305245801574, 0.44450958496645876, -0.2505598947748934, -0.37339870978734996, 0.0569274153511383, -0.29666064108574863, -0.17686981330380627, 0.20882288339167931, -0.118173884072243, 0.07880915780796817, 0.14658122295268664, 0.09440551554097941, -0.05645865746375516, -0.33714132017799114, 0.33589323034975677, 0.008649282362986063, 0.3825297874790665, 0.03117185702155295, 0.1461773994703483, -0.06004413456754073, -0.018785232770575307, -0.0028200002923289215, -0.010366911399614764, 0.17725689262886973, 0.30365372359090925, 0.1917253656753976, 0.33719415522768703, -0.36897882326064924, -0.22409876392860162, 0.11672370907066291, 0.11974839548531331, 0.14131851525085756, -0.015539597232188833, -0.33873140082547537, 0.08889133780949603, -0.17328407788453135, 0.018976250724670917, -0.09208757230141935, 0.01132799664230429, -0.060374345337530895, -0.2655110397572188, 0.013912576823771049, 0.03308670351091821, 0.03798741156137303, -0.027514773841310097, -0.13673066202134482, 0.01610330462235173, 0.201020138738922, 0.09197881479049101, 0.0869219889888834, 0.09558444816104479, -0.20385055010494973, -0.10737927983711032, 0.37768432052904055, -0.07171768366212124, -0.168535395401628, 0.23346667044649, -0.023269589095817583, -0.14194980087493989, 0.07888682740127766, 0.20284045917521182, 0.15320495140836818, -0.16891671955389412, 0.004810895805100077, -0.11323492760573955, 0.16079607304234647, 0.03905211951902234, -0.020991747398664686, 0.17169595145510116, 0.2815137807230808, 0.029722117082411913, 0.12430774099836861, -0.17384461240343577, -0.08490022069829713, -0.1968158610060958, -0.0837252978823687, -0.24076045592756648, -0.04728318730638804, -0.09057045934053971, -0.11276425847662674, 0.43553311662496863, 0.2594961702112893, 0.2202412723245001, 0.0961142092612327, 0.3420603225105687, 0.002425321152948431, 0.18031635220701758, 0.0789314863734609, 0.2195664261467755, -0.007905877092363019, 0.10095858353704802, -0.16473761163284315, 0.08825389020769905, 0.04431530794375392] |
1,802.03255 | A universal-algebraic proof of the complexity dichotomy for Monotone
Monadic SNP | The logic MMSNP is a restricted fragment of existential second-order logic
which allows to express many interesting queries in graph theory and finite
model theory. The logic was introduced by Feder and Vardi who showed that every
MMSNP sentence is computationally equivalent to a finite-domain constraint
satisfaction problem (CSP); the involved probabilistic reductions were
derandomized by Kun using explicit constructions of expander structures. We
present a new proof of the reduction to finite-domain CSPs which does not rely
on the results of Kun. This new proof allows us to obtain a stronger statement
and to verify the more general Bodirsky-Pinsker dichotomy conjecture for CSPs
in MMSNP. Our approach uses the fact that every MMSNP sentence describes a
finite union of CSPs for countably infinite $\omega$-categorical structures;
moreover, by a recent result of Hubi\v{c}ka and Ne\v{s}et\v{r}il, these
structures can be expanded to homogeneous structures with finite relational
signature and the Ramsey property. This allows us to use the
universal-algebraic approach to study the computational complexity of MMSNP.
| cs.CC cs.LO math.LO | the logic mmsnp is a restricted fragment of existential secondorder logic which allows to express many interesting queries in graph theory and finite model theory the logic was introduced by feder and vardi who showed that every mmsnp sentence is computationally equivalent to a finitedomain constraint satisfaction problem csp the involved probabilistic reductions were derandomized by kun using explicit constructions of expander structures we present a new proof of the reduction to finitedomain csps which does not rely on the results of kun this new proof allows us to obtain a stronger statement and to verify the more general bodirskypinsker dichotomy conjecture for csps in mmsnp our approach uses the fact that every mmsnp sentence describes a finite union of csps for countably infinite omegacategorical structures moreover by a recent result of hubivcka and nevsetvril these structures can be expanded to homogeneous structures with finite relational signature and the ramsey property this allows us to use the universalalgebraic approach to study the computational complexity of mmsnp | [['the', 'logic', 'mmsnp', 'is', 'a', 'restricted', 'fragment', 'of', 'existential', 'secondorder', 'logic', 'which', 'allows', 'to', 'express', 'many', 'interesting', 'queries', 'in', 'graph', 'theory', 'and', 'finite', 'model', 'theory', 'the', 'logic', 'was', 'introduced', 'by', 'feder', 'and', 'vardi', 'who', 'showed', 'that', 'every', 'mmsnp', 'sentence', 'is', 'computationally', 'equivalent', 'to', 'a', 'finitedomain', 'constraint', 'satisfaction', 'problem', 'csp', 'the', 'involved', 'probabilistic', 'reductions', 'were', 'derandomized', 'by', 'kun', 'using', 'explicit', 'constructions', 'of', 'expander', 'structures', 'we', 'present', 'a', 'new', 'proof', 'of', 'the', 'reduction', 'to', 'finitedomain', 'csps', 'which', 'does', 'not', 'rely', 'on', 'the', 'results', 'of', 'kun', 'this', 'new', 'proof', 'allows', 'us', 'to', 'obtain', 'a', 'stronger', 'statement', 'and', 'to', 'verify', 'the', 'more', 'general', 'bodirskypinsker', 'dichotomy', 'conjecture', 'for', 'csps', 'in', 'mmsnp', 'our', 'approach', 'uses', 'the', 'fact', 'that', 'every', 'mmsnp', 'sentence', 'describes', 'a', 'finite', 'union', 'of', 'csps', 'for', 'countably', 'infinite', 'omegacategorical', 'structures', 'moreover', 'by', 'a', 'recent', 'result', 'of', 'hubivcka', 'and', 'nevsetvril', 'these', 'structures', 'can', 'be', 'expanded', 'to', 'homogeneous', 'structures', 'with', 'finite', 'relational', 'signature', 'and', 'the', 'ramsey', 'property', 'this', 'allows', 'us', 'to', 'use', 'the', 'universalalgebraic', 'approach', 'to', 'study', 'the', 'computational', 'complexity', 'of', 'mmsnp']] | [-0.10207237782112012, 0.04077147514926213, -0.12264074700069613, 0.1287807608249061, -0.17703321993802534, -0.15965576384315325, 0.09856353899830896, 0.32039711757591277, -0.2945236426975691, -0.3164523674034034, 0.062443449207101806, -0.21827527843159977, -0.13019946711984548, 0.18513102601987846, -0.15275147946156337, 0.07136101604749759, 0.04811166965148666, 0.008854821784718131, -0.024459142175813516, -0.2958372359737316, 0.2884545126139666, -0.0030512137790069437, 0.24614530662356904, 0.08696815643008009, 0.08958232576648394, 0.06095191613686356, -0.011902160392227497, 0.07024058665953238, -0.13569517908238624, 0.17963841057904628, 0.3229337622990098, 0.21862342469464763, 0.2818132787491336, -0.40619090992329415, -0.166140496709638, 0.10338017028248446, 0.07855921076667129, 0.1237746069645227, 0.013568426850939763, -0.28966858926031624, 0.12619202124575774, -0.1868835837213379, -0.06483118735874692, -0.1030026749672481, 0.04133316021532554, 0.00077048747687403, -0.25130977173702734, -0.015161455913700841, 0.20063855619254437, 0.021167488069499307, -0.01352403399809687, -0.06175528406853449, 0.03605483634482053, 0.03974143982949582, -0.04652415987626283, 0.03145458391077365, 0.017709744842299684, -0.04094042398995071, -0.20270985539113595, 0.3673984169113365, -0.02197590566268473, -0.1675221511247483, 0.16713815461561987, -0.08196016589574742, -0.23768973364353632, 0.11893234573600983, 0.09333806088702246, 0.14305765721946956, -0.10817722730253908, 0.16776522287753212, -0.1431396988418066, 0.20731464695100757, 0.13181616811815536, 0.001971657003036164, 0.10082638648261005, 0.12923215505469476, 0.08049831691190995, 0.19362572153931426, 0.08334442555876166, -0.07245471695381583, -0.2536017467070258, -0.1323943535740854, -0.12638580086923232, 0.036215090437062, -0.09128647558629216, -0.20885601366277445, 0.3568480087726405, 0.14973309682682157, 0.10810538740161892, 0.18142465740922048, 0.23788686241305462, 0.09357103106625746, 0.09099417897082414, 0.062270382577271174, 0.11737820576827014, 0.19779193699359893, 0.06605213133505348, -0.13306027595800432, 0.1016393846627607, 0.1542201887237642] |
1,802.03256 | Antiferromagnetic ground state in the MnGa$_4$ intermetallic compound | Magnetism of the binary intermetallic compound MnGa$_4$ is re-investigated.
Band-structure calculations predict antiferromagnetic behavior in contrast to
Pauli paramagnetism reported previously. Magnetic susceptibility measurements
on single crystals indeed reveal an antiferromagnetic transition at $T_N=393$
K. Neutron powder diffraction and $^{69,71}$Ga nuclear quadrupole resonance
spectroscopy show collinear antiferromagnetic order with magnetic moments
alligned along the [111] direction of the cubic unit cell. The magnetic moment
of 0.80(3)$\mu_B$ at 1.5 K extracted from the neutron data is in good agreement
with the band-structure results.
| cond-mat.mtrl-sci | magnetism of the binary intermetallic compound mnga_4 is reinvestigated bandstructure calculations predict antiferromagnetic behavior in contrast to pauli paramagnetism reported previously magnetic susceptibility measurements on single crystals indeed reveal an antiferromagnetic transition at t_n393 k neutron powder diffraction and 6971ga nuclear quadrupole resonance spectroscopy show collinear antiferromagnetic order with magnetic moments alligned along the 111 direction of the cubic unit cell the magnetic moment of 0803mu_b at 15 k extracted from the neutron data is in good agreement with the bandstructure results | [['magnetism', 'of', 'the', 'binary', 'intermetallic', 'compound', 'mnga_4', 'is', 'reinvestigated', 'bandstructure', 'calculations', 'predict', 'antiferromagnetic', 'behavior', 'in', 'contrast', 'to', 'pauli', 'paramagnetism', 'reported', 'previously', 'magnetic', 'susceptibility', 'measurements', 'on', 'single', 'crystals', 'indeed', 'reveal', 'an', 'antiferromagnetic', 'transition', 'at', 't_n393', 'k', 'neutron', 'powder', 'diffraction', 'and', '6971ga', 'nuclear', 'quadrupole', 'resonance', 'spectroscopy', 'show', 'collinear', 'antiferromagnetic', 'order', 'with', 'magnetic', 'moments', 'alligned', 'along', 'the', '111', 'direction', 'of', 'the', 'cubic', 'unit', 'cell', 'the', 'magnetic', 'moment', 'of', '0803mu_b', 'at', '15', 'k', 'extracted', 'from', 'the', 'neutron', 'data', 'is', 'in', 'good', 'agreement', 'with', 'the', 'bandstructure', 'results']] | [-0.17452450895304733, 0.21317122662252058, -0.0035953319784772547, 0.008138318157082871, -0.07228516145974775, -0.07709279812023609, 0.11284481991403678, 0.41685508323621145, -0.23718048866743904, -0.3062449365241241, -0.06194997664034084, -0.44291462423869327, -0.04455065673004977, 0.16688736794292455, 0.15768506686804415, 0.025536770261883075, -0.012432903847126643, 0.07992430705329569, -0.16856923062778725, -0.20436229906809336, 0.23312939117556508, 0.039393030236699156, 0.30493104212646244, 0.056983221867534364, 0.015485689198727944, 0.05936725655146226, 0.19030238180480238, 0.0022395408087516134, -0.1681091530790812, 0.005842836470567161, 0.2799149349190389, -0.1573885008633797, 0.07194603794501929, -0.4362512676964832, -0.19427186856635764, -0.06763881636205825, 0.09647921745111293, 0.1033740346261029, -0.10601276556130121, -0.26869672521082333, 0.06827634200453758, -0.09544591210735372, -0.1352947755455912, -0.1836710280055015, -0.10631126384368708, 0.006180367662418115, -0.28588948436552963, 0.14204725032507243, 0.07290728253465664, 0.18789463673187404, -0.17109790413133516, -0.21508313595358566, -0.02073491098288494, -0.01715311728700807, 0.0717107916687014, 0.15923737833582902, 0.1473788515358126, -0.029033419880220266, -0.15719544078235195, 0.3503131901703869, -0.013922592601444147, 0.020216750647118198, 0.06631642194535536, -0.3452615746874598, -0.14396106054464095, 0.23342974996783689, 0.06578101558445752, 0.09480250530133519, -0.15613055591695482, 0.05002824100002623, -0.024923175667660145, 0.2335855931373714, 0.06007089881709765, 0.021319030573988727, 0.26780115306868124, 0.17560468516253594, -0.05855866067724515, 0.13075754745816223, -0.21057294052436099, -0.04006500726070585, -0.1524616405603629, -0.11166078736710869, -0.2613346984704273, 0.05841741719153486, -0.1264418029663657, -0.16864699019189877, 0.2889525145056504, 0.09449881580481424, 0.1472672505563573, -0.12087875707192888, 0.22199207534600945, 0.022986970215599655, 0.0776577204689855, 0.007989549956319831, 0.26135011883806203, 0.2982971559048784, 0.16405897688038082, -0.3575112840272722, 0.10483210515584561, -0.02493505510560508] |
1,802.03257 | Video Event Recognition and Anomaly Detection by Combining Gaussian
Process and Hierarchical Dirichlet Process Models | In this paper, we present an unsupervised learning framework for analyzing
activities and interactions in surveillance videos. In our framework, three
levels of video events are connected by Hierarchical Dirichlet Process (HDP)
model: low-level visual features, simple atomic activities, and multi-agent
interactions. Atomic activities are represented as distribution of low-level
features, while complicated interactions are represented as distribution of
atomic activities. This learning process is unsupervised. Given a training
video sequence, low-level visual features are extracted based on optic flow and
then clustered into different atomic activities and video clips are clustered
into different interactions. The HDP model automatically decide the number of
clusters, i.e. the categories of atomic activities and interactions. Based on
the learned atomic activities and interactions, a training dataset is generated
to train the Gaussian Process (GP) classifier. Then the trained GP models work
in newly captured video to classify interactions and detect abnormal events in
real time. Furthermore, the temporal dependencies between video events learned
by HDP-Hidden Markov Models (HMM) are effectively integrated into GP classifier
to enhance the accuracy of the classification in newly captured videos. Our
framework couples the benefits of the generative model (HDP) with the
discriminant model (GP). We provide detailed experiments showing that our
framework enjoys favorable performance in video event classification in
real-time in a crowded traffic scene.
| cs.CV | in this paper we present an unsupervised learning framework for analyzing activities and interactions in surveillance videos in our framework three levels of video events are connected by hierarchical dirichlet process hdp model lowlevel visual features simple atomic activities and multiagent interactions atomic activities are represented as distribution of lowlevel features while complicated interactions are represented as distribution of atomic activities this learning process is unsupervised given a training video sequence lowlevel visual features are extracted based on optic flow and then clustered into different atomic activities and video clips are clustered into different interactions the hdp model automatically decide the number of clusters ie the categories of atomic activities and interactions based on the learned atomic activities and interactions a training dataset is generated to train the gaussian process gp classifier then the trained gp models work in newly captured video to classify interactions and detect abnormal events in real time furthermore the temporal dependencies between video events learned by hdphidden markov models hmm are effectively integrated into gp classifier to enhance the accuracy of the classification in newly captured videos our framework couples the benefits of the generative model hdp with the discriminant model gp we provide detailed experiments showing that our framework enjoys favorable performance in video event classification in realtime in a crowded traffic scene | [['in', 'this', 'paper', 'we', 'present', 'an', 'unsupervised', 'learning', 'framework', 'for', 'analyzing', 'activities', 'and', 'interactions', 'in', 'surveillance', 'videos', 'in', 'our', 'framework', 'three', 'levels', 'of', 'video', 'events', 'are', 'connected', 'by', 'hierarchical', 'dirichlet', 'process', 'hdp', 'model', 'lowlevel', 'visual', 'features', 'simple', 'atomic', 'activities', 'and', 'multiagent', 'interactions', 'atomic', 'activities', 'are', 'represented', 'as', 'distribution', 'of', 'lowlevel', 'features', 'while', 'complicated', 'interactions', 'are', 'represented', 'as', 'distribution', 'of', 'atomic', 'activities', 'this', 'learning', 'process', 'is', 'unsupervised', 'given', 'a', 'training', 'video', 'sequence', 'lowlevel', 'visual', 'features', 'are', 'extracted', 'based', 'on', 'optic', 'flow', 'and', 'then', 'clustered', 'into', 'different', 'atomic', 'activities', 'and', 'video', 'clips', 'are', 'clustered', 'into', 'different', 'interactions', 'the', 'hdp', 'model', 'automatically', 'decide', 'the', 'number', 'of', 'clusters', 'ie', 'the', 'categories', 'of', 'atomic', 'activities', 'and', 'interactions', 'based', 'on', 'the', 'learned', 'atomic', 'activities', 'and', 'interactions', 'a', 'training', 'dataset', 'is', 'generated', 'to', 'train', 'the', 'gaussian', 'process', 'gp', 'classifier', 'then', 'the', 'trained', 'gp', 'models', 'work', 'in', 'newly', 'captured', 'video', 'to', 'classify', 'interactions', 'and', 'detect', 'abnormal', 'events', 'in', 'real', 'time', 'furthermore', 'the', 'temporal', 'dependencies', 'between', 'video', 'events', 'learned', 'by', 'hdphidden', 'markov', 'models', 'hmm', 'are', 'effectively', 'integrated', 'into', 'gp', 'classifier', 'to', 'enhance', 'the', 'accuracy', 'of', 'the', 'classification', 'in', 'newly', 'captured', 'videos', 'our', 'framework', 'couples', 'the', 'benefits', 'of', 'the', 'generative', 'model', 'hdp', 'with', 'the', 'discriminant', 'model', 'gp', 'we', 'provide', 'detailed', 'experiments', 'showing', 'that', 'our', 'framework', 'enjoys', 'favorable', 'performance', 'in', 'video', 'event', 'classification', 'in', 'realtime', 'in', 'a', 'crowded', 'traffic', 'scene']] | [-0.051651226996509314, 0.05592280059446497, -0.07919343525769164, 0.10539716939265334, -0.08756230844060865, -0.14945216682619936, 0.007809711862654519, 0.483379169375798, -0.29381668702015706, -0.33611224480656854, 0.02877813826876889, -0.30279536362429826, -0.17100730884837312, 0.1243570839911176, -0.09346353944440142, 0.03961371449826268, 0.13758780697463166, 0.0697976275372005, 0.005696611941381947, -0.2779544576673572, 0.3030611271542762, 0.021147487975588634, 0.33727111112873215, -0.034474436620916794, 0.12860831873568304, -0.016330262530731773, -0.08119452402525403, -0.030912732596534792, -0.009455711395142508, 0.17153736935856906, 0.3531623988175285, 0.2022839278909762, 0.28567009414930683, -0.4436576286621323, -0.24771573547051723, 0.058058047942697595, 0.15825986494780134, 0.05691426652235325, -0.029044461172766163, -0.43305475406622124, 0.08127268080796124, -0.17103363411851363, 0.043584479909783244, -0.1409422156204461, -0.015988613996834176, 0.0285659244397779, -0.31098042039730406, 0.05480275076062102, 0.102133077503088, 0.10357446716820667, -0.09480160251558853, -0.036561558772852526, -0.004839111536040629, 0.1829379866147465, 0.020149040434679334, 0.022528377830995025, 0.19224193288064603, -0.20235165661423032, -0.14101211632465208, 0.3798501684027083, -0.05706882668624914, -0.18857679802095603, 0.21367292041428934, -0.022900022813033553, -0.156847295475218, 0.1307301557101651, 0.30143017910523423, 0.11705886149232131, -0.21333122057327575, -0.017831496684758606, -0.03545197729371625, 0.18533689758757455, 0.020550436516497454, -0.027912668896616873, 0.21678427063193548, 0.2967305380953561, -0.047762567653756485, 0.12208792737069958, -0.13324945644953998, -0.0990398640353489, -0.21859814604282926, -0.05885936971967442, -0.1611881853986976, -0.07944170579019455, -0.11540233547359528, -0.12396319295010538, 0.4113588749448162, 0.20681390061615668, 0.22809500468535981, 0.07794194586079466, 0.3263272786440345, 0.015690957514863938, 0.08172150880713529, 0.05386121582598725, 0.123750468423385, -0.01873372672467467, 0.10294071574366455, -0.14530400270457303, 0.09020998573503158, 0.0631976739285565] |
1,802.03258 | On the accuracy of mass measurement for microlensing black holes as seen
by Gaia and OGLE | We investigate the impact of combining Gaia astrometry from space with
precise, high cadence OGLE photometry from the ground. For the archival event
OGLE3-ULENS-PAR-02, which is likely a black hole, we simulate a realistic
astrometric time-series of Gaia measurements and combine it with the real
photometric data collected by the OGLE project. We predict that at the end of
the nominal 5 years of the Gaia mission, for the events brighter than
$G\approx15.5$ mag at the baseline, caused by objects heavier than 10
$M_{\odot}$, it will be possible to unambiguously derive masses of the lenses,
with accuracy between a few to 15 per cent. We find that fainter events
($G<17.5$) can still have their lens masses determined, provided that they are
heavier than 30 $M_{\odot}$. We estimate that the rate of astrometric
microlensing events caused by the stellar-origin black holes is $\approx 4
\times 10^{-7} \, \rm yr^{-1}$, which implies, that after 5 years of Gaia
operation and $\approx 5 \times 10^6$ bright sources in Gaia, it will be
possible to identify few such events in the Gaia final catalogues.
| astro-ph.SR astro-ph.GA | we investigate the impact of combining gaia astrometry from space with precise high cadence ogle photometry from the ground for the archival event ogle3ulenspar02 which is likely a black hole we simulate a realistic astrometric timeseries of gaia measurements and combine it with the real photometric data collected by the ogle project we predict that at the end of the nominal 5 years of the gaia mission for the events brighter than gapprox155 mag at the baseline caused by objects heavier than 10 m_odot it will be possible to unambiguously derive masses of the lenses with accuracy between a few to 15 per cent we find that fainter events g175 can still have their lens masses determined provided that they are heavier than 30 m_odot we estimate that the rate of astrometric microlensing events caused by the stellarorigin black holes is approx 4 times 107 rm yr1 which implies that after 5 years of gaia operation and approx 5 times 106 bright sources in gaia it will be possible to identify few such events in the gaia final catalogues | [['we', 'investigate', 'the', 'impact', 'of', 'combining', 'gaia', 'astrometry', 'from', 'space', 'with', 'precise', 'high', 'cadence', 'ogle', 'photometry', 'from', 'the', 'ground', 'for', 'the', 'archival', 'event', 'ogle3ulenspar02', 'which', 'is', 'likely', 'a', 'black', 'hole', 'we', 'simulate', 'a', 'realistic', 'astrometric', 'timeseries', 'of', 'gaia', 'measurements', 'and', 'combine', 'it', 'with', 'the', 'real', 'photometric', 'data', 'collected', 'by', 'the', 'ogle', 'project', 'we', 'predict', 'that', 'at', 'the', 'end', 'of', 'the', 'nominal', '5', 'years', 'of', 'the', 'gaia', 'mission', 'for', 'the', 'events', 'brighter', 'than', 'gapprox155', 'mag', 'at', 'the', 'baseline', 'caused', 'by', 'objects', 'heavier', 'than', '10', 'm_odot', 'it', 'will', 'be', 'possible', 'to', 'unambiguously', 'derive', 'masses', 'of', 'the', 'lenses', 'with', 'accuracy', 'between', 'a', 'few', 'to', '15', 'per', 'cent', 'we', 'find', 'that', 'fainter', 'events', 'g175', 'can', 'still', 'have', 'their', 'lens', 'masses', 'determined', 'provided', 'that', 'they', 'are', 'heavier', 'than', '30', 'm_odot', 'we', 'estimate', 'that', 'the', 'rate', 'of', 'astrometric', 'microlensing', 'events', 'caused', 'by', 'the', 'stellarorigin', 'black', 'holes', 'is', 'approx', '4', 'times', '107', 'rm', 'yr1', 'which', 'implies', 'that', 'after', '5', 'years', 'of', 'gaia', 'operation', 'and', 'approx', '5', 'times', '106', 'bright', 'sources', 'in', 'gaia', 'it', 'will', 'be', 'possible', 'to', 'identify', 'few', 'such', 'events', 'in', 'the', 'gaia', 'final', 'catalogues']] | [-0.0632654277935878, 0.151447283990406, -0.04004914526012726, 0.12032307706778572, -0.08153121639439963, -0.050070518932030114, 0.08420208736788481, 0.3953375133939765, -0.1570953536866, -0.43190441255203704, 0.11640343045291957, -0.39522098876345396, -0.0064388096818054855, 0.2614490526797123, -0.08323871306492947, 0.0034175752132961697, 0.1714440237860386, -0.034813745246289975, -0.09122688798974692, -0.3315040586034725, 0.22670996880730276, 0.0707974562114528, 0.11731460353356934, -0.08740239109664055, 0.09034883869422959, -0.08165236006607302, -0.0939121691017962, -0.03369738280906114, -0.16689078516393155, 0.03810543562874293, 0.22899815532103027, 0.18243958920621398, 0.21776535901219837, -0.34172981926663354, -0.14959330191645262, 0.08244746894012099, 0.1453762982882009, 0.050058123568967196, -0.0176881219495871, -0.33888809595108876, 0.15464938861921176, -0.23535413680524056, -0.17205590159177186, 0.01818124620132783, 0.11547692791183098, 0.0023761293427510695, -0.2225591968063699, 0.12732462953268128, -0.04432615929875861, 0.08733611940194598, -0.11198192791992122, -0.08011107992735395, -0.06846799355711979, 0.0774362943563822, 0.030238345654321496, 0.12405322879468175, 0.12104576083418744, -0.07697760477127634, -0.048181729528798976, 0.42238752227752807, -0.06406963327547353, 0.006167875528262812, 0.1469588553855746, -0.23637905841777948, -0.14579107832766816, 0.15637545332587746, 0.18853815989198416, 0.12524654642699964, -0.19938403895701579, -0.06037224562566156, 0.061135785761342216, 0.2535113266626881, 0.1046615045316602, 0.08277918369408739, 0.3161537147243507, 0.1636431507345564, 0.054341308281767524, 0.030483363091744566, -0.27794029232940043, 0.019298358814425723, -0.2522596095679381, -0.06908281219181266, -0.12232805609396151, 0.12430038284351626, -0.14849784180759426, -0.03630994961151208, 0.3280571789337872, 0.2039211870287545, 0.1911873161324448, 0.038170295559790575, 0.3017929948358745, 0.044174743693888144, 0.12634330127250656, 0.07326258749724895, 0.3852476505774327, 0.06998326038989365, 0.08373959492043716, -0.12403392955324803, 0.03244820798069916, -0.027733187168699013] |
1,802.03259 | Optimal data fitting: a moment approach | We propose a moment relaxation for two problems, the separation and covering
problem with semi-algebraic sets generated by a polynomial of degree d. We show
that (a) the optimal value of the relaxation finitely converges to the optimal
value of the original problem, when the moment order r increases and (b) after
performing some small perturbation of the original problem, convergence can be
achieved with r=d. We further provide a practical iterative algorithm that is
computationally tractable for large datasets and present encouraging
computational results.
| math.OC | we propose a moment relaxation for two problems the separation and covering problem with semialgebraic sets generated by a polynomial of degree d we show that a the optimal value of the relaxation finitely converges to the optimal value of the original problem when the moment order r increases and b after performing some small perturbation of the original problem convergence can be achieved with rd we further provide a practical iterative algorithm that is computationally tractable for large datasets and present encouraging computational results | [['we', 'propose', 'a', 'moment', 'relaxation', 'for', 'two', 'problems', 'the', 'separation', 'and', 'covering', 'problem', 'with', 'semialgebraic', 'sets', 'generated', 'by', 'a', 'polynomial', 'of', 'degree', 'd', 'we', 'show', 'that', 'a', 'the', 'optimal', 'value', 'of', 'the', 'relaxation', 'finitely', 'converges', 'to', 'the', 'optimal', 'value', 'of', 'the', 'original', 'problem', 'when', 'the', 'moment', 'order', 'r', 'increases', 'and', 'b', 'after', 'performing', 'some', 'small', 'perturbation', 'of', 'the', 'original', 'problem', 'convergence', 'can', 'be', 'achieved', 'with', 'rd', 'we', 'further', 'provide', 'a', 'practical', 'iterative', 'algorithm', 'that', 'is', 'computationally', 'tractable', 'for', 'large', 'datasets', 'and', 'present', 'encouraging', 'computational', 'results']] | [-0.12539860963383143, 0.05495474425637547, -0.0664580105968258, 0.03954941208118244, -0.054812858681030134, -0.13482131083660265, 0.0530618815066512, 0.36262648011393406, -0.34005827338379974, -0.2835356259937672, 0.1484864540562472, -0.24349713485468835, -0.13341914984014105, 0.19729877070469015, -0.0481234150883906, 0.10585831617388655, 0.1248600333737319, 0.021989155295373434, -0.10014383821912548, -0.3189109749215491, 0.2817514267476166, 0.0071264746653683046, 0.21930624454775277, 0.06758887925568749, 0.13161389852928765, -0.01239021102185635, 0.03657977616359644, 0.10036417033304186, -0.1391995557510253, 0.14704106177942938, 0.256207686827025, 0.1829194119090543, 0.34217426334233847, -0.3745143840637277, -0.12022071225459084, 0.12679978615385207, 0.13138123549356617, 0.10444140566995723, -0.05429911524714792, -0.23237797622294987, 0.14158941300257163, -0.10160092742007691, -0.1131083765779348, -0.11505907779449925, 0.035822834326502156, 0.006893883864669239, -0.3862181962317075, 0.08981609197662158, 0.06729231858694487, 0.030765015588087193, -0.028902020842275198, -0.16144648544928608, 0.07144842796465929, 0.07560928463833133, 0.05434491795159, 0.06279966120115098, 0.08159629295525306, -0.08475912632968496, -0.11444220464567051, 0.3737080267027897, -0.05571688176954494, -0.22381906112765565, 0.1393628551515148, -0.11211204654263222, -0.13165441953255247, 0.15590052098474083, 0.16012766803888714, 0.171188591264517, -0.08820630071414223, 0.1265356063219609, -0.07754620470325736, 0.15962832424351397, 0.04776907129322781, -0.02449436979916166, 0.1184363021131824, 0.20317231262623167, 0.16290238582364777, 0.1970435778131051, -0.05685222588808221, -0.05670875203521813, -0.2883046820321504, -0.09647151192321497, -0.21499669657034032, 0.05133983783752603, -0.15086097139265964, -0.1205236903994399, 0.3883356433170026, 0.14955565451699146, 0.19696096302393604, 0.15394845710081212, 0.2894953944227275, 0.12928966466775713, -0.017638186850886355, 0.11503452843822101, 0.1825073165452683, 0.06848070862812593, 0.05939218662679195, -0.24669086803298662, 0.058949486845556426, 0.09074301222229705] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.