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.0586 | On the maximal number of real embeddings of spatial minimally rigid
graphs | The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by
definition) finite, modulo rigid transformations, for every generic choice of
edge lengths. Even though various approaches have been proposed to compute it,
the gap between upper and lower bounds is still enormous. Specific values and
its asymptotic behavior are major and fascinating open problems in rigidity
theory. Our work considers the maximal number of real embeddings of minimally
rigid graphs in $\mathbb{R}^3$. We modify a commonly used parametric
semi-algebraic formulation that exploits the Cayley-Menger determinant to
minimize the {\em a priori} number of complex embeddings, where the parameters
correspond to edge lengths. To cope with the huge dimension of the parameter
space and find specializations of the parameters that maximize the number of
real embeddings, we introduce a method based on coupler curves that makes the
sampling feasible for spatial minimally rigid graphs.
Our methodology results in the first full classification of the number of
real embeddings of graphs with 7 vertices in $\mathbb{R}^3$, which was the
smallest open case. Building on this and certain 8-vertex graphs, we improve
the previously known general lower bound on the maximum number of real
embeddings in $\mathbb{R}^3$.
| math.AG math.CO | the number of embeddings of minimally rigid graphs in mathbbrd is by definition finite modulo rigid transformations for every generic choice of edge lengths even though various approaches have been proposed to compute it the gap between upper and lower bounds is still enormous specific values and its asymptotic behavior are major and fascinating open problems in rigidity theory our work considers the maximal number of real embeddings of minimally rigid graphs in mathbbr3 we modify a commonly used parametric semialgebraic formulation that exploits the cayleymenger determinant to minimize the em a priori number of complex embeddings where the parameters correspond to edge lengths to cope with the huge dimension of the parameter space and find specializations of the parameters that maximize the number of real embeddings we introduce a method based on coupler curves that makes the sampling feasible for spatial minimally rigid graphs our methodology results in the first full classification of the number of real embeddings of graphs with 7 vertices in mathbbr3 which was the smallest open case building on this and certain 8vertex graphs we improve the previously known general lower bound on the maximum number of real embeddings in mathbbr3 | [['the', 'number', 'of', 'embeddings', 'of', 'minimally', 'rigid', 'graphs', 'in', 'mathbbrd', 'is', 'by', 'definition', 'finite', 'modulo', 'rigid', 'transformations', 'for', 'every', 'generic', 'choice', 'of', 'edge', 'lengths', 'even', 'though', 'various', 'approaches', 'have', 'been', 'proposed', 'to', 'compute', 'it', 'the', 'gap', 'between', 'upper', 'and', 'lower', 'bounds', 'is', 'still', 'enormous', 'specific', 'values', 'and', 'its', 'asymptotic', 'behavior', 'are', 'major', 'and', 'fascinating', 'open', 'problems', 'in', 'rigidity', 'theory', 'our', 'work', 'considers', 'the', 'maximal', 'number', 'of', 'real', 'embeddings', 'of', 'minimally', 'rigid', 'graphs', 'in', 'mathbbr3', 'we', 'modify', 'a', 'commonly', 'used', 'parametric', 'semialgebraic', 'formulation', 'that', 'exploits', 'the', 'cayleymenger', 'determinant', 'to', 'minimize', 'the', 'em', 'a', 'priori', 'number', 'of', 'complex', 'embeddings', 'where', 'the', 'parameters', 'correspond', 'to', 'edge', 'lengths', 'to', 'cope', 'with', 'the', 'huge', 'dimension', 'of', 'the', 'parameter', 'space', 'and', 'find', 'specializations', 'of', 'the', 'parameters', 'that', 'maximize', 'the', 'number', 'of', 'real', 'embeddings', 'we', 'introduce', 'a', 'method', 'based', 'on', 'coupler', 'curves', 'that', 'makes', 'the', 'sampling', 'feasible', 'for', 'spatial', 'minimally', 'rigid', 'graphs', 'our', 'methodology', 'results', 'in', 'the', 'first', 'full', 'classification', 'of', 'the', 'number', 'of', 'real', 'embeddings', 'of', 'graphs', 'with', '7', 'vertices', 'in', 'mathbbr3', 'which', 'was', 'the', 'smallest', 'open', 'case', 'building', 'on', 'this', 'and', 'certain', '8vertex', 'graphs', 'we', 'improve', 'the', 'previously', 'known', 'general', 'lower', 'bound', 'on', 'the', 'maximum', 'number', 'of', 'real', 'embeddings', 'in', 'mathbbr3']] | [-0.1334077509961148, 0.1075377204124008, -0.015059397634289855, 0.05055032965396911, -0.11792049759390708, -0.11537517859524458, 0.02274851298983665, 0.35942434540436585, -0.2508136749395873, -0.3404557810031942, 0.09552710727973822, -0.2822086093899775, -0.17811208576491408, 0.20806954620995236, -0.11855906194161471, 0.08770261523356881, 0.07343197860564961, 0.085610746724379, -0.05809166963563814, -0.283772684322499, 0.3271138833084961, -0.03353684179351798, 0.27363594356396864, 0.0720033668176442, 0.07885417814024401, 0.028960926838965173, -0.007068303751055987, 0.028939477177378388, -0.16903953723087806, 0.16538557367029894, 0.2466525176435481, 0.1300106864566297, 0.23615780556384397, -0.4015161614995438, -0.20149800758713818, 0.20211814471332792, 0.11480602591681029, 0.08345644805421197, 0.015121365337257216, -0.23598501455794296, 0.1109455585793345, -0.10593362356422051, -0.12317628361051902, -0.06446499275328706, 0.04268259992252807, 0.025706524489095852, -0.23739940565250509, -0.0009427183516779725, 0.07385673174843649, 0.049150688346678496, -0.04364975848133029, -0.11545056730392389, -0.007415200435741786, 0.12952921637131984, 0.01700666169065754, 0.030364312576035, 0.059787075309384596, -0.12532583219165513, -0.1333905776893739, 0.36167519349736704, -0.03578215619378096, -0.2673442051425215, 0.166280193718825, -0.12207731391939962, -0.1530146054633684, 0.12177354283393266, 0.18273756998515098, 0.15060963421081175, -0.09826578231224296, 0.14193190408636558, -0.09943700917938258, 0.1328588954674327, 0.099869838034335, 0.016148246260780402, 0.13035021113630915, 0.14282829838814404, 0.11117961406660247, 0.1695483883466258, -0.02283814490822676, -0.08284662727608669, -0.29594543213689967, -0.12771097264562647, -0.21679714408807685, 0.0156244455720298, -0.16931958259663923, -0.21343922131749496, 0.3939172698544785, 0.13143168931848628, 0.22857620846004967, 0.10371811015410254, 0.28464087968863244, 0.05720792772196119, 0.07407553317452951, 0.11249782763450045, 0.18496717341548327, 0.13581950415955732, -0.008356895825198414, -0.16522016189517263, 0.033507808141305814, 0.10646850217789487] |
1,802.05861 | Generalizing Bottleneck Problems | Given a pair of random variables $(X,Y)\sim P_{XY}$ and two convex functions
$f_1$ and $f_2$, we introduce two bottleneck functionals as the lower and upper
boundaries of the two-dimensional convex set that consists of the pairs
$\left(I_{f_1}(W; X), I_{f_2}(W; Y)\right)$, where $I_f$ denotes
$f$-information and $W$ varies over the set of all discrete random variables
satisfying the Markov condition $W \to X \to Y$. Applying Witsenhausen and
Wyner's approach, we provide an algorithm for computing boundaries of this set
for $f_1$, $f_2$, and discrete $P_{XY}$. In the binary symmetric case, we fully
characterize the set when (i) $f_1(t)=f_2(t)=t\log t$, (ii)
$f_1(t)=f_2(t)=t^2-1$, and (iii) $f_1$ and $f_2$ are both $\ell^\beta$ norm
function for $\beta \geq 2$. We then argue that upper and lower boundaries in
(i) correspond to Mrs. Gerber's Lemma and its inverse (which we call Mr.
Gerber's Lemma), in (ii) correspond to estimation-theoretic variants of
Information Bottleneck and Privacy Funnel, and in (iii) correspond to Arimoto
Information Bottleneck and Privacy Funnel.
| cs.IT cs.LG math.IT | given a pair of random variables xysim p_xy and two convex functions f_1 and f_2 we introduce two bottleneck functionals as the lower and upper boundaries of the twodimensional convex set that consists of the pairs lefti_f_1w x i_f_2w yright where i_f denotes finformation and w varies over the set of all discrete random variables satisfying the markov condition w to x to y applying witsenhausen and wyners approach we provide an algorithm for computing boundaries of this set for f_1 f_2 and discrete p_xy in the binary symmetric case we fully characterize the set when i f_1tf_2ttlog t ii f_1tf_2tt21 and iii f_1 and f_2 are both ellbeta norm function for beta geq 2 we then argue that upper and lower boundaries in i correspond to mrs gerbers lemma and its inverse which we call mr gerbers lemma in ii correspond to estimationtheoretic variants of information bottleneck and privacy funnel and in iii correspond to arimoto information bottleneck and privacy funnel | [['given', 'a', 'pair', 'of', 'random', 'variables', 'xysim', 'p_xy', 'and', 'two', 'convex', 'functions', 'f_1', 'and', 'f_2', 'we', 'introduce', 'two', 'bottleneck', 'functionals', 'as', 'the', 'lower', 'and', 'upper', 'boundaries', 'of', 'the', 'twodimensional', 'convex', 'set', 'that', 'consists', 'of', 'the', 'pairs', 'lefti_f_1w', 'x', 'i_f_2w', 'yright', 'where', 'i_f', 'denotes', 'finformation', 'and', 'w', 'varies', 'over', 'the', 'set', 'of', 'all', 'discrete', 'random', 'variables', 'satisfying', 'the', 'markov', 'condition', 'w', 'to', 'x', 'to', 'y', 'applying', 'witsenhausen', 'and', 'wyners', 'approach', 'we', 'provide', 'an', 'algorithm', 'for', 'computing', 'boundaries', 'of', 'this', 'set', 'for', 'f_1', 'f_2', 'and', 'discrete', 'p_xy', 'in', 'the', 'binary', 'symmetric', 'case', 'we', 'fully', 'characterize', 'the', 'set', 'when', 'i', 'f_1tf_2ttlog', 't', 'ii', 'f_1tf_2tt21', 'and', 'iii', 'f_1', 'and', 'f_2', 'are', 'both', 'ellbeta', 'norm', 'function', 'for', 'beta', 'geq', '2', 'we', 'then', 'argue', 'that', 'upper', 'and', 'lower', 'boundaries', 'in', 'i', 'correspond', 'to', 'mrs', 'gerbers', 'lemma', 'and', 'its', 'inverse', 'which', 'we', 'call', 'mr', 'gerbers', 'lemma', 'in', 'ii', 'correspond', 'to', 'estimationtheoretic', 'variants', 'of', 'information', 'bottleneck', 'and', 'privacy', 'funnel', 'and', 'in', 'iii', 'correspond', 'to', 'arimoto', 'information', 'bottleneck', 'and', 'privacy', 'funnel']] | [-0.13051112490676103, 0.0816709886373569, -0.01557404936850822, 0.07893713647124147, -0.03827727847852774, -0.17529252072375628, 0.09033545514929199, 0.37706965187624575, -0.3309245300238892, -0.23176697406677468, 0.08162340853483446, -0.2868922294958705, -0.10399664259504436, 0.17709926156507386, -0.0670986490384225, 0.033198167548529924, -0.0056920569029546555, 0.051340199428828316, -0.07813316082221365, -0.2495561198504161, 0.3386913805479004, -0.0928327674827268, 0.24653443080192852, 0.024007670479195733, 0.10080617243394015, 0.04203804238068481, -0.01018472641946808, -0.0170087288223928, -0.16755082298778073, 0.12760951676285795, 0.2461947356080336, 0.1857158382693606, 0.26903569747603706, -0.3553311625315297, -0.08264982896826921, 0.1471181896124636, 0.11903838090778839, -0.00692662916431624, 0.007366324319774586, -0.2313326998996819, 0.14011196827576045, -0.12128900083743276, -0.042342599939494845, -0.029860843648953785, 0.04215191607814162, 0.03934379577516548, -0.3763974673985954, 0.06635072262912628, 0.12231668926655284, 0.03986146399833923, -0.037816568023164666, -0.18172500124802032, -0.05878018742547401, 0.08428622609128304, -0.005378137625032856, 0.09173709889723648, 0.06923622260050427, -0.10259099808641739, -0.10814576051648586, 0.30150429413563784, -0.0653094379516739, -0.2383630053050095, 0.14761781224139756, -0.1574289116617893, -0.14364702247173314, 0.09457974722608924, 0.18143117012636314, 0.11938557812283115, -0.1130276210776027, 0.14930687368389278, -0.06992742028087377, 0.1067674879067307, 0.10483993739790974, 0.06117561037179023, 0.10735470442882468, 0.07322182477632116, 0.11393968441914167, 0.15433151674486936, -0.09444468192485792, -0.06155545324868252, -0.34159377070083735, -0.16794541412513822, -0.14657962076561226, 0.050519130790546055, -0.10349932982794745, -0.17402493284354287, 0.331065372648018, 0.08472532813827838, 0.22547487290275672, 0.08412765765697845, 0.20516120264787346, 0.11095933907237204, -0.007388503600152269, 0.14135782094672322, 0.09809293956045181, 0.15637539710639226, 0.012829177264094112, -0.15482473015004108, 0.048053542227153814, 0.105385339707737] |
1,802.05862 | Proceedings Fourth International Workshop on Rewriting Techniques for
Program Transformations and Evaluation | This volume contains the formal proceedings of the 4th International Workshop
on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2017),
held on 8th September 2017 in Oxford, United Kingdom, and affiliated with the
Second International Conference on Formal Structures for Computation and
Deduction (FSCD 2017).
| cs.LO cs.PL | this volume contains the formal proceedings of the 4th international workshop on rewriting techniques for program transformations and evaluation wpte 2017 held on 8th september 2017 in oxford united kingdom and affiliated with the second international conference on formal structures for computation and deduction fscd 2017 | [['this', 'volume', 'contains', 'the', 'formal', 'proceedings', 'of', 'the', '4th', 'international', 'workshop', 'on', 'rewriting', 'techniques', 'for', 'program', 'transformations', 'and', 'evaluation', 'wpte', '2017', 'held', 'on', '8th', 'september', '2017', 'in', 'oxford', 'united', 'kingdom', 'and', 'affiliated', 'with', 'the', 'second', 'international', 'conference', 'on', 'formal', 'structures', 'for', 'computation', 'and', 'deduction', 'fscd', '2017']] | [-0.0893026260452138, 0.02402416838514101, -0.10387272120763859, -0.03994465845171362, -0.12049002570824491, -4.098564386367798e-05, 0.044222905372993816, 0.21015662395705778, -0.1410672736354172, -0.453982250392437, 0.22623338257221298, -0.3834916003876262, -0.14413627882798513, 0.2108294935690032, -0.1563181928145544, 0.0016867757774889469, 0.1330467897726016, 0.02073482835872306, -0.030765924540658792, -0.4255691171934207, 0.22502082905007734, 0.16331347686549028, 0.36637117837866146, 0.08741993275988433, 0.13370172226180632, 0.09888856544469794, -0.22140281204548146, -0.07628727480769157, -0.05204351527823342, 0.19346627481281758, 0.3790898820799258, 0.1791113680952953, 0.2962509743869305, -0.43898529219958515, 0.02599667573554648, -0.06696633921625714, -0.1281321308679051, -0.034255105753739676, 0.051115399994887414, -0.38017280929618413, -0.12124605621728632, -0.2558743066257901, -0.026816420008738837, -0.0050560780490438145, 0.10832673566312426, -0.004015439790156152, -0.1160770126308004, 0.04067783419870668, 0.08070956145723661, 0.2627321723020739, -0.04204657897353172, -0.13805285820530522, -0.027766567453121147, 0.1334487770777034, -0.06633267595122258, 0.06726218110416085, 0.02790573584433231, -0.024154774378338413, -0.2507285090370311, 0.4168714513329582, -0.0676493637677696, 0.07836504878683223, 0.18955258186389173, -0.13751079282826847, -0.3220404500969582, 0.011993935962931978, 0.3876917472316159, 0.022693426912236546, -0.14440851519919104, 0.2191685342708499, 0.01962796151638031, 0.271132952057653, 0.20064926345108283, -0.11590186320245266, 0.22050191120555004, 0.16358466994845205, -0.01879339453039898, 0.0055094767866345744, 0.003042171807545755, -0.1607226487249136, -0.4400464345183637, -0.14895817453248633, -0.06540970160211954, -0.10743233166221115, 0.158076784388201, -0.1566314219807585, 0.3292407878778047, 0.07941785267450743, -0.006727844580180115, -0.01785433249961999, 0.19398909685098462, 0.044954132125712934, 0.04432114348229435, 0.13904331755927868, 0.21723697466206635, 0.05831541768792603, 0.2701518862404757, -0.10792724765746647, -0.019429548560745188, 0.2629729964459936] |
1,802.05863 | A Calculus for Modeling Floating Authorizations | Controlling resource usage in distributed systems is a challenging task given
the dynamics involved in access granting. Consider, for instance, the setting
of floating licenses where access can be granted if the request originates in a
licensed domain and the number of active users is within the license limits,
and where licenses can be interchanged. Access granting in such scenarios is
given in terms of floating authorizations, addressed in this paper as first
class entities of a process calculus model, encompassing the notions of domain,
accounting and delegation. We present the operational semantics of the model in
two equivalent alternative ways, each informing on the specific nature of
authorizations. We also introduce a typing discipline to single out systems
that never get stuck due to lacking authorizations, addressing configurations
where authorization assignment is not statically prescribed in the system
specification.
| cs.PL | controlling resource usage in distributed systems is a challenging task given the dynamics involved in access granting consider for instance the setting of floating licenses where access can be granted if the request originates in a licensed domain and the number of active users is within the license limits and where licenses can be interchanged access granting in such scenarios is given in terms of floating authorizations addressed in this paper as first class entities of a process calculus model encompassing the notions of domain accounting and delegation we present the operational semantics of the model in two equivalent alternative ways each informing on the specific nature of authorizations we also introduce a typing discipline to single out systems that never get stuck due to lacking authorizations addressing configurations where authorization assignment is not statically prescribed in the system specification | [['controlling', 'resource', 'usage', 'in', 'distributed', 'systems', 'is', 'a', 'challenging', 'task', 'given', 'the', 'dynamics', 'involved', 'in', 'access', 'granting', 'consider', 'for', 'instance', 'the', 'setting', 'of', 'floating', 'licenses', 'where', 'access', 'can', 'be', 'granted', 'if', 'the', 'request', 'originates', 'in', 'a', 'licensed', 'domain', 'and', 'the', 'number', 'of', 'active', 'users', 'is', 'within', 'the', 'license', 'limits', 'and', 'where', 'licenses', 'can', 'be', 'interchanged', 'access', 'granting', 'in', 'such', 'scenarios', 'is', 'given', 'in', 'terms', 'of', 'floating', 'authorizations', 'addressed', 'in', 'this', 'paper', 'as', 'first', 'class', 'entities', 'of', 'a', 'process', 'calculus', 'model', 'encompassing', 'the', 'notions', 'of', 'domain', 'accounting', 'and', 'delegation', 'we', 'present', 'the', 'operational', 'semantics', 'of', 'the', 'model', 'in', 'two', 'equivalent', 'alternative', 'ways', 'each', 'informing', 'on', 'the', 'specific', 'nature', 'of', 'authorizations', 'we', 'also', 'introduce', 'a', 'typing', 'discipline', 'to', 'single', 'out', 'systems', 'that', 'never', 'get', 'stuck', 'due', 'to', 'lacking', 'authorizations', 'addressing', 'configurations', 'where', 'authorization', 'assignment', 'is', 'not', 'statically', 'prescribed', 'in', 'the', 'system', 'specification']] | [-0.18578275245568615, 0.05749562350434384, -0.04868033827182704, 0.048651525040271995, -0.10398667292070708, -0.21690910612232983, 0.13130048023054508, 0.36214299380247084, -0.29594118391562785, -0.3021593544532412, 0.11377888602104837, -0.21145339112263173, -0.09038394198287278, 0.13811393245788559, -0.13138572856218422, 0.0119130944101406, 0.046158374082629704, 0.055162598337379416, -0.004301786996490721, -0.22185515354254415, 0.31568460586464164, 0.025310597262744393, 0.2808789257625384, 0.05152127524738067, 0.04467084877957989, 0.03865373266494966, -0.019193920130575342, -0.02105591156120811, -0.05236717734478589, 0.09630491749682862, 0.3262770670898525, 0.19493453689418466, 0.33508552850357126, -0.4434452952151852, -0.17963490308029578, 0.0865387347759679, 0.16767897186883993, 0.07006720617646352, -0.015041757784950148, -0.2931227893701622, 0.10782004696749417, -0.22122783705791724, -0.07279782456379118, -0.05647904479743115, -0.0026887111943714056, -0.002918576923964013, -0.2638639371077131, -0.00808942711300915, 0.06129355080525524, 0.0735101660879861, -0.07955109442617478, -0.038883632891312504, 0.01446380030164229, 0.19355154235464786, 0.02162660730848854, -0.017320184087813165, 0.13233284422728633, -0.14508712990043152, -0.13233765684334295, 0.46180893355714425, 0.032356740346377984, -0.26519652147045625, 0.17434291914604338, -0.07619204664370045, -0.17007866803157543, 0.05131017953889178, 0.18063355705900383, 0.12418160333763809, -0.21657783180874374, 0.0957974889835376, -0.03688782249311251, 0.1850397995190828, 0.10186562250268512, 0.07632292583584785, 0.21970098943981742, 0.20457147876399437, 0.0684303009350385, 0.16179667735705153, -0.010299734102695116, -0.12504200306055802, -0.30063419908817324, -0.1492233074187035, -0.14569700143433043, 0.015256599832563162, -0.014689226187121157, -0.1570941717230848, 0.36137401613606407, 0.18135316177514532, 0.11960443583915809, 0.021181411859912, 0.32510673853435684, 0.08032966037052185, 0.08350869782402047, 0.11355892259536111, 0.1306837387116892, -0.015448813017324677, 0.14295653618672596, -0.12432482959369996, 0.1384600621232364, 0.00048332671701375925] |
1,802.05864 | Search for Giant Pulses of radio pulsars at frequency 111 MHz with LPA
radio telescope | We have used the unique low frequency sensitivity of the Large Phased Array
radio telescope of Pushchino Radio Astronomy Observatory to collect dataset of
the single pulse observations of second period pulsars of the Northern
hemisphere. During observational sessions of 2011 - 2017 yrs. We have collected
data on 71 pulsars at 111 MHz frequency using digital pulsar receiver. We have
discovered Giant Radio Pulses (GRP) from pulsars B0301+09 and B1237+25, and
confirmed early reported generation of anomalously strong (probable giant)
pulses from B1133+16 on statistically significant dataset. Data for these
pulsars and from B0950+08, B1112+50, early reported as pulsars generating GRPs
were analyzed to evaluate their behavior on long time intervals. It was found
that statistical criterion (power-law spectrum of GRPs distribution on energy
and peak flux density) seems not to be strict for pulsars with the low magnetic
field on light cylinder. Moreover, spectra of some of these pulsars demonstrate
unstable behavior with the time and have complex multicomponent shape. In the
dataset of B0950+08 we have detected strongest GRP from pulsars with the low
magnetic field on light cylinder ever reported having the peak flux density as
strong as 16.8 kJy.
| astro-ph.HE | we have used the unique low frequency sensitivity of the large phased array radio telescope of pushchino radio astronomy observatory to collect dataset of the single pulse observations of second period pulsars of the northern hemisphere during observational sessions of 2011 2017 yrs we have collected data on 71 pulsars at 111 mhz frequency using digital pulsar receiver we have discovered giant radio pulses grp from pulsars b030109 and b123725 and confirmed early reported generation of anomalously strong probable giant pulses from b113316 on statistically significant dataset data for these pulsars and from b095008 b111250 early reported as pulsars generating grps were analyzed to evaluate their behavior on long time intervals it was found that statistical criterion powerlaw spectrum of grps distribution on energy and peak flux density seems not to be strict for pulsars with the low magnetic field on light cylinder moreover spectra of some of these pulsars demonstrate unstable behavior with the time and have complex multicomponent shape in the dataset of b095008 we have detected strongest grp from pulsars with the low magnetic field on light cylinder ever reported having the peak flux density as strong as 168 kjy | [['we', 'have', 'used', 'the', 'unique', 'low', 'frequency', 'sensitivity', 'of', 'the', 'large', 'phased', 'array', 'radio', 'telescope', 'of', 'pushchino', 'radio', 'astronomy', 'observatory', 'to', 'collect', 'dataset', 'of', 'the', 'single', 'pulse', 'observations', 'of', 'second', 'period', 'pulsars', 'of', 'the', 'northern', 'hemisphere', 'during', 'observational', 'sessions', 'of', '2011', '2017', 'yrs', 'we', 'have', 'collected', 'data', 'on', '71', 'pulsars', 'at', '111', 'mhz', 'frequency', 'using', 'digital', 'pulsar', 'receiver', 'we', 'have', 'discovered', 'giant', 'radio', 'pulses', 'grp', 'from', 'pulsars', 'b030109', 'and', 'b123725', 'and', 'confirmed', 'early', 'reported', 'generation', 'of', 'anomalously', 'strong', 'probable', 'giant', 'pulses', 'from', 'b113316', 'on', 'statistically', 'significant', 'dataset', 'data', 'for', 'these', 'pulsars', 'and', 'from', 'b095008', 'b111250', 'early', 'reported', 'as', 'pulsars', 'generating', 'grps', 'were', 'analyzed', 'to', 'evaluate', 'their', 'behavior', 'on', 'long', 'time', 'intervals', 'it', 'was', 'found', 'that', 'statistical', 'criterion', 'powerlaw', 'spectrum', 'of', 'grps', 'distribution', 'on', 'energy', 'and', 'peak', 'flux', 'density', 'seems', 'not', 'to', 'be', 'strict', 'for', 'pulsars', 'with', 'the', 'low', 'magnetic', 'field', 'on', 'light', 'cylinder', 'moreover', 'spectra', 'of', 'some', 'of', 'these', 'pulsars', 'demonstrate', 'unstable', 'behavior', 'with', 'the', 'time', 'and', 'have', 'complex', 'multicomponent', 'shape', 'in', 'the', 'dataset', 'of', 'b095008', 'we', 'have', 'detected', 'strongest', 'grp', 'from', 'pulsars', 'with', 'the', 'low', 'magnetic', 'field', 'on', 'light', 'cylinder', 'ever', 'reported', 'having', 'the', 'peak', 'flux', 'density', 'as', 'strong', 'as', '168', 'kjy']] | [-0.12971132523125561, 0.13820053005777785, -0.06913745839316714, 0.09502182833481736, -0.1339146121633045, -0.08705835249323475, 0.06559914652219352, 0.45557671284526197, -0.13158602702606004, -0.40635883750898455, 0.10275931779354626, -0.29694838934301515, -0.041141238286703206, 0.296878295475229, -0.00011195513555624832, -0.0015882204146085617, 0.10681159767652086, -0.033250830126538254, 0.00948024149814349, -0.19415955313093036, 0.2087510200314379, 0.10768341333217298, 0.26647979200311056, -0.03456808233022457, 0.11902801502336995, -0.08889167300245997, -0.0408301638691834, -0.052176361410147365, -0.07231279106436735, 0.014560953102773055, 0.2359925727311444, 0.11883211561265246, 0.1476295231016896, -0.4136949008728455, -0.19048555349218077, 0.0838738583115628, 0.12630276393368453, -0.0010985564780033503, -0.03940036348603826, -0.3451498466868846, 0.07619658179222218, -0.18818349220964592, -0.16579364596206383, 0.028618731240082223, 0.07079267175504356, 0.10289284386332535, -0.1499593544219048, 0.11678065838289815, -0.01566144698639012, 0.11350771372963209, -0.10440675792415277, -0.14017910991242388, 0.0006630749764250746, 0.06750978360408529, 0.09024268759003462, 0.05100543436856242, 0.08923084212650186, -0.07630803171950144, -0.10424248291868328, 0.3189536721232192, -0.0876161456144473, 0.045655449401238, 0.1713740974804144, -0.26162944108849234, -0.18727721076720627, 0.19538389872953607, 0.20802323371329598, 0.08399882276838373, -0.1508000703821987, -0.0139015214419184, -0.02302049513309612, 0.22936147609774102, 0.11068654600239825, 0.06168680807483421, 0.28890257595533814, 0.12716028875759852, 0.017062891842215322, 0.1215544839190746, -0.29472519686047843, 0.01297443788886691, -0.19704973622841257, -0.034928352995621026, -0.1809307076885792, 0.10120311884512982, -0.06296739598193805, -0.1289184932823749, 0.4214460549070888, 0.10235363534108426, 0.11721460140446045, 0.050042530388357896, 0.26609065183826414, 0.11324655619015782, 0.08708999501300241, 0.10303796632676192, 0.3167847019196112, 0.13974173312089988, 0.17470351552280286, -0.19519775032813413, 0.048983460316473305, -0.07565321535609353] |
1,802.05865 | Statistical Analysis of Metrics for Software Quality Improvement | Software product quality can be defined as the features and characteristics
of the product that meet the user needs. The quality of any software can be
achieved by following a well defined software process. These software process
results into various metrics like Project metrics, Product metrics and Process
metrics. Software quality depends on the process which is carried out to design
and develop software. Even though the process can be carried out with utmost
care, still it can introduce some error and defects. Process metrics are very
useful from management point of view. Process metrics can be used for improving
the software development and maintenance process for defect removal and also
for reducing the response time. This paper describes the importance of
capturing the Process metrics during the quality audit process and also
attempts to categorize them based on the nature of error captured. To reduce
such errors and defects found, steps for corrective actions are recommended.
| cs.SE | software product quality can be defined as the features and characteristics of the product that meet the user needs the quality of any software can be achieved by following a well defined software process these software process results into various metrics like project metrics product metrics and process metrics software quality depends on the process which is carried out to design and develop software even though the process can be carried out with utmost care still it can introduce some error and defects process metrics are very useful from management point of view process metrics can be used for improving the software development and maintenance process for defect removal and also for reducing the response time this paper describes the importance of capturing the process metrics during the quality audit process and also attempts to categorize them based on the nature of error captured to reduce such errors and defects found steps for corrective actions are recommended | [['software', 'product', 'quality', 'can', 'be', 'defined', 'as', 'the', 'features', 'and', 'characteristics', 'of', 'the', 'product', 'that', 'meet', 'the', 'user', 'needs', 'the', 'quality', 'of', 'any', 'software', 'can', 'be', 'achieved', 'by', 'following', 'a', 'well', 'defined', 'software', 'process', 'these', 'software', 'process', 'results', 'into', 'various', 'metrics', 'like', 'project', 'metrics', 'product', 'metrics', 'and', 'process', 'metrics', 'software', 'quality', 'depends', 'on', 'the', 'process', 'which', 'is', 'carried', 'out', 'to', 'design', 'and', 'develop', 'software', 'even', 'though', 'the', 'process', 'can', 'be', 'carried', 'out', 'with', 'utmost', 'care', 'still', 'it', 'can', 'introduce', 'some', 'error', 'and', 'defects', 'process', 'metrics', 'are', 'very', 'useful', 'from', 'management', 'point', 'of', 'view', 'process', 'metrics', 'can', 'be', 'used', 'for', 'improving', 'the', 'software', 'development', 'and', 'maintenance', 'process', 'for', 'defect', 'removal', 'and', 'also', 'for', 'reducing', 'the', 'response', 'time', 'this', 'paper', 'describes', 'the', 'importance', 'of', 'capturing', 'the', 'process', 'metrics', 'during', 'the', 'quality', 'audit', 'process', 'and', 'also', 'attempts', 'to', 'categorize', 'them', 'based', 'on', 'the', 'nature', 'of', 'error', 'captured', 'to', 'reduce', 'such', 'errors', 'and', 'defects', 'found', 'steps', 'for', 'corrective', 'actions', 'are', 'recommended']] | [-0.07296591347000402, 0.040433016120734966, -0.07051894183798581, 0.06539902866172999, -0.06532176506296275, -0.1376322014820851, 0.06615019190513713, 0.43582210800118126, -0.24525389826862484, -0.3272513291994288, 0.16958663870645746, -0.24319237801928523, -0.15912973358715546, 0.22996152472344172, -0.11953858580517399, 0.09845686606042514, 0.1155071577330114, 0.004039433968674605, -0.03894940369531132, -0.30494367329338506, 0.3401989647110177, 0.14254184904253217, 0.347368876307396, 0.09089067087591786, 0.05171670734728123, -0.0012340172532067937, -0.08543909760785236, 0.02023234144209107, -0.08500182457665126, 0.09034461300756344, 0.30914253198725594, 0.21873706995189238, 0.27907137674498994, -0.4143627051169136, -0.19384128585528987, 0.06963405065582531, 0.14575061378748436, 0.03741049049436975, 0.005263082296023988, -0.3070710083146455, 0.09307889780919452, -0.16611075161653718, -0.08533329598362421, -0.12191405884067344, -0.04826296095967673, 0.012249181693668957, -0.24937287240532363, -0.02868070971008663, 0.04111265037898389, 0.03860818807652611, -0.02199097403034473, -0.10044388124529438, -0.02707878256492483, 0.24692738101562592, 0.07050351999424974, 0.03198144010677459, 0.20754916066968232, -0.10771042915916806, -0.1435662321805669, 0.41488476133175717, 0.0008191934365565609, -0.23446939822737198, 0.15954535183271357, -0.028880639804028878, -0.14080769375002214, 0.12559012455864257, 0.21537135528981877, 0.07378245680296355, -0.20544886664238277, 0.03164415775388954, 0.14068821838398457, 0.16445507570915072, 0.04422317465298637, 0.011809036562776869, 0.1980574785043622, 0.17453558622728915, 0.03041221094643994, 0.12706390129859044, -0.023943539066900124, -0.057816001869961296, -0.2744012130068461, -0.2093121929992892, -0.12526858769131788, 0.03972374493327395, -0.07692193545054075, -0.1762565353909021, 0.39077659153563393, 0.16524051225026418, 0.129457351449094, 0.016946077650074793, 0.28794537071779275, 0.09932904183244701, 0.08781576192504756, 0.05480361108780856, 0.1740240764955821, -0.004515696012942939, 0.09685700881787261, -0.1470712195402664, 0.15893384010181022, 0.026989501555432463] |
1,802.05866 | Invariant prolongation of the Killing tensor equation | The Killing tensor equation is a first order differential equation on
symmetric covariant tensors that generalises to higher rank the usual Killing
vector equation on Riemannian manifolds. We view this more generally as an
equation on any manifold equipped with an affine connection, and in this
setting derive its prolongation to a linear connection. This connection has the
property that parallel sections are in 1-1 correspondence with solutions of the
Killing equation. Moreover this connection is projectively invariant and is
derived entirely using the projectively invariant tractor calculus which
reveals also further invariant structures linked to the prolongation.
| math.DG | the killing tensor equation is a first order differential equation on symmetric covariant tensors that generalises to higher rank the usual killing vector equation on riemannian manifolds we view this more generally as an equation on any manifold equipped with an affine connection and in this setting derive its prolongation to a linear connection this connection has the property that parallel sections are in 11 correspondence with solutions of the killing equation moreover this connection is projectively invariant and is derived entirely using the projectively invariant tractor calculus which reveals also further invariant structures linked to the prolongation | [['the', 'killing', 'tensor', 'equation', 'is', 'a', 'first', 'order', 'differential', 'equation', 'on', 'symmetric', 'covariant', 'tensors', 'that', 'generalises', 'to', 'higher', 'rank', 'the', 'usual', 'killing', 'vector', 'equation', 'on', 'riemannian', 'manifolds', 'we', 'view', 'this', 'more', 'generally', 'as', 'an', 'equation', 'on', 'any', 'manifold', 'equipped', 'with', 'an', 'affine', 'connection', 'and', 'in', 'this', 'setting', 'derive', 'its', 'prolongation', 'to', 'a', 'linear', 'connection', 'this', 'connection', 'has', 'the', 'property', 'that', 'parallel', 'sections', 'are', 'in', '11', 'correspondence', 'with', 'solutions', 'of', 'the', 'killing', 'equation', 'moreover', 'this', 'connection', 'is', 'projectively', 'invariant', 'and', 'is', 'derived', 'entirely', 'using', 'the', 'projectively', 'invariant', 'tractor', 'calculus', 'which', 'reveals', 'also', 'further', 'invariant', 'structures', 'linked', 'to', 'the', 'prolongation']] | [-0.17580450161916147, 0.059585053818502313, -0.10692049076362532, 0.06127241957452795, -0.21298492788717302, -0.15300380765004273, -0.08984342338137176, 0.3631483157526474, -0.30297532981993364, -0.20650253417350503, 0.09924937960393584, -0.2754940491321744, -0.21870423159657085, 0.11335010574512867, -0.093954199858542, 0.016861437952350254, 0.023940177774531956, 0.13756354252940842, -0.1767722215332395, -0.23054154082296455, 0.46761466425900555, 0.035872425484870164, 0.2922389237994176, 0.0055393299173411665, 0.22487894228032354, -0.03270805472144572, -0.012108711915432798, 0.0038132351604575404, -0.11814601978418365, 0.14300642036167638, 0.24812065272791578, 0.07114008047893568, 0.15022199427975075, -0.3790863952266851, -0.14985870873455756, 0.12527281612785038, 0.11364635065369004, 0.04908097775805057, -0.022929881425718158, -0.3207909730928285, 0.08824660303546306, -0.11601076911830781, -0.17451708108110695, -0.11512278858572245, 0.04636813610036648, -0.07312854749093554, -0.18425124239328564, 0.05244947058042958, 0.09799615225317526, 0.06343224955418585, -0.14875949802927255, -0.03846559360236101, -0.05913750307007255, -0.004549119488469192, 0.040897071924611776, 0.07793761501017464, 0.05902401131235671, -0.04214610603200842, -0.147581644286164, 0.354276123817782, -0.08752092150187273, -0.3934261837632072, 0.12658857584845426, -0.09957346222268379, -0.1490702371906527, 0.10055090532381544, 0.12885066381494079, 0.1754641274506421, -0.15537667040694125, 0.14207535457431472, -0.06411448576278528, 0.06804794025944774, 0.0951439091717178, -0.042611445238509654, 0.10488164909088946, 0.07777175027877092, 0.14035362158236758, 0.09765542893461426, 0.026051608130468855, -0.16009353909033294, -0.37754109322226476, -0.2483184029519254, -0.09497568701698007, 0.16844573956961761, -0.14001889436533058, -0.1616677189701978, 0.36045858239260864, 0.04073013387126278, 0.18562965107456858, 0.11668837617973474, 0.24919612211536388, 0.15998951498566347, 0.06205876552076934, 0.07442784609453638, 0.21243367527079368, 0.3104079693213713, 0.09944199382360759, -0.14028511856378492, -0.009635796414080019, 0.13385791240298017] |
1,802.05867 | Observation of Poiseuille Flow of Phonons in Black Phosphorus | The travel of heat in insulators is commonly pictured as a flow of phonons
scattered along their individual trajectory. In rare circumstances,
momentum-conserving collision events dominate, and thermal transport becomes
hydrodynamic. One of these cases, dubbed the Poiseuille flow of phonons, can
occur in a temperature window just below the peak temperature of thermal
conductivity. We report on a study of heat flow in bulk black phosphorus
between 0.1 and 80 K. We find a thermal conductivity showing a faster than
cubic temperature dependence between 5 and 12 K. Consequently, the effective
phonon mean free path shows a nonmonotonic temperature dependence at the onset
of the ballistic regime, with a size-dependent Knudsen minimum. These are
hallmarks of Poiseuille flow previously observed in a handful of solids.
Comparing the phonon dispersion in black phosphorus and silicon, we showthat
the phase space for normal scattering events in black phosphorus is much
larger. Our results imply that the most important requirement for the emergence
of Poiseuille flowis the facility ofmomentum exchange between acoustic phonon
branches. Proximity to a structural transition can be beneficial for the
emergence of this behavior in clean systems, even when they do not exceed
silicon in purity.
| cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el | the travel of heat in insulators is commonly pictured as a flow of phonons scattered along their individual trajectory in rare circumstances momentumconserving collision events dominate and thermal transport becomes hydrodynamic one of these cases dubbed the poiseuille flow of phonons can occur in a temperature window just below the peak temperature of thermal conductivity we report on a study of heat flow in bulk black phosphorus between 01 and 80 k we find a thermal conductivity showing a faster than cubic temperature dependence between 5 and 12 k consequently the effective phonon mean free path shows a nonmonotonic temperature dependence at the onset of the ballistic regime with a sizedependent knudsen minimum these are hallmarks of poiseuille flow previously observed in a handful of solids comparing the phonon dispersion in black phosphorus and silicon we showthat the phase space for normal scattering events in black phosphorus is much larger our results imply that the most important requirement for the emergence of poiseuille flowis the facility ofmomentum exchange between acoustic phonon branches proximity to a structural transition can be beneficial for the emergence of this behavior in clean systems even when they do not exceed silicon in purity | [['the', 'travel', 'of', 'heat', 'in', 'insulators', 'is', 'commonly', 'pictured', 'as', 'a', 'flow', 'of', 'phonons', 'scattered', 'along', 'their', 'individual', 'trajectory', 'in', 'rare', 'circumstances', 'momentumconserving', 'collision', 'events', 'dominate', 'and', 'thermal', 'transport', 'becomes', 'hydrodynamic', 'one', 'of', 'these', 'cases', 'dubbed', 'the', 'poiseuille', 'flow', 'of', 'phonons', 'can', 'occur', 'in', 'a', 'temperature', 'window', 'just', 'below', 'the', 'peak', 'temperature', 'of', 'thermal', 'conductivity', 'we', 'report', 'on', 'a', 'study', 'of', 'heat', 'flow', 'in', 'bulk', 'black', 'phosphorus', 'between', '01', 'and', '80', 'k', 'we', 'find', 'a', 'thermal', 'conductivity', 'showing', 'a', 'faster', 'than', 'cubic', 'temperature', 'dependence', 'between', '5', 'and', '12', 'k', 'consequently', 'the', 'effective', 'phonon', 'mean', 'free', 'path', 'shows', 'a', 'nonmonotonic', 'temperature', 'dependence', 'at', 'the', 'onset', 'of', 'the', 'ballistic', 'regime', 'with', 'a', 'sizedependent', 'knudsen', 'minimum', 'these', 'are', 'hallmarks', 'of', 'poiseuille', 'flow', 'previously', 'observed', 'in', 'a', 'handful', 'of', 'solids', 'comparing', 'the', 'phonon', 'dispersion', 'in', 'black', 'phosphorus', 'and', 'silicon', 'we', 'showthat', 'the', 'phase', 'space', 'for', 'normal', 'scattering', 'events', 'in', 'black', 'phosphorus', 'is', 'much', 'larger', 'our', 'results', 'imply', 'that', 'the', 'most', 'important', 'requirement', 'for', 'the', 'emergence', 'of', 'poiseuille', 'flowis', 'the', 'facility', 'ofmomentum', 'exchange', 'between', 'acoustic', 'phonon', 'branches', 'proximity', 'to', 'a', 'structural', 'transition', 'can', 'be', 'beneficial', 'for', 'the', 'emergence', 'of', 'this', 'behavior', 'in', 'clean', 'systems', 'even', 'when', 'they', 'do', 'not', 'exceed', 'silicon', 'in', 'purity']] | [-0.15195282445317704, 0.21679537498828128, -0.07726244443872521, 0.03805235601315389, -0.029666366590167945, -0.12971626037532197, 0.07286711646201165, 0.37774923164278684, -0.25750419729904805, -0.28289399595874154, 0.0404872530994091, -0.359016215951391, -0.09632260449069115, 0.2386426033401073, 0.005392015251159972, 0.023961441489815598, 0.012753914535634828, 0.018439549180602997, -0.07012667103874859, -0.17120087447063048, 0.24234922620353802, 0.04093045192504568, 0.3112048344349261, 0.08774542293394916, 0.042655776696067606, -0.010663526449578206, 0.07077977276209395, 0.06543266713819952, -0.1601880875849168, 0.02236896666356039, 0.2439795702717229, -0.053502161190631246, 0.22185245174819565, -0.4189571660987282, -0.26637623245336056, 0.06181816622491318, 0.15019371376458404, 0.14706272685577218, -0.053772048180244565, -0.17160722716920535, 0.04070291618878326, -0.13550127428785272, -0.10489291854247888, -0.017048543048262293, 0.03594319142249166, -0.021179065977850436, -0.19735210805855768, 0.17547634334172174, 0.06203296556249166, 0.07421845929089539, -0.08054765453680932, -0.1027218178282872, -0.08323805626096888, 0.07951129679297862, 0.05352932427729461, -0.015145540519351554, 0.20007398496521517, -0.14940120869824586, -0.059582063053943674, 0.40091849019636916, -0.08124529039916376, -0.08153024900910132, 0.2095295206349039, -0.22115820416128168, -0.044963188096405746, 0.19700255216460447, 0.16986451672472663, 0.12853790776404952, -0.13836683387719914, -0.0022942134706607584, -0.0016236066229033228, 0.1415640356705752, 0.09423107842793593, 0.08138033165121261, 0.26514463097069263, 0.1981171368281547, 0.03126742029669505, 0.15116665641865124, -0.11306974602915461, -0.04993697243733142, -0.26445122889471145, -0.1704188591200141, -0.16668240016929767, 0.08449465827667452, -0.12388380425115002, -0.1849856246286547, 0.3579816176551299, 0.15141785685008638, 0.2105834639859291, -0.0014174305525019157, 0.2419830631786644, 0.12223778178497237, 0.07351042129032846, 0.12308837857087884, 0.3042505626205583, 0.1519565212906205, 0.14316312099595516, -0.2851020179827619, 0.0592273280715893, 0.013851818158196248] |
1,802.05868 | Thermal transport and phonon hydrodynamics in strontium titanate | We present a study of thermal conductivity, $\kappa$, in undoped and doped
strontium titanate in a wide temperature range (2-400 K) and detecting
different regimes of heat flow. In undoped SrTiO$_{3}$, $\kappa$ evolves faster
than cubic with temperature below its peak and in a narrow temperature window.
Such a behavior, previously observed in a handful of solids, has been
attributed to a Poiseuille flow of phonons, expected to arise when
momentum-conserving scattering events outweigh momentum-degrading ones. The
effect disappears in presence of dopants. In SrTi$_{1-x}$Nb$_{x}$O$_{3}$, a
significant reduction in lattice thermal conductivity starts below the
temperature at which the average interdopant distance and the thermal
wavelength of acoustic phonons become comparable. In the high-temperature
regime, thermal diffusivity becomes proportional to the inverse of temperature,
with a prefactor set by sound velocity and Planckian time
($\tau_{p}=\frac{\hbar}{k_{B}T}$).
| cond-mat.mtrl-sci cond-mat.str-el cond-mat.supr-con | we present a study of thermal conductivity kappa in undoped and doped strontium titanate in a wide temperature range 2400 k and detecting different regimes of heat flow in undoped srtio_3 kappa evolves faster than cubic with temperature below its peak and in a narrow temperature window such a behavior previously observed in a handful of solids has been attributed to a poiseuille flow of phonons expected to arise when momentumconserving scattering events outweigh momentumdegrading ones the effect disappears in presence of dopants in srti_1xnb_xo_3 a significant reduction in lattice thermal conductivity starts below the temperature at which the average interdopant distance and the thermal wavelength of acoustic phonons become comparable in the hightemperature regime thermal diffusivity becomes proportional to the inverse of temperature with a prefactor set by sound velocity and planckian time tau_pfrachbark_bt | [['we', 'present', 'a', 'study', 'of', 'thermal', 'conductivity', 'kappa', 'in', 'undoped', 'and', 'doped', 'strontium', 'titanate', 'in', 'a', 'wide', 'temperature', 'range', '2400', 'k', 'and', 'detecting', 'different', 'regimes', 'of', 'heat', 'flow', 'in', 'undoped', 'srtio_3', 'kappa', 'evolves', 'faster', 'than', 'cubic', 'with', 'temperature', 'below', 'its', 'peak', 'and', 'in', 'a', 'narrow', 'temperature', 'window', 'such', 'a', 'behavior', 'previously', 'observed', 'in', 'a', 'handful', 'of', 'solids', 'has', 'been', 'attributed', 'to', 'a', 'poiseuille', 'flow', 'of', 'phonons', 'expected', 'to', 'arise', 'when', 'momentumconserving', 'scattering', 'events', 'outweigh', 'momentumdegrading', 'ones', 'the', 'effect', 'disappears', 'in', 'presence', 'of', 'dopants', 'in', 'srti_1xnb_xo_3', 'a', 'significant', 'reduction', 'in', 'lattice', 'thermal', 'conductivity', 'starts', 'below', 'the', 'temperature', 'at', 'which', 'the', 'average', 'interdopant', 'distance', 'and', 'the', 'thermal', 'wavelength', 'of', 'acoustic', 'phonons', 'become', 'comparable', 'in', 'the', 'hightemperature', 'regime', 'thermal', 'diffusivity', 'becomes', 'proportional', 'to', 'the', 'inverse', 'of', 'temperature', 'with', 'a', 'prefactor', 'set', 'by', 'sound', 'velocity', 'and', 'planckian', 'time', 'tau_pfrachbark_bt']] | [-0.13123033809560267, 0.27002361128909275, -0.03930968021141422, -0.015204739493183848, -0.02915982469549459, -0.145631315867473, 0.09395499394282303, 0.3772005631419068, -0.2677301857549923, -0.2690649898705129, 0.03207476222869997, -0.37420891738270945, -0.03505552727658527, 0.21362641352144154, 0.024686570107764, 0.015009815793636142, -0.04696038833142004, 0.0064893004936025, -0.06831097372130236, -0.17112252272658446, 0.21317790717302793, 0.08029339660071966, 0.3151711701348452, 0.10256183637962253, 0.03826875750779767, -0.04081985058975547, 0.0914912652294857, 0.08346345923531441, -0.16878422273492272, -0.04334764950555947, 0.2663965431380678, -0.1229532741937984, 0.22598093215051587, -0.3888585877915223, -0.284402039791916, 0.07418343253172652, 0.1382597622772058, 0.11939723873519777, -0.038034171753238435, -0.17489834559841477, 0.017360661609211202, -0.12004499596712942, -0.13973040608195306, -0.02412109658524225, 0.05190160933345782, -0.06884362454399127, -0.21808425930441555, 0.18002181927052638, 0.058566690413775206, 0.09774103917879984, -0.10239507126089213, -0.15863253365299015, -0.05288413057463582, 0.017612993000401537, 0.07655724318288831, 0.034858777599931105, 0.19939866136392634, -0.1462334783603899, -0.027980521483572596, 0.39546209511657554, -0.14195264286282702, -0.026384655052838338, 0.18705611740623487, -0.20431522608410116, -0.004026892785490913, 0.23924057027607254, 0.16442929588215935, 0.10765205456515435, -0.13797115373557917, 0.05525368001359642, 0.015408172325061803, 0.18705036215286588, 0.09613695227766805, 0.09408425698480145, 0.2307033115242975, 0.22632039279613475, 0.005534903520266666, 0.17828805623293825, -0.12010459472058398, -0.020424339800339305, -0.20424457601356236, -0.1403119783247927, -0.1866447434118582, 0.0777304276266615, -0.13959722649815376, -0.20440481157856993, 0.35605353315953503, 0.1666817141963155, 0.21977709212594412, 0.005730276693639374, 0.25915601869311294, 0.13425356570102545, 0.08624311241984481, 0.09717767198824069, 0.2696715553051256, 0.15346099075924774, 0.17171910268988347, -0.29509427818949474, 0.05967992028066268, -0.011887362762177927] |
1,802.05869 | Carrier driven antiferromagnetism and exchange-bias in SrRuO3/CaRuO3
heterostructures | Oxide heterostructures exhibit a rich variety of magnetic and transport
properties which arise due to contact at an interface. This can lead to
surprising effects that are very different from the bulk properties of the
materials involved. We report the magnetic properties of bilayers of SrRuO3, a
well known ferromagnet, and CaRuO3, which is nominally a paramagnet. We find
intriguing features that are consistent with CaRuO3 developing dual magnetic
character, with both a net moment as well as antiferromagnetic order. We argue
the ordered SrRuO3 layer induces an undulating polarization profile in the
conduction electrons of CaRuO3, by a mechanism akin to Friedel oscillations. At
low temperatures, this oscillating polarization is inherited by rigid local
moments within CaRuO3, leading to a robust exchange bias. We present ab initio
simulations in support of this picture. Our results demonstrate a new ordering
mechanism and throw light on the magnetic character of CaRuO3 .
| cond-mat.mtrl-sci cond-mat.str-el quant-ph | oxide heterostructures exhibit a rich variety of magnetic and transport properties which arise due to contact at an interface this can lead to surprising effects that are very different from the bulk properties of the materials involved we report the magnetic properties of bilayers of srruo3 a well known ferromagnet and caruo3 which is nominally a paramagnet we find intriguing features that are consistent with caruo3 developing dual magnetic character with both a net moment as well as antiferromagnetic order we argue the ordered srruo3 layer induces an undulating polarization profile in the conduction electrons of caruo3 by a mechanism akin to friedel oscillations at low temperatures this oscillating polarization is inherited by rigid local moments within caruo3 leading to a robust exchange bias we present ab initio simulations in support of this picture our results demonstrate a new ordering mechanism and throw light on the magnetic character of caruo3 | [['oxide', 'heterostructures', 'exhibit', 'a', 'rich', 'variety', 'of', 'magnetic', 'and', 'transport', 'properties', 'which', 'arise', 'due', 'to', 'contact', 'at', 'an', 'interface', 'this', 'can', 'lead', 'to', 'surprising', 'effects', 'that', 'are', 'very', 'different', 'from', 'the', 'bulk', 'properties', 'of', 'the', 'materials', 'involved', 'we', 'report', 'the', 'magnetic', 'properties', 'of', 'bilayers', 'of', 'srruo3', 'a', 'well', 'known', 'ferromagnet', 'and', 'caruo3', 'which', 'is', 'nominally', 'a', 'paramagnet', 'we', 'find', 'intriguing', 'features', 'that', 'are', 'consistent', 'with', 'caruo3', 'developing', 'dual', 'magnetic', 'character', 'with', 'both', 'a', 'net', 'moment', 'as', 'well', 'as', 'antiferromagnetic', 'order', 'we', 'argue', 'the', 'ordered', 'srruo3', 'layer', 'induces', 'an', 'undulating', 'polarization', 'profile', 'in', 'the', 'conduction', 'electrons', 'of', 'caruo3', 'by', 'a', 'mechanism', 'akin', 'to', 'friedel', 'oscillations', 'at', 'low', 'temperatures', 'this', 'oscillating', 'polarization', 'is', 'inherited', 'by', 'rigid', 'local', 'moments', 'within', 'caruo3', 'leading', 'to', 'a', 'robust', 'exchange', 'bias', 'we', 'present', 'ab', 'initio', 'simulations', 'in', 'support', 'of', 'this', 'picture', 'our', 'results', 'demonstrate', 'a', 'new', 'ordering', 'mechanism', 'and', 'throw', 'light', 'on', 'the', 'magnetic', 'character', 'of', 'caruo3']] | [-0.1712392191744099, 0.2039165185704284, -0.07853510370478034, 0.041494459816409895, -0.07765159072509656, -0.11346377916944524, 0.06593267060234212, 0.40186707992106674, -0.3092220803909004, -0.29736339225123326, -0.00047512207025041185, -0.30269408085693916, -0.1668487420072779, 0.17518546203772226, 0.03145113843958825, -0.04334914394033452, -0.01888059526216239, -0.05359427605949653, -0.09497689109217997, -0.15896726581685167, 0.2721456914333006, 0.030373654533177613, 0.306781005927672, 0.08078646612130494, 0.05953489378405114, -0.025890686184478304, 0.1343727177474648, 0.06432832318047682, -0.11927357152637948, 0.07239163793933888, 0.20611632923906048, -0.10759090785868466, 0.17673209582145016, -0.4741879192739725, -0.19608605964361533, -0.022660550837560245, 0.11203220073133707, 0.1528931215312332, -0.12716363894287497, -0.2617281322926283, 0.08046099521840612, -0.13255076210014521, -0.1327492239252509, -0.13878642681248796, -0.034220207542724285, 0.009363860456893842, -0.27109718998273213, 0.1121431224863045, 0.10971102975153675, 0.09552067438140512, -0.09478100959211588, -0.12579678340504566, -0.07094933522399514, 0.06659912833400691, 0.08388246752709771, 0.07409308688870321, 0.15292027075774967, -0.12671087639134687, -0.11481336866815885, 0.37396481182426217, -0.053850402138972034, -0.08433398199034854, 0.20415207180505, -0.18454185611878832, -0.07396201815145712, 0.14664314737233022, 0.13526735870788495, 0.1172256410412956, -0.1364248315260435, 0.05310179304079308, -0.029616115822767217, 0.16762362878924855, 0.010307147768326103, 0.07446613632763426, 0.3035681419198712, 0.18791996679423997, 0.02312323801529904, 0.17432349886900436, -0.09630838774920751, -0.04669467587023973, -0.23812933072447776, -0.1558184704153488, -0.17198773889880006, 0.07725015963738163, -0.04839040797485116, -0.23804701981134713, 0.396489661068966, 0.15266740590023498, 0.20568563284973304, -0.05359726481605321, 0.23036066869894664, 0.0637940639963684, 0.07835057825315744, 0.0347558468595768, 0.2459634468331933, 0.1672664369487514, 0.1095725789712742, -0.2609043462931489, 0.12551199160671483, 0.0022790555252383154] |
1,802.0587 | The dynamic impact of monetary policy on regional housing prices in the
US: Evidence based on factor-augmented vector autoregressions | In this study interest centers on regional differences in the response of
housing prices to monetary policy shocks in the US. We address this issue by
analyzing monthly home price data for metropolitan regions using a
factor-augmented vector autoregression (FAVAR) model. Bayesian model estimation
is based on Gibbs sampling with Normal-Gamma shrinkage priors for the
autoregressive coefficients and factor loadings, while monetary policy shocks
are identified using high-frequency surprises around policy announcements as
external instruments. The empirical results indicate that monetary policy
actions typically have sizeable and significant positive effects on regional
housing prices, revealing differences in magnitude and duration. The largest
effects are observed in regions located in states on both the East and West
Coasts, notably California, Arizona and Florida.
| econ.EM | in this study interest centers on regional differences in the response of housing prices to monetary policy shocks in the us we address this issue by analyzing monthly home price data for metropolitan regions using a factoraugmented vector autoregression favar model bayesian model estimation is based on gibbs sampling with normalgamma shrinkage priors for the autoregressive coefficients and factor loadings while monetary policy shocks are identified using highfrequency surprises around policy announcements as external instruments the empirical results indicate that monetary policy actions typically have sizeable and significant positive effects on regional housing prices revealing differences in magnitude and duration the largest effects are observed in regions located in states on both the east and west coasts notably california arizona and florida | [['in', 'this', 'study', 'interest', 'centers', 'on', 'regional', 'differences', 'in', 'the', 'response', 'of', 'housing', 'prices', 'to', 'monetary', 'policy', 'shocks', 'in', 'the', 'us', 'we', 'address', 'this', 'issue', 'by', 'analyzing', 'monthly', 'home', 'price', 'data', 'for', 'metropolitan', 'regions', 'using', 'a', 'factoraugmented', 'vector', 'autoregression', 'favar', 'model', 'bayesian', 'model', 'estimation', 'is', 'based', 'on', 'gibbs', 'sampling', 'with', 'normalgamma', 'shrinkage', 'priors', 'for', 'the', 'autoregressive', 'coefficients', 'and', 'factor', 'loadings', 'while', 'monetary', 'policy', 'shocks', 'are', 'identified', 'using', 'highfrequency', 'surprises', 'around', 'policy', 'announcements', 'as', 'external', 'instruments', 'the', 'empirical', 'results', 'indicate', 'that', 'monetary', 'policy', 'actions', 'typically', 'have', 'sizeable', 'and', 'significant', 'positive', 'effects', 'on', 'regional', 'housing', 'prices', 'revealing', 'differences', 'in', 'magnitude', 'and', 'duration', 'the', 'largest', 'effects', 'are', 'observed', 'in', 'regions', 'located', 'in', 'states', 'on', 'both', 'the', 'east', 'and', 'west', 'coasts', 'notably', 'california', 'arizona', 'and', 'florida']] | [-0.058400274073937906, 0.06850602846825496, -0.07878364364927014, 0.13141637458271968, -0.0672156541259028, -0.10187679235823452, 0.15102018614998086, 0.44267153972759843, -0.20654530225632092, -0.2994327657870599, 0.1792451233040386, -0.3322972956423958, -0.11023365018287828, 0.18012999288815384, -0.1282835519106205, -0.004861525207888917, 0.04112389071427363, -0.04554049669144054, 0.04236112173530273, -0.23344458492162326, 0.25179632497020066, 0.11763341024052351, 0.34172011672053487, 0.01317376244114712, 0.1064192978325688, -0.05476294489732633, -0.07421691573302572, -0.006635813661462938, -0.09343833607302561, 0.11343857285246486, 0.31341577765609446, 0.10564688711892814, 0.4124458575698858, -0.42574498419029017, -0.20235946553293616, 0.10550327592451746, 0.029205582989379763, -0.024668645507578427, -0.0017823001563859484, -0.3227119828457944, -0.04218047694691147, -0.21824911341730815, -0.08683230584138073, -0.05590226840383063, -0.006231462769210339, 0.025041591024394922, -0.3036784985801205, 0.12503523151681292, -0.04669011311295132, 0.1396515933951984, -0.09900657555554063, -0.17893190322599065, -0.05102713588081921, 0.14106603390537203, 0.13184886436987048, -0.04728631209679103, 0.1918127949310777, -0.1266717540139022, -0.167869931946431, 0.31309960451132307, -0.05731111044685046, -0.12412289197867116, 0.12255689476345046, -0.20398600922198967, -0.15292588741673777, 0.08743290534863869, 0.2754411337741961, 0.016267239114192002, -0.15429666724909719, 0.011541895239982598, -0.03297361953688475, 0.12712335387865703, 0.10210920862543087, -0.046182527713244784, 0.21376757038136324, 0.14159007198759355, 0.10079251178734315, 0.11091479645304693, -0.14634590054047295, -0.18286728494567797, -0.22202864412295942, -0.04723280362280396, -0.11662375208300849, -0.04281546937224145, -0.16498829526378056, -0.14039337843617736, 0.3841196834226139, 0.16996026614991327, 0.13235526811137485, 0.02979669379419647, 0.28412460680119694, 0.06617735552814945, 0.05387032698684682, 0.16930005692023162, 0.20296423106337896, 0.0039476942988888675, 0.15927395143274528, -0.17468697944714223, 0.19700761277927087, -0.010446204596276706] |
1,802.05871 | Non-negatively curved GKM orbifolds | In this paper we study non-negatively curved and rationally elliptic GKM$_4$
manifolds and orbifolds. We show that their rational cohomology rings are
isomorphic to the rational cohomology of certain model orbifolds. These models
are quotients of isometric actions of finite groups on non-negatively curved
torus orbifolds.
Moreover, we give a simplified proof of a characterisation of products of
simplices among orbit spaces of locally standard torus manifolds. This
characterisation was originally proved in [Wiemeler, Torus manifolds and
non-negative curvature, arXiv:1401.0403] and was used there to obtain a
classification of non-negatively curved torus manifolds.
| math.DG math.GT | in this paper we study nonnegatively curved and rationally elliptic gkm_4 manifolds and orbifolds we show that their rational cohomology rings are isomorphic to the rational cohomology of certain model orbifolds these models are quotients of isometric actions of finite groups on nonnegatively curved torus orbifolds moreover we give a simplified proof of a characterisation of products of simplices among orbit spaces of locally standard torus manifolds this characterisation was originally proved in wiemeler torus manifolds and nonnegative curvature arxiv14010403 and was used there to obtain a classification of nonnegatively curved torus manifolds | [['in', 'this', 'paper', 'we', 'study', 'nonnegatively', 'curved', 'and', 'rationally', 'elliptic', 'gkm_4', 'manifolds', 'and', 'orbifolds', 'we', 'show', 'that', 'their', 'rational', 'cohomology', 'rings', 'are', 'isomorphic', 'to', 'the', 'rational', 'cohomology', 'of', 'certain', 'model', 'orbifolds', 'these', 'models', 'are', 'quotients', 'of', 'isometric', 'actions', 'of', 'finite', 'groups', 'on', 'nonnegatively', 'curved', 'torus', 'orbifolds', 'moreover', 'we', 'give', 'a', 'simplified', 'proof', 'of', 'a', 'characterisation', 'of', 'products', 'of', 'simplices', 'among', 'orbit', 'spaces', 'of', 'locally', 'standard', 'torus', 'manifolds', 'this', 'characterisation', 'was', 'originally', 'proved', 'in', 'wiemeler', 'torus', 'manifolds', 'and', 'nonnegative', 'curvature', 'arxiv14010403', 'and', 'was', 'used', 'there', 'to', 'obtain', 'a', 'classification', 'of', 'nonnegatively', 'curved', 'torus', 'manifolds']] | [-0.21403712789631552, 0.05561829171816094, -0.10592545660005676, 0.12193617083248683, -0.12057652928762966, -0.17725601259929438, -0.09175754395287691, 0.43515209565973945, -0.23895424612694316, -0.20198866972803242, 0.15887403294392344, -0.251801673674749, -0.16805434332539637, 0.2004273443043025, -0.27037661091114085, -0.025388271713422405, 0.07034370425260729, 0.057499819476571346, -0.10030486506875605, -0.35447898502979014, 0.4887503936058945, -0.04860700536519289, 0.1817213353390495, 0.09809429983918866, 0.1048290497597514, -0.03635602513742116, -0.062219063347826405, 0.04054844059670965, -0.20974644912292004, 0.15859791588607347, 0.31231523839317865, -0.026251273524637023, 0.08983136497877744, -0.3838797437130577, -0.18595287240524258, 0.2344350593785445, 0.1425522713818484, -0.015408048985732926, -0.007623614766958377, -0.2885837165224883, 0.05139969530411893, -0.15128962486568426, -0.19638928995571203, -0.12295289398429708, 0.03868368635368016, 0.022328853097537325, -0.1496334530413151, -0.040526924054655765, 0.14706599486267402, 0.11910505741058539, -0.10063518607575032, -0.05096934636951321, -0.10281792759584883, 0.08427609827679892, -0.01841729309849648, 0.015254851712638306, 0.1270034711031864, -0.022343396452359027, -0.1753730824760472, 0.37434792999799055, -0.03760908658926686, -0.3140962949436572, 0.11472400447560681, -0.16240537987194129, -0.18375092590641645, 0.15276091024279595, 0.1301050156251424, 0.2763316815925969, -0.010755175548709101, 0.1769918192152141, -0.1491682230624267, 0.02982803829945624, 0.11759512850807773, -0.03759772516269651, 0.1362407829043352, 0.07993989506632918, 0.13533779865958626, 0.12612595400100368, 0.06484633462451812, -0.06075234632719205, -0.35750416422055825, -0.20026432304746575, -0.06562538019433203, 0.23948875788547513, -0.12890952040066217, -0.238011442986317, 0.3676641026718749, -0.031198649067017768, 0.16484606777214342, 0.1680798951937403, 0.18835914915220606, -0.037835951118419565, 0.02087453075218946, 0.06687731432418029, 0.11998970757962929, 0.27550733648240566, -0.03851144737564027, -0.04471793286502361, -0.12328227049567633, 0.2642989947771033] |
1,802.05872 | Online Machine Learning in Big Data Streams | The area of online machine learning in big data streams covers algorithms
that are (1) distributed and (2) work from data streams with only a limited
possibility to store past data. The first requirement mostly concerns software
architectures and efficient algorithms. The second one also imposes nontrivial
theoretical restrictions on the modeling methods: In the data stream model,
older data is no longer available to revise earlier suboptimal modeling
decisions as the fresh data arrives.
In this article, we provide an overview of distributed software architectures
and libraries as well as machine learning models for online learning. We
highlight the most important ideas for classification, regression,
recommendation, and unsupervised modeling from streaming data, and we show how
they are implemented in various distributed data stream processing systems.
This article is a reference material and not a survey. We do not attempt to
be comprehensive in describing all existing methods and solutions; rather, we
give pointers to the most important resources in the field. All related
sub-fields, online algorithms, online learning, and distributed data processing
are hugely dominant in current research and development with conceptually new
research results and software components emerging at the time of writing. In
this article, we refer to several survey results, both for distributed data
processing and for online machine learning. Compared to past surveys, our
article is different because we discuss recommender systems in extended detail.
| cs.DC cs.LG stat.ML | the area of online machine learning in big data streams covers algorithms that are 1 distributed and 2 work from data streams with only a limited possibility to store past data the first requirement mostly concerns software architectures and efficient algorithms the second one also imposes nontrivial theoretical restrictions on the modeling methods in the data stream model older data is no longer available to revise earlier suboptimal modeling decisions as the fresh data arrives in this article we provide an overview of distributed software architectures and libraries as well as machine learning models for online learning we highlight the most important ideas for classification regression recommendation and unsupervised modeling from streaming data and we show how they are implemented in various distributed data stream processing systems this article is a reference material and not a survey we do not attempt to be comprehensive in describing all existing methods and solutions rather we give pointers to the most important resources in the field all related subfields online algorithms online learning and distributed data processing are hugely dominant in current research and development with conceptually new research results and software components emerging at the time of writing in this article we refer to several survey results both for distributed data processing and for online machine learning compared to past surveys our article is different because we discuss recommender systems in extended detail | [['the', 'area', 'of', 'online', 'machine', 'learning', 'in', 'big', 'data', 'streams', 'covers', 'algorithms', 'that', 'are', '1', 'distributed', 'and', '2', 'work', 'from', 'data', 'streams', 'with', 'only', 'a', 'limited', 'possibility', 'to', 'store', 'past', 'data', 'the', 'first', 'requirement', 'mostly', 'concerns', 'software', 'architectures', 'and', 'efficient', 'algorithms', 'the', 'second', 'one', 'also', 'imposes', 'nontrivial', 'theoretical', 'restrictions', 'on', 'the', 'modeling', 'methods', 'in', 'the', 'data', 'stream', 'model', 'older', 'data', 'is', 'no', 'longer', 'available', 'to', 'revise', 'earlier', 'suboptimal', 'modeling', 'decisions', 'as', 'the', 'fresh', 'data', 'arrives', 'in', 'this', 'article', 'we', 'provide', 'an', 'overview', 'of', 'distributed', 'software', 'architectures', 'and', 'libraries', 'as', 'well', 'as', 'machine', 'learning', 'models', 'for', 'online', 'learning', 'we', 'highlight', 'the', 'most', 'important', 'ideas', 'for', 'classification', 'regression', 'recommendation', 'and', 'unsupervised', 'modeling', 'from', 'streaming', 'data', 'and', 'we', 'show', 'how', 'they', 'are', 'implemented', 'in', 'various', 'distributed', 'data', 'stream', 'processing', 'systems', 'this', 'article', 'is', 'a', 'reference', 'material', 'and', 'not', 'a', 'survey', 'we', 'do', 'not', 'attempt', 'to', 'be', 'comprehensive', 'in', 'describing', 'all', 'existing', 'methods', 'and', 'solutions', 'rather', 'we', 'give', 'pointers', 'to', 'the', 'most', 'important', 'resources', 'in', 'the', 'field', 'all', 'related', 'subfields', 'online', 'algorithms', 'online', 'learning', 'and', 'distributed', 'data', 'processing', 'are', 'hugely', 'dominant', 'in', 'current', 'research', 'and', 'development', 'with', 'conceptually', 'new', 'research', 'results', 'and', 'software', 'components', 'emerging', 'at', 'the', 'time', 'of', 'writing', 'in', 'this', 'article', 'we', 'refer', 'to', 'several', 'survey', 'results', 'both', 'for', 'distributed', 'data', 'processing', 'and', 'for', 'online', 'machine', 'learning', 'compared', 'to', 'past', 'surveys', 'our', 'article', 'is', 'different', 'because', 'we', 'discuss', 'recommender', 'systems', 'in', 'extended', 'detail']] | [-0.0945104679396607, 0.01331252207455691, -0.08204938940607108, 0.06495127839906124, -0.14760813130735062, -0.1546680584239463, 0.01657372454657054, 0.443386514320389, -0.28768590014343237, -0.3309512884553635, 0.15789951985143527, -0.2979058296020542, -0.13500862047771695, 0.2476105692194678, -0.11906966816601686, 0.07529431810195344, 0.11692695057995263, 0.023191719320103794, -0.03677086294812626, -0.3045838293639612, 0.29155785265606443, 0.06331974100543275, 0.3185515532197503, 0.010361080140568864, 0.04265682845884426, -0.005873679012076292, -0.11463472001643618, -0.02569982406856629, -0.1183275237431091, 0.17763308739870207, 0.38740921101615844, 0.2540132914895587, 0.33210292577469375, -0.44320029206977135, -0.18356518309716602, 0.08206355783310255, 0.19035303863511296, 0.1339633502287879, -0.09530693017907876, -0.2522424393115783, 0.04737772025446129, -0.182398041583259, -0.024801948843564178, -0.10362874877788288, 0.01237580165906015, 0.021752613281137693, -0.2299419044067446, 0.00793113045248303, 0.06425686632595488, 0.10063645152918878, -0.07768266633237628, -0.14163959654475444, 0.08055355724146855, 0.1382874360981345, 0.06970593713902898, 0.0342671520387133, 0.12652922402946398, -0.15493728004666085, -0.16257793821184796, 0.37767903858320023, -0.03232121425257488, -0.1433551208508197, 0.21307917359361658, -0.03032156941934501, -0.23085848774531154, 0.05724255464168757, 0.26945753124803584, 0.07724668995832049, -0.21238028967664355, 0.04849183337497868, 0.0009062788106533356, 0.16874092860294515, -0.005989671140018189, 0.017710176263774597, 0.17463597084130503, 0.21921470314586833, 0.036265412496433856, 0.09749764758131962, -0.053149727984529105, -0.10439772418905775, -0.2442550413306496, -0.12782865042397068, -0.16354564652431483, -0.040314029736794106, -0.05748768509407195, -0.13341515683831073, 0.3552544986933986, 0.2520710068746788, 0.17991500869756202, 0.04967676833255853, 0.3822902408105954, 0.013430088692953512, 0.10750489741426719, 0.1627945642438576, 0.1670303936136556, 0.027211816727437756, 0.19926016158686377, -0.10077316972975885, 0.05798179499837227, -0.0548831595725771] |
1,802.05873 | A Reallocation Algorithm for Online Split Packing of Circles | The Split Packing algorithm \cite{splitpacking_ws, splitpackingsoda,
splitpacking} is an offline algorithm that packs a set of circles into
triangles and squares up to critical density. In this paper, we develop an
online alternative to Split Packing to handle an online sequence of insertions
and deletions, where the algorithm is allowed to reallocate circles into new
positions at a cost proportional to their areas. The algorithm can be used to
pack circles into squares and right angled triangles. If only insertions are
considered, our algorithm is also able to pack to critical density, with an
amortised reallocation cost of $O(c\log \frac{1}{c})$ for squares, and
$O(c(1+s^2)\log_{1+s^2}\frac{1}{c})$ for right angled triangles, where $s$ is
the ratio of the lengths of the second shortest side to the shortest side of
the triangle, when inserting a circle of area $c$. When insertions and
deletions are considered, we achieve a packing density of $(1-\epsilon)$ of the
critical density, where $\epsilon>0$ can be made arbitrarily small, with an
amortised reallocation cost of $O(c(1+s^2)\log_{1+s^2}\frac{1}{c} +
c\frac{1}{\epsilon})$.
| cs.CG cs.DS | the split packing algorithm citesplitpacking_ws splitpackingsoda splitpacking is an offline algorithm that packs a set of circles into triangles and squares up to critical density in this paper we develop an online alternative to split packing to handle an online sequence of insertions and deletions where the algorithm is allowed to reallocate circles into new positions at a cost proportional to their areas the algorithm can be used to pack circles into squares and right angled triangles if only insertions are considered our algorithm is also able to pack to critical density with an amortised reallocation cost of oclog frac1c for squares and oc1s2log_1s2frac1c for right angled triangles where s is the ratio of the lengths of the second shortest side to the shortest side of the triangle when inserting a circle of area c when insertions and deletions are considered we achieve a packing density of 1epsilon of the critical density where epsilon0 can be made arbitrarily small with an amortised reallocation cost of oc1s2log_1s2frac1c cfrac1epsilon | [['the', 'split', 'packing', 'algorithm', 'citesplitpacking_ws', 'splitpackingsoda', 'splitpacking', 'is', 'an', 'offline', 'algorithm', 'that', 'packs', 'a', 'set', 'of', 'circles', 'into', 'triangles', 'and', 'squares', 'up', 'to', 'critical', 'density', 'in', 'this', 'paper', 'we', 'develop', 'an', 'online', 'alternative', 'to', 'split', 'packing', 'to', 'handle', 'an', 'online', 'sequence', 'of', 'insertions', 'and', 'deletions', 'where', 'the', 'algorithm', 'is', 'allowed', 'to', 'reallocate', 'circles', 'into', 'new', 'positions', 'at', 'a', 'cost', 'proportional', 'to', 'their', 'areas', 'the', 'algorithm', 'can', 'be', 'used', 'to', 'pack', 'circles', 'into', 'squares', 'and', 'right', 'angled', 'triangles', 'if', 'only', 'insertions', 'are', 'considered', 'our', 'algorithm', 'is', 'also', 'able', 'to', 'pack', 'to', 'critical', 'density', 'with', 'an', 'amortised', 'reallocation', 'cost', 'of', 'oclog', 'frac1c', 'for', 'squares', 'and', 'oc1s2log_1s2frac1c', 'for', 'right', 'angled', 'triangles', 'where', 's', 'is', 'the', 'ratio', 'of', 'the', 'lengths', 'of', 'the', 'second', 'shortest', 'side', 'to', 'the', 'shortest', 'side', 'of', 'the', 'triangle', 'when', 'inserting', 'a', 'circle', 'of', 'area', 'c', 'when', 'insertions', 'and', 'deletions', 'are', 'considered', 'we', 'achieve', 'a', 'packing', 'density', 'of', '1epsilon', 'of', 'the', 'critical', 'density', 'where', 'epsilon0', 'can', 'be', 'made', 'arbitrarily', 'small', 'with', 'an', 'amortised', 'reallocation', 'cost', 'of', 'oc1s2log_1s2frac1c', 'cfrac1epsilon']] | [-0.14505997550332492, 0.11712477658305864, -0.04013196619296944, 0.02983830128695168, -0.0655177089165873, -0.18066314422751065, 0.10017531619534498, 0.4084510845508172, -0.3067963795724863, -0.31110402911623813, 0.12781894655814335, -0.3315605219939481, -0.1086038275873462, 0.10937942745952552, -0.1150563951463855, 0.056900243469375125, 0.02197352838080654, 0.08711805779946771, -0.0019095701477143288, -0.32996446370893384, 0.20899245829064028, 0.025758291721945593, 0.18723472715673609, 0.07828337041609082, 0.07580662044690725, 0.03804118248130779, 0.043363521535018955, 0.07744307918705462, -0.14282833097195463, 0.11693137574374028, 0.24472080633877227, 0.137112913563593, 0.2807438088731366, -0.44529264406387853, -0.07362649991807545, 0.1320099504057156, 0.18060427843535215, 0.0492192859535817, -0.003053061351735399, -0.211396625311756, 0.1303105981071821, -0.0855358944915131, -0.08883741233202842, -0.01937444507678022, 0.05072068227512866, -0.002322031667684523, -0.3159712463767725, -0.007466099119596241, 0.023972218925630825, -0.04240238462337611, 0.0129656506476704, -0.14313595297729007, 0.016895551355960575, 0.15942562385917763, 0.03298490698686483, 0.08192100121657023, 0.08998771170906214, -0.08914408426202533, -0.11564251875956051, 0.38423573007078277, 0.0030061104190275537, -0.20463691216818294, 0.09070922960657395, -0.09766057386751407, -0.13892786733817702, 0.17457405988543484, 0.2072779782324659, 0.11610740497824013, -0.10835994385064995, 0.056397728973013345, -0.06870042875420695, 0.18666172230483166, 0.1338326541868889, -0.03387156008138619, 0.16849181612213113, 0.1309876965101438, 0.20431643209032577, 0.17992308002214022, -0.08272552651046595, -0.06237632508233467, -0.2691011370929039, -0.1745340134485723, -0.2028879291811672, -0.0024293626436995494, -0.1382088703850844, -0.2363983205872478, 0.34997564911703516, 0.07390659512454494, 0.24686633094983257, 0.12763742697627647, 0.3307267936027568, 0.09049359602524294, 0.0784260381948816, 0.15307686600533332, 0.10276961442291366, 0.05819500536189316, -0.005540040657155632, -0.17827758146323386, 0.041503184929096736, 0.11343589771006789] |
1,802.05874 | Constrained Convolutional-Recurrent Networks to Improve Speech Quality
with Low Impact on Recognition Accuracy | For a speech-enhancement algorithm, it is highly desirable to simultaneously
improve perceptual quality and recognition rate. Thanks to computational costs
and model complexities, it is challenging to train a model that effectively
optimizes both metrics at the same time. In this paper, we propose a method for
speech enhancement that combines local and global contextual structures
information through convolutional-recurrent neural networks that improves
perceptual quality. At the same time, we introduce a new constraint on the
objective function using a language model/decoder that limits the impact on
recognition rate. Based on experiments conducted with real user data, we
demonstrate that our new context-augmented machine-learning approach for speech
enhancement improves PESQ and WER by an additional 24.5% and 51.3%,
respectively, when compared to the best-performing methods in the literature.
| cs.LG | for a speechenhancement algorithm it is highly desirable to simultaneously improve perceptual quality and recognition rate thanks to computational costs and model complexities it is challenging to train a model that effectively optimizes both metrics at the same time in this paper we propose a method for speech enhancement that combines local and global contextual structures information through convolutionalrecurrent neural networks that improves perceptual quality at the same time we introduce a new constraint on the objective function using a language modeldecoder that limits the impact on recognition rate based on experiments conducted with real user data we demonstrate that our new contextaugmented machinelearning approach for speech enhancement improves pesq and wer by an additional 245 and 513 respectively when compared to the bestperforming methods in the literature | [['for', 'a', 'speechenhancement', 'algorithm', 'it', 'is', 'highly', 'desirable', 'to', 'simultaneously', 'improve', 'perceptual', 'quality', 'and', 'recognition', 'rate', 'thanks', 'to', 'computational', 'costs', 'and', 'model', 'complexities', 'it', 'is', 'challenging', 'to', 'train', 'a', 'model', 'that', 'effectively', 'optimizes', 'both', 'metrics', 'at', 'the', 'same', 'time', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'for', 'speech', 'enhancement', 'that', 'combines', 'local', 'and', 'global', 'contextual', 'structures', 'information', 'through', 'convolutionalrecurrent', 'neural', 'networks', 'that', 'improves', 'perceptual', 'quality', 'at', 'the', 'same', 'time', 'we', 'introduce', 'a', 'new', 'constraint', 'on', 'the', 'objective', 'function', 'using', 'a', 'language', 'modeldecoder', 'that', 'limits', 'the', 'impact', 'on', 'recognition', 'rate', 'based', 'on', 'experiments', 'conducted', 'with', 'real', 'user', 'data', 'we', 'demonstrate', 'that', 'our', 'new', 'contextaugmented', 'machinelearning', 'approach', 'for', 'speech', 'enhancement', 'improves', 'pesq', 'and', 'wer', 'by', 'an', 'additional', '245', 'and', '513', 'respectively', 'when', 'compared', 'to', 'the', 'bestperforming', 'methods', 'in', 'the', 'literature']] | [-0.03354104670882225, -0.033903508792514914, -0.06907586372643709, 0.046512441352941095, -0.09810224852710962, -0.13814880699291826, 0.08826977030280977, 0.44803258913755417, -0.24103293681144713, -0.3427214965941384, 0.06545358625985682, -0.2577153797745705, -0.2191369203850627, 0.23992897240258754, -0.13576741448044777, 0.10454716265201569, 0.12196233974397183, 0.05487347054108977, -0.07630800010822714, -0.31867899946682154, 0.26975907742232086, 0.10100419599562883, 0.39048223009705546, 0.06864701541885733, 0.1664476266670972, -0.029962383590638637, -0.00823160756379366, -0.02204282911121845, -0.06641188514936948, 0.16397072062641382, 0.24908696347288786, 0.20977993708848952, 0.3195357178747654, -0.3740908772274852, -0.20613643476553262, 0.05888757271133363, 0.12529557114839554, 0.09917924867384136, -0.04455393119249493, -0.32031245428323746, 0.13008616055734457, -0.14766069098562, 0.053222642639651895, -0.11719214750081301, -0.02927310327813029, -0.017086197458207608, -0.3313227873658761, 0.05855700594559312, 0.05307095505297184, 0.06524986093491315, -0.06936937641724944, -0.1027429355494678, 0.047673305766656994, 0.1547781795144547, 0.041845423886552456, 0.08584469076897949, 0.11916142800077796, -0.16300433601764963, -0.15085882332921027, 0.3781721461415291, -0.13457488644309343, -0.23470225168205797, 0.21559778618253767, -0.04128603195399046, -0.15674468676000833, 0.13518404227867722, 0.2630496684415266, 0.09048035598173737, -0.1551127412157366, 0.008246828557457776, -0.006390213862061501, 0.24698946640081704, 0.04062273392640054, 0.02182053252309561, 0.12100595246255398, 0.25342834645323453, 0.053301773615181444, 0.14780697592534126, -0.10293453715974465, -0.017099446512758732, -0.20393071536719798, -0.11615296567603946, -0.17623574350774288, -0.054235731326043604, -0.10040490722598042, -0.09739018288254737, 0.41431797491014005, 0.2343145041167736, 0.2033626717259176, 0.15803732458874584, 0.3673192112594843, 0.06737490338552743, 0.09303178239986301, 0.09746700251474977, 0.20621917658112943, -0.021132398921996354, 0.1160058811455965, -0.22111151091754436, 0.09294690867327153, 0.038118423871696] |
1,802.05875 | Detecting truth, just on parts | We introduce and discuss, through a computational algebraic geometry
approach, the automatic reasoning handling of propositions that are
simultaneously true and false over some relevant collections of instances. A
rigorous, algorithmic criterion is presented for detecting such cases, and its
performance is exemplified through the implementation of this test on the
dynamic geometry program GeoGebra.
| cs.AI | we introduce and discuss through a computational algebraic geometry approach the automatic reasoning handling of propositions that are simultaneously true and false over some relevant collections of instances a rigorous algorithmic criterion is presented for detecting such cases and its performance is exemplified through the implementation of this test on the dynamic geometry program geogebra | [['we', 'introduce', 'and', 'discuss', 'through', 'a', 'computational', 'algebraic', 'geometry', 'approach', 'the', 'automatic', 'reasoning', 'handling', 'of', 'propositions', 'that', 'are', 'simultaneously', 'true', 'and', 'false', 'over', 'some', 'relevant', 'collections', 'of', 'instances', 'a', 'rigorous', 'algorithmic', 'criterion', 'is', 'presented', 'for', 'detecting', 'such', 'cases', 'and', 'its', 'performance', 'is', 'exemplified', 'through', 'the', 'implementation', 'of', 'this', 'test', 'on', 'the', 'dynamic', 'geometry', 'program', 'geogebra']] | [-0.11889433102174239, -0.02060735049572858, -0.06247461666776375, 0.10810960292689163, -0.10557974590073255, -0.15654961934990502, 0.09047710488296368, 0.3657936581833796, -0.25820755366743964, -0.3208200321278789, 0.15505981278521094, -0.1940585610372099, -0.1895982880483974, 0.2587852372195233, -0.12370003061369061, 0.07467090621146119, 0.09091875927353447, 0.027077237584374168, -0.04926819396205247, -0.27388664036565885, 0.29688100610775026, 0.03922602781517939, 0.25277605502527545, 0.0745855374473401, 0.13916727213006447, 0.06019843444228172, -0.07283400892364708, 0.061415509691439434, -0.08931477663850687, 0.1828504527495666, 0.3138149871744893, 0.2800410601479763, 0.3084917094685476, -0.3657327931543643, -0.15771709602664818, 0.037796746884388, 0.08141714477572928, 0.1215064689813351, -0.04593299433631314, -0.3203973081640222, 0.11009170236065983, -0.1350401049310511, -0.08588419436815788, -0.1674649209969423, 0.002494845370000059, -0.0007851938971064307, -0.22384834120219405, 0.01176483788612214, 0.09140900695611807, 0.12954645395617592, -0.02147507497575134, -0.09142981150229886, 0.07217394422358749, 0.1037410408851098, 0.036933017005635935, -0.054290331925519485, 0.13035798867825757, -0.11569410783916034, -0.16125052012503147, 0.38160908127372917, 0.06519000838426027, -0.24878230295144022, 0.21759562843733213, -0.03934302492575212, -0.14406236986502666, 0.10514829290861433, 0.1869894069026817, 0.1426372700667178, -0.1355981938710267, 0.10969377791360867, -0.04202991264279593, 0.14743519873273644, 0.07412966824433004, 0.020573230646550655, 0.19906436779366976, 0.22038149830292572, 0.008386285600929775, 0.1863592798355967, -0.05135968864302744, -0.10008142690428279, -0.352255405113101, -0.20063386032865807, -0.11564031300896949, -0.0064630921930074695, -0.10069970001641196, -0.17575654508545996, 0.4035125675018538, 0.20449465650387785, 0.12764336659827016, 0.10037202538753098, 0.3527791576629335, 0.055899872656234285, 0.013820007333362644, 0.06290335614572871, 0.15850490925420838, 0.09342654269527305, 0.06923807837196033, -0.1810630105774511, 0.1023579923901707, 0.07516996095126326] |
1,802.05876 | The design optimization and experimental investigation of the 4420 nm
Raman laser based on hydrogen-filled revolver silica fiber | Optical properties of hollow-core revolver fibers are numerically
investigated depending on various parameters: the hollow-core diameter, the
capillary wall thickness, the values of the minimum gap between the
capillaries, the number of capillaries in the cladding and the type of glass
(silica and chalcogenide). Preliminary, similar calculations are made for
simple models of hollow-core fibers. Based on the obtained results, the optimal
design of the revolver fiber for Raman laser frequency conversion (1560 nm to
4420 nm in H2) was determined. As a result, efficient ns-pulsed 4420 nm Raman
laser based on H2-filled revolver silica fiber is realized. Quantum efficiency
as high as 36 % is achieved and output average power as high as 250 mW is
demonstrated.
| physics.optics | optical properties of hollowcore revolver fibers are numerically investigated depending on various parameters the hollowcore diameter the capillary wall thickness the values of the minimum gap between the capillaries the number of capillaries in the cladding and the type of glass silica and chalcogenide preliminary similar calculations are made for simple models of hollowcore fibers based on the obtained results the optimal design of the revolver fiber for raman laser frequency conversion 1560 nm to 4420 nm in h2 was determined as a result efficient nspulsed 4420 nm raman laser based on h2filled revolver silica fiber is realized quantum efficiency as high as 36 is achieved and output average power as high as 250 mw is demonstrated | [['optical', 'properties', 'of', 'hollowcore', 'revolver', 'fibers', 'are', 'numerically', 'investigated', 'depending', 'on', 'various', 'parameters', 'the', 'hollowcore', 'diameter', 'the', 'capillary', 'wall', 'thickness', 'the', 'values', 'of', 'the', 'minimum', 'gap', 'between', 'the', 'capillaries', 'the', 'number', 'of', 'capillaries', 'in', 'the', 'cladding', 'and', 'the', 'type', 'of', 'glass', 'silica', 'and', 'chalcogenide', 'preliminary', 'similar', 'calculations', 'are', 'made', 'for', 'simple', 'models', 'of', 'hollowcore', 'fibers', 'based', 'on', 'the', 'obtained', 'results', 'the', 'optimal', 'design', 'of', 'the', 'revolver', 'fiber', 'for', 'raman', 'laser', 'frequency', 'conversion', '1560', 'nm', 'to', '4420', 'nm', 'in', 'h2', 'was', 'determined', 'as', 'a', 'result', 'efficient', 'nspulsed', '4420', 'nm', 'raman', 'laser', 'based', 'on', 'h2filled', 'revolver', 'silica', 'fiber', 'is', 'realized', 'quantum', 'efficiency', 'as', 'high', 'as', '36', 'is', 'achieved', 'and', 'output', 'average', 'power', 'as', 'high', 'as', '250', 'mw', 'is', 'demonstrated']] | [-0.09652285865138702, 0.17764756095230355, -0.015280123800039291, -0.08201991578118459, -0.007103006628438316, -0.15811819738531807, 0.035029904246490835, 0.5257400910526611, -0.18883047686440163, -0.2732876516429001, 0.08348864021285533, -0.2575532855016404, -0.08425112317139603, 0.2793728796472163, -0.020017839936089927, 0.10678150959160873, 0.007401911106265696, -0.07242929078397695, -0.003585715561398658, -0.1668891232231921, 0.20336643390453837, 0.0840352520151947, 0.3719404451709626, 0.09358228117243611, 0.12914925068215435, -0.028566394539164573, 0.06885429089567785, -0.07733621645783043, -0.21500753539871295, 0.12300732103778564, 0.2228665340882548, -0.04524673189534324, 0.21722499841567258, -0.4124824139610704, -0.22277856708889635, 0.005286822798019597, 0.11097123504993667, 0.056650622631423175, -0.02495526842640488, -0.22428988178806572, 0.0997865722065085, -0.11233495924509419, -0.12871797600407794, 0.013487061573963227, 0.003053696908393939, 0.08231887267902493, -0.22887359854588607, -0.010138592313461262, 0.004394831940740475, 0.12168294149755796, -0.045544725393169914, -0.13002684319809335, -0.08419457326165465, 0.02421924765101345, -0.0712817635945173, -0.02089054744032308, 0.2302226184963666, -0.11080036539953717, -0.06240565182865951, 0.3975308664496346, -0.11947509916980975, -0.06583204691710777, 0.11958139658311447, -0.08970725442612029, 0.051072285237625754, 0.2010905653868545, 0.13529077680492452, 0.11419216638776185, -0.057981260517282925, -0.021435976752525614, -0.008156063296061394, 0.27424717323296577, 0.2248099007912719, 0.1062760025840895, 0.166762393650374, 0.26286656236484773, -0.028212462648235518, 0.17166520066856375, -0.14305292571175257, -0.002542015714049018, -0.24282258452751257, -0.14675625880120385, -0.20700137060013166, 0.049830415099457806, -0.143412135494898, -0.11691051417688743, 0.3502173232203671, 0.021324727748488558, 0.16046208239577966, 0.012427485598138822, 0.26578848600259114, 0.08124123878500039, 0.08633126731126986, -0.045187361413966225, 0.35138311499432695, 0.2094074999512141, 0.0992988684206623, -0.23900178850002202, -0.03390498663266671, 0.021279592885924823] |
1,802.05877 | Exact analytical solution of Entanglement of Formation and Quantum
Discord for Werner state and Generalized Werner-Like states | We obtained analytical expressions for Entangled of Formation (EoF) and
Quantum Discord (QD) of Werner states and Generalized Werner-Like states. The
optimization problem involved under the exact analytical form is obtained for
both quantities. In order to illustrate the importance of our results we
studied the EoF and the QD of these states. Using discrete formulation of
continue states with the $f-$deformed coherent states obtained as deformed
annihilation operator coherent states and as deformed displacement operator
coherent states. The EoF and QD of bipartite Werner-Like states $f-$deformed
coherent states are studied for the P\"{o}schl-Teller, Morse and quantum dot
deformed potentials. The result obtained are compared with the case of
bipartite Werner-Like coherent states.
| quant-ph | we obtained analytical expressions for entangled of formation eof and quantum discord qd of werner states and generalized wernerlike states the optimization problem involved under the exact analytical form is obtained for both quantities in order to illustrate the importance of our results we studied the eof and the qd of these states using discrete formulation of continue states with the fdeformed coherent states obtained as deformed annihilation operator coherent states and as deformed displacement operator coherent states the eof and qd of bipartite wernerlike states fdeformed coherent states are studied for the poschlteller morse and quantum dot deformed potentials the result obtained are compared with the case of bipartite wernerlike coherent states | [['we', 'obtained', 'analytical', 'expressions', 'for', 'entangled', 'of', 'formation', 'eof', 'and', 'quantum', 'discord', 'qd', 'of', 'werner', 'states', 'and', 'generalized', 'wernerlike', 'states', 'the', 'optimization', 'problem', 'involved', 'under', 'the', 'exact', 'analytical', 'form', 'is', 'obtained', 'for', 'both', 'quantities', 'in', 'order', 'to', 'illustrate', 'the', 'importance', 'of', 'our', 'results', 'we', 'studied', 'the', 'eof', 'and', 'the', 'qd', 'of', 'these', 'states', 'using', 'discrete', 'formulation', 'of', 'continue', 'states', 'with', 'the', 'fdeformed', 'coherent', 'states', 'obtained', 'as', 'deformed', 'annihilation', 'operator', 'coherent', 'states', 'and', 'as', 'deformed', 'displacement', 'operator', 'coherent', 'states', 'the', 'eof', 'and', 'qd', 'of', 'bipartite', 'wernerlike', 'states', 'fdeformed', 'coherent', 'states', 'are', 'studied', 'for', 'the', 'poschlteller', 'morse', 'and', 'quantum', 'dot', 'deformed', 'potentials', 'the', 'result', 'obtained', 'are', 'compared', 'with', 'the', 'case', 'of', 'bipartite', 'wernerlike', 'coherent', 'states']] | [-0.1245281829033047, 0.20500373352829993, -0.07125022020850298, 0.11221422085773397, 0.108904082014893, -0.19665451061837705, 0.033665093815827794, 0.35271090730629134, -0.22607590589441556, -0.22026427148890773, 0.010543650571479404, -0.2801420238709687, -0.11752924581359149, 0.19891064429441385, 0.008206589332888875, 0.140225112912105, 0.10046413147500592, 0.020292292406733057, -0.059306748046547966, -0.18387077685931813, 0.36438877349801824, -0.003901134680882426, 0.286833391895732, 0.05757055875579456, 0.03657865147642066, 0.04335031139178086, 0.08574029404373296, -0.005816408729724652, -0.14858058438042954, 0.1473833591022026, 0.2682440518174914, 0.07162527664177186, 0.1701110014609531, -0.464136959490391, -0.17533201060002357, 0.07096576453722288, 0.13116304838614729, 0.18803915500113394, -0.023848260575658187, -0.426737584186042, -0.041604798781660804, -0.19244411291010613, -0.16641604037444413, -0.11660958016785768, 0.023631402784319744, -0.032746940010548696, -0.26966483788812057, 0.15636040719506222, 0.03857748804663399, -0.020831823844536808, -0.09595951679022571, -0.10022332059812888, -0.0910669965422259, 0.10523442791329812, -0.10686041938297583, -0.05838320902095432, 0.1481067973592904, -0.12411647033671626, -0.20004799877977478, 0.3047630013403507, -0.04497155105072873, -0.21059494913943047, 0.11879897157793486, -0.11585149862515055, -0.06331593132025637, 0.027217253844822403, 0.07858621994181808, 0.1496578825439895, -0.0780515384456489, 0.08604753085935439, -0.03930338699601393, 0.10194251583518246, 0.09798441868506175, 0.16899147647869797, 0.12180988686118044, 0.01515282643134747, 0.07374157845166272, 0.2619490029508726, -0.03874524228328394, -0.23340212548382383, -0.3010297602916186, -0.16334525083162846, -0.24499851901216052, 0.09477776377379432, -0.04590180543492408, -0.14450178283835408, 0.44820833747456496, -0.02237609973325666, 0.12710917102939456, 0.040382423627693044, 0.19558780520239566, 0.18839668565681122, -0.025672533217636226, 0.04611682983741692, 0.25373715713653155, 0.28280410984844234, 0.0276385371787556, -0.2941204530673217, -0.01944712783514926, 0.029469514735438657] |
1,802.05878 | SpaRTA - Tracking across occlusions via global partitioning of 3D clouds
of points | Any 3D tracking algorithm has to deal with occlusions: multiple targets get
so close to each other that the loss of their identities becomes likely. In the
best case scenario, trajectories are interrupted, thus curbing the completeness
of the data-set; in the worse case scenario, identity switches arise,
potentially affecting in severe ways the very quality of the data. Here, we
present a novel tracking method that addresses the problem of occlusions within
large groups of featureless objects by means of three steps: i) it represents
each target as a cloud of points in 3D; ii) once a 3D cluster corresponding to
an occlusion occurs, it defines a partitioning problem by introducing a cost
function that uses both attractive and repulsive spatio-temporal proximity
links; iii) it minimizes the cost function through a semi-definite optimization
technique specifically designed to cope with link frustration. The algorithm is
independent of the specific experimental method used to collect the data. By
performing tests on public data-sets, we show that the new algorithm produces a
significant improvement over the state-of-the-art tracking methods, both by
reducing the number of identity switches and by increasing the accuracy of the
actual positions of the targets in real space.
| cs.CV | any 3d tracking algorithm has to deal with occlusions multiple targets get so close to each other that the loss of their identities becomes likely in the best case scenario trajectories are interrupted thus curbing the completeness of the dataset in the worse case scenario identity switches arise potentially affecting in severe ways the very quality of the data here we present a novel tracking method that addresses the problem of occlusions within large groups of featureless objects by means of three steps i it represents each target as a cloud of points in 3d ii once a 3d cluster corresponding to an occlusion occurs it defines a partitioning problem by introducing a cost function that uses both attractive and repulsive spatiotemporal proximity links iii it minimizes the cost function through a semidefinite optimization technique specifically designed to cope with link frustration the algorithm is independent of the specific experimental method used to collect the data by performing tests on public datasets we show that the new algorithm produces a significant improvement over the stateoftheart tracking methods both by reducing the number of identity switches and by increasing the accuracy of the actual positions of the targets in real space | [['any', '3d', 'tracking', 'algorithm', 'has', 'to', 'deal', 'with', 'occlusions', 'multiple', 'targets', 'get', 'so', 'close', 'to', 'each', 'other', 'that', 'the', 'loss', 'of', 'their', 'identities', 'becomes', 'likely', 'in', 'the', 'best', 'case', 'scenario', 'trajectories', 'are', 'interrupted', 'thus', 'curbing', 'the', 'completeness', 'of', 'the', 'dataset', 'in', 'the', 'worse', 'case', 'scenario', 'identity', 'switches', 'arise', 'potentially', 'affecting', 'in', 'severe', 'ways', 'the', 'very', 'quality', 'of', 'the', 'data', 'here', 'we', 'present', 'a', 'novel', 'tracking', 'method', 'that', 'addresses', 'the', 'problem', 'of', 'occlusions', 'within', 'large', 'groups', 'of', 'featureless', 'objects', 'by', 'means', 'of', 'three', 'steps', 'i', 'it', 'represents', 'each', 'target', 'as', 'a', 'cloud', 'of', 'points', 'in', '3d', 'ii', 'once', 'a', '3d', 'cluster', 'corresponding', 'to', 'an', 'occlusion', 'occurs', 'it', 'defines', 'a', 'partitioning', 'problem', 'by', 'introducing', 'a', 'cost', 'function', 'that', 'uses', 'both', 'attractive', 'and', 'repulsive', 'spatiotemporal', 'proximity', 'links', 'iii', 'it', 'minimizes', 'the', 'cost', 'function', 'through', 'a', 'semidefinite', 'optimization', 'technique', 'specifically', 'designed', 'to', 'cope', 'with', 'link', 'frustration', 'the', 'algorithm', 'is', 'independent', 'of', 'the', 'specific', 'experimental', 'method', 'used', 'to', 'collect', 'the', 'data', 'by', 'performing', 'tests', 'on', 'public', 'datasets', 'we', 'show', 'that', 'the', 'new', 'algorithm', 'produces', 'a', 'significant', 'improvement', 'over', 'the', 'stateoftheart', 'tracking', 'methods', 'both', 'by', 'reducing', 'the', 'number', 'of', 'identity', 'switches', 'and', 'by', 'increasing', 'the', 'accuracy', 'of', 'the', 'actual', 'positions', 'of', 'the', 'targets', 'in', 'real', 'space']] | [-0.13532618694545817, 0.03411383875652973, -0.06329582958947867, 0.04881188954750541, -0.061287845254410056, -0.17226906426018104, 0.08352343089296482, 0.38840877611190083, -0.2632563278684393, -0.35896712813526394, 0.08212441163545009, -0.28166933765169233, -0.1581250694085611, 0.18244379518087953, -0.11589759459835478, 0.044078365257009866, 0.11212110074935482, 0.017583059621974827, -0.06178609252732713, -0.26582538372138514, 0.31370564551325514, 0.0578920544940047, 0.2741645112796687, 0.018135422689374535, 0.12659592461655847, 0.018190574645996094, -0.04959847822639858, 0.03605698108192883, -0.04615733928469126, 0.11849624475464225, 0.23928370436886326, 0.17204466259481704, 0.30657299256883563, -0.4087910099513829, -0.18499543686397374, 0.11252554991515354, 0.12959806665079668, 0.10736315892027051, -0.04794702443585266, -0.30321111478609963, 0.07578445345337968, -0.14863888267776929, -0.11172255268553272, -0.0673376050835941, -0.009233611046802252, 0.009999391358578578, -0.2757224910473451, 0.05834822082426399, 0.0165620496874908, 0.03260354974772781, -0.058875345278647725, -0.08084631021716632, 0.008071838396135718, 0.17137913913291414, 0.04583110261126421, 0.04223312901798636, 0.11866316228697542, -0.16770568948355502, -0.11318846413458232, 0.3977416339237243, -0.024894593864737545, -0.21732171291369012, 0.19480605523916894, -0.07770629664417356, -0.12427756636054255, 0.1824108793027699, 0.17794587524607777, 0.12930571031727595, -0.1360087782877963, 0.038739336665603336, -0.0335169200738892, 0.15307265482260846, 0.039085329099325467, -0.005547059843083843, 0.17619543864624576, 0.19946981043554843, 0.11185616430389927, 0.16414376329426886, -0.13190134734264575, -0.06719675163854845, -0.2453352658895892, -0.12237293227924965, -0.18548991937423126, -0.03785596107365564, -0.11580886440890026, -0.1474172542488668, 0.37060273304814473, 0.18923571005005216, 0.23052717888029292, 0.048477199615444985, 0.3596407346846536, 0.06794774835172575, 0.10513352297828532, 0.05777515353867784, 0.18288565018912778, 0.020850478161592037, 0.09599004725751001, -0.20825433510704897, 0.09840129610849545, 0.032198358695022765] |
1,802.05879 | Joint Estimation of Room Geometry and Modes with Compressed Sensing | Acoustical behavior of a room for a given position of microphone and sound
source is usually described using the room impulse response. If we rely on the
standard uniform sampling, the estimation of room impulse response for
arbitrary positions in the room requires a large number of measurements. In
order to lower the required sampling rate, some solutions have emerged that
exploit the sparse representation of the room wavefield in the terms of plane
waves in the low-frequency domain. The plane wave representation has a simple
form in rectangular rooms. In our solution, we observe the basic axial modes of
the wave vector grid for extraction of the room geometry and then we propagate
the knowledge to higher order modes out of the low-pass version of the
measurements. Estimation of the approximate structure of the $k$-space should
lead to the reduction in the terms of number of required measurements and in
the increase of the speed of the reconstruction without great losses of
quality.
| eess.AS cs.CV eess.SP | acoustical behavior of a room for a given position of microphone and sound source is usually described using the room impulse response if we rely on the standard uniform sampling the estimation of room impulse response for arbitrary positions in the room requires a large number of measurements in order to lower the required sampling rate some solutions have emerged that exploit the sparse representation of the room wavefield in the terms of plane waves in the lowfrequency domain the plane wave representation has a simple form in rectangular rooms in our solution we observe the basic axial modes of the wave vector grid for extraction of the room geometry and then we propagate the knowledge to higher order modes out of the lowpass version of the measurements estimation of the approximate structure of the kspace should lead to the reduction in the terms of number of required measurements and in the increase of the speed of the reconstruction without great losses of quality | [['acoustical', 'behavior', 'of', 'a', 'room', 'for', 'a', 'given', 'position', 'of', 'microphone', 'and', 'sound', 'source', 'is', 'usually', 'described', 'using', 'the', 'room', 'impulse', 'response', 'if', 'we', 'rely', 'on', 'the', 'standard', 'uniform', 'sampling', 'the', 'estimation', 'of', 'room', 'impulse', 'response', 'for', 'arbitrary', 'positions', 'in', 'the', 'room', 'requires', 'a', 'large', 'number', 'of', 'measurements', 'in', 'order', 'to', 'lower', 'the', 'required', 'sampling', 'rate', 'some', 'solutions', 'have', 'emerged', 'that', 'exploit', 'the', 'sparse', 'representation', 'of', 'the', 'room', 'wavefield', 'in', 'the', 'terms', 'of', 'plane', 'waves', 'in', 'the', 'lowfrequency', 'domain', 'the', 'plane', 'wave', 'representation', 'has', 'a', 'simple', 'form', 'in', 'rectangular', 'rooms', 'in', 'our', 'solution', 'we', 'observe', 'the', 'basic', 'axial', 'modes', 'of', 'the', 'wave', 'vector', 'grid', 'for', 'extraction', 'of', 'the', 'room', 'geometry', 'and', 'then', 'we', 'propagate', 'the', 'knowledge', 'to', 'higher', 'order', 'modes', 'out', 'of', 'the', 'lowpass', 'version', 'of', 'the', 'measurements', 'estimation', 'of', 'the', 'approximate', 'structure', 'of', 'the', 'kspace', 'should', 'lead', 'to', 'the', 'reduction', 'in', 'the', 'terms', 'of', 'number', 'of', 'required', 'measurements', 'and', 'in', 'the', 'increase', 'of', 'the', 'speed', 'of', 'the', 'reconstruction', 'without', 'great', 'losses', 'of', 'quality']] | [-0.13454560022914736, 0.10316521264385523, -0.05600563940455819, -0.014996341501345585, -0.08709345129318535, -0.041078347849046314, 0.060640804950863395, 0.371448898483522, -0.2508687639066654, -0.287805563641042, 0.1393868639396515, -0.2858486459476919, -0.11910066259286661, 0.19755375145816687, -0.03213085763428996, 0.08090237723720237, 0.023586991120260435, 0.08291177004194629, -0.0902118775439903, -0.18385571970536216, 0.25998781637498747, 0.057372484310734564, 0.3215663552897551, 0.03551273022937339, 0.1478252393028858, 0.040902647749157396, -0.011987067492133597, 0.009575885868199715, -0.07337787602170089, 0.11652431536817968, 0.25479281518790053, 0.09475776641317303, 0.25057439740446236, -0.460601756042551, -0.2240734134357786, 0.08466342256529392, 0.1273696909817617, 0.14946729607547196, -0.048405762731307755, -0.24355471900823275, 0.09645880895905287, -0.11994268493045394, -0.12315837206693775, -0.05352053548799964, -0.027578995333098603, 0.027958854517570082, -0.2580884962456965, 0.07316994029324411, 0.0664882544462183, 0.06239670349807456, -0.06809492515706707, -0.10374593196959211, 0.008164748687172173, 0.15039841742425158, 0.018204251322724924, 0.0324999563688435, 0.10648258766670507, -0.17567632822731577, -0.0788158093062343, 0.40026078233495355, -0.08119027892542185, -0.23663853034490673, 0.14819559368742174, -0.1965523688605328, -0.035191736354424456, 0.1806389738027597, 0.21516387727077504, 0.09396319533414321, -0.11554978213240336, 0.05764294651848237, -0.01052965431899349, 0.17408440614732482, 0.11244069726388084, 0.061491294911630995, 0.17722005347959788, 0.16310252401432612, 0.07929146810996959, 0.14810208233695182, -0.1316455537240339, -0.01837683910299547, -0.2986380325562162, -0.13420462153465829, -0.19890654171112834, -0.0022624998586607257, -0.11257348041216596, -0.19981707654688963, 0.4416641694445322, 0.17236196684435282, 0.18439454412678394, 0.030972944652071087, 0.322760817015589, 0.14086482138514927, 0.0680175783047339, 0.06088321222980484, 0.25446600739353636, 0.12156546117011004, 0.10128528322945009, -0.2150205531804936, 0.060728948729442116, 0.017438467052515325] |
1,802.0588 | Imprints of quasar duty cycle on the 21cm signal from the Epoch of
Reionization | Quasars contribute to the 21-cm signal from the Epoch of Reionization (EoR)
primarily through their ionizing UV and X-ray emission. However, their radio
continuum and Lyman-band emission also regulates the 21-cm signal in their
direct environment, potentially leaving the imprint of their duty cycle.
We develop a model for the radio and UV luminosity functions of quasars from
the EoR, and constrain it using recent observations. Our model is consistent
with the z~7.5 quasar from Banados et al 2017, and also predicts only a few
quasars suitable for 21-cm forest observations (10mJy) in the sky. We exhibit a
new effect on the 21-cm signal observed against the CMB: a radio-loud quasar
can leave the imprint of its duty cycle on the 21-cm tomography. We apply this
effect in a cosmological simulation and conclude that the effect of typical
radio-loud quasars is most likely negligible in an SKA field of view. For a
1-10mJy quasar the effect is stronger though hardly observable at SKA
resolution. Then we study the contribution of the lyman band Ly-alpha to
Ly-beta) emission of quasars to the Wouthuisen-Field coupling. The collective
effect of quasars on the 21-cm power spectrum is larger than the thermal noise
at low k, though featureless. However, a distinctive pattern around the
brightest quasars in an SKA field of view may be observable in the tomography,
encoding the duration of their duty cycle. This pattern has a high
signal-to-noise ratio for the brightest quasar in a typical SKA shallow survey.
| astro-ph.CO | quasars contribute to the 21cm signal from the epoch of reionization eor primarily through their ionizing uv and xray emission however their radio continuum and lymanband emission also regulates the 21cm signal in their direct environment potentially leaving the imprint of their duty cycle we develop a model for the radio and uv luminosity functions of quasars from the eor and constrain it using recent observations our model is consistent with the z75 quasar from banados et al 2017 and also predicts only a few quasars suitable for 21cm forest observations 10mjy in the sky we exhibit a new effect on the 21cm signal observed against the cmb a radioloud quasar can leave the imprint of its duty cycle on the 21cm tomography we apply this effect in a cosmological simulation and conclude that the effect of typical radioloud quasars is most likely negligible in an ska field of view for a 110mjy quasar the effect is stronger though hardly observable at ska resolution then we study the contribution of the lyman band lyalpha to lybeta emission of quasars to the wouthuisenfield coupling the collective effect of quasars on the 21cm power spectrum is larger than the thermal noise at low k though featureless however a distinctive pattern around the brightest quasars in an ska field of view may be observable in the tomography encoding the duration of their duty cycle this pattern has a high signaltonoise ratio for the brightest quasar in a typical ska shallow survey | [['quasars', 'contribute', 'to', 'the', '21cm', 'signal', 'from', 'the', 'epoch', 'of', 'reionization', 'eor', 'primarily', 'through', 'their', 'ionizing', 'uv', 'and', 'xray', 'emission', 'however', 'their', 'radio', 'continuum', 'and', 'lymanband', 'emission', 'also', 'regulates', 'the', '21cm', 'signal', 'in', 'their', 'direct', 'environment', 'potentially', 'leaving', 'the', 'imprint', 'of', 'their', 'duty', 'cycle', 'we', 'develop', 'a', 'model', 'for', 'the', 'radio', 'and', 'uv', 'luminosity', 'functions', 'of', 'quasars', 'from', 'the', 'eor', 'and', 'constrain', 'it', 'using', 'recent', 'observations', 'our', 'model', 'is', 'consistent', 'with', 'the', 'z75', 'quasar', 'from', 'banados', 'et', 'al', '2017', 'and', 'also', 'predicts', 'only', 'a', 'few', 'quasars', 'suitable', 'for', '21cm', 'forest', 'observations', '10mjy', 'in', 'the', 'sky', 'we', 'exhibit', 'a', 'new', 'effect', 'on', 'the', '21cm', 'signal', 'observed', 'against', 'the', 'cmb', 'a', 'radioloud', 'quasar', 'can', 'leave', 'the', 'imprint', 'of', 'its', 'duty', 'cycle', 'on', 'the', '21cm', 'tomography', 'we', 'apply', 'this', 'effect', 'in', 'a', 'cosmological', 'simulation', 'and', 'conclude', 'that', 'the', 'effect', 'of', 'typical', 'radioloud', 'quasars', 'is', 'most', 'likely', 'negligible', 'in', 'an', 'ska', 'field', 'of', 'view', 'for', 'a', '110mjy', 'quasar', 'the', 'effect', 'is', 'stronger', 'though', 'hardly', 'observable', 'at', 'ska', 'resolution', 'then', 'we', 'study', 'the', 'contribution', 'of', 'the', 'lyman', 'band', 'lyalpha', 'to', 'lybeta', 'emission', 'of', 'quasars', 'to', 'the', 'wouthuisenfield', 'coupling', 'the', 'collective', 'effect', 'of', 'quasars', 'on', 'the', '21cm', 'power', 'spectrum', 'is', 'larger', 'than', 'the', 'thermal', 'noise', 'at', 'low', 'k', 'though', 'featureless', 'however', 'a', 'distinctive', 'pattern', 'around', 'the', 'brightest', 'quasars', 'in', 'an', 'ska', 'field', 'of', 'view', 'may', 'be', 'observable', 'in', 'the', 'tomography', 'encoding', 'the', 'duration', 'of', 'their', 'duty', 'cycle', 'this', 'pattern', 'has', 'a', 'high', 'signaltonoise', 'ratio', 'for', 'the', 'brightest', 'quasar', 'in', 'a', 'typical', 'ska', 'shallow', 'survey']] | [-0.051380285154273994, 0.09914797671275451, -0.021852014335588768, 0.1024540192094115, -0.1181237078073853, -0.0751629761733145, 0.03850904988150418, 0.44902100096935565, -0.15918760438523205, -0.27783887282669967, 0.07873625790385477, -0.323021461955283, -0.07192323537664073, 0.21412878237223545, 0.010370867364561026, -0.053086676906091104, -0.00753314541662225, -0.128313890096509, 0.02052884112309706, -0.2488232137718302, 0.2524038082448698, 0.19856473800503774, 0.22280539732580998, -0.015722086967953183, 0.10264596570592359, -0.1066258080022764, -0.13204399268364397, 0.009405180483845322, -0.08675821316028452, 0.005832664126545372, 0.258244659142712, 0.20102761508444483, 0.2110558767211039, -0.32943701431879147, -0.22239345017262557, 0.14410107129589025, 0.18115198956086084, 0.11503835126516307, -0.01885387340234404, -0.2974694750652562, 0.04600773933369512, -0.16919011857006172, -0.10446583001538809, 0.09169659803542289, 0.022255129956636532, -0.0049034084960712715, -0.18806827184838443, 0.11878414622857707, 0.0021140379986729517, 0.09401076183718467, -0.055256297781230194, -0.04734884063913091, -0.05481277466449992, 0.05596010183334833, -0.0010881553289031813, 0.041862190043580105, 0.1945013837202599, -0.19351060632220377, -0.0638136990964111, 0.41659610200794, -0.09669666235017739, 0.04811332673060629, 0.1494067098817181, -0.24466148022984566, -0.22875809709839373, 0.1908119664784815, 0.18021063823516853, 0.08933217477747182, -0.07777177210169493, 0.03395496365420524, -0.007082191783263676, 0.27136115298459407, 0.007694837982249766, 0.10609812099441343, 0.3574027143086982, 0.09723209466140431, 0.0866456749502132, 0.10127745574738016, -0.22147891196414737, 0.0580096343908787, -0.23315529069045055, -0.052832150077711235, -0.16596252248228455, 0.16260920249176428, -0.1424545871107066, -0.13058672121797615, 0.4203192711551391, 0.1901686383446166, 0.20847785088546134, 0.08356328595048834, 0.3567735993412704, 0.10902061536441546, 0.045449453210439306, 0.04496676058692623, 0.36679132785723517, 0.14238927418154926, 0.11956330193282079, -0.2364810391702512, 0.07400874494101761, -0.022298302399635556] |
1,802.05881 | Quantum super Nambu bracket of cubic supermatrices and 3-Lie
superalgebra | We construct the graded triple Lie commutator of cubic supermatrices, which
we call the quantum super Nambu bracket of cubic supermatrices, and prove that
it satisfies the graded Filippov-Jacobi identity of 3-Lie superalgebra. For
this purpose we use the basic notions of the calculus of 3-dimensional
matrices, define the Z_2-graded (or super) structure of a cubic matrix relative
to one of the directions of a cubic matrix and the super trace of a cubic
supermatrix. Making use of the super trace of a cubic supermatrix we introduce
the triple product of cubic supermatrices and find the identities for this
triple product, where one of them can be regarded as the analog of ternary
associativity. We also show that given a Lie algebra one can construct the
$n$-ary Lie bracket by means of an (n-2)-cochain of given Lie algebra and find
the conditions under which this n-ary bracket satisfies the Filippov-Jacobi
identity, thereby inducing the structure of n-Lie algebra. We extend this
approach to n-Lie superalgebras.
| math.QA hep-th | we construct the graded triple lie commutator of cubic supermatrices which we call the quantum super nambu bracket of cubic supermatrices and prove that it satisfies the graded filippovjacobi identity of 3lie superalgebra for this purpose we use the basic notions of the calculus of 3dimensional matrices define the z_2graded or super structure of a cubic matrix relative to one of the directions of a cubic matrix and the super trace of a cubic supermatrix making use of the super trace of a cubic supermatrix we introduce the triple product of cubic supermatrices and find the identities for this triple product where one of them can be regarded as the analog of ternary associativity we also show that given a lie algebra one can construct the nary lie bracket by means of an n2cochain of given lie algebra and find the conditions under which this nary bracket satisfies the filippovjacobi identity thereby inducing the structure of nlie algebra we extend this approach to nlie superalgebras | [['we', 'construct', 'the', 'graded', 'triple', 'lie', 'commutator', 'of', 'cubic', 'supermatrices', 'which', 'we', 'call', 'the', 'quantum', 'super', 'nambu', 'bracket', 'of', 'cubic', 'supermatrices', 'and', 'prove', 'that', 'it', 'satisfies', 'the', 'graded', 'filippovjacobi', 'identity', 'of', '3lie', 'superalgebra', 'for', 'this', 'purpose', 'we', 'use', 'the', 'basic', 'notions', 'of', 'the', 'calculus', 'of', '3dimensional', 'matrices', 'define', 'the', 'z_2graded', 'or', 'super', 'structure', 'of', 'a', 'cubic', 'matrix', 'relative', 'to', 'one', 'of', 'the', 'directions', 'of', 'a', 'cubic', 'matrix', 'and', 'the', 'super', 'trace', 'of', 'a', 'cubic', 'supermatrix', 'making', 'use', 'of', 'the', 'super', 'trace', 'of', 'a', 'cubic', 'supermatrix', 'we', 'introduce', 'the', 'triple', 'product', 'of', 'cubic', 'supermatrices', 'and', 'find', 'the', 'identities', 'for', 'this', 'triple', 'product', 'where', 'one', 'of', 'them', 'can', 'be', 'regarded', 'as', 'the', 'analog', 'of', 'ternary', 'associativity', 'we', 'also', 'show', 'that', 'given', 'a', 'lie', 'algebra', 'one', 'can', 'construct', 'the', 'nary', 'lie', 'bracket', 'by', 'means', 'of', 'an', 'n2cochain', 'of', 'given', 'lie', 'algebra', 'and', 'find', 'the', 'conditions', 'under', 'which', 'this', 'nary', 'bracket', 'satisfies', 'the', 'filippovjacobi', 'identity', 'thereby', 'inducing', 'the', 'structure', 'of', 'nlie', 'algebra', 'we', 'extend', 'this', 'approach', 'to', 'nlie', 'superalgebras']] | [-0.18928679439367688, 0.05643149977771739, -0.05021049259031737, 0.05728867108274887, -0.16634479081740874, -0.13123790661679444, -0.02457123939033098, 0.3254759167903103, -0.3673244140269916, -0.21178326238139827, 0.12333617389497416, -0.19953843962582873, -0.24042580249043544, 0.12738614340267349, -0.08278255889805533, -0.06058938722921217, 0.04255829946842135, 0.17402610484022285, -0.1831958491792448, -0.2671823852721079, 0.4365676069211942, -1.604337296335072e-06, 0.1844859130101324, -0.016832305086143428, 0.18528112537432007, 0.047639355957848815, 0.014596131857393719, -0.039784463735797054, -0.1395182491983067, 0.16859489891865495, 0.2281604034899984, 0.08320200912762298, 0.1433543848788093, -0.39672562323238064, -0.07984335011825329, 0.1256641788555809, 0.10998839773124129, 0.02971269857055343, -0.01996986138515129, -0.23546627031003192, 0.082743917322127, -0.23587008858690175, -0.1636196575170133, -0.0639388612329551, 0.011430342340978181, -0.031949406478372286, -0.25885032683329817, 0.051339599722534955, 0.10858435418745879, 0.07373861076378423, -0.06648588222565084, -0.10037446529576101, -0.07490333972680496, 0.04579946717741422, -0.11530647926577707, -0.01962408108995921, 0.08931313535743733, -0.07855574606361276, -0.1755054186030132, 0.40345635380959366, -0.015204567723430512, -0.23497656641936884, 0.09192447671553165, -0.1582176202791743, -0.22603308707021358, 0.05007204240210718, 0.05116618085061995, 0.11855241186099082, -0.122116975163297, 0.20212093625280142, -0.10337906345020889, 0.03725574141731713, 0.11317184102925949, 0.0052664156423927085, 0.15560978325083852, 0.10713236685842276, 0.04557170382155696, 0.18049667227840074, 0.028332591614942917, -0.044739596463353716, -0.3566997113932924, -0.2516678005638646, -0.08864087100345187, 0.13669638941632356, -0.1578155023733682, -0.2068630680867766, 0.3808870708297302, 0.12043771407248952, 0.16420161655945023, 0.08922090489422993, 0.16102664924947907, 0.1483102832323156, 0.18520962228010432, 0.031209443854849514, 0.12988393825177877, 0.27899136351245435, 0.030919832725464027, -0.15112357998902842, -0.07135344699604391, 0.20137049972147839] |
1,802.05882 | Solving mean field rough differential equations | We provide in this work a robust solution theory for random rough
differential equations of mean field type $$ dX_t = V(X_t,\mathcal{L}(X_t))dt +
F(X_t,\mathcal{L}(X_t))dW_t, $$ where $W$ is a random rough path and
$\mathcal{L}(X_t)$ stands for the law of $X_t$, with mean field interaction in
both the drift and diffusivity. The analysis requires the introduction of a new
rough path-like setting and an associated notion of controlled path. We use
crucially Lions' approach to differential calculus on Wasserstein space along
the way.
| math.PR math.CA | we provide in this work a robust solution theory for random rough differential equations of mean field type dx_t vx_tmathcallx_tdt fx_tmathcallx_tdw_t where w is a random rough path and mathcallx_t stands for the law of x_t with mean field interaction in both the drift and diffusivity the analysis requires the introduction of a new rough pathlike setting and an associated notion of controlled path we use crucially lions approach to differential calculus on wasserstein space along the way | [['we', 'provide', 'in', 'this', 'work', 'a', 'robust', 'solution', 'theory', 'for', 'random', 'rough', 'differential', 'equations', 'of', 'mean', 'field', 'type', 'dx_t', 'vx_tmathcallx_tdt', 'fx_tmathcallx_tdw_t', 'where', 'w', 'is', 'a', 'random', 'rough', 'path', 'and', 'mathcallx_t', 'stands', 'for', 'the', 'law', 'of', 'x_t', 'with', 'mean', 'field', 'interaction', 'in', 'both', 'the', 'drift', 'and', 'diffusivity', 'the', 'analysis', 'requires', 'the', 'introduction', 'of', 'a', 'new', 'rough', 'pathlike', 'setting', 'and', 'an', 'associated', 'notion', 'of', 'controlled', 'path', 'we', 'use', 'crucially', 'lions', 'approach', 'to', 'differential', 'calculus', 'on', 'wasserstein', 'space', 'along', 'the', 'way']] | [-0.11393529354905088, 0.10493117719442428, -0.12877951168765625, 0.04441925425703327, -0.12376305976882578, -0.11643192259594798, 0.02455527858653416, 0.3480685525387526, -0.3450947432902952, -0.26847242121895154, 0.058422027425840496, -0.2810491746539871, -0.15428180418287715, 0.1832572966814041, -0.1427395407234629, 0.06177738974491755, 0.040329306311905386, 0.04045704506066007, -0.02074513902887702, -0.17604565373001, 0.3454796497399608, -0.016491493036349614, 0.23128492295742034, -0.0035807325473676127, 0.17485790270691118, 0.07462516801742215, -0.08304827733586231, 0.06685630158171989, -0.2114510312800606, 0.16571582977039118, 0.15441299765137956, 0.0241849736807247, 0.3213689225865528, -0.4068036018063625, -0.18154902764906486, 0.06640790710846584, 0.10036869888504346, 0.06898874914894501, -0.04623587821455052, -0.27283677607774737, 0.048402854166924955, -0.10684000812470913, -0.16433441520979006, -0.044761998640994234, 0.05147992336812119, 0.033534847864260274, -0.31814113024622204, 0.0870509668889766, 0.09074551971008381, 0.0784167975684007, -0.0705341317896576, -0.06449532410750787, 0.008805823211247722, 0.05638854855671525, 0.022761948859939974, 0.07436579353486499, 0.09528363194316626, -0.11131393174951275, -0.10726382340614994, 0.3118271159629027, -0.1484721931690971, -0.2695418661087751, 0.13535603638117513, -0.11391286194324493, -0.10153900926777472, 0.11219107158482075, 0.1831288880109787, 0.17502662668208357, -0.18749447715158263, 0.14630770864353204, -0.012229173171023528, 0.08940450721730789, 0.029032066588600476, -0.006611646177868048, 0.09297794491615302, 0.2019632270808021, 0.16288523732684554, 0.059265576514105, -0.06803919041917349, -0.1782204874108235, -0.37705933772027495, -0.23169674271096785, -0.13252858090835312, 0.09220536729476105, -0.1320884528688233, -0.21948701513931154, 0.31140142628923057, 0.148088019626836, 0.20315165309856334, 0.11042575837423405, 0.22651191194852194, 0.18855140617738167, -0.02228750693689411, 0.05679316118670007, 0.1600568908204635, 0.2246164236931751, 0.15101975769425433, -0.16565046831344565, 0.07749069585775335, 0.10565370824808876] |
1,802.05883 | Deep Generative Model for Joint Alignment and Word Representation | This work exploits translation data as a source of semantically relevant
learning signal for models of word representation. In particular, we exploit
equivalence through translation as a form of distributed context and jointly
learn how to embed and align with a deep generative model. Our EmbedAlign model
embeds words in their complete observed context and learns by marginalisation
of latent lexical alignments. Besides, it embeds words as posterior probability
densities, rather than point estimates, which allows us to compare words in
context using a measure of overlap between distributions (e.g. KL divergence).
We investigate our model's performance on a range of lexical semantics tasks
achieving competitive results on several standard benchmarks including natural
language inference, paraphrasing, and text similarity.
| cs.CL cs.AI | this work exploits translation data as a source of semantically relevant learning signal for models of word representation in particular we exploit equivalence through translation as a form of distributed context and jointly learn how to embed and align with a deep generative model our embedalign model embeds words in their complete observed context and learns by marginalisation of latent lexical alignments besides it embeds words as posterior probability densities rather than point estimates which allows us to compare words in context using a measure of overlap between distributions eg kl divergence we investigate our models performance on a range of lexical semantics tasks achieving competitive results on several standard benchmarks including natural language inference paraphrasing and text similarity | [['this', 'work', 'exploits', 'translation', 'data', 'as', 'a', 'source', 'of', 'semantically', 'relevant', 'learning', 'signal', 'for', 'models', 'of', 'word', 'representation', 'in', 'particular', 'we', 'exploit', 'equivalence', 'through', 'translation', 'as', 'a', 'form', 'of', 'distributed', 'context', 'and', 'jointly', 'learn', 'how', 'to', 'embed', 'and', 'align', 'with', 'a', 'deep', 'generative', 'model', 'our', 'embedalign', 'model', 'embeds', 'words', 'in', 'their', 'complete', 'observed', 'context', 'and', 'learns', 'by', 'marginalisation', 'of', 'latent', 'lexical', 'alignments', 'besides', 'it', 'embeds', 'words', 'as', 'posterior', 'probability', 'densities', 'rather', 'than', 'point', 'estimates', 'which', 'allows', 'us', 'to', 'compare', 'words', 'in', 'context', 'using', 'a', 'measure', 'of', 'overlap', 'between', 'distributions', 'eg', 'kl', 'divergence', 'we', 'investigate', 'our', 'models', 'performance', 'on', 'a', 'range', 'of', 'lexical', 'semantics', 'tasks', 'achieving', 'competitive', 'results', 'on', 'several', 'standard', 'benchmarks', 'including', 'natural', 'language', 'inference', 'paraphrasing', 'and', 'text', 'similarity']] | [0.006576575660955761, 0.010587875987797722, -0.07329770400962335, 0.14502267819193934, -0.16383783257234905, -0.13293647862797192, 0.07594348595209294, 0.4600659044680454, -0.3105234675448767, -0.32526753766667416, 0.005093290211072476, -0.30067490452668194, -0.1334572221661555, 0.17787709496510848, -0.12544728927235355, 0.044814930897269206, 0.10142108282050655, 0.07670851569559614, -0.10549029933241338, -0.2063233942845126, 0.32867093834832656, 0.01981778197178925, 0.33845754787010157, -0.04894452452880599, 0.1665550315931688, -0.0198890161858398, -0.0671575398547417, -0.02065767242841549, -0.08452290457809518, 0.21139651701402834, 0.3254757150108023, 0.2479180081715902, 0.28552899495461737, -0.3666221440806235, -0.24569986647752634, 0.10183710143388391, 0.12605383623846692, 0.08452457834283773, -0.013528717135205487, -0.34595830032949226, 0.055080682390479974, -0.182120220412074, 0.08044742525681474, -0.17967296268206912, -0.00911261665761092, 0.002576253511074741, -0.2761945083620958, 0.05273805711205291, 0.15339276420694412, 0.06617333146869757, -0.049213815440021264, -0.08848418581094276, 0.02345035242911239, 0.16944934312506751, 0.051791584373735905, 0.08434256904174463, 0.10579241015030845, -0.1626927237859059, -0.16382942588356622, 0.409228604089595, -0.10625065500728127, -0.2530084884078321, 0.2065634834895826, -0.03342071204383116, -0.17371378745883703, 0.03655039351749218, 0.2407866397801534, 0.08032762766934111, -0.156796824853962, 0.07148235658493476, -0.07679472313858411, 0.2129801556744743, 0.09620582697897266, 0.03681581120906492, 0.20444619453362173, 0.22761230707223826, -0.0065592765271411104, 0.14132548935940267, -0.10529991578294944, -0.11429642478667074, -0.23239001207116802, -0.1449636928480655, -0.151387769113279, -0.05951957167639255, -0.11195666267550393, -0.14698808917430944, 0.40521450958538296, 0.2501042617536229, 0.25641471990265774, 0.1741372584611951, 0.2817181435145311, 0.004682937527462146, 0.08722313883284233, 0.07418232643779493, 0.08191554229785451, 0.06229720143522373, 0.057674443582072854, -0.11486790025354189, 0.12970071076612794, 0.06545641958729316] |
1,802.05884 | Coding Block-Level Perceptual Video Coding for 4:4:4 Data in HEVC | There is an increasing consumer demand for high bit-depth 4:4:4 HD video data
playback due to its superior perceptual visual quality compared with standard
8-bit subsampled 4:2:0 video data. Due to vast file sizes and associated
bitrates, it is desirable to compress raw high bit-depth 4:4:4 HD video
sequences as much as possible without incurring a discernible decrease in
visual quality. In this paper, we propose a Coding Block (CB)-level perceptual
video coding technique for HEVC named Full Color Perceptual Quantization
(FCPQ). FCPQ is designed to adjust the Quantization Parameter (QP) at the CB
level (i.e., the luma CB and the chroma Cb and Cr CBs) according to the
variances of pixel data in each CB. FCPQ is based on the default perceptual
quantization method in HEVC called AdaptiveQP. AdaptiveQP adjusts the QP of an
entire CU based only on the spatial activity of the constituent luma CB. As
demonstrated in this paper, by not accounting for the spatial activity of the
constituent chroma CBs, as is the case with AdaptiveQP, coding performance can
be significantly affected; this is because the variance of pixel data in a luma
CB is notably different from the variances of pixel data in chroma Cb and Cr
CBs. FCPQ, therefore, addresses this problem. In terms of coding performance,
FCPQ achieves BD-Rate improvements of up to 39.5% (Y), 16% (Cb) and 29.9% (Cr)
compared with AdaptiveQP.
| cs.MM | there is an increasing consumer demand for high bitdepth 444 hd video data playback due to its superior perceptual visual quality compared with standard 8bit subsampled 420 video data due to vast file sizes and associated bitrates it is desirable to compress raw high bitdepth 444 hd video sequences as much as possible without incurring a discernible decrease in visual quality in this paper we propose a coding block cblevel perceptual video coding technique for hevc named full color perceptual quantization fcpq fcpq is designed to adjust the quantization parameter qp at the cb level ie the luma cb and the chroma cb and cr cbs according to the variances of pixel data in each cb fcpq is based on the default perceptual quantization method in hevc called adaptiveqp adaptiveqp adjusts the qp of an entire cu based only on the spatial activity of the constituent luma cb as demonstrated in this paper by not accounting for the spatial activity of the constituent chroma cbs as is the case with adaptiveqp coding performance can be significantly affected this is because the variance of pixel data in a luma cb is notably different from the variances of pixel data in chroma cb and cr cbs fcpq therefore addresses this problem in terms of coding performance fcpq achieves bdrate improvements of up to 395 y 16 cb and 299 cr compared with adaptiveqp | [['there', 'is', 'an', 'increasing', 'consumer', 'demand', 'for', 'high', 'bitdepth', '444', 'hd', 'video', 'data', 'playback', 'due', 'to', 'its', 'superior', 'perceptual', 'visual', 'quality', 'compared', 'with', 'standard', '8bit', 'subsampled', '420', 'video', 'data', 'due', 'to', 'vast', 'file', 'sizes', 'and', 'associated', 'bitrates', 'it', 'is', 'desirable', 'to', 'compress', 'raw', 'high', 'bitdepth', '444', 'hd', 'video', 'sequences', 'as', 'much', 'as', 'possible', 'without', 'incurring', 'a', 'discernible', 'decrease', 'in', 'visual', 'quality', 'in', 'this', 'paper', 'we', 'propose', 'a', 'coding', 'block', 'cblevel', 'perceptual', 'video', 'coding', 'technique', 'for', 'hevc', 'named', 'full', 'color', 'perceptual', 'quantization', 'fcpq', 'fcpq', 'is', 'designed', 'to', 'adjust', 'the', 'quantization', 'parameter', 'qp', 'at', 'the', 'cb', 'level', 'ie', 'the', 'luma', 'cb', 'and', 'the', 'chroma', 'cb', 'and', 'cr', 'cbs', 'according', 'to', 'the', 'variances', 'of', 'pixel', 'data', 'in', 'each', 'cb', 'fcpq', 'is', 'based', 'on', 'the', 'default', 'perceptual', 'quantization', 'method', 'in', 'hevc', 'called', 'adaptiveqp', 'adaptiveqp', 'adjusts', 'the', 'qp', 'of', 'an', 'entire', 'cu', 'based', 'only', 'on', 'the', 'spatial', 'activity', 'of', 'the', 'constituent', 'luma', 'cb', 'as', 'demonstrated', 'in', 'this', 'paper', 'by', 'not', 'accounting', 'for', 'the', 'spatial', 'activity', 'of', 'the', 'constituent', 'chroma', 'cbs', 'as', 'is', 'the', 'case', 'with', 'adaptiveqp', 'coding', 'performance', 'can', 'be', 'significantly', 'affected', 'this', 'is', 'because', 'the', 'variance', 'of', 'pixel', 'data', 'in', 'a', 'luma', 'cb', 'is', 'notably', 'different', 'from', 'the', 'variances', 'of', 'pixel', 'data', 'in', 'chroma', 'cb', 'and', 'cr', 'cbs', 'fcpq', 'therefore', 'addresses', 'this', 'problem', 'in', 'terms', 'of', 'coding', 'performance', 'fcpq', 'achieves', 'bdrate', 'improvements', 'of', 'up', 'to', '395', 'y', '16', 'cb', 'and', '299', 'cr', 'compared', 'with', 'adaptiveqp']] | [-0.06471645277317452, 0.03738340505856879, -0.0200880164877795, 0.020284206976445958, -0.02697152238966816, -0.1914714899501237, 0.08825512567140242, 0.4269168005831054, -0.26901789345049665, -0.3127420333327989, 0.05210058954746827, -0.27117539881121205, -0.11104704870174274, 0.12970296531794187, -0.22654731727923955, 0.06097788165510713, 0.07379044703784925, 0.05571069110326631, -0.08123371138353833, -0.2658349419144266, 0.2208143268296819, 0.12156795409467558, 0.37876719342969845, 0.00039936631345999956, 0.10267874013237736, 0.035598831471946576, -0.04997817529061728, -0.03715293817756743, -0.008400202924183205, 0.1290673620852075, 0.27618149938264297, 0.1648436796375672, 0.25354020635435437, -0.34116986995643894, -0.20600199403706937, 0.025016304599526137, 0.1627309739994614, 0.04107058956060032, -0.04250654459161603, -0.25881787169441256, 0.18665394793345552, -0.18242244339021652, 0.04576844886127535, -0.01930716710327112, -0.01997254643710735, 0.014442247605842094, -0.32341629529331367, 0.06993370785418412, 0.05053962512490967, 0.05216039433346494, -0.08195224352960434, -0.1493020152369433, -0.026214240683728587, 0.14884532461874186, 0.02002956338502649, 0.1260304893757996, 0.1034200716804227, -0.10281436658140435, -0.09236163967390261, 0.43515527353662514, -0.05580462433357278, -0.19948015403326438, 0.13546800838742892, -0.07493999996222556, -0.08005583522962811, 0.165177621824019, 0.20414455025102538, 0.05081169812170708, -0.13203022431825165, 0.03767268746033432, 0.012697249586167542, 0.2297274817024236, 0.09134848175732338, 0.09591941949000339, 0.15137709046956963, 0.1973894952593938, 0.020052533866280853, 0.1065204288096815, -0.20546272113823089, -0.03787088051903993, -0.18183677247118044, -0.11908130428814531, -0.21151080457898586, -0.022604432368952192, -0.1523681208346439, -0.11760097736411769, 0.37691061847802737, 0.162197704874384, 0.22210825266640472, 0.05915993849301468, 0.3631677890115458, 0.05904078607285476, 0.12006772538373733, 0.10135912310898952, 0.17950631800188643, 0.0493172611484466, 0.13172905058220394, -0.20608272113047701, 0.06767796390365971, 0.04261406786415888] |
1,802.05885 | Exponential lower bounds of lattice counts by vertical sum and 2-sum | We consider the problem of finding lower bounds on the number of unlabeled
$n$-element lattices in some lattice family. We show that if the family is
closed under vertical sum, exponential lower bounds can be obtained from
vertical sums of small lattices whose numbers are known. We demonstrate this
approach by establishing that the number of modular lattices is at least
$2.2726^n$ for $n$ large enough.
We also present an analogous method for finding lower bounds on the number of
vertically indecomposable lattices in some family. For this purpose we define a
new kind of sum, the vertical 2-sum, which combines lattices at two common
elements. As an application we prove that the numbers of vertically
indecomposable modular and semimodular lattices are at least $2.1562^n$ and
$2.6797^n$ for $n$ large enough.
| math.CO | we consider the problem of finding lower bounds on the number of unlabeled nelement lattices in some lattice family we show that if the family is closed under vertical sum exponential lower bounds can be obtained from vertical sums of small lattices whose numbers are known we demonstrate this approach by establishing that the number of modular lattices is at least 22726n for n large enough we also present an analogous method for finding lower bounds on the number of vertically indecomposable lattices in some family for this purpose we define a new kind of sum the vertical 2sum which combines lattices at two common elements as an application we prove that the numbers of vertically indecomposable modular and semimodular lattices are at least 21562n and 26797n for n large enough | [['we', 'consider', 'the', 'problem', 'of', 'finding', 'lower', 'bounds', 'on', 'the', 'number', 'of', 'unlabeled', 'nelement', 'lattices', 'in', 'some', 'lattice', 'family', 'we', 'show', 'that', 'if', 'the', 'family', 'is', 'closed', 'under', 'vertical', 'sum', 'exponential', 'lower', 'bounds', 'can', 'be', 'obtained', 'from', 'vertical', 'sums', 'of', 'small', 'lattices', 'whose', 'numbers', 'are', 'known', 'we', 'demonstrate', 'this', 'approach', 'by', 'establishing', 'that', 'the', 'number', 'of', 'modular', 'lattices', 'is', 'at', 'least', '22726n', 'for', 'n', 'large', 'enough', 'we', 'also', 'present', 'an', 'analogous', 'method', 'for', 'finding', 'lower', 'bounds', 'on', 'the', 'number', 'of', 'vertically', 'indecomposable', 'lattices', 'in', 'some', 'family', 'for', 'this', 'purpose', 'we', 'define', 'a', 'new', 'kind', 'of', 'sum', 'the', 'vertical', '2sum', 'which', 'combines', 'lattices', 'at', 'two', 'common', 'elements', 'as', 'an', 'application', 'we', 'prove', 'that', 'the', 'numbers', 'of', 'vertically', 'indecomposable', 'modular', 'and', 'semimodular', 'lattices', 'are', 'at', 'least', '21562n', 'and', '26797n', 'for', 'n', 'large', 'enough']] | [-0.1729329210065771, 0.17963870140579274, -0.024994069721287815, 0.04058809503840166, -0.05510034578765044, -0.11056685631774599, 0.03864281597543595, 0.37875708649517037, -0.298871913459152, -0.2795043668083963, 0.11555716353723255, -0.26946408560615964, -0.1494145002698133, 0.2541269184439443, -0.033264340068853926, 0.030410059036512394, 0.04087509242526721, 0.05461025119439, -0.0384727472828672, -0.3155158273457346, 0.33456962465243123, -0.04610126686384319, 0.24166718071501236, 0.06883290302857858, 0.07546885290503269, -0.008582313417718979, 0.028168564596853685, 0.03333504052716307, -0.1779419093554111, 0.16893505304960854, 0.21971661964198574, 0.08499558572475507, 0.24381124510910013, -0.40363758824241813, -0.11368254000262823, 0.16974507106442616, 0.16354075486924557, 0.10898561184421851, -0.031725259805170936, -0.17935809293703642, 0.13194068835309736, -0.14464277707156725, -0.15758269755679066, -0.09274751522752922, 0.026108596543053864, 0.04997565469966503, -0.2933788775553694, -0.018411272953244406, 0.10412505139174755, 0.10826065560468123, -0.023807710869732546, -0.1903429611302272, 0.023429242846759735, 0.0736343817479792, -0.02345752068595175, -0.032572959182289196, -0.012164422678324627, -0.08548100160987815, -0.0967622514363029, 0.362351474305342, -0.08399599620042864, -0.20839069838257274, 0.15904588914418127, -0.15351404954162717, -0.17418368642756832, 0.12385939486557618, 0.17980733121930825, 0.14155733968073037, -0.0663069329893915, 0.09528973045144085, -0.1880287996136758, 0.11497664919443196, 0.11913394938892452, 0.058845839248533593, 0.1917019555130537, 0.12174124050216051, 0.15205228692138917, 0.2134023645949128, -0.03523051372758346, -0.03796964275534265, -0.3307707878702786, -0.13515683457808336, -0.21606914559015422, 0.07154177223856095, -0.1201338213957115, -0.19221266965632822, 0.31152439734432846, 0.09864702933555236, 0.21891755169417593, 0.15896322387652617, 0.22226510788277665, 0.08702858928791102, 0.07259608449385269, 0.11425370935756973, 0.14173819498910234, 0.13214016144956986, -0.05301168117875932, -0.14077082270341634, 0.004083768235432217, 0.15664837340227677] |
1,802.05886 | g-factor calculations from the generalized seniority approach | The generalized seniority approach proposed by us to understand the
B(E1)/B(E2)/B(E3) properties of semi-magic nuclei has been widely successful in
the explanation of the same and has led to an expansion in the scope of
seniority isomers. In the present paper, we apply the generalized seniority
scheme to understand the behavior of g-factors in semi-magic nuclei. We find
that the magnetic moment and the gfactors do show a particle number independent
behavior as expected and the understanding is consistent with the explanation
of transition probabilities.
| nucl-th | the generalized seniority approach proposed by us to understand the be1be2be3 properties of semimagic nuclei has been widely successful in the explanation of the same and has led to an expansion in the scope of seniority isomers in the present paper we apply the generalized seniority scheme to understand the behavior of gfactors in semimagic nuclei we find that the magnetic moment and the gfactors do show a particle number independent behavior as expected and the understanding is consistent with the explanation of transition probabilities | [['the', 'generalized', 'seniority', 'approach', 'proposed', 'by', 'us', 'to', 'understand', 'the', 'be1be2be3', 'properties', 'of', 'semimagic', 'nuclei', 'has', 'been', 'widely', 'successful', 'in', 'the', 'explanation', 'of', 'the', 'same', 'and', 'has', 'led', 'to', 'an', 'expansion', 'in', 'the', 'scope', 'of', 'seniority', 'isomers', 'in', 'the', 'present', 'paper', 'we', 'apply', 'the', 'generalized', 'seniority', 'scheme', 'to', 'understand', 'the', 'behavior', 'of', 'gfactors', 'in', 'semimagic', 'nuclei', 'we', 'find', 'that', 'the', 'magnetic', 'moment', 'and', 'the', 'gfactors', 'do', 'show', 'a', 'particle', 'number', 'independent', 'behavior', 'as', 'expected', 'and', 'the', 'understanding', 'is', 'consistent', 'with', 'the', 'explanation', 'of', 'transition', 'probabilities']] | [-0.06270041174831845, 0.09770691249581259, -0.08867355582437345, 0.1109157032458045, -0.022602792330352322, -0.06101066997784767, 0.05192396776692476, 0.3485505388872254, -0.18031444350656653, -0.3198085593647279, -0.01815557593501927, -0.2535673544265419, -0.1236040862720637, 0.12184046776244595, -0.020530425416793497, 0.007204234982574624, -0.024297011891446476, 0.0707515070237042, -0.07350710835695888, -0.1996473535407512, 0.29292517530709683, 0.09577736710586275, 0.3170345199538306, 0.08840917832484203, 0.04970587291089552, -0.022753450576038586, 0.028018497296475937, 0.022112151031338033, -0.13557122187965087, 0.11053825600815582, 0.2486663792348866, 0.0922048501620988, 0.25210651471501305, -0.43260988036525394, -0.16256984643682482, 0.12400112340193507, 0.18583843392497373, 0.162560221206929, -0.04593560375672366, -0.25014203294579473, 0.04485418508938026, -0.2417189524331618, -0.21317798112674305, -0.14624388987154124, 0.04341966556828646, 0.07108362343361867, -0.23608887101900541, 0.04372844938188791, 0.04804927210456559, 0.03239135730213353, -0.09925707472887423, -0.20713748479638958, 0.03144068113483843, 0.10972569207660854, 0.13537959802973396, -0.03595637474652557, 0.057590271080178876, -0.07335555828398183, -0.15986591749935455, 0.4184023545212334, 0.0018384460681339814, -0.12143401495580163, 0.14816534713221094, -0.19498993369329365, -0.15452583013878515, 0.1250460188464439, 0.14502851959384447, 0.10297285642341844, -0.13999675504220205, 0.06188949542688317, -0.03883910119267447, 0.16226495121650042, 0.012334028835452739, 0.04130638961214572, 0.17490409454330802, 0.16618232375809125, 0.0053688093848038645, 0.10431997082196176, -0.12151125714271552, -0.13523801928386092, -0.24383886562039456, -0.1748109361533785, -0.17062045567269837, 0.030323024683942396, -0.015761732594477336, -0.14112461297329337, 0.43897768321676267, 0.15409203965793408, 0.21433247292103866, 0.0013576264138377848, 0.22220965744262294, 0.10439020894063149, 0.0792597079361301, 0.03158479176705614, 0.2909299010144813, 0.19291438792355448, 0.049661362233261265, -0.2732577596935222, 0.12505398467293985, 0.06390451462495894] |
1,802.05887 | Analytic second-order energy derivatives in natural orbital functional
theory | The analytic energy gradients in the atomic orbital representation have
recently been published (J. Chem. Phys. 146, 014102, 2017) within the framework
of the natural orbital functional theory (NOFT). We provide here an alternative
expression for them in terms of natural orbitals, and use it to derive the
analytic second-order energy derivatives with respect to nuclear displacements
in the NOFT. The computational burden is shifted to the calculation of
perturbed natural orbitals and occupancies, since a set of linear
coupled-perturbed equations obtained from the variational Euler equations must
be solved to attain the analytic Hessian at the perturbed geometry. The linear
response of both natural orbitals and occupation numbers to nuclear geometry
displacements need only specify the reconstruction of the second-order reduced
density matrix in terms of occupation numbers.
| physics.chem-ph | the analytic energy gradients in the atomic orbital representation have recently been published j chem phys 146 014102 2017 within the framework of the natural orbital functional theory noft we provide here an alternative expression for them in terms of natural orbitals and use it to derive the analytic secondorder energy derivatives with respect to nuclear displacements in the noft the computational burden is shifted to the calculation of perturbed natural orbitals and occupancies since a set of linear coupledperturbed equations obtained from the variational euler equations must be solved to attain the analytic hessian at the perturbed geometry the linear response of both natural orbitals and occupation numbers to nuclear geometry displacements need only specify the reconstruction of the secondorder reduced density matrix in terms of occupation numbers | [['the', 'analytic', 'energy', 'gradients', 'in', 'the', 'atomic', 'orbital', 'representation', 'have', 'recently', 'been', 'published', 'j', 'chem', 'phys', '146', '014102', '2017', 'within', 'the', 'framework', 'of', 'the', 'natural', 'orbital', 'functional', 'theory', 'noft', 'we', 'provide', 'here', 'an', 'alternative', 'expression', 'for', 'them', 'in', 'terms', 'of', 'natural', 'orbitals', 'and', 'use', 'it', 'to', 'derive', 'the', 'analytic', 'secondorder', 'energy', 'derivatives', 'with', 'respect', 'to', 'nuclear', 'displacements', 'in', 'the', 'noft', 'the', 'computational', 'burden', 'is', 'shifted', 'to', 'the', 'calculation', 'of', 'perturbed', 'natural', 'orbitals', 'and', 'occupancies', 'since', 'a', 'set', 'of', 'linear', 'coupledperturbed', 'equations', 'obtained', 'from', 'the', 'variational', 'euler', 'equations', 'must', 'be', 'solved', 'to', 'attain', 'the', 'analytic', 'hessian', 'at', 'the', 'perturbed', 'geometry', 'the', 'linear', 'response', 'of', 'both', 'natural', 'orbitals', 'and', 'occupation', 'numbers', 'to', 'nuclear', 'geometry', 'displacements', 'need', 'only', 'specify', 'the', 'reconstruction', 'of', 'the', 'secondorder', 'reduced', 'density', 'matrix', 'in', 'terms', 'of', 'occupation', 'numbers']] | [-0.08157889627266762, 0.07001840293350135, -0.06977260414900821, 0.056306257180674654, -0.06431595194911541, -0.04956846932209162, 0.024435868128491637, 0.2935389745619523, -0.2795390694838941, -0.3221974543087336, 0.011274455736080805, -0.2625720997200196, -0.11747517483669889, 0.13337116884320338, -0.0323819529821071, 0.06874560267310734, 0.022861643275607003, 0.0191216927850637, -0.1348525131294547, -0.22389430595316398, 0.2461252764892555, 0.06291421508604242, 0.22865236419105953, 0.01872184721738562, 0.11127958343320982, 0.011107102975018265, 0.012076252768206041, 0.004149453006973562, -0.15096135556611212, 0.1719685764423781, 0.27971481445223784, 0.07246426951190703, 0.26597005996650963, -0.48305009266491544, -0.16357219956324312, 0.0427346756923655, 0.09021533988127413, 0.12696480869438298, -0.0032907340011393378, -0.27431066461311754, 0.019152104919559734, -0.17775005776464015, -0.15049868798634225, -0.14241848623401723, 0.06495938083344652, 0.05937669110978961, -0.29507976016679477, 0.1270270070039429, -0.0008591008336507073, 0.07265711881133706, -0.08907148541664694, -0.15153514662425416, -0.05913102623461493, 0.05075556324621619, 0.01954497338648048, 0.042939593401816925, 0.0828874960447871, -0.06890420060489298, -0.061877422135814215, 0.39572900467256245, -0.03497100612076447, -0.25925220384500747, 0.16470152881202224, -0.15570085388139004, -0.12269050582463659, 0.15066751518626084, 0.15091730973885445, 0.12728555806571357, -0.14354194537195009, 0.1481723381931056, -0.010526659971557904, 0.14714567758893782, 0.11342825075835278, 0.02223038358628288, 0.1420423068438274, 0.05278068693542434, 0.059676727534510025, 0.07824061938756427, -0.074112680482781, -0.16389400276081104, -0.2756578618472861, -0.16921801494015742, -0.2252735203752915, 0.04200122055287162, -0.04849285117403312, -0.16242684962502282, 0.3913019147535512, 0.09655385340975467, 0.16219820820748113, 0.04537329396824966, 0.2537647627525089, 0.21369287274092483, 0.04480650773012014, 0.06253995803047636, 0.207565994991004, 0.1993293470320429, 0.07180242894520593, -0.26212546705853107, 0.027980795565111807, 0.11399895004935331] |
1,802.05888 | The martingale problem for a class of nonlocal operators of diagonal
type | We consider systems of stochastic differential equations of the form \[ \d
X_t^i = \sum_{j=1}^d A_{ij}(X_{t-}) \d Z_t^j\] for $i=1,\dots,d$ with
continuous, bounded and non-degenerate coefficients. Here $Z_t^1,\dots,Z_t^d$
are independent one-dimensional stable processes with
$\alpha_1,\dots,\alpha_d\in(0,2)$. In this article we research on uniqueness of
weak solutions to such systems by studying the corresponding martingale
problem. We prove the uniqueness of weak solutions in the case of diagonal
coefficient matrices.
| math.PR | we consider systems of stochastic differential equations of the form d x_ti sum_j1d a_ijx_t d z_tj for i1dotsd with continuous bounded and nondegenerate coefficients here z_t1dotsz_td are independent onedimensional stable processes with alpha_1dotsalpha_din02 in this article we research on uniqueness of weak solutions to such systems by studying the corresponding martingale problem we prove the uniqueness of weak solutions in the case of diagonal coefficient matrices | [['we', 'consider', 'systems', 'of', 'stochastic', 'differential', 'equations', 'of', 'the', 'form', 'd', 'x_ti', 'sum_j1d', 'a_ijx_t', 'd', 'z_tj', 'for', 'i1dotsd', 'with', 'continuous', 'bounded', 'and', 'nondegenerate', 'coefficients', 'here', 'z_t1dotsz_td', 'are', 'independent', 'onedimensional', 'stable', 'processes', 'with', 'alpha_1dotsalpha_din02', 'in', 'this', 'article', 'we', 'research', 'on', 'uniqueness', 'of', 'weak', 'solutions', 'to', 'such', 'systems', 'by', 'studying', 'the', 'corresponding', 'martingale', 'problem', 'we', 'prove', 'the', 'uniqueness', 'of', 'weak', 'solutions', 'in', 'the', 'case', 'of', 'diagonal', 'coefficient', 'matrices']] | [-0.19097631109217483, 0.06456200667889789, 0.011884869335429562, 0.018140089613640862, -0.021837649844406594, -0.14987346306142788, -0.002539887738924834, 0.3072083496278332, -0.33420226548708254, -0.14374232042070118, 0.14310893000689365, -0.30690149899812474, -0.14099026991114502, 0.16857442704419937, -0.04199834136412509, 0.11562523293879724, 0.04983940499369055, 0.012484143589503102, -0.0889136753976345, -0.23135785856509522, 0.3964438329135338, -0.08564190429845644, 0.19350267576444294, 0.03605491756611774, 0.15376274114955338, 0.02280058219067512, -0.035089887821325855, 0.0021588231902569532, -0.1927905227320509, 0.11224056865772113, 0.2508525561180807, 0.05939721885489792, 0.26370989122698385, -0.4009624568805579, -0.14520045752907473, 0.1769618329501921, 0.11072070804197386, 0.0800474611141028, -0.02076889266402671, -0.29458493458092094, 0.12081634639687236, -0.1136090270874481, -0.21559184604144144, -0.06868079514993776, 0.07014295168881936, 0.1106476365934096, -0.3166919001941419, 0.14452209000686003, 0.1296949025934502, 0.05135740907750123, -0.11896280082122933, -0.112410465360529, 0.009046328584513357, 0.04449300544576779, 0.05819313960608035, -0.05159921706804345, 0.016632752170065237, -0.09976319858669153, -0.10901507158433238, 0.3309466199679, -0.14427005040699675, -0.28645337090617223, 0.17873081525847798, -0.17570838376489137, -0.15558305710944678, 0.07597626057723837, 0.20132044074876654, 0.19944350226151367, -0.16605835038447572, 0.18432511027147544, -0.09810089510715296, 0.09639565913605638, 0.06374011269109624, 0.03300551738169405, 0.10112268693234411, 0.11497986941568313, 0.1395439285739896, 0.13288909792449446, 0.05010756741713492, -0.12240447945922854, -0.30877478294555216, -0.14591537612385205, -0.11486325723930232, 0.1370583210110424, -0.09178054196015564, -0.18570641306371638, 0.33607533358172664, 0.10844094606657181, 0.17889028991903028, 0.07180276961486426, 0.1900551077429085, 0.2110840290514452, -0.07022545808145116, 0.0614484149752365, 0.18151778021767254, 0.2066591198803977, 0.11762670967953219, -0.1865410555469533, 0.051829993266672376, 0.14057971078281914] |
1,802.05889 | Combining Linear Non-Gaussian Acyclic Model with Logistic Regression
Model for Estimating Causal Structure from Mixed Continuous and Discrete Data | Estimating causal models from observational data is a crucial task in data
analysis. For continuous-valued data, Shimizu et al. have proposed a linear
acyclic non-Gaussian model to understand the data generating process, and have
shown that their model is identifiable when the number of data is sufficiently
large. However, situations in which continuous and discrete variables coexist
in the same problem are common in practice. Most existing causal discovery
methods either ignore the discrete data and apply a continuous-valued algorithm
or discretize all the continuous data and then apply a discrete Bayesian
network approach. These methods possibly loss important information when we
ignore discrete data or introduce the approximation error due to
discretization. In this paper, we define a novel hybrid causal model which
consists of both continuous and discrete variables. The model assumes: (1) the
value of a continuous variable is a linear function of its parent variables
plus a non-Gaussian noise, and (2) each discrete variable is a logistic
variable whose distribution parameters depend on the values of its parent
variables. In addition, we derive the BIC scoring function for model selection.
The new discovery algorithm can learn causal structures from mixed continuous
and discrete data without discretization. We empirically demonstrate the power
of our method through thorough simulations.
| cs.LG cs.AI stat.ML | estimating causal models from observational data is a crucial task in data analysis for continuousvalued data shimizu et al have proposed a linear acyclic nongaussian model to understand the data generating process and have shown that their model is identifiable when the number of data is sufficiently large however situations in which continuous and discrete variables coexist in the same problem are common in practice most existing causal discovery methods either ignore the discrete data and apply a continuousvalued algorithm or discretize all the continuous data and then apply a discrete bayesian network approach these methods possibly loss important information when we ignore discrete data or introduce the approximation error due to discretization in this paper we define a novel hybrid causal model which consists of both continuous and discrete variables the model assumes 1 the value of a continuous variable is a linear function of its parent variables plus a nongaussian noise and 2 each discrete variable is a logistic variable whose distribution parameters depend on the values of its parent variables in addition we derive the bic scoring function for model selection the new discovery algorithm can learn causal structures from mixed continuous and discrete data without discretization we empirically demonstrate the power of our method through thorough simulations | [['estimating', 'causal', 'models', 'from', 'observational', 'data', 'is', 'a', 'crucial', 'task', 'in', 'data', 'analysis', 'for', 'continuousvalued', 'data', 'shimizu', 'et', 'al', 'have', 'proposed', 'a', 'linear', 'acyclic', 'nongaussian', 'model', 'to', 'understand', 'the', 'data', 'generating', 'process', 'and', 'have', 'shown', 'that', 'their', 'model', 'is', 'identifiable', 'when', 'the', 'number', 'of', 'data', 'is', 'sufficiently', 'large', 'however', 'situations', 'in', 'which', 'continuous', 'and', 'discrete', 'variables', 'coexist', 'in', 'the', 'same', 'problem', 'are', 'common', 'in', 'practice', 'most', 'existing', 'causal', 'discovery', 'methods', 'either', 'ignore', 'the', 'discrete', 'data', 'and', 'apply', 'a', 'continuousvalued', 'algorithm', 'or', 'discretize', 'all', 'the', 'continuous', 'data', 'and', 'then', 'apply', 'a', 'discrete', 'bayesian', 'network', 'approach', 'these', 'methods', 'possibly', 'loss', 'important', 'information', 'when', 'we', 'ignore', 'discrete', 'data', 'or', 'introduce', 'the', 'approximation', 'error', 'due', 'to', 'discretization', 'in', 'this', 'paper', 'we', 'define', 'a', 'novel', 'hybrid', 'causal', 'model', 'which', 'consists', 'of', 'both', 'continuous', 'and', 'discrete', 'variables', 'the', 'model', 'assumes', '1', 'the', 'value', 'of', 'a', 'continuous', 'variable', 'is', 'a', 'linear', 'function', 'of', 'its', 'parent', 'variables', 'plus', 'a', 'nongaussian', 'noise', 'and', '2', 'each', 'discrete', 'variable', 'is', 'a', 'logistic', 'variable', 'whose', 'distribution', 'parameters', 'depend', 'on', 'the', 'values', 'of', 'its', 'parent', 'variables', 'in', 'addition', 'we', 'derive', 'the', 'bic', 'scoring', 'function', 'for', 'model', 'selection', 'the', 'new', 'discovery', 'algorithm', 'can', 'learn', 'causal', 'structures', 'from', 'mixed', 'continuous', 'and', 'discrete', 'data', 'without', 'discretization', 'we', 'empirically', 'demonstrate', 'the', 'power', 'of', 'our', 'method', 'through', 'thorough', 'simulations']] | [-0.05778877968266518, 0.05347499343173764, -0.11370817173086989, 0.0938580313076363, -0.1294017795592511, -0.163328954461141, 0.07672222805324218, 0.38138580643593983, -0.3041936243631572, -0.29774593130213106, 0.13743991542594305, -0.248308287483256, -0.16293543873142927, 0.14492713916667194, -0.09130424935529582, 0.09668804836848152, 0.06149399727781555, 0.03295035835938149, -0.05915655762810145, -0.23812607140225134, 0.3160979486229472, 0.0021279653207668197, 0.29524431723722816, -0.06593640090376846, 0.13931182938930248, 0.03742077522491816, -0.10630681413177277, 0.00031412482400694025, -0.08851505695943311, 0.08962355674767505, 0.2546033419023183, 0.16518251674903017, 0.3428505279335648, -0.3975830191097518, -0.2706597857133119, 0.15199994219282767, 0.08751710880574246, 0.10860299364270828, -0.010323026679319405, -0.26093349855402, 0.05629104148084518, -0.14284470093768128, -0.05748041284102858, -0.10823570058341205, -0.00941304763187588, 0.028693354999209573, -0.35147117550834633, 0.121015669433709, 0.06318432738192344, 0.03861938096070883, -0.08095264765301552, -0.10639792842066613, -0.04418853841064348, 0.09384768634402277, 0.03236847184198441, 0.027187598572924767, 0.06193057677412838, -0.10558332445130847, -0.13789821194343588, 0.3585437651957006, -0.04192882784757039, -0.25705087203002797, 0.17530561400957018, -0.08776385327845247, -0.18409643008625268, 0.1076717610278948, 0.23804173410000606, 0.12567088274523544, -0.181028801970591, 0.08622127594851108, -0.05331615390370807, 0.17830319847509934, -0.023725167775341262, 0.010901986553457288, 0.15813276991777792, 0.17661428523263165, 0.029723128200711692, 0.12135670292831216, -0.12112255515563809, -0.11390591555708685, -0.2861282846347486, -0.10441255655969489, -0.21933608260987794, -0.026812707877859155, -0.13189311068836362, -0.18776803360544356, 0.38823732882473283, 0.18466784253769436, 0.21588675441855998, 0.07505109291954046, 0.30576602803318104, 0.12307661993239269, 0.03887897760660269, 0.09372621231962887, 0.15975628657072288, 0.09187317007194798, 0.047882533969878446, -0.17353358329163415, 0.1287230822451907, 0.004059081377408586] |
1,802.0589 | LeClair-Mussardo series for two-point functions in Integrable QFT | We develop a well-defined spectral representation for two-point functions in
relativistic Integrable QFT in finite density situations, valid for space-like
separations. The resulting integral series is based on the infinite volume,
zero density form factors of the theory, and certain statistical functions
related to the distribution of Bethe roots in the finite density background.
Our final formulas are checked by comparing them to previous partial results
obtained in a low-temperature expansion. It is also show that in the limit of
large separations the new integral series factorizes into the product of two
LeClair-Mussardo series for one-point functions, thereby satisfying the
clustering requirement for the two-point function.
| hep-th cond-mat.stat-mech nlin.SI | we develop a welldefined spectral representation for twopoint functions in relativistic integrable qft in finite density situations valid for spacelike separations the resulting integral series is based on the infinite volume zero density form factors of the theory and certain statistical functions related to the distribution of bethe roots in the finite density background our final formulas are checked by comparing them to previous partial results obtained in a lowtemperature expansion it is also show that in the limit of large separations the new integral series factorizes into the product of two leclairmussardo series for onepoint functions thereby satisfying the clustering requirement for the twopoint function | [['we', 'develop', 'a', 'welldefined', 'spectral', 'representation', 'for', 'twopoint', 'functions', 'in', 'relativistic', 'integrable', 'qft', 'in', 'finite', 'density', 'situations', 'valid', 'for', 'spacelike', 'separations', 'the', 'resulting', 'integral', 'series', 'is', 'based', 'on', 'the', 'infinite', 'volume', 'zero', 'density', 'form', 'factors', 'of', 'the', 'theory', 'and', 'certain', 'statistical', 'functions', 'related', 'to', 'the', 'distribution', 'of', 'bethe', 'roots', 'in', 'the', 'finite', 'density', 'background', 'our', 'final', 'formulas', 'are', 'checked', 'by', 'comparing', 'them', 'to', 'previous', 'partial', 'results', 'obtained', 'in', 'a', 'lowtemperature', 'expansion', 'it', 'is', 'also', 'show', 'that', 'in', 'the', 'limit', 'of', 'large', 'separations', 'the', 'new', 'integral', 'series', 'factorizes', 'into', 'the', 'product', 'of', 'two', 'leclairmussardo', 'series', 'for', 'onepoint', 'functions', 'thereby', 'satisfying', 'the', 'clustering', 'requirement', 'for', 'the', 'twopoint', 'function']] | [-0.12689092268130547, 0.09972068697723718, -0.14699510385651351, 0.12116107191969552, -0.03642457925257677, -0.045150530709059174, -0.006264500002561242, 0.318916571924006, -0.23525241582573694, -0.19962861765843798, 0.0570037583062724, -0.2691032643965885, -0.09915869166406821, 0.19684252214512593, 0.032017897270462815, 0.10165271720901695, 0.029334262793198368, 0.04729316257080942, -0.16044174785174448, -0.25477341354279864, 0.363720650881318, -0.005560008725502862, 0.29443835080513414, 0.06438399433544925, 0.10549340631707378, 0.06416386554351533, -0.06309427934553791, 0.033206632378388126, -0.14116956847358797, 0.11189288052923556, 0.25834821335057606, 0.10686469317484155, 0.23751199740108173, -0.4059335902895568, -0.19126618287486533, 0.06381685440955719, 0.15539796749033244, 0.07035108134677669, 0.019685366545707197, -0.2506251825098792, 0.07424164312575364, -0.18830327647474576, -0.1743331379916097, -0.116441285173971, 0.028431883046649536, 0.04188458889476814, -0.2819105405009018, 0.1422940257182762, 0.0014903951449460298, 0.029680057835132587, -0.06394988753094848, -0.15113068042973163, 0.02595239955677106, 0.12276965748290268, 0.02847898489233317, 0.021074138023837837, 0.08070198970600823, -0.14775249251067848, -0.0477389060795518, 0.30864271964166173, -0.08757623907986958, -0.24539684180119778, 0.13149513903662632, -0.22730778410859442, -0.17790158799814307, 0.14466690299329613, 0.09714735785218061, 0.12620550875534425, -0.14157854313171417, 0.13426557227800037, -0.02235968790416834, 0.10700979612395387, 0.08016881004595286, 0.015444738782155942, 0.1971616051599102, 0.05032832515733492, 0.0390829039421284, 0.16974419820889006, -0.0168666169006171, -0.11245815251637602, -0.3817451734376966, -0.15118342647680416, -0.22643668040246615, 0.05676416134602338, -0.1523429383349414, -0.24149609575012945, 0.3724516789727616, 0.09886045385160888, 0.20589585051397388, 0.13808359823328056, 0.2628345273189106, 0.20124690684727128, 0.06627615863668188, 0.04380978685864802, 0.15313595499983937, 0.16349708171174773, 0.03647107028683542, -0.19331776362158498, -0.0018628481885348007, 0.14704848843723325] |
1,802.05891 | Training Deep Face Recognition Systems with Synthetic Data | Recent advances in deep learning have significantly increased the performance
of face recognition systems. The performance and reliability of these models
depend heavily on the amount and quality of the training data. However, the
collection of annotated large datasets does not scale well and the control over
the quality of the data decreases with the size of the dataset. In this work,
we explore how synthetically generated data can be used to decrease the number
of real-world images needed for training deep face recognition systems. In
particular, we make use of a 3D morphable face model for the generation of
images with arbitrary amounts of facial identities and with full control over
image variations, such as pose, illumination, and background. In our
experiments with an off-the-shelf face recognition software we observe the
following phenomena: 1) The amount of real training data needed to train
competitive deep face recognition systems can be reduced significantly. 2)
Combining large-scale real-world data with synthetic data leads to an increased
performance. 3) Models trained only on synthetic data with strong variations in
pose, illumination, and background perform very well across different datasets
even without dataset adaptation. 4) The real-to-virtual performance gap can be
closed when using synthetic data for pre-training, followed by fine-tuning with
real-world images. 5) There are no observable negative effects of pre-training
with synthetic data. Thus, any face recognition system in our experiments
benefits from using synthetic face images. The synthetic data generator, as
well as all experiments, are publicly available.
| cs.CV | recent advances in deep learning have significantly increased the performance of face recognition systems the performance and reliability of these models depend heavily on the amount and quality of the training data however the collection of annotated large datasets does not scale well and the control over the quality of the data decreases with the size of the dataset in this work we explore how synthetically generated data can be used to decrease the number of realworld images needed for training deep face recognition systems in particular we make use of a 3d morphable face model for the generation of images with arbitrary amounts of facial identities and with full control over image variations such as pose illumination and background in our experiments with an offtheshelf face recognition software we observe the following phenomena 1 the amount of real training data needed to train competitive deep face recognition systems can be reduced significantly 2 combining largescale realworld data with synthetic data leads to an increased performance 3 models trained only on synthetic data with strong variations in pose illumination and background perform very well across different datasets even without dataset adaptation 4 the realtovirtual performance gap can be closed when using synthetic data for pretraining followed by finetuning with realworld images 5 there are no observable negative effects of pretraining with synthetic data thus any face recognition system in our experiments benefits from using synthetic face images the synthetic data generator as well as all experiments are publicly available | [['recent', 'advances', 'in', 'deep', 'learning', 'have', 'significantly', 'increased', 'the', 'performance', 'of', 'face', 'recognition', 'systems', 'the', 'performance', 'and', 'reliability', 'of', 'these', 'models', 'depend', 'heavily', 'on', 'the', 'amount', 'and', 'quality', 'of', 'the', 'training', 'data', 'however', 'the', 'collection', 'of', 'annotated', 'large', 'datasets', 'does', 'not', 'scale', 'well', 'and', 'the', 'control', 'over', 'the', 'quality', 'of', 'the', 'data', 'decreases', 'with', 'the', 'size', 'of', 'the', 'dataset', 'in', 'this', 'work', 'we', 'explore', 'how', 'synthetically', 'generated', 'data', 'can', 'be', 'used', 'to', 'decrease', 'the', 'number', 'of', 'realworld', 'images', 'needed', 'for', 'training', 'deep', 'face', 'recognition', 'systems', 'in', 'particular', 'we', 'make', 'use', 'of', 'a', '3d', 'morphable', 'face', 'model', 'for', 'the', 'generation', 'of', 'images', 'with', 'arbitrary', 'amounts', 'of', 'facial', 'identities', 'and', 'with', 'full', 'control', 'over', 'image', 'variations', 'such', 'as', 'pose', 'illumination', 'and', 'background', 'in', 'our', 'experiments', 'with', 'an', 'offtheshelf', 'face', 'recognition', 'software', 'we', 'observe', 'the', 'following', 'phenomena', '1', 'the', 'amount', 'of', 'real', 'training', 'data', 'needed', 'to', 'train', 'competitive', 'deep', 'face', 'recognition', 'systems', 'can', 'be', 'reduced', 'significantly', '2', 'combining', 'largescale', 'realworld', 'data', 'with', 'synthetic', 'data', 'leads', 'to', 'an', 'increased', 'performance', '3', 'models', 'trained', 'only', 'on', 'synthetic', 'data', 'with', 'strong', 'variations', 'in', 'pose', 'illumination', 'and', 'background', 'perform', 'very', 'well', 'across', 'different', 'datasets', 'even', 'without', 'dataset', 'adaptation', '4', 'the', 'realtovirtual', 'performance', 'gap', 'can', 'be', 'closed', 'when', 'using', 'synthetic', 'data', 'for', 'pretraining', 'followed', 'by', 'finetuning', 'with', 'realworld', 'images', '5', 'there', 'are', 'no', 'observable', 'negative', 'effects', 'of', 'pretraining', 'with', 'synthetic', 'data', 'thus', 'any', 'face', 'recognition', 'system', 'in', 'our', 'experiments', 'benefits', 'from', 'using', 'synthetic', 'face', 'images', 'the', 'synthetic', 'data', 'generator', 'as', 'well', 'as', 'all', 'experiments', 'are', 'publicly', 'available']] | [-0.034219857911209024, 0.007082199365163341, -0.0014441403238678791, 0.02651813401079486, -0.0694960734197294, -0.1479096640131425, -0.019200808688882274, 0.4644689008361664, -0.2515358775124762, -0.42192645167490567, 0.14917609126524004, -0.30289613455417097, -0.1413465724981214, 0.25617901253398045, -0.1560795296817629, 0.09364032128874407, 0.2047497914602838, 0.024880429587689747, -0.05428177880739932, -0.3355589769275702, 0.31104154635807985, 0.03923029028943807, 0.3554039087149326, 0.05048766897909014, 0.09675464989434195, -0.04509187091177472, -0.030258956936610692, 0.009234448647066712, -0.01281728191419512, 0.16244549631378633, 0.28776316910956534, 0.2243468441484294, 0.2310982784910883, -0.4414659453570903, -0.22417271440384917, 0.10764620285930045, 0.12462859060877118, 0.1218305766690255, -0.08792615613346567, -0.3485332028930969, 0.07027729777955866, -0.1356014334456434, 0.00475701702998046, -0.1543505358711693, -0.007023421280744325, -0.0001758909639322674, -0.30853869465608, 0.04669207315162632, 0.022481777068006855, 0.15108704254270558, -0.05848556905367737, -0.110975283018059, -0.024300529586944175, 0.21851420211318195, 0.04660803643775258, 0.03273765840212325, 0.13194002098675975, -0.23395316071582054, -0.13702434823515425, 0.3900090228807346, -0.09749748087843439, -0.2033285408329413, 0.2214609106991395, -0.07087008463196366, -0.11938706359612834, 0.1435754797440097, 0.2520984160409021, 0.10126842106374571, -0.11870070487798713, 0.030171177803022586, -0.04536391655918226, 0.22675427801375947, 0.031030658973814792, -0.029039698176976127, 0.16677168848780338, 0.2488635816184961, -0.01633857878674959, 0.14278701177459718, -0.18877973572779297, -0.013197254881367507, -0.19168929451605282, -0.05731760781168579, -0.21567517358026128, -0.0020794634188662834, -0.14419913143782137, -0.13689690629248488, 0.36667093525951105, 0.25860090878040315, 0.24428267874773665, 0.08733738792616497, 0.3663161464753639, 0.008672542832174664, 0.16705795183093344, 0.04684289520135127, 0.1799618735583125, -0.051909322924743664, 0.12738951852444155, -0.18245078960759004, 0.06594152078658985, -0.061117605058416485] |
1,802.05892 | Neuroscientific User Models: The Source of Uncertain User Feedback and
Potentials for Improving Web Personalisation | In this paper we consider the neuroscientific theory of the Bayesian brain in
the light of adaptive web systems and content personalisation. In particular,
we elaborate on neural mechanisms of human decision-making and the origin of
lacking reliability of user feedback, often denoted as noise or human
uncertainty. To this end, we first introduce an adaptive model of cognitive
agency in which populations of neurons provide an estimation for states of the
world. Subsequently, we present various so-called decoder functions with which
neuronal activity can be translated into quantitative decisions. The interplay
of the underlying cognition model and the chosen decoder function leads to
different model-based properties of decision processes. The goal of this paper
is to promote novel user models and exploit them to naturally associate users
to different clusters on the basis of their individual neural characteristics
and thinking patterns. These user models might be able to turn the variability
of user behaviour into additional information for improving web personalisation
and its experience.
| cs.HC cs.NE | in this paper we consider the neuroscientific theory of the bayesian brain in the light of adaptive web systems and content personalisation in particular we elaborate on neural mechanisms of human decisionmaking and the origin of lacking reliability of user feedback often denoted as noise or human uncertainty to this end we first introduce an adaptive model of cognitive agency in which populations of neurons provide an estimation for states of the world subsequently we present various socalled decoder functions with which neuronal activity can be translated into quantitative decisions the interplay of the underlying cognition model and the chosen decoder function leads to different modelbased properties of decision processes the goal of this paper is to promote novel user models and exploit them to naturally associate users to different clusters on the basis of their individual neural characteristics and thinking patterns these user models might be able to turn the variability of user behaviour into additional information for improving web personalisation and its experience | [['in', 'this', 'paper', 'we', 'consider', 'the', 'neuroscientific', 'theory', 'of', 'the', 'bayesian', 'brain', 'in', 'the', 'light', 'of', 'adaptive', 'web', 'systems', 'and', 'content', 'personalisation', 'in', 'particular', 'we', 'elaborate', 'on', 'neural', 'mechanisms', 'of', 'human', 'decisionmaking', 'and', 'the', 'origin', 'of', 'lacking', 'reliability', 'of', 'user', 'feedback', 'often', 'denoted', 'as', 'noise', 'or', 'human', 'uncertainty', 'to', 'this', 'end', 'we', 'first', 'introduce', 'an', 'adaptive', 'model', 'of', 'cognitive', 'agency', 'in', 'which', 'populations', 'of', 'neurons', 'provide', 'an', 'estimation', 'for', 'states', 'of', 'the', 'world', 'subsequently', 'we', 'present', 'various', 'socalled', 'decoder', 'functions', 'with', 'which', 'neuronal', 'activity', 'can', 'be', 'translated', 'into', 'quantitative', 'decisions', 'the', 'interplay', 'of', 'the', 'underlying', 'cognition', 'model', 'and', 'the', 'chosen', 'decoder', 'function', 'leads', 'to', 'different', 'modelbased', 'properties', 'of', 'decision', 'processes', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'promote', 'novel', 'user', 'models', 'and', 'exploit', 'them', 'to', 'naturally', 'associate', 'users', 'to', 'different', 'clusters', 'on', 'the', 'basis', 'of', 'their', 'individual', 'neural', 'characteristics', 'and', 'thinking', 'patterns', 'these', 'user', 'models', 'might', 'be', 'able', 'to', 'turn', 'the', 'variability', 'of', 'user', 'behaviour', 'into', 'additional', 'information', 'for', 'improving', 'web', 'personalisation', 'and', 'its', 'experience']] | [-0.08791394874058438, 0.06282589594343198, -0.0928228110357216, 0.08931140174990464, -0.1388821654289848, -0.1474188409265921, 0.08849882897779797, 0.41176233288944897, -0.2960590634212801, -0.3191591443642127, 0.05257545164927389, -0.24512807518511898, -0.2374194305799337, 0.12474564551375807, -0.139460578335054, 0.025984223017285608, 0.023270497269307574, 0.0513349816811652, 0.002804534351735404, -0.25839103237358907, 0.3306688390615763, 0.10466555350770552, 0.30168682724717216, 0.02238417257075057, 0.09427138704693679, -0.0021123503109045103, -0.054043829767739006, -0.04175639451467291, -0.10515225302555006, 0.19272458950960727, 0.3112895213990476, 0.24293230259438242, 0.3244402796933145, -0.47465660429813644, -0.2298521418180881, 0.07977081499429363, 0.16367242229488593, 0.062031390179287306, -0.008537822125028028, -0.32585992374259865, 0.08102696659607869, -0.18686905722274924, -0.04878408345817165, -0.05892883450865294, -0.04779642866359967, 0.014714719098077639, -0.2651063597676429, 0.006660983587304751, 0.07292246876820696, 0.09298405266846671, -0.07371685694776137, -0.07038571343220996, -0.0013012060902617647, 0.23418722937702005, 0.0599222797836939, -0.007552907532645446, 0.1568406750448048, -0.17462361141841745, -0.1594032254832035, 0.3492309734719156, 0.015709217578511347, -0.205595931760741, 0.21843742517697992, -0.08780663006931938, -0.1531740519726141, 0.06487465974253913, 0.29298682219602845, 0.0648021653125232, -0.20598288214567936, -0.006040981239074785, 0.008801783231496246, 0.19197252929549324, -0.0003397222968818493, 0.06358002588491549, 0.21509625823378112, 0.21900576339949937, 0.02740183665106694, 0.13243051056863006, -0.04256133061681987, -0.09078750050640806, -0.23631212576998004, -0.13091543501976766, -0.1119351959533312, 0.010058460473859061, -0.09659472193628917, -0.15760210659354926, 0.41758671523156493, 0.21234769966368647, 0.18296193927244256, 0.07531611762207115, 0.3017206477960854, 0.08408755280119791, 0.05139590620458352, 0.028536139095597195, 0.16079471828698208, 0.055433494630128595, 0.12188317155126821, -0.20321570658830532, 0.13110731917179444, 0.013369606366155274] |
1,802.05893 | A dual origin for water in carbonaceous asteroids revealed by CM
chondrites | Carbonaceous asteroids represent the principal source of water in the inner
Solar System and might correspond to the main contributors for the delivery of
water to Earth. Hydrogen isotopes in water-bearing primitive meteorites, e.g.
carbonaceous chondrites, constitute a unique tool for deciphering the sources
of water reservoirs at the time of asteroid formation. However, fine-scale
isotopic measurements are required to unravel the effects of parent body
processes on the pre-accretion isotopic distributions. Here we report in situ
micrometer-scale analyses of hydrogen isotopes in six CM-type carbonaceous
chondrites revealing a dominant deuterium-poor water component ({\delta}D =
-350 +/- 40 permil) mixed with deuterium-rich organic matter. We suggest that
this D-poor water corresponds to a ubiquitous water reservoir in the inner
protoplanetary disk. A deuterium-rich water signature has been preserved in the
least altered part of the Paris chondrite ({\delta}DParis > -69 +/- 163 permil)
in hydrated phases possibly present in the CM rock before alteration. The
presence of the D-enriched water signature in Paris might indicate that
transfers of ice from the outer to the inner Solar System have been significant
within the first million years of the Solar System history.
| astro-ph.EP | carbonaceous asteroids represent the principal source of water in the inner solar system and might correspond to the main contributors for the delivery of water to earth hydrogen isotopes in waterbearing primitive meteorites eg carbonaceous chondrites constitute a unique tool for deciphering the sources of water reservoirs at the time of asteroid formation however finescale isotopic measurements are required to unravel the effects of parent body processes on the preaccretion isotopic distributions here we report in situ micrometerscale analyses of hydrogen isotopes in six cmtype carbonaceous chondrites revealing a dominant deuteriumpoor water component deltad 350 40 permil mixed with deuteriumrich organic matter we suggest that this dpoor water corresponds to a ubiquitous water reservoir in the inner protoplanetary disk a deuteriumrich water signature has been preserved in the least altered part of the paris chondrite deltadparis 69 163 permil in hydrated phases possibly present in the cm rock before alteration the presence of the denriched water signature in paris might indicate that transfers of ice from the outer to the inner solar system have been significant within the first million years of the solar system history | [['carbonaceous', 'asteroids', 'represent', 'the', 'principal', 'source', 'of', 'water', 'in', 'the', 'inner', 'solar', 'system', 'and', 'might', 'correspond', 'to', 'the', 'main', 'contributors', 'for', 'the', 'delivery', 'of', 'water', 'to', 'earth', 'hydrogen', 'isotopes', 'in', 'waterbearing', 'primitive', 'meteorites', 'eg', 'carbonaceous', 'chondrites', 'constitute', 'a', 'unique', 'tool', 'for', 'deciphering', 'the', 'sources', 'of', 'water', 'reservoirs', 'at', 'the', 'time', 'of', 'asteroid', 'formation', 'however', 'finescale', 'isotopic', 'measurements', 'are', 'required', 'to', 'unravel', 'the', 'effects', 'of', 'parent', 'body', 'processes', 'on', 'the', 'preaccretion', 'isotopic', 'distributions', 'here', 'we', 'report', 'in', 'situ', 'micrometerscale', 'analyses', 'of', 'hydrogen', 'isotopes', 'in', 'six', 'cmtype', 'carbonaceous', 'chondrites', 'revealing', 'a', 'dominant', 'deuteriumpoor', 'water', 'component', 'deltad', '350', '40', 'permil', 'mixed', 'with', 'deuteriumrich', 'organic', 'matter', 'we', 'suggest', 'that', 'this', 'dpoor', 'water', 'corresponds', 'to', 'a', 'ubiquitous', 'water', 'reservoir', 'in', 'the', 'inner', 'protoplanetary', 'disk', 'a', 'deuteriumrich', 'water', 'signature', 'has', 'been', 'preserved', 'in', 'the', 'least', 'altered', 'part', 'of', 'the', 'paris', 'chondrite', 'deltadparis', '69', '163', 'permil', 'in', 'hydrated', 'phases', 'possibly', 'present', 'in', 'the', 'cm', 'rock', 'before', 'alteration', 'the', 'presence', 'of', 'the', 'denriched', 'water', 'signature', 'in', 'paris', 'might', 'indicate', 'that', 'transfers', 'of', 'ice', 'from', 'the', 'outer', 'to', 'the', 'inner', 'solar', 'system', 'have', 'been', 'significant', 'within', 'the', 'first', 'million', 'years', 'of', 'the', 'solar', 'system', 'history']] | [-0.08274094842292451, 0.15937886681474214, -0.05343027990746343, 0.008687945494075193, 0.025537147258336727, -0.028779105184175032, 0.015926215044161366, 0.31605885488973867, -0.21641991880036646, -0.33037834518312753, 0.07090320269888073, -0.33219065647418766, -0.07721774096365322, 0.13962556386352415, -0.043461438082926136, -0.013115803040768747, 0.07890706625255337, -0.052079234178853476, -0.03221412320943692, -0.20016111543780746, 0.24265418464450964, 0.09037994410699376, 0.13382043152699594, 0.05351434509362002, 0.053375382495117835, -0.13387009432503524, -0.029703985750209858, -0.10248019358982424, -0.12011817144014128, 0.12068261416465208, 0.2965196808019735, 0.06545765941532758, 0.17192213196412323, -0.47786671367913974, -0.2561247476343332, 0.09206138653962126, 0.10141065078594014, 0.04963291054054235, -0.050943039467361256, -0.21916457728462313, 0.05095709086834596, -0.1913908887040484, -0.17678968434396025, 0.07114695578750868, 0.07657330153909113, -0.009400611081298768, -0.1776893300579664, 0.09856542994544565, 0.038359318140914644, 0.137919943565426, -0.1610263487839672, -0.22485020538282857, -0.09389079291217418, 0.11042590126469425, 0.042304548869871506, -0.05562840242215156, 0.24561579187994229, -0.05010661195610537, 0.011924637793716822, 0.4599064952376616, -0.10681782068638643, -0.027173634568628455, 0.25334911701361557, -0.21626214133353283, -0.1702350497880316, 0.267160198955725, 0.17793662083632017, 0.08025104102197585, -0.19120643205255025, -0.005609287934411051, -0.07347585864820527, 0.20815005469402031, 0.09766274346243385, 0.04175009349921391, 0.306229733004859, 0.19670031068252994, 0.008613653231545218, 0.10193892141706873, -0.16927304930836576, -0.052209323118594324, -0.19144431282100932, -0.25572744508243195, -0.1051178887412259, 0.03359588745925166, -0.06051921978288082, -0.1379101125288059, 0.32810519911723973, 0.09857342206261499, 0.13797461503993844, -0.05839261654726035, 0.23794147761917295, -0.0430814217121064, 0.1195476304555496, 0.06695714673944647, 0.28994786739861084, 0.12527663702181038, 0.12230787620685257, -0.2371944616494987, 0.18313760472113613, 0.0007765948769871842] |
1,802.05894 | Conjugation of semisimple subgroups over real number fields of bounded
degree | Let $G$ be a linear algebraic group over a field $k$ of characteristic 0. We
show that any two connected semisimple $k$-subgroups of $G$ that are conjugate
over an algebraic closure of $k$ are actually conjugate over a finite field
extension of $k$ of degree bounded independently of the subgroups. Moreover, if
$k$ is a real number field, we show that any two connected semisimple
$k$-subgroups of $G$ that are conjugate over the field of real numbers
$\mathbb{R}$ are actually conjugate over a finite real extension of $k$ of
degree bounded independently of the subgroups.
| math.GR math.AG math.NT | let g be a linear algebraic group over a field k of characteristic 0 we show that any two connected semisimple ksubgroups of g that are conjugate over an algebraic closure of k are actually conjugate over a finite field extension of k of degree bounded independently of the subgroups moreover if k is a real number field we show that any two connected semisimple ksubgroups of g that are conjugate over the field of real numbers mathbbr are actually conjugate over a finite real extension of k of degree bounded independently of the subgroups | [['let', 'g', 'be', 'a', 'linear', 'algebraic', 'group', 'over', 'a', 'field', 'k', 'of', 'characteristic', '0', 'we', 'show', 'that', 'any', 'two', 'connected', 'semisimple', 'ksubgroups', 'of', 'g', 'that', 'are', 'conjugate', 'over', 'an', 'algebraic', 'closure', 'of', 'k', 'are', 'actually', 'conjugate', 'over', 'a', 'finite', 'field', 'extension', 'of', 'k', 'of', 'degree', 'bounded', 'independently', 'of', 'the', 'subgroups', 'moreover', 'if', 'k', 'is', 'a', 'real', 'number', 'field', 'we', 'show', 'that', 'any', 'two', 'connected', 'semisimple', 'ksubgroups', 'of', 'g', 'that', 'are', 'conjugate', 'over', 'the', 'field', 'of', 'real', 'numbers', 'mathbbr', 'are', 'actually', 'conjugate', 'over', 'a', 'finite', 'real', 'extension', 'of', 'k', 'of', 'degree', 'bounded', 'independently', 'of', 'the', 'subgroups']] | [-0.2703584300550191, 0.1828963043819194, -0.10932209040773543, -0.06899876941216031, -0.13481889990599533, -0.13129865216875547, -0.002929835746947088, 0.37793087006399506, -0.3277327265786497, -0.21180468582009015, 0.05640556993649194, -0.24254276485819565, -0.11660044720690502, 0.2403891542044125, -0.047699295910761545, -0.10048085802087658, 0.016842367877497485, 0.21539454040558714, -0.07390177917519683, -0.3202822487017042, 0.35597775202048454, -0.1803697947804865, 0.14561822087945123, 0.01284287056248439, 0.11386536868583215, -0.010650006402283908, 0.029945714376548208, 0.0979418719947142, -0.074565057801144, 0.05843813896767403, 0.3074608450265307, 0.10313306243011826, 0.27459210706384557, -0.3130394088202401, -0.20289831531087035, 0.2806705200358441, 0.1679953626602104, -0.07024895597837473, 0.015776389876478596, -0.2265686486308512, 0.21535944818077904, -0.1497947733729808, -0.11970559442906004, -0.05815983611698213, 0.09013409979739472, 0.04002330055166232, -0.27130874328707394, -0.032045930829879485, 0.08368001874340208, 0.20563107721115415, -0.00814141499270734, -0.1503366491291672, -0.06515895902718369, 0.048472323768625133, -0.05153578485019113, 0.08165536158669152, 0.08338231773262746, -0.05052142083448799, -0.09865488442347238, 0.3465151712984631, -0.11934099627511674, -0.20311892177713545, 0.13163065226062348, -0.1924502198143225, -0.09242187664648027, 0.1638952748751954, 0.12436873014820249, 0.18062249841658692, -0.007069441185970055, 0.25479940109347043, -0.1674892575332993, 0.10043575885264497, 0.06568756345659495, -0.07366611361013431, 0.12041425555454273, 0.011713049102476553, 0.133460492895622, 0.08754904381318115, 0.055025657344805565, 0.014437510252096936, -0.4025584388720362, -0.17376563781382223, -0.19927014834002443, 0.15255924012560987, -0.14624168584613423, -0.17053548688755224, 0.4156008229051766, 0.07789651389772954, 0.1856359366523592, 0.12155240581027771, 0.22920646765514424, 0.06294714117814836, 0.051649699423854285, 0.12861637927493766, 0.038807030987778775, 0.2780837543308735, -0.13536970877260165, -0.20487057843098516, -0.029786049922634113, 0.064053345742133] |
1,802.05895 | Dealing with Uncertainties in User Feedback: Strategies Between Denying
and Accepting | Latest research revealed a considerable lack of reliability within user
feedback and discussed striking impacts for the assessment of adaptive web
systems and content personalisation approaches, e.g. ranking errors, systematic
biases to accuracy metrics as well as its natural offset (the magic barrier).
In order to perform holistic assessments and to improve web systems, a variety
of strategies have been proposed to deal with this so-called human uncertainty.
In this contribution we discuss the most relevant strategies to handle
uncertain feedback and demonstrate that these approaches are more or less
ineffective to fulfil their objectives. In doing so, we consider human
uncertainty within a purely probabilistic framework and utilise hypothesis
testing as well as a generalisation of the magic barrier to compare the effects
of recently proposed algorithms. On this basis we recommend a novel strategy of
acceptance which turns away from mere filtering and discuss potential benefits
for the community of the WWW.
| cs.HC cs.IR | latest research revealed a considerable lack of reliability within user feedback and discussed striking impacts for the assessment of adaptive web systems and content personalisation approaches eg ranking errors systematic biases to accuracy metrics as well as its natural offset the magic barrier in order to perform holistic assessments and to improve web systems a variety of strategies have been proposed to deal with this socalled human uncertainty in this contribution we discuss the most relevant strategies to handle uncertain feedback and demonstrate that these approaches are more or less ineffective to fulfil their objectives in doing so we consider human uncertainty within a purely probabilistic framework and utilise hypothesis testing as well as a generalisation of the magic barrier to compare the effects of recently proposed algorithms on this basis we recommend a novel strategy of acceptance which turns away from mere filtering and discuss potential benefits for the community of the www | [['latest', 'research', 'revealed', 'a', 'considerable', 'lack', 'of', 'reliability', 'within', 'user', 'feedback', 'and', 'discussed', 'striking', 'impacts', 'for', 'the', 'assessment', 'of', 'adaptive', 'web', 'systems', 'and', 'content', 'personalisation', 'approaches', 'eg', 'ranking', 'errors', 'systematic', 'biases', 'to', 'accuracy', 'metrics', 'as', 'well', 'as', 'its', 'natural', 'offset', 'the', 'magic', 'barrier', 'in', 'order', 'to', 'perform', 'holistic', 'assessments', 'and', 'to', 'improve', 'web', 'systems', 'a', 'variety', 'of', 'strategies', 'have', 'been', 'proposed', 'to', 'deal', 'with', 'this', 'socalled', 'human', 'uncertainty', 'in', 'this', 'contribution', 'we', 'discuss', 'the', 'most', 'relevant', 'strategies', 'to', 'handle', 'uncertain', 'feedback', 'and', 'demonstrate', 'that', 'these', 'approaches', 'are', 'more', 'or', 'less', 'ineffective', 'to', 'fulfil', 'their', 'objectives', 'in', 'doing', 'so', 'we', 'consider', 'human', 'uncertainty', 'within', 'a', 'purely', 'probabilistic', 'framework', 'and', 'utilise', 'hypothesis', 'testing', 'as', 'well', 'as', 'a', 'generalisation', 'of', 'the', 'magic', 'barrier', 'to', 'compare', 'the', 'effects', 'of', 'recently', 'proposed', 'algorithms', 'on', 'this', 'basis', 'we', 'recommend', 'a', 'novel', 'strategy', 'of', 'acceptance', 'which', 'turns', 'away', 'from', 'mere', 'filtering', 'and', 'discuss', 'potential', 'benefits', 'for', 'the', 'community', 'of', 'the', 'www']] | [-0.04898714534439413, -0.001875725786455653, -0.06021653038945485, 0.12157316576740886, -0.11891770752316172, -0.14039411147838676, 0.11619190064367729, 0.4082373869544887, -0.24901050074984526, -0.36228156633457387, 0.10580340425208719, -0.2595311676926137, -0.15248547408082705, 0.18855764812868475, -0.13710971177493633, 0.07996342223713646, 0.06782171494998764, 0.008487353748460482, -0.0675167598952116, -0.24927037849254277, 0.3097364820461333, 0.12490926102686722, 0.29605866590206353, 0.07183616200776456, 0.08774675796879607, -0.008329712949064257, -0.08926948749266758, 0.05071913900894004, -0.10133265849988486, 0.13455217450784593, 0.2878729848662851, 0.19389450426558152, 0.35518459826949744, -0.39738574009025834, -0.23751976569379715, 0.09225871502845125, 0.1417718326733198, 0.11393143417080864, -0.058985638773607775, -0.3184357709372295, 0.07691420631954907, -0.23599093917805652, -0.08619926632502926, -0.1113822950691275, 0.0071672083592260035, 0.02620075258998334, -0.2504957003289132, 0.026365693362260408, 0.037487273532352955, 0.07867969758808613, -0.018172964283609885, -0.1524914278310131, 0.02563261370440679, 0.16777254068806718, 0.06980091876081228, -0.006766770270882876, 0.15361038856994505, -0.14229370939791772, -0.17763284792331374, 0.4101720851204999, -0.0032188865233684417, -0.19087626318622672, 0.2040740231750533, -0.07197056717674744, -0.16783988126251217, 0.07566798979404395, 0.23345381843361568, 0.08107668755110353, -0.16282274756979728, 0.01923143912436344, 0.04778773644969303, 0.16796399745485419, 0.02847124757124232, 0.05957409377387867, 0.18823048960744077, 0.20768064739448683, 0.07368973348223205, 0.11395208257879433, -0.052240309869423025, -0.10774727915292727, -0.24121055637135522, -0.13156941606566408, -0.11387300266968933, -0.024542067449406853, -0.040369165963954415, -0.15537143948582618, 0.3512725323898258, 0.23503728047642228, 0.16760398846651828, 0.048322467850793346, 0.3311052649802008, 0.047927583098735106, 0.08918466062932094, 0.016640505864581264, 0.24053645073912444, 0.04441580941368427, 0.11668753193225712, -0.17593130780619798, 0.09682127603559525, -0.013092572335153818] |
1,802.05896 | Beryllium detection in the very fast nova ASASSN-16kt (V407 Lupi) | We present high-resolution spectroscopic observations of the fast nova
ASASSN-16kt (V407 Lup). A close inspection of spectra obtained at early stages
has revealed the presence of low-ionization lines, and among the others we have
identified the presence of the ionised $^7$Be doublet in a region relatively
free from possible contaminants. After studying their intensities, we have
inferred that ASASSN-16kt has produced (5.9 - 7.7)$ \times 10^{-9}$ M$_{\odot}$
of $^7$Be. The identification of bright Ne lines may suggest that the nova
progenitor is a massive (1.2 M$_{\odot}$) oxygen-neon white dwarf. The high
outburst frequency of oxygen-neon novae implies that they likely produce an
amount of Be similar, if not larger, to that produced by carbon-oxygen novae,
then confirming that classical novae are among the main factories of lithium in
the Galaxy.
| astro-ph.SR | we present highresolution spectroscopic observations of the fast nova asassn16kt v407 lup a close inspection of spectra obtained at early stages has revealed the presence of lowionization lines and among the others we have identified the presence of the ionised 7be doublet in a region relatively free from possible contaminants after studying their intensities we have inferred that asassn16kt has produced 59 77 times 109 m_odot of 7be the identification of bright ne lines may suggest that the nova progenitor is a massive 12 m_odot oxygenneon white dwarf the high outburst frequency of oxygenneon novae implies that they likely produce an amount of be similar if not larger to that produced by carbonoxygen novae then confirming that classical novae are among the main factories of lithium in the galaxy | [['we', 'present', 'highresolution', 'spectroscopic', 'observations', 'of', 'the', 'fast', 'nova', 'asassn16kt', 'v407', 'lup', 'a', 'close', 'inspection', 'of', 'spectra', 'obtained', 'at', 'early', 'stages', 'has', 'revealed', 'the', 'presence', 'of', 'lowionization', 'lines', 'and', 'among', 'the', 'others', 'we', 'have', 'identified', 'the', 'presence', 'of', 'the', 'ionised', '7be', 'doublet', 'in', 'a', 'region', 'relatively', 'free', 'from', 'possible', 'contaminants', 'after', 'studying', 'their', 'intensities', 'we', 'have', 'inferred', 'that', 'asassn16kt', 'has', 'produced', '59', '77', 'times', '109', 'm_odot', 'of', '7be', 'the', 'identification', 'of', 'bright', 'ne', 'lines', 'may', 'suggest', 'that', 'the', 'nova', 'progenitor', 'is', 'a', 'massive', '12', 'm_odot', 'oxygenneon', 'white', 'dwarf', 'the', 'high', 'outburst', 'frequency', 'of', 'oxygenneon', 'novae', 'implies', 'that', 'they', 'likely', 'produce', 'an', 'amount', 'of', 'be', 'similar', 'if', 'not', 'larger', 'to', 'that', 'produced', 'by', 'carbonoxygen', 'novae', 'then', 'confirming', 'that', 'classical', 'novae', 'are', 'among', 'the', 'main', 'factories', 'of', 'lithium', 'in', 'the', 'galaxy']] | [-0.04771899620329153, 0.14330871053892386, -0.026309674869240948, 0.08535423647890286, -0.03650469244854857, -0.1349461733926694, 0.08962475399255695, 0.39186902101649795, -0.12463043931178576, -0.3259035630418753, 0.05116376845985507, -0.3351898156250863, -0.024339034106553525, 0.19996877899754417, -0.06385480063672308, -0.07481701391236495, 0.1702187646815712, -0.061756769654091964, -0.05624559493112746, -0.2916723650179861, 0.25249215063833913, 0.07376000981835663, 0.11566704104820541, -0.05308908746801606, 0.039141461736876375, -0.12488666898390466, -0.051467975998629435, -0.11497548358991395, -0.09291493584174715, -0.0016363621147912602, 0.2431475927334914, 0.1693303894951882, 0.19359622030814952, -0.3749063574499631, -0.2329854028183938, 0.11113870033758327, 0.23015982665431997, 0.017284565052927234, -0.09035316137091597, -0.2728396100677954, 0.1169250945198754, -0.18852923201873553, -0.17588737077132055, 0.06753580418754687, 0.0819778785546303, 0.04207285258976757, -0.21872350698708765, 0.12435453740316768, 0.046705076479093104, 0.07540084214072472, -0.11719991177204968, -0.12294154909489922, -0.0823540925950736, 0.04300811099133981, 0.0538083918233828, 0.03687996737832247, 0.1384242158202642, -0.10993222587980157, -0.001983620800337819, 0.3860352780465073, -0.10574365232515243, 0.08718156776582288, 0.2765144860992829, -0.19787400032577732, -0.2076310470101041, 0.2200230221090795, 0.09819618449726886, 0.13033265705841282, -0.16600897969847703, -0.033791096415821925, -0.0332507542172057, 0.20126087946254154, 0.048221138031619, 0.0884815077388762, 0.3067613813679579, 0.110952387924862, -0.04277481383776253, 0.07183709308548375, -0.26319716091072837, -0.016503267748689265, -0.21852474964346535, -0.12233323537087602, -0.12125299198466331, 0.13584628065539497, -0.0727501632274596, -0.09108371338121189, 0.3210274497707656, 0.09109758748718025, 0.22231350710990933, -0.06840751930401667, 0.2543308554549319, 0.07705607858681401, 0.09214455124835462, 0.13289571620249588, 0.36170136023226174, 0.19520190752891087, 0.11350012456550616, -0.23901818939231972, 0.11715955630146949, 0.01434626139324996] |
1,802.05897 | The generalized bi-periodic Fibonacci quaternions and octonions | In this paper, we present a further generalization of the bi- periodic
Fibonacci quaternions and octonions. We give the generating function, the Binet
formula, and some basic properties of these quaternions and octonions. The
results of this paper not only give a generalization of the bi-periodic
Fibonacci quaternions and octonions, but also include new results such as the
matrix representation and the norm value of the generalized bi-periodic
Fibonacci quaternions.
| math.NT | in this paper we present a further generalization of the bi periodic fibonacci quaternions and octonions we give the generating function the binet formula and some basic properties of these quaternions and octonions the results of this paper not only give a generalization of the biperiodic fibonacci quaternions and octonions but also include new results such as the matrix representation and the norm value of the generalized biperiodic fibonacci quaternions | [['in', 'this', 'paper', 'we', 'present', 'a', 'further', 'generalization', 'of', 'the', 'bi', 'periodic', 'fibonacci', 'quaternions', 'and', 'octonions', 'we', 'give', 'the', 'generating', 'function', 'the', 'binet', 'formula', 'and', 'some', 'basic', 'properties', 'of', 'these', 'quaternions', 'and', 'octonions', 'the', 'results', 'of', 'this', 'paper', 'not', 'only', 'give', 'a', 'generalization', 'of', 'the', 'biperiodic', 'fibonacci', 'quaternions', 'and', 'octonions', 'but', 'also', 'include', 'new', 'results', 'such', 'as', 'the', 'matrix', 'representation', 'and', 'the', 'norm', 'value', 'of', 'the', 'generalized', 'biperiodic', 'fibonacci', 'quaternions']] | [-0.14760042582971178, 0.10097481054919107, -0.05801333158784213, 0.10227782624840204, -0.14159900809505155, -0.06779215186834335, 0.02333838829571115, 0.33552521275622504, -0.345701821574143, -0.24850097676473004, 0.10108591785621164, -0.22211893888722573, -0.32103593040789874, 0.16768200024962426, -0.12399834035895765, -0.015619104595056601, 0.05937623914796859, 0.06561579926471625, -0.14881287125338402, -0.3024761707655021, 0.31042993257620505, -0.002901571598236582, 0.15633714123229894, 0.03808040565678052, 0.10193571500214083, 0.012615066287772996, -0.02774491505032139, -0.07273442899542196, -0.1625896145722696, 0.14754155978360878, 0.15826808347233703, 0.1535277391650847, 0.1940996326073738, -0.43755930491856165, -0.06522690386045724, 0.13052617726581436, 0.222776333881276, 0.030962316174243044, -0.0799875898020608, -0.2585300104160394, 0.047136616720152756, -0.19400215249042957, -0.1526385054790548, -0.15370399718106326, 0.04756629706493446, 0.09003070406615735, -0.2220672751710351, 0.024520096358693472, 0.13888648258788244, 0.12337049615910343, -0.07216861254336046, -0.22773256030465874, 0.05833718432778759, 0.08960314348473081, 0.042321069605116335, -0.03598149641017829, 0.002148329107356923, -0.06195164284934955, -0.1432860574818083, 0.40969481989616596, 0.008779743014435683, -0.3120654751513419, 0.014906724475856338, -0.1493502723518759, -0.15661551396229437, 0.005904872402814882, 0.10238853562623262, 0.12026687961603914, -0.1030978114743318, 0.06687910157904428, -0.18743877256555216, 0.09369369952806404, 0.1432672807281571, 0.07642226990844522, 0.13867641567651715, 0.03703830106449979, -0.007603098611746515, 0.20473083520441182, -0.012634942893471036, -0.07744921463807779, -0.3136751559163843, -0.3023531480259927, -0.21789867331140808, 0.08894604110246292, -0.15800655020429985, -0.22079325579106807, 0.4914728877267667, 0.13174235720985703, 0.14860939857150826, 0.10481980477592774, 0.24219460545240767, 0.1431967092395228, 0.10935166055070503, -0.0404716709362609, 0.09354092848495514, 0.27814204997516107, 0.08439375851719108, -0.13651100759327944, -0.07738272639191045, 0.1813432039759521] |
1,802.05898 | PRoST: Distributed Execution of SPARQL Queries Using Mixed Partitioning
Strategies | The rapidly growing size of RDF graphs in recent years necessitates
distributed storage and parallel processing strategies. To obtain efficient
query processing using computer clusters a wide variety of different approaches
have been proposed. Related to the approach presented in the current paper are
systems built on top of Hadoop HDFS, for example using Apache Accumulo or using
Apache Spark. We present a new RDF store called PRoST (Partitioned RDF on Spark
Tables) based on Apache Spark. PRoST introduces an innovative strategy that
combines the Vertical Partitioning approach with the Property Table, two
preexisting models for storing RDF datasets. We demonstrate that our proposal
outperforms state-of-the-art systems w.r.t. the runtime for a wide range of
query types and without any extensive precomputing phase.
| cs.DB | the rapidly growing size of rdf graphs in recent years necessitates distributed storage and parallel processing strategies to obtain efficient query processing using computer clusters a wide variety of different approaches have been proposed related to the approach presented in the current paper are systems built on top of hadoop hdfs for example using apache accumulo or using apache spark we present a new rdf store called prost partitioned rdf on spark tables based on apache spark prost introduces an innovative strategy that combines the vertical partitioning approach with the property table two preexisting models for storing rdf datasets we demonstrate that our proposal outperforms stateoftheart systems wrt the runtime for a wide range of query types and without any extensive precomputing phase | [['the', 'rapidly', 'growing', 'size', 'of', 'rdf', 'graphs', 'in', 'recent', 'years', 'necessitates', 'distributed', 'storage', 'and', 'parallel', 'processing', 'strategies', 'to', 'obtain', 'efficient', 'query', 'processing', 'using', 'computer', 'clusters', 'a', 'wide', 'variety', 'of', 'different', 'approaches', 'have', 'been', 'proposed', 'related', 'to', 'the', 'approach', 'presented', 'in', 'the', 'current', 'paper', 'are', 'systems', 'built', 'on', 'top', 'of', 'hadoop', 'hdfs', 'for', 'example', 'using', 'apache', 'accumulo', 'or', 'using', 'apache', 'spark', 'we', 'present', 'a', 'new', 'rdf', 'store', 'called', 'prost', 'partitioned', 'rdf', 'on', 'spark', 'tables', 'based', 'on', 'apache', 'spark', 'prost', 'introduces', 'an', 'innovative', 'strategy', 'that', 'combines', 'the', 'vertical', 'partitioning', 'approach', 'with', 'the', 'property', 'table', 'two', 'preexisting', 'models', 'for', 'storing', 'rdf', 'datasets', 'we', 'demonstrate', 'that', 'our', 'proposal', 'outperforms', 'stateoftheart', 'systems', 'wrt', 'the', 'runtime', 'for', 'a', 'wide', 'range', 'of', 'query', 'types', 'and', 'without', 'any', 'extensive', 'precomputing', 'phase']] | [-0.10314938482227491, 0.003592000802059855, -0.0985202812002896, 0.004062058903822084, -0.0799380691316948, -0.14049566411072525, 0.06397469266700156, 0.44717335040142525, -0.26921380050783233, -0.35736200632906057, 0.08587474820991539, -0.2878359883448215, -0.06704052770321023, 0.27881623845267284, -0.07617393320206765, 0.12179805499660533, 0.14204987855552414, -0.0016507145530370072, -0.0607093429851641, -0.30158752318267235, 0.2630581319137151, 0.04418361896073552, 0.36293433737615505, 0.02705488025733247, 0.09299926817553436, 0.022279622525400746, -0.08209901348577918, 0.026389165136894984, -0.08468750752264925, 0.16547882575702633, 0.2693135861975647, 0.28756260973537656, 0.2627496439887862, -0.4448511513268075, -0.1808779193012695, 0.04980364116287329, 0.1552491054938334, 0.05204799759300611, -0.1445777191680182, -0.28959565219938815, 0.1595695545836314, -0.22136671869159957, 0.012370537466755727, -0.144358299787126, 0.037745527620238015, 0.04225761506032592, -0.2512880612687185, -0.03501877161802921, 0.022001926058418747, 0.09232957570669734, -0.027482484055378256, -0.15246257681505587, 0.06476277824513978, 0.08785161335301411, -0.08979974470926615, 0.05151949318057698, 0.1817761714327929, -0.049633800451515046, -0.20282547336120946, 0.37950143375532414, -0.04225468424307864, -0.10686843312247013, 0.20665476876841024, 0.03938437023434818, -0.1954191323990623, 0.045789964459230746, 0.22607602357269999, 0.11101279010981079, -0.1994310327828294, 0.142163913078962, -0.030462441814503048, 0.20025496256757316, 0.08230967230610246, 0.018163124901977013, 0.191732885157008, 0.28427693406801396, 0.04131499451312532, 0.19973138323038575, -0.06818876725364083, -0.13664915687896736, -0.1799908806020924, -0.14269199775819613, -0.17055794973744126, -0.06361881733258687, -0.16649825373788485, -0.239354912592931, 0.3567106451808922, 0.24458077918866847, 0.14164592315465574, 0.06604513066737511, 0.38409309813041026, -0.016463176660595567, 0.17199454726878463, 0.18946379060455695, 0.05924253723758265, -0.03454699983623454, 0.20647465600442838, -0.13648702575999305, 0.046409514360697714, 0.009162070294009233] |
1,802.05899 | Envelope Dyadic Green's Function for Uniaxial Metamaterials | Based on the dyadic Green's function (DGF) method, we present a formalism to
study the propagation of electromagnetic fields with slowly varying amplitude
(EMFSVA) in dispersive anisotropic media with two dyadic constitutive
parameters, the dielectric permittivity and the magnetic permeability. We find
the matrix elements of the envelope DGFs by applying the formalism for uniaxial
anisotropic metamaterials. We present the relations for the velocity of the
EMFSVA envelopes which agree with the known definition of the group velocity in
dispersive media. We consider examples of propagation of the EMFSVA passing
through active and passive media with the Lorentz and the Drude type
dispersions, demonstrating beam focusing in hyperbolic media and superluminal
propagation in media with inverted population. The results of this paper are
applicable to the propagation of modulated electromagnetic fields and slowly
varying amplitude fluctuations of such fields through dispersive and
dissipative (or active) anisotropic metamaterials. The developed approach can
be also used for the analysis of metamaterial-based waveguides, filters, and
delay lines.
| physics.app-ph physics.optics | based on the dyadic greens function dgf method we present a formalism to study the propagation of electromagnetic fields with slowly varying amplitude emfsva in dispersive anisotropic media with two dyadic constitutive parameters the dielectric permittivity and the magnetic permeability we find the matrix elements of the envelope dgfs by applying the formalism for uniaxial anisotropic metamaterials we present the relations for the velocity of the emfsva envelopes which agree with the known definition of the group velocity in dispersive media we consider examples of propagation of the emfsva passing through active and passive media with the lorentz and the drude type dispersions demonstrating beam focusing in hyperbolic media and superluminal propagation in media with inverted population the results of this paper are applicable to the propagation of modulated electromagnetic fields and slowly varying amplitude fluctuations of such fields through dispersive and dissipative or active anisotropic metamaterials the developed approach can be also used for the analysis of metamaterialbased waveguides filters and delay lines | [['based', 'on', 'the', 'dyadic', 'greens', 'function', 'dgf', 'method', 'we', 'present', 'a', 'formalism', 'to', 'study', 'the', 'propagation', 'of', 'electromagnetic', 'fields', 'with', 'slowly', 'varying', 'amplitude', 'emfsva', 'in', 'dispersive', 'anisotropic', 'media', 'with', 'two', 'dyadic', 'constitutive', 'parameters', 'the', 'dielectric', 'permittivity', 'and', 'the', 'magnetic', 'permeability', 'we', 'find', 'the', 'matrix', 'elements', 'of', 'the', 'envelope', 'dgfs', 'by', 'applying', 'the', 'formalism', 'for', 'uniaxial', 'anisotropic', 'metamaterials', 'we', 'present', 'the', 'relations', 'for', 'the', 'velocity', 'of', 'the', 'emfsva', 'envelopes', 'which', 'agree', 'with', 'the', 'known', 'definition', 'of', 'the', 'group', 'velocity', 'in', 'dispersive', 'media', 'we', 'consider', 'examples', 'of', 'propagation', 'of', 'the', 'emfsva', 'passing', 'through', 'active', 'and', 'passive', 'media', 'with', 'the', 'lorentz', 'and', 'the', 'drude', 'type', 'dispersions', 'demonstrating', 'beam', 'focusing', 'in', 'hyperbolic', 'media', 'and', 'superluminal', 'propagation', 'in', 'media', 'with', 'inverted', 'population', 'the', 'results', 'of', 'this', 'paper', 'are', 'applicable', 'to', 'the', 'propagation', 'of', 'modulated', 'electromagnetic', 'fields', 'and', 'slowly', 'varying', 'amplitude', 'fluctuations', 'of', 'such', 'fields', 'through', 'dispersive', 'and', 'dissipative', 'or', 'active', 'anisotropic', 'metamaterials', 'the', 'developed', 'approach', 'can', 'be', 'also', 'used', 'for', 'the', 'analysis', 'of', 'metamaterialbased', 'waveguides', 'filters', 'and', 'delay', 'lines']] | [-0.150124742878041, 0.18968160830700964, -0.037912357038606896, 0.005674540535889658, -0.11860987536632027, -0.09644548498676872, -0.0023217478231294794, 0.4555541392347198, -0.2405694537264712, -0.25680875357674676, 0.05257442555007485, -0.2687797633005432, -0.19089037428632882, 0.21093111873627213, 0.0558185931537986, 0.06122539292998109, -0.02356719789580882, -0.02950046430884695, -0.05109378916248565, -0.14514115299855251, 0.35120562850954756, -0.003543027845194186, 0.2931607649175942, 0.012949597079055441, 0.08755395821712773, 0.0627813040638811, -0.06252071761920408, 0.05415149855118908, -0.1181361463793662, 0.10844942169446796, 0.19193173314164752, 0.00946505941119205, 0.21128400960120092, -0.4398559690253135, -0.2841316928252852, 0.01957494177372749, 0.1481778442008318, 0.12003096596100739, -0.06815102454660563, -0.3171953728102559, -0.010971164397975327, -0.13349135421742142, -0.202423254853583, -0.033232835554260695, -0.010177380051478127, 0.09618804960203088, -0.2527126840321473, 0.1196144906176537, 0.04499361796398858, 0.03831081615440959, -0.0794955314082762, -0.06380392429618839, 0.01741608515084704, 0.06432210222212312, 0.06693867717632464, -0.052062042690299314, 0.13772611885382993, -0.13474059216049641, -0.035323246817841575, 0.39818073963415035, -0.11289824852491358, -0.19809042007028144, 0.15247455071315077, -0.14763154705309314, 0.0014400411321513035, 0.1435116326002164, 0.23863593941451583, 0.09882964622629292, -0.13989932467715324, 0.03704897254923976, -0.02253611372109571, 0.1599414044894004, 0.08753694894729308, 0.04261794616182569, 0.15439487645899638, 0.12692272206311303, -0.016572905772942705, 0.13230693433969423, -0.06687007137242865, -0.007549827175637696, -0.28495023254465107, -0.15906186867474065, -0.14979801575818952, 0.023708423113227576, -0.13947730838023684, -0.22085307550508004, 0.39967835394014245, 0.14390490543771467, 0.12277097073869288, 0.02856570861996523, 0.28239771667753627, 0.1280229169710402, 0.06357598309890806, 0.10236814236011288, 0.30368860410469256, 0.2210728152872183, 0.1611864144651025, -0.22693717085607806, -0.0005225368598304643, 0.03485121270584548] |
1,802.059 | The existence of designs II | We generalise the existence of combinatorial designs to the setting of subset
sums in lattices with coordinates indexed by labelled faces of simplicial
complexes. This general framework includes the problem of decomposing
hypergraphs with extra edge data, such as colours and orders, and so
incorporates a wide range of variations on the basic design problem, notably
Baranyai-type generalisations, such as resolvable hypergraph designs, large
sets of hypergraph designs and decompositions of designs by designs. Our method
also gives approximate counting results, which is new for many structures whose
existence was previously known, such as high dimensional permutations or Sudoku
squares.
| math.CO | we generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes this general framework includes the problem of decomposing hypergraphs with extra edge data such as colours and orders and so incorporates a wide range of variations on the basic design problem notably baranyaitype generalisations such as resolvable hypergraph designs large sets of hypergraph designs and decompositions of designs by designs our method also gives approximate counting results which is new for many structures whose existence was previously known such as high dimensional permutations or sudoku squares | [['we', 'generalise', 'the', 'existence', 'of', 'combinatorial', 'designs', 'to', 'the', 'setting', 'of', 'subset', 'sums', 'in', 'lattices', 'with', 'coordinates', 'indexed', 'by', 'labelled', 'faces', 'of', 'simplicial', 'complexes', 'this', 'general', 'framework', 'includes', 'the', 'problem', 'of', 'decomposing', 'hypergraphs', 'with', 'extra', 'edge', 'data', 'such', 'as', 'colours', 'and', 'orders', 'and', 'so', 'incorporates', 'a', 'wide', 'range', 'of', 'variations', 'on', 'the', 'basic', 'design', 'problem', 'notably', 'baranyaitype', 'generalisations', 'such', 'as', 'resolvable', 'hypergraph', 'designs', 'large', 'sets', 'of', 'hypergraph', 'designs', 'and', 'decompositions', 'of', 'designs', 'by', 'designs', 'our', 'method', 'also', 'gives', 'approximate', 'counting', 'results', 'which', 'is', 'new', 'for', 'many', 'structures', 'whose', 'existence', 'was', 'previously', 'known', 'such', 'as', 'high', 'dimensional', 'permutations', 'or', 'sudoku', 'squares']] | [-0.09037573033511037, 0.07624691524636941, 0.00109057186754665, 0.05676291898043469, -0.10486039624671743, -0.12934665926120648, 0.011471070129320853, 0.36911252698851654, -0.2750030463806005, -0.358097368865415, 0.14224275698617214, -0.256627127161306, -0.1819344949673372, 0.17345124041671028, -0.15385220955935014, 0.06974031482564493, 0.052712473954836074, -0.03486946701175637, -0.030564464782667465, -0.27663059296519166, 0.33352620376631464, -0.012787926086045877, 0.23707981711498113, 0.010585579872978005, 0.10323685575206058, 0.05360449399008895, -0.02306195172114354, 0.11007991362588876, -0.15132876836008044, 0.15282688319513743, 0.2857521948112984, 0.17825706367559654, 0.22178961570384076, -0.3546483829673944, -0.17682206730424155, 0.14307003145722316, 0.1378480876052771, 0.10568037120633608, -0.007734012471352036, -0.2334139259494465, 0.07602303449036271, -0.13205068483196122, -0.12337889598513191, -0.1032041106570037, 0.018518290985751935, 0.06195066200399941, -0.30899390746660604, -0.03194451068952501, 0.08854986011812632, 0.06653949537907135, -0.010312117556241727, -0.22590576315820782, 0.029943555826321244, 0.06798772809961152, -0.03364867868720356, -0.03869319252429925, 0.03637970304304753, -0.08594740660853196, -0.23373170359285944, 0.3907783833059548, 0.03950738676734306, -0.21905473665089695, 0.17767091703394222, -0.0942439668849487, -0.18014326919284132, 0.14119176038851342, 0.13795680262976223, 0.1501599286748755, -0.077370228800885, 0.09646962362287491, -0.14599624708896936, 0.09445370807114875, 0.144874256384098, 0.10304823606051598, 0.168349698745655, 0.17839832228345026, 0.14061537043913502, 0.19780413802675526, -0.01152778090203576, -0.05718080163227789, -0.28058838445900214, -0.08628928660052931, -0.1779188151833498, 0.04770642548395001, -0.1463215355333611, -0.24949972991093128, 0.39585824591117075, 0.09436500984222883, 0.181725423593742, 0.08636568738453354, 0.2766563904782136, 0.03529514365058129, 0.1075860579084191, 0.05418782265188944, 0.08696826393574927, 0.1824467927358593, -0.020386595363644035, -0.10098803033487815, 0.023586156641631717, 0.12656633116097915] |
1,802.05901 | An affineness criterion for algebraic groups and applications | We prove that a smooth and connected algebraic group $G$ is affine if and
only if any invertible sheaf on any normal $G$-variety is $G$-invariant. For
the proof, a key ingredient is the following result: if $G$ is a connected and
smooth algebraic group and $\mathcal L$ is a $G$-invariant invertible sheaf on
a $G$-variety $X$, then the action of $G$ on $X$ extends to a projective action
on the complete linear ${\mathbb P}(H^0(X,{\mathcal L})$. As an application of
the affineness criterion, we give a new and simple proof of Chevalley-Barsotti
Theorem on the structure of algebraic groups.
| math.AG | we prove that a smooth and connected algebraic group g is affine if and only if any invertible sheaf on any normal gvariety is ginvariant for the proof a key ingredient is the following result if g is a connected and smooth algebraic group and mathcal l is a ginvariant invertible sheaf on a gvariety x then the action of g on x extends to a projective action on the complete linear mathbb ph0xmathcal l as an application of the affineness criterion we give a new and simple proof of chevalleybarsotti theorem on the structure of algebraic groups | [['we', 'prove', 'that', 'a', 'smooth', 'and', 'connected', 'algebraic', 'group', 'g', 'is', 'affine', 'if', 'and', 'only', 'if', 'any', 'invertible', 'sheaf', 'on', 'any', 'normal', 'gvariety', 'is', 'ginvariant', 'for', 'the', 'proof', 'a', 'key', 'ingredient', 'is', 'the', 'following', 'result', 'if', 'g', 'is', 'a', 'connected', 'and', 'smooth', 'algebraic', 'group', 'and', 'mathcal', 'l', 'is', 'a', 'ginvariant', 'invertible', 'sheaf', 'on', 'a', 'gvariety', 'x', 'then', 'the', 'action', 'of', 'g', 'on', 'x', 'extends', 'to', 'a', 'projective', 'action', 'on', 'the', 'complete', 'linear', 'mathbb', 'ph0xmathcal', 'l', 'as', 'an', 'application', 'of', 'the', 'affineness', 'criterion', 'we', 'give', 'a', 'new', 'and', 'simple', 'proof', 'of', 'chevalleybarsotti', 'theorem', 'on', 'the', 'structure', 'of', 'algebraic', 'groups']] | [-0.22274674709963924, 0.021856639200905192, -0.13541922151731947, 0.012836312236080024, -0.1651548920684339, -0.1639793985086726, 0.02408084812729309, 0.3396360899787396, -0.3227999636437744, -0.13668229846128574, 0.10867071242440336, -0.2213452925304106, -0.152867665534662, 0.23019494127947837, -0.16918022947114272, -0.07315555051415383, 0.03927910690496598, 0.17198193333266923, -0.10583874115400249, -0.2698502646308043, 0.43681527441367507, -0.11771835707865345, 0.2139502634430149, 0.08419178284627075, 0.19901217098708912, 0.027779665479708154, -0.0083553435348828, -0.004882887345350658, -0.13880411478544374, 0.10341870453945982, 0.2755550575190379, 0.08350004790554522, 0.22453745767173436, -0.34651274014807615, -0.12815901839834018, 0.22170524222019594, 0.09918733519831828, -0.03497858085514357, -0.005198760893108556, -0.2596107817759427, 0.15738608901544163, -0.13449509835724408, -0.14947921517887153, -0.057821958917581164, 0.13971578640242419, -0.011531898198882118, -0.29845806378883327, -0.049272326097707264, 0.161712714577637, 0.11357382246448348, -0.010200287705326142, -0.0411281848513075, -0.10334946859317522, 0.02957382758904714, -0.10015572364257726, 0.16002601900254376, 0.10395792951355058, -0.02879201954541107, -0.06300016945169773, 0.3754279687903666, -0.08947745631060873, -0.22979300752437362, 0.11247993788371484, -0.11598329925133537, -0.18195857050159248, 0.09888676902240452, 0.08929913905982782, 0.19351453508716077, 0.006701160687346904, 0.24364857654715402, -0.18816298389962563, 0.10830814467044547, 0.009393451551053053, -0.03135960089518145, 0.09485991630693509, 0.13394740823908555, 0.15531621969421394, 0.06276429810289604, 0.05745569087594049, 0.07009199929598253, -0.4300971686995278, -0.20826521098206285, -0.15481567254755646, 0.2301934367036059, -0.10791059782225905, -0.17724657355817422, 0.394575328216888, 0.008668923622584165, 0.19064593071622463, 0.1303651770382809, 0.24517047548821816, 0.05629568275253405, 0.01367066498399557, 0.09668092853098642, 0.07306018146239997, 0.266356583936916, -0.12568995317269582, -0.12934289926973483, 0.0116790272295475, 0.24705414364386039] |
1,802.05902 | A complete hand-drawn sketch vectorization framework | Vectorizing hand-drawn sketches is a challenging task, which is of paramount
importance for creating CAD vectorized versions for the fashion and creative
workflows. This paper proposes a complete framework that automatically
transforms noisy and complex hand-drawn sketches with different stroke types in
a precise, reliable and highly-simplified vectorized model. The proposed
framework includes a novel line extraction algorithm based on a
multi-resolution application of Pearson's cross correlation and a new unbiased
thinning algorithm that can get rid of scribbles and variable-width strokes to
obtain clean 1-pixel lines. Other contributions include variants of pruning,
merging and edge linking procedures to post-process the obtained paths.
Finally, a modification of the original Schneider's vectorization algorithm is
designed to obtain fewer control points in the resulting Bezier splines. All
the proposed steps of the framework have been extensively tested and compared
with state-of-the-art algorithms, showing (both qualitatively and
quantitatively) its outperformance.
| cs.CV | vectorizing handdrawn sketches is a challenging task which is of paramount importance for creating cad vectorized versions for the fashion and creative workflows this paper proposes a complete framework that automatically transforms noisy and complex handdrawn sketches with different stroke types in a precise reliable and highlysimplified vectorized model the proposed framework includes a novel line extraction algorithm based on a multiresolution application of pearsons cross correlation and a new unbiased thinning algorithm that can get rid of scribbles and variablewidth strokes to obtain clean 1pixel lines other contributions include variants of pruning merging and edge linking procedures to postprocess the obtained paths finally a modification of the original schneiders vectorization algorithm is designed to obtain fewer control points in the resulting bezier splines all the proposed steps of the framework have been extensively tested and compared with stateoftheart algorithms showing both qualitatively and quantitatively its outperformance | [['vectorizing', 'handdrawn', 'sketches', 'is', 'a', 'challenging', 'task', 'which', 'is', 'of', 'paramount', 'importance', 'for', 'creating', 'cad', 'vectorized', 'versions', 'for', 'the', 'fashion', 'and', 'creative', 'workflows', 'this', 'paper', 'proposes', 'a', 'complete', 'framework', 'that', 'automatically', 'transforms', 'noisy', 'and', 'complex', 'handdrawn', 'sketches', 'with', 'different', 'stroke', 'types', 'in', 'a', 'precise', 'reliable', 'and', 'highlysimplified', 'vectorized', 'model', 'the', 'proposed', 'framework', 'includes', 'a', 'novel', 'line', 'extraction', 'algorithm', 'based', 'on', 'a', 'multiresolution', 'application', 'of', 'pearsons', 'cross', 'correlation', 'and', 'a', 'new', 'unbiased', 'thinning', 'algorithm', 'that', 'can', 'get', 'rid', 'of', 'scribbles', 'and', 'variablewidth', 'strokes', 'to', 'obtain', 'clean', '1pixel', 'lines', 'other', 'contributions', 'include', 'variants', 'of', 'pruning', 'merging', 'and', 'edge', 'linking', 'procedures', 'to', 'postprocess', 'the', 'obtained', 'paths', 'finally', 'a', 'modification', 'of', 'the', 'original', 'schneiders', 'vectorization', 'algorithm', 'is', 'designed', 'to', 'obtain', 'fewer', 'control', 'points', 'in', 'the', 'resulting', 'bezier', 'splines', 'all', 'the', 'proposed', 'steps', 'of', 'the', 'framework', 'have', 'been', 'extensively', 'tested', 'and', 'compared', 'with', 'stateoftheart', 'algorithms', 'showing', 'both', 'qualitatively', 'and', 'quantitatively', 'its', 'outperformance']] | [-0.02342551805506371, -0.02789842012363856, -0.11078003439605746, 0.06803315537758427, -0.10812747015714269, -0.18390976881316531, 0.031033270313780857, 0.4161814111093544, -0.2378870249225133, -0.314899150001472, 0.08590818043919407, -0.23781691907828495, -0.18851087564420696, 0.2186573806437281, -0.11236784337981515, 0.11161939154836757, 0.12566276461468875, -0.02727746594520222, -0.07094444432582911, -0.27803179228276476, 0.25197539589299434, 0.04375161886795692, 0.32690862296563766, 0.01337877348422596, 0.11619250716446988, 0.008034292667504554, -0.1043861181722804, 0.03385805987995373, -0.08224236424615661, 0.16926300006102107, 0.2626884578843202, 0.1793036542351243, 0.27075976835665844, -0.405267567552422, -0.1566631555747024, 0.06878012786571523, 0.15718873972766906, 0.11360761398459109, -0.04475633385320105, -0.2950948173266338, 0.10178370692261673, -0.13972125953854356, -0.028729228831489557, -0.15975185905978695, -0.014401763841455598, -0.0030527519738327152, -0.32916149568954506, 0.0268404649104923, 0.066624085335954, 0.04987901248426929, -0.013908607968964856, -0.13631353078071948, 0.02370732344929384, 0.13207317243748, -0.02237218620944513, 0.045029508077526745, 0.12750701455412153, -0.10755301331176283, -0.16778881802368742, 0.36941707201863394, -0.0015670145544453128, -0.2107573440553595, 0.18521072018464185, -0.012687125417072172, -0.13691464098001357, 0.1355379094586593, 0.19187363616050515, 0.12771013121249009, -0.15500641251008795, 0.0274167374455791, -0.020350539849509727, 0.15472326219745286, 0.06618023879047841, -0.0359494655842778, 0.14476087694024437, 0.1792261135052373, 0.037477042094233436, 0.1653390659540828, -0.09799462653001234, -0.06611895108394554, -0.22929607028993204, -0.1429476721040037, -0.14615241172229107, -0.06882235355362654, -0.11158158261351261, -0.21020793378327604, 0.4313921582668203, 0.19090054088674027, 0.2096528529982108, 0.09455590517250566, 0.392036505094538, 0.04124313979473424, 0.08321333448011875, 0.08674446773700965, 0.14048531330796596, 0.07312881877990313, 0.0941260895156182, -0.15985471887628816, 0.0876424967025567, 0.1190313553813947] |
1,802.05903 | Parallel Tempering for the planted clique problem | The theoretical information threshold for the planted clique problem is
$2\log_2(N)$, however no polynomial algorithm is known to recover a planted
clique of size $O(N^{1/2-\epsilon})$, $\epsilon>0$. In this paper we will apply
a standard method for the analysis of disordered models, the Parallel-Tempering
(PT) algorithm, to the clique problem, showing numerically that its
time-scaling in the hard region is indeed polynomial for the analyzed sizes. We
also apply PT to a different but connected model, the Sparse Planted
Independent Set problem. In this situation thresholds should be sharper and
finite size corrections should be less important. Also in this case PT shows a
polynomial scaling in the hard region for the recovery.
| cond-mat.dis-nn cs.DS | the theoretical information threshold for the planted clique problem is 2log_2n however no polynomial algorithm is known to recover a planted clique of size on12epsilon epsilon0 in this paper we will apply a standard method for the analysis of disordered models the paralleltempering pt algorithm to the clique problem showing numerically that its timescaling in the hard region is indeed polynomial for the analyzed sizes we also apply pt to a different but connected model the sparse planted independent set problem in this situation thresholds should be sharper and finite size corrections should be less important also in this case pt shows a polynomial scaling in the hard region for the recovery | [['the', 'theoretical', 'information', 'threshold', 'for', 'the', 'planted', 'clique', 'problem', 'is', '2log_2n', 'however', 'no', 'polynomial', 'algorithm', 'is', 'known', 'to', 'recover', 'a', 'planted', 'clique', 'of', 'size', 'on12epsilon', 'epsilon0', 'in', 'this', 'paper', 'we', 'will', 'apply', 'a', 'standard', 'method', 'for', 'the', 'analysis', 'of', 'disordered', 'models', 'the', 'paralleltempering', 'pt', 'algorithm', 'to', 'the', 'clique', 'problem', 'showing', 'numerically', 'that', 'its', 'timescaling', 'in', 'the', 'hard', 'region', 'is', 'indeed', 'polynomial', 'for', 'the', 'analyzed', 'sizes', 'we', 'also', 'apply', 'pt', 'to', 'a', 'different', 'but', 'connected', 'model', 'the', 'sparse', 'planted', 'independent', 'set', 'problem', 'in', 'this', 'situation', 'thresholds', 'should', 'be', 'sharper', 'and', 'finite', 'size', 'corrections', 'should', 'be', 'less', 'important', 'also', 'in', 'this', 'case', 'pt', 'shows', 'a', 'polynomial', 'scaling', 'in', 'the', 'hard', 'region', 'for', 'the', 'recovery']] | [-0.08475365085099396, 0.058956619360492575, -0.08987150158363956, 0.10841875443620994, -0.06865988385251111, -0.16970446727213426, 0.05525387580368064, 0.38083823793777477, -0.29712822002165756, -0.2723078007793037, 0.11220616423042475, -0.24554493286655293, -0.15614162150325742, 0.15679429505683212, -0.07415335357392643, 0.0981938555529383, 0.05121073785221188, 0.06608006346400257, -0.04196040720578183, -0.2764864531219811, 0.24616592433219692, 0.028621285910474824, 0.22551367491869642, 0.08585242112796451, 0.020617000246840017, -0.0063006532722496775, 0.019898760652689782, 0.08295703373706757, -0.13654993658683207, 0.043323204144709616, 0.28214446706572144, 0.1221327939314473, 0.2530363964101484, -0.3692012954301931, -0.18098392155753482, 0.20393976921672924, 0.18808402585889306, 0.14132189075672277, -0.019765063159604062, -0.19466963147971075, 0.162024918326957, -0.13006204413040331, -0.1352025906823844, -0.021752235040211263, 0.03475584678754613, -0.03419164395870154, -0.34345608678654777, 0.07074903274271721, 0.08979438833875565, -0.029522605726982024, 0.0017177809862554208, -0.12794948806398893, 0.056041935150436054, 0.06719939727420071, -0.005730839096941054, 0.02848006433677264, 0.09996844479931635, -0.1259308361830106, -0.10815927895574688, 0.36818965025632094, 0.01507815191530631, -0.2074618707033428, 0.1390071806355237, -0.12897625090218745, -0.2137524320886613, 0.16433395634967465, 0.17819319456933183, 0.1467523551965552, -0.10977516238166539, 0.12337241140099846, -0.12143224364498982, 0.20800781154350653, 0.056086423278257656, -0.031099159770796227, 0.09855891465469524, 0.18370064779243492, 0.12077217243705154, 0.2214641395163395, -0.049202105156271846, -0.09723653584752265, -0.2665914558881038, -0.0842681265528406, -0.2389693446058847, -0.018420095960315956, -0.1790409517013793, -0.17704296179182893, 0.38641465984721174, 0.1658873018045146, 0.2005113302646121, 0.11982997619496608, 0.30122476190261477, 0.10159365033118897, 0.02001761537263388, 0.1185328752045763, 0.20736425493315264, 0.13065341034870562, 0.09373905102361564, -0.20109912393161575, 0.09457399577808541, 0.07351144484185555] |
1,802.05904 | Error and Stability Estimates of a Least-Squares Variational
Kernel-Based Method for Second Order Elliptic PDEs | We consider a least-squares variational kernel-based method for numerical
solution of second order elliptic partial differential equations on a
multi-dimensional domain. In this setting it is not assumed that the
differential operator is self-adjoint or positive definite as it should be in
the Rayleigh-Ritz setting. However, the new scheme leads to a symmetric and
positive definite algebraic system of equations. Moreover, the resulting method
does not rely on certain subspaces satisfying the boundary conditions. The
trial space for discretization is provided via standard kernels that reproduce
the Sobolev spaces as their native spaces. The error analysis of the method is
given, but it is partly subjected to an inverse inequality on the boundary
which is still an open problem. The condition number of the final linear system
is approximated in terms of the smoothness of the kernel and the discretization
quality. Finally, the results of some computational experiments support the
theoretical error bounds.
| math.NA cs.NA | we consider a leastsquares variational kernelbased method for numerical solution of second order elliptic partial differential equations on a multidimensional domain in this setting it is not assumed that the differential operator is selfadjoint or positive definite as it should be in the rayleighritz setting however the new scheme leads to a symmetric and positive definite algebraic system of equations moreover the resulting method does not rely on certain subspaces satisfying the boundary conditions the trial space for discretization is provided via standard kernels that reproduce the sobolev spaces as their native spaces the error analysis of the method is given but it is partly subjected to an inverse inequality on the boundary which is still an open problem the condition number of the final linear system is approximated in terms of the smoothness of the kernel and the discretization quality finally the results of some computational experiments support the theoretical error bounds | [['we', 'consider', 'a', 'leastsquares', 'variational', 'kernelbased', 'method', 'for', 'numerical', 'solution', 'of', 'second', 'order', 'elliptic', 'partial', 'differential', 'equations', 'on', 'a', 'multidimensional', 'domain', 'in', 'this', 'setting', 'it', 'is', 'not', 'assumed', 'that', 'the', 'differential', 'operator', 'is', 'selfadjoint', 'or', 'positive', 'definite', 'as', 'it', 'should', 'be', 'in', 'the', 'rayleighritz', 'setting', 'however', 'the', 'new', 'scheme', 'leads', 'to', 'a', 'symmetric', 'and', 'positive', 'definite', 'algebraic', 'system', 'of', 'equations', 'moreover', 'the', 'resulting', 'method', 'does', 'not', 'rely', 'on', 'certain', 'subspaces', 'satisfying', 'the', 'boundary', 'conditions', 'the', 'trial', 'space', 'for', 'discretization', 'is', 'provided', 'via', 'standard', 'kernels', 'that', 'reproduce', 'the', 'sobolev', 'spaces', 'as', 'their', 'native', 'spaces', 'the', 'error', 'analysis', 'of', 'the', 'method', 'is', 'given', 'but', 'it', 'is', 'partly', 'subjected', 'to', 'an', 'inverse', 'inequality', 'on', 'the', 'boundary', 'which', 'is', 'still', 'an', 'open', 'problem', 'the', 'condition', 'number', 'of', 'the', 'final', 'linear', 'system', 'is', 'approximated', 'in', 'terms', 'of', 'the', 'smoothness', 'of', 'the', 'kernel', 'and', 'the', 'discretization', 'quality', 'finally', 'the', 'results', 'of', 'some', 'computational', 'experiments', 'support', 'the', 'theoretical', 'error', 'bounds']] | [-0.1031082438155126, 0.031123727029136204, -0.08949127372695145, 0.09089418639294998, -0.11018646144295975, -0.12797554826144786, 0.008415059231410376, 0.34748786353670497, -0.30244963022034155, -0.24516095475482394, 0.1771180424512078, -0.2512462725741119, -0.13657601507445472, 0.22118282756841212, -0.09896267471025436, 0.12772470505701172, 0.10117605352756001, 0.05880031952317926, -0.11919820951632669, -0.2798783836317145, 0.3971574306990221, 0.011199093880314454, 0.2440194626174429, 0.06706686837148237, 0.12668562639699457, -0.04257084422568285, -0.016842005932642744, 0.007146235804790266, -0.10048547516977552, 0.12181019726372172, 0.2283461719593094, 0.11485720795025331, 0.3249214189248829, -0.3907068083488863, -0.19331320695384266, 0.12891838363420485, 0.1225533264086527, 0.08026449549319284, -0.019298309938117764, -0.29627367642288116, 0.08722599681156377, -0.10956751426767095, -0.12455821013248532, -0.1086689864142244, -0.04200557157324225, 0.008136275543198233, -0.34024878874348075, 0.08807098959706529, 0.09760970089681982, 0.03198833032085079, -0.11586580575699461, -0.10670340708776505, -0.0004038746701553464, 0.06310076840994941, 0.02791469817862426, 0.03993678546595856, 0.0504545990493319, -0.06916678162577738, -0.08301882448551409, 0.37038843291111634, -0.04516918700016438, -0.34402039798061834, 0.14157234453078774, -0.12694462575018406, -0.08247642447788488, 0.12398430570850477, 0.17194964594262488, 0.15192399167279208, -0.12141231721376672, 0.13924644977155634, -0.07772699346784137, 0.1619739980099029, 0.03204914885329606, -0.003899697349802439, 0.07168092138553951, 0.12689902622624014, 0.1567018437564519, 0.09995276962476934, -0.01144359383299898, -0.12311148943814747, -0.3746680200489518, -0.1707590263416029, -0.20626562742479876, 0.018317115343414746, -0.10657696097745298, -0.23074901025374026, 0.3476949644517684, 0.10843086101912157, 0.17164350046739713, 0.07195542358985062, 0.28329453646856684, 0.201210108952402, 0.03560256619109876, 0.052305960425120944, 0.1802658604656185, 0.1550723061899904, 0.10438385059497034, -0.22890725386731503, 0.0881630370356873, 0.1366312408765011] |
1,802.05905 | Assigning times to minimise reachability in temporal graphs | Temporal graphs (in which edges are active at specified times) are of
particular relevance for spreading processes on graphs, e.g.~the spread of
disease or dissemination of information. Motivated by real-world applications,
modification of static graphs to control this spread has proven a rich topic
for previous research. Here, we introduce a new type of modification for
temporal graphs: the number of active times for each edge is fixed, but we can
change the relative order in which (sets of) edges are active. We investigate
the problem of determining an ordering of edges that minimises the maximum
number of vertices reachable from any single starting vertex;
epidemiologically, this corresponds to the worst-case number of vertices
infected in a single disease outbreak. We study two versions of this problem,
both of which we show to be $\NP$-hard, and identify cases in which the problem
can be solved or approximated efficiently.
| cs.CC cs.DM cs.DS | temporal graphs in which edges are active at specified times are of particular relevance for spreading processes on graphs egthe spread of disease or dissemination of information motivated by realworld applications modification of static graphs to control this spread has proven a rich topic for previous research here we introduce a new type of modification for temporal graphs the number of active times for each edge is fixed but we can change the relative order in which sets of edges are active we investigate the problem of determining an ordering of edges that minimises the maximum number of vertices reachable from any single starting vertex epidemiologically this corresponds to the worstcase number of vertices infected in a single disease outbreak we study two versions of this problem both of which we show to be nphard and identify cases in which the problem can be solved or approximated efficiently | [['temporal', 'graphs', 'in', 'which', 'edges', 'are', 'active', 'at', 'specified', 'times', 'are', 'of', 'particular', 'relevance', 'for', 'spreading', 'processes', 'on', 'graphs', 'egthe', 'spread', 'of', 'disease', 'or', 'dissemination', 'of', 'information', 'motivated', 'by', 'realworld', 'applications', 'modification', 'of', 'static', 'graphs', 'to', 'control', 'this', 'spread', 'has', 'proven', 'a', 'rich', 'topic', 'for', 'previous', 'research', 'here', 'we', 'introduce', 'a', 'new', 'type', 'of', 'modification', 'for', 'temporal', 'graphs', 'the', 'number', 'of', 'active', 'times', 'for', 'each', 'edge', 'is', 'fixed', 'but', 'we', 'can', 'change', 'the', 'relative', 'order', 'in', 'which', 'sets', 'of', 'edges', 'are', 'active', 'we', 'investigate', 'the', 'problem', 'of', 'determining', 'an', 'ordering', 'of', 'edges', 'that', 'minimises', 'the', 'maximum', 'number', 'of', 'vertices', 'reachable', 'from', 'any', 'single', 'starting', 'vertex', 'epidemiologically', 'this', 'corresponds', 'to', 'the', 'worstcase', 'number', 'of', 'vertices', 'infected', 'in', 'a', 'single', 'disease', 'outbreak', 'we', 'study', 'two', 'versions', 'of', 'this', 'problem', 'both', 'of', 'which', 'we', 'show', 'to', 'be', 'nphard', 'and', 'identify', 'cases', 'in', 'which', 'the', 'problem', 'can', 'be', 'solved', 'or', 'approximated', 'efficiently']] | [-0.13676744572994476, 0.11662983284986694, -0.02442030015565153, 0.05309622565038955, -0.08093716397824874, -0.13037397900306796, 0.07268432858148338, 0.39423299157941666, -0.27932079859090514, -0.3282301416840857, 0.11123077508858153, -0.3056442480238557, -0.14960181361970468, 0.12761120034721554, -0.09745782219987312, 0.028584658237476204, 0.08194536532409001, 0.08749268705503561, 0.0017825415864511317, -0.2625174025699773, 0.3054269411179514, -0.011013867696935966, 0.21501929757525087, 0.06800934867429975, 0.0821058334549889, 0.04263329160764713, -0.019054631568881607, 0.09102314135392393, -0.1243362933292775, 0.12159797575598508, 0.28582553536555655, 0.16947403137030936, 0.294929833028692, -0.41956601089269324, -0.23666758024184084, 0.18151949128298075, 0.16595055786869173, 0.13064323201920283, -0.005659469243648739, -0.22960729748514053, 0.11409221442944899, -0.12855732062284053, -0.1039282635398637, 0.0012851375834764661, 0.046478887453574584, 0.01636147121049313, -0.2827028360255566, 0.03488595800700824, 0.028110993470978132, 0.046584862913634326, 0.015307424846419913, -0.10511280532542465, -0.012789936953324926, 0.1696418627051989, 0.007177867030927823, 0.013303485920029768, 0.10584703723686067, -0.15370678388343723, -0.17284715394615321, 0.35418370343442707, 0.012737986056694156, -0.1693083350373608, 0.14754551002831273, -0.10065830383462378, -0.1538355768205145, 0.12389803985983285, 0.23587626073433943, 0.1719810650007472, -0.16162805186546836, 0.042630308955464186, -0.06700802365368283, 0.13185209383821506, 0.10054031561594456, 0.02237499939793771, 0.16116594979099022, 0.20179187009469732, 0.1362975126193723, 0.16346085647819564, -0.05173098755767569, -0.08579738678825968, -0.2658815200163706, -0.10608231031801552, -0.18820718718327684, 0.03998432852755729, -0.13170541419851753, -0.1845147104751369, 0.4435317014419549, 0.15282236687159417, 0.21103767840808407, 0.04287203708097238, 0.22325726640033158, 0.08950199082028121, 0.03753209350523665, 0.1165544714269738, 0.17042637240091288, 0.06583886110967944, 0.033413321242315344, -0.19277093149375524, 0.12718918738332954, 0.05989951267032223] |
1,802.05906 | Refining the $r$-index | Gagie, Navarro and Prezza's $r$-index (SODA, 2018) promises to speed up DNA
alignment and variation calling by allowing us to index entire genomic
databases, provided certain obstacles can be overcome. In this paper we first
strengthen and simplify Policriti and Prezza's Toehold Lemma (DCC '16;
Algorithmica, 2017), which inspired the $r$-index and plays an important role
in its implementation. We then show how to update the $r$-index efficiently
after adding a new genome to the database, which is likely to be vital in
practice. As a by-product of this result, we obtain an online version of
Policriti and Prezza's algorithm for constructing the LZ77 parse from a
run-length compressed Burrows-Wheeler Transform. Our experiments demonstrate
the practicality of all three of these results. Finally, we show how to augment
the $r$-index such that, given a new genome and fast random access to the
database, we can quickly compute the matching statistics and maximal exact
matches of the new genome with respect to the database.
| cs.DS | gagie navarro and prezzas rindex soda 2018 promises to speed up dna alignment and variation calling by allowing us to index entire genomic databases provided certain obstacles can be overcome in this paper we first strengthen and simplify policriti and prezzas toehold lemma dcc 16 algorithmica 2017 which inspired the rindex and plays an important role in its implementation we then show how to update the rindex efficiently after adding a new genome to the database which is likely to be vital in practice as a byproduct of this result we obtain an online version of policriti and prezzas algorithm for constructing the lz77 parse from a runlength compressed burrowswheeler transform our experiments demonstrate the practicality of all three of these results finally we show how to augment the rindex such that given a new genome and fast random access to the database we can quickly compute the matching statistics and maximal exact matches of the new genome with respect to the database | [['gagie', 'navarro', 'and', 'prezzas', 'rindex', 'soda', '2018', 'promises', 'to', 'speed', 'up', 'dna', 'alignment', 'and', 'variation', 'calling', 'by', 'allowing', 'us', 'to', 'index', 'entire', 'genomic', 'databases', 'provided', 'certain', 'obstacles', 'can', 'be', 'overcome', 'in', 'this', 'paper', 'we', 'first', 'strengthen', 'and', 'simplify', 'policriti', 'and', 'prezzas', 'toehold', 'lemma', 'dcc', '16', 'algorithmica', '2017', 'which', 'inspired', 'the', 'rindex', 'and', 'plays', 'an', 'important', 'role', 'in', 'its', 'implementation', 'we', 'then', 'show', 'how', 'to', 'update', 'the', 'rindex', 'efficiently', 'after', 'adding', 'a', 'new', 'genome', 'to', 'the', 'database', 'which', 'is', 'likely', 'to', 'be', 'vital', 'in', 'practice', 'as', 'a', 'byproduct', 'of', 'this', 'result', 'we', 'obtain', 'an', 'online', 'version', 'of', 'policriti', 'and', 'prezzas', 'algorithm', 'for', 'constructing', 'the', 'lz77', 'parse', 'from', 'a', 'runlength', 'compressed', 'burrowswheeler', 'transform', 'our', 'experiments', 'demonstrate', 'the', 'practicality', 'of', 'all', 'three', 'of', 'these', 'results', 'finally', 'we', 'show', 'how', 'to', 'augment', 'the', 'rindex', 'such', 'that', 'given', 'a', 'new', 'genome', 'and', 'fast', 'random', 'access', 'to', 'the', 'database', 'we', 'can', 'quickly', 'compute', 'the', 'matching', 'statistics', 'and', 'maximal', 'exact', 'matches', 'of', 'the', 'new', 'genome', 'with', 'respect', 'to', 'the', 'database']] | [-0.04874751500610728, 0.056662465530280315, -0.0860522781527834, 0.05577420402769349, -0.1028107288730098, -0.09052271486580139, 0.09730641917922185, 0.3571690910495818, -0.305532259051688, -0.3479008848709782, 0.11225765650524408, -0.24646197795664193, -0.18943701924872586, 0.20034204904804936, -0.13940732273767936, 0.06437290895519254, 0.08113713761558757, 0.002892144976067357, 0.00036252217687433587, -0.3000282083405182, 0.23242274033400462, 0.09982283461686166, 0.24896599516214338, 0.0654282644711202, 0.06983961308724247, 0.024946731852105587, -0.07551425924466457, -0.009128211269126042, -0.12695371022732616, 0.17480303737102076, 0.25337129474501124, 0.23502219009096734, 0.25052605831297114, -0.404125825536903, -0.11596339528914541, 0.09601508605992422, 0.17853756524855272, 0.16169611582299695, -0.054377676447620614, -0.2870740908314474, 0.13903693926695268, -0.16948010001797228, -0.08399935573106632, -0.11881911609816598, 0.018508654041215777, 0.008428140284377151, -0.2967161227898032, 0.020350601679820102, 0.07699608707625885, -0.0097735477873357, -0.02113784273897181, -0.08553987698833225, 0.023174959188213506, 0.1616992632538313, 0.014523629138420802, 0.09300174661912024, 0.09507808285634382, -0.0787716076563811, -0.14388113061249896, 0.35299628977663816, -0.054185868797503645, -0.1412379246612545, 0.1603329362347722, -0.05422114022949245, -0.1750968340114923, 0.07864854320359882, 0.19187120776623487, 0.08908213744289242, -0.14549404192948714, 0.07430415911392174, -0.06261369852145435, 0.20699125185783487, 0.13589227874144855, -0.014046734407020266, 0.13187515905010513, 0.14698642886651214, 0.06759716985397972, 0.18497380362823607, -0.08398568392149172, -0.04941243833891349, -0.23857806974556298, -0.1839622079503897, -0.16180119038835983, -0.00046385973400902, -0.10703919246225269, -0.14974361790809781, 0.39134465850074773, 0.21641647655051202, 0.20452743624555297, 0.09785940142028267, 0.2644083092745859, 0.038897977134911346, 0.0761274730815785, 0.10873174874432152, 0.13353423937805928, 0.07947941311722388, 0.08621969629894011, -0.19692006446857704, 0.05114015890285373, 0.06624759855330922] |
1,802.05907 | A Search for Possible Long Range Spin Dependent Interactions of the
Neutron From Exotic Vector Boson Exchange | We present a search for possible spin dependent interactions of the neutron
with matter through exchange of spin 1 bosons with axial vector couplings as
envisioned in possible extensions of the Standard Model. This was sought using
a slow neutron polarimeter that passed transversely polarized slow neutrons by
unpolarized slabs of material arranged so that this interaction would tilt the
plane of polarization and develop a component along the neutron momentum. The
result for the rotation angle, $\phi'_{V_5} =
[2.8\pm\,4.6(stat.)\pm\,4.0(sys.)]\times 10^{-5}~\mbox{rad/m}$ is consistent
with zero. This result improves the upper bounds on the neutron-matter coupling
$g_{A}^{2}$ from such an interaction by about three orders of magnitude for
force ranges in the mm-$\mu$m regime.
| nucl-ex hep-ex physics.ins-det | we present a search for possible spin dependent interactions of the neutron with matter through exchange of spin 1 bosons with axial vector couplings as envisioned in possible extensions of the standard model this was sought using a slow neutron polarimeter that passed transversely polarized slow neutrons by unpolarized slabs of material arranged so that this interaction would tilt the plane of polarization and develop a component along the neutron momentum the result for the rotation angle phi_v_5 28pm46statpm40systimes 105mboxradm is consistent with zero this result improves the upper bounds on the neutronmatter coupling g_a2 from such an interaction by about three orders of magnitude for force ranges in the mmmum regime | [['we', 'present', 'a', 'search', 'for', 'possible', 'spin', 'dependent', 'interactions', 'of', 'the', 'neutron', 'with', 'matter', 'through', 'exchange', 'of', 'spin', '1', 'bosons', 'with', 'axial', 'vector', 'couplings', 'as', 'envisioned', 'in', 'possible', 'extensions', 'of', 'the', 'standard', 'model', 'this', 'was', 'sought', 'using', 'a', 'slow', 'neutron', 'polarimeter', 'that', 'passed', 'transversely', 'polarized', 'slow', 'neutrons', 'by', 'unpolarized', 'slabs', 'of', 'material', 'arranged', 'so', 'that', 'this', 'interaction', 'would', 'tilt', 'the', 'plane', 'of', 'polarization', 'and', 'develop', 'a', 'component', 'along', 'the', 'neutron', 'momentum', 'the', 'result', 'for', 'the', 'rotation', 'angle', 'phi_v_5', '28pm46statpm40systimes', '105mboxradm', 'is', 'consistent', 'with', 'zero', 'this', 'result', 'improves', 'the', 'upper', 'bounds', 'on', 'the', 'neutronmatter', 'coupling', 'g_a2', 'from', 'such', 'an', 'interaction', 'by', 'about', 'three', 'orders', 'of', 'magnitude', 'for', 'force', 'ranges', 'in', 'the', 'mmmum', 'regime']] | [-0.1614625064863099, 0.24743580589994155, -0.0486664759858589, 0.043260530165517355, -0.06340593250502867, -0.09957467748231634, 0.0400582124733504, 0.35676555591635406, -0.25157590213887115, -0.31372216155890514, 0.02592310053943139, -0.2849528639818783, -0.04210789470622937, 0.19919912540785004, 0.0833404202885167, 0.013468553549265143, 0.018640440323872975, 0.021221970725390647, -0.0833778321038052, -0.19038405521940957, 0.3243732177393718, 0.05247281790124597, 0.23094142898399797, 0.05981413082082764, 0.10718257892963097, 0.075495657705081, 0.0094996005365694, -0.033188301474890776, -0.1120201020025383, 0.0701667832693568, 0.19443685533716, 0.014388688973634055, 0.12430173177617015, -0.4290225962349386, -0.16898362837835318, 0.06757320904742098, 0.14581408837154783, 0.09984861157351622, -0.06817366973889337, -0.25719093597338843, -0.0016028286169145118, -0.20038548988830168, -0.18400875851080786, -0.06216232544156136, 0.02627566989394836, 0.023014898838785786, -0.27867264342839243, 0.06800514108639348, 0.08703791460505238, 0.028263328858614573, -0.06566926841279147, -0.14089103103874046, -0.01776736833077545, 0.04724041741994572, 0.11838139562233765, 0.10983163945773547, 0.11627546395606327, -0.14203523669426363, -0.11053637379814905, 0.3552186990380977, -0.11647735945707946, -0.1700637246939112, 0.13751264650986908, -0.1615324438187397, -0.06771820180411278, 0.15108765600059457, 0.16327436019114597, 0.12746356394038433, -0.1305263697652629, 0.05137750522731545, -0.04078376002251861, 0.1854019393407119, 0.0744735647889751, 0.010335341656442594, 0.27633188832206307, 0.19415682895729938, 0.05514863314520982, 0.11449165003701907, -0.1534238193912811, -0.053260706331692984, -0.30051623735387156, -0.11165859611679076, -0.14251867041565236, 0.06029017592771669, -0.08825438664091591, -0.10848238047415011, 0.36631560553279185, 0.13426659173435634, 0.18771195879068087, -0.006219596054439468, 0.3289790974360787, 0.07614484410280259, 0.09300619598340105, 0.042566127829357155, 0.3581162641359562, 0.2028220040784045, 0.09668880213845384, -0.2150983824329968, 0.05546272020890481, 0.0022752900797597788] |
1,802.05908 | Recognizing Cuneiform Signs Using Graph Based Methods | The cuneiform script constitutes one of the earliest systems of writing and
is realized by wedge-shaped marks on clay tablets. A tremendous number of
cuneiform tablets have already been discovered and are incrementally
digitalized and made available to automated processing. As reading cuneiform
script is still a manual task, we address the real-world application of
recognizing cuneiform signs by two graph based methods with complementary
runtime characteristics. We present a graph model for cuneiform signs together
with a tailored distance measure based on the concept of the graph edit
distance. We propose efficient heuristics for its computation and demonstrate
its effectiveness in classification tasks experimentally. To this end, the
distance measure is used to implement a nearest neighbor classifier leading to
a high computational cost for the prediction phase with increasing training set
size. In order to overcome this issue, we propose to use CNNs adapted to graphs
as an alternative approach shifting the computational cost to the training
phase. We demonstrate the practicability of both approaches in an extensive
experimental comparison regarding runtime and prediction accuracy. Although
currently available annotated real-world data is still limited, we obtain a
high accuracy using CNNs, in particular, when the training set is enriched by
augmented examples.
| cs.CV | the cuneiform script constitutes one of the earliest systems of writing and is realized by wedgeshaped marks on clay tablets a tremendous number of cuneiform tablets have already been discovered and are incrementally digitalized and made available to automated processing as reading cuneiform script is still a manual task we address the realworld application of recognizing cuneiform signs by two graph based methods with complementary runtime characteristics we present a graph model for cuneiform signs together with a tailored distance measure based on the concept of the graph edit distance we propose efficient heuristics for its computation and demonstrate its effectiveness in classification tasks experimentally to this end the distance measure is used to implement a nearest neighbor classifier leading to a high computational cost for the prediction phase with increasing training set size in order to overcome this issue we propose to use cnns adapted to graphs as an alternative approach shifting the computational cost to the training phase we demonstrate the practicability of both approaches in an extensive experimental comparison regarding runtime and prediction accuracy although currently available annotated realworld data is still limited we obtain a high accuracy using cnns in particular when the training set is enriched by augmented examples | [['the', 'cuneiform', 'script', 'constitutes', 'one', 'of', 'the', 'earliest', 'systems', 'of', 'writing', 'and', 'is', 'realized', 'by', 'wedgeshaped', 'marks', 'on', 'clay', 'tablets', 'a', 'tremendous', 'number', 'of', 'cuneiform', 'tablets', 'have', 'already', 'been', 'discovered', 'and', 'are', 'incrementally', 'digitalized', 'and', 'made', 'available', 'to', 'automated', 'processing', 'as', 'reading', 'cuneiform', 'script', 'is', 'still', 'a', 'manual', 'task', 'we', 'address', 'the', 'realworld', 'application', 'of', 'recognizing', 'cuneiform', 'signs', 'by', 'two', 'graph', 'based', 'methods', 'with', 'complementary', 'runtime', 'characteristics', 'we', 'present', 'a', 'graph', 'model', 'for', 'cuneiform', 'signs', 'together', 'with', 'a', 'tailored', 'distance', 'measure', 'based', 'on', 'the', 'concept', 'of', 'the', 'graph', 'edit', 'distance', 'we', 'propose', 'efficient', 'heuristics', 'for', 'its', 'computation', 'and', 'demonstrate', 'its', 'effectiveness', 'in', 'classification', 'tasks', 'experimentally', 'to', 'this', 'end', 'the', 'distance', 'measure', 'is', 'used', 'to', 'implement', 'a', 'nearest', 'neighbor', 'classifier', 'leading', 'to', 'a', 'high', 'computational', 'cost', 'for', 'the', 'prediction', 'phase', 'with', 'increasing', 'training', 'set', 'size', 'in', 'order', 'to', 'overcome', 'this', 'issue', 'we', 'propose', 'to', 'use', 'cnns', 'adapted', 'to', 'graphs', 'as', 'an', 'alternative', 'approach', 'shifting', 'the', 'computational', 'cost', 'to', 'the', 'training', 'phase', 'we', 'demonstrate', 'the', 'practicability', 'of', 'both', 'approaches', 'in', 'an', 'extensive', 'experimental', 'comparison', 'regarding', 'runtime', 'and', 'prediction', 'accuracy', 'although', 'currently', 'available', 'annotated', 'realworld', 'data', 'is', 'still', 'limited', 'we', 'obtain', 'a', 'high', 'accuracy', 'using', 'cnns', 'in', 'particular', 'when', 'the', 'training', 'set', 'is', 'enriched', 'by', 'augmented', 'examples']] | [-0.08776025658452828, 0.009788541968423398, -0.04537171841708615, 0.04763928108663736, -0.13475452474428012, -0.14761096598636406, 0.08403725874171976, 0.46034519640071425, -0.24593185654421354, -0.3656002702739309, 0.12888799777354898, -0.280731472168483, -0.14317754809470737, 0.19315261435750633, -0.13858979054045859, 0.10178358928133807, 0.13437289666092278, 0.0537891612501185, -0.05248995742808534, -0.3018044270527967, 0.24797659709934927, 0.054699206098174566, 0.3103393348842384, 0.05746636604681935, 0.1113734330608756, -0.037232936000138724, -0.03869288421564681, 0.013868493799521936, -0.07285271985821572, 0.17856672631323284, 0.2970902597355912, 0.18541046209197792, 0.3244300326971593, -0.4133122689638506, -0.16462242829512952, 0.0968695567354706, 0.1324285048165121, 0.11737306840836491, -0.06842744999534368, -0.30558613150074676, 0.10737196470361988, -0.17372520318181783, -0.047438756017215256, -0.11864160586207849, 0.023017393386301894, -0.020584820842772137, -0.23960471086149268, 0.004137353644325106, 0.004497780870901896, 0.10788516487981029, 0.005145649656233396, -0.11356400057226054, 0.03389304012114949, 0.1582530588386683, 0.023384228006904654, 0.05446332235884506, 0.09512058383923289, -0.14128245146461196, -0.1625086263041286, 0.3811100374395941, -0.027928924549247742, -0.17174077590050943, 0.2217706348747015, -0.022885541447299058, -0.14501521228949593, 0.09736376329708625, 0.21230695612058637, 0.09228438953840512, -0.16946440730416548, 0.035609456626915226, 0.01870573455851306, 0.19952131594376019, 0.06762756445609472, -0.01174358409879656, 0.15133312389291093, 0.28370488344979305, 0.020856806521324496, 0.1849827708210796, -0.09178398329252149, -0.030831442132373068, -0.20640125489729805, -0.14296752270585036, -0.2420443368062158, -0.030858002502046636, -0.09223501436038835, -0.1626155408208861, 0.368754448035878, 0.22356500257007486, 0.19500578263792775, 0.09738668789242522, 0.3449141983782836, 0.030308838883630576, 0.11674315185290669, 0.08273872954048463, 0.17699428986045807, 0.030274573705551745, 0.1275891343054051, -0.1616787229791311, 0.11664905676426475, 0.06783193538428225] |
1,802.05909 | iBoW-LCD: An Appearance-based Loop Closure Detection Approach using
Incremental Bags of Binary Words | In this paper, we introduce iBoW-LCD, a novel appearance-based loop closure
detection method. The presented approach makes use of an incremental
Bag-of-Words (BoW) scheme based on binary descriptors to retrieve previously
seen similar images, avoiding any vocabulary training stage usually required by
classic BoW models. In addition, to detect loop closures, iBoW-LCD builds on
the concept of dynamic islands, a simple but effective mechanism to group
similar images close in time, which reduces the computational times typically
associated to Bayesian frameworks. Our approach is validated using several
indoor and outdoor public datasets, taken under different environmental
conditions, achieving a high accuracy and outperforming other state-of-the-art
solutions.
| cs.RO | in this paper we introduce ibowlcd a novel appearancebased loop closure detection method the presented approach makes use of an incremental bagofwords bow scheme based on binary descriptors to retrieve previously seen similar images avoiding any vocabulary training stage usually required by classic bow models in addition to detect loop closures ibowlcd builds on the concept of dynamic islands a simple but effective mechanism to group similar images close in time which reduces the computational times typically associated to bayesian frameworks our approach is validated using several indoor and outdoor public datasets taken under different environmental conditions achieving a high accuracy and outperforming other stateoftheart solutions | [['in', 'this', 'paper', 'we', 'introduce', 'ibowlcd', 'a', 'novel', 'appearancebased', 'loop', 'closure', 'detection', 'method', 'the', 'presented', 'approach', 'makes', 'use', 'of', 'an', 'incremental', 'bagofwords', 'bow', 'scheme', 'based', 'on', 'binary', 'descriptors', 'to', 'retrieve', 'previously', 'seen', 'similar', 'images', 'avoiding', 'any', 'vocabulary', 'training', 'stage', 'usually', 'required', 'by', 'classic', 'bow', 'models', 'in', 'addition', 'to', 'detect', 'loop', 'closures', 'ibowlcd', 'builds', 'on', 'the', 'concept', 'of', 'dynamic', 'islands', 'a', 'simple', 'but', 'effective', 'mechanism', 'to', 'group', 'similar', 'images', 'close', 'in', 'time', 'which', 'reduces', 'the', 'computational', 'times', 'typically', 'associated', 'to', 'bayesian', 'frameworks', 'our', 'approach', 'is', 'validated', 'using', 'several', 'indoor', 'and', 'outdoor', 'public', 'datasets', 'taken', 'under', 'different', 'environmental', 'conditions', 'achieving', 'a', 'high', 'accuracy', 'and', 'outperforming', 'other', 'stateoftheart', 'solutions']] | [-0.07705017584493572, -0.002475367853269115, -0.08707527087972267, 0.07245034274036208, -0.11994624108550712, -0.16201598286548127, 0.05466786578472238, 0.4315979869660133, -0.22429617708817554, -0.3402162188699899, 0.08388356328326224, -0.21323023365291122, -0.15649692510935262, 0.20492374141646835, -0.15667882785559273, 0.07048755477612409, 0.12600196840111705, 0.02841054108005035, -0.08514519136784096, -0.2620336091416763, 0.28344875733735253, 0.07245316055531685, 0.3465917843232791, -0.0005062756675985069, 0.15137429829113758, -0.053511258568435624, -0.06467118410868213, 0.014563364585718283, -0.06134497159655439, 0.13647783762560442, 0.27543367885989656, 0.15746385647127262, 0.258353592792096, -0.4320703684626586, -0.2531005817716225, 0.06344007705830826, 0.14081130383195928, 0.10379035172935311, -0.0379160391995146, -0.3493927898693633, 0.10397686723333138, -0.1926077995270204, -0.04942082031406104, -0.11525165043489184, -0.029021359373403426, -0.03672878258825781, -0.28231355937448543, 0.05637407602709853, 0.04476395868158971, 0.08089219164461471, -0.06964421554137236, -0.10784697131244823, 0.05998409001935775, 0.12325254244317946, 0.018392902402690828, 0.06064593050709496, 0.13001401103023313, -0.1431349740395, -0.14811967391198358, 0.4166981435309236, -0.07043421115332212, -0.1760790128095183, 0.2887303212079972, -0.03342255100142211, -0.14273321335741246, 0.1629521460720123, 0.19769724944713885, 0.16197539517172396, -0.15862447942177263, 0.010149286472229645, -0.023604236031622768, 0.17711839630590895, 0.08290426249508388, -0.013879366357846616, 0.13821786326409963, 0.23728490790101484, 0.041506720097878806, 0.14335691146250332, -0.13239729463160843, -0.08762634077216856, -0.2001023187476676, -0.07796448515504241, -0.14539803056350836, -0.09029398529897802, -0.11084671918489711, -0.1650825989781879, 0.37468418793185687, 0.2735991899658424, 0.18282040920726453, 0.09077819002134045, 0.3774596078392978, 0.03484594943382455, 0.11806763105918296, 0.0968659172559945, 0.1537499105145868, 0.008690787839721171, 0.0933473782094482, -0.17475554327784965, 0.08444608700945257, 0.10403834613792312] |
1,802.0591 | Pattern Localization in Time Series through Signal-To-Model Alignment in
Latent Space | In this paper, we study the problem of locating a predefined sequence of
patterns in a time series. In particular, the studied scenario assumes a
theoretical model is available that contains the expected locations of the
patterns. This problem is found in several contexts, and it is commonly solved
by first synthesizing a time series from the model, and then aligning it to the
true time series through dynamic time warping. We propose a technique that
increases the similarity of both time series before aligning them, by mapping
them into a latent correlation space. The mapping is learned from the data
through a machine-learning setup. Experiments on data from non-destructive
testing demonstrate that the proposed approach shows significant improvements
over the state of the art.
| cs.LG stat.ML | in this paper we study the problem of locating a predefined sequence of patterns in a time series in particular the studied scenario assumes a theoretical model is available that contains the expected locations of the patterns this problem is found in several contexts and it is commonly solved by first synthesizing a time series from the model and then aligning it to the true time series through dynamic time warping we propose a technique that increases the similarity of both time series before aligning them by mapping them into a latent correlation space the mapping is learned from the data through a machinelearning setup experiments on data from nondestructive testing demonstrate that the proposed approach shows significant improvements over the state of the art | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'locating', 'a', 'predefined', 'sequence', 'of', 'patterns', 'in', 'a', 'time', 'series', 'in', 'particular', 'the', 'studied', 'scenario', 'assumes', 'a', 'theoretical', 'model', 'is', 'available', 'that', 'contains', 'the', 'expected', 'locations', 'of', 'the', 'patterns', 'this', 'problem', 'is', 'found', 'in', 'several', 'contexts', 'and', 'it', 'is', 'commonly', 'solved', 'by', 'first', 'synthesizing', 'a', 'time', 'series', 'from', 'the', 'model', 'and', 'then', 'aligning', 'it', 'to', 'the', 'true', 'time', 'series', 'through', 'dynamic', 'time', 'warping', 'we', 'propose', 'a', 'technique', 'that', 'increases', 'the', 'similarity', 'of', 'both', 'time', 'series', 'before', 'aligning', 'them', 'by', 'mapping', 'them', 'into', 'a', 'latent', 'correlation', 'space', 'the', 'mapping', 'is', 'learned', 'from', 'the', 'data', 'through', 'a', 'machinelearning', 'setup', 'experiments', 'on', 'data', 'from', 'nondestructive', 'testing', 'demonstrate', 'that', 'the', 'proposed', 'approach', 'shows', 'significant', 'improvements', 'over', 'the', 'state', 'of', 'the', 'art']] | [-0.09920398085005581, 0.04053482106840238, -0.10999088851734996, 0.04697742372564971, -0.04459882438927889, -0.0806985328681767, 0.07533257896639407, 0.4074637097120285, -0.32011605252325537, -0.3200202965959907, 0.10245061694458127, -0.2618186837527901, -0.17760646306723357, 0.21483701291307808, -0.01659047857671976, 0.06976219082716853, 0.08694191123731435, 0.037157577946782115, -0.07730561493651476, -0.24396287216991186, 0.3031390141900629, 0.03561274814605713, 0.32006448642909524, -0.016683802522718907, 0.12314025816414505, 0.008792573358863591, -0.06916268170624972, 0.02697306054434739, -0.06308549253916135, 0.10876850998960436, 0.26455296570062636, 0.17583463728055357, 0.3197089118734002, -0.42118816885352134, -0.24542254628241061, 0.0830316588357091, 0.11568105102330446, 0.11591760922968387, -0.0670107351616025, -0.2879891761690378, 0.059790690585970876, -0.13061605373304339, -0.030265300896018744, -0.06841009129583836, 0.010791932988911868, -0.0194013711232692, -0.26829249399900434, 0.06040049714408815, 0.045810463739559056, 0.032602116316556934, -0.08044262926280499, -0.04703113861754537, 0.04060791453719139, 0.15897285579517484, 0.07005067428015173, 0.05520671876054257, 0.05789507294073701, -0.11275151543482206, -0.12071843408374115, 0.39568798422813417, -0.08478794550895691, -0.16839229882881046, 0.16168717390298842, -0.12307776799052954, -0.13236606194474734, 0.11741504839062691, 0.18226357062906026, 0.16794401971250772, -0.17423583717644214, 0.05015065946709365, -0.0759783960878849, 0.18575234634056687, 0.03250407941546291, -0.06067846615612507, 0.19036543077975512, 0.21636784723959862, 0.026564789101481436, 0.18235020649433137, -0.1192201593616046, -0.08081491382047534, -0.270089386343956, -0.1452591611891985, -0.2206042368579656, -0.04990639314521104, -0.07619521983689628, -0.1133225620687008, 0.4463321925736964, 0.18327593532204628, 0.24208731482923032, 0.06926550569664687, 0.33816415529698135, 0.08216722876206041, 0.0772888937331736, 0.04008097102306783, 0.17005154581088572, 0.02101632135733962, 0.10172448424901813, -0.1936067844759673, 0.11475314301997423, 0.034970772604690864] |
1,802.05911 | An Image Processing based Object Counting Approach for Machine Vision
Application | Machine vision applications are low cost and high precision measurement
systems which are frequently used in production lines. With these systems that
provide contactless control and measurement, production facilities are able to
reach high production numbers without errors. Machine vision operations such as
product counting, error control, dimension measurement can be performed through
a camera. In this paper, a machine vision application is proposed, which can
perform object-independent product counting. The proposed approach is based on
Otsu thresholding and Hough transformation and performs automatic counting
independently of product type and color. Basically one camera is used in the
system. Through this camera, an image of the products passing through a
conveyor is taken and various image processing algorithms are applied to these
images. In this approach using images obtained from a real experimental setup,
a real-time machine vision application was installed. As a result of the
experimental studies performed, it has been determined that the proposed
approach gives fast, accurate and reliable results.
| cs.CV | machine vision applications are low cost and high precision measurement systems which are frequently used in production lines with these systems that provide contactless control and measurement production facilities are able to reach high production numbers without errors machine vision operations such as product counting error control dimension measurement can be performed through a camera in this paper a machine vision application is proposed which can perform objectindependent product counting the proposed approach is based on otsu thresholding and hough transformation and performs automatic counting independently of product type and color basically one camera is used in the system through this camera an image of the products passing through a conveyor is taken and various image processing algorithms are applied to these images in this approach using images obtained from a real experimental setup a realtime machine vision application was installed as a result of the experimental studies performed it has been determined that the proposed approach gives fast accurate and reliable results | [['machine', 'vision', 'applications', 'are', 'low', 'cost', 'and', 'high', 'precision', 'measurement', 'systems', 'which', 'are', 'frequently', 'used', 'in', 'production', 'lines', 'with', 'these', 'systems', 'that', 'provide', 'contactless', 'control', 'and', 'measurement', 'production', 'facilities', 'are', 'able', 'to', 'reach', 'high', 'production', 'numbers', 'without', 'errors', 'machine', 'vision', 'operations', 'such', 'as', 'product', 'counting', 'error', 'control', 'dimension', 'measurement', 'can', 'be', 'performed', 'through', 'a', 'camera', 'in', 'this', 'paper', 'a', 'machine', 'vision', 'application', 'is', 'proposed', 'which', 'can', 'perform', 'objectindependent', 'product', 'counting', 'the', 'proposed', 'approach', 'is', 'based', 'on', 'otsu', 'thresholding', 'and', 'hough', 'transformation', 'and', 'performs', 'automatic', 'counting', 'independently', 'of', 'product', 'type', 'and', 'color', 'basically', 'one', 'camera', 'is', 'used', 'in', 'the', 'system', 'through', 'this', 'camera', 'an', 'image', 'of', 'the', 'products', 'passing', 'through', 'a', 'conveyor', 'is', 'taken', 'and', 'various', 'image', 'processing', 'algorithms', 'are', 'applied', 'to', 'these', 'images', 'in', 'this', 'approach', 'using', 'images', 'obtained', 'from', 'a', 'real', 'experimental', 'setup', 'a', 'realtime', 'machine', 'vision', 'application', 'was', 'installed', 'as', 'a', 'result', 'of', 'the', 'experimental', 'studies', 'performed', 'it', 'has', 'been', 'determined', 'that', 'the', 'proposed', 'approach', 'gives', 'fast', 'accurate', 'and', 'reliable', 'results']] | [-0.07251691862375138, 0.04669795022283586, -0.11836271140541584, 0.020258217039403784, -0.0675792563978034, -0.17908721879421752, 0.006509544220010242, 0.41667971348938493, -0.24092781807701646, -0.36608015905860014, 0.1598088381771981, -0.2552080351596504, -0.13407150959160194, 0.2850184135104707, -0.1277396087563294, 0.15202903914111066, 0.14863362384637235, 0.0420630286518053, -0.02809025479110666, -0.2637096106723248, 0.2222985085821282, 0.04529361391405752, 0.3499248592308694, 0.01828568453037757, 0.12172030037886068, 0.042369358948620456, -0.039934169604268745, 0.017122103898368914, -0.04748842235630667, 0.1422109486309503, 0.3112503692973405, 0.19412432391299334, 0.2413413886643626, -0.39515399134666457, -0.18113499397891888, 0.08946477631221246, 0.1549376243099776, 0.06751924783328514, -0.09874747800169387, -0.3037860292735641, 0.07812529541494931, -0.1806108531345002, -0.029086189513077582, -0.1381586423855092, -0.03666535967623849, 0.004602038158686614, -0.3003392265695347, 0.008632947289469, -0.016867684691778722, 0.09016478382068131, -0.02828004881539639, -0.07466374607856723, 0.05668398996877935, 0.17068193753698463, -0.0203914332940626, 0.07220606119200541, 0.20476541376781243, -0.13305727157461816, -0.17607273469947599, 0.39029861611251265, -0.034939794599769945, -0.19941291771882694, 0.2054939643019936, -0.05153714072250652, -0.1518871861801374, 0.12316172693690365, 0.2120894804551192, 0.13377481673849873, -0.1579522843889755, 0.02977772868303382, 0.007695644873942883, 0.15940824898382638, 0.058099170992482296, -0.00805281411336472, 0.16673295564115323, 0.20419352215091965, 0.02196768896391421, 0.13546424105933416, -0.15018701872022744, -0.03163524367132344, -0.2577015164142554, -0.1434843875388322, -0.20060295283657276, -0.0022939316945527594, -0.0281620079765212, -0.11257413722163329, 0.34764904483147197, 0.20738856819532583, 0.18072751183934121, 0.01828983476731149, 0.412874876497959, 0.1053242936681819, 0.12918247256507995, 0.017532317240671055, 0.21417827533338035, 0.09339151890274205, 0.14036897873860196, -0.13940060905329427, 0.046443552550848324, 0.06249600256781774] |
1,802.05912 | Convergence of a degenerate microscopic dynamics to the porous medium
equation | We derive the porous medium equation from an interacting particle system
which belongs to the family of exclusion processes, with nearest neighbor
exchanges. The particles follow a degenerate dynamics, in the sense that the
jump rates can vanish for certain configurations, and there exist blocked
configurations that cannot evolve. In [Gon\c{c}alves-Landim-Toninelli '09] it
was proved that the macroscopic density profile in the hydrodynamic limit is
governed by the porous medium equation (PME), for initial densities uniformly
bounded away from $0$ and $1$. In this paper we consider the more general case
where the density can take those extreme values. In this context, the PME
solutions display a richer behavior, like moving interfaces, finite speed of
propagation and breaking of regularity. As a consequence, the standard
techniques that are commonly used to prove this hydrodynamic limits cannot be
straightforwardly applied to our case. We present here a way to generalize the
\emph{relative entropy method}, by involving approximations of solutions to the
hydrodynamic equation, instead of exact solutions.
| math.PR cond-mat.stat-mech math.AP | we derive the porous medium equation from an interacting particle system which belongs to the family of exclusion processes with nearest neighbor exchanges the particles follow a degenerate dynamics in the sense that the jump rates can vanish for certain configurations and there exist blocked configurations that cannot evolve in gonccalveslandimtoninelli 09 it was proved that the macroscopic density profile in the hydrodynamic limit is governed by the porous medium equation pme for initial densities uniformly bounded away from 0 and 1 in this paper we consider the more general case where the density can take those extreme values in this context the pme solutions display a richer behavior like moving interfaces finite speed of propagation and breaking of regularity as a consequence the standard techniques that are commonly used to prove this hydrodynamic limits cannot be straightforwardly applied to our case we present here a way to generalize the emphrelative entropy method by involving approximations of solutions to the hydrodynamic equation instead of exact solutions | [['we', 'derive', 'the', 'porous', 'medium', 'equation', 'from', 'an', 'interacting', 'particle', 'system', 'which', 'belongs', 'to', 'the', 'family', 'of', 'exclusion', 'processes', 'with', 'nearest', 'neighbor', 'exchanges', 'the', 'particles', 'follow', 'a', 'degenerate', 'dynamics', 'in', 'the', 'sense', 'that', 'the', 'jump', 'rates', 'can', 'vanish', 'for', 'certain', 'configurations', 'and', 'there', 'exist', 'blocked', 'configurations', 'that', 'can', 'not', 'evolve', 'in', 'gonccalveslandimtoninelli', '09', 'it', 'was', 'proved', 'that', 'the', 'macroscopic', 'density', 'profile', 'in', 'the', 'hydrodynamic', 'limit', 'is', 'governed', 'by', 'the', 'porous', 'medium', 'equation', 'pme', 'for', 'initial', 'densities', 'uniformly', 'bounded', 'away', 'from', '0', 'and', '1', 'in', 'this', 'paper', 'we', 'consider', 'the', 'more', 'general', 'case', 'where', 'the', 'density', 'can', 'take', 'those', 'extreme', 'values', 'in', 'this', 'context', 'the', 'pme', 'solutions', 'display', 'a', 'richer', 'behavior', 'like', 'moving', 'interfaces', 'finite', 'speed', 'of', 'propagation', 'and', 'breaking', 'of', 'regularity', 'as', 'a', 'consequence', 'the', 'standard', 'techniques', 'that', 'are', 'commonly', 'used', 'to', 'prove', 'this', 'hydrodynamic', 'limits', 'can', 'not', 'be', 'straightforwardly', 'applied', 'to', 'our', 'case', 'we', 'present', 'here', 'a', 'way', 'to', 'generalize', 'the', 'emphrelative', 'entropy', 'method', 'by', 'involving', 'approximations', 'of', 'solutions', 'to', 'the', 'hydrodynamic', 'equation', 'instead', 'of', 'exact', 'solutions']] | [-0.104658327106537, 0.15001656223601914, -0.10359547825664014, 0.0673010331915948, -0.050258786057841454, -0.13144115391494093, 0.008466921478870999, 0.3251404745872328, -0.28933670137999135, -0.2487096106020098, 0.10155929552327038, -0.2867502941552014, -0.1165327416944825, 0.15063541250311752, -0.005823977863988393, 0.02505530806582123, 0.037307782005239834, 0.024124145740643144, -0.05949326239534637, -0.2070695053197689, 0.3256496492198886, -0.018221078387567563, 0.25963142992995547, 0.018103943726404788, 0.08123149798101115, -0.011209636916194535, 0.05031393495706206, 0.05956591694883467, -0.171608773721863, 0.056183931629680946, 0.22469739601766123, 0.052493230541498806, 0.22948136241983869, -0.43400679621845484, -0.2505332667514414, 0.12730970633568933, 0.1935848761489336, 0.14506098703539813, -0.044163751128094106, -0.26559152029326444, 0.07738781446022187, -0.16319584154417952, -0.20644121154205886, -0.0522329859347724, 0.012109596566659605, 0.0772472391599332, -0.2792359756565134, 0.12708935953961117, 0.07838807802669659, -0.02469150485292434, -0.07752084341262673, -0.07058684560358748, -0.017058485654645603, 0.09644532665153017, 0.036514927732791684, 0.0004693428416942765, 0.11586850133172409, -0.1337827584109531, -0.06106087099272802, 0.39907848796616224, -0.09498418079937312, -0.2583003717650308, 0.22839911548353867, -0.15407478003807973, -0.10515588997378053, 0.13774414858251008, 0.18081481366635796, 0.1536966886156668, -0.16964592487958377, 0.08930221945639912, -0.04605975330104594, 0.1370382490581805, 0.07531413115131597, -0.011261382079920258, 0.1690200614229871, 0.11971440340788243, 0.07963789074436321, 0.13670082880612072, -0.039456154348072175, -0.14760599172155478, -0.3112613953103473, -0.13430846963164222, -0.16770216053585985, 0.08802613448982495, -0.09502436986451336, -0.159884922669144, 0.32435527105653983, 0.182877130092618, 0.18561228105385683, 0.05893416177344782, 0.2289892136966977, 0.1765373024202794, 0.03272851706554968, 0.11296592039421402, 0.24474651041276152, 0.1153960403941661, 0.13077969065571796, -0.16447540724121626, 0.07342358193678146, 0.08639030503191006] |
1,802.05913 | Light isovector resonances in $\pi^- p \to \pi^-\pi^-\pi^+ p$ at 190
GeV/${\it c}$ | We have performed the most comprehensive resonance-model fit of
$\pi^-\pi^-\pi^+$ states using the results of our previously published
partial-wave analysis (PWA) of a large data set of diffractive-dissociation
events from the reaction $\pi^- + p \to \pi^-\pi^-\pi^+ + p_\text{recoil}$ with
a 190 GeV/$c$ pion beam. The PWA results, which were obtained in 100 bins of
three-pion mass, $0.5 < m_{3\pi} < 2.5$ GeV/$c^2$, and simultaneously in 11
bins of the reduced four-momentum transfer squared, $0.1 < t' < 1.0$
$($GeV$/c)^2$, are subjected to a resonance-model fit using Breit-Wigner
amplitudes to simultaneously describe a subset of 14 selected waves using 11
isovector light-meson states with $J^{PC} = 0^{-+}$, $1^{++}$, $2^{++}$,
$2^{-+}$, $4^{++}$, and spin-exotic $1^{-+}$ quantum numbers. The model
contains the well-known resonances $\pi(1800)$, $a_1(1260)$, $a_2(1320)$,
$\pi_2(1670)$, $\pi_2(1880)$, and $a_4(2040)$. In addition, it includes the
disputed $\pi_1(1600)$, the excited states $a_1(1640)$, $a_2(1700)$, and
$\pi_2(2005)$, as well as the resonancelike $a_1(1420)$. We measure the
resonance parameters mass and width of these objects by combining the
information from the PWA results obtained in the 11 $t'$ bins. We extract the
relative branching fractions of the $\rho(770) \pi$ and $f_2(1270) \pi$ decays
of $a_2(1320)$ and $a_4(2040)$, where the former one is measured for the first
time. In a novel approach, we extract the $t'$ dependence of the intensity of
the resonances and of their phases. The $t'$ dependence of the intensities of
most resonances differs distinctly from the $t'$ dependence of the nonresonant
components. For the first time, we determine the $t'$ dependence of the phases
of the production amplitudes and confirm that the production mechanism of the
Pomeron exchange is common to all resonances.
| hep-ex hep-ph | we have performed the most comprehensive resonancemodel fit of pipipi states using the results of our previously published partialwave analysis pwa of a large data set of diffractivedissociation events from the reaction pi p to pipipi p_textrecoil with a 190 gevc pion beam the pwa results which were obtained in 100 bins of threepion mass 05 m_3pi 25 gevc2 and simultaneously in 11 bins of the reduced fourmomentum transfer squared 01 t 10 gevc2 are subjected to a resonancemodel fit using breitwigner amplitudes to simultaneously describe a subset of 14 selected waves using 11 isovector lightmeson states with jpc 0 1 2 2 4 and spinexotic 1 quantum numbers the model contains the wellknown resonances pi1800 a_11260 a_21320 pi_21670 pi_21880 and a_42040 in addition it includes the disputed pi_11600 the excited states a_11640 a_21700 and pi_22005 as well as the resonancelike a_11420 we measure the resonance parameters mass and width of these objects by combining the information from the pwa results obtained in the 11 t bins we extract the relative branching fractions of the rho770 pi and f_21270 pi decays of a_21320 and a_42040 where the former one is measured for the first time in a novel approach we extract the t dependence of the intensity of the resonances and of their phases the t dependence of the intensities of most resonances differs distinctly from the t dependence of the nonresonant components for the first time we determine the t dependence of the phases of the production amplitudes and confirm that the production mechanism of the pomeron exchange is common to all resonances | [['we', 'have', 'performed', 'the', 'most', 'comprehensive', 'resonancemodel', 'fit', 'of', 'pipipi', 'states', 'using', 'the', 'results', 'of', 'our', 'previously', 'published', 'partialwave', 'analysis', 'pwa', 'of', 'a', 'large', 'data', 'set', 'of', 'diffractivedissociation', 'events', 'from', 'the', 'reaction', 'pi', 'p', 'to', 'pipipi', 'p_textrecoil', 'with', 'a', '190', 'gevc', 'pion', 'beam', 'the', 'pwa', 'results', 'which', 'were', 'obtained', 'in', '100', 'bins', 'of', 'threepion', 'mass', '05', 'm_3pi', '25', 'gevc2', 'and', 'simultaneously', 'in', '11', 'bins', 'of', 'the', 'reduced', 'fourmomentum', 'transfer', 'squared', '01', 't', '10', 'gevc2', 'are', 'subjected', 'to', 'a', 'resonancemodel', 'fit', 'using', 'breitwigner', 'amplitudes', 'to', 'simultaneously', 'describe', 'a', 'subset', 'of', '14', 'selected', 'waves', 'using', '11', 'isovector', 'lightmeson', 'states', 'with', 'jpc', '0', '1', '2', '2', '4', 'and', 'spinexotic', '1', 'quantum', 'numbers', 'the', 'model', 'contains', 'the', 'wellknown', 'resonances', 'pi1800', 'a_11260', 'a_21320', 'pi_21670', 'pi_21880', 'and', 'a_42040', 'in', 'addition', 'it', 'includes', 'the', 'disputed', 'pi_11600', 'the', 'excited', 'states', 'a_11640', 'a_21700', 'and', 'pi_22005', 'as', 'well', 'as', 'the', 'resonancelike', 'a_11420', 'we', 'measure', 'the', 'resonance', 'parameters', 'mass', 'and', 'width', 'of', 'these', 'objects', 'by', 'combining', 'the', 'information', 'from', 'the', 'pwa', 'results', 'obtained', 'in', 'the', '11', 't', 'bins', 'we', 'extract', 'the', 'relative', 'branching', 'fractions', 'of', 'the', 'rho770', 'pi', 'and', 'f_21270', 'pi', 'decays', 'of', 'a_21320', 'and', 'a_42040', 'where', 'the', 'former', 'one', 'is', 'measured', 'for', 'the', 'first', 'time', 'in', 'a', 'novel', 'approach', 'we', 'extract', 'the', 't', 'dependence', 'of', 'the', 'intensity', 'of', 'the', 'resonances', 'and', 'of', 'their', 'phases', 'the', 't', 'dependence', 'of', 'the', 'intensities', 'of', 'most', 'resonances', 'differs', 'distinctly', 'from', 'the', 't', 'dependence', 'of', 'the', 'nonresonant', 'components', 'for', 'the', 'first', 'time', 'we', 'determine', 'the', 't', 'dependence', 'of', 'the', 'phases', 'of', 'the', 'production', 'amplitudes', 'and', 'confirm', 'that', 'the', 'production', 'mechanism', 'of', 'the', 'pomeron', 'exchange', 'is', 'common', 'to', 'all', 'resonances']] | [-0.09581225700990718, 0.2021382288224269, -0.08832249628167915, 0.07888543772858217, -0.000309455835263992, -0.0921328544329866, 0.07585500259467616, 0.3061426138158307, -0.18398986192607805, -0.29645759969535407, -0.024304501978351163, -0.3588765107109406, -0.020565012535399017, 0.13460117834708707, 0.09731452118321197, 0.09395947829579418, 0.06454646601536428, 0.037060771309221766, -0.02975615835660084, -0.157999661728074, 0.2964580940541248, -0.020340441450381035, 0.2053766745340058, 0.07765888980635842, 0.04830381076472206, 0.02813371439871512, -0.03993550228165682, -0.09116210157455373, -0.1628049845364223, 0.046099141713084844, 0.23773958819684618, 0.08979613530562885, 0.13614008825506038, -0.28773814972008477, -0.10201376717282679, 0.07595735526278069, 0.16434350743457787, 0.061952943072615355, 0.01676802265439218, -0.3218344488595488, 0.11604614211990012, -0.15798044449139825, -0.08998844275665345, -0.049836178643083616, 0.05616078264090611, -0.013918686373081385, -0.32032903128732065, 0.11207351370753557, 0.008055708145935437, 0.06827334153993558, -0.07355423680039215, -0.25939068886426636, -0.04096252754367817, 0.09201563459364237, 0.06640493533416464, 0.08048436131530633, 0.13394084623430505, -0.10257189948155594, -0.15325899479181254, 0.3597285365614998, -0.08894591116233103, -0.1460957224250633, 0.12522072942587528, -0.21701776790109503, -0.12060987606942088, 0.19701432647712938, 0.16716076192008278, 0.10708676132253113, -0.15360451225871255, 0.064639539321302, -0.01719256757294667, 0.2049714493062418, 0.10959693161016436, 0.05025608363798589, 0.12233596458188312, 0.1496363324515996, -0.07220352410466412, 0.08744250233116925, -0.16211167439825463, -0.055888288689798504, -0.33812672159981566, -0.08792821807829317, -0.09286565246758097, 0.05394248884151771, -0.04291841909841558, -0.06742740615657017, 0.38845333205925536, 0.05395753249904927, 0.3101347633841104, 0.029722735650940114, 0.27174650032972714, 0.10579820823358388, 0.06647999297841647, 0.05780747665283571, 0.27660003114321724, 0.2009068770606793, 0.13246591483727949, -0.2390791900684356, 0.0001054010566451477, -0.03534119767349341] |
1,802.05914 | 3D Regression Neural Network for the Quantification of Enlarged
Perivascular Spaces in Brain MRI | Enlarged perivascular spaces (EPVS) in the brain are an emerging imaging
marker for cerebral small vessel disease, and have been shown to be related to
increased risk of various neurological diseases, including stroke and dementia.
Automatic quantification of EPVS would greatly help to advance research into
its etiology and its potential as a risk indicator of disease. We propose a
convolutional network regression method to quantify the extent of EPVS in the
basal ganglia from 3D brain MRI. We first segment the basal ganglia and
subsequently apply a 3D convolutional regression network designed for small
object detection within this region of interest. The network takes an image as
input, and outputs a quantification score of EPVS. The network has
significantly more convolution operations than pooling ones and no final
activation, allowing it to span the space of real numbers. We validated our
approach using a dataset of 2000 brain MRI scans scored visually. Experiments
with varying sizes of training and test sets showed that a good performance can
be achieved with a training set of only 200 scans. With a training set of 1000
scans, the intraclass correlation coefficient (ICC) between our scoring method
and the expert's visual score was 0.74. Our method outperforms by a large
margin - more than 0.10 - four more conventional automated approaches based on
intensities, scale-invariant feature transform, and random forest. We show that
the network learns the structures of interest and investigate the influence of
hyper-parameters on the performance. We also evaluate the reproducibility of
our network using a set of 60 subjects scanned twice (scan-rescan
reproducibility). On this set our network achieves an ICC of 0.93, while the
intrarater agreement reaches 0.80. Furthermore, the automatic EPVS scoring
correlates similarly to age as visual scoring.
| cs.CV | enlarged perivascular spaces epvs in the brain are an emerging imaging marker for cerebral small vessel disease and have been shown to be related to increased risk of various neurological diseases including stroke and dementia automatic quantification of epvs would greatly help to advance research into its etiology and its potential as a risk indicator of disease we propose a convolutional network regression method to quantify the extent of epvs in the basal ganglia from 3d brain mri we first segment the basal ganglia and subsequently apply a 3d convolutional regression network designed for small object detection within this region of interest the network takes an image as input and outputs a quantification score of epvs the network has significantly more convolution operations than pooling ones and no final activation allowing it to span the space of real numbers we validated our approach using a dataset of 2000 brain mri scans scored visually experiments with varying sizes of training and test sets showed that a good performance can be achieved with a training set of only 200 scans with a training set of 1000 scans the intraclass correlation coefficient icc between our scoring method and the experts visual score was 074 our method outperforms by a large margin more than 010 four more conventional automated approaches based on intensities scaleinvariant feature transform and random forest we show that the network learns the structures of interest and investigate the influence of hyperparameters on the performance we also evaluate the reproducibility of our network using a set of 60 subjects scanned twice scanrescan reproducibility on this set our network achieves an icc of 093 while the intrarater agreement reaches 080 furthermore the automatic epvs scoring correlates similarly to age as visual scoring | [['enlarged', 'perivascular', 'spaces', 'epvs', 'in', 'the', 'brain', 'are', 'an', 'emerging', 'imaging', 'marker', 'for', 'cerebral', 'small', 'vessel', 'disease', 'and', 'have', 'been', 'shown', 'to', 'be', 'related', 'to', 'increased', 'risk', 'of', 'various', 'neurological', 'diseases', 'including', 'stroke', 'and', 'dementia', 'automatic', 'quantification', 'of', 'epvs', 'would', 'greatly', 'help', 'to', 'advance', 'research', 'into', 'its', 'etiology', 'and', 'its', 'potential', 'as', 'a', 'risk', 'indicator', 'of', 'disease', 'we', 'propose', 'a', 'convolutional', 'network', 'regression', 'method', 'to', 'quantify', 'the', 'extent', 'of', 'epvs', 'in', 'the', 'basal', 'ganglia', 'from', '3d', 'brain', 'mri', 'we', 'first', 'segment', 'the', 'basal', 'ganglia', 'and', 'subsequently', 'apply', 'a', '3d', 'convolutional', 'regression', 'network', 'designed', 'for', 'small', 'object', 'detection', 'within', 'this', 'region', 'of', 'interest', 'the', 'network', 'takes', 'an', 'image', 'as', 'input', 'and', 'outputs', 'a', 'quantification', 'score', 'of', 'epvs', 'the', 'network', 'has', 'significantly', 'more', 'convolution', 'operations', 'than', 'pooling', 'ones', 'and', 'no', 'final', 'activation', 'allowing', 'it', 'to', 'span', 'the', 'space', 'of', 'real', 'numbers', 'we', 'validated', 'our', 'approach', 'using', 'a', 'dataset', 'of', '2000', 'brain', 'mri', 'scans', 'scored', 'visually', 'experiments', 'with', 'varying', 'sizes', 'of', 'training', 'and', 'test', 'sets', 'showed', 'that', 'a', 'good', 'performance', 'can', 'be', 'achieved', 'with', 'a', 'training', 'set', 'of', 'only', '200', 'scans', 'with', 'a', 'training', 'set', 'of', '1000', 'scans', 'the', 'intraclass', 'correlation', 'coefficient', 'icc', 'between', 'our', 'scoring', 'method', 'and', 'the', 'experts', 'visual', 'score', 'was', '074', 'our', 'method', 'outperforms', 'by', 'a', 'large', 'margin', 'more', 'than', '010', 'four', 'more', 'conventional', 'automated', 'approaches', 'based', 'on', 'intensities', 'scaleinvariant', 'feature', 'transform', 'and', 'random', 'forest', 'we', 'show', 'that', 'the', 'network', 'learns', 'the', 'structures', 'of', 'interest', 'and', 'investigate', 'the', 'influence', 'of', 'hyperparameters', 'on', 'the', 'performance', 'we', 'also', 'evaluate', 'the', 'reproducibility', 'of', 'our', 'network', 'using', 'a', 'set', 'of', '60', 'subjects', 'scanned', 'twice', 'scanrescan', 'reproducibility', 'on', 'this', 'set', 'our', 'network', 'achieves', 'an', 'icc', 'of', '093', 'while', 'the', 'intrarater', 'agreement', 'reaches', '080', 'furthermore', 'the', 'automatic', 'epvs', 'scoring', 'correlates', 'similarly', 'to', 'age', 'as', 'visual', 'scoring']] | [-0.028328885249632958, 0.030319896538426764, -0.03825834273372713, 0.058213362746053085, -0.06532112740718855, -0.14186297516531216, 0.05773719990473433, 0.4396536376214875, -0.21025067273495268, -0.310882421170265, 0.08117950730876805, -0.2815562271961645, -0.1880074145930723, 0.2238726773475907, -0.13426351522523028, 0.07841864399780551, 0.125558853442309, 0.06605501636413151, -0.02944369616171602, -0.280740277431825, 0.25385322635913077, 0.045459835497855115, 0.3420772960682496, 0.01961957391447805, 0.12240230226166675, -0.029533594260734892, -0.04021498436381205, 0.028289874925996692, -0.06654903722213429, 0.1673541147101285, 0.29639098102002054, 0.1982064680573691, 0.3623743388304037, -0.36456372124335634, -0.22151662634910438, 0.0930233664730371, 0.1367659061990582, 0.04983478743695365, 0.01085316035781128, -0.34795310794022577, 0.08777651148045372, -0.17109271685095054, 0.013347531468928631, -0.1057987506605749, -0.005034299758423505, -0.03414782147778295, -0.32284818507474045, 0.09656085473282568, 0.005754107732229449, 0.13838194286498914, -0.08059800086334219, -0.12042009278224652, -0.04051775219187879, 0.18795757409634775, 0.024734298914574602, 0.10934786577698984, 0.1875278654251376, -0.1704734445699834, -0.1121546508244576, 0.3245889799035122, -0.02152598196257243, -0.1820116211467519, 0.1768639700687972, -0.10543235421455706, -0.09576492322576714, 0.1350887354302766, 0.21049437815973793, 0.07665861564495698, -0.13955043169252318, -0.06154367057967867, -0.024290028116304492, 0.21944590435716613, 0.08583784361755283, -0.054104578091812135, 0.13919115446604274, 0.2628396142113568, 0.015265389091279037, 0.14771162160202572, -0.20477804524326249, -0.014663986156590219, -0.20545297666806087, -0.13213042228579008, -0.15209587246645243, -0.03189321325606153, -0.13933434565340827, -0.17480104495159046, 0.4460011891362354, 0.1973543796310972, 0.20168671595526794, 0.11811522017393647, 0.27025079716093325, -0.004875787597045238, 0.1413853737862845, 0.039143906604370164, 0.19408394880592822, 0.05019387061053341, 0.08204346336203563, -0.18248065981034448, 0.1440955447121363, 0.020773534268012334] |
1,802.05915 | Superradiance-driven Phonon Laser | We propose to enhance the generation of a phonon laser by exploiting optical
superradiance. In our scheme, the optomechanical cavity contains a movable
membrane, which supports a mechanical mode, and the superradiance cavity can
generate the coherent collective light emissions by applying a transverse pump
to an ultracold intracavity atomic gas. The superradiant emission turns out to
be capable of enhancing the phonon laser performance. This indicates a new way
to operate a phonon laser with the assistance of coherent atomic gases trapped
in a cavity or lattice potentials.
| quant-ph | we propose to enhance the generation of a phonon laser by exploiting optical superradiance in our scheme the optomechanical cavity contains a movable membrane which supports a mechanical mode and the superradiance cavity can generate the coherent collective light emissions by applying a transverse pump to an ultracold intracavity atomic gas the superradiant emission turns out to be capable of enhancing the phonon laser performance this indicates a new way to operate a phonon laser with the assistance of coherent atomic gases trapped in a cavity or lattice potentials | [['we', 'propose', 'to', 'enhance', 'the', 'generation', 'of', 'a', 'phonon', 'laser', 'by', 'exploiting', 'optical', 'superradiance', 'in', 'our', 'scheme', 'the', 'optomechanical', 'cavity', 'contains', 'a', 'movable', 'membrane', 'which', 'supports', 'a', 'mechanical', 'mode', 'and', 'the', 'superradiance', 'cavity', 'can', 'generate', 'the', 'coherent', 'collective', 'light', 'emissions', 'by', 'applying', 'a', 'transverse', 'pump', 'to', 'an', 'ultracold', 'intracavity', 'atomic', 'gas', 'the', 'superradiant', 'emission', 'turns', 'out', 'to', 'be', 'capable', 'of', 'enhancing', 'the', 'phonon', 'laser', 'performance', 'this', 'indicates', 'a', 'new', 'way', 'to', 'operate', 'a', 'phonon', 'laser', 'with', 'the', 'assistance', 'of', 'coherent', 'atomic', 'gases', 'trapped', 'in', 'a', 'cavity', 'or', 'lattice', 'potentials']] | [-0.15857638982765565, 0.2632191751050577, -0.08417699675421032, -0.02847408828341266, -0.025953763206437063, -0.19475211707477488, 0.0859287762425819, 0.4293537762309058, -0.24055919443581547, -0.188542746656229, -0.049098283337596596, -0.266731030862318, -0.05301724071614444, 0.2631037580608024, -0.01304290780740047, 0.05167318896777677, 0.03911112164136734, -0.07577554556656252, 0.050509227659511435, -0.13695527593150023, 0.2798183398122449, 0.08640005243837498, 0.33837817970328454, 0.05778420070092079, 0.14024597464464186, -0.010493091176776739, 0.08227216460731591, -0.07918878599708334, -0.0639545038065172, 0.15412116286951755, 0.25157039302788425, -0.00990042747573906, 0.2949777463806814, -0.4352028822798408, -0.2547529542065236, 0.06646116221260824, 0.19714980483580946, 0.24202962257779004, -0.06386558794458344, -0.31116180243284514, -0.0691545808719199, -0.16167232049681413, -0.17028815113008022, -0.090259270721607, -0.06461971720910809, 0.026473024911691928, -0.2897434774576948, -0.01994016177931361, 0.05950594445810852, 0.0789367426291443, -0.030531180776613816, 0.0773203734653803, 0.0017800893022396256, 0.00012033631282157442, -0.07053311071829514, 0.020835227611621192, 0.27085841014612405, -0.12057516473153176, -0.11110190803373463, 0.4278435101000111, -0.12927885812947923, -0.10453365647935131, 0.17677633466690862, -0.14598286192696752, 0.032819571821123696, 0.21302075233582532, 0.1314414766292726, 0.0619964228231418, -0.12025155316452298, -0.03942901171348843, -0.009134070926837707, 0.24919764697944138, 0.15044511527116045, 0.1633470149166631, 0.29588845877887243, 0.18600395840352005, 0.019946492475907455, 0.2610766725716694, -0.09983407207921649, -0.027840481758421142, -0.2403029560247499, -0.12779335013140788, -0.17601896408164425, 0.07019357526088867, -0.026867604947726116, -0.11312590016240484, 0.39729526524805286, 0.11926947721395265, 0.11398253641143609, -0.0810015566445615, 0.34197336188360544, 0.1440544404021433, 0.09393584818233934, 0.010865234550130502, 0.3478896621669632, 0.1547120312762478, 0.08991269285926658, -0.3847443719467755, -0.09075132386989138, 0.0034990851633941358] |
1,802.05916 | Early-type galaxy spin evolution in the Horizon-AGN simulation | Using the Horizon-AGN simulation data, we study the relative role of mergers
and environmental effects in shaping the spin of early-type galaxies (ETGs)
after $z \simeq 1$. We follow the spin evolution of 10,037 color-selected ETGs
more massive than 10$^{10} \rm \, M_{\odot}$ that are divided into four groups:
cluster centrals (3%), cluster satellites (33%), group centrals (5%), and field
ETGs (59%). We find a strong mass dependence of the slow rotator fraction,
$f_{\rm SR}$, and the mean spin of massive ETGs. Although we do not find a
clear environmental dependence of $f_{\rm SR}$, a weak trend is seen in the
mean value of spin parameter driven by the satellite ETGs as they gradually
lose their spin as their environment becomes denser. Galaxy mergers appear to
be the main cause of total spin changes in 94% of central ETGs of halos with
$M_{vir} > 10^{12.5}\rm M_{\odot}$, but only 22% of satellite and field ETGs.
We find that non-merger induced tidal perturbations better correlate with the
galaxy spin-down in satellite ETGs than mergers. Given that the majority of
ETGs are not central in dense environments, we conclude that non-merger tidal
perturbation effects played a key role in the spin evolution of ETGs observed
in the local ($z < 1$) universe.
| astro-ph.GA | using the horizonagn simulation data we study the relative role of mergers and environmental effects in shaping the spin of earlytype galaxies etgs after z simeq 1 we follow the spin evolution of 10037 colorselected etgs more massive than 1010 rm m_odot that are divided into four groups cluster centrals 3 cluster satellites 33 group centrals 5 and field etgs 59 we find a strong mass dependence of the slow rotator fraction f_rm sr and the mean spin of massive etgs although we do not find a clear environmental dependence of f_rm sr a weak trend is seen in the mean value of spin parameter driven by the satellite etgs as they gradually lose their spin as their environment becomes denser galaxy mergers appear to be the main cause of total spin changes in 94 of central etgs of halos with m_vir 10125rm m_odot but only 22 of satellite and field etgs we find that nonmerger induced tidal perturbations better correlate with the galaxy spindown in satellite etgs than mergers given that the majority of etgs are not central in dense environments we conclude that nonmerger tidal perturbation effects played a key role in the spin evolution of etgs observed in the local z 1 universe | [['using', 'the', 'horizonagn', 'simulation', 'data', 'we', 'study', 'the', 'relative', 'role', 'of', 'mergers', 'and', 'environmental', 'effects', 'in', 'shaping', 'the', 'spin', 'of', 'earlytype', 'galaxies', 'etgs', 'after', 'z', 'simeq', '1', 'we', 'follow', 'the', 'spin', 'evolution', 'of', '10037', 'colorselected', 'etgs', 'more', 'massive', 'than', '1010', 'rm', 'm_odot', 'that', 'are', 'divided', 'into', 'four', 'groups', 'cluster', 'centrals', '3', 'cluster', 'satellites', '33', 'group', 'centrals', '5', 'and', 'field', 'etgs', '59', 'we', 'find', 'a', 'strong', 'mass', 'dependence', 'of', 'the', 'slow', 'rotator', 'fraction', 'f_rm', 'sr', 'and', 'the', 'mean', 'spin', 'of', 'massive', 'etgs', 'although', 'we', 'do', 'not', 'find', 'a', 'clear', 'environmental', 'dependence', 'of', 'f_rm', 'sr', 'a', 'weak', 'trend', 'is', 'seen', 'in', 'the', 'mean', 'value', 'of', 'spin', 'parameter', 'driven', 'by', 'the', 'satellite', 'etgs', 'as', 'they', 'gradually', 'lose', 'their', 'spin', 'as', 'their', 'environment', 'becomes', 'denser', 'galaxy', 'mergers', 'appear', 'to', 'be', 'the', 'main', 'cause', 'of', 'total', 'spin', 'changes', 'in', '94', 'of', 'central', 'etgs', 'of', 'halos', 'with', 'm_vir', '10125rm', 'm_odot', 'but', 'only', '22', 'of', 'satellite', 'and', 'field', 'etgs', 'we', 'find', 'that', 'nonmerger', 'induced', 'tidal', 'perturbations', 'better', 'correlate', 'with', 'the', 'galaxy', 'spindown', 'in', 'satellite', 'etgs', 'than', 'mergers', 'given', 'that', 'the', 'majority', 'of', 'etgs', 'are', 'not', 'central', 'in', 'dense', 'environments', 'we', 'conclude', 'that', 'nonmerger', 'tidal', 'perturbation', 'effects', 'played', 'a', 'key', 'role', 'in', 'the', 'spin', 'evolution', 'of', 'etgs', 'observed', 'in', 'the', 'local', 'z', '1', 'universe']] | [-0.14416677566923147, 0.17089299965357663, -0.07419308378616822, 0.14509986561275653, -0.05228925188692515, 0.0010537595588567795, 0.00798694214295121, 0.4234458761901467, -0.09384346998159149, -0.3540647683674287, -0.0032995597912482554, -0.275351772230922, -0.06203168206711245, 0.18447540823299455, -0.009688037897314072, -0.07040851397266355, 0.022466049707659027, -0.09730512456164933, -0.08746956440439795, -0.3362790594669515, 0.30304655122031987, 0.02814789372496307, 0.1637765767518431, -0.10566476165138952, 0.05925539298286643, -0.0460465161915065, -0.08121254099715575, -0.008484463180031846, -0.14967191453373138, -0.0433507679630851, 0.23270359910434218, 0.10428403180740847, 0.27736457143727616, -0.3833430040737285, -0.149316169038488, 0.12506571529300736, 0.23779043353016616, 0.06364644823741972, -0.12884131967189652, -0.254546823260242, 0.10215384166404679, -0.24364547807536105, -0.1400670903568229, 0.07757949430978282, 0.07557932913928822, 0.016712265383045866, -0.19195410171261185, 0.26389293692659077, 0.10044511389712758, 0.09284289860093564, -0.08785919592985153, -0.09769069038185418, -0.13000703658041196, 0.0694580109306045, 0.04815851738927521, 0.12084372390367493, 0.3141994746173641, -0.17190123793632522, -0.0013552003736406856, 0.43094942357171984, -0.06740578134642919, -0.015759459565457542, 0.2123299776348194, -0.252160586359655, -0.20723938932140157, 0.07969574617363476, 0.17329458061003072, 0.060303695826316436, -0.11660236218898824, 0.003954461776861446, 0.010743879418655792, 0.24964027902494898, -0.004276390007112687, 0.08399218252152958, 0.33078269523057136, 0.09057768916953172, 0.07540033548024903, 0.029232240865787712, -0.15071517303608833, -0.03633530565375444, -0.18688541336108327, -0.10331842638997306, -0.11427079767500069, 0.1197333336197463, -0.174357104251862, -0.05863628708004184, 0.31332060391329886, 0.11190362366181159, 0.23021155126465886, 0.09229400275416635, 0.2362619127356904, 0.08591673742151162, 0.15979403047993615, 0.12811427637729245, 0.3024134250522098, 0.21148973641524493, 0.046570640296433305, -0.27471667085317714, 0.02585968587350091, -0.05435341432823014] |
1,802.05917 | Robust estimation in controlled branching processes: Bayesian estimators
via disparities | This paper is concerned with Bayesian inferential methods for data from
controlled branching processes that account for model robustness through the
use of disparities. Under regularity conditions, we establish that estimators
built on disparity-based posterior, such as expectation and maximum a
posteriori estimates, are consistent and efficient under the posited model.
Additionally, we show that the estimates are robust to model misspecification
and presence of aberrant outliers. To this end, we develop several fundamental
ideas relating minimum disparity estimators to Bayesian estimators built on the
disparity-based posterior, for dependent tree-structured data. We illustrate
the methodology through a simulated example and apply our methods to a real
data set from cell kinetics.
| stat.ME | this paper is concerned with bayesian inferential methods for data from controlled branching processes that account for model robustness through the use of disparities under regularity conditions we establish that estimators built on disparitybased posterior such as expectation and maximum a posteriori estimates are consistent and efficient under the posited model additionally we show that the estimates are robust to model misspecification and presence of aberrant outliers to this end we develop several fundamental ideas relating minimum disparity estimators to bayesian estimators built on the disparitybased posterior for dependent treestructured data we illustrate the methodology through a simulated example and apply our methods to a real data set from cell kinetics | [['this', 'paper', 'is', 'concerned', 'with', 'bayesian', 'inferential', 'methods', 'for', 'data', 'from', 'controlled', 'branching', 'processes', 'that', 'account', 'for', 'model', 'robustness', 'through', 'the', 'use', 'of', 'disparities', 'under', 'regularity', 'conditions', 'we', 'establish', 'that', 'estimators', 'built', 'on', 'disparitybased', 'posterior', 'such', 'as', 'expectation', 'and', 'maximum', 'a', 'posteriori', 'estimates', 'are', 'consistent', 'and', 'efficient', 'under', 'the', 'posited', 'model', 'additionally', 'we', 'show', 'that', 'the', 'estimates', 'are', 'robust', 'to', 'model', 'misspecification', 'and', 'presence', 'of', 'aberrant', 'outliers', 'to', 'this', 'end', 'we', 'develop', 'several', 'fundamental', 'ideas', 'relating', 'minimum', 'disparity', 'estimators', 'to', 'bayesian', 'estimators', 'built', 'on', 'the', 'disparitybased', 'posterior', 'for', 'dependent', 'treestructured', 'data', 'we', 'illustrate', 'the', 'methodology', 'through', 'a', 'simulated', 'example', 'and', 'apply', 'our', 'methods', 'to', 'a', 'real', 'data', 'set', 'from', 'cell', 'kinetics']] | [0.003591899476370665, 0.00821815042647424, -0.10255685798102268, 0.14202111613672427, -0.07512131083110633, -0.13730171937411567, 0.11390681159189642, 0.41889276403119907, -0.25319698127511014, -0.29550198729460436, 0.14915864581561034, -0.23797004340166175, -0.19304889481648937, 0.2134491144406802, -0.13752953276491245, 0.10936893490856295, 0.10762682505086199, -0.03807041633911934, -0.06795726996124932, -0.24194199499581848, 0.30910218202693573, 0.06067735028058827, 0.3335815631356594, -0.01503402703370362, 0.1384977931901393, -0.006105531252205355, -0.04966943524358375, 0.025783102187487455, -0.18624571533468584, 0.1601293665264641, 0.23309555622908446, 0.17865947584478972, 0.321262105947008, -0.39166675563398246, -0.2089319205633155, 0.13311626262509743, 0.12464512542607514, 0.11297238610584188, -0.04852811865684752, -0.288335275895021, 0.10269727154324453, -0.1592514623493493, -0.06838651746091945, -0.14546405962827774, -0.06022517240463613, 0.028128249428092358, -0.3758034581425474, 0.11660801305913844, 0.020407253742083773, 0.06621439120656736, -0.06636455708586082, -0.1414260350394289, -0.016152596818534908, 0.09108087295185993, 0.08977270738729318, -0.05612080814453211, 0.12473657705636511, -0.07702504416407498, -0.11711503121464907, 0.29968055445063224, -0.059128651210853644, -0.22992791903314289, 0.16986669468282312, -0.07074188299845224, -0.18144276317813107, 0.07370255234953318, 0.23634689829840855, 0.09674896024637394, -0.1951983281881087, 0.04542827274155308, -0.035289872255226645, 0.12539335104074698, -0.017809786733139207, -0.04448695999763168, 0.15077335790831697, 0.18983433615030335, 0.09593451811369878, 0.1327676542409012, -0.11665187731200645, -0.10451132715637754, -0.32026493294282005, -0.08425677535837298, -0.17304459447880183, -0.018059661276302895, -0.13767402043077373, -0.18615666859749672, 0.36947826138773077, 0.2821386152173619, 0.21411289592684657, 0.15504531532962312, 0.3077839486267384, 0.09157569302145815, 0.008692787389631744, 0.08206163139107663, 0.17269684307629596, 0.1420284723107879, 0.018764462070287886, -0.1660297376581946, 0.14807369100215198, 0.018087822708997642] |
1,802.05918 | Compositional Verification of Compiler Optimisations on Relaxed Memory | A valid compiler optimisation transforms a block in a program without
introducing new observable behaviours to the program as a whole. Deciding which
optimisations are valid can be difficult, and depends closely on the semantic
model of the programming language. Axiomatic relaxed models, such as C++11,
present particular challenges for determining validity, because such models
allow subtle effects of a block transformation to be observed by the rest of
the program. In this paper we present a denotational theory that captures
optimisation validity on an axiomatic model corresponding to a fragment of
C++11. Our theory allows verifying an optimisation compositionally, by
considering only the block it transforms instead of the whole program. Using
this property, we realise the theory in the first push-button tool that can
verify real-world optimisations under an axiomatic memory model.
| cs.PL | a valid compiler optimisation transforms a block in a program without introducing new observable behaviours to the program as a whole deciding which optimisations are valid can be difficult and depends closely on the semantic model of the programming language axiomatic relaxed models such as c11 present particular challenges for determining validity because such models allow subtle effects of a block transformation to be observed by the rest of the program in this paper we present a denotational theory that captures optimisation validity on an axiomatic model corresponding to a fragment of c11 our theory allows verifying an optimisation compositionally by considering only the block it transforms instead of the whole program using this property we realise the theory in the first pushbutton tool that can verify realworld optimisations under an axiomatic memory model | [['a', 'valid', 'compiler', 'optimisation', 'transforms', 'a', 'block', 'in', 'a', 'program', 'without', 'introducing', 'new', 'observable', 'behaviours', 'to', 'the', 'program', 'as', 'a', 'whole', 'deciding', 'which', 'optimisations', 'are', 'valid', 'can', 'be', 'difficult', 'and', 'depends', 'closely', 'on', 'the', 'semantic', 'model', 'of', 'the', 'programming', 'language', 'axiomatic', 'relaxed', 'models', 'such', 'as', 'c11', 'present', 'particular', 'challenges', 'for', 'determining', 'validity', 'because', 'such', 'models', 'allow', 'subtle', 'effects', 'of', 'a', 'block', 'transformation', 'to', 'be', 'observed', 'by', 'the', 'rest', 'of', 'the', 'program', 'in', 'this', 'paper', 'we', 'present', 'a', 'denotational', 'theory', 'that', 'captures', 'optimisation', 'validity', 'on', 'an', 'axiomatic', 'model', 'corresponding', 'to', 'a', 'fragment', 'of', 'c11', 'our', 'theory', 'allows', 'verifying', 'an', 'optimisation', 'compositionally', 'by', 'considering', 'only', 'the', 'block', 'it', 'transforms', 'instead', 'of', 'the', 'whole', 'program', 'using', 'this', 'property', 'we', 'realise', 'the', 'theory', 'in', 'the', 'first', 'pushbutton', 'tool', 'that', 'can', 'verify', 'realworld', 'optimisations', 'under', 'an', 'axiomatic', 'memory', 'model']] | [-0.0802655335039651, 0.031187919665578885, -0.13537607601495832, 0.10875879148709407, -0.1251896273626237, -0.14104144338782487, 0.042685610289101616, 0.3322888888807884, -0.3235753030140898, -0.31277984087424937, 0.11775356355043295, -0.18589080712219802, -0.1488226103012575, 0.19207255769027537, -0.08020950265840363, 0.0865702900076424, 0.06054047417564473, -0.009945649419104986, -0.08737066868821215, -0.2146117817766881, 0.2816253180664255, 0.05681006778587601, 0.25203761931008367, 0.04002665740276214, 0.1081321953288488, 0.039287840523548535, 0.028100830381180147, 0.06231635087864724, -0.09270993577815512, 0.13008068619146526, 0.29313869601352976, 0.2291548690904599, 0.3009606891436808, -0.44316113887549335, -0.16979801455693347, 0.0528533836659878, 0.10357253550579633, 0.11259334341452609, -0.01037775012212736, -0.27293465080768314, 0.07903270237321562, -0.16988654763771416, -0.11010753914519254, -0.12445950208912923, -0.02685429189187377, -0.02902311018543012, -0.2598671130757821, -0.02030287182763581, 0.11602801447664735, 0.05823642733409556, -0.06605126327225146, -0.0581505396681379, 0.011493969786870502, 0.10612490502491927, 0.008631984742337477, 0.008005654453230438, 0.1226098102885785, -0.07937939891438764, -0.14262229592084133, 0.414354142969224, -0.048716644792115564, -0.22216900734147474, 0.17531450125805811, -0.02927965447723643, -0.20112424900185372, 0.06874715943765174, 0.16299231021418306, 0.1510150271533891, -0.1943139749016168, 0.13825773597484692, -0.06868784478518056, 0.21958258613221235, 0.023896247402194943, -0.004339712866540275, 0.22063418842657512, 0.21991713591955547, 0.03868805695283435, 0.18872560278352685, 0.019706170724482455, -0.10089439908372683, -0.3711569516836151, -0.17748328166277105, -0.12961560814231357, -0.016441057766301195, -0.06924617223069332, -0.18210811804156446, 0.3916352746691972, 0.2047242220115862, 0.13432899878513235, 0.1091700026673376, 0.29109127417123365, 0.11773276233388834, 0.11171289184130728, 0.06142053820901731, 0.17354990859905176, 0.0846710625094181, 0.09181298806206949, -0.1837142855450233, 0.1193433939583544, 0.07599421835733827] |
1,802.05919 | Quantum coherence fluctuation relations | We investigate manipulations of pure quantum states under incoherent or
strictly incoherent operations assisted by a coherence battery, that is, a
storage device whose degree of coherence is allowed to fluctuate in the
process. This leads to the derivation of fluctuation relations for quantum
coherence, analogous to Jarzynski's and Crooks' relations for work in
thermodynamics. Coherence is thus revealed as another instance of a physical
resource, in addition to athermality and entanglement, for which a connection
is established between the majorisation framework (regulating pure state
transformations under suitable free operations) and the emergence of
fluctuation theorems. Our study is hoped to provide further insight into the
general structure of battery assisted quantum resource theories, and more
specifically into the interplay between quantum coherence and quantum
thermodynamics.
| quant-ph cond-mat.stat-mech math-ph math.MP | we investigate manipulations of pure quantum states under incoherent or strictly incoherent operations assisted by a coherence battery that is a storage device whose degree of coherence is allowed to fluctuate in the process this leads to the derivation of fluctuation relations for quantum coherence analogous to jarzynskis and crooks relations for work in thermodynamics coherence is thus revealed as another instance of a physical resource in addition to athermality and entanglement for which a connection is established between the majorisation framework regulating pure state transformations under suitable free operations and the emergence of fluctuation theorems our study is hoped to provide further insight into the general structure of battery assisted quantum resource theories and more specifically into the interplay between quantum coherence and quantum thermodynamics | [['we', 'investigate', 'manipulations', 'of', 'pure', 'quantum', 'states', 'under', 'incoherent', 'or', 'strictly', 'incoherent', 'operations', 'assisted', 'by', 'a', 'coherence', 'battery', 'that', 'is', 'a', 'storage', 'device', 'whose', 'degree', 'of', 'coherence', 'is', 'allowed', 'to', 'fluctuate', 'in', 'the', 'process', 'this', 'leads', 'to', 'the', 'derivation', 'of', 'fluctuation', 'relations', 'for', 'quantum', 'coherence', 'analogous', 'to', 'jarzynskis', 'and', 'crooks', 'relations', 'for', 'work', 'in', 'thermodynamics', 'coherence', 'is', 'thus', 'revealed', 'as', 'another', 'instance', 'of', 'a', 'physical', 'resource', 'in', 'addition', 'to', 'athermality', 'and', 'entanglement', 'for', 'which', 'a', 'connection', 'is', 'established', 'between', 'the', 'majorisation', 'framework', 'regulating', 'pure', 'state', 'transformations', 'under', 'suitable', 'free', 'operations', 'and', 'the', 'emergence', 'of', 'fluctuation', 'theorems', 'our', 'study', 'is', 'hoped', 'to', 'provide', 'further', 'insight', 'into', 'the', 'general', 'structure', 'of', 'battery', 'assisted', 'quantum', 'resource', 'theories', 'and', 'more', 'specifically', 'into', 'the', 'interplay', 'between', 'quantum', 'coherence', 'and', 'quantum', 'thermodynamics']] | [-0.15029383927217818, 0.21597531573137357, -0.15036382561823028, 0.0923602254789431, 0.004451100207266531, -0.18673135465129265, 0.11223478187226675, 0.31073855778705034, -0.29986598930646857, -0.2572699607431238, 0.05331684815390627, -0.23066255648709125, -0.1280104233162655, 0.20937418606730976, -0.056264904453345234, 0.053396523501428345, 0.0052433670276687255, 0.03563085716750865, -0.06259644628199379, -0.1980136137304177, 0.315215939803729, 0.0784056974151763, 0.3551962843889164, 0.087315008176365, 0.07113156806112134, 0.04550434229156328, 0.010020108313284933, 0.001889098369117294, -0.12757644604454751, 0.14566553957411088, 0.2675597533982779, 0.13386333602598854, 0.2428504660197105, -0.4693848437348765, -0.234735614568409, 0.07447935876599143, 0.07574322526638824, 0.11960254082112529, -0.01657875813416756, -0.26567532818409656, 0.034323426466139534, -0.161650777529368, -0.06934950936822191, -0.1328169412334405, 0.04064994121325158, -0.06370709857179059, -0.2608843664920497, 0.09097954702733588, 0.14166274346182092, 0.04963687945541645, -0.029055755464397075, 0.014291664571612187, 0.009145952949655197, 0.15317986890607113, -0.03130559333704508, -0.03436592668812308, 0.13418387830819165, -0.13298798656453276, -0.14936931760674935, 0.3599258521793499, 0.004017324911223518, -0.18044137290959794, 0.17345661023956915, -0.11083766691929971, -0.12150673912690273, 0.030353990594102515, 0.09829962689850834, 0.0815967636548781, -0.18798792396999142, 0.07606700165261929, 0.01922102886277975, 0.16940305705389214, 0.06154477649501392, 0.17812313872901353, 0.2119984141927922, 0.13289885972404764, 0.08947749086655676, 0.23240284843459016, -0.008660042477357719, -0.22011955458456503, -0.308920966298689, -0.23824429711593048, -0.17878251210490745, 0.14018930993338544, -0.03789613654572306, -0.08989694285103017, 0.36769629629432327, 0.12547016838595035, 0.12140635376249159, 0.03303185376312791, 0.26960759043752675, 0.12041087759776957, 0.055217429226826105, 0.04112196868998812, 0.1929913777266703, 0.2239462394758852, 0.09062150744943037, -0.27582912483725636, 0.060242178953356214, 0.038621777668595314] |
1,802.0592 | A compact topology for $\sigma$-algebra convergence | We propose a sequential topology on the space of sub-$\sigma$-algebras of a
separable probability space $(\Omega,\mathcal{F},\mathbb{P})$ by linking
conditional expectations on $L^{2}$ along sequences of sub-$\sigma$-algebras.
The varying index of measurability is captured by a bundle space construction.
As a consequence, we establish the compactness of the space of
sub-$\sigma$-algebras. The proposed topology preserves independence and is
compatible with join and meet operations.
| math.PR math.FA | we propose a sequential topology on the space of subsigmaalgebras of a separable probability space omegamathcalfmathbbp by linking conditional expectations on l2 along sequences of subsigmaalgebras the varying index of measurability is captured by a bundle space construction as a consequence we establish the compactness of the space of subsigmaalgebras the proposed topology preserves independence and is compatible with join and meet operations | [['we', 'propose', 'a', 'sequential', 'topology', 'on', 'the', 'space', 'of', 'subsigmaalgebras', 'of', 'a', 'separable', 'probability', 'space', 'omegamathcalfmathbbp', 'by', 'linking', 'conditional', 'expectations', 'on', 'l2', 'along', 'sequences', 'of', 'subsigmaalgebras', 'the', 'varying', 'index', 'of', 'measurability', 'is', 'captured', 'by', 'a', 'bundle', 'space', 'construction', 'as', 'a', 'consequence', 'we', 'establish', 'the', 'compactness', 'of', 'the', 'space', 'of', 'subsigmaalgebras', 'the', 'proposed', 'topology', 'preserves', 'independence', 'and', 'is', 'compatible', 'with', 'join', 'and', 'meet', 'operations']] | [-0.1886140870314742, 0.11665861081287619, -0.0827808076781886, 0.09953470376231485, -0.07341467376266207, -0.05552523309690139, 0.08817760456105812, 0.37054977826182806, -0.27337187842746813, -0.2534128584943357, 0.11003720958436293, -0.2033036324446873, -0.12861906506475948, 0.16155281683267464, -0.17246444439071984, 0.029135191643107978, 0.04974112574691101, 0.075140652316992, -0.1295552342642276, -0.2140491153353766, 0.4367479673985924, 0.03299326123300171, 0.2859607505360766, -0.044590405108118875, 0.17154429941659882, 0.08755899851195632, -0.06285480406904032, 0.045068632218144125, -0.14952923543012095, 0.18293423384487156, 0.16025487966244184, 0.1907398097793616, 0.24577332166807045, -0.3674352818597404, -0.18034869873303078, 0.1210676794816252, 0.05610720363874284, -0.04169842772304066, 0.005301511240383935, -0.32358813383394763, 0.06917244552945097, -0.14312129180937533, -0.07602412942501288, -0.12746743510462463, -0.010283390562685709, 0.04882925873001417, -0.27985320617962217, -0.006883721769092575, 0.09372575947689632, 0.045417352712580135, -0.06647349914742841, -0.005681288472953297, -0.07131741892191626, 0.0794784574518128, 0.02105279185297337, 0.07121533410330784, 0.08917279200007518, -0.04577037331367296, -0.14875128646455113, 0.338399103073965, -0.06789093200183872, -0.2185139149826552, 0.15155128281681784, -0.14050789194418087, -0.14048950887092995, 0.0895038525026942, 0.11862688717461886, 0.0941835439926575, -0.03008383329928158, 0.1798678946086309, -0.08547568089136529, 0.1298367977142334, 0.06915746442973614, 0.08978462455764649, 0.14064415970018931, 0.18007262926253062, 0.16239176003912847, 0.15089917311164003, -0.053992009137771906, -0.08905426514822812, -0.3531096632341071, -0.22162589534843666, -0.20874205846635122, 0.03643104830195033, -0.11381076259994953, -0.17831740339124014, 0.36666686908297597, 0.059251219097022266, 0.25720930841588785, 0.11809630238170189, 0.2592959933367277, 0.0765706152740186, 0.040230665882561537, 0.05342852947346512, 0.16028632271280957, 0.16936808109786067, 0.018289788685265988, -0.13517373486141127, 0.10792746689052336, 0.14971934149544391] |
1,802.05921 | Measurement of the $t\bar{t}Z$ Production Cross Section in the Final
State with Three Charged Leptons using 36.1 fb$^{-1}$ of $pp$ Collisions at
13 TeV at the ATLAS Detector | A measurement of the production cross section for a top quark pair in
association with a $Z$ boson ($t\bar{t}Z$) is presented in this PhD thesis.
Final states with exactly three charged leptons (electrons or muons) are used,
taking into account the decay of the top quark pair in the lepton+jets channel
and the decay of the $Z$ boson into two charged leptons. The dataset used for
this analysis corresponds to 36.1 fb$^{-1}$ of proton-proton collisions at a
centre-of-mass energy of 13 TeV, recorded during 2015 and 2016 by the ATLAS
detector at the Large Hadron Collider. The result of a profile likelihood fit
to the event yields in four signal enriched regions and two background enriched
regions is
$\sigma_{t\bar{t}Z}=966^{+114}_{-102}(\text{stat.})^{+115}_{-114}(\text{syst.})$
fb. The observed (expected) significance is $7.2$ ($6.4$) standard deviations
from the background-only hypothesis. Within the experimental uncertainties, the
result is in good agreement with the Standard Model prediction. This result is
compared with two other $t\bar{t}Z$ analysis channels, using the same dataset
but different lepton multiplicities. The analysis presented here is found to be
the most sensitive one in terms of observed significance. The result of a
combined fit of all three analysis channels is discussed. Two feasibility
studies of possible future $t\bar{t}Z$ analysis techniques are demonstrated.
| hep-ex | a measurement of the production cross section for a top quark pair in association with a z boson tbartz is presented in this phd thesis final states with exactly three charged leptons electrons or muons are used taking into account the decay of the top quark pair in the leptonjets channel and the decay of the z boson into two charged leptons the dataset used for this analysis corresponds to 361 fb1 of protonproton collisions at a centreofmass energy of 13 tev recorded during 2015 and 2016 by the atlas detector at the large hadron collider the result of a profile likelihood fit to the event yields in four signal enriched regions and two background enriched regions is sigma_tbartz966114_102textstat115_114textsyst fb the observed expected significance is 72 64 standard deviations from the backgroundonly hypothesis within the experimental uncertainties the result is in good agreement with the standard model prediction this result is compared with two other tbartz analysis channels using the same dataset but different lepton multiplicities the analysis presented here is found to be the most sensitive one in terms of observed significance the result of a combined fit of all three analysis channels is discussed two feasibility studies of possible future tbartz analysis techniques are demonstrated | [['a', 'measurement', 'of', 'the', 'production', 'cross', 'section', 'for', 'a', 'top', 'quark', 'pair', 'in', 'association', 'with', 'a', 'z', 'boson', 'tbartz', 'is', 'presented', 'in', 'this', 'phd', 'thesis', 'final', 'states', 'with', 'exactly', 'three', 'charged', 'leptons', 'electrons', 'or', 'muons', 'are', 'used', 'taking', 'into', 'account', 'the', 'decay', 'of', 'the', 'top', 'quark', 'pair', 'in', 'the', 'leptonjets', 'channel', 'and', 'the', 'decay', 'of', 'the', 'z', 'boson', 'into', 'two', 'charged', 'leptons', 'the', 'dataset', 'used', 'for', 'this', 'analysis', 'corresponds', 'to', '361', 'fb1', 'of', 'protonproton', 'collisions', 'at', 'a', 'centreofmass', 'energy', 'of', '13', 'tev', 'recorded', 'during', '2015', 'and', '2016', 'by', 'the', 'atlas', 'detector', 'at', 'the', 'large', 'hadron', 'collider', 'the', 'result', 'of', 'a', 'profile', 'likelihood', 'fit', 'to', 'the', 'event', 'yields', 'in', 'four', 'signal', 'enriched', 'regions', 'and', 'two', 'background', 'enriched', 'regions', 'is', 'sigma_tbartz966114_102textstat115_114textsyst', 'fb', 'the', 'observed', 'expected', 'significance', 'is', '72', '64', 'standard', 'deviations', 'from', 'the', 'backgroundonly', 'hypothesis', 'within', 'the', 'experimental', 'uncertainties', 'the', 'result', 'is', 'in', 'good', 'agreement', 'with', 'the', 'standard', 'model', 'prediction', 'this', 'result', 'is', 'compared', 'with', 'two', 'other', 'tbartz', 'analysis', 'channels', 'using', 'the', 'same', 'dataset', 'but', 'different', 'lepton', 'multiplicities', 'the', 'analysis', 'presented', 'here', 'is', 'found', 'to', 'be', 'the', 'most', 'sensitive', 'one', 'in', 'terms', 'of', 'observed', 'significance', 'the', 'result', 'of', 'a', 'combined', 'fit', 'of', 'all', 'three', 'analysis', 'channels', 'is', 'discussed', 'two', 'feasibility', 'studies', 'of', 'possible', 'future', 'tbartz', 'analysis', 'techniques', 'are', 'demonstrated']] | [-0.055895388212271975, 0.14671621067241486, -0.07230871836587027, 0.135593255825829, 0.01586380112889105, -0.1375907037059044, 0.009854280293774475, 0.3153506189819823, -0.17633172401138897, -0.34612151047495165, 0.02593709198527436, -0.3639958209213484, 0.04923478059484217, 0.16116869120883476, 0.0586796464066211, 0.08532626212866146, 0.1689415697926131, 0.010071036331265153, -0.020252748109678313, -0.2557023644302655, 0.25973591238748533, 0.08026816129901455, 0.2833740439794922, 0.0562077077338472, 0.06478769373085386, 0.02606324878073686, -0.10543263715197947, -0.04532003416272911, -0.0691548952609877, 0.08587011824420188, 0.2408569065714933, 0.08924387018784012, 0.14607330590703535, -0.32965950164220575, -0.09289981965744162, 0.13282743142013556, 0.1257404261607749, 0.06683544199944821, -0.06965393269009598, -0.3232252740265024, 0.13755200928821934, -0.21963223304093174, -0.08815397241478334, 0.036192772750634226, -0.019342023666803407, -0.06483127658472405, -0.31645032386883226, 0.11647427374908466, -0.017343521478712487, 0.05275907782042055, -0.021421356636406944, -0.20843308503983668, -0.06400487369527696, 0.02335438435078933, 0.11065454394906958, 0.05566428638361756, 0.16526454453101128, -0.11575221998822757, -0.19529632093764623, 0.35843523321402015, -0.07323739366171864, -0.16237506275720787, 0.20931860489699564, -0.19727982207172035, -0.13736312209235196, 0.17418891620410842, 0.23473351116934157, 0.050068263542042704, -0.24459261777449073, 0.08087634096669205, -0.03330746993594306, 0.17166580113207072, 0.058132325609901794, 0.02768112721287694, 0.20777573767886723, 0.23953976748890957, -0.036367517235933, 0.09497914414426754, -0.1575921713148506, -0.061453615401439746, -0.4219932338602624, -0.13257444005694638, -0.08887606017230512, 0.009568025275513313, -0.038829497928356466, -0.049308802005699245, 0.4065511255452717, 0.09536632013877908, 0.2880311878850159, -0.009313887169412834, 0.2900201992653943, 0.08251619239527623, 0.05513477009140154, 0.039524635004410315, 0.3226302114922273, 0.1484104747922404, 0.1239674238225861, -0.16607093244612453, 0.03490696001110725, 0.03306650478636972] |
1,802.05922 | Physical content of Quadratic Gravity | We have recently undergone an analysis of gravitational theories as defined
in first order formalism, where the metric and the connection are treated as
independent fields. The physical meaning of the connection field has
historically been somewhat elusive. In this paper, a complete spin analysis of
the torsionless connection field is performed, and its consequences are
explored. The main properties of a hypothetical consistent truncation of the
theory are discussed as well.
| hep-th | we have recently undergone an analysis of gravitational theories as defined in first order formalism where the metric and the connection are treated as independent fields the physical meaning of the connection field has historically been somewhat elusive in this paper a complete spin analysis of the torsionless connection field is performed and its consequences are explored the main properties of a hypothetical consistent truncation of the theory are discussed as well | [['we', 'have', 'recently', 'undergone', 'an', 'analysis', 'of', 'gravitational', 'theories', 'as', 'defined', 'in', 'first', 'order', 'formalism', 'where', 'the', 'metric', 'and', 'the', 'connection', 'are', 'treated', 'as', 'independent', 'fields', 'the', 'physical', 'meaning', 'of', 'the', 'connection', 'field', 'has', 'historically', 'been', 'somewhat', 'elusive', 'in', 'this', 'paper', 'a', 'complete', 'spin', 'analysis', 'of', 'the', 'torsionless', 'connection', 'field', 'is', 'performed', 'and', 'its', 'consequences', 'are', 'explored', 'the', 'main', 'properties', 'of', 'a', 'hypothetical', 'consistent', 'truncation', 'of', 'the', 'theory', 'are', 'discussed', 'as', 'well']] | [-0.15372788050444797, 0.11658871849572784, -0.11532151313602096, 0.07774447927820599, -0.084930194380124, -0.05629293274574189, -0.02988084150193673, 0.3604568954712401, -0.20809860090311202, -0.29296098665023845, 0.13365003024551292, -0.2250917022401053, -0.1993835352283592, 0.16310797193242857, -0.037343966658227146, 0.038610609816613656, -0.03892074511774505, 0.09505743469344452, -0.09142925209986667, -0.2067156283624677, 0.3496228287727313, 0.08579507066557805, 0.22342641461808752, 0.05098192581337773, 0.10283865361836636, -0.02295287542640128, -0.08556141785811633, 0.08969447836958959, -0.11564299442236209, 0.0609064074103824, 0.20095709265054515, 0.11778756350789384, 0.25643198035605663, -0.433358433475304, -0.24546309087115029, 0.07809291718553545, 0.14882832425387782, 0.09041005709312028, -0.07072198526778568, -0.26194057761070627, 0.06971093520405702, -0.20325226098712948, -0.1652166683278564, -0.06504737704785334, 0.05988713180219444, -0.012762254336848855, -0.16794478938552654, 0.054963554414118536, 0.06902547009586771, 0.09495223091572472, -0.07072401323724382, -0.10819117978422178, -0.01392367002618913, 0.14541521193718332, 0.12069727073928031, 0.07871014747070149, 0.07001250235286231, -0.11816197331386825, -0.15163165294021988, 0.39662463443043333, -0.04040187669225917, -0.17041591936463696, 0.20894659334509116, -0.11198784224689007, -0.17168722765442604, 0.054417978765236005, 0.12846656944344026, 0.16310994883274865, -0.17480522471790513, 0.14831620788350441, -0.042137588581277266, 0.09264910231447882, 0.050902356594128326, 0.10345996013428602, 0.24193140625074092, 0.18094127773979884, -0.03245857728890971, 0.113407635333715, -0.027512178238895204, -0.13190538264138418, -0.3425856707100239, -0.16094513794294268, -0.17410284508433607, 0.0651021793213052, -0.02921301252556279, -0.15685514650411075, 0.3801645547694837, 0.1281205885267506, 0.1983799998803685, -0.012409884366206825, 0.2577905244866593, 0.15356175497678728, 0.06068994043744169, -0.0019572306191548705, 0.3282990022821145, 0.2672848117848237, 0.054208708461374044, -0.14341217977926135, 0.049778562511265695, 0.03847356688735696] |
1,802.05923 | Small totally $p$-adic algebraic numbers | The purpose of this note is to give a short and elementary proof of the fact,
that the absolute logarithmic Weil-height is bounded from below by a positive
constant for all totally p-adic numbers which are neither zero nor a root of
unity. The proof is based on an idea of C. Petsche and gives the best known
lower bounds in this setting. These bounds differ from the truth by a term of
less than $\log(3)/p$.
| math.NT | the purpose of this note is to give a short and elementary proof of the fact that the absolute logarithmic weilheight is bounded from below by a positive constant for all totally padic numbers which are neither zero nor a root of unity the proof is based on an idea of c petsche and gives the best known lower bounds in this setting these bounds differ from the truth by a term of less than log3p | [['the', 'purpose', 'of', 'this', 'note', 'is', 'to', 'give', 'a', 'short', 'and', 'elementary', 'proof', 'of', 'the', 'fact', 'that', 'the', 'absolute', 'logarithmic', 'weilheight', 'is', 'bounded', 'from', 'below', 'by', 'a', 'positive', 'constant', 'for', 'all', 'totally', 'padic', 'numbers', 'which', 'are', 'neither', 'zero', 'nor', 'a', 'root', 'of', 'unity', 'the', 'proof', 'is', 'based', 'on', 'an', 'idea', 'of', 'c', 'petsche', 'and', 'gives', 'the', 'best', 'known', 'lower', 'bounds', 'in', 'this', 'setting', 'these', 'bounds', 'differ', 'from', 'the', 'truth', 'by', 'a', 'term', 'of', 'less', 'than', 'log3p']] | [-0.12724085515868422, 0.14513869267259882, -0.10725615692098399, 0.08007082282219434, -0.10650887085452072, -0.13048981735482812, 0.07010270632698037, 0.2499562610645552, -0.24045321365465988, -0.30303062803137143, 0.12754649244016036, -0.25305926721744443, -0.12801750673915613, 0.25555515838031834, -0.09140487133550483, -0.0414397690910846, -0.0008560730509359289, 0.13696482459813156, -0.0740997359641148, -0.28052533551345804, 0.3427686969485335, 0.017288597426503093, 0.2079580094212213, 0.11500389755678338, 0.0922256261487869, -0.027006035557369124, -0.03207347964918291, -0.03307991419018976, -0.15127670331089207, 0.17243975225987063, 0.20539716333528427, 0.10111064855890298, 0.2769177307978877, -0.35779563387906227, -0.10705492298773213, 0.16158914714705552, 0.12721225141069373, 0.10576381670103434, -0.012410808614190869, -0.2229070437543497, 0.15830874954023072, -0.1313135961221682, -0.11954100872075336, -0.007856519364223286, 0.03463733350430187, 0.03171576184497492, -0.24232489080797578, 0.07134093712964976, 0.1740650454586422, 0.11345075249571253, -0.05744799068575171, -0.1779271321295685, 0.04792866740073707, 0.07429681195424416, 0.0413488880133357, 0.06734947917347371, 0.0483460811004546, -0.09324980691402547, -0.09418582866547277, 0.35908948747139124, -0.09898811198454004, -0.20205147103469417, 0.16032260515714516, -0.14588366929328422, -0.07074016971966705, 0.14675683497979836, 0.07661143151061559, 0.1538523130206945, -0.1012041974951186, 0.12478801852085854, -0.09499726368970163, 0.1837281989235733, 0.06858136158159657, 0.018322797883081728, 0.13462783929866715, 0.06791845889057259, 0.1305909780030315, 0.13430431668923512, 0.01767970317332829, -0.086122377404339, -0.388487847974977, -0.1466821539656234, -0.24595701130818123, 0.08353073688478027, -0.08403218648910862, -0.18800479284097515, 0.3465589677310876, 0.10210744495428092, 0.23594576474027457, 0.1786105898224648, 0.29657836696384726, 0.12847113304746313, 0.065285341636391, 0.06478123584560849, 0.22024904628838035, 0.1370913387666381, 0.03871639715381772, -0.114812343544956, 0.10656037188537822, 0.11954828363751231] |
1,802.05924 | Toward flying qubit spectroscopy | While the coherent control of two level quantum systems ---qubits--- is now
standard, their continuum electronic equivalents ---flying qubits--- are much
less developed. A first step in this direction has been achieved in DC
interferometry experiments. Here, we propose a simple setup to perform the
second step, the spectroscopy of these flying qubits, by measuring the DC
response to a high frequency AC voltage drive. Using two different concurring
approaches --- Floquet theory and time-dependent simulations --- and three
different models --- an analytical model, a simple microscopic model and a
realistic microscopic model --- we predict the power-frequency map of the
multi-terminal device. We argue that this spectroscopy provides a direct
measurement of the flying qubit characteristic frequencies and a key validation
for more advanced quantum manipulations.
| cond-mat.mes-hall | while the coherent control of two level quantum systems qubits is now standard their continuum electronic equivalents flying qubits are much less developed a first step in this direction has been achieved in dc interferometry experiments here we propose a simple setup to perform the second step the spectroscopy of these flying qubits by measuring the dc response to a high frequency ac voltage drive using two different concurring approaches floquet theory and timedependent simulations and three different models an analytical model a simple microscopic model and a realistic microscopic model we predict the powerfrequency map of the multiterminal device we argue that this spectroscopy provides a direct measurement of the flying qubit characteristic frequencies and a key validation for more advanced quantum manipulations | [['while', 'the', 'coherent', 'control', 'of', 'two', 'level', 'quantum', 'systems', 'qubits', 'is', 'now', 'standard', 'their', 'continuum', 'electronic', 'equivalents', 'flying', 'qubits', 'are', 'much', 'less', 'developed', 'a', 'first', 'step', 'in', 'this', 'direction', 'has', 'been', 'achieved', 'in', 'dc', 'interferometry', 'experiments', 'here', 'we', 'propose', 'a', 'simple', 'setup', 'to', 'perform', 'the', 'second', 'step', 'the', 'spectroscopy', 'of', 'these', 'flying', 'qubits', 'by', 'measuring', 'the', 'dc', 'response', 'to', 'a', 'high', 'frequency', 'ac', 'voltage', 'drive', 'using', 'two', 'different', 'concurring', 'approaches', 'floquet', 'theory', 'and', 'timedependent', 'simulations', 'and', 'three', 'different', 'models', 'an', 'analytical', 'model', 'a', 'simple', 'microscopic', 'model', 'and', 'a', 'realistic', 'microscopic', 'model', 'we', 'predict', 'the', 'powerfrequency', 'map', 'of', 'the', 'multiterminal', 'device', 'we', 'argue', 'that', 'this', 'spectroscopy', 'provides', 'a', 'direct', 'measurement', 'of', 'the', 'flying', 'qubit', 'characteristic', 'frequencies', 'and', 'a', 'key', 'validation', 'for', 'more', 'advanced', 'quantum', 'manipulations']] | [-0.16574456912161212, 0.13823915465705325, -0.07185382845120565, 0.02926132820017125, -0.0162191666933077, -0.2292592823317635, 0.07557208612542449, 0.4072900520292141, -0.23652000688467054, -0.30524597540798204, 0.04394035709969279, -0.24348355415502504, -0.13150846956846035, 0.2639520731698271, 0.008622317484790278, 0.10727673584985878, 0.03732567862607539, -0.03405450547354356, -0.061266038089900485, -0.15658913899753843, 0.24045526532215938, 0.05481723734110053, 0.32227863279366564, 0.009174967214705483, 0.13443467179463514, -0.01954003591691294, 0.017773028838658524, -0.00043945257446818776, -0.09451883118591438, 0.11058220840876005, 0.25210172907889267, 0.053098158045266304, 0.2785295878026274, -0.5057272353630152, -0.24041657582969375, 0.037390642236137105, 0.10020893306359686, 0.20699999617194878, -0.048914254420167474, -0.2696460398635076, 0.027327167294589023, -0.20919073144755057, -0.09183703239015754, -0.11167127277792221, 0.006028232549602586, -0.02938779678257678, -0.22819227905523393, 0.03123300265607184, 0.017211091518777633, 0.09193358556818097, -0.028933486856159665, -0.042943773566812816, 0.04592594769295125, 0.1564360233373478, -0.08406401936043685, 0.010114304016526384, 0.1725527247857122, -0.11076431704174367, -0.18315665365286893, 0.337611866228643, -0.04598508973797453, -0.18123112352670082, 0.19366186323215165, -0.1263852142099847, -0.09204826825448582, 0.043086061802422325, 0.14281973860136443, 0.1478344816902292, -0.19491217923026735, 0.0040559933479544855, -0.015328668568497138, 0.19576464760147275, 0.02072144367904853, 0.03472189712263043, 0.22203953129299467, 0.20788323226940608, 0.05607754388878557, 0.1281816282257017, -0.13334238326041808, -0.08958557002516764, -0.26844950039089926, -0.13817155723940702, -0.1902337177251015, 0.08175276325181907, -0.03867241556802201, -0.10550916238102101, 0.4426557677497546, 0.1745351851840819, 0.15068506162553544, 0.008933552704195703, 0.39634665525368146, 0.15702359491467266, 0.04529971472971562, -0.008512723939343086, 0.2551187461011127, 0.14569496077808342, 0.09034970447969352, -0.25413631442619766, 0.0069400398192116085, -0.003920783544139516] |
1,802.05925 | Energy Optimization of Robotic Cells | This study focuses on the energy optimization of industrial robotic cells,
which is essential for sustainable production in the long term. A holistic
approach that considers a robotic cell as a whole toward minimizing energy
consumption is proposed. The mathematical model, which takes into account
various robot speeds, positions, power-saving modes, and alternative orders of
operations, can be transformed into a mixed-integer linear programming
formulation that is, however, suitable only for small instances. To optimize
complex robotic cells, a hybrid heuristic accelerated by using multicore
processors and the Gurobi simplex method for piecewise linear convex functions
is implemented. The experimental results showed that the heuristic solved 93 %
of instances with a solution quality close to a proven lower bound. Moreover,
compared with the existing works, which typically address problems with three
to four robots, this study solved real-size problem instances with up to 12
robots and considered more optimization aspects. The proposed algorithms were
also applied on an existing robotic cell in \v{S}koda Auto. The outcomes, based
on simulations and measurements, indicate that, compared with the previous
state (at maximal robot speeds and without deeper power-saving modes), the
energy consumption can be reduced by about 20 % merely by optimizing the robot
speeds and applying power-saving modes. All the software and generated datasets
used in this research are publicly available.
| cs.RO | this study focuses on the energy optimization of industrial robotic cells which is essential for sustainable production in the long term a holistic approach that considers a robotic cell as a whole toward minimizing energy consumption is proposed the mathematical model which takes into account various robot speeds positions powersaving modes and alternative orders of operations can be transformed into a mixedinteger linear programming formulation that is however suitable only for small instances to optimize complex robotic cells a hybrid heuristic accelerated by using multicore processors and the gurobi simplex method for piecewise linear convex functions is implemented the experimental results showed that the heuristic solved 93 of instances with a solution quality close to a proven lower bound moreover compared with the existing works which typically address problems with three to four robots this study solved realsize problem instances with up to 12 robots and considered more optimization aspects the proposed algorithms were also applied on an existing robotic cell in vskoda auto the outcomes based on simulations and measurements indicate that compared with the previous state at maximal robot speeds and without deeper powersaving modes the energy consumption can be reduced by about 20 merely by optimizing the robot speeds and applying powersaving modes all the software and generated datasets used in this research are publicly available | [['this', 'study', 'focuses', 'on', 'the', 'energy', 'optimization', 'of', 'industrial', 'robotic', 'cells', 'which', 'is', 'essential', 'for', 'sustainable', 'production', 'in', 'the', 'long', 'term', 'a', 'holistic', 'approach', 'that', 'considers', 'a', 'robotic', 'cell', 'as', 'a', 'whole', 'toward', 'minimizing', 'energy', 'consumption', 'is', 'proposed', 'the', 'mathematical', 'model', 'which', 'takes', 'into', 'account', 'various', 'robot', 'speeds', 'positions', 'powersaving', 'modes', 'and', 'alternative', 'orders', 'of', 'operations', 'can', 'be', 'transformed', 'into', 'a', 'mixedinteger', 'linear', 'programming', 'formulation', 'that', 'is', 'however', 'suitable', 'only', 'for', 'small', 'instances', 'to', 'optimize', 'complex', 'robotic', 'cells', 'a', 'hybrid', 'heuristic', 'accelerated', 'by', 'using', 'multicore', 'processors', 'and', 'the', 'gurobi', 'simplex', 'method', 'for', 'piecewise', 'linear', 'convex', 'functions', 'is', 'implemented', 'the', 'experimental', 'results', 'showed', 'that', 'the', 'heuristic', 'solved', '93', 'of', 'instances', 'with', 'a', 'solution', 'quality', 'close', 'to', 'a', 'proven', 'lower', 'bound', 'moreover', 'compared', 'with', 'the', 'existing', 'works', 'which', 'typically', 'address', 'problems', 'with', 'three', 'to', 'four', 'robots', 'this', 'study', 'solved', 'realsize', 'problem', 'instances', 'with', 'up', 'to', '12', 'robots', 'and', 'considered', 'more', 'optimization', 'aspects', 'the', 'proposed', 'algorithms', 'were', 'also', 'applied', 'on', 'an', 'existing', 'robotic', 'cell', 'in', 'vskoda', 'auto', 'the', 'outcomes', 'based', 'on', 'simulations', 'and', 'measurements', 'indicate', 'that', 'compared', 'with', 'the', 'previous', 'state', 'at', 'maximal', 'robot', 'speeds', 'and', 'without', 'deeper', 'powersaving', 'modes', 'the', 'energy', 'consumption', 'can', 'be', 'reduced', 'by', 'about', '20', 'merely', 'by', 'optimizing', 'the', 'robot', 'speeds', 'and', 'applying', 'powersaving', 'modes', 'all', 'the', 'software', 'and', 'generated', 'datasets', 'used', 'in', 'this', 'research', 'are', 'publicly', 'available']] | [-0.09321523521473597, 0.05079661175207322, -0.05094234709128088, 0.02196370248926842, -0.09466951580957399, -0.17858869932087804, 0.04147654165377106, 0.3942093132021025, -0.24474481313378302, -0.34489163932381967, 0.11671836387607432, -0.2265149799790746, -0.13777725285542872, 0.258735236287792, -0.09184565582876564, 0.10150661715092736, 0.12625112807497793, 0.0002416522859450464, -0.03418617212993772, -0.2746271437521033, 0.22516740444799835, 0.03386216781982178, 0.29051683710700055, 0.03937364866905803, 0.13563013492246082, -0.013765176923714852, 0.009397243880378424, 0.04684267258575964, -0.08866556502578016, 0.14296118393615145, 0.3093181609105609, 0.16083822797325978, 0.3222434212231513, -0.4663984193167555, -0.2021448293902672, 0.07542210280758525, 0.13827009633644868, 0.057592564642201326, -0.019559922539391407, -0.2756424126249456, 0.08838568320561953, -0.1428094922080038, -0.08490728418376946, -0.0775430421772148, -0.020035219560334577, 0.014572733707209075, -0.28445666704600286, 0.007191119459644601, 0.010320289031636619, 0.043751950930043575, -0.09297538867835468, -0.15000213232583479, 0.017546586732384364, 0.1145728514193335, 0.026436751605323387, 0.04074454979240518, 0.1478571232371972, -0.10365150133126474, -0.16218965866126617, 0.3986827036869977, -0.0035553516461214888, -0.2317918575659326, 0.19148832221126713, -0.0459240836421361, -0.11964940520509684, 0.13423360430917472, 0.22132511465135243, 0.1281341810843164, -0.18218717144785124, 0.039742417808957486, -0.008477100136971802, 0.177791697252969, 0.07343015541032025, -0.036998889278705926, 0.14617197663916293, 0.21154340489878568, 0.09720182102472616, 0.14265472041613875, -0.027053322271367006, -0.12249680509077333, -0.22131584549147568, -0.12685212955747116, -0.17540592964420335, -0.01907805410542722, -0.09369107233655453, -0.08833254776989033, 0.3893260099549154, 0.13661866664989006, 0.15818249069874116, 0.10638624146888288, 0.36910676148318505, 0.094106641814856, 0.12607863842009848, 0.12583498940845833, 0.21710698498912806, 0.019958195399381904, 0.11706587009841081, -0.21897344123422588, 0.05512252196438884, 0.041284953419187476] |
1,802.05926 | Microscopic solutions of the Boltzmann-Enskog equation in the series
representation | The Boltzmann-Enskog equation for a hard sphere gas is known to have so
called microscopic solutions, i.e., solutions of the form of time-evolving
empirical measures of a finite number of hard spheres. However, the precise
mathematical meaning of these solutions should be discussed, since the formal
substitution of empirical measures into the equation is not well-defined. Here
we give a rigorous mathematical meaning to the microscopic solutions to the
Boltzmann-Enskog equation by means of a suitable series representation.
| math-ph math.AP math.DS math.MP | the boltzmannenskog equation for a hard sphere gas is known to have so called microscopic solutions ie solutions of the form of timeevolving empirical measures of a finite number of hard spheres however the precise mathematical meaning of these solutions should be discussed since the formal substitution of empirical measures into the equation is not welldefined here we give a rigorous mathematical meaning to the microscopic solutions to the boltzmannenskog equation by means of a suitable series representation | [['the', 'boltzmannenskog', 'equation', 'for', 'a', 'hard', 'sphere', 'gas', 'is', 'known', 'to', 'have', 'so', 'called', 'microscopic', 'solutions', 'ie', 'solutions', 'of', 'the', 'form', 'of', 'timeevolving', 'empirical', 'measures', 'of', 'a', 'finite', 'number', 'of', 'hard', 'spheres', 'however', 'the', 'precise', 'mathematical', 'meaning', 'of', 'these', 'solutions', 'should', 'be', 'discussed', 'since', 'the', 'formal', 'substitution', 'of', 'empirical', 'measures', 'into', 'the', 'equation', 'is', 'not', 'welldefined', 'here', 'we', 'give', 'a', 'rigorous', 'mathematical', 'meaning', 'to', 'the', 'microscopic', 'solutions', 'to', 'the', 'boltzmannenskog', 'equation', 'by', 'means', 'of', 'a', 'suitable', 'series', 'representation']] | [-0.10701890926746926, 0.06323675665025337, -0.1695979082097228, 0.1100583082357517, -0.13685825387111458, -0.10774994466023949, 0.05525300806412139, 0.3099784731435088, -0.28058216418139637, -0.24724333845556545, 0.10594233383949941, -0.2965781254431185, -0.13583665343526846, 0.16226445698441985, -0.029465107741252255, 0.11845609863312581, 0.029612687699950468, 0.061191454756622896, -0.07367892916768025, -0.19800312460089722, 0.32513143254133564, 0.018710448788717773, 0.24759805044278693, 0.060367055786534764, 0.15602162800347194, -0.043097482952408686, -0.0197342235642748, 0.05971491753828163, -0.18506029449128666, 0.12130628956051973, 0.23874280348872373, 0.12962971331897932, 0.2880453445399419, -0.4585808048454615, -0.21284545076718459, 0.08502244375174484, 0.17532484243528393, 0.10120215163064691, -0.021890906223024312, -0.2529237873804493, 0.06040897832896847, -0.15195615619468766, -0.1684573702335071, -0.1326857486512894, 0.05792721929267431, 0.05752489488207711, -0.21092657905477935, 0.07132315395089488, 0.07260343062285429, 0.04467934521679313, -0.11451801538276367, -0.07608677028941038, 0.01843031141638326, 0.09022779174698278, 0.062057851461502604, -0.03138110032663322, 0.06588245944406551, -0.10347937887164359, -0.05524454671197022, 0.3965165534844765, -0.008281632314603299, -0.30093890791520095, 0.18477189700560978, -0.11189761949488176, -0.13394282198248383, 0.15756932058586523, 0.09194279575529389, 0.11012238116027454, -0.210695452725467, 0.09971005667765172, -0.06770390125278097, 0.18177712807813898, 0.04485763745525709, 0.009525321035956344, 0.2030016873867657, 0.1495453389839102, 0.028326719500816975, 0.11273650481598452, 0.01942528432044081, -0.1458564398643107, -0.3177124738263396, -0.18739409529818937, -0.20676220148706284, 0.1132059806440315, -0.0891357156767462, -0.25486605939192647, 0.35044432131466097, 0.08655664460876814, 0.1644805189795219, 0.0573751306189642, 0.24211014944534653, 0.19554861796160156, 0.014027343728603462, 0.03511888306970016, 0.21831258737410492, 0.15549428099229073, 0.08223591167002152, -0.1573767249042598, 0.06783641181055618, 0.13372931201667645] |
1,802.05927 | Nuclear parton distribution functions | I review recent developments in the extraction of nuclear parton distribution
functions. First describing the global analysis framework, I then present a
comparison of the latest analyses in terms of included data and theoretical
details, pointing out a few general trends.
| hep-ph | i review recent developments in the extraction of nuclear parton distribution functions first describing the global analysis framework i then present a comparison of the latest analyses in terms of included data and theoretical details pointing out a few general trends | [['i', 'review', 'recent', 'developments', 'in', 'the', 'extraction', 'of', 'nuclear', 'parton', 'distribution', 'functions', 'first', 'describing', 'the', 'global', 'analysis', 'framework', 'i', 'then', 'present', 'a', 'comparison', 'of', 'the', 'latest', 'analyses', 'in', 'terms', 'of', 'included', 'data', 'and', 'theoretical', 'details', 'pointing', 'out', 'a', 'few', 'general', 'trends']] | [-0.055534339328182906, 0.013977326861605412, -0.10570000378960152, 0.08926623525870282, -0.04682369241718112, -0.055806470539409486, 0.029831683257503842, 0.32623327328119334, -0.20368473504374668, -0.26400321247283276, 0.10851244207630616, -0.3168371903096757, -0.10941261550547873, 0.13866524802657162, 0.010014464012517526, 0.05890959506945276, 0.1304667666327299, -0.07002708466905283, -0.14169680627017486, -0.2055045229768971, 0.3222849186418987, 0.10243846337515407, 0.27480715760824886, 0.1003841209884097, 0.030842074150469426, 0.04171090565831968, -0.23363446062657892, 0.0010454436627829948, -0.20639947531517686, 0.16752242242417684, 0.2354848083653828, 0.18875025265009665, 0.2548972049546314, -0.474454893389853, -0.18167337695443322, 0.008893137059469775, 0.14127058983303425, 0.1395228394284481, -0.09643225315049654, -0.2374374848086296, 0.00916165939430002, -0.23520722365143096, -0.13128895298918572, -0.13120023270205752, 0.023424380470248984, 0.08288525588296779, -0.19803342767763973, 0.052318866632981, 0.053590813174662064, 0.10779584768986353, -0.06776262305268063, -0.21288339988748747, 0.06160643470768885, 0.0898739308709415, 0.08315795660018921, 0.07332869202307449, 0.12664403534698776, -0.14308456315590842, -0.11271593009871317, 0.36583118501868916, -0.04602437193800763, -0.13234866630831144, 0.10357864381086718, -0.16427932434329173, -0.2637984106635175, 0.03168322182283169, 0.19335207147750913, 0.1024598430319712, -0.21604547606463112, 0.06164680047545627, -0.025675742262292925, 0.14861807899504173, -0.0510296948572121, 0.031259399050812625, 0.19727313048319844, 0.21685143853197011, -0.057670474983751774, 0.07058997552205877, -0.0907718308465896, -0.15254802061471998, -0.44755033503581837, -0.06787666805633684, -0.09441743854705881, 0.004466168744285114, -0.058607768244323004, -0.08574538767797782, 0.4951688371053556, 0.15687070232702466, 0.2217936885838465, -0.0051057781774278095, 0.32563109659567113, 0.0597782433771233, 0.006232575524780081, 0.030887258500315068, 0.2434707870479764, 0.15154614760654, 0.15023134060476612, -0.14529085285371032, 0.06309041602639254, 0.009680604289581136] |
1,802.05928 | Levitated electromechanics: all-electrical cooling of charged nano- and
micro-particles | We show how charged levitated nano- and micro-particles can be cooled by
interfacing them with an $RLC$ circuit. All-electrical levitation and cooling
is applicable to a wide range of particle sizes and materials, and will enable
state-of-the-art force sensing within an electrically networked system.
Exploring the cooling limits in the presence of realistic noise we find that
the quantum regime of particle motion can be reached in cryogenic environments
both for passive resistive cooling and for an active feedback scheme, paving
the way to levitated quantum electromechanics.
| quant-ph physics.atom-ph | we show how charged levitated nano and microparticles can be cooled by interfacing them with an rlc circuit allelectrical levitation and cooling is applicable to a wide range of particle sizes and materials and will enable stateoftheart force sensing within an electrically networked system exploring the cooling limits in the presence of realistic noise we find that the quantum regime of particle motion can be reached in cryogenic environments both for passive resistive cooling and for an active feedback scheme paving the way to levitated quantum electromechanics | [['we', 'show', 'how', 'charged', 'levitated', 'nano', 'and', 'microparticles', 'can', 'be', 'cooled', 'by', 'interfacing', 'them', 'with', 'an', 'rlc', 'circuit', 'allelectrical', 'levitation', 'and', 'cooling', 'is', 'applicable', 'to', 'a', 'wide', 'range', 'of', 'particle', 'sizes', 'and', 'materials', 'and', 'will', 'enable', 'stateoftheart', 'force', 'sensing', 'within', 'an', 'electrically', 'networked', 'system', 'exploring', 'the', 'cooling', 'limits', 'in', 'the', 'presence', 'of', 'realistic', 'noise', 'we', 'find', 'that', 'the', 'quantum', 'regime', 'of', 'particle', 'motion', 'can', 'be', 'reached', 'in', 'cryogenic', 'environments', 'both', 'for', 'passive', 'resistive', 'cooling', 'and', 'for', 'an', 'active', 'feedback', 'scheme', 'paving', 'the', 'way', 'to', 'levitated', 'quantum', 'electromechanics']] | [-0.10712692246172877, 0.2546579476929974, -0.012698328467728249, -0.06109385946952877, -0.024265815605591427, -0.2005974317194316, 0.022374910222173763, 0.41873178254256305, -0.254035294634001, -0.3634332026001708, 0.038620286436494566, -0.2207403195079887, -0.07583174650589454, 0.312000600206291, -0.049286658388573205, 0.07489215297324733, 0.01932338383798113, -0.06927536066685772, 0.01123164081143151, -0.16799535664419332, 0.19586737393722709, 0.08699558198655388, 0.2792763510162289, 0.03907920466735959, 0.14422970151678585, -0.04018534196208863, 0.09980508056736884, 0.04597666068671635, -0.10177137591280966, 0.05134014695636586, 0.273861545887401, 0.020561570119669383, 0.23748472668016438, -0.5030893122713114, -0.22449918442550276, 0.08692006507203326, 0.1840409072137427, 0.18535556231529035, -0.14717419162371206, -0.29464601741397173, 0.038980095256548164, -0.19667940845327644, -0.12977736451309815, -0.11679169251958187, 0.003436428882802526, 0.03240049351502264, -0.2901990697933254, -0.0062875158257846685, 0.055589897889943646, 0.021980282711400383, -0.06238359022864151, -0.02305185110120895, 0.08855800364894428, 0.132125749258089, -0.12304795911433924, -0.03231894934212725, 0.35216213412711334, -0.15868526595195048, -0.1119523254061257, 0.38673562815562745, -0.05581356987260796, -0.14459326278803677, 0.23951972926827683, -0.11491139971212237, -0.013430110596377274, 0.13307591631537538, 0.20107645789782205, 0.11047256597713835, -0.19221191670231777, 0.030336683580582297, 0.018756378399229598, 0.19542986369723903, 0.01862636332710584, 0.06145676870391458, 0.27874558276079336, 0.25583510919763097, 0.05839231591029414, 0.17710306455552494, -0.09620549447129309, -0.08513940389043298, -0.23772479137726898, -0.19879838822131185, -0.14039414153359403, 0.05565333198863028, -0.06027170728230394, -0.11307007446082244, 0.30284907609830986, 0.20403471875978613, 0.09978034278784675, -0.00785546159724994, 0.3443590792688145, 0.07372804187992908, 0.06691825486205775, 0.0679731180559544, 0.3242264582786238, 0.16125867496801263, 0.11735296506306221, -0.30337870316633464, -0.0185029785330782, -0.048621712006285955] |
1,802.05929 | Measuring Human-perceived Similarity in Heterogeneous Collections | We present a technique for estimating the similarity between objects such as
movies or foods whose proper representation depends on human perception. Our
technique combines a modest number of human similarity assessments to infer a
pairwise similarity function between the objects. This similarity function
captures some human notion of similarity which may be difficult or impossible
to automatically extract, such as which movie from a collection would be a
better substitute when the desired one is unavailable. In contrast to prior
techniques, our method does not assume that all similarity questions on the
collection can be answered or that all users perceive similarity in the same
way. When combined with a user model, we find how each assessor's tastes vary,
affecting their perception of similarity.
| cs.AI cs.IR | we present a technique for estimating the similarity between objects such as movies or foods whose proper representation depends on human perception our technique combines a modest number of human similarity assessments to infer a pairwise similarity function between the objects this similarity function captures some human notion of similarity which may be difficult or impossible to automatically extract such as which movie from a collection would be a better substitute when the desired one is unavailable in contrast to prior techniques our method does not assume that all similarity questions on the collection can be answered or that all users perceive similarity in the same way when combined with a user model we find how each assessors tastes vary affecting their perception of similarity | [['we', 'present', 'a', 'technique', 'for', 'estimating', 'the', 'similarity', 'between', 'objects', 'such', 'as', 'movies', 'or', 'foods', 'whose', 'proper', 'representation', 'depends', 'on', 'human', 'perception', 'our', 'technique', 'combines', 'a', 'modest', 'number', 'of', 'human', 'similarity', 'assessments', 'to', 'infer', 'a', 'pairwise', 'similarity', 'function', 'between', 'the', 'objects', 'this', 'similarity', 'function', 'captures', 'some', 'human', 'notion', 'of', 'similarity', 'which', 'may', 'be', 'difficult', 'or', 'impossible', 'to', 'automatically', 'extract', 'such', 'as', 'which', 'movie', 'from', 'a', 'collection', 'would', 'be', 'a', 'better', 'substitute', 'when', 'the', 'desired', 'one', 'is', 'unavailable', 'in', 'contrast', 'to', 'prior', 'techniques', 'our', 'method', 'does', 'not', 'assume', 'that', 'all', 'similarity', 'questions', 'on', 'the', 'collection', 'can', 'be', 'answered', 'or', 'that', 'all', 'users', 'perceive', 'similarity', 'in', 'the', 'same', 'way', 'when', 'combined', 'with', 'a', 'user', 'model', 'we', 'find', 'how', 'each', 'assessors', 'tastes', 'vary', 'affecting', 'their', 'perception', 'of', 'similarity']] | [-0.023206418373622, 0.05816108112037182, -0.12152115505561233, 0.11144527982920409, -0.16929598027467727, -0.1577241053879261, 0.08522115693520754, 0.4427790943831205, -0.2894790838286281, -0.3798052727580071, 0.007015575950965285, -0.3181535144150257, -0.20718294265307485, 0.16810427094250918, -0.1392521050646901, 0.017914939038455487, 0.08054236094281077, 0.13125145062804222, -0.0827459323387593, -0.24336224699765444, 0.31569881150126455, -0.00023395337909460067, 0.28477619848400354, 0.018793677534908057, 0.09757927724719048, 0.011778079134761355, -0.06967348532751202, 0.0511146370023489, -0.053470467661158184, 0.1771857281178236, 0.27404638460278513, 0.2495569344907999, 0.3316374835968018, -0.37176310529373585, -0.20897888173162937, 0.13398221655003725, 0.14362371723353862, 0.07071606994979084, 0.0003231578413397074, -0.31045883084088566, 0.10105478242225945, -0.1675955943353474, -0.03485223715007305, -0.101127056973055, -0.010257844775915147, 0.021590608931146563, -0.27432722034677864, 0.028886025819927455, 0.032402390513569114, 0.06598550501279533, -0.04371288473531604, -0.04885651107691229, 0.010746745893731714, 0.2646876187440939, 0.05677813664916903, 0.04445997551456094, 0.17231754621025175, -0.15039387011155486, -0.10218885038793087, 0.4282009953707457, -0.03558613543212414, -0.2768309033215046, 0.24186722555104642, -0.09578525004535914, -0.11847802838310599, 0.07349605104140937, 0.17710913178604096, 0.12477451296988874, -0.15444586105388589, -0.033476694837212564, -0.08121801833435893, 0.244318249091506, 0.07358505995571614, 0.02025782198086381, 0.22451337702572347, 0.13670303911343218, 0.051826680924743414, 0.05391206675488502, -0.030901956539601087, -0.014045795287936926, -0.23282999546825886, -0.1547075520660728, -0.19717352899536492, 0.029028796279919333, -0.11570167398825287, -0.19411646028235555, 0.3581292140353471, 0.21265995264891535, 0.2550939830178395, 0.05791422504372895, 0.30780944088846446, 0.03593289478868246, 0.09987706341594457, 0.04014886226505041, 0.1601875906076748, -0.020982083711773156, 0.07482140161585994, -0.17381108127254993, 0.18172350213862956, 0.05796894075721502] |
1,802.0593 | Learning beyond datasets: Knowledge Graph Augmented Neural Networks for
Natural language Processing | Machine Learning has been the quintessential solution for many AI problems,
but learning is still heavily dependent on the specific training data. Some
learning models can be incorporated with a prior knowledge in the Bayesian set
up, but these learning models do not have the ability to access any organised
world knowledge on demand. In this work, we propose to enhance learning models
with world knowledge in the form of Knowledge Graph (KG) fact triples for
Natural Language Processing (NLP) tasks. Our aim is to develop a deep learning
model that can extract relevant prior support facts from knowledge graphs
depending on the task using attention mechanism. We introduce a
convolution-based model for learning representations of knowledge graph entity
and relation clusters in order to reduce the attention space. We show that the
proposed method is highly scalable to the amount of prior information that has
to be processed and can be applied to any generic NLP task. Using this method
we show significant improvement in performance for text classification with
News20, DBPedia datasets and natural language inference with Stanford Natural
Language Inference (SNLI) dataset. We also demonstrate that a deep learning
model can be trained well with substantially less amount of labeled training
data, when it has access to organised world knowledge in the form of knowledge
graph.
| cs.CL | machine learning has been the quintessential solution for many ai problems but learning is still heavily dependent on the specific training data some learning models can be incorporated with a prior knowledge in the bayesian set up but these learning models do not have the ability to access any organised world knowledge on demand in this work we propose to enhance learning models with world knowledge in the form of knowledge graph kg fact triples for natural language processing nlp tasks our aim is to develop a deep learning model that can extract relevant prior support facts from knowledge graphs depending on the task using attention mechanism we introduce a convolutionbased model for learning representations of knowledge graph entity and relation clusters in order to reduce the attention space we show that the proposed method is highly scalable to the amount of prior information that has to be processed and can be applied to any generic nlp task using this method we show significant improvement in performance for text classification with news20 dbpedia datasets and natural language inference with stanford natural language inference snli dataset we also demonstrate that a deep learning model can be trained well with substantially less amount of labeled training data when it has access to organised world knowledge in the form of knowledge graph | [['machine', 'learning', 'has', 'been', 'the', 'quintessential', 'solution', 'for', 'many', 'ai', 'problems', 'but', 'learning', 'is', 'still', 'heavily', 'dependent', 'on', 'the', 'specific', 'training', 'data', 'some', 'learning', 'models', 'can', 'be', 'incorporated', 'with', 'a', 'prior', 'knowledge', 'in', 'the', 'bayesian', 'set', 'up', 'but', 'these', 'learning', 'models', 'do', 'not', 'have', 'the', 'ability', 'to', 'access', 'any', 'organised', 'world', 'knowledge', 'on', 'demand', 'in', 'this', 'work', 'we', 'propose', 'to', 'enhance', 'learning', 'models', 'with', 'world', 'knowledge', 'in', 'the', 'form', 'of', 'knowledge', 'graph', 'kg', 'fact', 'triples', 'for', 'natural', 'language', 'processing', 'nlp', 'tasks', 'our', 'aim', 'is', 'to', 'develop', 'a', 'deep', 'learning', 'model', 'that', 'can', 'extract', 'relevant', 'prior', 'support', 'facts', 'from', 'knowledge', 'graphs', 'depending', 'on', 'the', 'task', 'using', 'attention', 'mechanism', 'we', 'introduce', 'a', 'convolutionbased', 'model', 'for', 'learning', 'representations', 'of', 'knowledge', 'graph', 'entity', 'and', 'relation', 'clusters', 'in', 'order', 'to', 'reduce', 'the', 'attention', 'space', 'we', 'show', 'that', 'the', 'proposed', 'method', 'is', 'highly', 'scalable', 'to', 'the', 'amount', 'of', 'prior', 'information', 'that', 'has', 'to', 'be', 'processed', 'and', 'can', 'be', 'applied', 'to', 'any', 'generic', 'nlp', 'task', 'using', 'this', 'method', 'we', 'show', 'significant', 'improvement', 'in', 'performance', 'for', 'text', 'classification', 'with', 'news20', 'dbpedia', 'datasets', 'and', 'natural', 'language', 'inference', 'with', 'stanford', 'natural', 'language', 'inference', 'snli', 'dataset', 'we', 'also', 'demonstrate', 'that', 'a', 'deep', 'learning', 'model', 'can', 'be', 'trained', 'well', 'with', 'substantially', 'less', 'amount', 'of', 'labeled', 'training', 'data', 'when', 'it', 'has', 'access', 'to', 'organised', 'world', 'knowledge', 'in', 'the', 'form', 'of', 'knowledge', 'graph']] | [-0.004403308605919826, -0.003706951451287966, -0.0758041832792747, 0.061517813475270966, -0.21256944168567418, -0.14793474862105363, 0.03355842270807589, 0.45321789536557106, -0.2780506448569329, -0.39696214985969946, 0.07491640435833671, -0.26249601024938707, -0.16496062887057483, 0.20058472797042823, -0.14148356624747113, 0.05477804175182564, 0.16042427561983688, 0.11855801992696714, -0.03058384010593777, -0.2956648691583661, 0.3228857896618171, 0.010660154602254345, 0.34242071476701186, 0.03351333029313038, 0.10543018778824337, -0.05428255738299255, -0.016114942399363914, -0.03546899476699365, -0.06614747724549518, 0.1972469551819398, 0.3701793611067825, 0.2692270636012072, 0.32566448823191635, -0.4050666992361211, -0.2612353544140056, 0.14543363833204592, 0.14617190627831983, 0.1370027566549382, -0.03456763096459924, -0.3207265600502559, 0.09205203643015514, -0.17935954368743434, 0.05090197696792787, -0.19366665871295075, -0.00855195339658557, -0.05394601293299432, -0.2834767483320453, -0.014282171421107033, 0.126886430303311, 0.07104463371784175, -0.037850751915785005, -0.10091308841150101, 0.03719655729162605, 0.1474632908430399, 0.027703430994252192, 0.0778364522077492, 0.1280177364819024, -0.17752332194840117, -0.16088780508585035, 0.3671998848806914, -0.059500208557753495, -0.23668739395683894, 0.18341286858484218, -0.057562101163505894, -0.20723673423377958, 0.07616520076607393, 0.2558138864518879, 0.09648994029208287, -0.18268831800511287, 0.07720843420526625, -0.04958118364793253, 0.21850460082596618, 0.039377782232825516, -0.037725622030017586, 0.1947049677332642, 0.26754498417429695, -0.004982924733372601, 0.10666093533671542, -0.05948755465826385, -0.08303514937391786, -0.18840610411137207, -0.0976931861214782, -0.2202774156894977, 0.00512089934759533, -0.09924728053997507, -0.13597734515197984, 0.3556886391637668, 0.24799051065085356, 0.1933010402730917, 0.08458789733565969, 0.3072108053538489, 0.028231306511924185, 0.15830407433688096, 0.13297572195663895, 0.1511134822013284, 0.02523523045503896, 0.14488443047803354, -0.11987694964072237, 0.11505183791975622, -0.007610085573404619] |
1,802.05931 | A driven-dissipative quantum Monte Carlo method for open quantum systems | We develop a real-time Full Configuration Interaction Quantum Monte Carlo
approach for the modeling of driven-dissipative open quantum systems. The
method enables stochastic sampling of the Liouville-von-Neumann time evolution
of the density matrix, thanks to a massively parallel algorithm, thus providing
estimates of observables on the non-equilibrium steady state. We present the
underlying theory, and introduce initiator technique and importance sampling to
reduce the statistical error. Finally, we demonstrate the efficiency of our
approach by applying it to the driven- dissipative two-dimensional XYZ spin
model on lattice.
| quant-ph | we develop a realtime full configuration interaction quantum monte carlo approach for the modeling of drivendissipative open quantum systems the method enables stochastic sampling of the liouvillevonneumann time evolution of the density matrix thanks to a massively parallel algorithm thus providing estimates of observables on the nonequilibrium steady state we present the underlying theory and introduce initiator technique and importance sampling to reduce the statistical error finally we demonstrate the efficiency of our approach by applying it to the driven dissipative twodimensional xyz spin model on lattice | [['we', 'develop', 'a', 'realtime', 'full', 'configuration', 'interaction', 'quantum', 'monte', 'carlo', 'approach', 'for', 'the', 'modeling', 'of', 'drivendissipative', 'open', 'quantum', 'systems', 'the', 'method', 'enables', 'stochastic', 'sampling', 'of', 'the', 'liouvillevonneumann', 'time', 'evolution', 'of', 'the', 'density', 'matrix', 'thanks', 'to', 'a', 'massively', 'parallel', 'algorithm', 'thus', 'providing', 'estimates', 'of', 'observables', 'on', 'the', 'nonequilibrium', 'steady', 'state', 'we', 'present', 'the', 'underlying', 'theory', 'and', 'introduce', 'initiator', 'technique', 'and', 'importance', 'sampling', 'to', 'reduce', 'the', 'statistical', 'error', 'finally', 'we', 'demonstrate', 'the', 'efficiency', 'of', 'our', 'approach', 'by', 'applying', 'it', 'to', 'the', 'driven', 'dissipative', 'twodimensional', 'xyz', 'spin', 'model', 'on', 'lattice']] | [-0.10366293426798007, 0.10312714792658077, -0.1182261849861852, 0.05585680631270935, -0.007192591356849948, -0.11201919228661546, 0.09288342578504451, 0.38815214079913013, -0.2850001934363485, -0.3020645071059292, 0.06842742968069086, -0.20493635656528694, -0.14347007112620874, 0.21450681845538405, 0.02002608956671645, 0.13131558173877556, 0.11259868964119706, -0.04476174806396282, -0.07999553939674137, -0.2348975249211477, 0.2755079046487375, 0.08580903596580462, 0.30029579246589955, 0.019875524246112206, 0.14720582307402996, 0.06727999782861145, -0.0300418236401192, 0.00827280520244913, -0.17195245534788037, 0.1586346784525356, 0.1916003525588759, 0.11605950815299916, 0.29486105539077934, -0.4334621716962131, -0.2111845937189321, 0.06102704102996477, 0.11905697604531672, 0.2023314959234233, -0.05684195232826696, -0.3008416066552664, 0.038719057928510874, -0.20535620441389552, -0.1302727815711351, -0.14885473519910214, -0.08009197012802889, 0.008022982487725743, -0.2536951785441488, 0.09587086501076471, 0.04599180390116174, 0.019366602467502967, -0.009727462852741916, -0.05839834933786458, 0.031417400264830954, 0.09974378098322209, -0.0503949481631131, 0.02790428730009427, 0.13565463147689263, -0.10054173177584659, -0.17937686876664588, 0.35117948320585973, -0.042438678371010695, -0.22125752906986448, 0.17900324685953903, -0.09360929953254526, -0.12811862605862145, 0.11333070862713422, 0.20308246834441845, 0.11041904219187969, -0.1521351732703489, 0.12223668768054394, 0.025775709724172865, 0.155580950244384, -0.08840608448439906, 0.011316188481138197, 0.1757502540469516, 0.236924912444814, 0.07575872446258747, 0.18016169590572284, -0.11562818981338899, -0.22086815328911208, -0.2618421355132447, -0.17084048497544732, -0.22086309139118637, 0.07508839563423292, -0.097625404373989, -0.19417352971166027, 0.4072690719392064, 0.2662220123077764, 0.12560974442681602, 0.05089574347001089, 0.31759132557483605, 0.13385139547727007, -0.006866028521556494, 0.07333359443636742, 0.1710607726451789, 0.18093070328549676, 0.09526120830154003, -0.3193186452141205, 0.037767166493807076, 0.09763918935353759] |
1,802.05932 | Local and global estimates for hyperbolic equations in Besov-Lipschitz
and Triebel-Lizorkin spaces | In this paper we establish optimal local and global Besov-Lipschitz and
Triebel-Lizorkin estimates for the solutions to linear hyperbolic partial
differential equations. These estimates are based on local and global estimates
for Fourier integral operators that span all possible scales (and in particular
both Banach and quasi-Banach scales) of Besov-Lipschitz spaces
$B^s_{p,q}(\R^n)$, and certain Banach and quasi-Banach scales of
Triebel-Lizorkin spaces $F^s_{p,q}(\R^n)$
| math.AP | in this paper we establish optimal local and global besovlipschitz and triebellizorkin estimates for the solutions to linear hyperbolic partial differential equations these estimates are based on local and global estimates for fourier integral operators that span all possible scales and in particular both banach and quasibanach scales of besovlipschitz spaces bs_pqrn and certain banach and quasibanach scales of triebellizorkin spaces fs_pqrn | [['in', 'this', 'paper', 'we', 'establish', 'optimal', 'local', 'and', 'global', 'besovlipschitz', 'and', 'triebellizorkin', 'estimates', 'for', 'the', 'solutions', 'to', 'linear', 'hyperbolic', 'partial', 'differential', 'equations', 'these', 'estimates', 'are', 'based', 'on', 'local', 'and', 'global', 'estimates', 'for', 'fourier', 'integral', 'operators', 'that', 'span', 'all', 'possible', 'scales', 'and', 'in', 'particular', 'both', 'banach', 'and', 'quasibanach', 'scales', 'of', 'besovlipschitz', 'spaces', 'bs_pqrn', 'and', 'certain', 'banach', 'and', 'quasibanach', 'scales', 'of', 'triebellizorkin', 'spaces', 'fs_pqrn']] | [-0.1173282531555742, 0.08886577441977958, -0.0647127281408757, 0.18864251728130815, -0.10224904725716139, -0.04745608699352791, -0.029700635076733307, 0.37690041059007245, -0.36518474168454607, -0.16275058556348085, 0.2008898574509658, -0.24954288170314007, -0.1212347524240613, 0.255299574493741, -0.09532780932883421, 0.13651026600661378, 0.002577171257386605, -0.03889588204522928, -0.1850541785485499, -0.28817413492749133, 0.4695541886612773, -0.05502988647979994, 0.1909331638365984, 0.006354617234319448, 0.15796066391437005, 0.008044427501348157, -0.11162954188572864, 0.0024843493476510046, -0.2509225995169497, 0.1673060252641638, 0.3150826081012686, 0.03752672733583798, 0.314343193526535, -0.43684548790721844, -0.1553855237395813, 0.16934072161093355, 0.1298201952362433, -0.0451372463721782, 0.0018499944339661549, -0.3124948365303377, 0.05017577909554045, -0.052012729939694205, -0.07884708931669593, -0.1776078236910204, 0.04233271994938453, 0.14183950664786002, -0.39100678826992713, 0.12769710015660773, 0.10237634801305831, 0.06556545664013053, -0.2387899659263591, -0.09398781476387133, -0.036105370808703206, 0.08850155593051265, -0.03209426645577575, 0.010523493183912554, 0.05008511451693873, -0.032234071703472485, -0.09306071195751428, 0.2915497018645207, -0.0709568534977734, -0.2674719911146288, 0.16219570078343773, -0.2417625064961612, -0.1564147152976754, 0.037466813313464326, 0.19384959432451676, 0.18914971618602675, -0.08664271999150515, 0.18714182082815872, -0.07652116043803593, 0.11446897609469792, 0.06492151195028176, 0.18217476330076654, -0.0023252044493953386, 0.10048317121885096, 0.24130912288092077, 0.02502648439258337, -0.006868540571304038, -0.11582770227978471, -0.36969730257987976, -0.1545357672808071, -0.10984251196690215, 0.04328086298579971, -0.20509152248341705, -0.17207777832324306, 0.3512052380790313, 0.10654562536316613, 0.17158609023317695, 0.1657923114175598, 0.1560692586004734, 0.09540318277528664, 0.006820962469403943, 0.06810754568626483, 0.18510857929165164, 0.17432389948517085, 0.11825777015183121, -0.11745696865255013, -0.05291813230918099, 0.23610191096862157] |
1,802.05933 | Mode truncations and scattering in strong fields | Truncating quantum field theories to a dominant mode offers a
non-perturbative approach to their solution. We consider here the interaction
of charged scalar matter with a single mode of the electromagnetic field. The
implied breaking of explicit Lorentz invariance prompts us to compare
instant-form quantisation and front-form, with the latter yielding significant
simplifications when light-front zero modes are included. Using these field
theory results we reassess the validity of existing first-quantised approaches
to depletion effects in strong laser fields, and propose an alternative
interpretation based on the dressing approach to QED and its infra-red
structure.
| hep-th hep-ph | truncating quantum field theories to a dominant mode offers a nonperturbative approach to their solution we consider here the interaction of charged scalar matter with a single mode of the electromagnetic field the implied breaking of explicit lorentz invariance prompts us to compare instantform quantisation and frontform with the latter yielding significant simplifications when lightfront zero modes are included using these field theory results we reassess the validity of existing firstquantised approaches to depletion effects in strong laser fields and propose an alternative interpretation based on the dressing approach to qed and its infrared structure | [['truncating', 'quantum', 'field', 'theories', 'to', 'a', 'dominant', 'mode', 'offers', 'a', 'nonperturbative', 'approach', 'to', 'their', 'solution', 'we', 'consider', 'here', 'the', 'interaction', 'of', 'charged', 'scalar', 'matter', 'with', 'a', 'single', 'mode', 'of', 'the', 'electromagnetic', 'field', 'the', 'implied', 'breaking', 'of', 'explicit', 'lorentz', 'invariance', 'prompts', 'us', 'to', 'compare', 'instantform', 'quantisation', 'and', 'frontform', 'with', 'the', 'latter', 'yielding', 'significant', 'simplifications', 'when', 'lightfront', 'zero', 'modes', 'are', 'included', 'using', 'these', 'field', 'theory', 'results', 'we', 'reassess', 'the', 'validity', 'of', 'existing', 'firstquantised', 'approaches', 'to', 'depletion', 'effects', 'in', 'strong', 'laser', 'fields', 'and', 'propose', 'an', 'alternative', 'interpretation', 'based', 'on', 'the', 'dressing', 'approach', 'to', 'qed', 'and', 'its', 'infrared', 'structure']] | [-0.13286228559690674, 0.12915237810796643, -0.1345514760891858, 0.07799230318908629, -0.12075411007788621, -0.12130488026887179, 0.03580056344722643, 0.3570392181726148, -0.1938122051473903, -0.26937771017271045, -0.0005518207142717744, -0.22718293989861482, -0.11476454773035488, 0.13821621010521132, -0.00018605174692837815, 0.03296301136418295, -0.007265380779771428, 0.01465829326035945, -0.08169210086037454, -0.18237565572275535, 0.3295432098675519, 0.07213027994270976, 0.29202456137312477, 0.06867681964251555, 0.09638823506079222, 0.023600545396881275, -0.03568713274098149, 0.002129514525203328, -0.1202696989829603, 0.13444051334242288, 0.16676209145286855, 0.07152608663676993, 0.23645666391760306, -0.45887780095401565, -0.20303037999393908, 0.04219997971269645, 0.1407192253017504, 0.18919447072732606, -0.05607790389759956, -0.3071907804494626, 0.020779398527290476, -0.18133016792371084, -0.18086767500131637, -0.1365522414985064, -0.025843948092752773, -0.06836587044067288, -0.28416846786981054, 0.07518471033606482, 0.003519225979566966, 0.03271277099357624, -0.07530574405100196, -0.0812912861865602, 0.035872133943791455, 0.06691614557455881, 0.1377896277233958, 0.060247125138381596, 0.14570739420228881, -0.19135552066819447, -0.1501218849462212, 0.4036278021864985, -0.1130579319880589, -0.20066028586343715, 0.19085623975598107, -0.14247237770377022, -0.09677852174071105, 0.12515047084246028, 0.12405675191089119, 0.1102740516935132, -0.12718712215596736, 0.13791457441892768, 0.01814351984495787, 0.1422750058730966, 0.06632532725894921, 0.09823928776344186, 0.22363060341265642, 0.11260940369806792, -0.028067073814178767, 0.11835258941068069, -0.045752224470733814, -0.13457272719395788, -0.3541861140414288, -0.1261694950266055, -0.09964048380314029, 0.08476833854801953, -0.07717870520979264, -0.16445888668102654, 0.3811859487653955, 0.1946724359093136, 0.13299482331464166, 0.02613212284723934, 0.31546542286186624, 0.15885854282073283, 0.09540425112186074, 0.013866852537581796, 0.3030233177258388, 0.18897520119177275, 0.061391976323763, -0.2847190797917153, -0.09463656896872348, 0.07791439285992008] |
1,802.05934 | Instance-based Inductive Deep Transfer Learning by Cross-Dataset
Querying with Locality Sensitive Hashing | Supervised learning models are typically trained on a single dataset and the
performance of these models rely heavily on the size of the dataset, i.e.,
amount of data available with the ground truth. Learning algorithms try to
generalize solely based on the data that is presented with during the training.
In this work, we propose an inductive transfer learning method that can augment
learning models by infusing similar instances from different learning tasks in
the Natural Language Processing (NLP) domain. We propose to use instance
representations from a source dataset, \textit{without inheriting anything}
from the source learning model. Representations of the instances of
\textit{source} \& \textit{target} datasets are learned, retrieval of relevant
source instances is performed using soft-attention mechanism and
\textit{locality sensitive hashing}, and then, augmented into the model during
training on the target dataset. Our approach simultaneously exploits the local
\textit{instance level information} as well as the macro statistical viewpoint
of the dataset. Using this approach we have shown significant improvements for
three major news classification datasets over the baseline. Experimental
evaluations also show that the proposed approach reduces dependency on labeled
data by a significant margin for comparable performance. With our proposed
cross dataset learning procedure we show that one can achieve
competitive/better performance than learning from a single dataset.
| cs.CL | supervised learning models are typically trained on a single dataset and the performance of these models rely heavily on the size of the dataset ie amount of data available with the ground truth learning algorithms try to generalize solely based on the data that is presented with during the training in this work we propose an inductive transfer learning method that can augment learning models by infusing similar instances from different learning tasks in the natural language processing nlp domain we propose to use instance representations from a source dataset textitwithout inheriting anything from the source learning model representations of the instances of textitsource textittarget datasets are learned retrieval of relevant source instances is performed using softattention mechanism and textitlocality sensitive hashing and then augmented into the model during training on the target dataset our approach simultaneously exploits the local textitinstance level information as well as the macro statistical viewpoint of the dataset using this approach we have shown significant improvements for three major news classification datasets over the baseline experimental evaluations also show that the proposed approach reduces dependency on labeled data by a significant margin for comparable performance with our proposed cross dataset learning procedure we show that one can achieve competitivebetter performance than learning from a single dataset | [['supervised', 'learning', 'models', 'are', 'typically', 'trained', 'on', 'a', 'single', 'dataset', 'and', 'the', 'performance', 'of', 'these', 'models', 'rely', 'heavily', 'on', 'the', 'size', 'of', 'the', 'dataset', 'ie', 'amount', 'of', 'data', 'available', 'with', 'the', 'ground', 'truth', 'learning', 'algorithms', 'try', 'to', 'generalize', 'solely', 'based', 'on', 'the', 'data', 'that', 'is', 'presented', 'with', 'during', 'the', 'training', 'in', 'this', 'work', 'we', 'propose', 'an', 'inductive', 'transfer', 'learning', 'method', 'that', 'can', 'augment', 'learning', 'models', 'by', 'infusing', 'similar', 'instances', 'from', 'different', 'learning', 'tasks', 'in', 'the', 'natural', 'language', 'processing', 'nlp', 'domain', 'we', 'propose', 'to', 'use', 'instance', 'representations', 'from', 'a', 'source', 'dataset', 'textitwithout', 'inheriting', 'anything', 'from', 'the', 'source', 'learning', 'model', 'representations', 'of', 'the', 'instances', 'of', 'textitsource', 'textittarget', 'datasets', 'are', 'learned', 'retrieval', 'of', 'relevant', 'source', 'instances', 'is', 'performed', 'using', 'softattention', 'mechanism', 'and', 'textitlocality', 'sensitive', 'hashing', 'and', 'then', 'augmented', 'into', 'the', 'model', 'during', 'training', 'on', 'the', 'target', 'dataset', 'our', 'approach', 'simultaneously', 'exploits', 'the', 'local', 'textitinstance', 'level', 'information', 'as', 'well', 'as', 'the', 'macro', 'statistical', 'viewpoint', 'of', 'the', 'dataset', 'using', 'this', 'approach', 'we', 'have', 'shown', 'significant', 'improvements', 'for', 'three', 'major', 'news', 'classification', 'datasets', 'over', 'the', 'baseline', 'experimental', 'evaluations', 'also', 'show', 'that', 'the', 'proposed', 'approach', 'reduces', 'dependency', 'on', 'labeled', 'data', 'by', 'a', 'significant', 'margin', 'for', 'comparable', 'performance', 'with', 'our', 'proposed', 'cross', 'dataset', 'learning', 'procedure', 'we', 'show', 'that', 'one', 'can', 'achieve', 'competitivebetter', 'performance', 'than', 'learning', 'from', 'a', 'single', 'dataset']] | [0.0096298798492241, -0.022051151565882228, -0.07797728698978272, 0.05996844410513474, -0.11377788457600847, -0.15797463131513304, 0.053263104067389995, 0.43229250735245073, -0.26111621587187983, -0.3869725724440426, 0.07247396393862661, -0.30133394295878063, -0.1321950947507363, 0.253916283646294, -0.13105990966421535, 0.06881849884386891, 0.19869158047591695, 0.09144996589804158, -0.06684638174752203, -0.3014517597979508, 0.34539938713867985, 0.032180967852652356, 0.38181895358810347, 0.021408429305525854, 0.14968145726407572, -0.03901681975716761, -0.02564603063197305, -0.018182356086072105, -0.027852467933581256, 0.18713380157826648, 0.29455362755566755, 0.2361954548597658, 0.2990520182356704, -0.3800947461971261, -0.21749742067969727, 0.0942843784555757, 0.12085378350009425, 0.12459822295610277, -0.04425217936827371, -0.3645193513914889, 0.06467462896342532, -0.16413724978282027, 0.08552290166755064, -0.16596931678269847, -0.055403925462787114, -0.020277773576358762, -0.2834139763452605, 0.043172366199472054, 0.0751741271955185, 0.06897305345109736, -0.06305901854536317, -0.1459999732032884, 0.025433434507039446, 0.14769375757000838, 0.04390079901405933, 0.055711090081016525, 0.13236231532153817, -0.17421796186513697, -0.16332991401745509, 0.360264536136618, -0.08663836244725714, -0.20226935984213085, 0.19926414489768482, -0.01285519191207221, -0.14592810930424513, 0.0927716685557523, 0.2633301545037494, 0.13183083676435323, -0.16057603765959635, 0.02110134448118445, -0.083977329535768, 0.22084278838156024, 0.020392220243453406, -0.035010239057625694, 0.15575710181320362, 0.2733449898570633, -0.01357983948233036, 0.15998392397103509, -0.15302441018054827, -0.06510282409726642, -0.23624738824303046, -0.05494416027347772, -0.22191143455655457, -0.03151630996748841, -0.11181903803753812, -0.10414523639771617, 0.3864043215200162, 0.26842778573224607, 0.21134241032548465, 0.11659284834212695, 0.3439090798716419, -0.0033961935909106755, 0.15133056906611622, 0.10845293853400598, 0.16749885523257455, -0.039114466242608614, 0.12439096770685865, -0.1768040762264998, 0.098070265991667, 0.02860859546518231] |
1,802.05935 | Decidability for Entailments of Symbolic Heaps with Arrays | This paper presents two decidability results on the validity checking problem
for entailments of symbolic heaps in separation logic with Presburger
arithmetic and arrays. The first result is for a system with arrays and
existential quantifiers. The correctness of the decision procedure is proved
under the condition that sizes of arrays in the succedent are not existentially
quantified. This condition is different from that proposed by Brotherston et
al. in 2017 and one of them does not imply the other. The main idea is a novel
translation from an entailment of symbolic heaps into a formula in Presburger
arithmetic. The second result is the decidability for a system with both arrays
and lists. The key idea is to extend the unroll collapse technique proposed by
Berdine et al. in 2005 to arrays and arithmetic as well as double-linked lists.
| cs.LO | this paper presents two decidability results on the validity checking problem for entailments of symbolic heaps in separation logic with presburger arithmetic and arrays the first result is for a system with arrays and existential quantifiers the correctness of the decision procedure is proved under the condition that sizes of arrays in the succedent are not existentially quantified this condition is different from that proposed by brotherston et al in 2017 and one of them does not imply the other the main idea is a novel translation from an entailment of symbolic heaps into a formula in presburger arithmetic the second result is the decidability for a system with both arrays and lists the key idea is to extend the unroll collapse technique proposed by berdine et al in 2005 to arrays and arithmetic as well as doublelinked lists | [['this', 'paper', 'presents', 'two', 'decidability', 'results', 'on', 'the', 'validity', 'checking', 'problem', 'for', 'entailments', 'of', 'symbolic', 'heaps', 'in', 'separation', 'logic', 'with', 'presburger', 'arithmetic', 'and', 'arrays', 'the', 'first', 'result', 'is', 'for', 'a', 'system', 'with', 'arrays', 'and', 'existential', 'quantifiers', 'the', 'correctness', 'of', 'the', 'decision', 'procedure', 'is', 'proved', 'under', 'the', 'condition', 'that', 'sizes', 'of', 'arrays', 'in', 'the', 'succedent', 'are', 'not', 'existentially', 'quantified', 'this', 'condition', 'is', 'different', 'from', 'that', 'proposed', 'by', 'brotherston', 'et', 'al', 'in', '2017', 'and', 'one', 'of', 'them', 'does', 'not', 'imply', 'the', 'other', 'the', 'main', 'idea', 'is', 'a', 'novel', 'translation', 'from', 'an', 'entailment', 'of', 'symbolic', 'heaps', 'into', 'a', 'formula', 'in', 'presburger', 'arithmetic', 'the', 'second', 'result', 'is', 'the', 'decidability', 'for', 'a', 'system', 'with', 'both', 'arrays', 'and', 'lists', 'the', 'key', 'idea', 'is', 'to', 'extend', 'the', 'unroll', 'collapse', 'technique', 'proposed', 'by', 'berdine', 'et', 'al', 'in', '2005', 'to', 'arrays', 'and', 'arithmetic', 'as', 'well', 'as', 'doublelinked', 'lists']] | [-0.10638811016890584, 0.053958171858065056, -0.06825834181348699, 0.062337594906516046, -0.09201447813488219, -0.12146624256316843, 0.06990195775785875, 0.3289980775933119, -0.27357952414161485, -0.33443470292495214, 0.11256175955835108, -0.22946600270444067, -0.14422776142432206, 0.231201716583978, -0.14593989149653824, 0.09488085121805509, 0.03233756622859695, -0.004526564976254451, -0.0020335842138223784, -0.27782724919202534, 0.3137445576637443, 0.028183251128370022, 0.24704816775814886, 0.05056405009194007, 0.06423806779059595, 0.03980293810920979, -0.00020659275089755008, 0.03109459898289482, -0.08556444326340157, 0.10795101096121379, 0.27612422202187387, 0.22135932665601696, 0.2799439067965832, -0.39768244799874397, -0.1250192977461046, 0.05956072483103776, 0.0883694718072218, 0.12372584781353024, 0.009261024905793854, -0.29448630675619497, 0.10072130163915563, -0.16810467525425812, -0.0628559049623816, -0.059256607065976095, 0.055164693287857204, 0.05557574521736714, -0.2586301255741737, -0.014607568710124579, 0.23344900538432883, 0.06858400378268266, -0.03051360571871687, -0.09705896912972727, 0.04683115405361236, 0.06475602732836336, -0.019923667888244803, -0.0038516125473045354, 0.0301877499382565, -0.047071908003367156, -0.1991764435922538, 0.35283668599752843, -0.018587641974749124, -0.18744644265793992, 0.16944372853723125, -0.08222056845661954, -0.18836249775199246, 0.0940016814629021, 0.09549074980052377, 0.1058414825980646, -0.12435238361628591, 0.0975513535368668, -0.11358782088222064, 0.24359290467818145, 0.1398360730196093, -0.0006397423314173584, 0.17784747910226925, 0.16883581360478117, 0.024885927239243967, 0.18732552460025306, -0.006109136264928131, -0.06875103060577901, -0.2891607128650598, -0.17315508057515178, -0.17551255981991257, -0.03763878816191235, -0.06407002526269197, -0.17187285993545168, 0.3374327625606911, 0.1566029520286922, 0.14302131061550175, 0.16346133338705893, 0.30778787415677117, 0.10337902290199924, 0.08304742250281076, 0.06125052652551212, 0.16662180917995537, 0.15708008608645826, 0.08947642490839706, -0.17785758702814128, 0.11705200608644256, 0.15095982538785893] |
1,802.05936 | Bayesian cross-validation of geostatistical models | The problem of validating or criticising models for georeferenced data is
challenging, since the conclusions can vary significantly depending on the
locations of the validation set. This work proposes the use of cross-validation
techniques to assess the goodness of fit of spatial models in different regions
of the spatial domain to account for uncertainty in the choice of the
validation sets. An obvious problem with the basic cross-validation scheme is
that it is based on selecting only a few out of sample locations to validate
the model, possibily making the conclusions sensitive to which partition of the
data into training and validation cases is utilized. A possible solution to
this issue would be to consider all possible configurations of data divided
into training and validation observations. From a Bayesian point of view, this
could be computationally demanding, as estimation of parameters usually
requires Monte Carlo Markov Chain methods. To deal with this problem, we
propose the use of estimated discrepancy functions considering all
configurations of data partition in a computationally efficient manner based on
sampling importance resampling. In particular, we consider uncertainty in the
locations by assigning a prior distribution to them. Furthermore, we propose a
stratified cross-validation scheme to take into account spatial heterogeneity,
reducing the total variance of estimated predictive discrepancy measures
considered for model assessment. We illustrate the advantages of our proposal
with simulated examples of homogeneous and inhomogeneous spatial processes to
investigate the effects of our proposal in scenarios of preferential sampling
designs. The methods are illustrated with an application to a rainfall dataset.
| stat.CO | the problem of validating or criticising models for georeferenced data is challenging since the conclusions can vary significantly depending on the locations of the validation set this work proposes the use of crossvalidation techniques to assess the goodness of fit of spatial models in different regions of the spatial domain to account for uncertainty in the choice of the validation sets an obvious problem with the basic crossvalidation scheme is that it is based on selecting only a few out of sample locations to validate the model possibily making the conclusions sensitive to which partition of the data into training and validation cases is utilized a possible solution to this issue would be to consider all possible configurations of data divided into training and validation observations from a bayesian point of view this could be computationally demanding as estimation of parameters usually requires monte carlo markov chain methods to deal with this problem we propose the use of estimated discrepancy functions considering all configurations of data partition in a computationally efficient manner based on sampling importance resampling in particular we consider uncertainty in the locations by assigning a prior distribution to them furthermore we propose a stratified crossvalidation scheme to take into account spatial heterogeneity reducing the total variance of estimated predictive discrepancy measures considered for model assessment we illustrate the advantages of our proposal with simulated examples of homogeneous and inhomogeneous spatial processes to investigate the effects of our proposal in scenarios of preferential sampling designs the methods are illustrated with an application to a rainfall dataset | [['the', 'problem', 'of', 'validating', 'or', 'criticising', 'models', 'for', 'georeferenced', 'data', 'is', 'challenging', 'since', 'the', 'conclusions', 'can', 'vary', 'significantly', 'depending', 'on', 'the', 'locations', 'of', 'the', 'validation', 'set', 'this', 'work', 'proposes', 'the', 'use', 'of', 'crossvalidation', 'techniques', 'to', 'assess', 'the', 'goodness', 'of', 'fit', 'of', 'spatial', 'models', 'in', 'different', 'regions', 'of', 'the', 'spatial', 'domain', 'to', 'account', 'for', 'uncertainty', 'in', 'the', 'choice', 'of', 'the', 'validation', 'sets', 'an', 'obvious', 'problem', 'with', 'the', 'basic', 'crossvalidation', 'scheme', 'is', 'that', 'it', 'is', 'based', 'on', 'selecting', 'only', 'a', 'few', 'out', 'of', 'sample', 'locations', 'to', 'validate', 'the', 'model', 'possibily', 'making', 'the', 'conclusions', 'sensitive', 'to', 'which', 'partition', 'of', 'the', 'data', 'into', 'training', 'and', 'validation', 'cases', 'is', 'utilized', 'a', 'possible', 'solution', 'to', 'this', 'issue', 'would', 'be', 'to', 'consider', 'all', 'possible', 'configurations', 'of', 'data', 'divided', 'into', 'training', 'and', 'validation', 'observations', 'from', 'a', 'bayesian', 'point', 'of', 'view', 'this', 'could', 'be', 'computationally', 'demanding', 'as', 'estimation', 'of', 'parameters', 'usually', 'requires', 'monte', 'carlo', 'markov', 'chain', 'methods', 'to', 'deal', 'with', 'this', 'problem', 'we', 'propose', 'the', 'use', 'of', 'estimated', 'discrepancy', 'functions', 'considering', 'all', 'configurations', 'of', 'data', 'partition', 'in', 'a', 'computationally', 'efficient', 'manner', 'based', 'on', 'sampling', 'importance', 'resampling', 'in', 'particular', 'we', 'consider', 'uncertainty', 'in', 'the', 'locations', 'by', 'assigning', 'a', 'prior', 'distribution', 'to', 'them', 'furthermore', 'we', 'propose', 'a', 'stratified', 'crossvalidation', 'scheme', 'to', 'take', 'into', 'account', 'spatial', 'heterogeneity', 'reducing', 'the', 'total', 'variance', 'of', 'estimated', 'predictive', 'discrepancy', 'measures', 'considered', 'for', 'model', 'assessment', 'we', 'illustrate', 'the', 'advantages', 'of', 'our', 'proposal', 'with', 'simulated', 'examples', 'of', 'homogeneous', 'and', 'inhomogeneous', 'spatial', 'processes', 'to', 'investigate', 'the', 'effects', 'of', 'our', 'proposal', 'in', 'scenarios', 'of', 'preferential', 'sampling', 'designs', 'the', 'methods', 'are', 'illustrated', 'with', 'an', 'application', 'to', 'a', 'rainfall', 'dataset']] | [-0.05248526609033462, 0.023267511248723026, -0.08345731178681229, 0.1002229937589583, -0.07165584212544468, -0.11762885843735738, 0.09512802475906346, 0.41272233162696165, -0.2423610917667952, -0.3458232779232713, 0.11374484840898942, -0.22916159305501324, -0.09175020989748946, 0.18315480291832584, -0.09300157882258758, 0.05799324883309612, 0.09906663347979604, -0.026163123687007284, -0.06220149252183109, -0.27101649334762506, 0.31411125672288065, 0.08456629343229786, 0.3250839944113075, 0.005316638667497408, 0.10886619578371937, -0.0004276512479481771, -0.08234488172693513, 0.021632060489410347, -0.12602241537114628, 0.1399853523678955, 0.2547668291732379, 0.17923285790661336, 0.31339008724966716, -0.4035795158777391, -0.2444359787907668, 0.12344400892521493, 0.13921814948111022, 0.10672198883977506, 0.0019075169869655266, -0.2803917190587047, 0.05997408400181421, -0.14788834109194865, -0.0906711810199876, -0.10010333651351443, -0.019892715444687264, 0.001347751682443732, -0.3396436217197672, 0.06099009384805438, 0.010143159913953191, 0.04901932690711331, -0.04038648481314727, -0.13339060844940154, 0.0029681811159722104, 0.12685249110434724, 0.07911309429179054, -0.010237942866677808, 0.10804636831496402, -0.10077014971748283, -0.12123767038908347, 0.38219988716823994, -0.0007977742934599519, -0.2550330849819232, 0.15895474262539183, -0.08017475738789337, -0.14799632063467605, 0.1028211506385024, 0.2080427516665122, 0.12058207117266549, -0.17288463883816677, 0.018186263428945023, -0.01044663703660192, 0.16590911904478522, 0.0030371132658707886, -0.03188675005248813, 0.18049825434193967, 0.23101591113539657, 0.03976915007531138, 0.1731800965074984, -0.14595655075018565, -0.11600434202421095, -0.2819771982761923, -0.11564991836501069, -0.1972072995746104, -0.008955270449031693, -0.11336393533582491, -0.1643341507170667, 0.38444185881548204, 0.2507303084751993, 0.22005330329010075, 0.05332801922435634, 0.32584873128812325, 0.07893152166048088, 0.061685823626065436, 0.028484801038045637, 0.182230903459767, 0.06741263145714449, 0.024424102590527644, -0.17010451662205267, 0.09574516244546705, 0.010875607573593309] |
1,802.05937 | The Inverse Problem of Magnetorelaxometry Imaging | The aim of this paper is to provide a solid mathematical discussion of the
inverse problem in Magnetorelaxometry Imaging (MRXI), a currently developed
technique for quantitative biomedical imaging using magnetic nanoparticles. We
provide a detailed discussion of the mathematical modeling of the forward
problems including possible ways to activate and measure, leading to a severely
ill-posed linear inverse problem. Moreover, we formulate an idealized version
of the inverse problem for infinitesimal small activation coils, which allows
for a more detailed analysis of uniqueness issues.
We propose a variational regularization approach to compute stable
approximations of the solution and discuss its discretization and numerical
solution. Results on synthetic are presented and improvements to methods used
previously in practice are demonstrated. Finally we give an outlook to further
questions and in particular experimental design.
| math.NA cs.NA math.AP | the aim of this paper is to provide a solid mathematical discussion of the inverse problem in magnetorelaxometry imaging mrxi a currently developed technique for quantitative biomedical imaging using magnetic nanoparticles we provide a detailed discussion of the mathematical modeling of the forward problems including possible ways to activate and measure leading to a severely illposed linear inverse problem moreover we formulate an idealized version of the inverse problem for infinitesimal small activation coils which allows for a more detailed analysis of uniqueness issues we propose a variational regularization approach to compute stable approximations of the solution and discuss its discretization and numerical solution results on synthetic are presented and improvements to methods used previously in practice are demonstrated finally we give an outlook to further questions and in particular experimental design | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'solid', 'mathematical', 'discussion', 'of', 'the', 'inverse', 'problem', 'in', 'magnetorelaxometry', 'imaging', 'mrxi', 'a', 'currently', 'developed', 'technique', 'for', 'quantitative', 'biomedical', 'imaging', 'using', 'magnetic', 'nanoparticles', 'we', 'provide', 'a', 'detailed', 'discussion', 'of', 'the', 'mathematical', 'modeling', 'of', 'the', 'forward', 'problems', 'including', 'possible', 'ways', 'to', 'activate', 'and', 'measure', 'leading', 'to', 'a', 'severely', 'illposed', 'linear', 'inverse', 'problem', 'moreover', 'we', 'formulate', 'an', 'idealized', 'version', 'of', 'the', 'inverse', 'problem', 'for', 'infinitesimal', 'small', 'activation', 'coils', 'which', 'allows', 'for', 'a', 'more', 'detailed', 'analysis', 'of', 'uniqueness', 'issues', 'we', 'propose', 'a', 'variational', 'regularization', 'approach', 'to', 'compute', 'stable', 'approximations', 'of', 'the', 'solution', 'and', 'discuss', 'its', 'discretization', 'and', 'numerical', 'solution', 'results', 'on', 'synthetic', 'are', 'presented', 'and', 'improvements', 'to', 'methods', 'used', 'previously', 'in', 'practice', 'are', 'demonstrated', 'finally', 'we', 'give', 'an', 'outlook', 'to', 'further', 'questions', 'and', 'in', 'particular', 'experimental', 'design']] | [-0.04643465174123901, -0.0011669114631518921, -0.07510171494027244, 0.09985233132037839, -0.12477290556403517, -0.12145639708237226, 0.04117146607413746, 0.3928753710031964, -0.2837473769309639, -0.29866429844885384, 0.16201789514783713, -0.245904062393069, -0.18669329986033092, 0.23733957376746986, -0.08410285087124594, 0.11437170109347235, 0.09425343370121968, -0.017092012703855956, -0.0828446353299593, -0.20032018591660494, 0.28141200082831597, 0.0761400705757942, 0.27316134552585086, 0.10440567818306784, 0.11855854483975367, -0.011952413914312843, -0.06673737043756565, 0.02600208364199591, -0.18959597067886125, 0.17495515063593434, 0.29160183726966327, 0.13950280159558986, 0.3164965691585236, -0.4630938558803715, -0.20163614526462123, 0.06984829571042991, 0.14735211946651383, 0.1329317040561933, -0.08886712927067784, -0.24962826887188294, 0.09412783381479387, -0.13092354702841463, -0.1513090304113242, -0.13655757172502406, -0.00482058335266268, -0.017506293980902386, -0.3052701307940546, 0.05532394361838641, 0.05358366423485559, 0.07410032107345475, -0.10169533670138753, -0.11240185973703691, 0.09948796523603405, 0.0856786311696504, 0.058919646277559835, -0.016977094586597373, 0.08584170069773006, -0.11949643733171846, -0.13290334853942626, 0.36424303981155615, -0.0009529904790315066, -0.23743947028033152, 0.1923225942345066, -0.05342468600862354, -0.12844775328306013, 0.08403963162670382, 0.207565417399502, 0.15579145858601937, -0.17161766370004825, 0.05309531762120705, -0.024645737045309472, 0.14708224758648009, 0.021036886508782743, -0.01658897659783998, 0.12974117098390373, 0.22832440630664325, 0.09467847910494177, 0.19884096025418177, -0.09213078779680299, -0.07381511890580024, -0.29932911802822626, -0.15544316326694577, -0.11244699198091473, 0.0280032827730383, -0.0509918467313867, -0.1889151992020375, 0.3776487790702181, 0.21392732364914685, 0.16010026734514263, 0.030267585373753753, 0.3097794621841598, 0.1094648178901438, -0.01849589647124486, 0.005404032272720382, 0.2192595873582568, 0.17035977985311784, 0.12378904889231078, -0.1996273477695072, 0.007635781313968069, 0.06598581454515784] |
1,802.05938 | Large deviations of extremes in branching random walk with regularly
varying displacements | In this article, we consider a branching random walk on the real-line where
displacements coming from the same parent have jointly regularly varying tails.
The genealogical structure is assumed to be a supercritical Galton-Watson tree,
satisfying Kesten-Stigum condition. We study the large deviations of the
extremal process, formed by the appropriately normalized positions in the
$n$-th generation and show that the large extreme-positions form clusters in
the limit. As a consequence of this, we also study the large deviations of the
maximum among positions at the $n$-th generation.
| math.PR | in this article we consider a branching random walk on the realline where displacements coming from the same parent have jointly regularly varying tails the genealogical structure is assumed to be a supercritical galtonwatson tree satisfying kestenstigum condition we study the large deviations of the extremal process formed by the appropriately normalized positions in the nth generation and show that the large extremepositions form clusters in the limit as a consequence of this we also study the large deviations of the maximum among positions at the nth generation | [['in', 'this', 'article', 'we', 'consider', 'a', 'branching', 'random', 'walk', 'on', 'the', 'realline', 'where', 'displacements', 'coming', 'from', 'the', 'same', 'parent', 'have', 'jointly', 'regularly', 'varying', 'tails', 'the', 'genealogical', 'structure', 'is', 'assumed', 'to', 'be', 'a', 'supercritical', 'galtonwatson', 'tree', 'satisfying', 'kestenstigum', 'condition', 'we', 'study', 'the', 'large', 'deviations', 'of', 'the', 'extremal', 'process', 'formed', 'by', 'the', 'appropriately', 'normalized', 'positions', 'in', 'the', 'nth', 'generation', 'and', 'show', 'that', 'the', 'large', 'extremepositions', 'form', 'clusters', 'in', 'the', 'limit', 'as', 'a', 'consequence', 'of', 'this', 'we', 'also', 'study', 'the', 'large', 'deviations', 'of', 'the', 'maximum', 'among', 'positions', 'at', 'the', 'nth', 'generation']] | [-0.11342660596543366, 0.19075095389123964, -0.056418879436671565, 0.0889112993603515, -0.014600482675642974, -0.046845095205366956, 0.07008602678904245, 0.31714221955030814, -0.31123763984390374, -0.2435528265751213, 0.10874587976796574, -0.2921897217138917, -0.12167688096530907, 0.10487305897491417, -0.02795402321900273, 0.014455554567962542, 0.06660518318082838, 0.07570120524722097, -0.010238752098240215, -0.21722873335639978, 0.3293666539435414, 0.04857839969382889, 0.2755090396037732, -0.020890932926244433, 0.08568457022694678, 0.029893758053752197, 0.002053448780514728, 0.0345076529052237, -0.1730063401578943, 0.09733146662762303, 0.15506484414097563, 0.06657818717154107, 0.2611456252661287, -0.36830794770570324, -0.13648425553250929, 0.1787302492871538, 0.1460465362613978, 0.11271569140298271, -0.01674671846457982, -0.2800678822222626, 0.11869991272313242, -0.1265575976549894, -0.1638780764582428, 0.03928937865742322, 0.03023472209942752, 0.09652121516544072, -0.2782040985773489, 0.05428657297750175, 0.08341074522970052, 0.009805171290177038, -0.0037171234879856824, -0.11133788548672208, -0.028509574433810067, 0.14899608883043303, 0.06159646778157377, -0.011108832176903198, 0.11442328464298712, -0.10577478004491021, -0.09259648851236735, 0.3977003754518027, -0.12259891556426027, -0.18876336538500485, 0.12380895159346447, -0.26915427842766215, -0.23053747003940844, 0.11529494873676235, 0.22604084931228352, 0.12768075786445332, -0.15881741331721624, 0.10333663943402961, -0.0796521585220578, 0.0989885420763287, 0.13492637455206494, 0.004850998825939565, 0.2118586814833869, 0.14411931963980026, 0.08052611585817536, 0.20173040921826602, -0.09085969855719857, -0.10899991304453077, -0.3275903061931503, -0.12438656883207204, -0.22401425246705955, 0.08335043863264908, -0.1396491952645579, -0.18851412755661998, 0.3460940817108742, 0.14210071226838847, 0.2872065696062456, 0.1253082005778092, 0.20784076497001552, 0.15505111499973198, 0.06108500263064928, 0.07511303068042316, 0.1720269096094644, 0.12632313498360073, 0.06518007589546942, -0.1717415673674309, 0.11458171025753536, 0.06520621386495815] |
1,802.05939 | Scanning Microwave Microscopy of Vital Mitochondria in Respiration
Buffer | We demonstrate imaging using scanning microwave microscopy (SMM) of vital
mitochondria in respiration buffer. The mitochondria are isolated from cultured
HeLa cells and tethered to a solid graphene support. The mitochondria are kept
vital (alive) using a respiration buffer, which provides nutrients to sustain
the Krebs cycle. We verify that the mitochondria are "alive" by measuring the
membrane potential using a voltage sensitive fluorescent dye (TMRE). The
organelles are measured capacitively at 7 GHz. Several technical advances are
demonstrated which enable this work: 1) The SMM operates in an
electrophysiologically relevant liquid (hence conducting) environment; 2) The
SMM operates in tapping mode, averaging the microwave reflection measurement
over many tapping periods; 3) A tuned reflectometer enables increased
sensitivity; 4) Variable frequencies up to 18 GHz are used; 5) In contrast with
traditional matching/resonant methods that exhibit high quality factor that
fail in the presence of liquids, interferometric/tuned reflectometer gives the
possibility to adjust the quality factor or sensitivity even in the presence of
the liquid.
| physics.bio-ph cond-mat.mes-hall | we demonstrate imaging using scanning microwave microscopy smm of vital mitochondria in respiration buffer the mitochondria are isolated from cultured hela cells and tethered to a solid graphene support the mitochondria are kept vital alive using a respiration buffer which provides nutrients to sustain the krebs cycle we verify that the mitochondria are alive by measuring the membrane potential using a voltage sensitive fluorescent dye tmre the organelles are measured capacitively at 7 ghz several technical advances are demonstrated which enable this work 1 the smm operates in an electrophysiologically relevant liquid hence conducting environment 2 the smm operates in tapping mode averaging the microwave reflection measurement over many tapping periods 3 a tuned reflectometer enables increased sensitivity 4 variable frequencies up to 18 ghz are used 5 in contrast with traditional matchingresonant methods that exhibit high quality factor that fail in the presence of liquids interferometrictuned reflectometer gives the possibility to adjust the quality factor or sensitivity even in the presence of the liquid | [['we', 'demonstrate', 'imaging', 'using', 'scanning', 'microwave', 'microscopy', 'smm', 'of', 'vital', 'mitochondria', 'in', 'respiration', 'buffer', 'the', 'mitochondria', 'are', 'isolated', 'from', 'cultured', 'hela', 'cells', 'and', 'tethered', 'to', 'a', 'solid', 'graphene', 'support', 'the', 'mitochondria', 'are', 'kept', 'vital', 'alive', 'using', 'a', 'respiration', 'buffer', 'which', 'provides', 'nutrients', 'to', 'sustain', 'the', 'krebs', 'cycle', 'we', 'verify', 'that', 'the', 'mitochondria', 'are', 'alive', 'by', 'measuring', 'the', 'membrane', 'potential', 'using', 'a', 'voltage', 'sensitive', 'fluorescent', 'dye', 'tmre', 'the', 'organelles', 'are', 'measured', 'capacitively', 'at', '7', 'ghz', 'several', 'technical', 'advances', 'are', 'demonstrated', 'which', 'enable', 'this', 'work', '1', 'the', 'smm', 'operates', 'in', 'an', 'electrophysiologically', 'relevant', 'liquid', 'hence', 'conducting', 'environment', '2', 'the', 'smm', 'operates', 'in', 'tapping', 'mode', 'averaging', 'the', 'microwave', 'reflection', 'measurement', 'over', 'many', 'tapping', 'periods', '3', 'a', 'tuned', 'reflectometer', 'enables', 'increased', 'sensitivity', '4', 'variable', 'frequencies', 'up', 'to', '18', 'ghz', 'are', 'used', '5', 'in', 'contrast', 'with', 'traditional', 'matchingresonant', 'methods', 'that', 'exhibit', 'high', 'quality', 'factor', 'that', 'fail', 'in', 'the', 'presence', 'of', 'liquids', 'interferometrictuned', 'reflectometer', 'gives', 'the', 'possibility', 'to', 'adjust', 'the', 'quality', 'factor', 'or', 'sensitivity', 'even', 'in', 'the', 'presence', 'of', 'the', 'liquid']] | [-0.11524301805292014, 0.17123267902889544, 0.010989627953227839, -0.00956563138615708, 0.005523839292840825, -0.18804082170381775, 0.05565363307660273, 0.4091220215698819, -0.20504053294325225, -0.3178933250522356, 0.0763271441783779, -0.2733229691240675, -0.1240810952278682, 0.22076485875741014, -0.0746415915761005, 0.029498599271324498, 0.0391156397541456, -0.045838137424585444, 0.05904220081549598, -0.173145665962502, 0.16924663518273766, 0.08249765505689415, 0.35200925113239473, 0.04247829786869755, 0.12157299100884156, -0.01718321956699875, 0.0022599025842170288, -0.01313554368522248, -0.0964698022609001, 0.0992091087118527, 0.2895042642585956, 0.04559458308726733, 0.2567237720071672, -0.48291447567379814, -0.21214166724261035, 0.05725644761409013, 0.15267512716179035, 0.08230049599588699, -0.037110665902196444, -0.23570088638326175, 0.06258177955887843, -0.15076353599139156, -0.13259038410184007, -0.05317946245180972, -0.04352714973041949, 0.038234457907907915, -0.22880536239855798, 0.09199565039073795, -0.005823099394300148, 0.1106227874658128, -0.08475548771416976, -0.09265043605463924, -0.026770966402025042, 0.18130205939743052, -0.03606359971641206, 0.052326058612469535, 0.2990536803874061, -0.0996181590713986, -0.09788472967417795, 0.3282904157150583, -0.055406398352603484, -0.14757522161084194, 0.2329618164210977, -0.1684371241854136, -0.09497357486390773, 0.19758623622265864, 0.10452305045220311, 0.0617056525984986, -0.15330111360706297, -0.013815699504863724, 0.03883108422505083, 0.2376206324221624, 0.1595978502753294, 0.005890047456494268, 0.2207331541914171, 0.22797150152123155, -0.00013027074035360583, 0.1322212991075458, -0.17984526826896602, 0.005603100216292121, -0.18604092842059922, -0.1696866733757894, -0.13758444668704292, 0.05241779657224492, -0.030879681490064904, -0.10877293738663013, 0.37058514546327015, 0.1260161358334216, 0.15651035576736855, 0.004087665861323016, 0.32299148358611596, 0.027199812098348767, 0.10607749571302262, 0.008500732814916123, 0.24461058736778796, 0.11268536330856106, 0.12013113986985344, -0.24919430289796932, 0.07963522173964453, -0.05733585177725296] |
1,802.0594 | On Rotation Curve Analysis | An analysis of analytical methods used for computing galactic masses on the
basis of rotation curves (Saari 2015) is shown to be flawed.
| astro-ph.IM | an analysis of analytical methods used for computing galactic masses on the basis of rotation curves saari 2015 is shown to be flawed | [['an', 'analysis', 'of', 'analytical', 'methods', 'used', 'for', 'computing', 'galactic', 'masses', 'on', 'the', 'basis', 'of', 'rotation', 'curves', 'saari', '2015', 'is', 'shown', 'to', 'be', 'flawed']] | [-0.06353407506527298, -0.0021637059569753624, -0.1641703524991222, 0.10211503702600527, -0.08609278548670851, -0.05691165517529716, 0.01350600732004513, 0.35747174505630264, -0.17213745852527412, -0.31190021182207955, 0.09809165180701276, -0.23057919238572536, -0.11448892529891885, 0.3565201807321738, -0.1152625584407993, 0.09957593889987987, 0.031313673248919455, -0.05329136509934197, -0.03368154686430226, -0.31938611335404543, 0.24814594958139502, 0.11486026247882325, 0.27348496359975444, 0.0020652483897562056, 0.0548692072701195, -0.0507346896616661, -0.0719400012926401, -0.012442435907280964, -0.16617463691079098, 0.13107590482610723, 0.22983008817486142, 0.1980894490590562, 0.14597116443126099, -0.3837142768923355, -0.15702107151889283, 0.09256261846293574, 0.17512597852265058, 0.12233196117955705, -0.04111805690310733, -0.2746002947628174, 0.029825425403111654, -0.1470089856049289, -0.21541181895072045, -0.12064953310334164, 0.1300160886476869, 0.01578796458552065, -0.27199834374629933, 0.05362363690105469, 0.02643386979141961, 0.13270485976144022, -0.08676188957432042, -0.15949962069482906, -0.028253831617210224, 0.07831863026418116, 0.06581749381376026, 0.06937965396386774, 0.10020450113908104, -0.01914805117184701, -0.14918096452627494, 0.411498521981032, -0.03474890076271866, -0.1338919633594544, 0.15502704096877057, -0.03900801434950984, -0.13307098185886507, 0.10696634917479494, 0.21845984620892483, 0.12973607679748017, -0.17951689405447763, 0.06384240005813215, -0.03685345354935397, 0.1940296643778034, 0.054868170991539955, -0.09421012599183165, 0.2450750402134398, 0.10457036530841952, 0.014295566138689932, 0.00569364942772233, -0.10316205653361976, -0.06202453245287356, -0.21868170305843587, -0.11305632247872975, -0.2186768467983474, 0.04201569520038269, -0.07481800021765672, -0.13696439734675273, 0.3303089296931158, 0.12682997091146914, 0.1757141827484188, 0.021947047227750652, 0.3015554271962332, 0.13804890640565884, 0.061925999901216965, 0.1626892056437614, 0.3310740116335776, 0.21197389629062102, 0.04198995228532864, -0.2161265840227513, 0.04380347668800665, 0.08998233437539413] |
1,802.05941 | Accumulation of Knowledge in Para-Scientific Areas. The Case of Analytic
Philosophy | This study analyzes how the accumulation of knowledge takes place in
para-scientific areas, focusing on the case of Analytic Philosophy. The
theoretical framework chosen for the analysis is Kuhn's theory of normal
science. The methodology employed is qualitative citation context analysis. A
sample of 60 papers published in leading Analytic Philosophy journals between
1950 and 2009 is analyzed, and a specific classsificatory scheme is developed
to classify citations according to their epistemological function. Compared to
previous studies of citation context, this is the first paper that includes the
temporal dimension into the analysis of citation context, in order to gain
insights into the process of knowledge accumulation. Interestingly, the results
show that Analytic Philosophy started accumulating after Second World War, but
in a peculiar way. The accumulation was not matched by a corresponding rising
consensus. This can be explained by the hypothesis that AP underwent a process
of fragmentation in sub-fields during the second half of the century.
| cs.DL | this study analyzes how the accumulation of knowledge takes place in parascientific areas focusing on the case of analytic philosophy the theoretical framework chosen for the analysis is kuhns theory of normal science the methodology employed is qualitative citation context analysis a sample of 60 papers published in leading analytic philosophy journals between 1950 and 2009 is analyzed and a specific classsificatory scheme is developed to classify citations according to their epistemological function compared to previous studies of citation context this is the first paper that includes the temporal dimension into the analysis of citation context in order to gain insights into the process of knowledge accumulation interestingly the results show that analytic philosophy started accumulating after second world war but in a peculiar way the accumulation was not matched by a corresponding rising consensus this can be explained by the hypothesis that ap underwent a process of fragmentation in subfields during the second half of the century | [['this', 'study', 'analyzes', 'how', 'the', 'accumulation', 'of', 'knowledge', 'takes', 'place', 'in', 'parascientific', 'areas', 'focusing', 'on', 'the', 'case', 'of', 'analytic', 'philosophy', 'the', 'theoretical', 'framework', 'chosen', 'for', 'the', 'analysis', 'is', 'kuhns', 'theory', 'of', 'normal', 'science', 'the', 'methodology', 'employed', 'is', 'qualitative', 'citation', 'context', 'analysis', 'a', 'sample', 'of', '60', 'papers', 'published', 'in', 'leading', 'analytic', 'philosophy', 'journals', 'between', '1950', 'and', '2009', 'is', 'analyzed', 'and', 'a', 'specific', 'classsificatory', 'scheme', 'is', 'developed', 'to', 'classify', 'citations', 'according', 'to', 'their', 'epistemological', 'function', 'compared', 'to', 'previous', 'studies', 'of', 'citation', 'context', 'this', 'is', 'the', 'first', 'paper', 'that', 'includes', 'the', 'temporal', 'dimension', 'into', 'the', 'analysis', 'of', 'citation', 'context', 'in', 'order', 'to', 'gain', 'insights', 'into', 'the', 'process', 'of', 'knowledge', 'accumulation', 'interestingly', 'the', 'results', 'show', 'that', 'analytic', 'philosophy', 'started', 'accumulating', 'after', 'second', 'world', 'war', 'but', 'in', 'a', 'peculiar', 'way', 'the', 'accumulation', 'was', 'not', 'matched', 'by', 'a', 'corresponding', 'rising', 'consensus', 'this', 'can', 'be', 'explained', 'by', 'the', 'hypothesis', 'that', 'ap', 'underwent', 'a', 'process', 'of', 'fragmentation', 'in', 'subfields', 'during', 'the', 'second', 'half', 'of', 'the', 'century']] | [-0.05937152754669137, 0.04618810086723011, -0.13270544357454547, 0.08400963558170378, -0.09560077196996038, -0.04955152722891981, 0.08454706398949313, 0.3397355650802358, -0.20792436078250504, -0.3181390004196706, 0.06668243702510014, -0.2629115379009491, -0.17550083086228904, 0.18511963691204214, -0.09950672907348818, -0.02166531681536864, 0.075212961800086, 0.04373003784656668, -0.0253581210391787, -0.30032922267519796, 0.30188507286127275, 0.06290237580796178, 0.3423568742970626, 0.03385975116039985, 0.03290735559615617, -0.001166340751716724, -0.13818275314704992, 0.005715854267038641, -0.13850078659160295, 0.12928231003640506, 0.2764952904902972, 0.18385260866638511, 0.360565035232307, -0.4069566013444367, -0.21079951712491515, 0.04804829417918928, 0.13180259232504818, 0.08569559807148881, -0.012575520856980568, -0.2704878687927237, 0.07414852104818401, -0.184567252248645, -0.11796752352697346, -0.027145098148582455, 0.05053464306267695, -0.019965922497272588, -0.2023732093832969, 0.08236612794765581, 0.09955829554923977, 0.09673298784018232, -0.03855228311686705, -0.10763061539126703, 0.0050723793116422035, 0.1580189258115402, 0.08573890071569715, 0.047107568967382975, 0.11919486174678567, -0.0825296993761395, -0.14403977467997883, 0.3681032523745671, -0.029388317889802586, -0.09936622154950434, 0.12854655143112326, -0.16575152763368514, -0.13038845119388917, 0.10224472814185831, 0.203666500084532, 0.056771649560780645, -0.1716273118329879, 0.07383327468713292, -0.018925418892206673, 0.1548749341044384, 0.0776798590265501, -0.06289354433568242, 0.1902751995680424, 0.1831462548042719, -0.01516226191037836, 0.12079796233163693, -0.047827789621153034, -0.15839280813442877, -0.29886059432577056, -0.14415277131439114, -0.16285093443748805, 0.040857052256727075, -0.039465528885790635, -0.12935216309956443, 0.44488964154532323, 0.13741322133836759, 0.16529970264468247, -0.00401963503099978, 0.28720979156712884, 0.08766579476203053, 0.053341259697798446, 0.040848419352327116, 0.23627140790594217, 0.11091919980483511, 0.16833776560349342, -0.134917003574605, 0.10637292505513567, 0.0502668552493187] |
1,802.05942 | Single ICMEs and Complex Transient Structures in the Solar wind in 2010
-- 2011 | We analyzed statistics, solar sources and properties of interplanetary
coronal mass ejections (ICMEs) in the solar wind. In comparison with the first
eight years of Cycle 23, during the same period of Cycle 24 the yearly numbers
of ICMEs were less correlated with the flare numbers (0.68 vs 0.78) and sunspot
numbers (0.66 vs 0.81), whereas the ICME correlation with coronal mass
ejections (CMEs) was higher (0.77 vs 0.70). For the period January 2010 --
August 2011, we identified solar sources of the ICMEs included in the
Richardson and Cane list. The solar sources of ICME were determined from
coronagraph observations of the Earth-directed CMEs supplemented by modeling of
their propagation in the heliosphere using the kinematic models and the WSA
Enlil Cone MHD-based model. A detailed analysis of the ICME solar sources in
the period under study showed that in 11 cases out of 23 the observed ICME
might be associated with two or more sources. In cases of multiple-source
events, the resulting solar wind disturbances may be described as complex
(merged) structures occurred due to the stream interactions with properties
depending on the type of participating streams. As a reliable marker for
identification of interacting streams and their sources, we used the plasma ion
composition, as it becomes frozen in the low corona and remains unchanged in
the heliosphere. According to the ion composition signatures, we classified
these cases into three types: complex ejecta originating from weak and strong
CME-CME interactions, as well as merged interaction regions originating from
the CME-high-speed stream interactions. We described temporal profiles of the
ion composition for the single-source and multi-source solar wind structures
and compared them with the ICME signatures determined from the kinematic and
magnetic field parameters of the solar wind.
| physics.space-ph | we analyzed statistics solar sources and properties of interplanetary coronal mass ejections icmes in the solar wind in comparison with the first eight years of cycle 23 during the same period of cycle 24 the yearly numbers of icmes were less correlated with the flare numbers 068 vs 078 and sunspot numbers 066 vs 081 whereas the icme correlation with coronal mass ejections cmes was higher 077 vs 070 for the period january 2010 august 2011 we identified solar sources of the icmes included in the richardson and cane list the solar sources of icme were determined from coronagraph observations of the earthdirected cmes supplemented by modeling of their propagation in the heliosphere using the kinematic models and the wsa enlil cone mhdbased model a detailed analysis of the icme solar sources in the period under study showed that in 11 cases out of 23 the observed icme might be associated with two or more sources in cases of multiplesource events the resulting solar wind disturbances may be described as complex merged structures occurred due to the stream interactions with properties depending on the type of participating streams as a reliable marker for identification of interacting streams and their sources we used the plasma ion composition as it becomes frozen in the low corona and remains unchanged in the heliosphere according to the ion composition signatures we classified these cases into three types complex ejecta originating from weak and strong cmecme interactions as well as merged interaction regions originating from the cmehighspeed stream interactions we described temporal profiles of the ion composition for the singlesource and multisource solar wind structures and compared them with the icme signatures determined from the kinematic and magnetic field parameters of the solar wind | [['we', 'analyzed', 'statistics', 'solar', 'sources', 'and', 'properties', 'of', 'interplanetary', 'coronal', 'mass', 'ejections', 'icmes', 'in', 'the', 'solar', 'wind', 'in', 'comparison', 'with', 'the', 'first', 'eight', 'years', 'of', 'cycle', '23', 'during', 'the', 'same', 'period', 'of', 'cycle', '24', 'the', 'yearly', 'numbers', 'of', 'icmes', 'were', 'less', 'correlated', 'with', 'the', 'flare', 'numbers', '068', 'vs', '078', 'and', 'sunspot', 'numbers', '066', 'vs', '081', 'whereas', 'the', 'icme', 'correlation', 'with', 'coronal', 'mass', 'ejections', 'cmes', 'was', 'higher', '077', 'vs', '070', 'for', 'the', 'period', 'january', '2010', 'august', '2011', 'we', 'identified', 'solar', 'sources', 'of', 'the', 'icmes', 'included', 'in', 'the', 'richardson', 'and', 'cane', 'list', 'the', 'solar', 'sources', 'of', 'icme', 'were', 'determined', 'from', 'coronagraph', 'observations', 'of', 'the', 'earthdirected', 'cmes', 'supplemented', 'by', 'modeling', 'of', 'their', 'propagation', 'in', 'the', 'heliosphere', 'using', 'the', 'kinematic', 'models', 'and', 'the', 'wsa', 'enlil', 'cone', 'mhdbased', 'model', 'a', 'detailed', 'analysis', 'of', 'the', 'icme', 'solar', 'sources', 'in', 'the', 'period', 'under', 'study', 'showed', 'that', 'in', '11', 'cases', 'out', 'of', '23', 'the', 'observed', 'icme', 'might', 'be', 'associated', 'with', 'two', 'or', 'more', 'sources', 'in', 'cases', 'of', 'multiplesource', 'events', 'the', 'resulting', 'solar', 'wind', 'disturbances', 'may', 'be', 'described', 'as', 'complex', 'merged', 'structures', 'occurred', 'due', 'to', 'the', 'stream', 'interactions', 'with', 'properties', 'depending', 'on', 'the', 'type', 'of', 'participating', 'streams', 'as', 'a', 'reliable', 'marker', 'for', 'identification', 'of', 'interacting', 'streams', 'and', 'their', 'sources', 'we', 'used', 'the', 'plasma', 'ion', 'composition', 'as', 'it', 'becomes', 'frozen', 'in', 'the', 'low', 'corona', 'and', 'remains', 'unchanged', 'in', 'the', 'heliosphere', 'according', 'to', 'the', 'ion', 'composition', 'signatures', 'we', 'classified', 'these', 'cases', 'into', 'three', 'types', 'complex', 'ejecta', 'originating', 'from', 'weak', 'and', 'strong', 'cmecme', 'interactions', 'as', 'well', 'as', 'merged', 'interaction', 'regions', 'originating', 'from', 'the', 'cmehighspeed', 'stream', 'interactions', 'we', 'described', 'temporal', 'profiles', 'of', 'the', 'ion', 'composition', 'for', 'the', 'singlesource', 'and', 'multisource', 'solar', 'wind', 'structures', 'and', 'compared', 'them', 'with', 'the', 'icme', 'signatures', 'determined', 'from', 'the', 'kinematic', 'and', 'magnetic', 'field', 'parameters', 'of', 'the', 'solar', 'wind']] | [-0.11755057068148744, 0.20565096204599184, 0.012339622941807547, 0.13226391807580107, -0.016705531171788204, -0.04363986854312114, 0.03755865209142131, 0.3911673134684356, -0.19755876275464995, -0.4140729577015413, 0.07730443159905714, -0.2941602743004397, -0.07992482705756426, 0.22509349788015243, -0.030571504554851952, -0.0019431391701800749, 0.12169017690393957, -0.032235336019463524, -0.06560117802695863, -0.18561624043326852, 0.22703200623315448, 0.10413484246722267, 0.16210027296458268, -0.021715497654036478, 0.08560577022525548, -0.059169039130615095, -0.07062101873119293, 0.008475064649151895, -0.0880276063935273, 0.05509845852066064, 0.16079972880911303, 0.1379247068592425, 0.174798713479605, -0.4364356817386579, -0.2392330878250909, -0.0006228973717144174, 0.15538964199691285, -0.03749568549917765, -0.018884570319894718, -0.283903483236726, 0.05625475841103859, -0.17860527122037537, -0.12157353851135769, 0.09916065975711616, 0.04145038220748473, 0.06940571904447602, -0.26498012997520465, 0.12450896730559988, -0.0028619026444276744, 0.14448353603074793, -0.13813350612650133, -0.09773812420866711, -0.08952904608466067, 0.15043404040382788, 0.11986738605345534, 0.03605560058996263, 0.16743510432974695, -0.09982416258976122, -0.08470427057646804, 0.41814239195082337, -0.0257554125920352, -0.05555775081847969, 0.2088499674662469, -0.22078334404179462, -0.14562395390465907, 0.1563946841051802, 0.18372650520339245, 0.06549026744404626, -0.14719533937750384, -0.029673391575821977, -0.0307841509153756, 0.14809969294218364, 0.10164288655020452, -0.0005807422130601481, 0.24966525797208305, 0.09676780503488974, 0.010478566968635682, 0.10568246158552735, -0.23482241175174245, -0.05853252947336943, -0.2471685185511079, -0.10333830385616238, -0.06498421442261638, 0.03359282689012212, -0.11980912932338267, -0.15584597290702126, 0.4406942122942483, 0.14993438663734399, 0.20660968895592507, -0.0696288379986072, 0.24563506441336358, 0.07688094361987573, 0.053772099571132354, 0.14700738092748603, 0.2970423440064123, 0.18260709157968652, 0.20155984299263865, -0.18359124648183447, 0.11131229828687436, 0.06916418563762111] |
1,802.05943 | Cloud No Longer a Silver Bullet, Edge to the Rescue | This paper takes the position that, while cognitive computing today relies
heavily on the cloud, we will soon see a paradigm shift where cognitive
computing primarily happens on network edges. The shift toward edge devices is
fundamentally propelled both by technological constraints in data centers and
wireless network infrastructures, as well as practical considerations such as
privacy and safety. The remainder of this paper lays out our view of how these
constraints will impact future cognitive computing. Bringing cognitive
computing to edge devices opens up several new opportunities and challenges,
some of which demand new solutions and some of which require us to revisit
entrenched techniques in light of new technologies. We close the paper with a
call to action for future research.
| cs.NI cs.NE | this paper takes the position that while cognitive computing today relies heavily on the cloud we will soon see a paradigm shift where cognitive computing primarily happens on network edges the shift toward edge devices is fundamentally propelled both by technological constraints in data centers and wireless network infrastructures as well as practical considerations such as privacy and safety the remainder of this paper lays out our view of how these constraints will impact future cognitive computing bringing cognitive computing to edge devices opens up several new opportunities and challenges some of which demand new solutions and some of which require us to revisit entrenched techniques in light of new technologies we close the paper with a call to action for future research | [['this', 'paper', 'takes', 'the', 'position', 'that', 'while', 'cognitive', 'computing', 'today', 'relies', 'heavily', 'on', 'the', 'cloud', 'we', 'will', 'soon', 'see', 'a', 'paradigm', 'shift', 'where', 'cognitive', 'computing', 'primarily', 'happens', 'on', 'network', 'edges', 'the', 'shift', 'toward', 'edge', 'devices', 'is', 'fundamentally', 'propelled', 'both', 'by', 'technological', 'constraints', 'in', 'data', 'centers', 'and', 'wireless', 'network', 'infrastructures', 'as', 'well', 'as', 'practical', 'considerations', 'such', 'as', 'privacy', 'and', 'safety', 'the', 'remainder', 'of', 'this', 'paper', 'lays', 'out', 'our', 'view', 'of', 'how', 'these', 'constraints', 'will', 'impact', 'future', 'cognitive', 'computing', 'bringing', 'cognitive', 'computing', 'to', 'edge', 'devices', 'opens', 'up', 'several', 'new', 'opportunities', 'and', 'challenges', 'some', 'of', 'which', 'demand', 'new', 'solutions', 'and', 'some', 'of', 'which', 'require', 'us', 'to', 'revisit', 'entrenched', 'techniques', 'in', 'light', 'of', 'new', 'technologies', 'we', 'close', 'the', 'paper', 'with', 'a', 'call', 'to', 'action', 'for', 'future', 'research']] | [-0.16486116761258401, 0.08203799320892166, -0.06151809291989823, -0.0014964683289919805, -0.15261875704400302, -0.17105280256610575, 0.11690839177529457, 0.34523255853512425, -0.2933452391875832, -0.3250443410597802, 0.1279688808343911, -0.2652245717108007, -0.21506203297332566, 0.22720533868343365, -0.13610504254153588, 0.06990051419451469, 0.04093447121946762, -0.003222952725562623, -0.023384721368566397, -0.1979665723818589, 0.33860906456574436, 0.10680692833356135, 0.3281362144072063, 0.13881787441186305, 0.013456136655494026, -0.01959242992012239, -0.050069720609249864, -0.011007626618569097, -0.09049689303876546, 0.21326459374854234, 0.31078654058974203, 0.21854153737743817, 0.35744683009882766, -0.4927509270335843, -0.21272288045156898, 0.08761578816489878, 0.19493146875979211, 0.0858504282560472, -0.08026209092751993, -0.2907218623724652, 0.05596652353320619, -0.18639850778111478, -0.12954810539585143, -0.06152983815636395, 0.007631325836830992, 0.015533708690427153, -0.20091294470750462, -0.07203049338763444, 0.018299170490543592, 0.027450923603482363, -0.027921464547138224, -0.11450702938304673, 0.053751132787939734, 0.17357255518436432, 0.029458493136278376, 0.02603530292862996, 0.1788029518675029, -0.1790495733503343, -0.1643835676727983, 0.4174561565969048, 0.031040299873102487, -0.11367768465685166, 0.17430943240245, -0.09396650785640852, -0.21651734970888592, 0.030297083606019737, 0.22331556487010745, 0.03714690535110175, -0.18405509504349524, 0.06512832345357694, 0.04040356182561415, 0.08659488800155922, 0.03937766879486541, 0.11531346243980332, 0.26291905061864274, 0.21207553620745495, 0.14173692002195895, 0.09149048893856324, -0.07896109652607058, -0.10557887851586187, -0.24120295246517875, -0.16332293873864825, -0.15232266734043756, 0.05781711133318097, -0.03220003118267192, -0.11820985805394689, 0.37405703915283084, 0.21617405178646246, 0.16749631459408296, 0.06496875714018517, 0.3601805358458825, 0.0677475814794652, 0.09217271208763123, 0.11038969381810809, 0.21091560763448886, 0.03163906759714965, 0.19629571983795158, -0.13030399159032366, 0.05642898510232931, -0.042250831259369126] |
1,802.05944 | Monte Carlo Q-learning for General Game Playing | After the recent groundbreaking results of AlphaGo, we have seen a strong
interest in reinforcement learning in game playing. General Game Playing (GGP)
provides a good testbed for reinforcement learning. In GGP, a specification of
games rules is given. GGP problems can be solved by reinforcement learning.
Q-learning is one of the canonical reinforcement learning methods, and has been
used by (Banerjee & Stone, IJCAI 2007) in GGP. In this paper we implement
Q-learning in GGP for three small-board games (Tic-Tac-Toe, Connect Four, Hex),
to allow comparison to Banerjee et al. As expected, Q-learning converges,
although much slower than MCTS. Borrowing an idea from MCTS, we enhance
Q-learning with Monte Carlo Search, to give QM-learning. This enhancement
improves the performance of pure Q-learning. We believe that QM-learning can
also be used to improve performance of reinforcement learning further for
larger games, something which we will test in future work.
| cs.AI | after the recent groundbreaking results of alphago we have seen a strong interest in reinforcement learning in game playing general game playing ggp provides a good testbed for reinforcement learning in ggp a specification of games rules is given ggp problems can be solved by reinforcement learning qlearning is one of the canonical reinforcement learning methods and has been used by banerjee stone ijcai 2007 in ggp in this paper we implement qlearning in ggp for three smallboard games tictactoe connect four hex to allow comparison to banerjee et al as expected qlearning converges although much slower than mcts borrowing an idea from mcts we enhance qlearning with monte carlo search to give qmlearning this enhancement improves the performance of pure qlearning we believe that qmlearning can also be used to improve performance of reinforcement learning further for larger games something which we will test in future work | [['after', 'the', 'recent', 'groundbreaking', 'results', 'of', 'alphago', 'we', 'have', 'seen', 'a', 'strong', 'interest', 'in', 'reinforcement', 'learning', 'in', 'game', 'playing', 'general', 'game', 'playing', 'ggp', 'provides', 'a', 'good', 'testbed', 'for', 'reinforcement', 'learning', 'in', 'ggp', 'a', 'specification', 'of', 'games', 'rules', 'is', 'given', 'ggp', 'problems', 'can', 'be', 'solved', 'by', 'reinforcement', 'learning', 'qlearning', 'is', 'one', 'of', 'the', 'canonical', 'reinforcement', 'learning', 'methods', 'and', 'has', 'been', 'used', 'by', 'banerjee', 'stone', 'ijcai', '2007', 'in', 'ggp', 'in', 'this', 'paper', 'we', 'implement', 'qlearning', 'in', 'ggp', 'for', 'three', 'smallboard', 'games', 'tictactoe', 'connect', 'four', 'hex', 'to', 'allow', 'comparison', 'to', 'banerjee', 'et', 'al', 'as', 'expected', 'qlearning', 'converges', 'although', 'much', 'slower', 'than', 'mcts', 'borrowing', 'an', 'idea', 'from', 'mcts', 'we', 'enhance', 'qlearning', 'with', 'monte', 'carlo', 'search', 'to', 'give', 'qmlearning', 'this', 'enhancement', 'improves', 'the', 'performance', 'of', 'pure', 'qlearning', 'we', 'believe', 'that', 'qmlearning', 'can', 'also', 'be', 'used', 'to', 'improve', 'performance', 'of', 'reinforcement', 'learning', 'further', 'for', 'larger', 'games', 'something', 'which', 'we', 'will', 'test', 'in', 'future', 'work']] | [0.008442339590140457, 0.037348584407751836, -0.1633140159931419, 0.09623024108466403, -0.13576877918094396, -0.1977203128313453, 0.05474126036198617, 0.46080940196226383, -0.23510398296639323, -0.33999472777198614, 0.0433277852969758, -0.22893009446561335, -0.20419713794253766, 0.2004164574137921, -0.1954586262782586, 0.04930797333283157, 0.09431295892031029, -0.0002134256755355103, -0.023094617671750743, -0.319834728486001, 0.2500033953355561, 0.09103790087593269, 0.24854622961118303, 0.016527760478443114, 0.08768026172986318, 0.016934906519901264, 0.020900266720303175, 0.05216026181868952, -0.10084469168580434, 0.11141098031356673, 0.35620084890678266, 0.2267826827226913, 0.41952807225672334, -0.3991879207210551, -0.18204483366892513, 0.13638699934255846, 0.16974020704932125, 0.09082506741798516, -0.06785765474597956, -0.3167116698648395, 0.06461492511313328, -0.23940893671764382, -0.02211937723874018, -0.1146773826828676, -0.036564924336712934, -0.019928882836267866, -0.32127197047711575, -0.07843915051599996, 0.07057236934658782, 0.03155000988907855, 0.006375404135805779, -0.16593662876523388, 0.08593814872397945, 0.12470017234505765, 0.022011490149327136, 0.09737694986076255, 0.12159911714622687, -0.15213843989667708, -0.2861874949636644, 0.31959117233175144, -0.10688634809670601, -0.12464482151935327, 0.1915856010762268, 0.014093631679384874, -0.18035021034101473, 0.0733152419071773, 0.2020653714265289, 0.1822251152439878, -0.12763406258198867, 0.06592431596664969, -0.08724922687457554, 0.12646289690365564, 0.040002832661286514, -0.05586860682614597, 0.09834096422418952, 0.27106120943348727, 0.08201693150792913, 0.13694260225406496, -0.0006488921072590968, -0.20904687949966094, -0.16049896405271158, -0.14515800524246075, -0.13960389126702372, 0.03310415574253119, -0.07914895676066376, -0.0855999131494298, 0.2952578962716306, 0.23826953537184103, 0.12883961029242372, 0.11984968940358096, 0.2792457444400623, 0.08066757136297509, 0.07228963601178136, 0.09850054895344736, 0.2935012700421543, 0.07084622240850123, 0.1861100680869201, -0.1808375187089731, 0.10472527478805518, 0.0922918003251182] |
1,802.05945 | How does undone science get funded? A bibliometric analysis linking rare
diseases publications to national and European funding sources | One of the notable features of undone science debates is how formation of new
interest groups becomes pivotal in mobilizing and championing emerging research
on undone topics. Clearly money is one of the most important mediums through
which different types of actors can support and steer scientists to work on
undone topics. Yet which actors are more visible in their support for
scientific research is something which has seldom been measured. This study
delves into research funding in the context of rare diseases research, a topic
which has evolved from the margins of medical research into a priority area
articulated by many contemporary funding agencies. Rare diseases refer to
conditions affecting relatively few people in a population. Given low
incidences, interest groups have articulated a lack of attention within medical
research compared to more common conditions. The rise to prominence of rare
diseases in research funding policies is often explained in the science studies
literature in terms of effective lobbying by social movements Likewise,
innovative fundraising initiatives, infrastructure building, and close
partnerships with research groups are other means through which interested
actors have sought to build capacity for research into rare medical conditions.
To date however systematic empirical evidence to compare the relative
importance of different actors in funding rare disease research has not been
produced. Building on interest in undone science in STS and science policy
studies, our study hopes to map-out different kinds of funding actors and their
influence on leading scientific research on rare diseases, by use of
bibliometric tools. The approach we are developing relies on the use of Funding
Acknowledgement data provided in Web of Science database.
| cs.DL | one of the notable features of undone science debates is how formation of new interest groups becomes pivotal in mobilizing and championing emerging research on undone topics clearly money is one of the most important mediums through which different types of actors can support and steer scientists to work on undone topics yet which actors are more visible in their support for scientific research is something which has seldom been measured this study delves into research funding in the context of rare diseases research a topic which has evolved from the margins of medical research into a priority area articulated by many contemporary funding agencies rare diseases refer to conditions affecting relatively few people in a population given low incidences interest groups have articulated a lack of attention within medical research compared to more common conditions the rise to prominence of rare diseases in research funding policies is often explained in the science studies literature in terms of effective lobbying by social movements likewise innovative fundraising initiatives infrastructure building and close partnerships with research groups are other means through which interested actors have sought to build capacity for research into rare medical conditions to date however systematic empirical evidence to compare the relative importance of different actors in funding rare disease research has not been produced building on interest in undone science in sts and science policy studies our study hopes to mapout different kinds of funding actors and their influence on leading scientific research on rare diseases by use of bibliometric tools the approach we are developing relies on the use of funding acknowledgement data provided in web of science database | [['one', 'of', 'the', 'notable', 'features', 'of', 'undone', 'science', 'debates', 'is', 'how', 'formation', 'of', 'new', 'interest', 'groups', 'becomes', 'pivotal', 'in', 'mobilizing', 'and', 'championing', 'emerging', 'research', 'on', 'undone', 'topics', 'clearly', 'money', 'is', 'one', 'of', 'the', 'most', 'important', 'mediums', 'through', 'which', 'different', 'types', 'of', 'actors', 'can', 'support', 'and', 'steer', 'scientists', 'to', 'work', 'on', 'undone', 'topics', 'yet', 'which', 'actors', 'are', 'more', 'visible', 'in', 'their', 'support', 'for', 'scientific', 'research', 'is', 'something', 'which', 'has', 'seldom', 'been', 'measured', 'this', 'study', 'delves', 'into', 'research', 'funding', 'in', 'the', 'context', 'of', 'rare', 'diseases', 'research', 'a', 'topic', 'which', 'has', 'evolved', 'from', 'the', 'margins', 'of', 'medical', 'research', 'into', 'a', 'priority', 'area', 'articulated', 'by', 'many', 'contemporary', 'funding', 'agencies', 'rare', 'diseases', 'refer', 'to', 'conditions', 'affecting', 'relatively', 'few', 'people', 'in', 'a', 'population', 'given', 'low', 'incidences', 'interest', 'groups', 'have', 'articulated', 'a', 'lack', 'of', 'attention', 'within', 'medical', 'research', 'compared', 'to', 'more', 'common', 'conditions', 'the', 'rise', 'to', 'prominence', 'of', 'rare', 'diseases', 'in', 'research', 'funding', 'policies', 'is', 'often', 'explained', 'in', 'the', 'science', 'studies', 'literature', 'in', 'terms', 'of', 'effective', 'lobbying', 'by', 'social', 'movements', 'likewise', 'innovative', 'fundraising', 'initiatives', 'infrastructure', 'building', 'and', 'close', 'partnerships', 'with', 'research', 'groups', 'are', 'other', 'means', 'through', 'which', 'interested', 'actors', 'have', 'sought', 'to', 'build', 'capacity', 'for', 'research', 'into', 'rare', 'medical', 'conditions', 'to', 'date', 'however', 'systematic', 'empirical', 'evidence', 'to', 'compare', 'the', 'relative', 'importance', 'of', 'different', 'actors', 'in', 'funding', 'rare', 'disease', 'research', 'has', 'not', 'been', 'produced', 'building', 'on', 'interest', 'in', 'undone', 'science', 'in', 'sts', 'and', 'science', 'policy', 'studies', 'our', 'study', 'hopes', 'to', 'mapout', 'different', 'kinds', 'of', 'funding', 'actors', 'and', 'their', 'influence', 'on', 'leading', 'scientific', 'research', 'on', 'rare', 'diseases', 'by', 'use', 'of', 'bibliometric', 'tools', 'the', 'approach', 'we', 'are', 'developing', 'relies', 'on', 'the', 'use', 'of', 'funding', 'acknowledgement', 'data', 'provided', 'in', 'web', 'of', 'science', 'database']] | [-0.06749740192651559, 0.0924532589054218, -0.052093463793951536, 0.08181580250039351, -0.17341025689685785, -0.12441231130829287, 0.07056139095910584, 0.4110103407391795, -0.21076680789744756, -0.31566016313240486, 0.10591882477057409, -0.299300941331657, -0.1575004120728139, 0.24576365905080888, -0.1463442455123489, 0.011531244789215701, 0.07947891652023557, 0.03601472636995216, 0.0333396033047595, -0.29963604451019177, 0.2784057975746691, 0.05735252934887453, 0.35624025360232703, 0.07537298537273374, -0.0007898266474647378, -0.02658489677641127, -0.12666221983661807, -0.00487674460918815, -0.11475830780971727, 0.18234016969110126, 0.43525006197979327, 0.2408441022935289, 0.4522006875397724, -0.44180763653583, -0.22902669334715164, 0.07728329967638409, 0.13328155738741365, 0.05663305200179349, -0.0771319962120658, -0.3347684541777535, 0.0034191367630329395, -0.19722800836294752, -0.07813171918107266, -0.08288249080069363, 0.057325501219128015, 0.010795463811761389, -0.1786623038092835, -0.007392708202328154, -0.003661108070082264, 0.16603336603471286, -0.00833321070746967, -0.15429780947613633, -0.007092295935715945, 0.2234515572829103, 0.15138523793236042, 0.008213990950564578, 0.16271751740843884, -0.18075967236697948, -0.1497669510614489, 0.40566890148652923, 0.05239871557870949, -0.12446966203516004, 0.21337875608458287, -0.12393804833430935, -0.21474805002842373, 0.09110520189860835, 0.24880626305799794, 0.06252925574760108, -0.20777108090136337, 0.013077036662919757, -0.008788420141812551, 0.09965479724040185, 0.060830664891033885, 0.0254104882720168, 0.2723929329464833, 0.2014234551845153, 0.04853696011457403, 0.09037476484642226, -0.002152152702695242, -0.12536641322162553, -0.18763207471067156, -0.1372495445750516, -0.12063669074430233, 0.009144427194917593, 0.007922669928531698, -0.13596729942235267, 0.3799256911880716, 0.1826442499903755, 0.08996575250402437, -0.08185112545292618, 0.27704561927045385, -0.029904777844246753, 0.12370112515830746, 0.05059920749627054, 0.18806840893984944, 0.049193526341049516, 0.14442522588134227, -0.10804307555210674, 0.18371924747264495, -0.039808767757171556] |
1,802.05946 | Degradation rate uniformity determines success of oscillations in
repressive feedback regulatory networks | Ring oscillators are biochemical circuits consisting of a ring of
interactions capable of sustained oscillations. The non-linear interactions
between genes hinder the analytical insight into their function, usually
requiring computational exploration. Here we show that, despite the apparent
complexity, the stability of the unique steady state in an incoherent feedback
ring depends only on the degradation rates and a single parameter summarizing
the feedback of the circuit. Concretely, we show that the range of regulatory
parameters that yield oscillatory behaviour, is maximized when the degradation
rates are equal. Strikingly, this results holds independently of the regulatory
functions used or number of genes. We also derive properties of the
oscillations as a function of the degradation rates and number of nodes forming
the ring. Finally, we explore the role of mRNA dynamics by applying the generic
results to the specific case with two naturally different degradation time
scales
| q-bio.MN | ring oscillators are biochemical circuits consisting of a ring of interactions capable of sustained oscillations the nonlinear interactions between genes hinder the analytical insight into their function usually requiring computational exploration here we show that despite the apparent complexity the stability of the unique steady state in an incoherent feedback ring depends only on the degradation rates and a single parameter summarizing the feedback of the circuit concretely we show that the range of regulatory parameters that yield oscillatory behaviour is maximized when the degradation rates are equal strikingly this results holds independently of the regulatory functions used or number of genes we also derive properties of the oscillations as a function of the degradation rates and number of nodes forming the ring finally we explore the role of mrna dynamics by applying the generic results to the specific case with two naturally different degradation time scales | [['ring', 'oscillators', 'are', 'biochemical', 'circuits', 'consisting', 'of', 'a', 'ring', 'of', 'interactions', 'capable', 'of', 'sustained', 'oscillations', 'the', 'nonlinear', 'interactions', 'between', 'genes', 'hinder', 'the', 'analytical', 'insight', 'into', 'their', 'function', 'usually', 'requiring', 'computational', 'exploration', 'here', 'we', 'show', 'that', 'despite', 'the', 'apparent', 'complexity', 'the', 'stability', 'of', 'the', 'unique', 'steady', 'state', 'in', 'an', 'incoherent', 'feedback', 'ring', 'depends', 'only', 'on', 'the', 'degradation', 'rates', 'and', 'a', 'single', 'parameter', 'summarizing', 'the', 'feedback', 'of', 'the', 'circuit', 'concretely', 'we', 'show', 'that', 'the', 'range', 'of', 'regulatory', 'parameters', 'that', 'yield', 'oscillatory', 'behaviour', 'is', 'maximized', 'when', 'the', 'degradation', 'rates', 'are', 'equal', 'strikingly', 'this', 'results', 'holds', 'independently', 'of', 'the', 'regulatory', 'functions', 'used', 'or', 'number', 'of', 'genes', 'we', 'also', 'derive', 'properties', 'of', 'the', 'oscillations', 'as', 'a', 'function', 'of', 'the', 'degradation', 'rates', 'and', 'number', 'of', 'nodes', 'forming', 'the', 'ring', 'finally', 'we', 'explore', 'the', 'role', 'of', 'mrna', 'dynamics', 'by', 'applying', 'the', 'generic', 'results', 'to', 'the', 'specific', 'case', 'with', 'two', 'naturally', 'different', 'degradation', 'time', 'scales']] | [-0.19424313595708537, 0.13292582752905727, -0.027555090151125325, 0.042459894372403724, -0.021640865696074606, -0.11338611579417777, 0.06058535664057245, 0.34079710409507713, -0.2901881465254364, -0.28022269642322645, 0.06257765227176414, -0.2337096341233067, -0.18921518299988388, 0.22021786246423414, -0.02287779366882632, 0.0035390713771640443, 0.07756623471247628, 0.035954334320133036, -0.033131412089466544, -0.22968586497990806, 0.31854651543964335, 0.0828491794008787, 0.28273997590465305, 0.021980914404476377, 0.10546815791325707, -0.03915883546543061, 0.005665313894385282, 0.015996446359433793, -0.1381013245793708, 0.09284036381520192, 0.23028343089944905, 0.13025354378901066, 0.2782745418221164, -0.4765729409623511, -0.20580940837215564, 0.14205531194508328, 0.15252274767096555, 0.12312600558281553, -0.05596131145349089, -0.21805262308073592, 0.05942275074190226, -0.1513033900584164, -0.10671082315459644, -0.06738991275442396, 0.021743404707510253, 0.1000915599925189, -0.2696413074487022, 0.10794939919747887, 0.06500890627277692, 0.05509623031759141, -0.057258927998240707, -0.08405473460538351, -0.04450433538136941, 0.18981522263513187, 0.03014115350428639, -0.04338044430553711, 0.1994859578759492, -0.15921214795481337, -0.1000799827188963, 0.3147806003246279, -0.052492399893615545, -0.20346160431956353, 0.2125231001247354, -0.15381002677034358, -0.10322076329315195, 0.14979872878856298, 0.1467379123031092, 0.08202553458739908, -0.14328702304682134, 0.03854729251248673, -0.0047710217301081236, 0.20002645151182807, 0.061157301210855344, 0.09446798331899328, 0.1756932474514406, 0.1951646534187504, 0.022672614077150467, 0.17436990942362518, -0.047108694675004704, -0.10323051298607369, -0.27392179057711646, -0.11644447732164025, -0.13456085041762475, 0.05774072797883454, -0.11491246102199586, -0.13509265364458165, 0.4429766745338229, 0.1069818599400828, 0.22042541358339085, 0.06584350007655872, 0.2690270919428796, 0.09064885070404913, 0.055761808857359756, 0.0328794238981189, 0.24121052951735705, 0.1017675288417535, 0.0439824815934562, -0.30173999849124017, 0.12091569537867089, 0.00205154338262367] |
1,802.05947 | Infrared limit of quantum gravity | We explore the infrared limit of quantum gravity in presence of a
cosmological constant or effective potential for scalar fields. For a positive
effective scalar potential, one-loop perturbation theory around flat space is
divergent due to an instability of the graviton propagator. Functional
renormalization solves this problem by a flow of couplings avoiding
instabilities. This leads to a graviton barrier limiting the maximal growth of
the effective potential for large values of scalar fields. In the presence of
this barrier, variable gravity with a field dependent Planck mass can solve the
cosmological constant problem by a cosmological runaway solution. We discuss
the naturalness of tiny values of the cosmological constant and cosmon mass due
to a strong attraction towards an infrared fixed point.
| gr-qc hep-ph hep-th | we explore the infrared limit of quantum gravity in presence of a cosmological constant or effective potential for scalar fields for a positive effective scalar potential oneloop perturbation theory around flat space is divergent due to an instability of the graviton propagator functional renormalization solves this problem by a flow of couplings avoiding instabilities this leads to a graviton barrier limiting the maximal growth of the effective potential for large values of scalar fields in the presence of this barrier variable gravity with a field dependent planck mass can solve the cosmological constant problem by a cosmological runaway solution we discuss the naturalness of tiny values of the cosmological constant and cosmon mass due to a strong attraction towards an infrared fixed point | [['we', 'explore', 'the', 'infrared', 'limit', 'of', 'quantum', 'gravity', 'in', 'presence', 'of', 'a', 'cosmological', 'constant', 'or', 'effective', 'potential', 'for', 'scalar', 'fields', 'for', 'a', 'positive', 'effective', 'scalar', 'potential', 'oneloop', 'perturbation', 'theory', 'around', 'flat', 'space', 'is', 'divergent', 'due', 'to', 'an', 'instability', 'of', 'the', 'graviton', 'propagator', 'functional', 'renormalization', 'solves', 'this', 'problem', 'by', 'a', 'flow', 'of', 'couplings', 'avoiding', 'instabilities', 'this', 'leads', 'to', 'a', 'graviton', 'barrier', 'limiting', 'the', 'maximal', 'growth', 'of', 'the', 'effective', 'potential', 'for', 'large', 'values', 'of', 'scalar', 'fields', 'in', 'the', 'presence', 'of', 'this', 'barrier', 'variable', 'gravity', 'with', 'a', 'field', 'dependent', 'planck', 'mass', 'can', 'solve', 'the', 'cosmological', 'constant', 'problem', 'by', 'a', 'cosmological', 'runaway', 'solution', 'we', 'discuss', 'the', 'naturalness', 'of', 'tiny', 'values', 'of', 'the', 'cosmological', 'constant', 'and', 'cosmon', 'mass', 'due', 'to', 'a', 'strong', 'attraction', 'towards', 'an', 'infrared', 'fixed', 'point']] | [-0.19779718044494105, 0.17353679455757118, -0.08350893044919987, 0.10973884243086525, -0.10754941343481282, -0.13176048118848263, 0.028491511197033817, 0.259337258990854, -0.2335673493552741, -0.2893978036150745, 0.06817700282852279, -0.2501491401647407, -0.10387055473818588, 0.11603315744162877, -0.006369988959734219, 0.0456761675832388, -0.014198278001229452, 0.019460092253256137, -0.038524894320171296, -0.22557475156722423, 0.40542243173103626, 0.08458034795561306, 0.18301437550595379, 0.10848283758614122, 0.11211929870087926, -0.015518772112947653, -0.0022796435296777787, 0.033559877799996134, -0.1546688482801362, 0.05953280766858015, 0.16073465371519569, 0.018674209971374613, 0.3065760205897344, -0.35595944901261994, -0.2598097027786742, 0.12982253161660298, 0.16896864895262126, 0.18773616848483196, -0.11128638814604742, -0.24766874142990605, 0.05236578579022875, -0.15853980152557293, -0.20919229172367027, -0.049612478746813, 0.01932542995697387, -0.08727434446147408, -0.3057696445337762, 0.1355765043623931, -0.06197216765144915, -0.007061734689566178, -0.11111549147200293, -0.06772211242497451, -0.0032609039027910163, 0.05930017547566459, 0.17155807652525845, 0.07027935656450113, 0.15786815352901878, -0.23314459473784346, -0.07103983796584018, 0.3928789848052874, -0.18263204900616006, -0.19243834403956808, 0.12614658644150306, -0.1267458492761281, -0.08031816877106704, 0.1239519228939179, 0.13760151861924527, 0.12512960496199568, -0.14948193085326897, 0.23638138787516172, 0.043259400350034116, 0.14281600638320177, 0.11825988225911449, 0.014047411649972504, 0.31749121452553003, 0.10793005829729987, 0.10143551046816193, 0.09492063621528507, -0.027265491645510603, -0.09975386528691989, -0.3689280017458917, -0.12237986910149334, -0.1439028658101532, 0.09704718844041349, -0.20617220631024016, -0.23543616058304906, 0.3598537297343941, 0.15421162445166306, 0.18099747770049465, 0.0599200039935427, 0.2667601767064231, 0.14954552861551443, 0.10253523779947574, 0.04682258923530457, 0.3030884088342631, 0.14913718957582686, 0.1043454921403067, -0.2918892590503201, -0.0715295443636918, 0.06010571135798606] |
1,802.05948 | Analysis of Schema.org Usage in the Tourism Domain | Schema.org is an initiative founded in 2011 by the four-big search engine
Bing, Google, Yahoo!, and Yandex. The goal of the initiative is to publish and
maintain the schema.org vocabulary, in order to facilitate the publication of
structured data on the web which can enable the implementation of automated
agents like intelligent personal assistants and chatbots. In this paper, the
usage of schema.org in tourism domain between years 2013 and 2016 is analysed.
The analysis shows the adoption of schema.org, which indicates how well the
tourism sector is prepared for the web that targets automated agents. The
results have shown that the adoption of schema.org type and properties is grown
over the years. While the US is dominating the annotation numbers, a drastic
drop is observed for the proportion of the US in 2016. Poorly rated businesses
are encountered more in 2016 results in comparison to previous years.
| cs.IR | schemaorg is an initiative founded in 2011 by the fourbig search engine bing google yahoo and yandex the goal of the initiative is to publish and maintain the schemaorg vocabulary in order to facilitate the publication of structured data on the web which can enable the implementation of automated agents like intelligent personal assistants and chatbots in this paper the usage of schemaorg in tourism domain between years 2013 and 2016 is analysed the analysis shows the adoption of schemaorg which indicates how well the tourism sector is prepared for the web that targets automated agents the results have shown that the adoption of schemaorg type and properties is grown over the years while the us is dominating the annotation numbers a drastic drop is observed for the proportion of the us in 2016 poorly rated businesses are encountered more in 2016 results in comparison to previous years | [['schemaorg', 'is', 'an', 'initiative', 'founded', 'in', '2011', 'by', 'the', 'fourbig', 'search', 'engine', 'bing', 'google', 'yahoo', 'and', 'yandex', 'the', 'goal', 'of', 'the', 'initiative', 'is', 'to', 'publish', 'and', 'maintain', 'the', 'schemaorg', 'vocabulary', 'in', 'order', 'to', 'facilitate', 'the', 'publication', 'of', 'structured', 'data', 'on', 'the', 'web', 'which', 'can', 'enable', 'the', 'implementation', 'of', 'automated', 'agents', 'like', 'intelligent', 'personal', 'assistants', 'and', 'chatbots', 'in', 'this', 'paper', 'the', 'usage', 'of', 'schemaorg', 'in', 'tourism', 'domain', 'between', 'years', '2013', 'and', '2016', 'is', 'analysed', 'the', 'analysis', 'shows', 'the', 'adoption', 'of', 'schemaorg', 'which', 'indicates', 'how', 'well', 'the', 'tourism', 'sector', 'is', 'prepared', 'for', 'the', 'web', 'that', 'targets', 'automated', 'agents', 'the', 'results', 'have', 'shown', 'that', 'the', 'adoption', 'of', 'schemaorg', 'type', 'and', 'properties', 'is', 'grown', 'over', 'the', 'years', 'while', 'the', 'us', 'is', 'dominating', 'the', 'annotation', 'numbers', 'a', 'drastic', 'drop', 'is', 'observed', 'for', 'the', 'proportion', 'of', 'the', 'us', 'in', '2016', 'poorly', 'rated', 'businesses', 'are', 'encountered', 'more', 'in', '2016', 'results', 'in', 'comparison', 'to', 'previous', 'years']] | [-0.06914732036248901, 0.04754693427079176, -0.05871453211281677, 0.042954818632288956, -0.14314261479239884, -0.061874992811266766, 0.08306510736421384, 0.3785776873784406, -0.20798839986020204, -0.38701977227263307, 0.11528376369898645, -0.3388115720170848, -0.1315152232973127, 0.21231594070044607, -0.12393966900678921, 0.009853155250806793, 0.07937980975740316, 0.029454479804959428, 0.028408334369543105, -0.34999398692973516, 0.2649283137435385, 0.09801243032727923, 0.3362447853060756, 0.07488162017611115, 0.03923938794736275, -0.01026436358137487, -0.11352054897650639, -0.043712031039200266, -0.08621142173811974, 0.17199946927432555, 0.3349169329581719, 0.213703740334303, 0.3252937166514445, -0.3980628783073352, -0.1410023137755996, 0.059936774189767686, 0.11455432433741117, 0.06664461707363703, -0.04345350525847582, -0.3515813184179822, 0.0817790832726893, -0.2320692108684302, -0.09723647580272993, -0.058375639269971066, 0.08279444431239853, 0.0370203390468837, -0.2150831057018518, 0.014198480754042184, 0.030666695382655124, 0.10321673166108172, -0.029927946633475574, -0.0777031962005865, -0.021706332587225197, 0.20589787139855073, 0.07498945080561145, 0.05260398975402421, 0.12766291191294588, -0.15749122844026964, -0.15010114320471477, 0.3765576485493759, -0.021723515570296774, -0.07362525646422742, 0.21013061053414203, -0.07945686961099709, -0.1462904200192262, 0.07716958127839833, 0.2300559205991425, 0.08538236138315833, -0.1915599826507929, 0.07656221493855309, -0.03120323048182288, 0.20831684897444686, 0.06400820397816244, -0.03832236678041771, 0.17221100449001378, 0.22979456529046605, 0.046886618885838866, 0.09167391871146503, -0.035785363592701604, -0.09400120674003688, -0.1995707803222091, -0.19496744014744466, -0.15732492576036475, 0.002308044738617732, -0.01584626252390365, -0.14198554214783057, 0.38543816232661, 0.20577269298068823, 0.13419703610216072, -0.008265530589182361, 0.2469405008315229, 0.003773885984195485, 0.11598458165163492, 0.10737441941227789, 0.2090416905449602, 0.0030063050945580865, 0.2509843707345996, -0.1259007270473252, 0.12468606776868303, 0.014404524608711604] |
1,802.05949 | Carleman commutator approach in logarithmic convexity for parabolic
equations | In this paper we investigate on a new strategy combining the logarithmic
convexity (or frequency function) and the Carleman commutator to obtain an
observation estimate at one time for the heat equation in a bounded domain. We
also consider the heat equation with an inverse square potential. Moreover, a
spectral inequality for the associated eigenvalue problem is derived.
| math.AP | in this paper we investigate on a new strategy combining the logarithmic convexity or frequency function and the carleman commutator to obtain an observation estimate at one time for the heat equation in a bounded domain we also consider the heat equation with an inverse square potential moreover a spectral inequality for the associated eigenvalue problem is derived | [['in', 'this', 'paper', 'we', 'investigate', 'on', 'a', 'new', 'strategy', 'combining', 'the', 'logarithmic', 'convexity', 'or', 'frequency', 'function', 'and', 'the', 'carleman', 'commutator', 'to', 'obtain', 'an', 'observation', 'estimate', 'at', 'one', 'time', 'for', 'the', 'heat', 'equation', 'in', 'a', 'bounded', 'domain', 'we', 'also', 'consider', 'the', 'heat', 'equation', 'with', 'an', 'inverse', 'square', 'potential', 'moreover', 'a', 'spectral', 'inequality', 'for', 'the', 'associated', 'eigenvalue', 'problem', 'is', 'derived']] | [-0.1025845228116317, 0.015279172426430862, -0.07454574906973746, 0.07667187705700254, -0.11279282160103321, -0.12163313336124451, 0.04463038325825594, 0.34748236635892554, -0.36234156363483133, -0.22668459583555572, 0.16382152840479053, -0.3068925590607627, -0.12001408447194363, 0.21367313105468477, -0.04300813160130176, 0.05995523129943116, 0.035652011476360775, 0.08467546166402512, -0.0816536665741547, -0.16281163192691345, 0.378794457183364, 0.0027528674630769366, 0.2117627619380324, 0.09902329207799429, 0.1399170133156766, -0.005358584313492836, -0.01809484670580975, -0.03283022970346541, -0.218308154377155, 0.12873922845404917, 0.17355247579739783, 0.03993107546080739, 0.3226773426065157, -0.38181535825775614, -0.21899996619221979, 0.16615576085088582, 0.12077210229773332, 0.05779739217993257, -0.06674236846397277, -0.24386782931356593, 0.058907514634734856, -0.11402331440356271, -0.19136590594104652, -0.023063098497945685, -0.012468581312689287, 0.007591370180056527, -0.3282683728070095, 0.13981258847443628, 0.07826200962580483, 0.020123043033326495, -0.15542312228152977, -0.10649425092410168, 0.07861004650175314, 0.05237371645915996, 0.01670049805523314, 0.027679323446575615, 0.03330971135211916, -0.12720885782518648, -0.09368041062984488, 0.2942551741103545, -0.10304672116863317, -0.2548120292867052, 0.08315997735741709, -0.12784840462825678, -0.10674927548248449, 0.046479735443175865, 0.1903456869085544, 0.14070633842995198, -0.18843281284127192, 0.11074169200006069, -0.040886907774055826, 0.16929468343933596, 0.069568429383096, 0.005573699652249443, 0.08105727638407, 0.13514956809451867, 0.1902066843808982, 0.2049236013072318, -0.08044342866572872, -0.043116523683520744, -0.338092337908416, -0.19895572421353727, -0.26609469389799856, 0.09013671197141682, -0.11225735811202522, -0.17616286896297645, 0.3986665366281723, 0.10443800721510217, 0.1837629121246523, 0.11677072177930124, 0.25130326599524966, 0.2645184645461368, 0.01795416850002547, 0.08641485869884491, 0.18992042713316865, 0.15896648369681346, 0.14537508359403703, -0.25725537019075245, -0.006292897581668763, 0.1453707483283481] |
1,802.0595 | Set existence principles and closure conditions: unravelling the
standard view of reverse mathematics | It is a striking fact from reverse mathematics that almost all theorems of
countable and countably representable mathematics are equivalent to just five
subsystems of second order arithmetic. The standard view is that the
significance of these equivalences lies in the set existence principles that
are necessary and sufficient to prove those theorems. In this article I analyse
the role of set existence principles in reverse mathematics, and argue that
they are best understood as closure conditions on the powerset of the natural
numbers.
| math.LO | it is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic the standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems in this article i analyse the role of set existence principles in reverse mathematics and argue that they are best understood as closure conditions on the powerset of the natural numbers | [['it', 'is', 'a', 'striking', 'fact', 'from', 'reverse', 'mathematics', 'that', 'almost', 'all', 'theorems', 'of', 'countable', 'and', 'countably', 'representable', 'mathematics', 'are', 'equivalent', 'to', 'just', 'five', 'subsystems', 'of', 'second', 'order', 'arithmetic', 'the', 'standard', 'view', 'is', 'that', 'the', 'significance', 'of', 'these', 'equivalences', 'lies', 'in', 'the', 'set', 'existence', 'principles', 'that', 'are', 'necessary', 'and', 'sufficient', 'to', 'prove', 'those', 'theorems', 'in', 'this', 'article', 'i', 'analyse', 'the', 'role', 'of', 'set', 'existence', 'principles', 'in', 'reverse', 'mathematics', 'and', 'argue', 'that', 'they', 'are', 'best', 'understood', 'as', 'closure', 'conditions', 'on', 'the', 'powerset', 'of', 'the', 'natural', 'numbers']] | [-0.10185916901433043, 0.08746346160547719, -0.07659658386754538, 0.1629114555530361, -0.07555282714920827, -0.08293197781313211, 0.04251542841804968, 0.33751244131209596, -0.32899868883015143, -0.25082112093167824, 0.14517742728154795, -0.2558770714676939, -0.1447018972442796, 0.20389548898674548, -0.11262280075433886, -0.015128310204350523, 0.056077830731824395, 0.05940042712193515, -0.05057001297522913, -0.2593309041556148, 0.3443663148819247, -0.06317337941644448, 0.2595747034730656, 0.04681967683358207, 0.09147793189844206, -0.049917902426040245, -0.008519597382040783, 0.03765996518805401, -0.1287225615028763, 0.12842382640866118, 0.3270284267519379, 0.19017293870482327, 0.292159037270938, -0.41625843178813476, -0.11388652559946336, 0.1451724685418109, 0.05095867268807654, 0.06055216610963855, 0.025824109204612405, -0.2369428663777875, 0.13013586623682863, -0.0910846873330662, -0.1434989739874644, -0.07378066144883633, 0.03439055443630509, 0.04707631702712249, -0.19261813690398066, 0.047508596460656485, 0.19057691072867738, 0.12112292729580076, -0.018831279253520603, -0.10977274670620404, -0.035805578981082706, 0.11012549221604354, 0.03565456318513801, -0.008516040569659145, 0.07720994388884199, -0.07802571367106534, -0.1540701982753706, 0.3922955025697038, 0.005259723772594173, -0.1431654759910002, 0.2326543546348278, -0.1695979493448422, -0.21813027252487482, 0.08943040612419802, 0.07885614541702948, 0.08450166787952185, -0.12842331978026778, 0.14479343719306467, -0.1172324685335514, 0.11572365317538026, 0.13015846125892408, 0.07294944724777624, 0.1696097652172847, 0.09758449935664733, 0.0735127459989772, 0.11073898390999862, 0.03785619679893855, -0.11594946802194629, -0.4319148782108511, -0.14380938721643316, -0.14972615931765176, 0.07330249260745145, -0.05642794996691962, -0.16724879096727818, 0.351599256485878, 0.1673270486672187, 0.08481182839854487, 0.07943985167713392, 0.2285542643983804, 0.09875065095859879, 0.017851627853122495, 0.03623994371099841, 0.24220904906369037, 0.20157550739878344, 0.04777214570259232, -0.07095350562407735, 0.07125406057041671, 0.1337078936187373] |
1,802.05951 | Innovation Initiatives in Large Software Companies: A Systematic Mapping
Study | To keep the competitive advantage and adapt to changes in the market and
technology, companies need to innovate in an organised, purposeful and
systematic manner. However, due to their size and complexity, large companies
tend to focus on maintaining their business, which can potentially lower their
agility to innovate. This study aims to provide an overview of the current
research on innovation initiatives and to identify the challenges of
implementing the initiatives in the context of large software companies. The
investigation was performed using a systematic mapping approach of published
literature on corporate innovation and entrepreneurship. Then it was
complemented with interviews with four experts with rich industry experience.
Our study results suggest that, there is a lack of high quality empirical
studies on innovation initiative in the context of large software companies. A
total of 7 studies are conducted in such context, which reported 5 types of
initiatives: intrapreneurship, bootlegging, internal venture, spin-off and
crowdsourcing. Our study offers three contributions. First, this paper
represents the map of existing literature on innovation initiatives inside
large companies. The second contribution is to provide an innovation initiative
tree. The third contribution is to identify key challenges faced by each
initiative in large software companies. At the strategic and tactical levels,
there is no difference between large software companies and other companies. At
the operational level, large software companies are highly influenced by the
advancement of Internet technology. Large software companies use open
innovation paradigm as part of their innovation initiatives. We envision a
future work is to further empirically evaluate the innovation initiative tree
in large software companies, which involves more practitioners from different
companies.
| cs.SE | to keep the competitive advantage and adapt to changes in the market and technology companies need to innovate in an organised purposeful and systematic manner however due to their size and complexity large companies tend to focus on maintaining their business which can potentially lower their agility to innovate this study aims to provide an overview of the current research on innovation initiatives and to identify the challenges of implementing the initiatives in the context of large software companies the investigation was performed using a systematic mapping approach of published literature on corporate innovation and entrepreneurship then it was complemented with interviews with four experts with rich industry experience our study results suggest that there is a lack of high quality empirical studies on innovation initiative in the context of large software companies a total of 7 studies are conducted in such context which reported 5 types of initiatives intrapreneurship bootlegging internal venture spinoff and crowdsourcing our study offers three contributions first this paper represents the map of existing literature on innovation initiatives inside large companies the second contribution is to provide an innovation initiative tree the third contribution is to identify key challenges faced by each initiative in large software companies at the strategic and tactical levels there is no difference between large software companies and other companies at the operational level large software companies are highly influenced by the advancement of internet technology large software companies use open innovation paradigm as part of their innovation initiatives we envision a future work is to further empirically evaluate the innovation initiative tree in large software companies which involves more practitioners from different companies | [['to', 'keep', 'the', 'competitive', 'advantage', 'and', 'adapt', 'to', 'changes', 'in', 'the', 'market', 'and', 'technology', 'companies', 'need', 'to', 'innovate', 'in', 'an', 'organised', 'purposeful', 'and', 'systematic', 'manner', 'however', 'due', 'to', 'their', 'size', 'and', 'complexity', 'large', 'companies', 'tend', 'to', 'focus', 'on', 'maintaining', 'their', 'business', 'which', 'can', 'potentially', 'lower', 'their', 'agility', 'to', 'innovate', 'this', 'study', 'aims', 'to', 'provide', 'an', 'overview', 'of', 'the', 'current', 'research', 'on', 'innovation', 'initiatives', 'and', 'to', 'identify', 'the', 'challenges', 'of', 'implementing', 'the', 'initiatives', 'in', 'the', 'context', 'of', 'large', 'software', 'companies', 'the', 'investigation', 'was', 'performed', 'using', 'a', 'systematic', 'mapping', 'approach', 'of', 'published', 'literature', 'on', 'corporate', 'innovation', 'and', 'entrepreneurship', 'then', 'it', 'was', 'complemented', 'with', 'interviews', 'with', 'four', 'experts', 'with', 'rich', 'industry', 'experience', 'our', 'study', 'results', 'suggest', 'that', 'there', 'is', 'a', 'lack', 'of', 'high', 'quality', 'empirical', 'studies', 'on', 'innovation', 'initiative', 'in', 'the', 'context', 'of', 'large', 'software', 'companies', 'a', 'total', 'of', '7', 'studies', 'are', 'conducted', 'in', 'such', 'context', 'which', 'reported', '5', 'types', 'of', 'initiatives', 'intrapreneurship', 'bootlegging', 'internal', 'venture', 'spinoff', 'and', 'crowdsourcing', 'our', 'study', 'offers', 'three', 'contributions', 'first', 'this', 'paper', 'represents', 'the', 'map', 'of', 'existing', 'literature', 'on', 'innovation', 'initiatives', 'inside', 'large', 'companies', 'the', 'second', 'contribution', 'is', 'to', 'provide', 'an', 'innovation', 'initiative', 'tree', 'the', 'third', 'contribution', 'is', 'to', 'identify', 'key', 'challenges', 'faced', 'by', 'each', 'initiative', 'in', 'large', 'software', 'companies', 'at', 'the', 'strategic', 'and', 'tactical', 'levels', 'there', 'is', 'no', 'difference', 'between', 'large', 'software', 'companies', 'and', 'other', 'companies', 'at', 'the', 'operational', 'level', 'large', 'software', 'companies', 'are', 'highly', 'influenced', 'by', 'the', 'advancement', 'of', 'internet', 'technology', 'large', 'software', 'companies', 'use', 'open', 'innovation', 'paradigm', 'as', 'part', 'of', 'their', 'innovation', 'initiatives', 'we', 'envision', 'a', 'future', 'work', 'is', 'to', 'further', 'empirically', 'evaluate', 'the', 'innovation', 'initiative', 'tree', 'in', 'large', 'software', 'companies', 'which', 'involves', 'more', 'practitioners', 'from', 'different', 'companies']] | [-0.08373249273676756, 0.06026293932024443, -0.03175161074077181, 0.0526637747566769, -0.133994963678198, -0.0961809605213975, 0.07488354702516221, 0.3973140952648162, -0.22308153713919304, -0.3534629338084139, 0.1342275891220197, -0.30856209073896174, -0.13525745275213874, 0.20658049233965714, -0.13341482750542213, 0.012860748897963015, 0.07454188330342987, -0.032575104204977334, 0.037840504665786874, -0.3044754858970697, 0.29585104143484137, 0.0867662750866704, 0.37103258982829995, 0.09116562361471575, 0.05149227417868002, -0.06422654304196336, -0.13680405762595146, -0.041769676726668856, -0.1099172888944242, 0.22315410556892087, 0.379107704687678, 0.2150439066723044, 0.4419018571880196, -0.42424266597744065, -0.10833273062609632, 0.06446982984778186, 0.11557262383635084, 0.05540504415710268, -0.03881982468031871, -0.3171763141094827, 0.06152954868365739, -0.2567888969431779, -0.1572660457727764, -0.08273523290232648, 0.006479388766155692, 0.0027849444113431216, -0.21322293529060163, -0.05225120132661861, -0.024587266301784347, 0.114932025559384, 0.00420680404829748, -0.147199178240829, 0.007541291082339753, 0.2407602634404638, 0.13075080202596873, 0.026271052366230858, 0.1592156356475505, -0.1503516595045307, -0.16403363097795867, 0.36792692540014144, -0.02786282242217352, -0.1034990036069687, 0.20908692194538953, -0.09292186863507347, -0.1946721946497575, 0.06161311697008645, 0.2530042920845846, -0.0004181815845061891, -0.21467767854829445, 0.06521127932611337, 0.05262760476319195, 0.17248627309029324, 0.02142740638107852, -0.026204326846877395, 0.21304008185586848, 0.2481949593033298, 0.09514275321400144, 0.09873837011142864, 0.013851008452715634, -0.12250517928419545, -0.20965591909508205, -0.15617555404525263, -0.12907078176070128, 0.018513598724404123, -0.046783942525132, -0.15150201907256838, 0.3588999368635271, 0.1881474416833577, 0.08588948851018265, -0.0028579049143163536, 0.3292334593241395, 0.0030556111132581734, 0.13722672045309908, 0.07493489805086623, 0.18519980217093032, -0.011109683214174755, 0.1915999227383851, -0.13717952410218381, 0.11783148115328977, -0.0570282731669168] |
1,802.05952 | La costruzione di una scala musicale attraverso i numeri | The equable, Pythagorean and natural scales are built on the basis of a
mathematical logic.
| math.HO | the equable pythagorean and natural scales are built on the basis of a mathematical logic | [['the', 'equable', 'pythagorean', 'and', 'natural', 'scales', 'are', 'built', 'on', 'the', 'basis', 'of', 'a', 'mathematical', 'logic']] | [-0.10880442309592452, 0.07003254556496229, -0.12741743680089712, 0.15663349947759084, -0.16948185235794103, -0.050193224501396926, -0.011571966643844332, 0.279223544589643, -0.2970924936234951, -0.2699431447046144, 0.11392340373380908, -0.25626645872502457, -0.12058429765914168, 0.2289957720786333, -0.049279855630759685, 0.10501124383881688, -0.02494676098493593, 0.08970597343120192, -0.07179774377228958, -0.17388533827449595, 0.3373730074381456, 0.03669858856924942, 0.23402656960700238, -0.006608185092253345, 0.19461415069443838, -0.05104606046474406, -0.02026658771293504, 0.04748802472438131, -0.061997581872024705, 0.23274493111031397, 0.228684898731964, 0.22774664641890144, 0.30204515531659126, -0.503282847947308, -0.08933706229020442, -0.014999923695411001, 0.03496648527548781, 0.04864099648381982, -0.0038062837390628245, -0.26150549785234034, 0.010053347064448255, -0.11133444362453052, -0.024742432736924717, -0.0952443525727306, 0.10242232174745627, 0.06258776810552392, -0.24493245487766607, -0.03360743202002985, 0.1344903755400862, 0.1872706405286278, 0.04472272500528821, -0.1836226156779698, -0.02571384302739586, 0.06621310457454196, -0.0754740262137992, -0.033847753856597204, 0.14410019586128847, -0.001293247499104057, -0.1957252678860511, 0.4271713676197188, 0.01779593899846077, -0.22507376543113164, 0.16383473628333636, -0.10529110806861094, -0.179119858325326, -0.0017532516004783766, 0.12453573356781687, 0.11395747746740069, -0.13488487746300443, 0.1389916004305373, -0.10750770675284523, 0.25361225022269146, 0.17060469639753656, 0.06816126512629646, 0.24800875383828366, 0.23287913322980916, -0.004954913098897252, 0.06654844166977066, 0.005182986729778349, -0.16239079221018723, -0.3252802225095885, -0.14156083310289042, -0.18311157636344433, -0.008777473803742655, -0.08084430222827775, -0.25651096060339895, 0.4586446402328355, 0.11873330594971776, 0.13304103538393974, 0.15677050820418767, 0.23971555701323918, 0.11394301781963025, 0.15670787090701715, -0.022797097185892717, 0.1807422801586134, 0.14605934944536006, 0.07260529247910849, -0.0927369442901441, -0.009561608711789762, 0.09323126145838094] |
1,802.05953 | Weak Dynamic Coloring of Planar Graphs | The \textit{$k$-weak-dynamic number} of a graph $G$ is the smallest number of
colors we need to color the vertices of $G$ in such a way that each vertex $v$
of degree $d(v)$ sees at least $\rm{min}\{k,d(v)\}$ colors on its neighborhood.
We use reducible configurations and list coloring of graphs to prove that all
planar graphs have 3-weak-dynamic number at most 6.
| math.CO | the textitkweakdynamic number of a graph g is the smallest number of colors we need to color the vertices of g in such a way that each vertex v of degree dv sees at least rmminkdv colors on its neighborhood we use reducible configurations and list coloring of graphs to prove that all planar graphs have 3weakdynamic number at most 6 | [['the', 'textitkweakdynamic', 'number', 'of', 'a', 'graph', 'g', 'is', 'the', 'smallest', 'number', 'of', 'colors', 'we', 'need', 'to', 'color', 'the', 'vertices', 'of', 'g', 'in', 'such', 'a', 'way', 'that', 'each', 'vertex', 'v', 'of', 'degree', 'dv', 'sees', 'at', 'least', 'rmminkdv', 'colors', 'on', 'its', 'neighborhood', 'we', 'use', 'reducible', 'configurations', 'and', 'list', 'coloring', 'of', 'graphs', 'to', 'prove', 'that', 'all', 'planar', 'graphs', 'have', '3weakdynamic', 'number', 'at', 'most', '6']] | [-0.18430074837444158, 0.10650877426539002, -0.03174345634861624, -0.037548168327514855, -0.13305635054210393, -0.1270403014736828, 0.051201272113569854, 0.4446283715600469, -0.23579448226494074, -0.39207989141216565, 0.024167823948463875, -0.3742340376664852, -0.1173275687314313, 0.07495478611311009, -0.11771925550821269, -0.023614728059579523, 0.10743718143102937, 0.15237121704708914, 0.05705488229909077, -0.31271712841106786, 0.2981804765214951, -0.13802779154402428, 0.11613895367140528, 0.052017121631973265, 0.08687207602558593, 0.0498059824478395, 0.016417783211338622, 0.13101958188003507, -0.12223952216350129, 0.03649520965549966, 0.22468441429323163, 0.17158426479677316, 0.27062145337976257, -0.3455066553413354, -0.15066872755113733, 0.26117656135867384, 0.09122211084669006, 0.07414435940505616, 0.01084384937361204, -0.12563498125507913, 0.18016874706693764, -0.09474841101272714, -0.14083655743763365, 0.05843408875958191, 0.1718866190680399, 0.006942570835737319, -0.22498106058879658, -0.08246834887641258, 0.030582107153945957, 0.05379387064724518, 0.1358259813398412, -0.2158324703381493, -0.1280747371051332, 0.1353440757856929, -0.08757223110597838, 0.10034063536320524, 0.015204242575142917, -0.19469790759994166, -0.15006286962407417, 0.3915007207221512, -0.011789822485297918, -0.11878162306926117, 0.1806689103290535, -0.16734890400528393, -0.2024052693380107, 0.12115626828343576, 0.14289374193497772, 0.16714438805677767, -0.08766268644128637, 0.08292764977547983, -0.11479781411592206, 0.10706743591561399, 0.1336466441862285, 0.07696524788304393, 0.1554651675135668, 0.11289913534058323, 0.19116155805210744, 0.13164497587572913, -0.04487095099215492, 0.1032815480781398, -0.3529733396295843, -0.07075675747935371, -0.24400877221367032, 0.03898420912245738, -0.201336640679701, -0.17409933955761894, 0.4643814794333844, 0.15360945527409686, 0.20676487571848878, 0.09732770572962432, 0.21241153526152, 0.048074692327143814, 0.09499190547423245, 0.21220936575615457, 0.10637825178303595, 0.16214970152439742, -0.06003108989158324, -0.18868015431156704, 0.017374037399663235, 0.17006671513784036] |
1,802.05954 | Dynamics of decoherence of an entangled pair of qubits locally connected
to a one-dimensional disordered spin chain | We study the non-equilibrium evolution of concurrence of a Bell pair
constituted of two qubits, through the measurement of Loschmidt echo (LE) under
the scope of generalized central spin model. Having detected the Griffiths
phase via derivative of LE in equilibrium, we show that in the non-equilibrium
situation, the spin chain requires a temporal window to realize the effect of
disorder. We show that within this timescale, LE falls off exponentially and
this decay is maximally controlled by the initial states and coupling strength.
Our detail investigation suggests that there actually exist three types of
exponential decay, a Gaussian decay in ultra short time scale followed by two
exponential decay in the intermediate time with two different decay exponents.
The effect of the disorder starts appearing in the late time power law fall of
LE where the power law exponent is strongly dependent on disorder strength and
the final state but almost independent of initial states and coupling strength.
This feature allows us to indicate the presence of Griffiths phase. To be
precise, continuously varying critical exponent and wide distribution of
relaxation time imprint their effect in LE in the late time limit where the
power law fall is absent for quenching to a Griffiths phase. Here, LE vanishes
following the fast exponential fall. Interestingly, for off-critical quenching
LE attains a higher saturation value for increasing disorder strength,
otherwise vanishes for a clean spin chain, referring to the fact that disorder
prohibits the rapid decay of entanglement in long time limit. Moreover, we show
that disorder is also able to destroy the light cone like nature of post quench
quasi-particles as LE does not sense the singular time scales appearing for
clean spin chain with qubits coupled at symmetric positions.
| cond-mat.mes-hall cond-mat.stat-mech quant-ph | we study the nonequilibrium evolution of concurrence of a bell pair constituted of two qubits through the measurement of loschmidt echo le under the scope of generalized central spin model having detected the griffiths phase via derivative of le in equilibrium we show that in the nonequilibrium situation the spin chain requires a temporal window to realize the effect of disorder we show that within this timescale le falls off exponentially and this decay is maximally controlled by the initial states and coupling strength our detail investigation suggests that there actually exist three types of exponential decay a gaussian decay in ultra short time scale followed by two exponential decay in the intermediate time with two different decay exponents the effect of the disorder starts appearing in the late time power law fall of le where the power law exponent is strongly dependent on disorder strength and the final state but almost independent of initial states and coupling strength this feature allows us to indicate the presence of griffiths phase to be precise continuously varying critical exponent and wide distribution of relaxation time imprint their effect in le in the late time limit where the power law fall is absent for quenching to a griffiths phase here le vanishes following the fast exponential fall interestingly for offcritical quenching le attains a higher saturation value for increasing disorder strength otherwise vanishes for a clean spin chain referring to the fact that disorder prohibits the rapid decay of entanglement in long time limit moreover we show that disorder is also able to destroy the light cone like nature of post quench quasiparticles as le does not sense the singular time scales appearing for clean spin chain with qubits coupled at symmetric positions | [['we', 'study', 'the', 'nonequilibrium', 'evolution', 'of', 'concurrence', 'of', 'a', 'bell', 'pair', 'constituted', 'of', 'two', 'qubits', 'through', 'the', 'measurement', 'of', 'loschmidt', 'echo', 'le', 'under', 'the', 'scope', 'of', 'generalized', 'central', 'spin', 'model', 'having', 'detected', 'the', 'griffiths', 'phase', 'via', 'derivative', 'of', 'le', 'in', 'equilibrium', 'we', 'show', 'that', 'in', 'the', 'nonequilibrium', 'situation', 'the', 'spin', 'chain', 'requires', 'a', 'temporal', 'window', 'to', 'realize', 'the', 'effect', 'of', 'disorder', 'we', 'show', 'that', 'within', 'this', 'timescale', 'le', 'falls', 'off', 'exponentially', 'and', 'this', 'decay', 'is', 'maximally', 'controlled', 'by', 'the', 'initial', 'states', 'and', 'coupling', 'strength', 'our', 'detail', 'investigation', 'suggests', 'that', 'there', 'actually', 'exist', 'three', 'types', 'of', 'exponential', 'decay', 'a', 'gaussian', 'decay', 'in', 'ultra', 'short', 'time', 'scale', 'followed', 'by', 'two', 'exponential', 'decay', 'in', 'the', 'intermediate', 'time', 'with', 'two', 'different', 'decay', 'exponents', 'the', 'effect', 'of', 'the', 'disorder', 'starts', 'appearing', 'in', 'the', 'late', 'time', 'power', 'law', 'fall', 'of', 'le', 'where', 'the', 'power', 'law', 'exponent', 'is', 'strongly', 'dependent', 'on', 'disorder', 'strength', 'and', 'the', 'final', 'state', 'but', 'almost', 'independent', 'of', 'initial', 'states', 'and', 'coupling', 'strength', 'this', 'feature', 'allows', 'us', 'to', 'indicate', 'the', 'presence', 'of', 'griffiths', 'phase', 'to', 'be', 'precise', 'continuously', 'varying', 'critical', 'exponent', 'and', 'wide', 'distribution', 'of', 'relaxation', 'time', 'imprint', 'their', 'effect', 'in', 'le', 'in', 'the', 'late', 'time', 'limit', 'where', 'the', 'power', 'law', 'fall', 'is', 'absent', 'for', 'quenching', 'to', 'a', 'griffiths', 'phase', 'here', 'le', 'vanishes', 'following', 'the', 'fast', 'exponential', 'fall', 'interestingly', 'for', 'offcritical', 'quenching', 'le', 'attains', 'a', 'higher', 'saturation', 'value', 'for', 'increasing', 'disorder', 'strength', 'otherwise', 'vanishes', 'for', 'a', 'clean', 'spin', 'chain', 'referring', 'to', 'the', 'fact', 'that', 'disorder', 'prohibits', 'the', 'rapid', 'decay', 'of', 'entanglement', 'in', 'long', 'time', 'limit', 'moreover', 'we', 'show', 'that', 'disorder', 'is', 'also', 'able', 'to', 'destroy', 'the', 'light', 'cone', 'like', 'nature', 'of', 'post', 'quench', 'quasiparticles', 'as', 'le', 'does', 'not', 'sense', 'the', 'singular', 'time', 'scales', 'appearing', 'for', 'clean', 'spin', 'chain', 'with', 'qubits', 'coupled', 'at', 'symmetric', 'positions']] | [-0.16253495902417164, 0.262168385566148, -0.10697826123435114, 0.06602535458353893, -0.0031510507170078826, -0.1792062254678779, 0.05686039187913311, 0.33090507864735313, -0.258764409033681, -0.24028346215149965, 0.06672079060547824, -0.26050015159100814, -0.07862010766141887, 0.16398187677600773, 0.030476987542552424, 0.022601951077050562, 0.004861618059382228, 0.01619823568918068, -0.08230768126146547, -0.22583011140211903, 0.3044662784632488, 0.02859035752962568, 0.28933062515992286, 0.06721271651712696, 0.05120111810412772, 0.04367292016696442, 0.03261184831659695, -0.011786847070646311, -0.14575240097537032, -0.019547655554247444, 0.1986908870772258, 0.047619526884051896, 0.24734105709297904, -0.39427026059510634, -0.17686323380932725, 0.1432332470009489, 0.18442784624599756, 0.11036215329739457, -0.02007816584242893, -0.270370213302045, 0.04955793401419089, -0.16109764981003286, -0.1628900922883045, -0.041505840703331194, 0.07633796575607668, 0.008103537569946513, -0.27257885998596665, 0.1665891800126952, 0.1060018338303178, 0.03649128847434346, -0.020082309636777138, -0.04929023951227809, -0.010248976118123993, 0.11254104031229809, 0.06858770985814647, 0.012646891480584725, 0.1591404694084335, -0.11566542142937923, -0.05765334456508722, 0.2915280589167478, -0.09918364273255754, -0.10482941145109462, 0.17597629141126728, -0.19827200639752093, -0.13209627060749535, 0.14571012158203617, 0.11467072705754304, 0.11282747422326417, -0.07567114628498153, 0.09695711392760759, 0.045474636103508284, 0.20771505752586406, 0.05649867100111241, 0.0862386587413092, 0.18344153997584664, 0.15048487132579763, 0.06336682294977122, 0.14808959265616883, -0.08404596800000631, -0.15518882985483726, -0.3039258594688927, -0.15311792817705408, -0.22023997267162235, 0.12216476241517049, -0.09419088587621507, -0.15294649820646336, 0.4071078238982691, 0.12790080391780756, 0.21622490276550424, 0.08108740731399378, 0.20394984394119217, 0.1227694040670156, 0.032785657551621314, 0.05986392023506, 0.26153078411448877, 0.1199112755864666, 0.10810357439331711, -0.2736336547847243, 0.08538243300281464, 0.026634529602296394] |
1,802.05955 | Modified Gauss-Bonnet Gravity with Radiating Fluids | The main purpose of this paper is to investigates structure scalars in the
context of $f(\mathcal{G}, T)$ gravity, where $\mathcal{G}$ is the Gauss-Bonnet
invariant and $T$ is the trace of stress energy tensor. For this aim, we have
considered the spherically symmetric spacetime and dissipative anisotropic
fluid coupled with radiation and heat ejecting shearing matter distributions.
We have found these scalar variables by orthogonally decomposing the Riemann
curvature tensor in $f(\mathcal{G}, T)$ gravity. Moreover, the evolution
equations of shear and expansion are also developed with the help of these
scalar functions. We have also analyzed these scalars by taking constant
$\mathcal{G}$ and $T$ for dust cloud. The physical behavior of structure
scalars for radiating matter distributions has been examined in the presence of
modified gravity. It is shown that the evolutionary stages of relativistic
stellar structures can be explored via modified scalar functions.
| gr-qc | the main purpose of this paper is to investigates structure scalars in the context of fmathcalg t gravity where mathcalg is the gaussbonnet invariant and t is the trace of stress energy tensor for this aim we have considered the spherically symmetric spacetime and dissipative anisotropic fluid coupled with radiation and heat ejecting shearing matter distributions we have found these scalar variables by orthogonally decomposing the riemann curvature tensor in fmathcalg t gravity moreover the evolution equations of shear and expansion are also developed with the help of these scalar functions we have also analyzed these scalars by taking constant mathcalg and t for dust cloud the physical behavior of structure scalars for radiating matter distributions has been examined in the presence of modified gravity it is shown that the evolutionary stages of relativistic stellar structures can be explored via modified scalar functions | [['the', 'main', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'investigates', 'structure', 'scalars', 'in', 'the', 'context', 'of', 'fmathcalg', 't', 'gravity', 'where', 'mathcalg', 'is', 'the', 'gaussbonnet', 'invariant', 'and', 't', 'is', 'the', 'trace', 'of', 'stress', 'energy', 'tensor', 'for', 'this', 'aim', 'we', 'have', 'considered', 'the', 'spherically', 'symmetric', 'spacetime', 'and', 'dissipative', 'anisotropic', 'fluid', 'coupled', 'with', 'radiation', 'and', 'heat', 'ejecting', 'shearing', 'matter', 'distributions', 'we', 'have', 'found', 'these', 'scalar', 'variables', 'by', 'orthogonally', 'decomposing', 'the', 'riemann', 'curvature', 'tensor', 'in', 'fmathcalg', 't', 'gravity', 'moreover', 'the', 'evolution', 'equations', 'of', 'shear', 'and', 'expansion', 'are', 'also', 'developed', 'with', 'the', 'help', 'of', 'these', 'scalar', 'functions', 'we', 'have', 'also', 'analyzed', 'these', 'scalars', 'by', 'taking', 'constant', 'mathcalg', 'and', 't', 'for', 'dust', 'cloud', 'the', 'physical', 'behavior', 'of', 'structure', 'scalars', 'for', 'radiating', 'matter', 'distributions', 'has', 'been', 'examined', 'in', 'the', 'presence', 'of', 'modified', 'gravity', 'it', 'is', 'shown', 'that', 'the', 'evolutionary', 'stages', 'of', 'relativistic', 'stellar', 'structures', 'can', 'be', 'explored', 'via', 'modified', 'scalar', 'functions']] | [-0.16175015482944077, 0.19650978766303587, -0.10924143320066737, 0.07382829142636717, -0.08659028606098536, -0.12471200704861146, -0.12066650679058206, 0.34573033323732916, -0.23505201688283808, -0.27766937481148257, 0.049633270687215236, -0.22339048452831647, -0.12764907428193706, 0.09973323077673314, 0.012053962757850027, 0.0498740172560711, -0.020769190726235145, 0.03198501783247282, -0.04794644947502424, -0.2507816565001605, 0.41429919008347954, 0.06414903101830424, 0.20140169401998287, 0.03460276193250869, 0.09466362128464076, -0.055119915739991344, -0.06678584543662472, 0.06286348123754655, -0.1688898400262823, 0.04518480855528708, 0.19288821727480296, 0.08498884327351473, 0.1951514683741998, -0.4178352197306556, -0.2738794051045617, 0.1095840782435917, 0.12427906496971325, 0.06404369004344294, -0.06490754155715654, -0.25423309965046137, 0.09445539594569302, -0.17908588173584297, -0.11474718921980658, -0.06527629515182201, 0.043850367348250395, -0.019977596700777644, -0.24661702663113422, 0.10863439548211953, 0.04182929065814437, -0.009348181056809592, -0.0930559281878486, -0.1118855457166796, -0.05750247851417927, 0.06270305476952474, 0.10767125965330515, 0.01985995412862801, 0.13952099924607503, -0.1396709441213862, -0.03696679309827855, 0.3894534355771917, -0.14762442667784484, -0.2525395636114624, 0.1503656235217423, -0.16282197252938432, -0.13480944549860238, 0.08125744185937972, 0.17032930663285348, 0.16295398377090484, -0.18694945001548116, 0.18022460346329972, -0.006720060730105513, 0.08606936595926934, 0.11013210205022585, 0.005358566526792475, 0.279428527644881, 0.07752597371077204, -0.011507229659693329, 0.17624244297662475, -0.04309222637512884, -0.1053588543986003, -0.3425812075481183, -0.18991496689923734, -0.1354659501482713, 0.07714311089659748, -0.1380255241658322, -0.14401328596966242, 0.36602040547617043, 0.09421903764425249, 0.11418443914971776, 0.034634714392567434, 0.25055373062776937, 0.12650908037394912, 0.06808524238030342, 0.13099001773300914, 0.28159410452756745, 0.2152488268162873, 0.11817602861926636, -0.24464933794818922, 0.0009797538949788867, 0.0815072729988219] |
1,802.05956 | Exhaustive existence and non-existence results for some prototype
polyharmonic equations in the whole space | In this paper, we are interested in entire, non-trivial, non-negative
solutions and/or entire, positive solutions to the simplest models of
polyharmonic equations with power-type nonlinearity \[ \Delta^m u = \pm
u^{\alpha} \quad \text{ in } \mathbb R^n \] with $n \geqslant 1$, $m \geqslant
1$, and $\alpha \in \mathbb R$. We aim to study the existence and non-existence
of such classical solutions to the above equations in the full range of the
constants $n$, $m$ and $\alpha$. Remarkably, we are able to provide necessary
and sufficient conditions on the exponent $\alpha$ to guarantee the existence
of such solutions in $\mathbb R^n$. Finally, we identify all the situations
where any entire non-trivial, non-negative classical solution must be positive.
| math.AP | in this paper we are interested in entire nontrivial nonnegative solutions andor entire positive solutions to the simplest models of polyharmonic equations with powertype nonlinearity deltam u pm ualpha quad text in mathbb rn with n geqslant 1 m geqslant 1 and alpha in mathbb r we aim to study the existence and nonexistence of such classical solutions to the above equations in the full range of the constants n m and alpha remarkably we are able to provide necessary and sufficient conditions on the exponent alpha to guarantee the existence of such solutions in mathbb rn finally we identify all the situations where any entire nontrivial nonnegative classical solution must be positive | [['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'entire', 'nontrivial', 'nonnegative', 'solutions', 'andor', 'entire', 'positive', 'solutions', 'to', 'the', 'simplest', 'models', 'of', 'polyharmonic', 'equations', 'with', 'powertype', 'nonlinearity', 'deltam', 'u', 'pm', 'ualpha', 'quad', 'text', 'in', 'mathbb', 'rn', 'with', 'n', 'geqslant', '1', 'm', 'geqslant', '1', 'and', 'alpha', 'in', 'mathbb', 'r', 'we', 'aim', 'to', 'study', 'the', 'existence', 'and', 'nonexistence', 'of', 'such', 'classical', 'solutions', 'to', 'the', 'above', 'equations', 'in', 'the', 'full', 'range', 'of', 'the', 'constants', 'n', 'm', 'and', 'alpha', 'remarkably', 'we', 'are', 'able', 'to', 'provide', 'necessary', 'and', 'sufficient', 'conditions', 'on', 'the', 'exponent', 'alpha', 'to', 'guarantee', 'the', 'existence', 'of', 'such', 'solutions', 'in', 'mathbb', 'rn', 'finally', 'we', 'identify', 'all', 'the', 'situations', 'where', 'any', 'entire', 'nontrivial', 'nonnegative', 'classical', 'solution', 'must', 'be', 'positive']] | [-0.1912964491618682, 0.052252287168748086, 0.046622378321001884, 0.02025129743625072, -0.06098210153147265, -0.19237072479012793, -0.04154169859170947, 0.30440893685197934, -0.2674583062216376, -0.23008596127341807, 0.1382695051791987, -0.35529949504107367, -0.12015193394607807, 0.14956056525667025, -0.04276717782836506, 0.08983241547459522, -0.027201974580056174, 0.06589321771340931, -0.08472437885913388, -0.26539114117622375, 0.3400911796936947, -0.12068721325655954, 0.13464107617439158, 0.045755177011004594, 0.07174089378563984, -0.06680102141953148, 0.047648542220663045, -0.02493866970319614, -0.30370994234474097, 0.03656781729788775, 0.267200546340603, 0.10799488956026271, 0.2768712638077878, -0.38963360772097266, -0.1603036046129099, 0.2386165545445628, 0.18089605403849773, -0.017924071400863145, -0.0018450082784551567, -0.2686875744689816, 0.18488381276385182, -0.06546278106279474, -0.20934040209822422, -0.06803822089645979, 0.10285804844337755, 0.0876868149426362, -0.3673988001511754, 0.08602214660660355, 0.10881265890434286, -0.005189358866649919, -0.1507205325178802, -0.1331624861011298, -0.007288110697955157, 0.10992257412424129, 0.037124816785706616, 0.07591993378195087, -0.027159610641625736, -0.09758925678381548, -0.020224834206118453, 0.3615053670761068, -0.10752457099507225, -0.2814798568400134, 0.14595380575247768, -0.2321015051030348, -0.1512469261579743, 0.10453303497845093, 0.1512712272114854, 0.18195419145368896, -0.07785989369257493, 0.21951334773402134, -0.048232507347994676, 0.1926864556374803, 0.09088747836319747, 0.014951333024464877, 0.10147753389206081, 0.054254661132869995, 0.1112050612444734, 0.07997353707308329, 7.80586058488198e-05, -0.03964922206674134, -0.39337789979392446, -0.1356281372553677, -0.11897309987488475, 0.18024478417582215, -0.13738876435260775, -0.1446649156906436, 0.33160859678534016, 0.11920047322580739, 0.18166165228570458, 0.08745175387413628, 0.178920904569538, 0.10055012878419964, -0.03424110833918099, 0.09671199503890444, 0.1293669963436844, 0.09735170401739929, 0.10806641501036629, -0.18090985009067617, -0.0017400073645784792, 0.08551099914150824] |
1,802.05957 | Spectral Normalization for Generative Adversarial Networks | One of the challenges in the study of generative adversarial networks is the
instability of its training. In this paper, we propose a novel weight
normalization technique called spectral normalization to stabilize the training
of the discriminator. Our new normalization technique is computationally light
and easy to incorporate into existing implementations. We tested the efficacy
of spectral normalization on CIFAR10, STL-10, and ILSVRC2012 dataset, and we
experimentally confirmed that spectrally normalized GANs (SN-GANs) is capable
of generating images of better or equal quality relative to the previous
training stabilization techniques.
| cs.LG cs.CV stat.ML | one of the challenges in the study of generative adversarial networks is the instability of its training in this paper we propose a novel weight normalization technique called spectral normalization to stabilize the training of the discriminator our new normalization technique is computationally light and easy to incorporate into existing implementations we tested the efficacy of spectral normalization on cifar10 stl10 and ilsvrc2012 dataset and we experimentally confirmed that spectrally normalized gans sngans is capable of generating images of better or equal quality relative to the previous training stabilization techniques | [['one', 'of', 'the', 'challenges', 'in', 'the', 'study', 'of', 'generative', 'adversarial', 'networks', 'is', 'the', 'instability', 'of', 'its', 'training', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'weight', 'normalization', 'technique', 'called', 'spectral', 'normalization', 'to', 'stabilize', 'the', 'training', 'of', 'the', 'discriminator', 'our', 'new', 'normalization', 'technique', 'is', 'computationally', 'light', 'and', 'easy', 'to', 'incorporate', 'into', 'existing', 'implementations', 'we', 'tested', 'the', 'efficacy', 'of', 'spectral', 'normalization', 'on', 'cifar10', 'stl10', 'and', 'ilsvrc2012', 'dataset', 'and', 'we', 'experimentally', 'confirmed', 'that', 'spectrally', 'normalized', 'gans', 'sngans', 'is', 'capable', 'of', 'generating', 'images', 'of', 'better', 'or', 'equal', 'quality', 'relative', 'to', 'the', 'previous', 'training', 'stabilization', 'techniques']] | [-0.037325680690158285, -0.00022597533253052932, -0.08876994027222475, 0.08762628085168309, -0.10767142991587687, -0.16399376680341998, 0.028452892809991172, 0.4715425050241894, -0.2490601535321454, -0.3103022828614444, 0.04484404447185022, -0.23474885717431984, -0.17074534086918647, 0.20100976612282853, -0.16947976510260213, 0.114015891100934, 0.125715464620401, -0.012640144464068031, -0.05960694513887983, -0.3147979113744216, 0.3400133793566669, 0.06270154313448545, 0.3774649765619778, 0.018179171901782244, 0.12387956889722956, -0.07030790127039457, -0.02027823084316562, -0.04864209474932946, -0.07865061824188078, 0.20180157948484162, 0.20949058741163673, 0.21477458566385374, 0.32945397464830556, -0.3624338726199159, -0.18742474028317446, 0.12045255812994216, 0.14009431707725095, 0.09629767084640733, -0.04951091640330642, -0.2878934436666078, 0.14647805572518807, -0.1371539615806234, -0.014976206266980492, -0.1851086448040906, -0.06610640133024727, -0.011073763109481988, -0.3163143461256215, 0.045833780173882004, 0.09790393510178383, 0.03112086947756202, -0.04332656460013659, -0.12448172230440914, 0.006427479104735376, 0.12128668160993983, 0.03500020843302685, 0.03504321391673319, 0.09028850808697805, -0.1749442291126869, -0.12467502807842547, 0.3299014921185006, -0.08157820034814015, -0.18026525558631742, 0.15080138326235368, -0.01798846357073007, -0.1326093687309643, 0.1060052163940802, 0.22067481513250242, 0.13554688170552254, -0.12008772638699647, -0.01390970856398658, 0.006182082545462201, 0.19862529020390232, 0.05949838338105866, -0.015032969347169895, 0.10710690197733681, 0.26526453538557115, 0.011669038208934028, 0.20488660311682172, -0.17625074777909125, -0.010277779418399578, -0.2395259383320285, -0.11595350941852405, -0.21993017527327108, 0.017197752120287232, -0.08829131836985274, -0.16455625822202544, 0.4608796284314287, 0.2440077313849849, 0.2339977894313215, 0.11524611491751804, 0.3935487453689736, 0.029149439328433842, 0.12683404807859425, 0.0462059407767034, 0.21709452816049746, 0.06682540793390421, 0.0841063483869343, -0.21074526411026004, 0.05732448108584536, 0.03683822983457299] |
1,802.05958 | - Gravitational Waves - A Review on the Conceptual Foundations of
Gravitational Radiation | In this manuscript we review the theoretical foundations of gravitational
waves in the framework of Albert Einstein's theory of general relativity.
Following Einstein's early efforts we first derive the linearised Einstein
field equations and work out the corresponding gravitational wave equation.
Moreover we present the gravitational potentials in the far away wave zone
field point approximation obtained from the relaxed Einstein field equations.
We close this review by taking a closer look on the radiative losses of
gravitating $n$-body systems and present some aspects of the current
interferometric gravitational waves detectors. Each section posses a separate
appendix-contribution where further computational details are displayed. To
conclude we summarize the main results and present a brief outlook in terms of
current ongoing efforts to build a spaced based gravitational wave observatory.
| gr-qc | in this manuscript we review the theoretical foundations of gravitational waves in the framework of albert einsteins theory of general relativity following einsteins early efforts we first derive the linearised einstein field equations and work out the corresponding gravitational wave equation moreover we present the gravitational potentials in the far away wave zone field point approximation obtained from the relaxed einstein field equations we close this review by taking a closer look on the radiative losses of gravitating nbody systems and present some aspects of the current interferometric gravitational waves detectors each section posses a separate appendixcontribution where further computational details are displayed to conclude we summarize the main results and present a brief outlook in terms of current ongoing efforts to build a spaced based gravitational wave observatory | [['in', 'this', 'manuscript', 'we', 'review', 'the', 'theoretical', 'foundations', 'of', 'gravitational', 'waves', 'in', 'the', 'framework', 'of', 'albert', 'einsteins', 'theory', 'of', 'general', 'relativity', 'following', 'einsteins', 'early', 'efforts', 'we', 'first', 'derive', 'the', 'linearised', 'einstein', 'field', 'equations', 'and', 'work', 'out', 'the', 'corresponding', 'gravitational', 'wave', 'equation', 'moreover', 'we', 'present', 'the', 'gravitational', 'potentials', 'in', 'the', 'far', 'away', 'wave', 'zone', 'field', 'point', 'approximation', 'obtained', 'from', 'the', 'relaxed', 'einstein', 'field', 'equations', 'we', 'close', 'this', 'review', 'by', 'taking', 'a', 'closer', 'look', 'on', 'the', 'radiative', 'losses', 'of', 'gravitating', 'nbody', 'systems', 'and', 'present', 'some', 'aspects', 'of', 'the', 'current', 'interferometric', 'gravitational', 'waves', 'detectors', 'each', 'section', 'posses', 'a', 'separate', 'appendixcontribution', 'where', 'further', 'computational', 'details', 'are', 'displayed', 'to', 'conclude', 'we', 'summarize', 'the', 'main', 'results', 'and', 'present', 'a', 'brief', 'outlook', 'in', 'terms', 'of', 'current', 'ongoing', 'efforts', 'to', 'build', 'a', 'spaced', 'based', 'gravitational', 'wave', 'observatory']] | [-0.1630950525541266, 0.05868537643164018, -0.08788078813449829, 0.07514526835439028, -0.12673514262860408, -0.059398985218194866, -0.023163139626376505, 0.2874078410495713, -0.1853214797538385, -0.26025894283884554, 0.0779367642098805, -0.27514326832897495, -0.17982757260324433, 0.17802969981494243, 0.008992634946480393, 0.038880208652699366, 0.08222341857435822, 0.010422219005704392, -0.1139034289681149, -0.22715345365577377, 0.35262038511791616, 0.1074657095305156, 0.2018518334152759, 0.014066154639294837, 0.08467055753135355, -0.02293749140210366, -0.09825419204207719, 0.027178890642971965, -0.19827958771929843, 0.08645626589714084, 0.2510341437664465, 0.15694934017960804, 0.28618047165946336, -0.5251723335823044, -0.22046653727738885, 0.02552095159444434, 0.10056772092866595, 0.21622725877386983, -0.06902990481921734, -0.3603175592288608, -0.0036109722568653524, -0.17387266662990442, -0.19059919033679762, 5.978052649879828e-05, 0.03845237973109761, 0.04041465407291156, -0.1428146726484556, 0.042039652878884226, 0.04016295123074087, 0.006807970525187557, -0.12051408186016488, -0.12179765896325989, 0.052728111084434204, 0.05222185653838096, 0.09423902725393418, 0.07762722257211863, 0.12387217728974065, -0.12403915162940393, -0.08753848643391393, 0.4122036917688092, -0.10602146400924539, -0.15869243831548374, 0.14844527937111707, -0.19052222004029318, -0.1391473398616654, 0.10993132326984778, 0.189146164639169, 0.12490127825185482, -0.18745749745721696, 0.09424978051038124, 0.01073000082794806, 0.12151872801518948, 0.0853083040092315, 0.02577602998144357, 0.3310425359632063, 0.1483530092446017, -0.0033035005690180697, 0.1107979252055884, -0.05683275762021367, -0.09306009340798482, -0.3942417459911667, -0.12060123814808321, -0.10905652343171823, 0.08938646701346897, -0.016861896776049434, -0.12074521556434092, 0.39369093010463985, 0.2323852366716892, 0.0857180529856123, 0.0648470575670217, 0.30715186512679793, 0.10638408689464995, -0.02039931953549967, 0.0685356240846886, 0.3713943432205724, 0.16205983345025743, 0.16547378164250404, -0.19312741899375396, -0.07240125480166171, 0.07139495579531285] |
1,802.05959 | Grant-less Uplink Transmission for LTE Operated in Unlicensed Spectrum | Deployment of Long Term Evolution (LTE) in unlicensed spectrum has been a
candidate feature to meet the explosive growth of traffic demand since 3GPP
release 13. To further explore the advantage of unlicensed bands, in this
context the operation of both uplink and downlink has been supported and
studied in the subsequent releases. However, it has been identified that
scheduled uplink transmission performance in unlicensed spectrum is
significantly degraded due to the double listen-before-talk (LBT) requirements
at both eNB when sending the uplink grant, and at the scheduled UEs before
transmission. In this paper, in order to overcome this issue, a novel uplink
transmission scheme, which does not require any grant, is proposed, and the
details regarding the system design are provided. By modeling the dynamics in
time of the LBT for both a system that employs a conventional uplink scheme, as
well as the proposed scheme, it is verified through analytical evaluation that
the double LBT scheme for uplink transmission greatly reduces the channel
access probability for the UE, and leads consequently to performance loss,
while the proposed scheme is able to alleviate this issue. System level
simulation results, compliant with the LTE standard, show that the proposed
scheme can achieve a significant performance gain in terms of throughput with
negligible performance loss for the downlink, and other technologies operating
in the same spectrum.
| eess.SP cs.IT math.IT | deployment of long term evolution lte in unlicensed spectrum has been a candidate feature to meet the explosive growth of traffic demand since 3gpp release 13 to further explore the advantage of unlicensed bands in this context the operation of both uplink and downlink has been supported and studied in the subsequent releases however it has been identified that scheduled uplink transmission performance in unlicensed spectrum is significantly degraded due to the double listenbeforetalk lbt requirements at both enb when sending the uplink grant and at the scheduled ues before transmission in this paper in order to overcome this issue a novel uplink transmission scheme which does not require any grant is proposed and the details regarding the system design are provided by modeling the dynamics in time of the lbt for both a system that employs a conventional uplink scheme as well as the proposed scheme it is verified through analytical evaluation that the double lbt scheme for uplink transmission greatly reduces the channel access probability for the ue and leads consequently to performance loss while the proposed scheme is able to alleviate this issue system level simulation results compliant with the lte standard show that the proposed scheme can achieve a significant performance gain in terms of throughput with negligible performance loss for the downlink and other technologies operating in the same spectrum | [['deployment', 'of', 'long', 'term', 'evolution', 'lte', 'in', 'unlicensed', 'spectrum', 'has', 'been', 'a', 'candidate', 'feature', 'to', 'meet', 'the', 'explosive', 'growth', 'of', 'traffic', 'demand', 'since', '3gpp', 'release', '13', 'to', 'further', 'explore', 'the', 'advantage', 'of', 'unlicensed', 'bands', 'in', 'this', 'context', 'the', 'operation', 'of', 'both', 'uplink', 'and', 'downlink', 'has', 'been', 'supported', 'and', 'studied', 'in', 'the', 'subsequent', 'releases', 'however', 'it', 'has', 'been', 'identified', 'that', 'scheduled', 'uplink', 'transmission', 'performance', 'in', 'unlicensed', 'spectrum', 'is', 'significantly', 'degraded', 'due', 'to', 'the', 'double', 'listenbeforetalk', 'lbt', 'requirements', 'at', 'both', 'enb', 'when', 'sending', 'the', 'uplink', 'grant', 'and', 'at', 'the', 'scheduled', 'ues', 'before', 'transmission', 'in', 'this', 'paper', 'in', 'order', 'to', 'overcome', 'this', 'issue', 'a', 'novel', 'uplink', 'transmission', 'scheme', 'which', 'does', 'not', 'require', 'any', 'grant', 'is', 'proposed', 'and', 'the', 'details', 'regarding', 'the', 'system', 'design', 'are', 'provided', 'by', 'modeling', 'the', 'dynamics', 'in', 'time', 'of', 'the', 'lbt', 'for', 'both', 'a', 'system', 'that', 'employs', 'a', 'conventional', 'uplink', 'scheme', 'as', 'well', 'as', 'the', 'proposed', 'scheme', 'it', 'is', 'verified', 'through', 'analytical', 'evaluation', 'that', 'the', 'double', 'lbt', 'scheme', 'for', 'uplink', 'transmission', 'greatly', 'reduces', 'the', 'channel', 'access', 'probability', 'for', 'the', 'ue', 'and', 'leads', 'consequently', 'to', 'performance', 'loss', 'while', 'the', 'proposed', 'scheme', 'is', 'able', 'to', 'alleviate', 'this', 'issue', 'system', 'level', 'simulation', 'results', 'compliant', 'with', 'the', 'lte', 'standard', 'show', 'that', 'the', 'proposed', 'scheme', 'can', 'achieve', 'a', 'significant', 'performance', 'gain', 'in', 'terms', 'of', 'throughput', 'with', 'negligible', 'performance', 'loss', 'for', 'the', 'downlink', 'and', 'other', 'technologies', 'operating', 'in', 'the', 'same', 'spectrum']] | [-0.19948470753100184, -0.0017079863547244006, -0.028325984831899405, -0.005529686409152216, -0.04170651142071519, -0.2121520345355384, 0.11754462230743633, 0.4008723231818941, -0.23756474807030625, -0.29764088328099914, 0.10444936951001485, -0.21581564257749253, -0.14919032567491133, 0.16151071367164452, -0.11889127117064265, 0.07975784741031627, 0.10578075280878693, 0.0155467164526797, -0.012197289313707086, -0.2961169537125776, 0.2611213442693568, 0.17632199541976054, 0.41397987614903187, 0.05968827047695716, 0.05261953862687935, 0.000160675546568301, -0.03440387043274111, -0.0641062468621466, -0.060832836703112764, 0.0499246648264428, 0.2960080855877863, 0.1700530871635096, 0.299037143761913, -0.41519318718049264, -0.3022217022529286, 0.06674792195618566, 0.18871075360259662, 0.022520098379399212, -0.05369810410464804, -0.2478447165712714, 0.15888662483439678, -0.26933600343349906, -0.058740887694681686, -0.003258081824104819, -0.07747972410586146, 0.022239081336346216, -0.3396527702506218, -0.005568356787682407, -0.006996514163393941, 0.012606315980147983, -0.05539172558941775, -0.06890743115244226, -0.019303014302212332, 0.18864359304735748, 0.03932752477419045, -0.023281387720231174, 0.039653294781843824, -0.0976497111759252, -0.09502463221343027, 0.42049939847654766, -0.030375082349508174, -0.17793708904749816, 0.15964163441443815, -0.11182554864376369, -0.07993102267177568, 0.17107910276183652, 0.20745311934087013, 0.018663250859826803, -0.20508181960975183, 0.05686696318133424, 0.05056981735552351, 0.17270449756023784, 0.07246271879722675, 0.12165235456958827, 0.1499107230703036, 0.21561135829219388, 0.10435422277284993, 0.09037797386576939, -0.14011420717566378, -0.10166548942526181, -0.20819993845290607, -0.12794417289810048, -0.19361305684886046, 0.0027418410377706296, 0.0007139593283904509, -0.057031261136807086, 0.38134470067843923, 0.16573457713859777, 0.11450522726919088, 0.0840470447924195, 0.4077034275813235, 0.12009110163276394, 0.10469510165974498, 0.11831647898752837, 0.2395730439470046, 0.034359465818852186, 0.2132460421204774, -0.2539792629165782, 0.05155529825223817, -0.007020327626831002] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.